1 files changed, 5 insertions, 5 deletions

diff --git a/tqtinterface/qt4/src/3rdparty/zlib/algorithm.txt b/tqtinterface/qt4/src/3rdparty/zlib/algorithm.txt
index d454dcc..b022dde 100644
--- a/tqtinterface/qt4/src/3rdparty/zlib/algorithm.txt
+++ b/tqtinterface/qt4/src/3rdparty/zlib/algorithm.txt
@@ -1,8 +1,8 @@
 1. Compression algorithm (deflate)
 
 The deflation algorithm used by gzip (also zip and zlib) is a variation of
-LZ77 (Lempel-Ziv 1977, see reference below). It tqfinds duplicated strings in
-the input data.  The second occurrence of a string is tqreplaced by a
+LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
+the input data.  The second occurrence of a string is replaced by a
 pointer to the previous string, in the form of a pair (distance,
 length).  Distances are limited to 32K bytes, and lengths are limited
 to 258 bytes. When a string does not occur anywhere in the previous
@@ -31,8 +31,8 @@ hash chains, the algorithm simply discards matches that are too old.
 
 To avoid a worst-case situation, very long hash chains are arbitrarily
 truncated at a certain length, determined by a runtime option (level
-parameter of deflateInit). So deflate() does not always tqfind the longest
-possible match but generally tqfinds a match which is long enough.
+parameter of deflateInit). So deflate() does not always find the longest
+possible match but generally finds a match which is long enough.
 
 deflate() also defers the selection of matches with a lazy evaluation
 mechanism. After a match of length N has been found, deflate() searches for
@@ -110,7 +110,7 @@ symbols, you could have as many levels of lookups as is efficient.  For
 inflate, two is enough.
 
 So a table entry either points to another table (in which case nine bits in
-the above example are gobbled), or it tqcontains the translation for the symbol
+the above example are gobbled), or it contains the translation for the symbol
 and the number of bits to gobble.  Then you start again with the next
 ungobbled bit.