Format .jl files [skip ci] (#466)

Co-authored-by: jverzani <[email protected]>

Author: github-actions[bot]

src/Derivative/lith.jl

@@ -715,9 +715,7 @@ function lmm(::LithBoonkkampIJzerman{3,0}, xs, fs)
     (
         f0^2 * f1 * x2 - f0^2 * f2 * x1 - f0 * f1^2 * x2 + f0 * f2^2 * x1 + f1^2 * f2 * x0 -
         f1 * f2^2 * x0
-    ) / (
-        f0^2 * f1 - f0^2 * f2 - f0 * f1^2 + f0 * f2^2 + f1^2 * f2 - f1 * f2^2
-    ) |> float
+    ) / (f0^2 * f1 - f0^2 * f2 - f0 * f1^2 + f0 * f2^2 + f1^2 * f2 - f1 * f2^2) |> float
 end
 
 function lmm(::LithBoonkkampIJzerman{4,0}, xs, fs)

src/convergence.jl

@@ -235,7 +235,6 @@ function is_small_Δx(
     return δ ≤ Δₓ
 end
 
-
 isnan_x(M::AbstractBracketingMethod, state) = isnan(state.xn1) || isnan(state.xn0)
 isnan_x(M::AbstractNonBracketingMethod, state) = isnan(state.xn1)
 
@@ -357,7 +356,7 @@ function decide_convergence(
 
         # else
         return nan(T) * xn1
-#        return xn1
+        #        return xn1
     end
     val == :inf_nan && return xn1
 

src/find_zeros.jl

@@ -69,7 +69,7 @@ Base.show(io::IO, alpha::Interval) = print(io, "($(alpha.a), $(alpha.b))")
 # check if f(a) is non zero using tolerances max(atol, eps()), rtol
 function _non_zero(fa, a::T, atol, rtol) where {T}
     a, r = atol, abs(a) * rtol * oneunit(fa) / oneunit(a), oneunit(fa) * eps(T)
-    return abs(fa) >= max(promote(a,r)...)
+    return abs(fa) >= max(promote(a, r)...)
 end
 
 # After splitting by zeros we have intervals (zm, zn) this is used to shrink

src/simple.jl

@@ -113,7 +113,7 @@ function a42(f, ab; atol=nothing, rtol=nothing, λ=0.7, μ=0.5)
     assert_bracket(fa, fb)
 
     tols = (
-        λ    = λ,
+        λ   = λ,
         atol = isnothing(atol) ? zero(one(a)) : atol,
         rtol = isnothing(rtol) ? eps(one(a)) : rtol,
     )

src/trace.jl

@@ -143,10 +143,10 @@ end
 log_fncall(l::Tracks, i=1) = (l.fncalls += i; nothing)
 log_iteration(l::Tracks, n=1) = (l.steps += n; nothing)
 log_message(l::Tracks, msg) = (l.message *= msg; nothing)
-log_convergence(l::Tracks, msg) = (l.convergence_flag = msg; nothing)
-log_last(l::Tracks, α) = (l.alpha = α; nothing)
-log_method(l::Tracks, method) = (l.method = method; nothing)
-log_nmethod(l::Tracks, method) = (l.nmethod = method; nothing)
+log_convergence(l::Tracks, msg) = (l.convergence_flag=msg; nothing)
+log_last(l::Tracks, α) = (l.alpha=α; nothing)
+log_method(l::Tracks, method) = (l.method=method; nothing)
+log_nmethod(l::Tracks, method) = (l.nmethod=method; nothing)
 
 # copy some API from ValueHistories
 Base.first(l::AbstractTracks) = (@warn "No tracking information was kept"; nothing)

test/test_allocations.jl

@@ -94,7 +94,7 @@ import BenchmarkTools
     p = 2.0
     for M in Ms
         @test BenchmarkTools.@ballocated(solve(ZeroProblem($f, $x0), $M, $p)) == 0
-        @test BenchmarkTools.@ballocated(solve(ZeroProblem($f, $x0), $M; p=$p)) == 0
+        @test BenchmarkTools.@ballocated(solve(ZeroProblem($f, $x0), $M; p=($p))) == 0
     end
 
     # issue #423 type instability

test/test_find_zero.jl

@@ -41,7 +41,6 @@ struct Order3_Test <: Roots.AbstractSecantMethod end
         @test isnan(solve(ZeroProblem(x -> x^2 + 2, 0.5f0)))
     end
 
-
     ## defaults for method argument
     @test find_zero(sin, 3.0) ≈ pi    # order0()
     @test @inferred(find_zero(sin, (3, 4))) ≈ π   # Bisection()

test/test_newton.jl

@@ -89,11 +89,11 @@ end
 
 @testset "Lith Boonkkamp IJzerman methods" begin
     x₀, x̃₀, α = 1.0, 1.1, 1.1673039782614187
-    f(x, p=1)  = x^5 - x - p
-    fp(x)      = 5x^4 - 1
-    fpp(x)     = 20x^3
-    fppp(x)    = 60x
-    fpppp(x)   = 60
+    f(x, p=1) = x^5 - x - p
+    fp(x) = 5x^4 - 1
+    fpp(x) = 20x^3
+    fppp(x) = 60x
+    fpppp(x) = 60
 
     function fdf1(x, p=1)
         fx = f(x, p)