Module raw

Module raw 

Source
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§

AttemptOptimisticPrefixMatch
This struct represents a successful match against a prefix using the InnerNodeCommon::attempt_pessimistic_match_prefix function.
ExplicitMismatch
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
InnerNodeDirect
Inner node that stores up to 256 children, where lookup is performed by indexing with key byte.
InnerNodeIndirect
Inner node type that uses a direct lookup for the key byte and uses the resulting value to lookup the child pointer.
InnerNodeSorted
Node type that has a compact representation for key bytes and children pointers.
LeafNode
Node that contains a single leaf value.
NodeIndirectIter
This struct is an iterator over the children of a InnerNodeIndirect.
NodePtr
A pointer to a Node.
OpaqueNodePtr
An opaque pointer to a Node.
OptimisticMismatch
Represents a prefix mismatch when looking only at the prefix content present in an InnerNode header.
PessimisticMismatch
Represents a prefix mismatch when looking only at the prefix content present in an InnerNode header.
PrefixMatch
This struct represents a successful match against a prefix using either the InnerNodeCommon::optimistic_match_prefix or InnerNodeCommon::match_full_prefix functions.
TreePathSearch
This type is used to track the parent and grandparent when searching down the tree.

Enums§

ConcreteInnerNodePtr
An enum that encapsulates pointers to every type of InnerNode
ConcreteNodePtr
An enum that encapsulates pointers to every type of Node
NodeType
The representation of inner nodes
TreePath
This enum represents different kinds of tree paths pointing to a leaf node.

Traits§

InnerNode
Common methods implemented by all inner nodes that will be used in the tree.
InnerNodeCommon
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§

InnerNode4
Node that references between 2 and 4 children
InnerNode16
Node that references between 5 and 16 children
InnerNode48
Node that references between 17 and 49 children.
InnerNodeSortedIter
Iterator type for an InnerNodeSorted
NodePrefix
This type represents the contents of an InnerNode prefix, either read directly from the prefix or fetched from a leaf node descendant.