blob: 5a64b342b8b0681c3ca92f608aa92a2f199b956a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
<sect2><title> </title><para> </para></sect2>
<sect2><title>Descriptions</title>
<para>(Last checked against version &bzip2-contversion;.)</para>
<sect3><title>Program file 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 (such as the traditional <userinput>gzip</userinput> utility)
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 file descriptions</title>
<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>
|
