WebSVN – wimsdev – Diff – /trunk/wims/src/Lib/mt19937ar.c

 static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
 /* initializes mt[N] with a seed */
 void init_genrand(unsigned long s)
+{
-    mt[0]= s & 0xffffffffUL;
+  mt[0]= s & 0xffffffffUL;
-    for (mti=1; mti<N; mti++) {
+  for (mti=1; mti<N; mti++) {
-        mt[mti] =
+    mt[mti] =
-            (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
+    (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
-        /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
+      /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
-        /* In the previous versions, MSBs of the seed affect   */
+      /* In the previous versions, MSBs of the seed affect   */
-        /* only MSBs of the array mt[].                        */
+      /* only MSBs of the array mt[].                        */
-        /* 2002/01/09 modified by Makoto Matsumoto             */
+      /* 2002/01/09 modified by Makoto Matsumoto             */
-        mt[mti] &= 0xffffffffUL;
+    mt[mti] &= 0xffffffffUL;
-        /* for >32 bit machines */
+      /* for >32 bit machines */
-    }
+  }
+}
 /* initialize by an array with array-length */
 /* init_key is the array for initializing keys */
 /* key_length is its length */
 /* slight change for C++, 2004/2/26 */
 void init_by_array(unsigned long init_key[], int key_length)
+{
-    int i, j, k;
+  int i, j, k;
-    init_genrand(19650218UL);
+  init_genrand(19650218UL);
-    i=1; j=0;
+  i=1; j=0;
-    k = (N>key_length ? N : key_length);
+  k = (N>key_length ? N : key_length);
-    for (; k; k--) {
+  for (; k; k--) {
-        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+    mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
-          + init_key[j] + j; /* non linear */
+        + init_key[j] + j; /* non linear */
-        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+    mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
-        i++; j++;
+    i++; j++;
-        if (i>=N) { mt[0] = mt[N-1]; i=1; }
+    if (i>=N) { mt[0] = mt[N-1]; i=1; }
-        if (j>=key_length) j=0;
+    if (j>=key_length) j=0;
-    }
+  }
-    for (k=N-1; k; k--) {
+  for (k=N-1; k; k--) {
-        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
+    mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
-          - i; /* non linear */
+      - i; /* non linear */
-        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+    mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
-        i++;
+    i++;
-        if (i>=N) { mt[0] = mt[N-1]; i=1; }
+    if (i>=N) { mt[0] = mt[N-1]; i=1; }
-    }
+  }
-    mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
+  mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
+}
 /* generates a random number on [0,0xffffffff]-interval */
 unsigned long genrand_int32(void)
 {
-    unsigned long y;
+  unsigned long y;
-    static unsigned long mag01[2]={0x0UL, MATRIX_A};
+  static unsigned long mag01[2]={0x0UL, MATRIX_A};
-    /* mag01[x] = x * MATRIX_A  for x=0,1 */
+  /* mag01[x] = x * MATRIX_A  for x=0,1 */
-    if (mti >= N) { /* generate N words at one time */
-        int kk;
-        if (mti == N+1)   /* if init_genrand() has not been called, */
-            init_genrand(5489UL); /* a default initial seed is used */
-        for (kk=0;kk<N-M;kk++) {
-            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
-            mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
-        }
-        for (;kk<N-1;kk++) {
-            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
-            mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
-        }
-        y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
-        mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
+  if (mti >= N) { /* generate N words at one time */
-        mti = 0;
+    int kk;
+    if (mti == N+1)   /* if init_genrand() has not been called, */
+      init_genrand(5489UL); /* a default initial seed is used */
+    for (kk=0;kk<N-M;kk++) {
+      y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+      mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
+    }
+    for (;kk<N-1;kk++) {
+      y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+      mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
+    }
+    y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
+    mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
+    mti = 0;
+  }
-    y = mt[mti++];
+  y = mt[mti++];
-    /* Tempering */
+  /* Tempering */
-    y ^= (y >> 11);
+  y ^= (y >> 11);
-    y ^= (y << 7) & 0x9d2c5680UL;
+  y ^= (y << 7) & 0x9d2c5680UL;
-    y ^= (y << 15) & 0xefc60000UL;
+  y ^= (y << 15) & 0xefc60000UL;
-    y ^= (y >> 18);
+  y ^= (y >> 18);
-    return y;
+  return y;
+}
 /* generates a random number on [0,0x7fffffff]-interval */
 long genrand_int31(void)
+{
-    return (long)(genrand_int32()>>1);
+  return (long)(genrand_int32()>>1);
+}
 /* generates a random number on [0,1]-real-interval */
 double genrand_real1(void)
+{
-    return genrand_int32()*(1.0/4294967295.0);
+  return genrand_int32()*(1.0/4294967295.0);
     /* divided by 2^32-1 */
+}
 /* generates a random number on [0,1)-real-interval */
 double genrand_real2(void)
 {
-    return genrand_int32()*(1.0/4294967296.0);
+  return genrand_int32()*(1.0/4294967296.0);
     /* divided by 2^32 */
+}
 /* generates a random number on (0,1)-real-interval */
 double genrand_real3(void)
+{
-    return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
+  return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
     /* divided by 2^32 */
 }
 /* generates a random number on [0,1) with 53-bit resolution*/
 double genrand_res53(void)
+{
-    unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
+  unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
-    return(a*67108864.0+b)*(1.0/9007199254740992.0);
+  return(a*67108864.0+b)*(1.0/9007199254740992.0);
+}
 /* These real versions are due to Isaku Wada, 2002/01/09 added */

Subversion Repositories wimsdev

(root)/trunk/wims/src/Lib/mt19937ar.c – Rev 8160 → 12260