scala.collection.parallel

ParSeqLike

trait ParSeqLike[+T, +Repr <: ParSeq[T], +Sequential <: scala.Seq[T] with SeqLike[T, Sequential]] extends GenSeqLike[T, Repr] with ParIterableLike[T, Repr, Sequential]

A template trait for sequences of type ParSeq[T], representing parallel sequences with element type T.

Parallel sequences inherit the Seq trait. Their indexing and length computations are defined to be efficient. Like their sequential counterparts they always have a defined order of elements. This means they will produce resulting parallel sequences in the same way sequential sequences do. However, the order in which they perform bulk operations on elements to produce results is not defined and is generally nondeterministic. If the higher-order functions given to them produce no sideeffects, then this won't be noticeable.

This trait defines a new, more general split operation and reimplements the split operation of ParallelIterable trait using the new split operation.

T

the type of the elements contained in this collection

Repr

the type of the actual collection containing the elements

Sequential

the type of the sequential version of this parallel collection

Self Type
ParSeqLike[T, Repr, Sequential]
Source
ParSeqLike.scala
Linear Supertypes
ParIterableLike[T, Repr, Sequential], HasNewCombiner[T, Repr], Parallel, CustomParallelizable[T, Repr], GenSeqLike[T, Repr], Equals, GenIterableLike[T, Repr], GenTraversableLike[T, Repr], Parallelizable[T, Repr], GenTraversableOnce[T], AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ParSeqLike
  2. ParIterableLike
  3. HasNewCombiner
  4. Parallel
  5. CustomParallelizable
  6. GenSeqLike
  7. Equals
  8. GenIterableLike
  9. GenTraversableLike
  10. Parallelizable
  11. GenTraversableOnce
  12. AnyRef
  13. Any
