Struct sp_state_machine::TrieBackend

source ·

pub struct TrieBackend<S: TrieBackendStorage<H>, H: Hasher, C = LocalTrieCache<H>> { /* private fields */ }

Expand description

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

Implementations

source

impl<H: Hasher, KF> TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

source

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

Copy the state, with applied updates

source

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

Insert values into backend trie.

source

pub fn update_backend(
 &self,
 root: H::Out,
 changes: GenericMemoryDB<H, KF>
) -> Self

Merge trie nodes into this backend.

source

pub fn apply_transaction(
 &mut self,
 root: H::Out,
 transaction: GenericMemoryDB<H, KF>
)

Apply the given transaction to this backend and set the root to the given value.

source

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

Compare with another in-memory backend.

source

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H> + Send + Sync> TrieBackend<S, H, C>where
H::Out: Codec,

source

pub fn essence(&self) -> &TrieBackendEssence<S, H, C>

Get backend essence reference.

source

pub fn backend_storage(&self) -> &S

Get backend storage reference.

source

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

Get trie root.

source

pub fn into_storage(self) -> S

Consumes self and returns underlying storage.

source

pub fn extract_proof(self) -> Option<StorageProof>

Extract the StorageProof.

This only returns Some when there was a recorder set.

Trait Implementations

source

impl<S: TrieBackendStorage<H>, H: Hasher, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>

fn as_trie_backend(&self) -> &TrieBackend<S, H, C>

Return the type as TrieBackend.

source

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C>where
H::Out: Ord + Codec,

type Error = String

An error type when fetching data is not possible.

type Transaction = <S as TrieBackendStorage<H>>::Overlay

Storage changes to be applied if committing

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

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

source

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

Get keyed storage or None if there is nothing associated.

source

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.

source

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.

source

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.

source

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.

source

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

source

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

source

fn apply_to_key_values_while<F: FnMut(Vec<u8>, Vec<u8>) -> bool>(
 &self,
 child_info: Option<&ChildInfo>,
 prefix: Option<&[u8]>,
 start_at: Option<&[u8]>,
 f: F,
 allow_missing: bool
) -> Result<bool, Self::Error>

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. Read more

source

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

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

source

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

source

fn pairs(&self) -> Vec<(StorageKey, StorageValue)> ⓘ

Get all key/value pairs into a Vec.

source

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

Get all keys with given prefix

source

