on master help sign in
Add long value to shift ints in order to avoid overflow
commit99879dc59a3d75e5dbbf5e7b9b3f894776b3df0e authorJan Bessai <Jan.Bessai@tu-dortmund.de> dateWed 10 Jul 2013, 23:43 (13 years ago) parente5790cc
1 file changed+4−4
java/src/main/java/org/idris/rts/PrimFn.java+4−4
java/src/main/java/org/idris/rts/PrimFn.java+4−4
@@ -1078,18 +1078,18 @@ public class PrimFn {
10781078 }
10791079
10801080 public static long LZExtIT64(int x) {
1081− return (long)(x < 0 ? ((long)x) + (2 << 31) : x);
1081+ return (long)(x < 0 ? ((long)x) + (2l << 31) : x);
10821082 }
10831083 public static BigInteger LZExtITBig(int x) {
1084− return BigInteger.valueOf(x < 0 ? ((long)x) + (2 << 31) : x);
1084+ return BigInteger.valueOf(x < 0 ? ((long)x) + (2l << 31) : x);
10851085 }
10861086 public static char LZExtITChar(int x) {
1087− return (char)(x < 0 ? ((long)x) + (2 << 31) : x);
1087+ return (char)(x < 0 ? ((long)x) + (2l << 31) : x);
10881088 }
10891089 public static long[] LZExtITVec64(int[] x) {
10901090 long[] res = new long[x.length];
10911091 for (int i = 0; i < res.length; ++i) {
1092− res[i] = (long)(((long)x[i]) < 0 ? x[i] + (2 << 31) : x[i]);
1092+ res[i] = (long)(((long)x[i]) < 0 ? x[i] + (2l << 31) : x[i]);
10931093 }
10941094 return res;
10951095 }