scala.collection.parallel.immutable

ParVector

class ParVector [+T] extends ParSeq[T] with GenericParTemplate[T, ParVector] with ParSeqLike[T, ParVector[T], Vector[T]] with Serializable

Immutable parallel vectors, based on vectors.

This is a base trait for Scala parallel collections. It defines behaviour common to all parallel collections. Concrete parallel collections should inherit this trait and ParIterable if they want to define specific combiner factories.

Parallel operations are implemented with divide and conquer style algorithms that parallelize well. The basic idea is to split the collection into smaller parts until they are small enough to be operated on sequentially.

All of the parallel operations are implemented as tasks within this trait. Tasks rely on the concept of splitters, which extend iterators. Every parallel collection defines:

    def splitter: IterableSplitter[T]

which returns an instance of IterableSplitter[T], which is a subtype of Splitter[T]. Parallel iterators have a method remaining to check the remaining number of elements, and method split which is defined by splitters. Method split divides the splitters iterate over into disjunct subsets:

    def split: Seq[Splitter]

which splits the splitter into a sequence of disjunct subsplitters. This is typically a very fast operation which simply creates wrappers around the receiver collection. This can be repeated recursively.

Method newCombiner produces a new combiner. Combiners are an extension of builders. They provide a method combine which combines two combiners and returns a combiner containing elements of both combiners. This method can be implemented by aggressively copying all the elements into the new combiner or by lazily binding their results. It is recommended to avoid copying all of the elements for performance reasons, although that cost might be negligible depending on the use case. Standard parallel collection combiners avoid copying when merging results, relying either on a two-step lazy construction or specific data-structure properties.

Methods:

    def seq: Sequential
    def par: Repr

produce the sequential or parallel implementation of the collection, respectively. Method par just returns a reference to this parallel collection. Method seq is efficient - it will not copy the elements. Instead, it will create a sequential version of the collection using the same underlying data structure. Note that this is not the case for sequential collections in general - they may copy the elements and produce a different underlying data structure.

The combination of methods toMap, toSeq or toSet along with par and seq is a flexible way to change between different collection types.

The method:

    def threshold(sz: Int, p: Int): Int

provides an estimate on the minimum number of elements the collection has before the splitting stops and depends on the number of elements in the collection. A rule of the thumb is the number of elements divided by 8 times the parallelism level. This method may be overridden in concrete implementations if necessary.

Since this trait extends the Iterable trait, methods like size must also be implemented in concrete collections, while iterator forwards to splitter by default.

Each parallel collection is bound to a specific fork/join pool, on which dormant worker threads are kept. The fork/join pool contains other information such as the parallelism level, that is, the number of processors used. When a collection is created, it is assigned the default fork/join pool found in the scala.parallel package object.

Parallel collections are not necessarily ordered in terms of the foreach operation (see Traversable). Parallel sequences have a well defined order for iterators - creating an iterator and traversing the elements linearly will always yield the same order. However, bulk operations such as foreach, map or filter always occur in undefined orders for all parallel collections.

Existing parallel collection implementations provide strict parallel iterators. Strict parallel iterators are aware of the number of elements they have yet to traverse. It's also possible to provide non-strict parallel iterators, which do not know the number of elements remaining. To do this, the new collection implementation must override isStrictSplitterCollection to false. This will make some operations unavailable.

To create a new parallel collection, extend the ParIterable trait, and implement size, parallelIterator, newCombiner and seq. Having an implicit combiner factory requires extending this trait in addition, as well as providing a companion object, as with regular collections.

Method size is implemented as a constant time operation for parallel collections, and parallel collection operations rely on this assumption.

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

T

the element type of the vector

Source
ParVector.scala
Since

2.9

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. ParVector
  2. Serializable
  3. Serializable
  4. ParSeq
  5. ParIterable
  6. ParSeq
  7. ParSeqLike
  8. ParIterable
  9. ParIterableLike
  10. Parallel
  11. CustomParallelizable
  12. GenericParTemplate
  13. HasNewCombiner
  14. GenSeq
  15. GenIterable
  16. GenTraversable
  17. GenericTraversableTemplate
  18. HasNewBuilder
  19. GenSeqLike
  20. Equals
  21. GenIterableLike
  22. GenTraversableLike
  23. Parallelizable
  24. GenTraversableOnce
  25. AnyRef
  26. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParVector ()

  2. new ParVector (vector: Vector[T])

Type Members

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

    Standard accessor task that iterates over the elements of the collection.

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

    Attributes
    protected[this]
  3. trait BuilderOps [Elem, To] extends AnyRef

  4. class Collect [S, That] extends Transformer[Combiner[S, That], Collect[S, That]]

    Attributes
    protected[this]
  5. class Composite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

    Attributes
    protected[this] abstract
  6. class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

    Attributes
    protected
  7. class CopyToArray [U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]

    Attributes
    protected[this]
  8. class Corresponds [S] extends Accessor[Boolean, Corresponds[S]]

    Attributes
    protected[this]
  9. class Count extends Accessor[Int, Count]

    Attributes
    protected[this]
  10. class CreateScanTree [U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

    Attributes
    protected[this]
  11. class Drop [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

    Attributes
    protected[this]
  12. class Elements extends ParIterator with BufferedIterator[T]

    Used to iterate elements using indices

  13. class Exists extends Accessor[Boolean, Exists]

    Attributes
    protected[this]
  14. class Filter [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

    Attributes
    protected[this]
  15. class FilterNot [U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

    Attributes
    protected[this]
  16. class Find [U >: T] extends Accessor[Option[U], Find[U]]

    Attributes
    protected[this]
  17. class FlatMap [S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

    Attributes
    protected[this]
  18. class Fold [U >: T] extends Accessor[U, Fold[U]]

    Attributes
    protected[this]
  19. class Forall extends Accessor[Boolean, Forall]

    Attributes
    protected[this]
  20. class Foreach [S] extends Accessor[Unit, Foreach[S]]

    Attributes
    protected[this]
  21. class FromScanTree [U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

    Attributes
    protected[this]
  22. class GroupBy [K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

    Attributes
    protected[this]
  23. class IndexWhere extends Accessor[Int, IndexWhere]

    Attributes
    protected[this]
  24. class LastIndexWhere extends Accessor[Int, LastIndexWhere]

    Attributes
    protected[this]
  25. class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]

    Attributes
    protected[this]
  26. class Max [U >: T] extends Accessor[Option[U], Max[U]]

    Attributes
    protected[this]
  27. class Min [U >: T] extends Accessor[Option[U], Min[U]]

    Attributes
    protected[this]
  28. trait NonDivisible [R] extends NonDivisibleTask[R, NonDivisible[R]]

    Attributes
    protected[this]
  29. trait NonDivisibleTask [R, Tp] extends StrictSplitterCheckTask[R, Tp]

    Attributes
    protected[this]
  30. class ParComposite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Performs two tasks in parallel, and waits for both to finish.

  31. trait ParIterator extends SeqSplitter[T] with ParIterator

    An iterator that can be split into arbitrary subsets of iterators.

  32. class ParVectorIterator extends VectorIterator[T] with ParIterator

  33. class Partition [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

    Attributes
    protected[this]
  34. class Product [U >: T] extends Accessor[U, Product[U]]

    Attributes
    protected[this]
  35. class Reduce [U >: T] extends Accessor[Option[U], Reduce[U]]

    Attributes
    protected[this]
  36. class ResultMapping [R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

    Attributes
    protected[this] abstract
  37. class Reverse [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

    Attributes
    protected[this]
  38. class ReverseMap [S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

    Attributes
    protected[this]
  39. type SCPI = SignalContextPassingIterator[ParVectorIterator]

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

    Definition Classes
    ParIterableLike
  41. class SameElements [U >: T] extends Accessor[Boolean, SameElements[U]]

    Attributes
    protected[this]
  42. 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 Product with Serializable

    Attributes
    protected[this]
  43. case class ScanNode [U >: T] (left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with Product with Serializable

    Attributes
    protected[this]
  44. trait ScanTree [U >: T] extends AnyRef

    Attributes
    protected[this]
  45. class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

    Attributes
    protected[this]
  46. class SeqComposite [FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR, _], Second <: ParIterableLike.this.StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Sequentially performs one task after another.

  47. trait SignalContextPassingIterator [+IterRepr <: ParIterator] extends ParIterator with SignalContextPassingIterator[IterRepr]

    A stackable modification that ensures signal contexts get passed along the iterators.

  48. trait SignallingOps [PI <: DelegatedSignalling] extends AnyRef

  49. class Slice [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

    Attributes
    protected[this]
  50. class Span [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]

    Attributes
    protected[this]
  51. class SplitAt [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]

    Attributes
    protected[this]
  52. trait StrictSplitterCheckTask [R, Tp] extends Task[R, Tp]

    Attributes
    protected
  53. class Sum [U >: T] extends Accessor[U, Sum[U]]

    Attributes
    protected[this]
  54. type SuperParIterator = IterableSplitter[T]

    Definition Classes
    ParSeqLike
  55. class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

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

    Attributes
    protected[this]
  57. trait TaskOps [R, Tp] extends AnyRef

  58. class ToParCollection [U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

    Attributes
    protected[this]
  59. class ToParMap [K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    Attributes
    protected[this]
  60. trait Transformer [R, Tp] extends Accessor[R, Tp] with Transformer[R, Tp]

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

    Attributes
    protected[this]
  62. class Zip [U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

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

    Attributes
    protected[this]

Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  2. def != (arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them.

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ [B] (that: GenTraversableOnce[B]): immutable.ParVector[B]

    [use case] Concatenates this immutable parallel vector with the elements of a traversable collection.

    [use case]

    Concatenates this immutable parallel vector with the elements of a traversable collection.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this immutable parallel vector followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  5. def ++ [U >: T, That] (that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

    Concatenates this immutable parallel vector with the elements of a traversable collection.

    Concatenates this immutable parallel vector with the elements of a traversable collection.

    That

    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.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this immutable parallel vector followed by all elements of that.

    Definition Classes
    ParIterableLike → GenTraversableLike
  6. def +: (elem: T): immutable.ParVector[T]

    [use case] Prepends an element to this immutable parallel vector

    [use case]

    Prepends an element to this immutable parallel vector

    elem

    the prepended element

    returns

    a new collection of type That consisting of elem followed by all elements of this immutable parallel vector.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  7. def +: [U >: T, That] (elem: U)(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

    Prepends an element to this immutable parallel vector

    Prepends an element to this immutable parallel vector

    That

    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.

    elem

    the prepended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That consisting of elem followed by all elements of this immutable parallel vector.

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

    Applies a binary operator to a start value and all elements of this immutable parallel vector, going left to right.

    Applies a binary operator to a start value and all elements of this immutable parallel vector, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft 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.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable parallel vector, going left to right with the start value z on the left:

                op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  9. def /:\ [A1 >: T] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Definition Classes
    GenTraversableOnce
  10. def :+ (elem: T): immutable.ParVector[T]

    [use case] Appends an element to this immutable parallel vector

    [use case]

    Appends an element to this immutable parallel vector

    Note: will not terminate for infinite-sized collections.

    elem

    the appended element

    returns

    a new collection of type That consisting of all elements of this immutable parallel vector followed by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  11. def :+ [U >: T, That] (elem: U)(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

    Appends an element to this immutable parallel vector

    Appends an element to this immutable parallel vector

    Note: will not terminate for infinite-sized collections.

    That

    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.

    elem

    the appended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That consisting of all elements of this immutable parallel vector followed by elem.

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

    Applies a binary operator to all elements of this immutable parallel vector and a start value, going right to left.

    Applies a binary operator to all elements of this immutable parallel vector 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.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this immutable parallel vector, going right to left with the start value z on the right:

                op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  13. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  14. def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    Attributes
    final
    Definition Classes
    Any
  15. def aggregate [S] (z: S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the 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).

    S

    the type of accumulated results

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    ParIterableLikeGenTraversableOnce
  16. def apply (idx: Int): T

    Selects an element by its index in the immutable parallel vector.

    Selects an element by its index in the immutable parallel vector.

    idx

    The index to select.

    returns

    the element of this immutable parallel vector at index idx, where 0 indicates the first element.

    Definition Classes
    ParVectorParSeq → GenSeqLike
  17. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    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 type.

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  18. def bf2seq [S, That] (bf: CanBuildFrom[ParVector[T], S, That]): CanBuildFrom[Vector[T], S, That]

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

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

    Definition Classes
    ParIterableLike
  21. def cbfactory : () ⇒ Combiner[T, ParVector[T]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. def clone (): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  23. def collect [B] (pf: PartialFunction[T, B]): immutable.ParVector[B]

    [use case] Builds a new collection by applying a partial function to all elements of this immutable parallel vector on which the function is defined.

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the immutable parallel vector.

    returns

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  24. def collect [S, That] (pf: PartialFunction[T, S])(implicit bf: CanBuildFrom[ParVector[T], S, That]): That

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

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

    That

    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.

    pf

    the partial function which filters and maps the immutable parallel vector.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    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.

    Definition Classes
    ParIterableLike → GenTraversableLike
  25. def companion : ParVector

    The factory companion object that builds instances of class immutable.

    The factory companion object that builds instances of class immutable.ParVector. (or its Iterable superclass where class immutable.ParVector is not a Seq.)

    Definition Classes
    ParVectorParSeqParIterableParSeqParIterableGenericParTemplateGenSeqGenIterableGenTraversableGenericTraversableTemplate
  26. def copyToArray [U >: T] (xs: Array[U], start: Int, len: Int): Unit

    Definition Classes
    ParIterableLikeGenTraversableOnce
  27. def copyToArray (xs: Array[T], start: Int): Unit

    [use case] Copies values of this immutable parallel vector to an array.

    [use case]

    Copies values of this immutable parallel vector to an array. Fills the given array xs with values of this immutable parallel vector, beginning at index start. Copying will stop once either the end of the current immutable parallel vector is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  28. def copyToArray [U >: T] (xs: Array[U], start: Int): Unit

    Copies values of this immutable parallel vector to an array.

    Copies values of this immutable parallel vector to an array. Fills the given array xs with values of this immutable parallel vector, beginning at index start. Copying will stop once either the end of the current immutable parallel vector is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  29. def copyToArray (xs: Array[T]): Unit

    [use case] Copies values of this immutable parallel vector to an array.

    [use case]

    Copies values of this immutable parallel vector to an array. Fills the given array xs with values of this immutable parallel vector. Copying will stop once either the end of the current immutable parallel vector is reached, or the end of the array is reached.

    xs

    the array to fill.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  30. def copyToArray [U >: T] (xs: Array[U]): Unit

    Copies values of this immutable parallel vector to an array.

    Copies values of this immutable parallel vector to an array. Fills the given array xs with values of this immutable parallel vector. Copying will stop once either the end of the current immutable parallel vector is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  31. def corresponds [S] (that: GenSeq[S])(p: (T, S) ⇒ Boolean): Boolean

    Tests whether every element of this immutable parallel vector relates to the corresponding element of another parallel sequence by satisfying a test predicate.

    Tests whether every element of this immutable parallel vector relates to the corresponding element of another parallel sequence by satisfying a test predicate.

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

    S

    the type of the elements of that

    that

    the other parallel sequence

    p

    the test predicate, which relates elements from both sequences

    returns

    true if both parallel sequences have the same length and p(x, y) is true for all corresponding elements x of this immutable parallel vector and y of that, otherwise false

    Definition Classes
    ParSeqLike → GenSeqLike
  32. def count (p: (T) ⇒ Boolean): Int

    Counts the number of elements in the immutable parallel vector which satisfy a predicate.

    Counts the number of elements in the immutable parallel vector which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  33. def debugBuffer : ArrayBuffer[String]

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

    Attributes
    protected implicit
    Definition Classes
    ParIterableLike
  35. def diff (that: GenSeq[T]): immutable.ParVector[T]

    [use case] Computes the multiset difference between this immutable parallel vector and another sequence.

    [use case]

    Computes the multiset difference between this immutable parallel vector and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this immutable parallel vector except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  36. def diff [U >: T] (that: GenSeq[U]): ParVector[T]

    Computes the multiset difference between this immutable parallel vector and another sequence.

    Computes the multiset difference between this immutable parallel vector and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this immutable parallel vector except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

    Definition Classes
    ParSeqLike → GenSeqLike
  37. def distinct : ParVector[T]

    Builds a new immutable parallel vector from this immutable parallel vector without any duplicate elements.

    Builds a new immutable parallel vector from this immutable parallel vector without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  38. def down (p: scala.collection.parallel.IterableSplitter[_]): SeqSplitter[T]

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

    Selects all elements except first n ones.

    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 immutable parallel vector.

    returns

    a immutable parallel vector consisting of all elements of this immutable parallel vector except the first n ones, or else the empty immutable parallel vector, if this immutable parallel vector has less than n elements.

    Definition Classes
    ParIterableLike → GenTraversableLike
  40. def dropWhile (pred: (T) ⇒ Boolean): ParVector[T]

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

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

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

    pred

    the predicate used to test the elements

    returns

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

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

    Tests whether this immutable parallel vector ends with the given parallel sequence.

    Tests whether this immutable parallel vector ends with the given parallel sequence.

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

    S

    the type of the elements of that sequence

    that

    the sequence to test

    returns

    true if this immutable parallel vector has that as a suffix, false otherwise

    Definition Classes
    ParSeqLike → GenSeqLike
  42. def eq (arg0: AnyRef): Boolean

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional 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).

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    Attributes
    final
    Definition Classes
    AnyRef
  43. def equals (that: Any): Boolean

    The equals method for arbitrary sequences.

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

    that

    The object to compare the sequence to

    returns

    true if that is a sequence that has the same elements as this sequence in the same order, false otherwise

    Definition Classes
    GenSeqLike → Equals → AnyRef → Any
  44. def exists (pred: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some element of this immutable parallel vector.

    Tests whether a predicate holds for some element of this immutable parallel vector.

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

    returns

    true if p holds for some element, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  45. def filter (pred: (T) ⇒ Boolean): ParVector[T]

    Selects all elements of this immutable parallel vector which satisfy a predicate.

    Selects all elements of this immutable parallel vector which satisfy a predicate.

    returns

    a new immutable parallel vector consisting of all elements of this immutable parallel vector that satisfy the given predicate p. Their order may not be preserved.

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

    Selects all elements of this immutable parallel vector which do not satisfy a predicate.

    Selects all elements of this immutable parallel vector which do not satisfy a predicate.

    returns

    a new immutable parallel vector consisting of all elements of this immutable parallel vector that do not satisfy the given predicate p. Their order may not be preserved.

    Definition Classes
    ParIterableLike → GenTraversableLike
  47. def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  48. def find (pred: (T) ⇒ Boolean): Option[T]

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

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

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

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

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  49. def flatMap [B] (f: (T) ⇒ GenTraversableOnce[B]): immutable.ParVector[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable parallel vector and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable parallel vector and concatenating the results.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this immutable parallel vector and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  50. def flatMap [S, That] (f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParVector[T], S, That]): That

    Builds a new collection by applying a function to all elements of this immutable parallel vector and concatenating the results.

    Builds a new collection by applying a function to all elements of this immutable parallel vector and concatenating the results.

    That

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this immutable parallel vector and concatenating the results.

    Definition Classes
    ParIterableLike → GenTraversableLike
  51. def flatten [B] : immutable.ParVector[B]

    [use case] Converts this immutable parallel vector of traversable collections into a immutable parallel vector in which all element collections are concatenated.

    [use case]

    Converts this immutable parallel vector of traversable collections into a immutable parallel vector in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

    a new immutable parallel vector resulting from concatenating all element immutable parallel vectors.

    Attributes
    abstract
    Definition Classes
    GenericTraversableTemplate
  52. def flatten [B] (implicit asTraversable: (T) ⇒ TraversableOnce[B]): ParVector[B]

    Converts this immutable parallel vector of traversable collections into a immutable parallel vector in which all element collections are concatenated.

    Converts this immutable parallel vector of traversable collections into a immutable parallel vector in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this immutable parallel vector is a Traversable.

    returns

    a new immutable parallel vector resulting from concatenating all element immutable parallel vectors.

    Definition Classes
    GenericTraversableTemplate
  53. def fold [U >: T] (z: U)(op: (U, U) ⇒ U): U

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

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

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

    U

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  54. def foldLeft [S] (z: S)(op: (S, T) ⇒ S): S

    Applies a binary operator to a start value and all elements of this immutable parallel vector, going left to right.

    Applies a binary operator to a start value and all elements of this immutable parallel vector, 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 immutable parallel vector, going left to right with the start value z on the left:

                op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  55. def foldRight [S] (z: S)(op: (T, S) ⇒ S): S

    Applies a binary operator to all elements of this immutable parallel vector and a start value, going right to left.

    Applies a binary operator to all elements of this immutable parallel vector 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 immutable parallel vector, going right to left with the start value z on the right:

                op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  56. def forall (pred: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this immutable parallel vector.

    Tests whether a predicate holds for all elements of this immutable parallel vector.

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

    returns

    true if p holds for all elements, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  57. def foreach [U] (f: (T) ⇒ U): Unit

    Applies a function f to all the elements of immutable parallel vector in a sequential order.

    Applies a function f to all the elements of immutable parallel vector in a sequential 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
  58. def genericBuilder [B] : Combiner[B, ParVector[B]]

    The generic builder that builds instances of immutable.

    The generic builder that builds instances of immutable.ParVector at arbitrary element types.

    Definition Classes
    GenericParTemplateGenericTraversableTemplate
  59. def genericCombiner [B] : Combiner[B, ParVector[B]]

    Definition Classes
    GenericParTemplate
  60. def getClass (): java.lang.Class[_ <: java.lang.Object]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Attributes
    final
    Definition Classes
    AnyRef
  61. def groupBy [K] (f: (T) ⇒ K): ParMap[K, ParVector[T]]

    Partitions this immutable parallel vector into a map of immutable parallel vectors according to some discriminator function.

    Partitions this immutable parallel vector into a map of immutable parallel vectors 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 immutable parallel vector.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to immutable parallel vectors such that the following invariant holds:

                    (xs partition f)(k) = xs filter (x => f(x) == k)
    

    That is, every key k is bound to a immutable parallel vector of those elements x for which f(x) equals k.

    Definition Classes
    ParIterableLike → GenTraversableLike
  62. def hasDefiniteSize : Boolean

    Definition Classes
    ParIterableLikeGenTraversableOnce
  63. def hashCode (): Int

    Hashcodes for immutable.

    Hashcodes for immutable.ParVector produce a value from the hashcodes of all the elements of the immutable parallel vector.

    returns

    the hash code value for this object.

    Definition Classes
    GenSeqLike → AnyRef → Any
  64. def head : T

    Definition Classes
    GenIterableLike → GenTraversableLike
  65. def indexOf (elem: T, from: Int): Int

    [use case] Finds index of first occurrence of some value in this immutable parallel vector after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this immutable parallel vector after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  66. def indexOf [B >: T] (elem: B, from: Int): Int

    Finds index of first occurrence of some value in this immutable parallel vector after or at some start index.

    Finds index of first occurrence of some value in this immutable parallel vector after or at some start index.

    Note: may not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  67. def indexOf (elem: T): Int

    [use case] Finds index of first occurrence of some value in this immutable parallel vector.

    [use case]

    Finds index of first occurrence of some value in this immutable parallel vector.

    elem

    the element value to search for.

    returns

    the index of the first element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  68. def indexOf [B >: T] (elem: B): Int

    Finds index of first occurrence of some value in this immutable parallel vector.

    Finds index of first occurrence of some value in this immutable parallel vector.

    Note: may not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the first element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  69. def indexWhere (p: (T) ⇒ Boolean, from: Int): Int

    Finds the first element satisfying some predicate.

    Finds the first element satisfying some predicate.

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  70. def indexWhere (p: (T) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    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 immutable parallel vector that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  71. def intersect (that: Seq[T]): immutable.ParVector[T]

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

    [use case]

    Computes the multiset intersection between this immutable parallel vector and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

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

    Attributes
    abstract
    Definition Classes
    ParSeqLike
  72. def intersect [U >: T] (that: GenSeq[U]): ParVector[T]

    Computes the multiset intersection between this immutable parallel vector and another sequence.

    Computes the multiset intersection between this immutable parallel vector and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  73. def isDefinedAt (idx: Int): Boolean

    Tests whether this immutable parallel vector contains given index.

    Tests whether this immutable parallel vector 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 immutable parallel vector contains an element at position idx, false otherwise.

    Definition Classes
    GenSeqLike
  74. def isEmpty : Boolean

    Tests whether the immutable parallel vector is empty.

    Tests whether the immutable parallel vector is empty.

    returns

    true if the immutable parallel vector contains no elements, false otherwise.

    Definition Classes
    GenIterableLike → GenTraversableOnce
  75. def isInstanceOf [T0] : Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the 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 specified type.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    Attributes
    final
    Definition Classes
    Any
  76. def isStrictSplitterCollection : Boolean

    Denotes whether this parallel collection has strict splitters.

    Denotes whether this parallel collection has strict splitters.

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

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

    Definition Classes
    ParIterableLike
  77. def isTraversableAgain : Boolean

    Tests whether this immutable parallel vector can be repeatedly traversed.

    Tests whether this immutable parallel vector can be repeatedly traversed.

    returns

    true

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  78. def iterator : PreciseSplitter[T]

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

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

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

    returns

    a split iterator

    Definition Classes
    ParSeqLikeParIterableLike → GenIterableLike
  79. def lastIndexOf (elem: T, end: Int): Int

    [use case] Finds index of last occurrence of some value in this immutable parallel vector before or at a given end index.

    [use case]

    Finds index of last occurrence of some value in this immutable parallel vector 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 immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  80. def lastIndexOf [B >: T] (elem: B, end: Int): Int

    Finds index of last occurrence of some value in this immutable parallel vector before or at a given end index.

    Finds index of last occurrence of some value in this immutable parallel vector before or at a given end index.

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  81. def lastIndexOf (elem: T): Int

    [use case] Finds index of last occurrence of some value in this immutable parallel vector.

    [use case]

    Finds index of last occurrence of some value in this immutable parallel vector.

    elem

    the element value to search for.

    returns

    the index of the last element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  82. def lastIndexOf [B >: T] (elem: B): Int

    Finds index of last occurrence of some value in this immutable parallel vector.

    Finds index of last occurrence of some value in this immutable parallel vector.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the last element of this immutable parallel vector that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  83. def lastIndexWhere (p: (T) ⇒ Boolean, end: Int): Int

    Finds the last element satisfying some predicate.

    Finds the last element satisfying some predicate.

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

    The index flag is initially set to minimum integer value.

    p

    the predicate used to test the elements

    end

    the maximum offset for the search

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  84. def lastIndexWhere (p: (T) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    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 immutable parallel vector that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  85. def length : Int

    The length of the immutable parallel vector.

    The length of the immutable parallel vector.

    Note: will not terminate for infinite-sized collections.

    Note: xs.length and xs.size yield the same result.

    returns

    the number of elements in this immutable parallel vector.

    Definition Classes
    ParVector → GenSeqLike
  86. def map [B] (f: (T) ⇒ B): immutable.ParVector[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable parallel vector.

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this immutable parallel vector and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  87. def map [S, That] (f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParVector[T], S, That]): That

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

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

    That

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this immutable parallel vector and collecting the results.

    Definition Classes
    ParIterableLike → GenTraversableLike
  88. def max : T

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this immutable parallel vector with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  89. def max [U >: T] (implicit ord: Ordering[U]): T

    Finds the largest element.

    Finds the largest element.

    returns

    the largest element of this immutable parallel vector with respect to the ordering cmp.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  90. def maxBy [S] (f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

    Definition Classes
    ParIterableLikeGenTraversableOnce
  91. def min : T

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this immutable parallel vector with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  92. def min [U >: T] (implicit ord: Ordering[U]): T

    Finds the smallest element.

    Finds the smallest element.

    returns

    the smallest element of this immutable parallel vector with respect to the ordering cmp.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  93. def minBy [S] (f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

    Definition Classes
    ParIterableLikeGenTraversableOnce
  94. def mkString : String

    Displays all elements of this immutable parallel vector in a string.

    Displays all elements of this immutable parallel vector in a string.

    returns

    a string representation of this immutable parallel vector. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable parallel vector follow each other without any separator string.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  95. def mkString (sep: String): String

    Displays all elements of this immutable parallel vector in a string using a separator string.

    Displays all elements of this immutable parallel vector in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this immutable parallel vector. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable parallel vector are separated by the string sep.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

    Displays all elements of this immutable parallel vector in a string using start, end, and separator strings.

    Displays all elements of this immutable parallel vector 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 immutable parallel vector. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this immutable parallel vector are separated by the string sep.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  97. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

    true if the argument is not a reference to the receiver object; false otherwise.

    Attributes
    final
    Definition Classes
    AnyRef
  98. def newBuilder : Builder[T, ParVector[T]]

    The builder that builds instances of type immutable.

    The builder that builds instances of type immutable.ParVector[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateGenericTraversableTemplateHasNewBuilder
  99. def newCombiner : Combiner[T, ParVector[T]]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateHasNewCombiner
  100. def nonEmpty : Boolean

    Tests whether the immutable parallel vector is not empty.

    Tests whether the immutable parallel vector is not empty.

    returns

    true if the immutable parallel vector contains at least one element, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  101. def notify (): Unit

    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.

    Attributes
    final
    Definition Classes
    AnyRef
  102. def notifyAll (): Unit

    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.

    Attributes
    final
    Definition Classes
    AnyRef
  103. def padTo (len: Int, elem: T): immutable.ParVector[T]

    [use case] Appends an element value to this immutable parallel vector until a given target length is reached.

    [use case]

    Appends an element value to this immutable parallel vector until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

    a new collection of type That consisting of all elements of this immutable parallel vector followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  104. def padTo [U >: T, That] (len: Int, elem: U)(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

    Appends an element value to this immutable parallel vector until a given target length is reached.

    Appends an element value to this immutable parallel vector until a given target length is reached.

    That

    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.

    len

    the target length

    elem

    the padding value

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That consisting of all elements of this immutable parallel vector followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    Definition Classes
    ParSeqLike → GenSeqLike
  105. def par : ParVector[T]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

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

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

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    ParIterableLikeCustomParallelizableParallelizable
  106. def parCombiner : Combiner[T, ParVector[T]]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizableParallelizable
  107. def partition (pred: (T) ⇒ Boolean): (ParVector[T], ParVector[T])

    Partitions this immutable parallel vector in two immutable parallel vectors according to a predicate.

    Partitions this immutable parallel vector in two immutable parallel vectors according to a predicate.

    returns

    a pair of immutable parallel vectors: the first immutable parallel vector consists of all elements that satisfy the predicate p and the second immutable parallel vector consists of all elements that don't. The relative order of the elements in the resulting immutable parallel vectors may not be preserved.

    Definition Classes
    ParIterableLike → GenTraversableLike
  108. def patch (from: Int, that: GenSeq[T], replaced: Int): immutable.ParVector[T]

    [use case] Produces a new immutable parallel vector where a slice of elements in this immutable parallel vector is replaced by another sequence.

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original immutable parallel vector

    returns

    a new immutable parallel vector consisting of all elements of this immutable parallel vector except that replaced elements starting from from are replaced by patch.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  109. def patch [U >: T, That] (from: Int, patch: GenSeq[U], replaced: Int)(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

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

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

    That

    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.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original immutable parallel vector

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new immutable parallel vector consisting of all elements of this immutable parallel vector except that replaced elements starting from from are replaced by patch.

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

    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.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this immutable parallel vector such that every element of the segment satisfies the predicate p.

    Definition Classes
    GenSeqLike
  111. def product : T

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements of this immutable parallel vector with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  112. def product [U >: T] (implicit num: Numeric[U]): U

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this immutable parallel vector with respect to the * operator in num.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  113. def reduce [U >: T] (op: (U, U) ⇒ U): U

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  114. def reduceLeft [U >: T] (op: (U, T) ⇒ U): U

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

    Optionally applies a binary operator to all elements of this immutable parallel vector, going left to right.

    Optionally applies a binary operator to all elements of this immutable parallel vector, 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) is this immutable parallel vector is nonempty, None otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  116. def reduceOption [U >: T] (op: (U, U) ⇒ U): Option[U]

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  117. def reduceRight [U >: T] (op: (T, U) ⇒ U): U

    Applies a binary operator to all elements of this immutable parallel vector, going right to left.

    Applies a binary operator to all elements of this immutable parallel vector, 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 immutable parallel vector, going right to left:

                op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  118. def reduceRightOption [U >: T] (op: (T, U) ⇒ U): Option[U]

    Optionally applies a binary operator to all elements of this immutable parallel vector, going right to left.

    Optionally applies a binary operator to all elements of this immutable parallel vector, 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) is this immutable parallel vector is nonempty, None otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  119. def repr : ParVector[T]

    Definition Classes
    ParIterableLike → GenTraversableLike
  120. def reuse [S, That] (oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Optionally reuses an existing combiner for better performance.

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

    oldc

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

    newc

    The new, empty combiner that can be used.

    returns

    Either newc or oldc.

    Attributes
    protected
    Definition Classes
    ParIterableLike
  121. def reverse : ParVector[T]

    Returns new immutable parallel vector wih elements in reversed order.

    Returns new immutable parallel vector wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

    A new immutable parallel vector with all elements of this immutable parallel vector in reversed order.

    Definition Classes
    ParSeqLike → GenSeqLike
  122. def reverseMap [B] (f: (T) ⇒ B): immutable.ParVector[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable parallel vector and collecting the results in reversed order.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable parallel vector and collecting the results in reversed order.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this immutable parallel vector and collecting the results in reversed order.

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  123. def reverseMap [S, That] (f: (T) ⇒ S)(implicit bf: CanBuildFrom[ParVector[T], S, That]): That

    Builds a new collection by applying a function to all elements of this immutable parallel vector and collecting the results in reversed order.

    Builds a new collection by applying a function to all elements of this immutable parallel vector 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.

    That

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this immutable parallel vector and collecting the results in reversed order.

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

    [use case] Checks if the other iterable collection contains the same elements in the same order as this immutable parallel vector.

    [use case]

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

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  125. def sameElements [U >: T] (that: GenIterable[U]): Boolean

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

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

    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
    ParSeqLikeParIterableLike → GenIterableLike
  126. def scan (z: T)(op: (T, T) ⇒ T): immutable.ParVector[T]

    [use case] Computes a prefix scan of the elements of the collection.

    [use case]

    Computes a prefix scan of the elements of the collection.

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a collection containing the prefix scan of the elements in the original collection

    Attributes
    abstract
    Definition Classes
    ParIterableLike
  127. def scan [U >: T, That] (z: U)(op: (U, U) ⇒ U)(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

    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.

    U

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a collection containing the prefix scan of the elements in the original collection

    Definition Classes
    ParIterableLike → GenTraversableLike
  128. def scanBlockSize : Int

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

    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.

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

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

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

    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.

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

    Example:

       List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    
    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    ParIterableLike → GenTraversableLike
  131. def segmentLength (p: (T) ⇒ Boolean, from: Int): Int

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

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

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLike → GenSeqLike
  132. def seq : Vector[T]

  133. def sequentially [S, That <: Parallel] (b: (Vector[T]) ⇒ Parallelizable[S, That]): ParVector[T]

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

    The size of this immutable parallel vector.

    The size of this immutable parallel vector.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this immutable parallel vector.

    Definition Classes
    ParSeqLike → GenTraversableLike → GenTraversableOnce
  135. def slice (unc_from: Int, unc_until: Int): ParVector[T]

    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
    

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

    returns

    a immutable parallel vector containing the elements greater than or equal to index from extending up to (but not including) index until of this immutable parallel vector.

    Definition Classes
    ParIterableLike → GenTraversableLike
  136. def span (pred: (T) ⇒ Boolean): (ParVector[T], ParVector[T])

    Splits this immutable parallel vector into a prefix/suffix pair according to a predicate.

    Splits this immutable parallel vector into a prefix/suffix pair according to a predicate.

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

    pred

    the predicate used to test the elements

    returns

    a pair consisting of the longest prefix of the collection for which all the elements satisfy pred, and the rest of the collection

    Definition Classes
    ParIterableLike → GenTraversableLike
  137. def splitAt (n: Int): (ParVector[T], ParVector[T])

    Splits this immutable parallel vector into two at a given position.

    Splits this immutable parallel vector 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 immutable parallel vectors consisting of the first n elements of this immutable parallel vector, and the other elements.

    Definition Classes
    ParIterableLike → GenTraversableLike
  138. def splitter : SeqSplitter[T]

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

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

    returns

    an iterator that can be split into subsets of precise size

    Definition Classes
    ParVectorParSeqLikeParIterableLike
  139. def startsWith [S] (that: GenSeq[S], offset: Int): Boolean

    Tests whether this immutable parallel vector contains the given sequence at a given index.

    Tests whether this immutable parallel vector 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.

    that

    the parallel sequence this sequence is being searched for

    offset

    the starting offset for the search

    returns

    true if there is a sequence that starting at offset in this sequence, false otherwise

    Definition Classes
    ParSeqLike → GenSeqLike
  140. def startsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  141. def startsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this immutable parallel vector starts with the given sequence.

    Tests whether this immutable parallel vector starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise.

    Definition Classes
    GenSeqLike
  142. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this immutable parallel vector. By default the string prefix is the simple name of the collection class immutable parallel vector.

    Definition Classes
    ParSeqParIterable → GenTraversableLike
  143. def sum : T

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements of this immutable parallel vector with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  144. def sum [U >: T] (implicit num: Numeric[U]): U

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this immutable parallel vector with respect to the + operator in num.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  145. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  146. def tail : ParVector[T]

    Selects all elements except the first.

    Selects all elements except the first.

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

    returns

    a immutable parallel vector consisting of all elements of this immutable parallel vector except the first one.

    Definition Classes
    GenTraversableLike
  147. def take (n: Int): ParVector[T]

    Selects first n elements.

    Selects first n elements.

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

    n

    Tt number of elements to take from this immutable parallel vector.

    returns

    a immutable parallel vector consisting only of the first n elements of this immutable parallel vector, or else the whole immutable parallel vector, if it has less than n elements.

    Definition Classes
    ParIterableLike → GenTraversableLike
  148. def takeWhile (pred: (T) ⇒ Boolean): ParVector[T]

    Takes the longest prefix of elements that satisfy the predicate.

    Takes the longest prefix of elements that satisfy the predicate.

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

    pred

    the predicate used to test the elements

    returns

    the longest prefix of this immutable parallel vector of elements that satisy the predicate pred

    Definition Classes
    ParIterableLike → GenTraversableLike
  149. implicit def task2ops [R, Tp] (tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

    Attributes
    protected implicit
    Definition Classes
    ParIterableLike
  150. def threshold (sz: Int, p: Int): Int

    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.

    sz

    the size based on which to compute the threshold

    p

    the parallelism level based on which to compute the threshold

    returns

    the maximum number of elements for performing operations sequentially

    Definition Classes
    ParIterableLike
  151. def toArray : Array[T]

    [use case] Converts this immutable parallel vector to an array.

    [use case]

    Converts this immutable parallel vector to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this immutable parallel vector.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  152. def toArray [U >: T] (implicit arg0: ClassManifest[U]): Array[U]

    Converts this immutable parallel vector to an array.

    Converts this immutable parallel vector to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  153. def toBuffer [U >: T] : Buffer[U]

    Converts this immutable parallel vector to a mutable buffer.

    Converts this immutable parallel vector to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  154. def toIndexedSeq [U >: T] : IndexedSeq[U]

    Converts this immutable parallel vector to an indexed sequence.

    Converts this immutable parallel vector to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  155. def toIterable : ParIterable[T]

    Converts this immutable parallel vector to an iterable collection.

    Converts this immutable parallel vector 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 immutable parallel vector.

    Definition Classes
    ParIterableParIterableLikeGenTraversableOnce
  156. def toIterator : Iterator[T]

    Returns an Iterator over the elements in this immutable parallel vector.

    Returns an Iterator over the elements in this immutable parallel vector. 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 immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  157. def toList : List[T]

    Converts this immutable parallel vector to a list.

    Converts this immutable parallel vector to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  158. def toMap [T, U] : Map[T, U]

    [use case] Converts this immutable parallel vector to a map.

    [use case]

    Converts this immutable parallel vector 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 containing all elements of this immutable parallel vector.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  159. def toMap [K, V] (implicit ev: <:<[T, (K, V)]): ParMap[K, V]

    Converts this immutable parallel vector to a map.

    Converts this immutable parallel vector 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 containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  160. def toParCollection [U >: T, That] (cbf: () ⇒ Combiner[U, That]): That

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

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

    Converts this immutable parallel vector to a sequence.

    Converts this immutable parallel vector 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 immutable parallel vector.

    Definition Classes
    ParSeqParIterableParSeqLikeParIterableLike → GenSeqLike → GenTraversableOnce
  163. def toSet [U >: T] : ParSet[U]

    Converts this immutable parallel vector to a set.

    Converts this immutable parallel vector to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  164. def toStream : Stream[T]

    Converts this immutable parallel vector to a stream.

    Converts this immutable parallel vector to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  165. def toString (): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

    a String representation of the object.

    Definition Classes
    ParSeqParSeqLikeParIterableLike → AnyRef → Any
  166. def toTraversable : GenTraversable[T]

    Converts this immutable parallel vector to an unspecified Traversable.

    Converts this immutable parallel vector 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 immutable parallel vector.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  167. def transpose [B] (implicit asTraversable: (T) ⇒ TraversableOnce[B]): ParVector[ParVector[B]]

    Transposes this immutable parallel vector of traversable collections into a immutable parallel vector of immutable parallel vectors.

    Transposes this immutable parallel vector of traversable collections into a immutable parallel vector of immutable parallel vectors.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this immutable parallel vector is a Traversable.

    returns

    a two-dimensional immutable parallel vector of immutable parallel vectors which has as nth row the nth column of this immutable parallel vector.

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    "As of 2.9, transpose throws an exception if collections are not uniformly sized."

  168. def union [B >: T, That] (that: Seq[B])(implicit bf: CanBuildFrom[ParVector[T], B, That]): That

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  169. def union (that: GenSeq[T]): immutable.ParVector[T]

    [use case] Produces a new sequence which contains all elements of this immutable parallel vector and also all elements of a given sequence.

    [use case]

    Produces a new sequence which contains all elements of this immutable parallel vector and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add.

    returns

    a new collection of type That which contains all elements of this immutable parallel vector followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  170. def union [B >: T, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[ParVector[T], B, That]): That

    Produces a new sequence which contains all elements of this immutable parallel vector and also all elements of a given sequence.

    Produces a new sequence which contains all elements of this immutable parallel vector and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    Note: will not terminate for infinite-sized collections.

    Another way to express this is that xs union ys computes the order-presevring 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.

    B

    the element type of the returned immutable parallel vector.

    That

    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.

    that

    the sequence to add.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this immutable parallel vector followed by all elements of that.

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

    Converts this immutable parallel vector of pairs into two collections of the first and second half of each pair.

    Converts this immutable parallel vector of pairs into two collections of the first and second half of each pair.

    asPair

    an implicit conversion which asserts that the element type of this immutable parallel vector is a pair.

    returns

    a pair immutable parallel vectors, containing the first, respectively second half of each element pair of this immutable parallel vector.

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

    Converts this immutable parallel vector of triples into three collections of the first, second, and third element of each triple.

    Converts this immutable parallel vector of triples into three collections of the first, second, and third element of each triple.

    returns

    a triple immutable parallel vectors, containing the first, second, respectively third member of each element triple of this immutable parallel vector.

    Definition Classes
    GenericTraversableTemplate
  173. def updated (index: Int, elem: T): immutable.ParVector[T]

    [use case] A copy of this immutable parallel vector with one single replaced element.

    [use case]

    A copy of this immutable parallel vector with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a new immutable parallel vector which is a copy of this immutable parallel vector with the element at position index replaced by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  174. def updated [U >: T, That] (index: Int, elem: U)(implicit bf: CanBuildFrom[ParVector[T], U, That]): That

    A copy of this immutable parallel vector with one single replaced element.

    A copy of this immutable parallel vector with one single replaced element.

    That

    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.

    index

    the position of the replacement

    elem

    the replacing element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new immutable parallel vector which is a copy of this immutable parallel vector with the element at position index replaced by elem.

    Definition Classes
    ParSeqLike → GenSeqLike
  175. def view : ParSeqView[T, ParVector[T], Vector[T]]

    Definition Classes
    ParSeqLikeParIterableLike
  176. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  179. def wrap [R] (body: ⇒ R): NonDivisible[R]

    Attributes
    protected
    Definition Classes
    ParIterableLike
  180. def zip [B] (that: GenIterable[B]): immutable.ParVector[(T, B)]

    [use case] Returns a immutable parallel vector formed from this immutable parallel vector and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a immutable parallel vector formed from this immutable parallel vector 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.

    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 collection of type That containing pairs consisting of corresponding elements of this immutable parallel vector and that. The length of the returned collection is the minimum of the lengths of this immutable parallel vector and that.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  181. def zip [U >: T, S, That] (that: GenIterable[S])(implicit bf: CanBuildFrom[ParVector[T], (U, S), That]): That

    Returns a immutable parallel vector formed from this immutable parallel vector and another iterable collection by combining corresponding elements in pairs.

    Returns a immutable parallel vector formed from this immutable parallel vector 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.

    That

    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.

    that

    The iterable providing the second half of each result pair

    bf

    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).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this immutable parallel vector and that. The length of the returned collection is the minimum of the lengths of this immutable parallel vector and that.

    Definition Classes
    ParSeqLikeParIterableLike → GenIterableLike
  182. def zipAll [B] (that: Iterable[B], thisElem: T, thatElem: B): immutable.ParVector[(T, B)]

    [use case] Returns a immutable parallel vector formed from this immutable parallel vector and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a immutable parallel vector formed from this immutable parallel vector 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.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this immutable parallel vector is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this immutable parallel vector.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this immutable parallel vector and that. The length of the returned collection is the maximum of the lengths of this immutable parallel vector and that. If this immutable parallel vector is shorter than that, thisElem values are used to pad the result. If that is shorter than this immutable parallel vector, thatElem values are used to pad the result.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  183. def zipAll [S, U >: T, That] (that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[ParVector[T], (U, S), That]): That

    Returns a immutable parallel vector formed from this immutable parallel vector and another iterable collection by combining corresponding elements in pairs.

    Returns a immutable parallel vector formed from this immutable parallel vector 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.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this immutable parallel vector is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this immutable parallel vector.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this immutable parallel vector and that. The length of the returned collection is the maximum of the lengths of this immutable parallel vector and that. If this immutable parallel vector is shorter than that, thisElem values are used to pad the result. If that is shorter than this immutable parallel vector, thatElem values are used to pad the result.

    Definition Classes
    ParIterableLike → GenIterableLike
  184. def zipWithIndex : immutable.ParVector[(T, Int)]

    [use case] Zips this immutable parallel vector with its indices.

    [use case]

    Zips this immutable parallel vector with its indices.

    returns

    A new collection of type That containing pairs consisting of all elements of this immutable parallel vector paired with their index. Indices start at 0.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  185. def zipWithIndex [U >: T, That] (implicit bf: CanBuildFrom[ParVector[T], (U, Int), That]): That

    Zips this immutable parallel vector with its indices.

    Zips this immutable parallel vector with its indices.

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

    That

    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.

    returns

    A new collection of type That containing pairs consisting of all elements of this immutable parallel vector paired with their index. Indices start at 0.

    Definition Classes
    ParIterableLike → GenIterableLike

Inherited from Serializable

Inherited from Serializable

Inherited from ParSeq[T]

Inherited from ParIterable[T]

Inherited from ParSeq[T]

Inherited from ParSeqLike[T, ParVector[T], Vector[T]]

Inherited from ParIterable[T]

Inherited from ParIterableLike[T, ParVector[T], Vector[T]]

Inherited from Parallel

Inherited from CustomParallelizable[T, ParVector[T]]

Inherited from GenericParTemplate[T, ParVector]

Inherited from HasNewCombiner[T, ParVector[T]]

Inherited from GenSeq[T]

Inherited from GenIterable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, ParVector]

Inherited from HasNewBuilder[T, ParVector[T]]

Inherited from GenSeqLike[T, ParVector[T]]

Inherited from Equals

Inherited from GenIterableLike[T, ParVector[T]]

Inherited from GenTraversableLike[T, ParVector[T]]

Inherited from Parallelizable[T, ParVector[T]]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any