diff options
author | Lode <lvandeve@gmail.com> | 2015-12-09 00:21:17 +0100 |
---|---|---|
committer | Lode <lvandeve@gmail.com> | 2015-12-09 00:21:17 +0100 |
commit | 26450ba3a84d5c7c8060ce604c5974030fc7869a (patch) | |
tree | 766a63e989c854df899b091904c040ec2be25b3b | |
parent | c965e8a1f340675bc8a10638470f818e3f743724 (diff) | |
parent | 3fe852a6d3ba16bd56905d08bb5fb51d07790a5b (diff) |
Merge branch 'master' of https://github.com/lvandeve/lodepng
-rw-r--r-- | lodepng.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lodepng.cpp b/lodepng.cpp index b0d9845..8b6076d 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 |