Adding upstream version 0.5.
Signed-off-by: Daniel Baumann <daniel@debian.org>
This commit is contained in:
parent
393d6b555b
commit
94544fa4c2
12 changed files with 587 additions and 225 deletions
|
@ -1,5 +1,5 @@
|
|||
.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.36.
|
||||
.TH PLZIP "1" "January 2010" "Plzip 0.4" "User Commands"
|
||||
.TH PLZIP "1" "February 2010" "Plzip 0.5" "User Commands"
|
||||
.SH NAME
|
||||
Plzip \- data compressor based on the LZMA algorithm
|
||||
.SH SYNOPSIS
|
||||
|
|
|
@ -12,7 +12,7 @@ File: plzip.info, Node: Top, Next: Introduction, Up: (dir)
|
|||
Plzip Manual
|
||||
************
|
||||
|
||||
This manual is for Plzip (version 0.4, 31 January 2010).
|
||||
This manual is for Plzip (version 0.5, 10 February 2010).
|
||||
|
||||
* Menu:
|
||||
|
||||
|
@ -34,19 +34,16 @@ File: plzip.info, Node: Introduction, Next: Invoking Plzip, Prev: Top, Up: T
|
|||
1 Introduction
|
||||
**************
|
||||
|
||||
Plzip is a massively parallel (multithreaded) data compressor compatible
|
||||
with the lzip file format. The files produced by plzip are fully
|
||||
compatible with lzip-1.4 or newer. Plzip is intended for faster
|
||||
compression/decompression of big files on multiprocessor machines. On
|
||||
files big enough, plzip can use hundreds of processors. Currently only
|
||||
compression is performed in parallel. Parallel decompression is planned
|
||||
to be implemented later.
|
||||
Plzip is a massively parallel (multi-threaded), lossless data compressor
|
||||
based on the LZMA algorithm, with very safe integrity checking and a
|
||||
user interface similar to the one of gzip or bzip2. Plzip uses the lzip
|
||||
file format; the files produced by plzip are fully compatible with
|
||||
lzip-1.4 or newer.
|
||||
|
||||
Lzip is a lossless data compressor based on the LZMA algorithm, with
|
||||
very safe integrity checking and a user interface similar to the one of
|
||||
gzip or bzip2. Lzip decompresses almost as fast as gzip and compresses
|
||||
better than bzip2, which makes it well suited for software distribution
|
||||
and data archiving.
|
||||
Plzip is intended for faster compression/decompression of big files
|
||||
on multiprocessor machines, which makes it specially well suited for
|
||||
distribution of big software files and large scale data archiving. On
|
||||
files big enough, plzip can use hundreds of processors.
|
||||
|
||||
Plzip replaces every file given in the command line with a compressed
|
||||
version of itself, with the name "original_name.lz". Each compressed
|
||||
|
@ -112,9 +109,9 @@ The format for running plzip is:
|
|||
`-B'
|
||||
Set the input data block size in bytes. The input file will be
|
||||
divided in chunks of this size before compression is performed.
|
||||
Valid values range from 100kB to 1GiB. Default value is two times
|
||||
the dictionary size. It is a waste of memory to choose a data size
|
||||
smaller than the dictionary size.
|
||||
Valid values range from 8KiB to 1GiB. Default value is two times
|
||||
the dictionary size. It is a waste of memory to choose a data
|
||||
size smaller than the dictionary size.
|
||||
|
||||
`--stdout'
|
||||
`-c'
|
||||
|
@ -306,10 +303,10 @@ Concept Index
|
|||
|
||||
Tag Table:
|
||||
Node: Top223
|
||||
Node: Introduction746
|
||||
Node: Invoking Plzip3669
|
||||
Node: File Format7358
|
||||
Node: Problems9314
|
||||
Node: Concept Index9843
|
||||
Node: Introduction747
|
||||
Node: Invoking Plzip3489
|
||||
Node: File Format7178
|
||||
Node: Problems9134
|
||||
Node: Concept Index9663
|
||||
|
||||
End Tag Table
|
||||
|
|
|
@ -5,8 +5,8 @@
|
|||
@finalout
|
||||
@c %**end of header
|
||||
|
||||
@set UPDATED 31 January 2010
|
||||
@set VERSION 0.4
|
||||
@set UPDATED 10 February 2010
|
||||
@set VERSION 0.5
|
||||
|
||||
@dircategory Data Compression
|
||||
@direntry
|
||||
|
@ -50,19 +50,16 @@ to copy, distribute and modify it.
|
|||
@chapter Introduction
|
||||
@cindex introduction
|
||||
|
||||
Plzip is a massively parallel (multithreaded) data compressor compatible
|
||||
with the lzip file format. The files produced by plzip are fully
|
||||
compatible with lzip-1.4 or newer. Plzip is intended for faster
|
||||
compression/decompression of big files on multiprocessor machines. On
|
||||
files big enough, plzip can use hundreds of processors. Currently only
|
||||
compression is performed in parallel. Parallel decompression is planned
|
||||
to be implemented later.
|
||||
Plzip is a massively parallel (multi-threaded), lossless data compressor
|
||||
based on the LZMA algorithm, with very safe integrity checking and a
|
||||
user interface similar to the one of gzip or bzip2. Plzip uses the lzip
|
||||
file format; the files produced by plzip are fully compatible with
|
||||
lzip-1.4 or newer.
|
||||
|
||||
Lzip is a lossless data compressor based on the LZMA algorithm, with
|
||||
very safe integrity checking and a user interface similar to the one of
|
||||
gzip or bzip2. Lzip decompresses almost as fast as gzip and compresses
|
||||
better than bzip2, which makes it well suited for software distribution
|
||||
and data archiving.
|
||||
Plzip is intended for faster compression/decompression of big files on
|
||||
multiprocessor machines, which makes it specially well suited for
|
||||
distribution of big software files and large scale data archiving. On
|
||||
files big enough, plzip can use hundreds of processors.
|
||||
|
||||
Plzip replaces every file given in the command line with a compressed
|
||||
version of itself, with the name "original_name.lz". Each compressed
|
||||
|
@ -135,8 +132,8 @@ Print the version number of plzip on the standard output and exit.
|
|||
@itemx -B
|
||||
Set the input data block size in bytes. The input file will be divided
|
||||
in chunks of this size before compression is performed. Valid values
|
||||
range from 100kB to 1GiB. Default value is two times the dictionary
|
||||
size. It is a waste of memory to choose a data size smaller than the
|
||||
range from 8KiB to 1GiB. Default value is two times the dictionary size.
|
||||
It is a waste of memory to choose a data size smaller than the
|
||||
dictionary size.
|
||||
|
||||
@item --stdout
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue