Struct trie_db::TrieRootPrint
source · [−]pub struct TrieRootPrint<T: TrieLayout> {
pub root: Option<TrieHash<T>>,
/* private fields */
}Expand description
Calculate the trie root of the trie. Print a debug trace.
Fields
root: Option<TrieHash<T>>The resulting root.
Trait Implementations
sourceimpl<T: TrieLayout> Default for TrieRootPrint<T>
impl<T: TrieLayout> Default for TrieRootPrint<T>
sourceimpl<T: TrieLayout> ProcessEncodedNode<<<T as TrieLayout>::Hash as Hasher>::Out> for TrieRootPrint<T>
impl<T: TrieLayout> ProcessEncodedNode<<<T as TrieLayout>::Hash as Hasher>::Out> for TrieRootPrint<T>
sourcefn process(
&mut self,
p: Prefix<'_>,
encoded_node: Vec<u8>,
is_root: bool
) -> ChildReference<TrieHash<T>>
fn process(
&mut self,
p: Prefix<'_>,
encoded_node: Vec<u8>,
is_root: bool
) -> ChildReference<TrieHash<T>>
Function call with prefix, encoded value and a boolean indicating if the node is the root for each node of the trie. Read more
sourcefn process_inner_hashed_value(
&mut self,
_prefix: Prefix<'_>,
value: &[u8]
) -> TrieHash<T>
fn process_inner_hashed_value(
&mut self,
_prefix: Prefix<'_>,
value: &[u8]
) -> TrieHash<T>
Callback for hashed value in encoded node.
Auto Trait Implementations
impl<T> RefUnwindSafe for TrieRootPrint<T> where
T: RefUnwindSafe,
<<T as TrieLayout>::Hash as Hasher>::Out: RefUnwindSafe,
impl<T> Send for TrieRootPrint<T> where
T: Send,
impl<T> Sync for TrieRootPrint<T> where
T: Sync,
impl<T> Unpin for TrieRootPrint<T> where
T: Unpin,
<<T as TrieLayout>::Hash as Hasher>::Out: Unpin,
impl<T> UnwindSafe for TrieRootPrint<T> where
T: UnwindSafe,
<<T as TrieLayout>::Hash as Hasher>::Out: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more