The hashCode() method now generates a magic prime instead of 0 for the hash of null values; this reduces collisions.

1 files changed, 2 insertions, 2 deletions

diff --git a/test/transform/resource/after-ecj/EqualsAndHashCode.java b/test/transform/resource/after-ecj/EqualsAndHashCode.java
index 7db65c82..c0bb5bbb 100644
--- a/test/transform/resource/after-ecj/EqualsAndHashCode.java
+++ b/test/transform/resource/after-ecj/EqualsAndHashCode.java
@@ -41,9 +41,9 @@
     result = ((result * PRIME) + java.util.Arrays.hashCode(this.y));
     result = ((result * PRIME) + java.util.Arrays.deepHashCode(this.z));
     final java.lang.Object $a = this.a;
-    result = ((result * PRIME) + (($a == null) ? 0 : $a.hashCode()));
+    result = ((result * PRIME) + (($a == null) ? 43 : $a.hashCode()));
     final java.lang.Object $b = this.b;
-    result = ((result * PRIME) + (($b == null) ? 0 : $b.hashCode()));
+    result = ((result * PRIME) + (($b == null) ? 43 : $b.hashCode()));
     return result;
   }
 }