--- a/src/cx/list.h Sat Oct 11 11:55:46 2025 +0200 +++ b/src/cx/list.h Sat Oct 11 15:42:48 2025 +0200 @@ -283,7 +283,6 @@ * Default implementation of an array insert where only elements are inserted when they don't exist in the list. * * This function is similar to cx_list_default_insert_sorted(), except it skips elements that are already in the list. - * The @p sorted_data itself must not contain duplicates. * * @note The return value of this function denotes the number of elements from the @p sorted_data that are definitely * contained in the list after completing the call. It is @em not the number of elements that were newly inserted. @@ -625,7 +624,7 @@ * be an array of pointers. * * If the list is not sorted already, the behavior is undefined. - * This is also the case when the @p array is not sorted or already contains duplicates. + * This is also the case when the @p array is not sorted. * * @param list the list * @param array a pointer to the elements to add