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

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

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

T

the type of the elements contained in this collection

Repr

the type of the actual collection containing the elements

Sequential

the type of the sequential version of this parallel collection

Self Type
ParSeqLike[T, Repr, Sequential]
Linear Supertypes
ParIterableLike[T, Repr, Sequential], HasNewCombiner[T, Repr], Parallel, CustomParallelizable[T, Repr], Parallelizable[T, Repr], GenSeqLike[T, Repr], Equals, GenIterableLike[T, Repr], GenTraversableLike[T, Repr], GenTraversableOnce[T], AnyRef, Any
Known Subclasses
ParSeq, ParRange, ParSeq, ParVector, ParArray, ParSeq
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParSeqLike
  2. ParIterableLike
  3. HasNewCombiner
  4. Parallel
  5. CustomParallelizable
  6. Parallelizable
  7. GenSeqLike
  8. Equals
  9. GenIterableLike
  10. GenTraversableLike
  11. GenTraversableOnce
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class Aggregate [S] extends Accessor[S, Aggregate[S]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  2. trait BuilderOps [Elem, To] extends AnyRef
    Definition Classes
    ParIterableLike
  3. class Collect [S, That] extends Transformer[Combiner[S, That], Collect[S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  4. abstract class Composite [FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  5. class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  6. class CopyToArray [U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  7. class Count extends Accessor[Int, Count]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  8. class CreateScanTree [U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  9. class Drop [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  10. class Exists extends Accessor[Boolean, Exists]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  11. class Filter [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  12. class FilterNot [U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  13. class Find [U >: T] extends Accessor[Option[U], Find[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  14. class FlatMap [S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  15. class Fold [U >: T] extends Accessor[U, Fold[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  16. class Forall extends Accessor[Boolean, Forall]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. class Foreach [S] extends Accessor[Unit, Foreach[S]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  18. class FromScanTree [U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  19. class GroupBy [K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  20. class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  21. class Max [U >: T] extends Accessor[Option[U], Max[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. class Min [U >: T] extends Accessor[Option[U], Min[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  23. trait NonDivisible [R] extends NonDivisibleTask[R, NonDivisible[R]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  24. trait NonDivisibleTask [R, Tp] extends StrictSplitterCheckTask[R, Tp]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  25. abstract class ParComposite [FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    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
  26. class Partition [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  27. class Product [U >: T] extends Accessor[U, Product[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  28. class Reduce [U >: T] extends Accessor[Option[U], Reduce[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  29. abstract class ResultMapping [R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  30. 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
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  31. case class ScanNode [U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  32. trait ScanTree [U >: T] extends AnyRef
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  33. abstract class SeqComposite [FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Sequentially performs one task after another.

    Sequentially performs one task after another.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  34. trait SignallingOps [PI <: DelegatedSignalling] extends AnyRef
    Definition Classes
    ParIterableLike
  35. class Slice [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  36. class Span [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  37. class SplitAt [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  38. trait StrictSplitterCheckTask [R, Tp] extends Task[R, Tp]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  39. class Sum [U >: T] extends Accessor[U, Sum[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  40. class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  41. class TakeWhile [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  42. trait TaskOps [R, Tp] extends AnyRef
    Definition Classes
    ParIterableLike
  43. class ToParCollection [U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  44. class ToParMap [K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  45. class ZipAll [U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  46. trait Accessor [R, Tp] extends ParSeqLike.Accessor[R, Tp]
    Attributes
    protected
  47. class Corresponds [S] extends Accessor[Boolean, Corresponds[S]]
    Attributes
    protected[this]
  48. abstract class Elements extends SeqSplitter[T] with scala.BufferedIterator[T]

    Used to iterate elements using indices

    Used to iterate elements using indices

    Attributes
    protected
  49. class IndexWhere extends Accessor[Int, IndexWhere]
    Attributes
    protected[this]
  50. class LastIndexWhere extends Accessor[Int, LastIndexWhere]
    Attributes
    protected[this]
  51. class Reverse [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]
    Attributes
    protected[this]
  52. class ReverseMap [S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]
    Attributes
    protected[this]
  53. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]
    Definition Classes
    ParIterableLike
  54. class SameElements [U >: T] extends Accessor[Boolean, SameElements[U]]
    Attributes
    protected[this]
  55. class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]
    Attributes
    protected[this]
  56. type SuperParIterator = IterableSplitter[T]
    Attributes
    protected[this]
  57. trait Transformer [R, Tp] extends Accessor[R, Tp] with ParSeqLike.Transformer[R, Tp]
    Attributes
    protected
  58. class Updated [U >: T, That] extends Transformer[Combiner[U, That], Updated[U, That]]
    Attributes
    protected[this]
  59. class Zip [U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]
    Attributes
    protected[this]

Abstract Value Members

  1. abstract def apply(idx: Int): T
    Definition Classes
    GenSeqLike
  2. abstract def length: Int
    Definition Classes
    GenSeqLike
  3. abstract def newCombiner: Combiner[T, Repr]
    Attributes
    protected[this]
    Definition Classes
    HasNewCombiner
  4. abstract def seq: Sequential
    Definition Classes
    ParIterableLike → Parallelizable → GenTraversableOnce
  5. abstract def splitter: SeqSplitter[T]

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

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

    returns

    an iterator that can be split into subsets of precise size

    Attributes
    protected[scala.collection.parallel]
    Definition Classes
    ParSeqLike → ParIterableLike
  6. abstract def stringPrefix: String
    Definition Classes
    GenTraversableLike

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  4. def +:[U >: T, That](elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParSeqLike → GenSeqLike
  5. def /:[S](z: S)(op: (S, T) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  6. def :+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParSeqLike → GenSeqLike
  7. def :\[S](z: S)(op: (T, S) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the 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
    ParIterableLike → GenTraversableOnce
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def bf2seq[S, That](bf: CanBuildFrom[Repr, S, That]): CanBuildFrom[Sequential, S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  12. implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  13. def canEqual(other: Any): Boolean
    Definition Classes
    ParIterableLike
  14. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  15. def collect[S, That](pf: PartialFunction[T, S])(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  16. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. def combinerFactory: CombinerFactory[T, Repr]

    Creates a combiner factory.

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  18. def copyToArray[U >: T](xs: Array[U], start: Int, len: Int): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  19. def copyToArray[U >: T](xs: Array[U], start: Int): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  20. def copyToArray[U >: T](xs: Array[U]): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  21. def corresponds[S](that: GenSeq[S])(p: (T, S) ⇒ Boolean): Boolean

    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
    ParSeqLike → GenSeqLike
  22. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    ParIterableLike → GenTraversableOnce
  23. def debugBuffer: ArrayBuffer[String]
    Definition Classes
    ParIterableLike
  24. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  25. def diff[U >: T](that: GenSeq[U]): Repr
    Definition Classes
    ParSeqLike → GenSeqLike
  26. def distinct: Repr

    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.

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

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  27. def down(p: IterableSplitter[_]): SeqSplitter[T]
    Attributes
    protected[this]
  28. def drop(n: Int): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  29. def dropWhile(pred: (T) ⇒ Boolean): Repr

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

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

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

    pred

    the predicate used to test the elements

    returns

    a collection composed of all the elements after the longest prefix of elements in this parallel iterable that satisfy the predicate pred

    Definition Classes
    ParIterableLike → GenTraversableLike
  30. def endsWith[S](that: GenSeq[S]): Boolean

    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
    ParSeqLike → GenSeqLike
  31. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  33. def exists(p: (T) ⇒ Boolean): Boolean

    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
    ParIterableLike → GenTraversableOnce
  34. def filter(pred: (T) ⇒ Boolean): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  35. def filterNot(pred: (T) ⇒ Boolean): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  36. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  37. def find(p: (T) ⇒ Boolean): Option[T]

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

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

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

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

    p

    predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLike → GenTraversableOnce
  38. def flatMap[S, That](f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  39. def fold[U >: T](z: U)(op: (U, U) ⇒ U): U

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

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

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

    U

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    Definition Classes
    ParIterableLike → GenTraversableOnce
  40. def foldLeft[S](z: S)(op: (S, T) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  41. def foldRight[S](z: S)(op: (T, S) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  42. def forall(p: (T) ⇒ Boolean): Boolean

    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
    ParIterableLike → GenTraversableOnce
  43. def foreach[U](f: (T) ⇒ U): Unit

    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
    ParIterableLike → GenTraversableLike → GenTraversableOnce
  44. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  45. def groupBy[K](f: (T) ⇒ K): immutable.ParMap[K, Repr]
    Definition Classes
    ParIterableLike → GenTraversableLike
  46. def hasDefiniteSize: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  47. def hashCode(): Int
    Definition Classes
    GenSeqLike → Any
  48. def head: T
    Definition Classes
    ParIterableLike → GenTraversableLike
  49. def headOption: Option[T]
    Definition Classes
    ParIterableLike → GenTraversableLike
  50. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  51. def indexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  52. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    Finds the first element satisfying some predicate.

    Finds the first element satisfying some predicate.

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  53. def indexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  54. def init: Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  55. def initTaskSupport(): Unit
    Attributes
    protected
    Definition Classes
    ParIterableLike
  56. def intersect(that: scala.Seq[T]): ParIterable[T]

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

    [use case]

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
    Full Signature

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

  57. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  58. def isEmpty: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  59. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  60. def isStrictSplitterCollection: Boolean

    Denotes whether this parallel collection has strict splitters.

    Denotes whether this parallel collection has strict splitters.

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

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

    Definition Classes
    ParIterableLike
  61. final def isTraversableAgain: Boolean
    Definition Classes
    ParIterableLike → GenTraversableLike → GenTraversableOnce
  62. def iterator: PreciseSplitter[T]

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

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

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

    returns

    a split iterator

    Definition Classes
    ParSeqLike → ParIterableLike → GenIterableLike
  63. def last: T
    Definition Classes
    ParIterableLike → GenTraversableLike
  64. def lastIndexOf[B >: T](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  65. def lastIndexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  66. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    Finds the last element satisfying some predicate.

    Finds the last element satisfying some predicate.

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

    The index flag is initially set to minimum integer value.

    p

    the predicate used to test the elements

    end

    the maximum offset for the search

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  67. def lastIndexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  68. def lastOption: Option[T]
    Definition Classes
    ParIterableLike → GenTraversableLike
  69. def map[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  70. def max[U >: T](implicit ord: Ordering[U]): T
    Definition Classes
    ParIterableLike → GenTraversableOnce
  71. def maxBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T
    Definition Classes
    ParIterableLike → GenTraversableOnce
  72. def min[U >: T](implicit ord: Ordering[U]): T
    Definition Classes
    ParIterableLike → GenTraversableOnce
  73. def minBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T
    Definition Classes
    ParIterableLike → GenTraversableOnce
  74. def mkString: String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  75. def mkString(sep: String): String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  76. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  77. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  78. def nonEmpty: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  79. final def notify(): Unit
    Definition Classes
    AnyRef
  80. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  81. def padTo[U >: T, That](len: Int, elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParSeqLike → GenSeqLike
  82. def par: Repr

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

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

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

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    ParIterableLike → CustomParallelizable → Parallelizable
  83. def parCombiner: Combiner[T, Repr]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable
  84. def partition(pred: (T) ⇒ Boolean): (Repr, Repr)
    Definition Classes
    ParIterableLike → GenTraversableLike
  85. def patch[U >: T, That](from: Int, patch: GenSeq[U], replaced: Int)(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParSeqLike → GenSeqLike
  86. def prefixLength(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  87. def product[U >: T](implicit num: Numeric[U]): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  88. def reduce[U >: T](op: (U, U) ⇒ U): U

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the collection is nonempty.

    Definition Classes
    ParIterableLike → GenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

  89. def reduceLeft[U >: T](op: (U, T) ⇒ U): U
    Definition Classes
    ParIterableLike
  90. def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  91. def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    ParIterableLike → GenTraversableOnce
  92. def reduceRight[U >: T](op: (T, U) ⇒ U): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  93. def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  94. def repr: Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  95. def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Optionally reuses an existing combiner for better performance.

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

    oldc

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

    newc

    The new, empty combiner that can be used.

    returns

    Either newc or oldc.

    Attributes
    protected
    Definition Classes
    ParIterableLike
  96. def reverse: Repr
    Definition Classes
    ParSeqLike → GenSeqLike
  97. def reverseMap[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParSeqLike → GenSeqLike
  98. def sameElements[U >: T](that: GenIterable[U]): Boolean
    Definition Classes
    ParSeqLike → ParIterableLike → GenIterableLike
  99. def scan(z: T)(op: (T, T) ⇒ T): ParIterable[T]

    [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 parallel iterable containing the prefix scan of the elements in this parallel iterable

    Definition Classes
    ParIterableLike → GenTraversableLike
    Full Signature

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

  100. def scanBlockSize: Int
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  101. def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  102. def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  103. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

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

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

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  104. def sequentially[S, That <: Parallel](b: (Sequential) ⇒ Sequential): Repr
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  105. def size: Int
    Definition Classes
    ParSeqLike → GenTraversableLike → GenTraversableOnce
  106. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  107. def slice(unc_from: Int, unc_until: Int): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  108. def span(pred: (T) ⇒ Boolean): (Repr, Repr)

    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
    ParIterableLike → GenTraversableLike
  109. def splitAt(n: Int): (Repr, Repr)
    Definition Classes
    ParIterableLike → GenTraversableLike
  110. def startsWith[S](that: GenSeq[S], offset: Int): Boolean

    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
    ParSeqLike → GenSeqLike
  111. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  112. def sum[U >: T](implicit num: Numeric[U]): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  113. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  114. def tail: Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  115. def take(n: Int): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  116. def takeWhile(pred: (T) ⇒ Boolean): Repr

    Takes the longest prefix of elements that satisfy the predicate.

    Takes the longest prefix of elements that satisfy the predicate.

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

    pred

    the predicate used to test the elements

    returns

    the longest prefix of this parallel iterable of elements that satisfy the predicate pred

    Definition Classes
    ParIterableLike → GenTraversableLike
  117. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  118. def tasksupport: TaskSupport

    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

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

    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 java.util.concurrent.ForkJoinPool(2))
    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  120. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  121. def toArray[U >: T](implicit arg0: ClassTag[U]): Array[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  122. def toBuffer[U >: T]: Buffer[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  123. def toIndexedSeq: immutable.IndexedSeq[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  124. def toIterable: ParIterable[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  125. def toIterator: scala.Iterator[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  126. def toList: List[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  127. def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.ParMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  128. def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  129. def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  130. def toSeq: ParSeq[T]
    Definition Classes
    ParSeqLike → ParIterableLike → GenSeqLike → GenTraversableOnce
  131. def toSet[U >: T]: immutable.ParSet[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  132. def toStream: Stream[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  133. def toString(): String
    Definition Classes
    ParSeqLike → ParIterableLike → AnyRef → Any
  134. def toTraversable: GenTraversable[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  135. def toVector: Vector[T]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  136. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
    Definition Classes
    GenSeqLike
  137. def updated[U >: T, That](index: Int, elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParSeqLike → GenSeqLike
  138. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  139. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  140. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  141. def withFilter(pred: (T) ⇒ Boolean): Repr
    Definition Classes
    ParIterableLike
  142. def wrap[R](body: ⇒ R): NonDivisible[R]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  143. def zip[U >: T, S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[Repr, (U, S), That]): That
    Definition Classes
    ParSeqLike → ParIterableLike → GenIterableLike
  144. def zipAll[S, U >: T, That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[Repr, (U, S), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike
  145. def zipWithIndex[U >: T, That](implicit bf: CanBuildFrom[Repr, (U, Int), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike

Inherited from ParIterableLike[T, Repr, Sequential]

Inherited from HasNewCombiner[T, Repr]

Inherited from Parallel

Inherited from CustomParallelizable[T, Repr]

Inherited from Parallelizable[T, Repr]

Inherited from GenSeqLike[T, Repr]

Inherited from Equals

Inherited from GenIterableLike[T, Repr]

Inherited from GenTraversableLike[T, Repr]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped