hmem-mcp 3.3.0 → 3.5.0

package/dist/hmem-config.js

@@ -32,7 +32,7 @@ export const DEFAULT_PREFIX_DESCRIPTIONS = {
     O: "(O)riginal context — raw session history with progressive summarization (auto-generated by flush_context)",
 };
 export const DEFAULT_CONFIG = {
-    maxCharsPerLevel: [120, 2_500, 10_000, 25_000, 50_000],
+    maxCharsPerLevel: [200, 2_500, 10_000, 25_000, 50_000],
     maxDepth: 5,
     defaultReadLimit: 100,
     prefixes: { ...DEFAULT_PREFIXES },

package/dist/hmem-store.d.ts

@@ -196,7 +196,7 @@ export declare class HmemStore {
      * Each indented line → its own memory_nodes row with compound ID
      * Multiple lines at the same indent depth → siblings (new capability)
      */
-    write(prefix: string, content: string, links?: string[], minRole?: AgentRole, favorite?: boolean, tags?: string[], pinned?: boolean): WriteResult;
+    write(prefix: string, content: string, links?: string[], minRole?: AgentRole, favorite?: boolean, tags?: string[], pinned?: boolean, force?: boolean): WriteResult;
     /**
      * Write a linear entry with explicit content at each level (no tree branching).
      * Used by flush_context for O-prefix entries. Each level is a single node forming
@@ -379,6 +379,8 @@ export declare class HmemStore {
     private parseTimeWindow;
     private buildRoleFilter;
     private nextSeq;
+    /** Clear all active markers — called at MCP server start so each session starts neutral. */
+    clearAllActive(): void;
     /** Auto-resolve linked entries on an entry (extracted for reuse in chain resolution). */
     private resolveEntryLinks;
     /** Get child nodes created after a given ISO timestamp (for "new since last session" detection). */

package/dist/hmem-store.js

@@ -224,7 +224,7 @@ export class HmemStore {
      * Each indented line → its own memory_nodes row with compound ID
      * Multiple lines at the same indent depth → siblings (new capability)
      */
-    write(prefix, content, links, minRole = "worker", favorite, tags, pinned) {
+    write(prefix, content, links, minRole = "worker", favorite, tags, pinned, force) {
         this.guardCorrupted();
         prefix = prefix.toUpperCase();
         if (!this.cfg.prefixes[prefix]) {
@@ -265,6 +265,77 @@ export class HmemStore {
             throw new Error("Tags are required. Provide at least 1 tag (3+ recommended) for discoverability. Example: tags=['#hmem', '#sqlite', '#bug']");
         }
         const validatedTags = this.validateTags(tags);
+        // Duplicate detection: check for existing entries with significant tag overlap
+        if (prefix !== "O" && !force) { // O-entries are auto-generated, skip check
+            const tagPlaceholders = validatedTags.map(() => "?").join(", ");
+            const overlapRows = this.db.prepare(`
+        SELECT
+          CASE WHEN mt.entry_id LIKE '%.%'
+          THEN SUBSTR(mt.entry_id, 1, INSTR(mt.entry_id, '.') - 1)
+          ELSE mt.entry_id END as root_id,
+          COUNT(DISTINCT mt.tag) as shared
+        FROM memory_tags mt
+        JOIN memories m ON m.id = (
+          CASE WHEN mt.entry_id LIKE '%.%'
+          THEN SUBSTR(mt.entry_id, 1, INSTR(mt.entry_id, '.') - 1)
+          ELSE mt.entry_id END
+        )
+        WHERE mt.tag IN (${tagPlaceholders})
+          AND m.prefix = ?
+          AND m.obsolete != 1
+          AND m.irrelevant != 1
+        GROUP BY root_id
+        HAVING shared >= 2
+        ORDER BY shared DESC
+        LIMIT 3
+      `).all(...validatedTags, prefix);
+            // Phase 2: FTS5 title similarity (fallback for entries with different tags)
+            let ftsMatches = [];
+            if (overlapRows.length === 0) {
+                const words = level1.replace(/[^a-zA-Z0-9äöüÄÖÜß\s-]/g, " ")
+                    .split(/\s+/)
+                    .filter(w => w.length > 3)
+                    .slice(0, 4);
+                if (words.length >= 2) {
+                    try {
+                        const andQuery = words.join(" AND ");
+                        const ftsHits = this.db.prepare(`
+              SELECT rm.root_id FROM hmem_fts_rowid_map rm
+              JOIN hmem_fts f ON f.rowid = rm.fts_rowid
+              WHERE hmem_fts MATCH ? LIMIT 5
+            `).all(andQuery);
+                        const seen = new Set();
+                        for (const hit of ftsHits) {
+                            if (seen.has(hit.root_id))
+                                continue;
+                            seen.add(hit.root_id);
+                            const row = this.db.prepare("SELECT id, title, prefix FROM memories WHERE id = ? AND prefix = ? AND obsolete != 1 AND irrelevant != 1").get(hit.root_id, prefix);
+                            if (row)
+                                ftsMatches.push({ root_id: row.id, title: row.title });
+                        }
+                    }
+                    catch { /* FTS5 might not exist */ }
+                }
+            }
+            if (overlapRows.length > 0 || ftsMatches.length > 0) {
+                const parts = [];
+                if (overlapRows.length > 0) {
+                    const tagHits = overlapRows.map(r => {
+                        const row = this.db.prepare("SELECT title FROM memories WHERE id = ?").get(r.root_id);
+                        return `  ${r.root_id} (${r.shared}/${validatedTags.length} shared tags) ${row?.title ?? ""}`;
+                    }).join("\n");
+                    parts.push(`Tag overlap:\n${tagHits}`);
+                }
+                if (ftsMatches.length > 0) {
+                    const ftsHits = ftsMatches.map(r => `  ${r.root_id} ${r.title}`).join("\n");
+                    parts.push(`Similar titles:\n${ftsHits}`);
+                }
+                const bestMatch = overlapRows[0]?.root_id ?? ftsMatches[0]?.root_id;
+                throw new Error(`Similar ${prefix}-entries already exist:\n${parts.join("\n")}\n\n` +
+                    `If this belongs to an existing entry, use: append_memory(id="${bestMatch}", content="...")\n` +
+                    `If this is intentionally a NEW entry, retry with: force=true`);
+            }
+        }
         // Run in a transaction
         this.db.transaction(() => {
             insertRoot.run(rootId, prefix, seq, timestamp, timestamp, title, level1, links ? JSON.stringify(links) : null, minRole, favorite ? 1 : 0, pinned ? 1 : 0);
@@ -1995,6 +2066,10 @@ export class HmemStore {
         const row = this.db.prepare("SELECT MAX(seq) as maxSeq FROM memories WHERE prefix = ?").get(prefix);
         return (row?.maxSeq || 0) + 1;
     }
+    /** Clear all active markers — called at MCP server start so each session starts neutral. */
+    clearAllActive() {
+        this.db.prepare("UPDATE memories SET active = 0 WHERE active = 1").run();
+    }
     /** Auto-resolve linked entries on an entry (extracted for reuse in chain resolution). */
     resolveEntryLinks(entry, opts) {
         const linkDepth = opts.resolveLinks === false ? 0 : (opts.linkDepth ?? 1);
@@ -2044,9 +2119,13 @@ export class HmemStore {
         const row = this.db.prepare("SELECT id FROM memories WHERE prefix = 'O' AND active = 1 AND obsolete != 1 AND irrelevant != 1 LIMIT 1").get();
         if (row)
             return row.id;
-        // Create new O-entry for today's session
+        // Find active project for context
+        const activeProject = this.db.prepare("SELECT id, title FROM memories WHERE prefix = 'P' AND active = 1 AND obsolete != 1 LIMIT 1").get();
         const today = new Date().toISOString().substring(0, 10);
-        const result = this.writeLinear("O", { l1: `Session ${today}` }, ["#session"]);
+        const projectName = activeProject?.title?.split("|")[0]?.trim() ?? "unassigned";
+        const tags = ["#session"];
+        const links = activeProject ? [activeProject.id] : undefined;
+        const result = this.writeLinear("O", { l1: `${projectName} — Session ${today}` }, tags, links);
         this.db.prepare("UPDATE memories SET active = 1, updated_at = ? WHERE id = ?")
             .run(new Date().toISOString(), result.id);
         return result.id;