CAF 0.17.6
|
Barton–Nackman trick implementation. More...
#include <comparable.hpp>
Friends | |
bool | operator== (const Subclass &lhs, const T &rhs) noexcept |
bool | operator== (const T &lhs, const Subclass &rhs) noexcept |
bool | operator!= (const Subclass &lhs, const T &rhs) noexcept |
bool | operator!= (const T &lhs, const Subclass &rhs) noexcept |
bool | operator< (const Subclass &lhs, const T &rhs) noexcept |
bool | operator> (const Subclass &lhs, const T &rhs) noexcept |
bool | operator< (const T &lhs, const Subclass &rhs) noexcept |
bool | operator> (const T &lhs, const Subclass &rhs) noexcept |
bool | operator<= (const Subclass &lhs, const T &rhs) noexcept |
bool | operator>= (const Subclass &lhs, const T &rhs) noexcept |
bool | operator<= (const T &lhs, const Subclass &rhs) noexcept |
bool | operator>= (const T &lhs, const Subclass &rhs) noexcept |
Barton–Nackman trick implementation.
Subclass
must provide a compare member function that compares to instances of T
and returns an integer x with:
x < 0
if *this < other
x > 0
if *this > other
x == 0
if *this == other