Std.Math.gcd

fn

gcd: T -> T -> T where T: Ord + Zero + One + Add + Sub + Rem

This is a callable function.

The greatest common divisor, by Euclid's algorithm.

The result is never negative, so it can be used as a divisor without a

caller having to check its sign.

The text after the name is the type checked by Pudu.
Read arrows from left to right: inputs come first, and the final type is returned.