@@ -39,7 +39,7 @@ export quadratic_f, quadratic_f!, quadratic_f2, newton_fails, TERMINATION_CONDIT
3939
4040end
4141
42- @testitem " First Order Methods" setup= [RootfindingTesting] begin
42+ @testitem " First Order Methods" setup= [RootfindingTesting] tags = [ :core ] begin
4343 @testset " $(alg) " for alg in (SimpleNewtonRaphson, SimpleTrustRegion,
4444 (args... ; kwargs... ) -> SimpleTrustRegion (args... ; nlsolve_update_rule = Val (true ),
4545 kwargs... ))
7070 end
7171end
7272
73- @testitem " SimpleHalley" setup= [RootfindingTesting] begin
73+ @testitem " SimpleHalley" setup= [RootfindingTesting] tags = [ :core ] begin
7474 @testset " AutoDiff: $(nameof (typeof (autodiff))) " for autodiff in (AutoFiniteDiff (),
7575 AutoForwardDiff ())
7676 @testset " [OOP] u0: $(nameof (typeof (u0))) " for u0 in ([1.0 , 1.0 ],
8989 end
9090end
9191
92- @testitem " Derivative Free Metods" setup= [RootfindingTesting] begin
92+ @testitem " Derivative Free Metods" setup= [RootfindingTesting] tags = [ :core ] begin
9393 @testset " $(nameof (typeof (alg))) " for alg in [SimpleBroyden (), SimpleKlement (),
9494 SimpleDFSane (), SimpleLimitedMemoryBroyden (),
9595 SimpleBroyden (; linesearch = Val (true )),
115115 end
116116end
117117
118- @testitem " Newton Fails" setup= [RootfindingTesting] begin
118+ @testitem " Newton Fails" setup= [RootfindingTesting] tags = [ :core ] begin
119119 u0 = [- 10.0 , - 1.0 , 1.0 , 2.0 , 3.0 , 4.0 , 10.0 ]
120120 p = [0.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 ]
121121
@@ -127,13 +127,13 @@ end
127127 end
128128end
129129
130- @testitem " Kwargs Propagation" setup= [RootfindingTesting] begin
130+ @testitem " Kwargs Propagation" setup= [RootfindingTesting] tags = [ :core ] begin
131131 prob = NonlinearProblem (quadratic_f, ones (4 ), 2.0 ; maxiters = 2 )
132132 sol = solve (prob, SimpleNewtonRaphson ())
133133 @test sol. retcode === ReturnCode. MaxIters
134134end
135135
136- @testitem " Allocation Checks" setup= [RootfindingTesting] begin
136+ @testitem " Allocation Checks" setup= [RootfindingTesting] tags = [ :core ] begin
137137 if Sys. islinux () # Very slow on other OS
138138 @testset " $(nameof (typeof (alg))) " for alg in (SimpleNewtonRaphson (),
139139 SimpleHalley (), SimpleBroyden (), SimpleKlement (), SimpleLimitedMemoryBroyden (),
165165 end
166166end
167167
168- @testitem " Interval Nonlinear Problems" setup= [RootfindingTesting] begin
168+ @testitem " Interval Nonlinear Problems" setup= [RootfindingTesting] tags = [ :core ] begin
169169 @testset " $(nameof (typeof (alg))) " for alg in (Bisection (), Falsi (), Ridder (), Brent (),
170170 ITP (), Alefeld ())
171171 tspan = (1.0 , 20.0 )
209209 end
210210end
211211
212- @testitem " Tolerance Tests Interval Methods" setup= [RootfindingTesting] begin
212+ @testitem " Tolerance Tests Interval Methods" setup= [RootfindingTesting] tags = [ :core ] begin
213213 @testset " $(nameof (typeof (alg))) " for alg in (Bisection (), Falsi (), ITP ())
214214 tspan = (1.0 , 20.0 )
215215 probB = IntervalNonlinearProblem (quadratic_f, tspan, 2.0 )
224224 end
225225end
226226
227- @testitem " Tolerance Tests Interval Methods 2" setup= [RootfindingTesting] begin
227+ @testitem " Tolerance Tests Interval Methods 2" setup= [RootfindingTesting] tags = [ :core ] begin
228228 @testset " $(nameof (typeof (alg))) " for alg in (Ridder (), Brent ())
229229 tspan = (1.0 , 20.0 )
230230 probB = IntervalNonlinearProblem (quadratic_f, tspan, 2.0 )
239239 end
240240end
241241
242- @testitem " Flipped Signs and Reversed Tspan" setup= [RootfindingTesting] begin
242+ @testitem " Flipped Signs and Reversed Tspan" setup= [RootfindingTesting] tags = [ :core ] begin
243243 @testset " $(nameof (typeof (alg))) " for alg in (Alefeld (), Bisection (), Falsi (), Brent (),
244244 ITP (), Ridder ())
245245 f1 (u, p) = u * u - p
257257 end
258258 end
259259end
260-
261- # The following tests were included in the previos versions but these kwargs never did
262- # anything!
263- # # Garuntee Tests for Bisection
264- # f = function (u, p)
265- # if u < 2.0
266- # return u - 2.0
267- # elseif u > 3.0
268- # return u - 3.0
269- # else
270- # return 0.0
271- # end
272- # end
273- # probB = IntervalNonlinearProblem(f, (0.0, 4.0))
274-
275- # sol = solve(probB, Bisection(; exact_left = true))
276- # @test f(sol.left, nothing) < 0.0
277- # @test f(nextfloat(sol.left), nothing) >= 0.0
278-
279- # sol = solve(probB, Bisection(; exact_right = true))
280- # @test f(sol.right, nothing) >= 0.0
281- # @test f(prevfloat(sol.right), nothing) <= 0.0
282-
283- # sol = solve(probB, Bisection(; exact_left = true, exact_right = true); immutable = false)
284- # @test f(sol.left, nothing) < 0.0
285- # @test f(nextfloat(sol.left), nothing) >= 0.0
286- # @test f(sol.right, nothing) >= 0.0
287- # @test f(prevfloat(sol.right), nothing) <= 0.0
0 commit comments