Returns true
if x
and y
are equivalent, false
otherwise.
Returns true
if x
and y
are equivalent, false
otherwise.
Returns false
if x
and y
are equivalent, true
otherwise.
Returns false
if x
and y
are equivalent, true
otherwise.
Defines a partial order on B
by mapping B
to A
using f
and using A
s
order to order B
.
Defines a partial order on B
by mapping B
to A
using f
and using A
s
order to order B
.
Result of comparing x
with y
.
Result of comparing x
with y
. Returns NaN if operands
are not comparable. If operands are comparable, returns a
Double whose sign is:
- negative iff x < y
- zero iff x === y
- positive iff x > y
Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.
Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.
Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.
Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.
Defines a partial order on A
where all arrows switch direction.
Defines a partial order on A
where all arrows switch direction.
Result of comparing x
with y
.
Result of comparing x
with y
. Returns None if operands
are not comparable. If operands are comparable, returns Some[Int]
where the Int sign is:
- negative iff x < y
- zero iff x == y
- positive iff x > y
Interval partial order defined as follows:
Involving empty intervals:
- if I and J are empty, then I === J. - if I (resp. J) is empty and J (resp. I) is non-empty, the ordering is undefined (preserving antisymmetry).
For non-empty intervals:
- I === J is standard Eq semantics (I, J are intersubstituable) - I < J if all x \in I, y \in J have x < y - I > J if all x \in I, y \in J have x > y