248N/A LZF is an extremely fast (not that much slower than a pure memcpy)
248N/A compression algorithm. It is ideal for applications where you want to
248N/A save *some* space but not at the cost of speed. It is ideal for
248N/A repetitive data as well. The module is self-contained and very small.
248N/A It's written in ISO-C with no external dependencies other than what
248N/A C provides and can easily be #include'd into your code, no makefile
248N/A changes or library builds requires.
248N/A A C♯ implementation without external dependencies is available, too.
248N/A I do not know for certain wether any patents in any countries apply
248N/A to this algorithm, but at the moment it is believed that it is free
248N/A from any patents. More importantly, it is also free to use in every
248N/A software package (see LICENSE).
248N/A See the
lzf.h file for details on how the functions in this
248N/A mini-library are to be used.
248N/A NOTE: This package contains a very bare-bones command-line utility
248N/A which is neither optimized for speed nor for compression. This library
690N/A is really intented to be used inside larger programs.
814N/A This library was written by Marc Lehmann <schmorp@schmorp.de> (See also