-
Notifications
You must be signed in to change notification settings - Fork 23
/
random.go
200 lines (167 loc) · 5.66 KB
/
random.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
/*
* Copyright 2014 URX
*
* Licensed under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package planout
import (
"crypto/sha1"
"fmt"
"strconv"
)
func hash(in string) uint64 {
// Compute 20- byte sha1
var x [20]byte = sha1.Sum([]byte(in))
// Get the first 15 characters of the hexdigest.
var y string = fmt.Sprintf("%x", x[0:8])
y = y[0 : len(y)-1]
// Convert hex string into uint64
var z uint64 = 0
z, _ = strconv.ParseUint(y, 16, 64)
return z
}
func generateNameToHash(unit, salt string) string {
experimentid := salt
if unit != "" {
experimentid = experimentid + "." + unit
}
return experimentid
}
func getSalt(args map[string]interface{}, experimentSalt, parameterSalt string) string {
fullSalt, exists := args["full_salt"]
if exists {
return fullSalt.(string)
}
argParameterSalt, exists := args["salt"]
if exists {
return experimentSalt + "." + argParameterSalt.(string)
}
return experimentSalt + "." + parameterSalt
}
func getUnit(args map[string]interface{}, interpreter *Interpreter) string {
var unitstr string
rawUnit, exists := args["unit"]
if exists {
units := interpreter.evaluate(rawUnit)
unitstr = generateUnitStr(units)
}
return unitstr
}
func getHash(args map[string]interface{}, interpreter *Interpreter, appended_units ...string) uint64 {
unitstr := getUnit(args, interpreter)
salt := getSalt(args, interpreter.Salt, interpreter.parameterSalt)
name := generateNameToHash(unitstr, salt)
if len(appended_units) > 0 {
for i := range appended_units {
name = name + "." + appended_units[i]
}
}
return hash(name)
}
func getUniform(args map[string]interface{}, interpreter *Interpreter, min, max float64, appended_units ...string) float64 {
scale, _ := strconv.ParseUint("FFFFFFFFFFFFFFF", 16, 64)
append_string := ""
var h uint64 = 0
if len(appended_units) == 0 {
h = getHash(args, interpreter)
} else {
append_string = append_string + appended_units[0]
for i := range appended_units {
if i > 0 {
append_string = append_string + "." + appended_units[i]
}
}
h = getHash(args, interpreter, append_string)
}
shift := float64(h) / float64(scale)
return min + shift*(max-min)
}
type uniformChoice struct{}
func (s *uniformChoice) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"choices", "unit"}, "UniformChoice")
choices := interpreter.evaluate(args["choices"]).([]interface{})
nchoices := uint64(len(choices))
idx := getHash(args, interpreter) % nchoices
choice := choices[idx]
return choice
}
type bernoulliTrial struct{}
func (s *bernoulliTrial) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"unit"}, "BernoulliTrial")
pvalue := interpreter.evaluate(args["p"]).(float64)
rand_val := getUniform(args, interpreter, 0.0, 1.0)
if rand_val <= pvalue {
return 1
}
return 0
}
type bernoulliFilter struct{}
func (s *bernoulliFilter) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"choices", "unit"}, "BernoulliFilter")
pvalue := interpreter.evaluate(args["p"]).(float64)
choices := interpreter.evaluate(args["choices"]).([]interface{})
ret := make([]interface{}, 0, len(choices))
for i := range choices {
append_str, _ := toString(choices[i])
rand_val := getUniform(args, interpreter, 0.0, 1.0, append_str)
if rand_val <= pvalue {
ret = append(ret, choices[i])
}
}
return ret
}
type weightedChoice struct{}
func (s *weightedChoice) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"choices", "unit", "weights"}, "WeightedChoice")
weights := interpreter.evaluate(args["weights"]).([]interface{})
sum, cweights := getCummulativeWeights(weights)
stop_val := getUniform(args, interpreter, 0.0, sum)
choices := interpreter.evaluate(args["choices"]).([]interface{})
for i := range cweights {
if stop_val <= cweights[i] {
return choices[i]
}
}
return 0.0
}
type randomFloat struct{}
func (s *randomFloat) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"unit"}, "RandomFloat")
min_val, _ := toNumber(getOrElse(args, "min", 0.0))
max_val, _ := toNumber(getOrElse(args, "max", 1.0))
return getUniform(args, interpreter, min_val, max_val)
}
type randomInteger struct{}
func (s *randomInteger) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"unit"}, "RandomInteger")
min_val, _ := toNumber(getOrElse(args, "min", 0.0))
max_val, _ := toNumber(getOrElse(args, "max", 0.0))
mod_val := uint64(max_val) - uint64(min_val) + 1
return uint64(min_val) + getHash(args, interpreter)%mod_val
}
type sample struct{}
func (s *sample) execute(args map[string]interface{}, interpreter *Interpreter) interface{} {
existOrPanic(args, []string{"choices"}, "Sample")
choices := interpreter.evaluate(args["choices"]).([]interface{})
nhash := getHash(args, interpreter)
FisherYatesShuffle(choices, nhash)
draws := len(choices)
arg_draws, exists := args["draws"]
if exists {
eval_draws, ok := toNumber(interpreter.evaluate(arg_draws))
if ok {
draws = int(eval_draws)
}
}
return choices[:draws]
}