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.

Node

Tree node.

Enums

Buffer

Denotes desired buffer on respective operations.

LeftRight

Denotes desired target tree on respective operations.

Type Aliases

Branches

Tree node branches type.

Entry

KeyEntry playing entry role.

Key

KeyEntry playing key role.

LeftBranches

Branches of left tree root.

RightBranches

Branches of right tree root.