Lines Matching defs:length
227 unsigned char length[MAX_SYMBOLS];
247 length[ii] = hh;
251 minLen = maxLen = length[0];
253 if(length[ii] > maxLen) maxLen = length[ii];
254 else if(length[ii] < minLen) minLen = length[ii];
257 /* Calculate permute[], base[], and limit[] tables from length[].
260 * into decoded symbols. It contains symbol values sorted by length.
263 * of a given length when using permute[].
287 if (length[hh] == ii) hufGroup->permute[pp++] = hh;
290 // Count symbols coded for at each bit length
291 for (ii = 0; ii < symCount; ii++) temp[length[ii]]++;
294 * length, which is (previous limit<<1)+symbols at this level), and
295 * base[] (number of symbols to ignore at each bit length, which is
314 * This undoes three types of compression: huffman coding, run length encoding,
329 // and run length encoding, saving the result into dbuf[dbufCount++] = uc
391 symbols, but a run of length 0 doesn't mean anything in this