Lines Matching refs:fBounds
54 newBranch.fBounds = bounds;
69 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
78 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
93 fRoot.fBounds = fDeferredInserts[0].fBounds;
110 if (!this->isEmpty() && SkIRect::IntersectsNoEmptyCheck(fRoot.fBounds, query)) {
136 root->child(childIndex)->fBounds = this->computeBounds(
165 branch->fBounds = this->computeBounds(newSibling);
184 const SkIRect& subtreeBounds = root->child(i)->fBounds;
185 int32_t areaIncrease = get_area_increase(subtreeBounds, branch->fBounds);
202 const SkIRect& subtreeBounds = root->child(i)->fBounds;
204 join_no_empty_check(branch->fBounds, &expandedBounds);
211 overlap += get_overlap(expandedBounds, root->child(j)->fBounds);
215 static_cast<int32_t>(get_area_increase(branch->fBounds, subtreeBounds)) <
218 minAreaIncrease = get_area_increase(branch->fBounds, subtreeBounds);
230 SkIRect r = n->child(0)->fBounds;
232 join_no_empty_check(n->child(i)->fBounds, &r);
266 SkIRect r1 = children[0].fBounds;
267 SkIRect r2 = children[fMinChildren + k - 1].fBounds;
269 join_no_empty_check(children[l].fBounds, &r1);
272 join_no_empty_check(children[l].fBounds, &r2);
307 if (SkIRect::IntersectsNoEmptyCheck(root->child(i)->fBounds, query)) {
384 b.fBounds = (*branches)[currentBranch].fBounds;
388 b.fBounds.join((*branches)[currentBranch].fBounds);
407 SkASSERT(fCount == this->validateSubtree(fRoot.fChild.subtree, fRoot.fBounds, true));
427 SkASSERT(bounds.contains(root->child(i)->fBounds));
438 root->child(i)->fBounds);
