49     mItLastValid = mChildren.end();  in SwNumberTreeNode()
66             mItLastValid = mChildren.end();  in ~SwNumberTreeNode()
130     if (aIt != mChildren.end() && (*aIt)->IsPhantom())  in ClearObsoletePhantoms()
140             SetLastValid(mChildren.end());  in ClearObsoletePhantoms()
154     if (aValidateIt != mChildren.end())  in ValidateHierarchical()
188         if (aIt != mChildren.end())  in ValidateHierarchical()
289         if (aIt == mChildren.end())  in ValidateContinuous()
298         if (aIt != mChildren.end())  in ValidateContinuous()
336     while (aIt != mChildren.end() && *aIt != pNode);  in ValidateContinuous()
369             for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in ValidateTree()
412     tSwNumberTreeChildren::iterator aItUpper( mChildren.end() );  in MoveGreaterChildren()
424     if (aItUpper != mChildren.end())  in MoveGreaterChildren()
427         for (aIt = aItUpper; aIt != mChildren.end(); aIt++)  in MoveGreaterChildren()
430         _rDestNode.mChildren.insert(aItUpper, mChildren.end());  in MoveGreaterChildren()
436         SetLastValid( mChildren.end() );  in MoveGreaterChildren()
439         mChildren.erase(aItUpper, mChildren.end());  in MoveGreaterChildren()
444             SetLastValid( --(mChildren.end()) );  in MoveGreaterChildren()
466         SetLastValid(mChildren.end());  in MoveChildren()
487         for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in MoveChildren()
490         pDest->mChildren.insert(mChildren.begin(), mChildren.end());  in MoveChildren()
495         mItLastValid = mChildren.end();  in MoveChildren()
554         ASSERT(! (aInsertDeepIt != mChildren.end() &&  in AddChild()
562             SetLastValid(mChildren.end());  in AddChild()
642                 SetLastValid(mChildren.end());  in AddChild()
689     if (aRemoveIt != mChildren.end())  in RemoveChild()
695         tSwNumberTreeChildren::const_iterator aItPred = mChildren.end();  in RemoveChild()
726         if (aItPred != mChildren.end() && (*aItPred)->IsPhantom())  in RemoveChild()
727             SetLastValid(mChildren.end());  in RemoveChild()
807   if (mItLastValid != mChildren.end())  in IsValid()
984     if (find(rParents.begin(), rParents.end(), this) != rParents.end())  in IsSane()
1001     for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in IsSane()
1059     ASSERT( aItResult != mChildren.end(),  in GetIterator()
1174     ASSERT( (aItValid == mChildren.end() || GetIterator(*aItValid) != mChildren.end()),  in SetLastValid()
1179         aItValid == mChildren.end() ||  in SetLastValid()
1180          (mItLastValid != mChildren.end() &&  in SetLastValid()
1192             if ( aParentChildIt != GetParent()->mChildren.end() )  in SetLastValid()
1209             if (aIt != mChildren.end())  in SetLastValid()
1214             while (aIt != mChildren.end())  in SetLastValid()
1239     mItLastValid = mChildren.end();  in InvalidateTree()
1243     for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in InvalidateTree()
1256             aIt = mChildren.end();  in Invalidate()
1284         for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++)  in Notify()
1295         if (aIt == mChildren.end())  in NotifyInvalidChildren()
1300         while (aIt != mChildren.end())  in NotifyInvalidChildren()
1313             if ( aParentChildIt != GetParent()->mChildren.end() )  in NotifyInvalidChildren()
1391     while ( aChildIter != mChildren.end() )  in NotifyChildrenOnDepth()