Struct daggy::walker::Peekable

pub struct Peekable<G, W> where
    W: Walker<G>,  { /* fields omitted */ }

A walker that has a .peek(&graph) method that returns an optional next neighbor.

Implementations

impl<G, W> Peekable<G, W> where
    G: GraphRef,
    W: Walker<G>, 

pub fn new(walker: W) -> Self

Create a new Peekable walker.

pub fn peek(&mut self, graph: G) -> Option<&W::Item>

The edge node index pair of the neighbor at the next step in our walk of the given graph.

Trait Implementations

impl<G: Clone, W: Clone> Clone for Peekable<G, W> where
    W: Walker<G>,
    W::Item: Clone, 

fn clone(&self) -> Peekable<G, W>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<G: Debug, W: Debug> Debug for Peekable<G, W> where
    W: Walker<G>,
    W::Item: Debug, 

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<G, W> Walker<G> for Peekable<G, W> where
    G: GraphRef,
    W: Walker<G>, 

type Item = W::Item

fn walk_next(&mut self, graph: G) -> Option<Self::Item>

Advance to the next item

fn iter(self, context: Context) -> WalkerIter<Self, Context> where
    Context: Clone, 

Create an iterator out of the walker and given context.