PATH:
usr
/
share
/
gettext
/
intl
/* Binary tree data structure. Copyright (C) 2006, 2015-2016 Free Software Foundation, Inc. This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see <http://www.gnu.org/licenses/>. */ #ifndef _TSEARCH_H #define _TSEARCH_H #if HAVE_TSEARCH /* Get tseach(), tfind(), tdelete(), twalk() declarations. */ #include <search.h> #else #ifdef __cplusplus extern "C" { #endif /* See <http://www.opengroup.org/susv3xbd/search.h.html>, <http://www.opengroup.org/susv3xsh/tsearch.html> for details. */ typedef enum { preorder, postorder, endorder, leaf } VISIT; /* Searches an element in the tree *VROOTP that compares equal to KEY. If one is found, it is returned. Otherwise, a new element equal to KEY is inserted in the tree and is returned. */ extern void * tsearch (const void *key, void **vrootp, int (*compar) (const void *, const void *)); /* Searches an element in the tree *VROOTP that compares equal to KEY. If one is found, it is returned. Otherwise, NULL is returned. */ extern void * tfind (const void *key, void *const *vrootp, int (*compar) (const void *, const void *)); /* Searches an element in the tree *VROOTP that compares equal to KEY. If one is found, it is removed from the tree, and its parent node is returned. Otherwise, NULL is returned. */ extern void * tdelete (const void *key, void **vrootp, int (*compar) (const void *, const void *)); /* Perform a depth-first, left-to-right traversal of the tree VROOT. The ACTION function is called: - for non-leaf nodes: 3 times, before the left subtree traversal, after the left subtree traversal but before the right subtree traversal, and after the right subtree traversal, - for leaf nodes: once. The arguments passed to ACTION are: 1. the node; it can be casted to a 'const void * const *', i.e. into a pointer to the key, 2. an indicator which visit of the node this is, 3. the level of the node in the tree (0 for the root). */ extern void twalk (const void *vroot, void (*action) (const void *, VISIT, int)); #ifdef __cplusplus } #endif #endif #endif /* _TSEARCH_H */
[-] plural-exp.h
[edit]
[-] printf-args.h
[edit]
[-] l10nflist.c
[edit]
[-] dcngettext.c
[edit]
[-] lock.h
[edit]
[-] gettextP.h
[edit]
[-] gmo.h
[edit]
[-] tsearch.c
[edit]
[-] COPYING.LIB
[edit]
[-] os2compat.h
[edit]
[-] lock.c
[edit]
[-] finddomain.c
[edit]
[-] hash-string.h
[edit]
[-] eval-plural.h
[edit]
[+]
..
[-] explodename.c
[edit]
[-] gettext.c
[edit]
[-] langprefs.c
[edit]
[-] plural.y
[edit]
[-] export.h
[edit]
[-] version.c
[edit]
[-] xsize.h
[edit]
[-] ngettext.c
[edit]
[-] printf-parse.c
[edit]
[-] setlocale.c
[edit]
[-] vasnprintf.c
[edit]
[-] bindtextdom.c
[edit]
[-] dcgettext.c
[edit]
[-] dngettext.c
[edit]
[-] textdomain.c
[edit]
[-] relocatable.h
[edit]
[-] localealias.c
[edit]
[-] hash-string.c
[edit]
[-] threadlib.c
[edit]
[-] intl-compat.c
[edit]
[-] dgettext.c
[edit]
[-] config.charset
[edit]
[-] vasnwprintf.h
[edit]
[-] locale.alias
[edit]
[-] dcigettext.c
[edit]
[-] wprintf-parse.h
[edit]
[-] intl-exports.c
[edit]
[-] vasnprintf.h
[edit]
[-] os2compat.c
[edit]
[-] xsize.c
[edit]
[-] VERSION
[edit]
[-] printf-parse.h
[edit]
[-] localcharset.h
[edit]
[-] Makefile.in
[edit]
[-] loadmsgcat.c
[edit]
[-] printf.c
[edit]
[-] log.c
[edit]
[-] ref-add.sin
[edit]
[-] loadinfo.h
[edit]
[-] libintl.rc
[edit]
[-] relocatable.c
[edit]
[-] ref-del.sin
[edit]
[-] plural-exp.c
[edit]
[-] plural.c
[edit]
[-] printf-args.c
[edit]
[-] libgnuintl.in.h
[edit]
[-] localcharset.c
[edit]
[-] verify.h
[edit]
[-] localename.c
[edit]
[-] tsearch.h
[edit]
[-] osdep.c
[edit]