SortedMapCommutativeMonoid

@deprecated("Use cats.kernel.instances.SortedMapCommutativeMonoid", "2.0.0-RC2") class SortedMapCommutativeMonoid[K, V](V: CommutativeSemigroup[V], O: Order[K]) extends SortedMapMonoid[K, V] with CommutativeMonoid[SortedMap[K, V]]
Deprecated
trait CommutativeMonoid[SortedMap[K, V]]
trait CommutativeSemigroup[SortedMap[K, V]]
class SortedMapMonoid[K, V]
class SortedMapMonoid[K, V]
trait Monoid[SortedMap[K, V]]
class SortedMapSemigroup[K, V]
trait Semigroup[SortedMap[K, V]]
trait Serializable
class Object
trait Matchable
class Any

Value members

Inherited methods

def combine(xs: SortedMap[K, V], ys: SortedMap[K, V]): SortedMap[K, V]
Inherited from
SortedMapSemigroup
def combineAll(as: IterableOnce[SortedMap[K, V]]): SortedMap[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
override def combineAllOption(as: IterableOnce[SortedMap[K, V]]): Option[SortedMap[K, V]]
Definition Classes
Monoid -> Semigroup
Inherited from
Monoid
override def combineN(a: SortedMap[K, V], n: Int): SortedMap[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
Monoid -> Semigroup
Inherited from
Monoid
def empty: SortedMap[K, V]
Inherited from
SortedMapMonoid
override def intercalate(middle: SortedMap[K, V]): CommutativeSemigroup[SortedMap[K, V]]
Definition Classes
CommutativeSemigroup -> Semigroup
Inherited from
CommutativeSemigroup
def isEmpty(a: SortedMap[K, V])(ev: Eq[SortedMap[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
override def reverse: CommutativeMonoid[SortedMap[K, V]]
Definition Classes
CommutativeMonoid -> CommutativeSemigroup -> Monoid -> Semigroup
Inherited from
CommutativeMonoid