scala.collection.GenSeqViewLike

# FlatMapped

#### trait FlatMapped[B] extends FlatMapped[B] with Transformed[B]

Definition Classes
  GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike
Source
  GenSeqViewLike.scala

Linear Supertypes
Transformed[B], GenSeqView[B, Coll], GenSeqViewLike[B, Coll, GenSeqView[B, Coll]], GenSeq[B], GenSeqLike[B, GenSeqView[B, Coll]], Equals, FlatMapped[B], Transformed[B], GenIterableView[B, Coll], GenIterableViewLike[B, Coll, GenSeqView[B, Coll]], GenIterable[B], GenIterableLike[B, GenSeqView[B, Coll]], FlatMapped[B], Transformed[B], GenTraversableView[B, Coll], GenTraversableViewLike[B, Coll, GenSeqView[B, Coll]], GenTraversable[B], GenericTraversableTemplate[B, GenSeq], HasNewBuilder[B, GenSeq[B]], GenTraversableLike[B, GenSeqView[B, Coll]], Parallelizable[B, ParSeq[B]], GenTraversableOnce[B], AnyRef, Any
Known Subclasses
FlatMapped, FlatMapped
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. FlatMapped
2. Transformed
3. GenSeqView
4. GenSeqViewLike
5. GenSeq
6. GenSeqLike
7. Equals
8. FlatMapped
9. Transformed
10. GenIterableView
11. GenIterableViewLike
12. GenIterable
13. GenIterableLike
14. FlatMapped
15. Transformed
16. GenTraversableView
17. GenTraversableViewLike
18. GenTraversable
19. GenericTraversableTemplate
20. HasNewBuilder
21. GenTraversableLike
22. Parallelizable
23. GenTraversableOnce
24. AnyRef
25. Any

Visibility

1. Public
2. All

### Type Members

1. #### trait Appended[B >: A] extends Appended[B] with Transformed[B]

   Definition Classes
     GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

2. #### trait DroppedWhile extends DroppedWhile with Transformed[A]

   Definition Classes
     GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

3. #### trait EmptyView extends Transformed[Nothing] with EmptyView

   Definition Classes
     GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

4. #### trait Filtered extends Filtered with Transformed[A]

   Definition Classes
     GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

5. #### trait FlatMapped[B] extends FlatMapped[B] with Transformed[B]

   Definition Classes
     GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

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

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

7. #### trait Mapped[B] extends Mapped[B] with Transformed[B]

   Definition Classes
     GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

8. #### trait Patched[B >: A] extends Transformed[B]

9. #### trait Prepended[B >: A] extends Transformed[B]

10. #### trait Reversed extends Transformed[A]

11. #### trait Sliced extends Sliced with Transformed[A]

    Definition Classes
      GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

12. #### trait TakenWhile extends TakenWhile with Transformed[A]

    Definition Classes
      GenSeqViewLike → GenIterableViewLike → GenTraversableViewLike

13. #### trait Transformed[+B] extends GenSeqView[B, Coll] with Transformed[B]

    The implementation base trait of this view.

14. #### trait Zipped[B] extends Zipped[B] with Transformed[(A, B)]

    Definition Classes
      GenSeqViewLike → GenIterableViewLike

15. #### trait ZippedAll[A1 >: A, B] extends ZippedAll[A1, B] with Transformed[(A1, B)]

    Definition Classes
      GenSeqViewLike → GenIterableViewLike

### Abstract Value Members

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

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

   Applies a binary operator to a start value and all elements of this general sequence, 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)
            a: scala.collection.mutable.LinkedList[Int] = 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 general sequence, 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 general sequence.

   Definition Classes
     GenTraversableOnce

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

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

   Applies a binary operator to all elements of this general sequence 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)
            a: scala.collection.mutable.LinkedList[Int] = 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 general sequence, 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 general sequence.

   Definition Classes
     GenTraversableOnce

