PROLOG<\/a> This manual page is part of the POSIX Programmer\u2019s Manual. The Linux implementation of this interface may differ (consult the corresponding Linux manual page for details of Linux behavior), or the interface may not be implemented on Linux.<\/p>\n search.h \u2014 search tables<\/p>\n #include The char *key and shall define ACTION<\/b> and VISIT<\/b> as enumeration data types through type definitions as follows:<\/p>\n enum { FIND, ENTER } ACTION; The The following shall be declared as functions and may also be defined as macros. Function prototypes shall be provided.<\/p>\n int hcreate(size_t); The following sections are informative.<\/i><\/p>\n None.<\/p>\n None.<\/p>\n None.<\/p>\n
NAME<\/a>
SYNOPSIS<\/a>
DESCRIPTION<\/a>
APPLICATION USAGE<\/a>
RATIONALE<\/a>
FUTURE DIRECTIONS<\/a>
SEE ALSO<\/a>
COPYRIGHT<\/a> <\/p>\n
\nPROLOG <\/a> <\/h2>\n
NAME <\/a> <\/h2>\n
SYNOPSIS <\/a> <\/h2>\n
DESCRIPTION <\/a> <\/h2>\n
void *data<\/p>\n
enum { preorder, postorder, endorder, leaf } VISIT;<\/p>\n
void hdestroy(void);
ENTRY *hsearch(ENTRY, ACTION);
void insque(void *, void *);
void *lfind(const void *, const void *, size_t *,
size_t, int (*)(const void *, const void *));
void *lsearch(const void *, void *, size_t *,
size_t, int (*)(const void *, const void *));
void remque(void *);
void *tdelete(const void *restrict, void **restrict,
int(*)(const void *, const void *));
void *tfind(const void *, void *const *,
int(*)(const void *, const void *));
void *tsearch(const void *, void **,
int(*)(const void *, const void *));
void twalk(const void *,
void (*)(const void *, VISIT, int ));<\/p>\nAPPLICATION USAGE <\/a> <\/h2>\n
RATIONALE <\/a> <\/h2>\n
FUTURE DIRECTIONS <\/a> <\/h2>\n
SEE ALSO <\/a> <\/h2>\n