FlatHashTable

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

Attributes
protected
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
def alwaysInitSizeMap: Boolean

Attributes
protected
final def asInstanceOf[T0]: T0

Definition Classes
Any
def calcSizeMapSize(tableLength: Int): Int

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def capacity(expectedSize: Int): Int

Attributes
protected
def clearTable(): Unit

Attributes
protected
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def containsElem(elem: A): Boolean

Checks whether an element is contained in the hash table.
Checks whether an element is contained in the hash table.

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
final def elemToEntry(elem: A): 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): A

Does the inverse translation of elemToEntry
Does the inverse translation of elemToEntry

Attributes
protected
Definition Classes
HashUtils
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def findEntry(elem: A): Option[A]

Finds an entry in the hash table if such an element exists.
Finds an entry in the hash table if such an element exists.

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def improve(hcode: Int, seed: Int): Int

Attributes
protected
Definition Classes
HashUtils
final def index(hcode: Int): Int

Attributes
protected
def initWithContents(c: Contents[A]): Unit

Attributes
protected
def initialSize: Int

The initial size of the hash table.
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isSizeMapDefined: Boolean

Attributes
protected
def iterator: Iterator[A]

Attributes
protected
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nnSizeMapAdd(h: Int): Unit

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def nnSizeMapRemove(h: Int): Unit

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def nnSizeMapReset(tableLength: Int): Unit

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def randomSeed: Int

Attributes
protected
def removeElem(elem: A): 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.

Attributes
protected
var seedvalue: Int

Attributes
protected
final def sizeMapBucketBitSize: Int

Attributes
protected
Definition Classes
HashUtils
final def sizeMapBucketSize: Int

Attributes
protected
Definition Classes
HashUtils
def sizeMapDisable(): Unit

Attributes
protected
def sizeMapInit(tableLength: Int): Unit

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def sizeMapInitAndRebuild(): Unit

Attributes
protected
Annotations
@deprecatedOverriding( ... , "2.11.0" )
var 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
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
var table: Array[AnyRef]

The actual hash table.
The actual hash table.

Attributes
protected
var tableSize: Int

The number of mappings contained in this hash table.
The number of mappings contained in this hash table.

Attributes
protected
def tableSizeSeed: Int

Attributes
protected
var 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
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package mutable

trait FlatHashTable[A] extends HashUtils[A]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addElem(elem: A): Boolean

def addEntry(newEntry: AnyRef): Boolean

def alwaysInitSizeMap: Boolean

final def asInstanceOf[T0]: T0

def calcSizeMapSize(tableLength: Int): Int

def capacity(expectedSize: Int): Int

def clearTable(): Unit

def clone(): AnyRef

def containsElem(elem: A): Boolean

final def elemToEntry(elem: A): AnyRef

final def entryToElem(entry: AnyRef): A

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findEntry(elem: A): Option[A]

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[A]): Unit

def initialSize: Int

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

def iterator: Iterator[A]

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 randomSeed: Int

def removeElem(elem: A): Boolean

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]

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

var table: Array[AnyRef]

var tableSize: Int

def tableSizeSeed: Int

var threshold: Int

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from HashUtils[A]

Inherited from AnyRef

Inherited from Any

Ungrouped