scala.collection.parallel.mutable

# ParHashTable

#### trait ParHashTable[K, Entry >: Null <: HashEntry[K, Entry]] extends HashTable[K, Entry]

Provides functionality for hash tables with linked list buckets, enriching the data structure by fulfilling certain requirements for their parallel construction and iteration.

Source
  ParHashTable.scala

Linear Supertypes
HashTable[K, Entry], HashUtils[K], AnyRef, Any
Known Subclasses
ParHashMap
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. ParHashTable
2. HashTable
3. HashUtils
4. AnyRef
5. Any

Implicitly

1. by CollectionsHaveToParArray
2. by any2stringadd
3. by StringFormat
4. by Ensuring
5. by ArrowAssoc

1. Hide All
2. Show all

Learn more about member selection
Visibility

1. Public
2. All

### Type Members

1. #### abstract class EntryIterator[T, +IterRepr <: IterableSplitter[T]] extends IterableSplitter[T] with SizeMapUtils

   A parallel iterator returning all the entries.

### Abstract Value Members

1. #### abstract def createNewEntry[B](key: K, value: B): Entry

   Creates new entry to be immediately inserted into the hashtable.

   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

1. #### final def !=(arg0: Any): Boolean

   Definition Classes
     AnyRef → Any

2. #### final def ##(): Int

   Definition Classes
     AnyRef → Any

3. #### def +(other: String): String

   Implicit information
     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

4. #### def ->[B](y: B): (ParHashTable[K, Entry], B)

   Implicit information
     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()

5. #### final def ==(arg0: Any): Boolean

   Definition Classes
     AnyRef → Any

6. #### var _loadFactor: Int

   Attributes
     protected
   Definition Classes
     HashTable

7. #### def addEntry(e: Entry): Unit

   Add entry to table pre: no entry with same key exists

   Add entry to table pre: no entry with same key exists

   Attributes
     protected
   Definition Classes
     HashTable
   Annotations
     @deprecatedOverriding( ... , "2.11.0" )

8. #### def alwaysInitSizeMap: Boolean

   Definition Classes
     ParHashTable → HashTable

9. #### final def asInstanceOf[T0]: T0

   Definition Classes
     Any

10. #### def calcSizeMapSize(tableLength: Int): Int

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

11. #### def clearTable(): Unit

    Remove all entries from table

    Remove all entries from table

    Attributes
      protected
    Definition Classes
      HashTable

12. #### def clone(): AnyRef

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

13. #### def elemEquals(key1: K, key2: K): Boolean

    Attributes
      protected
    Definition Classes
      HashTable

14. #### def elemHashCode(key: K): Int

    Attributes
      protected
    Definition Classes
      HashUtils

15. #### def ensuring(cond: (ParHashTable[K, Entry]) ⇒ Boolean, msg: ⇒ Any): ParHashTable[K, Entry]

    Implicit information
      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

16. #### def ensuring(cond: (ParHashTable[K, Entry]) ⇒ Boolean): ParHashTable[K, Entry]

    Implicit information
      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

17. #### def ensuring(cond: Boolean, msg: ⇒ Any): ParHashTable[K, Entry]

    Implicit information
      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

18. #### def ensuring(cond: Boolean): ParHashTable[K, Entry]

    Implicit information
      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

19. #### def entriesIterator: Iterator[Entry]

    An iterator returning all entries.

    An iterator returning all entries.

    Attributes
      protected
    Definition Classes
      HashTable

20. #### final def eq(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

21. #### def equals(arg0: Any): Boolean

    Definition Classes
      AnyRef → Any

22. #### def finalize(): Unit

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )

23. #### def findEntry(key: K): Entry

    Find entry with given key in table, null if not found.

    Find entry with given key in table, null if not found.

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

24. #### def findOrAddEntry[B](key: K, value: B): Entry

    Find entry with given key in table, or add new one if not found.

    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

25. #### def foreachEntry[U](f: (Entry) ⇒ U): Unit

    Avoid iterator for a 2x faster traversal.

    Avoid iterator for a 2x faster traversal.

    Attributes
      protected
    Definition Classes
      HashTable

