From 2adac6cab56727356042d5e335a5434878f5c04f Mon Sep 17 00:00:00 2001 From: max Date: Mon, 3 Aug 2026 19:14:33 +0300 Subject: [PATCH] =?UTF-8?q?docs:=20tools=20diagram=20=E2=80=94=20grep=20jo?= =?UTF-8?q?ins=20the=20evidence=20chain,=20add=20the=20outcome=20node?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit The five-tools mermaid diagram drew grep as a dead end and ended the main chain on step. In reality grep returns the same anchors (session + turn) as recall_search, so both feed one expand_around → step loop; step is a bidirectional cursor, and the chain's point is the grounded answer with raw evidence. recent_sessions stays a separate lane on purpose: it returns sessions and freshness, not per-turn anchors. Applied identically to all four language versions. Co-Authored-By: Claude Fable 5 --- README.es-ES.md | 8 +++++--- README.md | 8 +++++--- README.zh-CN.md | 8 +++++--- docs/README.ru.md | 8 +++++--- 4 files changed, 20 insertions(+), 12 deletions(-) diff --git a/README.es-ES.md b/README.es-ES.md index bc1db5d..aba6f48 100644 --- a/README.es-ES.md +++ b/README.es-ES.md @@ -89,10 +89,12 @@ La interfaz se mantiene deliberadamente pequeña: ```mermaid flowchart LR Q["describe the old problem"] --> S["recall_search"] - S --> A["ranked anchor"] + X["exact error / symbol / path"] --> G["grep"] + S --> A["anchor: session + turn"] + G --> A A --> E["expand_around"] - E --> T["step next / prev"] - Q -. exact identifier .-> G["grep"] + E <--> T["step next / prev"] + E --> V["grounded answer + raw evidence"] R["what is current?"] --> RS["recent_sessions"] ``` diff --git a/README.md b/README.md index dbf65aa..740284f 100644 --- a/README.md +++ b/README.md @@ -82,10 +82,12 @@ The interface stays deliberately small: ```mermaid flowchart LR Q["describe the old problem"] --> S["recall_search"] - S --> A["ranked anchor"] + X["exact error / symbol / path"] --> G["grep"] + S --> A["anchor: session + turn"] + G --> A A --> E["expand_around"] - E --> T["step next / prev"] - Q -. exact identifier .-> G["grep"] + E <--> T["step next / prev"] + E --> V["grounded answer + raw evidence"] R["what is current?"] --> RS["recent_sessions"] ``` diff --git a/README.zh-CN.md b/README.zh-CN.md index de343cc..f3d7991 100644 --- a/README.zh-CN.md +++ b/README.zh-CN.md @@ -80,10 +80,12 @@ Session Recall 把这些历史汇成一个本地优先的索引，再通过五 ```mermaid flowchart LR Q["describe the old problem"] --> S["recall_search"] - S --> A["ranked anchor"] + X["exact error / symbol / path"] --> G["grep"] + S --> A["anchor: session + turn"] + G --> A A --> E["expand_around"] - E --> T["step next / prev"] - Q -. exact identifier .-> G["grep"] + E <--> T["step next / prev"] + E --> V["grounded answer + raw evidence"] R["what is current?"] --> RS["recent_sessions"] ``` diff --git a/docs/README.ru.md b/docs/README.ru.md index b9a0558..ca87037 100644 --- a/docs/README.ru.md +++ b/docs/README.ru.md @@ -87,10 +87,12 @@ Session Recall превращает эту историю в единый local- ```mermaid flowchart LR Q["describe the old problem"] --> S["recall_search"] - S --> A["ranked anchor"] + X["exact error / symbol / path"] --> G["grep"] + S --> A["anchor: session + turn"] + G --> A A --> E["expand_around"] - E --> T["step next / prev"] - Q -. exact identifier .-> G["grep"] + E <--> T["step next / prev"] + E --> V["grounded answer + raw evidence"] R["what is current?"] --> RS["recent_sessions"] ```