forked from mikefarah/yq
/
operator_eval.go
42 lines (33 loc) · 1.16 KB
/
operator_eval.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
package yqlib
import (
"container/list"
)
func evalOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
log.Debugf("Eval")
pathExpStrResults, err := d.GetMatchingNodes(context.ReadOnlyClone(), expressionNode.RHS)
if err != nil {
return Context{}, err
}
expressions := make([]*ExpressionNode, pathExpStrResults.MatchingNodes.Len())
expIndex := 0
//parse every expression
for pathExpStrEntry := pathExpStrResults.MatchingNodes.Front(); pathExpStrEntry != nil; pathExpStrEntry = pathExpStrEntry.Next() {
expressionStrCandidate := pathExpStrEntry.Value.(*CandidateNode)
expressions[expIndex], err = ExpressionParser.ParseExpression(expressionStrCandidate.Value)
if err != nil {
return Context{}, err
}
expIndex++
}
results := list.New()
for matchEl := context.MatchingNodes.Front(); matchEl != nil; matchEl = matchEl.Next() {
for expIndex = 0; expIndex < len(expressions); expIndex++ {
result, err := d.GetMatchingNodes(context, expressions[expIndex])
if err != nil {
return Context{}, err
}
results.PushBackList(result.MatchingNodes)
}
}
return context.ChildContext(results), nil
}