From 53bcbc038f83643efad0e22dab173c064127cd48 Mon Sep 17 00:00:00 2001 From: root Date: Thu, 14 Apr 2005 20:38:50 +0000 Subject: *** empty log message *** --- README | 9 +++++++-- 1 file changed, 7 insertions(+), 2 deletions(-) (limited to 'README') diff --git a/README b/README index 1b8cee9..35cd059 100644 --- a/README +++ b/README @@ -2,8 +2,13 @@ DESCRIPTION LZF is an extremely fast (not that much slower than a pure memcpy) compression algorithm. It is ideal for applications where you want to save *some* space but not at the cost of speed. It is ideal for - repetitive data as well. The module is self-contained and very small (no - large library to be pulled in). + repetitive data as well. The module is self-contained and very small. + + It's written in ISO-C with no external dependencies other than what + C provides and can easily be #include'd into your code, no makefile + changes or library builds requires. + + A C♯ implementation without external dependencies is available, too. I do not know for certain wether any patents in any countries apply to this algorithm, but at the moment it is believed that it is free -- cgit v1.2.3