Struct oberon::inner_types::elliptic_curve::bigint::generic_array::typenum::int::NInt

pub struct NInt<U>where
    U: Unsigned + NonZero,{ /* private fields */ }

Type-level signed integers with negative sign.

Implementations

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

pub fn new() -> NInt<U>

Instantiates a singleton representing this strictly negative integer.

Trait Implementations

impl<U> Abs for NInt<U>where U: Unsigned + NonZero,

type Output = PInt<U>

The absolute value.

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

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

type Output = NInt<<Ul as Add<Ur>>::Output>

The resulting type after applying the + operator.

fn add(self, _: NInt<Ur>) -> <NInt<Ul> as Add<NInt<Ur>>>::Output

Performs the + operation.

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

type Output = <Ul as PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>>::Output

The resulting type after applying the + operator.

fn add(self, rhs: NInt<Ur>) -> <PInt<Ul> as Add<NInt<Ur>>>::Output

Performs the + operation.

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

type Output = <Ur as PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>>::Output

The resulting type after applying the + operator.

fn add(self, rhs: PInt<Ur>) -> <NInt<Ul> as Add<PInt<Ur>>>::Output

Performs the + operation.

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

NInt + Z0 = NInt

type Output = NInt<U>

The resulting type after applying the + operator.

fn add(self, _: Z0) -> <NInt<U> as Add<Z0>>::Output

Performs the + operation.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

X > - Y

type Output = Greater

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

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

-X <==> -Y

type Output = <Nr as Cmp<Nl>>::Output

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

impl<U> Cmp<NInt<U>> for Z0where U: Unsigned + NonZero,

0 > -X

type Output = Greater

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

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

-X < Y

type Output = Less

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

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

-X < 0

type Output = Less

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

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

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

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

fn default() -> NInt<U>

Returns the “default value” for a type.

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

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

type Output = <NInt<Ul> as PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>>::Output

The resulting type after applying the / operator.

fn div(self, rhs: NInt<Ur>) -> <NInt<Ul> as Div<NInt<Ur>>>::Output

Performs the / operation.

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>

type Output = <PInt<Ul> as PrivateDivInt<<Ul as Cmp<Ur>>::Output, NInt<Ur>>>::Output

The resulting type after applying the / operator.

fn div(self, rhs: NInt<Ur>) -> <PInt<Ul> as Div<NInt<Ur>>>::Output

Performs the / operation.

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>

type Output = <NInt<Ul> as PrivateDivInt<<Ul as Cmp<Ur>>::Output, PInt<Ur>>>::Output

The resulting type after applying the / operator.

fn div(self, rhs: PInt<Ur>) -> <NInt<Ul> as Div<PInt<Ur>>>::Output

Performs the / operation.

impl<U> Gcd<NInt<U>> for Z0where U: Unsigned + NonZero,

type Output = PInt<U>

The greatest common divisor.

impl<U1, U2> Gcd<NInt<U2>> for NInt<U1>where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, <U1 as Gcd<U2>>::Output: Unsigned + NonZero,

type Output = PInt<<U1 as Gcd<U2>>::Output>

The greatest common divisor.

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,

type Output = PInt<<U1 as Gcd<U2>>::Output>

The greatest common divisor.

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,

type Output = PInt<<U1 as Gcd<U2>>::Output>

The greatest common divisor.

impl<U> Gcd<Z0> for NInt<U>where U: Unsigned + NonZero,

type Output = PInt<U>

The greatest common divisor.

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

fn hash<__H>(&self, state: &mut __H)where __H: Hasher,

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

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

const I8: i8 = -((U::U8 - 1) as i8) - 1

const I16: i16 = -((U::U16 - 1) as i16) - 1

const I32: i32 = -((U::U32 - 1) as i32) - 1

const I64: i64 = -((U::U64 - 1) as i64) - 1

const ISIZE: isize = -((U::USIZE - 1) as isize) - 1

fn to_i8() -> i8

fn to_i16() -> i16

fn to_i32() -> i32

fn to_i64() -> i64

fn to_isize() -> isize

impl<U> Max<NInt<U>> for Z0where U: Unsigned + NonZero,

type Output = Z0

The type of the maximum of Self and Rhs

fn max(self, _: NInt<U>) -> <Z0 as Max<NInt<U>>>::Output

Method returning the maximum

impl<Ul, Ur> Max<NInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Min<Ur>, Ur: Unsigned + NonZero, <Ul as Min<Ur>>::Output: Unsigned + NonZero,

type Output = NInt<<Ul as Min<Ur>>::Output>

The type of the maximum of Self and Rhs

fn max(self, rhs: NInt<Ur>) -> <NInt<Ul> as Max<NInt<Ur>>>::Output

Method returning the maximum

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

type Output = PInt<Ul>

The type of the maximum of Self and Rhs

