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

trait SortedMap[K, +V] extends Map[K, V] with SortedMapOps[K, V, SortedMap, SortedMap[K, V]] with SortedMapFactoryDefaults[K, V, SortedMap, Iterable, Map]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

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

Deprecated Value Members

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

Inherited from SortedMapFactoryDefaults[K, V, SortedMap, Iterable, Map]

Inherited from SortedMapOps[K, V, SortedMap, SortedMap[K, V]]

Inherited from SortedOps[K, SortedMap[K, V]]

Inherited from Map[K, V]

Inherited from Equals

Inherited from MapFactoryDefaults[K, V, Map, Iterable]

Inherited from MapOps[K, V, Map, SortedMap[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) => V

Inherited from Iterable[(K, V)]

Inherited from IterableFactoryDefaults[(K, V), Iterable]

Inherited from IterableOps[(K, V), Iterable, SortedMap[K, V]]

Inherited from IterableOnceOps[(K, V), Iterable, SortedMap[K, V]]

Inherited from IterableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromSortedMap[K, V] to UnliftOps[K, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromSortedMap[K, V] to IterableOnceExtensionMethods[(K, V)]

Inherited by implicit conversion any2stringadd fromSortedMap[K, V] to any2stringadd[SortedMap[K, V]]

Inherited by implicit conversion StringFormat fromSortedMap[K, V] to StringFormat[SortedMap[K, V]]

Inherited by implicit conversion Ensuring fromSortedMap[K, V] to Ensuring[SortedMap[K, V]]

Inherited by implicit conversion ArrowAssoc fromSortedMap[K, V] to ArrowAssoc[SortedMap[K, V]]

Ungrouped