Struct ModuleGraph 

pub struct ModuleGraph { /* private fields */ }

Slotted, incrementally maintained repository module graph.

Implementations

impl ModuleGraph

pub fn new() -> Self

Creates an empty graph.

pub fn set_universe_complete(&mut self, complete: bool)

Records whether the caller has supplied a complete source universe.

pub fn generation(&self) -> u64

Returns the graph mutation generation.

pub fn resolver_generation(&self) -> u64

Returns the resolver configuration generation.

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

Returns whether an analyzed node has the supplied content hash.

pub fn node(&self, path: &str) -> Option<&ModuleNode>

Returns an occupied node by path.

pub fn rdeps_paths(&self, path: &str) -> Option<Vec<CompactString>>

Sorted importer paths of path — a slot-history-independent view of the reverse-dependency set.

pub fn upsert_file( &mut self, analysis: &FileAnalysis, resolvers: &ResolverSet, imports_supported: bool, ) -> UpsertOutcome

Inserts or refreshes one file analysis.

imports_supported should be computed from the same language registry that produced analysis.

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

Removes an analyzed file.

A referenced node is demoted to a stub in the same slot. Unreferenced nodes are freed, and outgoing reverse-dependency memberships are removed incrementally.

pub fn reresolve_all(&mut self, resolvers: &ResolverSet)

Re-resolves every analyzed node against a new resolver generation.

Reverse dependencies are adjusted by target-set diffs for each node; they are never rebuilt globally.

pub fn bump_resolver_generation(&mut self)

Advances only the resolver generation, leaving current edges stale.

pub fn config_dependencies(&self) -> Vec<CompactString>

Returns the deduplicated union of resolver configuration dependencies.

pub fn paths(&self) -> impl Iterator<Item = &str>

Iterates over occupied node paths in slot order.

pub fn edges(&self) -> impl Iterator<Item = DepEdge> + '_

Iterates over every stored edge with graph slots materialized as paths.

pub fn edge_count(&self) -> usize

Returns the total number of resolved, external, and unresolved edges.

pub fn deps(&self, path: &str) -> Option<DepsResult>

Returns direct outgoing dependencies for path.

pub fn rdeps_guarantee_for(&self, path: &str) -> Option<Guarantee>

Reverse-dependency guarantee without materializing importer edges.

pub fn rdeps_bounded(&self, path: &str, limit: usize) -> Option<DepsResult>

Returns at most limit stored edges that directly target path.

pub fn rdeps(&self, path: &str) -> Option<DepsResult>

Returns all stored edges that directly target path.

pub fn neighborhood(&self, path: &str, depth: u32) -> Option<NeighborhoodResult>

Traverses both dependency directions to depth edges from path.

Trait Implementations

impl Debug for ModuleGraph

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

Formats the value using the given formatter.

impl Default for ModuleGraph

fn default() -> ModuleGraph

Returns the “default value” for a type.