mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-26 09:30:24 +00:00
5aaefe4e62
Huffman codes have a useful property in that they are prefix codes. That is, a set of bits representing a Huffman-coded symbol is never a prefix of another symbol. This allows us to create a table, where each index in the table are integers whose prefix is the entry's corresponding Huffman code. With Deflate, we can have codes up to 16 bits in length, thus creating a prefix table with 2^16 entries. So instead of creating a table fit all possible codes, we use a cutoff of 8-bit codes. Codes larger than 8 bits fall back to the binary search method. Using the "enwik8" file as a test (100MB uncompressed, commonly used in benchmarks: https://www.mattmahoney.net/dc/enwik8.zip), decompression time decreases from 3.527s to 2.585s on Linux. |
||
|---|---|---|
| .. | ||
| Applets | ||
| Applications | ||
| BuggieBox | ||
| Demos | ||
| DevTools | ||
| DynamicLoader | ||
| Games | ||
| Libraries | ||
| Services | ||
| Shell | ||
| Utilities | ||
| CMakeLists.txt | ||