Convert BBH APIs to use SkRect.

src/core/SkBBoxHierarchy.h

 
 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkBBoxHierarchy_DEFINED
 #define SkBBoxHierarchy_DEFINED
@@ skipping 31 matching lines @@
 
     /**
      * Insert a data pointer and corresponding bounding box
      * @param data The data pointer, may be NULL
      * @param bounds The bounding box, should not be empty
      * @param defer Whether or not it is acceptable to delay insertion of this element (building up
      *        an entire spatial data structure at once is often faster and produces better
      *        structures than repeated inserts) until flushDeferredInserts is called or the first
      *        search.
      */
-    virtual void insert(void* data, const SkIRect& bounds, bool defer = false) = 0;
+    virtual void insert(void* data, const SkRect& bounds, bool defer = false) = 0;
 
     /**
      * If any insertions have been deferred, this forces them to be inserted
      */
     virtual void flushDeferredInserts() = 0;
 
     /**
      * Populate 'results' with data pointers corresponding to bounding boxes that intersect 'query'
      */
-    virtual void search(const SkIRect& query, SkTDArray<void*>* results) const = 0;
+    virtual void search(const SkRect& query, SkTDArray<void*>* results) const = 0;
 
     virtual void clear() = 0;
 
     /**
      * Gets the number of insertions actually made (does not include deferred insertions)
      */
     virtual int getCount() const = 0;
 
     /**
      * Returns the depth of the currently allocated tree. The root node counts for 1 level,
@@ skipping 16 matching lines @@
     void setClient(SkBBoxHierarchyClient* client) { fClient = client; }
 
 protected:
     SkBBoxHierarchyClient* fClient;
 
 private:
     typedef SkRefCnt INHERITED;
 };
 
 #endif