diff -r 83284b289430 -r 3a89b31f0724 src/cx/list.h
--- a/src/cx/list.h	Wed Oct 15 22:45:21 2025 +0200
+++ b/src/cx/list.h	Thu Oct 16 19:57:47 2025 +0200
@@ -39,8 +39,6 @@
 #include "common.h"
 #include "collection.h"
 
-#include <assert.h>
-
 #ifdef __cplusplus
 extern "C" {
 #endif
@@ -85,54 +83,33 @@
      * The data pointer may be @c NULL, in which case the function shall only allocate memory.
      * Returns a pointer to the allocated memory or @c NULL if allocation fails.
      */
-    void *(*insert_element)(
-            struct cx_list_s *list,
-            size_t index,
-            const void *data
-    );
+    void *(*insert_element)(struct cx_list_s *list, size_t index, const void *data);
 
     /**
      * Member function for inserting multiple elements.
      *
      * @see cx_list_default_insert_array()
      */
-    size_t (*insert_array)(
-            struct cx_list_s *list,
-            size_t index,
-            const void *data,
-            size_t n
-    );
+    size_t (*insert_array)(struct cx_list_s *list, size_t index, const void *data, size_t n);
 
     /**
      * Member function for inserting sorted elements into a sorted list.
      *
      * @see cx_list_default_insert_sorted()
      */
-    size_t (*insert_sorted)(
-            struct cx_list_s *list,
-            const void *sorted_data,
-            size_t n
-    );
+    size_t (*insert_sorted)(struct cx_list_s *list, const void *sorted_data, size_t n);
 
     /**
      * Member function for inserting multiple elements if they do not exist.
      *
      * @see cx_list_default_insert_unique()
      */
-    size_t (*insert_unique)(
-            struct cx_list_s *list,
-            const void *sorted_data,
-            size_t n
-    );
+    size_t (*insert_unique)(struct cx_list_s *list, const void *sorted_data, size_t n);
 
     /**
      * Member function for inserting an element relative to an iterator position.
      */
-    int (*insert_iter)(
-            struct cx_iterator_s *iter,
-            const void *elem,
-            int prepend
-    );
+    int (*insert_iter)(struct cx_iterator_s *iter, const void *elem, int prepend);
 
     /**
      * Member function for removing elements.
@@ -144,12 +121,7 @@
      * The function SHALL return the actual number of elements removed, which
      * might be lower than @p num when going out of bounds.
      */
-    size_t (*remove)(
-            struct cx_list_s *list,
-            size_t index,
-            size_t num,
-            void *targetbuf
-    );
+    size_t (*remove)(struct cx_list_s *list, size_t index, size_t num, void *targetbuf);
 
     /**
      * Member function for removing all elements.
@@ -161,28 +133,17 @@
      *
      * @see cx_list_default_swap()
      */
-    int (*swap)(
-            struct cx_list_s *list,
-            size_t i,
-            size_t j
-    );
+    int (*swap)(struct cx_list_s *list, size_t i, size_t j);
 
     /**
      * Member function for element lookup.
      */
-    void *(*at)(
-            const struct cx_list_s *list,
-            size_t index
-    );
+    void *(*at)(const struct cx_list_s *list, size_t index);
 
     /**
      * Member function for finding and optionally removing an element.
      */
-    size_t (*find_remove)(
-            struct cx_list_s *list,
-            const void *elem,
-            bool remove
-    );
+    size_t (*find_remove)(struct cx_list_s *list, const void *elem, bool remove);
 
     /**
      * Member function for sorting the list.
@@ -196,10 +157,7 @@
      * to another list of the same type.
      * If set to @c NULL, the comparison won't be optimized.
      */
-    int (*compare)(
-            const struct cx_list_s *list,
-            const struct cx_list_s *other
-    );
+    int (*compare)(const struct cx_list_s *list, const struct cx_list_s *other);
 
     /**
      * Member function for reversing the order of the items.
@@ -209,11 +167,7 @@
     /**
      * Member function for returning an iterator pointing to the specified index.
      */
-    struct cx_iterator_s (*iterator)(
-            const struct cx_list_s *list,
-            size_t index,
-            bool backward
-    );
+    struct cx_iterator_s (*iterator)(const struct cx_list_s *list, size_t index, bool backward);
 };
 
 /**
@@ -229,8 +183,7 @@
  * You can use this as a placeholder for initializing CxList pointers
  * for which you do not want to reserve memory right from the beginning.
  */
-cx_attr_export
-extern CxList *const cxEmptyList;
+CX_EXPORT extern CxList *const cxEmptyList;
 
 /**
  * Default implementation of an array insert.
@@ -247,13 +200,8 @@
  * @return the number of elements actually inserted
  */
 cx_attr_nonnull
-cx_attr_export
-size_t cx_list_default_insert_array(
-        struct cx_list_s *list,
-        size_t index,
-        const void *data,
-        size_t n
-);
+CX_EXPORT size_t cx_list_default_insert_array(struct cx_list_s *list,
+        size_t index, const void *data, size_t n);
 
 /**
  * Default implementation of a sorted insert.
@@ -272,12 +220,8 @@
  * @return the number of elements actually inserted
  */
 cx_attr_nonnull
-cx_attr_export
-size_t cx_list_default_insert_sorted(
-        struct cx_list_s *list,
-        const void *sorted_data,
-        size_t n
-);
+CX_EXPORT size_t cx_list_default_insert_sorted(struct cx_list_s *list,
+        const void *sorted_data, size_t n);
 
 /**
  * Default implementation of an array insert where only elements are inserted when they don't exist in the list.
@@ -296,12 +240,8 @@
  * @return the number of elements from the @p sorted_data that are definitely present in the list after this call
  */
 cx_attr_nonnull
-cx_attr_export
-size_t cx_list_default_insert_unique(
-        struct cx_list_s *list,
-        const void *sorted_data,
-        size_t n
-);
+CX_EXPORT size_t cx_list_default_insert_unique(struct cx_list_s *list,
+        const void *sorted_data, size_t n);
 
 /**
  * Default unoptimized sort implementation.
@@ -315,8 +255,7 @@
  * @param list the list that shall be sorted
  */
 cx_attr_nonnull
-cx_attr_export
-void cx_list_default_sort(struct cx_list_s *list);
+CX_EXPORT void cx_list_default_sort(struct cx_list_s *list);
 
 /**
  * Default unoptimized swap implementation.
@@ -332,8 +271,7 @@
  * allocation for the temporary buffer fails
  */
 cx_attr_nonnull
-cx_attr_export
-int cx_list_default_swap(struct cx_list_s *list, size_t i, size_t j);
+CX_EXPORT int cx_list_default_swap(struct cx_list_s *list, size_t i, size_t j);
 
 /**
  * Initializes a list struct.
@@ -380,14 +318,9 @@
  * @param elem_size the size of one element
  */
 cx_attr_nonnull_arg(1, 2, 3)
-cx_attr_export
-void cx_list_init(
-    struct cx_list_s *list,
-    struct cx_list_class_s *cl,
-    const struct cx_allocator_s *allocator,
-    cx_compare_func comparator,
-    size_t elem_size
-);
+CX_EXPORT void cx_list_init(struct cx_list_s *list,
+    struct cx_list_class_s *cl, const struct cx_allocator_s *allocator,
+    cx_compare_func comparator, size_t elem_size);
 
 /**
  * Returns the number of elements currently stored in the list.
@@ -396,9 +329,7 @@
  * @return the number of currently stored elements
  */
 cx_attr_nonnull
-static inline size_t cxListSize(const CxList *list) {
-    return list->collection.size;
-}
+CX_EXPORT size_t cxListSize(const CxList *list);
 
 /**
  * Adds an item to the end of the list.
@@ -411,13 +342,7 @@
  * @see cxListEmplace()
  */
 cx_attr_nonnull
-static inline int cxListAdd(
-        CxList *list,
-        const void *elem
-) {
-    list->collection.sorted = false;
-    return list->cl->insert_element(list, list->collection.size, elem) == NULL;
-}
+CX_EXPORT int cxListAdd(CxList *list, const void *elem);
 
 /**
  * Adds multiple items to the end of the list.
@@ -436,14 +361,7 @@
  * @return the number of added elements
  */
 cx_attr_nonnull
-static inline size_t cxListAddArray(
-        CxList *list,
-        const void *array,
-        size_t n
-) {
-    list->collection.sorted = false;
-    return list->cl->insert_array(list, list->collection.size, array, n);
-}
+CX_EXPORT size_t cxListAddArray(CxList *list, const void *array, size_t n);
 
 /**
  * Inserts an item at the specified index.
@@ -460,14 +378,7 @@
  * @see cxListEmplaceAt()
  */
 cx_attr_nonnull
-static inline int cxListInsert(
-        CxList *list,
-        size_t index,
-        const void *elem
-) {
-    list->collection.sorted = false;
-    return list->cl->insert_element(list, index, elem) == NULL;
-}
+CX_EXPORT int cxListInsert(CxList *list, size_t index, const void *elem);
 
 /**
  * Allocates memory for an element at the specified index and returns a pointer to that memory.
@@ -481,11 +392,7 @@
  * @see cxListInsert()
  */
 cx_attr_nonnull
-static inline void *cxListEmplaceAt(CxList *list, size_t index) {
-    list->collection.sorted = false;
-    return list->cl->insert_element(list, index, NULL);
-}
-
+CX_EXPORT void *cxListEmplaceAt(CxList *list, size_t index);
 
 /**
  * Allocates memory for an element at the end of the list and returns a pointer to that memory.
@@ -498,10 +405,7 @@
  * @see cxListAdd()
  */
 cx_attr_nonnull
-static inline void *cxListEmplace(CxList *list) {
-    list->collection.sorted = false;
-    return list->cl->insert_element(list, list->collection.size, NULL);
-}
+CX_EXPORT void *cxListEmplace(CxList *list);
 
 /**
  * Inserts an item into a sorted list.
@@ -514,15 +418,7 @@
  * @retval non-zero memory allocation failure
  */
 cx_attr_nonnull
-static inline int cxListInsertSorted(
-        CxList *list,
-        const void *elem
-) {
-    assert(list->collection.sorted || list->collection.size == 0);
-    list->collection.sorted = true;
-    const void *data = list->collection.store_pointer ? &elem : elem;
-    return list->cl->insert_sorted(list, data, 1) == 0;
-}
+CX_EXPORT int cxListInsertSorted(CxList *list, const void *elem);
 
 /**
  * Inserts an item into a sorted list if it does not exist.
@@ -535,15 +431,7 @@
  * @retval non-zero memory allocation failure
  */
 cx_attr_nonnull
-static inline int cxListInsertUnique(
-        CxList *list,
-        const void *elem
-) {
-    assert(list->collection.sorted || list->collection.size == 0);
-    list->collection.sorted = true;
-    const void *data = list->collection.store_pointer ? &elem : elem;
-    return list->cl->insert_unique(list, data, 1) == 0;
-}
+CX_EXPORT int cxListInsertUnique(CxList *list, const void *elem);
 
 /**
  * Inserts multiple items to the list at the specified index.
@@ -565,15 +453,7 @@
  * @return the number of added elements
  */
 cx_attr_nonnull
-static inline size_t cxListInsertArray(
-        CxList *list,
-        size_t index,
-        const void *array,
-        size_t n
-) {
-    list->collection.sorted = false;
-    return list->cl->insert_array(list, index, array, n);
-}
+CX_EXPORT size_t cxListInsertArray(CxList *list, size_t index, const void *array, size_t n);
 
 /**
  * Inserts a sorted array into a sorted list.
@@ -595,15 +475,7 @@
  * @return the number of added elements
  */
 cx_attr_nonnull
-static inline size_t cxListInsertSortedArray(
-        CxList *list,
-        const void *array,
-        size_t n
-) {
-    assert(list->collection.sorted || list->collection.size == 0);
-    list->collection.sorted = true;
-    return list->cl->insert_sorted(list, array, n);
-}
+CX_EXPORT size_t cxListInsertSortedArray(CxList *list, const void *array, size_t n);
 
 /**
  * Inserts a sorted array into a sorted list, skipping duplicates.
@@ -634,15 +506,7 @@
  * @return the number of elements from the @p sorted_data that are definitely present in the list after this call
  */
 cx_attr_nonnull
-static inline size_t cxListInsertUniqueArray(
-        CxList *list,
-        const void *array,
-        size_t n
-) {
-    assert(list->collection.sorted || list->collection.size == 0);
-    list->collection.sorted = true;
-    return list->cl->insert_unique(list, array, n);
-}
+CX_EXPORT size_t cxListInsertUniqueArray(CxList *list, const void *array, size_t n);
 
 /**
  * Inserts an element after the current location of the specified iterator.
@@ -661,14 +525,7 @@
  * @see cxListInsertBefore()
  */
 cx_attr_nonnull
-static inline int cxListInsertAfter(
-        CxIterator *iter,
-        const void *elem
-) {
-    CxList* list = (CxList*)iter->src_handle.m;
-    list->collection.sorted = false;
-    return list->cl->insert_iter(iter, elem, 0);
-}
+CX_EXPORT int cxListInsertAfter(CxIterator *iter, const void *elem);
 
 /**
  * Inserts an element before the current location of the specified iterator.
@@ -687,14 +544,7 @@
  * @see cxListInsertAfter()
  */
 cx_attr_nonnull
