Struct CallGraph 

pub struct CallGraph {
    pub nodes: BTreeSet<DefinitionId>,
    pub edges: BTreeMap<DefinitionId, BTreeSet<DefinitionId>>,
}

A directed call graph over inferable definitions.

PartialEq/Eq (FG-2, issue #631): the salsa cutoff for call_graph_query in brink-db — an edit that leaves every def’s call targets unchanged leaves this equal, so scc_membership_query and every solve_scc_query backdate instead of re-executing.

Fields

nodes: BTreeSet<DefinitionId>

edges: BTreeMap<DefinitionId, BTreeSet<DefinitionId>>

caller -> { callees }.

Implementations

impl CallGraph

pub fn new() -> Self

pub fn add_node(&mut self, def: DefinitionId)

pub fn add_edge(&mut self, from: DefinitionId, to: DefinitionId)

Record a resolved call/divert-target edge. Both endpoints are added as nodes if not already present (a call to a def with no inferable body of its own — e.g. an external — is simply never added as a node by the caller, so no edge is recorded for it; see infer_project’s node-selection pass).

Trait Implementations

impl Clone for CallGraph

fn clone(&self) -> CallGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CallGraph

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

Formats the value using the given formatter.

impl Default for CallGraph

fn default() -> CallGraph

Returns the “default value” for a type.

impl Eq for CallGraph

impl PartialEq for CallGraph

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for CallGraph