Lines Matching refs:children
60 OrderedChildSet* children = NULL;
63 children = i->second;
65 children = new OrderedChildSet();
66 parent_children_map_.insert(std::make_pair(parent_id, children));
69 return children->insert(entry).second;
80 OrderedChildSet* children = parent->second;
81 OrderedChildSet::iterator j = children->find(e);
82 DCHECK(j != children->end());
84 children->erase(j);
85 if (children->empty()) {
86 delete children;
98 const OrderedChildSet* children = parent->second;
99 DCHECK(children && !children->empty());
100 return children->count(e) > 0;
109 // A successful lookup implies at least some children exist.