scala-parallel-collections
API
Generated with
scala-parallel-collections/scala.collection/scala.collection.parallel/ParMapLike

ParMapLike

scala.collection.parallel.ParMapLike
trait ParMapLike[K, +V, +CC <: (ParMap), +Repr <: ParMapLike[K, V, ParMap, Repr, Sequential] & ParMap[K, V], +Sequential <: Map[K, V] & MapOps[K, V, Map, Sequential]] extends ParIterableLike[(K, V), ParIterable, Repr, Sequential], Equals

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.

Type parameters

K

the key type of the map

V

the value type of the map

Attributes

Graph
Supertypes
trait Equals
trait ParIterableLike[(K, V), ParIterable, Repr, Sequential]
trait HasNewCombiner[(K, V), Repr]
trait Parallel
trait CustomParallelizable[(K, V), Repr]
trait Parallelizable[(K, V), Repr]
trait IterableOnce[(K, V)]
class Object
trait Matchable
class Any
Show all
Known subtypes
trait ParMapLike[K, V, CC, Repr, Sequential]
class ParHashMap[K, V]
trait ParMap[K, V]
class WithDefault[K, V]
trait ParMapLike[K, V, CC, Repr, Sequential]
class ParHashMap[K, V]
trait ParMap[K, V]
class WithDefault[K, V]
class ParTrieMap[K, V]
trait ParMap[K, V]
class WithDefault[A, B]
Show all
Self type
ParMapLike[K, V, CC, Repr, Sequential]

Members list

Type members

Classlikes

protected class DefaultKeySet extends ParSet[K]

Attributes

Supertypes
trait ParSet[K]
trait ParSetLike[K, ParSet, ParSet[K], Set[K]]
trait Equals
trait K => Boolean
trait ParIterable[K]
trait ParIterableLike[K, ParSet, ParSet[K], Set[K]]
trait Parallel
trait Parallelizable[K, ParSet[K]]
trait IterableOnce[K]
trait HasNewCombiner[K, ParSet[K]]
trait HasNewBuilder[K, ParSet[K]]
class Object
trait Matchable
class Any
Show all
protected class DefaultValuesIterable extends ParIterable[V]

Attributes

Supertypes
trait ParIterable[V]
trait Parallel
trait IterableOnce[V]
trait HasNewBuilder[V, ParIterable[V]]
class Object
trait Matchable
class Any
Show all

Inherited classlikes

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

Type parameters

R

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

Tp

the representation type of the task at hand.

Attributes

Inherited from:
ParIterableLike
Supertypes
trait Task[R, Tp]
class Object
trait Matchable
class Any
Known subtypes
trait Transformer[R, Tp]
class Copy[U, That]
trait ParSeqLikeTransformer[R, Tp]
trait ParSeqLikeAccessor[R, Tp]
trait BuilderOps[Elem, To]

Attributes

Inherited from:
ParIterableLike
Supertypes
class Object
trait Matchable
class Any
protected class Copy[U >: T, That](cfactory: CombinerFactory[U, That], val pit: IterableSplitter[T]) extends Transformer[Combiner[U, That], Copy[U, That]]

Attributes

Inherited from:
ParIterableLike
Supertypes
trait Transformer[Combiner[U, That], Copy[U, That]]
trait Accessor[Combiner[U, That], Copy[U, That]]
trait StrictSplitterCheckTask[Combiner[U, That], Copy[U, That]]
trait Task[Combiner[U, That], Copy[U, That]]
class Object
trait Matchable
class Any
Show all
trait SignallingOps[PI <: DelegatedSignalling]

Attributes

Inherited from:
ParIterableLike
Supertypes
class Object
trait Matchable
class Any
protected trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]

Attributes

Inherited from:
ParIterableLike
Supertypes
trait Task[R, Tp]
class Object
trait Matchable
class Any
Known subtypes
trait Accessor[R, Tp]
trait Transformer[R, Tp]
class Copy[U, That]
trait ParSeqLikeTransformer[R, Tp]
trait ParSeqLikeAccessor[R, Tp]
trait TaskOps[R, Tp]

