std::ranges::greater
Defined in header <functional>
|
||
struct greater; |
(since C++20) | |
Function object for performing comparisons. Deduces the parameter types of the function call operator from the arguments (but not the return type).
Contents |
[edit] Implementation-defined strict total order over pointers
The function call operator yields the implementation-defined strict total order over pointers if the <
operator between arguments invokes a built-in comparison operator for a pointer, even if the built-in <
operator does not.
The implementation-defined strict total order is consistent with the partial order imposed by built-in comparison operators (<=>, <, >, <=, and >=), and consistent among following standard function objects :
- std::less, std::greater, std::less_equal, and std::greater_equal, when the template argument is a pointer type or void
- std::ranges::less, std::ranges::greater, std::ranges::less_equal, std::ranges::greater_equal, and std::compare_three_way
[edit] Member types
Member type | Definition |
is_transparent
|
/* unspecified */ |
[edit] Member functions
operator() |
checks if the first argument is greater than the second (public member function) |
std::ranges::greater::operator()
template< class T, class U > requires std::totally_ordered_with<T, U> || |
||
Compares t
and u
. Equivalent to return ranges::less{}(std::forward<U>(u), std::forward<T>(t));.
[edit] Notes
Unlike std::greater, std::ranges::greater
requires all six comparison operators <
, <=
, >
, >=
, ==
and !=
to be valid (via the totally_ordered_with
constraint) and is entirely defined in terms of
std::ranges::less. However, the implementation is free to use operator> directly, because those concepts require the results of the comparison operators to be consistent.
[edit] Example
This section is incomplete Reason: no example |
[edit] See also
function object implementing x > y (class template) |