No, you don't have to do that. The only requirement is that keys in putAll map are always ordered in the same way. In other words, intersecting keys in two concurrent putAlls should not be ordered differently.
For example, these two operations can lead to deadlock if executed concurrently: // Only keys are listed for simplicity. putAll(1, 2, 3); putAll(4, 3, 2); Here keys 2 and 3 are reordered and it's possible that they will wait for each other forever. To avoid this you should use ordered map (e.g., TreeMap) instead of HashMap. It will guarantee that the order of the keys is always the same. Makes sense? -Val -- View this message in context: http://apache-ignite-users.70518.x6.nabble.com/putAll-stoping-at-600-entries-tp817p891.html Sent from the Apache Ignite Users mailing list archive at Nabble.com.
