Crate dyn_trie

Dynamic trie in contrast to classic trie does not have fixed size alphabet associated with node.

Each node has dynamic alphabet of size as to satisfy exactly associated branches.

Structs

Trie

Retrieval tree implementation allowing for mapping any T to any impl Iterator<Item = char> type.

Enums

AcqMutRes

Acquisition result enumeration.

AcqRes

Acquisition result enumeration.

InsRes

Insertion result enumeration.

KeyErr

Key error enumeration.

RemRes

Removal result enumeration.