Function gcd2

std/math/src/main/int.rs:18–21

Euclidean gcd on non-negative inputs.

(mut a: i128, mut b: i128)

// Euclidean gcd on non-negative inputs.
fn gcd2(mut a: i128, mut b: i128) -> i128 {
    while b != 0 { let t = b; b = a % b; a = t; }
    a
}

#[plugin_fn]
fn factorial(n: i128) -> Result<i128> {