Attributes

Inherited from:
ParIterableLike
Supertypes
class Object
trait Matchable
class Any
protected trait Transformer[R, Tp] extends Accessor[R, Tp]

Attributes

Inherited from:
ParIterableLike
Supertypes
trait Accessor[R, Tp]
trait Task[R, Tp]
class Object
trait Matchable
class Any
Show all
Known subtypes
class Copy[U, That]
trait ParSeqLikeTransformer[R, Tp]

Inherited types

type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

Attributes

Inherited from:
ParIterableLike

Value members

Abstract methods

def +[V1 >: V](kv: (K, V1)): CC[K, V1]
def -(key: K): Repr
def empty: Repr
def get(key: K): Option[V]

Concrete methods

final def ++[V2 >: V](xs: IterableOnce[(K, V2)]): CC[K, V2]

Alias for concat

Alias for concat

Attributes

def apply(key: K): V
def canEqual(that: Any): Boolean
def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): CC[K2, V2]

Builds a new collection by applying a partial function to all elements of this parallel map on which the function is defined.

Builds a new collection by applying a partial function to all elements of this parallel map on which the function is defined.

Type parameters

K2

the key type of the returned parallel map.

V2

the value type of the returned parallel map.

Value parameters

pf

the partial function which filters and maps the parallel map.

Attributes

Returns

a new parallel map 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.

def concat[V2 >: V](that: IterableOnce[(K, V2)]): CC[K, V2]

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

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

Value parameters

that

the collection or iterator to append.

Attributes

Returns

a new parallel map which contains all elements of this parallel map followed by all elements of suffix.

def contains(key: K): Boolean
def default(key: K): V
override def equals(that: Any): Boolean

Compares two maps structurally; i.e., checks if all mappings contained in this map are also contained in the other map, and vice versa.

Compares two maps structurally; i.e., checks if all mappings contained in this map are also contained in the other map, and vice versa.

Value parameters

that

the other map

Attributes

Returns

true if both maps contain exactly the same mappings, false otherwise.

Definition Classes
Equals -> Any
def filterKeys(p: K => Boolean): ParMap[K, V]
def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): CC[K2, V2]

Builds a new map by applying a function to all elements of this parallel map and using the elements of the resulting collections.

Builds a new map by applying a function to all elements of this parallel map and using the elements of the resulting collections.

Value parameters

f

the function to apply to each element.

Attributes

Returns

a new parallel map resulting from applying the given collection-valued function f to each element of this parallel map and concatenating the results.

def getOrElse[U >: V](key: K, default: => U): U
override def hashCode(): Int

Calculates a hash code value for the object.

Calculates a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Attributes

Returns

the hash code value for this object.

Definition Classes
Any
def isDefinedAt(key: K): Boolean
def keySet: ParSet[K]
def keys: ParIterable[K]
def map[K2, V2](f: ((K, V)) => (K2, V2)): CC[K2, V2]

Builds a new map by applying a function to all elements of this parallel map.

Builds a new map by applying a function to all elements of this parallel map.

Value parameters

f

the function to apply to each element.

Attributes

Returns

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

def mapValues[S](f: V => S): ParMap[K, S]
def updated[V1 >: V](key: K, value: V1): CC[K, V1]

Inherited methods

def ++[U >: (K, V)](that: IterableOnce[U]): ParIterable[U]

Attributes

Inherited from:
ParIterableLike
def /:[S](z: S)(op: (S, (K, V)) => S): S

Attributes

Inherited from:
ParIterableLike
def :\[S](z: S)(op: ((K, V), S) => S): S

Attributes

Inherited from:
ParIterableLike
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).

Type parameters

S

the type of accumulated results

Value parameters

combop

an associative operator used to combine results from different partitions

seqop

