YF;i 80;i I8;i Ze Accept-Encoding,User-Agent ɧ]m0J*t*
KEY: http://avaliareassessoria.com.br/Ven-SS/root/proc/self/cwd/var/cache/ea-nginx/proxy/avaliare/c/52/5f6a056b3243456c9332cc4458dad52c
HTTP/1.1 200 OK
Date: Thu, 11 Dec 2025 21:31:53 GMT
Server: Apache
Last-Modified: Thu, 11 Dec 2025 20:57:28 GMT
Accept-Ranges: bytes
Content-Length: 3484
Vary: Accept-Encoding,User-Agent
Connection: close
Content-Type: text/plain
H>;i QSV 80;i b Accept-Encoding,User-Agent . 'd#
KEY: http://avaliareassessoria.com.br/Ven-C404/root/proc/3/cwd/usr/share/gettext/intl/tsearch.h
HTTP/1.1 200 OK
Date: Thu, 11 Dec 2025 20:57:28 GMT
Server: Apache
Last-Modified: Sun, 20 Mar 2016 07:37:53 GMT
Accept-Ranges: bytes
Content-Length: 2812
Vary: Accept-Encoding,User-Agent
Connection: close
Content-Type: text/x-c
/* 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 . */
#ifndef _TSEARCH_H
#define _TSEARCH_H
#if HAVE_TSEARCH
/* Get tseach(), tfind(), tdelete(), twalk() declarations. */
#include
#else
#ifdef __cplusplus
extern "C" {
#endif
/* See ,
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 */