/** $MirOS: src/include/search.h,v 1.2 2005/11/21 19:31:53 tg Exp $ */ /* $OpenBSD: search.h,v 1.7 2004/07/08 21:15:11 millert Exp $ */ /* $NetBSD: search.h,v 1.9 1995/08/08 21:14:45 jtc Exp $ */ /* * Written by J.T. Conklin * Public domain. */ #ifndef _SEARCH_H_ #define _SEARCH_H_ #include #include #if !defined(_GCC_SIZE_T) #define _GCC_SIZE_T typedef __SIZE_TYPE__ size_t; #endif typedef struct entry { char *key; void *data; } ENTRY; typedef enum { FIND, ENTER } ACTION; typedef enum { preorder, postorder, endorder, leaf } VISIT; __BEGIN_DECLS void *bsearch(const void *, const void *, size_t, size_t, int (*)(const void *, const void *)); int hcreate(size_t); void hdestroy(void); ENTRY *hsearch(ENTRY, ACTION); void *lfind(const void *, const void *, size_t *, size_t, int (*)(const void *, const void *)); void *lsearch(const void *, const void *, size_t *, size_t, int (*)(const void *, const void *)); void insque(void *, void *); void remque(void *); void *tdelete(const void *, void **, 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)); __END_DECLS #endif /* !_SEARCH_H_ */