an operator used to accumulate results within a partition

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

Attributes

Inherited from:
ParIterableLike
def collect[S](pf: PartialFunction[(K, V), S]): ParIterable[S]

Attributes

Inherited from:
ParIterableLike
def copyToArray[U >: (K, V)](xs: Array[U], start: Int, len: Int): Unit

Attributes

Inherited from:
ParIterableLike
def copyToArray[U >: (K, V)](xs: Array[U], start: Int): Unit

Attributes

Inherited from:
ParIterableLike
def copyToArray[U >: (K, V)](xs: Array[U]): Unit

Attributes

Inherited from:
ParIterableLike
def count(p: ((K, V)) => Boolean): Int

Attributes

Inherited from:
ParIterableLike
def debugBuffer: ArrayBuffer[String]

Attributes

Inherited from:
ParIterableLike
def drop(n: Int): Repr

Attributes

Inherited from:
ParIterableLike
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.

Value parameters

pred

the predicate used to test the elements

Attributes

Returns

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

Inherited from:
ParIterableLike
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.

Value parameters

p

a predicate used to test elements

Attributes

Returns

true if p holds for some element, false otherwise

Inherited from:
ParIterableLike
def filter(pred: ((K, V)) => Boolean): Repr

Attributes

Inherited from:
ParIterableLike
def filterNot(pred: ((K, V)) => Boolean): Repr

Attributes

Inherited from:
ParIterableLike
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. The element may not necessarily be the first such element in the iteration order.

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.

Value parameters

p

predicate used to test the elements

Attributes

Returns

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

Inherited from:
ParIterableLike
def flatMap[S](f: ((K, V)) => IterableOnce[S]): ParIterable[S]

Attributes

Inherited from:
ParIterableLike
def fold[U >: (K, V)](z: U)(op: (U, U) => U): U

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.

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.

Type parameters

U

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

Value parameters

op

a binary operator that must be associative

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)

Attributes

Returns

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

Inherited from:
ParIterableLike
def foldLeft[S](z: S)(op: (S, (K, V)) => S): S

Attributes

Inherited from:
ParIterableLike
def foldRight[S](z: S)(op: ((K, V), S) => S): S

Attributes

Inherited from:
ParIterableLike
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.

Value parameters

p

a predicate used to test elements

Attributes

Returns

true if p holds for all elements, false otherwise

Inherited from:
ParIterableLike
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.

Type parameters

U

the result type of the function applied to each element, which is always discarded

Value parameters

f

function applied to each element

Attributes

Inherited from:
ParIterableLike
def groupBy[K](f: ((K, V)) => K): ParMap[K, Repr]

Attributes

Inherited from:
ParIterableLike
def hasDefiniteSize: Boolean

Attributes

Inherited from:
ParIterableLike
def head: (K, V)

Attributes

Inherited from:
ParIterableLike
def headOption: Option[(K, V)]

Attributes

Inherited from:
ParIterableLike
def init: Repr

Attributes

Inherited from:
ParIterableLike
protected def initTaskSupport(): Unit

Attributes

Inherited from:
ParIterableLike
def isEmpty: Boolean

Attributes

Inherited from:
ParIterableLike
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.

Attributes

Inherited from:
ParIterableLike
final def isTraversableAgain: Boolean

Attributes

Inherited from:
ParIterableLike
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.

Attributes

Returns

a split iterator

Inherited from:
ParIterableLike
def knownSize: Int

Attributes

Inherited from:
IterableOnce
def last: (K, V)

Attributes

Inherited from:
ParIterableLike
def lastOption: Option[(K, V)]

Attributes

Inherited from:
ParIterableLike
def map[S](f: ((K, V)) => S): ParIterable[S]

Attributes

Inherited from:
ParIterableLike
def max[U >: (K, V)](implicit ord: Ordering[U]): (K, V)

Attributes

Inherited from:
ParIterableLike
def maxBy[S](f: ((K, V)) => S)(implicit cmp: Ordering[S]): (K, V)

