class MapAdditiveMonoid[K, V] extends AdditiveMonoid[Map[K, V]]
Ordering
- Alphabetic
- By Inheritance
Inherited
- MapAdditiveMonoid
- AdditiveMonoid
- AdditiveSemigroup
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new MapAdditiveMonoid()(implicit V: AdditiveSemigroup[V])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
additive: Monoid[Map[K, V]]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isZero(a: Map[K, V])(implicit ev: Eq[Map[K, V]]): Boolean
Tests if
a
is zero.Tests if
a
is zero.- Definition Classes
- AdditiveMonoid
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
plus(xs: Map[K, V], ys: Map[K, V]): Map[K, V]
- Definition Classes
- MapAdditiveMonoid → AdditiveSemigroup
-
def
positiveSumN(a: Map[K, V], n: Int): Map[K, V]
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
-
def
sum(as: TraversableOnce[Map[K, V]]): Map[K, V]
Given a sequence of
as
, compute the sum.Given a sequence of
as
, compute the sum.- Definition Classes
- MapAdditiveMonoid → AdditiveMonoid
-
def
sumN(a: Map[K, V], n: Int): Map[K, V]
- Definition Classes
- MapAdditiveMonoid → AdditiveMonoid → AdditiveSemigroup
-
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]]
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
- AdditiveMonoid → AdditiveSemigroup
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
zero: Map[K, V]
- Definition Classes
- MapAdditiveMonoid → AdditiveMonoid