@zooique/memora 2.0.0 → 3.0.0

package/dist/llm/embedding.js

@@ -1,184 +0,0 @@
-/**
- * Embedding Provider — 调用 OpenAI 兼容的 /embeddings 端点
- *
- * 语义检索的核心能力：
- * - 将文本转为向量（embedding）
- * - 支持批量嵌入（减少 API 调用次数）
- * - 向量维度由模型决定（如 text-embedding-3-small: 1536 维）
- *
- * 设计原则：
- * - 复用 OpenAI 兼容协议（与 chat 共用 baseUrl/apiKey）
- * - 0 新 npm 依赖（纯 fetch 调用）
- * - 缓存机制：相同文本不重复调用 API
- *
- * 详见 ADR-003 · LLM 适配层使用 OpenAI Chat Completions 兼容协议
- */
-import { logger } from '../logging/logger.js';
-import { networkError, configError, llmError, toError } from '../utils/errors.js';
-import { mergeAbortSignals } from '../llm/abortSignal.js';
-/**
- * Embedding Provider
- *
- * 调用 /embeddings 端点将文本转为向量
- * 支持批量嵌入和本地缓存
- */
-export class EmbeddingProvider {
-    config;
-    /** 缓存最大条目数（LRU 上限，防止无界增长导致内存泄漏） */
-    static CACHE_MAX_SIZE = 1000;
-    /** 默认请求超时：60 秒（embedding 无流式推理，比 chat 的 120s 更短） */
-    static DEFAULT_TIMEOUT_MS = 60_000;
-    /** 本地缓存：text → vector（LRU，Map 迭代顺序 = 最近访问顺序） */
-    cache = new Map();
-    constructor(config) {
-        this.config = config;
-    }
-    /**
-     * LRU 读取：命中时把条目移到末尾，标记为最近访问
-     * Map 保持插入顺序，末尾即最近访问，首部即最久未访问（淘汰候选）
-     */
-    getCached(text) {
-        const vector = this.cache.get(text);
-        if (vector === undefined)
-            return undefined;
-        // 删除后重新插入，移到末尾
-        this.cache.delete(text);
-        this.cache.set(text, vector);
-        return vector;
-    }
-    /**
-     * LRU 写入：超过容量时淘汰最旧条目（首部）
-     */
-    setCache(text, vector) {
-        if (this.cache.size >= EmbeddingProvider.CACHE_MAX_SIZE) {
-            const oldest = this.cache.keys().next().value;
-            if (oldest !== undefined)
-                this.cache.delete(oldest);
-        }
-        this.cache.set(text, vector);
-    }
-    /**
-     * 嵌入单条文本
-     * @param text 待嵌入的文本
-     * @param options 调用选项（signal 外部取消 + timeoutMs 超时）
-     * @returns 向量
-     */
-    async embed(text, options) {
-        // 缓存命中
-        const cached = this.getCached(text);
-        if (cached)
-            return cached;
-        const results = await this.batchEmbed([text], options);
-        const first = results[0];
-        if (!first) {
-            // 错误处理统一：使用 llmError 工厂
-            throw llmError('嵌入结果为空', 'batchEmbed 返回空结果', ['请检查 Embedding 模型配置', '确认 API 返回了有效的向量数据']);
-        }
-        return first.vector;
-    }
-    /**
-     * 批量嵌入多条文本
-     * OpenAI 兼容 API 支持一次请求嵌入多条文本，减少 API 调用
-     * @param texts 待嵌入的文本数组
-     * @param options 调用选项（signal 外部取消 + timeoutMs 超时）
-     * @returns 嵌入结果数组（顺序与输入一致）
-     */
-    async batchEmbed(texts, options) {
-        // 过滤已缓存的
-        const uncached = [];
-        const uncachedIndices = [];
-        const results = texts.map((text, i) => {
-            const cached = this.getCached(text);
-            if (cached)
-                return { text, vector: cached };
-            uncached.push(text);
-            uncachedIndices.push(i);
-            return null;
-        });
-        // 全部命中缓存
-        if (uncached.length === 0) {
-            return results;
-        }
-        // 调用 /embeddings API
-        if (!this.config.apiKey) {
-            throw configError('Embedding API Key 未配置', 'embedding 需要 LLM API Key', [
-                '检查 ~/.memora/config.json 的 llm.apiKey 字段',
-            ]);
-        }
-        const url = `${this.config.baseUrl}/embeddings`;
-        // 合并 AbortSignal：外部取消信号 + 超时信号（mergeAbortSignals 集中维护，ADR-017 枝叶层 2 次提取）
-        // 确保用户取消和请求超时都能中断 fetch
-        const timeoutMs = options?.timeoutMs ?? EmbeddingProvider.DEFAULT_TIMEOUT_MS;
-        const abort = mergeAbortSignals(options?.signal, timeoutMs, 'Embedding 请求超时');
-        try {
-            let response;
-            try {
-                response = await fetch(url, {
-                    method: 'POST',
-                    headers: {
-                        'Content-Type': 'application/json',
-                        Authorization: `Bearer ${this.config.apiKey}`,
-                    },
-                    body: JSON.stringify({
-                        model: this.config.model,
-                        input: uncached,
-                    }),
-                    signal: abort.signal,
-                });
-            }
-            catch (err) {
-                const e = toError(err);
-                // 区分超时错误和网络错误
-                if (e.name === 'AbortError' || e.name === 'TimeoutError') {
-                    throw networkError('Embedding 请求超时', `${url} 请求超过 ${timeoutMs / 1000}s 未响应`, ['检查网络连接稳定性', '如频繁超时，考虑调整 timeoutMs', '稍后重试'], e);
-                }
-                throw networkError('Embedding 服务连接失败', `无法访问 ${url}：${e.message}`, ['检查网络连接', '确认 baseUrl 配置正确'], e);
-            }
-            if (!response.ok) {
-                const body = await response.text().catch(() => '');
-                throw networkError('Embedding 请求失败', `HTTP ${response.status}: ${body.slice(0, 200)}`, [
-                    '检查 API Key 是否有效',
-                    '确认 embedding 模型名称正确',
-                ]);
-            }
-            const data = (await response.json());
-            // 按 index 排序（API 不保证顺序）
-            const sorted = data.data.sort((a, b) => a.index - b.index);
-            // 填充结果 + 更新缓存
-            for (let i = 0; i < uncached.length; i++) {
-                // 循环条件保证索引有效，null 检查兜底
-                const text = uncached[i];
-                if (!text)
-                    continue;
-                const vector = sorted[i]?.embedding;
-                if (!vector) {
-                    logger.warn({ text: text.slice(0, 50), index: i }, 'Embedding 缺失，跳过');
-                    continue;
-                }
-                this.setCache(text, vector);
-                // null 检查兜底
-                const idx = uncachedIndices[i];
-                if (idx !== undefined)
-                    results[idx] = { text, vector };
-            }
-            return results.filter((r) => r !== null);
-        }
-        finally {
-            // 统一清理：覆盖 HTTP 错误、空 body、正常完成所有路径
-            abort.dispose();
-        }
-    }
-    /**
-     * 获取缓存大小（调试用）
-     */
-    get cacheSize() {
-        return this.cache.size;
-    }
-    /**
-     * 清空缓存
-     */
-    clearCache() {
-        this.cache.clear();
-    }
-}
-//# sourceMappingURL=embedding.js.map

package/dist/llm/embedding.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"embedding.js","sourceRoot":"","sources":["../../src/llm/embedding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAuBzD;;;;;GAKG;AACH,MAAM,OAAO,iBAAiB;IAUC;IAT7B,mCAAmC;IAC3B,MAAM,CAAU,cAAc,GAAG,IAAI,CAAC;IAE9C,oDAAoD;IAC5C,MAAM,CAAU,kBAAkB,GAAG,MAAM,CAAC;IAEpD,gDAAgD;IAC/B,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAErD,YAA6B,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;IAAG,CAAC;IAExD;;;OAGG;IACK,SAAS,CAAC,IAAY;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC3C,eAAe;QACf,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,IAAY,EAAE,MAAgB;QAC7C,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,iBAAiB,CAAC,cAAc,EAAE,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC9C,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,KAAK,CAAC,IAAY,EAAE,OAA0B;QAClD,OAAO;QACP,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,wBAAwB;YACxB,MAAM,QAAQ,CACZ,QAAQ,EACR,kBAAkB,EAClB,CAAC,oBAAoB,EAAE,mBAAmB,CAAC,CAC5C,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,UAAU,CAAC,KAAe,EAAE,OAA0B;QAC1D,SAAS;QACT,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,MAAM,OAAO,GAA+B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAChE,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,MAAM;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,SAAS;QACT,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,OAA4B,CAAC;QACtC,CAAC;QAED,qBAAqB;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,WAAW,CAAC,uBAAuB,EAAE,0BAA0B,EAAE;gBACrE,0CAA0C;aAC3C,CAAC,CAAC;QACL,CAAC;QAED,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,aAAa,CAAC;QAEhD,yEAAyE;QACzE,wBAAwB;QACxB,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,iBAAiB,CAAC,kBAAkB,CAAC;QAC7E,MAAM,KAAK,GAAG,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,gBAAgB,CAAC,CAAC;QAE9E,IAAI,CAAC;YACH,IAAI,QAAkB,CAAC;YACvB,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,EAAE;oBAC1B,MAAM,EAAE,MAAM;oBACd,OAAO,EAAE;wBACP,cAAc,EAAE,kBAAkB;wBAClC,aAAa,EAAE,UAAU,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;qBAC9C;oBACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;wBACnB,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK;wBACxB,KAAK,EAAE,QAAQ;qBAChB,CAAC;oBACF,MAAM,EAAE,KAAK,CAAC,MAAM;iBACrB,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;gBACvB,cAAc;gBACd,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;oBACzD,MAAM,YAAY,CAChB,gBAAgB,EAChB,GAAG,GAAG,SAAS,SAAS,GAAG,IAAI,OAAO,EACtC,CAAC,WAAW,EAAE,sBAAsB,EAAE,MAAM,CAAC,EAC7C,CAAC,CACF,CAAC;gBACJ,CAAC;gBACD,MAAM,YAAY,CAChB,kBAAkB,EAClB,QAAQ,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,EAC1B,CAAC,QAAQ,EAAE,iBAAiB,CAAC,EAC7B,CAAC,CACF,CAAC;YACJ,CAAC;YAED,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;gBACjB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACnD,MAAM,YAAY,CAAC,gBAAgB,EAAE,QAAQ,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE;oBACrF,iBAAiB;oBACjB,qBAAqB;iBACtB,CAAC,CAAC;YACL,CAAC;YAED,MAAM,IAAI,GAAG,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAElC,CAAC;YAEF,wBAAwB;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAE3D,cAAc;YACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,uBAAuB;gBACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;gBACpC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;oBACtE,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC5B,YAAY;gBACZ,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,GAAG,KAAK,SAAS;oBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;YACzD,CAAC;YAED,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAwB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACjE,CAAC;gBAAS,CAAC;YACT,kCAAkC;YAClC,KAAK,CAAC,OAAO,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC"}

package/dist/memory/hybridMerge.d.ts

@@ -1,54 +0,0 @@
-/**
- * 双通道融合排序 — 共享给 recall() 和 searchHybrid()
- *
- * 设计动机：
- * recall.ts 和 memoryInspector.ts 共用"向量通道 + 关键词通道合并排序"逻辑，
- * 集中到此模块实现单点维护。常量（RECALL_LIMIT_MULTIPLIER /
- * VECTOR_SCORE_WEIGHT / MEMORY_SCORE_WEIGHT）与算法同源，
- * agent 直接从本模块导入，不再绕道 recall.ts，遵守"agent 不依赖 memory
- * 内部常量"分层原则。
- *
- * 收益：
- *   - 算法单点维护（排序权重调整只需改一处）
- *   - 常量与算法同源，agent 直接从 hybridMerge 导入，不再绕道 recall.ts
- *
- * 详见 ADR-004 · 记忆统一模型 + architecture_philosophy_rules.md §6 增量召回
- */
-import type { Memory } from '../memory/types.js';
-/** 语义搜索召回倍率（在最终 limit 基础上多召回一些，供后续融合排序） */
-export declare const RECALL_LIMIT_MULTIPLIER = 2;
-/** 综合排序时语义相似度权重 */
-export declare const VECTOR_SCORE_WEIGHT = 0.6;
-/** 综合排序时记忆 score 权重 */
-export declare const MEMORY_SCORE_WEIGHT = 0.4;
-/**
- * 双通道合并结果条目
- *
- * 一条记忆在合并 Map 中的状态：memory + 它在向量通道的相似度分数。
- * vectorScore = 0 表示该记忆仅来自关键词通道（未命中向量索引）。
- */
-export interface HybridMergeEntry {
-    /** 记忆对象 */
-    memory: Memory;
-    /** 向量相似度分数（0~1，仅关键词命中时为 0） */
-    vectorScore: number;
-}
-/**
- * 双通道融合排序的纯函数
- *
- * 算法：按 vectorScore * VECTOR_SCORE_WEIGHT + memory.score * MEMORY_SCORE_WEIGHT 降序排列，
- * 取前 limit 条。
- *
- * 输入：已去重的合并 Map 的 values（或任何可迭代的 HybridMergeEntry）
- * 输出：排序后的数组（前 limit 条）
- *
- * 共享消费者：
- *   - recall.ts recall() — 召回时融合排序（+ boost + 写回存储）
- *   - memoryInspector.ts searchHybrid() — 搜索时融合排序（→ AgentSearchHit）
- *
- * @param entries - 双通道合并后的条目（调用方负责去重）
- * @param limit - 返回数量上限
- * @returns 排序后的 HybridMergeEntry 数组
- */
-export declare function hybridMerge(entries: Iterable<HybridMergeEntry>, limit: number): HybridMergeEntry[];
-//# sourceMappingURL=hybridMerge.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"hybridMerge.d.ts","sourceRoot":"","sources":["../../src/memory/hybridMerge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAIhD,2CAA2C;AAC3C,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAEzC,mBAAmB;AACnB,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC,uBAAuB;AACvB,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAIvC;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,WAAW;IACX,MAAM,EAAE,MAAM,CAAC;IACf,8BAA8B;IAC9B,WAAW,EAAE,MAAM,CAAC;CACrB;AAID;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EACnC,KAAK,EAAE,MAAM,GACZ,gBAAgB,EAAE,CASpB"}

package/dist/memory/hybridMerge.js

@@ -1,36 +0,0 @@
-// ─── 融合排序常量 ─────────────────────────────────────
-/** 语义搜索召回倍率（在最终 limit 基础上多召回一些，供后续融合排序） */
-export const RECALL_LIMIT_MULTIPLIER = 2;
-/** 综合排序时语义相似度权重 */
-export const VECTOR_SCORE_WEIGHT = 0.6;
-/** 综合排序时记忆 score 权重 */
-export const MEMORY_SCORE_WEIGHT = 0.4;
-// ─── 融合排序纯函数 ───────────────────────────────────
-/**
- * 双通道融合排序的纯函数
- *
- * 算法：按 vectorScore * VECTOR_SCORE_WEIGHT + memory.score * MEMORY_SCORE_WEIGHT 降序排列，
- * 取前 limit 条。
- *
- * 输入：已去重的合并 Map 的 values（或任何可迭代的 HybridMergeEntry）
- * 输出：排序后的数组（前 limit 条）
- *
- * 共享消费者：
- *   - recall.ts recall() — 召回时融合排序（+ boost + 写回存储）
- *   - memoryInspector.ts searchHybrid() — 搜索时融合排序（→ AgentSearchHit）
- *
- * @param entries - 双通道合并后的条目（调用方负责去重）
- * @param limit - 返回数量上限
- * @returns 排序后的 HybridMergeEntry 数组
- */
-export function hybridMerge(entries, limit) {
-    return [...entries]
-        .sort((a, b) => {
-        // 综合分数 = 向量相似度 * 0.6 + 记忆 score * 0.4
-        const scoreA = a.vectorScore * VECTOR_SCORE_WEIGHT + a.memory.score * MEMORY_SCORE_WEIGHT;
-        const scoreB = b.vectorScore * VECTOR_SCORE_WEIGHT + b.memory.score * MEMORY_SCORE_WEIGHT;
-        return scoreB - scoreA;
-    })
-        .slice(0, limit);
-}
-//# sourceMappingURL=hybridMerge.js.map

package/dist/memory/hybridMerge.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hybridMerge.js","sourceRoot":"","sources":["../../src/memory/hybridMerge.ts"],"names":[],"mappings":"AAkBA,mDAAmD;AAEnD,2CAA2C;AAC3C,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAEzC,mBAAmB;AACnB,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC,uBAAuB;AACvB,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAiBvC,kDAAkD;AAElD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,WAAW,CACzB,OAAmC,EACnC,KAAa;IAEb,OAAO,CAAC,GAAG,OAAO,CAAC;SAChB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,sCAAsC;QACtC,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,GAAG,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,mBAAmB,CAAC;QAC1F,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,GAAG,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,mBAAmB,CAAC;QAC1F,OAAO,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC"}

package/dist/memory/inMemoryRelationStore.d.ts

@@ -1,51 +0,0 @@
-/**
- * InMemoryRelationStore — 内存关系存储测试用实现
- *
- * 职责：
- * - 实现 IMemoryRelationStore 接口，纯内存数组存储
- * - 用于单元测试和开发环境验证，不持久化
- * - 与 InMemoryStorage 对齐，提供零 IO 的测试基座
- *
- * 设计原则（ADR-014）：
- * - 零 native 依赖：纯 JS 数组操作
- * - 幂等添加：sourceId+targetId+type 三元组唯一，重复添加更新 weight/createdAt
- * - 方向过滤：getRelations 按 direction 参数过滤 sourceId/targetId
- *
- * 宿主项目应实现 SqliteRelationStore（依赖 better-sqlite3）用于生产环境。
- */
-import type { MemoryRelation, RelationDirection } from '../memory/types.js';
-import type { IMemoryRelationStore } from '../memory/relationStore.js';
-export declare class InMemoryRelationStore implements IMemoryRelationStore {
-    /** 关系列表（内存数组，不持久化） */
-    private readonly relations;
-    /**
-     * 添加关系
-     *
-     * 三元组唯一约束：sourceId+targetId+type 已存在时更新 weight/createdAt（幂等）。
-     */
-    addRelation(relation: MemoryRelation): void;
-    /**
-     * 查询某记忆的关系
-     *
-     * direction 控制方向过滤：
-     * - 'outgoing'：sourceId = memoryId
-     * - 'incoming'：targetId = memoryId
-     * - 'both'：合并两个方向并去重（基于对象引用）
-     */
-    getRelations(memoryId: string, direction?: RelationDirection): MemoryRelation[];
-    /**
-     * 按关系类型查询
-     */
-    getRelationsByType(type: string): MemoryRelation[];
-    /**
-     * 获取全部关系
-     */
-    getAllRelations(): MemoryRelation[];
-    /**
-     * 删除指定关系
-     *
-     * sourceId+targetId+type 唯一定位，删除单条关系。
-     */
-    removeRelation(sourceId: string, targetId: string, type: string): void;
-}
-//# sourceMappingURL=inMemoryRelationStore.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"inMemoryRelationStore.d.ts","sourceRoot":"","sources":["../../src/memory/inMemoryRelationStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,KAAK,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAC3E,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAEtE,qBAAa,qBAAsB,YAAW,oBAAoB;IAChE,sBAAsB;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAwB;IAElD;;;;OAIG;IACH,WAAW,CAAC,QAAQ,EAAE,cAAc,GAAG,IAAI;IAe3C;;;;;;;OAOG;IACH,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,iBAA0B,GAAG,cAAc,EAAE;IAavF;;OAEG;IACH,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,EAAE;IAIlD;;OAEG;IACH,eAAe,IAAI,cAAc,EAAE;IAInC;;;;OAIG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;CAQvE"}

package/dist/memory/inMemoryRelationStore.js

@@ -1,65 +0,0 @@
-export class InMemoryRelationStore {
-    /** 关系列表（内存数组，不持久化） */
-    relations = [];
-    /**
-     * 添加关系
-     *
-     * 三元组唯一约束：sourceId+targetId+type 已存在时更新 weight/createdAt（幂等）。
-     */
-    addRelation(relation) {
-        const existingIdx = this.relations.findIndex((r) => r.sourceId === relation.sourceId &&
-            r.targetId === relation.targetId &&
-            r.type === relation.type);
-        if (existingIdx >= 0) {
-            // 幂等更新：保留原位置，覆盖 weight 和 createdAt
-            this.relations[existingIdx] = { ...relation };
-        }
-        else {
-            this.relations.push({ ...relation });
-        }
-    }
-    /**
-     * 查询某记忆的关系
-     *
-     * direction 控制方向过滤：
-     * - 'outgoing'：sourceId = memoryId
-     * - 'incoming'：targetId = memoryId
-     * - 'both'：合并两个方向并去重（基于对象引用）
-     */
-    getRelations(memoryId, direction = 'both') {
-        if (direction === 'outgoing') {
-            return this.relations.filter((r) => r.sourceId === memoryId).map((r) => ({ ...r }));
-        }
-        if (direction === 'incoming') {
-            return this.relations.filter((r) => r.targetId === memoryId).map((r) => ({ ...r }));
-        }
-        // 'both'：合并两个方向（每条关系最多匹配一次，无需去重）
-        return this.relations
-            .filter((r) => r.sourceId === memoryId || r.targetId === memoryId)
-            .map((r) => ({ ...r }));
-    }
-    /**
-     * 按关系类型查询
-     */
-    getRelationsByType(type) {
-        return this.relations.filter((r) => r.type === type).map((r) => ({ ...r }));
-    }
-    /**
-     * 获取全部关系
-     */
-    getAllRelations() {
-        return this.relations.map((r) => ({ ...r }));
-    }
-    /**
-     * 删除指定关系
-     *
-     * sourceId+targetId+type 唯一定位，删除单条关系。
-     */
-    removeRelation(sourceId, targetId, type) {
-        const idx = this.relations.findIndex((r) => r.sourceId === sourceId && r.targetId === targetId && r.type === type);
-        if (idx >= 0) {
-            this.relations.splice(idx, 1);
-        }
-    }
-}
-//# sourceMappingURL=inMemoryRelationStore.js.map

package/dist/memory/inMemoryRelationStore.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"inMemoryRelationStore.js","sourceRoot":"","sources":["../../src/memory/inMemoryRelationStore.ts"],"names":[],"mappings":"AAkBA,MAAM,OAAO,qBAAqB;IAChC,sBAAsB;IACL,SAAS,GAAqB,EAAE,CAAC;IAElD;;;;OAIG;IACH,WAAW,CAAC,QAAwB;QAClC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAC1C,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ;YAChC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ;YAChC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAC3B,CAAC;QACF,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;YACrB,mCAAmC;YACnC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC;QAChD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,QAAgB,EAAE,YAA+B,MAAM;QAClE,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACtF,CAAC;QACD,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACtF,CAAC;QACD,iCAAiC;QACjC,OAAO,IAAI,CAAC,SAAS;aAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC;aACjE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,IAAY;QAC7B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,QAAgB,EAAE,QAAgB,EAAE,IAAY;QAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAC7E,CAAC;QACF,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;CACF"}

package/dist/memory/loader.d.ts

@@ -1,49 +0,0 @@
-/**
- * 记忆加载器
- *
- * 职责：把文件系统的记忆（personas/rules/skills）加载到 SQLite 索引
- *       启动时：扫描文件 → 写入索引 → 按 source 召回必召记忆
- *
- * 这是"万物皆记忆"哲学的代码体现——所有记忆共享同一条加载管线
- */
-import type { FileStore } from '../memory/store.js';
-import type { IMemoryStorage } from '../memory/storageInterface.js';
-import { type Memory } from '../memory/types.js';
-export interface LoadResult {
-    /** 实际加载到索引的记忆数量 */
-    loaded: number;
-    /** 跳过的记忆（解析失败等） */
-    skipped: number;
-    /** 加载失败的详情 */
-    errors: Array<{
-        file: string;
-        error: string;
-    }>;
-}
-export declare class MemoryLoader {
-    private readonly fileStore;
-    private readonly index;
-    constructor(fileStore: FileStore, index: IMemoryStorage);
-    /**
-     * 扫描所有"配置类"记忆文件（persona/rule/skill）
-     * 写入 SQLite 索引
-     *
-     * @returns 加载结果统计
-     */
-    loadAllToIndex(): Promise<LoadResult>;
-    /**
-     * 启动时的完整引导流程
-     * 1. 扫描配置文件 → 写入索引
-     * 2. 从索引按 source 召回必召记忆（rule + skill）
-     *
-     * 注：persona 记忆由 PersonaManager 单独处理，
-     * bootstrap 中自动跳过 persona（避免与 systemPromptPrefix 中的角色 prompt 重复）。
-     *
-     * @returns 启动时必召的所有记忆（用于初始化 Agent Loop 的 system prompt）
-     */
-    bootstrap(): Promise<{
-        memories: Memory[];
-        loadResult: LoadResult;
-    }>;
-}
-//# sourceMappingURL=loader.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"loader.d.ts","sourceRoot":"","sources":["../../src/memory/loader.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAiB,KAAK,MAAM,EAAE,MAAM,mBAAmB,CAAC;AA6B/D,MAAM,WAAW,UAAU;IACzB,mBAAmB;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,mBAAmB;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc;IACd,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAChD;AAED,qBAAa,YAAY;IAErB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,KAAK;gBADL,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,cAAc;IAGxC;;;;;OAKG;IACG,cAAc,IAAI,OAAO,CAAC,UAAU,CAAC;IAgC3C;;;;;;;;;OASG;IACG,SAAS,IAAI,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,UAAU,EAAE,UAAU,CAAA;KAAE,CAAC;CAW3E"}

package/dist/memory/loader.js

@@ -1,93 +0,0 @@
-import { SOURCE_LABELS } from '../memory/types.js';
-import { toError } from '../utils/toError.js';
-/**
- * 启动时全量扫描的 source 列表
- * - insight/profile/work-projection：运行时产生，不由 FileStore 管理
- * - tool：由 registerTool() 注册为 tool_call，不再重复注入 system prompt
- * - guardrail：由 AgentLoop 运行时读取，不注入 system prompt
- */
-const STARTUP_SCAN_SOURCES = [
-    SOURCE_LABELS.PERSONA,
-    SOURCE_LABELS.RULE,
-    SOURCE_LABELS.SKILL,
-    SOURCE_LABELS.GUARDRAIL,
-];
-/**
- * 判断内容是否为空壳模板（仅含标题和 blockquote 占位说明）
- * 新建项目时的空壳规则模板属于此类
- *
- * 判断逻辑：过滤掉标题行和空行后，剩余内容全部是 blockquote 行
- */
-function isPlaceholderContent(memory) {
-    const trimmed = memory.content.trim();
-    if (trimmed.length > 200)
-        return false;
-    const lines = trimmed.split('\n').filter(l => l.trim() && !l.trim().startsWith('#'));
-    return lines.length > 0 && lines.every(l => l.trim().startsWith('>'));
-}
-export class MemoryLoader {
-    fileStore;
-    index;
-    constructor(fileStore, index) {
-        this.fileStore = fileStore;
-        this.index = index;
-    }
-    /**
-     * 扫描所有"配置类"记忆文件（persona/rule/skill）
-     * 写入 SQLite 索引
-     *
-     * @returns 加载结果统计
-     */
-    async loadAllToIndex() {
-        const result = { loaded: 0, skipped: 0, errors: [] };
-        for (const source of STARTUP_SCAN_SOURCES) {
-            const names = await this.fileStore.list(source);
-            for (const name of names) {
-                try {
-                    const memory = await this.fileStore.read(source, name);
-                    if (!memory) {
-                        result.skipped++;
-                        continue;
-                    }
-                    // 跳过空壳模板（新建项目时的占位文件，无实质规则内容）
-                    if (isPlaceholderContent(memory)) {
-                        result.skipped++;
-                        continue;
-                    }
-                    this.index.upsert(memory);
-                    result.loaded++;
-                }
-                catch (err) {
-                    result.skipped++;
-                    result.errors.push({
-                        file: `${source}/${name}`,
-                        error: toError(err).message,
-                    });
-                }
-            }
-        }
-        return result;
-    }
-    /**
-     * 启动时的完整引导流程
-     * 1. 扫描配置文件 → 写入索引
-     * 2. 从索引按 source 召回必召记忆（rule + skill）
-     *
-     * 注：persona 记忆由 PersonaManager 单独处理，
-     * bootstrap 中自动跳过 persona（避免与 systemPromptPrefix 中的角色 prompt 重复）。
-     *
-     * @returns 启动时必召的所有记忆（用于初始化 Agent Loop 的 system prompt）
-     */
-    async bootstrap() {
-        const loadResult = await this.loadAllToIndex();
-        // 按 source 获取 rule 和 skill 记忆（跳过 persona，由 PersonaManager 单独管理）
-        const rules = this.index.getBySource(SOURCE_LABELS.RULE);
-        const skills = this.index.getBySource(SOURCE_LABELS.SKILL);
-        const memories = [...rules, ...skills];
-        return {
-            memories,
-            loadResult,
-        };
-    }
-}
-//# sourceMappingURL=loader.js.map

package/dist/memory/loader.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"loader.js","sourceRoot":"","sources":["../../src/memory/loader.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,aAAa,EAAe,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAE7C;;;;;GAKG;AACH,MAAM,oBAAoB,GAAa;IACrC,aAAa,CAAC,OAAO;IACrB,aAAa,CAAC,IAAI;IAClB,aAAa,CAAC,KAAK;IACnB,aAAa,CAAC,SAAS;CACxB,CAAC;AAEF;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,MAAc;IAC1C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,KAAK,CAAC;IACvC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACrF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;AACxE,CAAC;AAWD,MAAM,OAAO,YAAY;IAEJ;IACA;IAFnB,YACmB,SAAoB,EACpB,KAAqB;QADrB,cAAS,GAAT,SAAS,CAAW;QACpB,UAAK,GAAL,KAAK,CAAgB;IACrC,CAAC;IAEJ;;;;;OAKG;IACH,KAAK,CAAC,cAAc;QAClB,MAAM,MAAM,GAAe,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAEjE,KAAK,MAAM,MAAM,IAAI,oBAAoB,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBACvD,IAAI,CAAC,MAAM,EAAE,CAAC;wBACZ,MAAM,CAAC,OAAO,EAAE,CAAC;wBACjB,SAAS;oBACX,CAAC;oBACD,6BAA6B;oBAC7B,IAAI,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC;wBACjC,MAAM,CAAC,OAAO,EAAE,CAAC;wBACjB,SAAS;oBACX,CAAC;oBACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC1B,MAAM,CAAC,MAAM,EAAE,CAAC;gBAClB,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;wBACjB,IAAI,EAAE,GAAG,MAAM,IAAI,IAAI,EAAE;wBACzB,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO;qBAC5B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,SAAS;QACb,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;QAC/C,gEAAgE;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC,CAAC;QACvC,OAAO;YACL,QAAQ;YACR,UAAU;SACX,CAAC;IACJ,CAAC;CACF"}