fn max(self, _: NInt<Ur>) -> <PInt<Ul> as Max<NInt<Ur>>>::Output

Method returning the maximum

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

type Output = PInt<Ur>

The type of the maximum of Self and Rhs

fn max(self, rhs: PInt<Ur>) -> <NInt<Ul> as Max<PInt<Ur>>>::Output

Method returning the maximum

impl<U> Max<Z0> for NInt<U>where U: Unsigned + NonZero,

type Output = Z0

The type of the maximum of Self and Rhs

fn max(self, rhs: Z0) -> <NInt<U> as Max<Z0>>::Output

Method returning the maximum

impl<U> Min<NInt<U>> for Z0where U: Unsigned + NonZero,

type Output = NInt<U>

The type of the minimum of Self and Rhs

fn min(self, rhs: NInt<U>) -> <Z0 as Min<NInt<U>>>::Output

Method returning the minimum

impl<Ul, Ur> Min<NInt<Ur>> for NInt<Ul>where Ul: Unsigned + NonZero + Max<Ur>, Ur: Unsigned + NonZero, <Ul as Max<Ur>>::Output: Unsigned + NonZero,

type Output = NInt<<Ul as Max<Ur>>::Output>

The type of the minimum of Self and Rhs

fn min(self, rhs: NInt<Ur>) -> <NInt<Ul> as Min<NInt<Ur>>>::Output

Method returning the minimum

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

type Output = NInt<Ur>

The type of the minimum of Self and Rhs

fn min(self, rhs: NInt<Ur>) -> <PInt<Ul> as Min<NInt<Ur>>>::Output

Method returning the minimum

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

type Output = NInt<Ul>

The type of the minimum of Self and Rhs

fn min(self, _: PInt<Ur>) -> <NInt<Ul> as Min<PInt<Ur>>>::Output

Method returning the minimum

impl<U> Min<Z0> for NInt<U>where U: Unsigned + NonZero,

type Output = NInt<U>

The type of the minimum of Self and Rhs

fn min(self, _: Z0) -> <NInt<U> as Min<Z0>>::Output

Method returning the minimum

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) -> <NInt<U> as Mul<ATerm>>::Output

Performs the * operation.

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

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

type Output = PInt<<Ul as Mul<Ur>>::Output>

The resulting type after applying the * operator.

fn mul(self, _: NInt<Ur>) -> <NInt<Ul> as Mul<NInt<Ur>>>::Output

Performs the * operation.

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)

type Output = NInt<<Ul as Mul<Ur>>::Output>

The resulting type after applying the * operator.

fn mul(self, _: NInt<Ur>) -> <PInt<Ul> as Mul<NInt<Ur>>>::Output

Performs the * operation.

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)

type Output = NInt<<Ul as Mul<Ur>>::Output>

The resulting type after applying the * operator.

fn mul(self, _: PInt<Ur>) -> <NInt<Ul> as Mul<PInt<Ur>>>::Output

Performs the * operation.

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

type Output = TArr<<NInt<U> as Mul<V>>::Output, <NInt<U> as Mul<A>>::Output>

The resulting type after applying the * operator.

fn mul(self, rhs: TArr<V, A>) -> <NInt<U> as Mul<TArr<V, A>>>::Output

Performs the * operation.

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

N * Z0 = Z0

type Output = Z0

The resulting type after applying the * operator.

fn mul(self, _: Z0) -> <NInt<U> as Mul<Z0>>::Output

Performs the * operation.

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

-NInt = PInt

type Output = PInt<U>

The resulting type after applying the - operator.

fn neg(self) -> <NInt<U> as Neg>::Output

Performs the unary - operation.

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

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

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

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

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

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

fn lt(&self, other: &Rhs) -> bool

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

fn le(&self, other: &Rhs) -> bool

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

fn gt(&self, other: &Rhs) -> bool

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

fn ge(&self, other: &Rhs) -> bool

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

impl<U> Pow<NInt<U>> for PInt<UInt<UTerm, B1>>where U: Unsigned + NonZero,

1^N = 1

type Output = PInt<UInt<UTerm, B1>>

The result of the exponentiation.

fn powi(self, _: NInt<U>) -> <PInt<UInt<UTerm, B1>> as Pow<NInt<U>>>::Output

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

impl<U> Pow<NInt<U>> for Z0where U: Unsigned + NonZero,

0^N = 0

type Output = Z0

The result of the exponentiation.

fn powi(self, _: NInt<U>) -> <Z0 as Pow<NInt<U>>>::Output

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

impl<U> Pow<NInt<U>> for f32where U: Unsigned + NonZero,

type Output = f32

The result of the exponentiation.

fn powi(self, _: NInt<U>) -> <f32 as Pow<NInt<U>>>::Output

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

impl<U> Pow<NInt<U>> for f64where U: Unsigned + NonZero,

type Output = f64

The result of the exponentiation.

