15     std::vector<Branch> branches;  in insert()  local
16     branches.reserve(N);  in insert()
27         branches.push_back(b);  in insert()
30     fCount = (int)branches.size();  in insert()
36             n->fChildren[0] = branches[0];  in insert()
38             fRoot.fBounds  = branches[0].fBounds;  in insert()
41             fRoot = this->bulkLoad(&branches);  in insert()
57 int SkRTree::CountNodes(int branches) {  in CountNodes()  argument
58     if (branches == 1) {  in CountNodes()
61     int remainder   = branches % kMaxChildren;  in CountNodes()
71     while (currentBranch < branches) {  in CountNodes()
84         for (int k = 1; k < incrementBy && currentBranch < branches; ++k) {  in CountNodes()
91 SkRTree::Branch SkRTree::bulkLoad(std::vector<Branch>* branches, int level) {  in bulkLoad()  argument
92     if (branches->size() == 1) { // Only one branch.  It will be the root.  in bulkLoad()
93         return (*branches)[0];  in bulkLoad()
96     // We might sort our branches here, but we expect Blink gives us a reasonable x,y order.  in bulkLoad()
99     int remainder   = (int)branches->size() % kMaxChildren;  in bulkLoad()
103         // If the remainder isn't enough to fill a node, we'll add fewer nodes to other branches.  in bulkLoad()
112     while (currentBranch < (int)branches->size()) {  in bulkLoad()
126         n->fChildren[0] = (*branches)[currentBranch];  in bulkLoad()
128         b.fBounds = (*branches)[currentBranch].fBounds;  in bulkLoad()
131         for (int k = 1; k < incrementBy && currentBranch < (int)branches->size(); ++k) {  in bulkLoad()
132             b.fBounds.join((*branches)[currentBranch].fBounds);  in bulkLoad()
133             n->fChildren[k] = (*branches)[currentBranch];  in bulkLoad()
137         (*branches)[newBranches] = b;  in bulkLoad()
140     branches->resize(newBranches);  in bulkLoad()
141     return this->bulkLoad(branches, level + 1);  in bulkLoad()