-
Notifications
You must be signed in to change notification settings - Fork 1
/
graph_test.go
228 lines (220 loc) · 4.36 KB
/
graph_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
package gag
import (
"context"
"reflect"
"testing"
)
func TestRegister(t *testing.T) {
type args struct {
nodes []interface{}
}
tests := []struct {
name string
args args
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
Register(tt.args.nodes...)
})
}
}
func TestExecution_Next(t *testing.T) {
type fields struct {
output interface{}
edge Edge
g *Graph
}
type args struct {
ctx context.Context
}
tests := []struct {
name string
fields fields
args args
wantErr bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
e := Execution{
output: tt.fields.output,
edge: tt.fields.edge,
g: tt.fields.g,
}
if err := e.Next(tt.args.ctx); (err != nil) != tt.wantErr {
t.Errorf("Execution.Next() error = %v, wantErr %v", err, tt.wantErr)
}
})
}
}
func TestGraph_Run(t *testing.T) {
type fields struct {
Nodes []Node
Edges []Edge
}
type args struct {
nodeId int
ctx context.Context
}
tests := []struct {
name string
fields fields
args args
wantErr bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
g := &Graph{
Nodes: tt.fields.Nodes,
Edges: tt.fields.Edges,
}
if err := g.Run(tt.args.nodeId, tt.args.ctx); (err != nil) != tt.wantErr {
t.Errorf("Graph.Run() error = %v, wantErr %v", err, tt.wantErr)
}
})
}
}
func TestGraph_fetchNodeOutput(t *testing.T) {
type fields struct {
Nodes []Node
Edges []Edge
}
type args struct {
ctx context.Context
nodeId int
field string
}
tests := []struct {
name string
fields fields
args args
want interface{}
wantErr bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
g := &Graph{
Nodes: tt.fields.Nodes,
Edges: tt.fields.Edges,
}
got, err := g.fetchNodeOutput(tt.args.ctx, tt.args.nodeId, tt.args.field)
if (err != nil) != tt.wantErr {
t.Errorf("Graph.fetchNodeOutput() error = %v, wantErr %v", err, tt.wantErr)
return
}
if !reflect.DeepEqual(got, tt.want) {
t.Errorf("Graph.fetchNodeOutput() = %v, want %v", got, tt.want)
}
})
}
}
func TestGraph_findOutputEdge(t *testing.T) {
type fields struct {
Nodes []Node
Edges []Edge
}
type args struct {
id int
field string
}
tests := []struct {
name string
fields fields
args args
want Edge
want1 bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
g := &Graph{
Nodes: tt.fields.Nodes,
Edges: tt.fields.Edges,
}
got, got1 := g.findOutputEdge(tt.args.id, tt.args.field)
if !reflect.DeepEqual(got, tt.want) {
t.Errorf("Graph.findOutputEdge() got = %v, want %v", got, tt.want)
}
if got1 != tt.want1 {
t.Errorf("Graph.findOutputEdge() got1 = %v, want %v", got1, tt.want1)
}
})
}
}
func TestGraph_findInputEdge(t *testing.T) {
type fields struct {
Nodes []Node
Edges []Edge
}
type args struct {
id int
field string
}
tests := []struct {
name string
fields fields
args args
want Edge
want1 bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
g := &Graph{
Nodes: tt.fields.Nodes,
Edges: tt.fields.Edges,
}
got, got1 := g.findInputEdge(tt.args.id, tt.args.field)
if !reflect.DeepEqual(got, tt.want) {
t.Errorf("Graph.findInputEdge() got = %v, want %v", got, tt.want)
}
if got1 != tt.want1 {
t.Errorf("Graph.findInputEdge() got1 = %v, want %v", got1, tt.want1)
}
})
}
}
func TestGraph_buildNode(t *testing.T) {
type fields struct {
Nodes []Node
Edges []Edge
}
type args struct {
ctx context.Context
nodeId int
}
tests := []struct {
name string
fields fields
args args
want Runner
wantErr bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
g := &Graph{
Nodes: tt.fields.Nodes,
Edges: tt.fields.Edges,
}
got, err := g.buildNode(tt.args.ctx, tt.args.nodeId)
if (err != nil) != tt.wantErr {
t.Errorf("Graph.buildNode() error = %v, wantErr %v", err, tt.wantErr)
return
}
if !reflect.DeepEqual(got, tt.want) {
t.Errorf("Graph.buildNode() = %v, want %v", got, tt.want)
}
})
}
}