-
Notifications
You must be signed in to change notification settings - Fork 2
/
graph.go
190 lines (149 loc) · 3.46 KB
/
graph.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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
package graph
import (
"errors"
"fmt"
. "github.com/justinbarrick/hone/pkg/graph/node"
"github.com/justinbarrick/hone/pkg/logger"
"github.com/justinbarrick/hone/pkg/utils"
"gonum.org/v1/gonum/graph"
"gonum.org/v1/gonum/graph/simple"
"gonum.org/v1/gonum/graph/topo"
"sync"
)
type Graph struct {
graph *simple.DirectedGraph
}
func NewGraph(nodes []Node) Graph {
graph := Graph{
graph: simple.NewDirectedGraph(),
}
graph.BuildGraph(nodes)
return graph
}
func (g *Graph) setEdges() error {
nodes := g.graph.Nodes()
for _, node := range graph.NodesOf(nodes) {
for _, dep := range node.(Node).GetDeps() {
g.graph.SetEdge(simple.Edge{
T: node,
F: g.graph.Node(utils.Crc(dep)),
})
}
}
return nil
}
func (g *Graph) AddDep(targetNode Node, dep string) error {
node := g.graph.Node(ID(targetNode))
if node == nil {
return fmt.Errorf("Node not in graph.")
}
node.(Node).AddDep(dep)
return nil
}
func (g *Graph) AddNode(node Node) {
g.graph.AddNode(node)
}
func (g *Graph) BuildGraph(nodes []Node) {
if nodes == nil {
return
}
for _, node := range nodes {
g.AddNode(node)
}
}
func (g *Graph) WaitForDeps(callback func(Node) error, servicesWg *sync.WaitGroup) func(Node) error {
return func(n Node) error {
defer close(n.GetDone())
failedDeps := []string{}
for _, node := range graph.NodesOf(g.graph.To(n.ID())) {
d := node.(Node)
_ = <-d.GetDone()
if d.GetError() != nil {
failedDeps = append(failedDeps, d.GetName())
}
}
if len(failedDeps) > 0 {
n.SetError(fmt.Errorf("Failed dependencies: %s", failedDeps))
logger.LogError(n, n.GetError().Error())
}
if n.GetError() != nil {
return n.GetError()
}
servicesWg.Add(1)
detach := make(chan bool)
n.SetDetach(detach)
go func() {
defer close(detach)
defer servicesWg.Done()
n.SetError(callback(n))
}()
_ = <-detach
return n.GetError()
}
}
func (g *Graph) IterSorted(callback func(Node) error) []error {
g.setEdges()
sorted, err := topo.Sort(g.graph)
if err != nil {
return []error{err}
}
errors := []error{}
for _, node := range sorted {
err := callback(node.(Node))
if err != nil {
errors = append(errors, err)
}
}
return errors
}
func (g *Graph) IterTarget(target string, callback func(Node) error) []error {
targetId := utils.Crc(target)
targetNode := g.graph.Node(targetId)
if targetNode == nil {
return []error{errors.New(fmt.Sprintf("Target %s not found.", target))}
}
return g.IterSorted(func(node Node) error {
if !topo.PathExistsIn(g.graph, g.graph.Node(node.ID()), targetNode) {
return nil
}
return callback(node)
})
}
func (g *Graph) ResolveTarget(target string, callback func(Node) error) []error {
stopCh := make(chan bool)
var wg sync.WaitGroup
var servicesWg sync.WaitGroup
callback = g.WaitForDeps(callback, &servicesWg)
errors := []error{}
iterErrors := g.IterTarget(target, func(node Node) error {
wg.Add(1)
go func(n Node) {
defer wg.Done()
n.SetStop(stopCh)
err := callback(n)
if err != nil {
errors = append(errors, err)
}
}(node)
return nil
})
errors = append(errors, iterErrors...)
wg.Wait()
close(stopCh)
servicesWg.Wait()
return errors
}
func (g *Graph) LongestTarget(target string) (int, []error) {
longestName := 0
lock := sync.Mutex{}
errors := g.IterTarget(target, func(n Node) error {
lock.Lock()
name := n.GetName()
if len(name) > longestName {
longestName = len(name)
}
lock.Unlock()
return nil
})
return longestName, errors
}