Struct PartialStorage 

pub struct PartialStorage { /* private fields */ }

A partial representation of an account storage, containing only a subset of the storage data.

Partial storage is used to provide verifiable access to specific segments of account storage without the need to provide the full storage data. It contains all needed parts for loading account storage data into the transaction kernel.

Implementations

impl PartialStorage

pub fn new( storage_header: AccountStorageHeader, storage_maps: impl IntoIterator<Item = PartialStorageMap>, ) -> Result<PartialStorage, AccountError>

Returns a new instance of partial storage with the specified header and storage map SMTs.

The storage commitment is computed during instantiation based on the provided header. Additionally, this function validates that the passed SMTs correspond to one of the map roots in the storage header.

pub fn new_full(account_storage: AccountStorage) -> PartialStorage

Converts an AccountStorage into a partial storage representation.

This creates a partial storage that contains the full proofs for all key-value pairs in all map slots of the account storage.

pub fn new_minimal(account_storage: &AccountStorage) -> PartialStorage

Converts an AccountStorage into a partial storage representation.

For every storage map, a single unspecified key-value pair is tracked so that the PartialStorageMap represents the correct root.

pub fn header(&self) -> &AccountStorageHeader

Returns a reference to the header of this partial storage.

pub fn commitment(&self) -> Word

Returns the commitment of this partial storage.

pub fn into_parts( self, ) -> (Word, AccountStorageHeader, BTreeMap<Word, PartialStorageMap>)

Consumes self and returns the underlying parts.

pub fn inner_nodes(&self) -> impl Iterator<Item = InnerNodeInfo>

Returns an iterator over inner nodes of all storage map proofs contained in this partial storage.

pub fn maps(&self) -> impl Iterator<Item = &PartialStorageMap>

Iterator over every PartialStorageMap in this partial storage.

pub fn leaves(&self) -> impl Iterator<Item = &SmtLeaf>

Iterator over all tracked, non‑empty leaves across every map.

Trait Implementations

impl Clone for PartialStorage

fn clone(&self) -> PartialStorage

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartialStorage

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

Formats the value using the given formatter.

impl Deserializable for PartialStorage

fn read_from<R>(source: &mut R) -> Result<PartialStorage, DeserializationError>

where R: ByteReader,

Reads a sequence of bytes from the provided source, attempts to deserialize these bytes into Self, and returns the result.

fn read_from_bytes(bytes: &[u8]) -> Result<Self, DeserializationError>

Attempts to deserialize the provided bytes into Self and returns the result.

impl PartialEq for PartialStorage

fn eq(&self, other: &PartialStorage) -> 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 Serializable for PartialStorage

fn write_into<W>(&self, target: &mut W)

where W: ByteWriter,

Serializes self into bytes and writes these bytes into the target.

fn to_bytes(&self) -> Vec<u8>

Serializes self into a vector of bytes.

fn get_size_hint(&self) -> usize

Returns an estimate of how many bytes are needed to represent self.

impl Eq for PartialStorage

impl StructuralPartialEq for PartialStorage