| 1 |
root |
1.1 |
DESCRIPTION |
| 2 |
|
|
LZF is an extremely fast (not that much slower than a pure memcpy) |
| 3 |
|
|
compression algorithm. It is ideal for applications where you want to |
| 4 |
|
|
save *some* space but not at the cost of speed. It is ideal for |
| 5 |
|
|
repetitive data as well. The module is self-contained and very small (no |
| 6 |
|
|
large library to be pulled in). |
| 7 |
|
|
|
| 8 |
root |
1.2 |
I do not know for certain wether any patents in any countries apply |
| 9 |
|
|
to this algorithm, but at the moment it is believed that it is free |
| 10 |
|
|
from any patents. More importantly, it is also free to use in every |
| 11 |
|
|
software package (see LICENSE). |
| 12 |
root |
1.1 |
|
| 13 |
|
|
See the lzf.h file for details on how the functions in this |
| 14 |
|
|
mini-library are to be used. |
| 15 |
|
|
|
| 16 |
|
|
NOTE: This package contains a very bare-bones command-line utility |
| 17 |
|
|
which is neither optimized for speed nor for compression. This library |
| 18 |
|
|
is really intented to be used inside larger programs. |
| 19 |
|
|
|
| 20 |
|
|
AUTHOR |
| 21 |
|
|
This library was written by Marc Lehmann <pcg@goof.com> (See also |
| 22 |
|
|
http://liblzf.plan9.de/). |
| 23 |
|
|
|
| 24 |
|
|
|
