Trait scala.collection.parallel.mutable.ParHashTable
trait ParHashTable[K, Entry >: Null <: HashEntry[K, Entry]] extends HashTable[K, Entry]
Type Members
abstract class EntryIterator[T, +IterRepr <: IterableSplitter[T]] extends IterableSplitter[T] with SizeMapUtils
Abstract Value Members
abstract def createNewEntry[B](key: K, value: B): Entry
Creates new entry to be immediately inserted into the hashtable. This method is guaranteed to be called only once and in case that the entry will be added. In other words, an implementation may be side-effecting.
- Attributes
- protected
- Definition Classes
- HashTable
Concrete Value Members
final def !=(arg0: Any): Boolean
Test two objects for inequality.
- returns
true
if !(this == that), false otherwise.
- Definition Classes
- AnyRef → Any
final def ##(): Int
Equivalent to x.hashCode
except for boxed numeric types and null
. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null
returns a hashcode where null.hashCode
throws a NullPointerException
.
- returns
a hash value consistent with ==
- Definition Classes
- AnyRef → Any
def +(other: String): String
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to any2stringadd[ParHashTable[K, Entry]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
def ->[B](y: B): (ParHashTable[K, Entry], B)
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to ArrowAssoc[ParHashTable[K, Entry]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
final def ==(arg0: Any): Boolean
The expression x == that
is equivalent to if (x eq null) that eq null else x.equals(that)
.
- returns
true
if the receiver object is equivalent to the argument;false
otherwise.
- Definition Classes
- AnyRef → Any
val _loadFactor: Int
def addEntry(e: Entry): Unit
Add entry to table pre: no entry with same key exists
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
def alwaysInitSizeMap: Boolean
- Definition Classes
- ParHashTable → HashTable
final def asInstanceOf[T0]: T0
Cast the receiver object to be of type T0
.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String]
will throw a ClassCastException
at runtime, while the expression List(1).asInstanceOf[List[String]]
will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.
- returns
the receiver object.
- Definition Classes
- Any
- Exceptions thrown
ClassCastException
if the receiver object is not an instance of the erasure of typeT0
.
def calcSizeMapSize(tableLength: Int): Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
def clearTable(): Unit
Remove all entries from table
- Attributes
- protected
- Definition Classes
- HashTable
def clone(): AnyRef
Create a copy of the receiver object.
The default implementation of the clone
method is platform dependent.
- returns
a copy of the receiver object.
def elemEquals(key1: K, key2: K): Boolean
- Attributes
- protected
- Definition Classes
- HashTable
def elemHashCode(key: K): Int
- Attributes
- protected
- Definition Classes
- HashUtils
def ensuring(cond: (ParHashTable[K, Entry]) ⇒ Boolean, msg: ⇒ Any): ParHashTable[K, Entry]
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to Ensuring[ParHashTable[K, Entry]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
def ensuring(cond: (ParHashTable[K, Entry]) ⇒ Boolean): ParHashTable[K, Entry]
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to Ensuring[ParHashTable[K, Entry]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): ParHashTable[K, Entry]
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to Ensuring[ParHashTable[K, Entry]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
def ensuring(cond: Boolean): ParHashTable[K, Entry]
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to Ensuring[ParHashTable[K, Entry]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
def entriesIterator: Iterator[Entry]
An iterator returning all entries.
- Attributes
- protected
- Definition Classes
- HashTable
final def eq(arg0: AnyRef): Boolean
Tests whether the argument (that
) is a reference to the receiver object (this
).
The eq
method implements an equivalence relation on non-null instances of AnyRef
, and has three additional properties:
-
It is consistent: for any non-null instances
x
and y
of type AnyRef
, multiple invocations of x.eq(y)
consistently returns true
or consistently returns false
.For any non-null instance x
of type AnyRef
, x.eq(null)
and null.eq(x)
returns false
.
null.eq(null)
returns true
. When overriding the equals
or hashCode
methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2
), they should be equal to each other (o1 == o2
) and they should hash to the same value (o1.hashCode == o2.hashCode
).
- returns
true
if the argument is a reference to the receiver object;false
otherwise.
- Definition Classes
- AnyRef
def equals(arg0: Any): Boolean
The equality method for reference types. Default implementation delegates to eq
.
See also equals
in scala.Any.
- returns
true
if the receiver object is equivalent to the argument;false
otherwise.
- Definition Classes
- AnyRef → Any
def finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize
method is invoked, as well as the interaction between finalize
and non-local returns and exceptions, are all platform dependent.
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- Note
not specified by SLS as a member of AnyRef
def findEntry(key: K): Entry
Find entry with given key in table, null if not found.
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
def findOrAddEntry[B](key: K, value: B): Entry
Find entry with given key in table, or add new one if not found. May be somewhat faster then findEntry
/addEntry
pair as it computes entry's hash index only once. Returns entry found in table or null. New entries are created by calling createNewEntry
method.
- Attributes
- protected
- Definition Classes
- HashTable
def foreachEntry[U](f: (Entry) ⇒ U): Unit
Avoid iterator for a 2x faster traversal.
- Attributes
- protected
- Definition Classes
- HashTable
def formatted(fmtstr: String): String
Returns string formatted according to given format
string. Format strings are as for String.format
(@see java.lang.String.format).
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to StringFormat[ParHashTable[K, Entry]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
final def getClass(): Class[_]
Returns the runtime class representation of the object.
- returns
a class object corresponding to the runtime type of the receiver.
def hashCode(): Int
The hashCode method for reference types. See hashCode in scala.Any.
- returns
the hash code value for this object.
final def improve(hcode: Int, seed: Int): Int
Defer to a high-quality hash in scala.util.hashing. The goal is to distribute across bins as well as possible even if a hash code has low entropy at some bits.
OLD VERSION - quick, but bad for sequence 0-10000 - little entropy in higher bits - since 2003
var h: Int = hcode + ~(hcode << 9) h = h ^ (h >>> 14) h = h + (h << 4) h ^ (h >>> 10)
the rest of the computation is due to scala/bug#5293
- Attributes
- protected
- Definition Classes
- HashUtils
final def index(hcode: Int): Int
Note: we take the most significant bits of the hashcode, not the lower ones this is of crucial importance when populating the table in parallel
- Attributes
- protected
- Definition Classes
- HashTable
def initWithContents(c: Contents[K, Entry]): Unit
- Attributes
- protected
- Definition Classes
- HashTable
def initialSize: Int
The initial size of the hash table.
- Attributes
- protected
- Definition Classes
- HashTable
final def isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object is T0
.
Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String]
will return false
, while the expression List(1).isInstanceOf[List[String]]
will return true
. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.
- returns
true
if the receiver object is an instance of erasure of typeT0
;false
otherwise.
- Definition Classes
- Any
def isSizeMapDefined: Boolean
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
final def ne(arg0: AnyRef): Boolean
Equivalent to !(this eq that)
.
- returns
true
if the argument is not a reference to the receiver object;false
otherwise.
- Definition Classes
- AnyRef
def nnSizeMapAdd(h: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
def nnSizeMapRemove(h: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
def nnSizeMapReset(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
final def notify(): Unit
Wakes up a single thread that is waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
final def notifyAll(): Unit
Wakes up all threads that are waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
def removeEntry(key: K): Entry
Remove entry from table if present.
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
val seedvalue: Int
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
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
def sizeMapInit(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
def sizeMapInitAndRebuild(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( message = ... , since = "2.11.0" )
val sizemap: Array[Int]
The array keeping track of the number of elements in 32 element blocks.
final def synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
val table: Array[HashEntry[K, Entry]]
val tableSize: Int
The number of mappings contained in this hash table.
def tableSizeSeed: Int
- Attributes
- protected
- Definition Classes
- HashTable
val threshold: Int
The next size value at which to resize (capacity * load factor).
def toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to CollectionsHaveToParArray[ParHashTable[K, Entry], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ParHashTable[K, Entry]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
def toString(): String
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
- returns
a String representation of the object.
- 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
def →[B](y: B): (ParHashTable[K, Entry], B)
- Implicit
- This member is added by an implicit conversion from ParHashTable[K, Entry] to ArrowAssoc[ParHashTable[K, Entry]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
© 2002-2019 EPFL, with contributions from Lightbend.
Licensed under the Apache License, Version 2.0.
https://www.scala-lang.org/api/2.12.9/scala/collection/parallel/mutable/ParHashTable.html
Provides functionality for hash tables with linked list buckets, enriching the data structure by fulfilling certain requirements for their parallel construction and iteration.