Class/Object

scala.collection.parallel.mutable

ParTrieMap

Related Docs: object ParTrieMap | package mutable

Permalink

final class ParTrieMap[K, V] extends ParMap[K, V] with GenericParMapTemplate[K, V, ParTrieMap] with ParMapLike[K, V, ParTrieMap[K, V], TrieMap[K, V]] with ParTrieMapCombiner[K, V] with Serializable

Parallel TrieMap collection.

It has its bulk operations parallelized, but uses the snapshot operation to create the splitter. This means that parallel bulk operations can be called concurrently with the modifications.

Since

2.10

See also

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

Linear Supertypes
Serializable, java.io.Serializable, ParTrieMapCombiner[K, V], Combiner[(K, V), ParTrieMap[K, V]], Sizing, Builder[(K, V), ParTrieMap[K, V]], ParMap[K, V], ParMapLike[K, V, ParTrieMap[K, V], TrieMap[K, V]], mutable.Cloneable[ParTrieMap[K, V]], Cloneable, java.lang.Cloneable, Shrinkable[K], Growable[(K, V)], Clearable, ParIterable[(K, V)], Mutable, parallel.ParMap[K, V], parallel.ParMapLike[K, V, ParTrieMap[K, V], TrieMap[K, V]], parallel.ParIterable[(K, V)], ParIterableLike[(K, V), ParTrieMap[K, V], TrieMap[K, V]], Parallel, CustomParallelizable[(K, V), ParTrieMap[K, V]], GenericParMapTemplate[K, V, ParTrieMap], GenericParTemplate[(K, V), ParIterable], HasNewCombiner[(K, V), ParTrieMap[K, V]], GenMap[K, V], GenIterable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), ParIterable], HasNewBuilder[(K, V), scala.collection.parallel.mutable.ParIterable[(K, V)] @scala.annotation.unchecked.uncheckedVariance], GenMapLike[K, V, ParTrieMap[K, V]], Equals, GenIterableLike[(K, V), ParTrieMap[K, V]], GenTraversableLike[(K, V), ParTrieMap[K, V]], Parallelizable[(K, V), ParTrieMap[K, V]], GenTraversableOnce[(K, V)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParTrieMap
  2. Serializable
  3. Serializable
  4. ParTrieMapCombiner
  5. Combiner
  6. Sizing
  7. Builder
  8. ParMap
  9. ParMapLike
  10. Cloneable
  11. Cloneable
  12. Cloneable
  13. Shrinkable
  14. Growable
  15. Clearable
  16. ParIterable
  17. Mutable
  18. ParMap
  19. ParMapLike
  20. ParIterable
  21. ParIterableLike
  22. Parallel
  23. CustomParallelizable
  24. GenericParMapTemplate
  25. GenericParTemplate
  26. HasNewCombiner
  27. GenMap
  28. GenIterable
  29. GenTraversable
  30. GenericTraversableTemplate
  31. HasNewBuilder
  32. GenMapLike
  33. Equals
  34. GenIterableLike
  35. GenTraversableLike
  36. Parallelizable
  37. GenTraversableOnce
  38. AnyRef
  39. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParTrieMap()

    Permalink

Type Members

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

    Permalink

    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]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  3. trait BuilderOps[Elem, To] extends AnyRef

    Permalink
    Definition Classes
    ParIterableLike
  4. class Collect[S, That] extends Transformer[Combiner[S, That], Collect[S, That]]

    Permalink
    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]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  6. class Copy[U >: T, That] extends Transformer[Combiner[U, That], Copy[U, That]]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  7. class CopyToArray[U >: T, This >: Repr] extends Accessor[Unit, CopyToArray[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  8. class Count extends Accessor[Int, Count]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  9. class CreateScanTree[U >: T] extends Transformer[ScanTree[U], CreateScanTree[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  10. class DefaultKeySet extends ParSet[K]

    Permalink
    Attributes
    protected
    Definition Classes
    ParMapLike
  11. class DefaultValuesIterable extends ParIterable[V]

    Permalink
    Attributes
    protected
    Definition Classes
    ParMapLike
  12. class Drop[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Drop[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  13. class Exists extends Accessor[Boolean, Exists]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  14. class Filter[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Filter[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  15. class FilterNot[U >: T, This >: Repr] extends Transformer[Combiner[U, This], FilterNot[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  16. class Find[U >: T] extends Accessor[Option[U], Find[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  17. class FlatMap[S, That] extends Transformer[Combiner[S, That], FlatMap[S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  18. class Fold[U >: T] extends Accessor[U, Fold[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  19. class Forall extends Accessor[Boolean, Forall]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  20. class Foreach[S] extends Accessor[Unit, Foreach[S]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  21. class FromScanTree[U >: T, That] extends StrictSplitterCheckTask[Combiner[U, That], FromScanTree[U, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  22. class GroupBy[K, U >: T] extends Transformer[HashMapCombiner[K, U], GroupBy[K, U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  23. class Map[S, That] extends Transformer[Combiner[S, That], Map[S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  24. class Max[U >: T] extends Accessor[Option[U], Max[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  25. class Min[U >: T] extends Accessor[Option[U], Min[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  26. trait NonDivisible[R] extends NonDivisibleTask[R, NonDivisible[R]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  27. trait NonDivisibleTask[R, Tp] extends StrictSplitterCheckTask[R, Tp]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  28. abstract class ParComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Permalink

    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
  29. class Partition[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  30. class Product[U >: T] extends Accessor[U, Product[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  31. class Reduce[U >: T] extends Accessor[Option[U], Reduce[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  32. abstract class ResultMapping[R, Tp, R1] extends NonDivisibleTask[R1, ResultMapping[R, Tp, R1]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  33. type SSCTask[R, Tp] = StrictSplitterCheckTask[R, Tp]

    Permalink
    Definition Classes
    ParIterableLike
  34. 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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  35. case class ScanNode[U >: T](left: ScanTree[U], right: ScanTree[U]) extends ScanTree[U] with scala.Product with Serializable

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  36. trait ScanTree[U >: T] extends AnyRef

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  37. abstract class SeqComposite[FR, SR, R, First <: StrictSplitterCheckTask[FR, _], Second <: StrictSplitterCheckTask[SR, _]] extends Composite[FR, SR, R, First, Second]

    Permalink

    Sequentially performs one task after another.

    Sequentially performs one task after another.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  38. trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef

    Permalink
    Definition Classes
    ParIterableLike
  39. class Size extends Task[Int, Size]

    Permalink

    Computes TrieMap size in parallel.

  40. class Slice[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  41. class Span[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Span[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  42. class SplitAt[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), SplitAt[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  43. trait StrictSplitterCheckTask[R, Tp] extends Task[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  44. class Sum[U >: T] extends Accessor[U, Sum[U]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  45. class Take[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Take[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  46. class TakeWhile[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Boolean), TakeWhile[U, This]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  47. trait TaskOps[R, Tp] extends AnyRef

    Permalink
    Definition Classes
    ParIterableLike
  48. class ToParCollection[U >: T, That] extends Transformer[Combiner[U, That], ToParCollection[U, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  49. class ToParMap[K, V, That] extends Transformer[Combiner[(K, V), That], ToParMap[K, V, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  50. trait Transformer[R, Tp] extends Accessor[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  51. class Zip[U >: T, S, That] extends Transformer[Combiner[(U, S), That], Zip[U, S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  52. class ZipAll[U >: T, S, That] extends Transformer[Combiner[(U, S), That], ZipAll[U, S, That]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +[U >: V](kv: (K, U)): ParMap[K, U]

    Permalink
    Definition Classes
    ParMapLikeGenMapLike
  4. def ++[B](that: GenTraversableOnce[B]): ParMap[B]

    Permalink

    [use case] Returns a new parallel map containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    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.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = List(2)
    b: List[Int] = List(2)
    
    scala> val c = a ++ b
    c: List[Int] = List(1, 2)
    
    scala> val d = List('a')
    d: List[Char] = List(a)
    
    scala> val e = c ++ d
    e: List[AnyVal] = List(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def ++[U >: (K, V), That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParTrieMap[K, V], U, That]): That

  5. def ++=(xs: TraversableOnce[(K, V)]): ParTrieMap.this.type

    Permalink

    adds all elements produced by a TraversableOnce to this growable collection.

    adds all elements produced by a TraversableOnce to this growable collection.

    xs

    the TraversableOnce producing the elements to add.

    returns

    the growable collection itself.

    Definition Classes
    Growable
  6. def +=(kv: (K, V)): ParTrieMap.this.type

    Permalink

    Adds a single element to the builder.

    Adds a single element to the builder.

    returns

    the builder itself.

    Definition Classes
    ParTrieMapBuilderParMapLikeGrowable
  7. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): ParTrieMap.this.type

    Permalink

    adds two or more elements to this growable collection.

    adds two or more elements to this growable collection.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the growable collection itself

    Definition Classes
    Growable
  8. def -(key: K): ParTrieMap[K, V]

    Permalink
    Definition Classes
    ParMapLikeGenMapLike
  9. def --=(xs: TraversableOnce[K]): ParTrieMap.this.type

    Permalink

    Removes all elements produced by an iterator from this shrinkable collection.

    Removes all elements produced by an iterator from this shrinkable collection.

    xs

    the iterator producing the elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes
    Shrinkable
  10. def -=(key: K): ParTrieMap.this.type

    Permalink

    Removes a single element from this parallel map .

    Removes a single element from this parallel map .

    returns

    the parallel map itself

    Definition Classes
    ParTrieMapParMapLikeShrinkable
  11. def -=(elem1: K, elem2: K, elems: K*): ParTrieMap.this.type

    Permalink

    Removes two or more elements from this shrinkable collection.

    Removes two or more elements from this shrinkable collection.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the shrinkable collection itself

    Definition Classes
    Shrinkable
  12. def /:[S](z: S)(op: (S, (K, V)) ⇒ S): S

    Permalink

    Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.

    Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = (5 /: a)(_+_)
    b: Int = 15
    
    scala> val c = (5 /: a)((x,y) => x + y)
    c: Int = 15

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  13. def :\[S](z: S)(op: ((K, V), S) ⇒ S): S

    Permalink

    Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.

    Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = (a :\ 5)(_+_)
    b: Int = 15
    
    scala> val c = (a :\ 5)((x,y) => x + y)
    c: Int = 15
    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  14. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  15. var _combinerTaskSupport: TaskSupport

    Permalink
    Definition Classes
    Combiner
  16. def aggregate[S](z: ⇒ S)(seqop: (S, (K, V)) ⇒ S, combop: (S, S) ⇒ S): S

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  17. def apply(key: K): V

    Permalink
    Definition Classes
    ParMapLikeGenMapLike
  18. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  19. def bf2seq[S, That](bf: CanBuildFrom[ParTrieMap[K, V], S, That]): CanBuildFrom[TrieMap[K, V], S, That]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  20. implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  21. def canBeShared: Boolean

    Permalink

    Returns true if this combiner has a thread-safe += and is meant to be shared across several threads constructing the collection.

    Returns true if this combiner has a thread-safe += and is meant to be shared across several threads constructing the collection.

    By default, this method returns false.

    Definition Classes
    ParTrieMapCombiner → Combiner
  22. def canEqual(other: Any): Boolean

    Permalink
    Definition Classes
    ParIterableLike
  23. def clear(): Unit

    Permalink

    Clears the contents of this builder.

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    Definition Classes
    ParTrieMapBuilderParMapLikeGrowableClearable
  24. def clone(): ParTrieMap[K, V]

    Permalink
    Definition Classes
    Cloneable → AnyRef
  25. def collect[B](pf: PartialFunction[A, B]): ParMap[B]

    Permalink

    [use case] Builds a new collection by applying a partial function to all elements of this parallel map

    [use case]

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

    on which the function is defined.

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the parallel map .

    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.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def collect[S, That](pf: PartialFunction[(K, V), S])(implicit bf: CanBuildFrom[ParTrieMap[K, V], S, That]): That

  26. def combine[N <: (K, V), NewTo >: ParTrieMap[K, V]](other: Combiner[N, NewTo]): Combiner[N, NewTo]

    Permalink

    Combines the contents of the receiver builder and the other builder, producing a new builder containing both their elements.

    Combines the contents of the receiver builder and the other builder, producing a new builder containing both their elements.

    This method may combine the two builders by copying them into a larger collection, by producing a lazy view that gets evaluated once result is invoked, or use a merge operation specific to the data structure in question.

    Note that both the receiver builder and other builder become invalidated after the invocation of this method, and should be cleared (see clear) if they are to be used again.

    Also, combining two combiners c1 and c2 for which c1 eq c2 is true, that is, they are the same objects in memory:

    c1.combine(c2)

    always does nothing and returns c1.

    N

    the type of elements contained by the other builder

    NewTo

    the type of collection produced by the other builder

    other

    the other builder

    returns

    the parallel builder containing both the elements of this and the other builder

    Definition Classes
    ParTrieMapCombiner → Combiner
  27. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  28. def combinerFactory: CombinerFactory[(K, V), ParTrieMap[K, V]]

    Permalink

    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
  29. def combinerTaskSupport: TaskSupport

    Permalink
    Definition Classes
    Combiner
  30. def combinerTaskSupport_=(cts: TaskSupport): Unit

    Permalink
    Definition Classes
    Combiner
  31. def companion: GenericCompanion[ParIterable] with GenericParCompanion[ParIterable]

    Permalink

    The factory companion object that builds instances of class ParIterable.

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

    Definition Classes
    ParIterableParIterableGenericParTemplateGenIterableGenTraversableGenericTraversableTemplate
  32. def contains(key: K): Boolean

    Permalink

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key.

    key

    the key

    returns

    true if there is a binding for key in this map, false otherwise.

    Definition Classes
    ParMapLikeGenMapLike
  33. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    Permalink

    [use case] Copies the elements of this parallel map to an array.

    [use case]

    Copies the elements of this parallel map to an array. Fills the given array xs with at most len elements of this parallel map , starting at position start. Copying will stop once either the end of the current parallel map is reached, or the end of the target array is reached, or len elements have been copied.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  34. def copyToArray(xs: Array[A], start: Int): Unit

    Permalink

    [use case] Copies the elements of this parallel map to an array.

    [use case]

    Copies the elements of this parallel map to an array. Fills the given array xs with values of this parallel map , beginning at index start. Copying will stop once either the end of the current parallel map is reached, or the end of the target array is reached.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  35. def copyToArray(xs: Array[A]): Unit

    Permalink

    [use case] Copies the elements of this parallel map to an array.

    [use case]

    Copies the elements of this parallel map to an array. Fills the given array xs with values of this parallel map . Copying will stop once either the end of the current parallel map is reached, or the end of the target array is reached.

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  36. def count(p: ((K, V)) ⇒ Boolean): Int

    Permalink

    Counts the number of elements in the parallel iterable which satisfy a predicate.

    Counts the number of elements in the parallel iterable which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  37. def debugBuffer: ArrayBuffer[String]

    Permalink
    Definition Classes
    ParIterableLike
  38. def default(key: K): V

    Permalink
    Definition Classes
    ParMapLikeGenMapLike
  39. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  40. def drop(n: Int): ParTrieMap[K, V]

    Permalink

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this parallel iterable.

    returns

    a parallel iterable consisting of all elements of this parallel iterable except the first n ones, or else the empty parallel iterable, if this parallel iterable has less than n elements.

    Definition Classes
    ParIterableLikeGenTraversableLike
  41. def dropWhile(pred: ((K, V)) ⇒ Boolean): ParTrieMap[K, V]

    Permalink

    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
    ParIterableLikeGenTraversableLike
  42. def empty: ParTrieMap[K, V]

    Permalink
    Definition Classes
    ParTrieMapParMapParMapParMapLike
  43. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  44. def equals(that: Any): Boolean

    Permalink

    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.

    that

    the other map

    returns

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

    Definition Classes
    GenMapLikeEquals → AnyRef → Any
  45. def exists(p: ((K, V)) ⇒ Boolean): Boolean

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  46. def filter(pred: ((K, V)) ⇒ Boolean): ParTrieMap[K, V]

    Permalink

    Selects all elements of this parallel iterable which satisfy a predicate.

    Selects all elements of this parallel iterable which satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new parallel iterable consisting of all elements of this parallel iterable that satisfy the given predicate p. Their order may not be preserved.

    Definition Classes
    ParIterableLikeGenTraversableLike
  47. def filterKeys(p: (K) ⇒ Boolean): parallel.ParMap[K, V]

    Permalink

    Filters this map by retaining only keys satisfying a predicate.

    Filters this map by retaining only keys satisfying a predicate.

    p

    the predicate used to test keys

    returns

    an immutable map consisting only of those key value pairs of this map where the key satisfies the predicate p. The resulting map wraps the original map without copying any elements.

    Definition Classes
    ParMapLikeGenMapLike
  48. def filterNot(pred: ((K, V)) ⇒ Boolean): ParTrieMap[K, V]

    Permalink

    Selects all elements of this parallel iterable which do not satisfy a predicate.

    Selects all elements of this parallel iterable which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new parallel iterable consisting of all elements of this parallel iterable that do not satisfy the given predicate p. Their order may not be preserved.

    Definition Classes
    ParIterableLikeGenTraversableLike
  49. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  50. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  51. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ParMap[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this parallel map

    [use case]

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

    and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of parallel map . This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    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.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def flatMap[S, That](f: ((K, V)) ⇒ GenTraversableOnce[S])(implicit bf: CanBuildFrom[ParTrieMap[K, V], S, That]): That

  52. def flatten[B]: ParMap[B]

    Permalink

    [use case] Converts this parallel map of traversable collections into a parallel map formed by the elements of these traversable collections.

    [use case]

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

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

    val xs = List(
               Set(1, 2, 3),
               Set(1, 2, 3)
             ).flatten
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(
               List(1, 2, 3),
               List(3, 2, 1)
             ).flatten
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new parallel map resulting from concatenating all element parallel map s.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

    def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): ParIterable[B]

  53. def fold[U >: (K, V)](z: U)(op: (U, U) ⇒ U): U

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  54. def foldLeft[S](z: S)(op: (S, (K, V)) ⇒ S): S

    Permalink

    Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.

    Applies a binary operator to a start value and all elements of this parallel iterable, going left to right.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this parallel iterable. Returns z if this parallel iterable is empty.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  55. def foldRight[S](z: S)(op: ((K, V), S) ⇒ S): S

    Permalink

    Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.

    Applies a binary operator to all elements of this parallel iterable and a start value, going right to left.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this parallel iterable. Returns z if this parallel iterable is empty.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  56. def forall(p: ((K, V)) ⇒ Boolean): Boolean

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  57. def foreach[U](f: ((K, V)) ⇒ U): Unit

    Permalink

    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
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  58. def genericBuilder[B]: Combiner[B, ParIterable[B]]

    Permalink

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

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

    Definition Classes
    GenericParTemplateGenericTraversableTemplate
  59. def genericCombiner[B]: Combiner[B, ParIterable[B]]

    Permalink
    Definition Classes
    GenericParTemplate
  60. def genericMapCombiner[P, Q]: Combiner[(P, Q), ParTrieMap[P, Q]]

    Permalink
    Definition Classes
    GenericParMapTemplate
  61. def get(key: K): Option[V]

    Permalink
    Definition Classes
    ParTrieMapGenMapLike
  62. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  63. def getOrElse(key: A, default: ⇒ B): B

    Permalink

    [use case] Returns the value associated with a key, or a default value if the key is not contained in the map.

    [use case]

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    key

    the key.

    default

    a computation that yields a default value in case no binding for key is found in the map.

    returns

    the value associated with key if it exists, otherwise the result of the default computation.

    Definition Classes
    ParMapLikeGenMapLike
    Full Signature

    def getOrElse[U >: V](key: K, default: ⇒ U): U

  64. def groupBy[K](f: ((K, V)) ⇒ K): immutable.ParMap[K, ParTrieMap[K, V]]

    Permalink

    Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.

    Partitions this parallel iterable into a map of parallel iterables according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new parallel iterable.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to parallel iterables such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a parallel iterable of those elements x for which f(x) equals k.

    Definition Classes
    ParIterableLikeGenTraversableLike
  65. def hasDefiniteSize: Boolean

    Permalink

    Tests whether this parallel iterable is known to have a finite size.

    Tests whether this parallel iterable is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

    true if this collection is known to have finite size, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  66. def hashCode(): Int

    Permalink
    Definition Classes
    GenMapLike → AnyRef → Any
  67. def head: (K, V)

    Permalink

    Selects the first element of this parallel iterable.

    Selects the first element of this parallel iterable.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    NoSuchElementException if the parallel iterable is empty.

  68. def headOption: Option[(K, V)]

    Permalink

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this parallel iterable if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  69. def init: ParTrieMap[K, V]

    Permalink

    Selects all elements except the last.

    Selects all elements except the last.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a parallel iterable consisting of all elements of this parallel iterable except the last one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

  70. def initTaskSupport(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  71. def isDefinedAt(key: K): Boolean

    Permalink

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key. This method, which implements an abstract method of trait PartialFunction, is equivalent to contains.

    key

    the key

    returns

    true if there is a binding for key in this map, false otherwise.

    Definition Classes
    ParMapLikeGenMapLike
  72. def isEmpty: Boolean

    Permalink

    Tests whether the parallel iterable is empty.

    Tests whether the parallel iterable is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

    true if the parallel iterable contains no elements, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  73. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  74. def isStrictSplitterCollection: Boolean

    Permalink

    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
  75. final def isTraversableAgain: Boolean

    Permalink

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  76. def iterator: Splitter[(K, V)]

    Permalink

    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
    ParIterableLikeGenIterableLike
  77. def keySet: parallel.ParSet[K]

    Permalink
    Definition Classes
    ParMapLikeGenMapLike
  78. def keys: parallel.ParIterable[K]

    Permalink

    Collects all keys of this map in an iterable collection.

    Collects all keys of this map in an iterable collection.

    returns

    the keys of this map as an iterable.

    Definition Classes
    ParMapLikeGenMapLike
  79. def keysIterator: IterableSplitter[K]

    Permalink

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    ParMapLikeGenMapLike
  80. def last: (K, V)

    Permalink

    Selects the last element.

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    The last element of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    NoSuchElementException If the parallel iterable is empty.

  81. def lastOption: Option[(K, V)]

    Permalink

    Optionally selects the last element.

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the last element of this parallel iterable$ if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  82. def map[B](f: (A) ⇒ B): ParMap[B]

    Permalink

    [use case] Builds a new collection by applying a function to all elements of this parallel map .

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

    def map[S, That](f: ((K, V)) ⇒ S)(implicit bf: CanBuildFrom[ParTrieMap[K, V], S, That]): That

  83. def mapCompanion: GenericParMapCompanion[ParTrieMap]

    Permalink
    Definition Classes
    ParTrieMapParMapParMapGenericParMapTemplate
  84. def mapResult[NewTo](f: (ParTrieMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]

    Permalink

    Creates a new builder by applying a transformation function to the results of this builder.

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    Definition Classes
    Builder
  85. def mapValues[S](f: (V) ⇒ S): parallel.ParMap[K, S]

    Permalink

    Transforms this map by applying a function to every retrieved value.

    Transforms this map by applying a function to every retrieved value.

    f

    the function used to transform values of this map.

    returns

    a map view which maps every key of this map to f(this(key)). The resulting map wraps the original map without copying any elements.

    Definition Classes
    ParMapLikeGenMapLike
  86. def max: A

    Permalink

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this parallel map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  87. def maxBy[B](f: (A) ⇒ B): A

    Permalink

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this parallel map with the largest value measured by function f.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def maxBy[S](f: ((K, V)) ⇒ S)(implicit cmp: Ordering[S]): (K, V)

  88. def min: A

    Permalink

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this parallel map

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  89. def minBy[B](f: (A) ⇒ B): A

    Permalink

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this parallel map with the smallest value measured by function f.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def minBy[S](f: ((K, V)) ⇒ S)(implicit cmp: Ordering[S]): (K, V)

  90. def mkString: String

    Permalink

    Displays all elements of this parallel iterable in a string.

    Displays all elements of this parallel iterable in a string.

    returns

    a string representation of this parallel iterable. In the resulting string the string representations (w.r.t. the method toString) of all elements of this parallel iterable follow each other without any separator string.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  91. def mkString(sep: String): String

    Permalink

    Displays all elements of this parallel iterable in a string using a separator string.

    Displays all elements of this parallel iterable in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this parallel iterable. In the resulting string the string representations (w.r.t. the method toString) of all elements of this parallel iterable are separated by the string sep.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  92. def mkString(start: String, sep: String, end: String): String

    Permalink

    Displays all elements of this parallel iterable in a string using start, end, and separator strings.

    Displays all elements of this parallel iterable in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this parallel iterable. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this parallel iterable are separated by the string sep.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  93. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  94. def newBuilder: Builder[(K, V), ParIterable[(K, V)]]

    Permalink

    The builder that builds instances of type Traversable[A]

    The builder that builds instances of type Traversable[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateGenericTraversableTemplateHasNewBuilder
  95. def newCombiner: Combiner[(K, V), ParTrieMap[K, V]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParTrieMapParMapGenericParMapTemplateGenericParTemplateHasNewCombiner
  96. def nonEmpty: Boolean

    Permalink

    Tests whether the parallel iterable is not empty.

    Tests whether the parallel iterable is not empty.

    returns

    true if the parallel iterable contains at least one element, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  97. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  98. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  99. def par: ParTrieMap[K, V]

    Permalink

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

    Permalink

    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
    CustomParallelizableParallelizable
  101. def partition(pred: ((K, V)) ⇒ Boolean): (ParTrieMap[K, V], ParTrieMap[K, V])

    Permalink

    Partitions this parallel iterable in two parallel iterables according to a predicate.

    Partitions this parallel iterable in two parallel iterables according to a predicate.

    pred

    the predicate on which to partition.

    returns

    a pair of parallel iterables: the first parallel iterable consists of all elements that satisfy the predicate p and the second parallel iterable consists of all elements that don't. The relative order of the elements in the resulting parallel iterables may not be preserved.

    Definition Classes
    ParIterableLikeGenTraversableLike
  102. def product: A

    Permalink

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this parallel map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the parallel map and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  103. def put(key: K, value: V): Option[V]

    Permalink
    Definition Classes
    ParTrieMapParMapLike
  104. def reduce[U >: (K, V)](op: (U, U) ⇒ U): U

    Permalink

    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
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

  105. def reduceLeft[U >: (K, V)](op: (U, (K, V)) ⇒ U): U

    Permalink
    Definition Classes
    ParIterableLike
  106. def reduceLeftOption[U >: (K, V)](op: (U, (K, V)) ⇒ U): Option[U]

    Permalink

    Optionally applies a binary operator to all elements of this parallel iterable, going left to right.

    Optionally applies a binary operator to all elements of this parallel iterable, going left to right.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) if this parallel iterable is nonempty, None otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  107. def reduceOption[U >: (K, V)](op: (U, U) ⇒ U): Option[U]

    Permalink

    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
    ParIterableLikeGenTraversableOnce
  108. def reduceRight[U >: (K, V)](op: ((K, V), U) ⇒ U): U

    Permalink

    Applies a binary operator to all elements of this parallel iterable, going right to left.

    Applies a binary operator to all elements of this parallel iterable, going right to left.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this parallel iterable, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

  109. def reduceRightOption[U >: (K, V)](op: ((K, V), U) ⇒ U): Option[U]

    Permalink

    Optionally applies a binary operator to all elements of this parallel iterable, going right to left.

    Optionally applies a binary operator to all elements of this parallel iterable, going right to left.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) if this parallel iterable is nonempty, None otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  110. def remove(key: K): Option[V]

    Permalink
  111. def repr: ParTrieMap[K, V]

    Permalink
    Definition Classes
    ParIterableLikeGenTraversableLike
  112. def result(): ParTrieMap[K, V]

    Permalink

    Produces a collection from the added elements.

    Produces a collection from the added elements. The builder's contents are undefined after this operation.

    returns

    a collection containing the elements added to this builder.

    Definition Classes
    ParTrieMapBuilder
  113. def resultWithTaskSupport: ParTrieMap[K, V]

    Permalink

    Constructs the result and sets the appropriate tasksupport object to the resulting collection if this is applicable.

    Constructs the result and sets the appropriate tasksupport object to the resulting collection if this is applicable.

    Definition Classes
    Combiner
  114. def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Permalink

    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
  115. def sameElements(that: GenIterable[A]): Boolean

    Permalink

    [use case] Checks if the other iterable collection contains the same elements in the same order as this parallel map .

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this parallel map .

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    Note: will not terminate for infinite-sized collections.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def sameElements[U >: (K, V)](that: GenIterable[U]): Boolean

  116. def scan(z: (K, V))(op: ((K, V), (K, V)) ⇒ (K, V)): ParMap[(K, V)]

    Permalink

    [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
    ParIterableLikeGenTraversableLike
    Full Signature

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

  117. def scanBlockSize: Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  118. def scanLeft[S, That](z: S)(op: (S, (K, V)) ⇒ S)(implicit bf: CanBuildFrom[ParTrieMap[K, V], S, That]): That

    Permalink

    Produces a collection containing cumulative results of applying the operator going left to right.

    Produces a collection containing cumulative results of applying the operator going left to right.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    ParIterableLikeGenTraversableLike
  119. def scanRight[S, That](z: S)(op: ((K, V), S) ⇒ S)(implicit bf: CanBuildFrom[ParTrieMap[K, V], S, That]): That

    Permalink

    Produces a collection containing cumulative results of applying the operator going right to left.

    Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    Example:

    List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    ParIterableLikeGenTraversableLike
  120. def seq: TrieMap[K, V]

    Permalink
  121. def sequentially[S, That <: Parallel](b: (TrieMap[K, V]) ⇒ Parallelizable[S, That]): ParTrieMap[K, V]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  122. def size: Int

    Permalink

    The size of this parallel map .

    The size of this parallel map .

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this parallel map .

    Definition Classes
    ParTrieMapSizingGenTraversableLikeGenTraversableOnce
  123. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Permalink

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed to be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    delta

    a correction to add to the coll.size to produce the size hint.

    Definition Classes
    Builder
  124. def sizeHint(coll: TraversableLike[_, _]): Unit

    Permalink

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed to be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    Definition Classes
    Builder
  125. def sizeHint(size: Int): Unit

    Permalink

    Gives a hint how many elements are expected to be added when the next result is called.

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    Definition Classes
    Builder
  126. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Permalink

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    boundingColl

    the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

    Definition Classes
    Builder
  127. def slice(unc_from: Int, unc_until: Int): ParTrieMap[K, V]

    Permalink

    Selects an interval of elements.

    Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

    from <= indexOf(x) < until

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    unc_from

    the lowest index to include from this parallel iterable.

    unc_until

    the lowest index to EXCLUDE from this parallel iterable.

    returns

    a parallel iterable containing the elements greater than or equal to index from extending up to (but not including) index until of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableLike
  128. def span(pred: ((K, V)) ⇒ Boolean): (ParTrieMap[K, V], ParTrieMap[K, V])

    Permalink

    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
    ParIterableLikeGenTraversableLike
  129. def splitAt(n: Int): (ParTrieMap[K, V], ParTrieMap[K, V])

    Permalink

    Splits this parallel iterable into two at a given position.

    Splits this parallel iterable into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of parallel iterables consisting of the first n elements of this parallel iterable, and the other elements.

    Definition Classes
    ParIterableLikeGenTraversableLike
  130. def splitter: ParTrieMapSplitter[K, V]

    Permalink

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

    Creates a new parallel iterator used to traverse the elements of this parallel collection. This iterator is more specific than the iterator of the returned by iterator, and augmented with additional accessor and transformer methods.

    returns

    a parallel iterator

    Definition Classes
    ParTrieMapParIterableLike
  131. def stringPrefix: String

    Permalink

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this parallel map . By default the string prefix is the simple name of the collection class parallel map .

    Definition Classes
    ParTrieMapParMapParIterableGenTraversableLike
  132. def sum: A

    Permalink

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this parallel map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the parallel map and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  133. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  134. def tail: ParTrieMap[K, V]

    Permalink

    Selects all elements except the first.

    Selects all elements except the first.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a parallel iterable consisting of all elements of this parallel iterable except the first one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown

    UnsupportedOperationException if the parallel iterable is empty.

  135. def take(n: Int): ParTrieMap[K, V]

    Permalink

    Selects first n elements.

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take from this parallel iterable.

    returns

    a parallel iterable consisting only of the first n elements of this parallel iterable, or else the whole parallel iterable, if it has less than n elements.

    Definition Classes
    ParIterableLikeGenTraversableLike
  136. def takeWhile(pred: ((K, V)) ⇒ Boolean): ParTrieMap[K, V]

    Permalink

    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
    ParIterableLikeGenTraversableLike
  137. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  138. def tasksupport: TaskSupport

    Permalink

    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

  139. def tasksupport_=(ts: TaskSupport): Unit

    Permalink

    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 scala.concurrent.forkjoin.ForkJoinPool(2))
    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  140. def to[Col[_]]: Col[A]

    Permalink

    [use case] Converts this parallel map into another by copying all elements.

    [use case]

    Converts this parallel map into another by copying all elements.

    Note: will not terminate for infinite-sized collections.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this parallel map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]

  141. def toArray: Array[A]

    Permalink

    [use case] Converts this parallel map to an array.

    [use case]

    Converts this parallel map to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this parallel map . An ClassTag must be available for the element type of this parallel map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def toArray[U >: (K, V)](implicit arg0: ClassTag[U]): Array[U]

  142. def toBuffer[U >: (K, V)]: Buffer[U]

    Permalink

    Uses the contents of this parallel iterable to create a new mutable buffer.

    Uses the contents of this parallel iterable to create a new mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  143. def toIndexedSeq: immutable.IndexedSeq[(K, V)]

    Permalink

    Converts this parallel iterable to an indexed sequence.

    Converts this parallel iterable to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  144. def toIterable: ParIterable[(K, V)]

    Permalink

    Converts this parallel iterable to an iterable collection.

    Converts this parallel iterable to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterable containing all elements of this parallel iterable.

    Definition Classes
    ParIterableParIterableLikeGenTraversableOnce
  145. def toIterator: scala.Iterator[(K, V)]

    Permalink

    Returns an Iterator over the elements in this parallel iterable.

    Returns an Iterator over the elements in this parallel iterable. Will return the same Iterator if this instance is already an Iterator.

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  146. def toList: List[(K, V)]

    Permalink

    Converts this parallel iterable to a list.

    Converts this parallel iterable to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  147. def toMap[T, U]: collection.Map[T, U]

    Permalink

    [use case] Converts this parallel map to a map.

    [use case]

    Converts this parallel map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    Note: will not terminate for infinite-sized collections.

    returns

    a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this parallel map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

    def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.ParMap[K, V]

  148. def toParCollection[U >: (K, V), That](cbf: () ⇒ Combiner[U, That]): That

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  149. def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[(K, V), (K, V)]): That

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  150. def toSeq: ParSeq[(K, V)]

    Permalink

    Converts this parallel iterable to a sequence.

    Converts this parallel iterable to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.

    Note: will not terminate for infinite-sized collections.

    returns

    a sequence containing all elements of this parallel iterable.

    Definition Classes
    ParIterableParIterableLikeGenTraversableOnce
  151. def toSet[U >: (K, V)]: immutable.ParSet[U]

    Permalink

    Converts this parallel iterable to a set.

    Converts this parallel iterable to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  152. def toStream: Stream[(K, V)]

    Permalink

    Converts this parallel iterable to a stream.

    Converts this parallel iterable to a stream.

    returns

    a stream containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  153. def toString(): String

    Permalink
    Definition Classes
    ParIterableLike → AnyRef → Any
  154. def toTraversable: GenTraversable[(K, V)]

    Permalink

    Converts this parallel iterable to an unspecified Traversable.

    Converts this parallel iterable to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  155. def toVector: Vector[(K, V)]

    Permalink

    Converts this parallel iterable to a Vector.

    Converts this parallel iterable to a Vector.

    Note: will not terminate for infinite-sized collections.

    returns

    a vector containing all elements of this parallel iterable.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  156. def transpose[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): ParIterable[ParIterable[B]]

    Permalink

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

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a two-dimensional collection of collections which has as nth row the nth column of this collection.

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

    Exceptions thrown

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

  157. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (ParIterable[A1], ParIterable[A2])

    Permalink

    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 = Traversable(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (Traversable(1, 2, 3),
    //        Traversable(one, two, three))
    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  158. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (ParIterable[A1], ParIterable[A2], ParIterable[A3])

    Permalink

    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 = Traversable(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (Traversable(1, 2, 3),
    //        Traversable(one, two, three),
    //        Traversable(1, 2, 3))
    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

    asTriple

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  159. def update(key: K, value: V): Unit

    Permalink
  160. def updated[U >: V](key: K, value: U): ParMap[K, U]

    Permalink
    Definition Classes
    ParMapParMapGenMap
  161. def values: parallel.ParIterable[V]

    Permalink

    Collects all values of this map in an iterable collection.

    Collects all values of this map in an iterable collection.

    returns

    the values of this map as an iterable.

    Definition Classes
    ParMapLikeGenMapLike
  162. def valuesIterator: IterableSplitter[V]

    Permalink

    Creates an iterator for all values in this map.

    Creates an iterator for all values in this map.

    returns

    an iterator over all values that are associated with some key in this map.

    Definition Classes
    ParMapLikeGenMapLike
  163. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  164. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  165. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  166. def withDefault(d: (K) ⇒ V): ParMap[K, V]

    Permalink

    The same map with a given default function.

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

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

    d

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

    returns

    a wrapper of the map with a default value

    Definition Classes
    ParMap
  167. def withDefaultValue(d: V): ParMap[K, V]

    Permalink

    The same map with a given default value.

    The same map with a given default value.

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

    d

    default value used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    ParMap
  168. def withFilter(pred: ((K, V)) ⇒ Boolean): ParTrieMap[K, V]

    Permalink
    Definition Classes
    ParIterableLike
  169. def wrap[R](body: ⇒ R): NonDivisible[R]

    Permalink
    Attributes
    protected
    Definition Classes
    ParIterableLike
  170. def zip[B](that: GenIterable[B]): ParMap[(A, B)]

    Permalink

    [use case] Returns a parallel map formed from this parallel map and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a parallel map formed from this parallel map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new parallel map containing pairs consisting of corresponding elements of this parallel map and that. The length of the returned collection is the minimum of the lengths of this parallel map and that.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zip[U >: (K, V), S, That](that: GenIterable[S])(implicit bf: CanBuildFrom[ParTrieMap[K, V], (U, S), That]): That

  171. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): ParMap[(A, B)]

    Permalink

    [use case] Returns a parallel map formed from this parallel map and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a parallel map formed from this parallel map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this parallel map is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this parallel map .

    returns

    a new parallel map containing pairs consisting of corresponding elements of this parallel map and that. The length of the returned collection is the maximum of the lengths of this parallel map and that. If this parallel map is shorter than that, thisElem values are used to pad the result. If that is shorter than this parallel map , thatElem values are used to pad the result.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zipAll[S, U >: (K, V), That](that: GenIterable[S], thisElem: U, thatElem: S)(implicit bf: CanBuildFrom[ParTrieMap[K, V], (U, S), That]): That

  172. def zipWithIndex: ParMap[(A, Int)]

    Permalink

    [use case] Zips this parallel map with its indices.

    [use case]

    Zips this parallel map with its indices.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    A new parallel map containing pairs consisting of all elements of this parallel map paired with their index. Indices start at 0.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[U >: (K, V), That](implicit bf: CanBuildFrom[ParTrieMap[K, V], (U, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

Deprecated Value Members

  1. def view: IterableView[(K, V), TrieMap[K, V]]

    Permalink
    Definition Classes
    ParIterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Use .seq.view instead

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from ParTrieMapCombiner[K, V]

Inherited from Combiner[(K, V), ParTrieMap[K, V]]

Inherited from Sizing

Inherited from Builder[(K, V), ParTrieMap[K, V]]

Inherited from ParMap[K, V]

Inherited from ParMapLike[K, V, ParTrieMap[K, V], TrieMap[K, V]]

Inherited from mutable.Cloneable[ParTrieMap[K, V]]

Inherited from Cloneable

Inherited from java.lang.Cloneable

Inherited from Shrinkable[K]

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from ParIterable[(K, V)]

Inherited from Mutable

Inherited from parallel.ParMap[K, V]

Inherited from parallel.ParMapLike[K, V, ParTrieMap[K, V], TrieMap[K, V]]

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

Inherited from ParIterableLike[(K, V), ParTrieMap[K, V], TrieMap[K, V]]

Inherited from Parallel

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

Inherited from GenericParMapTemplate[K, V, ParTrieMap]

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

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

Inherited from GenMap[K, V]

Inherited from GenIterable[(K, V)]

Inherited from GenTraversable[(K, V)]

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

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

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

Inherited from Equals

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

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

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

Inherited from GenTraversableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped