[][src]Struct petgraph::visit::NodeFilteredEdgeReferences

pub struct NodeFilteredEdgeReferences<'a, G, I, F: 'a> { /* fields omitted */ }

A filtered edges iterator.

Trait Implementations

impl<'a, G, I, F> Iterator for NodeFilteredEdgeReferences<'a, G, I, F> where
    F: FilterNode<G::NodeId>,
    G: IntoEdgeReferences,
    I: Iterator<Item = G::EdgeRef>, 
[src]

type Item = I::Item

The type of the elements being iterated over.

Auto Trait Implementations

impl<'a, G, I, F> RefUnwindSafe for NodeFilteredEdgeReferences<'a, G, I, F> where
    F: RefUnwindSafe,
    G: RefUnwindSafe,
    I: RefUnwindSafe

impl<'a, G, I, F> Send for NodeFilteredEdgeReferences<'a, G, I, F> where
    F: Sync,
    G: Send,
    I: Send

impl<'a, G, I, F> Sync for NodeFilteredEdgeReferences<'a, G, I, F> where
    F: Sync,
    G: Sync,
    I: Sync

impl<'a, G, I, F> Unpin for NodeFilteredEdgeReferences<'a, G, I, F> where
    G: Unpin,
    I: Unpin

impl<'a, G, I, F> UnwindSafe for NodeFilteredEdgeReferences<'a, G, I, F> where
    F: RefUnwindSafe,
    G: UnwindSafe,
    I: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<N, E, I> ElementIterator<N, E> for I where
    I: Iterator<Item = Element<N, E>> + ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<I> IntoIterator for I where
    I: Iterator
[src]

type Item = <I as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = I

Which kind of iterator are we turning this into?

impl<I> IteratorRandom for I where
    I: Iterator
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.