scala.collection.parallel.mutable

ParHashMap

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( uid = 1L )
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
Type Hierarchy Learn more about scaladoc diagrams
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 traversable2ops
  2. by any2stringadd
  3. by any2stringfmt
  4. by any2ArrowAssoc
  5. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
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.

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  13. type Entry = DefaultEntry[K, V]

  14. abstract class EntryIterator[T, +IterRepr <: IterableSplitter[T]] extends IterableSplitter[T] with SizeMapUtils

    A parallel iterator returning all the entries.

  15. class Exists extends Accessor[Boolean, Exists]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  30. 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.

  31. class ParHashMapIterator extends EntryIterator[(K, V), ParHashMapIterator]

  32. class Partition[U >: T, This >: Repr] extends Transformer[(Combiner[U, This], Combiner[U, This]), Partition[U, This]]

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

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

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

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

    Definition Classes
    ParIterableLike
  37. 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
  38. 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
  39. trait ScanTree[U >: T] extends AnyRef

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  40. 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.

  41. trait SignallingOps[PI <: DelegatedSignalling] extends AnyRef

    Definition Classes
    ParIterableLike
  42. class Slice[U >: T, This >: Repr] extends Transformer[Combiner[U, This], Slice[U, This]]

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    Any
  3. 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
  4. def +[U >: V](kv: (K, U)): ParMap[K, U]

    Definition Classes
    ParMapLikeGenMapLike
  5. def ++[B](that: GenTraversableOnce[B]): ParHashMap[B]

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

    [use case]

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

    Example:

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

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new parallel hash map which contains all elements of this parallel hash map

    followed by all elements of that.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Full Signature

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

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

    adds all elements produced by a TraversableOnce to this parallel hash map .

    adds all elements produced by a TraversableOnce to this parallel hash map .

    xs

    the TraversableOnce producing the elements to add.

    returns

    the parallel hash map itself.

    Definition Classes
    Growable
  7. 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
    ParHashMapParMapLikeGrowable
  8. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): ParHashMap.this.type

    adds two or more elements to this parallel hash map .

    adds two or more elements to this parallel hash map .

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the parallel hash map itself

    Definition Classes
    Growable
  9. def -(key: K): ParHashMap[K, V]

    Definition Classes
    ParMapLikeGenMapLike
  10. def --=(xs: TraversableOnce[K]): ParHashMap.this.type

    Removes all elements produced by an iterator from this parallel hash map .

    Removes all elements produced by an iterator from this parallel hash map .

    xs

    the iterator producing the elements to remove.

    returns

    the parallel hash map itself

    Definition Classes
    Shrinkable
  11. 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
    ParHashMapParMapLikeShrinkable
  12. def -=(elem1: K, elem2: K, elems: K*): ParHashMap.this.type

    Removes two or more elements from this parallel hash map .

    Removes two or more elements from this parallel hash map .

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the parallel hash map itself

    Definition Classes
    Shrinkable
  13. def ->[B](y: B): (ParHashMap[K, V], B)

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to ArrowAssoc[ParHashMap[K, V]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  14. def /:[S](z: S)(op: (S, (K, V)) ⇒ S): S

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

    Applies a binary operator to a start value and all elements of this parallel hash map , 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 = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(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 hash map , 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 hash map .

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

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

    Applies a binary operator to all elements of this parallel hash map 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 = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(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 hash map , 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 hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
  16. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality. 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
    Any
  18. var _loadFactor: Int

    Attributes
    protected
    Definition Classes
    HashTable
  19. 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
  20. 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 list, while combop would concatenate two lists 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)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    ParIterableLikeGenTraversableOnce
  21. def alwaysInitSizeMap: Boolean

    Definition Classes
    ParHashTableHashTable
  22. def apply(key: K): V

    Definition Classes
    ParMapLikeGenMapLike
  23. 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.

  24. def asParIterable: parallel.ParIterable[(K, V)]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  25. def asParSeq: parallel.ParSeq[(K, V)]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  26. def bf2seq[S, That](bf: CanBuildFrom[ParHashMap[K, V], S, That]): CanBuildFrom[HashMap[K, V], S, That]

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

    Attributes
    protected
    Definition Classes
    ParIterableLike
  28. def calcSizeMapSize(tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable
  29. def canEqual(other: Any): Boolean

    Definition Classes
    ParIterableLike
  30. 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
    ParHashMapParMapLikeGrowableClearable
  31. def clearTable(): Unit

    Remove all entries from table

    Remove all entries from table

    Attributes
    protected
    Definition Classes
    HashTable
  32. 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

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

  34. def combinerFactory[S, That](cbf: () ⇒ Combiner[S, That]): CombinerFactory[S, That]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  35. 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
  36. def companion: GenericCompanion[ParIterable] with GenericParCompanion[ParIterable]

    The factory companion object that builds instances of class ParHashMap.

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

    Definition Classes
    ParIterableParIterableGenericParTemplateGenIterableGenTraversableGenericTraversableTemplate
  37. 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
  38. def copyToArray[U >: (K, V)](xs: Array[U], start: Int, len: Int): Unit

    Definition Classes
    ParIterableLikeGenTraversableOnce
  39. def copyToArray(xs: Array[A], start: Int): Unit

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

    [use case]

    Copies values 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 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

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

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

    [use case]

    Copies values 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 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

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

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  42. 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
  43. def debugBuffer: ArrayBuffer[String]

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

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

    Attributes
    protected
    Definition Classes
    ParIterableLike
  46. 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 hash map .

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  47. 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 hash map that satisfy the predicate pred

    Definition Classes
    ParIterableLikeGenTraversableLike
  48. def elemEquals(key1: K, key2: K): Boolean

    Attributes
    protected
    Definition Classes
    HashTable
  49. def elemHashCode(key: K): Int

    Attributes
    protected
    Definition Classes
    HashUtils
  50. def empty: ParHashMap[K, V]

    Definition Classes
    ParHashMapParMapParMapParMapLike
  51. def ensuring(cond: (ParHashMap[K, V]) ⇒ Boolean, msg: ⇒ Any): ParHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  52. def ensuring(cond: (ParHashMap[K, V]) ⇒ Boolean): ParHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  53. def ensuring(cond: Boolean, msg: ⇒ Any): ParHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  54. def ensuring(cond: Boolean): ParHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def entriesIterator: Iterator[DefaultEntry[K, V]]

    An iterator returning all entries.

    An iterator returning all entries.

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

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

    Tests whether the argument (arg0) 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
  57. def equals(that: Any): Boolean

    Compares two maps structurally; i.

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

    that

    the other map

    returns

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

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

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

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

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

    pred

    a predicate used to test elements

    returns

    true if p holds for some element, false otherwise

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

    Selects all elements of this parallel hash map which satisfy a predicate.

    Selects all elements of this parallel hash map which satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  60. 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
  61. def filterNot(pred: ((K, V)) ⇒ Boolean): ParHashMap[K, V]

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

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

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  62. 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()
    Note

    not specified by SLS as a member of AnyRef

  63. def find(pred: ((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.

    pred

    predicate used to test the elements

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  64. 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
  65. 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
  66. 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 a 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

  67. 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))
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(List(1, 2, 3), List(3, 2, 1))
    // 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]

  68. 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
  69. 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 hash map , going left to right.

    Applies a binary operator to a start value and all elements of this parallel hash map , 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 hash map , 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 hash map .

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

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

    Applies a binary operator to all elements of this parallel hash map 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 hash map , 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 hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
  71. def forall(pred: ((K, V)) ⇒ Boolean): Boolean

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

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

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

    pred

    a predicate used to test elements

    returns

    true if p holds for all elements, false otherwise

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

    Applies a function f to all the elements of parallel hash map in a undefined order.

    Applies a function f to all the elements of parallel hash map in a undefined order.

    U

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

    f

    function applied to each element

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  73. 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
  74. 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 information
    This member is added by an implicit conversion from ParHashMap[K, V] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  75. def genericBuilder[B]: Combiner[B, ParIterable[B]]

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

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

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

    Definition Classes
    GenericParTemplate
  77. def genericMapCombiner[P, Q]: Combiner[(P, Q), ParHashMap[P, Q]]

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

    Definition Classes
    ParHashMapGenMapLike
  79. final def getClass(): Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  80. def getOrElse(key: A, default: ⇒ B): B

    [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

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

    Partitions this parallel hash map into a map of parallel hash map s according to some discriminator function.

    Partitions this parallel hash map into a map of parallel hash map s 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 hash map .

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

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

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  82. def hasDefiniteSize: Boolean

    Definition Classes
    ParIterableLikeGenTraversableOnce
  83. 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
    GenMapLike → AnyRef → Any
  84. def head: (K, V)

    Selects the first element of this parallel hash map .

    Selects the first element of this parallel hash map .

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

    returns

    the first element of this parallel hash map .

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the parallel hash map is empty.

  85. 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 hash map if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  86. def ifParSeq[R](isbody: (parallel.ParSeq[(K, V)]) ⇒ R): Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  87. final def improve(hcode: Int, seed: Int): Int

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

    Attributes
    protected
    Definition Classes
    HashTable
  89. 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 hash map consisting of all elements of this parallel hash map

    except the last one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the parallel hash map is empty.

  90. def initTaskSupport(): Unit

    Attributes
    protected
    Definition Classes
    ParIterableLike
  91. def initWithContents(c: Contents[K, DefaultEntry[K, V]]): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  92. def initialSize: Int

    The initial size of the hash table.

    The initial size of the hash table.

    Attributes
    protected
    Definition Classes
    HashTable
  93. 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
  94. def isEmpty: Boolean

    Tests whether the parallel hash map is empty.

    Tests whether the parallel hash map is empty.

    returns

    true if the parallel hash map contains no elements, false otherwise.

    Definition Classes
    ParIterableLikeGenTraversableOnce
  95. 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
  96. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  97. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  98. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  99. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable
  100. 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
  101. final def isTraversableAgain: Boolean

    Tests whether this parallel hash map can be repeatedly traversed.

    Tests whether this parallel hash map can be repeatedly traversed.

    returns

    true

    Definition Classes
    ParIterableLikeGenTraversableLikeGenTraversableOnce
  102. 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
  103. def keySet: parallel.ParSet[K]

    Definition Classes
    ParMapLikeGenMapLike
  104. 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
  105. 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
  106. 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 hash map .

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the parallel hash map is empty.

  107. 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 hash map $ if it is nonempty, None if it is empty.

    Definition Classes
    ParIterableLikeGenTraversableLike
  108. 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

  109. def mapCompanion: GenericParMapCompanion[ParHashMap]

    Definition Classes
    ParHashMapParMapParMapGenericParMapTemplate
  110. 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
  111. 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)

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  113. 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)

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  115. def mkString: String

    Displays all elements of this parallel hash map in a string.

    Displays all elements of this parallel hash map in a string.

    returns

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

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

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

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

    sep

    the separator string.

    returns

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

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

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

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

    Displays all elements of this parallel hash map 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 hash map . 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 hash map are separated by the string sep.

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

  118. 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
  119. def newBuilder: Builder[(K, V), ParIterable[(K, V)]]

    The builder that builds instances of type ParHashMap[A]

    The builder that builds instances of type ParHashMap[A]

    Attributes
    protected[this]
    Definition Classes
    GenericParTemplateGenericTraversableTemplateHasNewBuilder
  120. def newCombiner: ParHashMapCombiner[K, V]

    Attributes
    protected[this]
    Definition Classes
    ParHashMapParMapGenericParMapTemplateGenericParTemplateHasNewCombiner
  121. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  122. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  123. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  124. def nonEmpty: Boolean

    Tests whether the parallel hash map is not empty.

    Tests whether the parallel hash map is not empty.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableOnce
  125. 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

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

  127. 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
    ParIterableLikeCustomParallelizableParallelizable
  128. 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
  129. def partition(pred: ((K, V)) ⇒ Boolean): (ParHashMap[K, V], ParHashMap[K, V])

    Partitions this parallel hash map in two parallel hash map s according to a predicate.

    Partitions this parallel hash map in two parallel hash map s according to a predicate.

    pred

    the predicate on which to partition.

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  130. 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

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

    Definition Classes
    ParHashMapParMapLike
  132. 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 hash map is empty.

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

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

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

    Optionally applies a binary operator to all elements of this parallel hash map , 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) is this parallel hash map is nonempty, None otherwise.

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

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

    Applies a binary operator to all elements of this parallel hash map , 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 hash map , 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 hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this parallel hash map is empty.

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

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

    Optionally applies a binary operator to all elements of this parallel hash map , 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) is this parallel hash map is nonempty, None otherwise.

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

  139. def removeEntry(key: K): DefaultEntry[K, V]

    Remove entry from table if present.

    Remove entry from table if present.

    Attributes
    protected
    Definition Classes
    HashTable
  140. def repr: ParHashMap[K, V]

    Definition Classes
    ParIterableLikeGenTraversableLike
  141. 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
  142. 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

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

  144. def scanBlockSize: Int

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  145. 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 and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    ParIterableLikeGenTraversableLike
  146. 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 and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    ParIterableLikeGenTraversableLike
  147. var seedvalue: Int

    Attributes
    protected
    Definition Classes
    HashTable
  148. def seq: HashMap[K, V]

  149. def sequentially[S, That <: Parallel](b: (HashMap[K, V]) ⇒ Parallelizable[S, That]): ParHashMap[K, V]

    Attributes
    protected[this]
    Definition Classes
    ParIterableLike
  150. 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
    ParHashMapGenTraversableLikeGenTraversableOnce
  151. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils
  152. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils
  153. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  154. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  155. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable
  156. var 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
  157. 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 hash map .

    unc_until

    the lowest index to EXCLUDE from this parallel hash map .

    returns

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

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

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

    Splits this parallel hash map 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
  159. def splitAt(n: Int): (ParHashMap[K, V], ParHashMap[K, V])

    Splits this parallel hash map into two at a given position.

    Splits this parallel hash map 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 hash map s consisting of the first n elements of this parallel hash map , and the other elements.

    Definition Classes
    ParIterableLikeGenTraversableLike
  160. 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
  161. 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
    ParHashMapParMapParIterableGenTraversableLike
  162. 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

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

    Definition Classes
    AnyRef
  164. var table: Array[HashEntry[K, DefaultEntry[K, V]]]

    The actual hash table.

    The actual hash table.

    Attributes
    protected
    Definition Classes
    HashTable
  165. var 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
  166. def tableSizeSeed: Int

    Attributes
    protected
    Definition Classes
    HashTable
  167. 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 hash map consisting of all elements of this parallel hash map

    except the first one.

    Definition Classes
    ParIterableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the parallel hash map is empty.

  168. 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 hash map .

    returns

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

    Definition Classes
    ParIterableLikeGenTraversableLike
  169. 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 hash map of elements that satisy the predicate pred

    Definition Classes
    ParIterableLikeGenTraversableLike
  170. implicit def task2ops[R, Tp](tsk: SSCTask[R, Tp]): TaskOps[R, Tp]

    Attributes
    protected
    Definition Classes
    ParIterableLike
  171. 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

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

    scala.collection.parallel.TaskSupport

  173. var 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
  174. 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)]

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

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

    Converts this parallel hash map to a mutable buffer.

    Converts this parallel hash map to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this parallel hash map .

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

    Converts this parallel hash map to an indexed sequence.

    Converts this parallel hash map to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this parallel hash map .

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

    Converts this parallel hash map to an iterable collection.

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

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

    Returns an Iterator over the elements in this parallel hash map .

    Returns an Iterator over the elements in this parallel hash map . 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 hash map .

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

    Converts this parallel hash map to a list.

    Converts this parallel hash map to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this parallel hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
  181. 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]

  182. def toParArray: ParArray[(K, V)]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to TraversableOps[(K, V)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  183. def toParCollection[U >: (K, V), That](cbf: () ⇒ Combiner[U, That]): That

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

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

    Converts this parallel hash map to a sequence.

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

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

    Converts this parallel hash map to a set.

    Converts this parallel hash map to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this parallel hash map .

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

    Converts this parallel hash map to a stream.

    Converts this parallel hash map to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this parallel hash map .

    Definition Classes
    ParIterableLikeGenTraversableOnce
  188. 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
    ParIterableLike → AnyRef → Any
  189. def toTraversable: GenTraversable[(K, V)]

    Converts this parallel hash map to an unspecified Traversable.

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

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

    Converts this parallel hash map to a Vector.

    Converts this parallel hash map to a Vector.

    Note: will not terminate for infinite-sized collections.

    returns

    a vector containing all elements of this parallel hash map .

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

    Transposes this parallel hash map of traversable collections into a parallel hash map of parallel hash map s.

    Transposes this parallel hash map of traversable collections into a parallel hash map of parallel hash map s.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this parallel hash map is a Traversable.

    returns

    a two-dimensional parallel hash map of parallel hash map s which has as nth row the nth column of this parallel hash map .

    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 parallel hash map

    are not of the same size.

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

    Converts this parallel hash map of pairs into two collections of the first and second half of each pair.

    Converts this parallel hash map of pairs into two collections of the first and second half of each pair.

    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 parallel hash map is a pair.

    returns

    a pair parallel hash map s, containing the first, respectively second half of each element pair of this parallel hash map .

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

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

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

    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 parallel hash map is a triple.

    returns

    a triple parallel hash map s, containing the first, second, respectively third member of each element triple of this parallel hash map .

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

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

    Definition Classes
    ParMapParMapGenMap
  196. 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
  197. 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
  198. def view: ParIterableView[(K, V), ParHashMap[K, V], HashMap[K, V]]

    Definition Classes
    ParIterableLike
  199. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()
  202. 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
  203. 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

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

    returns

    a wrapper of the map with a default value

    Definition Classes
    ParMap
  204. def wrap[R](body: ⇒ R): NonDivisible[R]

    Attributes
    protected
    Definition Classes
    ParIterableLike
  205. 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

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

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

  208. def [B](y: B): (ParHashMap[K, V], B)

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to ArrowAssoc[ParHashMap[K, V]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implict Value Members

  1. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to StringAdd 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: StringAdd).+(other)
    Definition Classes
    StringAdd
  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parHashMap: StringAdd).self
    Definition Classes
    StringAdd
  3. val self: Any

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parHashMap: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def /:\[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a /:\ 5)(_+_)
    b: Int = 15
    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: ParHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to ArrowAssoc[ParHashMap[K, V]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parHashMap: ArrowAssoc[ParHashMap[K, V]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: ParHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from ParHashMap[K, V] to Ensuring[ParHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (parHashMap: Ensuring[ParHashMap[K, V]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring 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 traversable2ops from ParHashMap[K, V] to TraversableOps[(K, V)]

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

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

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

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

Ungrouped