// MODULE : mt19937ar // Mersenne Twister for HSP3 // // This module is a HSP-ported version of the original C-language program: // Mersenne Twister with improved initialization (2002) // http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/mt19937ar.c // // 2006/8/24, originally coded by Masashi Nakanishi. // // // The following is the original license terms: /* A C-program for MT19937, with initialization improved 2002/1/26. Coded by Takuji Nishimura and Makoto Matsumoto. Before using, initialize the state by using init_genrand(seed) or init_by_array(init_key, key_length). Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura, All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. The names of its contributors may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /* The real number versions are due to Isaku Wada, 2002/01/09 added */ #ifndef _MT19937AR_INCLUDED_ #define _MT19937AR_INCLUDED_ #module mt19937ar /* Period parameters */ #define N 624 #define M 397 #define MATRIX_A 0x9908b0df /* constant vector a */ #define UPPER_MASK 0x80000000 /* most significant w-r bits */ #define LOWER_MASK 0x7fffffff /* least significant r bits */ /* intra-module variables initialization routine */ *initialize dim mt, N /* the array for the state vector */ mti = N + 1 /* mti==N+1 means mt() is not initialized */ dim mag01, 2 : mag01 = 0x0, MATRIX_A /* mag01(x) = x * MATRIX_A for x=0,1 */ return /* initializes mt() with a seed */ #deffunc mt_init_genrand int s mt(0) = s & 0xffffffff repeat N - 1, 1 mt(cnt) = 1812433253 * (mt(cnt-1) ^ ((mt(cnt-1) >> 30) & 0x3)) + cnt /* 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(cnt) &= 0xffffffff /* for >32 bit machines */ loop mti = N return /* 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 */ #deffunc mt_init_by_array array init_key, int key_length mt_init_genrand 19650218 i = 1 : j = 0 if N > key_length : k = N : else : k = key_length while k mt(i) = (mt(i) ^ ((mt(i-1) ^ ((mt(i-1) >> 30) & 0x3)) * 1664525)) + init_key(j) + j /* non linear */ // mt(i) &= 0xffffffff; /* for WORDSIZE > 32 machines */ i++ : j++ if i >= N : mt(0) = mt(N-1) : i = 1 if j >= key_length : j = 0 k-- wend k = N - 1 while k mt(i) = (mt(i) ^ ((mt(i-1) ^ ((mt(i-1) >> 30) & 0x3)) * 1566083941)) - i /* non linear */ // mt(i) &= 0xffffffff /* for WORDSIZE > 32 machines */ i++ if i >= N : mt(0) = mt(N-1) : i = 1 k-- wend mt(0) = 0x80000000 /* MSB is 1; assuring non-zero initial array */ return /* generates a random number on [0,0xffffffff]-interval */ #defcfunc mt_genrand_int32 if mti >= N { /* generate N words at one time */ if mti == N + 1 { /* if init_genrand() has not been called, */ mt_init_genrand 5489 /* a default initial seed is used */ } repeat N - M y = (mt(cnt) & UPPER_MASK) | (mt(cnt+1) & LOWER_MASK) mt(cnt) = mt(cnt+M) ^ ((y >> 1) & 0x7fffffff) ^ mag01(y & 0x1) loop repeat M - 1, N - M y = (mt(cnt) & UPPER_MASK) | (mt(cnt+1) & LOWER_MASK) mt(cnt) = mt(cnt+(M-N)) ^ ((y >> 1) & 0x7fffffff) ^ mag01(y & 0x1) loop y = (mt(N-1) & UPPER_MASK) | (mt(0) & LOWER_MASK) mt(N-1) = mt(M-1) ^ ((y >> 1) & 0x7fffffff) ^ mag01(y & 0x1) mti = 0 } y = mt(mti) : mti++ /* Tempering */ y ^= (y >> 11) & 0x001fffff y ^= (y << 7) & 0x9d2c5680 y ^= (y << 15) & 0xefc60000 y ^= (y >> 18) & 0x00003fff return y /* generates a random number on [0,0x7fffffff]-interval */ #defcfunc mt_genrand_int31 return (mt_genrand_int32() >> 1) & 0x7fffffff /* generates a random number on [0,1]-real-interval */ #defcfunc mt_genrand_real1 a = mt_genrand_int32() return (double((a >> 1) & 0x7fffffff) * 2.0 + (a & 0x1)) * (1.0 / 4294967295.0) /* divided by 2^32-1 */ /* generates a random number on [0,1)-real-interval */ #defcfunc mt_genrand_real2 a = mt_genrand_int32() return (double((a >> 1) & 0x7fffffff) * 2.0 + (a & 0x1)) * (1.0 / 4294967296.0) /* divided by 2^32 */ /* generates a random number on (0,1)-real-interval */ #defcfunc mt_genrand_real3 a = mt_genrand_int32() return (double((a >> 1) & 0x7fffffff) * 2.0 + (a & 0x1) + 0.5) * (1.0 / 4294967296.0) /* divided by 2^32 */ /* generates a random number on [0,1) with 53-bit resolution */ #defcfunc mt_genrand_res53 a = (mt_genrand_int32() >> 5) & 0x07ffffff : b = (mt_genrand_int32() >> 6) & 0x03ffffff return (double(a) * 67108864.0 + b) * (1.0 / 9007199254740992.0) /* test code to compare the output with http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/mt19937ar.out */ *testcode init = 0x123, 0x234, 0x345, 0x456 mt_init_by_array init, 4 out = "1000 outputs of genrand_int32()\n" repeat 1000 out += strf("%10lu ", mt_genrand_int32()) if cnt \ 5 == 4 : out += "\n" loop out += "\n1000 outputs of genrand_real2()\n" repeat 1000 out += strf("%10.8f ", mt_genrand_real2()) if cnt \ 5 == 4 : out += "\n" loop mesbox out, ginfo_winx, ginfo_winy return #global gosub *initialize@mt19937ar #endif // _MT19937AR_INCLUDED_