K - key typeV - value typepublic class SelfCleaningValueTable<K,V> extends Object implements ConcurrentMap<K,V>
| Constructor and Description | 
|---|
SelfCleaningValueTable()
Creates a new Table and start a cleaner. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
clear()  | 
boolean | 
containsKey(Object key)  | 
boolean | 
containsValue(Object value)  | 
Set<Map.Entry<K,V>> | 
entrySet()  | 
protected void | 
finalize()  | 
V | 
get(Object key)  | 
boolean | 
isEmpty()  | 
Set<K> | 
keySet()  | 
V | 
put(K key,
   V value)  | 
void | 
putAll(Map<? extends K,? extends V> map)  | 
V | 
putIfAbsent(K key,
           V value)  | 
V | 
remove(Object key)  | 
boolean | 
remove(Object key,
      Object value)  | 
V | 
replace(K key,
       V value)  | 
boolean | 
replace(K key,
       V oldValue,
       V newValue)  | 
int | 
size()  | 
Collection<V> | 
values()  | 
clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, replaceAllpublic SelfCleaningValueTable()
protected void finalize()
                 throws Throwable
public boolean containsKey(Object key)
containsKey in interface Map<K,V>public boolean containsValue(Object value)
containsValue in interface Map<K,V>public V putIfAbsent(K key, V value)
putIfAbsent in interface ConcurrentMap<K,V>putIfAbsent in interface Map<K,V>Copyright © GigaSpaces.