X-Git-Url: https://notaz.gp2x.de/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=deps%2Flibchdr%2Fdeps%2Fzlib-1.3.1%2Fdoc%2Falgorithm.txt;fp=deps%2Flibchdr%2Fdeps%2Fzlib-1.2.13%2Fdoc%2Falgorithm.txt;h=029e5a313498619076cdf8db7b0fb1de8b2aa710;hb=648db22b0750712da893c306efcc8e4b2d3a4e3c;hp=c97f495020b4293ee09994143ed6cd9d1bd0a2bf;hpb=e2fb1389dc12376acb84e4993ed3b08760257252;p=pcsx_rearmed.git

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 c97f4950..029e5a31 100644
--- 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