-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patharray.go
177 lines (142 loc) · 4.83 KB
/
array.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
package chaff
import (
"fmt"
"github.com/ryanolee/go-chaff/internal/util"
)
type (
arrayGenerator struct {
TupleGenerators []Generator
ItemGenerator Generator
AdditionalItemsGenerator Generator
MinItems int
MaxItems int
DisallowAdditional bool
schemaNode schemaNode
}
)
// Parses the "array" keyword of a schema
// Example:
// {
// "type": "array",
// "items": {
// "type": "string"
// },
// "minItems": 1,
// "maxItems": 10
// }
func parseArray(node schemaNode, metadata *parserMetadata) (Generator, error) {
// Validate Bounds
if node.MaxItems != 0 && node.MinItems > node.MaxItems {
return nullGenerator{}, fmt.Errorf("minItems must be less than or equal to maxItems (minItems: %d, maxItems: %d)", node.MinItems, node.MaxItems)
}
if node.MaxContains != 0 && node.MinContains > node.MaxContains {
return nullGenerator{}, fmt.Errorf("minContains must be less than or equal to maxContains (minContains: %d, maxContains: %d)", node.MinContains, node.MaxContains)
}
// Validate if tuple makes sense in this context
tupleLength := len(node.PrefixItems)
if tupleLength > node.MaxItems {
return nullGenerator{}, fmt.Errorf("tuple length must be less than or equal to maxItems (tupleLength: %d, maxItems: %d)", tupleLength, node.MaxItems)
}
min := util.GetInt(node.MinItems, node.MinContains)
max := util.GetInt(node.MaxItems, node.MaxContains)
// Force the generator to use only the tuple in the event that additional items
// are not allowed
if node.Items.DisallowAdditionalItems {
min = tupleLength
max = tupleLength
}
return arrayGenerator{
TupleGenerators: parseTupleGeneratorFromSchemaNode(node, metadata),
ItemGenerator: parseItemGenerator(node.Items, metadata),
AdditionalItemsGenerator: parseAdditionalItems(node, metadata),
MinItems: min,
MaxItems: max,
DisallowAdditional: node.Items.DisallowAdditionalItems,
schemaNode: node,
}, nil
}
func parseTupleGeneratorFromSchemaNode(node schemaNode, metadata *parserMetadata) []Generator {
if len(node.PrefixItems) != 0 {
return parseTupleGenerator(node.PrefixItems, metadata)
// Legacy support given "items" when passed as an array
// has the same meaning as "prefixItems"
} else if len(node.Items.Nodes) != 0 {
return parseTupleGenerator(node.Items.Nodes, metadata)
}
return nil
}
func parseTupleGenerator(nodes []schemaNode, metadata *parserMetadata) []Generator {
if len(nodes) == 0 {
return nil
}
generators := []Generator{}
for i, item := range nodes {
refPath := fmt.Sprintf("/prefixItems/%d", i)
generator, err := metadata.ReferenceHandler.ParseNodeInScope(refPath, item, metadata)
if err != nil {
generators = append(generators, nullGenerator{})
} else {
generators = append(generators, generator)
}
}
return generators
}
func parseAdditionalItems(node schemaNode, metadata *parserMetadata) Generator {
if node.AdditionalItems == nil {
return nil
}
generator, err := metadata.ReferenceHandler.ParseNodeInScope("/additionalItems", *node.AdditionalItems, metadata)
if err != nil {
return nil
}
return generator
}
func parseItemGenerator(additionalData itemsData, metadata *parserMetadata) Generator {
if additionalData.DisallowAdditionalItems || additionalData.Node == nil {
return nil
}
generator, err := metadata.ReferenceHandler.ParseNodeInScope("/items", *additionalData.Node, metadata)
if err != nil {
return nil
}
return generator
}
func (g arrayGenerator) Generate(opts *GeneratorOptions) interface{} {
tupleLength := len(g.TupleGenerators)
arrayData := make([]interface{}, 0)
if tupleLength != 0 {
for _, generator := range g.TupleGenerators {
arrayData = append(arrayData, generator.Generate(opts))
}
}
var itemGen Generator
itemGen = nullGenerator{}
if g.ItemGenerator != nil {
itemGen = g.ItemGenerator
} else if g.AdditionalItemsGenerator != nil {
itemGen = g.AdditionalItemsGenerator
}
if itemGen == nil || g.DisallowAdditional {
return arrayData
}
minItems := util.GetInt(g.MinItems, opts.DefaultArrayMinItems)
maxItems := util.GetInt(g.MaxItems, opts.DefaultArrayMaxItems)
if maxItems < minItems {
maxItems = minItems + opts.DefaultArrayMaxItems
}
remainingItemsToGenerate := util.MaxInt(0, maxItems-tupleLength)
itemsToGenerate := opts.Rand.RandomInt(0, remainingItemsToGenerate)
// Generate the remaining items up to a random number
// (This might skew the distribution of the length of the array)
for i := 0; i < itemsToGenerate || minItems > len(arrayData); i++ {
arrayData = append(arrayData, itemGen.Generate(opts))
}
return arrayData
}
func (g arrayGenerator) String() string {
tupleString := ""
for _, generator := range g.TupleGenerators {
tupleString += fmt.Sprintf("%s,", generator)
}
return fmt.Sprintf("ArrayGenerator{items: %s, tuple: [%s] }", g.ItemGenerator, tupleString)
}