diff options
| author | Lode Vandevenne <lvandeve@users.noreply.github.com> | 2015-11-02 13:30:42 +0100 |
|---|---|---|
| committer | Lode Vandevenne <lvandeve@users.noreply.github.com> | 2015-11-02 13:30:42 +0100 |
| commit | 3fe852a6d3ba16bd56905d08bb5fb51d07790a5b (patch) | |
| tree | 1541fb141412df461f4418ed504414ca544e25ce | |
| parent | 942c151c7b92dc727fc2d0a00211e9fa83ef6e83 (diff) | |
fix typo
| -rw-r--r-- | lodepng.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lodepng.cpp b/lodepng.cpp index a5a5b78..2bbd07e 100644 --- a/lodepng.cpp +++ b/lodepng.cpp @@ -549,7 +549,7 @@ static unsigned HuffmanTree_make2DTree(HuffmanTree* tree) uninited, a value >= numcodes is an address to another bit, a value < numcodes is a code. The 2 rows are the 2 possible bit values (0 or 1), there are as many columns as codes - 1. - A good huffmann tree has N * 2 - 1 nodes, of which N - 1 are internal nodes. + A good huffman tree has N * 2 - 1 nodes, of which N - 1 are internal nodes. Here, the internal nodes are stored (what their 0 and 1 option point to). There is only memory for such good tree currently, if there are more nodes (due to too long length codes), error 55 will happen |