3. #### abstract def aggregate[B](z: B)(seqop: (B, B) ⇒ 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 canEqual(that: Any): Boolean

   A method that should be called from every well-designed equals method that is open to be overridden in a subclass.

   A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

   that

     the value being probed for possible equality

   returns

     true if this instance can possibly equal `that`, otherwise false

   Definition Classes
     Equals

5. #### abstract def copyToArray[B >: B](xs: Array[B], start: Int, len: Int): Unit

   Definition Classes
     GenTraversableOnce

6. #### abstract def corresponds[B](that: GenSeq[B])(p: (B, B) ⇒ Boolean): Boolean

   Tests whether every element of this general sequence relates to the corresponding element of another sequence by satisfying a test predicate.

   Tests whether every element of this general sequence relates to the corresponding element of another sequence by satisfying a test predicate.

   B

     the type of the elements of `that`

   that

     the other sequence

   p

     the test predicate, which relates elements from both sequences

   returns

     `true` if both sequences have the same length and `p(x, y)` is `true` for all corresponding elements `x` of this general sequence and `y` of `that`, otherwise `false`.

   Definition Classes
     GenSeqLike

7. #### abstract def count(p: (B) ⇒ Boolean): Int

   Counts the number of elements in the general sequence which satisfy a predicate.

   Counts the number of elements in the general sequence which satisfy a predicate.

   p

     the predicate used to test elements.

   returns

     the number of elements satisfying the predicate `p`.

   Definition Classes
     GenTraversableOnce

8. #### abstract def distinct: GenSeqView[B, Coll]

   Builds a new general sequence from this general sequence without any duplicate elements.

   Builds a new general sequence from this general sequence without any duplicate elements.

   Note: will not terminate for infinite-sized collections.

   returns

     A new general sequence which contains the first occurrence of every element of this general sequence.

   Definition Classes
     GenSeqLike

9. #### abstract def drop(n: Int): GenSeqView[B, Coll]

   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 general sequence.

   returns

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

   Definition Classes
     GenTraversableLike

10. #### abstract def dropWhile(pred: (B) ⇒ Boolean): GenSeqView[B, Coll]

    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 general sequence whose first element does not satisfy the predicate `p`.

    Definition Classes
      GenTraversableLike

11. #### abstract def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this general sequence ends with the given sequence.

    Tests whether this general sequence ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

      `true` if this general sequence has `that` as a suffix, `false` otherwise.

    Definition Classes
      GenSeqLike

12. #### abstract def exists(pred: (B) ⇒ Boolean): Boolean

    Definition Classes
      GenTraversableOnce

13. #### abstract def filter(pred: (B) ⇒ Boolean): GenSeqView[B, Coll]

    Selects all elements of this general sequence which satisfy a predicate.

    Selects all elements of this general sequence which satisfy a predicate.

    returns

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

    Definition Classes
      GenTraversableLike

14. #### abstract def filterNot(pred: (B) ⇒ Boolean): GenSeqView[B, Coll]

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

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

    returns

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

    Definition Classes
      GenTraversableLike

15. #### abstract def find(pred: (B) ⇒ Boolean): Option[B]

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

    Finds the first element of the general sequence 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 general sequence that satisfies `p`, or `None` if none exists.

    Definition Classes
      GenTraversableOnce

16. #### abstract def fold[A1 >: B](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this general sequence using the specified associative binary operator.

    Folds the elements of this general sequence 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

17. #### abstract def foldLeft[B](z: B)(op: (B, B) ⇒ B): B

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

    Applies a binary operator to a start value and all elements of this general sequence, 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 general sequence, 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 general sequence.

    Definition Classes
      GenTraversableOnce

18. #### abstract def foldRight[B](z: B)(op: (B, B) ⇒ B): B

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

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

    Definition Classes
      GenTraversableOnce

19. #### abstract def forall(pred: (B) ⇒ Boolean): Boolean

    Definition Classes
      GenTraversableOnce

20. #### abstract def force[B >: B, That](implicit bf: CanBuildFrom[Coll, B, That]): That

    Definition Classes
      GenTraversableViewLike

21. #### abstract def groupBy[K](f: (B) ⇒ K): GenMap[K, GenSeqView[B, Coll]]

    Partitions this general sequence into a map of general sequences according to some discriminator function.

    Partitions this general sequence into a map of general sequences 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 general sequence.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to general sequences 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 general sequence of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      GenTraversableLike

22. #### abstract def hasDefiniteSize: Boolean

    Definition Classes
      GenTraversableOnce

23. #### abstract def indexWhere(p: (B) ⇒ Boolean, from: Int): Int

    Finds index of the first element satisfying some predicate after or at some start index.

    Finds index of the first element satisfying some predicate after or at some start index.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    from

      the start index

    returns

      the index `>= from` of the first element of this general sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

24. #### abstract def lastIndexWhere(p: (B) ⇒ Boolean, end: Int): Int

    Finds index of last element satisfying some predicate before or at given end index.

    Finds index of last element satisfying some predicate before or at given end index.

    p

      the predicate used to test elements.

    returns

      the index `<= end` of the last element of this general sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

25. #### abstract val mapping: (A) ⇒ GenTraversableOnce[B]

    Attributes
      protected[this]
    Definition Classes
      FlatMapped

26. #### abstract def maxBy[B](f: (B) ⇒ B)(implicit cmp: Ordering[B]): B

    Definition Classes
      GenTraversableOnce

27. #### abstract def minBy[B](f: (B) ⇒ B)(implicit cmp: Ordering[B]): B

    Definition Classes
      GenTraversableOnce

28. #### abstract def mkString: String

    Displays all elements of this general sequence in a string.

    Displays all elements of this general sequence in a string.

    returns

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

    Definition Classes
      GenTraversableOnce

29. #### abstract def mkString(sep: String): String

    Displays all elements of this general sequence in a string using a separator string.

    Displays all elements of this general sequence in a string using a separator string.

    sep

      the separator string.

    returns

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

    Definition Classes
      GenTraversableOnce
    Example:

    1. `List(1, 2, 3).mkString("|") = "1|2|3"`

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

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

    Displays all elements of this general sequence 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 general sequence. 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 general sequence are separated by the string `sep`.

    Definition Classes
      GenTraversableOnce
    Example:

    1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

31. #### abstract def nonEmpty: Boolean

    Tests whether the general sequence is not empty.

    Tests whether the general sequence is not empty.

    returns

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

    Definition Classes
      GenTraversableOnce

32. #### abstract def parCombiner: Combiner[B, ParSeq[B]]

    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

33. #### abstract def partition(pred: (B) ⇒ Boolean): (GenSeqView[B, Coll], GenSeqView[B, Coll])

    Partitions this general sequence in two general sequences according to a predicate.

    Partitions this general sequence in two general sequences according to a predicate.

    returns

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

    Definition Classes
      GenTraversableLike

34. #### abstract def reduce[A1 >: B](op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this general sequence using the specified associative binary operator.

    Reduces the elements of this general sequence 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 general sequence is nonempty.

    Definition Classes
      GenTraversableOnce
    Exceptions thrown
      UnsupportedOperationException

      if this general sequence is empty.

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

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

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

    Definition Classes
      GenTraversableOnce

36. #### abstract def reduceOption[A1 >: B](op: (A1, A1) ⇒ A1): Option[A1]

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

    Reduces the elements of this general sequence, 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

37. #### abstract def reduceRight[B >: B](op: (B, B) ⇒ B): B

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

    Applies a binary operator to all elements of this general sequence, 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 general sequence, going right to left:

                      op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))

      where `x1, ..., xn` are the elements of this general sequence.

    Definition Classes
      GenTraversableOnce
    Exceptions thrown
      `UnsupportedOperationException`

      if this general sequence is empty.

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

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

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

    Definition Classes
      GenTraversableOnce

39. #### abstract def repr: GenSeqView[B, Coll]

    Definition Classes
      GenTraversableLike

40. #### abstract def reverse: GenSeqView[B, Coll]

    Returns new general sequence wih elements in reversed order.

    Returns new general sequence wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

      A new general sequence with all elements of this general sequence in reversed order.

    Definition Classes
      GenSeqLike

