class ConcurrentHashMap[K <: AnyRef, V <: AnyRef] extends AbstractMap[K, V] with ConcurrentMap[K, V] with Serializable
- Annotations
- @SerialVersionUID()
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ConcurrentHashMap
- Serializable
- ConcurrentMap
- AbstractMap
- Map
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
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 BASECOUNT: AtomicLongLong
- Annotations
- @inline()
- def CELLSBUSY: AtomicInt
- Annotations
- @inline()
- def SIZECTL: AtomicInt
- Annotations
- @inline()
- def TRANSFERINDEX: AtomicInt
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clear(): Unit
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def compute(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def computeIfAbsent(key: K, mappingFunction: Function[_ >: K, _ <: V]): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def computeIfPresent(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def contains(value: Any): Boolean
- def containsKey(key: Any): Boolean
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def containsValue(_value: Any): Boolean
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def elements: Enumeration[V]
- def entrySet(): Set[Entry[K, V]]
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(_o: Any): Boolean
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map → AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def forEach[U <: AnyRef](parallelismThreshold: Long, transformer: BiFunction[_ >: K, _ >: V, _ <: U], action: Consumer[_ >: U]): Unit
- def forEach(parallelismThreshold: Long, action: BiConsumer[_ >: K, _ >: V]): Unit
- def forEach(action: BiConsumer[_ >: K, _ >: V]): Unit
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def forEachEntry[U <: AnyRef](parallelismThreshold: Long, transformer: Function[Entry[K, V], _ <: U], action: Consumer[_ >: U]): Unit
- def forEachEntry(parallelismThreshold: Long, action: Consumer[_ >: Entry[K, V]]): Unit
- def forEachKey[U <: AnyRef](parallelismThreshold: Long, transformer: Function[_ >: K, _ <: U], action: Consumer[_ >: U]): Unit
- def forEachKey(parallelismThreshold: Long, action: Consumer[_ >: K]): Unit
- def forEachValue[U <: AnyRef](parallelismThreshold: Long, transformer: Function[_ >: V, _ <: U], action: Consumer[_ >: U]): Unit
- def forEachValue(parallelismThreshold: Long, action: Consumer[_ >: V]): Unit
- def get(_key: Any): V
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getOrDefault(key: Any, defaultValue: V): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def hashCode(): Int
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map → AnyRef → Any
- def isEmpty(): Boolean
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def keySet(mappedValue: V): KeySetView[K, V]
- def keySet(): KeySetView[K, V]
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def keys: Enumeration[K]
- def mappingCount: Long
- def merge(key: K, value: V, remappingFunction: BiFunction[_ >: V, _ >: V, _ <: V]): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def put(key: K, value: V): V
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def putAll(m: Map[_ <: K, _ <: V]): Unit
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def putIfAbsent(key: K, value: V): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def reduce[U <: AnyRef](parallelismThreshold: Long, transformer: BiFunction[_ >: K, _ >: V, _ <: U], reducer: BiFunction[_ >: U, _ >: U, _ <: U]): U
- def reduceEntries[U <: AnyRef](parallelismThreshold: Long, transformer: Function[Entry[K, V], _ <: U], reducer: BiFunction[_ >: U, _ >: U, _ <: U]): U
- def reduceEntries(parallelismThreshold: Long, reducer: BiFunction[Entry[K, V], Entry[K, V], _ <: Entry[K, V]]): Entry[K, V]
- def reduceEntriesToDouble(parallelismThreshold: Long, transformer: ToDoubleFunction[Entry[K, V]], basis: Double, reducer: DoubleBinaryOperator): Double
- def reduceEntriesToInt(parallelismThreshold: Long, transformer: ToIntFunction[Entry[K, V]], basis: Int, reducer: IntBinaryOperator): Int
- def reduceEntriesToLong(parallelismThreshold: Long, transformer: ToLongFunction[Entry[K, V]], basis: Long, reducer: LongBinaryOperator): Long
- def reduceKeys[U <: AnyRef](parallelismThreshold: Long, transformer: Function[_ >: K, _ <: U], reducer: BiFunction[_ >: U, _ >: U, _ <: U]): U
- def reduceKeys(parallelismThreshold: Long, reducer: BiFunction[_ >: K, _ >: K, _ <: K]): K
- def reduceKeysToDouble(parallelismThreshold: Long, transformer: ToDoubleFunction[_ >: K], basis: Double, reducer: DoubleBinaryOperator): Double
- def reduceKeysToInt(parallelismThreshold: Long, transformer: ToIntFunction[_ >: K], basis: Int, reducer: IntBinaryOperator): Int
- def reduceKeysToLong(parallelismThreshold: Long, transformer: ToLongFunction[_ >: K], basis: Long, reducer: LongBinaryOperator): Long
- def reduceToDouble(parallelismThreshold: Long, transformer: ToDoubleBiFunction[_ >: K, _ >: V], basis: Double, reducer: DoubleBinaryOperator): Double
- def reduceToInt(parallelismThreshold: Long, transformer: ToIntBiFunction[_ >: K, _ >: V], basis: Int, reducer: IntBinaryOperator): Int
- def reduceToLong(parallelismThreshold: Long, transformer: ToLongBiFunction[_ >: K, _ >: V], basis: Long, reducer: LongBinaryOperator): Long
- def reduceValues[U <: AnyRef](parallelismThreshold: Long, transformer: Function[_ >: V, _ <: U], reducer: BiFunction[_ >: U, _ >: U, _ <: U]): U
- def reduceValues(parallelismThreshold: Long, reducer: BiFunction[_ >: V, _ >: V, _ <: V]): V
- def reduceValuesToDouble(parallelismThreshold: Long, transformer: ToDoubleFunction[_ >: V], basis: Double, reducer: DoubleBinaryOperator): Double
- def reduceValuesToInt(parallelismThreshold: Long, transformer: ToIntFunction[_ >: V], basis: Int, reducer: IntBinaryOperator): Int
- def reduceValuesToLong(parallelismThreshold: Long, transformer: ToLongFunction[_ >: V], basis: Long, reducer: LongBinaryOperator): Long
- def remove(key: Any, value: Any): Boolean
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def remove(key: Any): V
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- def replace(key: K, value: V): V
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def replace(key: K, oldValue: V, newValue: V): Boolean
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def replaceAll(function: BiFunction[_ >: K, _ >: V, _ <: V]): Unit
- Definition Classes
- ConcurrentHashMap → ConcurrentMap → Map
- def search[U <: AnyRef](parallelismThreshold: Long, searchFunction: BiFunction[_ >: K, _ >: V, _ <: U]): U
- def searchEntries[U <: AnyRef](parallelismThreshold: Long, searchFunction: Function[Entry[K, V], _ <: U]): U
- def searchKeys[U <: AnyRef](parallelismThreshold: Long, searchFunction: Function[_ >: K, _ <: U]): U
- def searchValues[U <: AnyRef](parallelismThreshold: Long, searchFunction: Function[_ >: V, _ <: U]): U
- def size(): Int
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- ConcurrentHashMap → AbstractMap → AnyRef → Any
- def usingEntry[T](entry: Entry[K, V])(apply: (K, V) => T): T
Helper method used to detect concurrent modification exception when accessing map entires.
- def values(): Collection[V]
- Definition Classes
- ConcurrentHashMap → AbstractMap → Map
- 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()