-
Notifications
You must be signed in to change notification settings - Fork 4
/
sort.go
112 lines (99 loc) · 3.29 KB
/
sort.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
package cluster
import (
"sort"
"strconv"
"strings"
"github.com/segmentio/terraform-provider-kubeapply/pkg/cluster/apply"
"github.com/segmentio/terraform-provider-kubeapply/pkg/cluster/diff"
)
type wrappedResult struct {
nameBase string
nameIndex int
namespaceBase string
namespaceIndex int
kind string
resultIndex int
}
// sortedDiffResults sorts diff results by namespace, then resource type,
// then resource name. If a resource name or namespace is structured as
// [base string]-[number], then the number is used to break ties among all
// entities with the same base.
func sortedDiffResults(results []diff.Result) []diff.Result {
wrappedResults := make([]wrappedResult, len(results))
for r, result := range results {
if result.Object != nil {
wrappedResults[r].nameBase, wrappedResults[r].nameIndex =
parseName(result.Object.Name)
wrappedResults[r].namespaceBase, wrappedResults[r].namespaceIndex =
parseName(result.Object.Namespace)
wrappedResults[r].kind = result.Object.Kind
} else {
wrappedResults[r].namespaceBase = result.Name
}
wrappedResults[r].resultIndex = r
}
sortWrappedResults(wrappedResults)
sortedResults := make([]diff.Result, len(results))
for r, wrappedResult := range wrappedResults {
sortedResults[r] = results[wrappedResult.resultIndex]
}
return sortedResults
}
// sortedApplyResults sorts apply results by namespace, then resource type,
// then resource name. If a resource name or namespace is structured as
// [base string]-[number], then the number is used to break ties among all
// entities with the same base.
func sortedApplyResults(results []apply.Result) []apply.Result {
wrappedResults := make([]wrappedResult, len(results))
for r, result := range results {
wrappedResults[r].nameBase, wrappedResults[r].nameIndex =
parseName(result.Name)
wrappedResults[r].namespaceBase, wrappedResults[r].namespaceIndex =
parseName(result.Namespace)
wrappedResults[r].kind = result.Kind
wrappedResults[r].resultIndex = r
}
sortWrappedResults(wrappedResults)
sortedResults := make([]apply.Result, len(results))
for r, wrappedResult := range wrappedResults {
sortedResults[r] = results[wrappedResult.resultIndex]
}
return sortedResults
}
func sortWrappedResults(wrappedResults []wrappedResult) {
sort.Slice(wrappedResults, func(a, b int) bool {
result1 := wrappedResults[a]
result2 := wrappedResults[b]
if result1.namespaceBase < result2.namespaceBase {
return true
} else if result1.namespaceBase > result2.namespaceBase {
return false
} else if result1.namespaceIndex < result2.namespaceIndex {
return true
} else if result1.namespaceIndex > result2.namespaceIndex {
return false
} else if result1.kind < result2.kind {
return true
} else if result1.kind > result2.kind {
return false
} else if result1.nameBase < result2.nameBase {
return true
} else if result1.nameBase > result2.nameBase {
return false
} else if result1.nameIndex < result2.nameIndex {
return true
}
return false
})
}
func parseName(name string) (string, int) {
components := strings.Split(name, "-")
if len(components) < 2 {
return name, 0
}
index, err := strconv.Atoi(components[len(components)-1])
if err != nil {
return name, 0
}
return strings.Join(components[0:len(components)-1], "-"), index
}