pub enum SnapKind {
Endpoint,
Intersection,
Center,
Midpoint,
Quadrant,
Anchor,
Nearest,
Grid,
}Expand description
Snap kinds in priority order.
Variants§
Endpoint
Endpoint / vertex / corner.
Intersection
Curve–curve intersection.
Center
Center / centroid.
Midpoint
Midpoint.
Quadrant
Circle quadrant.
Anchor
Other named anchor (insert points, plugin anchors).
Nearest
Closest point on a curve.
Grid
Grid point.
Trait Implementations§
impl Copy for SnapKind
Source§impl<'de> Deserialize<'de> for SnapKind
impl<'de> Deserialize<'de> for SnapKind
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for SnapKind
Source§impl Ord for SnapKind
impl Ord for SnapKind
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
Source§impl PartialOrd for SnapKind
impl PartialOrd for SnapKind
impl StructuralPartialEq for SnapKind
Auto Trait Implementations§
impl Freeze for SnapKind
impl RefUnwindSafe for SnapKind
impl Send for SnapKind
impl Sync for SnapKind
impl Unpin for SnapKind
impl UnsafeUnpin for SnapKind
impl UnwindSafe for SnapKind
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<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§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.