Lines Matching full:branch
32 , fNodeSize(sizeof(Node) + sizeof(Branch) * maxChildren)
53 Branch newBranch;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) {
132 Branch* toInsert = branch;
134 int childIndex = this->chooseSubtree(root, branch);
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
145 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1);
163 // pass the new sibling branch up to the parent
164 branch->fChild.subtree = newSibling;
165 branch->fBounds = this->computeBounds(newSibling);
166 return branch;
176 int SkRTree::chooseSubtree(Node* root, Branch* branch) {
185 int32_t areaIncrease = get_area_increase(subtreeBounds, branch->fBounds);
204 join_no_empty_check(branch->fBounds, &expandedBounds);
215 static_cast<int32_t>(get_area_increase(branch->fBounds, subtreeBounds)) <
218 minAreaIncrease = get_area_increase(branch->fBounds, subtreeBounds);
237 int SkRTree::distributeChildren(Branch* children) {
317 SkRTree::Branch SkRTree::bulkLoad(SkTDArray<Branch>* branches, int level) {
319 // Only one branch: it will be the root
320 Branch out = (*branches)[0];
383 Branch b;