fn powi(self, _: NInt<U>) -> <f64 as Pow<NInt<U>>>::Output

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

impl<U> Pow<NInt<UInt<U, B0>>> for NInt<UInt<UTerm, B1>>where U: Unsigned,

(-1)^N = 1 if N is even

type Output = PInt<UInt<UTerm, B1>>

The result of the exponentiation.

fn powi( self, _: NInt<UInt<U, B0>> ) -> <NInt<UInt<UTerm, B1>> as Pow<NInt<UInt<U, B0>>>>::Output

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

impl<U> Pow<NInt<UInt<U, B1>>> for NInt<UInt<UTerm, B1>>where U: Unsigned,

(-1)^N = -1 if N is odd

type Output = NInt<UInt<UTerm, B1>>

The result of the exponentiation.

fn powi( self, _: NInt<UInt<U, B1>> ) -> <NInt<UInt<UTerm, B1>> as Pow<NInt<UInt<U, B1>>>>::Output

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

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

type Output = PInt<<Ul as Pow<UInt<Ur, B0>>>::Output>

The result of the exponentiation.

fn powi( self, _: PInt<UInt<Ur, B0>> ) -> <NInt<Ul> as Pow<PInt<UInt<Ur, B0>>>>::Output

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

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

type Output = NInt<<Ul as Pow<UInt<Ur, B1>>>::Output>

The result of the exponentiation.

fn powi( self, _: PInt<UInt<Ur, B1>> ) -> <NInt<Ul> as Pow<PInt<UInt<Ur, B1>>>>::Output

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

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

N^0 = 1

type Output = PInt<UInt<UTerm, B1>>

The result of the exponentiation.

fn powi(self, _: Z0) -> <NInt<U> as Pow<Z0>>::Output

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

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

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

type Output = <NInt<Ul> as PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>>::Output

The resulting type after applying the % operator.

fn rem(self, rhs: NInt<Ur>) -> <NInt<Ul> as Rem<NInt<Ur>>>::Output

Performs the % operation.

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>

type Output = <PInt<Ul> as PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>>::Output

The resulting type after applying the % operator.

fn rem(self, rhs: NInt<Ur>) -> <PInt<Ul> as Rem<NInt<Ur>>>::Output

Performs the % operation.

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>

type Output = <NInt<Ul> as PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>>::Output

The resulting type after applying the % operator.

fn rem(self, rhs: PInt<Ur>) -> <NInt<Ul> as Rem<PInt<Ur>>>::Output

Performs the % operation.

impl<U> Sub<NInt<U>> for Z0where U: Unsigned + NonZero,

Z0 - N = P

type Output = PInt<U>

The resulting type after applying the - operator.

fn sub(self, _: NInt<U>) -> <Z0 as Sub<NInt<U>>>::Output

Performs the - operation.

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

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

type Output = <Ur as PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>>::Output

The resulting type after applying the - operator.

fn sub(self, rhs: NInt<Ur>) -> <NInt<Ul> as Sub<NInt<Ur>>>::Output

Performs the - operation.

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)

type Output = PInt<<Ul as Add<Ur>>::Output>

The resulting type after applying the - operator.

fn sub(self, _: NInt<Ur>) -> <PInt<Ul> as Sub<NInt<Ur>>>::Output

Performs the - operation.

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)

type Output = NInt<<Ul as Add<Ur>>::Output>

The resulting type after applying the - operator.

fn sub(self, _: PInt<Ur>) -> <NInt<Ul> as Sub<PInt<Ur>>>::Output

Performs the - operation.

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

NInt - Z0 = NInt

type Output = NInt<U>

The resulting type after applying the - operator.

fn sub(self, _: Z0) -> <NInt<U> as Sub<Z0>>::Output

Performs the - operation.

impl<U> ToInt<i16> for NInt<U>where U: Unsigned + NonZero,

fn to_int() -> i16

Method returning the concrete value for the type.

const INT: i16 = Self::I16

The concrete value for the type. Can be used in const contexts.

impl<U> ToInt<i32> for NInt<U>where U: Unsigned + NonZero,

fn to_int() -> i32

Method returning the concrete value for the type.

const INT: i32 = Self::I32

The concrete value for the type. Can be used in const contexts.

impl<U> ToInt<i64> for NInt<U>where U: Unsigned + NonZero,

fn to_int() -> i64

Method returning the concrete value for the type.

const INT: i64 = Self::I64

The concrete value for the type. Can be used in const contexts.

impl<U> ToInt<i8> for NInt<U>where U: Unsigned + NonZero,

fn to_int() -> i8

Method returning the concrete value for the type.

const INT: i8 = Self::I8

The concrete value for the type. Can be used in const contexts.

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

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

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

impl<U> StructuralEq for NInt<U>where U: Unsigned + NonZero,

impl<U> StructuralPartialEq for NInt<U>where U: Unsigned + NonZero,