Trait Gcd

pub trait Gcd<Rhs = Self> {
    type Output;

    // Required method
    fn gcd(self, rhs: Rhs) -> Self::Output;
}

Compute the greatest common divisor.

For negative integers, the common divisor is still kept positive.

Examples

use dashu_base::Gcd;
assert_eq!(12u8.gcd(10u8), 2);

Panics

Panics if both operands are zeros

Required Associated Types

type Output

Required Methods

fn gcd(self, rhs: Rhs) -> Self::Output

Compute the greatest common divisor between the two operands.

Panics if both operands are zeros

Implementations on Foreign Types

impl Gcd for u8

type Output = u8

fn gcd(self, rhs: u8) -> <u8 as Gcd>::Output

impl Gcd for u16

type Output = u16

fn gcd(self, rhs: u16) -> <u16 as Gcd>::Output

impl Gcd for u32

type Output = u32

fn gcd(self, rhs: u32) -> <u32 as Gcd>::Output

impl Gcd for u64

type Output = u64

fn gcd(self, rhs: u64) -> <u64 as Gcd>::Output

impl Gcd for u128

type Output = u128

fn gcd(self, rhs: u128) -> <u128 as Gcd>::Output

impl Gcd for usize

type Output = usize

fn gcd(self, rhs: usize) -> <usize as Gcd>::Output

Implementors

impl Gcd for IBig

type Output = UBig

impl Gcd for UBig

type Output = UBig

impl Gcd<IBig> for UBig

type Output = UBig

impl Gcd<UBig> for IBig

type Output = UBig

impl<'l> Gcd<IBig> for &'l IBig

type Output = UBig

impl<'l> Gcd<IBig> for &'l UBig

type Output = UBig

impl<'l> Gcd<UBig> for &'l IBig

type Output = UBig

impl<'l> Gcd<UBig> for &'l UBig

type Output = UBig

impl<'l, 'r> Gcd<&'r IBig> for &'l IBig

type Output = UBig

impl<'l, 'r> Gcd<&'r IBig> for &'l UBig

type Output = UBig

impl<'l, 'r> Gcd<&'r UBig> for &'l IBig

type Output = UBig

impl<'l, 'r> Gcd<&'r UBig> for &'l UBig

type Output = UBig

impl<'r> Gcd<&'r IBig> for IBig

type Output = UBig

impl<'r> Gcd<&'r IBig> for UBig

type Output = UBig

impl<'r> Gcd<&'r UBig> for IBig

type Output = UBig

impl<'r> Gcd<&'r UBig> for UBig

type Output = UBig