Crate lr_trie 

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

KeyEntry

&str verified for working with LrTrie.

LrTrie

Left-right trie is double-treed trie.

Enums

Buffer

Denotes desired buffer on respective operations.

LeftRight

Denotes desired target tree on respective operations.

Type Aliases

Entry

KeyEntry playing entry role.

Key

KeyEntry playing key role.