require Julia v1.10

Author: schillic

.github/workflows/test-pull-request.yml

@@ -25,7 +25,7 @@ jobs:
         arch:
           - x64
         include:
-          - version: '1.6'  # test on oldest supported version
+          - version: '1.10'  # test on oldest supported version
             arch: x64
             os: ubuntu-latest
     env:

Project.toml

@@ -33,4 +33,4 @@ Requires = "0.5, 1"
 SharedArrays = "<0.0.1, 1.6"
 SparseArrays = "<0.0.1, 1.6"
 StaticArraysCore = "1"
-julia = "1.6"
+julia = "1.10"

src/Approximations/overapproximate_zonotope.jl

@@ -1167,12 +1167,7 @@ function _overapproximate_zonotope_hyperplane(Z::AbstractZonotope, H::Hyperplane
 
     s = G' * a
     d = b - dot(a, c)
-    @static if VERSION >= v"1.7"
-        sT = s'
-    else
-        sT = s' .+ 0  # convert to Vector (`nullspace` fails for lazy transpose)
-    end
-    V0 = nullspace(sT)
+    V0 = nullspace(s')
 
     cs = s * d / dot(s, s)
     Gs = V0 * V0'
@@ -1257,8 +1252,8 @@ function load_overapproximate_ICP()
                                  ICP.Separator($e, $vars)
                              end)
             # smallest box containing all points in domain X satisfying constraint
-            # (`invokelatest` to avoid world-age issue; `Base.` for VERSION < v"1.9")
-            boundary, _, _ = Base.invokelatest(separator, IB.IntervalBox(X...))
+            # (`invokelatest` to avoid world-age issue)
+            boundary, _, _ = invokelatest(separator, IB.IntervalBox(X...))
             return boundary
         end
     end

src/Initialization/init_Symbolics.jl

@@ -7,12 +7,7 @@ _vec(vars::Vector{Symbolics.Arr{Num,1}}) = reduce(vcat, vars)
 _vec(vars::Vector{Vector{Num}}) = reduce(vcat, vars)
 _vec(vars::Vector{Real}) = reduce(vcat, vars)
 
-# `sort` argument was introduced in Symbolics v6.1
-@static if VERSION < v"1.10"
-    _get_variables(expr::Num) = convert(Vector{Num}, Symbolics.get_variables(expr))
-else
-    _get_variables(expr::Num) = convert(Vector{Num}, Symbolics.get_variables(expr; sort=true))
-end
+_get_variables(expr::Num) = convert(Vector{Num}, Symbolics.get_variables(expr; sort=true))
 function _get_variables(expr::Vector{<:Num})
     return unique(reduce(vcat, _get_variables(ex) for ex in expr))
 end

src/Interfaces/AbstractZonotope.jl

@@ -635,11 +635,7 @@ end
 
 function flat_dimensions(Z::AbstractZonotope)
     G = genmat(Z)
-    @static if VERSION >= v"1.7"
-        res = findall(iszero, eachrow(G))
-    else
-        res = findall(iszero, collect(eachrow(G)))
-    end
+    res = findall(iszero, eachrow(G))
     return res
 end
 
@@ -853,9 +849,6 @@ function remove_redundant_generators(G::AbstractMatrix)
 
     # sort column in ascending order
     cols = eachcol(Gnorm)
-    if VERSION < v"1.9"
-        cols = collect(cols)
-    end
     ord = sortperm(cols)
     merged = Vector{Vector{eltype(G)}}()
 

src/LazySets.jl

@@ -33,10 +33,6 @@ import IntervalArithmetic as IA
 using LinearAlgebra: checksquare
 using Random: AbstractRNG, GLOBAL_RNG, SamplerType, randperm
 
-@static if VERSION < v"1.9"
-    stack(vecs) = hcat(vecs...)  # COV_EXCL_LINE
-end
-
 # ================
 # ReachabilityBase
 # ================

src/Utils/helper_functions.jl

@@ -272,14 +272,7 @@ _to_colVector(M::AbstractMatrix) = convert(Vector, [M[:, j] for j in axes(M, 2)]
 _to_colVector(M::Matrix) = [M[:, j] for j in axes(M, 2)]
 
 function load_StaticArraysCore_to_colVector()
-    @static if VERSION < v"1.9"
-        # in pre-v1.9 Julia versions, `collect` returned a `SizedVector`
-        return quote
-            _to_colVector(M::SMatrix) = [eachcol(M)...]
-        end
-    else
-        return quote
-            _to_colVector(M::SMatrix) = collect(eachcol(M))
-        end
+    return quote
+        _to_colVector(M::SMatrix) = collect(eachcol(M))
     end
 end  # load_StaticArraysCore_to_colVector()

test/LazyOperations/Intersection.jl

@@ -1,11 +1,5 @@
 using LazySets, Test
 using LazySets.ReachabilityBase.Arrays: SingleEntryVector, ispermutation
-@static if VERSION >= v"1.9"
-    vGLPK = pkgversion(LazySets.GLPK)
-else
-    import PkgVersion
-    vGLPK = PkgVersion.Version(LazySets.GLPK)
-end
 if !isdefined(@__MODULE__, Symbol("@tN"))
     macro tN(v)
         return v
@@ -70,7 +64,7 @@ for N in @tN([Float64, Float32, Rational{Int}])
     I2 = Hyperplane(ones(N, 2), N(1)) ∩ HalfSpace(ones(N, 2), N(1))
     # the next test fails with the "EXACT" solver GLPK older than v0.15.3
     # see https://github.com/jump-dev/GLPK.jl/issues/207
-    if N != Rational{Int} || vGLPK >= v"0.15.3"
+    if N != Rational{Int} || pkgversion(LazySets.GLPK) >= v"0.15.3"
         @test !isbounded(I2) && !isboundedtype(typeof(I2))
     end
 

test/Sets/EmptySet.jl

@@ -177,8 +177,7 @@ for N in @tN([Float64, Float32, Rational{Int}])
 
     # singleton_list
     res = singleton_list(E)
-    T = VERSION < v"1.7" ? Singleton : Singleton{N,Vector{N}}
-    @test res isa Vector{T} && isempty(res)
+    @test res isa Vector{Singleton{N,Vector{N}}} && isempty(res)
 
     # tosimplehrep
     @test_throws MethodError tosimplehrep(E)  # TODO this should maybe change

test/Sets/Interval.jl

@@ -1,12 +1,6 @@
 using LazySets, Test
 using LazySets.ReachabilityBase.Arrays: ispermutation, SingleEntryVector
 IA = LazySets.IA
-@static if VERSION >= v"1.9"
-    vIA = pkgversion(IA)
-else
-    import PkgVersion
-    vIA = PkgVersion.Version(IA)
-end
 if !isdefined(@__MODULE__, Symbol("@tN"))
     macro tN(v)
         return v
@@ -350,11 +344,7 @@ for N in @tN([Float64, Float32, Rational{Int}])
     @test isidentical(Y, Interval(N(0), N(4)))
     Y = linear_map(zeros(N, 1, 1), X)  # zero map
     @test Y isa Interval{N}
-    if vIA == v"0.21.0"
-        @test_broken isequivalent(Y, Interval(N(0), N(0)))  # bug in IntervalArithmetic: 0 * I == I
-    else
-        @test isequivalent(Y, Interval(N(0), N(0)))
-    end
+    @test isequivalent(Y, Interval(N(0), N(0)))
     Y = linear_map(ones(N, 2, 1), X)  # higher dimension
     @test Y isa LazySet{N} && isequivalent(Y, LineSegment(N[0, 0], N[2, 2]))
     Y = linear_map(zeros(N, 2, 1), X)  # zero map in higher dimension