41. #### abstract def scan[B >: B, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[GenSeqView[B, Coll], 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 general sequence containing the prefix scan of the elements in this general sequence

    Definition Classes
      GenTraversableLike

42. #### abstract def scanLeft[B, That](z: B)(op: (B, B) ⇒ B)(implicit bf: CanBuildFrom[GenSeqView[B, Coll], 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

43. #### abstract def scanRight[B, That](z: B)(op: (B, B) ⇒ B)(implicit bf: CanBuildFrom[GenSeqView[B, Coll], 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.

44. #### abstract def segmentLength(p: (B) ⇒ Boolean, from: Int): Int

    Computes length of longest segment whose elements all satisfy some predicate.

    Computes length of longest segment whose elements all satisfy some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    from

      the index where the search starts.

    returns

      the length of the longest segment of this general sequence starting from index `from` such that every element of the segment satisfies the predicate `p`.

    Definition Classes
      GenSeqLike

45. #### abstract def seq: Seq[B]

    Definition Classes
      GenSeq → GenIterable → GenTraversable → GenSeqLike → Parallelizable → GenTraversableOnce

46. #### abstract def size: Int

    The size of this general sequence.

    The size of this general sequence.

    Note: will not terminate for infinite-sized collections.

    returns

      the number of elements in this general sequence.

    Definition Classes
      GenTraversableLike → GenTraversableOnce

47. #### abstract def slice(unc_from: Int, unc_until: Int): GenSeqView[B, Coll]

    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 general sequence containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this general sequence.

    Definition Classes
      GenTraversableLike

48. #### abstract def span(pred: (B) ⇒ Boolean): (GenSeqView[B, Coll], GenSeqView[B, Coll])

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

    Splits this general sequence 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 general sequence whose elements all satisfy `p`, and the rest of this general sequence.

    Definition Classes
      GenTraversableLike

49. #### abstract def splitAt(n: Int): (GenSeqView[B, Coll], GenSeqView[B, Coll])

    Splits this general sequence into two at a given position.

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

    Definition Classes
      GenTraversableLike

50. #### abstract def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Tests whether this general sequence contains the given sequence at a given index.

    Tests whether this general sequence contains the given sequence at a given index.

    Note: If the both the receiver object `this` and the argument `that` are infinite sequences this method may not terminate.

    that

      the sequence to test

    offset

      the index where the sequence is searched.

    returns

      `true` if the sequence `that` is contained in this general sequence at index `offset`, otherwise `false`.

    Definition Classes
      GenSeqLike

51. #### abstract def take(n: Int): GenSeqView[B, Coll]

    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 general sequence.

    returns

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

    Definition Classes
      GenTraversableLike

52. #### abstract def takeWhile(pred: (B) ⇒ Boolean): GenSeqView[B, Coll]

    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 general sequence whose elements all satisfy the predicate `p`.

    Definition Classes
      GenTraversableLike

53. #### abstract def toBuffer[A1 >: B]: Buffer[A1]

    Converts this general sequence to a mutable buffer.

    Converts this general sequence to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

      a buffer containing all elements of this general sequence.

    Definition Classes
      GenTraversableOnce

54. #### abstract def toIndexedSeq: IndexedSeq[B]

    Converts this general sequence to an indexed sequence.

    Converts this general sequence to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

      an indexed sequence containing all elements of this general sequence.

    Definition Classes
      GenTraversableOnce

55. #### abstract def toIterable: GenIterable[B]

    Converts this general sequence to an iterable collection.

    Converts this general sequence 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 general sequence.

    Definition Classes
      GenTraversableOnce

56. #### abstract def toIterator: Iterator[B]

    Returns an Iterator over the elements in this general sequence.

    Returns an Iterator over the elements in this general sequence. 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 general sequence.

    Definition Classes
      GenTraversableOnce

57. #### abstract def toList: List[B]

    Converts this general sequence to a list.

    Converts this general sequence to a list.

    Note: will not terminate for infinite-sized collections.

    returns

      a list containing all elements of this general sequence.

    Definition Classes
      GenTraversableOnce

