Struct sc_transaction_pool::ForkAwareTxPool
source · pub struct ForkAwareTxPool<ChainApi, Block>where
Block: BlockT,
ChainApi: ChainApi<Block = Block> + 'static,{ /* private fields */ }
Expand description
The fork-aware transaction pool.
It keeps track of every fork and provides the set of transactions that is valid for every fork.
Implementations§
source§impl<ChainApi, Block> ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> ForkAwareTxPool<ChainApi, Block>
sourcepub fn new_test(
pool_api: Arc<ChainApi>,
best_block_hash: Block::Hash,
finalized_hash: Block::Hash,
) -> (Self, ForkAwareTxPoolTask)
pub fn new_test( pool_api: Arc<ChainApi>, best_block_hash: Block::Hash, finalized_hash: Block::Hash, ) -> (Self, ForkAwareTxPoolTask)
Create new fork aware transaction pool with provided shared instance of ChainApi
intended
for tests.
sourcepub fn new_test_with_limits(
pool_api: Arc<ChainApi>,
best_block_hash: Block::Hash,
finalized_hash: Block::Hash,
ready_limits: PoolLimit,
future_limits: PoolLimit,
mempool_max_transactions_count: usize,
) -> (Self, ForkAwareTxPoolTask)
pub fn new_test_with_limits( pool_api: Arc<ChainApi>, best_block_hash: Block::Hash, finalized_hash: Block::Hash, ready_limits: PoolLimit, future_limits: PoolLimit, mempool_max_transactions_count: usize, ) -> (Self, ForkAwareTxPoolTask)
Create new fork aware transaction pool with given limits and with provided shared instance
of ChainApi
intended for tests.
sourcepub fn new_with_background_worker(
options: Options,
is_validator: IsValidator,
pool_api: Arc<ChainApi>,
prometheus: Option<&PrometheusRegistry>,
spawner: impl SpawnEssentialNamed,
best_block_hash: Block::Hash,
finalized_hash: Block::Hash,
) -> Self
pub fn new_with_background_worker( options: Options, is_validator: IsValidator, pool_api: Arc<ChainApi>, prometheus: Option<&PrometheusRegistry>, spawner: impl SpawnEssentialNamed, best_block_hash: Block::Hash, finalized_hash: Block::Hash, ) -> Self
Creates new fork aware transaction pool with the background revalidation worker.
The txpool essential tasks (including a revalidation worker) are spawned using provided spawner.
sourcepub fn status_all(&self) -> HashMap<Block::Hash, PoolStatus>
pub fn status_all(&self) -> HashMap<Block::Hash, PoolStatus>
Provides a status for all views at the tips of the forks.
sourcepub fn active_views_count(&self) -> usize
pub fn active_views_count(&self) -> usize
Provides a number of views at the tips of the forks.
sourcepub fn inactive_views_count(&self) -> usize
pub fn inactive_views_count(&self) -> usize
Provides a number of views at the tips of the forks.
sourcepub fn has_view(&self, hash: &Block::Hash) -> bool
pub fn has_view(&self, hash: &Block::Hash) -> bool
Checks if there is a view at the tip of the fork with given hash.
sourcepub fn mempool_len(&self) -> (usize, usize)
pub fn mempool_len(&self) -> (usize, usize)
Returns a number of unwatched and watched transactions in internal mempool.
Intended for use in unit tests.
sourcepub fn futures_at(
&self,
at: Block::Hash,
) -> Option<Vec<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>>
pub fn futures_at( &self, at: Block::Hash, ) -> Option<Vec<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>>
Returns a set of future transactions for given block hash.
Intended for logging / tests.
sourcepub async fn ready_at_light(
&self,
at: Block::Hash,
) -> Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>
pub async fn ready_at_light( &self, at: Block::Hash, ) -> Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>
Returns a best-effort set of ready transactions for a given block, without executing full maintain process.
The method attempts to build a temporary view and create an iterator of ready transactions
for a specific at
hash. If a valid view is found, it collects and prunes
transactions already included in the blocks and returns the valid set.
Pruning is just rebuilding the underlying transactions graph, no validations are executed, so this process shall be fast.
source§impl<Block, Client> ForkAwareTxPool<FullChainApi<Client, Block>, Block>where
Block: BlockT,
Client: ProvideRuntimeApi<Block> + BlockBackend<Block> + HeaderBackend<Block> + BlockIdTo<Block> + ExecutorProvider<Block> + UsageProvider<Block> + HeaderMetadata<Block, Error = Error> + Send + Sync + 'static,
Client::Api: TaggedTransactionQueue<Block>,
<Block as BlockT>::Hash: Unpin,
impl<Block, Client> ForkAwareTxPool<FullChainApi<Client, Block>, Block>where
Block: BlockT,
Client: ProvideRuntimeApi<Block> + BlockBackend<Block> + HeaderBackend<Block> + BlockIdTo<Block> + ExecutorProvider<Block> + UsageProvider<Block> + HeaderMetadata<Block, Error = Error> + Send + Sync + 'static,
Client::Api: TaggedTransactionQueue<Block>,
<Block as BlockT>::Hash: Unpin,
Trait Implementations§
source§impl<Block, Client> LocalTransactionPool for ForkAwareTxPool<FullChainApi<Client, Block>, Block>
impl<Block, Client> LocalTransactionPool for ForkAwareTxPool<FullChainApi<Client, Block>, Block>
§type Hash = <<FullChainApi<Client, Block> as ChainApi>::Block as Block>::Hash
type Hash = <<FullChainApi<Client, Block> as ChainApi>::Block as Block>::Hash
§type Error = <FullChainApi<Client, Block> as ChainApi>::Error
type Error = <FullChainApi<Client, Block> as ChainApi>::Error
source§fn submit_local(
&self,
_at: Block::Hash,
xt: LocalTransactionFor<Self>,
) -> Result<Self::Hash, Self::Error>
fn submit_local( &self, _at: Block::Hash, xt: LocalTransactionFor<Self>, ) -> Result<Self::Hash, Self::Error>
TransactionSource::Local
.source§impl<ChainApi, Block> MaintainedTransactionPool for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> MaintainedTransactionPool for ForkAwareTxPool<ChainApi, Block>
source§impl<ChainApi, Block> TransactionPool for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> TransactionPool for ForkAwareTxPool<ChainApi, Block>
source§fn submit_at<'life0, 'async_trait>(
&'life0 self,
__arg1: <Self::Block as BlockT>::Hash,
source: TransactionSource,
xts: Vec<TransactionFor<Self>>,
) -> Pin<Box<dyn Future<Output = Result<Vec<Result<TxHash<Self>, Self::Error>>, Self::Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn submit_at<'life0, 'async_trait>(
&'life0 self,
__arg1: <Self::Block as BlockT>::Hash,
source: TransactionSource,
xts: Vec<TransactionFor<Self>>,
) -> Pin<Box<dyn Future<Output = Result<Vec<Result<TxHash<Self>, Self::Error>>, Self::Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Submits multiple transactions and returns a future resolving to the submission results.
Actual transactions submission process is delegated to the ViewStore
internal instance.
The internal limits of the pool are checked. The results of submissions to individual views
are reduced to single result. Refer to reduce_multiview_result
for more details.
source§fn submit_one<'life0, 'async_trait>(
&'life0 self,
_at: <Self::Block as BlockT>::Hash,
source: TransactionSource,
xt: TransactionFor<Self>,
) -> Pin<Box<dyn Future<Output = Result<TxHash<Self>, Self::Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn submit_one<'life0, 'async_trait>(
&'life0 self,
_at: <Self::Block as BlockT>::Hash,
source: TransactionSource,
xt: TransactionFor<Self>,
) -> Pin<Box<dyn Future<Output = Result<TxHash<Self>, Self::Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Submits a single transaction and returns a future resolving to the submission results.
Actual transaction submission process is delegated to the submit_at
function.
source§fn submit_and_watch<'life0, 'async_trait>(
&'life0 self,
at: <Self::Block as BlockT>::Hash,
source: TransactionSource,
xt: TransactionFor<Self>,
) -> Pin<Box<dyn Future<Output = Result<Pin<Box<TransactionStatusStreamFor<Self>>>, Self::Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn submit_and_watch<'life0, 'async_trait>(
&'life0 self,
at: <Self::Block as BlockT>::Hash,
source: TransactionSource,
xt: TransactionFor<Self>,
) -> Pin<Box<dyn Future<Output = Result<Pin<Box<TransactionStatusStreamFor<Self>>>, Self::Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Submits a transaction and starts to watch its progress in the pool, returning a stream of status updates.
Actual transaction submission process is delegated to the ViewStore
internal instance.
source§fn remove_invalid(
&self,
hashes: &[TxHash<Self>],
) -> Vec<Arc<Self::InPoolTransaction>>
fn remove_invalid( &self, hashes: &[TxHash<Self>], ) -> Vec<Arc<Self::InPoolTransaction>>
Intended to remove transactions identified by the given hashes, and any dependent transactions, from the pool. In current implementation this function only outputs the error. Seems that API change is needed here to make this call reasonable.
source§fn status(&self) -> PoolStatus
fn status(&self) -> PoolStatus
Returns the pool status which includes information like the number of ready and future transactions.
Currently the status for the most recently notified best block is returned (for which maintain process was accomplished).
source§fn import_notification_stream(
&self,
) -> ImportNotificationStream<<<ChainApi as ChainApi>::Block as Block>::Hash>
fn import_notification_stream( &self, ) -> ImportNotificationStream<<<ChainApi as ChainApi>::Block as Block>::Hash>
Return an event stream of notifications when transactions are imported to the pool.
Consumers of this stream should use the ready
method to actually get the
pending transactions in the right order.
source§fn hash_of(&self, xt: &TransactionFor<Self>) -> TxHash<Self>
fn hash_of(&self, xt: &TransactionFor<Self>) -> TxHash<Self>
Returns the hash of a given transaction.
source§fn on_broadcasted(&self, propagations: HashMap<TxHash<Self>, Vec<String>>)
fn on_broadcasted(&self, propagations: HashMap<TxHash<Self>, Vec<String>>)
Notifies the pool about the broadcasting status of transactions.
source§fn ready_transaction(
&self,
tx_hash: &TxHash<Self>,
) -> Option<Arc<Self::InPoolTransaction>>
fn ready_transaction( &self, tx_hash: &TxHash<Self>, ) -> Option<Arc<Self::InPoolTransaction>>
Return specific ready transaction by hash, if there is one.
Currently the ready transaction is returned if it exists for the most recently notified best block (for which maintain process was accomplished).
source§fn ready_at<'life0, 'async_trait>(
&'life0 self,
at: <Self::Block as BlockT>::Hash,
) -> Pin<Box<dyn Future<Output = Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn ready_at<'life0, 'async_trait>(
&'life0 self,
at: <Self::Block as BlockT>::Hash,
) -> Pin<Box<dyn Future<Output = Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Returns an iterator for ready transactions at a specific block, ordered by priority.
source§fn ready(
&self,
) -> Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>
fn ready( &self, ) -> Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>
Returns an iterator for ready transactions, ordered by priority.
Currently the set of ready transactions is returned if it exists for the most recently notified best block (for which maintain process was accomplished).
source§fn futures(&self) -> Vec<Self::InPoolTransaction>
fn futures(&self) -> Vec<Self::InPoolTransaction>
Returns a list of future transactions in the pool.
Currently the set of future transactions is returned if it exists for the most recently notified best block (for which maintain process was accomplished).
source§fn ready_at_with_timeout<'life0, 'async_trait>(
&'life0 self,
at: <Self::Block as BlockT>::Hash,
timeout: Duration,
) -> Pin<Box<dyn Future<Output = Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn ready_at_with_timeout<'life0, 'async_trait>(
&'life0 self,
at: <Self::Block as BlockT>::Hash,
timeout: Duration,
) -> Pin<Box<dyn Future<Output = Box<dyn ReadyTransactions<Item = Arc<Transaction<<<ChainApi as ChainApi>::Block as Block>::Hash, Arc<<<ChainApi as ChainApi>::Block as Block>::Extrinsic>>>> + Send>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Returns a set of ready transactions at a given block within the specified timeout.
If the timeout expires before the maintain process is accomplished, a best-effort
set of transactions is returned (refer to ready_at_light
).
Auto Trait Implementations§
impl<ChainApi, Block> Freeze for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> !RefUnwindSafe for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> Send for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> Sync for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> Unpin for ForkAwareTxPool<ChainApi, Block>
impl<ChainApi, Block> !UnwindSafe for ForkAwareTxPool<ChainApi, 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
§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,
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,
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,
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,
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,
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,
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,
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,
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,
§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>
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>
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<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
§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,
§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,
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,
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
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
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
self
, then passes self.deref()
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>,
T
. Read more§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
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
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
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
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
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
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
.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
.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
.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
.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
.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
.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
.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
unchecked_from
.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.