3 stable releases
1.0.3 | Aug 15, 2024 |
---|---|
1.0.2 | Jul 22, 2024 |
1.0.1 | Jul 21, 2024 |
#1249 in Data structures
101 downloads per month
18KB
427 lines
Dynamic Trie
Dynamic trie is trie that allows mapping of any T to any string with complexity based on hash map complexity.
let mut trie = Trie::new();
let keyword = Key::new("Keyword").unwrap();
trie.insert(0usize, &keyword);
let key = Key::new("Key").unwrap();
trie.insert(0usize, &key);
assert!(trie.delete(&key).is_ok());
assert!(trie.member(&key).is_none());