pub enum FillRule {
EvenOdd,
NonZero,
Positive,
Negative,
}Expand description
Fill rule for constructing cross-sections from polygons.
Determines how self-intersecting or overlapping polygon contours are
interpreted when creating a CrossSection.
Variants§
EvenOdd
Alternating inside/outside based on crossing count parity.
NonZero
Inside if crossing count is non-zero.
Positive
Inside if crossing count is positive.
Negative
Inside if crossing count is negative.
Trait Implementations§
impl Copy for FillRule
impl Eq for FillRule
impl StructuralPartialEq for FillRule
Auto Trait Implementations§
impl Freeze for FillRule
impl RefUnwindSafe for FillRule
impl Send for FillRule
impl Sync for FillRule
impl Unpin for FillRule
impl UnsafeUnpin for FillRule
impl UnwindSafe for FillRule
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.