Lines Matching defs:rtree
84 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN);
85 SkAutoUnref au(rtree);
86 REPORTER_ASSERT(reporter, NULL != rtree);
110 rtree->insert(rects[i].data, rects[i].rect, true);
112 rtree->flushDeferredInserts();
113 runQueries(reporter, rand, rects, *rtree);
114 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
115 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
116 expectedDepthMax >= rtree->getDepth());
117 rtree->clear();
118 REPORTER_ASSERT(reporter, 0 == rtree->getCount());
122 rtree->insert(rects[i].data, rects[i].rect);
124 runQueries(reporter, rand, rects, *rtree);
125 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
126 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
127 expectedDepthMax >= rtree->getDepth());
128 rtree->clear();
129 REPORTER_ASSERT(reporter, 0 == rtree->getCount());
133 rtree->insert(rects[i].data, rects[i].rect);
135 runQueries(reporter, rand, rects, *rtree);
136 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
137 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
138 expectedDepthMax >= rtree->getDepth());
139 rtree->clear();
140 REPORTER_ASSERT(reporter, 0 == rtree->getCount());
145 DEFINE_TESTCLASS("RTree", RTreeTestClass, TestRTree)
