forked from openshift/origin
-
Notifications
You must be signed in to change notification settings - Fork 0
/
expressionvalue.go
139 lines (128 loc) · 4.07 KB
/
expressionvalue.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
package generator
import (
"fmt"
"math/rand"
"regexp"
"strconv"
"strings"
)
// ExpressionValueGenerator implements Generator interface. It generates
// random string based on the input expression. The input expression is
// a string, which may contain "[a-zA-Z0-9]{length}" constructs,
// defining range and length of the result random characters.
//
// Examples:
//
// from | value
// -----------------------------
// "test[0-9]{1}x" | "test7x"
// "[0-1]{8}" | "01001100"
// "0x[A-F0-9]{4}" | "0xB3AF"
// "[a-zA-Z0-9]{8}" | "hW4yQU5i"
//
// TODO: Support more regexp constructs.
type ExpressionValueGenerator struct {
seed *rand.Rand
}
const (
Alphabet = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
Numerals = "0123456789"
ASCII = Alphabet + Numerals + "~!@#$%^&*()-_+={}[]\\|<,>.?/\"';:`"
)
var (
rangeExp = regexp.MustCompile(`([\\]?[a-zA-Z0-9]\-?[a-zA-Z0-9]?)`)
generatorsExp = regexp.MustCompile(`\[([a-zA-Z0-9\-\\]+)\](\{([0-9]+)\})`)
expressionExp = regexp.MustCompile(`\[(\\w|\\d|\\a)|([a-zA-Z0-9]\-[a-zA-Z0-9])+\]`)
)
// NewExpressionValueGenerator creates new ExpressionValueGenerator.
func NewExpressionValueGenerator(seed *rand.Rand) ExpressionValueGenerator {
return ExpressionValueGenerator{seed: seed}
}
// GenerateValue generates random string based on the input expression.
// The input expression is a pseudo-regex formatted string. See
// ExpressionValueGenerator for more details.
func (g ExpressionValueGenerator) GenerateValue(expression string) (interface{}, error) {
for {
r := generatorsExp.FindStringIndex(expression)
if r == nil {
break
}
ranges, length, err := rangesAndLength(expression[r[0]:r[1]])
if err != nil {
return "", err
}
err = replaceWithGenerated(
&expression,
expression[r[0]:r[1]],
findExpressionPos(ranges),
length,
g.seed,
)
if err != nil {
return "", err
}
}
return expression, nil
}
// alphabetSlice produces a string slice that contains all characters within
// a specified range.
func alphabetSlice(from, to byte) (string, error) {
leftPos := strings.Index(ASCII, string(from))
rightPos := strings.LastIndex(ASCII, string(to))
if leftPos > rightPos {
return "", fmt.Errorf("invalid range specified: %s-%s", string(from), string(to))
}
return ASCII[leftPos:rightPos], nil
}
// replaceWithGenerated replaces all occurrences of the given expression
// in the string with random characters of the specified range and length.
func replaceWithGenerated(s *string, expression string, ranges [][]byte, length int, seed *rand.Rand) error {
var alphabet string
for _, r := range ranges {
switch string(r[0]) + string(r[1]) {
case `\w`:
alphabet += Alphabet + Numerals + "_"
case `\d`:
alphabet += Numerals
case `\a`:
alphabet += Alphabet + Numerals
default:
slice, err := alphabetSlice(r[0], r[1])
if err != nil {
return err
}
alphabet += slice
}
}
result := make([]byte, length)
for i := 0; i < length; i++ {
result[i] = alphabet[seed.Intn(len(alphabet))]
}
*s = strings.Replace(*s, expression, string(result), 1)
return nil
}
// findExpressionPos searches the given string for the valid expressions
// and returns their corresponding indexes.
func findExpressionPos(s string) [][]byte {
matches := rangeExp.FindAllStringIndex(s, -1)
result := make([][]byte, len(matches))
for i, r := range matches {
result[i] = []byte{s[r[0]], s[r[1]-1]}
}
return result
}
// rangesAndLength extracts the expression ranges (eg. [A-Z0-9]) and length
// (eg. {3}). This helper function also validates the expression syntax and
// its length (must be within 1..255).
func rangesAndLength(s string) (string, int, error) {
expr := s[0:strings.LastIndex(s, "{")]
if !expressionExp.MatchString(expr) {
return "", 0, fmt.Errorf("malformed expresion syntax: %s", expr)
}
length, _ := strconv.Atoi(s[strings.LastIndex(s, "{")+1 : len(s)-1])
// TODO: We do need to set a better limit for the number of generated characters.
if length > 0 && length <= 255 {
return expr, length, nil
}
return "", 0, fmt.Errorf("range must be within [1-255] characters (%d)", length)
}