pub struct LoopSide {
pub curve: Curve,
pub range: (f64, f64),
pub across: Across,
}Expand description
One side of a loop fit_loop_quads fills: its curve over a range,
and how the fill leaves it.
Fields§
§curve: CurveThe side’s curve.
range: (f64, f64)The range of it the side runs over, in the loop’s direction.
across: AcrossHow the fill leaves the side.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LoopSide
impl RefUnwindSafe for LoopSide
impl Send for LoopSide
impl Sync for LoopSide
impl Unpin for LoopSide
impl UnsafeUnpin for LoopSide
impl UnwindSafe for LoopSide
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,
§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.