final class TreeMap[K, +V] extends SortedMap[K, V] with SortedMapOps[K, V, TreeMap, TreeMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, TreeMap[K, V]] with Serializable
This class implements immutable maps using a tree.
- K
the type of the keys contained in this tree map.
- V
the type of the values associated with the keys.
- Annotations
- @SerialVersionUID()
- Version
1.1, 03/05/2004
- Since
1
- See also
"Scala's Collection Library overview" section on
Red-Black Trees
for more information.
- Alphabetic
- By Inheritance
- TreeMap
- Serializable
- Serializable
- StrictOptimizedIterableOps
- SortedMap
- SortedMapOps
- SortedMap
- SortedMapOps
- SortedOps
- Map
- MapOps
- Map
- MapOps
- Equals
- PartialFunction
- Function1
- Iterable
- Iterable
- Traversable
- IterableOps
- IterableOnce
- AnyRef
- Any
- by toLazyZipOps
- by iterableOnceExtensionMethods
- by toLazyZipOps
- Hide All
- Show All
- Public
- All
Instance Constructors
- new TreeMap()(implicit ordering: Ordering[K])
Type Members
-
class
WithFilter extends collection.WithFilter[A, CC]
A template trait that contains just the
map
,flatMap
,foreach
andwithFilter
methods of traitIterable
.A template trait that contains just the
map
,flatMap
,foreach
andwithFilter
methods of traitIterable
.- Definition Classes
- IterableOps
-
trait
GenKeySet extends Serializable
A generic trait that is reused by keyset implementations
A generic trait that is reused by keyset implementations
- Attributes
- protected
- Definition Classes
- MapOps
-
class
KeySet extends Set[K] with GenKeySet
The implementation class of the set returned by
keySet
.The implementation class of the set returned by
keySet
.- Attributes
- protected
- Definition Classes
- MapOps
-
class
MapWithFilter extends WithFilter
Specializes
WithFilter
for Map collection typesSpecializes
WithFilter
for Map collection types- Definition Classes
- MapOps
-
trait
GenKeySortedSet extends GenKeySet
A generic trait that is reused by sorted keyset implementations
A generic trait that is reused by sorted keyset implementations
- Attributes
- protected
- Definition Classes
- SortedMapOps
-
class
KeySortedSet extends SortedSet[K] with GenKeySet with GenKeySortedSet
The implementation class of the set returned by
keySet
The implementation class of the set returned by
keySet
- Attributes
- protected
- Definition Classes
- SortedMapOps
-
class
SortedMapWithFilter extends MapWithFilter
Specializes
MapWithFilter
for sorted Map collectionsSpecializes
MapWithFilter
for sorted Map collections- Definition Classes
- SortedMapOps
-
class
ImmutableKeySet extends Set[K] with GenKeySet
The implementation class of the set returned by
keySet
The implementation class of the set returned by
keySet
- Attributes
- protected
- Definition Classes
- MapOps
-
class
ImmutableKeySortedSet extends SortedSet[K] with GenKeySet with GenKeySortedSet
The implementation class of the set returned by
keySet
The implementation class of the set returned by
keySet
- Attributes
- protected
- Definition Classes
- SortedMapOps
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
+[V1 >: V](kv: (K, V1)): TreeMap[K, V1]
Alias for
updated
Alias for
updated
- V1
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.
- Definition Classes
- SortedMapOps → MapOps
- Annotations
- @inline()
-
def
++[V2 >: V](xs: collection.Iterable[(K, V2)]): TreeMap[K, V2]
Alias for
concat
Alias for
concat
- Definition Classes
- SortedMapOps → MapOps
-
final
def
++[K2 >: K, V2 >: V](xs: collection.Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
Alias for
concat
Alias for
concat
- Definition Classes
- SortedMapOps
- Annotations
- @inline()
-
final
def
++[B >: (K, V)](suffix: collection.Iterable[B]): Iterable[B]
Alias for
concat
Alias for
concat
- Definition Classes
- IterableOps
- Annotations
- @inline()
-
final
def
-(key: K): TreeMap[K, V]
Alias for
remove
Alias for
remove
- Definition Classes
- MapOps
- Annotations
- @inline()
-
final
def
--(keys: IterableOnce[K]): TreeMap[K, V]
Alias for
removeAll
Alias for
removeAll
- Definition Classes
- MapOps
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(key: K): V
Retrieves the value which is associated with the given key.
Retrieves the value which is associated with the given key. This method invokes the
default
method of the map if there is no mapping from the given key to a value. Unless overridden, thedefault
method throws aNoSuchElementException
.- key
the key
- returns
the value associated with the given key, or the result of the map's
default
method, if none exists.
- Definition Classes
- MapOps → Function1
- Annotations
- @throws( ... )
-
def
applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
- Definition Classes
- MapOps → PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- Map → Equals
-
def
className: String
The class name of this collection.
The class name of this collection. To be used for converting to string. Collections generally print like this:
<className>(elem_1, ..., elem_n)
- returns
a string representation which starts the result of
toString
applied to this iterable collection. By default the string prefix is the simple name of the collection class iterable collection.
- Definition Classes
- IterableOps
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
coll: TreeMap.this.type
- returns
This collection as a
C
.
- Attributes
- protected[this]
- Definition Classes
- Iterable → IterableOps
-
def
collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]
Builds a new collection by applying a partial function to all elements of this iterable collection on which the function is defined.
Builds a new collection by applying a partial function to all elements of this iterable collection on which the function is defined.
- B
the element type of the returned collection.
- pf
the partial function which filters and maps the iterable collection.
- returns
a new iterable collection resulting from applying the given partial function
pf
to each element on which it is defined and collecting the results. The order of the elements is preserved.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
Builds a new sorted map by applying a partial function to all elements of this map on which the function is defined.
Builds a new sorted map by applying a partial function to all elements of this map on which the function is defined.
- 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.
- Definition Classes
- SortedMapOps
-
def
collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): Map[K2, V2]
Builds a new collection by applying a partial function to all elements of this 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.
- K2
the key type of the returned map.
- V2
the value type of the returned map.
- 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.
- Definition Classes
- MapOps
-
def
collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
Finds the first element of the iterable collection for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the iterable collection for which the given partial function is defined, and applies the partial function to it.
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- pf
the partial function
- returns
an option value containing pf applied to the first value for which it is defined, or
None
if none exists.
- Definition Classes
- IterableOps
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
Example: -
def
compose[A](g: (A) ⇒ K): (A) ⇒ V
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
concat[V2 >: V](xs: collection.Iterable[(K, V2)]): TreeMap[K, V2]
Returns a new immutable map containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new immutable map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the immutable map is the most specific superclass encompassing the element types of the two operands.
- returns
a new immutable map which contains all elements of this immutable map followed by all elements of
suffix
.
- Definition Classes
- SortedMapOps → SortedMapOps → MapOps → MapOps
-
def
concat[K2 >: K, V2 >: V](xs: collection.Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
Returns a new map containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the map is the most specific superclass encompassing the element types of the two operands.
- K2
the type of the keys of the returned map.
- V2
the type of the values of the returned map.
- xs
the traversable to append.
- returns
a new collection of type
CC[K2, V2]
which contains all elements of this map followed by all elements ofxs
.
- Definition Classes
- SortedMapOps
-
def
concat[B >: (K, V)](suffix: collection.Iterable[B]): Iterable[B]
Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the iterable collection is the most specific superclass encompassing the element types of the two operands.
- B
the element type of the returned collection.
- suffix
the traversable to append.
- returns
a new iterable collection which contains all elements of this iterable collection followed by all elements of
suffix
.
- Definition Classes
- IterableOps
-
def
contains(key: K): Boolean
Tests whether this map contains a binding for a key.
Tests whether this map contains a binding for a key.
- key
the key
- returns
true
if there is a binding forkey
in this map,false
otherwise.
- Definition Classes
- MapOps
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int = 0): xs.type
Copy all elements of this collection to array
xs
, starting atstart
.Copy all elements of this collection to array
xs
, starting atstart
.- Definition Classes
- IterableOps
-
def
count(p: ((K, V)) ⇒ Boolean): Int
Counts the number of elements in the iterable collection which satisfy a predicate.
Counts the number of elements in the iterable collection which satisfy a predicate.
- p
the predicate used to test elements.
- returns
the number of elements satisfying the predicate
p
.
- Definition Classes
- IterableOps
-
def
default(key: K): V
Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.
Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.
- key
the given key value for which a binding is missing.
- Definition Classes
- MapOps
- Annotations
- @throws( ... )
- Exceptions thrown
-
def
drop(n: Int): TreeMap[K, V]
The rest of the collection without its
n
first elements.The rest of the collection without its
n
first elements. For linear, immutable collections this should avoid making a copy.- Definition Classes
- TreeMap → IterableOps
-
def
dropRight(n: Int): TreeMap[K, V]
The rest of the collection without its
n
last elements.The rest of the collection without its
n
last elements. For linear, immutable collections this should avoid making a copy.- Definition Classes
- TreeMap → IterableOps
-
def
dropWhile(p: ((K, V)) ⇒ Boolean): TreeMap[K, V]
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
- p
The predicate used to test elements.
- returns
the longest suffix of this immutable tree map whose first element does not satisfy the predicate
p
.
- Definition Classes
- TreeMap → IterableOps
-
def
empty: TreeMap[K, V]
The empty map of the same type as this map
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(o: Any): Boolean
- Definition Classes
- Map → Equals → AnyRef → Any
-
def
exists(p: ((K, V)) ⇒ Boolean): Boolean
Tests whether a predicate holds for at least one element of this iterable collection.
Tests whether a predicate holds for at least one element of this iterable collection.
Note: may not terminate for infinite-sized collections.
- p
the predicate used to test elements.
- returns
true
if the given predicatep
is satisfied by at least one element of this iterable collection, otherwisefalse
- Definition Classes
- IterableOps
-
def
filter(pred: ((K, V)) ⇒ Boolean): TreeMap[K, V]
Selects all elements of this iterable collection which satisfy a predicate.
Selects all elements of this iterable collection which satisfy a predicate.
- pred
the predicate used to test elements.
- returns
a new iterable collection consisting of all elements of this iterable collection that satisfy the given predicate
pred
. Their order may not be preserved.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
filterImpl(pred: ((K, V)) ⇒ Boolean, isFlipped: Boolean): TreeMap[K, V]
- Attributes
- protected[strawman.collection]
- Definition Classes
- StrictOptimizedIterableOps
-
def
filterKeys(p: (K) ⇒ Boolean): View[(K, V)]
Filters this map by retaining only keys satisfying a predicate.
Filters this map by retaining only keys satisfying a predicate.
- p
the predicate used to test keys
- returns
an immutable map consisting only of those key value pairs of this map where the key satisfies the predicate
p
. The resulting map wraps the original map without copying any elements.
- Definition Classes
- MapOps
-
def
filterNot(pred: ((K, V)) ⇒ Boolean): TreeMap[K, V]
Selects all elements of this iterable collection which do not satisfy a predicate.
Selects all elements of this iterable collection which do not satisfy a predicate.
- pred
the predicate used to test elements.
- returns
a new iterable collection consisting of all elements of this iterable collection that do not satisfy the given predicate
pred
. Their order may not be preserved.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
Finds the first element of the iterable collection satisfying a predicate, if any.
Finds the first element of the iterable collection satisfying a predicate, if any.
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- p
the predicate used to test elements.
- returns
an option value containing the first element in the iterable collection that satisfies
p
, orNone
if none exists.
- Definition Classes
- IterableOps
-
def
firstKey: K
Returns the first key of the collection.
Returns the first key of the collection.
- Definition Classes
- TreeMap → SortedMapOps → SortedOps
-
def
flatMap[B](f: ((K, V)) ⇒ IterableOnce[B]): Iterable[B]
Builds a new collection by applying a function to all elements of this iterable collection and using the elements of the resulting collections.
Builds a new collection by applying a function to all elements of this iterable collection and using the elements of the resulting collections.
For example:
def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")
The type of the resulting collection is guided by the static type of iterable collection. This might cause unexpected results sometimes. For example:
// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet) // lettersOf will return a Set[Char], not a Seq def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq) // xs will be an Iterable[Int] val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2) // ys will be a Map[Int, Int] val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new iterable collection resulting from applying the given collection-valued function
f
to each element of this iterable collection and concatenating the results.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
flatMap[K2, V2](f: ((K, V)) ⇒ IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
Builds a new sorted map by applying a function to all elements of this map and using the elements of the resulting collections.
Builds a new sorted map by applying a function to all elements of this map and using the elements of the resulting collections.
- 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.
- Definition Classes
- SortedMapOps
-
def
flatMap[K2, V2](f: ((K, V)) ⇒ IterableOnce[(K2, V2)]): Map[K2, V2]
Builds a new map by applying a function to all elements of this map and using the elements of the resulting collections.
Builds a new map by applying a function to all elements of this map and using the elements of the resulting collections.
- 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.
- Definition Classes
- MapOps
-
def
flatten[B](implicit toIterableOnce: ((K, V)) ⇒ IterableOnce[B]): Iterable[B]
Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.
Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.
The resulting collection's type will be guided by the type of iterable collection. For example:
val xs = List( Set(1, 2, 3), Set(1, 2, 3) ).flatten // xs == List(1, 2, 3, 1, 2, 3) val ys = Set( List(1, 2, 3), List(3, 2, 1) ).flatten // ys == Set(1, 2, 3)
- B
the type of the elements of each traversable collection.
- returns
a new iterable collection resulting from concatenating all element iterable collections.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
Applies a binary operator to a start value and all elements of this iterable collection, going left to right.
Applies a binary operator to a start value and all elements of this iterable collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.
- B
the result type of the binary operator.
- z
the start value.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this iterable collection, going left to right with the start valuez
on the left:op(...op(z, x_1), x_2, ..., x_n)
where
x1, ..., xn
are the elements of this iterable collection. Returnsz
if this iterable collection is empty.
- Definition Classes
- IterableOps
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
Applies a binary operator to all elements of this iterable collection and a start value, going right to left.
Applies a binary operator to all elements of this iterable collection and a start value, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.
- B
the result type of the binary operator.
- z
the start value.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this iterable collection, going right to left with the start valuez
on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where
x1, ..., xn
are the elements of this iterable collection. Returnsz
if this iterable collection is empty.
- Definition Classes
- IterableOps
-
def
forall(p: ((K, V)) ⇒ Boolean): Boolean
Tests whether a predicate holds for all elements of this iterable collection.
Tests whether a predicate holds for all elements of this iterable collection.
Note: may not terminate for infinite-sized collections.
- p
the predicate used to test elements.
- returns
true
if this iterable collection is empty or the given predicatep
holds for all elements of this iterable collection, otherwisefalse
.
- Definition Classes
- IterableOps
-
def
foreach[U](f: ((K, V)) ⇒ U): Unit
Apply
f
to each element for its side effects Note: [U] parameter needed to help scalac's type inference.Apply
f
to each element for its side effects Note: [U] parameter needed to help scalac's type inference.- Definition Classes
- TreeMap → IterableOps
-
def
from(from: K): TreeMap[K, V]
Creates a ranged projection of this collection with no upper-bound.
Creates a ranged projection of this collection with no upper-bound.
- from
The lower-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedOps
-
final
def
fromIterable[E](it: collection.Iterable[E]): Iterable[E]
Similar to
fromSpecificIterable
, but for a (possibly) different type of element.Similar to
fromSpecificIterable
, but for a (possibly) different type of element. Note that the return type is knowCC[E]
.- Attributes
- protected[this]
- Definition Classes
- IterableOps
- Annotations
- @inline()
-
def
fromSpecificIterable(coll: collection.Iterable[(K, V)]): TreeMap[K, V]
Defines how to turn a given
Iterable[A]
into a collection of typeC
.Defines how to turn a given
Iterable[A]
into a collection of typeC
.This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.
- Attributes
- protected[this]
- Definition Classes
- TreeMap → IterableOps
-
def
get(key: K): Option[V]
Optionally returns the value associated with a key.
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getOrElse(key: K, default: ⇒ V): V
[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 associated with
key
if it exists, otherwise the result of thedefault
computation.
- Definition Classes
- MapOps
Full Signaturedef getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
-
def
groupBy[K](f: ((K, V)) ⇒ K): Map[K, TreeMap[K, V]]
Partitions this iterable collection into a map of iterable collections according to some discriminator function.
Partitions this iterable collection into a map of iterable collections according to some discriminator function.
Note: When applied to a view or a lazy collection it will always force the elements.
- K
the type of keys returned by the discriminator function.
- f
the discriminator function.
- returns
A map from keys to iterable collections such that the following invariant holds:
(xs groupBy f)(k) = xs filter (x => f(x) == k)
That is, every key
k
is bound to a iterable collection of those elementsx
for whichf(x)
equalsk
.
- Definition Classes
- IterableOps
-
def
groupMap[K, B](key: ((K, V)) ⇒ K)(f: ((K, V)) ⇒ B): Map[K, Iterable[B]]
Partitions this iterable collection into a map of iterable collections according to a discriminator function
key
.Partitions this iterable collection into a map of iterable collections according to a discriminator function
key
. Each element in a group is transformed into a value of typeB
using thevalue
function.It is equivalent to
groupBy(key).mapValues(_.map(f))
, but more efficient.case class User(name: String, age: Int) def namesByAge(users: Seq[User]): Map[Int, Seq[String]] = users.groupMap(_.age)(_.name)
- K
the type of keys returned by the discriminator function
- B
the type of values returned by the transformation function
- key
the discriminator function
- f
the element transformation function
- Definition Classes
- IterableOps
-
def
groupMapReduce[K, B](key: ((K, V)) ⇒ K)(f: ((K, V)) ⇒ B)(reduce: (B, B) ⇒ B): Map[K, B]
Partitions this iterable collection into a map according to a discriminator function
key
.Partitions this iterable collection into a map according to a discriminator function
key
. All the values that have the same discriminator are then transformed by thevalue
function and then reduced into a single value with thereduce
function.It is equivalent to
groupBy(key).mapValues(_.map(f).reduce(reduce))
, but more efficient.def occurrences[A](as: Seq[A]): Map[A, Int] = as.groupMapReduce(identity)(_ => 1)(_ + _)
- Definition Classes
- IterableOps
-
def
grouped(size: Int): Iterator[TreeMap[K, V]]
Partitions elements in fixed size iterable collections.
Partitions elements in fixed size iterable collections.
- size
the number of elements per group
- returns
An iterator producing iterable collections of size
size
, except the last will be less than sizesize
if the elements don't divide evenly.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
grouped
-
def
hashCode(): Int
- Definition Classes
- Map → AnyRef → Any
-
def
head: (K, V)
Selects the first element of this immutable tree map.
Selects the first element of this immutable tree map.
- returns
the first element of this immutable tree map.
- Definition Classes
- TreeMap → IterableOps
- Exceptions thrown
NoSuchElementException
if the immutable tree map is empty.
-
def
headOption: Option[(K, V)]
Optionally selects the first element.
Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the first element of this iterable collection if it is nonempty,
None
if it is empty.
- Definition Classes
- IterableOps
-
def
init: TreeMap[K, V]
The initial part of the collection without its last element.
The initial part of the collection without its last element.
- Definition Classes
- TreeMap → IterableOps
-
def
inits: Iterator[TreeMap[K, V]]
Iterates over the inits of this iterable collection.
Iterates over the inits of this iterable collection. The first value will be this iterable collection and the final one will be an empty iterable collection, with the intervening values the results of successive applications of
init
.- returns
an iterator over all the inits of this iterable collection
- Definition Classes
- IterableOps
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
Example: -
def
isDefinedAt(key: K): Boolean
Tests whether this map contains a binding for a key.
Tests whether this map contains a binding for a key. This method, which implements an abstract method of trait
PartialFunction
, is equivalent tocontains
.- key
the key
- returns
true
if there is a binding forkey
in this map,false
otherwise.
- Definition Classes
- MapOps → PartialFunction
-
def
isEmpty: Boolean
Tests whether the iterable collection is empty.
Tests whether the iterable collection is empty.
Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when
isEmpty
is called.- returns
true
if the iterable collection contains no elements,false
otherwise.
- Definition Classes
- IterableOps
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
iterableFactory: List.type
- returns
The companion object of this immutable tree map, providing various factory methods.
- Definition Classes
- TreeMap → IterableOps
-
def
iterator(): Iterator[(K, V)]
Iterator can be used only once
Iterator can be used only once
- Definition Classes
- TreeMap → IterableOnce
-
def
iteratorFrom(start: K): Iterator[(K, V)]
Creates an iterator over all the key/value pairs contained in this map having a key greater than or equal to
start
according to the ordering of this map.Creates an iterator over all the key/value pairs contained in this map having a key greater than or equal to
start
according to the ordering of this map. x.iteratorFrom(y) is equivalent to but often more efficient than x.from(y).iterator.- start
The lower bound (inclusive) on the keys to be returned
- Definition Classes
- TreeMap → SortedMapOps
-
def
keySet: SortedSet[K]
Collects all keys of this map in a set.
Collects all keys of this map in a set.
- returns
a set containing all keys of this map.
- Definition Classes
- SortedMapOps → SortedMapOps → MapOps → MapOps
-
def
keys: collection.Iterable[K]
Collects all keys of this map in an iterable collection.
Collects all keys of this map in an iterable collection.
- returns
the keys of this map as an iterable.
- Definition Classes
- MapOps
-
def
keysIterator(): Iterator[K]
Creates an iterator for all keys.
-
def
keysIteratorFrom(start: K): Iterator[K]
Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to
start
according to the ordering of this collection.Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to
start
according to the ordering of this collection. x.keysIteratorFrom(y) is equivalent to but often more efficient than x.from(y).keysIterator.- start
The lower bound (inclusive) on the keys to be returned
- Definition Classes
- TreeMap → SortedMapOps
-
def
knownSize: Int
The number of elements in this collection, if it can be cheaply computed, -1 otherwise.
The number of elements in this collection, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.
- returns
The number of elements of this iterable collection if it can be computed in O(1) time, otherwise -1
- Definition Classes
- IterableOps → IterableOnce
-
def
last: (K, V)
Selects the last element.
Selects the last element.
- returns
The last element of this immutable tree map.
- Definition Classes
- TreeMap → IterableOps
- Exceptions thrown
NoSuchElementException
If the immutable tree map is empty.
-
def
lastKey: K
Returns the last key of the collection.
Returns the last key of the collection.
- Definition Classes
- TreeMap → SortedMapOps → SortedOps
-
def
lastOption: Option[(K, V)]
Optionally selects the last element.
Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
the last element of this iterable collection$ if it is nonempty,
None
if it is empty.
- Definition Classes
- IterableOps
-
def
lift: (K) ⇒ Option[V]
- Definition Classes
- PartialFunction
-
def
map[B](f: ((K, V)) ⇒ B): Iterable[B]
Builds a new collection by applying a function to all elements of this iterable collection.
Builds a new collection by applying a function to all elements of this iterable collection.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new iterable collection resulting from applying the given function
f
to each element of this iterable collection and collecting the results.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
map[K2, V2](f: ((K, V)) ⇒ (K2, V2))(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
Builds a new sorted map by applying a function to all elements of this map.
Builds a new sorted map by applying a function to all elements of this map.
- 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.
- Definition Classes
- SortedMapOps
-
def
map[K2, V2](f: ((K, V)) ⇒ (K2, V2)): Map[K2, V2]
Builds a new map by applying a function to all elements of this map.
Builds a new map by applying a function to all elements of this map.
- 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.
- Definition Classes
- MapOps
- def mapFactory: Map.type
-
def
mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): Map[K2, V2]
Similar to fromIterable, but returns a Map collection type
Similar to fromIterable, but returns a Map collection type
- Attributes
- protected
- Definition Classes
- SortedMapOps → MapOps
-
def
mapValues[W](f: (V) ⇒ W): View[(K, W)]
Transforms this map by applying a function to every retrieved value.
Transforms this map by applying a function to every retrieved value.
- f
the function used to transform values of this map.
- returns
a map view which maps every key of this map to
f(this(key))
. The resulting map wraps the original map without copying any elements.
- Definition Classes
- MapOps
-
def
max: (K, V)
[use case] Finds the largest element.
[use case]Finds the largest element.
- returns
the largest element of this immutable tree map.
- Definition Classes
- IterableOps
Full Signaturedef max[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
-
def
maxBefore(key: K): Option[(K, V)]
Find the element with largest key less than a given key.
Find the element with largest key less than a given key.
- key
The given key.
- returns
None
if there is no such node.
- Definition Classes
- TreeMap → SortedMapOps
-
def
maxBy[B](f: ((K, V)) ⇒ B): (K, V)
[use case] Finds the first element which yields the largest value measured by function f.
[use case]Finds the first element which yields the largest value measured by function f.
- B
The result type of the function f.
- f
The measuring function.
- returns
the first element of this immutable tree map with the largest value measured by function f.
- Definition Classes
- IterableOps
Full Signaturedef maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
-
def
min: (K, V)
[use case] Finds the smallest element.
[use case]Finds the smallest element.
- returns
the smallest element of this immutable tree map
- Definition Classes
- IterableOps
Full Signaturedef min[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
-
def
minAfter(key: K): Option[(K, V)]
Find the element with smallest key larger than or equal to a given key.
Find the element with smallest key larger than or equal to a given key.
- key
The given key.
- returns
None
if there is no such node.
- Definition Classes
- TreeMap → SortedMapOps
-
def
minBy[B](f: ((K, V)) ⇒ B): (K, V)
[use case] Finds the first element which yields the smallest value measured by function f.
[use case]Finds the first element which yields the smallest value measured by function f.
- B
The result type of the function f.
- f
The measuring function.
- returns
the first element of this immutable tree map with the smallest value measured by function f.
- Definition Classes
- IterableOps
Full Signaturedef minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
-
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 stringend
. Inside, the string representations (w.r.t. the methodtoString
) of all elements of this map are separated by the stringsep
.
- Definition Classes
- MapOps → IterableOps
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
Example: -
def
mkString: String
Displays all elements of this iterable collection in a string.
Displays all elements of this iterable collection in a string.
- returns
a string representation of this iterable collection. In the resulting string the string representations (w.r.t. the method
toString
) of all elements of this iterable collection follow each other without any separator string.
- Definition Classes
- IterableOps
-
def
mkString(sep: String): String
Displays all elements of this iterable collection in a string using a separator string.
Displays all elements of this iterable collection in a string using a separator string.
- sep
the separator string.
- returns
a string representation of this iterable collection. In the resulting string the string representations (w.r.t. the method
toString
) of all elements of this iterable collection are separated by the stringsep
.
- Definition Classes
- IterableOps
List(1, 2, 3).mkString("|") = "1|2|3"
Example: -
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newSpecificBuilder(): Builder[(K, V), TreeMap[K, V]]
- returns
a strict builder for the same collection type. Note that in the case of lazy collections (e.g. View or immutable.LazyList), it is possible to implement this method but the resulting
Builder
will break laziness. As a consequence, operations should preferably be implemented withfromSpecificIterable
instead of this method.
- Attributes
- protected[this]
- Definition Classes
- TreeMap → IterableOps
-
def
nonEmpty: Boolean
Tests whether the iterable collection is not empty.
Tests whether the iterable collection is not empty.
- returns
true
if the iterable collection contains at least one element,false
otherwise.
- Definition Classes
- IterableOps
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- implicit val ordering: Ordering[K]
-
def
partition(p: ((K, V)) ⇒ Boolean): (TreeMap[K, V], TreeMap[K, V])
A pair of, first, all elements that satisfy prediacte
p
and, second, all elements that do not.A pair of, first, all elements that satisfy prediacte
p
and, second, all elements that do not. Interesting because it splits a collection in two.The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of
partition
inBuildable
, which requires only a single traversal.- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
product: (K, V)
[use case] Multiplies up the elements of this collection.
[use case]Multiplies up the elements of this collection.
- returns
the product of all elements in this immutable tree map of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the immutable tree map and as result type ofproduct
. Examples of such types are:Long
,Float
,Double
,BigInt
.
- Definition Classes
- IterableOps
Full Signaturedef product[B >: (K, V)](implicit num: Numeric[B]): B
-
def
range(from: K, until: K): TreeMap[K, V]
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
-
def
rangeImpl(from: Option[K], until: Option[K]): TreeMap[K, V]
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 guaranteed 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.
-
def
rangeTo(to: K): TreeMap[K, V]
Create a range projection of this collection with no lower-bound.
Create a range projection of this collection with no lower-bound.
- to
The upper-bound (inclusive) of the ranged projection.
- Definition Classes
- SortedMapOps → SortedOps
-
def
reduce[B >: (K, V)](op: (B, B) ⇒ B): B
Reduces the elements of this iterable collection using the specified associative binary operator.
Reduces the elements of this iterable collection using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
- B
A type parameter for the binary operator, a supertype of
A
.- op
A binary operator that must be associative.
- returns
The result of applying reduce operator
op
between all the elements if the iterable collection is nonempty.
- Definition Classes
- IterableOps
- Exceptions thrown
UnsupportedOperationException
if this iterable collection is empty.
-
def
reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
Applies a binary operator to all elements of this iterable collection, going left to right.
Applies a binary operator to all elements of this iterable collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this iterable collection, going left to right:op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
where
x1, ..., xn
are the elements of this iterable collection.
- Definition Classes
- IterableOps
- Exceptions thrown
UnsupportedOperationException
if this iterable collection is empty.
-
def
reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this iterable collection, going left to right.
Optionally applies a binary operator to all elements of this iterable collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceLeft(op)
if this iterable collection is nonempty,None
otherwise.
- Definition Classes
- IterableOps
-
def
reduceOption[B >: (K, V)](op: (B, B) ⇒ B): Option[B]
Reduces the elements of this iterable collection, if any, using the specified associative binary operator.
Reduces the elements of this iterable collection, if any, using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
- B
A type parameter for the binary operator, a supertype of
A
.- op
A binary operator that must be associative.
- returns
An option value containing result of applying reduce operator
op
between all the elements if the collection is nonempty, andNone
otherwise.
- Definition Classes
- IterableOps
-
def
reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
Applies a binary operator to all elements of this iterable collection, going right to left.
Applies a binary operator to all elements of this iterable collection, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this iterable collection, going right to left:op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
where
x1, ..., xn
are the elements of this iterable collection.
- Definition Classes
- IterableOps
- Exceptions thrown
UnsupportedOperationException
if this iterable collection is empty.
-
def
reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this iterable collection, going right to left.
Optionally applies a binary operator to all elements of this iterable collection, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceRight(op)
if this iterable collection is nonempty,None
otherwise.
- Definition Classes
- IterableOps
-
def
remove(key: K): TreeMap[K, V]
Removes a key from this map, returning a new map.
-
def
removeAll(keys: IterableOnce[K]): TreeMap[K, V]
Creates a new immutable map from this immutable map by removing all elements of another collection.
Creates a new immutable map from this immutable map by removing all elements of another collection.
- keys
the collection containing the removed elements.
- returns
a new immutable map that contains all elements of the current immutable map except one less occurrence of each of the elements of
elems
.
- Definition Classes
- MapOps
-
def
reversed: collection.Iterable[(K, V)]
- Attributes
- protected[this]
- Definition Classes
- IterableOps
-
def
runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
scan[B >: (K, V)](z: B)(op: (B, B) ⇒ B): Iterable[B]
Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element
z
may be applied more than once.- B
element type of the resulting collection
- z
neutral element for the operator
op
- op
the associative operator for the scan
- returns
a new iterable collection containing the prefix scan of the elements in this iterable collection
- Definition Classes
- IterableOps
-
def
scanLeft[B](z: B)(op: (B, (K, V)) ⇒ B): Iterable[B]
Produces a collection containing cumulative results of applying the operator going left to right.
Produces a collection containing cumulative results of applying the operator going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- B
the type of the elements in the resulting collection
- z
the initial value
- op
the binary operator applied to the intermediate result and the element
- returns
collection with intermediate results
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
scanRight[B](z: B)(op: ((K, V), B) ⇒ B): Iterable[B]
Produces a collection containing cumulative results of applying the operator going right to left.
Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Example:
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
- B
the type of the elements in the resulting collection
- z
the initial value
- op
the binary operator applied to the intermediate result and the element
- returns
collection with intermediate results
- Definition Classes
- IterableOps
-
def
size: Int
The size of this immutable tree map.
The size of this immutable tree map.
- returns
the number of elements in this immutable tree map.
- Definition Classes
- TreeMap → IterableOps
-
def
slice(from: Int, until: Int): TreeMap[K, V]
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
- from
the lowest index to include from this immutable tree map.
- until
the lowest index to EXCLUDE from this immutable tree map.
- returns
a immutable tree map containing the elements greater than or equal to index
from
extending up to (but not including) indexuntil
of this immutable tree map.
- Definition Classes
- TreeMap → IterableOps
-
def
sliding(size: Int, step: Int): Iterator[TreeMap[K, V]]
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
- size
the number of elements per group
- step
the distance between the first elements of successive groups
- returns
An iterator producing iterable collections of size
size
, except the last element (which may be the only element) will be truncated if there are fewer thansize
elements remaining to be grouped.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
sliding
-
def
sliding(size: Int): Iterator[TreeMap[K, V]]
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in
grouped
.) The "sliding window" step is set to one.Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in
grouped
.) The "sliding window" step is set to one.- size
the number of elements per group
- returns
An iterator producing iterable collections of size
size
, except the last element (which may be the only element) will be truncated if there are fewer thansize
elements remaining to be grouped.
- Definition Classes
- IterableOps
- See also
scala.collection.Iterator, method
sliding
-
def
sortedMapFactory: TreeMap.type
- Definition Classes
- TreeMap → SortedMapOps
-
def
sortedMapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
- Attributes
- protected[this]
- Definition Classes
- TreeMap → SortedMapOps
-
def
span(p: ((K, V)) ⇒ Boolean): (TreeMap[K, V], TreeMap[K, V])
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 predicatep
does not cause any side-effects.- p
the test predicate
- returns
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.
- Definition Classes
- TreeMap → StrictOptimizedIterableOps → IterableOps
-
def
splitAt(n: Int): (TreeMap[K, V], TreeMap[K, V])
Splits this iterable collection into two at a given position.
Splits this iterable collection 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 iterable collections consisting of the first
n
elements of this iterable collection, and the other elements.
- Definition Classes
- IterableOps
-
def
sum: (K, V)
[use case] Sums up the elements of this collection.
[use case]Sums up the elements of this collection.
- returns
the sum of all elements in this immutable tree map of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the immutable tree map and as result type ofsum
. Examples of such types are:Long
,Float
,Double
,BigInt
.
- Definition Classes
- IterableOps
Full Signaturedef sum[B >: (K, V)](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: TreeMap[K, V]
The rest of the collection without its first element.
The rest of the collection without its first element.
- Definition Classes
- TreeMap → IterableOps
-
def
tails: Iterator[TreeMap[K, V]]
Iterates over the tails of this iterable collection.
Iterates over the tails of this iterable collection. The first value will be this iterable collection and the final one will be an empty iterable collection, with the intervening values the results of successive applications of
tail
.- returns
an iterator over all the tails of this iterable collection
- Definition Classes
- IterableOps
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Example: -
def
take(n: Int): TreeMap[K, V]
A collection containing the first
n
elements of this collection.A collection containing the first
n
elements of this collection.- Definition Classes
- TreeMap → IterableOps
-
def
takeRight(n: Int): TreeMap[K, V]
A collection containing the last
n
elements of this collection.A collection containing the last
n
elements of this collection.- Definition Classes
- TreeMap → IterableOps
-
def
takeWhile(p: ((K, V)) ⇒ Boolean): TreeMap[K, V]
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate.
- p
The predicate used to test elements.
- returns
the longest prefix of this immutable tree map whose elements all satisfy the predicate
p
.
- Definition Classes
- TreeMap → IterableOps
-
def
to[C1](factory: Factory[(K, V), C1]): C1
Given a collection factory
factory
, convert this collection to the appropriate representation for the current element typeA
.Given a collection factory
factory
, convert this collection to the appropriate representation for the current element typeA
. Example uses:xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]
- Definition Classes
- IterableOps
-
def
toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
Convert collection to array.
Convert collection to array.
- Definition Classes
- IterableOps
-
def
toIndexedSeq: IndexedSeq[(K, V)]
- Definition Classes
- IterableOps
-
final
def
toIterable: TreeMap.this.type
- returns
This collection as an
Iterable[A]
. No new collection will be built ifthis
is already anIterable[A]
.
- Definition Classes
- Iterable → IterableOps
-
def
toList: List[(K, V)]
- Definition Classes
- IterableOps
-
final
def
toMap[K2, V2](implicit ev: <:<[(K, V), (K2, V2)]): Map[K2, V2]
- Definition Classes
- Map → IterableOps
-
def
toSeq: Seq[(K, V)]
- Definition Classes
- IterableOps
-
def
toSet[B >: (K, V)]: Set[B]
- Definition Classes
- IterableOps
-
def
toString(): String
- Definition Classes
- MapOps → Function1 → IterableOps → AnyRef → Any
-
def
toVector: Vector[(K, V)]
- Definition Classes
- IterableOps
-
def
transform[W](f: (K, V) ⇒ W): Map[K, W]
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
- MapOps
-
def
transpose[B](implicit asIterable: ((K, V)) ⇒ collection.Iterable[B]): Iterable[Iterable[B]]
Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.
Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.
The resulting collection's type will be guided by the static type of iterable collection. For example:
val xs = List( Set(1, 2, 3), Set(4, 5, 6)).transpose // xs == List( // List(1, 4), // List(2, 5), // List(3, 6)) val ys = Vector( List(1, 2, 3), List(4, 5, 6)).transpose // ys == Vector( // Vector(1, 4), // Vector(2, 5), // Vector(3, 6))
- B
the type of the elements of each iterable collection.
- asIterable
an implicit conversion which asserts that the element type of this iterable collection is an
Iterable
.- returns
a two-dimensional iterable collection of iterable collections which has as nth row the nth column of this iterable collection.
- Definition Classes
- IterableOps
- Exceptions thrown
IllegalArgumentException
if all collections in this iterable collection are not of the same size.
-
def
unsorted: collection.Map[K, V]
- Definition Classes
- SortedMap → SortedMapOps
-
def
until(until: K): TreeMap[K, V]
Creates a ranged projection of this collection with no lower-bound.
Creates a ranged projection of this collection with no lower-bound.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
-
def
unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
Converts this iterable collection of pairs into two collections of the first and second half of each pair.
Converts this iterable collection of pairs into two collections of the first and second half of each pair.
val xs = Iterable( (1, "one"), (2, "two"), (3, "three")).unzip // xs == (Iterable(1, 2, 3), // Iterable(one, two, three))
- A1
the type of the first half of the element pairs
- A2
the type of the second half of the element pairs
- asPair
an implicit conversion which asserts that the element type of this iterable collection is a pair.
- returns
a pair of iterable collections, containing the first, respectively second half of each element pair of this iterable collection.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
updated(key: K, value: V): Map[K, V]
[use case] Creates a new map obtained by updating this map with a given key/value pair.
[use case]Creates a new map obtained by updating this map with a given key/value pair.
- key
the key
- value
the value
- returns
A new map with the new key/value mapping added to this map.
- Definition Classes
- TreeMap → SortedMapOps → MapOps
Full Signaturedef updated[V1 >: V](key: K, value: V1): TreeMap[K, V1]
-
def
values: collection.Iterable[V]
Collects all values of this map in an iterable collection.
Collects all values of this map in an iterable collection.
- returns
the values of this map as an iterable.
- Definition Classes
- MapOps
-
def
valuesIterator(): Iterator[V]
Creates an iterator for all values in this map.
Creates an iterator for all values in this map.
- returns
an iterator over all values that are associated with some key in this map.
- Definition Classes
- MapOps
-
def
valuesIteratorFrom(start: K): Iterator[V]
Creates an iterator over all the values contained in this map that are associated with a key greater than or equal to
start
according to the ordering of this map.Creates an iterator over all the values contained in this map that are associated with a key greater than or equal to
start
according to the ordering of this map. x.valuesIteratorFrom(y) is equivalent to but often more efficient than x.from(y).valuesIterator.- start
The lower bound (inclusive) on the keys to be returned
- Definition Classes
- TreeMap → SortedMapOps
-
def
view: View[(K, V)]
A view over the elements of this collection.
A view over the elements of this collection.
- Definition Classes
- IterableOps
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withDefault[V1 >: V](d: (K) ⇒ V1): Map[K, V1]
The same map with a given default function.
The same map with a given default function. Note: The default is only used for
apply
. Other methods likeget
,contains
,iterator
,keys
, etc. are not affected bywithDefault
.Invoking transformer methods (e.g.
map
) will not preserve the default value.- d
the function mapping keys to values, used for non-present keys
- returns
a wrapper of the map with a default value
- Definition Classes
- Map
-
def
withDefaultValue[V1 >: V](d: V1): Map[K, V1]
The same map with a given default value.
The same map with a given default value. Note: The default is only used for
apply
. Other methods likeget
,contains
,iterator
,keys
, etc. are not affected bywithDefaultValue
.Invoking transformer methods (e.g.
map
) will not preserve the default value.- d
default value used for non-present keys
- returns
a wrapper of the map with a default value
- Definition Classes
- Map
-
def
withFilter(p: ((K, V)) ⇒ Boolean): SortedMapWithFilter
Creates a non-strict filter of this map.
Creates a non-strict filter of this map.
Note: the difference between
c filter p
andc withFilter p
is that the former creates a new collection, whereas the latter only restricts the domain of subsequentmap
,flatMap
,foreach
, andwithFilter
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 supportsmap
,flatMap
,foreach
, andwithFilter
operations. All these operations apply to those elements of this map which satisfy the predicatep
.
- Definition Classes
- SortedMapOps → MapOps → IterableOps
-
def
zip[B](that: collection.Iterable[B]): Iterable[((K, V), B)]
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.
Returns a iterable collection formed from this iterable collection 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 iterable collection containing pairs consisting of corresponding elements of this iterable collection and
that
. The length of the returned collection is the minimum of the lengths of this iterable collection andthat
.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
-
def
zipAll[A1 >: (K, V), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.
Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
- that
the iterable providing the second half of each result pair
- thisElem
the element to be used to fill up the result if this iterable collection is shorter than
that
.- thatElem
the element to be used to fill up the result if
that
is shorter than this iterable collection.- returns
a new collection of type
That
containing pairs consisting of corresponding elements of this iterable collection andthat
. The length of the returned collection is the maximum of the lengths of this iterable collection andthat
. If this iterable collection is shorter thanthat
,thisElem
values are used to pad the result. Ifthat
is shorter than this iterable collection,thatElem
values are used to pad the result.
- Definition Classes
- IterableOps
-
def
zipWithIndex: Iterable[((K, V), Int)]
Zips this iterable collection with its indices.
Zips this iterable collection with its indices.
- returns
A new iterable collection containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at
0
.
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
Example:
Shadowed Implicit Value Members
-
def
lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, TreeMap[K, V]]
Analogous to
zip
except that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2
decorator.Analogous to
zip
except that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2
decorator.Calls to
lazyZip
can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.val xs = List(1, 2, 3) val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d) // res == List(4, 8, 12)
- B
the type of the second element in each eventual pair
- that
the iterable providing the second element of each eventual pair
- returns
a decorator
LazyZip2
that allows strict operations to be performed on the lazily evaluated pairs or chained calls tolazyZip
. Implicit conversion toIterable[(A, B)]
is also supported.
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to LazyZipOps[(K, V), TreeMap[K, V]] performed by method toLazyZipOps in strawman.collection.Map.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(treeMap: LazyZipOps[(K, V), TreeMap[K, V]]).lazyZip(that)
- Definition Classes
- LazyZipOps
-
def
lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, Iterable[(K, V)]]
Analogous to
zip
except that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2
decorator.Analogous to
zip
except that the elements in each collection are not consumed until a strict operation is invoked on the returnedLazyZip2
decorator.Calls to
lazyZip
can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.val xs = List(1, 2, 3) val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d) // res == List(4, 8, 12)
- B
the type of the second element in each eventual pair
- that
the iterable providing the second element of each eventual pair
- returns
a decorator
LazyZip2
that allows strict operations to be performed on the lazily evaluated pairs or chained calls tolazyZip
. Implicit conversion toIterable[(A, B)]
is also supported.
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to LazyZipOps[(K, V), Iterable[(K, V)]] performed by method toLazyZipOps in strawman.collection.Iterable.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(treeMap: LazyZipOps[(K, V), Iterable[(K, V)]]).lazyZip(that)
- Definition Classes
- LazyZipOps
-
val
this: TreeMap[K, V]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to LazyZipOps[(K, V), TreeMap[K, V]] performed by method toLazyZipOps in strawman.collection.Map.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(treeMap: LazyZipOps[(K, V), TreeMap[K, V]]).this
- Definition Classes
- LazyZipOps
-
val
this: Iterable[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to LazyZipOps[(K, V), Iterable[(K, V)]] performed by method toLazyZipOps in strawman.collection.Iterable.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(treeMap: LazyZipOps[(K, V), Iterable[(K, V)]]).this
- Definition Classes
- LazyZipOps
Deprecated Value Members
-
def
/:[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator().foldLeft instead of /: on IterableOnce
-
final
def
/:[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
-
def
:\[B](z: B)(op: ((K, V), B) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator().foldRight instead of :\ on IterableOnce
-
final
def
:\[B](z: B)(op: ((K, V), B) ⇒ B): B
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
-
def
find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().find instead of .find on IterableOnce
-
def
flatMap[B](f: ((K, V)) ⇒ IterableOnce[B]): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().flatMap instead of .flatMap on IterableOnce or consider requiring an Iterable
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator().foldLeft instead of .foldLeft on IterableOnce
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator().foldRight instead of .foldLeft on IterableOnce
-
def
foreach[U](f: ((K, V)) ⇒ U): Unit
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator().foreach(...) instead of .foreach(...) on IterableOnce
-
final
def
hasDefiniteSize: Boolean
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .knownSize >=0 instead of .hasDefiniteSize
-
def
isEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().isEmpty instead of .isEmpty on IterableOnce
-
def
map[B](f: ((K, V)) ⇒ B): IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().map instead of .map on IterableOnce or consider requiring an Iterable
-
def
mkString: String
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce
-
def
mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce
-
final
def
stringPrefix: String
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use className instead of stringPrefix
-
def
toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ArrayBuffer.from(it).toArray
-
def
toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer
-
final
def
toBuffer[B >: (K, V)]: Buffer[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer
-
def
toIterator: Iterator[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) toIterator has been renamed to iterator()
-
final
def
toIterator: Iterator[(K, V)]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator() instead of .toIterator
-
def
toList: List[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use List.from(it) instead of it.toList
-
def
toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use Map.from(it) instead of it.toVector on IterableOnce
-
def
toSeq: Seq[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use Seq.from(it) instead of it.toSeq
-
def
toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use Set.from(it) instead of it.toSet
-
def
toStream: LazyList[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use LazyList.from(it) instead of it.toStream
-
final
def
toStream: LazyList[(K, V)]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use LazyList.from(it) instead of it.toStream
-
def
toVector: Vector[(K, V)]
- Implicit
- This member is added by an implicit conversion from TreeMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(treeMap: IterableOnceExtensionMethods[(K, V)]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use Vector.from(it) instead of it.toVector on IterableOnce