HomeSort by relevance Sort by last modified time
    Searched refs:fMaxChildren (Results 1 - 2 of 2) sorted by null

  /external/chromium_org/third_party/skia/src/core/
SkRTree.cpp 31 , fMaxChildren(maxChildren)
147 if (root->fNumChildren == fMaxChildren) {
152 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1);
153 for (int i = 0; i < fMaxChildren; ++i) {
156 toDivide[fMaxChildren] = *toInsert;
161 newSibling->fNumChildren = fMaxChildren + 1 - splitIndex;
165 for (int i = splitIndex; i < fMaxChildren + 1; ++i) {
269 SkTQSort(children, children + fMaxChildren, RectLessThan(sorts[i][j]));
272 for (int32_t k = 1; k <= fMaxChildren - 2 * fMinChildren + 2; ++k) {
278 for (int32_t l = fMinChildren + k; l < fMaxChildren + 1; ++l)
    [all...]
SkRTree.h 115 * A node in the tree, has between fMinChildren and fMaxChildren (the root is a special case)
184 const int fMaxChildren;

Completed in 27 milliseconds