Run the formatter

Author: andreasnoack

.JuliaFormatter.toml

@@ -8,4 +8,4 @@ jobs:
     steps:
       - uses: julia-actions/julia-format@v3
         with:
-          version: '1' # Set `version` to '1.0.54' if you need to use JuliaFormatter.jl v1.0.54 (default: '1')
+          version: '2.1.1'

.github/workflows/format.yml

@@ -1,17 +1,20 @@
 using Documenter
 using GenericLinearAlgebra
 
-DocMeta.setdocmeta!(GenericLinearAlgebra, :DocTestSetup, :(using GenericLinearAlgebra, LinearAlgebra); recursive=true)
+DocMeta.setdocmeta!(
+    GenericLinearAlgebra,
+    :DocTestSetup,
+    :(using GenericLinearAlgebra, LinearAlgebra);
+    recursive = true,
+)
 
 makedocs(
     sitename = "GenericLinearAlgebra",
     format = Documenter.HTML(),
-    modules = [GenericLinearAlgebra]
+    modules = [GenericLinearAlgebra],
 )
 
 # Documenter can also automatically deploy documentation to gh-pages.
 # See "Hosting Documentation" and deploydocs() in the Documenter manual
 # for more information.
-deploydocs(
-    repo = "github.com/JuliaLinearAlgebra/GenericLinearAlgebra.jl.git"
-)
+deploydocs(repo = "github.com/JuliaLinearAlgebra/GenericLinearAlgebra.jl.git")

docs/make.jl

@@ -1,11 +1,35 @@
 module GenericLinearAlgebra
 
-using LinearAlgebra: LinearAlgebra,
-    Adjoint, Bidiagonal, Diagonal, Factorization, Givens, HermOrSym, Hermitian, I, LowerTriangular,
-    Rotation, SVD, SymTridiagonal, Symmetric, UnitLowerTriangular, UnitUpperTriangular,
+using LinearAlgebra:
+    LinearAlgebra,
+    Adjoint,
+    Bidiagonal,
+    Diagonal,
+    Factorization,
+    Givens,
+    HermOrSym,
+    Hermitian,
+    I,
+    LowerTriangular,
+    Rotation,
+    SVD,
+    SymTridiagonal,
+    Symmetric,
+    UnitLowerTriangular,
+    UnitUpperTriangular,
     UpperTriangular,
     BLAS,
-    abs2, axpy!, diag, dot, eigencopy_oftype, givens, ishermitian, mul!, rdiv!, tril, triu
+    abs2,
+    axpy!,
+    diag,
+    dot,
+    eigencopy_oftype,
+    givens,
+    ishermitian,
+    mul!,
+    rdiv!,
+    tril,
+    triu
 using LinearAlgebra.BLAS: BlasFloat, BlasReal
 
 include("juliaBLAS.jl")

src/GenericLinearAlgebra.jl

@@ -42,10 +42,10 @@ function cholRecursive!(A::StridedMatrix{T}, ::Type{Val{:L}}, cutoff = 1) where
         n2 = div(n, 2)
         A11 = view(A, 1:n2, 1:n2)
         cholRecursive!(A11, Val{:L})
