lr_trie
| Crates.io | lr_trie |
| lib.rs | lr_trie |
| version | 1.4.3 |
| source | src |
| created_at | 2024-07-21 21:49:37.211681 |
| updated_at | 2024-10-21 19:49:21.630436 |
| description | Left-Right trie is trie capable of mapping any string to any string. |
| homepage | https://github.com/bravequickcleverfibreyarn/tries/tree/main/lr_trie |
| repository | https://github.com/bravequickcleverfibreyarn/tries/tree/main/lr_trie |
| max_upload_size | |
| id | 1310602 |
| size | 39,270 |
boldswiftsmartfiberhank (bravequickcleverfibreyarn)
documentation
https://docs.rs/lr_trie/latest/lr_trie/index.html
README
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());