another_radix_trie
Rust built radix tree with sorted vec
Example
Construct
use RadixTrie;
let mut trie = new;
Insert
trie.insert;
Find
trie.find;
// returns Some(&"value")
Find_mut
trie.find_mut;
// returns Some(&mut "value")
Remove
trie.remove;
// returns Some("value")
Start with
trie.insert;
trie.insert;
trie.starts_with;
// returns vec![("lab", &"laboratory"), ("label", &"label")]