diff options
| author | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:26:40 -0700 |
|---|---|---|
| committer | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:26:40 -0700 |
| commit | f6194ef39af5864f792412460c354cc339dde7d1 (patch) | |
| tree | 5ea1e6849128e9b2194c66ee3d82afa36b4ac07c /doc | |
| parent | 639be997883d9016baaf46017a2802b2ce1698bd (diff) | |
| download | zlib-f6194ef39af5864f792412460c354cc339dde7d1.tar.gz zlib-f6194ef39af5864f792412460c354cc339dde7d1.tar.bz2 zlib-f6194ef39af5864f792412460c354cc339dde7d1.zip | |
zlib 1.2.3.4v1.2.3.4
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/algorithm.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/algorithm.txt b/doc/algorithm.txt index b022dde..34960bd 100644 --- a/doc/algorithm.txt +++ b/doc/algorithm.txt | |||
| @@ -121,7 +121,7 @@ At least for deflate's output that generates new trees every several 10's of | |||
| 121 | kbytes. You can imagine that filling in a 2^15 entry table for a 15-bit code | 121 | kbytes. You can imagine that filling in a 2^15 entry table for a 15-bit code |
| 122 | would take too long if you're only decoding several thousand symbols. At the | 122 | would take too long if you're only decoding several thousand symbols. At the |
| 123 | other extreme, you could make a new table for every bit in the code. In fact, | 123 | other extreme, you could make a new table for every bit in the code. In fact, |
| 124 | that's essentially a Huffman tree. But then you spend two much time | 124 | that's essentially a Huffman tree. But then you spend too much time |
| 125 | traversing the tree while decoding, even for short symbols. | 125 | traversing the tree while decoding, even for short symbols. |
| 126 | 126 | ||
| 127 | So the number of bits for the first lookup table is a trade of the time to | 127 | So the number of bits for the first lookup table is a trade of the time to |