diff options
| author | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-07 14:04:16 +0000 |
|---|---|---|
| committer | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-07 14:04:16 +0000 |
| commit | c217f57e30dbd3182a6a42879f7653b18b542160 (patch) | |
| tree | 2aae1836d87a3fab4149f6634f7d4f8eba1bf2b0 /README | |
| parent | Adding upstream version 1.6~pre4. (diff) | |
| download | lzlib-c217f57e30dbd3182a6a42879f7653b18b542160.tar.xz lzlib-c217f57e30dbd3182a6a42879f7653b18b542160.zip | |
Adding upstream version 1.6~rc1.upstream/1.6_rc1
Signed-off-by: Daniel Baumann <mail@daniel-baumann.ch>
Diffstat (limited to 'README')
| -rw-r--r-- | README | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -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. |