/*-
 * 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 <machine/stdint.h>

#ifndef _SIZE_T_DECLARED
typedef __size_t        size_t;
#define _SIZE_T_DECLARED
#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_ */