Struct NamespaceGraph 

pub struct NamespaceGraph { /* private fields */ }

A graph of modules, concrete items, submodule declarations, and imports known to the linker.

This is intentionally narrower than the full linker graph: it answers namespace questions only, and does not know about package linkage, MAST forests, call graph state, or AST rewrites.

Implementations

impl NamespaceGraph

pub fn build(linker: &Linker) -> Result<Self, LinkerError>

Build a namespace graph from the modules currently registered in linker.

pub fn find_module_index(&self, path: &Path) -> Option<ModuleIndex>

Find a module by exact path.

pub fn module(&self, id: ModuleIndex) -> &ModuleNode

Get a module node by id.

pub fn reachable_from_root(&self, root: ModuleIndex) -> Vec<ModuleIndex>

Return every module reachable from root by following public submodule declarations.

pub fn resolve_imports( &self, linker: &Linker, ) -> Result<ResolvedImports, LinkerError>

Resolve all path imports without consulting any imports from the importing module.

pub fn resolve_code_path( &self, owner: ModuleIndex, path: Span<&Path>, imports: &ResolvedImports, linker: &Linker, ) -> Result<ResolvedUse, LinkerError>

Resolve a path referenced from code in owner.

Unlike import declarations, code references may start with a local import alias. Imports are still not expanded recursively here; this only consults the already-resolved import table.

Trait Implementations

impl Clone for NamespaceGraph

fn clone(&self) -> NamespaceGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NamespaceGraph

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

Formats the value using the given formatter.