58 Commits

Author	SHA1	Message	Date
Joe Thornber	1924426ad1	radix-tree: radix_tree_iterate()	2018-05-29 17:58:58 +01:00
Joe Thornber	c2a8bbed3b	radix-tree: radix_tree_remove_prefix()	2018-05-29 13:25:59 +01:00
Joe Thornber	9b41efae82	radix-tree: call the value dtr when removing an entry.	2018-05-29 11:23:36 +01:00
Joe Thornber	0181c77e3f	Merge branch '2018-05-29-radix-tree-iterate' into 2018-05-23-radix-tree-remove	2018-05-29 11:04:32 +01:00
Joe Thornber	033df741e2	data-struct/radix-tree: pass the value dtr into create. ... Rather than having to pass it into every method that removes items.	2018-05-29 11:03:10 +01:00
Joe Thornber	b7fd8ac8eb	radix_tree: add remove method	2018-05-23 12:48:06 +01:00
Joe Thornber	30a4c7988e	radix-tree: remove some unneccessary includes	2018-05-11 09:46:34 +01:00
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