Packages

class ParHashMap[K, +V] extends ParMap[K, V] with GenericParMapTemplate[K, V, ParHashMap] with ParMapLike[K, V, ParHashMap[K, V], HashMap[K, V]] with Serializable

Immutable parallel hash map, based on hash tries.

This is a base trait for Scala parallel collections. It defines behaviour common to all parallel collections. Concrete parallel collections should inherit this trait and ParIterable if they want to define specific combiner factories.

Parallel operations are implemented with divide and conquer style algorithms that parallelize well. The basic idea is to split the collection into smaller parts until they are small enough to be operated on sequentially.

All of the parallel operations are implemented as tasks within this trait. Tasks rely on the concept of splitters, which extend iterators. Every parallel collection defines:

def splitter: IterableSplitter[T]

which returns an instance of IterableSplitter[T], which is a subtype of Splitter[T]. Splitters have a method remaining to check the remaining number of elements, and method split which is defined by splitters. Method split divides the splitters iterate over into disjunct subsets:

def split: Seq[Splitter]

which splits the splitter into a sequence of disjunct subsplitters. This is typically a very fast operation which simply creates wrappers around the receiver collection. This can be repeated recursively.

Tasks are scheduled for execution through a scala.collection.parallel.TaskSupport object, which can be changed through the tasksupport setter of the collection.

Method newCombiner produces a new combiner. Combiners are an extension of builders. They provide a method combine which combines two combiners and returns a combiner containing elements of both combiners. This method can be implemented by aggressively copying all the elements into the new combiner or by lazily binding their results. It is recommended to avoid copying all of the elements for performance reasons, although that cost might be negligible depending on the use case. Standard parallel collection combiners avoid copying when merging results, relying either on a two-step lazy construction or specific data-structure properties.

Methods:

def seq: Sequential
def par: Repr

produce the sequential or parallel implementation of the collection, respectively. Method par just returns a reference to this parallel collection. Method seq is efficient - it will not copy the elements. Instead, it will create a sequential version of the collection using the same underlying data structure. Note that this is not the case for sequential collections in general - they may copy the elements and produce a different underlying data structure.

The combination of methods toMap, toSeq or toSet along with par and seq is a flexible way to change between different collection types.

Since this trait extends the GenIterable trait, methods like size must also be implemented in concrete collections, while iterator forwards to splitter by default.

Each parallel collection is bound to a specific fork/join pool, on which dormant worker threads are kept. The fork/join pool contains other information such as the parallelism level, that is, the number of processors used. When a collection is created, it is assigned the default fork/join pool found in the scala.parallel package object.

Parallel collections are not necessarily ordered in terms of the foreach operation (see Traversable). Parallel sequences have a well defined order for iterators - creating an iterator and traversing the elements linearly will always yield the same order. However, bulk operations such as foreach, map or filter always occur in undefined orders for all parallel collections.

Existing parallel collection implementations provide strict parallel iterators. Strict parallel iterators are aware of the number of elements they have yet to traverse. It's also possible to provide non-strict parallel iterators, which do not know the number of elements remaining. To do this, the new collection implementation must override isStrictSplitterCollection to false. This will make some operations unavailable.

To create a new parallel collection, extend the ParIterable trait, and implement size, splitter, newCombiner and seq. Having an implicit combiner factory requires extending this trait in addition, as well as providing a companion object, as with regular collections.

Method size is implemented as a constant time operation for parallel collections, and parallel collection operations rely on this assumption.

The higher-order functions passed to certain operations may contain side-effects. Since implementations of bulk operations may not be sequential, this means that side-effects may not be predictable and may produce data-races, deadlocks or invalidation of state if care is not taken. It is up to the programmer to either avoid using side-effects or to use some form of synchronization when accessing mutable data.

K

the key type of the map

V

the value type of the map

Self Type
ParHashMap[K, V]
Annotations
@SerialVersionUID()
Since

2.9

See also

Scala's Parallel Collections Library overview section on Parallel Hash Tries for more information.

