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

plain_trie

Basic Trie is trie capable of mapping any T to string composed of English alphabet letters

5 stable releases

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

#1708 in Data structures

Download history 240/week @ 2024-07-18 56/week @ 2024-07-25 182/week @ 2024-08-15

182 downloads per month

MIT license

21KB
529 lines

Plain Trie

Plain trie is basic trie that allows mapping of any T to string composed of English alphabet letters.

let key = Key::new("touchstone").unwrap();

let mut trie = Trie::new();
trie.insert(3usize, &key);

assert!(trie.member(&key).is_some());

No runtime deps