pub struct NodeCodec<H>(_);
Expand description
The Substrate format implementation of NodeCodec
.
The Substrate format implementation of NodeCodec
.
Concrete implementation of a NodeCodecT
with SCALE encoding.
It is generic over H
the Hasher
.
Trait Implementations§
source§impl<H> NodeCodec for NodeCodec<H>where
H: Hasher,
impl<H> NodeCodec for NodeCodec<H>where H: Hasher,
source§const ESCAPE_HEADER: Option<u8> = _
const ESCAPE_HEADER: Option<u8> = _
Escape header byte sequence to indicate next node is a
branch or leaf with hash of value, followed by the value node.
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>,
_nbnibble: usize,
_child: ChildReference<<H as Hasher>::Out>
) -> Vec<u8> ⓘ
fn extension_node( _partial: impl Iterator<Item = u8>, _nbnibble: usize, _child: ChildReference<<H as Hasher>::Out> ) -> Vec<u8> ⓘ
Returns an encoded extension node Read more
source§fn branch_node(
_children: impl Iterator<Item = impl Borrow<Option<ChildReference<<H as Hasher>::Out>>>>,
_maybe_value: Option<Value<'_>>
) -> Vec<u8> ⓘ
fn branch_node( _children: impl Iterator<Item = impl Borrow<Option<ChildReference<<H as Hasher>::Out>>>>, _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<<H as Hasher>::Out>>>>,
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<<H as Hasher>::Out>>>>, 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§impl<'a, H: Hasher> TrieCache<NodeCodec<H>> for TrieCache<'a, H>
impl<'a, H: Hasher> TrieCache<NodeCodec<H>> for TrieCache<'a, H>
source§fn get_or_insert_node(
&mut self,
hash: H::Out,
fetch_node: &mut dyn FnMut() -> Result<NodeOwned<H::Out>, H::Out, Error<H::Out>>
) -> Result<&NodeOwned<H::Out>, H::Out, Error<H::Out>>
fn get_or_insert_node( &mut self, hash: H::Out, fetch_node: &mut dyn FnMut() -> Result<NodeOwned<H::Out>, H::Out, Error<H::Out>> ) -> Result<&NodeOwned<H::Out>, H::Out, Error<H::Out>>
source§fn get_node(&mut self, hash: &H::Out) -> Option<&NodeOwned<H::Out>>
fn get_node(&mut self, hash: &H::Out) -> Option<&NodeOwned<H::Out>>
Get the
NodeOwned
that corresponds to the given hash
.source§fn lookup_value_for_key(&mut self, key: &[u8]) -> Option<&CachedValue<H::Out>>
fn lookup_value_for_key(&mut self, key: &[u8]) -> Option<&CachedValue<H::Out>>
Lookup value for the given
key
. Read moresource§fn cache_value_for_key(&mut self, key: &[u8], data: CachedValue<H::Out>)
fn cache_value_for_key(&mut self, key: &[u8], data: CachedValue<H::Out>)
Auto Trait Implementations§
impl<H> RefUnwindSafe for NodeCodec<H>where H: RefUnwindSafe,
impl<H> Send for NodeCodec<H>where H: Send,
impl<H> Sync for NodeCodec<H>where H: Sync,
impl<H> Unpin for NodeCodec<H>where H: Unpin,
impl<H> UnwindSafe for NodeCodec<H>where H: UnwindSafe,
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>
Convert
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>
Convert
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)
Convert
&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)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.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
The counterpart to
unchecked_from
.