Merge pull request #1027 from JuliaReach/schillic/1026

#1026 - Efficient concrete intersection with a singleton
JuliaReach · Jan 17, 2019 · 6e00cd9 · 6e00cd9
2 parents a5c6791 + 0ce2a41
commit 6e00cd9
Show file tree

Hide file tree

Showing 4 changed files with 104 additions and 26 deletions.
diff --git a/docs/src/lib/binary_functions.md b/docs/src/lib/binary_functions.md
@@ -44,6 +44,7 @@ convex_hull(::VPolygon{N}, ::VPolygon{N}) where {N<:Real}
 ## Intersection of two sets
 
 ```@docs
+intersection(::AbstractSingleton{N}, ::Union{LazySet{N}, UnionSet{N}, UnionSetArray{N}}) where {N<:Real}
 intersection(::Line{N}, ::Line{N}) where {N<:Real}
 intersection(::AbstractHyperrectangle{N}, ::AbstractHyperrectangle{N}) where {N<:Real}
 intersection(::Interval{N}, ::Interval{N}) where {N<:Real}