63             delete *mChildren.begin();  in ~SwNumberTreeNode()
90         (*mChildren.begin())->IsPhantom())  in CreatePhantom()
128     tSwNumberTreeChildren::iterator aIt = mChildren.begin();  in ClearObsoletePhantoms()
192             aIt = mChildren.begin();  in ValidateHierarchical()
219                 while ( aParentChildIt != GetParent()->mChildren.begin() )  in ValidateHierarchical()
291             aIt = mChildren.begin();  in ValidateContinuous()
369             for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in ValidateTree()
395         return (*mChildren.begin())->GetFirstNonPhantomChild();  in GetFirstNonPhantomChild()
413     if ((*mChildren.begin())->IsPhantom() &&  in MoveGreaterChildren()
414         _rCompareNode.LessThan(*(*mChildren.begin())->GetFirstNonPhantomChild()))  in MoveGreaterChildren()
416         aItUpper = mChildren.begin();  in MoveGreaterChildren()
459         tSwNumberTreeChildren::iterator aItBegin = mChildren.begin();  in MoveChildren()
460         SwNumberTreeNode * pMyFirst = *mChildren.begin();  in MoveChildren()
483             aItBegin = mChildren.begin();  in MoveChildren()
487         for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in MoveChildren()
490         pDest->mChildren.insert(mChildren.begin(), mChildren.end());  in MoveChildren()
558         if (aInsertDeepIt == mChildren.begin())  in AddChild()
588             if (aInsertedIt != mChildren.begin())  in AddChild()
617                             pDestNode = *(pDestNode->mChildren.begin());  in AddChild()
697         if (aRemoveIt == mChildren.begin())  in RemoveChild()
703                 aItPred = mChildren.begin();  in RemoveChild()
834         tSwNumberTreeChildren::const_iterator aIt = mChildren.begin();  in HasOnlyPhantoms()
879     tSwNumberTreeChildren::const_iterator aIt = mChildren.begin();  in IsFirst()
913                  this != *(GetParent()->mChildren.begin()) &&  in IsFirst()
914                  !(*(GetParent()->mChildren.begin()))->HasOnlyPhantoms() )  in IsFirst()
984     if (find(rParents.begin(), rParents.end(), this) != rParents.end())  in IsSane()
1001     for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in IsSane()
1146         if ( aIt == mpParent->mChildren.begin() )  in GetPred()
1212                 aIt = mChildren.begin();  in SetLastValid()
1243     for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in InvalidateTree()
1253         if (aIt != mChildren.begin())  in Invalidate()
1284         for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in Notify()
1296             aIt = mChildren.begin();  in NotifyInvalidChildren()
1346         if ( aUpperBoundIt != mChildren.begin() )  in GetPrecedingNodeOf()
1390                                                             mChildren.begin();  in NotifyChildrenOnDepth()