diff options
Diffstat (limited to '')
| -rw-r--r-- | doc/lzlib.texi | 32 |
1 files changed, 18 insertions, 14 deletions
diff --git a/doc/lzlib.texi b/doc/lzlib.texi index 228d747..4c0f370 100644 --- a/doc/lzlib.texi +++ b/doc/lzlib.texi @@ -6,8 +6,8 @@ @finalout @c %**end of header -@set UPDATED 23 May 2015 -@set VERSION 1.7-rc1 +@set UPDATED 8 July 2015 +@set VERSION 1.7 @dircategory Data Compression @direntry @@ -35,9 +35,9 @@ This manual is for Lzlib (version @value{VERSION}, @value{UPDATED}). @menu -* Introduction:: Purpose and features of Lzlib +* Introduction:: Purpose and features of lzlib * Library version:: Checking library version -* Buffering:: Sizes of Lzlib's buffers +* Buffering:: Sizes of lzlib's buffers * Parameter limits:: Min / max values for some parameters * Compression functions:: Descriptions of the compression functions * Decompression functions:: Descriptions of the decompression functions @@ -72,10 +72,14 @@ availability: @itemize @bullet @item The lzip format provides very safe integrity checking and some data -recovery means. The lziprecover program can repair bit-flip errors (one -of the most common forms of data corruption) in lzip files, and provides -data recovery capabilities, including error-checked merging of damaged -copies of a file. +recovery means. The +@uref{http://www.nongnu.org/lzip/manual/lziprecover_manual.html#Data-safety,,lziprecover} +program can repair bit-flip errors (one of the most common forms of data +corruption) in lzip files, and provides data recovery capabilities, +including error-checked merging of damaged copies of a file. +@ifnothtml +@ref{Data safety,,,lziprecover}. +@end ifnothtml @item The lzip format is as simple as possible (but not simpler). The lzip @@ -128,7 +132,7 @@ 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 +scheme". For example, the option @samp{-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. Inversely, a much more elaborated way of finding coding sequences of minimum size than the one currently @@ -136,7 +140,7 @@ 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 option -0 of minilzip) and normal (used by all other +(used by option @samp{-0} of minilzip) and normal (used by all other compression levels). The high compression of LZMA comes from combining two basic, well-proven @@ -274,8 +278,8 @@ ratios but longer compression times. If @var{dictionary_size} is 65535 and @var{match_len_limit} is 16, the fast variant of LZMA is chosen, which produces identical compressed -output as @code{lzip -0}. (The @var{dictionary_size} used will be -rounded upwards to 64 KiB). +output as @code{lzip -0}. (The dictionary size used will be rounded +upwards to 64 KiB). @var{member_size} sets the member size limit in bytes. Minimum member size limit is 100 kB. Small member size may degrade compression ratio, so @@ -852,12 +856,12 @@ next member in case of data error. @cindex bugs @cindex getting help -There are probably bugs in Lzlib. There are certainly errors and +There are probably bugs in lzlib. There are certainly errors and omissions in this manual. If you report them, they will get fixed. If you don't, no one will ever know about them and they will remain unfixed for all eternity, if not longer. -If you find a bug in Lzlib, please send electronic mail to +If you find a bug in lzlib, please send electronic mail to @email{lzip-bug@@nongnu.org}. Include the version number, which you can find by running @w{@code{minilzip --version}} or in @samp{LZ_version_string} from @samp{lzlib.h}. |