diff -r 68b75c091028 -r 55b13f583356 tests/test_tree.c
--- a/tests/test_tree.c	Sun Dec 14 16:21:09 2025 +0100
+++ b/tests/test_tree.c	Sun Dec 14 17:30:17 2025 +0100
@@ -2188,7 +2188,7 @@
         // for the subtree, we use a little trick and wrap it in a new tree
         CxTree *foo_tree = cxTreeCreateWrapped(alloc, foo, tree_node_file_layout);
         foo_tree->collection.allocator = alloc;
-        cxDefineAdvancedDestructor(foo_tree, cxFree, alloc);
+        cxSetAdvancedDestructor(foo_tree, cxFree, alloc);
         cxTreeFree(foo_tree);
         CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc));
     }
@@ -2306,7 +2306,7 @@
         cxTreeFree(tree);
         CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc));
         CxTree *w = cxTreeCreateWrapped(alloc, root, tree_node_file_layout);
-        cxDefineAdvancedDestructor(w, cxFree, alloc);
+        cxSetAdvancedDestructor(w, cxFree, alloc);
         cxTreeDestroySubtree(w, w->root);
         CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc));
         cxTreeFree(w);
@@ -2326,7 +2326,7 @@
     cx_tree_link(&child1, &child3, tree_node_layout);
     CX_TEST_DO {
         CxTree *tree = cxTreeCreateWrapped(cxDefaultAllocator, &root, tree_node_layout);
-        cxDefineDestructor(tree,test_tree_high_simple_destructor_func);
+        cxSetDestructor(tree,test_tree_high_simple_destructor_func);
         cxTreeDestroyNode(tree, &child1, NULL);
         cxTreeFree(tree);
         CX_TEST_ASSERT(root.data == 1);