Struct sp_state_machine::TrieBackend
source · pub struct TrieBackend<S: TrieBackendStorage<H>, H: Hasher, C = LocalTrieCache<H>, R = Recorder<H>> { /* private fields */ }
Expand description
Patricia trie-based backend. Transaction type is an overlay of changes to commit.
Implementations§
source§impl<H: Hasher> TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
impl<H: Hasher> TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
sourcepub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&self,
changes: T,
state_version: StateVersion,
) -> Self
pub fn update<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>( &self, changes: T, state_version: StateVersion, ) -> Self
Copy the state, with applied updates
sourcepub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>(
&mut self,
changes: T,
state_version: StateVersion,
)
pub fn insert<T: IntoIterator<Item = (Option<ChildInfo>, StorageCollection)>>( &mut self, changes: T, state_version: StateVersion, )
Insert values into backend trie.
sourcepub fn update_backend(&self, root: H::Out, changes: PrefixedMemoryDB<H>) -> Self
pub fn update_backend(&self, root: H::Out, changes: PrefixedMemoryDB<H>) -> Self
Merge trie nodes into this backend.
sourcepub fn apply_transaction(
&mut self,
root: H::Out,
transaction: PrefixedMemoryDB<H>,
)
pub fn apply_transaction( &mut self, root: H::Out, transaction: PrefixedMemoryDB<H>, )
Apply the given transaction to this backend and set the root to the given value.
source§impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync, R: TrieRecorderProvider<H> + Send + Sync> TrieBackend<S, H, C, R>where
H::Out: Codec,
impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync, R: TrieRecorderProvider<H> + Send + Sync> TrieBackend<S, H, C, R>where
H::Out: Codec,
sourcepub fn backend_storage_mut(&mut self) -> &mut S
pub fn backend_storage_mut(&mut self) -> &mut S
Get backend storage reference.
sourcepub fn backend_storage(&self) -> &S
pub fn backend_storage(&self) -> &S
Get backend storage reference.
sourcepub fn into_storage(self) -> S
pub fn into_storage(self) -> S
Consumes self and returns underlying storage.
sourcepub fn extract_proof(self) -> Option<StorageProof>
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>
impl<S: TrieBackendStorage<H>, H: Hasher, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>
§type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
source§fn as_trie_backend(&self) -> &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: TrieCacheProvider<H> + Send + Sync, R: TrieRecorderProvider<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C, R>where
H::Out: Ord + Codec,
impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync, R: TrieRecorderProvider<H> + Send + Sync> Backend<H> for TrieBackend<S, H, C, R>where
H::Out: Ord + Codec,
§type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
source§fn storage_hash(&self, key: &[u8]) -> Result<Option<H::Out>, Self::Error>
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>
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>
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>
fn child_storage( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<StorageValue>, Self::Error>
Get child keyed child storage or None if there is nothing associated.
source§fn closest_merkle_value(
&self,
key: &[u8],
) -> Result<Option<MerkleValue<H::Out>>, Self::Error>
fn closest_merkle_value( &self, key: &[u8], ) -> Result<Option<MerkleValue<H::Out>>, 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<H::Out>>, Self::Error>
fn child_closest_merkle_value( &self, child_info: &ChildInfo, key: &[u8], ) -> Result<Option<MerkleValue<H::Out>>, Self::Error>
Get the child merkle value or None if there is nothing associated.
source§fn next_storage_key(
&self,
key: &[u8],
) -> Result<Option<StorageKey>, Self::Error>
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>
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 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 storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion,
) -> (H::Out, PrefixedMemoryDB<H>)where
H::Out: Ord,
fn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion,
) -> (H::Out, PrefixedMemoryDB<H>)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.
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, PrefixedMemoryDB<H>)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, PrefixedMemoryDB<H>)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.
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) -> UsageInfo
fn usage_info(&self) -> UsageInfo
Query backend usage statistics (i/o, memory) Read more
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 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::Out, BackendTransaction<H>)where
H::Out: Ord + Encode,
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, BackendTransaction<H>)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.
source§fn commit(
&self,
_: H::Out,
_: BackendTransaction<H>,
_: StorageCollection,
_: ChildStorageCollection,
) -> Result<(), Self::Error>
fn commit( &self, _: H::Out, _: BackendTransaction<H>, _: StorageCollection, _: ChildStorageCollection, ) -> 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<H: Hasher> Clone for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
impl<H: Hasher> Clone for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
source§impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H>, R: TrieRecorderProvider<H>> Debug for TrieBackend<S, H, C, R>
impl<S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H>, R: TrieRecorderProvider<H>> Debug for TrieBackend<S, H, C, R>
source§impl<H> Default for TrieBackend<PrefixedMemoryDB<H>, H>where
H: Hasher,
H::Out: Codec + Ord,
impl<H> Default for TrieBackend<PrefixedMemoryDB<H>, H>where
H: Hasher,
H::Out: Codec + Ord,
source§impl<H: Hasher> From<(BTreeMap<Vec<u8>, Vec<u8>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
impl<H: Hasher> From<(BTreeMap<Vec<u8>, Vec<u8>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
source§fn from(
(inner, state_version): (BTreeMap<StorageKey, StorageValue>, StateVersion),
) -> Self
fn from( (inner, state_version): (BTreeMap<StorageKey, StorageValue>, StateVersion), ) -> Self
Converts to this type from the input type.
source§impl<H: Hasher> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8>, Vec<u8>>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
impl<H: Hasher> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8>, Vec<u8>>>, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
source§fn from(
(inner, state_version): (HashMap<Option<ChildInfo>, BTreeMap<StorageKey, StorageValue>>, StateVersion),
) -> Self
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> From<(Storage, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
impl<H: Hasher> From<(Storage, StateVersion)> for TrieBackend<PrefixedMemoryDB<H>, H>where
H::Out: Codec + Ord,
Auto Trait Implementations§
impl<S, H, C = LocalTrieCache<H>, R = Recorder<H>> !Freeze for TrieBackend<S, H, C, R>
impl<S, H, C = LocalTrieCache<H>, R = Recorder<H>> !RefUnwindSafe for TrieBackend<S, H, C, R>
impl<S, H, C, R> Send for TrieBackend<S, H, C, R>
impl<S, H, C, R> Sync for TrieBackend<S, H, C, R>
impl<S, H, C, R> Unpin for TrieBackend<S, H, C, R>
impl<S, H, C = LocalTrieCache<H>, R = Recorder<H>> !UnwindSafe for TrieBackend<S, H, C, R>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<T> Conv for T
impl<T> Conv for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
Formats each item in a sequence. Read more
source§impl<H, B> InspectState<H, B> for Bwhere
H: Hasher,
B: Backend<H>,
<H as Hasher>::Out: Encode,
impl<H, B> InspectState<H, B> for Bwhere
H: Hasher,
B: Backend<H>,
<H as Hasher>::Out: Encode,
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
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§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 more§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.