Expand description
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.
Structs§
&strverified for working withLrTrie.- Left-right trie is double-treed trie.
Enums§
- Denotes desired target tree on respective operations.
Type Aliases§
KeyEntryplaying entry role.KeyEntryplaying key role.