Struct rs_graph::vec::IndexerIt [−][src]
pub struct IndexerIt<I>(_);
Trait Implementations
impl<'g, G, I> GraphIterator<EdgeIndexer<'g, G>> for IndexerIt<I> where
I: GraphIterator<G>, [src]
impl<'g, G, I> GraphIterator<EdgeIndexer<'g, G>> for IndexerIt<I> where
I: GraphIterator<G>, [src]type Item = I::Item
fn next(&mut self, indexer: &EdgeIndexer<'g, G>) -> Option<Self::Item>[src]
fn size_hint(&self, indexer: &EdgeIndexer<'g, G>) -> (usize, Option<usize>)[src]
fn count(self, indexer: &EdgeIndexer<'g, G>) -> usize[src]
fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘ where
G: Sized, [src]
G: Sized,
impl<'g, G, I> GraphIterator<NodeIndexer<'g, G>> for IndexerIt<I> where
I: GraphIterator<G>, [src]
impl<'g, G, I> GraphIterator<NodeIndexer<'g, G>> for IndexerIt<I> where
I: GraphIterator<G>, [src]type Item = I::Item
fn next(&mut self, indexer: &NodeIndexer<'g, G>) -> Option<Self::Item>[src]
fn size_hint(&self, indexer: &NodeIndexer<'g, G>) -> (usize, Option<usize>)[src]
fn count(self, indexer: &NodeIndexer<'g, G>) -> usize[src]
fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘ where
G: Sized, [src]
G: Sized,
Auto Trait Implementations
impl<I> RefUnwindSafe for IndexerIt<I> where
I: RefUnwindSafe,
impl<I> RefUnwindSafe for IndexerIt<I> where
I: RefUnwindSafe, impl<I> UnwindSafe for IndexerIt<I> where
I: UnwindSafe,
impl<I> UnwindSafe for IndexerIt<I> where
I: UnwindSafe,