| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #ifndef SkBBoxHierarchy_DEFINED | 8 #ifndef SkBBoxHierarchy_DEFINED |
| 9 #define SkBBoxHierarchy_DEFINED | 9 #define SkBBoxHierarchy_DEFINED |
| 10 | 10 |
| (...skipping 15 matching lines...) Expand all Loading... |
| 26 * Insert N bounding boxes into the hierarchy. | 26 * Insert N bounding boxes into the hierarchy. |
| 27 * The SkBBoxHierarchy may take ownership of boundsArray by calling detach()
. | 27 * The SkBBoxHierarchy may take ownership of boundsArray by calling detach()
. |
| 28 */ | 28 */ |
| 29 virtual void insert(SkAutoTMalloc<SkRect>* boundsArray, int N) = 0; | 29 virtual void insert(SkAutoTMalloc<SkRect>* boundsArray, int N) = 0; |
| 30 | 30 |
| 31 /** | 31 /** |
| 32 * Populate results with the indices of bounding boxes interesecting that qu
ery. | 32 * Populate results with the indices of bounding boxes interesecting that qu
ery. |
| 33 */ | 33 */ |
| 34 virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const
= 0; | 34 virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const
= 0; |
| 35 | 35 |
| 36 virtual size_t bytesUsed() const = 0; |
| 37 |
| 36 SK_DECLARE_INST_COUNT(SkBBoxHierarchy) | 38 SK_DECLARE_INST_COUNT(SkBBoxHierarchy) |
| 37 private: | 39 private: |
| 38 typedef SkRefCnt INHERITED; | 40 typedef SkRefCnt INHERITED; |
| 39 }; | 41 }; |
| 40 | 42 |
| 41 #endif | 43 #endif |
| OLD | NEW |