@lingxiao-office/sdk 1.0.0

package/dist/memory/DreamCommand.d.ts

@@ -0,0 +1,54 @@
+/**
+ * DreamCommand — /dream consolidation command.
+ *
+ * Reads recent session checkpoints and the current project MEMORY.md,
+ * uses a small LLM to consolidate durable knowledge into 4 structured sections,
+ * then writes the updated MEMORY.md (capped at 200 lines / 10KB).
+ */
+import { MemoryService } from './MemoryService.js';
+import type { DreamOptions, DreamResult, TrajectoryTurn } from './types.js';
+export interface SessionVerification {
+    recentSessionCount: number;
+    totalMessages: number;
+    verified: boolean;
+}
+export declare class DreamCommand {
+    private service;
+    private dbPath;
+    constructor(service: MemoryService, dbPath?: string);
+    /**
+     * Resolve the session database path.
+     * Priority: constructor-supplied > env > default (~/.lingxiao/data.db)
+     */
+    private resolveDbPath;
+    /**
+     * Execute a read-only SQL query against the session database.
+     * Only SELECT queries are allowed; any mutation keywords are rejected.
+     */
+    querySessionDB(query: string): unknown[];
+    /**
+     * Cross-check extracted knowledge against session DB.
+     * Queries recent sessions and message counts to validate that knowledge
+     * comes from real, active conversations.
+     */
+    verifyAgainstSessionDB(): SessionVerification;
+    /**
+     * Pull the raw conversation trajectory from the source-of-truth tables
+     * (leader_conversation + agent_conversation) within the lookback window.
+     *
+     * Delegates to the shared TrajectoryReader; kept as a thin instance method so
+     * the resolved db path (constructor > env > default) is applied consistently
+     * with verifyAgainstSessionDB.
+     *
+     * @param afterTimestampMs lower bound in epoch milliseconds.
+     * @param maxTurns hard cap on returned turns, newest-first.
+     */
+    getRecentTrajectory(afterTimestampMs: number, maxTurns?: number): TrajectoryTurn[];
+    /**
+     * Execute the /dream consolidation.
+     */
+    execute(options: DreamOptions): Promise<DreamResult>;
+    private buildUserMessage;
+    private enforceLimit;
+}
+//# sourceMappingURL=DreamCommand.d.ts.map

package/dist/memory/DreamCommand.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DreamCommand.d.ts","sourceRoot":"","sources":["../../src/memory/DreamCommand.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAMnD,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAyC5E,MAAM,WAAW,mBAAmB;IAClC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,MAAM,CAAqB;gBAEvB,OAAO,EAAE,aAAa,EAAE,MAAM,CAAC,EAAE,MAAM;IAKnD;;;OAGG;IACH,OAAO,CAAC,aAAa;IAMrB;;;OAGG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE;IA6BxC;;;;OAIG;IACH,sBAAsB,IAAI,mBAAmB;IA6B7C;;;;;;;;;;OAUG;IACH,mBAAmB,CAAC,gBAAgB,EAAE,MAAM,EAAE,QAAQ,SAAM,GAAG,cAAc,EAAE;IAI/E;;OAEG;IACG,OAAO,CAAC,OAAO,EAAE,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC;IAiI1D,OAAO,CAAC,gBAAgB;IA2BxB,OAAO,CAAC,YAAY;CAwBrB"}

package/dist/memory/DreamCommand.js

@@ -0,0 +1,289 @@
+/**
+ * DreamCommand — /dream consolidation command.
+ *
+ * Reads recent session checkpoints and the current project MEMORY.md,
+ * uses a small LLM to consolidate durable knowledge into 4 structured sections,
+ * then writes the updated MEMORY.md (capped at 200 lines / 10KB).
+ */
+import { DatabaseSync } from 'node:sqlite';
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs';
+import { join, dirname } from 'node:path';
+import { homedir } from 'node:os';
+import { coreLogger } from '../core/Log.js';
+import { contentToPlainText } from '../contracts/types/Message.js';
+import { createLLMClient } from '../llm/Client.js';
+import { createLlmGuard } from '../agents/LlmGuard.js';
+import { classifyLLMError } from '../llm/errors.js';
+import { deduplicateMemory } from './MemoryDeduplicator.js';
+import { readRecentTrajectory, renderTrajectory } from './TrajectoryReader.js';
+const MAX_LINES = 200;
+const MAX_BYTES = 10 * 1024;
+const DREAM_SYSTEM_PROMPT = `You are a memory consolidation assistant. Your job is to merge session checkpoint knowledge into a structured project MEMORY.md file.
+
+Output markdown sections (## headers). Include a section only when it has content — never emit an empty section:
+
+## Project Context
+Key facts about the project: tech stack, architecture, conventions.
+
+## Rules
+Hard rules the user has explicitly stated (never do X, always do Y).
+
+## Architecture Decisions
+Important design decisions, each with its rationale and an absolute date (YYYY-MM-DD).
+
+## Discovered Durable Knowledge
+Cross-session durable facts learned from the trajectory.
+
+## Patterns
+Repeated problems and the solution that worked, when the same situation recurs across sessions.
+
+## Gotchas
+Easy-to-miss traps and non-obvious failure modes worth flagging for future sessions.
+
+Guidelines:
+- Merge new checkpoint information into existing sections (do not duplicate or append near-identical entries).
+- Remove stale or contradicted information when newer checkpoints prove it obsolete.
+- Keep each entry to 1-3 lines. Information density matters more than completeness.
+- Convert relative dates ("yesterday", "last week") to absolute YYYY-MM-DD form.
+- Preserve the source session id at the end of an entry when the checkpoint provides one, e.g. \`[ses_xxx]\`.
+- Promote a fact only when supported by an explicit user statement, a clear decision, or repeated evidence across sessions. One-off details that mattered to a single session should be dropped.
+- Write in the same language as the source material.
+- Total output must stay under 200 lines and 10KB. Prefer fewer, denser entries.
+- Do NOT add introductory text before the first section.`;
+/** Regex to detect non-SELECT SQL statements. */
+const UNSAFE_SQL_PATTERN = /\b(INSERT|UPDATE|DELETE|DROP|ALTER|CREATE|REPLACE|ATTACH|DETACH)\b/i;
+export class DreamCommand {
+    service;
+    dbPath;
+    constructor(service, dbPath) {
+        this.service = service;
+        this.dbPath = dbPath;
+    }
+    /**
+     * Resolve the session database path.
+     * Priority: constructor-supplied > env > default (~/.lingxiao/data.db)
+     */
+    resolveDbPath() {
+        if (this.dbPath)
+            return this.dbPath;
+        if (process.env.LINGXIAO_DB_PATH)
+            return process.env.LINGXIAO_DB_PATH;
+        return join(homedir(), '.lingxiao', 'data.db');
+    }
+    /**
+     * Execute a read-only SQL query against the session database.
+     * Only SELECT queries are allowed; any mutation keywords are rejected.
+     */
+    querySessionDB(query) {
+        const trimmed = query.trim();
+        if (!trimmed) {
+            throw new Error('[DreamCommand] Empty SQL query');
+        }
+        if (UNSAFE_SQL_PATTERN.test(trimmed)) {
+            throw new Error('[DreamCommand] Only SELECT queries are allowed');
+        }
+        if (!trimmed.toUpperCase().startsWith('SELECT')) {
+            throw new Error('[DreamCommand] Only SELECT queries are allowed');
+        }
+        const dbPath = this.resolveDbPath();
+        if (!existsSync(dbPath)) {
+            coreLogger.warn(`[DreamCommand] Session database not found at ${dbPath}`);
+            return [];
+        }
+        const db = new DatabaseSync(dbPath);
+        try {
+            db.exec('PRAGMA journal_mode = WAL');
+            db.exec('PRAGMA query_only = ON');
+            const rows = db.prepare(trimmed).all();
+            return rows;
+        }
+        finally {
+            db.close();
+        }
+    }
+    /**
+     * Cross-check extracted knowledge against session DB.
+     * Queries recent sessions and message counts to validate that knowledge
+     * comes from real, active conversations.
+     */
+    verifyAgainstSessionDB() {
+        try {
+            const sessions = this.querySessionDB("SELECT * FROM sessions WHERE created_at > (strftime('%s','now') - 7*86400)");
+            const messageCounts = this.querySessionDB(`SELECT session_id, COUNT(*) as msg_count FROM messages
+         WHERE session_id IN (
+           SELECT id FROM sessions WHERE created_at > (strftime('%s','now') - 7*86400)
+         )
+         GROUP BY session_id`);
+            const totalMessages = messageCounts.reduce((sum, row) => sum + Number(row.msg_count || 0), 0);
+            return {
+                recentSessionCount: sessions.length,
+                totalMessages,
+                verified: sessions.length > 0 && totalMessages > 0,
+            };
+        }
+        catch (err) {
+            coreLogger.warn(`[DreamCommand] Session DB verification failed: ${err instanceof Error ? err.message : err}`);
+            return { recentSessionCount: 0, totalMessages: 0, verified: false };
+        }
+    }
+    /**
+     * Pull the raw conversation trajectory from the source-of-truth tables
+     * (leader_conversation + agent_conversation) within the lookback window.
+     *
+     * Delegates to the shared TrajectoryReader; kept as a thin instance method so
+     * the resolved db path (constructor > env > default) is applied consistently
+     * with verifyAgainstSessionDB.
+     *
+     * @param afterTimestampMs lower bound in epoch milliseconds.
+     * @param maxTurns hard cap on returned turns, newest-first.
+     */
+    getRecentTrajectory(afterTimestampMs, maxTurns = 400) {
+        return readRecentTrajectory(this.resolveDbPath(), afterTimestampMs, maxTurns);
+    }
+    /**
+     * Execute the /dream consolidation.
+     */
+    async execute(options) {
+        const lookbackMs = (options.sessionLookbackDays ?? 7) * 24 * 60 * 60 * 1000;
+        const maxLines = options.maxLines ?? MAX_LINES;
+        const maxBytes = options.maxBytes ?? MAX_BYTES;
+        const report = options.reporter;
+        // 1. Read current project MEMORY.md.
+        // memoryRoot is already workspace-scoped (<workspace>/.lingxiao/memory), so the
+        // top-level MEMORY.md *is* this project's memory — and it is the exact file
+        // ContextRebuild reads back into agent context (ContextRebuild.readProjectMemory).
+        // Writing into a projects/<id>/ subdir would strand the consolidation where no
+        // consumer reads it. options.projectId/workspace are retained on the type for
+        // FTS scope tagging and caller symmetry, but the consolidation target is fixed.
+        const memoryRoot = this.service.getMemoryRoot();
+        const memoryPath = join(memoryRoot, 'MEMORY.md');
+        let currentMemory = '';
+        if (existsSync(memoryPath)) {
+            currentMemory = readFileSync(memoryPath, 'utf-8');
+        }
+        // 2. Force reconciliation to ensure fresh index
+        this.service.reconcile();
+        // 3. Get recent checkpoints (last 7 days)
+        const cutoff = Date.now() - lookbackMs;
+        const checkpoints = this.service.getRecentCheckpoints(cutoff);
+        // 3a. Pull the raw trajectory (source of truth) for the same window. Bounded,
+        // newest-first; the LLM uses this to verify and enrich beyond the lossy
+        // checkpoint summaries. Oldest-first ordering reads more naturally as a log.
+        report?.progress('reading', 0.15, '读取 checkpoint 与原始轨迹');
+        const trajectory = this.getRecentTrajectory(cutoff).reverse();
+        if (checkpoints.length === 0 && trajectory.length === 0 && !currentMemory) {
+            coreLogger.info('[DreamCommand] No checkpoints, no trajectory, and no existing memory. Nothing to consolidate.');
+            return {
+                updatedPath: memoryPath,
+                sectionsConsolidated: 0,
+                linesWritten: 0,
+                checkpointsProcessed: 0,
+            };
+        }
+        // 3b. Verification phase: cross-check against session DB
+        report?.progress('analyzing', 0.35, `校对 ${checkpoints.length} 个 checkpoint · ${trajectory.length} 轮轨迹`);
+        const verification = this.verifyAgainstSessionDB();
+        if (verification.verified) {
+            coreLogger.info(`[DreamCommand] Verification passed: ${verification.recentSessionCount} sessions, ${verification.totalMessages} messages in last 7 days`);
+        }
+        else {
+            coreLogger.info('[DreamCommand] Verification: no recent session data found in DB (proceeding with checkpoint data only)');
+        }
+        // 4. Build LLM input
+        const checkpointBodies = checkpoints
+            .map((cp) => `--- checkpoint: ${cp.scope_id} ---\n${cp.body}`)
+            .join('\n\n');
+        const userMessage = this.buildUserMessage(currentMemory, checkpointBodies, checkpoints.length, trajectory);
+        // 5. Call LLM
+        report?.progress('generating', 0.55, '调用模型整合记忆');
+        let consolidated;
+        try {
+            const llm = createLLMClient();
+            const guard = createLlmGuard({ actorLabel: 'Dream', classifyError: classifyLLMError });
+            const response = await guard.call(llm, [
+                { role: 'system', content: DREAM_SYSTEM_PROMPT },
+                { role: 'user', content: userMessage },
+            ], '', undefined, false, undefined, undefined, { actorType: 'system', actorLabel: 'Dream', purpose: 'generic', requestedModel: '' }, { maxTokens: 2000, sampling: { temperature: 0.3 } });
+            consolidated = contentToPlainText(response.content);
+        }
+        catch (err) {
+            coreLogger.warn(`[DreamCommand] LLM call failed: ${err instanceof Error ? err.message : err}`);
+            // Fall back: keep existing memory unchanged
+            return {
+                updatedPath: memoryPath,
+                sectionsConsolidated: 0,
+                linesWritten: currentMemory.split('\n').length,
+                checkpointsProcessed: checkpoints.length,
+            };
+        }
+        // 6. Enforce size limits
+        consolidated = this.enforceLimit(consolidated, maxLines, maxBytes);
+        // P3: Post-merge algorithmic deduplication
+        const dedupResult = deduplicateMemory(consolidated, {
+            similarityThreshold: 0.65,
+            minSectionLength: 20,
+        });
+        if (dedupResult.duplicatesRemoved > 0) {
+            coreLogger.info(`[DreamCommand] Post-merge dedup: removed ${dedupResult.duplicatesRemoved} duplicate sections (${dedupResult.sectionsBefore} → ${dedupResult.sectionsAfter})`);
+            consolidated = dedupResult.content;
+        }
+        // 7. Write updated MEMORY.md
+        report?.progress('writing', 0.9, '写入 MEMORY.md');
+        const dir = dirname(memoryPath);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+        writeFileSync(memoryPath, consolidated, 'utf-8');
+        const lines = consolidated.split('\n').length;
+        const sections = (consolidated.match(/^## /gm) || []).length;
+        coreLogger.info(`[DreamCommand] Consolidated ${checkpoints.length} checkpoints into ${lines} lines (${sections} sections)`);
+        return {
+            updatedPath: memoryPath,
+            sectionsConsolidated: sections,
+            linesWritten: lines,
+            checkpointsProcessed: checkpoints.length,
+            verification,
+        };
+    }
+    buildUserMessage(currentMemory, checkpointBodies, count, trajectory = []) {
+        const parts = [];
+        if (currentMemory) {
+            parts.push('=== CURRENT MEMORY.md ===');
+            parts.push(currentMemory);
+            parts.push('');
+        }
+        if (trajectory.length > 0) {
+            parts.push(`=== RAW TRAJECTORY — SOURCE OF TRUTH (${trajectory.length} turns, oldest first) ===`);
+            parts.push(renderTrajectory(trajectory));
+            parts.push('');
+        }
+        if (checkpointBodies) {
+            parts.push(`=== RECENT CHECKPOINTS — STRUCTURED INDEX (${count}) ===`);
+            parts.push(checkpointBodies);
+            parts.push('');
+        }
+        parts.push('Consolidate the above into the MEMORY.md sections. The raw trajectory is authoritative — use it to verify, correct, and enrich the checkpoint summaries (which are lossy). Promote only durable, repeated, or explicitly-stated facts. Preserve all durable knowledge, remove duplicates, drop stale info.');
+        return parts.join('\n');
+    }
+    enforceLimit(text, maxLines, maxBytes) {
+        let lines = text.split('\n');
+        // Trim trailing empty lines
+        while (lines.length > 0 && lines[lines.length - 1].trim() === '') {
+            lines.pop();
+        }
+        // Enforce line limit
+        if (lines.length > maxLines) {
+            lines = lines.slice(0, maxLines);
+        }
+        // Enforce byte limit
+        let result = lines.join('\n');
+        if (Buffer.byteLength(result, 'utf-8') > maxBytes) {
+            while (lines.length > 1 && Buffer.byteLength(lines.join('\n'), 'utf-8') > maxBytes) {
+                lines.pop();
+            }
+            result = lines.join('\n');
+        }
+        return result + '\n';
+    }
+}
+//# sourceMappingURL=DreamCommand.js.map

package/dist/memory/DreamCommand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DreamCommand.js","sourceRoot":"","sources":["../../src/memory/DreamCommand.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAClC,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAEnE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG/E,MAAM,SAAS,GAAG,GAAG,CAAC;AACtB,MAAM,SAAS,GAAG,EAAE,GAAG,IAAI,CAAC;AAE5B,MAAM,mBAAmB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;yDA+B6B,CAAC;AAE1D,iDAAiD;AACjD,MAAM,kBAAkB,GAAG,qEAAqE,CAAC;AAQjG,MAAM,OAAO,YAAY;IACf,OAAO,CAAgB;IACvB,MAAM,CAAqB;IAEnC,YAAY,OAAsB,EAAE,MAAe;QACjD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;;OAGG;IACK,aAAa;QACnB,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC;QACpC,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB;YAAE,OAAO,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC;QACtE,OAAO,IAAI,CAAC,OAAO,EAAE,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,KAAa;QAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC,gDAAgD,MAAM,EAAE,CAAC,CAAC;YAC1E,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC;YACH,EAAE,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;YACrC,EAAE,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;YACvC,OAAO,IAAiB,CAAC;QAC3B,CAAC;gBAAS,CAAC;YACT,EAAE,CAAC,KAAK,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,sBAAsB;QACpB,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAClC,4EAA4E,CAC3C,CAAC;YAEpC,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CACvC;;;;6BAIqB,CACY,CAAC;YAEpC,MAAM,aAAa,GAAG,aAAa,CAAC,MAAM,CACxC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,EAAE,CAAC,CAClD,CAAC;YAEF,OAAO;gBACL,kBAAkB,EAAE,QAAQ,CAAC,MAAM;gBACnC,aAAa;gBACb,QAAQ,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,GAAG,CAAC;aACnD,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,UAAU,CAAC,IAAI,CAAC,kDAAkD,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAC9G,OAAO,EAAE,kBAAkB,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QACtE,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACH,mBAAmB,CAAC,gBAAwB,EAAE,QAAQ,GAAG,GAAG;QAC1D,OAAO,oBAAoB,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,CAAC;IAChF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,OAAqB;QACjC,MAAM,UAAU,GAAG,CAAC,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAC5E,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,SAAS,CAAC;QAC/C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,SAAS,CAAC;QAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;QAEhC,qCAAqC;QACrC,gFAAgF;QAChF,4EAA4E;QAC5E,mFAAmF;QACnF,+EAA+E;QAC/E,8EAA8E;QAC9E,gFAAgF;QAChF,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACjD,IAAI,aAAa,GAAG,EAAE,CAAC;QACvB,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3B,aAAa,GAAG,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACpD,CAAC;QAED,gDAAgD;QAChD,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAEzB,0CAA0C;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;QACvC,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;QAE9D,8EAA8E;QAC9E,wEAAwE;QACxE,6EAA6E;QAC7E,MAAM,EAAE,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAE9D,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YAC1E,UAAU,CAAC,IAAI,CAAC,+FAA+F,CAAC,CAAC;YACjH,OAAO;gBACL,WAAW,EAAE,UAAU;gBACvB,oBAAoB,EAAE,CAAC;gBACvB,YAAY,EAAE,CAAC;gBACf,oBAAoB,EAAE,CAAC;aACxB,CAAC;QACJ,CAAC;QAED,yDAAyD;QACzD,MAAM,EAAE,QAAQ,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC,MAAM,mBAAmB,UAAU,CAAC,MAAM,MAAM,CAAC,CAAC;QACxG,MAAM,YAAY,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QACnD,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,uCAAuC,YAAY,CAAC,kBAAkB,cAAc,YAAY,CAAC,aAAa,0BAA0B,CAAC,CAAC;QAC5J,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC,wGAAwG,CAAC,CAAC;QAC5H,CAAC;QAED,qBAAqB;QACrB,MAAM,gBAAgB,GAAG,WAAW;aACjC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,mBAAmB,EAAE,CAAC,QAAQ,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC;aAC7D,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,aAAa,EAAE,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAE3G,cAAc;QACd,MAAM,EAAE,QAAQ,CAAC,YAAY,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QACjD,IAAI,YAAoB,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,eAAe,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,cAAc,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,aAAa,EAAE,gBAAgB,EAAE,CAAC,CAAC;YACvF,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,IAAI,CAC/B,GAAG,EACH;gBACE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,EAAE;gBAChD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE;aACvC,EACD,EAAE,EACF,SAAS,EACT,KAAK,EACL,SAAS,EACT,SAAS,EACT,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,EAAE,EAAE,EACpF,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,EAAE,CACpD,CAAC;YAEF,YAAY,GAAG,kBAAkB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACtD,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,UAAU,CAAC,IAAI,CAAC,mCAAmC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAC/F,4CAA4C;YAC5C,OAAO;gBACL,WAAW,EAAE,UAAU;gBACvB,oBAAoB,EAAE,CAAC;gBACvB,YAAY,EAAE,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;gBAC9C,oBAAoB,EAAE,WAAW,CAAC,MAAM;aACzC,CAAC;QACJ,CAAC;QAED,yBAAyB;QACzB,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEnE,2CAA2C;QAC3C,MAAM,WAAW,GAAG,iBAAiB,CAAC,YAAY,EAAE;YAClD,mBAAmB,EAAE,IAAI;YACzB,gBAAgB,EAAE,EAAE;SACrB,CAAC,CAAC;QACH,IAAI,WAAW,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YACtC,UAAU,CAAC,IAAI,CACb,4CAA4C,WAAW,CAAC,iBAAiB,wBAAwB,WAAW,CAAC,cAAc,MAAM,WAAW,CAAC,aAAa,GAAG,CAC9J,CAAC;YACF,YAAY,GAAG,WAAW,CAAC,OAAO,CAAC;QACrC,CAAC;QAED,6BAA6B;QAC7B,MAAM,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QACjD,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;QAEjD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC9C,MAAM,QAAQ,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAE7D,UAAU,CAAC,IAAI,CAAC,+BAA+B,WAAW,CAAC,MAAM,qBAAqB,KAAK,WAAW,QAAQ,YAAY,CAAC,CAAC;QAE5H,OAAO;YACL,WAAW,EAAE,UAAU;YACvB,oBAAoB,EAAE,QAAQ;YAC9B,YAAY,EAAE,KAAK;YACnB,oBAAoB,EAAE,WAAW,CAAC,MAAM;YACxC,YAAY;SACb,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,aAAqB,EAAE,gBAAwB,EAAE,KAAa,EAAE,aAA+B,EAAE;QACxH,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,aAAa,EAAE,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,yCAAyC,UAAU,CAAC,MAAM,2BAA2B,CAAC,CAAC;YAClG,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QAED,IAAI,gBAAgB,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,8CAA8C,KAAK,OAAO,CAAC,CAAC;YACvE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,IAAI,CACR,4SAA4S,CAC7S,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEO,YAAY,CAAC,IAAY,EAAE,QAAgB,EAAE,QAAgB;QACnE,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAE7B,4BAA4B;QAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACjE,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;QAED,qBAAqB;QACrB,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACnC,CAAC;QAED,qBAAqB;QACrB,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,QAAQ,EAAE,CAAC;YAClD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,GAAG,QAAQ,EAAE,CAAC;gBACnF,KAAK,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;YACD,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,OAAO,MAAM,GAAG,IAAI,CAAC;IACvB,CAAC;CACF"}

package/dist/memory/MemoryDeduplicator.d.ts

@@ -0,0 +1,38 @@
+/**
+ * MemoryDeduplicator — Post-merge algorithmic deduplication for DreamCommand.
+ *
+ * After the LLM merges MEMORY.md, this module performs algorithmic deduplication
+ * to catch duplicates the LLM may have missed. Uses Jaccard text similarity
+ * (token-level set overlap) as the primary method — no LLM calls, fully deterministic.
+ *
+ * Strategy:
+ * 1. Split MEMORY.md into sections (by ## headers)
+ * 2. For each pair of sections, compute Jaccard similarity on token sets
+ * 3. If similarity exceeds threshold, merge the shorter section into the longer one
+ * 4. Return deduplicated content
+ */
+export interface DeduplicateOptions {
+    /** Jaccard similarity threshold above which sections are considered duplicates. Default 0.65. */
+    similarityThreshold?: number;
+    /** Minimum section length (in characters) to be considered for dedup. */
+    minSectionLength?: number;
+}
+export interface DeduplicateResult {
+    /** Deduplicated content. */
+    content: string;
+    /** Number of duplicate sections removed. */
+    duplicatesRemoved: number;
+    /** Number of sections after dedup. */
+    sectionsAfter: number;
+    /** Number of sections before dedup. */
+    sectionsBefore: number;
+}
+/**
+ * Deduplicate sections in MEMORY.md content using Jaccard text similarity.
+ *
+ * @param content The merged MEMORY.md content from DreamCommand LLM output.
+ * @param options Deduplication options.
+ * @returns Deduplicated content and statistics.
+ */
+export declare function deduplicateMemory(content: string, options?: DeduplicateOptions): DeduplicateResult;
+//# sourceMappingURL=MemoryDeduplicator.d.ts.map

package/dist/memory/MemoryDeduplicator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryDeduplicator.d.ts","sourceRoot":"","sources":["../../src/memory/MemoryDeduplicator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AA4BH,MAAM,WAAW,kBAAkB;IACjC,iGAAiG;IACjG,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,yEAAyE;IACzE,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAChC,4BAA4B;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,iBAAiB,EAAE,MAAM,CAAC;IAC1B,sCAAsC;IACtC,aAAa,EAAE,MAAM,CAAC;IACtB,uCAAuC;IACvC,cAAc,EAAE,MAAM,CAAC;CACxB;AAyBD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,kBAAuB,GAC/B,iBAAiB,CAkEnB"}

package/dist/memory/MemoryDeduplicator.js

@@ -0,0 +1,125 @@
+/**
+ * MemoryDeduplicator — Post-merge algorithmic deduplication for DreamCommand.
+ *
+ * After the LLM merges MEMORY.md, this module performs algorithmic deduplication
+ * to catch duplicates the LLM may have missed. Uses Jaccard text similarity
+ * (token-level set overlap) as the primary method — no LLM calls, fully deterministic.
+ *
+ * Strategy:
+ * 1. Split MEMORY.md into sections (by ## headers)
+ * 2. For each pair of sections, compute Jaccard similarity on token sets
+ * 3. If similarity exceeds threshold, merge the shorter section into the longer one
+ * 4. Return deduplicated content
+ */
+import { coreLogger } from '../core/Log.js';
+const DEFAULT_SIMILARITY_THRESHOLD = 0.65;
+const DEFAULT_MIN_SECTION_LENGTH = 20;
+const TOKEN_RE = /[\p{L}\p{N}_]+/gu;
+/** Tokenize text into a Set of lowercase tokens for Jaccard comparison. */
+function tokenizeSet(text) {
+    return new Set(Array.from(text.matchAll(TOKEN_RE), (m) => m[0].toLowerCase()));
+}
+/** Compute Jaccard similarity between two token sets: |A ∩ B| / |A ∪ B|. */
+function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 1;
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let intersection = 0;
+    const smaller = a.size <= b.size ? a : b;
+    const larger = a.size <= b.size ? b : a;
+    for (const token of smaller) {
+        if (larger.has(token))
+            intersection++;
+    }
+    const union = a.size + b.size - intersection;
+    return intersection / union;
+}
+/** Split MEMORY.md content into sections by ## headers. */
+function splitSections(content) {
+    const lines = content.split('\n');
+    const sections = [];
+    let current = [];
+    for (const line of lines) {
+        if (line.startsWith('## ')) {
+            if (current.length > 0) {
+                sections.push(current.join('\n'));
+            }
+            current = [line];
+        }
+        else {
+            current.push(line);
+        }
+    }
+    if (current.length > 0) {
+        sections.push(current.join('\n'));
+    }
+    return sections.filter((s) => s.trim().length > 0);
+}
+/**
+ * Deduplicate sections in MEMORY.md content using Jaccard text similarity.
+ *
+ * @param content The merged MEMORY.md content from DreamCommand LLM output.
+ * @param options Deduplication options.
+ * @returns Deduplicated content and statistics.
+ */
+export function deduplicateMemory(content, options = {}) {
+    const threshold = options.similarityThreshold ?? DEFAULT_SIMILARITY_THRESHOLD;
+    const minLen = options.minSectionLength ?? DEFAULT_MIN_SECTION_LENGTH;
+    const sections = splitSections(content);
+    const sectionsBefore = sections.length;
+    if (sections.length <= 1) {
+        return {
+            content,
+            duplicatesRemoved: 0,
+            sectionsAfter: sections.length,
+            sectionsBefore,
+        };
+    }
+    // Precompute token sets for all sections
+    const tokenSets = sections.map((s) => {
+        if (s.length < minLen)
+            return null;
+        return tokenizeSet(s);
+    });
+    // Track which sections to keep (default: all)
+    const keep = new Array(sections.length).fill(true);
+    let duplicatesRemoved = 0;
+    // Compare each pair of sections
+    for (let i = 0; i < sections.length; i++) {
+        if (!keep[i])
+            continue;
+        if (tokenSets[i] === null)
+            continue;
+        for (let j = i + 1; j < sections.length; j++) {
+            if (!keep[j])
+                continue;
+            if (tokenSets[j] === null)
+                continue;
+            const similarity = jaccardSimilarity(tokenSets[i], tokenSets[j]);
+            if (similarity >= threshold) {
+                // Keep the longer section, remove the shorter one
+                if (sections[j].length <= sections[i].length) {
+                    keep[j] = false;
+                    duplicatesRemoved++;
+                    coreLogger.info(`[MemoryDeduplicator] Removed duplicate section ${j} (similarity=${similarity.toFixed(2)} with section ${i})`);
+                }
+                else {
+                    keep[i] = false;
+                    duplicatesRemoved++;
+                    coreLogger.info(`[MemoryDeduplicator] Removed duplicate section ${i} (similarity=${similarity.toFixed(2)} with section ${j})`);
+                    break; // Move to next i since we removed i
+                }
+            }
+        }
+    }
+    const deduplicatedSections = sections.filter((_, idx) => keep[idx]);
+    const result = deduplicatedSections.join('\n\n');
+    return {
+        content: result,
+        duplicatesRemoved,
+        sectionsAfter: deduplicatedSections.length,
+        sectionsBefore,
+    };
+}
+//# sourceMappingURL=MemoryDeduplicator.js.map

package/dist/memory/MemoryDeduplicator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryDeduplicator.js","sourceRoot":"","sources":["../../src/memory/MemoryDeduplicator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAE5C,MAAM,4BAA4B,GAAG,IAAI,CAAC;AAC1C,MAAM,0BAA0B,GAAG,EAAE,CAAC;AACtC,MAAM,QAAQ,GAAG,kBAAkB,CAAC;AAEpC,2EAA2E;AAC3E,SAAS,WAAW,CAAC,IAAY;IAC/B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,4EAA4E;AAC5E,SAAS,iBAAiB,CAAC,CAAc,EAAE,CAAc;IACvD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,YAAY,EAAE,CAAC;IACxC,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;IAC7C,OAAO,YAAY,GAAG,KAAK,CAAC;AAC9B,CAAC;AAoBD,2DAA2D;AAC3D,SAAS,aAAa,CAAC,OAAe;IACpC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,OAAO,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAAe,EACf,UAA8B,EAAE;IAEhC,MAAM,SAAS,GAAG,OAAO,CAAC,mBAAmB,IAAI,4BAA4B,CAAC;IAC9E,MAAM,MAAM,GAAG,OAAO,CAAC,gBAAgB,IAAI,0BAA0B,CAAC;IAEtE,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACxC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;IAEvC,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,OAAO;YACP,iBAAiB,EAAE,CAAC;YACpB,aAAa,EAAE,QAAQ,CAAC,MAAM;YAC9B,cAAc;SACf,CAAC;IACJ,CAAC;IAED,yCAAyC;IACzC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM;YAAE,OAAO,IAAI,CAAC;QACnC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,8CAA8C;IAC9C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,gCAAgC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS;QACvB,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,SAAS;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,SAAS;YACvB,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,SAAS;YAEpC,MAAM,UAAU,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAE,EAAE,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;YAEnE,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,kDAAkD;gBAClD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;oBAC7C,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBAChB,iBAAiB,EAAE,CAAC;oBACpB,UAAU,CAAC,IAAI,CACb,kDAAkD,CAAC,gBAAgB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAC9G,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBAChB,iBAAiB,EAAE,CAAC;oBACpB,UAAU,CAAC,IAAI,CACb,kDAAkD,CAAC,gBAAgB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAC9G,CAAC;oBACF,MAAM,CAAC,oCAAoC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,oBAAoB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEjD,OAAO;QACL,OAAO,EAAE,MAAM;QACf,iBAAiB;QACjB,aAAa,EAAE,oBAAoB,CAAC,MAAM;QAC1C,cAAc;KACf,CAAC;AACJ,CAAC"}

package/dist/memory/MemoryEmbedding.d.ts

@@ -0,0 +1,25 @@
+/**
+ * MemoryEmbedding — Embedding generation and vector storage for memory entries.
+ *
+ * Uses the local LLM Gateway (http://127.0.0.1:62000) /embeddings endpoint
+ * to generate embeddings. Falls back to deterministic pseudo-embedding if
+ * the gateway is unavailable.
+ *
+ * Storage: embeddings are stored in a separate SQLite table (memory_embedding)
+ * alongside the FTS index, keyed by the same path as the memory entry.
+ */
+export interface EmbeddingResult {
+    vector: number[];
+    model: string;
+    dimensions: number;
+}
+/**
+ * Generate an embedding vector for the given text using the local LLM Gateway.
+ * Falls back to a deterministic hash-based pseudo-embedding if the gateway is unavailable.
+ */
+export declare function generateEmbedding(text: string, model?: string, dimensions?: number): Promise<EmbeddingResult>;
+/**
+ * Compute cosine similarity between two vectors.
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+//# sourceMappingURL=MemoryEmbedding.d.ts.map

package/dist/memory/MemoryEmbedding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryEmbedding.d.ts","sourceRoot":"","sources":["../../src/memory/MemoryEmbedding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAsBH,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,MAAM,EACZ,KAAK,GAAE,MAAiC,EACxC,UAAU,GAAE,MAAqC,GAChD,OAAO,CAAC,eAAe,CAAC,CA0C1B;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYjE"}