模块 com.tlcsdm.core

程序包 com.tlcsdm.core.concurrent

类 WeakConcurrentMap.WithInlinedExpunction<K,V>

java.lang.Object

java.lang.ref.ReferenceQueue<K>

com.tlcsdm.core.concurrent.AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

com.tlcsdm.core.concurrent.WeakConcurrentMap<K,V>

com.tlcsdm.core.concurrent.WeakConcurrentMap.WithInlinedExpunction<K,V>

所有已实现的接口:

Iterable<Map.Entry<K,V>>, Runnable

封闭类:

WeakConcurrentMap<K,V>

public static class WeakConcurrentMap.WithInlinedExpunction<K,V>
extends WeakConcurrentMap<K,V>

A WeakConcurrentMap where stale entries are removed as a side effect of interacting with this map.

嵌套类概要

从类继承的嵌套类/接口 com.tlcsdm.core.concurrent.WeakConcurrentMap

WeakConcurrentMap.LookupKey<K>, WeakConcurrentMap.WithInlinedExpunction<K,V>

从类继承的嵌套类/接口 com.tlcsdm.core.concurrent.AbstractWeakConcurrentMap

AbstractWeakConcurrentMap.WeakKey<K>

字段概要

从类继承的字段 com.tlcsdm.core.concurrent.AbstractWeakConcurrentMap

target

构造器概要

构造器

构造器	说明
WithInlinedExpunction()

方法概要

修饰符和类型	方法	说明
int	approximateSize()	Returns the approximate size of this map where the returned number is at least as big as the actual number of entries.
boolean	containsKey(K key)
V	get(K key)
Iterator<Map.Entry<K,V>>	iterator()
V	put(K key, V value)
V	remove(K key)

从类继承的方法 com.tlcsdm.core.concurrent.WeakConcurrentMap

getCleanerThread, getLookupKey, resetLookupKey

从类继承的方法 com.tlcsdm.core.concurrent.AbstractWeakConcurrentMap

clear, defaultValue, expungeStaleEntries, getIfPresent, putIfAbsent, putIfProbablyAbsent, run, toString

从类继承的方法 java.lang.ref.ReferenceQueue

poll, remove, remove

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

从接口继承的方法 java.lang.Iterable

forEach, spliterator

构造器详细资料

WithInlinedExpunction

public WithInlinedExpunction()

方法详细资料

get

public V get(K key)

覆盖:

get 在类中 AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

参数:

key - The key of the entry.

返回:

The value of the entry or the default value if it did not exist.

containsKey

public boolean containsKey(K key)

覆盖:

containsKey 在类中 AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

参数:

key - The key of the entry.

返回:

true if the key already defines a value.

put

public V put(K key,
 V value)

覆盖:

put 在类中 AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

参数:

key - The key of the entry.

value - The value of the entry.

返回:

The previous entry or null if it does not exist.

remove

public V remove(K key)

覆盖:

remove 在类中 AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

参数:

key - The key of the entry.

返回:

The removed entry or null if it does not exist.

iterator

public Iterator<Map.Entry<K,V>> iterator()

指定者:

iterator 在接口中 Iterable<K>

覆盖:

iterator 在类中 AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

approximateSize

public int approximateSize()

从类复制的说明: AbstractWeakConcurrentMap

Returns the approximate size of this map where the returned number is at least as big as the actual number of entries.

覆盖:

approximateSize 在类中 AbstractWeakConcurrentMap<K,V,WeakConcurrentMap.LookupKey<K>>

返回:

The minimum size of this map.