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

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

Author: github-actions[bot]

src/Bracketing/alefeld_potra_shi.jl

@@ -58,7 +58,6 @@ function init_state(::AbstractAlefeldPotraShi, F, x₀, x₁, fx₀, fx₁; c=no
     )
     assert_bracket(fa, fb)
 
-
     if a > b
         a, b, fa, fb = b, a, fb, fa
     end

src/Bracketing/bisection.jl

@@ -180,7 +180,7 @@ function solve!(
     log_step(l, M, state; init=true)
     T, S = TS(state)
     while !stopped
-        a::T, b::T   = state.xn0,  state.xn1
+        a::T, b::T   = state.xn0, state.xn1
         fa::S, fb::S = state.fxn0, state.fxn1
 
         ## assess_convergence

src/alternative_interfaces.jl

@@ -74,7 +74,6 @@ derivatives, respectively.
 
 Keyword arguments are passed to `find_zero` using the `Roots.QuadraticInverse()` method.
 
-
 """
 =#
 quadratic_inverse(f, fp, fpp, x0; kwargs...) =

src/chain_rules.jl

@@ -14,7 +14,6 @@
 # `Zygote.hessian_reverse` doesn't seem to work here, though perhaps
 # that is fixable.)
 
-
 # this assumes a function and a parameter `p` passed in
 import ChainRulesCore: Tangent, NoTangent, frule, rrule
 function ChainRulesCore.frule(
@@ -47,8 +46,7 @@ ChainRulesCore.frule(
     M::Roots.AbstractUnivariateZeroMethod,
     ::Nothing;
     kwargs...,
-) =
-    frule(config, xdots, solve, ZP, M; kwargs...)
+) = frule(config, xdots, solve, ZP, M; kwargs...)
 
 function ChainRulesCore.frule(
     config::ChainRulesCore.RuleConfig{>:ChainRulesCore.HasForwardsMode},
@@ -62,15 +60,19 @@ function ChainRulesCore.frule(
     foo = ZP.F
     zprob2 = ZeroProblem(|>, ZP.x₀)
     nms = fieldnames(typeof(foo))
-    nt = NamedTuple{nms}(getfield(foo, n) for n ∈ nms)
-    dfoo = Tangent{typeof(foo)}(;nt...)
-
-    return frule(config,
-                 (NoTangent(), NoTangent(), NoTangent(), dfoo),
-                 Roots.solve, zprob2, M, foo)
+    nt = NamedTuple{nms}(getfield(foo, n) for n in nms)
+    dfoo = Tangent{typeof(foo)}(; nt...)
+
+    return frule(
+        config,
+        (NoTangent(), NoTangent(), NoTangent(), dfoo),
+        Roots.solve,
+        zprob2,
+        M,
+        foo,
+    )
 end
 
-
 ##
 
 ## modified from
@@ -112,9 +114,7 @@ ChainRulesCore.rrule(
     M::Roots.AbstractUnivariateZeroMethod,
     ::Nothing;
     kwargs...,
-) =
-    ChainRulesCore.rrule(rc, solve, ZP, M; kwargs...)
-
+) = ChainRulesCore.rrule(rc, solve, ZP, M; kwargs...)
 
 function ChainRulesCore.rrule(
     rc::ChainRulesCore.RuleConfig{>:ChainRulesCore.HasReverseMode},
@@ -123,24 +123,19 @@ function ChainRulesCore.rrule(
     M::Roots.AbstractUnivariateZeroMethod;
     kwargs...,
 )
-
-
     𝑍𝑃 = ZeroProblem(|>, ZP.x₀)
     xᵅ = solve(ZP, M; kwargs...)
     f(x, p) = first(Roots.Callable_Function(M, 𝑍𝑃.F, p)(x))
 
     _, pullback_f = ChainRulesCore.rrule_via_ad(rc, f, xᵅ, ZP.F)
     _, fx, fp = pullback_f(true)
 
-    yp = NamedTuple{keys(fp)}(-fₚ/fx for fₚ ∈ values(fp))
+    yp = NamedTuple{keys(fp)}(-fₚ / fx for fₚ in values(fp))
 
     function pullback_solve_ZeroProblem(dy)
         dF = ChainRulesCore.Tangent{typeof(ZP.F)}(; yp...)
 
-        dZP = ChainRulesCore.Tangent{typeof(ZP)}(;
-                                                 F = dF,
-                                                 x₀ = ChainRulesCore.NoTangent()
-                                                 )
+        dZP = ChainRulesCore.Tangent{typeof(ZP)}(; F=dF, x₀=ChainRulesCore.NoTangent())
 
         dsolve = ChainRulesCore.NoTangent()
         dM = ChainRulesCore.NoTangent()

test/test_bracketing.jl

@@ -311,8 +311,8 @@ end
 
     ## issue 412 check for bracket
     f = x -> x - 1
-    for M ∈ Ms
-        @test_throws ArgumentError find_zero(f, (-3,0), M)
+    for M in Ms
+        @test_throws ArgumentError find_zero(f, (-3, 0), M)
     end
 end
 

test/test_chain_rules.jl

@@ -8,9 +8,8 @@ struct 𝐺
     p
 end
 (g::𝐺)(x) = cos(x) - g.p * x
-G₃(p) = find_zero(𝐺(p), (0, pi/2), Bisection())
-F₃(p) = find_zero((x,p) -> cos(x) - p*x, (0, pi/2), Bisection(), p)
-
+G₃(p) = find_zero(𝐺(p), (0, pi / 2), Bisection())
+F₃(p) = find_zero((x, p) -> cos(x) - p * x, (0, pi / 2), Bisection(), p)
 
 @testset "Test frule and rrule" begin
     # Type inference tests of `test_frule` and `test_rrule` with the default
@@ -79,7 +78,8 @@ F₃(p) = find_zero((x,p) -> cos(x) - p*x, (0, pi/2), Bisection(), p)
     x = rand()
     @test first(Zygote.gradient(F₃, x)) ≈ first(Zygote.gradient(G₃, x))
     # ForwardDiff extension makes this fail.
-    VERSION >= v"1.9.0" && @test_broken first(Zygote.hessian(F₃, x)) ≈ first(Zygote.hessian(G₃, x))
+    VERSION >= v"1.9.0" &&
+        @test_broken first(Zygote.hessian(F₃, x)) ≈ first(Zygote.hessian(G₃, x))
     # test_frule, test_rrule aren't successful
     #=
     # DimensionMismatch: arrays could not be broadcast to a common size; got a dimension with lengths 3 and 2

test/test_extensions.jl

@@ -51,7 +51,7 @@ using ForwardDiff
     f = (x, p) -> x^2 - p
     Z = ZeroProblem(f, (0, 1000))
     F = p -> solve(Z, Roots.Bisection(), p)
-    for p ∈ (3, 5, 7, 11)
+    for p in (3, 5, 7, 11)
         @test F(p) ≈ sqrt(p)
         @test ForwardDiff.derivative(F, p) ≈ 1 / (2sqrt(p))
     end
@@ -62,7 +62,7 @@ using ForwardDiff
     F = p -> solve(Z, Roots.Bisection(), p)
     Z = ZeroProblem(f, (0, 1000))
     F = p -> solve(Z, Roots.Bisection(), p)
-    for p ∈ ([1,2], [1,3], [1,4])
+    for p in ([1, 2], [1, 3], [1, 4])
         @test F(p) ≈ sqrt(sum(p .^ 2))
         a, b = p
         n = sqrt(a^2 + b^2)^3

test/test_find_zero.jl

@@ -122,10 +122,9 @@ struct Order3_Test <: Roots.AbstractSecantMethod end
     # test issue when non type stalbe
     h(x) = x < 2000 ? -1000 : -1000 + 0.1 * (x - 2000)
     a, b, xᵅ = 0, 20_000, 12_000
-    for M ∈ bracketing_meths
+    for M in bracketing_meths
         @test find_zero(h, (a, b), M) ≈ xᵅ
     end
-
 end
 
 @testset "non simple zeros" begin