Struct sp_state_machine::OverlayedChanges
source · pub struct OverlayedChanges<H: Hasher> { /* private fields */ }
Expand description
The set of changes that are overlaid onto the backend.
It allows changes to be modified using nestable transactions.
Implementations§
source§impl<H: Hasher> OverlayedChanges<H>
impl<H: Hasher> OverlayedChanges<H>
sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Whether no changes are contained in the top nor in any of the child changes.
sourcepub fn set_collect_extrinsics(&mut self, collect_extrinsics: bool)
pub fn set_collect_extrinsics(&mut self, collect_extrinsics: bool)
Ask to collect/not to collect extrinsics indices where key(s) has been changed.
sourcepub fn storage(&mut self, key: &[u8]) -> Option<Option<&[u8]>>
pub fn storage(&mut self, key: &[u8]) -> Option<Option<&[u8]>>
Returns a double-Option: None if the key is unknown (i.e. and the query should be referred to the backend); Some(None) if the key has been deleted. Some(Some(…)) for a key whose value has been set.
sourcepub fn child_storage(
&mut self,
child_info: &ChildInfo,
key: &[u8],
) -> Option<Option<&[u8]>>
pub fn child_storage( &mut self, child_info: &ChildInfo, key: &[u8], ) -> Option<Option<&[u8]>>
Returns a double-Option: None if the key is unknown (i.e. and the query should be referred to the backend); Some(None) if the key has been deleted. Some(Some(…)) for a key whose value has been set.
sourcepub fn set_storage(&mut self, key: StorageKey, val: Option<StorageValue>)
pub fn set_storage(&mut self, key: StorageKey, val: Option<StorageValue>)
Set a new value for the specified key.
Can be rolled back or committed when called inside a transaction.
sourcepub fn append_storage(
&mut self,
key: StorageKey,
element: StorageValue,
init: impl Fn() -> StorageValue,
)
pub fn append_storage( &mut self, key: StorageKey, element: StorageValue, init: impl Fn() -> StorageValue, )
Append a element to storage, init with existing value if first write.
sourcepub fn set_child_storage(
&mut self,
child_info: &ChildInfo,
key: StorageKey,
val: Option<StorageValue>,
)
pub fn set_child_storage( &mut self, child_info: &ChildInfo, key: StorageKey, val: Option<StorageValue>, )
Set a new value for the specified key and child.
None
can be used to delete a value specified by the given key.
Can be rolled back or committed when called inside a transaction.
sourcepub fn clear_child_storage(&mut self, child_info: &ChildInfo) -> u32
pub fn clear_child_storage(&mut self, child_info: &ChildInfo) -> u32
Clear child storage of given storage key.
Can be rolled back or committed when called inside a transaction.
sourcepub fn clear_prefix(&mut self, prefix: &[u8]) -> u32
pub fn clear_prefix(&mut self, prefix: &[u8]) -> u32
Removes all key-value pairs which keys share the given prefix.
Can be rolled back or committed when called inside a transaction.
sourcepub fn clear_child_prefix(
&mut self,
child_info: &ChildInfo,
prefix: &[u8],
) -> u32
pub fn clear_child_prefix( &mut self, child_info: &ChildInfo, prefix: &[u8], ) -> u32
Removes all key-value pairs which keys share the given prefix.
Can be rolled back or committed when called inside a transaction
sourcepub fn transaction_depth(&self) -> usize
pub fn transaction_depth(&self) -> usize
Returns the current nesting depth of the transaction stack.
A value of zero means that no transaction is open and changes are committed on write.
sourcepub fn start_transaction(&mut self)
pub fn start_transaction(&mut self)
Start a new nested transaction.
This allows to either commit or roll back all changes that where made while this
transaction was open. Any transaction must be closed by either rollback_transaction
or
commit_transaction
before this overlay can be converted into storage changes.
Changes made without any open transaction are committed immediately.
sourcepub fn rollback_transaction(&mut self) -> Result<(), NoOpenTransaction>
pub fn rollback_transaction(&mut self) -> Result<(), NoOpenTransaction>
Rollback the last transaction started by start_transaction
.
Any changes made during that transaction are discarded. Returns an error if there is no open transaction that can be rolled back.
sourcepub fn commit_transaction(&mut self) -> Result<(), NoOpenTransaction>
pub fn commit_transaction(&mut self) -> Result<(), NoOpenTransaction>
Commit the last transaction started by start_transaction
.
Any changes made during that transaction are committed. Returns an error if there is no open transaction that can be committed.
sourcepub fn enter_runtime(&mut self) -> Result<(), AlreadyInRuntime>
pub fn enter_runtime(&mut self) -> Result<(), AlreadyInRuntime>
Call this before transferring control to the runtime.
This protects all existing transactions from being removed by the runtime. Calling this while already inside the runtime will return an error.
sourcepub fn exit_runtime(&mut self) -> Result<(), NotInRuntime>
pub fn exit_runtime(&mut self) -> Result<(), NotInRuntime>
Call this when control returns from the runtime.
This rollbacks all dangling transaction left open by the runtime. Calling this while outside the runtime will return an error.
sourcepub fn offchain_drain_committed(
&mut self,
) -> impl Iterator<Item = ((StorageKey, StorageKey), OffchainOverlayedChange)>
pub fn offchain_drain_committed( &mut self, ) -> impl Iterator<Item = ((StorageKey, StorageKey), OffchainOverlayedChange)>
Consume all changes (top + children) and return them.
After calling this function no more changes are contained in this changeset.
Panics:
Panics if transaction_depth() > 0
sourcepub fn children(
&self,
) -> impl Iterator<Item = (impl Iterator<Item = (&StorageKey, &OverlayedEntry<StorageEntry>)>, &ChildInfo)>
pub fn children( &self, ) -> impl Iterator<Item = (impl Iterator<Item = (&StorageKey, &OverlayedEntry<StorageEntry>)>, &ChildInfo)>
Get an iterator over all child changes as seen by the current transaction.
sourcepub fn children_mut(
&mut self,
) -> impl Iterator<Item = (impl Iterator<Item = (&StorageKey, &mut OverlayedEntry<StorageEntry>)>, &ChildInfo)>
pub fn children_mut( &mut self, ) -> impl Iterator<Item = (impl Iterator<Item = (&StorageKey, &mut OverlayedEntry<StorageEntry>)>, &ChildInfo)>
Get an iterator over all child changes as seen by the current transaction.
sourcepub fn changes(
&self,
) -> impl Iterator<Item = (&StorageKey, &OverlayedEntry<StorageEntry>)>
pub fn changes( &self, ) -> impl Iterator<Item = (&StorageKey, &OverlayedEntry<StorageEntry>)>
Get an iterator over all top changes as been by the current transaction.
sourcepub fn changes_mut(
&mut self,
) -> impl Iterator<Item = (&StorageKey, &mut OverlayedEntry<StorageEntry>)>
pub fn changes_mut( &mut self, ) -> impl Iterator<Item = (&StorageKey, &mut OverlayedEntry<StorageEntry>)>
Get an iterator over all top changes as been by the current transaction.
sourcepub fn child_changes(
&self,
key: &[u8],
) -> Option<(impl Iterator<Item = (&StorageKey, &OverlayedEntry<StorageEntry>)>, &ChildInfo)>
pub fn child_changes( &self, key: &[u8], ) -> Option<(impl Iterator<Item = (&StorageKey, &OverlayedEntry<StorageEntry>)>, &ChildInfo)>
Get an optional iterator over all child changes stored under the supplied key.
sourcepub fn child_changes_mut(
&mut self,
key: &[u8],
) -> Option<(impl Iterator<Item = (&StorageKey, &mut OverlayedEntry<StorageEntry>)>, &ChildInfo)>
pub fn child_changes_mut( &mut self, key: &[u8], ) -> Option<(impl Iterator<Item = (&StorageKey, &mut OverlayedEntry<StorageEntry>)>, &ChildInfo)>
Get an optional iterator over all child changes stored under the supplied key.
sourcepub fn transaction_index_ops(&self) -> &[IndexOperation]
pub fn transaction_index_ops(&self) -> &[IndexOperation]
Get an list of all index operations.
sourcepub fn drain_storage_changes<B: Backend<H>>(
&mut self,
backend: &B,
state_version: StateVersion,
) -> Result<StorageChanges<H>, DefaultError>
pub fn drain_storage_changes<B: Backend<H>>( &mut self, backend: &B, state_version: StateVersion, ) -> Result<StorageChanges<H>, DefaultError>
Drain all changes into a StorageChanges
instance. Leave empty overlay in place.
sourcepub fn storage_root<B: Backend<H>>(
&mut self,
backend: &B,
state_version: StateVersion,
) -> (H::Out, bool)
pub fn storage_root<B: Backend<H>>( &mut self, backend: &B, state_version: StateVersion, ) -> (H::Out, bool)
Generate the storage root using backend
and all changes
as seen by the current transaction.
Returns the storage root and whether it was already cached.
sourcepub fn child_storage_root<B: Backend<H>>(
&mut self,
child_info: &ChildInfo,
backend: &B,
state_version: StateVersion,
) -> Result<(H::Out, bool), B::Error>
pub fn child_storage_root<B: Backend<H>>( &mut self, child_info: &ChildInfo, backend: &B, state_version: StateVersion, ) -> Result<(H::Out, bool), B::Error>
Generate the child storage root using backend
and all child changes
as seen by the current transaction.
Returns the child storage root and whether it was already cached.
sourcepub fn iter_after(
&mut self,
key: &[u8],
) -> impl Iterator<Item = (&[u8], &mut OverlayedEntry<StorageEntry>)>
pub fn iter_after( &mut self, key: &[u8], ) -> impl Iterator<Item = (&[u8], &mut OverlayedEntry<StorageEntry>)>
Returns an iterator over the keys (in lexicographic order) following key
(excluding key
)
alongside its value.
sourcepub fn child_iter_after(
&mut self,
storage_key: &[u8],
key: &[u8],
) -> impl Iterator<Item = (&[u8], &mut OverlayedEntry<StorageEntry>)>
pub fn child_iter_after( &mut self, storage_key: &[u8], key: &[u8], ) -> impl Iterator<Item = (&[u8], &mut OverlayedEntry<StorageEntry>)>
Returns an iterator over the keys (in lexicographic order) following key
(excluding key
)
alongside its value for the given storage_key
child.
sourcepub fn offchain(&self) -> &OffchainOverlayedChanges
pub fn offchain(&self) -> &OffchainOverlayedChanges
Read only access ot offchain overlay.
sourcepub fn set_offchain_storage(&mut self, key: &[u8], value: Option<&[u8]>)
pub fn set_offchain_storage(&mut self, key: &[u8], value: Option<&[u8]>)
Write a key value pair to the offchain storage overlay.
sourcepub fn add_transaction_index(&mut self, op: IndexOperation)
pub fn add_transaction_index(&mut self, op: IndexOperation)
Add transaction index operation.
Trait Implementations§
source§impl<H: Hasher> Clone for OverlayedChanges<H>
impl<H: Hasher> Clone for OverlayedChanges<H>
source§impl<H: Hasher> Debug for OverlayedChanges<H>
impl<H: Hasher> Debug for OverlayedChanges<H>
source§impl<H: Hasher> Default for OverlayedChanges<H>
impl<H: Hasher> Default for OverlayedChanges<H>
Auto Trait Implementations§
impl<H> !Freeze for OverlayedChanges<H>
impl<H> !RefUnwindSafe for OverlayedChanges<H>
impl<H> Send for OverlayedChanges<H>
impl<H> !Sync for OverlayedChanges<H>
impl<H> Unpin for OverlayedChanges<H>
impl<H> UnwindSafe for OverlayedChanges<H>
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,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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 moresource§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.