Struct order_book::OrderBook
source · pub struct OrderBook<T>where
T: Config,{
pub order_book_id: OrderBookId<AssetIdOf<T>, T::DEXId>,
pub status: OrderBookStatus,
pub last_order_id: T::OrderId,
pub tick_size: OrderPrice,
pub step_lot_size: OrderVolume,
pub min_lot_size: OrderVolume,
pub max_lot_size: OrderVolume,
}
Fields§
§order_book_id: OrderBookId<AssetIdOf<T>, T::DEXId>
§status: OrderBookStatus
§last_order_id: T::OrderId
§tick_size: OrderPrice
§step_lot_size: OrderVolume
§min_lot_size: OrderVolume
§max_lot_size: OrderVolume
Implementations§
source§impl<T: Config + Sized> OrderBook<T>
impl<T: Config + Sized> OrderBook<T>
pub fn new( order_book_id: OrderBookId<AssetIdOf<T>, T::DEXId>, tick_size: OrderPrice, step_lot_size: OrderVolume, min_lot_size: OrderVolume, max_lot_size: OrderVolume ) -> Self
pub fn default(order_book_id: OrderBookId<AssetIdOf<T>, T::DEXId>) -> Self
pub fn default_indivisible( order_book_id: OrderBookId<AssetIdOf<T>, T::DEXId> ) -> Self
pub fn next_order_id(&mut self) -> T::OrderId
sourcepub fn place_limit_order(
&self,
limit_order: LimitOrder<T>,
data: &mut impl DataLayer<T>
) -> Result<(), DispatchError>
pub fn place_limit_order( &self, limit_order: LimitOrder<T>, data: &mut impl DataLayer<T> ) -> Result<(), DispatchError>
Tries to place the limit order and returns market input & deal input amounts. In some cases if the limit order crosses the spread, part or all of the amount could be converted into a market order and as a result, the deal input is not empty.
pub fn cancel_limit_order( &self, limit_order: LimitOrder<T>, data: &mut impl DataLayer<T> ) -> Result<(), DispatchError>
pub fn cancel_all_limit_orders( &self, data: &mut impl DataLayer<T> ) -> Result<usize, DispatchError>
sourcepub fn execute_market_order(
&self,
market_order: MarketOrder<T>,
data: &mut impl DataLayer<T>
) -> Result<(OrderAmount, OrderAmount), DispatchError>
pub fn execute_market_order( &self, market_order: MarketOrder<T>, data: &mut impl DataLayer<T> ) -> Result<(OrderAmount, OrderAmount), DispatchError>
Executes market order and returns input & output amounts
pub fn align_limit_orders( &self, data: &mut impl DataLayer<T> ) -> Result<(), DispatchError>
pub fn calculate_market_order_impact( &self, market_order: MarketOrder<T>, data: &mut impl DataLayer<T> ) -> Result<MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, DispatchError>
pub fn calculate_limit_order_impact( &self, limit_order: LimitOrder<T> ) -> Result<MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, DispatchError>
pub fn calculate_cancelation_limit_order_impact( &self, limit_order: LimitOrder<T>, ignore_unschedule_error: bool ) -> Result<MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, DispatchError>
pub fn calculate_cancelation_of_all_limit_orders_impact( &self, data: &mut impl DataLayer<T> ) -> Result<MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, DispatchError>
pub fn calculate_align_limit_orders_impact( &self, data: &mut impl DataLayer<T> ) -> Result<MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, DispatchError>
pub fn calculate_deal( &self, input_asset_id: &AssetIdOf<T>, output_asset_id: &AssetIdOf<T>, amount: QuoteAmount<Balance>, data: &mut impl DataLayer<T> ) -> Result<DealInfo<AssetIdOf<T>>, DispatchError>
sourcepub fn sum_market<'a>(
&self,
market_data: impl Iterator<Item = (&'a OrderPrice, &'a OrderVolume)>,
depth_limit: Option<OrderAmount>
) -> Result<(OrderAmount, OrderAmount), DispatchError>
pub fn sum_market<'a>( &self, market_data: impl Iterator<Item = (&'a OrderPrice, &'a OrderVolume)>, depth_limit: Option<OrderAmount> ) -> Result<(OrderAmount, OrderAmount), DispatchError>
Summarizes and returns base
and quote
volumes of market depth.
If depth_limit
is defined, it counts the maximum possible base
and quote
volumes under the limit,
Otherwise returns the sum of whole market depth.
pub fn apply_market_change( &self, market_change: MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, data: &mut impl DataLayer<T> ) -> Result<(), DispatchError>
pub fn get_direction( &self, input_asset_id: &AssetIdOf<T>, output_asset_id: &AssetIdOf<T> ) -> Result<PriceVariant, DispatchError>
pub fn align_amount(&self, amount: OrderVolume) -> OrderVolume
pub fn best_bid( &self, data: &mut impl DataLayer<T> ) -> Option<(OrderPrice, OrderVolume)>
pub fn best_ask( &self, data: &mut impl DataLayer<T> ) -> Option<(OrderPrice, OrderVolume)>
pub fn cross_spread<'a>( &self, limit_order: LimitOrder<T>, data: &mut impl DataLayer<T> ) -> Result<MarketChange<T::AccountId, T::AssetId, T::DEXId, T::OrderId, LimitOrder<T>>, DispatchError>
sourcepub fn calculate_market_depth_to_price<'a>(
side: PriceVariant,
price: OrderPrice,
amount: OrderVolume,
market_data: impl Iterator<Item = (&'a OrderPrice, &'a OrderVolume)>
) -> (OrderVolume, OrderVolume)
pub fn calculate_market_depth_to_price<'a>( side: PriceVariant, price: OrderPrice, amount: OrderVolume, market_data: impl Iterator<Item = (&'a OrderPrice, &'a OrderVolume)> ) -> (OrderVolume, OrderVolume)
Calculates and returns the sum of limit orders up to the price
or until the amount
is reached
and remaining amount
if it is greater than the market volume.
Trait Implementations§
source§impl<T> Decode for OrderBook<T>where
T: Config,
OrderBookId<AssetIdOf<T>, T::DEXId>: Decode,
T::OrderId: Decode,
impl<T> Decode for OrderBook<T>where T: Config, OrderBookId<AssetIdOf<T>, T::DEXId>: Decode, T::OrderId: Decode,
source§fn decode<__CodecInputEdqy: Input>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Self, Error>
fn decode<__CodecInputEdqy: Input>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<Self, Error>
Attempt to deserialise the value from input.
§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self> ) -> Result<DecodeFinished, Error>where I: Input,
Attempt to deserialize the value from input into a pre-allocated piece of memory. Read more
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where I: Input,
Attempt to skip the encoded value from input. Read more
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
Returns the fixed encoded size of the type. Read more
source§impl<T> Encode for OrderBook<T>where
T: Config,
OrderBookId<AssetIdOf<T>, T::DEXId>: Encode,
T::OrderId: Encode,
impl<T> Encode for OrderBook<T>where T: Config, OrderBookId<AssetIdOf<T>, T::DEXId>: Encode, T::OrderId: Encode,
source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
If possible give a hint of expected size of the encoding. Read more
source§fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )
Convert self to a slice and append it to the destination.
§fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,
Convert self to a slice and then invoke the given closure with it.
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
Calculates the encoded size. Read more
source§impl<T> MaxEncodedLen for OrderBook<T>where
T: Config,
OrderBookId<AssetIdOf<T>, T::DEXId>: MaxEncodedLen,
T::OrderId: MaxEncodedLen,
impl<T> MaxEncodedLen for OrderBook<T>where T: Config, OrderBookId<AssetIdOf<T>, T::DEXId>: MaxEncodedLen, T::OrderId: MaxEncodedLen,
source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
Upper bound, in bytes, of the maximum encoded size of this item.
source§impl<T> PartialEq<OrderBook<T>> for OrderBook<T>where
T: Config + PartialEq,
T::DEXId: PartialEq,
T::OrderId: PartialEq,
impl<T> PartialEq<OrderBook<T>> for OrderBook<T>where T: Config + PartialEq, T::DEXId: PartialEq, T::OrderId: PartialEq,
source§impl<T> TypeInfo for OrderBook<T>where
T: Config + 'static,
OrderBookId<AssetIdOf<T>, T::DEXId>: TypeInfo + 'static,
T::OrderId: TypeInfo + 'static,
impl<T> TypeInfo for OrderBook<T>where T: Config + 'static, OrderBookId<AssetIdOf<T>, T::DEXId>: TypeInfo + 'static, T::OrderId: TypeInfo + 'static,
impl<T> EncodeLike<OrderBook<T>> for OrderBook<T>where T: Config, OrderBookId<AssetIdOf<T>, T::DEXId>: Encode, T::OrderId: Encode,
impl<T> Eq for OrderBook<T>where T: Config + Eq, T::DEXId: Eq, T::OrderId: Eq,
impl<T> StructuralEq for OrderBook<T>where T: Config,
impl<T> StructuralPartialEq for OrderBook<T>where T: Config,
Auto Trait Implementations§
impl<T> RefUnwindSafe for OrderBook<T>where <T as Config>::AssetId: RefUnwindSafe, <T as Config>::DEXId: RefUnwindSafe, <T as Config>::OrderId: RefUnwindSafe,
impl<T> Send for OrderBook<T>where <T as Config>::DEXId: Send,
impl<T> Sync for OrderBook<T>where <T as Config>::DEXId: Sync,
impl<T> Unpin for OrderBook<T>where <T as Config>::AssetId: Unpin, <T as Config>::DEXId: Unpin, <T as Config>::OrderId: Unpin,
impl<T> UnwindSafe for OrderBook<T>where <T as Config>::AssetId: UnwindSafe, <T as Config>::DEXId: UnwindSafe, <T as Config>::OrderId: UnwindSafe,
Blanket Implementations§
§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> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere T: Decode,
§fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Decode
Self
and consume all of the given input data. Read more§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere T: Decode,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
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
.§fn as_any(&self) -> &(dyn Any + 'static)
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.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§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<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere T: Codec,
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> IsType<T> for T
impl<T> IsType<T> for T
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere T: Codec,
§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<A> PureOrWrapped<A> for A
impl<A> PureOrWrapped<A> for A
§fn is_wrapped_regular(&self) -> bool
fn is_wrapped_regular(&self) -> bool
The entity is a wrapped
Regular
.§fn is_wrapped(&self) -> bool
fn is_wrapped(&self) -> bool
The entity is wrapped.
§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
.