Struct sp_state_machine::InMemoryBackend

pub struct InMemoryBackend<H: Hasher> { /* fields omitted */ }

In-memory backend. Fully recomputes tries each time as_trie_backend is called but useful for tests and proof checking.

Methods

impl<H: Hasher> InMemory<H>

pub fn update<T: IntoIterator<Item = (Option<(StorageKey, OwnedChildInfo)>, StorageCollection)>>(
    &self,
    changes: T
) -> Self

Copy the state, with applied updates

impl<H: Hasher> InMemory<H>

pub fn child_storage_keys(&self) -> impl Iterator<Item = (&[u8], ChildInfo)>

child storage key iterator

Trait Implementations

impl<H: Hasher> Backend<H> for InMemory<H> where
    H::Out: Codec, 

type Error = Void

An error type when fetching data is not possible.

type Transaction = Vec<(Option<(StorageKey, OwnedChildInfo)>, StorageCollection)>

Storage changes to be applied if committing

type TrieBackendStorage = MemoryDB<H>

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,
    storage_key: &[u8],
    child_info: ChildInfo,
    key: &[u8]
) -> Result<Option<StorageValue>, Self::Error>

Get keyed child storage 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 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,
    storage_key: &[u8],
    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,
    storage_key: &[u8],
    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 storage_root<I>(&self, delta: I) -> (H::Out, Self::Transaction) where
    I: IntoIterator<Item = (Vec<u8>, Option<Vec<u8>>)>,
    <H as Hasher>::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<I>(
    &self,
    storage_key: &[u8],
    child_info: ChildInfo,
    delta: I
) -> (H::Out, bool, Self::Transaction) where
    I: IntoIterator<Item = (Vec<u8>, Option<Vec<u8>>)>,
    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 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,
    storage_key: &[u8],
    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 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 child_keys(
    &self,
    storage_key: &[u8],
    child_info: ChildInfo,
    prefix: &[u8]
) -> Vec<StorageKey>

Get all keys of child storage with given prefix

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,
    storage_key: &[u8],
    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_child_storage(
    &self,
    storage_key: &[u8],
    child_info: ChildInfo,
    key: &[u8]
) -> Result<bool, Self::Error>

true if a key exists in child storage.

fn full_storage_root<I1, I2i, I2>(
    &self,
    delta: I1,
    child_deltas: I2
) -> (H::Out, Self::Transaction) where
    I1: IntoIterator<Item = (StorageKey, Option<StorageValue>)>,
    I2i: IntoIterator<Item = (StorageKey, Option<StorageValue>)>,
    I2: IntoIterator<Item = (StorageKey, I2i, OwnedChildInfo)>,
    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,
    _storage_root: H::Out,
    _transaction: Self::Transaction
) -> Result<(), Self::Error>

Commit given transaction to storage.

impl<H: Hasher> Clone for InMemory<H>

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<H: Hasher> Debug for InMemory<H>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<H: Hasher> Default for InMemory<H>

fn default() -> Self

Returns the "default value" for a type.

impl<H: Hasher> From<BTreeMap<Vec<u8>, Vec<u8>>> for InMemory<H>

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

Performs the conversion.

impl<H: Hasher> From<HashMap<Option<(Vec<u8>, OwnedChildInfo)>, BTreeMap<Vec<u8>, Vec<u8>>, RandomState>> for InMemory<H>

fn from(
    inner: HashMap<Option<(StorageKey, OwnedChildInfo)>, BTreeMap<StorageKey, StorageValue>>
) -> Self

Performs the conversion.

impl<H: Hasher> From<Storage> for InMemory<H>

fn from(inners: Storage) -> Self

Performs the conversion.

impl<H: Hasher> From<Vec<(Option<(Vec<u8>, OwnedChildInfo)>, Vec<(Vec<u8>, Option<Vec<u8>>)>)>> for InMemory<H>

fn from(
    inner: Vec<(Option<(StorageKey, OwnedChildInfo)>, StorageCollection)>
) -> Self

Performs the conversion.

impl<H: Hasher> PartialEq<InMemory<H>> for InMemory<H>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.