131
131
numNodes = 10
132
132
dfg = testDFGAPI {NoSolverParams} ()
133
133
verts = map (n -> DFGVariable (Symbol (" x$n " )), 1 : numNodes)
134
+ # change ready and backendset for x7,x8 for improved tests on x7x8f1
135
+ verts[7 ]. ready = 1
136
+ verts[8 ]. backendset = 1
134
137
map (v -> addVariable! (dfg, v), verts)
135
138
map (n -> addFactor! (dfg, [verts[n], verts[n+ 1 ]], DFGFactor {Int, :Symbol} (Symbol (" x$(n) x$(n+ 1 ) f1" ))), 1 : (numNodes- 1 ))
136
139
# map(n -> addFactor!(dfg, [verts[n], verts[n+2]], DFGFactor(Symbol("x$(n)x$(n+2)f2"))), 1:2:(numNodes-2))
@@ -147,12 +150,15 @@ map(n -> addFactor!(dfg, [verts[n], verts[n+1]], DFGFactor{Int, :Symbol}(Symbol(
147
150
@test getNeighbors (dfg, getFactor (dfg, :x1x2f1 )) == ls (dfg, getFactor (dfg, :x1x2f1 ))
148
151
@test getNeighbors (dfg, :x1x2f1 ) == ls (dfg, :x1x2f1 )
149
152
150
- # TODO @Dehann, I don't know exactly what wil be in it, so testing with 0 and 1
151
153
# ready and backendset
152
154
@test getNeighbors (dfg, :x5 , ready= 1 ) == Symbol[]
153
155
@test getNeighbors (dfg, :x5 , ready= 0 ) == [:x4x5f1 ,:x5x6f1 ]
154
156
@test getNeighbors (dfg, :x5 , backendset= 1 ) == Symbol[]
155
157
@test getNeighbors (dfg, :x5 , backendset= 0 ) == [:x4x5f1 ,:x5x6f1 ]
158
+ @test getNeighbors (dfg, :x7x8f1 , ready= 0 ) == [:x8 ]
159
+ @test getNeighbors (dfg, :x7x8f1 , backendset= 0 ) == [:x7 ]
160
+ @test getNeighbors (dfg, :x7x8f1 , ready= 1 ) == [:x7 ]
161
+ @test getNeighbors (dfg, :x7x8f1 , backendset= 1 ) == [:x8 ]
156
162
@test getNeighbors (dfg, verts[1 ], ready= 0 ) == [:x1x2f1 ]
157
163
@test getNeighbors (dfg, verts[1 ], ready= 1 ) == Symbol[]
158
164
@test getNeighbors (dfg, verts[1 ], backendset= 0 ) == [:x1x2f1 ]
0 commit comments