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/../utility/program/../compare/partial_order.html below:

std::partial_order - cppreference.com

inline namespace /* unspecified */ {

    inline constexpr /* unspecified */ partial_order = /* unspecified */;

}
(since C++20)

Call signature

template< class T, class U >

    requires /* see below */
constexpr std::partial_ordering

    partial_order( T&& t, U&& u ) noexcept(/* see below */);

Compares two values using 3-way comparison and produces a result of type std::partial_ordering.

Let t and u be expressions and T and U denote decltype((t)) and decltype((u)) respectively, std::partial_order(t, u) is expression-equivalent to:

Customization point objects

The name std::partial_order denotes a customization point object, which is a const function object of a literal semiregular class type. See CustomizationPointObject for details.

[edit] Example [edit] See also the result type of 3-way comparison that supports all 6 operators, is not substitutable, and allows incomparable values
(class) [edit] performs 3-way comparison and produces a result of type std::strong_ordering
(customization point object)[edit] performs 3-way comparison and produces a result of type std::weak_ordering
(customization point object)[edit] performs 3-way comparison and produces a result of type std::partial_ordering, even if operator<=> is unavailable
(customization point object)[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