Trait num_bigint_dig::traits::ExtendedGcd

pub trait ExtendedGcd<R: Sized>: Sized {
    fn extended_gcd(self, other: R) -> (BigInt, BigInt, BigInt);
}

Generic trait to implement extended GCD. Calculates the extended eucledian algorithm. See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm for details. The returned values are

• greatest common divisor (1)
• Bezout coefficients (2)

Required methods

fn extended_gcd(self, other: R) -> (BigInt, BigInt, BigInt)

Loading content...

Implementors

impl<'a> ExtendedGcd<&'a BigInt> for BigInt

fn extended_gcd(self, other: &'a BigInt) -> (BigInt, BigInt, BigInt)

impl<'a> ExtendedGcd<&'a BigInt> for BigUint

fn extended_gcd(self, other: &'a BigInt) -> (BigInt, BigInt, BigInt)

impl<'a> ExtendedGcd<&'a BigUint> for BigInt

fn extended_gcd(self, other: &'a BigUint) -> (BigInt, BigInt, BigInt)

impl<'a> ExtendedGcd<&'a BigUint> for BigUint

fn extended_gcd(self, other: &'a BigUint) -> (BigInt, BigInt, BigInt)

impl<'a, 'b> ExtendedGcd<&'b BigInt> for &'a BigInt

fn extended_gcd(self, other: &'b BigInt) -> (BigInt, BigInt, BigInt)

impl<'a, 'b> ExtendedGcd<&'b BigInt> for &'a BigUint

fn extended_gcd(self, other: &'b BigInt) -> (BigInt, BigInt, BigInt)

impl<'a, 'b> ExtendedGcd<&'b BigUint> for &'a BigInt

fn extended_gcd(self, other: &'b BigUint) -> (BigInt, BigInt, BigInt)

impl<'a, 'b> ExtendedGcd<&'b BigUint> for &'a BigUint

fn extended_gcd(self, other: &'b BigUint) -> (BigInt, BigInt, BigInt)

Loading content...