-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmaquina_test.go
617 lines (580 loc) · 16.3 KB
/
maquina_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
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
package maquina
import (
"bytes"
"context"
"errors"
"fmt"
"math/rand"
"os"
"os/exec"
"strconv"
"testing"
)
type intTransition = Transition[int]
func TestStateMachine_OnUnhandledTrigger(t *testing.T) {
var unhandled = errors.New("unhandled")
sm := NewStateMachine(NewState("start", 1))
sm.OnUnhandledTrigger(func(current *State[int], t Trigger) error {
return unhandled
})
err := sm.FireBg("unhandled trigger", 1)
if err != unhandled {
t.Errorf("expected unhandled error, got %v", err)
}
sm.OnUnhandledTrigger(nil)
t.Run("catch panic", func(t *testing.T) {
defer func() {
a := recover()
if a == nil {
t.Error("expected panic with unhandled trigger, got nil")
}
}()
sm.FireBg("unhandled trigger with panic", 1)
})
}
func TestStateMachine_alwaysPermit(t *testing.T) {
const alwaysTrig Trigger = "goto failsafe"
failsafeState := NewState("failsafe", 1)
states := hyperStates(8)
sm := NewStateMachine(states[0])
sm.AlwaysPermit(alwaysTrig, failsafeState)
// makeDOT("failsafe_alwayspermit", sm)
i := 0
fcbP1 := NewFringeCallback("plus1", func(_ context.Context, _ intTransition, _ int) {
i++
})
fcbP2 := NewFringeCallback("plus1", func(_ context.Context, _ intTransition, _ int) {
i += 2
})
sm.OnTransitioning(fcbP1)
sm.OnTransitioned(fcbP2)
err := sm.FireBg(alwaysTrig, 1)
if err != nil {
t.Error("expected no error, got", err)
}
if sm.State() != failsafeState {
t.Errorf("expected %s, got %s", failsafeState, sm.State())
}
expect := 3
if i != expect {
t.Errorf("expected both transitioning callbacks to be called, got counter %d instead of %d", i, expect)
}
err = sm.FireBg(alwaysTrig, 1)
if err != nil {
t.Error("expected no error, got", err)
}
if sm.State() != failsafeState {
t.Errorf("expected %s, got %s", failsafeState.String(), sm.State())
}
expect = 6
if i != expect {
t.Errorf("expected both transitioning callbacks to be called, got counter %d instead of %d", i, expect)
}
}
func TestOnReentryExitEntry(t *testing.T) {
const (
triggerReentry1 Trigger = "reentry1"
trigger1_2 Trigger = "t1-2"
trigger2_3 Trigger = "t2-3"
trigger3_2 Trigger = "t3-2"
)
state1 := NewState("state1", 1)
state2 := NewState("state2", 2)
state3 := NewState("state3", 3)
var reentryCount, exitCount1, entryCount2, exitCount2, entryCount3, exitCount3 int
state1.Permit(triggerReentry1, state1)
state1.OnReentry(NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
reentryCount++
}))
state1.Permit(trigger1_2, state2)
state1.OnExit(NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
exitCount1++
}))
state2.Permit(trigger2_3, state3)
state2.OnEntry(NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
entryCount2++
}))
state2.OnExit(NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
exitCount2++
}))
state3.Permit(trigger3_2, state2)
state3.OnExit(NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
exitCount3++
}))
state3.OnEntry(NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
entryCount3++
}))
sm := NewStateMachine(state1)
// Perform reentries.
const reeentries = 5
for i := 0; i < reeentries; i++ {
err := sm.FireBg(triggerReentry1, 1)
if err != nil {
t.Fatal(err)
}
}
if reentryCount != reeentries {
t.Errorf("expected %d reentries, got %d", reeentries, reentryCount)
}
err := sm.FireBg(trigger1_2, 1)
if err != nil {
t.Fatal(err)
}
if exitCount1 != 1 {
t.Error("expected 1 exit from state1, got", exitCount1)
}
if entryCount2 != 1 {
t.Error("expected 1 entry into state2, got", entryCount2)
}
const transitions = 5
for i := 0; i < transitions; i++ {
err := sm.FireBg(trigger2_3, 1)
if err != nil {
t.Fatal(err)
}
err = sm.FireBg(trigger3_2, 1)
if err != nil {
t.Fatal(err)
}
if exitCount2 != i+1 {
t.Errorf("expected %d exits from state2, got %d", i+1, exitCount2)
}
if entryCount3 != i+1 {
t.Errorf("expected %d exits from state2, got %d", i+1, exitCount2)
}
if exitCount3 != i+1 {
t.Errorf("expected %d exits from state3, got %d", i+1, exitCount3)
}
if entryCount2 != i+2 {
t.Errorf("expected %d exits from state2, got %d", i+2, exitCount2)
}
}
}
func TestOnEntryExitFrom(t *testing.T) {
const (
triggerReentry1 Trigger = "reentry1"
trigger1_2 Trigger = "t1-2"
trigger2_3 Trigger = "t2-3"
trigger3_2 Trigger = "t3-2"
)
state1 := NewState("state1", 1)
state2 := NewState("state2", 2)
state3 := NewState("state3", 3)
var countEntry1_2, countEntry2_3, countEntry3_2, countReentry1, countExit1_2 int
state1.Permit(trigger1_2, state2)
state1.Permit(triggerReentry1, state1)
state1.OnReentryFrom(triggerReentry1, NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
countReentry1++
}))
state1.OnExitThrough(trigger1_2, NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
countExit1_2++
}))
state2.Permit(trigger2_3, state3)
state2.OnEntryFrom(trigger1_2, NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
countEntry1_2++
}))
state2.OnEntryFrom(trigger3_2, NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
countEntry3_2++
}))
state3.Permit(trigger3_2, state2)
state3.OnEntryFrom(trigger2_3, NewFringeCallback("cb", func(ctx context.Context, _ intTransition, input int) {
countEntry2_3++
}))
sm := NewStateMachine(state1)
err := sm.FireBg(triggerReentry1, 1)
if err != nil {
t.Fatal(err)
}
if countReentry1 != 1 {
t.Error("expected 1 reentry into state1, got", countReentry1)
}
if countExit1_2 != 0 {
t.Error("expected 0 exit from state1, got", countExit1_2)
}
err = sm.FireBg(trigger1_2, 1)
if err != nil {
t.Fatal(err)
}
if countExit1_2 != 1 {
t.Error("expected 1 exit from state1 to state2, got", countExit1_2)
}
if countEntry1_2 != 1 {
t.Error("expected 1 entry into state2 from state1, got", countEntry1_2)
}
if countEntry3_2 != 0 {
t.Error("expected 0 entry into state2 from state3, got", countEntry3_2)
}
const transitions = 5
for i := 0; i < transitions; i++ {
err = sm.FireBg(trigger2_3, 1)
if err != nil {
t.Fatal(err)
}
if countEntry2_3 != i+1 {
t.Errorf("expected %d entries into state3 from state2, got %d", i+1, countEntry2_3)
}
if countEntry3_2 != i {
t.Errorf("expected %d entries into state2 from state3, got %d", i, countEntry3_2)
}
err = sm.FireBg(trigger3_2, 1)
if err != nil {
t.Fatal(err)
}
if countEntry2_3 != i+1 {
t.Errorf("expected %d entries into state3 from state2, got %d", i+1, countEntry2_3)
}
if countEntry3_2 != i+1 {
t.Errorf("expected %d entries into state2 from state3, got %d", i+1, countEntry3_2)
}
}
}
func TestWalkStates(t *testing.T) {
const hyperNum = 8
states := hyperStates(hyperNum)
statesCounted := 0
WalkStates(states[0], func(s *State[int]) error {
statesCounted++
return nil
})
if statesCounted != hyperNum {
t.Error("expected", hyperNum, "states, got", statesCounted)
}
// sm := NewStateMachine(states[0])
// makeDOT("hyper", sm)
}
func TestGuardClauseError(t *testing.T) {
var guardError = errors.New("guard error")
state1 := NewState("state1", 1)
state2 := NewState("state2", 2)
state1.Permit("trigger", state2, NewGuard("always fail", func(_ context.Context, _ int) error {
return guardError
}))
sm := NewStateMachine(state1)
err := sm.FireBg("trigger", 1)
if !errors.Is(err, guardError) {
t.Errorf("expected guard error, got %v", err)
}
var g *GuardClauseError
if !errors.As(err, &g) {
t.Errorf("expected guard clause error, got %T", err)
}
}
func hyperTrig(start, end int) Trigger {
return Trigger("T" + strconv.Itoa(start) + "→" + strconv.Itoa(end))
}
func hyperStates(n int) []*State[int] {
states := make([]*State[int], n)
for i := 0; i < n; i++ {
states[i] = NewState("S"+strconv.Itoa(i), i)
for j := i - 1; j >= 0; j-- {
trigger := hyperTrig(i, j)
states[i].Permit(trigger, states[j])
}
}
for i := 0; i < n; i++ {
for j := i + 1; j < n; j++ {
trigger := hyperTrig(i, j)
states[i].Permit(trigger, states[j])
}
}
return states
}
func makeDOT(name string, sm *StateMachine[int]) {
var buf bytes.Buffer
_, err := WriteDOT(&buf, sm)
if err != nil {
panic(err)
}
os.Mkdir("testdata", 0777)
cmd := exec.Command("dot", "-Tpng", "-o", "testdata/"+name+".png")
cmd.Stdin = &buf
cmd.Run()
}
func TestMustPanics(t *testing.T) {
var okState = NewState("ok1", 1)
var nilGC func(_ context.Context, _ int) error
var nilFringeCallback func(_ context.Context, _ intTransition, _ int)
var nilState *State[int]
var nilFringe FringeCallback[int]
var okFringe = NewFringeCallback("cb", func(_ context.Context, _ intTransition, _ int) {})
testCases := []struct {
desc string
fn func()
}{
{
desc: "empty state label",
fn: func() { NewState("", 1) },
},
{
desc: "empty guard clause label",
fn: func() { NewGuard("", func(_ context.Context, _ int) error { return nil }) },
},
{
desc: "nil guard clause callback",
fn: func() { NewGuard("ok", nilGC) },
},
{
desc: "nil destination state",
fn: func() { NewState("ok", 1).Permit("ok", nil) },
},
{
desc: "nil state machine state",
fn: func() { NewStateMachine(nilState) },
},
{
desc: "nil on exit callback",
fn: func() { NewState("ok", 1).OnExit(nilFringe) },
},
{
desc: "nil on entry callback",
fn: func() { NewState("ok", 1).OnEntry(nilFringe) },
},
{
desc: "nil on reentry callback",
fn: func() { NewState("ok", 1).OnReentry(nilFringe) },
},
{
desc: "empty fringe label",
fn: func() { NewFringeCallback("", func(_ context.Context, _ intTransition, _ int) {}) },
},
{
desc: "nil fringe callback",
fn: func() { NewFringeCallback("cb", nilFringeCallback) },
},
{
desc: "use of trigger wildcard",
fn: func() { NewState("ok", 1).OnEntryFrom(triggerWildcard, okFringe) },
},
{
desc: "empty trigger",
fn: func() { NewState("ok", 1).Permit("", NewState("notok", 2)) },
},
{
desc: "trigger registered twice in state",
fn: func() {
s := NewState("ok", 1)
s.Permit("trig1", s)
s.Permit("trig1", s)
},
},
{
desc: "nil destination state in always permit",
fn: func() { NewStateMachine(okState).AlwaysPermit("ok", nil) },
},
{
desc: "wildcard trigger in always permit",
fn: func() { NewStateMachine(okState).AlwaysPermit(triggerWildcard, okState) },
},
{
desc: "empty trigger in always permit",
fn: func() { NewStateMachine(okState).AlwaysPermit("", okState) },
},
}
for _, tC := range testCases {
t.Run(tC.desc, func(t *testing.T) {
defer func() {
if r := recover(); r == nil {
t.Errorf("expected panic, got no panic")
}
}()
tC.fn()
})
}
}
func ExampleWriteDOT_simple() {
state1 := NewState("state1", 1)
state2 := NewState("state2", 2)
state1.Permit("trigger", state2)
sm := NewStateMachine(state1)
var buf bytes.Buffer
_, err := WriteDOT(&buf, sm)
if err != nil {
panic(err)
}
fmt.Println(buf.String())
//Unordered output:
// digraph {
// rankdir=LR;
// node [shape = box];
// graph [ dpi = 300 ];
// "state1" -> "state2" [ label = "trigger", style = "solid" ];
// "state2" [ color = red ]
// "state1" [ color = blue ]
// }
}
func TestTriggersAvailable(t *testing.T) {
states := hyperStates(8)
sm := NewStateMachine(states[0])
tr := sm.TriggersAvailable()
if len(tr) != 7 {
t.Error("expected 7 triggers, got", len(tr))
}
for i := 0; i < len(tr); i++ {
for j := i + 1; j < len(tr); j++ {
if tr[i] == tr[j] {
t.Errorf("expected unique triggers, got %d == %d", i, j)
}
}
}
}
func TestLinkSubstates(t *testing.T) {
states := hyperStates(5)
parent := states[0]
superParent := states[4]
err := parent.LinkSubstates(states[1], states[2])
if err != nil {
t.Fatal(err)
}
err = superParent.LinkSubstates(parent)
if err != nil {
t.Fatal(err)
}
if !parent.isSubstateOf(superParent) {
t.Error("expected parent to be substate of superParent")
}
if !states[1].isSubstateOf(parent) || !states[2].isSubstateOf(parent) {
t.Error("expected linked substate")
}
if states[3].isSubstateOf(parent) {
t.Error("did not expect linked substate")
}
if !states[1].isSubstateOf(superParent) || !states[2].isSubstateOf(superParent) {
t.Error("expected linked substate")
}
if states[3].isSubstateOf(superParent) {
t.Error("did not expect linked substate")
}
err = states[1].LinkSubstates(parent)
if err == nil {
t.Error("expected cyclic linking error, got nil")
}
err = parent.LinkSubstates(states[1])
if err == nil {
t.Error("expected error on linking already linked state, got nil")
}
err = parent.LinkSubstates(nil)
if err == nil {
t.Error("expected error on linking nil state, got nil")
}
}
func TestSuperstateFringe(t *testing.T) {
const (
PARENT = 0
SUPER = 4
EXTERNAL = 3 // State with no parent.
)
states := hyperStates(5)
parent := states[PARENT]
superParent := states[SUPER]
parent.LinkSubstates(states[1], states[2])
superParent.LinkSubstates(parent)
var enter, exit, superEnter, superExit int
var lastTransiton intTransition
var (
fringeEnter = NewFringeCallback("enter", func(_ context.Context, _ intTransition, _ int) {
enter++
})
fringeExit = NewFringeCallback("exit", func(_ context.Context, _ intTransition, _ int) {
exit++
})
superFringeEnter = NewFringeCallback("superEnter", func(_ context.Context, _ intTransition, _ int) {
superEnter++
})
superFringeExit = NewFringeCallback("superExit", func(_ context.Context, _ intTransition, _ int) {
superExit++
})
onTransitioning = NewFringeCallback("onTransition", func(_ context.Context, tr intTransition, _ int) {
lastTransiton = tr
})
)
parent.OnEntry(fringeEnter)
parent.OnExit(fringeExit)
superParent.OnEntry(superFringeEnter)
superParent.OnExit(superFringeExit)
sm := NewStateMachine(states[1])
sm.OnTransitioning(onTransitioning)
expectEnter := 0
expectExit := 0
expectSEnter := 0
expectSExit := 0
for it, test := range []struct {
START, END int
expectEnter, expectExit int
expectSEnter, expectSExit int
}{
0: {START: 1, END: PARENT},
1: {START: PARENT, END: SUPER, expectExit: 1},
2: {START: SUPER, END: EXTERNAL, expectSExit: 1},
3: {START: EXTERNAL, END: 1, expectEnter: 1, expectSEnter: 1},
4: {START: 1, END: EXTERNAL, expectExit: 1, expectSExit: 1},
5: {START: EXTERNAL, END: SUPER, expectSEnter: 1},
6: {START: SUPER, END: PARENT, expectEnter: 1},
// Internal transitions.
7: {START: PARENT, END: 1}, 8: {START: 1, END: 2}, 9: {START: 2, END: 1}, 10: {START: 1, END: 2},
11: {START: 2, END: SUPER, expectExit: 1},
12: {START: SUPER, END: 2, expectEnter: 1},
} {
trigger := hyperTrig(test.START, test.END)
t.Run(fmt.Sprintf("iter=%d:%s", it, trigger), func(t *testing.T) {
err := sm.FireBg(trigger, it)
if err != nil {
t.Fatal(err)
}
expectEnter += test.expectEnter
expectExit += test.expectExit
expectSEnter += test.expectSEnter
expectSExit += test.expectSExit
if enter != expectEnter {
t.Errorf("unexpected ENTER %d!=%d", enter, expectEnter)
}
if exit != expectExit {
t.Errorf("unexpected EXIT %d!=%d", exit, expectExit)
}
if superEnter != expectSEnter {
t.Errorf("unexpected SUPENTER %d!=%d", superEnter, expectSEnter)
}
if superExit != expectSExit {
t.Errorf("unexpected SUPEXIT %d!=%d", superExit, expectSExit)
}
})
if t.Failed() {
t.Errorf("lastTransition: %s", lastTransiton.String())
t.FailNow()
}
}
}
func ExampleMermaid() {
const (
PARENT = 0
SUPER = 4
EXTERNAL = 3 // State with no parent.
)
states := hyperStates(5)
parent := states[PARENT]
superParent := states[SUPER]
parent.LinkSubstates(states[1], states[2])
superParent.LinkSubstates(parent)
sm := NewStateMachine(parent)
var buf bytes.Buffer
writeMermaidStateDiagram(&buf, sm, diagConfig{})
fmt.Println(buf.String())
}
func BenchmarkHyper(b *testing.B) {
rand.Seed(1)
states := hyperStates(8)
sm := NewStateMachine(states[0])
sm.OnUnhandledTrigger(func(current *State[int], t Trigger) error {
return nil
})
ctx := context.TODO()
// avail := sm.TriggersPermitted(ctx, 1)
b.ResetTimer()
for i := 0; i < b.N; i++ {
avail := sm.actual.transitions // Avoid allocations.
nextTrigger := avail[rand.Intn(len(avail))]
err := sm.Fire(ctx, nextTrigger.Trigger, 1)
if err != nil {
b.Log("error", err)
}
}
}