ParSeq

Companion object ParSeq

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

A template trait for parallel sequences.

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.

The higher-order functions passed to certain operations may contain side-effects. Since implementations of bulk operations may not be sequential, this means that side-effects may not be predictable and may produce data-races, deadlocks or invalidation of state if care is not taken. It is up to the programmer to either avoid using side-effects or to use some form of synchronization when accessing mutable data.

T: the type of the elements in this parallel sequence

Linear Supertypes

ParSeqLike[T, ParSeq[T], scala.Seq[T]], ParIterable[T], ParIterableLike[T, ParSeq[T], scala.Seq[T]], Parallel, CustomParallelizable[T, ParSeq[T]], Parallelizable[T, ParSeq[T]], GenericParTemplate[T, ParSeq], HasNewCombiner[T, scala.collection.parallel.ParSeq[T] @scala.annotation.unchecked.uncheckedVariance], GenSeq[T], GenIterable[T], GenTraversable[T], GenericTraversableTemplate[T, ParSeq], HasNewBuilder[T, scala.collection.parallel.ParSeq[T] @scala.annotation.unchecked.uncheckedVariance], GenSeqLike[T, ParSeq[T]], Equals, GenIterableLike[T, ParSeq[T]], GenTraversableLike[T, ParSeq[T]], GenTraversableOnce[T], AnyRef, Any

Known Subclasses

ParRange, ParSeq, ParVector, ParArray, ParSeq

Ordering

Alphabetic
By Inheritance

Inherited

ParSeq
ParSeqLike
ParIterable
ParIterableLike
Parallel
CustomParallelizable
Parallelizable
GenericParTemplate
HasNewCombiner
GenSeq
GenIterable
GenTraversable
GenericTraversableTemplate
HasNewBuilder
GenSeqLike
Equals
GenIterableLike
GenTraversableLike
GenTraversableOnce
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Type Members

class Aggregate [S] extends Accessor[S, Aggregate[S]]

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
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
class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

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

