/
ast.go
171 lines (161 loc) · 3.15 KB
/
ast.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
package pipeline
import (
"fmt"
"github.com/hackborn/onefunc/errors"
ofstrings "github.com/hackborn/onefunc/strings"
)
// astNode stores an abstract node from parse.
type astNode struct {
nodeName string
vars map[string]any
envVars map[string]string
}
// astPin stores an abstract pin from a parse.
type astPin struct {
fromNode, toNode string
}
// astPipeline stores an abstract pipeline from a parse.
type astPipeline struct {
nodes []*astNode
pins []*astPin
env map[string]any
}
func (t astPipeline) print() string {
if len(t.nodes) < 1 && len(t.pins) < 1 {
return ""
}
eb := errors.FirstBlock{}
w := ofstrings.GetWriter(&eb)
defer ofstrings.PutWriter(w)
w.WriteString("graph (")
// Display unattached nodes
needsSpace := false
unattached := t.unattachedNodes()
for i, node := range unattached {
if i > 0 {
w.WriteString(" ")
}
w.WriteString(node.nodeName)
needsSpace = true
}
// Display connected nodes
lastNode := ""
for _, pin := range t.pins {
if needsSpace {
needsSpace = false
w.WriteString(" ")
}
if lastNode != pin.fromNode {
if lastNode != "" {
w.WriteString(" ")
}
w.WriteString(pin.fromNode)
}
w.WriteString(" -> ")
w.WriteString(pin.toNode)
lastNode = pin.toNode
}
w.WriteString(")")
// Vars
first := true
for _, node := range t.nodes {
if len(node.vars) < 1 && len(node.envVars) < 1 {
continue
}
if first {
w.WriteString(" vars (")
first = false
} else {
w.WriteString(", ")
}
needsComma := false
for k, v := range node.vars {
if !needsComma {
needsComma = true
} else {
w.WriteString(", ")
}
w.WriteString(node.nodeName + "/" + k)
w.WriteString("=")
w.WriteString(fmt.Sprintf("%v", v))
}
for k, v := range node.envVars {
if !needsComma {
needsComma = true
} else {
w.WriteString(", ")
}
w.WriteString(node.nodeName + "/" + k)
w.WriteString("=")
w.WriteString(fmt.Sprintf("%v", v))
}
}
if !first {
w.WriteString(")")
}
// Env
first = true
for _, node := range t.nodes {
if len(node.envVars) < 1 {
continue
}
if first {
w.WriteString(" env (")
first = false
} else {
w.WriteString(", ")
}
needsComma := false
for _, v := range node.envVars {
if !needsComma {
needsComma = true
} else {
w.WriteString(", ")
}
w.WriteString(fmt.Sprintf("%v", v))
}
}
if !first {
w.WriteString(")")
}
// Env
if len(t.env) > 0 {
if ofstrings.StringLen(w) > 0 {
w.WriteString(" ")
}
w.WriteString("env (")
first := true
for k, v := range t.env {
if !first {
w.WriteString(", ")
first = true
}
w.WriteString(k)
w.WriteString("=")
w.WriteString(fmt.Sprintf("%v", v))
}
w.WriteString(")")
}
return ofstrings.String(w)
}
func (t astPipeline) unattachedNodes() []*astNode {
m := make(map[*astNode]struct{})
for _, n := range t.nodes {
m[n] = struct{}{}
}
for _, pin := range t.pins {
for k, _ := range m {
if pin.fromNode == k.nodeName || pin.toNode == k.nodeName {
delete(m, k)
}
}
}
// Keep initial order preserved
var ans []*astNode
for _, n := range t.nodes {
if _, ok := m[n]; ok {
ans = append(ans, n)
}
}
return ans
}