-
Notifications
You must be signed in to change notification settings - Fork 0
/
rnd.h
259 lines (214 loc) · 7.25 KB
/
rnd.h
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is COID/comm module.
*
* The Initial Developer of the Original Code is
* Brano Kemen.
* Portions created by the Initial Developer are Copyright (C) 2003
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Brano Kemen
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#ifndef __COID_COMM_RND__HEADER_FILE__
#define __COID_COMM_RND__HEADER_FILE__
#include "namespace.h"
#include "comm.h"
#include <time.h>
COID_NAMESPACE_BEGIN
///Fast integer random generator
class rnd_int
{
uint _uval;
public:
void seed(uint useed) {
_uval = useed;
rand3();
}
uint rand() { return rand0(); }
uint rand0() { return _uval = 3141592653UL*_uval + 1; }
uint rand1() { return _uval = 3267000013UL*_uval + 1; }
uint rand2() { return _uval = 3628273133UL*_uval + 1; }
uint rand3() { return _uval = 3367900313UL*_uval + 1; }
void nrand(uint n, uint *puval) {
uint utv= _uval;
for(uint i=0; i<n; ++i) {
utv= 3141592653UL*utv +1;
puval[i]= utv;
}
_uval= utv;
}
uint get_old() const { return _uval; }
static uint get_multiplier() { return 3141592653UL; }
static rnd_int * init(uint useed) {
rnd_int *ornd= new rnd_int (useed);
return ornd;
}
rnd_int( uint sd=0 )
{
if( sd == 0 )
sd = (uint)::time(0);
seed(sd);
}
};
////////////////////////////////////////////////////////////////////////////////
class rnd_int2
{
uint _mult;
uint _val;
public:
rnd_int2() : _mult(3141592653UL), _val(1) {}
uint rand(uint a, uint b) const {
return (a+b)*_mult + 1;
}
uint rand(uint a) const {
return a*_mult + 1;
}
uint rand() {
_val= _mult*_val + 1;
return _val;
}
void nrand(uint n, uint *puval) {
uint utv = _val;
for(uint i=0; i<n; ++i) {
utv = _mult*utv + 1;
puval[i] = utv;
}
_val= utv;
}
void seed(uint seed) {
_val = seed;
}
void set_mul(uint mul) {
_mult = mul;
}
};
////////////////////////////////////////////////////////////////////////////////
/// unsigned long symetric generator
class rnd_int_sym {
public:
static uint rand (uint useeda, uint useedb) {
// return 3141592653UL*useeda +useedb +1;
return 3141592653UL*(useeda +useedb +1); //symetric
}
private:
rnd_int_sym() {};
};
////////////////////////////////////////////////////////////////////////////////
#define TEMPERING_SHIFT_U(y) (y >> 11)
#define TEMPERING_SHIFT_S(y) (y << 7)
#define TEMPERING_SHIFT_T(y) (y << 15)
#define TEMPERING_SHIFT_L(y) (y >> 18)
/// unsigned long random generator
class rnd_strong {
enum {
// Period parameters
N= 624,
M= 397,
MATRIX_A= 0x9908b0df, // constant vector a
UPPER_MASK= 0x80000000, // most significant w-r bits
LOWER_MASK= 0x7fffffff, // least significant r bits
// Tempering parameters
TEMPERING_MASK_B= 0x9d2c5680,
TEMPERING_MASK_C= 0xefc60000,
};
uint _mt[N]; // the array for the state vector
uint _mti; // _mti==N+1 means _mt[N] is not initialized
//uint _mag01[2];
// _mag01[x] = x * MATRIX_A for x=0,1
public:
// initializing the array with a NONZERO seed
void seed(uint seed) {
// setting initial seeds to _mt[N] using
// the generator Line 25 of Table 1 in
// [KNUTH 1981, The Art of Computer Programming
// Vol. 2 (2nd Ed.), pp102]
_mt[0]= seed;
for (_mti=1; _mti<N; ++_mti)
_mt[_mti] = 69069 * _mt[_mti-1];
}
uint rand() {
uint y;
static unsigned long mag01[2]={0x0UL, MATRIX_A};
if (_mti >= N) { // generate N words at one time */
uint kk;
if (_mti == N+1) // if seed() has not been called
seed(4357); // a default initial seed is used
for (kk=0;kk<N-M;kk++) {
y= (_mt[kk]&UPPER_MASK) | (_mt[kk+1]&LOWER_MASK);
_mt[kk]= _mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1];
}
for (;kk<N-1;kk++) {
y= (_mt[kk]&UPPER_MASK) | (_mt[kk+1]&LOWER_MASK);
_mt[kk]= _mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1];
}
y= (_mt[N-1]&UPPER_MASK) | (_mt[0]&LOWER_MASK);
_mt[N-1]= _mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1];
_mti = 0;
}
y= _mt[_mti++];
y^= TEMPERING_SHIFT_U(y);
y^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B;
y^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C;
y^= TEMPERING_SHIFT_L(y);
return y;
}
void nrand(uint n, uint *puout) {
uint i, y;
static unsigned long mag01[2]={0x0UL, MATRIX_A};
for(i=0; i<n; ++i) {
if (_mti >= N) { // generate N words at one time
uint kk;
if (_mti == N+1) // if seed() has not been called,
seed(4357); // a default initial seed is used
for (kk=0;kk<N-M;kk++) {
y= (_mt[kk]&UPPER_MASK) | (_mt[kk+1]&LOWER_MASK);
_mt[kk]= _mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1];
}
for (;kk<N-1;kk++) {
y= (_mt[kk]&UPPER_MASK) | (_mt[kk+1]&LOWER_MASK);
_mt[kk]= _mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1];
}
y= (_mt[N-1]&UPPER_MASK) | (_mt[0]&LOWER_MASK);
_mt[N-1]= _mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1];
_mti = 0;
}
y= _mt[_mti++];
y^= TEMPERING_SHIFT_U(y);
y^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B;
y^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C;
y^= TEMPERING_SHIFT_L(y);
puout[i]= y;
}
}
rnd_strong( uint seedi=1 )
{
seed(seedi);
};
};
COID_NAMESPACE_END
#endif