ParHashTable

abstract def createNewEntry[B](key: K, value: B): Entry

Creates new entry to be immediately inserted into the hashtable.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (ParHashTable[K, Entry], B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var _loadFactor: Int

def addEntry(e: Entry): Unit

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

def alwaysInitSizeMap: Boolean

final def asInstanceOf[T0]: T0

def calcSizeMapSize(tableLength: Int): Int

def clearTable(): Unit

Remove all entries from table

def clone(): AnyRef

def elemEquals(key1: K, key2: K): Boolean

def elemHashCode(key: K): Int

def ensuring(cond: (ParHashTable[K, Entry]) ⇒ Boolean, msg: ⇒ Any): ParHashTable[K, Entry]

def ensuring(cond: (ParHashTable[K, Entry]) ⇒ Boolean): ParHashTable[K, Entry]

def ensuring(cond: Boolean, msg: ⇒ Any): ParHashTable[K, Entry]

def ensuring(cond: Boolean): ParHashTable[K, Entry]

def entriesIterator: Iterator[Entry]

An iterator returning all entries.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findEntry(key: K): Entry

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

def findOrAddEntry[B](key: K, value: B): Entry

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

def foreachEntry[U](f: (Entry) ⇒ U): Unit

Avoid iterator for a 2x faster traversal.

def formatted(fmtstr: String): String

Returns string formatted according to given format string.

final def getClass(): Class[_]

def hashCode(): Int

final def improve(hcode: Int, seed: Int): Int

final def index(hcode: Int): Int

def initWithContents(c: Contents[K, Entry]): Unit

def initialSize: Int

The initial size of the hash table.

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

final def ne(arg0: AnyRef): Boolean

def nnSizeMapAdd(h: Int): Unit

def nnSizeMapRemove(h: Int): Unit

def nnSizeMapReset(tableLength: Int): Unit

final def notify(): Unit

final def notifyAll(): Unit

def removeEntry(key: K): Entry

Remove entry from table if present.

var seedvalue: Int

final def sizeMapBucketBitSize: Int

final def sizeMapBucketSize: Int

def sizeMapDisable(): Unit

def sizeMapInit(tableLength: Int): Unit

def sizeMapInitAndRebuild(): Unit

var sizemap: Array[Int]

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

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

var table: Array[HashEntry[K, Entry]]

The actual hash table.

var tableSize: Int

The number of mappings contained in this hash table.

def tableSizeSeed: Int

var threshold: Int

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

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def →[B](y: B): (ParHashTable[K, Entry], B)