Merge pull request #3561 from JuliaReach/schillic/convert_AS

Remove redundant `convert` methods

docs/src/lib/conversion.md

@@ -22,11 +22,9 @@ convert(::Type{Hyperrectangle}, ::Rectification{N, AH}) where {N, AH<:AbstractHy
 convert(::Type{HPolygon}, ::LazySet)
 convert(::Type{HPolygon}, ::VPolygon)
 convert(::Type{HPolygon}, ::LineSegment{N}) where {N}
-convert(::Type{HPolygon}, ::AbstractSingleton{N}) where {N}
 convert(::Type{HPolygonOpt}, ::LazySet)
 convert(::Type{HPolygonOpt}, ::VPolygon)
 convert(::Type{HPolygonOpt}, ::LineSegment{N}) where {N}
-convert(::Type{HPolygonOpt}, ::AbstractSingleton{N}) where {N}
 convert(::Type{VPolygon}, ::AbstractHPolygon)
 convert(::Type{Zonotope}, ::LinearMap{N, ZN}) where {N, ZN<:AbstractZonotope}
 convert(::Type{Zonotope}, ::LinearMap{N, CartesianProduct{N, HN1, HN2}}) where {N, HN1<:AbstractHyperrectangle, HN2<:AbstractHyperrectangle}

src/Convert/convert.jl

@@ -103,32 +103,6 @@ for T in subtypes(AbstractHPolygon, true)
             return VPolygonModule.tohrep(P, T)
         end
 
-        """
-            convert(::Type{$($T)}, S::AbstractSingleton{N}) where {N}
-
-        Convert a singleton to a polygon in constraint representation.
-
-        ### Input
-
-        - `$($T)` -- target type
-        - `S`     -- singleton
-
-        ### Output
-
-        A polygon in constraint representation with the minimal number of constraints
-        (three).
-        """
-        function convert(::Type{$T}, S::AbstractSingleton{N}) where {N}
-            constraints_list = Vector{HalfSpace{N,Vector{N}}}(undef, 3)
-            o = one(N)
-            z = zero(N)
-            v = element(S)
-            constraints_list[1] = HalfSpace([o, o], v[1] + v[2])
-            constraints_list[2] = HalfSpace([-o, z], -v[1])
-            constraints_list[3] = HalfSpace([z, -o], -v[2])
-            return $T(constraints_list)
-        end
-
         """
             convert(::Type{$($T)}, L::LineSegment{N}) where {N}