gcd

Get greatest common divisor (gcd) of x and y.

  1. _Z!(cow) gcd(_Z!(cow) x, _Z!(cow) y)
    pure nothrow @nogc @trusted
    _Z!(cow)
    gcd
    (
    bool cow
    )
    (
    auto ref scope const _Z!(cow) x
    ,
    auto ref scope const _Z!(cow) y
    )
  2. _Z!(cow) gcd(_Z!(cow) x, ulong y)

Meta