| Index: tests/RTreeTest.cpp
|
| diff --git a/tests/RTreeTest.cpp b/tests/RTreeTest.cpp
|
| index 16ccb4f508f6db4be910978a3a4c36c2c6045de1..b39af6747ebbd89d63b2ebc968472ac887ab7a5b 100644
|
| --- a/tests/RTreeTest.cpp
|
| +++ b/tests/RTreeTest.cpp
|
| @@ -25,8 +25,8 @@ static SkRect random_rect(SkRandom& rand) {
|
| return rect;
|
| }
|
|
|
| -static bool verify_query(SkRect query, SkRect rects[], SkTDArray<unsigned>& found) {
|
| - SkTDArray<unsigned> expected;
|
| +static bool verify_query(SkRect query, SkRect rects[], SkTDArray<int>& found) {
|
| + SkTDArray<int> expected;
|
| // manually intersect with every rectangle
|
| for (int i = 0; i < NUM_RECTS; ++i) {
|
| if (SkRect::Intersects(query, rects[i])) {
|
| @@ -46,7 +46,7 @@ static bool verify_query(SkRect query, SkRect rects[], SkTDArray<unsigned>& foun
|
| static void run_queries(skiatest::Reporter* reporter, SkRandom& rand, SkRect rects[],
|
| const SkRTree& tree) {
|
| for (size_t i = 0; i < NUM_QUERIES; ++i) {
|
| - SkTDArray<unsigned> hits;
|
| + SkTDArray<int> hits;
|
| SkRect query = random_rect(rand);
|
| tree.search(query, &hits);
|
| REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
|
|
|