A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/SortedMap.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.SortedMap

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

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4