scala.collection.parallel.mutable

# ParSet

#### trait ParSet[T] extends GenSet[T] with ParIterable[T] with parallel.ParSet[T] with GenericParTemplate[T, ParSet] with ParSetLike[T, ParSet[T], mutable.Set[T]]

A mutable variant of `ParSet`.

Self Type
  ParSet[T]

Linear Supertypes
ParSetLike[T, ParSet[T], mutable.Set[T]], mutable.Cloneable[ParSet[T]], Cloneable, java.lang.Cloneable, Shrinkable[T], Growable[T], Clearable, parallel.ParSet[T], parallel.ParSetLike[T, ParSet[T], mutable.Set[T]], ParIterable[T], Mutable, parallel.ParIterable[T], ParIterableLike[T, ParSet[T], mutable.Set[T]], Parallel, CustomParallelizable[T, ParSet[T]], GenericParTemplate[T, ParSet], HasNewCombiner[T, scala.collection.parallel.mutable.ParSet[T] @scala.annotation.unchecked.uncheckedVariance], GenSet[T], GenericSetTemplate[T, GenSet], GenIterable[T], GenTraversable[T], GenericTraversableTemplate[T, ParSet], HasNewBuilder[T, scala.collection.parallel.mutable.ParSet[T] @scala.annotation.unchecked.uncheckedVariance], GenSetLike[T, ParSet[T]], Equals, (T) ⇒ Boolean, GenIterableLike[T, ParSet[T]], GenTraversableLike[T, ParSet[T]], Parallelizable[T, ParSet[T]], GenTraversableOnce[T], AnyRef, Any
Known Subclasses
ParHashSet
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. ParSet
2. ParSetLike
3. Cloneable
4. Cloneable
5. Cloneable
6. Shrinkable
7. Growable
8. Clearable
9. ParSet
10. ParSetLike
11. ParIterable
12. Mutable
13. ParIterable
14. ParIterableLike
15. Parallel
16. CustomParallelizable
17. GenericParTemplate
18. HasNewCombiner
19. GenSet
20. GenericSetTemplate
21. GenIterable
22. GenTraversable
23. GenericTraversableTemplate
24. HasNewBuilder
25. GenSetLike
26. Equals
27. Function1
28. GenIterableLike
29. GenTraversableLike
30. Parallelizable
31. GenTraversableOnce
32. AnyRef
33. Any

Implicitly

1. by CollectionsHaveToParArray
2. by any2stringadd
3. by StringFormat
4. by Ensuring
5. by ArrowAssoc

1. Hide All
2. Show all

Learn more about member selection
Visibility

1. Public
2. All

### Type Members

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

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

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

   Attributes
     protected[this]
   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 Count extends Accessor[Int, Count]

   Attributes
     protected[this]
   Definition Classes
     ParIterableLike

9. #### class CreateScanTree[U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

   Attributes
     protected[this]
   Definition Classes
     ParIterableLike

10. #### class Drop[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

11. #### class Exists extends Accessor[Boolean, Exists]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

12. #### class Filter[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

13. #### class FilterNot[U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

15. #### class FlatMap[S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

17. #### class Forall extends Accessor[Boolean, Forall]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

18. #### class Foreach[S] extends Accessor[Unit, Foreach[S]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

19. #### class FromScanTree[U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

20. #### class GroupBy[K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

21. #### class Map[S, That] extends Transformer[Combiner[S, That], Map[S, That]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

23. #### class Min[U >: T] extends Accessor[Option[U], Min[U]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

24. #### trait NonDivisible[R] extends NonDivisibleTask[R, NonDivisible[R]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

25. #### trait NonDivisibleTask[R, Tp] extends StrictSplitterCheckTask[R, Tp]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

26. #### 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.

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

28. #### class Product[U >: T] extends Accessor[U, Product[U]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

29. #### class Reduce[U >: T] extends Accessor[Option[U], Reduce[U]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

30. #### abstract class ResultMapping[R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

31. #### type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

    Definition Classes
      ParIterableLike

32. #### 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

33. #### 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

34. #### trait ScanTree[U >: T] extends AnyRef

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

35. #### 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.

36. #### trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef

    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

40. #### trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]

    Attributes
      protected
    Definition Classes
      ParIterableLike

41. #### class Sum[U >: T] extends Accessor[U, Sum[U]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

43. #### class TakeWhile[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

44. #### trait TaskOps[R, Tp] extends AnyRef

    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

46. #### class ToParMap[K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

47. #### trait Transformer[R, Tp] extends Accessor[R, Tp]

    Attributes
      protected
    Definition Classes
      ParIterableLike

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

49. #### 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 +=(elem: T): ParSet.this.type

   adds a single element to this shrinkable collection.

   adds a single element to this shrinkable collection.

   elem

     the element to add.

   returns

     the shrinkable collection itself

   Definition Classes
     ParSetLike → Growable

2. #### abstract def -=(elem: T): ParSet.this.type

   Removes a single element from this shrinkable collection.

   Removes a single element from this shrinkable collection.

   elem

     the element to remove.

   returns

     the shrinkable collection itself

   Definition Classes
     ParSetLike → Shrinkable

3. #### abstract def clear(): Unit

   Clears the growable collection's contents.

   Clears the growable collection's contents. After this operation, the growable collection is empty.

   Definition Classes
     Growable → Clearable

4. #### abstract def contains(elem: T): Boolean

   Definition Classes
     GenSetLike

5. #### abstract def seq: mutable.Set[T]

   Definition Classes
     ParSet → ParIterable → ParIterableLike → GenSet → GenIterable → GenTraversable → GenSetLike → Parallelizable → GenTraversableOnce

6. #### abstract def size: Int

   The size of this general collection.

   The size of this general collection.

   Note: will not terminate for infinite-sized collections.

   returns

     the number of elements in this general collection.

   Definition Classes
     GenTraversableLike → GenTraversableOnce

7. #### abstract def splitter: IterableSplitter[T]

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

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

   returns

     a parallel iterator

   Attributes
     protected[scala.collection.parallel]
   Definition Classes
     ParIterableLike

### Concrete Value Members

1. #### final def !=(arg0: Any): Boolean

   Definition Classes
     AnyRef → Any

2. #### final def ##(): Int

   Definition Classes
     AnyRef → Any

3. #### def &(that: GenSet[T]): ParSet[T]

   Computes the intersection between this set and another set.

   Computes the intersection between this set and another set.

   Note: Same as `intersect`.

   that

     the set to intersect with.

   returns

     a new set consisting of all elements that are both in this set and in the given set `that`.

   Definition Classes
     GenSetLike

4. #### def &~(that: GenSet[T]): ParSet[T]

   The difference of this set and another set.

   The difference of this set and another set.

   Note: Same as `diff`.

   that

     the set of elements to exclude.

   returns

     a set containing those elements of this set that are not also contained in the given set `that`.

   Definition Classes
     GenSetLike

5. #### def +(elem: T): ParSet[T]

   Definition Classes
     ParSetLike → GenSetLike

6. #### def ++[B](that: GenTraversableOnce[B]): ParSet[B]

   [use case] Returns a new mutable parallel set containing the elements from the left hand operand followed by the elements from the right hand operand.

   [use case]

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

   Example:

       scala> val a = List(1)
       a: List[Int] = List(1)

       scala> val b = List(2)
       b: List[Int] = List(2)

       scala> val c = a ++ b
       c: List[Int] = List(1, 2)

       scala> val d = List('a')
       d: List[Char] = List(a)

       scala> val e = c ++ d
       e: List[AnyVal] = List(1, 2, a)

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new mutable parallel set which contains all elements of this mutable parallel set

     followed by all elements of `that`.

   Definition Classes
     ParIterableLike → GenTraversableLike
   Full Signature

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

7. #### def ++=(xs: TraversableOnce[T]): ParSet.this.type

   adds all elements produced by a TraversableOnce to this growable collection.

   adds all elements produced by a TraversableOnce to this growable collection.

   xs

     the TraversableOnce producing the elements to add.

   returns

     the growable collection itself.

   Definition Classes
     Growable

8. #### def +=(elem1: T, elem2: T, elems: T*): ParSet.this.type

   adds two or more elements to this growable collection.

   adds two or more elements to this growable collection.

   elem1

     the first element to add.

   elem2

     the second element to add.

   elems

     the remaining elements to add.

   returns

     the growable collection itself

   Definition Classes
     Growable

9. #### def -(elem: T): ParSet[T]

   Definition Classes
     ParSetLike → GenSetLike

10. #### def --=(xs: TraversableOnce[T]): ParSet.this.type

    Removes all elements produced by an iterator from this shrinkable collection.

    Removes all elements produced by an iterator from this shrinkable collection.

    xs

      the iterator producing the elements to remove.

    returns

      the shrinkable collection itself

    Definition Classes
      Shrinkable

11. #### def -=(elem1: T, elem2: T, elems: T*): ParSet.this.type

    Removes two or more elements from this shrinkable collection.

    Removes two or more elements from this shrinkable collection.

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

      the shrinkable collection itself

    Definition Classes
      Shrinkable

12. #### def ->[B](y: B): (ParSet[T], B)

    Implicit information
      This member is added by an implicit conversion from ParSet[T] to ArrowAssoc[ParSet[T]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
    Annotations
      @inline()

13. #### def /:[S](z: S)(op: (S, T) ⇒ S): S

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

    Applies a binary operator to a start value and all elements of this general iterable collection , 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 = List(1,2,3,4)
        a: List[Int] = List(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 iterable collection , 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 iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableOnce

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

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

    Applies a binary operator to all elements of this general iterable collection 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 = List(1,2,3,4)
        a: List[Int] = List(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 iterable collection , 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 iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableOnce

15. #### final def ==(arg0: Any): Boolean

    Definition Classes
      AnyRef → Any

16. #### 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 set, while `combop` would concatenate two sets 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) and may be evaluated more than once

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      ParIterableLike → GenTraversableOnce

17. #### def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A

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

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

    A

      the result type of function `g`

    g

      a function R => A

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()

18. #### def apply(elem: T): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

    This method is equivalent to `contains`. It allows sets to be interpreted as predicates.

    elem

      the element to test for membership.

    returns

      `true` if `elem` is contained in this set, `false` otherwise.

    Definition Classes
      GenSetLike → Function1

19. #### final def asInstanceOf[T0]: T0

    Definition Classes
      Any

20. #### def bf2seq[S, That](bf: CanBuildFrom[ParSet[T], S, That]): CanBuildFrom[mutable.Set[T], S, That]

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

21. #### implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]

    Attributes
      protected
    Definition Classes
      ParIterableLike

22. #### def canEqual(other: Any): Boolean

    Definition Classes
      ParIterableLike

23. #### def clone(): ParSet[T]

    Definition Classes
      Cloneable → AnyRef

24. #### def collect[B](pf: PartialFunction[A, B]): ParSet[B]

    [use case] Builds a new collection by applying a partial function to all elements of this mutable parallel set

    [use case]

    Builds a new collection by applying a partial function to all elements of this mutable parallel set

    on which the function is defined.

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the mutable parallel set .

    returns

      a new mutable parallel set 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
      ParIterableLike → GenTraversableLike
    Full Signature

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

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

    Attributes
      protected[this]
    Definition Classes
      ParIterableLike

26. #### def combinerFactory: CombinerFactory[T, ParSet[T]]

    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

27. #### def companion: GenericCompanion[ParSet] with GenericParCompanion[ParSet]

    The factory companion object that builds instances of class `mutable.ParSet`.

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

    Definition Classes
      ParSet → ParSet → ParIterable → ParIterable → GenericParTemplate → GenSet → GenIterable → GenTraversable → GenericTraversableTemplate

28. #### def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean

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

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

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()

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

    Definition Classes
      ParIterableLike → GenTraversableOnce

30. #### def copyToArray(xs: Array[A], start: Int): Unit

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

    [use case]

    Copies values of this mutable parallel set to an array. Fills the given array `xs` with values of this mutable parallel set , beginning at index `start`. Copying will stop once either the end of the current mutable parallel set 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
      ParIterableLike → GenTraversableOnce
    Full Signature

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

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

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

    [use case]

    Copies values of this mutable parallel set to an array. Fills the given array `xs` with values of this mutable parallel set . Copying will stop once either the end of the current mutable parallel set 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
      ParIterableLike → GenTraversableOnce
    Full Signature

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

32. #### def count(p: (T) ⇒ Boolean): Int

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

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

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      ParIterableLike → GenTraversableOnce

33. #### def debugBuffer: ArrayBuffer[String]

    Definition Classes
      ParIterableLike

34. #### implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

    Attributes
      protected
    Definition Classes
      ParIterableLike

35. #### def diff(that: GenSet[T]): ParSet[T]

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

      the set of elements to exclude.

    returns

      a set containing those elements of this set that are not also contained in the given set `that`.

    Definition Classes
      ParSetLike → GenSetLike

36. #### def drop(n: Int): ParSet[T]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

      the number of elements to drop from this general iterable collection .

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableLike

37. #### def dropWhile(pred: (T) ⇒ Boolean): ParSet[T]

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

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

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

    pred

      the predicate used to test the elements

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableLike

38. #### def empty: ParSet[T]

    Definition Classes
      ParSet → ParSetLike → ParSet → ParSetLike → GenericSetTemplate

39. #### def ensuring(cond: (ParSet[T]) ⇒ Boolean, msg: ⇒ Any): ParSet[T]

    Implicit information
      This member is added by an implicit conversion from ParSet[T] to Ensuring[ParSet[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

40. #### def ensuring(cond: (ParSet[T]) ⇒ Boolean): ParSet[T]

    Implicit information
      This member is added by an implicit conversion from ParSet[T] to Ensuring[ParSet[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

41. #### def ensuring(cond: Boolean, msg: ⇒ Any): ParSet[T]

    Implicit information
      This member is added by an implicit conversion from ParSet[T] to Ensuring[ParSet[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

42. #### def ensuring(cond: Boolean): ParSet[T]

    Implicit information
      This member is added by an implicit conversion from ParSet[T] to Ensuring[ParSet[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

43. #### final def eq(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

44. #### def equals(that: Any): Boolean

    Compares this set with another object for equality.

    Compares this set with another object for equality.

    Note: This operation contains an unchecked cast: if `that` is a set, it will assume with an unchecked cast that it has the same element type as this set. Any subsequent ClassCastException is treated as a `false` result.

    that

      the other object

    returns

      `true` if `that` is a set which contains the same elements as this set.

    Definition Classes
      GenSetLike → Equals → AnyRef → Any

45. #### def exists(pred: (T) ⇒ Boolean): Boolean

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

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

    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
      ParIterableLike → GenTraversableOnce

46. #### def filter(pred: (T) ⇒ Boolean): ParSet[T]

    Selects all elements of this general iterable collection which satisfy a predicate.

    Selects all elements of this general iterable collection which satisfy a predicate.

    pred

      the predicate used to test elements.

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableLike

47. #### def filterNot(pred: (T) ⇒ Boolean): ParSet[T]

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

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

    pred

      the predicate used to test elements.

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableLike

48. #### def finalize(): Unit

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )

49. #### 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
      ParIterableLike → GenTraversableOnce

50. #### def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ParSet[B]

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

    [use case]

    Builds a new collection by applying a function to all elements of this mutable parallel set

    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 mutable parallel set . 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 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 mutable parallel set resulting from applying the given collection-valued function `f` to each element of this mutable parallel set and concatenating the results.

    Definition Classes
      ParIterableLike → GenTraversableLike
    Full Signature

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

51. #### def flatten[B]: ParSet[B]

    [use case] Converts this mutable parallel set of traversable collections into a mutable parallel set formed by the elements of these traversable collections.

    [use case]

    Converts this mutable parallel set of traversable collections into a mutable parallel set formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of mutable parallel set . For example:

        val xs = List(
                   Set(1, 2, 3),
                   Set(1, 2, 3)
                 ).flatten
        // xs == List(1, 2, 3, 1, 2, 3)

        val ys = Set(
                   List(1, 2, 3),
                   List(3, 2, 1)
                 ).flatten
        // ys == Set(1, 2, 3)

    B

      the type of the elements of each traversable collection.

    returns

      a new mutable parallel set resulting from concatenating all element mutable parallel set s.

    Definition Classes
      GenericTraversableTemplate
    Full Signature

    #### def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSet[B]

52. #### 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
      ParIterableLike → GenTraversableOnce

53. #### def foldLeft[S](z: S)(op: (S, T) ⇒ S): S

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

    Applies a binary operator to a start value and all elements of this general iterable collection , 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 iterable collection , 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 iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableOnce

54. #### def foldRight[S](z: S)(op: (T, S) ⇒ S): S

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

    Applies a binary operator to all elements of this general iterable collection 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 iterable collection , 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 iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableOnce

55. #### def forall(pred: (T) ⇒ Boolean): Boolean

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

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

    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
      ParIterableLike → GenTraversableOnce

56. #### def foreach[U](f: (T) ⇒ U): Unit

    Applies a function `f` to all the elements of general iterable collection in an undefined order.

    Applies a function `f` to all the elements of general iterable collection in an 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
      ParIterableLike → GenTraversableLike → GenTraversableOnce

57. #### 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 ParSet[T] to StringFormat[ParSet[T]] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()

58. #### def genericBuilder[B]: Combiner[B, ParSet[B]]

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

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

    Definition Classes
      GenericParTemplate → GenericTraversableTemplate

59. #### def genericCombiner[B]: Combiner[B, ParSet[B]]

    Definition Classes
      GenericParTemplate

60. #### final def getClass(): Class[_]

    Definition Classes
      AnyRef → Any

61. #### def groupBy[K](f: (T) ⇒ K): immutable.ParMap[K, ParSet[T]]

    Partitions this general iterable collection into a map of general iterable collection s according to some discriminator function.

    Partitions this general iterable collection into a map of general iterable collection s 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 iterable collection .

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to general iterable collection s such that the following invariant holds:

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

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

    Definition Classes
      ParIterableLike → GenTraversableLike

62. #### def hasDefiniteSize: Boolean

    Definition Classes
      ParIterableLike → GenTraversableOnce

63. #### def hashCode(): Int

    Definition Classes
      GenSetLike → AnyRef → Any

64. #### def head: T

    Selects the first element of this general iterable collection .

    Selects the first element of this general iterable collection .

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

    returns

      the first element of this general iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableLike
    Exceptions thrown
      `NoSuchElementException`

      if the general iterable collection is empty.

65. #### 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 iterable collection if it is nonempty, `None` if it is empty.

    Definition Classes
      ParIterableLike → GenTraversableLike

66. #### def init: ParSet[T]

    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 iterable collection consisting of all elements of this general iterable collection

      except the last one.

    Definition Classes
      ParIterableLike → GenTraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the general iterable collection is empty.

67. #### def initTaskSupport(): Unit

    Attributes
      protected
    Definition Classes
      ParIterableLike

68. #### def intersect(that: GenSet[T]): ParSet[T]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    that

      the set to intersect with.

    returns

      a new set consisting of all elements that are both in this set and in the given set `that`.

    Definition Classes
      GenSetLike

69. #### def isEmpty: Boolean

    Tests whether the general iterable collection is empty.

    Tests whether the general iterable collection is empty.

    returns

      `true` if the general iterable collection contains no elements, `false` otherwise.

    Definition Classes
      ParIterableLike → GenTraversableOnce

70. #### final def isInstanceOf[T0]: Boolean

    Definition Classes
      Any

71. #### 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

72. #### final def isTraversableAgain: Boolean

    Tests whether this general iterable collection can be repeatedly traversed.

    Tests whether this general iterable collection can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      ParIterableLike → GenTraversableLike → GenTraversableOnce

73. #### def iterator: Splitter[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
      ParIterableLike → GenIterableLike

74. #### 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 iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableLike
    Exceptions thrown
      NoSuchElementException

      If the general iterable collection is empty.

75. #### 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 iterable collection $ if it is nonempty, `None` if it is empty.

    Definition Classes
      ParIterableLike → GenTraversableLike

76. #### def map[B](f: (A) ⇒ B): ParSet[B]

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

    [use case]

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableLike
    Full Signature

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

77. #### def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

      the largest element of this mutable parallel set .

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Full Signature

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

78. #### def maxBy[B](f: (A) ⇒ B): A

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

      The result type of the function f.

    f

      The measuring function.

    returns

      the first element of this mutable parallel set with the largest value measured by function f.

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Full Signature

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

79. #### def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

      the smallest element of this mutable parallel set

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Full Signature

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

80. #### def minBy[B](f: (A) ⇒ B): A

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

      The result type of the function f.

    f

      The measuring function.

    returns

      the first element of this mutable parallel set with the smallest value measured by function f.

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Full Signature

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

81. #### def mkString: String

    Displays all elements of this general iterable collection in a string.

    Displays all elements of this general iterable collection in a string.

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableOnce

82. #### def mkString(sep: String): String

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

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

    sep

      the separator string.

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Example:

    1. `List(1, 2, 3).mkString("|") = "1|2|3"`

83. #### def mkString(start: String, sep: String, end: String): String

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

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

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Example:

    1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

84. #### final def ne(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

85. #### def newBuilder: Builder[T, ParSet[T]]

    The builder that builds instances of type CC[A]

    The builder that builds instances of type CC[A]

    Attributes
      protected[this]
    Definition Classes
      GenericParTemplate → GenericTraversableTemplate → HasNewBuilder

86. #### def newCombiner: Combiner[T, ParSet[T]]

    Attributes
      protected[this]
    Definition Classes
      GenericParTemplate → HasNewCombiner

87. #### def nonEmpty: Boolean

    Tests whether the general iterable collection is not empty.

    Tests whether the general iterable collection is not empty.

    returns

      `true` if the general iterable collection contains at least one element, `false` otherwise.

    Definition Classes
      ParIterableLike → GenTraversableOnce

88. #### final def notify(): Unit

    Definition Classes
      AnyRef

89. #### final def notifyAll(): Unit

    Definition Classes
      AnyRef

90. #### def par: ParSet[T]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

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

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

    All parallel collections return a reference to themselves.

    returns

      a parallel implementation of this collection

    Definition Classes
      ParIterableLike → CustomParallelizable → Parallelizable

91. #### def parCombiner: Combiner[T, ParSet[T]]

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

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

    returns

      a combiner for the parallel collection of type `ParRepr`

    Attributes
      protected[this]
    Definition Classes
      CustomParallelizable → Parallelizable

92. #### def partition(pred: (T) ⇒ Boolean): (ParSet[T], ParSet[T])

    Partitions this general iterable collection in two general iterable collection s according to a predicate.

    Partitions this general iterable collection in two general iterable collection s according to a predicate.

    pred

      the predicate on which to partition.

    returns

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

    Definition Classes
      ParIterableLike → GenTraversableLike

93. #### 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 mutable parallel set 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 mutable parallel set and as result type of `product`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Full Signature

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

94. #### 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
      ParIterableLike → GenTraversableOnce
    Exceptions thrown
      UnsupportedOperationException

      if this general iterable collection is empty.

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

    Definition Classes
      ParIterableLike

96. #### def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]

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

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

    Definition Classes
      ParIterableLike → GenTraversableOnce

97. #### 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
      ParIterableLike → GenTraversableOnce

98. #### def reduceRight[U >: T](op: (T, U) ⇒ U): U

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

    Applies a binary operator to all elements of this general iterable collection , 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 iterable collection , 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 iterable collection .

    Definition Classes
      ParIterableLike → GenTraversableOnce
    Exceptions thrown
      `UnsupportedOperationException`

      if this general iterable collection is empty.

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

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

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

    Definition Classes
      ParIterableLike → GenTraversableOnce

100. #### def repr: ParSet[T]

     Definition Classes
       ParIterableLike → GenTraversableLike

101. #### 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

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

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

     [use case]

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

     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
       ParIterableLike → GenIterableLike
     Full Signature

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

103. #### def scan(z: T)(op: (T, T) ⇒ T): ParSet[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 mutable parallel set containing the prefix scan of the elements in this mutable parallel set

     Definition Classes
       ParIterableLike → GenTraversableLike
     Full Signature

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

104. #### def scanBlockSize: Int

     Attributes
       protected[this]
     Definition Classes
       ParIterableLike

105. #### def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParSet[T], 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
       ParIterableLike → GenTraversableLike

106. #### def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParSet[T], 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
       ParIterableLike → GenTraversableLike

107. #### def sequentially[S, That <: Parallel](b: (mutable.Set[T]) ⇒ Parallelizable[S, That]): ParSet[T]

     Attributes
       protected[this]
     Definition Classes
       ParIterableLike

108. #### def slice(unc_from: Int, unc_until: Int): ParSet[T]

     Selects an interval of elements.

     Selects an interval of elements. The returned collection is made up of all elements `x` which satisfy the invariant:

         from <= indexOf(x) < until

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

     unc_from

       the lowest index to include from this general iterable collection .

     unc_until

       the lowest index to EXCLUDE from this general iterable collection .

     returns

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

     Definition Classes
       ParIterableLike → GenTraversableLike

109. #### def span(pred: (T) ⇒ Boolean): (ParSet[T], ParSet[T])

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

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

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

     pred

       the predicate used to test the elements

     returns

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

     Definition Classes
       ParIterableLike → GenTraversableLike

110. #### def splitAt(n: Int): (ParSet[T], ParSet[T])

     Splits this general iterable collection into two at a given position.

     Splits this general iterable collection 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 iterable collection s consisting of the first `n` elements of this general iterable collection , and the other elements.

     Definition Classes
       ParIterableLike → GenTraversableLike

111. #### def stringPrefix: String

     Defines the prefix of this object's `toString` representation.

     Defines the prefix of this object's `toString` representation.

     returns

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

     Definition Classes
       ParSet → ParIterable → GenTraversableLike

112. #### def subsetOf(that: GenSet[T]): Boolean

     Tests whether this set is a subset of another set.

     Tests whether this set is a subset of another set.

     that

       the set to test.

     returns

       `true` if this set is a subset of `that`, i.e. if every element of this set is also an element of `that`.

     Definition Classes
       GenSetLike

113. #### 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 mutable parallel set 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 mutable parallel set and as result type of `sum`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

     Definition Classes
       ParIterableLike → GenTraversableOnce
     Full Signature

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

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

     Definition Classes
       AnyRef

115. #### def tail: ParSet[T]

     Selects all elements except the first.

     Selects all elements except the first.

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

     returns

       a general iterable collection consisting of all elements of this general iterable collection

       except the first one.

     Definition Classes
       ParIterableLike → GenTraversableLike
     Exceptions thrown
       `UnsupportedOperationException`

       if the general iterable collection is empty.

116. #### def take(n: Int): ParSet[T]

     Selects first n elements.

     Selects first n elements.

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

     n

       the number of elements to take from this general iterable collection .

     returns

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

     Definition Classes
       ParIterableLike → GenTraversableLike

117. #### def takeWhile(pred: (T) ⇒ Boolean): ParSet[T]

     Takes the longest prefix of elements that satisfy the predicate.

     Takes the longest prefix of elements that satisfy the predicate.

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

     pred

       the predicate used to test the elements

     returns

       the longest prefix of this general iterable collection of elements that satisy the predicate `pred`

     Definition Classes
       ParIterableLike → GenTraversableLike

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

     Attributes
       protected
     Definition Classes
       ParIterableLike

119. #### 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

120. #### 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

121. #### def to[Col[_]]: Col[A]

     [use case] Converts this mutable parallel set into another by copying all elements.

     [use case]

     Converts this mutable parallel set 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 mutable parallel set .

     Definition Classes
       ParIterableLike → GenTraversableOnce
     Full Signature

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

122. #### def toArray: Array[A]

     [use case] Converts this mutable parallel set to an array.

     [use case]

     Converts this mutable parallel set to an array.

     Note: will not terminate for infinite-sized collections.

     returns

       an array containing all elements of this mutable parallel set . An `ClassTag` must be available for the element type of this mutable parallel set .

     Definition Classes
       ParIterableLike → GenTraversableOnce
     Full Signature

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

123. #### def toBuffer[U >: T]: Buffer[U]

     Uses the contents of this general iterable collection to create a new mutable buffer.

     Uses the contents of this general iterable collection to create a new mutable buffer.

     Note: will not terminate for infinite-sized collections.

     returns

       a buffer containing all elements of this general iterable collection .

     Definition Classes
       ParIterableLike → GenTraversableOnce

124. #### def toIndexedSeq: immutable.IndexedSeq[T]

     Converts this general iterable collection to an indexed sequence.

     Converts this general iterable collection to an indexed sequence.

     Note: will not terminate for infinite-sized collections.

     returns

       an indexed sequence containing all elements of this general iterable collection .

     Definition Classes
       ParIterableLike → GenTraversableOnce

125. #### def toIterable: ParIterable[T]

     Converts this parallel iterable to an iterable collection.

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

     Note: will not terminate for infinite-sized collections.

     returns

       an `Iterable` containing all elements of this parallel iterable.

     Definition Classes
       ParIterable → ParIterableLike → GenTraversableOnce

126. #### def toIterator: scala.Iterator[T]

     Returns an Iterator over the elements in this general iterable collection .

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

     Definition Classes
       ParIterableLike → GenTraversableOnce

127. #### def toList: List[T]

     Converts this general iterable collection to a list.

     Converts this general iterable collection to a list.

     Note: will not terminate for infinite-sized collections.

     returns

       a list containing all elements of this general iterable collection .

     Definition Classes
       ParIterableLike → GenTraversableOnce

128. #### def toMap[T, U]: collection.Map[T, U]

     [use case] Converts this mutable parallel set to a map.

     [use case]

     Converts this mutable parallel set 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 mutable parallel set .

     Definition Classes
       ParIterableLike → GenTraversableOnce
     Full Signature

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

129. #### def toParArray: ParArray[T]

     Implicit information
       This member is added by an implicit conversion from ParSet[T] to CollectionsHaveToParArray[ParSet[T], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ParSet[T]) ⇒ GenTraversableOnce[T] is in scope.
     Definition Classes
       CollectionsHaveToParArray

130. #### def toParCollection[U >: T, That](cbf: () ⇒ Combiner[U, That]): That

     Attributes
       protected
     Definition Classes
       ParIterableLike

131. #### def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[T, (K, V)]): That

     Attributes
       protected
     Definition Classes
       ParIterableLike

132. #### def toSeq: ParSeq[T]

     Converts this parallel iterable to a sequence.

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

     Note: will not terminate for infinite-sized collections.

     returns

       a sequence containing all elements of this parallel iterable.

     Definition Classes
       ParIterable → ParIterableLike → GenTraversableOnce

133. #### def toSet[U >: T]: immutable.ParSet[U]

     Converts this general iterable collection to a set.

     Converts this general iterable collection to a set.

     Note: will not terminate for infinite-sized collections.

     returns

       a set containing all elements of this general iterable collection .

     Definition Classes
       ParIterableLike → GenTraversableOnce

134. #### def toStream: Stream[T]

     Converts this general iterable collection to a stream.

     Converts this general iterable collection to a stream.

     returns

       a stream containing all elements of this general iterable collection .

     Definition Classes
       ParIterableLike → GenTraversableOnce

135. #### def toString(): String

     Definition Classes
       ParIterableLike → AnyRef → Any

136. #### def toTraversable: GenTraversable[T]

     Converts this general iterable collection to an unspecified Traversable.

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

     Definition Classes
       ParIterableLike → GenTraversableOnce

137. #### def toVector: Vector[T]

     Converts this general iterable collection to a Vector.

     Converts this general iterable collection to a Vector.

     Note: will not terminate for infinite-sized collections.

     returns

       a vector containing all elements of this general iterable collection .

     Definition Classes
       ParIterableLike → GenTraversableOnce

138. #### def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParSet[ParSet[B]]

     Transposes this collection of traversable collections into a collection of collections.

     Transposes this collection of traversable collections into a collection of collections.

     The resulting collection's type will be guided by the static type of collection. For example:

         val xs = List(
                    Set(1, 2, 3),
                    Set(4, 5, 6)).transpose
         // xs == List(
         //         List(1, 4),
         //         List(2, 5),
         //         List(3, 6))

         val ys = Vector(
                    List(1, 2, 3),
                    List(4, 5, 6)).transpose
         // ys == Vector(
         //         Vector(1, 4),
         //         Vector(2, 5),
         //         Vector(3, 6))

     B

       the type of the elements of each traversable collection.

     asTraversable

       an implicit conversion which asserts that the element type of this collection is a `Traversable`.

     returns

       a two-dimensional collection of collections which has as nth row the nth column of this collection.

     Definition Classes
       GenericTraversableTemplate
     Annotations
       @migration
     Migration

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

     Exceptions thrown
       `IllegalArgumentException`

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

139. #### def union(that: GenSet[T]): ParSet[T]

     Computes the union between of set and another set.

     Computes the union between of set and another set.

     that

       the set to form the union with.

     returns

       a new set consisting of all elements that are in this set or in the given set `that`.

     Definition Classes
       ParSetLike → GenSetLike

140. #### def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParSet[A1], ParSet[A2])

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

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

         val xs = CC(
                    (1, "one"),
                    (2, "two"),
                    (3, "three")).unzip
         // xs == (CC(1, 2, 3),
         //        CC(one, two, three))

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

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

     returns

       a pair of collections, containing the first, respectively second half of each element pair of this collection.

     Definition Classes
       GenericTraversableTemplate

141. #### def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParSet[A1], ParSet[A2], ParSet[A3])

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

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

         val xs = CC(
                    (1, "one", '1'),
                    (2, "two", '2'),
                    (3, "three", '3')).unzip3
         // xs == (CC(1, 2, 3),
         //        CC(one, two, three),
         //        CC(1, 2, 3))

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

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

     returns

       a triple of collections, containing the first, second, respectively third member of each element triple of this collection.

     Definition Classes
       GenericTraversableTemplate

142. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

143. #### final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

144. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

145. #### def withFilter(pred: (T) ⇒ Boolean): ParSet[T]

     Definition Classes
       ParIterableLike

146. #### def wrap[R](body: ⇒ R): NonDivisible[R]

     Attributes
       protected
     Definition Classes
       ParIterableLike

147. #### def zip[B](that: GenIterable[B]): ParSet[(A, B)]

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

     [use case]

     Returns a mutable parallel set formed from this mutable parallel set 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 mutable parallel set containing pairs consisting of corresponding elements of this mutable parallel set and `that`. The length of the returned collection is the minimum of the lengths of this mutable parallel set and `that`.

     Definition Classes
       ParIterableLike → GenIterableLike
     Full Signature

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

148. #### def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): ParSet[(A, B)]

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

     [use case]

     Returns a mutable parallel set formed from this mutable parallel set 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 mutable parallel set is shorter than `that`.

     thatElem

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

     returns

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

     Definition Classes
       ParIterableLike → GenIterableLike
     Full Signature

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

149. #### def zipWithIndex: ParSet[(A, Int)]

     [use case] Zips this mutable parallel set with its indices.

     [use case]

     Zips this mutable parallel set with its indices.

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

     returns

       A new mutable parallel set containing pairs consisting of all elements of this mutable parallel set paired with their index. Indices start at `0`.

     Definition Classes
       ParIterableLike → GenIterableLike
     Full Signature

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

     Example:

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

150. #### def |(that: GenSet[T]): ParSet[T]

     Computes the union between this set and another set.

     Computes the union between this set and another set.

     Note: Same as `union`.

     that

       the set to form the union with.

     returns

       a new set consisting of all elements that are in this set or in the given set `that`.

     Definition Classes
       GenSetLike

151. #### def →[B](y: B): (ParSet[T], B)

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

### Shadowed Implicit Value Members

1. #### def +(other: String): String

   Implicit information
     This member is added by an implicit conversion from ParSet[T] to any2stringadd[ParSet[T]] performed by method any2stringadd in scala.Predef.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (parSet: any2stringadd[ParSet[T]]).+(other)

   Definition Classes
     any2stringadd

### Deprecated Value Members

1. #### def view: IterableView[T, mutable.Set[T]]

   Definition Classes
     ParIterableLike
   Annotations
     @deprecated
   Deprecated

     (Since version 2.11.0) Use .seq.view instead

### Inherited from ParSetLike[T, ParSet[T], mutable.Set[T]]

### Inherited from mutable.Cloneable[ParSet[T]]

### Inherited from Cloneable

### Inherited from java.lang.Cloneable

### Inherited from Shrinkable[T]

### Inherited from Growable[T]

### Inherited from Clearable

### Inherited from parallel.ParSet[T]

### Inherited from parallel.ParSetLike[T, ParSet[T], mutable.Set[T]]

### Inherited from ParIterable[T]

### Inherited from Mutable

### Inherited from parallel.ParIterable[T]

### Inherited from ParIterableLike[T, ParSet[T], mutable.Set[T]]

### Inherited from Parallel

### Inherited from CustomParallelizable[T, ParSet[T]]

### Inherited from GenericParTemplate[T, ParSet]

### Inherited from HasNewCombiner[T, scala.collection.parallel.mutable.ParSet[T] @scala.annotation.unchecked.uncheckedVariance]

### Inherited from GenSet[T]

### Inherited from GenericSetTemplate[T, GenSet]

### Inherited from GenIterable[T]

### Inherited from GenTraversable[T]

### Inherited from GenericTraversableTemplate[T, ParSet]

### Inherited from HasNewBuilder[T, scala.collection.parallel.mutable.ParSet[T] @scala.annotation.unchecked.uncheckedVariance]

### Inherited from GenSetLike[T, ParSet[T]]

### Inherited from Equals

### Inherited from (T) ⇒ Boolean

### Inherited from GenIterableLike[T, ParSet[T]]

### Inherited from GenTraversableLike[T, ParSet[T]]

### Inherited from Parallelizable[T, ParSet[T]]

### Inherited from GenTraversableOnce[T]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion CollectionsHaveToParArray from ParSet[T] to CollectionsHaveToParArray[ParSet[T], T]

### Inherited by implicit conversion any2stringadd from ParSet[T] to any2stringadd[ParSet[T]]

### Inherited by implicit conversion StringFormat from ParSet[T] to StringFormat[ParSet[T]]

### Inherited by implicit conversion Ensuring from ParSet[T] to Ensuring[ParSet[T]]

### Inherited by implicit conversion ArrowAssoc from ParSet[T] to ArrowAssoc[ParSet[T]]

### Ungrouped