Struct reth_provider::Chain
pub struct Chain { /* private fields */ }Expand description
A chain of blocks and their final state.
The chain contains the state of accounts after execution of its blocks, changesets for those blocks (and their transactions), as well as the blocks themselves.
Used inside the BlockchainTree.
§Warning
A chain of blocks should not be empty.
Implementations§
§impl Chain
impl Chain
pub fn new(
blocks: impl IntoIterator<Item = SealedBlockWithSenders>,
execution_outcome: ExecutionOutcome,
trie_updates: Option<TrieUpdates>,
) -> Chain
pub fn new( blocks: impl IntoIterator<Item = SealedBlockWithSenders>, execution_outcome: ExecutionOutcome, trie_updates: Option<TrieUpdates>, ) -> Chain
pub fn from_block(
block: SealedBlockWithSenders,
execution_outcome: ExecutionOutcome,
trie_updates: Option<TrieUpdates>,
) -> Chain
pub fn from_block( block: SealedBlockWithSenders, execution_outcome: ExecutionOutcome, trie_updates: Option<TrieUpdates>, ) -> Chain
Create new Chain from a single block and its state.
pub fn into_blocks(self) -> BTreeMap<u64, SealedBlockWithSenders>
pub fn into_blocks(self) -> BTreeMap<u64, SealedBlockWithSenders>
Consumes the type and only returns the blocks in this chain.
pub fn headers(&self) -> impl Iterator<Item = SealedHeader>
pub fn headers(&self) -> impl Iterator<Item = SealedHeader>
Returns an iterator over all headers in the block with increasing block numbers.
pub const fn trie_updates(&self) -> Option<&TrieUpdates>
pub const fn trie_updates(&self) -> Option<&TrieUpdates>
Get cached trie updates for this chain.
pub fn clear_trie_updates(&mut self)
pub fn clear_trie_updates(&mut self)
Remove cached trie updates for this chain.
pub const fn execution_outcome(&self) -> &ExecutionOutcome
pub const fn execution_outcome(&self) -> &ExecutionOutcome
Get execution outcome of this chain
pub fn execution_outcome_mut(&mut self) -> &mut ExecutionOutcome
pub fn execution_outcome_mut(&mut self) -> &mut ExecutionOutcome
Get mutable execution outcome of this chain
pub fn prepend_state(&mut self, state: BundleState)
pub fn prepend_state(&mut self, state: BundleState)
Prepends the given state to the current state.
pub fn block_number(&self, block_hash: FixedBytes<32>) -> Option<u64>
pub fn block_number(&self, block_hash: FixedBytes<32>) -> Option<u64>
Return block number of the block hash.
pub fn block(&self, block_hash: FixedBytes<32>) -> Option<&SealedBlock>
pub fn block(&self, block_hash: FixedBytes<32>) -> Option<&SealedBlock>
Returns the block with matching hash.
pub fn block_with_senders(
&self,
block_hash: FixedBytes<32>,
) -> Option<&SealedBlockWithSenders>
pub fn block_with_senders( &self, block_hash: FixedBytes<32>, ) -> Option<&SealedBlockWithSenders>
Returns the block with matching hash.
pub fn execution_outcome_at_block(
&self,
block_number: u64,
) -> Option<ExecutionOutcome>
pub fn execution_outcome_at_block( &self, block_number: u64, ) -> Option<ExecutionOutcome>
Return execution outcome at the block_number or None if block is not known
pub fn into_inner(
self,
) -> (ChainBlocks<'static>, ExecutionOutcome, Option<TrieUpdates>)
pub fn into_inner( self, ) -> (ChainBlocks<'static>, ExecutionOutcome, Option<TrieUpdates>)
Destructure the chain into its inner components:
- The blocks contained in the chain.
- The execution outcome representing the final state.
- The optional trie updates.
pub const fn inner(&self) -> (ChainBlocks<'_>, &ExecutionOutcome)
pub const fn inner(&self) -> (ChainBlocks<'_>, &ExecutionOutcome)
Destructure the chain into its inner components:
- A reference to the blocks contained in the chain.
- A reference to the execution outcome representing the final state.
pub fn block_receipts_iter(&self) -> impl Iterator<Item = &Vec<Option<Receipt>>>
pub fn block_receipts_iter(&self) -> impl Iterator<Item = &Vec<Option<Receipt>>>
Returns an iterator over all the receipts of the blocks in the chain.
pub fn blocks_iter(&self) -> impl Iterator<Item = &SealedBlockWithSenders>
pub fn blocks_iter(&self) -> impl Iterator<Item = &SealedBlockWithSenders>
Returns an iterator over all blocks in the chain with increasing block number.
pub fn blocks_and_receipts(
&self,
) -> impl Iterator<Item = (&SealedBlockWithSenders, &Vec<Option<Receipt>>)>
pub fn blocks_and_receipts( &self, ) -> impl Iterator<Item = (&SealedBlockWithSenders, &Vec<Option<Receipt>>)>
Returns an iterator over all blocks and their receipts in the chain.
pub fn fork_block(&self) -> NumHash
pub fn fork_block(&self) -> NumHash
Get the block at which this chain forked.
pub fn first(&self) -> &SealedBlockWithSenders
pub fn first(&self) -> &SealedBlockWithSenders
pub fn tip(&self) -> &SealedBlockWithSenders
pub fn tip(&self) -> &SealedBlockWithSenders
pub fn range(&self) -> RangeInclusive<u64>
pub fn range(&self) -> RangeInclusive<u64>
pub fn receipts_by_block_hash(
&self,
block_hash: FixedBytes<32>,
) -> Option<Vec<&Receipt>>
pub fn receipts_by_block_hash( &self, block_hash: FixedBytes<32>, ) -> Option<Vec<&Receipt>>
Get all receipts for the given block.
pub fn receipts_with_attachment(&self) -> Vec<BlockReceipts>
pub fn receipts_with_attachment(&self) -> Vec<BlockReceipts>
Get all receipts with attachment.
Attachment includes block number, block hash, transaction hash and transaction index.
pub fn append_block(
&mut self,
block: SealedBlockWithSenders,
execution_outcome: ExecutionOutcome,
)
pub fn append_block( &mut self, block: SealedBlockWithSenders, execution_outcome: ExecutionOutcome, )
Append a single block with state to the chain. This method assumes that blocks attachment to the chain has already been validated.
pub fn append_chain(&mut self, other: Chain) -> Result<(), BlockExecutionError>
pub fn append_chain(&mut self, other: Chain) -> Result<(), BlockExecutionError>
Merge two chains by appending the given chain into the current one.
The state of accounts for this chain is set to the state of the newest chain.
pub fn split(self, split_at: ChainSplitTarget) -> ChainSplit
pub fn split(self, split_at: ChainSplitTarget) -> ChainSplit
Split this chain at the given block.
The given block will be the last block in the first returned chain.
If the given block is not found, ChainSplit::NoSplitPending is returned.
Split chain at the number or hash, block with given number will be included at first chain.
If any chain is empty (Does not have blocks) None will be returned.
§Note
The plain state is only found in the second chain, making it impossible to perform any state reverts on the first chain.
The second chain only contains the changes that were reverted on the first chain; however, it retains the up to date state as if the chains were one, i.e. the second chain is an extension of the first.
§Panics
If chain doesn’t have any blocks.
Trait Implementations§
§impl<'de> Deserialize<'de> for Chain
impl<'de> Deserialize<'de> for Chain
§fn deserialize<__D>(
__deserializer: __D,
) -> Result<Chain, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<Chain, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
§impl Serialize for Chain
impl Serialize for Chain
§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl Eq for Chain
impl StructuralPartialEq for Chain
Auto Trait Implementations§
impl Freeze for Chain
impl RefUnwindSafe for Chain
impl Send for Chain
impl Sync for Chain
impl Unpin for Chain
impl UnwindSafe for Chain
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Conv for T
impl<T> Conv for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<T> MaybeDebug for Twhere
T: Debug,
impl<T> NippyJarHeader for T
impl<T> RpcObject for Twhere
T: RpcParam + RpcReturn,
impl<T> RpcParam for T
impl<T> RpcReturn for T
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: 360 bytes