Struct node_testing::client::sc_client_db::RefTrackingState

pub struct RefTrackingState<Block> where
    Block: Block,  { /* fields omitted */ }

A reference tracking state.

It makes sure that the hash we are using stays pinned in storage until this structure is dropped.

Trait Implementations

impl<B> Backend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B> where
    B: Block, 

type Error = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing> + 'static>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error

An error type when fetching data is not possible.

type Transaction = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing> + 'static>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::Transaction

Storage changes to be applied if committing

type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing> + 'static>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage

Type of trie backend storage.

pub fn storage(
    &self,
    key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

Get keyed storage or None if there is nothing associated.

pub fn storage_hash(
    &self,
    key: &[u8]
) -> Result<Option<<B as Block>::Hash>, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

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

pub fn child_storage(
    &self,
    child_info: &ChildInfo,
    key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

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

pub fn exists_storage(
    &self,
    key: &[u8]
) -> Result<bool, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

true if a key exists in storage.

pub fn exists_child_storage(
    &self,
    child_info: &ChildInfo,
    key: &[u8]
) -> Result<bool, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

true if a key exists in child storage.

pub fn next_storage_key(
    &self,
    key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

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

pub fn next_child_storage_key(
    &self,
    child_info: &ChildInfo,
    key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error>

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

pub fn for_keys_with_prefix<F>(&self, prefix: &[u8], f: F) where
    F: FnMut(&[u8]), 

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

pub fn for_key_values_with_prefix<F>(&self, prefix: &[u8], f: F) where
    F: FnMut(&[u8], &[u8]), 

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

pub fn apply_to_key_values_while<F>(
    &self,
    child_info: Option<&ChildInfo>,
    prefix: Option<&[u8]>,
    start_at: Option<&[u8]>,
    f: F,
    allow_missing: bool
) -> Result<bool, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error> where
    F: FnMut(Vec<u8, Global>, Vec<u8, Global>) -> bool, 

Iterate over storage starting at key, for a given prefix and child trie. Aborts as soon as f returns false. Warning, this fails at first error when usual iteration skips errors. If allow_missing is true, iteration stops when it reaches a missing trie node. Otherwise an error is produced.

pub fn apply_to_keys_while<F>(
    &self,
    child_info: Option<&ChildInfo>,
    prefix: Option<&[u8]>,
    f: F
) where
    F: FnMut(&[u8]) -> bool, 

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

pub fn for_child_keys_with_prefix<F>(
    &self,
    child_info: &ChildInfo,
    prefix: &[u8],
    f: F
) where
    F: FnMut(&[u8]), 

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

pub fn storage_root<'a>(
    &self,
    delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>
) -> (<B as Block>::Hash, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Transaction) where
    <B as Block>::Hash: 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.

pub fn child_storage_root<'a>(
    &self,
    child_info: &ChildInfo,
    delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>
) -> (<B as Block>::Hash, bool, <RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::Transaction) where
    <B as Block>::Hash: 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.

pub fn pairs(&self) -> Vec<(Vec<u8, Global>, Vec<u8, Global>), Global>

Get all key/value pairs into a Vec.

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

Get all keys with given prefix

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 as_trie_backend(
    &mut self
) -> Option<&TrieBackend<<RefTrackingState<B> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage, <<B as Block>::Header as Header>::Hashing>>

Try convert into trie backend.

pub fn register_overlay_stats(&self, stats: &StateMachineStats)

Register stats from overlay of state machine.

pub fn usage_info(&self) -> UsageInfo

Query backend usage statistics (i/o, memory)

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.

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.

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

Wipe the state database.

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.

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 get_whitelist(&self) -> Vec<TrackedStorageKey, Global>

Get the whitelist for tracking db reads/writes

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

Update the whitelist for tracking db reads/writes

fn proof_size(&self) -> Option<u32>

Estimate proof size

fn get_read_and_written_keys(
    &self
) -> Vec<(Vec<u8, Global>, u32, u32, bool), Global>

Extend storage info for benchmarking db

impl<Block> Debug for RefTrackingState<Block> where
    Block: Block, 

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

Formats the value using the given formatter.

impl<B> Drop for RefTrackingState<B> where
    B: Block, 

pub fn drop(&mut self)

Executes the destructor for this type.