mirror of
https://github.com/mikefarah/yq.git
synced 2026-03-10 15:54:26 +00:00
85 lines
2.1 KiB
Go
85 lines
2.1 KiB
Go
package yqlib
|
|
|
|
import (
|
|
"container/list"
|
|
"fmt"
|
|
)
|
|
|
|
func isKeyOperator(_ *dataTreeNavigator, context Context, _ *ExpressionNode) (Context, error) {
|
|
log.Debugf("isKeyOperator")
|
|
|
|
var results = list.New()
|
|
|
|
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
|
|
candidate := el.Value.(*CandidateNode)
|
|
|
|
results.PushBack(createBooleanCandidate(candidate, candidate.IsMapKey))
|
|
}
|
|
|
|
return context.ChildContext(results), nil
|
|
}
|
|
|
|
func getKeyOperator(_ *dataTreeNavigator, context Context, _ *ExpressionNode) (Context, error) {
|
|
log.Debugf("getKeyOperator")
|
|
|
|
var results = list.New()
|
|
|
|
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
|
|
candidate := el.Value.(*CandidateNode)
|
|
|
|
if candidate.Key != nil {
|
|
results.PushBack(candidate.Key)
|
|
}
|
|
}
|
|
|
|
return context.ChildContext(results), nil
|
|
|
|
}
|
|
|
|
func keysOperator(_ *dataTreeNavigator, context Context, _ *ExpressionNode) (Context, error) {
|
|
log.Debugf("keysOperator")
|
|
|
|
var results = list.New()
|
|
|
|
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
|
|
candidate := el.Value.(*CandidateNode)
|
|
|
|
var targetNode *CandidateNode
|
|
switch candidate.Kind {
|
|
case MappingNode:
|
|
targetNode = getMapKeys(candidate)
|
|
case SequenceNode:
|
|
targetNode = getIndices(candidate)
|
|
default:
|
|
return Context{}, fmt.Errorf("cannot get keys of %v, keys only works for maps and arrays", candidate.Tag)
|
|
}
|
|
|
|
results.PushBack(targetNode)
|
|
}
|
|
|
|
return context.ChildContext(results), nil
|
|
}
|
|
|
|
func getMapKeys(node *CandidateNode) *CandidateNode {
|
|
contents := make([]*CandidateNode, 0)
|
|
for index := 0; index < len(node.Content); index = index + 2 {
|
|
contents = append(contents, node.Content[index])
|
|
}
|
|
|
|
seq := &CandidateNode{Kind: SequenceNode, Tag: "!!seq"}
|
|
seq.AddChildren(contents)
|
|
return seq
|
|
}
|
|
|
|
func getIndices(node *CandidateNode) *CandidateNode {
|
|
var contents = make([]*CandidateNode, len(node.Content))
|
|
|
|
for index := range node.Content {
|
|
contents[index] = createScalarNode(index, fmt.Sprintf("%v", index))
|
|
}
|
|
|
|
seq := &CandidateNode{Kind: SequenceNode, Tag: "!!seq"}
|
|
seq.AddChildren(contents)
|
|
return seq
|
|
}
|