4 stable releases

1.0.4 Oct 21, 2024
1.0.3 Aug 15, 2024
1.0.2 Jul 22, 2024
1.0.1 Jul 21, 2024

#1928 in Data structures

Download history 50/week @ 2024-07-27 85/week @ 2024-08-10 16/week @ 2024-08-17 6/week @ 2024-09-14 3/week @ 2024-09-21 1/week @ 2024-09-28 161/week @ 2024-10-19 13/week @ 2024-10-26 12/week @ 2024-11-02 1/week @ 2024-11-09

187 downloads per month

MIT license

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());

No runtime deps