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
58
59
60
61
62
63
64
65
66
67
68
69
|
/* $NetBSD: search.h,v 1.12 1999/02/22 10:34:28 christos Exp $ */
/* $FreeBSD$ */
/*
* 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;
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;
#endif
__BEGIN_DECLS
/* stdlib.h
void *bsearch __P((const void *, const void *, size_t, size_t,
int (*)(const void *, const void *)));
*/
int hcreate __P((size_t));
void hdestroy __P((void));
ENTRY *hsearch __P((ENTRY, ACTION));
/* depricated interfaces (in libcompat)
void *lfind __P((const void *, const void *, size_t *, size_t,
int (*)(const void *, const void *)));
void *lsearch __P((const void *, const void *, size_t *, size_t,
int (*)(const void *, const void *)));
void insque __P((void *, void *));
void remque __P((void *));
*/
void *tdelete __P((const void *, void **,
int (*)(const void *, const void *)));
void *tfind __P((const void *, void **,
int (*)(const void *, const void *)));
void *tsearch __P((const void *, void **,
int (*)(const void *, const void *)));
void twalk __P((const void *, void (*)(const void *, VISIT, int)));
__END_DECLS
#endif /* !_SEARCH_H_ */
|
