yq/pkg/yqlib/operator_multiply.go

141 lines
4.4 KiB
Go
Raw Normal View History

2020-11-03 23:48:43 +00:00
package yqlib
2020-10-19 05:14:29 +00:00
import (
"fmt"
2020-10-21 01:54:58 +00:00
"container/list"
2020-11-20 11:57:32 +00:00
yaml "gopkg.in/yaml.v3"
2020-10-19 05:14:29 +00:00
)
2020-10-20 05:27:30 +00:00
type CrossFunctionCalculation func(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error)
2020-10-21 01:54:58 +00:00
func crossFunction(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode, calculation CrossFunctionCalculation) (*list.List, error) {
2020-10-27 05:45:16 +00:00
lhs, err := d.GetMatchingNodes(matchingNodes, pathNode.Lhs)
2020-10-19 05:14:29 +00:00
if err != nil {
return nil, err
}
2020-11-20 11:57:32 +00:00
log.Debugf("crossFunction LHS len: %v", lhs.Len())
2020-10-19 05:14:29 +00:00
2020-10-27 05:45:16 +00:00
rhs, err := d.GetMatchingNodes(matchingNodes, pathNode.Rhs)
2020-10-19 05:14:29 +00:00
if err != nil {
return nil, err
}
2020-11-20 11:57:32 +00:00
log.Debugf("crossFunction RHS len: %v", rhs.Len())
2020-10-19 05:14:29 +00:00
2020-10-21 01:54:58 +00:00
var results = list.New()
2020-10-19 05:14:29 +00:00
for el := lhs.Front(); el != nil; el = el.Next() {
lhsCandidate := el.Value.(*CandidateNode)
for rightEl := rhs.Front(); rightEl != nil; rightEl = rightEl.Next() {
2020-11-20 11:57:32 +00:00
log.Debugf("Applying calc")
2020-10-19 05:14:29 +00:00
rhsCandidate := rightEl.Value.(*CandidateNode)
2020-10-20 05:27:30 +00:00
resultCandidate, err := calculation(d, lhsCandidate, rhsCandidate)
2020-10-19 05:14:29 +00:00
if err != nil {
return nil, err
}
2020-10-21 01:54:58 +00:00
results.PushBack(resultCandidate)
2020-10-19 05:14:29 +00:00
}
}
2020-10-20 05:27:30 +00:00
return results, nil
}
2020-11-27 23:41:09 +00:00
type MultiplyPreferences struct {
AppendArrays bool
}
2020-10-21 01:54:58 +00:00
func MultiplyOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*list.List, error) {
2020-10-20 05:27:30 +00:00
log.Debugf("-- MultiplyOperator")
2020-11-27 23:41:09 +00:00
return crossFunction(d, matchingNodes, pathNode, multiply(pathNode.Operation.Preferences.(*MultiplyPreferences)))
2020-10-19 05:14:29 +00:00
}
2020-11-27 23:41:09 +00:00
func multiply(preferences *MultiplyPreferences) func(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error) {
return func(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error) {
lhs.Node = UnwrapDoc(lhs.Node)
rhs.Node = UnwrapDoc(rhs.Node)
log.Debugf("Multipling LHS: %v", lhs.Node.Tag)
log.Debugf("- RHS: %v", rhs.Node.Tag)
2020-10-27 05:45:16 +00:00
2020-11-27 23:41:09 +00:00
shouldAppendArrays := preferences.AppendArrays
2020-10-19 05:14:29 +00:00
2020-11-27 23:41:09 +00:00
if lhs.Node.Kind == yaml.MappingNode && rhs.Node.Kind == yaml.MappingNode ||
(lhs.Node.Kind == yaml.SequenceNode && rhs.Node.Kind == yaml.SequenceNode) {
var newBlank = &CandidateNode{
Path: lhs.Path,
Document: lhs.Document,
Filename: lhs.Filename,
Node: &yaml.Node{},
}
var newThing, err = mergeObjects(d, newBlank, lhs, false)
if err != nil {
return nil, err
}
return mergeObjects(d, newThing, rhs, shouldAppendArrays)
2020-10-28 02:00:26 +00:00
2020-11-27 23:41:09 +00:00
}
return nil, fmt.Errorf("Cannot multiply %v with %v", lhs.Node.Tag, rhs.Node.Tag)
2020-10-19 05:14:29 +00:00
}
}
2020-11-27 23:41:09 +00:00
func mergeObjects(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode, shouldAppendArrays bool) (*CandidateNode, error) {
2020-10-28 02:00:26 +00:00
var results = list.New()
2020-11-27 23:41:09 +00:00
// shouldn't recurse arrays if appending
err := recursiveDecent(d, results, nodeToMap(rhs), !shouldAppendArrays)
2020-11-13 03:07:11 +00:00
if err != nil {
return nil, err
}
2020-10-28 02:00:26 +00:00
var pathIndexToStartFrom int = 0
if results.Front() != nil {
pathIndexToStartFrom = len(results.Front().Value.(*CandidateNode).Path)
}
for el := results.Front(); el != nil; el = el.Next() {
2020-11-27 23:41:09 +00:00
err := applyAssignment(d, pathIndexToStartFrom, lhs, el.Value.(*CandidateNode), shouldAppendArrays)
2020-10-28 02:00:26 +00:00
if err != nil {
return nil, err
}
}
return lhs, nil
}
2020-10-19 05:14:29 +00:00
func createTraversalTree(path []interface{}) *PathTreeNode {
if len(path) == 0 {
2020-10-20 04:33:20 +00:00
return &PathTreeNode{Operation: &Operation{OperationType: SelfReference}}
2020-10-19 05:14:29 +00:00
} else if len(path) == 1 {
2020-10-20 04:33:20 +00:00
return &PathTreeNode{Operation: &Operation{OperationType: TraversePath, Value: path[0], StringValue: fmt.Sprintf("%v", path[0])}}
2020-10-19 05:14:29 +00:00
}
return &PathTreeNode{
Operation: &Operation{OperationType: ShortPipe},
2020-10-20 05:27:30 +00:00
Lhs: createTraversalTree(path[0:1]),
Rhs: createTraversalTree(path[1:])}
2020-10-19 05:14:29 +00:00
}
2020-11-27 23:41:09 +00:00
func applyAssignment(d *dataTreeNavigator, pathIndexToStartFrom int, lhs *CandidateNode, rhs *CandidateNode, shouldAppendArrays bool) error {
2020-10-19 05:14:29 +00:00
log.Debugf("merge - applyAssignment lhs %v, rhs: %v", NodeToString(lhs), NodeToString(rhs))
lhsPath := rhs.Path[pathIndexToStartFrom:]
2020-10-20 04:33:20 +00:00
assignmentOp := &Operation{OperationType: AssignAttributes}
2020-10-29 23:56:45 +00:00
if rhs.Node.Kind == yaml.ScalarNode || rhs.Node.Kind == yaml.AliasNode {
2020-10-19 05:14:29 +00:00
assignmentOp.OperationType = Assign
2020-11-19 06:08:13 +00:00
assignmentOp.Preferences = &AssignOpPreferences{false}
2020-11-27 23:41:09 +00:00
} else if shouldAppendArrays && rhs.Node.Kind == yaml.SequenceNode {
assignmentOp.OperationType = AddAssign
2020-10-19 05:14:29 +00:00
}
2020-10-20 04:33:20 +00:00
rhsOp := &Operation{OperationType: ValueOp, CandidateNode: rhs}
2020-10-19 05:14:29 +00:00
2020-10-20 04:33:20 +00:00
assignmentOpNode := &PathTreeNode{Operation: assignmentOp, Lhs: createTraversalTree(lhsPath), Rhs: &PathTreeNode{Operation: rhsOp}}
2020-10-19 05:14:29 +00:00
2020-10-27 05:45:16 +00:00
_, err := d.GetMatchingNodes(nodeToMap(lhs), assignmentOpNode)
2020-10-19 05:14:29 +00:00
return err
}