Expand description
Concurrent dependency graph construction.
Starting from an entry file, discovers all reachable modules by parsing imports and resolving them against the filesystem in parallel using a lock-free work queue and rayon thread pool.
Structs§
- Build
Result - Result of building a module graph.
Functions§
- build_
graph - Build a complete
ModuleGraphfrom the given entry point. Phase 1 concurrently discovers files using a lock-free work queue. Phase 2 serially constructs the graph from sorted discovery results.