pub struct SdfUnion<A, B> {
pub a: A,
pub b: B,
}Expand description
SDF union of two shapes.
Fields§
§a: AFirst operand.
b: BSecond operand.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<A, B> Freeze for SdfUnion<A, B>
impl<A, B> RefUnwindSafe for SdfUnion<A, B>where
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<A, B> Send for SdfUnion<A, B>
impl<A, B> Sync for SdfUnion<A, B>
impl<A, B> Unpin for SdfUnion<A, B>
impl<A, B> UnsafeUnpin for SdfUnion<A, B>where
A: UnsafeUnpin,
B: UnsafeUnpin,
impl<A, B> UnwindSafe for SdfUnion<A, B>where
A: UnwindSafe,
B: UnwindSafe,
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.