mirror of
https://github.com/mikefarah/yq.git
synced 2024-12-19 20:19:04 +00:00
94 lines
2.6 KiB
Go
94 lines
2.6 KiB
Go
package treeops
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/elliotchance/orderedmap"
|
|
"gopkg.in/op/go-logging.v1"
|
|
)
|
|
|
|
type dataTreeNavigator struct {
|
|
leafTraverser LeafTraverser
|
|
}
|
|
|
|
type NavigationPrefs struct {
|
|
FollowAlias bool
|
|
}
|
|
|
|
type DataTreeNavigator interface {
|
|
GetMatchingNodes(matchingNodes []*CandidateNode, pathNode *PathTreeNode) ([]*CandidateNode, error)
|
|
}
|
|
|
|
func NewDataTreeNavigator(navigationPrefs NavigationPrefs) DataTreeNavigator {
|
|
leafTraverser := NewLeafTraverser(navigationPrefs)
|
|
return &dataTreeNavigator{leafTraverser}
|
|
}
|
|
|
|
func (d *dataTreeNavigator) traverse(matchMap *orderedmap.OrderedMap, pathNode *PathElement) (*orderedmap.OrderedMap, error) {
|
|
log.Debugf("-- Traversing")
|
|
var matchingNodeMap = orderedmap.NewOrderedMap()
|
|
var newNodes []*CandidateNode
|
|
var err error
|
|
|
|
for el := matchMap.Front(); el != nil; el = el.Next() {
|
|
newNodes, err = d.leafTraverser.Traverse(el.Value.(*CandidateNode), pathNode)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
for _, n := range newNodes {
|
|
matchingNodeMap.Set(n.GetKey(), n)
|
|
}
|
|
}
|
|
|
|
return matchingNodeMap, nil
|
|
}
|
|
|
|
func (d *dataTreeNavigator) GetMatchingNodes(matchingNodes []*CandidateNode, pathNode *PathTreeNode) ([]*CandidateNode, error) {
|
|
var matchingNodeMap = orderedmap.NewOrderedMap()
|
|
|
|
for _, n := range matchingNodes {
|
|
matchingNodeMap.Set(n.GetKey(), n)
|
|
}
|
|
|
|
matchedNodes, err := d.getMatchingNodes(matchingNodeMap, pathNode)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
values := make([]*CandidateNode, 0, matchedNodes.Len())
|
|
|
|
for el := matchedNodes.Front(); el != nil; el = el.Next() {
|
|
values = append(values, el.Value.(*CandidateNode))
|
|
}
|
|
return values, nil
|
|
}
|
|
|
|
func (d *dataTreeNavigator) getMatchingNodes(matchingNodes *orderedmap.OrderedMap, pathNode *PathTreeNode) (*orderedmap.OrderedMap, error) {
|
|
if pathNode == nil {
|
|
log.Debugf("getMatchingNodes - nothing to do")
|
|
return matchingNodes, nil
|
|
}
|
|
log.Debugf("Processing Path: %v", pathNode.PathElement.toString())
|
|
if log.IsEnabledFor(logging.DEBUG) {
|
|
for el := matchingNodes.Front(); el != nil; el = el.Next() {
|
|
log.Debug(NodeToString(el.Value.(*CandidateNode)))
|
|
}
|
|
}
|
|
log.Debug(">>")
|
|
|
|
if pathNode.PathElement.PathElementType == SelfReference {
|
|
return matchingNodes, nil
|
|
} else if pathNode.PathElement.PathElementType == PathKey {
|
|
return d.traverse(matchingNodes, pathNode.PathElement)
|
|
} else if pathNode.PathElement.PathElementType == Value {
|
|
return nodeToMap(BuildCandidateNodeFrom(pathNode.PathElement)), nil
|
|
} else {
|
|
handler := pathNode.PathElement.OperationType.Handler
|
|
if handler != nil {
|
|
return handler(d, matchingNodes, pathNode)
|
|
}
|
|
return nil, fmt.Errorf("Unknown operator %v", pathNode.PathElement.OperationType)
|
|
}
|
|
|
|
}
|