A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/MultiMap.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.MultiMap

trait MultiMap[K, V] extends Map[K, Set[V]]



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MultiMap
  2. Map
  3. MapOps
  4. Shrinkable
  5. Builder
  6. Growable
  7. Clearable
  8. Cloneable
  9. Cloneable
  10. Map
  11. Equals
  12. MapFactoryDefaults
  13. MapOps
  14. PartialFunction
  15. Function1
  16. Iterable
  17. Iterable
  18. IterableFactoryDefaults
  19. IterableOps
  20. IterableOnceOps
  21. IterableOnce
  22. AnyRef
  23. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  def ++[V2 >: Set[V]](xs: IterableOnce[(K, V2)]): Map[K, V2]
  4.  final def ++[B >: (K, Set[V])](suffix: IterableOnce[B]): Iterable[B]
  5.  final def ++=(xs: IterableOnce[(K, Set[V])]): MultiMap.this.type
  6.  final def +=(elem: (K, Set[V])): MultiMap.this.type
  7.  final def --=(xs: IterableOnce[K]): MultiMap.this.type
  8.  final def -=(elem: K): MultiMap.this.type
  9.  def ->[B](y: B): (MultiMap[K, V], B)
  10.  final def ==(arg0: Any): Boolean
  11.  def addAll(xs: IterableOnce[(K, Set[V])]): MultiMap.this.type
  12.  def addBinding(key: K, value: V): MultiMap.this.type
  13.  def addString(sb: StringBuilder, start: String, sep: String, end: String): sb.type
  14.  final def addString(b: StringBuilder): b.type
  15.  final def addString(b: StringBuilder, sep: String): b.type
  16.  def andThen[C](k: PartialFunction[Set[V], C]): PartialFunction[K, C]
  17.  def andThen[C](k: (Set[V]) => C): PartialFunction[K, C]
  18.  def apply(key: K): Set[V]
  19.  def applyOrElse[K1 <: K, V1 >: Set[V]](x: K1, default: (K1) => V1): V1
  20.  final def asInstanceOf[T0]: T0
  21.  def canEqual(that: Any): Boolean
  22.  def className: String
  23.  def clear(): Unit
  24.  def clone(): Map[K, Set[V]]
  25.  final def coll: MultiMap.this.type
  26.  def collect[K2, V2](pf: PartialFunction[(K, Set[V]), (K2, V2)]): Map[K2, V2]
  27.  def collect[B](pf: PartialFunction[(K, Set[V]), B]): Iterable[B]
  28.  def collectFirst[B](pf: PartialFunction[(K, Set[V]), B]): Option[B]
  29.  def compose[R](k: PartialFunction[R, K]): PartialFunction[R, Set[V]]
  30.  def compose[A](g: (A) => K): (A) => Set[V]
  31.  def concat[V2 >: Set[V]](suffix: IterableOnce[(K, V2)]): Map[K, V2]
  32.  def concat[B >: (K, Set[V])](suffix: IterableOnce[B]): Iterable[B]
  33.  def contains(key: K): Boolean
  34.  def copyToArray[B >: (K, Set[V])](xs: Array[B], start: Int, len: Int): Int
  35.  def copyToArray[B >: (K, Set[V])](xs: Array[B], start: Int): Int
  36.  def copyToArray[B >: (K, Set[V])](xs: Array[B]): Int
  37.  def corresponds[B](that: IterableOnce[B])(p: ((K, Set[V]), B) => Boolean): Boolean
  38.  def count(p: ((K, Set[V])) => Boolean): Int
  39.  def default(key: K): Set[V]
  40.  def drop(n: Int): Map[K, Set[V]]
  41.  def dropRight(n: Int): Map[K, Set[V]]
  42.  def dropWhile(p: ((K, Set[V])) => Boolean): Map[K, Set[V]]
  43.  def elementWise: ElementWiseExtractor[K, Set[V]]
  44.  def empty: Map[K, Set[V]]
  45.  def ensuring(cond: (MultiMap[K, V]) => Boolean, msg: => Any): MultiMap[K, V]
  46.  def ensuring(cond: (MultiMap[K, V]) => Boolean): MultiMap[K, V]
  47.  def ensuring(cond: Boolean, msg: => Any): MultiMap[K, V]
  48.  def ensuring(cond: Boolean): MultiMap[K, V]
  49.  def entryExists(key: K, p: (V) => Boolean): Boolean
  50.  final def eq(arg0: AnyRef): Boolean
  51.  def equals(o: Any): Boolean
  52.  def exists(p: ((K, Set[V])) => Boolean): Boolean
  53.  def filter(pred: ((K, Set[V])) => Boolean): Map[K, Set[V]]
  54.  def filterInPlace(p: (K, Set[V]) => Boolean): MultiMap.this.type
  55.  def filterNot(pred: ((K, Set[V])) => Boolean): Map[K, Set[V]]
  56.  def finalize(): Unit
  57.  def find(p: ((K, Set[V])) => Boolean): Option[(K, Set[V])]
  58.  def flatMap[K2, V2](f: ((K, Set[V])) => IterableOnce[(K2, V2)]): Map[K2, V2]
  59.  def flatMap[B](f: ((K, Set[V])) => IterableOnce[B]): Iterable[B]
  60.  def flatten[B](implicit asIterable: ((K, Set[V])) => IterableOnce[B]): Iterable[B]
  61.  def fold[A1 >: (K, Set[V])](z: A1)(op: (A1, A1) => A1): A1
  62.  def foldLeft[B](z: B)(op: (B, (K, Set[V])) => B): B
  63.  def foldRight[B](z: B)(op: ((K, Set[V]), B) => B): B
  64.  def forall(p: ((K, Set[V])) => Boolean): Boolean
  65.  def foreach[U](f: ((K, Set[V])) => U): Unit
  66.  def foreachEntry[U](f: (K, Set[V]) => U): Unit
  67.  def fromSpecific(coll: IterableOnce[(K, Set[V])]): Map[K, Set[V]]
  68.  final def getClass(): Class[_ <: AnyRef]
  69.  def getOrElse[V1 >: Set[V]](key: K, default: => V1): V1
  70.  def getOrElseUpdate(key: K, op: => Set[V]): Set[V]
  71.  def groupBy[K](f: ((K, Set[V])) => K): immutable.Map[K, Map[K, Set[V]]]
  72.  def groupMap[K, B](key: ((K, Set[V])) => K)(f: ((K, Set[V])) => B): immutable.Map[K, Iterable[B]]
  73.  def groupMapReduce[K, B](key: ((K, Set[V])) => K)(f: ((K, Set[V])) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  74.  def grouped(size: Int): Iterator[Map[K, Set[V]]]
  75.  def hashCode(): Int
  76.  def head: (K, Set[V])
  77.  def headOption: Option[(K, Set[V])]
  78.  def init: Map[K, Set[V]]
  79.  def inits: Iterator[Map[K, Set[V]]]
  80.  def isDefinedAt(key: K): Boolean
  81.  def isEmpty: Boolean
  82.  final def isInstanceOf[T0]: Boolean
  83.  def isTraversableAgain: Boolean
  84.  def iterableFactory: IterableFactory[Iterable]
  85.  def keySet: collection.Set[K]
  86.  def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S
  87.  def keys: collection.Iterable[K]
  88.  def keysIterator: Iterator[K]
  89.  def knownSize: Int
  90.  def last: (K, Set[V])
  91.  def lastOption: Option[(K, Set[V])]
  92.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, Set[V]), B, MultiMap.this.type]
  93.  def lift: (K) => Option[Set[V]]
  94.  def makeSet: Set[V]
  95.  def map[K2, V2](f: ((K, Set[V])) => (K2, V2)): Map[K2, V2]
  96.  def map[B](f: ((K, Set[V])) => B): Iterable[B]
  97.  def mapFactory: MapFactory[Map]
  98.  final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): Map[K2, V2]
  99.  def mapResult[NewTo](f: (Map[K, Set[V]]) => NewTo): Builder[(K, Set[V]), NewTo]
  100.  def mapValuesInPlace(f: (K, Set[V]) => Set[V]): MultiMap.this.type
  101.  def max[B >: (K, Set[V])](implicit ord: math.Ordering[B]): (K, Set[V])
  102.  def maxBy[B](f: ((K, Set[V])) => B)(implicit cmp: math.Ordering[B]): (K, Set[V])
  103.  def maxByOption[B](f: ((K, Set[V])) => B)(implicit cmp: math.Ordering[B]): Option[(K, Set[V])]
  104.  def maxOption[B >: (K, Set[V])](implicit ord: math.Ordering[B]): Option[(K, Set[V])]
  105.  def min[B >: (K, Set[V])](implicit ord: math.Ordering[B]): (K, Set[V])
  106.  def minBy[B](f: ((K, Set[V])) => B)(implicit cmp: math.Ordering[B]): (K, Set[V])
  107.  def minByOption[B](f: ((K, Set[V])) => B)(implicit cmp: math.Ordering[B]): Option[(K, Set[V])]
  108.  def minOption[B >: (K, Set[V])](implicit ord: math.Ordering[B]): Option[(K, Set[V])]
  109.  final def mkString: String
  110.  final def mkString(sep: String): String
  111.  final def mkString(start: String, sep: String, end: String): String
  112.  final def ne(arg0: AnyRef): Boolean
  113.  def newSpecificBuilder: Builder[(K, Set[V]), Map[K, Set[V]]]
  114.  def nonEmpty: Boolean
  115.  final def notify(): Unit
  116.  final def notifyAll(): Unit
  117.  def orElse[A1 <: K, B1 >: Set[V]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  118.  def partition(p: ((K, Set[V])) => Boolean): (Map[K, Set[V]], Map[K, Set[V]])
  119.  def partitionMap[A1, A2](f: ((K, Set[V])) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
  120.  def product[B >: (K, Set[V])](implicit num: math.Numeric[B]): B
  121.  def put(key: K, value: Set[V]): Option[Set[V]]
  122.  def reduce[B >: (K, Set[V])](op: (B, B) => B): B
  123.  def reduceLeft[B >: (K, Set[V])](op: (B, (K, Set[V])) => B): B
  124.  def reduceLeftOption[B >: (K, Set[V])](op: (B, (K, Set[V])) => B): Option[B]
  125.  def reduceOption[B >: (K, Set[V])](op: (B, B) => B): Option[B]
  126.  def reduceRight[B >: (K, Set[V])](op: ((K, Set[V]), B) => B): B
  127.  def reduceRightOption[B >: (K, Set[V])](op: ((K, Set[V]), B) => B): Option[B]
  128.  def remove(key: K): Option[Set[V]]
  129.  def removeBinding(key: K, value: V): MultiMap.this.type
  130.  def result(): Map[K, Set[V]]
  131.  def reversed: collection.Iterable[(K, Set[V])]
  132.  def runWith[U](action: (Set[V]) => U): (K) => Boolean
  133.  def scan[B >: (K, Set[V])](z: B)(op: (B, B) => B): Iterable[B]
  134.  def scanLeft[B](z: B)(op: (B, (K, Set[V])) => B): Iterable[B]
  135.  def scanRight[B](z: B)(op: ((K, Set[V]), B) => B): Iterable[B]
  136.  def size: Int
  137.  def sizeCompare(that: collection.Iterable[_]): Int
  138.  def sizeCompare(otherSize: Int): Int
  139.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  140.  def sizeHint(size: Int): Unit
  141.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  142.  final def sizeIs: SizeCompareOps
  143.  def slice(from: Int, until: Int): Map[K, Set[V]]
  144.  def sliding(size: Int, step: Int): Iterator[Map[K, Set[V]]]
  145.  def sliding(size: Int): Iterator[Map[K, Set[V]]]
  146.  def span(p: ((K, Set[V])) => Boolean): (Map[K, Set[V]], Map[K, Set[V]])
  147.  def splitAt(n: Int): (Map[K, Set[V]], Map[K, Set[V]])
  148.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, Set[V]), S]): S
  149.  def stringPrefix: String
  150.  def subtractAll(xs: IterableOnce[K]): MultiMap.this.type
  151.  def sum[B >: (K, Set[V])](implicit num: math.Numeric[B]): B
  152.  final def synchronized[T0](arg0: => T0): T0
  153.  def tail: Map[K, Set[V]]
  154.  def tails: Iterator[Map[K, Set[V]]]
  155.  def take(n: Int): Map[K, Set[V]]
  156.  def takeRight(n: Int): Map[K, Set[V]]
  157.  def takeWhile(p: ((K, Set[V])) => Boolean): Map[K, Set[V]]
  158.  def tapEach[U](f: ((K, Set[V])) => U): Map[K, Set[V]]
  159.  def to[C1](factory: Factory[(K, Set[V]), C1]): C1
  160.  def toArray[B >: (K, Set[V])](implicit arg0: ClassTag[B]): Array[B]
  161.  final def toBuffer[B >: (K, Set[V])]: Buffer[B]
  162.  def toIndexedSeq: immutable.IndexedSeq[(K, Set[V])]
  163.  def toList: immutable.List[(K, Set[V])]
  164.  def toMap[K, V](implicit ev: <:<[(K, Set[V]), (K, V)]): immutable.Map[K, V]
  165.  def toSeq: immutable.Seq[(K, Set[V])]
  166.  def toSet[B >: (K, Set[V])]: immutable.Set[B]
  167.  def toString(): String
  168.  def toVector: immutable.Vector[(K, Set[V])]
  169.  def transpose[B](implicit asIterable: ((K, Set[V])) => collection.Iterable[B]): Iterable[Iterable[B]]
  170.  def unapply(a: K): Option[Set[V]]
  171.  def unzip[A1, A2](implicit asPair: ((K, Set[V])) => (A1, A2)): (Iterable[A1], Iterable[A2])
  172.  def unzip3[A1, A2, A3](implicit asTriple: ((K, Set[V])) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
  173.  def update(key: K, value: Set[V]): Unit
  174.  def updateWith(key: K)(remappingFunction: (Option[Set[V]]) => Option[Set[V]]): Option[Set[V]]
  175.  def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[Set[V], S]): S
  176.  def values: collection.Iterable[Set[V]]
  177.  def valuesIterator: Iterator[Set[V]]
  178.  def view: MapView[K, Set[V]]
  179.  final def wait(): Unit
  180.  final def wait(arg0: Long, arg1: Int): Unit
  181.  final def wait(arg0: Long): Unit
  182.  def withDefault(d: (K) => Set[V]): Map[K, Set[V]]
  183.  def withDefaultValue(d: Set[V]): Map[K, Set[V]]
  184.  def withFilter(p: ((K, Set[V])) => Boolean): MapOps.WithFilter[K, Set[V], [x]Iterable[x], [x, y]Map[x, y]]
  185.  def zip[B](that: IterableOnce[B]): Iterable[((K, Set[V]), B)]
  186.  def zipAll[A1 >: (K, Set[V]), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
  187.  def zipWithIndex: Iterable[((K, Set[V]), Int)]
Deprecated Value Members
  1.  def +[V1 >: Set[V]](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): Map[K, V1]
  2.  def +[V1 >: Set[V]](kv: (K, V1)): Map[K, V1]
  3.  def ++:[V1 >: Set[V]](that: IterableOnce[(K, V1)]): Map[K, V1]
  4.  def ++:[B >: (K, Set[V])](that: IterableOnce[B]): Iterable[B]
  5.  final def +=(elem1: (K, Set[V]), elem2: (K, Set[V]), elems: (K, Set[V])*): MultiMap.this.type
  6.  final def -(key1: K, key2: K, keys: K*): Map[K, Set[V]]
  7.  final def -(key: K): Map[K, Set[V]]
  8.  def --(keys: IterableOnce[K]): Map[K, Set[V]]
  9.  def -=(elem1: K, elem2: K, elems: K*): MultiMap.this.type
  10.  def /:[B](z: B)(op: (B, (K, Set[V])) => B): B
  11.  final def /:[B](z: B)(op: (B, (K, Set[V])) => B): B
  12.  def :\[B](z: B)(op: ((K, Set[V]), B) => B): B
  13.  final def :\[B](z: B)(op: ((K, Set[V]), B) => B): B
  14.  def aggregate[B](z: => B)(seqop: (B, (K, Set[V])) => B, combop: (B, B) => B): B
  15.  def collectFirst[B](f: PartialFunction[(K, Set[V]), B]): Option[B]
  16.  def companion: IterableFactory[[_]Iterable[_]]
  17.  def copyToBuffer(dest: Buffer[(K, Set[V])]): Unit
  18.  final def copyToBuffer[B >: (K, Set[V])](dest: Buffer[B]): Unit
  19.  def count(f: ((K, Set[V])) => Boolean): Int
  20.  def exists(f: ((K, Set[V])) => Boolean): Boolean
  21.  def filter(f: ((K, Set[V])) => Boolean): Iterator[(K, Set[V])]
  22.  def filterKeys(p: (K) => Boolean): MapView[K, Set[V]]
  23.  def find(p: ((K, Set[V])) => Boolean): Option[(K, Set[V])]
  24.  def flatMap[B](f: ((K, Set[V])) => IterableOnce[B]): IterableOnce[B]
  25.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  26.  def foldLeft[B](z: B)(op: (B, (K, Set[V])) => B): B
  27.  def foldRight[B](z: B)(op: ((K, Set[V]), B) => B): B
  28.  def forall(f: ((K, Set[V])) => Boolean): Boolean
  29.  def foreach[U](f: ((K, Set[V])) => U): Unit
  30.  def formatted(fmtstr: String): String
  31.  def hasDefiniteSize: Boolean
  32.  def isEmpty: Boolean
  33.  def map[B](f: ((K, Set[V])) => B): IterableOnce[B]
  34.  def mapValues[W](f: (Set[V]) => W): MapView[K, W]
  35.  def max(implicit ord: math.Ordering[(K, Set[V])]): (K, Set[V])
  36.  def maxBy[B](f: ((K, Set[V])) => B)(implicit cmp: math.Ordering[B]): (K, Set[V])
  37.  def min(implicit ord: math.Ordering[(K, Set[V])]): (K, Set[V])
  38.  def minBy[B](f: ((K, Set[V])) => B)(implicit cmp: math.Ordering[B]): (K, Set[V])
  39.  def mkString: String
  40.  def mkString(sep: String): String
  41.  def mkString(start: String, sep: String, end: String): String
  42.  def nonEmpty: Boolean
  43.  def product(implicit num: math.Numeric[(K, Set[V])]): (K, Set[V])
  44.  def reduce(f: ((K, Set[V]), (K, Set[V])) => (K, Set[V])): (K, Set[V])
  45.  def reduceLeft(f: ((K, Set[V]), (K, Set[V])) => (K, Set[V])): (K, Set[V])
  46.  def reduceLeftOption(f: ((K, Set[V]), (K, Set[V])) => (K, Set[V])): Option[(K, Set[V])]
  47.  def reduceOption(f: ((K, Set[V]), (K, Set[V])) => (K, Set[V])): Option[(K, Set[V])]
  48.  def reduceRight(f: ((K, Set[V]), (K, Set[V])) => (K, Set[V])): (K, Set[V])
  49.  def reduceRightOption(f: ((K, Set[V]), (K, Set[V])) => (K, Set[V])): Option[(K, Set[V])]
  50.  final def repr: Map[K, Set[V]]
  51.  final def retain(p: (K, Set[V]) => Boolean): MultiMap.this.type
  52.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  53.  def seq: MultiMap.this.type
  54.  def size: Int
  55.  def sum(implicit num: math.Numeric[(K, Set[V])]): (K, Set[V])
  56.  def to[C1](factory: Factory[(K, Set[V]), C1]): C1
  57.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  58.  def toBuffer[B >: A]: Buffer[B]
  59.  def toIndexedSeq: collection.IndexedSeq[(K, Set[V])]
  60.  final def toIterable: collection.Iterable[(K, Set[V])]
  61.  final def toIterable: MultiMap.this.type
  62.  def toIterator: Iterator[(K, Set[V])]
  63.  final def toIterator: Iterator[(K, Set[V])]
  64.  def toList: immutable.List[(K, Set[V])]
  65.  def toMap[K, V](implicit ev: <:<[(K, Set[V]), (K, V)]): immutable.Map[K, V]
  66.  def toSeq: immutable.Seq[(K, Set[V])]
  67.  def toSet[B >: A]: immutable.Set[B]
  68.  def toStream: immutable.Stream[(K, Set[V])]
  69.  final def toStream: immutable.Stream[(K, Set[V])]
  70.  final def toTraversable: collection.Traversable[(K, Set[V])]
  71.  final def toTraversable: collection.Traversable[(K, Set[V])]
  72.  def toVector: immutable.Vector[(K, Set[V])]
  73.  final def transform(f: (K, Set[V]) => Set[V]): MultiMap.this.type
  74.  def updated[V1 >: Set[V]](key: K, value: V1): Map[K, V1]
  75.  def view(from: Int, until: Int): View[(K, Set[V])]
  76.  def withFilter(f: ((K, Set[V])) => Boolean): Iterator[(K, Set[V])]
  77.  def →[B](y: B): (MultiMap[K, V], B)
Inherited from (K) => Set[V]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4