scala.collection.parallel.ParSeqViewLike

Zipped

trait Zipped [S] extends Zipped[S] with Zipped[S] with Transformed[(T, S)]

definition classes: ParSeqViewLikeParIterableViewLikeSeqViewLikeIterableViewLike
linear super types: Transformed[(T, S)], ParSeqView[(T, S), Coll, CollSeq], ParSeqViewLike[(T, S), Coll, CollSeq, ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]], ParSeq[(T, S)], ParSeqLike[(T, S), ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]], Zipped[S], Transformed[(T, S)], ParIterableView[(T, S), Coll, CollSeq], ParIterableViewLike[(T, S), Coll, CollSeq, ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]], ParIterable[(T, S)], ParIterableLike[(T, S), ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]], Parallel, CustomParallelizable[(T, S), ParSeqView[(T, S), Coll, CollSeq]], GenericParTemplate[(T, S), ParSeq], HasNewCombiner[(T, S), ParSeqView[(T, S), Coll, CollSeq]], Zipped[S], Transformed[(T, S)], SeqView[(T, S), Coll], SeqViewLike[(T, S), Coll, ParSeqView[(T, S), Coll, CollSeq]], Seq[(T, S)], SeqLike[(T, S), ParSeqView[(T, S), Coll, CollSeq]], PartialFunction[Int, (T, S)], (Int) ⇒ (T, S), Zipped[S], Transformed[(T, S)], Transformed[(T, S)], IterableView[(T, S), Coll], IterableViewLike[(T, S), Coll, ParSeqView[(T, S), Coll, CollSeq]], TraversableView[(T, S), Coll], TraversableViewLike[(T, S), Coll, ParSeqView[(T, S), Coll, CollSeq]], ViewMkString[(T, S)], Iterable[(T, S)], IterableLike[(T, S), ParSeqView[(T, S), Coll, CollSeq]], Equals, Traversable[(T, S)], GenericTraversableTemplate[(T, S), ParSeq], TraversableLike[(T, S), ParSeqView[(T, S), Coll, CollSeq]], Parallelizable[(T, S), ParSeqView[(T, S), Coll, CollSeq]], TraversableOnce[(T, S)], FilterMonadic[(T, S), ParSeqView[(T, S), Coll, CollSeq]], HasNewBuilder[(T, S), ParSeqView[(T, S), Coll, CollSeq]], AnyRef, Any
source: ParSeqViewLike.scala
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Zipped
  2. Transformed
  3. ParSeqView
  4. ParSeqViewLike
  5. ParSeq
  6. ParSeqLike
  7. Zipped
  8. Transformed
  9. ParIterableView
  10. ParIterableViewLike
  11. ParIterable
  12. ParIterableLike
  13. Parallel
  14. CustomParallelizable
  15. GenericParTemplate
  16. HasNewCombiner
  17. Zipped
  18. Transformed
  19. SeqView
  20. SeqViewLike
  21. Seq
  22. SeqLike
  23. PartialFunction
  24. Function1
  25. Zipped
  26. Transformed
  27. Transformed
  28. IterableView
  29. IterableViewLike
  30. TraversableView
  31. TraversableViewLike
  32. ViewMkString
  33. Iterable
  34. IterableLike
  35. Equals
  36. Traversable
  37. GenericTraversableTemplate
  38. TraversableLike
  39. Parallelizable
  40. TraversableOnce
  41. FilterMonadic
  42. HasNewBuilder
  43. AnyRef
  44. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

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 Appended [U >: T] extends Appended[U] with Appended[U] with Transformed[U]

  4. trait BuilderOps [Elem, To] extends AnyRef

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

    attributes: protected[this]
  6. 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
  7. class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

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

    attributes: protected[this]
  9. class Corresponds [S] extends Accessor[Boolean, Corresponds[S]]

    attributes: protected[this]
  10. class Count extends Accessor[Int, Count]

    attributes: protected[this]
  11. class CreateScanTree [U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

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

    attributes: protected[this]
  13. trait DroppedWhile extends DroppedWhile with Transformed[A]

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  14. class Elements extends ParIterator with BufferedIterator[T]

    Used to iterate elements using indices

  15. trait EmptyView extends Transformed[Nothing] with EmptyView

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  16. class Exists extends Accessor[Boolean, Exists]

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

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

    attributes: protected[this]
  19. trait Filtered extends Filtered with Transformed[A]

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  20. class Find [U >: T] extends Accessor[Option[U], Find[U]]

    attributes: protected[this]
  21. class FlatMap [S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

    attributes: protected[this]
  22. trait FlatMapped [B] extends FlatMapped[B] with Transformed[B]

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  23. class Fold [U >: T] extends Accessor[U, Fold[U]]

    attributes: protected[this]
  24. class Forall extends Accessor[Boolean, Forall]

    attributes: protected[this]
  25. class Force [U >: T, That] extends Transformer[Combiner[U, That], Force[U, That]]

    attributes: protected[this]
    definition classes: ParSeqViewLikeParIterableViewLike
  26. trait Forced [S] extends Forced[S] with Forced[S] with Transformed[S]

    A fall back which forces everything into a vector and then applies an operation on it.

  27. class Foreach [S] extends Accessor[Unit, Foreach[S]]

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

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

    attributes: protected[this]
  30. class IndexWhere extends Accessor[Int, IndexWhere]

    attributes: protected[this]
  31. class LastIndexWhere extends Accessor[Int, LastIndexWhere]

    attributes: protected[this]
  32. class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]

    attributes: protected[this]
  33. trait Mapped [S] extends Mapped[S] with Mapped[S] with Transformed[S]

  34. class Max [U >: T] extends Accessor[Option[U], Max[U]]

    attributes: protected[this]
  35. class Min [U >: T] extends Accessor[Option[U], Min[U]]

    attributes: protected[this]
  36. trait NonDivisible [R] extends NonDivisibleTask[R, NonDivisible[R]]

    attributes: protected[this]
  37. trait NonDivisibleTask [R, Tp] extends StrictSplitterCheckTask[R, Tp]

    attributes: protected[this]
  38. 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.

  39. trait ParIterator extends ParSeqIterator[T] with ParIterator

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

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

    attributes: protected[this]
  41. trait Patched [U >: T] extends Patched[U] with Transformed[U]

    definition classes: ParSeqViewLikeSeqViewLike
  42. trait Prepended [U >: T] extends Prepended[U] with Transformed[U]

    definition classes: ParSeqViewLikeSeqViewLike
  43. class Product [U >: T] extends Accessor[U, Product[U]]

    attributes: protected[this]
  44. class Reduce [U >: T] extends Accessor[Option[U], Reduce[U]]

    attributes: protected[this]
  45. class ResultMapping [R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

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

    attributes: protected[this]
  47. class ReverseMap [S, That] extends Transformer[Combiner[S, That], ReverseMap[S, That]]

    attributes: protected[this]
  48. trait Reversed extends Reversed with Transformed[T]

    definition classes: ParSeqViewLikeSeqViewLike
  49. type SSCTask [R, Tp] = StrictSplitterCheckTask[R, Tp]

    definition classes: ParIterableLike
  50. class SameElements [U >: T] extends Accessor[Boolean, SameElements[U]]

    attributes: protected[this]
  51. case class ScanLeaf [U >: T] ( pit : ParIterableIterator[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]
  52. case class ScanNode [U >: T] ( left : ScanTree[U] , right : ScanTree[U] ) extends ScanTree[U] with Product with Serializable

    attributes: protected[this]
  53. trait ScanTree [U >: T] extends AnyRef

    attributes: protected[this]
  54. class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

    attributes: protected[this]
  55. type Self = ParSeqView[(T, S), Coll, CollSeq]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  56. 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.

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

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

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

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

    attributes: protected[this]
  60. trait Sliced extends Sliced with Sliced with Transformed[T]

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

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

    attributes: protected[this]
  63. trait StrictSplitterCheckTask [R, Tp] extends Task[R, Tp]

    attributes: protected
  64. class Sum [U >: T] extends Accessor[U, Sum[U]]

    attributes: protected[this]
  65. type SuperParIterator = ParIterableIterator[(T, S)]

    definition classes: ParSeqLike
  66. class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

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

    attributes: protected[this]
  68. trait TakenWhile extends TakenWhile with Transformed[A]

    definition classes: SeqViewLikeIterableViewLikeTraversableViewLike
  69. trait TaskOps [R, Tp] extends AnyRef

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

    attributes: protected[this]
  71. class ToParMap [K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    attributes: protected[this]
  72. trait Transformed [+S] extends ParSeqView[S, Coll, CollSeq] with Transformed[S] with Transformed[S]

    The implementation base trait of this view.

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

    attributes: protected
    definition classes: ParSeqLikeParIterableLike
  74. class Updated [U >: T, That] extends Transformer[Combiner[U, That], Updated[U, That]]

    attributes: protected[this]
  75. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

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

    attributes: protected[this]
    definition classes: ParSeqLikeParIterableLike
  77. class ZipAll [U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]

    attributes: protected[this]
  78. trait Zipped [S] extends Zipped[S] with Zipped[S] with Transformed[(T, S)]

  79. trait ZippedAll [U >: T, S] extends ZippedAll[U, S] with ZippedAll[U, S] with Transformed[(U, S)]

Value Members

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

    attributes: final
    definition classes: AnyRef
  2. def != ( arg0 : Any ) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

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

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def ++ [B] ( that : TraversableOnce[B] ) : ParIterable[B]

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

    [use case]

    Concatenates this parallel iterable with the elements of a traversable collection.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new parallel iterable which contains all elements of this parallel iterable followed by all elements of that.

    attributes: abstract
    definition classes: TraversableLike
  7. def ++ [U >: (T, S), That] ( xs : TraversableOnce[U] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

    Concatenates this parallel iterable with the elements of a traversable collection.

    Concatenates this parallel iterable 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.

    bf

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

    returns

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

  8. def ++: [B >: (T, S), That] ( that : Traversable[B] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], B, That] ) : That

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

    definition classes: TraversableLike
  9. def ++: [B] ( that : TraversableOnce[B] ) : ParIterable[B]

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

    [use case]

    Concatenates this parallel iterable with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new parallel iterable which contains all elements of this parallel iterable followed by all elements of that.

    attributes: abstract
    definition classes: TraversableLike
  10. def ++: [B >: (T, S), That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], B, That] ) : That

    Concatenates this parallel iterable with the elements of a traversable collection.

    Concatenates this parallel iterable with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned 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 the new element type B.

    returns

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

    definition classes: TraversableLike
  11. def +: ( elem : (T, S) ) : ParIterable[(T, S)]

    [use case] Prepends an element to this parallel iterable

    [use case]

    Prepends an element to this parallel iterable

    elem

    the prepended element

    returns

    a new parallel iterable consisting of elem followed by all elements of this parallel iterable.

    attributes: abstract
    definition classes: SeqLike
  12. def +: [U >: (T, S), That] ( elem : U )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

    Prepends an element to this parallel iterable

    Prepends an element to this parallel iterable

    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 the new element type B.

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  13. def /: [B] ( z : B )( op : (B, (T, S)) ⇒ B ) : B

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

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    definition classes: TraversableOnce
  14. def :+ ( elem : (T, S) ) : ParIterable[(T, S)]

    [use case] Appends an element to this parallel iterable

    [use case]

    Appends an element to this parallel iterable

    Note: will not terminate for infinite-sized collections.

    elem

    the appended element

    returns

    a new parallel iterable consisting of all elements of this parallel iterable followed by elem.

    attributes: abstract
    definition classes: SeqLike
  15. def :+ [U >: (T, S), That] ( elem : U )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

    Appends an element to this parallel iterable

    Appends an element to this parallel iterable

    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 the new element type B.

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  16. def :\ [B] ( z : B )( op : ((T, S), B) ⇒ B ) : B

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

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

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

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

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

    definition classes: TraversableOnce
  17. def == ( arg0 : AnyRef ) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  18. def == ( arg0 : Any ) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  19. def addString ( b : StringBuilder , start : String , sep : String , end : String ) : StringBuilder

    definition classes: ViewMkStringTraversableOnceViewMkString
  20. def addString ( b : StringBuilder ) : StringBuilder

    Appends all elements of this parallel iterable to a string builder.

    Appends all elements of this parallel iterable to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this parallel iterable without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  21. def addString ( b : StringBuilder , sep : String ) : StringBuilder

    Appends all elements of this parallel iterable to a string builder using a separator string.

    Appends all elements of this parallel iterable to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this parallel iterable, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  22. def aggregate [S] ( z : S )( seqop : (S, (T, S)) ⇒ 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: ParIterableLike
  23. def andThen [C] ( k : ((T, S)) ⇒ C ) : PartialFunction[Int, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
  24. def apply ( idx : Int ) : (T, S)

    Selects an element by its index in the parallel iterable.

    Selects an element by its index in the parallel iterable.

    idx

    The index to select.

    returns

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

    definition classes: ZippedTransformedSeqLikeFunction1
  25. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  26. implicit def builder2ops [Elem, To] ( cb : Builder[Elem, To] ) : BuilderOps[Elem, To]

    attributes: protected implicit
    definition classes: ParIterableLike
  27. def canEqual ( that : Any ) : Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this parallel iterable should be compared

    returns

    true, if this parallel iterable can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  28. def cbfactory : () ⇒ Combiner[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

    attributes: protected[this]
    definition classes: ParIterableLike
  29. def clone () : AnyRef

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected[lang]
    definition classes: AnyRef
    annotations: @throws()
  30. def collect [B] ( pf : PartialFunction[(T, S), B] ) : ParIterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the parallel iterable.

    returns

    a new parallel iterable resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    attributes: abstract
    definition classes: TraversableLike
  31. def collect [S, That] ( pf : PartialFunction[(T, S), S] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], S, That] ) : That

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

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

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr 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.

  32. def collectFirst [B] ( pf : PartialFunction[(T, S), B] ) : Option[B]

    Finds the first element of the parallel iterable for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the parallel iterable for which the given partial function is defined, and applies the partial function to it.

    Note: may not terminate for infinite-sized collections.

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    definition classes: TraversableOnce
    Example :
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  33. def combinations ( n : Int ) : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    Iterates over combinations.

    Iterates over combinations.

    returns

    An Iterator which traverses the possible n-element combinations of this parallel iterable.

    definition classes: SeqLike
    Example :
    1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)

  34. def companion : GenericCompanion[ParSeq] with GenericParCompanion[ParSeq]

    The factory companion object that builds instances of class ParIterable.

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

  35. def compose [A] ( g : (A) ⇒ Int ) : (A) ⇒ (T, S)

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

    a new function f such that f(x) == apply(g(x))

    definition classes: Function1
  36. def contains ( elem : Any ) : Boolean

    Tests whether this parallel iterable contains a given value as an element.

    Tests whether this parallel iterable contains a given value as an element.

    Note: may not terminate for infinite-sized collections.

    elem

    the element to test.

    returns

    true if this parallel iterable has an element that is is equal (wrt ==) to elem, false otherwise.

    definition classes: SeqLike
  37. def containsSlice [B] ( that : Seq[B] ) : Boolean

    Tests whether this parallel iterable contains a given sequence as a slice.

    Tests whether this parallel iterable contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    true if this parallel iterable contains a slice with the same elements as that, otherwise false.

    definition classes: SeqLike
  38. def copyToArray ( xs : Array[(T, S)] , start : Int , len : Int ) : Unit

    [use case] Copies elements of this parallel iterable to an array.

    [use case]

    Copies elements of this parallel iterable to an array. Fills the given array xs with at most len elements of this parallel iterable, starting at position start. Copying will stop once either the end of the current parallel iterable is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    attributes: abstract
    definition classes: TraversableLike
  39. def copyToArray [U >: (T, S)] ( xs : Array[U] , start : Int , len : Int ) : Unit

    Copies elements of this parallel iterable to an array.

    Copies elements of this parallel iterable to an array. Fills the given array xs with at most len elements of this parallel iterable, starting at position start. Copying will stop once either the end of the current parallel iterable is reached, or the end of the array is reached, or len elements have been copied.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

  40. def copyToArray ( xs : Array[(T, S)] ) : Unit

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

    [use case]

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

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  41. def copyToArray [B >: (T, S)] ( xs : Array[B] ) : Unit

    Copies values of this parallel iterable to an array.

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  42. def copyToArray ( xs : Array[(T, S)] , start : Int ) : Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    attributes: abstract
    definition classes: TraversableOnce
  43. def copyToArray [B >: (T, S)] ( xs : Array[B] , start : Int ) : Unit

    Copies values of this parallel iterable to an array.

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableOnce
  44. def copyToBuffer [B >: (T, S)] ( dest : Buffer[B] ) : Unit

    Copies all elements of this parallel iterable to a buffer.

    Copies all elements of this parallel iterable to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableOnce
  45. def corresponds [S] ( that : Seq[S] )( p : ((T, S), S) ⇒ Boolean ) : Boolean

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

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

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

    S

    the type of the elements of that

    that

    the other parallel sequence

    p

    the test predicate, which relates elements from both sequences

    returns

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

    definition classes: ParSeqLikeSeqLike
  46. def count ( p : ((T, S)) ⇒ Boolean ) : Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: ParIterableLikeTraversableOnce
  47. def debugBuffer : ArrayBuffer[String]

    definition classes: ParIterableLike
  48. implicit def delegatedSignalling2ops [PI <: DelegatedSignalling] ( it : PI ) : SignallingOps[PI]

    attributes: protected implicit
    definition classes: ParIterableLike
  49. def diff ( that : Seq[(T, S)] ) : ParIterable[(T, S)]

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

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

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

    attributes: abstract
    definition classes: SeqLike
  50. def diff [U >: (T, S)] ( that : Seq[U] ) : ParSeqView[(T, S), Coll, CollSeq]

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

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

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

    definition classes: ParSeqViewLikeSeqViewLikeSeqLike
  51. def distinct : ParSeqView[(T, S), Coll, CollSeq]

    Builds a new parallel iterable from this parallel iterable without any duplicate elements.

    Builds a new parallel iterable from this parallel iterable without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    returns

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

    definition classes: SeqLike
  52. def down ( p : scala.collection.parallel.ParIterableIterator[_] ) : ParSeqIterator[(T, S)]

    attributes: protected[this]
    definition classes: ParSeqLike
  53. def drop ( n : Int ) : ParSeqView[(T, S), Coll, CollSeq]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this parallel iterable.

    returns

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

  54. def dropRight ( n : Int ) : ParSeqView[(T, S), Coll, CollSeq]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    definition classes: IterableLike
  55. def dropWhile ( p : ((T, S)) ⇒ Boolean ) : ParSeqView[(T, S), Coll, CollSeq]

    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.

    returns

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

  56. def elements : Iterator[(T, S)]

    definition classes: IterableLike
    annotations: @deprecated( message = "use `iterator' instead" )
      deprecated:
    1. use iterator' instead

  57. def endsWith [S] ( that : Seq[S] ) : Boolean

    Tests whether this parallel iterable ends with the given parallel sequence

    Tests whether this parallel iterable ends with the given parallel sequence

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

    S

    the type of the elements of that sequence

    that

    the sequence to test

    returns

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

    definition classes: ParSeqLikeSeqLike
  58. def eq ( arg0 : AnyRef ) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  59. 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: SeqLikeEquals → AnyRef → Any
  60. def equalsWith [B] ( that : Seq[B] )( f : ((T, S), B) ⇒ Boolean ) : Boolean

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

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

    B

    the type of the elements of that

    that

    the other sequence

    returns

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

    definition classes: SeqLike
    annotations: @deprecated( message = "use `corresponds` instead" )
      deprecated:
    1. use corresponds instead

  61. def exists ( pred : ((T, S)) ⇒ Boolean ) : Boolean

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

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

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

    returns

    true if p holds for some element, false otherwise

  62. def filter ( p : ((T, S)) ⇒ Boolean ) : ParSeqView[(T, S), Coll, CollSeq]

    Selects all elements of this parallel iterable which satisfy a predicate.

    Selects all elements of this parallel iterable which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new parallel iterable consisting of all elements of this parallel iterable that satisfy the given predicate p. The order of the elements is preserved.

  63. def filterNot ( p : ((T, S)) ⇒ Boolean ) : ParSeqView[(T, S), Coll, CollSeq]

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

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

    p

    the predicate used to test elements.

    returns

    a new parallel iterable consisting of all elements of this parallel iterable that do not satisfy the given predicate p. The order of the elements is preserved.

  64. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

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

    attributes: protected[lang]
    definition classes: AnyRef
    annotations: @throws()
  65. def find ( pred : ((T, S)) ⇒ Boolean ) : Option[(T, S)]

    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

  66. def findIndexOf ( p : ((T, S)) ⇒ Boolean ) : Int

    Returns index of the first element satisfying a predicate, or -1.

    Returns index of the first element satisfying a predicate, or -1.

    definition classes: ParSeqLikeSeqLike
  67. def findLastIndexOf ( p : ((T, S)) ⇒ Boolean ) : Int

    Returns index of the last element satisfying a predicate, or -1.

    Returns index of the last element satisfying a predicate, or -1.

    definition classes: SeqLike
    annotations: @deprecated( message = "use `lastIndexWhere` instead" )
      deprecated:
    1. use lastIndexWhere instead

  68. def first : (T, S)

    definition classes: IterableLike
    annotations: @deprecated( message = "use `head' instead" )
      deprecated:
    1. use head' instead

  69. def firstOption : Option[(T, S)]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
    annotations: @deprecated( message = "use `headOption' instead" )
      deprecated:
    1. use headOption' instead

  70. def flatMap [B] ( f : ((T, S)) ⇒ TraversableOnce[B] ) : ParIterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  71. def flatMap [S, That] ( f : ((T, S)) ⇒ TraversableOnce[S] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], S, That] ) : That

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

    Builds a new collection by applying a function to all elements of this parallel iterable 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 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 parallel iterable and concatenating the results.

  72. def flatten [B] : ParIterable[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

    a new parallel iterable resulting from concatenating all element parallel iterables.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  73. def flatten [B] (implicit asTraversable : ((T, S)) ⇒ TraversableOnce[B] ) : ParSeq[B]

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

    Converts this parallel iterable of traversable collections into a parallel iterable 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 parallel iterable is a Traversable.

    returns

    a new parallel iterable resulting from concatenating all element parallel iterables.

    definition classes: GenericTraversableTemplate
  74. def fold [U >: (T, S)] ( z : U )( op : (U, U) ⇒ U ) : U

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

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

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

    U

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    definition classes: ParIterableLike
  75. def foldLeft [S] ( z : S )( op : (S, (T, S)) ⇒ S ) : S

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

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

    Note: will not terminate for infinite-sized collections.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    definition classes: ParIterableLikeTraversableOnce
  76. def foldRight [S] ( z : S )( op : ((T, S), S) ⇒ S ) : S

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

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

    Note: will not terminate for infinite-sized collections.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    definition classes: ParIterableLikeIterableLikeTraversableOnce
  77. def forall ( pred : ((T, S)) ⇒ Boolean ) : Boolean

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

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

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

    returns

    true if p holds for all elements, false otherwise

  78. def force [U >: (T, S), That] (implicit bf : CanBuildFrom[Coll, U, That] ) : That

  79. def foreach [U] ( f : ((T, S)) ⇒ U ) : Unit

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

    Applies a function f to all the elements of parallel iterable 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

  80. def genericBuilder [B] : Combiner[B, ParSeq[B]]

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

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

  81. def genericCombiner [B] : Combiner[B, ParSeq[B]]

    definition classes: GenericParTemplate
  82. def getClass () : java.lang.Class[_ <: java.lang.Object]

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

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

    The nature of the representation is platform dependent.

    returns

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

    attributes: final
    definition classes: AnyRef
  83. def groupBy [K] ( f : ((T, S)) ⇒ K ) : ParMap[K, ParSeqView[(T, S), Coll, CollSeq]]

    Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.

    Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new parallel iterable.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

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

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

  84. def grouped ( size : Int ) : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    Partitions elements in fixed size parallel iterables.

    Partitions elements in fixed size parallel iterables.

    size

    the number of elements per group

    returns

    An iterator producing parallel iterables of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableViewLikeIterableLike
      see also:
    1. Iterator#grouped

  85. def hasDefiniteSize : Boolean

    Tests whether this parallel iterable is known to have a finite size.

    Tests whether this parallel iterable is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

    true if this collection is known to have finite size, false otherwise.

    definition classes: TraversableLikeTraversableOnce
  86. def hashCode () : Int

    Hashcodes for ParIterable produce a value from the hashcodes of all the elements of the parallel iterable.

    Hashcodes for ParIterable produce a value from the hashcodes of all the elements of the parallel iterable.@return the hash code value for the object. */

    definition classes: SeqLike → AnyRef → Any
  87. def head : (T, S)

    Selects the first element of this parallel iterable.

    Selects the first element of this parallel iterable.

    returns

    the first element of this parallel iterable.

    definition classes: IterableLikeTraversableLike
  88. def headOption : Option[(T, S)]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this parallel iterable if it is nonempty, None if it is empty.

    definition classes: TraversableLike
  89. def indexOf ( elem : (T, S) , from : Int ) : Int

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

    [use case]

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

    attributes: abstract
    definition classes: SeqLike
  90. def indexOf [U >: (T, S)] ( elem : U , from : Int ) : Int

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

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

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    definition classes: ParSeqLikeSeqLike
  91. def indexOf ( elem : (T, S) ) : Int

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  92. def indexOf [U >: (T, S)] ( elem : U ) : Int

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

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

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

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

    definition classes: ParSeqLikeSeqLike
  93. def indexOfSlice [B >: (T, S)] ( that : Seq[B] , from : Int ) : Int

    Finds first index after or at a start index where this parallel iterable contains a given sequence as a slice.

    Finds first index after or at a start index where this parallel iterable contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    from

    the start index

    returns

    the first index >= from such that the elements of this parallel iterable starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  94. def indexOfSlice [B >: (T, S)] ( that : Seq[B] ) : Int

    Finds first index where this parallel iterable contains a given sequence as a slice.

    Finds first index where this parallel iterable contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    the first index such that the elements of this parallel iterable starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  95. def indexWhere ( p : ((T, S)) ⇒ 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 parallel iterable that satisfies the predicate p, or -1, if none exists.

    definition classes: ParSeqLikeSeqLike
  96. def indexWhere ( p : ((T, S)) ⇒ Boolean , from : Int ) : Int

    Finds the first element satisfying some predicate.

    Finds the first element satisfying some predicate.

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    definition classes: ParSeqLikeSeqLike
  97. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this parallel iterable.

    definition classes: SeqLike
  98. def init : ParSeqView[(T, S), Coll, CollSeq]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a parallel iterable consisting of all elements of this parallel iterable except the last one.

    definition classes: TraversableViewLikeTraversableLike
  99. def inits : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    Iterates over the inits of this parallel iterable.

    Iterates over the inits of this parallel iterable. The first value will be this parallel iterable and the final one will be an empty parallel iterable, with the intervening values the results of successive applications of init.

    returns

    an iterator over all the inits of this parallel iterable

    definition classes: TraversableLike
    Example :
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  100. def intersect ( that : Seq[(T, S)] ) : ParIterable[(T, S)]

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

    [use case]

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  101. def intersect [U >: (T, S)] ( that : Seq[U] ) : ParSeqView[(T, S), Coll, CollSeq]

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

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

    definition classes: ParSeqViewLikeSeqViewLikeSeqLike
  102. def isDefinedAt ( idx : Int ) : Boolean

    Tests whether this parallel iterable contains given index.

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

    definition classes: SeqLike
  103. def isEmpty : Boolean

    Tests whether this parallel iterable is empty.

    Tests whether this parallel iterable is empty.

    returns

    true if the parallel iterable contain no elements, false otherwise.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  104. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

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

    attributes: final
    definition classes: Any
  105. 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
  106. def isTraversableAgain : Boolean

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  107. def iterator : ParSeqIterator[(T, S)]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

    the new iterator

    definition classes: TransformedTransformedTransformedParSeqLikeParIterableLikeIterableLike
  108. def last : (T, S)

    Selects the last element.

    Selects the last element.

    returns

    The last element of this parallel iterable.

    definition classes: TraversableLike
  109. def lastIndexOf ( elem : (T, S) , end : Int ) : Int

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

    [use case]

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

    elem

    the element value to search for.

    end

    the end index.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  110. def lastIndexOf [B >: (T, S)] ( elem : B , end : Int ) : Int

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

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

    definition classes: SeqLike
  111. def lastIndexOf ( elem : (T, S) ) : Int

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  112. def lastIndexOf [B >: (T, S)] ( elem : B ) : Int

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

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

    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 parallel iterable that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  113. def lastIndexOfSlice [B >: (T, S)] ( that : Seq[B] , end : Int ) : Int

    Finds last index before or at a given end index where this parallel iterable contains a given sequence as a slice.

    Finds last index before or at a given end index where this parallel iterable contains a given sequence as a slice.

    that

    the sequence to test

    end

    the end index

    returns

    the last index <= end such that the elements of this parallel iterable starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  114. def lastIndexOfSlice [B >: (T, S)] ( that : Seq[B] ) : Int

    Finds last index where this parallel iterable contains a given sequence as a slice.

    Finds last index where this parallel iterable contains a given sequence as a slice.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    the last index such that the elements of this parallel iterable starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  115. def lastIndexWhere ( p : ((T, S)) ⇒ Boolean , end : Int ) : Int

    Finds the last element satisfying some predicate.

    Finds the last element satisfying some predicate.

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

    The index flag is initially set to minimum integer value.

    p

    the predicate used to test the elements

    end

    the maximum offset for the search

    returns

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

    definition classes: ParSeqLikeSeqLike
  116. def lastIndexWhere ( p : ((T, S)) ⇒ 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 parallel iterable that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  117. def lastOption : Option[(T, S)]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this parallel iterable$ if it is nonempty, None if it is empty.

    definition classes: TraversableLike
  118. def length : Int

    The length of the parallel iterable.

    The length of the parallel iterable.

    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 parallel iterable.

    definition classes: ZippedTransformedSeqLike
  119. def lengthCompare ( len : Int ) : Int

    Compares the length of this parallel iterable to a test value.

    Compares the length of this parallel iterable to a test value.

    len

    the test value that gets compared with the length.

    returns

    A value x where

           x <  0       if this.length <  len
           x == 0       if this.length == len
           x >  0       if this.length >  len
    

    The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.

    definition classes: SeqLike
  120. def lift : (Int) ⇒ Option[(T, S)]

    Turns this partial function into an plain function returning an Option result.

    Turns this partial function into an plain function returning an Option result.

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    definition classes: PartialFunction
      see also:
    1. Function.unlift

  121. def map [B] ( f : ((T, S)) ⇒ B ) : ParIterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new parallel iterable resulting from applying the given function f to each element of this parallel iterable and collecting the results.

    attributes: abstract
    definition classes: TraversableLike
  122. def map [S, That] ( f : ((T, S)) ⇒ S )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], S, That] ) : That

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

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

    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 the new element type B.

    returns

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

  123. def max : (T, S)

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this parallel iterable.

    attributes: abstract
    definition classes: TraversableOnce
  124. def max [U >: (T, S)] (implicit ord : Ordering[U] ) : (T, S)

    Finds the largest element.

    Finds the largest element.

    returns

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

    definition classes: ParIterableLikeTraversableOnce
  125. def maxBy [S] ( f : ((T, S)) ⇒ S )(implicit cmp : Ordering[S] ) : (T, S)

    definition classes: ParIterableLikeTraversableOnce
  126. def min : (T, S)

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this parallel iterable

    attributes: abstract
    definition classes: TraversableOnce
  127. def min [U >: (T, S)] (implicit ord : Ordering[U] ) : (T, S)

    Finds the smallest element.

    Finds the smallest element.

    returns

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

    definition classes: ParIterableLikeTraversableOnce
  128. def minBy [S] ( f : ((T, S)) ⇒ S )(implicit cmp : Ordering[S] ) : (T, S)

    definition classes: ParIterableLikeTraversableOnce
  129. def mkString : String

    Displays all elements of this parallel iterable in a string.

    Displays all elements of this parallel iterable in a string.

    returns

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

    definition classes: ParIterableLikeTraversableOnce
  130. def mkString ( sep : String ) : String

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

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

    sep

    the separator string.

    returns

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

    definition classes: ParIterableLikeTraversableOnce
    Example :
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this parallel iterable. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this parallel iterable are separated by the string sep.

    definition classes: ParIterableLikeTraversableOnce
    Example :
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  132. def ne ( arg0 : AnyRef ) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  133. def newAppended [U >: (T, S)] ( that : Traversable[U] ) : Transformed[U]

    attributes: protected
  134. def newAppendedTryParIterable [U >: (T, S)] ( that : Traversable[U] ) : Transformed[U]

    attributes: protected
    definition classes: ParIterableViewLike
  135. def newBuilder : Builder[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

    The newBuilder operation returns a parallel builder assigned to this collection's fork/join pool.

    The newBuilder operation returns a parallel builder assigned to this collection's fork/join pool. This method forwards the call to newCombiner.

    attributes: protected[this]
    definition classes: ParIterableLikeTraversableLikeHasNewBuilder
  136. def newCombiner : Combiner[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

    attributes: protected[this]
  137. def newDropped ( n : Int ) : Transformed[(T, S)]

    attributes: protected
    definition classes: TraversableViewLike
  138. def newDroppedWhile ( p : ((T, S)) ⇒ Boolean ) : Nothing

    attributes: protected
  139. def newFiltered ( p : ((T, S)) ⇒ Boolean ) : Nothing

    attributes: protected
  140. def newFlatMapped [S] ( f : ((T, S)) ⇒ TraversableOnce[S] ) : Nothing

    attributes: protected
  141. def newForced [S] ( xs : ⇒ Seq[S] ) : Transformed[S]

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    attributes: protected
  142. def newForcedTryParIterable [S] ( xs : ⇒ Seq[S] ) : Transformed[S]

    attributes: protected
    definition classes: ParIterableViewLike
  143. def newMapped [S] ( f : ((T, S)) ⇒ S ) : Transformed[S]

    attributes: protected
  144. def newPatched [U >: (T, S)] ( _from : Int , _patch : Seq[U] , _replaced : Int ) : Transformed[U]

    attributes: protected
    definition classes: ParSeqViewLikeSeqViewLike
  145. def newPrepended [U >: (T, S)] ( elem : U ) : Transformed[U]

    attributes: protected
    definition classes: ParSeqViewLikeSeqViewLike
  146. def newReversed : Transformed[(T, S)]

    attributes: protected
    definition classes: ParSeqViewLikeSeqViewLike
  147. def newSliced ( _endpoints : SliceInterval ) : Transformed[(T, S)]

    attributes: protected
  148. def newTaken ( n : Int ) : Transformed[(T, S)]

    attributes: protected
    definition classes: TraversableViewLike
  149. def newTakenWhile ( p : ((T, S)) ⇒ Boolean ) : Nothing

    attributes: protected
  150. def newZipped [S] ( that : Iterable[S] ) : Transformed[((T, S), S)]

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

    attributes: protected
  151. def newZippedAll [U >: (T, S), S] ( that : Iterable[S] , _thisElem : U , _thatElem : S ) : Transformed[(U, S)]

    attributes: protected
  152. def newZippedAllTryParSeq [S, U >: (T, S)] ( that : Iterable[S] , thisElem : U , thatElem : S ) : Transformed[(U, S)]

    attributes: protected
    definition classes: ParIterableViewLike
  153. def newZippedTryParSeq [S] ( that : Iterable[S] ) : Transformed[((T, S), S)]

    attributes: protected
    definition classes: ParIterableViewLike
  154. def nonEmpty : Boolean

    Tests whether the parallel iterable is not empty.

    Tests whether the parallel iterable is not empty.

    returns

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

    definition classes: TraversableOnce
  155. 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
  156. 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
  157. def orElse [A1 <: Int, B1 >: (T, S)] ( that : PartialFunction[A1, B1] ) : PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    definition classes: PartialFunction
  158. val other : Iterable[S]

    attributes: protected[this] abstract
    definition classes: Zipped
  159. def otherPar : ParSeq[S]

    definition classes: Zipped
  160. def padTo ( len : Int , elem : (T, S) ) : ParIterable[(T, S)]

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

    [use case]

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

    len

    the target length

    elem

    the padding value

    returns

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

    attributes: abstract
    definition classes: SeqLike
  161. def padTo [U >: (T, S), That] ( len : Int , elem : U )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

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

    Appends an element value to this parallel iterable 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 the new element type B.

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  162. def par : ParSeqView[(T, S), Coll, CollSeq]

    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

  163. def parCombiner : Combiner[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

    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]
  164. def parallelIterator : Zipped[S]

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

    Creates a new parallel iterator used to traverse the elements of this parallel collection. This iterator is more specific than the iterator of the returned by iterator, and augmented with additional accessor and transformer methods.

    returns

    a parallel iterator

    definition classes: ZippedTransformedParSeqLikeZippedTransformedParIterableLike
  165. def partition ( p : ((T, S)) ⇒ Boolean ) : (ParSeqView[(T, S), Coll, CollSeq], ParSeqView[(T, S), Coll, CollSeq])

    Partitions this parallel iterable in two parallel iterables according to a predicate.

    Partitions this parallel iterable in two parallel iterables according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of parallel iterables: the first parallel iterable consists of all elements that satisfy the predicate p and the second parallel iterable consists of all elements that don't. The relative order of the elements in the resulting parallel iterables is the same as in the original parallel iterable.

  166. def patch ( from : Int , that : Seq[(T, S)] , replaced : Int ) : ParIterable[(T, S)]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original parallel iterable

    returns

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

    attributes: abstract
    definition classes: SeqLike
  167. def patch [U >: (T, S), That] ( from : Int , patch : Seq[U] , replace : Int )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

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

    Produces a new parallel iterable where a slice of elements in this parallel iterable 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

    bf

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

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  168. def permutations : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this parallel iterable.

    definition classes: SeqLike
    Example :
    1. "abb".permutations = Iterator(abb, bab, bba)

  169. def prefixLength ( p : ((T, S)) ⇒ 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 parallel iterable such that every element of the segment satisfies the predicate p.

    definition classes: ParSeqLikeSeqLike
  170. def product : (T, S)

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this parallel iterable of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the parallel iterable and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  171. def product [U >: (T, S)] (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 parallel iterable with respect to the * operator in num.

    definition classes: ParIterableLikeTraversableOnce
  172. def projection : SeqView[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    definition classes: SeqLikeIterableLike
    annotations: @deprecated( message = "use `view' instead" )
      deprecated:
    1. use view' instead

  173. def reduce [U >: (T, S)] ( 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 the operations on elements are performed is unspecified and may be nondeterministic.

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    definition classes: ParIterableLike
  174. def reduceLeft [U >: (T, S)] ( op : (U, (T, S)) ⇒ U ) : U

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

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

    Note: will not terminate for infinite-sized collections.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going left to right:

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

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

    definition classes: ParIterableLikeTraversableOnce
  175. def reduceLeftOption [B >: (T, S)] ( op : (B, (T, S)) ⇒ B ) : Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this parallel iterable is nonempty, None otherwise.

    definition classes: TraversableOnce
  176. def reduceOption [U >: (T, S)] ( 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 the operations on elements are performed is unspecified and may be nondeterministic.

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    definition classes: ParIterableLike
  177. def reduceRight [U >: (T, S)] ( op : ((T, S), U) ⇒ U ) : U

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

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

    Note: will not terminate for infinite-sized collections.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going right to left:

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

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

    definition classes: ParIterableLikeIterableLikeTraversableOnce
  178. def reduceRightOption [B >: (T, S)] ( op : ((T, S), B) ⇒ B ) : Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this parallel iterable is nonempty, None otherwise.

    definition classes: TraversableOnce
  179. def repr : ParSeqView[(T, S), Coll, CollSeq]

    The collection of type parallel iterable underlying this TraversableLike object.

    The collection of type parallel iterable underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
  180. 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
  181. def reverse : ParSeqView[(T, S), Coll, CollSeq]

    Returns new parallel iterable wih elements in reversed order.

    Returns new parallel iterable wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  182. def reverseIterator : Iterator[(T, S)]

    An iterator yielding elements in reversed order.

    An iterator yielding elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.

    returns

    an iterator yielding the elements of this parallel iterable in reversed order

    definition classes: SeqLike
  183. def reverseMap [B] ( f : ((T, S)) ⇒ B ) : ParIterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

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

    f

    the function to apply to each element.

    returns

    a new parallel iterable resulting from applying the given function f to each element of this parallel iterable and collecting the results in reversed order.

    attributes: abstract
    definition classes: SeqLike
  184. def reverseMap [S, That] ( f : ((T, S)) ⇒ S )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], S, That] ) : That

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

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

    Note: will not terminate for infinite-sized collections.

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

    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 the new element type B.

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  185. def reversed : List[(T, S)]

    attributes: protected[this]
    definition classes: TraversableOnce
  186. def reversedElements : Iterator[(T, S)]

    definition classes: SeqLike
    annotations: @deprecated( message = "use `reverseIterator' instead" )
      deprecated:
    1. use reverseIterator' instead

  187. def sameElements ( that : Iterable[(T, S)] ) : Boolean

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

    [use case]

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

    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: IterableLike
  188. def sameElements [U >: (T, S)] ( that : Iterable[U] ) : Boolean

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

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

    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: ParSeqLikeIterableLike
  189. def scan ( z : (T, S) )( op : ((T, S), (T, S)) ⇒ (T, S) ) : ParIterable[(T, S)]

    [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 new parallel iterable containing the prefix scan of the elements in this parallel iterable

    attributes: abstract
    definition classes: ParIterableLike
  190. def scan [U >: (T, S), That] ( z : U )( op : (U, U) ⇒ U )(implicit cbf : CanCombineFrom[ParSeqView[(T, S), Coll, CollSeq], 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

    cbf

    combiner factory which provides a combiner

    returns

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

    definition classes: ParIterableLike
  191. def scanBlockSize : Int

    attributes: protected[this]
    definition classes: ParIterableLike
  192. def scanLeft [S, That] ( z : S )( op : (S, (T, S)) ⇒ S )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], 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.

    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 the new element type B.

    returns

    collection with intermediate results

    definition classes: ParSeqViewLikeTraversableViewLikeTraversableLike
  193. def scanRight [S, That] ( z : S )( op : ((T, S), S) ⇒ S )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], 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.

    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 the new element type B.

    returns

    collection with intermediate results

    definition classes: ParSeqViewLikeTraversableViewLikeTraversableLike
  194. def segmentLength ( p : ((T, S)) ⇒ 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: ParSeqLikeSeqLike
  195. def seq : SeqView[(T, S), CollSeq]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    definition classes: ZippedZippedParIterableLikeSeqTraversableOnce
  196. def size : Int

    The size of this parallel iterable, equivalent to length.

    The size of this parallel iterable, equivalent to length.

    Note: will not terminate for infinite-sized collections.@return the number of elements in this parallel iterable.

    definition classes: ParSeqLikeSeqLikeTraversableOnce
  197. def slice ( from : Int , until : Int ) : ParSeqView[(T, S), Coll, CollSeq]

    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
    
    from

    the lowest index to include from this parallel iterable.

    until

    the highest index to EXCLUDE from this parallel iterable.

    returns

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

  198. def sliding [B >: (T, S)] ( size : Int , step : Int ) : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    definition classes: IterableViewLikeIterableLike
  199. def sliding [B >: (T, S)] ( size : Int ) : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing parallel iterables of size size, except the last and the only element will be truncated if there are fewer elements than size.

    definition classes: IterableLike
      see also:
    1. Iterator#sliding

  200. def sortBy [B] ( f : ((T, S)) ⇒ B )(implicit ord : Ordering[B] ) : ParSeqView[(T, S), Coll, CollSeq]

    Sorts this ParIterable according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    Sorts this ParIterable according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    B

    the target type of the transformation f, and the type where the ordering ord is defined.

    f

    the transformation function mapping elements to some other domain B.

    ord

    the ordering assumed on domain B.

    returns

    a parallel iterable consisting of the elements of this parallel iterable sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    definition classes: SeqLike
    Example :
    1.    val words = "The quick brown fox jumped over the lazy dog".split(' ')
         // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
         words.sortBy(x => (x.length, x.head))
         res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
      
      see also:
    1. scala.math.Ordering

      Note: will not terminate for infinite-sized collections.

  201. def sortWith ( lt : ((T, S), (T, S)) ⇒ Boolean ) : ParSeqView[(T, S), Coll, CollSeq]

    Sorts this parallel iterable according to a comparison function.

    Sorts this parallel iterable according to a comparison function.

    Note: will not terminate for infinite-sized collections.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    lt

    the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

    returns

    a parallel iterable consisting of the elements of this parallel iterable sorted according to the comparison function lt.

    definition classes: SeqLike
    Example :
    1.    List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
         List("Bob", "John", "Steve", "Tom")
      
  202. def sorted [U >: (T, S)] (implicit ord : Ordering[U] ) : ParSeqView[(T, S), Coll, CollSeq]

    Sorts this parallel iterable according to an Ordering.

    Sorts this parallel iterable according to an Ordering.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    ord

    the ordering to be used to compare elements.

    returns

    a parallel iterable consisting of the elements of this parallel iterable sorted according to the ordering ord.

    definition classes: ParSeqViewLikeSeqViewLikeSeqLike
      see also:
    1. scala.math.Ordering

  203. def span ( p : ((T, S)) ⇒ Boolean ) : (ParSeqView[(T, S), Coll, CollSeq], ParSeqView[(T, S), Coll, CollSeq])

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

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

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

    The index flag is initially set to maximum integer value.

    returns

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

  204. def splitAt ( n : Int ) : (ParSeqView[(T, S), Coll, CollSeq], ParSeqView[(T, S), Coll, CollSeq])

    Splits this parallel iterable into two at a given position.

    Splits this parallel iterable into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of parallel iterables consisting of the first n elements of this parallel iterable, and the other elements.

  205. def startsWith [S] ( that : Seq[S] , offset : Int ) : Boolean

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

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

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

    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: ParSeqLikeSeqLike
  206. def startsWith [S] ( that : Seq[S] ) : Boolean

    Tests whether this parallel iterable starts with the given sequence.

    Tests whether this parallel iterable starts with the given sequence.

    that

    the sequence to test

    returns

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

    definition classes: ParSeqLikeSeqLike
  207. 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 parallel iterable. By default the string prefix is the simple name of the collection class parallel iterable.

  208. def sum : (T, S)

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this parallel iterable of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the parallel iterable and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  209. def sum [U >: (T, S)] (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 parallel iterable with respect to the + operator in num.

    definition classes: ParIterableLikeTraversableOnce
  210. def synchronized [T0] ( arg0 : ⇒ T0 ) : T0

    attributes: final
    definition classes: AnyRef
  211. def tail : ParSeqView[(T, S), Coll, CollSeq]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

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

    definition classes: TraversableLike
  212. def tails : Iterator[ParSeqView[(T, S), Coll, CollSeq]]

    Iterates over the tails of this parallel iterable.

    Iterates over the tails of this parallel iterable. The first value will be this parallel iterable and the final one will be an empty parallel iterable, with the intervening values the results of successive applications of tail.

    returns

    an iterator over all the tails of this parallel iterable

    definition classes: TraversableLike
    Example :
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  213. def take ( n : Int ) : ParSeqView[(T, S), Coll, CollSeq]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this parallel iterable.

    returns

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

  214. def takeRight ( n : Int ) : ParSeqView[(T, S), Coll, CollSeq]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

    a parallel iterable consisting only of the last n elements of this parallel iterable, or else the whole parallel iterable, if it has less than n elements.

    definition classes: IterableLike
  215. def takeWhile ( p : ((T, S)) ⇒ Boolean ) : ParSeqView[(T, S), Coll, CollSeq]

    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.

    returns

    the longest prefix of this parallel iterable of elements that satisy the predicate pred

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

    attributes: protected implicit
    definition classes: ParIterableLike
  217. lazy val thatSeq : Seq[S]

    attributes: protected[this]
    definition classes: Zipped
  218. def thisCollection : Seq[(T, S)]

    The underlying collection seen as an instance of ParIterable.

    The underlying collection seen as an instance of ParIterable. By default this is implemented as the current collection object itself, but this can be overridden.

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  219. def thisParSeq : ParSeq[(T, S)]

    attributes: protected[this]
    definition classes: ParIterableViewLike
  220. def thisSeq : Seq[(T, S)]

    attributes: protected[this]
    definition classes: ViewMkStringViewMkString
  221. 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
  222. def toArray : Array[(T, S)]

    [use case] Converts this parallel iterable to an array.

    [use case]

    Converts this parallel iterable to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this parallel iterable. A ClassManifest must be available for the element type of this parallel iterable.

    attributes: abstract
    definition classes: TraversableOnce
  223. def toArray [U >: (T, S)] (implicit arg0 : ClassManifest[U] ) : Array[U]

    Converts this parallel iterable to an array.

    Converts this parallel iterable to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableOnce
  224. def toBuffer [U >: (T, S)] : Buffer[U]

    Converts this parallel iterable to a mutable buffer.

    Converts this parallel iterable to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableOnce
  225. def toCollection ( repr : ParSeqView[(T, S), Coll, CollSeq] ) : Seq[(T, S)]

    A conversion from collections of type Repr to ParIterable objects.

    A conversion from collections of type Repr to ParIterable objects. By default this is implemented as just a cast, but this can be overridden.

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  226. def toIndexedSeq [U >: (T, S)] : IndexedSeq[U]

    Converts this parallel iterable to an indexed sequence.

    Converts this parallel iterable to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableOnce
  227. def toIterable : ParIterable[(T, S)]

    Converts this parallel iterable to an iterable collection.

    Converts this parallel iterable to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterable containing all elements of this parallel iterable.

    definition classes: ParIterableLikeIterableLikeTraversableOnce
  228. def toIterator : Iterator[(T, S)]

    Returns an Iterator over the elements in this parallel iterable.

    Returns an Iterator over the elements in this parallel iterable. Will return the same Iterator if this instance is already an Iterator.

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableLikeTraversableOnce
  229. def toList : List[(T, S)]

    Converts this parallel iterable to a list.

    Converts this parallel iterable to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableOnce
  230. def toMap [T, U] : Map[T, U]

    [use case] Converts this parallel iterable to a map.

    [use case]

    Converts this parallel iterable to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    Note: will not terminate for infinite-sized collections.

    returns

    a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this parallel iterable.

    attributes: abstract
    definition classes: TraversableOnce
  231. def toMap [K, V] (implicit ev : <:<[(T, S), (K, V)] ) : ParMap[K, V]

    Converts this parallel iterable to a map.

    Converts this parallel iterable to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    Note: will not terminate for infinite-sized collections.

    returns

    a map containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableOnce
  232. def toParCollection [U >: (T, S), That] ( cbf : () ⇒ Combiner[U, That] ) : That

    attributes: protected
    definition classes: ParIterableLike
  233. def toParMap [K, V, That] ( cbf : () ⇒ Combiner[(K, V), That] )(implicit ev : <:<[(T, S), (K, V)] ) : That

    attributes: protected
    definition classes: ParIterableLike
  234. def toSeq : ParSeq[(T, S)]

    Converts this parallel iterable to a sequence.

    Converts this parallel iterable to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.

    Note: will not terminate for infinite-sized collections.

    returns

    a sequence containing all elements of this parallel iterable.

    definition classes: ParSeqLikeParIterableLikeSeqLikeTraversableOnce
  235. def toSet [U >: (T, S)] : ParSet[U]

    Converts this parallel iterable to a set.

    Converts this parallel iterable to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableOnce
  236. def toStream : Stream[(T, S)]

    Converts this parallel iterable to a stream.

    Converts this parallel iterable to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this parallel iterable.

  237. def toString () : String

    Converts this parallel iterable to a string.

    Converts this parallel iterable to a string.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this parallel iterable, followed by all elements separated by commas and enclosed in parentheses.

    definition classes: ParSeqParSeqLikeParIterableLikeSeqLikeTraversableLikeFunction1 → AnyRef → Any
  238. def toTraversable : Traversable[(T, S)]

    Converts this parallel iterable to an unspecified Traversable.

    Converts this parallel iterable to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this parallel iterable.

    definition classes: ParIterableLikeTraversableLikeTraversableOnce
  239. def transpose [B] (implicit asTraversable : ((T, S)) ⇒ TraversableOnce[B] ) : ParSeq[ParSeq[B]]

    Transposes this parallel iterable of traversable collections into a parallel iterable of parallel iterables.

    Transposes this parallel iterable of traversable collections into a parallel iterable of parallel iterables.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a two-dimensional parallel iterable of parallel iterables which has as nth row the nth column of this parallel iterable.

    definition classes: GenericTraversableTemplate
    annotations: @migration( 2 , 9 , ... )
  240. lazy val underlying : Coll

    definition classes: TransformedTraversableViewLike
  241. def union ( that : Seq[(T, S)] ) : ParIterable[(T, S)]

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

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add.

    returns

    a new parallel iterable which contains all elements of this parallel iterable followed by all elements of that.

    attributes: abstract
    definition classes: SeqLike
  242. def union [U >: (T, S), That] ( that : Seq[U] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

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

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

    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.

    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 the new element type B.

    returns

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

    definition classes: ParSeqViewLikeSeqViewLikeSeqLike
  243. def unzip [A1, A2] (implicit asPair : ((T, S)) ⇒ (A1, A2) ) : (ParSeq[A1], ParSeq[A2])

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

    Converts this parallel iterable 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 parallel iterable is a pair.

    returns

    a pair parallel iterables, containing the first, respectively second half of each element pair of this parallel iterable.

    definition classes: GenericTraversableTemplate
  244. def unzip3 [A1, A2, A3] (implicit asTriple : ((T, S)) ⇒ (A1, A2, A3) ) : (ParSeq[A1], ParSeq[A2], ParSeq[A3])

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

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

    returns

    a triple parallel iterables, containing the first, second, respectively third member of each element triple of this parallel iterable.

    definition classes: GenericTraversableTemplate
  245. def updated ( index : Int , elem : (T, S) ) : ParIterable[(T, S)]

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

    [use case]

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

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this parallel iterable with the element at position index replaced by elem.

    attributes: abstract
    definition classes: SeqLike
  246. def updated [U >: (T, S), That] ( index : Int , elem : U )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], U, That] ) : That

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

    A copy of this parallel iterable 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 the new element type B.

    returns

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

    definition classes: ParSeqViewLikeParSeqLikeSeqViewLikeSeqLike
  247. def view ( from : Int , until : Int ) : ParSeqView[(T, S), ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]]

    Creates a non-strict view of a slice of this parallel iterable.

    Creates a non-strict view of a slice of this parallel iterable.

    Note: the difference between view and slice is that view produces a view of the current parallel iterable, whereas slice produces a new parallel iterable.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this parallel iterable, starting at index from and extending up to (but not including) index until.

    definition classes: ParSeqLikeSeqLikeIterableLikeTraversableLike
  248. def view : ParSeqView[(T, S), ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]]

    Creates a non-strict view of this parallel iterable.

    Creates a non-strict view of this parallel iterable.

    returns

    a non-strict view of this parallel iterable.

    definition classes: ParSeqLikeParIterableLikeSeqLikeIterableLikeTraversableLike
  249. def viewIdString : String

    attributes: protected[this] final
    definition classes: TransformedTraversableViewLike
  250. def viewIdentifier : String

    attributes: protected[this] final
    definition classes: ZippedTraversableViewLike
  251. def viewToString : String

    definition classes: TraversableViewLike
  252. def wait () : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  253. def wait ( arg0 : Long , arg1 : Int ) : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  254. def wait ( arg0 : Long ) : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  255. def withFilter ( p : ((T, S)) ⇒ Boolean ) : ParSeqView[(T, S), Coll, CollSeq]

    Creates a non-strict filter of this parallel iterable.

    Creates a non-strict filter of this parallel iterable.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this parallel iterable which satisfy the predicate p.

    definition classes: TraversableViewLikeTraversableLikeFilterMonadic
  256. def wrap [R] ( body : ⇒ R ) : NonDivisible[R]

    attributes: protected
    definition classes: ParIterableLike
  257. def zip [B] ( that : Iterable[B] ) : ParIterable[((T, S), B)]

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

    [use case]

    Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

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

    attributes: abstract
    definition classes: IterableLike
  258. def zip [U >: (T, S), S, That] ( that : Iterable[S] )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], (U, S), That] ) : That

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

    Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    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 parallel iterable and that. The length of the returned collection is the minimum of the lengths of this parallel iterable and that.

  259. def zipAll [B] ( that : Iterable[B] , thisElem : (T, S) , thatElem : B ) : ParIterable[((T, S), B)]

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

    [use case]

    Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    attributes: abstract
    definition classes: IterableLike
  260. def zipAll [S, U >: (T, S), That] ( that : Iterable[S] , thisElem : U , thatElem : S )(implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], (U, S), That] ) : That

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

    Returns a parallel iterable formed from this parallel iterable and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

  261. def zipWithIndex : ParIterable[((T, S), Int)]

    [use case] Zips this parallel iterable with its indices.

    [use case]

    Zips this parallel iterable with its indices.

    returns

    A new parallel iterable containing pairs consisting of all elements of this parallel iterable paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  262. def zipWithIndex [U >: (T, S), That] (implicit bf : CanBuildFrom[ParSeqView[(T, S), Coll, CollSeq], (U, Int), That] ) : That

    Zips this parallel iterable with its indices.

    Zips this parallel iterable with its indices.

    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 parallel iterable paired with their index. Indices start at 0.

Inherited from Transformed[(T, S)]

Inherited from ParSeqView[(T, S), Coll, CollSeq]

Inherited from ParSeqViewLike[(T, S), Coll, CollSeq, ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]]

Inherited from ParSeq[(T, S)]

Inherited from ParSeqLike[(T, S), ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]]

Inherited from Zipped[S]

Inherited from Transformed[(T, S)]

Inherited from ParIterableView[(T, S), Coll, CollSeq]

Inherited from ParIterableViewLike[(T, S), Coll, CollSeq, ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]]

Inherited from ParIterable[(T, S)]

Inherited from ParIterableLike[(T, S), ParSeqView[(T, S), Coll, CollSeq], SeqView[(T, S), CollSeq]]

Inherited from Parallel

Inherited from CustomParallelizable[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from GenericParTemplate[(T, S), ParSeq]

Inherited from HasNewCombiner[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from Zipped[S]

Inherited from Transformed[(T, S)]

Inherited from SeqView[(T, S), Coll]

Inherited from SeqViewLike[(T, S), Coll, ParSeqView[(T, S), Coll, CollSeq]]

Inherited from Seq[(T, S)]

Inherited from SeqLike[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from PartialFunction[Int, (T, S)]

Inherited from (Int) ⇒ (T, S)

Inherited from Zipped[S]

Inherited from Transformed[(T, S)]

Inherited from Transformed[(T, S)]

Inherited from IterableView[(T, S), Coll]

Inherited from IterableViewLike[(T, S), Coll, ParSeqView[(T, S), Coll, CollSeq]]

Inherited from TraversableView[(T, S), Coll]

Inherited from TraversableViewLike[(T, S), Coll, ParSeqView[(T, S), Coll, CollSeq]]

Inherited from ViewMkString[(T, S)]

Inherited from Iterable[(T, S)]

Inherited from IterableLike[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from Equals

Inherited from Traversable[(T, S)]

Inherited from GenericTraversableTemplate[(T, S), ParSeq]

Inherited from TraversableLike[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from Parallelizable[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from TraversableOnce[(T, S)]

Inherited from FilterMonadic[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from HasNewBuilder[(T, S), ParSeqView[(T, S), Coll, CollSeq]]

Inherited from AnyRef

Inherited from Any