fn storage_root<'a>(
 &self,
 delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
 state_version: StateVersion
) -> (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

source

fn child_storage_root<'a>(
 &self,
 child_info: &ChildInfo,
 delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
 state_version: StateVersion
) -> (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

source

fn register_overlay_stats(&self, _stats: &StateMachineStats)

Register stats from overlay of state machine. Read more

source

fn usage_info(&self) -> UsageInfo

Query backend usage statistics (i/o, memory) Read more

source

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

Wipe the state database.

source

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

true if a key exists in storage.

source

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

true if a key exists in child storage.

source

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

Get all keys of child storage with given prefix

source

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]>)>)>,
 state_version: StateVersion
) -> (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

source

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

Commit given transaction to storage.

source

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

Get the read/write count of the db

source

fn reset_read_write_count(&self)

Get the read/write count of the db

source

fn get_whitelist(&self) -> Vec<TrackedStorageKey> ⓘ

Get the whitelist for tracking db reads/writes

source

fn set_whitelist(&self, _: Vec<TrackedStorageKey>)

Update the whitelist for tracking db reads/writes

source

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

Estimate proof size

source

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

Extend storage info for benchmarking db

source

impl<H: Hasher, KF> Clone for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

source

fn clone(&self) -> Self

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H>> Debug for TrieBackend<S, H, C>

source

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

Formats the value using the given formatter. Read more

source

impl<H, KF> Default for TrieBackend<GenericMemoryDB<H, KF>, H>where
 H: Hasher,
 H::Out: Codec + Ord,
 KF: KeyFunction<H> + Send + Sync,

source

fn default() -> Self

Returns the “default value” for a type. Read more

source

impl<H: Hasher, KF> From<(BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

source

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

Converts to this type from the input type.

source

impl<H: Hasher, KF> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, RandomState>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

source

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

Converts to this type from the input type.

source

impl<H: Hasher, KF> From<(Storage, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

source

fn from((inners, state_version): (Storage, StateVersion)) -> Self

Converts to this type from the input type.

source

impl<H: Hasher, KF> From<(Vec<(Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>), Global>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

source

fn from(
(inner, state_version): (Vec<(Option<ChildInfo>, StorageCollection)>, StateVersion)
) -> Self

Converts to this type from the input type.

Auto Trait Implementations

impl<S, H, C = LocalTrieCache<H>> !RefUnwindSafe for TrieBackend<S, H, C>

impl<S, H, C> Send for TrieBackend<S, H, C>where
C: Send,

impl<S, H, C> Sync for TrieBackend<S, H, C>where
C: Sync,

impl<S, H, C> Unpin for TrieBackend<S, H, C>where
 C: Unpin,
 S: Unpin,
 <H as Hasher>::Out: Unpin,

impl<S, H, C = LocalTrieCache<H>> !UnwindSafe for TrieBackend<S, H, C>

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> Downcast for Twhere
T: Any,

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s. Read more

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s. Read more

impl<T> DowncastSync for Twhere
T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T> Instrument for T

source

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

source

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,

source

fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

source

fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,

source

fn unchecked_into(self) -> T

The counterpart to unchecked_from.

impl<V, T> VZip<V> for Twhere
V: MultiLane<T>,

fn vzip(self) -> V

source

impl<T> WithSubscriber for T

source

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

source

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

Struct sp_state_machine::TrieBackend

Implementations

impl<H: Hasher, KF> TrieBackend<GenericMemoryDB<H, KF>, H>where H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

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

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

pub fn update_backend( &self, root: H::Out, changes: GenericMemoryDB<H, KF>) -> Self

pub fn apply_transaction( &mut self, root: H::Out, transaction: GenericMemoryDB<H, KF>)

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

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H> + Send + Sync> TrieBackend<S, H, C>where H::Out: Codec,

pub fn essence(&self) -> &TrieBackendEssence<S, H, C>

pub fn backend_storage(&self) -> &S

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

pub fn into_storage(self) -> S

pub fn extract_proof(self) -> Option<StorageProof>

Trait Implementations

impl<S: TrieBackendStorage<H>, H: Hasher, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>

type TrieBackendStorage = S

fn as_trie_backend(&self) -> &TrieBackend<S, H, C>

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C>where H::Out: Ord + Codec,

type Error = String

type Transaction = <S as TrieBackendStorage<H>>::Overlay

type TrieBackendStorage = S

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

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

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

fn child_storage( &self, child_info: &ChildInfo, key: &[u8]) -> Result<Option<StorageValue>, Self::Error>

fn next_storage_key(&self, key: &[u8]) -> Result<Option<StorageKey>, Self::Error>

fn next_child_storage_key( &self, child_info: &ChildInfo, key: &[u8]) -> Result<Option<StorageKey>, Self::Error>

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

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

fn apply_to_key_values_while<F: FnMut(Vec<u8>, Vec<u8>) -> bool>( &self, child_info: Option<&ChildInfo>, prefix: Option<&[u8]>, start_at: Option<&[u8]>, f: F, allow_missing: bool) -> Result<bool, Self::Error>

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

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

fn pairs(&self) -> Vec<(StorageKey, StorageValue)> ⓘ

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

fn storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion) -> (H::Out, Self::Transaction)where H::Out: Ord,

fn child_storage_root<'a>( &self, child_info: &ChildInfo, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion) -> (H::Out, bool, Self::Transaction)where H::Out: Ord,

fn register_overlay_stats(&self, _stats: &StateMachineStats)

fn usage_info(&self) -> UsageInfo

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

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

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

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

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]>)>)>, state_version: StateVersion) -> (H::Out, Self::Transaction)where H::Out: Ord + Encode,

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

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

fn reset_read_write_count(&self)

fn get_whitelist(&self) -> Vec<TrackedStorageKey> ⓘ

fn set_whitelist(&self, _: Vec<TrackedStorageKey>)

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

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

impl<H: Hasher, KF> Clone for TrieBackend<GenericMemoryDB<H, KF>, H>where H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

