Expand description
Trie node representation and manipulation
Modules§
- iterator 🔒
- operations 🔒
- Trie node lookup and manipulation
- representation 🔒
- Trie node representation
- visitor
- Utilities for inspecting the trie structure.
Structs§
- Attempt
Optimistic Prefix Match - This struct represents a successful match against a prefix using the
InnerNodeCommon::attempt_pessimistic_match_prefixfunction. - Explicit
Mismatch - Represents a prefix mismatch when looking at the entire prefix, including in cases where it is read from a child leaf node.
- Header
- The common header for all inner nodes
- Inner
Node Direct - Inner node that stores up to 256 children, where lookup is performed by indexing with key byte.
- Inner
Node Indirect - Inner node type that uses a direct lookup for the key byte and uses the resulting value to lookup the child pointer.
- Inner
Node Sorted - Node type that has a compact representation for key bytes and children pointers.
- Leaf
Node - Node that contains a single leaf value.
- Node
Indirect Iter - This struct is an iterator over the children of a
InnerNodeIndirect. - NodePtr
- A pointer to a
Node. - Opaque
Node Ptr - An opaque pointer to a
Node. - Optimistic
Mismatch - Represents a prefix mismatch when looking only at the prefix content present
in an
InnerNodeheader. - Pessimistic
Mismatch - Represents a prefix mismatch when looking only at the prefix content present
in an
InnerNodeheader. - Prefix
Match - This struct represents a successful match against a prefix using either the
InnerNodeCommon::optimistic_match_prefixorInnerNodeCommon::match_full_prefixfunctions. - Tree
Path Search - This type is used to track the parent and grandparent when searching down the tree.
Enums§
- Concrete
Inner Node Ptr - An enum that encapsulates pointers to every type of
InnerNode - Concrete
Node Ptr - An enum that encapsulates pointers to every type of
Node - Node
Type - The representation of inner nodes
- Tree
Path - This enum represents different kinds of tree paths pointing to a leaf node.
Traits§
- Inner
Node - Common methods implemented by all inner nodes that will be used in the tree.
- Inner
Node Common - This trait contains all the functions/types that every inner node must implement.
- Node
- All nodes which contain a runtime tag that validates their type.
Type Aliases§
- Inner
Node4 - Node that references between 2 and 4 children
- Inner
Node16 - Node that references between 5 and 16 children
- Inner
Node48 - Node that references between 17 and 49 children.
- Inner
Node Sorted Iter - Iterator type for an
InnerNodeSorted - Node
Prefix - This type represents the contents of an
InnerNodeprefix, either read directly from the prefix or fetched from a leaf node descendant.