Result of comparing this with operand that.
Result of comparing this with operand that.
Implement this method to determine how instances of A will be sorted.
Returns x where:
x < 0 when this < thatx == 0 when this == thatx > 0 when this > that
Returns true if this is less than that
Returns true if this is less than or equal to that.
Returns true if this is greater than that.
Returns true if this is greater than or equal to that.
Result of comparing this with operand that.
Result of comparing this with operand that.
Returns string formatted according to given format string.
Returns string formatted according to given format string.
Format strings are as for String.format
(@see java.lang.String.format).
Returns true if this is less than that
Returns true if this is less than that
(ordered: Ordered[Ordered[A]]).<(that)
Returns true if this is less than or equal to that.
Returns true if this is less than or equal to that.
(ordered: Ordered[Ordered[A]]).<=(that)
Returns true if this is greater than that.
Returns true if this is greater than that.
(ordered: Ordered[Ordered[A]]).>(that)
Returns true if this is greater than or equal to that.
Returns true if this is greater than or equal to that.
(ordered: Ordered[Ordered[A]]).>=(that)
Result of comparing this with operand that.
Result of comparing this with operand that.
Implement this method to determine how instances of A will be sorted.
Returns x where:
x < 0 when this < thatx == 0 when this == thatx > 0 when this > that(ordered: Ordered[Ordered[A]]).compare(that)
Result of comparing this with operand that.
Result of comparing this with operand that.
(ordered: Ordered[Ordered[A]]).compareTo(that)
A trait for data that have a single, natural ordering. See scala.math.Ordering before using this trait for more information about whether to use scala.math.Ordering instead.
Classes that implement this trait can be sorted with scala.util.Sorting and can be compared with standard comparison operators (e.g. > and <).
Ordered should be used for data with a single, natural ordering (like integers) while Ordering allows for multiple ordering implementations. An Ordering instance will be implicitly created if necessary.
scala.math.Ordering is an alternative to this trait that allows multiple orderings to be defined for the same type.
scala.math.PartiallyOrdered is an alternative to this trait for partially ordered data.
For example, create a simple class that implements
Orderedand then sort it with scala.util.Sorting:It is important that the
equalsmethod for an instance ofOrdered[A]be consistent with the compare method. However, due to limitations inherent in the type erasure semantics, there is no reasonable way to provide a default implementation of equality for instances ofOrdered[A]. Therefore, if you need to be able to use equality on an instance ofOrdered[A]you must provide it yourself either when inheriting or instantiating.It is important that the
hashCodemethod for an instance ofOrdered[A]be consistent with thecomparemethod. However, it is not possible to provide a sensible default implementation. Therefore, if you need to be able compute the hash of an instance ofOrdered[A]you must provide it yourself either when inheriting or instantiating.1.1, 2006-07-24
scala.math.Ordering, scala.math.PartiallyOrdered