@zooique/memora 4.0.0 → 5.1.0

package/dist/agent/managers/memoryAdvisor.js

@@ -1,322 +0,0 @@
-import { nowIso, ONE_DAY_MS } from '../../utils/time.js';
-import { roundTo } from '../../utils/math.js';
-// 召回排除默认值 SSOT 共享（设定记忆已归角色包，默认不排除）
-import { DEFAULT_RECALL_EXCLUDE_SOURCES } from '../../utils/recallDefaults.js';
-// LLM judge 高阶函数（流式累积 + parseLlmJson + configError 封装）
-import { judgeWithLlm } from '../../agent/managers/llmJudgeHelper.js';
-import { byAccessedDesc } from '../../utils/array.js';
-import { truncate } from '../../utils/strings.js';
-import { logger } from '../../logging/logger.js';
-// 治理源列表 SSOT（设定记忆已归角色包）
-import { GOVERNANCE_SOURCES } from '../../memory/governance.js';
-// ─── 常量 ────────────────────────────────────────────────
-/** 关联推荐：每个 source 采样 top-N 条 */
-const SUGGEST_TOP_PER_SOURCE = 3;
-/** 关联推荐：时效性窗口（天），超过此天数 relevance 归零（score 退役后纯时效排序） */
-const SUGGEST_RECENCY_WINDOW_DAYS = 30;
-/** 推荐内容预览字符数 */
-const ADVISOR_PREVIEW_LEN = 120;
-// ─── L3 冲突检测常量 ────────────────────────────────────
-/** 单个 source 内参与配对的条数上限（控制 O(n²) 配对规模） */
-const CONFLICT_CANDIDATES_PER_SOURCE = 10;
-/** 单次 LLM 冲突判断的候选对数上限 */
-const CONFLICT_PAIR_LIMIT = 10;
-/** LLM 冲突判断超时（ms） */
-const CONFLICT_TIMEOUT_MS = 15_000;
-/** 候选内容预览长度（送入 LLM 前截断） */
-const CONFLICT_CONTENT_PREVIEW_LEN = 200;
-// ─── 类 ──────────────────────────────────────────────────
-/** 记忆顾问：与 MemoryInspector 分工（Inspector 直接数据查询，Advisor 分析计算：健康诊断 + 推荐排序 + 冲突检测） */
-export class MemoryAdvisor {
-    index;
-    /** 后台 LLM Provider（可选，用于 L3 冲突检测，未注入时跳过） */
-    backgroundProvider;
-    /** 治理源列表（默认 GOVERNANCE_SOURCES；空治理源时推荐/冲突检测空转，测试可显式注入） */
-    sources;
-    constructor(index, backgroundProvider = null, sources = GOVERNANCE_SOURCES) {
-        this.index = index;
-        this.backgroundProvider = backgroundProvider;
-        this.sources = sources;
-    }
-    // ─── 源健康诊断 ─────────────────────────────────────────
-    /**
-     * 记忆源健康诊断：逐 source 计算记忆数量 / 最近访问天数（纯事实观测）。
-     * 不设健康等级：记忆健康由 supersede（写时取代）/ 命中体现，
-     * 无需榜单级 status 判定（daysSinceLastAccess 作冷记忆观测）。
-     * 纯只读同步不调 LLM，用 getAllSources() 发现所有 source 标签（替代全量 search）。
-     */
-    sourceHealth() {
-        // 获取所有有数据的 source 标签
-        const sourceMap = this.index.getAllSources();
-        const sourceSet = new Set();
-        for (const [source, count] of sourceMap) {
-            if (count > 0)
-                sourceSet.add(source);
-        }
-        const entries = [];
-        for (const source of sourceSet) {
-            const memories = this.index.getBySource(source);
-            const count = memories.length;
-            // 最近访问时间（取该 source 中最新 accessedAt）
-            const latestAccess = memories
-                .map((m) => new Date(m.accessedAt).getTime())
-                .filter((t) => !isNaN(t))
-                .sort((a, b) => b - a)[0] ?? 0;
-            const daysSinceLastAccess = latestAccess > 0 ? (Date.now() - latestAccess) / ONE_DAY_MS : Infinity;
-            entries.push({
-                source,
-                count,
-                daysSinceLastAccess: roundTo(daysSinceLastAccess, 1),
-            });
-        }
-        return {
-            // 按 source 名稳定排序（保证输出可预期；无关健康等级）
-            sources: entries.sort((a, b) => a.source.localeCompare(b.source)),
-            diagnosedAt: nowIso(),
-        };
-    }
-    // ─── 关联推荐 ─────────────────────────────────────────
-    /**
-     * 关联推荐：不调 LLM 纯计算，综合 accessedAt（时效）+ source 多样性，
-     * 返回"相关但尚未直接搜索到"的记忆。query 提供时结合搜索命中推荐，省略时基于最近使用。
-     * relevance 为纯时效（recency）
-     */
-    suggest(query, options = {}) {
-        const { limit = 5, excludeSources = [...DEFAULT_RECALL_EXCLUDE_SOURCES] } = options;
-        const now = Date.now();
-        // 收集候选记忆
-        const candidates = new Map();
-        // 有 query 时先搜直接命中（标记 searchHit）
-        if (query && query.trim()) {
-            const directHits = this.index.search(query, limit * 3);
-            for (const m of directHits) {
-                if (!excludeSources.includes(m.source)) {
-                    candidates.set(m.id, { memory: m, searchHit: true });
-                }
-            }
-        }
-        // 按 source 分组采样，确保来源多样性
-        for (const source of this.sources) {
-            const count = this.index.countBySource(source);
-            if (count > 0 && !excludeSources.includes(source)) {
-                const memories = this.index.getBySource(source);
-                // 取最近使用的前 N 条（score 退役后按 accessedAt 降序）
-                const top = memories.sort(byAccessedDesc).slice(0, SUGGEST_TOP_PER_SOURCE);
-                for (const m of top) {
-                    if (!candidates.has(m.id)) {
-                        candidates.set(m.id, { memory: m, searchHit: false });
-                    }
-                }
-            }
-        }
-        if (candidates.size === 0)
-            return [];
-        const scored = [];
-        for (const { memory, searchHit } of candidates.values()) {
-            // 时效性分：窗口内线性衰减，超过窗口归零；score 退役后 relevance 即纯时效
-            const accessedAt = new Date(memory.accessedAt);
-            const daysSinceAccess = isNaN(accessedAt.getTime())
-                ? SUGGEST_RECENCY_WINDOW_DAYS
-                : (now - accessedAt.getTime()) / ONE_DAY_MS;
-            const relevance = Math.max(0, 1 - daysSinceAccess / SUGGEST_RECENCY_WINDOW_DAYS);
-            // 生成推荐理由
-            let reason;
-            if (searchHit) {
-                reason = '与搜索相关';
-            }
-            else if (daysSinceAccess < 1) {
-                reason = '最近访问';
-            }
-            else {
-                reason = `${memory.source} 推荐`;
-            }
-            scored.push({ memory, searchHit, relevance, reason });
-        }
-        // 排序：搜索命中优先，然后按 relevance 降序
-        scored.sort((a, b) => {
-            if (a.searchHit !== b.searchHit)
-                return a.searchHit ? -1 : 1;
-            return b.relevance - a.relevance;
-        });
-        return scored.slice(0, limit).map(({ memory, relevance, reason }) => ({
-            id: memory.id,
-            name: memory.name,
-            source: memory.source,
-            relevance: roundTo(relevance, 2),
-            contentPreview: truncate(memory.content, ADVISOR_PREVIEW_LEN),
-            reason,
-        }));
-    }
-    // ─── L3 语义冲突检测（可选，backgroundProvider 注入后启用） ───
-    /**
-     * 语义冲突检测：加载候选（每 source top 10）→ 同 source 两两配对（前 10 对）→ LLM 判断冲突。
-     * 仅检测不修复（不自动降级，冲突需用户决策）；LLM 失败不阻塞；provider 未注入静默跳过。
-     */
-    async detectConflicts(signal) {
-        // provider 未注入时静默降级
-        if (!this.backgroundProvider) {
-            return {
-                scannedCount: 0,
-                pairCount: 0,
-                conflictCount: 0,
-                conflicts: [],
-                skippedReason: 'backgroundProvider 未注入',
-            };
-        }
-        const candidates = [];
-        for (const source of this.sources) {
-            const memories = this.index.getBySource(source);
-            // 按 accessedAt 降序取 top N（score 退役后按最近使用采样）
-            const top = memories.sort(byAccessedDesc).slice(0, CONFLICT_CANDIDATES_PER_SOURCE);
-            candidates.push(...top);
-        }
-        if (candidates.length < 2) {
-            return {
-                scannedCount: candidates.length,
-                pairCount: 0,
-                conflictCount: 0,
-                conflicts: [],
-                skippedReason: '候选记忆不足（少于 2 条）',
-            };
-        }
-        // 同 source 内两两配对
-        const pairs = this.findConflictCandidates(candidates);
-        if (pairs.length === 0) {
-            return {
-                scannedCount: candidates.length,
-                pairCount: 0,
-                conflictCount: 0,
-                conflicts: [],
-                skippedReason: '无同 source 候选对',
-            };
-        }
-        // 逐对调用 LLM 判断冲突
-        const conflicts = [];
-        for (const pair of pairs) {
-            try {
-                const verdict = await this.judgeConflict(pair[0], pair[1], signal);
-                if (verdict.hasConflict) {
-                    conflicts.push(verdict);
-                    logger.info({ memoryA: verdict.memoryA.id, memoryB: verdict.memoryB.id, reason: verdict.reason }, '冲突检测：发现语义冲突');
-                }
-            }
-            catch (err) {
-                // 单对 LLM 判断失败不阻塞后续检测
-                logger.warn({ err, pairId: `${pair[0].id}↔${pair[1].id}` }, '冲突检测：LLM 判断失败，跳过此对');
-            }
-        }
-        return {
-            scannedCount: candidates.length,
-            pairCount: pairs.length,
-            conflictCount: conflicts.length,
-            conflicts,
-        };
-    }
-    /** 筛选同 source 内候选冲突对：按 source 分组两两配对，限制每 source 配对数避免 O(n²) 爆炸，总上限 10 对 */
-    findConflictCandidates(candidates) {
-        // 按 source 分组
-        const bySource = new Map();
-        for (const m of candidates) {
-            const list = bySource.get(m.source) ?? [];
-            list.push(m);
-            bySource.set(m.source, list);
-        }
-        // 同 source 内两两配对，均匀分配配对数
-        const pairs = [];
-        const sources = [...bySource.keys()];
-        // 每个 source 分配的配对数配额（总上限 / source 数，至少 1 对/source）
-        const quotaPerSource = Math.max(1, Math.ceil(CONFLICT_PAIR_LIMIT / sources.length));
-        for (const source of sources) {
-            const list = bySource.get(source);
-            if (!list || list.length < 2)
-                continue;
-            let count = 0;
-            for (let i = 0; i < list.length && count < quotaPerSource; i++) {
-                for (let j = i + 1; j < list.length && count < quotaPerSource; j++) {
-                    pairs.push([list[i], list[j]]);
-                    count++;
-                }
-            }
-            if (pairs.length >= CONFLICT_PAIR_LIMIT)
-                break;
-        }
-        return pairs.slice(0, CONFLICT_PAIR_LIMIT);
-    }
-    /**
-     * 调用 LLM 判断两条记忆是否冲突：结构化 JSON 输出（hasConflict+conflictDescription+recommendation+reason）。
-     * 流式累积/解析/异常封装委托 llmJudgeHelper.judgeWithLlm；失败抛 MemoraError 由调用方捕获跳过。
-     */
-    async judgeConflict(memoryA, memoryB, signal) {
-        const messages = buildConflictMessages(memoryA, memoryB);
-        const parsed = await judgeWithLlm(this.backgroundProvider, messages, { maxTokens: 300, timeoutMs: CONFLICT_TIMEOUT_MS, signal }, 'LLM 冲突判断返回非法 JSON');
-        // 校验 recommendation 字段（允许 'a' / 'b' / 'both'，其他值忽略）
-        const recRaw = parsed.recommendation;
-        const recommendation = recRaw === 'a' || recRaw === 'b' || recRaw === 'both' ? recRaw : undefined;
-        return {
-            memoryA,
-            memoryB,
-            hasConflict: parsed.hasConflict === true,
-            conflictDescription: typeof parsed.conflictDescription === 'string' ? parsed.conflictDescription : undefined,
-            recommendation,
-            reason: typeof parsed.reason === 'string' ? parsed.reason : '(LLM 未提供理由)',
-        };
-    }
-}
-// ─── L3 冲突检测 Prompt 模板（模块级函数） ───
-/** 构建冲突判断的 LLM 消息：system 定义冲突规则 + user 携带两条记忆内容预览，few-shot 降误判率 */
-function buildConflictMessages(memoryA, memoryB) {
-    const contentA = memoryA.content.length > CONFLICT_CONTENT_PREVIEW_LEN
-        ? truncate(memoryA.content, CONFLICT_CONTENT_PREVIEW_LEN, '…[截断]')
-        : memoryA.content;
-    const contentB = memoryB.content.length > CONFLICT_CONTENT_PREVIEW_LEN
-        ? truncate(memoryB.content, CONFLICT_CONTENT_PREVIEW_LEN, '…[截断]')
-        : memoryB.content;
-    return [
-        {
-            role: 'system',
-            content: `你是记忆冲突检测助手。判断给定的两条记忆是否存在语义冲突（表达互相矛盾的信息）。
-
-判断规则：
-- 存在冲突 = 两条记忆表达的信息互相矛盾，不能同时为真（如"喜欢 X" vs "讨厌 X"）
-- 无冲突 = 两条记忆信息互补、独立或不相关
-- 不同维度不构成冲突（如"擅长后端" vs "偏好前端"是不同维度，非冲突）
-- 时间演化不构成冲突（如"用 React 16" vs "用 React 18"是版本升级，非冲突）
-
-输出 JSON 格式：
-{
-  "hasConflict": true/false,
-  "conflictDescription": "冲突点描述（仅 hasConflict=true 时提供）",
-  "recommendation": "a/b/both（建议保留哪条：a=保留A，b=保留B，both=都保留需用户裁决）",
-  "reason": "判断理由（简短说明）"
-}
-
-示例：
-输入 A: "用户喜欢使用 JavaScript"
-输入 B: "用户讨厌 JavaScript"
-输出: {"hasConflict": true, "conflictDescription": "对 JavaScript 的态度矛盾", "recommendation": "both", "reason": "需用户裁决当前偏好"}
-
-输入 A: "用户擅长后端开发"
-输入 B: "用户偏好前端开发"
-输出: {"hasConflict": false, "reason": "擅长领域与偏好领域是不同维度，非冲突"}`,
-        },
-        {
-            role: 'user',
-            content: `请判断以下两条记忆是否存在语义冲突：
-
-记忆 A：
-- 名称：${memoryA.name}
-- 来源：${memoryA.source}
-- 创建时间：${memoryA.createdAt}
-- 内容：${contentA}
-
-记忆 B：
-- 名称：${memoryB.name}
-- 来源：${memoryB.source}
-- 创建时间：${memoryB.createdAt}
-- 内容：${contentB}
-
-请输出 JSON 判断结果。`,
-        },
-    ];
-}
-//# sourceMappingURL=memoryAdvisor.js.map

