mirror of https://github.com/mikefarah/yq.git
88 lines
2.5 KiB
Go
88 lines
2.5 KiB
Go
package yqlib
|
|
|
|
type assignPreferences struct {
|
|
DontOverWriteAnchor bool
|
|
OnlyWriteNull bool
|
|
}
|
|
|
|
func assignUpdateFunc(prefs assignPreferences) crossFunctionCalculation {
|
|
return func(d *dataTreeNavigator, context Context, lhs *CandidateNode, rhs *CandidateNode) (*CandidateNode, error) {
|
|
rhs.Node = unwrapDoc(rhs.Node)
|
|
if !prefs.OnlyWriteNull || lhs.Node.Tag == "!!null" {
|
|
lhs.UpdateFrom(rhs, prefs)
|
|
}
|
|
return lhs, nil
|
|
}
|
|
}
|
|
|
|
func assignUpdateOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
|
|
lhs, err := d.GetMatchingNodes(context, expressionNode.LHS)
|
|
if err != nil {
|
|
return Context{}, err
|
|
}
|
|
|
|
prefs := assignPreferences{}
|
|
if expressionNode.Operation.Preferences != nil {
|
|
prefs = expressionNode.Operation.Preferences.(assignPreferences)
|
|
}
|
|
|
|
if !expressionNode.Operation.UpdateAssign {
|
|
// this works because we already ran against LHS with an editable context.
|
|
_, err := crossFunction(d, context.ReadOnlyClone(), expressionNode, assignUpdateFunc(prefs), false)
|
|
return context, err
|
|
}
|
|
|
|
for el := lhs.MatchingNodes.Front(); el != nil; el = el.Next() {
|
|
candidate := el.Value.(*CandidateNode)
|
|
|
|
rhs, err := d.GetMatchingNodes(context.SingleChildContext(candidate), expressionNode.RHS)
|
|
|
|
if err != nil {
|
|
return Context{}, err
|
|
}
|
|
|
|
// grab the first value
|
|
first := rhs.MatchingNodes.Front()
|
|
|
|
if first != nil {
|
|
rhsCandidate := first.Value.(*CandidateNode)
|
|
rhsCandidate.Node = unwrapDoc(rhsCandidate.Node)
|
|
candidate.UpdateFrom(rhsCandidate, prefs)
|
|
}
|
|
}
|
|
|
|
return context, nil
|
|
}
|
|
|
|
// does not update content or values
|
|
func assignAttributesOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
|
|
log.Debug("getting lhs matching nodes for update")
|
|
lhs, err := d.GetMatchingNodes(context, expressionNode.LHS)
|
|
if err != nil {
|
|
return Context{}, err
|
|
}
|
|
for el := lhs.MatchingNodes.Front(); el != nil; el = el.Next() {
|
|
candidate := el.Value.(*CandidateNode)
|
|
|
|
rhs, err := d.GetMatchingNodes(context.SingleReadonlyChildContext(candidate), expressionNode.RHS)
|
|
|
|
if err != nil {
|
|
return Context{}, err
|
|
}
|
|
|
|
// grab the first value
|
|
first := rhs.MatchingNodes.Front()
|
|
|
|
if first != nil {
|
|
prefs := assignPreferences{}
|
|
if expressionNode.Operation.Preferences != nil {
|
|
prefs = expressionNode.Operation.Preferences.(assignPreferences)
|
|
}
|
|
if !prefs.OnlyWriteNull || candidate.Node.Tag == "!!null" {
|
|
candidate.UpdateAttributesFrom(first.Value.(*CandidateNode), prefs)
|
|
}
|
|
}
|
|
}
|
|
return context, nil
|
|
}
|