# GenTraversableViewLike

#### trait GenTraversableViewLike[+A, +Coll, +This <: GenTraversableView[A, Coll] with GenTraversableViewLike[A, Coll, This]] extends GenTraversable[A] with GenTraversableLike[A, This]

Self Type
GenTraversableViewLike[A, Coll, This]
Source
GenTraversableViewLike.scala
Linear Supertypes
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. Hide All
2. Show all
1. GenTraversableViewLike
2. GenTraversable
3. GenericTraversableTemplate
4. HasNewBuilder
5. GenTraversableLike
6. Parallelizable
7. GenTraversableOnce
8. AnyRef
9. Any
Visibility
1. Public
2. All

### Type Members

6. #### trait Forced[B] extends Transformed[B]

A fall back which forces everything into a vector and then applies an operation on it.

10. #### trait Transformed[+B] extends GenTraversableView[B, Coll]

The implementation base trait of this view.

### Abstract Value Members

1. #### abstract def /:[B](z: B)(op: (B, A) ⇒ B): B

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

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

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

Examples:

Note that the folding function used to compute b is equivalent to that used to compute c.

```     scala> val a = LinkedList(1,2,3,4)

scala> val b = (5 /: a)(_+_)
b: Int = 15

scala> val c = (5 /: a)((x,y) => x + y)
c: Int = 15
```

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 collection, going left to right with the start value `z` on the left:

```            op(...op(op(z, x1), x2), ..., xn)
```

where `x1, ..., xn` are the elements of this collection.

Definition Classes
GenTraversableOnce
2. #### abstract def :\[B](z: B)(op: (A, B) ⇒ B): B

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

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

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

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.

Examples:

Note that the folding function used to compute b is equivalent to that used to compute c.

```     scala> val a = LinkedList(1,2,3,4)

scala> val b = (a :\ 5)(_+_)
b: Int = 15

scala> val c = (a :\ 5)((x,y) => x + y)
c: Int = 15

```
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 collection, going right to left with the start value `z` on the right:

```            op(x1, op(x2, ... op(xn, z)...))
```

where `x1, ..., xn` are the elements of this collection.

Definition Classes
GenTraversableOnce
3. #### abstract def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

Aggregates the results of applying an operator to subsequent elements.

Aggregates the results of applying an operator to subsequent elements.

This is a more general form of `fold` and `reduce`. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using `seqop` to update the result, and then applies `combop` to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so `combop` may be invoked an arbitrary number of times.

For example, one might want to process some elements and then produce a `Set`. In this case, `seqop` would process an element and append it to the list, while `combop` would concatenate two lists from different partitions together. The initial value `z` would be an empty set.

```   pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
```

Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

B

the type of accumulated results

z

the initial value for the accumulated result of the partition - this will typically be the neutral element for the `seqop` operator (e.g. `Nil` for list concatenation or `0` for summation)

seqop

an operator used to accumulate results within a partition

combop

an associative operator used to combine results from different partitions

Definition Classes
GenTraversableOnce
4. #### abstract def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
GenTraversableOnce
5. #### abstract def count(p: (A) ⇒ Boolean): Int

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

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

p

the predicate used to test elements.

returns

the number of elements satisfying the predicate `p`.

Definition Classes
GenTraversableOnce
6. #### abstract def drop(n: Int): This

Selects all elements except first n ones.

Selects all elements except first n ones.

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

n

the number of elements to drop from this collection.

returns

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

Definition Classes
GenTraversableLike
7. #### abstract def dropWhile(pred: (A) ⇒ Boolean): This

Drops longest prefix of elements that satisfy a predicate.

Drops longest prefix of elements that satisfy a predicate.

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

returns

the longest suffix of this collection whose first element does not satisfy the predicate `p`.

Definition Classes
GenTraversableLike
8. #### abstract def exists(pred: (A) ⇒ Boolean): Boolean

Definition Classes
GenTraversableOnce
9. #### abstract def filter(pred: (A) ⇒ Boolean): This

Selects all elements of this collection which satisfy a predicate.

Selects all elements of this collection which satisfy a predicate.

returns

a new collection consisting of all elements of this collection that satisfy the given predicate `p`. Their order may not be preserved.

Definition Classes
GenTraversableLike
10. #### abstract def filterNot(pred: (A) ⇒ Boolean): This

Selects all elements of this collection which do not satisfy a predicate.

Selects all elements of this collection which do not satisfy a predicate.

returns

a new collection consisting of all elements of this collection that do not satisfy the given predicate `p`. Their order may not be preserved.

Definition Classes
GenTraversableLike
11. #### abstract def find(pred: (A) ⇒ Boolean): Option[A]

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

Finds the first element of the 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.

returns

an option value containing the first element in the collection that satisfies `p`, or `None` if none exists.

Definition Classes
GenTraversableOnce
12. #### abstract def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

Folds the elements of this collection using the specified associative binary operator.

Folds the elements of this collection using the specified associative binary operator.

The order in which operations are performed on elements is unspecified and may be nondeterministic.

A1

a type parameter for the binary operator, a supertype of `A`.

z

a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., `Nil` for list concatenation, 0 for addition, or 1 for multiplication.)

op

a binary operator that must be associative

returns

the result of applying fold operator `op` between all the elements and `z`

Definition Classes
GenTraversableOnce
13. #### abstract def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

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

Applies a binary operator to a start value and all elements of this 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 collection, going left to right with the start value `z` on the left:

```            op(...op(z, x1), x2, ..., xn)
```

where `x1, ..., xn` are the elements of this collection.

Definition Classes
GenTraversableOnce
14. #### abstract def foldRight[B](z: B)(op: (A, B) ⇒ B): B

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

Applies a binary operator to all elements of this 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 collection, going right to left with the start value `z` on the right:

```            op(x1, op(x2, ... op(xn, z)...))
```

where `x1, ..., xn` are the elements of this collection.

Definition Classes
GenTraversableOnce
15. #### abstract def forall(pred: (A) ⇒ Boolean): Boolean

Definition Classes
GenTraversableOnce

17. #### abstract def groupBy[K](f: (A) ⇒ K): GenMap[K, This]

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

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

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

K

the type of keys returned by the discriminator function.

f

the discriminator function.

returns

A map from keys to collections such that the following invariant holds:

```                (xs partition f)(k) = xs filter (x => f(x) == k)
```

That is, every key `k` is bound to a collection of those elements `x` for which `f(x)` equals `k`.

Definition Classes
GenTraversableLike
18. #### abstract def hasDefiniteSize: Boolean

Definition Classes
GenTraversableOnce
19. #### abstract def head: A

Selects the first element of this collection.

Selects the first element of this collection.

returns

the first element of this collection.

Definition Classes
GenericTraversableTemplate
Exceptions thrown
`NoSuchElementException`

if the collection is empty.

20. #### abstract def isEmpty: Boolean

Tests whether this collection is empty.

Tests whether this collection is empty.

returns

`true` if the collection contain no elements, `false` otherwise.

Definition Classes
GenericTraversableTemplate
21. #### abstract def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
GenTraversableOnce
22. #### abstract def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
GenTraversableOnce
23. #### abstract def mkString: String

Displays all elements of this collection in a string.

Displays all elements of this collection in a string.

returns

a string representation of this collection. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this collection follow each other without any separator string.

Definition Classes
GenTraversableOnce
24. #### abstract def mkString(sep: String): String

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

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

sep

the separator string.

returns

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

Definition Classes
GenTraversableOnce
Example:
1. `List(1, 2, 3).mkString("|") = "1|2|3"`

25. #### abstract def mkString(start: String, sep: String, end: String): String

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

Displays all elements of this collection 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 collection. The resulting string begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this collection are separated by the string `sep`.

Definition Classes
GenTraversableOnce
Example:
1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

26. #### abstract def nonEmpty: Boolean

Tests whether the collection is not empty.

Tests whether the collection is not empty.

returns

`true` if the collection contains at least one element, `false` otherwise.

Definition Classes
GenTraversableOnce
27. #### abstract def parCombiner: Combiner[A, ParIterable[A]]

The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

returns

a combiner for the parallel collection of type `ParRepr`

Attributes
protected[this]
Definition Classes
Parallelizable
28. #### abstract def partition(pred: (A) ⇒ Boolean): (This, This)

