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

trait MapOps[K, +V, +CC[X, +Y] <: MapOps[X, Y, CC, _], +C <: MapOps[K, V, CC, C]] extends IterableOps[(K, V), Iterable, C] with collection.MapOps[K, V, CC, C]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. MapOps
2. MapOps
3. PartialFunction
4. Function1
5. IterableOps
6. IterableOnceOps
7. IterableOnce
8. AnyRef
9. 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 coll: C with CC[K, V]
2.  abstract def fromSpecific(coll: IterableOnce[(K, V)]): C
3.  abstract def get(key: K): Option[V]
4.  abstract def iterableFactory: IterableFactory[[_]Iterable[_]]
5.  abstract def iterator: Iterator[(K, V)]
6.  abstract def mapFactory: MapFactory[CC]
7.  abstract def newSpecificBuilder: Builder[(K, V), C]
8.  abstract def removed(key: K): C
9.  abstract def toIterable: collection.Iterable[(K, V)]
10.  abstract def updated[V1 >: V](key: K, value: V1): CC[K, V1]

Concrete Value Members

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

Deprecated Value Members

1.  def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): CC[K, V1]
2.  def ++:[V1 >: V](that: IterableOnce[(K, V1)]): CC[K, V1]
3.  def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
4.  def -(key1: K, key2: K, keys: K*): C
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: C
45.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
46.  def size: Int
47.  def sum(implicit num: math.Numeric[(K, V)]): (K, V)
48.  def to[C1](factory: Factory[(K, V), C1]): C1
49.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
50.  def toBuffer[B >: A]: Buffer[B]
51.  def toIndexedSeq: collection.IndexedSeq[(K, V)]
52.  final def toIterable: collection.Iterable[(K, V)]
53.  def toIterator: Iterator[(K, V)]
54.  final def toIterator: Iterator[(K, V)]
55.  def toList: List[(K, V)]
56.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): Map[K, V]
57.  def toSeq: Seq[(K, V)]
58.  def toSet[B >: A]: Set[B]
59.  def toStream: Stream[(K, V)]
60.  final def toStream: Stream[(K, V)]
61.  final def toTraversable: collection.Traversable[(K, V)]
62.  final def toTraversable: collection.Traversable[(K, V)]
63.  def toVector: Vector[(K, V)]
64.  def view(from: Int, until: Int): View[(K, V)]
65.  def withFilter(f: ((K, V)) => Boolean): Iterator[(K, V)]
66.  def →[B](y: B): (MapOps[K, V, CC, C], B)

Inherited from collection.MapOps[K, V, CC, C]

Inherited from PartialFunction[K, V]

Inherited from (K) => V

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

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

Inherited from IterableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromMapOps[K, V, CC, C] to UnliftOps[K, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromMapOps[K, V, CC, C] to IterableOnceExtensionMethods[(K, V)]

Inherited by implicit conversion any2stringadd fromMapOps[K, V, CC, C] to any2stringadd[MapOps[K, V, CC, C]]

Inherited by implicit conversion StringFormat fromMapOps[K, V, CC, C] to StringFormat[MapOps[K, V, CC, C]]

Inherited by implicit conversion Ensuring fromMapOps[K, V, CC, C] to Ensuring[MapOps[K, V, CC, C]]

Inherited by implicit conversion ArrowAssoc fromMapOps[K, V, CC, C] to ArrowAssoc[MapOps[K, V, CC, C]]

Ungrouped