diff options
author | 2014-08-26 14:07:04 -0700 | |
---|---|---|
committer | 2014-08-26 14:07:04 -0700 | |
commit | 2a65a238b0e688356aee09d08f3f8a317359b4d2 (patch) | |
tree | 4ba271569b87c2e01d6e5451d8074c433f8d1d99 /tests/BBoxHierarchyTest.cpp | |
parent | 8a914a76501d0bb4c60f8dbd1ae39c864688695b (diff) |
Remove SkQuadTree.
We're not testing it to the same degree we do RTree and TileGrid. Any changes
we'll make to BBH APIs become 33% easier without it. If find we want it again,
we can always resurrect it.
BUG=skia:1021,skia:2834
R=robertphillips@google.com, mtklein@google.com
TBR=reed
Author: mtklein@chromium.org
Review URL: https://codereview.chromium.org/500373005
Diffstat (limited to 'tests/BBoxHierarchyTest.cpp')
-rw-r--r-- | tests/BBoxHierarchyTest.cpp | 17 |
1 files changed, 0 insertions, 17 deletions
diff --git a/tests/BBoxHierarchyTest.cpp b/tests/BBoxHierarchyTest.cpp index 662cc370e7..305543b7eb 100644 --- a/tests/BBoxHierarchyTest.cpp +++ b/tests/BBoxHierarchyTest.cpp @@ -7,14 +7,11 @@ #include "Test.h" #include "SkRandom.h" -#include "SkQuadTree.h" #include "SkRTree.h" #include "SkTSort.h" static const size_t RTREE_MIN_CHILDREN = 6; static const size_t RTREE_MAX_CHILDREN = 11; -static const size_t QUADTREE_MIN_CHILDREN = 0; -static const size_t QUADTREE_MAX_CHILDREN = 0; // No hard limit for quadtree static const int NUM_RECTS = 200; static const size_t NUM_ITERATIONS = 100; @@ -167,18 +164,4 @@ DEF_TEST(BBoxHierarchy, reporter) { SkAutoUnref auo(unsortedRtree); tree_test_main(unsortedRtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); } - - // QuadTree - { - SkQuadTree* quadtree = SkNEW_ARGS(SkQuadTree, ( - 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 = SkNEW_ARGS(SkQuadTree, ( - SkIRect::MakeLTRB(-MAX_SIZE, -MAX_SIZE, MAX_SIZE, MAX_SIZE))); - SkAutoUnref auo(unsortedQuadTree); - tree_test_main(unsortedQuadTree, QUADTREE_MIN_CHILDREN, QUADTREE_MAX_CHILDREN, reporter); - } } |