14 static void lv_test_constructor(const lv_tree_class_t * class_p, lv_tree_node_t * node)  in lv_test_constructor()  argument
17     lv_test_node_t * t = (lv_test_node_t *)node;  in lv_test_constructor()
22 static void lv_test_destructor(const lv_tree_class_t * class_p, lv_tree_node_t * node)  in lv_test_destructor()  argument
25     lv_test_node_t * t = (lv_test_node_t *)node;  in lv_test_destructor()
39     lv_tree_node_t * node = lv_tree_node_create(MY_CLASS, (lv_tree_node_t *)parent);  in lv_test_create()  local
40     return (lv_test_node_t *)node;  in lv_test_create()
43 static void lv_test_delete(lv_test_node_t * node)  in lv_test_delete()  argument
45     lv_tree_node_delete((lv_tree_node_t *)node);  in lv_test_delete()
62     lv_test_node_t * node = lv_test_create(test);  in testCreateAndDelete()  local
64     TEST_ASSERT_EQUAL_UINT32(0, node->base.child_cnt);  in testCreateAndDelete()
65     TEST_ASSERT_EQUAL(test, node->base.parent);  in testCreateAndDelete()
68     TEST_ASSERT_EQUAL_INT32(100, node->data1);  in testCreateAndDelete()
69     TEST_ASSERT_EQUAL_FLOAT(100.0f, node->data2);  in testCreateAndDelete()
71     lv_test_delete(node);  in testCreateAndDelete()
80 static bool test_walk_cb(const lv_tree_node_t * node, void * data)  in test_walk_cb()  argument
82     lv_test_node_t * n = (lv_test_node_t *)node;  in test_walk_cb()
91     lv_test_node_t * node = lv_test_create(test);  in testBuildTree()  local
92     node->data1 = 0;  in testBuildTree()
95         lv_test_node_t * snode = lv_test_create(node);  in testBuildTree()
99     TEST_ASSERT_EQUAL(16, node->base.child_cnt);  in testBuildTree()
100     lv_test_delete(node);  in testBuildTree()
105     lv_test_node_t * node = lv_test_create(test);  in testWalkTree()  local
106     node->data1 = 1;  in testWalkTree()
108     lv_test_node_t * node1 = lv_test_create(node);  in testWalkTree()
110     lv_test_node_t * node2 = lv_test_create(node);  in testWalkTree()
127 …  lv_tree_walk((lv_tree_node_t *)node, LV_TREE_WALK_POST_ORDER, test_walk_cb, NULL, NULL, &result);  in testWalkTree()
135     lv_tree_walk((lv_tree_node_t *)node, LV_TREE_WALK_PRE_ORDER, test_walk_cb, NULL, NULL, &result);  in testWalkTree()
145     lv_tree_walk((lv_tree_node_t *)node, LV_TREE_WALK_PRE_ORDER, test_walk_cb, NULL, NULL, &result);  in testWalkTree()
151     lv_test_delete(node);  in testWalkTree()
154 static bool test_search_cb(const lv_tree_node_t * node, void * data)  in test_search_cb()  argument
156     lv_test_node_t * n = (lv_test_node_t *)node;  in test_search_cb()
167 static bool test_before_search_cb(const lv_tree_node_t * node, void * data)  in test_before_search_cb()  argument
169     LV_UNUSED(node);  in test_before_search_cb()
174 static void test_after_search_cb(const lv_tree_node_t * node, void * data)  in test_after_search_cb()  argument
176     LV_UNUSED(node);  in test_after_search_cb()
182     lv_test_node_t * node = lv_test_create(test);  in testTreeSearch()  local
183     node->data1 = 1;  in testTreeSearch()
185     lv_test_node_t * node1 = lv_test_create(node);  in testTreeSearch()
187     lv_test_node_t * node2 = lv_test_create(node);  in testTreeSearch()
195 …lv_tree_walk((lv_tree_node_t *)node, LV_TREE_WALK_PRE_ORDER, test_search_cb, test_before_search_cb,  in testTreeSearch()
204 …lv_tree_walk((lv_tree_node_t *)node, LV_TREE_WALK_POST_ORDER, test_search_cb, test_before_search_c…  in testTreeSearch()
210     lv_test_delete(node);  in testTreeSearch()