class ConcurrentWeakIdentityHashMap[K, V] extends ConcurrentMap[K, V]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ConcurrentWeakIdentityHashMap
- ConcurrentMap
- Map
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new ConcurrentWeakIdentityHashMap()
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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clear(): Unit
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
compute(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V
- Definition Classes
- ConcurrentMap → Map
-
def
computeIfAbsent(arg0: K, arg1: Function[_ >: K, _ <: V]): V
- Definition Classes
- ConcurrentMap → Map
-
def
computeIfPresent(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V
- Definition Classes
- ConcurrentMap → Map
-
def
containsKey(key: Any): Boolean
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
def
containsValue(value: AnyRef): Boolean
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
def
entrySet(): Set[Entry[K, V]]
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
forEach(arg0: BiConsumer[_ >: K, _ >: V]): Unit
- Definition Classes
- ConcurrentMap → Map
-
def
get(key: AnyRef): V
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getOrDefault(arg0: Any, arg1: V): V
- Definition Classes
- ConcurrentMap → Map
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
isEmpty(): Boolean
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
keySet(): Set[K]
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
def
merge(arg0: K, arg1: V, arg2: BiFunction[_ >: V, _ >: V, _ <: V]): V
- Definition Classes
- 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
- ConcurrentWeakIdentityHashMap → Map
-
def
putAll(m: Map[_ <: K, _ <: V]): Unit
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
def
putIfAbsent(key: K, value: V): V
- Definition Classes
- ConcurrentWeakIdentityHashMap → ConcurrentMap → Map
-
def
remove(key: Any): V
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
def
remove(arg0: Any, arg1: Any): Boolean
- Definition Classes
- Map
-
def
replace(arg0: K, arg1: V): V
- Definition Classes
- Map
-
def
replace(arg0: K, arg1: V, arg2: V): Boolean
- Definition Classes
- Map
-
def
replaceAll(arg0: BiFunction[_ >: K, _ >: V, _ <: V]): Unit
- Definition Classes
- ConcurrentMap → Map
-
def
size(): Int
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
values(): Collection[V]
- Definition Classes
- ConcurrentWeakIdentityHashMap → Map
-
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( ... ) @native()