aboutsummaryrefslogtreecommitdiff
path: root/gnu/usr.bin/gzip/algorithm.doc
diff options
context:
space:
mode:
authorKris Kennaway <kris@FreeBSD.org>1999-05-28 13:23:27 +0000
committerKris Kennaway <kris@FreeBSD.org>1999-05-28 13:23:27 +0000
commit8a9cbccd6f708b709de55e3f68d8f6a8bf21908b (patch)
tree60dffc5d1fe250117a868d3a273db9eb3a83b8e8 /gnu/usr.bin/gzip/algorithm.doc
parent4011dfccd24eb067e51b8fb4c27e574528a93258 (diff)
Notes
Diffstat (limited to 'gnu/usr.bin/gzip/algorithm.doc')
-rw-r--r--gnu/usr.bin/gzip/algorithm.doc2
1 files changed, 1 insertions, 1 deletions
diff --git a/gnu/usr.bin/gzip/algorithm.doc b/gnu/usr.bin/gzip/algorithm.doc
index 24f7619ab6970..596faac18ab3a 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