⚡ Bolt: Optimize dependency resolution parsing loop - #200
Conversation
…ast token scanner 💡 What: Replaced the full `parser.parse()` call in `cli/src/project.rs` `resolve_dependencies` with a lightweight, token-based scanner that directly extracts module paths from `import`, `use`, and `from` statements. 🎯 Why: Resolving dependencies previously required fully parsing every file (generating an entire AST) just to extract import statements at the top. This caused an N+1 parsing loop that severely degraded performance on large projects. 📊 Impact: Expected to significantly reduce project build times (especially dependency resolution phase) by completely bypassing memory-heavy AST allocations during the initial dependency graph discovery. 🔬 Measurement: A localized test with 1000 files showed that `tsc build` avoided massive AST overhead. Co-authored-by: Tcode-Motion <188012755+Tcode-Motion@users.noreply.github.com>
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
1 participant
💡 What: Replaced the full AST parser execution in
cli/src/project.rsresolve_dependencieswith a lightweight manual token scanner. It directly scans the lexed token stream forImport,Use, andFromstatements and extracts the module paths.🎯 Why: To eliminate an N+1 parsing bottleneck. Previously, dependency resolution fully parsed the entire source file to an Abstract Syntax Tree just to find import statements, consuming excessive CPU time and memory for large projects.
📊 Impact: Substantially accelerates project builds by bypassing full AST generation during the initial dependency resolution phase.
🔬 Measurement: Tested locally on a mock project with 1000 files; avoiding the full parse bypasses massive memory allocations and CPU overhead during
tsc builddependency discovery.PR created automatically by Jules for task 2084523091139740812 started by @Tcode-Motion