Lines Matching defs:rtree
84 static void rtree_test_main(SkRTree* rtree, skiatest::Reporter* reporter) {
87 REPORTER_ASSERT(reporter, rtree);
111 rtree->insert(rects[i].data, rects[i].rect, true);
113 rtree->flushDeferredInserts();
114 run_queries(reporter, rand, rects, *rtree);
115 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
116 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
117 expectedDepthMax >= rtree->getDepth());
118 rtree->clear();
119 REPORTER_ASSERT(reporter, 0 == rtree->getCount());
123 rtree->insert(rects[i].data, rects[i].rect);
125 run_queries(reporter, rand, rects, *rtree);
126 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
127 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
128 expectedDepthMax >= rtree->getDepth());
129 rtree->clear();
130 REPORTER_ASSERT(reporter, 0 == rtree->getCount());
134 rtree->insert(rects[i].data, rects[i].rect);
136 run_queries(reporter, rand, rects, *rtree);
137 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
138 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
139 expectedDepthMax >= rtree->getDepth());
140 rtree->clear();
141 REPORTER_ASSERT(reporter, 0 == rtree->getCount());
145 DEF_TEST(RTree, reporter) {
146 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN);
147 SkAutoUnref au(rtree);
148 rtree_test_main(rtree, reporter);
150 // Rtree that orders input rectangles on deferred insert.
