[−][src]Struct rustc_ap_rustc_data_structures::graph::implementation::Graph

pub struct Graph<N, E> { /* fields omitted */ }

Methods

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]

ⓘImportant traits for &'_ mut [u8]
pub fn all_nodes(&self) -> &[Node<N>][src]

pub fn len_nodes(&self) -> usize[src]

ⓘImportant traits for &'_ mut [u8]
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]

ⓘImportant traits for &'_ mut I
pub fn mut_node_data(&mut self, idx: NodeIndex) -> &mut N[src]

ⓘImportant traits for &'_ mut I
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]

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,
    f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool[src]

Iterates over all edges defined in the graph.

pub fn each_edge<'a>(
    &'a self,
    f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool
) -> bool[src]

Iterates over all edges defined in the graph

ⓘImportant traits for AdjacentEdges<'g, N, E>
pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>[src]

ⓘImportant traits for AdjacentEdges<'g, N, E>
pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>[src]

ⓘImportant traits for AdjacentEdges<'g, N, E>
pub fn adjacent_edges(
    &self,
    source: NodeIndex,
    direction: Direction
) -> AdjacentEdges<N, E>[src]

pub fn successor_nodes<'a>(
    &'a self,
    source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a[src]

pub fn predecessor_nodes<'a>(
    &'a self,
    target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a[src]

ⓘImportant traits for DepthFirstTraversal<'g, N, E>
pub fn depth_traverse(
    &self,
    start: NodeIndex,
    direction: Direction
) -> DepthFirstTraversal<N, E>[src]

pub fn nodes_in_postorder(
    &self,
    direction: Direction,
    entry_node: NodeIndex
) -> Vec<NodeIndex>[src]

Auto Trait Implementations

impl<N, E> RefUnwindSafe for Graph<N, E> where
    E: RefUnwindSafe,
    N: RefUnwindSafe, 

impl<N, E> Send for Graph<N, E> where
    E: Send,
    N: Send, 

impl<N, E> Sync for Graph<N, E> where
    E: Sync,
    N: Sync, 

impl<N, E> Unpin for Graph<N, E> where
    E: Unpin,
    N: Unpin, 

impl<N, E> UnwindSafe for Graph<N, E> where
    E: UnwindSafe,
    N: 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<'a, T> Captures<'a> for T where
    T: ?Sized, [src]

impl<T> Erased for T[src]

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

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

impl<E> SpecializationError for E[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.