| … | |
… | |
| 23 | LZF is an extremely fast (not that much slower than a pure memcpy) |
23 | LZF is an extremely fast (not that much slower than a pure memcpy) |
| 24 | compression algorithm. It is ideal for applications where you want to save |
24 | compression algorithm. It is ideal for applications where you want to save |
| 25 | I<some> space but not at the cost of speed. It is ideal for repetitive |
25 | I<some> space but not at the cost of speed. It is ideal for repetitive |
| 26 | data as well. The module is self-contained and very small (no large |
26 | data as well. The module is self-contained and very small (no large |
| 27 | library to be pulled in). It is also free, so there should be no problems |
27 | library to be pulled in). It is also free, so there should be no problems |
| 28 | incoporating this module into commercial programs. |
28 | incorporating this module into commercial programs. |
| 29 | |
29 | |
| 30 | I have no idea wether any patents in any countries apply to this |
30 | I have no idea wether any patents in any countries apply to this |
| 31 | algorithm, but at the moment it is believed that it is free from any |
31 | algorithm, but at the moment it is believed that it is free from any |
| 32 | patents. |
32 | patents. |
| 33 | |
33 | |
