diff options
| author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2022-02-21 16:16:13 +0000 |
|---|---|---|
| committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2022-02-21 16:16:27 +0000 |
| commit | e19c8398c1946bd4616c3fa1c095149462346d15 (patch) | |
| tree | 85f55afe5b89928e59ea76bdff18478bd1cc6b82 /README | |
| parent | Releasing debian version 1.12-3. (diff) | |
| download | lzlib-e19c8398c1946bd4616c3fa1c095149462346d15.tar.xz lzlib-e19c8398c1946bd4616c3fa1c095149462346d15.zip | |
Merging upstream version 1.13.
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'README')
| -rw-r--r-- | README | 14 |
1 files changed, 7 insertions, 7 deletions
@@ -31,9 +31,13 @@ the beginning is a thing of the past. The functions and variables forming the interface of the compression library are declared in the file 'lzlib.h'. Usage examples of the library are given -in the files 'bbexample.c', 'ffexample.c', and 'main.c' from the source +in the files 'bbexample.c', 'ffexample.c', and 'minilzip.c' from the source distribution. +All the library functions are thread safe. The library does not install any +signal handler. The decoder checks the consistency of the compressed data, +so the library should never crash even in case of corrupted input. + Compression/decompression is done by repeatedly calling a couple of read/write functions until all the data have been processed by the library. This interface is safer and less error prone than the traditional zlib @@ -60,10 +64,6 @@ Lzlib is able to compress and decompress streams of unlimited size by automatically creating multimember output. The members so created are large, about 2 PiB each. -All the library functions are thread safe. The library does not install -any signal handler. The decoder checks the consistency of the compressed -data, so the library should never crash even in case of corrupted input. - In spite of its name (Lempel-Ziv-Markov chain-Algorithm), LZMA is not a concrete algorithm; it is more like "any algorithm using the LZMA coding scheme". For example, the option '-0' of lzip uses the scheme in almost the @@ -73,7 +73,7 @@ finding coding sequences of minimum size than the one currently used by lzip could be developed, and the resulting sequence could also be coded using the LZMA coding scheme. -Lzlib currently implements two variants of the LZMA algorithm; fast (used by +Lzlib currently implements two variants of the LZMA algorithm: fast (used by option '-0' of minilzip) and normal (used by all other compression levels). The high compression of LZMA comes from combining two basic, well-proven @@ -93,7 +93,7 @@ been compressed. Decompressed is used to refer to data which have undergone the process of decompression. -Copyright (C) 2009-2021 Antonio Diaz Diaz. +Copyright (C) 2009-2022 Antonio Diaz Diaz. This file is free documentation: you have unlimited permission to copy, distribute, and modify it. |