cats.kernel

BoundedSemilattice

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

Linear Supertypes
CommutativeMonoid[A], Monoid[A], Semilattice[A], CommutativeSemigroup[A], Band[A], Semigroup[A], Serializable, Serializable, Any
Known Subclasses
BitSetSemilattice, SetSemilattice, UnitAlgebra
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
Learn more about member selection
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.

    Definition Classes
    Semigroup

  2. abstract def empty: A

    Return the identity element for this monoid.

    Return the identity element for this monoid.

    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.

    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).

    Definition Classes
    Monoid → Semigroup

  9. def combineN(a: A, n: Int): A

    Return a appended to itself n times.

    Return a appended to itself n times.

    Definition Classes
    Monoid → Semigroup

  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.

    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