Struct osmgraphing::network::EdgeAccessor
source · [−]pub struct EdgeAccessor<'a> { /* private fields */ }
Expand description
A shallow container for accessing edges. Shallow means that it does only contain references to the graph’s data-arrays.
Implementations
sourceimpl<'a> EdgeAccessor<'a>
impl<'a> EdgeAccessor<'a>
pub fn iter(&self) -> EdgeIdxIterator
pub fn count(&self) -> usize
pub fn half_edge(&'a self, idx: EdgeIdx) -> HalfEdge<'_>
pub fn try_id(&self, idx: EdgeIdx) -> Option<usize>
pub fn id(&self, idx: EdgeIdx) -> usize
pub fn try_idx_from(&self, id: usize) -> Result<EdgeIdx>
pub fn idx_from(&self, id: usize) -> EdgeIdx
pub fn dst_idx(&self, idx: EdgeIdx) -> NodeIdx
pub fn metrics(&self) -> &MetricAccessor<'a>
pub fn is_shortcut(&self, idx: EdgeIdx) -> bool
pub fn sc_edges(&self, idx: EdgeIdx) -> Option<&[EdgeIdx; 2]>
pub fn starting_from(
&'a self,
idx: NodeIdx
) -> impl Iterator<Item = HalfEdge<'a>>
Trait Implementations
sourceimpl<'a> Debug for EdgeAccessor<'a>
impl<'a> Debug for EdgeAccessor<'a>
sourceimpl<'a> IntoIterator for &'a EdgeAccessor<'_>
impl<'a> IntoIterator for &'a EdgeAccessor<'_>
sourceimpl IntoIterator for EdgeAccessor<'_>
impl IntoIterator for EdgeAccessor<'_>
Auto Trait Implementations
impl<'a> RefUnwindSafe for EdgeAccessor<'a>
impl<'a> Send for EdgeAccessor<'a>
impl<'a> Sync for EdgeAccessor<'a>
impl<'a> Unpin for EdgeAccessor<'a>
impl<'a> UnwindSafe for EdgeAccessor<'a>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
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<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
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.