std::experimental::gcd
From cppreference.com
< cpp | experimental
C++
Experimental
| Technical Specification | ||||
| Filesystem library (filesystem TS) | ||||
| Library fundamentals (library fundamentals TS) | ||||
| Library fundamentals 2 (library fundamentals TS v2) | ||||
| Library fundamentals 3 (library fundamentals TS v3) | ||||
| Extensions for parallelism (parallelism TS) | ||||
| Extensions for parallelism 2 (parallelism TS v2) | ||||
| Extensions for concurrency (concurrency TS) | ||||
| Extensions for concurrency 2 (concurrency TS v2) | ||||
| Concepts (concepts TS) | ||||
| Ranges (ranges TS) | ||||
| Reflection (reflection TS) | ||||
| Mathematical special functions (special functions TR) | ||||
| Experimental Non-TS | ||||
| Pattern Matching | ||||
| Linear Algebra | ||||
| std::execution | ||||
| Contracts | ||||
| 2D Graphics |
Library fundamentals v2
| Defined in header <experimental/numeric>
|
||
| template< class M, class N> constexpr std::common_type_t<M, N> gcd( M m, N n ); |
(library fundamentals TS v2) | |
Computes the greatest common divisor of the integers m and n.
Contents |
[edit] Parameters
| m, n | - | integer values |
[edit] Return value
If both m and n are zero, returns zero. Otherwise, returns the greatest common divisor of |m| and |n|.
[edit] Remarks
If either M or N is not an integer type, or if either is (possibly cv-qualified) bool, the program is ill-formed.
If either |m| or |n| is not representable as a value of type std::common_type_t<M, N>, the behavior is undefined.
[edit] Exceptions
Throws no exceptions.
[edit] See also
constexpr function template returning the least common multiple of two integers (function template) |
