An ordering by id for values of this set
| Supertypes | |
|---|---|
| Self type |
This inner class defines comparison operators available for T.
It can't extend AnyVal because it is not a top-level class or a member of a statically accessible object.
| Inherited from | Ordering |
|---|
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)
Return true if x == y in the ordering.
| Definition Classes | Ordering -> PartialOrdering -> Equiv |
|---|---|
| Inherited from | Ordering |
Return true if x > y in the ordering.
| Definition Classes | Ordering -> PartialOrdering |
|---|---|
| Inherited from | Ordering |
Return true if x >= y in the ordering.
| Definition Classes | Ordering -> PartialOrdering |
|---|---|
| Inherited from | Ordering |
Returns whether or not the other ordering is the opposite ordering of this one.
Equivalent to other == this.reverse.
Implementations should only override this method if they are overriding reverse as well.
| Inherited from | Ordering |
|---|
Return true if x < y in the ordering.
| Definition Classes | Ordering -> PartialOrdering |
|---|---|
| Inherited from | Ordering |
Return true if x <= y in the ordering.
| Definition Classes | Ordering -> PartialOrdering |
|---|---|
| Inherited from | Ordering |
Return x if x >= y, otherwise y.
| Inherited from | Ordering |
|---|
Return x if x <= y, otherwise y.
| Inherited from | Ordering |
|---|
Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:
def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
| Inherited from | Ordering |
|---|
Creates an Ordering[T] whose compare function returns the result of this Ordering's compare function, if it is non-zero, or else the result of others compare function.
| Value parameters |
|
|---|---|
| Example |
case class Pair(a: Int, b: Int)
val pairOrdering = Ordering.by[Pair, Int](_.a)
.orElse(Ordering.by[Pair, Int](_.b))
|
| Inherited from | Ordering |
Given f, a function from T into S, creates an Ordering[T] whose compare function returns the result of this Ordering's compare function, if it is non-zero, or else a result equivalent to:
Ordering[S].compare(f(x), f(y))
This function is equivalent to passing the result of Ordering.by(f) to orElse.
| Example |
case class Pair(a: Int, b: Int)
val pairOrdering = Ordering.by[Pair, Int](_.a)
.orElseBy[Int](_.b)
|
|---|---|
| Inherited from | Ordering |
Return the opposite ordering of this one.
Implementations overriding this method MUST override isReverseOf as well if they change the behavior at all (for example, caching does not require overriding it).
| Definition Classes | Ordering -> PartialOrdering |
|---|---|
| Inherited from | Ordering |
| Inherited from | Comparator |
|---|
| Inherited from | Comparator |
|---|
| Inherited from | Comparator |
|---|
| Inherited from | Comparator |
|---|
| Inherited from | Comparator |
|---|
| Inherited from | Comparator |
|---|
| Inherited from | Comparator |
|---|
Returns whether a comparison between x and y is defined, and if so the result of compare(x, y).
| Inherited from | Ordering |
|---|
This implicit method augments T with the comparison operators defined in scala.math.Ordering.Ops.
| Inherited from | Ordering |
|---|
© 2002-2022 EPFL, with contributions from Lightbend.
Licensed under the Apache License, Version 2.0.
https://scala-lang.org/api/3.2.0/scala/Enumeration$ValueOrdering$.html