-        A21 = view(A, n2+1:n, 1:n2)
+        A21 = view(A, (n2+1):n, 1:n2)
         rdiv!(A21, LowerTriangular(A11)')
 
-        A22 = view(A, n2+1:n, n2+1:n)
+        A22 = view(A, (n2+1):n, (n2+1):n)
         rankUpdate!(Hermitian(A22, :L), A21, -1)
         cholRecursive!(A22, Val{:L}, cutoff)
     end

src/cholesky.jl

@@ -14,7 +14,7 @@ Base.size(H::HessenbergMatrix, i::Integer) = size(H.data, i)
 function LinearAlgebra.ldiv!(H::HessenbergMatrix, B::AbstractVecOrMat)
     n = size(H, 1)
     Hd = H.data
-    for i = 1:n-1
+    for i = 1:(n-1)
         G, _ = givens(Hd, i, i + 1, i)
         lmul!(G, view(Hd, 1:n, i:n))
         lmul!(G, B)
@@ -35,13 +35,13 @@ Base.copy(HF::HessenbergFactorization{T,S,U}) where {T,S,U} =
 function _hessenberg!(A::StridedMatrix{T}) where {T}
     n = LinearAlgebra.checksquare(A)
     τ = Vector{Householder{T}}(undef, n - 1)
-    for i = 1:n-1
-        xi = view(A, i+1:n, i)
+    for i = 1:(n-1)
+        xi = view(A, (i+1):n, i)
         t = LinearAlgebra.reflector!(xi)
-        H = Householder{T,typeof(xi)}(view(xi, 2:n-i), t)
+        H = Householder{T,typeof(xi)}(view(xi, 2:(n-i)), t)
         τ[i] = H
-        lmul!(H', view(A, i+1:n, i+1:n))
-        rmul!(view(A, :, i+1:n), H)
+        lmul!(H', view(A, (i+1):n, (i+1):n))
+        rmul!(view(A, :, (i+1):n), H)
     end
     return HessenbergFactorization{T,typeof(A),eltype(τ)}(A, τ)
 end
@@ -96,7 +96,7 @@ function _schur!(
         end
 
         # Determine if the matrix splits. Find lowest positioned subdiagonal "zero"
-        for _istart = iend-1:-1:1
+        for _istart = (iend-1):-1:1
             if abs(HH[_istart+1, _istart]) <=
                tol * (abs(HH[_istart, _istart]) + abs(HH[_istart+1, _istart+1]))
                 # Check if subdiagonal element H[i+1,i] is "zero" such that we can split the matrix
@@ -183,17 +183,17 @@ function singleShiftQR!(
     end
     G, _ = givens(H11 - shift, H21, istart, istart + 1)
     lmul!(G, view(HH, :, istart:m))
-    rmul!(view(HH, 1:min(istart + 2, iend), :), G')
+    rmul!(view(HH, 1:min(istart+2, iend), :), G')
     lmul!(G, τ)
-    for i = istart:iend-2
+    for i = istart:(iend-2)
         G, _ = givens(HH[i+1, i], HH[i+2, i], i + 1, i + 2)
         lmul!(G, view(HH, :, i:m))
         HH[i+2, i] = Htmp
         if i < iend - 2
             Htmp = HH[i+3, i+1]
             HH[i+3, i+1] = 0
         end
-        rmul!(view(HH, 1:min(i + 3, iend), :), G')
+        rmul!(view(HH, 1:min(i+3, iend), :), G')
         # mul!(G, τ)
     end
     return HH
@@ -231,12 +231,12 @@ function doubleShiftQR!(
     vHH = view(HH, :, istart:m)
     lmul!(G1, vHH)
     lmul!(G2, vHH)
-    vHH = view(HH, 1:min(istart + 3, m), :)
+    vHH = view(HH, 1:min(istart+3, m), :)
     rmul!(vHH, G1')
     rmul!(vHH, G2')
     lmul!(G1, τ)
     lmul!(G2, τ)
-    for i = istart:iend-2
+    for i = istart:(iend-2)
         for j = 1:2
             if i + j + 1 > iend
                 break
@@ -254,7 +254,7 @@ function doubleShiftQR!(
                 Htmp22 = HH[i+4, i+j]
                 HH[i+4, i+j] = 0
             end
-            rmul!(view(HH, 1:min(i + j + 2, iend), :), G')
+            rmul!(view(HH, 1:min(i+j+2, iend), :), G')
             # mul!(G, τ)
         end
     end
@@ -333,5 +333,9 @@ function eigen!(
         return eigen!(Hermitian(A); sortby)
     end
 
-    throw(ArgumentError("eigen! for general matrices not yet supported. Consider using schur!"))
-end
+    throw(
+        ArgumentError(
+            "eigen! for general matrices not yet supported. Consider using schur!",
+        ),
+    )
+end