Merge pull request #259 from JuliaReach/auto-juliaformatter-pr

Automatic JuliaFormatter.jl run
JuliaReach · Sep 14, 2024 · dbec0aa · dbec0aa
2 parents 76bb7e0 + c47fc6f
commit dbec0aa
Show file tree

Hide file tree

Showing 3 changed files with 7 additions and 7 deletions.
diff --git a/src/operations/arithmetic.jl b/src/operations/arithmetic.jl
@@ -35,8 +35,8 @@
 \(M1::IntervalMatrix, M2::IntervalMatrix) = IntervalMatrix(M1.mat \ M2.mat)
 # COV_EXCL_START
 for T in (:AbstractMatrix, :Diagonal, :(Union{UpperTriangular,LowerTriangular}),
-    :(Union{UnitUpperTriangular,UnitLowerTriangular}), :SymTridiagonal, :Bidiagonal,
-    :(LinearAlgebra.HermOrSym), :(LinearAlgebra.AdjOrTrans{<:Any,<:Bidiagonal}))
+          :(Union{UnitUpperTriangular,UnitLowerTriangular}), :SymTridiagonal, :Bidiagonal,
+          :(LinearAlgebra.HermOrSym), :(LinearAlgebra.AdjOrTrans{<:Any,<:Bidiagonal}))
     @eval begin
         \(M1::IntervalMatrix, M2::$T) = IntervalMatrix(M1.mat \ M2)
         \(M1::$T, M2::IntervalMatrix) = IntervalMatrix(M1 \ M2.mat)

diff --git a/src/operations/mult.jl b/src/operations/mult.jl
@@ -38,8 +38,8 @@ function set_multiplication_mode(multype)
 
     # AbstractMatrix, incl. disambiguations
     for T in (:AbstractMatrix, :(LinearAlgebra.AbstractTriangular),
-              :(Transpose{T, <:AbstractVector} where T), :Diagonal,
-              :(LinearAlgebra.Adjoint{T, <:AbstractVector} where T))
+              :(Transpose{T,<:AbstractVector} where {T}), :Diagonal,
+              :(LinearAlgebra.Adjoint{T,<:AbstractVector} where {T}))
         @eval begin
             *(A::IntervalMatrix, B::$T) = *($type, A, B)
             *(A::$T, B::IntervalMatrix) = *($type, A, B)

diff --git a/test/intervals.jl b/test/intervals.jl
@@ -17,11 +17,11 @@ end
 
 @testset "Interval operation `intersect_interval`" begin
     x = interval(1, 3)
-    for y in (interval(2, 4), interval(2f0, 4f0))
+    for y in (interval(2, 4), interval(2.0f0, 4.0f0))
         @test intersect_interval(x, y) ⩵ interval(2, 3)
     end
     @test intersect_interval(x, x) ⩵ x
-    for y in (interval(4, 5), interval(4f0, 5f0))
+    for y in (interval(4, 5), interval(4.0f0, 5.0f0))
         @test intersect_interval(x, y) ⩵ emptyinterval(Float64)
     end
 end
@@ -47,5 +47,5 @@ end
 end
 
 @testset "Interval from a complex number" begin
-    @test interval(1+2im) isa Complex{Interval{Float64}}
+    @test interval(1 + 2im) isa Complex{Interval{Float64}}
 end