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.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

6.  def cube[K, V](it: TraversableOnce[(K, V)])(implicit c: Cuber[K]): Map[K, List[V]]
7.  def cubeAggregate[T, K, U, V](it: TraversableOnce[T], agg: Aggregator[T, U, V])(fn: (T) => K)(implicit c: Cuber[K]): Map[K, V]
8.  def cubeSum[K, V](it: TraversableOnce[(K, V)])(implicit c: Cuber[K], sg: Semigroup[V]): Map[K, V]
9.  def dot[K, V](left: Map[K, V], right: Map[K, V])(implicit mring: Ring[Map[K, V]], mon: Monoid[V]): V
10.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

11.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

12.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

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

13.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  def group[K, V](pairs: TraversableOnce[(K, V)]): Map[K, List[V]]

    For each key, creates a list of all values.

    For each key, creates a list of all values. This function is equivalent to:

    pairs.groupBy(_._1).mapValues(_.map(_._2))

15.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

16.  def invert[K, V](m: Map[K, V]): Map[V, Set[K]]

    Invert the Common case of exactly one value for each key

17.  def invertExact[K, V](m: Map[Option[K], Set[V]]): Map[Option[V], Set[K]]

    Reverses a graph losslessly None key is for v's with no sources.

18.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19.  def join[K, V, W](map1: Map[K, V], map2: Map[K, W]): Map[K, (Option[V], Option[W])]

    join the keys of two maps (similar to outer-join in a DB)

20.  def mergeLookup[T, U, V](keys: TraversableOnce[T])(lookup: (T) => Option[V])(present: (T) => U)(implicit arg0: Monoid[V]): Map[U, V]
21.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

22.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

23.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

24.  def removeZeros[K, V](m: Map[K, V])(implicit arg0: Monoid[V]): Map[K, V]
25.  def rightContainsLeft[K, V](l: Map[K, V], r: Map[K, V])(implicit arg0: Equiv[V]): Boolean
26.  def rollup[K, V](it: TraversableOnce[(K, V)])(implicit r: Roller[K]): Map[K, List[V]]
27.  def rollupAggregate[T, K, U, V](it: TraversableOnce[T], agg: Aggregator[T, U, V])(fn: (T) => K)(implicit r: Roller[K]): Map[K, V]
28.  def rollupSum[K, V](it: TraversableOnce[(K, V)])(implicit r: Roller[K], sg: Semigroup[V]): Map[K, V]
29.  implicit def sparseEquiv[K, V](implicit arg0: Monoid[V], arg1: Equiv[V]): Equiv[Map[K, V]]
30.  def sumByKey[K, V](pairs: TraversableOnce[(K, V)])(implicit arg0: Semigroup[V]): Map[K, V]

    For each key, sum all the values.

    For each key, sum all the values. Note that if V is a Monoid, the current implementation will drop from the output any key where the values are all Monoid.zero. If the Semigroup is a Monoid, This function is equivalent to:

    pairs.filter(_._2 != Monoid.zero).groupBy(_._1).mapValues(_.map(_._2).sum)

    Otherwise, the function is equivalent to:

    pairs.groupBy(_._1).mapValues(_.map(_._2).sum)

31.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

32.  def toGraph[K, V](pairs: TraversableOnce[(K, V)]): Map[K, Set[V]]
33.  def toString(): String

    Definition Classes

    AnyRef → Any

34.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef

    Annotations

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

36.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()