diff -r ca4c6f590a08 -r 4c3a69b9723a src/cx/list.h
--- a/src/cx/list.h	Mon Feb 10 21:30:51 2025 +0100
+++ b/src/cx/list.h	Mon Feb 10 20:59:02 2025 +0100
@@ -219,6 +219,7 @@
  * @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,
@@ -243,6 +244,7 @@
  * @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,
@@ -261,6 +263,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);
 
 /**
@@ -277,6 +280,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);
 
 /**
@@ -324,6 +328,7 @@
  * @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,
@@ -739,6 +744,7 @@
  */
 cx_attr_nonnull
 cx_attr_nodiscard
+cx_attr_export
 CxIterator cxListMutIteratorAt(
         CxList *list,
         size_t index
@@ -758,6 +764,7 @@
  */
 cx_attr_nonnull
 cx_attr_nodiscard
+cx_attr_export
 CxIterator cxListMutBackwardsIteratorAt(
         CxList *list,
         size_t index
@@ -921,6 +928,7 @@
  */
 cx_attr_nonnull
 cx_attr_nodiscard
+cx_attr_export
 int cxListCompare(
         const CxList *list,
         const CxList *other
@@ -933,6 +941,7 @@
  *
  * @param list the list which shall be freed
  */
+cx_attr_export
 void cxListFree(CxList *list);
 
 /**
@@ -943,6 +952,7 @@
  * You can use this is 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;