I think we can have

ispolytopic(X) = applicable(constraints_list, X) && isbounded(X)

because constraints_list is defined more often.

$ grep -r "function constraints_list" .
./AffineMap.jl:function constraints_list(am::AffineMap{N}) where {N<:Real}
./Intersection.jl:function constraints_list(cap::Intersection{N}) where {N<:Real}
./LinearMap.jl:function constraints_list(lm::LinearMap{N}) where {N<:Real}
./MinkowskiSum.jl:function constraints_list(ms::MinkowskiSum)
./ResetMap.jl:function constraints_list(rm::ResetMap{N}) where {N<:Real}
./ResetMap.jl:function constraints_list(rm::ResetMap{N, S}
./CartesianProduct.jl:function constraints_list(cp::CartesianProduct{N}) where {N<:Real}
./IntersectionArray.jl:function constraints_list(ia::IntersectionArray{N}) where {N<:Real}
./CartesianProductArray.jl:function constraints_list(cpa::CartesianProductArray{N}) where {N<:Real}
./ConvexHullArray.jl:function constraints_list(X::ConvexHullArray{N, Singleton{N, VT}}) where {N, VT}
./Translation.jl:function constraints_list(tr::Translation{N}) where {N<:Real}

$ grep -r "function vertices_list" .
./AffineMap.jl:function vertices_list(am::AffineMap{N};
./LinearMap.jl:function vertices_list(lm::LinearMap{N}; prune::Bool=true)::Vector{Vector{N}} where {N<:Real}
./ExponentialMap.jl:function vertices_list(em::ExponentialMap{N}) where {N<:Real}
./CartesianProduct.jl:function vertices_list(cp::CartesianProduct{N}) where {N<:Real}
./CartesianProductArray.jl:function vertices_list(cpa::CartesianProductArray{N}) where {N<:Real}
./ConvexHullArray.jl:function vertices_list(X::ConvexHullArray{N, Singleton{N, VT}}) where {N, VT}

Add ispolytopic trait #1968

Description

Metadata

Metadata

Assignees

Labels

Type

Projects

Milestone

Relationships

Development

Issue actions