From 178a267a6cb1405805caf23fe074d68b509f76d3 Mon Sep 17 00:00:00 2001 From: "robertphillips@google.com" Date: Thu, 13 Sep 2012 13:25:30 +0000 Subject: Address warnings from clang build bot http://codereview.appspot.com/6506111/ git-svn-id: http://skia.googlecode.com/svn/trunk@5518 2bbb7eff-a529-9590-31e7-b0007b416f81 --- tests/RTreeTest.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'tests/RTreeTest.cpp') diff --git a/tests/RTreeTest.cpp b/tests/RTreeTest.cpp index d60bf0c08a..0e063378f5 100644 --- a/tests/RTreeTest.cpp +++ b/tests/RTreeTest.cpp @@ -46,7 +46,7 @@ static bool verify_query(SkIRect query, DataRect rects[], SkTDArray& found) { SkTDArray expected; // manually intersect with every rectangle - for (int i = 0; i < NUM_RECTS; ++i) { + for (size_t i = 0; i < NUM_RECTS; ++i) { if (SkIRect::IntersectsNoEmptyCheck(query, rects[i].rect)) { expected.push(rects[i].data); } @@ -70,7 +70,7 @@ static bool verify_query(SkIRect query, DataRect rects[], static void runQueries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[], SkRTree& tree) { - for (int i = 0; i < NUM_QUERIES; ++i) { + for (size_t i = 0; i < NUM_QUERIES; ++i) { SkTDArray hits; SkIRect query = random_rect(rand); tree.search(query, &hits); @@ -102,11 +102,11 @@ static void TestRTree(skiatest::Reporter* reporter) { ++expectedDepthMax; } - for (int i = 0; i < NUM_ITERATIONS; ++i) { + for (size_t i = 0; i < NUM_ITERATIONS; ++i) { random_data_rects(rand, rects, NUM_RECTS); // First try bulk-loaded inserts - for (int i = 0; i < NUM_RECTS; ++i) { + for (size_t i = 0; i < NUM_RECTS; ++i) { rtree->insert(rects[i].data, rects[i].rect, true); } rtree->flushDeferredInserts(); @@ -118,7 +118,7 @@ static void TestRTree(skiatest::Reporter* reporter) { REPORTER_ASSERT(reporter, 0 == rtree->getCount()); // Then try immediate inserts - for (int i = 0; i < NUM_RECTS; ++i) { + for (size_t i = 0; i < NUM_RECTS; ++i) { rtree->insert(rects[i].data, rects[i].rect); } runQueries(reporter, rand, rects, *rtree); -- cgit v1.2.3