58. #### abstract def toSeq: GenSeq[B]

    Converts this general sequence to a sequence.

    Converts this general sequence 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 general sequence.

    Definition Classes
      GenSeqLike → GenTraversableOnce

59. #### abstract def toSet[A1 >: B]: GenSet[A1]

    Converts this general sequence to a set.

    Converts this general sequence to a set.

    Note: will not terminate for infinite-sized collections.

    returns

      a set containing all elements of this general sequence.

    Definition Classes
      GenTraversableOnce

60. #### abstract def toStream: Stream[B]

    Converts this general sequence to a stream.

    Converts this general sequence to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

      a stream containing all elements of this general sequence.

    Definition Classes
      GenTraversableOnce

61. #### abstract def toTraversable: GenTraversable[B]

    Converts this general sequence to an unspecified Traversable.

    Converts this general sequence 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 general sequence.

    Definition Classes
      GenTraversableOnce

### 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]): GenSeq[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     GenTraversableLike

5. #### abstract def +:(elem: B): GenSeq[B]

   [use case]

   [use case]
   elem

     the prepended element

   returns

     a new general sequence consisting of `elem` followed by all elements of this general sequence.

   Definition Classes
     GenSeqLike

6. #### def /:\[A1 >: B](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)
            a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

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

   Definition Classes
     GenTraversableOnce

7. #### abstract def :+(elem: B): GenSeq[B]

   [use case]

   [use case]
   elem

     the appended element

   returns

     a new general sequence consisting of all elements of this general sequence followed by `elem`. @example

               scala> import scala.collection.mutable.LinkedList
               import scala.collection.mutable.LinkedList

               scala> val a = LinkedList(1)
               a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

               scala> val b = a :+ 2
               b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

               scala> println(a)
               LinkedList(1)

   Definition Classes
     GenSeqLike

8. #### final def ==(arg0: AnyRef): Boolean

   Definition Classes
     AnyRef

9. #### 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

10. #### def apply(idx: Int): B

    Selects an element by its index in the general sequence.

    Selects an element by its index in the general sequence.

    Example:

           scala> val x = LinkedList(1, 2, 3, 4, 5)
           x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)

           scala> x(3)
           res1: Int = 4

    idx

      The index to select.

    returns

      the element of this general sequence at index `idx`, where `0` indicates the first element.

    Definition Classes
      FlatMapped → Transformed → GenSeqLike
    Exceptions thrown
      `IndexOutOfBoundsException`

      if `idx` does not satisfy `0 <= idx < length`.

11. #### 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

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown
      ClassCastException

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

12. #### 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
      @throws()
    Note

      not specified by SLS as a member of AnyRef

13. #### abstract def collect[B](pf: PartialFunction[B, B]): GenSeq[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the general sequence.

    returns

      a new general sequence 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

14. #### def companion: GenericCompanion[GenSeq]

    The factory companion object that builds instances of class GenSeq.

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

    Definition Classes
      GenSeq → GenIterable → GenTraversable → GenericTraversableTemplate

15. #### abstract def copyToArray(xs: Array[B], start: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      GenTraversableOnce

16. #### abstract def copyToArray(xs: Array[B]): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    Definition Classes
      GenTraversableOnce

17. #### abstract def diff(that: GenSeq[B]): GenSeq[B]

    [use case]

    [use case]
    that

      the sequence of elements to remove

    returns

      a new general sequence which contains all elements of this general sequence except some of occurrences of elements that also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will not form part of the result, but any following occurrences will.

    Definition Classes
      GenSeqLike

18. #### 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

19. #### def equals(that: Any): Boolean

    The equals method for arbitrary sequences.

    The equals method for arbitrary sequences. Compares this sequence to some other object.

    that

      The object to compare the sequence to

    returns

      `true` if `that` is a sequence that has the same elements as this sequence in the same order, `false` otherwise

    Definition Classes
      GenSeqLike → Equals → AnyRef → Any

