pub type P2 = PInt<U2>;
Aliased Type§
struct P2 { /* private fields */ }
Implementations§
Trait Implementations§
source§impl<Ul, Ur: Unsigned + NonZero> Add<NInt<Ur>> for PInt<Ul>where
Ul: Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur> + Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Add<NInt<Ur>> for PInt<Ul>where Ul: Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur> + Unsigned + NonZero,
P(Ul) + N(Ur)
: We resolve this with our PrivateAdd
source§impl<Ul, Ur: Unsigned + NonZero> Add<PInt<Ur>> for PInt<Ul>where
Ul: Add<Ur> + Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Add<PInt<Ur>> for PInt<Ul>where Ul: Add<Ur> + Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
P(Ul) + P(Ur) = P(Ul + Ur)
source§impl<Pl: Cmp<Pr> + Unsigned + NonZero, Pr: Unsigned + NonZero> Cmp<PInt<Pr>> for PInt<Pl>
impl<Pl: Cmp<Pr> + Unsigned + NonZero, Pr: Unsigned + NonZero> Cmp<PInt<Pr>> for PInt<Pl>
X <==> Y
source§impl<Ul, Ur: Unsigned + NonZero> Div<NInt<Ur>> for PInt<Ul>where
Ul: Cmp<Ur> + Unsigned + NonZero,
PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Div<NInt<Ur>> for PInt<Ul>where Ul: Cmp<Ur> + Unsigned + NonZero, PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>,
$A<Ul> / $B<Ur> = $R<Ul / Ur>
source§impl<Ul, Ur: Unsigned + NonZero> Div<PInt<Ur>> for PInt<Ul>where
Ul: Cmp<Ur> + Unsigned + NonZero,
PInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Div<PInt<Ur>> for PInt<Ul>where Ul: Cmp<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,
Gcf<U1, U2>: Unsigned + NonZero,
impl<U1, U2> Gcd<NInt<U2>> for PInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, Gcf<U1, U2>: Unsigned + NonZero,
source§impl<U1, U2> Gcd<PInt<U2>> for PInt<U1>where
U1: Unsigned + NonZero + Gcd<U2>,
U2: Unsigned + NonZero,
Gcf<U1, U2>: Unsigned + NonZero,
impl<U1, U2> Gcd<PInt<U2>> for PInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, Gcf<U1, U2>: Unsigned + NonZero,
source§impl<Ul, Ur> Max<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Max<Ur>,
Ur: Unsigned + NonZero,
Maximum<Ul, Ur>: Unsigned + NonZero,
impl<Ul, Ur> Max<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Max<Ur>, Ur: Unsigned + NonZero, Maximum<Ul, Ur>: Unsigned + NonZero,
source§impl<Ul, Ur> Min<PInt<Ur>> for PInt<Ul>where
Ul: Unsigned + NonZero + Min<Ur>,
Ur: Unsigned + NonZero,
Minimum<Ul, Ur>: Unsigned + NonZero,
impl<Ul, Ur> Min<PInt<Ur>> for PInt<Ul>where Ul: Unsigned + NonZero + Min<Ur>, Ur: Unsigned + NonZero, Minimum<Ul, Ur>: Unsigned + NonZero,
source§impl<Ul, Ur: Unsigned + NonZero> Mul<NInt<Ur>> for PInt<Ul>where
Ul: Mul<Ur> + Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Mul<NInt<Ur>> for PInt<Ul>where Ul: Mul<Ur> + Unsigned + NonZero, <Ul as Mul<Ur>>::Output: Unsigned + NonZero,
P(Ul) * N(Ur) = N(Ul * Ur)
source§impl<Ul, Ur: Unsigned + NonZero> Mul<PInt<Ur>> for PInt<Ul>where
Ul: Mul<Ur> + Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Mul<PInt<Ur>> for PInt<Ul>where Ul: Mul<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 + Unsigned + NonZero> Ord for PInt<U>
impl<U: Ord + Unsigned + NonZero> Ord for PInt<U>
source§impl<U: PartialEq + Unsigned + NonZero> PartialEq<PInt<U>> for PInt<U>
impl<U: PartialEq + Unsigned + NonZero> PartialEq<PInt<U>> for PInt<U>
source§impl<U: PartialOrd + Unsigned + NonZero> PartialOrd<PInt<U>> for PInt<U>
impl<U: PartialOrd + Unsigned + NonZero> PartialOrd<PInt<U>> for PInt<U>
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: Unsigned + NonZero> Pow<PInt<Ur>> for PInt<Ul>where
Ul: Pow<Ur> + Unsigned + NonZero,
<Ul as Pow<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Pow<PInt<Ur>> for PInt<Ul>where Ul: Pow<Ur> + Unsigned + NonZero, <Ul as Pow<Ur>>::Output: Unsigned + NonZero,
P(Ul)^P(Ur) = P(Ul^Ur)
source§impl<Ul, Ur: Unsigned + NonZero> Rem<NInt<Ur>> for PInt<Ul>where
Ul: Rem<Ur> + Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Rem<NInt<Ur>> for PInt<Ul>where Ul: Rem<Ur> + Unsigned + NonZero, PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
source§impl<Ul, Ur: Unsigned + NonZero> Rem<PInt<Ur>> for PInt<Ul>where
Ul: Rem<Ur> + Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Rem<PInt<Ur>> for PInt<Ul>where Ul: Rem<Ur> + Unsigned + NonZero, PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
source§impl<Ul, Ur: Unsigned + NonZero> Sub<NInt<Ur>> for PInt<Ul>where
Ul: Add<Ur> + Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Sub<NInt<Ur>> for PInt<Ul>where Ul: Add<Ur> + Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
P(Ul) - N(Ur) = P(Ul + Ur)
source§impl<Ul, Ur: Unsigned + NonZero> Sub<PInt<Ur>> for PInt<Ul>where
Ul: Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur> + Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Sub<PInt<Ur>> for PInt<Ul>where Ul: Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur> + Unsigned + NonZero,
P(Ul) - P(Ur)
: We resolve this with our PrivateAdd