diff -r 37dcaeebe5ca -r 9c176073e771 src/kv_list.c
--- a/src/kv_list.c	Thu Sep 11 20:10:12 2025 +0200
+++ b/src/kv_list.c	Thu Sep 11 20:17:43 2025 +0200
@@ -111,7 +111,6 @@
         const void *data
 ) {
     cx_kv_list *kv_list = (cx_kv_list*)list;
-    // TODO: trick the base method by adding the required space for the key to the elem_size
     return kv_list->list_methods->insert_element(list, index, data);
 }
 
@@ -122,7 +121,6 @@
         size_t n
 ) {
     cx_kv_list *kv_list = (cx_kv_list*)list;
-    // TODO: trick the base method by adding the required space for the key to the elem_size
     return kv_list->list_methods->insert_array(list, index, data, n);
 }
 
@@ -132,7 +130,6 @@
         size_t n
 ) {
     cx_kv_list *kv_list = (cx_kv_list*)list;
-    // TODO: trick the base method by adding the required space for the key to the elem_size
     return kv_list->list_methods->insert_sorted(list, sorted_data, n);
 }
 
@@ -142,7 +139,6 @@
         int prepend
 ) {
     cx_kv_list *kv_list = iter->src_handle.m;
-    // TODO: trick the base method by adding the required space for the key to the elem_size
     return kv_list->list_methods->insert_iter(iter, elem, prepend);
 }
 
@@ -236,7 +232,6 @@
     cx_kv_list *kv_list = ((struct cx_kv_list_map_s*)map)->list;
     // insert the data into the list first (assume that insertion destroys the sorted property)
     kv_list->list.base.collection.sorted = false;
-    // TODO: use the same trick as above to increase the element size temporarily to add the key to the data
     void *node_data = kv_list->list_methods->insert_element(
         &kv_list->list.base, kv_list->list.base.collection.size,
         kv_list->list.base.collection.store_pointer ? &value : value);