scala.collection.parallel.ParSeqViewLike

Mapped

trait Mapped[S] extends Mapped[S] with Mapped[S] with Transformed[S]

Definition Classes
ParSeqViewLikeParIterableViewLikeGenSeqViewLikeGenIterableViewLikeGenTraversableViewLike
Source
ParSeqViewLike.scala
Linear Supertypes
Transformed[S], ParSeqView[S, Coll, CollSeq], ParSeqViewLike[S, Coll, CollSeq, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]], ParSeq[S], ParSeqLike[S, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]], Mapped[S], Transformed[S], ParIterableView[S, Coll, CollSeq], ParIterableViewLike[S, Coll, CollSeq, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]], ParIterable[S], ParIterableLike[S, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]], Parallel, CustomParallelizable[S, ParSeqView[S, Coll, CollSeq]], GenericParTemplate[S, ParSeq], HasNewCombiner[S, ParSeqView[S, Coll, CollSeq]], Mapped[S], Transformed[S], GenSeqView[S, Coll], GenSeqViewLike[S, Coll, ParSeqView[S, Coll, CollSeq]], GenSeq[S], GenSeqLike[S, ParSeqView[S, Coll, CollSeq]], Equals, Mapped[S], Transformed[S], GenIterableView[S, Coll], GenIterableViewLike[S, Coll, ParSeqView[S, Coll, CollSeq]], GenIterable[S], GenIterableLike[S, ParSeqView[S, Coll, CollSeq]], Mapped[S], Transformed[S], GenTraversableView[S, Coll], GenTraversableViewLike[S, Coll, ParSeqView[S, Coll, CollSeq]], GenTraversable[S], GenericTraversableTemplate[S, ParSeq], HasNewBuilder[S, ParSeq[S]], GenTraversableLike[S, ParSeqView[S, Coll, CollSeq]], Parallelizable[S, ParSeqView[S, Coll, CollSeq]], GenTraversableOnce[S], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Mapped
  2. Transformed
  3. ParSeqView
  4. ParSeqViewLike
  5. ParSeq
  6. ParSeqLike
  7. Mapped
  8. Transformed
  9. ParIterableView
  10. ParIterableViewLike
  11. ParIterable
  12. ParIterableLike
  13. Parallel
  14. CustomParallelizable
  15. GenericParTemplate
  16. HasNewCombiner
  17. Mapped
  18. Transformed
  19. GenSeqView
  20. GenSeqViewLike
  21. GenSeq
  22. GenSeqLike
  23. Equals
  24. Mapped
  25. Transformed
  26. GenIterableView
  27. GenIterableViewLike
  28. GenIterable
  29. GenIterableLike
  30. Mapped
  31. Transformed
  32. GenTraversableView
  33. GenTraversableViewLike
  34. GenTraversable
  35. GenericTraversableTemplate
  36. HasNewBuilder
  37. GenTraversableLike
  38. Parallelizable
  39. GenTraversableOnce
  40. AnyRef
  41. Any
Visibility
  1. Public
  2. All

