use LazySets v3

JuliaReach · Nov 21, 2024 · 9bfdbf5 · 9bfdbf5
1 parent a776ad1
commit 9bfdbf5
Show file tree

Hide file tree

Showing 3 changed files with 5 additions and 5 deletions.
diff --git a/Project.toml b/Project.toml
@@ -12,7 +12,7 @@ Requires = "ae029012-a4dd-5104-9daa-d747884805df"
 
 [compat]
 ControllerFormats = "0.2.3"
-LazySets = "2.14"
+LazySets = "3"
 LinearAlgebra = "<0.0.1, 1.6"
 ReachabilityBase = "0.2.1 - 0.3"
 Reexport = "0.2, 1"

diff --git a/src/BackwardAlgorithms/PolyhedraBackward.jl b/src/BackwardAlgorithms/PolyhedraBackward.jl
@@ -86,7 +86,7 @@ end
 
 function _backward_pwa(Y::LazySet{N}, act::ActivationFunction,
                        ::PolyhedraBackward) where {N}
-    @assert is_polyhedral(Y) "expected a polyhedron, got $(typeof(Y))"
+    @assert ispolyhedral(Y) "expected a polyhedron, got $(typeof(Y))"
 
     out = LazySet{N}[]
     n = dim(Y)
@@ -158,7 +158,7 @@ end
 
 # apply inverse ReLU activation function to 2D polyhedron
 function _backward_2D(Y::LazySet{N}, ::ReLU) where {N}
-    @assert is_polyhedral(Y) "expected a polyhedron, got $(typeof(Y))"
+    @assert ispolyhedral(Y) "expected a polyhedron, got $(typeof(Y))"
 
     out = LazySet{N}[]
 
@@ -242,7 +242,7 @@ end
 # maps a linear constraint cx <= d to a new constraint whose normal vector is
 # [c1v1, c2v2, ...], and since v is a bitvector, it acts as a filter.
 function _backward_nD(Y::LazySet{N}, ::ReLU) where {N}
-    @assert is_polyhedral(Y) "expected a polyhedron, got $(typeof(Y))"
+    @assert ispolyhedral(Y) "expected a polyhedron, got $(typeof(Y))"
 
     out = LazySet{N}[]
     n = dim(Y)

diff --git a/test/Project.toml b/test/Project.toml
@@ -14,7 +14,7 @@ Aqua = "0.8.9"
 CDDLib = "0.6 - 0.9"
 ControllerFormats = "0.2"
 IntervalConstraintProgramming = "0.9 - 0.13"
-LazySets = "2.14"
+LazySets = "3"
 Optim = "1"
 Polyhedra = "0.6 - 0.7"
 ReachabilityAnalysis = "0.22 - 0.27"