mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-22 07:30:19 +00:00
b749167506
Previously we would calculate the index of the first parent node as heap.size() (which is initialized to non_zero_freqs), so in the edge case in which all symbols had a non-zero frequency, we would use the Size-index entry in the array for both the first symbol's leaf node, and the first parent node. The result would either be a non-optimal huffman code (bad), or an illegal huffman code that would then go on to crash due to an error check in CanonicalCode::from_bytes. (worse) We now store parent nodes starting at heap.size() - 1, which eliminates the potential overlap, and resolves the issue. |
||
|---|---|---|
| .. | ||
| brotli-test-files | ||
| deflate-test-files | ||
| CMakeLists.txt | ||
| TestBrotli.cpp | ||
| TestDeflate.cpp | ||
| TestGzip.cpp | ||
| TestLzma.cpp | ||
| TestXz.cpp | ||
| TestZlib.cpp | ||