diff options
| author | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-06 11:39:52 +0000 |
|---|---|---|
| committer | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-06 11:39:52 +0000 |
| commit | 9e42ac600685c2638702b8ad451a3cc6f3f29eae (patch) | |
| tree | b34e0b4cf3d2f4f3c42446ce9ed83202f017706b /README | |
| parent | Adding debian version 1.5~pre2-1. (diff) | |
| download | clzip-9e42ac600685c2638702b8ad451a3cc6f3f29eae.tar.xz clzip-9e42ac600685c2638702b8ad451a3cc6f3f29eae.zip | |
Merging upstream version 1.5~rc1.
Signed-off-by: Daniel Baumann <mail@daniel-baumann.ch>
Diffstat (limited to 'README')
| -rw-r--r-- | README | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -6,10 +6,6 @@ compresses more than bzip2, which makes it well suited for software distribution and data archiving. Clzip is a clean implementation of the LZMA algorithm. -Clzip uses the same well-defined exit status values used by lzip and -bzip2, which makes it safer when used in pipes or scripts than -compressors returning ambiguous warning values, like gzip. - Clzip uses the lzip file format; the files produced by clzip are fully compatible with lzip-1.4 or newer, and can be rescued with lziprecover. Clzip is in fact a C language version of lzip, intended for embedded @@ -34,6 +30,10 @@ lziprecover program. Lziprecover makes lzip files resistant to bit-flip recovery capabilities, including error-checked merging of damaged copies of a file. +Clzip uses the same well-defined exit status values used by lzip and +bzip2, which makes it safer when used in pipes or scripts than +compressors returning ambiguous warning values, like gzip. + Clzip replaces every file given in the command line with a compressed version of itself, with the name "original_name.lz". Each compressed file has the same modification date, permissions, and, when possible, @@ -59,7 +59,7 @@ multivolume compressed tar archives. Clzip 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. Clzip will automatically use the smallest possible dictionary size without exceeding the given limit. Keep in mind that the decompression @@ -78,7 +78,7 @@ The ideas embodied in clzip 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) 2010, 2011, 2012, 2013 Antonio Diaz Diaz. |