c

scala.collection.parallel.CollectionConverters

ImmutableHashSetIsParallelizable

implicit final class ImmutableHashSetIsParallelizable[T] extends AnyVal with CustomParallelizable[T, ParHashSet[T]]

Linear Supertypes
CustomParallelizable[T, ParHashSet[T]], Parallelizable[T, ParHashSet[T]], AnyVal, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ImmutableHashSetIsParallelizable
  2. CustomParallelizable
  3. Parallelizable
  4. AnyVal
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ImmutableHashSetIsParallelizable(coll: HashSet[T])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##(): Int
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def getClass(): Class[_ <: AnyVal]
    Definition Classes
    AnyVal → Any
  6. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  7. 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
    ImmutableHashSetIsParallelizable → CustomParallelizable → Parallelizable
  8. 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
  9. def seq: HashSet[T]
    Definition Classes
    ImmutableHashSetIsParallelizable → Parallelizable
  10. def toString(): String
    Definition Classes
    Any

Inherited from CustomParallelizable[T, ParHashSet[T]]

Inherited from Parallelizable[T, ParHashSet[T]]

Inherited from AnyVal

Inherited from Any

Ungrouped