Skip to content

⚡ Bolt: [O(N*M) to O(N) loop optimization] #147

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

Open
glacy wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡ Bolt: [O(N*M) to O(N) loop optimization] #147

Show file tree
Hide file tree
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
4 changes: 4 additions & 0 deletions .jules/bolt.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,3 +6,7 @@
## 2025-05-20 - Pre-compiling Regex in Loops
**Learning:** `re.findall(pattern, string)` recompiles (or retrieves from cache) the pattern on every call. In high-frequency functions called inside loops (like complexity estimation), this overhead adds up.
**Action:** Always pre-compile regexes (`re.compile`) into module-level or class-level constants if they are used repeatedly, especially in tight loops or recursive functions.

## 2025-06-29 - O(N*M) Lookup Optimization
**Learning:** Found O(N*M) nested loops searching for corresponding solutions to exercises by label in `MaterialExtractor` and `RAGIndexer`. Refactoring to pre-compute an O(N) hash map reduced processing time from O(N*M) to O(N).
**Action:** When searching for matches across two lists, always pre-compute a dictionary (`{item['key']: item for item in list}`) to achieve O(N) lookup instead of O(N*M) nested loops, especially in data processing or indexing pipelines. Ensure to check `if key not in dict` when populating to preserve `break` (first-match) behavior if duplicates might exist.
Loading