Joe Thornber 576dd1fc41 radix-tree: First drop of radix tree. ... An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.		2018-05-11 06:10:01 +01:00
..
data-struct	radix-tree: First drop of radix tree.	2018-05-11 06:10:01 +01:00
memory	radix-tree: First drop of radix tree.	2018-05-11 06:10:01 +01:00