26. #### def formatted(fmtstr: String): String

    Returns string formatted according to given `format` string.

    Returns string formatted according to given `format` string. Format strings are as for `String.format` (@see java.lang.String.format).

    Implicit information
      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()

27. #### final def getClass(): Class[_]

    Definition Classes
      AnyRef → Any

28. #### def hashCode(): Int

    Definition Classes
      AnyRef → Any

29. #### final def improve(hcode: Int, seed: Int): Int

    Attributes
      protected
    Definition Classes
      HashUtils

30. #### final def index(hcode: Int): Int

    Attributes
      protected
    Definition Classes
      HashTable

31. #### def initWithContents(c: Contents[K, Entry]): Unit

    Attributes
      protected
    Definition Classes
      HashTable

32. #### def initialSize: Int

    The initial size of the hash table.

    The initial size of the hash table.

    Attributes
      protected
    Definition Classes
      HashTable

33. #### final def isInstanceOf[T0]: Boolean

    Definition Classes
      Any

34. #### def isSizeMapDefined: Boolean

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

35. #### final def ne(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

36. #### def nnSizeMapAdd(h: Int): Unit

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

37. #### def nnSizeMapRemove(h: Int): Unit

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

38. #### def nnSizeMapReset(tableLength: Int): Unit

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

39. #### final def notify(): Unit

    Definition Classes
      AnyRef

40. #### final def notifyAll(): Unit

    Definition Classes
      AnyRef

41. #### def removeEntry(key: K): Entry

    Remove entry from table if present.

    Remove entry from table if present.

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

42. #### var seedvalue: Int

    Attributes
      protected
    Definition Classes
      HashTable

43. #### final def sizeMapBucketBitSize: Int

    Attributes
      protected
    Definition Classes
      HashUtils

44. #### final def sizeMapBucketSize: Int

    Attributes
      protected
    Definition Classes
      HashUtils

45. #### def sizeMapDisable(): Unit

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

46. #### def sizeMapInit(tableLength: Int): Unit

    Attributes
      protected
    Definition Classes
      HashTable

47. #### def sizeMapInitAndRebuild(): Unit

    Attributes
      protected
    Definition Classes
      HashTable
    Annotations
      @deprecatedOverriding( ... , "2.11.0" )

48. #### var sizemap: Array[Int]

    The array keeping track of the number of elements in 32 element blocks.

    The array keeping track of the number of elements in 32 element blocks.

    Attributes
      protected
    Definition Classes
      HashTable

49. #### final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
      AnyRef

50. #### var table: Array[HashEntry[K, Entry]]

    The actual hash table.

    The actual hash table.

    Attributes
      protected
    Definition Classes
      HashTable

51. #### var tableSize: Int

    The number of mappings contained in this hash table.

    The number of mappings contained in this hash table.

    Attributes
      protected
    Definition Classes
      HashTable

52. #### def tableSizeSeed: Int

    Attributes
      protected
    Definition Classes
      HashTable

53. #### 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
    Definition Classes
      HashTable

54. #### def toParArray: ParArray[T]

    Implicit information
      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

55. #### def toString(): String

    Definition Classes
      AnyRef → Any

56. #### final def wait(): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

58. #### final def wait(arg0: Long): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

59. #### def →[B](y: B): (ParHashTable[K, Entry], B)

    Implicit information
      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

### Inherited from HashTable[K, Entry]

### Inherited from HashUtils[K]

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion CollectionsHaveToParArray from ParHashTable[K, Entry] to CollectionsHaveToParArray[ParHashTable[K, Entry], T]

### Inherited by implicit conversion any2stringadd from ParHashTable[K, Entry] to any2stringadd[ParHashTable[K, Entry]]

### Inherited by implicit conversion StringFormat from ParHashTable[K, Entry] to StringFormat[ParHashTable[K, Entry]]

### Inherited by implicit conversion Ensuring from ParHashTable[K, Entry] to Ensuring[ParHashTable[K, Entry]]

### Inherited by implicit conversion ArrowAssoc from ParHashTable[K, Entry] to ArrowAssoc[ParHashTable[K, Entry]]

### Ungrouped