Struct HashedPostState 

pub struct HashedPostState {
    pub accounts: HashMap<FixedBytes<32>, Option<Account>, FbBuildHasher<32>>,
    pub storages: HashMap<FixedBytes<32>, HashedStorage, FbBuildHasher<32>>,
}

In-memory hashed state that stores account and storage changes with keccak256-hashed keys in hash maps.

Fields

accounts: HashMap<FixedBytes<32>, Option<Account>, FbBuildHasher<32>>

Mapping of hashed address to account info, None if destroyed.

storages: HashMap<FixedBytes<32>, HashedStorage, FbBuildHasher<32>>

Mapping of hashed address to hashed storage.

Implementations

impl HashedPostState

pub fn with_capacity(capacity: usize) -> HashedPostState

Create new instance of HashedPostState.

pub fn from_bundle_state<'a, KH>( state: impl IntoIterator<Item = (&'a Address, &'a BundleAccount)>, ) -> HashedPostState

where KH: KeyHasher,

Initialize HashedPostState from bundle state. Hashes all changed accounts and storage entries that are currently stored in the bundle state.

pub fn from_hashed_storage( hashed_address: FixedBytes<32>, storage: HashedStorage, ) -> HashedPostState

Construct HashedPostState from a single HashedStorage.

pub fn with_accounts( self, accounts: impl IntoIterator<Item = (FixedBytes<32>, Option<Account>)>, ) -> HashedPostState

Set account entries on hashed state.

pub fn with_storages( self, storages: impl IntoIterator<Item = (FixedBytes<32>, HashedStorage)>, ) -> HashedPostState

Set storage entries on hashed state.

pub fn is_empty(&self) -> bool

Returns true if the hashed state is empty.

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 multi_proof_targets(&self) -> MultiProofTargets

Create multiproof targets for this state.

pub fn multi_proof_targets_difference( &self, excluded: &MultiProofTargets, ) -> MultiProofTargets

Create multiproof targets difference for this state, i.e., the targets that are in targets create from self but not in excluded.

This method is preferred to first calling Self::multi_proof_targets and the calling MultiProofTargets::retain_difference, because it does not over allocate the targets map.

pub fn chunks(self, size: usize) -> ChunkedHashedPostState

Returns an iterator that yields chunks of the specified size.

See ChunkedHashedPostState for more information.

Panics

Panics if the chunk size is zero.

pub fn chunking_length(&self) -> usize

Returns the number of items that will be considered during chunking in [Self::chunks].

pub fn extend(&mut self, other: HashedPostState)

Extend this hashed post state with contents of another. Entries in the second hashed post state take precedence.

pub fn extend_ref(&mut self, other: &HashedPostState)

Extend this hashed post state with contents of another. Entries in the second hashed post state take precedence.

Slightly less efficient than Self::extend, but preferred to extend(other.clone()).

pub fn extend_from_sorted(&mut self, sorted: &HashedPostStateSorted)

Extend this hashed post state with sorted data, converting directly into the unsorted HashMap representation. This is more efficient than first converting to HashedPostState and then extending, as it avoids creating intermediate HashMap allocations.

pub fn into_sorted(self) -> HashedPostStateSorted

Converts hashed post state into HashedPostStateSorted.

pub fn clone_into_sorted(&self) -> HashedPostStateSorted

Creates a sorted copy without consuming self. More efficient than .clone().into_sorted() as it avoids cloning HashMap metadata.

pub fn clear(&mut self)

Clears the account and storage maps of this HashedPostState.

Trait Implementations

impl Clone for HashedPostState

fn clone(&self) -> HashedPostState

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HashedPostState

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

Formats the value using the given formatter.

impl Default for HashedPostState

fn default() -> HashedPostState

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for HashedPostState

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for HashedPostState

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

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

Converts to this type from the input type.

impl<'a> From<HashedPostState<'a>> for HashedPostState

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

Converts to this type from the input type.

impl From<HashedPostStateSorted> for HashedPostState

fn from(sorted: HashedPostStateSorted) -> HashedPostState

Converts to this type from the input type.

impl FromIterator<(FixedBytes<32>, Option<Account>, Option<HashedStorage>)> for HashedPostState

fn from_iter<T>(iter: T) -> HashedPostState

where T: IntoIterator<Item = (FixedBytes<32>, Option<Account>, Option<HashedStorage>)>,

Constructs a HashedPostState from an iterator of tuples containing:

• Hashed address (B256)
• Optional account info (None indicates destroyed account)
• Optional hashed storage

Important

• The iterator assumes unique hashed addresses (B256). If duplicate addresses are present, later entries will overwrite earlier ones for accounts, and storage will be merged.
• The HashedStorage must not be empty (as determined by HashedStorage::is_empty). Empty storage should be represented as None rather than Some(empty_storage). This ensures the storage map only contains meaningful entries.

Use (!storage.is_empty()).then_some(storage) to convert empty storage to None.

impl FromParallelIterator<(FixedBytes<32>, Option<Account>, Option<HashedStorage>)> for HashedPostState

Available on crate feature rayon only.

fn from_par_iter<I>(par_iter: I) -> HashedPostState

where I: IntoParallelIterator<Item = (FixedBytes<32>, Option<Account>, Option<HashedStorage>)>,

Parallel version of FromIterator for constructing HashedPostState from a parallel iterator.

See FromIterator::from_iter for details on the expected input format.

Important

• The iterator assumes unique hashed addresses (B256). If duplicate addresses are present, later entries will overwrite earlier ones for accounts, and storage will be merged.
• The HashedStorage must not be empty. Empty storage should be None.

impl PartialEq for HashedPostState

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for HashedPostState

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<HashedPostState> for HashedPostState<'_>

fn serialize_as<S>( source: &HashedPostState, 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 HashedPostState

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