Duke's Big Numbers 1.0
C++ and Blueprint libraries for performing math, analysis, and formatting with really large numbers (>10e308).
Loading...
Searching...
No Matches
Greatest Common Divisor

Computes the greatest common divisor of two numbers.

Mnemonic
gcd
Implementations
Member Duke::FMoreMath::Gcd (uint32 lhs, uint32 rhs)

Flavor:Static U4 ← gcd U4 U4

Member Duke::FMoreMath::Gcd (int64 lhs, int64 rhs)

Flavor:Static I8 ← gcd I8 I8

Member Duke::FMoreMath::Gcd (uint64 lhs, uint64 rhs)

Flavor:Static U8 ← gcd U8 U8

Member FBigInteger::Gcd (const FBigInteger &lhs, uint32 rhs)

Flavor:Static U4 ← gcd BI U4

Member FBigInteger::Gcd (const FBigInteger &lhs, uint64 rhs)

Flavor:Static U8 ← gcd BI U8

Member FBigInteger::Gcd (const FBigInteger &lhs, const FBigInteger &rhs)

Flavor:Static BI ← gcd BI BI

Member UBigIntegerLibrary::Gcd_BigIntegerBigInteger (const FBigInteger &A, const FBigInteger &B)

Flavor:Blueprint BI ← gcd BI BI

Member UMoreMathLibrary::Gcd_Integer64Integer64 (int64 A, const int64 B)

Flavor:Blueprint I8 ← gcd I8 I8

Member UMoreMathLibrary::Gcd_IntegerInteger (int32 A, const int32 B)

Flavor:Blueprint I4 ← gcd I4 I4