Lines Matching refs:mChildren
40 : mChildren(), in SwNumberTreeNode()
49 mItLastValid = mChildren.end(); in SwNumberTreeNode()
63 delete *mChildren.begin(); in ~SwNumberTreeNode()
65 mChildren.clear(); in ~SwNumberTreeNode()
66 mItLastValid = mChildren.end(); in ~SwNumberTreeNode()
82 ASSERT(mChildren.empty(), "children left!"); in ~SwNumberTreeNode()
89 if (! mChildren.empty() && in CreatePhantom()
90 (*mChildren.begin())->IsPhantom()) in CreatePhantom()
101 mChildren.insert(pNew); in CreatePhantom()
128 tSwNumberTreeChildren::iterator aIt = mChildren.begin(); in ClearObsoletePhantoms()
130 if (aIt != mChildren.end() && (*aIt)->IsPhantom()) in ClearObsoletePhantoms()
134 if ((*aIt)->mChildren.empty()) in ClearObsoletePhantoms()
140 SetLastValid(mChildren.end()); in ClearObsoletePhantoms()
144 mChildren.erase(aIt); in ClearObsoletePhantoms()
154 if (aValidateIt != mChildren.end()) in ValidateHierarchical()
188 if (aIt != mChildren.end()) in ValidateHierarchical()
192 aIt = mChildren.begin(); in ValidateHierarchical()
219 while ( aParentChildIt != GetParent()->mChildren.begin() ) in ValidateHierarchical()
228 nTmpNumber = (*(pPrevNode->mChildren.rbegin()))->GetNumber(); in ValidateHierarchical()
289 if (aIt == mChildren.end()) in ValidateContinuous()
291 aIt = mChildren.begin(); in ValidateContinuous()
298 if (aIt != mChildren.end()) in ValidateContinuous()
336 while (aIt != mChildren.end() && *aIt != pNode); in ValidateContinuous()
361 tSwNumberTreeChildren::reverse_iterator aIt = mChildren.rbegin(); in ValidateTree()
363 if (aIt != mChildren.rend()) in ValidateTree()
369 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in ValidateTree()
395 return (*mChildren.begin())->GetFirstNonPhantomChild(); in GetFirstNonPhantomChild()
408 if ( mChildren.size() == 0 ) in MoveGreaterChildren()
412 tSwNumberTreeChildren::iterator aItUpper( mChildren.end() ); in MoveGreaterChildren()
413 if ((*mChildren.begin())->IsPhantom() && in MoveGreaterChildren()
414 _rCompareNode.LessThan(*(*mChildren.begin())->GetFirstNonPhantomChild())) in MoveGreaterChildren()
416 aItUpper = mChildren.begin(); in MoveGreaterChildren()
420 aItUpper = mChildren.upper_bound(&_rCompareNode); 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()
442 if ( !mChildren.empty() ) in MoveGreaterChildren()
444 SetLastValid( --(mChildren.end()) ); in MoveGreaterChildren()
457 if (! mChildren.empty()) in MoveChildren()
459 tSwNumberTreeChildren::iterator aItBegin = mChildren.begin(); in MoveChildren()
460 SwNumberTreeNode * pMyFirst = *mChildren.begin(); in MoveChildren()
466 SetLastValid(mChildren.end()); in MoveChildren()
473 if (pDest->mChildren.empty()) in MoveChildren()
476 pDestLast = *pDest->mChildren.rbegin(); in MoveChildren()
481 mChildren.erase(aItBegin); 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()
491 mChildren.clear(); in MoveChildren()
495 mItLastValid = mChildren.end(); in MoveChildren()
499 ASSERT (mChildren.empty(), "MoveChildren failed!"); in MoveChildren()
552 mChildren.upper_bound(pChild); in AddChild()
554 ASSERT(! (aInsertDeepIt != mChildren.end() && in AddChild()
558 if (aInsertDeepIt == mChildren.begin()) in AddChild()
562 SetLastValid(mChildren.end()); in AddChild()
580 mChildren.insert(pChild); in AddChild()
588 if (aInsertedIt != mChildren.begin()) in AddChild()
612 pPrevChildNode->mChildren.rbegin(); in AddChild()
617 pDestNode = *(pDestNode->mChildren.begin()); in AddChild()
642 SetLastValid(mChildren.end()); in AddChild()
689 if (aRemoveIt != mChildren.end()) in RemoveChild()
695 tSwNumberTreeChildren::const_iterator aItPred = mChildren.end(); in RemoveChild()
697 if (aRemoveIt == mChildren.begin()) in RemoveChild()
699 if (! pRemove->mChildren.empty()) in RemoveChild()
703 aItPred = mChildren.begin(); in RemoveChild()
713 if (! pRemove->mChildren.empty()) in RemoveChild()
726 if (aItPred != mChildren.end() && (*aItPred)->IsPhantom()) in RemoveChild()
727 SetLastValid(mChildren.end()); in RemoveChild()
732 mChildren.erase(aRemoveIt); in RemoveChild()
807 if (mItLastValid != mChildren.end()) in IsValid()
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()
965 return mChildren.size(); in GetChildCount()
1001 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in IsSane()
1057 mChildren.find(const_cast<SwNumberTreeNode *>(pChild)); in GetIterator()
1059 ASSERT( aItResult != mChildren.end(), in GetIterator()
1119 tSwNumberTreeChildren::const_reverse_iterator aIt = mChildren.rbegin(); in GetLastDescendant()
1121 if (aIt != mChildren.rend()) in GetLastDescendant()
1146 if ( aIt == mpParent->mChildren.begin() ) in GetPred()
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()
1212 aIt = mChildren.begin(); 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()
1253 if (aIt != mChildren.begin()) in Invalidate()
1256 aIt = mChildren.end(); in Invalidate()
1284 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in Notify()
1295 if (aIt == mChildren.end()) in NotifyInvalidChildren()
1296 aIt = mChildren.begin(); in NotifyInvalidChildren()
1300 while (aIt != mChildren.end()) in NotifyInvalidChildren()
1313 if ( aParentChildIt != GetParent()->mChildren.end() ) in NotifyInvalidChildren()
1345 mChildren.upper_bound( const_cast<SwNumberTreeNode*>(&rNode) ); in GetPrecedingNodeOf()
1346 if ( aUpperBoundIt != mChildren.begin() ) in GetPrecedingNodeOf()
1390 mChildren.begin(); in NotifyChildrenOnDepth()
1391 while ( aChildIter != mChildren.end() ) in NotifyChildrenOnDepth()