yq/pkg/yqlib/treeops/operator_assign_update.go

53 lines
1.2 KiB
Go
Raw Normal View History

2020-10-17 11:39:01 +00:00
package treeops
2020-10-21 01:54:58 +00:00
import "container/list"
2020-10-17 11:39:01 +00:00
2020-11-02 00:20:38 +00:00
func AssignUpdateOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*list.List, error) {
2020-10-27 05:45:16 +00:00
lhs, err := d.GetMatchingNodes(matchingNodes, pathNode.Lhs)
2020-10-17 11:39:01 +00:00
if err != nil {
return nil, err
}
for el := lhs.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode)
2020-10-27 05:45:16 +00:00
rhs, err := d.GetMatchingNodes(nodeToMap(candidate), pathNode.Rhs)
2020-10-17 11:39:01 +00:00
if err != nil {
return nil, err
}
// grab the first value
first := rhs.Front()
if first != nil {
candidate.UpdateFrom(first.Value.(*CandidateNode))
}
}
return matchingNodes, nil
}
2020-10-19 05:14:29 +00:00
// does not update content or values
2020-10-21 01:54:58 +00:00
func AssignAttributesOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*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
}
for el := lhs.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode)
2020-10-27 05:45:16 +00:00
rhs, err := d.GetMatchingNodes(nodeToMap(candidate), pathNode.Rhs)
2020-10-19 05:14:29 +00:00
if err != nil {
return nil, err
}
// grab the first value
first := rhs.Front()
if first != nil {
candidate.UpdateAttributesFrom(first.Value.(*CandidateNode))
}
}
return matchingNodes, nil
}