1 |
+ |
/* |
2 |
+ |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
+ |
* Expert Group and released to the public domain, as explained at |
4 |
+ |
* http://creativecommons.org/licenses/publicdomain |
5 |
+ |
*/ |
6 |
|
|
7 |
|
public class FinalLongTest { |
8 |
|
static int npairs = 2; |
15 |
|
static Long n1 = new Long(22); |
16 |
|
static Long n2 = new Long(23); |
17 |
|
static Long n3 = new Long(23); |
18 |
< |
|
18 |
> |
|
19 |
|
|
20 |
|
public static void main(String[] args) { |
21 |
|
for (int i = 0; i < LEN; ++i) |
32 |
|
} |
33 |
|
} |
34 |
|
|
35 |
< |
static long nextRandom(long seed) { |
35 |
> |
static long nextRandom(long seed) { |
36 |
|
return (seed * 0x5DEECE66DL + 0xBL) & ((1L << 48) - 1); |
37 |
|
} |
38 |
|
|
47 |
|
Long[] ns = nums; |
48 |
|
|
49 |
|
while (n-- > 0) { |
50 |
< |
// int k = (int)(s & (LEN-1)); |
50 |
> |
// int k = (int) (s & (LEN-1)); |
51 |
|
// if (k < 0 || k >= LEN) k = 1; |
52 |
|
// int l = (k+1) & (LEN-1); |
53 |
|
// if (l < 0 || l >= LEN) l = 0; |
78 |
|
int n = iters; |
79 |
|
long s = initialSeed(this); |
80 |
|
while (s != 0 && n > 0) { |
81 |
< |
long nexts; // = nums[(int)(s & (LEN-1))].longValue(); |
81 |
> |
long nexts; // = nums[(int) (s & (LEN-1))].longValue(); |
82 |
|
if ((s & (LEN-1)) == 0) |
83 |
|
nexts = n0.longValue(); |
84 |
|
else |
90 |
|
nexts = n3.longValue(); |
91 |
|
} |
92 |
|
|
93 |
< |
if (nexts != s) |
93 |
> |
if (nexts != s) |
94 |
|
--n; |
95 |
|
else if (done) |
96 |
|
break; |
98 |
|
} |
99 |
|
done = true; |
100 |
|
total += s; |
101 |
< |
if (s == 0) |
101 |
> |
if (s == 0) |
102 |
|
throw new Error("Saw uninitialized value"); |
103 |
|
} |
104 |
|
} |