2023-05-31 19:59:41 +08:00
|
|
|
package xyz.zhouxy.plusone.commons.collection;
|
|
|
|
|
|
|
|
|
|
import java.util.Map;
|
|
|
|
|
import java.util.concurrent.ConcurrentHashMap;
|
|
|
|
|
import java.util.function.Function;
|
|
|
|
|
|
2023-07-06 10:06:39 +08:00
|
|
|
import javax.annotation.concurrent.ThreadSafe;
|
|
|
|
|
|
|
|
|
|
@ThreadSafe
|
2023-05-31 19:59:41 +08:00
|
|
|
public class SafeConcurrentHashMap<K, V> extends ConcurrentHashMap<K, V> {
|
|
|
|
|
|
2023-06-27 00:47:39 +08:00
|
|
|
private static final long serialVersionUID = 4352954948768449595L;
|
|
|
|
|
|
2023-05-31 19:59:41 +08:00
|
|
|
/**
|
|
|
|
|
* Creates a new, empty map with the default initial table size (16).
|
|
|
|
|
*/
|
|
|
|
|
public SafeConcurrentHashMap() {
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Creates a new, empty map with an initial table size
|
|
|
|
|
* accommodating the specified number of elements without the need
|
|
|
|
|
* to dynamically resize.
|
|
|
|
|
*
|
|
|
|
|
* @param initialCapacity The implementation performs internal
|
|
|
|
|
* sizing to accommodate this many elements.
|
|
|
|
|
* @throws IllegalArgumentException if the initial capacity of
|
|
|
|
|
* elements is negative
|
|
|
|
|
*/
|
|
|
|
|
public SafeConcurrentHashMap(int initialCapacity) {
|
|
|
|
|
super(initialCapacity);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Creates a new map with the same mappings as the given map.
|
|
|
|
|
*
|
|
|
|
|
* @param m the map
|
|
|
|
|
*/
|
|
|
|
|
public SafeConcurrentHashMap(Map<? extends K, ? extends V> m) {
|
|
|
|
|
super(m);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Creates a new, empty map with an initial table size based on
|
|
|
|
|
* the given number of elements ({@code initialCapacity}) and
|
|
|
|
|
* initial table density ({@code loadFactor}).
|
|
|
|
|
*
|
|
|
|
|
* @param initialCapacity the initial capacity. The implementation
|
|
|
|
|
* performs internal sizing to accommodate this many elements,
|
|
|
|
|
* given the specified load factor.
|
|
|
|
|
* @param loadFactor the load factor (table density) for
|
|
|
|
|
* establishing the initial table size
|
|
|
|
|
* @throws IllegalArgumentException if the initial capacity of
|
|
|
|
|
* elements is negative or the load factor is nonpositive
|
|
|
|
|
* @since 1.6
|
|
|
|
|
*/
|
|
|
|
|
public SafeConcurrentHashMap(int initialCapacity, float loadFactor) {
|
|
|
|
|
super(initialCapacity, loadFactor);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Creates a new, empty map with an initial table size based on
|
|
|
|
|
* the given number of elements ({@code initialCapacity}), table
|
|
|
|
|
* density ({@code loadFactor}), and number of concurrently
|
|
|
|
|
* updating threads ({@code concurrencyLevel}).
|
|
|
|
|
*
|
|
|
|
|
* @param initialCapacity the initial capacity. The implementation
|
|
|
|
|
* performs internal sizing to accommodate this many elements,
|
|
|
|
|
* given the specified load factor.
|
|
|
|
|
* @param loadFactor the load factor (table density) for
|
|
|
|
|
* establishing the initial table size
|
|
|
|
|
* @param concurrencyLevel the estimated number of concurrently
|
|
|
|
|
* updating threads. The implementation may use this value as
|
|
|
|
|
* a sizing hint.
|
|
|
|
|
* @throws IllegalArgumentException if the initial capacity is
|
|
|
|
|
* negative or the load factor or concurrencyLevel are
|
|
|
|
|
* nonpositive
|
|
|
|
|
*/
|
|
|
|
|
public SafeConcurrentHashMap(int initialCapacity, float loadFactor, int concurrencyLevel) {
|
|
|
|
|
super(initialCapacity, loadFactor, concurrencyLevel);
|
|
|
|
|
}
|
|
|
|
|
|
2023-06-27 00:47:39 +08:00
|
|
|
/** {@inheritDoc} */
|
2023-05-31 19:59:41 +08:00
|
|
|
@Override
|
|
|
|
|
public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) {
|
|
|
|
|
V v = get(key);
|
|
|
|
|
if (null == v) {
|
|
|
|
|
putIfAbsent(key, mappingFunction.apply(key));
|
|
|
|
|
v = get(key);
|
|
|
|
|
}
|
|
|
|
|
return v;
|
|
|
|
|
}
|
|
|
|
|
}
|