Struct ExecutionOutcome
pub struct ExecutionOutcome<T = Receipt> {
pub bundle: BundleState,
pub receipts: Receipts<T>,
pub first_block: u64,
pub requests: Vec<Requests>,
}
Expand description
Represents the outcome of block execution, including post-execution changes and reverts.
The ExecutionOutcome
structure aggregates the state changes over an arbitrary number of
blocks, capturing the resulting state, receipts, and requests following the execution.
Fields§
§bundle: BundleState
Bundle state with reverts.
receipts: Receipts<T>
The collection of receipts. Outer vector stores receipts for each block sequentially. The inner vector stores receipts ordered by transaction number.
If receipt is None it means it is pruned.
first_block: u64
First block of bundle state.
requests: Vec<Requests>
The collection of EIP-7685 requests. Outer vector stores requests for each block sequentially. The inner vector stores requests ordered by transaction number.
A transaction may have zero or more requests, so the length of the inner vector is not guaranteed to be the same as the number of transactions.
Implementations§
§impl<T> ExecutionOutcome<T>
impl<T> ExecutionOutcome<T>
pub const fn new(
bundle: BundleState,
receipts: Receipts<T>,
first_block: u64,
requests: Vec<Requests>,
) -> ExecutionOutcome<T>
pub const fn new( bundle: BundleState, receipts: Receipts<T>, first_block: u64, requests: Vec<Requests>, ) -> ExecutionOutcome<T>
Creates a new ExecutionOutcome
.
This constructor initializes a new ExecutionOutcome
instance with the provided
bundle state, receipts, first block number, and EIP-7685 requests.
pub fn new_init(
state_init: HashMap<Address, (Option<Account>, Option<Account>, HashMap<FixedBytes<32>, (Uint<256, 4>, Uint<256, 4>)>)>,
revert_init: HashMap<u64, HashMap<Address, (Option<Option<Account>>, Vec<StorageEntry>)>>,
contracts_init: impl IntoIterator<Item = (FixedBytes<32>, Bytecode)>,
receipts: Receipts<T>,
first_block: u64,
requests: Vec<Requests>,
) -> ExecutionOutcome<T>
pub fn new_init( state_init: HashMap<Address, (Option<Account>, Option<Account>, HashMap<FixedBytes<32>, (Uint<256, 4>, Uint<256, 4>)>)>, revert_init: HashMap<u64, HashMap<Address, (Option<Option<Account>>, Vec<StorageEntry>)>>, contracts_init: impl IntoIterator<Item = (FixedBytes<32>, Bytecode)>, receipts: Receipts<T>, first_block: u64, requests: Vec<Requests>, ) -> ExecutionOutcome<T>
Creates a new ExecutionOutcome
from initialization parameters.
This constructor initializes a new ExecutionOutcome
instance using detailed
initialization parameters.
pub const fn state(&self) -> &BundleState
pub const fn state(&self) -> &BundleState
Return revm bundle state.
pub fn state_mut(&mut self) -> &mut BundleState
pub fn state_mut(&mut self) -> &mut BundleState
Returns mutable revm bundle state.
pub fn set_first_block(&mut self, first_block: u64)
pub fn set_first_block(&mut self, first_block: u64)
Set first block.
pub fn accounts_iter(
&self,
) -> impl Iterator<Item = (Address, Option<&AccountInfo>)>
pub fn accounts_iter( &self, ) -> impl Iterator<Item = (Address, Option<&AccountInfo>)>
Return iterator over all accounts
pub fn bundle_accounts_iter(
&self,
) -> impl Iterator<Item = (Address, &BundleAccount)>
pub fn bundle_accounts_iter( &self, ) -> impl Iterator<Item = (Address, &BundleAccount)>
Return iterator over all [BundleAccount
]s in the bundle
pub fn storage(
&self,
address: &Address,
storage_key: Uint<256, 4>,
) -> Option<Uint<256, 4>>
pub fn storage( &self, address: &Address, storage_key: Uint<256, 4>, ) -> Option<Uint<256, 4>>
Get storage if value is known.
This means that depending on status we can potentially return U256::ZERO
.
pub fn hash_state_slow<KH>(&self) -> HashedPostStatewhere
KH: KeyHasher,
pub fn hash_state_slow<KH>(&self) -> HashedPostStatewhere
KH: KeyHasher,
Returns [HashedPostState
] for this execution outcome.
See [HashedPostState::from_bundle_state
] for more info.
pub fn block_number_to_index(&self, block_number: u64) -> Option<usize>
pub fn block_number_to_index(&self, block_number: u64) -> Option<usize>
Transform block number to the index of block.
pub fn generic_receipts_root_slow(
&self,
block_number: u64,
f: impl FnOnce(&[&T]) -> FixedBytes<32>,
) -> Option<FixedBytes<32>>
pub fn generic_receipts_root_slow( &self, block_number: u64, f: impl FnOnce(&[&T]) -> FixedBytes<32>, ) -> Option<FixedBytes<32>>
Returns the receipt root for all recorded receipts. Note: this function calculated Bloom filters for every receipt and created merkle trees of receipt. This is a expensive operation.
pub const fn receipts(&self) -> &Receipts<T>
pub const fn receipts(&self) -> &Receipts<T>
Returns reference to receipts.
pub fn receipts_mut(&mut self) -> &mut Receipts<T>
pub fn receipts_mut(&mut self) -> &mut Receipts<T>
Returns mutable reference to receipts.
pub fn receipts_by_block(&self, block_number: u64) -> &[Option<T>]
pub fn receipts_by_block(&self, block_number: u64) -> &[Option<T>]
Return all block receipts
pub const fn first_block(&self) -> u64
pub const fn first_block(&self) -> u64
Return first block of the execution outcome
pub fn revert_to(&mut self, block_number: u64) -> bool
pub fn revert_to(&mut self, block_number: u64) -> bool
Revert the state to the given block number.
Returns false if the block number is not in the bundle state.
§Note
The provided block number will stay inside the bundle state.
pub fn split_at(
self,
at: u64,
) -> (Option<ExecutionOutcome<T>>, ExecutionOutcome<T>)where
T: Clone,
pub fn split_at(
self,
at: u64,
) -> (Option<ExecutionOutcome<T>>, ExecutionOutcome<T>)where
T: Clone,
Splits the block range state at a given block number. Returns two split states ([..at], [at..]). The plain state of the 2nd bundle state will contain extra changes that were made in state transitions belonging to the lower state.
§Panics
If the target block number is not included in the state block range.
pub fn extend(&mut self, other: ExecutionOutcome<T>)
pub fn extend(&mut self, other: ExecutionOutcome<T>)
Extend one state from another
For state this is very sensitive operation and should be used only when we know that other state was build on top of this one. In most cases this would be true.
pub fn prepend_state(&mut self, other: BundleState)
pub fn prepend_state(&mut self, other: BundleState)
Prepends present the state with the given BundleState
.
It adds changes from the given state but does not override any existing changes.
Reverts and receipts are not updated.
pub fn with_receipts(self, receipts: Receipts<T>) -> ExecutionOutcome<T>
pub fn with_receipts(self, receipts: Receipts<T>) -> ExecutionOutcome<T>
Create a new instance with updated receipts.
pub fn with_requests(self, requests: Vec<Requests>) -> ExecutionOutcome<T>
pub fn with_requests(self, requests: Vec<Requests>) -> ExecutionOutcome<T>
Create a new instance with updated requests.
pub fn changed_accounts(&self) -> impl Iterator<Item = ChangedAccount>
pub fn changed_accounts(&self) -> impl Iterator<Item = ChangedAccount>
Returns an iterator over all changed accounts from the ExecutionOutcome
.
This method filters the accounts to return only those that have undergone changes
and maps them into ChangedAccount
instances, which include the address, nonce, and
balance.
§impl<T> ExecutionOutcome<T>where
T: Receipt<Log = Log>,
impl<T> ExecutionOutcome<T>where
T: Receipt<Log = Log>,
§impl ExecutionOutcome
impl ExecutionOutcome
pub fn ethereum_receipts_root(
&self,
_block_number: u64,
) -> Option<FixedBytes<32>>
pub fn ethereum_receipts_root( &self, _block_number: u64, ) -> Option<FixedBytes<32>>
Returns the ethereum receipt root for all recorded receipts.
Note: this function calculated Bloom filters for every receipt and created merkle trees of receipt. This is a expensive operation.
Trait Implementations§
§impl<T> Clone for ExecutionOutcome<T>where
T: Clone,
impl<T> Clone for ExecutionOutcome<T>where
T: Clone,
§fn clone(&self) -> ExecutionOutcome<T>
fn clone(&self) -> ExecutionOutcome<T>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl<T> Debug for ExecutionOutcome<T>where
T: Debug,
impl<T> Debug for ExecutionOutcome<T>where
T: Debug,
§impl<T> Default for ExecutionOutcome<T>
impl<T> Default for ExecutionOutcome<T>
§fn default() -> ExecutionOutcome<T>
fn default() -> ExecutionOutcome<T>
§impl<'de, T> Deserialize<'de> for ExecutionOutcome<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for ExecutionOutcome<T>where
T: Deserialize<'de>,
§fn deserialize<__D>(
__deserializer: __D,
) -> Result<ExecutionOutcome<T>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<ExecutionOutcome<T>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
§impl ExecutionDataProvider for ExecutionOutcome
impl ExecutionDataProvider for ExecutionOutcome
§fn block_hash(&self, _block_number: u64) -> Option<FixedBytes<32>>
fn block_hash(&self, _block_number: u64) -> Option<FixedBytes<32>>
Always returns None because we don’t have any information about the block header.
§fn execution_outcome(&self) -> &ExecutionOutcome
fn execution_outcome(&self) -> &ExecutionOutcome
§impl<T> From<(BlockExecutionOutput<T>, u64)> for ExecutionOutcome<T>
impl<T> From<(BlockExecutionOutput<T>, u64)> for ExecutionOutcome<T>
§fn from(value: (BlockExecutionOutput<T>, u64)) -> ExecutionOutcome<T>
fn from(value: (BlockExecutionOutput<T>, u64)) -> ExecutionOutcome<T>
§impl<T> PartialEq for ExecutionOutcome<T>where
T: PartialEq,
impl<T> PartialEq for ExecutionOutcome<T>where
T: PartialEq,
§impl<T> Serialize for ExecutionOutcome<T>where
T: Serialize,
impl<T> Serialize for ExecutionOutcome<T>where
T: Serialize,
§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<T> Eq for ExecutionOutcome<T>where
T: Eq,
impl<T> StructuralPartialEq for ExecutionOutcome<T>
Auto Trait Implementations§
impl<T> Freeze for ExecutionOutcome<T>
impl<T> RefUnwindSafe for ExecutionOutcome<T>where
T: RefUnwindSafe,
impl<T> Send for ExecutionOutcome<T>where
T: Send,
impl<T> Sync for ExecutionOutcome<T>where
T: Sync,
impl<T> Unpin for ExecutionOutcome<T>where
T: Unpin,
impl<T> UnwindSafe for ExecutionOutcome<T>where
T: UnwindSafe,
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
key
and return true
if they are equal.§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<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> 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>
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeDebug for Twhere
T: Debug,
impl<T> MaybeSendSync for T
impl<T> MaybeSerde for Twhere
T: Serialize + for<'de> Deserialize<'de>,
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: 176 bytes