Make BBH::search() const.

src/core/SkQuadTree.cpp

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkQuadTree.h"
 #include "SkTSort.h"
 #include <stdio.h>
@@ skipping 150 matching lines @@
     Entry* entry = fEntryPool.acquire();
     entry->fData = data;
     entry->fBounds = bounds;
     if (NULL == fRoot) {
         fDeferred.push(entry);
     } else {
         this->insert(fRoot, entry);
     }
 }
 
-void SkQuadTree::search(const SkIRect& query, SkTDArray<void*>* results) {
+void SkQuadTree::search(const SkIRect& query, SkTDArray<void*>* results) const {
     SkASSERT(NULL != fRoot);
     SkASSERT(NULL != results);
     if (SkIRect::Intersects(fRootBounds, query)) {
         this->search(fRoot, query, results);
     }
 }
 
 void SkQuadTree::clear() {
     this->flushDeferredInserts();
     if (NULL != fRoot) {
@@ skipping 28 matching lines @@
 
 void SkQuadTree::flushDeferredInserts() {
     if (NULL == fRoot) {
         fRoot = fNodePool.acquire();
         fRoot->fBounds = fRootBounds;
     }
     while(!fDeferred.isEmpty()) {
         this->insert(fRoot, fDeferred.pop());
     }
 }