Lines Matching refs:children
38 Siblings children;
47 found = std::find(children.begin(), children.end(), obj);
48 if ( found != children.end() ) {
49 return found - children.begin();
56 if (children.empty()) {
59 Siblings::const_iterator first=children.begin();
60 Siblings::const_iterator last=children.end() - 1;
86 return last - children.begin();
92 children.insert(children.begin()+index, obj);
101 for ( Siblings::iterator iter=children.begin()
102 ; iter != children.end() ; ++iter )
108 children.begin(), iter);
116 children.swap(new_children);
122 found = std::find(children.begin(), children.end(), obj);
123 unsigned index = found - children.begin();
124 if ( found != children.end() ) {
125 children.erase(found);
191 for ( Siblings::iterator it = root.children.begin(); it != root.children.end(); ++it ) {
193 root.children.erase( it );
209 Siblings &children=record->children;
210 for ( Siblings::iterator iter=children.begin()
211 ; iter != children.end() ; ++iter )
252 Siblings &children=record.children;
256 std::back_insert_iterator<Siblings>(children),
259 for ( Siblings::iterator iter=children.begin()
260 ; iter != children.end() ; ++iter )
288 /* reparent obj's orphaned children to their grandparent */
289 Siblings &siblings=parent_record->children;
290 Siblings &children=record->children;
292 children.begin(), children.end());
294 for ( Siblings::iterator iter=children.begin()
295 ; iter != children.end() ; ++iter)
312 while (!root.children.empty()) {
313 _doRemoveSubtree(root.children.front());
342 Siblings &family=parent_record->children;
373 return ( record ? record->children.size() : 0 );
384 return ( record ? record->children[n] : NULL );