Lines Matching refs:sal_uLong
58 virtual sal_uLong GetHashValue() const = 0;
66 sal_uLong* pIndex;
71 sal_uLong nSttLineNum;
91 sal_uLong ShowDiffs( const CompareData& rData );
93 virtual void ShowInsert( sal_uLong nStt, sal_uLong nEnd );
94 virtual void ShowDelete( const CompareData& rData, sal_uLong nStt,
95 sal_uLong nEnd, sal_uLong nInsPos );
97 sal_uLong& nStt, sal_uLong& nEnd,
98 sal_uLong& nThisStt, sal_uLong& nThisEnd );
102 void SetIndex( sal_uLong nLine, sal_uLong nIndex );
103 sal_uLong GetIndex( sal_uLong nLine ) const in GetIndex()
107 void SetChanged( sal_uLong nLine, sal_Bool bFlag = sal_True );
108 sal_Bool GetChanged( sal_uLong nLine ) const in GetChanged()
115 sal_uLong GetLineCount() const { return aLines.Count(); } in GetLineCount()
116 sal_uLong GetLineOffset() const { return nSttLineNum; } in GetLineOffset()
117 const CompareLine* GetLine( sal_uLong nLine ) const in GetLine()
127 sal_uLong nNext, nHash;
134 sal_uLong* pHashArr;
136 sal_uLong nCount, nPrime;
139 Hash( sal_uLong nSize );
144 sal_uLong GetCount() const { return nCount; } in GetCount()
152 sal_uLong* pIndex;
153 sal_uLong* pLineNum;
154 sal_uLong nCount;
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()
162 sal_uLong GetCount() const { return nCount; } in GetCount()
173 void Compare( sal_uLong nStt1, sal_uLong nEnd1, sal_uLong nStt2, sal_uLong nEnd2 );
174 sal_uLong CheckDiag( sal_uLong nStt1, sal_uLong nEnd1,
175 sal_uLong nStt2, sal_uLong nEnd2, sal_uLong* pCost );
183 static void CountDifference( const CompareData& rData, sal_uLong* pCounts );
185 sal_Char* pDiscard, sal_uLong* pCounts );
186 static void CheckDiscard( sal_uLong nLen, sal_Char* pDiscard );
187 static sal_uLong SetChangedFlag( CompareData& rData, sal_Char* pDiscard, int bFirst );
191 Compare( sal_uLong nDiff, CompareData& rData1, CompareData& rData2 );
211 void CompareData::SetIndex( sal_uLong nLine, sal_uLong nIndex ) in SetIndex()
215 pIndex = new sal_uLong[ aLines.Count() ]; in SetIndex()
216 memset( pIndex, 0, aLines.Count() * sizeof( sal_uLong ) ); in SetIndex()
222 void CompareData::SetChanged( sal_uLong nLine, sal_Bool bFlag ) in SetChanged()
237 sal_uLong nDifferent; in CompareLines()
249 sal_uLong CompareData::ShowDiffs( const CompareData& rData ) in ShowDiffs()
251 sal_uLong nLen1 = rData.GetLineCount(), nLen2 = GetLineCount(); in ShowDiffs()
252 sal_uLong nStt1 = 0, nStt2 = 0; in ShowDiffs()
253 sal_uLong nCnt = 0; in ShowDiffs()
259 sal_uLong nSav1 = nStt1, nSav2 = nStt2; in ShowDiffs()
283 sal_uLong nLen1 = rData.GetLineCount(), nLen2 = GetLineCount(); in HasDiffs()
284 sal_uLong nStt1 = 0, nStt2 = 0; in HasDiffs()
298 void CompareData::ShowInsert( sal_uLong, sal_uLong ) in ShowInsert() argument
302 void CompareData::ShowDelete( const CompareData&, sal_uLong, sal_uLong, sal_uLong ) in ShowDelete() argument
307 sal_uLong&, sal_uLong&, sal_uLong&, sal_uLong& ) in CheckForChangesInLine() argument
313 Hash::Hash( sal_uLong nSize ) in Hash()
317 static const sal_uLong primes[] = in Hash()
358 pHashArr = new sal_uLong[ nPrime ]; in Hash()
359 memset( pHashArr, 0, nPrime * sizeof( sal_uLong ) ); in Hash()
372 for( sal_uLong n = 0; n < rData.GetLineCount(); ++n ) in CalcHashValue()
376 sal_uLong nH = pLine->GetHashValue(); in CalcHashValue()
378 sal_uLong* pFound = &pHashArr[ nH % nPrime ]; in CalcHashValue()
379 sal_uLong i; in CalcHashValue()
401 Compare::Compare( sal_uLong nDiff, CompareData& rData1, CompareData& rData2 ) in Compare()
409 sal_uLong* pCount1 = new sal_uLong[ nDiff ]; in Compare()
410 sal_uLong* pCount2 = new sal_uLong[ nDiff ]; in Compare()
411 memset( pCount1, 0, nDiff * sizeof( sal_uLong )); in Compare()
412 memset( pCount2, 0, nDiff * sizeof( sal_uLong )); in Compare()
449 void Compare::CountDifference( const CompareData& rData, sal_uLong* pCounts ) in CountDifference()
451 sal_uLong nLen = rData.GetLineCount(); in CountDifference()
452 for( sal_uLong n = 0; n < nLen; ++n ) in CountDifference()
454 sal_uLong nIdx = rData.GetIndex( n ); in CountDifference()
460 sal_Char* pDiscard, sal_uLong* pCounts ) in SetDiscard()
462 sal_uLong nLen = rData.GetLineCount(); in SetDiscard()
466 sal_uLong n; in SetDiscard()
473 sal_uLong nIdx = rData.GetIndex( n ); in SetDiscard()
484 void Compare::CheckDiscard( sal_uLong nLen, sal_Char* pDiscard ) in CheckDiscard()
486 for( sal_uLong n = 0; n < nLen; ++n ) in CheckDiscard()
492 sal_uLong j; in CheckDiscard()
493 sal_uLong length; in CheckDiscard()
494 sal_uLong provisional = 0; in CheckDiscard()
524 sal_uLong consec; in CheckDiscard()
525 sal_uLong minimum = 1; in CheckDiscard()
526 sal_uLong tem = length / 4; in CheckDiscard()
592 sal_uLong nLen = rData.GetLineCount(); in MovedData()
593 sal_uLong n; in MovedData()
603 pIndex = new sal_uLong[ nCount ]; in MovedData()
604 pLineNum = new sal_uLong[ nCount ]; in MovedData()
629 sal_uLong nSize = rMD1.GetCount() + rMD2.GetCount() + 3; in CompareSequence()
642 void Compare::CompareSequence::Compare( sal_uLong nStt1, sal_uLong nEnd1, in Compare()
643 sal_uLong nStt2, sal_uLong nEnd2 ) in Compare()
666 sal_uLong c, d, b; in Compare()
686 sal_uLong Compare::CompareSequence::CheckDiag( sal_uLong nStt1, sal_uLong nEnd1, in CheckDiag()
687 sal_uLong nStt2, sal_uLong nEnd2, sal_uLong* pCost ) in CheckDiag()
722 while( sal_uLong(x) < nEnd1 && sal_uLong(y) < nEnd2 && in CheckDiag()
748 while( sal_uLong(x) > nStt1 && sal_uLong(y) > nStt2 && in CheckDiag()
770 sal_uLong i = 0; in ShiftBoundaries()
771 sal_uLong j = 0; in ShiftBoundaries()
772 sal_uLong i_end = pData->GetLineCount(); in ShiftBoundaries()
773 sal_uLong preceding = ULONG_MAX; in ShiftBoundaries()
774 sal_uLong other_preceding = ULONG_MAX; in ShiftBoundaries()
778 sal_uLong start, other_start; in ShiftBoundaries()
848 virtual sal_uLong GetHashValue() const;
851 static sal_uLong GetTxtNodeHashValue( const SwTxtNode& rNd, sal_uLong nVal );
872 sal_uLong PrevIdx( const SwNode* pNd );
873 sal_uLong NextIdx( const SwNode* pNd );
876 virtual void ShowInsert( sal_uLong nStt, sal_uLong nEnd );
877 virtual void ShowDelete( const CompareData& rData, sal_uLong nStt,
878 sal_uLong nEnd, sal_uLong nInsPos );
881 sal_uLong& nStt, sal_uLong& nEnd,
882 sal_uLong& nThisStt, sal_uLong& nThisEnd );
902 sal_uLong SwCompareLine::GetHashValue() const in GetHashValue()
904 sal_uLong nRet = 0; in GetHashValue()
1144 sal_uLong SwCompareLine::GetTxtNodeHashValue( const SwTxtNode& rNd, sal_uLong nVal ) in GetTxtNodeHashValue()
1262 sal_uLong SwCompareData::NextIdx( const SwNode* pNd ) in NextIdx()
1276 sal_uLong SwCompareData::PrevIdx( const SwNode* pNd ) in PrevIdx()
1299 sal_uLong nSrcSttIdx = NextIdx( rSrcEndNd.StartOfSectionNode() ); in CheckRanges()
1300 sal_uLong nSrcEndIdx = rSrcEndNd.GetIndex(); in CheckRanges()
1302 sal_uLong nDstSttIdx = NextIdx( rDstEndNd.StartOfSectionNode() ); in CheckRanges()
1303 sal_uLong nDstEndIdx = rDstEndNd.GetIndex(); in CheckRanges()
1345 void SwCompareData::ShowInsert( sal_uLong nStt, sal_uLong nEnd ) in ShowInsert()
1359 sal_uLong nStt, in ShowDelete()
1360 sal_uLong nEnd, in ShowDelete()
1361 sal_uLong nInsPos ) in ShowDelete()
1419 sal_uLong& rStt, sal_uLong& rEnd, in CheckForChangesInLine()
1420 sal_uLong& rThisStt, sal_uLong& rThisEnd ) in CheckForChangesInLine()
1827 sal_uLong nEndOfExtra = rSrcDoc.GetNodes().GetEndOfExtras().GetIndex(); in MergeDoc()
1828 sal_uLong nMyEndOfExtra = GetNodes().GetEndOfExtras().GetIndex(); in MergeDoc()
1832 sal_uLong nNd = pRedl->GetPoint()->nNode.GetIndex(); in MergeDoc()