scala.collection.parallel.ParIterableViewLike

ZippedAll

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

definition classes: ParIterableViewLikeIterableViewLike
linear super types: Transformed[(U, S)], ParIterableView[(U, S), Coll, CollSeq], ParIterableViewLike[(U, S), Coll, CollSeq, ParIterableView[(U, S), Coll, CollSeq], IterableView[(U, S), CollSeq]], ParIterable[(U, S)], ParIterableLike[(U, S), ParIterableView[(U, S), Coll, CollSeq], IterableView[(U, S), CollSeq]], Parallel, CustomParallelizable[(U, S), ParIterableView[(U, S), Coll, CollSeq]], GenericParTemplate[(U, S), ParIterable], HasNewCombiner[(U, S), ParIterableView[(U, S), Coll, CollSeq]], ZippedAll[U, S], Transformed[(U, S)], Transformed[(U, S)], IterableView[(U, S), Coll], IterableViewLike[(U, S), Coll, ParIterableView[(U, S), Coll, CollSeq]], TraversableView[(U, S), Coll], TraversableViewLike[(U, S), Coll, ParIterableView[(U, S), Coll, CollSeq]], ViewMkString[(U, S)], Iterable[(U, S)], IterableLike[(U, S), ParIterableView[(U, S), Coll, CollSeq]], Equals, Traversable[(U, S)], GenericTraversableTemplate[(U, S), ParIterable], TraversableLike[(U, S), ParIterableView[(U, S), Coll, CollSeq]], Parallelizable[(U, S), ParIterableView[(U, S), Coll, CollSeq]], TraversableOnce[(U, S)], FilterMonadic[(U, S), ParIterableView[(U, S), Coll, CollSeq]], HasNewBuilder[(U, S), ParIterableView[(U, S), Coll, CollSeq]], AnyRef, Any
known subclasses: ZippedAll
source: ParIterableViewLike.scala
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. ZippedAll
  2. Transformed
  3. ParIterableView
  4. ParIterableViewLike
  5. ParIterable
  6. ParIterableLike
  7. Parallel
  8. CustomParallelizable
  9. GenericParTemplate
  10. HasNewCombiner
  11. ZippedAll
  12. Transformed
  13. Transformed
  14. IterableView
  15. IterableViewLike
  16. TraversableView
  17. TraversableViewLike
  18. ViewMkString
  19. Iterable
  20. IterableLike
  21. Equals
  22. Traversable
  23. GenericTraversableTemplate
  24. TraversableLike
  25. Parallelizable
  26. TraversableOnce
  27. FilterMonadic
  28. HasNewBuilder
  29. AnyRef
  30. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Type Members

  1. trait Accessor [R, Tp] extends StrictSplitterCheckTask[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 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 Count extends Accessor[Int, Count]

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

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

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

    definition classes: IterableViewLikeTraversableViewLike
  13. trait EmptyView extends Transformed[Nothing] with EmptyView

    definition classes: IterableViewLikeTraversableViewLike
  14. class Exists extends Accessor[Boolean, Exists]

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

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

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

    definition classes: IterableViewLikeTraversableViewLike
  18. class Find [U >: T] extends Accessor[Option[U], Find[U]]

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

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

    definition classes: IterableViewLikeTraversableViewLike
  21. class Fold [U >: T] extends Accessor[U, Fold[U]]

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

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

    attributes: protected[this]
  24. trait Forced [S] extends Forced[S] with Transformed[S]

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

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

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

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

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

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

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

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

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

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

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

  35. trait ParIterator extends ParIterableIterator[T]

    Parallel iterators are split iterators that have additional accessor and transformer methods defined in terms of methods next and hasNext.

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

    attributes: protected[this]
  37. class Product [U >: T] extends Accessor[U, Product[U]]

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

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

    attributes: protected[this] abstract
  40. type SSCTask [R, Tp] = StrictSplitterCheckTask[R, Tp]

    definition classes: ParIterableLike
  41. 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]
  42. case class ScanNode [U >: T] ( left : ScanTree[U] , right : ScanTree[U] ) extends ScanTree[U] with Product with Serializable

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

    attributes: protected[this]
  44. type Self = ParIterableView[(U, S), Coll, CollSeq]

    The type implementing this traversable

    The type implementing this traversable

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

  46. trait SignalContextPassingIterator [+IterRepr <: ParIterator] extends ParIterator

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

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

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

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

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

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

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

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

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

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

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

    definition classes: IterableViewLikeTraversableViewLike
  57. trait TaskOps [R, Tp] extends AnyRef

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

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

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

    The implementation base trait of this view.

  61. trait Transformer [R, Tp] extends Accessor[R, Tp]

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

    A class supporting filtered operations.

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

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

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

    definition classes: ParIterableViewLikeIterableViewLike
  66. trait ZippedAll [U >: T, S] extends ZippedAll[U, S] with Transformed[(U, S)]

    definition classes: ParIterableViewLikeIterableViewLike

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 >: (U, S), That] ( xs : TraversableOnce[U] )(implicit bf : CanBuildFrom[ParIterableView[(U, 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 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 >: (U, S), That] ( that : Traversable[B] )(implicit bf : CanBuildFrom[ParIterableView[(U, 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 >: (U, S), That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[ParIterableView[(U, 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 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 /: [B] ( z : B )( op : (B, (U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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
  12. def :\ [B] ( z : B )( op : ((U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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
  13. 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
  14. 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
  15. def addString ( b : StringBuilder , start : String , sep : String , end : String ) : StringBuilder

    definition classes: ViewMkStringTraversableOnceViewMkString
  16. 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
  17. 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
  18. def aggregate [S] ( z : S )( seqop : (S, (U, 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
  19. 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
  20. implicit def builder2ops [Elem, To] ( cb : Builder[Elem, To] ) : BuilderOps[Elem, To]

    attributes: protected implicit
    definition classes: ParIterableLike
  21. 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
  22. def cbfactory : () ⇒ Combiner[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

    attributes: protected[this]
    definition classes: ParIterableLike
  23. 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()
  24. def collect [B] ( pf : PartialFunction[(U, 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
  25. def collect [S, That] ( pf : PartialFunction[(U, S), S] )(implicit bf : CanBuildFrom[ParIterableView[(U, 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 and the new element type B.

    returns

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

    definition classes: ParIterableLikeTraversableLike
  26. def collectFirst [B] ( pf : PartialFunction[(U, 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.

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

    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)

  27. def companion : GenericCompanion[ParIterable] with GenericParCompanion[ParIterable]

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

  28. def copyToArray ( xs : Array[(U, 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
  29. def copyToArray [U >: (U, 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.

  30. def copyToArray ( xs : Array[(U, 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
  31. def copyToArray [B >: (U, 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
  32. def copyToArray ( xs : Array[(U, 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
  33. def copyToArray [B >: (U, 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
  34. def copyToBuffer [B >: (U, 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
  35. def count ( p : ((U, 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
  36. def debugBuffer : ArrayBuffer[String]

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

    attributes: protected implicit
    definition classes: ParIterableLike
  38. def drop ( n : Int ) : ParIterableView[(U, S), Coll, CollSeq]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

    the number of elements to drop from this 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.

  39. def dropRight ( n : Int ) : ParIterableView[(U, S), Coll, CollSeq]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

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

    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
  40. def dropWhile ( p : ((U, S)) ⇒ Boolean ) : ParIterableView[(U, 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

  41. def elements : Iterator[(U, S)]

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

  42. 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
  43. def equals ( arg0 : Any ) : Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same Int (o1.hashCode.equals(o2.hashCode)).

    arg0

    the object to compare against this object for equality.

    returns

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

    definition classes: AnyRef → Any
  44. def exists ( pred : ((U, 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

  45. def filter ( p : ((U, S)) ⇒ Boolean ) : ParIterableView[(U, 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.

  46. def filterNot ( p : ((U, S)) ⇒ Boolean ) : ParIterableView[(U, 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.

  47. 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()
  48. def find ( pred : ((U, S)) ⇒ Boolean ) : Option[(U, 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

  49. def first : (U, S)

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

  50. def firstOption : Option[(U, 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

  51. def flatMap [B] ( f : ((U, 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
  52. def flatMap [S, That] ( f : ((U, S)) ⇒ TraversableOnce[S] )(implicit bf : CanBuildFrom[ParIterableView[(U, 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 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.

  53. 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
  54. def flatten [B] (implicit asTraversable : ((U, S)) ⇒ TraversableOnce[B] ) : ParIterable[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
  55. def fold [U >: (U, 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
  56. def foldLeft [S] ( z : S )( op : (S, (U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    definition classes: ParIterableLikeTraversableOnce
  57. def foldRight [S] ( z : S )( op : ((U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    definition classes: ParIterableLikeIterableLikeTraversableOnce
  58. def forall ( pred : ((U, 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

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

    definition classes: ParIterableViewLikeTraversableViewLike
  60. def foreach [U] ( f : ((U, 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

  61. def genericBuilder [B] : Combiner[B, ParIterable[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.

  62. def genericCombiner [B] : Combiner[B, ParIterable[B]]

    definition classes: GenericParTemplate
  63. 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
  64. def groupBy [K] ( f : ((U, S)) ⇒ K ) : ParMap[K, ParIterableView[(U, 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.

    definition classes: ParIterableLikeTraversableLike
  65. def grouped ( size : Int ) : Iterator[ParIterableView[(U, 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

  66. 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
  67. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: AnyRef → Any
  68. def head : (U, S)

    Selects the first element of this parallel iterable.

    Selects the first element of this parallel iterable.

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

    returns

    the first element of this parallel iterable.

    definition classes: IterableLikeTraversableLike
  69. def headOption : Option[(U, S)]

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

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

    definition classes: TraversableLike
  70. def init : ParIterableView[(U, S), Coll, CollSeq]

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

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

    definition classes: TraversableViewLikeTraversableLike
  71. def inits : Iterator[ParIterableView[(U, 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)

  72. 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
  73. 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
  74. 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
  75. 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
  76. def iterator : ParIterableIterator[(U, 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: TransformedTransformedParIterableLikeIterableLike
  77. def last : (U, S)

    Selects the last element.

    Selects the last element.

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

    returns

    The last element of this parallel iterable.

    definition classes: TraversableLike
  78. def lastOption : Option[(U, S)]

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

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

    definition classes: TraversableLike
  79. def map [B] ( f : ((U, 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
  80. def map [S, That] ( f : ((U, S)) ⇒ S )(implicit bf : CanBuildFrom[ParIterableView[(U, 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 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.

  81. def max : (U, 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
  82. def max [U >: (U, S)] (implicit ord : Ordering[U] ) : (U, 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
  83. def maxBy [S] ( f : ((U, S)) ⇒ S )(implicit cmp : Ordering[S] ) : (U, S)

    definition classes: ParIterableLikeTraversableOnce
  84. def min : (U, 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
  85. def min [U >: (U, S)] (implicit ord : Ordering[U] ) : (U, 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
  86. def minBy [S] ( f : ((U, S)) ⇒ S )(implicit cmp : Ordering[S] ) : (U, S)

    definition classes: ParIterableLikeTraversableOnce
  87. 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
  88. 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"

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

  90. 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
  91. def newAppended [U >: (U, S)] ( that : Traversable[U] ) : Transformed[U]

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

    attributes: protected
    definition classes: ParIterableViewLike
  93. def newBuilder : Builder[(U, S), ParIterableView[(U, 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
  94. def newCombiner : Combiner[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

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

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

    attributes: protected
  97. def newFiltered ( p : ((U, S)) ⇒ Boolean ) : Nothing

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

    attributes: protected
  99. 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
  100. def newForcedTryParIterable [S] ( xs : ⇒ Seq[S] ) : Transformed[S]

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

    attributes: protected
  102. def newSliced ( _endpoints : SliceInterval ) : Transformed[(U, S)]

    attributes: protected
  103. def newTaken ( n : Int ) : Transformed[(U, S)]

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

    attributes: protected
  105. def newZipped [S] ( that : Iterable[S] ) : Transformed[((U, 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
    definition classes: ParIterableViewLikeIterableViewLike
  106. def newZippedAll [U >: (U, S), S] ( that : Iterable[S] , _thisElem : U , _thatElem : S ) : Transformed[(U, S)]

    attributes: protected
    definition classes: ParIterableViewLikeIterableViewLike
  107. def newZippedAllTryParSeq [S, U >: (U, S)] ( that : Iterable[S] , thisElem : U , thatElem : S ) : Transformed[(U, S)]

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

    attributes: protected
    definition classes: ParIterableViewLike
  109. 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
  110. 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
  111. 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
  112. val other : Iterable[S]

    attributes: protected[this] abstract
    definition classes: ZippedAll
  113. def otherPar : ParSeq[S]

  114. def par : ParIterableView[(U, 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

  115. def parCombiner : Combiner[(U, S), ParIterableView[(U, 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]
  116. def parallelIterator : ParIterableIterator[(U, 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: ZippedAllTransformedParIterableLike
  117. def partition ( p : ((U, S)) ⇒ Boolean ) : (ParIterableView[(U, S), Coll, CollSeq], ParIterableView[(U, 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.

  118. def product : (U, 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
  119. def product [U >: (U, 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
  120. def projection : IterableView[(U, S), ParIterableView[(U, 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: IterableLike
    annotations: @deprecated( message = "use `view' instead" )
      deprecated:
    1. use view' instead

  121. def reduce [U >: (U, 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
  122. def reduceLeft [U >: (U, S)] ( op : (U, (U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going 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
  123. def reduceLeftOption [B >: (U, S)] ( op : (B, (U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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
  124. def reduceOption [U >: (U, 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
  125. def reduceRight [U >: (U, S)] ( op : ((U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    op

    the binary operator.

    returns

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

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

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

    definition classes: ParIterableLikeIterableLikeTraversableOnce
  126. def reduceRightOption [B >: (U, S)] ( op : ((U, 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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
  127. def repr : ParIterableView[(U, 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
  128. 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
  129. def reversed : List[(U, S)]

    attributes: protected[this]
    definition classes: TraversableOnce
  130. def sameElements ( that : Iterable[(U, 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
  131. def sameElements [B >: (U, S)] ( that : Iterable[B] ) : 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: might return different results for different runs, unless the underlying collection type is ordered.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    definition classes: IterableLike
  132. def scan ( z : (U, S) )( op : ((U, S), (U, S)) ⇒ (U, S) ) : ParIterable[(U, 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
  133. def scan [U >: (U, S), That] ( z : U )( op : (U, U) ⇒ U )(implicit cbf : CanCombineFrom[ParIterableView[(U, 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
  134. def scanBlockSize : Int

    attributes: protected[this]
    definition classes: ParIterableLike
  135. def scanLeft [B, That] ( z : B )( op : (B, (U, S)) ⇒ B )(implicit bf : CanBuildFrom[ParIterableView[(U, S), Coll, CollSeq], B, That] ) : That

    Produces a collection containing cummulative results of applying the operator going left to right.

    Produces a collection containing cummulative results of applying the operator going left to right.

    Note: will not terminate for infinite-sized collections.

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    definition classes: TraversableViewLikeTraversableLike
  136. def scanRight [B, That] ( z : B )( op : ((U, S), B) ⇒ B )(implicit bf : CanBuildFrom[ParIterableView[(U, S), Coll, CollSeq], B, That] ) : That

    Produces a collection containing cummulative results of applying the operator going right to left.

    Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

    Note: will not terminate for infinite-sized collections.

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    definition classes: TraversableViewLikeTraversableLike
    annotations: @migration( 2 , 9 , ... )
  137. def seq : IterableView[(U, 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: ZippedAllParIterableLikeTraversableOnce
  138. def size : Int

    The size of this parallel iterable.

    The size of this parallel iterable.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this parallel iterable.

    definition classes: TraversableOnce
  139. def slice ( from : Int , until : Int ) : ParIterableView[(U, 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
    

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

    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.

  140. def sliding [B >: (U, S)] ( size : Int , step : Int ) : Iterator[ParIterableView[(U, S), Coll, CollSeq]]

    definition classes: IterableViewLikeIterableLike
  141. def sliding [B >: (U, S)] ( size : Int ) : Iterator[ParIterableView[(U, 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

  142. def span ( p : ((U, S)) ⇒ Boolean ) : (ParIterableView[(U, S), Coll, CollSeq], ParIterableView[(U, 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

  143. def splitAt ( n : Int ) : (ParIterableView[(U, S), Coll, CollSeq], ParIterableView[(U, 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).

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

    n

    the position at which to split.

    returns

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

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

    definition classes: TransformedTraversableViewLikeTraversableLike
  145. def sum : (U, 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
  146. def sum [U >: (U, 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
  147. def synchronized [T0] ( arg0 : ⇒ T0 ) : T0

    attributes: final
    definition classes: AnyRef
  148. def tail : ParIterableView[(U, S), Coll, CollSeq]

    Selects all elements except the first.

    Selects all elements except the first.

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

    returns

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

    definition classes: TraversableLike
  149. def tails : Iterator[ParIterableView[(U, 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)

  150. def take ( n : Int ) : ParIterableView[(U, S), Coll, CollSeq]

    Selects first n elements.

    Selects first n elements.

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

    n

    Tt number of elements to take from this 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.

  151. def takeRight ( n : Int ) : ParIterableView[(U, S), Coll, CollSeq]

    Selects last n elements.

    Selects last n elements.

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

    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
  152. def takeWhile ( p : ((U, S)) ⇒ Boolean ) : ParIterableView[(U, 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

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

    attributes: protected implicit
    definition classes: ParIterableLike
  154. val thatElem : S

    attributes: protected[this] abstract
    definition classes: ZippedAll
  155. def thisCollection : Iterable[(U, 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: IterableLikeTraversableLike
  156. val thisElem : U

    attributes: protected[this] abstract
    definition classes: ZippedAll
  157. def thisParSeq : ParSeq[(U, S)]

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

    attributes: protected[this]
    definition classes: ViewMkStringViewMkString
  159. 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
  160. def toArray : Array[(U, 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
  161. def toArray [U >: (U, 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
  162. def toBuffer [U >: (U, 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
  163. def toCollection ( repr : ParIterableView[(U, S), Coll, CollSeq] ) : Iterable[(U, 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: IterableLikeTraversableLike
  164. def toIndexedSeq [U >: (U, 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
  165. def toIterable : ParIterable[(U, 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
  166. def toIterator : Iterator[(U, 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
  167. def toList : List[(U, 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
  168. 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
  169. def toMap [K, V] (implicit ev : <:<[(U, 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
  170. def toParCollection [U >: (U, S), That] ( cbf : () ⇒ Combiner[U, That] ) : That

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

    attributes: protected
    definition classes: ParIterableLike
  172. def toSeq : ParSeq[(U, 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: ParIterableLikeTraversableOnce
  173. def toSet [U >: (U, 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
  174. def toStream : Stream[(U, 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.

  175. 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: ParIterableLikeTraversableLike → AnyRef → Any
  176. def toTraversable : Traversable[(U, 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
  177. def transpose [B] (implicit asTraversable : ((U, S)) ⇒ TraversableOnce[B] ) : ParIterable[ParIterable[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 , ... )
  178. lazy val underlying : Coll

    definition classes: TransformedTraversableViewLike
  179. def unzip [A1, A2] (implicit asPair : ((U, S)) ⇒ (A1, A2) ) : (ParIterable[A1], ParIterable[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
  180. def unzip3 [A1, A2, A3] (implicit asTriple : ((U, S)) ⇒ (A1, A2, A3) ) : (ParIterable[A1], ParIterable[A2], ParIterable[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
  181. def view : ParIterableView[(U, S), ParIterableView[(U, S), Coll, CollSeq], IterableView[(U, 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: ParIterableLikeIterableLikeTraversableLike
  182. def view ( from : Int , until : Int ) : IterableView[(U, S), ParIterableView[(U, S), Coll, 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)

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

    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: IterableLikeTraversableLike
  183. def viewIdString : String

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

    attributes: protected[this] final
    definition classes: ZippedAllTraversableViewLike
  185. def viewToString : String

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

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

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

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  189. def withFilter ( p : ((U, S)) ⇒ Boolean ) : ParIterableView[(U, 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.

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

    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
  190. def wrap [R] ( body : ⇒ R ) : NonDivisible[R]

    attributes: protected
    definition classes: ParIterableLike
  191. def zip [B] ( that : Iterable[B] ) : ParIterable[((U, 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
  192. def zip [U >: (U, S), S, That] ( that : Iterable[S] )(implicit bf : CanBuildFrom[ParIterableView[(U, 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.

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

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

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

  193. def zipAll [B] ( that : Iterable[B] , thisElem : (U, S) , thatElem : B ) : ParIterable[((U, 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
  194. def zipAll [S, U >: (U, S), That] ( that : Iterable[S] , thisElem : U , thatElem : S )(implicit bf : CanBuildFrom[ParIterableView[(U, 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.

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

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this 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.

  195. def zipWithIndex : ParIterable[((U, 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
  196. def zipWithIndex [U >: (U, S), That] (implicit bf : CanBuildFrom[ParIterableView[(U, S), Coll, CollSeq], (U, Int), That] ) : That

    Zips this parallel iterable with its indices.

    Zips this parallel iterable with its indices.

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

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

Inherited from Transformed[(U, S)]

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

Inherited from ParIterableViewLike[(U, S), Coll, CollSeq, ParIterableView[(U, S), Coll, CollSeq], IterableView[(U, S), CollSeq]]

Inherited from ParIterable[(U, S)]

Inherited from ParIterableLike[(U, S), ParIterableView[(U, S), Coll, CollSeq], IterableView[(U, S), CollSeq]]

Inherited from Parallel

Inherited from CustomParallelizable[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from GenericParTemplate[(U, S), ParIterable]

Inherited from HasNewCombiner[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from ZippedAll[U, S]

Inherited from Transformed[(U, S)]

Inherited from Transformed[(U, S)]

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

Inherited from IterableViewLike[(U, S), Coll, ParIterableView[(U, S), Coll, CollSeq]]

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

Inherited from TraversableViewLike[(U, S), Coll, ParIterableView[(U, S), Coll, CollSeq]]

Inherited from ViewMkString[(U, S)]

Inherited from Iterable[(U, S)]

Inherited from IterableLike[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from Equals

Inherited from Traversable[(U, S)]

Inherited from GenericTraversableTemplate[(U, S), ParIterable]

Inherited from TraversableLike[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from Parallelizable[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from TraversableOnce[(U, S)]

Inherited from FilterMonadic[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from HasNewBuilder[(U, S), ParIterableView[(U, S), Coll, CollSeq]]

Inherited from AnyRef

Inherited from Any