Struct ModuleGraph 

pub struct ModuleGraph {
    pub modules: Vec<ModuleInfo>,
    pub global_dynamic: bool,
    /* private fields */
}

The whole project graph.

Fields

modules: Vec<ModuleInfo>

global_dynamic: bool

True if any module in the project has a dynamic dispatch/import sink.

Implementations

impl ModuleGraph

pub fn build(root: &Utf8Path, files: &[Utf8PathBuf]) -> Self

Parse all files (in parallel) and build the graph.

pub fn unresolved_imports(&self) -> Vec<UnresolvedImport>

Imports that look internal but resolve to no module in the project: every relative import that fails to resolve, plus absolute imports under a first-party top-level package that fail to resolve. These are typically a typo or a broken refactor — distinct from third-party missing-dependency.

pub fn unused_files(&self) -> Vec<&ModuleInfo>

Files that are neither entries nor reachable from any entry.

pub fn symbol_used(&self, module: FileId, name: &str, defs_named: u32) -> bool

Whether a symbol defined in module is referenced internally or by any importer of that module. defs_named is how many top-level defs share the name (to discount the definition site in the internal count).

pub fn edge_count(&self) -> usize

pub fn import_edges(&self) -> Vec<(&str, &str)>

Internal import edges as (importer dotted, imported dotted) pairs. Used by the architecture-boundary engine.

pub fn path_of_dotted(&self, dotted: &str) -> Option<&Utf8Path>

The path of a module by its dotted name (first match), for findings.

pub fn find_cycles(&self) -> Vec<Vec<FileId>>

Find import cycles: strongly-connected components of size > 1, plus self-loops. Tarjan’s algorithm; results are deterministic (each cycle’s members sorted, and the list sorted). Cross-module circular imports.