package/dist/memory/recall.d.ts

@@ -1,66 +0,0 @@
-/**
- * 记忆召回 — 简化关键词搜索
- *
- * 设计哲学：每次用户发消息，从所有记忆中搜索最相关的几条注入上下文
- * 基于基元驱动模型，通过 source 开放字符串区分记忆来源，
- * 通过双通道（语义 + 关键词）召回，无需独立管理器
- *
- * 双通道融合排序算法在 hybridMerge.ts 中实现，与 memoryInspector.searchHybrid() 共享。
- *
- * 详见 ADR-004 · 记忆统一模型 + architecture_philosophy_rules.md §6 增量召回
- */
-import type { Memory } from '../memory/types.js';
-import type { IMemoryStorage } from '../memory/storageInterface.js';
-import type { IVectorStore } from '../memory/vectorStore.js';
-/** 一天对应的毫秒数 */
-export declare const ONE_DAY_MS: number;
-/**
- * 从文本中提取关键词（用于记忆召回）
- *
- * 基于 segmentText() 精确分词，叠加停用词过滤 + 英文词补充 + 去重。
- * 分词基础设施统一由 segmenter.ts 提供，避免重复实现。
- *
- * @param input - 输入文本
- * @returns 关键词数组（去重 + 停用词过滤）
- */
-export declare function extractKeywords(input: string): string[];
-/**
- * 召回选项
- */
-export interface RecallOptions {
-    /** 返回数量上限（默认 5） */
-    limit?: number;
-    /** 排除的 source 标签（默认排除 persona、rule、skill——已单独注入 system prompt 的记忆） */
-    excludeSources?: string[];
-    /** 向量存储（可选，提供时启用语义搜索；接受任意 IVectorStore 实现） */
-    vectorStore?: IVectorStore;
-    /** 语义搜索相似度阈值（默认 0.3） */
-    minSimilarity?: number;
-}
-/**
- * 从记忆存储中搜索相关记忆
- *
- * 双通道召回策略：
- * 1. 语义搜索（VectorStore 可用时）：向量余弦相似度
- * 2. 关键词搜索（兜底）：LIKE 匹配
- * 3. 两路结果合并去重，按 score + similarity 综合排序（委托给 hybridMerge）
- * 4. 排除已单独注入的记忆（persona、rule、skill）
- * 5. 返回 top N
- *
- * 融合排序算法已提取到 hybridMerge.ts，与 searchHybrid() 共享同一实现
- *
- * @param storage - 记忆存储实例
- * @param query - 搜索查询文本
- * @param options - 召回选项
- * @returns 匹配的记忆列表
- */
-export declare function recall(storage: IMemoryStorage, query: string, options?: RecallOptions): Promise<Memory[]>;
-/**
- * 对单条记忆执行衰减计算
- *
- * @param memory - 要衰减的记忆
- * @param now - 当前时间（Date 对象）
- * @returns 是否实际发生了衰减
- */
-export declare function applyDecayToMemory(memory: Memory, now: Date): boolean;
-//# sourceMappingURL=recall.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"recall.d.ts","sourceRoot":"","sources":["../../src/memory/recall.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AA2B5D,eAAe;AACf,eAAO,MAAM,UAAU,QAAsB,CAAC;AAE9C;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAUvD;AAID;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,mBAAmB;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B,8CAA8C;IAC9C,WAAW,CAAC,EAAE,YAAY,CAAC;IAC3B,wBAAwB;IACxB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,MAAM,CAC1B,OAAO,EAAE,cAAc,EACvB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,aAAkB,GAC1B,OAAO,CAAC,MAAM,EAAE,CAAC,CAgEnB;AAkBD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,GAAG,OAAO,CAcrE"}