| Index: third_party/libwebp/utils/huffman_encode.c
|
| diff --git a/third_party/libwebp/utils/huffman_encode.c b/third_party/libwebp/utils/huffman_encode.c
|
| index 96086663d9c4f1b985ce5b54928410fec3a5932c..9c5986738d07a2b82eeefed9f588f21e975dfcc7 100644
|
| --- a/third_party/libwebp/utils/huffman_encode.c
|
| +++ b/third_party/libwebp/utils/huffman_encode.c
|
| @@ -27,7 +27,7 @@ static int ValuesShouldBeCollapsedToStrideAverage(int a, int b) {
|
| }
|
|
|
| // Change the population counts in a way that the consequent
|
| -// Hufmann tree compression, especially its RLE-part, give smaller output.
|
| +// Huffman tree compression, especially its RLE-part, give smaller output.
|
| static int OptimizeHuffmanForRle(int length, int* const counts) {
|
| uint8_t* good_for_rle;
|
| // 1) Let's make the Huffman code more compatible with rle encoding.
|
|
|