ParFlatHashTable

trait ParFlatHashTable[T] extends FlatHashTable[T]

Parallel flat hash table.

Parallel flat hash table.

Type Params
T

type of the elements in the table.

trait FlatHashTable[T]
trait HashUtils[T]
class Object
trait Matchable
class Any
class ParHashSet[T]

Type members

Classlikes

abstract class ParFlatHashTableIterator(var idx: Int, val until: Int, val totalsize: Int) extends IterableSplitter[T] with SizeMapUtils

Value members

Concrete methods

override def alwaysInitSizeMap: Boolean
Definition Classes
FlatHashTable

Inherited methods

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.

Inherited from
FlatHashTable
def clearTable(): Unit
Inherited from
FlatHashTable
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.

Inherited from
FlatHashTable
final protected def elemToEntry(elem: T): AnyRef

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

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

Inherited from
HashUtils
final def entryToElem(entry: AnyRef): T

Does the inverse translation of elemToEntry

Does the inverse translation of elemToEntry

Inherited from
HashUtils
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.

Inherited from
FlatHashTable
final protected def improve(hcode: Int, seed: Int): Int
Inherited from
HashUtils
def init(in: ObjectInputStream, f: T => Unit): Unit

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).

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.

Inherited from
FlatHashTable
def initialSize: Int

The initial size of the hash table.

The initial size of the hash table.

Inherited from
FlatHashTable
def iterator: Iterator[T]
Inherited from
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.

Inherited from
FlatHashTable
def serializeTo(out: ObjectOutputStream): Unit

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.

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.

Inherited from
FlatHashTable
def size: Int
Inherited from
FlatHashTable
final protected def sizeMapBucketBitSize: Int
Inherited from
HashUtils
final protected def sizeMapBucketSize: Int
Inherited from
HashUtils

Inherited fields

var table: Array[AnyRef]

The actual hash table.

The actual hash table.

Inherited from
FlatHashTable