make solve algorithms use __solve

jClugstor · ChrisRackauckas · commit e1025d238e05 · 2025-05-22T21:34:22.000Z
diff --git a/lib/BracketingNonlinearSolve/src/alefeld.jl b/lib/BracketingNonlinearSolve/src/alefeld.jl
@@ -8,7 +8,7 @@ algorithm 4.1 because, in certain sense, the second algorithm(4.2) is an optimal
 """
 struct Alefeld <: AbstractBracketingAlgorithm end
 
-function CommonSolve.solve(
+function SciMLBase.__solve(
         prob::IntervalNonlinearProblem, alg::Alefeld, args...;
         maxiters = 1000, abstol = nothing, kwargs...
 )
diff --git a/lib/BracketingNonlinearSolve/src/bisection.jl b/lib/BracketingNonlinearSolve/src/bisection.jl
@@ -19,7 +19,7 @@ A common bisection method.
     exact_right::Bool = false
 end
 
-function CommonSolve.solve(
+function SciMLBase.__solve(
         prob::IntervalNonlinearProblem, alg::Bisection, args...;
         maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...
 )
diff --git a/lib/BracketingNonlinearSolve/src/brent.jl b/lib/BracketingNonlinearSolve/src/brent.jl
@@ -5,7 +5,7 @@ Left non-allocating Brent method.
 """
 struct Brent <: AbstractBracketingAlgorithm end
 
-function CommonSolve.solve(
+function SciMLBase.__solve(
         prob::IntervalNonlinearProblem, alg::Brent, args...;
         maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...
 )
diff --git a/lib/BracketingNonlinearSolve/src/falsi.jl b/lib/BracketingNonlinearSolve/src/falsi.jl
@@ -5,7 +5,7 @@ A non-allocating regula falsi method.
 """
 struct Falsi <: AbstractBracketingAlgorithm end
 
-function CommonSolve.solve(
+function SciMLBase.__solve(
         prob::IntervalNonlinearProblem, alg::Falsi, args...;
         maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...
 )
diff --git a/lib/BracketingNonlinearSolve/src/itp.jl b/lib/BracketingNonlinearSolve/src/itp.jl
@@ -56,7 +56,7 @@ function ITP(; scaled_k1::Real = 0.2, k2::Real = 2, n0::Int = 10)
     return ITP(scaled_k1, k2, n0)
 end
 
-function CommonSolve.solve(
+function SciMLBase.__solve(
         prob::IntervalNonlinearProblem, alg::ITP, args...;
         maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...
 )
diff --git a/lib/BracketingNonlinearSolve/src/muller.jl b/lib/BracketingNonlinearSolve/src/muller.jl
@@ -27,7 +27,7 @@ end
 
 Muller() = Muller(nothing)
 
-function CommonSolve.solve(prob::IntervalNonlinearProblem, alg::Muller, args...;
+function SciMLBase.__solve(prob::IntervalNonlinearProblem, alg::Muller, args...;
         abstol = nothing, maxiters = 1000, kwargs...)
     @assert !SciMLBase.isinplace(prob) "`Muller` only supports out-of-place problems."
     xᵢ₋₂, xᵢ = prob.tspan
diff --git a/lib/BracketingNonlinearSolve/src/ridder.jl b/lib/BracketingNonlinearSolve/src/ridder.jl
@@ -5,7 +5,7 @@ A non-allocating ridder method.
 """
 struct Ridder <: AbstractBracketingAlgorithm end
 
-function CommonSolve.solve(
+function SciMLBase.__solve(
         prob::IntervalNonlinearProblem, alg::Ridder, args...;
         maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...
 )

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ algorithm 4.1 because, in certain sense, the second algorithm(4.2) is an optimal`
`8`	`8`	`"""`
`9`	`9`	`struct Alefeld <: AbstractBracketingAlgorithm end`
`10`	`10`
`11`		`-function CommonSolve.solve(`
	`11`	`+function SciMLBase.__solve(`
`12`	`12`	`prob::IntervalNonlinearProblem, alg::Alefeld, args...;`
`13`	`13`	`maxiters = 1000, abstol = nothing, kwargs...`
`14`	`14`	`)`
Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@ A common bisection method.`
`19`	`19`	`exact_right::Bool = false`
`20`	`20`	`end`
`21`	`21`
`22`		`-function CommonSolve.solve(`
	`22`	`+function SciMLBase.__solve(`
`23`	`23`	`prob::IntervalNonlinearProblem, alg::Bisection, args...;`
`24`	`24`	`maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...`
`25`	`25`	`)`
Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@ Left non-allocating Brent method.`
`5`	`5`	`"""`
`6`	`6`	`struct Brent <: AbstractBracketingAlgorithm end`
`7`	`7`
`8`		`-function CommonSolve.solve(`
	`8`	`+function SciMLBase.__solve(`
`9`	`9`	`prob::IntervalNonlinearProblem, alg::Brent, args...;`
`10`	`10`	`maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...`
`11`	`11`	`)`
Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@ A non-allocating regula falsi method.`
`5`	`5`	`"""`
`6`	`6`	`struct Falsi <: AbstractBracketingAlgorithm end`
`7`	`7`
`8`		`-function CommonSolve.solve(`
	`8`	`+function SciMLBase.__solve(`
`9`	`9`	`prob::IntervalNonlinearProblem, alg::Falsi, args...;`
`10`	`10`	`maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...`
`11`	`11`	`)`
Original file line number	Diff line number	Diff line change
`@@ -56,7 +56,7 @@ function ITP(; scaled_k1::Real = 0.2, k2::Real = 2, n0::Int = 10)`
`56`	`56`	`return ITP(scaled_k1, k2, n0)`
`57`	`57`	`end`
`58`	`58`
`59`		`-function CommonSolve.solve(`
	`59`	`+function SciMLBase.__solve(`
`60`	`60`	`prob::IntervalNonlinearProblem, alg::ITP, args...;`
`61`	`61`	`maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...`
`62`	`62`	`)`
Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@ A non-allocating ridder method.`
`5`	`5`	`"""`
`6`	`6`	`struct Ridder <: AbstractBracketingAlgorithm end`
`7`	`7`
`8`		`-function CommonSolve.solve(`
	`8`	`+function SciMLBase.__solve(`
`9`	`9`	`prob::IntervalNonlinearProblem, alg::Ridder, args...;`
`10`	`10`	`maxiters = 1000, abstol = nothing, verbose::Bool = true, kwargs...`
`11`	`11`	`)`