Value Members

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

   Test two objects for inequality.

   Test two objects for inequality.

   returns

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

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

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

   returns

   a hash value consistent with ==

   Definition Classes

   AnyRef → Any

3.  def &(that: GenSet[T]): ParHashSet[T]

   Computes the intersection between this set and another set.

   Computes the intersection between this set and another set.

   Note: Same as intersect.

   that

   the set to intersect with.

   returns

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

   Definition Classes

   GenSetLike

4.  def &~(that: GenSet[T]): ParHashSet[T]

   The difference of this set and another set.

   The difference of this set and another set.

   Note: Same as diff.

   that

   the set of elements to exclude.

   returns

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

   Definition Classes

   GenSetLike

5.  def +(elem: T): ParHashSet[T]

   Definition Classes

   ParSetLike → GenSetLike

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

   Returns a new parallel iterable containing the elements from the left hand operand followed by the elements from the right hand operand.

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

   That

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

   that

   the traversable to append.

   bf

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

   returns

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

   Definition Classes

   ParIterableLike → GenTraversableLike

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

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

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

   xs

   the TraversableOnce producing the elements to add.

   returns

   the growable collection itself.

   Definition Classes

   Growable

8.  def +=(elem: T): ParHashSet.this.type

   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

   ParHashSet → ParSetLike → Growable

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

   adds two or more elements to this growable collection.

   adds two or more elements to this growable collection.

   elem1

   the first element to add.

   elem2

   the second element to add.

   elems

   the remaining elements to add.

   returns

   the growable collection itself

   Definition Classes

   Growable

10.  def -(elem: T): ParHashSet[T]

    Definition Classes

    ParSetLike → GenSetLike

11.  def --=(xs: TraversableOnce[T]): ParHashSet.this.type

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

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

    xs

    the iterator producing the elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes

    Shrinkable

12.  def -=(elem: T): ParHashSet.this.type

    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

    ParHashSet → ParSetLike → Shrinkable

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

    Removes two or more elements from this shrinkable collection.

    Removes two or more elements from this shrinkable collection.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes

    Shrinkable

14.  def ->[B](y: B): (ParHashSet[T], B)

    Implicit

    This member is added by an implicit conversion from ParHashSet[T] to ArrowAssoc[ParHashSet[T]] performed by method ArrowAssoc in scala.Predef.

    Definition Classes

    ArrowAssoc

    Annotations

    @inline()

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

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

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

    Definition Classes

    AnyRef → Any

16.  def addElem(elem: T): Boolean

    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

17.  def addEntry(newEntry: AnyRef): Boolean

    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

18.  def aggregate[S](z: ⇒ S)(seqop: (S, T) ⇒ S, combop: (S, S) ⇒ S): S

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    S

    the type of accumulated results

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes

    ParIterableLike → GenTraversableOnce

19.  def alwaysInitSizeMap: Boolean

    Definition Classes

    ParFlatHashTable → FlatHashTable

20.  def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A

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

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

    A

    the result type of function g

    g

    a function R => A

    returns

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

    Definition Classes

    Function1

    Annotations

    @unspecialized()

21.  def apply(elem: T): Boolean

    Tests if some element is contained in this set.

    Tests if some element is contained in this set.

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

    elem

    the element to test for membership.

    returns

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

    Definition Classes

    GenSetLike → Function1

22.  final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Definition Classes

    Any

    Exceptions thrown

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

23.  def bf2seq[S, That](bf: CanBuildFrom[ParHashSet[T], S, That]): CanBuildFrom[HashSet[T], S, That]

    Attributes

    protected[this]

    Definition Classes

    ParIterableLike

24.  implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]

    Attributes

    protected

    Definition Classes

    ParIterableLike

25.  def calcSizeMapSize(tableLength: Int): Int

    Attributes

    protected

    Definition Classes

    FlatHashTable

    Annotations

    @deprecatedOverriding( message = ... , since = "2.11.0" )

26.  def canEqual(other: Any): Boolean

    Definition Classes

    ParIterableLike

27.  def capacity(expectedSize: Int): Int

    Attributes

    protected

    Definition Classes

    FlatHashTable

28.  def clear(): Unit

    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

    ParHashSet → Growable → Clearable

