Lines Matching refs:n
118 for( sal_uInt16 n = 1; n < rTbl.Count(); ++n ) in lcl_CheckRedline() local
120 const SwRedline* pPrev = rTbl[ n-1 ]; in lcl_CheckRedline()
121 const SwRedline* pCurrent = rTbl[ n ]; in lcl_CheckRedline()
139 for( sal_uInt16 n = 0; n < rTbl.Count(); ++n ) in lcl_DebugRedline() local
142 const SwRedline* pCurrent = rTbl[ n ]; in lcl_DebugRedline()
143 const SwRedline* pNext = n+1 < rTbl.Count() ? rTbl[ n+1 ] : 0; in lcl_DebugRedline()
146 if( n == nWatch ) in lcl_DebugRedline()
374 sal_uInt16 n = 0; in AppendRedline() local
376 if( !GetRedline( *pStt, &n ) && n ) in AppendRedline()
377 --n; in AppendRedline()
380 for( ; pNewRedl && n < pRedlineTbl->Count(); bDec ? n : ++n ) in AppendRedline()
387 SwRedline* pRedl = (*pRedlineTbl)[ n ]; in AppendRedline()
396 pRedlineTbl->DeleteAndDestroy(n); in AppendRedline()
418 ( n+1 >= pRedlineTbl->Count() || in AppendRedline()
419 ( *(*pRedlineTbl)[ n+1 ]->Start() >= *pEnd && in AppendRedline()
420 *(*pRedlineTbl)[ n+1 ]->Start() != *pREnd ) ) ) in AppendRedline()
426 pRedlineTbl->Remove( n ); in AppendRedline()
438 ( !n || in AppendRedline()
439 *(*pRedlineTbl)[ n-1 ]->End() != *pRStt )) in AppendRedline()
443 pRedlineTbl->Remove( n ); in AppendRedline()
453 pRedlineTbl->Remove( n ); in AppendRedline()
493 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
499 pRedlineTbl->Remove( n ); in AppendRedline()
556 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
562 pRedlineTbl->Remove( n ); in AppendRedline()
563 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
589 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
603 pRedlineTbl->Remove( n ); in AppendRedline()
604 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
612 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
621 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
636 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
638 n = 0; // neu Aufsetzen in AppendRedline()
670 n = 0; // neu Aufsetzen in AppendRedline()
696 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
734 sal_uInt16 nToBeDeleted = n; in AppendRedline()
748 n = 0; in AppendRedline()
776 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
809 pRedlineTbl->Remove( n ); in AppendRedline()
832 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
837 pRedlineTbl->Remove( n ); in AppendRedline()
838 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
852 n = 0; // neu Aufsetzen in AppendRedline()
864 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
881 n = 0; // neu Aufsetzen in AppendRedline()
924 pRedlineTbl->Remove( n ); in AppendRedline()
925 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
941 pRedlineTbl->Remove( n ); in AppendRedline()
942 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
985 pRedlineTbl->Remove( n ); in AppendRedline()
1016 pRedlineTbl->Remove( n ); in AppendRedline()
1039 n = 0; in AppendRedline()
1052 pRedlineTbl->Remove( n ); in AppendRedline()
1053 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
1065 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
1081 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
1083 n = 0; // neu Aufsetzen in AppendRedline()
1130 n = 0; // neu Aufsetzen in AppendRedline()
1149 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
1168 pRedlineTbl->Remove( n ); in AppendRedline()
1169 pRedlineTbl->Insert( pRedl, n ); in AppendRedline()
1180 n = 0; // neu Aufsetzen in AppendRedline()
1196 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
1207 pRedl->CanCombine( *pNewRedl ) && n && in AppendRedline()
1208 *(*pRedlineTbl)[ n-1 ]->End() < *pStt ) in AppendRedline()
1213 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
1220 n+1 < pRedlineTbl->Count() && in AppendRedline()
1221 *(*pRedlineTbl)[ n+1 ]->Start() < *pEnd ) in AppendRedline()
1226 pRedlineTbl->DeleteAndDestroy( n ); in AppendRedline()
1298 for( sal_uInt16 n = 1; n < pRedlineTbl->Count(); ++n ) in CompressRedlines() local
1300 SwRedline* pPrev = (*pRedlineTbl)[ n-1 ], in CompressRedlines()
1301 * pCur = (*pRedlineTbl)[ n ]; in CompressRedlines()
1318 pRedlineTbl->DeleteAndDestroy( n ); in CompressRedlines()
1319 --n; in CompressRedlines()
1330 sal_uInt16 n = 0; in SplitRedline() local
1334 GetRedline( *pStt, &n ); in SplitRedline()
1335 for( ; n < pRedlineTbl->Count() ; ++n ) in SplitRedline()
1337 SwRedline* pTmp = (*pRedlineTbl)[ n ]; in SplitRedline()
1370 pRedlineTbl->DeleteAndDestroy( n-- ); in SplitRedline()
1377 pRedlineTbl->Remove( n ); in SplitRedline()
1378 pRedlineTbl->Insert( pTmp, n ); in SplitRedline()
1381 pRedlineTbl->Insert( pNew, n ); in SplitRedline()
1412 sal_uInt16 n = 0; in DeleteRedline() local
1413 GetRedline( *pStt, &n ); in DeleteRedline()
1414 for( ; n < pRedlineTbl->Count() ; ++n ) in DeleteRedline()
1416 SwRedline* pRedl = (*pRedlineTbl)[ n ]; in DeleteRedline()
1439 pRedlineTbl->Remove( n ); in DeleteRedline()
1441 --n; in DeleteRedline()
1455 pRedlineTbl->Remove( n ); in DeleteRedline()
1457 --n; in DeleteRedline()
1470 pRedlineTbl->Remove( n ); in DeleteRedline()
1472 --n; in DeleteRedline()
1490 --n; in DeleteRedline()
1500 n = pRedlineTbl->Count(); in DeleteRedline()
1509 pRedlineTbl->DeleteAndDestroy( n-- ); in DeleteRedline()
1530 for( sal_uInt16 n = 0; n < pRedlineTbl->Count() ; ++n ) in GetRedlinePos() local
1532 const SwRedline* pTmp = (*pRedlineTbl)[ n ]; in GetRedlinePos()
1539 return n; in GetRedlinePos()
1998 sal_uInt16 n = 0; in lcl_AcceptRejectRedl() local
2004 const SwRedline* pFnd = lcl_FindCurrRedline( *pStt, n, sal_True ); in lcl_AcceptRejectRedl()
2009 if( (*fn_AcceptReject)( rArr, n, bCallDelete, pStt, pEnd )) in lcl_AcceptRejectRedl()
2011 ++n; in lcl_AcceptRejectRedl()
2014 for( ; n < rArr.Count(); ++n ) in lcl_AcceptRejectRedl()
2016 SwRedline* pTmp = rArr[ n ]; in lcl_AcceptRejectRedl()
2021 if( (*fn_AcceptReject)( rArr, n, bCallDelete, 0, 0 )) in lcl_AcceptRejectRedl()
2029 if( (*fn_AcceptReject)( rArr, n, bCallDelete, pStt, pEnd )) in lcl_AcceptRejectRedl()
2314 sal_uInt16 n = 0; in SelNextRedline() local
2315 const SwRedline* pFnd = lcl_FindCurrRedline( rSttPos, n, sal_True ); in SelNextRedline()
2334 for( ; !pFnd && n < pRedlineTbl->Count(); ++n ) in SelNextRedline()
2336 pFnd = (*pRedlineTbl)[ n ]; in SelNextRedline()
2352 while( ++n < pRedlineTbl->Count() ) in SelNextRedline()
2354 const SwRedline* pTmp = (*pRedlineTbl)[ n ]; in SelNextRedline()
2402 if( n < pRedlineTbl->Count() ) in SelNextRedline()
2431 sal_uInt16 n = 0; in SelPrevRedline() local
2432 const SwRedline* pFnd = lcl_FindCurrRedline( rSttPos, n, sal_False ); in SelPrevRedline()
2451 while( !pFnd && 0 < n ) in SelPrevRedline()
2453 pFnd = (*pRedlineTbl)[ --n ]; in SelPrevRedline()
2468 while( 0 < n ) in SelPrevRedline()
2470 const SwRedline* pTmp = (*pRedlineTbl)[ --n ]; in SelPrevRedline()
2484 ++n; in SelPrevRedline()
2521 if( n ) in SelPrevRedline()
2546 sal_uInt16 n = 0; in SetRedlineComment() local
2547 if( lcl_FindCurrRedline( *pStt, n, sal_True ) ) in SetRedlineComment()
2549 for( ; n < pRedlineTbl->Count(); ++n ) in SetRedlineComment()
2552 SwRedline* pTmp = (*pRedlineTbl)[ n ]; in SetRedlineComment()
2582 for( sal_uInt16 n = 0; n < rTbl.Count(); ++n ) in UpdateRedlineAttr() local
2584 SwRedline* pRedl = rTbl[ n ]; in UpdateRedlineAttr()
2982 for( sal_uInt16 n = 0, nEnd = aWhichIds.Count(); n < nEnd; ++n ) in Reject() local
2985 rPam, *GetDfltAttr( aWhichIds[ n ] ), nsSetAttrMode::SETATTR_DONTEXPAND ); in Reject()
2994 sal_uInt16 n = 0, nEnd = aWhichIds.Count(); in operator ==() local
2998 for( ; n < nEnd; ++n ) in operator ==()
2999 if( ((SwRedlineExtraData_Format&)rCmp).aWhichIds[n] != aWhichIds[n]) in operator ==()
3280 for(sal_uLong n(nSttNd); n <= nEndNd; ++n) in InvalidateRange() local
3282 SwNode* pNode = rNds[n]; in InvalidateRange()
3288 n == nSttNd ? nSttCnt : 0, in InvalidateRange()
3289 n == nEndNd ? nEndCnt : pNd->GetTxt().Len(), in InvalidateRange()
3353 for( sal_uInt16 n = 0; n < rTbl.Count(); ++n ) in MoveToSection() local
3355 SwRedline* pRedl = rTbl[ n ]; in MoveToSection()
3506 for( sal_uInt16 n = 0; n < rTbl.Count(); ++n ) in DelCopyOfSection() local
3508 SwRedline* pRedl = rTbl[ n ]; in DelCopyOfSection()
3538 sal_uInt16 n = rTbl.GetPos( this ); in DelCopyOfSection() local
3539 ASSERT( n != USHRT_MAX, "How strange. We don't exist!" ); in DelCopyOfSection()
3540 for( sal_Bool bBreak = sal_False; !bBreak && n > 0; ) in DelCopyOfSection()
3542 --n; in DelCopyOfSection()
3544 if( rTbl[ n ]->GetBound(sal_True) == *aPam.GetPoint() ) in DelCopyOfSection()
3546 rTbl[ n ]->GetBound(sal_True) = *pEnd; in DelCopyOfSection()
3549 if( rTbl[ n ]->GetBound(sal_False) == *aPam.GetPoint() ) in DelCopyOfSection()
3551 rTbl[ n ]->GetBound(sal_False) = *pEnd; in DelCopyOfSection()
3589 sal_uInt16 n; in MoveFromSection() local
3591 for( n = nMyPos+1; !bBreak && n < rTbl.Count(); ++n ) in MoveFromSection()
3594 if( rTbl[ n ]->GetBound(sal_True) == *GetPoint() ) in MoveFromSection()
3596 void* pTmp = &rTbl[ n ]->GetBound(sal_True); in MoveFromSection()
3600 if( rTbl[ n ]->GetBound(sal_False) == *GetPoint() ) in MoveFromSection()
3602 void* pTmp = &rTbl[ n ]->GetBound(sal_False); in MoveFromSection()
3607 for( bBreak = sal_False, n = nMyPos; !bBreak && n ; ) in MoveFromSection()
3609 --n; in MoveFromSection()
3611 if( rTbl[ n ]->GetBound(sal_True) == *GetPoint() ) in MoveFromSection()
3613 void* pTmp = &rTbl[ n ]->GetBound(sal_True); in MoveFromSection()
3617 if( rTbl[ n ]->GetBound(sal_False) == *GetPoint() ) in MoveFromSection()
3619 void* pTmp = &rTbl[ n ]->GetBound(sal_False); in MoveFromSection()
3693 for( n = 0; n < aBeforeArr.Count(); ++n ) in MoveFromSection()
3694 *(SwPosition*)aBeforeArr[ n ] = *Start(); in MoveFromSection()
3695 for( n = 0; n < aBehindArr.Count(); ++n ) in MoveFromSection()
3696 *(SwPosition*)aBehindArr[ n ] = *End(); in MoveFromSection()