Skip to content

⚡ Bolt: Optimize dependency resolution parsing loop #200

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Tcode-Motion merged 1 commit into from
Sep 22, 2026
Merged

⚡ Bolt: Optimize dependency resolution parsing loop #200

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
76 changes: 66 additions & 10 deletions cli/src/project.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -178,19 +178,75 @@ impl ProjectBuildGraph {
let mut lexer = techscript_lexer::Lexer::new(source_file.source());
let tokens = lexer.lex(&mut reporter).unwrap_or_default();

// Fast token scan for dependency resolution to avoid N+1 full parsing loops
let mut imports = Vec::new();
let mut parser = techscript_parser::Parser::new(&tokens);
let mut parse_reporter = techscript_errors::DiagnosticReporter::new();
if let Ok(program) = parser.parse(&mut parse_reporter) {
for stmt in &program.statements {
if let techscript_ast::Statement::Import(import_stmt) = stmt {
let path_vec: Vec<String> = import_stmt
.path
.iter()
.map(|ident| ident.name.clone())
.collect();
let mut i = 0;
while i < tokens.len() {
let kind = &tokens[i].kind;

if *kind == techscript_syntax::TokenKind::Import
|| *kind == techscript_syntax::TokenKind::Use
{
i += 1;
let mut path_vec = Vec::new();
while i < tokens.len() {
let t = &tokens[i];
if t.kind == techscript_syntax::TokenKind::Identifier {
path_vec.push(t.lexeme.clone());
i += 1;
} else {
break;
}

if i < tokens.len() && tokens[i].kind == techscript_syntax::TokenKind::Dot {
i += 1;
} else {
break;
}
}
if !path_vec.is_empty() {
imports.push(path_vec);
}
} else if *kind == techscript_syntax::TokenKind::From
|| (*kind == techscript_syntax::TokenKind::Identifier
&& tokens[i].lexeme == "from")
{
i += 1;
let mut path_vec = Vec::new();
while i < tokens.len() {
let t = &tokens[i];
if t.kind == techscript_syntax::TokenKind::Identifier {
path_vec.push(t.lexeme.clone());
i += 1;
} else {
break;
}

if i < tokens.len() && tokens[i].kind == techscript_syntax::TokenKind::Dot {
i += 1;
} else {
break;
}
}
if !path_vec.is_empty() {
imports.push(path_vec);
}

// Consume subsequent 'import' token to prevent double extraction
while i < tokens.len() {
if tokens[i].kind == techscript_syntax::TokenKind::Import {
i += 1;
break;
}
if tokens[i].kind == techscript_syntax::TokenKind::Semicolon
|| tokens[i].kind == techscript_syntax::TokenKind::Newline
{
break;
}
i += 1;
}
} else {
i += 1;
}
}

Expand Down
Loading