1
0
Fork 0

Merging upstream version 1.6~rc1.

Signed-off-by: Daniel Baumann <daniel@debian.org>
This commit is contained in:
Daniel Baumann 2025-02-20 20:26:04 +01:00
parent 987a82eceb
commit 69cb17123b
Signed by: daniel
GPG key ID: FBB4F0E80A80222F
10 changed files with 61 additions and 49 deletions

2
README
View file

@ -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.