Struct HandlerCallGraph 

pub struct HandlerCallGraph { /* private fields */ }

Build-time analysis structure for circular dependency detection

Feature T130 - Not Yet Integrated

This structure is used for static analysis of handler dependencies to detect circular call chains at compile time. It is not yet integrated into the handler registration or dispatch system.

Example

use dampen_core::handler::HandlerCallGraph;

let mut graph = HandlerCallGraph::new();
graph.add_dependency("handler_a", "handler_b");
graph.add_dependency("handler_b", "handler_c");

if let Some(cycle) = graph.detect_cycles() {
    println!("Circular dependency detected: {:?}", cycle);
}

Implementations

impl HandlerCallGraph

pub fn new() -> Self

Create a new empty call graph

pub fn add_dependency(&mut self, from: &str, to: &str)

Add a dependency edge (from depends on to)

pub fn would_create_cycle(&self, from: &str, to: &str) -> bool

Detect if adding edge would create a cycle

pub fn dependents_of(&self, handler: &str) -> Vec<String>

Get all handlers that depend on the given handler

pub fn detect_cycles(&self) -> Option<Vec<String>>

Detect cycles in the call graph using DFS

Trait Implementations

impl Clone for HandlerCallGraph

fn clone(&self) -> HandlerCallGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HandlerCallGraph

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

Formats the value using the given formatter.

impl Default for HandlerCallGraph

fn default() -> Self

Returns the “default value” for a type.