--- a/tests/test_list.c Sun Dec 14 16:15:57 2025 +0100 +++ b/tests/test_list.c Sun Dec 14 16:21:09 2025 +0100 @@ -3255,12 +3255,12 @@ CX_TEST_DO { // clone a into d1 - CX_TEST_ASSERT(0 == cxListCloneSimple(d1, la)); + CX_TEST_ASSERT(0 == cxListCloneShallow(d1, la)); CX_TEST_ASSERT(0 == cxListCompare(d1, la)); CX_TEST_ASSERT(cxCollectionSorted(d1)); // union of a (in d1) and b - CX_TEST_ASSERT(0 == cxListUnionSimple(d2, d1, lb)); + CX_TEST_ASSERT(0 == cxListUnionShallow(d2, d1, lb)); CX_TEST_ASSERT(cxCollectionSorted(d2)); CxList *expected_union = cxArrayListCreateSimple(sizeof(int), 8); { @@ -3272,7 +3272,7 @@ // intersection of (a union b) and c cxListClear(d1); - CX_TEST_ASSERT(0 == cxListIntersectionSimple(d1, d2, lc)); + CX_TEST_ASSERT(0 == cxListIntersectionShallow(d1, d2, lc)); CX_TEST_ASSERT(cxCollectionSorted(d1)); CxList *expected_intersection = cxArrayListCreateSimple(sizeof(int), 8); { @@ -3284,7 +3284,7 @@ // difference of ((a union b) intersect c) minus d cxListClear(d2); - CX_TEST_ASSERT(0 == cxListDifferenceSimple(d2, d1, ld)); + CX_TEST_ASSERT(0 == cxListDifferenceShallow(d2, d1, ld)); CX_TEST_ASSERT(cxCollectionSorted(d2)); CxList *expected_difference = cxArrayListCreateSimple(sizeof(int), 8); {