Struct sp_state_machine::TrieBackend

[+] Show declaration

pub struct TrieBackend<S: TrieBackendStorage<H>, H: Hasher> { /* fields omitted */ }

[−] Expand description

Patricia trie-based backend. Transaction type is an overlay of changes to commit.

Implementations

impl<H: Hasher> TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [−]

pub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
    &self,
    changes: T
) -> Self[−]

Copy the state, with applied updates

pub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
    &mut self,
    changes: T
)[−]

Insert values into backend trie.

pub fn update_backend(&self, root: H::Out, changes: MemoryDB<H>) -> Self[−]

Merge trie nodes into this backend.

pub fn eq(&self, other: &Self) -> bool[−]

Compare with another in-memory backend.

impl<S: TrieBackendStorage<H>, H: Hasher> TrieBackend<S, H> where
    H::Out: Codec, [−]

pub fn new(storage: S, root: H::Out) -> Self[−]

Create new trie-based backend.

pub fn essence(&self) -> &TrieBackendEssence<S, H>[−]

Get backend essence reference.

pub fn backend_storage(&self) -> &S[−]

Get backend storage reference.

pub fn backend_storage_mut(&mut self) -> &mut S[−]

Get backend storage reference.

pub fn root(&self) -> &H::Out[−]

Get trie root.

pub fn into_storage(self) -> S[−]

Consumes self and returns underlying storage.

Trait Implementations

impl<S: TrieBackendStorage<H>, H: Hasher> Backend<H> for TrieBackend<S, H> where
    H::Out: Ord + Codec, [+]

[+] Show hidden undocumented items

type Error = String

An error type when fetching data is not possible.

type Transaction = S::Overlay

Storage changes to be applied if committing

type TrieBackendStorage = S

Type of trie backend storage.

fn storage(&self, key: &[u8]) -> Result<Option<StorageValue>, Self::Error>[−]

Get keyed storage or None if there is nothing associated.

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.

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.

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.

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.

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.

fn for_keys_in_child_storage<F: FnMut(&[u8])>(
    &self,
    child_info: &ChildInfo,
    f: F
)[−]

Retrieve all entries keys of child storage and call f for each of those keys.

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.

fn pairs(&self) -> Vec<(StorageKey, StorageValue)>[−]

Get all key/value pairs into a Vec.

fn keys(&self, prefix: &[u8]) -> Vec<StorageKey>[−]

Get all keys with given prefix

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.

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.

fn as_trie_backend(
    &mut self
) -> Option<&TrieBackend<Self::TrieBackendStorage, H>>[−]

Try convert into trie backend.

fn register_overlay_stats(&mut self, _stats: &StateMachineStats)[−]

Register stats from overlay of state machine.

fn usage_info(&self) -> UsageInfo[−]

Query backend usage statistics (i/o, memory)

fn wipe(&self) -> Result<(), Self::Error>[−]

Wipe the state database.

fn storage_hash(&self, key: &[u8]) -> Result<Option<H::Out>, Self::Error>[−]

Get keyed storage value hash or None if there is nothing associated.

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.

fn exists_storage(&self, key: &[u8]) -> Result<bool, Self::Error>[−]

true if a key exists in storage.

fn exists_child_storage(
    &self,
    child_info: &ChildInfo,
    key: &[u8]
) -> Result<bool, Self::Error>[−]

true if a key exists in child storage.

fn child_keys(&self, child_info: &ChildInfo, prefix: &[u8]) -> Vec<StorageKey>[−]

Get all keys of child storage with given prefix

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.

fn commit(
    &self,
    _: H::Out,
    _: Self::Transaction,
    _: StorageCollection
) -> Result<(), Self::Error>[−]

Commit given transaction to storage.

fn read_write_count(&self) -> (u32, u32, u32, u32)[−]

Get the read/write count of the db

fn reset_read_write_count(&self)[−]

Get the read/write count of the db

fn set_whitelist(&self, _: Vec<Vec<u8>>)[−]

Update the whitelist for tracking db reads/writes

impl<H: Hasher> Clone for TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [+]

[+] Show hidden undocumented items

fn clone(&self) -> Self[−]

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl<S: TrieBackendStorage<H>, H: Hasher> Debug for TrieBackend<S, H>[+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter<'_>) -> Result[−]

Formats the value using the given formatter.

impl<H: Hasher> Default for TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [+]

[+] Show hidden undocumented items

fn default() -> Self[−]

Returns the "default value" for a type.

impl<H: Hasher> From<BTreeMap<Vec<u8>, Vec<u8>>> for TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [+]

[+] Show hidden undocumented items

fn from(inner: BTreeMap<StorageKey, StorageValue>) -> Self[−]

Performs the conversion.

impl<H: Hasher> From<HashMap<Option<ChildInfo>, BTreeMap<Vec<u8>, Vec<u8>>, RandomState>> for TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [+]

[+] Show hidden undocumented items

fn from(
    inner: HashMap<Option<ChildInfo>, BTreeMap<StorageKey, StorageValue>>
) -> Self[−]

Performs the conversion.

impl<H: Hasher> From<Storage> for TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [+]

[+] Show hidden undocumented items

fn from(inners: Storage) -> Self[−]

Performs the conversion.

impl<H: Hasher> From<Vec<(Option<ChildInfo>, Vec<(Vec<u8>, Option<Vec<u8>>)>)>> for TrieBackend<MemoryDB<H>, H> where
    H::Out: Codec + Ord, [+]

[+] Show hidden undocumented items

fn from(inner: Vec<(Option<ChildInfo>, StorageCollection)>) -> Self[−]

Performs the conversion.