--- a/src/cx/linked_list.h Sat Oct 11 11:55:46 2025 +0200 +++ b/src/cx/linked_list.h Sat Oct 11 15:42:48 2025 +0200 @@ -448,7 +448,6 @@ * * If either the list starting with the node pointed to by @p begin or the list * starting with @p insert_begin is not sorted, the behavior is undefined. - * Also, the chain to be inserted must not contain duplicates within itself. * * @attention In contrast to cx_linked_list_insert_sorted(), not all nodes of the * chain might be added. This function returns a new chain consisting of all the duplicates. @@ -459,7 +458,7 @@ * @param loc_next the location of a @c next pointer within your node struct (required) * @param insert_begin a pointer to the first node of the chain that shall be inserted * @param cmp_func a compare function that will receive the node pointers - * @return a pointer to a new chain with all duplicates which were not inserted (or @c NULL when there were no duplicates) + * @return a pointer to a new chain with all duplicates that were not inserted (or @c NULL when there were no duplicates) */ cx_attr_nonnull_arg(1, 5, 6) cx_attr_nodiscard