CI keep the developing scripts

ErikQQY · ErikQQY · commit edc27f02d308 · 2025-04-07T02:46:19.000+08:00
diff --git a/.github/workflows/CI_BracketingNonlinearSolve.yml b/.github/workflows/CI_BracketingNonlinearSolve.yml
@@ -52,7 +52,7 @@ jobs:
           Pkg.Registry.update()
           # Install packages present in subdirectories
           dev_pks = Pkg.PackageSpec[]
-          for path in ("lib/SciMLJacobianOperators",)
+          for path in ("lib/NonlinearSolveBase", "lib/SciMLJacobianOperators")
               push!(dev_pks, Pkg.PackageSpec(; path))
           end
           Pkg.develop(dev_pks)
diff --git a/.github/workflows/CI_NonlinearSolve.yml b/.github/workflows/CI_NonlinearSolve.yml
@@ -65,7 +65,7 @@ jobs:
           Pkg.Registry.update()
           # Install packages present in subdirectories
           dev_pks = Pkg.PackageSpec[]
-          for path in ("lib/SciMLJacobianOperators",)
+          for path in ("lib/SciMLJacobianOperators", "lib/BracketingNonlinearSolve", "lib/NonlinearSolveBase", "lib/SimpleNonlinearSolve", "lib/NonlinearSolveFirstOrder", "lib/NonlinearSolveSpectralMethods", "lib/NonlinearSolveQuasiNewton")
               push!(dev_pks, Pkg.PackageSpec(; path))
           end
           Pkg.develop(dev_pks)
diff --git a/.github/workflows/CI_NonlinearSolveFirstOrder.yml b/.github/workflows/CI_NonlinearSolveFirstOrder.yml
@@ -52,7 +52,7 @@ jobs:
           Pkg.Registry.update()
           # Install packages present in subdirectories
           dev_pks = Pkg.PackageSpec[]
-          for path in ("lib/SciMLJacobianOperators",)
+          for path in ("lib/SciMLJacobianOperators", "lib/NonlinearSolveBase")
               push!(dev_pks, Pkg.PackageSpec(; path))
           end
           Pkg.develop(dev_pks)
diff --git a/.github/workflows/CI_NonlinearSolveHomotopyContinuation.yml b/.github/workflows/CI_NonlinearSolveHomotopyContinuation.yml
@@ -49,6 +49,12 @@ jobs:
         run: |
           import Pkg
           Pkg.Registry.update()
+          # Install packages present in subdirectories
+          dev_pks = Pkg.PackageSpec[]
+          for path in ("lib/NonlinearSolveBase",)
+              push!(dev_pks, Pkg.PackageSpec(; path))
+          end
+          Pkg.develop(dev_pks)
           Pkg.instantiate()
           Pkg.test(; coverage="user")
         shell: julia --color=yes --code-coverage=user --depwarn=yes --project=lib/NonlinearSolveHomotopyContinuation {0}
diff --git a/.github/workflows/CI_NonlinearSolveQuasiNewton.yml b/.github/workflows/CI_NonlinearSolveQuasiNewton.yml
@@ -52,7 +52,7 @@ jobs:
           Pkg.Registry.update()
           # Install packages present in subdirectories
           dev_pks = Pkg.PackageSpec[]
-          for path in ("lib/SciMLJacobianOperators",)
+          for path in ("lib/SciMLJacobianOperators", "lib/NonlinearSolveBase")
               push!(dev_pks, Pkg.PackageSpec(; path))
           end
           Pkg.develop(dev_pks)
diff --git a/.github/workflows/CI_NonlinearSolveSpectralMethods.yml b/.github/workflows/CI_NonlinearSolveSpectralMethods.yml
@@ -52,7 +52,7 @@ jobs:
           Pkg.Registry.update()
           # Install packages present in subdirectories
           dev_pks = Pkg.PackageSpec[]
-          for path in ("lib/SciMLJacobianOperators",)
+          for path in ("lib/SciMLJacobianOperators", "lib/NonlinearSolveBase")
               push!(dev_pks, Pkg.PackageSpec(; path))
           end
           Pkg.develop(dev_pks)
diff --git a/.github/workflows/CI_SimpleNonlinearSolve.yml b/.github/workflows/CI_SimpleNonlinearSolve.yml
@@ -57,7 +57,7 @@ jobs:
           Pkg.Registry.update()
           # Install packages present in subdirectories
           dev_pks = Pkg.PackageSpec[]
