Struct EntityGraph 

pub struct EntityGraph {
    pub entities: HashMap<String, EntityInfo>,
    pub edges: Vec<EntityRef>,
    pub dependents: HashMap<String, Vec<String>>,
    pub dependencies: HashMap<String, Vec<String>>,
}

A complete entity dependency graph for a set of files.

Fields

entities: HashMap<String, EntityInfo>

All entities indexed by ID

edges: Vec<EntityRef>

Edges: from_entity → [(to_entity, ref_type)]

dependents: HashMap<String, Vec<String>>

Reverse index: entity_id → entities that reference it

dependencies: HashMap<String, Vec<String>>

Forward index: entity_id → entities it references

Implementations

impl EntityGraph

pub fn build( root: &Path, file_paths: &[String], registry: &ParserRegistry, ) -> Self

Build an entity graph from a set of files.

Pass 1: Extract all entities from all files using the parser registry. Pass 2: For each entity, find identifier tokens and resolve them against the symbol table to create reference edges.

pub fn get_dependents(&self, entity_id: &str) -> Vec<&EntityInfo>

Get entities that depend on the given entity (reverse deps).

pub fn get_dependencies(&self, entity_id: &str) -> Vec<&EntityInfo>

Get entities that the given entity depends on (forward deps).

pub fn impact_analysis(&self, entity_id: &str) -> Vec<&EntityInfo>

Impact analysis: if the given entity changes, what else might be affected? Returns all transitive dependents (breadth-first), capped at 10k.

pub fn impact_analysis_capped( &self, entity_id: &str, max_visited: usize, ) -> Vec<&EntityInfo>

Impact analysis with a cap on maximum nodes visited. Returns transitive dependents up to the cap. Uses borrowed strings.

pub fn impact_count(&self, entity_id: &str, max_count: usize) -> usize

Count transitive dependents without collecting them (faster for large graphs). Uses borrowed strings to avoid allocation overhead.

pub fn update_from_changes( &mut self, changed_files: &[FileChange], root: &Path, registry: &ParserRegistry, )

Incrementally update the graph from a set of changed files.

Instead of rebuilding the entire graph, this only re-extracts entities from changed files and re-resolves their references. This is faster than a full rebuild when only a few files changed.

For each changed file:

• Deleted: remove all entities from that file, prune edges
• Added/Modified: remove old entities, extract new ones, rebuild references
• Renamed: update file paths in entity info

Trait Implementations

impl Debug for EntityGraph

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

Formats the value using the given formatter.