X-Git-Url: https://wimlib.net/git/?p=wimlib;a=blobdiff_plain;f=src%2Fcompress_common.c;h=270b8cfe3b4ffd410a2cc02e0247e3327846f4a0;hp=e8ed00d3c3096e810b46d67ef4617d5196618058;hb=fe548d263d477a745dfa5057f540cc5c35ecce89;hpb=394751ae13025edab605cd61c8e32819e3fb33a1

diff --git a/src/compress_common.c b/src/compress_common.c
index e8ed00d3..270b8cfe 100644
--- a/src/compress_common.c
+++ b/src/compress_common.c
@@ -33,7 +33,6 @@
 #include "wimlib/compress_common.h"
 #include "wimlib/util.h"
 
-#include <stdlib.h>
 #include <string.h>
 
 /* Writes @num_bits bits, given by the @num_bits least significant bits of
@@ -553,8 +552,8 @@ gen_codewords(u32 A[restrict], u8 lens[restrict],
  * approximately (with the algorithm used here) the minimum weighted path
  * length from the root, given this constraint.
  *
- * A canonical Huffman code satisfies the properties that a codeword
- * never lexicographically precedes a shorter codeword, and the
+ * A canonical Huffman code satisfies the properties that a longer
+ * codeword never lexicographically precedes a shorter codeword, and the
  * lexicographic ordering of codewords of the same length is the same as
  * the lexicographic ordering of the corresponding symbols.  A canonical
  * Huffman code, or more generally a canonical prefix code, can be