chore: add check_format.yml (#217)

* style: use proper formatting

* chore: add `check_format.yml`

* fix: format new code

* style: mark end of the document

Co-authored-by: David Leal <[email protected]>

* chore: use julia 1.9

Co-authored-by: David Leal <[email protected]>

---------

Co-authored-by: David Leal <[email protected]>

Author: vil02

.github/workflows/check_format.yml

@@ -0,0 +1,40 @@
+---
+name: check_format
+
+# yamllint disable-line rule:truthy
+on:
+  workflow_dispatch:
+  push:
+    branches:
+      - main
+  pull_request:
+
+jobs:
+  check_format:
+    name: Check format
+    runs-on: ubuntu-latest
+    steps:
+      - uses: julia-actions/setup-julia@v1
+        with:
+          version: 1.9
+      - uses: actions/checkout@v4
+        with:
+          fetch-depth: 0
+
+      - name: Install JuliaFormatter
+        run: |
+          julia  -e 'using Pkg; Pkg.add(PackageSpec(name="JuliaFormatter"))'
+
+      - name: Format code
+        run: |
+          git clean -f -x -d
+          julia  -e 'using JuliaFormatter; format(".", verbose=true)'
+
+      - name: Fail if needs reformatting
+        run: |
+          if [[ $(git status --porcelain) ]]; then
+              echo "please reformat these files:"
+              git status --porcelain=v1
+              exit 1
+          fi
+...

src/cipher/vigenere.jl

@@ -1,6 +1,5 @@
 LETTERS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
 
-
 """
     encrypt_vigenere(text, key)
 
@@ -27,16 +26,16 @@ function encrypt_vigenere(text::String, key::String)::String
             num += findfirst(isequal(key[key_index]), LETTERS) - 1
             num %= length(LETTERS)
             num = num == 0 ? 26 : num
-            encrypted *= isuppercase(symbol) ? LETTERS[num] : lowercase(LETTERS[num])
+            encrypted *=
+                isuppercase(symbol) ? LETTERS[num] : lowercase(LETTERS[num])
             key_index = key_index == length(key) ? 1 : key_index + 1
         else
             encrypted *= symbol
         end
     end
-    encrypted
+    return encrypted
 end
 
-
 """
     decrypt_vigenere(text, key)
 
@@ -63,13 +62,14 @@ function decrypt_vigenere(text::String, key::String)::String
             num -= findfirst(isequal(key[key_index]), LETTERS) - 1
             num %= length(LETTERS)
             num = num <= 0 ? num + length(LETTERS) : num
-            decrypted *= isuppercase(symbol) ? LETTERS[num] : lowercase(LETTERS[num])
+            decrypted *=
+                isuppercase(symbol) ? LETTERS[num] : lowercase(LETTERS[num])
             key_index = key_index == length(key) ? 1 : key_index + 1
         else
             decrypted *= symbol
         end
     end
-    decrypted
+    return decrypted
 end
 
-println(encrypt_vigenere("QUICKBROWNFOX", "LAZYDOG"))
+println(encrypt_vigenere("QUICKBROWNFOX", "LAZYDOG"))

src/longest_increasing_subsequence/binary_search.jl

@@ -23,7 +23,7 @@ https://cp-algorithms.com/sequences/longest_increasing_subsequence.html
 - [Igor Malheiros](https://github.com/igormalheiros)
 """
 
-function lis(arr::Array{T}, ::Val{:bs}) where T <: Integer
+function lis(arr::Array{T}, ::Val{:bs}) where {T<:Integer}
     len = length(arr)
     memo = ones(T, len)
     p = ones(Int, len)

src/longest_increasing_subsequence/dynamic_programming.jl

@@ -23,7 +23,7 @@ https://cp-algorithms.com/sequences/longest_increasing_subsequence.html
 - [Igor Malheiros](https://github.com/igormalheiros)
 """
 
-function lis(arr::Array{T}, ::Val{:dp}) where T <: Integer
+function lis(arr::Array{T}, ::Val{:dp}) where {T<:Integer}
     len = length(arr)
     memo = ones(Int, len)
     p = zeros(Int, len)

src/math/runge_kutta_integration.jl

@@ -58,19 +58,25 @@ julia> exp.([0.0, 0.1])
 # Contributors:
 - [E-W-Jones](https://github.com/E-W-Jones)
 """
-function runge_kutta_integration(f::Function, x0::Real, y0::Real, h::Real, x_stop::Real)
+function runge_kutta_integration(
+    f::Function,
+    x0::Real,
+    y0::Real,
+    h::Real,
+    x_stop::Real,
+)
     h > 0 || throw(DomainError(h, "The step size `h` should be >0."))
 
     x = Float64(x0)
     y = Float64(y0)
     output_x = [x]
     output_y = [y]
-    
+
     while x < x_stop
         k1 = f(x, y)
-        k2 = f(x + h/2, y + k1*h/2)
-        k3 = f(x + h/2, y + k2*h/2)
-        k4 = f(x + h  , y + k3*h  )
+        k2 = f(x + h / 2, y + k1 * h / 2)
+        k3 = f(x + h / 2, y + k2 * h / 2)
+        k4 = f(x + h, y + k3 * h)
 
         y += h * (k1 + 2k2 + 2k3 + k4) / 6
         x += h
@@ -80,4 +86,4 @@ function runge_kutta_integration(f::Function, x0::Real, y0::Real, h::Real, x_sto
     end
 
     return output_x, output_y
-end
+end

src/sorts/heap_sort.jl

@@ -30,7 +30,7 @@ After the largest element has been extracted, the tree is updated to maintain th
 function heap_sort!(arr::Vector{T}, gt = >, N::Int = length(arr)) where {T}
     if isempty(arr)
         return
-    end 
+    end
     n = N
     i = div(n, 2)
     t = -1

src/strings/naive_pattern_search.jl

@@ -26,10 +26,10 @@ julia> naive_pattern_search("Hello world!", "eggs")
 """
 
 function naive_pattern_search(text, pattern)
-    for index in 0:(length(text)-length(pattern) + 1)
+    for index in 0:(length(text)-length(pattern)+1)
         matches = 0
         for character in eachindex(pattern)
-            if pattern[character] == text[index + character]
+            if pattern[character] == text[index+character]
                 matches += 1
 
                 if matches == length(pattern)

test/basic.jl

@@ -5,7 +5,7 @@ using TheAlgorithms.Basic
         @test Basic.prefix_sum([1, 1, 1]) == [1, 2, 3]
         @test Basic.prefix_sum([1, 2, 3]) == [1, 3, 6]
         @test Basic.prefix_sum(BigInt[]) == BigInt[]
-        @test Basic.prefix_sum([0., 0., 0.]) == [0., 0., 0.]
+        @test Basic.prefix_sum([0.0, 0.0, 0.0]) == [0.0, 0.0, 0.0]
         @test Basic.prefix_sum([1 + 2im, 2 - 3im]) == [1 + 2im, 3 - 1im]
     end
 

test/graph.jl

@@ -43,28 +43,14 @@ using TheAlgorithms.Graph
     end
 
     @testset "bfs" begin
-        graph = [
-            [2, 3, 6],
-            [3, 4],
-            [4],
-            [1, 2, 5],
-            [2],
-            [1, 5]
-        ]
+        graph = [[2, 3, 6], [3, 4], [4], [1, 2, 5], [2], [1, 5]]
 
         @test bfs(graph, 4) == [4, 1, 2, 5, 3, 6]
         @test bfs(graph) == [1, 2, 3, 6, 4, 5]
     end
 
     @testset "dfs" begin
-        graph = [
-            [2, 3, 6],
-            [3, 4],
-            [4],
-            [1, 2, 5],
-            [2],
-            [1, 5]
-        ]
+        graph = [[2, 3, 6], [3, 4], [4], [1, 2, 5], [2], [1, 5]]
 
         @test dfs(graph, 6) == [6, 5, 2, 4, 3, 1]
         @test dfs(graph) == [1, 6, 5, 3, 4, 2]

test/longest_increasing_subsequence.jl

@@ -22,7 +22,19 @@ using TheAlgorithms.LongSubSeq
         # Boolean array
         @test lis([true, false, false, true], Val(:dp)) == [false, true]
         # other Integer subtypes
-        for T in [UInt128, UInt16, UInt32, UInt64, UInt8, BigInt, Int128, Int16, Int32, Int64, Int8]
+        for T in [
+            UInt128,
+            UInt16,
+            UInt32,
+            UInt64,
+            UInt8,
+            BigInt,
+            Int128,
+            Int16,
+            Int32,
+            Int64,
+            Int8,
+        ]
             @test lis(T[3, 10, 2, 1, 20], Val(:dp)) == T[3, 10, 20]
         end
     end
@@ -48,7 +60,19 @@ using TheAlgorithms.LongSubSeq
         # Boolean array
         @test lis([true, false, false, true], Val(:bs)) == [false, true]
         # other Integer subtypes
-        for T in [UInt128, UInt16, UInt32, UInt64, UInt8, BigInt, Int128, Int16, Int32, Int64, Int8]
+        for T in [
+            UInt128,
+            UInt16,
+            UInt32,
+            UInt64,
+            UInt8,
+            BigInt,
+            Int128,
+            Int16,
+            Int32,
+            Int64,
+            Int8,
+        ]
             @test lis(T[3, 10, 2, 1, 20], Val(:bs)) == T[3, 10, 20]
         end
     end