-
Notifications
You must be signed in to change notification settings - Fork 8
/
practrand.go
237 lines (208 loc) · 5.17 KB
/
practrand.go
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
// Copyright 2022 Gregory Petrosyan <gregory.petrosyan@gmail.com>
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at https://mozilla.org/MPL/2.0/.
package main
import (
"encoding/binary"
"flag"
"fmt"
exprand "golang.org/x/exp/rand"
"hash/maphash"
"log"
"math"
"math/bits"
mathrand "math/rand"
"os"
"pgregory.net/rand"
)
const (
chunkSizeBits = 1 << 16
chunkSizeBytes = chunkSizeBits / 8
numChunks = 1024
bufSizeBits = numChunks * chunkSizeBits
bufSizeBytes = bufSizeBits / 8
bufSizeWords = bufSizeBytes / 8
maxInt52 = 1<<52 - 1
)
type randGen interface {
Uint64() uint64
Float64() float64
NormFloat64() float64
ExpFloat64() float64
}
type wyrandSource struct {
seed uint64
}
func (s *wyrandSource) Seed(seed uint64) {
s.seed = seed // bad idea
}
func (s *wyrandSource) Uint64() uint64 {
s.seed += 0xa0761d6478bd642f
hi, lo := bits.Mul64(s.seed, s.seed^0xe7037ed1a0b428db)
return hi ^ lo
}
type rand64 struct {
rng randGen
}
func (r *rand64) raw() uint64 {
return r.rng.Uint64()
}
func (r *rand64) fromF64() uint64 {
return floatToUniform(r.rng.Float64(), r.rng.Float64())
}
func (r *rand64) fromNorm() uint64 {
return floatToUniform(normalCDF(r.rng.NormFloat64()), normalCDF(r.rng.NormFloat64()))
}
func (r *rand64) fromExp() uint64 {
return floatToUniform(expCDF(r.rng.ExpFloat64()), expCDF(r.rng.ExpFloat64()))
}
func floatToUniform(x float64, y float64) uint64 {
return uint64(x*maxInt52)<<52 | uint64(y*maxInt52)
}
func normalCDF(x float64) float64 {
return 0.5 * math.Erfc(-x/math.Sqrt2)
}
func expCDF(x float64) float64 {
return -math.Expm1(-x)
}
func uint16nModulo(g func() uint64, n uint16) uint16 {
return uint16(g()) % n // biased
}
func uint16nFixedPoint(g func() uint64, n uint16) uint16 {
v := uint16(g())
x := uint32(n) * uint32(v)
return uint16(x >> 16) // biased
}
func uint16nLongFixedPoint(g func() uint64, n uint16) uint16 {
res, _ := bits.Mul32(uint32(n), uint32(g()))
return uint16(res) // biased with probability 2^-16
}
func uint16nLemire(g func() uint64, n uint16) uint16 {
v := uint16(g())
prod := uint32(v) * uint32(n)
low := uint16(prod)
if low < n {
thresh := -n % n
for low < thresh {
v = uint16(g())
prod = uint32(v) * uint32(n)
low = uint16(prod)
}
}
return uint16(prod >> 16) // unbiased
}
func shuffleBits(buf []byte, g func() uint64, b func(func() uint64, uint16) uint16) {
for i := math.MaxUint16 - 1; i > 0; i-- {
j := int(b(g, uint16(i+1)))
bi := getBit(buf, i)
bj := getBit(buf, j)
setBit(buf, i, bj)
setBit(buf, j, bi)
}
}
func getBit(buf []byte, i int) bool {
return buf[i/8]&(1<<(i%8)) > 0
}
func setBit(buf []byte, i int, b bool) {
if b {
buf[i/8] |= 1 << (i % 8)
} else {
buf[i/8] &= ^(1 << (i % 8))
}
}
func run(gen string, transform string, shuffle string) error {
var ctor func(uint64) randGen
switch gen {
case "rand":
ctor = func(s uint64) randGen { return rand.New(s) }
case "std":
ctor = func(s uint64) randGen { return mathrand.New(mathrand.NewSource(int64(s))) }
case "x":
ctor = func(s uint64) randGen { return exprand.New(exprand.NewSource(s)) }
case "x-wy":
ctor = func(s uint64) randGen { return exprand.New(&wyrandSource{s}) }
default:
return fmt.Errorf("unknown RNG: %q", gen)
}
s := new(maphash.Hash).Sum64()
rng := func(s uint64) *rand64 { return &rand64{ctor(s)} }
var g func() uint64
switch transform {
case "none":
g = rng(s).raw
case "f64":
g = rng(s).fromF64
case "norm":
g = rng(s).fromNorm
case "exp":
g = rng(s).fromExp
case "8seed":
seeds := [8]uint64{1, 2, 4, 8, 16, 32, 64, 128}
gens := [8]*rand64{}
for i, s := range seeds {
gens[i] = rng(s)
}
i := 0
g = func() uint64 {
u := gens[i].raw()
i = (i + 1) % 8
return u
}
default:
return fmt.Errorf("unknown transform: %q", transform)
}
buf := make([]byte, 8*bufSizeWords)
switch shuffle {
case "none":
return output(buf, g, nil)
case "mod":
return output(buf, g, uint16nModulo)
case "fp":
return output(buf, g, uint16nFixedPoint)
case "lfp":
return output(buf, g, uint16nLongFixedPoint)
case "lemire":
return output(buf, g, uint16nLemire)
default:
return fmt.Errorf("unknown shuffle method: %q", shuffle)
}
}
func output(buf []byte, g func() uint64, b func(func() uint64, uint16) uint16) error {
for {
if b == nil {
for i := 0; i < bufSizeWords; i++ {
binary.LittleEndian.PutUint64(buf[i*8:], g())
}
} else {
for i := 0; i < numChunks; i++ {
ch := buf[i*chunkSizeBytes : (i+1)*chunkSizeBytes]
for j := 0; j < len(ch); j++ {
if j < len(ch)/2 {
ch[j] = 0xff
} else {
ch[j] = 0
}
}
shuffleBits(ch, g, b)
}
}
_, err := os.Stdout.Write(buf)
if err != nil {
return err
}
}
}
func main() {
var (
gen = flag.String("gen", "rand", "RNG to use (rand/std/x)")
transform = flag.String("transform", "none", "transform to use (none/f64/norm/rand/8seed)")
shuffle = flag.String("shuffle", "none", "shuffle algorithm to use (none/mod/fp/lfp/lemire)")
)
flag.Parse()
err := run(*gen, *transform, *shuffle)
if err != nil {
log.Fatal(err.Error())
}
}