-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchain_test.go
185 lines (159 loc) · 3.44 KB
/
chain_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
package cronjob
import (
"fmt"
"reflect"
"sync"
"testing"
"time"
)
func TestChain(t *testing.T) {
t.Parallel()
var nums []int
chain1 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(1)
chain2 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(2)
chain3 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(3)
job := func() error {
nums = append(nums, 4)
return nil
}
NewChain(chain1, chain2, chain3).Run(job)
if got, want := nums, []int{1, 2, 3, 4}; !reflect.DeepEqual(got, want) {
t.Fatalf("want: %v got: %v\n", want, got)
}
}
func TestRetry(t *testing.T) {
t.Parallel()
t.Run("Test Timeout", func(t *testing.T) {
t.Parallel()
wg := &sync.WaitGroup{}
wg.Add(2)
job := func() error {
wg.Done()
return fmt.Errorf("error")
}
go NewChain(Retry(2*time.Second, 2)).Run(job)
select {
case <-wait(wg):
t.Fatal("job ran.")
case <-time.After(1 * time.Second):
// timeout works and second job got delayed.
}
})
t.Run("Test Exit On Success", func(t *testing.T) {
t.Parallel()
var count int
job := func() error {
count++
if count%2 != 0 {
return fmt.Errorf("error")
}
return nil
}
NewChain(Retry(0, 4)).Run(job)
if got, want := count, 2; got != want {
t.Fatalf("want: %v got: %v\n", want, got)
}
})
t.Run("Test Max Retries", func(t *testing.T) {
t.Parallel()
var count int
job := func() error {
count++
return fmt.Errorf("error")
}
NewChain(Retry(0, 4)).Run(job)
if got, want := count, 4; got != want {
t.Fatalf("want: %v got: %v\n", want, got)
}
})
t.Run("Test Retry With Decorators", func(t *testing.T) {
t.Parallel()
var count int
incrementChain := func(fj FuncJob) FuncJob {
return func() error {
count++
return fj()
}
}
incrementChain2 := func(fj FuncJob) FuncJob {
return func() error {
count++
count++
return fj()
}
}
job := func() error {
return fmt.Errorf("error")
}
NewChain(Retry(0, 5), incrementChain, incrementChain2).Run(job)
if got, want := count, 15; got != want {
t.Fatalf("want: %v got: %v\n", want, got)
}
})
}
func TestMergeChains(t *testing.T) {
var nums []int
chain1 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(1)
chain2 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(2)
chain3 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(3)
chain4 := func(num int) func(job FuncJob) FuncJob {
return func(job FuncJob) FuncJob {
return func() error {
nums = append(nums, num)
return job()
}
}
}(4)
job := func() error {
nums = append(nums, 5)
return nil
}
merge1 := NewChain(chain1, chain2)
merge2 := NewChain(chain3, chain4)
MergeChains(merge1, merge2).Run(job)
if got, want := nums, []int{1, 2, 3, 4, 5}; !reflect.DeepEqual(got, want) {
t.Fatalf("want: %v got: %v\n", want, got)
}
}