MapMonoid

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   MapMonoid → MapOperations

5. def additive: algebra.Monoid[Map[K, V]]

   

   These are from algebra.Monoid

   These are from algebra.Monoid

   Definition Classes

   Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

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

   

   Definition Classes

   Monoid

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   Semigroup → Semigroup

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

    

    Definition Classes

    Monoid → Monoid

11. def combineAllOption(as: IterableOnce[Map[K, V]]): Option[Map[K, V]]

    

    Definition Classes

    Monoid → Semigroup

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

    

    Definition Classes

    Monoid → Semigroup

13. def empty: Map[K, V]

    

    Definition Classes

    Monoid → Monoid

14. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

15. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

16. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    MapMonoid → MapOperations

18. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

19. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    Monoid

21. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    GenericMapMonoid → Monoid

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

    

    Definition Classes

    AdditiveMonoid

24. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

25. val nonZero: (V) ⇒ Boolean

    

    Definition Classes

    GenericMapMonoid

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

    

    Definition Classes

    Monoid

27. final def notify(): Unit

    

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    GenericMapMonoid → AdditiveSemigroup

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

    

    Attributes

    protected[this]

    Definition Classes

    AdditiveSemigroup

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

    

    Definition Classes

    MapMonoid → MapOperations

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

    

    Attributes

    protected[this]

    Definition Classes

    Semigroup

33. implicit val semigroup: Semigroup[V]

    

    Definition Classes

    GenericMapMonoid

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

    

    Definition Classes

    Monoid → AdditiveMonoid

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

    

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

36. 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.

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

    

    Definition Classes

    AnyRef

38. def toString(): String

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

40. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

42. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

43. lazy val zero: Map[K, V]

    

    Definition Classes

    MapMonoid → AdditiveMonoid