-static inline int cxListInsertBefore(
-        CxIterator *iter,
-        const void *elem
-) {
-    CxList* list = (CxList*)iter->src_handle.m;
-    list->collection.sorted = false;
-    return list->cl->insert_iter(iter, elem, 1);
-}
+CX_EXPORT int cxListInsertBefore(CxIterator *iter, const void *elem);
 
 /**
  * Removes the element at the specified index.
@@ -708,12 +558,7 @@
  * @retval non-zero index out of bounds
  */
 cx_attr_nonnull
-static inline int cxListRemove(
-        CxList *list,
-        size_t index
-) {
-    return list->cl->remove(list, index, 1, NULL) == 0;
-}
+CX_EXPORT int cxListRemove(CxList *list, size_t index);
 
 /**
  * Removes and returns the element at the specified index.
@@ -728,15 +573,8 @@
  * @retval zero success
  * @retval non-zero index out of bounds
  */
-cx_attr_nonnull
-cx_attr_access_w(3)
-static inline int cxListRemoveAndGet(
-        CxList *list,
-        size_t index,
-        void *targetbuf
-) {
-    return list->cl->remove(list, index, 1, targetbuf) == 0;
-}
+cx_attr_nonnull cx_attr_access_w(3)
+CX_EXPORT int cxListRemoveAndGet(CxList *list, size_t index, void *targetbuf);
 
 /**
  * Removes and returns the first element of the list.
@@ -752,14 +590,8 @@
  * @see cxListPopFront()
  * @see cxListRemoveAndGetLast()
  */
-cx_attr_nonnull
-cx_attr_access_w(2)
-static inline int cxListRemoveAndGetFirst(
-    CxList *list,
-    void *targetbuf
-) {
-    return list->cl->remove(list, 0, 1, targetbuf) == 0;
-}
+cx_attr_nonnull cx_attr_access_w(2)
+CX_EXPORT int cxListRemoveAndGetFirst(CxList *list, void *targetbuf);
 
 /**
  * Removes and returns the first element of the list.
@@ -792,15 +624,8 @@
  * @retval zero success
  * @retval non-zero the list is empty
  */
-cx_attr_nonnull
-cx_attr_access_w(2)
-static inline int cxListRemoveAndGetLast(
-    CxList *list,
-    void *targetbuf
-) {
-    // note: index may wrap - member function will catch that
-    return list->cl->remove(list, list->collection.size - 1, 1, targetbuf) == 0;
-}
+cx_attr_nonnull cx_attr_access_w(2)
+CX_EXPORT int cxListRemoveAndGetLast(CxList *list, void *targetbuf);
 
 /**
  * Removes and returns the last element of the list.
@@ -836,13 +661,7 @@
  * @return the actual number of removed elements
  */
 cx_attr_nonnull
-static inline size_t cxListRemoveArray(
-        CxList *list,
-        size_t index,
-        size_t num
-) {
-    return list->cl->remove(list, index, num, NULL);
-}
+CX_EXPORT size_t cxListRemoveArray(CxList *list, size_t index, size_t num);
 
 /**
  * Removes and returns multiple elements starting at the specified index.
@@ -857,16 +676,8 @@
  * @param targetbuf a buffer where to copy the elements
  * @return the actual number of removed elements
  */
-cx_attr_nonnull
-cx_attr_access_w(4)
-static inline size_t cxListRemoveArrayAndGet(
-        CxList *list,
-        size_t index,
-        size_t num,
-        void *targetbuf
-) {
-    return list->cl->remove(list, index, num, targetbuf);
-}
+cx_attr_nonnull cx_attr_access_w(4)
+CX_EXPORT size_t cxListRemoveArrayAndGet(CxList *list, size_t index, size_t num, void *targetbuf);
 
 /**
  * Removes all elements from this list.
@@ -877,10 +688,7 @@
  * @param list the list
  */
 cx_attr_nonnull
-static inline void cxListClear(CxList *list) {
-    list->cl->clear(list);
-    list->collection.sorted = true; // empty lists are always sorted
-}
+CX_EXPORT void cxListClear(CxList *list);
 
 /**
  * Swaps two items in the list.
@@ -896,14 +704,7 @@
  * or the swap needed extra memory, but allocation failed
  */
 cx_attr_nonnull
