Struct CrateDeps 

pub struct CrateDeps {
    pub deps: HashMap<String, Vec<String>>,
}

Crate dependency graph for transitive invalidation analysis.

When a file in crate A changes, crate A needs recompilation. If crate B depends on A, B also needs recompilation (its inputs changed). This propagates transitively through the dependency graph.

Fields

deps: HashMap<String, Vec<String>>

Crate name → list of crate names it depends on.

Implementations

impl CrateDeps

pub fn nusy_workspace() -> Self

Build the NuSy workspace dependency graph.

Hardcoded for the spike — a production version would parse Cargo.toml or use cargo metadata.

pub fn reverse_deps(&self) -> HashMap<String, Vec<String>>

Compute reverse dependencies: crate → set of crates that depend on it.

pub fn transitive_dirty(&self, dirty: &HashSet<String>) -> HashSet<String>

Given a set of directly dirty crates, compute the full set of crates needing recompilation (transitive dependents).