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

trait MapOps[K, +V, +CC[_, _] <: IterableOps[_, AnyConstr, _], +C] extends IterableOps[(K, V), Iterable, C] with PartialFunction[K, V]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. MapOps
2. PartialFunction
3. Function1
4. IterableOps
5. IterableOnceOps
6. IterableOnce
7. AnyRef
8. 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

Abstract Value Members

1.  abstract def coll: C
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 toIterable: Iterable[(K, V)]

Concrete Value Members

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

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