Enum spade::delaunay::PositionInTriangulation
source · pub enum PositionInTriangulation<V: Copy, F: Copy, E: Copy> {
InTriangle(F),
OutsideConvexHull(E),
OnPoint(V),
OnEdge(E),
NoTriangulationPresent,
}
Expand description
Stores information about a point’s position in triangulation.
Used as a return type of DelaunayTriangulation::locate(..)
.
Variants
InTriangle(F)
The point is contained in a triangle.
OutsideConvexHull(E)
The point is outside the convex hull. The given edge is an edge that is close to the queried position.
OnPoint(V)
A vertex with this position has already been inserted. Its handle is given.
OnEdge(E)
The point lies on an edge.
NoTriangulationPresent
There is no valid triangulation yet, thus, less than two points where inserted.
Trait Implementations
sourceimpl<V: Clone + Copy, F: Clone + Copy, E: Clone + Copy> Clone for PositionInTriangulation<V, F, E>
impl<V: Clone + Copy, F: Clone + Copy, E: Clone + Copy> Clone for PositionInTriangulation<V, F, E>
sourcefn clone(&self) -> PositionInTriangulation<V, F, E>
fn clone(&self) -> PositionInTriangulation<V, F, E>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<V: Debug + Copy, F: Debug + Copy, E: Debug + Copy> Debug for PositionInTriangulation<V, F, E>
impl<V: Debug + Copy, F: Debug + Copy, E: Debug + Copy> Debug for PositionInTriangulation<V, F, E>
sourceimpl<V: PartialEq + Copy, F: PartialEq + Copy, E: PartialEq + Copy> PartialEq<PositionInTriangulation<V, F, E>> for PositionInTriangulation<V, F, E>
impl<V: PartialEq + Copy, F: PartialEq + Copy, E: PartialEq + Copy> PartialEq<PositionInTriangulation<V, F, E>> for PositionInTriangulation<V, F, E>
sourcefn eq(&self, other: &PositionInTriangulation<V, F, E>) -> bool
fn eq(&self, other: &PositionInTriangulation<V, F, E>) -> bool
impl<V: Copy + Copy, F: Copy + Copy, E: Copy + Copy> Copy for PositionInTriangulation<V, F, E>
impl<V: Copy, F: Copy, E: Copy> StructuralPartialEq for PositionInTriangulation<V, F, E>
Auto Trait Implementations
impl<V, F, E> RefUnwindSafe for PositionInTriangulation<V, F, E>where
E: RefUnwindSafe,
F: RefUnwindSafe,
V: RefUnwindSafe,
impl<V, F, E> Send for PositionInTriangulation<V, F, E>where
E: Send,
F: Send,
V: Send,
impl<V, F, E> Sync for PositionInTriangulation<V, F, E>where
E: Sync,
F: Sync,
V: Sync,
impl<V, F, E> Unpin for PositionInTriangulation<V, F, E>where
E: Unpin,
F: Unpin,
V: Unpin,
impl<V, F, E> UnwindSafe for PositionInTriangulation<V, F, E>where
E: UnwindSafe,
F: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
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 morefn 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).unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.