Struct CallGraph 

pub struct CallGraph { /* private fields */ }

A call graph representing which words call which other words.

Implementations

impl CallGraph

pub fn build(program: &Program) -> Self

Build a call graph from a program.

This extracts all word-to-word call relationships, including calls within quotations, if branches, and match arms.

pub fn is_recursive(&self, word: &str) -> bool

Check if a word is part of any recursive cycle (direct or mutual).

pub fn are_mutually_recursive(&self, word1: &str, word2: &str) -> bool

Check if two words are in the same recursive cycle (mutually recursive).

pub fn recursive_cycles(&self) -> &[HashSet<String>]

Get all recursive cycles (SCCs with recursion).

pub fn callees(&self, word: &str) -> Option<&HashSet<String>>

Get the words that a given word calls.

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.