scala.collection.parallel

# ParSeqLike

#### trait ParSeqLike[+T, +Repr <: ParSeq[T], +Sequential <: Seq[T] with SeqLike[T, Sequential]] extends GenSeqLike[T, Repr] with ParIterableLike[T, Repr, Sequential]

A template trait for sequences of type `ParSeq[T]`, representing parallel sequences with element type `T`.

Parallel sequences inherit the `Seq` trait. Their indexing and length computations are defined to be efficient. Like their sequential counterparts they always have a defined order of elements. This means they will produce resulting parallel sequences in the same way sequential sequences do. However, the order in which they perform bulk operations on elements to produce results is not defined and is generally nondeterministic. If the higher-order functions given to them produce no sideeffects, then this won't be noticeable.

This trait defines a new, more general `split` operation and reimplements the `split` operation of `ParallelIterable` trait using the new `split` operation.

T

  the type of the elements contained in this collection

Repr

  the type of the actual collection containing the elements

Sequential

  the type of the sequential version of this parallel collection

Self Type
  ParSeqLike[T, Repr, Sequential]
Source
  ParSeqLike.scala

Linear Supertypes
ParIterableLike[T, Repr, Sequential], HasNewCombiner[T, Repr], Parallel, CustomParallelizable[T, Repr], GenSeqLike[T, Repr], Equals, GenIterableLike[T, Repr], GenTraversableLike[T, Repr], Parallelizable[T, Repr], GenTraversableOnce[T], AnyRef, Any
Known Subclasses
Appended, Forced, Mapped, ParArray, ParRange, ParSeq, ParSeq, ParSeq, ParSeqView, ParSeqViewLike, ParVector, Patched, Prepended, Reversed, Sliced, Transformed, Zipped, ZippedAll
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. ParSeqLike
2. ParIterableLike
3. HasNewCombiner
4. Parallel
5. CustomParallelizable
6. GenSeqLike
7. Equals
8. GenIterableLike
9. GenTraversableLike
10. Parallelizable
11. GenTraversableOnce
12. AnyRef
13. Any

Visibility

1. Public
2. All

### Type Members

1. #### trait Accessor[R, Tp] extends Accessor[R, Tp]

   Standard accessor task that iterates over the elements of the collection.

2. #### class Aggregate[S] extends Accessor[S, Aggregate[S]]

   Attributes
     protected[this]

3. #### trait BuilderOps[Elem, To] extends AnyRef

4. #### class Collect[S, That] extends Transformer[Combiner[S, That], Collect[S, That]]

   Attributes
     protected[this]

5. #### abstract class Composite[FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR,_$3] forSome { type _$3 }, Second <: ParIterableLike.this.StrictSplitterCheckTask[SR,_$4] forSome { type _$4 }] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

   Attributes
     protected[this]

6. #### class Copy[U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

   Attributes
     protected

7. #### class CopyToArray[U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]

   Attributes
     protected[this]

8. #### class Corresponds[S] extends Accessor[Boolean, Corresponds[S]]

   Attributes
     protected[this]

9. #### class Count extends Accessor[Int, Count]

   Attributes
     protected[this]

10. #### class CreateScanTree[U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

    Attributes
      protected[this]

11. #### class Drop[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

    Attributes
      protected[this]

12. #### abstract class Elements extends SeqSplitter[T] with BufferedIterator[T]

    Used to iterate elements using indices

13. #### class Exists extends Accessor[Boolean, Exists]

    Attributes
      protected[this]

14. #### class Filter[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

    Attributes
      protected[this]

15. #### class FilterNot[U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

    Attributes
      protected[this]

16. #### class Find[U >: T] extends Accessor[Option[U], Find[U]]

    Attributes
      protected[this]

17. #### class FlatMap[S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

    Attributes
      protected[this]

18. #### class Fold[U >: T] extends Accessor[U, Fold[U]]

    Attributes
      protected[this]

19. #### class Forall extends Accessor[Boolean, Forall]

    Attributes
      protected[this]

20. #### class Foreach[S] extends Accessor[Unit, Foreach[S]]

    Attributes
      protected[this]

