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

  /external/lzma/C/
LzHash.h 7 #define kHash2Size (1 << 10)
11 #define kFix3HashSize (kHash2Size)
12 #define kFix4HashSize (kHash2Size + kHash3Size)
13 #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size)
19 hash2Value = temp & (kHash2Size - 1); \
24 hash2Value = temp & (kHash2Size - 1); \
30 hash2Value = temp & (kHash2Size - 1); \
41 hash2Value = (p->crc[cur[0]] ^ cur[1]) & (kHash2Size - 1);
45 hash2Value = temp & (kHash2Size - 1); \
50 hash2Value = temp & (kHash2Size - 1); \
    [all...]
LzFind.c 219 if (p->numHashBytes > 2) p->fixedHashSize += kHash2Size;
  /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/
BinTree.java 21 static final int kHash2Size = 1 << 10;
25 static final int kHash3Offset = kHash2Size;
31 int kFixHashSize = kHash2Size + kHash3Size;
38 kFixHashSize = kHash2Size + kHash3Size;
112 hash2Value = temp & (kHash2Size - 1);
220 int hash2Value = temp & (kHash2Size - 1);
  /external/lzma/Java/SevenZip/Compression/LZ/
BinTree.java 22 static final int kHash2Size = 1 << 10;
26 static final int kHash3Offset = kHash2Size;
32 int kFixHashSize = kHash2Size + kHash3Size;
41 kFixHashSize = kHash2Size + kHash3Size;
142 hash2Value = temp & (kHash2Size - 1);
277 int hash2Value = temp & (kHash2Size - 1);
  /external/lzma/CS/7zip/Compress/LZ/
LzBinTree.cs 22 const UInt32 kHash2Size = 1 << 10;
26 const UInt32 kHash3Offset = kHash2Size;
32 UInt32 kFixHashSize = kHash2Size + kHash3Size;
41 kFixHashSize = kHash2Size + kHash3Size;
142 hash2Value = temp & (kHash2Size - 1);
277 UInt32 hash2Value = temp & (kHash2Size - 1);

Completed in 555 milliseconds