本文参考:点击打开链接
一、V putIfAbsent(K key, V value);
此方法解释:如果key对应的值value不存在就put,且返回null。如果key对应的值value已存在,则返回已存在的值,且value不能为null,否则会报空指针异常。
测试如下:
private static ConcurrentMap<String, Long> wordCounts = new ConcurrentHashMap<>();
public static void main(String[] args) throws InterruptedException, ExecutionException {
System.out.println(wordCounts.putIfAbsent("1111", 111L));
System.out.println(wordCounts.putIfAbsent("1111", 222L));
System.out.println(wordCounts.putIfAbsent("1111", 333L));
}
打印结果如下:
null
111
111
二、参考文章中的方法解释:
public static void increase(String word) {
while (true) {
Long tempCount = wordCounts.get(word);
if (tempCount == null) {
//此处可能有多个线程到达
System.out.println("线程=["+Thread.currentThread().getName()+"]已经到达1");
// Add the word firstly, initial the value as 1
if (wordCounts.putIfAbsent(word, 1L) == null) {
System.out.println("线程=["+Thread.currentThread().getName()+"]已经到达2");
break;
}
} else {
System.out.println("线程=["+Thread.currentThread().getName()+"]已经到达3");
if (wordCounts.replace(word, tempCount, tempCount + 1)) {
System.out.println("线程=["+Thread.currentThread().getName()+"]已经到达4");
break;
}
}
}
}