yq/pkg/yqlib/operator_sort.go

166 lines
5.1 KiB
Go
Raw Normal View History

2021-11-28 02:25:22 +00:00
package yqlib
import (
"container/list"
"fmt"
"sort"
"strconv"
"strings"
2022-11-04 01:21:12 +00:00
"time"
2021-11-28 02:25:22 +00:00
yaml "gopkg.in/yaml.v3"
)
2021-12-04 02:54:12 +00:00
func sortOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
selfExpression := &ExpressionNode{Operation: &Operation{OperationType: selfReferenceOpType}}
expressionNode.RHS = selfExpression
2021-12-04 02:54:12 +00:00
return sortByOperator(d, context, expressionNode)
}
2021-11-28 02:25:22 +00:00
// context represents the current matching nodes in the expression pipeline
// expressionNode is your current expression (sort_by)
2021-11-28 02:25:22 +00:00
func sortByOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
results := list.New()
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
candidate := el.Value.(*CandidateNode)
candidateNode := unwrapDoc(candidate.Node)
if candidateNode.Kind != yaml.SequenceNode {
2021-12-04 23:53:37 +00:00
return context, fmt.Errorf("node at path [%v] is not an array (it's a %v)", candidate.GetNicePath(), candidate.GetNiceTag())
2021-11-28 02:25:22 +00:00
}
sortableArray := make(sortableNodeArray, len(candidateNode.Content))
for i, originalNode := range candidateNode.Content {
childCandidate := candidate.CreateChildInArray(i, originalNode)
compareContext, err := d.GetMatchingNodes(context.SingleReadonlyChildContext(childCandidate), expressionNode.RHS)
2021-11-28 02:25:22 +00:00
if err != nil {
return Context{}, err
}
nodeToCompare := &yaml.Node{Kind: yaml.ScalarNode, Tag: "!!null"}
if compareContext.MatchingNodes.Len() > 0 {
nodeToCompare = compareContext.MatchingNodes.Front().Value.(*CandidateNode).Node
}
log.Debug("going to compare %v by %v", NodeToString(candidate.CreateReplacement(originalNode)), NodeToString(candidate.CreateReplacement(nodeToCompare)))
2022-11-04 01:21:12 +00:00
sortableArray[i] = sortableNode{Node: originalNode, NodeToCompare: nodeToCompare, dateTimeLayout: context.GetDateTimeLayout()}
2021-11-28 02:25:22 +00:00
2021-12-04 02:54:12 +00:00
if nodeToCompare.Kind != yaml.ScalarNode {
return Context{}, fmt.Errorf("sort only works for scalars, got %v", nodeToCompare.Tag)
}
2021-11-28 02:25:22 +00:00
}
2021-12-04 02:54:12 +00:00
sort.Stable(sortableArray)
2021-11-28 02:25:22 +00:00
sortedList := &yaml.Node{Kind: yaml.SequenceNode, Tag: "!!seq", Style: candidateNode.Style}
sortedList.Content = make([]*yaml.Node, len(candidateNode.Content))
for i, sortedNode := range sortableArray {
sortedList.Content[i] = sortedNode.Node
}
results.PushBack(candidate.CreateReplacementWithDocWrappers(sortedList))
2021-11-28 02:25:22 +00:00
}
return context.ChildContext(results), nil
}
type sortableNode struct {
2022-11-04 01:21:12 +00:00
Node *yaml.Node
NodeToCompare *yaml.Node
dateTimeLayout string
2021-11-28 02:25:22 +00:00
}
type sortableNodeArray []sortableNode
func (a sortableNodeArray) Len() int { return len(a) }
func (a sortableNodeArray) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a sortableNodeArray) Less(i, j int) bool {
lhs := a[i].NodeToCompare
rhs := a[j].NodeToCompare
2022-11-04 01:21:12 +00:00
lhsTag := lhs.Tag
rhsTag := rhs.Tag
if !strings.HasPrefix(lhsTag, "!!") {
// custom tag - we have to have a guess
lhsTag = guessTagFromCustomType(lhs)
}
if !strings.HasPrefix(rhsTag, "!!") {
// custom tag - we have to have a guess
rhsTag = guessTagFromCustomType(rhs)
}
isDateTime := lhsTag == "!!timestamp" && rhsTag == "!!timestamp"
layout := a[i].dateTimeLayout
// if the lhs is a string, it might be a timestamp in a custom format.
if lhsTag == "!!str" && layout != time.RFC3339 {
_, errLhs := parseDateTime(layout, lhs.Value)
_, errRhs := parseDateTime(layout, rhs.Value)
isDateTime = errLhs == nil && errRhs == nil
}
if lhsTag == "!!null" && rhsTag != "!!null" {
2021-12-04 02:54:12 +00:00
return true
2022-11-04 01:21:12 +00:00
} else if lhsTag != "!!null" && rhsTag == "!!null" {
2021-12-04 02:54:12 +00:00
return false
2022-11-04 01:21:12 +00:00
} else if lhsTag == "!!bool" && rhsTag != "!!bool" {
2021-12-04 02:54:12 +00:00
return true
2022-11-04 01:21:12 +00:00
} else if lhsTag != "!!bool" && rhsTag == "!!bool" {
2021-12-04 02:54:12 +00:00
return false
2022-11-04 01:21:12 +00:00
} else if lhsTag == "!!bool" && rhsTag == "!!bool" {
2021-12-04 02:54:12 +00:00
lhsTruthy, err := isTruthyNode(lhs)
if err != nil {
panic(fmt.Errorf("could not parse %v as boolean: %w", lhs.Value, err))
}
rhsTruthy, err := isTruthyNode(rhs)
if err != nil {
panic(fmt.Errorf("could not parse %v as boolean: %w", rhs.Value, err))
}
return !lhsTruthy && rhsTruthy
2022-11-04 01:21:12 +00:00
} else if isDateTime {
lhsTime, err := parseDateTime(layout, lhs.Value)
if err != nil {
log.Warningf("Could not parse time %v with layout %v for sort, sorting by string instead: %w", lhs.Value, layout, err)
return strings.Compare(lhs.Value, rhs.Value) < 0
}
rhsTime, err := parseDateTime(layout, rhs.Value)
if err != nil {
log.Warningf("Could not parse time %v with layout %v for sort, sorting by string instead: %w", rhs.Value, layout, err)
return strings.Compare(lhs.Value, rhs.Value) < 0
}
return lhsTime.Before(rhsTime)
} else if lhsTag == "!!int" && rhsTag == "!!int" {
2022-05-06 03:46:14 +00:00
_, lhsNum, err := parseInt64(lhs.Value)
2021-11-28 02:25:22 +00:00
if err != nil {
panic(err)
}
2022-05-06 03:46:14 +00:00
_, rhsNum, err := parseInt64(rhs.Value)
2021-11-28 02:25:22 +00:00
if err != nil {
panic(err)
}
return lhsNum < rhsNum
2022-11-04 01:21:12 +00:00
} else if (lhsTag == "!!int" || lhsTag == "!!float") && (rhsTag == "!!int" || rhsTag == "!!float") {
2021-11-28 02:25:22 +00:00
lhsNum, err := strconv.ParseFloat(lhs.Value, 64)
if err != nil {
panic(err)
}
rhsNum, err := strconv.ParseFloat(rhs.Value, 64)
if err != nil {
panic(err)
}
return lhsNum < rhsNum
}
2022-11-04 01:21:12 +00:00
return strings.Compare(lhs.Value, rhs.Value) < 0
2021-11-28 02:25:22 +00:00
}