Searched refs:mMatchLen (Results 1 – 3 of 3) sorted by relevance
65 private int mMatchLen; field in BsDiffMatcher95 mNewPos += mMatchLen; in next()115 mMatchLen = match.length; in next()116 totalMatchLen += mMatchLen; in next()119 for (; matchesCacheSize < mMatchLen; ++matchesCacheSize) { in next()133 if (mMatchLen > numMatches + mMinimumMatchLength || totalMatchLen >= mTotalMatchLenBudget) { in next()137 if (mMatchLen == 0) { in next()139 } else if (mMatchLen == numMatches) { in next()
264 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN; variable640 mLevel[New] = (UINT8)mMatchLen; in Split()642 MakeChild(New, mText[mMatchPos + mMatchLen], Old); in Split()643 MakeChild(New, mText[mPos + mMatchLen], mPos); in Split()664 if (mMatchLen >= 4) { in InsertNode()674 mMatchLen--; in InsertNode()679 while (mLevel[q] >= mMatchLen) { in InsertNode()700 mMatchLen = 1; in InsertNode()703 mMatchLen = 2; in InsertNode()723 t1 = &mText[mPos + mMatchLen]; in InsertNode()[all …]
418 private int mMatchLen; field in BsDiffTest.NaiveMatcher424 mMatchLen = 0; in NaiveMatcher()429 mNewPos += mMatchLen; in next()433 mMatchLen = longestMatch.length; in next()434 if (mMatchLen >= 3) { in next()