Enum sc_light::backend::GenesisOrUnavailableState

pub enum GenesisOrUnavailableState<H: Hasher> {
    Genesis(InMemoryBackend<H>),
    Unavailable,
}

Either in-memory genesis state, or locally-unavailable state.

Variants

Genesis(InMemoryBackend<H>)

Genesis state - storage values are stored in-memory.

Unavailable

We know that state exists, but all calls will fail with error, because it isn’t locally available.

Trait Implementations

impl<H: Hasher> Backend<H> for GenesisOrUnavailableState<H> where
    H::Out: Ord + Codec, 

type Error = ClientError

An error type when fetching data is not possible.

type Transaction = <InMemoryBackend<H> as StateBackend<H>>::Transaction

Storage changes to be applied if committing

type TrieBackendStorage = <InMemoryBackend<H> as StateBackend<H>>::TrieBackendStorage

Type of trie backend storage.

fn storage(&self, key: &[u8]) -> ClientResult<Option<Vec<u8>>>

Get keyed storage or None if there is nothing associated.

fn child_storage(
    &self,
    child_info: &ChildInfo,
    key: &[u8]
) -> ClientResult<Option<Vec<u8>>>

Get keyed child storage or None if there is nothing associated.

fn next_storage_key(&self, key: &[u8]) -> Result<Option<Vec<u8>>, 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<Vec<u8>>, Self::Error>

Return the next key in child storage in lexicographic order or None if there is no value.

fn for_keys_with_prefix<A: FnMut(&[u8])>(&self, prefix: &[u8], action: A)

Retrieve all entries keys which start with the given prefix and call f for each of those keys.

fn for_key_values_with_prefix<A: FnMut(&[u8], &[u8])>(
    &self,
    prefix: &[u8],
    action: A
)

Retrieve all entries keys and values of which start with the given prefix and call f for each of those keys.

fn apply_to_child_keys_while<A: FnMut(&[u8]) -> bool>(
    &self,
    child_info: &ChildInfo,
    action: A
)

Retrieve all entries keys of child storage and call f for each of those keys. Aborts as soon as f returns false.

fn for_child_keys_with_prefix<A: FnMut(&[u8])>(
    &self,
    child_info: &ChildInfo,
    prefix: &[u8],
    action: A
)

Retrieve all child entries keys which start with the given prefix and call f for each of those keys.

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 pairs(&self) -> Vec<(Vec<u8>, Vec<u8>)>

Get all key/value pairs into a Vec.

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

Get all keys with given prefix

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 as_trie_backend(
    &mut self
) -> Option<&TrieBackend<Self::TrieBackendStorage, H>>

Try convert into trie backend.

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

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

pub fn child_storage_hash(
    &self,
    child_info: &ChildInfo,
    key: &[u8]
) -> Result<Option<<H as Hasher>::Out>, Self::Error>

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

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

true if a key exists in storage.

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

true if a key exists in child storage.

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

Get all keys of child storage with given prefix

pub 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 as Hasher>::Out, Self::Transaction) where
    <H as Hasher>::Out: Ord,
    <H as Hasher>::Out: 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.

pub fn wipe(&self) -> Result<(), Self::Error>

Wipe the state database.

pub fn commit(
    &self,
    <H as Hasher>::Out,
    Self::Transaction,
    Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>,
    Vec<(Vec<u8, Global>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>), Global>
) -> Result<(), Self::Error>

Commit given transaction to storage.

pub fn read_write_count(&self) -> (u32, u32, u32, u32)

Get the read/write count of the db

pub fn reset_read_write_count(&self)

Get the read/write count of the db

pub fn get_whitelist(&self) -> Vec<TrackedStorageKey, Global>

Get the whitelist for tracking db reads/writes

pub fn set_whitelist(&self, Vec<TrackedStorageKey, Global>)

Update the whitelist for tracking db reads/writes

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

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

Formats the value using the given formatter.