Struct ModuleGraph 

pub struct ModuleGraph { /* private fields */ }

Canonical module graph — the single source of truth for import resolution.

Built before compilation; modules compile in topo_order so that dependencies are always available when a module is compiled.

Implementations

impl ModuleGraph

pub fn new( nodes: Vec<ModuleNode>, path_to_id: HashMap<String, ModuleId>, topo_order: Vec<ModuleId>, root_id: ModuleId, ) -> Self

Create a new graph from pre-built components.

Used by the graph builder after all nodes, interfaces, and edges have been constructed and topologically sorted.

pub fn id_for_path(&self, path: &str) -> Option<ModuleId>

Look up a module by its canonical path.

pub fn node(&self, id: ModuleId) -> &ModuleNode

Get a module node by id.

pub fn node_mut(&mut self, id: ModuleId) -> &mut ModuleNode

Get a mutable module node by id.

pub fn topo_order(&self) -> &[ModuleId]

Topological compilation order (dependencies before dependents). Does NOT include the root module — that is compiled separately.

pub fn root_id(&self) -> ModuleId

The root module id.

pub fn nodes(&self) -> &[ModuleNode]

All nodes in the graph.

pub fn len(&self) -> usize

Number of modules in the graph.

pub fn is_empty(&self) -> bool

Whether the graph is empty.

pub fn contains(&self, path: &str) -> bool

Check if a canonical path is registered in the graph.

Trait Implementations

impl Clone for ModuleGraph

fn clone(&self) -> ModuleGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModuleGraph

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

Formats the value using the given formatter.