Struct HashedStorageSorted 

pub struct HashedStorageSorted {
    pub storage_slots: Vec<(B256, U256)>,
    pub wiped: bool,
}

Sorted hashed storage optimized for iterating during state trie calculation.

Fields

storage_slots: Vec<(B256, U256)>

Sorted collection of updated storage slots. [U256::ZERO] indicates a deleted value.

wiped: bool

Flag indicating whether the storage was wiped or not.

Implementations

impl HashedStorageSorted

pub const fn is_wiped(&self) -> bool

Returns true if the account was wiped.

pub fn storage_slots_ref(&self) -> &[(B256, U256)]

Returns reference to updated storage slots.

pub const fn len(&self) -> usize

Returns the total number of storage slot updates.

pub const fn is_empty(&self) -> bool

Returns true if there are no storage slot updates.

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

Extends the storage slots updates with another set of sorted updates.

If other is marked as deleted, this will be marked as deleted and all slots cleared. Otherwise, nodes are merged with other’s values taking precedence for duplicates.

pub fn merge_batch<'a>(updates: impl IntoIterator<Item = &'a Self>) -> Self

Batch-merge sorted hashed storage. Iterator yields newest to oldest. If any update is wiped, prior data is discarded.

Trait Implementations

impl Clone for HashedStorageSorted

fn clone(&self) -> HashedStorageSorted

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HashedStorageSorted

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

Formats the value using the given formatter.

impl Default for HashedStorageSorted

fn default() -> HashedStorageSorted

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for HashedStorageSorted

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, HashedStorageSorted> for HashedStorageSorted<'de>

Available on crate feature serde-bincode-compat only.

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

Available on crate feature serde-bincode-compat only.

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

Converts to this type from the input type.

impl<'a> From<HashedStorageSorted<'a>> for HashedStorageSorted

Available on crate feature serde-bincode-compat only.

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

Converts to this type from the input type.

impl From<HashedStorageSorted> for HashedStorage

fn from(sorted: HashedStorageSorted) -> Self

Converts to this type from the input type.

impl PartialEq for HashedStorageSorted

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for HashedStorageSorted

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SerializeAs<HashedStorageSorted> for HashedStorageSorted<'_>

Available on crate feature serde-bincode-compat only.

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for HashedStorageSorted

impl StructuralPartialEq for HashedStorageSorted

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