2 * Copyright 2008-2012 Haiku, Inc. All Rights Reserved.
3 * Distributed under the terms of the MIT License.
17 typedef struct entry
{
34 extern int hcreate(size_t elementCount
);
35 extern void hdestroy(void);
36 extern ENTRY
*hsearch(ENTRY iteam
, ACTION action
);
37 extern void insque(void *element
, void *insertAfter
);
38 extern void *lfind(const void *key
, const void *base
, size_t *_elementCount
,
39 size_t width
, int (*compareFunction
)(const void *, const void *));
40 extern void *lsearch(const void *key
, void *base
, size_t *_elementCount
,
41 size_t width
, int (*compareFunction
)(const void *, const void *));
42 extern void remque(void *element
);
43 extern void *tdelete(const void *key
, void **_root
,
44 int (*compare
)(const void *, const void *));
45 extern void *tfind(const void *key
, void *const *root
,
46 int (*compare
)(const void *, const void *));
47 extern void *tsearch(const void *key
, void **_root
,
48 int (*compare
)(const void *, const void *));
49 extern void twalk(const void *root
,
50 void (*action
)(const void *, VISIT
, int ));
56 #endif /* _SEARCH_H_ */