4 long RANDOM_DEFAULT_SEED;
13 RANDOM_DEFAULT_SEED = 0L;
18 MATRIX_A = 0x9908b0dfL; /* constant vector a */
19 UPPER_MASK = 0x80000000L; /* most significant w-r bits */
20 LOWER_MASK = 0x7fffffffL; /* least significant r bits */
23 public void random_alloc() {
24 init_genrand(this.RANDOM_DEFAULT_SEED);
27 /* initializes mt[N] with a seed */
28 public void init_genrand(long s) {
30 mt[0]= s & 0xFFFFFFFFL;
31 for (mti=1; mti<N; mti++) {
32 mt[mti] = (1812433253L * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
33 /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
34 /* In the previous versions, MSBs of the seed affect */
35 /* only MSBs of the array mt[]. */
36 /* 2002/01/09 modified by Makoto Matsumoto */
37 mt[mti] &= 0xFFFFFFFFL;
38 /* for >32 bit machines */
43 public void random_seed(long seed) {
47 public long random_generate() {
48 return genrand_int32();
51 //public static long genrand_int32(long[] mt, long mtiPtr) {
52 public long genrand_int32() {
54 long[] mag01= new long[2];
59 /* mag01[x] = x * MATRIX_A for x=0,1 */
61 if (mti >= N) { /* generate N words at one time */
64 if (mti == N+1) /* if init_genrand() has not been called, */
65 init_genrand(5489L); /* a default initial seed is used */
67 for (kk=0;kk<N-M;kk++) {
68 y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
69 mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[(int)(y & 0x1L)];
72 y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
73 mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[(int)(y & 0x1L)];
75 y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
76 mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[(int)(y & 0x1L)];
85 y ^= (y << 7) & 0x9d2c5680L;
86 y ^= (y << 15) & 0xefc60000L;