| 1 | DESCRIPTION |
1 | DESCRIPTION |
| 2 | LZF is an extremely fast (not that much slower than a pure memcpy) |
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 |
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 |
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 |
5 | repetitive data as well. The module is self-contained and very small. |
| 6 | large library to be pulled in). |
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. |
| 7 | |
12 | |
| 8 | I do not know for certain wether any patents in any countries apply |
13 | 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 |
14 | 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 |
15 | from any patents. More importantly, it is also free to use in every |
| 11 | software package (see LICENSE). |
16 | software package (see LICENSE). |