-static inline int cxListSwap(
-        CxList *list,
-        size_t i,
-        size_t j
-) {
-    list->collection.sorted = false;
-    return list->cl->swap(list, i, j);
-}
+CX_EXPORT int cxListSwap(CxList *list, size_t i, size_t j);
 
 /**
  * Returns a pointer to the element at the specified index.
@@ -915,12 +716,7 @@
  * @return a pointer to the element or @c NULL if the index is out of bounds
  */
 cx_attr_nonnull
-static inline void *cxListAt(
-        const CxList *list,
-        size_t index
-) {
-    return list->cl->at(list, index);
-}
+CX_EXPORT void *cxListAt(const CxList *list, size_t index);
 
 /**
  * Returns a pointer to the first element.
@@ -931,9 +727,7 @@
  * @return a pointer to the first element or @c NULL if the list is empty
  */
 cx_attr_nonnull
-static inline void *cxListFirst(const CxList *list) {
-    return list->cl->at(list, 0);
-}
+CX_EXPORT void *cxListFirst(const CxList *list);
 
 /**
  * Returns a pointer to the last element.
@@ -944,12 +738,13 @@
  * @return a pointer to the last element or @c NULL if the list is empty
  */
 cx_attr_nonnull
-static inline void *cxListLast(const CxList *list) {
-    return list->cl->at(list, list->collection.size - 1);
-}
+CX_EXPORT void *cxListLast(const CxList *list);
 
 /**
- * Sets the element at the specified index in the list
+ * Sets the element at the specified index in the list.
+ *
+ * This overwrites the element in-place without calling any destructor
+ * on the overwritten element.
  *
  * @param list the list to set the element in
  * @param index the index to set the element at
@@ -958,12 +753,7 @@
  * @retval non-zero when index is out of bounds
  */
 cx_attr_nonnull
-cx_attr_export
-int cxListSet(
-        CxList *list,
-        size_t index,
-        const void *elem
-);
+CX_EXPORT int cxListSet(CxList *list, size_t index, const void *elem);
 
 /**
  * Returns an iterator pointing to the item at the specified index.
@@ -977,13 +767,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-static inline CxIterator cxListIteratorAt(
-        const CxList *list,
-        size_t index
-) {
-    if (list == NULL) list = cxEmptyList;
-    return list->cl->iterator(list, index, false);
-}
+CX_EXPORT CxIterator cxListIteratorAt(const CxList *list, size_t index);
 
 /**
  * Returns a backwards iterator pointing to the item at the specified index.
@@ -997,13 +781,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-static inline CxIterator cxListBackwardsIteratorAt(
-        const CxList *list,
-        size_t index
-) {
-    if (list == NULL) list = cxEmptyList;
-    return list->cl->iterator(list, index, true);
-}
+CX_EXPORT CxIterator cxListBackwardsIteratorAt(const CxList *list, size_t index);
 
 /**
  * Returns a mutating iterator pointing to the item at the specified index.
@@ -1017,11 +795,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-cx_attr_export
-CxIterator cxListMutIteratorAt(
-        CxList *list,
-        size_t index
-);
+CX_EXPORT CxIterator cxListMutIteratorAt(CxList *list, size_t index);
 
 /**
  * Returns a mutating backwards iterator pointing to the item at the
@@ -1036,11 +810,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-cx_attr_export
-CxIterator cxListMutBackwardsIteratorAt(
-        CxList *list,
-        size_t index
-);
+CX_EXPORT CxIterator cxListMutBackwardsIteratorAt(CxList *list, size_t index);
 
 /**
  * Returns an iterator pointing to the first item of the list.
@@ -1053,10 +823,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-static inline CxIterator cxListIterator(const CxList *list) {
-    if (list == NULL) list = cxEmptyList;
-    return list->cl->iterator(list, 0, false);
-}
+CX_EXPORT CxIterator cxListIterator(const CxList *list);
 
 /**
  * Returns a mutating iterator pointing to the first item of the list.
@@ -1069,11 +836,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-static inline CxIterator cxListMutIterator(CxList *list) {
-    if (list == NULL) list = cxEmptyList;
-    return cxListMutIteratorAt(list, 0);
-}
-
+CX_EXPORT CxIterator cxListMutIterator(CxList *list);
 
 /**
  * Returns a backwards iterator pointing to the last item of the list.
@@ -1086,10 +849,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-static inline CxIterator cxListBackwardsIterator(const CxList *list) {
-    if (list == NULL) list = cxEmptyList;
-    return list->cl->iterator(list, list->collection.size - 1, true);
-}
+CX_EXPORT CxIterator cxListBackwardsIterator(const CxList *list);
 
 /**
  * Returns a mutating backwards iterator pointing to the last item of the list.
@@ -1102,10 +862,7 @@
  * @return a new iterator
  */
 cx_attr_nodiscard
