Lines Matching full:symbols

19  * decoding of prefix-encoded symbols using read_huffsym().
25  * code or not until all symbols have been decoded.
32  * of the corresponding symbols.  Consequently, we can sort the symbols
38  * Instead, it directly builds a table for decoding symbols using the
62  *   contain symbols.  Note that the long-codeword case is, in general,
64  *   used symbols are assigned the shortest codeword lengths.
83  *	The number of symbols in the alphabet; also, the length of the
126 	/* Count how many symbols have each possible codeword length.  in make_huffman_decode_table()
160 			 * so we must allow it.  By definition, no symbols can  in make_huffman_decode_table()
165 			 * decode symbols using such a code, we zero out the  in make_huffman_decode_table()
175 	/* Sort the symbols primarily by length and secondarily by symbol order.  in make_huffman_decode_table()
185 	/* Use the 'offsets' array to sort the symbols.  Note that we do not  in make_huffman_decode_table()
186 	 * include symbols that are not used in the code.  Consequently, fewer  in make_huffman_decode_table()