Searched refs:fMaxChildren (Results 1 - 4 of 4) sorted by relevance
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRTree.cpp | 31 , fMaxChildren(maxChildren) 140 if (root->fNumChildren == fMaxChildren) { 145 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1); 146 for (int i = 0; i < fMaxChildren; ++i) { 149 toDivide[fMaxChildren] = *toInsert; 154 newSibling->fNumChildren = fMaxChildren + 1 - splitIndex; 158 for (int i = splitIndex; i < fMaxChildren + 1; ++i) { 262 SkTQSort(children, children + fMaxChildren, RectLessThan(sorts[i][j])); 265 for (int32_t k = 1; k <= fMaxChildren - 2 * fMinChildren + 2; ++k) { 271 for (int32_t l = fMinChildren + k; l < fMaxChildren [all...] |
H A D | SkRTree.h | 115 * A node in the tree, has between fMinChildren and fMaxChildren (the root is a special case) 184 const int fMaxChildren; member in class:SkRTree
|
/external/skia/src/core/ |
H A D | SkRTree.cpp | 31 , fMaxChildren(maxChildren) 140 if (root->fNumChildren == fMaxChildren) { 145 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1); 146 for (int i = 0; i < fMaxChildren; ++i) { 149 toDivide[fMaxChildren] = *toInsert; 154 newSibling->fNumChildren = fMaxChildren + 1 - splitIndex; 158 for (int i = splitIndex; i < fMaxChildren + 1; ++i) { 262 SkTQSort(children, children + fMaxChildren, RectLessThan(sorts[i][j])); 265 for (int32_t k = 1; k <= fMaxChildren - 2 * fMinChildren + 2; ++k) { 271 for (int32_t l = fMinChildren + k; l < fMaxChildren [all...] |
H A D | SkRTree.h | 115 * A node in the tree, has between fMinChildren and fMaxChildren (the root is a special case) 184 const int fMaxChildren; member in class:SkRTree
|
Completed in 112 milliseconds