Scala Standard Library 2.12.18 - scala.collection.parallel.mutable.ParHashTable (original) (raw)
trait ParHashTable[K, Entry >: Null <: HashEntry[K, Entry]] extends HashTable[K, Entry]
Ordering
- Alphabetic
- By Inheritance
Inherited
- ParHashTable
- HashTable
- HashUtils
- AnyRef
- Any
Implicitly
by CollectionsHaveToParArray
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
Hide All
Show All
Abstract Value Members
- abstract def createNewEntry[B](key: K, value: B): Entry
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def +(other: String): String
- def ->[B](y: B): (ParHashTable[K, Entry], B)
- final def ==(arg0: Any): Boolean
- val _loadFactor: Int
- def addEntry(e: Entry): Unit
- def alwaysInitSizeMap: Boolean
- final def asInstanceOf[T0]: T0
- def calcSizeMapSize(tableLength: Int): Int
- def clearTable(): Unit
- 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]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: Any): Boolean
- def finalize(): Unit
- def findEntry(key: K): Entry
- def findOrAddEntry[B](key: K, value: B): Entry
- def foreachEntry[U](f: (Entry) ⇒ U): Unit
- 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
- 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
- val seedvalue: Int
- final def sizeMapBucketBitSize: Int
- final def sizeMapBucketSize: Int
- def sizeMapDisable(): Unit
- def sizeMapInit(tableLength: Int): Unit
- def sizeMapInitAndRebuild(): Unit
- val sizemap: Array[Int]
- final def synchronized[T0](arg0: ⇒ T0): T0
- val table: Array[HashEntry[K, Entry]]
- val tableSize: Int
- def tableSizeSeed: Int
- val threshold: Int
- def toParArray: ParArray[T]
- 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)