c

# SortedSetSemilattice 

#### class SortedSetSemilattice[A] extends kernel.instances.SortedSetSemilattice[A]

Annotations
@deprecated
Deprecated

(Since version 2.0.0-RC2) Use cats.kernel.instances.SortedSetSemilattice

Source
sortedSet.scala
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. SortedSetSemilattice
2. SortedSetSemilattice
3. BoundedSemilattice
4. CommutativeMonoid
5. Monoid
6. Semilattice
7. CommutativeSemigroup
8. Band
9. Semigroup
10. Serializable
11. Serializable
12. AnyRef
13. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Instance Constructors

1. new SortedSetSemilattice()(implicit arg0: kernel.Order[A])

### Value Members

1. final def !=(arg0: Any)
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def ==(arg0: Any)
Definition Classes
AnyRef → Any
4. final def asInstanceOf[T0]: T0
Definition Classes
Any
5. def asJoinPartialOrder(implicit ev: kernel.Eq[SortedSet[A]])

Given Eq[A], return a PartialOrder[A] using the `combine` operator to determine the partial ordering.

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

Definition Classes
Semilattice
6. def asMeetPartialOrder(implicit ev: kernel.Eq[SortedSet[A]])

Given Eq[A], return a PartialOrder[A] using the `combine` operator to determine the partial ordering.

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

Definition Classes
Semilattice
7. def clone()
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( ... ) @native() @IntrinsicCandidate()
8. def combine(x: SortedSet[A], y: SortedSet[A]): SortedSet[A]

Associative operation which combines two values.

Associative operation which combines two values.

Example:

```scala> import cats.kernel.instances.string._
scala> import cats.kernel.instances.int._
scala> import cats.kernel.instances.option._

scala> Semigroup[String].combine("Hello ", "World!")
res0: String = Hello World!

scala> Semigroup[Option[Int]].combine(None, Some(1))
res1: Option[Int] = Some(1)```
Definition Classes
SortedSetSemilatticeSemigroup
9. 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 = ""```
Definition Classes
Monoid
10. def combineAllOption(as: IterableOnce[SortedSet[A]]): Option[SortedSet[A]]

Given a sequence of `as`, combine them and return the total.

Given a sequence of `as`, combine them and return the total.

If the sequence is empty, returns None. Otherwise, returns Some(total).

Example:

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

scala> Semigroup[String].combineAllOption(List("One ", "Two ", "Three"))
res0: Option[String] = Some(One Two Three)

scala> Semigroup[String].combineAllOption(List.empty)
res1: Option[String] = None```
Definition Classes
MonoidSemigroup
11. def combineN(a: SortedSet[A], n: Int): SortedSet[A]

Return `a` appended to itself `n` times.

Return `a` appended to itself `n` times.

Example:

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

scala> Monoid[String].combineN("ha", 3)
res0: String = hahaha

scala> Monoid[String].combineN("ha", 0)
res1: String = ""```
Definition Classes
BoundedSemilatticeMonoidSemigroup
12. def empty: SortedSet[A]

Return the identity element for this monoid.

Return the identity element for this monoid.

Example:

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

scala> Monoid[String].empty
res0: String = ""

scala> Monoid[Int].empty
res1: Int = 0```
Definition Classes
SortedSetSemilatticeMonoid
13. final def eq(arg0: AnyRef)
Definition Classes
AnyRef
14. def equals(arg0: Any)
Definition Classes
AnyRef → Any
15. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native() @IntrinsicCandidate()
16. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native() @IntrinsicCandidate()
17. def intercalate(middle: SortedSet[A])

Between each pair of elements insert middle This name matches the term used in Foldable and Reducible and a similar Haskell function.

Between each pair of elements insert middle This name matches the term used in Foldable and Reducible and a similar Haskell function.

Definition Classes
CommutativeSemigroupSemigroup
18. def isEmpty(a: SortedSet[A])(implicit ev: kernel.Eq[SortedSet[A]])

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```
Definition Classes
Monoid
19. final def isInstanceOf[T0]
Definition Classes
Any
20. final def ne(arg0: AnyRef)
Definition Classes
AnyRef
21. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @IntrinsicCandidate()
22. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @IntrinsicCandidate()
23. def repeatedCombineN(a: SortedSet[A], n: Int): SortedSet[A]

Return `a` combined with itself more than once.

Return `a` combined with itself more than once.

Attributes
protected[this]
Definition Classes
BandSemigroup
24. def reverse

return a semigroup that reverses the order so combine(a, b) == reverse.combine(b, a)

return a semigroup that reverses the order so combine(a, b) == reverse.combine(b, a)

Definition Classes
CommutativeMonoidCommutativeSemigroupMonoidSemigroup
25. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
26. def toString(): String
Definition Classes
AnyRef → Any
27. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
28. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... ) @native()
29. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )

### Deprecated Value Members

1. def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] ) @Deprecated
Deprecated