Class SelfCleaningTable<K,V>
java.lang.Object
com.gigaspaces.internal.utils.collections.SelfCleaningTable<K,V>
- Type Parameters:
K- key typeV- value type
- All Implemented Interfaces:
ConcurrentMap<K,,V> Map<K,V>
Holds a weak key for each value and make sure each value will be cleaned when key is weakly
held.
- Since:
- 6.5
- Author:
- Guy Korland
-
Nested Class Summary
Nested Classes -
Constructor Summary
ConstructorsConstructorDescriptionSelfCleaningTable(String name) SelfCleaningTable(String name, SelfCleaningTable.ICleanerListener<V> cleanerListener) Creates a new Table and start a cleaner.SelfCleaningTable(String name, SelfCleaningTable.ICleanerListener<V> cleanerListener, ConcurrentMap underlyingMap) Creates a new Table and start a cleaner. -
Method Summary
Methods inherited from class java.lang.Object
clone, equals, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.concurrent.ConcurrentMap
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, replaceAll
-
Constructor Details
-
SelfCleaningTable
-
SelfCleaningTable
Creates a new Table and start a cleaner. -
SelfCleaningTable
public SelfCleaningTable(String name, SelfCleaningTable.ICleanerListener<V> cleanerListener, ConcurrentMap underlyingMap) Creates a new Table and start a cleaner.
-
-
Method Details
-
clear
public void clear() -
put
-
get
-
finalize
-
close
public void close() -
containsKey
- Specified by:
containsKeyin interfaceMap<K,V>
-
containsValue
- Specified by:
containsValuein interfaceMap<K,V>
-
entrySet
-
isEmpty
public boolean isEmpty() -
keySet
-
putAll
-
remove
-
size
public int size() -
values
-
putIfAbsent
- Specified by:
putIfAbsentin interfaceConcurrentMap<K,V> - Specified by:
putIfAbsentin interfaceMap<K,V>
-
remove
-
replace
-
replace
-
toString
-