-
Notifications
You must be signed in to change notification settings - Fork 0
/
scaff_test.go
385 lines (329 loc) · 11.7 KB
/
scaff_test.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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
package goraff_test
import (
"fmt"
"strings"
"sync"
"testing"
"time"
"github.com/google/uuid"
"github.com/lordtatty/goraff"
"github.com/stretchr/testify/assert"
)
func TestNew(t *testing.T) {
assert := assert.New(t)
g := goraff.NewScaff()
// must be an empty goraff.Graph{}
assert.Equal(goraff.Scaff{}, *g)
}
type actionMock struct {
name string
lastName string
expectNoRun bool
t *testing.T
delay time.Duration
err error
}
func (a *actionMock) Do(s *goraff.Node, r *goraff.ReadableGraph, triggeringNS *goraff.ReadableNode) error {
if a.expectNoRun {
a.t.Error("Action should not have run")
}
// Wait if a delay is set
if a.delay > 0 {
time.Sleep(a.delay)
}
if a.err != nil {
return a.err
}
// Set the key to the name of the action
key := fmt.Sprintf("%s_key", a.name)
if a.lastName == "" {
s.SetStr(key, a.name)
return nil
}
lastKey := fmt.Sprintf("%s_key", a.lastName)
lastVal := triggeringNS.FirstStr(lastKey)
// split string on " :: " and take the last element
parts := strings.Split(lastVal, " :: ")
lastVal = parts[len(parts)-1]
val := fmt.Sprintf("%s :: %s", lastVal, a.name)
s.SetStr(key, val)
return nil
}
func TestScaff_Go_NoJoins(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
a2 := &actionMock{name: "action2", lastName: "action1", expectNoRun: true, t: t}
n1 := g.Blocks().Add("action1", a1)
_ = g.Blocks().Add("action2", a2)
g.SetEntrypoint(n1)
graph := &goraff.Graph{}
err := g.Go(graph)
assert.NoError(err)
// Should only be one state for action1, as it should only have run once, and the key should be set to the action name
states := graph.NodeByName("action1")
assert.Len(states, 1)
assert.Equal("action1", states[0].Get().FirstStr("action1_key"))
// action2 should not have run
assert.Len(graph.NodeByName("action2"), 0)
}
func TestScaff_NodeHasError(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
a2 := &actionMock{name: "action2", lastName: "action1", err: fmt.Errorf("error"), t: t}
n1 := g.Blocks().Add("action1", a1)
n2 := g.Blocks().Add("action2", a2)
g.Joins().Add(n1, n2, nil)
g.SetEntrypoint(n1)
graph := &goraff.Graph{}
err := g.Go(graph)
assert.Error(err)
assert.Equal("error running block: error", err.Error())
}
func TestScaff_Go_WithJoins(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
n1 := g.Blocks().Add("action1", a1)
a2 := &actionMock{name: "action2", lastName: "action1"}
n2 := g.Blocks().Add("action2", a2)
a3 := &actionMock{name: "action3", lastName: "action2"}
n3 := g.Blocks().Add("action3", a3)
a4 := &actionMock{name: "action4", expectNoRun: true, t: t}
g.Blocks().Add("action4", a4) // thi should not run
g.SetEntrypoint(n1)
// with no condition we always follow the join
g.Joins().Add(n1, n2, nil)
g.Joins().Add(n2, n3, nil)
// No join from n3, so it should stop after n3
graph := &goraff.Graph{}
err := g.Go(graph)
assert.NoError(err)
assert.Len(graph.NodeByName("action1"), 1)
assert.Equal("action1", graph.NodeByName("action1")[0].Get().FirstStr("action1_key"))
assert.Len(graph.NodeByName("action2"), 1)
assert.Equal("action1 :: action2", graph.NodeByName("action2")[0].Get().FirstStr("action2_key"))
assert.Len(graph.NodeByName("action3"), 1)
assert.Equal("action2 :: action3", graph.NodeByName("action3")[0].Get().FirstStr("action3_key"))
assert.Len(graph.NodeByName("action4"), 0) // Action 4 should not have run
}
func TestScaff_ConditionalJoins(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
n1 := g.Blocks().Add("action1", a1)
a2 := &actionMock{name: "action2", lastName: "action1", expectNoRun: true, t: t}
n2 := g.Blocks().Add("action2", a2)
a3 := &actionMock{name: "action3", lastName: "action1"}
n3 := g.Blocks().Add("action3", a3)
g.SetEntrypoint(n1)
// Both n2 and n3 should follow n1, but only n3 should match the condition
g.Joins().Add(n1, n2, goraff.FollowIfKeyMatches(n1, "action1_key", "should not match"))
g.Joins().Add(n1, n3, goraff.FollowIfKeyMatches(n1, "action1_key", "action1"))
graph := &goraff.Graph{}
err := g.Go(graph)
assert.NoError(err)
assert.Equal("action1", graph.FirstNodeByName(n1).Get().FirstStr("action1_key"))
assert.Nil(graph.NodeByID(n2)) // Action 2 should not have run
assert.Equal("action1 :: action3", graph.FirstNodeByName(n3).Get().FirstStr("action3_key"))
}
func TestScaff_FanOutNodes_Parallel(t *testing.T) {
// In this test we are checking tha we can fan out from a node
// and, importantly, that the actions run in parallel
// We will check parallelisation by delaying each action by a second.
// The first runs immediately, the next three should run in parallel
// and making sure the whole graph completes in around 2 seconds (not 4)
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1", delay: 1 * time.Second}
n1 := g.Blocks().Add("action1", a1)
a2 := &actionMock{name: "action2", lastName: "action1", delay: 1 * time.Second}
n2 := g.Blocks().Add("action2", a2)
a3 := &actionMock{name: "action3", lastName: "action1", delay: 1 * time.Second}
n3 := g.Blocks().Add("action3", a3)
a4 := &actionMock{name: "action4", lastName: "action1", delay: 1 * time.Second}
n4 := g.Blocks().Add("action4", a4)
g.SetEntrypoint(n1)
g.Joins().Add(n1, n2, nil)
g.Joins().Add(n1, n3, nil)
g.Joins().Add(n1, n4, nil)
start := time.Now()
graph := &goraff.Graph{}
err := g.Go(graph)
assert.NoError(err)
elapsed := time.Since(start)
assert.True(elapsed < 2500*time.Millisecond, "Elapsed time should be less than 2.5 seconds (first node, parallel nodes, and a bit of leeway)")
assert.Equal("action1", graph.FirstNodeByName(n1).Get().FirstStr("action1_key"))
assert.Equal("action1 :: action2", graph.FirstNodeByName(n2).Get().FirstStr("action2_key"))
assert.Equal("action1 :: action3", graph.FirstNodeByName(n3).Get().FirstStr("action3_key"))
assert.Equal("action1 :: action4", graph.FirstNodeByName(n4).Get().FirstStr("action4_key"))
}
type mockFollowIfWantsDone struct {
nodeIDs []string
t *testing.T
}
func (f *mockFollowIfWantsDone) Match(s *goraff.ReadableGraph) (bool, error) {
assert := assert.New(f.t)
for _, nodeID := range f.nodeIDs {
st, err := s.FirstNodeByName(nodeID)
assert.Nil(err)
d := st.Done()
fmt.Println(d)
assert.NotNil(st)
assert.True(st.Done())
}
return true, nil
}
func TestScaff_StateIsMarkedDoneBeforeTriggers(t *testing.T) {
// The state should be marked done before the triggers are checked
// Because some triggers may rely on the state being done
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
n1 := g.Blocks().Add("action1", a1)
a2 := &actionMock{name: "action2", lastName: "action1"}
n2 := g.Blocks().Add("action2", a2)
a3 := &actionMock{name: "action3", lastName: "action2"}
n3 := g.Blocks().Add("action3", a3)
g.SetEntrypoint(n1)
g.Joins().Add(n1, n2, nil)
followIf := &mockFollowIfWantsDone{nodeIDs: []string{n2}, t: t}
g.Joins().Add(n2, n3, followIf)
graph := &goraff.Graph{}
err := g.Go(graph)
assert.NoError(err)
assert.Equal("action1", graph.FirstNodeByName(n1).Get().FirstStr("action1_key"))
assert.Equal("action1 :: action2", graph.FirstNodeByName(n2).Get().FirstStr("action2_key"))
assert.Equal("action2 :: action3", graph.FirstNodeByName(n3).Get().FirstStr("action3_key"))
}
func TestScaff_EntrypointNotSet(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
graph := &goraff.Graph{}
err := g.Go(graph)
assert.Error(err)
assert.Equal("error validating graph: entrypoint not set", err.Error())
}
type actionMockCheckReader struct {
expectNilReader bool
t *testing.T
}
func (a *actionMockCheckReader) Do(s *goraff.Node, r *goraff.ReadableGraph, triggeringNS *goraff.ReadableNode) error {
if a.expectNilReader {
if triggeringNS != nil {
a.t.Error("Expected nil reader but got a non-nil reader")
}
s.SetStr("check_reader_key", "reader is nil")
} else {
if triggeringNS == nil {
a.t.Error("Expected non-nil reader but got a nil reader")
}
s.SetStr("check_reader_key", "reader is not nil")
}
return nil
}
func TestScaff_FlowMgr_ReaderPassing(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
// Define an action mock that will check the triggeringNS reader for nil
checkReaderAction1 := &actionMockCheckReader{
expectNilReader: true,
t: t,
}
n1 := g.Blocks().Add("action1", checkReaderAction1)
// Define another action mock that will be triggered by the first and expects a non-nil reader
checkReaderAction2 := &actionMockCheckReader{
expectNilReader: false,
t: t,
}
n2 := g.Blocks().Add("action2", checkReaderAction2)
g.SetEntrypoint(n1)
g.Joins().Add(n1, n2, nil)
graph := &goraff.Graph{}
err := g.Go(graph)
assert.NoError(err)
assert.Equal("reader is nil", graph.FirstNodeByName(n1).Get().FirstStr("check_reader_key"))
assert.Equal("reader is not nil", graph.FirstNodeByName(n2).Get().FirstStr("check_reader_key"))
}
func TestScaff_Go_ValidateEntrypoint(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
g.Blocks().Add("action1", a1)
a2 := &actionMock{name: "action2", lastName: "action1"}
g.Blocks().Add("action2", a2)
// No entrypoint set
graph := &goraff.Graph{}
err := g.Go(graph)
assert.Error(err)
assert.Equal("error validating graph: entrypoint not set", err.Error())
}
func TestScaff_Go_ValidateUniqueBlockNames(t *testing.T) {
assert := assert.New(t)
g := &goraff.Scaff{}
a1 := &actionMock{name: "action1"}
n1 := g.Blocks().Add("action1", a1)
a2 := &actionMock{name: "action1"}
g.Blocks().Add("action1", a2)
g.SetEntrypoint(n1)
graph := &goraff.Graph{}
err := g.Go(graph)
assert.Error(err)
assert.Equal("error validating graph: error validating blocks: block name not unique: action1", err.Error())
}
// This test is to ensure that the scaff can be reused
// with multiple graphs, eg. Does not hold on to any
// state from Go() calls
func TestScaff_Go_IsReusable(t *testing.T) {
assert := assert.New(t)
// Build Scaff
g := &goraff.Scaff{}
action1 := &actionMock{name: "action1"}
node1 := g.Blocks().Add("action1", action1)
action2 := &actionMock{name: "action2", lastName: "action1"}
node2 := g.Blocks().Add("action2", action2)
g.SetEntrypoint(node1)
g.Joins().Add(node1, node2, nil)
// Run three times sequentially
for i := 0; i < 3; i++ {
graph := &goraff.Graph{}
// let's store an ID to make sure we have the same graph at the end
id := uuid.New().String()
idNode := graph.NewNode("identier", nil)
idNode.SetStr("id", id)
err := g.Go(graph)
assert.NoError(err)
assert.Equal(id, graph.FirstNodeByName("identier").Get().FirstStr("id"))
assert.Equal("action1", graph.FirstNodeByName(node1).Get().FirstStr("action1_key"))
assert.Equal("action1 :: action2", graph.FirstNodeByName(node2).Get().FirstStr("action2_key"))
}
wg := sync.WaitGroup{}
respCh := make(chan error, 100)
// Run in parallel
for i := 0; i < 100; i++ {
wg.Add(1)
go func(i int) {
defer wg.Done()
graph := &goraff.Graph{}
// let's store an ID to make sure we have the same graph at the end
id := uuid.New().String()
idNode := graph.NewNode("identier", nil)
idNode.SetStr("id", id)
err := g.Go(graph)
assert.NoError(err)
assert.Equal(id, graph.FirstNodeByName("identier").Get().FirstStr("id"))
assert.Equal("action1", graph.FirstNodeByName(node1).Get().FirstStr("action1_key"))
assert.Equal("action1 :: action2", graph.FirstNodeByName(node2).Get().FirstStr("action2_key"))
respCh <- nil
}(i)
}
wg.Wait()
close(respCh)
responses := []error{}
for resp := range respCh {
assert.NoError(resp)
responses = append(responses, resp)
}
assert.Len(responses, 100)
}