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

  /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/
BinTree.java 121 int curMatch2 = _hash[hash2Value];
125 if (curMatch2 > matchMinPos) if (_bufferBase[_bufferOffset + curMatch2] == _bufferBase[cur]) {
127 distances[offset++] = _pos - curMatch2 - 1;
130 if (curMatch3 == curMatch2) offset -= 2;
133 curMatch2 = curMatch3;
135 if (offset != 0 && curMatch2 == curMatch) {
  /external/lzma/Java/SevenZip/Compression/LZ/
BinTree.java 153 int curMatch2 = _hash[hash2Value];
157 if (curMatch2 > matchMinPos)
158 if (_bufferBase[_bufferOffset + curMatch2] == _bufferBase[cur])
161 distances[offset++] = _pos - curMatch2 - 1;
166 if (curMatch3 == curMatch2)
170 curMatch2 = curMatch3;
172 if (offset != 0 && curMatch2 == curMatch)
  /external/lzma/CS/7zip/Compress/LZ/
LzBinTree.cs 153 UInt32 curMatch2 = _hash[hash2Value];
157 if (curMatch2 > matchMinPos)
158 if (_bufferBase[_bufferOffset + curMatch2] == _bufferBase[cur])
161 distances[offset++] = _pos - curMatch2 - 1;
166 if (curMatch3 == curMatch2)
170 curMatch2 = curMatch3;
172 if (offset != 0 && curMatch2 == curMatch)
  /external/lzma/C/
LzFindMt.c 560 UInt32 hash2Value, curMatch2;
566 curMatch2 = hash[hash2Value];
569 if (curMatch2 >= matchMinPos)
570 if (cur[(ptrdiff_t)curMatch2 - lzPos] == cur[0])
573 *distances++ = lzPos - curMatch2 - 1;
580 UInt32 hash2Value, hash3Value, curMatch2, curMatch3;
586 curMatch2 = hash[ hash2Value];
593 if (curMatch2 >= matchMinPos && cur[(ptrdiff_t)curMatch2 - lzPos] == cur[0])
595 distances[1] = lzPos - curMatch2 - 1;
    [all...]

Completed in 52 milliseconds