package/dist/agent/managers/memoryAdvisor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memoryAdvisor.js","sourceRoot":"","sources":["../../../src/agent/managers/memoryAdvisor.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,mCAAmC;AACnC,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAE3E,uDAAuD;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,oCAAoC,CAAC;AAClE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,wBAAwB;AACxB,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAE5D,0DAA0D;AAE1D,gCAAgC;AAChC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AACjC,uDAAuD;AACvD,MAAM,2BAA2B,GAAG,EAAE,CAAC;AACvC,gBAAgB;AAChB,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAChC,qDAAqD;AACrD,0CAA0C;AAC1C,MAAM,8BAA8B,GAAG,EAAE,CAAC;AAC1C,yBAAyB;AACzB,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,qBAAqB;AACrB,MAAM,mBAAmB,GAAG,MAAM,CAAC;AACnC,2BAA2B;AAC3B,MAAM,4BAA4B,GAAG,GAAG,CAAC;AA0EzC,2DAA2D;AAE3D,kFAAkF;AAClF,MAAM,OAAO,aAAa;IAOL;IANnB,4CAA4C;IAC3B,kBAAkB,CAAqB;IACxD,0DAA0D;IACzC,OAAO,CAAoB;IAE5C,YACmB,KAAqB,EACtC,qBAAyC,IAAI,EAC7C,UAA6B,kBAAkB;QAF9B,UAAK,GAAL,KAAK,CAAgB;QAItC,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QAC7C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,sDAAsD;IAEtD;;;;;OAKG;IACH,YAAY;QACV,qBAAqB;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;YACxC,IAAI,KAAK,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;YAE9B,mCAAmC;YACnC,MAAM,YAAY,GAChB,QAAQ;iBACL,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;iBACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,mBAAmB,GACvB,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC;YAEzE,OAAO,CAAC,IAAI,CAAC;gBACX,MAAM;gBACN,KAAK;gBACL,mBAAmB,EAAE,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAC;aACrD,CAAC,CAAC;QACL,CAAC;QAED,OAAO;YACL,iCAAiC;YACjC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACjE,WAAW,EAAE,MAAM,EAAE;SACtB,CAAC;IACJ,CAAC;IAED,qDAAqD;IAErD;;;;OAIG;IACH,OAAO,CAAC,KAAc,EAAE,UAA0B,EAAE;QAClD,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,cAAc,GAAG,CAAC,GAAG,8BAA8B,CAAC,EAAE,GAAG,OAAO,CAAC;QAEpF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,SAAS;QACT,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkD,CAAC;QAE7E,gCAAgC;QAChC,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACvD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;oBACvC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC/C,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChD,wCAAwC;gBACxC,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;gBAC3E,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;oBACpB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;wBAC1B,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;oBACxD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,MAAM,GACV,EAAE,CAAC;QAEL,KAAK,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACxD,+CAA+C;YAC/C,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/C,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;gBACjD,CAAC,CAAC,2BAA2B;gBAC7B,CAAC,CAAC,CAAC,GAAG,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,UAAU,CAAC;YAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,eAAe,GAAG,2BAA2B,CAAC,CAAC;YAEjF,SAAS;YACT,IAAI,MAAc,CAAC;YACnB,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,GAAG,OAAO,CAAC;YACnB,CAAC;iBAAM,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,GAAG,MAAM,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,KAAK,CAAC;YACjC,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,6BAA6B;QAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACnB,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;gBAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,OAAO,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;YAChC,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,mBAAmB,CAAC;YAC7D,MAAM;SACP,CAAC,CAAC,CAAC;IACN,CAAC;IAED,iDAAiD;IAEjD;;;OAGG;IACH,KAAK,CAAC,eAAe,CAAC,MAAoB;QACxC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC7B,OAAO;gBACL,YAAY,EAAE,CAAC;gBACf,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,SAAS,EAAE,EAAE;gBACb,aAAa,EAAE,wBAAwB;aACxC,CAAC;QACJ,CAAC;QAED,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChD,2CAA2C;YAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,8BAA8B,CAAC,CAAC;YACnF,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,YAAY,EAAE,UAAU,CAAC,MAAM;gBAC/B,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,SAAS,EAAE,EAAE;gBACb,aAAa,EAAE,gBAAgB;aAChC,CAAC;QACJ,CAAC;QAED,iBAAiB;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO;gBACL,YAAY,EAAE,UAAU,CAAC,MAAM;gBAC/B,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,SAAS,EAAE,EAAE;gBACb,aAAa,EAAE,eAAe;aAC/B,CAAC;QACJ,CAAC;QAED,gBAAgB;QAChB,MAAM,SAAS,GAAsB,EAAE,CAAC;QAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBACnE,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;oBACxB,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACxB,MAAM,CAAC,IAAI,CACT,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,EACpF,aAAa,CACd,CAAC;gBACJ,CAAC;YACH,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,qBAAqB;gBACrB,MAAM,CAAC,IAAI,CACT,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAC9C,oBAAoB,CACrB,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY,EAAE,UAAU,CAAC,MAAM;YAC/B,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,aAAa,EAAE,SAAS,CAAC,MAAM;YAC/B,SAAS;SACV,CAAC;IACJ,CAAC;IAED,2EAA2E;IACnE,sBAAsB,CAAC,UAAoB;QACjD,cAAc;QACd,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,yBAAyB;QACzB,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;QACrC,mDAAmD;QACnD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAEpF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YACvC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;oBACjC,KAAK,EAAE,CAAC;gBACV,CAAC;YACH,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,IAAI,mBAAmB;gBAAE,MAAM;QACjD,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,aAAa,CACzB,OAAe,EACf,OAAe,EACf,MAAoB;QAEpB,MAAM,QAAQ,GAAG,qBAAqB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,MAAM,YAAY,CAM/B,IAAI,CAAC,kBAAmB,EACxB,QAAQ,EACR,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,EAAE,EAC1D,mBAAmB,CACpB,CAAC;QAEF,oDAAoD;QACpD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC;QACrC,MAAM,cAAc,GAClB,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAE7E,OAAO;YACL,OAAO;YACP,OAAO;YACP,WAAW,EAAE,MAAM,CAAC,WAAW,KAAK,IAAI;YACxC,mBAAmB,EACjB,OAAO,MAAM,CAAC,mBAAmB,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS;YACzF,cAAc;YACd,MAAM,EAAE,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa;SAC1E,CAAC;IACJ,CAAC;CACF;AAED,mCAAmC;AAEnC,mEAAmE;AACnE,SAAS,qBAAqB,CAAC,OAAe,EAAE,OAAe;IAC7D,MAAM,QAAQ,GACZ,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,4BAA4B;QACnD,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC;QAClE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACtB,MAAM,QAAQ,GACZ,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,4BAA4B;QACnD,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC;QAClE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IAEtB,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;;;;;;;;;;;;;2DAuB4C;SACtD;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE;;;OAGR,OAAO,CAAC,IAAI;OACZ,OAAO,CAAC,MAAM;SACZ,OAAO,CAAC,SAAS;OACnB,QAAQ;;;OAGR,OAAO,CAAC,IAAI;OACZ,OAAO,CAAC,MAAM;SACZ,OAAO,CAAC,SAAS;OACnB,QAAQ;;eAEA;SACV;KACF,CAAC;AACJ,CAAC"}

package/dist/agent/managers/memoryGovernance.d.ts

@@ -1,24 +0,0 @@
-/**
- * 记忆治理统一门面 — 聚合记忆治理操作（L1 去重 / L3 冲突 / 诊断）。
- * 治理模型 = supersede（写时取代）+ 命中刷新 accessedAt（只 touch、不做重要度加权），无衰减（见架构决策）。
- * 根本动机：治理方法原散落 Agent 公开 API 中职责碎片化，收束为单一门面 `agent.governance.xxx()`。
- * 门面仅做委托 + 空值降级不引入新逻辑（每层抽象对应一个真实故障点）；
- * 底层 Manager 未注入时返回空报告（非抛错），符合"降级优先"。
- */
-import type { DedupManager, DedupReport } from '../../agent/managers/dedupManager.js';
-import type { MemoryAdvisor, ConflictReport } from '../../agent/managers/memoryAdvisor.js';
-import type { SourceHealthReport, SuggestOptions, SuggestHit } from '../../agent/managers/memoryAdvisor.js';
-export declare class MemoryGovernance {
-    private readonly dedupManager;
-    private readonly memoryAdvisor;
-    constructor(dedupManager: DedupManager | null, memoryAdvisor: MemoryAdvisor | null);
-    /** 语义去重：扫描名称相似记忆对，LLM 判断等价性，降级重复记忆 */
-    deduplicate(signal?: AbortSignal): Promise<DedupReport>;
-    /** 冲突检测：LLM 判断同 source 记忆是否存在语义矛盾 */
-    detectConflicts(signal?: AbortSignal): Promise<ConflictReport>;
-    /** 记忆源健康诊断（纯只读）；advisor 未注入返回 null */
-    sourceHealth(): SourceHealthReport | null;
-    /** 记忆关联推荐（纯只读） */
-    suggest(query?: string, options?: SuggestOptions): SuggestHit[];
-}
-//# sourceMappingURL=memoryGovernance.d.ts.map

