forked from thomaspoignant/go-feature-flag
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrule.go
393 lines (340 loc) · 13.6 KB
/
rule.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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
package flag
import (
"fmt"
"sort"
"strings"
"time"
"github.com/nikunjy/rules/parser"
"github.com/thomaspoignant/go-feature-flag/ffcontext"
"github.com/thomaspoignant/go-feature-flag/internal/internalerror"
"github.com/thomaspoignant/go-feature-flag/internal/utils"
)
// Rule represents a rule applied by the flag.
type Rule struct {
// Name is the name of the rule, this field is mandatory if you want
// to update the rule during scheduled rollout
Name *string `json:"name,omitempty" yaml:"name,omitempty" toml:"name,omitempty" jsonschema:"title=name,description=Name is the name of the rule. This field is mandatory if you want to update the rule during scheduled rollout."` // nolint: lll
// Query represents an antlr query in the nikunjy/rules format
Query *string `json:"query,omitempty" yaml:"query,omitempty" toml:"query,omitempty" jsonschema:"title=query,description=The query that allow to check in the evaluation context match. Note: in the defaultRule field query is ignored."` // nolint: lll
// VariationResult represents the variation name to use if the rule apply for the user.
// In case we have a percentage field in the config VariationResult is ignored
VariationResult *string `json:"variation,omitempty" yaml:"variation,omitempty" toml:"variation,omitempty" jsonschema:"title=variation,description=The variation name to use if the rule apply for the user. In case we have a percentage field in the config this field is ignored"` // nolint: lll
// Percentages represents the percentage we should give to each variation.
// example: variationA = 10%, variationB = 80%, variationC = 10%
Percentages *map[string]float64 `json:"percentage,omitempty" yaml:"percentage,omitempty" toml:"percentage,omitempty" jsonschema:"title=percentage,description=Represents the percentage we should give to each variation."` // nolint: lll
// ProgressiveRollout is your struct to configure a progressive rollout deployment of your flag.
// It will allow you to ramp up the percentage of your flag over time.
// You can decide at which percentage you starts with and at what percentage you ends with in your release ramp.
// Before the start date we will serve the initial percentage and, after we will serve the end percentage.
ProgressiveRollout *ProgressiveRollout `json:"progressiveRollout,omitempty" yaml:"progressiveRollout,omitempty" toml:"progressiveRollout,omitempty" jsonschema:"title=progressiveRollout,description=Configure a progressive rollout deployment of your flag."` // nolint: lll
// Disable indicates that this rule is disabled.
Disable *bool `json:"disable,omitempty" yaml:"disable,omitempty" toml:"disable,omitempty" jsonschema:"title=disable,description=Indicates that this rule is disabled."` // nolint: lll
}
// Evaluate is checking if the rule applies to for the user.
// If yes, it returns the variation you should use for this rule.
func (r *Rule) Evaluate(key string, ctx ffcontext.Context, flagName string, isDefault bool,
) (string, error) {
if key == "" {
return "", fmt.Errorf("evaluate Rule: no key")
}
evaluationDate := DateFromContextOrDefault(ctx, time.Now())
// check that we have an evaluation context
if ctx == nil {
return "", fmt.Errorf("evaluate Rule: no evaluation context")
}
// Check if the rule applies for this user
ruleApply := isDefault || r.GetQuery() == "" || parser.Evaluate(r.GetTrimmedQuery(), utils.ContextToMap(ctx))
if !ruleApply || (!isDefault && r.IsDisable()) {
return "", &internalerror.RuleNotApply{Context: ctx}
}
if r.ProgressiveRollout != nil {
return r.EvaluateProgressiveRollout(key, flagName, evaluationDate)
}
if r.Percentages != nil && len(r.GetPercentages()) > 0 {
return r.EvaluatePercentageRollout(key, flagName)
}
if r.VariationResult != nil {
return r.GetVariationResult(), nil
}
return "", fmt.Errorf("error in the configuration, no variation available for this rule")
}
// EvaluateProgressiveRollout is evaluating the progressive rollout for the rule.
func (r *Rule) EvaluateProgressiveRollout(key string, flagName string, evaluationDate time.Time) (string, error) {
progressiveRolloutMaxPercentage := uint32(100 * PercentageMultiplier)
hashID := utils.BuildHash(flagName, key, progressiveRolloutMaxPercentage)
variation, err := r.getVariationFromProgressiveRollout(hashID, evaluationDate)
if err != nil {
return variation, err
}
return variation, nil
}
// EvaluatePercentageRollout is evaluating the percentage rollout for the rule.
func (r *Rule) EvaluatePercentageRollout(key string, flagName string) (string, error) {
m := 0.0
for _, percentage := range r.GetPercentages() {
m += percentage
}
maxPercentage := uint32(m * PercentageMultiplier)
hashID := utils.BuildHash(flagName, key, maxPercentage)
variationName, err := r.getVariationFromPercentage(hashID)
if err != nil {
return "", err
}
return variationName, nil
}
// IsDynamic is a function that allows to know if the rule has a dynamic result or not.
func (r *Rule) IsDynamic() bool {
hasPercentage100 := false
for _, percentage := range r.GetPercentages() {
if percentage == 100 {
hasPercentage100 = true
break
}
}
return r.ProgressiveRollout != nil || (r.Percentages != nil && len(r.GetPercentages()) > 0 && !hasPercentage100)
}
func (r *Rule) getVariationFromProgressiveRollout(hash uint32, evaluationDate time.Time) (string, error) {
isRolloutValid := r.ProgressiveRollout != nil &&
r.ProgressiveRollout.Initial != nil &&
r.ProgressiveRollout.Initial.Date != nil &&
r.ProgressiveRollout.Initial.Variation != nil &&
r.ProgressiveRollout.End != nil &&
r.ProgressiveRollout.End.Date != nil &&
r.ProgressiveRollout.End.Variation != nil &&
r.ProgressiveRollout.End.Date.After(*r.ProgressiveRollout.Initial.Date)
if isRolloutValid {
if evaluationDate.Before(*r.ProgressiveRollout.Initial.Date) {
return *r.ProgressiveRollout.Initial.Variation, nil
}
// We are between initial and end
initialPercentage := r.ProgressiveRollout.Initial.getPercentage() * PercentageMultiplier
if r.ProgressiveRollout.End.getPercentage() == 0 || r.ProgressiveRollout.End.getPercentage() > 100 {
maxPercentage := float64(100)
r.ProgressiveRollout.End.Percentage = &maxPercentage
}
endPercentage := r.ProgressiveRollout.End.getPercentage() * PercentageMultiplier
nbSec := r.ProgressiveRollout.End.Date.Unix() - r.ProgressiveRollout.Initial.Date.Unix()
percentage := endPercentage - initialPercentage
percentPerSec := percentage / float64(nbSec)
c := evaluationDate.Unix() - r.ProgressiveRollout.Initial.Date.Unix()
currentPercentage := float64(c)*percentPerSec + initialPercentage
if hash < uint32(currentPercentage) {
return r.ProgressiveRollout.End.getVariation(), nil
}
return r.ProgressiveRollout.Initial.getVariation(), nil
}
return "", fmt.Errorf("error in the progressive rollout, missing params")
}
func (r *Rule) getVariationFromPercentage(hash uint32) (string, error) {
for key, bucket := range r.getPercentageBuckets() {
if uint32(bucket.start) <= hash && uint32(bucket.end) > hash {
return key, nil
}
}
return "", fmt.Errorf("impossible to find the variation")
}
// getPercentageBuckets compute a map containing the buckets of each variation for this rule.
func (r *Rule) getPercentageBuckets() map[string]percentageBucket {
percentageBuckets := make(map[string]percentageBucket, len(r.GetPercentages()))
percentage := r.GetPercentages()
// we need to sort the map to affect the bucket to be sure we are constantly affecting the users to the same bucket.
// Map are not ordered in GO, so we have to order the variationNames to be able to compute the same numbers for the
// buckets every time we are in this function.
variationNames := make([]string, 0)
for k := range percentage {
variationNames = append(variationNames, k)
}
// HACK: we are reversing the sort to support the legacy format of the flags (before 1.0.0) and to be sure to always
// have "True" before "False"
sort.Sort(sort.Reverse(sort.StringSlice(variationNames)))
for index, varName := range variationNames {
startBucket := float64(0)
if index != 0 {
startBucket = percentageBuckets[variationNames[index-1]].end
}
endBucket := startBucket + (percentage[varName] * PercentageMultiplier)
percentageBuckets[varName] = percentageBucket{
start: startBucket,
end: endBucket,
}
}
return percentageBuckets
}
// MergeRules is merging 2 rules.
// It is used when we have to update a rule in a scheduled rollout.
func (r *Rule) MergeRules(updatedRule Rule) {
if updatedRule.Query != nil {
r.Query = updatedRule.Query
}
if updatedRule.VariationResult != nil {
r.VariationResult = updatedRule.VariationResult
}
if updatedRule.ProgressiveRollout != nil {
c := r.GetProgressiveRollout()
if updatedRule.ProgressiveRollout.Initial != nil {
c.Initial.mergeStep(updatedRule.ProgressiveRollout.Initial)
}
if updatedRule.ProgressiveRollout.End != nil {
c.End.mergeStep(updatedRule.ProgressiveRollout.End)
}
r.ProgressiveRollout = &c
}
if updatedRule.Percentages != nil {
updatedPercentages := updatedRule.GetPercentages()
mergedPercentages := r.GetPercentages()
for key, percentage := range updatedPercentages {
// When you set a negative percentage we are not taking it in consideration.
if percentage < 0 {
delete(mergedPercentages, key)
continue
}
mergedPercentages[key] = percentage
}
r.Percentages = &mergedPercentages
}
}
// IsValid is checking if the rule is valid
func (r *Rule) IsValid(defaultRule bool, variations map[string]*interface{}) error {
if !defaultRule && r.IsDisable() {
return nil
}
if r.Percentages == nil && r.ProgressiveRollout == nil && r.VariationResult == nil {
return fmt.Errorf("impossible to return value")
}
// targeting without query
if err := r.isQueryValid(defaultRule); err != nil {
return err
}
// Validate the percentage of the rule
if r.Percentages != nil {
count := float64(0)
for k, p := range r.GetPercentages() {
count += p
if _, ok := variations[k]; !ok {
return fmt.Errorf("invalid percentage: variation %s does not exist", k)
}
}
if len(r.GetPercentages()) == 0 {
return fmt.Errorf("invalid percentages: should not be empty")
}
if count == 0 {
return fmt.Errorf("invalid percentages: should not be equal to 0")
}
}
// Progressive rollout: check that initial is lower than end
if r.ProgressiveRollout != nil {
if r.GetProgressiveRollout().End.getPercentage() < r.GetProgressiveRollout().Initial.getPercentage() {
return fmt.Errorf("invalid progressive rollout, initial percentage should be lower "+
"than end percentage: %v/%v",
r.GetProgressiveRollout().Initial.getPercentage(), r.GetProgressiveRollout().End.getPercentage())
}
endVar := r.GetProgressiveRollout().End.getVariation()
if _, ok := variations[endVar]; !ok {
return fmt.Errorf("invalid progressive rollout, end variation %s does not exist", endVar)
}
initialVar := r.GetProgressiveRollout().Initial.getVariation()
if _, ok := variations[initialVar]; !ok {
return fmt.Errorf("invalid progressive rollout, initial variation %s does not exist", initialVar)
}
}
// Check that the variation exists
if r.Percentages == nil && r.ProgressiveRollout == nil && r.VariationResult != nil {
if _, ok := variations[r.GetVariationResult()]; !ok {
return fmt.Errorf("invalid variation: %s does not exist", r.GetVariationResult())
}
}
return nil
}
func (r *Rule) isQueryValid(defaultRule bool) error {
if defaultRule {
return nil
}
if r.Query == nil {
return fmt.Errorf("each targeting should have a query")
}
// Validate the query with the parser
ev, err := parser.NewEvaluator(r.GetTrimmedQuery())
if err != nil {
return err
}
_, err = ev.Process(map[string]interface{}{})
if err != nil {
return fmt.Errorf("invalid query: %w", err)
}
return nil
}
// GetTrimmedQuery is removing the break lines and return
func (r *Rule) GetTrimmedQuery() string {
splitQuery := strings.Split(r.GetQuery(), "\n")
for index, item := range splitQuery {
splitQuery[index] = strings.TrimLeft(item, " ")
}
return strings.Join(splitQuery, "")
}
func (r *Rule) GetQuery() string {
if r.Query == nil {
return ""
}
return *r.Query
}
func (r *Rule) GetVariationResult() string {
if r.VariationResult == nil {
return ""
}
return *r.VariationResult
}
func (r *Rule) GetName() string {
if r.Name == nil {
return ""
}
return *r.Name
}
func (r *Rule) GetPercentages() map[string]float64 {
if r.Percentages == nil {
return map[string]float64{}
}
return *r.Percentages
}
func (r *Rule) IsDisable() bool {
if r.Disable == nil {
return false
}
return *r.Disable
}
func (r *Rule) GetProgressiveRollout() ProgressiveRollout {
if r.ProgressiveRollout == nil {
return ProgressiveRollout{
Initial: &ProgressiveRolloutStep{},
End: &ProgressiveRolloutStep{},
}
}
return *r.ProgressiveRollout
}
// MergeSetOfRules is taking a collection of rules and merge it with the updates
// from a schedule steps.
// If you want to edit a rule this rule should have a name already to be able to
// target the updates to the right place.
func MergeSetOfRules(initialRules []Rule, updates []Rule) *[]Rule {
collection := initialRules
modified := make(map[string]Rule, 0)
for _, update := range updates {
ruleName := update.Name
if ruleName != nil {
modified[update.GetName()] = update
}
}
mergedUpdates := make([]string, 0)
for index, rule := range collection {
if _, ok := modified[rule.GetName()]; ok {
rule.MergeRules(modified[rule.GetName()])
collection[index] = rule
mergedUpdates = append(mergedUpdates, rule.GetName())
}
}
for _, update := range updates {
if !utils.Contains(mergedUpdates, update.GetName()) {
collection = append(collection, update)
}
}
return &collection
}