/usr/include/dnscore/string_set.h is in libyadifa-dev 2.1.6-1.
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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 | /*------------------------------------------------------------------------------
*
* Copyright (c) 2011-2016, EURid. All rights reserved.
* The YADIFA TM software product is provided under the BSD 3-clause license:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of EURid nor the names of its contributors may be
* used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
*------------------------------------------------------------------------------
*
*/
/** @defgroup collections Generic collections functions
* @ingroup dnscore
* @brief
*
* A collection of strings based on the AVL
*
* @{
*
*----------------------------------------------------------------------------*/
#ifndef _STRING_SET_H
#define _STRING_SET_H
#ifdef __cplusplus
extern "C"
{
#endif
/*
* A digest is stored prefixed with its length ([1;255])
*/
/*
* A structure to hold both children with direct access
*/
typedef struct string_node string_node;
struct string_children
{
struct string_node* left;
struct string_node* right;
};
/*
* An union to have access to the children with direct or indexed access
*/
typedef union string_children_union string_children_union;
union string_children_union
{
struct string_children lr;
struct string_node * child[2];
};
/*
* The node structure CANNOT have a varying size on a given collection
* This means that the digest size is a constant in the whole tree
*/
struct string_node
{
union string_children_union children; /* 2 ptrs */
const char* key; /* 1 ptr */
u16 value; /* 2 b */
s8 balance; /* 1 b */
}; /* 27 OR 15 bytes (64/32) */
/*
* AVL definition part begins here
*/
/*
* The maximum depth of a tree.
* 40 is enough for storing 433494436 items (worst case)
*
* Depth 0 is one node.
*
* Worst case : N is enough for sum[n = 0,N](Fn) where F is Fibonacci
* Best case : N is enough for (2^(N+1))-1
*/
#define AVL_MAX_DEPTH 20 /* 64 */
/*
* The previx that will be put in front of each function name
*/
#define AVL_PREFIX string_set_
typedef string_node* string_set;
/*
* The type that hold the node
*/
#define AVL_NODE_TYPE string_node
/*
* The type that hold the tree (should be AVL_NODE_TYPE*)
*/
#define AVL_TREE_TYPE AVL_NODE_TYPE*
/*
* The type that hold the tree (should be AVL_NODE_TYPE*)
*/
#define AVL_CONST_TREE_TYPE AVL_NODE_TYPE * const
/*
* How to find the root in the tree
*/
#define AVL_TREE_ROOT(__tree__) (*(__tree__))
/*
* The type used for comparing the nodes.
*/
#define AVL_REFERENCE_TYPE const char*
#define AVL_REFERENCE_IS_CONST TRUE
#define AVL_REFERENCE_IS_POINTER TRUE
/*
* The node has got a pointer to its parent
*
* 0 : disable
* !=0 : enable
*/
#define AVL_HAS_PARENT_POINTER 0
#ifdef __cplusplus
}
#endif
#include <dnscore/avl.h.inc>
#ifdef __cplusplus
extern "C"
{
#endif
/*
* I recommand setting a define to identify the C part of the template
* So it can be used to undefine what is not required anymore for every
* C file but that one.
*
*/
#define STRING_SET_EMPTY NULL
#ifndef _STRING_SET_C
#undef AVL_MAX_DEPTH
#undef AVL_PREFIX
#undef AVL_NODE_TYPE
#undef AVL_TREE_TYPE
#undef AVL_CONST_TREE_TYPE
#undef AVL_TREE_ROOT
#undef AVL_REFERENCE_TYPE
#undef AVL_HAS_PARENT_POINTER
#undef AVL_REFERENCE_IS_CONST
#undef AVL_REFERENCE_IS_POINTER
#undef _AVL_H_INC
#endif /* _STRING_SET_C */
#ifdef __cplusplus
}
#endif
#endif /* _STRING_SET_H */
/** @} */
/*----------------------------------------------------------------------------*/
|