LSEARCH(3C)             COMMAND REFERENCE             LSEARCH(3C)



NAME
     lsearch - linear search and update

SYNOPSIS
     char *lsearch ( (char *)key, (char *)base, nelp,
     sizeof(*key), compar )
     unsigned *nelp;
     int (*compar)( );

DESCRIPTION
     Lsearch is a linear search routine generalized from Knuth
     (6.1) Algorithm S.  It returns a pointer into a table
     indicating where a datum may be found.  If the datum does
     not occur, it is added at the end of the table.

     Key points to the datum to be sought in the table.

     Base points to the first element in the table.

     Nelp points to an integer containing the current number of
     elements in the table.  The integer is incremented if the
     datum is added to the table.

     Compar is the name of the comparison function which you must
     supply (strcmp, for example).  It is called with two
     arguments that point to the elements being compared.  The
     function must return 0 if the elements are equal and nonzero
     otherwise.

CAVEATS
     The pointers to the key and the element at the base of the
     table should be of type pointer-to-element, and cast to type
     pointer-to-character.

     The comparison function need not compare every byte, so
     arbitrary data may be contained in the elements in addition
     to the values being compared.

     Although declared as type pointer-to-character, the value
     returned should be cast into type pointer-to-element.

     Undefined results can occur if there is not enough room in
     the table to add a new item.

SEE ALSO
     bsearch(3c), hsearch(3c), intro(3), and tsearch(3c).









Printed 5/12/88                                                 1

%%index%%
na:336,86;
sy:422,1116;
de:1538,1067;
ca:2605,620;
se:3225,209;
%%index%%000000000097