summaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authorJoe Thornber <ejt@redhat.com>2018-05-11 06:10:01 +0100
committerJoe Thornber <ejt@redhat.com>2018-05-11 06:10:01 +0100
commit576dd1fc41259a9ed3d95b2385305fc035058618 (patch)
treee549d2b60ac5482d7adf76a5b355eaca8cbd91b8 /doc
parent3b02b35c3eef04ddc62302328323d7874f6b9daa (diff)
downloadlvm2-576dd1fc41259a9ed3d95b2385305fc035058618.tar.gz
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.
Diffstat (limited to 'doc')
0 files changed, 0 insertions, 0 deletions