This class implements immutable maps using a tree.
the type of the keys contained in this tree map.
the type of the values associated with the keys.
1.1, 03/05/2004
1
The implementation class of the set returned by keySet.
The implementation class of the iterable returned by values.
The type implementing this traversable
A class supporting filtered operations.
o != arg0 is the same as !(o == (arg0)).
o != arg0 is the same as !(o == (arg0)).
the object to compare against this object for dis-equality.
false if the receiver object is equivalent to the argument; true otherwise.
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.
type of the values of the new bindings, a supertype of B
the first element to add.
the second element to add.
the remaining elements to add.
a new immutable tree map with the updated bindings
Add a key/value pair to this map.
Adds a number of elements provided by a traversable object and returns a new collection with the added elements.
[use case] Concatenates this immutable tree map with the elements of a traversable collection.
Concatenates this immutable tree map with the elements of a traversable collection.
the element type of the returned collection.
the traversable to append.
a new immutable tree map which contains all elements of this immutable tree map
followed by all elements of that.
Concatenates this immutable tree map with the elements of a traversable collection.
Concatenates this immutable tree map with the elements of a traversable collection.
the element type of the returned collection.
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.
the traversable to append.
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.
a new collection of type That which contains all elements
of this immutable tree map followed by all elements of that.
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.
[use case] Concatenates this immutable tree map with the elements of a traversable collection.
Concatenates this immutable tree map with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.
the element type of the returned collection.
the traversable to append.
a new immutable tree map which contains all elements of this immutable tree map
followed by all elements of that.
Concatenates this immutable tree map with the elements of a traversable collection.
Concatenates this immutable tree map with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.
the element type of the returned collection.
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.
the traversable to append.
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.
a new collection of type That which contains all elements
of this immutable tree map followed by all elements of that.
[use case] Removes a key from this map, returning a new map.
Removes a key from this map, returning a new map.
the key to be removed
a new map without a binding for key
Removes a key from this map, returning a new map.
Removes a key from this map, returning a new map.
the key to be removed
a new map without a binding for key
Creates a new immutable tree map from this immutable tree map with some elements removed.
Creates a new immutable tree map from this immutable tree 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.
the first element to remove.
the second element to remove.
the remaining elements to remove.
a new immutable tree map that contains all elements of the current immutable tree map except one less occurrence of each of the given elements.
Creates a new immutable tree map from this immutable tree map by removing all elements of another collection.
Creates a new immutable tree map from this immutable tree map by removing all elements of another collection.
a new immutable tree map that contains all elements of the current immutable tree map
except one less occurrence of each of the elements of elems.
Applies a binary operator to a start value and all elements of this immutable tree map, going left to right.
Applies a binary operator to a start value and all elements of this immutable tree map, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as
xs foldLeft z.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this immutable tree map,
going left to right with the start value z on the left:
op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)
where x,,1,,, ..., x,,n,, are the elements of this immutable tree map.
Applies a binary operator to all elements of this immutable tree map and a start value, going right to left.
Applies a binary operator to all elements of this immutable tree map and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as
xs foldRight z.
the result type of the binary operator.
the start value
the binary operator
the result of inserting op between consecutive elements of this immutable tree map,
going right to left with the start value z on the right:
op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
where x,,1,,, ..., x,,n,, are the elements of this immutable tree map.
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
o == arg0 is the same as o.equals(arg0).
o == arg0 is the same as o.equals(arg0).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
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.
the builder to which strings are appended.
the starting string.
the separator string.
the ending string.
the string builder b to which elements were appended.
Appends all elements of this immutable tree map to a string builder.
Appends all elements of this immutable 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 immutable tree map without any separator string.
the string builder to which elements are appended.
the string builder b to which elements were appended.
Appends all elements of this immutable tree map to a string builder using a separator string.
Appends all elements of this immutable 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 immutable tree map, separated by the
string sep.
the string builder to which elements are appended.
the separator string.
the string builder b to which elements were appended.
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.
the result type of the transformation function.
the transformation function
a partial function with the same domain as this partial function, which maps
arguments x to k(this(x)).
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.
the key
the value associated with the given key, or the result of the
map's default method, if none exists.
This method is used to cast the receiver object to be of type T0.
This method is used to 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 typed.
the receiver object.
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.
The object with which this immutable tree map should be compared
true, if this immutable tree map can possibly equal that, false otherwise. The test
takes into consideration only the run-time types of objects but ignores their elements.
This method creates and returns a copy of the receiver object.
[use case] Builds a new collection by applying a partial function to all elements of this immutable tree map on which the function is defined.
Builds a new collection by applying a partial function to all elements of this immutable tree map on which the function is defined.
the element type of the returned collection.
the partial function which filters and maps the immutable tree map.
a new immutable 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.
Builds a new collection by applying a partial function to all elements of this immutable tree map on which the function is defined.
Builds a new collection by applying a partial function to all elements of this immutable tree map on which the function is defined.
the element type of the returned collection.
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.
the partial function which filters and maps the immutable tree map.
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.
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.
Finds the first element of the immutable tree map for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the immutable tree map for which the given partial function is defined, and applies the partial function to it.
the partial function
an option value containing pf applied to the first
value for which it is defined, or None if none exists.
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
The factory companion object that builds instances of class immutable.
The factory companion object that builds instances of class immutable.TreeMap.
(or its Iterable superclass where class immutable.TreeMap is not a Seq.)
Comparison function that orders keys.
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.
the type to which function g can be applied
a function A => T1
a new function f such that f(x) == apply(g(x))
Tests whether this map contains a binding for a key.
Tests whether this map contains a binding for a key.
the key
true if there is a binding for key in this map, false otherwise.
[use case] Copies elements of this immutable tree map to an array.
Copies elements of this immutable tree map to an array.
Fills the given array xs with at most len elements of
this immutable tree map, starting at position start.
Copying will stop once either the end of the current immutable tree map is reached,
or the end of the array is reached, or len elements have been copied.
the array to fill.
the starting index.
the maximal number of elements to copy.
Copies elements of this immutable tree map to an array.
Copies elements of this immutable tree map to an array.
Fills the given array xs with at most len elements of
this immutable tree map, starting at position start.
Copying will stop once either the end of the current immutable tree map is reached,
or the end of the array is reached, or len elements have been copied.
the type of the elements of the array.
the array to fill.
the starting index.
the maximal number of elements to copy.
[use case] Copies values of this immutable tree map to an array.
Copies values of this immutable tree map to an array.
Fills the given array xs with values of this immutable tree map.
Copying will stop once either the end of the current immutable tree map is reached,
or the end of the array is reached.
the array to fill.
Copies values of this immutable tree map to an array.
Copies values of this immutable tree map to an array.
Fills the given array xs with values of this immutable tree map.
Copying will stop once either the end of the current immutable tree map is reached,
or the end of the array is reached.
the type of the elements of the array.
the array to fill.
[use case] Copies values of this immutable tree map to an array.
Copies values of this immutable tree map to an array.
Fills the given array xs with values of this immutable tree map, after skipping start values.
Copying will stop once either the end of the current immutable tree map is reached,
or the end of the array is reached.
the array to fill.
the starting index.
Copies values of this immutable tree map to an array.
Copies values of this immutable tree map to an array.
Fills the given array xs with values of this immutable tree map, after skipping start values.
Copying will stop once either the end of the current immutable tree map is reached,
or the end of the array is reached.
the type of the elements of the array.
the array to fill.
the starting index.
Copies all elements of this immutable tree map to a buffer.
Copies all elements of this immutable tree map to a buffer.
The buffer to which elements are copied.
Counts the number of elements in the immutable tree map which satisfy a predicate.
Counts the number of elements in the immutable tree map which satisfy a predicate.
the predicate used to test elements.
the number of elements satisfying the predicate p.
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.
the given key value for which a binding is missing.
Selects all elements except first n ones.
Selects all elements except first n ones.
the number of elements to drop from this immutable tree map.
a immutable tree map consisting of all elements of this immutable tree map except the first n ones, or else the
empty immutable tree map, if this immutable tree map has less than n elements.
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
a immutable tree map consisting of all elements of this immutable tree map except the last n ones, or else the
empty immutable tree map, if this immutable tree map has less than n elements.
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
The predicate used to test elements.
the longest suffix of this immutable tree map whose first element
does not satisfy the predicate p.
use iterator' instead
A factory to create empty maps of the same type of keys.
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef:
* It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true.
* It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and
only if y.eq(x) returns true.
* It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true
and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other 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).
the object to compare against this object for reference equality.
true if the argument is a reference to the receiver object; false otherwise.
Compares two maps structurally; i.
Tests whether a predicate holds for some of the elements of this immutable tree map.
Tests whether a predicate holds for some of the elements of this immutable tree map.
the predicate used to test elements.
true if the given predicate p holds for some of the
elements of this immutable tree map, otherwise false.
Selects all elements of this immutable tree map which satisfy a predicate.
Selects all elements of this immutable tree map which satisfy a predicate.
the predicate used to test elements.
a new immutable tree map consisting of all elements of this immutable tree map that satisfy the given
predicate p. The order of the elements is preserved.
Filters this map by retaining only keys satisfying a predicate.
Filters this map by retaining only keys satisfying a predicate.
the predicate used to test keys
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.
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.
Note: This method works by successively removing elements fro which the
predicate is false from this set.
If removal is slow, or you expect that most elements of the set
will be removed, you might consider using filter
with a negated predicate instead.
A predicate over key-value pairs
A new map containing elements not satisfying the predicate.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize method are invoked, as well as the interaction between finalize
and non-local returns and exceptions, are all platform dependent.
Finds the first element of the immutable tree map satisfying a predicate, if any.
Finds the first element of the immutable tree map satisfying a predicate, if any.
the predicate used to test elements.
an option value containing the first element in the immutable tree map
that satisfies p, or None if none exists.
use head' instead
Returns the first key of the collection.
Returns the first key of the collection.
None if iterable is empty.
None if iterable is empty.
use headOption' instead
[use case] Builds a new collection by applying a function to all elements of this immutable tree map and concatenating the results.
Builds a new collection by applying a function to all elements of this immutable tree map and concatenating the results.
the element type of the returned collection.
the function to apply to each element.
a new immutable tree map resulting from applying the given collection-valued function
f to each element of this immutable tree map and concatenating the results.
Builds a new collection by applying a function to all elements of this immutable tree map and concatenating the results.
Builds a new collection by applying a function to all elements of this immutable tree map and concatenating the results.
the element type of the returned collection.
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.
the function to apply to each element.
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.
a new collection of type That resulting from applying the given collection-valued function
f to each element of this immutable tree map and concatenating the results.
[use case] Converts this immutable tree map of traversable collections into a immutable tree map in which all element collections are concatenated.
Converts this immutable tree map of traversable collections into a immutable tree map in which all element collections are concatenated.
the type of the elements of each traversable collection.
a new immutable tree map resulting from concatenating all element immutable tree maps.
Converts this immutable tree map of traversable collections into a immutable tree map in which all element collections are concatenated.
Converts this immutable tree map of traversable collections into a immutable tree map in which all element collections are concatenated.
the type of the elements of each traversable collection.
an implicit conversion which asserts that the element
type of this immutable tree map is a Traversable.
a new immutable tree map resulting from concatenating all element immutable tree maps.
Applies a binary operator to a start value and all elements of this immutable tree map, going left to right.
Applies a binary operator to a start value and all elements of this immutable tree map, going left to right.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this immutable tree map,
going left to right with the start value z on the left:
op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)
where x,,1,,, ..., x,,n,, are the elements of this immutable tree map.
Applies a binary operator to all elements of this immutable tree map and a start value, going right to left.
Applies a binary operator to all elements of this immutable tree map and a start value, going right to left.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this immutable tree map,
going right to left with the start value z on the right:
op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
where x,,1,,, ..., x,,n,, are the elements of this immutable tree map.
Tests whether a predicate holds for all elements of this immutable tree map.
Tests whether a predicate holds for all elements of this immutable tree map.
the predicate used to test elements.
true if the given predicate p holds for all elements
of this immutable tree map, otherwise false.
[use case] Applies a function f to all elements of this immutable tree map.
Applies a function f to all elements of this immutable tree map.
the function that is applied for its side-effect to every element.
The result of function f is discarded.
Applies a function f to all elements of this immutable tree map.
Applies a function f to all elements of this immutable tree map.
Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.
the type parameter describing the result of function f.
This result will always be ignored. Typically U is Unit,
but this is not necessary.
the function that is applied for its side-effect to every element.
The result of function f is discarded.
Creates a ranged projection of this collection with no upper-bound.
Creates a ranged projection of this collection with no upper-bound.
The lower-bound (inclusive) of the ranged projection.
The generic builder that builds instances of immutable.
The generic builder that builds instances of immutable.TreeMap at arbitrary element types.
Check if this map maps key to a value and return the
value if it exists.
Returns a representation that corresponds to the dynamic class of the receiver object.
Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
[use case] 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.
the key.
a computation that yields a default value in case no binding for key is
found in the map.
the value associated with key if it exists,
otherwise the result of the default computation.
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.
the result type of the default computation.
the key.
a computation that yields a default value in case no binding for key is
found in the map.
the value associated with key if it exists,
otherwise the result of the default computation.
Partitions this immutable tree map into a map of immutable tree maps according to some discriminator function.
Partitions this immutable tree map into a map of immutable tree 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 immutable tree map.
the type of keys returned by the discriminator function.
the discriminator function.
A map from keys to immutable tree 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 immutable tree map of those elements x
for which f(x) equals k.
Partitions elements in fixed size immutable tree maps.
Partitions elements in fixed size immutable tree maps.
the number of elements per group
An iterator producing immutable tree maps of size size, except the
last will be truncated if the elements don't divide evenly.
Iterator#grouped
Tests whether this immutable tree map is known to have a finite size.
Tests whether this immutable 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.
Note: many collection methods will not work on collections of infinite sizes.
true if this collection is known to have finite size, false otherwise.
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.
the hash code value for the object.
Selects the first element of this immutable tree map.
Selects the first element of this immutable tree map.
the first element of this immutable tree map.
Optionally selects the first element.
Optionally selects the first element.
the first element of this immutable tree map if it is nonempty, None if it is empty.
Selects all elements except the last.
Selects all elements except the last.
a immutable tree map consisting of all elements of this immutable tree map except the last one.
Iterates over the inits of this immutable tree map.
Iterates over the inits of this immutable tree map. The first value will be this
immutable tree map and the final one will be an empty immutable tree map, with the intervening
values the results of successive applications of init.
an iterator over all the inits of this immutable tree map
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
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.
type of the values of the new bindings, a supertype of B
the key to be inserted
the value to be associated with key
a new immutable tree map with the inserted binding, if it wasn't present in the map
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.
the key
true if there is a binding for key in this map, false otherwise.
Tests whether the map is empty.
Tests whether the map is empty.
true if the map does not contain any key/value binding, false otherwise.
This method is used to test whether the dynamic type of the receiver object is T0.
This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression
1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will
return true. 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 typed.
true if the receiver object is an instance of erasure of type T0; false otherwise.
Tests whether this immutable tree map can be repeatedly traversed.
Tests whether this immutable tree map can be repeatedly traversed.
true
Creates a new iterator over all elements contained in this object.
Creates a new iterator over all elements contained in this object.
the new iterator
Collects all keys of this map in a set.
Collects all keys of this map in a set.
a set containing all keys of this map.
Creates an iterator for all keys.
Creates an iterator for all keys.
an iterator over all keys.
Creates an iterator for all keys.
Selects the last element.
Selects the last element.
The last element of this immutable tree map.
Returns the last key of the collection.
Returns the last key of the collection.
Optionally selects the last element.
Optionally selects the last element.
the last element of this immutable tree map$ if it is nonempty, None if it is empty.
Turns this partial function into an plain function returning an Option result.
Turns this partial function into an plain function returning an Option result.
a function that takes an argument x to Some(this(x)) if this
is defined for x, and to None otherwise.
Function.unlift
[use case] Builds a new collection by applying a function to all elements of this immutable tree map.
Builds a new collection by applying a function to all elements of this immutable tree map.
the element type of the returned collection.
the function to apply to each element.
a new immutable tree map resulting from applying the given function
f to each element of this immutable tree map and collecting the results.
Builds a new collection by applying a function to all elements of this immutable tree map.
Builds a new collection by applying a function to all elements of this immutable tree map.
the element type of the returned collection.
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.
the function to apply to each element.
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.
a new collection of type That resulting from applying the given function
f to each element of this immutable tree map and collecting the results.
use mapValues' instead
Transforms this map by applying a function to every retrieved value.
[use case] Finds the largest element.
Finds the largest element.
the largest element of this immutable tree map.
Finds the largest element.
Finds the largest element.
The type over which the ordering is defined.
An ordering to be used for comparing elements.
the largest element of this immutable tree map with respect to the ordering cmp.
[use case] Finds the smallest element.
Finds the smallest element.
the smallest element of this immutable tree map
Finds the smallest element.
Finds the smallest element.
The type over which the ordering is defined.
An ordering to be used for comparing elements.
the smallest element of this immutable tree map with respect to the ordering cmp.
Displays all elements of this immutable tree map in a string.
Displays all elements of this immutable tree map in a string.
a string representation of this immutable tree map. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this immutable tree map follow each other without any
separator string.
Displays all elements of this immutable tree map in a string using a separator string.
Displays all elements of this immutable tree map in a string using a separator string.
the separator string.
a string representation of this immutable tree map. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this immutable tree map are separated by the string sep.
List(1, 2, 3).mkString("|") = "1|2|3"
Displays all elements of this immutable tree map in a string using start, end, and separator strings.
Displays all elements of this immutable tree map in a string using start, end, and separator strings.
the starting string.
the separator string.
the ending string.
a string representation of this immutable 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 immutable tree map are separated by
the string sep.
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
o.ne(arg0) is the same as !(o.eq(arg0)).
o.ne(arg0) is the same as !(o.eq(arg0)).
the object to compare against this object for reference dis-equality.
false if the argument is not a reference to the receiver object; true otherwise.
A common implementation of newBuilder for all maps in terms of empty.
A common implementation of newBuilder for all maps in terms of empty.
Overridden for mutable maps in mutable.MapLike.
Tests whether the immutable tree map is not empty.
Tests whether the immutable tree map is not empty.
true if the immutable tree map contains at least one element, false otherwise.
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.
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.
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.
the argument type of the fallback function
the result type of the fallback function
the fallback function
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.
the implicit ordering used to compare objects of type A.
the implicit ordering used to compare objects of type A.
Returns a parallel implementation of this collection.
Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying
all the elements. For these collection, par takes linear time. Mutable collections
in this category do not produce a mutable parallel collection that has the same
underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray or mutable.ParHashMap) override this default
behaviour by creating a parallel collection which shares the same underlying dataset.
For these collections, par takes constant or sublinear time.
All parallel collections return a reference to themselves.
a parallel implementation of this collection
The default par implementation uses the combiner provided by this method
to create a new parallel collection.
The default par implementation uses the combiner provided by this method
to create a new parallel collection.
a combiner for the parallel collection of type ParRepr
Partitions this immutable tree map in two immutable tree maps according to a predicate.
Partitions this immutable tree map in two immutable tree maps according to a predicate.
the predicate on which to partition.
a pair of immutable tree maps: the first immutable tree map consists of all elements that
satisfy the predicate p and the second immutable tree map consists of all elements
that don't. The relative order of the elements in the resulting immutable tree maps
is the same as in the original immutable tree map.
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the product of all elements in this immutable tree map of numbers of type Int.
Instead of Int, any other type T with an implicit Numeric[T] implementation
can be used as element type of the immutable tree map and as result type of product.
Examples of such types are: Long, Float, Double, BigInt.
Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the result type of the * operator.
an implicit parameter defining a set of numeric operations
which includes the * operator to be used in forming the product.
the product of all elements of this immutable tree map with respect to the * operator in num.
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.
use view' instead
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.
The upper-bound (exclusive) of the ranged projection.
...
...
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.
The lower-bound (inclusive) of the ranged projection.
None if there is no lower bound.
The upper-bound (exclusive) of the ranged projection.
None if there is no upper bound.
Applies a binary operator to all elements of this immutable tree map, going left to right.
Applies a binary operator to all elements of this immutable tree map, going left to right.
the result type of the binary operator.
the binary operator.
the result of inserting op between consecutive elements of this immutable tree map,
going left to right:
op(...(op(x,,1,,, x,,2,,), ... ) , x,,n,,)
where x,,1,,, ..., x,,n,, are the elements of this immutable tree map.
Optionally applies a binary operator to all elements of this immutable tree map, going left to right.
Optionally applies a binary operator to all elements of this immutable tree map, going left to right.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceLeft(op) is this immutable tree map is nonempty,
None otherwise.
Applies a binary operator to all elements of this immutable tree map, going right to left.
Applies a binary operator to all elements of this immutable tree map, going right to left.
the result type of the binary operator.
the binary operator.
the result of inserting op between consecutive elements of this immutable tree map,
going right to left:
op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
where x,,1,,, ..., x,,n,, are the elements of this immutable tree map.
Optionally applies a binary operator to all elements of this immutable tree map, going right to left.
Optionally applies a binary operator to all elements of this immutable tree map, going right to left.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceRight(op) is this immutable tree map is nonempty,
None otherwise.
The collection of type immutable tree map underlying this TraversableLike object.
The collection of type immutable tree map underlying this TraversableLike object.
By default this is implemented as the TraversableLike object itself,
but this can be overridden.
[use case] Checks if the other iterable collection contains the same elements in the same order as this immutable tree map.
Checks if the other iterable collection contains the same elements in the same order as this immutable tree map.
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
Checks if the other iterable collection contains the same elements in the same order as this immutable tree map.
Checks if the other iterable collection contains the same elements in the same order as this immutable tree map.
the type of the elements of collection that.
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
Produces a collection containing cummulative results of applying the operator going left to right.
Produces a collection containing cummulative results of applying the operator going left to right.
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
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.
collection with intermediate results
Produces a collection containing cummulative results of applying the operator going right to left.
Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.
Example:
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
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.
collection with intermediate results
A version of this collection with all of the operations implemented sequentially (i.
A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
a sequential view of the collection.
The size of this immutable tree map.
The size of this immutable tree map.
the number of elements in this immutable tree map.
Selects an interval of elements.
Selects an interval of elements. The returned collection is made up
of all elements x which satisfy the invariant:
from <= indexOf(x) < until
the lowest index to include from this immutable tree map.
the highest index to EXCLUDE from this immutable tree map.
a immutable tree map containing the elements greater than or equal to
index from extending up to (but not including) index until
of this immutable tree map.
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 number of elements per group
An iterator producing immutable tree maps of size size, except the
last and the only element will be truncated if there are
fewer elements than size.
Iterator#sliding
Splits this immutable tree map into a prefix/suffix pair according to a predicate.
Splits this immutable 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.
the test predicate
a pair consisting of the longest prefix of this immutable tree map whose
elements all satisfy p, and the rest of this immutable tree map.
Splits this immutable tree map into two at a given position.
Splits this immutable tree 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).
the position at which to split.
a pair of immutable tree maps consisting of the first n
elements of this immutable tree map, and the other elements.
Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
a string representation which starts the result of toString applied to this immutable tree map.
Unless overridden in subclasses, the string prefix of every map is "Map".
[use case] Sums up the elements of this collection.
Sums up the elements of this collection.
the sum of all elements in this immutable tree map of numbers of type Int.
Instead of Int, any other type T with an implicit Numeric[T] implementation
can be used as element type of the immutable tree map and as result type of sum.
Examples of such types are: Long, Float, Double, BigInt.
Sums up the elements of this collection.
Sums up the elements of this collection.
the result type of the + operator.
an implicit parameter defining a set of numeric operations
which includes the + operator to be used in forming the sum.
the sum of all elements of this immutable tree map with respect to the + operator in num.
Selects all elements except the first.
Selects all elements except the first.
a immutable tree map consisting of all elements of this immutable tree map except the first one.
Iterates over the tails of this immutable tree map.
Iterates over the tails of this immutable tree map. The first value will be this
immutable tree map and the final one will be an empty immutable tree map, with the intervening
values the results of successive applications of tail.
an iterator over all the tails of this immutable tree map
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Selects first n elements.
Selects first n elements.
Tt number of elements to take from this immutable tree map.
a immutable tree map consisting only of the first n elements of this immutable tree map,
or else the whole immutable tree map, if it has less than n elements.
Selects last n elements.
Selects last n elements.
the number of elements to take
a immutable tree map consisting only of the last n elements of this immutable tree map, or else the
whole immutable tree map, if it has less than n elements.
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate.
The predicate used to test elements.
the longest prefix of this immutable tree map whose elements all satisfy
the predicate p.
The underlying collection seen as an instance of immutable.TreeMap.
The underlying collection seen as an instance of immutable.TreeMap.
By default this is implemented as the current collection object itself,
but this can be overridden.
Create a range projection of this collection with no lower-bound.
Create a range projection of this collection with no lower-bound.
The upper-bound (inclusive) of the ranged projection.
[use case] Converts this immutable tree map to an array.
Converts this immutable tree map to an array.
an array containing all elements of this immutable tree map.
A ClassManifest must be available for the element type of this immutable tree map.
Converts this immutable tree map to an array.
Converts this immutable tree map to an array.
the type of the elements of the array. A ClassManifest for
this type must be available.
an array containing all elements of this immutable tree map.
Converts this immutable tree map to a mutable buffer.
Converts this immutable tree map to a mutable buffer.
a buffer containing all elements of this immutable tree map.
A conversion from collections of type Repr to immutable.TreeMap objects.
A conversion from collections of type Repr to immutable.TreeMap objects.
By default this is implemented as just a cast, but this can be overridden.
Converts this immutable tree map to an indexed sequence.
Converts this immutable tree map to an indexed sequence.
an indexed sequence containing all elements of this immutable tree map.
Converts this immutable tree map to an iterable collection.
Converts this immutable tree map to an iterable collection. Note that
the choice of target Iterable is lazy in this default implementation
as this TraversableOnce may be lazy and unevaluated (i.e. it may
be an iterator which is only traversable once).
an Iterable containing all elements of this immutable tree map.
Returns an Iterator over the elements in this immutable tree map.
Returns an Iterator over the elements in this immutable tree map. Will return the same Iterator if this instance is already an Iterator.
an Iterator containing all elements of this immutable tree map.
Converts this immutable tree map to a list.
Converts this immutable tree map to a list.
a list containing all elements of this immutable tree map.
[use case] Converts this immutable tree map to a map.
Converts this immutable tree map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) 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.
a map of type immutable.Map[T, U]
containing all key/value pairs of type (T, U) of this immutable tree map.
Converts this immutable tree map to a map.
Converts this immutable tree map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) 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.
a map containing all elements of this immutable tree map.
Overridden for efficiency.
Overridden for efficiency.@return a sequence containing all elements of this immutable tree map.
Converts this immutable tree map to a set.
Converts this immutable tree map to a set.
a set containing all elements of this immutable tree map.
Converts this immutable tree map to a stream.
Converts this immutable tree map to a stream.
a stream containing all elements of this immutable tree map.
Converts this immutable tree map to a string.
Converts this immutable tree map to a string.
a string representation of this collection. By default this
string consists of the stringPrefix of this immutable tree map,
followed by all elements separated by commas and enclosed in parentheses.
Converts this immutable tree map to an unspecified Traversable.
Converts this immutable tree map to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
a Traversable containing all elements of this immutable tree map.
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.
A function over keys and values
the updated map
Transposes this immutable tree map of traversable collections into a immutable tree map of immutable tree maps.
Transposes this immutable tree map of traversable collections into a immutable tree map of immutable tree maps.
the type of the elements of each traversable collection.
an implicit conversion which asserts that the
element type of this immutable tree map is a Traversable.
a two-dimensional immutable tree map of immutable tree maps which has as nth row the nth column of this immutable tree map.
Creates a ranged projection of this collection with no lower-bound.
Creates a ranged projection of this collection with no lower-bound.
The upper-bound (exclusive) of the ranged projection.
Converts this immutable tree map of pairs into two collections of the first and second half of each pair.
Converts this immutable tree map of pairs into two collections of the first and second half of each pair.
an implicit conversion which asserts that the element type of this immutable tree map is a pair.
a pair immutable tree maps, containing the first, respectively second half of each element pair of this immutable tree map.
Converts this immutable tree map of triples into three collections of the first, second, and third element of each triple.
Converts this immutable tree map of triples into three collections of the first, second, and third element of each triple.
a triple immutable tree maps, containing the first, second, respectively third member of each element triple of this immutable tree map.
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.
type of the value of the new binding which is a supertype of B
the key that should be updated
the value to be associated with key
a new immutable tree map with the updated binding
Collects all values of this map in an iterable collection.
Collects all values of this map in an iterable collection.
the values of this map as an iterable.
Creates an iterator for all values in this map.
Creates an iterator for all values in this map.
an iterator over all values that are associated with some key in this map.
Creates a non-strict view of a slice of this immutable tree map.
Creates a non-strict view of a slice of this immutable tree map.
Note: the difference between view and slice is that view produces
a view of the current immutable tree map, whereas slice produces a new immutable tree map.
Note: view(from, to) is equivalent to view.slice(from, to)
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this immutable tree map, starting at index from
and extending up to (but not including) index until.
Creates a non-strict view of this immutable tree map.
Creates a non-strict view of this immutable tree map.
a non-strict view of this immutable tree map.
The same map with a given default function.
The same map with a given default function.
Note: get, contains, iterator, keys, etc are not affected by withDefault.
Invoking transformer methods (e.g. map) will not preserve the default value.
the function mapping keys to values, used for non-present keys
a wrapper of the map with a default value
The same map with a given default value.
The same map with a given default value.
Invoking transformer methods (e.g. map) will not preserve the default value.
the function mapping keys to values, used for non-present keys
a wrapper of the map with a default value
Creates a non-strict filter of this immutable tree map.
Creates a non-strict filter of this immutable 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.
the predicate used to test elements.
an object of class WithFilter, which supports
map, flatMap, foreach, and withFilter operations.
All these operations apply to those elements of this immutable tree map which
satisfy the predicate p.
[use case] Returns a immutable tree map formed from this immutable tree map and another iterable collection by combining corresponding elements in pairs.
Returns a immutable tree map formed from this immutable 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
a new immutable tree map containing pairs consisting of
corresponding elements of this immutable tree map and that. The length
of the returned collection is the minimum of the lengths of this immutable tree map and that.
Returns a immutable tree map formed from this immutable tree map and another iterable collection by combining corresponding elements in pairs.
Returns a immutable tree map formed from this immutable 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.
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A).
the type of the second half of the returned pairs
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.
The iterable providing the second half of each result pair
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).
a new collection of type That containing pairs consisting of
corresponding elements of this immutable tree map and that. The length
of the returned collection is the minimum of the lengths of this immutable tree map and that.
[use case] Returns a immutable tree map formed from this immutable tree map and another iterable collection by combining corresponding elements in pairs.
Returns a immutable tree map formed from this immutable 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
the element to be used to fill up the result if this immutable tree map is shorter than that.
the element to be used to fill up the result if that is shorter than this immutable tree map.
a new immutable tree map containing pairs consisting of
corresponding elements of this immutable tree map and that. The length
of the returned collection is the maximum of the lengths of this immutable tree map and that.
If this immutable tree map is shorter than that, thisElem values are used to pad the result.
If that is shorter than this immutable tree map, thatElem values are used to pad the result.
Returns a immutable tree map formed from this immutable tree map and another iterable collection by combining corresponding elements in pairs.
Returns a immutable tree map formed from this immutable 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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this immutable tree map is shorter than that.
the element to be used to fill up the result if that is shorter than this immutable tree map.
a new collection of type That containing pairs consisting of
corresponding elements of this immutable tree map and that. The length
of the returned collection is the maximum of the lengths of this immutable tree map and that.
If this immutable tree map is shorter than that, thisElem values are used to pad the result.
If that is shorter than this immutable tree map, thatElem values are used to pad the result.
[use case] Zips this immutable tree map with its indices.
Zips this immutable tree map with its indices.
A new immutable tree map containing pairs consisting of all elements of this
immutable tree map paired with their index. Indices start at 0.
@example
List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
Zips this immutable tree map with its indices.
Zips this immutable tree map with its indices.
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A).
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.
A new collection of type That containing pairs consisting of all elements of this
immutable tree map paired with their index. Indices start at 0.
This class implements immutable maps using a tree.