Struct rustc_ap_rustc_data_structures::graph::implementation::Graph [−][src]
Implementations
impl<N: Debug, E: Debug> Graph<N, E>[src]
pub fn new() -> Graph<N, E>[src]
pub fn with_capacity(nodes: usize, edges: usize) -> Graph<N, E>[src]
pub fn all_nodes(&self) -> &[Node<N>]ⓘ[src]
pub fn len_nodes(&self) -> usize[src]
pub fn all_edges(&self) -> &[Edge<E>]ⓘ[src]
pub fn len_edges(&self) -> usize[src]
pub fn next_node_index(&self) -> NodeIndex[src]
pub fn add_node(&mut self, data: N) -> NodeIndex[src]
pub fn mut_node_data(&mut self, idx: NodeIndex) -> &mut Nⓘ[src]
pub fn node_data(&self, idx: NodeIndex) -> &Nⓘ[src]
pub fn node(&self, idx: NodeIndex) -> &Node<N>[src]
pub fn next_edge_index(&self) -> EdgeIndex[src]
pub fn add_edge(
&mut self,
source: NodeIndex,
target: NodeIndex,
data: E
) -> EdgeIndex[src]
&mut self,
source: NodeIndex,
target: NodeIndex,
data: E
) -> EdgeIndex
pub fn edge(&self, idx: EdgeIndex) -> &Edge<E>[src]
pub fn enumerated_nodes(&self) -> impl Iterator<Item = (NodeIndex, &Node<N>)>[src]
pub fn enumerated_edges(&self) -> impl Iterator<Item = (EdgeIndex, &Edge<E>)>[src]
pub fn each_node<'a>(
&'a self,
mut f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool[src]
&'a self,
mut f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool
Iterates over all edges defined in the graph.
pub fn each_edge<'a>(
&'a self,
mut f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool
) -> bool[src]
&'a self,
mut f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool
) -> bool
Iterates over all edges defined in the graph
pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);[src]
Notable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);[src]
Notable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);pub fn adjacent_edges(
&self,
source: NodeIndex,
direction: Direction
) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);[src]
&self,
source: NodeIndex,
direction: Direction
) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);pub fn successor_nodes<'a>(
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a[src]
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
pub fn predecessor_nodes<'a>(
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a[src]
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a
pub fn depth_traverse(
&self,
start: NodeIndex,
direction: Direction
) -> DepthFirstTraversal<'_, N, E>ⓘNotable traits for DepthFirstTraversal<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;[src]
&self,
start: NodeIndex,
direction: Direction
) -> DepthFirstTraversal<'_, N, E>ⓘ
Notable traits for DepthFirstTraversal<'g, N, E>
impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;pub fn nodes_in_postorder(
&self,
direction: Direction,
entry_node: NodeIndex
) -> Vec<NodeIndex>ⓘ[src]
&self,
direction: Direction,
entry_node: NodeIndex
) -> Vec<NodeIndex>ⓘ
Auto Trait Implementations
impl<N, E> RefUnwindSafe for Graph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe, [src]
E: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, E> Send for Graph<N, E> where
E: Send,
N: Send, [src]
E: Send,
N: Send,
impl<N, E> Sync for Graph<N, E> where
E: Sync,
N: Sync, [src]
E: Sync,
N: Sync,
impl<N, E> Unpin for Graph<N, E> where
E: Unpin,
N: Unpin, [src]
E: Unpin,
N: Unpin,
impl<N, E> UnwindSafe for Graph<N, E> where
E: UnwindSafe,
N: UnwindSafe, [src]
E: UnwindSafe,
N: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut Tⓘ[src]
impl<'a, T> Captures<'a> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> Erased for T[src]
impl<T> From<T> for T[src]
impl<T> Instrument for T[src]
pub fn instrument(self, span: Span) -> Instrumented<Self>[src]
pub fn in_current_span(self) -> Instrumented<Self>[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,