pub struct FilterAdjacencies<A, P>(/* private fields */);
Trait Implementations§
Source§impl<'a, A, P> Adjacencies<'a> for FilterAdjacencies<A, P>
impl<'a, A, P> Adjacencies<'a> for FilterAdjacencies<A, P>
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>
Source§impl<A, P, I> GraphIterator<FilterAdjacencies<A, P>> for Filtered<I>
impl<A, P, I> GraphIterator<FilterAdjacencies<A, P>> for Filtered<I>
Auto Trait Implementations§
impl<A, P> Freeze for FilterAdjacencies<A, P>
impl<A, P> RefUnwindSafe for FilterAdjacencies<A, P>where
A: RefUnwindSafe,
P: RefUnwindSafe,
impl<A, P> Send for FilterAdjacencies<A, P>
impl<A, P> Sync for FilterAdjacencies<A, P>
impl<A, P> Unpin for FilterAdjacencies<A, P>
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more