Struct rs_graph::adjacencies::FilterAdjacencies [−][src]
pub struct FilterAdjacencies<A, P>(_, _);
Trait Implementations
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, [src]
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, [src]type IncidenceIt = Filtered<A::IncidenceIt>
fn neigh_iter(&self, u: Self::Node) -> Self::IncidenceIt[src]
fn neighs<'b>(&'b self, u: Self::Node) -> GraphIter<'b, Self, Self::IncidenceIt>ⓘ where
'a: 'b,
Self: Sized, [src]
'a: 'b,
Self: Sized,
fn filter<P>(self, predicate: P) -> FilterAdjacencies<Self, P> where
Self: Sized,
P: for<'r> Fn(&'r (Self::Edge, Self::Node)) -> bool, [src]
Self: Sized,
P: for<'r> Fn(&'r (Self::Edge, Self::Node)) -> bool,
impl<A, P, I> GraphIterator<FilterAdjacencies<A, P>> for Filtered<I> where
I: GraphIterator<A>,
P: for<'r> Fn(&'r I::Item) -> bool, [src]
impl<A, P, I> GraphIterator<FilterAdjacencies<A, P>> for Filtered<I> where
I: GraphIterator<A>,
P: for<'r> Fn(&'r I::Item) -> bool, [src]impl<'a, A, P> GraphType<'a> for FilterAdjacencies<A, P> where
A: Adjacencies<'a>, [src]
impl<'a, A, P> GraphType<'a> for FilterAdjacencies<A, P> where
A: Adjacencies<'a>, [src]Auto Trait Implementations
impl<A, P> RefUnwindSafe for FilterAdjacencies<A, P> where
A: RefUnwindSafe,
P: RefUnwindSafe,
A: RefUnwindSafe,
P: RefUnwindSafe,
impl<A, P> Send for FilterAdjacencies<A, P> where
A: Send,
P: Send,
A: Send,
P: Send,
impl<A, P> Sync for FilterAdjacencies<A, P> where
A: Sync,
P: Sync,
A: Sync,
P: Sync,
impl<A, P> Unpin for FilterAdjacencies<A, P> where
A: Unpin,
P: Unpin,
A: Unpin,
P: Unpin,
impl<A, P> UnwindSafe for FilterAdjacencies<A, P> where
A: UnwindSafe,
P: UnwindSafe,
A: UnwindSafe,
P: UnwindSafe,