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.4/scala/collection/mutable/Map.html below:

Scala Standard Library 2.13.4 - scala.collection.mutable.Map

trait Map[K, V] extends Iterable[(K, V)] with collection.Map[K, V] with MapOps[K, V, Map, Map[K, V]] with Growable[(K, V)] with Shrinkable[K] with MapFactoryDefaults[K, V, Map, Iterable]



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

Inherited from (K) => V

Inherited by implicit conversion UnliftOps fromMap[K, V] to UnliftOps[K, B] Inherited by implicit conversion Ensuring fromMap[K, V] to Ensuring[Map[K, V]] Inherited by implicit conversion ArrowAssoc fromMap[K, V] to ArrowAssoc[Map[K, 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