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

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. SortedMapOps
2. SortedOps
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

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): (SortedMapOps[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](suffix: 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: (SortedMapOps[K, V, CC, C]) => Boolean, msg: => Any): SortedMapOps[K, V, CC, C]
37.  def ensuring(cond: (SortedMapOps[K, V, CC, C]) => Boolean): SortedMapOps[K, V, CC, C]
38.  def ensuring(cond: Boolean, msg: => Any): SortedMapOps[K, V, CC, C]
39.  def ensuring(cond: Boolean): SortedMapOps[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 filterNot(pred: ((K, V)) => Boolean): C
45.  def finalize(): Unit
46.  def find(p: ((K, V)) => Boolean): Option[(K, V)]
47.  def firstKey: K
48.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
49.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): Map[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): immutable.Map[K, C]
62.  def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): immutable.Map[K, Iterable[B]]
63.  def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): immutable.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: SortedSet[K]
75.  def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S
76.  def keys: Iterable[K]
77.  def keysIterator: Iterator[K]
78.  def knownSize: Int
79.  def last: (K, V)
80.  def lastKey: K
81.  def lastOption: Option[(K, V)]
82.  def lift: (K) => Option[V]
83.  def map[K2, V2](f: ((K, V)) => (K2, V2))(implicit ordering: Ordering[K2]): CC[K2, V2]
84.  def map[K2, V2](f: ((K, V)) => (K2, V2)): Map[K2, V2]
85.  def map[B](f: ((K, V)) => B): Iterable[B]
86.  final def mapFromIterable[K2, V2](it: Iterable[(K2, V2)]): Map[K2, V2]
87.  def max[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)
88.  def maxBefore(key: K): Option[(K, V)]
89.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
90.  def maxByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]
91.  def maxOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]
92.  def min[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)
93.  def minAfter(key: K): Option[(K, V)]
94.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
95.  def minByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]
96.  def minOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]
97.  final def mkString: String
98.  final def mkString(sep: String): String
99.  final def mkString(start: String, sep: String, end: String): String
100.  final def ne(arg0: AnyRef): Boolean
101.  def nonEmpty: Boolean
102.  final def notify(): Unit
103.  final def notifyAll(): Unit
104.  def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
105.  def partition(p: ((K, V)) => Boolean): (C, C)
106.  def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
107.  def product[B >: (K, V)](implicit num: math.Numeric[B]): B
108.  def range(from: K, until: K): C
109.  def rangeFrom(from: K): C
110.  def rangeTo(to: K): C
111.  def rangeUntil(until: K): C
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 reversed: Iterable[(K, V)]
119.  def runWith[U](action: (V) => U): (K) => Boolean
120.  def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]
121.  def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]
122.  def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]
123.  def size: Int
124.  def sizeCompare(that: Iterable[_]): Int
125.  def sizeCompare(otherSize: Int): Int
126.  final def sizeIs: SizeCompareOps
127.  def slice(from: Int, until: Int): C
128.  def sliding(size: Int, step: Int): Iterator[C]
129.  def sliding(size: Int): Iterator[C]
130.  final def sortedMapFromIterable[K2, V2](it: Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
131.  def span(p: ((K, V)) => Boolean): (C, C)
132.  def splitAt(n: Int): (C, C)
133.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S
134.  def sum[B >: (K, V)](implicit num: math.Numeric[B]): B
135.  final def synchronized[T0](arg0: => T0): T0
136.  def tail: C
137.  def tails: Iterator[C]
138.  def take(n: Int): C
139.  def takeRight(n: Int): C
140.  def takeWhile(p: ((K, V)) => Boolean): C
141.  def tapEach[U](f: ((K, V)) => U): C
142.  def to[C1](factory: Factory[(K, V), C1]): C1
143.  def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
144.  final def toBuffer[B >: (K, V)]: Buffer[B]
145.  def toIndexedSeq: immutable.IndexedSeq[(K, V)]
146.  def toList: immutable.List[(K, V)]
147.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
148.  def toSeq: immutable.Seq[(K, V)]
149.  def toSet[B >: (K, V)]: immutable.Set[B]
150.  def toString(): String
151.  def toVector: immutable.Vector[(K, V)]
152.  def transpose[B](implicit asIterable: ((K, V)) => Iterable[B]): Iterable[Iterable[B]]
153.  def unapply(a: K): Option[V]
154.  def unlift: PartialFunction[K, B]
155.  def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])
156.  def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
157.  def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S
158.  def values: Iterable[V]
159.  def valuesIterator: Iterator[V]
160.  def valuesIteratorFrom(start: K): Iterator[V]
161.  def view: MapView[K, V]
162.  final def wait(): Unit
163.  final def wait(arg0: Long, arg1: Int): Unit
164.  final def wait(arg0: Long): Unit
165.  def withFilter(p: ((K, V)) => Boolean): WithFilter[(K, V), Iterable]
166.  def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]
167.  def zipAll[A1 >: (K, V), B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
168.  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): (SortedMapOps[K, V, CC, C], B)

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

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

Inherited by implicit conversion any2stringadd fromSortedMapOps[K, V, CC, C] to any2stringadd[SortedMapOps[K, V, CC, C]]

Inherited by implicit conversion StringFormat fromSortedMapOps[K, V, CC, C] to StringFormat[SortedMapOps[K, V, CC, C]]

Inherited by implicit conversion Ensuring fromSortedMapOps[K, V, CC, C] to Ensuring[SortedMapOps[K, V, CC, C]]

Inherited by implicit conversion ArrowAssoc fromSortedMapOps[K, V, CC, C] to ArrowAssoc[SortedMapOps[K, V, CC, C]]

Ungrouped