SortedSetSemilattice

class SortedSetSemilattice[A] extends BoundedSemilattice[SortedSet[A]]
trait BoundedSemilattice[SortedSet[A]]
trait CommutativeMonoid[SortedSet[A]]
trait Monoid[SortedSet[A]]
trait Semilattice[SortedSet[A]]
trait CommutativeSemigroup[SortedSet[A]]
trait Band[SortedSet[A]]
trait Semigroup[SortedSet[A]]
trait Serializable
class Object
trait Matchable
class Any

Value members

Concrete methods

def combine(x: SortedSet[A], y: SortedSet[A]): SortedSet[A]
def empty: SortedSet[A]

Inherited methods

def asJoinPartialOrder(ev: Eq[SortedSet[A]]): PartialOrder[SortedSet[A]]

Given Eq[A], return a PartialOrder[A] using the combine operator to determine the partial ordering. This method assumes combine functions as join (that is, as an upper bound).

Given Eq[A], return a PartialOrder[A] using the combine operator to determine the partial ordering. This method assumes combine functions as join (that is, as an upper bound).

This method returns:

0.0 if x = y -1.0 if y = combine(x, y) 1.0 if x = combine(x, y) NaN otherwise

Inherited from
Semilattice
def asMeetPartialOrder(ev: Eq[SortedSet[A]]): PartialOrder[SortedSet[A]]

Given Eq[A], return a PartialOrder[A] using the combine operator to determine the partial ordering. This method assumes combine functions as meet (that is, as a lower bound).

Given Eq[A], return a PartialOrder[A] using the combine operator to determine the partial ordering. This method assumes combine functions as meet (that is, as a lower bound).

This method returns:

0.0 if x = y -1.0 if x = combine(x, y) 1.0 if y = combine(x, y) NaN otherwise

Inherited from
Semilattice
def combineAll(as: IterableOnce[SortedSet[A]]): SortedSet[A]

Given a sequence of as, sum them using the monoid and return the total.

Given a sequence of as, sum them using the monoid and return the total.

Example:

scala> import cats.kernel.instances.string._

scala> Monoid[String].combineAll(List("One ", "Two ", "Three"))
res0: String = One Two Three

scala> Monoid[String].combineAll(List.empty)
res1: String = ""
Inherited from
Monoid
override def combineAllOption(as: IterableOnce[SortedSet[A]]): Option[SortedSet[A]]
Definition Classes
Inherited from
Monoid
override def combineN(a: SortedSet[A], n: Int): SortedSet[A]
Definition Classes
Inherited from
BoundedSemilattice
override def intercalate(middle: SortedSet[A]): CommutativeSemigroup[SortedSet[A]]
Definition Classes
Inherited from
CommutativeSemigroup
def isEmpty(a: SortedSet[A])(ev: Eq[SortedSet[A]]): Boolean

Tests if a is the identity.

Tests if a is the identity.

Example:

scala> import cats.kernel.instances.string._

scala> Monoid[String].isEmpty("")
res0: Boolean = true

scala> Monoid[String].isEmpty("something")
res1: Boolean = false
Inherited from
Monoid
override def reverse: CommutativeMonoid[SortedSet[A]]