21. #### class FromScanTree[U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

    Attributes
      protected[this]

22. #### class GroupBy[K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

    Attributes
      protected[this]

23. #### class IndexWhere extends Accessor[Int, IndexWhere]

    Attributes
      protected[this]

24. #### class LastIndexWhere extends Accessor[Int, LastIndexWhere]

    Attributes
      protected[this]

25. #### class Map[S, That] extends Transformer[Combiner[S, That], Map[S, That]]

    Attributes
      protected[this]

26. #### class Max[U >: T] extends Accessor[Option[U], Max[U]]

    Attributes
      protected[this]

27. #### class Min[U >: T] extends Accessor[Option[U], Min[U]]

    Attributes
      protected[this]

28. #### trait NonDivisible[R] extends NonDivisibleTask[R, NonDivisible[R]]

    Attributes
      protected[this]

29. #### trait NonDivisibleTask[R, Tp] extends StrictSplitterCheckTask[R, Tp]

    Attributes
      protected[this]

30. #### abstract class ParComposite[FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR,_$7] forSome { type _$7 }, Second <: ParIterableLike.this.StrictSplitterCheckTask[SR,_$8] forSome { type _$8 }] extends Composite[FR, SR, R, First, Second]

    Performs two tasks in parallel, and waits for both to finish.

31. #### class Partition[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

    Attributes
      protected[this]

32. #### class Product[U >: T] extends Accessor[U, Product[U]]

    Attributes
      protected[this]

33. #### class Reduce[U >: T] extends Accessor[Option[U], Reduce[U]]

    Attributes
      protected[this]

34. #### abstract class ResultMapping[R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

    Attributes
      protected[this]

35. #### class Reverse[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

    Attributes
      protected[this]

36. #### class ReverseMap[S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

    Attributes
      protected[this]

37. #### type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

    Definition Classes
      ParIterableLike

38. #### class SameElements[U >: T] extends Accessor[Boolean, SameElements[U]]

    Attributes
      protected[this]

39. #### case class ScanLeaf[U >: T](pit: IterableSplitter[U], op: (U, U) ⇒ U, from: Int, len: Int, prev: Option[ScanLeaf[U]], acc: U) extends ScanTree[U] with Product with Serializable

    Attributes
      protected[this]

40. #### case class ScanNode[U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with Product with Serializable

    Attributes
      protected[this]

41. #### trait ScanTree[U >: T] extends AnyRef

    Attributes
      protected[this]

42. #### class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

    Attributes
      protected[this]

43. #### abstract class SeqComposite[FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR,_$5] forSome { type _$5 }, Second <: ParIterableLike.this.StrictSplitterCheckTask[SR,_$6] forSome { type _$6 }] extends Composite[FR, SR, R, First, Second]

    Sequentially performs one task after another.

44. #### trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef

45. #### class Slice[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

    Attributes
      protected[this]

46. #### class Span[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]

    Attributes
      protected[this]

47. #### class SplitAt[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]

    Attributes
      protected[this]

48. #### trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]

    Attributes
      protected

49. #### class Sum[U >: T] extends Accessor[U, Sum[U]]

    Attributes
      protected[this]

50. #### type SuperParIterator = IterableSplitter[T]

51. #### class Take[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

    Attributes
      protected[this]

52. #### class TakeWhile[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]

    Attributes
      protected[this]

53. #### trait TaskOps[R, Tp] extends AnyRef

54. #### class ToParCollection[U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

    Attributes
      protected[this]

55. #### class ToParMap[K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    Attributes
      protected[this]

56. #### trait Transformer[R, Tp] extends Accessor[R, Tp] with Transformer[R, Tp]

    Attributes
      protected
    Definition Classes
      ParSeqLike → ParIterableLike

57. #### class Updated[U >: T, That] extends Transformer[Combiner[U, That], Updated[U, That]]

    Attributes
      protected[this]

58. #### class Zip[U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

    Attributes
      protected[this]
    Definition Classes
      ParSeqLike → ParIterableLike

59. #### class ZipAll[U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]

    Attributes
      protected[this]

### Abstract Value Members

