@j0hanz/memory-mcp 0.1.0

package/dist/tools/memory-stats.js

@@ -0,0 +1,60 @@
+import { E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { MemoryStatsInputSchema } from '../schemas/inputs.js';
+import { StatsResultSchema } from '../schemas/outputs.js';
+const TOTAL_MEMORIES_SQL = 'SELECT COUNT(*) AS total FROM memories';
+const TOTAL_RELATIONSHIPS_SQL = 'SELECT COUNT(*) AS total FROM relationships';
+const TYPE_COUNTS_SQL = 'SELECT memory_type, COUNT(*) AS count FROM memories GROUP BY memory_type ORDER BY count DESC';
+const OLDEST_MEMORY_SQL = 'SELECT MIN(created_at) AS oldest FROM memories';
+const NEWEST_MEMORY_SQL = 'SELECT MAX(created_at) AS newest FROM memories';
+const AVG_IMPORTANCE_SQL = 'SELECT AVG(importance) AS avg_importance FROM memories';
+function toTypeCounts(rows) {
+    const byType = {};
+    for (const row of rows) {
+        byType[row.memory_type] = row.count;
+    }
+    return byType;
+}
+function getTotalCount(db, sql) {
+    return db.prepare(sql).get()?.total ?? 0;
+}
+export function registerMemoryStats(server, db) {
+    server.registerTool('memory_stats', {
+        title: 'Memory Stats',
+        description: 'Return aggregate statistics about the memory store (counts, oldest/newest timestamps, breakdown by type).',
+        inputSchema: MemoryStatsInputSchema,
+        outputSchema: StatsResultSchema,
+        annotations: { readOnlyHint: true, openWorldHint: false },
+    }, () => {
+        try {
+            const totalMemories = getTotalCount(db, TOTAL_MEMORIES_SQL);
+            const totalRelationships = getTotalCount(db, TOTAL_RELATIONSHIPS_SQL);
+            const typeRows = db.prepare(TYPE_COUNTS_SQL).all();
+            const oldestRow = db.prepare(OLDEST_MEMORY_SQL).get();
+            const newestRow = db.prepare(NEWEST_MEMORY_SQL).get();
+            const avgImportanceRow = db
+                .prepare(AVG_IMPORTANCE_SQL)
+                .get();
+            const byType = toTypeCounts(typeRows);
+            return createToolResponse({
+                ok: true,
+                result: {
+                    memories: {
+                        total: totalMemories,
+                        oldest: oldestRow?.oldest ?? null,
+                        newest: newestRow?.newest ?? null,
+                        avg_importance: avgImportanceRow?.avg_importance ?? null,
+                    },
+                    relationships: {
+                        total: totalRelationships,
+                    },
+                    by_type: byType,
+                },
+            });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=memory-stats.js.map

package/dist/tools/memory-stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-stats.js","sourceRoot":"","sources":["../../src/tools/memory-stats.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAM1D,MAAM,kBAAkB,GAAG,wCAAwC,CAAC;AACpE,MAAM,uBAAuB,GAAG,6CAA6C,CAAC;AAC9E,MAAM,eAAe,GACnB,8FAA8F,CAAC;AACjG,MAAM,iBAAiB,GAAG,gDAAgD,CAAC;AAC3E,MAAM,iBAAiB,GAAG,gDAAgD,CAAC;AAC3E,MAAM,kBAAkB,GACtB,wDAAwD,CAAC;AAE3D,SAAS,YAAY,CAAC,IAAe;IACnC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;IACtC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,aAAa,CAAC,EAAW,EAAE,GAAW;IAC7C,OAAO,EAAE,CAAC,OAAO,CAAW,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAiB,EAAE,EAAW;IAChE,MAAM,CAAC,YAAY,CACjB,cAAc,EACd;QACE,KAAK,EAAE,cAAc;QACrB,WAAW,EACT,2GAA2G;QAC7G,WAAW,EAAE,sBAAsB;QACnC,YAAY,EAAE,iBAAiB;QAC/B,WAAW,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE;KAC1D,EACD,GAAG,EAAE;QACH,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,aAAa,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC;YAC5D,MAAM,kBAAkB,GAAG,aAAa,CAAC,EAAE,EAAE,uBAAuB,CAAC,CAAC;YAEtE,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAU,eAAe,CAAC,CAAC,GAAG,EAAE,CAAC;YAE5D,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAY,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC;YAEjE,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAY,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC;YAEjE,MAAM,gBAAgB,GAAG,EAAE;iBACxB,OAAO,CAAmB,kBAAkB,CAAC;iBAC7C,GAAG,EAAE,CAAC;YAET,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;YAEtC,OAAO,kBAAkB,CAAC;gBACxB,EAAE,EAAE,IAAI;gBACR,MAAM,EAAE;oBACN,QAAQ,EAAE;wBACR,KAAK,EAAE,aAAa;wBACpB,MAAM,EAAE,SAAS,EAAE,MAAM,IAAI,IAAI;wBACjC,MAAM,EAAE,SAAS,EAAE,MAAM,IAAI,IAAI;wBACjC,cAAc,EAAE,gBAAgB,EAAE,cAAc,IAAI,IAAI;qBACzD;oBACD,aAAa,EAAE;wBACb,KAAK,EAAE,kBAAkB;qBAC1B;oBACD,OAAO,EAAE,MAAM;iBAChB;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,mBAAmB,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/recall.d.ts

@@ -0,0 +1,4 @@
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { TypedDb } from '../db/typed.js';
+export declare function registerRecall(server: McpServer, db: TypedDb): void;
+//# sourceMappingURL=recall.d.ts.map

package/dist/tools/recall.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall.d.ts","sourceRoot":"","sources":["../../src/tools/recall.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAMzE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAqO9C,wBAAgB,cAAc,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CA8DnE"}

package/dist/tools/recall.js

@@ -0,0 +1,192 @@
+import process from 'node:process';
+import { E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { decodeCursor, encodeCursor, splitPage } from '../lib/pagination.js';
+import { buildAndWhereClause, buildFilterClauses, sanitizeFtsQuery, } from '../lib/search.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { parseMemoryRow } from '../lib/types.js';
+import { RecallInputSchema } from '../schemas/inputs.js';
+import { RecallResultSchema } from '../schemas/outputs.js';
+function parseEnvInt(name, fallback, min, max) {
+    const raw = process.env[name];
+    if (raw == null)
+        return fallback;
+    const parsed = parseInt(raw, 10);
+    if (Number.isNaN(parsed))
+        return fallback;
+    return Math.max(min, Math.min(max, parsed));
+}
+const MAX_FRONTIER_SIZE = parseEnvInt('RECALL_MAX_FRONTIER_SIZE', 1000, 100, 50000);
+const MAX_EDGE_ROWS = parseEnvInt('RECALL_MAX_EDGE_ROWS', 5000, 100, 50000);
+const MAX_VISITED_NODES = parseEnvInt('RECALL_MAX_VISITED_NODES', 5000, 100, 50000);
+function toMemoryFilters(params) {
+    const filters = {};
+    if (params.min_importance != null) {
+        filters.min_importance = params.min_importance;
+    }
+    if (params.max_importance != null) {
+        filters.max_importance = params.max_importance;
+    }
+    if (params.memory_type != null) {
+        filters.memory_type = params.memory_type;
+    }
+    return filters;
+}
+function createPlaceholders(count) {
+    return new Array(count).fill('?').join(',');
+}
+function loadSeedRows(db, query, limit, offset, filters) {
+    const ftsQuery = sanitizeFtsQuery(query);
+    const filter = buildFilterClauses(filters);
+    const whereExtra = buildAndWhereClause(filter.clauses);
+    return db
+        .prepare(`SELECT m.*, memories_fts.rank AS rank FROM memories m
+       JOIN memories_fts ON memories_fts.rowid = m.rowid
+       WHERE memories_fts MATCH ?${whereExtra}
+       ORDER BY memories_fts.rank
+       LIMIT ? OFFSET ?`)
+        .all(ftsQuery, ...filter.params, limit + 1, offset);
+}
+function traverseGraph(db, seeds, depth, signal, onHop) {
+    const visited = new Set(seeds.map((r) => r.hash));
+    const edges = [];
+    const seenEdges = new Set();
+    let frontier = seeds.map((r) => r.hash);
+    let depthReached = 0;
+    let aborted = false;
+    for (let hop = 0; hop < depth && frontier.length > 0; hop++) {
+        if (signal?.aborted) {
+            aborted = true;
+            break;
+        }
+        depthReached = hop + 1;
+        onHop?.(hop, depth);
+        if (frontier.length > MAX_FRONTIER_SIZE) {
+            frontier = frontier.slice(0, MAX_FRONTIER_SIZE);
+            aborted = true;
+        }
+        const remainingEdgeBudget = MAX_EDGE_ROWS - edges.length;
+        const remainingNodeBudget = MAX_VISITED_NODES - visited.size;
+        if (remainingEdgeBudget <= 0 || remainingNodeBudget <= 0) {
+            aborted = true;
+            break;
+        }
+        const placeholders = createPlaceholders(frontier.length);
+        const edgeRows = db
+            .prepare(`SELECT from_hash, to_hash, relation_type FROM relationships
+         WHERE from_hash IN (${placeholders}) OR to_hash IN (${placeholders})
+         LIMIT ?`)
+            .all(...frontier, ...frontier, remainingEdgeBudget + 1);
+        const rows = edgeRows.length > remainingEdgeBudget
+            ? edgeRows.slice(0, remainingEdgeBudget)
+            : edgeRows;
+        if (edgeRows.length > remainingEdgeBudget) {
+            aborted = true;
+        }
+        const nextHashes = [];
+        for (const edge of rows) {
+            const edgeKey = `${edge.from_hash}|${edge.to_hash}|${edge.relation_type}`;
+            if (!seenEdges.has(edgeKey)) {
+                seenEdges.add(edgeKey);
+                edges.push({
+                    from_hash: edge.from_hash,
+                    to_hash: edge.to_hash,
+                    relation_type: edge.relation_type,
+                });
+            }
+            for (const h of [edge.from_hash, edge.to_hash]) {
+                if (!visited.has(h)) {
+                    if (visited.size >= MAX_VISITED_NODES) {
+                        aborted = true;
+                        break;
+                    }
+                    visited.add(h);
+                    if (nextHashes.length < MAX_FRONTIER_SIZE) {
+                        nextHashes.push(h);
+                    }
+                    else {
+                        aborted = true;
+                    }
+                }
+            }
+            if (aborted &&
+                (edges.length >= MAX_EDGE_ROWS || visited.size >= MAX_VISITED_NODES)) {
+                break;
+            }
+        }
+        frontier = nextHashes;
+    }
+    return { edges, visited, depthReached, aborted };
+}
+function loadMemoriesByHashes(db, hashes) {
+    if (hashes.length === 0) {
+        return [];
+    }
+    const placeholders = createPlaceholders(hashes.length);
+    const memRows = db
+        .prepare(`SELECT * FROM memories WHERE hash IN (${placeholders})`)
+        .all(...hashes);
+    return memRows.map(parseMemoryRow);
+}
+function createHopNotifier(progressToken, sendNotification) {
+    if (progressToken == null) {
+        return undefined;
+    }
+    return (hop, total) => {
+        void sendNotification({
+            method: 'notifications/progress',
+            params: { progressToken, progress: hop + 1, total },
+        }).catch(() => { });
+    };
+}
+function toProgressToken(value) {
+    if (typeof value === 'string' || typeof value === 'number') {
+        return value;
+    }
+    return undefined;
+}
+export function registerRecall(server, db) {
+    server.registerTool('recall', {
+        title: 'Recall (BFS Graph Traversal)',
+        description: 'Search memories by full-text query, then traverse the relationship graph up to `depth` hops via BFS. Returns all discovered memories and the edges connecting them.',
+        inputSchema: RecallInputSchema,
+        outputSchema: RecallResultSchema,
+        annotations: { readOnlyHint: true, openWorldHint: false },
+    }, (params, { signal, _meta, sendNotification }) => {
+        try {
+            const { depth, limit, cursor } = params;
+            const offset = cursor ? decodeCursor(cursor) : 0;
+            const onHop = createHopNotifier(toProgressToken(_meta?.progressToken), sendNotification);
+            // Step 1: FTS seed search
+            const seedRows = loadSeedRows(db, params.query, limit, offset, toMemoryFilters(params));
+            const { page: pageSeeds, hasMore } = splitPage(seedRows, limit);
+            // Step 2: BFS traversal up to `depth` hops
+            const traversal = traverseGraph(db, pageSeeds, depth, signal, onHop);
+            // Step 3: Load all discovered memory rows
+            const allHashes = Array.from(traversal.visited);
+            const seedRelevance = new Map();
+            for (const seed of pageSeeds) {
+                if (seed.rank != null)
+                    seedRelevance.set(seed.hash, -seed.rank);
+            }
+            const memories = loadMemoriesByHashes(db, allHashes).map((m) => {
+                const rel = seedRelevance.get(m.hash);
+                return rel != null ? { ...m, relevance: rel } : m;
+            });
+            const nextCursor = hasMore ? encodeCursor(offset + limit) : undefined;
+            return createToolResponse({
+                ok: true,
+                result: {
+                    memories,
+                    graph: traversal.edges,
+                    depth_reached: traversal.depthReached,
+                    ...(traversal.aborted ? { aborted: true } : {}),
+                    ...(nextCursor ? { nextCursor } : {}),
+                },
+            });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=recall.js.map

package/dist/tools/recall.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall.js","sourceRoot":"","sources":["../../src/tools/recall.ts"],"names":[],"mappings":"AAEA,OAAO,OAAO,MAAM,cAAc,CAAC;AAKnC,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAC7E,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAOjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAS3D,SAAS,WAAW,CAClB,IAAY,EACZ,QAAgB,EAChB,GAAW,EACX,GAAW;IAEX,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,GAAG,IAAI,IAAI;QAAE,OAAO,QAAQ,CAAC;IACjC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACjC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,iBAAiB,GAAG,WAAW,CACnC,0BAA0B,EAC1B,IAAI,EACJ,GAAG,EACH,KAAK,CACN,CAAC;AACF,MAAM,aAAa,GAAG,WAAW,CAAC,sBAAsB,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAC5E,MAAM,iBAAiB,GAAG,WAAW,CACnC,0BAA0B,EAC1B,IAAI,EACJ,GAAG,EACH,KAAK,CACN,CAAC;AAEF,SAAS,eAAe,CAAC,MAAmB;IAC1C,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,MAAM,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;QAClC,OAAO,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;IACjD,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;QAClC,OAAO,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;IACjD,CAAC;IACD,IAAI,MAAM,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAC3C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAa;IACvC,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,YAAY,CACnB,EAAW,EACX,KAAa,EACb,KAAa,EACb,MAAc,EACd,OAAsB;IAEtB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvD,OAAO,EAAE;SACN,OAAO,CACN;;mCAE6B,UAAU;;wBAErB,CACnB;SACA,GAAG,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,aAAa,CACpB,EAAW,EACX,KAAkB,EAClB,KAAa,EACb,MAAoB,EACpB,KAAwB;IAOxB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAuB,EAAE,CAAC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,IAAI,QAAQ,GAAa,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QAC5D,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,OAAO,GAAG,IAAI,CAAC;YACf,MAAM;QACR,CAAC;QACD,YAAY,GAAG,GAAG,GAAG,CAAC,CAAC;QACvB,KAAK,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACpB,IAAI,QAAQ,CAAC,MAAM,GAAG,iBAAiB,EAAE,CAAC;YACxC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;YAChD,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,MAAM,mBAAmB,GAAG,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC;QACzD,MAAM,mBAAmB,GAAG,iBAAiB,GAAG,OAAO,CAAC,IAAI,CAAC;QAC7D,IAAI,mBAAmB,IAAI,CAAC,IAAI,mBAAmB,IAAI,CAAC,EAAE,CAAC;YACzD,OAAO,GAAG,IAAI,CAAC;YACf,MAAM;QACR,CAAC;QAED,MAAM,YAAY,GAAG,kBAAkB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,EAAE;aAChB,OAAO,CACN;+BACuB,YAAY,oBAAoB,YAAY;iBAC1D,CACV;aACA,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,mBAAmB,GAAG,CAAC,CAAC,CAAC;QAE1D,MAAM,IAAI,GACR,QAAQ,CAAC,MAAM,GAAG,mBAAmB;YACnC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC;YACxC,CAAC,CAAC,QAAQ,CAAC;QACf,IAAI,QAAQ,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;YAC1C,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QAED,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YAC1E,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC;oBACT,SAAS,EAAE,IAAI,CAAC,SAAS;oBACzB,OAAO,EAAE,IAAI,CAAC,OAAO;oBACrB,aAAa,EAAE,IAAI,CAAC,aAAa;iBAClC,CAAC,CAAC;YACL,CAAC;YAED,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,IAAI,OAAO,CAAC,IAAI,IAAI,iBAAiB,EAAE,CAAC;wBACtC,OAAO,GAAG,IAAI,CAAC;wBACf,MAAM;oBACR,CAAC;oBACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACf,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,EAAE,CAAC;wBAC1C,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACrB,CAAC;yBAAM,CAAC;wBACN,OAAO,GAAG,IAAI,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IACE,OAAO;gBACP,CAAC,KAAK,CAAC,MAAM,IAAI,aAAa,IAAI,OAAO,CAAC,IAAI,IAAI,iBAAiB,CAAC,EACpE,CAAC;gBACD,MAAM;YACR,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,UAAU,CAAC;IACxB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC;AACnD,CAAC;AAED,SAAS,oBAAoB,CAAC,EAAW,EAAE,MAAgB;IACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,YAAY,GAAG,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,OAAO,GAAG,EAAE;SACf,OAAO,CACN,yCAAyC,YAAY,GAAG,CACzD;SACA,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAClB,OAAO,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,iBAAiB,CACxB,aAAwC,EACxC,gBAGmB;IAEnB,IAAI,aAAa,IAAI,IAAI,EAAE,CAAC;QAC1B,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,CAAC,GAAW,EAAE,KAAa,EAAE,EAAE;QACpC,KAAK,gBAAgB,CAAC;YACpB,MAAM,EAAE,wBAAwB;YAChC,MAAM,EAAE,EAAE,aAAa,EAAE,QAAQ,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;SACpD,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,MAAiB,EAAE,EAAW;IAC3D,MAAM,CAAC,YAAY,CACjB,QAAQ,EACR;QACE,KAAK,EAAE,8BAA8B;QACrC,WAAW,EACT,qKAAqK;QACvK,WAAW,EAAE,iBAAiB;QAC9B,YAAY,EAAE,kBAAkB;QAChC,WAAW,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE;KAC1D,EACD,CAAC,MAAmB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,EAAE,EAAE,EAAE;QAC3D,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEjD,MAAM,KAAK,GAAG,iBAAiB,CAC7B,eAAe,CAAC,KAAK,EAAE,aAAa,CAAC,EACrC,gBAAgB,CACjB,CAAC;YAEF,0BAA0B;YAC1B,MAAM,QAAQ,GAAG,YAAY,CAC3B,EAAE,EACF,MAAM,CAAC,KAAK,EACZ,KAAK,EACL,MAAM,EACN,eAAe,CAAC,MAAM,CAAC,CACxB,CAAC;YACF,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAEhE,2CAA2C;YAC3C,MAAM,SAAS,GAAG,aAAa,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YAErE,0CAA0C;YAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;oBAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClE,CAAC;YACD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC7D,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACtC,OAAO,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC,CAAC,CAAC;YAEH,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAEtE,OAAO,kBAAkB,CAAC;gBACxB,EAAE,EAAE,IAAI;gBACR,MAAM,EAAE;oBACN,QAAQ;oBACR,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,aAAa,EAAE,SAAS,CAAC,YAAY;oBACrC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/C,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACtC;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,mBAAmB,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/retrieve-context.d.ts

@@ -0,0 +1,4 @@
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { TypedDb } from '../db/typed.js';
+export declare function registerRetrieveContext(server: McpServer, db: TypedDb): void;
+//# sourceMappingURL=retrieve-context.d.ts.map

package/dist/tools/retrieve-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieve-context.d.ts","sourceRoot":"","sources":["../../src/tools/retrieve-context.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAIzE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAiD9C,wBAAgB,uBAAuB,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAkD5E"}

package/dist/tools/retrieve-context.js

@@ -0,0 +1,75 @@
+import { E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { sanitizeFtsQuery } from '../lib/search.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { parseMemoryRow } from '../lib/types.js';
+import { RetrieveContextInputSchema } from '../schemas/inputs.js';
+import { RetrieveContextResultSchema } from '../schemas/outputs.js';
+const RETRIEVE_CONTEXT_LIMIT = 200;
+const ESTIMATED_CHARS_PER_TOKEN = 4;
+function getOrderBy(strategy) {
+    if (strategy === 'importance') {
+        return 'm.importance DESC, memories_fts.rank';
+    }
+    if (strategy === 'recency') {
+        return 'm.created_at DESC, memories_fts.rank';
+    }
+    return 'memories_fts.rank';
+}
+function estimateTokens(content) {
+    return Math.ceil(content.length / ESTIMATED_CHARS_PER_TOKEN);
+}
+function loadContextRows(db, query, orderBy) {
+    const ftsQuery = sanitizeFtsQuery(query);
+    return db
+        .prepare(`SELECT m.*, memories_fts.rank AS rank FROM memories m
+       JOIN memories_fts ON memories_fts.rowid = m.rowid
+       WHERE memories_fts MATCH ?
+       ORDER BY ${orderBy}
+       LIMIT ${RETRIEVE_CONTEXT_LIMIT + 1}`)
+        .all(ftsQuery);
+}
+export function registerRetrieveContext(server, db) {
+    server.registerTool('retrieve_context', {
+        title: 'Retrieve Context',
+        description: 'Search memories and return relevance-ranked results that fit within a caller-specified token budget. Eliminates manual pagination and token counting for context window management.',
+        inputSchema: RetrieveContextInputSchema,
+        outputSchema: RetrieveContextResultSchema,
+        annotations: { readOnlyHint: true, openWorldHint: false },
+    }, (params) => {
+        try {
+            const { query, strategy } = params;
+            const tokenBudget = params.token_budget;
+            const orderBy = getOrderBy(strategy);
+            const rows = loadContextRows(db, query, orderBy);
+            const rowCapExceeded = rows.length > RETRIEVE_CONTEXT_LIMIT;
+            const candidateRows = rowCapExceeded
+                ? rows.slice(0, RETRIEVE_CONTEXT_LIMIT)
+                : rows;
+            let estimatedTokens = 0;
+            let truncated = rowCapExceeded;
+            const selected = [];
+            for (const row of candidateRows) {
+                const mem = parseMemoryRow(row);
+                const tokens = estimateTokens(mem.content);
+                if (estimatedTokens + tokens > tokenBudget) {
+                    truncated = true;
+                    break;
+                }
+                estimatedTokens += tokens;
+                selected.push(mem);
+            }
+            return createToolResponse({
+                ok: true,
+                result: {
+                    memories: selected,
+                    estimated_tokens: estimatedTokens,
+                    truncated,
+                },
+            });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=retrieve-context.js.map

package/dist/tools/retrieve-context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieve-context.js","sourceRoot":"","sources":["../../src/tools/retrieve-context.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,EAAE,0BAA0B,EAAE,MAAM,sBAAsB,CAAC;AAClE,OAAO,EAAE,2BAA2B,EAAE,MAAM,uBAAuB,CAAC;AAKpE,MAAM,sBAAsB,GAAG,GAAG,CAAC;AACnC,MAAM,yBAAyB,GAAG,CAAC,CAAC;AAEpC,SAAS,UAAU,CAAC,QAAyB;IAC3C,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;QAC9B,OAAO,sCAAsC,CAAC;IAChD,CAAC;IACD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,sCAAsC,CAAC;IAChD,CAAC;IACD,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAED,SAAS,cAAc,CAAC,OAAe;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,yBAAyB,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,eAAe,CACtB,EAAW,EACX,KAAa,EACb,OAAe;IAEf,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,EAAE;SACN,OAAO,CACN;;;kBAGY,OAAO;eACV,sBAAsB,GAAG,CAAC,EAAE,CACtC;SACA,GAAG,CAAC,QAAQ,CAAC,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,MAAiB,EAAE,EAAW;IACpE,MAAM,CAAC,YAAY,CACjB,kBAAkB,EAClB;QACE,KAAK,EAAE,kBAAkB;QACzB,WAAW,EACT,qLAAqL;QACvL,WAAW,EAAE,0BAA0B;QACvC,YAAY,EAAE,2BAA2B;QACzC,WAAW,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE;KAC1D,EACD,CAAC,MAA4B,EAAE,EAAE;QAC/B,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;YACnC,MAAM,WAAW,GAAG,MAAM,CAAC,YAAY,CAAC;YACxC,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACjD,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,GAAG,sBAAsB,CAAC;YAC5D,MAAM,aAAa,GAAG,cAAc;gBAClC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC;gBACvC,CAAC,CAAC,IAAI,CAAC;YAET,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,IAAI,SAAS,GAAG,cAAc,CAAC;YAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;YAE9B,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;gBAChC,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;gBAChC,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC3C,IAAI,eAAe,GAAG,MAAM,GAAG,WAAW,EAAE,CAAC;oBAC3C,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM;gBACR,CAAC;gBACD,eAAe,IAAI,MAAM,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;YAED,OAAO,kBAAkB,CAAC;gBACxB,EAAE,EAAE,IAAI;gBACR,MAAM,EAAE;oBACN,QAAQ,EAAE,QAAQ;oBAClB,gBAAgB,EAAE,eAAe;oBACjC,SAAS;iBACV;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,mBAAmB,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/search-memories.d.ts

@@ -0,0 +1,4 @@
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { TypedDb } from '../db/typed.js';
+export declare function registerSearchMemories(server: McpServer, db: TypedDb): void;
+//# sourceMappingURL=search-memories.d.ts.map

package/dist/tools/search-memories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-memories.d.ts","sourceRoot":"","sources":["../../src/tools/search-memories.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAIzE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAuD9C,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAwC3E"}

package/dist/tools/search-memories.js

@@ -0,0 +1,62 @@
+import { E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { decodeCursor, encodeCursor, splitPage } from '../lib/pagination.js';
+import { buildAndWhereClause, buildFilterClauses, sanitizeFtsQuery, } from '../lib/search.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { parseMemoryRow } from '../lib/types.js';
+import { SearchMemoriesInputSchema } from '../schemas/inputs.js';
+import { SearchResultSchema } from '../schemas/outputs.js';
+function toMemoryFilters(params) {
+    const filters = {};
+    if (params.min_importance != null) {
+        filters.min_importance = params.min_importance;
+    }
+    if (params.max_importance != null) {
+        filters.max_importance = params.max_importance;
+    }
+    if (params.memory_type != null) {
+        filters.memory_type = params.memory_type;
+    }
+    return filters;
+}
+function loadSearchRows(db, query, limit, offset, filters) {
+    const ftsQuery = sanitizeFtsQuery(query);
+    const filter = buildFilterClauses(filters);
+    const whereExtra = buildAndWhereClause(filter.clauses);
+    return db
+        .prepare(`SELECT m.*, memories_fts.rank AS rank FROM memories m
+       JOIN memories_fts ON memories_fts.rowid = m.rowid
+       WHERE memories_fts MATCH ?${whereExtra}
+       ORDER BY memories_fts.rank
+       LIMIT ? OFFSET ?`)
+        .all(ftsQuery, ...filter.params, limit + 1, offset);
+}
+export function registerSearchMemories(server, db) {
+    server.registerTool('search_memories', {
+        title: 'Search Memories',
+        description: 'Full-text search over memory content and tags using FTS5. Returns ranked results with pagination support via cursor.',
+        inputSchema: SearchMemoriesInputSchema,
+        outputSchema: SearchResultSchema,
+        annotations: { readOnlyHint: true, openWorldHint: false },
+    }, (params) => {
+        try {
+            const { limit, cursor } = params;
+            const offset = cursor ? decodeCursor(cursor) : 0;
+            const rows = loadSearchRows(db, params.query, limit, offset, toMemoryFilters(params));
+            const { page: pageRows, hasMore } = splitPage(rows, limit);
+            const memories = pageRows.map(parseMemoryRow);
+            const nextCursor = hasMore ? encodeCursor(offset + limit) : undefined;
+            return createToolResponse({
+                ok: true,
+                result: {
+                    memories,
+                    total_returned: memories.length,
+                    ...(nextCursor ? { nextCursor } : {}),
+                },
+            });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=search-memories.js.map

package/dist/tools/search-memories.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-memories.js","sourceRoot":"","sources":["../../src/tools/search-memories.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAC7E,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,EAAE,yBAAyB,EAAE,MAAM,sBAAsB,CAAC;AACjE,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAI3D,SAAS,eAAe,CAAC,MAAmB;IAC1C,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,MAAM,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;QAClC,OAAO,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;IACjD,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;QAClC,OAAO,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;IACjD,CAAC;IACD,IAAI,MAAM,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAC3C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,cAAc,CACrB,EAAW,EACX,KAAa,EACb,KAAa,EACb,MAAc,EACd,OAAsB;IAEtB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvD,OAAO,EAAE;SACN,OAAO,CACN;;mCAE6B,UAAU;;wBAErB,CACnB;SACA,GAAG,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AACxD,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAAiB,EAAE,EAAW;IACnE,MAAM,CAAC,YAAY,CACjB,iBAAiB,EACjB;QACE,KAAK,EAAE,iBAAiB;QACxB,WAAW,EACT,sHAAsH;QACxH,WAAW,EAAE,yBAAyB;QACtC,YAAY,EAAE,kBAAkB;QAChC,WAAW,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE;KAC1D,EACD,CAAC,MAAmB,EAAE,EAAE;QACtB,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;YACjC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,cAAc,CACzB,EAAE,EACF,MAAM,CAAC,KAAK,EACZ,KAAK,EACL,MAAM,EACN,eAAe,CAAC,MAAM,CAAC,CACxB,CAAC;YACF,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAE3D,MAAM,QAAQ,GAAa,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;YACxD,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAEtE,OAAO,kBAAkB,CAAC;gBACxB,EAAE,EAAE,IAAI;gBACR,MAAM,EAAE;oBACN,QAAQ;oBACR,cAAc,EAAE,QAAQ,CAAC,MAAM;oBAC/B,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACtC;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,mBAAmB,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/store-memories.d.ts

@@ -0,0 +1,4 @@
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { TypedDb } from '../db/typed.js';
+export declare function registerStoreMemories(server: McpServer, db: TypedDb): void;
+//# sourceMappingURL=store-memories.d.ts.map

package/dist/tools/store-memories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store-memories.d.ts","sourceRoot":"","sources":["../../src/tools/store-memories.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAIzE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AA6B9C,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAqD1E"}

package/dist/tools/store-memories.js

@@ -0,0 +1,52 @@
+import { E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { computeMemoryHash } from '../lib/hash.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { StoreMemoriesInputSchema } from '../schemas/inputs.js';
+import { BatchResultSchema } from '../schemas/outputs.js';
+import { logToolEvent, normalizeMemoryType, nowIso, withImmediateTransaction, } from './helpers.js';
+const INSERT_MEMORY_SQL = `INSERT OR IGNORE INTO memories (hash, content, tags, memory_type, importance, created_at, updated_at)
+  VALUES (?, ?, ?, ?, ?, ?, ?)`;
+function summarizeBatch(items) {
+    const succeeded = items.filter((item) => item.ok).length;
+    return { succeeded, failed: items.length - succeeded };
+}
+export function registerStoreMemories(server, db) {
+    server.registerTool('store_memories', {
+        title: 'Store Memories (Batch)',
+        description: 'Store up to 50 memories in a single atomic transaction. Returns per-item results so callers can detect partial failures. All items succeed or the transaction rolls back.',
+        inputSchema: StoreMemoriesInputSchema,
+        outputSchema: BatchResultSchema,
+        annotations: { idempotentHint: true, openWorldHint: false },
+    }, async (params) => {
+        try {
+            const now = nowIso();
+            const results = withImmediateTransaction(db, () => {
+                const items = [];
+                const stmt = db.prepare(INSERT_MEMORY_SQL);
+                for (const item of params.items) {
+                    const { importance, memory_type: rawMemoryType } = item;
+                    const memoryType = normalizeMemoryType(rawMemoryType);
+                    const hash = computeMemoryHash(item.content, item.tags);
+                    const tagsJson = JSON.stringify(item.tags);
+                    const result = stmt.run(hash, item.content, tagsJson, memoryType, importance, now, now);
+                    items.push({ hash, ok: true, created: result.changes > 0 });
+                }
+                return items;
+            });
+            const created = results.filter((r) => r.created).length;
+            const { succeeded, failed } = summarizeBatch(results);
+            await logToolEvent(server, 'store_memories', {
+                total: results.length,
+                created,
+            });
+            return createToolResponse({
+                ok: true,
+                result: { items: results, succeeded, failed },
+            });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=store-memories.js.map

package/dist/tools/store-memories.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store-memories.js","sourceRoot":"","sources":["../../src/tools/store-memories.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EACL,YAAY,EACZ,mBAAmB,EACnB,MAAM,EACN,wBAAwB,GACzB,MAAM,cAAc,CAAC;AAGtB,MAAM,iBAAiB,GAAG;+BACK,CAAC;AAEhC,SAAS,cAAc,CAAC,KAAiC;IAIvD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IACzD,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;AACzD,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAAiB,EAAE,EAAW;IAClE,MAAM,CAAC,YAAY,CACjB,gBAAgB,EAChB;QACE,KAAK,EAAE,wBAAwB;QAC/B,WAAW,EACT,2KAA2K;QAC7K,WAAW,EAAE,wBAAwB;QACrC,YAAY,EAAE,iBAAiB;QAC/B,WAAW,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE;KAC5D,EACD,KAAK,EAAE,MAA0B,EAAE,EAAE;QACnC,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC;YACrB,MAAM,OAAO,GAAG,wBAAwB,CAAC,EAAE,EAAE,GAAG,EAAE;gBAChD,MAAM,KAAK,GAAsB,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAU,iBAAiB,CAAC,CAAC;gBAEpD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;oBAChC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;oBACxD,MAAM,UAAU,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;oBACtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;oBACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACrB,IAAI,EACJ,IAAI,CAAC,OAAO,EACZ,QAAQ,EACR,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,CACJ,CAAC;oBACF,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9D,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;YACxD,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,YAAY,CAAC,MAAM,EAAE,gBAAgB,EAAE;gBAC3C,KAAK,EAAE,OAAO,CAAC,MAAM;gBACrB,OAAO;aACR,CAAC,CAAC;YAEH,OAAO,kBAAkB,CAAC;gBACxB,EAAE,EAAE,IAAI;gBACR,MAAM,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE;aAC9C,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,mBAAmB,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/store-memory.d.ts

@@ -0,0 +1,4 @@
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { TypedDb } from '../db/typed.js';
+export declare function registerStoreMemory(server: McpServer, db: TypedDb): void;
+//# sourceMappingURL=store-memory.d.ts.map

package/dist/tools/store-memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store-memory.d.ts","sourceRoot":"","sources":["../../src/tools/store-memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAIzE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAe9C,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAwCxE"}

package/dist/tools/store-memory.js

@@ -0,0 +1,35 @@
+import { E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { computeMemoryHash } from '../lib/hash.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { StoreMemoryInputSchema } from '../schemas/inputs.js';
+import { StoreResultSchema } from '../schemas/outputs.js';
+import { logToolEvent, normalizeMemoryType, nowIso } from './helpers.js';
+const INSERT_MEMORY_SQL = `INSERT OR IGNORE INTO memories (hash, content, tags, memory_type, importance, created_at, updated_at)
+  VALUES (?, ?, ?, ?, ?, ?, ?)`;
+export function registerStoreMemory(server, db) {
+    server.registerTool('store_memory', {
+        title: 'Store Memory',
+        description: 'Store a new memory with content, tags, and optional type/importance. Returns the SHA-256 hash. Idempotent — storing the same content+tags returns the existing hash with created:false.',
+        inputSchema: StoreMemoryInputSchema,
+        outputSchema: StoreResultSchema,
+        annotations: { idempotentHint: true, openWorldHint: false },
+    }, async (params) => {
+        try {
+            const { importance } = params;
+            const memoryType = normalizeMemoryType(params.memory_type);
+            const hash = computeMemoryHash(params.content, params.tags);
+            const now = nowIso();
+            const tagsJson = JSON.stringify(params.tags);
+            const insertResult = db
+                .prepare(INSERT_MEMORY_SQL)
+                .run(hash, params.content, tagsJson, memoryType, importance, now, now);
+            const created = insertResult.changes > 0;
+            await logToolEvent(server, 'store', { hash, created });
+            return createToolResponse({ ok: true, result: { hash, created } });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=store-memory.js.map

package/dist/tools/store-memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store-memory.js","sourceRoot":"","sources":["../../src/tools/store-memory.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGzE,MAAM,iBAAiB,GAAG;+BACK,CAAC;AAEhC,MAAM,UAAU,mBAAmB,CAAC,MAAiB,EAAE,EAAW;IAChE,MAAM,CAAC,YAAY,CACjB,cAAc,EACd;QACE,KAAK,EAAE,cAAc;QACrB,WAAW,EACT,yLAAyL;QAC3L,WAAW,EAAE,sBAAsB;QACnC,YAAY,EAAE,iBAAiB;QAC/B,WAAW,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE;KAC5D,EACD,KAAK,EAAE,MAAkB,EAAE,EAAE;QAC3B,IAAI,CAAC;YACH,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;YAC9B,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAC3D,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5D,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,YAAY,GAAG,EAAE;iBACpB,OAAO,CAAC,iBAAiB,CAAC;iBAC1B,GAAG,CACF,IAAI,EACJ,MAAM,CAAC,OAAO,EACd,QAAQ,EACR,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,CACJ,CAAC;YAEJ,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC;YACzC,MAAM,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAEvD,OAAO,kBAAkB,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QACrE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,mBAAmB,CAAC,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/update-memory.d.ts

@@ -0,0 +1,4 @@
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { TypedDb } from '../db/typed.js';
+export declare function registerUpdateMemory(server: McpServer, db: TypedDb): void;
+//# sourceMappingURL=update-memory.d.ts.map

package/dist/tools/update-memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"update-memory.d.ts","sourceRoot":"","sources":["../../src/tools/update-memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAIzE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AA0B9C,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAoDzE"}

package/dist/tools/update-memory.js

@@ -0,0 +1,49 @@
+import { E_NOT_FOUND, E_UNKNOWN, getErrorMessage } from '../lib/errors.js';
+import { computeMemoryHash } from '../lib/hash.js';
+import { createErrorResponse, createToolResponse, } from '../lib/tool-response.js';
+import { parseTags } from '../lib/types.js';
+import { UpdateMemoryInputSchema } from '../schemas/inputs.js';
+import { UpdateResultSchema } from '../schemas/outputs.js';
+import { getMemoryRow, logToolEvent, notifyMemoryResourceUpdated, nowIso, withImmediateTransaction, } from './helpers.js';
+const UPDATE_MEMORY_SQL = `UPDATE memories
+  SET hash = ?, content = ?, tags = ?, updated_at = ?
+  WHERE hash = ?`;
+function formatMemoryNotFound(hash) {
+    return `Memory not found: ${hash}`;
+}
+export function registerUpdateMemory(server, db) {
+    server.registerTool('update_memory', {
+        title: 'Update Memory',
+        description: 'Replace the content of an existing memory identified by its hash. Tags may optionally be replaced. Returns the new hash.',
+        inputSchema: UpdateMemoryInputSchema,
+        outputSchema: UpdateResultSchema,
+        annotations: { destructiveHint: true, openWorldHint: false },
+    }, async (params) => {
+        try {
+            const existing = getMemoryRow(db, params.hash);
+            if (!existing) {
+                return createErrorResponse(E_NOT_FOUND, formatMemoryNotFound(params.hash));
+            }
+            const existingTags = parseTags(existing.tags);
+            const newTags = params.tags ?? existingTags;
+            const newHash = computeMemoryHash(params.content, newTags);
+            const now = nowIso();
+            withImmediateTransaction(db, () => {
+                db.prepare(UPDATE_MEMORY_SQL).run(newHash, params.content, JSON.stringify(newTags), now, params.hash);
+            });
+            await logToolEvent(server, 'update', {
+                oldHash: params.hash,
+                newHash,
+            });
+            await notifyMemoryResourceUpdated(server, params.hash);
+            return createToolResponse({
+                ok: true,
+                result: { old_hash: params.hash, new_hash: newHash },
+            });
+        }
+        catch (err) {
+            return createErrorResponse(E_UNKNOWN, getErrorMessage(err));
+        }
+    });
+}
+//# sourceMappingURL=update-memory.js.map