Lines Matching full:tree
10 #include "qemu/interval-tree.h"
40 /* Create a tree of a single node, which is the point [1,1]. */ in test_find_one_point()
64 /* Create a tree of a two nodes, which are both the point [1,1]. */ in test_find_two_point()
89 /* Create a tree of a single node, which is the range [1,8]. */ in test_find_one_range()
112 * Create a tree of many nodes in [0,99] and [200,299], in test_find_one_range_many()
200 g_test_add_func("/interval-tree/empty", test_empty); in main()
201 g_test_add_func("/interval-tree/find-one-point", test_find_one_point); in main()
202 g_test_add_func("/interval-tree/find-two-point", test_find_two_point); in main()
203 g_test_add_func("/interval-tree/find-one-range", test_find_one_range); in main()
204 g_test_add_func("/interval-tree/find-one-range-many", in main()
206 g_test_add_func("/interval-tree/find-many-range", test_find_many_range); in main()