@nxuss/lemma 1.9.1 → 1.10.0

package/dist/cjs/utils/DepGraph.js

@@ -0,0 +1,210 @@
+"use strict";
+/**
+ * DepGraph — the workspace import graph, built from the TypeScript AST.
+ *
+ * Extracted from `mcp/tools.ts` so more than one tool can use it: `depgraph` reports it to
+ * the model, and `affected_tests` walks its reverse edges to decide which tests a change
+ * can possibly break. Zero LLM calls — this is parsing, not inference.
+ *
+ * Building the graph parses every source file in the repo, which is far too expensive to
+ * redo on every call. `buildDepGraphMap` therefore memoizes on a stat-only fingerprint:
+ * cheap to compute, and it changes the moment any source file is written.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildDepGraphMap = buildDepGraphMap;
+exports.bfsDepGraph = bfsDepGraph;
+exports.resetDepGraphCache = resetDepGraphCache;
+const fs_1 = __importDefault(require("fs"));
+const path_1 = __importDefault(require("path"));
+const ts = __importStar(require("typescript"));
+const IGNORE_DG = new Set(["node_modules", ".git", "dist", "chroma_data", ".lemma", "build", "coverage", ".next"]);
+const SOURCE_RE = /\.(ts|tsx|js|jsx)$/;
+/** Extensions tried, in order, when resolving a relative import that omits its suffix. */
+const RESOLUTION_SUFFIXES = [".ts", ".tsx", ".js", ".jsx", "/index.ts", "/index.tsx", "/index.js"];
+const graphCache = new Map();
+function collectSourceFiles(workspaceRoot) {
+    const found = [];
+    const walk = (dir) => {
+        let entries = [];
+        try {
+            entries = fs_1.default.readdirSync(dir, { withFileTypes: true });
+        }
+        catch {
+            return;
+        }
+        for (const e of entries) {
+            if (IGNORE_DG.has(e.name))
+                continue;
+            const abs = path_1.default.join(dir, e.name);
+            if (e.isDirectory()) {
+                walk(abs);
+            }
+            else if (SOURCE_RE.test(e.name) && !e.name.endsWith(".d.ts")) {
+                let stat;
+                try {
+                    stat = fs_1.default.statSync(abs);
+                }
+                catch {
+                    continue;
+                }
+                found.push({
+                    abs,
+                    rel: path_1.default.relative(workspaceRoot, abs).replace(/\\/g, "/"),
+                    mtimeMs: stat.mtimeMs,
+                    size: stat.size,
+                });
+            }
+        }
+    };
+    walk(workspaceRoot);
+    return found;
+}
+/**
+ * Fingerprint over paths, sizes and mtimes. Stat-only, so it costs a directory walk rather
+ * than a full parse — which is the whole point: it lets us skip the parse when nothing moved.
+ */
+function fingerprintOf(files) {
+    return files
+        .map((f) => `${f.rel}:${f.mtimeMs}:${f.size}`)
+        .sort()
+        .join("|");
+}
+function parseInto(map, workspaceRoot) {
+    for (const [, node] of map) {
+        try {
+            const src = fs_1.default.readFileSync(node.abs, "utf8");
+            const sf = ts.createSourceFile(node.abs, src, ts.ScriptTarget.Latest, true);
+            ts.forEachChild(sf, (n) => {
+                if (ts.isImportDeclaration(n) && ts.isStringLiteral(n.moduleSpecifier)) {
+                    const spec = n.moduleSpecifier.text;
+                    if (spec.startsWith(".")) {
+                        const dir = path_1.default.dirname(node.abs);
+                        let resolved = path_1.default.resolve(dir, spec);
+                        for (const ext of RESOLUTION_SUFFIXES) {
+                            if (fs_1.default.existsSync(resolved + ext)) {
+                                resolved += ext;
+                                break;
+                            }
+                        }
+                        const rel = path_1.default.relative(workspaceRoot, resolved).replace(/\\/g, "/");
+                        if (!node.imports.includes(rel))
+                            node.imports.push(rel);
+                    }
+                    else {
+                        const pkg = spec.split("/")[0];
+                        if (!node.externalImports.includes(pkg))
+                            node.externalImports.push(pkg);
+                    }
+                }
+                const hasExportMod = (nd) => ts.canHaveModifiers(nd) &&
+                    (ts.getModifiers(nd) ?? []).some((m) => m.kind === ts.SyntaxKind.ExportKeyword);
+                if (hasExportMod(n)) {
+                    if (ts.isFunctionDeclaration(n) && n.name)
+                        node.exports.push(n.name.text);
+                    else if (ts.isClassDeclaration(n) && n.name)
+                        node.exports.push(n.name.text);
+                    else if (ts.isVariableStatement(n)) {
+                        for (const decl of n.declarationList.declarations) {
+                            if (ts.isIdentifier(decl.name))
+                                node.exports.push(decl.name.text);
+                        }
+                    }
+                    else if (ts.isInterfaceDeclaration(n))
+                        node.exports.push(n.name.text);
+                    else if (ts.isTypeAliasDeclaration(n))
+                        node.exports.push(n.name.text);
+                    else if (ts.isEnumDeclaration(n))
+                        node.exports.push(n.name.text);
+                }
+                if (ts.isExportDeclaration(n) && n.exportClause && ts.isNamedExports(n.exportClause)) {
+                    for (const el of n.exportClause.elements)
+                        node.exports.push(el.name.text);
+                }
+            });
+        }
+        catch {
+            /* skip unparseable */
+        }
+    }
+    for (const [, node] of map) {
+        for (const imp of node.imports) {
+            const target = map.get(imp);
+            if (target && !target.importedBy.includes(node.rel))
+                target.importedBy.push(node.rel);
+        }
+    }
+}
+function buildDepGraphMap(workspaceRoot) {
+    const files = collectSourceFiles(workspaceRoot);
+    const fingerprint = fingerprintOf(files);
+    const cached = graphCache.get(workspaceRoot);
+    if (cached && cached.fingerprint === fingerprint)
+        return cached.map;
+    const map = new Map();
+    for (const f of files) {
+        map.set(f.rel, { rel: f.rel, abs: f.abs, imports: [], importedBy: [], externalImports: [], exports: [] });
+    }
+    parseInto(map, workspaceRoot);
+    graphCache.set(workspaceRoot, { fingerprint, map });
+    return map;
+}
+function bfsDepGraph(map, startRel, direction, maxDepth) {
+    const visited = new Map();
+    const queue = [{ rel: startRel, depth: 0 }];
+    while (queue.length > 0) {
+        const item = queue.shift();
+        if (visited.has(item.rel) || item.depth > maxDepth)
+            continue;
+        const node = map.get(item.rel);
+        if (!node)
+            continue;
+        visited.set(item.rel, { node, depth: item.depth });
+        if (item.depth < maxDepth) {
+            const neighbors = direction === "forward" ? node.imports : node.importedBy;
+            for (const n of neighbors)
+                queue.push({ rel: n, depth: item.depth + 1 });
+        }
+    }
+    return visited;
+}
+/** Test seam — the cache is process-global and would otherwise leak between test cases. */
+function resetDepGraphCache() {
+    graphCache.clear();
+}
+//# sourceMappingURL=DepGraph.js.map

