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
..
bcache_t.c	bcache: knock out err param.	2018-05-10 13:26:08 +01:00
bcache_utils_t.c	bcache: Add sync io engine	2018-05-10 14:29:26 +01:00
bitset_t.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
config_t.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
dmlist_t.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
dmstatus_t.c	vdo status: Unit tests + fix bugs	2018-05-10 13:01:26 +01:00
framework.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
framework.h	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
io_engine_t.c	bcache: rewrite bcache_{write,zero}_bytes	2018-05-01 12:07:33 +01:00
Makefile.in	radix-tree: First drop of radix tree.	2018-05-11 06:10:01 +01:00
matcher_data.h	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
matcher_t.c	unit-test/matcher_t: Fixup Kabi's test	2018-05-02 13:53:43 +01:00
percent_t.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
radix_tree_t.c	radix-tree: First drop of radix tree.	2018-05-11 06:10:01 +01:00
run.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
string_t.c	unit-tests: Move to test/unit	2018-04-27 16:55:07 +01:00
units.h	radix-tree: First drop of radix tree.	2018-05-11 06:10:01 +01:00
vdo_t.c	functional-tests/vdo: fix mem leak in test	2018-05-10 14:31:16 +01:00