MapAlgebra

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def dot[K, V](left: Map[K, V], right: Map[K, V])(implicit mring: Ring[Map[K, V]], mon: Monoid[V]): V

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

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    Definition Classes

    AnyRef → Any

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

    Invert the Common case of exactly one value for each key

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

16. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

17. 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)

18. def mergeLookup[T, U, V](keys: TraversableOnce[T])(lookup: (T) ⇒ Option[V])(present: (T) ⇒ U)(implicit arg0: Monoid[V]): Map[U, V]

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

    Definition Classes

    AnyRef

20. final def notify(): Unit

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    Definition Classes

    AnyRef

22. def removeZeros[K, V](m: Map[K, V])(implicit arg0: Monoid[V]): Map[K, V]

23. def rightContainsLeft[K, V](l: Map[K, V], r: Map[K, V])(implicit arg0: Equiv[V]): Boolean

24. implicit def sparseEquiv[K, V](implicit arg0: Monoid[V], arg1: Equiv[V]): Equiv[Map[K, V]]

25. def sumByKey[K, V](pairs: TraversableOnce[(K, V)])(implicit arg0: Semigroup[V]): Map[K, V]

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

    Definition Classes

    AnyRef

27. def toGraph[K, V](pairs: TraversableOnce[(K, V)]): Map[K, Set[V]]

28. def toString(): String

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )