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

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

Author: github-actions[bot]

src/convergence.jl

@@ -200,17 +200,18 @@ function iszero_Δx(
 end
 
 # test when fconverged to ensure not runawa
-function is_small_Δx(M::AbstractUnivariateZeroMethod,
-                     state::AbstractUnivariateZeroState,
-                     options)
+function is_small_Δx(
+    M::AbstractUnivariateZeroMethod,
+    state::AbstractUnivariateZeroState,
+    options,
+)
     δ = abs(state.xn1 - state.xn0)
     δₐ, δᵣ = options.xabstol, options.xreltol
     Δₓ = max(_unitless(δₐ), _unitless(abs(state.xn1)) * δᵣ)
     Δₓ = sqrt(sqrt(sqrt((abs(_unitless(Δₓ)))))) # faster than x^(1/8)
     return δ ≤ Δₓ
 end
 
-
 isnan_f(M::AbstractBracketingMethod, state) = isnan(state.fxn1) || isnan(state.fxn0)
 isnan_f(M::AbstractNonBracketingMethod, state) = isnan(state.fxn1)
 
@@ -313,7 +314,8 @@ function decide_convergence(
             # this is the case where runaway can happen
             ## XXX Need a good heuristic to catch that
             is_approx_zero_f(M, state, options, :relaxed) &&
-                is_small_Δx(M, state, options) && return xn1
+                is_small_Δx(M, state, options) &&
+                return xn1
         end
     end
 

src/find_zeros.jl

@@ -107,7 +107,7 @@ end
 
 # adjust what we mean by x1 ~ x2 for purposes of adding a new zero
 function approx_close(z1, z2, xatol, xrtol)
-    z₁,z₂,δ,ϵ = _unitless.((z1, z2, xatol, xrtol))
+    z₁, z₂, δ, ϵ = _unitless.((z1, z2, xatol, xrtol))
     return isapprox(z₁, z₂; atol=sqrt(δ), rtol=sqrt(ϵ))
 end
 

test/test_composable.jl

@@ -42,7 +42,7 @@ using ForwardDiff
         @test xrts[1] ≈ 1.886053370668014s
 
         # issue #434
-        xzs1=find_zeros(x -> cos(x / 1u"m"), -1.6u"m",2u"m")
+        xzs1 = find_zeros(x -> cos(x / 1u"m"), -1.6u"m", 2u"m")
         @test length(xzs1) == 2 && maximum(xzs1) ≈ 1.5707963267948966 * u"m"
     end