Home
last modified time | relevance | path

Searched refs:rootBits (Results 1 – 3 of 3) sorted by relevance

/external/brotli/csharp/org/brotli/dec/
DHuffman.cs55 private static int NextTableBitSize(int[] count, int len, int rootBits) in NextTableBitSize() argument
57 int left = 1 << (len - rootBits); in NextTableBitSize()
68 return len - rootBits; in NextTableBitSize()
72 …internal static void BuildHuffmanTable(int[] rootTable, int tableOffset, int rootBits, int[] codeL… in BuildHuffmanTable() argument
103 int tableBits = rootBits; in BuildHuffmanTable()
118 for (int len = 1, step = 2; len <= rootBits; len++, step <<= 1) in BuildHuffmanTable()
130 for (int len = rootBits + 1, step = 2; len <= MaxLength; len++, step <<= 1) in BuildHuffmanTable()
137 tableBits = NextTableBitSize(count, len, rootBits); in BuildHuffmanTable()
141 … rootTable[tableOffset + low] = (tableBits + rootBits) << 16 | (currentOffset - tableOffset - low); in BuildHuffmanTable()
143 …ReplicateValue(rootTable, currentOffset + (key >> rootBits), step, tableSize, (len - rootBits) << … in BuildHuffmanTable()
/external/brotli/java/org/brotli/dec/
DHuffman.java46 private static int nextTableBitSize(int[] count, int len, int rootBits) { in nextTableBitSize() argument
47 int left = 1 << (len - rootBits); in nextTableBitSize()
56 return len - rootBits; in nextTableBitSize()
62 static void buildHuffmanTable(int[] rootTable, int tableOffset, int rootBits, int[] codeLengths, in buildHuffmanTable() argument
89 int tableBits = rootBits; in buildHuffmanTable()
104 for (int len = 1, step = 2; len <= rootBits; len++, step <<= 1) { in buildHuffmanTable()
115 for (int len = rootBits + 1, step = 2; len <= MAX_LENGTH; len++, step <<= 1) { in buildHuffmanTable()
119 tableBits = nextTableBitSize(count, len, rootBits); in buildHuffmanTable()
124 (tableBits + rootBits) << 16 | (currentOffset - tableOffset - low); in buildHuffmanTable()
126 replicateValue(rootTable, currentOffset + (key >> rootBits), step, tableSize, in buildHuffmanTable()
[all …]
/external/brotli/js/
Ddecode.js1166 function nextTableBitSize(count, len, rootBits) { argument
1167 var /** !number */ left = 1 << (len - rootBits);
1176 return len - rootBits;
1186 function buildHuffmanTable(rootTable, tableOffset, rootBits, codeLengths, codeLengthsSize) { argument
1204 var /** !number */ tableBits = rootBits;
1215 for (var /** !number */ len = 1, step = 2; len <= rootBits; len++, step <<= 1) {
1224 for (var /** !number */ len = rootBits + 1, step = 2; len <= 15; len++, step <<= 1) {
1228 tableBits = nextTableBitSize(count, len, rootBits);
1232 … rootTable[tableOffset + low] = (tableBits + rootBits) << 16 | (currentOffset - tableOffset - low);
1234 …replicateValue(rootTable, currentOffset + (key >> rootBits), step, tableSize, (len - rootBits) << …