summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--README8
-rw-r--r--lzf.h2
2 files changed, 5 insertions, 5 deletions
diff --git a/README b/README
index dd55f72..5dc8721 100644
--- a/README
+++ b/README
@@ -5,10 +5,10 @@ DESCRIPTION
repetitive data as well. The module is self-contained and very small (no
large library to be pulled in).
- I have no idea wether any patents in any countries apply to this
- algorithm, but at the moment it is believed that it is free from any
- patents. More importantly, it is also free to use in every software
- package (see COPYING).
+ 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
+ from any patents. More importantly, it is also free to use in every
+ software package (see LICENSE).
See the lzf.h file for details on how the functions in this
mini-library are to be used.
diff --git a/lzf.h b/lzf.h
index a8de179..36b5760 100644
--- a/lzf.h
+++ b/lzf.h
@@ -66,7 +66,7 @@ lzf_compress (const void *const in_data, unsigned int in_len,
* function and stored at location in_data and length in_len. The result
* will be stored at out_data up to a maximum of out_len characters.
*
- * If * the output buffer is not large enough to hold the decompressed
+ * If the output buffer is not large enough to hold the decompressed
* data, a 0 is returned and errno is set to E2BIG. Otherwise the number
* of decompressed bytes (i.e. the original length of the data) is
* returned.