std::experimental::gcd

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Technical Specifications

 

Technical specifications

Filesystem library (filesystem TS)

Library fundamentals (library fundamentals TS)

Library fundamentals 2 (library fundamentals 2 TS)

Extensions for parallelism (parallelism TS)

Concepts (concepts TS)

Extensions for concurrency (concurrency TS)

 

Library fundamentals v2

experimental::propagate_const

experimental::not_fn

experimental::observer_ptr

experimental::make_array

experimental::ostream_joiner

experimental::gcd

experimental::lcm

experimental::source_location

detection idiom

uniform container erasure

 

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.

Parameters

m, n

-

integer values

Return value

If either m or n is zero, returns zero. Otherwise, returns the greatest common divisor of |m| and |n|.

Remarks

If either M or N is not an integer type, the program is ill-formed.

If |m| is not representable as a value of type M or |n| is not representable as a value of type N, the behavior is undefined.

Exceptions

Throws no exceptions.

See also

lcm	constexpr function template returning the least common multiple of two integers (function template)