@nxuss/lemma 1.7.1 → 1.7.2

package/dist/cjs/mcp/tools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tools.d.ts","sourceRoot":"","sources":["../../../src/mcp/tools.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,2CAA2C,CAAC;AA2hCnE,oFAAoF;AACpF,wBAAgB,kBAAkB,IAAI,MAAM,CAM3C;AAED,oEAAoE;AACpE,wBAAgB,sBAAsB,IAAI,MAAM,EAAE,CAEjD;AAED,iEAAiE;AACjE,wBAAgB,sBAAsB,IAAI,MAAM,EAAE,CAEjD;AAED,iFAAiF;AACjF,wBAAgB,qBAAqB,IAAI;IACvC,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAQA;AAoHD,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC1B,MAAM,EAAE,IAAI,GAAG,OAAO,GAAG,KAAK,GAAG,MAAM,CAAC;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,aAAa,KAAK,IAAI,GAC1C,IAAI,CA+DN"}
+{"version":3,"file":"tools.d.ts","sourceRoot":"","sources":["../../../src/mcp/tools.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,2CAA2C,CAAC;AAiiCnE,oFAAoF;AACpF,wBAAgB,kBAAkB,IAAI,MAAM,CAM3C;AAED,oEAAoE;AACpE,wBAAgB,sBAAsB,IAAI,MAAM,EAAE,CAEjD;AAED,iEAAiE;AACjE,wBAAgB,sBAAsB,IAAI,MAAM,EAAE,CAEjD;AAED,iFAAiF;AACjF,wBAAgB,qBAAqB,IAAI;IACvC,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAQA;AAoHD,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC1B,MAAM,EAAE,IAAI,GAAG,OAAO,GAAG,KAAK,GAAG,MAAM,CAAC;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAqCD,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,aAAa,KAAK,IAAI,GAC1C,IAAI,CAwEN"}

package/dist/cjs/mcp/tools.js

@@ -146,6 +146,11 @@ const toolDefinitions = [
             properties: {
                 query: { type: "string", description: "The natural language query" },
                 limit: { type: "number", description: "Maximum results to return", default: 5 },
+                minSimilarity: {
+                    type: "number",
+                    description: "Similarity floor (0.0-1.0) a memory must clear to be returned. Lowering this surfaces loosely related memories that are usually noise — leave it alone unless a known-relevant memory is being filtered out.",
+                    default: 0.75,
+                },
             },
             required: ["query"],
         },
@@ -1199,6 +1204,41 @@ async function handleToolbox(args) {
     }
     throw new Error(`Unknown action: ${action}. Use 'list', 'schema', or 'call'.`);
 }
