From c217f57e30dbd3182a6a42879f7653b18b542160 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sat, 7 Nov 2015 15:04:16 +0100 Subject: Adding upstream version 1.6~rc1. Signed-off-by: Daniel Baumann --- README | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'README') diff --git a/README b/README index dc98c4f..caa8c2f 100644 --- a/README +++ b/README @@ -52,7 +52,7 @@ data, so the library should never crash even in case of corrupted input. There is no such thing as a "LZMA algorithm"; it is more like a "LZMA coding scheme". For example, the option '-0' of lzip uses the scheme in almost the simplest way possible; issuing the longest match it can find, -or a literal byte if it can't find a match. Conversely, a much more +or a literal byte if it can't find a match. Inversely, a much more elaborated way of finding coding sequences of minimum price than the one currently used by lzip could be developed, and the resulting sequence could also be coded using the LZMA coding scheme. -- cgit v1.2.3