scala.collection.parallel.mutable
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.
type of the elements in the array
Standard accessor task that iterates over the elements of the collection.
Used to iterate elements using indices
Performs two tasks in parallel, and waits for both to finish.
An iterator that can be split into arbitrary subsets of iterators.
The type implementing this traversable
Sequentially performs one task after another.
A stackable modification that ensures signal contexts get passed along the iterators.
A class supporting filtered operations.
o != arg0 is the same as !(o == (arg0)).
o != arg0 is the same as !(o == (arg0)).
the object to compare against this object for dis-equality.
false if the receiver object is equivalent to the argument; true otherwise.
[use case] Concatenates this parallel array
Concatenates this parallel array
the element type of the returned collection.
the traversable to append.
a new parallel array
Concatenates this parallel array
Concatenates this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the traversable to append.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That which contains all elements
of this parallel array
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.
[use case] Concatenates this parallel array
Concatenates this parallel array
the element type of the returned collection.
the traversable to append.
a new parallel array
Concatenates this parallel array
Concatenates this parallel array
the element type of the returned collection.
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the traversable to append.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That which contains all elements
of this parallel array
[use case] Prepends an element to this parallel array
Prepends an element to this parallel array
the prepended element
a new parallel array
Prepends an element to this parallel array
Prepends an element to this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the prepended element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That consisting of elem followed
by all elements of this parallel array
Applies a binary operator to a start value and all elements of this parallel array
Applies a binary operator to a start value and all elements of this parallel array
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this parallel array
[use case] Appends an element to this parallel array
Appends an element to this parallel array
the appended element
a new parallel array
Appends an element to this parallel array
Appends an element to this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the appended element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That consisting of
all elements of this parallel array
Applies a binary operator to all elements of this parallel array
Applies a binary operator to all elements of this parallel array
the result type of the binary operator.
the start value
the binary operator
the result of inserting op between consecutive elements of this parallel array
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
o == arg0 is the same as o.equals(arg0).
o == arg0 is the same as o.equals(arg0).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
Appends all elements of this parallel array
Appends all elements of this parallel array
the string builder to which elements are appended.
the string builder b to which elements were appended.
Appends all elements of this parallel array
Appends all elements of this parallel array
the string builder to which elements are appended.
the separator string.
the string builder b to which elements were appended.
Appends all elements of this parallel array
Appends all elements of this parallel array
the string builder to which elements are appended.
the starting string.
the separator string.
the ending string.
the string builder b to which elements were appended.
Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does
not require the result to be a supertype of the element type. It traverses the elements in
different partitions sequentially, using seqop to update the result, and then
applies combop to results from different partitions. The implementation of this
operation may operate on an arbitrary number of collection partitions, so combop
may be invoked arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this
case, seqop would process an element and append it to the list, while combop
would concatenate two lists 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).
the type of accumulated results
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)
an operator used to accumulate results within a partition
an associative operator used to combine results from different partitions
Composes this partial function with a transformation function that gets applied to results of this partial function.
Composes this partial function with a transformation function that gets applied to results of this partial function.
the result type of the transformation function.
the transformation function
a partial function with the same domain as this partial function, which maps
arguments x to k(this(x)).
Selects an element by its index in the parallel array
This method is used to cast the receiver object to be of type T0.
This method is used to cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression
1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression
List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as
part of compilation it is not possible to check whether the contents of the list are of the requested typed.
the receiver object.
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
The object with which this parallel array
true, if this parallel array
This method creates and returns a copy of the receiver object.
This method creates and returns a copy of the receiver object.
The default implementation of the clone method is platform dependent.
a copy of the receiver object.
[use case] Builds a new collection by applying a partial function to all elements of this parallel array
Builds a new collection by applying a partial function to all elements of this parallel array
the element type of the returned collection.
the partial function which filters and maps the parallel array
a new parallel array
Builds a new collection by applying a partial function to all elements of this parallel array
Builds a new collection by applying a partial function to all elements of this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the partial function which filters and maps the parallel array
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That resulting from applying the partial function
pf to each element on which it is defined and collecting the results.
The order of the elements is preserved.
Finds the first element of the parallel array
Finds the first element of the parallel array
the partial function
an option value containing pf applied to the first
value for which it is defined, or None if none exists.
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
Iterates over combinations.
Iterates over combinations.
An Iterator which traverses the possible n-element combinations of this parallel array
"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)
The factory companion object that builds instances of class ParArray.
The factory companion object that builds instances of class ParArray.
(or its Iterable superclass where class ParArray is not a Seq.)
Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
the type to which function g can be applied
a function A => T1
a new function f such that f(x) == apply(g(x))
Tests whether this parallel array
Tests whether this parallel array
the element to test.
true if this parallel array
Tests whether this parallel array
Tests whether this parallel array
the sequence to test
true if this parallel array
[use case] Copies elements of this parallel array
Copies elements of this parallel array
the array to fill.
the starting index.
the maximal number of elements to copy.
Copies elements of this parallel array
Copies elements of this parallel array
the array to fill.
the starting index.
the maximal number of elements to copy.
[use case] Copies values of this parallel array
Copies values of this parallel array
the array to fill.
Copies values of this parallel array
Copies values of this parallel array
the type of the elements of the array.
the array to fill.
[use case] Copies values of this parallel array
Copies values of this parallel array
the array to fill.
the starting index.
Copies values of this parallel array
Copies values of this parallel array
the type of the elements of the array.
the array to fill.
the starting index.
Copies all elements of this parallel array
Copies all elements of this parallel array
The buffer to which elements are copied.
Tests whether every element of this parallel array
Tests whether every element of this parallel array
the type of the elements of that
the other parallel sequence
the test predicate, which relates elements from both sequences
true if both parallel sequences have the same length and
p(x, y) is true for all corresponding elements x of this parallel array
Counts the number of elements in the parallel array
Counts the number of elements in the parallel array
the predicate used to test elements.
the number of elements satisfying the predicate p.
[use case] Computes the multiset difference between this parallel array
Computes the multiset difference between this parallel array
the sequence of elements to remove
a new parallel array
Computes the multiset difference between this parallel array
Computes the multiset difference between this parallel array
the element type of the returned parallel array
the sequence of elements to remove
a new collection of type That which contains all elements of this parallel array
Builds a new parallel array
Selects all elements except first n ones.
Selects all elements except first n ones.
the number of elements to drop from this parallel array
a parallel array
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
a parallel array
Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.
Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.
This method will use indexFlag signalling capabilities. This means
that splitters may set and read the indexFlag state.
The index flag is initially set to maximum integer value.
the predicate used to test the elements
a collection composed of all the elements after the longest prefix of elements in this parallel array
use iterator' instead
Tests whether this parallel array
Tests whether this parallel array
the type of the elements of that sequence
the sequence to test
true if this parallel array
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef:
* It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true.
* It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and
only if y.eq(x) returns true.
* It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true
and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other properties.
* It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of
x.eq(y) consistently returns true or consistently returns false.
* For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
* null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is
consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they
should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
the object to compare against this object for reference equality.
true if the argument is a reference to the receiver object; false otherwise.
The equals method for arbitrary sequences.
Tests whether every element of this parallel array
Tests whether every element of this parallel array
the type of the elements of that
the other sequence
true if both sequences have the same length and
p(x, y) is true for all corresponding elements x of this parallel array
use corresponds instead
Tests whether a predicate holds for some element of this parallel array
Tests whether a predicate holds for some element of this parallel array
true if p holds for some element, false otherwise
Selects all elements of this parallel array
Selects all elements of this parallel array
a new parallel array
Selects all elements of this parallel array
Selects all elements of this parallel array
a new parallel array
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize method are invoked, as well as the interaction between finalize
and non-local returns and exceptions, are all platform dependent.
Finds some element in the collection for which the predicate holds, if such an element exists.
Finds some element in the collection for which the predicate holds, if such an element exists. The element may not necessarily be the first such element in the iteration order.
If there are multiple elements obeying the predicate, the choice is nondeterministic.
This method will use abort signalling capabilities. This means
that splitters may send and read abort signals.
an option value with the element if such an element exists, or None otherwise
Returns index of the first element satisfying a predicate, or -1.
Returns index of the first element satisfying a predicate, or -1.
Returns index of the last element satisfying a predicate, or -1.
Returns index of the last element satisfying a predicate, or -1.
use lastIndexWhere instead
use head' instead
None if iterable is empty.
None if iterable is empty.
use headOption' instead
[use case] Builds a new collection by applying a function to all elements of this parallel array
Builds a new collection by applying a function to all elements of this parallel array
the element type of the returned collection.
the function to apply to each element.
a new parallel array
Builds a new collection by applying a function to all elements of this parallel array
Builds a new collection by applying a function to all elements of this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the function to apply to each element.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That resulting from applying the given collection-valued function
f to each element of this parallel array
[use case] Converts this parallel array
Converts this parallel array
the type of the elements of each traversable collection.
a new parallel array
Converts this parallel array
Converts this parallel array
the type of the elements of each traversable collection.
an implicit conversion which asserts that the element type of this parallel array
a new parallel array
Folds the elements of this sequence using the specified associative binary operator.
Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.
Note this method has a different signature than the foldLeft
and foldRight methods of the trait Traversable.
The result of folding may only be a supertype of this parallel collection's
type parameter T.
a type parameter for the binary operator, a supertype of T.
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 binary operator that must be associative
the result of applying fold operator op between all the elements and z
Applies a binary operator to a start value and all elements of this parallel array
Applies a binary operator to a start value and all elements of this parallel array
the start value.
the binary operator.
the result of inserting op between consecutive elements of this parallel array
Applies a binary operator to all elements of this parallel array
Applies a binary operator to all elements of this parallel array
the start value.
the binary operator.
the result of inserting op between consecutive elements of this parallel array
Tests whether a predicate holds for all elements of this parallel array
Tests whether a predicate holds for all elements of this parallel array
true if p holds for all elements, false otherwise
Applies a function f to all the elements of parallel array
Applies a function f to all the elements of parallel array
the result type of the function applied to each element, which is always discarded
function applied to each element
The generic builder that builds instances of ParArray at arbitrary element types.
The generic builder that builds instances of ParArray at arbitrary element types.
Returns a representation that corresponds to the dynamic class of the receiver object.
Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
Partitions this parallel array
Partitions this parallel array
the type of keys returned by the discriminator function.
the discriminator function.
A map from keys to parallel array
Partitions elements in fixed size parallel array
Partitions elements in fixed size parallel array
the number of elements per group
An iterator producing parallel array
Iterator#grouped
Tests whether this parallel array
Tests whether this parallel array
true if this collection is known to have finite size, false otherwise.
Hashcodes for ParArray produce a value from the hashcodes of all the elements of the parallel array
Hashcodes for ParArray produce a value from the hashcodes of all the elements of the parallel array
Selects the first element of this parallel array
Selects the first element of this parallel array
the first element of this parallel array
Optionally selects the first element.
Optionally selects the first element.
the first element of this parallel array
[use case] Finds index of first occurrence of some value in this parallel array
Finds index of first occurrence of some value in this parallel array
the element value to search for.
the start index
the index >= from of the first element of this parallel array
Finds index of first occurrence of some value in this parallel array
Finds index of first occurrence of some value in this parallel array
the element value to search for.
the start index
the index >= from of the first element of this parallel array
[use case] Finds index of first occurrence of some value in this parallel array
Finds index of first occurrence of some value in this parallel array
the element value to search for.
the index of the first element of this parallel array
Finds index of first occurrence of some value in this parallel array
Finds index of first occurrence of some value in this parallel array
the element value to search for.
the index of the first element of this parallel array
Finds first index after or at a start index where this parallel array
Finds first index after or at a start index where this parallel array
the sequence to test
the start index
the first index >= from such that the elements of this parallel array
Finds first index where this parallel array
Finds first index where this parallel array
the sequence to test
the first index such that the elements of this parallel array
Finds index of first element satisfying some predicate.
Finds index of first element satisfying some predicate.
Note: may not terminate for infinite-sized collections.
the predicate used to test elements.
the index of the first element of this parallel array
Finds the first element satisfying some predicate.
Finds the first element satisfying some predicate.
This method will use indexFlag signalling capabilities. This means
that splitters may set and read the indexFlag state.
The index flag is initially set to maximum integer value.
the predicate used to test the elements
the starting offset for the search
the index >= from of the first element of this parallel array
Produces the range of all indices of this sequence.
Produces the range of all indices of this sequence.
a Range value from 0 to one less than the length of this parallel array
Selects all elements except the last.
Iterates over the inits of this parallel array
Iterates over the inits of this parallel array
an iterator over all the inits of this parallel array
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
[use case] Computes the multiset intersection between this parallel array
Computes the multiset intersection between this parallel array
the sequence of elements to intersect with.
a new parallel array
Computes the multiset intersection between this parallel array
Computes the multiset intersection between this parallel array
the element type of the returned parallel array
the sequence of elements to intersect with.
a new collection of type That which contains all elements of this parallel array
Tests whether this parallel array
Tests whether this parallel array
the index to test
true if this parallel array
Tests whether this parallel array
Tests whether this parallel array
true if the parallel array
This method is used to test whether the dynamic type of the receiver object is T0.
This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression
1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will
return true. In the latter example, because the type argument is erased as part of compilation it is not
possible to check whether the contents of the list are of the requested typed.
true if the receiver object is an instance of erasure of type T0; false otherwise.
Denotes whether this parallel collection has strict splitters.
Denotes whether this parallel collection has strict splitters.
This is true in general, and specific collection instances may choose to
override this method. Such collections will fail to execute methods
which rely on splitters being strict, i.e. returning a correct value
in the remaining method.
This method helps ensure that such failures occur on method invocations, rather than later on and in unpredictable ways.
Tests whether this parallel array
Tests whether this parallel array
true
Creates a new split iterator used to traverse the elements of this collection.
Creates a new split iterator used to traverse the elements of this collection.
By default, this method is implemented in terms of the protected parallelIterator method.
a split iterator
Selects the last element.
Selects the last element.
The last element of this parallel array
[use case] Finds index of last occurrence of some value in this parallel array
Finds index of last occurrence of some value in this parallel array
the element value to search for.
the end index.
the index <= end of the last element of this parallel array
Finds index of last occurrence of some value in this parallel array
Finds index of last occurrence of some value in this parallel array
the type of the element elem.
the element value to search for.
the end index.
the index <= end of the last element of this parallel array
[use case] Finds index of last occurrence of some value in this parallel array
Finds index of last occurrence of some value in this parallel array
the element value to search for.
the index of the last element of this parallel array
Finds index of last occurrence of some value in this parallel array
Finds index of last occurrence of some value in this parallel array
the type of the element elem.
the element value to search for.
the index of the last element of this parallel array
Finds last index before or at a given end index where this parallel array
Finds last index before or at a given end index where this parallel array
the sequence to test
the end index
the last index <= end such that the elements of this parallel array
Finds last index where this parallel array
Finds last index where this parallel array
the sequence to test
the last index such that the elements of this parallel array
Finds the last element satisfying some predicate.
Finds the last element satisfying some predicate.
This method will use indexFlag signalling capabilities. This means
that splitters may set and read the indexFlag state.
The index flag is initially set to minimum integer value.
the predicate used to test the elements
the maximum offset for the search
the index <= end of the first element of this parallel array
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
Note: will not terminate for infinite-sized collections.
the predicate used to test elements.
the index of the last element of this parallel array
Optionally selects the last element.
Optionally selects the last element.
the last element of this parallel array
The length of the parallel array
Compares the length of this parallel array
Compares the length of this parallel array
the test value that gets compared with the length.
A value x where
x < 0 if this.length < len
x == 0 if this.length == len
x > 0 if this.length > len
The method as implemented here does not call length directly; its running time
is O(length min len) instead of O(length). The method should be overwritten
if computing length is cheap.
Turns this partial function into an plain function returning an Option result.
Turns this partial function into an plain function returning an Option result.
a function that takes an argument x to Some(this(x)) if this
is defined for x, and to None otherwise.
Function.unlift
[use case] Builds a new collection by applying a function to all elements of this parallel array
Builds a new collection by applying a function to all elements of this parallel array
the element type of the returned collection.
the function to apply to each element.
a new parallel array
Builds a new collection by applying a function to all elements of this parallel array
Builds a new collection by applying a function to all elements of this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the function to apply to each element.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That resulting from applying the given function
f to each element of this parallel array
[use case] Finds the largest element.
Finds the largest element.
the largest element of this parallel array
Finds the largest element.
Finds the largest element.
the largest element of this parallel array
[use case] Finds the smallest element.
Finds the smallest element.
the smallest element of this parallel array
Finds the smallest element.
Finds the smallest element.
the smallest element of this parallel array
Displays all elements of this parallel array
Displays all elements of this parallel array
a string representation of this parallel array
Displays all elements of this parallel array
Displays all elements of this parallel array
the separator string.
a string representation of this parallel array
List(1, 2, 3).mkString("|") = "1|2|3"
Displays all elements of this parallel array
Displays all elements of this parallel array
the starting string.
the separator string.
the ending string.
a string representation of this parallel array
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
o.ne(arg0) is the same as !(o.eq(arg0)).
o.ne(arg0) is the same as !(o.eq(arg0)).
the object to compare against this object for reference dis-equality.
false if the argument is not a reference to the receiver object; true otherwise.
The newBuilder operation returns a parallel builder assigned to this collection's fork/join pool.
The newBuilder operation returns a parallel builder assigned to this collection's fork/join pool.
This method forwards the call to newCombiner.
Tests whether the parallel array
Tests whether the parallel array
true if the parallel array
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.
the argument type of the fallback function
the result type of the fallback function
the fallback function
a partial function which has as domain the union of the domains
of this partial function and that. The resulting partial function
takes x to this(x) where this is defined, and to that(x) where it is not.
[use case] Appends an element value to this parallel array
Appends an element value to this parallel array
the target length
the padding value
a new parallel array
Appends an element value to this parallel array
Appends an element value to this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the target length
the padding value
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That consisting of
all elements of this parallel array
Returns a parallel implementation of this collection.
Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying
all the elements. For these collection, par takes linear time. Mutable collections
in this category do not produce a mutable parallel collection that has the same
underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray or mutable.ParHashMap) override this default
behaviour by creating a parallel collection which shares the same underlying dataset.
For these collections, par takes constant or sublinear time.
All parallel collections return a reference to themselves.
a parallel implementation of this collection
The default par implementation uses the combiner provided by this method
to create a new parallel collection.
The default par implementation uses the combiner provided by this method
to create a new parallel collection.
a combiner for the parallel collection of type ParRepr
A more refined version of the iterator found in the ParallelIterable trait,
this iterator can be split into arbitrary subsets of iterators.
A more refined version of the iterator found in the ParallelIterable trait,
this iterator can be split into arbitrary subsets of iterators.
an iterator that can be split into subsets of precise size
Partitions this parallel array
Partitions this parallel array
a pair of parallel array
[use case] Produces a new parallel array
Produces a new parallel array
the index of the first replaced element
the number of elements to drop in the original parallel array
a new parallel array
Produces a new parallel array
Produces a new parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the index of the first replaced element
the replacement sequence
the number of elements to drop in the original parallel array
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new parallel array
Iterates over distinct permutations.
Iterates over distinct permutations.
An Iterator which traverses the distinct permutations of this parallel array
"abb".permutations = Iterator(abb, bab, bba)
Returns the length of the longest prefix whose elements all satisfy some predicate.
Returns the length of the longest prefix whose elements all satisfy some predicate.
Note: may not terminate for infinite-sized collections.
the predicate used to test elements.
the length of the longest prefix of this parallel array
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the product of all elements in this parallel array
Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
an implicit parameter defining a set of numeric operations
which includes the * operator to be used in forming the product.
the product of all elements of this parallel array
returns a projection that can be used to call non-strict filter,
map, and flatMap methods that build projections
of the collection.
returns a projection that can be used to call non-strict filter,
map, and flatMap methods that build projections
of the collection.
use view' instead
Reduces the elements of this sequence using the specified associative binary operator.
Reduces the elements of this sequence using the specified associative binary operator.
The order in which the operations on elements are performed 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.
A type parameter for the binary operator, a supertype of T.
A binary operator that must be associative.
The result of applying reduce operator op between all the elements if the collection is nonempty.
Applies a binary operator to all elements of this parallel array
Applies a binary operator to all elements of this parallel array
the binary operator.
the result of inserting op between consecutive elements of this parallel array
Optionally applies a binary operator to all elements of this parallel array
Optionally applies a binary operator to all elements of this parallel array
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceLeft(op) is this parallel array
Optionally reduces the elements of this sequence using the specified associative binary operator.
Optionally reduces the elements of this sequence using the specified associative binary operator.
The order in which the operations on elements are performed 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.
A type parameter for the binary operator, a supertype of T.
A binary operator that must be associative.
An option value containing result of applying reduce operator op between all
the elements if the collection is nonempty, and None otherwise.
Applies a binary operator to all elements of this parallel array
Applies a binary operator to all elements of this parallel array
the binary operator.
the result of inserting op between consecutive elements of this parallel array
Optionally applies a binary operator to all elements of this parallel array
Optionally applies a binary operator to all elements of this parallel array
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceRight(op) is this parallel array
The collection of type parallel array
The collection of type parallel array
Optionally reuses an existing combiner for better performance.
Optionally reuses an existing combiner for better performance. By default it doesn't - subclasses may override this behaviour.
The provided combiner oldc that can potentially be reused will be either some combiner from the previous computational task, or None if there
was no previous phase (in which case this method must return newc).
The combiner that is the result of the previous task, or None if there was no previous task.
The new, empty combiner that can be used.
Either newc or oldc.
Returns new parallel array
An iterator yielding elements in reversed order.
An iterator yielding elements in reversed order.
Note: will not terminate for infinite-sized collections.
Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.
an iterator yielding the elements of this parallel array
[use case] Builds a new collection by applying a function to all elements of this parallel array
Builds a new collection by applying a function to all elements of this parallel array
the element type of the returned collection.
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.
the function to apply to each element.
a new parallel array
Builds a new collection by applying a function to all elements of this parallel array
Builds a new collection by applying a function to all elements of this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the function to apply to each element.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That resulting from applying the given function
f to each element of this parallel array
use reverseIterator' instead
[use case] Checks if the other iterable collection contains the same elements in the same order as this parallel array
Checks if the other iterable collection contains the same elements in the same order as this parallel array
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
Checks if the other iterable collection contains the same elements in the same order as this parallel array
Checks if the other iterable collection contains the same elements in the same order as this parallel array
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
[use case] Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
neutral element for the operator op
the associative operator for the scan
a new parallel array
Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z may be applied more than once.
element type of the resulting collection
type of the resulting collection
neutral element for the operator op
the associative operator for the scan
combiner factory which provides a combiner
a collection containing the prefix scan of the elements in the original collection
Produces a collection containing cummulative results of applying the operator going left to right.
Produces a collection containing cummulative results of applying the operator going left to right.
Note: will not terminate for infinite-sized collections.
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
collection with intermediate results
Produces a collection containing cummulative results of applying the operator going right to left.
Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.
Note: will not terminate for infinite-sized collections.
Example:
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
collection with intermediate results
Returns the length of the longest segment of elements starting at a given position satisfying some predicate.
Returns the length of the longest segment of elements starting at a given position satisfying some predicate.
This method will use indexFlag signalling capabilities. This means
that splitters may set and read the indexFlag state.
The index flag is initially set to maximum integer value.
the predicate used to test the elements
the starting offset for the search
the length of the longest segment of elements starting at from and
satisfying the predicate
A version of this collection with all of the operations implemented sequentially (i.
A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
a sequential view of the collection.
The size of this parallel array
The size of this parallel array
Selects an interval of elements.
Selects an interval of elements. The returned collection is made up
of all elements x which satisfy the invariant:
from <= indexOf(x) < until
a parallel array
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
the number of elements per group
An iterator producing parallel array
Iterator#sliding
Sorts this ParArray according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.
Sorts this ParArray according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.
the target type of the transformation f, and the type where
the ordering ord is defined.
the transformation function mapping elements
to some other domain B.
the ordering assumed on domain B.
a parallel array
val words = "The quick brown fox jumped over the lazy dog".split(' ')
// this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
words.sortBy(x => (x.length, x.head))
res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
scala.math.Ordering
Note: will not terminate for infinite-sized collections.
Sorts this parallel array
Sorts this parallel array
the comparison function which tests whether its first argument precedes its second argument in the desired ordering.
a parallel array
List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
List("Bob", "John", "Steve", "Tom")
Sorts this parallel array
Sorts this parallel array
the ordering to be used to compare elements.
a parallel array
scala.math.Ordering
Splits this parallel array
Splits this parallel array
the predicate used to test the elements
a pair consisting of the longest prefix of the collection for which all
the elements satisfy pred, and the rest of the collection
Splits this parallel array
Splits this parallel array
the position at which to split.
a pair of parallel array
Tests whether this parallel array
Tests whether this parallel array
the parallel sequence this sequence is being searched for
the starting offset for the search
true if there is a sequence that starting at offset in this sequence, false otherwise
Tests whether this parallel array
Tests whether this parallel array
the sequence to test
true if this collection has that as a prefix, false otherwise.
Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
a string representation which starts the result of toString
applied to this parallel array
[use case] Sums up the elements of this collection.
Sums up the elements of this collection.
the sum of all elements in this parallel array
Sums up the elements of this collection.
Sums up the elements of this collection.
an implicit parameter defining a set of numeric operations
which includes the + operator to be used in forming the sum.
the sum of all elements of this parallel array
Selects all elements except the first.
Iterates over the tails of this parallel array
Iterates over the tails of this parallel array
an iterator over all the tails of this parallel array
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Selects first n elements.
Selects first n elements.
Tt number of elements to take from this parallel array
a parallel array
Selects last n elements.
Selects last n elements.
the number of elements to take
a parallel array
Takes the longest prefix of elements that satisfy the predicate.
Takes the longest prefix of elements that satisfy the predicate.
This method will use indexFlag signalling capabilities. This means
that splitters may set and read the indexFlag state.
The index flag is initially set to maximum integer value.
the predicate used to test the elements
the longest prefix of this parallel array
The underlying collection seen as an instance of ParArray.
The underlying collection seen as an instance of ParArray.
By default this is implemented as the current collection object itself,
but this can be overridden.
Some minimal number of elements after which this collection should be handled sequentially by different processors.
Some minimal number of elements after which this collection should be handled sequentially by different processors.
This method depends on the size of the collection and the parallelism level, which are both specified as arguments.
the size based on which to compute the threshold
the parallelism level based on which to compute the threshold
the maximum number of elements for performing operations sequentially
[use case] Converts this parallel array
Converts this parallel array
an array containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
an array containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
a buffer containing all elements of this parallel array
A conversion from collections of type Repr to ParArray objects.
A conversion from collections of type Repr to ParArray objects.
By default this is implemented as just a cast, but this can be overridden.
Converts this parallel array
Converts this parallel array
an indexed sequence containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
an Iterable containing all elements of this parallel array
Returns an Iterator over the elements in this parallel array
Returns an Iterator over the elements in this parallel array
an Iterator containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
a list containing all elements of this parallel array
[use case] Converts this parallel array
Converts this parallel array
a map of type immutable.Map[T, U]
containing all key/value pairs of type (T, U) of this parallel array
Converts this parallel array
Converts this parallel array
a map containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
a sequence containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
a set containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
a stream containing all elements of this parallel array
Converts this parallel array
Converts this parallel array
a string representation of this collection. By default this
string consists of the stringPrefix of this parallel array
Converts this parallel array
Converts this parallel array
a Traversable containing all elements of this parallel array
Applies a transformation function to all values contained in this sequence.
Transposes this parallel array
Transposes this parallel array
the type of the elements of each traversable collection.
an implicit conversion which asserts that the element type of this parallel array
a two-dimensional parallel array
[use case] Produces a new sequence which contains all elements of this parallel array
Produces a new sequence which contains all elements of this parallel array
the sequence to add.
a new parallel array
Produces a new sequence which contains all elements of this parallel array
Produces a new sequence which contains all elements of this parallel array
the element type of the returned parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the sequence to add.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new collection of type That which contains all elements of this parallel array
Converts this parallel array
Converts this parallel array
an implicit conversion which asserts that the element type of this parallel array
a pair parallel array
Converts this parallel array
Converts this parallel array
a triple parallel array
Replaces element at given index with a new value.
[use case] A copy of this parallel array
A copy of this parallel array
the position of the replacement
the replacing element
a copy of this parallel array
A copy of this parallel array
A copy of this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That]
is found.
the position of the replacement
the replacing element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B.
a new parallel array
Creates a non-strict view of a slice of this parallel array
Creates a non-strict view of a slice of this parallel array
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this parallel array
Creates a non-strict view of this parallel array
Creates a non-strict view of this parallel array
a non-strict view of this parallel array
Creates a non-strict filter of this parallel array
Creates a non-strict filter of this parallel array
the predicate used to test elements.
an object of class WithFilter, which supports
map, flatMap, foreach, and withFilter operations.
All these operations apply to those elements of this parallel array
[use case] Returns a parallel array
Returns a parallel array
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
a new parallel array
Returns a parallel array
Returns a parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type (A1, B) being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That].
is found.
The iterable providing the second half of each result pair
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type (A1, B).
a new collection of type That containing pairs consisting of
corresponding elements of this parallel array
[use case] Returns a parallel array
Returns a parallel array
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
the element to be used to fill up the result if this parallel array
the element to be used to fill up the result if that is shorter than this parallel array
a new parallel array
Returns a parallel array
Returns a parallel array
the iterable providing the second half of each result pair
the element to be used to fill up the result if this parallel array
the element to be used to fill up the result if that is shorter than this parallel array
a new collection of type That containing pairs consisting of
corresponding elements of this parallel array
[use case] Zips this parallel array
Zips this parallel array
A new parallel array
Zips this parallel array
Zips this parallel array
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type (A1, Int) being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That].
is found.
A new collection of type That containing pairs consisting of all elements of this
parallel array
Parallel sequence holding elements in a linear array.
ParArrayis a parallel sequence with a predefined size. The size of the array cannot be changed after it's been created.ParArrayinternally keeps an array containing the elements. This means that bulk operations based on traversal ensure fast access to elements.ParArrayuses 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.