object
MapAlgebra
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
dot[K, V](left: Map[K, V], right: Map[K, V])(implicit mring: Ring[Map[K, V]], mon: Monoid[V]): V
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
invert[K, V](m: Map[K, V]): Map[V, Set[K]]
-
def
invertExact[K, V](m: Map[Option[K], Set[V]]): Map[Option[V], Set[K]]
-
final
def
isInstanceOf[T0]: Boolean
-
def
join[K, V, W](map1: Map[K, V], map2: Map[K, W]): Map[K, (Option[V], Option[W])]
-
def
mergeLookup[T, U, V](keys: TraversableOnce[T])(lookup: (T) ⇒ Option[V])(present: (T) ⇒ U)(implicit arg0: Monoid[V]): Map[U, V]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
removeZeros[K, V](m: Map[K, V])(implicit arg0: Monoid[V]): Map[K, V]
-
def
rightContainsLeft[K, V](l: Map[K, V], r: Map[K, V])(implicit arg0: Equiv[V]): Boolean
-
implicit
def
sparseEquiv[K, V](implicit arg0: Monoid[V], arg1: Equiv[V]): Equiv[Map[K, V]]
-
def
sumByKey[K, V](pairs: TraversableOnce[(K, V)])(implicit arg0: Semigroup[V]): Map[K, V]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toGraph[K, V](pairs: TraversableOnce[(K, V)]): Map[K, Set[V]]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any