Skip to content

Optimize hot paths: fix regex compilation, string concatenation, and algorithmic complexity #59

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
Bryan-Roe merged 5 commits into from
Feb 17, 2026
Merged

Optimize hot paths: fix regex compilation, string concatenation, and algorithmic complexity #59

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
b519081
Initial plan
Copilot Feb 17, 2026
93f6da8
Optimize performance: Replace inefficient patterns with O(1) lookups …
Copilot Feb 17, 2026
d2edf5f
Fix critical performance issues: regex compilation in loops and O(n²)…
Copilot Feb 17, 2026
858c437
Add comprehensive performance improvements documentation
Copilot Feb 17, 2026
598568d
Update llm-maker/src/tool_validator.py
Bryan-Roe Feb 17, 2026
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
1 change: 1 addition & 0 deletions dashboard/app.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -179,6 +179,7 @@ def _compute_training_progress():
# Tail last ~400 lines for patterns
lines = _tail_lines(log_file, 400)
# Patterns: Epoch X/Y, global_step = Z, total_flos
# Compile regex patterns ONCE outside loop for performance
import re
epoch_pat = re.compile(r"Epoch\s+(\d+)/(\d+)")
step_pat = re.compile(r"global_step\s*=\s*(\d+)")
Expand Down
Loading
Loading