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

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

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/net/openhft/chronicle/hash/Data.java
+1 -1
View File
@@ -34,7 +34,7 @@ import static net.openhft.chronicle.algo.bytes.Access.checkedRandomDataInputAcce
* <p>In most cases, each particular value wraps either some object or some bytes. Object
* is marshalled to bytes lazily on demand, and bytes are lazily deserialized to object,
* accordingly.
*
*
* @param <T> type of the accessed objects
*/
public interface Data<T> {
src/main/java/net/openhft/chronicle/hash/impl/stage/query/KeySearch.java
+1 -3
View File
@@ -84,9 +84,7 @@ public abstract class KeySearch<K> {
}
boolean keyEquals(long keySize, long keyOffset) {
return inputKey.size() == keySize &&
BytesUtil.bytesEqual(s.segmentBS, keyOffset,
inputKey.bytes(), inputKey.offset(), keySize);
return inputKey.size() == keySize && inputKey.equivalent(s.segmentBS, keyOffset);
}
public boolean searchStatePresent() {
src/main/java/net/openhft/chronicle/map/MapMethods.java
+2 -2
View File
@@ -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 {