Packages

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

A parallel hash map.

ParHashMap is a parallel map which internally keeps elements within a hash table. It uses chaining to resolve collisions.

K

type of the keys in the parallel hash map

V

type of the values in the parallel hash map

Self Type
ParHashMap[K, V]
Annotations
@SerialVersionUID()
Source
ParHashMap.scala
Linear Supertypes
Serializable, java.io.Serializable, ParHashTable[K, DefaultEntry[K, V]], HashTable[K, DefaultEntry[K, V]], HashUtils[K], ParMap[K, V], ParMapLike[K, V, ParHashMap[K, V], HashMap[K, V]], mutable.Cloneable[ParHashMap[K, V]], Cloneable, java.lang.Cloneable, Shrinkable[K], Growable[(K, V)], Clearable, ParIterable[(K, V)], Mutable, parallel.ParMap[K, V], parallel.ParMapLike[K, V, ParHashMap[K, V], HashMap[K, V]], parallel.ParIterable[(K, V)], ParIterableLike[(K, V), ParHashMap[K, V], HashMap[K, V]], Parallel, CustomParallelizable[(K, V), ParHashMap[K, V]], GenericParMapTemplate[K, V, ParHashMap], GenericParTemplate[(K, V), ParIterable], HasNewCombiner[(K, V), ParHashMap[K, V]], GenMap[K, V], GenIterable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), ParIterable], HasNewBuilder[(K, V), scala.collection.parallel.mutable.ParIterable[(K, V)] @scala.annotation.unchecked.uncheckedVariance], GenMapLike[K, V, ParHashMap[K, V]], Equals, GenIterableLike[(K, V), ParHashMap[K, V]], GenTraversableLike[(K, V), ParHashMap[K, V]], Parallelizable[(K, V), ParHashMap[K, V]], GenTraversableOnce[(K, V)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParHashMap
  2. Serializable
  3. Serializable
  4. ParHashTable
  5. HashTable
  6. HashUtils
  7. ParMap
  8. ParMapLike
  9. Cloneable
  10. Cloneable
  11. Cloneable
  12. Shrinkable
  13. Growable
  14. Clearable
  15. ParIterable
  16. Mutable
  17. ParMap
  18. ParMapLike
  19. ParIterable
  20. ParIterableLike
  21. Parallel
  22. CustomParallelizable
  23. GenericParMapTemplate
  24. GenericParTemplate
  25. HasNewCombiner
  26. GenMap
  27. GenIterable
  28. GenTraversable
  29. GenericTraversableTemplate
  30. HasNewBuilder
  31. GenMapLike
  32. Equals
  33. GenIterableLike
  34. GenTraversableLike
  35. Parallelizable
  36. GenTraversableOnce
  37. AnyRef
  38. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ParHashMap()

Type Members

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

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

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

    R

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

    Tp

    the representation type of the task at hand.

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

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

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

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

    Sequentially performs one task after another.

    Sequentially performs one task after another.

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

    A parallel iterator returning all the entries.

    A parallel iterator returning all the entries.

    Definition Classes
    ParHashTable

Value Members

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

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

    Equivalent to x.hashCode except for boxed numeric types and null.

    Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  3. def +[U >: V](kv: (K, U)): ParMap[K, U]
    Definition Classes
    ParMapLikeGenMapLike
  4. def ++[U >: (K, V), That](that: GenTraversableOnce[U])(implicit bf: CanBuildFrom[ParHashMap[K, V], U, That]): That

    Returns a new parallel iterable containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

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

    returns

    a new collection of type That which contains all elements of this parallel iterable followed by all elements of that.

    Definition Classes
    ParIterableLikeGenTraversableLike
  5. def ++=(xs: TraversableOnce[(K, V)]): ParHashMap.this.type

    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)): ParHashMap.this.type

    adds a single element to this parallel hash map .

    adds a single element to this parallel hash map .

    returns

    the parallel hash map itself

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

    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): ParHashMap[K, V]
    Definition Classes
    ParMapLikeGenMapLike
  9. def --=(xs: TraversableOnce[K]): ParHashMap.this.type

    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): ParHashMap.this.type

    Removes a single element from this parallel hash map .

    Removes a single element from this parallel hash map .

    returns

    the parallel hash map itself

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

    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 ->[B](y: B): (ParHashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to ArrowAssoc[ParHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  13. def /:[S](z: S)(op: (S, (K, V)) ⇒ S): S

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

    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
  15. final def ==(arg0: Any): Boolean

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    Definition Classes
    AnyRef → Any
  16. val _loadFactor: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  17. def addEntry(e: DefaultEntry[K, V]): Unit

    Add entry to table pre: no entry with same key exists

    Add entry to table pre: no entry with same key exists

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  18. def aggregate[S](z: ⇒ S)(seqop: (S, (K, V)) ⇒ S, combop: (S, S) ⇒ S): S

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the set, while combop would concatenate two sets from different partitions together. The initial value z would be an empty set.

    pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    S

    the type of accumulated results

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    ParIterableLikeGenTraversableOnce
  19. def alwaysInitSizeMap: Boolean
    Definition Classes
    ParHashTableHashTable
  20. def apply(key: K): V
    Definition Classes
    ParMapLikeGenMapLike
  21. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown

    ClassCastException if the receiver object is not an instance of the erasure of type T0.

  22. def bf2seq[S, That](bf: CanBuildFrom[ParHashMap[K, V], S, That]): CanBuildFrom[HashMap[K, V], S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  23. implicit def builder2ops[Elem, To](cb: Builder[Elem, To]): BuilderOps[Elem, To]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  24. def calcSizeMapSize(tableLength: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  25. def canEqual(other: Any): Boolean
    Definition Classes
    ParIterableLike
  26. def clear(): Unit

    Clears the parallel hash map 's contents.

    Clears the parallel hash map 's contents. After this operation, the parallel hash map is empty.

    Definition Classes
    ParHashMapClearableGrowableParMapLike
  27. def clearTable(): Unit

    Remove all entries from table

    Remove all entries from table

    Attributes
    protected
    Definition Classes
    HashTable
  28. def clone(): ParHashMap[K, V]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes
    Cloneable → AnyRef
    Note

    not specified by SLS as a member of AnyRef

  29. def collect[B](pf: PartialFunction[A, B]): ParHashMap[B]

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

    [use case]

    Builds a new collection by applying a partial function to all elements of this parallel hash 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 hash map .

    returns

    a new parallel hash 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[ParHashMap[K, V], S, That]): That

  30. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  31. def combinerFactory: CombinerFactory[(K, V), ParHashMap[K, V]]

    Creates a combiner factory.

    Creates a combiner factory. Each combiner factory instance is used once per invocation of a parallel transformer method for a single collection.

    The default combiner factory creates a new combiner every time it is requested, unless the combiner is thread-safe as indicated by its canBeShared method. In this case, the method returns a factory which returns the same combiner each time. This is typically done for concurrent parallel collections, the combiners of which allow thread safe access.

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  32. def companion: GenericCompanion[ParIterable] with GenericParCompanion[ParIterable]

    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
    ParIterableGenericTraversableTemplateGenTraversableGenIterableGenericParTemplateParIterable
  33. def contains(key: K): Boolean

    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
  34. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

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

    [use case]

    Copies the elements of this parallel hash map to an array. Fills the given array xs with at most len elements of this parallel hash map , starting at position start. Copying will stop once either the end of the current parallel hash 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

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

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

    [use case]

    Copies the elements of this parallel hash map to an array. Fills the given array xs with values of this parallel hash map , beginning at index start. Copying will stop once either the end of the current parallel hash 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

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

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

    [use case]

    Copies the elements of this parallel hash map to an array. Fills the given array xs with values of this parallel hash map . Copying will stop once either the end of the current parallel hash 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

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

    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
  38. def createNewEntry[V1](key: K, value: V1): Entry

    Creates new entry to be immediately inserted into the hashtable.

    Creates new entry to be immediately inserted into the hashtable. This method is guaranteed to be called only once and in case that the entry will be added. In other words, an implementation may be side-effecting.

    Attributes
    protected
    Definition Classes
    ParHashMapHashTable
  39. def debugBuffer: ArrayBuffer[String]
    Definition Classes
    ParIterableLike
  40. def default(key: K): V
    Definition Classes
    ParMapLikeGenMapLike
  41. implicit def delegatedSignalling2ops[PI <: DelegatedSignalling](it: PI): SignallingOps[PI]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  42. def drop(n: Int): ParHashMap[K, V]

    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
  43. def dropWhile(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

    Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.

    Drops all elements in the longest prefix of elements that satisfy the predicate, and returns a collection composed of the remaining elements.

    This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state. The index flag is initially set to maximum integer value.

    pred

    the predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  44. def elemEquals(key1: K, key2: K): Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  45. def elemHashCode(key: K): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  46. def empty: ParHashMap[K, V]
    Definition Classes
    ParHashMapParMapLikeParMapParMap
  47. def ensuring(cond: (ParHashMap[K, V]) ⇒ Boolean, msg: ⇒ Any): ParHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. def ensuring(cond: (ParHashMap[K, V]) ⇒ Boolean): ParHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  49. def ensuring(cond: Boolean, msg: ⇒ Any): ParHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  50. def ensuring(cond: Boolean): ParHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  51. def entriesIterator: Iterator[DefaultEntry[K, V]]

    An iterator returning all entries.

    An iterator returning all entries.

    Attributes
    protected
    Definition Classes
    HashTable
  52. final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (that) is a reference to the receiver object (this).

    Tests whether the argument (that) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

    true if the argument is a reference to the receiver object; false otherwise.

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

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

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

    that

    the other map

    returns

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

    Definition Classes
    GenMapLikeAny → AnyRef → Equals
  54. def exists(p: ((K, V)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some element of this parallel iterable.

    Tests whether a predicate holds for some element of this parallel iterable.

    This method will use abort signalling capabilities. This means that splitters may send and read abort signals.

    p

    a predicate used to test elements

    returns

    true if p holds for some element, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  55. def filter(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

    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
  56. def filterKeys(p: (K) ⇒ Boolean): parallel.ParMap[K, V]

    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
  57. def filterNot(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

    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
  58. def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
    Note

    not specified by SLS as a member of AnyRef

  59. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

    Finds some element in the collection for which the predicate holds, if such an element exists.

    Finds some element in the collection for which the predicate holds, if such an element exists. The element may not necessarily be the first such element in the iteration order.

    If there are multiple elements obeying the predicate, the choice is nondeterministic.

    This method will use abort signalling capabilities. This means that splitters may send and read abort signals.

    p

    predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  60. def findEntry(key: K): DefaultEntry[K, V]

    Find entry with given key in table, null if not found.

    Find entry with given key in table, null if not found.

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  61. def findOrAddEntry[B](key: K, value: B): DefaultEntry[K, V]

    Find entry with given key in table, or add new one if not found.

    Find entry with given key in table, or add new one if not found. May be somewhat faster then findEntry/addEntry pair as it computes entry's hash index only once. Returns entry found in table or null. New entries are created by calling createNewEntry method.

    Attributes
    protected
    Definition Classes
    HashTable
  62. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ParHashMap[B]

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

    [use case]

    Builds a new collection by applying a function to all elements of this parallel hash 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 hash 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 hash map resulting from applying the given collection-valued function f to each element of this parallel hash map and concatenating the results.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

  63. def flatten[B]: ParHashMap[B]

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

    [use case]

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

    The resulting collection's type will be guided by the static type of parallel hash 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 hash map resulting from concatenating all element parallel hash map s.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

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

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

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    U

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

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)

    op

    a binary operator that must be associative

    returns

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

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

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

    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
  67. def forall(p: ((K, V)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this parallel iterable.

    Tests whether a predicate holds for all elements of this parallel iterable.

    This method will use abort signalling capabilities. This means that splitters may send and read abort signals.

    p

    a predicate used to test elements

    returns

    true if p holds for all elements, false otherwise

    Definition Classes
    ParIterableLikeGenTraversableOnce
  68. def foreach[U](f: ((K, V)) ⇒ U): Unit

    Applies a function f to all the elements of parallel iterable in an undefined order.

    Applies a function f to all the elements of parallel iterable in an undefined order.

    U

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

    f

    function applied to each element

    Definition Classes
    ParIterableLikeGenTraversableOnceGenTraversableLike
  69. def foreachEntry[U](f: (DefaultEntry[K, V]) ⇒ U): Unit

    Avoid iterator for a 2x faster traversal.

    Avoid iterator for a 2x faster traversal.

    Attributes
    protected
    Definition Classes
    HashTable
  70. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to StringFormat[ParHashMap[K, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  71. def genericBuilder[B]: Combiner[B, ParIterable[B]]

    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
  72. def genericCombiner[B]: Combiner[B, ParIterable[B]]
    Definition Classes
    GenericParTemplate
  73. def genericMapCombiner[P, Q]: Combiner[(P, Q), ParHashMap[P, Q]]
    Definition Classes
    GenericParMapTemplate
  74. def get(key: K): Option[V]
    Definition Classes
    ParHashMapGenMapLike
  75. final def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    AnyRef → Any
  76. def getOrElse(key: K, default: ⇒ V): V

    [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

  77. def groupBy[K](f: ((K, V)) ⇒ K): immutable.ParMap[K, ParHashMap[K, V]]

    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
  78. def hasDefiniteSize: Boolean

    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
  79. def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

    the hash code value for this object.

    Definition Classes
    GenMapLikeAny → AnyRef
  80. def head: (K, V)

    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.

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

    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
  82. final def improve(hcode: Int, seed: Int): Int

    Defer to a high-quality hash in scala.util.hashing.

    Defer to a high-quality hash in scala.util.hashing. The goal is to distribute across bins as well as possible even if a hash code has low entropy at some bits.

    OLD VERSION - quick, but bad for sequence 0-10000 - little entropy in higher bits - since 2003

    var h: Int = hcode + ~(hcode << 9)
    h = h ^ (h >>> 14)
    h = h + (h << 4)
    h ^ (h >>> 10)

    the rest of the computation is due to scala/bug#5293

    Attributes
    protected
    Definition Classes
    HashUtils
  83. final def index(hcode: Int): Int

    Note: we take the most significant bits of the hashcode, not the lower ones this is of crucial importance when populating the table in parallel

    Note: we take the most significant bits of the hashcode, not the lower ones this is of crucial importance when populating the table in parallel

    Attributes
    protected
    Definition Classes
    HashTable
  84. def init: ParHashMap[K, V]

    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.

  85. def initTaskSupport(): Unit
    Attributes
    protected
    Definition Classes
    ParIterableLike
  86. def initWithContents(c: Contents[K, DefaultEntry[K, V]]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  87. def initialSize: Int

    The initial size of the hash table.

    The initial size of the hash table.

    Attributes
    protected
    Definition Classes
    HashTable
  88. def isDefinedAt(key: K): Boolean

    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
  89. def isEmpty: Boolean

    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
  90. final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    Definition Classes
    Any
  91. def isSizeMapDefined: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  92. def isStrictSplitterCollection: Boolean

    Denotes whether this parallel collection has strict splitters.

    Denotes whether this parallel collection has strict splitters.

    This is true in general, and specific collection instances may choose to override this method. Such collections will fail to execute methods which rely on splitters being strict, i.e. returning a correct value in the remaining method.

    This method helps ensure that such failures occur on method invocations, rather than later on and in unpredictable ways.

    Definition Classes
    ParIterableLike
  93. final def isTraversableAgain: Boolean

    Tests whether this parallel iterable can be repeatedly traversed.

    Tests whether this parallel iterable can be repeatedly traversed.

    returns

    true

    Definition Classes
    ParIterableLikeGenTraversableOnceGenTraversableLike
  94. def iterator: Splitter[(K, V)]

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

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

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

    returns

    a split iterator

    Definition Classes
    ParIterableLikeGenIterableLike
  95. def keySet: parallel.ParSet[K]
    Definition Classes
    ParMapLikeGenMapLike
  96. def keys: parallel.ParIterable[K]

    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
  97. def keysIterator: IterableSplitter[K]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

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

    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.

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

    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
  100. def map[B](f: (A) ⇒ B): ParHashMap[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

  101. def mapCompanion: GenericParMapCompanion[ParHashMap]
    Definition Classes
    ParHashMapGenericParMapTemplateParMapParMap
  102. def mapValues[S](f: (V) ⇒ S): parallel.ParMap[K, S]

    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
  103. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this parallel hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    [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 hash 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)

  105. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this parallel hash map

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    [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 hash 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)

  107. def mkString: String

    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
  108. def mkString(sep: String): String

    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"

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

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

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

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

    true if the argument is not a reference to the receiver object; false otherwise.

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

    The builder that builds instances of type Traversable[A]

    The builder that builds instances of type Traversable[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateHasNewBuilderGenericTraversableTemplate
  112. def newCombiner: ParHashMapCombiner[K, V]
    Attributes
    protected[this]
    Definition Classes
    ParHashMapHasNewCombinerGenericParTemplateGenericParMapTemplateParMap
  113. def nnSizeMapAdd(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  114. def nnSizeMapRemove(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  115. def nnSizeMapReset(tableLength: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  116. def nonEmpty: Boolean

    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
  117. final def notify(): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  118. final def notifyAll(): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  119. def par: ParHashMap[K, V]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    ParIterableLikeParallelizableCustomParallelizable
  120. def parCombiner: Combiner[(K, V), ParHashMap[K, V]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizableParallelizable
  121. def partition(pred: ((K, V)) ⇒ Boolean): (ParHashMap[K, V], ParHashMap[K, V])

    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
  122. def product: A

    [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 hash 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 hash 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

  123. def put(key: K, value: V): Option[V]
    Definition Classes
    ParHashMapParMapLike
  124. def reduce[U >: (K, V)](op: (U, U) ⇒ U): U

    Reduces the elements of this sequence using the specified associative binary operator.

    Reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown

    UnsupportedOperationException if this parallel iterable is empty.

  125. def reduceLeft[U >: (K, V)](op: (U, (K, V)) ⇒ U): U
    Definition Classes
    ParIterableLike
  126. def reduceLeftOption[U >: (K, V)](op: (U, (K, V)) ⇒ U): Option[U]

    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
  127. def reduceOption[U >: (K, V)](op: (U, U) ⇒ U): Option[U]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    U

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  128. def reduceRight[U >: (K, V)](op: ((K, V), U) ⇒ U): U

    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.

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

    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
  130. def remove(key: K): Option[V]
  131. def removeEntry(key: K): DefaultEntry[K, V]

    Remove entry from table if present.

    Remove entry from table if present.

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  132. def repr: ParHashMap[K, V]
    Definition Classes
    ParIterableLikeGenTraversableLike
  133. def reuse[S, That](oldc: Option[Combiner[S, That]], newc: Combiner[S, That]): Combiner[S, That]

    Optionally reuses an existing combiner for better performance.

    Optionally reuses an existing combiner for better performance. By default it doesn't - subclasses may override this behaviour. The provided combiner oldc that can potentially be reused will be either some combiner from the previous computational task, or None if there was no previous phase (in which case this method must return newc).

    oldc

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

    newc

    The new, empty combiner that can be used.

    returns

    Either newc or oldc.

    Attributes
    protected
    Definition Classes
    ParIterableLike
  134. def sameElements(that: GenIterable[A]): Boolean

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

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this parallel hash 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

  135. def scan(z: (K, V))(op: ((K, V), (K, V)) ⇒ (K, V)): ParHashMap[(K, V)]

    [use case] Computes a prefix scan of the elements of the collection.

    [use case]

    Computes a prefix scan of the elements of the collection.

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

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a new parallel hash map containing the prefix scan of the elements in this parallel hash map

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

  136. def scanBlockSize: Int
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  137. def scanLeft[S, That](z: S)(op: (S, (K, V)) ⇒ S)(implicit bf: CanBuildFrom[ParHashMap[K, V], S, That]): That

    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 the new element type B.

    returns

    collection with intermediate results

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

    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 the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    ParIterableLikeGenTraversableLike
  139. val seedvalue: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  140. def seq: HashMap[K, V]
  141. def sequentially[S, That <: Parallel](b: (HashMap[K, V]) ⇒ Parallelizable[S, That]): ParHashMap[K, V]
    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  142. def size: Int

    The size of this parallel hash map .

    The size of this parallel hash map .

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this parallel hash map .

    Definition Classes
    ParHashMapGenTraversableOnceGenTraversableLike
  143. def sizeHintIfCheap: Int

    The size of this collection or iterator, if it can be cheaply computed

    The size of this collection or iterator, if it can be cheaply computed

    returns

    the number of elements in this collection or iterator, or -1 if the size cannot be determined cheaply

    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  144. final def sizeMapBucketBitSize: Int
    Attributes
    protected
    Definition Classes
    HashUtils
  145. final def sizeMapBucketSize: Int
    Attributes
    protected
    Definition Classes
    HashUtils
  146. def sizeMapDisable(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  147. def sizeMapInit(tableLength: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  148. def sizeMapInitAndRebuild(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( message = ... , since = "2.11.0" )
  149. val sizemap: Array[Int]

    The array keeping track of the number of elements in 32 element blocks.

    The array keeping track of the number of elements in 32 element blocks.

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  150. def slice(unc_from: Int, unc_until: Int): ParHashMap[K, V]

    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
  151. def span(pred: ((K, V)) ⇒ Boolean): (ParHashMap[K, V], ParHashMap[K, V])

    Splits this parallel iterable into a prefix/suffix pair according to a predicate.

    Splits this parallel iterable into a prefix/suffix pair according to a predicate.

    This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state. The index flag is initially set to maximum integer value.

    pred

    the predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  152. def splitAt(n: Int): (ParHashMap[K, V], ParHashMap[K, V])

    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
  153. def splitter: ParHashMapIterator

    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
    ParHashMapParIterableLike
  154. def stringPrefix: String

    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 hash map . By default the string prefix is the simple name of the collection class parallel hash map .

    Definition Classes
    ParHashMapGenTraversableLikeParIterableParMap
  155. def sum: A

    [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 hash 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 hash 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

  156. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  157. val table: Array[HashEntry[K, DefaultEntry[K, V]]]

    The actual hash table.

    The actual hash table.

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  158. val tableSize: Int

    The number of mappings contained in this hash table.

    The number of mappings contained in this hash table.

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  159. def tableSizeSeed: Int
    Attributes
    protected
    Definition Classes
    HashTable
  160. def tail: ParHashMap[K, V]

    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.

  161. def take(n: Int): ParHashMap[K, V]

    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
  162. def takeWhile(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

    Takes the longest prefix of elements that satisfy the predicate.

    Takes the longest prefix of elements that satisfy the predicate.

    This method will use indexFlag signalling capabilities. This means that splitters may set and read the indexFlag state. The index flag is initially set to maximum integer value.

    pred

    the predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  163. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  164. def tasksupport: TaskSupport

    The task support object which is responsible for scheduling and load-balancing tasks to processors.

    The task support object which is responsible for scheduling and load-balancing tasks to processors.

    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

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

    Changes the task support object which is responsible for scheduling and load-balancing tasks to processors.

    Changes the task support object which is responsible for scheduling and load-balancing tasks to processors.

    A task support object can be changed in a parallel collection after it has been created, but only during a quiescent period, i.e. while there are no concurrent invocations to parallel collection methods.

    Here is a way to change the task support of a parallel collection:

    import scala.collection.parallel._
    val pc = mutable.ParArray(1, 2, 3)
    pc.tasksupport = new ForkJoinTaskSupport(
      new java.util.concurrent.ForkJoinPool(2))
    Definition Classes
    ParIterableLike
    See also

    scala.collection.parallel.TaskSupport

  166. val threshold: Int

    The next size value at which to resize (capacity * load factor).

    The next size value at which to resize (capacity * load factor).

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  167. def to[Col[_]]: Col[A]

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

    [use case]

    Converts this parallel hash 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 hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  168. def toArray: Array[A]

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

    [use case]

    Converts this parallel hash map to an array.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

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

    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
  170. def toIndexedSeq: immutable.IndexedSeq[(K, V)]

    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
  171. def toIterable: ParIterable[(K, V)]

    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
    ParIterableGenTraversableOnceParIterableLike
  172. def toIterator: scala.Iterator[(K, V)]

    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
  173. def toList: List[(K, V)]

    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
  174. def toMap[T, U]: collection.Map[T, U]

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

    [use case]

    Converts this parallel hash 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 hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Full Signature

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

  175. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to CollectionsHaveToParArray[ParHashMap[K, V], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ParHashMap[K, V]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  176. def toParCollection[U >: (K, V), That](cbf: () ⇒ Combiner[U, That]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  177. def toParMap[K, V, That](cbf: () ⇒ Combiner[(K, V), That])(implicit ev: <:<[(K, V), (K, V)]): That
    Attributes
    protected
    Definition Classes
    ParIterableLike
  178. def toSeq: ParSeq[(K, V)]

    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
    ParIterableGenTraversableOnceParIterableLike
  179. def toSet[U >: (K, V)]: immutable.ParSet[U]

    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
  180. def toStream: Stream[(K, V)]

    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
  181. def toString(): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

    a String representation of the object.

    Definition Classes
    ParIterableLikeAny → AnyRef
  182. def toTraversable: GenTraversable[(K, V)]

    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
  183. def toVector: Vector[(K, V)]

    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
  184. def transpose[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): ParIterable[ParIterable[B]]

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

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

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

    val xs = List(
               Set(1, 2, 3),
               Set(4, 5, 6)).transpose
    // xs == List(
    //         List(1, 4),
    //         List(2, 5),
    //         List(3, 6))
    
    val ys = Vector(
               List(1, 2, 3),
               List(4, 5, 6)).transpose
    // ys == Vector(
    //         Vector(1, 4),
    //         Vector(2, 5),
    //         Vector(3, 6))
    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.

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

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

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

    val xs = 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
  186. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (ParIterable[A1], ParIterable[A2], ParIterable[A3])

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

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

    val xs = 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
  187. def update(key: K, value: V): Unit
  188. def updated[U >: V](key: K, value: U): ParMap[K, U]
    Definition Classes
    ParMapGenMapParMap
  189. def values: parallel.ParIterable[V]

    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
  190. def valuesIterator: IterableSplitter[V]

    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
  191. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  192. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  193. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  194. def withDefault(d: (K) ⇒ V): ParMap[K, V]

    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
  195. def withDefaultValue(d: V): ParMap[K, V]

    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
  196. def withFilter(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]
    Definition Classes
    ParIterableLike
  197. def wrap[R](body: ⇒ R): NonDivisible[R]
    Attributes
    protected
    Definition Classes
    ParIterableLike
  198. def zip[B](that: GenIterable[B]): ParHashMap[(A, B)]

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

    [use case]

    Returns a parallel hash map formed from this parallel hash 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 hash map containing pairs consisting of corresponding elements of this parallel hash map and that. The length of the returned collection is the minimum of the lengths of this parallel hash map and that.

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

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

  199. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): ParHashMap[(A, B)]

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

    [use case]

    Returns a parallel hash map formed from this parallel hash 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 hash map is shorter than that.

    thatElem

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

    returns

    a new parallel hash map containing pairs consisting of corresponding elements of this parallel hash map and that. The length of the returned collection is the maximum of the lengths of this parallel hash map and that. If this parallel hash map is shorter than that, thisElem values are used to pad the result. If that is shorter than this parallel hash 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[ParHashMap[K, V], (U, S), That]): That

  200. def zipWithIndex: ParHashMap[(A, Int)]

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

    [use case]

    Zips this parallel hash map with its indices.

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

    returns

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

    Definition Classes
    ParIterableLikeGenIterableLike
    Full Signature

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

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

  201. def [B](y: B): (ParHashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to ArrowAssoc[ParHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from ParHashMap[K, V] to any2stringadd[ParHashMap[K, V]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (parHashMap: any2stringadd[ParHashMap[K, V]]).+(other)
    Definition Classes
    any2stringadd

Deprecated Value Members

  1. def view: IterableView[(K, V), HashMap[K, V]]
    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 ParHashTable[K, DefaultEntry[K, V]]

Inherited from HashTable[K, DefaultEntry[K, V]]

Inherited from HashUtils[K]

Inherited from ParMap[K, V]

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

Inherited from mutable.Cloneable[ParHashMap[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, ParHashMap[K, V], HashMap[K, V]]

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

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

Inherited from Parallel

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

Inherited from GenericParMapTemplate[K, V, ParHashMap]

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

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

Inherited from GenMap[K, V]

Inherited from GenIterable[(K, V)]

Inherited from GenTraversable[(K, V)]

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

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

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

Inherited from Equals

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

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

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

Inherited from GenTraversableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from ParHashMap[K, V] to CollectionsHaveToParArray[ParHashMap[K, V], T]

Inherited by implicit conversion any2stringadd from ParHashMap[K, V] to any2stringadd[ParHashMap[K, V]]

Inherited by implicit conversion StringFormat from ParHashMap[K, V] to StringFormat[ParHashMap[K, V]]

Inherited by implicit conversion Ensuring from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]]

Inherited by implicit conversion ArrowAssoc from ParHashMap[K, V] to ArrowAssoc[ParHashMap[K, V]]

Ungrouped