hmem-mcp 3.0.0 → 3.1.0

package/dist/cli-log-exchange.js

@@ -99,14 +99,8 @@ export async function logExchange() {
     try {
         // Find or create active O-entry
         const activeOId = store.getActiveO();
-        // Flatten multiline text for appendChildren (newlines → " | " to prevent depth parsing)
-        const flatUser = userMessage.replace(/\n+/g, " | ").substring(0, 25_000);
-        const flatAgent = input.last_assistant_message.replace(/\n+/g, " | ").substring(0, 50_000);
-        const title = extractTitle(userMessage);
-        // appendChildren format: 0 tabs = L2 (direct child of root O-entry)
-        // 1 tab = L3, 2 tabs = L4 (user msg), 3 tabs = L5 (agent response)
-        const chunk = `${title}\n\t\t${flatUser}\n\t\t\t${flatAgent}`;
-        store.appendChildren(activeOId, chunk);
+        // appendExchange stores raw text without newline parsing
+        store.appendExchange(activeOId, userMessage, input.last_assistant_message);
     }
     catch (e) {
         console.error(`[hmem log-exchange] ${e}`);

package/dist/cli-log-exchange.js.map

@@ -1 +1 @@
-{"version":3,"file":"cli-log-exchange.js","sourceRoot":"","sources":["../src/cli-log-exchange.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAQlD;yEACyE;AACzE,SAAS,mBAAmB,CAAC,cAAsB;IACjD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhD,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;IACzC,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,2DAA2D;IAC/F,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC;IAElD,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;IAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;IAC1D,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3C,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAEjB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrC,+DAA+D;IAC/D,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEzG,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,IACE,KAAK,CAAC,IAAI,KAAK,MAAM;gBACrB,KAAK,CAAC,OAAO,EAAE,IAAI,KAAK,MAAM;gBAC9B,CAAC,KAAK,CAAC,aAAa;gBACpB,CAAC,KAAK,CAAC,gBAAgB;gBACvB,CAAC,KAAK,CAAC,yBAAyB,EAChC,CAAC;gBACD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;gBAClC,IAAI,OAAO,GAAG,KAAK,QAAQ;oBAAE,OAAO,GAAG,CAAC;gBACxC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtF,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YAAC,SAAS;QAAC,CAAC;IACvB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uEAAuE;AACvE,SAAS,YAAY,CAAC,IAAY;IAChC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IACtE,IAAI,SAAS,CAAC,MAAM,IAAI,EAAE;QAAE,OAAO,SAAS,CAAC;IAC7C,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC9D,OAAO,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW;IAC/B,wEAAwE;IACxE,IAAI,KAAgB,CAAC;IACrB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,eAAe;QACxD,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;IACnC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,SAAS;IACT,IAAI,KAAK,CAAC,gBAAgB;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,KAAK,CAAC,sBAAsB;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7E,MAAM,WAAW,GAAG,mBAAmB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC/D,IAAI,CAAC,WAAW;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAElC,4BAA4B;IAC5B,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE5C,kBAAkB;IAClB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC;IACnF,IAAI,CAAC,UAAU;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,EAAE,CAAC;IAChF,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAC3D,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE9C,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE1D,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC;QACH,gCAAgC;QAChC,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAErC,wFAAwF;QACxF,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACzE,MAAM,SAAS,GAAG,KAAK,CAAC,sBAAuB,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC5F,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;QAExC,oEAAoE;QACpE,mEAAmE;QACnE,MAAM,KAAK,GAAG,GAAG,KAAK,SAAS,QAAQ,WAAW,SAAS,EAAE,CAAC;QAC9D,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,KAAK,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC"}
+{"version":3,"file":"cli-log-exchange.js","sourceRoot":"","sources":["../src/cli-log-exchange.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAQlD;yEACyE;AACzE,SAAS,mBAAmB,CAAC,cAAsB;IACjD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhD,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;IACzC,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,2DAA2D;IAC/F,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC;IAElD,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;IAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;IAC1D,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3C,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAEjB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrC,+DAA+D;IAC/D,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEzG,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,IACE,KAAK,CAAC,IAAI,KAAK,MAAM;gBACrB,KAAK,CAAC,OAAO,EAAE,IAAI,KAAK,MAAM;gBAC9B,CAAC,KAAK,CAAC,aAAa;gBACpB,CAAC,KAAK,CAAC,gBAAgB;gBACvB,CAAC,KAAK,CAAC,yBAAyB,EAChC,CAAC;gBACD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;gBAClC,IAAI,OAAO,GAAG,KAAK,QAAQ;oBAAE,OAAO,GAAG,CAAC;gBACxC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtF,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YAAC,SAAS;QAAC,CAAC;IACvB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uEAAuE;AACvE,SAAS,YAAY,CAAC,IAAY;IAChC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IACtE,IAAI,SAAS,CAAC,MAAM,IAAI,EAAE;QAAE,OAAO,SAAS,CAAC;IAC7C,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC9D,OAAO,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW;IAC/B,wEAAwE;IACxE,IAAI,KAAgB,CAAC;IACrB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,eAAe;QACxD,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;IACnC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,SAAS;IACT,IAAI,KAAK,CAAC,gBAAgB;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,KAAK,CAAC,sBAAsB;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7E,MAAM,WAAW,GAAG,mBAAmB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC/D,IAAI,CAAC,WAAW;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAElC,4BAA4B;IAC5B,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE5C,kBAAkB;IAClB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC;IACnF,IAAI,CAAC,UAAU;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,EAAE,CAAC;IAChF,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAC3D,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE9C,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE1D,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC;QACH,gCAAgC;QAChC,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAErC,yDAAyD;QACzD,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,CAAC,sBAAuB,CAAC,CAAC;IAC9E,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,KAAK,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/hmem-store.d.ts

@@ -279,7 +279,7 @@ export declare class HmemStore {
      * For sub-nodes: updates node content only.
      * Does NOT modify children — use appendChildren to extend the tree.
      */
-    updateNode(id: string, newContent: string, links?: string[], obsolete?: boolean, favorite?: boolean, curatorBypass?: boolean, irrelevant?: boolean, tags?: string[], pinned?: boolean, active?: boolean): boolean;
+    updateNode(id: string, newContent?: string, links?: string[], obsolete?: boolean, favorite?: boolean, curatorBypass?: boolean, irrelevant?: boolean, tags?: string[], pinned?: boolean, active?: boolean): boolean;
     /**
      * Append new child nodes under an existing entry (root or node).
      * Content is tab-indented relative to the parent:
@@ -292,6 +292,16 @@ export declare class HmemStore {
         count: number;
         ids: string[];
     };
+    /**
+     * Append a chat exchange (user prompt + agent response) to an O-entry.
+     * Inserts 3 nodes as a linear chain WITHOUT content parsing — newlines are preserved.
+     *   L2: title (auto-extracted from userText)
+     *   L4: user message (raw, newlines intact)
+     *   L5: agent response (raw, newlines intact)
+     */
+    appendExchange(parentId: string, userText: string, agentText: string): {
+        id: string;
+    };
     /**
      * Bump access_count on a root entry or node.
      * Returns true if the entry was found and bumped.
@@ -570,3 +580,23 @@ export declare function openAgentMemory(projectDir: string, templateName: string
  * Open (or create) the shared company knowledge store (company.hmem).
  */
 export declare function openCompanyMemory(projectDir: string, config?: HmemConfig): HmemStore;
+export interface AgentRouteResult {
+    agent: string;
+    score: number;
+    entryCount: number;
+    topEntries: {
+        id: string;
+        title: string;
+        score: number;
+    }[];
+}
+/**
+ * Route a task to the best-matching agent based on memory content.
+ * Scans all agent .hmem files in the project directory and scores them
+ * against the provided tags and/or search keywords.
+ *
+ * Scoring: for each agent store, find entries sharing the given tags
+ * with tier-weighted scoring (rare=3, medium=2, common=1).
+ * FTS5 keyword matching supplements tag scoring.
+ */
+export declare function routeTask(projectDir: string, tags: string[], keywords?: string, limit?: number, config?: HmemConfig): AgentRouteResult[];

package/dist/hmem-store.js

@@ -1387,19 +1387,23 @@ export class HmemStore {
      */
     updateNode(id, newContent, links, obsolete, favorite, curatorBypass, irrelevant, tags, pinned, active) {
         this.guardCorrupted();
-        const trimmed = newContent.trim();
+        const trimmed = newContent?.trim();
         if (id.includes(".")) {
             // Sub-node in memory_nodes — check char limit for its depth
             const nodeRow = this.db.prepare("SELECT depth, content FROM memory_nodes WHERE id = ?").get(id);
             if (!nodeRow)
                 return false;
             const oldContent = nodeRow.content;
-            const nodeLimit = this.cfg.maxCharsPerLevel[Math.min(nodeRow.depth - 1, this.cfg.maxCharsPerLevel.length - 1)];
-            if (trimmed.length > nodeLimit * HmemStore.CHAR_LIMIT_TOLERANCE) {
-                throw new Error(`Content exceeds ${nodeLimit} character limit (${trimmed.length} chars) for L${nodeRow.depth}.`);
+            const sets = [];
+            const params = [];
+            if (trimmed) {
+                const nodeLimit = this.cfg.maxCharsPerLevel[Math.min(nodeRow.depth - 1, this.cfg.maxCharsPerLevel.length - 1)];
+                if (trimmed.length > nodeLimit * HmemStore.CHAR_LIMIT_TOLERANCE) {
+                    throw new Error(`Content exceeds ${nodeLimit} character limit (${trimmed.length} chars) for L${nodeRow.depth}.`);
+                }
+                sets.push("content = ?", "title = ?");
+                params.push(trimmed, this.autoExtractTitle(trimmed));
             }
-            const sets = ["content = ?", "title = ?"];
-            const params = [trimmed, this.autoExtractTitle(trimmed)];
             if (favorite !== undefined) {
                 sets.push("favorite = ?");
                 params.push(favorite ? 1 : 0);
@@ -1440,14 +1444,17 @@ export class HmemStore {
             return result.changes > 0;
         }
         else {
-            // Root entry in memories — check L1 char limit
-            const l1Limit = this.cfg.maxCharsPerLevel[0];
-            if (trimmed.length > l1Limit * HmemStore.CHAR_LIMIT_TOLERANCE) {
-                throw new Error(`Level 1 exceeds ${l1Limit} character limit (${trimmed.length} chars). Keep L1 compact.`);
+            // Root entry in memories
+            if (trimmed) {
+                const l1Limit = this.cfg.maxCharsPerLevel[0];
+                if (trimmed.length > l1Limit * HmemStore.CHAR_LIMIT_TOLERANCE) {
+                    throw new Error(`Level 1 exceeds ${l1Limit} character limit (${trimmed.length} chars). Keep L1 compact.`);
+                }
             }
             // Obsolete enforcement: require [✓ID] correction reference
             if (obsolete === true && !curatorBypass) {
-                const correctionMatch = trimmed.match(/\[✓([A-Z]\d{4}(?:\.\d+)*)\]/);
+                const contentToCheck = trimmed ?? this.db.prepare("SELECT level_1 FROM memories WHERE id = ?").get(id)?.level_1 ?? "";
+                const correctionMatch = contentToCheck.match(/\[✓([A-Z]\d{4}(?:\.\d+)*)\]/);
                 if (!correctionMatch) {
                     throw new Error("Cannot mark as obsolete without [✓ID] correction reference — write the correction first.");
                 }
@@ -1477,8 +1484,12 @@ export class HmemStore {
                     }
                 }
             }
-            const sets = ["level_1 = ?", "title = ?"];
-            const params = [trimmed, this.autoExtractTitle(trimmed)];
+            const sets = [];
+            const params = [];
+            if (trimmed) {
+                sets.push("level_1 = ?", "title = ?");
+                params.push(trimmed, this.autoExtractTitle(trimmed));
+            }
             if (links !== undefined) {
                 sets.push("links = ?");
                 params.push(links.length > 0 ? JSON.stringify(links) : null);
@@ -1590,6 +1601,36 @@ export class HmemStore {
         }
         return { count: nodes.length, ids: topLevelIds };
     }
+    /**
+     * Append a chat exchange (user prompt + agent response) to an O-entry.
+     * Inserts 3 nodes as a linear chain WITHOUT content parsing — newlines are preserved.
+     *   L2: title (auto-extracted from userText)
+     *   L4: user message (raw, newlines intact)
+     *   L5: agent response (raw, newlines intact)
+     */
+    appendExchange(parentId, userText, agentText) {
+        this.guardCorrupted();
+        const parentIsRoot = !parentId.includes(".");
+        const rootId = parentIsRoot ? parentId : parentId.split(".")[0];
+        const timestamp = new Date().toISOString();
+        // Find next available seq
+        const maxSeq = parentIsRoot
+            ? this.db.prepare("SELECT MAX(seq) as m FROM memory_nodes WHERE parent_id = ? AND depth = 2").get(parentId)?.m ?? 0
+            : this.db.prepare("SELECT MAX(seq) as m FROM memory_nodes WHERE parent_id = ?").get(parentId)?.m ?? 0;
+        const seq = maxSeq + 1;
+        const title = this.autoExtractTitle(userText.split("\n")[0].replace(/[<>\[\]]/g, ""));
+        const l2Id = `${parentId}.${seq}`;
+        const l4Id = `${l2Id}.1`;
+        const l5Id = `${l4Id}.1`;
+        const insertNode = this.db.prepare("INSERT INTO memory_nodes (id, parent_id, root_id, depth, seq, title, content, created_at, updated_at) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)");
+        this.db.transaction(() => {
+            insertNode.run(l2Id, parentId, rootId, 2, seq, title, title, timestamp, timestamp);
+            insertNode.run(l4Id, l2Id, rootId, 4, 1, this.autoExtractTitle(userText), userText, timestamp, timestamp);
+            insertNode.run(l5Id, l4Id, rootId, 5, 1, this.autoExtractTitle(agentText), agentText, timestamp, timestamp);
+            this.db.prepare("UPDATE memories SET updated_at = ? WHERE id = ?").run(timestamp, rootId);
+        })();
+        return { id: l2Id };
+    }
     /**
      * Bump access_count on a root entry or node.
      * Returns true if the entry was found and bumped.
@@ -2952,4 +2993,143 @@ export function openCompanyMemory(projectDir, config) {
     const hmemPath = path.join(projectDir, "company.hmem");
     return new HmemStore(hmemPath, config);
 }
+/**
+ * Route a task to the best-matching agent based on memory content.
+ * Scans all agent .hmem files in the project directory and scores them
+ * against the provided tags and/or search keywords.
+ *
+ * Scoring: for each agent store, find entries sharing the given tags
+ * with tier-weighted scoring (rare=3, medium=2, common=1).
+ * FTS5 keyword matching supplements tag scoring.
+ */
+export function routeTask(projectDir, tags, keywords, limit = 5, config) {
+    // Discover all agent .hmem files — requires multi-agent setup
+    const agentsDir = path.join(projectDir, "Agents");
+    if (!fs.existsSync(agentsDir))
+        return [];
+    const agentDirs = fs.readdirSync(agentsDir).filter(name => {
+        const agentPath = path.join(agentsDir, name);
+        return fs.statSync(agentPath).isDirectory() &&
+            fs.existsSync(path.join(agentPath, `${name}.hmem`));
+    });
+    const results = [];
+    for (const agentName of agentDirs) {
+        const hmemPath = path.join(agentsDir, agentName, `${agentName}.hmem`);
+        let db;
+        try {
+            db = new Database(hmemPath, { readonly: true });
+        }
+        catch {
+            continue;
+        }
+        try {
+            let agentScore = 0;
+            const topEntries = [];
+            // Phase 1: Tag-based scoring
+            if (tags.length > 0) {
+                // Get global tag frequencies for THIS store
+                const freqRows = db.prepare(`
+          SELECT tag, COUNT(DISTINCT
+            CASE WHEN entry_id LIKE '%.%'
+            THEN SUBSTR(entry_id, 1, INSTR(entry_id, '.') - 1)
+            ELSE entry_id END
+          ) as freq FROM memory_tags GROUP BY tag
+        `).all();
+                const tagFreq = new Map();
+                for (const r of freqRows)
+                    tagFreq.set(r.tag, r.freq);
+                // Find entries sharing any of the given tags
+                const normalizedTags = tags.map(t => t.startsWith("#") ? t.toLowerCase() : `#${t.toLowerCase()}`);
+                const placeholders = normalizedTags.map(() => "?").join(", ");
+                const matchRows = db.prepare(`
+          SELECT
+            CASE WHEN entry_id LIKE '%.%'
+            THEN SUBSTR(entry_id, 1, INSTR(entry_id, '.') - 1)
+            ELSE entry_id END as root_id,
+            tag
+          FROM memory_tags WHERE tag IN (${placeholders})
+        `).all(...normalizedTags);
+                // Group by root and score
+                const byRoot = new Map();
+                for (const r of matchRows) {
+                    if (r.root_id.startsWith("O"))
+                        continue; // skip O-entries
+                    let set = byRoot.get(r.root_id);
+                    if (!set) {
+                        set = new Set();
+                        byRoot.set(r.root_id, set);
+                    }
+                    set.add(r.tag);
+                }
+                for (const [rootId, matchedTags] of byRoot) {
+                    let entryScore = 0;
+                    for (const tag of matchedTags) {
+                        const freq = tagFreq.get(tag) ?? 999;
+                        if (freq <= 5)
+                            entryScore += 3;
+                        else if (freq <= 20)
+                            entryScore += 2;
+                        else
+                            entryScore += 1;
+                    }
+                    agentScore += entryScore;
+                    // Get entry title
+                    const row = db.prepare("SELECT title, level_1 FROM memories WHERE id = ? AND obsolete != 1 AND irrelevant != 1").get(rootId);
+                    if (row) {
+                        topEntries.push({
+                            id: rootId,
+                            title: row.title || row.level_1?.substring(0, 50) || rootId,
+                            score: entryScore,
+                        });
+                    }
+                }
+            }
+            // Phase 2: FTS5 keyword supplement
+            if (keywords && keywords.trim().length > 0) {
+                try {
+                    const words = keywords.trim().split(/\s+/).filter(w => w.length > 3).slice(0, 5);
+                    if (words.length > 0) {
+                        const orQuery = words.join(" OR ");
+                        const ftsRows = db.prepare(`
+              SELECT rm.root_id, rm.node_id FROM hmem_fts_rowid_map rm
+              JOIN hmem_fts f ON f.rowid = rm.fts_rowid
+              WHERE hmem_fts MATCH ? LIMIT 20
+            `).all(orQuery);
+                        const ftsRoots = new Set(ftsRows.map(r => r.root_id).filter(id => !id.startsWith("O")));
+                        for (const rootId of ftsRoots) {
+                            if (topEntries.some(e => e.id === rootId))
+                                continue; // already scored via tags
+                            const row = db.prepare("SELECT title, level_1 FROM memories WHERE id = ? AND obsolete != 1 AND irrelevant != 1").get(rootId);
+                            if (row) {
+                                agentScore += 1; // FTS matches get 1 point each
+                                topEntries.push({
+                                    id: rootId,
+                                    title: row.title || row.level_1?.substring(0, 50) || rootId,
+                                    score: 1,
+                                });
+                            }
+                        }
+                    }
+                }
+                catch { /* FTS5 may not exist in all stores */ }
+            }
+            if (agentScore > 0) {
+                // Sort entries by score, keep top 5
+                topEntries.sort((a, b) => b.score - a.score);
+                results.push({
+                    agent: agentName,
+                    score: agentScore,
+                    entryCount: topEntries.length,
+                    topEntries: topEntries.slice(0, 5),
+                });
+            }
+        }
+        finally {
+            db.close();
+        }
+    }
+    // Sort agents by score
+    results.sort((a, b) => b.score - a.score);
+    return results.slice(0, limit);
+}
 //# sourceMappingURL=hmem-store.js.map