diff options
| author | Xin LI <delphij@FreeBSD.org> | 2024-02-17 19:43:52 -0800 |
|---|---|---|
| committer | Xin LI <delphij@FreeBSD.org> | 2024-02-17 19:43:52 -0800 |
| commit | f4695a30267c5d31987c7bc3eda906f55a8761be (patch) | |
| tree | 7a0132f74b8152a3c8cab5cdaaac42234181d5b5 /doc | |
| parent | 900147a461df11f88acb3072821806cca8e574c9 (diff) | |
Vendor import of zlib 1.3.1.vendor/zlib/1.3.1vendor/zlib
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 c97f495020b4..029e5a313498 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 be a first level table to cover all the way to the longest code. However, building the table ends up taking a lot longer for more bits since short codes are replicated many times in such a table. What inflate() does is -simply to make the number of bits in the first table a variable, and then +simply to make the number of bits in the first table a variable, and then to set that variable for the maximum speed. For inflate, which has 286 possible codes for the literal/length tree, the size |