Trait `Gcd`

pub trait Gcd<Rhs>

A type operator that computes the greatest common divisor of Self and Rhs.

Example

use typenum::{Gcd, Unsigned, U12, U8};

assert_eq!(<U12 as Gcd<U8>>::Output::to_i32(), 4);

Associated Types

type Output;: The greatest common divisor.

Implementors

impl Gcd<UTerm> for U0
impl Gcd<Z0> for Z0
impl Gcd<NInt> for Z0 where U: Unsigned + NonZero,
impl Gcd<PInt> for Z0 where U: Unsigned + NonZero,
impl Gcd<Z0> for NInt where U: Unsigned + NonZero,
impl Gcd<Z0> for PInt where U: 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,
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<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 PInt<U1> where U1: Unsigned + NonZero + Gcd<U2>, U2: Unsigned + NonZero, Gcf<U1, U2>: Unsigned + NonZero,
impl<X> Gcd<UTerm> for UInt<U, B> where X: Unsigned + NonZero,
impl<X> Gcd<UTerm> for X where X: Unsigned + NonZero,
impl<Xp, Yp> Gcd<UInt<Yp, B0>> for UInt<Xp, B0> where Xp: Gcd<Yp>, UInt<Xp, B0>: NonZero, UInt<Yp, B0>: NonZero,
impl<Xp, Yp> Gcd<UInt<Yp, B0>> for UInt<Xp, B1> where UInt<Xp, B1>: Gcd<Yp>, UInt<Yp, B0>: NonZero,
impl<Xp, Yp> Gcd<UInt<Yp, B1>> for UInt<Xp, B0> where Xp: Gcd<UInt<Yp, B1>>, UInt<Xp, B0>: NonZero,
impl<Xp, Yp> Gcd<UInt<Yp, B1>> for UInt<Xp, B1> where UInt<Xp, B1>: Max<UInt<Yp, B1>> + Min<UInt<Yp, B1>>, UInt<Yp, B1>: Max<UInt<Xp, B1>> + Min<UInt<Xp, B1>>, Maximum<UInt<Xp, B1>, UInt<Yp, B1>>: Sub<Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>, Diff<Maximum<UInt<Xp, B1>, UInt<Yp, B1>>, Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>: Gcd<Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>,
impl<Y> Gcd<Y> for U0 where Y: Unsigned + NonZero,