Empty set (EmptySet)
LazySets.EmptySetModule.EmptySet — Type
EmptySet{N} <: ConvexSet{N}Type that represents the empty set, i.e., the set with no elements.
LazySets.EmptySetModule.∅ — Type
∅Alias for EmptySet{Float64}.
Conversion
convert(::Type{EmptySet}, ::LazySet)Operations
LazySets.chebyshev_center_radius — Method
chebyshev_center_radius(∅::EmptySet; [kwargs]...)Compute a Chebyshev center and the corresponding radius of an empty set.
Input
∅– empty setkwargs– further keyword arguments (ignored)
Output
An error.
LazySets.API.complement — Method
complement(X::LazySet)Compute the complement of a set.
Input
X– set
Output
A set representing the complement of X.
LazySets.API.complement — Method
Base.rand — Method
rand(T::Type{<:LazySet}; [N]::Type{<:Real}=Float64, [dim]::Int=2,
[rng]::AbstractRNG=GLOBAL_RNG, [seed]::Union{Int, Nothing}=nothing
)Create a random set of the given set type.
Input
T– set typeN– (optional, default:Float64) numeric typedim– (optional, default: 2) dimensionrng– (optional, default:GLOBAL_RNG) random number generatorseed– (optional, default:nothing) seed for reseeding
Output
A random set of the given set type.
Undocumented implementations:
convex_hullcopy(::EmptySet)diameterdimhighhighisboundedisboundedtypeisemptyisoperationtypeisuniversallowlownormradiusrationalizerectifyreflectvertices_listverticesvolumedistanceexponential_mapinis_interior_pointlinear_mappermuteprojectsamplescalescale!ρσtranslatetranslate!cartesian_productconvex_hulldifferencedistanceintersectionisapproxisdisjoint⊂issubsetlinear_combinationminkowski_differenceminkowski_sum
Inherited from LazySet:
concretizeeltypeextremaextremaisconvexisoperationispolyhedralispolyhedraltypeispolytopicispolytopictypeaffine_mapexact_sum==isequivalent
Inherited from LazySet but does not apply:
Inherited from ConvexSet: