Alawn/Chronicle-Map
1
0
Fork 0
mirror of https://github.com/OpenHFT/Chronicle-Map.git synced 2021-09-13 01:26:12 +00:00
Code Releases Activity

Make MaximizingValueMapEntryOperations eventually consistent

Browse Source
This commit is contained in:
leventov
2015-05-18 13:49:50 +01:00
parent 5829cdbfba
commit 4aa0af1acf
1 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/test/java/net/openhft/chronicle/map/MaximizingValueMapEntryOperations.java
+7 -2
View File
@@ -19,6 +19,7 @@
package net.openhft.chronicle.map;
import net.openhft.chronicle.hash.Value;
import net.openhft.chronicle.hash.replication.ReplicatedEntry;
import net.openhft.chronicle.hash.replication.ReplicationContext;
import org.jetbrains.annotations.NotNull;
@@ -27,8 +28,12 @@ public class MaximizingValueMapEntryOperations<K, V extends Comparable<? super V
@Override
public boolean replaceValue(@NotNull MapEntry<K, V> entry, Value<V, ?> newValue) {
if (entry.context() instanceof ReplicationContext) {
if (newValue.get().compareTo(entry.value().get()) > 0) {
MapContext<K, V> context = entry.context();
if (context instanceof ReplicationContext) {
int compareResult = newValue.get().compareTo(entry.value().get());
if (compareResult > 0 || (compareResult == 0 &&
((ReplicationContext) context).remoteIdentifier() <=
((ReplicatedEntry) entry).originIdentifier())) {
// replace, if the new value is greater
entry.doReplaceValue(newValue);
return true;