diff -r 0ac4aa1737fd -r 6e0c3a8a914a tests/test_tree.c --- a/tests/test_tree.c Fri Oct 17 15:04:56 2025 +0200 +++ b/tests/test_tree.c Fri Oct 17 16:53:24 2025 +0200 @@ -657,7 +657,7 @@ CX_TEST_ASSERT(!iter.exiting); CX_TEST_ASSERT(iter.counter == 1); CX_TEST_ASSERT(iter.node == &root); - CX_TEST_ASSERT(!iter.base.mutating); + CX_TEST_ASSERT(!iter.base.allow_remove); CX_TEST_ASSERT(!iter.base.remove); CX_TEST_ASSERT(iter.stack != NULL); CX_TEST_ASSERT(iter.stack_capacity > 0); @@ -677,7 +677,7 @@ CX_TEST_ASSERT(!iter.exiting); CX_TEST_ASSERT(iter.counter == 0); CX_TEST_ASSERT(iter.node == NULL); - CX_TEST_ASSERT(!iter.base.mutating); + CX_TEST_ASSERT(!iter.base.allow_remove); CX_TEST_ASSERT(!iter.base.remove); CX_TEST_ASSERT(iter.stack == NULL); CX_TEST_ASSERT(iter.stack_capacity == 0); @@ -1017,7 +1017,7 @@ CxTreeVisitor iter = cx_tree_visitor(&root, tree_children(tree_node)); CX_TEST_ASSERT(iter.counter == 1); CX_TEST_ASSERT(iter.node == &root); - CX_TEST_ASSERT(!iter.base.mutating); + CX_TEST_ASSERT(!iter.base.allow_remove); CX_TEST_ASSERT(!iter.base.remove); CX_TEST_ASSERT(iter.queue_next != NULL); CX_TEST_ASSERT(iter.queue_last != NULL); @@ -1559,7 +1559,7 @@ CX_TEST_ASSERT(processed == 0); CX_TEST_ASSERT(talloc.alloc_total == 0); - CxIterator iter = cxIterator(NULL, sizeof(void *), 0); + CxIterator iter = cxIterator(NULL, sizeof(void *), 0, false); processed = cx_tree_add_iter( cxIteratorRef(iter), 10, // deliberately specify more than the iter has @@ -1669,7 +1669,7 @@ "/usr/lib/foo.so" }; // create iterator for 4 elements, but choose to insert only 3 of them - CxIterator iter = cxIterator(paths, sizeof(const char*), 4); + CxIterator iter = cxIterator(paths, sizeof(const char*), 4, false); size_t processed = cx_tree_add_iter( cxIteratorRef(iter), 3, tree_node_file_search,