package/dist/agent/managers/memoryGovernance.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memoryGovernance.d.ts","sourceRoot":"","sources":["../../../src/agent/managers/memoryGovernance.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACvF,OAAO,KAAK,EACV,kBAAkB,EAClB,cAAc,EACd,UAAU,EACX,MAAM,mCAAmC,CAAC;AAE3C,qBAAa,gBAAgB;IAEzB,OAAO,CAAC,QAAQ,CAAC,YAAY;IAC7B,OAAO,CAAC,QAAQ,CAAC,aAAa;gBADb,YAAY,EAAE,YAAY,GAAG,IAAI,EACjC,aAAa,EAAE,aAAa,GAAG,IAAI;IAKtD,sCAAsC;IAChC,WAAW,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAe7D,qCAAqC;IAC/B,eAAe,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,cAAc,CAAC;IAepE,sCAAsC;IACtC,YAAY,IAAI,kBAAkB,GAAG,IAAI;IAIzC,kBAAkB;IAClB,OAAO,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,UAAU,EAAE;CAGhE"}

package/dist/agent/managers/memoryGovernance.js

@@ -1,46 +0,0 @@
-export class MemoryGovernance {
-    dedupManager;
-    memoryAdvisor;
-    constructor(dedupManager, memoryAdvisor) {
-        this.dedupManager = dedupManager;
-        this.memoryAdvisor = memoryAdvisor;
-    }
-    // ── L1 语义去重 ──────────────────────────────────────
-    /** 语义去重：扫描名称相似记忆对，LLM 判断等价性，降级重复记忆 */
-    async deduplicate(signal) {
-        if (!this.dedupManager) {
-            return {
-                scannedCount: 0,
-                pairCount: 0,
-                deduplicatedCount: 0,
-                demotedIds: [],
-                skippedReason: 'Agent 未初始化',
-            };
-        }
-        return this.dedupManager.deduplicateMemories(signal);
-    }
-    // ── L3 冲突检测 ──────────────────────────────────────
-    /** 冲突检测：LLM 判断同 source 记忆是否存在语义矛盾 */
-    async detectConflicts(signal) {
-        if (!this.memoryAdvisor) {
-            return {
-                scannedCount: 0,
-                pairCount: 0,
-                conflictCount: 0,
-                conflicts: [],
-                skippedReason: 'Agent 未初始化',
-            };
-        }
-        return this.memoryAdvisor.detectConflicts(signal);
-    }
-    // ── 诊断 ─────────────────────────────────────────────
-    /** 记忆源健康诊断（纯只读）；advisor 未注入返回 null */
-    sourceHealth() {
-        return this.memoryAdvisor?.sourceHealth() ?? null;
-    }
-    /** 记忆关联推荐（纯只读） */
-    suggest(query, options) {
-        return this.memoryAdvisor?.suggest(query, options) ?? [];
-    }
-}
-//# sourceMappingURL=memoryGovernance.js.map

package/dist/agent/managers/memoryGovernance.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memoryGovernance.js","sourceRoot":"","sources":["../../../src/agent/managers/memoryGovernance.ts"],"names":[],"mappings":"AAeA,MAAM,OAAO,gBAAgB;IAER;IACA;IAFnB,YACmB,YAAiC,EACjC,aAAmC;QADnC,iBAAY,GAAZ,YAAY,CAAqB;QACjC,kBAAa,GAAb,aAAa,CAAsB;IACnD,CAAC;IAEJ,oDAAoD;IAEpD,sCAAsC;IACtC,KAAK,CAAC,WAAW,CAAC,MAAoB;QACpC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,OAAO;gBACL,YAAY,EAAE,CAAC;gBACf,SAAS,EAAE,CAAC;gBACZ,iBAAiB,EAAE,CAAC;gBACpB,UAAU,EAAE,EAAE;gBACd,aAAa,EAAE,YAAY;aAC5B,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACvD,CAAC;IAED,oDAAoD;IAEpD,qCAAqC;IACrC,KAAK,CAAC,eAAe,CAAC,MAAoB;QACxC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YACxB,OAAO;gBACL,YAAY,EAAE,CAAC;gBACf,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,SAAS,EAAE,EAAE;gBACb,aAAa,EAAE,YAAY;aAC5B,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,sDAAsD;IAEtD,sCAAsC;IACtC,YAAY;QACV,OAAO,IAAI,CAAC,aAAa,EAAE,YAAY,EAAE,IAAI,IAAI,CAAC;IACpD,CAAC;IAED,kBAAkB;IAClB,OAAO,CAAC,KAAc,EAAE,OAAwB;QAC9C,OAAO,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC;IAC3D,CAAC;CACF"}

package/dist/memory/governance.d.ts

@@ -1,17 +0,0 @@
-/**
- * 记忆治理共享常量 — 治理源列表。
- * 排序单归语义分：使用轨迹唯一事实源为 accessedAt，无 score 写位/排序/clamp 位。
- * 纯常量模块（零依赖，仅类型 import），被 agent/managers 多模块消费，符合 agent → memory 单向依赖。
- *
- * 治理模型：supersede（写时取代）；无衰减——
- * 摘要是事实记录无"过时"语义，记忆有效性由 superseded 写时取代判定，
- * 低频记忆经相关性排序自然后移退出召回面，无"沉底/自然遗忘归档"语义。
- */
-/**
- * 治理源列表：实际写入记忆库的 source 才参与去重 / 冲突治理。
- * 当前记忆库唯一自动轨 = round-summary（摘要即记忆本体，见 memory-as-summary.md），
- * 其治理由 superseded 写时取代承担，不入本数组；content 历史残留 source 无生产写入路径。
- * 空列表时 dedup/冲突检测空转（测试可显式注入治理源）。
- */
-export declare const GOVERNANCE_SOURCES: readonly string[];
-//# sourceMappingURL=governance.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"governance.d.ts","sourceRoot":"","sources":["../../src/memory/governance.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,SAAS,MAAM,EAAO,CAAC"}

