Scala Standard Library2.13.9 < Back


# Packages

-  package root

  This is the documentation for the Scala standard library.

  This is the documentation for the Scala standard library.

  #### Package structure

  The scala package contains core types like `Int`, `Float`, `Array` or `Option` which are accessible in all Scala compilation units without explicit qualification or imports.

  Notable packages include:

  - `scala.collection` and its sub-packages contain Scala's collections framework
    - `scala.collection.immutable` - Immutable, sequential data-structures such as `Vector`, `List`, `Range`, `HashMap` or `HashSet`
    - `scala.collection.mutable` - Mutable, sequential data-structures such as `ArrayBuffer`, `StringBuilder`, `HashMap` or `HashSet`
    - `scala.collection.concurrent` - Mutable, concurrent data-structures such as `TrieMap`
  - `scala.concurrent` - Primitives for concurrent programming such as `Futures` and `Promises`
  - `scala.io` - Input and output operations
  - `scala.math` - Basic math functions and additional numeric types like `BigInt` and `BigDecimal`
  - `scala.sys` - Interaction with other processes and the operating system
  - `scala.util.matching` - Regular expressions

  Other packages exist. See the complete list on the right.

  Additional parts of the standard library are shipped as separate libraries. These include:

  - `scala.reflect` - Scala's reflection API (scala-reflect.jar)
  - `scala.xml` - XML parsing, manipulation, and serialization (scala-xml.jar)
  - `scala.collection.parallel` - Parallel collections (scala-parallel-collections.jar)
  - `scala.util.parsing` - Parser combinators (scala-parser-combinators.jar)
  - `scala.swing` - A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)

  #### Automatic imports

  Identifiers in the scala package and the `scala.Predef` object are always in scope by default.

  Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example, `List` is an alias for `scala.collection.immutable.List`.

  Other aliases refer to classes provided by the underlying platform. For example, on the JVM, `String` is an alias for `java.lang.String`.

  Definition Classes
    root
-  package scala

  Core Scala types.

  Core Scala types. They are always available without an explicit import.

  Definition Classes
    root
-  package collection
  Definition Classes
    scala
-  package mutable
  Definition Classes
    collection
- AbstractBuffer
- AbstractIterable
- AbstractMap
- AbstractSeq
- AbstractSet
- AnyRefMap
- ArrayBuffer
- ArrayBufferView
- ArrayBuilder
- ArrayDeque
- ArrayDequeOps
- ArraySeq
- BitSet
- Buffer
- Builder
- Clearable
- Cloneable
- CollisionProofHashMap
- Growable
- GrowableBuilder
- HashMap
- HashSet
- ImmutableBuilder
- IndexedBuffer
- IndexedSeq
- IndexedSeqOps
- Iterable
- LinkedHashMap
- LinkedHashSet
- ListBuffer
- ListMap
- LongMap
- Map
- MapOps
- MultiMap
- OpenHashMap
- PriorityQueue
- Queue
- ReusableBuilder
- Seq
- SeqMap
- SeqOps
- Set
- SetOps
- Shrinkable
- SortedMap
- SortedMapOps
- SortedSet
- SortedSetOps
- Stack
- StringBuilder
- TreeMap
- TreeSet
- UnrolledBuffer
- WeakHashMap

c

scala.collection.mutable

# TreeMap

###
Companion object TreeMap

#### sealed class TreeMap[K, V] extends AbstractMap[K, V] with SortedMap[K, V] with SortedMapOps[K, V, TreeMap, TreeMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, TreeMap[K, V]] with StrictOptimizedMapOps[K, V, Map, TreeMap[K, V]] with StrictOptimizedSortedMapOps[K, V, TreeMap, TreeMap[K, V]] with SortedMapFactoryDefaults[K, V, TreeMap, Iterable, Map] with DefaultSerializable

A mutable sorted map implemented using a mutable red-black tree as underlying data structure.

K

  the type of the keys contained in this tree map.

V

  the type of the values associated with the keys.

Source
  TreeMap.scala

Linear Supertypes
DefaultSerializable, java.io.Serializable, StrictOptimizedSortedMapOps[K, V, TreeMap, TreeMap[K, V]], StrictOptimizedMapOps[K, V, [_, _]Map[_, _], TreeMap[K, V]], StrictOptimizedIterableOps[(K, V), [_]Iterable[_], TreeMap[K, V]], SortedMap[K, V], SortedMapOps[K, V, [X, Y]TreeMap[X, Y], TreeMap[K, V]], collection.SortedMap[K, V], SortedMapFactoryDefaults[K, V, [x, y]TreeMap[x, y], [x]Iterable[x], [x, y]Map[x, y]], collection.SortedMapOps[K, V, [X, Y]TreeMap[X, Y], TreeMap[K, V]], SortedOps[K, TreeMap[K, V]], AbstractMap[K, V], Map[K, V], MapOps[K, V, Map, TreeMap[K, V]], Shrinkable[K], Builder[(K, V), TreeMap[K, V]], Growable[(K, V)], Clearable, Cloneable[TreeMap[K, V]], java.lang.Cloneable, Iterable[(K, V)], collection.AbstractMap[K, V], collection.Map[K, V], Equals, MapFactoryDefaults[K, V, [x, y]Map[x, y], [x]Iterable[x]], collection.MapOps[K, V, [_, _]Map[_, _], TreeMap[K, V]], PartialFunction[K, V], (K) => V, collection.AbstractIterable[(K, V)], collection.Iterable[(K, V)], IterableFactoryDefaults[(K, V), [x]Iterable[x]], IterableOps[(K, V), [_]Iterable[_], TreeMap[K, V]], IterableOnceOps[(K, V), [_]Iterable[_], TreeMap[K, V]], IterableOnce[(K, V)], AnyRef, Any
Type Hierarchy

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. TreeMap
2. DefaultSerializable
3. Serializable
4. StrictOptimizedSortedMapOps
5. StrictOptimizedMapOps
6. StrictOptimizedIterableOps
7. SortedMap
8. SortedMapOps
9. SortedMap
10. SortedMapFactoryDefaults
11. SortedMapOps
12. SortedOps
13. AbstractMap
14. Map
15. MapOps
16. Shrinkable
17. Builder
18. Growable
19. Clearable
20. Cloneable
21. Cloneable
22. Iterable
23. AbstractMap
24. Map
25. Equals
26. MapFactoryDefaults
27. MapOps
28. PartialFunction
29. Function1
30. AbstractIterable
31. Iterable
32. IterableFactoryDefaults
33. IterableOps
34. IterableOnceOps
35. IterableOnce
36. AnyRef
37. Any

Implicitly

1. by UnliftOps
2. by iterableOnceExtensionMethods
3. by any2stringadd
4. by StringFormat
5. by Ensuring
6. by ArrowAssoc

1. Hide All
2. Show All

Visibility

1. Public
2. Protected

### Instance Constructors

1.  new TreeMap()(implicit ord: Ordering[K])

   Creates an empty `TreeMap`.

   Creates an empty `TreeMap`.

   ord

     the implicit ordering used to compare objects of type `K`.

   returns

     an empty `TreeMap`.

### Type Members

1.  trait GenKeySet extends AnyRef

   A generic trait that is reused by keyset implementations

   A generic trait that is reused by keyset implementations

   Attributes
     protected
   Definition Classes
     MapOps
2.  class KeySet extends AbstractSet[K] with GenKeySet with DefaultSerializable

   The implementation class of the set returned by `keySet`.

   The implementation class of the set returned by `keySet`.

   Attributes
     protected
   Definition Classes
     MapOps
3.  trait GenKeySortedSet extends GenKeySet

   A generic trait that is reused by sorted keyset implementations

   A generic trait that is reused by sorted keyset implementations

   Attributes
     protected
   Definition Classes
     SortedMapOps
4.  class KeySortedSet extends SortedSet[K] with GenKeySet with GenKeySortedSet

   The implementation class of the set returned by `keySet`

   The implementation class of the set returned by `keySet`

   Attributes
     protected
   Definition Classes
     SortedMapOps

### Value Members

1.  final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     AnyRef → Any
2.  final def ##: Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any
3.  final def ++[V2 >: V](xs: IterableOnce[(K, V2)]): TreeMap[K, V2]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     SortedMapOps → MapOps
   Annotations
     @inline()
4.  final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]

   Alias for `concat`

   Alias for `concat`

   Definition Classes
     IterableOps
   Annotations
     @inline()
5.  final def ++=(xs: IterableOnce[(K, V)]): TreeMap.this.type

   Alias for `addAll`

   Alias for `addAll`

   Definition Classes
     Growable
   Annotations
     @inline()
6.  final def +=(elem: (K, V)): TreeMap.this.type

   Alias for `addOne`

   Alias for `addOne`

   Definition Classes
     Growable
   Annotations
     @inline()
7.  final def --=(xs: IterableOnce[K]): TreeMap.this.type

   Alias for `subtractAll`

   Alias for `subtractAll`

   Definition Classes
     Shrinkable
   Annotations
     @inline()
8.  final def -=(elem: K): TreeMap.this.type

   Alias for `subtractOne`

   Alias for `subtractOne`

   Definition Classes
     Shrinkable
   Annotations
     @inline()
9.  def ->[B](y: B): (TreeMap[K, V], B)
   Implicit
     This member is added by an implicit conversion from TreeMap[K, V] toArrowAssoc[TreeMap[K, V]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if V is a subclass of Option[Nothing] (V <: Option[Nothing]).
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()
10.  final def ==(arg0: Any): Boolean

    The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      AnyRef → Any
11.  def addAll(xs: IterableOnce[(K, V)]): TreeMap.this.type

    Adds all elements produced by an IterableOnce to this mutable tree map.

    Adds all elements produced by an IterableOnce to this mutable tree map.

    xs

      the IterableOnce producing the elements to add.

    returns

      the mutable tree map itself.

    Definition Classes
      Growable
12.  def addOne(elem: (K, V)): TreeMap.this.type

    Adds a single element to this mutable tree map.

    Adds a single element to this mutable tree map.

    elem

      the element to add.

    returns

      the mutable tree map itself

    Definition Classes
      TreeMap → Growable
13.  def addString(sb: StringBuilder, start: String, sep: String, end: String): sb.type

    Appends all elements of this mutable tree map to a string builder using start, end, and separator strings.

    Appends all elements of this mutable tree map to a string builder using start, end, and separator strings. The written text begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this mutable tree map are separated by the string `sep`.

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = new StringBuilder()
        b: StringBuilder =

        scala> a.addString(b , "List(" , ", " , ")")
        res5: StringBuilder = List(1, 2, 3, 4)

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      MapOps → IterableOnceOps
14.  final def addString(b: StringBuilder): b.type

    Appends all elements of this mutable tree map to a string builder.

    Appends all elements of this mutable tree map to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this mutable tree map without any separator string.

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = new StringBuilder()
        b: StringBuilder =

        scala> val h = a.addString(b)
        h: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
15.  final def addString(b: StringBuilder, sep: String): b.type

    Appends all elements of this mutable tree map to a string builder using a separator string.

    Appends all elements of this mutable tree map to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this mutable tree map, separated by the string `sep`.

    Example:

        scala> val a = List(1,2,3,4)
        a: List[Int] = List(1, 2, 3, 4)

        scala> val b = new StringBuilder()
        b: StringBuilder =

        scala> a.addString(b, ", ")
        res0: StringBuilder = 1, 2, 3, 4

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      IterableOnceOps
    Annotations
      @inline()
16.  def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]

    Composes this partial function with another partial function that gets applied to results of this partial function.

    Composes this partial function with another partial function that gets applied to results of this partial function.

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the domain of this partial function narrowed by other partial function, which maps arguments `x` to `k(this(x))`.

    Definition Classes
      PartialFunction
17.  def andThen[C](k: (V) => C): PartialFunction[K, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    If the runtime type of the function is a `PartialFunction` then the other `andThen` method is used (note its cautions).

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the domain of this partial function, possibly narrowed by the specified function, which maps arguments `x` to `k(this(x))`.

    Definition Classes
      PartialFunction → Function1
18.  def apply(key: K): V

    Retrieves the value which is associated with the given key.

    Retrieves the value which is associated with the given key. This method invokes the `default` method of the map if there is no mapping from the given key to a value. Unless overridden, the `default` method throws a `NoSuchElementException`.

    key

      the key

    returns

      the value associated with the given key, or the result of the map's `default` method, if none exists.

    Definition Classes
      MapOps → Function1
    Annotations
      @throws(cause = scala.this.throws.<init>$default$1[NoSuchElementException])
19.  def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) => V1): V1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression `pf.applyOrElse(x, default)` is equivalent to

        if(pf isDefinedAt x) pf(x) else default(x)

    except that `applyOrElse` method can be implemented more efficiently. For all partial function literals the compiler generates an `applyOrElse` implementation which avoids double evaluation of pattern matchers and guards. This makes `applyOrElse` the basis for the efficient implementation for many operations and scenarios, such as:

    - combining partial functions into `orElse`/`andThen` chains does not lead to excessive `apply`/`isDefinedAt` evaluation
    - `lift` and `unlift` do not evaluate source functions twice on each invocation
    - `runWith` allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial `isDefinedAt` method it is recommended to override `applyOrElse` with custom implementation that avoids double `isDefinedAt` evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

      the function argument

    default

      the fallback function

    returns

      the result of this function or fallback function application.

    Definition Classes
      MapOps → PartialFunction
20.  final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(1).asInstanceOf[List[String]]` will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

      `ClassCastException` if the receiver object is not an instance of the erasure of type `T0`.

21.  def canEqual(that: Any): Boolean

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass.

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    that

      the value being probed for possible equality

    returns

      true if this instance can possibly equal `that`, otherwise false

    Definition Classes
      Map → Equals
22.  def className: String

    Defines the prefix of this object's `toString` representation.

    Defines the prefix of this object's `toString` representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for `ListMap` this method should return `"ListMap"`, not `"Map"` (the supertype) or `"Node"` (an implementation subclass).

    The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".

    returns

      a string representation which starts the result of `toString` applied to this mutable tree map. By default the string prefix is the simple name of the collection class mutable tree map.

    Attributes
      protected[this]
    Definition Classes
      TreeMap → Iterable
23.  def clear(): Unit

    Clears the contents of this builder.

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    Definition Classes
      TreeMap → MapOps → Builder → Clearable
24.  def clone(): TreeMap[K, V]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Definition Classes
      MapOps → Cloneable → AnyRef
    Note

      not specified by SLS as a member of AnyRef

25.  final def coll: TreeMap.this.type

    returns

      This collection as a `C`.

    Attributes
      protected
    Definition Classes
      Iterable → IterableOps
26.  def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]

    Builds a new sorted map by applying a partial function to all elements of this mutable tree map on which the function is defined.

    Builds a new sorted map by applying a partial function to all elements of this mutable tree map on which the function is defined.

    pf

      the partial function which filters and maps the mutable tree map.

    returns

      a new mutable tree map resulting from applying the given partial function `pf` to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
      StrictOptimizedSortedMapOps → SortedMapOps
27.  def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): Map[K2, V2]

    Builds a new collection by applying a partial function to all elements of this mutable tree map on which the function is defined.

    Builds a new collection by applying a partial function to all elements of this mutable tree map on which the function is defined.

    K2

      the key type of the returned mutable tree map.

    V2

      the value type of the returned mutable tree map.

    pf

      the partial function which filters and maps the mutable tree map.

    returns

      a new mutable tree map resulting from applying the given partial function `pf` to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
      StrictOptimizedMapOps → MapOps
28.  def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]

    Builds a new mutable tree map by applying a partial function to all elements of this mutable tree map on which the function is defined.

    Builds a new mutable tree map by applying a partial function to all elements of this mutable tree map on which the function is defined.

    B

      the element type of the returned mutable tree map.

    pf

      the partial function which filters and maps the mutable tree map.

    returns

      a new mutable tree map resulting from applying the given partial function `pf` to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
29.  def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

    Finds the first element of the mutable tree map for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the mutable tree map for which the given partial function is defined, and applies the partial function to it.

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    pf

      the partial function

    returns

      an option value containing pf applied to the first value for which it is defined, or `None` if none exists.

    Definition Classes
      IterableOnceOps
    Example:

    1. `Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)`

30.  def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]

    Composes another partial function `k` with this partial function so that this partial function gets applied to results of `k`.

    Composes another partial function `k` with this partial function so that this partial function gets applied to results of `k`.

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    R

      the parameter type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the domain of other partial function narrowed by this partial function, which maps arguments `x` to `this(k(x))`.

    Definition Classes
      PartialFunction
31.  def compose[A](g: (A) => K): (A) => V

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

      a new function `f` such that `f(x) == apply(g(x))`

    Definition Classes
      Function1
    Annotations
      @unspecialized()
32.  def concat[V2 >: V](xs: IterableOnce[(K, V2)]): TreeMap[K, V2]

    Returns a new mutable tree map containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new mutable tree map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the mutable tree map is the most specific superclass encompassing the element types of the two operands.

    returns

      a new mutable tree map which contains all elements of this mutable tree map followed by all elements of `suffix`.

    Definition Classes
      StrictOptimizedSortedMapOps → StrictOptimizedMapOps → SortedMapOps → MapOps
33.  def concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]

    Returns a new mutable tree map containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new mutable tree map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the mutable tree map is the most specific superclass encompassing the element types of the two operands.

    B

      the element type of the returned collection.

    suffix

      the traversable to append.

    returns

      a new mutable tree map which contains all elements of this mutable tree map followed by all elements of `suffix`.

    Definition Classes
      IterableOps
34.  def contains(key: K): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key.

    key

      the key

    returns

      `true` if there is a binding for `key` in this map, `false` otherwise.

    Definition Classes
      TreeMap → MapOps
35.  def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with at most `len` elements of this mutable tree map.

    Copying will stop once either all the elements of this mutable tree map have been copied, or the end of the array is reached, or `len` elements have been copied.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index of xs.

    len

      the maximal number of elements to copy.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

36.  def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with values of this mutable tree map.

    Copying will stop once either all the elements of this mutable tree map have been copied, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index of xs.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

37.  def copyToArray[B >: (K, V)](xs: Array[B]): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array `xs` starting at index `start` with values of this mutable tree map.

    Copying will stop once either all the elements of this mutable tree map have been copied, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    returns

      the number of elements written to the array

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecatedOverriding()
    Note

      Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

38.  def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Note: will not terminate for infinite-sized collections.

    B

      the type of the elements of `that`

    that

      the other collection

    p

      the test predicate, which relates elements from both collections

    returns

      `true` if both collections have the same length and `p(x, y)` is `true` for all corresponding elements `x` of this iterator and `y` of `that`, otherwise `false`

    Definition Classes
      IterableOnceOps
39.  def count(p: ((K, V)) => Boolean): Int

    Counts the number of elements in the mutable tree map which satisfy a predicate.

    Counts the number of elements in the mutable tree map which satisfy a predicate.

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      IterableOnceOps
40.  def default(key: K): V

    Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.

    Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.

    key

      the given key value for which a binding is missing.

    Definition Classes
      MapOps
    Annotations
      @throws(cause = scala.this.throws.<init>$default$1[NoSuchElementException])
    Exceptions thrown
41.  def drop(n: Int): TreeMap[K, V]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

      the number of elements to drop from this mutable tree map.

    returns

      a mutable tree map consisting of all elements of this mutable tree map except the first `n` ones, or else the empty mutable tree map, if this mutable tree map has less than `n` elements. If `n` is negative, don't drop any elements.

    Definition Classes
      IterableOps → IterableOnceOps
42.  def dropRight(n: Int): TreeMap[K, V]

    The rest of the collection without its `n` last elements.

    The rest of the collection without its `n` last elements. For linear, immutable collections this should avoid making a copy.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    n

      the number of elements to drop from this mutable tree map.

    returns

      a mutable tree map consisting of all elements of this mutable tree map except the last `n` ones, or else the empty mutable tree map, if this mutable tree map has less than `n` elements. If `n` is negative, don't drop any elements.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps
43.  def dropWhile(p: ((K, V)) => Boolean): TreeMap[K, V]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

      The predicate used to test elements.

    returns

      the longest suffix of this mutable tree map whose first element does not satisfy the predicate `p`.

    Definition Classes
      IterableOps → IterableOnceOps
44.  def elementWise: ElementWiseExtractor[K, V]

    Returns an extractor object with a `unapplySeq` method, which extracts each element of a sequence data.

    Returns an extractor object with a `unapplySeq` method, which extracts each element of a sequence data.

    Definition Classes
      PartialFunction
    Example:

    1.     val firstChar: String => Option[Char] = _.headOption

           Seq("foo", "bar", "baz") match {
             case firstChar.unlift.elementWise(c0, c1, c2) =>
               println(s"$c0, $c1, $c2") // Output: f, b, b
           }

45.  def empty: TreeMap[K, V]

    The empty iterable of the same type as this iterable

    The empty iterable of the same type as this iterable

    returns

      an empty iterable of type `C`.

    Definition Classes
      SortedMapFactoryDefaults → IterableOps
46.  def ensuring(cond: (TreeMap[K, V]) => Boolean, msg: => Any): TreeMap[K, V]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toEnsuring[TreeMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
47.  def ensuring(cond: (TreeMap[K, V]) => Boolean): TreeMap[K, V]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toEnsuring[TreeMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
48.  def ensuring(cond: Boolean, msg: => Any): TreeMap[K, V]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toEnsuring[TreeMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
49.  def ensuring(cond: Boolean): TreeMap[K, V]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toEnsuring[TreeMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
50.  final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (`that`) is a reference to the receiver object (`this`).

    Tests whether the argument (`that`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

    - It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
    - For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
    - `null.eq(null)` returns `true`.

    When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

    returns

      `true` if the argument is a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef
51.  def equals(that: Any): Boolean

    Equality of maps is implemented using the lookup method get.

    Equality of maps is implemented using the lookup method get. This method returns `true` if

    - the argument `o` is a `Map`,
    - the two maps have the same size, and
    - for every `(key, value)` pair in this map, `other.get(key) == Some(value)`.

    The implementation of `equals` checks the canEqual method, so subclasses of `Map` can narrow down the equality to specific map types. The `Map` implementations in the standard library can all be compared, their `canEqual` methods return `true`.

    Note: The `equals` method only respects the equality laws (symmetry, transitivity) if the two maps use the same key equivalence function in their lookup operation. For example, the key equivalence operation in a scala.collection.immutable.TreeMap is defined by its ordering. Comparing a `TreeMap` with a `HashMap` leads to unexpected results if `ordering.equiv(k1, k2)` (used for lookup in `TreeMap`) is different from `k1 == k2` (used for lookup in `HashMap`).

        scala> import scala.collection.immutable._
        scala> val ord: Ordering[String] = _ compareToIgnoreCase _

        scala> TreeMap("A" -> 1)(ord) == HashMap("a" -> 1)
        val res0: Boolean = false

        scala> HashMap("a" -> 1) == TreeMap("A" -> 1)(ord)
        val res1: Boolean = true

    returns

      `true` if the two maps are equal according to the description

    Definition Classes
      SortedMap → Map → Equals → AnyRef → Any
52.  def exists(p: ((K, V)) => Boolean): Boolean

    Tests whether a predicate holds for at least one element of this mutable tree map.

    Tests whether a predicate holds for at least one element of this mutable tree map.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      `true` if the given predicate `p` is satisfied by at least one element of this mutable tree map, otherwise `false`

    Definition Classes
      IterableOnceOps
53.  def filter(pred: ((K, V)) => Boolean): TreeMap[K, V]

    Selects all elements of this mutable tree map which satisfy a predicate.

    Selects all elements of this mutable tree map which satisfy a predicate.

    returns

      a new mutable tree map consisting of all elements of this mutable tree map that satisfy the given predicate `p`. The order of the elements is preserved.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
54.  def filterImpl(pred: ((K, V)) => Boolean, isFlipped: Boolean): TreeMap[K, V]
    Attributes
      protected[collection]
    Definition Classes
      StrictOptimizedIterableOps
55.  def filterInPlace(p: (K, V) => Boolean): TreeMap.this.type

    Retains only those mappings for which the predicate `p` returns `true`.

    Retains only those mappings for which the predicate `p` returns `true`.

    p

      The test predicate

    Definition Classes
      MapOps
56.  def filterNot(pred: ((K, V)) => Boolean): TreeMap[K, V]

    Selects all elements of this mutable tree map which do not satisfy a predicate.

    Selects all elements of this mutable tree map which do not satisfy a predicate.

    pred

      the predicate used to test elements.

    returns

      a new mutable tree map consisting of all elements of this mutable tree map that do not satisfy the given predicate `pred`. Their order may not be preserved.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
57.  def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws(classOf[java.lang.Throwable])
    Note

      not specified by SLS as a member of AnyRef

58.  def find(p: ((K, V)) => Boolean): Option[(K, V)]

    Finds the first element of the mutable tree map satisfying a predicate, if any.

    Finds the first element of the mutable tree map satisfying a predicate, if any.

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

      the predicate used to test elements.

    returns

      an option value containing the first element in the mutable tree map that satisfies `p`, or `None` if none exists.

    Definition Classes
      IterableOnceOps
59.  def firstKey: K

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
      SortedMapOps → SortedOps
60.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]

    Builds a new sorted map by applying a function to all elements of this mutable tree map and using the elements of the resulting collections.

    Builds a new sorted map by applying a function to all elements of this mutable tree map and using the elements of the resulting collections.

    f

      the function to apply to each element.

    returns

      a new mutable tree map resulting from applying the given collection-valued function `f` to each element of this mutable tree map and concatenating the results.

    Definition Classes
      StrictOptimizedSortedMapOps → SortedMapOps
61.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): Map[K2, V2]

    Builds a new map by applying a function to all elements of this mutable tree map and using the elements of the resulting collections.

    Builds a new map by applying a function to all elements of this mutable tree map and using the elements of the resulting collections.

    f

      the function to apply to each element.

    returns

      a new mutable tree map resulting from applying the given collection-valued function `f` to each element of this mutable tree map and concatenating the results.

    Definition Classes
      StrictOptimizedMapOps → MapOps
62.  def flatMap[B](f: ((K, V)) => IterableOnce[B]): Iterable[B]

    Builds a new mutable tree map by applying a function to all elements of this mutable tree map and using the elements of the resulting collections.

    Builds a new mutable tree map by applying a function to all elements of this mutable tree map and using the elements of the resulting collections.

    For example:

        def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of mutable tree map. This might cause unexpected results sometimes. For example:

        // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
        def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

        // lettersOf will return a Set[Char], not a Seq
        def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq)

        // xs will be an Iterable[Int]
        val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

        // ys will be a Map[Int, Int]
        val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new mutable tree map resulting from applying the given collection-valued function `f` to each element of this mutable tree map and concatenating the results.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
63.  def flatten[B](implicit toIterableOnce: ((K, V)) => IterableOnce[B]): Iterable[B]

    Converts this mutable tree map of traversable collections into a mutable tree map formed by the elements of these traversable collections.

    Converts this mutable tree map of traversable collections into a mutable tree map formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the type of mutable tree map. For example:

        val xs = List(
                   Set(1, 2, 3),
                   Set(1, 2, 3)
                 ).flatten
        // xs == List(1, 2, 3, 1, 2, 3)

        val ys = Set(
                   List(1, 2, 3),
                   List(3, 2, 1)
                 ).flatten
        // ys == Set(1, 2, 3)

    B

      the type of the elements of each traversable collection.

    returns

      a new mutable tree map resulting from concatenating all element mutable tree maps.

    Definition Classes
      StrictOptimizedIterableOps → IterableOps → IterableOnceOps
64.  def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1

    Folds the elements of this mutable tree map using the specified associative binary operator.

    Folds the elements of this mutable tree map using the specified associative binary operator. The default implementation in `IterableOnce` is equivalent to `foldLeft` but may be overridden for more efficient traversal orders.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note: will not terminate for infinite-sized collections.

    A1

      a type parameter for the binary operator, a supertype of `A`.

    z

      a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., `Nil` for list concatenation, 0 for addition, or 1 for multiplication).

    op

      a binary operator that must be associative.

    returns

      the result of applying the fold operator `op` between all the elements and `z`, or `z` if this mutable tree map is empty.

    Definition Classes
      IterableOnceOps
65.  def foldLeft[B](z: B)(op: (B, (K, V)) => B): B

    Applies a binary operator to a start value and all elements of this mutable tree map, going left to right.

    Applies a binary operator to a start value and all elements of this mutable tree map, going left to right.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this mutable tree map, going left to right with the start value `z` on the left: `op(...op(z, x1), x2, ..., xn)` where `x1, ..., xn` are the elements of this mutable tree map. Returns `z` if this mutable tree map is empty.

    Definition Classes
      IterableOnceOps
66.  def foldRight[B](z: B)(op: ((K, V), B) => B): B

    Applies a binary operator to all elements of this mutable tree map and a start value, going right to left.

    Applies a binary operator to all elements of this mutable tree map and a start value, going right to left.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this mutable tree map, going right to left with the start value `z` on the right: `op(x1, op(x2, ... op(xn, z)...))` where `x1, ..., xn` are the elements of this mutable tree map. Returns `z` if this mutable tree map is empty.

    Definition Classes
      IterableOnceOps
67.  def forall(p: ((K, V)) => Boolean): Boolean

    Tests whether a predicate holds for all elements of this mutable tree map.

    Tests whether a predicate holds for all elements of this mutable tree map.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      `true` if this mutable tree map is empty or the given predicate `p` holds for all elements of this mutable tree map, otherwise `false`.

    Definition Classes
      IterableOnceOps
68.  def foreach[U](f: ((K, V)) => U): Unit

    Apply `f` to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply `f` to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
      TreeMap → IterableOnceOps
69.  def foreachEntry[U](f: (K, V) => U): Unit

    Apply `f` to each key/value pair for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply `f` to each key/value pair for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
      TreeMap → MapOps
70.  def fromSpecific(coll: IterableOnce[(K, V)]): TreeMap[K, V]

    Defines how to turn a given `Iterable[A]` into a collection of type `C`.

    Defines how to turn a given `Iterable[A]` into a collection of type `C`.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
      protected
    Definition Classes
      SortedMapFactoryDefaults → IterableOps
    Note

      When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

      ,

      As witnessed by the `@uncheckedVariance` annotation, using this method might be unsound. However, as long as it is called with an `Iterable[A]` obtained from `this` collection (as it is the case in the implementations of operations where we use a `View[A]`), it is safe.

71.  def get(key: K): Option[V]

    Optionally returns the value associated with a key.

    Optionally returns the value associated with a key.

    key

      the key value

    returns

      an option value containing the value associated with `key` in this map, or `None` if none exists.

    Definition Classes
      TreeMap → MapOps
72.  final def getClass(): Class[_ <: AnyRef]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

      a class object corresponding to the runtime type of the receiver.

    Definition Classes
      AnyRef → Any
    Annotations
      @native()
73.  def getOrElse[V1 >: V](key: K, default: => V1): V1

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    V1

      the result type of the default computation.

    key

      the key.

    default

      a computation that yields a default value in case no binding for `key` is found in the map.

    returns

      the value associated with `key` if it exists, otherwise the result of the `default` computation.

    Definition Classes
      MapOps
74.  def getOrElseUpdate(key: K, op: => V): V

    If given key is already in this map, returns associated value.

    If given key is already in this map, returns associated value.

    Otherwise, computes value from given expression `op`, stores with key in map and returns that value.

    Concurrent map implementations may evaluate the expression `op` multiple times, or may evaluate `op` without inserting the result.

    key

      the key to test

    op

      the computation yielding the value to associate with `key`, if `key` is previously unbound.

    returns

      the value associated with key (either previously or as a result of executing the method).

    Definition Classes
      MapOps
75.  def groupBy[K](f: ((K, V)) => K): immutable.Map[K, TreeMap[K, V]]

    Partitions this mutable tree map into a map of mutable tree maps according to some discriminator function.

    Partitions this mutable tree map into a map of mutable tree maps according to some discriminator function.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to mutable tree maps such that the following invariant holds:

          (xs groupBy f)(k) = xs filter (x => f(x) == k)

      That is, every key `k` is bound to a mutable tree map of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      IterableOps
76.  def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): immutable.Map[K, Iterable[B]]

    Partitions this mutable tree map into a map of mutable tree maps according to a discriminator function `key`.

    Partitions this mutable tree map into a map of mutable tree maps according to a discriminator function `key`. Each element in a group is transformed into a value of type `B` using the `value` function.

    It is equivalent to `groupBy(key).mapValues(_.map(f))`, but more efficient.

        case class User(name: String, age: Int)

        def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
          users.groupMap(_.age)(_.name)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

      the type of keys returned by the discriminator function

    B

      the type of values returned by the transformation function

    key

      the discriminator function

    f

      the element transformation function

    Definition Classes
      IterableOps
77.  def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): immutable.Map[K, B]

    Partitions this mutable tree map into a map according to a discriminator function `key`.

    Partitions this mutable tree map into a map according to a discriminator function `key`. All the values that have the same discriminator are then transformed by the `f` function and then reduced into a single value with the `reduce` function.

    It is equivalent to `groupBy(key).mapValues(_.map(f).reduce(reduce))`, but more efficient.

        def occurrences[A](as: Seq[A]): Map[A, Int] =
          as.groupMapReduce(identity)(_ => 1)(_ + _)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
      IterableOps
78.  def grouped(size: Int): Iterator[TreeMap[K, V]]

    Partitions elements in fixed size mutable tree maps.

    Partitions elements in fixed size mutable tree maps.

    size

      the number of elements per group

    returns

      An iterator producing mutable tree maps of size `size`, except the last will be less than size `size` if the elements don't divide evenly.

    Definition Classes
      IterableOps
    See also

      scala.collection.Iterator, method `grouped`

79.  def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

      the hash code value for this object.

    Definition Classes
      Map → AnyRef → Any
80.  def head: (K, V)

    Selects the first element of this mutable tree map.

    Selects the first element of this mutable tree map.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      the first element of this mutable tree map.

    Definition Classes
      TreeMap → IterableOps
    Exceptions thrown

      `NoSuchElementException` if the mutable tree map is empty.

81.  def headOption: Option[(K, V)]

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      the first element of this mutable tree map if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
82.  def init: TreeMap[K, V]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
      IterableOps
83.  def inits: Iterator[TreeMap[K, V]]

    Iterates over the inits of this mutable tree map.

    Iterates over the inits of this mutable tree map. The first value will be this mutable tree map and the final one will be an empty mutable tree map, with the intervening values the results of successive applications of `init`.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

      an iterator over all the inits of this mutable tree map

    Definition Classes
      IterableOps
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

84.  def isDefinedAt(key: K): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key. This method, which implements an abstract method of trait `PartialFunction`, is equivalent to `contains`.

    key

      the key

    returns

      `true` if there is a binding for `key` in this map, `false` otherwise.

    Definition Classes
      MapOps → PartialFunction
85.  def isEmpty: Boolean

    Tests whether the mutable tree map is empty.

    Tests whether the mutable tree map is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when `isEmpty` is called.

    returns

      `true` if the mutable tree map contains no elements, `false` otherwise.

    Definition Classes
      TreeMap → IterableOnceOps
86.  final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Test whether the dynamic type of the receiver object has the same erasure as `T0`.

    Depending on what `T0` is, the test is done in one of the below ways:

    - `T0` is a non-parameterized class type, e.g. `BigDecimal`: this method returns `true` if the value of the receiver object is a `BigDecimal` or a subtype of `BigDecimal`.
    - `T0` is a parameterized class type, e.g. `List[Int]`: this method returns `true` if the value of the receiver object is some `List[X]` for any `X`. For example, `List(1, 2, 3).isInstanceOf[List[String]]` will return true.
    - `T0` is some singleton type `x.type` or literal `x`: this method returns `this.eq(x)`. For example, `x.isInstanceOf[1]` is equivalent to `x.eq(1)`
    - `T0` is an intersection `X with Y` or `X & Y: this method is equivalent to` x.isInstanceOf[X] && x.isInstanceOf[Y]``
    - `T0` is a union `X | Y`: this method is equivalent to `x.isInstanceOf[X] || x.isInstanceOf[Y]`
    - `T0` is a type parameter or an abstract type member: this method is equivalent to `isInstanceOf[U]` where `U` is `T0`'s upper bound, `Any` if `T0` is unbounded. For example, `x.isInstanceOf[A]` where `A` is an unbounded type parameter will return true for any value of `x`.

    This is exactly equivalent to the type pattern `_: T0`

    returns

      `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

    Definition Classes
      Any
    Note

      due to the unexpectedness of `List(1, 2, 3).isInstanceOf[List[String]]` returning true and `x.isInstanceOf[A]` where `A` is a type parameter or abstract member returning true, these forms issue a warning.

87.  def isTraversableAgain: Boolean

    Tests whether this mutable tree map can be repeatedly traversed.

    Tests whether this mutable tree map can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

      `true` if it is repeatedly traversable, `false` otherwise.

    Definition Classes
      IterableOps → IterableOnceOps
88.  def iterableFactory: IterableFactory[Iterable]

    The companion object of this mutable tree map, providing various factory methods.

    The companion object of this mutable tree map, providing various factory methods.

    Definition Classes
      Iterable → Iterable → IterableOps
    Note

      When implementing a custom collection type and refining `CC` to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

89.  def iterator: Iterator[(K, V)]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
      TreeMap → IterableOnce
90.  def iteratorFrom(start: K): Iterator[(K, V)]

    Creates an iterator over all the key/value pairs contained in this map having a key greater than or equal to `start` according to the ordering of this map.

    Creates an iterator over all the key/value pairs contained in this map having a key greater than or equal to `start` according to the ordering of this map. x.iteratorFrom(y) is equivalent to but often more efficient than x.from(y).iterator.

    start

      The lower bound (inclusive) on the keys to be returned

    Definition Classes
      TreeMap → SortedMapOps
91.  def keySet: collection.SortedSet[K]

    Collects all keys of this map in a set.

    Collects all keys of this map in a set.

    returns

      a set containing all keys of this map.

    Definition Classes
      SortedMapOps → MapOps
92.  def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S with EfficientSplit

    Returns a Stepper for the keys of this map.

    Returns a Stepper for the keys of this map. See method stepper.

    Definition Classes
      TreeMap → MapOps
93.  def keys: collection.Iterable[K]

    Collects all keys of this map in an iterable collection.

    Collects all keys of this map in an iterable collection.

    returns

      the keys of this map as an iterable.

    Definition Classes
      MapOps
94.  def keysIterator: Iterator[K]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

      an iterator over all keys.

    Definition Classes
      TreeMap → MapOps
95.  def keysIteratorFrom(start: K): Iterator[K]

    Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to `start` according to the ordering of this collection.

    Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to `start` according to the ordering of this collection. x.keysIteratorFrom(y) is equivalent to but often more efficient than x.from(y).keysIterator.

    start

      The lower bound (inclusive) on the keys to be returned

    Definition Classes
      TreeMap → SortedMapOps
96.  def knownSize: Int

    returns

      The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise. The default implementation always returns -1.

    Definition Classes
      TreeMap → MapOps → Growable → IterableOnce
97.  def last: (K, V)

    Selects the last element.

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      The last element of this mutable tree map.

    Definition Classes
      TreeMap → IterableOps
    Exceptions thrown

      `NoSuchElementException` If the mutable tree map is empty.

98.  def lastKey: K

    Returns the last key of the collection.

    Returns the last key of the collection.

    Definition Classes
      SortedMapOps → SortedOps
99.  def lastOption: Option[(K, V)]

    Optionally selects the last element.

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

      the last element of this mutable tree map$ if it is nonempty, `None` if it is empty.

    Definition Classes
      IterableOps
100.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, TreeMap.this.type]

     Analogous to `zip` except that the elements in each collection are not consumed until a strict operation is invoked on the returned `LazyZip2` decorator.

     Analogous to `zip` except that the elements in each collection are not consumed until a strict operation is invoked on the returned `LazyZip2` decorator.

     Calls to `lazyZip` can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

         val xs = List(1, 2, 3)
         val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
         // res == List(4, 8, 12)

     B

       the type of the second element in each eventual pair

     that

       the iterable providing the second element of each eventual pair

     returns

       a decorator `LazyZip2` that allows strict operations to be performed on the lazily evaluated pairs or chained calls to `lazyZip`. Implicit conversion to `Iterable[(A, B)]` is also supported.

     Definition Classes
       Iterable
101.  def lift: (K) => Option[V]

     Turns this partial function into a plain function returning an `Option` result.

     Turns this partial function into a plain function returning an `Option` result.

     returns

       a function that takes an argument `x` to `Some(this(x))` if `this` is defined for `x`, and to `None` otherwise.

     Definition Classes
       PartialFunction
     See also

       Function.unlift

102.  def map[K2, V2](f: ((K, V)) => (K2, V2))(implicit ordering: Ordering[K2]): TreeMap[K2, V2]

     Builds a new sorted map by applying a function to all elements of this mutable tree map.

     Builds a new sorted map by applying a function to all elements of this mutable tree map.

     f

       the function to apply to each element.

     returns

       a new mutable tree map resulting from applying the given function `f` to each element of this mutable tree map and collecting the results.

     Definition Classes
       StrictOptimizedSortedMapOps → SortedMapOps
103.  def map[K2, V2](f: ((K, V)) => (K2, V2)): Map[K2, V2]

     Builds a new map by applying a function to all elements of this mutable tree map.

     Builds a new map by applying a function to all elements of this mutable tree map.

     f

       the function to apply to each element.

     returns

       a new mutable tree map resulting from applying the given function `f` to each element of this mutable tree map and collecting the results.

     Definition Classes
       StrictOptimizedMapOps → MapOps
104.  def map[B](f: ((K, V)) => B): Iterable[B]

     Builds a new mutable tree map by applying a function to all elements of this mutable tree map.

     Builds a new mutable tree map by applying a function to all elements of this mutable tree map.

     B

       the element type of the returned mutable tree map.

     f

       the function to apply to each element.

     returns

       a new mutable tree map resulting from applying the given function `f` to each element of this mutable tree map and collecting the results.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
105.  def mapFactory: MapFactory[Map]

     The companion object of this map, providing various factory methods.

     The companion object of this map, providing various factory methods.

     Definition Classes
       Map → Map → MapOps
     Note

       When implementing a custom collection type and refining `CC` to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

106.  final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): Map[K2, V2]

     Similar to `fromIterable`, but returns a Map collection type.

     Similar to `fromIterable`, but returns a Map collection type. Note that the return type is now `CC[K2, V2]`.

     Attributes
       protected
     Definition Classes
       MapOps
     Annotations
       @inline()
107.  def mapResult[NewTo](f: (TreeMap[K, V]) => NewTo): Builder[(K, V), NewTo]

     A builder resulting from this builder my mapping the result using `f`.

     A builder resulting from this builder my mapping the result using `f`.

     Definition Classes
       Builder
108.  def mapValuesInPlace(f: (K, V) => V): TreeMap.this.type

     Applies a transformation function to all values contained in this map.

     Applies a transformation function to all values contained in this map. The transformation function produces new values from existing keys associated values.

     f

       the transformation to apply

     returns

       the map itself.

     Definition Classes
       MapOps
109.  def max[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)

     Finds the largest element.

     Finds the largest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       the largest element of this mutable tree map with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

110.  def maxBefore(key: K): Option[(K, V)]

     Find the element with largest key less than a given key.

     Find the element with largest key less than a given key.

     key

       The given key.

     returns

       `None` if there is no such node.

     Definition Classes
       TreeMap → SortedMapOps
111.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)

     Finds the first element which yields the largest value measured by function f.

     Finds the first element which yields the largest value measured by function f.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function f.

     f

       The measuring function.

     cmp

       An ordering to be used for comparing elements.

     returns

       the first element of this mutable tree map with the largest value measured by function f with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

112.  def maxByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]

     Finds the first element which yields the largest value measured by function f.

     Finds the first element which yields the largest value measured by function f.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function f.

     f

       The measuring function.

     cmp

       An ordering to be used for comparing elements.

     returns

       an option value containing the first element of this mutable tree map with the largest value measured by function f with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
113.  def maxOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]

     Finds the largest element.

     Finds the largest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       an option value containing the largest element of this mutable tree map with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
114.  def min[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)

     Finds the smallest element.

     Finds the smallest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       the smallest element of this mutable tree map with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

115.  def minAfter(key: K): Option[(K, V)]

     Find the element with smallest key larger than or equal to a given key.

     Find the element with smallest key larger than or equal to a given key.

     key

       The given key.

     returns

       `None` if there is no such node.

     Definition Classes
       TreeMap → SortedMapOps
116.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)

     Finds the first element which yields the smallest value measured by function f.

     Finds the first element which yields the smallest value measured by function f.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function f.

     f

       The measuring function.

     cmp

       An ordering to be used for comparing elements.

     returns

       the first element of this mutable tree map with the smallest value measured by function f with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

117.  def minByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]

     Finds the first element which yields the smallest value measured by function f.

     Finds the first element which yields the smallest value measured by function f.

     Note: will not terminate for infinite-sized collections.

     B

       The result type of the function f.

     f

       The measuring function.

     cmp

       An ordering to be used for comparing elements.

     returns

       an option value containing the first element of this mutable tree map with the smallest value measured by function f with respect to the ordering `cmp`.

     Definition Classes
       IterableOnceOps
118.  def minOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]

     Finds the smallest element.

     Finds the smallest element.

     Note: will not terminate for infinite-sized collections.

     B

       The type over which the ordering is defined.

     ord

       An ordering to be used for comparing elements.

     returns

       an option value containing the smallest element of this mutable tree map with respect to the ordering `ord`.

     Definition Classes
       IterableOnceOps
119.  final def mkString: String

     Displays all elements of this mutable tree map in a string.

     Displays all elements of this mutable tree map in a string.

     Delegates to addString, which can be overridden.

     returns

       a string representation of this mutable tree map. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this mutable tree map follow each other without any separator string.

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
120.  final def mkString(sep: String): String

     Displays all elements of this mutable tree map in a string using a separator string.

     Displays all elements of this mutable tree map in a string using a separator string.

     Delegates to addString, which can be overridden.

     sep

       the separator string.

     returns

       a string representation of this mutable tree map. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this mutable tree map are separated by the string `sep`.

     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
     Example:

     1. `List(1, 2, 3).mkString("|") = "1|2|3"`

