23 #ifndef GUL14_GCD_LCM_H_
24 #define GUL14_GCD_LCM_H_
26 #include <type_traits>
69 template <
typename IntTypeA,
typename IntTypeB>
71 gcd(IntTypeA a, IntTypeB b)
73 static_assert(std::is_integral<IntTypeA>::value and std::is_integral<IntTypeB>::value,
74 "gcd() arguments must be integers");
76 static_assert(std::is_signed<IntTypeA>::value == std::is_signed<IntTypeB>::value,
77 "gcd() arguments must have the same signedness");
79 using CommonType = std::common_type_t<IntTypeA, IntTypeB>;
81 auto c =
gul14::abs(
static_cast<CommonType
>(a));
82 auto d =
gul14::abs(
static_cast<CommonType
>(b));
123 template <
typename IntTypeA,
typename IntTypeB>
124 constexpr
inline auto
125 lcm(IntTypeA a, IntTypeB b)
127 static_assert(std::is_integral<IntTypeA>::value and std::is_integral<IntTypeB>::value,
128 "lcm() arguments must be integers");
130 static_assert(std::is_signed<IntTypeA>::value == std::is_signed<IntTypeB>::value,
131 "lcm() arguments must have the same signedness");
133 using CommonType = std::common_type_t<IntTypeA, IntTypeB>;
135 if (a == 0 && b == 0)
136 return CommonType{ 0 };
138 return static_cast<CommonType
>(
gul14::abs((a /
gcd(a, b)) * b));
constexpr auto lcm(IntTypeA a, IntTypeB b)
Calculate the least common multiple of two integers.
Definition: gcd_lcm.h:125
constexpr auto gcd(IntTypeA a, IntTypeB b)
Calculate the greatest common divisor of two integers using the Euclidean algorithm.
Definition: gcd_lcm.h:71
constexpr auto abs(ValueT n) noexcept -> std::enable_if_t< std::is_unsigned< ValueT >::value, ValueT >
Compute the absolute value of a number.
Definition: num_util.h:53
Definition of macros used internally by GUL.
Namespace gul14 contains all functions and classes of the General Utility Library.
Definition: doxygen.h:26
Declaration of numerical utility functions.