-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbuilder_test.go
More file actions
349 lines (301 loc) · 7.63 KB
/
builder_test.go
File metadata and controls
349 lines (301 loc) · 7.63 KB
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
package pocket_test
import (
"context"
"fmt"
"sync/atomic"
"testing"
"time"
"github.com/agentstation/pocket"
)
func TestRunConcurrent(t *testing.T) {
store := pocket.NewStore()
counter := int32(0)
// Create nodes that increment a counter
nodes := make([]pocket.Node, 5)
for i := range nodes {
i := i
nodes[i] = pocket.NewNode[any, any](fmt.Sprintf("node%d", i),
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
atomic.AddInt32(&counter, 1)
time.Sleep(10 * time.Millisecond) // Simulate work
return fmt.Sprintf("result%d", i), nil
},
},
)
}
// Create inputs for each node
inputs := make([]any, len(nodes))
for i := range inputs {
inputs[i] = i
}
start := time.Now()
results, err := pocket.RunConcurrent(context.Background(), nodes, store, inputs)
duration := time.Since(start)
if err != nil {
t.Fatalf("RunConcurrent() error = %v", err)
}
// Check all nodes executed
if int(counter) != len(nodes) {
t.Errorf("counter = %d, want %d", counter, len(nodes))
}
// Check results
if len(results) != len(nodes) {
t.Errorf("len(results) = %d, want %d", len(results), len(nodes))
}
// Check concurrent execution (should be faster than sequential)
expectedSequential := time.Duration(len(nodes)) * 10 * time.Millisecond
if duration >= expectedSequential {
t.Errorf("duration = %v, want < %v (sequential time)", duration, expectedSequential)
}
}
func TestPipeline(t *testing.T) {
store := pocket.NewStore()
// Create pipeline stages
double := pocket.NewNode[any, any]("double",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return input.(int) * 2, nil
},
},
)
addTen := pocket.NewNode[any, any]("addTen",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return input.(int) + 10, nil
},
},
)
toString := pocket.NewNode[any, any]("toString",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return fmt.Sprintf("Result: %d", input.(int)), nil
},
},
)
nodes := []pocket.Node{double, addTen, toString}
tests := []struct {
name string
input any
want any
}{
{
name: "positive number",
input: 5,
want: "Result: 20", // computed as: (5 * 2) + 10 = 20
},
{
name: "zero",
input: 0,
want: "Result: 10", // computed as: (0 * 2) + 10 = 10
},
{
name: "negative number",
input: -5,
want: "Result: 0", // computed as: (-5 * 2) + 10 = 0
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
got, err := pocket.Pipeline(context.Background(), nodes, store, tt.input)
if err != nil {
t.Fatalf("Pipeline() error = %v", err)
}
if got != tt.want {
t.Errorf("Pipeline() = %v, want %v", got, tt.want)
}
})
}
}
func TestFanOut(t *testing.T) {
store := pocket.NewStore()
// Create a processor that squares numbers
square := pocket.NewNode[any, any]("square",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
n := input.(int)
return n * n, nil
},
},
)
items := []int{1, 2, 3, 4, 5}
results, err := pocket.FanOut(context.Background(), square, store, items)
if err != nil {
t.Fatalf("FanOut() error = %v", err)
}
// Check results
expected := []any{1, 4, 9, 16, 25}
if len(results) != len(expected) {
t.Fatalf("len(results) = %d, want %d", len(results), len(expected))
}
for i, got := range results {
if got != expected[i] {
t.Errorf("results[%d] = %v, want %v", i, got, expected[i])
}
}
}
func TestFanIn(t *testing.T) {
store := pocket.NewStore()
// Create source nodes that produce values
source1 := pocket.NewNode[any, any]("source1",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return 10, nil
},
},
)
source2 := pocket.NewNode[any, any]("source2",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return 20, nil
},
},
)
source3 := pocket.NewNode[any, any]("source3",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return 30, nil
},
},
)
// Create fan-in that sums the results
fanIn := pocket.NewFanIn(func(results []any) (any, error) {
sum := 0
for _, r := range results {
sum += r.(int)
}
return sum, nil
}, source1, source2, source3)
result, err := fanIn.Run(context.Background(), store)
if err != nil {
t.Fatalf("FanIn.Run() error = %v", err)
}
expected := 60 // 10 + 20 + 30
if result != expected {
t.Errorf("FanIn.Run() = %v, want %v", result, expected)
}
}
func TestBuilderFluent(t *testing.T) {
store := pocket.NewStore()
// Create nodes
input := pocket.NewNode[any, any]("input",
pocket.Steps{
Prep: func(ctx context.Context, store pocket.StoreReader, input any) (any, error) {
// Validate input
n, ok := input.(int)
if !ok {
return nil, fmt.Errorf("expected int input")
}
if n < 0 {
return nil, fmt.Errorf("negative input not allowed")
}
return n, nil
},
Exec: func(ctx context.Context, n any) (any, error) {
return n, nil
},
Post: func(ctx context.Context, store pocket.StoreWriter, input, prep, result any) (any, string, error) {
return result, defaultRoute, nil
},
},
)
process := pocket.NewNode[any, any]("process",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
// Process the number
return input.(int) * 10, nil
},
Post: func(ctx context.Context, store pocket.StoreWriter, input, prep, result any) (any, string, error) {
return result, defaultRoute, nil
},
},
)
format := pocket.NewNode[any, any]("format",
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
// Format output
return fmt.Sprintf("Processed: %d", input.(int)), nil
},
},
)
// Create a complex graph using builder
graph, err := pocket.NewBuilder(store).
Add(input).
Add(process).
Add(format).
Connect("input", "default", "process").
Connect("process", "default", "format").
Start("input").
Build()
if err != nil {
t.Fatalf("Builder.Build() error = %v", err)
}
// Test successful graph
result, err := graph.Run(context.Background(), 5)
if err != nil {
t.Fatalf("Graph.Run() error = %v", err)
}
expected := "Processed: 50"
if result != expected {
t.Errorf("Graph.Run() = %v, want %v", result, expected)
}
// Test error case
_, err = graph.Run(context.Background(), -5)
if err == nil {
t.Error("Graph.Run() with negative input error = nil, want error")
}
}
func BenchmarkPipeline(b *testing.B) {
store := pocket.NewStore()
// Create simple pipeline
nodes := make([]pocket.Node, 3)
for i := range nodes {
nodes[i] = pocket.NewNode[any, any](fmt.Sprintf("node%d", i),
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
return input.(int) + 1, nil
},
},
)
}
ctx := context.Background()
b.ResetTimer()
for i := 0; i < b.N; i++ {
_, err := pocket.Pipeline(ctx, nodes, store, 0)
if err != nil {
b.Fatal(err)
}
}
}
func BenchmarkRunConcurrent(b *testing.B) {
store := pocket.NewStore()
// Create nodes
nodes := make([]pocket.Node, 10)
for i := range nodes {
nodes[i] = pocket.NewNode[any, any](fmt.Sprintf("node%d", i),
pocket.Steps{
Exec: func(ctx context.Context, input any) (any, error) {
// Simulate some work
sum := 0
for j := 0; j < 100; j++ {
sum += j
}
return sum, nil
},
},
)
}
ctx := context.Background()
b.ResetTimer()
// Create inputs for concurrent execution
inputs := make([]any, len(nodes))
for i := range inputs {
inputs[i] = i
}
for i := 0; i < b.N; i++ {
_, err := pocket.RunConcurrent(ctx, nodes, store, inputs)
if err != nil {
b.Fatal(err)
}
}
}