summaryrefslogtreecommitdiff
path: root/gnu/usr.bin/gzip/algorithm.doc
diff options
context:
space:
mode:
authorBrad Smith <brad@cvs.openbsd.org>1999-05-03 22:00:49 +0000
committerBrad Smith <brad@cvs.openbsd.org>1999-05-03 22:00:49 +0000
commit31a4863cdab6e9c8a67aee811ece5b0ea953b0e8 (patch)
tree1b87f881cc2ba55f053f38f51af497944e2be888 /gnu/usr.bin/gzip/algorithm.doc
parentf5835878e3c55ad19d189f37161f7146686c41e6 (diff)
sync with gzip 1.2.4a
Ok'd by: millert
Diffstat (limited to 'gnu/usr.bin/gzip/algorithm.doc')
-rw-r--r--gnu/usr.bin/gzip/algorithm.doc6
1 files changed, 3 insertions, 3 deletions
diff --git a/gnu/usr.bin/gzip/algorithm.doc b/gnu/usr.bin/gzip/algorithm.doc
index 24f7619ab69..52b199172b3 100644
--- a/gnu/usr.bin/gzip/algorithm.doc
+++ b/gnu/usr.bin/gzip/algorithm.doc
@@ -48,7 +48,7 @@ match, thus speeding up the whole process. If compression ratio is more
important than speed, zip attempts a complete second search even if
the first match is already long enough.
-The lazy match evaluation is no performed for the fastest compression
+The lazy match evaluation is not performed for the fastest compression
modes (speed options -1 to -3). For these fast modes, new strings
are inserted in the hash table only when no match was found, or
when the match is not too long. This degrades the compression ratio
@@ -114,7 +114,7 @@ each with the following format:
subfield data
The subfield id can consist of two letters with some mnemonic value.
-Please send any such id to jloup@chorus.fr. Ids with a zero second
+Please send any such id to <gzip@gnu.org>. Ids with a zero second
byte are reserved for future use. The following ids are defined:
Ap (0x41, 0x70) : Apollo file type information
@@ -151,7 +151,7 @@ stamp of an encrypted file might be set to zero to avoid giving a clue
about the construction of the random header.
Jean-loup Gailly
-jloup@chorus.fr
+gzip@gnu.org
References: