Scala Library: scala.collection.parallel.mutable.ParArray
scala.collection.parallel.mutable.ParArray
Parallel sequence holding elements in a linear array.
ParArray
is a parallel sequence with a predefined size. The size of the array
cannot be changed after it’s been created.
ParArray
internally keeps an array containing the elements. This means that
bulk operations based on traversal ensure fast access to elements. ParArray
uses lazy builders that create the internal data array only after the size of
the array is known. In the meantime, they keep the result set fragmented. The
fragments are copied into the resulting data array in parallel using fast array
copy operations once all the combiners are populated in parallel.
- T
- type of the elements in the array
- Self Type
- ParArray [T]
- Annotations
- @ SerialVersionUID ()
- Source
- Since
- 2.9
- See also
- Scala’s Parallel Collections Library overview
section on
ParArray
for more information.
- Scala’s Parallel Collections Library overview
section on
Type Members
trait Accessor[R, Tp] extends ParSeqLike.Accessor[R, Tp]
- Attributes
- protected
- Definition Classes
- ParSeqLike
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]
- Definition Classes
- ParSeqLike
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
- Definition Classes
- ParSeqLike
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]
- Definition Classes
- ParSeqLike
class LastIndexWhere extends Accessor[Int, LastIndexWhere]
- Attributes
- protected[this]
- Definition Classes
- ParSeqLike
class Map[S] extends Task[Unit, Map[S]]
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
class ParArrayIterator extends SeqSplitter[T]
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]
- Definition Classes
- ParSeqLike
class ReverseMap[S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]
- Attributes
- protected[this]
- Definition Classes
- ParSeqLike
type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]
- Definition Classes
- ParIterableLike
class SameElements[U >: T] extends Accessor[Boolean, SameElements[U]]
- Attributes
- protected[this]
- Definition Classes
- ParSeqLike
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
class ScanToArray[U >: T] extends Task[Unit, ScanToArray[U]]
trait ScanTree[U >: T] extends AnyRef
- Attributes
- protected[this]
- Definition Classes
- ParIterableLike
class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]
- Attributes
- protected[this]
- Definition Classes
- ParSeqLike
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]
- Definition Classes
- ParSeqLike
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
- 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
class ZipAll[U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]
- Attributes
- protected[this]
- Definition Classes
- ParIterableLike
Value Members From scala.collection.CustomParallelizable
def parCombiner: Combiner[T, ParArray[T]]
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
- a combiner for the parallel collection of type
- Attributes
- protected[this]
- Definition Classes
- CustomParallelizable → Parallelizable
(defined at scala.collection.CustomParallelizable)
Value Members From 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
ifthat
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 array.
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 array that is equal (as
determined by
==
) toelem
, or-1
, if none exists.
- the index of the first element of this parallel array that is equal (as
determined by
- 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 array 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 array that is equal (as determined by==
) toelem
, or-1
, if none exists.
- the index
- 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.
- the index of the first element of this general sequence that satisfies the
predicate
- 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 positionidx
,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 array.
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 array that is equal (as
determined by
==
) toelem
, or-1
, if none exists.
- the index of the last element of this parallel array that is equal (as
determined by
- 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 array 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 array that is equal (as determined by==
) toelem
, or-1
, if none exists.
- the index
- 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.
- the index of the last element of this general sequence that satisfies the
predicate
- 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
.
- the length of the longest prefix of this general sequence such that every
element of the segment satisfies the predicate
- 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 hasthat
as a prefix,false
otherwise.
- Definition Classes
- GenSeqLike
(defined at scala.collection.GenSeqLike)
def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ParArray[T], B, That]): That
[use case]
Produces a new sequence which contains all elements of this parallel array 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 array which contains all elements of this parallel array
followed by all elements of
that
.
- a new parallel array which contains all elements of this parallel array
followed by all elements of
- Definition Classes
- GenSeqLike
(defined at scala.collection.GenSeqLike)
Value Members From scala.collection.generic.GenericParTemplate
def genericBuilder[B]: Combiner[B, ParArray[B]]
The generic builder that builds instances of Traversable at arbitrary element types.
- Definition Classes
- GenericParTemplate → GenericTraversableTemplate
(defined at scala.collection.generic.GenericParTemplate)
def genericCombiner[B]: Combiner[B, ParArray[B]]
- Definition Classes
- GenericParTemplate
(defined at scala.collection.generic.GenericParTemplate)
def newBuilder: Builder[T, ParArray[T]]
The builder that builds instances of type Traversable[A]
- Attributes
- protected[this]
- Definition Classes
- GenericParTemplate → GenericTraversableTemplate → HasNewBuilder
(defined at scala.collection.generic.GenericParTemplate)
def newCombiner: Combiner[T, ParArray[T]]
- Attributes
- protected[this]
- Definition Classes
- GenericParTemplate → HasNewCombiner
(defined at scala.collection.generic.GenericParTemplate)
Value Members From scala.collection.generic.GenericTraversableTemplate
def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParArray[B]
[use case]
Converts this parallel array of traversable collections into a parallel array formed by the elements of these traversable collections.
The resulting collection’s type will be guided by the static type of parallel array. For example:
- B
- the type of the elements of each traversable collection.
- returns
- a new parallel array resulting from concatenating all element parallel arrays.
- Definition Classes
- GenericTraversableTemplate
(defined at scala.collection.generic.GenericTraversableTemplate)
def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParArray[ParArray[B]]
Transposes this collection of traversable collections into a collection of collections.
The resulting collection’s type will be guided by the static type of collection. For example:
- B
- the type of the elements of each traversable collection.
- asTraversable
- an implicit conversion which asserts that the element type of this
collection is a
Traversable
.
- an implicit conversion which asserts that the element type of this
collection is a
- returns
- a two-dimensional collection of collections which has as n th row the n th column of this collection.
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
- (Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
- (Changed in version 2.9.0)
- Exceptions thrown
- IllegalArgumentException if all collections in this collection are not of the same size.
(defined at scala.collection.generic.GenericTraversableTemplate)
def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParArray[A1], ParArray[A2], ParArray[A3])
Converts this collection of triples into three collections of the first, second, and third element of each triple.
- A1
- the type of the first member of the element triples
- A2
- the type of the second member of the element triples
- A3
- the type of the third member of the element triples
- asTriple
- an implicit conversion which asserts that the element type of this collection is a triple.
- returns
- a triple of collections, containing the first, second, respectively third member of each element triple of this collection.
- Definition Classes
- GenericTraversableTemplate
(defined at scala.collection.generic.GenericTraversableTemplate)
def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParArray[A1], ParArray[A2])
Converts this collection of pairs into two collections of the first and second half of each pair.
- A1
- the type of the first half of the element pairs
- A2
- the type of the second half of the element pairs
- asPair
- an implicit conversion which asserts that the element type of this collection is a pair.
- returns
- a pair of collections, containing the first, respectively second half of each element pair of this collection.
- Definition Classes
- GenericTraversableTemplate
(defined at scala.collection.generic.GenericTraversableTemplate)
Value Members From scala.collection.parallel.ParIterableLike
def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParArray[T], U, That]): That
[use case]
Returns a new parallel array containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the parallel array is the most specific superclass encompassing the element types of the two operands.
Example:
- B
- the element type of the returned collection.
- that
- the traversable to append.
- returns
- a new parallel array which contains all elements of this parallel array
followed by all elements of
that
.
- a new parallel array which contains all elements of this parallel array
followed by all elements of
- 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.
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 valuez
on the left:
- the result of inserting
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.
- 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 valuez
on the right:
- the result of inserting
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.
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 or0
for summation) and may be evaluated more than once
- the initial value for the accumulated result of the partition - this will
typically be the neutral element for the
- 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[ParArray[T], S, That]): CanBuildFrom[ArraySeq[T], 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[ParArray[T], S, That]): That
[use case]
Builds a new collection by applying a partial function to all elements of this parallel array on which the function is defined.
- B
- the element type of the returned collection.
- pf
- the partial function which filters and maps the parallel array.
- returns
- a new parallel array 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.
- a new parallel array resulting from applying the given partial function
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def combinerFactory: CombinerFactory[T, ParArray[T]]
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 array to an array. Fills the given array
xs
with values of this parallel array. Copying will stop once either the end
of the current parallel array 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 array to an array. Fills the given array
xs
with values of this parallel array, beginning at index start
. Copying
will stop once either the end of the current parallel array 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 array to an array. Fills the given array
xs
with at most len
elements of this parallel array, starting at position
start
. Copying will stop once either the end of the current parallel array
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
.
- the number of elements satisfying the predicate
- 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): ParArray[T]
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 thann
elements.
- a parallel iterable consisting of all elements of this parallel iterable
except the first
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def dropWhile(pred: (T) ⇒ Boolean): ParArray[T]
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
- a collection composed of all the elements after the longest prefix of
elements in this parallel iterable that satisfy the predicate
- 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
- true if
- Definition Classes
- ParIterableLike → GenTraversableOnce
(defined at scala.collection.parallel.ParIterableLike)
def filter(pred: (T) ⇒ Boolean): ParArray[T]
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.
- a new parallel iterable consisting of all elements of this parallel iterable
that satisfy the given predicate
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def filterNot(pred: (T) ⇒ Boolean): ParArray[T]
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.
- a new parallel iterable consisting of all elements of this parallel iterable
that do not satisfy the given predicate
- 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
- an option value with the element if such an element exists, or
- Definition Classes
- ParIterableLike → GenTraversableOnce
(defined at scala.collection.parallel.ParIterableLike)
def flatMap[S, That](f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParArray[T], S, That]): That
[use case]
Builds a new collection by applying a function to all elements of this parallel array and using the elements of the resulting collections.
For example:
The type of the resulting collection is guided by the static type of parallel array. This might cause unexpected results sometimes. For example:
- B
- the element type of the returned collection.
- f
- the function to apply to each element.
- returns
- a new parallel array resulting from applying the given collection-valued
function
f
to each element of this parallel array and concatenating the results.
- a new parallel array resulting from applying the given collection-valued
function
- 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 valuez
on the left:
- the result of inserting
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 valuez
on the right:
- the result of inserting
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
.
- a type parameter for the binary operator, a supertype of
- 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)
- 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.
- op
- a binary operator that must be associative
- returns
- the result of applying fold operator
op
between all the elements andz
- the result of applying fold operator
- 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
- true if
- 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, ParArray[T]]
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:
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 init: ParArray[T]
Selects all elements except the last.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
- a parallel iterable consisting of all elements of this parallel iterable except the last one.
- Definition Classes
- ParIterableLike → GenTraversableLike
- Exceptions thrown
- UnsupportedOperationException if the parallel iterable is empty.
(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 array 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 array 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 stringsep
.
- a string representation of this parallel iterable. In the resulting string
the string representations (w.r.t. the method
- Definition Classes
- ParIterableLike → GenTraversableOnce
Example:
(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 stringend
. Inside, the string representations (w.r.t. the methodtoString
) of all elements of this parallel iterable are separated by the stringsep
.
- a string representation of this parallel iterable. The resulting string
begins with the string
- Definition Classes
- ParIterableLike → GenTraversableOnce
Example:
(defined at scala.collection.parallel.ParIterableLike)
def par: ParArray[T]
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
(defined at scala.collection.parallel.ParIterableLike)
def partition(pred: (T) ⇒ Boolean): (ParArray[T], ParArray[T])
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.
- a pair of parallel iterables: the first parallel iterable consists of all
elements that satisfy the predicate
- 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.
- an option value containing the result of
- 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
.
- A type parameter for the binary operator, a supertype of
- 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, andNone
otherwise.
- An option value containing result of applying reduce operator
- 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.
- an option value containing the result of
- 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:
- the result of inserting
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
.
- A type parameter for the binary operator, a supertype of
- 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.
- The result of applying reduce operator
- Definition Classes
- ParIterableLike → GenTraversableOnce
- Exceptions thrown
- UnsupportedOperationException if this parallel iterable is empty.
(defined at scala.collection.parallel.ParIterableLike)
def repr: ParArray[T]
- Definition Classes
- ParIterableLike → GenTraversableLike
(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.
- The combiner that is the result of the previous task, or
- newc
- The new, empty combiner that can be used.
- returns
- Either
newc
oroldc
.
- Either
- Attributes
- protected
- Definition Classes
- ParIterableLike
(defined at scala.collection.parallel.ParIterableLike)
def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParArray[T], 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 classThat
from the current representation typeRepr
and and the new element typeB
.
- an implicit value of class
- 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[ParArray[T], 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:
- 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 classThat
from the current representation typeRepr
and and the new element typeB
.
- an implicit value of class
- returns
- collection with intermediate results
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def sequentially[S, That <: Parallel](b: (ArraySeq[T]) ⇒ Parallelizable[S, That]): ParArray[T]
- Attributes
- protected[this]
- Definition Classes
- ParIterableLike
(defined at scala.collection.parallel.ParIterableLike)
def slice(unc_from: Int, unc_until: Int): ParArray[T]
Selects an interval of elements. The returned collection is made up of all
elements x
which satisfy the invariant:
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) indexuntil
of this parallel iterable.
- a parallel iterable containing the elements greater than or equal to index
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def span(pred: (T) ⇒ Boolean): (ParArray[T], ParArray[T])
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
- a pair consisting of the longest prefix of the collection for which all the
elements satisfy
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def splitAt(n: Int): (ParArray[T], ParArray[T])
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.
- a pair of parallel iterables consisting of the first
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def tail: ParArray[T]
Selects all elements except the first.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
- a parallel iterable consisting of all elements of this parallel iterable except the first one.
- Definition Classes
- ParIterableLike → GenTraversableLike
- Exceptions thrown
- UnsupportedOperationException if the parallel iterable is empty.
(defined at scala.collection.parallel.ParIterableLike)
def take(n: Int): ParArray[T]
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 thann
elements.
- a parallel iterable consisting only of the first
- Definition Classes
- ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.ParIterableLike)
def takeWhile(pred: (T) ⇒ Boolean): ParArray[T]
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
- the longest prefix of this parallel iterable of elements that satisfy the
predicate
- 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:
- 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 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 array 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 array.
- a map of type
- 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): ParArray[T]
- 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[ParArray[T], (U, S), That]): That
[use case]
Returns a parallel array formed from this parallel array 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 array is
shorter than
that
.
- the element to be used to fill up the result if this parallel array is
shorter than
- thatElem
- the element to be used to fill up the result if
that
is shorter than this parallel array.
- the element to be used to fill up the result if
- returns
- a new parallel array containing pairs consisting of corresponding elements
of this parallel array and
that
. The length of the returned collection is the maximum of the lengths of this parallel array andthat
. If this parallel array is shorter thanthat
,thisElem
values are used to pad the result. Ifthat
is shorter than this parallel array,thatElem
values are used to pad the result.
- a new parallel array containing pairs consisting of corresponding elements
of this parallel array and
- Definition Classes
- ParIterableLike → GenIterableLike
(defined at scala.collection.parallel.ParIterableLike)
def zipWithIndex[U >: T, That](implicit bf: CanBuildFrom[ParArray[T], (U, Int), That]): That
[use case]
Zips this parallel array with its indices.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- returns
- A new parallel array containing pairs consisting of all elements of this
parallel array paired with their index. Indices start at
0
.
- A new parallel array containing pairs consisting of all elements of this
parallel array paired with their index. Indices start at
- Definition Classes
- ParIterableLike → GenIterableLike
Example:
(defined at scala.collection.parallel.ParIterableLike)
Deprecated Value Members From scala.collection.parallel.ParSeqLike
def view: SeqView[T, ArraySeq[T]]
- Definition Classes
- ParSeqLike → ParIterableLike
- Annotations
- @ deprecated
- Deprecated
- (Since version 2.11.0) use.seq.view
(defined at scala.collection.parallel.ParSeqLike)
Value Members From scala.collection.parallel.ParSeqLike
def +:[U >: T, That](elem: U)(implicit bf: CanBuildFrom[ParArray[T], U, That]): That
[use case]
A copy of the parallel array 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 array is not modified, so you will want to capture the result.
Example:
- elem
- the prepended element
- returns
- a new parallel array consisting of
elem
followed by all elements of this parallel array.
- a new parallel array consisting of
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def :+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[ParArray[T], U, That]): That
[use case]
A copy of this parallel array 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:
- elem
- the appended element
- returns
- a new parallel array consisting of all elements of this parallel array
followed by
elem
.
- a new parallel array consisting of all elements of this parallel array
followed by
- 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
- the type of the elements of
- 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 andp(x, y)
istrue
for all corresponding elementsx
of this parallel iterable andy
ofthat
, otherwisefalse
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def diff[U >: T](that: GenSeq[U]): ParArray[T]
[use case]
Computes the multiset difference between this parallel array and another sequence.
Note: will not terminate for infinite-sized collections.
- that
- the sequence of elements to remove
- returns
- a new parallel array which contains all elements of this parallel array
except some of occurrences of elements that also appear in
that
. If an element valuex
appears n times inthat
, then the first n occurrences ofx
will not form part of the result, but any following occurrences will.
- a new parallel array which contains all elements of this parallel array
except some of occurrences of elements that also appear in
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def distinct: ParArray[T]
Builds a new parallel iterable from this parallel iterable without any duplicate elements.
Note: will not terminate for infinite-sized collections.
- returns
- A new parallel iterable which contains the first occurrence of every element of this parallel iterable.
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def down(p: IterableSplitter[_]): SeqSplitter[T]
- Attributes
- protected[this]
- Definition Classes
- ParSeqLike
(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
- the type of the elements of
- that
- the sequence to test
- returns
true
if this parallel iterable hasthat
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 predicatep
, or-1
, if none exists
- the index
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def intersect[U >: T](that: GenSeq[U]): ParArray[T]
[use case]
Computes the multiset intersection between this parallel array and another sequence.
Note: may not terminate for infinite-sized collections.
- that
- the sequence of elements to intersect with.
- returns
- a new parallel array which contains all elements of this parallel array
which also appear in
that
. If an element valuex
appears n times inthat
, then the first n occurrences ofx
will be retained in the result, but any following occurrences will be omitted.
- a new parallel array which contains all elements of this parallel array
which also appear in
- 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 predicatep
, or-1
, if none exists
- the index
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def padTo[U >: T, That](len: Int, elem: U)(implicit bf: CanBuildFrom[ParArray[T], U, That]): That
[use case]
A copy of this parallel array with an element value appended until a given target length is reached.
- len
- the target length
- elem
- the padding value
- returns
- a new parallel array consisting of all elements of this parallel array
followed by the minimal number of occurrences of
elem
so that the resulting parallel array has a length of at leastlen
.
- a new parallel array consisting of all elements of this parallel array
followed by the minimal number of occurrences of
- 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[ParArray[T], U, That]): That
[use case]
Produces a new parallel array where a slice of elements in this parallel array is replaced by another sequence.
- from
- the index of the first replaced element
- replaced
- the number of elements to drop in the original parallel array
- returns
- a new parallel array consisting of all elements of this parallel array
except that
replaced
elements starting fromfrom
are replaced bypatch
.
- a new parallel array consisting of all elements of this parallel array
except that
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def reverse: ParArray[T]
Returns new parallel iterable with elements in reversed order.
Note: will not terminate for infinite-sized collections.
- returns
- A new parallel iterable with all elements of this parallel iterable in reversed order.
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def reverseMap[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParArray[T], S, That]): That
[use case]
Builds a new collection by applying a function to all elements of this parallel array 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 array resulting from applying the given function
f
to each element of this parallel array and collecting the results in reversed order.
- a new parallel array resulting from applying the given function
- 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 array.
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
- the length of the longest segment of elements starting at
- 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
- the element type of
- that
- the parallel sequence this sequence is being searched for
- offset
- the starting offset for the search
- returns
true
if there is a sequencethat
starting atoffset
in this sequence,false
otherwise
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def updated[U >: T, That](index: Int, elem: U)(implicit bf: CanBuildFrom[ParArray[T], U, That]): That
[use case]
A copy of this parallel array with one single replaced element.
- index
- the position of the replacement
- elem
- the replacing element
- returns
- a copy of this parallel array with the element at position
index
replaced byelem
.
- a copy of this parallel array with the element at position
- Definition Classes
- ParSeqLike → GenSeqLike
(defined at scala.collection.parallel.ParSeqLike)
def zip[U >: T, S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[ParArray[T], (U, S), That]): That
[use case]
Returns a parallel array formed from this parallel array 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 array containing pairs consisting of corresponding elements
of this parallel array and
that
. The length of the returned collection is the minimum of the lengths of this parallel array andthat
.
- a new parallel array containing pairs consisting of corresponding elements
of this parallel array and
- Definition Classes
- ParSeqLike → ParIterableLike → GenIterableLike
(defined at scala.collection.parallel.ParSeqLike)
Instance Constructors From scala.collection.parallel.mutable.ParArray
new ParArray(sz: Int)
(defined at scala.collection.parallel.mutable.ParArray)
Value Members From scala.collection.parallel.mutable.ParArray
def apply(i: Int): T
Selects an element by its index in the parallel array.
Example:
- returns
- the element of this parallel array at index
idx
, where0
indicates the first element.
- the element of this parallel array at index
- Definition Classes
- ParArray → ParSeq → GenSeqLike
- Exceptions thrown
- IndexOutOfBoundsException if
idx
does not satisfy0 <= idx < length
.
- IndexOutOfBoundsException if
(defined at scala.collection.parallel.mutable.ParArray)
val arrayseq: ArraySeq[T]
(defined at scala.collection.parallel.mutable.ParArray)
def companion: GenericCompanion[ParArray] with GenericParCompanion[ParArray]
The factory companion object that builds instances of class ParArray
. (or its
Iterable
superclass where class ParArray
is not a Seq
.)
- Definition Classes
- ParArray → ParSeq → ParSeq → ParIterable → ParIterable → GenericParTemplate → GenSeq → GenIterable → GenTraversable → GenericTraversableTemplate
(defined at scala.collection.parallel.mutable.ParArray)
def map[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParArray[T], S, That]): That
[use case]
Builds a new collection by applying a function to all elements of this parallel array.
- B
- the element type of the returned collection.
- f
- the function to apply to each element.
- returns
- a new parallel array resulting from applying the given function
f
to each element of this parallel array and collecting the results.
- a new parallel array resulting from applying the given function
- Definition Classes
- ParArray → ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.mutable.ParArray)
def scan[U >: T, That](z: U)(op: (U, U) ⇒ U)(implicit cbf: CanBuildFrom[ParArray[T], 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
- neutral element for the operator
- op
- the associative operator for the scan
- returns
- a new parallel array containing the prefix scan of the elements in this parallel array
- Definition Classes
- ParArray → ParIterableLike → GenTraversableLike
(defined at scala.collection.parallel.mutable.ParArray)
def seq: ArraySeq[T]
- Definition Classes
- ParArray → ParSeq → ParIterable → ParIterableLike → GenSeq → GenIterable → GenTraversable → GenSeqLike → Parallelizable → GenTraversableOnce
(defined at scala.collection.parallel.mutable.ParArray)
def splitter: ParArrayIterator
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
- ParArray → ParSeqLike → ParIterableLike
(defined at scala.collection.parallel.mutable.ParArray)
def update(i: Int, elem: T): Unit
- Definition Classes
- ParArray → ParSeq
(defined at scala.collection.parallel.mutable.ParArray)
Value Members From scala.collection.parallel.mutable.ParIterable
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.
- an
- Definition Classes
- ParIterable → ParIterableLike → GenTraversableOnce
(defined at scala.collection.parallel.mutable.ParIterable)
Value Members From scala.collection.parallel.mutable.ParSeq
def toSeq: ParSeq[T]
Converts this mutable parallel sequence to a sequence. As with toIterable
,
it’s lazy in this default implementation, as this TraversableOnce
may be lazy
and unevaluated.
Note: will not terminate for infinite-sized collections.
- returns
- a sequence containing all elements of this mutable parallel sequence.
- Definition Classes
- ParSeq → ParSeqLike → ParIterable → ParIterableLike → GenSeqLike → GenTraversableOnce
(defined at scala.collection.parallel.mutable.ParSeq)
Value Members From Implicit scala.collection.parallel.CollectionsHaveToParArray ——————————————————————————–
def toParArray: ParArray[T]
- Implicit information
- This member is added by an implicit conversion from ParArray [T] to CollectionsHaveToParArray [ParArray [T], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ParArray [T]) ⇒ GenTraversableOnce [T] is in scope.
- Definition Classes
- CollectionsHaveToParArray (added by implicit convertion: scala.collection.parallel.CollectionsHaveToParArray)
Full Source:
Interested in Scala?
I send out weekly, personalized emails with articles and conference talks.
Subscribe now.