Wed, 20 Mar 2024 23:35:32 +0100
add missing cxTreeVisitorDispose() test
tests/test_tree.c | file | annotate | diff | comparison | revisions |
1.1 --- a/tests/test_tree.c Wed Mar 20 23:35:18 2024 +0100 1.2 +++ b/tests/test_tree.c Wed Mar 20 23:35:32 2024 +0100 1.3 @@ -509,6 +509,27 @@ 1.4 cx_testing_allocator_destroy(&talloc); 1.5 } 1.6 1.7 +CX_TEST(test_tree_visitor_create_and_dispose) { 1.8 + tree_node root; 1.9 + tree_node child; 1.10 + cx_tree_link(&root, &child, tree_node_layout); 1.11 + CX_TEST_DO { 1.12 + CxTreeVisitor iter = cx_tree_visitor(&root, tree_child_list); 1.13 + CX_TEST_ASSERT(iter.counter == 1); 1.14 + CX_TEST_ASSERT(iter.node == &root); 1.15 + CX_TEST_ASSERT(!iter.base.mutating); 1.16 + CX_TEST_ASSERT(!iter.base.remove); 1.17 + CX_TEST_ASSERT(iter.queue_next != NULL); 1.18 + CX_TEST_ASSERT(iter.queue_last != NULL); 1.19 + CX_TEST_ASSERT(iter.depth == 1); 1.20 + CX_TEST_ASSERT(iter.loc_next == offsetof(tree_node, next)); 1.21 + CX_TEST_ASSERT(iter.loc_children == offsetof(tree_node, children)); 1.22 + cxTreeVisitorDispose(&iter); 1.23 + CX_TEST_ASSERT(iter.queue_next == NULL); 1.24 + CX_TEST_ASSERT(iter.queue_last == NULL); 1.25 + } 1.26 +} 1.27 + 1.28 CX_TEST(test_tree_visitor) { 1.29 tree_node root = {0}; 1.30 tree_node a = {0};