Set hashes to 0 if entry gets deleted

from functional perspective this is not necessary as it would never reach the point to compare the hashes. However, when debugging, it helps to also see the deleted hashes.
jruby · Sep 1, 2018 · bd2e0c0 · bd2e0c0
1 parent 899afc7
commit bd2e0c0
Showing 1 changed file with 2 additions and 0 deletions.
diff --git a/core/src/main/java/org/jruby/RubyHash.java b/core/src/main/java/org/jruby/RubyHash.java
@@ -733,6 +733,7 @@ private final IRubyObject internalDeleteOpenAddressing(final int hash, final Ent
                 otherValue = entries[(index * NUMBER_OF_ENTRIES) + 1];
                 if (matchType.matches(key, value, otherKey, otherValue)) {
                   bins[bin] = DELETED_BIN;
+                  hashes[index] = 0;
                   entries[index * NUMBER_OF_ENTRIES] = null;
                   entries[(index * NUMBER_OF_ENTRIES) + 1] = null;
                   size--;
@@ -759,6 +760,7 @@ private final IRubyObject internalDeleteLinearSearch(final int hash, final Entry
                 continue;
 
             if (matchType.matches(key, value, otherKey, otherValue)) {
+              hashes[index] = 0;
               entries[index * NUMBER_OF_ENTRIES] = null;
               entries[(index * NUMBER_OF_ENTRIES) + 1] = null;
               size--;