summaryrefslogtreecommitdiffstats
path: root/doc/lzip.texi
diff options
context:
space:
mode:
Diffstat (limited to 'doc/lzip.texi')
-rw-r--r--doc/lzip.texi19
1 files changed, 12 insertions, 7 deletions
diff --git a/doc/lzip.texi b/doc/lzip.texi
index 3209e15..037dd6e 100644
--- a/doc/lzip.texi
+++ b/doc/lzip.texi
@@ -6,8 +6,8 @@
@finalout
@c %**end of header
-@set UPDATED 30 June 2014
-@set VERSION 1.16-rc1
+@set UPDATED 26 August 2014
+@set VERSION 1.16
@dircategory Data Compression
@direntry
@@ -47,8 +47,7 @@ This manual is for Lzip (version @value{VERSION}, @value{UPDATED}).
@end menu
@sp 1
-Copyright @copyright{} 2008, 2009, 2010, 2011, 2012, 2013, 2014
-Antonio Diaz Diaz.
+Copyright @copyright{} 2008-2014 Antonio Diaz Diaz.
This manual is free documentation: you have unlimited permission
to copy, distribute and modify it.
@@ -62,7 +61,7 @@ Lzip is a lossless data compressor with a user interface similar to the
one of gzip or bzip2. Lzip is about as fast as gzip, compresses most
files more than bzip2, and is better than both from a data recovery
perspective. Lzip is a clean implementation of the LZMA
-(Lempel-Ziv-Markov chain-Algorithm) algorithm.
+(Lempel-Ziv-Markov chain-Algorithm) "algorithm".
The lzip file format is designed for long-term data archiving, taking
into account both data integrity and decoder availability:
@@ -88,6 +87,11 @@ Additionally lzip is copylefted, which guarantees that it will remain
free forever.
@end itemize
+A nice feature of the lzip format is that a corrupt byte is easier to
+repair the nearer it is from the beginning of the file. Therefore, with
+the help of lziprecover, losing an entire archive just because of a
+corrupt byte near the beginning is a thing of the past.
+
The member trailer stores the 32-bit CRC of the original data, the size
of the original data and the size of the member. These values, together
with the value remaining in the range decoder and the end-of-stream
@@ -101,7 +105,8 @@ wrong. It can't help you recover the original uncompressed data.
Lzip uses the same well-defined exit status values used by bzip2, which
makes it safer than compressors returning ambiguous warning values (like
-gzip) when it is used as a back end for tar or zutils.
+gzip) when it is used as a back end for other programs like tar or
+zutils.
The amount of memory required for compression is about 1 or 2 times the
dictionary size limit (1 if input file size is less than dictionary size
@@ -1069,7 +1074,7 @@ public:
pos( 0 ),
stream_pos( 0 ),
crc_( 0xFFFFFFFFU )
- { buffer[dictionary_size-1] = 0; } // prev_byte of first_byte
+ { buffer[dictionary_size-1] = 0; } // prev_byte of first byte
~LZ_decoder() { delete[] buffer; }