forked from TomWright/dasel
-
Notifications
You must be signed in to change notification settings - Fork 0
/
node_query_multiple.go
376 lines (326 loc) · 10.2 KB
/
node_query_multiple.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
package dasel
import (
"fmt"
"reflect"
)
// QueryMultiple uses the given selector to query the current node for every match
// possible and returns all of the end nodes.
func (n *Node) QueryMultiple(selector string) ([]*Node, error) {
n.Selector.Remaining = selector
if err := buildFindMultipleChain(n); err != nil {
return nil, err
}
return lastNodes(n), nil
}
// lastNodes returns a list of all of the last nodes.
func lastNodes(n *Node) []*Node {
if len(n.NextMultiple) == 0 {
return []*Node{n}
}
var res []*Node
for _, nextNode := range n.NextMultiple {
res = append(res, lastNodes(nextNode)...)
}
return res
}
func buildFindMultipleChain(n *Node) error {
if n.Selector.Remaining == "" {
// We've reached the end
return nil
}
var err error
// Parse the selector.
nextSelector, err := ParseSelector(n.Selector.Remaining)
if err != nil {
return fmt.Errorf("failed to parse selector: %w", err)
}
// Populate the value for the new node.
n.NextMultiple, err = findNodes(nextSelector, n, false)
if err != nil {
return fmt.Errorf("could not find multiple value: %w", err)
}
for _, next := range n.NextMultiple {
// Add the back reference
if next.Previous == nil {
// This can already be set in some cases - SEARCH.
next.Previous = n
}
if err := buildFindMultipleChain(next); err != nil {
return err
}
}
return nil
}
// findNodesProperty finds the value for the given node using the property selector
// information.
func findNodesProperty(selector Selector, previousValue reflect.Value, createIfNotExists bool) ([]*Node, error) {
if !isValid(previousValue) {
return nil, &UnexpectedPreviousNilValue{Selector: selector.Raw}
}
value := unwrapValue(previousValue)
if value.Kind() == reflect.Map {
node := &Node{
Value: nilValue(),
Selector: selector,
}
for _, key := range value.MapKeys() {
if fmt.Sprint(key.Interface()) == selector.Property {
node.Value = value.MapIndex(key)
return []*Node{node}, nil
}
}
if createIfNotExists {
return []*Node{node}, nil
}
return nil, &ValueNotFound{Selector: selector.Current, PreviousValue: previousValue}
}
return nil, &UnsupportedTypeForSelector{Selector: selector, Value: previousValue.Type().Kind()}
}
// findNodesIndex finds the value for the given node using the index selector
// information.
func findNodesIndex(selector Selector, previousValue reflect.Value, createIfNotExists bool) ([]*Node, error) {
if !isValid(previousValue) {
return nil, &UnexpectedPreviousNilValue{Selector: selector.Raw}
}
value := unwrapValue(previousValue)
if value.Kind() == reflect.Slice {
node := &Node{
Value: nilValue(),
Selector: selector,
}
valueLen := value.Len()
if selector.Index >= 0 && selector.Index < valueLen {
node.Value = value.Index(selector.Index)
return []*Node{node}, nil
}
if createIfNotExists {
return []*Node{node}, nil
}
return nil, &ValueNotFound{Selector: selector.Current, PreviousValue: previousValue}
}
return nil, &UnsupportedTypeForSelector{Selector: selector, Value: value.Kind()}
}
// findNextAvailableIndexNodes finds the value for the given node using the index selector
// information.
func findNextAvailableIndexNodes(selector Selector, previousValue reflect.Value, createIfNotExists bool) ([]*Node, error) {
if !createIfNotExists {
// Next available index isn't supported unless it's creating the item.
return nil, &ValueNotFound{Selector: selector.Current, PreviousValue: previousValue}
}
return []*Node{
{
Value: nilValue(),
Selector: selector,
},
}, nil
}
// processFindDynamicItems is used by findNodesDynamic.
func processFindDynamicItems(selector Selector, object reflect.Value) (bool, error) {
// Loop through each condition.
allConditionsMatched := true
for _, c := range selector.Conditions {
// If the object doesn't match any checks, return a ValueNotFound.
found, err := c.Check(object)
if err != nil {
return false, err
}
if !found {
allConditionsMatched = false
break
}
}
if allConditionsMatched {
return true, nil
}
return false, nil
}
// findNodesDynamic finds the value for the given node using the dynamic selector
// information.
func findNodesDynamic(selector Selector, previousValue reflect.Value, createIfNotExists bool) ([]*Node, error) {
if !isValid(previousValue) {
return nil, &UnexpectedPreviousNilValue{Selector: selector.Raw}
}
value := unwrapValue(previousValue)
if value.Kind() == reflect.Slice {
results := make([]*Node, 0)
for i := 0; i < value.Len(); i++ {
object := value.Index(i)
found, err := processFindDynamicItems(selector, object)
if err != nil {
return nil, err
}
if found {
selector.Type = "INDEX"
selector.Index = i
results = append(results, &Node{
Value: object,
Selector: selector,
})
}
}
if len(results) > 0 {
return results, nil
}
if createIfNotExists {
selector.Type = "NEXT_AVAILABLE_INDEX"
return []*Node{
{
Value: nilValue(),
Selector: selector,
},
}, nil
}
return nil, &ValueNotFound{Selector: selector.Current, PreviousValue: previousValue}
}
return nil, &UnsupportedTypeForSelector{Selector: selector, Value: value.Kind()}
}
func findNodesSearchRecursiveSubNode(selector Selector, subNode *Node, key string, createIfNotExists bool) ([]*Node, error) {
subResults, err := findNodesSearchRecursive(selector, subNode, createIfNotExists, false)
if err != nil {
return nil, fmt.Errorf("could not find nodes search recursive: %w", err)
}
// Loop through each condition.
allConditionsMatched := true
sliceConditionLoop:
for _, c := range selector.Conditions {
var found bool
var err error
switch cond := c.(type) {
case *KeyEqualCondition:
found, err = cond.Check(reflect.ValueOf(key))
default:
found, err = cond.Check(subNode.Value)
}
if err != nil || !found {
allConditionsMatched = false
break sliceConditionLoop
}
}
results := make([]*Node, 0)
if allConditionsMatched {
results = append(results, subNode)
}
if len(subResults) > 0 {
results = append(results, subResults...)
}
return results, nil
}
// findNodesSearchRecursive iterates through the value of the previous node and creates a new node for each element.
// If any of those nodes match the checks they are returned.
func findNodesSearchRecursive(selector Selector, previousNode *Node, createIfNotExists bool, firstNode bool) ([]*Node, error) {
if !isValid(previousNode.Value) {
return nil, &UnexpectedPreviousNilValue{Selector: selector.Raw}
}
value := unwrapValue(previousNode.Value)
results := make([]*Node, 0)
switch value.Kind() {
case reflect.Slice:
for i := 0; i < value.Len(); i++ {
object := value.Index(i)
subNode := &Node{
Previous: previousNode,
Value: object,
Selector: selector.Copy(),
}
subNode.Selector.Type = "INDEX"
subNode.Selector.Index = i
newResults, err := findNodesSearchRecursiveSubNode(selector, subNode, fmt.Sprint(subNode.Selector.Index), createIfNotExists)
if err != nil {
return nil, err
}
results = append(results, newResults...)
}
case reflect.Map:
for _, key := range value.MapKeys() {
object := value.MapIndex(key)
subNode := &Node{
Previous: previousNode,
Value: object,
Selector: selector.Copy(),
}
subNode.Selector.Type = "PROPERTY"
subNode.Selector.Property = fmt.Sprint(key.Interface())
newResults, err := findNodesSearchRecursiveSubNode(selector, subNode, fmt.Sprint(subNode.Selector.Property), createIfNotExists)
if err != nil {
return nil, err
}
results = append(results, newResults...)
}
}
return results, nil
}
// findNodesSearch finds all available nodes by recursively searching the previous value.
func findNodesSearch(selector Selector, previousNode *Node, createIfNotExists bool) ([]*Node, error) {
res, err := findNodesSearchRecursive(selector, previousNode, createIfNotExists, true)
if err != nil {
return nil, err
}
if len(res) == 0 {
return nil, &ValueNotFound{
Selector: selector.Current,
PreviousValue: previousNode.Value,
}
}
return res, nil
}
// findNodesAnyIndex returns a node for every value in the previous value list.
func findNodesAnyIndex(selector Selector, previousValue reflect.Value) ([]*Node, error) {
if !isValid(previousValue) {
return nil, &UnexpectedPreviousNilValue{Selector: selector.Raw}
}
value := unwrapValue(previousValue)
if value.Kind() == reflect.Slice {
results := make([]*Node, 0)
for i := 0; i < value.Len(); i++ {
object := value.Index(i)
selector.Type = "INDEX"
selector.Index = i
results = append(results, &Node{
Value: object,
Selector: selector,
})
}
if len(results) > 0 {
return results, nil
}
return nil, &ValueNotFound{Selector: selector.Current, PreviousValue: previousValue}
}
return nil, &UnsupportedTypeForSelector{Selector: selector, Value: value.Kind()}
}
func initialiseEmptyValue(selector Selector, previousValue reflect.Value) reflect.Value {
switch selector.Type {
case "PROPERTY":
return reflect.ValueOf(map[interface{}]interface{}{})
case "INDEX", "NEXT_AVAILABLE_INDEX", "INDEX_ANY", "DYNAMIC":
return reflect.ValueOf([]interface{}{})
}
return previousValue
}
// findNodes returns all of the nodes from the previous value that match the given selector.
func findNodes(selector Selector, previousNode *Node, createIfNotExists bool) ([]*Node, error) {
if createIfNotExists && !isValid(previousNode.Value) {
previousNode.Value = initialiseEmptyValue(selector, previousNode.Value)
}
var res []*Node
var err error
switch selector.Type {
case "PROPERTY":
res, err = findNodesProperty(selector, previousNode.Value, createIfNotExists)
case "INDEX":
res, err = findNodesIndex(selector, previousNode.Value, createIfNotExists)
case "NEXT_AVAILABLE_INDEX":
res, err = findNextAvailableIndexNodes(selector, previousNode.Value, createIfNotExists)
case "INDEX_ANY":
res, err = findNodesAnyIndex(selector, previousNode.Value)
case "DYNAMIC":
res, err = findNodesDynamic(selector, previousNode.Value, createIfNotExists)
case "SEARCH":
res, err = findNodesSearch(selector, previousNode, createIfNotExists)
default:
err = &UnsupportedSelector{Selector: selector.Raw}
}
if err != nil {
return nil, err
}
return res, nil
}