mirror of https://github.com/mikefarah/yq.git
38 lines
763 B
Go
38 lines
763 B
Go
package yqlib
|
|
|
|
import (
|
|
"container/list"
|
|
)
|
|
|
|
func selectOperator(d *dataTreeNavigator, matchingNodes *list.List, expressionNode *ExpressionNode) (*list.List, error) {
|
|
|
|
log.Debugf("-- selectOperation")
|
|
var results = list.New()
|
|
|
|
for el := matchingNodes.Front(); el != nil; el = el.Next() {
|
|
candidate := el.Value.(*CandidateNode)
|
|
|
|
rhs, err := d.GetMatchingNodes(nodeToMap(candidate), expressionNode.Rhs)
|
|
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// grab the first value
|
|
first := rhs.Front()
|
|
|
|
if first != nil {
|
|
result := first.Value.(*CandidateNode)
|
|
includeResult, errDecoding := isTruthy(result)
|
|
if errDecoding != nil {
|
|
return nil, errDecoding
|
|
}
|
|
|
|
if includeResult {
|
|
results.PushBack(candidate)
|
|
}
|
|
}
|
|
}
|
|
return results, nil
|
|
}
|