Returns a negative integer iff x
comes before
y
in the ordering, returns 0 iff x
is the same in the ordering as y
, and returns a
positive number iff x
comes after
y
in the ordering.
Returns a negative integer iff x
comes before
y
in the ordering, returns 0 iff x
is the same in the ordering as y
, and returns a
positive number iff x
comes after
y
in the ordering.
true iff x
is equivalent to y
in the ordering.
true iff y
comes before x
in the ordering, and is not equal to x
.
true iff x
comes after y
in the ordering, or is equal to y
.
true iff x
comes before y
in the ordering, and is not equal to y
.
true iff x
comes before y
in the ordering, or is equal to y
.
Returns the argument which comes later in the ordering.
Returns the argument which comes earlier in the ordering.
Given a function U => T, creates Ordering[U].
An Ordering is defined at all x and y.
An Ordering is defined at all x and y.
A trait for representing total orderings. It is important to distinguish between a type that has a total order and a representation of total ordering on some type. This trait is for the latter.
A ordering is a binary relation on a type
T
that is also an equivalence relation and partial ordering on values of typeT
. This relation is exposed as thecompare
method of theOrdering
trait.This relation must be:
0.9.5, 2008-04-15
2.7