1.1 --- a/src/linked_list.c Mon Jan 23 20:34:18 2023 +0100
1.2 +++ b/src/linked_list.c Wed Jan 25 19:19:29 2023 +0100
1.3 @@ -546,29 +546,6 @@
1.4 return n;
1.5 }
1.6
1.7 -static int cx_ll_insert(
1.8 - struct cx_list_s *list,
1.9 - size_t index,
1.10 - void const *elem
1.11 -) {
1.12 - return cx_ll_insert_array(list, index, elem, 1) != 1;
1.13 -}
1.14 -
1.15 -static int cx_ll_add(
1.16 - struct cx_list_s *list,
1.17 - void const *elem
1.18 -) {
1.19 - return cx_ll_insert(list, list->size, elem);
1.20 -}
1.21 -
1.22 -static size_t cx_ll_add_array(
1.23 - struct cx_list_s *list,
1.24 - void const *array,
1.25 - size_t n
1.26 -) {
1.27 - return cx_ll_insert_array(list, list->size, array, n);
1.28 -}
1.29 -
1.30 static int cx_ll_remove(
1.31 struct cx_list_s *list,
1.32 size_t index
1.33 @@ -691,19 +668,6 @@
1.34 return iter;
1.35 }
1.36
1.37 -static CxMutIterator cx_ll_mut_iterator(
1.38 - struct cx_list_s *list,
1.39 - size_t index
1.40 -) {
1.41 - CxIterator it = cx_ll_iterator(list, index);
1.42 - it.base.mutating = true;
1.43 -
1.44 - // we know the iterators share the same memory layout
1.45 - CxMutIterator iter;
1.46 - memcpy(&iter, &it, sizeof(CxMutIterator));
1.47 - return iter;
1.48 -}
1.49 -
1.50 static int cx_ll_insert_iter(
1.51 CxMutIterator *iter,
1.52 void const *elem,
1.53 @@ -718,7 +682,7 @@
1.54 iter->index += prepend * (0 == result);
1.55 return result;
1.56 } else {
1.57 - int result = cx_ll_insert(list, list->size, elem);
1.58 + int result = cx_ll_insert_array(list, list->size, elem, 1) != 1;
1.59 iter->index = list->size;
1.60 return result;
1.61 }
1.62 @@ -738,9 +702,6 @@
1.63
1.64 static cx_list_class cx_linked_list_class = {
1.65 cx_ll_destructor,
1.66 - cx_ll_add,
1.67 - cx_ll_add_array,
1.68 - cx_ll_insert,
1.69 cx_ll_insert_array,
1.70 cx_ll_insert_iter,
1.71 cx_ll_remove,
1.72 @@ -750,7 +711,6 @@
1.73 cx_ll_compare,
1.74 cx_ll_reverse,
1.75 cx_ll_iterator,
1.76 - cx_ll_mut_iterator,
1.77 };
1.78
1.79 CxList *cxLinkedListCreate(
