Add formatter

test/known_graphs.jl

@@ -1,89 +1,89 @@
 using Random
 
-function test_known_graph(name::String, n, fusion_test=true)
-@testset "Test $name Graph ($n)" begin
-    graph = parse_abc(joinpath(@__DIR__, "..", "input", "$name.txt"))
-    props = graph_properties(graph)
+function test_known_graph(name::String, n, fusion_test = true)
+    @testset "Test $name Graph ($n)" begin
+        graph = parse_abc(joinpath(@__DIR__, "..", "input", "$name.txt"))
+        props = graph_properties(graph)
 
-    if (fusion_test) 
-        test_node_fusion(graph)
+        if (fusion_test)
+            test_node_fusion(graph)
+        end
+        test_random_walk(graph, n)
     end
-    test_random_walk(graph, n)
-end
 end
 
 function test_node_fusion(g::DAG)
-@testset "Test Node Fusion" begin
-    props = graph_properties(g)
-
-    options = get_operations(g)
-
-    nodes_number = length(g.nodes)
-    data = props.data
-    compute_effort = props.compute_effort
-
-    while !isempty(options.nodeFusions)
-        fusion = first(options.nodeFusions)
-
-        @test typeof(fusion) <: NodeFusion
-
-        push_operation!(g, fusion)
-
+    @testset "Test Node Fusion" begin
         props = graph_properties(g)
-        @test props.data < data
-        @test props.compute_effort == compute_effort
+
+        options = get_operations(g)
 
         nodes_number = length(g.nodes)
         data = props.data
         compute_effort = props.compute_effort
 
-        options = get_operations(g)
+        while !isempty(options.nodeFusions)
+            fusion = first(options.nodeFusions)
+
+            @test typeof(fusion) <: NodeFusion
+
+            push_operation!(g, fusion)
+
+            props = graph_properties(g)
+            @test props.data < data
+            @test props.compute_effort == compute_effort
+
+            nodes_number = length(g.nodes)
+            data = props.data
+            compute_effort = props.compute_effort
+
+            options = get_operations(g)
+        end
     end
 end
-end
 
 function test_random_walk(g::DAG, n::Int64)
-@testset "Test Random Walk ($n)" begin
-    # the purpose here is to do "random" operations and reverse them again and validate that the graph stays the same and doesn't diverge
-    reset_graph!(g)
+    @testset "Test Random Walk ($n)" begin
+        # the purpose here is to do "random" operations and reverse them again and validate that the graph stays the same and doesn't diverge
+        reset_graph!(g)
 
-    @test is_valid(g)
+        @test is_valid(g)
 
-    properties = graph_properties(g)
+        properties = graph_properties(g)
 
-    for i = 1:n
-        # choose push or pop
-        if rand(Bool)
-            # push
-            opt = get_operations(g)
+        for i in 1:n
+            # choose push or pop
+            if rand(Bool)
+                # push
+                opt = get_operations(g)
 
-            # choose one of fuse/split/reduce
-            option = rand(1:3)
-            if option == 1 && !isempty(opt.nodeFusions)
-                push_operation!(g, rand(collect(opt.nodeFusions)))
-            elseif option == 2 && !isempty(opt.nodeReductions)
-                push_operation!(g, rand(collect(opt.nodeReductions)))
-            elseif option == 3 && !isempty(opt.nodeSplits)
-                push_operation!(g, rand(collect(opt.nodeSplits)))
+                # choose one of fuse/split/reduce
+                option = rand(1:3)
+                if option == 1 && !isempty(opt.nodeFusions)
+                    push_operation!(g, rand(collect(opt.nodeFusions)))
+                elseif option == 2 && !isempty(opt.nodeReductions)
+                    push_operation!(g, rand(collect(opt.nodeReductions)))
+                elseif option == 3 && !isempty(opt.nodeSplits)
+                    push_operation!(g, rand(collect(opt.nodeSplits)))
+                else
+                    i = i - 1
+                end
             else
-                i = i - 1
-            end
-        else
-            # pop
-            if (can_pop(g))
-                pop_operation!(g)
-            else
-                i = i - 1
+                # pop
+                if (can_pop(g))
+                    pop_operation!(g)
+                else
+                    i = i - 1
+                end
             end
         end
+
+        reset_graph!(g)
+
+        @test is_valid(g)
+
+        @test properties == graph_properties(g)
     end
-
-    reset_graph!(g)
-
-    @test is_valid(g)
-
-    @test properties == graph_properties(g)
-end
 end
 
 Random.seed!(0)

test/node_reduction.jl

@@ -76,7 +76,7 @@ import MetagraphOptimization.make_node
     @test Set(nr.input) == Set([B1D_1, B1D_2])
     push_operation!(graph, nr)
     opt = get_operations(graph)
-    
+
     @test is_valid(graph)
 
     @test length(opt) == (nodeFusions = 4, nodeReductions = 0, nodeSplits = 1)

test/unit_tests_graph.jl

@@ -11,8 +11,10 @@ import MetagraphOptimization.partners
     @test length(graph.appliedOperations) == 0
     @test length(graph.operationsToApply) == 0
     @test length(graph.dirtyNodes) == 0
-    @test length(graph.diff) == (addedNodes = 0, removedNodes = 0, addedEdges = 0, removedEdges = 0)
-    @test length(get_operations(graph)) == (nodeFusions = 0, nodeReductions = 0, nodeSplits = 0)
+    @test length(graph.diff) ==
+          (addedNodes = 0, removedNodes = 0, addedEdges = 0, removedEdges = 0)
+    @test length(get_operations(graph)) ==
+          (nodeFusions = 0, nodeReductions = 0, nodeSplits = 0)
 
     # s to output (exit node)
     d_exit = insert_node!(graph, make_node(DataTask(10)), false)
