# search.h - [Overview](#section536723199165629) - [Summary](#section199634982165629) - [Data Structures](#nested-classes) - [Typedefs](#typedef-members) - [Functions](#func-members) ## **Overview** **Related Modules:** [UTILS](UTILS.md) **Description:** Provides functions and related data structures, such as creating, destroying, or searching for a hash table. You can use the functions provided in this file to perform operations related to wide character types during development, such as, creating, destroying, or searching for a hash table, and creating or searching for a binary tree. **Since:** 1.0 **Version:** 1.0 ## **Summary** ## Data Structures
Creates a queue from the doubly linked list for insque and remque. |
|
typedef struct entry |
hcreate (size_t nel) |
|
hdestroy (void) |
|
ENTRY * |
|
hcreate_r (size_t nel, struct hsearch_data *htab) |
Creates a hash table based on the number of entries and its description. |
hdestroy_r (struct hsearch_data *htab) |
|
hsearch_r (ENTRY item, ACTION action, ENTRY **retval, struct hsearch_data *htab) |
|
insque (void *element, void *pred) |
|
remque (void *elem) |
|
lsearch (const void *key, const void *base, size_t *nelp, size_t width, int(*compar)(const void *, const void *)) |
Performs a linear search for a key in the array and adds a key to the end of the array if the key is not found. |
lfind (const void *key, const void *base, size_t *nelp, size_t width, int(*compar)(const void *, const void *)) |
|
tdelete (const void *key, void **rootp, int(*compar)(const void *, const void *)) |
|
tfind (const void *key, void *const *rootp, int(*compar)(const void *, const void *)) |
|
tsearch (const void *key, void *const *rootp, int(*compar)(const void *, const void *)) |
Searches for a key in the binary tree and adds a key to the tree if the key is not found. |
twalk (const void *root, void(*action)(const void *nodep, VISIT which, int depth)) |
|
tdestroy (void *root, void(*free_node)(void *nodep)) |