121.  final def mkString(start: String, sep: String, end: String): String

     Displays all elements of this mutable tree map in a string using start, end, and separator strings.

     Displays all elements of this mutable tree map in a string using start, end, and separator strings.

     Delegates to addString, which can be overridden.

     start

       the starting string.

     sep

       the separator string.

     end

       the ending string.

     returns

       a string representation of this mutable tree map. The resulting string begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this mutable tree map are separated by the string `sep`.

     Definition Classes
       IterableOnceOps
     Example:

     1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

122.  final def ne(arg0: AnyRef): Boolean

     Equivalent to `!(this eq that)`.

     Equivalent to `!(this eq that)`.

     returns

       `true` if the argument is not a reference to the receiver object; `false` otherwise.

     Definition Classes
       AnyRef
123.  def newSpecificBuilder: Builder[(K, V), TreeMap[K, V]]

     returns

       a strict builder for the same collection type. Note that in the case of lazy collections (e.g. scala.collection.View or scala.collection.immutable.LazyList), it is possible to implement this method but the resulting `Builder` will break laziness. As a consequence, operations should preferably be implemented with `fromSpecific` instead of this method.

     Attributes
       protected
     Definition Classes
       SortedMapFactoryDefaults → IterableOps
     Note

       When implementing a custom collection type and refining `C` to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where `C =:= CC[A]`, this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

       ,

       As witnessed by the `@uncheckedVariance` annotation, using this method might be unsound. However, as long as the returned builder is only fed with `A` values taken from `this` instance, it is safe.

124.  def nonEmpty: Boolean

     Tests whether the mutable tree map is not empty.

     Tests whether the mutable tree map is not empty.

     returns

       `true` if the mutable tree map contains at least one element, `false` otherwise.

     Definition Classes
       IterableOnceOps
     Annotations
       @deprecatedOverriding()
125.  final def notify(): Unit

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Definition Classes
       AnyRef
     Annotations
       @native()
     Note

       not specified by SLS as a member of AnyRef

126.  final def notifyAll(): Unit

     Wakes up all threads that are waiting on the receiver object's monitor.

     Wakes up all threads that are waiting on the receiver object's monitor.

     Definition Classes
       AnyRef
     Annotations
       @native()
     Note

       not specified by SLS as a member of AnyRef

127.  def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

     Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

     A1

       the argument type of the fallback function

     B1

       the result type of the fallback function

     that

       the fallback function

     returns

       a partial function which has as domain the union of the domains of this partial function and `that`. The resulting partial function takes `x` to `this(x)` where `this` is defined, and to `that(x)` where it is not.

     Definition Classes
       PartialFunction
128.  implicit val ordering: Ordering[K]
     Definition Classes
       TreeMap → SortedOps
129.  def partition(p: ((K, V)) => Boolean): (TreeMap[K, V], TreeMap[K, V])

     A pair of, first, all elements that satisfy predicate `p` and, second, all elements that do not.

     A pair of, first, all elements that satisfy predicate `p` and, second, all elements that do not. Interesting because it splits a collection in two.

     The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of `partition` in `StrictOptimizedIterableOps`, which requires only a single traversal.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
130.  def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])

     Applies a function `f` to each element of the mutable tree map and returns a pair of mutable tree maps: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

     Applies a function `f` to each element of the mutable tree map and returns a pair of mutable tree maps: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

     Example:

         val xs = mutable.TreeMap(1, "one", 2, "two", 3, "three") partitionMap {
          case i: Int => Left(i)
          case s: String => Right(s)
         }
         // xs == (mutable.TreeMap(1, 2, 3),
         //        mutable.TreeMap(one, two, three))

     A1

       the element type of the first resulting collection

     A2

       the element type of the second resulting collection

     f

       the 'split function' mapping the elements of this mutable tree map to an scala.util.Either

     returns

       a pair of mutable tree maps: the first one made of those values returned by `f` that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
131.  def product[B >: (K, V)](implicit num: math.Numeric[B]): B

     Multiplies up the elements of this collection.

     Multiplies up the elements of this collection.

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the `*` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `*` operator to be used in forming the product.

     returns

       the product of all elements of this mutable tree map with respect to the `*` operator in `num`.

     Definition Classes
       IterableOnceOps
132.  def put(key: K, value: V): Option[V]

     Adds a new key/value pair to this map and optionally returns previously bound value.

     Adds a new key/value pair to this map and optionally returns previously bound value. If the map already contains a mapping for the key, it will be overridden by the new value.

     key

       the key to update

     value

       the new value

     returns

       an option value containing the value associated with the key before the `put` operation was executed, or `None` if `key` was not defined in the map before.

     Definition Classes
       MapOps
133.  def range(from: K, until: K): TreeMap[K, V]

     Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

     Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

     from

       The lower-bound (inclusive) of the ranged projection.

     until

       The upper-bound (exclusive) of the ranged projection.

     Definition Classes
       SortedOps
134.  def rangeFrom(from: K): TreeMap[K, V]

     Creates a ranged projection of this collection with no upper-bound.

     Creates a ranged projection of this collection with no upper-bound.

     from

       The lower-bound (inclusive) of the ranged projection.

     Definition Classes
       SortedOps
135.  def rangeImpl(from: Option[K], until: Option[K]): TreeMap[K, V]

     Creates a ranged projection of this map.

     Creates a ranged projection of this map. Any mutations in the ranged projection will update the original map and vice versa.

     Only entries with keys between this projection's key range will ever appear as elements of this map, independently of whether the entries are added through the original map or through this view. That means that if one inserts a key-value in a view whose key is outside the view's bounds, calls to `get` or `contains` will _not_ consider the newly added entry. Mutations are always reflected in the original map, though.

     from

       the lower bound (inclusive) of this projection wrapped in a `Some`, or `None` if there is no lower bound.

     until

       the upper bound (exclusive) of this projection wrapped in a `Some`, or `None` if there is no upper bound.

     Definition Classes
       TreeMap → SortedOps
136.  def rangeTo(to: K): TreeMap[K, V]

     Create a range projection of this collection with no lower-bound.

     Create a range projection of this collection with no lower-bound.

     to

       The upper-bound (inclusive) of the ranged projection.

     Definition Classes
       SortedMapOps → SortedOps
137.  def rangeUntil(until: K): TreeMap[K, V]

     Creates a ranged projection of this collection with no lower-bound.

     Creates a ranged projection of this collection with no lower-bound.

     until

       The upper-bound (exclusive) of the ranged projection.

     Definition Classes
       SortedOps
138.  def reduce[B >: (K, V)](op: (B, B) => B): B

     Reduces the elements of this mutable tree map using the specified associative binary operator.

     Reduces the elements of this mutable tree map using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     B

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       The result of applying reduce operator `op` between all the elements if the mutable tree map is nonempty.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

139.  def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B

     Applies a binary operator to all elements of this mutable tree map, going left to right.

     Applies a binary operator to all elements of this mutable tree map, going left to right.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this mutable tree map, going left to right: `op( op( ... op(x1, x2) ..., xn-1), xn)` where `x1, ..., xn` are the elements of this mutable tree map.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

140.  def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]

     Optionally applies a binary operator to all elements of this mutable tree map, going left to right.

     Optionally applies a binary operator to all elements of this mutable tree map, going left to right.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       an option value containing the result of `reduceLeft(op)` if this mutable tree map is nonempty, `None` otherwise.

     Definition Classes
       IterableOnceOps
141.  def reduceOption[B >: (K, V)](op: (B, B) => B): Option[B]

     Reduces the elements of this mutable tree map, if any, using the specified associative binary operator.

     Reduces the elements of this mutable tree map, if any, using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     B

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       An option value containing result of applying reduce operator `op` between all the elements if the collection is nonempty, and `None` otherwise.

     Definition Classes
       IterableOnceOps
142.  def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B

     Applies a binary operator to all elements of this mutable tree map, going right to left.

     Applies a binary operator to all elements of this mutable tree map, going right to left.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this mutable tree map, going right to left: `op(x1, op(x2, ..., op(xn-1, xn)...))` where `x1, ..., xn` are the elements of this mutable tree map.

     Definition Classes
       IterableOnceOps
     Exceptions thrown

       `UnsupportedOperationException` if this mutable tree map is empty.

143.  def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]

     Optionally applies a binary operator to all elements of this mutable tree map, going right to left.

     Optionally applies a binary operator to all elements of this mutable tree map, going right to left.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       an option value containing the result of `reduceRight(op)` if this mutable tree map is nonempty, `None` otherwise.

     Definition Classes
       IterableOnceOps
144.  def remove(key: K): Option[V]

     Removes a key from this map, returning the value associated previously with that key as an option.

     Removes a key from this map, returning the value associated previously with that key as an option.

     key

       the key to be removed

     returns

       an option value containing the value associated previously with `key`, or `None` if `key` was not defined in the map before.

     Definition Classes
       MapOps
145.  def result(): TreeMap[K, V]

     Result collection consisting of all elements appended so far.

     Result collection consisting of all elements appended so far.

     Definition Classes
       MapOps → Builder
146.  def reversed: collection.Iterable[(K, V)]
     Attributes
       protected
     Definition Classes
       IterableOnceOps
147.  def runWith[U](action: (V) => U): (K) => Boolean

     Composes this partial function with an action function which gets applied to results of this partial function.

     Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

     Note that expression `pf.runWith(action)(x)` is equivalent to

         if(pf isDefinedAt x) { action(pf(x)); true } else false

     except that `runWith` is implemented via `applyOrElse` and thus potentially more efficient. Using `runWith` avoids double evaluation of pattern matchers and guards for partial function literals.

     action

       the action function

     returns

       a function which maps arguments `x` to `isDefinedAt(x)`. The resulting function runs `action(this(x))` where `this` is defined.

     Definition Classes
       PartialFunction
     See also

       `applyOrElse`.

148.  def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

     Note: The neutral element `z` may be applied more than once.

     B

       element type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     returns

       a new mutable tree map containing the prefix scan of the elements in this mutable tree map

     Definition Classes
       IterableOps
149.  def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]

     Produces a mutable tree map containing cumulative results of applying the operator going left to right, including the initial value.

     Produces a mutable tree map containing cumulative results of applying the operator going left to right, including the initial value.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     B

       the type of the elements in the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     returns

       collection with intermediate results

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
150.  def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]

     Produces a collection containing cumulative results of applying the operator going right to left.

     Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

     Note: will not terminate for infinite-sized collections.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     Example:

         List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

     B

       the type of the elements in the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     returns

       collection with intermediate results

     Definition Classes
       IterableOps
151.  def size: Int

     The size of this mutable tree map.

     The size of this mutable tree map.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this mutable tree map.

     Definition Classes
       TreeMap → IterableOnceOps
