37   DCHECK_EQ(children_[old_acc->index_in_parent_], old_acc);  in ReplaceChild()
39   old_acc = children_[old_acc->index_in_parent_];  in ReplaceChild()
40   children_[old_acc->index_in_parent_] = new_acc;  in ReplaceChild()
72   children_.push_back(child);  in AddChild()
78   for (size_t i = 0; i < children_.size(); i++)  in DetachTree()
79     children_[i]->DetachTree(nodes);  in DetachTree()
80   children_.clear();  in DetachTree()
102   DCHECK(child_index < children_.size());  in GetChild()
103   return children_[child_index];  in GetChild()
108     return parent_->children_[index_in_parent_ - 1];  in GetPreviousSibling()
116       index_in_parent_ < static_cast<int>(parent_->children_.size() - 1)) {  in GetNextSibling()
117     return parent_->children_[index_in_parent_ + 1];  in GetNextSibling()
148   for (int i = children_.size() - 1; i >= 0; --i) {  in BrowserAccessibilityForPoint()
149     BrowserAccessibility* child = children_[i];  in BrowserAccessibilityForPoint()
164     for (std::vector<BrowserAccessibility*>::iterator iter = children_.begin();  in InternalReleaseReference()
165          iter != children_.end();  in InternalReleaseReference()
174     children_.clear();  in InternalReleaseReference()