Packages

c

cats.kernel.instances

SortedSetSemilattice

class SortedSetSemilattice[A] extends BoundedSemilattice[SortedSet[A]]

Source
SortedSetInstances.scala
Linear Supertypes
BoundedSemilattice[SortedSet[A]], CommutativeMonoid[SortedSet[A]], Monoid[SortedSet[A]], Semilattice[SortedSet[A]], CommutativeSemigroup[SortedSet[A]], Band[SortedSet[A]], Semigroup[SortedSet[A]], Serializable, AnyRef, Any
Known Subclasses
SortedSetSemilattice
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SortedSetSemilattice
  2. BoundedSemilattice
  3. CommutativeMonoid
  4. Monoid
  5. Semilattice
  6. CommutativeSemigroup
  7. Band
  8. Semigroup
  9. Serializable
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def asJoinPartialOrder(implicit ev: Eq[SortedSet[A]]): PartialOrder[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: Eq[SortedSet[A]]): PartialOrder[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(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  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
    SortedSetSemilattice → Semigroup
  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
    Monoid → Semigroup
  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
    BoundedSemilattice → Monoid → Semigroup
  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
    SortedSetSemilattice → Monoid
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  16. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. def intercalate(middle: SortedSet[A]): CommutativeSemigroup[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
    CommutativeSemigroup → Semigroup
  19. def isEmpty(a: SortedSet[A])(implicit 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
    Definition Classes
    Monoid
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. 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
    Band → Semigroup
  25. def reverse: CommutativeMonoid[SortedSet[A]]

    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
    CommutativeMonoid → CommutativeSemigroup → Monoid → Semigroup
  26. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from BoundedSemilattice[SortedSet[A]]

Inherited from CommutativeMonoid[SortedSet[A]]

Inherited from Monoid[SortedSet[A]]

Inherited from Semilattice[SortedSet[A]]

Inherited from CommutativeSemigroup[SortedSet[A]]

Inherited from Band[SortedSet[A]]

Inherited from Semigroup[SortedSet[A]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped