[apple/libc.git] / include / search.h

/*-
 * Written by J.T. Conklin <jtc@netbsd.org>
 * Public domain.
 *
 *	$NetBSD: search.h,v 1.12 1999/02/22 10:34:28 christos Exp $
 * $FreeBSD: src/include/search.h,v 1.10 2002/10/16 14:29:23 robert Exp $
 */

#ifndef _SEARCH_H_
#define _SEARCH_H_

#include <sys/cdefs.h>
#include <_types.h>

#ifndef _SIZE_T
#define _SIZE_T
typedef __darwin_size_t	size_t;
#endif

typedef	struct entry {
	char	*key;
	void	*data;
} ENTRY;

typedef	enum {
	FIND, ENTER
} ACTION;

typedef	enum {
	preorder,
	postorder,
	endorder,
	leaf
} VISIT;

#ifdef _SEARCH_PRIVATE
typedef	struct node {
	char         *key;
	struct node  *llink, *rlink;
} node_t;

struct que_elem {
	struct que_elem *next;
	struct que_elem *prev;
};
#endif

__BEGIN_DECLS
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));
__END_DECLS

#endif /* !_SEARCH_H_ */
Commit	Line	Data
9385eb3d A	1	/*-
	2	* Written by J.T. Conklin <jtc@netbsd.org>
	3	* Public domain.
	4	*
	5	* $NetBSD: search.h,v 1.12 1999/02/22 10:34:28 christos Exp $
	6	* $FreeBSD: src/include/search.h,v 1.10 2002/10/16 14:29:23 robert Exp $
	7	*/
	8
	9	#ifndef _SEARCH_H_
	10	#define _SEARCH_H_
	11
	12	#include <sys/cdefs.h>
59e0d9fe A	13	#include <_types.h>
59e0d9fe A	14
3d9156a7 A	15	#ifndef _SIZE_T
	16	#define _SIZE_T
	17	typedef __darwin_size_t size_t;
59e0d9fe	18	#endif
9385eb3d A	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	char *key;
	39	struct node llink, rlink;
	40	} node_t;
	41
	42	struct que_elem {
	43	struct que_elem *next;
	44	struct que_elem *prev;
	45	};
	46	#endif
	47
	48	__BEGIN_DECLS
	49	int hcreate(size_t);
	50	void hdestroy(void);
	51	ENTRY *hsearch(ENTRY, ACTION);
	52	void insque(void , void );
	53	void lfind(const void , const void , size_t , size_t,
	54	int ()(const void , const void *));
	55	void lsearch(const void , void , size_t , size_t,
	56	int ()(const void , const void *));
	57	void remque(void *);
	58	void tdelete(const void __restrict, void ** __restrict,
	59	int ()(const void , const void *));
	60	void tfind(const void , void * const *,
	61	int ()(const void , const void *));
	62	void tsearch(const void , void *, int ()(const void , const void ));
	63	void twalk(const void , void ()(const void *, VISIT, int));
	64	__END_DECLS
	65
	66	#endif /* !_SEARCH_H_ */