package/dist/cjs/utils/DepGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DepGraph.js","sourceRoot":"","sources":["../../../src/utils/DepGraph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoIH,4CAeC;AAED,kCAoBC;AAGD,gDAEC;AA5KD,4CAAoB;AACpB,gDAAwB;AACxB,+CAAiC;AAajC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;AACnH,MAAM,SAAS,GAAG,oBAAoB,CAAC;AAEvC,0FAA0F;AAC1F,MAAM,mBAAmB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;AAOnG,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;AAElD,SAAS,kBAAkB,CAAC,aAAqB;IAC/C,MAAM,KAAK,GAAuE,EAAE,CAAC;IAErF,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,EAAE;QAC3B,IAAI,OAAO,GAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC;YACH,OAAO,GAAG,YAAE,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QACzD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,SAAS;YACpC,MAAM,GAAG,GAAG,cAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC;iBAAM,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/D,IAAI,IAAc,CAAC;gBACnB,IAAI,CAAC;oBACH,IAAI,GAAG,YAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAC1B,CAAC;gBAAC,MAAM,CAAC;oBACP,SAAS;gBACX,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC;oBACT,GAAG;oBACH,GAAG,EAAE,cAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;oBAC1D,OAAO,EAAE,IAAI,CAAC,OAAO;oBACrB,IAAI,EAAE,IAAI,CAAC,IAAI;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,CAAC,aAAa,CAAC,CAAC;IACpB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,KAA4D;IACjF,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;SAC7C,IAAI,EAAE;SACN,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,aAAqB;IACxD,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,YAAE,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC5E,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE;gBACxB,IAAI,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC;oBACvE,MAAM,IAAI,GAAG,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;oBACpC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;wBACzB,MAAM,GAAG,GAAG,cAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACnC,IAAI,QAAQ,GAAG,cAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;wBACvC,KAAK,MAAM,GAAG,IAAI,mBAAmB,EAAE,CAAC;4BACtC,IAAI,YAAE,CAAC,UAAU,CAAC,QAAQ,GAAG,GAAG,CAAC,EAAE,CAAC;gCAClC,QAAQ,IAAI,GAAG,CAAC;gCAChB,MAAM;4BACR,CAAC;wBACH,CAAC;wBACD,MAAM,GAAG,GAAG,cAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;wBACvE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;4BAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC1D,CAAC;yBAAM,CAAC;wBACN,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC/B,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC;4BAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC1E,CAAC;gBACH,CAAC;gBACD,MAAM,YAAY,GAAG,CAAC,EAAW,EAAE,EAAE,CACnC,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC;oBACvB,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;gBAClF,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,IAAI,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI;wBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;yBACrE,IAAI,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI;wBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;yBACvE,IAAI,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;wBACnC,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,eAAe,CAAC,YAAY,EAAE,CAAC;4BAClD,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;gCAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACpE,CAAC;oBACH,CAAC;yBAAM,IAAI,EAAE,CAAC,sBAAsB,CAAC,CAAC,CAAC;wBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAE,CAA6B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;yBAChG,IAAI,EAAE,CAAC,sBAAsB,CAAC,CAAC,CAAC;wBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;yBACjE,IAAI,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC;wBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnE,CAAC;gBACD,IAAI,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;oBACrF,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,YAAY,CAAC,QAAQ;wBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC5E,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,sBAAsB;QACxB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;gBAAE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,gBAAgB,CAAC,aAAqB;IACpD,MAAM,KAAK,GAAG,kBAAkB,CAAC,aAAa,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAEzC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC7C,IAAI,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAEpE,MAAM,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5G,CAAC;IACD,SAAS,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IAE9B,UAAU,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;IACpD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAgB,WAAW,CACzB,GAAgB,EAChB,QAAgB,EAChB,SAAiC,EACjC,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiD,CAAC;IACzE,MAAM,KAAK,GAA0C,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACnF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ;YAAE,SAAS;QAC7D,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;YAC3E,KAAK,MAAM,CAAC,IAAI,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,2FAA2F;AAC3F,SAAgB,kBAAkB;IAChC,UAAU,CAAC,KAAK,EAAE,CAAC;AACrB,CAAC"}

package/dist/cjs/utils/LocalPrefilter.d.ts

@@ -0,0 +1,61 @@
+/**
+ * LocalPrefilter — spend a local model's tokens so the expensive one never sees the noise.
+ *
+ * A broad `search_workspace` returns 200 matches across 60 files. Four of them matter. The
+ * frontier model currently pays for all 200 — in the turn that produced them and in every
+ * turn afterwards, because tool results stay in the transcript. A 3B model running on the
+ * user's own machine can rank that list for free, in the local sense of free: no API cost,
+ * no context cost, no per-token billing.
+ *
+ * This is the one place in Lemma where a model's judgement decides what the main model
+ * sees, so the safety rules are stricter than anywhere else:
+ *
+ *  1. **It ranks; it does not delete.** The prefilter reorders candidates and the caller
+ *     shows a prefix of that order. Nothing is claimed to be irrelevant — the output says
+ *     how many were withheld and how to get them all back.
+ *  2. **Fail open, always.** No Ollama, wrong model, timeout, malformed reply, an index out
+ *     of range — every one of those returns null and the caller sends the unfiltered list.
+ *     A prefilter that fails closed would silently hide code from the model.
+ *  3. **Disclosed at the call site.** The caller must state that a local model did the
+ *     ranking. A subset presented as if it were the whole search is a lie by omission,
+ *     and the user cannot audit what they were not told happened.
+ *
+ * Opt-in: set `LEMMA_LOCAL_PREFILTER=1` (or `mcp.localPrefilter: true` in lemma.config.json).
+ * Off by default, because a wrong ranking costs a correct answer and the user should choose
+ * to accept that trade.
+ */
+export interface PrefilterConfig {
+    enabled: boolean;
+    url: string;
+    model: string;
+}
+export declare function loadPrefilterConfig(cwd?: string): PrefilterConfig;
+export declare function isLocalModelAvailable(config: PrefilterConfig): Promise<boolean>;
+export interface Candidate {
+    /** Stable identifier the caller uses to map a ranking back to its own data. */
+    id: string;
+    /** One short line describing the candidate — a path plus the matched text, typically. */
+    summary: string;
+}
+export interface RankResult {
+    /** Candidate ids, most relevant first. Contains every input id: ranking is not filtering. */
+    order: string[];
+    model: string;
+}
+/**
+ * Parse the model's reply into an ordering.
+ *
+ * Strict on purpose. A small model will sometimes emit prose, duplicate an index, or invent
+ * one; any of those means we do not actually know what it decided, and guessing at its
+ * intent is how the relevant file ends up ranked last. Anything not exactly parseable
+ * returns null, and the caller sends everything.
+ */
+export declare function parseRanking(reply: string, candidates: Candidate[]): string[] | null;
+/**
+ * Rank candidates with the local model. Returns null whenever ranking did not definitively
+ * succeed — the caller must then use its own original order and withhold nothing.
+ */
+export declare function rankCandidates(query: string, candidates: Candidate[], config?: PrefilterConfig): Promise<RankResult | null>;
+/** Test seam — the availability probe is cached for the process lifetime. */
+export declare function resetPrefilterProbe(): void;
+//# sourceMappingURL=LocalPrefilter.d.ts.map