152.  def sizeCompare(that: collection.Iterable[_]): Int

     Compares the size of this mutable tree map to the size of another `Iterable`.

     Compares the size of this mutable tree map to the size of another `Iterable`.

     that

       the `Iterable` whose size is compared with this mutable tree map's size.

     returns

       A value `x` where

           x <  0       if this.size <  that.size
           x == 0       if this.size == that.size
           x >  0       if this.size >  that.size

       The method as implemented here does not call `size` directly; its running time is `O(this.size min that.size)` instead of `O(this.size + that.size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       IterableOps
153.  def sizeCompare(otherSize: Int): Int

     Compares the size of this mutable tree map to a test value.

     Compares the size of this mutable tree map to a test value.

     otherSize

       the test value that gets compared with the size.

     returns

       A value `x` where

           x <  0       if this.size <  otherSize
           x == 0       if this.size == otherSize
           x >  0       if this.size >  otherSize

       The method as implemented here does not call `size` directly; its running time is `O(size min otherSize)` instead of `O(size)`. The method should be overridden if computing `size` is cheap and `knownSize` returns `-1`.

     Definition Classes
       IterableOps
     See also

       sizeIs

154.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta.

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection has a known size Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     coll

       the collection which serves as a hint for the result's size.

     delta

       a correction to add to the `coll.size` to produce the size hint.

     Definition Classes
       Builder
155.  def sizeHint(size: Int): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called.

     Gives a hint how many elements are expected to be added when the next `result` is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     size

       the hint how many elements will be added.

     Definition Classes
       Builder
156.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection.

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     size

       the hint how many elements will be added.

     boundingColl

       the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

     Definition Classes
       Builder
157.  final def sizeIs: SizeCompareOps

     Returns a value class containing operations for comparing the size of this mutable tree map to a test value.

     Returns a value class containing operations for comparing the size of this mutable tree map to a test value.

     These operations are implemented in terms of `sizeCompare(Int)`, and allow the following more readable usages:

         this.sizeIs < size     // this.sizeCompare(size) < 0
         this.sizeIs <= size    // this.sizeCompare(size) <= 0
         this.sizeIs == size    // this.sizeCompare(size) == 0
         this.sizeIs != size    // this.sizeCompare(size) != 0
         this.sizeIs >= size    // this.sizeCompare(size) >= 0
         this.sizeIs > size     // this.sizeCompare(size) > 0

     Definition Classes
       IterableOps
     Annotations
       @inline()
158.  def slice(from: Int, until: Int): TreeMap[K, V]

     Selects an interval of elements.

     Selects an interval of elements. The returned mutable tree map is made up of all elements `x` which satisfy the invariant:

         from <= indexOf(x) < until

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     from

       the lowest index to include from this mutable tree map.

     until

       the lowest index to EXCLUDE from this mutable tree map.

     returns

       a mutable tree map containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this mutable tree map.

     Definition Classes
       IterableOps → IterableOnceOps
159.  def sliding(size: Int, step: Int): Iterator[TreeMap[K, V]]

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

     The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

     size

       the number of elements per group

     step

       the distance between the first elements of successive groups

     returns

       An iterator producing mutable tree maps of size `size`, except the last element (which may be the only element) will be smaller if there are fewer than `size` elements remaining to be grouped.

     Definition Classes
       IterableOps
     Examples:

     1. `List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))`

     ,

     2. `List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))`

     See also

       scala.collection.Iterator, method `sliding`

160.  def sliding(size: Int): Iterator[TreeMap[K, V]]

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in `grouped`.)

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in `grouped`.)

     An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

     size

       the number of elements per group

     returns

       An iterator producing mutable tree maps of size `size`, except for a non-empty collection with less than `size` elements, which returns an iterator that produces the source collection itself as its only element.

     Definition Classes
       IterableOps
     Examples:

     1. `List().sliding(2) = empty iterator`

     ,

     2. `List(1).sliding(2) = Iterator(List(1))`

     ,

     3. `List(1, 2).sliding(2) = Iterator(List(1, 2))`

     ,

     4. `List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))`

     See also

       scala.collection.Iterator, method `sliding`

161.  def sortedMapFactory: TreeMap

     The companion object of this sorted map, providing various factory methods.

     The companion object of this sorted map, providing various factory methods.

     Definition Classes
       TreeMap → SortedMap → SortedMap → SortedMapOps
     Note

       When implementing a custom collection type and refining `CC` to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

162.  final def sortedMapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]

     Similar to `mapFromIterable`, but returns a SortedMap collection type.

     Similar to `mapFromIterable`, but returns a SortedMap collection type. Note that the return type is now `CC[K2, V2]`.

     Attributes
       protected
     Definition Classes
       SortedMapOps
     Annotations
       @inline()
163.  def span(p: ((K, V)) => Boolean): (TreeMap[K, V], TreeMap[K, V])

     Splits this mutable tree map into a prefix/suffix pair according to a predicate.

     Splits this mutable tree map into a prefix/suffix pair according to a predicate.

     Note: `c span p` is equivalent to (but possibly more efficient than) `(c takeWhile p, c dropWhile p)`, provided the evaluation of the predicate `p` does not cause any side-effects.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     p

       the test predicate

     returns

       a pair consisting of the longest prefix of this mutable tree map whose elements all satisfy `p`, and the rest of this mutable tree map.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
164.  def splitAt(n: Int): (TreeMap[K, V], TreeMap[K, V])

     Splits this mutable tree map into a prefix/suffix pair at a given position.

     Splits this mutable tree map into a prefix/suffix pair at a given position.

     Note: `c splitAt n` is equivalent to (but possibly more efficient than) `(c take n, c drop n)`.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     n

       the position at which to split.

     returns

       a pair of mutable tree maps consisting of the first `n` elements of this mutable tree map, and the other elements.

     Definition Classes
       IterableOps → IterableOnceOps
165.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S with EfficientSplit

     Returns a scala.collection.Stepper for the elements of this collection.

     Returns a scala.collection.Stepper for the elements of this collection.

     The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

     The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

     - For collections of `Int`, `Short`, `Byte` or `Char`, an scala.collection.IntStepper is returned
     - For collections of `Double` or `Float`, a scala.collection.DoubleStepper is returned
     - For collections of `Long` a scala.collection.LongStepper is returned
     - For any other element type, an scala.collection.AnyStepper is returned

     Note that this method is overridden in subclasses and the return type is refined to `S with EfficientSplit`, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

     Definition Classes
       TreeMap → IterableOnce
166.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[(K, V), B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     pf

       Element transformation partial function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
167.  final def strictOptimizedConcat[B >: (K, V), C2](that: IterableOnce[B], b: Builder[B, C2]): C2

     B

       Type of elements of the resulting collections (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     that

       Elements to concatenate to this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
168.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: ((K, V)) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
169.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: ((K, V)) => IterableOnce[B]): C2

     B

       Type of elements of the resulting collection (e.g. `Int`)

     C2

       Type of the resulting collection (e.g. `List[Int]`)

     b

       Builder to use to build the resulting collection

     toIterableOnce

       Evidence that `A` can be seen as an `IterableOnce[B]`

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
170.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: ((K, V)) => B): C2

     B

       Type of elements of the resulting collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[String]`)

     b

       Builder to use to build the resulting collection

     f

       Element transformation function

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
171.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[((K, V), B), C2]): C2

     B

       Type of elements of the second collection (e.g. `String`)

     C2

       Type of the resulting collection (e.g. `List[(Int, String)]`)

     that

       Collection to zip with this collection

     b

       Builder to use to build the resulting collection

     returns

       The resulting collection

     Attributes
       protected[this]
     Definition Classes
       StrictOptimizedIterableOps
     Annotations
       @inline()
172.  def stringPrefix: String
     Attributes
       protected[this]
     Definition Classes
       SortedMap → Map → Iterable
     Annotations
       @nowarn()
173.  def subtractAll(xs: IterableOnce[K]): TreeMap.this.type

     Removes all elements produced by an iterator from this mutable tree map.

     Removes all elements produced by an iterator from this mutable tree map.

     xs

       the iterator producing the elements to remove.

     returns

       the mutable tree map itself

     Definition Classes
       Shrinkable
174.  def subtractOne(elem: K): TreeMap.this.type

     Removes a single element from this mutable tree map.

     Removes a single element from this mutable tree map.

     elem

       the element to remove.

     returns

       the mutable tree map itself

     Definition Classes
       TreeMap → Shrinkable
175.  def sum[B >: (K, V)](implicit num: math.Numeric[B]): B

     Sums up the elements of this collection.

     Sums up the elements of this collection.

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the `+` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `+` operator to be used in forming the sum.

     returns

       the sum of all elements of this mutable tree map with respect to the `+` operator in `num`.

     Definition Classes
       IterableOnceOps
176.  final def synchronized[T0](arg0: => T0): T0

     Executes the code in `body` with an exclusive lock on `this`.

     Executes the code in `body` with an exclusive lock on `this`.

     returns

       the result of `body`

     Definition Classes
       AnyRef
177.  def tail: TreeMap[K, V]

     The rest of the collection without its first element.

     The rest of the collection without its first element.

     Definition Classes
       IterableOps
178.  def tails: Iterator[TreeMap[K, V]]

     Iterates over the tails of this mutable tree map.

     Iterates over the tails of this mutable tree map. The first value will be this mutable tree map and the final one will be an empty mutable tree map, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this mutable tree map

     Definition Classes
       IterableOps
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

179.  def take(n: Int): TreeMap[K, V]

     Selects the first n elements.

     Selects the first n elements.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     n

       the number of elements to take from this mutable tree map.

     returns

       a mutable tree map consisting only of the first `n` elements of this mutable tree map, or else the whole mutable tree map, if it has less than `n` elements. If `n` is negative, returns an empty mutable tree map.

     Definition Classes
       IterableOps → IterableOnceOps
180.  def takeRight(n: Int): TreeMap[K, V]

     A collection containing the last `n` elements of this collection.

     A collection containing the last `n` elements of this collection.

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     n

       the number of elements to take from this mutable tree map.

     returns

       a mutable tree map consisting only of the last `n` elements of this mutable tree map, or else the whole mutable tree map, if it has less than `n` elements. If `n` is negative, returns an empty mutable tree map.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
181.  def takeWhile(p: ((K, V)) => Boolean): TreeMap[K, V]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     p

       The predicate used to test elements.

     returns

       the longest prefix of this mutable tree map whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableOps → IterableOnceOps
182.  def tapEach[U](f: ((K, V)) => U): TreeMap[K, V]

     Applies a side-effecting function to each element in this collection.

     Applies a side-effecting function to each element in this collection. Strict collections will apply `f` to their elements immediately, while lazy collections like Views and LazyLists will only apply `f` on each element if and when that element is evaluated, and each time that element is evaluated.

     U

       the return type of f

     f

       a function to apply to each element in this mutable tree map

     returns

       The same logical collection as this

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
183.  def to[C1](factory: Factory[(K, V), C1]): C1

     Given a collection factory `factory`, convert this collection to the appropriate representation for the current element type `A`.

     Given a collection factory `factory`, convert this collection to the appropriate representation for the current element type `A`. Example uses:

     xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

     Definition Classes
       IterableOnceOps
184.  def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

     Convert collection to array.

     Convert collection to array.

     Implementation note: DO NOT call Array.from from this method.

     Definition Classes
       IterableOnceOps
185.  final def toBuffer[B >: (K, V)]: Buffer[B]
     Definition Classes
       IterableOnceOps
     Annotations
       @inline()
186.  def toIndexedSeq: immutable.IndexedSeq[(K, V)]
     Definition Classes
       IterableOnceOps
187.  def toList: immutable.List[(K, V)]
     Definition Classes
       IterableOnceOps
188.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
     Definition Classes
       IterableOnceOps
189.  def toSeq: immutable.Seq[(K, V)]

     returns

       This collection as a `Seq[A]`. This is equivalent to `to(Seq)` but might be faster.

     Definition Classes
       IterableOnceOps
190.  def toSet[B >: (K, V)]: immutable.Set[B]
     Definition Classes
       IterableOnceOps
191.  def toString(): String

     Creates a String representation of this object.

     Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

     returns

       a String representation of the object.

     Definition Classes
       Map → Function1 → Iterable → AnyRef → Any
192.  def toVector: immutable.Vector[(K, V)]
     Definition Classes
       IterableOnceOps