Attributes
protected[this]
Definition Classes
ParIterableLike
class Count extends Accessor[Int, Count]

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
class Exists extends Accessor[Boolean, Exists]

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

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

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

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

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

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

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

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]

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

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

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
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
class Partition [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

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

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
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
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
trait ScanTree [U >: T] extends AnyRef

Attributes
protected[this]
Definition Classes
ParIterableLike
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
trait SignallingOps [PI <: DelegatedSignalling] extends AnyRef

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

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

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

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

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

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

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

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

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

Attributes
protected[this]
Definition Classes
ParIterableLike
type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

Definition Classes
ParIterableLike
type SuperParIterator = IterableSplitter[T]

Attributes
protected[this]
Definition Classes
ParSeqLike
trait Accessor [R, Tp] extends ParSeqLike.Accessor[R, Tp]

Attributes
protected
Definition Classes
ParSeqLike
class Corresponds [S] extends Accessor[Boolean, Corresponds[S]]

Attributes
protected[this]
Definition Classes
ParSeqLike
abstract class Elements extends SeqSplitter[T] with scala.BufferedIterator[T]
Used to iterate elements using indices
Used to iterate elements using indices

Attributes
protected
Definition Classes
ParSeqLike
class IndexWhere extends Accessor[Int, IndexWhere]

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

Attributes
protected[this]
Definition Classes
ParSeqLike
class Reverse [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

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

Attributes
protected[this]
Definition Classes
ParSeqLike
class SameElements [U >: T] extends Accessor[Boolean, SameElements[U]]

Attributes
protected[this]
Definition Classes
ParSeqLike
class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

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

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

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

Attributes
protected[this]
Definition Classes
ParSeqLike

Abstract Value Members

abstract def apply(i: Int): T

Definition Classes
ParSeq → GenSeqLike
abstract def length: Int

Definition Classes
GenSeqLike
abstract def seq: scala.Seq[T]

Definition Classes
ParIterableLike → Parallelizable → GenTraversableOnce
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

Concrete Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

Definition Classes
ParIterableLike → GenTraversableLike
def +:[U >: T, That](elem: U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

Definition Classes
ParSeqLike → GenSeqLike
def /:[S](z: S)(op: (S, T) ⇒ S): S

Definition Classes
ParIterableLike → GenTraversableOnce
def :+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[ParSeq[T], U, That]): That

Definition Classes
ParSeqLike → GenSeqLike
def :\[S](z: S)(op: (T, S) ⇒ S): S

Definition Classes
ParIterableLike → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
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
final def asInstanceOf[T0]: T0

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

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

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

Definition Classes
ParIterableLike
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[S, That](pf: PartialFunction[T, S])(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

Definition Classes
ParIterableLike → GenTraversableLike
def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]

Attributes
protected[this]
Definition Classes
ParIterableLike
def combinerFactory: CombinerFactory[T, ParSeq[T]]
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
def companion: GenericCompanion[ParSeq] with GenericParCompanion[ParSeq]

Definition Classes
ParSeq → ParIterable → GenericParTemplate → GenSeq → GenIterable → GenTraversable → GenericTraversableTemplate
def copyToArray[U >: T](xs: Array[U], start: Int, len: Int): Unit

Definition Classes
ParIterableLike → GenTraversableOnce
def copyToArray[U >: T](xs: Array[U], start: Int): Unit

Definition Classes
ParIterableLike → GenTraversableOnce
def copyToArray[U >: T](xs: Array[U]): Unit

Definition Classes
ParIterableLike → GenTraversableOnce
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
def count(p: (T) ⇒ Boolean): Int

Definition Classes
ParIterableLike → GenTraversableOnce
def debugBuffer: ArrayBuffer[String]

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

Attributes
protected
Definition Classes
ParIterableLike
def diff[U >: T](that: GenSeq[U]): ParSeq[T]

Definition Classes
ParSeqLike → GenSeqLike
def distinct: ParSeq[T]
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
def down(p: IterableSplitter[_]): SeqSplitter[T]

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

Definition Classes
ParIterableLike → GenTraversableLike
def dropWhile(pred: (T) ⇒ Boolean): ParSeq[T]
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
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
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
GenSeqLike → Equals → Any
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
def filter(pred: (T) ⇒ Boolean): ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
def filterNot(pred: (T) ⇒ Boolean): ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
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
def flatMap[S, That](f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

Definition Classes
ParIterableLike → GenTraversableLike
def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSeq[B]

Definition Classes
GenericTraversableTemplate
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
def foldLeft[S](z: S)(op: (S, T) ⇒ S): S

Definition Classes
ParIterableLike → GenTraversableOnce
def foldRight[S](z: S)(op: (T, S) ⇒ S): S

Definition Classes
ParIterableLike → GenTraversableOnce
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
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
def genericBuilder[B]: Combiner[B, ParSeq[B]]

Definition Classes
GenericParTemplate → GenericTraversableTemplate
def genericCombiner[B]: Combiner[B, ParSeq[B]]

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

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

Definition Classes
ParIterableLike → GenTraversableLike
def hasDefiniteSize: Boolean

Definition Classes
ParIterableLike → GenTraversableOnce
def hashCode(): Int

Definition Classes
GenSeqLike → Any
def head: T

Definition Classes
ParIterableLike → GenTraversableLike
def headOption: Option[T]

Definition Classes
ParIterableLike → GenTraversableLike
def indexOf[B >: T](elem: B, from: Int): Int

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

Definition Classes
GenSeqLike
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
def indexWhere(p: (T) ⇒ Boolean): Int

Definition Classes
GenSeqLike
def init: ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
def initTaskSupport(): Unit

Attributes
protected
Definition Classes
ParIterableLike
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]): ParSeq[T]
def isDefinedAt(idx: Int): Boolean

Definition Classes
GenSeqLike
def isEmpty: Boolean

Definition Classes
ParIterableLike → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
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
final def isTraversableAgain: Boolean

Definition Classes
ParIterableLike → GenTraversableLike → GenTraversableOnce
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
def last: T

Definition Classes
ParIterableLike → GenTraversableLike
def lastIndexOf[B >: T](elem: B, end: Int): Int

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

Definition Classes
GenSeqLike
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
def lastIndexWhere(p: (T) ⇒ Boolean): Int

Definition Classes
GenSeqLike
def lastOption: Option[T]

Definition Classes
ParIterableLike → GenTraversableLike
def map[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

Definition Classes
ParIterableLike → GenTraversableLike
def max[U >: T](implicit ord: Ordering[U]): T

Definition Classes
ParIterableLike → GenTraversableOnce
def maxBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

Definition Classes
ParIterableLike → GenTraversableOnce
def min[U >: T](implicit ord: Ordering[U]): T

Definition Classes
ParIterableLike → GenTraversableOnce
def minBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

Definition Classes
ParIterableLike → GenTraversableOnce
def mkString: String

Definition Classes
ParIterableLike → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
ParIterableLike → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
ParIterableLike → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

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

Attributes
protected[this]
Definition Classes
GenericParTemplate → GenericTraversableTemplate → HasNewBuilder
def newCombiner: Combiner[T, ParSeq[T]]

Attributes
protected[this]
Definition Classes
GenericParTemplate → HasNewCombiner
def nonEmpty: Boolean

Definition Classes
ParIterableLike → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

Definition Classes
ParSeqLike → GenSeqLike
def par: ParSeq[T]
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
def parCombiner: Combiner[T, ParSeq[T]]
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
def partition(pred: (T) ⇒ Boolean): (ParSeq[T], ParSeq[T])

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

Definition Classes
ParSeqLike → GenSeqLike
def prefixLength(p: (T) ⇒ Boolean): Int

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

Definition Classes
ParIterableLike → GenTraversableOnce
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.
def reduceLeft[U >: T](op: (U, T) ⇒ U): U

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

Definition Classes
ParIterableLike → GenTraversableOnce
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
def reduceRight[U >: T](op: (T, U) ⇒ U): U

Definition Classes
ParIterableLike → GenTraversableOnce
def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]

Definition Classes
ParIterableLike → GenTraversableOnce
def repr: ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
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
def reverse: ParSeq[T]

Definition Classes
ParSeqLike → GenSeqLike
def reverseMap[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

Definition Classes
ParSeqLike → GenSeqLike
def sameElements[U >: T](that: GenIterable[U]): Boolean

Definition Classes
ParSeqLike → ParIterableLike → GenIterableLike
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[ParSeq[T], U, That]): That
def scanBlockSize: Int

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

Definition Classes
ParIterableLike → GenTraversableLike
def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParSeq[T], S, That]): That

