libds
August 14th, 2005
Data Structures library. The one that just keep growing and growing … Currently implementations are in C, I’ve ported to C++/Objective-C/Ruby/Perl, hopefully get all of them there eventually. Documentation in doxygen.
Currently implemented:
- bitstring
- dequeue
- list
- queue
- ringbuf
- sequential-strage list (dynarray)
- stack
- heap
- priority queue
- avl tree
- binary search tree
- digital search tree
- splay tree
- treap
In progress:
- binary queue
- b tree
- b+ tree
- patricia tree
- red-black tree
- trie
- static hash
- dynamic hash table (single hasgin, double hashing ordered probing, chaining, quadratic, …)
- n-trix (n-ary matrix)
- tri-trix (n-ary triangular matrix)
(Not-there-yet)
Leave a Reply