Use Data.equivalent() method in KeySearch.keyEquals() (because it could be specialized to perform more efficiently), and switch arguments in Data.bytesEquivalent() usages, so that the first Data instance is more likely to optimized for comparison

This commit is contained in:
leventov
2016-03-04 21:20:12 +07:00
parent 08e21547a8
commit e677f07d46
3 changed files with 4 additions and 6 deletions
@@ -238,7 +238,7 @@ public interface MapMethods<K, V, R> {
// as in putIfAbsent()/acquireUsing(), start with update lock:
q.updateLock().lock();
MapEntry<K, V> entry = q.entry();
if (entry != null && bytesEquivalent(entry.value(), value)) {
if (entry != null && bytesEquivalent(value, entry.value())) {
q.remove(entry);
return true;
} else {
@@ -298,7 +298,7 @@ public interface MapMethods<K, V, R> {
// as in putIfAbsent()/acquireUsing(), start with update lock:
q.updateLock().lock();
MapEntry<K, V> entry = q.entry();
if (entry != null && bytesEquivalent(((MapEntry<K, V>) entry).value(), oldValue)) {
if (entry != null && bytesEquivalent(oldValue, entry.value())) {
q.replaceValue(entry, newValue);
return true;
} else {