osl.c: Fix assertion in create_table_index().

[osl.git] / README

diff --git a/README b/README
index 19c61e11911f291fbc82c714c8015b34427f985c..c8cfff0824f9e76322601ee1fda525ae244a206d 100644 (file)
--- a/README
+++ b/README
@@ -12,15 +12,18 @@ Libosl is simple:
        - There is no fancy query language but only a relatively
        simple C-API.
 
        - There is no fancy query language but only a relatively
        simple C-API.
 

-       - There's no support for network-access and libosl does not
-       use any table locking.
+       - There's no network support for network-access and libosl
+       only uses a very rudimentary table locking mechanism.
+
+       - There are no dependencies on external libraries. An augmented
+       version of the red-black tree implementation of the linux
+       kernel is in included in the libosl package.

 
 Libosl is fast:
 
        - It uses sha1 hashes for content-based addressing.
 
 
 Libosl is fast:
 
        - It uses sha1 hashes for content-based addressing.
 

-        - An augmented version of the rbtree implementation of the
-        linux kernel is used for lookups.
+       - Red-black trees are used to make lookups fast.

 
 Libosl is portable:
 
 
 Libosl is portable:
 


@@ -31,7 +34,7 @@ Libosl is portable:
 
 Libosl is open source:
 
 
 Libosl is open source:
 

-       - Licensed under the GLP, version 2.
+       - Licensed under the GPL, version 2.

 
 Apart from the library itself, the package also contains simple
 examples and an fsck program, oslfsck, which can be used to recover
 
 Apart from the library itself, the package also contains simple
 examples and an fsck program, oslfsck, which can be used to recover