Expand description
Extendable classic retrieval tree implementation with fixed size alphabet per node.
Maps any T using any impl Iterator<Item = char> type.
Modules§
- english_
letters - Module for working with English alphabet small letters, a-z.
Structs§
- Letter
LetterisAlphabetelement, represents tree node.- Trie
- Trie implementation allowing for mapping any
Tto anyimpl Iterator<Item = char>type.
Enums§
- KeyErr
- Key error enumeration.
Traits§
- InsRes
Aide - Auxiliary trait for working with
InsRes. - InsRes
Aide Ex - Extension trait to
InsResAidetrait.