CERBERUS/nmap
1
0
Fork 0
mirror of https://github.com/nmap/nmap.git synced 2026-09-27 02:29:42 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Upgrade zlib to 1.3.1

Browse source
This commit is contained in:
dmiller 2024-02-28 16:35:39 +00:00
parent 34da72b5f5
commit f64e2fab07
105 changed files with 6849 additions and 4172 deletions
Download patch file Download diff file Expand all files Collapse all files

2
libz/doc/algorithm.txt
View file

@ -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