Struct rustc::cfg::graphviz::LabelledCFG [−] [src]

pub struct LabelledCFG<'a, 'ast: 'a> {
    pub ast_map: &'a Map<'ast>,
    pub cfg: &'a CFG,
    pub name: String,
    pub labelled_edges: bool,
}
Unstable (rustc_private)

Fields

ast_map: &'a Map<'ast>
Unstable (rustc_private)
cfg: &'a CFG
Unstable (rustc_private)
name: String
Unstable (rustc_private)
labelled_edges: bool
Unstable (rustc_private)
[−]

labelled_edges controls whether we emit labels on the edges

Trait Implementations

impl<'a, 'ast> Labeller<'a> for LabelledCFG<'a, 'ast>
[src]

type Node = Node<'a>

type Edge = Edge<'a>

fn graph_id(&'a self) -> Id<'a>[−]

Must return a DOT compatible identifier naming the graph.

fn node_id(&'a self, (i, _): &Node<'a>) -> Id<'a>[−]

Maps n to a unique identifier with respect to self. The implementor is responsible for ensuring that the returned name is a valid DOT identifier. Read more

fn node_label(&'a self, (i, n): &Node<'a>) -> LabelText<'a>[−]

Maps n to a label that will be used in the rendered output. The label need not be unique, and may be the empty string; the default is just the output from node_id. Read more

fn edge_label(&self, e: &Edge<'a>) -> LabelText<'a>[−]

Maps e to a label that will be used in the rendered output. The label need not be unique, and may be the empty string; the default is in fact the empty string. Read more

fn node_shape(&'a self, _node: &Self::Node) -> Option<LabelText<'a>>[−]

Maps n to one of the [graphviz shape names][1]. If None is returned, no shape attribute is specified. Read more

fn node_style(&'a self, _n: &Self::Node) -> Style[−]

Maps n to a style that will be used in the rendered output.

fn edge_style(&'a self, _e: &Self::Edge) -> Style[−]

Maps e to a style that will be used in the rendered output.

impl<'a, 'ast> GraphWalk<'a> for LabelledCFG<'a, 'ast>
[src]

type Node = Node<'a>

type Edge = Edge<'a>

fn nodes(&'a self) -> Nodes<'a, Node<'a>>[−]

Returns all the nodes in this graph.

fn edges(&'a self) -> Edges<'a, Edge<'a>>[−]

Returns all of the edges in this graph.

fn source(&'a self, edge: &Edge<'a>) -> Node<'a>[−]

The source node for edge.

fn target(&'a self, edge: &Edge<'a>) -> Node<'a>[−]

The target node for edge.