Struct EmptyVisitor 

pub struct EmptyVisitor;

Trait Implementations

impl Clone for EmptyVisitor

fn clone(&self) -> EmptyVisitor

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EmptyVisitor

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

Formats the value using the given formatter.

impl PartialEq for EmptyVisitor

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<G> Visitor<G> for EmptyVisitor

where G: WithEdge,

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

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

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

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

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

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

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

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

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

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

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

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

impl Copy for EmptyVisitor

impl Eq for EmptyVisitor

impl StructuralPartialEq for EmptyVisitor