core/cats.collections/HashSetIntersectionMonoid

HashSetIntersectionMonoid

class HashSetIntersectionMonoid[A] extends CommutativeMonoid[HashSet[A]]
Source:
HashSet.scala
trait Monoid[HashSet[A]]
trait Semigroup[HashSet[A]]
class Object
trait Matchable
class Any

Value members

Concrete methods

override def combine(x: HashSet[A], y: HashSet[A]): HashSet[A]
Definition Classes
Source:
HashSet.scala
override def empty: HashSet[A]
Definition Classes
Source:
HashSet.scala

Inherited methods

def combineAll(as: IterableOnce[HashSet[A]]): HashSet[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
Source:
Monoid.scala
override def combineAllOption(as: IterableOnce[HashSet[A]]): Option[HashSet[A]]
Definition Classes
Inherited from:
Monoid
Source:
Monoid.scala
override def combineN(a: HashSet[A], n: Int): HashSet[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
Inherited from:
=0")elseif(n.==(0))Monoid.this.emptyelseMonoid.this.repeatedCombineN(a,n)">Monoid
Source:
Monoid.scala
def isEmpty(a: HashSet[A])(implicit ev: Eq[HashSet[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
Source:
Monoid.scala