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