Struct typenum::int::PInt [] [src]

pub struct PInt<U: Unsigned + NonZero> {
    // some fields omitted
}

Type-level signed integers with positive sign.

Trait Implementations

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

impl<U: Unsigned + NonZero> Integer for PInt<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 PInt<U>

-PInt = NInt

type Output = NInt<U>

fn neg(self) -> Self::Output

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

PInt + Z0 = PInt

type Output = PInt<U>

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

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

P(Ul) + P(Ur) = P(Ul + Ur)

type Output = PInt<Ul::Output>

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

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

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

type Output = Ul::Output

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

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

PInt - Z0 = PInt

type Output = PInt<U>

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

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

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

type Output = PInt<Ul::Output>

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

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

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

type Output = Ul::Output

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

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

P * Z0 = Z0

type Output = Z0

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

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

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

type Output = PInt<Ul::Output>

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

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

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

type Output = NInt<Ul::Output>

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

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

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

type Output = PInt<Ul>::Output

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

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

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

type Output = PInt<Ul>::Output

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

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

X > 0

type Output = Greater

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

X > - Y

type Output = Greater

impl<Pl: Cmp<Pr> + Unsigned + NonZero, Pr: Unsigned + NonZero> Cmp<PInt<Pr>> for PInt<Pl>

X <==> Y

type Output = Pl::Output

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

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

type Output = PInt<Ul>::Output

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

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

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

type Output = PInt<Ul>::Output

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

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

P0 = 1

type Output = P1

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

P(Ul)P(Ur) = P(UlUr)

type Output = PInt<Ul::Output>

Derived Implementations

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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