73 lines
2 KiB
C++
Executable file
73 lines
2 KiB
C++
Executable file
#include "StdAfx.h"
|
|
#include "mt19937.h"
|
|
|
|
CMT19937::CMT19937()
|
|
{
|
|
mti = N+1;
|
|
mag01[0] = 0;
|
|
|
|
/* mag01[x] = x * MATRIX_A for x=0,1 */
|
|
mag01[1] = MATRIX_A;
|
|
}
|
|
|
|
CMT19937::~CMT19937()
|
|
{
|
|
|
|
}
|
|
|
|
void CMT19937::SGenRand(uint32_t seed)
|
|
{
|
|
/* setting initial seeds to mt[N] using */
|
|
/* the generator Line 25 of Table 1 in */
|
|
/* [KNUTH 1981, The Art of Computer Programming */
|
|
/* Vol. 2 (2nd Ed.), pp102] */
|
|
// mt[0]= seed & 0xffffffff;
|
|
// for (mti=1; mti<N; mti++)
|
|
// mt[mti] = (69069 * mt[mti-1]) & 0xffffffff;
|
|
|
|
mt[0]= seed & 0xffffffffUL;
|
|
for (mti=1; mti<N; mti++) {
|
|
mt[mti] =
|
|
(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
|
|
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
|
|
/* In the previous versions, MSBs of the seed affect */
|
|
/* only MSBs of the array mt[]. */
|
|
/* 2002/01/09 modified by Makoto Matsumoto */
|
|
mt[mti] &= 0xffffffffUL;
|
|
/* for >32 bit machines */
|
|
}
|
|
|
|
}
|
|
|
|
uint32_t CMT19937::GenRand()
|
|
{
|
|
uint32_t y;
|
|
|
|
if (mti >= N) { /* generate N words at one time */
|
|
int kk;
|
|
|
|
if (mti == N+1) /* if sgenrand() has not been called, */
|
|
SGenRand(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 & 0x1];
|
|
}
|
|
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 & 0x1];
|
|
}
|
|
y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
|
|
mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1];
|
|
|
|
mti = 0;
|
|
}
|
|
|
|
y = mt[mti++];
|
|
y ^= TEMPERING_SHIFT_U(y);
|
|
y ^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B;
|
|
y ^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C;
|
|
y ^= TEMPERING_SHIFT_L(y);
|
|
|
|
return y;
|
|
}
|