20. #### 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
      @throws()
    Note

      not specified by SLS as a member of AnyRef

21. #### def findRow(idx: Int, lo: Int, hi: Int): Int

    Attributes
      protected[this]

22. #### abstract def flatMap[B](f: (B) ⇒ GenTraversableOnce[B]): GenSeq[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      GenTraversableLike

23. #### def flatten[B]: GenSeq[B]

    [use case]

    [use case]
    B

      the type of the elements of each traversable collection.

    returns

      a new general sequence resulting from concatenating all element general sequences.

    Definition Classes
      GenericTraversableTemplate

24. #### def foreach(f: (B) ⇒ 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
      Transformed → Transformed → GenericTraversableTemplate → GenTraversableLike → GenTraversableOnce

25. #### def genericBuilder[B]: Builder[B, GenSeq[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

26. #### 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

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

    Hashcodes for GenSeq produce a value from the hashcodes of all the elements of the general sequence.

    Hashcodes for GenSeq produce a value from the hashcodes of all the elements of the general sequence.

    returns

      the hash code value for this object.

    Definition Classes
      GenSeqLike → AnyRef → Any

28. #### def head: B

    Definition Classes
      GenIterableLike → GenTraversableLike

29. #### lazy val index: Array[Int]

    Attributes
      protected[this]

30. #### def indexOf(elem: B, from: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    from

      the start index

    returns

      the index `>= from` of the first element of this general sequence that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

31. #### def indexOf(elem: B): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

      the index of the first element of this general sequence that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

32. #### def indexWhere(p: (B) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the index of the first element of this general sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

33. #### abstract def intersect(that: GenSeq[B]): GenSeq[B]

    [use case]

    [use case]
    that

      the sequence of elements to intersect with.

    returns

      a new general sequence which contains all elements of this general sequence which also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will be retained in the result, but any following occurrences will be omitted.

    Definition Classes
      GenSeqLike

34. #### def isDefinedAt(idx: Int): Boolean

    Tests whether this general sequence contains given index.

    Tests whether this general sequence contains given index.

    The implementations of methods `apply` and `isDefinedAt` turn a `Seq[A]` into a `PartialFunction[Int, A]`.

    idx

      the index to test

    returns

      `true` if this general sequence contains an element at position `idx`, `false` otherwise.

    Definition Classes
      GenSeqLike

35. #### def isEmpty: Boolean

    Tests whether the general sequence is empty.

    Tests whether the general sequence is empty.

    returns

      `true` if the general sequence contains no elements, `false` otherwise.

    Definition Classes
      GenIterableLike → GenTraversableOnce

36. #### 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

37. #### final def isTraversableAgain: Boolean

    Tests whether this general sequence can be repeatedly traversed.

    Tests whether this general sequence can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      GenTraversableLike → GenTraversableOnce

38. #### def iterator: Iterator[B]

    Definition Classes
      FlatMapped → Transformed → GenIterableLike

39. #### def lastIndexOf(elem: B, end: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    end

      the end index.

    returns

      the index `<= end` of the last element of this general sequence that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

40. #### def lastIndexOf(elem: B): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

      the index of the last element of this general sequence that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

41. #### def lastIndexWhere(p: (B) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the index of the last element of this general sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

42. #### def length: Int

    The length of the general sequence.

    The length of the general sequence.

    Note: will not terminate for infinite-sized collections.

    Note: `xs.length` and `xs.size` yield the same result.

    returns

      the number of elements in this general sequence.

    Definition Classes
      FlatMapped → Transformed → GenSeqLike

43. #### abstract def map[B](f: (B) ⇒ B): GenSeq[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      GenTraversableLike

44. #### abstract def max: B

    [use case]

    [use case]
    returns

      the largest element of this general sequence.

    Definition Classes
      GenTraversableOnce

45. #### abstract def min: B

    [use case]

    [use case]
    returns

      the smallest element of this general sequence

    Definition Classes
      GenTraversableOnce

46. #### 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

