1.1 --- a/src/linked_list.c Tue Dec 28 17:24:18 2021 +0100
1.2 +++ b/src/linked_list.c Tue Dec 28 17:38:02 2021 +0100
1.3 @@ -57,19 +57,19 @@
1.4 }
1.5
1.6 size_t cx_linked_list_find(
1.7 - void *start,
1.8 + void const *start,
1.9 ptrdiff_t loc_advance,
1.10 ptrdiff_t loc_data,
1.11 bool follow_ptr,
1.12 CxListComparator cmp_func,
1.13 - void *elem
1.14 + void const *elem
1.15 ) {
1.16 assert(start != NULL);
1.17 assert(loc_advance >= 0);
1.18 assert(loc_data >= 0);
1.19 assert(cmp_func);
1.20
1.21 - void *node = start;
1.22 + void const *node = start;
1.23 size_t index = 0;
1.24 do {
1.25 void *current = ll_data(node);
1.26 @@ -268,7 +268,7 @@
1.27 }
1.28
1.29 size_t cx_linked_list_size(
1.30 - void *node,
1.31 + void const *node,
1.32 ptrdiff_t loc_next
1.33 ) {
1.34 assert(loc_next >= 0);
1.35 @@ -397,14 +397,14 @@
1.36 }
1.37
1.38 int cx_linked_list_compare(
1.39 - void *begin_left,
1.40 - void *begin_right,
1.41 + void const *begin_left,
1.42 + void const *begin_right,
1.43 ptrdiff_t loc_advance,
1.44 ptrdiff_t loc_data,
1.45 bool follow_ptr,
1.46 CxListComparator cmp_func
1.47 ) {
1.48 - void *left = begin_left, *right = begin_right;
1.49 + void const *left = begin_left, *right = begin_right;
1.50
1.51 while (left != NULL && right != NULL) {
1.52 int result = cmp_func(ll_data(left), ll_data(right));
1.53 @@ -469,7 +469,7 @@
1.54 } cx_linked_list;
1.55
1.56 static cx_linked_list_node *cx_ll_node_at(
1.57 - cx_linked_list *list,
1.58 + cx_linked_list const *list,
1.59 size_t index
1.60 ) {
1.61 if (index >= list->base.size) {
1.62 @@ -484,7 +484,7 @@
1.63 static int cx_ll_insert(
1.64 cx_list_s *list,
1.65 size_t index,
1.66 - void *elem
1.67 + void const *elem
1.68 ) {
1.69 // out-of bounds check
1.70 if (index > list->size) return 1;
1.71 @@ -520,7 +520,7 @@
1.72
1.73 static int cx_ll_add(
1.74 cx_list_s *list,
1.75 - void *elem
1.76 + void const *elem
1.77 ) {
1.78 return cx_ll_insert(list, list->size, elem);
1.79 }
1.80 @@ -528,14 +528,14 @@
1.81 static int cx_pll_insert(
1.82 cx_list_s *list,
1.83 size_t index,
1.84 - void *elem
1.85 + void const *elem
1.86 ) {
1.87 return cx_ll_insert(list, index, &elem);
1.88 }
1.89
1.90 static int cx_pll_add(
1.91 cx_list_s *list,
1.92 - void *elem
1.93 + void const *elem
1.94 ) {
1.95 return cx_ll_insert(list, list->size, &elem);
1.96 }
1.97 @@ -564,7 +564,7 @@
1.98 }
1.99
1.100 static void *cx_ll_at(
1.101 - cx_list_s *list,
1.102 + cx_list_s const *list,
1.103 size_t index
1.104 ) {
1.105 cx_linked_list *ll = (cx_linked_list *) list;
1.106 @@ -573,7 +573,7 @@
1.107 }
1.108
1.109 static void *cx_pll_at(
1.110 - cx_list_s *list,
1.111 + cx_list_s const *list,
1.112 size_t index
1.113 ) {
1.114 cx_linked_list *ll = (cx_linked_list *) list;
1.115 @@ -582,8 +582,8 @@
1.116 }
1.117
1.118 static size_t cx_ll_find(
1.119 - cx_list_s *list,
1.120 - void *elem
1.121 + cx_list_s const *list,
1.122 + void const *elem
1.123 ) {
1.124 return cx_linked_list_find(((cx_linked_list *) list)->begin,
1.125 CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
1.126 @@ -591,8 +591,8 @@
1.127 }
1.128
1.129 static size_t cx_pll_find(
1.130 - cx_list_s *list,
1.131 - void *elem
1.132 + cx_list_s const *list,
1.133 + void const *elem
1.134 ) {
1.135 return cx_linked_list_find(((cx_linked_list *) list)->begin,
1.136 CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
1.137 @@ -614,8 +614,8 @@
1.138 }
1.139
1.140 static int cx_ll_compare(
1.141 - cx_list_s *list,
1.142 - cx_list_s *other
1.143 + cx_list_s const *list,
1.144 + cx_list_s const *other
1.145 ) {
1.146 cx_linked_list *left = (cx_linked_list *) list;
1.147 cx_linked_list *right = (cx_linked_list *) other;
1.148 @@ -625,8 +625,8 @@
1.149 }
1.150
1.151 static int cx_pll_compare(
1.152 - cx_list_s *list,
1.153 - cx_list_s *other
1.154 + cx_list_s const *list,
1.155 + cx_list_s const *other
1.156 ) {
1.157 cx_linked_list *left = (cx_linked_list *) list;
1.158 cx_linked_list *right = (cx_linked_list *) other;
1.159 @@ -703,7 +703,7 @@
1.160 CxListComparator comparator,
1.161 size_t item_size,
1.162 size_t num_items,
1.163 - const void *array
1.164 + void const *array
1.165 ) {
1.166 CxList list = cxLinkedListCreate(allocator, comparator, item_size);
1.167 if (list == NULL) return NULL;
