Local UI to run and train LLMs and diffusion models. Supports GGUF, MLX, Qwen3.8, DeepSeek-V4.1, MiniMax-H3, Gemma 4, FLUX and more.
Python agentaichatgptdeepseekfine-tuninggemmaimage-generationllamallmllmsopenaipythonqwenreinforcement-learningself-hostedstable-diffusiontext-to-speechttsuiunsloth
fix(rag): avoid long CPU stalls when archiving tool calls (#14098)
Dmitry104bc897b856
diff --git a/studio/backend/core/rag/conversation_archive.py b/studio/backend/core/rag/conversation_archive.pyindex 330409f1e6b..417585ddd35 100644--- a/studio/backend/core/rag/conversation_archive.py+++ b/studio/backend/core/rag/conversation_archive.py@@ -1351,20 +1351,57 @@ def _occurrences(positions: Optional[list[list[str]]], group: list[dict]) -> lis# arguments and what followed them: a call with a preamble renders live as name/args/text and stored as# name/args/args/text, so the live string is no longer contiguous. One split point, so this tolerates exactly# the one insertion `_probe_text` makes.- if is_call:- if not live:- return False- if live in stored:- return True- words = live.split(" ")- for cut in range(1, len(words)):- head = " ".join(words[:cut])- tail = " ".join(words[cut:])- at = stored.find(head)- if at >= 0 and stored.find(tail, at + len(head)) >= 0:- return True+ # Space offsets keep split(" ") semantics. Head presence only falls and tail presence only rises as the cut+ # moves right, so both bounds are binary-searched; the ordered match is not monotone, so every cut between+ # them is still checked against the earliest head and the latest tail.+ if not is_call:+ return stored == live++ if not live:+ return False++ if live in stored:+ return True++ # Splitting removes one space; the remaining characters must fit without overlap.+ if len(stored) < len(live) - 1:+ return False++ cuts = [index for index, char in enumerate(live) if char == " "]+ if not cuts:+ return False++ # Find the exclusive upper bound of splits whose head occurs in stored.+ left, right = 0, len(cuts)+ while left < right:+ mid = (left + right) // 2+ if live[: cuts[mid]] in stored:+ left = mid + 1+ else:+ right = mid++ prefix_stop = left+ if prefix_stop == 0:return False- return stored == live++ # Within that range, find the first split whose tail occurs in stored.+ left, right = 0, prefix_stop+ while left < right:+ mid = (left + right) // 2+ if live[cuts[mid] + 1 :] in stored:+ right = mid+ else:+ left = mid + 1++ for index in range(left, prefix_stop):+ cut = cuts[index]+ head_at = stored.find(live[:cut])+ tail_at = stored.rfind(live[cut + 1 :])++ if tail_at >= head_at + cut:+ return True++ return Falsereturn [index