trait ParMapLike[K, V, +Repr <: ParMapLike[K, V, Repr, Sequential] with ParMap[K, V], +Sequential <: mutable.Map[K, V] with mutable.MapLike[K, V, Sequential]] extends GenMapLike[K, V, Repr] with parallel.ParMapLike[K, V, Repr, Sequential] with Growable[(K, V)] with Shrinkable[K] with mutable.Cloneable[Repr]

A template trait for mutable parallel maps. This trait is to be mixed in with concrete parallel maps to override the representation type.

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

Linear Supertypes
mutable.Cloneable[Repr], Cloneable, java.lang.Cloneable, Shrinkable[K], Growable[(K, V)], Clearable, parallel.ParMapLike[K, V, Repr, Sequential], ParIterableLike[(K, V), Repr, Sequential], HasNewCombiner[(K, V), Repr], Parallel, CustomParallelizable[(K, V), Repr], Parallelizable[(K, V), Repr], GenMapLike[K, V, Repr], Equals, GenIterableLike[(K, V), Repr], GenTraversableLike[(K, V), Repr], GenTraversableOnce[(K, V)], AnyRef, Any
Known Subclasses
ParHashMap, ParMap, WithDefault, ParTrieMap
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParMapLike
  2. Cloneable
  3. Cloneable
  4. Cloneable
  5. Shrinkable
  6. Growable
  7. Clearable
  8. ParMapLike
  9. ParIterableLike
  10. HasNewCombiner
  11. Parallel
  12. CustomParallelizable
  13. Parallelizable
  14. GenMapLike
  15. Equals
  16. GenIterableLike
  17. GenTraversableLike
  18. GenTraversableOnce
  19. AnyRef
  20. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

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

    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. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]
    Definition Classes
    ParIterableLike

Abstract Value Members

  1. abstract def +=(kv: (K, V)): ParMapLike.this.type
    Definition Classes
    ParMapLike → Growable
  2. abstract def -=(key: K): ParMapLike.this.type
    Definition Classes
    ParMapLike → Shrinkable
  3. abstract def clear(): Unit
    Definition Classes
    ParMapLike → Growable → Clearable
  4. abstract def empty: Repr
    Definition Classes
    ParMapLike
  5. abstract def get(key: K): Option[V]
    Definition Classes
    GenMapLike
  6. abstract def newCombiner: Combiner[(K, V), Repr]
    Attributes
    protected[this]
    Definition Classes
    HasNewCombiner
  7. abstract def put(key: K, value: V): Option[V]
  8. abstract def seq: Sequential
    Definition Classes
    ParIterableLike → Parallelizable → GenTraversableOnce
  9. abstract def size: Int
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  10. abstract 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

    Attributes
    protected[scala.collection.parallel]
    Definition Classes
    ParIterableLike
  11. abstract def stringPrefix: String
    Definition Classes
    GenTraversableLike

