AhmmedSamier · AhmmedSamier · May 10, 2026 · Apr 22, 2026 · May 10, 2026 · coderabbitai
diff --git a/.jules/bolt.md b/.jules/bolt.md
@@ -12,6 +12,9 @@
 
 **Learning:** When keeping track of seen integer IDs that are dense and bounded (e.g. from 0 to N), using `new Set<number>()` incurs heavy allocation and insertion overhead compared to a fixed-size byte array.
 **Action:** Replace `Set<number>` with `new Uint8Array(maxIndex)` and use `array[id] = 1` to track presence, which is ~15x faster and avoids garbage collection pauses in hot paths. (Benchmark context: `N=100,000` IDs, `bun` version 1.2.14, Linux x86_64, Intel Xeon 2.30GHz, 4 cores, 8GB RAM, averaged over 100 iterations comparing `Set<number>` addition vs `new Uint8Array(maxIndex)` indexed assignment `array[id] = 1`).
+## 2024-05-18 - [Fast AST Node Type Matching via O(1) Set Lookups]
+**Learning:** For Tree-sitter node type checks in hot paths or AST traversal loops (e.g., searching for parent class declarations), using dynamic string manipulation like `.toLowerCase().includes('class_declaration')` creates significant overhead and redundant string allocations.
+**Action:** Replace dynamic `.toLowerCase().includes()` checks with a static `Set` of exact node names (e.g., `'class_declaration'`, `'class_definition'`, `'class'`, etc.) to perform O(1) lookups. This eliminates redundant allocations and provides a ~11x performance speedup in large traversal scenarios.
-## 2024-05-18 - [Fast AST Node Type Matching via O(1) Set Lookups]
-**Learning:** For Tree-sitter node type checks in hot paths or AST traversal loops (e.g., searching for parent class declarations), using dynamic string manipulation like `.toLowerCase().includes('class_declaration')` creates significant overhead and redundant string allocations.
-**Action:** Replace dynamic `.toLowerCase().includes()` checks with a static `Set` of exact node names (e.g., `'class_declaration'`, `'class_definition'`, `'class'`, etc.) to perform O(1) lookups. This eliminates redundant allocations and provides a ~11x performance speedup in large traversal scenarios.
+## 2026-04-22 - [Fast AST Node Type Matching via O(1) Set Lookups]
+**Learning:** For Tree-sitter node type checks in hot paths or AST traversal loops (e.g., searching for parent class declarations), using dynamic string manipulation like `.toLowerCase().includes('class_declaration')` creates significant overhead and redundant string allocations.
+**Action:** Replace dynamic `.toLowerCase().includes()` checks with a static `Set` of exact node names (e.g., `'class_declaration'`, `'class_definition'`, `'class'`, etc.) to perform O(1) lookups. This eliminates redundant allocations and provides a ~11x performance speedup in large traversal scenarios.
-## 2024-05-18 - [Fast AST Node Type Matching via O(1) Set Lookups]
-**Learning:** For Tree-sitter node type checks in hot paths or AST traversal loops (e.g., searching for parent class declarations), using dynamic string manipulation like `.toLowerCase().includes('class_declaration')` creates significant overhead and redundant string allocations.
-**Action:** Replace dynamic `.toLowerCase().includes()` checks with a static `Set` of exact node names (e.g., `'class_declaration'`, `'class_definition'`, `'class'`, etc.) to perform O(1) lookups. This eliminates redundant allocations and provides a ~11x performance speedup in large traversal scenarios.
+## 2026-04-22 - [Fast AST Node Type Matching via O(1) Set Lookups]
+**Learning:** For Tree-sitter node type checks in hot paths or AST traversal loops (e.g., searching for parent class declarations), using dynamic string manipulation like `.toLowerCase().includes('class_declaration')` creates significant overhead and redundant string allocations.
+**Action:** Replace dynamic `.toLowerCase().includes()` checks with a static `Set` of exact node names (e.g., `'class_declaration'`, `'class_definition'`, `'class'`, etc.) to perform O(1) lookups. This eliminates redundant allocations and provides a ~11x performance speedup in large traversal scenarios.
 
 ## 2026-04-09 - [O(N) to O(K) subset filtering in SearchEngine hot paths]