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
extern crate rand_core;
#[cfg(test)]
extern crate rand;
mod consts;
use consts::{INCREMENTOR, INIT_INC, INIT_STATE};
use rand_core::{impls, Error, RngCore};
use std::num::Wrapping;
#[derive(Debug)]
pub struct Pcg {
state: u64,
inc: u64,
}
impl Pcg {
pub fn new(seed: u64, seq: u64) -> Pcg {
let mut rng = Pcg {
state: 0,
inc: (seq << 1) | 1,
};
rng.state += seed;
rng
}
#[deprecated(
since = "1.0.0", note = "Please use the methods provided by the `Rng` trait instead."
)]
pub fn rand(&mut self) -> u32 {
let old_state = self.state;
self.state = (Wrapping(old_state) * Wrapping(INCREMENTOR) + Wrapping(self.inc)).0;
let xor_shifted = (old_state >> 18) ^ old_state >> 27;
let rot = (old_state >> 59) as i64;
let res = (xor_shifted >> rot as u64) | (xor_shifted << ((-rot) & 31));
res as u32
}
#[deprecated(
since = "1.0.0",
note = "Please use the `gen_range` or uniform distribution methods provided by the `Rng` trait
instead."
)]
pub fn bounded_rand(&mut self, bound: u32) -> u32 {
let threshold = (-(bound as i32) % (bound as i32)) as u32;
loop {
let r = self.next_u32();
if r >= threshold {
return r % bound;
}
}
}
}
impl RngCore for Pcg {
fn next_u32(&mut self) -> u32 {
self.next_u64() as u32
}
fn next_u64(&mut self) -> u64 {
let old_state = self.state;
self.state = (Wrapping(old_state) * Wrapping(INCREMENTOR) + Wrapping(self.inc)).0;
let xor_shifted = (old_state >> 18) ^ old_state >> 27;
let rot = (old_state >> 59) as i64;
(xor_shifted >> rot as u64) | (xor_shifted << ((-rot) & 31))
}
fn fill_bytes(&mut self, dest: &mut [u8]) {
impls::fill_bytes_via_next(self, dest)
}
fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error> {
Ok(self.fill_bytes(dest))
}
}
impl Default for Pcg {
fn default() -> Pcg {
Pcg {
state: INIT_STATE,
inc: INIT_INC,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use rand::Rng;
#[test]
fn test_init() {
let _rng = Pcg::new(0, 0);
}
#[test]
fn test_init_default() {
let _rng: Pcg = Default::default();
}
#[test]
fn test_rand() {
let mut rng = Pcg::default();
let n = 100000000;
for _ in 0..n {
let _rand = rng.next_u32();
}
}
#[test]
fn test_bounded_rand() {
let mut rng = Pcg::default();
let n = 10000000;
let mut v = vec![0 as u32; 10];
for _ in 0..n {
let rand = rng.gen_range(0, 10);
assert!(rand < 10);
v[rand as usize] += 1;
}
print!("{:?}", v);
let mut v = vec![0 as u32; 2];
for _ in 0..n {
let rand = rng.gen_range(0, 2);
assert!(rand < 2);
v[rand as usize] += 1;
}
print!("{:?}", v);
}
}