29.  def clearTable(): Unit

    Attributes

    protected

    Definition Classes

    FlatHashTable

30.  def clone(): ParHashSet[T]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes

    Cloneable → AnyRef

    Note

    not specified by SLS as a member of AnyRef

31.  def collect[B](pf: PartialFunction[A, B]): ParHashSet[B]

    [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

    ParIterableLike → GenTraversableLike

     Full Signature

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

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

    Attributes

    protected[this]

    Definition Classes

    ParIterableLike

33.  def combinerFactory: CombinerFactory[T, ParHashSet[T]]

    Creates a combiner factory.

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

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

    Attributes

    protected[this]

    Definition Classes

    ParIterableLike

34.  def companion: ParHashSet.type

    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

    ParHashSet → ParSet → ParSet → ParIterable → ParIterable → GenericParTemplate → GenSet → GenIterable → GenTraversable → GenericTraversableTemplate

35.  def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean

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

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

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

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

    Definition Classes

    Function1

    Annotations

    @unspecialized()

36.  def contains(elem: T): Boolean

    Definition Classes

    ParHashSet → GenSetLike

37.  def containsElem(elem: T): Boolean

    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( message = ... , since = "2.11.0" )

38.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    [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

    ParIterableLike → GenTraversableOnce

     Full Signature

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

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

    [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

    ParIterableLike → GenTraversableOnce

     Full Signature

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

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

    [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

    ParIterableLike → GenTraversableOnce

     Full Signature

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

41.  def count(p: (T) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes

    ParIterableLike → GenTraversableOnce

42.  def debugBuffer: ArrayBuffer[String]

    Definition Classes

    ParIterableLike

43.  def debugInformation: String

    Definition Classes

    ParHashSet → ParIterableLike

44.  implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

    Attributes

    protected

    Definition Classes

    ParIterableLike

45.  def diff(that: GenSet[T]): ParHashSet[T]

    Computes the difference of this set and another set.

    Computes the difference of this set and another set.

    that

    the set of elements to exclude.

    returns

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

    Definition Classes

    ParSetLike → GenSetLike

46.  def drop(n: Int): ParHashSet[T]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

    the number of elements to drop from this 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. If n is negative, don't drop any elements.

    Definition Classes

    ParIterableLike → GenTraversableLike

47.  def dropWhile(pred: (T) ⇒ Boolean): ParHashSet[T]

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

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

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

    pred

    the predicate used to test the elements

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableLike

48.  final def elemToEntry(elem: T): AnyRef

    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

49.  def empty: ParHashSet[T]

    Definition Classes

    ParHashSet → ParSet → ParSetLike → ParSet → ParSetLike → GenericSetTemplate

50.  def ensuring(cond: (ParHashSet[T]) ⇒ Boolean, msg: ⇒ Any): ParHashSet[T]

    Implicit

    This member is added by an implicit conversion from ParHashSet[T] to Ensuring[ParHashSet[T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

51.  def ensuring(cond: (ParHashSet[T]) ⇒ Boolean): ParHashSet[T]

    Implicit

    This member is added by an implicit conversion from ParHashSet[T] to Ensuring[ParHashSet[T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

52.  def ensuring(cond: Boolean, msg: ⇒ Any): ParHashSet[T]

    Implicit

    This member is added by an implicit conversion from ParHashSet[T] to Ensuring[ParHashSet[T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

53.  def ensuring(cond: Boolean): ParHashSet[T]

    Implicit

    This member is added by an implicit conversion from ParHashSet[T] to Ensuring[ParHashSet[T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

54.  final def entryToElem(entry: AnyRef): T

    Does the inverse translation of elemToEntry

    Does the inverse translation of elemToEntry

    Attributes

    protected

    Definition Classes

    HashUtils

55.  final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Definition Classes

    AnyRef

56.  def equals(that: Any): Boolean

    Compares this set with another object for equality.

    Compares this set with another object for equality.

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

    that

    the other object

    returns

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

    Definition Classes

    GenSetLike → Equals → AnyRef → Any

57.  def exists(p: (T) ⇒ Boolean): Boolean

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

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

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

    p

    a predicate used to test elements

    returns

    true if p holds for some element, false otherwise

    Definition Classes

    ParIterableLike → GenTraversableOnce

58.  def filter(pred: (T) ⇒ Boolean): ParHashSet[T]

    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

    ParIterableLike → GenTraversableLike

59.  def filterNot(pred: (T) ⇒ Boolean): ParHashSet[T]

    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

    ParIterableLike → GenTraversableLike

60.  def finalize(): Unit

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

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

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

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

    Note

    not specified by SLS as a member of AnyRef

61.  def find(p: (T) ⇒ Boolean): Option[T]

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

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

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

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

    p

    predicate used to test the elements

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

62.  def findEntry(elem: T): Option[T]

    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( message = ... , since = "2.11.0" )

63.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ParHashSet[B]

    [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

    ParIterableLike → GenTraversableLike

     Full Signature

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

64.  def flatten[B]: ParHashSet[B]

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

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

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

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

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

    U

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

66.  def foldLeft[S](z: S)(op: (S, T) ⇒ S): S

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

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

    Note: will not terminate for infinite-sized collections.

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

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

67.  def foldRight[S](z: S)(op: (T, S) ⇒ S): S

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

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

    Note: will not terminate for infinite-sized collections.

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

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

68.  def forall(p: (T) ⇒ Boolean): Boolean

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

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

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

    p

    a predicate used to test elements

    returns

    true if p holds for all elements, false otherwise

    Definition Classes

    ParIterableLike → GenTraversableOnce

69.  def foreach[U](f: (T) ⇒ U): Unit

    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

    ParIterableLike → GenTraversableLike → GenTraversableOnce

70.  def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

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

    Implicit

    This member is added by an implicit conversion from ParHashSet[T] to StringFormat[ParHashSet[T]] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

71.  def genericBuilder[B]: Combiner[B, ParHashSet[B]]

    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

    GenericParTemplate → GenericTraversableTemplate

72.  def genericCombiner[B]: Combiner[B, ParHashSet[B]]

    Definition Classes

    GenericParTemplate

73.  final def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

74.  def groupBy[K](f: (T) ⇒ K): immutable.ParMap[K, ParHashSet[T]]

    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

    ParIterableLike → GenTraversableLike

75.  def hasDefiniteSize: Boolean

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

    Tests whether this parallel iterable is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. 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

    ParIterableLike → GenTraversableOnce

76.  def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

    the hash code value for this object.

    Definition Classes

    GenSetLike → AnyRef → Any

77.  def head: T

    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

    ParIterableLike → GenTraversableLike

    Exceptions thrown

    NoSuchElementException if the parallel iterable is empty.

78.  def headOption: Option[T]

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableLike

79.  final def improve(hcode: Int, seed: Int): Int

    Attributes

    protected

    Definition Classes

    HashUtils

80.  final def index(hcode: Int): Int

    Attributes

    protected

    Definition Classes

    FlatHashTable

81.  def init: ParHashSet[T]

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableLike

    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

82.  def initTaskSupport(): Unit

    Attributes

    protected

    Definition Classes

    ParIterableLike

83.  def initWithContents(c: Contents[T]): Unit

    Attributes

    protected

    Definition Classes

    FlatHashTable

84.  def initialSize: Int

    The initial size of the hash table.

    The initial size of the hash table.

    Definition Classes

    FlatHashTable

85.  def intersect(that: GenSet[T]): ParHashSet[T]

    Computes the intersection between this set and another set.

    Computes the intersection between this set and another set.

    that

    the set to intersect with.

    returns

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

    Definition Classes

    GenSetLike

86.  def isEmpty: Boolean

    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

    ParIterableLike → GenTraversableOnce

87.  final def isInstanceOf[T0]: Boolean

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

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

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

    returns

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

    Definition Classes

    Any

88.  def isSizeMapDefined: Boolean

    Attributes

    protected

    Definition Classes

    FlatHashTable

89.  def isStrictSplitterCollection: Boolean

    Denotes whether this parallel collection has strict splitters.

    Denotes whether this parallel collection has strict splitters.

    This is true in general, and specific collection instances may choose to override this method. Such collections will fail to execute methods which rely on splitters being strict, i.e. returning a correct value in the remaining method.

    This method helps ensure that such failures occur on method invocations, rather than later on and in unpredictable ways.

    Definition Classes

    ParIterableLike

90.  final def isTraversableAgain: Boolean

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    Definition Classes

    ParIterableLike → GenTraversableLike → GenTraversableOnce

91.  def iterator: ParHashSetIterator

    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

    ParHashSet → FlatHashTable → ParIterableLike → GenSetLike → GenIterableLike

92.  def last: T

    Selects the last element.

    Selects the last element.

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

    returns

    The last element of this parallel iterable.

    Definition Classes

    ParIterableLike → GenTraversableLike

    Exceptions thrown

    NoSuchElementException If the parallel iterable is empty.

93.  def lastOption: Option[T]

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableLike

94.  def map[B](f: (A) ⇒ B): ParHashSet[B]

    [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

    ParIterableLike → GenTraversableLike

     Full Signature

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

95.  def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this parallel hash set .

    Definition Classes

    ParIterableLike → GenTraversableOnce

     Full Signature

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

    Exceptions thrown

    UnsupportedOperationException if this parallel hash set is empty.

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

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

    [use case]

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

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

     Full Signature

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

    Exceptions thrown

    UnsupportedOperationException if this parallel hash set is empty.

97.  def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this parallel hash set

    Definition Classes

    ParIterableLike → GenTraversableOnce

     Full Signature

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

    Exceptions thrown

    UnsupportedOperationException if this parallel hash set is empty.

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

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

    [use case]

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

    B

    The result type of the function f.

    f

    The measuring function.

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

     Full Signature

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

    Exceptions thrown

    UnsupportedOperationException if this parallel hash set is empty.

99.  def mkString: String

    Displays all elements of this parallel iterable in a string.

    Displays all elements of this parallel iterable in a string.

    returns

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

    Definition Classes

    ParIterableLike → GenTraversableOnce

100.  def mkString(sep: String): String

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

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

     sep

     the separator string.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

     Example:

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

101.  def mkString(start: String, sep: String, end: String): String

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

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

     start

     the starting string.

     sep

     the separator string.

     end

     the ending string.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

     Example:

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

102.  final def ne(arg0: AnyRef): Boolean

     Equivalent to !(this eq that).

     Equivalent to !(this eq that).

     returns

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

     Definition Classes

     AnyRef

103.  def newBuilder: Builder[T, ParHashSet[T]]

     The builder that builds instances of type Traversable[A]

     The builder that builds instances of type Traversable[A]

     Attributes

     protected[this]

     Definition Classes

     GenericParTemplate → GenericTraversableTemplate → HasNewBuilder

104.  def newCombiner: Combiner[T, ParHashSet[T]]

     Attributes

     protected[this]

     Definition Classes

     GenericParTemplate → HasNewCombiner

105.  def nnSizeMapAdd(h: Int): Unit

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @deprecatedOverriding( message = ... , since = "2.11.0" )

106.  def nnSizeMapRemove(h: Int): Unit

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @deprecatedOverriding( message = ... , since = "2.11.0" )

107.  def nnSizeMapReset(tableLength: Int): Unit

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @deprecatedOverriding( message = ... , since = "2.11.0" )

108.  def nonEmpty: Boolean

     Tests whether the parallel iterable is not empty.

     Tests whether the parallel iterable is not empty.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

109.  final def notify(): Unit

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Definition Classes

     AnyRef

     Annotations

     @native()

     Note

     not specified by SLS as a member of AnyRef

110.  final def notifyAll(): Unit

     Wakes up all threads that are waiting on the receiver object's monitor.

     Wakes up all threads that are waiting on the receiver object's monitor.

     Definition Classes

     AnyRef

     Annotations

     @native()

     Note

     not specified by SLS as a member of AnyRef

111.  def par: ParHashSet[T]

     Returns a parallel implementation of this collection.

     Returns a parallel implementation of this collection.

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

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

     All parallel collections return a reference to themselves.

     returns

     a parallel implementation of this collection

     Definition Classes

     ParIterableLike → CustomParallelizable → Parallelizable

112.  def parCombiner: Combiner[T, ParHashSet[T]]

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

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

     returns

     a combiner for the parallel collection of type ParRepr

     Attributes

     protected[this]

     Definition Classes

     CustomParallelizable → Parallelizable

113.  def partition(pred: (T) ⇒ Boolean): (ParHashSet[T], ParHashSet[T])

     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

     ParIterableLike → GenTraversableLike

114.  def product: A

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

     [use case]

     Multiplies up the elements of this collection.

     returns

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

     ParIterableLike → GenTraversableOnce

      Full Signature

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

115.  def randomSeed: Int

     Attributes

     protected

     Definition Classes

     FlatHashTable

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

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

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

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

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

     U

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

     op

     A binary operator that must be associative.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

     Exceptions thrown

     UnsupportedOperationException if this parallel iterable is empty.

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

     Definition Classes

     ParIterableLike

118.  def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]

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

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

     Note: will not terminate for infinite-sized collections.

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

     op

     the binary operator.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

119.  def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]

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

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

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

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

     U

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

     op

     A binary operator that must be associative.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

120.  def reduceRight[U >: T](op: (T, U) ⇒ U): U

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

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

     Note: will not terminate for infinite-sized collections.

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

     op

     the binary operator.

     returns

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

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

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

     Exceptions thrown

     UnsupportedOperationException if this parallel iterable is empty.

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

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

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

     Note: will not terminate for infinite-sized collections.

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

     op

     the binary operator.

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableOnce

122.  def removeElem(elem: T): Boolean

     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

123.  def repr: ParHashSet[T]

     Definition Classes

     ParIterableLike → GenTraversableLike

124.  def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

     Optionally reuses an existing combiner for better performance.

     Optionally reuses an existing combiner for better performance. By default it doesn't - subclasses may override this behaviour. The provided combiner oldc that can potentially be reused will be either some combiner from the previous computational task, or None if there was no previous phase (in which case this method must return newc).

     oldc

     The combiner that is the result of the previous task, or None if there was no previous task.

     newc

     The new, empty combiner that can be used.

     returns

     Either newc or oldc.

     Attributes

     protected

     Definition Classes

     ParIterableLike

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

     [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

     ParIterableLike → GenIterableLike

      Full Signature

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

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

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

     [use case]

     Computes a prefix scan of the elements of the collection.

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

     z

     neutral element for the operator op

     op

     the associative operator for the scan

     returns

     a new parallel hash set containing the prefix scan of the elements in this parallel hash set

     Definition Classes

     ParIterableLike → GenTraversableLike

      Full Signature

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

127.  def scanBlockSize: Int

     Attributes

     protected[this]

     Definition Classes

     ParIterableLike

128.  def scanLeft[S, That](z: S)(op: (S, T) ⇒ S)(implicit bf: CanBuildFrom[ParHashSet[T], S, That]): That

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

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

     Note: will not terminate for infinite-sized collections.

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

     That

     the actual type of the resulting collection

     z

     the initial value

     op

     the binary operator applied to the intermediate result and the element

     bf

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

     returns

     collection with intermediate results

     Definition Classes

     ParIterableLike → GenTraversableLike

129.  def scanRight[S, That](z: S)(op: (T, S) ⇒ S)(implicit bf: CanBuildFrom[ParHashSet[T], S, That]): That

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

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

     Note: will not terminate for infinite-sized collections.

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

     Example:

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

     That

     the actual type of the resulting collection

     z

     the initial value

     op

     the binary operator applied to the intermediate result and the element

     bf

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

     returns

     collection with intermediate results

     Definition Classes

     ParIterableLike → GenTraversableLike

130.  val seedvalue: Int

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @transient()

131.  def seq: HashSet[T]

     Definition Classes

     ParHashSet → ParSet → ParIterable → ParIterableLike → GenSet → GenIterable → GenTraversable → GenSetLike → Parallelizable → GenTraversableOnce

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

     Attributes

     protected[this]

     Definition Classes

     ParIterableLike

133.  def size: Int

     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

     ParHashSet → GenTraversableLike → GenTraversableOnce

134.  def sizeHintIfCheap: Int

     The size of this collection or iterator, if it can be cheaply computed

     The size of this collection or iterator, if it can be cheaply computed

     returns

     the number of elements in this collection or iterator, or -1 if the size cannot be determined cheaply

     Attributes

     protected[collection]

     Definition Classes

     GenTraversableOnce

135.  final def sizeMapBucketBitSize: Int

     Attributes

     protected

     Definition Classes

     HashUtils

136.  final def sizeMapBucketSize: Int

     Attributes

     protected

     Definition Classes

     HashUtils

137.  def sizeMapDisable(): Unit

     Attributes

     protected

     Definition Classes

     FlatHashTable

138.  def sizeMapInit(tableLength: Int): Unit

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @deprecatedOverriding( message = ... , since = "2.11.0" )

139.  def sizeMapInitAndRebuild(): Unit

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @deprecatedOverriding( message = ... , since = "2.11.0" )

140.  val sizemap: Array[Int]

     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

     Annotations

     @transient()

141.  def slice(unc_from: Int, unc_until: Int): ParHashSet[T]

     Selects an interval of elements.

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

     from <= indexOf(x) < until

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

     unc_from

     the lowest index to include from this 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

     ParIterableLike → GenTraversableLike

142.  def span(pred: (T) ⇒ Boolean): (ParHashSet[T], ParHashSet[T])

     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

     ParIterableLike → GenTraversableLike

143.  def splitAt(n: Int): (ParHashSet[T], ParHashSet[T])

     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

     ParIterableLike → GenTraversableLike

144.  def splitter: ParHashSetIterator

     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

     ParHashSet → ParIterableLike

145.  def stringPrefix: String

     Defines the prefix of this object's toString representation.

     Defines the prefix of this object's toString representation.

     returns

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

     Definition Classes

     ParHashSet → ParSet → ParIterable → GenTraversableLike

146.  def subsetOf(that: GenSet[T]): Boolean

     Tests whether this set is a subset of another set.

     Tests whether this set is a subset of another set.

     that

     the set to test.

     returns

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

     Definition Classes

     GenSetLike

147.  def sum: A

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

     [use case]

     Sums up the elements of this collection.

     returns

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

     ParIterableLike → GenTraversableOnce

      Full Signature

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

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

     Definition Classes

     AnyRef

149.  val table: Array[AnyRef]

     The actual hash table.

     The actual hash table.

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @transient()

150.  val tableSize: Int

     The number of mappings contained in this hash table.

     The number of mappings contained in this hash table.

     Attributes

     protected

     Definition Classes

     FlatHashTable

     Annotations

     @transient()

151.  def tableSizeSeed: Int

     Attributes

     protected

     Definition Classes

     FlatHashTable

152.  def tail: ParHashSet[T]

     Selects all elements except the first.

     Selects all elements except the first.

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

     returns

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

     Definition Classes

     ParIterableLike → GenTraversableLike

     Exceptions thrown

     UnsupportedOperationException if the parallel iterable is empty.

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

     Selects first n elements.

     Selects first n elements.

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

     n

     the number of elements to take from this 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. If n is negative, returns an empty parallel iterable.

     Definition Classes

     ParIterableLike → GenTraversableLike

154.  def takeWhile(pred: (T) ⇒ Boolean): ParHashSet[T]

     Takes the longest prefix of elements that satisfy the predicate.

     Takes the longest prefix of elements that satisfy the predicate.

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

     pred

     the predicate used to test the elements

     returns

     the longest prefix of this parallel iterable of elements that satisfy the predicate pred

     Definition Classes

     ParIterableLike → GenTraversableLike

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

     Attributes

     protected

     Definition Classes

     ParIterableLike

156.  def tasksupport: TaskSupport

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

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

     Definition Classes

     ParIterableLike

     See also

     scala.collection.parallel.TaskSupport

157.  def tasksupport_=(ts: TaskSupport): Unit

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

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

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

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

     import scala.collection.parallel._
     val pc = mutable.ParArray(1, 2, 3)
     pc.tasksupport = new ForkJoinTaskSupport(
       new java.util.concurrent.ForkJoinPool(2))

     Definition Classes

     ParIterableLike

     See also

     scala.collection.parallel.TaskSupport

158.  val threshold: Int

     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

     Annotations

     @transient()

159.  def to[Col[_]]: Col[A]

     [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

     ParIterableLike → GenTraversableOnce

      Full Signature

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

160.  def toArray: Array[A]

     [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

     ParIterableLike → GenTraversableOnce

      Full Signature

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

161.  def toBuffer[U >: T]: Buffer[U]

     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

     ParIterableLike → GenTraversableOnce

162.  def toIndexedSeq: immutable.IndexedSeq[T]

     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

     ParIterableLike → GenTraversableOnce

163.  def toIterable: ParIterable[T]

     Converts this parallel iterable to an iterable collection.

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

     Note: will not terminate for infinite-sized collections.

     returns

     an Iterable containing all elements of this parallel iterable.

     Definition Classes

     ParIterable → ParIterableLike → GenTraversableOnce

164.  def toIterator: scala.Iterator[T]

     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

     ParIterableLike → GenTraversableOnce

165.  def toList: List[T]

     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

     ParIterableLike → GenTraversableOnce

166.  def toMap[T, U]: collection.Map[T, U]

     [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

     ParIterableLike → GenTraversableOnce

      Full Signature

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

167.  def toParArray: ParArray[T]

     Implicit

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

     Definition Classes

     CollectionsHaveToParArray

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

     Attributes

     protected

     Definition Classes

     ParIterableLike

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

     Attributes

     protected

     Definition Classes

     ParIterableLike

170.  def toSeq: ParSeq[T]

     Converts this parallel iterable to a sequence.

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

     Note: will not terminate for infinite-sized collections.

     returns

     a sequence containing all elements of this parallel iterable.

     Definition Classes

     ParIterable → ParIterableLike → GenTraversableOnce

171.  def toSet[U >: T]: immutable.ParSet[U]

     Converts this parallel iterable to a set.

     Converts this parallel iterable to a set.

     Note: will not terminate for infinite-sized collections.

     returns

     a set containing all elements of this parallel iterable.

     Definition Classes

     ParIterableLike → GenTraversableOnce

172.  def toStream: Stream[T]

     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

     ParIterableLike → GenTraversableOnce

173.  def toString(): String

     Creates a String representation of this object.

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

     returns

     a String representation of the object.

     Definition Classes

     ParIterableLike → AnyRef → Any

174.  def toTraversable: GenTraversable[T]

     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

     ParIterableLike → GenTraversableOnce

175.  def toVector: Vector[T]

     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

     ParIterableLike → GenTraversableOnce

176.  def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ParHashSet[ParHashSet[B]]

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

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

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

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

     B

     the type of the elements of each traversable collection.

     asTraversable

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

     returns

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

     Definition Classes

     GenericTraversableTemplate

     Annotations

     @migration

     Migration

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

     Exceptions thrown

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

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

     Computes the union between of set and another set.

     Computes the union between of set and another set.

     that

     the set to form the union with.

     returns

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

     Definition Classes

     ParSetLike → GenSetLike

178.  def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (ParHashSet[A1], ParHashSet[A2])

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

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

     val xs = 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

179.  def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (ParHashSet[A1], ParHashSet[A2], ParHashSet[A3])

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

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

     val xs = 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

180.  final def wait(): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

181.  final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

182.  final def wait(arg0: Long): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... ) @native()

183.  def withFilter(pred: (T) ⇒ Boolean): ParHashSet[T]

     Definition Classes

     ParIterableLike

184.  def wrap[R](body: ⇒ R): NonDivisible[R]

     Attributes

     protected

     Definition Classes

     ParIterableLike

185.  def zip[B](that: GenIterable[B]): ParHashSet[(A, B)]

     [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

     ParIterableLike → GenIterableLike

      Full Signature

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

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

     [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

     ParIterableLike → GenIterableLike

      Full Signature

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

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

     [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

     ParIterableLike → GenIterableLike

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

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

     Computes the union between this set and another set.

     Computes the union between this set and another set.

     Note: Same as union.

     that

     the set to form the union with.

     returns

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

     Definition Classes

     GenSetLike

189.  def →[B](y: B): (ParHashSet[T], B)

     Implicit

     This member is added by an implicit conversion from ParHashSet[T] to ArrowAssoc[ParHashSet[T]] performed by method ArrowAssoc in scala.Predef.

     Definition Classes

     ArrowAssoc