Struct TrieInputSorted 

pub struct TrieInputSorted {
    pub nodes: Arc<TrieUpdatesSorted>,
    pub state: Arc<HashedPostStateSorted>,
    pub prefix_sets: TriePrefixSetsMut,
}

Sorted variant of TrieInput for efficient proof generation.

This type holds sorted versions of trie data structures, which eliminates the need for expensive sorting operations during multiproof generation.

Fields

nodes: Arc<TrieUpdatesSorted>

Sorted cached in-memory intermediate trie nodes.

state: Arc<HashedPostStateSorted>

Sorted in-memory overlay hashed state.

prefix_sets: TriePrefixSetsMut

Prefix sets for computation.

Implementations

impl TrieInputSorted

pub const fn new( nodes: Arc<TrieUpdatesSorted>, state: Arc<HashedPostStateSorted>, prefix_sets: TriePrefixSetsMut, ) -> Self

Create new sorted trie input.

pub fn from_state(state: HashedPostStateSorted) -> Self

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

pub fn from_unsorted(input: TrieInput) -> Self

Create from unsorted TrieInput by sorting.

Trait Implementations

impl Clone for TrieInputSorted

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 TrieInputSorted

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

Formats the value using the given formatter.

impl Default for TrieInputSorted

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: 128 bytes