-          for path in ("lib/SciMLJacobianOperators",)
+          for path in ("lib/NonlinearSolveBase", "lib/BracketingNonlinearSolve", "lib/SciMLJacobianOperators")
               push!(dev_pks, Pkg.PackageSpec(; path))
           end
           Pkg.develop(dev_pks)
diff --git a/lib/BracketingNonlinearSolve/src/muller.jl b/lib/BracketingNonlinearSolve/src/muller.jl
@@ -8,8 +8,8 @@ initial guesses `(left, middle, right)` for the root.
 
 ### Keyword Arguments
 
-- `middle`: the initial guess for the middle point. If not provided, the
-  midpoint of the interval `(left, right)` is used.
+  - `middle`: the initial guess for the middle point. If not provided, the
+    midpoint of the interval `(left, right)` is used.
 """
 struct Muller{T} <: AbstractBracketingAlgorithm
     middle::T
@@ -18,7 +18,7 @@ end
 Muller() = Muller(nothing)
 
 function CommonSolve.solve(prob::IntervalNonlinearProblem, alg::Muller, args...;
-    abstol = nothing, maxiters = 1000, kwargs...)
+        abstol = nothing, maxiters = 1000, kwargs...)
     @assert !SciMLBase.isinplace(prob) "`Muller` only supports out-of-place problems."
     xᵢ₋₂, xᵢ = prob.tspan
     xᵢ₋₁ = isnothing(alg.middle) ? (xᵢ₋₂ + xᵢ) / 2 : alg.middle
@@ -32,35 +32,35 @@ function CommonSolve.solve(prob::IntervalNonlinearProblem, alg::Muller, args...;
     abstol = abs(NonlinearSolveBase.get_tolerance(
         xᵢ₋₂, abstol, promote_type(eltype(xᵢ₋₂), eltype(xᵢ))))
 
-    for _ ∈ 1:maxiters
-        q = (xᵢ - xᵢ₋₁)/(xᵢ₋₁ - xᵢ₋₂)
-        A = q*fxᵢ - q*(1 + q)*fxᵢ₋₁ + q^2*fxᵢ₋₂
-        B = (2*q + 1)*fxᵢ - (1 + q)^2*fxᵢ₋₁ + q^2*fxᵢ₋₂
-        C = (1 + q)*fxᵢ
+    for _ in 1:maxiters
+        q = (xᵢ - xᵢ₋₁) / (xᵢ₋₁ - xᵢ₋₂)
+        A = q * fxᵢ - q * (1 + q) * fxᵢ₋₁ + q^2 * fxᵢ₋₂
+        B = (2 * q + 1) * fxᵢ - (1 + q)^2 * fxᵢ₋₁ + q^2 * fxᵢ₋₂
+        C = (1 + q) * fxᵢ
 
-        denom₊ = B + √(B^2 - 4*A*C)
-        denom₋ = B - √(B^2 - 4*A*C)
+        denom₊ = B + √(B^2 - 4 * A * C)
+        denom₋ = B - √(B^2 - 4 * A * C)
 
         if abs(denom₊) ≥ abs(denom₋)
-            xᵢ₊₁ = xᵢ - (xᵢ - xᵢ₋₁)*2*C/denom₊
+            xᵢ₊₁ = xᵢ - (xᵢ - xᵢ₋₁) * 2 * C / denom₊
         else
-            xᵢ₊₁ = xᵢ - (xᵢ - xᵢ₋₁)*2*C/denom₋
+            xᵢ₊₁ = xᵢ - (xᵢ - xᵢ₋₁) * 2 * C / denom₋
         end
 
         fxᵢ₊₁ = f(xᵢ₊₁)
 
         # Termination Check
         if abstol ≥ abs(fxᵢ₊₁)
             return SciMLBase.build_solution(prob, alg, xᵢ₊₁, fxᵢ₊₁;
-                                            retcode = ReturnCode.Success,
-                                            left = xᵢ₊₁, right = xᵢ₊₁)
+                retcode = ReturnCode.Success,
+                left = xᵢ₊₁, right = xᵢ₊₁)
         end
 
         xᵢ₋₂, xᵢ₋₁, xᵢ = xᵢ₋₁, xᵢ, xᵢ₊₁
         fxᵢ₋₂, fxᵢ₋₁, fxᵢ = fxᵢ₋₁, fxᵢ, fxᵢ₊₁
     end
 
     return SciMLBase.build_solution(prob, alg, xᵢ₊₁, fxᵢ₊₁;
-                                    retcode = ReturnCode.MaxIters,
-                                    left = xᵢ₊₁, right = xᵢ₊₁)
+        retcode = ReturnCode.MaxIters,
+        left = xᵢ₊₁, right = xᵢ₊₁)
 end
diff --git a/lib/BracketingNonlinearSolve/test/muller_tests.jl b/lib/BracketingNonlinearSolve/test/muller_tests.jl
@@ -1,7 +1,7 @@
 @testitem "Muller" begin
     f(u, p) = u^2 - p
     g(u, p) = sin(u)
-    h(u, p) = exp(-u)*sin(u)
+    h(u, p) = exp(-u) * sin(u)
     i(u, p) = u^3 - 1
 
     @testset "Quadratic function" begin
@@ -30,7 +30,7 @@
         prob = IntervalNonlinearProblem{false}(g, tspan)
         sol = solve(prob, Muller())
 
-        @test sol.u ≈ 2*π
+        @test sol.u ≈ 2 * π
     end
 
     @testset "Exponential-sine function" begin
@@ -44,7 +44,7 @@
         prob = IntervalNonlinearProblem{false}(h, tspan)
         sol = solve(prob, Muller())
 
-        @test sol.u ≈ 0 atol = 1e-15
+        @test sol.u≈0 atol=1e-15
 
         tspan = (-1.0, 1.0)
         prob = IntervalNonlinearProblem{false}(h, tspan)
@@ -54,17 +54,17 @@
     end
 
     @testset "Complex roots" begin
-        tspan = (-1.0, 1.0*im)
+        tspan = (-1.0, 1.0 * im)
         prob = IntervalNonlinearProblem{false}(i, tspan)
         sol = solve(prob, Muller())
 
-        @test sol.u ≈ (-1 + √3*im)/2
+        @test sol.u ≈ (-1 + √3 * im) / 2
 
-        tspan = (-1.0, -1.0*im)
+        tspan = (-1.0, -1.0 * im)
         prob = IntervalNonlinearProblem{false}(i, tspan)
         sol = solve(prob, Muller())
 
-        @test sol.u ≈ (-1 - √3*im)/2
+        @test sol.u ≈ (-1 - √3 * im) / 2
     end
 
     @testset "Middle" begin
@@ -87,10 +87,10 @@
 
         @test sol.u ≈ -π
 
-        tspan = (-1.0, 1.0*im)
+        tspan = (-1.0, 1.0 * im)
         prob = IntervalNonlinearProblem{false}(i, tspan)
         sol = solve(prob, Muller(0.0))
 
-        @test sol.u ≈ (-1 + √3*im)/2
+        @test sol.u ≈ (-1 + √3 * im) / 2
     end
 end
diff --git a/lib/BracketingNonlinearSolve/test/rootfind_tests.jl b/lib/BracketingNonlinearSolve/test/rootfind_tests.jl
@@ -7,7 +7,8 @@ end
 @testitem "Interval Nonlinear Problems" setup=[RootfindingTestSnippet] tags=[:core] begin
     using ForwardDiff
 
-    @testset for alg in (Alefeld(), Bisection(), Brent(), Falsi(), ITP(), Muller(), Ridder(), nothing)
+    @testset for alg in (
+        Alefeld(), Bisection(), Brent(), Falsi(), ITP(), Muller(), Ridder(), nothing)
         tspan = (1.0, 20.0)
 
         function g(p)
@@ -76,7 +77,8 @@ end
 end
 
 @testitem "Flipped Signs and Reversed Tspan" setup=[RootfindingTestSnippet] tags=[:core] begin
-    @testset for alg in (Alefeld(), Bisection(), Brent(), Falsi(), ITP(), Muller(), Ridder(), nothing)
+    @testset for alg in (
+        Alefeld(), Bisection(), Brent(), Falsi(), ITP(), Muller(), Ridder(), nothing)
         f1(u, p) = u * u - p
         f2(u, p) = p - u * u
 
diff --git a/lib/SimpleNonlinearSolve/test/core/forward_diff_tests.jl b/lib/SimpleNonlinearSolve/test/core/forward_diff_tests.jl
@@ -14,7 +14,7 @@
     jacobian_f(u, p::Number) = one.(u) .* (1 / (2 * √p))
     jacobian_f(u, p::AbstractArray) = diagm(vec(@. 1 / (2 * √p)))
 
-    @testset "#(nameof(typeof(alg)))" for alg in (
+    @testset "$(nameof(typeof(alg)))" for alg in (
         SimpleNewtonRaphson(),
         SimpleTrustRegion(),
         SimpleTrustRegion(; nlsolve_update_rule = Val(true)),
