pub struct NInt<U: Unsigned + NonZero> { /* private fields */ }
Expand description
Type-level signed integers with negative sign.
Implementations§
Trait Implementations§
source§impl<Ul, Ur: Unsigned + NonZero> Add<NInt<Ur>> for NInt<Ul>where
Ul: Add<Ur> + Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Add<NInt<Ur>> for NInt<Ul>where Ul: Add<Ur> + Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
N(Ul) + N(Ur) = N(Ul + Ur)
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: Unsigned + NonZero, Ur> Add<PInt<Ur>> for NInt<Ul>where
Ur: Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul> + Unsigned + NonZero,
impl<Ul: Unsigned + NonZero, Ur> Add<PInt<Ur>> for NInt<Ul>where Ur: Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul> + Unsigned + NonZero,
N(Ul) + P(Ur)
: We resolve this with our PrivateAdd
source§impl<Nl: Unsigned + NonZero, Nr: Cmp<Nl> + Unsigned + NonZero> Cmp<NInt<Nr>> for NInt<Nl>
impl<Nl: Unsigned + NonZero, Nr: Cmp<Nl> + Unsigned + NonZero> Cmp<NInt<Nr>> for NInt<Nl>
-X <==> -Y
source§impl<Ul, Ur: Unsigned + NonZero> Div<NInt<Ur>> for NInt<Ul>where
Ul: Cmp<Ur> + Unsigned + NonZero,
NInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Div<NInt<Ur>> for NInt<Ul>where Ul: Cmp<Ur> + Unsigned + NonZero, NInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>,
$A<Ul> / $B<Ur> = $R<Ul / Ur>
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 NInt<Ul>where
Ul: Cmp<Ur> + Unsigned + NonZero,
NInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Div<PInt<Ur>> for NInt<Ul>where Ul: Cmp<Ur> + Unsigned + NonZero, NInt<Ul>: PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>,
$A<Ul> / $B<Ur> = $R<Ul / Ur>
source§impl<U1, U2> Gcd<NInt<U2>> for NInt<U1>where
U1: Unsigned + NonZero + Gcd<U2>,
U2: Unsigned + NonZero,
Gcf<U1, U2>: Unsigned + NonZero,
impl<U1, U2> Gcd<NInt<U2>> for NInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, Gcf<U1, U2>: Unsigned + NonZero,
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 NInt<U1>where
U1: Unsigned + NonZero + Gcd<U2>,
U2: Unsigned + NonZero,
Gcf<U1, U2>: Unsigned + NonZero,
impl<U1, U2> Gcd<PInt<U2>> for NInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, Gcf<U1, U2>: Unsigned + NonZero,
source§impl<Ul, Ur> Max<NInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero + Min<Ur>,
Ur: Unsigned + NonZero,
Minimum<Ul, Ur>: Unsigned + NonZero,
impl<Ul, Ur> Max<NInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Min<Ur>, Ur: Unsigned + NonZero, Minimum<Ul, Ur>: Unsigned + NonZero,
source§impl<Ul, Ur> Min<NInt<Ur>> for NInt<Ul>where
Ul: Unsigned + NonZero + Max<Ur>,
Ur: Unsigned + NonZero,
Maximum<Ul, Ur>: Unsigned + NonZero,
impl<Ul, Ur> Min<NInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Max<Ur>, Ur: Unsigned + NonZero, Maximum<Ul, Ur>: Unsigned + NonZero,
source§impl<Ul, Ur: Unsigned + NonZero> Mul<NInt<Ur>> for NInt<Ul>where
Ul: Mul<Ur> + Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Mul<NInt<Ur>> for NInt<Ul>where Ul: Mul<Ur> + Unsigned + NonZero, <Ul as Mul<Ur>>::Output: Unsigned + NonZero,
N(Ul) * N(Ur) = P(Ul * Ur)
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 NInt<Ul>where
Ul: Mul<Ur> + Unsigned + NonZero,
<Ul as Mul<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Mul<PInt<Ur>> for NInt<Ul>where Ul: Mul<Ur> + Unsigned + NonZero, <Ul as Mul<Ur>>::Output: Unsigned + NonZero,
N(Ul) * P(Ur) = N(Ul * Ur)
source§impl<V, A, U> Mul<TArr<V, A>> for NInt<U>where
U: Unsigned + NonZero,
NInt<U>: Mul<A> + Mul<V>,
impl<V, A, U> Mul<TArr<V, A>> for NInt<U>where U: Unsigned + NonZero, NInt<U>: Mul<A> + Mul<V>,
source§impl<U: Ord + Unsigned + NonZero> Ord for NInt<U>
impl<U: Ord + Unsigned + NonZero> Ord for NInt<U>
source§impl<U: PartialEq + Unsigned + NonZero> PartialEq<NInt<U>> for NInt<U>
impl<U: PartialEq + Unsigned + NonZero> PartialEq<NInt<U>> for NInt<U>
source§impl<U: PartialOrd + Unsigned + NonZero> PartialOrd<NInt<U>> for NInt<U>
impl<U: PartialOrd + Unsigned + NonZero> PartialOrd<NInt<U>> for NInt<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> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul>where
Ul: Pow<UInt<Ur, B0>> + Unsigned + NonZero,
<Ul as Pow<UInt<Ur, B0>>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul>where Ul: Pow<UInt<Ur, B0>> + Unsigned + NonZero, <Ul as Pow<UInt<Ur, B0>>>::Output: Unsigned + NonZero,
N(Ul)^P(Ur) = P(Ul^Ur) if Ur is even
source§impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul>where
Ul: Pow<UInt<Ur, B1>> + Unsigned + NonZero,
<Ul as Pow<UInt<Ur, B1>>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul>where Ul: Pow<UInt<Ur, B1>> + Unsigned + NonZero, <Ul as Pow<UInt<Ur, B1>>>::Output: Unsigned + NonZero,
N(Ul)^P(Ur) = N(Ul^Ur) if Ur is odd
source§impl<Ul, Ur: Unsigned + NonZero> Rem<NInt<Ur>> for NInt<Ul>where
Ul: Rem<Ur> + Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Rem<NInt<Ur>> for NInt<Ul>where Ul: Rem<Ur> + Unsigned + NonZero, NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
$A<Ul> % $B<Ur> = $R<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 NInt<Ul>where
Ul: Rem<Ur> + Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur: Unsigned + NonZero> Rem<PInt<Ur>> for NInt<Ul>where Ul: Rem<Ur> + Unsigned + NonZero, NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
source§impl<Ul: Unsigned + NonZero, Ur> Sub<NInt<Ur>> for NInt<Ul>where
Ur: Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul> + Unsigned + NonZero,
impl<Ul: Unsigned + NonZero, Ur> Sub<NInt<Ur>> for NInt<Ul>where Ur: Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul> + Unsigned + NonZero,
N(Ul) - N(Ur)
: We resolve this with our PrivateAdd
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 NInt<Ul>where
Ul: Add<Ur> + Unsigned + NonZero,
<Ul as Add<Ur>>::Output: Unsigned + NonZero,
impl<Ul, Ur: Unsigned + NonZero> Sub<PInt<Ur>> for NInt<Ul>where Ul: Add<Ur> + Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,
N(Ul) - P(Ur) = N(Ul + Ur)
impl<U: Copy + Unsigned + NonZero> Copy for NInt<U>
impl<U: Eq + Unsigned + NonZero> Eq for NInt<U>
impl<U: Unsigned + NonZero> NonZero for NInt<U>
impl<U: Unsigned + NonZero> StructuralEq for NInt<U>
impl<U: Unsigned + NonZero> StructuralPartialEq for NInt<U>
Auto Trait Implementations§
impl<U> RefUnwindSafe for NInt<U>where U: RefUnwindSafe,
impl<U> Send for NInt<U>where U: Send,
impl<U> Sync for NInt<U>where U: Sync,
impl<U> Unpin for NInt<U>where U: Unpin,
impl<U> UnwindSafe for NInt<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
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