HomeSort by relevance Sort by last modified time
    Searched refs:curMatch3 (Results 1 - 4 of 4) sorted by null

  /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/
BinTree.java 122 int curMatch3 = _hash[kHash3Offset + hash3Value];
129 if (curMatch3 > matchMinPos) if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur]) {
130 if (curMatch3 == curMatch2) offset -= 2;
132 distances[offset++] = _pos - curMatch3 - 1;
133 curMatch2 = curMatch3;
  /external/lzma/Java/SevenZip/Compression/LZ/
BinTree.java 154 int curMatch3 = _hash[kHash3Offset + hash3Value];
163 if (curMatch3 > matchMinPos)
164 if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur])
166 if (curMatch3 == curMatch2)
169 distances[offset++] = _pos - curMatch3 - 1;
170 curMatch2 = curMatch3;
  /external/lzma/CS/7zip/Compress/LZ/
LzBinTree.cs 154 UInt32 curMatch3 = _hash[kHash3Offset + hash3Value];
163 if (curMatch3 > matchMinPos)
164 if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur])
166 if (curMatch3 == curMatch2)
169 distances[offset++] = _pos - curMatch3 - 1;
170 curMatch2 = curMatch3;
  /external/lzma/C/
LzFindMt.c 580 UInt32 hash2Value, hash3Value, curMatch2, curMatch3;
587 curMatch3 = hash[kFix3HashSize + hash3Value];
604 if (curMatch3 >= matchMinPos && cur[(ptrdiff_t)curMatch3 - lzPos] == cur[0])
607 *distances++ = lzPos - curMatch3 - 1;
615 UInt32 hash2Value, hash3Value, hash4Value, curMatch2, curMatch3, curMatch4;
622 curMatch3 = hash[kFix3HashSize + hash3Value];
641 if (curMatch3 >= matchMinPos && cur[(ptrdiff_t)curMatch3 - lzPos] == cur[0])
643 distances[1] = lzPos - curMatch3 - 1;
    [all...]

Completed in 259 milliseconds