lib/search_.h: Remove unused file.

diff --git a/ChangeLog b/ChangeLog
index 25c9c3d30da941f8a98de4d4b58ccca91a16e7e4..be6ad619b44234c61f379ec998bf6f1dbd6ccdac 100644 (file)
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,5 +1,7 @@
 2007-10-04  Jim Meyering  <jim@meyering.net>
 
+       * lib/search_.h: Remove unused file.
+
        * bootstrap (slurp): Adapt to _.h -> .in.h name change.
        (update_po_files): Work also when there are no .po files in po/.
 

diff --git a/lib/search_.h b/lib/search_.h
deleted file mode 100644 (file)
index 811813d..0000000
--- a/lib/search_.h
+++ /dev/null
@@ -1,87 +0,0 @@
-/* Tree search.
-
-   Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2003 Free
-   Software Foundation, Inc.
-
-   This program is free software: you can redistribute it and/or modify
-   it under the terms of the GNU General Public License as published by
-   the Free Software Foundation, either version 3 of the License, or
-   (at your option) any later version.
-
-   This program is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU General Public License for more details.
-
-   You should have received a copy of the GNU General Public License
-   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
-
-/* For use with hsearch(3).  */
-#ifndef __COMPAR_FN_T
-# define __COMPAR_FN_T
-typedef int (*__compar_fn_t) (const void *, const void *);
-
-# ifdef        __USE_GNU
-typedef __compar_fn_t comparison_fn_t;
-# endif
-#endif
-
-/* The tsearch routines are very interesting. They make many
-   assumptions about the compiler.  It assumes that the first field
-   in node must be the "key" field, which points to the datum.
-   Everything depends on that.  */
-/* For tsearch */
-typedef enum
-{
-  preorder,
-  postorder,
-  endorder,
-  leaf
-}
-VISIT;
-
-/* GCC 2.95 and later have "__restrict"; C99 compilers have
-   "restrict", and "configure" may have defined "restrict".  */
-#ifndef __restrict
-# if ! (2 < __GNUC__ || (2 == __GNUC__ && 95 <= __GNUC_MINOR__))
-#  if defined restrict || 199901L <= __STDC_VERSION__
-#   define __restrict restrict
-#  else
-#   define __restrict
-#  endif
-# endif
-#endif
-
-/* Search for an entry matching the given KEY in the tree pointed to
-   by *ROOTP and insert a new element if not found.  */
-extern void *tsearch (const void *__key, void **__rootp,
-                     __compar_fn_t __compar);
-
-/* Search for an entry matching the given KEY in the tree pointed to
-   by *ROOTP.  If no matching entry is available return NULL.  */
-extern void *tfind (const void *__key, void *const *__rootp,
-                   __compar_fn_t __compar);
-
-/* Remove the element matching KEY from the tree pointed to by *ROOTP.  */
-extern void *tdelete (const void *__restrict __key,
-                     void **__restrict __rootp,
-                     __compar_fn_t __compar);
-
-#ifndef __ACTION_FN_T
-# define __ACTION_FN_T
-typedef void (*__action_fn_t) (const void *__nodep, VISIT __value,
-                              int __level);
-#endif
-
-/* Walk through the whole tree and call the ACTION callback for every node
-   or leaf.  */
-extern void twalk (const void *__root, __action_fn_t __action);
-
-#ifdef __USE_GNU
-/* Callback type for function to free a tree node.  If the keys are atomic
-   data this function should do nothing.  */
-typedef void (*__free_fn_t) (void *__nodep);
-
-/* Destroy the whole tree, call FREEFCT for each node or leaf.  */
-extern void tdestroy (void *__root, __free_fn_t __freefct);
-#endif