Class

com.twitter.algebird

MapGroup

Related Doc: package algebird

Permalink

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

You can think of this as a Sparse vector group

Source
MapAlgebra.scala
Linear Supertypes
Group[Map[K, V]], MapMonoid[K, V], GenericMapMonoid[K, V, Map[K, V]], MapOperations[K, V, Map[K, V]], Monoid[Map[K, V]], Semigroup[Map[K, V]], Serializable, AnyRef, Any
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MapGroup
  2. Group
  3. MapMonoid
  4. GenericMapMonoid
  5. MapOperations
  6. Monoid
  7. Semigroup
  8. Serializable
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. def add(oldMap: Map[K, V], kv: (K, V)): Map[K, V]

    Permalink
    Definition Classes
    MapMonoidMapOperations
  5. final def asInstanceOf[T0]: T0

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

    Permalink
    Definition Classes
    Monoid
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

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

    Permalink
    Definition Classes
    MapMonoidMapOperations
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. implicit val group: Group[V]

    Permalink
  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    GenericMapMonoidMonoid
  17. def minus(l: Map[K, V], r: Map[K, V]): Map[K, V]

    Permalink
    Definition Classes
    Group
  18. final def ne(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    MapGroupGroup
  20. val nonZero: (V) ⇒ Boolean

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

    Permalink
    Definition Classes
    Monoid
  22. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

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

    Permalink

    Combines two T instances associatively.

    Combines two T instances associatively.

    returns

    result of combining l and r

    Definition Classes
    GenericMapMonoidSemigroup
  25. def remove(oldMap: Map[K, V], k: K): Map[K, V]

    Permalink
    Definition Classes
    MapMonoidMapOperations
  26. implicit val semigroup: Semigroup[V]

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

    Permalink
    Definition Classes
    Monoid
  28. def sumOption(items: TraversableOnce[Map[K, V]]): Option[Map[K, V]]

    Permalink

    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
    GenericMapMonoidSemigroup
    Note

    Override if there is a faster way to compute this sum than iter.reduceLeftOption using plus.

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

    Permalink
    Definition Classes
    AnyRef
  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  31. final def wait(): Unit

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

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

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

    Permalink

    Returns the identity element of T for plus.

    Returns the identity element of T for plus.

    Definition Classes
    MapMonoidMonoid

Inherited from 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 Semigroup[Map[K, V]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped