Struct rs_graph::vec::EdgeIndexer

pub struct EdgeIndexer<'g, G>(pub G, _);

An indexer for edges of an IndexGraphRef.

Trait Implementations

impl<'g, G: Clone> Clone for EdgeIndexer<'g, G>

fn clone(&self) -> EdgeIndexer<'g, G>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'g, G: Copy> Copy for EdgeIndexer<'g, G>

impl<'a, G> GraphIndexer<G> for EdgeIndexer<'a, G> where
    G: 'a + IndexGraphRef<'a> + Clone, 

fn new(g: G) -> Self

Create a new indexer for the given graph.

impl<'g, G, I> GraphIterator<EdgeIndexer<'g, G>> for IndexerIt<I> where
    I: GraphIterator<G>, 

type Item = I::Item

fn next(&mut self, indexer: &EdgeIndexer<'g, G>) -> Option<Self::Item>

fn size_hint(&self, indexer: &EdgeIndexer<'g, G>) -> (usize, Option<usize>)

fn count(self, indexer: &EdgeIndexer<'g, G>) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized, 

impl<'a, G> Indexer for EdgeIndexer<'a, G> where
    G: IndexGraphRef<'a> + Clone, 

type Idx = G::Edge

The type of the index items.

type Iter = IndexerIt<G::EdgeIt>

fn num_items(&self) -> usize

Return the number of items.

fn index(&self, e: G::Edge) -> usize

Return the index associated with an item.

fn iter(&self) -> GraphIter<'_, Self, Self::Iter>

Return an iterator over all items.