OLD | NEW |
1 | 1 |
2 /* | 2 /* |
3 * Copyright 2012 Google Inc. | 3 * Copyright 2012 Google Inc. |
4 * | 4 * |
5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
7 */ | 7 */ |
8 | 8 |
9 #include "Test.h" | 9 #include "Test.h" |
10 #include "SkRandom.h" | 10 #include "SkRandom.h" |
(...skipping 127 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
138 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); | 138 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); |
139 } | 139 } |
140 } | 140 } |
141 | 141 |
142 static void test_rtree(skiatest::Reporter* reporter) { | 142 static void test_rtree(skiatest::Reporter* reporter) { |
143 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); | 143 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); |
144 SkAutoUnref au(rtree); | 144 SkAutoUnref au(rtree); |
145 rtree_test_main(rtree, reporter); | 145 rtree_test_main(rtree, reporter); |
146 | 146 |
147 // Rtree that orders input rectangles on deferred insert. | 147 // Rtree that orders input rectangles on deferred insert. |
148 SkRTree* unsortedRtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN, false); | 148 SkRTree* unsortedRtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN, 1, fals
e); |
149 SkAutoUnref auo(orderedRtree); | 149 SkAutoUnref auo(unsortedRtree); |
150 rtree_test_main(orderedRtree, reporter); | 150 rtree_test_main(unsortedRtree, reporter); |
151 } | 151 } |
152 | 152 |
153 | 153 |
154 #include "TestClassDef.h" | 154 #include "TestClassDef.h" |
155 DEFINE_TESTCLASS("RTree", RTreeTestClass, test_rtree) | 155 DEFINE_TESTCLASS("RTree", RTreeTestClass, test_rtree) |
OLD | NEW |