Trait rustc_data_structures::graph::WithPredecessors[−][src]

pub trait WithPredecessors: DirectedGraph where
    Self: for<'graph> GraphPredecessors<'graph, Item = Self::Node>, {
    fn predecessors(&self, node: Self::Node) -> Self::Iter;
}

Required methods

`fn predecessors(&self, node: Self::Node) -> Self::Iter`[src]

Loading content...

Implementations on Foreign Types

`impl<'graph, G: WithPredecessors> WithPredecessors for &'graph G`[src]

`fn predecessors( &self, node: Self::Node ) -> <&'graph G as GraphPredecessors<'_>>::IterⓘNotable traits for &'_ mut I impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;`[src]

Loading content...

Implementors

Loading content...

Trait rustc_data_structures::graph::WithPredecessors[−][src]

Required methods

fn predecessors(&self, node: Self::Node) -> Self::Iter[src]

Implementations on Foreign Types

impl<'graph, G: WithPredecessors> WithPredecessors for &'graph G[src]

fn predecessors( &self, node: Self::Node) -> <&'graph G as GraphPredecessors<'_>>::IterⓘNotable traits for &'_ mut Iimpl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;[src]

Notable traits for &'_ mut I

Implementors

`fn predecessors(&self, node: Self::Node) -> Self::Iter`[src]

`impl<'graph, G: WithPredecessors> WithPredecessors for &'graph G`[src]

`fn predecessors( &self, node: Self::Node ) -> <&'graph G as GraphPredecessors<'_>>::IterⓘNotable traits for &'_ mut I impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;`[src]