trait SortedMapOps[K, +V, +CC[X, Y] <: SortedMap[X, Y] with SortedMapOps[X, Y, CC, _], +C <: SortedMap[K, V]] extends MapOps[K, V, Map, C] with SortedOps[K, C]
- Alphabetic
- By Inheritance
- SortedMapOps
- SortedOps
- MapOps
- Equals
- PartialFunction
- Function1
- IterableOps
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
class
WithFilter
extends AnyRef
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
-
class
MapWithFilter
extends WithFilter
Specializes
WithFilter
for Map collection typesSpecializes
WithFilter
for Map collection types- Definition Classes
- MapOps
-
class
SortedMapWithFilter
extends MapWithFilter
Specializes
MapWithFilter
for sorted Map collections
Abstract Value Members
-
abstract
def
coll: Map[K, V]
- Attributes
- protected[this]
- Definition Classes
- MapOps → IterableOps
-
abstract
def
empty: C
The empty map of the same type as this map
The empty map of the same type as this map
- returns
an empty map of type
Repr
.
- Definition Classes
- MapOps
-
abstract
def
fromSpecificIterable(coll: Iterable[(K, V)]): C
- Attributes
- protected[this]
- Definition Classes
- IterableOps
-
abstract
def
get(key: K): Option[V]
Optionally returns the value associated with a key.
Optionally returns the value associated with a key.
- key
the key value
- returns
an option value containing the value associated with
key
in this map, orNone
if none exists.
- Definition Classes
- MapOps
-
abstract
def
iterableFactory: IterableFactory[Iterable]
- Definition Classes
- IterableOps
-
abstract
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
- SortedOps
-
abstract
def
mapFactory: MapFactory[Map]
- Definition Classes
- MapOps
-
abstract
def
mapFromIterable[K2, V2](it: 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[this]
- Definition Classes
- MapOps
-
abstract
def
newSpecificBuilder(): Builder[(K, V), C]
- 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 on top of views rather than builders.
- Attributes
- protected[this]
- Definition Classes
- IterableOps
-
implicit abstract
def
ordering: Ordering[K]
- Definition Classes
- SortedOps
-
abstract
def
rangeImpl(from: Option[K], until: Option[K]): C
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.
- Definition Classes
- SortedOps
- abstract def sortedMapFactory: SortedMapFactory[CC]
-
abstract
def
sortedMapFromIterable[K2, V2](it: Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
- Attributes
- protected[this]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[V2 >: V](xs: Iterable[(K, V2)]): CC[K, V2]
Alias for
concat
Alias for
concat
- Definition Classes
- SortedMapOps → MapOps
-
final
def
++[K2 >: K, V2 >: V](xs: IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
Alias for
concat
Alias for
concat
- Annotations
- @inline()
-
final
def
++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
Alias for
concat
Alias for
concat
- Definition Classes
- IterableOps
- Annotations
- @inline()
-
final
def
++:[B >: (K, V)](prefix: Iterable[B]): Iterable[B]
Alias for
prependAll
Alias for
prependAll
- Definition Classes
- IterableOps
- 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[A1 <: K, B1 >: V](x: A1, default: (A1) ⇒ B1): B1
- Definition Classes
- PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- MapOps → 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)
- Definition Classes
- IterableOps
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
-
def
collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]
- Definition Classes
- IterableOps
-
def
compose[A](g: (A) ⇒ K): (A) ⇒ V
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
concat[V2 >: V](xs: Iterable[(K, V2)]): CC[K, V2]
- Definition Classes
- SortedMapOps → MapOps
-
def
concat[K2 >: K, V2 >: V](xs: IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
Returns a new $coll containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new $coll containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the $coll is the most specific superclass encompassing the element types of the two operands.
- K2
the type of the keys of the returned $coll.
- V2
the type of the values of the returned $coll.
- xs
the traversable to append.
- returns
a new collection of type
CC[K2, V2]
which contains all elements of this $coll followed by all elements ofxs
.
-
def
concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
Returns a new $coll containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new $coll containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the $coll 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 collection of type
CC[B]
which contains all elements of this $coll followed by all elements ofsuffix
.
- 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 $coll which satisfy a predicate.
Counts the number of elements in the $coll 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): C
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
- IterableOps
-
def
dropRight(n: Int): C
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
- IterableOps
-
def
dropWhile(p: ((K, V)) ⇒ Boolean): C
Skips longest sequence of elements of this iterator which satisfy given predicate
p
, and returns an iterator of the remaining elements.Skips longest sequence of elements of this iterator which satisfy given predicate
p
, and returns an iterator of the remaining elements.- p
the predicate used to skip elements.
- returns
an iterator consisting of the remaining elements
- Definition Classes
- IterableOps
- Note
Reuse: $consumesAndProducesIterator
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(o: Any): Boolean
- Definition Classes
- MapOps → Equals → AnyRef → Any
-
def
exists(p: ((K, V)) ⇒ Boolean): Boolean
Tests whether a predicate holds for at least one element of this $coll.
Tests whether a predicate holds for at least one element of this $coll.
$mayNotTerminateInf
- p
the predicate used to test elements.
- returns
true
if the given predicatep
is satisfied by at least one element of this $coll, otherwisefalse
- Definition Classes
- IterableOps
-
def
filter(pred: ((K, V)) ⇒ Boolean): C
Selects all elements of this $coll which satisfy a predicate.
Selects all elements of this $coll which satisfy a predicate.
- pred
the predicate used to test elements.
- returns
a new $coll consisting of all elements of this $coll that satisfy the given predicate
pred
. Their order may not be preserved.
- Definition Classes
- IterableOps
-
def
filterNot(pred: ((K, V)) ⇒ Boolean): C
Selects all elements of this $coll which do not satisfy a predicate.
Selects all elements of this $coll which do not satisfy a predicate.
- pred
the predicate used to test elements.
- returns
a new $coll consisting of all elements of this $coll that do not satisfy the given predicate
pred
. Their order may not be preserved.
- Definition Classes
- 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 $coll satisfying a predicate, if any.
Finds the first element of the $coll satisfying a predicate, if any.
$mayNotTerminateInf $orderDependent
- p
the predicate used to test elements.
- returns
an option value containing the first element in the $coll 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
- SortedMapOps → SortedOps
- def flatMap[K2, V2](f: ((K, V)) ⇒ IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): CC[K2, V2]
-
def
flatMap[K2, V2](f: ((K, V)) ⇒ IterableOnce[(K2, V2)]): Map[K2, V2]
- Definition Classes
- MapOps
-
def
flatMap[B](f: ((K, V)) ⇒ IterableOnce[B]): Iterable[B]
Flatmap
Flatmap
- Definition Classes
- IterableOps
-
def
flatten[B](implicit ev: ((K, V)) ⇒ IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
Fold left
Fold left
- Definition Classes
- IterableOps
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
Fold right
Fold right
- Definition Classes
- IterableOps
-
def
forall(p: ((K, V)) ⇒ Boolean): Boolean
Tests whether a predicate holds for all elements of this $coll.
Tests whether a predicate holds for all elements of this $coll.
$mayNotTerminateInf
- p
the predicate used to test elements.
- returns
true
if this $coll is empty or the given predicatep
holds for all elements of this $coll, 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
- IterableOps
-
def
fromIterable[E](it: Iterable[E]): Iterable[E]
- Attributes
- protected[this]
- Definition Classes
- IterableOps
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
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): immutable.Map[K, C]
Partitions this $coll into a map of ${coll}s according to some discriminator function.
Partitions this $coll into a map of ${coll}s 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 ${coll}s 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 $coll of those elementsx
for whichf(x)
equalsk
.
- Definition Classes
- IterableOps
-
def
grouped(size: Int): Iterator[C]
Partitions elements in fixed size ${coll}s.
Partitions elements in fixed size ${coll}s.
- size
the number of elements per group
- returns
An iterator producing ${coll}s 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
- MapOps → AnyRef → Any
-
def
head: (K, V)
The first element of the collection.
The first element of the collection.
- Definition Classes
- IterableOps
-
def
init: C
The initial part of the collection without its last element.
The initial part of the collection without its last element.
- Definition Classes
- IterableOps
-
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
Is the collection empty?
Is the collection empty?
- Definition Classes
- IterableOps
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
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.
- Definition Classes
- IterableOps
-
def
last: (K, V)
Selects the last element.
Selects the last element. $orderDependent
- returns
The last element of this $coll.
- Definition Classes
- IterableOps
- Exceptions thrown
NoSuchElementException
If the $coll is empty.
-
def
lastKey: K
Returns the last key of the collection.
Returns the last key of the collection.
- Definition Classes
- SortedMapOps → SortedOps
-
def
lastOption: Option[(K, V)]
Optionally selects the last element.
Optionally selects the last element. $orderDependent
- returns
the last element of this $coll$ if it is nonempty,
None
if it is empty.
- Definition Classes
- IterableOps
-
def
lift: (K) ⇒ Option[V]
- Definition Classes
- PartialFunction
- def map[K2, V2](f: ((K, V)) ⇒ (K2, V2))(implicit ordering: Ordering[K2]): CC[K2, V2]
-
def
map[K2, V2](f: ((K, V)) ⇒ (K2, V2)): Map[K2, V2]
- Definition Classes
- MapOps
-
def
map[B](f: ((K, V)) ⇒ B): Iterable[B]
Builds a new collection by applying a function to all elements of this $coll.
Builds a new collection by applying a function to all elements of this $coll.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new $coll resulting from applying the given function
f
to each element of this $coll and collecting the results.
- Definition Classes
- IterableOps
-
def
max: (K, V)
[use case] Finds the largest element.
[use case]Finds the largest element.
- returns
the largest element of this $coll.
- Definition Classes
- IterableOps
Full Signaturedef max[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
-
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 $coll 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 $coll
- Definition Classes
- IterableOps
Full Signaturedef min[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
-
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 $coll 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: String
- Definition Classes
- IterableOps
-
def
mkString(sep: String): String
- Definition Classes
- IterableOps
-
def
mkString(start: String, sep: String, end: String): String
A string showing all elements of this collection, separated by string
sep
.A string showing all elements of this collection, separated by string
sep
.- Definition Classes
- IterableOps
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nonEmpty: Boolean
Is the collection not empty?
Is the collection not empty?
- Definition Classes
- IterableOps
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
partition(p: ((K, V)) ⇒ Boolean): (C, C)
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
- IterableOps
-
def
prependAll[B](that: <error>): <error>
[use case] As with
++
, returns a new collection containing the elements from the left operand followed by the elements from the right operand.[use case]As with
++
, returns a new collection containing the elements from the left operand followed by the elements from the right operand.It differs from
++
in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.Example:
scala> val x = List(1) x: List[Int] = List(1) scala> val y = Vector(2) y: scala.collection.immutable.Vector[Int] = Vector(2) scala> val z = x ++: y z: scala.collection.immutable.Vector[Int] = Vector(1, 2)
- B
the element type of the returned collection.
- returns
a new $coll which contains all elements of
prefix
followed by all the elements of this $coll.
- Definition Classes
- 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 $coll of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the $coll 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): C
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
Creates a ranged projection of this collection with both a lower-bound and an upper-bound.
- from
The lower-bound (inclusive) of the ranged projection.
- until
The upper-bound (exclusive) of the ranged projection.
- Definition Classes
- SortedOps
-
def
reduce[B >: (K, V)](op: (B, B) ⇒ B): B
Reduces the elements of this $coll using the specified associative binary operator.
Reduces the elements of this $coll using the specified associative binary operator.
$undefinedorder
- 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 $coll is nonempty.
- Definition Classes
- IterableOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
-
def
reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
Applies a binary operator to all elements of this $coll, going left to right.
Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this $coll, going left to right:op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
where
x1, ..., xn
are the elements of this $coll.
- Definition Classes
- IterableOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
-
def
reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going left to right.
Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceLeft(op)
if this $coll is nonempty,None
otherwise.
- Definition Classes
- IterableOps
-
def
reduceOption[B >: (K, V)](op: (B, B) ⇒ B): Option[B]
Reduces the elements of this $coll, if any, using the specified associative binary operator.
Reduces the elements of this $coll, if any, using the specified associative binary operator.
$undefinedorder
- 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 $coll, going right to left.
Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
op
between consecutive elements of this $coll, going right to left:op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
where
x1, ..., xn
are the elements of this $coll.
- Definition Classes
- IterableOps
- Exceptions thrown
UnsupportedOperationException
if this $coll is empty.
-
def
reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
Optionally applies a binary operator to all elements of this $coll, going right to left.
Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold
- B
the result type of the binary operator.
- op
the binary operator.
- returns
an option value containing the result of
reduceRight(op)
if this $coll is nonempty,None
otherwise.
- Definition Classes
- IterableOps
-
def
reversed: 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 $coll containing the prefix scan of the elements in this $coll
- 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.
$willNotTerminateInf $orderDependent
- 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
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. $willNotTerminateInf $orderDependent
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 number of elements in this collection.
The number of elements in this collection. Does not terminate for infinite collections.
- Definition Classes
- IterableOps
-
def
slice(from: Int, until: Int): C
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
$orderDependent
- from
the lowest index to include from this $coll.
- until
the lowest index to EXCLUDE from this $coll.
- returns
a $coll containing the elements greater than or equal to index
from
extending up to (but not including) indexuntil
of this $coll.
- Definition Classes
- IterableOps
-
def
sliding(size: Int, step: Int): Iterator[C]
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 ${coll}s 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[C]
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 ${coll}s 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
span(p: ((K, V)) ⇒ Boolean): (C, C)
Splits this $coll into a prefix/suffix pair according to a predicate.
Splits this $coll 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. $orderDependent- p
the test predicate
- returns
a pair consisting of the longest prefix of this $coll whose elements all satisfy
p
, and the rest of this $coll.
- Definition Classes
- IterableOps
-
def
splitAt(n: Int): (C, C)
Splits this $coll into two at a given position.
Splits this $coll into two at a given position. Note:
c splitAt n
is equivalent to (but possibly more efficient than)(c take n, c drop n)
. $orderDependent- n
the position at which to split.
- returns
a pair of ${coll}s consisting of the first
n
elements of this $coll, 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 $coll of numbers of type
Int
. Instead ofInt
, any other typeT
with an implicitNumeric[T]
implementation can be used as element type of the $coll 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: C
The rest of the collection without its first element.
The rest of the collection without its first element.
- Definition Classes
- IterableOps
-
def
take(n: Int): C
A collection containing the first
n
elements of this collection.A collection containing the first
n
elements of this collection.- Definition Classes
- IterableOps
-
def
takeRight(n: Int): C
A collection containing the last
n
elements of this collection.A collection containing the last
n
elements of this collection.- Definition Classes
- IterableOps
-
def
takeWhile(p: ((K, V)) ⇒ Boolean): C
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate. $orderDependent
- p
The predicate used to test elements.
- returns
the longest prefix of this $coll whose elements all satisfy the predicate
p
.
- Definition Classes
- IterableOps
-
def
to[C1](f: CanBuild[(K, V), C1]): C1
Given a collection factory
fi
, convert this collection to the appropriate representation for the current element typeA
.Given a collection factory
fi
, 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
toString(): String
- Definition Classes
- Function1 → AnyRef → Any
-
def
unzip[A1, A2](implicit asPair: <:<[(K, V), (A1, A2)]): (Iterable[A1], Iterable[A2])
Converts this $coll of pairs into two collections of the first and second half of each pair.
Converts this $coll of pairs into two collections of the first and second half of each pair.
val xs = $Coll( (1, "one"), (2, "two"), (3, "three")).unzip // xs == ($Coll(1, 2, 3), // $Coll(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 $coll is a pair.
- returns
a pair of ${coll}s, containing the first, respectively second half of each element pair of this $coll.
- Definition Classes
- IterableOps
-
def
view: View[(K, V)]
A view representing the elements of this collection.
A view representing 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
- @throws( ... )
-
def
withFilter(p: ((K, V)) ⇒ Boolean): SortedMapWithFilter
Creates a non-strict filter of this $coll.
Creates a non-strict filter of this $coll.
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. $orderDependent- 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 $coll which satisfy the predicatep
.
- Definition Classes
- SortedMapOps → MapOps → IterableOps
-
def
zip[B](xs: IterableOnce[B]): Iterable[((K, V), B)]
Returns a $coll formed from this $coll and another iterable collection by combining corresponding elements in pairs.
Returns a $coll formed from this $coll 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
- xs
The iterable providing the second half of each result pair
- returns
a new collection of type
That
containing pairs consisting of corresponding elements of this $coll andthat
. The length of the returned collection is the minimum of the lengths of this $coll andthat
.
- Definition Classes
- IterableOps
-
def
zipWithIndex: Iterable[((K, V), Int)]
Zips this $coll with its indices.
Zips this $coll with its indices.
- returns
A new collection of type
That
containing pairs consisting of all elements of this $coll paired with their index. Indices start at0
.
- Definition Classes
- IterableOps
List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))
Example: