Lines Matching full:possible
2 * all possible valid and complete Huffman codes, subject to a length limit.
20 Examine all possible Huffman codes for a given number of symbols and a
37 all the symbols are used, there are exactly zero possible bit patterns
69 First, all of the possible Huffman codes are counted, and reachable
81 approximately 2x10^16 possible Huffman codes, only about 2x10^6 sub-codes
82 need to be examined to cover all of the possible table memory usage cases
93 possible codes remaining at the maximum length. This limits the maximum
144 possible triplets are reached in the generation of valid Huffman codes.
195 /* Return the number of possible Huffman codes using bit patterns of lengths
202 big_t sum; /* number of possible codes from this juncture */
209 /* see if only one possible code */
234 /* count all possible codes from this juncture and add them up */
314 /* Examine all possible codes from the given node (syms, len, left). Compute
434 Examine and show the total number of possible Huffman codes for a given
438 The possible codes are counted for each number of coded symbols from two to
441 across all possible codes. Each new maximum number of table entries and the
530 /* count possible codes for all numbers of symbols, add up counts */
