Make BBH::search() const.

src/core/SkRTree.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 SkRTree_DEFINED
 #define SkRTree_DEFINED
@@ skipping 59 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;
     bool isEmpty() const { return 0 == fCount; }
 
     /**
      * Gets the depth of the tree structure
      */
     virtual int getDepth() const SK_OVERRIDE {
         return this->isEmpty() ? 0 : fRoot.fChild.subtree->fLevel + 1;
     }
@@ skipping 79 matching lines @@
      * repeated insertions.
      *
      * This consumes the input array.
      *
      * TODO: Experiment with other bulk-load algorithms (in particular the Hilbert pack variant,
      * which groups rects by position on the Hilbert curve, is probably worth a look). There also
      * exist top-down bulk load variants (VAMSplit, TopDownGreedy, etc).
      */
     Branch bulkLoad(SkTDArray<Branch>* branches, int level = 0);
 
-    void validate();
-    int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false);
+    void validate() const;
+    int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false) const;
 
     const int fMinChildren;
     const int fMaxChildren;
     const size_t fNodeSize;
 
     // This is the count of data elements (rather than total nodes in the tree)
     int fCount;
 
     Branch fRoot;
     SkChunkAlloc fNodes;
     SkTDArray<Branch> fDeferredInserts;
     SkScalar fAspectRatio;
     bool fSortWhenBulkLoading;
 
     Node* allocateNode(uint16_t level);
 
     typedef SkBBoxHierarchy INHERITED;
 };
 
 #endif