diff options
| author | Clyne Sullivan <clyne@bitgloo.com> | 2020-12-27 17:12:14 -0500 |
|---|---|---|
| committer | Clyne Sullivan <clyne@bitgloo.com> | 2020-12-27 17:12:14 -0500 |
| commit | cfbe244e902093fae5250f6369af1fd9772763ca (patch) | |
| tree | c3dd4a0d32a1ec28304f0e683a7f0a27b7795724 /README.md | |
| parent | 2fbe5393df3c62ce174d3fa91ce7776a60ac2159 (diff) | |
decoder conforms to std::forward_iterator
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -2,7 +2,7 @@ Allows for long string or data constants to be compressed at compile-time, with a small decoder routine for decompression at run-time. -Compression is achieved using Huffman coding, which works by creating codes for frequently-occuring characters. +Compression is achieved using [Huffman coding](https://en.wikipedia.org/wiki/Huffman_coding), which works by creating short (measured in bits) codes for frequently-occuring characters. ## Use cases @@ -14,7 +14,7 @@ A ~3.5kB string of JSON can be compressed down ~2.5kB ([see it on Godbolt](https A ~40 line commented sample of Lisp can be reduced from 1,662 bytes to 1,244 (418 bytes saved) ([on Godbolt](https://godbolt.org/z/c64Pzz)). -Compression will work best on not-small blocks of text or data. This is because a decoding tree must be stored with the compressed data, requiring three bytes per value. +Compression will work best on larger blocks of text or data, as a decoding tree must be stored with the compressed data that requires three bytes per unique data byte. ## How to Use |