47. #### def newBuilder: Builder[B, GenSeq[B]]

    The builder that builds instances of type GenSeq[A]

    The builder that builds instances of type GenSeq[A]

    Attributes
      protected[this]
    Definition Classes
      GenericTraversableTemplate → HasNewBuilder

48. #### 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

49. #### 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

50. #### abstract def padTo(len: Int, elem: B): GenSeq[B]

    [use case]

    [use case]
    len

      the target length

    elem

      the padding value

    returns

      a new general sequence consisting of all elements of this general sequence followed by the minimal number of occurrences of `elem` so that the resulting general sequence has a length of at least `len`.

    Definition Classes
      GenSeqLike

51. #### def par: ParSeq[B]

    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

52. #### abstract def patch(from: Int, that: GenSeq[B], replaced: Int): GenSeq[B]

    [use case]

    [use case]
    from

      the index of the first replaced element

    replaced

      the number of elements to drop in the original general sequence

    returns

      a new general sequence consisting of all elements of this general sequence except that `replaced` elements starting from `from` are replaced by `patch`.

    Definition Classes
      GenSeqLike

53. #### def prefixLength(p: (B) ⇒ Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

      the length of the longest prefix of this general sequence such that every element of the segment satisfies the predicate `p`.

    Definition Classes
      GenSeqLike

54. #### abstract def product: B

    [use case]

    [use case]
    returns

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

    Definition Classes
      GenTraversableOnce

55. #### abstract def reverseMap[B](f: (B) ⇒ B): GenSeq[B]

    [use case] Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

    [use case]

    Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new general sequence resulting from applying the given function `f` to each element of this general sequence and collecting the results in reversed order.

    Definition Classes
      GenSeqLike

56. #### abstract def sameElements(that: GenIterable[B]): Boolean

    [use case]

    [use case]
    that

      the collection to compare with.

    returns

      `true`, if both collections contain the same elements in the same order, `false` otherwise.

    Definition Classes
      GenIterableLike

57. #### def startsWith[B](that: GenSeq[B]): Boolean

    Tests whether this general sequence starts with the given sequence.

    Tests whether this general sequence starts with the given sequence.

    that

      the sequence to test

    returns

      `true` if this collection has `that` as a prefix, `false` otherwise.

    Definition Classes
      GenSeqLike

58. #### 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 general sequence. By default the string prefix is the simple name of the collection class general sequence.

    Definition Classes
      Transformed → GenTraversableLike

59. #### abstract def sum: B

    [use case]

    [use case]
    returns

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

    Definition Classes
      GenTraversableOnce

60. #### final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
      AnyRef

61. #### def tail: GenSeqView[B, Coll]

    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 general sequence consisting of all elements of this general sequence except the first one.

    Definition Classes
      GenTraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the general sequence is empty.

62. #### abstract def toArray: Array[B]

    [use case]

    [use case]
    returns

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

    Definition Classes
      GenTraversableOnce

63. #### 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 general sequence.

    Definition Classes
      GenTraversableOnce

64. #### 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
      Transformed → Transformed → Transformed → AnyRef → Any

65. #### def transpose[B](implicit asTraversable: (B) ⇒ GenTraversableOnce[B]): GenSeq[GenSeq[B]]

    Transposes this general sequence of traversable collections into a general sequence of general sequences.

    Transposes this general sequence of traversable collections into a general sequence of general sequences.

    B

      the type of the elements of each traversable collection.

    asTraversable

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

    returns

      a two-dimensional general sequence of general sequences which has as nth row the nth column of this general sequence.

    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 general sequence are not of the same size.

66. #### lazy val underlying: Coll

    Definition Classes
      Transformed → GenTraversableViewLike

67. #### def union(that: GenSeq[B]): GenSeq[B]

    [use case]

    [use case]
    that

      the sequence to add.

    returns

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

    Definition Classes
      GenSeqLike

68. #### def unzip[A1, A2](implicit asPair: (B) ⇒ (A1, A2)): (GenSeq[A1], GenSeq[A2])

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

    Converts this general sequence 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 general sequence is a pair.

    returns

      a pair general sequences, containing the first, respectively second half of each element pair of this general sequence.

    Definition Classes
      GenericTraversableTemplate

