mirror of
https://github.com/mikefarah/yq.git
synced 2024-11-15 07:38:14 +00:00
190 lines
5.3 KiB
Go
190 lines
5.3 KiB
Go
package yqlib
|
|
|
|
import (
|
|
"container/list"
|
|
"fmt"
|
|
"sort"
|
|
"strconv"
|
|
"strings"
|
|
"time"
|
|
|
|
yaml "gopkg.in/yaml.v3"
|
|
)
|
|
|
|
func sortOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
|
|
selfExpression := &ExpressionNode{Operation: &Operation{OperationType: selfReferenceOpType}}
|
|
expressionNode.RHS = selfExpression
|
|
return sortByOperator(d, context, expressionNode)
|
|
}
|
|
|
|
// context represents the current matching nodes in the expression pipeline
|
|
// expressionNode is your current expression (sort_by)
|
|
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 {
|
|
return context, fmt.Errorf("node at path [%v] is not an array (it's a %v)", candidate.GetNicePath(), candidate.GetNiceTag())
|
|
}
|
|
|
|
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)
|
|
if err != nil {
|
|
return Context{}, err
|
|
}
|
|
|
|
sortableArray[i] = sortableNode{Node: originalNode, CompareContext: compareContext, dateTimeLayout: context.GetDateTimeLayout()}
|
|
|
|
}
|
|
|
|
sort.Stable(sortableArray)
|
|
|
|
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))
|
|
}
|
|
return context.ChildContext(results), nil
|
|
}
|
|
|
|
type sortableNode struct {
|
|
Node *yaml.Node
|
|
CompareContext Context
|
|
dateTimeLayout string
|
|
}
|
|
|
|
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 {
|
|
lhsContext := a[i].CompareContext
|
|
rhsContext := a[j].CompareContext
|
|
|
|
rhsEl := rhsContext.MatchingNodes.Front()
|
|
for lhsEl := lhsContext.MatchingNodes.Front(); lhsEl != nil && rhsEl != nil; lhsEl = lhsEl.Next() {
|
|
lhs := lhsEl.Value.(*CandidateNode)
|
|
rhs := rhsEl.Value.(*CandidateNode)
|
|
|
|
result := a.compare(lhs.Node, rhs.Node, a[i].dateTimeLayout)
|
|
|
|
if result < 0 {
|
|
return true
|
|
} else if result > 0 {
|
|
return false
|
|
}
|
|
|
|
rhsEl = rhsEl.Next()
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (a sortableNodeArray) compare(lhs *yaml.Node, rhs *yaml.Node, dateTimeLayout string) int {
|
|
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 := 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" {
|
|
return -1
|
|
} else if lhsTag != "!!null" && rhsTag == "!!null" {
|
|
return 1
|
|
} else if lhsTag == "!!bool" && rhsTag != "!!bool" {
|
|
return -1
|
|
} else if lhsTag != "!!bool" && rhsTag == "!!bool" {
|
|
return 1
|
|
} else if lhsTag == "!!bool" && rhsTag == "!!bool" {
|
|
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))
|
|
}
|
|
if lhsTruthy == rhsTruthy {
|
|
return 0
|
|
} else if lhsTruthy {
|
|
return 1
|
|
}
|
|
return -1
|
|
} 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)
|
|
}
|
|
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)
|
|
}
|
|
if lhsTime.Equal(rhsTime) {
|
|
return 0
|
|
} else if lhsTime.Before(rhsTime) {
|
|
return -1
|
|
}
|
|
|
|
return 1
|
|
} else if lhsTag == "!!int" && rhsTag == "!!int" {
|
|
_, lhsNum, err := parseInt64(lhs.Value)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
_, rhsNum, err := parseInt64(rhs.Value)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return int(lhsNum - rhsNum)
|
|
} else if (lhsTag == "!!int" || lhsTag == "!!float") && (rhsTag == "!!int" || rhsTag == "!!float") {
|
|
lhsNum, err := strconv.ParseFloat(lhs.Value, 64)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
rhsNum, err := strconv.ParseFloat(rhs.Value, 64)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
if lhsNum == rhsNum {
|
|
return 0
|
|
} else if lhsNum < rhsNum {
|
|
return -1
|
|
}
|
|
|
|
return 1
|
|
}
|
|
|
|
return strings.Compare(lhs.Value, rhs.Value)
|
|
}
|