eminiar 0.8.1 → 0.9.1

package/dist/server.js

@@ -13703,7 +13703,7 @@ function chunkBySymbols(code, rel, symbols, opts = DEFAULT_CHUNKER) {
   const valid = symbols.filter(
     (s) => s.startLine >= 1 && s.endLine >= s.startLine && s.endLine <= total
   );
-  const top = valid.filter((s) => depthOf(s.name) === 1).sort((a, b) => a.startLine - b.startLine || b.endLine - a.endLine);
+  const top2 = valid.filter((s) => depthOf(s.name) === 1).sort((a, b) => a.startLine - b.startLine || b.endLine - a.endLine);
   const membersOf = (parent) => valid.filter(
     (s) => depthOf(s.name) === depthOf(parent.name) + 1 && s.name.startsWith(`${parent.name}.`) && s.startLine >= parent.startLine && s.endLine <= parent.endLine
   ).sort((a, b) => a.startLine - b.startLine);
@@ -13732,7 +13732,7 @@ function chunkBySymbols(code, rel, symbols, opts = DEFAULT_CHUNKER) {
     }
     tiny = [];
   };
-  for (const sym of top) {
+  for (const sym of top2) {
     if (sym.startLine < cursor) continue;
     const a = extendUp(sym.startLine, cursor - 1);
     const b = sym.endLine;
@@ -14886,11 +14886,11 @@ async function parsePhp(root, rel, code) {
       if (file3) {
         if (file3 !== rel) addImport(fileId(file3), label, fqn, line, 0.95);
       } else {
-        const top = fqn.split("\\")[0];
-        importedPkgs.add(top);
-        if (!imports.has(pkgId(top)))
-          nodes.push({ id: pkgId(top), kind: "package", name: top, source: "tree-sitter" });
-        addImport(pkgId(top), label, fqn, line, 1);
+        const top2 = fqn.split("\\")[0];
+        importedPkgs.add(top2);
+        if (!imports.has(pkgId(top2)))
+          nodes.push({ id: pkgId(top2), kind: "package", name: top2, source: "tree-sitter" });
+        addImport(pkgId(top2), label, fqn, line, 1);
       }
       if (kind) scope.set(local, { id: pkgId(fqn.split("\\")[0]), confidence: 0.6 });
       else classUses.set(local, fqn);
@@ -14997,8 +14997,8 @@ async function parsePhp(root, rel, code) {
         return;
     }
   }
-  function insideDecl(n, top) {
-    for (let cur = n.parent; cur && cur.id !== top.id; cur = cur.parent) {
+  function insideDecl(n, top2) {
+    for (let cur = n.parent; cur && cur.id !== top2.id; cur = cur.parent) {
       if (cur.type === "function_definition" || cur.type === "method_declaration") return true;
       if (CLASS_KINDS[cur.type]) return true;
     }
@@ -17428,10 +17428,10 @@ function cycles(nodes, edges) {
     stack.push(start);
     onStack.add(start);
     while (work.length) {
-      const top = work[work.length - 1];
-      const succ = adj.get(top.n);
-      if (top.i < succ.length) {
-        const m = succ[top.i++];
+      const top2 = work[work.length - 1];
+      const succ = adj.get(top2.n);
+      if (top2.i < succ.length) {
+        const m = succ[top2.i++];
         if (!idx.has(m)) {
           idx.set(m, counter);
           low.set(m, counter);
@@ -17440,20 +17440,20 @@ function cycles(nodes, edges) {
           onStack.add(m);
           work.push({ n: m, i: 0 });
         } else if (onStack.has(m)) {
-          low.set(top.n, Math.min(low.get(top.n), idx.get(m)));
+          low.set(top2.n, Math.min(low.get(top2.n), idx.get(m)));
         }
       } else {
         work.pop();
         const parent = work[work.length - 1];
-        if (parent) low.set(parent.n, Math.min(low.get(parent.n), low.get(top.n)));
-        if (low.get(top.n) === idx.get(top.n)) {
+        if (parent) low.set(parent.n, Math.min(low.get(parent.n), low.get(top2.n)));
+        if (low.get(top2.n) === idx.get(top2.n)) {
           const comp = [];
           let m;
           do {
             m = stack.pop();
             onStack.delete(m);
             comp.push(m);
-          } while (m !== top.n);
+          } while (m !== top2.n);
           if (comp.length > 1) out.push(comp.sort());
         }
       }
@@ -17608,8 +17608,8 @@ function computeMetrics(db) {
 function topFolder(paths2) {
   const counts = /* @__PURE__ */ new Map();
   for (const p of paths2) {
-    const top = p.includes("/") ? `${p.split("/")[0]}/` : "(root)";
-    counts.set(top, (counts.get(top) ?? 0) + 1);
+    const top2 = p.includes("/") ? `${p.split("/")[0]}/` : "(root)";
+    counts.set(top2, (counts.get(top2) ?? 0) + 1);
   }
   return [...counts.entries()].sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]))[0]?.[0] ?? "";
 }
@@ -18018,6 +18018,7 @@ __export(store_exports, {
   autoName: () => autoName,
   edit: () => edit,
   gitignoreHint: () => gitignoreHint,
+  impliedFileLinks: () => impliedFileLinks,
   isKind: () => isKind,
   isStatus: () => isStatus,
   isValidName: () => isValidName,
@@ -18116,6 +18117,20 @@ function memoryLinks(body, self) {
   }
   return [...out];
 }
+function impliedFileLinks(root, body, skipPrefix) {
+  const out = /* @__PURE__ */ new Set();
+  for (const m of body.matchAll(PATH_RE)) {
+    const p = m[1].replace(/[.,;:)]+$/, "");
+    if (!p || p.startsWith("..") || out.has(p) || skipPrefix && p.startsWith(`${skipPrefix}/`))
+      continue;
+    try {
+      if (statSync6(join12(root, p)).isFile()) out.add(p);
+    } catch {
+    }
+    if (out.size >= 30) break;
+  }
+  return [...out].map((p) => `file:${p}`);
+}
 function writeMemoryFile(ctx, name, meta4, body) {
   const abs = absOf(ctx, name);
   mkdirSync3(dirname7(abs), { recursive: true });
@@ -18138,13 +18153,14 @@ function syncGraph(db, name, rel, g) {
   ]);
   const edges = [];
   const seen = /* @__PURE__ */ new Set();
-  const push = (dst, kind) => {
+  const push = (dst, kind, confidence = 1) => {
     const key = `${kind}|${dst}`;
     if (dst === self || seen.has(key)) return;
     seen.add(key);
-    edges.push({ src: self, dst, kind, source: "curated", confidence: 1, weight: 1 });
+    edges.push({ src: self, dst, kind, source: "curated", confidence, weight: 1 });
   };
   for (const id of g.related) push(relatedTarget(id), "mentions");
+  for (const id of g.implied ?? []) push(id, "mentions", 0.6);
   for (const other of memoryLinks(g.body, name)) push(memoryId(other), "links");
   if (g.supersedes) push(memoryId(g.supersedes.replace(/^mem(?:ory)?:/, "")), "supersedes");
   if (edges.length) db.graphUpsertEdges(edges);
@@ -18205,6 +18221,9 @@ ${parsed.body.replace(/^\s*\n/, "")}`
     hash2 = hashText(text2);
   }
   const body = parsed.body.trim();
+  const implied = impliedFileLinks(ctx.root, body, memoriesRel(ctx)).filter(
+    (id) => !related.includes(id)
+  );
   const doc = indexContent(db, {
     source: "memory",
     uri: `memory:${name}`,
@@ -18221,7 +18240,8 @@ tags: ${tags.join(", ")}` : ""}`,
     kind,
     content: body,
     tags,
-    nodeIds: related,
+    // the header's deliberate list first, then the files the body names
+    nodeIds: [...related, ...implied],
     sessionId: opts.sessionId,
     documentId: doc.documentId,
     path: rel,
@@ -18233,7 +18253,7 @@ tags: ${tags.join(", ")}` : ""}`,
     status,
     supersedes
   });
-  syncGraph(db, name, rel, { kind, tags, related, status, supersedes, body });
+  syncGraph(db, name, rel, { kind, tags, related, implied, status, supersedes, body });
   return { changed: true, row: db.memoryGetByName(name) };
 }
 function setMeta(ctx, db, name, patch) {
@@ -18432,11 +18452,11 @@ function gitignoreHint(ctx) {
   const file3 = join12(ctx.root, ".gitignore");
   if (!existsSync8(file3)) return void 0;
   const dir = memoriesRel(ctx);
-  const top = dir.split("/")[0];
-  const ignored = readFileSync8(file3, "utf8").split(/\r?\n/).map((l) => l.trim().replace(/^\//, "").replace(/\/$/, "")).some((l) => l === top || l === dir || l === `${top}/**` || l === `${dir}/**`);
+  const top2 = dir.split("/")[0];
+  const ignored = readFileSync8(file3, "utf8").split(/\r?\n/).map((l) => l.trim().replace(/^\//, "").replace(/\/$/, "")).some((l) => l === top2 || l === dir || l === `${top2}/**` || l === `${dir}/**`);
   return ignored ? `note: .gitignore ignores ${dir}, so memories stay local to this machine (remove that line to share them with the team)` : void 0;
 }
-var import_fast_glob3, MEMORY_KINDS, SEGMENT, NAME_RE, MEM_LINK_RE, hinted;
+var import_fast_glob3, MEMORY_KINDS, SEGMENT, NAME_RE, MEM_LINK_RE, PATH_RE, hinted;
 var init_store = __esm({
   "src/memory/store.ts"() {
     "use strict";
@@ -18459,6 +18479,7 @@ var init_store = __esm({
     SEGMENT = "[a-z0-9][a-z0-9._-]*";
     NAME_RE = new RegExp(`^(?:${SEGMENT}/)?${SEGMENT}$`);
     MEM_LINK_RE = /(?<![A-Za-z0-9_./-])mem:([a-z0-9][a-z0-9._-]*(?:\/[a-z0-9][a-z0-9._-]*)?)/g;
+    PATH_RE = /(?<![\w/.-])(?:\.\/)?((?:[A-Za-z0-9_.-]+\/)+[A-Za-z0-9_.-]+\.[A-Za-z0-9]{1,8})(?![\w/-])/g;
     hinted = /* @__PURE__ */ new Set();
   }
 });
@@ -49189,7 +49210,12 @@ var ConfigSchema = external_exports.object({
     /** Before WebSearch / WebFetch: the indexed doc pages that already answer it. */
     onWeb: external_exports.boolean().default(true),
     maxMemories: external_exports.number().int().min(0).max(10).default(3),
-    maxDocs: external_exports.number().int().min(0).max(10).default(2)
+    maxDocs: external_exports.number().int().min(0).max(10).default(2),
+    /**
+     * Prompts after which an item already shown in this context window may be injected
+     * again when it matches (0 = once per context window only).
+     */
+    repeatAfter: external_exports.number().int().min(0).max(1e3).default(10)
   }).prefault({}),
   docs: external_exports.object({
     /** Project-relative manifest of documentation sources (`em_docs`); commit it. */
@@ -51193,11 +51219,11 @@ function folderRows(files, languages2) {
     score: Number((a.score / a.files).toFixed(3)),
     languages: a.langs
   }));
-  const top = new Map(rows.filter((r) => r.path.split("/").length <= 2).map((r) => [r.path, r]));
+  const top2 = new Map(rows.filter((r) => r.path.split("/").length <= 2).map((r) => [r.path, r]));
   return rows.filter((r) => {
     const segs = r.path.split("/");
     if (segs.length <= 2) return true;
-    return (top.get(`${segs[0]}/`)?.files ?? 0) >= 12;
+    return (top2.get(`${segs[0]}/`)?.files ?? 0) >= 12;
   }).sort((a, b) => a.path.localeCompare(b.path));
 }
 function entryPoints(root, db) {
@@ -52843,10 +52869,10 @@ async function search(db, query, opts = {}) {
     }
   }
   const fused = rrf(lists);
-  const top = [...fused.entries()].sort((a, b) => b[1] - a[1]).slice(0, Math.max(limit * 4, 20));
-  const chunks = db.getChunks(top.map(([id]) => id));
+  const top2 = [...fused.entries()].sort((a, b) => b[1] - a[1]).slice(0, Math.max(limit * 4, 20));
+  const chunks = db.getChunks(top2.map(([id]) => id));
   const byId = new Map(chunks.map((c) => [c.id, c]));
-  const scored = top.map(([id, score]) => ({ chunk: byId.get(id), score, matched: [] })).filter((s) => !!s.chunk);
+  const scored = top2.map(([id, score]) => ({ chunk: byId.get(id), score, matched: [] })).filter((s) => !!s.chunk);
   const allTerms = [...terms, ...parsed.phrases];
   const ranked = rerank(scored, allTerms);
   const seenHash = /* @__PURE__ */ new Set();
@@ -55338,7 +55364,7 @@ function categoryRank(id) {
 var DOCUMENTS_EDGE = "documents";
 var MAX_PAGES = 500;
 var MAX_EDGES = 400;
-var PATH_RE = /(?:^|[\s(`'"[<])((?:\.{1,2}\/)*(?:[\w@.-]+\/)+[\w@.-]+\.[A-Za-z0-9]{1,8})(?=$|[\s)`'"\]>:#,;!?]|\.(?:\s|$))/gm;
+var PATH_RE2 = /(?:^|[\s(`'"[<])((?:\.{1,2}\/)*(?:[\w@.-]+\/)+[\w@.-]+\.[A-Za-z0-9]{1,8})(?=$|[\s)`'"\]>:#,;!?]|\.(?:\s|$))/gm;
 function manifestRel(ctx) {
   return relative8(ctx.root, manifestPath(ctx)).split(sep2).join("/");
 }
@@ -55358,7 +55384,7 @@ function packageCandidates(provider) {
 }
 function pathsIn(text2, pageRel, files) {
   const out = /* @__PURE__ */ new Set();
-  for (const m of text2.matchAll(PATH_RE)) {
+  for (const m of text2.matchAll(PATH_RE2)) {
     const raw = m[1];
     const tries = [raw.replace(/^(\.\/)+/, "")];
     if (pageRel && raw.startsWith("."))
@@ -57866,12 +57892,12 @@ function renderBranch(m, name, limit = 20) {
     );
     const files = /* @__PURE__ */ new Map();
     for (const c of own2) for (const f of c.files) files.set(f.path, (files.get(f.path) ?? 0) + 1);
-    const top = [...files.entries()].sort((a, b2) => b2[1] - a[1]).slice(0, 10);
-    if (top.length)
+    const top2 = [...files.entries()].sort((a, b2) => b2[1] - a[1]).slice(0, 10);
+    if (top2.length)
       lines.push(
-        `files touched: ${top.map(([p, n]) => n > 1 ? `${p} \xD7${n}` : p).join(", ")}${files.size > 10 ? ` \u2026 +${files.size - 10}` : ""}`
+        `files touched: ${top2.map(([p, n]) => n > 1 ? `${p} \xD7${n}` : p).join(", ")}${files.size > 10 ? ` \u2026 +${files.size - 10}` : ""}`
       );
-    const risky = top.map(([p]) => m.files.get(p)).filter((f) => !!f && f.risk >= 0.3);
+    const risky = top2.map(([p]) => m.files.get(p)).filter((f) => !!f && f.risk >= 0.3);
     if (risky.length)
       lines.push(
         `touches bug-prone files: ${risky.map((f) => `${f.path} (${f.risk.toFixed(2)})`).join(", ")}`
@@ -57980,7 +58006,7 @@ function parseWhen(s) {
 }
 var emHistory = defineTool({
   name: "em_history",
-  description: "Understand the project's git history instead of reading git log: commits classified by kind (feat/fix/refactor/\u2026), branches with ahead/behind and merge state, and a fix-origin trace that blames each fix's removed lines back to the commit that wrote them, so changes that later needed fixing are flagged. Use `overview` to orient, `file` before editing a file (its fixes, what broke after past changes, who knows it), `risk` for the files in the working tree (or given paths), `commit` for one change, `branch` to compare a branch with the base, `symbol` for a function's line history, `timeline`/`search` to find when and why something happened. Commit messages are also indexed for em_search (source `git`).",
+  description: "Understand the project's git history instead of running git log/blame/show (the hooks route those here): commits classified by kind (feat/fix/refactor/\u2026), branches with ahead/behind and merge state, and a fix-origin trace that blames each fix's removed lines back to the commit that wrote them, so changes that later needed fixing are flagged. Use `overview` to orient (it also builds the table the hooks use to flag bug-prone files), `file` before editing a file (its fixes, what broke after past changes, who knows it), `risk` for the files in the working tree (or given paths), `commit` for one change, `branch` to compare a branch with the base, `symbol` for a function's line history, `timeline`/`search` to find when and why something happened. Commit messages are also indexed for em_search (source `git`).",
   schema: {
     action: external_exports.enum(["overview", "timeline", "search", "file", "commit", "branch", "risk", "symbol"]).optional().describe("default overview"),
     path: external_exports.string().optional().describe("file: the file; timeline: restrict to this path prefix"),
@@ -58336,7 +58362,7 @@ init_queue();
 init_store();
 var emRecall = defineTool({
   name: "em_recall",
-  description: 'Recall memories (.eminiar/memories, written by em_remember) and captured session history \u2014 decisions, constraints, errors and their fixes, rejected approaches \u2014 matching a query (hybrid keyword + semantic). Without a query, lists the most recent memories, onboarding first. Use at the start of a task to avoid re-deciding or re-breaking things; em_memory {action:"read"} shows a whole memory.',
+  description: 'Call this first when a task starts, a design changes or an approach is chosen: it recalls memories (.eminiar/memories, written by em_remember) and captured session history \u2014 decisions, constraints, errors and their fixes, rejected approaches \u2014 matching a query (hybrid keyword + semantic), so nothing is re-decided or re-broken. Without a query, lists the most recent memories, onboarding first. The hooks also push matching memories on their own ("eminiar recall", "eminiar memory"); this tool searches further, with synonyms. em_memory {action:"read"} shows a whole memory.',
   schema: {
     query: external_exports.string().optional(),
     kind: external_exports.enum(MEMORY_KINDS).optional().describe("Restrict to one memory kind"),
@@ -58462,7 +58488,7 @@ function sourceFilter(source) {
 }
 var emSearch = defineTool({
   name: "em_search",
-  description: "Search everything eminiar has indexed: sandbox outputs, files, fetched pages, session memory, memories and code (chunks named by symbol, e.g. `src/auth.ts > Session.refresh`). Pass several queries at once \u2014 the round trip is paid once. Hybrid BM25 (porter + trigram) with typo correction; `sort: timeline` orders by recency (use after a resume); `mode: regex` scans indexed content with a JS regular expression and returns the matching lines with context (for ad-hoc greps over files not indexed, use em_execute with rg).",
+  description: 'Search everything eminiar has indexed: sandbox outputs, files, fetched pages, session memory, memories, commit messages (source git) and code (chunks named by symbol, e.g. `src/auth.ts > Session.refresh`). Reach for it before Grep or Bash when looking for where something lives, what an earlier command printed, or what a past session found: `source: "code"` answers code questions by symbol, `sort: timeline` orders by recency (use after a resume), `mode: regex` scans indexed content with a JS regular expression and returns the matching lines with context (for ad-hoc greps over files not indexed, use em_execute with rg). Pass several queries at once \u2014 the round trip is paid once. Hybrid BM25 (porter + trigram) with typo correction.',
   schema: {
     queries: external_exports.array(external_exports.string().min(1)).min(1).describe("One or more search queries"),
     source: external_exports.union([external_exports.string(), external_exports.array(external_exports.string())]).optional().describe(
@@ -58522,9 +58548,111 @@ var emSearch = defineTool({
 
 // src/tools/em_stats.ts
 init_esm_shims();
+
+// src/session/recall.ts
+init_esm_shims();
+init_ids();
+init_model();
+var RECALL_CATEGORY = "recall";
+function recallStats(events) {
+  const byPath = {};
+  const gated = /* @__PURE__ */ new Map();
+  let decisions = 0;
+  for (const e of events) {
+    if (e.category !== RECALL_CATEGORY) continue;
+    let p;
+    try {
+      p = JSON.parse(e.payload);
+    } catch {
+      continue;
+    }
+    decisions++;
+    const path3 = p.path ?? "file";
+    byPath[path3] ??= { fired: 0, quiet: 0, items: 0 };
+    const row = byPath[path3];
+    const n = p.keys?.length ?? 0;
+    if (n) {
+      row.fired++;
+      row.items += n;
+    } else row.quiet++;
+    for (const g of p.gated ?? []) {
+      const why = g.replace(/^\S+\s+/, "").replace(/\d+\/\d+ terms/, "too few terms");
+      gated.set(why, (gated.get(why) ?? 0) + 1);
+    }
+  }
+  return {
+    decisions,
+    byPath,
+    gated: [...gated.entries()].map(([why, n]) => ({ why, n })).sort((a, b) => b.n - a.n).slice(0, 6)
+  };
+}
+function formatRecallStats(title, s) {
+  if (!s.decisions) return `${title}: no recall decisions recorded yet`;
+  const paths2 = Object.entries(s.byPath).sort((a, b) => b[1].fired + b[1].quiet - (a[1].fired + a[1].quiet)).map(([path3, r]) => {
+    const total = r.fired + r.quiet;
+    return `${path3} ${r.fired}/${total} fired (${Math.round(100 * r.fired / total)}%, ${r.items} items)`;
+  });
+  const lines = [`${title}: ${s.decisions} decision(s) \u2014 ${paths2.join(" \xB7 ")}`];
+  if (s.gated.length)
+    lines.push(`  held back: ${s.gated.map((g) => `${g.why} \xD7${g.n}`).join(", ")}`);
+  return lines.join("\n");
+}
+
+// src/session/routing-stats.ts
+init_esm_shims();
+var ROUTING_CATEGORY = "routing";
+function routingStats(events) {
+  const byTool = {};
+  let decisions = 0;
+  for (const e of events) {
+    if (e.category !== ROUTING_CATEGORY) continue;
+    let p;
+    try {
+      p = JSON.parse(e.payload);
+    } catch {
+      continue;
+    }
+    if (!p.tool) continue;
+    decisions++;
+    let row = byTool[p.tool];
+    if (!row) {
+      row = { calls: 0, denied: 0, annotated: 0, targets: {}, rules: {} };
+      byTool[p.tool] = row;
+    }
+    row.calls++;
+    if (p.decision === "deny") {
+      row.denied++;
+      if (p.target) row.targets[p.target] = (row.targets[p.target] ?? 0) + 1;
+      if (p.rule) row.rules[p.rule] = (row.rules[p.rule] ?? 0) + 1;
+    } else if (p.decision === "annotate") row.annotated++;
+  }
+  return { decisions, byTool };
+}
+var top = (m, n = 4) => Object.entries(m).sort((a, b) => b[1] - a[1]).slice(0, n).map(([k, v]) => `${k} \xD7${v}`).join(", ");
+function formatRoutingStats(title, s) {
+  if (!s.decisions) return `${title}: no routing decisions recorded yet`;
+  const tools2 = Object.entries(s.byTool).sort((a, b) => b[1].calls - a[1].calls).map(([tool, r]) => {
+    const pct = Math.round(100 * r.denied / r.calls);
+    const parts = [`${tool} ${r.denied}/${r.calls} denied (${pct}%)`];
+    if (r.annotated) parts.push(`${r.annotated} annotated`);
+    return parts.join(", ");
+  });
+  const lines = [`${title}: ${s.decisions} native call(s) \u2014 ${tools2.join(" \xB7 ")}`];
+  const rules = {};
+  const targets = {};
+  for (const r of Object.values(s.byTool)) {
+    for (const [k, v] of Object.entries(r.rules)) rules[k] = (rules[k] ?? 0) + v;
+    for (const [k, v] of Object.entries(r.targets)) targets[k] = (targets[k] ?? 0) + v;
+  }
+  if (Object.keys(targets).length)
+    lines.push(`  denied \u2192 ${top(targets)}; by rule: ${top(rules, 6)}`);
+  return lines.join("\n");
+}
+
+// src/tools/em_stats.ts
 var emStats = defineTool({
   name: "em_stats",
-  description: "Show how much context eminiar has kept out of the conversation: tokens seen vs returned per tool for this session, this project, and lifetime across all projects, plus index/graph sizes.",
+  description: "Show how much context eminiar has kept out of the conversation: tokens seen vs returned per tool for this session, this project, and lifetime across all projects, plus index/graph sizes, how often routing intercepted native Bash/Read/Grep calls (and by which rule), and how often proactive recall (memories, docs, history before prompts, reads and edits) fired versus stayed quiet, with the reasons.",
   schema: {
     scope: external_exports.enum(["session", "project", "lifetime", "all"]).optional().describe("default all")
   },
@@ -58535,9 +58663,33 @@ var emStats = defineTool({
     const parts = [];
     if (scope === "session" || scope === "all") {
       parts.push(formatStats(`session ${sessionId.slice(0, 8)}`, db.statsBySession(sessionId)));
+      parts.push(
+        formatRoutingStats(
+          "routing (session)",
+          routingStats(db.eventsBySession(sessionId, { categories: [ROUTING_CATEGORY] }))
+        )
+      );
+      parts.push(
+        formatRecallStats(
+          "recall (session)",
+          recallStats(db.eventsBySession(sessionId, { categories: [RECALL_CATEGORY] }))
+        )
+      );
     }
     if (scope === "project" || scope === "all") {
       parts.push(formatStats(`project ${ctx.root}`, mergeByTool(db.statsAll())));
+      parts.push(
+        formatRoutingStats(
+          "routing (project, last 2000 calls)",
+          routingStats(db.eventsRecent(2e3, [ROUTING_CATEGORY]))
+        )
+      );
+      parts.push(
+        formatRecallStats(
+          "recall (project, last 2000 decisions)",
+          recallStats(db.eventsRecent(2e3, [RECALL_CATEGORY]))
+        )
+      );
     }
     if (scope === "lifetime" || scope === "all") {
       const g = globalDb();

package/eminiar.config.schema.json

@@ -245,6 +245,12 @@
           "type": "integer",
           "minimum": 0,
           "maximum": 10
+        },
+        "repeatAfter": {
+          "default": 10,
+          "type": "integer",
+          "minimum": 0,
+          "maximum": 1000
         }
       }
     },

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eminiar",
-  "version": "0.8.1",
+  "version": "0.9.1",
   "description": "Local-first context, memory and knowledge-graph plugin for Claude Code. Sandboxed execution, FTS5 + vector search, session continuity, and a code graph — nothing leaves your machine.",
   "type": "module",
   "license": "MIT",