Struct rs_graph::adjacencies::FilterAdjacencies
source · pub struct FilterAdjacencies<A, P>(_, _);
Trait Implementations§
source§impl<'a, A, P> Adjacencies<'a> for FilterAdjacencies<A, P>where
A: Adjacencies<'a>,
P: 'a + Clone + for<'r> Fn(&'r (A::Edge, A::Node)) -> bool,
impl<'a, A, P> Adjacencies<'a> for FilterAdjacencies<A, P>where A: Adjacencies<'a>, P: 'a + Clone + for<'r> Fn(&'r (A::Edge, A::Node)) -> bool,
type Node = <A as Adjacencies<'a>>::Node
type Edge = <A as Adjacencies<'a>>::Edge
type IncidenceIt = Filtered<<A as Adjacencies<'a>>::IncidenceIt>
fn neigh_iter(&self, u: Self::Node) -> Self::IncidenceIt
fn neighs<'b>(&'b self, u: Self::Node) -> GraphIter<'b, Self, Self::IncidenceIt> ⓘwhere Self: Sized, 'a: 'b,
fn filter<P>(self, predicate: P) -> FilterAdjacencies<Self, P>where Self: Sized, P: for<'r> Fn(&'r (Self::Edge, Self::Node)) -> bool,
source§impl<A, P, I> GraphIterator<FilterAdjacencies<A, P>> for Filtered<I>where
I: GraphIterator<A>,
P: for<'r> Fn(&'r I::Item) -> bool,
impl<A, P, I> GraphIterator<FilterAdjacencies<A, P>> for Filtered<I>where I: GraphIterator<A>, P: for<'r> Fn(&'r I::Item) -> bool,
Auto Trait Implementations§
impl<A, P> RefUnwindSafe for FilterAdjacencies<A, P>where A: RefUnwindSafe, P: RefUnwindSafe,
impl<A, P> Send for FilterAdjacencies<A, P>where A: Send, P: Send,
impl<A, P> Sync for FilterAdjacencies<A, P>where A: Sync, P: Sync,
impl<A, P> Unpin for FilterAdjacencies<A, P>where A: Unpin, P: Unpin,
impl<A, P> UnwindSafe for FilterAdjacencies<A, P>where A: UnwindSafe, P: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more