aboutsummaryrefslogtreecommitdiffhomepage
path: root/tests/RTreeTest.cpp
diff options
context:
space:
mode:
authorGravatar robertphillips@google.com <robertphillips@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81>2012-09-13 13:25:30 +0000
committerGravatar robertphillips@google.com <robertphillips@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81>2012-09-13 13:25:30 +0000
commit178a267a6cb1405805caf23fe074d68b509f76d3 (patch)
tree3197ca79129e1b86315688216003021d910e51dd /tests/RTreeTest.cpp
parent1f1543f012b8834ea760175a023eb127bde2b895 (diff)
Address warnings from clang build bot
Diffstat (limited to 'tests/RTreeTest.cpp')
-rw-r--r--tests/RTreeTest.cpp10
1 files changed, 5 insertions, 5 deletions
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<void*>& found) {
SkTDArray<void*> 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<void*> 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);