/usr/include/cxmap.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 148 149 150 151 152 153 | /* $Id: cxmap.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_MAP_H
#define CX_MAP_H
#include <cxmemory.h>
#include <cxtree.h>
CX_BEGIN_DECLS
/**
* @ingroup cxmap
*
* @brief
* The map datatype.
*
* The internal representation of a map is a balanced binary tree. For
* this reason cx_map is just an alias for cx_tree.
*/
typedef cx_tree cx_map;
/**
* @ingroup cxmap
*
* @brief
* The map iterator datatype.
*
* The map iterator is just an alias for the cx_tree_iterator datatype.
*/
typedef cx_tree_iterator cx_map_iterator;
/**
* @ingroup cxmap
*
* @brief
* The map constant iterator datatype.
*
* The map constant iterator is just an alias for the cx_tree_const_iterator
* datatype.
*/
typedef cx_tree_const_iterator cx_map_const_iterator;
/**
* @ingroup cxmap
*
* @brief
* The map's key comparison operator function.
*
* This type of function is used internally by a map when key comparisons
* are necessary. It must return @c TRUE if the comparison of its first
* argument with the second argument succeeds, and @c FALSE otherwise.
* It is actually an alias for cx_tree_compare_func.
*
* @see cx_tree_compare_func
*/
typedef cx_tree_compare_func cx_map_compare_func;
/*
* Create, copy and destroy operations
*/
cx_map *cx_map_new(cx_compare_func, cx_free_func, cx_free_func);
void cx_map_delete(cx_map *);
/*
* Nonmodifying operations
*/
cxsize cx_map_size(const cx_map *);
cxbool cx_map_empty(const cx_map *);
cxsize cx_map_max_size(const cx_map *);
cx_map_compare_func cx_map_key_comp(const cx_map *);
/*
* Special search operations
*/
cxsize cx_map_count(const cx_map *, cxcptr);
cx_map_iterator cx_map_find(const cx_map *, cxcptr);
cx_map_iterator cx_map_lower_bound(const cx_map *, cxcptr);
cx_map_iterator cx_map_upper_bound(const cx_map *, cxcptr);
void cx_map_equal_range(const cx_map *, cxcptr, cx_map_iterator *,
cx_map_iterator *);
/*
* Assignment operations
*/
void cx_map_swap(cx_map *, cx_map *);
cxptr cx_map_assign(cx_map *, cx_map_iterator, cxcptr);
cxptr cx_map_put(cx_map *, cxcptr, cxcptr);
/*
* Element access
*/
cxptr cx_map_get_key(const cx_map *, cx_map_const_iterator);
cxptr cx_map_get_value(const cx_map *, cx_map_const_iterator);
cxptr cx_map_get(cx_map *, cxcptr);
/*
* Iterator functions
*/
cx_map_iterator cx_map_begin(const cx_map *);
cx_map_iterator cx_map_end(const cx_map *);
cx_map_iterator cx_map_next(const cx_map *, cx_map_const_iterator);
cx_map_iterator cx_map_previous(const cx_map *, cx_map_const_iterator);
/*
* Inserting and removing elements
*/
cx_map_iterator cx_map_insert(cx_map *, cxcptr, cxcptr);
void cx_map_erase_position(cx_map *, cx_map_iterator);
void cx_map_erase_range(cx_map *, cx_map_iterator, cx_map_iterator);
cxsize cx_map_erase(cx_map *, cxcptr);
void cx_map_clear(cx_map *);
CX_END_DECLS
#endif /* CX_MAP_H */
|