Struct TrieInput 

pub struct TrieInput {
    pub nodes: TrieUpdates,
    pub state: HashedPostState,
    pub prefix_sets: TriePrefixSetsMut,
}

Inputs for trie-related computations.

Fields

nodes: TrieUpdates

The collection of cached in-memory intermediate trie nodes that can be reused for computation.

state: HashedPostState

The in-memory overlay hashed state.

prefix_sets: TriePrefixSetsMut

The collection of prefix sets for the computation. Since the prefix sets always invalidate the in-memory nodes, not all keys from self.state might be present here, if we have cached nodes for them.

Implementations

impl TrieInput

pub const fn new( nodes: TrieUpdates, state: HashedPostState, prefix_sets: TriePrefixSetsMut, ) -> Self

Create new trie input.

pub fn from_state(state: HashedPostState) -> Self

Create new trie input from in-memory state. The prefix sets will be constructed and set automatically.

pub fn from_blocks<'a>( blocks: impl IntoIterator<Item = (&'a HashedPostState, &'a TrieUpdates)>, ) -> Self

Create new trie input from the provided blocks, from oldest to newest. See the documentation for Self::extend_with_blocks for details.

pub fn from_blocks_sorted<'a>( blocks: impl IntoIterator<Item = (&'a HashedPostStateSorted, &'a TrieUpdatesSorted)>, ) -> Self

Create new trie input from the provided sorted blocks, from oldest to newest. Converts sorted types to unsorted for aggregation.

pub fn extend_with_blocks<'a>( &mut self, blocks: impl IntoIterator<Item = (&'a HashedPostState, &'a TrieUpdates)>, )

Extend the trie input with the provided blocks, from oldest to newest.

pub fn prepend_self(&mut self, other: Self)

Prepend another trie input to the current one.

pub fn prepend(&mut self, state: HashedPostState)

Prepend state to the input and extend the prefix sets.

pub fn prepend_cached(&mut self, nodes: TrieUpdates, state: HashedPostState)

Prepend intermediate nodes and state to the input. Prefix sets for incoming state will be ignored.

pub fn append(&mut self, state: HashedPostState)

Append state to the input and extend the prefix sets.

pub fn append_ref(&mut self, state: &HashedPostState)

Append state to the input by reference and extend the prefix sets.

pub fn append_cached(&mut self, nodes: TrieUpdates, state: HashedPostState)

Append intermediate nodes and state to the input. Prefix sets for incoming state will be ignored.

pub fn append_cached_ref( &mut self, nodes: &TrieUpdates, state: &HashedPostState, )

Append intermediate nodes and state to the input by reference. Prefix sets for incoming state will be ignored.

pub fn clear(&mut self)

This method clears the trie input nodes, state, and prefix sets.

pub fn cleared(self) -> Self

This method returns a cleared version of this trie input.

Trait Implementations

impl Clone for TrieInput

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TrieInput

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TrieInput

fn default() -> Self

Returns the “default value” for a type.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 312 bytes