Definition Classes
ParIterableLike → GenTraversableLike
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
def sequentially[S, That <: Parallel](b: (scala.Seq[T]) ⇒ scala.Seq[T]): ParSeq[T]

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

Definition Classes
ParSeqLike → GenTraversableLike → GenTraversableOnce
def sizeHintIfCheap: Int

Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce
def slice(unc_from: Int, unc_until: Int): ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
def span(pred: (T) ⇒ Boolean): (ParSeq[T], ParSeq[T])
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
def splitAt(n: Int): (ParSeq[T], ParSeq[T])

Definition Classes
ParIterableLike → GenTraversableLike
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
def startsWith[B](that: GenSeq[B]): Boolean

Definition Classes
GenSeqLike
def stringPrefix: String

Definition Classes
ParSeq → ParIterable → GenTraversableLike
def sum[U >: T](implicit num: Numeric[U]): U

Definition Classes
ParIterableLike → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
def take(n: Int): ParSeq[T]

Definition Classes
ParIterableLike → GenTraversableLike
def takeWhile(pred: (T) ⇒ Boolean): ParSeq[T]
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
implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

Attributes
protected
Definition Classes
ParIterableLike
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
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
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toArray[U >: T](implicit arg0: ClassTag[U]): Array[U]

Definition Classes
ParIterableLike → GenTraversableOnce
def toBuffer[U >: T]: Buffer[U]

Definition Classes
ParIterableLike → GenTraversableOnce
def toIndexedSeq: immutable.IndexedSeq[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toIterable: ParIterable[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toIterator: scala.Iterator[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toList: List[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.ParMap[K, V]

Definition Classes
ParIterableLike → GenTraversableOnce
def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That

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

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

Definition Classes
ParSeqLike → ParIterableLike → GenSeqLike → GenTraversableOnce
def toSet[U >: T]: immutable.ParSet[U]

Definition Classes
ParIterableLike → GenTraversableOnce
def toStream: Stream[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toString(): String

Definition Classes
ParSeq → ParSeqLike → ParIterableLike → AnyRef → Any
def toTraversable: GenTraversable[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def toVector: Vector[T]

Definition Classes
ParIterableLike → GenTraversableOnce
def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSeq[ParSeq[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ParSeq[T], B, That]): That

Definition Classes
GenSeqLike
def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParSeq[A1], ParSeq[A2])

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

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

Definition Classes
ParSeqLike → GenSeqLike
final def wait(): Unit

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

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

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

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

Attributes
protected
Definition Classes
ParIterableLike
def zip[U >: T, S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[ParSeq[T], (U, S), That]): That

Definition Classes
ParSeqLike → ParIterableLike → GenIterableLike
def zipAll[S, U >: T, That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[ParSeq[T], (U, S), That]): That

Definition Classes
ParIterableLike → GenIterableLike
def zipWithIndex[U >: T, That](implicit bf: CanBuildFrom[ParSeq[T], (U, Int), That]): That

Definition Classes
ParIterableLike → GenIterableLike

Packages

ParSeq

Companion object ParSeq

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

Type Members

Abstract Value Members

Concrete Value Members

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

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

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

Inherited from ParIterable[T]

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

Inherited from Parallel

Inherited from CustomParallelizable[T, ParSeq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from GenericParTemplate[T, ParSeq]

Inherited from HasNewCombiner[T, scala.collection.parallel.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.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 GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

ParSeq 

Companion object ParSeq

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

Type Members

Abstract Value Members

Concrete Value Members

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

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

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

Inherited from ParIterable[T]

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

Inherited from Parallel

Inherited from CustomParallelizable[T, ParSeq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from GenericParTemplate[T, ParSeq]

Inherited from HasNewCombiner[T, scala.collection.parallel.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.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 GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped

ParSeq