@@ -105,7 +107,8 @@ import MetagraphOptimization.partners
     @test length(graph.appliedOperations) == 0
     @test length(graph.operationsToApply) == 0
     @test length(graph.dirtyNodes) == 26
-    @test length(graph.diff) == (addedNodes = 0, removedNodes = 0, addedEdges = 0, removedEdges = 0)
+    @test length(graph.diff) ==
+          (addedNodes = 0, removedNodes = 0, addedEdges = 0, removedEdges = 0)
 
     @test is_valid(graph)
 
@@ -132,7 +135,8 @@ import MetagraphOptimization.partners
     @test length(siblings(s0)) == 1
 
     operations = get_operations(graph)
-    @test length(operations) == (nodeFusions = 10, nodeReductions = 0, nodeSplits = 0)
+    @test length(operations) ==
+          (nodeFusions = 10, nodeReductions = 0, nodeSplits = 0)
     @test length(graph.dirtyNodes) == 0
 
     @test operations == get_operations(graph)
@@ -141,7 +145,7 @@ import MetagraphOptimization.partners
     properties = graph_properties(graph)
     @test properties.compute_effort == 134
     @test properties.data == 62
-    @test properties.compute_intensity ≈ 134/62
+    @test properties.compute_intensity ≈ 134 / 62
     @test properties.nodes == 26
     @test properties.edges == 25
 
@@ -153,7 +157,8 @@ import MetagraphOptimization.partners
     @test length(graph.operationsToApply) == 1
     @test first(graph.operationsToApply) == nf
     @test length(graph.dirtyNodes) == 0
-    @test length(graph.diff) == (addedNodes = 0, removedNodes = 0, addedEdges = 0, removedEdges = 0)
+    @test length(graph.diff) ==
+          (addedNodes = 0, removedNodes = 0, addedEdges = 0, removedEdges = 0)
 
     # this applies pending operations
     properties = graph_properties(graph)
@@ -166,12 +171,13 @@ import MetagraphOptimization.partners
     @test properties.edges == 23
     @test properties.compute_effort == 134
     @test properties.data < 62
-    @test properties.compute_intensity > 134/62
+    @test properties.compute_intensity > 134 / 62
 
     operations = get_operations(graph)
     @test length(graph.dirtyNodes) == 0
 
-    @test length(operations) == (nodeFusions = 9, nodeReductions = 0, nodeSplits = 0)
+    @test length(operations) ==
+          (nodeFusions = 9, nodeReductions = 0, nodeSplits = 0)
     @test !isempty(operations)
 
     possibleNF = 9
@@ -179,12 +185,14 @@ import MetagraphOptimization.partners
         push_operation!(graph, first(operations.nodeFusions))
         operations = get_operations(graph)
         possibleNF = possibleNF - 1
-        @test length(operations) == (nodeFusions = possibleNF, nodeReductions = 0, nodeSplits = 0)
+        @test length(operations) ==
+              (nodeFusions = possibleNF, nodeReductions = 0, nodeSplits = 0)
     end
 
     @test isempty(operations)
 
-    @test length(operations) == (nodeFusions = 0, nodeReductions = 0, nodeSplits = 0)
+    @test length(operations) ==
+          (nodeFusions = 0, nodeReductions = 0, nodeSplits = 0)
     @test length(graph.dirtyNodes) == 0
     @test length(graph.nodes) == 6
     @test length(graph.appliedOperations) == 10
@@ -202,10 +210,11 @@ import MetagraphOptimization.partners
     @test properties.edges == 25
     @test properties.compute_effort == 134
     @test properties.data == 62
-    @test properties.compute_intensity ≈ 134/62
+    @test properties.compute_intensity ≈ 134 / 62
 
     operations = get_operations(graph)
-    @test length(operations) == (nodeFusions = 10, nodeReductions = 0, nodeSplits = 0)
+    @test length(operations) ==
+          (nodeFusions = 10, nodeReductions = 0, nodeSplits = 0)
 
     @test is_valid(graph)
 end

test/unit_tests_nodes.jl

@@ -3,7 +3,8 @@
     nC1 = MetagraphOptimization.make_node(MetagraphOptimization.ComputeTaskU())
     nC2 = MetagraphOptimization.make_node(MetagraphOptimization.ComputeTaskV())
     nC3 = MetagraphOptimization.make_node(MetagraphOptimization.ComputeTaskP())
-    nC4 = MetagraphOptimization.make_node(MetagraphOptimization.ComputeTaskSum())
+    nC4 =
+        MetagraphOptimization.make_node(MetagraphOptimization.ComputeTaskSum())
 
     nD1 = MetagraphOptimization.make_node(MetagraphOptimization.DataTask(10))
     nD2 = MetagraphOptimization.make_node(MetagraphOptimization.DataTask(20))

test/unit_tests_utility.jl

@@ -5,7 +5,9 @@
     @test MetagraphOptimization.bytes_to_human_readable(1025) == "1.001 KiB"
     @test MetagraphOptimization.bytes_to_human_readable(684235) == "668.2 KiB"
     @test MetagraphOptimization.bytes_to_human_readable(86214576) == "82.22 MiB"
-    @test MetagraphOptimization.bytes_to_human_readable(9241457698) == "8.607 GiB"
-    @test MetagraphOptimization.bytes_to_human_readable(3218598654367) == "2.927 TiB"
+    @test MetagraphOptimization.bytes_to_human_readable(9241457698) ==
+          "8.607 GiB"
+    @test MetagraphOptimization.bytes_to_human_readable(3218598654367) ==
+          "2.927 TiB"
 end
 println("Utility Unit Tests Complete!")