package/dist/cjs/utils/LocalPrefilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LocalPrefilter.d.ts","sourceRoot":"","sources":["../../../src/utils/LocalPrefilter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAgBH,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf;AAED,wBAAgB,mBAAmB,CAAC,GAAG,GAAE,MAAsB,GAAG,eAAe,CAmBhF;AAUD,wBAAsB,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,OAAO,CAAC,CAerF;AAED,MAAM,WAAW,SAAS;IACxB,+EAA+E;IAC/E,EAAE,EAAE,MAAM,CAAC;IACX,yFAAyF;IACzF,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,UAAU;IACzB,6FAA6F;IAC7F,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACf;AAkBD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAqBpF;AAED;;;GAGG;AACH,wBAAsB,cAAc,CAClC,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,SAAS,EAAE,EACvB,MAAM,GAAE,eAAuC,GAC9C,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAuB5B;AAED,6EAA6E;AAC7E,wBAAgB,mBAAmB,IAAI,IAAI,CAE1C"}

package/dist/cjs/utils/LocalPrefilter.js

@@ -0,0 +1,169 @@
+"use strict";
+/**
+ * LocalPrefilter — spend a local model's tokens so the expensive one never sees the noise.
+ *
+ * A broad `search_workspace` returns 200 matches across 60 files. Four of them matter. The
+ * frontier model currently pays for all 200 — in the turn that produced them and in every
+ * turn afterwards, because tool results stay in the transcript. A 3B model running on the
+ * user's own machine can rank that list for free, in the local sense of free: no API cost,
+ * no context cost, no per-token billing.
+ *
+ * This is the one place in Lemma where a model's judgement decides what the main model
+ * sees, so the safety rules are stricter than anywhere else:
+ *
+ *  1. **It ranks; it does not delete.** The prefilter reorders candidates and the caller
+ *     shows a prefix of that order. Nothing is claimed to be irrelevant — the output says
+ *     how many were withheld and how to get them all back.
+ *  2. **Fail open, always.** No Ollama, wrong model, timeout, malformed reply, an index out
+ *     of range — every one of those returns null and the caller sends the unfiltered list.
+ *     A prefilter that fails closed would silently hide code from the model.
+ *  3. **Disclosed at the call site.** The caller must state that a local model did the
+ *     ranking. A subset presented as if it were the whole search is a lie by omission,
+ *     and the user cannot audit what they were not told happened.
+ *
+ * Opt-in: set `LEMMA_LOCAL_PREFILTER=1` (or `mcp.localPrefilter: true` in lemma.config.json).
+ * Off by default, because a wrong ranking costs a correct answer and the user should choose
+ * to accept that trade.
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.loadPrefilterConfig = loadPrefilterConfig;
+exports.isLocalModelAvailable = isLocalModelAvailable;
+exports.parseRanking = parseRanking;
+exports.rankCandidates = rankCandidates;
+exports.resetPrefilterProbe = resetPrefilterProbe;
+const fs_1 = __importDefault(require("fs"));
+const path_1 = __importDefault(require("path"));
+const axios_1 = __importDefault(require("axios"));
+const DEFAULT_MODEL = "qwen2.5-coder:3b";
+const PROBE_TIMEOUT_MS = 1500;
+const RANK_TIMEOUT_MS = 12000;
+/**
+ * Below this many candidates the local round-trip (latency the user waits on) is not worth
+ * it — the full list was already cheap.
+ */
+const MIN_CANDIDATES = 25;
+function loadPrefilterConfig(cwd = process.cwd()) {
+    let fileEnabled;
+    let fileModel;
+    try {
+        const raw = JSON.parse(fs_1.default.readFileSync(path_1.default.join(cwd, "lemma.config.json"), "utf8"));
+        if (typeof raw?.mcp?.localPrefilter === "boolean")
+            fileEnabled = raw.mcp.localPrefilter;
+        if (typeof raw?.mcp?.localPrefilterModel === "string")
+            fileModel = raw.mcp.localPrefilterModel;
+    }
+    catch {
+        // An unreadable config must never turn a feature on that the user did not ask for.
+    }
+    const envEnabled = process.env.LEMMA_LOCAL_PREFILTER;
+    const enabled = envEnabled === "1" || envEnabled === "true" ? true : envEnabled === "0" || envEnabled === "false" ? false : fileEnabled === true;
+    return {
+        enabled,
+        url: process.env.OLLAMA_URL || process.env.OLLAMA_HOST || "http://localhost:11434",
+        model: process.env.LEMMA_LOCAL_PREFILTER_MODEL || fileModel || DEFAULT_MODEL,
+    };
+}
+/**
+ * Availability is cached for the process: probing on every search would add a round-trip to
+ * the very path this is meant to make cheaper. A negative result is cached too — if Ollama
+ * isn't running at the start of a session it is almost never running by the end, and
+ * re-probing would tax every search with a timeout.
+ */
+let availability = { checked: false, available: false };
+async function isLocalModelAvailable(config) {
+    if (!config.enabled)
+        return false;
+    if (availability.checked)
+        return availability.available;
+    try {
+        const res = await axios_1.default.get(`${config.url}/api/tags`, { timeout: PROBE_TIMEOUT_MS });
+        const models = (res.data?.models || []).map((m) => String(m?.name ?? ""));
+        // A configured model that isn't pulled would fail on every call; treat that as
+        // unavailable rather than discovering it once per search.
+        const base = config.model.split(":")[0];
+        availability = { checked: true, available: models.some((m) => m === config.model || m.split(":")[0] === base) };
+    }
+    catch {
+        availability = { checked: true, available: false };
+    }
+    return availability.available;
+}
+function buildPrompt(query, candidates) {
+    const list = candidates.map((c, i) => `${i}. ${c.summary}`).join("\n");
+    return [
+        `A developer is searching a codebase for: "${query}"`,
+        ``,
+        `Below are search results, numbered. Rank them by how likely each is to be what the`,
+        `developer is looking for. Definitions and primary implementations rank above call`,
+        `sites; call sites rank above tests, mocks, generated files and build output.`,
+        ``,
+        list,
+        ``,
+        `Reply with ONLY the numbers, most relevant first, comma-separated. Include every`,
+        `number exactly once. No explanation, no other text.`,
+    ].join("\n");
+}
+/**
+ * Parse the model's reply into an ordering.
+ *
+ * Strict on purpose. A small model will sometimes emit prose, duplicate an index, or invent
+ * one; any of those means we do not actually know what it decided, and guessing at its
+ * intent is how the relevant file ends up ranked last. Anything not exactly parseable
+ * returns null, and the caller sends everything.
+ */
+function parseRanking(reply, candidates) {
+    const numbers = (reply.match(/\d+/g) || []).map((n) => parseInt(n, 10));
+    if (numbers.length === 0)
+        return null;
+    const seen = new Set();
+    const order = [];
+    for (const n of numbers) {
+        if (n < 0 || n >= candidates.length)
+            return null; // hallucinated index — reply is untrustworthy
+        if (seen.has(n))
+            continue; // a repeat is sloppy, not wrong; the first position stands
+        seen.add(n);
+        order.push(candidates[n].id);
+    }
+    // Anything the model left out is appended in its original order rather than dropped.
+    // Ranking is not filtering — the caller decides what to show, and it must be able to
+    // show all of them.
+    for (let i = 0; i < candidates.length; i++) {
+        if (!seen.has(i))
+            order.push(candidates[i].id);
+    }
+    return order;
+}
+/**
+ * Rank candidates with the local model. Returns null whenever ranking did not definitively
+ * succeed — the caller must then use its own original order and withhold nothing.
+ */
+async function rankCandidates(query, candidates, config = loadPrefilterConfig()) {
+    if (candidates.length < MIN_CANDIDATES)
+        return null;
+    if (!(await isLocalModelAvailable(config)))
+        return null;
+    try {
+        const res = await axios_1.default.post(`${config.url}/api/generate`, {
+            model: config.model,
+            prompt: buildPrompt(query, candidates),
+            stream: false,
+            // Deterministic: the same search should not reorder itself between calls, and
+            // creativity is worthless for a ranking task.
+            options: { temperature: 0, num_predict: 512 },
+        }, { timeout: RANK_TIMEOUT_MS });
+        const order = parseRanking(String(res.data?.response ?? ""), candidates);
+        return order ? { order, model: config.model } : null;
+    }
+    catch {
+        return null;
+    }
+}
+/** Test seam — the availability probe is cached for the process lifetime. */
+function resetPrefilterProbe() {
+    availability = { checked: false, available: false };
+}
+//# sourceMappingURL=LocalPrefilter.js.map

