⚡ Bolt: 검색 교집합 연산 최적화 (intersection_update)

.jules/bolt.md

@@ -67,3 +67,6 @@
 ## 2025-02-12 - [Fast Path Execution in Directory Traversal and Log Parsing]
 **Learning:** Checking for string existence (`if "silence_" not in stderr`) before invoking regex matchers provides significant speed improvements when parsing large blocks of text. Similarly, moving expensive I/O operations like `os.path.realpath` inside conditional blocks prevents redundant disk access when configuration (like path exclusions) isn't utilized.
 **Action:** When working on large text processing or disk operations, verify if early exit conditions or conditional execution can bypass the expensive system or library calls.
+## 2024-06-25 - [Optimize set intersection in hot loops]
+**Learning:** Using the `&` operator in a loop creates a new intermediate set in memory during each iteration. When repeatedly intersecting sets, `.intersection_update()` modifies the set in-place, preventing allocations and reducing overhead.
+**Action:** Replace `&` with `.intersection_update()` when repeatedly intersecting sets in performance-critical loops.

transcript_search.py

@@ -241,9 +241,11 @@ def search(self, query: str) -> list[Match]:
             postings = self._postings.get(term)
             if not postings:
                 return []
-            candidates = (
-                set(postings) if candidates is None else candidates & postings
-            )
+            if candidates is None:
+                candidates = set(postings)
+            else:
+                # 불필요한 중간 집합(set) 생성을 방지하기 위해 in-place 교집합 업데이트 사용
+                candidates.intersection_update(postings)
             if not candidates:
                 return []