| 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 161 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 172 Branch bulkLoad(SkTDArray<Branch>* branches, int level = 0); | 172 Branch bulkLoad(SkTDArray<Branch>* branches, int level = 0); |
| 173 | 173 |
| 174 void validate(); | 174 void validate(); |
| 175 int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false); | 175 int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false); |
| 176 | 176 |
| 177 const int fMinChildren; | 177 const int fMinChildren; |
| 178 const int fMaxChildren; | 178 const int fMaxChildren; |
| 179 const size_t fNodeSize; | 179 const size_t fNodeSize; |
| 180 | 180 |
| 181 // This is the count of data elements (rather than total nodes in the tree) | 181 // This is the count of data elements (rather than total nodes in the tree) |
| 182 size_t fCount; | 182 int fCount; |
| 183 | 183 |
| 184 Branch fRoot; | 184 Branch fRoot; |
| 185 SkChunkAlloc fNodes; | 185 SkChunkAlloc fNodes; |
| 186 SkTDArray<Branch> fDeferredInserts; | 186 SkTDArray<Branch> fDeferredInserts; |
| 187 SkScalar fAspectRatio; | 187 SkScalar fAspectRatio; |
| 188 bool fSortWhenBulkLoading; | 188 bool fSortWhenBulkLoading; |
| 189 | 189 |
| 190 Node* allocateNode(uint16_t level); | 190 Node* allocateNode(uint16_t level); |
| 191 | 191 |
| 192 typedef SkBBoxHierarchy INHERITED; | 192 typedef SkBBoxHierarchy INHERITED; |
| 193 }; | 193 }; |
| 194 | 194 |
| 195 #endif | 195 #endif |
| OLD | NEW |