Struct HashedStorageSorted 

pub struct HashedStorageSorted {
    pub storage_slots: Vec<(FixedBytes<32>, Uint<256, 4>)>,
}

Sorted hashed storage optimized for iterating during state trie calculation.

Fields

storage_slots: Vec<(FixedBytes<32>, Uint<256, 4>)>

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

Implementations

impl HashedStorageSorted

pub fn storage_slots_ref(&self) -> &[(FixedBytes<32>, Uint<256, 4>)]

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: &HashedStorageSorted)

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

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

Batch-merge sorted hashed storage. Iterator yields newest to oldest.

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<(), Error>

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<HashedStorageSorted, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for HashedStorageSorted

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

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

Converts to this type from the input type.

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

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

Converts to this type from the input type.

impl From<HashedStorageSorted> for HashedStorage

fn from(sorted: HashedStorageSorted) -> HashedStorage

Converts to this type from the input type.

impl PartialEq for HashedStorageSorted

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for HashedStorageSorted

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

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