def gcd_bin

bend-collections-laws-math@1.0.0.0 · src/math/generic.bend:300

import Base
import bend-collections-laws-math@1.0.0.0/src/math/num.bend as N

300# one Euclid step first (so a tiny b costs one division, not a bit per
301# subtraction), then the binary loop
302def gcd_bin(~T: Data, ~op: N.Op<T> -> T, ~test: N.Test<T> -> Bool, +a: T, +b: T) -> T:
303  gcd_rb(~T, ~op, ~test, a, b, test(N.IsZero{b}))