MapGroup

Instance Constructors

new MapGroup()(implicit group: Group[V])

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def add(oldMap: Map[K, V], kv: (K, V)): Map[K, V]

Definition Classes
MapMonoid → MapOperations
def additive: algebra.Group[Map[K, V]]

These are from algebra.
These are from algebra.Monoid

Definition Classes
Group → AdditiveGroup → Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup
final def asInstanceOf[T0]: T0

Definition Classes
Any
def assertNotZero(v: Map[K, V]): Unit

Definition Classes
Monoid
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def combine(l: Map[K, V], r: Map[K, V]): Map[K, V]

Definition Classes
Semigroup → Semigroup
def combineAll(t: TraversableOnce[Map[K, V]]): Map[K, V]

Definition Classes
Monoid → Monoid
def combineAllOption(as: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

Definition Classes
Monoid → Semigroup
def combineN(a: Map[K, V], n: Int): Map[K, V]

Definition Classes
Group → Monoid → Semigroup
def empty: Map[K, V]

Definition Classes
Monoid → Monoid
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromMutable(mut: Map[K, V]): Map[K, V]

Definition Classes
MapMonoid → MapOperations
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
implicit val group: Group[V]
def hashCode(): Int

Definition Classes
AnyRef → Any
def inverse(v: Map[K, V]): Map[K, V]

Definition Classes
Group → Group
def isEmpty(a: Map[K, V])(implicit ev: Eq[Map[K, V]]): Boolean

Definition Classes
Monoid
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isNonZero(x: Map[K, V]): Boolean

Definition Classes
GenericMapMonoid → Monoid
def isZero(a: Map[K, V])(implicit ev: Eq[Map[K, V]]): Boolean

Definition Classes
AdditiveMonoid
def minus(x: Map[K, V], y: Map[K, V]): Map[K, V]

Definition Classes
AdditiveGroup
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def negate(kv: Map[K, V]): Map[K, V]

Definition Classes
MapGroup → AdditiveGroup
val nonZero: (V) ⇒ Boolean

Definition Classes
GenericMapMonoid
def nonZeroOption(v: Map[K, V]): Option[Map[K, V]]

Definition Classes
Monoid
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def plus(x: Map[K, V], y: Map[K, V]): Map[K, V]

Definition Classes
GenericMapMonoid → AdditiveSemigroup
def positiveSumN(a: Map[K, V], n: Int): Map[K, V]

Attributes
protected[this]
Definition Classes
AdditiveSemigroup
def remove(l: Map[K, V], r: Map[K, V]): Map[K, V]

Definition Classes
Group → Group
def remove(oldMap: Map[K, V], k: K): Map[K, V]

Definition Classes
MapMonoid → MapOperations
def repeatedCombineN(a: Map[K, V], n: Int): Map[K, V]

Attributes
protected[this]
Definition Classes
Semigroup
implicit val semigroup: Semigroup[V]

Definition Classes
GenericMapMonoid
def sum(vs: TraversableOnce[Map[K, V]]): Map[K, V]

Definition Classes
Monoid → AdditiveMonoid
def sumN(a: Map[K, V], n: Int): Map[K, V]

Definition Classes
AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
def sumOption(items: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

Returns an instance of T calculated by summing all instances in iter in one pass.
Returns an instance of T calculated by summing all instances in iter in one pass. Returns None if iter is empty, else Some[T].
returns
None if iter is empty, else an option value containing the summed T

Definition Classes
GenericMapMonoid → Semigroup
Note
Override if there is a faster way to compute this sum than iter.reduceLeftOption using plus.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def trySum(as: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

Definition Classes
AdditiveMonoid → AdditiveSemigroup
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
lazy val zero: Map[K, V]

Definition Classes
MapMonoid → AdditiveMonoid

class MapGroup[K, V] extends MapMonoid[K, V] with Group[Map[K, V]]

Instance Constructors

new MapGroup()(implicit group: Group[V])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def add(oldMap: Map[K, V], kv: (K, V)): Map[K, V]

def additive: algebra.Group[Map[K, V]]

final def asInstanceOf[T0]: T0

def assertNotZero(v: Map[K, V]): Unit

def clone(): AnyRef

def combine(l: Map[K, V], r: Map[K, V]): Map[K, V]

def combineAll(t: TraversableOnce[Map[K, V]]): Map[K, V]

def combineAllOption(as: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

def combineN(a: Map[K, V], n: Int): Map[K, V]

def empty: Map[K, V]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromMutable(mut: Map[K, V]): Map[K, V]

final def getClass(): Class[_]

implicit val group: Group[V]

def hashCode(): Int

def inverse(v: Map[K, V]): Map[K, V]

def isEmpty(a: Map[K, V])(implicit ev: Eq[Map[K, V]]): Boolean

final def isInstanceOf[T0]: Boolean

def isNonZero(x: Map[K, V]): Boolean

def isZero(a: Map[K, V])(implicit ev: Eq[Map[K, V]]): Boolean

def minus(x: Map[K, V], y: Map[K, V]): Map[K, V]

final def ne(arg0: AnyRef): Boolean

def negate(kv: Map[K, V]): Map[K, V]

val nonZero: (V) ⇒ Boolean

def nonZeroOption(v: Map[K, V]): Option[Map[K, V]]

final def notify(): Unit

final def notifyAll(): Unit

def plus(x: Map[K, V], y: Map[K, V]): Map[K, V]

def positiveSumN(a: Map[K, V], n: Int): Map[K, V]

def remove(l: Map[K, V], r: Map[K, V]): Map[K, V]

def remove(oldMap: Map[K, V], k: K): Map[K, V]

def repeatedCombineN(a: Map[K, V], n: Int): Map[K, V]

implicit val semigroup: Semigroup[V]

def sum(vs: TraversableOnce[Map[K, V]]): Map[K, V]

def sumN(a: Map[K, V], n: Int): Map[K, V]

def sumOption(items: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def trySum(as: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

lazy val zero: Map[K, V]

Inherited from Group[Map[K, V]]

Inherited from AdditiveGroup[Map[K, V]]

Inherited from cats.kernel.Group[Map[K, V]]

Inherited from MapMonoid[K, V]

Inherited from GenericMapMonoid[K, V, Map[K, V]]

Inherited from MapOperations[K, V, Map[K, V]]

Inherited from Monoid[Map[K, V]]

Inherited from AdditiveMonoid[Map[K, V]]

Inherited from cats.kernel.Monoid[Map[K, V]]

Inherited from Semigroup[Map[K, V]]

Inherited from AdditiveSemigroup[Map[K, V]]

Inherited from cats.kernel.Semigroup[Map[K, V]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped