Boolean operations

Difference

Euclid.difference — Method
difference(
    g1::Euclid.AbstractPrimitive,
    g2::AbstractVector{<:Euclid.AbstractPrimitive}
) -> Euclid.DynamicDifference
source
Euclid.difference — Method
difference(
    g1::Euclid.AbstractPrimitive,
    g2::Euclid.AbstractPrimitive
) -> Euclid.StaticDifference
source
Euclid.DynamicDifference — Type
struct DynamicDifference{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:(AbstractArray{<:Euclid.AbstractPrimitive{T, N}, 1})} <: Euclid.AbstractDynamicBooleanPrimitive{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:(AbstractArray{<:Euclid.AbstractPrimitive{T, N}, 1})}
  • left::Euclid.AbstractPrimitive

  • right::AbstractVector{<:Euclid.AbstractPrimitive{T, N}} where {T, N}

source
Euclid.StaticDifference — Type
struct StaticDifference{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:Euclid.AbstractPrimitive{T, N}} <: Euclid.AbstractStaticBooleanPrimitive{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:Euclid.AbstractPrimitive{T, N}}
  • left::Euclid.AbstractPrimitive

  • right::Euclid.AbstractPrimitive

source

Intersection

Base.intersect — Method
intersect(
    g1::Euclid.AbstractPrimitive,
    g2::AbstractVector{<:Euclid.AbstractPrimitive}
) -> Euclid.DynamicIntersection
source
Base.intersect — Method
intersect(
    g1::Euclid.AbstractPrimitive,
    g2::Euclid.AbstractPrimitive
) -> Euclid.StaticIntersection
source
Euclid.DynamicIntersection — Type
struct DynamicIntersection{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:(AbstractArray{<:Euclid.AbstractPrimitive{T, N}, 1})} <: Euclid.AbstractDynamicBooleanPrimitive{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:(AbstractArray{<:Euclid.AbstractPrimitive{T, N}, 1})}
  • left::Euclid.AbstractPrimitive

  • right::AbstractVector{<:Euclid.AbstractPrimitive{T, N}} where {T, N}

source
Euclid.StaticIntersection — Type
struct StaticIntersection{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:Euclid.AbstractPrimitive{T, N}} <: Euclid.AbstractStaticBooleanPrimitive{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:Euclid.AbstractPrimitive{T, N}}
  • left::Euclid.AbstractPrimitive

  • right::Euclid.AbstractPrimitive

source

Union

Base.union — Method
union(
    g1::Euclid.AbstractPrimitive,
    g2::AbstractVector{<:Euclid.AbstractPrimitive}
) -> Union{Euclid.DynamicUnion{_A, _B, var"#s178", <:AbstractVector{var"#s26"}} where {_B, var"#s178"<:Euclid.AbstractPrimitive{_A, _B}, var"#s26"<:Euclid.AbstractPrimitive{_A, _B}}, Euclid.DynamicUnion{_A, _B, var"#s178", B} where {_B, var"#s178"<:Euclid.AbstractPrimitive{_A, _B}, var"#s26"<:Euclid.AbstractPrimitive{_A, _B}, B<:AbstractVector{var"#s26"}}, Euclid.DynamicUnion{_A, N, var"#s178", <:AbstractVector{var"#s26"}} where {N, var"#s178"<:Euclid.AbstractPrimitive{_A, N}, var"#s26"<:Euclid.AbstractPrimitive{_A, N}}, Euclid.DynamicUnion{_A, N, var"#s178", B} where {N, var"#s178"<:Euclid.AbstractPrimitive{_A, N}, var"#s26"<:Euclid.AbstractPrimitive{_A, N}, B<:AbstractVector{var"#s26"}}} where _A
source
Base.union — Method
union(
    g1::Euclid.AbstractPrimitive,
    g2::Euclid.AbstractPrimitive
) -> Euclid.StaticUnion
source
Base.union — Method
union(
    g::Euclid.AbstractPrimitive,
    _::Nothing
) -> Euclid.AbstractPrimitive
source
Base.union — Method
union(
    _::Nothing,
    g::Euclid.AbstractPrimitive
) -> Euclid.AbstractPrimitive
source
Euclid.DynamicUnion — Type
struct DynamicUnion{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:(AbstractArray{<:Euclid.AbstractPrimitive{T, N}, 1})} <: Euclid.AbstractDynamicBooleanPrimitive{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:(AbstractArray{<:Euclid.AbstractPrimitive{T, N}, 1})}
  • left::Euclid.AbstractPrimitive

  • right::AbstractVector{<:Euclid.AbstractPrimitive{T, N}} where {T, N}

source
Euclid.StaticUnion — Type
struct StaticUnion{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:Euclid.AbstractPrimitive{T, N}} <: Euclid.AbstractStaticBooleanPrimitive{T, N, A<:Euclid.AbstractPrimitive{T, N}, B<:Euclid.AbstractPrimitive{T, N}}
  • left::Euclid.AbstractPrimitive

  • right::Euclid.AbstractPrimitive

source