trait ParFlatHashTable[T] extends FlatHashTable[T]
Parallel flat hash table.
- T
type of the elements in the table.
- Alphabetic
- By Inheritance
- ParFlatHashTable
- FlatHashTable
- HashUtils
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
- abstract class ParFlatHashTableIterator extends IterableSplitter[T] with SizeMapUtils
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addElem(elem: T): Boolean
Add elem if not yet in table.
Add elem if not yet in table.
- returns
Returns
true
if a new elem was added,false
otherwise.
- Definition Classes
- FlatHashTable
- def addEntry(newEntry: AnyRef): Boolean
Add an entry (an elem converted to an entry via elemToEntry) if not yet in table.
Add an entry (an elem converted to an entry via elemToEntry) if not yet in table.
- returns
Returns
true
if a new elem was added,false
otherwise.
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def alwaysInitSizeMap: Boolean
- Definition Classes
- ParFlatHashTable → FlatHashTable
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def calcSizeMapSize(tableLength: Int): Int
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def capacity(expectedSize: Int): Int
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def clearTable(): Unit
- Definition Classes
- FlatHashTable
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def containsElem(elem: T): Boolean
Checks whether an element is contained in the hash table.
Checks whether an element is contained in the hash table.
- Definition Classes
- FlatHashTable
- final def elemToEntry(elem: T): AnyRef
Elems have type A, but we store AnyRef in the table.
Elems have type A, but we store AnyRef in the table. Plus we need to deal with null elems, which need to be stored as NullSentinel
- Attributes
- protected
- Definition Classes
- HashUtils
- final def entryToElem(entry: AnyRef): T
Does the inverse translation of elemToEntry
Does the inverse translation of elemToEntry
- Definition Classes
- HashUtils
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def findEntry(elem: T): Option[T]
Finds an entry in the hash table if such an element exists.
Finds an entry in the hash table if such an element exists.
- Definition Classes
- FlatHashTable
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def improve(hcode: Int, seed: Int): Int
- Attributes
- protected
- Definition Classes
- HashUtils
- def index(hcode: Int): Int
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def init(in: ObjectInputStream, f: (T) => Unit): Unit
Initializes the collection from the input stream.
Initializes the collection from the input stream.
f
will be called for each element read from the input stream in the order determined by the stream. This is useful for structures where iteration order is important (e.g. LinkedHashSet).The serialization format expected is the one produced by
serializeTo
.- Definition Classes
- FlatHashTable
- def initWithContents(c: Contents[T]): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def initialSize: Int
The initial size of the hash table.
The initial size of the hash table.
- Definition Classes
- FlatHashTable
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isSizeMapDefined: Boolean
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def iterator: Iterator[T]
- Definition Classes
- FlatHashTable
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def nnSizeMapAdd(h: Int): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- final def nnSizeMapRemove(h: Int): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- final def nnSizeMapReset(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def randomSeed: Int
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def removeElem(elem: T): Boolean
Removes an elem from the hash table returning true if the element was found (and thus removed) or false if it didn't exist.
Removes an elem from the hash table returning true if the element was found (and thus removed) or false if it didn't exist.
- Definition Classes
- FlatHashTable
- val seedvalue: Int
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def serializeTo(out: ObjectOutputStream): Unit
Serializes the collection to the output stream by saving the load factor, collection size and collection elements.
Serializes the collection to the output stream by saving the load factor, collection size and collection elements.
foreach
determines the order in which the elements are saved to the stream. To deserialize,init
should be used.- Definition Classes
- FlatHashTable
- def size: Int
- Definition Classes
- FlatHashTable
- final def sizeMapBucketBitSize: Int
- Attributes
- protected
- Definition Classes
- HashUtils
- final def sizeMapBucketSize: Int
- Attributes
- protected
- Definition Classes
- HashUtils
- def sizeMapDisable(): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- final def sizeMapInit(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- final def sizeMapInitAndRebuild(): Unit
- Attributes
- protected
- Definition Classes
- FlatHashTable
- val sizemap: Array[Int]
The array keeping track of number of elements in 32 element blocks.
The array keeping track of number of elements in 32 element blocks.
- Attributes
- protected
- Definition Classes
- FlatHashTable
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val table: Array[AnyRef]
The actual hash table.
The actual hash table.
- Definition Classes
- FlatHashTable
- val tableSize: Int
The number of mappings contained in this hash table.
The number of mappings contained in this hash table.
- Attributes
- protected
- Definition Classes
- FlatHashTable
- def tableSizeSeed: Int
- Attributes
- protected
- Definition Classes
- FlatHashTable
- val 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
- FlatHashTable
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()