final
class
Multi_Map[A, +B] extends Map[A, B] with MapLike[A, B, Multi_Map[A, B]]
Type Members
-
-
-
class
FilteredKeys extends AbstractMap[A, B] with DefaultMap[A, B]
-
class
ImmutableDefaultKeySet extends scala.collection.immutable.MapLike.DefaultKeySet with Set[A]
-
class
MappedValues[C] extends AbstractMap[A, C] with DefaultMap[A, C]
-
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+[B1 >: B](p: (A, B1)): Multi_Map[A, B1]
-
def
+[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): Map[A, B1]
-
-
-
def
++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
def
++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
def
-(a: A): Multi_Map[A, B]
-
def
-(elem1: A, elem2: A, elems: A*): Multi_Map[A, B]
-
-
def
/:[B](z: B)(op: (B, (A, B)) ⇒ B): B
-
def
:\[B](z: B)(op: ((A, B), B) ⇒ B): B
-
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[C](k: (B) ⇒ C): PartialFunction[A, C]
-
def
apply(key: A): B
-
def
applyOrElse[A1 <: A, B1 >: B](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
-
-
def
compose[A](g: (A) ⇒ A): (A) ⇒ B
-
def
contains(key: A): Boolean
-
def
copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (A, B)](xs: Array[B]): Unit
-
def
copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit
-
def
count(p: ((A, B)) ⇒ Boolean): Int
-
def
default(key: A): B
-
-
def
dropRight(n: Int): Multi_Map[A, B]
-
def
dropWhile(p: ((A, B)) ⇒ Boolean): Multi_Map[A, B]
-
-
-
-
-
def
filter(p: ((A, B)) ⇒ Boolean): Multi_Map[A, B]
-
def
filterKeys(p: (A) ⇒ Boolean): Map[A, B]
-
def
filterNot(p: ((A, B)) ⇒ Boolean): Multi_Map[A, B]
-
def
finalize(): Unit
-
def
find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]
-
-
def
flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]
-
def
fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B
-
-
def
foreach[U](f: ((A, B)) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
def
get(a: A): Option[B]
-
final
def
getClass(): Class[_]
-
def
getOrElse[B1 >: B](key: A, default: ⇒ B1): B1
-
def
get_list(a: A): List[B]
-
def
groupBy[K](f: ((A, B)) ⇒ K): Map[K, Multi_Map[A, B]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: (A, B)
-
def
headOption: Option[(A, B)]
-
-
-
def
insert[B1 >: B](a: A, b: B1): Multi_Map[A, B1]
-
def
isDefinedAt(key: A): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[(A, B)]
-
def
iterator_list: Iterator[(A, List[B])]
-
def
keySet: Set[A]
-
-
def
keysIterator: Iterator[A]
-
def
last: (A, B)
-
def
lastOption: Option[(A, B)]
-
def
lift: (A) ⇒ Option[B]
-
def
map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
def
mapValues[C](f: (B) ⇒ C): Map[A, C]
-
def
max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
-
def
maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
-
def
min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
-
def
minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
par: ParMap[A, B]
-
def
parCombiner: Combiner[(A, B), ParMap[A, B]]
-
-
def
product[B >: (A, B)](implicit num: Numeric[B]): B
-
def
reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B
-
def
reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]
-
def
reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B
-
def
reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]
-
def
remove[B1 >: B](a: A, b: B1): Multi_Map[A, B1]
-
-
def
reversed: List[(A, B)]
-
def
runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean
-
def
sameElements[B >: (A, B)](that: GenIterable[B]): Boolean
-
def
scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
def
scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[Multi_Map[A, B], B, That]): That
-
def
seq: Map[A, B]
-
def
size: Int
-
def
slice(from: Int, until: Int): Multi_Map[A, B]
-
-
-
-
-
def
stringPrefix: String
-
def
sum[B >: (A, B)](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
def
takeRight(n: Int): Multi_Map[A, B]
-
def
takeWhile(p: ((A, B)) ⇒ Boolean): Multi_Map[A, B]
-
def
thisCollection: Iterable[(A, B)]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]
-
def
toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[C >: (A, B)]: Buffer[C]
-
def
toCollection(repr: Multi_Map[A, B]): Iterable[(A, B)]
-
def
toIndexedSeq: IndexedSeq[(A, B)]
-
def
toIterable: Iterable[(A, B)]
-
def
toIterator: Iterator[(A, B)]
-
def
toList: List[(A, B)]
-
def
toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]
-
def
toSeq: Seq[(A, B)]
-
def
toSet[B >: (A, B)]: Set[B]
-
def
toStream: Stream[(A, B)]
-
def
toString(): String
-
def
toTraversable: Traversable[(A, B)]
-
def
toVector: Vector[(A, B)]
-
def
transform[C, That](f: (A, B) ⇒ C)(implicit bf: CanBuildFrom[Multi_Map[A, B], (A, C), That]): That
-
-
def
unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
def
updated[B1 >: B](key: A, value: B1): Map[A, B1]
-
-
def
valuesIterator: Iterator[B]
-
def
view(from: Int, until: Int): IterableView[(A, B), Multi_Map[A, B]]
-
def
view: IterableView[(A, B), Multi_Map[A, B]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withDefault[B1 >: B](d: (A) ⇒ B1): Map[A, B1]
-
def
withDefaultValue[B1 >: B](d: B1): Map[A, B1]
-
-
def
zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Multi_Map[A, B], (A1, B), That]): That
-
def
zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Multi_Map[A, B], (A1, B), That]): That
-
def
zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[Multi_Map[A, B], (A1, Int), That]): That
Deprecated Value Members
-
def
/:\[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1
