Lines Matching refs:n
160 sal_uLong GetIndex( sal_uLong n ) const { return pIndex[ n ]; } in GetIndex()
161 sal_uLong GetLineNum( sal_uLong n ) const { return pLineNum[ n ]; } in GetLineNum()
372 for( sal_uLong n = 0; n < rData.GetLineCount(); ++n ) in CalcHashValue() local
374 const CompareLine* pLine = rData.GetLine( n ); in CalcHashValue()
394 rData.SetIndex( n, i ); in CalcHashValue()
452 for( sal_uLong n = 0; n < nLen; ++n ) in CountDifference() local
454 sal_uLong nIdx = rData.GetIndex( n ); in CountDifference()
466 sal_uLong n; in SetDiscard() local
468 for( n = nLen / 64; ( n = n >> 2 ) > 0; ) in SetDiscard()
471 for( n = 0; n < nLen; ++n ) in SetDiscard()
473 sal_uLong nIdx = rData.GetIndex( n ); in SetDiscard()
477 pDiscard[ n ] = !nIdx ? 1 : nIdx > nMax ? 2 : 0; in SetDiscard()
480 pDiscard[ n ] = 0; in SetDiscard()
486 for( sal_uLong n = 0; n < nLen; ++n ) in CheckDiscard() local
488 if( 2 == pDiscard[ n ] ) in CheckDiscard()
489 pDiscard[n] = 0; in CheckDiscard()
490 else if( pDiscard[ n ] ) in CheckDiscard()
498 for (j = n; j < nLen; j++) in CheckDiscard()
507 while( j > n && 2 == pDiscard[j - 1] ) in CheckDiscard()
512 length = j - n; in CheckDiscard()
518 while (j > n) in CheckDiscard()
539 if (pDiscard[n + j] != 2) in CheckDiscard()
545 pDiscard[n + j] = 0; in CheckDiscard()
553 if (j >= 8 && pDiscard[n + j] == 1) in CheckDiscard()
555 if (pDiscard[n + j] == 2) in CheckDiscard()
556 consec = 0, pDiscard[n + j] = 0; in CheckDiscard()
557 else if (pDiscard[n + j] == 0) in CheckDiscard()
566 n += length - 1; in CheckDiscard()
571 if (j >= 8 && pDiscard[n - j] == 1) in CheckDiscard()
573 if (pDiscard[n - j] == 2) in CheckDiscard()
574 consec = 0, pDiscard[n - j] = 0; in CheckDiscard()
575 else if (pDiscard[n - j] == 0) in CheckDiscard()
593 sal_uLong n; in MovedData() local
595 for( n = 0; n < nLen; ++n ) in MovedData()
596 if( pDiscard[ n ] ) in MovedData()
597 rData.SetChanged( n ); in MovedData()
606 for( n = 0, nCount = 0; n < nLen; ++n ) in MovedData()
607 if( !pDiscard[ n ] ) in MovedData()
609 pIndex[ nCount ] = rData.GetIndex( n ); in MovedData()
610 pLineNum[ nCount++ ] = n; in MovedData()
927 for( xub_StrLen n = 0; n < sStr.Len(); ++n ) in GetHashValue() local
928 ( nRet <<= 1 ) += sStr.GetChar( n ); in GetHashValue()
1147 for( xub_StrLen n = 0; n < sStr.Len(); ++n ) in GetTxtNodeHashValue() local
1148 ( nVal <<= 1 ) += sStr.GetChar( n ); in GetTxtNodeHashValue()
1702 sal_uInt16 n = 0; in InsertRedline() local
1705 if( !pDoc->GetRedline( *pDStt, &n ) && n ) in InsertRedline()
1706 --n; in InsertRedline()
1709 for( ; n < rRedlineTbl.Count(); ++n ) in InsertRedline()
1711 SwRedline* pRedl = rRedlineTbl[ n ]; in InsertRedline()
1732 n = rRedlineTbl.Count(); in InsertRedline()
1757 n = USHRT_MAX; in InsertRedline()
1829 for( sal_uInt16 n = 0; n < rSrcRedlTbl.Count(); ++n ) in MergeDoc() local
1831 const SwRedline* pRedl = rSrcRedlTbl[ n ]; in MergeDoc()