9 stable releases
1.4.2 | Aug 18, 2024 |
---|---|
1.4.1 | Aug 15, 2024 |
1.3.0 | Jul 28, 2024 |
#705 in Data structures
444 downloads per month
39KB
916 lines
Left-Right Trie
Left-Right trie is trie that allows mapping of any string to any string with complexity based on alphabet used size.
let mut trie = LrTrie::new();
let one = KeyEntry::new("emoción").unwrap();
let another = KeyEntry::new("emotion").unwrap();
trie.insert(&one, &another);
assert!(trie.member(&one, LeftRight::Left).is_some());
assert!(trie.member(&another, LeftRight::Left).is_none());
lib.rs
:
To reduce memory demands of LrTrie
, operations are not particularly optimal.
If alphabet used became wide enough, some rework using e.g. hashmap would be needed.