Type Members

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

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

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

    Attributes
    protected[this]
  3. trait Appended[U >: T] extends Appended[U] with Appended[U] with Transformed[U]

  4. trait BuilderOps[Elem, To] extends AnyRef

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

    Attributes
    protected[this]
  6. abstract class Composite[FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR,_$3] forSome { type _$3 }, Second <: ParIterableLike.this.StrictSplitterCheckTask[SR,_$4] forSome { type _$4 }] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]

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

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

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

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

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

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

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

  14. abstract class Elements extends SeqSplitter[T] with BufferedIterator[T]

    Used to iterate elements using indices

  15. trait EmptyView extends Transformed[Nothing] with EmptyView

  16. class Exists extends Accessor[Boolean, Exists]

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

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

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

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

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

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

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  26. trait Forced[S] extends Forced[S] with Forced[S] with Transformed[S]

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected[this]
  38. abstract class ParComposite[FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR,_$7] forSome { type _$7 }, Second <: ParIterableLike.this.StrictSplitterCheckTask[SR,_$8] forSome { type _$8 }] extends Composite[FR, SR, R, First, Second]

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

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

    Attributes
    protected[this]
  40. trait Patched[U >: T] extends Patched[U] with Transformed[U]

    Definition Classes
    ParSeqViewLikeGenSeqViewLike
  41. trait Prepended[U >: T] extends Prepended[U] with Transformed[U]

    Definition Classes
    ParSeqViewLikeGenSeqViewLike
  42. class Product[U >: T] extends Accessor[U, Product[U]]

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

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

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

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

    Attributes
    protected[this]
  47. trait Reversed extends Reversed with Transformed[T]

    Definition Classes
    ParSeqViewLikeGenSeqViewLike
  48. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

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

    Attributes
    protected[this]
  50. case class ScanLeaf[U >: T](pit: IterableSplitter[U], op: (U, U) ⇒ U, from: Int, len: Int, prev: Option[ScanLeaf[U]], acc: U) extends ScanTree[U] with Product with Serializable

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

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

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

    Attributes
    protected[this]
  54. abstract class SeqComposite[FR, SR, R, First <: ParIterableLike.this.StrictSplitterCheckTask[FR,_$5] forSome { type _$5 }, Second <: ParIterableLike.this.StrictSplitterCheckTask[SR,_$6] forSome { type _$6 }] extends Composite[FR, SR, R, First, Second]

    Sequentially performs one task after another.

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

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

    Attributes
    protected[this]
  57. trait Sliced extends Sliced with Sliced with Transformed[T]

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

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

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

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

    Attributes
    protected[this]
  62. type SuperParIterator = IterableSplitter[S]

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

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

    Attributes
    protected[this]
  65. trait TakenWhile extends TakenWhile with Transformed[A]

  66. trait TaskOps[R, Tp] extends AnyRef

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

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

    Attributes
    protected[this]
  69. trait Transformed[+S] extends ParSeqView[S, Coll, CollSeq] with Transformed[S] with Transformed[S]

    The implementation base trait of this view.

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

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

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

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

    Attributes
    protected[this]
  74. trait Zipped[S] extends Zipped[S] with Zipped[S] with Transformed[(T, S)]

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

Abstract Value Members

  1. abstract val mapping: (T) ⇒ S

    Attributes
    protected[this]
    Definition Classes
    Mapped

