LSEARCH(3)LSEARCH(3)NAME
lsearch, lfind, - linear searching routines
SYNOPSIS
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 *));
DESCRIPTION
This interface was obsolete before it was written. It is available
from the compatibility library, libcompat.
The functions lsearch, and lfind provide basic linear searching func‐
tionality.
Base is the pointer to the beginning of an array. Nelp is the current
number of elements in the array, where each element is width bytes
long. Compar is a comparison routine which is used to compare two ele‐
ments. It is called with two arguments that point to the key object
and to an array member, in that order, and must return an integer less
than, equal to, or greater than zero if the key object is considered,
respectively, to be less than, equal to, or greater than the array mem‐
ber.
Lsearch and lfind 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.
SEE ALSObsearch(3), hsearch(3), tsearch(3)4.4 Berkeley Distribution June 23, 1990 LSEARCH(3)