std::experimental::ranges::less_equal
<experimental/ranges/functional>
requires StrictTotallyOrdered<T> ||
Same<T, void> ||
/* < on two const T lvalues invokes a built-in operator comparing pointers */
struct less_equal<void>;
Function object for performing comparisons. The primary template invokes operator< on const lvalues of type T with the argument order inverted and then negates the result. The specialization less_equal<void> deduces the parameter types of the function call operator from the arguments (but not the return type).
All specializations of less_equal are Semiregular.
Contents
[edit] Member types
is_transparent (member only of less_equal<void> specialization)
/* unspecified */
[edit] Member functions
(public member function)
std::experimental::ranges::less_equal::operator()
less_equal<T> template)
requires StrictTotallyOrderedWith<T, U> ||
/* std::declval<T>() < std::declval<U>() resolves to
a built-in operator comparing pointers */
less_equal<void> specialization)
t and u. Equivalent to return !ranges::less <>{}(std::forward <U>(u), std::forward <T>(t));.
[edit] Notes
Unlike std::less_equal , ranges::less_equal requires all six comparison operators <, <=, >, >=, == and != to be valid (via the StrictTotallyOrdered and StrictTotallyOrderedWith constraints) and is entirely defined in terms of 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
Reason: no example