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/immutable/TreeMap.html below:

Scala Standard Library 2.13.10 - scala.collection.immutable.TreeMap

final class TreeMap[K, +V] extends AbstractMap[K, V] with SortedMap[K, V] with StrictOptimizedSortedMapOps[K, V, TreeMap, TreeMap[K, V]] with SortedMapFactoryDefaults[K, V, TreeMap, Iterable, Map] with DefaultSerializable



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