pub enum RadiusLaw {
Linear {
start: f64,
end: f64,
},
Points(Vec<(f64, f64)>),
}Expand description
How a variable-radius blend’s radius runs along its chain of edges, by the fraction of the chain’s arc length from the chain’s start.
Variants§
Linear
From the chain’s start to its end, linearly in arc length.
Points(Vec<(f64, f64)>)
Radii at fractions of the chain’s arc length (0..=1, increasing),
interpolated smoothly (C1) between them without overshooting them;
held level before the first and after the last on an open chain,
and wrapped round on a closed one.
Trait Implementations§
impl StructuralPartialEq for RadiusLaw
Auto Trait Implementations§
impl Freeze for RadiusLaw
impl RefUnwindSafe for RadiusLaw
impl Send for RadiusLaw
impl Sync for RadiusLaw
impl Unpin for RadiusLaw
impl UnsafeUnpin for RadiusLaw
impl UnwindSafe for RadiusLaw
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<T> Scalar for T
§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.