Struct oberon::inner_types::elliptic_curve::bigint::generic_array::typenum::PInt
source · pub struct PInt<U>where
U: Unsigned + NonZero,{ /* private fields */ }
Expand description
Type-level signed integers with positive sign.
Implementations§
Trait Implementations§
source§impl<Ul, Ur> Add<NInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>,
Ur: Unsigned + NonZero,
impl<Ul, Ur> Add<NInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>, Ur: Unsigned + NonZero,
P(Ul) + N(Ur)
: We resolve this with our PrivateAdd
source§impl<Ul, Ur> Add<PInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero,
Ur: Unsigned + NonZero + Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>,
impl<Ul, Ur> Add<PInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero, Ur: Unsigned + NonZero + Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>,
N(Ul) + P(Ur)
: We resolve this with our PrivateAdd
source§impl<Ul, Ur> Add<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Add<Ur>,
Ur: Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Add<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Add<Ur>, Ur: Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
P(Ul) + P(Ur) = P(Ul + Ur)
source§impl<P, N> Cmp<NInt<N>> for PInt<P>where
P: Unsigned + NonZero,
N: Unsigned + NonZero,
impl<P, N> Cmp<NInt<N>> for PInt<P>where P: Unsigned + NonZero, N: Unsigned + NonZero,
X > - Y
source§impl<Pl, Pr> Cmp<PInt<Pr>> for PInt<Pl>where
Pl: Cmp<Pr> + Unsigned + NonZero,
Pr: Unsigned + NonZero,
impl<Pl, Pr> Cmp<PInt<Pr>> for PInt<Pl>where Pl: Cmp<Pr> + Unsigned + NonZero, Pr: Unsigned + NonZero,
X <==> Y
source§impl<Ul, Ur> Div<NInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Cmp<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur> Div<NInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Cmp<Ur>, Ur: Unsigned + NonZero, PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>,
$A<Ul> / $B<Ur> = $R<Ul / Ur>
source§impl<Ul, Ur> Div<PInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero + Cmp<Ur>,
Ur: Unsigned + NonZero,
NInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur> Div<PInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Cmp<Ur>, Ur: Unsigned + NonZero, NInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
$A<Ul> / $B<Ur> = $R<Ul / Ur>
source§impl<Ul, Ur> Div<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Cmp<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur> Div<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Cmp<Ur>, Ur: Unsigned + NonZero, PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
$A<Ul> / $B<Ur> = $R<Ul / Ur>
source§impl<U1, U2> Gcd<NInt<U2>> for PInt<U1>where
U1: Unsigned + NonZero + Gcd<U2>,
U2: Unsigned + NonZero,
<U1 as Gcd<U2>>::Output: Unsigned + NonZero,
impl<U1, U2> Gcd<NInt<U2>> for PInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, <U1 as Gcd<U2>>::Output: Unsigned + NonZero,
source§impl<U1, U2> Gcd<PInt<U2>> for NInt<U1>where
U1: Unsigned + NonZero + Gcd<U2>,
U2: Unsigned + NonZero,
<U1 as Gcd<U2>>::Output: Unsigned + NonZero,
impl<U1, U2> Gcd<PInt<U2>> for NInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, <U1 as Gcd<U2>>::Output: Unsigned + NonZero,
source§impl<U1, U2> Gcd<PInt<U2>> for PInt<U1>where
U1: Unsigned + NonZero + Gcd<U2>,
U2: Unsigned + NonZero,
<U1 as Gcd<U2>>::Output: Unsigned + NonZero,
impl<U1, U2> Gcd<PInt<U2>> for PInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, <U1 as Gcd<U2>>::Output: Unsigned + NonZero,
source§impl<Ul, Ur> Max<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Max<Ur>,
Ur: Unsigned + NonZero,
<Ul as Max<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Max<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Max<Ur>, Ur: Unsigned + NonZero, <Ul as Max<Ur>>::Output: Unsigned + NonZero,
source§impl<Ul, Ur> Min<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Min<Ur>,
Ur: Unsigned + NonZero,
<Ul as Min<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Min<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Min<Ur>, Ur: Unsigned + NonZero, <Ul as Min<Ur>>::Output: Unsigned + NonZero,
source§impl<Ul, Ur> Mul<NInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Mul<Ur>,
Ur: Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Mul<NInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Mul<Ur>, Ur: Unsigned + NonZero, <Ul as Mul<Ur>>::Output: Unsigned + NonZero,
P(Ul) * N(Ur) = N(Ul * Ur)
source§impl<Ul, Ur> Mul<PInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero + Mul<Ur>,
Ur: Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Mul<PInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Mul<Ur>, Ur: Unsigned + NonZero, <Ul as Mul<Ur>>::Output: Unsigned + NonZero,
N(Ul) * P(Ur) = N(Ul * Ur)
source§impl<Ul, Ur> Mul<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Mul<Ur>,
Ur: Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Mul<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Mul<Ur>, Ur: Unsigned + NonZero, <Ul as Mul<Ur>>::Output: Unsigned + NonZero,
P(Ul) * P(Ur) = P(Ul * Ur)
source§impl<V, A, U> Mul<TArr<V, A>> for PInt<U>where
U: Unsigned + NonZero,
PInt<U>: Mul<A> + Mul<V>,
impl<V, A, U> Mul<TArr<V, A>> for PInt<U>where U: Unsigned + NonZero, PInt<U>: Mul<A> + Mul<V>,
source§impl<U> Ord for PInt<U>where
U: Ord + Unsigned + NonZero,
impl<U> Ord for PInt<U>where U: Ord + Unsigned + NonZero,
source§impl<U> PartialEq<PInt<U>> for PInt<U>where
U: PartialEq<U> + Unsigned + NonZero,
impl<U> PartialEq<PInt<U>> for PInt<U>where U: PartialEq<U> + Unsigned + NonZero,
source§impl<U> PartialOrd<PInt<U>> for PInt<U>where
U: PartialOrd<U> + Unsigned + NonZero,
impl<U> PartialOrd<PInt<U>> for PInt<U>where U: PartialOrd<U> + Unsigned + NonZero,
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<Ul, Ur> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul>where
Ul: Unsigned + NonZero + Pow<UInt<Ur, B0>>,
Ur: Unsigned,
<Ul as Pow<UInt<Ur, B0>>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul>where Ul: Unsigned + NonZero + Pow<UInt<Ur, B0>>, Ur: Unsigned, <Ul as Pow<UInt<Ur, B0>>>::Output: Unsigned + NonZero,
N(Ul)^P(Ur) = P(Ul^Ur) if Ur is even
source§impl<Ul, Ur> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul>where
Ul: Unsigned + NonZero + Pow<UInt<Ur, B1>>,
Ur: Unsigned,
<Ul as Pow<UInt<Ur, B1>>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul>where Ul: Unsigned + NonZero + Pow<UInt<Ur, B1>>, Ur: Unsigned, <Ul as Pow<UInt<Ur, B1>>>::Output: Unsigned + NonZero,
N(Ul)^P(Ur) = N(Ul^Ur) if Ur is odd
source§impl<Ul, Ur> Pow<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Pow<Ur>,
Ur: Unsigned + NonZero,
<Ul as Pow<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Pow<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Pow<Ur>, Ur: Unsigned + NonZero, <Ul as Pow<Ur>>::Output: Unsigned + NonZero,
P(Ul)^P(Ur) = P(Ul^Ur)
source§impl<Ul, Ur> Rem<NInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur> Rem<NInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Rem<Ur>, Ur: Unsigned + NonZero, PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
source§impl<Ul, Ur> Rem<PInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur> Rem<PInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Rem<Ur>, Ur: Unsigned + NonZero, NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
source§impl<Ul, Ur> Rem<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur> Rem<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Rem<Ur>, Ur: Unsigned + NonZero, PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
source§impl<Ul, Ur> Sub<NInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Add<Ur>,
Ur: Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Sub<NInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Add<Ur>, Ur: Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
P(Ul) - N(Ur) = P(Ul + Ur)
source§impl<Ul, Ur> Sub<PInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero + Add<Ur>,
Ur: Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur> Sub<PInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Add<Ur>, Ur: Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
N(Ul) - P(Ur) = N(Ul + Ur)
source§impl<Ul, Ur> Sub<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>,
Ur: Unsigned + NonZero,
impl<Ul, Ur> Sub<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>, Ur: Unsigned + NonZero,
P(Ul) - P(Ur)
: We resolve this with our PrivateAdd
impl<U> Copy for PInt<U>where U: Copy + Unsigned + NonZero,
impl<U> Eq for PInt<U>where U: Eq + Unsigned + NonZero,
impl<U> NonZero for PInt<U>where U: Unsigned + NonZero,
impl<U> PowerOfTwo for PInt<U>where U: Unsigned + NonZero + PowerOfTwo,
impl<U> StructuralEq for PInt<U>where U: Unsigned + NonZero,
impl<U> StructuralPartialEq for PInt<U>where U: Unsigned + NonZero,
Auto Trait Implementations§
impl<U> RefUnwindSafe for PInt<U>where U: RefUnwindSafe,
impl<U> Send for PInt<U>where U: Send,
impl<U> Sync for PInt<U>where U: Sync,
impl<U> Unpin for PInt<U>where U: Unpin,
impl<U> UnwindSafe for PInt<U>where U: UnwindSafe,
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> 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<M, N> PartialDiv<N> for Mwhere
M: Integer + Div<N> + Rem<N, Output = Z0>,
impl<M, N> PartialDiv<N> for Mwhere M: Integer + Div<N> + Rem<N, Output = Z0>,
source§fn partial_div(self, rhs: N) -> <M as PartialDiv<N>>::Output
fn partial_div(self, rhs: N) -> <M as PartialDiv<N>>::Output
Method for performing the division
§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> 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.