Lines Matching full:patterns
34 be coded, what the last code length used was, and how many bit patterns of
36 number of unused patterns to graduate to the next code length. We then
39 properties are: we cannot use more bit patterns than are available; and when
40 all the symbols are used, there are exactly zero possible bit patterns
120 left: number of available bit patterns at length len
130 must be even, since it represents the number of available bit patterns at
198 /* Return the number of possible Huffman codes using bit patterns of lengths
199 len through max inclusive, coding syms symbols, with left bit patterns of
209 int use; /* number of bit patterns to use in next call */
225 /* we need to use at least this many bit patterns so that the code won't be
226 incomplete at the next length (more bit patterns than symbols) */
231 /* we can use at most this many bit patterns, lest there not be enough
326 int use; /* number of bit patterns to use in next call */
361 /* we need to use at least this many bit patterns so that the code won't be
362 incomplete at the next length (more bit patterns than symbols) */
367 /* we can use at most this many bit patterns, lest there not be enough
406 int left; /* number of unused bit patterns at this length */
