Struct spade::delaunay::VertexHandle
source · pub struct VertexHandle<'a, V, E = ()>where
V: 'a,
E: 'a,{ /* private fields */ }Expand description
A handle to a vertex.
Used to retrieve its outgoing edges.
Implementations
sourceimpl<'a, V, E> VertexHandle<'a, V, E>where
V: 'a,
E: Default + 'a,
impl<'a, V, E> VertexHandle<'a, V, E>where
V: 'a,
E: Default + 'a,
sourcepub fn out_edge(&self) -> Option<EdgeHandle<'a, V, E>>
pub fn out_edge(&self) -> Option<EdgeHandle<'a, V, E>>
Returns an outgoing edge.
If the vertex has multiple outgoing edges, any of them is returned.
sourcepub fn ccw_out_edges(&self) -> CCWIterator<'a, V, E>ⓘNotable traits for CCWIterator<'a, V, E>impl<'a, V, E> Iterator for CCWIterator<'a, V, E>where
V: 'a,
E: Default + 'a, type Item = EdgeHandle<'a, V, E>;
pub fn ccw_out_edges(&self) -> CCWIterator<'a, V, E>ⓘNotable traits for CCWIterator<'a, V, E>impl<'a, V, E> Iterator for CCWIterator<'a, V, E>where
V: 'a,
E: Default + 'a, type Item = EdgeHandle<'a, V, E>;
V: 'a,
E: Default + 'a, type Item = EdgeHandle<'a, V, E>;
Returns all outgoing edges in counter clockwise order.
Note that this assumes that you use a right handed coordinate system, otherwise the sense of orientation is inverted.
sourcepub fn fix(&self) -> FixedVertexHandle
pub fn fix(&self) -> FixedVertexHandle
Creates a fixed vertex handle from this dynamic handle.
Trait Implementations
sourceimpl<'a, V, E> Clone for VertexHandle<'a, V, E>where
V: 'a,
E: 'a,
impl<'a, V, E> Clone for VertexHandle<'a, V, E>where
V: 'a,
E: 'a,
sourceimpl<'a, V, E> Debug for VertexHandle<'a, V, E>where
V: 'a,
impl<'a, V, E> Debug for VertexHandle<'a, V, E>where
V: 'a,
sourceimpl<'a, V, E> Deref for VertexHandle<'a, V, E>
impl<'a, V, E> Deref for VertexHandle<'a, V, E>
sourceimpl<'a, V, E> PartialEq<VertexHandle<'a, V, E>> for VertexHandle<'a, V, E>where
V: 'a,
impl<'a, V, E> PartialEq<VertexHandle<'a, V, E>> for VertexHandle<'a, V, E>where
V: 'a,
impl<'a, V, E> Copy for VertexHandle<'a, V, E>where
V: 'a,
Auto Trait Implementations
impl<'a, V, E> RefUnwindSafe for VertexHandle<'a, V, E>where
E: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, V, E> Send for VertexHandle<'a, V, E>where
E: Sync,
V: Sync,
impl<'a, V, E> Sync for VertexHandle<'a, V, E>where
E: Sync,
V: Sync,
impl<'a, V, E> Unpin for VertexHandle<'a, V, E>
impl<'a, V, E> UnwindSafe for VertexHandle<'a, V, E>where
E: RefUnwindSafe,
V: RefUnwindSafe,
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.