DEF_TEST(BBoxHierarchy, reporter) { // RTree { SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN); SkAutoUnref au(rtree); tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); // Rtree that orders input rectangles on deferred insert. SkRTree* unsortedRtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, 1, false); SkAutoUnref auo(unsortedRtree); tree_test_main(unsortedRtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); } // QuadTree { SkQuadTree* quadtree = SkQuadTree::Create( SkIRect::MakeLTRB(-MAX_SIZE, -MAX_SIZE, MAX_SIZE, MAX_SIZE)); SkAutoUnref au(quadtree); tree_test_main(quadtree, QUADTREE_MIN_CHILDREN, QUADTREE_MAX_CHILDREN, reporter); // QuadTree that orders input rectangles on deferred insert. SkQuadTree* unsortedQuadTree = SkQuadTree::Create( SkIRect::MakeLTRB(-MAX_SIZE, -MAX_SIZE, MAX_SIZE, MAX_SIZE)); SkAutoUnref auo(unsortedQuadTree); tree_test_main(unsortedQuadTree, QUADTREE_MIN_CHILDREN, QUADTREE_MAX_CHILDREN, reporter); } }
DEF_TEST(RTree, reporter) { SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); SkAutoUnref au(rtree); rtree_test_main(rtree, reporter); // Rtree that orders input rectangles on deferred insert. SkRTree* unsortedRtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN, 1, false); SkAutoUnref auo(unsortedRtree); rtree_test_main(unsortedRtree, reporter); }
DEF_TEST(BBoxHierarchy, reporter) { // RTree { SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN); SkAutoUnref au(rtree); tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); // Rtree that orders input rectangles on deferred insert. SkRTree* unsortedRtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, 1, false); SkAutoUnref auo(unsortedRtree); tree_test_main(unsortedRtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); } }