4 ms·
Yes. For X and Y being of the same type, defining the < operator should be enough to derive all other operators: Define X < Y, and then derive the rest: X > Y
by matthewaveryusa 9y ago
Yes. For X and Y being of the same type, defining the < operator should be enough to derive all other operators:
Define X < Y, and then derive the rest:
X > Y : X < Y
X == Y: !(X < Y) && !(Y > X)
X != Y: !(X == Y)
X >= Y: !(X < Y)
X <= Y: !(Y < X)
That's why it's the only operator that needs to be defined for std::map/set (which are rb-trees) in C++
Now, if X and Y aren't the same type, the only thing you can expect to get out of the system is a cronenberg.
- adwn 9y ago> X == Y: !(X < Y) && !(Y > X) Only for totally ordered sets [1]. Floating-point numbers, for example, are not totally ordered, because !(NaN == NaN). [1] https://en.wikipedia.org/wiki/Total_order https://en.wikipedia.org/wiki/Total_order