-static inline CxIterator cxListMutBackwardsIterator(CxList *list) {
-    if (list == NULL) list = cxEmptyList;
-    return cxListMutBackwardsIteratorAt(list, list->collection.size - 1);
-}
+CX_EXPORT CxIterator cxListMutBackwardsIterator(CxList *list);
 
 /**
  * Returns the index of the first element that equals @p elem.
@@ -1118,14 +875,8 @@
  * @see cxListIndexValid()
  * @see cxListContains()
  */
-cx_attr_nonnull
-cx_attr_nodiscard
-static inline size_t cxListFind(
-        const CxList *list,
-        const void *elem
-) {
-    return list->cl->find_remove((CxList*)list, elem, false);
-}
+cx_attr_nonnull cx_attr_nodiscard
+CX_EXPORT size_t cxListFind(const CxList *list, const void *elem);
 
 /**
  * Checks if the list contains the specified element.
@@ -1138,14 +889,8 @@
  * @retval false if the element is not contained
  * @see cxListFind()
  */
-cx_attr_nonnull
-cx_attr_nodiscard
-static inline bool cxListContains(
-    const CxList* list,
-    const void* elem
-) {
-    return list->cl->find_remove((CxList*)list, elem, false) < list->collection.size;
-}
+cx_attr_nonnull cx_attr_nodiscard
+CX_EXPORT bool cxListContains(const CxList* list, const void* elem);
 
 /**
  * Checks if the specified index is within bounds.
@@ -1155,11 +900,8 @@
  * @retval true if the index is within bounds
  * @retval false if the index is out of bounds
  */
-cx_attr_nonnull
-cx_attr_nodiscard
-static inline bool cxListIndexValid(const CxList *list, size_t index) {
-    return index < list->collection.size;
-}
+cx_attr_nonnull cx_attr_nodiscard
+CX_EXPORT bool cxListIndexValid(const CxList *list, size_t index);
 
 /**
  * Removes and returns the index of the first element that equals @p elem.
@@ -1173,12 +915,7 @@
  * @see cxListIndexValid()
  */
 cx_attr_nonnull
-static inline size_t cxListFindRemove(
-        CxList *list,
-        const void *elem
-) {
-    return list->cl->find_remove(list, elem, true);
-}
+CX_EXPORT size_t cxListFindRemove(CxList *list, const void *elem);
 
 /**
  * Sorts the list.
@@ -1188,11 +925,7 @@
  * @param list the list
  */
 cx_attr_nonnull
-static inline void cxListSort(CxList *list) {
-    if (list->collection.sorted) return;
-    list->cl->sort(list);
-    list->collection.sorted = true;
-}
+CX_EXPORT void cxListSort(CxList *list);
 
 /**
  * Reverses the order of the items.
@@ -1200,11 +933,7 @@
  * @param list the list
  */
 cx_attr_nonnull
-static inline void cxListReverse(CxList *list) {
-    // still sorted, but not according to the cmp_func
-    list->collection.sorted = false;
-    list->cl->reverse(list);
-}
+CX_EXPORT void cxListReverse(CxList *list);
 
 /**
  * Compares a list to another list of the same type.
@@ -1215,18 +944,13 @@
  * @param list the list
  * @param other the list to compare to
  * @retval zero both lists are equal element wise
- * @retval negative the first list is smaller
+ * @retval negative the first list is smaller,
  * or the first non-equal element in the first list is smaller
  * @retval positive the first list is larger
  * or the first non-equal element in the first list is larger
  */
-cx_attr_nonnull
-cx_attr_nodiscard
-cx_attr_export
-int cxListCompare(
-        const CxList *list,
-        const CxList *other
-);
+cx_attr_nonnull cx_attr_nodiscard
+CX_EXPORT int cxListCompare(const CxList *list, const CxList *other);
 
 /**
  * Deallocates the memory of the specified list structure.
@@ -1235,8 +959,7 @@
  *
  * @param list the list that shall be freed
  */
-cx_attr_export
-void cxListFree(CxList *list);
+CX_EXPORT void cxListFree(CxList *list);
 
 
 #ifdef __cplusplus