search(5)                                                         search(5)

NAME
     search - search tables

SYNOPSIS
     #include <search.h>

DESCRIPTION
     The <search.h> header provides a type definition, ENTRY, for structure
     entry which includes the following members:

     char  *key
     void  *data

     and defines ACTION and VISIT as enumeration data types through type
     definitions as follows:

     enum { FIND, ENTER } ACTION;
     enum { preorder, postorder, endorder, leaf } VISIT;

     The sizet type is defined as described in <sys/types.h>.

     Each of the following is declared as a function, or defined as a
     macro, or both:

     int    hcreate(sizet nel);
     void   hdestroy(void);
     ENTRY *hsearch(ENTRY item, ACTION action);
     void   insque(void *element, void *pred);
     void  *lfind(const void *key, const void *base, sizet *nelp,
                  sizet width, int (*compar)(const void *, const void *));
     void  *lsearch(const void *key, void *base, sizet *nelp,
                  sizet width, int (*compar)(const void *, const void *));
     void   remque(void *element);
     void  *tdelete(const void *key, void **rootp,
                  int(*compar)(const void *, const void *));
     void  *tfind(const void *key, void *const *rootp,
                  int(*compar)(const void *, const void *));
     void  *tsearch(const void *key, void **rootp,
                  int(*compar)(const void *, const void *));
     void   twalk(const void *root,
                  void (*action)(const void *, VISIT, int ));

SEE ALSO
     hsearch(3C), insque(3C), lsearch(3C), remque(3C), tsearch(3C),
     types(5).










Page 1                       Reliant UNIX 5.44                Printed 11/98