Linear Supertypes
Serializable, java.io.Serializable, ParMap[K, V], ParIterable[(K, V)], Immutable, parallel.ParMap[K, V], ParMapLike[K, V, ParHashMap[K, V], HashMap[K, V]], parallel.ParIterable[(K, V)], ParIterableLike[(K, V), ParHashMap[K, V], HashMap[K, V]], Parallel, CustomParallelizable[(K, V), ParHashMap[K, V]], Parallelizable[(K, V), ParHashMap[K, V]], GenericParMapTemplate[K, V, ParHashMap], GenericParTemplate[(K, V), ParIterable], HasNewCombiner[(K, V), ParHashMap[K, V]], GenMap[K, V], GenIterable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), ParIterable], HasNewBuilder[(K, V), scala.collection.parallel.immutable.ParIterable[(K, V)] @scala.annotation.unchecked.uncheckedVariance], GenMapLike[K, V, ParHashMap[K, V]], Equals, GenIterableLike[(K, V), ParHashMap[K, V]], GenTraversableLike[(K, V), ParHashMap[K, V]], GenTraversableOnce[(K, V)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParHashMap
  2. Serializable
  3. Serializable
  4. ParMap
  5. ParIterable
  6. Immutable
  7. ParMap
  8. ParMapLike
  9. ParIterable
  10. ParIterableLike
  11. Parallel
  12. CustomParallelizable
  13. Parallelizable
  14. GenericParMapTemplate
  15. GenericParTemplate
  16. HasNewCombiner
  17. GenMap
  18. GenIterable
  19. GenTraversable
  20. GenericTraversableTemplate
  21. HasNewBuilder
  22. GenMapLike
  23. Equals
  24. GenIterableLike
  25. GenTraversableLike
  26. GenTraversableOnce
  27. AnyRef
  28. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParHashMap()

Type Members

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

    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]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  3. trait BuilderOps [Elem, To] extends AnyRef
    Definition Classes
    ParIterableLike
  4. class Collect [S, That] extends Transformer[Combiner[S, That], Collect[S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  5. abstract class Composite [FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends NonDivisibleTask[R, Composite[FR, SR, R, First, Second]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  6. class Copy [U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  7. class CopyToArray [U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  8. class Count extends Accessor[Int, Count]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  9. class CreateScanTree [U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  10. class Drop [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  11. class Exists extends Accessor[Boolean, Exists]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  12. class Filter [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  13. class FilterNot [U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  14. class Find [U >: T] extends Accessor[Option[U], Find[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  15. class FlatMap [S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  16. class Fold [U >: T] extends Accessor[U, Fold[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. class Forall extends Accessor[Boolean, Forall]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  18. class Foreach [S] extends Accessor[Unit, Foreach[S]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  19. class FromScanTree [U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  20. class GroupBy [K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  21. class Map [S, That] extends Transformer[Combiner[S, That], Map[S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. class Max [U >: T] extends Accessor[Option[U], Max[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  23. class Min [U >: T] extends Accessor[Option[U], Min[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  24. trait NonDivisible [R] extends NonDivisibleTask[R, NonDivisible[R]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  25. trait NonDivisibleTask [R, Tp] extends StrictSplitterCheckTask[R, Tp]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  26. abstract class ParComposite [FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  27. class Partition [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  28. class Product [U >: T] extends Accessor[U, Product[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  29. class Reduce [U >: T] extends Accessor[Option[U], Reduce[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  30. abstract class ResultMapping [R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  31. case class ScanLeaf [U >: T](pit: IterableSplitter[U], op: (U, U) ⇒ U, from: Int, len: Int, prev: Option[ScanLeaf[U]], acc: U) extends ScanTree[U] with scala.Product with Serializable
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  32. case class ScanNode [U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  33. trait ScanTree [U >: T] extends AnyRef
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  34. abstract class SeqComposite [FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Sequentially performs one task after another.

    Sequentially performs one task after another.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  35. trait SignallingOps [PI <: DelegatedSignalling] extends AnyRef
    Definition Classes
    ParIterableLike
  36. class Slice [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  37. class Span [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  38. class SplitAt [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  39. trait StrictSplitterCheckTask [R, Tp] extends Task[R, Tp]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  40. class Sum [U >: T] extends Accessor[U, Sum[U]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  41. class Take [U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  42. class TakeWhile [U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  43. trait TaskOps [R, Tp] extends AnyRef
    Definition Classes
    ParIterableLike
  44. class ToParCollection [U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  45. class ToParMap [K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  46. trait Transformer [R, Tp] extends Accessor[R, Tp]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  47. class Zip [U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  48. class ZipAll [U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  49. class DefaultKeySet extends ParSet[K]
    Attributes
    protected
    Definition Classes
    ParMapLike
  50. class DefaultValuesIterable extends ParIterable[V]
    Attributes
    protected
    Definition Classes
    ParMapLike
  51. class ParHashMapIterator extends IterableSplitter[(K, V)]
  52. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]
    Definition Classes
    ParIterableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +[U >: V](kv: (K, U)): ParHashMap[K, U]
    Definition Classes
    ParHashMap → ParMap → ParMap → GenMapLike
  4. def ++[U >: (K, V), That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParHashMap[K, V], U, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  5. def -(k: K): ParHashMap[K, V]
    Definition Classes
    ParHashMap → GenMapLike
  6. def /:[S](z: S)(op: (S, (K, V)) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  7. def :\[S](z: S)(op: ((K, V), S) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def aggregate[S](z: ⇒ S)(seqop: (S, (K, V)) ⇒ 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
  10. def apply(key: K): V
    Definition Classes
    ParMapLike → GenMapLike
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def bf2seq[S, That](bf: CanBuildFrom[ParHashMap[K, V], S, That]): CanBuildFrom[HashMap[K, V], S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  13. implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  14. def canEqual(other: Any): Boolean
    Definition Classes
    ParIterableLike
  15. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def collect[S, That](pf: PartialFunction[(K, V), S])(implicit bf: CanBuildFrom[ParHashMap[K, V], S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  17. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  18. def combinerFactory: CombinerFactory[(K, V), ParHashMap[K, V]]

    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
  19. def companion: GenericCompanion[ParIterable] with GenericParCompanion[ParIterable]
    Definition Classes
    ParIterable → ParIterable → GenericParTemplate → GenIterable → GenTraversable → GenericTraversableTemplate
  20. def contains(key: K): Boolean
    Definition Classes
    ParMapLike → GenMapLike
  21. def copyToArray[U >: (K, V)](xs: Array[U], start: Int, len: Int): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  22. def copyToArray[U >: (K, V)](xs: Array[U], start: Int): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  23. def copyToArray[U >: (K, V)](xs: Array[U]): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  24. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    ParIterableLike → GenTraversableOnce
  25. def debugBuffer: ArrayBuffer[String]
    Definition Classes
    ParIterableLike
  26. def default(key: K): V
    Definition Classes
    ParMapLike → GenMapLike
  27. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  28. def drop(n: Int): ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  29. def dropWhile(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

    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
  30. def empty: ParHashMap[K, V]
    Definition Classes
    ParHashMap → ParMap → ParMap → ParMapLike
  31. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  33. def exists(p: ((K, V)) ⇒ 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
  34. def filter(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  35. def filterKeys(p: (K) ⇒ Boolean): parallel.ParMap[K, V]
    Definition Classes
    ParMapLike → GenMapLike
  36. def filterNot(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  37. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  38. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

    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
  39. def flatMap[S, That](f: ((K, V)) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParHashMap[K, V], S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  40. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): ParIterable[B]
    Definition Classes
    GenericTraversableTemplate
  41. def fold[U >: (K, V)](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
  42. def foldLeft[S](z: S)(op: (S, (K, V)) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  43. def foldRight[S](z: S)(op: ((K, V), S) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  44. def forall(p: ((K, V)) ⇒ 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
  45. def foreach[U](f: ((K, V)) ⇒ 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
  46. def genericBuilder[B]: Combiner[B, ParIterable[B]]
    Definition Classes
    GenericParTemplate → GenericTraversableTemplate
  47. def genericCombiner[B]: Combiner[B, ParIterable[B]]
    Definition Classes
    GenericParTemplate
  48. def genericMapCombiner[P, Q]: Combiner[(P, Q), ParHashMap[P, Q]]
    Definition Classes
    GenericParMapTemplate
  49. def get(k: K): Option[V]
    Definition Classes
    ParHashMap → GenMapLike
  50. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  51. def getOrElse[U >: V](key: K, default: ⇒ U): U
    Definition Classes
    ParMapLike → GenMapLike
  52. def groupBy[K](f: ((K, V)) ⇒ K): ParMap[K, ParHashMap[K, V]]
    Definition Classes
    ParIterableLike → GenTraversableLike
  53. def hasDefiniteSize: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  54. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  55. def head: (K, V)
    Definition Classes
    ParIterableLike → GenTraversableLike
  56. def headOption: Option[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableLike
  57. def init: ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  58. def initTaskSupport(): Unit
    Attributes
    protected
    Definition Classes
    ParIterableLike
  59. def isDefinedAt(key: K): Boolean
    Definition Classes
    ParMapLike → GenMapLike
  60. def isEmpty: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  61. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  62. 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
  63. final def isTraversableAgain: Boolean
    Definition Classes
    ParIterableLike → GenTraversableLike → GenTraversableOnce
  64. def iterator: Splitter[(K, V)]

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

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

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

    returns

    a split iterator

    Definition Classes
    ParIterableLike → GenIterableLike
  65. def keySet: parallel.ParSet[K]
    Definition Classes
    ParMapLike → GenMapLike
  66. def keys: parallel.ParIterable[K]
    Definition Classes
    ParMapLike → GenMapLike
  67. def keysIterator: IterableSplitter[K]
    Definition Classes
    ParMapLike → GenMapLike
  68. def last: (K, V)
    Definition Classes
    ParIterableLike → GenTraversableLike
  69. def lastOption: Option[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableLike
  70. def map[S, That](f: ((K, V)) ⇒ S)(implicit bf: CanBuildFrom[ParHashMap[K, V], S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  71. def mapCompanion: GenericParMapCompanion[ParHashMap]
    Definition Classes
    ParHashMap → ParMap → ParMap → GenericParMapTemplate
  72. def mapValues[S](f: (V) ⇒ S): parallel.ParMap[K, S]
    Definition Classes
    ParMapLike → GenMapLike
  73. def max[U >: (K, V)](implicit ord: Ordering[U]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  74. def maxBy[S](f: ((K, V)) ⇒ S)(implicit cmp: Ordering[S]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  75. def min[U >: (K, V)](implicit ord: Ordering[U]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  76. def minBy[S](f: ((K, V)) ⇒ S)(implicit cmp: Ordering[S]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  77. def mkString: String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  78. def mkString(sep: String): String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  79. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  80. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  81. def newBuilder: Builder[(K, V), ParIterable[(K, V)]]
    Attributes
    protected[this]
    Definition Classes
    GenericParTemplate → GenericTraversableTemplate → HasNewBuilder
  82. def newCombiner: HashMapCombiner[K, V]
    Attributes
    protected[this]
    Definition Classes
    ParHashMap → GenericParMapTemplate → GenericParTemplate → HasNewCombiner
  83. def nonEmpty: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  84. final def notify(): Unit
    Definition Classes
    AnyRef
  85. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  86. def par: ParHashMap[K, V]

    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
  87. def parCombiner: Combiner[(K, V), ParHashMap[K, V]]

    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
  88. def partition(pred: ((K, V)) ⇒ Boolean): (ParHashMap[K, V], ParHashMap[K, V])
    Definition Classes
    ParIterableLike → GenTraversableLike
  89. def product[U >: (K, V)](implicit num: Numeric[U]): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  90. def reduce[U >: (K, V)](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.

  91. def reduceLeft[U >: (K, V)](op: (U, (K, V)) ⇒ U): U
    Definition Classes
    ParIterableLike
  92. def reduceLeftOption[U >: (K, V)](op: (U, (K, V)) ⇒ U): Option[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  93. def reduceOption[U >: (K, V)](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
  94. def reduceRight[U >: (K, V)](op: ((K, V), U) ⇒ U): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  95. def reduceRightOption[U >: (K, V)](op: ((K, V), U) ⇒ U): Option[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  96. def repr: ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  97. 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
    ParHashMap → ParIterableLike
  98. def sameElements[U >: (K, V)](that: GenIterable[U]): Boolean
    Definition Classes
    ParIterableLike → GenIterableLike
  99. def scan(z: (K, V))(op: ((K, V), (K, V)) ⇒ (K, V)): ParHashMap[(K, V)]

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

    Definition Classes
    ParIterableLike → GenTraversableLike
    Full Signature

    def scan[U >: (K, V), That](z: U)(op: (U, U) ⇒ U)(implicit bf: CanBuildFrom[ParHashMap[K, V], U, That]): That

  100. def scanBlockSize: Int
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  101. def scanLeft[S, That](z: S)(op: (S, (K, V)) ⇒ S)(implicit bf: CanBuildFrom[ParHashMap[K, V], S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  102. def scanRight[S, That](z: S)(op: ((K, V), S) ⇒ S)(implicit bf: CanBuildFrom[ParHashMap[K, V], S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  103. def seq: HashMap[K, V]
    Definition Classes
    ParHashMap → ParIterableLike → Parallelizable → GenMap → GenIterable → GenTraversable → GenMapLike → GenTraversableOnce
  104. def sequentially[S, That <: Parallel](b: (HashMap[K, V]) ⇒ HashMap[K, V]): ParHashMap[K, V]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  105. def size: Int
    Definition Classes
    ParHashMap → GenTraversableLike → GenTraversableOnce
  106. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  107. def slice(unc_from: Int, unc_until: Int): ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  108. def span(pred: ((K, V)) ⇒ Boolean): (ParHashMap[K, V], ParHashMap[K, V])

    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
  109. def splitAt(n: Int): (ParHashMap[K, V], ParHashMap[K, V])
    Definition Classes
    ParIterableLike → GenTraversableLike
  110. def splitter: IterableSplitter[(K, V)]

    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
    ParHashMap → ParIterableLike
  111. def stringPrefix: String
    Definition Classes
    ParMap → ParMap → ParIterable → GenTraversableLike
  112. def sum[U >: (K, V)](implicit num: Numeric[U]): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  113. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  114. def tail: ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  115. def take(n: Int): ParHashMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableLike
  116. def takeWhile(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

    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
  117. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  118. 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

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

  120. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  121. def toArray[U >: (K, V)](implicit arg0: ClassTag[U]): Array[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  122. def toBuffer[U >: (K, V)]: Buffer[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  123. def toIndexedSeq: immutable.IndexedSeq[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  124. def toIterable: ParIterable[(K, V)]
    Definition Classes
    ParIterable → ParIterableLike → GenTraversableOnce
  125. def toIterator: scala.Iterator[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  126. def toList: List[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  127. def toMap[P, Q](implicit ev: <:<[(K, V), (P, Q)]): ParMap[P, Q]
    Definition Classes
    ParMap → ParIterableLike → GenTraversableOnce
  128. def toParCollection[U >: (K, V), That](cbf: () ⇒ Combiner[U, That]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  129. def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[(K, V), (K, V)]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  130. def toSeq: ParSeq[(K, V)]
    Definition Classes
    ParIterable → ParIterableLike → GenTraversableOnce
  131. def toSet[U >: (K, V)]: ParSet[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  132. def toStream: Stream[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  133. def toString(): String
    Definition Classes
    ParIterableLike → AnyRef → Any
  134. def toTraversable: GenTraversable[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  135. def toVector: Vector[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  136. def transpose[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): ParIterable[ParIterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  137. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (ParIterable[A1], ParIterable[A2])
    Definition Classes
    GenericTraversableTemplate
  138. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (ParIterable[A1], ParIterable[A2], ParIterable[A3])
    Definition Classes
    GenericTraversableTemplate
  139. def updated[U >: V](key: K, value: U): ParMap[K, U]
    Definition Classes
    ParMap → ParMap → GenMap
  140. def values: parallel.ParIterable[V]
    Definition Classes
    ParMapLike → GenMapLike
  141. def valuesIterator: IterableSplitter[V]
    Definition Classes
    ParMapLike → GenMapLike
  142. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  143. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  144. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  145. def withDefault[U >: V](d: (K) ⇒ U): ParMap[K, U]

    The same map with a given default function.

    The same map with a given default function. Note: get, contains, iterator, keys, etc are not affected by withDefault.

    Invoking transformer methods (e.g. map) will not preserve the default value.

    d

    the function mapping keys to values, used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    ParMap
  146. def withDefaultValue[U >: V](d: U): ParMap[K, U]

    The same map with a given default value.

    The same map with a given default value.

    Invoking transformer methods (e.g. map) will not preserve the default value.

    d

    default value used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    ParMap
  147. def withFilter(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]
    Definition Classes
    ParIterableLike
  148. def wrap[R](body: ⇒ R): NonDivisible[R]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  149. def zip[U >: (K, V), S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[ParHashMap[K, V], (U, S), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike
  150. def zipAll[S, U >: (K, V), That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[ParHashMap[K, V], (U, S), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike
  151. def zipWithIndex[U >: (K, V), That](implicit bf: CanBuildFrom[ParHashMap[K, V], (U, Int), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from ParMap[K, V]

Inherited from ParIterable[(K, V)]

Inherited from Immutable

Inherited from parallel.ParMap[K, V]

Inherited from ParMapLike[K, V, ParHashMap[K, V], HashMap[K, V]]

Inherited from parallel.ParIterable[(K, V)]

Inherited from ParIterableLike[(K, V), ParHashMap[K, V], HashMap[K, V]]

Inherited from Parallel

Inherited from CustomParallelizable[(K, V), ParHashMap[K, V]]

Inherited from Parallelizable[(K, V), ParHashMap[K, V]]

Inherited from GenericParMapTemplate[K, V, ParHashMap]

Inherited from GenericParTemplate[(K, V), ParIterable]

Inherited from HasNewCombiner[(K, V), ParHashMap[K, V]]

Inherited from GenMap[K, V]

Inherited from GenIterable[(K, V)]

Inherited from GenTraversable[(K, V)]

Inherited from GenericTraversableTemplate[(K, V), ParIterable]

Inherited from HasNewBuilder[(K, V), scala.collection.parallel.immutable.ParIterable[(K, V)] @scala.annotation.unchecked.uncheckedVariance]

Inherited from GenMapLike[K, V, ParHashMap[K, V]]

Inherited from Equals

Inherited from GenIterableLike[(K, V), ParHashMap[K, V]]

Inherited from GenTraversableLike[(K, V), ParHashMap[K, V]]

Inherited from GenTraversableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped