scala.collection.parallel.ParSeqLike

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.

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

• T
  • the type of the elements contained in this collection
• Repr
  • the type of the actual collection containing the elements
• Sequential
  • the type of the sequential version of this parallel collection
• Self Type
  • ParSeqLike [T, Repr, Sequential]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

Type Members

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

• Attributes
  • protected
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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 Corresponds[S] extends Accessor[Boolean, Corresponds[S]]

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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

abstract class Elements extends SeqSplitter[T] with scala.BufferedIterator[T]

Used to iterate elements using indices

• Attributes
  • protected
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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 IndexWhere extends Accessor[Int, IndexWhere]

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

class LastIndexWhere extends Accessor[Int, LastIndexWhere]

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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.

• 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

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

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

class ReverseMap[S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

• Definition Classes
  • ParIterableLike

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

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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

class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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.

• 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

type SuperParIterator = IterableSplitter[T]

• Attributes
  • protected[this]

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

trait Transformer[R, Tp] extends Accessor[R, Tp] with ParSeqLike.Transformer[R, Tp]

• Attributes
  • protected
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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

• Attributes
  • protected[this]
• Source
  • ParSeqLike.scala - Blame
  • ParSeqLike.scala - History

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

• Attributes
  • protected[this]
• Definition Classes
  • ParIterableLike

Concrete Value Members From scala.collection.CustomParallelizable

def parCombiner: Combiner[T, Repr]

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

(defined at scala.collection.CustomParallelizable)

Abstract Value Members From scala.collection.GenSeqLike

abstract def apply(idx: Int): T

Selects an element by its index in the general sequence.

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

• idx
  • The index to select.
• returns
  • the element of this general sequence at index idx , where 0 indicates the first element.
• Definition Classes
  • GenSeqLike
• Exceptions thrown
  • IndexOutOfBoundsException if idx does not satisfy 0 <= idx < length .

(defined at scala.collection.GenSeqLike)

Concrete Value Members From scala.collection.GenSeqLike

abstract def length: Int

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

(defined at scala.collection.GenSeqLike)

def equals(that: Any): Boolean

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

• that
  • The object to compare the sequence to
• returns
  • true if that is a sequence that has the same elements as this sequence in the same order, false otherwise
• Definition Classes
  • GenSeqLike → Equals → Any

(defined at scala.collection.GenSeqLike)

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

[use case]

Finds index of first occurrence of some value in this parallel iterable.

Note: may not terminate for infinite-sized collections.

• elem
  • the element value to search for.
• returns
  • the index of the first element of this parallel iterable that is equal (as determined by == ) to elem , or -1 , if none exists.
• Definition Classes
  • GenSeqLike

(defined at scala.collection.GenSeqLike)

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

[use case]

Finds index of first occurrence of some value in this parallel iterable 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 parallel iterable that is equal (as determined by == ) to elem , or -1 , if none exists.
• Definition Classes
  • GenSeqLike

(defined at scala.collection.GenSeqLike)

def indexWhere(p: (T) ⇒ Boolean): Int

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

(defined at scala.collection.GenSeqLike)

def isDefinedAt(idx: Int): Boolean

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

(defined at scala.collection.GenSeqLike)

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

[use case]

Finds index of last occurrence of some value in this parallel iterable.

Note: will not terminate for infinite-sized collections.

• elem
  • the element value to search for.
• returns
  • the index of the last element of this parallel iterable that is equal (as determined by == ) to elem , or -1 , if none exists.
• Definition Classes
  • GenSeqLike

(defined at scala.collection.GenSeqLike)

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

[use case]

Finds index of last occurrence of some value in this parallel iterable 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 parallel iterable that is equal (as determined by == ) to elem , or -1 , if none exists.
• Definition Classes
  • GenSeqLike

(defined at scala.collection.GenSeqLike)

def lastIndexWhere(p: (T) ⇒ Boolean): Int

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

(defined at scala.collection.GenSeqLike)

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

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

(defined at scala.collection.GenSeqLike)

def startsWith[B](that: GenSeq[B]): Boolean

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

(defined at scala.collection.GenSeqLike)

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

[use case]

Produces a new sequence which contains all elements of this parallel iterable 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 parallel iterable which contains all elements of this parallel iterable followed by all elements of that .
• Definition Classes
  • GenSeqLike

(defined at scala.collection.GenSeqLike)

Abstract Value Members From scala.collection.generic.HasNewCombiner

abstract def newCombiner: Combiner[T, Repr]

• Attributes
  • protected[this]
• Definition Classes
  • HasNewCombiner

(defined at scala.collection.generic.HasNewCombiner)

Concrete Value Members From scala.collection.parallel.ParIterableLike

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

[use case]

Returns a new parallel iterable containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the parallel iterable 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 parallel iterable which contains all elements of this parallel iterable followed by all elements of that .
• Definition Classes
  • ParIterableLike → GenTraversableLike

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected[this]
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

def canEqual(other: Any): Boolean

• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

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

• B
  • the element type of the returned collection.
• pf
  • the partial function which filters and maps the parallel iterable.
• returns
  • a new parallel iterable resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
• Definition Classes
  • ParIterableLike → GenTraversableLike

(defined at scala.collection.parallel.ParIterableLike)

def combinerFactory: CombinerFactory[T, Repr]

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

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected[this]
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Copies the elements of this parallel iterable to an array. Fills the given array xs with values of this parallel iterable. Copying will stop once either the end of the current parallel iterable 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
  • ParIterableLike → GenTraversableOnce

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Copies the elements of this parallel iterable to an array. Fills the given array xs with values of this parallel iterable, beginning at index start . Copying will stop once either the end of the current parallel iterable 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
  • ParIterableLike → GenTraversableOnce

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Copies the elements of this parallel iterable to an array. Fills the given array xs with at most len elements of this parallel iterable, starting at position start . Copying will stop once either the end of the current parallel iterable 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
  • ParIterableLike → GenTraversableOnce

(defined at scala.collection.parallel.ParIterableLike)

def count(p: (T) ⇒ Boolean): Int

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

(defined at scala.collection.parallel.ParIterableLike)

def debugBuffer: ArrayBuffer[String]

• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

def drop(n: Int): Repr

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

(defined at scala.collection.parallel.ParIterableLike)

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.

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

(defined at scala.collection.parallel.ParIterableLike)

def exists(p: (T) ⇒ Boolean): Boolean

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

(defined at scala.collection.parallel.ParIterableLike)

def filter(pred: (T) ⇒ Boolean): Repr

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

(defined at scala.collection.parallel.ParIterableLike)

def filterNot(pred: (T) ⇒ Boolean): Repr

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

(defined at scala.collection.parallel.ParIterableLike)

def find(p: (T) ⇒ Boolean): Option[T]

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

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Builds a new collection by applying a function to all elements of this parallel iterable 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 parallel iterable. 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 parallel iterable resulting from applying the given collection-valued function f to each element of this parallel iterable and concatenating the results.
• Definition Classes
  • ParIterableLike → GenTraversableLike

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

def forall(p: (T) ⇒ Boolean): Boolean

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

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

• B
  • the element type of the returned collection.
• f
  • the function to apply to each element.
• returns
  • a new parallel iterable resulting from applying the given function f to each element of this parallel iterable and collecting the results.
• Definition Classes
  • ParIterableLike → GenTraversableLike

(defined at scala.collection.parallel.ParIterableLike)

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

[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 parallel iterable with the largest value measured by function f.
• Definition Classes
  • ParIterableLike → GenTraversableOnce

(defined at scala.collection.parallel.ParIterableLike)

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

[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 parallel iterable with the smallest value measured by function f.
• Definition Classes
  • ParIterableLike → GenTraversableOnce

(defined at scala.collection.parallel.ParIterableLike)

def mkString(sep: String): 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
  • ParIterableLike → GenTraversableOnce

Example:

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

Example:

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

(defined at scala.collection.parallel.ParIterableLike)

def partition(pred: (T) ⇒ Boolean): (Repr, Repr)

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

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
  • ParIterableLike → GenTraversableOnce
• Exceptions thrown
  • UnsupportedOperationException if this parallel iterable is empty.

(defined at scala.collection.parallel.ParIterableLike)

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

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.

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

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

[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

(defined at scala.collection.parallel.ParIterableLike)

def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That

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

(defined at scala.collection.parallel.ParIterableLike)

def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That

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

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected[this]
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

def slice(unc_from: Int, unc_until: Int): Repr

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

(defined at scala.collection.parallel.ParIterableLike)

def span(pred: (T) ⇒ Boolean): (Repr, Repr)

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

(defined at scala.collection.parallel.ParIterableLike)

def splitAt(n: Int): (Repr, Repr)

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

(defined at scala.collection.parallel.ParIterableLike)

def take(n: Int): Repr

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

(defined at scala.collection.parallel.ParIterableLike)

def takeWhile(pred: (T) ⇒ Boolean): Repr

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

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

def tasksupport: TaskSupport

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

• Definition Classes
  • ParIterableLike
• See also
  • scala.collection.parallel.TaskSupport

(defined at scala.collection.parallel.ParIterableLike)

def tasksupport_=(ts: TaskSupport): Unit

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

(defined at scala.collection.parallel.ParIterableLike)

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

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

(defined at scala.collection.parallel.ParIterableLike)

def toIndexedSeq: immutable.IndexedSeq[T]

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

(defined at scala.collection.parallel.ParIterableLike)

def toIterable: ParIterable[T]

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

(defined at scala.collection.parallel.ParIterableLike)

def toIterator: scala.Iterator[T]

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

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Converts this parallel iterable 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 parallel iterable.
• Definition Classes
  • ParIterableLike → GenTraversableOnce

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

• Attributes
  • protected
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

def toSet[U >: T]: immutable.ParSet[U]

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

(defined at scala.collection.parallel.ParIterableLike)

def toTraversable: GenTraversable[T]

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

(defined at scala.collection.parallel.ParIterableLike)

def withFilter(pred: (T) ⇒ Boolean): Repr

• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

def wrap[R](body: ⇒ R): NonDivisible[R]

• Attributes
  • protected
• Definition Classes
  • ParIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Returns a parallel iterable formed from this parallel iterable 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 parallel iterable is shorter than that .
• thatElem
  • the element to be used to fill up the result if that is shorter than this parallel iterable.
• returns
  • a new parallel iterable containing pairs consisting of corresponding elements of this parallel iterable and that . The length of the returned collection is the maximum of the lengths of this parallel iterable and that . If this parallel iterable is shorter than that , thisElem values are used to pad the result. If that is shorter than this parallel iterable, thatElem values are used to pad the result.
• Definition Classes
  • ParIterableLike → GenIterableLike

(defined at scala.collection.parallel.ParIterableLike)

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

[use case]

Zips this parallel iterable with its indices.

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

• returns
  • A new parallel iterable containing pairs consisting of all elements of this parallel iterable paired with their index. Indices start at 0 .
• Definition Classes
  • ParIterableLike → GenIterableLike

Example:

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

(defined at scala.collection.parallel.ParIterableLike)

Abstract Value Members From scala.collection.parallel.ParSeqLike

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.

• returns
  • an iterator that can be split into subsets of precise size
• Attributes
  • protected[scala.collection.parallel]
• Definition Classes
  • ParSeqLike → ParIterableLike

(defined at scala.collection.parallel.ParSeqLike)

Concrete Value Members From scala.collection.parallel.ParSeqLike

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

[use case]

A copy of the parallel iterable 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 parallel iterable 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 parallel iterable consisting of elem followed by all elements of this parallel iterable.
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

A copy of this parallel iterable 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 parallel iterable consisting of all elements of this parallel iterable followed by elem .
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

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.

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

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

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

Note: will not terminate for infinite-sized collections.

• that
  • the sequence of elements to remove
• returns
  • a new parallel iterable which contains all elements of this parallel iterable except some of occurrences of elements that also appear in that . If an element value x appears n times in that , then the first n occurrences of x will not form part of the result, but any following occurrences will.
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

def down(p: IterableSplitter[_]): SeqSplitter[T]

• Attributes
  • protected[this]

(defined at scala.collection.parallel.ParSeqLike)

def endsWith[S](that: GenSeq[S]): Boolean

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

(defined at scala.collection.parallel.ParSeqLike)

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

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

(defined at scala.collection.parallel.ParSeqLike)

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

[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

(defined at scala.collection.parallel.ParSeqLike)

def iterator: PreciseSplitter[T]

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

(defined at scala.collection.parallel.ParSeqLike)

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

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

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

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

• len
  • the target length
• elem
  • the padding value
• returns
  • a new parallel iterable consisting of all elements of this parallel iterable followed by the minimal number of occurrences of elem so that the resulting parallel iterable has a length of at least len .
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

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

• from
  • the index of the first replaced element
• replaced
  • the number of elements to drop in the original parallel iterable
• returns
  • a new parallel iterable consisting of all elements of this parallel iterable except that replaced elements starting from from are replaced by patch .
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

Builds a new collection by applying a function to all elements of this parallel iterable 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 parallel iterable resulting from applying the given function f to each element of this parallel iterable and collecting the results in reversed order.
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

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

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
  • ParSeqLike → ParIterableLike → GenIterableLike

(defined at scala.collection.parallel.ParSeqLike)

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.

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

(defined at scala.collection.parallel.ParSeqLike)

def startsWith[S](that: GenSeq[S], offset: Int): Boolean

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

(defined at scala.collection.parallel.ParSeqLike)

def toSeq: ParSeq[T]

Converts this parallel iterable 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 parallel iterable.
• Definition Classes
  • ParSeqLike → ParIterableLike → GenSeqLike → GenTraversableOnce

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

A copy of this parallel iterable with one single replaced element.

• index
  • the position of the replacement
• elem
  • the replacing element
• returns
  • a copy of this parallel iterable with the element at position index replaced by elem .
• Definition Classes
  • ParSeqLike → GenSeqLike

(defined at scala.collection.parallel.ParSeqLike)

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

[use case]

Returns a parallel iterable formed from this parallel iterable 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 parallel iterable containing pairs consisting of corresponding elements of this parallel iterable and that . The length of the returned collection is the minimum of the lengths of this parallel iterable and that .
• Definition Classes
  • ParSeqLike → ParIterableLike → GenIterableLike

(defined at scala.collection.parallel.ParSeqLike)

Deprecated Value Members From scala.collection.parallel.ParSeqLike

def view: SeqView[T, Sequential]

• Definition Classes
  • ParSeqLike → ParIterableLike
• Annotations
  • @ deprecated
• Deprecated
  • (Since version 2.11.0) use.seq.view

(defined at scala.collection.parallel.ParSeqLike)

Concrete Value Members From Implicit scala.collection.parallel.CollectionsHaveToParArray ——————————————————————————–

def toParArray: ParArray[T]

• Implicit information
  • This member is added by an implicit conversion from ParSeqLike [T, Repr, Sequential] to CollectionsHaveToParArray [ParSeqLike [T, Repr, Sequential], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ParSeqLike [T, Repr, Sequential]) ⇒ GenTraversableOnce [T] is in scope.
• Definition Classes
  • CollectionsHaveToParArray (added by implicit convertion: scala.collection.parallel.CollectionsHaveToParArray)

Full Source:

/*                     __                                               *\
**     ________ ___   / /  ___     Scala API                            **
**    / __/ __// _ | / /  / _ |    (c) 2003-2013, LAMP/EPFL             **
**  __\ \/ /__/ __ |/ /__/ __ |    http://scala-lang.org/               **
** /____/\___/_/ |_/____/_/ | |                                         **
**                          |/                                          **
\*                                                                      */

package scala
package collection.parallel

import scala.collection.{ SeqLike, GenSeq, GenIterable, Iterator }
import scala.collection.generic.DefaultSignalling
import scala.collection.generic.AtomicIndexFlag
import scala.collection.generic.CanBuildFrom
import scala.collection.generic.VolatileAbort

import scala.collection.parallel.ParallelCollectionImplicits._

/** A template trait for sequences of type `ParSeq[T]`, representing
 *  parallel sequences with element type `T`.
 *
 *  $parallelseqinfo
 *
 *  @tparam T           the type of the elements contained in this collection
 *  @tparam Repr        the type of the actual collection containing the elements
 *  @tparam Sequential  the type of the sequential version of this parallel collection
 *
 *  @define parallelseqinfo
 *  Parallel sequences inherit the `Seq` trait. Their indexing and length computations
 *  are defined to be efficient. Like their sequential counterparts
 *  they always have a defined order of elements. This means they will produce resulting
 *  parallel sequences in the same way sequential sequences do. However, the order
 *  in which they perform bulk operations on elements to produce results is not defined and is generally
 *  nondeterministic. If the higher-order functions given to them produce no sideeffects,
 *  then this won't be noticeable.
 *
 *  This trait defines a new, more general `split` operation and reimplements the `split`
 *  operation of `ParallelIterable` trait using the new `split` operation.
 *
 *  @author Aleksandar Prokopec
 *  @since 2.9
 */
trait ParSeqLike[+T, +Repr <: ParSeq[T], +Sequential <: Seq[T] with SeqLike[T, Sequential]]
extends scala.collection.GenSeqLike[T, Repr]
   with ParIterableLike[T, Repr, Sequential] {
self =>

  protected[this] type SuperParIterator = IterableSplitter[T]

  /** A more refined version of the iterator found in the `ParallelIterable` trait,
   *  this iterator can be split into arbitrary subsets of iterators.
   *
   *  @return       an iterator that can be split into subsets of precise size
   */
  protected[parallel] def splitter: SeqSplitter[T]

  override def iterator: PreciseSplitter[T] = splitter

  override def size = length

  /** Used to iterate elements using indices */
  protected abstract class Elements(start: Int, val end: Int) extends SeqSplitter[T] with BufferedIterator[T] {
    private var i = start

    def hasNext = i < end

    def next(): T = if (i < end) {
      val x = self(i)
      i += 1
      x
    } else Iterator.empty.next()

    def head = self(i)

    final def remaining = end - i

    def dup = new Elements(i, end) {}

    def split = psplit(remaining / 2, remaining - remaining / 2)

    def psplit(sizes: Int*) = {
      val incr = sizes.scanLeft(0)(_ + _)
      for ((from, until) <- incr.init zip incr.tail) yield {
        new Elements(start + from, (start + until) min end) {}
      }
    }

    override def toString = "Elements(" + start + ", " + end + ")"
  }

  /* ParallelSeq methods */

  /** Returns the length of the longest segment of elements starting at
   *  a given position satisfying some predicate.
   *
   *  $indexsignalling
   *
   *  The index flag is initially set to maximum integer value.
   *
   *  @param p     the predicate used to test the elements
   *  @param from  the starting offset for the search
   *  @return      the length of the longest segment of elements starting at `from` and
   *               satisfying the predicate
   */
  def segmentLength(p: T => Boolean, from: Int): Int = if (from >= length) 0 else {
    val realfrom = if (from < 0) 0 else from
    val ctx = new DefaultSignalling with AtomicIndexFlag
    ctx.setIndexFlag(Int.MaxValue)
    tasksupport.executeAndWaitResult(new SegmentLength(p, 0, splitter.psplitWithSignalling(realfrom, length - realfrom)(1) assign ctx))._1
  }

  /** Finds the first element satisfying some predicate.
   *
   *  $indexsignalling
   *
   *  The index flag is initially set to maximum integer value.
   *
   *  @param p     the predicate used to test the elements
   *  @param from  the starting offset for the search
   *  @return      the index `>= from` of the first element of this $coll that satisfies the predicate `p`,
   *               or `-1`, if none exists
   */
  def indexWhere(p: T => Boolean, from: Int): Int = if (from >= length) -1 else {
    val realfrom = if (from < 0) 0 else from
    val ctx = new DefaultSignalling with AtomicIndexFlag
    ctx.setIndexFlag(Int.MaxValue)
    tasksupport.executeAndWaitResult(new IndexWhere(p, realfrom, splitter.psplitWithSignalling(realfrom, length - realfrom)(1) assign ctx))
  }

  /** Finds the last element satisfying some predicate.
   *
   *  $indexsignalling
   *
   *  The index flag is initially set to minimum integer value.
   *
   *  @param p     the predicate used to test the elements
   *  @param end   the maximum offset for the search
   *  @return      the index `<= end` of the first element of this $coll that satisfies the predicate `p`,
   *               or `-1`, if none exists
   */
  def lastIndexWhere(p: T => Boolean, end: Int): Int = if (end < 0) -1 else {
    val until = if (end >= length) length else end + 1
    val ctx = new DefaultSignalling with AtomicIndexFlag
    ctx.setIndexFlag(Int.MinValue)
    tasksupport.executeAndWaitResult(new LastIndexWhere(p, 0, splitter.psplitWithSignalling(until, length - until)(0) assign ctx))
  }

  def reverse: Repr = {
    tasksupport.executeAndWaitResult(new Reverse(() => newCombiner, splitter) mapResult { _.resultWithTaskSupport })
  }

  def reverseMap[S, That](f: T => S)(implicit bf: CanBuildFrom[Repr, S, That]): That = if (bf(repr).isCombiner) {
    tasksupport.executeAndWaitResult(
      new ReverseMap[S, That](f, () => bf(repr).asCombiner, splitter) mapResult { _.resultWithTaskSupport }
    )
  } else setTaskSupport(seq.reverseMap(f)(bf2seq(bf)), tasksupport)
  /*bf ifParallel { pbf =>
    tasksupport.executeAndWaitResult(new ReverseMap[S, That](f, pbf, splitter) mapResult { _.result })
  } otherwise seq.reverseMap(f)(bf2seq(bf))*/

  /** Tests whether this $coll contains the given sequence at a given index.
   *
   *  $abortsignalling
   *
   *  @tparam S      the element type of `that` parallel sequence
   *  @param that    the parallel sequence this sequence is being searched for
   *  @param offset  the starting offset for the search
   *  @return        `true` if there is a sequence `that` starting at `offset` in this sequence, `false` otherwise
   */
  def startsWith[S](that: GenSeq[S], offset: Int): Boolean = that ifParSeq { pthat =>
    if (offset < 0 || offset >= length) offset == length && pthat.length == 0
    else if (pthat.length == 0) true
    else if (pthat.length > length - offset) false
    else {
      val ctx = new DefaultSignalling with VolatileAbort
      tasksupport.executeAndWaitResult(
        new SameElements(splitter.psplitWithSignalling(offset, pthat.length)(1) assign ctx, pthat.splitter)
      )
    }
  } otherwise seq.startsWith(that, offset)

  override def sameElements[U >: T](that: GenIterable[U]): Boolean = that ifParSeq { pthat =>
    val ctx = new DefaultSignalling with VolatileAbort
    length == pthat.length && tasksupport.executeAndWaitResult(new SameElements(splitter assign ctx, pthat.splitter))
  } otherwise seq.sameElements(that)

  /** Tests whether this $coll ends with the given parallel sequence.
   *
   *  $abortsignalling
   *
   *  @tparam S       the type of the elements of `that` sequence
   *  @param that     the sequence to test
   *  @return         `true` if this $coll has `that` as a suffix, `false` otherwise
   */
  def endsWith[S](that: GenSeq[S]): Boolean = that ifParSeq { pthat =>
    if (that.length == 0) true
    else if (that.length > length) false
    else {
      val ctx = new DefaultSignalling with VolatileAbort
      val tlen = that.length
      tasksupport.executeAndWaitResult(new SameElements(splitter.psplitWithSignalling(length - tlen, tlen)(1) assign ctx, pthat.splitter))
    }
  } otherwise seq.endsWith(that)

  def patch[U >: T, That](from: Int, patch: GenSeq[U], replaced: Int)(implicit bf: CanBuildFrom[Repr, U, That]): That = {
    val realreplaced = replaced min (length - from)
    if (patch.isParSeq && bf(repr).isCombiner && (size - realreplaced + patch.size) > MIN_FOR_COPY) {
      val that = patch.asParSeq
      val pits = splitter.psplitWithSignalling(from, replaced, length - from - realreplaced)
      val cfactory = combinerFactory(() => bf(repr).asCombiner)
      val copystart = new Copy[U, That](cfactory, pits(0))
      val copymiddle = wrap {
        val tsk = new that.Copy[U, That](cfactory, that.splitter)
        tasksupport.executeAndWaitResult(tsk)
      }
      val copyend = new Copy[U, That](cfactory, pits(2))
      tasksupport.executeAndWaitResult(((copystart parallel copymiddle) { _ combine _ } parallel copyend) { _ combine _ } mapResult {
        _.resultWithTaskSupport
      })
    } else patch_sequential(from, patch.seq, replaced)
  }

  private def patch_sequential[U >: T, That](fromarg: Int, patch: Seq[U], r: Int)(implicit bf: CanBuildFrom[Repr, U, That]): That = {
    val from = 0 max fromarg
    val b = bf(repr)
    val repl = (r min (length - from)) max 0
    val pits = splitter.psplitWithSignalling(from, repl, length - from - repl)
    b ++= pits(0)
    b ++= patch
    b ++= pits(2)
    setTaskSupport(b.result(), tasksupport)
  }

  def updated[U >: T, That](index: Int, elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That = if (bf(repr).isCombiner) {
    tasksupport.executeAndWaitResult(
      new Updated(index, elem, combinerFactory(() => bf(repr).asCombiner), splitter) mapResult {
        _.resultWithTaskSupport
      }
    )
  } else setTaskSupport(seq.updated(index, elem)(bf2seq(bf)), tasksupport)
  /*bf ifParallel { pbf =>
    tasksupport.executeAndWaitResult(new Updated(index, elem, pbf, splitter) mapResult { _.result })
  } otherwise seq.updated(index, elem)(bf2seq(bf))*/

  def +:[U >: T, That](elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That = {
    patch(0, mutable.ParArray(elem), 0)
  }

  def :+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That = {
    patch(length, mutable.ParArray(elem), 0)
  }

  def padTo[U >: T, That](len: Int, elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That = if (length < len) {
    patch(length, new immutable.Repetition(elem, len - length), 0)
  } else patch(length, Nil, 0)

  override def zip[U >: T, S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[Repr, (U, S), That]): That = if (bf(repr).isCombiner && that.isParSeq) {
    val thatseq = that.asParSeq
    tasksupport.executeAndWaitResult(
      new Zip(length min thatseq.length, combinerFactory(() => bf(repr).asCombiner), splitter, thatseq.splitter) mapResult {
        _.resultWithTaskSupport
      }
    )
  } else super.zip(that)(bf)

  /** Tests whether every element of this $coll relates to the
   *  corresponding element of another parallel sequence by satisfying a test predicate.
   *
   *  $abortsignalling
   *
   *  @param   that    the other parallel sequence
   *  @param   p       the test predicate, which relates elements from both sequences
   *  @tparam  S       the type of the elements of `that`
   *  @return          `true` if both parallel sequences have the same length and
   *                   `p(x, y)` is `true` for all corresponding elements `x` of this $coll
   *                   and `y` of `that`, otherwise `false`
   */
  def corresponds[S](that: GenSeq[S])(p: (T, S) => Boolean): Boolean = that ifParSeq { pthat =>
    val ctx = new DefaultSignalling with VolatileAbort
    length == pthat.length && tasksupport.executeAndWaitResult(new Corresponds(p, splitter assign ctx, pthat.splitter))
  } otherwise seq.corresponds(that)(p)

  def diff[U >: T](that: GenSeq[U]): Repr = sequentially {
    _ diff that
  }

  /** Computes the multiset intersection between this $coll and another sequence.
   *
   *  @param that   the sequence of elements to intersect with.
   *  @tparam U     the element type of `that` parallel sequence
   *  @return       a new collection of type `That` which contains all elements of this $coll
   *                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.
   *
   *  @usecase def intersect(that: Seq[T]): $Coll[T]
   *    @inheritdoc
   *
   *    $mayNotTerminateInf
   *
   *    @return       a new $coll which contains all elements of this $coll
   *                  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.
   */
  def intersect[U >: T](that: GenSeq[U]) = sequentially {
    _ intersect that
  }

  /** Builds a new $coll from this $coll without any duplicate elements.
   *  $willNotTerminateInf
   *
   *  @return  A new $coll which contains the first occurrence of every element of this $coll.
   */
  def distinct: Repr = sequentially {
    _.distinct
  }

  override def toString = seq.mkString(stringPrefix + "(", ", ", ")")

  override def toSeq = this.asInstanceOf[ParSeq[T]]

  @deprecated("use .seq.view", "2.11.0")
  override def view = seq.view

  /* tasks */

  protected[this] def down(p: IterableSplitter[_]) = p.asInstanceOf[SeqSplitter[T]]

  protected trait Accessor[R, Tp] extends super.Accessor[R, Tp] {
    protected[this] val pit: SeqSplitter[T]
  }

  protected trait Transformer[R, Tp] extends Accessor[R, Tp] with super.Transformer[R, Tp]

  protected[this] class SegmentLength(pred: T => Boolean, from: Int, protected[this] val pit: SeqSplitter[T])
  extends Accessor[(Int, Boolean), SegmentLength] {
    @volatile var result: (Int, Boolean) = null
    def leaf(prev: Option[(Int, Boolean)]) = if (from < pit.indexFlag) {
      val itsize = pit.remaining
      val seglen = pit.prefixLength(pred)
      result = (seglen, itsize == seglen)
      if (!result._2) pit.setIndexFlagIfLesser(from)
    } else result = (0, false)
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val pits = pit.splitWithSignalling
      for ((p, untilp) <- pits zip pits.scanLeft(0)(_ + _.remaining)) yield new SegmentLength(pred, from + untilp, p)
    }
    override def merge(that: SegmentLength) = if (result._2) result = (result._1 + that.result._1, that.result._2)
    override def requiresStrictSplitters = true
  }

  protected[this] class IndexWhere(pred: T => Boolean, from: Int, protected[this] val pit: SeqSplitter[T])
  extends Accessor[Int, IndexWhere] {
    @volatile var result: Int = -1
    def leaf(prev: Option[Int]) = if (from < pit.indexFlag) {
      val r = pit.indexWhere(pred)
      if (r != -1) {
        result = from + r
        pit.setIndexFlagIfLesser(from)
      }
    }
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val pits = pit.splitWithSignalling
      for ((p, untilp) <- pits zip pits.scanLeft(from)(_ + _.remaining)) yield new IndexWhere(pred, untilp, p)
    }
    override def merge(that: IndexWhere) = result = if (result == -1) that.result else {
      if (that.result != -1) result min that.result else result
    }
    override def requiresStrictSplitters = true
  }

  protected[this] class LastIndexWhere(pred: T => Boolean, pos: Int, protected[this] val pit: SeqSplitter[T])
  extends Accessor[Int, LastIndexWhere] {
    @volatile var result: Int = -1
    def leaf(prev: Option[Int]) = if (pos > pit.indexFlag) {
      val r = pit.lastIndexWhere(pred)
      if (r != -1) {
        result = pos + r
        pit.setIndexFlagIfGreater(pos)
      }
    }
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val pits = pit.splitWithSignalling
      for ((p, untilp) <- pits zip pits.scanLeft(pos)(_ + _.remaining)) yield new LastIndexWhere(pred, untilp, p)
    }
    override def merge(that: LastIndexWhere) = result = if (result == -1) that.result else {
      if (that.result != -1) result max that.result else result
    }
    override def requiresStrictSplitters = true
  }

  protected[this] class Reverse[U >: T, This >: Repr](cbf: () => Combiner[U, This], protected[this] val pit: SeqSplitter[T])
  extends Transformer[Combiner[U, This], Reverse[U, This]] {
    @volatile var result: Combiner[U, This] = null
    def leaf(prev: Option[Combiner[U, This]]) = result = pit.reverse2combiner(reuse(prev, cbf()))
    protected[this] def newSubtask(p: SuperParIterator) = new Reverse(cbf, down(p))
    override def merge(that: Reverse[U, This]) = result = that.result combine result
  }

  protected[this] class ReverseMap[S, That](f: T => S, pbf: () => Combiner[S, That], protected[this] val pit: SeqSplitter[T])
  extends Transformer[Combiner[S, That], ReverseMap[S, That]] {
    @volatile var result: Combiner[S, That] = null
    def leaf(prev: Option[Combiner[S, That]]) = result = pit.reverseMap2combiner(f, pbf())
    protected[this] def newSubtask(p: SuperParIterator) = new ReverseMap(f, pbf, down(p))
    override def merge(that: ReverseMap[S, That]) = result = that.result combine result
  }

  protected[this] class SameElements[U >: T](protected[this] val pit: SeqSplitter[T], val otherpit: SeqSplitter[U])
  extends Accessor[Boolean, SameElements[U]] {
    @volatile var result: Boolean = true
    def leaf(prev: Option[Boolean]) = if (!pit.isAborted) {
      result = pit.sameElements(otherpit)
      if (!result) pit.abort()
    }
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val fp = pit.remaining / 2
      val sp = pit.remaining - fp
      for ((p, op) <- pit.psplitWithSignalling(fp, sp) zip otherpit.psplitWithSignalling(fp, sp)) yield new SameElements(p, op)
    }
    override def merge(that: SameElements[U]) = result = result && that.result
    override def requiresStrictSplitters = true
  }

  protected[this] class Updated[U >: T, That](pos: Int, elem: U, pbf: CombinerFactory[U, That], protected[this] val pit: SeqSplitter[T])
  extends Transformer[Combiner[U, That], Updated[U, That]] {
    @volatile var result: Combiner[U, That] = null
    def leaf(prev: Option[Combiner[U, That]]) = result = pit.updated2combiner(pos, elem, pbf())
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val pits = pit.splitWithSignalling
      for ((p, untilp) <- pits zip pits.scanLeft(0)(_ + _.remaining)) yield new Updated(pos - untilp, elem, pbf, p)
    }
    override def merge(that: Updated[U, That]) = result = result combine that.result
    override def requiresStrictSplitters = true
  }

  protected[this] class Zip[U >: T, S, That](len: Int, cf: CombinerFactory[(U, S), That], protected[this] val pit: SeqSplitter[T], val otherpit: SeqSplitter[S])
  extends Transformer[Combiner[(U, S), That], Zip[U, S, That]] {
    @volatile var result: Result = null
    def leaf(prev: Option[Result]) = result = pit.zip2combiner[U, S, That](otherpit, cf())
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val fp = len / 2
      val sp = len - len / 2
      val pits = pit.psplitWithSignalling(fp, sp)
      val opits = otherpit.psplitWithSignalling(fp, sp)
      Seq(
        new Zip(fp, cf, pits(0), opits(0)),
        new Zip(sp, cf, pits(1), opits(1))
      )
    }
    override def merge(that: Zip[U, S, That]) = result = result combine that.result
  }

  protected[this] class Corresponds[S](corr: (T, S) => Boolean, protected[this] val pit: SeqSplitter[T], val otherpit: SeqSplitter[S])
  extends Accessor[Boolean, Corresponds[S]] {
    @volatile var result: Boolean = true
    def leaf(prev: Option[Boolean]) = if (!pit.isAborted) {
      result = pit.corresponds(corr)(otherpit)
      if (!result) pit.abort()
    }
    protected[this] def newSubtask(p: SuperParIterator) = throw new UnsupportedOperationException
    override def split = {
      val fp = pit.remaining / 2
      val sp = pit.remaining - fp
      for ((p, op) <- pit.psplitWithSignalling(fp, sp) zip otherpit.psplitWithSignalling(fp, sp)) yield new Corresponds(corr, p, op)
    }
    override def merge(that: Corresponds[S]) = result = result && that.result
    override def requiresStrictSplitters = true
  }
}