pub struct TrieRoot<T: TrieLayout> {
pub root: Option<TrieHash<T>>,
}
Expand description
Calculate the trie root of the trie.
Fields§
§root: Option<TrieHash<T>>
The resulting root.
Trait Implementations§
source§impl<T: TrieLayout> Default for TrieRoot<T>
impl<T: TrieLayout> Default for TrieRoot<T>
source§impl<T: TrieLayout> ProcessEncodedNode<<<T as TrieLayout>::Hash as Hasher>::Out> for TrieRoot<T>
impl<T: TrieLayout> ProcessEncodedNode<<<T as TrieLayout>::Hash as Hasher>::Out> for TrieRoot<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for TrieRoot<T>where <<T as TrieLayout>::Hash as Hasher>::Out: RefUnwindSafe,
impl<T> Send for TrieRoot<T>
impl<T> Sync for TrieRoot<T>
impl<T> Unpin for TrieRoot<T>where <<T as TrieLayout>::Hash as Hasher>::Out: Unpin,
impl<T> UnwindSafe for TrieRoot<T>where <<T as TrieLayout>::Hash as Hasher>::Out: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more