final def !=(arg0: Any): Boolean

Definition Classes: AnyRef → Any

final def ##(): Int

Definition Classes: AnyRef → Any

final def ++[B >: (K, W)](suffix: Iterable[B]): View[B]

Alias for concat

Definition Classes: IterableOps
Annotations: @inline()

final def ==(arg0: Any): Boolean

Definition Classes: AnyRef → Any

final def asInstanceOf[T0]: T0

Definition Classes: Any

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: View → IterableOps

def clone(): AnyRef

Attributes: protected[java.lang]
Definition Classes: AnyRef
Annotations: @throws( ... )

final def coll: MapValues.this.type

returns: This collection as a C.

Attributes: protected[this]
Definition Classes: View → IterableOps

def collect[B](pf: PartialFunction[(K, W), B]): View[B]

Definition Classes: IterableOps

def collectFirst[B](pf: PartialFunction[(K, W), B]): Option[B]

Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

$mayNotTerminateInf $orderDependent

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

final def concat[B >: (K, W)](suffix: Iterable[B]): View[B]

Definition Classes: IterableOps
Annotations: @inline()

def copyToArray[B >: (K, W)](xs: Array[B], start: Int = 0): xs.type

Copy all elements of this collection to array xs, starting at start.

Definition Classes: IterableOps

def count(p: ((K, W)) ⇒ Boolean): Int

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 drop(n: Int): View[(K, W)]

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): View[(K, W)]

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, W)) ⇒ Boolean): View[(K, W)]

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 exists(p: ((K, W)) ⇒ Boolean): Boolean

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 predicate p is satisfied by at least one element of this $coll, otherwise false

Definition Classes: IterableOps

val f: (V) ⇒ W

def filter(pred: ((K, W)) ⇒ Boolean): View[(K, W)]

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, W)) ⇒ Boolean): View[(K, W)]

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, W)) ⇒ Boolean): Option[(K, W)]

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, or None if none exists.

Definition Classes: IterableOps

def flatMap[B](f: ((K, W)) ⇒ IterableOnce[B]): View[B]

Flatmap

Definition Classes: IterableOps

def flatten[B](implicit ev: ((K, W)) ⇒ IterableOnce[B]): View[B]

Definition Classes: IterableOps

def foldLeft[B](z: B)(op: (B, (K, W)) ⇒ B): B

Fold left

Definition Classes: IterableOps

def foldRight[B](z: B)(op: ((K, W), B) ⇒ B): B

Fold right

Definition Classes: IterableOps

def forall(p: ((K, W)) ⇒ Boolean): Boolean

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 predicate p holds for all elements of this $coll, otherwise false.

Definition Classes: IterableOps

def foreach[U](f: ((K, W)) ⇒ U): Unit

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]): View[E]

Attributes: protected[this]
Definition Classes: IterableOps

def fromSpecificIterable(coll: Iterable[(K, W)]): View[(K, W)]

Attributes: protected[this]
Definition Classes: View → IterableOps

final def getClass(): Class[_]

Definition Classes: AnyRef → Any

def groupBy[K](f: ((K, W)) ⇒ K): immutable.Map[K, View[(K, W)]]

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 elements x for which f(x) equals k.

Definition Classes: IterableOps

def groupMap[K, B](key: ((K, W)) ⇒ K)(f: ((K, W)) ⇒ B): immutable.Map[K, View[B]]

Partitions this $coll into a map of ${coll}s according to a discriminator function key.

Partitions this $coll into a map of ${coll}s according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

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

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

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

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, W)) ⇒ K)(f: ((K, W)) ⇒ B)(reduce: (B, B) ⇒ B): immutable.Map[K, B]

Partitions this $coll into a map according to a discriminator function key.

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

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

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

Definition Classes: IterableOps

def grouped(size: Int): Iterator[View[(K, W)]]

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 size size if the elements don't divide evenly.

Definition Classes: IterableOps
See also: scala.collection.Iterator, method grouped

def head: (K, W)

The first element of the collection.

Definition Classes: IterableOps

def init: View[(K, W)]

The initial part of the collection without its last element.

Definition Classes: IterableOps

def isEmpty: Boolean

Is the collection empty?

Definition Classes: IterableOps

final def isInstanceOf[T0]: Boolean

Definition Classes: Any

def iterableFactory: View.type

Definition Classes: View → IterableOps

def iterator(): Iterator[(K, W)]

Iterator can be used only once

Definition Classes: MapValues → IterableOnce

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: MapValues → IterableOps → IterableOnce

def last: (K, W)

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 lastOption: Option[(K, W)]

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 map[B](f: ((K, W)) ⇒ B): View[B]

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, W)

[use case] Finds the largest element.

[use case]

Finds the largest element.

returns: the largest element of this $coll.

Definition Classes: IterableOps

def maxBy[B](f: ((K, W)) ⇒ B): (K, W)

[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

def min: (K, W)

[use case] Finds the smallest element.

[use case]

Finds the smallest element.

returns: the smallest element of this $coll

Definition Classes: IterableOps

def minBy[B](f: ((K, W)) ⇒ B): (K, W)

[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

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.

Definition Classes: IterableOps

final def ne(arg0: AnyRef): Boolean

Definition Classes: AnyRef

def newSpecificBuilder(): Builder[(K, W), View[(K, W)]]

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: View → IterableOps

def nonEmpty: Boolean

Is the collection not empty?

Definition Classes: IterableOps

final def notify(): Unit

Definition Classes: AnyRef

final def notifyAll(): Unit

Definition Classes: AnyRef

def partition(p: ((K, W)) ⇒ Boolean): (View[(K, W)], View[(K, W)])

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 in Buildable, which requires only a single traversal.

Definition Classes: IterableOps

def product: (K, W)

[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 of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the $coll and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

Definition Classes: IterableOps

def reduce[B >: (K, W)](op: (B, B) ⇒ B): B

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, W)](op: (B, (K, W)) ⇒ 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 x₁, ..., x_n are the elements of this $coll.

Definition Classes: IterableOps
Exceptions thrown: UnsupportedOperationException if this $coll is empty.

def reduceLeftOption[B >: (K, W)](op: (B, (K, W)) ⇒ 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, W)](op: (B, B) ⇒ B): Option[B]

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, and None otherwise.

Definition Classes: IterableOps

def reduceRight[B >: (K, W)](op: ((K, W), 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 x₁, ..., x_n are the elements of this $coll.

Definition Classes: IterableOps
Exceptions thrown: UnsupportedOperationException if this $coll is empty.

def reduceRightOption[B >: (K, W)](op: ((K, W), 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, W)]

Attributes: protected[this]
Definition Classes: IterableOps

def scan[B >: (K, W)](z: B)(op: (B, B) ⇒ B): View[B]

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, W)) ⇒ B): View[B]

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, W), B) ⇒ B): View[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): View[(K, W)]

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) index until of this $coll.

Definition Classes: IterableOps

def sliding(size: Int, step: Int): Iterator[View[(K, W)]]

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 than size elements remaining to be grouped.

Definition Classes: IterableOps
See also: scala.collection.Iterator, method sliding

def sliding(size: Int): Iterator[View[(K, W)]]

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 than size elements remaining to be grouped.

Definition Classes: IterableOps
See also: scala.collection.Iterator, method sliding

def span(p: ((K, W)) ⇒ Boolean): (View[(K, W)], View[(K, W)])

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 predicate p 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): (View[(K, W)], View[(K, W)])

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, W)

[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 of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the $coll and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

Definition Classes: IterableOps

final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes: AnyRef

def tail: View[(K, W)]

The rest of the collection without its first element.

Definition Classes: IterableOps

def take(n: Int): View[(K, W)]

A collection containing the first n elements of this collection.

Definition Classes: IterableOps

def takeRight(n: Int): View[(K, W)]

A collection containing the last n elements of this collection.

Definition Classes: IterableOps

def takeWhile(p: ((K, W)) ⇒ Boolean): View[(K, W)]

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](factory: Factory[(K, W), C1]): C1

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

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

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

Definition Classes: IterableOps

def toArray[B >: (K, W)](implicit arg0: ClassTag[B]): Array[B]

Convert collection to array.

Definition Classes: IterableOps

final def toIterable: MapValues.this.type

The collection itself

returns: This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

Definition Classes: Iterable → IterableOps

def toString(): String

Definition Classes: View → IterableOps → AnyRef → Any

val underlying: Iterable[(K, V)]

def unzip[A1, A2](implicit asPair: <:<[(K, W), (A1, A2)]): (View[A1], View[A2])

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, W)]

A view representing the elements of this collection.

Definition Classes: View → 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, W)) ⇒ Boolean): collection.WithFilter[(K, W), View]

Creates a non-strict filter of this $coll.

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

p: the predicate used to test elements.
returns: an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this $coll which satisfy the predicate p.

Definition Classes: IterableOps

def zip[B](xs: Iterable[B]): View[((K, W), 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 and that. The length of the returned collection is the minimum of the lengths of this $coll and that.

Definition Classes: IterableOps

def zipWithIndex: View[((K, W), Int)]

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 at 0.

Definition Classes: IterableOps

Packages

MapValues

case class MapValues[K, V, W](underlying: Iterable[(K, V)], f: (V) ⇒ W) extends View[(K, W)] with Product with Serializable

Instance Constructors

Type Members

Value Members

def max[B >: (K, W)](implicit ord: Ordering[B]): (K, W)

def maxBy[B](f: ((K, W)) ⇒ B)(implicit cmp: Ordering[B]): (K, W)

def min[B >: (K, W)](implicit ord: Ordering[B]): (K, W)

def minBy[B](f: ((K, W)) ⇒ B)(implicit cmp: Ordering[B]): (K, W)

def product[B >: (K, W)](implicit num: Numeric[B]): B

def sum[B >: (K, W)](implicit num: Numeric[B]): B

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from View[(K, W)]

Inherited from Iterable[(K, W)]

Inherited from IterableOps[(K, W), View, View[(K, W)]]

Inherited from IterableOnce[(K, W)]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

MapValues 

case class MapValues[K, V, W](underlying: Iterable[(K, V)], f: (V) ⇒ W) extends View[(K, W)] with Product with Serializable

Instance Constructors

Type Members

Value Members

def max[B >: (K, W)](implicit ord: Ordering[B]): (K, W)

def maxBy[B](f: ((K, W)) ⇒ B)(implicit cmp: Ordering[B]): (K, W)

def min[B >: (K, W)](implicit ord: Ordering[B]): (K, W)

def minBy[B](f: ((K, W)) ⇒ B)(implicit cmp: Ordering[B]): (K, W)

def product[B >: (K, W)](implicit num: Numeric[B]): B

def sum[B >: (K, W)](implicit num: Numeric[B]): B

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from View[(K, W)]

Inherited from Iterable[(K, W)]

Inherited from IterableOps[(K, W), View, View[(K, W)]]

Inherited from IterableOnce[(K, W)]

Inherited from AnyRef

Inherited from Any

Ungrouped

MapValues