class SortedSetOrder[A] extends Order[SortedSet[A]]
- Alphabetic
- By Inheritance
- SortedSetOrder
- Order
- PartialOrder
- Eq
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def compare(a1: SortedSet[A], a2: SortedSet[A]): Int
Result of comparing
x
withy
.Result of comparing
x
withy
. Returns an Int whose sign is: - negative iffx < y
- zero iffx = y
- positive iffx > y
- Definition Classes
- SortedSetOrder → Order
- def comparison(x: SortedSet[A], y: SortedSet[A]): Comparison
Like
compare
, but returns a cats.kernel.Comparison instead of an Int.Like
compare
, but returns a cats.kernel.Comparison instead of an Int. Has the benefit of being able to pattern match on, but not as performant.- Definition Classes
- Order
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def eqv(s1: SortedSet[A], s2: SortedSet[A]): Boolean
Returns true if
x
=y
, false otherwise.Returns true if
x
=y
, false otherwise.- Definition Classes
- SortedSetOrder → Order → PartialOrder → Eq
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def gt(x: SortedSet[A], y: SortedSet[A]): Boolean
Returns true if
x
>y
, false otherwise.Returns true if
x
>y
, false otherwise.- Definition Classes
- Order → PartialOrder
- def gteqv(x: SortedSet[A], y: SortedSet[A]): Boolean
Returns true if
x
>=y
, false otherwise.Returns true if
x
>=y
, false otherwise.- Definition Classes
- Order → PartialOrder
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def lt(x: SortedSet[A], y: SortedSet[A]): Boolean
Returns true if
x
<y
, false otherwise.Returns true if
x
<y
, false otherwise.- Definition Classes
- Order → PartialOrder
- def lteqv(x: SortedSet[A], y: SortedSet[A]): Boolean
Returns true if
x
<=y
, false otherwise.Returns true if
x
<=y
, false otherwise.- Definition Classes
- Order → PartialOrder
- def max(x: SortedSet[A], y: SortedSet[A]): SortedSet[A]
If x > y, return x, else return y.
If x > y, return x, else return y.
- Definition Classes
- Order
- def min(x: SortedSet[A], y: SortedSet[A]): SortedSet[A]
If x < y, return x, else return y.
If x < y, return x, else return y.
- Definition Classes
- Order
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def neqv(x: SortedSet[A], y: SortedSet[A]): Boolean
Returns true if
x
!=y
, false otherwise. - final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def partialCompare(x: SortedSet[A], y: SortedSet[A]): Double
Result of comparing
x
withy
.Result of comparing
x
withy
. Returns NaN if operands are not comparable. If operands are comparable, returns a Double whose sign is:- negative iff
x < y
- zero iff
x = y
- positive iff
x > y
- Definition Classes
- Order → PartialOrder
- negative iff
- def partialComparison(x: SortedSet[A], y: SortedSet[A]): Option[Comparison]
Like
partialCompare
, but returns a cats.kernel.Comparison instead of an Double.Like
partialCompare
, but returns a cats.kernel.Comparison instead of an Double. Has the benefit of being able to pattern match on, but not as performant.- Definition Classes
- PartialOrder
- def pmax(x: SortedSet[A], y: SortedSet[A]): Option[SortedSet[A]]
Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.
Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.
- Definition Classes
- PartialOrder
- def pmin(x: SortedSet[A], y: SortedSet[A]): Option[SortedSet[A]]
Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.
Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.
- Definition Classes
- PartialOrder
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toOrdering: Ordering[SortedSet[A]]
Convert a
Order[A]
to ascala.math.Ordering[A]
instance.Convert a
Order[A]
to ascala.math.Ordering[A]
instance.- Definition Classes
- Order
- def toString(): String
- Definition Classes
- AnyRef → Any
- def tryCompare(x: SortedSet[A], y: SortedSet[A]): Option[Int]
Result of comparing
x
withy
.Result of comparing
x
withy
. Returns None if operands are not comparable. If operands are comparable, returns Some[Int] where the Int sign is:- negative iff
x < y
- zero iff
x = y
- positive iff
x > y
- Definition Classes
- PartialOrder
- negative iff
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()