Concrete 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)): ParMap[K, U]
    Definition Classes
    ParMapLike → GenMapLike
  4. def ++[U >: (K, V), That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[Repr, U, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  5. def ++=(xs: TraversableOnce[(K, V)]): ParMapLike.this.type
    Definition Classes
    Growable
  6. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): ParMapLike.this.type
    Definition Classes
    Growable
  7. def -(key: K): Repr
    Definition Classes
    ParMapLike → GenMapLike
  8. def --=(xs: TraversableOnce[K]): ParMapLike.this.type
    Definition Classes
    Shrinkable
  9. def -=(elem1: K, elem2: K, elems: K*): ParMapLike.this.type
    Definition Classes
    Shrinkable
  10. def /:[S](z: S)(op: (S, (K, V)) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  11. def :\[S](z: S)(op: ((K, V), S) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  12. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. 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
  14. def apply(key: K): V
    Definition Classes
    ParMapLike → GenMapLike
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def bf2seq[S, That](bf: CanBuildFrom[Repr, S, That]): CanBuildFrom[Sequential, S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  18. def canEqual(other: Any): Boolean
    Definition Classes
    ParIterableLike
  19. def clone(): Repr
    Definition Classes
    Cloneable → AnyRef
  20. def collect[S, That](pf: PartialFunction[(K, V), S])(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  21. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. def combinerFactory: CombinerFactory[(K, V), Repr]

    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
  23. def contains(key: K): Boolean
    Definition Classes
    ParMapLike → GenMapLike
  24. def copyToArray[U >: (K, V)](xs: Array[U], start: Int, len: Int): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  25. def copyToArray[U >: (K, V)](xs: Array[U], start: Int): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  26. def copyToArray[U >: (K, V)](xs: Array[U]): Unit
    Definition Classes
    ParIterableLike → GenTraversableOnce
  27. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    ParIterableLike → GenTraversableOnce
  28. def debugBuffer: ArrayBuffer[String]
    Definition Classes
    ParIterableLike
  29. def default(key: K): V
    Definition Classes
    ParMapLike → GenMapLike
  30. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  31. def drop(n: Int): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  32. def dropWhile(pred: ((K, V)) ⇒ Boolean): Repr

    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
  33. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  35. 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
  36. def filter(pred: ((K, V)) ⇒ Boolean): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  37. def filterKeys(p: (K) ⇒ Boolean): parallel.ParMap[K, V]
    Definition Classes
    ParMapLike → GenMapLike
  38. def filterNot(pred: ((K, V)) ⇒ Boolean): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  39. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  40. 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
  41. def flatMap[S, That](f: ((K, V)) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  42. 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
  43. def foldLeft[S](z: S)(op: (S, (K, V)) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  44. def foldRight[S](z: S)(op: ((K, V), S) ⇒ S): S
    Definition Classes
    ParIterableLike → GenTraversableOnce
  45. 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
  46. 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
  47. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  48. def getOrElse[U >: V](key: K, default: ⇒ U): U
    Definition Classes
    ParMapLike → GenMapLike
  49. def groupBy[K](f: ((K, V)) ⇒ K): immutable.ParMap[K, Repr]
    Definition Classes
    ParIterableLike → GenTraversableLike
  50. def hasDefiniteSize: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  51. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  52. def head: (K, V)
    Definition Classes
    ParIterableLike → GenTraversableLike
  53. def headOption: Option[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableLike
  54. def init: Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  55. def initTaskSupport(): Unit
    Attributes
    protected
    Definition Classes
    ParIterableLike
  56. def isDefinedAt(key: K): Boolean
    Definition Classes
    ParMapLike → GenMapLike
  57. def isEmpty: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  58. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  59. 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
  60. final def isTraversableAgain: Boolean
    Definition Classes
    ParIterableLike → GenTraversableLike → GenTraversableOnce
  61. 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
  62. def keySet: parallel.ParSet[K]
    Definition Classes
    ParMapLike → GenMapLike
  63. def keys: parallel.ParIterable[K]
    Definition Classes
    ParMapLike → GenMapLike
  64. def keysIterator: IterableSplitter[K]
    Definition Classes
    ParMapLike → GenMapLike
  65. def last: (K, V)
    Definition Classes
    ParIterableLike → GenTraversableLike
  66. def lastOption: Option[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableLike
  67. def map[S, That](f: ((K, V)) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  68. def mapValues[S](f: (V) ⇒ S): parallel.ParMap[K, S]
    Definition Classes
    ParMapLike → GenMapLike
  69. def max[U >: (K, V)](implicit ord: Ordering[U]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  70. def maxBy[S](f: ((K, V)) ⇒ S)(implicit cmp: Ordering[S]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  71. def min[U >: (K, V)](implicit ord: Ordering[U]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  72. def minBy[S](f: ((K, V)) ⇒ S)(implicit cmp: Ordering[S]): (K, V)
    Definition Classes
    ParIterableLike → GenTraversableOnce
  73. def mkString: String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  74. def mkString(sep: String): String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  75. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    ParIterableLike → GenTraversableOnce
  76. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  77. def nonEmpty: Boolean
    Definition Classes
    ParIterableLike → GenTraversableOnce
  78. final def notify(): Unit
    Definition Classes
    AnyRef
  79. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  80. def par: Repr

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

    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
  82. def partition(pred: ((K, V)) ⇒ Boolean): (Repr, Repr)
    Definition Classes
    ParIterableLike → GenTraversableLike
  83. def product[U >: (K, V)](implicit num: Numeric[U]): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  84. 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.

  85. def reduceLeft[U >: (K, V)](op: (U, (K, V)) ⇒ U): U
    Definition Classes
    ParIterableLike
  86. def reduceLeftOption[U >: (K, V)](op: (U, (K, V)) ⇒ U): Option[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  87. 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
  88. def reduceRight[U >: (K, V)](op: ((K, V), U) ⇒ U): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  89. def reduceRightOption[U >: (K, V)](op: ((K, V), U) ⇒ U): Option[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  90. def repr: Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  91. 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
  92. def sameElements[U >: (K, V)](that: GenIterable[U]): Boolean
    Definition Classes
    ParIterableLike → GenIterableLike
  93. def scan(z: (K, V))(op: ((K, V), (K, V)) ⇒ (K, V)): ParMap[(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 parallel map containing the prefix scan of the elements in this parallel map

    Definition Classes
    ParIterableLike → GenTraversableLike
    Full Signature

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

  94. def scanBlockSize: Int
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  95. def scanLeft[S, That](z: S)(op: (S, (K, V)) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  96. def scanRight[S, That](z: S)(op: ((K, V), S) ⇒ S)(implicit bf: CanBuildFrom[Repr, S, That]): That
    Definition Classes
    ParIterableLike → GenTraversableLike
  97. def sequentially[S, That <: Parallel](b: (Sequential) ⇒ Sequential): Repr
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  98. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  99. def slice(unc_from: Int, unc_until: Int): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  100. def span(pred: ((K, V)) ⇒ Boolean): (Repr, Repr)

    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
  101. def splitAt(n: Int): (Repr, Repr)
    Definition Classes
    ParIterableLike → GenTraversableLike
  102. def sum[U >: (K, V)](implicit num: Numeric[U]): U
    Definition Classes
    ParIterableLike → GenTraversableOnce
  103. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  104. def tail: Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  105. def take(n: Int): Repr
    Definition Classes
    ParIterableLike → GenTraversableLike
  106. def takeWhile(pred: ((K, V)) ⇒ Boolean): Repr

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

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

  110. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  111. def toArray[U >: (K, V)](implicit arg0: ClassTag[U]): Array[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  112. def toBuffer[U >: (K, V)]: Buffer[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  113. def toIndexedSeq: immutable.IndexedSeq[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  114. def toIterable: parallel.ParIterable[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  115. def toIterator: scala.Iterator[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  116. def toList: List[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  117. def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.ParMap[K, V]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  118. def toParCollection[U >: (K, V), That](cbf: () ⇒ Combiner[U, That]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  119. def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[(K, V), (K, V)]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  120. def toSeq: parallel.ParSeq[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  121. def toSet[U >: (K, V)]: immutable.ParSet[U]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  122. def toStream: Stream[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  123. def toString(): String
    Definition Classes
    ParIterableLike → AnyRef → Any
  124. def toTraversable: GenTraversable[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  125. def toVector: Vector[(K, V)]
    Definition Classes
    ParIterableLike → GenTraversableOnce
  126. def values: parallel.ParIterable[V]
    Definition Classes
    ParMapLike → GenMapLike
  127. def valuesIterator: IterableSplitter[V]
    Definition Classes
    ParMapLike → GenMapLike
  128. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  129. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  130. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  131. def withFilter(pred: ((K, V)) ⇒ Boolean): Repr
    Definition Classes
    ParIterableLike
  132. def wrap[R](body: ⇒ R): NonDivisible[R]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  133. def zip[U >: (K, V), S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[Repr, (U, S), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike
  134. def zipAll[S, U >: (K, V), That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[Repr, (U, S), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike
  135. def zipWithIndex[U >: (K, V), That](implicit bf: CanBuildFrom[Repr, (U, Int), That]): That
    Definition Classes
    ParIterableLike → GenIterableLike

Inherited from mutable.Cloneable[Repr]

Inherited from Cloneable

Inherited from java.lang.Cloneable

Inherited from Shrinkable[K]

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from parallel.ParMapLike[K, V, Repr, Sequential]

Inherited from ParIterableLike[(K, V), Repr, Sequential]

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

Inherited from Parallel

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

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

Inherited from GenMapLike[K, V, Repr]

Inherited from Equals

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

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

Inherited from GenTraversableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped