Lines Matching refs:children_
106 for (Nodes::const_iterator i = children_.begin(); i != children_.end(); ++i)
111 for (Nodes::const_iterator i = children_.begin(); i != children_.end(); ++i)
117 DCHECK_LE(number_to_remove, children_.size());
119 std::partial_sort(children_.begin(),
120 children_.begin() + number_to_remove,
121 children_.end(),
126 nodes->end(), children_.begin(), children_.begin() + number_to_remove);
127 children_.weak_erase(children_.begin(), children_.begin() + number_to_remove);
140 Nodes::iterator i = std::find(children_.begin(), children_.end(), child_node);
141 DCHECK(i != children_.end());
142 children_.weak_erase(i);
148 if (children_.empty())
151 scoped_ptr<NodeBase> last_child(children_.back());
152 children_.weak_erase(children_.end() - 1);
170 expanded_rects.reserve(children_.size());
171 for (Nodes::iterator i = children_.begin(); i != children_.end(); ++i)
197 children_.push_back(node.release());
198 return children_.size();
204 DCHECK_EQ(max_children + 1, children_.size());
207 std::vector<NodeBase*> vertical_sort(children_.get());
208 std::vector<NodeBase*> horizontal_sort(children_.get());
231 // min_children <= children_.size() <= max_children.
232 size_t end_index = std::min(max_children, children_.size() - min_children);
403 for (size_t i = 0; i < children_.size(); ++i)
404 bounds.Union(children_[i]->rect());
422 for (Nodes::const_iterator it = children_.begin();
423 it != children_.end(); ++it) {
453 // Our own children_ vector is unsorted, so we wipe it out and divide the
455 children_.weak_clear();
456 children_.insert(children_.end(),
459 sibling->children_.insert(sibling->children_.end(),
463 for (size_t i = 0; i < sibling->children_.size(); ++i)
464 sibling->children_[i]->set_parent(sibling.get());
472 NodeBase* best_node = children_.front();
474 children_[0], expanded_rects[0]);
475 for (size_t i = 1; i < children_.size(); ++i) {
477 OverlapIncreaseToAdd(node_rect, children_[i], expanded_rects[i]);
480 best_node = children_[i];
499 DCHECK(!children_.empty());
500 DCHECK_EQ(children_.size(), expanded_rects.size());
502 NodeBase* best_node = children_.front();
505 for (size_t i = 1; i < children_.size(); ++i) {
506 NodeBase* candidate_node = children_[i];
