pub struct RefTrackingState<Block: BlockT> { /* private fields */ }
Expand description
A reference tracking state.
It makes sure that the hash we are using stays pinned in storage until this structure is dropped.
Trait Implementations§
Source§impl<B: BlockT> AsTrieBackend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B>
impl<B: BlockT> AsTrieBackend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B>
Source§type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage
type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage
Type of trie backend storage.
Source§fn as_trie_backend(
&self,
) -> &TrieBackend<Self::TrieBackendStorage, HashingFor<B>>
fn as_trie_backend( &self, ) -> &TrieBackend<Self::TrieBackendStorage, HashingFor<B>>
Return the type as
TrieBackend
.Source§impl<B: BlockT> Backend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B>
impl<B: BlockT> Backend<<<B as Block>::Header as Header>::Hashing> for RefTrackingState<B>
Source§type Error = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::Error
type Error = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<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.
Source§type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage
type TrieBackendStorage = <TrieBackend<Arc<dyn Storage<<<B as Block>::Header as Header>::Hashing>>, <<B as Block>::Header as Header>::Hashing> as Backend<<<B as Block>::Header as Header>::Hashing>>::TrieBackendStorage
Type of trie backend storage.
Source§fn storage(&self, key: &[u8]) -> Result<Option<Vec<u8>>, Self::Error>
fn storage(&self, key: &[u8]) -> Result<Option<Vec<u8>>, Self::Error>
Get keyed storage or None if there is nothing associated.
Source§fn storage_hash(&self, key: &[u8]) -> Result<Option<B::Hash>, Self::Error>
fn storage_hash(&self, key: &[u8]) -> Result<Option<B::Hash>, Self::Error>
Get keyed storage value hash or None if there is nothing associated.
Source§fn child_storage(
&self,
child_info: &ChildInfo,
key: &[u8],
) -> Result<Option<Vec<u8>>, Self::Error>
fn child_storage( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<Vec<u8>>, Self::Error>
Get child keyed child storage or None if there is nothing associated.
Source§fn child_storage_hash(
&self,
child_info: &ChildInfo,
key: &[u8],
) -> Result<Option<B::Hash>, Self::Error>
fn child_storage_hash( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<B::Hash>, Self::Error>
Get child keyed storage value hash or None if there is nothing associated.
Source§fn closest_merkle_value(
&self,
key: &[u8],
) -> Result<Option<MerkleValue<B::Hash>>, Self::Error>
fn closest_merkle_value( &self, key: &[u8], ) -> Result<Option<MerkleValue<B::Hash>>, Self::Error>
Get the merkle value or None if there is nothing associated.
Source§fn child_closest_merkle_value(
&self,
child_info: &ChildInfo,
key: &[u8],
) -> Result<Option<MerkleValue<B::Hash>>, Self::Error>
fn child_closest_merkle_value( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<MerkleValue<B::Hash>>, Self::Error>
Get the child merkle value or None if there is nothing associated.
Source§fn exists_storage(&self, key: &[u8]) -> Result<bool, Self::Error>
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>
fn exists_child_storage( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<bool, Self::Error>
true if a key exists in child storage.
Source§fn next_storage_key(&self, key: &[u8]) -> Result<Option<Vec<u8>>, Self::Error>
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.Source§fn next_child_storage_key(
&self,
child_info: &ChildInfo,
key: &[u8],
) -> Result<Option<Vec<u8>>, Self::Error>
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.Source§fn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion,
) -> (B::Hash, BackendTransaction<HashingFor<B>>)
fn storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion, ) -> (B::Hash, BackendTransaction<HashingFor<B>>)
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.
Source§fn child_storage_root<'a>(
&self,
child_info: &ChildInfo,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion,
) -> (B::Hash, bool, BackendTransaction<HashingFor<B>>)
fn child_storage_root<'a>( &self, child_info: &ChildInfo, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion, ) -> (B::Hash, bool, BackendTransaction<HashingFor<B>>)
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.
Source§fn raw_iter(&self, args: IterArgs<'_>) -> Result<Self::RawIter, Self::Error>
fn raw_iter(&self, args: IterArgs<'_>) -> Result<Self::RawIter, Self::Error>
Returns a lifetimeless raw storage iterator.
Source§fn register_overlay_stats(&self, stats: &StateMachineStats)
fn register_overlay_stats(&self, stats: &StateMachineStats)
Register stats from overlay of state machine. Read more
Source§fn usage_info(&self) -> StateUsageInfo
fn usage_info(&self) -> StateUsageInfo
Query backend usage statistics (i/o, memory) Read more
Source§fn pairs<'a>(
&'a self,
args: IterArgs<'_>,
) -> Result<PairsIter<'a, H, Self::RawIter>, Self::Error>
fn pairs<'a>( &'a self, args: IterArgs<'_>, ) -> Result<PairsIter<'a, H, Self::RawIter>, Self::Error>
Get an iterator over key/value pairs.
Source§fn keys<'a>(
&'a self,
args: IterArgs<'_>,
) -> Result<KeysIter<'a, H, Self::RawIter>, Self::Error>
fn keys<'a>( &'a self, args: IterArgs<'_>, ) -> Result<KeysIter<'a, H, Self::RawIter>, Self::Error>
Get an iterator over keys.
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 as Hasher>::Out, MemoryDB<H, PrefixedKey<H>, Vec<u8>>)
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 as Hasher>::Out, MemoryDB<H, PrefixedKey<H>, Vec<u8>>)
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.
Source§fn commit(
&self,
_: <H as Hasher>::Out,
_: MemoryDB<H, PrefixedKey<H>, Vec<u8>>,
_: Vec<(Vec<u8>, Option<Vec<u8>>)>,
_: Vec<(Vec<u8>, Vec<(Vec<u8>, Option<Vec<u8>>)>)>,
) -> Result<(), Self::Error>
fn commit( &self, _: <H as Hasher>::Out, _: MemoryDB<H, PrefixedKey<H>, Vec<u8>>, _: Vec<(Vec<u8>, Option<Vec<u8>>)>, _: Vec<(Vec<u8>, Vec<(Vec<u8>, Option<Vec<u8>>)>)>, ) -> Result<(), Self::Error>
Commit given transaction to storage.
Source§fn reset_read_write_count(&self)
fn reset_read_write_count(&self)
Get the read/write count of the db
Source§fn get_whitelist(&self) -> Vec<TrackedStorageKey>
fn get_whitelist(&self) -> Vec<TrackedStorageKey>
Get the whitelist for tracking db reads/writes
Source§fn set_whitelist(&self, _: Vec<TrackedStorageKey>)
fn set_whitelist(&self, _: Vec<TrackedStorageKey>)
Update the whitelist for tracking db reads/writes
Source§fn proof_size(&self) -> Option<u32>
fn proof_size(&self) -> Option<u32>
Estimate proof size
Source§impl<Block: BlockT> Debug for RefTrackingState<Block>
impl<Block: BlockT> Debug for RefTrackingState<Block>
Auto Trait Implementations§
impl<Block> !Freeze for RefTrackingState<Block>
impl<Block> !RefUnwindSafe for RefTrackingState<Block>
impl<Block> Send for RefTrackingState<Block>
impl<Block> Sync for RefTrackingState<Block>
impl<Block> Unpin for RefTrackingState<Block>
impl<Block> !UnwindSafe for RefTrackingState<Block>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
Source§impl<H, B> InspectState<H, B> for B
impl<H, B> InspectState<H, B> for B
Source§fn inspect_state<F, R>(&self, f: F) -> Rwhere
F: FnOnce() -> R,
fn inspect_state<F, R>(&self, f: F) -> Rwhere
F: FnOnce() -> R,
Inspect state with a closure. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
Source§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
Source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
Source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T
. Read moreSource§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
Source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.Source§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
Source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.