Struct ConstructiveGcd 

pub struct ConstructiveGcd { /* private fields */ }

A constructive GCD computation over the integers using the Euclidean algorithm. Corresponds to the kernel axiom GCDDomain.

Implementations

impl ConstructiveGcd

pub fn new() -> Self

Create a new ConstructiveGcd instance.

pub fn gcd(&self, a: i64, b: i64) -> i64

Compute gcd(a, b) via the Euclidean algorithm (constructive, terminating).

pub fn extended_gcd(&self, a: i64, b: i64) -> (i64, i64, i64)

Extended Euclidean algorithm: returns (g, s, t) with g = gcd(a,b), sa + tb = g.

pub fn lcm(&self, a: i64, b: i64) -> Option<i64>

Least common multiple: lcm(a, b) = |a * b| / gcd(a, b).

pub fn divides(&self, a: i64, b: i64) -> bool

Check whether a | b (a divides b), constructively.

Trait Implementations

impl Clone for ConstructiveGcd

fn clone(&self) -> ConstructiveGcd

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ConstructiveGcd

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ConstructiveGcd

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for ConstructiveGcd

fn eq(&self, other: &ConstructiveGcd) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for ConstructiveGcd

impl Eq for ConstructiveGcd

impl StructuralPartialEq for ConstructiveGcd