xref: /freebsd/include/search.h (revision 459d04a5eecbe8ea330ef9c6cbba6392b16d317e)
1 /*-
2  * Written by J.T. Conklin <jtc@NetBSD.org>
3  * Public domain.
4  *
5  *	$NetBSD: search.h,v 1.16 2005/02/03 04:39:32 perry Exp $
6  * $FreeBSD$
7  */
8 
9 #ifndef _SEARCH_H_
10 #define _SEARCH_H_
11 
12 #include <sys/cdefs.h>
13 #include <sys/_types.h>
14 
15 #ifndef _SIZE_T_DECLARED
16 typedef	__size_t	size_t;
17 #define	_SIZE_T_DECLARED
18 #endif
19 
20 typedef	struct entry {
21 	char	*key;
22 	void	*data;
23 } ENTRY;
24 
25 typedef	enum {
26 	FIND, ENTER
27 } ACTION;
28 
29 typedef	enum {
30 	preorder,
31 	postorder,
32 	endorder,
33 	leaf
34 } VISIT;
35 
36 #ifdef _SEARCH_PRIVATE
37 typedef	struct node {
38 	void         *key;
39 	struct node  *llink, *rlink;
40 	signed char   balance;
41 } node_t;
42 
43 struct que_elem {
44 	struct que_elem *next;
45 	struct que_elem *prev;
46 };
47 #endif
48 
49 #if __BSD_VISIBLE
50 struct _ENTRY;
51 struct hsearch_data {
52 	struct _ENTRY *table;
53 	size_t size;
54 	size_t filled;
55 };
56 #endif
57 
58 __BEGIN_DECLS
59 int	 hcreate(size_t);
60 void	 hdestroy(void);
61 ENTRY	*hsearch(ENTRY, ACTION);
62 void	 insque(void *, void *);
63 void	*lfind(const void *, const void *, size_t *, size_t,
64 	    int (*)(const void *, const void *));
65 void	*lsearch(const void *, void *, size_t *, size_t,
66 	    int (*)(const void *, const void *));
67 void	 remque(void *);
68 void	*tdelete(const void * __restrict, void ** __restrict,
69 	    int (*)(const void *, const void *));
70 void	*tfind(const void *, void * const *,
71 	    int (*)(const void *, const void *));
72 void	*tsearch(const void *, void **, int (*)(const void *, const void *));
73 void	 twalk(const void *, void (*)(const void *, VISIT, int));
74 
75 #if __BSD_VISIBLE
76 int	 hcreate_r(size_t, struct hsearch_data *);
77 void	 hdestroy_r(struct hsearch_data *);
78 int	 hsearch_r(ENTRY, ACTION, ENTRY **, struct hsearch_data *);
79 #endif
80 
81 __END_DECLS
82 
83 #endif /* !_SEARCH_H_ */
84