Trait malachite_base::num::arithmetic::traits::GcdAssign

pub trait GcdAssign<RHS = Self> {
    fn gcd_assign(&mut self, other: RHS);
}

Replaces a number with the GCD (greatest common divisor) of it and another number.

Required Methods

fn gcd_assign(&mut self, other: RHS)

Implementations on Foreign Types

impl GcdAssign<u8> for u8

fn gcd_assign(&mut self, other: u8)

Replaces another with the GCD (greatest common divisor) of it and another number.

The GCD of 0 and $n$, for any $n$, is 0. In particular, $\gcd(0, 0) = 0$, which makes sense if we interpret “greatest” to mean “greatest by the divisibility order”.

$$ x \gets \gcd(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and $n$ is max(self.significant_bits(), other.significant_bits()).

Examples

See here.

impl GcdAssign<u16> for u16

fn gcd_assign(&mut self, other: u16)

Replaces another with the GCD (greatest common divisor) of it and another number.

The GCD of 0 and $n$, for any $n$, is 0. In particular, $\gcd(0, 0) = 0$, which makes sense if we interpret “greatest” to mean “greatest by the divisibility order”.

$$ x \gets \gcd(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and $n$ is max(self.significant_bits(), other.significant_bits()).

Examples

See here.

impl GcdAssign<u32> for u32

fn gcd_assign(&mut self, other: u32)

Replaces another with the GCD (greatest common divisor) of it and another number.

The GCD of 0 and $n$, for any $n$, is 0. In particular, $\gcd(0, 0) = 0$, which makes sense if we interpret “greatest” to mean “greatest by the divisibility order”.

$$ x \gets \gcd(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and $n$ is max(self.significant_bits(), other.significant_bits()).

Examples

See here.

impl GcdAssign<u64> for u64

fn gcd_assign(&mut self, other: u64)

Replaces another with the GCD (greatest common divisor) of it and another number.

The GCD of 0 and $n$, for any $n$, is 0. In particular, $\gcd(0, 0) = 0$, which makes sense if we interpret “greatest” to mean “greatest by the divisibility order”.

$$ x \gets \gcd(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and $n$ is max(self.significant_bits(), other.significant_bits()).

Examples

See here.

impl GcdAssign<u128> for u128

fn gcd_assign(&mut self, other: u128)

Replaces another with the GCD (greatest common divisor) of it and another number.

The GCD of 0 and $n$, for any $n$, is 0. In particular, $\gcd(0, 0) = 0$, which makes sense if we interpret “greatest” to mean “greatest by the divisibility order”.

$$ x \gets \gcd(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and $n$ is max(self.significant_bits(), other.significant_bits()).

Examples

See here.

impl GcdAssign<usize> for usize

fn gcd_assign(&mut self, other: usize)

Replaces another with the GCD (greatest common divisor) of it and another number.

The GCD of 0 and $n$, for any $n$, is 0. In particular, $\gcd(0, 0) = 0$, which makes sense if we interpret “greatest” to mean “greatest by the divisibility order”.

$$ x \gets \gcd(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and $n$ is max(self.significant_bits(), other.significant_bits()).

Examples

See here.

Implementors