trait BoundedSemilattice[A] extends Semilattice[A] with CommutativeMonoid[A]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BoundedSemilattice
  2. CommutativeMonoid
  3. Monoid
  4. Semilattice
  5. CommutativeSemigroup
  6. Band
  7. Semigroup
  8. Serializable
  9. Serializable
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def combine(x: A, y: A): 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
    Semigroup
  2. abstract def empty: 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
    Monoid
  3. abstract def getClass(): Class[_]
    Definition Classes
    Any

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##(): Int
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def asJoinPartialOrder(implicit ev: Eq[A]): PartialOrder[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[A]): PartialOrder[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 combineAll(as: TraversableOnce[A]): 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
  8. def combineAllOption(as: TraversableOnce[A]): Option[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
  9. def combineN(a: A, n: Int): 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
    MonoidSemigroup
  10. def equals(arg0: Any): Boolean
    Definition Classes
    Any
  11. def hashCode(): Int
    Definition Classes
    Any
  12. def isEmpty(a: A)(implicit ev: Eq[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
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def repeatedCombineN(a: A, n: Int): A

    Return a combined with itself more than once.

    Return a combined with itself more than once.

    Attributes
    protected[this]
    Definition Classes
    Semigroup
  15. def toString(): String
    Definition Classes
    Any

Inherited from CommutativeMonoid[A]

Inherited from Monoid[A]

Inherited from Semilattice[A]

Inherited from CommutativeSemigroup[A]

Inherited from Band[A]

Inherited from Semigroup[A]

Inherited from Serializable

Inherited from Serializable

Inherited from Any

Ungrouped