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

trait StrictOptimizedSortedMapOps[K, +V, +CC[X, Y] <: Map[X, Y] with SortedMapOps[X, Y, CC, _], +C <: SortedMapOps[K, V, CC, C]] extends SortedMapOps[K, V, CC, C] with StrictOptimizedMapOps[K, V, Map, C]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. StrictOptimizedSortedMapOps
2. StrictOptimizedMapOps
3. StrictOptimizedIterableOps
4. SortedMapOps
5. SortedOps
6. MapOps
7. PartialFunction
8. Function1
9. IterableOps
10. IterableOnceOps
11. IterableOnce
12. AnyRef
13. 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.  trait GenKeySortedSet extends GenKeySet
4.  class KeySortedSet extends SortedSet[K] with GenKeySet with GenKeySortedSet

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 iteratorFrom(start: K): Iterator[(K, V)]
7.  abstract def keysIteratorFrom(start: K): Iterator[K]
8.  abstract def mapFactory: MapFactory[Map]
9.  abstract def newSpecificBuilder: Builder[(K, V), C]
10.  abstract def ordering: Ordering[K]
11.  abstract def rangeImpl(from: Option[K], until: Option[K]): C
12.  abstract def sortedMapFactory: SortedMapFactory[CC]
13.  abstract def toIterable: Iterable[(K, V)]
14.  abstract def unsorted: Map[K, V]

Concrete Value Members

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

Inherited from StrictOptimizedMapOps[K, V, Map, C]

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

Inherited from SortedMapOps[K, V, CC, C]

Inherited from SortedOps[K, C]

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

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

Inherited by implicit conversion any2stringadd fromStrictOptimizedSortedMapOps[K, V, CC, C] to any2stringadd[StrictOptimizedSortedMapOps[K, V, CC, C]]

Inherited by implicit conversion StringFormat fromStrictOptimizedSortedMapOps[K, V, CC, C] to StringFormat[StrictOptimizedSortedMapOps[K, V, CC, C]]

Inherited by implicit conversion Ensuring fromStrictOptimizedSortedMapOps[K, V, CC, C] to Ensuring[StrictOptimizedSortedMapOps[K, V, CC, C]]

Inherited by implicit conversion ArrowAssoc fromStrictOptimizedSortedMapOps[K, V, CC, C] to ArrowAssoc[StrictOptimizedSortedMapOps[K, V, CC, C]]

Ungrouped