summaryrefslogtreecommitdiff
path: root/README
diff options
context:
space:
mode:
authorroot <root>2005-04-14 20:38:50 +0000
committerroot <root>2005-04-14 20:38:50 +0000
commit53bcbc038f83643efad0e22dab173c064127cd48 (patch)
tree12f014d36ddec75710a9ce247ec2408f3f001f23 /README
parent52d0d80a5d826b0f53ea4c00d2577ea2e4baba8f (diff)
*** empty log message ***rel-1_51
Diffstat (limited to 'README')
-rw-r--r--README9
1 files changed, 7 insertions, 2 deletions
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