-
Notifications
You must be signed in to change notification settings - Fork 0
/
opPath.go
395 lines (335 loc) · 8.69 KB
/
opPath.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
394
395
package mpath
import (
"fmt"
"strings"
sc "text/scanner"
"cuelang.org/go/cue"
"github.com/pkg/errors"
)
type opPath struct {
IsInvalid bool
StartAtRoot bool
IsFilter bool
MustEndInFunctionOrIdent bool
Operations []Operation
opCommon
}
func (x *opPath) Validate(rootValue cue.Value, cuePath CuePath, blockedRootFields []string) (path *Path, returnedType InputOrOutput) {
errFunc := func(e error) (*Path, InputOrOutput) {
if path == nil {
path = &Path{}
}
path.String = x.UserString()
path.Error = strPtr(e.Error())
return path, returnedType
}
var err error
var cuePathValue cue.Value
if len(cuePath) == 0 || x.StartAtRoot {
cuePathValue = rootValue
} else {
cuePathValue, err = findValueAtPath(rootValue, cuePath)
if err != nil {
return errFunc(err)
}
}
rootPart := &PathIdent{
pathIdentFields: pathIdentFields{
Type: InputOrOutput{
CueExpr: getExpr(rootValue),
},
},
}
path = &Path{
pathFields: pathFields{
Parts: []CanBeAPart{rootPart},
IsFilter: x.IsFilter,
Type: InputOrOutput{
CueExpr: getExpr(cuePathValue),
},
},
}
switch x.StartAtRoot {
case true:
rootPart.String = "$"
rootPart.Type.Type = PT_Root
rootPart.Type.IOType = IOOT_Single
cuePath = CuePath{}
case false:
rootPart.String = "@"
rootPart.Type.Type = PT_ElementRoot
rootPart.Type.IOType = IOOT_Single
}
availableFields, err := getAvailableFieldsForValue(cuePathValue, blockedRootFields)
if err != nil {
return errFunc(fmt.Errorf("failed to list available fields from cue: %w", err))
}
if len(availableFields) > 0 {
rootPart.Available = &Available{
Fields: availableFields,
}
}
rdm := map[string]struct{}{}
var shouldErrorRemaining bool
var part CanBeAPart
var foundFirstIdent bool
var previousWasFuncWithoutKnownReturn bool
for _, op := range x.Operations {
if shouldErrorRemaining {
var str string
switch t := op.(type) {
case *opPathIdent:
str = t.UserString()
case *opFilter:
str = t.UserString()
default:
continue
}
errMessage := "cannot continue due to previous error"
part = &PathIdent{
pathIdentFields: pathIdentFields{
String: str,
HasError: HasError{
Error: &errMessage,
},
},
}
continue
}
switch t := op.(type) {
case *opPathIdent:
if previousWasFuncWithoutKnownReturn {
// We cannot address into unknown return values, so we will return
break
}
if returnedType.IOType == IOOT_Single && returnedType.Type.IsPrimitive() {
shouldErrorRemaining = true
errMessage := "cannot address into primitive value"
path.Parts = append(path.Parts, &PathIdent{
pathIdentFields: pathIdentFields{
String: t.UserString(),
HasError: HasError{
Error: &errMessage,
},
},
})
continue
}
if returnedType.IOType == IOOT_Array {
shouldErrorRemaining = true
errMessage := "cannot address into array value"
path.Parts = append(path.Parts, &PathIdent{
pathIdentFields: pathIdentFields{
String: t.UserString(),
HasError: HasError{
Error: &errMessage,
},
},
})
continue
}
if !foundFirstIdent {
rdm[t.IdentName] = struct{}{}
foundFirstIdent = true
if strInStrSlice(t.IdentName, blockedRootFields) {
errMessage := "field " + t.IdentName + " is not available"
path.Parts = append(path.Parts, &PathIdent{
pathIdentFields: pathIdentFields{
String: t.UserString(),
HasError: HasError{
Error: &errMessage,
},
},
})
return
}
}
cuePath = cuePath.Add(t.IdentName)
// opPathIdent Validate advances the next value
part, returnedType = t.Validate(rootValue, cuePath, blockedRootFields)
path.Parts = append(path.Parts, part)
part.(*PathIdent).Type = returnedType
if part.HasErrors() {
return
}
case *opFilter:
pi, ok := part.(*PathIdent)
if !ok {
if part == nil {
return errFunc(fmt.Errorf("tried to apply filter against wrong type"))
}
part.SetError(fmt.Sprintf("tried to apply filter against %T", part))
continue
}
// opFilter Validate does not advance the next value
pi.Filter = t.Validate(rootValue, cuePath, blockedRootFields)
if pi.Filter.Error != nil {
return errFunc(fmt.Errorf(*pi.Filter.Error))
}
case *opFunction:
if part == nil {
errMessage := "functions cannot be called here"
path.Error = &errMessage
continue
}
returnsKnownValues := false
part, returnedType, returnsKnownValues, err = t.Validate(rootValue, cuePath, part.ReturnType(), blockedRootFields)
if err != nil {
shouldErrorRemaining = true
}
if !returnsKnownValues && (returnedType.Type == PT_Object) {
previousWasFuncWithoutKnownReturn = true
}
path.Parts = append(path.Parts, part)
}
}
if pl := len(path.Parts); pl > 0 {
path.Type = path.Parts[pl-1].ReturnType()
}
return
}
func (x *opPath) addOpToOperationsAndParse(op Operation, s *scanner, r rune) (nextR rune, err error) {
x.Operations = append(x.Operations, op)
nextR, err = op.Parse(s, r)
x.userString += op.UserString()
return
}
func (x *opPath) Type() OT_OpType { return OT_Path }
func (x *opPath) Sprint(depth int) (out string) {
out += repeatTabs(depth)
switch x.StartAtRoot {
case true:
out += "$"
case false:
out += "@"
}
opStrings := []string{}
for _, op := range x.Operations {
var thisStr string
if op.Type() != OT_Filter {
thisStr = "."
}
thisStr += op.Sprint(depth)
opStrings = append(opStrings, thisStr)
}
if len(opStrings) > 0 {
out += strings.Join(opStrings, "")
}
return
}
func (x *opPath) Do(currentData, originalData any) (dataToUse any, err error) {
if x.StartAtRoot && x.IsFilter {
return nil, fmt.Errorf("cannot access root data in filter")
}
if x.StartAtRoot {
dataToUse = originalData
} else {
dataToUse = currentData
}
if len(x.Operations) == 0 {
// This is a special case where the root is being returned
// As we always guarantee numbers are returned as the decimal type, we do this check
if _, ok := dataToUse.(string); !ok {
dataToUse = convertToDecimalIfNumber(dataToUse)
}
}
var priorResultWasNil bool
// Now we know which data to use, we can apply the path parts
for idx, op := range x.Operations {
if idx > 0 && priorResultWasNil {
prevOp := x.Operations[idx-1]
if !prevOp.PropagateNull() && op.Type() != OT_Function {
// todo: think about what kind of error we should return here
return fmt.Errorf("cannot access property of nil value"), nil
}
}
dataToUse, err = op.Do(dataToUse, originalData)
if err != nil {
if errors.Is(err, ErrKeyNotFound) {
if op.PropagateNull() {
priorResultWasNil = true
continue
}
return nil, err
}
return nil, fmt.Errorf("path op failed: %w", err)
}
if isNil(dataToUse) {
priorResultWasNil = true
}
}
return
}
func (x *opPath) Parse(s *scanner, r rune) (nextR rune, err error) {
switch r {
case '$':
if x.IsFilter {
return r, errors.Wrap(erInvalid(s, '@'), "cannot use '$' (root) inside filter")
}
x.StartAtRoot = true
case '@':
// do nothing, this is the default
default:
return r, erInvalid(s, '$', '@')
}
x.userString += string(r)
r = s.Scan()
var op Operation
for { //i := 1; i > 0; i++ {
if r == sc.EOF {
break
}
switch r {
case '.':
x.userString += string(r)
// This is the separator, we can move on
r = s.Scan()
continue
case ',', ')', ']', '}':
switch r {
case ',':
// x.userString += string(r)
case ')':
// do nothing?
}
// This should mean we are finished the path
if x.MustEndInFunctionOrIdent {
if len(x.Operations) > 0 {
if pf, ok := x.Operations[len(x.Operations)-1].(*opFunction); x.Operations[len(x.Operations)-1].Type() == OT_Function && ok {
if ft_IsBoolFunc(pf.FunctionType) {
return r, nil
}
}
if _, ok := x.Operations[len(x.Operations)-1].(*opPathIdent); ok {
// we can assume that the user has provided a boolean property
return r, nil
}
}
// return r, erAt(s, "paths that are part of a logical operation must end in a boolean function")
x.IsInvalid = true
return r, nil
}
return r, nil
case sc.Ident:
// Need to check if this is the name of a function
p := s.sx.Peek()
if p == '(' {
op = &opFunction{}
} else {
// This should be a field name
op = &opPathIdent{}
}
case '[':
// x.userString += string(r)
// This is a filter
op = &opFilter{}
default:
// log.Printf("got %s (%d) [%t] (%d) \n", string(r), r, unicode.IsPrint(r), '\x00')
return r, erInvalid(s)
}
if r, err = x.addOpToOperationsAndParse(op, s, r); err != nil {
return r, err
}
}
return
}