28 template<
long m,
long n>
33 static_assert(0<m,
"m must be positive!");
34 static_assert(0<n,
"n must be positive!");
Statically compute the greatest common divisor of two integers.
static const long value
The least common multiple of the template parameters m and n.
Definition lcm.hh:40
static void conceptCheck()
Definition lcm.hh:31
Dune namespace.
Definition alignment.hh:11
Calculator of the greatest common divisor.
Definition gcd.hh:66
Calculate the least common multiple of two numbers.
Definition lcm.hh:30