Class/Object

scala.collection.parallel.mutable

ParHashSet

Related Docs: object ParHashSet | package mutable

Permalink

class ParHashSet[T] extends ParSet[T] with GenericParTemplate[T, ParHashSet] with ParSetLike[T, ParHashSet[T], HashSet[T]] with ParFlatHashTable[T] with Serializable

A parallel hash set.

ParHashSet is a parallel set which internally keeps elements within a hash table. It uses linear probing to resolve collisions.

T

type of the elements in the parallel hash set .

Annotations
@SerialVersionUID()
Linear Supertypes
Serializable, java.io.Serializable, ParFlatHashTable[T], FlatHashTable[T], HashUtils[T], ParSet[T], ParSetLike[T, ParHashSet[T], HashSet[T]], mutable.Cloneable[ParHashSet[T]], Cloneable, java.lang.Cloneable, Shrinkable[T], Growable[T], Clearable, parallel.ParSet[T], parallel.ParSetLike[T, ParHashSet[T], HashSet[T]], ParIterable[T], Mutable, parallel.ParIterable[T], ParIterableLike[T, ParHashSet[T], HashSet[T]], Parallel, CustomParallelizable[T, ParHashSet[T]], GenericParTemplate[T, ParHashSet], HasNewCombiner[T, scala.collection.parallel.mutable.ParHashSet[T] @scala.annotation.unchecked.uncheckedVariance], GenSet[T], GenericSetTemplate[T, GenSet], GenIterable[T], GenTraversable[T], GenericTraversableTemplate[T, ParHashSet], HasNewBuilder[T, scala.collection.parallel.mutable.ParHashSet[T] @scala.annotation.unchecked.uncheckedVariance], GenSetLike[T, ParHashSet[T]], Equals, (T) ⇒ Boolean, GenIterableLike[T, ParHashSet[T]], GenTraversableLike[T, ParHashSet[T]], Parallelizable[T, ParHashSet[T]], GenTraversableOnce[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParHashSet
  2. Serializable
  3. Serializable
  4. ParFlatHashTable
  5. FlatHashTable
  6. HashUtils
  7. ParSet
  8. ParSetLike
  9. Cloneable
  10. Cloneable
  11. Cloneable
  12. Shrinkable
  13. Growable
  14. Clearable
  15. ParSet
  16. ParSetLike
  17. ParIterable
  18. Mutable
  19. ParIterable
  20. ParIterableLike
  21. Parallel
  22. CustomParallelizable
  23. GenericParTemplate
  24. HasNewCombiner
  25. GenSet
  26. GenericSetTemplate
  27. GenIterable
  28. GenTraversable
  29. GenericTraversableTemplate
  30. HasNewBuilder
  31. GenSetLike
  32. Equals
  33. Function1
  34. GenIterableLike
  35. GenTraversableLike
  36. Parallelizable
  37. GenTraversableOnce
  38. AnyRef
  39. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParHashSet()

    Permalink

Type Members

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

    Permalink

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

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

    R

    type of the result of this method (R for result).

    Tp

    the representation type of the task at hand.

    Attributes
    protected
    Definition Classes
    ParIterableLike
  2. class Aggregate[S] extends Accessor[S, Aggregate[S]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  3. trait BuilderOps[Elem, To] extends AnyRef

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

    Permalink
    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]]

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  8. class Count extends Accessor[Int, Count]

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  11. class Exists extends Accessor[Boolean, Exists]

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

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

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  21. class Map[S, That] extends Transformer[Combiner[S, That], Map[S, That]]

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

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

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

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

    Permalink
    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]

    Permalink

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  27. abstract class ParFlatHashTableIterator extends IterableSplitter[T] with SizeMapUtils

    Permalink
    Definition Classes
    ParFlatHashTable
  28. class ParHashSetIterator extends ParFlatHashTableIterator

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

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

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  33. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

    Permalink
    Definition Classes
    ParIterableLike
  34. 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

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

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

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

    Permalink

    Sequentially performs one task after another.

    Sequentially performs one task after another.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  38. trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef

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

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

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

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  49. trait Transformer[R, Tp] extends Accessor[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  50. class Zip[U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[T]): ParHashSet[T]

    Permalink

    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]): ParHashSet[T]

    Permalink

    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): ParHashSet[T]

    Permalink
    Definition Classes
    ParSetLikeGenSetLike
  6. def ++[B](that: GenTraversableOnce[B]): ParHashSet[B]

    Permalink

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

    [use case]

    Returns a new parallel hash set containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the parallel hash 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 parallel hash set which contains all elements of this parallel hash set followed by all elements of that.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

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

    Permalink

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

    Permalink

    adds a single element to this parallel hash set .

    adds a single element to this parallel hash set .

    elem

    the element to add.

    returns

    the parallel hash set itself

    Definition Classes
    ParHashSetParSetLikeGrowable
  9. def +=(elem1: T, elem2: T, elems: T*): ParHashSet.this.type

    Permalink

    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
  10. def -(elem: T): ParHashSet[T]

    Permalink
    Definition Classes
    ParSetLikeGenSetLike
  11. def --=(xs: TraversableOnce[T]): ParHashSet.this.type

    Permalink

    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
  12. def -=(elem: T): ParHashSet.this.type

    Permalink

    Removes a single element from this parallel hash set .

    Removes a single element from this parallel hash set .

    elem

    the element to remove.

    returns

    the parallel hash set itself

    Definition Classes
    ParHashSetParSetLikeShrinkable
  13. def -=(elem1: T, elem2: T, elems: T*): ParHashSet.this.type

    Permalink

    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
  14. def /:[S](z: S)(op: (S, T) ⇒ S): S

    Permalink

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

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

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

    Examples:

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

    scala> val a = 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 parallel iterable, going left to right with the start value z on the left:

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

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

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

    Permalink

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

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

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

    Note: will not terminate for infinite-sized collections.

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

    Examples:

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

    scala> val a = 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 parallel iterable, going right to left with the start value z on the right:

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

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  16. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  17. def addElem(elem: T): Boolean

    Permalink

    Add elem if not yet in table.

    Add elem if not yet in table.

    returns

    Returns true if a new elem was added, false otherwise.

    Attributes
    protected
    Definition Classes
    FlatHashTable
  18. def addEntry(newEntry: AnyRef): Boolean

    Permalink

    Add an entry (an elem converted to an entry via elemToEntry) if not yet in table.

    Add an entry (an elem converted to an entry via elemToEntry) if not yet in table.

    returns

    Returns true if a new elem was added, false otherwise.

    Attributes
    protected
    Definition Classes
    FlatHashTable
  19. def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  20. def alwaysInitSizeMap: Boolean

    Permalink
    Definition Classes
    ParFlatHashTableFlatHashTable
  21. def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A

    Permalink

    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()
  22. def apply(elem: T): Boolean

    Permalink

    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
    GenSetLikeFunction1
  23. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  24. def bf2seq[S, That](bf: CanBuildFrom[ParHashSet[T], S, That]): CanBuildFrom[HashSet[T], S, That]

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

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  26. def calcSizeMapSize(tableLength: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  27. def canEqual(other: Any): Boolean

    Permalink
    Definition Classes
    ParIterableLike
  28. def capacity(expectedSize: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  29. def clear(): Unit

    Permalink

    Clears the parallel hash set 's contents.

    Clears the parallel hash set 's contents. After this operation, the parallel hash set is empty.

    Definition Classes
    ParHashSetGrowableClearable
  30. def clearTable(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  31. def clone(): ParHashSet[T]

    Permalink
    Definition Classes
    Cloneable → AnyRef
  32. def collect[B](pf: PartialFunction[A, B]): ParHashSet[B]

    Permalink

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

    [use case]

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

    on which the function is defined.

    B

    the element type of the returned collection.

    pf

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

    returns

    a new parallel hash 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
    ParIterableLikeGenTraversableLike
    Full Signature

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  34. def combinerFactory: CombinerFactory[T, ParHashSet[T]]

    Permalink

    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
  35. def companion: ParHashSet.type

    Permalink

    The factory companion object that builds instances of class ParHashSet.

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

    Definition Classes
    ParHashSetParSetParSetParIterableParIterableGenericParTemplateGenSetGenIterableGenTraversableGenericTraversableTemplate
  36. def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean

    Permalink

    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()
  37. def contains(elem: T): Boolean

    Permalink
    Definition Classes
    ParHashSetGenSetLike
  38. def containsElem(elem: T): Boolean

    Permalink

    Checks whether an element is contained in the hash table.

    Checks whether an element is contained in the hash table.

    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  39. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    Permalink

    [use case] Copies the elements of this parallel hash set to an array.

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    Permalink

    [use case] Copies the elements of this parallel hash set to an array.

    [use case]

    Copies the elements of this parallel hash set to an array. Fills the given array xs with values of this parallel hash set , beginning at index start. Copying will stop once either the end of the current parallel hash set is reached, or the end of the target 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

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

    Permalink

    [use case] Copies the elements of this parallel hash set to an array.

    [use case]

    Copies the elements of this parallel hash set to an array. Fills the given array xs with values of this parallel hash set . Copying will stop once either the end of the current parallel hash set is reached, or the end of the target 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

  42. def count(p: (T) ⇒ Boolean): Int

    Permalink

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

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

    Permalink
    Definition Classes
    ParIterableLike
  44. def debugInformation: String

    Permalink
    Definition Classes
    ParHashSetParIterableLike
  45. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  46. def diff(that: GenSet[T]): ParHashSet[T]

    Permalink

    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
    ParSetLikeGenSetLike
  47. def drop(n: Int): ParHashSet[T]

    Permalink

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

    the number of elements to drop from this parallel iterable.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  48. def dropWhile(pred: (T) ⇒ Boolean): ParHashSet[T]

    Permalink

    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 parallel iterable that satisfy the predicate pred

    Definition Classes
    ParIterableLikeGenTraversableLike
  49. final def elemToEntry(elem: T): AnyRef

    Permalink

    Elems have type A, but we store AnyRef in the table.

    Elems have type A, but we store AnyRef in the table. Plus we need to deal with null elems, which need to be stored as NullSentinel

    Attributes
    protected
    Definition Classes
    HashUtils
  50. def empty: ParHashSet[T]

    Permalink
    Definition Classes
    ParHashSetParSetParSetLikeParSetParSetLikeGenericSetTemplate
  51. final def entryToElem(entry: AnyRef): T

    Permalink

    Does the inverse translation of elemToEntry

    Does the inverse translation of elemToEntry

    Attributes
    protected
    Definition Classes
    HashUtils
  52. final def eq(arg0: AnyRef): Boolean

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

    Permalink

    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
    GenSetLikeEquals → AnyRef → Any
  54. def exists(p: (T) ⇒ Boolean): Boolean

    Permalink

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

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

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

    p

    a predicate used to test elements

    returns

    true if p holds for some element, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  55. def filter(pred: (T) ⇒ Boolean): ParHashSet[T]

    Permalink

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  56. def filterNot(pred: (T) ⇒ Boolean): ParHashSet[T]

    Permalink

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  57. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  58. def find(p: (T) ⇒ Boolean): Option[T]

    Permalink

    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.

    p

    predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  59. def findEntry(elem: T): Option[T]

    Permalink

    Finds an entry in the hash table if such an element exists.

    Finds an entry in the hash table if such an element exists.

    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  60. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ParHashSet[B]

    Permalink

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

    [use case]

    Builds a new collection by applying a function to all elements of this parallel hash 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 parallel hash 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 parallel hash set resulting from applying the given collection-valued function f to each element of this parallel hash set and concatenating the results.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

  61. def flatten[B]: ParHashSet[B]

    Permalink

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

    [use case]

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

    The resulting collection's type will be guided by the static type of parallel hash 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 parallel hash set resulting from concatenating all element parallel hash set s.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

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

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

    Permalink

    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
  63. def foldLeft[S](z: S)(op: (S, T) ⇒ S): S

    Permalink

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

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

    Note: will not terminate for infinite-sized collections.

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

    z

    the start value.

    op

    the binary operator.

    returns

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

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

    where x1, ..., xn are the elements of this parallel iterable. Returns z if this parallel iterable is empty.

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

    Permalink

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

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

    Note: will not terminate for infinite-sized collections.

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

    z

    the start value.

    op

    the binary operator.

    returns

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

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

    where x1, ..., xn are the elements of this parallel iterable. Returns z if this parallel iterable is empty.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  65. def forall(p: (T) ⇒ Boolean): Boolean

    Permalink

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

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

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

    p

    a predicate used to test elements

    returns

    true if p holds for all elements, false otherwise

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

    Permalink

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

    Applies a function f to all the elements of parallel iterable 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
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  67. def genericBuilder[B]: Combiner[B, ParHashSet[B]]

    Permalink

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

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

    Definition Classes
    GenericParTemplateGenericTraversableTemplate
  68. def genericCombiner[B]: Combiner[B, ParHashSet[B]]

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

    Permalink
    Definition Classes
    AnyRef → Any
  70. def groupBy[K](f: (T) ⇒ K): immutable.ParMap[K, ParHashSet[T]]

    Permalink

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

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

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

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

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

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  71. def hasDefiniteSize: Boolean

    Permalink

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

    Tests whether this parallel iterable is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  72. def hashCode(): Int

    Permalink
    Definition Classes
    GenSetLike → AnyRef → Any
  73. def head: T

    Permalink

    Selects the first element of this parallel iterable.

    Selects the first element of this parallel iterable.

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

    returns

    the first element of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    NoSuchElementException if the parallel iterable is empty.

  74. def headOption: Option[T]

    Permalink

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  75. final def improve(hcode: Int, seed: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    HashUtils
  76. final def index(hcode: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  77. def init: ParHashSet[T]

    Permalink

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

  78. def initTaskSupport(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  79. def initWithContents(c: Contents[T]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  80. def initialSize: Int

    Permalink

    The initial size of the hash table.

    The initial size of the hash table.

    Definition Classes
    FlatHashTable
  81. def intersect(that: GenSet[T]): ParHashSet[T]

    Permalink

    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
  82. def isEmpty: Boolean

    Permalink

    Tests whether the parallel iterable is empty.

    Tests whether the parallel iterable is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  83. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  84. def isSizeMapDefined: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  85. def isStrictSplitterCollection: Boolean

    Permalink

    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
  86. final def isTraversableAgain: Boolean

    Permalink

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  87. def iterator: ParHashSetIterator

    Permalink

    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
    ParHashSetFlatHashTableParIterableLikeGenSetLikeGenIterableLike
  88. def last: T

    Permalink

    Selects the last element.

    Selects the last element.

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

    returns

    The last element of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    NoSuchElementException If the parallel iterable is empty.

  89. def lastOption: Option[T]

    Permalink

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  90. def map[B](f: (A) ⇒ B): ParHashSet[B]

    Permalink

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

  91. def max: A

    Permalink

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this parallel hash set .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    Permalink

    [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 parallel hash set with the largest value measured by function f.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  93. def min: A

    Permalink

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this parallel hash set

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    Permalink

    [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 parallel hash set with the smallest value measured by function f.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  95. def mkString: String

    Permalink

    Displays all elements of this parallel iterable in a string.

    Displays all elements of this parallel iterable in a string.

    returns

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

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

    Permalink

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

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

    sep

    the separator string.

    returns

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

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

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

    Permalink

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

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

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

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

    Permalink
    Definition Classes
    AnyRef
  99. def newBuilder: Builder[T, ParHashSet[T]]

    Permalink

    The builder that builds instances of type Traversable[A]

    The builder that builds instances of type Traversable[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateGenericTraversableTemplateHasNewBuilder
  100. def newCombiner: Combiner[T, ParHashSet[T]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateHasNewCombiner
  101. def nnSizeMapAdd(h: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  102. def nnSizeMapRemove(h: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  103. def nnSizeMapReset(tableLength: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  104. def nonEmpty: Boolean

    Permalink

    Tests whether the parallel iterable is not empty.

    Tests whether the parallel iterable is not empty.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  105. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  106. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  107. def par: ParHashSet[T]

    Permalink

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

    Permalink

    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
  109. def partition(pred: (T) ⇒ Boolean): (ParHashSet[T], ParHashSet[T])

    Permalink

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

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

    pred

    the predicate on which to partition.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  110. def product: A

    Permalink

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this parallel hash 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 parallel hash set 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

  111. def randomSeed: Int

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  112. def reduce[U >: T](op: (U, U) ⇒ U): U

    Permalink

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

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

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

    Permalink

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

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

    Note: will not terminate for infinite-sized collections.

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

    op

    the binary operator.

    returns

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

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

    Permalink

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

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

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

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

    U

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

    op

    A binary operator that must be associative.

    returns

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

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

    Permalink

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

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

    Note: will not terminate for infinite-sized collections.

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

    op

    the binary operator.

    returns

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

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

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

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

    Permalink

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

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

    Note: will not terminate for infinite-sized collections.

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

    op

    the binary operator.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  118. def removeElem(elem: T): Boolean

    Permalink

    Removes an elem from the hash table returning true if the element was found (and thus removed) or false if it didn't exist.

    Removes an elem from the hash table returning true if the element was found (and thus removed) or false if it didn't exist.

    Attributes
    protected
    Definition Classes
    FlatHashTable
  119. def repr: ParHashSet[T]

    Permalink
    Definition Classes
    ParIterableLikeGenTraversableLike
  120. def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Permalink

    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
  121. def sameElements(that: GenIterable[A]): Boolean

    Permalink

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

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this parallel hash 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
    ParIterableLikeGenIterableLike
    Full Signature

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

  122. def scan(z: T)(op: (T, T) ⇒ T): ParHashSet[T]

    Permalink

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

  123. def scanBlockSize: Int

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

    Permalink

    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
  125. def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParHashSet[T], S, That]): That

    Permalink

    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
  126. var seedvalue: Int

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  127. def seq: HashSet[T]

    Permalink
  128. def sequentially[S, That <: Parallel](b: (HashSet[T]) ⇒ Parallelizable[S, That]): ParHashSet[T]

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

    Permalink

    The size of this parallel hash set .

    The size of this parallel hash set .

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this parallel hash set .

    Definition Classes
    ParHashSetGenTraversableLikeGenTraversableOnce
  130. final def sizeMapBucketBitSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    HashUtils
  131. final def sizeMapBucketSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    HashUtils
  132. def sizeMapDisable(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  133. def sizeMapInit(tableLength: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  134. def sizeMapInitAndRebuild(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  135. var sizemap: Array[Int]

    Permalink

    The array keeping track of number of elements in 32 element blocks.

    The array keeping track of number of elements in 32 element blocks.

    Attributes
    protected
    Definition Classes
    FlatHashTable
  136. def slice(unc_from: Int, unc_until: Int): ParHashSet[T]

    Permalink

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

    unc_until

    the lowest index to EXCLUDE from this parallel iterable.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  137. def span(pred: (T) ⇒ Boolean): (ParHashSet[T], ParHashSet[T])

    Permalink

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

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

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

    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
  138. def splitAt(n: Int): (ParHashSet[T], ParHashSet[T])

    Permalink

    Splits this parallel iterable into two at a given position.

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

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

    n

    the position at which to split.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  139. def splitter: ParHashSetIterator

    Permalink

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

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

    returns

    a parallel iterator

    Definition Classes
    ParHashSetParIterableLike
  140. def stringPrefix: String

    Permalink

    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 hash set . By default the string prefix is the simple name of the collection class parallel hash set .

    Definition Classes
    ParHashSetParSetParIterableGenTraversableLike
  141. def subsetOf(that: GenSet[T]): Boolean

    Permalink

    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
  142. def sum: A

    Permalink

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this parallel hash 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 parallel hash set 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

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

    Permalink
    Definition Classes
    AnyRef
  144. var table: Array[AnyRef]

    Permalink

    The actual hash table.

    The actual hash table.

    Attributes
    protected
    Definition Classes
    FlatHashTable
  145. var tableSize: Int

    Permalink

    The number of mappings contained in this hash table.

    The number of mappings contained in this hash table.

    Attributes
    protected
    Definition Classes
    FlatHashTable
  146. def tableSizeSeed: Int

    Permalink
    Attributes
    protected
    Definition Classes
    FlatHashTable
  147. def tail: ParHashSet[T]

    Permalink

    Selects all elements except the first.

    Selects all elements except the first.

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

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

  148. def take(n: Int): ParHashSet[T]

    Permalink

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

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  149. def takeWhile(pred: (T) ⇒ Boolean): ParHashSet[T]

    Permalink

    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 parallel iterable of elements that satisfy the predicate pred

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

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  151. def tasksupport: TaskSupport

    Permalink

    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

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

    Permalink

    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

  153. var threshold: Int

    Permalink

    The next size value at which to resize (capacity * load factor).

    The next size value at which to resize (capacity * load factor).

    Attributes
    protected
    Definition Classes
    FlatHashTable
  154. def to[Col[_]]: Col[A]

    Permalink

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

    [use case]

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  155. def toArray: Array[A]

    Permalink

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

    [use case]

    Converts this parallel hash set to an array.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    Permalink

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

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

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this parallel iterable.

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

    Permalink

    Converts this parallel iterable to an indexed sequence.

    Converts this parallel iterable to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this parallel iterable.

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

    Permalink

    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
    ParIterableParIterableLikeGenTraversableOnce
  159. def toIterator: scala.Iterator[T]

    Permalink

    Returns an Iterator over the elements in this parallel iterable.

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

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this parallel iterable.

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

    Permalink

    Converts this parallel iterable to a list.

    Converts this parallel iterable to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this parallel iterable.

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

    Permalink

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

    [use case]

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

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

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

    Permalink

    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
    ParIterableParIterableLikeGenTraversableOnce
  165. def toSet[U >: T]: immutable.ParSet[U]

    Permalink

    Converts this parallel iterable to a set.

    Converts this parallel iterable to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this parallel iterable.

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

    Permalink

    Converts this parallel iterable to a stream.

    Converts this parallel iterable to a stream.

    returns

    a stream containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  167. def toString(): String

    Permalink
    Definition Classes
    ParIterableLike → AnyRef → Any
  168. def toTraversable: GenTraversable[T]

    Permalink

    Converts this parallel iterable to an unspecified Traversable.

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

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this parallel iterable.

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

    Permalink

    Converts this parallel iterable to a Vector.

    Converts this parallel iterable to a Vector.

    Note: will not terminate for infinite-sized collections.

    returns

    a vector containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  170. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParHashSet[ParHashSet[B]]

    Permalink

    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.

  171. def union(that: GenSet[T]): ParHashSet[T]

    Permalink

    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
    ParSetLikeGenSetLike
  172. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParHashSet[A1], ParHashSet[A2])

    Permalink

    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 = Traversable(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (Traversable(1, 2, 3),
    //        Traversable(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
  173. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParHashSet[A1], ParHashSet[A2], ParHashSet[A3])

    Permalink

    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 = Traversable(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (Traversable(1, 2, 3),
    //        Traversable(one, two, three),
    //        Traversable(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
  174. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  177. def withFilter(pred: (T) ⇒ Boolean): ParHashSet[T]

    Permalink
    Definition Classes
    ParIterableLike
  178. def wrap[R](body: ⇒ R): NonDivisible[R]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  179. def zip[B](that: GenIterable[B]): ParHashSet[(A, B)]

    Permalink

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

    [use case]

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

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

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

  180. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): ParHashSet[(A, B)]

    Permalink

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

    [use case]

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

    thatElem

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

    returns

    a new parallel hash set containing pairs consisting of corresponding elements of this parallel hash set and that. The length of the returned collection is the maximum of the lengths of this parallel hash set and that. If this parallel hash set is shorter than that, thisElem values are used to pad the result. If that is shorter than this parallel hash set , 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[ParHashSet[T], (U, S), That]): That

  181. def zipWithIndex: ParHashSet[(A, Int)]

    Permalink

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

    [use case]

    Zips this parallel hash set with its indices.

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

    returns

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

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

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

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

  182. def |(that: GenSet[T]): ParHashSet[T]

    Permalink

    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

Deprecated Value Members

  1. def view: IterableView[T, HashSet[T]]

    Permalink
    Definition Classes
    ParIterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Use .seq.view instead

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from ParFlatHashTable[T]

Inherited from FlatHashTable[T]

Inherited from HashUtils[T]

Inherited from ParSet[T]

Inherited from ParSetLike[T, ParHashSet[T], HashSet[T]]

Inherited from mutable.Cloneable[ParHashSet[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, ParHashSet[T], HashSet[T]]

Inherited from ParIterable[T]

Inherited from Mutable

Inherited from parallel.ParIterable[T]

Inherited from ParIterableLike[T, ParHashSet[T], HashSet[T]]

Inherited from Parallel

Inherited from CustomParallelizable[T, ParHashSet[T]]

Inherited from GenericParTemplate[T, ParHashSet]

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

Inherited from GenSet[T]

Inherited from GenericSetTemplate[T, GenSet]

Inherited from GenIterable[T]

Inherited from GenTraversable[T]

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

Inherited from GenSetLike[T, ParHashSet[T]]

Inherited from Equals

Inherited from (T) ⇒ Boolean

Inherited from GenIterableLike[T, ParHashSet[T]]

Inherited from GenTraversableLike[T, ParHashSet[T]]

Inherited from Parallelizable[T, ParHashSet[T]]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped