Expand description
A wonderful, fast, safe, generic radix trie implementation.
To get started, see the docs for Trie
below.
Modules§
- Iterators over key-value pairs, keys, values and child subtries.
Structs§
- A data-structure for storing a sequence of 4-bit values.
- Immutable view of a sub-tree a larger trie.
- Mutable view of a sub-tree of a larger trie.
- Data-structure for storing and querying string-like keys and associated values.
Traits§
- Common functionality available for tries and subtries.
- Trait for types which can be used to key a Radix Trie.
Type Aliases§
- Wrapper for subtrie lookup results.