Reuse, not rework
Home

License Awareness



Highly Reusable Software

By activity
Professions, Sciences, Humanities, Business, ...

User Interface
Text-based, GUI, Audio, Video, Keyboards, Mouse, Images,...

Text Strings
Conversions, tests, processing, manipulation,...

Math
Integer, Floating point, Matrix, Statistics, Boolean, ...

Processing
Algorithms, Memory, Process control, Debugging, ...

Stored Data
Data storage, Integrity, Encryption, Compression, ...

Communications
Networks, protocols, Interprocess, Remote, Client Server, ...

Hard World
Timing, Calendar and Clock, Audio, Video, Printer, Controls...

File System
Management, Filtering, File & Directory access, Viewers, ...


NAME

librock_BTSinlist - Find a blank terminated word in a word list.

#License - #Source code - #Example Use -

SYNOPSIS

#include <librock/parse.h>

int
librock_BTSinlist(const char *bts,const char *list);

DESCRIPTION

Finds a word in a space- or tab-separated word list. Returns an integer corresponding to the position in the list. Returns 0 if not found.

Typical use is to recognize keywords from a list.

#ifdef librock_TYPICAL_USE_BTSinlist
    char *keywords ="one two three four";
    int i;
    i = librock_BTSinlist("one",keywords);
    if (i) {
        printf("Found at word %d\n",i);
    } else {
        printf("Did not recognize\n");
    }
#endif

USES

  librock_wordcmp()
  librock_countbl() librock_counttowh()

LICENSE

  Copyright 1998-2004 Forrest J. Cavalier III, http://www.mibsoftware.com
  Open-source under MIT license. NO WARRANTY. Copies must retain this block.
  License, originals, details: http://www.mibsoftware.com/librock/

Source Code

./text/compsearch/strfn.c (implementation, plus source of this manual page)

This software is part of Librock

Rapid reuse, without rework. Details
This page copyright (C) 2002-2004 Forrest J. Cavalier III, d-b-a Mib Software, Saylorsburg PA 18353, USA

Verbatim copying and distribution of this generated page is permitted in any medium provided that no changes are made.
(The source of this manual page may be covered by a more permissive license which allows modifications.)

Want to help? We welcome comments, patches. -- Need help? Request paid support.