-
Notifications
You must be signed in to change notification settings - Fork 0
/
helpers.go
82 lines (69 loc) · 1.54 KB
/
helpers.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
package main
import (
"fmt"
"strings"
)
// canonicalizeSuffix returns the "canonical" version of mutation suffixes
func canonicalizeSuffix(suffix string) string {
if len(suffix) > 0 {
suffix = suffix[:2]
}
switch suffix {
case "--", "++", "+-":
return suffix
case "-+":
return "+-"
default:
return suffix
}
}
func cleanMutation(s string) string {
return strings.ToLower(maybeRemoveParens(maybeRemoveAt(s)))
}
func maybeRemoveAt(s string) string {
if s == "" {
return s
} else if s[0] == '@' {
return s[1:]
}
return s
}
func maybeRemoveParens(s string) string {
if s == "" {
return s
} else if s[0] == '(' && s[len(s)-1] == ')' {
return s[1 : len(s)-1]
}
return s
}
func filterMutations(mutations [][]string, filters ...string) (mutationList []karmaMutation) {
mutationSet := make(map[karmaMutation]bool)
filterSet := make(map[string]bool)
for _, filter := range filters {
filterSet[filter] = true
}
for _, mutation := range mutations {
m := newKarmaMutation(mutation[1], mutation[2])
if m.identifier != "" && !filterSet[m.identifier] && !mutationSet[m] {
mutationList = append(mutationList, m)
mutationSet[m] = true
}
}
return
}
func newKarmaMutation(identifier, op string) karmaMutation {
return karmaMutation{
identifier: cleanMutation(identifier),
op: canonicalizeSuffix(op),
}
}
type karmaMutation struct {
identifier string
op string
}
func (m karmaMutation) String() string {
return m.key()
}
func (m karmaMutation) key() string {
return fmt.Sprintf("%v%v", m.identifier, m.op)
}