11 #include <bits/alltypes.h>
13 typedef enum { FIND, ENTER } ACTION;
14 typedef enum { preorder, postorder, endorder, leaf } VISIT;
23 ENTRY *hsearch(ENTRY, ACTION);
25 void insque(void *, void *);
28 void *lsearch(const void *, void *, size_t *, size_t,
29 int (*)(const void *, const void *));
30 void *lfind(const void *, const void *, size_t *, size_t,
31 int (*)(const void *, const void *));
33 void *tdelete(const void *__restrict, void **__restrict, int(*)(const void *, const void *));
34 void *tfind(const void *, void *const *, int(*)(const void *, const void *));
35 void *tsearch(const void *, void **, int (*)(const void *, const void *));
36 void twalk(const void *, void (*)(const void *, VISIT, int));
40 struct qelem *q_forw, *q_back;
44 void tdestroy(void *, void (*)(void *));