Attributes

Inherited from:
ParIterableLike
def min[U >: (K, V)](implicit ord: Ordering[U]): (K, V)

Attributes

Inherited from:
ParIterableLike
def minBy[S](f: ((K, V)) => S)(implicit cmp: Ordering[S]): (K, V)

Attributes

Inherited from:
ParIterableLike
def mkString: String

Attributes

Inherited from:
ParIterableLike
def mkString(sep: String): String

Attributes

Inherited from:
ParIterableLike
def mkString(start: String, sep: String, end: String): String

Attributes

Inherited from:
ParIterableLike
def nonEmpty: Boolean

Attributes

Inherited from:
ParIterableLike
override 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.

Attributes

Returns

a parallel implementation of this collection

Definition Classes
Inherited from:
ParIterableLike
def partition(pred: ((K, V)) => Boolean): (Repr, Repr)

Attributes

Inherited from:
ParIterableLike
def product[U >: (K, V)](implicit num: Numeric[U]): U

Attributes

Inherited from:
ParIterableLike
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.

Type parameters

U

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

Value parameters

op

A binary operator that must be associative.

Attributes

Returns

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

Throws
UnsupportedOperationException

if this parallel iterable is empty.

Inherited from:
ParIterableLike
def reduceLeft[U >: (K, V)](op: (U, (K, V)) => U): U

Attributes

Inherited from:
ParIterableLike
def reduceLeftOption[U >: (K, V)](op: (U, (K, V)) => U): Option[U]

Attributes

Inherited from:
ParIterableLike
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.

Type parameters

U

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

Value parameters

op

A binary operator that must be associative.

Attributes

Returns

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

Inherited from:
ParIterableLike
def reduceRight[U >: (K, V)](op: ((K, V), U) => U): U

Attributes

Inherited from:
ParIterableLike
def reduceRightOption[U >: (K, V)](op: ((K, V), U) => U): Option[U]

Attributes

Inherited from:
ParIterableLike
def repr: Repr

Attributes

Inherited from:
ParIterableLike
protected def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

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

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

Value parameters

newc

The new, empty combiner that can be used.

oldc

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

Attributes

Returns

Either newc or oldc.

Inherited from:
ParIterableLike
def sameElements[U >: (K, V)](that: IterableOnce[U]): Boolean

Attributes

Inherited from:
ParIterableLike
def scan[U >: (K, V)](z: U)(op: (U, U) => U): ParIterable[U]

Computes a prefix scan of the elements of the collection.

Computes a prefix scan of the elements of the collection.

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

Type parameters

U

element type of the resulting collection

Value parameters

op

the associative operator for the scan

z

neutral element for the operator op

Attributes

Returns

a new parallel iterable containing the prefix scan of the elements in this parallel iterable

Inherited from:
ParIterableLike
def scanLeft[S](z: S)(op: (S, (K, V)) => S): Iterable[S]

Attributes

Inherited from:
ParIterableLike
def scanRight[S](z: S)(op: ((K, V), S) => S): Iterable[S]

Attributes

Inherited from:
ParIterableLike
def slice(unc_from: Int, unc_until: Int): Repr

Attributes

Inherited from:
ParIterableLike
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.

Value parameters

pred

the predicate used to test the elements

Attributes

Returns

a pair consisting of the longest prefix of the collection for which all the elements satisfy pred, and the rest of the collection

Inherited from:
ParIterableLike
def splitAt(n: Int): (Repr, Repr)

Attributes

Inherited from:
ParIterableLike
def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S

Attributes

Inherited from:
IterableOnce
def sum[U >: (K, V)](implicit num: Numeric[U]): U

Attributes

Inherited from:
ParIterableLike
def tail: Repr

Attributes

Inherited from:
ParIterableLike
def take(n: Int): Repr

Attributes

Inherited from:
ParIterableLike
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.

Value parameters

pred

