https://github.com/amadvance/tommyds

A C library of hashtables and tries designed to store objects with high performance
https://github.com/amadvance/tommyds

Last synced: about 2 months ago
JSON representation

A C library of hashtables and tries designed to store objects with high performance

• Host: GitHub
• URL: https://github.com/amadvance/tommyds
• Owner: amadvance
• License: bsd-2-clause
• Created: 2014-03-18T22:38:20.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2023-03-08T20:42:58.000Z (over 1 year ago)
• Last Synced: 2024-06-11T06:32:16.643Z (3 months ago)
• Language: C++
• Homepage: http://www.tommyds.it/
• Size: 3.5 MB
• Stars: 225
• Watchers: 29
• Forks: 33
• Open Issues: 6
• Metadata Files:
  • Readme: README
  • Changelog: HISTORY
  • License: LICENSE

Awesome Lists containing this project

README

        
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