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

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

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

Inherited from StrictOptimizedIterableOps[(K, V), Iterable, C]

Inherited from 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 fromStrictOptimizedMapOps[K, V, CC, C] to UnliftOps[K, B]

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

Inherited by implicit conversion any2stringadd fromStrictOptimizedMapOps[K, V, CC, C] to any2stringadd[StrictOptimizedMapOps[K, V, CC, C]]

Inherited by implicit conversion StringFormat fromStrictOptimizedMapOps[K, V, CC, C] to StringFormat[StrictOptimizedMapOps[K, V, CC, C]]

Inherited by implicit conversion Ensuring fromStrictOptimizedMapOps[K, V, CC, C] to Ensuring[StrictOptimizedMapOps[K, V, CC, C]]

Inherited by implicit conversion ArrowAssoc fromStrictOptimizedMapOps[K, V, CC, C] to ArrowAssoc[StrictOptimizedMapOps[K, V, CC, C]]

Ungrouped