fn clone(&self) -> Self

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

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H>> Debug for TrieBackend<S, H, C>

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

impl<H, KF> Default for TrieBackend<GenericMemoryDB<H, KF>, H>where H: Hasher, H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

fn default() -> Self

impl<H: Hasher, KF> From<(BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

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

impl<H: Hasher, KF> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, RandomState>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

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

impl<H: Hasher, KF> From<(Storage, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

fn from((inners, state_version): (Storage, StateVersion)) -> Self

impl<H: Hasher, KF> From<(Vec<(Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>), Global>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where H::Out: Codec + Ord, KF: KeyFunction<H> + Send + Sync,

fn from( (inner, state_version): (Vec<(Option<ChildInfo>, StorageCollection)>, StateVersion)) -> Self

Auto Trait Implementations

impl<S, H, C = LocalTrieCache<H>> !RefUnwindSafe for TrieBackend<S, H, C>

impl<S, H, C> Send for TrieBackend<S, H, C>where C: Send,

impl<S, H, C> Sync for TrieBackend<S, H, C>where C: Sync,

impl<S, H, C> Unpin for TrieBackend<S, H, C>where C: Unpin, S: Unpin, <H as Hasher>::Out: Unpin,

impl<S, H, C = LocalTrieCache<H>> !UnwindSafe for TrieBackend<S, H, C>

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> Downcast for Twhere T: Any,

impl<H: Hasher, KF> TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

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

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

pub fn update_backend(
&self,
root: H::Out,
changes: GenericMemoryDB<H, KF>
) -> Self

pub fn apply_transaction(
&mut self,
root: H::Out,
transaction: GenericMemoryDB<H, KF>
)

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H> + Send + Sync> TrieBackend<S, H, C>where
H::Out: Codec,

impl<S: TrieBackendStorage<H>, H: Hasher, C: AsLocalTrieCache<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C>where
H::Out: Ord + Codec,

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

fn child_storage(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<StorageValue>, Self::Error>

fn next_child_storage_key(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<StorageKey>, Self::Error>

fn apply_to_key_values_while<F: FnMut(Vec<u8>, Vec<u8>) -> bool>(
&self,
child_info: Option<&ChildInfo>,
prefix: Option<&[u8]>,
start_at: Option<&[u8]>,
f: F,
allow_missing: bool
) -> Result<bool, Self::Error>

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

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

fn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion
) -> (H::Out, Self::Transaction)where
H::Out: Ord,

fn child_storage_root<'a>(
&self,
child_info: &ChildInfo,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion
) -> (H::Out, bool, Self::Transaction)where
H::Out: Ord,

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

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]>)>)>,
state_version: StateVersion
) -> (H::Out, Self::Transaction)where
H::Out: Ord + Encode,

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

impl<H: Hasher, KF> Clone for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

impl<H, KF> Default for TrieBackend<GenericMemoryDB<H, KF>, H>where
H: Hasher,
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

impl<H: Hasher, KF> From<(BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

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

impl<H: Hasher, KF> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, RandomState>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

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

impl<H: Hasher, KF> From<(Storage, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

impl<H: Hasher, KF> From<(Vec<(Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>), Global>, StateVersion)> for TrieBackend<GenericMemoryDB<H, KF>, H>where
H::Out: Codec + Ord,
KF: KeyFunction<H> + Send + Sync,

fn from(
(inner, state_version): (Vec<(Option<ChildInfo>, StorageCollection)>, StateVersion)
) -> Self

impl<S, H, C> Send for TrieBackend<S, H, C>where
C: Send,

impl<S, H, C> Sync for TrieBackend<S, H, C>where
C: Sync,

impl<S, H, C> Unpin for TrieBackend<S, H, C>where
C: Unpin,
S: Unpin,
<H as Hasher>::Out: Unpin,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<T> Downcast for Twhere
T: Any,

impl<T> DowncastSync for Twhere
T: Any + Send + Sync,

impl<T> DynClone for Twhere
T: Clone,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,

impl<T> ToOwned for Twhere
T: Clone,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,

impl<V, T> VZip<V> for Twhere
V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,

impl<T> MaybeDebug for Twhere
T: Debug,

impl<T> MaybeDebug for Twhere
T: Debug,