Various code cleanups

[wimlib] / src / compress.c

diff --git a/src/compress.c b/src/compress.c
index f98a4416f666fd9776eb84953c5deea79c51e019..c91eb5020948a36d20a7c19aa067d1c012b8ec50 100644 (file)
--- a/src/compress.c
+++ b/src/compress.c
@@ -168,7 +168,8 @@ static void huffman_tree_compute_path_lengths(HuffmanNode *node, u16 cur_len)
        }
 }
 
-/* Creates a canonical Huffman code from an array of symbol frequencies.
+/* make_canonical_huffman_code: - Creates a canonical Huffman code from an array
+ *                               of symbol frequencies.
  *
  * The algorithm used is similar to the well-known algorithm that builds a
  * Huffman tree using a minheap.  In that algorithm, the leaf nodes are