Revert of Convert BBH APIs to use SkRect.

tests/RTreeTest.cpp

Index: tests/RTreeTest.cpp
diff --git a/tests/RTreeTest.cpp b/tests/RTreeTest.cpp
index 087f19a7ef162ae229ce800bc66b6aee2a7c2aef..ae8c005170e5f1c61565122b5377d59f843db755 100644
--- a/tests/RTreeTest.cpp
+++ b/tests/RTreeTest.cpp
@@ -18,17 +18,17 @@
 static const size_t NUM_QUERIES = 50;
 
 struct DataRect {
-    SkRect rect;
+    SkIRect rect;
     void* data;
 };
 
-static SkRect random_rect(SkRandom& rand) {
-    SkRect rect = {0,0,0,0};
+static SkIRect random_rect(SkRandom& rand) {
+    SkIRect rect = {0,0,0,0};
     while (rect.isEmpty()) {
-        rect.fLeft   = rand.nextRangeF(0, 1000);
-        rect.fRight  = rand.nextRangeF(0, 1000);
-        rect.fTop    = rand.nextRangeF(0, 1000);
-        rect.fBottom = rand.nextRangeF(0, 1000);
+        rect.fLeft   = rand.nextS() % 1000;
+        rect.fRight  = rand.nextS() % 1000;
+        rect.fTop    = rand.nextS() % 1000;
+        rect.fBottom = rand.nextS() % 1000;
         rect.sort();
     }
     return rect;
@@ -41,16 +41,12 @@
     }
 }
 
-static bool verify_query(SkRect query, DataRect rects[],
+static bool verify_query(SkIRect query, DataRect rects[],
                          SkTDArray<void*>& found) {
-    // TODO(mtklein): no need to do this after everything's SkRects
-    query.roundOut();
-
     SkTDArray<void*> expected;
-
     // manually intersect with every rectangle
     for (int i = 0; i < NUM_RECTS; ++i) {
-        if (SkRect::Intersects(query, rects[i].rect)) {
+        if (SkIRect::IntersectsNoEmptyCheck(query, rects[i].rect)) {
             expected.push(rects[i].data);
         }
     }
@@ -75,7 +71,7 @@
                        SkRTree& tree) {
     for (size_t i = 0; i < NUM_QUERIES; ++i) {
         SkTDArray<void*> hits;
-        SkRect query = random_rect(rand);
+        SkIRect query = random_rect(rand);
         tree.search(query, &hits);
         REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
     }