Searched refs:minLen (Results 1 – 3 of 3) sorted by relevance
| /oneTBB/examples/graph/fgbzip2/ |
| H A D | huffman.cpp | 205 void BZ2_hbAssignCodes(Int32 *code, UChar *length, Int32 minLen, Int32 maxLen, Int32 alphaSize) { in BZ2_hbAssignCodes() argument
209 for (j = minLen; j <= maxLen; j++) { in BZ2_hbAssignCodes()
224 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
230 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
249 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
254 for (i = minLen + 1; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
|
| H A D | compress.cpp | 278 Int32 nSelectors, alphaSize, minLen, maxLen, selCtr; in sendMTFValues() local
611 minLen = 32; in sendMTFValues()
616 if (s->len[j][i] < minLen) in sendMTFValues()
617 minLen = s->len[j][i]; in sendMTFValues()
620 AssertH(!(minLen < 1), 3005); in sendMTFValues()
621 BZ2_hbAssignCodes(&(s->code[j][0]), &(s->len[j][0]), minLen, maxLen, alphaSize); in sendMTFValues()
|
| H A D | decompress.cpp | 150 Int32 minLen, maxLen; in BZ2_decompress() local
400 minLen = 32; in BZ2_decompress()
405 if (s->len[j][i] < minLen) in BZ2_decompress()
406 minLen = s->len[j][i]; in BZ2_decompress()
412 minLen, in BZ2_decompress()
415 s->minLens[j] = minLen; in BZ2_decompress()
|