/usr/include/cxtree.h is in libcext-dev 6.4.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 | /* $Id: cxtree.h,v 1.5 2011-02-21 14:15:31 rpalsa Exp $
*
* This file is part of the ESO C Extension Library
* Copyright (C) 2001-2011 European Southern Observatory
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
* $Author: rpalsa $
* $Date: 2011-02-21 14:15:31 $
* $Revision: 1.5 $
* $Name: not supported by cvs2svn $
*/
#ifndef CX_TREE_H
#define CX_TREE_H
#include <cxmemory.h>
CX_BEGIN_DECLS
typedef struct _cx_tnode_ *cx_tree_iterator;
typedef const struct _cx_tnode_ *cx_tree_const_iterator;
typedef struct _cx_tree_ cx_tree;
/**
* @ingroup cxtree
*
* @brief
* The tree's key comparison operator function.
*
* This type of function is used by a tree internally to compare the
* keys of its elements. A key comparison operator returns @c TRUE
* if the comparison of its first argument with the second argument
* succeeds, and @c FALSE otherwise, as, for instance, the logical
* operators < or > do.
*
* Examples:
* - A less than operator for integer values
* @code
* #include <cxtree.h>
*
* cxbool less_int(cxcptr i1, cxcptr i2)
* {
* return *i1 < *i2;
* }
* @endcode
*
* - A less than operator for strings
* @code
* #include <string.h>
* #include <cxtree.h>
*
* cxbool less_string(cxcptr s1, cxcptr s2)
* {
* return strcmp(s1, s2) < 0;
* }
* @endcode
*/
typedef cxbool (*cx_tree_compare_func)(cxcptr, cxcptr);
/*
* Create, copy and destroy operations
*/
cx_tree *cx_tree_new(cx_tree_compare_func, cx_free_func, cx_free_func);
void cx_tree_delete(cx_tree *);
/*
* Nonmodifying operations
*/
cxsize cx_tree_size(const cx_tree *);
cxbool cx_tree_empty(const cx_tree *);
cxsize cx_tree_max_size(const cx_tree *);
cx_tree_compare_func cx_tree_key_comp(const cx_tree *);
/*
* Special search operations
*/
cxsize cx_tree_count(const cx_tree *, cxcptr);
cx_tree_iterator cx_tree_find(const cx_tree *, cxcptr);
cx_tree_iterator cx_tree_lower_bound(const cx_tree *, cxcptr);
cx_tree_iterator cx_tree_upper_bound(const cx_tree *, cxcptr);
void cx_tree_equal_range(const cx_tree *, cxcptr, cx_tree_iterator *,
cx_tree_iterator *);
/*
* Assignment operations
*/
void cx_tree_swap(cx_tree *, cx_tree *);
cxptr cx_tree_assign(cx_tree *, cx_tree_iterator, cxcptr);
/*
* Element access
*/
cxptr cx_tree_get_key(const cx_tree *, cx_tree_const_iterator);
cxptr cx_tree_get_value(const cx_tree *, cx_tree_const_iterator);
/*
* Iterator functions
*/
cx_tree_iterator cx_tree_begin(const cx_tree *);
cx_tree_iterator cx_tree_end(const cx_tree *);
cx_tree_iterator cx_tree_next(const cx_tree *, cx_tree_const_iterator);
cx_tree_iterator cx_tree_previous(const cx_tree *, cx_tree_const_iterator);
/*
* Inserting and removing elements
*/
cx_tree_iterator cx_tree_insert_unique(cx_tree *, cxcptr, cxcptr);
cx_tree_iterator cx_tree_insert_equal(cx_tree *, cxcptr, cxcptr);
void cx_tree_erase_position(cx_tree *, cx_tree_iterator);
void cx_tree_erase_range(cx_tree *, cx_tree_iterator, cx_tree_iterator);
cxsize cx_tree_erase(cx_tree *, cxcptr);
void cx_tree_clear(cx_tree *);
/*
* Debugging
*/
cxbool cx_tree_verify(const cx_tree *);
CX_END_DECLS
#endif /* CX_TREE_H */
|