package/dist/memory/governance.js

@@ -1,17 +0,0 @@
-/**
- * 记忆治理共享常量 — 治理源列表。
- * 排序单归语义分：使用轨迹唯一事实源为 accessedAt，无 score 写位/排序/clamp 位。
- * 纯常量模块（零依赖，仅类型 import），被 agent/managers 多模块消费，符合 agent → memory 单向依赖。
- *
- * 治理模型：supersede（写时取代）；无衰减——
- * 摘要是事实记录无"过时"语义，记忆有效性由 superseded 写时取代判定，
- * 低频记忆经相关性排序自然后移退出召回面，无"沉底/自然遗忘归档"语义。
- */
-/**
- * 治理源列表：实际写入记忆库的 source 才参与去重 / 冲突治理。
- * 当前记忆库唯一自动轨 = round-summary（摘要即记忆本体，见 memory-as-summary.md），
- * 其治理由 superseded 写时取代承担，不入本数组；content 历史残留 source 无生产写入路径。
- * 空列表时 dedup/冲突检测空转（测试可显式注入治理源）。
- */
-export const GOVERNANCE_SOURCES = [];
-//# sourceMappingURL=governance.js.map

package/dist/memory/governance.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"governance.js","sourceRoot":"","sources":["../../src/memory/governance.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAsB,EAAE,CAAC"}

