From 3fe852a6d3ba16bd56905d08bb5fb51d07790a5b Mon Sep 17 00:00:00 2001 From: Lode Vandevenne Date: Mon, 2 Nov 2015 13:30:42 +0100 Subject: fix typo --- lodepng.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 -- cgit v1.2.3