EquivalenceChecker: more robust expression sorting

GitOrigin-RevId: 7c2287c2fccd4868e5c17480e9bda49e0317c16f
This commit is contained in:
Tagir Valeev
2020-07-03 17:13:20 +07:00
committed by intellij-monorepo-bot
parent 79e806b35b
commit f3b5023004
3 changed files with 4 additions and 3 deletions

View File

@@ -2,7 +2,7 @@
class X {
public int hashCode() {
int result = super.hashCode();
for (int i : new int[]{field != null ? field.hashCode() : 0, field2 != null ? field2.hashCode() : 0, field3 != null ? field3.hashCode() : 0, field4 != null ? field4.hashCode() : 0, field5 != null ? field5.hashCode() : 0}) {
for (int i : new int[]{field != null ? field.hashCode() : 0, (field2 != null) ? field2.hashCode() : 0, field3 != null ? field3.hashCode() : 0, field4 != null ? field4.hashCode() : 0, field5 != null ? field5.hashCode() : 0}) {
result = 31 * result + (i);
}
return result;

View File

@@ -3,7 +3,7 @@ class X {
public int hashCode() {
int result = super.hashCode();
<selection>result = 31 * result + (field != null ? field.hashCode() : 0);
result = 31 * result + (field2 != null ? field2.hashCode() : 0);
result = 31 * result + ((field2 != null) ? field2.hashCode() : 0);
result = 31 * result + (field3 != null ? field3.hashCode() : 0);
result = 31 * result + (field4 != null ? field4.hashCode() : 0);
result = 31 * result + (field5 != null ? field5.hashCode() : 0);</selection>