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

DefaultKeySet

scala.collection.parallel.ParMapLike.DefaultKeySet
protected class DefaultKeySet extends ParSet[K]

Attributes

Graph
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

Members list

Type members

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

Concrete methods

def +(elem: K): ParSet[K]
def -(elem: K): ParSet[K]
def contains(key: K): Boolean
override def foreach[U](f: K => 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

Definition Classes
override def knownSize: Int

Attributes

Definition Classes
override def seq: Set[K]

A sequential collection containing the same elements as this collection

A sequential collection containing the same elements as this collection

Attributes

Definition Classes
def size: Int
def splitter: IterableSplitter[K]

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.

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.

Attributes

Returns

a parallel iterator

Inherited methods

def &(that: Set[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def &(that: ParSet[K]): ParSet[K]

Computes the intersection between this set and another set.

Computes the intersection between this set and another set.

'''Note:''' Same as intersect.

Value parameters

that

the set to intersect with.

Attributes

Returns

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

Inherited from:
ParSetLike
def &~(that: Set[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def &~(that: ParSet[K]): ParSet[K]

The difference of this set and another set.

The difference of this set and another set.

'''Note:''' Same as diff.

Value parameters

that

the set of elements to exclude.

Attributes

Returns

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

Inherited from:
ParSetLike
def ++[U >: K](that: IterableOnce[U]): ParSet[U]

Attributes

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

Attributes

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

Attributes

Inherited from:
ParIterableLike
def aggregate[S](z: => S)(seqop: (S, K) => 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 andThen[A](g: Boolean => A): K => A

Attributes

Inherited from:
Function1
final def apply(elem: K): Boolean

Attributes

Inherited from:
ParSetLike
def canEqual(other: Any): Boolean

Attributes

Inherited from:
ParSetLike
def collect[S](pf: PartialFunction[K, S]): ParSet[S]

Attributes

Inherited from:
ParIterableLike
override def companion: GenericParCompanion[ParSet]

The factory companion object that builds instances of class ParSet. (or its Iterable superclass where class ParSet is not a Seq.)

The factory companion object that builds instances of class ParSet. (or its Iterable superclass where class ParSet is not a Seq.)

Attributes

Definition Classes
Inherited from:
ParSet
def compose[A](g: A => K): A => Boolean

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
ParIterableLike
def debugBuffer: ArrayBuffer[String]

Attributes

Inherited from:
ParIterableLike
def diff(that: ParSet[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def diff(that: Set[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def drop(n: Int): ParSet[K]

Attributes

Inherited from:
ParIterableLike
def dropWhile(pred: K => Boolean): ParSet[K]

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
override def empty: ParSet[K]

Attributes

Definition Classes
Inherited from:
ParSet
override def equals(that: Any): Boolean

Compares this set with another object for equality.

Compares this set with another object for equality.

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

Value parameters

that

the other object

Attributes

Returns

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

Definition Classes
ParSetLike -> Equals -> Any
Inherited from:
ParSetLike
def exists(p: K => 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 => Boolean): ParSet[K]

Attributes

Inherited from:
ParIterableLike
def filterNot(pred: K => Boolean): ParSet[K]

Attributes

Inherited from:
ParIterableLike
def find(p: K => Boolean): Option[K]

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 => IterableOnce[S]): ParSet[S]

Attributes

Inherited from:
ParIterableLike
def flatten[B](implicit asTraversable: K => IterableOnce[B]): ParSet[B]

Converts this collection of traversable collections into a collection formed by the elements of these traversable collections.

Converts this collection of traversable collections into a collection formed by the elements of these traversable collections.

Type parameters

B

the type of the elements of each traversable collection.

Value parameters

asTraversable

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

Attributes

Returns

a new collection resulting from concatenating all element collections.

Inherited from:
GenericTraversableTemplate
def fold[U >: K](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) => S): S

Attributes

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

Attributes

Inherited from:
ParIterableLike
def forall(p: K => 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
override def genericBuilder[B]: Combiner[B, ParSet[B]]

The generic builder that builds instances of $Coll at arbitrary element types.

The generic builder that builds instances of $Coll at arbitrary element types.

Attributes

Definition Classes
Inherited from:
GenericParTemplate
def genericCombiner[B]: Combiner[B, ParSet[B]]

Attributes

Inherited from:
GenericParTemplate
def groupBy[K](f: K => K): ParMap[K, ParSet[K]]

Attributes

Inherited from:
ParIterableLike
def hasDefiniteSize: Boolean

Attributes

Inherited from:
ParIterableLike
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
ParSetLike -> Any
Inherited from:
ParSetLike
def head: K

Attributes

Inherited from:
ParIterableLike
def headOption: Option[K]

Attributes

Inherited from:
ParIterableLike
def init: ParSet[K]

Attributes

Inherited from:
ParIterableLike
protected def initTaskSupport(): Unit

Attributes

Inherited from:
ParIterableLike
def intersect(that: Set[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def intersect(that: ParSet[K]): ParSet[K]

Computes the intersection between this set and another set.

Computes the intersection between this set and another set.

Value parameters

that

the set to intersect with.

Attributes

Returns

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

Inherited from:
ParSetLike
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]

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 last: K

Attributes

Inherited from:
ParIterableLike
def lastOption: Option[K]

Attributes

Inherited from:
ParIterableLike
def map[S](f: K => S): ParSet[S]

Attributes

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

Attributes

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

Attributes

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

Attributes

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

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: ParSet[K]

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 => Boolean): (ParSet[K], ParSet[K])

Attributes

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

Attributes

Inherited from:
ParIterableLike
def reduce[U >: K](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](op: (U, K) => U): U

Attributes

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

Attributes

Inherited from:
ParIterableLike
def reduceOption[U >: K](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](op: (K, U) => U): U

Attributes

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

Attributes

Inherited from:
ParIterableLike
def repr: ParSet[K]

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](that: IterableOnce[U]): Boolean

Attributes

Inherited from:
ParIterableLike
def scan[U >: K](z: U)(op: (U, U) => U): ParSet[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) => S): Iterable[S]

Attributes

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

Attributes

Inherited from:
ParIterableLike
def slice(unc_from: Int, unc_until: Int): ParSet[K]

Attributes

Inherited from:
ParIterableLike
def span(pred: K => Boolean): (ParSet[K], ParSet[K])

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): (ParSet[K], ParSet[K])

Attributes

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

Attributes

Inherited from:
IterableOnce
override def stringPrefix: String

Attributes

Definition Classes
Inherited from:
ParSet
def subsetOf(that: ParSet[K]): Boolean

Tests whether this set is a subset of another set.

Tests whether this set is a subset of another set.

Value parameters

that

the set to test.

Attributes

Returns

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

Inherited from:
ParSetLike
def sum[U >: K](implicit num: Numeric[U]): U

Attributes

Inherited from:
ParIterableLike
def tail: ParSet[K]

Attributes

Inherited from:
ParIterableLike
def take(n: Int): ParSet[K]

Attributes

Inherited from:
ParIterableLike
def takeWhile(pred: K => Boolean): ParSet[K]

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, C]): C

Attributes

Inherited from:
ParIterableLike
def toArray[U >: K : ClassTag]: Array[U]

Attributes

Inherited from:
ParIterableLike
def toBuffer[U >: K]: Buffer[U]

Attributes

Inherited from:
ParIterableLike
def toIndexedSeq: IndexedSeq[K]

Attributes

Inherited from:
ParIterableLike
def toIterable: ParIterable[K]

Attributes

Inherited from:
ParIterableLike
def toIterator: Iterator[K]

Attributes

Inherited from:
ParIterableLike
def toList: List[K]

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
ParIterableLike
def toSeq: ParSeq[K]

Attributes

Inherited from:
ParIterableLike
def toSet[U >: K]: 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
Function1 -> Any
Inherited from:
Function1
def toVector: Vector[K]

Attributes

Inherited from:
ParIterableLike
def transpose[B](implicit asTraversable: K => IterableOnce[B]): ParSet[ParSet[B]]

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

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

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

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

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

Type parameters

B

the type of the elements of each traversable collection.

Value parameters

asTraversable

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

Attributes

Returns

a two-dimensional collection of collections which has as ''n''th row the ''n''th column of this collection.

Throws
IllegalArgumentException

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

Inherited from:
GenericTraversableTemplate
def union(that: ParSet[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def union(that: Set[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def unzip[A1, A2](implicit asPair: K => (A1, A2)): (ParSet[A1], ParSet[A2])

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

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

  val xs = $Coll(
             (1, "one"),
             (2, "two"),
             (3, "three")).unzip
  // xs == ($Coll(1, 2, 3),
  //        $Coll(one, two, three))

Type parameters

A1

the type of the first half of the element pairs

A2

the type of the second half of the element pairs

Value parameters

asPair

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

Attributes

Returns

a pair of collections, containing the first, respectively second half of each element pair of this collection.

Inherited from:
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: K => (A1, A2, A3)): (ParSet[A1], ParSet[A2], ParSet[A3])

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

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

  val xs = $Coll(
             (1, "one", '1'),
             (2, "two", '2'),
             (3, "three", '3')).unzip3
  // xs == ($Coll(1, 2, 3),
  //        $Coll(one, two, three),
  //        $Coll(1, 2, 3))

Type parameters

A1

the type of the first member of the element triples

A2

the type of the second member of the element triples

A3

the type of the third member of the element triples

Value parameters

asTriple

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

Attributes

Returns

a triple of collections, containing the first, second, respectively third member of each element triple of this collection.

Inherited from:
GenericTraversableTemplate
def withFilter(pred: K => Boolean): ParSet[K]

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
ParIterableLike
def zipWithIndex[U >: K]: ParSet[(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
def |(that: Set[K]): ParSet[K]

Attributes

Inherited from:
ParSetLike
def |(that: ParSet[K]): ParSet[K]

Computes the union between this set and another set.

Computes the union between this set and another set.

'''Note:''' Same as union.

Value parameters

that

the set to form the union with.

Attributes

Returns

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

Inherited from:
ParSetLike

Deprecated and Inherited methods

def toStream: Stream[K]

Attributes

Deprecated
true
Inherited from:
ParIterableLike
def toTraversable: ParIterable[K]

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