Partitions this collection in two collections according to a predicate.

Partitions this collection in two collections according to a predicate.

returns

a pair of collections: the first collection consists of all elements that satisfy the predicate `p` and the second collection consists of all elements that don't. The relative order of the elements in the resulting collections may not be preserved.

Definition Classes
GenTraversableLike
29. #### abstract def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

Reduces the elements of this collection using the specified associative binary operator.

Reduces the elements of this collection using the specified associative binary operator.

The order in which operations are performed on elements is unspecified and may be nondeterministic.

A1

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 collection is nonempty.

Definition Classes
GenTraversableOnce
Exceptions thrown
UnsupportedOperationException

if this collection is empty.

30. #### abstract def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

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

Optionally applies a binary operator to all elements of this 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)` is this collection is nonempty, `None` otherwise.

Definition Classes
GenTraversableOnce
31. #### abstract def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

Reduces the elements of this collection, if any, using the specified associative binary operator.

Reduces the elements of this collection, if any, using the specified associative binary operator.

The order in which operations are performed on elements is unspecified and may be nondeterministic.

A1

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
GenTraversableOnce
32. #### abstract def reduceRight[B >: A](op: (A, B) ⇒ B): B

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

Applies a binary operator to all elements of this 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 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 collection.

Definition Classes
GenTraversableOnce
Exceptions thrown
`UnsupportedOperationException`

if this collection is empty.

33. #### abstract def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

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

Optionally applies a binary operator to all elements of this 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)` is this collection is nonempty, `None` otherwise.

Definition Classes
GenTraversableOnce
34. #### abstract def repr: This

Definition Classes
GenTraversableLike
35. #### abstract def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[This, B, That]): That

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

That

type of the resulting collection

z

neutral element for the operator `op`

op

the associative operator for the scan

cbf

combiner factory which provides a combiner

returns

a new collection containing the prefix scan of the elements in this collection

Definition Classes
GenTraversableLike
36. #### abstract def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[This, B, That]): That

Produces a collection containing cummulative results of applying the operator going left to right.

Produces a collection containing cummulative results of applying the operator going left to right.

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

That

the actual type of the resulting collection

z

the initial value

op

the binary operator applied to the intermediate result and the element

bf

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

returns

collection with intermediate results

Definition Classes
GenTraversableLike
37. #### abstract def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[This, B, That]): That

Produces a collection containing cummulative results of applying the operator going right to left.

Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

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

That

the actual type of the resulting collection

z

the initial value

op

the binary operator applied to the intermediate result and the element

bf

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

returns

collection with intermediate results

Definition Classes
GenTraversableLike
Annotations
@migration
Migration

(Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

39. #### abstract def size: Int

The size of this collection.

The size of this collection.

Note: will not terminate for infinite-sized collections.

returns

the number of elements in this collection.

Definition Classes
GenTraversableLikeGenTraversableOnce
40. #### abstract def slice(unc_from: Int, unc_until: Int): This

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
```

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

returns

a collection containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this collection.

Definition Classes
GenTraversableLike
41. #### abstract def span(pred: (A) ⇒ Boolean): (This, This)

Splits this collection into a prefix/suffix pair according to a predicate.

Splits this collection into a prefix/suffix pair according to a predicate.

Note: `c span p` is equivalent to (but possibly more efficient than) `(c takeWhile p, c dropWhile p)`, provided the evaluation of the predicate `p` does not cause any side-effects.

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

returns

a pair consisting of the longest prefix of this collection whose elements all satisfy `p`, and the rest of this collection.

Definition Classes
GenTraversableLike
42. #### abstract def splitAt(n: Int): (This, This)

Splits this collection into two at a given position.

Splits this 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 collections consisting of the first `n` elements of this collection, and the other elements.

Definition Classes
GenTraversableLike
43. #### abstract def stringPrefix: String

Defines the prefix of this object's `toString` representation.

Defines the prefix of this object's `toString` representation.

returns

a string representation which starts the result of `toString` applied to this collection. By default the string prefix is the simple name of the collection class collection.

Definition Classes
GenTraversableLike
44. #### abstract def take(n: Int): This

Selects first n elements.

Selects first n elements.

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

n

Tt number of elements to take from this collection.

returns

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

Definition Classes
GenTraversableLike
45. #### abstract def takeWhile(pred: (A) ⇒ Boolean): This

Takes longest prefix of elements that satisfy a predicate.

Takes longest prefix of elements that satisfy a predicate.

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

returns

the longest prefix of this collection whose elements all satisfy the predicate `p`.

Definition Classes
GenTraversableLike
46. #### abstract def toBuffer[A1 >: A]: Buffer[A1]

Converts this collection to a mutable buffer.

Converts this collection to a mutable buffer.

Note: will not terminate for infinite-sized collections.

returns

a buffer containing all elements of this collection.

Definition Classes
GenTraversableOnce
47. #### abstract def toIndexedSeq: IndexedSeq[A]

Converts this collection to an indexed sequence.

Converts this collection to an indexed sequence.

Note: will not terminate for infinite-sized collections.

returns

an indexed sequence containing all elements of this collection.

Definition Classes
GenTraversableOnce
48. #### abstract def toIterable: GenIterable[A]

Converts this collection to an iterable collection.

Converts this collection to an iterable collection. Note that the choice of target `Iterable` is lazy in this default implementation as this `TraversableOnce` may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

Note: will not terminate for infinite-sized collections.

returns

an `Iterable` containing all elements of this collection.

Definition Classes
GenTraversableOnce
49. #### abstract def toIterator: Iterator[A]

Returns an Iterator over the elements in this collection.

Returns an Iterator over the elements in this collection. Will return the same Iterator if this instance is already an Iterator.

Note: will not terminate for infinite-sized collections.

returns

an Iterator containing all elements of this collection.

Definition Classes
GenTraversableOnce
50. #### abstract def toList: List[A]

Converts this collection to a list.

Converts this collection to a list.

Note: will not terminate for infinite-sized collections.

returns

a list containing all elements of this collection.

Definition Classes
GenTraversableOnce
51. #### abstract def toSeq: GenSeq[A]

Converts this collection to a sequence.

Converts this collection to a sequence. As with `toIterable`, it's lazy in this default implementation, as this `TraversableOnce` may be lazy and unevaluated.

Note: will not terminate for infinite-sized collections.

returns

a sequence containing all elements of this collection.

Definition Classes
GenTraversableOnce
52. #### abstract def toSet[A1 >: A]: GenSet[A1]

Converts this collection to a set.

Converts this collection to a set.

Note: will not terminate for infinite-sized collections.

returns

a set containing all elements of this collection.

Definition Classes
GenTraversableOnce
53. #### abstract def toStream: Stream[A]

Converts this collection to a stream.

Converts this collection to a stream.

Note: will not terminate for infinite-sized collections.

returns

a stream containing all elements of this collection.

Definition Classes
GenTraversableOnce
54. #### abstract def toTraversable: GenTraversable[A]

Converts this collection to an unspecified Traversable.

Converts this collection to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

Note: will not terminate for infinite-sized collections.

returns

a Traversable containing all elements of this collection.

Definition Classes
GenTraversableOnce

Attributes
protected
56. #### abstract def viewIdString: String

Attributes
protected[this]
57. #### abstract def viewIdentifier: String

Attributes
protected[this]

### Concrete Value Members

1. #### final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. #### final def !=(arg0: Any): Boolean

Test two objects for inequality.

Test two objects for inequality.

returns

`true` if !(this == that), false otherwise.

Definition Classes
Any
3. #### final def ##(): Int

Equivalent to `x.hashCode` except for boxed numeric types and `null`.

Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

returns

a hash value consistent with ==

Definition Classes
AnyRef → Any
4. #### abstract def ++[B](that: GenTraversableOnce[B]): CC[B]

[use case]

[use case]
B

the element type of the returned collection.

that

the traversable to append.

returns

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

Definition Classes
GenTraversableLike
5. #### def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

A syntactic sugar for out of order folding.

A syntactic sugar for out of order folding. See `fold`.

Example:

```     scala> val a = LinkedList(1,2,3,4)

scala> val b = (a /:\ 5)(_+_)
b: Int = 15
```
Definition Classes
GenTraversableOnce
6. #### final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
7. #### final def ==(arg0: Any): Boolean

Test two objects for equality.

Test two objects for equality. The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

returns

`true` if the receiver object is equivalent to the argument; `false` otherwise.

Definition Classes
Any
8. #### final def asInstanceOf[T0]: T0

Cast the receiver object to be of type `T0`.

Cast the receiver object to be of type `T0`.

Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(1).asInstanceOf[List[String]]` will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

returns

Definition Classes
Any
Exceptions thrown
ClassCastException

if the receiver object is not an instance of the erasure of type `T0`.

9. #### def clone(): AnyRef

Create a copy of the receiver object.

Create a copy of the receiver object.

The default implementation of the `clone` method is platform dependent.

returns

a copy of the receiver object.

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
()
Note

not specified by SLS as a member of AnyRef

10. #### abstract def collect[B](pf: PartialFunction[A, B]): CC[B]

[use case]

[use case]
B

the element type of the returned collection.

pf

the partial function which filters and maps the collection.

returns

a new 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
GenTraversableLike
11. #### def companion: GenericCompanion[GenTraversable]

The factory companion object that builds instances of class CC.

The factory companion object that builds instances of class CC. (or its `Iterable` superclass where class CC is not a `Seq`.)

Definition Classes
GenTraversableGenericTraversableTemplate
12. #### abstract def copyToArray(xs: Array[A], start: Int): Unit

[use case]

[use case]
xs

the array to fill.

start

the starting index.

Definition Classes
GenTraversableOnce
13. #### abstract def copyToArray(xs: Array[A]): Unit

[use case]

[use case]
xs

the array to fill.

Definition Classes
GenTraversableOnce
14. #### final def eq(arg0: AnyRef): Boolean

Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

• It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
• For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
• `null.eq(null)` returns `true`.

When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

returns

`true` if the argument is a reference to the receiver object; `false` otherwise.

Definition Classes
AnyRef
15. #### def equals(arg0: Any): Boolean

The equality method for reference types.

The equality method for reference types. Default implementation delegates to `eq`.

See also `equals` in Any.

returns

`true` if the receiver object is equivalent to the argument; `false` otherwise.

Definition Classes
AnyRef → Any
16. #### def finalize(): Unit

Called by the garbage collector on the receiver object when there are no more references to the object.

Called by the garbage collector on the receiver object when there are no more references to the object.

The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
()
Note

not specified by SLS as a member of AnyRef

17. #### abstract def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): CC[B]

[use case]

[use case]
B

the element type of the returned collection.

f

the function to apply to each element.

returns

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

Definition Classes
GenTraversableLike
18. #### def flatten[B]: CC[B]

[use case]

[use case]
B

the type of the elements of each traversable collection.

returns

a new collection resulting from concatenating all element collections.

Definition Classes
GenericTraversableTemplate
19. #### abstract def foreach(f: (A) ⇒ Unit): Unit

[use case]

[use case]
f

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

Definition Classes
GenericTraversableTemplate
20. #### def genericBuilder[B]: Builder[B, GenTraversable[B]]

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

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

Definition Classes
GenericTraversableTemplate
21. #### final def getClass(): Class[_]

A representation that corresponds to the dynamic class of the receiver object.

A representation that corresponds to the dynamic class of the receiver object.

The nature of the representation is platform dependent.

returns

a representation that corresponds to the dynamic class of the receiver object.

Definition Classes
AnyRef → Any
Note

not specified by SLS as a member of AnyRef

22. #### def hashCode(): Int

The hashCode method for reference types.

The hashCode method for reference types. See hashCode in Any.

returns

the hash code value for this object.

Definition Classes
AnyRef → Any
23. #### final def isInstanceOf[T0]: Boolean

Test whether the dynamic type of the receiver object is `T0`.

Test whether the dynamic type of the receiver object is `T0`.

Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.isInstanceOf[String]` will return `false`, while the expression `List(1).isInstanceOf[List[String]]` will return `true`. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

returns

`true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

Definition Classes
Any
24. #### final def isTraversableAgain: Boolean

Tests whether this collection can be repeatedly traversed.

Tests whether this collection can be repeatedly traversed.

returns

`true`

Definition Classes
GenTraversableLikeGenTraversableOnce
25. #### abstract def map[B](f: (A) ⇒ B): CC[B]

[use case]

[use case]
B

the element type of the returned collection.

f

the function to apply to each element.

returns

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

Definition Classes
GenTraversableLike
26. #### abstract def max: A

[use case]

[use case]
returns

the largest element of this collection.

Definition Classes
GenTraversableOnce
27. #### abstract def min: A

[use case]

[use case]
returns

the smallest element of this collection

Definition Classes
GenTraversableOnce
28. #### final def ne(arg0: AnyRef): Boolean

Equivalent to `!(this eq that)`.

Equivalent to `!(this eq that)`.

returns

`true` if the argument is not a reference to the receiver object; `false` otherwise.

Definition Classes
AnyRef
29. #### def newBuilder: Builder[A, GenTraversable[A]]

The builder that builds instances of type CC[A]

The builder that builds instances of type CC[A]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplateHasNewBuilder
30. #### final def notify(): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.

Wakes up a single thread that is waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note

not specified by SLS as a member of AnyRef

31. #### final def notifyAll(): Unit

Wakes up all threads that are waiting on the receiver object's monitor.

Wakes up all threads that are waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note

not specified by SLS as a member of AnyRef

32. #### def par: ParIterable[A]

Returns a parallel implementation of this collection.

Returns a parallel implementation of this collection.

For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, `par` takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

Specific collections (e.g. `ParArray` or `mutable.ParHashMap`) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, `par` takes constant or sublinear time.

All parallel collections return a reference to themselves.

returns

a parallel implementation of this collection

Definition Classes
Parallelizable
33. #### abstract def product: A

[use case]

[use case]
returns

the product of all elements in this collection 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 collection and as result type of `product`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

Definition Classes
GenTraversableOnce
34. #### abstract def sum: A

[use case]

[use case]
returns

the sum of all elements in this collection 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 collection and as result type of `sum`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

Definition Classes
GenTraversableOnce
35. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
36. #### def tail: This

Selects all elements except the first.

Selects all elements except the first.

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

returns

a collection consisting of all elements of this collection except the first one.

Definition Classes
GenTraversableLike
Exceptions thrown
`UnsupportedOperationException`

if the collection is empty.

37. #### abstract def toArray: Array[A]

[use case]

[use case]
returns

an array containing all elements of this collection. A `ClassManifest` must be available for the element type of this collection.

Definition Classes
GenTraversableOnce
38. #### abstract def toMap[T, U]: Map[T, U]

[use case]

[use case]
returns

a map of type `immutable.Map[T, U]` containing all key/value pairs of type `(T, U)` of this collection.

Definition Classes
GenTraversableOnce
39. #### def toString(): String

Creates a String representation of this object.

Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

returns

a String representation of the object.

Definition Classes
AnyRef → Any
40. #### def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): GenTraversable[GenTraversable[B]]

Transposes this collection of traversable collections into a collection of collections.

Transposes this collection of traversable collections into a collection of collections.

B

the type of the elements of each traversable collection.

asTraversable

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

returns

a two-dimensional collection of collections which has as nth row the nth column of this collection.

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration

(Changed in version 2.9.0) `transpose` throws an `IllegalArgumentException` if collections are not uniformly sized.

Exceptions thrown
`IllegalArgumentException`

if all collections in this collection are not of the same size.

41. #### def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (GenTraversable[A1], GenTraversable[A2])

Converts this collection of pairs into two collections of the first and second half of each pair.

Converts this collection of pairs into two collections of the first and second half of each pair.

asPair

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

returns

a pair collections, containing the first, respectively second half of each element pair of this collection.

Definition Classes
GenericTraversableTemplate
42. #### def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (GenTraversable[A1], GenTraversable[A2], GenTraversable[A3])

Converts this collection of triples into three collections of the first, second, and third element of each triple.

Converts this collection of triples into three collections of the first, second, and third element of each triple.

asTriple

an implicit conversion which asserts that the element type of this collection is a triple.

returns

a triple collections, containing the first, second, respectively third member of each element triple of this collection.

Definition Classes
GenericTraversableTemplate

44. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
()
45. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
()
46. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
()