193.  def transpose[B](implicit asIterable: ((K, V)) => collection.Iterable[B]): Iterable[Iterable[B]]

     Transposes this mutable tree map of iterable collections into a mutable tree map of mutable tree maps.

     Transposes this mutable tree map of iterable collections into a mutable tree map of mutable tree maps.

     The resulting collection's type will be guided by the static type of mutable tree map. For example:

         val xs = List(
                    Set(1, 2, 3),
                    Set(4, 5, 6)).transpose
         // xs == List(
         //         List(1, 4),
         //         List(2, 5),
         //         List(3, 6))

         val ys = Vector(
                    List(1, 2, 3),
                    List(4, 5, 6)).transpose
         // ys == Vector(
         //         Vector(1, 4),
         //         Vector(2, 5),
         //         Vector(3, 6))

     Note: Even when applied to a view or a lazy collection it will always force the elements.

     B

       the type of the elements of each iterable collection.

     asIterable

       an implicit conversion which asserts that the element type of this mutable tree map is an `Iterable`.

     returns

       a two-dimensional mutable tree map of mutable tree maps which has as nth row the nth column of this mutable tree map.

     Definition Classes
       IterableOps
     Exceptions thrown

       `IllegalArgumentException` if all collections in this mutable tree map are not of the same size.

194.  def unapply(a: K): Option[V]

     Tries to extract a `B` from an `A` in a pattern matching expression.

     Tries to extract a `B` from an `A` in a pattern matching expression.

     Definition Classes
       PartialFunction
195.  def unlift: PartialFunction[K, B]

     Converts an optional function to a partial function.

     Converts an optional function to a partial function.

     Implicit
       This member is added by an implicit conversion from TreeMap[K, V] toUnliftOps[K, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if V is a subclass of Option[B] (V <: Option[B]).
     Definition Classes
       UnliftOps
     Example:

     1. Unlike Function.unlift, this UnliftOps.unlift method can be used in extractors.

            val of: Int => Option[String] = { i =>
              if (i == 2) {
                Some("matched by an optional function")
              } else {
                None
              }
            }

            util.Random.nextInt(4) match {
              case of.unlift(m) => // Convert an optional function to a pattern
                println(m)
              case _ =>
                println("Not matched")
            }

196.  def unsorted: Map[K, V]
     Definition Classes
       SortedMap → SortedMapOps → SortedMap → SortedMapOps
197.  def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])

     Converts this mutable tree map of pairs into two collections of the first and second half of each pair.

     Converts this mutable tree map of pairs into two collections of the first and second half of each pair.

         val xs = mutable.TreeMap(
                    (1, "one"),
                    (2, "two"),
                    (3, "three")).unzip
         // xs == (mutable.TreeMap(1, 2, 3),
         //        mutable.TreeMap(one, two, three))

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

       an implicit conversion which asserts that the element type of this mutable tree map is a pair.

     returns

       a pair of mutable tree maps, containing the first, respectively second half of each element pair of this mutable tree map.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
198.  def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

     Converts this mutable tree map of triples into three collections of the first, second, and third element of each triple.

     Converts this mutable tree map of triples into three collections of the first, second, and third element of each triple.

         val xs = mutable.TreeMap(
                    (1, "one", '1'),
                    (2, "two", '2'),
                    (3, "three", '3')).unzip3
         // xs == (mutable.TreeMap(1, 2, 3),
         //        mutable.TreeMap(one, two, three),
         //        mutable.TreeMap(1, 2, 3))

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

       an implicit conversion which asserts that the element type of this mutable tree map is a triple.

     returns

       a triple of mutable tree maps, containing the first, second, respectively third member of each element triple of this mutable tree map.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
199.  def update(key: K, value: V): Unit

     Adds a new key/value pair to this map.

     Adds a new key/value pair to this map. If the map already contains a mapping for the key, it will be overridden by the new value.

     key

       The key to update

     value

       The new value

     Definition Classes
       MapOps
200.  def updateWith(key: K)(remappingFunction: (Option[V]) => Option[V]): Option[V]

     Update a mapping for the specified key and its current optionally-mapped value (`Some` if there is current mapping, `None` if not).

     Update a mapping for the specified key and its current optionally-mapped value (`Some` if there is current mapping, `None` if not).

     If the remapping function returns `Some(v)`, the mapping is updated with the new value `v`. If the remapping function returns `None`, the mapping is removed (or remains absent if initially absent). If the function itself throws an exception, the exception is rethrown, and the current mapping is left unchanged.

     key

       the key value

     remappingFunction

       a partial function that receives current optionally-mapped value and return a new mapping

     returns

       the new value associated with the specified key

     Definition Classes
       MapOps
201.  def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S with EfficientSplit

     Returns a Stepper for the values of this map.

     Returns a Stepper for the values of this map. See method stepper.

     Definition Classes
       TreeMap → MapOps
202.  def values: collection.Iterable[V]

     Collects all values of this map in an iterable collection.

     Collects all values of this map in an iterable collection.

     returns

       the values of this map as an iterable.

     Definition Classes
       MapOps
203.  def valuesIterator: Iterator[V]

     Creates an iterator for all values in this map.

     Creates an iterator for all values in this map.

     returns

       an iterator over all values that are associated with some key in this map.

     Definition Classes
       TreeMap → MapOps
204.  def valuesIteratorFrom(start: K): Iterator[V]

     Creates an iterator over all the values contained in this map that are associated with a key greater than or equal to `start` according to the ordering of this map.

     Creates an iterator over all the values contained in this map that are associated with a key greater than or equal to `start` according to the ordering of this map. x.valuesIteratorFrom(y) is equivalent to but often more efficient than x.from(y).valuesIterator.

     start

       The lower bound (inclusive) on the keys to be returned

     Definition Classes
       TreeMap → SortedMapOps
205.  def view: MapView[K, V]

     A view over the elements of this collection.

     A view over the elements of this collection.

     Definition Classes
       MapOps → IterableOps
206.  final def wait(): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

207.  final def wait(arg0: Long, arg1: Int): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException])
     Note

       not specified by SLS as a member of AnyRef

208.  final def wait(arg0: Long): Unit

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

     See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

     Definition Classes
       AnyRef
     Annotations
       @throws(classOf[java.lang.InterruptedException]) @native()
     Note

       not specified by SLS as a member of AnyRef

209.  def withDefault(d: (K) => V): SortedMap[K, V]

     The same sorted map with a given default function.

     The same sorted map with a given default function. Note: The default is only used for `apply`. Other methods like `get`, `contains`, `iterator`, `keys`, etc. are not affected by `withDefault`.

     Invoking transformer methods (e.g. `map`) will not preserve the default value.

     d

       the function mapping keys to values, used for non-present keys

     returns

       a wrapper of the map with a default value

     Definition Classes
       SortedMap → Map
210.  def withDefaultValue(d: V): SortedMap[K, V]

     The same map with a given default value.

     The same map with a given default value. Note: The default is only used for `apply`. Other methods like `get`, `contains`, `iterator`, `keys`, etc. are not affected by `withDefaultValue`.

     Invoking transformer methods (e.g. `map`) will not preserve the default value.

     d

       default value used for non-present keys

     returns

       a wrapper of the map with a default value

     Definition Classes
       SortedMap → Map
211.  def withFilter(p: ((K, V)) => Boolean): SortedMapOps.WithFilter[K, V, [x]Iterable[x], [x, y]Map[x, y], [x, y]TreeMap[x, y]]

     Creates a non-strict filter of this mutable tree map.

     Creates a non-strict filter of this mutable tree map.

     Note: the difference between `c filter p` and `c withFilter p` is that the former creates a new collection, whereas the latter only restricts the domain of subsequent `map`, `flatMap`, `foreach`, and `withFilter` operations.

     Note: might return different results for different runs, unless the underlying collection type is ordered.

     p

       the predicate used to test elements.

     returns

       an object of class `WithFilter`, which supports `map`, `flatMap`, `foreach`, and `withFilter` operations. All these operations apply to those elements of this mutable tree map which satisfy the predicate `p`.

     Definition Classes
       SortedMapFactoryDefaults → IterableOps
212.  def writeReplace(): AnyRef
     Attributes
       protected[this]
     Definition Classes
       DefaultSerializable
213.  def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]

     Returns a mutable tree map formed from this mutable tree map and another iterable collection by combining corresponding elements in pairs.

     Returns a mutable tree map formed from this mutable tree map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

       a new mutable tree map containing pairs consisting of corresponding elements of this mutable tree map and `that`. The length of the returned collection is the minimum of the lengths of this mutable tree map and `that`.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps
214.  def zipAll[A1 >: (K, V), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]

     Returns a mutable tree map formed from this mutable tree map and another iterable collection by combining corresponding elements in pairs.

     Returns a mutable tree map formed from this mutable tree map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

     that

       the iterable providing the second half of each result pair

     thisElem

       the element to be used to fill up the result if this mutable tree map is shorter than `that`.

     thatElem

       the element to be used to fill up the result if `that` is shorter than this mutable tree map.

     returns

       a new collection of type `That` containing pairs consisting of corresponding elements of this mutable tree map and `that`. The length of the returned collection is the maximum of the lengths of this mutable tree map and `that`. If this mutable tree map is shorter than `that`, `thisElem` values are used to pad the result. If `that` is shorter than this mutable tree map, `thatElem` values are used to pad the result.

     Definition Classes
       IterableOps
215.  def zipWithIndex: Iterable[((K, V), Int)]

     Zips this mutable tree map with its indices.

     Zips this mutable tree map with its indices.

     returns

       A new mutable tree map containing pairs consisting of all elements of this mutable tree map paired with their index. Indices start at `0`.

     Definition Classes
       StrictOptimizedIterableOps → IterableOps → IterableOnceOps
     Example:

     1. `List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))`

### Shadowed Implicit Value Members

1.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from TreeMap[K, V] toany2stringadd[TreeMap[K, V]] performed by method any2stringadd in scala.Predef.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (treeMap: any2stringadd[TreeMap[K, V]]).+(other)

   Definition Classes
     any2stringadd

### Deprecated Value Members

1.  def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): TreeMap[K, V1]
   Definition Classes
     StrictOptimizedSortedMapOps → StrictOptimizedMapOps → SortedMapOps → MapOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

2.  def +[V1 >: V](kv: (K, V1)): TreeMap[K, V1]
   Definition Classes
     SortedMapOps → MapOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Consider requiring an immutable Map or fall back to Map.concat

3.  def ++:[V1 >: V](that: IterableOnce[(K, V1)]): Map[K, V1]
   Definition Classes
     MapOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

4.  def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
   Definition Classes
     IterableOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

5.  final def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): TreeMap.this.type

   Adds two or more elements to this mutable tree map.

   Adds two or more elements to this mutable tree map.

   elem1

     the first element to add.

   elem2

     the second element to add.

   elems

     the remaining elements to add.

   returns

     the mutable tree map itself

   Definition Classes
     Growable
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated

6.  final def -(key1: K, key2: K, keys: K*): TreeMap[K, V]
   Definition Classes
     MapOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use -- or removeAll on an immutable Map

7.  final def -(key: K): TreeMap[K, V]
   Definition Classes
     MapOps
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.0) Use - or remove on an immutable Map

8.  def --(keys: IterableOnce[K]): TreeMap[K, V]
   Definition Classes
     MapOps
   Annotations
     @deprecated @inline()
   Deprecated

     (Since version 2.13.0) Consider requiring an immutable Map.

9.  def -=(elem1: K, elem2: K, elems: K*): TreeMap.this.type

   Removes two or more elements from this mutable tree map.

   Removes two or more elements from this mutable tree map.

   elem1

     the first element to remove.

   elem2

     the second element to remove.

   elems

     the remaining elements to remove.

   returns

     the mutable tree map itself

   Definition Classes
     Shrinkable
   Annotations
     @deprecated
   Deprecated

     (Since version 2.13.3) Use `--=` aka `subtractAll` instead of varargs `-=`; infix operations with an operand of multiple args will be deprecated

