diff options
| author | THE-Spellchecker <The.Spellchecker@outlook.com> | 2023-12-02 16:56:47 -0600 |
|---|---|---|
| committer | Mark Adler <madler@alumni.caltech.edu> | 2024-01-17 13:49:11 -0800 |
| commit | 01155ccc3f822a31291a64e4ecd5f1dbb8a8ee63 (patch) | |
| tree | b00812cd5ba12d7ee803f2771d2f0e1304e66677 /doc | |
| parent | 16799d064b55a6b093fc52364f3343a1b1fa3b2f (diff) | |
| download | zlib-01155ccc3f822a31291a64e4ecd5f1dbb8a8ee63.tar.gz zlib-01155ccc3f822a31291a64e4ecd5f1dbb8a8ee63.tar.bz2 zlib-01155ccc3f822a31291a64e4ecd5f1dbb8a8ee63.zip | |
Fix random typos over several source and text files.
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 c97f495..029e5a3 100644 --- a/doc/algorithm.txt +++ b/doc/algorithm.txt | |||
| @@ -77,7 +77,7 @@ table took no time (and if you had infinite memory), then there would only | |||
| 77 | be a first level table to cover all the way to the longest code. However, | 77 | be a first level table to cover all the way to the longest code. However, |
| 78 | building the table ends up taking a lot longer for more bits since short | 78 | building the table ends up taking a lot longer for more bits since short |
| 79 | codes are replicated many times in such a table. What inflate() does is | 79 | codes are replicated many times in such a table. What inflate() does is |
| 80 | simply to make the number of bits in the first table a variable, and then | 80 | simply to make the number of bits in the first table a variable, and then |
| 81 | to set that variable for the maximum speed. | 81 | to set that variable for the maximum speed. |
| 82 | 82 | ||
| 83 | For inflate, which has 286 possible codes for the literal/length tree, the size | 83 | For inflate, which has 286 possible codes for the literal/length tree, the size |