Implicitly
  1. by traversable2ops
  2. by any2stringadd
  3. by any2stringfmt
  4. by any2ArrowAssoc
  5. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait Accessor[R, Tp] extends ParSeqLike.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]
    Definition Classes
    ParIterableLike
  3. trait BuilderOps[Elem, To] extends AnyRef

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

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

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

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

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

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  12. abstract class Elements extends SeqSplitter[T] with scala.BufferedIterator[T]

    Used to iterate elements using indices

  13. class Exists extends Accessor[Boolean, Exists]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  32. class Product[U >: T] extends Accessor[U, Product[U]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  33. class Reduce[U >: T] extends Accessor[Option[U], Reduce[U]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  34. abstract class ResultMapping[R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  35. class Reverse[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Reverse[U, This]]

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

    Attributes
    protected[this]
  37. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  40. case class ScanNode[U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  41. trait ScanTree[U >: T] extends AnyRef

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  42. class SegmentLength extends Accessor[(Int, Boolean), SegmentLength]

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

    Sequentially performs one task after another.

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

    Definition Classes
    ParIterableLike
  45. class Slice[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  48. trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]

    Attributes
    protected
    Definition Classes
    ParIterableLike
  49. class Sum[U >: T] extends Accessor[U, Sum[U]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  50. type SuperParIterator = IterableSplitter[T]

  51. class Take[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  53. trait TaskOps[R, Tp] extends AnyRef

    Definition Classes
    ParIterableLike
  54. class ToParCollection[U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  55. class ToParMap[K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  56. trait Transformer[R, Tp] extends Accessor[R, Tp] with ParSeqLike.Transformer[R, Tp]

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike

Abstract Value Members

  1. abstract def apply(idx: Int): T

    Selects an element by its index in the general sequence.

    Selects an element by its index in the general sequence.

    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 general sequence at index idx, where 0 indicates the first element.

    Definition Classes
    GenSeqLike
    Exceptions thrown
    `IndexOutOfBoundsException`

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

  2. abstract def length: Int

    The length of the general sequence.

    The length of the general sequence.

    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 general sequence.

    Definition Classes
    GenSeqLike
  3. abstract def newCombiner: Combiner[T, Repr]

    Attributes
    protected[this]
    Definition Classes
    HasNewCombiner
  4. abstract def seq: Sequential

  5. abstract def splitter: SeqSplitter[T]

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

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

    returns

    an iterator that can be split into subsets of precise size

    Attributes
    protected[scala.collection.parallel]
    Definition Classes
    ParSeqLikeParIterableLike
  6. abstract 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 general sequence. By default the string prefix is the simple name of the collection class general sequence.

    Definition Classes
    GenTraversableLike

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 +(other: String): String

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd
  5. def ++[B](that: GenTraversableOnce[B]): GenSeq[B]

    [use case] Returns a new general sequence containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new general sequence containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the general sequence is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = LinkedList(2)
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val c = a ++ b
    c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> val d = LinkedList('a')
    d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
    scala> val e = c ++ d
    e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new general sequence which contains all elements of this general sequence followed by all elements of that.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def ++[U >: T, That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[Repr, U, That]): That

  6. def +:(elem: A): GenSeq[A]

    [use case] A copy of the general sequence with an element prepended.

    [use case]

    A copy of the general sequence with an element prepended.

    Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Also, the original general sequence is not modified, so you will want to capture the result.

    Example:

    scala> val x = LinkedList(1)
    x: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val y = 2 +: x
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2, 1)
    
    scala> println(x)
    LinkedList(1)
    elem

    the prepended element

    returns

    a new general sequence consisting of elem followed by all elements of this general sequence.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def +:[U >: T, That](elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That

  7. def ->[B](y: B): (ParSeqLike[T, Repr, Sequential], B)

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to ArrowAssoc[ParSeqLike[T, Repr, Sequential]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[S](z: S)(op: (S, T) ⇒ S): S

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

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

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  9. def :+(elem: A): GenSeq[A]

    [use case] A copy of this general sequence with an element appended.

    [use case]

    A copy of this general sequence with an element appended.

    A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Note: will not terminate for infinite-sized collections.

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

    the appended element

    returns

    a new general sequence consisting of all elements of this general sequence followed by elem.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def :+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That

  10. def :\[S](z: S)(op: (T, S) ⇒ S): S

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

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

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this general sequence.

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

    Definition Classes
    AnyRef
  12. 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
  13. def aggregate[S](z: S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

    pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    S

    the type of accumulated results

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    ParIterableLikeGenTraversableOnce
  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 asParIterable: ParIterable[T]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  16. def asParSeq: ParSeq[T]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  17. def bf2seq[S, That](bf: CanBuildFrom[Repr, S, That]): CanBuildFrom[Sequential, S, That]

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

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

    Definition Classes
    ParIterableLike
  20. 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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
    Note

    not specified by SLS as a member of AnyRef

  21. def collect[B](pf: PartialFunction[A, B]): GenSeq[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the general sequence.

    returns

    a new general sequence 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
    ParIterableLikeGenTraversableLike
    Full Signature

    def collect[S, That](pf: PartialFunction[T, S])(implicit bf: CanBuildFrom[Repr, S, That]): That

  22. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  23. def combinerFactory: CombinerFactory[T, Repr]

    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
  24. def copyToArray[U >: T](xs: Array[U], start: Int, len: Int): Unit

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

    [use case] Copies values of this general sequence to an array.

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def copyToArray[U >: T](xs: Array[U], start: Int): Unit

  26. def copyToArray(xs: Array[A]): Unit

    [use case] Copies values of this general sequence to an array.

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def copyToArray[U >: T](xs: Array[U]): Unit

  27. def corresponds[S](that: GenSeq[S])(p: (T, S) ⇒ Boolean): Boolean

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

    Tests whether every element of this general sequence 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 general sequence and y of that, otherwise false

    Definition Classes
    ParSeqLikeGenSeqLike
  28. def count(p: (T) ⇒ Boolean): Int

    Counts the number of elements in the general sequence which satisfy a predicate.

    Counts the number of elements in the general sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

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

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

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

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

    [use case]

    Computes the multiset difference between this general sequence and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new general sequence which contains all elements of this general sequence 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
    Full Signature

    def diff[U >: T](that: GenSeq[U]): Repr

  32. def distinct: Repr

    Builds a new general sequence from this general sequence without any duplicate elements.

    Builds a new general sequence from this general sequence without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    returns

    A new general sequence which contains the first occurrence of every element of this general sequence.

    Definition Classes
    ParSeqLikeGenSeqLike
  33. def down(p: IterableSplitter[_]): SeqSplitter[T]

    Attributes
    protected[this]
  34. def drop(n: Int): Repr

    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 general sequence.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  35. def dropWhile(pred: (T) ⇒ Boolean): Repr

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

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

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

    pred

    the predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  36. def endsWith[S](that: GenSeq[S]): Boolean

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

    Tests whether this general sequence 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 general sequence has that as a suffix, false otherwise

    Definition Classes
    ParSeqLikeGenSeqLike
  37. def ensuring(cond: (ParSeqLike[T, Repr, Sequential]) ⇒ Boolean, msg: ⇒ Any): ParSeqLike[T, Repr, Sequential]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to Ensuring[ParSeqLike[T, Repr, Sequential]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  38. def ensuring(cond: (ParSeqLike[T, Repr, Sequential]) ⇒ Boolean): ParSeqLike[T, Repr, Sequential]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to Ensuring[ParSeqLike[T, Repr, Sequential]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  39. def ensuring(cond: Boolean, msg: ⇒ Any): ParSeqLike[T, Repr, Sequential]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to Ensuring[ParSeqLike[T, Repr, Sequential]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  40. def ensuring(cond: Boolean): ParSeqLike[T, Repr, Sequential]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to Ensuring[ParSeqLike[T, Repr, Sequential]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  41. 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
  42. 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
    GenSeqLikeEqualsAny
  43. def exists(pred: (T) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some element of this general sequence.

    Tests whether a predicate holds for some element of this general sequence.

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

    pred

    a predicate used to test elements

    returns

    true if p holds for some element, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  44. def filter(pred: (T) ⇒ Boolean): Repr

    Selects all elements of this general sequence which satisfy a predicate.

    Selects all elements of this general sequence which satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  45. def filterNot(pred: (T) ⇒ Boolean): Repr

    Selects all elements of this general sequence which do not satisfy a predicate.

    Selects all elements of this general sequence which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  46. 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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
    Note

    not specified by SLS as a member of AnyRef

  47. def find(pred: (T) ⇒ Boolean): Option[T]

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

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

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

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

    pred

    predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  48. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): GenSeq[B]

    [use case] Builds a new collection by applying a function to all elements of this general sequence and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this general sequence and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of general sequence. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be a an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def flatMap[S, That](f: (T) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[Repr, S, That]): That

  49. def fold[U >: T](z: U)(op: (U, U) ⇒ U): U

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

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

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

    U

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

    z

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

    op

    a binary operator that must be associative

    returns

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

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

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

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

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this general sequence.

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

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

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

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this general sequence.

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

    Tests whether a predicate holds for all elements of this general sequence.

    Tests whether a predicate holds for all elements of this general sequence.

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

    pred

    a predicate used to test elements

    returns

    true if p holds for all elements, false otherwise

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

    Applies a function f to all the elements of general sequence in a undefined order.

    Applies a function f to all the elements of general sequence in a undefined order.

    U

    the result type of the function applied to each element, which is always discarded

    f

    function applied to each element

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  54. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  55. 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

  56. def groupBy[K](f: (T) ⇒ K): immutable.ParMap[K, Repr]

    Partitions this general sequence into a map of general sequences according to some discriminator function.

    Partitions this general sequence into a map of general sequences 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 general sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to general sequences 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 general sequence of those elements x for which f(x) equals k.

    Definition Classes
    ParIterableLikeGenTraversableLike
  57. def hasDefiniteSize: Boolean

    Definition Classes
    ParIterableLikeGenTraversableOnce
  58. def hashCode(): Int

    Hashcodes for GenSeq produce a value from the hashcodes of all the elements of the general sequence.

    Hashcodes for GenSeq produce a value from the hashcodes of all the elements of the general sequence.

    returns

    the hash code value for this object.

    Definition Classes
    GenSeqLikeAny
  59. def head: T

    Selects the first element of this general sequence.

    Selects the first element of this general sequence.

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

    returns

    the first element of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the general sequence is empty.

  60. def headOption: Option[T]

    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 general sequence if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  61. def ifParSeq[R](isbody: (ParSeq[T]) ⇒ R): (TraversableOps[T])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  62. def indexOf(elem: T, from: Int): Int

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

    [use case]

    Finds index of first occurrence of some value in this general sequence after or at some start index.

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this general sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: T](elem: B, from: Int): Int

  63. def indexOf(elem: T): Int

    [use case] Finds index of first occurrence of some value in this general sequence.

    [use case]

    Finds index of first occurrence of some value in this general sequence.

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

    the index of the first element of this general sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def indexOf[B >: T](elem: B): Int

  64. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    Finds the first element satisfying some predicate.

    Finds the first element satisfying some predicate.

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  65. def indexWhere(p: (T) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  66. def init: Repr

    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 general sequence consisting of all elements of this general sequence except the last one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the general sequence is empty.

  67. def initTaskSupport(): Unit

    Attributes
    protected
    Definition Classes
    ParIterableLike
  68. def intersect(that: scala.Seq[T]): GenSeq[T]

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

    [use case]

    Computes the multiset intersection between this general sequence and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

    a new general sequence which contains all elements of this general sequence 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
    Full Signature

    def intersect[U >: T](that: GenSeq[U]): Repr

  69. def isDefinedAt(idx: Int): Boolean

    Tests whether this general sequence contains given index.

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

    Definition Classes
    GenSeqLike
  70. def isEmpty: Boolean

    Tests whether the general sequence is empty.

    Tests whether the general sequence is empty.

    returns

    true if the general sequence contains no elements, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  71. 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
  72. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  73. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  74. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  75. 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
  76. final def isTraversableAgain: Boolean

    Tests whether this general sequence can be repeatedly traversed.

    Tests whether this general sequence can be repeatedly traversed.

    returns

    true

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  77. def iterator: PreciseSplitter[T]

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

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

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

    returns

    a split iterator

    Definition Classes
    ParSeqLikeParIterableLikeGenIterableLike
  78. def last: T

    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 general sequence.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the general sequence is empty.

  79. def lastIndexOf(elem: T, end: Int): Int

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

    [use case]

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

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this general sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def lastIndexOf[B >: T](elem: B, end: Int): Int

  80. def lastIndexOf(elem: T): Int

    [use case] Finds index of last occurrence of some value in this general sequence.

    [use case]

    Finds index of last occurrence of some value in this general sequence.

    Note: will not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

    the index of the last element of this general sequence that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
    Full Signature

    def lastIndexOf[B >: T](elem: B): Int

  81. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    Finds the last element satisfying some predicate.

    Finds the last element satisfying some predicate.

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

    The index flag is initially set to minimum integer value.

    p

    the predicate used to test the elements

    end

    the maximum offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  82. def lastIndexWhere(p: (T) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  83. def lastOption: Option[T]

    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 general sequence$ if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  84. def map[B](f: (A) ⇒ B): GenSeq[B]

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

    [use case]

    Builds a new collection by applying a function to all elements of this general sequence.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def map[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That

  85. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def max[U >: T](implicit ord: Ordering[U]): T

  86. def maxBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

    Definition Classes
    ParIterableLikeGenTraversableOnce
  87. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this general sequence

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def min[U >: T](implicit ord: Ordering[U]): T

  88. def minBy[S](f: (T) ⇒ S)(implicit cmp: Ordering[S]): T

    Definition Classes
    ParIterableLikeGenTraversableOnce
  89. def mkString: String

    Displays all elements of this general sequence in a string.

    Displays all elements of this general sequence in a string.

    returns

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

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

    Displays all elements of this general sequence in a string using a separator string.

    Displays all elements of this general sequence in a string using a separator string.

    sep

    the separator string.

    returns

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

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

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

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

    Displays all elements of this general sequence 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 general sequence. 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 general sequence are separated by the string sep.

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

  92. 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
  93. def nonEmpty: Boolean

    Tests whether the general sequence is not empty.

    Tests whether the general sequence is not empty.

    returns

    true if the general sequence contains at least one element, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  94. 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

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

  96. def padTo(len: Int, elem: A): GenSeq[A]

    [use case] A copy of this general sequence with an element value appended until a given target length is reached.

    [use case]

    A copy of this general sequence with an element value appended until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def padTo[U >: T, That](len: Int, elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That

  97. def par: Repr

    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
  98. def parCombiner: Combiner[T, Repr]

    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
  99. def partition(pred: (T) ⇒ Boolean): (Repr, Repr)

    Partitions this general sequence in two general sequences according to a predicate.

    Partitions this general sequence in two general sequences according to a predicate.

    pred

    the predicate on which to partition.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  100. def patch(from: Int, that: GenSeq[A], replaced: Int): GenSeq[A]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original general sequence

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def patch[U >: T, That](from: Int, patch: GenSeq[U], replaced: Int)(implicit bf: CanBuildFrom[Repr, U, That]): That

  101. def prefixLength(p: (T) ⇒ Boolean): Int

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this general sequence such that every element of the segment satisfies the predicate p.

    Definition Classes
    GenSeqLike
  102. def product: A

    [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 general sequence 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 general sequence and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def product[U >: T](implicit num: Numeric[U]): U

  103. def reduce[U >: T](op: (U, U) ⇒ U): U

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this general sequence is empty.

  104. def reduceLeft[U >: T](op: (U, T) ⇒ U): U

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

    Optionally applies a binary operator to all elements of this general sequence, going left to right.

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

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

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

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

    Applies a binary operator to all elements of this general sequence, going right to left.

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

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this general sequence is empty.

  108. def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]

    Optionally applies a binary operator to all elements of this general sequence, going right to left.

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  109. def repr: Repr

    Definition Classes
    ParIterableLikeGenTraversableLike
  110. 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
  111. def reverse: Repr

    Returns new general sequence wih elements in reversed order.

    Returns new general sequence wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

    A new general sequence with all elements of this general sequence in reversed order.

    Definition Classes
    ParSeqLikeGenSeqLike
  112. def reverseMap[B](f: (A) ⇒ B): GenSeq[B]

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

    [use case]

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

    Note: will not terminate for infinite-sized collections.

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def reverseMap[S, That](f: (T) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That

  113. def sameElements(that: GenIterable[A]): Boolean

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

    [use case]

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

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

    Note: will not terminate for infinite-sized collections.

    that

    the collection to compare with.

    returns

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

    Definition Classes
    ParSeqLikeParIterableLikeGenIterableLike
    Full Signature

    def sameElements[U >: T](that: GenIterable[U]): Boolean

  114. def scan(z: T)(op: (T, T) ⇒ T): GenSeq[T]

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

    [use case]

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a new general sequence containing the prefix scan of the elements in this general sequence

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def scan[U >: T, That](z: U)(op: (U, U) ⇒ U)(implicit bf: CanBuildFrom[Repr, U, That]): That

  115. def scanBlockSize: Int

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

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

    Produces a collection containing cumulative 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
    ParIterableLikeGenTraversableLike
  117. def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That

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

    Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative 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
    ParIterableLikeGenTraversableLike
  118. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

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

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

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

    The index flag is initially set to maximum integer value.

    p

    the predicate used to test the elements

    from

    the starting offset for the search

    returns

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

    Definition Classes
    ParSeqLikeGenSeqLike
  119. def sequentially[S, That <: Parallel](b: (Sequential) ⇒ Parallelizable[S, That]): Repr

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

    The size of this general sequence.

    The size of this general sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this general sequence.

    Definition Classes
    ParSeqLikeGenTraversableLikeGenTraversableOnce
  121. def slice(unc_from: Int, unc_until: Int): Repr

    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.

    unc_from

    the lowest index to include from this general sequence.

    unc_until

    the lowest index to EXCLUDE from this general sequence.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  122. def span(pred: (T) ⇒ Boolean): (Repr, Repr)

    Splits this general sequence into a prefix/suffix pair according to a predicate.

    Splits this general sequence into a prefix/suffix pair according to a predicate.

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

    pred

    the predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  123. def splitAt(n: Int): (Repr, Repr)

    Splits this general sequence into two at a given position.

    Splits this general sequence 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 general sequences consisting of the first n elements of this general sequence, and the other elements.

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

    Tests whether this general sequence contains the given sequence at a given index.

    Tests whether this general sequence 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.

    S

    the element type of that parallel sequence

    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
  125. def startsWith[B](that: GenSeq[B]): Boolean

    Tests whether this general sequence starts with the given sequence.

    Tests whether this general sequence 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
  126. def sum: A

    [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 general sequence 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 general sequence and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def sum[U >: T](implicit num: Numeric[U]): U

  127. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  128. def tail: Repr

    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 general sequence consisting of all elements of this general sequence except the first one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the general sequence is empty.

  129. def take(n: Int): Repr

    Selects first n elements.

    Selects first n elements.

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

    n

    the number of elements to take from this general sequence.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  130. def takeWhile(pred: (T) ⇒ Boolean): Repr

    Takes the longest prefix of elements that satisfy the predicate.

    Takes the longest prefix of elements that satisfy the predicate.

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

    pred

    the predicate used to test the elements

    returns

    the longest prefix of this general sequence of elements that satisy the predicate pred

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

    Attributes
    protected
    Definition Classes
    ParIterableLike
  132. def tasksupport: TaskSupport

    The task support object which is responsible for scheduling and load-balancing tasks to processors.

    The task support object which is responsible for scheduling and load-balancing tasks to processors.

    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  133. def tasksupport_=(ts: TaskSupport): Unit

    Changes the task support object which is responsible for scheduling and load-balancing tasks to processors.

    Changes the task support object which is responsible for scheduling and load-balancing tasks to processors.

    A task support object can be changed in a parallel collection after it has been created, but only during a quiescent period, i.e. while there are no concurrent invocations to parallel collection methods.

    Here is a way to change the task support of a parallel collection:

    import scala.collection.parallel._
    val pc = mutable.ParArray(1, 2, 3)
    pc.tasksupport = new ForkJoinTaskSupport(
      new scala.concurrent.forkjoin.ForkJoinPool(2))
    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  134. def to[Col[_]]: Col[A]

    [use case] Converts this general sequence into another by copying all elements.

    [use case]

    Converts this general sequence into another by copying all elements.

    Note: will not terminate for infinite-sized collections.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

  135. def toArray: Array[A]

    [use case] Converts this general sequence to an array.

    [use case]

    Converts this general sequence to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this general sequence. An ClassTag must be available for the element type of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def toArray[U >: T](implicit arg0: ClassTag[U]): Array[U]

  136. def toBuffer[U >: T]: Buffer[U]

    Converts this general sequence to a mutable buffer.

    Converts this general sequence to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  137. def toIndexedSeq: immutable.IndexedSeq[T]

    Converts this general sequence to an indexed sequence.

    Converts this general sequence to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this general sequence.

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

    Converts this general sequence to an iterable collection.

    Converts this general sequence 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 general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  139. def toIterator: scala.Iterator[T]

    Returns an Iterator over the elements in this general sequence.

    Returns an Iterator over the elements in this general sequence. 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 general sequence.

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

    Converts this general sequence to a list.

    Converts this general sequence to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this general sequence.

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

    [use case] Converts this general sequence to a map.

    [use case]

    Converts this general sequence 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 general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.ParMap[K, V]

  142. def toParArray: ParArray[T]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to TraversableOps[T] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  143. def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That

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

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

    Converts this general sequence to a sequence.

    Converts this general sequence 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 general sequence.

    Definition Classes
    ParSeqLikeParIterableLikeGenSeqLikeGenTraversableOnce
  146. def toSet[U >: T]: immutable.ParSet[U]

    Converts this general sequence to a set.

    Converts this general sequence to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this general sequence.

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

    Converts this general sequence to a stream.

    Converts this general sequence to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  148. 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
    ParSeqLikeParIterableLike → AnyRef → Any
  149. def toTraversable: GenTraversable[T]

    Converts this general sequence to an unspecified Traversable.

    Converts this general sequence 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 general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  150. def toVector: Vector[T]

    Converts this general sequence to a Vector.

    Converts this general sequence to a Vector.

    Note: will not terminate for infinite-sized collections.

    returns

    a vector containing all elements of this general sequence.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  151. def union(that: GenSeq[T]): GenSeq[T]

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

    [use case]

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

    Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-part of diff and intersect which also work on multi-sets.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add.

    returns

    a new general sequence which contains all elements of this general sequence followed by all elements of that.

    Definition Classes
    GenSeqLike
    Full Signature

    def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

  152. def updated(index: Int, elem: A): GenSeq[A]

    [use case] A copy of this general sequence with one single replaced element.

    [use case]

    A copy of this general sequence with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this general sequence with the element at position index replaced by elem.

    Definition Classes
    ParSeqLikeGenSeqLike
    Full Signature

    def updated[U >: T, That](index: Int, elem: U)(implicit bf: CanBuildFrom[Repr, U, That]): That

  153. def view: ParSeqView[T, Repr, Sequential]

    Definition Classes
    ParSeqLikeParIterableLike
  154. final def wait(): Unit

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

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

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

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

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

    [use case]

    Returns a general sequence formed from this general sequence 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.

    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 general sequence containing pairs consisting of corresponding elements of this general sequence and that. The length of the returned collection is the minimum of the lengths of this general sequence and that.

    Definition Classes
    ParSeqLikeParIterableLikeGenIterableLike
    Full Signature

    def zip[U >: T, S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[Repr, (U, S), That]): That

  159. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): GenSeq[(A, B)]

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

    [use case]

    Returns a general sequence formed from this general sequence 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.

    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 general sequence is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this general sequence.

    returns

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

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zipAll[S, U >: T, That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[Repr, (U, S), That]): That

  160. def zipWithIndex: GenSeq[(A, Int)]

    [use case] Zips this general sequence with its indices.

    [use case]

    Zips this general sequence with its indices.

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

    returns

    A new general sequence containing pairs consisting of all elements of this general sequence paired with their index. Indices start at 0.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[U >: T, That](implicit bf: CanBuildFrom[Repr, (U, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

  161. def [B](y: B): (ParSeqLike[T, Repr, Sequential], B)

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to ArrowAssoc[ParSeqLike[T, Repr, Sequential]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parSeqLike: StringAdd).self
    Definition Classes
    StringAdd
  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parSeqLike: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def /:\[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

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

    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
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: ParSeqLike[T, Repr, Sequential]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to ArrowAssoc[ParSeqLike[T, Repr, Sequential]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parSeqLike: ArrowAssoc[ParSeqLike[T, Repr, Sequential]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: ParSeqLike[T, Repr, Sequential]

    Implicit information
    This member is added by an implicit conversion from ParSeqLike[T, Repr, Sequential] to Ensuring[ParSeqLike[T, Repr, Sequential]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parSeqLike: Ensuring[ParSeqLike[T, Repr, Sequential]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from ParIterableLike[T, Repr, Sequential]

Inherited from HasNewCombiner[T, Repr]

Inherited from Parallel

Inherited from CustomParallelizable[T, Repr]

Inherited from GenSeqLike[T, Repr]

Inherited from Equals

Inherited from GenIterableLike[T, Repr]

Inherited from GenTraversableLike[T, Repr]

Inherited from Parallelizable[T, Repr]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion traversable2ops from ParSeqLike[T, Repr, Sequential] to TraversableOps[T]

Inherited by implicit conversion any2stringadd from ParSeqLike[T, Repr, Sequential] to StringAdd

Inherited by implicit conversion any2stringfmt from ParSeqLike[T, Repr, Sequential] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from ParSeqLike[T, Repr, Sequential] to ArrowAssoc[ParSeqLike[T, Repr, Sequential]]

Inherited by implicit conversion any2Ensuring from ParSeqLike[T, Repr, Sequential] to Ensuring[ParSeqLike[T, Repr, Sequential]]

Ungrouped