pub trait Gcd<Rhs = Self> {
type Output;
fn gcd(self, rhs: Rhs) -> Self::Output;
}
Expand description
Compute the greatest common divisor.
For negative integers, the common divisor is still kept positive.
use dashu_base::Gcd;
assert_eq!(12u8.gcd(10u8), 2);
Panics if both operands are zeros
Compute the greatest common divisor between the two operands.
Panics if both operands are zeros