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§
- Trie
- Trie implementation allowing for mapping any
T
to anyimpl Iterator<Item = char>
type.
Enums§
- AcqMut
Res - Acquisition result enumeration.
- AcqRes
- Acquisition result enumeration.
- InsRes
- Insertion result enumeration.
- KeyErr
- Key error enumeration.
- RemRes
- Removal result enumeration.