add blue style formatter

Author: BatyLeo

.JuliaFormatter.toml

@@ -0,0 +1 @@
+style = "blue"

.gitignore

@@ -1,3 +1,4 @@
+.vscode
 /docs/src/index.md
 
 # Files generated by invoking Julia with --code-coverage

docs/make.jl

@@ -1,18 +1,14 @@
 using Documenter
 using InferOptBenchmarks
 
-cp(
-    joinpath(@__DIR__, "..", "README.md"),
-    joinpath(@__DIR__, "src", "index.md");
-    force = true,
-)
+cp(joinpath(@__DIR__, "..", "README.md"), joinpath(@__DIR__, "src", "index.md"); force=true)
 
 makedocs(;
-    modules = [InferOptBenchmarks, InferOptBenchmarks.Warcraft],
-    authors = "Members of JuliaDecisionFocusedLearning",
-    sitename = "InferOptBenchmarks.jl",
-    format = Documenter.HTML(),
-    pages = [
+    modules=[InferOptBenchmarks, InferOptBenchmarks.Warcraft],
+    authors="Members of JuliaDecisionFocusedLearning",
+    sitename="InferOptBenchmarks.jl",
+    format=Documenter.HTML(),
+    pages=[
         "Home" => "index.md",  #
         "API reference" => [
             "warcraft.md",  #
@@ -21,6 +17,5 @@ makedocs(;
 )
 
 deploydocs(;
-    repo = "github.com/JuliaDecisionFocusedLearning/InferOptBenchmarks.jl",
-    devbranch = "main",
+    repo="github.com/JuliaDecisionFocusedLearning/InferOptBenchmarks.jl", devbranch="main"
 )

src/Warcraft/grid_graph.jl

@@ -10,7 +10,7 @@ This represents the Warcraft shortest paths problem of
 - If `acyclic = false`, a cell has edges to each one of its 8 neighbors.
 - If `acyclic = true`, a cell has edges to its south, east and southeast neighbors only (ensures an acyclic graph where topological sort will work)
 """
-function warcraft_grid_graph(costs::AbstractMatrix{R}; acyclic::Bool = false) where {R}
+function warcraft_grid_graph(costs::AbstractMatrix{R}; acyclic::Bool=false) where {R}
     h, w = size(costs)
     V = h * w
     E = count_edges(h, w; acyclic)
@@ -23,7 +23,7 @@ function warcraft_grid_graph(costs::AbstractMatrix{R}; acyclic::Bool = false) wh
     sizehint!(destinations, E)
     sizehint!(weights, E)
 
-    for v1 = 1:V
+    for v1 in 1:V
         i1, j1 = index_to_coord(v1, h, w)
         for Δi in (-1, 0, 1), Δj in (-1, 0, 1)
             i2, j2 = i1 + Δi, j1 + Δj

test/WarcraftTest/grid_graph.jl

@@ -9,7 +9,7 @@ costs = rand(h, w)
 
 for acyclic in (true, false)
     @testset "Acyclic: $acyclic" begin
-        g = warcraft_grid_graph(costs; acyclic = acyclic)
+        g = warcraft_grid_graph(costs; acyclic=acyclic)
         @test nv(g) == h * w
         @test ne(g) == count_edges(h, w; acyclic)
         @test all(edges(g)) do e

test/runtests.jl

@@ -10,20 +10,14 @@ using Zygote
     @testset verbose = true "Formalities" begin
         @testset "Aqua" begin
             Aqua.test_all(
-                InferOptBenchmarks;
-                ambiguities = false,
-                deps_compat = (check_extras = false),
+                InferOptBenchmarks; ambiguities=false, deps_compat=(check_extras = false)
             )
         end
         @testset "JET" begin
-            JET.test_package(InferOptBenchmarks; target_defined_modules = true)
+            JET.test_package(InferOptBenchmarks; target_defined_modules=true)
         end
         @testset "JuliaFormatter" begin
-            @test JuliaFormatter.format(
-                InferOptBenchmarks;
-                verbose = false,
-                overwrite = false,
-            )
+            @test JuliaFormatter.format(InferOptBenchmarks; verbose=false, overwrite=false)
         end
         @testset "Documenter" begin
             Documenter.doctest(InferOptBenchmarks)