таблицы поиска (search tables)
Пролог (Prolog)
This manual page is part of the POSIX Programmer's 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.
Имя (Name)
search.h — search tables
Синопсис (Synopsis)
#include <search.h>
Описание (Description)
The <search.h> header shall define the ENTRY type for structure
entry which shall include the following members:
char *key
void *data
and shall define ACTION and VISIT as enumeration data types
through type definitions as follows:
enum { FIND, ENTER } ACTION;
enum { preorder, postorder, endorder, leaf } VISIT;
The <search.h> header shall define the size_t type as described
in <sys/types.h>.
The following shall be declared as functions and may also be
defined as macros. Function prototypes shall be provided.
int hcreate(size_t);
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 ));
The following sections are informative.
Использование в приложениях (Application usage)
None.
Обоснование (Rationale)
None.
Будущие направления (Future directions)
None.
Смотри также (See also)
sys_types.h(0p)
The System Interfaces volume of POSIX.1‐2017, hcreate(3p),
insque(3p), lsearch(3p), tdelete(3p)
