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