From 6adef7f30375e999596b8ca347eeb04ff5e360a9 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Tue, 31 Mar 2026 19:56:57 +0000
Subject: [PATCH] =?UTF-8?q?=E2=9A=A1=20Bolt:=20O(N)=20loop=20optimization?=
 =?UTF-8?q?=20in=20feedback=20loops?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Co-authored-by: daggerstuff <261005129+daggerstuff@users.noreply.github.com>
---
 data/pipeline/feedback_loops.py | 18 +++++++++++-------
 1 file changed, 11 insertions(+), 7 deletions(-)

diff --git a/data/pipeline/feedback_loops.py b/data/pipeline/feedback_loops.py
index 55471fbe..9a9c38db 100644
--- a/data/pipeline/feedback_loops.py
+++ b/data/pipeline/feedback_loops.py
@@ -1,10 +1,8 @@
-import logging
-import os
 import json
-import time
-from typing import Dict, List, Any, Optional
-from datetime import datetime
+import logging
 from collections import deque
+from datetime import datetime
+from typing import Any, Dict, List, Optional
 
 logger = logging.getLogger(__name__)
 
@@ -126,8 +124,14 @@ def identify_anti_patterns(self) -> List[Dict[str, Any]]:
         try:
             # Mocked naive pattern extraction
             dummy_keywords = ["toxic positivity", "abrupt ending", "unhelpful generic"]
-            for keyword in dummy_keywords:
-                matches = sum(1 for c in failure_contexts if keyword in c)
+            # ⚡ Bolt: Prevent O(n*m) complexity by compiling a single regex pattern for O(N) searching
+            import re
+            pattern = re.compile("|".join(map(re.escape, dummy_keywords)))
+            counts = {k: 0 for k in dummy_keywords}
+            for c in failure_contexts:
+                for match in set(pattern.findall(c)):
+                    counts[match] += 1
+            for keyword, matches in counts.items():
                 if matches > 5:
                     anti_patterns.append(
                         {