pub enum NodePlan {
Empty,
Leaf {
partial: NibbleSlicePlan,
value: ValuePlan,
},
Extension {
partial: NibbleSlicePlan,
child: NodeHandlePlan,
},
Branch {
value: Option<ValuePlan>,
children: [Option<NodeHandlePlan>; 16],
},
NibbledBranch {
partial: NibbleSlicePlan,
value: Option<ValuePlan>,
children: [Option<NodeHandlePlan>; 16],
},
}
Expand description
Various re-exports from the trie-db
crate.
A NodePlan
is a blueprint for decoding a node from a byte slice. The NodePlan
is created
by parsing an encoded node and can be reused multiple times. This is useful as a Node
borrows
from a byte slice and this struct does not.
The enum values mirror those of Node
except that instead of byte slices, this struct stores
ranges that can be used to index into a large byte slice.
Variants§
Empty
Null trie node; could be an empty root or an empty branch entry.
Leaf
Leaf node; has a partial key plan and value.
Extension
Extension node; has a partial key plan and child data.
Branch
Branch node; has slice of child nodes (each possibly null) and an optional immediate node data.
NibbledBranch
Branch node with support for a nibble (when extension nodes are not used).
Implementations§
source§impl NodePlan
impl NodePlan
sourcepub fn build<'a, 'b>(&'a self, data: &'b [u8]) -> Node<'b>
pub fn build<'a, 'b>(&'a self, data: &'b [u8]) -> Node<'b>
Build a node by decoding a byte slice according to the node plan. It is the responsibility of the caller to ensure that the node plan was created for the argument data, otherwise the call may decode incorrectly or panic.
sourcepub fn value_plan(&self) -> Option<&ValuePlan>
pub fn value_plan(&self) -> Option<&ValuePlan>
Access value plan from node plan, return None
for
node that cannot contain a ValuePlan
.
sourcepub fn value_plan_mut(&mut self) -> Option<&mut ValuePlan>
pub fn value_plan_mut(&mut self) -> Option<&mut ValuePlan>
Mutable ccess value plan from node plan, return None
for
node that cannot contain a ValuePlan
.
Trait Implementations§
source§impl PartialEq<NodePlan> for NodePlan
impl PartialEq<NodePlan> for NodePlan
impl Eq for NodePlan
impl StructuralEq for NodePlan
impl StructuralPartialEq for NodePlan
Auto Trait Implementations§
impl RefUnwindSafe for NodePlan
impl Send for NodePlan
impl Sync for NodePlan
impl Unpin for NodePlan
impl UnwindSafe for NodePlan
Blanket Implementations§
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,
source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.