eaglercraft/eagler-teavm-fork
1
0
Fork 0
mirror of https://github.com/Eaglercraft-TeaVM-Fork/eagler-teavm.git synced 2024-12-22 16:14:10 -08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Make Arrays.hashCode compatible with JVM

Browse Source
This commit is contained in:
Alexey Andreev 2015-03-30 22:31:30 +03:00
parent a4cb94df2f
commit 712dfced8b
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
teavm-classlib/src/main/java/org/teavm/classlib/java/util/TArrays.java
View File

@ -1358,9 +1358,9 @@ public class TArrays extends TObject {
if (a == null) { if (a == null) {
return 0; return 0;
} }
int hash = 0xA5A537FC; int hash = 1;
for (int i = 0; i < a.length; ++i) { for (int i = 0; i < a.length; ++i) {
hash = TInteger.rotateLeft(a[i], 4) ^ TInteger.rotateRight(a[i], 7) ^ TInteger.rotateLeft(hash, 13); hash = 31 * hash + a[i];
} }
return hash; return hash;
} }
@ -1369,9 +1369,9 @@ public class TArrays extends TObject {
if (a == null) { if (a == null) {
return 0; return 0;
} }
int hash = 0xA5A537FC; int hash = 1;
for (int i = 0; i < a.length; ++i) { for (int i = 0; i < a.length; ++i) {
hash = TInteger.rotateLeft(a[i], 4) ^ TInteger.rotateRight(a[i], 7) ^ TInteger.rotateLeft(hash, 13); hash = 31 * hash + a[i];
} }
return hash; return hash;
} }
@ -1380,9 +1380,9 @@ public class TArrays extends TObject {
if (a == null) { if (a == null) {
return 0; return 0;
} }
int hash = 0xA5A537FC; int hash = 1;
for (int i = 0; i < a.length; ++i) { for (int i = 0; i < a.length; ++i) {
hash = TInteger.rotateLeft(a[i], 4) ^ TInteger.rotateRight(a[i], 7) ^ TInteger.rotateLeft(hash, 13); hash = 31 * hash + a[i];
} }
return hash; return hash;
} }
@ -1391,9 +1391,9 @@ public class TArrays extends TObject {
if (a == null) { if (a == null) {
return 0; return 0;
} }
int hash = 0xA5A537FC; int hash = 1;
for (int i = 0; i < a.length; ++i) { for (int i = 0; i < a.length; ++i) {
hash = TInteger.rotateLeft(a[i], 4) ^ TInteger.rotateRight(a[i], 7) ^ TInteger.rotateLeft(hash, 13); hash = 31 * hash + a[i];
} }
return hash; return hash;
} }