1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/* $NetBSD: search.h,v 1.9 1995/08/08 21:14:45 jtc Exp $ */
/*
* Written by J.T. Conklin <jtc@netbsd.org>
* Public domain.
*/
#ifndef _SEARCH_H_
#define _SEARCH_H_
#include <sys/cdefs.h>
#include <machine/ansi.h>
#ifdef _BSD_SIZE_T_
typedef _BSD_SIZE_T_ size_t;
#undef _BSD_SIZE_T_
#endif
typedef struct entry {
char *key;
char *data;
} ENTRY;
typedef enum {
FIND, ENTER
} ACTION;
typedef enum {
preorder,
postorder,
endorder,
leaf
} VISIT;
__BEGIN_DECLS
extern void *bsearch __P((const void *, const void *, size_t, size_t,
int (*)(const void *, const void *)));
extern int hcreate __P((unsigned int));
extern void hdestroy __P((void));
extern ENTRY *hsearch __P((ENTRY, ACTION));
extern void *lfind __P((const void *, const void *, size_t *, size_t,
int (*)(const void *, const void *)));
extern void *lsearch __P((const void *, const void *, size_t *, size_t,
int (*)(const void *, const void *)));
extern void insque __P((void *, void *));
extern void remque __P((void *));
extern void *tdelete __P((const void *, void **,
int (*)(const void *, const void *)));
extern void *tfind __P((const void *, void **,
int (*)(const void *, const void *)));
extern void *tsearch __P((const void *, void **,
int (*)(const void *, const void *)));
extern void twalk __P((const void *, void (*)(const void *, VISIT, int)));
__END_DECLS
#endif
|
