Struct HashedPostStateSorted 

pub struct HashedPostStateSorted {
    pub accounts: Vec<(B256, Option<Account>)>,
    pub storages: B256Map<HashedStorageSorted>,
}

Sorted hashed post state optimized for iterating during state trie calculation.

Fields

accounts: Vec<(B256, Option<Account>)>

Sorted collection of account updates. None indicates a destroyed account.

storages: B256Map<HashedStorageSorted>

Map of hashed addresses to their sorted storage updates.

Implementations

impl HashedPostStateSorted

pub const fn new( accounts: Vec<(B256, Option<Account>)>, storages: B256Map<HashedStorageSorted>, ) -> Self

Create new instance of HashedPostStateSorted

pub const fn accounts(&self) -> &Vec<(B256, Option<Account>)>

Returns reference to hashed accounts.

pub const fn account_storages(&self) -> &B256Map<HashedStorageSorted>

Returns reference to hashed account storages.

pub fn is_empty(&self) -> bool

Returns true if there are no account or storage updates.

pub fn total_len(&self) -> usize

Returns the total number of updates including all accounts and storage updates.

pub fn construct_prefix_sets(&self) -> TriePrefixSetsMut

Construct TriePrefixSetsMut from hashed post state.

The prefix sets contain the hashed account and storage keys that have been changed in the post state.

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

Extends this state with contents of another sorted state. Entries in other take precedence for duplicate keys.

Sorts the accounts after extending. Sorts the storage after extending, for each account.

pub fn merge_batch<T: AsRef<Self> + From<Self>>( iter: impl IntoIterator<Item = T>, ) -> T

Batch-merge sorted hashed post states. 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: AsRef<Self>>(items: &[T]) -> Self

Batch-merge sorted hashed post states 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 disjointed_merge_batch<'a>(batch: &[&'a Self], mask: &[&'a Self]) -> Self

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

Account keys are masked at the top level, while storage entries are masked at the slot 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.

pub fn clear(&mut self)

Clears all accounts and storage data.

Trait Implementations

impl AsRef<HashedPostStateSorted> for HashedPostStateSorted

fn as_ref(&self) -> &Self

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

impl Clone for HashedPostStateSorted

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 HashedPostStateSorted

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

Formats the value using the given formatter.

impl Default for HashedPostStateSorted

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for HashedPostStateSorted

Available on crate feature serde only.

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

Available on crate feature serde-bincode-compat only.

fn deserialize_as<D>(deserializer: D) -> Result<HashedPostStateSorted, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for HashedPostStateSorted

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

Available on crate feature serde-bincode-compat only.

fn from(value: &'a HashedPostStateSorted) -> Self

Converts to this type from the input type.

impl<'a> From<HashedPostStateSorted<'a>> for HashedPostStateSorted

Available on crate feature serde-bincode-compat only.

fn from(value: HashedPostStateSorted<'a>) -> Self

Converts to this type from the input type.

impl From<HashedPostStateSorted> for HashedPostState

fn from(sorted: HashedPostStateSorted) -> Self

Converts to this type from the input type.

impl PartialEq for HashedPostStateSorted

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for HashedPostStateSorted

Available on crate feature serde only.

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SerializeAs<HashedPostStateSorted> for HashedPostStateSorted<'_>

Available on crate feature serde-bincode-compat only.

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for HashedPostStateSorted

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