scala.collection.immutable

TreeMap

class TreeMap[A, +B] extends RedBlack[A] with SortedMap[A, B] with SortedMapLike[A, B, TreeMap[A, B]] with MapLike[A, B, TreeMap[A, B]]

This class implements immutable maps using a tree.

Go to: companion

Inherits

  1. SortedMap
  2. SortedMap
  3. SortedMapLike
  4. Sorted
  5. Map
  6. MapLike
  7. Map
  8. MapLike
  9. Subtractable
  10. PartialFunction
  11. Function1
  12. Iterable
  13. Iterable
  14. IterableLike
  15. Equals
  16. Traversable
  17. Immutable
  18. Traversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. HasNewBuilder
  22. RedBlack
  23. AnyRef
  24. Any

Type Members

  1. class BlackTree[+B](key: A, value: B, left: Tree[B], right: Tree[B]) extends NonEmpty[B] with Product

  2. class NonEmpty[+B] extends Tree[B]

  3. class RedTree[+B](key: A, value: B, left: Tree[B], right: Tree[B]) extends NonEmpty[B] with Product

  4. class Tree[+B] extends AnyRef

  5. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): TreeMap[A, B1]

    Adds two or more elements to this collection and returns either the collection itself (if it is mutable), or a new collection with the added elements

    Adds two or more elements to this collection and returns either the collection itself (if it is mutable), or a new collection with the added elements.

    B1

    the type of the added values

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new map with the given bindings added to this map

    Go to: companion
  2. def +[B1 >: B](kv: (A, B1)): TreeMap[A, B1]

    Add a key/value pair to this map

    Add a key/value pair to this map.

    B1

    the type of the value in the key/value pair.

    kv

    the key/value pair

    returns

    A new map with the new binding added to this map

    Go to: companion
  3. def ++[B1 >: B](iter: Iterator[(A, B1)]): SortedMap[A, B1]

    Adds a number of elements provided by an iterator and returns a new collection with the added elements

    Adds a number of elements provided by an iterator and returns a new collection with the added elements.

    B1

    the type of the added values

    iter

    the iterator

    returns

    a new map with the given bindings added to this map

    definition classes: SortedMapMapLikeMapLike
    Go to: companion
  4. def ++[B1 >: B](elems: Traversable[(A, B1)]): SortedMap[A, B1]

    Adds a number of elements provided by a traversable object and returns a new collection with the added elements

    Adds a number of elements provided by a traversable object and returns a new collection with the added elements.

    B1

    the type of the added values

    elems

    the traversable object.

    returns

    a new map with the given bindings added to this map

    definition classes: SortedMapMapLikeMapLike
    Go to: companion
  5. def ++(that: Iterator[(A, B)]): Map[(A, B)]

    [use case] Concatenates this map with the elements of an iterator

    [use case]

    Concatenates this map with the elements of an iterator.

    that

    the iterator to append.

    returns

    a new map which contains all elements of this map followed by all elements of that.

    attributes: abstract
    Go to: companion
  6. def ++[B >: (A, B), That](that: Iterator[B])(bf: CanBuildFrom[TreeMap[A, B], B, That]): That

    Concatenates this map with the elements of an iterator

    Concatenates this map with the elements of an iterator.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the iterator to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this map followed by all elements of that.

    definition classes: TraversableLike
    Go to: companion
  7. def ++(that: Traversable[(A, B)]): Map[(A, B)]

    [use case] Concatenates this map with the elements of a traversable collection

    [use case]

    Concatenates this map with the elements of a traversable collection.

    that

    the traversable to append.

    returns

    a new map which contains all elements of this map followed by all elements of that.

    attributes: abstract
    Go to: companion
  8. def ++[B >: (A, B), That](that: Traversable[B])(bf: CanBuildFrom[TreeMap[A, B], B, That]): That

    Concatenates this map with the elements of a traversable collection

    Concatenates this map with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this map followed by all elements of that.

    definition classes: TraversableLike
    Go to: companion
  9. def -(key: A): Map[A, B]

    [use case] Removes a key from this map, returning a new map

    [use case]

    Removes a key from this map, returning a new map.

    key

    the key to be removed

    returns

    a new map without a binding for key

    attributes: abstract
    Go to: companion
  10. def -(key: A): TreeMap[A, B]

    Removes a key from this map, returning a new map

    Removes a key from this map, returning a new map.

    key

    the key to be removed

    returns

    a new map without a binding for key

    Go to: companion
  11. def -(elem1: A, elem2: A, elems: A*): TreeMap[A, B]

    Creates a new map from this map with some elements removed

    Creates a new map from this map with some elements removed.

    This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new map that contains all elements of the current map except one less occurrence of each of the given elements.

    definition classes: Subtractable
    Go to: companion
  12. def --(iter: Iterator[A]): TreeMap[A, B]

    Creates a new map from this map by removing all elements produced by an iterator

    Creates a new map from this map by removing all elements produced by an iterator.

    iter

    the iterator producing the removed elements.

    returns

    a new map that contains all elements of the current map except one less occurrence of each of the elements produced by iter.

    definition classes: Subtractable
    Go to: companion
  13. def --(elems: Traversable[A]): TreeMap[A, B]

    Creates a new map from this map by removing all elements of another collection

    Creates a new map from this map by removing all elements of another collection.

    elems

    the collection containing the removed elements.

    returns

    a new map that contains all elements of the current map except one less occurrence of each of the elements of elems.

    definition classes: Subtractable
    Go to: companion
  14. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

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

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    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 map$, going left to right with the start value z on the left: {{{ op(...op(op(z, x1), x2), ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this map.

    definition classes: TraversableLike
    Go to: companion
  15. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

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

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    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 map$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this map.

    definition classes: TraversableLike
    Go to: companion
  16. object Empty extends Tree[Nothing] with Product

  17. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all bindings of this map to a string builder using start, end, and separator strings

    Appends all bindings of this 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 of all bindings of this map in the form of key -> value are separated by the string sep.

    b

    the builder to which strings are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: MapLikeTraversableLike
    Go to: companion
  18. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this map to a string builder

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
    Go to: companion
  19. def addString(b: StringBuilder, sep: String): StringBuilder

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

    Appends all elements of this 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 map, separated by the string sep.

    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: TraversableLike
    Go to: companion
  20. def andThen[C](k: (B) ⇒ C): PartialFunction[A, 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.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
    Go to: companion
  21. def apply(key: A): B

    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: MapLikeFunction1
    Go to: companion
  22. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this map should be compared

    returns

    true, if this map can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
    Go to: companion
  23. def companion: GenericCompanion[Iterable[A][A]]

    The factory companion object that builds instances of class Map

    The factory companion object that builds instances of class Map.

    Go to: companion
  24. def compare(k0: A, k1: A): Int

    Comparison function that orders keys

    Comparison function that orders keys.

    Go to: companion
  25. def compose[A](g: (A) ⇒ A): (A) ⇒ B

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
    Go to: companion
  26. def contains(key: A): 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: MapLike
    Go to: companion
  27. def copyToArray(xs: Array[(A, B)], start: Int, len: Int): Unit

    [use case] Copies elements of this map to an array

    [use case]

    Copies elements of this map to an array. Fills the given array xs with at most len elements of this map, starting at position start. Copying will stop once either the end of the current map is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    attributes: abstract
    Go to: companion
  28. def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this map to an array

    Copies elements of this map to an array. Fills the given array xs with at most len elements of this map, starting at position start. Copying will stop once either the end of the current map is reached, 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.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  29. def copyToArray(xs: Array[(A, B)], start: Int): Unit

    [use case] Copies elements of this map to an array

    [use case]

    Copies elements of this map to an array. Fills the given array xs with all elements of this map, starting at position 0. Copying will stop once either the end of the current map is reached, or the end of the array is reached.

    xs

    the array to fill.

    attributes: abstract
    Go to: companion
  30. def copyToArray[B >: (A, B)](xs: Array[B]): Unit

    Copies elements of this map to an array

    Copies elements of this map to an array. Fills the given array xs with all elements of this map, starting at position 0. Copying will stop once either the end of the current map is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
    Go to: companion
  31. def copyToArray(xs: Array[(A, B)], start: Int): Unit

    [use case] Copies elements of this map to an array

    [use case]

    Copies elements of this map to an array. Fills the given array xs with all elements of this map, starting at position start. Copying will stop once either the end of the current map is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    attributes: abstract
    Go to: companion
  32. def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit

    Copies elements of this map to an array

    Copies elements of this map to an array. Fills the given array xs with all elements of this map, starting at position start. Copying will stop once either the end of the current map is reached, 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.

    definition classes: TraversableLike
    Go to: companion
  33. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit

    Copies all elements of this map to a buffer

    Copies all elements of this map to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
    Go to: companion
  34. def count(p: ((A, B)) ⇒ Boolean): Int

    Counts the number of elements in the map which satisfy a predicate

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableLike
    Go to: companion
  35. def default(key: A): B

    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: MapLike
    Go to: companion
  36. def drop(n: Int): TreeMap[A, B]

    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 map.

    returns

    a map consisting of all elements of this map except the first n ones, or else the empty map, if this map has less than n elements.

    definition classes: TraversableLike
    Go to: companion
  37. def dropRight(n: Int): TreeMap[A, B]

    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 take

    returns

    a map consisting of all elements of this map except the first n ones, or else the empty map, if this map has less than n elements.

    definition classes: IterableLike
    Go to: companion
  38. def dropWhile(p: ((A, B)) ⇒ Boolean): TreeMap[A, B]

    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 map whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
    Go to: companion
  39. def elements: Iterator[(A, B)]

  40. def empty: TreeMap[A, B]

    A factory to create empty maps of the same type of keys

    A factory to create empty maps of the same type of keys.

    Go to: companion
  41. def equals(that: Any): Boolean

    Compares two maps structurally; i

    Compares two maps structurally; i.e. checks if all mappings contained in this map are also contained in the other map, and vice versa.

    that

    the other map

    returns

    true if both maps contain exactly the same mappings, false otherwise.

    definition classes: MapLikeEquals ⇐ AnyRef ⇐ Any
    Go to: companion
  42. def exists(p: ((A, B)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this map

    Tests whether a predicate holds for some of the elements of this map.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this map, otherwise false.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  43. def filter(p: ((A, B)) ⇒ Boolean): TreeMap[A, B]

    Selects all elements of this map which satisfy a predicate

    Selects all elements of this map which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
    Go to: companion
  44. def filterKeys(p: (A) ⇒ Boolean): DefaultMap[A, B]

    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: MapLike
    Go to: companion
  45. def filterNot(p: ((A, B)) ⇒ Boolean): TreeMap[A, B]

    Returns a new map with all key/value pairs for which the predicate p returns true

    Returns a new map with all key/value pairs for which the predicate p returns true.

    p

    A predicate over key-value pairs

    returns

    a new map consisting of all elements of this map that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: MapLikeTraversableLike
    Go to: companion
  46. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

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

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

    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 map that satisfies p, or None if none exists.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  47. def first: (A, B)

  48. def firstKey: A

    Returns the first key of the collection

    Returns the first key of the collection.

    Go to: companion
  49. def firstOption: Option[(A, B)]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
    Go to: companion
  50. def flatMap[B](f: ((A, B)) ⇒ Traversable[B]): Map[B]

    [use case] Builds a new collection by applying a function to all elements of this map and concatenating the results

    [use case]

    Builds a new collection by applying a function to all elements of this map and concatenating the results.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    Go to: companion
  51. def flatMap[B, That](f: ((A, B)) ⇒ Traversable[B])(bf: CanBuildFrom[TreeMap[A, B], B, That]): That

    Builds a new collection by applying a function to all elements of this map and concatenating the results

    Builds a new collection by applying a function to all elements of this map and concatenating the results.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

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

    definition classes: TraversableLike
    Go to: companion
  52. def flatten[B]: Map[B]

    [use case] Converts this map of traversable collections into a map in which all element collections are concatenated

    [use case]

    Converts this map of traversable collections into a map in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

    a new map resulting from concatenating all element maps.

    attributes: abstract
    Go to: companion
  53. def flatten[B](asTraversable: ((A, B)) ⇒ Traversable[B]): Iterable[B]

    Converts this map of traversable collections into a map in which all element collections are concatenated

    Converts this map of traversable collections into a map in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this map is a Traversable.

    returns

    a new map resulting from concatenating all element maps.

    definition classes: GenericTraversableTemplate
    Go to: companion
  54. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

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

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

    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 map$, going left to right with the start value z on the left: {{{ op(...op(z, x1), x2, ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this map.

    definition classes: TraversableLike
    Go to: companion
  55. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

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

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

    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 map$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this map.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  56. def forall(p: ((A, B)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this map

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this map, otherwise false.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  57. def foreach(f: ((A, B)) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this map

    [use case]

    Applies a function f to all elements of this map.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    attributes: abstract
    Go to: companion
  58. def foreach[U](f: ((A, B)) ⇒ U): Unit

    Applies a function f to all elements of this map

    Applies a function f to all elements of this map.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    Go to: companion
  59. def from(from: A): TreeMap[A, B]

    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: Sorted
    Go to: companion
  60. def genericBuilder[B]: Builder[B, Iterable[B]]

    The generic builder that builds instances of Map at arbitrary element types

    The generic builder that builds instances of Map at arbitrary element types.

    definition classes: GenericTraversableTemplate
    Go to: companion
  61. def get(key: A): Option[B]

    Check if this map maps key to a value and return the value if it exists

    Check if this map maps key to a value and return the value if it exists.

    key

    the key of the mapping of interest

    returns

    the value of the mapping, if it exists

    Go to: companion
  62. def getOrElse(key: A, default: ⇒ B): B

    [use case] Returns the value associated with a key, or a default value if the key is not contained in the map

    [use case]

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

    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 assocuated with key if it exists, otherwise the result of the default computation.

    attributes: abstract
    Go to: companion
  63. def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

    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.

    B1

    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 assocuated with key if it exists, otherwise the result of the default computation.

    definition classes: MapLike
    Go to: companion
  64. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, TreeMap[A, B]]

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

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

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new map.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to maps such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a map of those elements x for which f(x) equals k.

    definition classes: TraversableLike
    Go to: companion
  65. def grouped(size: Int): Iterator[TreeMap[A, B]]

    Partitions elements in fixed size maps

    Partitions elements in fixed size maps.

    size

    the number of elements per group

    returns

    An iterator producing maps of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
    Go to: companion
  66. def hasDefiniteSize: Boolean

    Tests whether this map is known to have a finite size

    Tests whether this 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.

    Note: many collection methods will not work on collections of infinite sizes.

    definition classes: TraversableLike
    Go to: companion
  67. def hashCode(): Int

    Returns a hash code value for the object

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    definition classes: MapLike ⇐ AnyRef ⇐ Any
    Go to: companion
  68. def head: (A, B)

    Selects the first element of this map

    Selects the first element of this map.

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

    definition classes: IterableLikeTraversableLike
    Go to: companion
  69. def headOption: Option[(A, B)]

    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.

    definition classes: TraversableLike
    Go to: companion
  70. def init: TreeMap[A, B]

    Selects all elements except the last

    Selects all elements except the last.

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

    definition classes: TraversableLike
    Go to: companion
  71. def insert[B1 >: B](key: A, value: B1): TreeMap[A, B1]

    A new TreeMap with the entry added is returned, assuming that key is not in the TreeMap

    A new TreeMap with the entry added is returned, assuming that key is not in the TreeMap.

    Go to: companion
  72. def isDefinedAt(key: A): 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: MapLikePartialFunction
    Go to: companion
  73. def isEmpty: Boolean

    Tests whether the map is empty

    Tests whether the map is empty.

    definition classes: MapLikeIterableLikeTraversableLike
    Go to: companion
  74. def isSmaller(x: A, y: A): Boolean

  75. def iterator: Iterator[(A, B)]

    Creates a new iterator over all elements contained in this object

    Creates a new iterator over all elements contained in this object.

    Go to: companion
  76. def keySet: SortedSet[A]

    Collects all keys of this map in a set

    Collects all keys of this map in a set.

    definition classes: SortedMapLikeMapLikeSorted
    Go to: companion
  77. def keys: Iterator[A]

    Creates an iterator for all keys

    Creates an iterator for all keys.

    definition classes: MapLike
    Go to: companion
  78. def keysIterator: Iterator[A]

    Creates an iterator for all keys

    Creates an iterator for all keys.

    definition classes: MapLike
    Go to: companion
  79. def last: (A, B)

    Selects the last element

    Selects the last element.

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

    definition classes: TraversableLike
    Go to: companion
  80. def lastKey: A

    Returns the last key of the collection

    Returns the last key of the collection.

    Go to: companion
  81. def lastOption: Option[(A, B)]

    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.

    definition classes: TraversableLike
    Go to: companion
  82. def lift: (A) ⇒ Option[B]

    Turns this partial function into an plain function returning an Option result

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

    definition classes: PartialFunction
    Go to: companion
  83. def map[B](f: ((A, B)) ⇒ B): Map[B]

    [use case] Builds a new collection by applying a function to all elements of this map

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    Go to: companion
  84. def map[B, That](f: ((A, B)) ⇒ B)(bf: CanBuildFrom[TreeMap[A, B], B, That]): That

    Builds a new collection by applying a function to all elements of this map

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this map and collecting the results.

    definition classes: TraversableLike
    Go to: companion
  85. def mapElements[C](f: (B) ⇒ C): DefaultMap[A, C]

  86. def mapValues[C](f: (B) ⇒ C): DefaultMap[A, C]

    A map view resulting from applying a given function f to each value associated with a key in this map

    A map view resulting from applying a given function f to each value associated with a key in this map.

    definition classes: MapLike
    Go to: companion
  87. def max[B >: (A, B)](cmp: Ordering[B]): (A, B)

    Finds the largest element

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this map with respect to the ordering cmp.

    definition classes: TraversableLike
    Go to: companion
  88. def min: (A, B)

    [use case] Finds the largest element

    [use case]

    Finds the largest element.

    attributes: abstract
    Go to: companion
  89. def min: (A, B)

    [use case] Finds the smallest element

    [use case]

    Finds the smallest element.

    attributes: abstract
    Go to: companion
  90. def min[B >: (A, B)](cmp: Ordering[B]): (A, B)

    Finds the smallest element

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this map with respect to the ordering cmp.

    definition classes: TraversableLike
    Go to: companion
  91. def mkString: String

    Displays all elements of this map in a string

    Displays all elements of this map in a string.

    definition classes: TraversableLike
    Go to: companion
  92. def mkString(sep: String): String

    Displays all elements of this map in a string using a separator string

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

    sep

    the separator string.

    returns

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

    definition classes: TraversableLike
    Go to: companion
  93. def mkString(start: String, sep: String, end: String): String

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this 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 map are separated by the string sep.

    definition classes: TraversableLike
    Go to: companion
  94. def nonEmpty: Boolean

    Tests whether the map is not empty

    Tests whether the map is not empty.

    definition classes: TraversableLike
    Go to: companion
  95. def orElse[A1 <: A, B1 >: B](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
    Go to: companion
  96. val ordering: Ordering[A]

  97. def partialMap[B](pf: PartialFunction[(A, B), B]): Map[B]

    [use case] Builds a new collection by applying a partial function to all elements of this map on which the function is defined

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the map.

    returns

    a new 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.

    attributes: abstract
    Go to: companion
  98. def partialMap[B, That](pf: PartialFunction[(A, B), B])(bf: CanBuildFrom[TreeMap[A, B], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the map.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
    Go to: companion
  99. def partition(p: ((A, B)) ⇒ Boolean): (TreeMap[A, B], TreeMap[A, B])

    Partitions this map in two maps according to a predicate

    Partitions this map in two maps according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of maps: the first map consists of all elements that satisfy the predicate p and the second map consists of all elements that don't. The relative order of the elements in the resulting maps is the same as in the original map.

    definition classes: TraversableLike
    Go to: companion
  100. def product: Int

    [use case] Multiplies up the elements of this collection

    [use case]

    Multiplies up the elements of this collection.

    attributes: abstract
    Go to: companion
  101. def product[B >: (A, B)](num: Numeric[B]): B

    Multiplies up the elements of this collection

    Multiplies up the elements of this collection.

    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 map with respect to the * operator in num.

    definition classes: TraversableLike
    Go to: companion
  102. def projection: IterableView[(A, B), TreeMap[A, B]]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: IterableLike
    Go to: companion
  103. def range(from: A, until: A): TreeMap[A, B]

    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 upper-bound (exclusive) of the ranged projection.

    until

    ...

    returns

    ...

    definition classes: Sorted
    Go to: companion
  104. def rangeImpl(from: Option[A], until: Option[A]): TreeMap[A, B]

    Creates a ranged projection of this collection

    Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa. Note: keys are not garuanteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.

    from

    The lower-bound (inclusive) of the ranged projection. None if there is no lower bound.

    until

    The upper-bound (exclusive) of the ranged projection. None if there is no upper bound.

    Go to: companion
  105. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B

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

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

    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 map$, going left to right: {{{ op(...(op(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this map.

    definition classes: TraversableLike
    Go to: companion
  106. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]

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

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

    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) is this map is nonempty, None otherwise.

    definition classes: TraversableLike
    Go to: companion
  107. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

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

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

    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 map$, going right to left: {{{ op(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this map.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  108. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]

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

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

    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) is this map is nonempty, None otherwise.

    definition classes: TraversableLike
    Go to: companion
  109. def repr: TreeMap[A, B]

    The collection of type map underlying this TraversableLike object

    The collection of type map underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
    Go to: companion
  110. def sameElements(that: Iterable[(A, B)]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this map

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this map.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    attributes: abstract
    Go to: companion
  111. def sameElements[B >: (A, B)](that: Iterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this map

    Checks if the other iterable collection contains the same elements in the same order as this map.

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    definition classes: IterableLike
    Go to: companion
  112. val size: Int

    The size of this map

    The size of this map.

    Go to: companion
  113. def slice(from: Int, until: Int): TreeMap[A, B]

    Selects an interval of elements

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

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

    from

    the index of the first returned element in this map.

    until

    the index one past the last returned element in this map.

    returns

    a map containing the elements starting at index from and extending up to (but not including) index until of this map.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  114. def sliding[B >: (A, B)](size: Int, step: Int): Iterator[TreeMap[A, B]]

  115. def sliding[B >: (A, B)](size: Int): Iterator[TreeMap[A, B]]

    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.)

    size

    the number of elements per group

    returns

    An iterator producing maps of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
    Go to: companion
  116. def span(p: ((A, B)) ⇒ Boolean): (TreeMap[A, B], TreeMap[A, B])

    Spits this map into a prefix/suffix pair according to a predicate

    Spits this 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 map whose elements all satisfy p, and the rest of this map.

    definition classes: TraversableLike
    Go to: companion
  117. def splitAt(n: Int): (TreeMap[A, B], TreeMap[A, B])

    Splits this map into two at a given position

    Splits this map into two 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 maps consisting of the first n elements of this map, and the other elements.

    definition classes: TraversableLike
    Go to: companion
  118. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: MapLikeTraversableLike
    Go to: companion
  119. def sum: Int

    [use case] Sums up the elements of this collection

    [use case]

    Sums up the elements of this collection.

    attributes: abstract
    Go to: companion
  120. def sum[B >: (A, B)](num: Numeric[B]): B

    Sums up the elements of this collection

    Sums up the elements of this collection.

    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 map with respect to the + operator in num.

    definition classes: TraversableLike
    Go to: companion
  121. def tail: TreeMap[A, B]

    Selects all elements except the first

    Selects all elements except the first.

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

    definition classes: TraversableLike
    Go to: companion
  122. def take(n: Int): TreeMap[A, B]

    Selects first n elements

    Selects first n elements.

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

    n

    Tt number of elements to take from this map.

    returns

    a map consisting only of the first n elements of this map, or else the whole map, if it has less than n elements.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  123. def takeRight(n: Int): TreeMap[A, B]

    Selects last n elements

    Selects last n elements.

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

    n

    the number of elements to take

    returns

    a map consisting only of the last n elements of this map, or else the whole map, if it has less than n elements.

    definition classes: IterableLike
    Go to: companion
  124. def takeWhile(p: ((A, B)) ⇒ Boolean): TreeMap[A, B]

    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 map whose elements all satisfy the predicate p.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  125. def to(to: A): TreeMap[A, B]

    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: Sorted
    Go to: companion
  126. def toArray: Array[(A, B)]

    [use case] Converts this map to an array

    [use case]

    Converts this map to an array.

    attributes: abstract
    Go to: companion
  127. def toArray[B >: (A, B)](arg0: ClassManifest[B]): Array[B]

    Converts this map to an array

    Converts this map to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this map.

    definition classes: TraversableLike
    Go to: companion
  128. def toIndexedSeq[B >: (A, B)]: IndexedSeq[B]

    Converts this map to an indexed sequence

    Converts this map to an indexed sequence.

    definition classes: TraversableLike
    Go to: companion
  129. def toIterable: Iterable[(A, B)]

    Converts this map to an iterable collection

    Converts this map to an iterable collection.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  130. def toList: List[(A, B)]

    Converts this map to a list

    Converts this map to a list.

    definition classes: TraversableLike
    Go to: companion
  131. def toMap[T, U](ev: <:<[(A, B), (T, U)]): Map[T, U]

    Converts this map to a map

    Converts this map to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    definition classes: TraversableLike
    Go to: companion
  132. def toSeq: Seq[(A, B)]

    Converts this map to a sequence

    Converts this map to a sequence.

    definition classes: TraversableLike
    Go to: companion
  133. def toSet[B >: (A, B)]: Set[B]

    Converts this map to a set

    Converts this map to a set.

    definition classes: TraversableLike
    Go to: companion
  134. def toStream: Stream[(A, B)]

    Converts this map to a stream

    Converts this map to a stream.

    Go to: companion
  135. def toString(): String

    Converts this map to a string

    Converts this map to a string

    definition classes: MapLikeTraversableLikeFunction1 ⇐ AnyRef ⇐ Any
    Go to: companion
  136. def transform[C, That](f: (A, B) ⇒ C)(bf: CanBuildFrom[TreeMap[A, B], (A, C), That]): That

    This function transforms all the values of mappings contained in this map with function f

    This function transforms all the values of mappings contained in this map with function f.

    f

    A function over keys and values

    returns

    the updated map

    definition classes: MapLike
    Go to: companion
  137. def transpose[B](asTraversable: ((A, B)) ⇒ Traversable[B]): Iterable[Iterable[B]]

    Transposes this map of traversable collections into

    Transposes this map of traversable collections into

    definition classes: GenericTraversableTemplate
    Go to: companion
  138. def until(until: A): TreeMap[A, B]

    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: Sorted
    Go to: companion
  139. def unzip[A1, A2](asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Converts this map of pairs into two collections of the first and second halfs of each pair

    Converts this map of pairs into two collections of the first and second halfs of each pair.

    asPair

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

    returns

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

    definition classes: GenericTraversableTemplate
    Go to: companion
  140. def update[B1 >: B](key: A, value: B1): Map[A, B1]

  141. def updated[B1 >: B](key: A, value: B1): TreeMap[A, B1]

    A new TreeMap with the entry added is returned, if key is not in the TreeMap, otherwise the key is updated with the new entry

    A new TreeMap with the entry added is returned, if key is not in the TreeMap, otherwise the key is updated with the new entry.

    B1

    the type of the added value

    key

    ...

    value

    ...

    returns

    ...

    Go to: companion
  142. def values: Iterator[B]

    Creates an iterator for all contained values

    Creates an iterator for all contained values.

    definition classes: MapLike
    Go to: companion
  143. def valuesIterable: Iterable[B]

    Collects all values of this map in an iterable collection

    Collects all values of this map in an iterable collection.

    definition classes: MapLike
    Go to: companion
  144. def valuesIterator: Iterator[B]

    Creates an iterator for all values in this map

    Creates an iterator for all values in this map.

    definition classes: MapLike
    Go to: companion
  145. def view(from: Int, until: Int): IterableView[(A, B), TreeMap[A, B]]

    Creates a non-strict view of a slice of this map

    Creates a non-strict view of a slice of this map.

    Note: the difference between view and slice is that view produces a view of the current map, whereas slice produces a new map.

    Note: view(from, to) is equivalent to view.slice(from, to)

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this map, starting at index from and extending up to (but not including) index until.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  146. def view: IterableView[(A, B), TreeMap[A, B]]

    Creates a non-strict view of this map

    Creates a non-strict view of this map.

    definition classes: IterableLikeTraversableLike
    Go to: companion
  147. def withDefault[B1 >: B](d: (A) ⇒ B1): Map[A, B1]

    The same map with a given default function !!! todo: move to general maps?

    The same map with a given default function !!! todo: move to general maps?

    definition classes: Map
    Go to: companion
  148. def withDefaultValue[B1 >: B](d: B1): Map[A, B1]

    The same map with a given default value

    The same map with a given default value

    definition classes: Map
    Go to: companion
  149. def withFilter(p: ((A, B)) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this map

    Creates a non-strict filter of this 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 map which satify the predicate p.

    definition classes: TraversableLike
    Go to: companion
  150. def zip[B](that: Iterable[B]): Map[((A, B), B)]

    [use case] Returns a map formed from this map and another iterable collection by combining corresponding elements in pairs

    [use case]

    Returns a map formed from this 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 map containing pairs consisting of corresponding elements of this map and that. The length of the returned collection is the minimum of the lengths of this map$ and that.

    attributes: abstract
    Go to: companion
  151. def zip[A1 >: (A, B), B, That](that: Iterable[B])(bf: CanBuildFrom[TreeMap[A, B], (A1, B), That]): That

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

    Returns a map formed from this 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.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this map and that. The length of the returned collection is the minimum of the lengths of this map$ and that.

    definition classes: IterableLike
    Go to: companion
  152. def zipAll[B](that: Iterable[B], thisElem: (A, B), thatElem: B): Map[((A, B), B)]

    [use case] Returns a map formed from this map and another iterable collection by combining corresponding elements in pairs

    [use case]

    Returns a map formed from this 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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    attributes: abstract
    Go to: companion
  153. def zipAll[B, A1 >: (A, B), That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[TreeMap[A, B], (A1, B), That]): That

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

    Returns a map formed from this 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.

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    definition classes: IterableLike
    Go to: companion
  154. def zipWithIndex: Map[((A, B), Int)]

    [use case] Zips this map with its indices

    [use case]

    Zips this map with its indices.

    attributes: abstract
    Go to: companion
  155. def zipWithIndex[A1 >: (A, B), That](bf: CanBuildFrom[TreeMap[A, B], (A1, Int), That]): That

    Zips this map with its indices

    Zips this map with its indices.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this map paired with their index. Indices start at 0.

    definition classes: IterableLike
    Go to: companion

Instance constructors

  1. new TreeMap()(ordering: Ordering[A])

  2. new TreeMap(size: Int, t: Tree[B])(ordering: Ordering[A])

  3. new TreeMap()