package/dist/cjs/utils/LocalPrefilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LocalPrefilter.js","sourceRoot":"","sources":["../../../src/utils/LocalPrefilter.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;;;;;AAsBH,kDAmBC;AAUD,sDAeC;AAuCD,oCAqBC;AAMD,wCA2BC;AAGD,kDAEC;AAlKD,4CAAoB;AACpB,gDAAwB;AACxB,kDAA0B;AAE1B,MAAM,aAAa,GAAG,kBAAkB,CAAC;AACzC,MAAM,gBAAgB,GAAG,IAAK,CAAC;AAC/B,MAAM,eAAe,GAAG,KAAM,CAAC;AAE/B;;;GAGG;AACH,MAAM,cAAc,GAAG,EAAE,CAAC;AAQ1B,SAAgB,mBAAmB,CAAC,MAAc,OAAO,CAAC,GAAG,EAAE;IAC7D,IAAI,WAAgC,CAAC;IACrC,IAAI,SAA6B,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAE,CAAC,YAAY,CAAC,cAAI,CAAC,IAAI,CAAC,GAAG,EAAE,mBAAmB,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QACrF,IAAI,OAAO,GAAG,EAAE,GAAG,EAAE,cAAc,KAAK,SAAS;YAAE,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC;QACxF,IAAI,OAAO,GAAG,EAAE,GAAG,EAAE,mBAAmB,KAAK,QAAQ;YAAE,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,mBAAmB,CAAC;IACjG,CAAC;IAAC,MAAM,CAAC;QACP,mFAAmF;IACrF,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IACrD,MAAM,OAAO,GAAG,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC;IAEjJ,OAAO;QACL,OAAO;QACP,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,wBAAwB;QAClF,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,2BAA2B,IAAI,SAAS,IAAI,aAAa;KAC7E,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,IAAI,YAAY,GAA6C,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAE3F,KAAK,UAAU,qBAAqB,CAAC,MAAuB;IACjE,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,YAAY,CAAC,OAAO;QAAE,OAAO,YAAY,CAAC,SAAS,CAAC;IAExD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,eAAK,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,WAAW,EAAE,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACrF,MAAM,MAAM,GAAa,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC;QACzF,+EAA+E;QAC/E,0DAA0D;QAC1D,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,YAAY,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;IAClH,CAAC;IAAC,MAAM,CAAC;QACP,YAAY,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACrD,CAAC;IACD,OAAO,YAAY,CAAC,SAAS,CAAC;AAChC,CAAC;AAeD,SAAS,WAAW,CAAC,KAAa,EAAE,UAAuB;IACzD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,OAAO;QACL,6CAA6C,KAAK,GAAG;QACrD,EAAE;QACF,oFAAoF;QACpF,mFAAmF;QACnF,8EAA8E;QAC9E,EAAE;QACF,IAAI;QACJ,EAAE;QACF,kFAAkF;QAClF,qDAAqD;KACtD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAC,KAAa,EAAE,UAAuB;IACjE,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACxE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,CAAC,8CAA8C;QAChG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,CAAC,2DAA2D;QACtF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,qFAAqF;IACrF,qFAAqF;IACrF,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACI,KAAK,UAAU,cAAc,CAClC,KAAa,EACb,UAAuB,EACvB,SAA0B,mBAAmB,EAAE;IAE/C,IAAI,UAAU,CAAC,MAAM,GAAG,cAAc;QAAE,OAAO,IAAI,CAAC;IACpD,IAAI,CAAC,CAAC,MAAM,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAExD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,eAAK,CAAC,IAAI,CAC1B,GAAG,MAAM,CAAC,GAAG,eAAe,EAC5B;YACE,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,MAAM,EAAE,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC;YACtC,MAAM,EAAE,KAAK;YACb,8EAA8E;YAC9E,8CAA8C;YAC9C,OAAO,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,GAAG,EAAE;SAC9C,EACD,EAAE,OAAO,EAAE,eAAe,EAAE,CAC7B,CAAC;QAEF,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QACzE,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,6EAA6E;AAC7E,SAAgB,mBAAmB;IACjC,YAAY,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AACtD,CAAC"}