the predicate used to test the elements

Attributes

Returns

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

Inherited from:
ParIterableLike
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.

Attributes

See also
Inherited from:
ParIterableLike
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))

Attributes

See also
Inherited from:
ParIterableLike
def to[C](factory: Factory[(K, V), C]): C

Attributes

Inherited from:
ParIterableLike
def toArray[U >: (K, V) : ClassTag]: Array[U]

Attributes

Inherited from:
ParIterableLike
def toBuffer[U >: (K, V)]: Buffer[U]

Attributes

Inherited from:
ParIterableLike
def toIndexedSeq: IndexedSeq[(K, V)]

Attributes

Inherited from:
ParIterableLike
def toIterable: ParIterable[(K, V)]

Attributes

Inherited from:
ParIterableLike
def toIterator: Iterator[(K, V)]

Attributes

Inherited from:
ParIterableLike
def toList: List[(K, V)]

Attributes

Inherited from:
ParIterableLike
def toMap[K, V](implicit ev: (K, V) <:< (K, V)): ParMap[K, V]

Attributes

Inherited from:
ParIterableLike
protected def toParCollection[U >: (K, V), That](cbf: () => Combiner[U, That]): That

Attributes

Inherited from:
ParIterableLike
protected def toParMap[K, V, That](cbf: () => Combiner[(K, V), That])(implicit ev: (K, V) <:< (K, V)): That

Attributes

Inherited from:
ParIterableLike
def toSeq: ParSeq[(K, V)]

Attributes

Inherited from:
ParIterableLike
def toSet[U >: (K, V)]: ParSet[U]

Attributes

Inherited from:
ParIterableLike
override def toString: String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Inherited from:
ParIterableLike
def toVector: Vector[(K, V)]

Attributes

Inherited from:
ParIterableLike
def withFilter(pred: ((K, V)) => Boolean): Repr

Attributes

Inherited from:
ParIterableLike
protected def wrap[R](body: => R): NonDivisible[R]

Attributes

Inherited from:
ParIterableLike
def zip[U >: (K, V), S](that: Iterable[S]): ParIterable[(U, S)]

Attributes

Inherited from:
ParIterableLike
def zip[U >: (K, V), S](that: ParIterable[S]): ParIterable[(U, S)]

Attributes

Inherited from:
ParIterableLike
def zipAll[S, U >: (K, V)](that: ParIterable[S], thisElem: U, thatElem: S): ParIterable[(U, S)]

Attributes

Inherited from:
ParIterableLike
def zipWithIndex[U >: (K, V)]: ParIterable[(U, Int)]

Zips this parallel iterable with its indices.

Zips this parallel iterable with its indices.

Type parameters

U

the type of the first half of the returned pairs (this is always a supertype of the collection's element type T).

Attributes

Returns

A new collection of type ParIterable containing pairs consisting of all elements of this parallel iterable paired with their index. Indices start at 0.

Inherited from:
ParIterableLike

Inherited and Abstract methods

def companion: GenericParCompanion[ParIterable]

Attributes

Inherited from:
ParIterableLike
def seq: Sequential

Attributes

Inherited from:
ParIterableLike
def size: Int

Attributes

Inherited from:
ParIterableLike
def stringPrefix: String

Attributes

Inherited from:
ParIterableLike

Deprecated and Inherited methods

def toStream: Stream[(K, V)]

Attributes

Deprecated
true
Inherited from:
ParIterableLike
def toTraversable: ParIterable[(K, V)]

Attributes

Deprecated
true
Inherited from:
ParIterableLike

Implicits

Inherited implicits

implicit protected def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]

Attributes

Inherited from:
ParIterableLike
implicit protected def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

Attributes

Inherited from:
ParIterableLike
implicit protected def task2ops[R, Tp](tsk: StrictSplitterCheckTask[R, Tp]): TaskOps[R, Tp]

Attributes

Inherited from:
ParIterableLike
Generated with