| OLD | NEW |
| 1 | 1 |
| 2 /* | 2 /* |
| 3 * Copyright 2012 Google Inc. | 3 * Copyright 2012 Google Inc. |
| 4 * | 4 * |
| 5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
| 6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
| 7 */ | 7 */ |
| 8 | 8 |
| 9 #ifndef SkRTree_DEFINED | 9 #ifndef SkRTree_DEFINED |
| 10 #define SkRTree_DEFINED | 10 #define SkRTree_DEFINED |
| (...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 45 void search(const SkRect& query, SkTDArray<unsigned>* results) const SK_OVER
RIDE; | 45 void search(const SkRect& query, SkTDArray<unsigned>* results) const SK_OVER
RIDE; |
| 46 size_t bytesUsed() const SK_OVERRIDE; | 46 size_t bytesUsed() const SK_OVERRIDE; |
| 47 | 47 |
| 48 // Methods and constants below here are only public for tests. | 48 // Methods and constants below here are only public for tests. |
| 49 | 49 |
| 50 // Return the depth of the tree structure. | 50 // Return the depth of the tree structure. |
| 51 int getDepth() const { return fCount ? fRoot.fSubtree->fLevel + 1 : 0; } | 51 int getDepth() const { return fCount ? fRoot.fSubtree->fLevel + 1 : 0; } |
| 52 // Insertion count (not overall node count, which may be greater). | 52 // Insertion count (not overall node count, which may be greater). |
| 53 int getCount() const { return fCount; } | 53 int getCount() const { return fCount; } |
| 54 | 54 |
| 55 // Get the root bound. | |
| 56 SkRect getRootBound() const SK_OVERRIDE; | |
| 57 | |
| 58 // These values were empirically determined to produce reasonable performanc
e in most cases. | 55 // These values were empirically determined to produce reasonable performanc
e in most cases. |
| 59 static const int kMinChildren = 6, | 56 static const int kMinChildren = 6, |
| 60 kMaxChildren = 11; | 57 kMaxChildren = 11; |
| 61 | 58 |
| 62 private: | 59 private: |
| 63 struct Node; | 60 struct Node; |
| 64 | 61 |
| 65 struct Branch { | 62 struct Branch { |
| 66 union { | 63 union { |
| 67 Node* fSubtree; | 64 Node* fSubtree; |
| (...skipping 21 matching lines...) Expand all Loading... |
| 89 // This is the count of data elements (rather than total nodes in the tree) | 86 // This is the count of data elements (rather than total nodes in the tree) |
| 90 int fCount; | 87 int fCount; |
| 91 SkScalar fAspectRatio; | 88 SkScalar fAspectRatio; |
| 92 Branch fRoot; | 89 Branch fRoot; |
| 93 SkTDArray<Node> fNodes; | 90 SkTDArray<Node> fNodes; |
| 94 | 91 |
| 95 typedef SkBBoxHierarchy INHERITED; | 92 typedef SkBBoxHierarchy INHERITED; |
| 96 }; | 93 }; |
| 97 | 94 |
| 98 #endif | 95 #endif |
| OLD | NEW |