mirror of
https://github.com/mikefarah/yq.git
synced 2024-11-15 07:38:14 +00:00
125 lines
3.7 KiB
Go
125 lines
3.7 KiB
Go
package yqlib
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"container/list"
|
|
|
|
"gopkg.in/yaml.v3"
|
|
)
|
|
|
|
type CrossFunctionCalculation func(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error)
|
|
|
|
func crossFunction(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode, calculation CrossFunctionCalculation) (*list.List, error) {
|
|
lhs, err := d.GetMatchingNodes(matchingNodes, pathNode.Lhs)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
rhs, err := d.GetMatchingNodes(matchingNodes, pathNode.Rhs)
|
|
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
var results = list.New()
|
|
|
|
for el := lhs.Front(); el != nil; el = el.Next() {
|
|
lhsCandidate := el.Value.(*CandidateNode)
|
|
|
|
for rightEl := rhs.Front(); rightEl != nil; rightEl = rightEl.Next() {
|
|
rhsCandidate := rightEl.Value.(*CandidateNode)
|
|
resultCandidate, err := calculation(d, lhsCandidate, rhsCandidate)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
results.PushBack(resultCandidate)
|
|
}
|
|
|
|
}
|
|
return results, nil
|
|
}
|
|
|
|
func MultiplyOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*list.List, error) {
|
|
log.Debugf("-- MultiplyOperator")
|
|
return crossFunction(d, matchingNodes, pathNode, multiply)
|
|
}
|
|
|
|
func multiply(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error) {
|
|
lhs.Node = UnwrapDoc(lhs.Node)
|
|
rhs.Node = UnwrapDoc(rhs.Node)
|
|
log.Debugf("Multipling LHS: %v", NodeToString(lhs))
|
|
log.Debugf("- RHS: %v", NodeToString(rhs))
|
|
|
|
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)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return mergeObjects(d, newThing, rhs)
|
|
|
|
}
|
|
return nil, fmt.Errorf("Cannot multiply %v with %v", NodeToString(lhs), NodeToString(rhs))
|
|
}
|
|
|
|
func mergeObjects(d *dataTreeNavigator, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error) {
|
|
var results = list.New()
|
|
err := recursiveDecent(d, results, nodeToMap(rhs))
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
var pathIndexToStartFrom int = 0
|
|
if results.Front() != nil {
|
|
pathIndexToStartFrom = len(results.Front().Value.(*CandidateNode).Path)
|
|
}
|
|
|
|
for el := results.Front(); el != nil; el = el.Next() {
|
|
err := applyAssignment(d, pathIndexToStartFrom, lhs, el.Value.(*CandidateNode))
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return lhs, nil
|
|
}
|
|
|
|
func createTraversalTree(path []interface{}) *PathTreeNode {
|
|
if len(path) == 0 {
|
|
return &PathTreeNode{Operation: &Operation{OperationType: SelfReference}}
|
|
} else if len(path) == 1 {
|
|
return &PathTreeNode{Operation: &Operation{OperationType: TraversePath, Value: path[0], StringValue: fmt.Sprintf("%v", path[0])}}
|
|
}
|
|
return &PathTreeNode{
|
|
Operation: &Operation{OperationType: Pipe},
|
|
Lhs: createTraversalTree(path[0:1]),
|
|
Rhs: createTraversalTree(path[1:])}
|
|
|
|
}
|
|
|
|
func applyAssignment(d *dataTreeNavigator, pathIndexToStartFrom int, lhs *CandidateNode, rhs *CandidateNode) error {
|
|
log.Debugf("merge - applyAssignment lhs %v, rhs: %v", NodeToString(lhs), NodeToString(rhs))
|
|
|
|
lhsPath := rhs.Path[pathIndexToStartFrom:]
|
|
|
|
assignmentOp := &Operation{OperationType: AssignAttributes}
|
|
if rhs.Node.Kind == yaml.ScalarNode || rhs.Node.Kind == yaml.AliasNode {
|
|
assignmentOp.OperationType = Assign
|
|
assignmentOp.Preferences = &AssignOpPreferences{false}
|
|
}
|
|
rhsOp := &Operation{OperationType: ValueOp, CandidateNode: rhs}
|
|
|
|
assignmentOpNode := &PathTreeNode{Operation: assignmentOp, Lhs: createTraversalTree(lhsPath), Rhs: &PathTreeNode{Operation: rhsOp}}
|
|
|
|
_, err := d.GetMatchingNodes(nodeToMap(lhs), assignmentOpNode)
|
|
|
|
return err
|
|
}
|