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
..
api	test: D-Bus test_nesting requires filter	2017-11-09 11:57:59 +01:00
dbus	test: D-Bus test_nesting requires filter	2017-11-09 11:57:59 +01:00
lib	functional tests: Update have_raid function	2018-05-03 14:22:24 +01:00
shell	tests: bump raid target version in reshape tests	2018-05-04 16:58:11 +02:00
unit	radix-tree: First drop of radix tree.	2018-05-11 06:10:01 +01:00
.gitignore	test: add results/ to .gitignore	2016-12-10 18:00:25 +00:00
Makefile.in	build: remove --with-{snapshots,mirrors,raid,thin,cache} options from ./configure	2018-04-30 10:11:23 +01:00