Create a gist now

Instantly share code, notes, and snippets.

Various rand (). (C MT Xorshift VisualBasic TurboC VIsualC++ etc...
#ifdef RANDS_H
#define RANDS_H
#include <stdio.h>
#include <stdint.h>
//-------------------------------------------------------------------------------//
// Xorshift //
//-------------------------------------------------------------------------------//
uint32_t xorshift_seed[6] = { 123456789, 362436069, 521288629, 88675123, 2463534242, 88172645463325252ULL };
void init_xor(uint32_t s) {
for (uint32_t i = 0; i<6; ++i) xorshift_seed[i] = s = 1812433253U * (s ^ (s >> 30)) + i;
}
uint32_t xor(void) {
uint32_t y = xorshift_seed[4];
y = y ^ (y << 13); y = y ^ (y >> 17);
return y = y ^ (y << 5);
}
uint32_t xor64(void) {
uint64_t x = xorshift_seed[5];
x = x ^ (x << 13); x = x ^ (x >> 7);
return x = x ^ (x << 17);
}
uint32_t xor96(void) {
uint32_t x = xorshift_seed[0];
uint32_t y = xorshift_seed[1];
uint32_t z = xorshift_seed[2];
uint32_t t;
t = (x ^ (x << 3)) ^ (y ^ (y >> 19)) ^ (z ^ (z << 6));
x = y; y = z;
return z = t;
}
uint32_t xor128(void) {
uint32_t x = xorshift_seed[0];
uint32_t y = xorshift_seed[1];
uint32_t z = xorshift_seed[2];
uint32_t w = xorshift_seed[3];
uint32_t t;
t = x ^ (x << 11);
x = y; y = z; z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
//-------------------------------------------------------------------------------//
// UNIX /usr/ucb/cc rand //
//-------------------------------------------------------------------------------//
//UNIX /usr/ucb/cc rand()
long usr_ucb_cc_rndx = 1;
void usr_ucb_cc_srand(long a) { usr_ucb_cc_rndx=a; }
long usr_ucb_cc_rand(void) {/* x = x * 1103515245 + 12345;*/ return (usr_ucb_cc_rndx * 1103515245 + 12345) & 2147483647; }
//-------------------------------------------------------------------------------//
// Visual C++ Rand //
//-------------------------------------------------------------------------------//
long visual_cppx = 1;
void visual_cpp_srand(long a) { visual_cppx = a; }
int visual_cpp_rand(void) { visual_cppx = visual_cppx * 214013 + 2531011; return(int)(visual_cppx >> 16) & 32767; }
//-------------------------------------------------------------------------------//
// Borland C++ Rand //
//-------------------------------------------------------------------------------//
long borland_cppx = 22695478;
int borland_cpp_rand(void) { borland_cppx = borland_cppx * 22695477 + 1; return(int)(borland_cppx >> 16) & 32767; }
void borland_cpp_srand(long a) { borland_cppx = a; borland_cpp_rand(); }
//-------------------------------------------------------------------------------//
// TurboC 1.5 rand //
//-------------------------------------------------------------------------------//
long turbocx = 1;
int turboc_rand(void) { turbocx = turbocx* 22695477 + 1; return(int)(turbocx >> 16) & 32767; }
void turboc_srand(long a) { turbocx = a; }
//-------------------------------------------------------------------------------//
// Visual Basic rand //
//-------------------------------------------------------------------------------//
long vbx = 327680;
float vb_rand(void) { return (vbx * 16598013 + 12820163 & 16777215)*(1.0 / 16777216.0);}
//-------------------------------------------------------------------------------//
// UNIX drand48 //
//-------------------------------------------------------------------------------//
long drand48x = 0x1234ABCD330E;
double rands_drand48()
{
drand48x = drand48x * 0x5DEECE66D + 0xB;
return (drand48x & 0xFFFFFFFFFFFF)*(1.0 / 281474976710656.0);
}
long rands_lrand48()
{
drand48x = drand48x * 0x5DEECE66D + 0xB;
return(long)(drand48x >> 17) & 0x7FFFFFFF;
}
long rands_mrand48()
{
drand48x = drand48x * 0x5DEECE66D + 0xB;
return(long)(drand48x >> 16) & 0xFFFFFFFF;
}
void rands_drand48_srand48(long s)
{
drand48x = s;
drand48x = (drand48x << 16) + 0x330E;
}
//-------------------------------------------------------------------------------//
// UNIX random() //
//-------------------------------------------------------------------------------//
unsigned unixx[32];
int unix_random(void)
{
unsigned n = (unsigned)unixx[0];
if (n == 31) n = 1; else n++;
unixx[0] = n; unixx[n] += (n>3 ? unixx[n - 3] : unixx[n + 31 - 3]);
return(unixx[n] >> 1) & 0x7FFFFFFF;
}
void old_unix_srandom(int s)
{
int i;
unixx[0] = 3; unixx[1] = (unsigned)s;
for (i = 2; i <= 31; i++) unixx[i] = 1103515245 * unixx[i - 1] + 12345;
for (i = 0; i<310; i++) unix_random();
}
void new_unix_srandom(int seed) {
int i; long long s = seed;
if (s == 0) s = 1;
unixx[0] = 3; unixx[1] = (unsigned)s;
for (i = 2; i <= 31; i++) {
s = (16807 * s) % 2147483647;
if (s<0) s += 2147483647;
unixx[i] = (unsigned)s;
}
for (i = 0; i<310; i++) unix_random();
}
//-------------------------------------------------------------------------------//
// .Net Random //
//-------------------------------------------------------------------------------//
int dotnetindex, dotnetx[56];
void dotnet_rand_init(int seed) {
int i, j, k;
seed = 161803398 - (seed<0 ? -seed : seed); dotnetx[55] = seed; k = 1;
for (i = 1; i<55; i++) {
j = (21 * i) % 55; dotnetx[j] = k; k = seed - k;
if (k<0) k += 2147483647;
seed = dotnetx[j];
}
for (j = 1; j<5; j++) for (i = 1; i<56; i++) {
dotnetx[i] -= dotnetx[1 + (i + 30) % 55];
if (dotnetx[i]<0) dotnetx[i] += 2147483647;
}
dotnetindex = 0;
}
int dotnet_rand_next(void) {
int r;
if (++dotnetindex >= 56) dotnetindex = 1;
r = dotnetx[dotnetindex] - dotnetx[dotnetindex <= 34 ? dotnetindex + 21 : dotnetindex - 34];
if (r<0) r += 2147483647;
dotnetx[dotnetindex] = r; return r;
}
//-------------------------------------------------------------------------------//
// Mersenne twister //
//-------------------------------------------------------------------------------//
/*
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.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
/*
The original version of http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/mt19937ar.c was modified by Takahiro Omi as
- delete line 47 "#include<stdio.h>"
- delete line 174 int main(void){...}
- change N -> MT_N
- change N -> MT_N
- change the file name "mt19937ar.c" -> "MT.h"
*/
/* Period parameters */
#define MT_N 624
#define MT_M 397
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
static unsigned long mt[MT_N]; /* the array for the state vector */
static int mti = MT_N + 1; /* mti==MT_N+1 means mt[MT_N] is not initialized */
/* initializes mt[MT_N] with a seed */
void mt_init_genrand(unsigned long s)
{
mt[0] = s & 0xffffffffUL;
for (mti = 1; mti<MT_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 */
}
}
/* 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 */
void mt_init_by_array(unsigned long init_key[], int key_length)
{
int i, j, k;
mt_init_genrand(19650218UL);
i = 1; j = 0;
k = (MT_N>key_length ? MT_N : key_length);
for (; k; k--) {
mt[i] = (mt[i] ^ ((mt[i - 1] ^ (mt[i - 1] >> 30)) * 1664525UL))
+ init_key[j] + j; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++; j++;
if (i >= MT_N) { mt[0] = mt[MT_N - 1]; i = 1; }
if (j >= key_length) j = 0;
}
for (k = MT_N - 1; k; k--) {
mt[i] = (mt[i] ^ ((mt[i - 1] ^ (mt[i - 1] >> 30)) * 1566083941UL))
- i; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++;
if (i >= MT_N) { mt[0] = mt[MT_N - 1]; i = 1; }
}
mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long mt_genrand_int32(void)
{
unsigned long y;
static unsigned long mag01[2] = { 0x0UL, MATRIX_A };
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (mti >= MT_N) { /* generate N words at one time */
int kk;
if (mti == MT_N + 1) /* if init_genrand() has not been called, */
mt_init_genrand(5489UL); /* a default initial seed is used */
for (kk = 0; kk<MT_N - MT_M; kk++) {
y = (mt[kk] & UPPER_MASK) | (mt[kk + 1] & LOWER_MASK);
mt[kk] = mt[kk + MT_M] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
for (; kk<MT_N - 1; kk++) {
y = (mt[kk] & UPPER_MASK) | (mt[kk + 1] & LOWER_MASK);
mt[kk] = mt[kk + (MT_M - MT_N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
y = (mt[MT_N - 1] & UPPER_MASK) | (mt[0] & LOWER_MASK);
mt[MT_N - 1] = mt[MT_M - 1] ^ (y >> 1) ^ mag01[y & 0x1UL];
mti = 0;
}
y = mt[mti++];
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return y;
}
/* generates a random number on [0,0x7fffffff]-interval */
long mt_genrand_int31(void)
{
return (long)(mt_genrand_int32() >> 1);
}
/* generates a random number on [0,1]-real-interval */
double mt_genrand_real1(void)
{
return mt_genrand_int32()*(1.0 / 4294967295.0);
/* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
return mt_genrand_int32()*(1.0 / 4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
double mt_genrand_real3(void)
{
return (((double)mt_genrand_int32()) + 0.5)*(1.0 / 4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
double mt_genrand_res53(void)
{
unsigned long a = mt_genrand_int32() >> 5, b = mt_genrand_int32() >> 6;
return(a*67108864.0 + b)*(1.0 / 9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */
#endif
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment