@@ -1008,7 +1008,9 @@ function testGroup!(fg, v1, v2, f0, f1)
10081008 @test_skip varNearTs[1 ][1 ] == [:b ]
10091009
10101010 # # SORT copied from CRUD
1011- @test all (getVariables (fg; labelFilter = contains (r" a" )) .== [getVariable (fg, v1. label)])
1011+ @test all (
1012+ getVariables (fg; labelFilter = contains (r" a" )) .== [getVariable (fg, v1. label)],
1013+ )
10121014 @test all (getVariables (fg; solvableFilter = >= (1 )) .== [getVariable (fg, v2. label)])
10131015 @test getVariables (fg; labelFilter = contains (r" a" ), solvableFilter = >= (1 )) == []
10141016 @test getVariables (fg; tagsFilter = ⊇ ([:LANDMARK ]))[1 ] == getVariable (fg, v2. label)
@@ -1033,7 +1035,10 @@ function testGroup!(fg, v1, v2, f0, f1)
10331035
10341036 # Tags
10351037 @test ls (fg; tagsFilter = ⊇ ([:POSE ])) == []
1036- @test issetequal (ls (fg; tagsFilter = ! isdisjoint ([:POSE , :LANDMARK ])), ls (fg; tagsFilter = ⊇ ([:VARIABLE ])))
1038+ @test issetequal (
1039+ ls (fg; tagsFilter = ! isdisjoint ([:POSE , :LANDMARK ])),
1040+ ls (fg; tagsFilter = ⊇ ([:VARIABLE ])),
1041+ )
10371042
10381043 @test lsf (fg; tagsFilter = ! isdisjoint ([:NONE ])) == []
10391044 @test lsf (fg; tagsFilter = ⊇ ([:NONE ])) == []
@@ -1297,7 +1302,10 @@ function GettingNeighbors(testDFGAPI; VARTYPE = VariableCompute, FACTYPE = Facto
12971302 # TODO if not a GraphsDFG with and summary or skeleton
12981303 if VARTYPE == VariableCompute
12991304 @test listNeighbors (dfg, :x5 ; solvableFilter = >= (2 )) == Symbol[]
1300- @test issetequal (listNeighbors (dfg, :x5 ; solvableFilter = >= (0 )), [:x4x5f1 , :x5x6f1 ])
1305+ @test issetequal (
1306+ listNeighbors (dfg, :x5 ; solvableFilter = >= (0 )),
1307+ [:x4x5f1 , :x5x6f1 ],
1308+ )
13011309 @test issetequal (listNeighbors (dfg, :x5 ), [:x4x5f1 , :x5x6f1 ])
13021310 @test listNeighbors (dfg, :x7x8f1 ; solvableFilter = >= (0 )) == [:x7 , :x8 ]
13031311 @test listNeighbors (dfg, :x7x8f1 ; solvableFilter = >= (1 )) == [:x7 ]
0 commit comments