Struct fera_graph::traverse::Add1
source · pub struct Add1<'a, T: 'a>(pub &'a mut T);
Tuple Fields
0: &'a mut T
Trait Implementations
sourceimpl<'a, G, T> VisitEdge<G> for Add1<'a, T>where
G: WithEdge,
T: Counter,
impl<'a, G, T> VisitEdge<G> for Add1<'a, T>where
G: WithEdge,
T: Counter,
fn visit_edge(&mut self, _g: &G, _e: Edge<G>) -> Control
sourceimpl<'a, G, T> VisitVertex<G> for Add1<'a, T>where
G: WithEdge,
T: Counter,
impl<'a, G, T> VisitVertex<G> for Add1<'a, T>where
G: WithEdge,
T: Counter,
fn visit_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control
Auto Trait Implementations
impl<'a, T> RefUnwindSafe for Add1<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for Add1<'a, T>where
T: Send,
impl<'a, T> Sync for Add1<'a, T>where
T: Sync,
impl<'a, T> Unpin for Add1<'a, T>
impl<'a, T> !UnwindSafe for Add1<'a, T>
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