00001 /* 00002 A C-program for MT19937, with initialization improved 2002/1/26. 00003 Coded by Takuji Nishimura and Makoto Matsumoto. 00004 00005 Before using, initialize the state by using init_genrand(seed) 00006 or init_by_array(init_key, key_length). 00007 00008 Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura, 00009 All rights reserved. 00010 00011 Redistribution and use in source and binary forms, with or without 00012 modification, are permitted provided that the following conditions 00013 are met: 00014 00015 1. Redistributions of source code must retain the above copyright 00016 notice, this list of conditions and the following disclaimer. 00017 00018 2. Redistributions in binary form must reproduce the above copyright 00019 notice, this list of conditions and the following disclaimer in the 00020 documentation and/or other materials provided with the distribution. 00021 00022 3. The names of its contributors may not be used to endorse or promote 00023 products derived from this software without specific prior written 00024 permission. 00025 00026 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00027 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00028 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 00029 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 00030 CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00031 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00032 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00033 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00034 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00035 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00036 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00037 00038 00039 Any feedback is very welcome. 00040 http://www.math.keio.ac.jp/matumoto/emt.html 00041 email: matumoto@math.keio.ac.jp 00042 */ 00043 00044 #include "mersenne.h" 00045 #include <stdio.h> 00046 00047 /* initializes mt[N] with a seed */ 00048 Mersenne:: 00049 Mersenne(unsigned long seed) { 00050 mt[0]= seed & 0xffffffffUL; 00051 for (mti=1; mti<N; mti++) { 00052 mt[mti] = 00053 (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti); 00054 /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */ 00055 /* In the previous versions, MSBs of the seed affect */ 00056 /* only MSBs of the array mt[]. */ 00057 /* 2002/01/09 modified by Makoto Matsumoto */ 00058 mt[mti] &= 0xffffffffUL; 00059 /* for >32 bit machines */ 00060 } 00061 } 00062 00063 /* generates a random number on [0,0x7fffffff]-interval */ 00064 unsigned long Mersenne:: 00065 get_uint31() { 00066 unsigned long y; 00067 static unsigned long mag01[2]={0x0UL, MATRIX_A}; 00068 /* mag01[x] = x * MATRIX_A for x=0,1 */ 00069 00070 if (mti >= N) { /* generate N words at one time */ 00071 int kk; 00072 00073 for (kk=0;kk<N-M;kk++) { 00074 y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK); 00075 mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL]; 00076 } 00077 for (;kk<N-1;kk++) { 00078 y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK); 00079 mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL]; 00080 } 00081 y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK); 00082 mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL]; 00083 00084 mti = 0; 00085 } 00086 00087 y = mt[mti++]; 00088 00089 /* Tempering */ 00090 y ^= (y >> 11); 00091 y ^= (y << 7) & 0x9d2c5680UL; 00092 y ^= (y << 15) & 0xefc60000UL; 00093 y ^= (y >> 18); 00094 00095 return y >> 1; 00096 }