|
libdict 1.0.7
Data Structure C Library
|
Files | |
| dict.h | |
| hashtable.h | |
| Hash table with separate chaining; each chain is kept sorted by hash value. | |
| hashtable2.h | |
| Hash table with open addressing and linear probing. | |
| hb_tree.h | |
| Height-balanced (AVL) tree. | |
| pr_tree.h | |
| Path-reduction tree [Gonnet 1983]. | |
| rb_tree.h | |
| Red-black tree. | |
| skiplist.h | |
| Skip list [Pugh 1990]. | |
| sp_tree.h | |
| Splay tree. | |
| tr_tree.h | |
| Treap: a binary search tree on the keys that is at the same time a max-heap on per-node priorities. | |
| wb_tree.h | |
| Weight-balanced tree, BB[alpha] with alpha = 1 - sqrt(2)/2. | |