pub enum BoolOp {
Union,
Intersection,
Difference,
SmoothUnion,
SmoothIntersection,
SmoothDifference,
}Expand description
Boolean operation type for the SDF expression tree.
Variants§
Union
Hard union.
Intersection
Hard intersection.
Difference
Difference (left minus right).
SmoothUnion
Smooth union (blend radius stored separately).
SmoothIntersection
Smooth intersection.
SmoothDifference
Smooth difference.
Trait Implementations§
impl Copy for BoolOp
impl Eq for BoolOp
impl StructuralPartialEq for BoolOp
Auto Trait Implementations§
impl Freeze for BoolOp
impl RefUnwindSafe for BoolOp
impl Send for BoolOp
impl Sync for BoolOp
impl Unpin for BoolOp
impl UnsafeUnpin for BoolOp
impl UnwindSafe for BoolOp
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.