LSEARCH(3) BSD Programmer's Manual LSEARCH(3)
lsearch, lfind - linear searching routines
char *
lsearch(const void *key, const void *base, size_t *nelp, size_t width,
int (*compar)(void *, void *));
char *
lfind(const void *key, const void *base, size_t *nelp, size_t width,
int (*compar)(void *, void *));
The functions lsearch() and lfind() provide basic linear searching func-
tionality.
base is the pointer to the beginning of an array. The argument nelp is
the current number of elements in the array, where each element is width
bytes long. The compar function is a comparison routine which is used to
compare two elements. It takes two arguments which point to the key ob-
ject and to an array member, in that order, and must return an integer
less than, equivalent to, or greater than zero if the key object is con-
sidered, respectively, to be less than, equal to, or greater than the ar-
ray member.
The lsearch() and lfind() functions return a pointer into the array
referenced by base where key is located. If key does not exist, lfind()
will return a null pointer and lsearch() will add it to the array. When
an element is added to the array by lsearch(), the location referenced by
the argument nelp is incremented by one.
bsearch(3), db(3)
The lsearch() and lfind() functions conform to the IEEE Std 1003.1-2001
("POSIX") and X/Open Portability Guide Issue 4.3 ("XPG4.3") specifica-
tions.
MirOS BSD #10-current June 4, 1993 1
Generated on 2012-02-20 02:47:02 by $MirOS: src/scripts/roff2htm,v 1.70 2011/12/03 18:21:12 tg Exp $
These manual pages and other documentation are copyrighted by their respective writers;
their source is available at our CVSweb,
AnonCVS, and other mirrors. The rest is Copyright © 2002‒2011 The MirOS Project, Germany.
This product includes material
provided by Thorsten Glaser.
This manual page’s HTML representation is supposed to be valid XHTML/1.1; if not, please send a bug report – diffs preferred.