Multimap

final class Multimap[K, L[_], V](val m: Map[K, L[V]])(implicit L: MultiValues[L])
Companion:
object
class Object
trait Matchable
class Any

Value members

Concrete methods

def ++(n: Map[K, L[V]]): Multimap[K, L, V]
def add(k: K, v: V): Multimap[K, L, V]
def addPair(kv: (K, V)): Multimap[K, L, V]
def addPairs(kvs: (K, V)*): Multimap[K, L, V]
def addks(ks: L[K], v: V): Multimap[K, L, V]
def addvs(k: K, vs: L[V]): Multimap[K, L, V]
def apply(k: K): L[V]
def del(k: K, v: V): Multimap[K, L, V]
def delk(k: K): Multimap[K, L, V]
def delks(ks: L[K]): Multimap[K, L, V]
def delkv(x: K)(implicit ev: K =:= V): Multimap[K, L, V]

Removes x entirely. Same as delk(x).delv(x)

Removes x entirely. Same as delk(x).delv(x)

def delv(v: V): Multimap[K, L, V]
def delvs(vs: L[V]): Multimap[K, L, V]
override def equals(o: Any): Boolean
Definition Classes
Any
override def hashCode: Int
Definition Classes
Any
@inline
def isEmpty: Boolean
@inline
def iterator: Iterator[(K, L[V])]
@inline
def keyCount: Int
@inline
def keyIterator: Iterator[K]
@inline
def keySet: Set[K]
@inline
def keys: Iterable[K]
def kvIterator: Iterator[(K, V)]
def mod(k: K, f: L[V] => L[V]): Multimap[K, L, V]
@inline
def nonEmpty: Boolean
def reverse(implicit ev: Commutative[L]): Multimap[V, L, K]
def reverseM[M[_] : MultiValues](implicit evidence$5: MultiValues[M], ev: Commutative[M]): Multimap[V, M, K]
def setks(ks: L[K], v: V): Multimap[K, L, V]
def setvs(k: K, vs: L[V]): Multimap[K, L, V]
override def toString: String
Definition Classes
Any
def valueCount: Int
def valueIterator: Iterator[V]
@inline
def values: Iterable[L[V]]
@inline
def valuesIterator: Iterator[L[V]]

Concrete fields

val m: Map[K, L[V]]