package/dist/cjs/utils/OutputDelta.d.ts

@@ -0,0 +1,60 @@
+/**
+ * OutputDelta — re-send only what changed, never the whole thing again.
+ *
+ * The problem: a debug loop reads the same file (or runs the same command) six times.
+ * Between two of those calls maybe three lines moved, but the model pays for the entire
+ * file or the entire 400-line `tsc` dump each time — and because tool results stay in the
+ * transcript, it keeps paying for every copy on every subsequent turn.
+ *
+ * `ReadWorkspaceCache` already suppresses the *identical* case. This module covers the far
+ * more common one: it changed, but barely.
+ *
+ * Two rules this module is built around:
+ *
+ *  1. The diff is computed against the exact text the model received. Not the file on
+ *     disk, not the pre-squeeze source — the final emitted string. A diff against
+ *     anything else describes a document the model never had, which is worse than
+ *     re-sending the whole file.
+ *  2. A delta is only emitted when it is decisively smaller than the full text. Below
+ *     that margin, reconstructing from a diff is cognitive work with no token payoff, so
+ *     the full text wins. See `shouldEmitDelta`.
+ */
+export interface Hunk {
+    /** 1-indexed start line in the previous text. */
+    oldStart: number;
+    oldLines: number;
+    /** 1-indexed start line in the new text. */
+    newStart: number;
+    newLines: number;
+    /** Rendered lines, each prefixed with ' ', '-' or '+'. */
+    lines: string[];
+}
+export interface DiffResult {
+    hunks: Hunk[];
+    added: number;
+    removed: number;
+    /** True when the two texts are byte-identical. */
+    identical: boolean;
+}
+/** Line-level diff between the text the model already has and the text we would send now. */
+export declare function computeDiff(previous: string, next: string): DiffResult | null;
+/** Render hunks as a unified diff body (no ---/+++ file headers; the caller supplies context). */
+export declare function renderDiff(diff: DiffResult): string;
+export interface DeltaDecision {
+    emit: boolean;
+    /** The rendered diff body, present only when `emit` is true. */
+    body?: string;
+    added: number;
+    removed: number;
+    hunkCount: number;
+    /** Why a delta was declined — surfaced in logs and receipts, never guessed at. */
+    reason?: string;
+}
+/**
+ * Decide whether to hand the model a delta instead of the full text.
+ *
+ * Declining is the safe direction: the caller falls back to sending everything, which is
+ * always correct. So every uncertain case here resolves to `emit: false`.
+ */
+export declare function shouldEmitDelta(previous: string, next: string): DeltaDecision;
+//# sourceMappingURL=OutputDelta.d.ts.map

package/dist/cjs/utils/OutputDelta.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OutputDelta.d.ts","sourceRoot":"","sources":["../../../src/utils/OutputDelta.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AA2BH,MAAM,WAAW,IAAI;IACnB,iDAAiD;IACjD,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,0DAA0D;IAC1D,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,kDAAkD;IAClD,SAAS,EAAE,OAAO,CAAC;CACpB;AA4HD,6FAA6F;AAC7F,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAY7E;AAED,kGAAkG;AAClG,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAInD;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,OAAO,CAAC;IACd,gEAAgE;IAChE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,aAAa,CA+B7E"}