scala.Enumeration#ValueOrdering
An ordering by id for values of this set
Type Members
class Ops extends AnyRef
This inner class defines comparison operators available for T
.
Value Members From java.util.Comparator
def reversed(): Comparator[Value]
(defined at java.util.Comparator)
def thenComparing(arg0: Comparator[_ >: Value]): Comparator[Value]
(defined at java.util.Comparator)
def thenComparingDouble(arg0: ToDoubleFunction[_ >: Value]): Comparator[Value]
(defined at java.util.Comparator)
def thenComparingInt(arg0: ToIntFunction[_ >: Value]): Comparator[Value]
(defined at java.util.Comparator)
def thenComparingLong(arg0: ToLongFunction[_ >: Value]): Comparator[Value]
(defined at java.util.Comparator)
def thenComparing[U <: Comparable[_ >: U]](arg0: java.util.function.Function[_ >: Value, _ <: U]): Comparator[Value]
(defined at java.util.Comparator)
def thenComparing[U](arg0: java.util.function.Function[_ >: Value, _ <: U], arg1: Comparator[_ >: U]): Comparator[Value]
(defined at java.util.Comparator)
Value Members From scala.Enumeration.ValueOrdering
def compare(x: Value, y: Value): Int
Returns an integer whose sign communicates how x compares to y.
The result sign has the following meaning:
(defined at scala.Enumeration.ValueOrdering)
Value Members From scala.math.Ordering
def equiv(x: Value, y: Value): Boolean
Return true if x
== y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering → Equiv
(defined at scala.math.Ordering)
def gt(x: Value, y: Value): Boolean
Return true if x
> y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def gteq(x: Value, y: Value): Boolean
Return true if x
>= y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def lt(x: Value, y: Value): Boolean
Return true if x
< y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def lteq(x: Value, y: Value): Boolean
Return true if x
<= y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def max(x: Value, y: Value): Value
Return x
if x
>= y
, otherwise y
.
(defined at scala.math.Ordering)
def min(x: Value, y: Value): Value
Return x
if x
<= y
, otherwise y
.
(defined at scala.math.Ordering)
implicit def mkOrderingOps(lhs: Value): Ops
This implicit method augments T
with the comparison operators defined in
scala.math.Ordering.Ops
.
(defined at scala.math.Ordering)
def on[U](f: (U) ⇒ Value): math.Ordering[U]
Given f, a function from U into T, creates an Ordering[U] whose compare function
is equivalent to:
(defined at scala.math.Ordering)
def reverse: math.Ordering[Value]
Return the opposite ordering of this one.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def tryCompare(x: Value, y: Value): Some[Int]
Returns whether a comparison between x
and y
is defined, and if so the
result of compare(x, y)
.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
Full Source: