diff options
| author | Xin LI <delphij@FreeBSD.org> | 2024-02-18 06:12:51 +0000 |
|---|---|---|
| committer | Xin LI <delphij@FreeBSD.org> | 2024-02-18 06:12:51 +0000 |
| commit | 6255c67c3d1a268535c50de74d3300fd86d8f15d (patch) | |
| tree | 71ccf899646596d0d3238bbb05997a30c59fe661 /sys/contrib/zlib/doc/algorithm.txt | |
| parent | 2546c543fd7955276388aae6f0869d2c9285ba59 (diff) | |
| parent | f4695a30267c5d31987c7bc3eda906f55a8761be (diff) | |
Diffstat (limited to 'sys/contrib/zlib/doc/algorithm.txt')
| -rw-r--r-- | sys/contrib/zlib/doc/algorithm.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/sys/contrib/zlib/doc/algorithm.txt b/sys/contrib/zlib/doc/algorithm.txt index c97f495020b4..029e5a313498 100644 --- a/sys/contrib/zlib/doc/algorithm.txt +++ b/sys/contrib/zlib/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 |