69. #### def unzip3[A1, A2, A3](implicit asTriple: (B) ⇒ (A1, A2, A3)): (GenSeq[A1], GenSeq[A2], GenSeq[A3])

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

    Converts this general sequence 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 general sequence is a triple.

    returns

      a triple general sequences, containing the first, second, respectively third member of each element triple of this general sequence.

    Definition Classes
      GenericTraversableTemplate

70. #### abstract def updated(index: Int, elem: B): GenSeq[B]

    [use case]

    [use case]
    index

      the position of the replacement

    elem

      the replacing element

    returns

      a copy of this general sequence with the element at position `index` replaced by `elem`.

    Definition Classes
      GenSeqLike

71. #### final def viewIdString: String

    Attributes
      protected[this]
    Definition Classes
      Transformed → GenTraversableViewLike

72. #### final def viewIdentifier: String

    Attributes
      protected[this]
    Definition Classes
      FlatMapped → GenTraversableViewLike

73. #### def viewToString: String

    Definition Classes
      GenTraversableViewLike

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

    Definition Classes
      AnyRef
    Annotations
      @throws()

75. #### final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws()

76. #### final def wait(arg0: Long): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws()

77. #### abstract def zip[B](that: GenIterable[B]): GenSeq[(B, B)]

    [use case]

    [use case]
    B

      the type of the second half of the returned pairs

    that

      The iterable providing the second half of each result pair

    returns

      a new general sequence containing pairs consisting of corresponding elements of this general sequence and `that`. The length of the returned collection is the minimum of the lengths of this general sequence and `that`.

    Definition Classes
      GenIterableLike

78. #### abstract def zipAll[B](that: Iterable[B], thisElem: B, thatElem: B): GenSeq[(B, B)]

    [use case]

    [use case]
    B

      the type of the second half of the returned pairs

    that

      The iterable providing the second half of each result pair

    thisElem

      the element to be used to fill up the result if this general sequence is shorter than `that`.

    thatElem

      the element to be used to fill up the result if `that` is shorter than this general sequence.

    returns

      a new general sequence containing pairs consisting of corresponding elements of this general sequence and `that`. The length of the returned collection is the maximum of the lengths of this general sequence and `that`. If this general sequence is shorter than `that`, `thisElem` values are used to pad the result. If `that` is shorter than this general sequence, `thatElem` values are used to pad the result.

    Definition Classes
      GenIterableLike

79. #### abstract def zipWithIndex: GenSeq[(B, Int)]

    [use case]

    [use case]
    returns

      A new general sequence containing pairs consisting of all elements of this general sequence paired with their index. Indices start at `0`. @example `List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))`

    Definition Classes
      GenIterableLike

### Inherited from Transformed[B]

### Inherited from GenSeqView[B, Coll]

### Inherited from GenSeqViewLike[B, Coll, GenSeqView[B, Coll]]

### Inherited from GenSeq[B]

### Inherited from GenSeqLike[B, GenSeqView[B, Coll]]

### Inherited from Equals

### Inherited from FlatMapped[B]

### Inherited from Transformed[B]

### Inherited from GenIterableView[B, Coll]

### Inherited from GenIterableViewLike[B, Coll, GenSeqView[B, Coll]]

### Inherited from GenIterable[B]

### Inherited from GenIterableLike[B, GenSeqView[B, Coll]]

### Inherited from FlatMapped[B]

### Inherited from Transformed[B]

### Inherited from GenTraversableView[B, Coll]

### Inherited from GenTraversableViewLike[B, Coll, GenSeqView[B, Coll]]

### Inherited from GenTraversable[B]

### Inherited from GenericTraversableTemplate[B, GenSeq]

### Inherited from HasNewBuilder[B, GenSeq[B]]

### Inherited from GenTraversableLike[B, GenSeqView[B, Coll]]

### Inherited from Parallelizable[B, ParSeq[B]]

### Inherited from GenTraversableOnce[B]

### Inherited from AnyRef

### Inherited from Any