#trie #prefix-tree #digital-tree #retrieval-tree

dyn_trie

Dynamic trie is trie capable of mapping any T to any string

5 stable releases

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

#1755 in Data structures

Download history 6/week @ 2024-09-15 3/week @ 2024-09-22 1/week @ 2024-09-29 167/week @ 2024-10-20 8/week @ 2024-10-27 11/week @ 2024-11-03 1/week @ 2024-11-10 1/week @ 2024-11-17 3/week @ 2024-12-08 117/week @ 2024-12-15

120 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