std::partial_order - cppreference.com (original) (raw)

| Defined in header | | | | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | | ------------- | | 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] |