Examples of com.hazelcast.core.ReplicatedMap

com.hazelcast.core.ReplicatedMap

A ReplicatedMap is a map like data structure with non-strong consistency (so-called eventually consistent) and values are locally stored on every node of the cluster. When accessing values, due to the eventually consistency, it is possible to read staled data since replication is not handled in a synchronous way.

Whenever a value is written asynchronously the new value will be internally distributed to all existing cluster members and eventually every node will have the new value and the cluster again is in a consistent state.

When a new node joins the cluster the new node initially will request existing values from older nodes and replicate those locally.

@param < K> the type of keys maintained by this map @param < V> the type of mapped values @since 3.2

        executor.execute(new Runnable() {
            @Override
            public void run() {
                int half = testValues.length / 2;
                for (int i = 0; i < testValues.length; i++) {
                    final ReplicatedMap map = i < half ? map1 : map2;
                    final AbstractMap.SimpleEntry<Integer, Integer> entry = testValues[i];
                    map.put(entry.getKey(), entry.getValue());
                }
            }
        }, 2, EntryEventType.ADDED, 100, 0.75, map1, map2);


        List<Entry<Integer, Integer>> entrySet1 = new ArrayList<Entry<Integer, Integer>>(map1.entrySet());

Examples of com.hazelcast.core.ReplicatedMap

Related Classes of com.hazelcast.core.ReplicatedMap