summaryrefslogtreecommitdiffstatshomepage
path: root/3rdparty/zlib/doc/algorithm.txt
diff options
context:
space:
mode:
author holub <andrei.holub@gmail.com>2025-03-26 21:52:28 -0400
committer GitHub <noreply@github.com>2025-03-26 21:52:28 -0400
commit52f1f3ac1cc06d2b29b5bb262b039095cebee86b (patch)
tree746626ffd86a45db26a780bb0119e11e62f74ee5 /3rdparty/zlib/doc/algorithm.txt
parentd1b6221df7b14950f968cb159c44be4ea6c04d51 (diff)
3rdparty/zlib: Updated to 1.3.1. (#13505)
Diffstat (limited to '3rdparty/zlib/doc/algorithm.txt')
-rw-r--r--3rdparty/zlib/doc/algorithm.txt2
1 files changed, 1 insertions, 1 deletions
diff --git a/3rdparty/zlib/doc/algorithm.txt b/3rdparty/zlib/doc/algorithm.txt
index c97f495020b..029e5a31349 100644
--- a/3rdparty/zlib/doc/algorithm.txt
+++ b/3rdparty/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