Merge pull request #3614 from JuliaReach/schillic/3282

#3282 - Remove + and - methods for Interval

docs/src/lib/sets/Interval.md

@@ -50,8 +50,6 @@ minkowski_sum(::Interval, ::Interval)
 plot_recipe(::Interval{N}, ::Any=zero(N)) where {N}
 min(::Interval)
 max(::Interval)
--(::Interval, ::Interval)
-*(::Interval, ::Interval)
 ```
 
 ```@meta

src/Sets/Interval/IntervalModule.jl

@@ -23,7 +23,7 @@ using ReachabilityBase.Require: require
 @reexport import ..LazySets: chebyshev_center_radius, isflat, ngens,
                              radius_hyperrectangle, split
 import ..LazySets: plot_recipe
-import Base: convert, -, *, min, max
+import Base: convert, min, max
 @reexport using ..API
 
 export Interval
@@ -77,44 +77,6 @@ include("split.jl")
 
 include("convert.jl")
 
-"""
-    -(x::Interval, y::Interval)
-
-Return the difference of two intervals (in the interval-arithmetic sense).
-
-### Input
-
-- `x` -- interval
-- `y` -- interval
-
-### Output
-
-The difference of the intervals as a new `Interval` set.
-"""
-function -(x::Interval, y::Interval)
-    return Interval(x.dat - y.dat)
-end
-
-"""
-```
-    *(x::Interval, y::Interval)
-```
-
-Return the product of two intervals (in the interval-arithmetic sense).
-
-### Input
-
-- `x` -- interval
-- `y` -- interval
-
-### Output
-
-The product of the intervals as a new `Interval` set.
-"""
-function *(x::Interval, y::Interval)
-    return Interval(x.dat * y.dat)
-end
-
 """
     min(x::Interval)
 

test/Sets/Interval.jl

@@ -77,27 +77,6 @@ for N in [Float64, Float32, Rational{Int}]
     # the concrete Minkowski sum of intervals returns an interval
     @test minkowski_sum(x, y) == Interval(N(-2), N(1.5))
 
-    # subtraction
-    d = x - y
-    @test dim(d) == 1
-    @test σ(N[1], d) == N[3]
-    @test σ(N[-1], d) == N[-0.5]
-    @test min(d) == N(-0.5) && max(d) == N(3)
-    v = vertices_list(d)
-    @test N[-0.5] in v && N[3] in v
-
-    # product of intervals: use the * operator
-    p = x * y
-    @test dim(p) == 1
-    @test σ(N[1], p) == N[0.5]
-    @test σ(N[-1], p) == N[-2]
-    v = vertices_list(p)
-    @test N[0.5] in v && N[-2] in v
-
-    # test different arithmetic operations
-    r = minkowski_sum(x, y) - minkowski_sum(d, p)
-    @test min(r) == N(-5.5) && max(r) == N(4)
-
     # ispolyhedral
     @test ispolyhedral(x)