git subrepo pull (merge) --force deps/libchdr

[pcsx_rearmed.git] / deps / libchdr / deps / zlib-1.3.1 / doc / algorithm.txt

diff --git a/deps/libchdr/deps/zlib-1.2.13/doc/algorithm.txt b/deps/libchdr/deps/zlib-1.3.1/doc/algorithm.txt
similarity index 99%
rename from deps/libchdr/deps/zlib-1.2.13/doc/algorithm.txt
rename to deps/libchdr/deps/zlib-1.3.1/doc/algorithm.txt
index c97f495..029e5a3 100644 (file)
--- a/deps/libchdr/deps/zlib-1.2.13/doc/algorithm.txt
+++ b/deps/libchdr/deps/zlib-1.3.1/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