Struct fera_graph::traverse::EmptyVisitor

pub struct EmptyVisitor;

Trait Implementations

impl Clone for EmptyVisitor

fn clone(&self) -> EmptyVisitor

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for EmptyVisitor

impl Debug for EmptyVisitor

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

Formats the value using the given formatter.

impl PartialEq for EmptyVisitor

fn eq(&self, __arg_0: &EmptyVisitor) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl Eq for EmptyVisitor

impl<G: WithEdge> Visitor<G> for EmptyVisitor

fn start(&mut self, _g: &G) -> Control

fn finish(&mut self, _g: &G) -> Control

fn discover_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn finish_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn discover_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn finish_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn discover_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn finish_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_tree_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn finish_tree_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_back_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_cross_or_forward_edge(&mut self, _g: &G, _e: Edge<G>) -> Control