Struct everscale_types::models::block::WorkchainShardHashes
source · pub struct WorkchainShardHashes<C: CellFamily> { /* private fields */ }Expand description
A tree of the most recent descriptions for all currently existing shards for a single workchain.
Implementations§
source§impl<C: CellFamily> WorkchainShardHashes<C>
impl<C: CellFamily> WorkchainShardHashes<C>
sourcepub fn keys(&self) -> WorkchainShardHashesKeysIter<'_, C> ⓘ
pub fn keys(&self) -> WorkchainShardHashesKeysIter<'_, C> ⓘ
Gets an iterator over the keys of the shard descriptions tree, sorted by key.
The iterator element type is Result<CellSlice<C>>.
If the tree is invalid, finishes after the first invalid element, returning an error.
sourcepub fn iter(&self) -> WorkchainShardHashesIter<'_, C> ⓘ
pub fn iter(&self) -> WorkchainShardHashesIter<'_, C> ⓘ
Gets an iterator over the entries of the shard descriptions tree, sorted by key.
The iterator element type is Result<(ShardIdent, ShardDescription<C>)>.
If the tree is invalid, finishes after the first invalid element, returning an error.
sourcepub fn latest_blocks(&self) -> WorkchainLatestBlocksIter<'_, C> ⓘ
pub fn latest_blocks(&self) -> WorkchainLatestBlocksIter<'_, C> ⓘ
Gets an iterator over the latest block in the current workchain, sorted by key.
The iterator element type is Result<BlockId>.
If the tree is invalid, finishes after the first invalid element, returning an error.
sourcepub fn raw_iter(&self) -> WorkchainShardHashesRawIter<'_, C> ⓘ
pub fn raw_iter(&self) -> WorkchainShardHashesRawIter<'_, C> ⓘ
Gets an iterator over the raw entries of the shard descriptions tree, sorted by key.
The iterator element type is Result<(ShardIdent, CellSlice<C>)>.
If the tree is invalid, finishes after the first invalid element, returning an error.
sourcepub fn raw_values(&self) -> WorkchainShardHashesRawValuesIter<'_, C> ⓘ
pub fn raw_values(&self) -> WorkchainShardHashesRawValuesIter<'_, C> ⓘ
Gets an iterator over the raw values of the shard descriptions tree, sorted by key.
The iterator element type is Result<CellSlice<C>>.
If the tree is invalid, finishes after the first invalid element, returning an error.