Struct BlockState

pub struct BlockState { /* private fields */ }

State after applying the given block, this block is part of the canonical chain that partially stored in memory and can be traced back to a canonical block on disk.

Implementations

impl BlockState

pub const fn new(block: ExecutedBlock) -> Self

BlockState constructor.

pub const fn with_parent( block: ExecutedBlock, parent: Option<Arc<Self>>, ) -> Self

BlockState constructor with parent.

pub fn anchor(&self) -> BlockNumHash

Returns the hash and block of the on disk block this state can be traced back to.

pub fn block(&self) -> ExecutedBlock

Returns the executed block that determines the state.

pub const fn block_ref(&self) -> &ExecutedBlock

Returns a reference to the executed block that determines the state.

pub fn block_with_senders(&self) -> BlockWithSenders

Returns the block with senders for the state.

pub fn sealed_block_with_senders(&self) -> SealedBlockWithSenders

Returns the sealed block with senders for the state.

pub fn hash(&self) -> B256

Returns the hash of executed block that determines the state.

pub fn number(&self) -> u64

Returns the block number of executed block that determines the state.

pub fn state_root(&self) -> B256

Returns the state root after applying the executed block that determines the state.

pub fn receipts(&self) -> &Receipts

Returns the Receipts of executed block that determines the state.

pub fn executed_block_receipts(&self) -> Vec<Receipt>

Returns a vector of Receipt of executed block that determines the state. We assume that the Receipts in the executed block ExecutionOutcome has only one element corresponding to the executed block associated to the state.

pub fn parent_state_chain(&self) -> Vec<&Self>

Returns a vector of parent BlockStates.

The block state order in the output vector is newest to oldest (highest to lowest): [5,4,3,2,1]

Note: This does not include self.

pub fn chain(&self) -> impl Iterator<Item = &Self>

Returns a vector of BlockStates representing the entire in memory chain. The block state order in the output vector is newest to oldest (highest to lowest), including self as the first element.

pub fn append_parent_chain<'a>(&'a self, chain: &mut Vec<&'a Self>)

Appends the parent chain of this BlockState to the given vector.

pub fn iter(self: Arc<Self>) -> impl Iterator<Item = Arc<Self>>

Returns an iterator over the atomically captured chain of in memory blocks.

This yields the blocks from newest to oldest (highest to lowest).

pub fn state_provider( &self, historical: StateProviderBox, ) -> MemoryOverlayStateProvider

Return state provider with reference to in-memory blocks that overlay database state.

This merges the state of all blocks that are part of the chain that the this block is the head of. This includes all blocks that connect back to the canonical block on disk.

pub fn block_on_chain(&self, hash_or_num: BlockHashOrNumber) -> Option<&Self>

Tries to find a block by [BlockHashOrNumber] in the chain ending at this block.

pub fn transaction_on_chain(&self, hash: TxHash) -> Option<TransactionSigned>

Tries to find a transaction by [TxHash] in the chain ending at this block.

pub fn transaction_meta_on_chain( &self, tx_hash: TxHash, ) -> Option<(TransactionSigned, TransactionMeta)>

Tries to find a transaction with meta by [TxHash] in the chain ending at this block.

Trait Implementations

impl Clone for BlockState

fn clone(&self) -> BlockState

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BlockState

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

Formats the value using the given formatter.

impl PartialEq for BlockState

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

impl StructuralPartialEq for BlockState

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