| 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. |
| 6 |
|
| 7 |
It's written in ISO-C with no external dependencies other than what |
| 8 |
C provides and can easily be #include'd into your code, no makefile |
| 9 |
changes or library builds requires. |
| 10 |
|
| 11 |
A C♯ implementation without external dependencies is available, too. |
| 12 |
|
| 13 |
I do not know for certain whether any patents in any countries apply |
| 14 |
to this algorithm, but at the moment it is believed that it is free |
| 15 |
from any patents. More importantly, it is also free to use in every |
| 16 |
software package (see LICENSE). |
| 17 |
|
| 18 |
See the lzf.h file for details on how the functions in this |
| 19 |
mini-library are to be used. |
| 20 |
|
| 21 |
NOTE: This package contains a very bare-bones command-line utility |
| 22 |
which is neither optimized for speed nor for compression. This library |
| 23 |
is really intended to be used inside larger programs. |
| 24 |
|
| 25 |
AUTHOR |
| 26 |
This library was written by Marc Lehmann <schmorp@schmorp.de> (See also |
| 27 |
http://software.schmorp.de/pkg/liblzf). |
| 28 |
|
| 29 |
|
