Scala Standard Library 2.13.1 - scala.collection.immutable.Map (original) (raw)

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. Map
2. MapOps
3. Map
4. Equals
5. MapFactoryDefaults
6. MapOps
7. PartialFunction
8. Function1
9. Iterable
10. Iterable
11. IterableFactoryDefaults
12. IterableOps
13. IterableOnceOps
14. IterableOnce
15. AnyRef
16. Any

Implicitly

1. by UnliftOps

2. by iterableOnceExtensionMethods

3. by any2stringadd

4. by StringFormat

5. by Ensuring

6. by ArrowAssoc

7. Hide All

8. Show All

Visibility

1. Public
2. Protected

Type Members

1.  trait GenKeySet extends AnyRef
2.  class KeySet extends AbstractSet[K] with GenKeySet with DefaultSerializable
3.  class ImmutableKeySet extends AbstractSet[K] with GenKeySet with DefaultSerializable

Abstract Value Members

1.  abstract def get(key: K): Option[V]
2.  abstract def iterator: Iterator[(K, V)]
3.  abstract def removed(key: K): Map[K, V]
4.  abstract def updated[V1 >: V](key: K, value: V1): Map[K, V1]

Concrete Value Members

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

Inherited from MapOps[K, V, Map, Map[K, V]]

Inherited from collection.Map[K, V]

Inherited from Equals

Inherited from MapFactoryDefaults[K, V, [x, y]Map[x, y], [x]Iterable[x]]

Inherited from collection.MapOps[K, V, [_, _]Map[_, _], Map[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) => V

Inherited from Iterable[(K, V)]

Inherited from collection.Iterable[(K, V)]

Inherited from IterableFactoryDefaults[(K, V), [x]Iterable[x]]

Inherited from IterableOps[(K, V), [_]Iterable[_], Map[K, V]]

Inherited from IterableOnceOps[(K, V), [_]Iterable[_], Map[K, V]]

Inherited from IterableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromMap[K, V] to UnliftOps[K, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromMap[K, V] to IterableOnceExtensionMethods[(K, V)]

Inherited by implicit conversion any2stringadd fromMap[K, V] to any2stringadd[Map[K, V]]

Inherited by implicit conversion StringFormat fromMap[K, V] to StringFormat[Map[K, V]]

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]]

Ungrouped