package/dist/memory/projectRegistry.d.ts

@@ -1,47 +0,0 @@
-import { MemoraError } from '../utils/errors.js';
-/** 项目注册表条目 */
-export interface ProjectEntry {
-    /** 项目根目录的绝对路径 */
-    path: string;
-    /** 项目名称（用户自定义或目录名） */
-    name: string;
-    /** 最后打开时间 */
-    lastOpened: string;
-}
-/**
- * 注册表损坏错误：projects.json 存在但无法解析（JSON 语法/结构不符）时抛出。
- * 与"文件不存在"（首次正常）区分；register/unregister 必须向上传播防空覆盖，
- * list getter 可捕获降级返回空数组（只读不破坏数据）。保留 registryPath 供备份/排查。
- */
-export declare class ProjectRegistryCorruptError extends MemoraError {
-    /** 损坏文件的绝对路径，便于备份/排查 */
-    readonly registryPath: string;
-    constructor(registryPath: string, cause?: unknown);
-}
-/**
- * 项目注册表：管理 projects.json 读写与条目维护；Windows 不区分大小写，路径不同大小写视为同一项目。
- */
-export declare class ProjectRegistry {
-    private readonly registryPath;
-    /** @param registryPath 注册表文件绝对路径（projects.json） */
-    constructor(registryPath: string);
-    /**
-     * 列出已注册项目（同步 getter 契约）。只读：损坏时降级返回空数组（不破坏数据），
-     * 与 register/unregister 写入路径须抛错不同。
-     */
-    get list(): ProjectEntry[];
-    /** 注册项目：路径大小写不敏感，视为同一项目（更新而非新增） */
-    register(projectPath: string, name: string): void;
-    /** 移除项目（路径大小写不敏感匹配） */
-    unregister(projectPath: string): void;
-    /** 从路径推断项目名称（取最后一段目录名，无法推断返回 'unnamed'） */
-    static inferProjectName(projectPath: string): string;
-    /**
-     * 同步读取注册表（list getter 契约）。语义：文件不存在=空数组（首次启动）；
-     * 解析失败或顶层非数组=抛 ProjectRegistryCorruptError；单条不合法仅过滤。
-     */
-    private read;
-    /** 写入注册表 */
-    private write;
-}
-//# sourceMappingURL=projectRegistry.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"projectRegistry.d.ts","sourceRoot":"","sources":["../../src/memory/projectRegistry.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAMhD,cAAc;AACd,MAAM,WAAW,YAAY;IAC3B,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,sBAAsB;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,aAAa;IACb,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,qBAAa,2BAA4B,SAAQ,WAAW;IAC1D,wBAAwB;IACxB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;gBAElB,YAAY,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;CAkBlD;AA2BD;;GAEG;AACH,qBAAa,eAAe;IAEd,OAAO,CAAC,QAAQ,CAAC,YAAY;IADzC,mDAAmD;gBACtB,YAAY,EAAE,MAAM;IAEjD;;;OAGG;IACH,IAAI,IAAI,IAAI,YAAY,EAAE,CAczB;IAED,mCAAmC;IACnC,QAAQ,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAoBjD,uBAAuB;IACvB,UAAU,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IAMrC,2CAA2C;IAC3C,MAAM,CAAC,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;IAKpD;;;OAGG;IACH,OAAO,CAAC,IAAI;IAkCZ,YAAY;IACZ,OAAO,CAAC,KAAK;CAMd"}