HashMapMonoid

class HashMapMonoid[K, V](implicit evidence$1: Hash[K], V: Semigroup[V]) extends Monoid[HashMap[K, V]]
trait Monoid[HashMap[K, V]]
trait Semigroup[HashMap[K, V]]
class Object
trait Matchable
class Any

Value members

Concrete methods

def combine(xs: HashMap[K, V], ys: HashMap[K, V]): HashMap[K, V]
def empty: HashMap[K, V]

Inherited methods

def combineAll(as: IterableOnce[HashMap[K, V]]): HashMap[K, V]

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[HashMap[K, V]]): Option[HashMap[K, V]]
Definition Classes
Inherited from:
Monoid
Source:
Monoid.scala
override def combineN(a: HashMap[K, V], n: Int): HashMap[K, V]

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 intercalate(middle: HashMap[K, V]): Semigroup[HashMap[K, V]]

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.

Inherited from:
Semigroup
Source:
Semigroup.scala
def isEmpty(a: HashMap[K, V])(implicit ev: Eq[HashMap[K, V]]): 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
override def reverse: Monoid[HashMap[K, V]]
Definition Classes
Inherited from:
Monoid
Source:
Monoid.scala