claude-mem-lite 3.29.0 → 3.31.0

package/.claude-plugin/marketplace.json

@@ -10,7 +10,7 @@
   "plugins": [
     {
       "name": "claude-mem-lite",
-      "version": "3.29.0",
+      "version": "3.31.0",
       "source": "./",
       "description": "Persistent long-term memory for Claude Code via MCP — captures coding decisions, bugfixes, and context across sessions. Hybrid FTS5 + TF-IDF search with episode batching. Single SQLite DB, no external services. A lighter, lower-cost alternative to claude-mem (episode batching + a smaller model; cost savings are an internal estimate, not a measured benchmark)."
     }

package/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "3.29.0",
+  "version": "3.31.0",
   "description": "Persistent long-term memory for Claude Code via MCP — captures coding decisions, bugfixes, and context across sessions. Hybrid FTS5 + TF-IDF search with episode batching. Single SQLite DB, no external services. A lighter, lower-cost alternative to claude-mem (episode batching + a smaller model; cost savings are an internal estimate, not a measured benchmark).",
   "author": {
     "name": "sdsrss"

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "3.29.0",
+  "version": "3.31.0",
   "description": "Persistent long-term memory for Claude Code via MCP — captures coding decisions, bugfixes, and context across sessions. Hybrid FTS5 + TF-IDF search with episode batching. Single SQLite DB, no external services. A lighter, lower-cost alternative to claude-mem (episode batching + a smaller model; cost savings are an internal estimate, not a measured benchmark).",
   "type": "module",
   "packageManager": "npm@10.9.2",

package/server.mjs

@@ -14,7 +14,7 @@ import { deepSearch, resolveDeepMode, shouldEscalateToDeep, autoDeepLlmReady } f
 import { selectCompressionCandidates, groupByProjectWeek, compressGroup } from './lib/compress-core.mjs';
 import { buildNotLowSignalSql } from './lib/low-signal-patterns.mjs';
 import { resolveAnchorToken, formatAnchorError, resolveQueryAnchor, fetchRecentTimeline, fetchTimelineWindow } from './lib/timeline-core.mjs';
-import { buildSearchFtsQuery, parseDateBounds, coreRunSearchPipeline } from './lib/search-core.mjs';
+import { buildSearchFtsQuery, parseDateBounds, parseDuration, coreRunSearchPipeline } from './lib/search-core.mjs';
 import {
   cleanupBroken, decayAndMarkIdle, boostAccessed, demotePinned, mergeDuplicates,
   recoverOrphanedChildren,
@@ -267,8 +267,11 @@ async function runSearchPipeline(db, args, { llm, rerankLlm } = {}) {
   const ftsQuery = buildSearchFtsQuery(args.query, { or: args.or });
   const currentProject = inferProject();
 
-  const bounds = parseDateBounds(args.date_from, args.date_to);
-  if (!bounds.ok) throw new Error(`Invalid date_${bounds.bad}: "${bounds.value}" (use ISO 8601 or YYYY-MM-DD)`);
+  const bounds = parseDateBounds(args.date_from, args.date_to, args.date_since);
+  if (!bounds.ok) {
+    if (bounds.bad === 'since') throw new Error(`Invalid date_since: "${bounds.value}" (use <N><unit>, e.g. 7d, 24h, 90m, 2w)`);
+    throw new Error(`Invalid date_${bounds.bad}: "${bounds.value}" (use ISO 8601 or YYYY-MM-DD)`);
+  }
   const { epochFrom, epochTo } = bounds;
 
   // MCP defaults to 'auto' (escalate on weak results) unless overridden by
@@ -343,41 +346,56 @@ server.registerTool(
 
 // ─── Tool: mem_recent ────────────────────────────────────────────────────────
 
+// In-process test seam (mirrors handleSearchForTest, #8743): threads an injected
+// db through the SAME body the registered handler runs. NOTE: a `project` arg is
+// still resolved via resolveProject() against the MODULE db, not the injected one.
+export async function handleRecentForTest(db, args) {
+  return runRecent(db, args);
+}
+
+async function runRecent(db, args) {
+  if (args.project) args = { ...args, project: resolveProject(args.project) };
+  const limit = args.limit ?? 10;
+  const project = args.project || inferProject();
+
+  const params = [];
+  const wheres = ['COALESCE(compressed_into, 0) = 0', 'superseded_at IS NULL'];
+  if (project) { wheres.push('project = ?'); params.push(project); }
+  // date_since: relative lower bound on created_at (CLI `recent --since` parity).
+  if (args.date_since !== undefined) {
+    const d = parseDuration(args.date_since);
+    if (!d.ok) throw new Error(`Invalid date_since: "${args.date_since}" (use <N><unit>, e.g. 7d, 24h, 90m, 2w)`);
+    wheres.push('created_at_epoch >= ?'); params.push(Date.now() - d.ms);
+  }
+  params.push(limit);
+
+  const rows = db.prepare(`
+    SELECT id, type, title, subtitle, project, created_at, created_at_epoch
+    FROM observations
+    WHERE ${wheres.join(' AND ')}
+    ORDER BY created_at_epoch DESC
+    LIMIT ?
+  `).all(...params);
+
+  if (rows.length === 0) {
+    return { content: [{ type: 'text', text: `No recent observations${project ? ` (${project})` : ''}.` }] };
+  }
+
+  const lines = [`Recent observations (${project || 'all'}):\n`];
+  for (const r of rows) {
+    lines.push(`#${r.id} ${typeIcon(r.type)} [${r.type}] ${truncate(r.title || r.subtitle || '(untitled)')} | ${r.project} | ${fmtDate(r.created_at)}`);
+  }
+  lines.push(`\nWorkflow: mem_get(ids=[...]) for full details | mem_timeline(anchor=ID) for context`);
+  return { content: [{ type: 'text', text: lines.join('\n') }] };
+}
+
 server.registerTool(
   'mem_recent',
   {
     description: descriptionOf('mem_recent'),
     inputSchema: memRecentSchema,
   },
-  safeHandler(async (args) => {
-    if (args.project) args = { ...args, project: resolveProject(args.project) };
-    const limit = args.limit ?? 10;
-    const project = args.project || inferProject();
-
-    const params = [];
-    const wheres = ['COALESCE(compressed_into, 0) = 0', 'superseded_at IS NULL'];
-    if (project) { wheres.push('project = ?'); params.push(project); }
-    params.push(limit);
-
-    const rows = db.prepare(`
-      SELECT id, type, title, subtitle, project, created_at, created_at_epoch
-      FROM observations
-      WHERE ${wheres.join(' AND ')}
-      ORDER BY created_at_epoch DESC
-      LIMIT ?
-    `).all(...params);
-
-    if (rows.length === 0) {
-      return { content: [{ type: 'text', text: `No recent observations${project ? ` (${project})` : ''}.` }] };
-    }
-
-    const lines = [`Recent observations (${project || 'all'}):\n`];
-    for (const r of rows) {
-      lines.push(`#${r.id} ${typeIcon(r.type)} [${r.type}] ${truncate(r.title || r.subtitle || '(untitled)')} | ${r.project} | ${fmtDate(r.created_at)}`);
-    }
-    lines.push(`\nWorkflow: mem_get(ids=[...]) for full details | mem_timeline(anchor=ID) for context`);
-    return { content: [{ type: 'text', text: lines.join('\n') }] };
-  })
+  safeHandler(async (args) => runRecent(db, args))
 );
 
 // ─── Tool: mem_timeline ─────────────────────────────────────────────────────

package/tool-schemas.mjs

@@ -85,6 +85,7 @@ export const memSearchSchema = {
   project: z.string().optional().describe('Filter by project name'),
   date_from: z.string().optional().describe('Start date (ISO 8601 or YYYY-MM-DD)'),
   date_to: z.string().optional().describe('End date (ISO 8601 or YYYY-MM-DD). Date-only format is inclusive (covers full day)'),
+  date_since: z.string().optional().describe('Relative lower bound from now: 7d/24h/90m/2w/30s. Use for "recent" queries instead of computing a date_from; ignored when date_from is set'),
   importance: coerceInt.pipe(z.number().int().min(1).max(3)).optional().describe('Minimum importance (1=routine, 2=notable, 3=critical)'),
   branch: z.string().optional().describe('Filter by git branch name'),
   tier: z.enum(['working', 'active', 'archive']).optional().describe('Filter by memory tier (working=current session, active=within decay window, archive=old/compressed)'),
@@ -100,6 +101,7 @@ export const memSearchSchema = {
 export const memRecentSchema = {
   limit: coerceInt.pipe(z.number().int().min(1).max(100)).optional().describe('Max results (default 10)'),
   project: z.string().optional().describe('Filter by project (default: inferred from CWD)'),
+  date_since: z.string().optional().describe('Relative lower bound from now: 7d/24h/90m/2w/30s. Only items newer than the window (pair with a high limit for "everything since X")'),
 };
 
 // Anchor accepts plain int, "123" string-int, or prefixed token from search output: