ConcurrentHashMap.put V.S. ConcurrentHashMap.replace

java concurrency map java.util.concurrent concurrenthashmap
Zhao Yi picture Zhao Yi · Aug 15, 2012 · Viewed 8.2k times · Source

From the Javadoc I know ConcurrentHashMap.replace is atomic, but what about ConcurrentHashMap.put? I see they are differently implemented in the source code but I'm not able to figure out their differences. Any gurus to give some guidelines about how to use these two methods?

Answer

Jesper picture Jesper · Aug 15, 2012

They are functionally different. replace only stores the key-value pair if there already was a value stored under the specified key. The API documentation of replace explains it:

Replaces the entry for a key only if currently mapped to some value. This is equivalent to

if (map.containsKey(key)) {
    return map.put(key, value);
} else return null;

except that the action is performed atomically.

Related questions

Why doesn't Java ship with a CopyOnWriteMap?

The JDK ships with CopyOnWrite* implementations for Set and List, but none for Map and I've often lamented this fact. I know there are other collections implementations out there that have them, but it would be nice if one shipped …

Read More
How to wait for all threads to finish, using ExecutorService?

I need to execute some amount of tasks 4 at a time, something like this: ExecutorService taskExecutor = Executors.newFixedThreadPool(4); while(...) { taskExecutor.execute(new MyTask()); } //...wait for completion somehow How can I get notified once all of them are complete? For now …

Read More
What's the difference between ConcurrentHashMap and Collections.synchronizedMap(Map)?

I have a Map which is to be modified by several threads concurrently. There seem to be three different synchronized Map implementations in the Java API: Hashtable Collections.synchronizedMap(Map) ConcurrentHashMap From what I understand, Hashtable is an old implementation (…

Read More