Make BBH::search() const.

src/core/SkQuadTree.h

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkQuadTree_DEFINED
 #define SkQuadTree_DEFINED
 
@@ skipping 36 matching lines @@
     virtual void insert(void* data, const SkIRect& bounds, bool defer = false) SK_OVERRIDE;
 
     /**
      * If any inserts have been deferred, this will add them into the tree
      */
     virtual void flushDeferredInserts() SK_OVERRIDE;
 
     /**
      * Given a query rectangle, populates the passed-in array with the elements it intersects
      */
-    virtual void search(const SkIRect& query, SkTDArray<void*>* results) SK_OVERRIDE;
+    virtual void search(const SkIRect& query, SkTDArray<void*>* results) const SK_OVERRIDE;
 
     virtual void clear() SK_OVERRIDE;
 
     /**
      * Gets the depth of the tree structure
      */
     virtual int getDepth() const SK_OVERRIDE;
 
     /**
      * This gets the insertion count (rather than the node count)
@@ skipping 36 matching lines @@
     void insert(Node* node, Entry* entry);
     void split(Node* node);
     void search(Node* node, const SkIRect& query, SkTDArray<void*>* results) const;
     void clear(Node* node);
     int getDepth(Node* node) const;
 
     typedef SkBBoxHierarchy INHERITED;
 };
 
 #endif