• Home
  • Raw
  • Download

Lines Matching refs:rtree

80 static void rtree_test_main(SkRTree* rtree, skiatest::Reporter* reporter) {  in rtree_test_main()  argument
83 REPORTER_ASSERT(reporter, NULL != rtree); in rtree_test_main()
107 rtree->insert(rects[i].data, rects[i].rect, true); in rtree_test_main()
109 rtree->flushDeferredInserts(); in rtree_test_main()
110 run_queries(reporter, rand, rects, *rtree); in rtree_test_main()
111 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); in rtree_test_main()
112 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && in rtree_test_main()
113 expectedDepthMax >= rtree->getDepth()); in rtree_test_main()
114 rtree->clear(); in rtree_test_main()
115 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); in rtree_test_main()
119 rtree->insert(rects[i].data, rects[i].rect); in rtree_test_main()
121 run_queries(reporter, rand, rects, *rtree); in rtree_test_main()
122 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); in rtree_test_main()
123 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && in rtree_test_main()
124 expectedDepthMax >= rtree->getDepth()); in rtree_test_main()
125 rtree->clear(); in rtree_test_main()
126 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); in rtree_test_main()
130 rtree->insert(rects[i].data, rects[i].rect); in rtree_test_main()
132 run_queries(reporter, rand, rects, *rtree); in rtree_test_main()
133 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); in rtree_test_main()
134 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && in rtree_test_main()
135 expectedDepthMax >= rtree->getDepth()); in rtree_test_main()
136 rtree->clear(); in rtree_test_main()
137 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); in rtree_test_main()
142 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); in DEF_TEST() local
143 SkAutoUnref au(rtree); in DEF_TEST()
144 rtree_test_main(rtree, reporter); in DEF_TEST()