Struct dsp::daggy::walker::Iter

pub struct Iter<'a, G, Ix, W> where G: 'a {
    // some fields omitted
}

An iterator yielding index pairs produced by its internal walker and graph.

Methods

impl<'a, G, Ix, W> Iter<'a, G, Ix, W>

fn edges(self) -> IterEdges<'a, G, Ix, W>

Convert to an iterator that only yields the edge indices.

fn nodes(self) -> IterNodes<'a, G, Ix, W>

Convert to an iterator that only yields the node indices.

Trait Implementations

impl<'a, G, Ix, W> Debug for Iter<'a, G, Ix, W> where G: 'a + Debug, Ix: Debug, W: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

impl<'a, G, Ix, W> Clone for Iter<'a, G, Ix, W> where G: 'a + Clone, Ix: Clone, W: Clone

fn clone(&self) -> Iter<'a, G, Ix, W>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, G, Ix, W> Iterator for Iter<'a, G, Ix, W> where Ix: IndexType, W: Walker<G, Index=Ix>

type Item = (EdgeIndex<Ix>, NodeIndex<Ix>)

fn next(&mut self) -> Option<(EdgeIndex<Ix>, NodeIndex<Ix>)>