| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899 | /* Copyright (C) 1993 Ulrich DrepperThis file is intended to be included in the GNU C Library and theLinux C Library. So the copyright notice will be:Copyright (C) 1993 Free Software Foundation, Inc.This file is part of the GNU C Library.The GNU C Library is free software; you can redistribute it and/ormodify it under the terms of the GNU Library General Public License aspublished by the Free Software Foundation; either version 2 of theLicense, or (at your option) any later version.The GNU C Library is distributed in the hope that it will be useful,but WITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNULibrary General Public License for more details.You should have received a copy of the GNU Library General PublicLicense along with the GNU C Library; see the file COPYING.LIB.  Ifnot, write to the Free Software Foundation, Inc., 675 Mass Ave,Cambridge, MA 02139, USA.For now the file can be distributed under the LGPL.  */#ifndef _SEARCH_H#define _SEARCH_H#include <features.h>#define __need_size_t#define __need_NULL#include <stddef.h>/* Get __compar_fn_t from stdlib.h */#include <stdlib.h>__BEGIN_DECLS#if 0#ifndef __COMPAR_FN_T#define __COMPAR_FN_Ttypedef int (*__compar_fn_t) __P ((__const __ptr_t, __const __ptr_t));#endif#endif/* for use with hsearch(3) */typedef struct entry { char *key; char *data; } ENTRY;typedef enum { FIND, ENTER } ACTION;extern ENTRY * hsearch __P((ENTRY __item, ACTION __action));extern int     hcreate __P((unsigned __nel));extern void    hdestroy __P((void));/* The tsearch routines are very interesting. They make many * assumptions about the compiler. It assumpts that the first field * in node must be the "key" field, which points to the datum. * Everything depends on that. It is a very tricky stuff. H.J. *//* For tsearch */typedef enum { preorder, postorder, endorder, leaf } VISIT;extern void *tsearch __P((__const void * __key, void **__rootp,		__compar_fn_t compar));extern void *tfind __P((__const void * __key, void * __const * __rootp,		__compar_fn_t compar));extern void *tdelete __P((__const void * __key, void ** __rootp,		__compar_fn_t compar));#ifndef __ACTION_FN_T#define __ACTION_FN_T/* FYI, the first argument should be a pointer to "key". * Please read the man page for details. */typedef void (*__action_fn_t) __P((__const void *__nodep,				   __const VISIT __value,				   __const int __level));#endifextern void twalk __P((__const void * __root, __action_fn_t action));extern void * lfind __P((__const void * __key, __const void * __base,                         size_t * __nmemb, size_t __size,                         __compar_fn_t __compar));extern void * lsearch __P((__const void * __key, __const void * __base,                         size_t * __nmemb, size_t __size,                         __compar_fn_t __compar));__END_DECLS#endif /* search.h */
 |