Struct typenum::int::NInt

pub struct NInt<U: Unsigned + NonZero> { /* fields omitted */ }

Type-level signed integers with negative sign.

Methods

impl<U: Unsigned + NonZero> NInt<U>

fn new() -> NInt<U>

Instantiates a singleton representing this strictly negative integer.

Trait Implementations

impl<U: Eq + Unsigned + NonZero> Eq for NInt<U>

impl<U: PartialEq + Unsigned + NonZero> PartialEq for NInt<U>

fn eq(&self, __arg_0: &NInt<U>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &NInt<U>) -> bool

This method tests for !=.

impl<U: Ord + Unsigned + NonZero> Ord for NInt<U>

fn cmp(&self, __arg_0: &NInt<U>) -> Ordering

This method returns an Ordering between self and other.

impl<U: PartialOrd + Unsigned + NonZero> PartialOrd for NInt<U>

fn partial_cmp(&self, __arg_0: &NInt<U>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, __arg_0: &NInt<U>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, __arg_0: &NInt<U>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, __arg_0: &NInt<U>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, __arg_0: &NInt<U>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U: Clone + Unsigned + NonZero> Clone for NInt<U>

fn clone(&self) -> NInt<U>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<U: Copy + Unsigned + NonZero> Copy for NInt<U>

impl<U: Hash + Unsigned + NonZero> Hash for NInt<U>

fn hash<__HU: Hasher>(&self, __arg_0: &mut __HU)

Feeds this value into the state given, updating the hasher as necessary.

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher

Feeds a slice of this type into the state provided.

impl<U: Debug + Unsigned + NonZero> Debug for NInt<U>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<U: Default + Unsigned + NonZero> Default for NInt<U>

fn default() -> NInt<U>

Returns the "default value" for a type.

impl<U: Unsigned + NonZero> NonZero for NInt<U>

impl<U: Unsigned + NonZero> Integer for NInt<U>

fn to_i8() -> i8

fn to_i16() -> i16

fn to_i32() -> i32

fn to_i64() -> i64

fn to_isize() -> isize

impl<U: Unsigned + NonZero> Neg for NInt<U>

-NInt = PInt

type Output = PInt<U>

The resulting type after applying the - operator

fn neg(self) -> Self::Output

The method for the unary - operator

impl<U: Unsigned + NonZero> Add<Z0> for NInt<U>

NInt + Z0 = NInt

type Output = NInt<U>

The resulting type after applying the + operator

fn add(self, _: Z0) -> Self::Output

The method for the + operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Add<NInt<Ur>> for NInt<Ul> where Ul: Add<Ur>,
        Ul::Output: Unsigned + NonZero

N(Ul) + N(Ur) = N(Ul + Ur)

type Output = NInt<Ul::Output>

The resulting type after applying the + operator

fn add(self, _: NInt<Ur>) -> Self::Output

The method for the + operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Add<PInt<Ur>> for NInt<Ul> where Ur: Cmp<Ul> + PrivateIntegerAdd<Ur::Output, Ul>

N(Ul) + P(Ur): We resolve this with our PrivateAdd

type Output = Ur::Output

The resulting type after applying the + operator

fn add(self, _: PInt<Ur>) -> Self::Output

The method for the + operator

impl<U: Unsigned + NonZero> Sub<Z0> for NInt<U>

NInt - Z0 = NInt

type Output = NInt<U>

The resulting type after applying the - operator

fn sub(self, _: Z0) -> Self::Output

The method for the - operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Sub<PInt<Ur>> for NInt<Ul> where Ul: Add<Ur>,
        Ul::Output: Unsigned + NonZero

N(Ul) - P(Ur) = N(Ul + Ur)

type Output = NInt<Ul::Output>

The resulting type after applying the - operator

fn sub(self, _: PInt<Ur>) -> Self::Output

The method for the - operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Sub<NInt<Ur>> for NInt<Ul> where Ur: Cmp<Ul> + PrivateIntegerAdd<Ur::Output, Ul>

N(Ul) - N(Ur): We resolve this with our PrivateAdd

type Output = Ur::Output

The resulting type after applying the - operator

fn sub(self, _: NInt<Ur>) -> Self::Output

The method for the - operator

impl<U: Unsigned + NonZero> Mul<Z0> for NInt<U>

N * Z0 = Z0

type Output = Z0

The resulting type after applying the * operator

fn mul(self, _: Z0) -> Self::Output

The method for the * operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Mul<NInt<Ur>> for NInt<Ul> where Ul: Mul<Ur>,
        Ul::Output: Unsigned + NonZero

N(Ul) * N(Ur) = P(Ul * Ur)

type Output = PInt<Ul::Output>

The resulting type after applying the * operator

fn mul(self, _: NInt<Ur>) -> Self::Output

The method for the * operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Mul<PInt<Ur>> for NInt<Ul> where Ul: Mul<Ur>,
        Ul::Output: Unsigned + NonZero

N(Ul) * P(Ur) = N(Ul * Ur)

type Output = NInt<Ul::Output>

The resulting type after applying the * operator

fn mul(self, _: PInt<Ur>) -> Self::Output

The method for the * operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Div<PInt<Ur>> for NInt<Ul> where Ul: Cmp<Ur>,
        NInt<Ul>: PrivateDivInt<Ul::Output, PInt<Ur>>

$A<Ul> / $B<Ur> = $R<Ul / Ur>

type Output = NInt<Ul>::Output

The resulting type after applying the / operator

fn div(self, _: PInt<Ur>) -> Self::Output

The method for the / operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Div<NInt<Ur>> for NInt<Ul> where Ul: Cmp<Ur>,
        NInt<Ul>: PrivateDivInt<Ul::Output, NInt<Ur>>

$A<Ul> / $B<Ur> = $R<Ul / Ur>

type Output = NInt<Ul>::Output

The resulting type after applying the / operator

fn div(self, _: NInt<Ur>) -> Self::Output

The method for the / operator

impl<U: Unsigned + NonZero> Cmp<Z0> for NInt<U>

-X < 0

type Output = Less

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

impl<P: Unsigned + NonZero, N: Unsigned + NonZero> Cmp<PInt<P>> for NInt<N>

-X < Y

type Output = Less

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

impl<Nl: Unsigned + NonZero, Nr: Cmp<Nl> + Unsigned + NonZero> Cmp<NInt<Nr>> for NInt<Nl>

-X <==> -Y

type Output = Nr::Output

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Rem<PInt<Ur>> for NInt<Ul> where Ul: Rem<Ur>,
        NInt<Ul>: PrivateRem<Ul::Output, PInt<Ur>>

$A<Ul> % $B<Ur> = $R<Ul % Ur>

type Output = NInt<Ul>::Output

The resulting type after applying the % operator

fn rem(self, _: PInt<Ur>) -> Self::Output

The method for the % operator

impl<Ul: Unsigned + NonZero, Ur: Unsigned + NonZero> Rem<NInt<Ur>> for NInt<Ul> where Ul: Rem<Ur>,
        NInt<Ul>: PrivateRem<Ul::Output, NInt<Ur>>

$A<Ul> % $B<Ur> = $R<Ul % Ur>

type Output = NInt<Ul>::Output

The resulting type after applying the % operator

fn rem(self, _: NInt<Ur>) -> Self::Output

The method for the % operator

impl<U: Unsigned + NonZero> Pow<Z0> for NInt<U>

N⁰ = 1

type Output = P1

The result of the exponentiation.

fn powi(self, _: Z0) -> Self::Output

This function isn't used in this crate, but may be useful for others. It is implemented for primitives.

impl<Ul: Unsigned + NonZero, Ur: Unsigned> Pow<PInt<UInt<Ur, B0>>> for NInt<Ul> where Ul: Pow<UInt<Ur, B0>>,
        Ul::Output: Unsigned + NonZero

N(Ul)^P(Ur) = P(Ul^Ur) if Ur is even

type Output = PInt<Ul::Output>

The result of the exponentiation.

fn powi(self, _: PInt<UInt<Ur, B0>>) -> Self::Output

This function isn't used in this crate, but may be useful for others. It is implemented for primitives.

impl<Ul: Unsigned + NonZero, Ur: Unsigned> Pow<PInt<UInt<Ur, B1>>> for NInt<Ul> where Ul: Pow<UInt<Ur, B1>>,
        Ul::Output: Unsigned + NonZero

N(Ul)^P(Ur) = N(Ul^Ur) if Ur is odd

type Output = NInt<Ul::Output>

The result of the exponentiation.

fn powi(self, _: PInt<UInt<Ur, B1>>) -> Self::Output

This function isn't used in this crate, but may be useful for others. It is implemented for primitives.

impl<U> Mul<ATerm> for NInt<U> where U: Unsigned + NonZero

type Output = ATerm

The resulting type after applying the * operator

fn mul(self, _: ATerm) -> Self::Output

The method for the * operator

impl<V, A, U> Mul<TArr<V, A>> for NInt<U> where U: Unsigned + NonZero,
        NInt<U>: Mul<A> + Mul<V>

type Output = TArr<Prod<NInt<U>, V>, Prod<NInt<U>, A>>

The resulting type after applying the * operator

fn mul(self, _: TArr<V, A>) -> Self::Output

The method for the * operator

impl<U> Div<ATerm> for NInt<U> where U: Unsigned + NonZero

type Output = ATerm

The resulting type after applying the / operator

fn div(self, _: ATerm) -> Self::Output

The method for the / operator

impl<V, A, U> Div<TArr<V, A>> for NInt<U> where U: Unsigned + NonZero,
        NInt<U>: Div<A> + Div<V>

type Output = TArr<Quot<NInt<U>, V>, Quot<NInt<U>, A>>

The resulting type after applying the / operator

fn div(self, _: TArr<V, A>) -> Self::Output

The method for the / operator