-
Notifications
You must be signed in to change notification settings - Fork 51
/
rand.go
96 lines (73 loc) · 1.79 KB
/
rand.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
package rules
import "math/rand"
type Rand interface {
Intn(n int) int
// Range produces a random integer in the range of [min,max] (inclusive)
// For example, Range(1,3) could produce the values 1, 2 or 3.
// Panics if max < min (like how Intn(n) panics for n <=0)
Range(min, max int) int
Shuffle(n int, swap func(i, j int))
}
// A Rand implementation that just uses the global math/rand generator.
var GlobalRand globalRand
type globalRand struct{}
func (globalRand) Range(min, max int) int {
return rand.Intn(max-min+1) + min
}
func (globalRand) Intn(n int) int {
return rand.Intn(n)
}
func (globalRand) Shuffle(n int, swap func(i, j int)) {
rand.Shuffle(n, swap)
}
type seedRand struct {
seed int64
rand *rand.Rand
}
func NewSeedRand(seed int64) *seedRand {
return &seedRand{
seed: seed,
rand: rand.New(rand.NewSource(seed)),
}
}
func (s seedRand) Intn(n int) int {
return s.rand.Intn(n)
}
func (s seedRand) Range(min, max int) int {
return s.rand.Intn(max-min+1) + min
}
func (s seedRand) Shuffle(n int, swap func(i, j int)) {
s.rand.Shuffle(n, swap)
}
// For testing purposes
// A Rand implementation that always returns the minimum value for any method.
var MinRand minRand
type minRand struct{}
func (minRand) Intn(n int) int {
return 0
}
func (minRand) Range(min, max int) int {
return min
}
func (minRand) Shuffle(n int, swap func(i, j int)) {
// no shuffling
}
// A Rand implementation that always returns the maximum value for any method.
var MaxRand maxRand
type maxRand struct{}
func (maxRand) Intn(n int) int {
return n - 1
}
func (maxRand) Range(min, max int) int {
return max
}
func (maxRand) Shuffle(n int, swap func(i, j int)) {
// rotate by one element so every element is moved
if n < 2 {
return
}
for i := 0; i < n-2; i++ {
swap(i, i+1)
}
swap(n-2, n-1)
}