The Adaptive Radix Tree

The radix tree based on The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases paper.

``` use arttree::ByteString; use arttree::Art;

let mut art = Art::::new(); for i in 0..u8::MAX as u16 { assert!(art.insert(ByteString::from(i), i), "{}", i); assert!(matches!(art.get(&ByteString::from(i)), Some(val) if val == &i)); }

for i in 0..u8::MAX as u16 { art.upsert(ByteString::from(i), i + 1); assert!(matches!(art.get(&ByteString::from(i)), Some(val) if val == &(i + 1))); }

asserteq!(art.range(ByteString::from(0u16)..=ByteString::from(140u16)).count(), 141); asserteq!(art.iter().count(), u8::MAX as usize);

for i in 0..u8::MAX as u16 { assert!(matches!(art.remove(&ByteString::from(i)), Some(val) if val == i + 1)); } ```