LGram16
dd97ddec92
Move git root from Client/ to src/ to track all source code: - Client: Game client source (moved to Client/Client/) - Server: Game server source - GameTools: Development tools - CryptoSource: Encryption utilities - database: Database scripts - Script: Game scripts - rylCoder_16.02.2008_src: Legacy coder tools - GMFont, Game: Additional resources 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
65 lines
2.6 KiB
C++
65 lines
2.6 KiB
C++
// mtrand.cpp, see include file mtrand.h for information
|
|
#include "../stdafx.h"
|
|
#include "PseudoRandom.h"
|
|
#include <time.h>
|
|
// non-inline function definitions and static member definitions cannot
|
|
// reside in header file because of the risk of multiple declarations
|
|
|
|
// initialization of static private members
|
|
/*unsigned long MersenneTwister::state[Constant1] = {0x0UL};
|
|
int MersenneTwister::position = 0;*/
|
|
namespace Math
|
|
{
|
|
MersenneTwister::MersenneTwister(BOOL useCurrentTime) {
|
|
if ( useCurrentTime) {
|
|
time_t t; time(&t);
|
|
SetSeed(unsigned long(t));
|
|
} else {
|
|
SetSeed(5489UL);
|
|
}
|
|
}
|
|
|
|
void MersenneTwister::GenerateState() { // generate new state vector
|
|
for (int i = 0; i < (Constant1 - Constant2); ++i)
|
|
state[i] = state[i + Constant2] ^ Twiddle(state[i], state[i + 1]);
|
|
for (int i = Constant1 - Constant2; i < (Constant1 - 1); ++i)
|
|
state[i] = state[i + Constant2 - Constant1] ^ Twiddle(state[i], state[i + 1]);
|
|
state[Constant1 - 1] = state[Constant2 - 1] ^ Twiddle(state[Constant1 - 1], state[0]);
|
|
position = 0; // reset position
|
|
}
|
|
|
|
void MersenneTwister::SetSeed(unsigned long s) { // initialized by 32 bit seed
|
|
|
|
for ( int i=0; i<Constant1; ++i) { state[i]= 0x0UL; }
|
|
//state[Constant1] = {0x0UL};
|
|
state[0] = s & 0xFFFFFFFFUL; // for > 32 bit machines
|
|
for (int i = 1; i < Constant1; ++i) {
|
|
state[i] = 1812433253UL * (state[i - 1] ^ (state[i - 1] >> 30)) + i;
|
|
// see Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier
|
|
// in the previous versions, MSBs of the seed affect only MSBs of the array state
|
|
// 2002/01/09 modified by Makoto Matsumoto
|
|
state[i] &= 0xFFFFFFFFUL; // for > 32 bit machines
|
|
}
|
|
position = Constant1; // force GenerateState() to be called for next random number
|
|
}
|
|
|
|
void MersenneTwister::SetSeed(const unsigned long* array, int size) { // initialized by array
|
|
SetSeed(19650218UL);
|
|
int i = 1, j = 0;
|
|
for (int k = ((Constant1 > size) ? Constant1 : size); k; --k) {
|
|
state[i] = (state[i] ^ ((state[i - 1] ^ (state[i - 1] >> 30)) * 1664525UL))
|
|
+ array[j] + j; // non linear
|
|
state[i] &= 0xFFFFFFFFUL; // for > 32 bit machines
|
|
++j; j %= size;
|
|
if ((++i) == Constant1) { state[0] = state[Constant1 - 1]; i = 1; }
|
|
}
|
|
for (int k = Constant1 - 1; k; --k) {
|
|
state[i] = (state[i] ^ ((state[i - 1] ^ (state[i - 1] >> 30)) * 1566083941UL)) - i;
|
|
state[i] &= 0xFFFFFFFFUL; // for > 32 bit machines
|
|
if ((++i) == Constant1) { state[0] = state[Constant1 - 1]; i = 1; }
|
|
}
|
|
state[0] = 0x80000000UL; // MSB is 1; assuring non-zero initial array
|
|
position = Constant1; // force GenerateState() to be called for next random number
|
|
}
|
|
|
|
}
|