summaryrefslogtreecommitdiffstats
path: root/third-party/tommyds/README
diff options
context:
space:
mode:
Diffstat (limited to 'third-party/tommyds/README')
-rw-r--r--third-party/tommyds/README31
1 files changed, 31 insertions, 0 deletions
diff --git a/third-party/tommyds/README b/third-party/tommyds/README
new file mode 100644
index 0000000..c0fa3ec
--- /dev/null
+++ b/third-party/tommyds/README
@@ -0,0 +1,31 @@
+TommyDS
+=======
+
+TommyDS is a C library of array, hashtables and tries data structures,
+designed for high performance and providing an easy to use interface.
+
+It's faster than all the similar libraries like rbtree, judy, goodledensehash,
+khash, uthash, nedtries and others.
+
+The data structures provided are:
+
+ tommy_list - A double linked list.
+ tommy_array - A linear array. It doesn't fragment
+ the heap.
+ tommy_arrayblk - A blocked linear array. It doesn't fragment
+ the heap and it minimizes the space occupation.
+ tommy_hashtable - A fixed size chained hashtable.
+ tommy_hashdyn - A dynamic chained hashtable.
+ tommy_hashlin - A linear chained hashtable. It doesn't have the
+ problem of the delay when resizing and it doesn't
+ fragment the heap.
+ tommy_trie - A trie optimized for cache utilization.
+ tommy_trie_inplace - A trie completely inplace.
+
+The documentation is available in HTML format in the doc/index.html file,
+and directly in the .h files.
+
+The official site of TommyDS is:
+
+ http://www.tommyds.it
+