Function num::integer::gcd [-] [+] [src]

pub fn gcd<T: Integer>(x: T, y: T) -> T

Calculates the Greatest Common Divisor (GCD) of the number and other. The result is always positive.