mark SDPA tests as broken on v1.10

src/algorithms.jl

@@ -126,6 +126,7 @@ Base.@kwdef struct TaylorModelsEnclosure <: AbstractDirectRangeAlgorithm
     normalize::Bool = true
 end
 
+# TODO turn example below into doctest when SDPA works again
 """
     SumOfSquaresEnclosure{T} <: AbstractIterativeRangeAlgorithm
 
@@ -147,7 +148,7 @@ result of this algorithm is not rigorous.
 
 ### Examples
 
-```jldoctest
+```example
 julia> using SumOfSquares, SDPA, DynamicPolynomials
 
 julia> backend = SDPA.Optimizer;

test/multivariate.jl

@@ -36,8 +36,8 @@ end
     # Note: DynamicPolynomials automatically expands p, and evaluation using
     # interval arithmetic gives a worse left bound than the factored expression.
 
-    if Sys.iswindows()
-        # SDPA is broken on Windows
+    if Sys.iswindows() || VERSION >= v"1.10"
+        # SDPA is broken on Windows or v1.10
         @test_broken begin
             x = enclose(p, dom, SumOfSquaresEnclosure(; backend=SDPA.Optimizer))
             isapprox(inf(x), 0.0; atol=1e-3)

test/runtests.jl

@@ -1,7 +1,8 @@
 using Test, RangeEnclosures
 using AffineArithmetic, IntervalOptimisation, TaylorModels, SumOfSquares
 
-@static if Sys.iswindows()
+@static if Sys.iswindows() || VERSION >= v"1.10"
+    # SDPA is broken on Windows or v1.10
     @test_broken using SDPA
 else
     using SDPA

test/univariate.jl

@@ -50,8 +50,8 @@ end
     rleft, rright = relative_precision(x, xref)
     @test rleft ≤ 1e-5 && rright ≤ 1e-5
 
-    if Sys.iswindows()
-        # SDPA is broken on Windows
+    if Sys.iswindows() || VERSION >= v"1.10"
+        # SDPA is broken on Windows or v1.10
         @test_broken begin
             x = enclose(p, dom, SumOfSquaresEnclosure(; backend=SDPA.Optimizer))
             xref = interval(4.8333, 10.541)