10.  def /:[B](z: B)(op: (B, (K, V)) => B): B
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)])./:(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldLeft instead

11.  final def /:[B](z: B)(op: (B, (K, V)) => B): B
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use foldLeft instead of /:

12.  def :\[B](z: B)(op: ((K, V), B) => B): B
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).:\(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldRight instead

13.  final def :\[B](z: B)(op: ((K, V), B) => B): B
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use foldRight instead of :\

14.  def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.

15.  def collectFirst[B](f: PartialFunction[(K, V), B]): Option[B]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).collectFirst(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.collectFirst(...) instead

16.  def companion: IterableFactory[[_]Iterable[_]]
    Definition Classes
      IterableOps
    Annotations
      @deprecated @deprecatedOverriding() @inline()
    Deprecated

      (Since version 2.13.0) Use iterableFactory instead

17.  def compare(k0: K, k1: K): Int

    Comparison function that orders keys.

    Comparison function that orders keys.

    Definition Classes
      SortedOps
    Annotations
      @deprecated @deprecatedOverriding() @inline()
    Deprecated

      (Since version 2.13.0) Use ordering.compare instead

18.  def copyToBuffer(dest: Buffer[(K, V)]): Unit
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).copyToBuffer(dest)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

19.  final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use `dest ++= coll` instead

20.  def count(f: ((K, V)) => Boolean): Int
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).count(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.count(...) instead

21.  def exists(f: ((K, V)) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).exists(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.exists(...) instead

22.  def filter(f: ((K, V)) => Boolean): Iterator[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).filter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.filter(...) instead

23.  def filterKeys(p: (K) => Boolean): MapView[K, V]

    Filters this map by retaining only keys satisfying a predicate.

    Filters this map by retaining only keys satisfying a predicate.

    p

      the predicate used to test keys

    returns

      an immutable map consisting only of those key value pairs of this map where the key satisfies the predicate `p`. The resulting map wraps the original map without copying any elements.

    Definition Classes
      MapOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .view.filterKeys(f). A future version will include a strict version of this method (for now, .view.filterKeys(p).toMap).

24.  def find(p: ((K, V)) => Boolean): Option[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).find(p)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.find instead

25.  def flatMap[B](f: ((K, V)) => IterableOnce[B]): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).flatMap(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

26.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).fold(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.fold instead

27.  def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).foldLeft(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldLeft instead

28.  def foldRight[B](z: B)(op: ((K, V), B) => B): B
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).foldRight(z)(op)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foldRight instead

29.  def forall(f: ((K, V)) => Boolean): Boolean
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).forall(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.forall(...) instead

30.  def foreach[U](f: ((K, V)) => U): Unit
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).foreach(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.foreach(...) instead

31.  def formatted(fmtstr: String): String

    Returns string formatted according to given `format` string.

    Returns string formatted according to given `format` string. Format strings are as for `String.format` (@see java.lang.String.format).

    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toStringFormat[TreeMap[K, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.12.16) Use `formatString.format(value)` instead of `value.formatted(formatString)`, or use the `f""` string interpolator. In Java 15 and later, `formatted` resolves to the new method in String which has reversed parameters.

32.  final def from(from: K): TreeMap[K, V]

    Creates a ranged projection of this collection with no upper-bound.

    Creates a ranged projection of this collection with no upper-bound.

    from

      The lower-bound (inclusive) of the ranged projection.

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeFrom

33.  def hasDefiniteSize: Boolean

    Tests whether this mutable tree map is known to have a finite size.

    Tests whether this mutable tree map is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as `Stream`, the predicate returns `true` if all elements have been computed. It returns `false` if the stream is not yet evaluated to the end. Non-empty Iterators usually return `false` even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that `hasDefiniteSize` returns `true`. However, checking `hasDefiniteSize` can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

      `true` if this collection is known to have finite size, `false` otherwise.

    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

      method `knownSize` for a more useful alternative

34.  def isEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).isEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.isEmpty instead

35.  def map[B](f: ((K, V)) => B): IterableOnce[B]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).map(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

36.  def mapValues[W](f: (V) => W): MapView[K, W]

    Transforms this map by applying a function to every retrieved value.

    Transforms this map by applying a function to every retrieved value.

    f

      the function used to transform values of this map.

    returns

      a map view which maps every key of this map to `f(this(key))`. The resulting map wraps the original map without copying any elements.

    Definition Classes
      MapOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .view.mapValues(f). A future version will include a strict version of this method (for now, .view.mapValues(f).toMap).

37.  def max(implicit ord: math.Ordering[(K, V)]): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).max(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.max instead

38.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).maxBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.maxBy(...) instead

39.  def min(implicit ord: math.Ordering[(K, V)]): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).min(ord)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.min instead

40.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).minBy(f)(cmp)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.minBy(...) instead

41.  def mkString: String
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).mkString

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

42.  def mkString(sep: String): String
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).mkString(sep)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

43.  def mkString(start: String, sep: String, end: String): String
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).mkString(start, sep, end)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.mkString instead

44.  def nonEmpty: Boolean
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).nonEmpty

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.nonEmpty instead

45.  def product(implicit num: math.Numeric[(K, V)]): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).product(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.product instead

46.  def reduce(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).reduce(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduce(...) instead

47.  def reduceLeft(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).reduceLeft(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

48.  def reduceLeftOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).reduceLeftOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

49.  def reduceOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).reduceOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceOption(...) instead

50.  def reduceRight(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).reduceRight(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRight(...) instead

51.  def reduceRightOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).reduceRightOption(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

52.  final def repr: TreeMap[K, V]
    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

53.  final def retain(p: (K, V) => Boolean): TreeMap.this.type
    Definition Classes
      MapOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use filterInPlace instead

54.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sameElements instead

55.  def seq: TreeMap.this.type
    Definition Classes
      Iterable
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Iterable.seq always returns the iterable itself

56.  def size: Int
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).size

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.size instead

57.  def sum(implicit num: math.Numeric[(K, V)]): (K, V)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).sum(num)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.sum instead

58.  def to[C1](factory: Factory[(K, V), C1]): C1
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).to(factory)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(factory) instead

59.  final def to(to: K): TreeMap[K, V]

    Create a range projection of this collection with no lower-bound.

    Create a range projection of this collection with no lower-bound.

    to

      The upper-bound (inclusive) of the ranged projection.

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeTo

60.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toArray(arg0)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toArray

61.  def toBuffer[B >: A]: Buffer[B]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toBuffer

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

62.  def toIndexedSeq: collection.IndexedSeq[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toIndexedSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.toIndexedSeq instead

63.  final def toIterable: collection.Iterable[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toIterable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

64.  final def toIterable: TreeMap.this.type

    returns

      This collection as an `Iterable[A]`. No new collection will be built if `this` is already an `Iterable[A]`.

    Definition Classes
      Iterable → IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

65.  def toIterator: Iterator[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toIterator

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead

66.  final def toIterator: Iterator[(K, V)]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator instead of .toIterator

67.  def toList: immutable.List[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toList

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(List) instead

68.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toMap(ev)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Map) instead

69.  def toSeq: immutable.Seq[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toSeq

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Seq) instead

70.  def toSet[B >: A]: immutable.Set[B]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toSet

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Set) instead

71.  def toStream: immutable.Stream[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toStream

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(LazyList) instead

72.  final def toStream: immutable.Stream[(K, V)]
    Definition Classes
      IterableOnceOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .to(LazyList) instead of .toStream

73.  final def toTraversable: collection.Traversable[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toTraversable

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Iterable) instead

74.  final def toTraversable: collection.Traversable[(K, V)]

    Converts this mutable tree map to an unspecified Iterable.

    Converts this mutable tree map to an unspecified Iterable. Will return the same collection if this instance is already Iterable.

    returns

      An Iterable containing all elements of this mutable tree map.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn't copy non-immutable collections

75.  def toVector: immutable.Vector[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).toVector

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use .iterator.to(Vector) instead

76.  final def transform(f: (K, V) => V): TreeMap.this.type
    Definition Classes
      MapOps
    Annotations
      @deprecated @inline()
    Deprecated

      (Since version 2.13.0) Use mapValuesInPlace instead

77.  final def until(until: K): TreeMap[K, V]

    Creates a ranged projection of this collection with no lower-bound.

    Creates a ranged projection of this collection with no lower-bound.

    until

      The upper-bound (exclusive) of the ranged projection.

    Definition Classes
      SortedOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use rangeUntil

78.  def updated[V1 >: V](key: K, value: V1): TreeMap[K, V1]
    Definition Classes
      SortedMapOps → MapOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use m.clone().addOne((k,v)) instead of m.updated(k, v)

79.  def view(from: Int, until: Int): View[(K, V)]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
      IterableOps
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

80.  def withFilter(f: ((K, V)) => Boolean): Iterator[(K, V)]
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
      This implicitly inherited member is shadowed by one or more members in this class.
      To access this member you can use a type ascription:

          (treeMap: IterableOnceExtensionMethods[(K, V)]).withFilter(f)

    Definition Classes
      IterableOnceExtensionMethods
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use .iterator.withFilter(...) instead

81.  def →[B](y: B): (TreeMap[K, V], B)
    Implicit
      This member is added by an implicit conversion from TreeMap[K, V] toArrowAssoc[TreeMap[K, V]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if V is a subclass of Option[Nothing] (V <: Option[Nothing]).
    Definition Classes
      ArrowAssoc
    Annotations
      @deprecated
    Deprecated

      (Since version 2.13.0) Use `->` instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

### Inherited from DefaultSerializable

### Inherited from java.io.Serializable

### Inherited from StrictOptimizedSortedMapOps[K, V, TreeMap, TreeMap[K, V]]

### Inherited from StrictOptimizedMapOps[K, V, [_, _]Map[_, _], TreeMap[K, V]]

### Inherited from StrictOptimizedIterableOps[(K, V), [_]Iterable[_], TreeMap[K, V]]

### Inherited from SortedMap[K, V]

### Inherited from SortedMapOps[K, V, [X, Y]TreeMap[X, Y], TreeMap[K, V]]

### Inherited from collection.SortedMap[K, V]

### Inherited from SortedMapFactoryDefaults[K, V, [x, y]TreeMap[x, y], [x]Iterable[x], [x, y]Map[x, y]]

### Inherited from collection.SortedMapOps[K, V, [X, Y]TreeMap[X, Y], TreeMap[K, V]]

### Inherited from SortedOps[K, TreeMap[K, V]]

### Inherited from AbstractMap[K, V]

### Inherited from Map[K, V]

### Inherited from MapOps[K, V, Map, TreeMap[K, V]]

### Inherited from Shrinkable[K]

### Inherited from Builder[(K, V), TreeMap[K, V]]

### Inherited from Growable[(K, V)]

### Inherited from Clearable

### Inherited from Cloneable[TreeMap[K, V]]

### Inherited from java.lang.Cloneable

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

### Inherited from collection.AbstractMap[K, V]

### Inherited from collection.Map[K, V]

### Inherited from Equals

### Inherited from MapFactoryDefaults[K, V, [x, y]Map[x, y], [x]Iterable[x]]

### Inherited from collection.MapOps[K, V, [_, _]Map[_, _], TreeMap[K, V]]

### Inherited from PartialFunction[K, V]

### Inherited from (K) => V

### Inherited from collection.AbstractIterable[(K, V)]

### Inherited from collection.Iterable[(K, V)]

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

### Inherited from IterableOps[(K, V), [_]Iterable[_], TreeMap[K, V]]

### Inherited from IterableOnceOps[(K, V), [_]Iterable[_], TreeMap[K, V]]

### Inherited from IterableOnce[(K, V)]

### Inherited from AnyRef

### Inherited from Any

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

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

### Inherited by implicit conversion any2stringadd fromTreeMap[K, V] to any2stringadd[TreeMap[K, V]]

### Inherited by implicit conversion StringFormat fromTreeMap[K, V] to StringFormat[TreeMap[K, V]]

### Inherited by implicit conversion Ensuring fromTreeMap[K, V] to Ensuring[TreeMap[K, V]]

### Inherited by implicit conversion ArrowAssoc fromTreeMap[K, V] to ArrowAssoc[TreeMap[K, V]]

### Ungrouped