Concrete Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

    Equivalent to x.hashCode except for boxed numeric types and null.

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

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  4. def ++[B](that: GenTraversableOnce[B]): ParIterable[B]

    [use case]

    [use case]
    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.

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenTraversableLike
  5. def +:(elem: S): ParIterable[A]

    [use case]

    [use case]
    elem

    the prepended element

    returns

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

    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  6. def /:[S](z: S)(op: (S, 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: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (5 /: a)(_+_)
         b: Int = 15
    
         scala> val c = (5 /: a)((x,y) => x + y)
         c: Int = 15
    

    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(op(z, x1), x2), ..., xn)
    

    where x1, ..., xn are the elements of this parallel iterable.

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

    A syntactic sugar for out of order folding.

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

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a /:\ 5)(_+_)
         b: Int = 15
    
    Definition Classes
    GenTraversableOnce
  8. def :+(elem: S): ParIterable[A]

    [use case]

    [use case]
    elem

    the appended element

    returns

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

          scala> import scala.collection.mutable.LinkedList
          import scala.collection.mutable.LinkedList
    
          scala> val a = LinkedList(1)
          a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
          scala> val b = a :+ 2
          b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
          scala> println(a)
          LinkedList(1)
    
    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  9. def :\[S](z: S)(op: (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: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: will not terminate for infinite-sized collections.

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

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a :\ 5)(_+_)
         b: Int = 15
    
         scala> val c = (a :\ 5)((x,y) => x + y)
         c: Int = 15
    
    
    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(x1, op(x2, ... op(xn, z)...))
    

    where x1, ..., xn are the elements of this parallel iterable.

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

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

    Test two objects for equality.

    Test two objects for equality. The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

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

    Definition Classes
    Any
  12. def aggregate[S](z: S)(seqop: (S, 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
    ParIterableLikeGenTraversableOnce
  13. def apply(idx: Int): S

    Selects an element by its index in the parallel iterable.

    Selects an element by its index in the parallel iterable.

    Example:

       scala> val x = LinkedList(1, 2, 3, 4, 5)
       x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)
    
       scala> x(3)
       res1: Int = 4
    
    idx

    The index to select.

    returns

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

    Definition Classes
    MappedTransformedGenSeqLike
    Exceptions thrown
    `IndexOutOfBoundsException`

    if idx does not satisfy 0 <= idx < length.

  14. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown
    ClassCastException

    if the receiver object is not an instance of the erasure of type T0.

  15. def bf2seq[S, That](bf: CanBuildFrom[ParSeqView[S, Coll, CollSeq], S, That]): CanBuildFrom[SeqView[S, CollSeq], S, That]

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

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

    Definition Classes
    ParIterableLike
  18. def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
    Note

    not specified by SLS as a member of AnyRef

  19. def collect[B](pf: PartialFunction[S, B]): ParIterable[B]

    [use case]

    [use case]
    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.

    Definition Classes
    ParSeqViewLikeParIterableLikeGenTraversableLike
  20. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  21. def combinerFactory: CombinerFactory[S, ParSeqView[S, Coll, CollSeq]]

    Creates a combiner factory.

    Creates a combiner factory. Each combiner factory instance is used once per invocation of a parallel transformer method for a single collection.

    The default combiner factory creates a new combiner every time it is requested, unless the combiner is thread-safe as indicated by its canBeShared method. In this case, the method returns a factory which returns the same combiner each time. This is typically done for concurrent parallel collections, the combiners of which allow thread safe access.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. def companion: GenericCompanion[ParSeq] with GenericParCompanion[ParSeq]

    The factory companion object that builds instances of class ParIterable.

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

    Definition Classes
    ParSeqParIterableGenericParTemplateGenSeqGenIterableGenTraversableGenericTraversableTemplate
  23. def copyToArray[U >: S](xs: Array[U], start: Int, len: Int): Unit

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

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  25. def copyToArray(xs: Array[S]): Unit

    [use case]

    [use case]
    xs

    the array to fill.

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

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

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

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

    S

    the type of the elements of that

    that

    the other parallel sequence

    p

    the test predicate, which relates elements from both sequences

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  27. def count(p: (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
    ParIterableLikeGenTraversableOnce
  28. def debugBuffer: ArrayBuffer[String]

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

    Attributes
    protected
    Definition Classes
    ParIterableLike
  30. def diff(that: GenSeq[S]): ParIterable[A]

    [use case]

    [use case]
    that

    the sequence of elements to remove

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  31. def distinct: ParSeqView[S, Coll, CollSeq]

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

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

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  32. def down(p: scala.collection.parallel.IterableSplitter[_]): SeqSplitter[S]

    Attributes
    protected[this]
    Definition Classes
    ParSeqLike
  33. def drop(n: Int): ParSeqView[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.

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenTraversableLike
  34. def dropWhile(p: (S) ⇒ Boolean): ParSeqView[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

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  35. def endsWith[S](that: GenSeq[S]): Boolean

    Tests whether this parallel iterable ends with the given parallel sequence.

    Tests whether this parallel iterable ends with the given parallel sequence.

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

    S

    the type of the elements of that sequence

    that

    the sequence to test

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  36. final def eq(arg0: AnyRef): Boolean

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

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

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

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

    returns

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

    Definition Classes
    AnyRef
  37. def equals(that: Any): Boolean

    The equals method for arbitrary sequences.

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

    that

    The object to compare the sequence to

    returns

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

    Definition Classes
    GenSeqLikeEquals → AnyRef → Any
  38. def exists(pred: (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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  39. def filter(p: (S) ⇒ Boolean): ParSeqView[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. Their order may not be preserved.

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  40. def filterNot(p: (S) ⇒ Boolean): ParSeqView[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. Their order may not be preserved.

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  41. def finalize(): Unit

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

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

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
    Note

    not specified by SLS as a member of AnyRef

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  43. def flatMap[B](f: (S) ⇒ GenTraversableOnce[B]): ParIterable[B]

    [use case]

    [use case]
    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.

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  44. def flatten[B]: ParIterable[B]

    [use case]

    [use case]
    B

    the type of the elements of each traversable collection.

    returns

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

    Definition Classes
    GenericTraversableTemplate
  45. def fold[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
    ParIterableLikeGenTraversableOnce
  46. def foldLeft[S](z: S)(op: (S, 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, x1), x2, ..., xn)
    

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  47. def foldRight[S](z: S)(op: (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(x1, op(x2, ... op(xn, z)...))
    

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  48. def forall(pred: (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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  49. def force[U >: S, That](implicit bf: CanBuildFrom[Coll, U, That]): That

  50. def foreach[U](f: (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

    Definition Classes
    ParIterableViewLikeParIterableLikeGenericTraversableTemplateGenTraversableLikeGenTraversableOnce
  51. def genericBuilder[B]: Combiner[B, ParSeq[B]]

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

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

    Definition Classes
    GenericParTemplateGenericTraversableTemplate
  52. def genericCombiner[B]: Combiner[B, ParSeq[B]]

    Definition Classes
    GenericParTemplate
  53. final def getClass(): Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  54. def groupBy[K](f: (S) ⇒ K): ParMap[K, ParSeqView[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
    ParSeqViewLikeParIterableLikeGenTraversableLike
  55. def hasDefiniteSize: Boolean

    Definition Classes
    ParIterableLikeGenTraversableOnce
  56. def hashCode(): Int

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

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

    returns

    the hash code value for this object.

    Definition Classes
    GenSeqLike → AnyRef → Any
  57. def head: S

    Definition Classes
    GenIterableLikeGenTraversableLike
  58. def indexOf(elem: S, from: Int): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    from

    the start index

    returns

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

    Definition Classes
    GenSeqLike
  59. def indexOf(elem: S): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  60. def indexWhere(p: (S) ⇒ Boolean, from: Int): Int

    Finds the first element satisfying some predicate.

    Finds the first element satisfying some predicate.

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  61. def indexWhere(p: (S) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  62. def intersect(that: Seq[S]): ParIterable[S]

    [use case]

    [use case]
    that

    the sequence of elements to intersect with.

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  63. def isDefinedAt(idx: Int): Boolean

    Tests whether this parallel iterable contains given index.

    Tests whether this parallel iterable contains given index.

    The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].

    idx

    the index to test

    returns

    true if this parallel iterable contains an element at position idx, false otherwise.

    Definition Classes
    GenSeqLike
  64. def isEmpty: Boolean

    Tests whether the parallel iterable is empty.

    Tests whether the parallel iterable is empty.

    returns

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

    Definition Classes
    GenIterableLikeGenTraversableOnce
  65. final def isInstanceOf[T0]: Boolean

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

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

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

    returns

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

    Definition Classes
    Any
  66. 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
  67. final def isTraversableAgain: Boolean

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    Definition Classes
    GenTraversableLikeGenTraversableOnce
  68. def iterator: SeqSplitter[S]

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

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

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

    returns

    a split iterator

    Definition Classes
    TransformedTransformedTransformedParSeqLikeParIterableLikeGenIterableLike
  69. def lastIndexOf(elem: S, end: Int): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    end

    the end index.

    returns

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

    Definition Classes
    GenSeqLike
  70. def lastIndexOf(elem: S): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  71. def lastIndexWhere(p: (S) ⇒ Boolean, end: Int): Int

    Finds the last element satisfying some predicate.

    Finds the last element satisfying some predicate.

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

    The index flag is initially set to minimum integer value.

    p

    the predicate used to test the elements

    end

    the maximum offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  72. def lastIndexWhere(p: (S) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    the index of the last element of this parallel iterable that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  73. def length: Int

    The length of the parallel iterable.

    The length of the parallel iterable.

    Note: will not terminate for infinite-sized collections.

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

    returns

    the number of elements in this parallel iterable.

    Definition Classes
    MappedTransformedGenSeqLike
  74. def map[B](f: (S) ⇒ B): ParIterable[B]

    [use case]

    [use case]
    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.

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenTraversableLike
  75. def max: A

    [use case]

    [use case]
    returns

    the largest element of this parallel iterable.

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  77. def min: A

    [use case]

    [use case]
    returns

    the smallest element of this parallel iterable

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  79. 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
    ParIterableLikeGenTraversableOnce
  80. 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
    ParIterableLikeGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  81. 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
    ParIterableLikeGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  82. final def ne(arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Definition Classes
    AnyRef
  83. def newAppended[U >: S](that: GenTraversable[U]): Transformed[U]

    Attributes
    protected
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  84. def newAppendedTryParIterable[U >: S](that: GenTraversable[U]): Transformed[U]

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  85. def newBuilder: Builder[S, ParSeq[S]]

    The builder that builds instances of type ParIterable[A]

    The builder that builds instances of type ParIterable[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateGenericTraversableTemplateHasNewBuilder
  86. def newCombiner: Combiner[S, ParSeqView[S, Coll, CollSeq]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableViewLikeGenericParTemplateHasNewCombiner
  87. def newDroppedWhile(p: (S) ⇒ Boolean): Nothing

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  88. def newFiltered(p: (S) ⇒ Boolean): Nothing

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  89. def newFlatMapped[S](f: (S) ⇒ GenTraversableOnce[S]): Nothing

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  90. def newForced[S](xs: ⇒ GenSeq[S]): Transformed[S]

    Attributes
    protected
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  91. def newForcedTryParIterable[S](xs: ⇒ GenSeq[S]): Transformed[S]

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  92. def newMapped[S](f: (S) ⇒ S): Transformed[S]

    Attributes
    protected
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  93. def newPatched[U >: S](_from: Int, _patch: GenSeq[U], _replaced: Int): Transformed[U]

    Attributes
    protected
    Definition Classes
    ParSeqViewLike
  94. def newPrepended[U >: S](elem: U): Transformed[U]

    Attributes
    protected
    Definition Classes
    ParSeqViewLike
  95. def newReversed: Transformed[S]

    Attributes
    protected
    Definition Classes
    ParSeqViewLike
  96. def newSliced(_endpoints: SliceInterval): Transformed[S]

    Attributes
    protected
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  97. def newTakenWhile(p: (S) ⇒ Boolean): Nothing

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  98. def newZipped[S](that: GenIterable[S]): Transformed[(S, S)]

    Attributes
    protected
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  99. def newZippedAll[U >: S, S](that: GenIterable[S], _thisElem: U, _thatElem: S): Transformed[(U, S)]

    Attributes
    protected
    Definition Classes
    ParSeqViewLikeParIterableViewLike
  100. def newZippedAllTryParSeq[S, U >: S](that: GenIterable[S], thisElem: U, thatElem: S): Transformed[(U, S)]

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  101. def newZippedTryParSeq[S](that: GenIterable[S]): Transformed[(S, S)]

    Attributes
    protected
    Definition Classes
    ParIterableViewLike
  102. 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
    ParIterableLikeGenTraversableOnce
  103. final 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.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  104. final 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.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  105. def padTo(len: Int, elem: S): ParIterable[A]

    [use case]

    [use case]
    len

    the target length

    elem

    the padding value

    returns

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

    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  106. def par: ParSeqView[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

    Definition Classes
    ParIterableLikeCustomParallelizableParallelizable
  107. def parCombiner: Combiner[S, ParSeqView[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]
    Definition Classes
    CustomParallelizableParallelizable
  108. def partition(p: (S) ⇒ Boolean): (ParSeqView[S, Coll, CollSeq], ParSeqView[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 may not be preserved.

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  109. def patch(from: Int, that: GenSeq[S], replaced: Int): ParIterable[A]

    [use case]

    [use case]
    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original parallel iterable

    returns

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

    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  110. def prefixLength(p: (S) ⇒ Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  111. def product: A

    [use case]

    [use case]
    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.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  112. def reduce[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 operations are performed on elements is unspecified and may be nondeterministic.

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this parallel iterable is empty.

  113. def reduceLeft[U >: S](op: (U, S) ⇒ U): U

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

    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.

    op

    the binary operator.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  115. def reduceOption[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 operations are performed on elements is unspecified and may be nondeterministic.

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  116. def reduceRight[U >: S](op: (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 x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this parallel iterable is empty.

  117. def reduceRightOption[U >: S](op: (S, U) ⇒ U): Option[U]

    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.

    op

    the binary operator.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  118. def repr: ParSeqView[S, Coll, CollSeq]

    Definition Classes
    ParIterableLikeGenTraversableLike
  119. 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
  120. def reverse: ParSeqView[S, Coll, CollSeq]

    Returns new parallel iterable wih elements in reversed order.

    Returns new parallel iterable wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  121. def reverseMap[B](f: (S) ⇒ B): ParIterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  122. def sameElements(that: GenIterable[S]): Boolean

    [use case]

    [use case]
    that

    the collection to compare with.

    returns

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

    Definition Classes
    ParSeqLikeParIterableLikeGenIterableLike
  123. def scan(z: S)(op: (S, S) ⇒ S): ParIterable[S]

    [use case]

    [use case]
    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

    Definition Classes
    ParIterableLikeGenTraversableLike
  124. def scanBlockSize: Int

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  125. def scanLeft[S, That](z: S)(op: (S, S) ⇒ S)(implicit bf: CanBuildFrom[ParSeqView[S, Coll, CollSeq], S, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

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

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    ParSeqViewLikeParIterableLikeGenTraversableLike
  126. def scanRight[S, That](z: S)(op: (S, S) ⇒ S)(implicit bf: CanBuildFrom[ParSeqView[S, Coll, CollSeq], S, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

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

    Example:

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

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    ParSeqViewLikeParIterableLikeGenTraversableLike
  127. def segmentLength(p: (S) ⇒ Boolean, from: Int): Int

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

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

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  128. def seq: SeqView[S, CollSeq]

  129. def sequentially[S, That <: Parallel](b: (SeqView[S, CollSeq]) ⇒ Parallelizable[S, That]): ParSeqView[S, Coll, CollSeq]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  130. 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
    TransformedTransformedParSeqLikeGenTraversableLikeGenTraversableOnce
  131. def slice(from: Int, until: Int): ParSeqView[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.

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenTraversableLike
  132. def span(p: (S) ⇒ Boolean): (ParSeqView[S, Coll, CollSeq], ParSeqView[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

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  133. def splitAt(n: Int): (ParSeqView[S, Coll, CollSeq], ParSeqView[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.

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenTraversableLike
  134. def splitter: Mapped[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
    MappedTransformedParSeqLikeMappedTransformedParIterableLike
  135. def startsWith[S](that: GenSeq[S], offset: Int): Boolean

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

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

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

    that

    the parallel sequence this sequence is being searched for

    offset

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  136. def startsWith[B](that: GenSeq[B]): Boolean

    Tests whether this parallel iterable starts with the given sequence.

    Tests whether this parallel iterable starts with the given sequence.

    that

    the sequence to test

    returns

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

    Definition Classes
    GenSeqLike
  137. 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
    ParSeqParIterableGenTraversableLike
  138. def sum: A

    [use case]

    [use case]
    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.

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

    Definition Classes
    AnyRef
  140. def tail: ParSeqView[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
    GenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the parallel iterable is empty.

  141. def take(n: Int): ParSeqView[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.

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenTraversableLike
  142. def takeWhile(p: (S) ⇒ Boolean): ParSeqView[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

    Definition Classes
    ParIterableViewLikeParIterableLikeGenTraversableLike
  143. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

    Attributes
    protected
    Definition Classes
    ParIterableLike
  144. def thisParSeq: ParSeq[S]

    Attributes
    protected[this]
    Definition Classes
    ParIterableViewLike
  145. def toArray: Array[A]

    [use case]

    [use case]
    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  146. def toBuffer[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
    ParIterableLikeGenTraversableOnce
  147. def toIndexedSeq: IndexedSeq[S]

    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
    ParIterableLikeGenTraversableOnce
  148. def toIterable: ParIterable[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
    ParIterableLikeGenTraversableOnce
  149. def toIterator: Iterator[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
    ParIterableLikeGenTraversableOnce
  150. def toList: List[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
    ParIterableLikeGenTraversableOnce
  151. def toMap[T, U]: Map[T, U]

    [use case]

    [use case]
    returns

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

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

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

    Attributes
    protected
    Definition Classes
    ParIterableLike
  154. def toSeq: ParSeq[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
    ParSeqLikeParIterableLikeGenSeqLikeGenTraversableOnce
  155. def toSet[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
    ParIterableLikeGenTraversableOnce
  156. def toStream: Stream[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.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  157. def toString(): String

    Creates a String representation of this object.

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

    returns

    a String representation of the object.

    Definition Classes
    ParSeqParSeqLikeParIterableLike → AnyRef → Any
  158. def toTraversable: GenTraversable[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
    ParIterableLikeGenTraversableOnce
  159. def transpose[B](implicit asTraversable: (S) ⇒ GenTraversableOnce[B]): ParSeq[ParSeq[B]]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

    if all collections in this parallel iterable are not of the same size.

  160. lazy val underlying: Coll

    Definition Classes
    TransformedGenTraversableViewLike
  161. def union(that: GenSeq[S]): ParIterable[S]

    [use case]

    [use case]
    that

    the sequence to add.

    returns

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

    Definition Classes
    GenSeqLike
  162. def unzip[A1, A2](implicit asPair: (S) ⇒ (A1, A2)): (ParSeq[A1], ParSeq[A2])

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

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

    asPair

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  163. def unzip3[A1, A2, A3](implicit asTriple: (S) ⇒ (A1, A2, A3)): (ParSeq[A1], ParSeq[A2], ParSeq[A3])

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

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

    asTriple

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  164. def updated(index: Int, elem: S): ParIterable[A]

    [use case]

    [use case]
    index

    the position of the replacement

    elem

    the replacing element

    returns

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

    Definition Classes
    ParSeqViewLikeParSeqLikeGenSeqLike
  165. def view: ParSeqView[S, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]]

    Definition Classes
    ParSeqLikeParIterableLike
  166. final def viewIdString: String

    Attributes
    protected[this]
    Definition Classes
    TransformedGenTraversableViewLike
  167. final def viewIdentifier: String

    Attributes
    protected[this]
    Definition Classes
    MappedGenTraversableViewLike
  168. def viewToString: String

    Definition Classes
    GenTraversableViewLike
  169. final def wait(): Unit

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

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

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

    Attributes
    protected
    Definition Classes
    ParIterableLike
  173. def zip[B](that: GenIterable[B]): ParIterable[(A, B)]

    [use case]

    [use case]
    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.

    Definition Classes
    ParSeqViewLikeParSeqLikeParIterableViewLikeParIterableLikeGenIterableLike
  174. def zipAll[B](that: Iterable[B], thisElem: S, thatElem: B): ParIterable[(A, B)]

    [use case]

    [use case]
    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.

    Definition Classes
    ParIterableViewLikeParIterableLikeGenIterableLike
  175. def zipWithIndex: ParIterable[(A, Int)]

    [use case]

    [use case]
    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))

    Definition Classes
    ParSeqViewLikeParIterableViewLikeParIterableLikeGenIterableLike

Inherited from Transformed[S]

Inherited from ParSeqView[S, Coll, CollSeq]

Inherited from ParSeqViewLike[S, Coll, CollSeq, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]]

Inherited from ParSeq[S]

Inherited from ParSeqLike[S, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]]

Inherited from Mapped[S]

Inherited from Transformed[S]

Inherited from ParIterableView[S, Coll, CollSeq]

Inherited from ParIterableViewLike[S, Coll, CollSeq, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]]

Inherited from ParIterable[S]

Inherited from ParIterableLike[S, ParSeqView[S, Coll, CollSeq], SeqView[S, CollSeq]]

Inherited from Parallel

Inherited from CustomParallelizable[S, ParSeqView[S, Coll, CollSeq]]

Inherited from GenericParTemplate[S, ParSeq]

Inherited from HasNewCombiner[S, ParSeqView[S, Coll, CollSeq]]

Inherited from Mapped[S]

Inherited from Transformed[S]

Inherited from GenSeqView[S, Coll]

Inherited from GenSeqViewLike[S, Coll, ParSeqView[S, Coll, CollSeq]]

Inherited from GenSeq[S]

Inherited from GenSeqLike[S, ParSeqView[S, Coll, CollSeq]]

Inherited from Equals

Inherited from Mapped[S]

Inherited from Transformed[S]

Inherited from GenIterableView[S, Coll]

Inherited from GenIterableViewLike[S, Coll, ParSeqView[S, Coll, CollSeq]]

Inherited from GenIterable[S]

Inherited from GenIterableLike[S, ParSeqView[S, Coll, CollSeq]]

Inherited from Mapped[S]

Inherited from Transformed[S]

Inherited from GenTraversableView[S, Coll]

Inherited from GenTraversableViewLike[S, Coll, ParSeqView[S, Coll, CollSeq]]

Inherited from GenTraversable[S]

Inherited from GenericTraversableTemplate[S, ParSeq]

Inherited from HasNewBuilder[S, ParSeq[S]]

Inherited from GenTraversableLike[S, ParSeqView[S, Coll, CollSeq]]

Inherited from Parallelizable[S, ParSeqView[S, Coll, CollSeq]]

Inherited from GenTraversableOnce[S]

Inherited from AnyRef

Inherited from Any