Packages

trait ParHashTable[K, Entry >: Null <: HashEntry[K, Entry]] extends HashTable[K, Entry]

Provides functionality for hash tables with linked list buckets, enriching the data structure by fulfilling certain requirements for their parallel construction and iteration.

Source
ParHashTable.scala
Linear Supertypes
HashTable[K, Entry], HashUtils[K], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParHashTable
  2. HashTable
  3. HashUtils
  4. AnyRef
  5. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

    A parallel iterator returning all the entries.

Concrete Value Members

  1. def alwaysInitSizeMap: Boolean
    Definition Classes
    ParHashTableHashTable
  2. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from ParHashTable[K, Entry] to CollectionsHaveToParArray[ParHashTable[K, Entry], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ParHashTable[K, Entry]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray