Thu, 26 Jan 2023 20:59:36 +0100
add new pointer list wrapper - resolves #234
since we need a thread local variable, this drops C99 support
universe@390 | 1 | /* |
universe@390 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@390 | 3 | * |
universe@390 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@390 | 5 | * |
universe@390 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@390 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@390 | 8 | * |
universe@390 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@390 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@390 | 11 | * |
universe@390 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@390 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@390 | 14 | * documentation and/or other materials provided with the distribution. |
universe@390 | 15 | * |
universe@390 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@390 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@390 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@390 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@390 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@390 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@390 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@390 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@390 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@390 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@390 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@390 | 27 | */ |
universe@453 | 28 | /** |
universe@453 | 29 | * \file list.h |
universe@453 | 30 | * \brief Interface for list implementations. |
universe@453 | 31 | * \author Mike Becker |
universe@453 | 32 | * \author Olaf Wintermann |
universe@453 | 33 | * \version 3.0 |
universe@453 | 34 | * \copyright 2-Clause BSD License |
universe@453 | 35 | */ |
universe@390 | 36 | |
universe@390 | 37 | #ifndef UCX_LIST_H |
universe@390 | 38 | #define UCX_LIST_H |
universe@390 | 39 | |
universe@484 | 40 | #include "common.h" |
universe@398 | 41 | #include "allocator.h" |
universe@494 | 42 | #include "iterator.h" |
universe@398 | 43 | |
universe@415 | 44 | #ifdef __cplusplus |
universe@415 | 45 | extern "C" { |
universe@415 | 46 | #endif |
universe@415 | 47 | |
universe@464 | 48 | /** |
universe@464 | 49 | * A comparator function comparing two list elements. |
universe@464 | 50 | */ |
universe@489 | 51 | typedef int(*CxListComparator)( |
universe@489 | 52 | void const *left, |
universe@489 | 53 | void const *right |
universe@489 | 54 | ); |
universe@398 | 55 | |
universe@464 | 56 | /** |
universe@500 | 57 | * List class type. |
universe@464 | 58 | */ |
universe@500 | 59 | typedef struct cx_list_class_s cx_list_class; |
universe@435 | 60 | |
universe@464 | 61 | /** |
universe@464 | 62 | * Structure for holding the base data of a list. |
universe@464 | 63 | */ |
universe@435 | 64 | struct cx_list_s { |
universe@464 | 65 | /** |
universe@464 | 66 | * The list class definition. |
universe@464 | 67 | */ |
universe@641 | 68 | cx_list_class const *cl; |
universe@641 | 69 | /** |
universe@641 | 70 | * The actual implementation in case the list class is delegating. |
universe@641 | 71 | */ |
universe@641 | 72 | cx_list_class const *climpl; |
universe@464 | 73 | /** |
universe@464 | 74 | * The allocator to use. |
universe@464 | 75 | */ |
universe@508 | 76 | CxAllocator const *allocator; |
universe@464 | 77 | /** |
universe@464 | 78 | * The comparator function for the elements. |
universe@464 | 79 | */ |
universe@398 | 80 | CxListComparator cmpfunc; |
universe@464 | 81 | /** |
universe@464 | 82 | * The size of each element (payload only). |
universe@464 | 83 | */ |
universe@401 | 84 | size_t itemsize; |
universe@464 | 85 | /** |
universe@464 | 86 | * The size of the list (number of currently stored elements). |
universe@464 | 87 | */ |
universe@401 | 88 | size_t size; |
universe@464 | 89 | /** |
universe@464 | 90 | * The capacity of the list (maximum number of elements). |
universe@464 | 91 | */ |
universe@401 | 92 | size_t capacity; |
universe@528 | 93 | union { |
universe@528 | 94 | /** |
universe@528 | 95 | * An optional simple destructor for the list contents that admits the free() interface. |
universe@528 | 96 | * |
universe@528 | 97 | * @remark Set content_destructor_type to #CX_DESTRUCTOR_SIMPLE. |
universe@528 | 98 | * |
universe@528 | 99 | * @attention Read the documentation of the particular list implementation |
universe@528 | 100 | * whether this destructor shall only destroy the contents or also free the memory. |
universe@528 | 101 | */ |
universe@528 | 102 | cx_destructor_func simple_destructor; |
universe@528 | 103 | /** |
universe@528 | 104 | * An optional advanced destructor for the list contents providing additional data. |
universe@528 | 105 | * |
universe@528 | 106 | * @remark Set content_destructor_type to #CX_DESTRUCTOR_ADVANCED. |
universe@528 | 107 | * |
universe@528 | 108 | * @attention Read the documentation of the particular list implementation |
universe@528 | 109 | * whether this destructor shall only destroy the contents or also free the memory. |
universe@528 | 110 | */ |
universe@528 | 111 | cx_advanced_destructor advanced_destructor; |
universe@528 | 112 | }; |
universe@528 | 113 | /** |
universe@528 | 114 | * The type of destructor to use. |
universe@528 | 115 | */ |
universe@528 | 116 | enum cx_destructor_type content_destructor_type; |
universe@435 | 117 | }; |
universe@398 | 118 | |
universe@464 | 119 | /** |
universe@500 | 120 | * The class definition for arbitrary lists. |
universe@500 | 121 | */ |
universe@500 | 122 | struct cx_list_class_s { |
universe@500 | 123 | /** |
universe@524 | 124 | * Destructor function. |
universe@524 | 125 | */ |
universe@524 | 126 | void (*destructor)(struct cx_list_s *list); |
universe@524 | 127 | |
universe@524 | 128 | /** |
universe@641 | 129 | * Member function for inserting a single elements. |
universe@641 | 130 | * Implementors SHOULD see to performant implementations for corner cases. |
universe@641 | 131 | */ |
universe@641 | 132 | int (*insert_element)( |
universe@641 | 133 | struct cx_list_s *list, |
universe@641 | 134 | size_t index, |
universe@641 | 135 | void const *data |
universe@641 | 136 | ); |
universe@641 | 137 | |
universe@641 | 138 | /** |
universe@638 | 139 | * Member function for inserting multiple elements. |
universe@640 | 140 | * Implementors SHOULD see to performant implementations for corner cases. |
universe@638 | 141 | */ |
universe@638 | 142 | size_t (*insert_array)( |
universe@638 | 143 | struct cx_list_s *list, |
universe@638 | 144 | size_t index, |
universe@638 | 145 | void const *data, |
universe@638 | 146 | size_t n |
universe@638 | 147 | ); |
universe@638 | 148 | |
universe@638 | 149 | /** |
universe@500 | 150 | * Member function for inserting an element relative to an iterator position. |
universe@500 | 151 | */ |
universe@500 | 152 | int (*insert_iter)( |
universe@630 | 153 | struct cx_mut_iterator_s *iter, |
universe@500 | 154 | void const *elem, |
universe@500 | 155 | int prepend |
universe@500 | 156 | ); |
universe@500 | 157 | |
universe@500 | 158 | /** |
universe@500 | 159 | * Member function for removing an element. |
universe@500 | 160 | */ |
universe@500 | 161 | int (*remove)( |
universe@500 | 162 | struct cx_list_s *list, |
universe@500 | 163 | size_t index |
universe@500 | 164 | ); |
universe@500 | 165 | |
universe@500 | 166 | /** |
universe@500 | 167 | * Member function for element lookup. |
universe@500 | 168 | */ |
universe@500 | 169 | void *(*at)( |
universe@500 | 170 | struct cx_list_s const *list, |
universe@500 | 171 | size_t index |
universe@500 | 172 | ); |
universe@500 | 173 | |
universe@500 | 174 | /** |
universe@500 | 175 | * Member function for finding an element. |
universe@500 | 176 | */ |
universe@500 | 177 | size_t (*find)( |
universe@500 | 178 | struct cx_list_s const *list, |
universe@500 | 179 | void const *elem |
universe@500 | 180 | ); |
universe@500 | 181 | |
universe@500 | 182 | /** |
universe@500 | 183 | * Member function for sorting the list in place. |
universe@500 | 184 | */ |
universe@500 | 185 | void (*sort)(struct cx_list_s *list); |
universe@500 | 186 | |
universe@500 | 187 | /** |
universe@500 | 188 | * Member function for comparing this list to another list of the same type. |
universe@500 | 189 | */ |
universe@500 | 190 | int (*compare)( |
universe@500 | 191 | struct cx_list_s const *list, |
universe@500 | 192 | struct cx_list_s const *other |
universe@500 | 193 | ); |
universe@500 | 194 | |
universe@500 | 195 | /** |
universe@500 | 196 | * Member function for reversing the order of the items. |
universe@500 | 197 | */ |
universe@500 | 198 | void (*reverse)(struct cx_list_s *list); |
universe@500 | 199 | |
universe@500 | 200 | /** |
universe@640 | 201 | * Member function for returning an iterator pointing to the specified index. |
universe@500 | 202 | */ |
universe@500 | 203 | struct cx_iterator_s (*iterator)( |
universe@630 | 204 | struct cx_list_s const *list, |
universe@630 | 205 | size_t index |
universe@630 | 206 | ); |
universe@500 | 207 | }; |
universe@500 | 208 | |
universe@500 | 209 | /** |
universe@464 | 210 | * Common type for all list implementations. |
universe@464 | 211 | */ |
universe@500 | 212 | typedef struct cx_list_s CxList; |
universe@398 | 213 | |
universe@464 | 214 | /** |
universe@641 | 215 | * Advises the list to store copies of the objects (default mode of operation). |
universe@641 | 216 | * |
universe@641 | 217 | * Retrieving objects from this list will yield pointers to the copies stored |
universe@641 | 218 | * within this list. |
universe@641 | 219 | * |
universe@641 | 220 | * @param list the list |
universe@641 | 221 | * @see cxListStorePointers() |
universe@641 | 222 | */ |
universe@641 | 223 | __attribute__((__nonnull__)) |
universe@641 | 224 | void cxListStoreObjects(CxList *list); |
universe@641 | 225 | |
universe@641 | 226 | /** |
universe@641 | 227 | * Advises the list to only store pointers to the objects. |
universe@641 | 228 | * |
universe@641 | 229 | * Retrieving objects from this list will yield the original pointers stored. |
universe@641 | 230 | * |
universe@641 | 231 | * @note This function forcibly sets the element size to the size of a pointer. |
universe@641 | 232 | * Invoking this function on a non-empty list that already stores copies of |
universe@641 | 233 | * objects is undefined. |
universe@641 | 234 | * |
universe@641 | 235 | * @param list the list |
universe@641 | 236 | * @see cxListStoreObjects() |
universe@641 | 237 | */ |
universe@641 | 238 | __attribute__((__nonnull__)) |
universe@641 | 239 | void cxListStorePointers(CxList *list); |
universe@641 | 240 | |
universe@641 | 241 | /** |
universe@641 | 242 | * Returns true, if this list is storing pointers instead of the actual data. |
universe@641 | 243 | * |
universe@641 | 244 | * @param list |
universe@641 | 245 | * @return |
universe@641 | 246 | * @see cxListStorePointers() |
universe@641 | 247 | */ |
universe@641 | 248 | __attribute__((__nonnull__)) |
universe@641 | 249 | bool cxListIsStoringPointers(CxList *list); |
universe@641 | 250 | |
universe@641 | 251 | /** |
universe@464 | 252 | * Adds an item to the end of the list. |
universe@464 | 253 | * |
universe@464 | 254 | * @param list the list |
universe@464 | 255 | * @param elem a pointer to the element to add |
universe@464 | 256 | * @return zero on success, non-zero on memory allocation failure |
universe@629 | 257 | * @see cxListAddArray() |
universe@464 | 258 | */ |
universe@508 | 259 | __attribute__((__nonnull__)) |
universe@489 | 260 | static inline int cxListAdd( |
universe@500 | 261 | CxList *list, |
universe@489 | 262 | void const *elem |
universe@489 | 263 | ) { |
universe@641 | 264 | return list->cl->insert_element(list, list->size, elem); |
universe@469 | 265 | } |
universe@398 | 266 | |
universe@464 | 267 | /** |
universe@629 | 268 | * Adds multiple items to the end of the list. |
universe@629 | 269 | * |
universe@629 | 270 | * This method is more efficient than invoking cxListAdd() multiple times. |
universe@629 | 271 | * |
universe@629 | 272 | * If there is not enough memory to add all elements, the returned value is |
universe@629 | 273 | * less than \p n. |
universe@629 | 274 | * |
universe@641 | 275 | * If this list is storing pointers instead of objects \p array is expected to |
universe@641 | 276 | * be an array of pointers. |
universe@641 | 277 | * |
universe@629 | 278 | * @param list the list |
universe@629 | 279 | * @param array a pointer to the elements to add |
universe@629 | 280 | * @param n the number of elements to add |
universe@629 | 281 | * @return the number of added elements |
universe@629 | 282 | */ |
universe@629 | 283 | __attribute__((__nonnull__)) |
universe@629 | 284 | static inline size_t cxListAddArray( |
universe@629 | 285 | CxList *list, |
universe@629 | 286 | void const *array, |
universe@629 | 287 | size_t n |
universe@629 | 288 | ) { |
universe@640 | 289 | return list->cl->insert_array(list, list->size, array, n); |
universe@629 | 290 | } |
universe@629 | 291 | |
universe@629 | 292 | /** |
universe@464 | 293 | * Inserts an item at the specified index. |
universe@464 | 294 | * |
universe@464 | 295 | * If \p index equals the list \c size, this is effectively cxListAdd(). |
universe@464 | 296 | * |
universe@464 | 297 | * @param list the list |
universe@464 | 298 | * @param index the index the element shall have |
universe@464 | 299 | * @param elem a pointer to the element to add |
universe@464 | 300 | * @return zero on success, non-zero on memory allocation failure |
universe@464 | 301 | * or when the index is out of bounds |
universe@499 | 302 | * @see cxListInsertAfter() |
universe@499 | 303 | * @see cxListInsertBefore() |
universe@464 | 304 | */ |
universe@508 | 305 | __attribute__((__nonnull__)) |
universe@489 | 306 | static inline int cxListInsert( |
universe@500 | 307 | CxList *list, |
universe@489 | 308 | size_t index, |
universe@489 | 309 | void const *elem |
universe@489 | 310 | ) { |
universe@641 | 311 | return list->cl->insert_element(list, index, elem); |
universe@469 | 312 | } |
universe@398 | 313 | |
universe@464 | 314 | /** |
universe@638 | 315 | * Inserts multiple items to the list at the specified index. |
universe@638 | 316 | * If \p index equals the list size, this is effectively cxListAddArray(). |
universe@638 | 317 | * |
universe@638 | 318 | * This method is usually more efficient than invoking cxListInsert() |
universe@638 | 319 | * multiple times. |
universe@638 | 320 | * |
universe@638 | 321 | * If there is not enough memory to add all elements, the returned value is |
universe@638 | 322 | * less than \p n. |
universe@638 | 323 | * |
universe@641 | 324 | * If this list is storing pointers instead of objects \p array is expected to |
universe@641 | 325 | * be an array of pointers. |
universe@641 | 326 | * |
universe@638 | 327 | * @param list the list |
universe@638 | 328 | * @param index the index where to add the elements |
universe@638 | 329 | * @param array a pointer to the elements to add |
universe@638 | 330 | * @param n the number of elements to add |
universe@638 | 331 | * @return the number of added elements |
universe@638 | 332 | */ |
universe@638 | 333 | __attribute__((__nonnull__)) |
universe@638 | 334 | static inline size_t cxListInsertArray( |
universe@638 | 335 | CxList *list, |
universe@638 | 336 | size_t index, |
universe@638 | 337 | void const *array, |
universe@638 | 338 | size_t n |
universe@638 | 339 | ) { |
universe@638 | 340 | return list->cl->insert_array(list, index, array, n); |
universe@638 | 341 | } |
universe@638 | 342 | |
universe@638 | 343 | /** |
universe@499 | 344 | * Inserts an element after the current location of the specified iterator. |
universe@499 | 345 | * |
universe@499 | 346 | * The used iterator remains operational, but all other active iterators should |
universe@499 | 347 | * be considered invalidated. |
universe@499 | 348 | * |
universe@499 | 349 | * If \p iter is not a list iterator, the behavior is undefined. |
universe@499 | 350 | * If \p iter is a past-the-end iterator, the new element gets appended to the list. |
universe@499 | 351 | * |
universe@499 | 352 | * @param iter an iterator |
universe@499 | 353 | * @param elem the element to insert |
universe@499 | 354 | * @return zero on success, non-zero on memory allocation failure |
universe@499 | 355 | * @see cxListInsert() |
universe@499 | 356 | * @see cxListInsertBefore() |
universe@499 | 357 | */ |
universe@508 | 358 | __attribute__((__nonnull__)) |
universe@499 | 359 | static inline int cxListInsertAfter( |
universe@630 | 360 | CxMutIterator *iter, |
universe@499 | 361 | void const *elem |
universe@499 | 362 | ) { |
universe@500 | 363 | return ((struct cx_list_s *) iter->src_handle)->cl->insert_iter(iter, elem, 0); |
universe@499 | 364 | } |
universe@499 | 365 | |
universe@499 | 366 | /** |
universe@499 | 367 | * Inserts an element before the current location of the specified iterator. |
universe@499 | 368 | * |
universe@499 | 369 | * The used iterator remains operational, but all other active iterators should |
universe@499 | 370 | * be considered invalidated. |
universe@499 | 371 | * |
universe@499 | 372 | * If \p iter is not a list iterator, the behavior is undefined. |
universe@499 | 373 | * If \p iter is a past-the-end iterator, the new element gets appended to the list. |
universe@499 | 374 | * |
universe@499 | 375 | * @param iter an iterator |
universe@499 | 376 | * @param elem the element to insert |
universe@499 | 377 | * @return zero on success, non-zero on memory allocation failure |
universe@499 | 378 | * @see cxListInsert() |
universe@499 | 379 | * @see cxListInsertAfter() |
universe@499 | 380 | */ |
universe@508 | 381 | __attribute__((__nonnull__)) |
universe@499 | 382 | static inline int cxListInsertBefore( |
universe@630 | 383 | CxMutIterator *iter, |
universe@499 | 384 | void const *elem |
universe@499 | 385 | ) { |
universe@500 | 386 | return ((struct cx_list_s *) iter->src_handle)->cl->insert_iter(iter, elem, 1); |
universe@499 | 387 | } |
universe@499 | 388 | |
universe@499 | 389 | /** |
universe@464 | 390 | * Removes the element at the specified index. |
universe@464 | 391 | * @param list the list |
universe@464 | 392 | * @param index the index of the element |
universe@464 | 393 | * @return zero on success, non-zero if the index is out of bounds |
universe@464 | 394 | */ |
universe@508 | 395 | __attribute__((__nonnull__)) |
universe@489 | 396 | static inline int cxListRemove( |
universe@500 | 397 | CxList *list, |
universe@489 | 398 | size_t index |
universe@489 | 399 | ) { |
universe@469 | 400 | return list->cl->remove(list, index); |
universe@469 | 401 | } |
universe@398 | 402 | |
universe@464 | 403 | /** |
universe@464 | 404 | * Returns a pointer to the element at the specified index. |
universe@464 | 405 | * |
universe@464 | 406 | * @param list the list |
universe@464 | 407 | * @param index the index of the element |
universe@464 | 408 | * @return a pointer to the element or \c NULL if the index is out of bounds |
universe@464 | 409 | */ |
universe@508 | 410 | __attribute__((__nonnull__)) |
universe@489 | 411 | static inline void *cxListAt( |
universe@500 | 412 | CxList *list, |
universe@489 | 413 | size_t index |
universe@489 | 414 | ) { |
universe@469 | 415 | return list->cl->at(list, index); |
universe@469 | 416 | } |
universe@439 | 417 | |
universe@464 | 418 | /** |
universe@494 | 419 | * Returns an iterator pointing to the item at the specified index. |
universe@494 | 420 | * |
universe@494 | 421 | * The returned iterator is position-aware. |
universe@494 | 422 | * |
universe@494 | 423 | * If the index is out of range, a past-the-end iterator will be returned. |
universe@494 | 424 | * |
universe@494 | 425 | * @param list the list |
universe@494 | 426 | * @param index the index where the iterator shall point at |
universe@494 | 427 | * @return a new iterator |
universe@494 | 428 | */ |
universe@508 | 429 | __attribute__((__nonnull__, __warn_unused_result__)) |
universe@494 | 430 | static inline CxIterator cxListIterator( |
universe@630 | 431 | CxList const *list, |
universe@630 | 432 | size_t index |
universe@630 | 433 | ) { |
universe@630 | 434 | return list->cl->iterator(list, index); |
universe@630 | 435 | } |
universe@630 | 436 | |
universe@630 | 437 | /** |
universe@630 | 438 | * Returns a mutating iterator pointing to the item at the specified index. |
universe@630 | 439 | * |
universe@630 | 440 | * The returned iterator is position-aware. |
universe@630 | 441 | * |
universe@630 | 442 | * If the index is out of range, a past-the-end iterator will be returned. |
universe@630 | 443 | * |
universe@630 | 444 | * @param list the list |
universe@630 | 445 | * @param index the index where the iterator shall point at |
universe@630 | 446 | * @return a new iterator |
universe@630 | 447 | */ |
universe@630 | 448 | __attribute__((__nonnull__, __warn_unused_result__)) |
universe@640 | 449 | CxMutIterator cxListMutIterator( |
universe@500 | 450 | CxList *list, |
universe@494 | 451 | size_t index |
universe@640 | 452 | ); |
universe@494 | 453 | |
universe@494 | 454 | /** |
universe@494 | 455 | * Returns an iterator pointing to the first item of the list. |
universe@494 | 456 | * |
universe@494 | 457 | * The returned iterator is position-aware. |
universe@494 | 458 | * |
universe@494 | 459 | * If the list is empty, a past-the-end iterator will be returned. |
universe@494 | 460 | * |
universe@494 | 461 | * @param list the list |
universe@494 | 462 | * @return a new iterator |
universe@494 | 463 | */ |
universe@508 | 464 | __attribute__((__nonnull__, __warn_unused_result__)) |
universe@630 | 465 | static inline CxIterator cxListBegin(CxList const *list) { |
universe@494 | 466 | return list->cl->iterator(list, 0); |
universe@494 | 467 | } |
universe@494 | 468 | |
universe@494 | 469 | /** |
universe@630 | 470 | * Returns a mutating iterator pointing to the first item of the list. |
universe@630 | 471 | * |
universe@630 | 472 | * The returned iterator is position-aware. |
universe@630 | 473 | * |
universe@630 | 474 | * If the list is empty, a past-the-end iterator will be returned. |
universe@630 | 475 | * |
universe@630 | 476 | * @param list the list |
universe@630 | 477 | * @return a new iterator |
universe@630 | 478 | */ |
universe@630 | 479 | __attribute__((__nonnull__, __warn_unused_result__)) |
universe@630 | 480 | static inline CxMutIterator cxListBeginMut(CxList *list) { |
universe@640 | 481 | return cxListMutIterator(list, 0); |
universe@630 | 482 | } |
universe@630 | 483 | |
universe@630 | 484 | /** |
universe@464 | 485 | * Returns the index of the first element that equals \p elem. |
universe@464 | 486 | * |
universe@464 | 487 | * Determining equality is performed by the list's comparator function. |
universe@464 | 488 | * |
universe@464 | 489 | * @param list the list |
universe@464 | 490 | * @param elem the element to find |
universe@464 | 491 | * @return the index of the element or \c (size+1) if the element is not found |
universe@464 | 492 | */ |
universe@508 | 493 | __attribute__((__nonnull__)) |
universe@489 | 494 | static inline size_t cxListFind( |
universe@621 | 495 | CxList const *list, |
universe@489 | 496 | void const *elem |
universe@489 | 497 | ) { |
universe@469 | 498 | return list->cl->find(list, elem); |
universe@469 | 499 | } |
universe@398 | 500 | |
universe@464 | 501 | /** |
universe@469 | 502 | * Sorts the list in place. |
universe@469 | 503 | * |
universe@469 | 504 | * \remark The underlying sort algorithm is implementation defined. |
universe@469 | 505 | * |
universe@469 | 506 | * @param list the list |
universe@469 | 507 | */ |
universe@508 | 508 | __attribute__((__nonnull__)) |
universe@500 | 509 | static inline void cxListSort(CxList *list) { |
universe@469 | 510 | list->cl->sort(list); |
universe@469 | 511 | } |
universe@404 | 512 | |
universe@488 | 513 | /** |
universe@490 | 514 | * Reverses the order of the items. |
universe@490 | 515 | * |
universe@490 | 516 | * @param list the list |
universe@490 | 517 | */ |
universe@508 | 518 | __attribute__((__nonnull__)) |
universe@500 | 519 | static inline void cxListReverse(CxList *list) { |
universe@490 | 520 | list->cl->reverse(list); |
universe@490 | 521 | } |
universe@490 | 522 | |
universe@490 | 523 | /** |
universe@488 | 524 | * Compares a list to another list of the same type. |
universe@488 | 525 | * |
universe@618 | 526 | * First, the list sizes are compared. |
universe@618 | 527 | * If they match, the lists are compared element-wise. |
universe@488 | 528 | * |
universe@488 | 529 | * @param list the list |
universe@488 | 530 | * @param other the list to compare to |
universe@618 | 531 | * @return zero, if both lists are equal element wise, |
universe@618 | 532 | * negative if the first list is smaller, positive if the first list is larger |
universe@488 | 533 | */ |
universe@508 | 534 | __attribute__((__nonnull__)) |
universe@618 | 535 | int cxListCompare( |
universe@618 | 536 | CxList const *list, |
universe@618 | 537 | CxList const *other |
universe@618 | 538 | ); |
universe@488 | 539 | |
universe@503 | 540 | /** |
universe@528 | 541 | * Deallocates the memory of the specified list structure. |
universe@528 | 542 | * |
universe@528 | 543 | * Also calls content a destructor function, depending on the configuration |
universe@528 | 544 | * in CxList.content_destructor_type. |
universe@503 | 545 | * |
universe@503 | 546 | * This function itself is a destructor function for the CxList. |
universe@503 | 547 | * |
universe@528 | 548 | * @param list the list which shall be destroyed |
universe@503 | 549 | */ |
universe@503 | 550 | __attribute__((__nonnull__)) |
universe@528 | 551 | void cxListDestroy(CxList *list); |
universe@503 | 552 | |
universe@415 | 553 | #ifdef __cplusplus |
universe@628 | 554 | } // extern "C" |
universe@415 | 555 | #endif |
universe@415 | 556 | |
universe@628 | 557 | #endif // UCX_LIST_H |