public class SizeConcurrentHashMap<K,V> extends ConcurrentHashMap<K,V>
clear() the size can be incorrect.ConcurrentHashMap.KeySetView<K,V>AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description | 
|---|
| SizeConcurrentHashMap() | 
| SizeConcurrentHashMap(int initialCapacity) | 
| SizeConcurrentHashMap(int initialCapacity,
                     float loadFactor,
                     int concurrencyLevel) | 
| SizeConcurrentHashMap(Map<K,V> t) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | clear() | 
| V | put(K key,
   V value) | 
| V | putIfAbsent(K key,
           V value) | 
| V | remove(Object key) | 
| boolean | remove(Object key,
      Object value) | 
| int | size() | 
compute, computeIfAbsent, computeIfPresent, contains, containsKey, containsValue, elements, entrySet, equals, forEach, forEach, forEach, forEachEntry, forEachEntry, forEachKey, forEachKey, forEachValue, forEachValue, get, getOrDefault, hashCode, isEmpty, keys, keySet, keySet, mappingCount, merge, newKeySet, newKeySet, putAll, reduce, reduceEntries, reduceEntries, reduceEntriesToDouble, reduceEntriesToInt, reduceEntriesToLong, reduceKeys, reduceKeys, reduceKeysToDouble, reduceKeysToInt, reduceKeysToLong, reduceToDouble, reduceToInt, reduceToLong, reduceValues, reduceValues, reduceValuesToDouble, reduceValuesToInt, reduceValuesToLong, replace, replace, replaceAll, search, searchEntries, searchKeys, searchValues, toString, valuesclonepublic SizeConcurrentHashMap(int initialCapacity,
                             float loadFactor,
                             int concurrencyLevel)
public SizeConcurrentHashMap(int initialCapacity)
public SizeConcurrentHashMap()
public final V putIfAbsent(K key, V value)
putIfAbsent in interface ConcurrentMap<K,V>putIfAbsent in interface Map<K,V>putIfAbsent in class ConcurrentHashMap<K,V>public final int size()
Copyright © GigaSpaces.