| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "Test.h" | 8 #include "Test.h" |
| 9 #include "TestClassDef.h" | |
| 10 #include "SkRandom.h" | 9 #include "SkRandom.h" |
| 11 #include "SkRTree.h" | 10 #include "SkRTree.h" |
| 12 #include "SkTSort.h" | 11 #include "SkTSort.h" |
| 13 | 12 |
| 14 static const size_t MIN_CHILDREN = 6; | 13 static const size_t MIN_CHILDREN = 6; |
| 15 static const size_t MAX_CHILDREN = 11; | 14 static const size_t MAX_CHILDREN = 11; |
| 16 | 15 |
| 17 static const int NUM_RECTS = 200; | 16 static const int NUM_RECTS = 200; |
| 18 static const size_t NUM_ITERATIONS = 100; | 17 static const size_t NUM_ITERATIONS = 100; |
| 19 static const size_t NUM_QUERIES = 50; | 18 static const size_t NUM_QUERIES = 50; |
| (...skipping 122 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 142 DEF_TEST(RTree, reporter) { | 141 DEF_TEST(RTree, reporter) { |
| 143 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); | 142 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); |
| 144 SkAutoUnref au(rtree); | 143 SkAutoUnref au(rtree); |
| 145 rtree_test_main(rtree, reporter); | 144 rtree_test_main(rtree, reporter); |
| 146 | 145 |
| 147 // Rtree that orders input rectangles on deferred insert. | 146 // Rtree that orders input rectangles on deferred insert. |
| 148 SkRTree* unsortedRtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN, 1, fals
e); | 147 SkRTree* unsortedRtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN, 1, fals
e); |
| 149 SkAutoUnref auo(unsortedRtree); | 148 SkAutoUnref auo(unsortedRtree); |
| 150 rtree_test_main(unsortedRtree, reporter); | 149 rtree_test_main(unsortedRtree, reporter); |
| 151 } | 150 } |
| OLD | NEW |