Trait algebraics::traits::GCD

pub trait GCD<Rhs = Self> {
    type Output;
#[must_use]
    fn gcd_lcm(&self, rhs: &Rhs) -> GCDAndLCM<Self::Output>;

#[must_use]
    fn gcd(&self, rhs: &Rhs) -> Self::Output { ... }
#[must_use]
    fn lcm(&self, rhs: &Rhs) -> Self::Output { ... }
}

Associated Types

type Output

Loading content...

Required methods

#[must_use] fn gcd_lcm(&self, rhs: &Rhs) -> GCDAndLCM<Self::Output>

Loading content...

Provided methods

#[must_use] fn gcd(&self, rhs: &Rhs) -> Self::Output

#[must_use] fn lcm(&self, rhs: &Rhs) -> Self::Output

Loading content...

Implementations on Foreign Types

impl GCD<u8> for u8

type Output = u8

fn gcd(&self, rhs: &u8) -> u8

fn lcm(&self, rhs: &u8) -> u8

fn gcd_lcm(&self, rhs: &u8) -> GCDAndLCM<u8>

impl GCD<i8> for i8

type Output = i8

fn gcd(&self, rhs: &i8) -> i8

fn lcm(&self, rhs: &i8) -> i8

fn gcd_lcm(&self, rhs: &i8) -> GCDAndLCM<i8>

impl GCD<u16> for u16

type Output = u16

fn gcd(&self, rhs: &u16) -> u16

fn lcm(&self, rhs: &u16) -> u16

fn gcd_lcm(&self, rhs: &u16) -> GCDAndLCM<u16>

impl GCD<i16> for i16

type Output = i16

fn gcd(&self, rhs: &i16) -> i16

fn lcm(&self, rhs: &i16) -> i16

fn gcd_lcm(&self, rhs: &i16) -> GCDAndLCM<i16>

impl GCD<u32> for u32

type Output = u32

fn gcd(&self, rhs: &u32) -> u32

fn lcm(&self, rhs: &u32) -> u32

fn gcd_lcm(&self, rhs: &u32) -> GCDAndLCM<u32>

impl GCD<i32> for i32

type Output = i32

fn gcd(&self, rhs: &i32) -> i32

fn lcm(&self, rhs: &i32) -> i32

fn gcd_lcm(&self, rhs: &i32) -> GCDAndLCM<i32>

impl GCD<u64> for u64

type Output = u64

fn gcd(&self, rhs: &u64) -> u64

fn lcm(&self, rhs: &u64) -> u64

fn gcd_lcm(&self, rhs: &u64) -> GCDAndLCM<u64>

impl GCD<i64> for i64

type Output = i64

fn gcd(&self, rhs: &i64) -> i64

fn lcm(&self, rhs: &i64) -> i64

fn gcd_lcm(&self, rhs: &i64) -> GCDAndLCM<i64>

impl GCD<u128> for u128

type Output = u128

fn gcd(&self, rhs: &u128) -> u128

fn lcm(&self, rhs: &u128) -> u128

fn gcd_lcm(&self, rhs: &u128) -> GCDAndLCM<u128>

impl GCD<i128> for i128

type Output = i128

fn gcd(&self, rhs: &i128) -> i128

fn lcm(&self, rhs: &i128) -> i128

fn gcd_lcm(&self, rhs: &i128) -> GCDAndLCM<i128>

impl GCD<usize> for usize

type Output = usize

fn gcd(&self, rhs: &usize) -> usize

fn lcm(&self, rhs: &usize) -> usize

fn gcd_lcm(&self, rhs: &usize) -> GCDAndLCM<usize>

impl GCD<isize> for isize

type Output = isize

fn gcd(&self, rhs: &isize) -> isize

fn lcm(&self, rhs: &isize) -> isize

fn gcd_lcm(&self, rhs: &isize) -> GCDAndLCM<isize>

impl GCD<BigUint> for BigUint

type Output = BigUint

fn gcd(&self, rhs: &BigUint) -> BigUint

fn lcm(&self, rhs: &BigUint) -> BigUint

fn gcd_lcm(&self, rhs: &BigUint) -> GCDAndLCM<BigUint>

impl GCD<BigInt> for BigInt

type Output = BigInt

fn gcd(&self, rhs: &BigInt) -> BigInt

fn lcm(&self, rhs: &BigInt) -> BigInt

fn gcd_lcm(&self, rhs: &BigInt) -> GCDAndLCM<BigInt>

impl<T: Integer + Clone + for<'a> Mul<&'a T, Output = T>> GCD<Ratio<T>> for Ratio<T>

type Output = Self

fn gcd_lcm(&self, rhs: &Self) -> GCDAndLCM<Self>

Loading content...

Implementors

impl GCD<DivisorIsOne> for DivisorIsOne

type Output = DivisorIsOne

fn gcd_lcm(&self, _rhs: &DivisorIsOne) -> GCDAndLCM<DivisorIsOne>

impl<T> GCD<Polynomial<T>> for Polynomial<T> where
    T: PolynomialCoefficient + PolynomialDivSupported + PolynomialReducingFactorSupported, 

type Output = Self

fn gcd(&self, rhs: &Self) -> Self

fn gcd_lcm(&self, rhs: &Self) -> GCDAndLCM<Self>

Loading content...