TommyDS is a C library of hashtables and tries designed to store and find objects with high performance.

It's faster than all the similar libraries like rbtree, judy, googlebtree, stxbtree, khash, uthash, nedtrie, judyarray, concurrencykit, and others. Only googledensehash is a real competitor for TommyDS. See the benchmarks for some nice graphs.

The data structures provided are:

The most interesting are tommy_array, tommy_hashlin, tommy_trie and tommy_trie_inplace.

All the data structure are tested with a code coverage of 100%.

If you need support go to the Forum.

TommyDS has also a SourceForge and a GitHub page.

2018/02 News! Version 2.2 RELEASED! Download it here