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 16 matching lines...) Expand all Loading... |
27 */ | 27 */ |
28 virtual void insert(const SkRect[], int N) = 0; | 28 virtual void insert(const SkRect[], int N) = 0; |
29 | 29 |
30 /** | 30 /** |
31 * Populate results with the indices of bounding boxes interesecting that qu
ery. | 31 * Populate results with the indices of bounding boxes interesecting that qu
ery. |
32 */ | 32 */ |
33 virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const
= 0; | 33 virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const
= 0; |
34 | 34 |
35 virtual size_t bytesUsed() const = 0; | 35 virtual size_t bytesUsed() const = 0; |
36 | 36 |
37 // Get the root bound. | |
38 virtual SkRect getRootBound() const = 0; | |
39 | |
40 SK_DECLARE_INST_COUNT(SkBBoxHierarchy) | 37 SK_DECLARE_INST_COUNT(SkBBoxHierarchy) |
41 private: | 38 private: |
42 typedef SkRefCnt INHERITED; | 39 typedef SkRefCnt INHERITED; |
43 }; | 40 }; |
44 | 41 |
45 #endif | 42 #endif |
OLD | NEW |