Struct fera_graph::traverse::RecordParent
source · pub struct RecordParent<'a, P: 'a>(pub &'a mut P);
Tuple Fields
0: &'a mut P
Trait Implementations
sourceimpl<'a, G, P> Visitor<G> for RecordParent<'a, P>where
G: WithEdge,
P: VertexPropMut<G, OptionVertex<G>>,
impl<'a, G, P> Visitor<G> for RecordParent<'a, P>where
G: WithEdge,
P: VertexPropMut<G, OptionVertex<G>>,
fn discover_root_vertex(&mut self, _g: &G, v: Vertex<G>) -> Control
fn discover_tree_edge(&mut self, g: &G, e: Edge<G>) -> Control
fn start(&mut self, _g: &G) -> Control
fn finish(&mut self, _g: &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 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
Auto Trait Implementations
impl<'a, P> RefUnwindSafe for RecordParent<'a, P>where
P: RefUnwindSafe,
impl<'a, P> Send for RecordParent<'a, P>where
P: Send,
impl<'a, P> Sync for RecordParent<'a, P>where
P: Sync,
impl<'a, P> Unpin for RecordParent<'a, P>
impl<'a, P> !UnwindSafe for RecordParent<'a, P>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more