Lines Matching refs:branches
152 // divide up the branches
317 SkRTree::Branch SkRTree::bulkLoad(SkTDArray<Branch>* branches, int level) {
318 if (branches->count() == 1) {
320 Branch out = (*branches)[0];
321 branches->rewind();
330 SkTQSort(branches->begin(), branches->end() - 1, RectLessY());
333 int numBranches = branches->count() / fMaxChildren;
334 int remainder = branches->count() % fMaxChildren;
340 // some other branches to make up for it
360 if (end > branches->count()) {
361 end = branches->count();
365 SkTQSort(branches->begin() + begin, branches->begin() + end - 1, RectLessX());
368 for (int j = 0; j < numTiles && currentBranch < branches->count(); ++j) {
382 *n->child(0) = (*branches)[currentBranch];
384 b.fBounds = (*branches)[currentBranch].fBounds;
387 for (int k = 1; k < incrementBy && currentBranch < branches->count(); ++k) {
388 b.fBounds.join((*branches)[currentBranch].fBounds);
389 *n->child(k) = (*branches)[currentBranch];
393 (*branches)[newBranches] = b;
397 branches->setCount(newBranches);
398 return this->bulkLoad(branches, level + 1);
