Struct reference_trie::ReferenceNodeCodec
source · pub struct ReferenceNodeCodec<H>(_);
Expand description
Simple reference implementation of a NodeCodec
.
Trait Implementations§
source§impl<H: Clone> Clone for ReferenceNodeCodec<H>
impl<H: Clone> Clone for ReferenceNodeCodec<H>
source§fn clone(&self) -> ReferenceNodeCodec<H>
fn clone(&self) -> ReferenceNodeCodec<H>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<H: Default> Default for ReferenceNodeCodec<H>
impl<H: Default> Default for ReferenceNodeCodec<H>
source§fn default() -> ReferenceNodeCodec<H>
fn default() -> ReferenceNodeCodec<H>
Returns the “default value” for a type. Read more
source§impl<H: Hasher> NodeCodec for ReferenceNodeCodec<H>
impl<H: Hasher> NodeCodec for ReferenceNodeCodec<H>
source§fn hashed_null_node() -> <H as Hasher>::Out
fn hashed_null_node() -> <H as Hasher>::Out
Get the hashed null node.
source§fn decode_plan(data: &[u8]) -> Result<NodePlan, Self::Error>
fn decode_plan(data: &[u8]) -> Result<NodePlan, Self::Error>
Decode bytes to a
NodePlan
. Returns Self::E
on failure.source§fn is_empty_node(data: &[u8]) -> bool
fn is_empty_node(data: &[u8]) -> bool
Check if the provided bytes correspond to the codecs “empty” node.
source§fn empty_node() -> &'static [u8] ⓘ
fn empty_node() -> &'static [u8] ⓘ
Returns an encoded empty node.
source§fn leaf_node(
partial: impl Iterator<Item = u8>,
number_nibble: usize,
value: Value<'_>
) -> Vec<u8>
fn leaf_node( partial: impl Iterator<Item = u8>, number_nibble: usize, value: Value<'_> ) -> Vec<u8>
Returns an encoded leaf node Read more
source§fn extension_node(
partial: impl Iterator<Item = u8>,
number_nibble: usize,
child: ChildReference<Self::HashOut>
) -> Vec<u8>
fn extension_node( partial: impl Iterator<Item = u8>, number_nibble: usize, child: ChildReference<Self::HashOut> ) -> Vec<u8>
Returns an encoded extension node Read more
source§fn branch_node(
children: impl Iterator<Item = impl Borrow<Option<ChildReference<Self::HashOut>>>>,
maybe_value: Option<Value<'_>>
) -> Vec<u8>
fn branch_node( children: impl Iterator<Item = impl Borrow<Option<ChildReference<Self::HashOut>>>>, maybe_value: Option<Value<'_>> ) -> Vec<u8>
Returns an encoded branch node.
Takes an iterator yielding
ChildReference<Self::HashOut>
and an optional value.source§fn branch_node_nibbled(
_partial: impl Iterator<Item = u8>,
_number_nibble: usize,
_children: impl Iterator<Item = impl Borrow<Option<ChildReference<Self::HashOut>>>>,
_maybe_value: Option<Value<'_>>
) -> Vec<u8>
fn branch_node_nibbled( _partial: impl Iterator<Item = u8>, _number_nibble: usize, _children: impl Iterator<Item = impl Borrow<Option<ChildReference<Self::HashOut>>>>, _maybe_value: Option<Value<'_>> ) -> Vec<u8>
Returns an encoded branch node with a possible partial path.
number_nibble
is the partial path length as in extension_node
.source§const ESCAPE_HEADER: Option<u8> = None
const ESCAPE_HEADER: Option<u8> = None
Escape header byte sequence to indicate next node is a
branch or leaf with hash of value, followed by the value node.