/usr/include/girara/datastructures.h is in libgirara-dev 0.2.5-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 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 | /* See LICENSE file for license and copyright information */
#ifndef GIRARA_DATASTRUCTURES_H
#define GIRARA_DATASTRUCTURES_H
#include <stddef.h>
#include <stdbool.h>
#include <sys/types.h>
#include "types.h"
/**
* Create a new list.
*
* @return The girara list object or NULL if an error occured
*/
girara_list_t* girara_list_new(void);
/**
* Create a new list.
*
* @param gfree Pointer to the free function
* @return The girara list object or NULL if an error occured.
*/
girara_list_t* girara_list_new2(girara_free_function_t gfree);
/**
* Create a new (sorted) list.
*
* @param cmp Pointer to the compare function.
* @return The girara list object or NULL if an error occured.
*/
girara_list_t* girara_sorted_list_new(girara_compare_function_t cmp);
/**
* Create a new (sorted) list.
*
* @param cmp Pointer to the compare function.
* @param gfree Pointer to the free function
* @return The girara list object or NULL if an error occured.
*/
girara_list_t* girara_sorted_list_new2(girara_compare_function_t cmp,
girara_free_function_t gfree);
/**
* Set the function which should be called if the stored data should be freed.
*
* @param list The girara list object
* @param gfree Pointer to the free function
*/
void girara_list_set_free_function(girara_list_t* list,
girara_free_function_t gfree);
/**
* Remove all elements from a list.
*
* @param list The girara list object
*/
void girara_list_clear(girara_list_t* list);
/**
* Destroy list.
*
* @param list The girara list object
*/
void girara_list_free(girara_list_t* list);
/**
* Append an element to the list.
*
* @param list The girara list object
* @param data The element
*/
void girara_list_append(girara_list_t* list, void* data);
/**
* Prepend an element to the list.
*
* @param list The girara list object
* @param data The element
*/
void girara_list_prepend(girara_list_t* list, void* data);
/**
* Remove an element of the list
*
* @param list The girara list object
* @param data The element
*/
void girara_list_remove(girara_list_t* list, void* data);
/**
* Returns nth entry
*
* @param list The girara list object
* @param n Index of the entry
* @return The nth element or NULL if an error occured
*/
void* girara_list_nth(girara_list_t* list, size_t n);
/**
* Checks if the list contains the given element
*
* @param list The girara list object
* @param data The element
* @return true if the list contains the element
*/
bool girara_list_contains(girara_list_t* list, void* data);
/**
* Get size of the list.
*
* @param list The girara list object
* @return The size of the list
*/
size_t girara_list_size(girara_list_t* list);
/**
* Returns the position of the element in the list
*
* @param list The girara list object
* @param data The element
* @return The position or -1 if the data is not found
*/
ssize_t girara_list_position(girara_list_t* list, void* data);
/**
* Sort a list
*
* @param list The list to sort
* @param compare compare function
*/
void girara_list_sort(girara_list_t* list, girara_compare_function_t compare);
/**
* Find an element
*
* @param list The list
* @param compare compare function
* @param data data passed as the second argument to the compare function
* @return the element if found or NULL
*/
void* girara_list_find(girara_list_t* list, girara_compare_function_t compare,
const void* data);
/**
* Create an iterator pointing at the start of list.
*
* @param list The girara list object
* @return The list iterator or NULL if an error occured
*/
girara_list_iterator_t* girara_list_iterator(girara_list_t* list);
/**
* Create an iterator pointing to the same element as iter.
*
* @param iter The girara list iterator to be copied
* @return The list iterator or NULL if an error occured
*/
girara_list_iterator_t* girara_list_iterator_copy(girara_list_iterator_t* iter);
/**
* Move iterator to next element.
*
* @param iter The list iterator
* @return The moved iterator or NULL if an error occured
*/
girara_list_iterator_t* girara_list_iterator_next(girara_list_iterator_t* iter);
/**
* Check if iterator has next element.
*
* @param iter The list iterator
* @return true if iterator has a next element, false otherwise
*/
bool girara_list_iterator_has_next(girara_list_iterator_t* iter);
/**
* Move iterator to previous element.
*
* @param iter The list iterator
* @return The moved iterator or NULL if an error occured
*/
girara_list_iterator_t* girara_list_iterator_previous(girara_list_iterator_t* iter);
/**
* Check if iterator has previous element.
*
* @param iter The list iterator
* @return true if iterator has a previous element, false otherwise
*/
bool girara_list_iterator_has_previous(girara_list_iterator_t* iter);
/**
* Remove element pointed by the iterator, and updates the iterator
* to the next element
*
* @param iter The list iterator
*/
void girara_list_iterator_remove(girara_list_iterator_t* iter);
/**
* Check if iterator is valid
*
* @param iter The list iterator
* @return true if iterator is valid, false otherwise
*/
bool girara_list_iterator_is_valid(girara_list_iterator_t* iter);
/**
* Get data from the element pointed to by the iterator.
*
* @param iter The list iterator
* @return The data of the current element
*/
void* girara_list_iterator_data(girara_list_iterator_t* iter);
/**
* Set data from the element pointed to by the iterator.
*
* @param iter The list iterator
* @param data Sets the list iterator to a specific element
*/
void girara_list_iterator_set(girara_list_iterator_t* iter, void *data);
/**
* Destroy the iterator.
*
* @param iter The list iterator
*/
void girara_list_iterator_free(girara_list_iterator_t* iter);
/**
* Call function for each element in the list.
*
* @param list The list
* @param callback The function to call.
* @param data Passed to the callback as second argument.
*/
void girara_list_foreach(girara_list_t* list, girara_list_callback_t callback,
void* data);
#define GIRARA_LIST_FOREACH(list, type, iter, data) \
do { \
girara_list_iterator_t* iter = girara_list_iterator(list); \
while (girara_list_iterator_is_valid(iter)) { \
type data = (type)girara_list_iterator_data(iter);
#define GIRARA_LIST_FOREACH_END(list, type, iter, data) \
girara_list_iterator_next(iter); \
} \
girara_list_iterator_free(iter); \
} while(0)
/**
* Merge a list into another one. Both lists need to have the same free
* function. If other has a source free function set it will be set to NULL as
* the elements then belong to list.
* @param list the target list
* @param other the source list
* @returns list with the elements from other.
*/
girara_list_t* girara_list_merge(girara_list_t* list, girara_list_t* other);
/**
* Create a new node.
*
* @param data Data of the new node
* @return A girara node object or NULL if an error occured
*/
girara_tree_node_t* girara_node_new(void* data);
/**
* Set the function which should be called if the stored data should be freed.
*
* @param node The girara node object
* @param gfree Pointer to the free function
*/
void girara_node_set_free_function(girara_tree_node_t* node,
girara_free_function_t gfree);
/**
* Free a node. This will remove the node from its' parent and will destroy all
* its' children.
*
* @param node The girara node object
*/
void girara_node_free(girara_tree_node_t* node);
/**
* Append a node to another node.
*
* @param parent The parent node
* @param child The child node
*/
void girara_node_append(girara_tree_node_t* parent, girara_tree_node_t* child);
/**
* Append data as new node to another node.
*
* @param parent The parent node
* @param data The data of the node
* @return The node object or NULL if an error occured
*/
girara_tree_node_t* girara_node_append_data(girara_tree_node_t* parent,
void* data);
/**
* Get parent node.
*
* @param node The girara node object
* @return The parent node or NULL if an error occured or no parent exists
*/
girara_tree_node_t* girara_node_get_parent(girara_tree_node_t* node);
/**
* Get root node.
*
* @param node The girara node object
* @return The root node or NULL if an error occured
*/
girara_tree_node_t* girara_node_get_root(girara_tree_node_t* node);
/**
* Get list of children.
*
* @param node The girara node object
* @return List object containing all child nodes or NULL if an error occured
*/
girara_list_t* girara_node_get_children(girara_tree_node_t* node);
/**
* Get number of children.
*
* @param node The girara node object
* @return The number of child nodes
*/
size_t girara_node_get_num_children(girara_tree_node_t* node);
/**
* Get data.
*
* @param node The girara node object
* @return The data of the node
*/
void* girara_node_get_data(girara_tree_node_t* node);
/**
* Set data.
*
* @param node The girara node object
* @param data The new data of the object
*/
void girara_node_set_data(girara_tree_node_t* node, void* data);
#endif
|