Struct sp_state_machine::TrieBackend
source · [−]pub struct TrieBackend<S: TrieBackendStorage<H>, H: Hasher> { /* private fields */ }
Expand description
Patricia trie-based backend. Transaction type is an overlay of changes to commit.
Implementations
sourceimpl<H: Hasher> TrieBackend<MemoryDB<H>, H> where
H::Out: Codec + Ord,
impl<H: Hasher> TrieBackend<MemoryDB<H>, H> where
H::Out: Codec + Ord,
sourcepub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&self,
changes: T
) -> Self
pub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&self,
changes: T
) -> Self
Copy the state, with applied updates
sourcepub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&mut self,
changes: T
)
pub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&mut self,
changes: T
)
Insert values into backend trie.
sourcepub fn update_backend(&self, root: H::Out, changes: MemoryDB<H>) -> Self
pub fn update_backend(&self, root: H::Out, changes: MemoryDB<H>) -> Self
Merge trie nodes into this backend.
sourcepub fn apply_transaction(&mut self, root: H::Out, transaction: MemoryDB<H>)
pub fn apply_transaction(&mut self, root: H::Out, transaction: MemoryDB<H>)
Apply the given transaction to this backend and set the root to the given value.
sourceimpl<S: TrieBackendStorage<H>, H: Hasher> TrieBackend<S, H> where
H::Out: Codec,
impl<S: TrieBackendStorage<H>, H: Hasher> TrieBackend<S, H> where
H::Out: Codec,
sourcepub fn backend_storage(&self) -> &S
pub fn backend_storage(&self) -> &S
Get backend storage reference.
sourcepub fn backend_storage_mut(&mut self) -> &mut S
pub fn backend_storage_mut(&mut self) -> &mut S
Get backend storage reference.
sourcepub fn into_storage(self) -> S
pub fn into_storage(self) -> S
Consumes self and returns underlying storage.
Trait Implementations
sourceimpl<S: TrieBackendStorage<H>, H: Hasher> Backend<H> for TrieBackend<S, H> where
H::Out: Ord + Codec,
impl<S: TrieBackendStorage<H>, H: Hasher> Backend<H> for TrieBackend<S, H> where
H::Out: Ord + Codec,
type Error = DefaultError
type Error = DefaultError
An error type when fetching data is not possible.
type Transaction = S::Overlay
type Transaction = S::Overlay
Storage changes to be applied if committing
type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
sourcefn 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.
sourcefn 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 keyed child storage or None if there is nothing associated.
sourcefn 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.
sourcefn 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.
sourcefn for_keys_with_prefix<F: FnMut(&[u8])>(&self, prefix: &[u8], f: F)
fn for_keys_with_prefix<F: FnMut(&[u8])>(&self, prefix: &[u8], f: F)
Retrieve all entries keys which start with the given prefix and
call f
for each of those keys. Read more
sourcefn for_key_values_with_prefix<F: FnMut(&[u8], &[u8])>(
&self,
prefix: &[u8],
f: F
)
fn for_key_values_with_prefix<F: FnMut(&[u8], &[u8])>(
&self,
prefix: &[u8],
f: F
)
Retrieve all entries keys and values of which start with the given prefix and
call f
for each of those keys. Read more
sourcefn apply_to_child_keys_while<F: FnMut(&[u8]) -> bool>(
&self,
child_info: &ChildInfo,
f: F
)
fn apply_to_child_keys_while<F: FnMut(&[u8]) -> bool>(
&self,
child_info: &ChildInfo,
f: F
)
Retrieve all entries keys of child storage and call f
for each of those keys.
Aborts as soon as f
returns false. Read more
sourcefn for_child_keys_with_prefix<F: FnMut(&[u8])>(
&self,
child_info: &ChildInfo,
prefix: &[u8],
f: F
)
fn for_child_keys_with_prefix<F: FnMut(&[u8])>(
&self,
child_info: &ChildInfo,
prefix: &[u8],
f: F
)
Retrieve all child entries keys which start with the given prefix and
call f
for each of those keys. Read more
sourcefn pairs(&self) -> Vec<(StorageKey, StorageValue)>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
fn pairs(&self) -> Vec<(StorageKey, StorageValue)>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
Get all key/value pairs into a Vec.
sourcefn keys(&self, prefix: &[u8]) -> Vec<StorageKey>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
fn keys(&self, prefix: &[u8]) -> Vec<StorageKey>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
Get all keys with given prefix
sourcefn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>
) -> (H::Out, Self::Transaction) where
H::Out: Ord,
fn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>
) -> (H::Out, Self::Transaction) where
H::Out: Ord,
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. Read more
sourcefn child_storage_root<'a>(
&self,
child_info: &ChildInfo,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>
) -> (H::Out, bool, Self::Transaction) where
H::Out: Ord,
fn child_storage_root<'a>(
&self,
child_info: &ChildInfo,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>
) -> (H::Out, bool, Self::Transaction) where
H::Out: Ord,
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. Read more
sourcefn as_trie_backend(
&mut self
) -> Option<&TrieBackend<Self::TrieBackendStorage, H>>
fn as_trie_backend(
&mut self
) -> Option<&TrieBackend<Self::TrieBackendStorage, H>>
Try convert into trie backend.
sourcefn register_overlay_stats(&mut self, _stats: &StateMachineStats)
fn register_overlay_stats(&mut self, _stats: &StateMachineStats)
Register stats from overlay of state machine. Read more
sourcefn usage_info(&self) -> UsageInfo
fn usage_info(&self) -> UsageInfo
Query backend usage statistics (i/o, memory) Read more
sourcefn 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.
sourcefn 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.
sourcefn 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.
sourcefn 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.
sourcefn child_keys(&self, child_info: &ChildInfo, prefix: &[u8]) -> Vec<StorageKey>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
fn child_keys(&self, child_info: &ChildInfo, prefix: &[u8]) -> Vec<StorageKey>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
Get all keys of child storage with given prefix
sourcefn 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]>)>)>
) -> (H::Out, Self::Transaction) where
H::Out: Ord + Encode,
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]>)>)>
) -> (H::Out, Self::Transaction) where
H::Out: Ord + Encode,
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. Read more
sourcefn commit(
&self,
_: H::Out,
_: Self::Transaction,
_: StorageCollection,
_: ChildStorageCollection
) -> Result<(), Self::Error>
fn commit(
&self,
_: H::Out,
_: Self::Transaction,
_: StorageCollection,
_: ChildStorageCollection
) -> Result<(), Self::Error>
Commit given transaction to storage.
sourcefn reset_read_write_count(&self)
fn reset_read_write_count(&self)
Get the read/write count of the db
sourcefn get_whitelist(&self) -> Vec<TrackedStorageKey>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
fn get_whitelist(&self) -> Vec<TrackedStorageKey>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
Get the whitelist for tracking db reads/writes
sourcefn set_whitelist(&self, _: Vec<TrackedStorageKey>)
fn set_whitelist(&self, _: Vec<TrackedStorageKey>)
Update the whitelist for tracking db reads/writes
sourceimpl<S: TrieBackendStorage<H>, H: Hasher> Debug for TrieBackend<S, H>
impl<S: TrieBackendStorage<H>, H: Hasher> Debug for TrieBackend<S, H>
sourceimpl<H: Hasher> From<BTreeMap<Vec<u8, Global>, Vec<u8, Global>>> for TrieBackend<MemoryDB<H>, H> where
H::Out: Codec + Ord,
impl<H: Hasher> From<BTreeMap<Vec<u8, Global>, Vec<u8, Global>>> for TrieBackend<MemoryDB<H>, H> where
H::Out: Codec + Ord,
sourcefn from(inner: BTreeMap<StorageKey, StorageValue>) -> Self
fn from(inner: BTreeMap<StorageKey, StorageValue>) -> Self
Performs the conversion.
sourceimpl<H: Hasher> From<HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>>, RandomState>> for TrieBackend<MemoryDB<H>, H> where
H::Out: Codec + Ord,
impl<H: Hasher> From<HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>>, RandomState>> for TrieBackend<MemoryDB<H>, H> where
H::Out: Codec + Ord,
sourcefn from(
inner: HashMap<Option<ChildInfo>, BTreeMap<StorageKey, StorageValue>>
) -> Self
fn from(
inner: HashMap<Option<ChildInfo>, BTreeMap<StorageKey, StorageValue>>
) -> Self
Performs the conversion.
Auto Trait Implementations
impl<S, H> RefUnwindSafe for TrieBackend<S, H> where
S: RefUnwindSafe,
<H as Hasher>::Out: RefUnwindSafe,
impl<S, H> Send for TrieBackend<S, H>
impl<S, H> Sync for TrieBackend<S, H>
impl<S, H> Unpin for TrieBackend<S, H> where
S: Unpin,
<H as Hasher>::Out: Unpin,
impl<S, H> UnwindSafe for TrieBackend<S, H> where
S: UnwindSafe,
<H as Hasher>::Out: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more
sourceimpl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,
sourcepub fn unchecked_into(self) -> T
pub fn unchecked_into(self) -> T
The counterpart to unchecked_from
.