+/** Tools whose whole job is to put file contents into the model's context. */
+const FILE_READ_TOOLS = new Set([
+    "read_workspace_file",
+    "smart_file_slice",
+    "get_symbol_surgical_context",
+    "get_ast_hologram",
+    "list_workspace_dir",
+    "search_workspace",
+    "read_token_budgeted",
+    "bulk_file_digest",
+    "import_tree_context",
+]);
+function receiptTypeForTool(name) {
+    return FILE_READ_TOOLS.has(name) ? "file_read" : "tool_call";
+}
+/**
+ * A receipt entry is only useful if it says what the call was about. Pull the most
+ * identifying argument without dragging whole file contents into the ledger.
+ */
+function receiptLabelMeta(name, args) {
+    if (!args)
+        return {};
+    const meta = {};
+    if (typeof args.filePath === "string")
+        meta.filePath = args.filePath;
+    if (typeof args.dirPath === "string")
+        meta.dirPath = args.dirPath;
+    if (typeof args.query === "string")
+        meta.query = args.query.substring(0, 100);
+    if (typeof args.command === "string")
+        meta.command = args.command.substring(0, 100);
+    if (typeof args.symbolName === "string")
+        meta.symbolName = args.symbolName;
+    return meta;
+}
 function setupToolsHandlers(server, onToolCall) {
     server.setRequestHandler(types_js_1.ListToolsRequestSchema, async () => ({
         tools: toolDefinitionsArray,
@@ -1233,7 +1273,16 @@ function setupToolsHandlers(server, onToolCall) {
             throw new Error(`Unknown tool: ${name}`);
         }
         try {
+            // Sampled around the handler so a tool that logs its own, more specific event
+            // (a cache hit, a miss) isn't double-counted by the generic entry below.
+            const ledgerBefore = (0, TokenReceipt_1.getLedgerLength)();
             const result = await handler((args || {}));
+            if ((0, TokenReceipt_1.getLedgerLength)() === ledgerBefore) {
+                (0, TokenReceipt_1.recordReceiptEvent)(receiptTypeForTool(name), name, {
+                    tool: name,
+                    ...receiptLabelMeta(name, args),
+                });
+            }
             const tokensImpact = (0, utils_1.estimateTokensFromResult)(result);
             onToolCall?.({
                 tool: name,
@@ -1268,16 +1317,35 @@ async function handleScrubPrivacy(args) {
     const { maskedPrompt } = scrubber.mask(text);
     return { content: [{ type: "text", text: maskedPrompt }] };
 }
+/**
+ * Minimum similarity for a stored memory to be offered for reuse. Shared by
+ * search_memory and smarter_cache so the two never disagree about whether the same
+ * query is a hit.
+ */
+const DEFAULT_MEMORY_SIMILARITY_FLOOR = 0.75;
 async function handleSearchMemory(args) {
     const query = args?.query;
     const limit = args?.limit || 5;
+    // A floor of 0 returns the nearest neighbour no matter how unrelated it is, and the
+    // formatting below then presents it as a reusable memory. Match smarter_cache's
+    // threshold so both paths agree on what counts as a hit.
+    const minSimilarity = typeof args?.minSimilarity === "number" ? args.minSimilarity : DEFAULT_MEMORY_SIMILARITY_FLOOR;
     if (!query)
         throw new Error("Query is required");
     try {
         const brain = (0, TheBrainV2_1.getBrain)();
-        const results = brain.search(query, limit, 0, { projectId: (0, TheBrainV2_1.deriveProjectId)() });
+        const results = brain.search(query, limit, minSimilarity, { projectId: (0, TheBrainV2_1.deriveProjectId)() });
         if (results.length === 0) {
-            return { content: [{ type: "text", text: "No relevant memories found in Lemma's Brain." }] };
+            (0, TokenReceipt_1.recordReceiptEvent)("reasoning", query.substring(0, 100), {
+                tool: "search_memory",
+                reason: `no memory above the ${minSimilarity} similarity floor`,
+            });
+            return {
+                content: [{
+                        type: "text",
+                        text: `No memory in Lemma's Brain scored at or above the ${(minSimilarity * 100).toFixed(0)}% similarity floor for this query. Investigate from scratch — there is nothing safe to reuse.`,
+                    }],
+            };
         }
         const fresh = results.filter((r) => r.fresh);
         const stale = results.filter((r) => !r.fresh);
@@ -1288,6 +1356,17 @@ async function handleSearchMemory(args) {
             const bestFresh = fresh[0];
             const tokensSaved = Math.max(100, Math.floor(String(bestFresh.response).length / 4));
             (0, reportSavings_1.reportSavings)({ source: "cache", tokens: tokensSaved, toolName: "search_memory", query: query.substring(0, 100) });
+            (0, TokenReceipt_1.recordReceiptEvent)("semantic_cache_hit", query.substring(0, 100), {
+                tool: "search_memory",
+                similarity: bestFresh.similarity,
+                tokensSaved,
+            });
+        }
+        else {
+            (0, TokenReceipt_1.recordReceiptEvent)("reasoning", query.substring(0, 100), {
+                tool: "search_memory",
+                reason: `${stale.length} similar memory/memories found but all stale — must re-verify`,
+            });
         }
         const parts = [];
         if (fresh.length > 0) {
@@ -1316,12 +1395,13 @@ async function handleStoreMemory(args) {
     try {
         const brain = (0, TheBrainV2_1.getBrain)();
         const storeRes = brain.store(query, responseText, provider, 0.92, filePaths);
-        const tokensSaved = Math.max(100, Math.floor(responseText.length / 4));
-        (0, reportSavings_1.reportSavings)({
-            source: "cache",
-            tokens: tokensSaved,
-            toolName: "store_memory",
-            query: query.substring(0, 100),
+        // Storing a memory saves nothing — it only creates the chance of a saving later.
+        // Crediting tokens here inflated the ledger on write and then credited the same
+        // answer again on every read. The saving is booked by search_memory on a fresh hit.
+        (0, TokenReceipt_1.recordReceiptEvent)("tool_call", `store_memory: ${query.substring(0, 100)}`, {
+            tool: "store_memory",
+            filePaths,
+            note: "memory written — no tokens saved yet",
         });
         const trackingNote = filePaths && filePaths.length > 0 ? ` Tracking freshness against ${filePaths.length} file(s) — this memory auto-invalidates if they change.` : "";
         return { content: [{ type: "text", text: `Success: Memory stored. ${storeRes.reason}${trackingNote}` }] };
@@ -1843,7 +1923,7 @@ async function handleGetProjectOnboarding(_args) {
         ],
     };
 }
-function extractSymbolsWithTsCompiler(filePath, relPath) {
+function extractSymbolsWithTsCompiler(filePath, relPath, parseErrors) {
     try {
         const src = fs_1.default.readFileSync(filePath, "utf8");
         const sourceFile = ts.createSourceFile(filePath, src, ts.ScriptTarget.Latest, true);
@@ -1851,7 +1931,10 @@ function extractSymbolsWithTsCompiler(filePath, relPath) {
         function visit(node) {
             const mods = ts.canHaveModifiers(node) ? ts.getModifiers(node) : undefined;
             const isExport = mods?.some((m) => m.kind === ts.SyntaxKind.ExportKeyword);
-            if (isExport || ts.isSourceFile(node.parent)) {
+            // node.parent is undefined on the SourceFile root itself, and ts.isSourceFile()
+            // dereferences .kind without a guard — calling it unguarded threw on the very
+            // first visit(), so the catch below swallowed it and every file returned [].
+            if (isExport || (node.parent && ts.isSourceFile(node.parent))) {
                 if (ts.isFunctionDeclaration(node) && node.name) {
                     symbols.push({
                         kind: "function",
@@ -1920,10 +2003,11 @@ function extractSymbolsWithTsCompiler(filePath, relPath) {
     }
     catch (err) {
         (0, utils_1.logWarn)("get_ast_hologram", `Could not parse ${relPath}: ${err}`);
+        parseErrors?.push(`${relPath}: ${err}`);
         return [];
     }
 }
-function walkDirForHologram(dir, rel, extensions) {
+function walkDirForHologram(dir, rel, extensions, stats) {
     let allSymbols = [];
     try {
         const entries = fs_1.default.readdirSync(dir, { withFileTypes: true });
@@ -1933,18 +2017,20 @@ function walkDirForHologram(dir, rel, extensions) {
             const fullPath = path_1.default.join(dir, entry.name);
             const relPath = rel ? path_1.default.join(rel, entry.name) : entry.name;
             if (entry.isDirectory()) {
-                allSymbols = allSymbols.concat(walkDirForHologram(fullPath, relPath, extensions));
+                allSymbols = allSymbols.concat(walkDirForHologram(fullPath, relPath, extensions, stats));
             }
             else {
                 const ext = entry.name.split(".").pop() || "";
                 if (extensions.includes(ext)) {
-                    allSymbols = allSymbols.concat(extractSymbolsWithTsCompiler(fullPath, relPath));
+                    stats.filesScanned++;
+                    allSymbols = allSymbols.concat(extractSymbolsWithTsCompiler(fullPath, relPath, stats.parseErrors));
                 }
             }
         }
     }
     catch (err) {
         (0, utils_1.logWarn)("get_ast_hologram", `Error walking dir ${dir}: ${err}`);
+        stats.parseErrors.push(`walk ${rel || "."}: ${err}`);
     }
     return allSymbols;
 }
@@ -1953,18 +2039,32 @@ async function handleGetAstHologram(args) {
     const extensions = args?.extensions || ["ts", "tsx", "js", "jsx"];
     const workspaceRoot = process.cwd();
     const { resolved } = (0, utils_1.safeResolvePath)(workspaceRoot, dirPath);
-    const symbols = walkDirForHologram(resolved, dirPath, extensions);
+    const stats = { filesScanned: 0, parseErrors: [] };
+    const symbols = walkDirForHologram(resolved, dirPath, extensions, stats);
     const byFile = {};
     symbols.forEach((s) => {
         if (!byFile[s.file])
             byFile[s.file] = [];
         byFile[s.file].push({ kind: s.kind, name: s.name, line: s.line });
     });
+    // An empty map is reported as a failure, not as an answer: a silent "0 symbols" is
+    // indistinguishable from a working scan of an empty dir, which is how a parse bug
+    // stayed invisible here before. Say when nothing could be read.
+    const warning = stats.filesScanned === 0
+        ? `No files matching [${extensions.join(", ")}] were found under "${dirPath || "."}" — check the path and extensions.`
+        : symbols.length === 0
+            ? `Scanned ${stats.filesScanned} file(s) but extracted 0 symbols — this is very likely an extraction failure, not an empty codebase. Do not treat this as "the directory has no exports".`
+            : undefined;
     const hologram = {
         workspace: path_1.default.basename(workspaceRoot),
         scannedDir: dirPath || ".",
         totalSymbols: symbols.length,
+        filesScanned: stats.filesScanned,
         totalFiles: Object.keys(byFile).length,
+        ...(warning ? { warning } : {}),
+        ...(stats.parseErrors.length > 0
+            ? { parseErrors: stats.parseErrors.slice(0, 10), parseErrorCount: stats.parseErrors.length }
+            : {}),
         map: byFile,
     };
     return { content: [{ type: "text", text: JSON.stringify(hologram, null, 2) }] };
@@ -2367,7 +2467,7 @@ async function handleCompressContext(args) {
 async function handleSmarterCache(args) {
     const query = args?.query;
     const context = args?.context || "";
-    const threshold = typeof args?.threshold === "number" ? args.threshold : 0.75;
+    const threshold = typeof args?.threshold === "number" ? args.threshold : DEFAULT_MEMORY_SIMILARITY_FLOOR;
     if (!query)
         throw new Error("query is required");
     const fullQuery = context ? `${query}\n\nContext: ${context}` : query;