From 908adfc82c98c531ca847f183489ccf57e190e16 Mon Sep 17 00:00:00 2001 From: Eric Biggers Date: Fri, 21 Dec 2012 12:52:14 -0600 Subject: [PATCH] make_huffman_decode_table(): Fix comment --- src/decompress.c | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/src/decompress.c b/src/decompress.c index ebbf33e3..e97aab5c 100644 --- a/src/decompress.c +++ b/src/decompress.c @@ -38,7 +38,8 @@ * (2**table_bits) + 2 * num_syms to guarantee * that there is enough space. * - * @num_syms: Total number of symbols in the Huffman tree. + * @num_syms: Number of symbols in the alphabet, including symbols + * that do not appear in this particular input chunk. * * @table_bits: Any symbols with a code length of table_bits or less can * be decoded in one lookup of the table. 2**table_bits @@ -46,7 +47,7 @@ * any Huffman codes longer than @table_bits. * * @lens: An array of length @num_syms, indexable by symbol, that - * gives the length of the Huffman codeward for that + * gives the length of the Huffman codeword for that * symbol. Because the Huffman tree is in canonical form, * it can be reconstructed by only knowing the length of * the codeword for each symbol. It is assumed, but not -- 2.43.0