Struct StackGraph 

#[non_exhaustive]
pub struct StackGraph {
    pub nodes: BTreeMap<NodeId, StackNode>,
    pub edges: BTreeMap<NodeId, BTreeMap<NodeId, i64>>,
}

The stack graph: every push/pop/scope node plus the paths between them.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

nodes: BTreeMap<NodeId, StackNode>

Every node, keyed by id.

edges: BTreeMap<NodeId, BTreeMap<NodeId, i64>>

Adjacency: source id -> sink id -> the edge’s precedence.

Implementations

impl StackGraph

pub fn new() -> Self

An empty stack graph.

pub fn add_node(&mut self, id: NodeId, node: StackNode)

Inserts node under id, replacing any node already there.

pub fn add_edge(&mut self, source: NodeId, sink: NodeId, precedence: i64)

Connects source to sink, keeping the higher precedence on repeat.

pub fn successors(&self, id: NodeId) -> Vec<(NodeId, i64)>

id’s outgoing edges, as (sink, precedence) pairs.

pub fn predecessors(&self, id: NodeId) -> Vec<NodeId>

Ids of every node with an edge into id.

Trait Implementations

impl Clone for StackGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StackGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for StackGraph

fn default() -> Self

Returns the “default value” for a type.

impl Eq for StackGraph

impl PartialEq for StackGraph

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for StackGraph