Struct AbstractGraph 

pub struct AbstractGraph {
    pub node_ops: HashMap<NodeId, AbstractNodeOp>,
    pub predecessors: HashMap<NodeId, Vec<NodeId>>,
    pub successors: HashMap<NodeId, Vec<NodeId>>,
    pub entry_nodes: Vec<NodeId>,
    pub exit_nodes: Vec<NodeId>,
}

Abstract representation of a ComputationGraph used by the abstract interpreter.

The structure stores per-node operation kinds plus pre-computed successor/predecessor adjacency in topological-friendly form so the Kildall fixed-point worklist can iterate without paying for repeated graph queries.

Fields

node_ops: HashMap<NodeId, AbstractNodeOp>

Operation kind for each node.

predecessors: HashMap<NodeId, Vec<NodeId>>

Operands (predecessors) of each node, in input order.

successors: HashMap<NodeId, Vec<NodeId>>

Successors of each node.

entry_nodes: Vec<NodeId>

Nodes with no predecessors (entries to the analysis).

exit_nodes: Vec<NodeId>

Nodes with no successors (analysis sinks).

Implementations

impl AbstractGraph

pub fn new() -> Self

Create an empty abstract graph.

pub fn nodes(&self) -> impl Iterator<Item = NodeId> + '_

Iterate over all nodes in the graph.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn successors_of(&self, node: NodeId) -> &[NodeId]

Successors of node (empty slice if none).

pub fn predecessors_of(&self, node: NodeId) -> &[NodeId]

Predecessors of node (empty slice if none).

Trait Implementations

impl Clone for AbstractGraph

fn clone(&self) -> AbstractGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AbstractGraph

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

Formats the value using the given formatter.

impl Default for AbstractGraph

fn default() -> AbstractGraph

Returns the “default value” for a type.