Lines Matching full:rtree
22 rtree_t rtree;
23 assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),
25 assert_ptr_null(rtree_get(&rtree, 0, false),
27 rtree_delete(&rtree);
38 rtree_t rtree;
39 assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),
42 assert_false(rtree_set(&rtree, 0, &node_a),
44 assert_ptr_eq(rtree_get(&rtree, 0, true), &node_a,
47 assert_false(rtree_set(&rtree, ~((uintptr_t)0), &node_b),
49 assert_ptr_eq(rtree_get(&rtree, ~((uintptr_t)0), true), &node_b,
52 rtree_delete(&rtree);
65 rtree_t rtree;
67 assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),
71 assert_false(rtree_set(&rtree, keys[j], &node),
74 assert_ptr_eq(rtree_get(&rtree, keys[k], true),
81 assert_ptr_null(rtree_get(&rtree,
83 "Only leftmost rtree leaf should be set; "
85 assert_false(rtree_set(&rtree, keys[j], NULL),
89 rtree_delete(&rtree);
106 rtree_t rtree;
108 assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),
113 assert_false(rtree_set(&rtree, keys[j], &node),
115 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node,
119 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node,
124 assert_false(rtree_set(&rtree, keys[j], NULL),
126 assert_ptr_null(rtree_get(&rtree, keys[j], true),
130 assert_ptr_null(rtree_get(&rtree, keys[j], true),
134 rtree_delete(&rtree);
