Struct TrieUpdatesSorted 

pub struct TrieUpdatesSorted { /* private fields */ }

Sorted trie updates used for lookups and insertions.

Implementations

impl TrieUpdatesSorted

pub fn new( account_nodes: Vec<(Nibbles, Option<BranchNodeCompact>)>, storage_tries: HashMap<FixedBytes<32>, StorageTrieUpdatesSorted, FbBuildHasher<32>>, ) -> TrieUpdatesSorted

Creates a new TrieUpdatesSorted with the given account nodes and storage tries.

Panics

In debug mode, panics if account_nodes is not sorted by the Nibbles key, or if any storage trie’s storage_nodes is not sorted by its Nibbles key.

pub fn is_empty(&self) -> bool

Returns true if the updates are empty.

pub fn account_nodes_ref(&self) -> &[(Nibbles, Option<BranchNodeCompact>)]

Returns reference to updated account nodes.

pub const fn storage_tries_ref( &self, ) -> &HashMap<FixedBytes<32>, StorageTrieUpdatesSorted, FbBuildHasher<32>>

Returns reference to updated storage tries.

pub fn total_len(&self) -> usize

Returns the total number of updates including account nodes and all storage updates.

pub fn extend_ref_and_sort(&mut self, other: &TrieUpdatesSorted)

Extends the trie updates with another set of sorted updates.

This merges the account nodes and storage tries from other into self. Account nodes are merged and re-sorted, with other’s values taking precedence for duplicate keys.

Sorts the account nodes after extending. Sorts the storage tries after extending, for each storage trie.

pub fn clear(&mut self)

Clears all account nodes and storage tries.

pub fn merge_batch<T>(iter: impl IntoIterator<Item = T>) -> T

where T: AsRef<TrieUpdatesSorted> + From<TrieUpdatesSorted>,

Batch-merge sorted trie updates. Iterator yields newest to oldest.

For small batches, uses extend_ref_and_sort loop. For large batches, uses k-way merge for O(n log k) complexity.

pub fn merge_slice<T>(items: &[T]) -> TrieUpdatesSorted

where T: AsRef<TrieUpdatesSorted>,

Batch-merge sorted trie updates from a slice. Slice is newest to oldest.

This variant takes a slice reference directly, avoiding iterator collection overhead. For small batches, uses extend_ref_and_sort loop. For large batches, uses k-way merge for O(n log k) complexity.

pub fn merge_iter<'a>( items: impl Iterator<Item = &'a TrieUpdatesSorted> + Clone, ) -> TrieUpdatesSorted

Batch-merge sorted trie updates yielded newest to oldest, using a k-way merge.

Traverses the iterator separately for account and storage nodes without collecting its inputs. The iterator is cloned for the account-node traversal.

pub fn disjointed_merge_batch<'a>( batch: &[&'a TrieUpdatesSorted], mask: &[&'a TrieUpdatesSorted], ) -> TrieUpdatesSorted

Merges the batch and removes overlapping keys whose mask values all differ from the merged batch value.

Account trie nodes are masked at the top level, while storage trie entries are masked at the node level. For duplicate keys in the batch, later items take precedence over earlier ones. An overlapping entry is retained if any mask value is equal to the merged batch value. The order of the mask does not matter. An empty mask merges the batch without filtering.

Trait Implementations

impl AsRef<TrieUpdatesSorted> for TrieUpdatesSorted

fn as_ref(&self) -> &TrieUpdatesSorted

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for TrieUpdatesSorted

fn clone(&self) -> TrieUpdatesSorted

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TrieUpdatesSorted

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

Formats the value using the given formatter.

impl Default for TrieUpdatesSorted

fn default() -> TrieUpdatesSorted

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TrieUpdatesSorted

fn deserialize<__D>( __deserializer: __D, ) -> Result<TrieUpdatesSorted, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de> DeserializeAs<'de, TrieUpdatesSorted> for TrieUpdatesSorted<'de>

fn deserialize_as<D>( deserializer: D, ) -> Result<TrieUpdatesSorted, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for TrieUpdatesSorted

impl<'a> From<&'a TrieUpdatesSorted> for TrieUpdatesSorted<'a>

fn from(value: &'a TrieUpdatesSorted) -> TrieUpdatesSorted<'a>

Converts to this type from the input type.

impl<'a> From<TrieUpdatesSorted<'a>> for TrieUpdatesSorted

fn from(value: TrieUpdatesSorted<'a>) -> TrieUpdatesSorted

Converts to this type from the input type.

impl From<TrieUpdatesSorted> for TrieUpdates

fn from(sorted: TrieUpdatesSorted) -> TrieUpdates

Converts to this type from the input type.

impl PartialEq for TrieUpdatesSorted

fn eq(&self, other: &TrieUpdatesSorted) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for TrieUpdatesSorted

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SerializeAs<TrieUpdatesSorted> for TrieUpdatesSorted<'_>

fn serialize_as<S>( source: &TrieUpdatesSorted, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TrieUpdatesSorted

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