pub enum Continuity {
C0,
G1,
C1,
G2,
C2,
CInfinity,
}Expand description
How smooth a curve or surface is.
Ordered from least to most smooth, so >= is a meaningful test.
Variants§
C0
Positions agree. Tangents may not. A corner.
G1
Tangent directions agree, but their magnitudes need not. Enough for a visually smooth join, and the usual requirement for a wire.
C1
First derivatives agree exactly.
G2
Curvature agrees.
C2
Second derivatives agree exactly.
CInfinity
Differentiable to any order: an analytic surface away from its degeneracies.
Trait Implementations§
Source§impl Clone for Continuity
impl Clone for Continuity
impl Copy for Continuity
Source§impl Debug for Continuity
impl Debug for Continuity
impl Eq for Continuity
Source§impl Ord for Continuity
impl Ord for Continuity
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the minimum of two values. Read more
Source§impl PartialEq for Continuity
impl PartialEq for Continuity
Source§impl PartialOrd for Continuity
impl PartialOrd for Continuity
impl StructuralPartialEq for Continuity
Auto Trait Implementations§
impl Freeze for Continuity
impl RefUnwindSafe for Continuity
impl Send for Continuity
impl Sync for Continuity
impl Unpin for Continuity
impl UnsafeUnpin for Continuity
impl UnwindSafe for Continuity
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<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.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.