Trait/Object

scala.collection.parallel.immutable

ParSeq

Related Docs: object ParSeq | package immutable

Permalink

trait ParSeq[+T] extends GenSeq[T] with parallel.ParSeq[T] with ParIterable[T] with GenericParTemplate[T, ParSeq] with ParSeqLike[T, ParSeq[T], immutable.Seq[T]]

An immutable variant of ParSeq.

Linear Supertypes
ParIterable[T], Immutable, parallel.ParSeq[T], ParSeqLike[T, ParSeq[T], immutable.Seq[T]], parallel.ParIterable[T], ParIterableLike[T, ParSeq[T], immutable.Seq[T]], Parallel, CustomParallelizable[T, ParSeq[T]], GenericParTemplate[T, ParSeq], HasNewCombiner[T, scala.collection.parallel.immutable.ParSeq[T] @scala.annotation.unchecked.uncheckedVariance], GenSeq[T], GenIterable[T], GenTraversable[T], GenericTraversableTemplate[T, ParSeq], HasNewBuilder[T, scala.collection.parallel.immutable.ParSeq[T] @scala.annotation.unchecked.uncheckedVariance], GenSeqLike[T, ParSeq[T]], Equals, GenIterableLike[T, ParSeq[T]], GenTraversableLike[T, ParSeq[T]], Parallelizable[T, ParSeq[T]], GenTraversableOnce[T], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParSeq
  2. ParIterable
  3. Immutable
  4. ParSeq
  5. ParSeqLike
  6. ParIterable
  7. ParIterableLike
  8. Parallel
  9. CustomParallelizable
  10. GenericParTemplate
  11. HasNewCombiner
  12. GenSeq
  13. GenIterable
  14. GenTraversable
  15. GenericTraversableTemplate
  16. HasNewBuilder
  17. GenSeqLike
  18. Equals
  19. GenIterableLike
  20. GenTraversableLike
  21. Parallelizable
  22. GenTraversableOnce
  23. AnyRef
  24. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

    Permalink
    Attributes
    protected
    Definition Classes
    ParSeqLike
  2. class Aggregate[S] extends Accessor[S, Aggregate[S]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  3. trait BuilderOps[Elem, To] extends AnyRef

    Permalink
    Definition Classes
    ParIterableLike
  4. class Collect[S, That] extends Transformer[Combiner[S, That], Collect[S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  5. abstract class Composite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  6. class Copy[U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  7. class CopyToArray[U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  8. class Corresponds[S] extends Accessor[Boolean, Corresponds[S]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  9. class Count extends Accessor[Int, Count]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  10. class CreateScanTree[U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  11. class Drop[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  12. abstract class Elements extends SeqSplitter[T] with scala.BufferedIterator[T]

    Permalink

    Used to iterate elements using indices

    Used to iterate elements using indices

    Attributes
    protected
    Definition Classes
    ParSeqLike
  13. class Exists extends Accessor[Boolean, Exists]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  14. class Filter[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  15. class FilterNot[U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  16. class Find[U >: T] extends Accessor[Option[U], Find[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. class FlatMap[S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  18. class Fold[U >: T] extends Accessor[U, Fold[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  19. class Forall extends Accessor[Boolean, Forall]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  20. class Foreach[S] extends Accessor[Unit, Foreach[S]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  21. class FromScanTree[U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. class GroupBy[K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  23. class IndexWhere extends Accessor[Int, IndexWhere]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  24. class LastIndexWhere extends Accessor[Int, LastIndexWhere]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  25. class Map[S, That] extends Transformer[Combiner[S, That], Map[S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  26. class Max[U >: T] extends Accessor[Option[U], Max[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  27. class Min[U >: T] extends Accessor[Option[U], Min[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  28. trait NonDivisible[R] extends NonDivisibleTask[R, NonDivisible[R]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  29. trait NonDivisibleTask[R, Tp] extends StrictSplitterCheckTask[R, Tp]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  30. abstract class ParComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Permalink

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  31. class Partition[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  32. class Product[U >: T] extends Accessor[U, Product[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  33. class Reduce[U >: T] extends Accessor[Option[U], Reduce[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  34. abstract class ResultMapping[R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  35. class Reverse[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  36. class ReverseMap[S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  37. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

    Permalink
    Definition Classes
    ParIterableLike
  38. class SameElements[U >: T] extends Accessor[Boolean, SameElements[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  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 scala.Product with Serializable

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  40. case class ScanNode[U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  41. trait ScanTree[U >: T] extends AnyRef

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  42. class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  43. abstract class SeqComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Permalink

    Sequentially performs one task after another.

    Sequentially performs one task after another.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  44. trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef

    Permalink
    Definition Classes
    ParIterableLike
  45. class Slice[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  46. class Span[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  47. class SplitAt[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  48. trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  49. class Sum[U >: T] extends Accessor[U, Sum[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  50. type SuperParIterator = IterableSplitter[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  51. class Take[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  52. class TakeWhile[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  53. trait TaskOps[R, Tp] extends AnyRef

    Permalink
    Definition Classes
    ParIterableLike
  54. class ToParCollection[U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  55. class ToParMap[K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  56. trait Transformer[R, Tp] extends Accessor[R, Tp] with ParSeqLike.Transformer[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParSeqLike
  57. class Updated[U >: T, That] extends Transformer[Combiner[U, That], Updated[U, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  58. class Zip[U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  59. class ZipAll[U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike

Abstract Value Members

  1. abstract def apply(i: Int): T

    Permalink

    Selects an element by its index in the parallel iterable.

    Selects an element by its index in the parallel iterable.

    Example:

    scala> val x = List(1, 2, 3, 4, 5)
    x: List[Int] = List(1, 2, 3, 4, 5)
    
    scala> x(3)
    res1: Int = 4
    returns

    the element of this parallel iterable at index idx, where 0 indicates the first element.

    Definition Classes
    ParSeqGenSeqLike
    Exceptions thrown

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

  2. abstract def length: Int

    Permalink

    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 seq: immutable.Seq[T]

    Permalink
  4. abstract def splitter: SeqSplitter[T]

    Permalink

    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[scala.collection.parallel]
    Definition Classes
    ParSeqLikeParIterableLike

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++[B](that: GenTraversableOnce[B]): mutable.ParSeq[B]

    Permalink

    [use case] Returns a new mutable parallel sequence containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new mutable parallel sequence containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the mutable parallel sequence is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new mutable parallel sequence which contains all elements of this mutable parallel sequence followed by all elements of that.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

  4. def +:(elem: A): mutable.ParSeq[A]

    Permalink

    [use case] A copy of the mutable parallel sequence with an element prepended.

    [use case]

    A copy of the mutable parallel sequence with an element prepended.

    Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Also, the original mutable parallel sequence is not modified, so you will want to capture the result.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = 2 +: x
    y: List[Int] = List(2, 1)
    
    scala> println(x)
    List(1)
    elem

    the prepended element

    returns

    a new mutable parallel sequence consisting of elem followed by all elements of this mutable parallel sequence.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def +:[U >: T, That](elem: U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

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

    Permalink

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

    Applies a binary operator to a start value and all elements of this parallel iterable, 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 = List(1,2,3,4)
    a: List[Int] = List(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 parallel iterable, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  6. def :+(elem: A): mutable.ParSeq[A]

    Permalink

    [use case] A copy of this mutable parallel sequence with an element appended.

    [use case]

    A copy of this mutable parallel sequence with an element appended.

    A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Note: will not terminate for infinite-sized collections.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = a :+ 2
    b: List[Int] = List(1, 2)
    
    scala> println(a)
    List(1)
    elem

    the appended element

    returns

    a new mutable parallel sequence consisting of all elements of this mutable parallel sequence followed by elem.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def :+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

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

    Permalink

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

    Applies a binary operator to all elements of this parallel iterable 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 = List(1,2,3,4)
    a: List[Int] = List(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 parallel iterable, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  8. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    Permalink

    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 set, while combop would concatenate two sets 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) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    ParIterableLikeGenTraversableOnce
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. def bf2seq[S, That](bf: CanBuildFrom[ParSeq[T], S, That]): CanBuildFrom[immutable.Seq[T], S, That]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  12. implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  13. def canEqual(other: Any): Boolean

    Permalink
    Definition Classes
    ParIterableLike
  14. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  15. def collect[B](pf: PartialFunction[A, B]): mutable.ParSeq[B]

    Permalink

    [use case] Builds a new collection by applying a partial function to all elements of this mutable parallel sequence on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this mutable parallel sequence on which the function is defined.

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the mutable parallel sequence.

    returns

    a new mutable parallel 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
    ParIterableLikeGenTraversableLike
    Full Signature

    def collect[S, That](pf: PartialFunction[T, S])(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. def combinerFactory: CombinerFactory[T, ParSeq[T]]

    Permalink

    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
  18. def companion: GenericCompanion[ParSeq] with GenericParCompanion[ParSeq]

    Permalink

    The factory companion object that builds instances of class mutable.ParSeq.

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

    Definition Classes
    ParSeqParIterableParSeqParIterableGenericParTemplateGenSeqGenIterableGenTraversableGenericTraversableTemplate
  19. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    Permalink

    [use case] Copies the elements of this mutable parallel sequence to an array.

    [use case]

    Copies the elements of this mutable parallel sequence to an array. Fills the given array xs with at most len elements of this mutable parallel sequence, starting at position start. Copying will stop once either the end of the current mutable parallel sequence is reached, or the end of the target array is reached, or len elements have been copied.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  20. def copyToArray(xs: Array[A], start: Int): Unit

    Permalink

    [use case] Copies the elements of this mutable parallel sequence to an array.

    [use case]

    Copies the elements of this mutable parallel sequence to an array. Fills the given array xs with values of this mutable parallel sequence, beginning at index start. Copying will stop once either the end of the current mutable parallel sequence is reached, or the end of the target array is reached.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  21. def copyToArray(xs: Array[A]): Unit

    Permalink

    [use case] Copies the elements of this mutable parallel sequence to an array.

    [use case]

    Copies the elements of this mutable parallel sequence to an array. Fills the given array xs with values of this mutable parallel sequence. Copying will stop once either the end of the current mutable parallel sequence is reached, or the end of the target array is reached.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def copyToArray[U >: T](xs: Array[U]): Unit

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

    Permalink

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

    Tests whether every element of this parallel iterable 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 parallel iterable and y of that, otherwise false

    Definition Classes
    ParSeqLikeGenSeqLike
  23. def count(p: (T) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the parallel iterable which satisfy a predicate.

    Counts the number of elements in the parallel iterable which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  24. def debugBuffer: ArrayBuffer[String]

    Permalink
    Definition Classes
    ParIterableLike
  25. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  26. def diff(that: GenSeq[A]): mutable.ParSeq[A]

    Permalink

    [use case] Computes the multiset difference between this mutable parallel sequence and another sequence.

    [use case]

    Computes the multiset difference between this mutable parallel sequence and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new mutable parallel sequence which contains all elements of this mutable parallel 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
    ParSeqLikeGenSeqLike
    Full Signature

    def diff[U >: T](that: GenSeq[U]): ParSeq[T]

  27. def distinct: ParSeq[T]

    Permalink

    Builds a new parallel iterable from this parallel iterable without any duplicate elements.

    Builds a new parallel iterable from this parallel iterable without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    returns

    A new parallel iterable which contains the first occurrence of every element of this parallel iterable.

    Definition Classes
    ParSeqLikeGenSeqLike
  28. def down(p: IterableSplitter[_]): SeqSplitter[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  29. def drop(n: Int): ParSeq[T]

    Permalink

    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 parallel iterable.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  30. def dropWhile(pred: (T) ⇒ Boolean): ParSeq[T]

    Permalink

    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 parallel iterable that satisfy the predicate pred

    Definition Classes
    ParIterableLikeGenTraversableLike
  31. def endsWith[S](that: GenSeq[S]): Boolean

    Permalink

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

    Tests whether this parallel iterable 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 parallel iterable has that as a suffix, false otherwise

    Definition Classes
    ParSeqLikeGenSeqLike
  32. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  33. def equals(that: Any): Boolean

    Permalink

    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
    GenSeqLikeEquals → Any
  34. def exists(p: (T) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for some element of this parallel iterable.

    Tests whether a predicate holds for some element of this parallel iterable.

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

    p

    a predicate used to test elements

    returns

    true if p holds for some element, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  35. def filter(pred: (T) ⇒ Boolean): ParSeq[T]

    Permalink

    Selects all elements of this parallel iterable which satisfy a predicate.

    Selects all elements of this parallel iterable which satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  36. def filterNot(pred: (T) ⇒ Boolean): ParSeq[T]

    Permalink

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  37. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  38. def find(p: (T) ⇒ Boolean): Option[T]

    Permalink

    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.

    p

    predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  39. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): mutable.ParSeq[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this mutable parallel sequence and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this mutable parallel sequence and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of mutable parallel sequence. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def flatMap[S, That](f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

  40. def flatten[B]: mutable.ParSeq[B]

    Permalink

    [use case] Converts this mutable parallel sequence of traversable collections into a mutable parallel sequence formed by the elements of these traversable collections.

    [use case]

    Converts this mutable parallel sequence of traversable collections into a mutable parallel sequence formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of mutable parallel sequence. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(1, 2, 3)
             ).flatten
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(
               List(1, 2, 3),
               List(3, 2, 1)
             ).flatten
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new mutable parallel sequence resulting from concatenating all element mutable parallel sequences.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

    def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSeq[B]

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

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  42. def foldLeft[S](z: S)(op: (S, T) ⇒ S): S

    Permalink

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

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

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this parallel iterable. Returns z if this parallel iterable is empty.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  43. def foldRight[S](z: S)(op: (T, S) ⇒ S): S

    Permalink

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

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

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this parallel iterable. Returns z if this parallel iterable is empty.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  44. def forall(p: (T) ⇒ Boolean): Boolean

    Permalink

    Tests whether a predicate holds for all elements of this parallel iterable.

    Tests whether a predicate holds for all elements of this parallel iterable.

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

    p

    a predicate used to test elements

    returns

    true if p holds for all elements, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  45. def foreach[U](f: (T) ⇒ U): Unit

    Permalink

    Applies a function f to all the elements of parallel iterable in an undefined order.

    Applies a function f to all the elements of parallel iterable in an undefined order.

    U

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

    f

    function applied to each element

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  46. def genericBuilder[B]: Combiner[B, ParSeq[B]]

    Permalink

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

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

    Definition Classes
    GenericParTemplateGenericTraversableTemplate
  47. def genericCombiner[B]: Combiner[B, ParSeq[B]]

    Permalink
    Definition Classes
    GenericParTemplate
  48. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  49. def groupBy[K](f: (T) ⇒ K): ParMap[K, ParSeq[T]]

    Permalink

    Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.

    Partitions this parallel iterable into a map of parallel iterables 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 parallel iterable.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  50. def hasDefiniteSize: Boolean

    Permalink

    Tests whether this parallel iterable is known to have a finite size.

    Tests whether this parallel iterable is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

    true if this collection is known to have finite size, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  51. def hashCode(): Int

    Permalink

    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.

    Definition Classes
    GenSeqLike → Any
  52. def head: T

    Permalink

    Selects the first element of this parallel iterable.

    Selects the first element of this parallel iterable.

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

    returns

    the first element of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    NoSuchElementException if the parallel iterable is empty.

  53. def headOption: Option[T]

    Permalink

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

    the first element of this parallel iterable if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  54. def indexOf(elem: T, from: Int): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this mutable parallel sequence after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this mutable parallel sequence after or at some start index.

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this mutable parallel sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: T](elem: B, from: Int): Int

  55. def indexOf(elem: T): Int

    Permalink

    [use case] Finds index of first occurrence of some value in this mutable parallel sequence.

    [use case]

    Finds index of first occurrence of some value in this mutable parallel sequence.

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

    the index of the first element of this mutable parallel sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: T](elem: B): Int

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

    Permalink

    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 parallel iterable that satisfies the predicate p, or -1, if none exists

    Definition Classes
    ParSeqLikeGenSeqLike
  57. def indexWhere(p: (T) ⇒ Boolean): Int

    Permalink

    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
  58. def init: ParSeq[T]

    Permalink

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

    a parallel iterable consisting of all elements of this parallel iterable except the last one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

  59. def initTaskSupport(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  60. def intersect(that: scala.Seq[T]): mutable.ParSeq[T]

    Permalink

    [use case] Computes the multiset intersection between this mutable parallel sequence and another sequence.

    [use case]

    Computes the multiset intersection between this mutable parallel sequence and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

    a new mutable parallel sequence which contains all elements of this mutable parallel 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
    ParSeqLikeGenSeqLike
    Full Signature

    def intersect[U >: T](that: GenSeq[U]): ParSeq[T]

  61. def isDefinedAt(idx: Int): Boolean

    Permalink

    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
  62. def isEmpty: Boolean

    Permalink

    Tests whether the parallel iterable is empty.

    Tests whether the parallel iterable is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

    true if the parallel iterable contains no elements, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  63. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  64. def isStrictSplitterCollection: Boolean

    Permalink

    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
  65. final def isTraversableAgain: Boolean

    Permalink

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  66. def iterator: PreciseSplitter[T]

    Permalink

    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
    ParSeqLikeParIterableLikeGenIterableLike
  67. def last: T

    Permalink

    Selects the last element.

    Selects the last element.

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

    returns

    The last element of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    NoSuchElementException If the parallel iterable is empty.

  68. def lastIndexOf(elem: T, end: Int): Int

    Permalink

    [use case] Finds index of last occurrence of some value in this mutable parallel sequence before or at a given end index.

    [use case]

    Finds index of last occurrence of some value in this mutable parallel sequence before or at a given end index.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this mutable parallel sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def lastIndexOf[B >: T](elem: B, end: Int): Int

  69. def lastIndexOf(elem: T): Int

    Permalink

    [use case] Finds index of last occurrence of some value in this mutable parallel sequence.

    [use case]

    Finds index of last occurrence of some value in this mutable parallel sequence.

    Note: will not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

    the index of the last element of this mutable parallel sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def lastIndexOf[B >: T](elem: B): Int

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

    Permalink

    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 parallel iterable that satisfies the predicate p, or -1, if none exists

    Definition Classes
    ParSeqLikeGenSeqLike
  71. def lastIndexWhere(p: (T) ⇒ Boolean): Int

    Permalink

    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
  72. def lastOption: Option[T]

    Permalink

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

    the last element of this parallel iterable$ if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  73. def map[B](f: (A) ⇒ B): mutable.ParSeq[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this mutable parallel sequence.

    [use case]

    Builds a new collection by applying a function to all elements of this mutable parallel sequence.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def map[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

  74. def max: A

    Permalink

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this mutable parallel sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def max[U >: T](implicit ord: Ordering[U]): T

  75. def maxBy[B](f: (A) ⇒ B): A

    Permalink

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this mutable parallel sequence with the largest value measured by function f.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  76. def min: A

    Permalink

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this mutable parallel sequence

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def min[U >: T](implicit ord: Ordering[U]): T

  77. def minBy[B](f: (A) ⇒ B): A

    Permalink

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this mutable parallel sequence with the smallest value measured by function f.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  78. def mkString: String

    Permalink

    Displays all elements of this parallel iterable in a string.

    Displays all elements of this parallel iterable in a string.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  79. def mkString(sep: String): String

    Permalink

    Displays all elements of this parallel iterable in a string using a separator string.

    Displays all elements of this parallel iterable in a string using a separator string.

    sep

    the separator string.

    returns

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

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

  80. def mkString(start: String, sep: String, end: String): String

    Permalink

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

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

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

  81. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  82. def newBuilder: Builder[T, ParSeq[T]]

    Permalink

    The builder that builds instances of type Traversable[A]

    The builder that builds instances of type Traversable[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateGenericTraversableTemplateHasNewBuilder
  83. def newCombiner: Combiner[T, ParSeq[T]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateHasNewCombiner
  84. def nonEmpty: Boolean

    Permalink

    Tests whether the parallel iterable is not empty.

    Tests whether the parallel iterable is not empty.

    returns

    true if the parallel iterable contains at least one element, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  85. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  86. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  87. def padTo(len: Int, elem: A): mutable.ParSeq[A]

    Permalink

    [use case] A copy of this mutable parallel sequence with an element value appended until a given target length is reached.

    [use case]

    A copy of this mutable parallel sequence with an element value appended until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def padTo[U >: T, That](len: Int, elem: U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

  88. def par: ParSeq[T]

    Permalink

    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
    ParIterableLikeCustomParallelizableParallelizable
  89. def parCombiner: Combiner[T, ParSeq[T]]

    Permalink

    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
    CustomParallelizableParallelizable
  90. def partition(pred: (T) ⇒ Boolean): (ParSeq[T], ParSeq[T])

    Permalink

    Partitions this parallel iterable in two parallel iterables according to a predicate.

    Partitions this parallel iterable in two parallel iterables according to a predicate.

    pred

    the predicate on which to partition.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  91. def patch(from: Int, that: GenSeq[A], replaced: Int): mutable.ParSeq[A]

    Permalink

    [use case] Produces a new mutable parallel sequence where a slice of elements in this mutable parallel sequence is replaced by another sequence.

    [use case]

    Produces a new mutable parallel sequence where a slice of elements in this mutable parallel sequence is replaced by another sequence.

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original mutable parallel sequence

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def patch[U >: T, That](from: Int, patch: GenSeq[U], replaced: Int)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

  92. def prefixLength(p: (T) ⇒ Boolean): Int

    Permalink

    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
  93. def product: A

    Permalink

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def product[U >: T](implicit num: Numeric[U]): U

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

    Permalink

    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
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

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

    Permalink
    Definition Classes
    ParIterableLike
  96. def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]

    Permalink

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

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  97. def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  98. def reduceRight[U >: T](op: (T, U) ⇒ U): U

    Permalink

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

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

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

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

    Permalink

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

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  100. def repr: ParSeq[T]

    Permalink
    Definition Classes
    ParIterableLikeGenTraversableLike
  101. def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Permalink

    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
  102. def reverse: ParSeq[T]

    Permalink

    Returns new parallel iterable with elements in reversed order.

    Returns new parallel iterable with elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

    A new parallel iterable with all elements of this parallel iterable in reversed order.

    Definition Classes
    ParSeqLikeGenSeqLike
  103. def reverseMap[B](f: (A) ⇒ B): mutable.ParSeq[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this mutable parallel sequence and collecting the results in reversed order.

    [use case]

    Builds a new collection by applying a function to all elements of this mutable parallel sequence and collecting the results in reversed order.

    Note: will not terminate for infinite-sized collections.

    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 mutable parallel sequence resulting from applying the given function f to each element of this mutable parallel sequence and collecting the results in reversed order.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def reverseMap[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

  104. def sameElements(that: GenIterable[A]): Boolean

    Permalink

    [use case] Checks if the other iterable collection contains the same elements in the same order as this mutable parallel sequence.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this mutable parallel sequence.

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

    Note: will not terminate for infinite-sized collections.

    that

    the collection to compare with.

    returns

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

    Definition Classes
    ParSeqLikeParIterableLikeGenIterableLike
    Full Signature

    def sameElements[U >: T](that: GenIterable[U]): Boolean

  105. def scan(z: T)(op: (T, T) ⇒ T): mutable.ParSeq[T]

    Permalink

    [use case] Computes a prefix scan of the elements of the collection.

    [use case]

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a new mutable parallel sequence containing the prefix scan of the elements in this mutable parallel sequence

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def scan[U >: T, That](z: U)(op: (U, U) ⇒ U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

  106. def scanBlockSize: Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  107. def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

    Permalink

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

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

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

    Permalink

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

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

    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
    ParIterableLikeGenTraversableLike
  109. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

    Permalink

    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
    ParSeqLikeGenSeqLike
  110. def sequentially[S, That <: Parallel](b: (immutable.Seq[T]) ⇒ Parallelizable[S, That]): ParSeq[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  111. def size: Int

    Permalink

    The size of this parallel iterable.

    The size of this parallel iterable.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this parallel iterable.

    Definition Classes
    ParSeqLikeGenTraversableLikeGenTraversableOnce
  112. def slice(unc_from: Int, unc_until: Int): ParSeq[T]

    Permalink

    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.

    unc_from

    the lowest index to include from this parallel iterable.

    unc_until

    the lowest index to EXCLUDE from this parallel iterable.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  113. def span(pred: (T) ⇒ Boolean): (ParSeq[T], ParSeq[T])

    Permalink

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

    Splits this parallel iterable 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
    ParIterableLikeGenTraversableLike
  114. def splitAt(n: Int): (ParSeq[T], ParSeq[T])

    Permalink

    Splits this parallel iterable into two at a given position.

    Splits this parallel iterable 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 parallel iterables consisting of the first n elements of this parallel iterable, and the other elements.

    Definition Classes
    ParIterableLikeGenTraversableLike
  115. def startsWith[S](that: GenSeq[S], offset: Int): Boolean

    Permalink

    Tests whether this parallel iterable contains the given sequence at a given index.

    Tests whether this parallel iterable 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.

    S

    the element type of that parallel sequence

    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
    ParSeqLikeGenSeqLike
  116. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink

    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
  117. def stringPrefix: String

    Permalink

    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 parallel iterable. By default the string prefix is the simple name of the collection class parallel iterable.

    Definition Classes
    ParSeqParIterableGenTraversableLike
  118. def sum: A

    Permalink

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def sum[U >: T](implicit num: Numeric[U]): U

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

    Permalink
    Definition Classes
    AnyRef
  120. def tail: ParSeq[T]

    Permalink

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

  121. def take(n: Int): ParSeq[T]

    Permalink

    Selects first n elements.

    Selects first n elements.

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

    n

    the number of elements to take from this parallel iterable.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  122. def takeWhile(pred: (T) ⇒ Boolean): ParSeq[T]

    Permalink

    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 parallel iterable of elements that satisfy the predicate pred

    Definition Classes
    ParIterableLikeGenTraversableLike
  123. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  124. def tasksupport: TaskSupport

    Permalink

    The task support object which is responsible for scheduling and load-balancing tasks to processors.

    The task support object which is responsible for scheduling and load-balancing tasks to processors.

    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  125. def tasksupport_=(ts: TaskSupport): Unit

    Permalink

    Changes the task support object which is responsible for scheduling and load-balancing tasks to processors.

    Changes the task support object which is responsible for scheduling and load-balancing tasks to processors.

    A task support object can be changed in a parallel collection after it has been created, but only during a quiescent period, i.e. while there are no concurrent invocations to parallel collection methods.

    Here is a way to change the task support of a parallel collection:

    import scala.collection.parallel._
    val pc = mutable.ParArray(1, 2, 3)
    pc.tasksupport = new ForkJoinTaskSupport(
      new scala.concurrent.forkjoin.ForkJoinPool(2))
    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  126. def to[Col[_]]: Col[A]

    Permalink

    [use case] Converts this mutable parallel sequence into another by copying all elements.

    [use case]

    Converts this mutable parallel sequence into another by copying all elements.

    Note: will not terminate for infinite-sized collections.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this mutable parallel sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

  127. def toArray: Array[A]

    Permalink

    [use case] Converts this mutable parallel sequence to an array.

    [use case]

    Converts this mutable parallel sequence to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this mutable parallel sequence. An ClassTag must be available for the element type of this mutable parallel sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def toArray[U >: T](implicit arg0: ClassTag[U]): Array[U]

  128. def toBuffer[U >: T]: Buffer[U]

    Permalink

    Uses the contents of this parallel iterable to create a new mutable buffer.

    Uses the contents of this parallel iterable to create a new mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  129. def toIndexedSeq: immutable.IndexedSeq[T]

    Permalink

    Converts this parallel iterable to an indexed sequence.

    Converts this parallel iterable to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  130. def toIterable: ParIterable[T]

    Permalink

    Converts this parallel iterable to an iterable collection.

    Converts this parallel iterable 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 parallel iterable.

    Definition Classes
    ParIterableParIterableLikeGenTraversableOnce
  131. def toIterator: scala.Iterator[T]

    Permalink

    Returns an Iterator over the elements in this parallel iterable.

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  132. def toList: List[T]

    Permalink

    Converts this parallel iterable to a list.

    Converts this parallel iterable to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  133. def toMap[T, U]: collection.Map[T, U]

    Permalink

    [use case] Converts this mutable parallel sequence to a map.

    [use case]

    Converts this mutable parallel sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def toMap[K, V](implicit ev: <:<[T, (K, V)]): ParMap[K, V]

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

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  135. def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  136. def toSeq: ParSeq[T]

    Permalink

    Converts this mutable parallel sequence to a sequence.

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

    Definition Classes
    ParSeqParIterableParSeqLikeParIterableLikeGenSeqLikeGenTraversableOnce
  137. def toSet[U >: T]: ParSet[U]

    Permalink

    Converts this parallel iterable to a set.

    Converts this parallel iterable to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  138. def toStream: Stream[T]

    Permalink

    Converts this parallel iterable to a stream.

    Converts this parallel iterable to a stream.

    returns

    a stream containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  139. def toString(): String

    Permalink
    Definition Classes
    ParSeqParSeqLikeParIterableLike → AnyRef → Any
  140. def toTraversable: GenTraversable[T]

    Permalink

    Converts this parallel iterable to an unspecified Traversable.

    Converts this parallel iterable 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 parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  141. def toVector: Vector[T]

    Permalink

    Converts this parallel iterable to a Vector.

    Converts this parallel iterable to a Vector.

    Note: will not terminate for infinite-sized collections.

    returns

    a vector containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  142. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSeq[ParSeq[B]]

    Permalink

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

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

    The resulting collection's type will be guided by the static type of collection. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(4, 5, 6)).transpose
    // xs == List(
    //         List(1, 4),
    //         List(2, 5),
    //         List(3, 6))
    
    val ys = Vector(
               List(1, 2, 3),
               List(4, 5, 6)).transpose
    // ys == Vector(
    //         Vector(1, 4),
    //         Vector(2, 5),
    //         Vector(3, 6))
    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

    Exceptions thrown

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

  143. def union(that: GenSeq[T]): mutable.ParSeq[T]

    Permalink

    [use case] Produces a new sequence which contains all elements of this mutable parallel sequence and also all elements of a given sequence.

    [use case]

    Produces a new sequence which contains all elements of this mutable parallel sequence and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    Another way to express this is that xs union ys computes the order-preserving multi-set union of xs and ys. union is hence a counter-part of diff and intersect which also work on multi-sets.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add.

    returns

    a new mutable parallel sequence which contains all elements of this mutable parallel sequence followed by all elements of that.

    Definition Classes
    GenSeqLike
    Full Signature

    def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ParSeq[T], B, That]): That

  144. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParSeq[A1], ParSeq[A2])

    Permalink

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

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

    val xs = Traversable(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (Traversable(1, 2, 3),
    //        Traversable(one, two, three))
    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  145. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParSeq[A1], ParSeq[A2], ParSeq[A3])

    Permalink

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

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

    val xs = Traversable(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (Traversable(1, 2, 3),
    //        Traversable(one, two, three),
    //        Traversable(1, 2, 3))
    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  146. def updated(index: Int, elem: A): mutable.ParSeq[A]

    Permalink

    [use case] A copy of this mutable parallel sequence with one single replaced element.

    [use case]

    A copy of this mutable parallel sequence with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this mutable parallel sequence with the element at position index replaced by elem.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def updated[U >: T, That](index: Int, elem: U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

  147. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  148. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  149. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  150. def withFilter(pred: (T) ⇒ Boolean): ParSeq[T]

    Permalink
    Definition Classes
    ParIterableLike
  151. def wrap[R](body: ⇒ R): NonDivisible[R]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  152. def zip[B](that: GenIterable[B]): mutable.ParSeq[(A, B)]

    Permalink

    [use case] Returns a mutable parallel sequence formed from this mutable parallel sequence and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a mutable parallel sequence formed from this mutable parallel sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

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

    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 mutable parallel sequence containing pairs consisting of corresponding elements of this mutable parallel sequence and that. The length of the returned collection is the minimum of the lengths of this mutable parallel sequence and that.

    Definition Classes
    ParSeqLikeParIterableLikeGenIterableLike
    Full Signature

    def zip[U >: T, S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[ParSeq[T], (U, S), That]): That

  153. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): mutable.ParSeq[(A, B)]

    Permalink

    [use case] Returns a mutable parallel sequence formed from this mutable parallel sequence and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a mutable parallel sequence formed from this mutable parallel sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

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

    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 mutable parallel sequence is shorter than that.

    thatElem

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

    returns

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

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zipAll[S, U >: T, That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[ParSeq[T], (U, S), That]): That

  154. def zipWithIndex: mutable.ParSeq[(A, Int)]

    Permalink

    [use case] Zips this mutable parallel sequence with its indices.

    [use case]

    Zips this mutable parallel sequence with its indices.

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

    returns

    A new mutable parallel sequence containing pairs consisting of all elements of this mutable parallel sequence paired with their index. Indices start at 0.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[U >: T, That](implicit bf: CanBuildFrom[ParSeq[T], (U, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

Deprecated Value Members

  1. def view: SeqView[T, immutable.Seq[T]]

    Permalink
    Definition Classes
    ParSeqLikeParIterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) use .seq.view

Inherited from ParIterable[T]

Inherited from Immutable

Inherited from parallel.ParSeq[T]

Inherited from ParSeqLike[T, ParSeq[T], immutable.Seq[T]]

Inherited from parallel.ParIterable[T]

Inherited from ParIterableLike[T, ParSeq[T], immutable.Seq[T]]

Inherited from Parallel

Inherited from CustomParallelizable[T, ParSeq[T]]

Inherited from GenericParTemplate[T, ParSeq]

Inherited from HasNewCombiner[T, scala.collection.parallel.immutable.ParSeq[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from GenSeq[T]

Inherited from GenIterable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, ParSeq]

Inherited from HasNewBuilder[T, scala.collection.parallel.immutable.ParSeq[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from GenSeqLike[T, ParSeq[T]]

Inherited from Equals

Inherited from GenIterableLike[T, ParSeq[T]]

Inherited from GenTraversableLike[T, ParSeq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped