Struct rustc_data_structures::graph::Graph
[−]
[src]
pub struct Graph<N, E> { /* fields omitted */ }
🔬 This is a nightly-only experimental API. (
rustc_private
)Methods
impl<N: Debug, E: Debug> Graph<N, E>
[src]
fn new() -> Graph<N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn all_nodes(&self) -> &[Node<N>]
🔬 This is a nightly-only experimental API. (
rustc_private
)fn len_nodes(&self) -> usize
🔬 This is a nightly-only experimental API. (
rustc_private
)fn all_edges(&self) -> &[Edge<E>]
🔬 This is a nightly-only experimental API. (
rustc_private
)fn len_edges(&self) -> usize
🔬 This is a nightly-only experimental API. (
rustc_private
)fn next_node_index(&self) -> NodeIndex
🔬 This is a nightly-only experimental API. (
rustc_private
)fn add_node(&mut self, data: N) -> NodeIndex
🔬 This is a nightly-only experimental API. (
rustc_private
)fn mut_node_data(&mut self, idx: NodeIndex) -> &mut N
🔬 This is a nightly-only experimental API. (
rustc_private
)fn node_data(&self, idx: NodeIndex) -> &N
🔬 This is a nightly-only experimental API. (
rustc_private
)fn node(&self, idx: NodeIndex) -> &Node<N>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn next_edge_index(&self) -> EdgeIndex
🔬 This is a nightly-only experimental API. (
rustc_private
)fn add_edge(&mut self,
source: NodeIndex,
target: NodeIndex,
data: E)
-> EdgeIndex
source: NodeIndex,
target: NodeIndex,
data: E)
-> EdgeIndex
🔬 This is a nightly-only experimental API. (
rustc_private
)fn mut_edge_data(&mut self, idx: EdgeIndex) -> &mut E
🔬 This is a nightly-only experimental API. (
rustc_private
)fn edge_data(&self, idx: EdgeIndex) -> &E
🔬 This is a nightly-only experimental API. (
rustc_private
)fn edge(&self, idx: EdgeIndex) -> &Edge<E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn first_adjacent(&self, node: NodeIndex, dir: Direction) -> EdgeIndex
🔬 This is a nightly-only experimental API. (
rustc_private
)Accesses the index of the first edge adjacent to node
.
This is useful if you wish to modify the graph while walking
the linked list of edges.
fn next_adjacent(&self, edge: EdgeIndex, dir: Direction) -> EdgeIndex
🔬 This is a nightly-only experimental API. (
rustc_private
)Accesses the next edge in a given direction. This is useful if you wish to modify the graph while walking the linked list of edges.
fn enumerated_nodes(&self) -> EnumeratedNodes<N>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn enumerated_edges(&self) -> EnumeratedEdges<E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn each_node<'a, F>(&'a self, f: F) -> bool where F: FnMut(NodeIndex, &'a Node<N>) -> bool
🔬 This is a nightly-only experimental API. (
rustc_private
)Iterates over all edges defined in the graph.
fn each_edge<'a, F>(&'a self, f: F) -> bool where F: FnMut(EdgeIndex, &'a Edge<E>) -> bool
🔬 This is a nightly-only experimental API. (
rustc_private
)Iterates over all edges defined in the graph
fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn adjacent_edges(&self,
source: NodeIndex,
direction: Direction)
-> AdjacentEdges<N, E>
source: NodeIndex,
direction: Direction)
-> AdjacentEdges<N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn successor_nodes(&self, source: NodeIndex) -> AdjacentTargets<N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn predecessor_nodes(&self, target: NodeIndex) -> AdjacentSources<N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn iterate_until_fixed_point<'a, F>(&'a self, op: F) where F: FnMut(usize, EdgeIndex, &'a Edge<E>) -> bool
🔬 This is a nightly-only experimental API. (
rustc_private
)A common use for graphs in our compiler is to perform fixed-point iteration. In this case, each edge represents a constraint, and the nodes themselves are associated with variables or other bitsets. This method facilitates such a computation.
fn depth_traverse<'a>(&'a self,
start: NodeIndex,
direction: Direction)
-> DepthFirstTraversal<'a, N, E>
start: NodeIndex,
direction: Direction)
-> DepthFirstTraversal<'a, N, E>
🔬 This is a nightly-only experimental API. (
rustc_private
)fn is_node_cyclic(&self, starting_node_index: NodeIndex) -> bool
🔬 This is a nightly-only experimental API. (
rustc_private
)Whether or not a node can be reached from itself.