Scala Library: scala.concurrent.duration.Deadline.DeadlineIsOrdered
scala.concurrent.duration.Deadline.DeadlineIsOrdered
The natural ordering for deadline is determined by the natural order of the underlying (finite) duration.
Type Members
class Ops extends AnyRef
This inner class defines comparison operators available for T
.
- Definition Classes
- Ordering
Value Members From java.util.Comparator
def reversed(): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
def thenComparing(arg0: Comparator[_ >: Deadline]): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
def thenComparingDouble(arg0: ToDoubleFunction[_ >: Deadline]): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
def thenComparingInt(arg0: ToIntFunction[_ >: Deadline]): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
def thenComparingLong(arg0: ToLongFunction[_ >: Deadline]): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
def thenComparing[U <: Comparable[_ >: U]](arg0: java.util.function.Function[_ >: Deadline, _ <: U]): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
def thenComparing[U](arg0: java.util.function.Function[_ >: Deadline, _ <: U], arg1: Comparator[_ >: U]): Comparator[Deadline]
- Definition Classes
- Comparator
(defined at java.util.Comparator)
Value Members From scala.concurrent.duration.Deadline.DeadlineIsOrdered
def compare(a: Deadline, b: Deadline): Int
Returns an integer whose sign communicates how x compares to y.
The result sign has the following meaning:
- negative if x < y
- positive if x > y
-
zero otherwise (if x == y)
- Definition Classes
- DeadlineIsOrdered → Ordering → Comparator
(defined at scala.concurrent.duration.Deadline.DeadlineIsOrdered)
Value Members From scala.math.Ordering
def equiv(x: Deadline, y: Deadline): Boolean
Return true if x
== y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering → Equiv
(defined at scala.math.Ordering)
def gt(x: Deadline, y: Deadline): Boolean
Return true if x
> y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def gteq(x: Deadline, y: Deadline): Boolean
Return true if x
>= y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def lt(x: Deadline, y: Deadline): Boolean
Return true if x
< y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def lteq(x: Deadline, y: Deadline): Boolean
Return true if x
<= y
in the ordering.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def max(x: Deadline, y: Deadline): Deadline
Return x
if x
>= y
, otherwise y
.
- Definition Classes
- Ordering
(defined at scala.math.Ordering)
def min(x: Deadline, y: Deadline): Deadline
Return x
if x
<= y
, otherwise y
.
- Definition Classes
- Ordering
(defined at scala.math.Ordering)
implicit def mkOrderingOps(lhs: Deadline): Ops
This implicit method augments T
with the comparison operators defined in
scala.math.Ordering.Ops
.
- Definition Classes
- Ordering
(defined at scala.math.Ordering)
def on[U](f: (U) ⇒ Deadline): math.Ordering[U]
Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:
- Definition Classes
- Ordering
(defined at scala.math.Ordering)
def reverse: math.Ordering[Deadline]
Return the opposite ordering of this one.
- Definition Classes
- Ordering → PartialOrdering
(defined at scala.math.Ordering)
def tryCompare(x: Deadline, y: Deadline): 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:
Interested in Scala?
I send out weekly, personalized emails with articles and conference talks.
Subscribe now.