Struct sp_state_machine::TrieBackend
source · pub struct TrieBackend<S: TrieBackendStorage<H>, H: Hasher, C = LocalTrieCache<H>> { /* private fields */ }
Expand description
Patricia trie-based backend. Transaction type is an overlay of changes to commit.
Implementations§
source§impl<H: Hasher> TrieBackend<PrefixedMemoryDB<H>, H>
impl<H: Hasher> TrieBackend<PrefixedMemoryDB<H>, H>
sourcepub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&self,
changes: T,
state_version: StateVersion
) -> Self
pub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>( &self, changes: T, state_version: StateVersion ) -> Self
Copy the state, with applied updates
sourcepub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&mut self,
changes: T,
state_version: StateVersion
)
pub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>( &mut self, changes: T, state_version: StateVersion )
Insert values into backend trie.
sourcepub fn update_backend(&self, root: H::Out, changes: PrefixedMemoryDB<H>) -> Self
pub fn update_backend(&self, root: H::Out, changes: PrefixedMemoryDB<H>) -> Self
Merge trie nodes into this backend.
sourcepub fn apply_transaction(
&mut self,
root: H::Out,
transaction: PrefixedMemoryDB<H>
)
pub fn apply_transaction( &mut self, root: H::Out, transaction: PrefixedMemoryDB<H> )
Apply the given transaction to this backend and set the root to the given value.
source§impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync> TrieBackend<S, H, C>
impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync> TrieBackend<S, H, C>
sourcepub fn backend_storage_mut(&mut self) -> &mut S
pub fn backend_storage_mut(&mut self) -> &mut S
Get backend storage reference.
sourcepub fn backend_storage(&self) -> &S
pub fn backend_storage(&self) -> &S
Get backend storage reference.
sourcepub fn into_storage(self) -> S
pub fn into_storage(self) -> S
Consumes self and returns underlying storage.
sourcepub fn extract_proof(self) -> Option<StorageProof>
pub fn extract_proof(self) -> Option<StorageProof>
Extract the StorageProof
.
This only returns Some
when there was a recorder set.
Trait Implementations§
source§impl<S: TrieBackendStorage<H>, H: Hasher, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>
impl<S: TrieBackendStorage<H>, H: Hasher, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>
§type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
source§fn as_trie_backend(&self) -> &TrieBackend<S, H, C>
fn as_trie_backend(&self) -> &TrieBackend<S, H, C>
Return the type as
TrieBackend
.source§impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C>
impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C>
§type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
source§fn storage_hash(&self, key: &[u8]) -> Result<Option<H::Out>, Self::Error>
fn storage_hash(&self, key: &[u8]) -> Result<Option<H::Out>, Self::Error>
Get keyed storage value hash or None if there is nothing associated.
source§fn storage(&self, key: &[u8]) -> Result<Option<StorageValue>, Self::Error>
fn storage(&self, key: &[u8]) -> Result<Option<StorageValue>, Self::Error>
Get keyed storage or None if there is nothing associated.
source§fn child_storage_hash(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<H::Out>, Self::Error>
fn child_storage_hash( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<H::Out>, Self::Error>
Get child keyed storage value hash or None if there is nothing associated.
source§fn child_storage(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<StorageValue>, Self::Error>
fn child_storage( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<StorageValue>, Self::Error>
Get child keyed child storage or None if there is nothing associated.
source§fn closest_merkle_value(
&self,
key: &[u8]
) -> Result<Option<MerkleValue<H::Out>>, Self::Error>
fn closest_merkle_value( &self, key: &[u8] ) -> Result<Option<MerkleValue<H::Out>>, Self::Error>
Get the merkle value or None if there is nothing associated.
source§fn child_closest_merkle_value(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<MerkleValue<H::Out>>, Self::Error>
fn child_closest_merkle_value( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<MerkleValue<H::Out>>, Self::Error>
Get the child merkle value or None if there is nothing associated.
source§fn next_storage_key(
&self,
key: &[u8]
) -> Result<Option<StorageKey>, Self::Error>
fn next_storage_key( &self, key: &[u8] ) -> Result<Option<StorageKey>, Self::Error>
Return the next key in storage in lexicographic order or
None
if there is no value.source§fn next_child_storage_key(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<StorageKey>, Self::Error>
fn next_child_storage_key( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<StorageKey>, Self::Error>
Return the next key in child storage in lexicographic order or
None
if there is no value.source§fn raw_iter(&self, args: IterArgs<'_>) -> Result<Self::RawIter, Self::Error>
fn raw_iter(&self, args: IterArgs<'_>) -> Result<Self::RawIter, Self::Error>
Returns a lifetimeless raw storage iterator.
source§fn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion
) -> (H::Out, PrefixedMemoryDB<H>)
fn storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion ) -> (H::Out, PrefixedMemoryDB<H>)
Calculate the storage root, with given delta over what is already stored in
the backend, and produce a “transaction” that can be used to commit.
Does not include child storage updates.
source§fn child_storage_root<'a>(
&self,
child_info: &ChildInfo,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion
) -> (H::Out, bool, PrefixedMemoryDB<H>)
fn child_storage_root<'a>( &self, child_info: &ChildInfo, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion ) -> (H::Out, bool, PrefixedMemoryDB<H>)
Calculate the child storage root, with given delta over what is already stored in
the backend, and produce a “transaction” that can be used to commit. The second argument
is true if child storage root equals default storage root.
source§fn register_overlay_stats(&self, _stats: &StateMachineStats)
fn register_overlay_stats(&self, _stats: &StateMachineStats)
Register stats from overlay of state machine. Read more
source§fn usage_info(&self) -> UsageInfo
fn usage_info(&self) -> UsageInfo
Query backend usage statistics (i/o, memory) Read more
source§fn exists_storage(&self, key: &[u8]) -> Result<bool, Self::Error>
fn exists_storage(&self, key: &[u8]) -> Result<bool, Self::Error>
true if a key exists in storage.
source§fn exists_child_storage(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<bool, Self::Error>
fn exists_child_storage( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<bool, Self::Error>
true if a key exists in child storage.
source§fn pairs<'a>(
&'a self,
args: IterArgs<'_>
) -> Result<PairsIter<'a, H, Self::RawIter>, Self::Error>
fn pairs<'a>( &'a self, args: IterArgs<'_> ) -> Result<PairsIter<'a, H, Self::RawIter>, Self::Error>
Get an iterator over key/value pairs.
source§fn keys<'a>(
&'a self,
args: IterArgs<'_>
) -> Result<KeysIter<'a, H, Self::RawIter>, Self::Error>
fn keys<'a>( &'a self, args: IterArgs<'_> ) -> Result<KeysIter<'a, H, Self::RawIter>, Self::Error>
Get an iterator over keys.
source§fn full_storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
child_deltas: impl Iterator<Item = (&'a ChildInfo, impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>)>,
state_version: StateVersion
) -> (H::Out, BackendTransaction<H>)
fn full_storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, child_deltas: impl Iterator<Item = (&'a ChildInfo, impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>)>, state_version: StateVersion ) -> (H::Out, BackendTransaction<H>)
Calculate the storage root, with given delta over what is already stored
in the backend, and produce a “transaction” that can be used to commit.
Does include child storage updates.
source§fn commit(
&self,
_: H::Out,
_: BackendTransaction<H>,
_: StorageCollection,
_: ChildStorageCollection
) -> Result<(), Self::Error>
fn commit( &self, _: H::Out, _: BackendTransaction<H>, _: StorageCollection, _: ChildStorageCollection ) -> Result<(), Self::Error>
Commit given transaction to storage.
source§fn reset_read_write_count(&self)
fn reset_read_write_count(&self)
Get the read/write count of the db
source§fn get_whitelist(&self) -> Vec<TrackedStorageKey>
fn get_whitelist(&self) -> Vec<TrackedStorageKey>
Get the whitelist for tracking db reads/writes
source§fn set_whitelist(&self, _: Vec<TrackedStorageKey>)
fn set_whitelist(&self, _: Vec<TrackedStorageKey>)
Update the whitelist for tracking db reads/writes
source§fn proof_size(&self) -> Option<u32>
fn proof_size(&self) -> Option<u32>
Estimate proof size
source§impl<H: Hasher> Clone for TrieBackend<PrefixedMemoryDB<H>, H>
impl<H: Hasher> Clone for TrieBackend<PrefixedMemoryDB<H>, H>
source§impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H>> Debug for TrieBackend<S, H, C>
impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H>> Debug for TrieBackend<S, H, C>
source§impl<H> Default for TrieBackend<PrefixedMemoryDB<H>, H>
impl<H> Default for TrieBackend<PrefixedMemoryDB<H>, H>
source§impl<H: Hasher> From<(BTreeMap<Vec<u8>, Vec<u8>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>
impl<H: Hasher> From<(BTreeMap<Vec<u8>, Vec<u8>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>
source§fn from(
(inner, state_version): (BTreeMap<StorageKey, StorageValue>, StateVersion)
) -> Self
fn from( (inner, state_version): (BTreeMap<StorageKey, StorageValue>, StateVersion) ) -> Self
Converts to this type from the input type.
source§impl<H: Hasher> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8>, Vec<u8>>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>
impl<H: Hasher> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8>, Vec<u8>>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>
source§fn from(
(inner, state_version): (HashMap<Option<ChildInfo>, BTreeMap<StorageKey, StorageValue>>, StateVersion)
) -> Self
fn from( (inner, state_version): (HashMap<Option<ChildInfo>, BTreeMap<StorageKey, StorageValue>>, StateVersion) ) -> Self
Converts to this type from the input type.
source§impl<H: Hasher> From<(Storage, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>
impl<H: Hasher> From<(Storage, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>
Auto Trait Implementations§
impl<S, H, C = LocalTrieCache<H>> !RefUnwindSafe for TrieBackend<S, H, C>
impl<S, H, C> Send for TrieBackend<S, H, C>where
C: Send,
impl<S, H, C> Sync for TrieBackend<S, H, C>
impl<S, H, C> Unpin for TrieBackend<S, H, C>
impl<S, H, C = LocalTrieCache<H>> !UnwindSafe for TrieBackend<S, H, C>
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
Mutably borrows from an owned value. Read more
source§impl<H, B> InspectState<H, B> for B
impl<H, B> InspectState<H, B> for B
source§fn inspect_state<F, R>(&self, f: F) -> Rwhere
F: FnOnce() -> R,
fn inspect_state<F, R>(&self, f: F) -> Rwhere
F: FnOnce() -> R,
Inspect state with a closure. Read more
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, 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
The counterpart to
unchecked_from
.