Struct frame::runtime::apis::TrieBackend
pub struct TrieBackend<S, H, C = LocalTrieCache<H>>where
S: TrieBackendStorage<H>,
H: Hasher,{ /* private fields */ }Expand description
Patricia trie-based backend. Transaction type is an overlay of changes to commit.
Implementations§
§impl<H> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
H: Hasher,
<H as Hasher>::Out: Codec + Ord,
impl<H> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where H: Hasher, <H as Hasher>::Out: Codec + Ord,
pub fn update<T>(
&self,
changes: T,
state_version: StateVersion
) -> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
T: IntoIterator<Item = (Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>)>,
pub fn update<T>( &self, changes: T, state_version: StateVersion ) -> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where T: IntoIterator<Item = (Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>)>,
Copy the state, with applied updates
pub fn insert<T>(&mut self, changes: T, state_version: StateVersion)where
T: IntoIterator<Item = (Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>)>,
pub fn insert<T>(&mut self, changes: T, state_version: StateVersion)where T: IntoIterator<Item = (Option<ChildInfo>, Vec<(Vec<u8, Global>, Option<Vec<u8, Global>>), Global>)>,
Insert values into backend trie.
pub fn update_backend(
&self,
root: <H as Hasher>::Out,
changes: MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>
) -> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>
pub fn update_backend( &self, root: <H as Hasher>::Out, changes: MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>> ) -> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>
Merge trie nodes into this backend.
§impl<S, H, C> TrieBackend<S, H, C>where
S: TrieBackendStorage<H>,
H: Hasher,
C: TrieCacheProvider<H> + Send + Sync,
<H as Hasher>::Out: Codec,
impl<S, H, C> TrieBackend<S, H, C>where S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync, <H as Hasher>::Out: Codec,
pub fn essence(&self) -> &TrieBackendEssence<S, H, C>
pub fn essence(&self) -> &TrieBackendEssence<S, H, C>
Get backend essence reference.
pub fn backend_storage_mut(&mut self) -> &mut S
pub fn backend_storage_mut(&mut self) -> &mut S
Get backend storage reference.
pub fn backend_storage(&self) -> &S
pub fn backend_storage(&self) -> &S
Get backend storage reference.
pub fn into_storage(self) -> S
pub fn into_storage(self) -> S
Consumes self and returns underlying storage.
pub 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§
§impl<S, H, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>where
S: TrieBackendStorage<H>,
H: Hasher,
impl<S, H, C> AsTrieBackend<H, C> for TrieBackend<S, H, C>where S: TrieBackendStorage<H>, H: Hasher,
§type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
§fn as_trie_backend(&self) -> &TrieBackend<S, H, C>
fn as_trie_backend(&self) -> &TrieBackend<S, H, C>
Return the type as
TrieBackend.§impl<S, H, C> Backend<H> for TrieBackend<S, H, C>where
S: TrieBackendStorage<H>,
H: Hasher,
C: TrieCacheProvider<H> + Send + Sync,
<H as Hasher>::Out: Ord + Codec,
impl<S, H, C> Backend<H> for TrieBackend<S, H, C>where S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H> + Send + Sync, <H as Hasher>::Out: Ord + Codec,
§type TrieBackendStorage = S
type TrieBackendStorage = S
Type of trie backend storage.
§fn storage_hash(
&self,
key: &[u8]
) -> Result<Option<<H as Hasher>::Out>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn storage_hash( &self, key: &[u8] ) -> Result<Option<<H as Hasher>::Out>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Get keyed storage value hash or None if there is nothing associated.
§fn storage(
&self,
key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn storage( &self, key: &[u8] ) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Get keyed storage or None if there is nothing associated.
§fn child_storage_hash(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<<H as Hasher>::Out>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn child_storage_hash( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<<H as Hasher>::Out>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Get child keyed storage value hash or None if there is nothing associated.
§fn child_storage(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn child_storage( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Get child keyed child storage or None if there is nothing associated.
§fn closest_merkle_value(
&self,
key: &[u8]
) -> Result<Option<MerkleValue<<H as Hasher>::Out>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn closest_merkle_value( &self, key: &[u8] ) -> Result<Option<MerkleValue<<H as Hasher>::Out>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Get the merkle value or None if there is nothing associated.
§fn child_closest_merkle_value(
&self,
child_info: &ChildInfo,
key: &[u8]
) -> Result<Option<MerkleValue<<H as Hasher>::Out>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn child_closest_merkle_value( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<MerkleValue<<H as Hasher>::Out>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Get the child merkle value or None if there is nothing associated.
§fn next_storage_key(
&self,
key: &[u8]
) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn next_storage_key( &self, key: &[u8] ) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::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, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn next_child_storage_key( &self, child_info: &ChildInfo, key: &[u8] ) -> Result<Option<Vec<u8, Global>>, <TrieBackend<S, H, C> as Backend<H>>::Error>
Return the next key in child storage in lexicographic order or
None if there is no value.§fn raw_iter(
&self,
args: IterArgs<'_>
) -> Result<<TrieBackend<S, H, C> as Backend<H>>::RawIter, <TrieBackend<S, H, C> as Backend<H>>::Error>
fn raw_iter( &self, args: IterArgs<'_> ) -> Result<<TrieBackend<S, H, C> as Backend<H>>::RawIter, <TrieBackend<S, H, C> as Backend<H>>::Error>
Returns a lifetimeless raw storage iterator.
§fn storage_root<'a>(
&self,
delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>,
state_version: StateVersion
) -> (<H as Hasher>::Out, MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>)where
<H as Hasher>::Out: Ord,
fn storage_root<'a>( &self, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion ) -> (<H as Hasher>::Out, MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>)where <H as Hasher>::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]>)>,
state_version: StateVersion
) -> (<H as Hasher>::Out, bool, MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>)where
<H as Hasher>::Out: Ord,
fn child_storage_root<'a>( &self, child_info: &ChildInfo, delta: impl Iterator<Item = (&'a [u8], Option<&'a [u8]>)>, state_version: StateVersion ) -> (<H as Hasher>::Out, bool, MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>)where <H as Hasher>::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 register_overlay_stats(&self, _stats: &StateMachineStats)
fn register_overlay_stats(&self, _stats: &StateMachineStats)
Register stats from overlay of state machine. Read more
§fn usage_info(&self) -> UsageInfo
fn usage_info(&self) -> UsageInfo
Query backend usage statistics (i/o, memory) Read more
§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.
§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.
§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.
§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, Global>>)where
<H as Hasher>::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 as Hasher>::Out, MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>)where <H as Hasher>::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.
§fn commit(
&self,
_: <H as Hasher>::Out,
_: MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>,
_: 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>
fn commit( &self, _: <H as Hasher>::Out, _: MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, _: 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 reset_read_write_count(&self)
fn reset_read_write_count(&self)
Get the read/write count of the db
§fn get_whitelist(&self) -> Vec<TrackedStorageKey, Global>
fn get_whitelist(&self) -> Vec<TrackedStorageKey, Global>
Get the whitelist for tracking db reads/writes
§fn set_whitelist(&self, _: Vec<TrackedStorageKey, Global>)
fn set_whitelist(&self, _: Vec<TrackedStorageKey, Global>)
Update the whitelist for tracking db reads/writes
§fn proof_size(&self) -> Option<u32>
fn proof_size(&self) -> Option<u32>
Estimate proof size
§impl<H> Clone for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
H: Hasher,
<H as Hasher>::Out: Codec + Ord,
impl<H> Clone for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where H: Hasher, <H as Hasher>::Out: Codec + Ord,
§impl<S, H, C> Debug for TrieBackend<S, H, C>where
S: TrieBackendStorage<H>,
H: Hasher,
C: TrieCacheProvider<H>,
impl<S, H, C> Debug for TrieBackend<S, H, C>where S: TrieBackendStorage<H>, H: Hasher, C: TrieCacheProvider<H>,
§impl<H> Default for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
H: Hasher,
<H as Hasher>::Out: Codec + Ord,
impl<H> Default for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where H: Hasher, <H as Hasher>::Out: Codec + Ord,
§impl<H> From<(BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, StateVersion)> for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
H: Hasher,
<H as Hasher>::Out: Codec + Ord,
impl<H> From<(BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, StateVersion)> for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where H: Hasher, <H as Hasher>::Out: Codec + Ord,
§impl<H> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, RandomState>, StateVersion)> for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
H: Hasher,
<H as Hasher>::Out: Codec + Ord,
impl<H> From<(HashMap<Option<ChildInfo>, BTreeMap<Vec<u8, Global>, Vec<u8, Global>, Global>, RandomState>, StateVersion)> for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where H: Hasher, <H as Hasher>::Out: Codec + Ord,
§impl<H> From<(Storage, StateVersion)> for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where
H: Hasher,
<H as Hasher>::Out: Codec + Ord,
impl<H> From<(Storage, StateVersion)> for TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>where H: Hasher, <H as Hasher>::Out: Codec + Ord,
§fn from(
_: (Storage, StateVersion)
) -> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>
fn from( _: (Storage, StateVersion) ) -> TrieBackend<MemoryDB<H, PrefixedKey<H>, Vec<u8, Global>>, H, LocalTrieCache<H>>
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: Send + 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> 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
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,
§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
§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,
§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>
§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) -> Rwhere
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> Rwhere
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere
Self: AsRef<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,
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) -> Rwhere
Self: AsMut<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,
Mutably borrows
self, then passes self.as_mut() into the pipe
function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,
§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 more§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
Immutable access to the
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
Mutable access to the
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
Immutable access to the
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
Mutable access to the
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere
Self: Deref<Target = T>,
T: ?Sized,
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,
Immutable access to the
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere
Self: DerefMut<Target = T> + Deref,
T: ?Sized,
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,
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)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
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)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
Calls
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
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)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
Calls
.tap_ref_mut() 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.§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T.