mirror of https://github.com/mikefarah/yq.git
20 lines
484 B
Go
20 lines
484 B
Go
package treeops
|
|
|
|
import "container/list"
|
|
|
|
func UnionOperator(d *dataTreeNavigator, matchingNodes *list.List, pathNode *PathTreeNode) (*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
|
|
}
|
|
for el := rhs.Front(); el != nil; el = el.Next() {
|
|
node := el.Value.(*CandidateNode)
|
|
lhs.PushBack(node)
|
|
}
|
|
return lhs, nil
|
|
}
|