-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrandom.c
82 lines (71 loc) · 1.8 KB
/
random.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/**
>HEADER
Copyright (c) 2004 Haixu Tang [email protected]
This file is part of the RepGraph package.
RepGraph is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
RepGraph is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with RepGraph. If not, see <http://www.gnu.org/licenses/>.
<HEADER
**/
#include <stdinc.h>
int ran_number(int n, int *idum);
double random1(int *idum);
#define MBIG 1000000000
#define MSEED 16183398
#define MZ 0
#define FAC (1.0/MBIG)
double random1(int *idum)
{
static int inext,inextp;
static long ma[56];
static int iff=0;
long mj, mk;
int i, ii,k;
if(*idum < 0 || iff == 0) { /* initialization */
iff = 1;
mj = MSEED - (*idum < 0 ? -*idum : *idum);
mj %= MBIG;
ma[55] = mj;
mk = 1;
for(i = 1; i < 54; i ++) {
ii = (21 + i) % 55;
ma[ii] = mk;
mk = mj - mk;
if(mk < MZ) mk += MBIG;
mj = ma[ii];
}
for(k = 1; k <= 4; k ++) {
for(i = 1; i <= 55; i ++) {
ma[i] -= ma[1 + (i + 30) % 55];
if(ma[i] < MZ) ma[i] += MBIG;
}
}
inext = 0;
inextp = 31;
*idum = 1;
}
if( ++inext == 56) inext = 1;
if( ++inextp == 56) inextp = 1;
mj = ma[inext] - ma[inextp];
if(mj < MZ) mj += MBIG;
ma[inext] = mj;
return(mj * FAC);
}
int ran_number(int n, int *idum)
{
double t;
int p;
t = random1(idum);
if(t == 1.0) {
t = t - 1.0e-10;
}
p = ( int ) (n * t);
return( p );
}