Computes the greatest common divisor using Euclid's algorithm # Arguments `a` - First number `b` - Second number # Returns The GCD of `a` and `b`
(mut a: u64, mut b: u64)
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected