Sun, 03 Oct 2021 14:06:57 +0200
add some documentation and changes some signatures
universe@398 | 1 | /* |
universe@398 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@398 | 3 | * |
universe@398 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@398 | 5 | * |
universe@398 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@398 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@398 | 8 | * |
universe@398 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@398 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@398 | 11 | * |
universe@398 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@398 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@398 | 14 | * documentation and/or other materials provided with the distribution. |
universe@398 | 15 | * |
universe@398 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@398 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@398 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@398 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@398 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@398 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@398 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@398 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@398 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@398 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@398 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@398 | 27 | */ |
universe@453 | 28 | /** |
universe@453 | 29 | * \file linked_list.h |
universe@453 | 30 | * \brief Linked list implementation. |
universe@453 | 31 | * \details Also provides several low-level functions for custom linked list implementations. |
universe@453 | 32 | * \author Mike Becker |
universe@453 | 33 | * \author Olaf Wintermann |
universe@453 | 34 | * \version 3.0 |
universe@453 | 35 | * \copyright 2-Clause BSD License |
universe@453 | 36 | */ |
universe@398 | 37 | |
universe@398 | 38 | #ifndef UCX_LINKED_LIST_H |
universe@398 | 39 | #define UCX_LINKED_LIST_H |
universe@398 | 40 | |
universe@400 | 41 | #include <stddef.h> |
universe@398 | 42 | #include "list.h" |
universe@398 | 43 | |
universe@415 | 44 | #ifdef __cplusplus |
universe@415 | 45 | extern "C" { |
universe@415 | 46 | #endif |
universe@415 | 47 | |
universe@453 | 48 | CxList cxLinkedListCreate(CxAllocator allocator, CxListComparator comparator, size_t item_size); |
universe@453 | 49 | |
universe@453 | 50 | void cxLinkedListDestroy(CxList list); |
universe@453 | 51 | |
universe@453 | 52 | size_t cxLinkedListRecalculateSize(CxList list); |
universe@453 | 53 | |
universe@453 | 54 | |
universe@438 | 55 | /** |
universe@438 | 56 | * Finds the node at a certain index. |
universe@438 | 57 | * |
universe@438 | 58 | * This function can be used to start at an arbitrary position within the list. |
universe@438 | 59 | * If the search index is large than the start index, \p loc_advance must denote |
universe@438 | 60 | * the location of some sort of \c next pointer (i.e. a pointer to the next node). |
universe@438 | 61 | * But it is also possible that the search index is smaller than the start index |
universe@438 | 62 | * (e.g. in cases where traversing a list backwards is faster) in which case |
universe@438 | 63 | * \p loc_advance must denote the location of some sort of \c prev pointer |
universe@438 | 64 | * (i.e. a pointer to the previous node). |
universe@438 | 65 | * |
universe@438 | 66 | * @param start a pointer to the start node |
universe@438 | 67 | * @param start_index the start index |
universe@438 | 68 | * @param loc_advance the location of the pointer to advance |
universe@438 | 69 | * @param index the search index |
universe@438 | 70 | * @return the node found at the specified index |
universe@438 | 71 | */ |
universe@438 | 72 | void *cx_linked_list_at(void *start, size_t start_index, ptrdiff_t loc_advance, size_t index); |
universe@438 | 73 | |
universe@453 | 74 | /** |
universe@453 | 75 | * Finds the last node in a linked list. |
universe@453 | 76 | * |
universe@453 | 77 | * If a pointer to \p end is provided, the result is just \c *end. |
universe@453 | 78 | * Otherwise, this function starts with the pointer denoted by \c *begin and |
universe@453 | 79 | * traverses the list along a next pointer whose location within the node struct is |
universe@453 | 80 | * denoted by \p loc_next. |
universe@453 | 81 | * |
universe@453 | 82 | * If both \p begin and \p end are \c NULL, an empty list is assumed and this function returns \c NULL. |
universe@453 | 83 | * |
universe@453 | 84 | * @param begin a pointer to the begin node pointer (optional) |
universe@453 | 85 | * @param end a pointer to the end node pointer (optional) |
universe@453 | 86 | * @param loc_next the location of the \c next pointer (only required when \p end is \c NULL) |
universe@453 | 87 | * @return a pointer to the last node or \c NULL if the list is empty |
universe@453 | 88 | */ |
universe@400 | 89 | void *cx_linked_list_last(void **begin, void **end, ptrdiff_t loc_next); |
universe@398 | 90 | |
universe@453 | 91 | /** |
universe@453 | 92 | * Adds a new node to a linked list. |
universe@453 | 93 | * |
universe@453 | 94 | * \remark One of the pointers \p begin and \p end may be \c NULL, but not both. |
universe@453 | 95 | * |
universe@453 | 96 | * @param begin a pointer to the begin node pointer (if your list has one) |
universe@453 | 97 | * @param end a pointer to the end node pointer (if your list has one) |
universe@453 | 98 | * @param loc_prev the location of a \c prev pointer within your node struct (negative if your struct does not have one) |
universe@453 | 99 | * @param loc_next the location of a \c next pointer within your node struct (negative if your struct does not have one) |
universe@453 | 100 | * @param new_node a pointer to the node that shall be appended |
universe@453 | 101 | */ |
universe@453 | 102 | void cx_linked_list_add(void **begin, void **end, ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node); |
universe@406 | 103 | |
universe@415 | 104 | #ifdef __cplusplus |
universe@415 | 105 | } /* extern "C" */ |
universe@415 | 106 | #endif |
universe@415 | 107 | |
universe@398 | 108 | #endif /* UCX_LINKED_LIST_H */ |