lfs-book/appendixa/bzip2-desc.xml

<sect2><title>Contents of Bzip2</title>

<para>Last checked against version &bzip2-contversion;</para>

<sect3><title>Program Files</title>
<para>bunzip2 (link to bzip2), bzcat (link to bzip2), bzcmp, bzdiff, bzegrep,
bzfgrep, bzgrep, bzip2, bzip2recover, bzless and bzmore</para></sect3>

<sect3><title>Descriptions</title>

<sect4><title>bunzip2</title>
<para>bunzip2 decompresses files that are compressed with
bzip2.</para></sect4>

<sect4><title>bzcat</title>
<para>bzcat (or bzip2 -dc) decompresses all specified files to the standard 
output.</para></sect4>

<sect4><title>bzcmp, bzdiff</title>
<para>bzcmp and bzdiff are used to invoke the cmp or the diff program on
bzip2 compressed files.</para></sect4>

<sect4><title>bzegrep, bzfgrep, bzgrep</title>
<para>bzegrep, bzfgrep, and bzgrep invoke either egrep, fgrep, or grep
(respectively) on bzip2-compressed files.</para></sect4>

<sect4><title>bzip2</title>
<para>bzip2 compresses files using the Burrows-Wheeler block sorting text 
compression algorithm and Huffman coding. Compression is generally 
considerably better than that achieved by more conventional LZ77/LZ78-based 
compressors and approaches the performance of the PPM family of statistical 
compressors.</para></sect4>

<sect4><title>bzip2recover</title>
<para>bzip2recover recovers data from damaged bzip2 files.</para></sect4>

<sect4><title>bzless</title>
<para>bzless is a filter which allows examination of compressed
or plain text files, one screenful at a time on a soft-copy
terminal, like less.</para></sect4>

<sect4><title>bzmore</title>
<para>bzmore is a filter which allows examination of compressed
or plain text files, one screenful at a time on a soft-copy
terminal, like more.</para></sect4>

</sect3>

<sect3><title>Library Files</title>
<para>libbz2.a, libbz2.so (link to libbz2.so.1.0), libbz2.so.1.0 (link to
libbz2.so.1.0.2) and libbz2.so.1.0.2</para>

<sect4><title>libbz2</title>
<para>libbz2 is the library for implementing lossless, block-sorting data
compression, using the Burrows-Wheeler algorithm.</para></sect4>

</sect3>

</sect2>