Merge pull request #2887 from JuliaReach/schillic/isdisjoint2

Swap isdisjoint and is_intersection_empty

Author: schillic

docs/src/lib/binary_functions.md

@@ -21,31 +21,31 @@ cartesian_product(::LazySet, ::LazySet)
 ## Check for emptiness of intersection
 
 !!! note
-    `isdisjoint` can be used as an alternative name to `is_intersection_empty`.
+    `is_intersection_empty` can be used as an alternative name to `isdisjoint`.
 
 ```@docs
-is_intersection_empty(::LazySet, ::LazySet, ::Bool=false)
-is_intersection_empty(::AbstractHyperrectangle, ::AbstractHyperrectangle, ::Bool=false)
-is_intersection_empty(::LazySet, ::AbstractSingleton, ::Bool=false)
-is_intersection_empty(::AbstractHyperrectangle, ::AbstractSingleton, ::Bool=false)
-is_intersection_empty(::AbstractSingleton, ::AbstractSingleton, ::Bool=false)
-is_intersection_empty(::AbstractZonotope, ::Union{Hyperplane, Line2D}, ::Bool=false)
-is_intersection_empty(::Ball2, ::Ball2, ::Bool=false)
-is_intersection_empty(::LineSegment, ::LineSegment, ::Bool=false)
-is_intersection_empty(::LazySet, ::Union{Hyperplane, Line2D}, ::Bool=false)
-is_intersection_empty(::LazySet, ::HalfSpace, ::Bool=false)
-is_intersection_empty(::HalfSpace, ::HalfSpace, ::Bool=false)
-is_intersection_empty(::AbstractPolyhedron, ::LazySet, ::Bool=false)
-is_intersection_empty(::UnionSet, ::LazySet, ::Bool=false)
-is_intersection_empty(::UnionSetArray, ::LazySet, ::Bool=false)
-is_intersection_empty(::Universe, ::LazySet, ::Bool=false)
-is_intersection_empty(::Complement, ::LazySet, ::Bool=false)
-is_intersection_empty(::AbstractZonotope, ::AbstractZonotope, ::Bool=false)
-is_intersection_empty(::Interval, ::Interval, ::Bool=false)
-is_intersection_empty(::CartesianProductArray, ::AbstractPolyhedron)
-is_intersection_empty(::CartesianProductArray, ::CartesianProductArray)
-is_intersection_empty(::CartesianProductArray, ::AbstractHyperrectangle, ::Bool=false)
-is_intersection_empty(::Line2D, ::Line2D, ::Bool=false)
+isdisjoint(::LazySet, ::LazySet, ::Bool=false)
+isdisjoint(::AbstractHyperrectangle, ::AbstractHyperrectangle, ::Bool=false)
+isdisjoint(::LazySet, ::AbstractSingleton, ::Bool=false)
+isdisjoint(::AbstractHyperrectangle, ::AbstractSingleton, ::Bool=false)
+isdisjoint(::AbstractSingleton, ::AbstractSingleton, ::Bool=false)
+isdisjoint(::AbstractZonotope, ::Union{Hyperplane, Line2D}, ::Bool=false)
+isdisjoint(::Ball2, ::Ball2, ::Bool=false)
+isdisjoint(::LineSegment, ::LineSegment, ::Bool=false)
+isdisjoint(::LazySet, ::Union{Hyperplane, Line2D}, ::Bool=false)
+isdisjoint(::LazySet, ::HalfSpace, ::Bool=false)
+isdisjoint(::HalfSpace, ::HalfSpace, ::Bool=false)
+isdisjoint(::AbstractPolyhedron, ::LazySet, ::Bool=false)
+isdisjoint(::UnionSet, ::LazySet, ::Bool=false)
+isdisjoint(::UnionSetArray, ::LazySet, ::Bool=false)
+isdisjoint(::Universe, ::LazySet, ::Bool=false)
+isdisjoint(::Complement, ::LazySet, ::Bool=false)
+isdisjoint(::AbstractZonotope, ::AbstractZonotope, ::Bool=false)
+isdisjoint(::Interval, ::Interval, ::Bool=false)
+isdisjoint(::CartesianProductArray, ::AbstractPolyhedron)
+isdisjoint(::CartesianProductArray, ::CartesianProductArray)
+isdisjoint(::CartesianProductArray, ::AbstractHyperrectangle, ::Bool=false)
+isdisjoint(::Line2D, ::Line2D, ::Bool=false)
 ```
 
 ## Convex hull

docs/src/man/reach_zonotopes_hybrid.md

@@ -53,7 +53,7 @@ function reach_hybrid(As, Ts, init, δ, μ, T, max_order, instant_transitions)
             S = R[i]
             push!(res, (S, loc))
             for (guard, tgt_loc) in Ts[loc]
-                if !is_intersection_empty(S, guard)
+                if !isdisjoint(S, guard)
                     new_t = t + δ * i
                     push!(queue, (S, tgt_loc, new_t))
                     found_transition = true

docs/src/man/set_operations.md

@@ -327,18 +327,18 @@ plot_points(witnesses, "w")
 plot1
 ```
 
-### `is_intersection_empty`
+### `isdisjoint`
 
 This function checks whether the intersection of two sets is empty.
 It can optionally produce a witness if the intersection is nonempty.
 Disjointness checks with `Ball2` are not supported yet.
 
 ```@example set_operations
-println(is_intersection_empty(BI, H))
-w1 = is_intersection_empty(BI, H, true)[2]
-println(is_intersection_empty(B1, BI))
-w2 = is_intersection_empty(B1, BI, true)[2]
-println(is_intersection_empty(B1, H))
+println(isdisjoint(BI, H))
+w1 = isdisjoint(BI, H, true)[2]
+println(isdisjoint(B1, BI))
+w2 = isdisjoint(B1, BI, true)[2]
+println(isdisjoint(B1, H))
 ```
 
 ```@example set_operations