yq/pkg/yqlib/operator_sort_keys.go

54 lines
1.4 KiB
Go
Raw Normal View History

2020-12-01 04:06:54 +00:00
package yqlib
import (
"sort"
)
func sortKeysOperator(d *dataTreeNavigator, context Context, expressionNode *ExpressionNode) (Context, error) {
2020-12-01 04:06:54 +00:00
for el := context.MatchingNodes.Front(); el != nil; el = el.Next() {
2020-12-01 04:06:54 +00:00
candidate := el.Value.(*CandidateNode)
rhs, err := d.GetMatchingNodes(context.SingleReadonlyChildContext(candidate), expressionNode.RHS)
2020-12-01 04:06:54 +00:00
if err != nil {
return Context{}, err
2020-12-01 04:06:54 +00:00
}
for childEl := rhs.MatchingNodes.Front(); childEl != nil; childEl = childEl.Next() {
node := childEl.Value.(*CandidateNode)
if node.Kind == MappingNode {
2020-12-01 04:06:54 +00:00
sortKeys(node)
}
if err != nil {
return Context{}, err
2020-12-01 04:06:54 +00:00
}
}
}
return context, nil
2020-12-01 04:06:54 +00:00
}
func sortKeys(node *CandidateNode) {
2020-12-01 04:06:54 +00:00
keys := make([]string, len(node.Content)/2)
keyBucket := map[string]*CandidateNode{}
valueBucket := map[string]*CandidateNode{}
2020-12-01 04:06:54 +00:00
var contents = node.Content
for index := 0; index < len(contents); index = index + 2 {
key := contents[index]
value := contents[index+1]
keys[index/2] = key.Value
keyBucket[key.Value] = key
valueBucket[key.Value] = value
}
sort.Strings(keys)
sortedContent := make([]*CandidateNode, len(node.Content))
2020-12-01 04:06:54 +00:00
for index := 0; index < len(keys); index = index + 1 {
keyString := keys[index]
sortedContent[index*2] = keyBucket[keyString]
sortedContent[1+(index*2)] = valueBucket[keyString]
}
// re-arranging children, no need to update their parent
// relationship
2020-12-01 04:06:54 +00:00
node.Content = sortedContent
}