gmp-d ~master (2024-10-01T05:32:03Z)

gcd

gmp z

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

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

Meta

Source

See Implementation

gmp z aliasesenumsfunctionsstructs

Page generated by adrdox