Searched refs:fNumChildren (Results 1 - 4 of 4) sorted by relevance

/external/chromium_org/third_party/skia/src/core/
H A DSkRTree.cpp64 fRoot.fChild.subtree->fNumChildren = 0;
74 newRoot->fNumChildren = 2;
91 fRoot.fChild.subtree->fNumChildren = 0;
126 out->fNumChildren = 0;
140 if (root->fNumChildren == fMaxChildren) {
153 root->fNumChildren = splitIndex;
154 newSibling->fNumChildren = fMaxChildren + 1 - splitIndex;
168 *root->child(root->fNumChildren) = *toInsert;
169 ++root->fNumChildren;
183 for (int i = 0; i < root->fNumChildren;
[all...]
H A DSkRTree.h118 uint16_t fNumChildren; member in struct:SkRTree::Node
/external/skia/src/core/
H A DSkRTree.cpp64 fRoot.fChild.subtree->fNumChildren = 0;
74 newRoot->fNumChildren = 2;
91 fRoot.fChild.subtree->fNumChildren = 0;
126 out->fNumChildren = 0;
140 if (root->fNumChildren == fMaxChildren) {
153 root->fNumChildren = splitIndex;
154 newSibling->fNumChildren = fMaxChildren + 1 - splitIndex;
168 *root->child(root->fNumChildren) = *toInsert;
169 ++root->fNumChildren;
183 for (int i = 0; i < root->fNumChildren;
[all...]
H A DSkRTree.h118 uint16_t fNumChildren; member in struct:SkRTree::Node

Completed in 4015 milliseconds