A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../../cpp/header/../experimental/gcd.html below:

std::experimental::gcd - cppreference.com

Merged into ISO C++ The functionality described on this page was merged into the mainline ISO C++ standard as of 6/2016, see std::gcd (since C++17) (library fundamentals TS v2)

Computes the greatest common divisor of the integers m and n.

[edit] Parameters [edit] Return value

If both m and n are zero, returns zero. Otherwise, returns the greatest common divisor of |m| and |n|.

[edit]

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) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4