1. #### abstract def apply(idx: Int): T

   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
     GenSeqLike
   Exceptions thrown
     `IndexOutOfBoundsException`

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

2. #### abstract 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
     GenSeqLike

3. #### abstract def newCombiner: Combiner[T, Repr]

   Attributes
     protected[this]
   Definition Classes
     HasNewCombiner

4. #### abstract def seq: Sequential

   Definition Classes
     ParIterableLike → Parallelizable → GenTraversableOnce

5. #### abstract def splitter: SeqSplitter[T]

   A more refined version of the iterator found in the `ParallelIterable` trait, this iterator can be split into arbitrary subsets of iterators.

   A more refined version of the iterator found in the `ParallelIterable` trait, this iterator can be split into arbitrary subsets of iterators.

   returns

     an iterator that can be split into subsets of precise size

   Attributes
     protected[parallel]
   Definition Classes
     ParSeqLike → ParIterableLike

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

   Definition Classes
     GenTraversableLike

### 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. #### 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
     ParIterableLike → GenTraversableLike

5. #### def +:(elem: T): GenSeq[A]

   [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
     ParSeqLike → GenSeqLike

6. #### def /:[S](z: S)(op: (S, T) ⇒ S): S

   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.

   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
     ParIterableLike → GenTraversableOnce

7. #### def /:\[A1 >: T](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

8. #### def :+(elem: T): GenSeq[A]

   [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
     ParSeqLike → GenSeqLike

9. #### def :\[S](z: S)(op: (T, S) ⇒ S): S

   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

   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
     ParIterableLike → GenTraversableOnce

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

    Definition Classes
      AnyRef

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

12. #### def aggregate[S](z: S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    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 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).

    S

      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
      ParIterableLike → GenTraversableOnce

13. #### 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`.

14. #### def bf2seq[S, That](bf: CanBuildFrom[Repr, S, That]): CanBuildFrom[Sequential, S, That]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

15. #### implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]

    Attributes
      protected
    Definition Classes
      ParIterableLike

16. #### def canEqual(other: Any): Boolean

    Definition Classes
      ParIterableLike

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

18. #### def collect[B](pf: PartialFunction[T, 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
      ParIterableLike → GenTraversableLike

19. #### def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

20. #### def combinerFactory: CombinerFactory[T, Repr]

    Creates a combiner factory.

    Creates a combiner factory. Each combiner factory instance is used once per invocation of a parallel transformer method for a single collection.

    The default combiner factory creates a new combiner every time it is requested, unless the combiner is thread-safe as indicated by its `canBeShared` method. In this case, the method returns a factory which returns the same combiner each time. This is typically done for concurrent parallel collections, the combiners of which allow thread safe access.

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

21. #### def copyToArray[U >: T](xs: Array[U], start: Int, len: Int): Unit

    Definition Classes
      ParIterableLike → GenTraversableOnce

22. #### def copyToArray(xs: Array[T], start: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      ParIterableLike → GenTraversableOnce

23. #### def copyToArray(xs: Array[T]): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    Definition Classes
      ParIterableLike → GenTraversableOnce

24. #### def corresponds[S](that: GenSeq[S])(p: (T, S) ⇒ Boolean): Boolean

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

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

    This method will use `abort` signalling capabilities. This means that splitters may send and read `abort` signals.

    S

      the type of the elements of `that`

    that

      the other parallel sequence

    p

      the test predicate, which relates elements from both sequences

    returns

      `true` if both parallel 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
      ParSeqLike → GenSeqLike

25. #### def count(p: (T) ⇒ 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
      ParIterableLike → GenTraversableOnce

26. #### def debugBuffer: ArrayBuffer[String]

    Definition Classes
      ParIterableLike

27. #### implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

    Attributes
      protected
    Definition Classes
      ParIterableLike

28. #### def diff(that: GenSeq[T]): GenSeq[A]

    [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
      ParSeqLike → GenSeqLike

29. #### def distinct: Repr

    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
      ParSeqLike → GenSeqLike

30. #### def down(p: scala.collection.parallel.IterableSplitter[_]): SeqSplitter[T]

    Attributes
      protected[this]

31. #### def drop(n: Int): Repr

    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
      ParIterableLike → GenTraversableLike

32. #### def dropWhile(pred: (T) ⇒ Boolean): Repr

    Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.

    Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.

    This method will use `indexFlag` signalling capabilities. This means that splitters may set and read the `indexFlag` state. The index flag is initially set to maximum integer value.

    pred

      the predicate used to test the elements

    returns

      a collection composed of all the elements after the longest prefix of elements in this general sequence that satisfy the predicate `pred`

    Definition Classes
      ParIterableLike → GenTraversableLike

33. #### def endsWith[S](that: GenSeq[S]): Boolean

    Tests whether this general sequence ends with the given parallel sequence.

    Tests whether this general sequence ends with the given parallel sequence.

    This method will use `abort` signalling capabilities. This means that splitters may send and read `abort` signals.

    S

      the type of the elements of `that` sequence

    that

      the sequence to test

    returns

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

    Definition Classes
      ParSeqLike → GenSeqLike

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

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

36. #### def exists(pred: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some element of this general sequence.

    Tests whether a predicate holds for some element of this general sequence.

    This method will use `abort` signalling capabilities. This means that splitters may send and read `abort` signals.

    returns

      true if `p` holds for some element, false otherwise

    Definition Classes
      ParIterableLike → GenTraversableOnce

37. #### def filter(pred: (T) ⇒ Boolean): Repr

    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
      ParIterableLike → GenTraversableLike

38. #### def filterNot(pred: (T) ⇒ Boolean): Repr

    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
      ParIterableLike → GenTraversableLike

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

40. #### def find(pred: (T) ⇒ Boolean): Option[T]

    Finds some element in the collection for which the predicate holds, if such an element exists.

    Finds some element in the collection for which the predicate holds, if such an element exists. The element may not necessarily be the first such element in the iteration order.

    If there are multiple elements obeying the predicate, the choice is nondeterministic.

    This method will use `abort` signalling capabilities. This means that splitters may send and read `abort` signals.

    returns

      an option value with the element if such an element exists, or `None` otherwise

    Definition Classes
      ParIterableLike → GenTraversableOnce

41. #### def flatMap[B](f: (T) ⇒ 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
      ParIterableLike → GenTraversableLike

42. #### def fold[U >: T](z: U)(op: (U, U) ⇒ U): U

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

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the `foldLeft` and `foldRight` methods of the trait `Traversable`. The result of folding may only be a supertype of this parallel collection's type parameter `T`.

    U

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

    z

      a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing 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
      ParIterableLike → GenTraversableOnce

43. #### def foldLeft[S](z: S)(op: (S, T) ⇒ S): S

    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.

    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
      ParIterableLike → GenTraversableOnce

44. #### def foldRight[S](z: S)(op: (T, S) ⇒ S): S

    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.

    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
      ParIterableLike → GenTraversableOnce

45. #### def forall(pred: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this general sequence.

    Tests whether a predicate holds for all elements of this general sequence.

    This method will use `abort` signalling capabilities. This means that splitters may send and read `abort` signals.

    returns

      true if `p` holds for all elements, false otherwise

    Definition Classes
      ParIterableLike → GenTraversableOnce

46. #### def foreach[U](f: (T) ⇒ U): Unit

    Applies a function `f` to all the elements of general sequence in a sequential order.

    Applies a function `f` to all the elements of general sequence in a sequential order.

    U

      the result type of the function applied to each element, which is always discarded

    f

      function applied to each element

    Definition Classes
      ParIterableLike → GenTraversableLike → GenTraversableOnce

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

48. #### def groupBy[K](f: (T) ⇒ K): ParMap[K, Repr]

    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
      ParIterableLike → GenTraversableLike

49. #### def hasDefiniteSize: Boolean

    Definition Classes
      ParIterableLike → GenTraversableOnce

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

51. #### def head: T

    Definition Classes
      GenIterableLike → GenTraversableLike

52. #### def indexOf(elem: T, 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

53. #### def indexOf(elem: T): 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

54. #### def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    Finds the first element satisfying some predicate.

    Finds the first element satisfying some predicate.

    This method will use `indexFlag` signalling capabilities. This means that splitters may set and read the `indexFlag` state.

    The index flag is initially set to maximum integer value.

    p

      the predicate used to test the elements

    from

      the starting offset for the search

    returns

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

    Definition Classes
      ParSeqLike → GenSeqLike

55. #### def indexWhere(p: (T) ⇒ 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

56. #### def intersect(that: Seq[T]): GenSeq[T]

    [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
      ParSeqLike → GenSeqLike

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

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

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

60. #### def isStrictSplitterCollection: Boolean

    Denotes whether this parallel collection has strict splitters.

    Denotes whether this parallel collection has strict splitters.

    This is true in general, and specific collection instances may choose to override this method. Such collections will fail to execute methods which rely on splitters being strict, i.e. returning a correct value in the `remaining` method.

    This method helps ensure that such failures occur on method invocations, rather than later on and in unpredictable ways.

    Definition Classes
      ParIterableLike

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

62. #### def iterator: PreciseSplitter[T]

    Creates a new split iterator used to traverse the elements of this collection.

    Creates a new split iterator used to traverse the elements of this collection.

    By default, this method is implemented in terms of the protected `splitter` method.

    returns

      a split iterator

    Definition Classes
      ParSeqLike → ParIterableLike → GenIterableLike

63. #### def lastIndexOf(elem: T, 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

64. #### def lastIndexOf(elem: T): 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

65. #### def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    Finds the last element satisfying some predicate.

    Finds the last element satisfying some predicate.

    This method will use `indexFlag` signalling capabilities. This means that splitters may set and read the `indexFlag` state.

    The index flag is initially set to minimum integer value.

    p

      the predicate used to test the elements

    end

      the maximum offset for the search

    returns

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

    Definition Classes
      ParSeqLike → GenSeqLike

66. #### def lastIndexWhere(p: (T) ⇒ 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

67. #### def map[B](f: (T) ⇒ 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
      ParIterableLike → GenTraversableLike

68. #### def max: A

    [use case]

    [use case]
    returns

      the largest element of this general sequence.

    Definition Classes
      ParIterableLike → GenTraversableOnce

69. #### def maxBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

    Definition Classes
      ParIterableLike → GenTraversableOnce

70. #### def min: A

    [use case]

    [use case]
    returns

      the smallest element of this general sequence

    Definition Classes
      ParIterableLike → GenTraversableOnce

71. #### def minBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

    Definition Classes
      ParIterableLike → GenTraversableOnce

72. #### 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
      ParIterableLike → GenTraversableOnce

73. #### 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
      ParIterableLike → GenTraversableOnce
    Example:

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

74. #### 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
      ParIterableLike → GenTraversableOnce
    Example:

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

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

76. #### 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
      ParIterableLike → GenTraversableOnce

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

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

79. #### def padTo(len: Int, elem: T): GenSeq[A]

    [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
      ParSeqLike → GenSeqLike

80. #### def par: Repr

    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
      ParIterableLike → CustomParallelizable → Parallelizable

81. #### def parCombiner: Combiner[T, Repr]

    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
      CustomParallelizable → Parallelizable

82. #### def partition(pred: (T) ⇒ Boolean): (Repr, Repr)

    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
      ParIterableLike → GenTraversableLike

83. #### def patch(from: Int, that: GenSeq[T], replaced: Int): GenSeq[A]

    [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
      ParSeqLike → GenSeqLike

84. #### def prefixLength(p: (T) ⇒ 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

85. #### def product: A

    [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
      ParIterableLike → GenTraversableOnce

86. #### def reduce[U >: T](op: (U, U) ⇒ U): U

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

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

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

    Note this method has a different signature than the `reduceLeft` and `reduceRight` methods of the trait `Traversable`. The result of reducing may only be a supertype of this parallel collection's type parameter `T`.

    U

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

    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
      ParIterableLike → GenTraversableOnce
    Exceptions thrown
      UnsupportedOperationException

      if this general sequence is empty.

87. #### def reduceLeft[U >: T](op: (U, T) ⇒ U): U

    Definition Classes
      ParIterableLike

88. #### def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]

    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.

    op

      the binary operator.

    returns

      an option value containing the result of `reduceLeft(op)` is this general sequence is nonempty, `None` otherwise.

    Definition Classes
      ParIterableLike → GenTraversableOnce

89. #### def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

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

    Note this method has a different signature than the `reduceLeftOption` and `reduceRightOption` methods of the trait `Traversable`. The result of reducing may only be a supertype of this parallel collection's type parameter `T`.

    U

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

    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
      ParIterableLike → GenTraversableOnce

90. #### def reduceRight[U >: T](op: (T, U) ⇒ U): U

    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.

    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
      ParIterableLike → GenTraversableOnce
    Exceptions thrown
      `UnsupportedOperationException`

      if this general sequence is empty.

91. #### def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]

    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.

    op

      the binary operator.

    returns

      an option value containing the result of `reduceRight(op)` is this general sequence is nonempty, `None` otherwise.

    Definition Classes
      ParIterableLike → GenTraversableOnce

92. #### def repr: Repr

    Definition Classes
      ParIterableLike → GenTraversableLike

93. #### def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Optionally reuses an existing combiner for better performance.

    Optionally reuses an existing combiner for better performance. By default it doesn't - subclasses may override this behaviour. The provided combiner `oldc` that can potentially be reused will be either some combiner from the previous computational task, or `None` if there was no previous phase (in which case this method must return `newc`).

    oldc

      The combiner that is the result of the previous task, or `None` if there was no previous task.

    newc

      The new, empty combiner that can be used.

    returns

      Either `newc` or `oldc`.

    Attributes
      protected
    Definition Classes
      ParIterableLike

94. #### def reverse: Repr

    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
      ParSeqLike → GenSeqLike

95. #### def reverseMap[B](f: (T) ⇒ 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
      ParSeqLike → GenSeqLike

96. #### def sameElements(that: GenIterable[T]): 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
      ParSeqLike → ParIterableLike → GenIterableLike

97. #### def scan(z: T)(op: (T, T) ⇒ T): GenSeq[T]

    [use case]

    [use case]
    z

      neutral element for the operator `op`

    op

      the associative operator for the scan

    returns

      a new general sequence containing the prefix scan of the elements in this general sequence

    Definition Classes
      ParIterableLike → GenTraversableLike

98. #### def scanBlockSize: Int

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

99. #### def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, 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.

    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
      ParIterableLike → GenTraversableLike

100. #### def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, 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)

     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
       ParIterableLike → GenTraversableLike

101. #### def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

     Returns the length of the longest segment of elements starting at a given position satisfying some predicate.

     Returns the length of the longest segment of elements starting at a given position satisfying some predicate.

     This method will use `indexFlag` signalling capabilities. This means that splitters may set and read the `indexFlag` state.

     The index flag is initially set to maximum integer value.

     p

       the predicate used to test the elements

     from

       the starting offset for the search

     returns

       the length of the longest segment of elements starting at `from` and satisfying the predicate

     Definition Classes
       ParSeqLike → GenSeqLike

102. #### def sequentially[S, That <: Parallel](b: (Sequential) ⇒ Parallelizable[S, That]): Repr

     Attributes
       protected[this]
     Definition Classes
       ParIterableLike

103. #### 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
       ParSeqLike → GenTraversableLike → GenTraversableOnce

104. #### def slice(unc_from: Int, unc_until: Int): Repr

     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
       ParIterableLike → GenTraversableLike

105. #### def span(pred: (T) ⇒ Boolean): (Repr, Repr)

     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.

     This method will use `indexFlag` signalling capabilities. This means that splitters may set and read the `indexFlag` state. The index flag is initially set to maximum integer value.

     pred

       the predicate used to test the elements

     returns

       a pair consisting of the longest prefix of the collection for which all the elements satisfy `pred`, and the rest of the collection

     Definition Classes
       ParIterableLike → GenTraversableLike

106. #### def splitAt(n: Int): (Repr, Repr)

     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
       ParIterableLike → GenTraversableLike

107. #### def startsWith[S](that: GenSeq[S], 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.

     This method will use `abort` signalling capabilities. This means that splitters may send and read `abort` signals.

     that

       the parallel sequence this sequence is being searched for

     offset

       the starting offset for the search

     returns

       `true` if there is a sequence `that` starting at `offset` in this sequence, `false` otherwise

     Definition Classes
       ParSeqLike → GenSeqLike

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

109. #### def sum: A

     [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
       ParIterableLike → GenTraversableOnce

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

     Definition Classes
       AnyRef

111. #### def tail: Repr

     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.

112. #### def take(n: Int): Repr

     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
       ParIterableLike → GenTraversableLike

113. #### def takeWhile(pred: (T) ⇒ Boolean): Repr

     Takes the longest prefix of elements that satisfy the predicate.

     Takes the longest prefix of elements that satisfy the predicate.

     This method will use `indexFlag` signalling capabilities. This means that splitters may set and read the `indexFlag` state. The index flag is initially set to maximum integer value.

     pred

       the predicate used to test the elements

     returns

       the longest prefix of this general sequence of elements that satisy the predicate `pred`

     Definition Classes
       ParIterableLike → GenTraversableLike

114. #### implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

     Attributes
       protected
     Definition Classes
       ParIterableLike

115. #### def toArray: Array[A]

     [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
       ParIterableLike → GenTraversableOnce

116. #### def toBuffer[U >: T]: Buffer[U]

     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
       ParIterableLike → GenTraversableOnce

117. #### def toIndexedSeq: IndexedSeq[T]

     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
       ParIterableLike → GenTraversableOnce

118. #### def toIterable: ParIterable[T]

     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
       ParIterableLike → GenTraversableOnce

119. #### def toIterator: Iterator[T]

     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
       ParIterableLike → GenTraversableOnce

120. #### def toList: List[T]

     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
       ParIterableLike → GenTraversableOnce

121. #### 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
       ParIterableLike → GenTraversableOnce

122. #### def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That

     Attributes
       protected
     Definition Classes
       ParIterableLike

123. #### def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That

     Attributes
       protected
     Definition Classes
       ParIterableLike

124. #### def toSeq: ParSeq[T]

     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
       ParSeqLike → ParIterableLike → GenSeqLike → GenTraversableOnce

125. #### def toSet[U >: T]: ParSet[U]

     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
       ParIterableLike → GenTraversableOnce

126. #### def toStream: Stream[T]

     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
       ParIterableLike → GenTraversableOnce

127. #### 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
       ParSeqLike → ParIterableLike → AnyRef → Any

128. #### def toTraversable: GenTraversable[T]

     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
       ParIterableLike → GenTraversableOnce

129. #### def union(that: GenSeq[T]): GenSeq[T]

     [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

130. #### def updated(index: Int, elem: T): GenSeq[A]

     [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
       ParSeqLike → GenSeqLike

131. #### def view: ParSeqView[T, Repr, Sequential]

     Definition Classes
       ParSeqLike → ParIterableLike

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

135. #### def wrap[R](body: ⇒ R): NonDivisible[R]

     Attributes
       protected
     Definition Classes
       ParIterableLike

136. #### def zip[B](that: GenIterable[B]): GenSeq[(A, 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
       ParSeqLike → ParIterableLike → GenIterableLike

137. #### def zipAll[B](that: Iterable[B], thisElem: T, thatElem: B): GenSeq[(A, 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
       ParIterableLike → GenIterableLike

138. #### def zipWithIndex: GenSeq[(A, 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
       ParIterableLike → GenIterableLike

### Inherited from ParIterableLike[T, Repr, Sequential]

### Inherited from HasNewCombiner[T, Repr]

### Inherited from Parallel

### Inherited from CustomParallelizable[T, Repr]

### Inherited from GenSeqLike[T, Repr]

### Inherited from Equals

### Inherited from GenIterableLike[T, Repr]

### Inherited from GenTraversableLike[T, Repr]

### Inherited from Parallelizable[T, Repr]

### Inherited from GenTraversableOnce[T]

### Inherited from AnyRef

### Inherited from Any