66 |
|
#include <stdio.h> |
67 |
|
#include <time.h> |
68 |
|
#include <math.h> |
69 |
+ |
#include <vector> |
70 |
+ |
namespace oopse { |
71 |
|
|
72 |
< |
class MTRand { |
73 |
< |
// Data |
74 |
< |
public: |
75 |
< |
typedef unsigned long uint32; // unsigned integer type, at least 32 bits |
72 |
> |
class MTRand { |
73 |
> |
// Data |
74 |
> |
public: |
75 |
> |
typedef unsigned long uint32; // unsigned integer type, at least 32 bits |
76 |
|
|
77 |
< |
enum { N = 624 }; // length of state vector |
78 |
< |
enum { SAVE = N + 1 }; // length of array for save() |
77 |
> |
enum { N = 624 }; // length of state vector |
78 |
> |
enum { SAVE = N + 1 }; // length of array for save() |
79 |
|
|
80 |
< |
private: |
81 |
< |
enum { M = 397 }; // period parameter |
80 |
> |
private: |
81 |
> |
enum { M = 397 }; // period parameter |
82 |
|
|
83 |
< |
uint32 state[N]; // internal state |
84 |
< |
uint32 *pNext; // next value to get from state |
85 |
< |
int left; // number of values left before reload needed |
86 |
< |
int nstrides_; |
87 |
< |
int stride_; |
83 |
> |
uint32 state[N]; // internal state |
84 |
> |
uint32 *pNext; // next value to get from state |
85 |
> |
int left; // number of values left before reload needed |
86 |
> |
int nstrides_; |
87 |
> |
int stride_; |
88 |
|
|
89 |
< |
//Methods |
90 |
< |
public: |
91 |
< |
MTRand( const uint32& oneSeed, nstrides = 1, stride = 0); // initialize with a simple uint32 |
92 |
< |
MTRand( uint32 *const bigSeed, uint32 const seedLength = N, nstrides = 1, stride = 0); // or an array |
93 |
< |
MTRand(nstrides = 1, stride = 0); // auto-initialize with /dev/urandom or time() and clock() |
89 |
> |
//Methods |
90 |
> |
public: |
91 |
> |
MTRand( const uint32& oneSeed, int nstrides, int stride); // initialize with a simple uint32 |
92 |
> |
MTRand( uint32 *const bigSeed, uint32 const seedLength, int nstrides, int stride); // or an array |
93 |
> |
MTRand(int nstrides, int stride); // auto-initialize with /dev/urandom or time() and clock() |
94 |
|
|
95 |
< |
// Do NOT use for CRYPTOGRAPHY without securely hashing several returned |
96 |
< |
// values together, otherwise the generator state can be learned after |
97 |
< |
// reading 624 consecutive values. |
95 |
> |
// Do NOT use for CRYPTOGRAPHY without securely hashing several returned |
96 |
> |
// values together, otherwise the generator state can be learned after |
97 |
> |
// reading 624 consecutive values. |
98 |
|
|
99 |
< |
// Access to 32-bit random numbers |
100 |
< |
double rand(); // real number in [0,1] |
101 |
< |
double rand( const double& n ); // real number in [0,n] |
102 |
< |
double randExc(); // real number in [0,1) |
103 |
< |
double randExc( const double& n ); // real number in [0,n) |
104 |
< |
double randDblExc(); // real number in (0,1) |
105 |
< |
double randDblExc( const double& n ); // real number in (0,n) |
106 |
< |
uint32 randInt(); // integer in [0,2^32-1] |
107 |
< |
uint32 randInt( const uint32& n ); // integer in [0,n] for n < 2^32 |
108 |
< |
double operator()() { return rand(); } // same as rand() |
99 |
> |
// Access to 32-bit random numbers |
100 |
> |
double rand(); // real number in [0,1] |
101 |
> |
double rand( const double& n ); // real number in [0,n] |
102 |
> |
double randExc(); // real number in [0,1) |
103 |
> |
double randExc( const double& n ); // real number in [0,n) |
104 |
> |
double randDblExc(); // real number in (0,1) |
105 |
> |
double randDblExc( const double& n ); // real number in (0,n) |
106 |
> |
uint32 randInt(); // integer in [0,2^32-1] (modified for striding) |
107 |
> |
uint32 rawRandInt(); // original randInt |
108 |
> |
uint32 randInt( const uint32& n ); // integer in [0,n] for n < 2^32 |
109 |
> |
double operator()() { return rand(); } // same as rand() |
110 |
|
|
111 |
< |
// Access to 53-bit random numbers (capacity of IEEE double precision) |
112 |
< |
double rand53(); // real number in [0,1) |
111 |
> |
// Access to 53-bit random numbers (capacity of IEEE double precision) |
112 |
> |
double rand53(); // real number in [0,1) |
113 |
|
|
114 |
< |
// Access to nonuniform random number distributions |
115 |
< |
double randNorm( const double& mean = 0.0, const double& variance = 0.0 ); |
114 |
> |
// Access to nonuniform random number distributions |
115 |
> |
double randNorm( const double mean = 0.0, const double variance = 0.0 ); |
116 |
|
|
117 |
< |
// Re-seeding functions with same behavior as initializers |
118 |
< |
void seed( const uint32 oneSeed ); |
119 |
< |
void seed( uint32 *const bigSeed, const uint32 seedLength = N ); |
120 |
< |
void seed(); |
118 |
< |
|
119 |
< |
// Saving and loading generator state |
120 |
< |
void save( uint32* saveArray ) const; // to array of size SAVE |
121 |
< |
void load( uint32 *const loadArray ); // from such array |
122 |
< |
friend std::ostream& operator<<( std::ostream& os, const MTRand& mtrand ); |
123 |
< |
friend std::istream& operator>>( std::istream& is, MTRand& mtrand ); |
117 |
> |
// Re-seeding functions with same behavior as initializers |
118 |
> |
void seed( const uint32 oneSeed ); |
119 |
> |
void seed( uint32 *const bigSeed, const uint32 seedLength = N ); |
120 |
> |
void seed(); |
121 |
|
|
122 |
< |
protected: |
123 |
< |
void initialize( const uint32 oneSeed ); |
124 |
< |
void reload(); |
125 |
< |
uint32 hiBit( const uint32& u ) const { return u & 0x80000000UL; } |
126 |
< |
uint32 loBit( const uint32& u ) const { return u & 0x00000001UL; } |
127 |
< |
uint32 loBits( const uint32& u ) const { return u & 0x7fffffffUL; } |
128 |
< |
uint32 mixBits( const uint32& u, const uint32& v ) const |
132 |
< |
{ return hiBit(u) | loBits(v); } |
133 |
< |
uint32 twist( const uint32& m, const uint32& s0, const uint32& s1 ) const |
134 |
< |
{ return m ^ (mixBits(s0,s1)>>1) ^ (-loBit(s1) & 0x9908b0dfUL); } |
135 |
< |
static uint32 hash( time_t t, clock_t c ); |
136 |
< |
}; |
122 |
> |
std::vector<uint32>generateSeeds(); |
123 |
> |
|
124 |
> |
// Saving and loading generator state |
125 |
> |
void save( uint32* saveArray ) const; // to array of size SAVE |
126 |
> |
void load( uint32 *const loadArray ); // from such array |
127 |
> |
friend std::ostream& operator<<( std::ostream& os, const MTRand& mtrand ); |
128 |
> |
friend std::istream& operator>>( std::istream& is, MTRand& mtrand ); |
129 |
|
|
130 |
+ |
protected: |
131 |
+ |
void initialize( const uint32 oneSeed ); |
132 |
+ |
void reload(); |
133 |
+ |
uint32 hiBit( const uint32& u ) const { return u & 0x80000000UL; } |
134 |
+ |
uint32 loBit( const uint32& u ) const { return u & 0x00000001UL; } |
135 |
+ |
uint32 loBits( const uint32& u ) const { return u & 0x7fffffffUL; } |
136 |
+ |
uint32 mixBits( const uint32& u, const uint32& v ) const |
137 |
+ |
{ return hiBit(u) | loBits(v); } |
138 |
+ |
uint32 twist( const uint32& m, const uint32& s0, const uint32& s1 ) const |
139 |
+ |
{ return m ^ (mixBits(s0,s1)>>1) ^ (-loBit(s1) & 0x9908b0dfUL); } |
140 |
+ |
static uint32 hash( time_t t, clock_t c ); |
141 |
+ |
}; |
142 |
|
|
143 |
< |
inline MTRand::MTRand( const uint32& oneSeed, int nstrides, int stride) : nstrides_(nstrides), stride_(stride) { |
143 |
> |
|
144 |
> |
inline MTRand::MTRand( const uint32& oneSeed, int nstrides, int stride) : nstrides_(nstrides), stride_(stride) { |
145 |
|
assert(stride_ < nstrides_ && stride_ >= 0); |
146 |
|
seed(oneSeed); |
147 |
< |
} |
147 |
> |
} |
148 |
|
|
149 |
< |
inline MTRand::MTRand( uint32 *const bigSeed, const uint32 seedLength, int nstrides, int stride) : nstrides_(nstrides), stride_(stride) { |
149 |
> |
inline MTRand::MTRand( uint32 *const bigSeed, const uint32 seedLength, int nstrides, int stride) : nstrides_(nstrides), stride_(stride) { |
150 |
|
assert(stride_ < nstrides_ && stride_ >= 0); |
151 |
|
seed(bigSeed,seedLength); |
152 |
< |
} |
152 |
> |
} |
153 |
|
|
154 |
< |
inline MTRand::MTRand(int nstrides, int stride) : nstrides_(nstrides), stride_(stride){ |
154 |
> |
inline MTRand::MTRand(int nstrides, int stride) : nstrides_(nstrides), stride_(stride){ |
155 |
|
assert(stride_ < nstrides_ && stride_ >= 0); |
156 |
|
seed(); |
157 |
< |
} |
157 |
> |
} |
158 |
|
|
159 |
< |
inline double MTRand::rand() |
160 |
< |
{ return double(randInt()) * (1.0/4294967295.0); } |
159 |
> |
inline double MTRand::rand() |
160 |
> |
{ return double(randInt()) * (1.0/4294967295.0); } |
161 |
|
|
162 |
< |
inline double MTRand::rand( const double& n ) |
163 |
< |
{ return rand() * n; } |
162 |
> |
inline double MTRand::rand( const double& n ) |
163 |
> |
{ return rand() * n; } |
164 |
|
|
165 |
< |
inline double MTRand::randExc() |
166 |
< |
{ return double(randInt()) * (1.0/4294967296.0); } |
165 |
> |
inline double MTRand::randExc() |
166 |
> |
{ return double(randInt()) * (1.0/4294967296.0); } |
167 |
|
|
168 |
< |
inline double MTRand::randExc( const double& n ) |
169 |
< |
{ return randExc() * n; } |
168 |
> |
inline double MTRand::randExc( const double& n ) |
169 |
> |
{ return randExc() * n; } |
170 |
|
|
171 |
< |
inline double MTRand::randDblExc() |
172 |
< |
{ return ( double(randInt()) + 0.5 ) * (1.0/4294967296.0); } |
171 |
> |
inline double MTRand::randDblExc() |
172 |
> |
{ return ( double(randInt()) + 0.5 ) * (1.0/4294967296.0); } |
173 |
|
|
174 |
< |
inline double MTRand::randDblExc( const double& n ) |
175 |
< |
{ return randDblExc() * n; } |
174 |
> |
inline double MTRand::randDblExc( const double& n ) |
175 |
> |
{ return randDblExc() * n; } |
176 |
|
|
177 |
< |
inline double MTRand::rand53() |
178 |
< |
{ |
179 |
< |
uint32 a = randInt() >> 5, b = randInt() >> 6; |
180 |
< |
return ( a * 67108864.0 + b ) * (1.0/9007199254740992.0); // by Isaku Wada |
181 |
< |
} |
177 |
> |
inline double MTRand::rand53() |
178 |
> |
{ |
179 |
> |
uint32 a = randInt() >> 5, b = randInt() >> 6; |
180 |
> |
return ( a * 67108864.0 + b ) * (1.0/9007199254740992.0); // by Isaku Wada |
181 |
> |
} |
182 |
|
|
183 |
< |
inline double MTRand::randNorm( const double& mean, const double& variance ) |
184 |
< |
{ |
185 |
< |
// Return a real number from a normal (Gaussian) distribution with given |
186 |
< |
// mean and variance by Box-Muller method |
187 |
< |
double r = sqrt( -2.0 * log( 1.0-randDblExc()) ) * variance; |
188 |
< |
double phi = 2.0 * 3.14159265358979323846264338328 * randExc(); |
189 |
< |
return mean + r * cos(phi); |
190 |
< |
} |
183 |
> |
inline double MTRand::randNorm( const double mean, const double variance ) |
184 |
> |
{ |
185 |
> |
// Return a real number from a normal (Gaussian) distribution with given |
186 |
> |
// mean and variance by Box-Muller method |
187 |
> |
assert(variance > 0); |
188 |
> |
double r = sqrt( -2.0 * log( 1.0-randDblExc()) * variance); |
189 |
> |
double phi = 2.0 * 3.14159265358979323846264338328 * randExc(); |
190 |
> |
return mean + r * cos(phi); |
191 |
> |
} |
192 |
|
|
193 |
< |
inline MTRand::uint32 MTRand::randInt() |
194 |
< |
{ |
195 |
< |
// Pull a 32-bit integer from the generator state |
196 |
< |
// Every other access function simply transforms the numbers extracted here |
193 |
> |
/** |
194 |
> |
* This function is modified from the original to allow for random |
195 |
> |
* streams on parallel jobs. It now takes numbers from by striding |
196 |
> |
* through the random stream and picking up only one of the random |
197 |
> |
* numbers per nstrides_. The number it picks is the stride_'th |
198 |
> |
* number in the stride sequence. |
199 |
> |
*/ |
200 |
> |
inline MTRand::uint32 MTRand::randInt() { |
201 |
> |
|
202 |
> |
std::vector<uint32> ranNums(nstrides_); |
203 |
> |
|
204 |
> |
for (int i = 0; i < nstrides_; ++i) { |
205 |
> |
ranNums[i] = rawRandInt(); |
206 |
> |
} |
207 |
> |
|
208 |
> |
return ranNums[stride_]; |
209 |
> |
} |
210 |
|
|
211 |
< |
uint32 ranNums[nstrides]; |
211 |
> |
/** |
212 |
> |
* This is the original randInt function which implements the mersenne |
213 |
> |
* twister. |
214 |
> |
*/ |
215 |
> |
inline MTRand::uint32 MTRand::rawRandInt() |
216 |
> |
{ |
217 |
> |
// Pull a 32-bit integer from the generator state |
218 |
> |
// Every other access function simply transforms the numbers extracted here |
219 |
> |
|
220 |
> |
if( left == 0 ) reload(); |
221 |
> |
--left; |
222 |
> |
|
223 |
> |
register uint32 s1; |
224 |
> |
s1 = *pNext++; |
225 |
> |
s1 ^= (s1 >> 11); |
226 |
> |
s1 ^= (s1 << 7) & 0x9d2c5680UL; |
227 |
> |
s1 ^= (s1 << 15) & 0xefc60000UL; |
228 |
> |
return ( s1 ^ (s1 >> 18) ); |
229 |
> |
} |
230 |
|
|
231 |
< |
for (int i = 0; i < nstrides; ++i) { |
232 |
< |
if( left == 0 ) { |
233 |
< |
reload(); |
234 |
< |
} |
235 |
< |
|
236 |
< |
--left; |
231 |
> |
inline MTRand::uint32 MTRand::randInt( const uint32& n ) |
232 |
> |
{ |
233 |
> |
// Find which bits are used in n |
234 |
> |
// Optimized by Magnus Jonsson (magnus@smartelectronix.com) |
235 |
> |
uint32 used = n; |
236 |
> |
used |= used >> 1; |
237 |
> |
used |= used >> 2; |
238 |
> |
used |= used >> 4; |
239 |
> |
used |= used >> 8; |
240 |
> |
used |= used >> 16; |
241 |
> |
|
242 |
> |
// Draw numbers until one is found in [0,n] |
243 |
> |
uint32 i; |
244 |
> |
do |
245 |
> |
i = randInt() & used; // toss unused bits to shorten search |
246 |
> |
while( i > n ); |
247 |
> |
return i; |
248 |
> |
} |
249 |
|
|
201 |
– |
register uint32 s1; |
202 |
– |
s1 = *pNext++; |
203 |
– |
s1 ^= (s1 >> 11); |
204 |
– |
s1 ^= (s1 << 7) & 0x9d2c5680UL; |
205 |
– |
s1 ^= (s1 << 15) & 0xefc60000UL; |
206 |
– |
ranNums[i] = s1 ^ (s1 >> 18) ); |
207 |
– |
} |
250 |
|
|
251 |
< |
return ranNums[stride]; |
252 |
< |
} |
251 |
> |
inline void MTRand::seed( const uint32 oneSeed ) |
252 |
> |
{ |
253 |
> |
// Seed the generator with a simple uint32 |
254 |
> |
initialize(oneSeed); |
255 |
> |
reload(); |
256 |
> |
} |
257 |
|
|
212 |
– |
inline MTRand::uint32 MTRand::randInt( const uint32& n ) |
213 |
– |
{ |
214 |
– |
// Find which bits are used in n |
215 |
– |
// Optimized by Magnus Jonsson (magnus@smartelectronix.com) |
216 |
– |
uint32 used = n; |
217 |
– |
used |= used >> 1; |
218 |
– |
used |= used >> 2; |
219 |
– |
used |= used >> 4; |
220 |
– |
used |= used >> 8; |
221 |
– |
used |= used >> 16; |
222 |
– |
|
223 |
– |
// Draw numbers until one is found in [0,n] |
224 |
– |
uint32 i; |
225 |
– |
do |
226 |
– |
i = randInt() & used; // toss unused bits to shorten search |
227 |
– |
while( i > n ); |
228 |
– |
return i; |
229 |
– |
} |
258 |
|
|
259 |
< |
|
260 |
< |
inline void MTRand::seed( const uint32 oneSeed ) |
261 |
< |
{ |
262 |
< |
// Seed the generator with a simple uint32 |
263 |
< |
initialize(oneSeed); |
264 |
< |
reload(); |
265 |
< |
} |
259 |
> |
inline void MTRand::seed( uint32 *const bigSeed, const uint32 seedLength ) |
260 |
> |
{ |
261 |
> |
// Seed the generator with an array of uint32's |
262 |
> |
// There are 2^19937-1 possible initial states. This function allows |
263 |
> |
// all of those to be accessed by providing at least 19937 bits (with a |
264 |
> |
// default seed length of N = 624 uint32's). Any bits above the lower 32 |
265 |
> |
// in each element are discarded. |
266 |
> |
// Just call seed() if you want to get array from /dev/urandom |
267 |
> |
initialize(19650218UL); |
268 |
> |
register int i = 1; |
269 |
> |
register uint32 j = 0; |
270 |
> |
register int k = ( N > seedLength ? N : seedLength ); |
271 |
> |
for( ; k; --k ) |
272 |
> |
{ |
273 |
> |
state[i] = |
274 |
> |
state[i] ^ ( (state[i-1] ^ (state[i-1] >> 30)) * 1664525UL ); |
275 |
> |
state[i] += ( bigSeed[j] & 0xffffffffUL ) + j; |
276 |
> |
state[i] &= 0xffffffffUL; |
277 |
> |
++i; ++j; |
278 |
> |
if( i >= N ) { state[0] = state[N-1]; i = 1; } |
279 |
> |
if( j >= seedLength ) j = 0; |
280 |
> |
} |
281 |
> |
for( k = N - 1; k; --k ) |
282 |
> |
{ |
283 |
> |
state[i] = |
284 |
> |
state[i] ^ ( (state[i-1] ^ (state[i-1] >> 30)) * 1566083941UL ); |
285 |
> |
state[i] -= i; |
286 |
> |
state[i] &= 0xffffffffUL; |
287 |
> |
++i; |
288 |
> |
if( i >= N ) { state[0] = state[N-1]; i = 1; } |
289 |
> |
} |
290 |
> |
state[0] = 0x80000000UL; // MSB is 1, assuring non-zero initial array |
291 |
> |
reload(); |
292 |
> |
} |
293 |
|
|
294 |
|
|
295 |
< |
inline void MTRand::seed( uint32 *const bigSeed, const uint32 seedLength ) |
296 |
< |
{ |
297 |
< |
// Seed the generator with an array of uint32's |
243 |
< |
// There are 2^19937-1 possible initial states. This function allows |
244 |
< |
// all of those to be accessed by providing at least 19937 bits (with a |
245 |
< |
// default seed length of N = 624 uint32's). Any bits above the lower 32 |
246 |
< |
// in each element are discarded. |
247 |
< |
// Just call seed() if you want to get array from /dev/urandom |
248 |
< |
initialize(19650218UL); |
249 |
< |
register int i = 1; |
250 |
< |
register uint32 j = 0; |
251 |
< |
register int k = ( N > seedLength ? N : seedLength ); |
252 |
< |
for( ; k; --k ) |
253 |
< |
{ |
254 |
< |
state[i] = |
255 |
< |
state[i] ^ ( (state[i-1] ^ (state[i-1] >> 30)) * 1664525UL ); |
256 |
< |
state[i] += ( bigSeed[j] & 0xffffffffUL ) + j; |
257 |
< |
state[i] &= 0xffffffffUL; |
258 |
< |
++i; ++j; |
259 |
< |
if( i >= N ) { state[0] = state[N-1]; i = 1; } |
260 |
< |
if( j >= seedLength ) j = 0; |
261 |
< |
} |
262 |
< |
for( k = N - 1; k; --k ) |
263 |
< |
{ |
264 |
< |
state[i] = |
265 |
< |
state[i] ^ ( (state[i-1] ^ (state[i-1] >> 30)) * 1566083941UL ); |
266 |
< |
state[i] -= i; |
267 |
< |
state[i] &= 0xffffffffUL; |
268 |
< |
++i; |
269 |
< |
if( i >= N ) { state[0] = state[N-1]; i = 1; } |
270 |
< |
} |
271 |
< |
state[0] = 0x80000000UL; // MSB is 1, assuring non-zero initial array |
272 |
< |
reload(); |
273 |
< |
} |
295 |
> |
inline void MTRand::seed() |
296 |
> |
{ |
297 |
> |
std::vector<uint32> seeds; |
298 |
|
|
299 |
+ |
seeds = generateSeeds(); |
300 |
|
|
301 |
< |
inline void MTRand::seed() |
302 |
< |
{ |
303 |
< |
// Seed the generator with an array from /dev/urandom if available |
304 |
< |
// Otherwise use a hash of time() and clock() values |
305 |
< |
|
306 |
< |
// First try getting an array from /dev/urandom |
282 |
< |
FILE* urandom = fopen( "/dev/urandom", "rb" ); |
283 |
< |
if( urandom ) |
284 |
< |
{ |
285 |
< |
uint32 bigSeed[N]; |
286 |
< |
register uint32 *s = bigSeed; |
287 |
< |
register int i = N; |
288 |
< |
register bool success = true; |
289 |
< |
while( success && i-- ) |
290 |
< |
success = fread( s++, sizeof(uint32), 1, urandom ); |
291 |
< |
fclose(urandom); |
292 |
< |
if( success ) { seed( bigSeed, N ); return; } |
293 |
< |
} |
294 |
< |
|
295 |
< |
// Was not successful, so use time() and clock() instead |
296 |
< |
seed( hash( time(NULL), clock() ) ); |
297 |
< |
} |
301 |
> |
if (seeds.size() == 1) { |
302 |
> |
seed( seeds[0] ); |
303 |
> |
} else { |
304 |
> |
seed( &seeds[0], seeds.size() ); |
305 |
> |
} |
306 |
> |
} |
307 |
|
|
308 |
|
|
309 |
< |
inline void MTRand::initialize( const uint32 seed ) |
310 |
< |
{ |
311 |
< |
// Initialize generator state with seed |
303 |
< |
// See Knuth TAOCP Vol 2, 3rd Ed, p.106 for multiplier. |
304 |
< |
// In previous versions, most significant bits (MSBs) of the seed affect |
305 |
< |
// only MSBs of the state array. Modified 9 Jan 2002 by Makoto Matsumoto. |
306 |
< |
register uint32 *s = state; |
307 |
< |
register uint32 *r = state; |
308 |
< |
register int i = 1; |
309 |
< |
*s++ = seed & 0xffffffffUL; |
310 |
< |
for( ; i < N; ++i ) |
311 |
< |
{ |
312 |
< |
*s++ = ( 1812433253UL * ( *r ^ (*r >> 30) ) + i ) & 0xffffffffUL; |
313 |
< |
r++; |
314 |
< |
} |
315 |
< |
} |
309 |
> |
inline std::vector<MTRand::uint32> MTRand::generateSeeds() { |
310 |
> |
// Seed the generator with an array from /dev/urandom if available |
311 |
> |
// Otherwise use a hash of time() and clock() values |
312 |
|
|
313 |
+ |
std::vector<uint32> bigSeed; |
314 |
|
|
315 |
< |
inline void MTRand::reload() |
316 |
< |
{ |
317 |
< |
// Generate N new values in state |
318 |
< |
// Made clearer and faster by Matthew Bellew (matthew.bellew@home.com) |
319 |
< |
register uint32 *p = state; |
320 |
< |
register int i; |
321 |
< |
for( i = N - M; i--; ++p ) |
322 |
< |
*p = twist( p[M], p[0], p[1] ); |
323 |
< |
for( i = M; --i; ++p ) |
324 |
< |
*p = twist( p[M-N], p[0], p[1] ); |
325 |
< |
*p = twist( p[M-N], p[0], state[0] ); |
315 |
> |
// First try getting an array from /dev/urandom |
316 |
> |
FILE* urandom = fopen( "/dev/urandom", "rb" ); |
317 |
> |
if( urandom ) |
318 |
> |
{ |
319 |
> |
bigSeed.resize(N); |
320 |
> |
register uint32 *s = &bigSeed[0]; |
321 |
> |
register int i = N; |
322 |
> |
register bool success = true; |
323 |
> |
while( success && i-- ) |
324 |
> |
success = fread( s++, sizeof(uint32), 1, urandom ); |
325 |
> |
fclose(urandom); |
326 |
> |
if( success ) { return bigSeed; } |
327 |
> |
} |
328 |
> |
|
329 |
> |
// Was not successful, so use time() and clock() instead |
330 |
|
|
331 |
< |
left = N, pNext = state; |
332 |
< |
} |
331 |
> |
bigSeed.push_back(hash( time(NULL), clock())); |
332 |
> |
return bigSeed; |
333 |
> |
} |
334 |
|
|
335 |
|
|
336 |
< |
inline MTRand::uint32 MTRand::hash( time_t t, clock_t c ) |
337 |
< |
{ |
338 |
< |
// Get a uint32 from t and c |
339 |
< |
// Better than uint32(x) in case x is floating point in [0,1] |
340 |
< |
// Based on code by Lawrence Kirby (fred@genesis.demon.co.uk) |
336 |
> |
inline void MTRand::initialize( const uint32 seed ) |
337 |
> |
{ |
338 |
> |
// Initialize generator state with seed |
339 |
> |
// See Knuth TAOCP Vol 2, 3rd Ed, p.106 for multiplier. |
340 |
> |
// In previous versions, most significant bits (MSBs) of the seed affect |
341 |
> |
// only MSBs of the state array. Modified 9 Jan 2002 by Makoto Matsumoto. |
342 |
> |
register uint32 *s = state; |
343 |
> |
register uint32 *r = state; |
344 |
> |
register int i = 1; |
345 |
> |
*s++ = seed & 0xffffffffUL; |
346 |
> |
for( ; i < N; ++i ) |
347 |
> |
{ |
348 |
> |
*s++ = ( 1812433253UL * ( *r ^ (*r >> 30) ) + i ) & 0xffffffffUL; |
349 |
> |
r++; |
350 |
> |
} |
351 |
> |
} |
352 |
|
|
340 |
– |
static uint32 differ = 0; // guarantee time-based seeds will change |
353 |
|
|
354 |
< |
uint32 h1 = 0; |
355 |
< |
unsigned char *p = (unsigned char *) &t; |
356 |
< |
for( size_t i = 0; i < sizeof(t); ++i ) |
357 |
< |
{ |
358 |
< |
h1 *= UCHAR_MAX + 2U; |
359 |
< |
h1 += p[i]; |
360 |
< |
} |
361 |
< |
uint32 h2 = 0; |
362 |
< |
p = (unsigned char *) &c; |
363 |
< |
for( size_t j = 0; j < sizeof(c); ++j ) |
364 |
< |
{ |
353 |
< |
h2 *= UCHAR_MAX + 2U; |
354 |
< |
h2 += p[j]; |
355 |
< |
} |
356 |
< |
return ( h1 + differ++ ) ^ h2; |
357 |
< |
} |
354 |
> |
inline void MTRand::reload() |
355 |
> |
{ |
356 |
> |
// Generate N new values in state |
357 |
> |
// Made clearer and faster by Matthew Bellew (matthew.bellew@home.com) |
358 |
> |
register uint32 *p = state; |
359 |
> |
register int i; |
360 |
> |
for( i = N - M; i--; ++p ) |
361 |
> |
*p = twist( p[M], p[0], p[1] ); |
362 |
> |
for( i = M; --i; ++p ) |
363 |
> |
*p = twist( p[M-N], p[0], p[1] ); |
364 |
> |
*p = twist( p[M-N], p[0], state[0] ); |
365 |
|
|
366 |
+ |
left = N, pNext = state; |
367 |
+ |
} |
368 |
|
|
360 |
– |
inline void MTRand::save( uint32* saveArray ) const |
361 |
– |
{ |
362 |
– |
register uint32 *sa = saveArray; |
363 |
– |
register const uint32 *s = state; |
364 |
– |
register int i = N; |
365 |
– |
for( ; i--; *sa++ = *s++ ) {} |
366 |
– |
*sa = left; |
367 |
– |
} |
369 |
|
|
370 |
+ |
inline MTRand::uint32 MTRand::hash( time_t t, clock_t c ) |
371 |
+ |
{ |
372 |
+ |
// Get a uint32 from t and c |
373 |
+ |
// Better than uint32(x) in case x is floating point in [0,1] |
374 |
+ |
// Based on code by Lawrence Kirby (fred@genesis.demon.co.uk) |
375 |
|
|
376 |
< |
inline void MTRand::load( uint32 *const loadArray ) |
371 |
< |
{ |
372 |
< |
register uint32 *s = state; |
373 |
< |
register uint32 *la = loadArray; |
374 |
< |
register int i = N; |
375 |
< |
for( ; i--; *s++ = *la++ ) {} |
376 |
< |
left = *la; |
377 |
< |
pNext = &state[N-left]; |
378 |
< |
} |
376 |
> |
static uint32 differ = 0; // guarantee time-based seeds will change |
377 |
|
|
378 |
+ |
uint32 h1 = 0; |
379 |
+ |
unsigned char *p = (unsigned char *) &t; |
380 |
+ |
for( size_t i = 0; i < sizeof(t); ++i ) |
381 |
+ |
{ |
382 |
+ |
h1 *= UCHAR_MAX + 2U; |
383 |
+ |
h1 += p[i]; |
384 |
+ |
} |
385 |
+ |
uint32 h2 = 0; |
386 |
+ |
p = (unsigned char *) &c; |
387 |
+ |
for( size_t j = 0; j < sizeof(c); ++j ) |
388 |
+ |
{ |
389 |
+ |
h2 *= UCHAR_MAX + 2U; |
390 |
+ |
h2 += p[j]; |
391 |
+ |
} |
392 |
+ |
return ( h1 + differ++ ) ^ h2; |
393 |
+ |
} |
394 |
|
|
381 |
– |
inline std::ostream& operator<<( std::ostream& os, const MTRand& mtrand ) |
382 |
– |
{ |
383 |
– |
register const MTRand::uint32 *s = mtrand.state; |
384 |
– |
register int i = mtrand.N; |
385 |
– |
for( ; i--; os << *s++ << "\t" ) {} |
386 |
– |
return os << mtrand.left; |
387 |
– |
} |
395 |
|
|
396 |
+ |
inline void MTRand::save( uint32* saveArray ) const |
397 |
+ |
{ |
398 |
+ |
register uint32 *sa = saveArray; |
399 |
+ |
register const uint32 *s = state; |
400 |
+ |
register int i = N; |
401 |
+ |
for( ; i--; *sa++ = *s++ ) {} |
402 |
+ |
*sa = left; |
403 |
+ |
} |
404 |
|
|
390 |
– |
inline std::istream& operator>>( std::istream& is, MTRand& mtrand ) |
391 |
– |
{ |
392 |
– |
register MTRand::uint32 *s = mtrand.state; |
393 |
– |
register int i = mtrand.N; |
394 |
– |
for( ; i--; is >> *s++ ) {} |
395 |
– |
is >> mtrand.left; |
396 |
– |
mtrand.pNext = &mtrand.state[mtrand.N-mtrand.left]; |
397 |
– |
return is; |
398 |
– |
} |
405 |
|
|
406 |
+ |
inline void MTRand::load( uint32 *const loadArray ) |
407 |
+ |
{ |
408 |
+ |
register uint32 *s = state; |
409 |
+ |
register uint32 *la = loadArray; |
410 |
+ |
register int i = N; |
411 |
+ |
for( ; i--; *s++ = *la++ ) {} |
412 |
+ |
left = *la; |
413 |
+ |
pNext = &state[N-left]; |
414 |
+ |
} |
415 |
+ |
|
416 |
+ |
|
417 |
+ |
inline std::ostream& operator<<( std::ostream& os, const MTRand& mtrand ) |
418 |
+ |
{ |
419 |
+ |
register const MTRand::uint32 *s = mtrand.state; |
420 |
+ |
register int i = mtrand.N; |
421 |
+ |
for( ; i--; os << *s++ << "\t" ) {} |
422 |
+ |
return os << mtrand.left; |
423 |
+ |
} |
424 |
+ |
|
425 |
+ |
|
426 |
+ |
inline std::istream& operator>>( std::istream& is, MTRand& mtrand ) |
427 |
+ |
{ |
428 |
+ |
register MTRand::uint32 *s = mtrand.state; |
429 |
+ |
register int i = mtrand.N; |
430 |
+ |
for( ; i--; is >> *s++ ) {} |
431 |
+ |
is >> mtrand.left; |
432 |
+ |
mtrand.pNext = &mtrand.state[mtrand.N-mtrand.left]; |
433 |
+ |
return is; |
434 |
+ |
} |
435 |
+ |
|
436 |
+ |
} |
437 |
|
#endif // MERSENNETWISTER_H |
438 |
|
|
439 |
|
// Change log: |