-
Notifications
You must be signed in to change notification settings - Fork 439
/
Copy pathsort.go
50 lines (42 loc) · 861 Bytes
/
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
package workflow
import (
"sort"
"strings"
"github.com/ovh/cds/sdk"
)
// Sort sorts all the workflow tree
func Sort(w *sdk.Workflow) {
if w == nil {
return
}
SortNode(&w.WorkflowData.Node)
}
// SortNode sort the content of a node
func SortNode(n *sdk.Node) {
if n == nil {
return
}
sortNodeHooks(&n.Hooks)
sortNodeTriggers(&n.Triggers)
}
func sortNodeHooks(hooks *[]sdk.NodeHook) {
if hooks == nil {
return
}
sort.Slice(*hooks, func(i, j int) bool {
return (*hooks)[i].UUID < (*hooks)[j].UUID
})
}
func sortNodeTriggers(triggers *[]sdk.NodeTrigger) {
if triggers == nil {
return
}
for i := range *triggers {
sortNodeHooks(&(*triggers)[i].ChildNode.Hooks)
}
sort.Slice(*triggers, func(i, j int) bool {
t1 := &(*triggers)[i]
t2 := &(*triggers)[j]
return strings.Compare(t1.ChildNode.Name, t2.ChildNode.Name) < 0
})
}