pub struct Cells {
pub a_not_b: Built,
pub b_not_a: Built,
pub common: Built,
}Expand description
The three cells two solids cut space into, each one boolean’s answer:
what is only in a, what is only in b, and what is in both. Arbitrary
set expressions compose by fusing a selection of these.
Fields§
§a_not_b: Builta with b removed.
b_not_a: Builtb with a removed.
common: BuiltThe overlap.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Cells
impl RefUnwindSafe for Cells
impl Send for Cells
impl Sync for Cells
impl Unpin for Cells
impl UnsafeUnpin for Cells
impl UnwindSafe for Cells
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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.