Without testing, because I'm stuck on a train and running out of battery...
I need to determine whether or not Hazelcast's IMap concurrent updates are thread safe updating the same key but different values of that key.
For example:
Let's say I have 2 different threads updating the same IMap key...
For all intents and purposes, this map looks like the following:
key: {value1: 1, value2: 2}
One thread says,
"I am updating value1 to 3"
the other thread says (at the same time)
"I am updating value2 to 4".
How does Hazelcast handle this?
Will the final result look like the following?
key: {value1: 3, value2: 4}
Hazelcast uses partitions. Key is hashed to find the right partition for that entry.
Each partition is single-threaded, there is only one partition-thread handling each partition. So two update for a single key are handled by a single partition-thread.
If both updated keys land in the same partition, these operations will be sequential on a single partition-thread. If each key lands in a different partition - different threads will handle each update.
I don't really understand your notation: key: {value1: 1, value2: 2} -> it looks like a nested map.
Also you say: the same key but different values of that key. -> in a map, each key has a single value only (unless the value is a collection or a map)
