ParHashTable

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

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

trait WithContents[K, V, Entry]
trait HashTable[K, V, Entry]
trait HashUtils[K]
class Object
trait Matchable
class Any
class ParHashMap[K, V]

Type members

Classlikes

abstract class EntryIterator[T, +IterRepr <: IterableSplitter[T]](var idx: Int, until: Int, totalsize: Int, var es: Entry) extends IterableSplitter[T] with SizeMapUtils

A parallel iterator returning all the entries.

A parallel iterator returning all the entries.

Value members

Concrete methods

override def alwaysInitSizeMap: Boolean
Definition Classes
HashTable

Inherited methods

def clearTable(): Unit
Inherited from
HashTable
def createNewEntry(key: K, value: V): Entry
Inherited from
HashTable
def entriesIterator: Iterator[Entry]
Inherited from
HashTable
final def findEntry(key: K): Entry
Inherited from
HashTable
def findOrAddEntry(key: K, value: V): Entry
Inherited from
HashTable
def foreachEntry[U](f: Entry => U): Unit
Inherited from
HashTable
final protected def improve(hcode: Int, seed: Int): Int
Inherited from
HashUtils
protected def initWithContents(c: Contents[K, Entry]): Unit
Inherited from
WithContents
final def removeEntry(key: K): Entry
Inherited from
HashTable
final def size: Int
Inherited from
HashTable
final protected def sizeMapBucketBitSize: Int
Inherited from
HashUtils
final protected def sizeMapBucketSize: Int
Inherited from
HashUtils