diff options
| author | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-07 10:00:02 +0000 |
|---|---|---|
| committer | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-07 10:00:02 +0000 |
| commit | 87ecf0660c0e11efa9eab93b8b20cf251de08d21 (patch) | |
| tree | 83b393486d489834d8831512a00322fff50ade33 /README | |
| parent | Adding debian version 1.15~pre3-1. (diff) | |
| download | lzip-87ecf0660c0e11efa9eab93b8b20cf251de08d21.tar.xz lzip-87ecf0660c0e11efa9eab93b8b20cf251de08d21.zip | |
Merging upstream version 1.15~rc1.
Signed-off-by: Daniel Baumann <mail@daniel-baumann.ch>
Diffstat (limited to 'README')
| -rw-r--r-- | README | 15 |
1 files changed, 8 insertions, 7 deletions
@@ -6,10 +6,6 @@ compresses more than bzip2, which makes it well suited for software distribution and data archiving. Lzip is a clean implementation of the LZMA algorithm. -Lzip uses the same well-defined exit status values used by bzip2, which -makes it safer when used in pipes or scripts than compressors returning -ambiguous warning values, like gzip. - The lzip file format is designed for long-term data archiving and provides very safe integrity checking. The member trailer stores the 32-bit CRC of the original data, the size of the original data and the @@ -26,7 +22,12 @@ recover the original uncompressed data. If you ever need to recover data from a damaged lzip file, try the lziprecover program. Lziprecover makes lzip files resistant to bit-flip (one of the most common forms of data corruption), and provides data -recovery capabilities, including error-checked merging of damaged files. +recovery capabilities, including error-checked merging of damaged copies +of a file. + +Lzip uses the same well-defined exit status values used by bzip2, which +makes it safer when used in pipes or scripts than compressors returning +ambiguous warning values, like gzip. Lzip replaces every file given in the command line with a compressed version of itself, with the name "original_name.lz". Each compressed @@ -53,7 +54,7 @@ multivolume compressed tar archives. Lzip is able to compress and decompress streams of unlimited size by automatically creating multi-member output. The members so created are -large (about 2^60 bytes each). +large, about 64 PiB each. Lzip will automatically use the smallest possible dictionary size without exceeding the given limit. Keep in mind that the decompression @@ -72,7 +73,7 @@ The ideas embodied in lzip are due to (at least) the following people: Abraham Lempel and Jacob Ziv (for the LZ algorithm), Andrey Markov (for the definition of Markov chains), G.N.N. Martin (for the definition of range encoding), Igor Pavlov (for putting all the above together in -LZMA), and Julian Seward (for bzip2's CLI and the idea of unzcrash). +LZMA), and Julian Seward (for bzip2's CLI). Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013 Antonio Diaz Diaz. |