Lines Matching refs:aIt
128 tSwNumberTreeChildren::iterator aIt = mChildren.begin(); in ClearObsoletePhantoms() local
130 if (aIt != mChildren.end() && (*aIt)->IsPhantom()) in ClearObsoletePhantoms()
132 (*aIt)->ClearObsoletePhantoms(); in ClearObsoletePhantoms()
134 if ((*aIt)->mChildren.empty()) in ClearObsoletePhantoms()
143 delete *aIt; in ClearObsoletePhantoms()
144 mChildren.erase(aIt); in ClearObsoletePhantoms()
158 tSwNumberTreeChildren::const_iterator aIt = mItLastValid; in ValidateHierarchical() local
188 if (aIt != mChildren.end()) in ValidateHierarchical()
189 nTmpNumber = (*aIt)->mnNumber; in ValidateHierarchical()
192 aIt = mChildren.begin(); in ValidateHierarchical()
194 (*aIt)->mbContinueingPreviousSubTree = false; in ValidateHierarchical()
199 nTmpNumber = (*aIt)->GetStartValue(); in ValidateHierarchical()
200 if ( !(*aIt)->IsCounted() && in ValidateHierarchical()
201 ( !(*aIt)->HasCountedChildren() || (*aIt)->IsPhantom() ) ) in ValidateHierarchical()
214 if ( !(*aIt)->IsRestart() && in ValidateHierarchical()
226 (*aIt)->mbContinueingPreviousSubTree = true; in ValidateHierarchical()
230 if ( (*aIt)->IsCounted() && in ValidateHierarchical()
231 ( !(*aIt)->IsPhantom() || in ValidateHierarchical()
232 (*aIt)->HasPhantomCountedParent() ) ) in ValidateHierarchical()
251 (*aIt)->mnNumber = nTmpNumber; in ValidateHierarchical()
254 while (aIt != aValidateIt) in ValidateHierarchical()
256 ++aIt; in ValidateHierarchical()
258 (*aIt)->mbContinueingPreviousSubTree = false; in ValidateHierarchical()
264 if ( (*aIt)->IsCounted() ) in ValidateHierarchical()
266 if ((*aIt)->IsRestart()) in ValidateHierarchical()
267 nTmpNumber = (*aIt)->GetStartValue(); in ValidateHierarchical()
273 (*aIt)->mnNumber = nTmpNumber; in ValidateHierarchical()
277 SetLastValid(aIt, true); in ValidateHierarchical()
283 tSwNumberTreeChildren::const_iterator aIt = mItLastValid; in ValidateContinuous() local
289 if (aIt == mChildren.end()) in ValidateContinuous()
291 aIt = mChildren.begin(); in ValidateContinuous()
296 aIt++; in ValidateContinuous()
298 if (aIt != mChildren.end()) in ValidateContinuous()
300 SwNumberTreeNode * pPred = (*aIt)->GetPred(); in ValidateContinuous()
307 if ( !(*aIt)->IsCounted() ) in ValidateContinuous()
309 nTmpNumber = pPred->GetNumber( pPred->GetParent() != (*aIt)->GetParent() ); in ValidateContinuous()
313 if ( (*aIt)->IsRestart() ) in ValidateContinuous()
314 nTmpNumber = (*aIt)->GetStartValue(); in ValidateContinuous()
316 … nTmpNumber = pPred->GetNumber( pPred->GetParent() != (*aIt)->GetParent() ) + 1; in ValidateContinuous()
321 if ( !(*aIt)->IsCounted() ) in ValidateContinuous()
325 if ( (*aIt)->IsRestart() ) in ValidateContinuous()
326 nTmpNumber = (*aIt)->GetStartValue(); in ValidateContinuous()
333 (*aIt)->mnNumber = nTmpNumber; in ValidateContinuous()
336 while (aIt != mChildren.end() && *aIt != pNode); in ValidateContinuous()
341 SetLastValid( aIt, true ); in ValidateContinuous()
361 tSwNumberTreeChildren::reverse_iterator aIt = mChildren.rbegin(); in ValidateTree() local
363 if (aIt != mChildren.rend()) in ValidateTree()
364 Validate(*aIt); in ValidateTree()
367 tSwNumberTreeChildren::iterator aIt; in ValidateTree() local
369 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in ValidateTree()
370 (*aIt)->ValidateTree(); in ValidateTree()
426 tSwNumberTreeChildren::iterator aIt; in MoveGreaterChildren() local
427 for (aIt = aItUpper; aIt != mChildren.end(); aIt++) in MoveGreaterChildren()
428 (*aIt)->mpParent = &_rDestNode; in MoveGreaterChildren()
486 tSwNumberTreeChildren::iterator aIt; in MoveChildren() local
487 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in MoveChildren()
488 (*aIt)->mpParent = pDest; in MoveChildren()
611 tSwNumberTreeChildren::reverse_iterator aIt = in AddChild() local
613 pPrevChildNode = *aIt; in AddChild()
834 tSwNumberTreeChildren::const_iterator aIt = mChildren.begin(); in HasOnlyPhantoms() local
836 bResult = (*aIt)->IsPhantom() && (*aIt)->HasOnlyPhantoms(); in HasOnlyPhantoms()
879 tSwNumberTreeChildren::const_iterator aIt = mChildren.begin(); in IsFirst() local
881 if ((*aIt)->IsPhantom()) in IsFirst()
882 aIt++; in IsFirst()
884 return *aIt == pNode; in IsFirst()
982 tSwNumberTreeChildren::const_iterator aIt; in IsSane() local
1001 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in IsSane()
1003 if (*aIt) in IsSane()
1005 if ((*aIt)->IsPhantom()) in IsSane()
1007 if ((*aIt)->HasOnlyPhantoms()) in IsSane()
1020 if ((*aIt)->mpParent != (SwNumberTreeNode *) this) in IsSane()
1029 if (!(*aIt)->IsPhantom() && (*aIt)->LessThan(*this)) in IsSane()
1044 bResult = (*aIt)->IsSane(bRecursive, rParents) && bResult; in IsSane()
1119 tSwNumberTreeChildren::const_reverse_iterator aIt = mChildren.rbegin(); in GetLastDescendant() local
1121 if (aIt != mChildren.rend()) in GetLastDescendant()
1123 pResult = (*aIt)->GetLastDescendant(); in GetLastDescendant()
1126 pResult = *aIt; in GetLastDescendant()
1143 tSwNumberTreeChildren::const_iterator aIt = in GetPred() local
1146 if ( aIt == mpParent->mChildren.begin() ) in GetPred()
1155 aIt--; in GetPred()
1158 pResult = (*aIt)->GetLastDescendant(); in GetPred()
1160 pResult = (*aIt); in GetPred()
1163 pResult = (*aIt); in GetPred()
1207 tSwNumberTreeChildren::const_iterator aIt = mItLastValid; in SetLastValid() local
1209 if (aIt != mChildren.end()) in SetLastValid()
1210 aIt++; in SetLastValid()
1212 aIt = mChildren.begin(); in SetLastValid()
1214 while (aIt != mChildren.end()) in SetLastValid()
1216 (*aIt)->InvalidateTree(); in SetLastValid()
1218 aIt++; in SetLastValid()
1230 tSwNumberTreeChildren::const_iterator aIt = mpParent->GetIterator(this); in SetLastValid() local
1232 mpParent->SetLastValid(aIt, bValidating); in SetLastValid()
1241 tSwNumberTreeChildren::const_iterator aIt; in InvalidateTree() local
1243 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in InvalidateTree()
1244 (*aIt)->InvalidateTree(); in InvalidateTree()
1251 tSwNumberTreeChildren::const_iterator aIt = GetIterator(pChild); in Invalidate() local
1253 if (aIt != mChildren.begin()) in Invalidate()
1254 aIt--; in Invalidate()
1256 aIt = mChildren.end(); in Invalidate()
1258 SetLastValid(aIt); in Invalidate()
1282 tSwNumberTreeChildren::iterator aIt; in Notify() local
1284 for (aIt = mChildren.begin(); aIt != mChildren.end(); aIt++) in Notify()
1285 (*aIt)->Notify(); in Notify()
1293 tSwNumberTreeChildren::const_iterator aIt = mItLastValid; in NotifyInvalidChildren() local
1295 if (aIt == mChildren.end()) in NotifyInvalidChildren()
1296 aIt = mChildren.begin(); in NotifyInvalidChildren()
1298 aIt++; in NotifyInvalidChildren()
1300 while (aIt != mChildren.end()) in NotifyInvalidChildren()
1302 (*aIt)->Notify(); in NotifyInvalidChildren()
1304 aIt++; in NotifyInvalidChildren()