@co-engram/core 0.1.0

package/dist/dedup/llm-triage.d.ts

@@ -0,0 +1,48 @@
+/**
+ * LLM Triage（三态裁决）
+ *
+ * 接口：LlmTriageProvider（由宿主实现，绑定具体 LLM provider）
+ * 默认实现：LocalHeuristicTriage（启发式规则，无需 LLM）
+ *
+ * 启发式规则（P1 默认）：
+ *   1. contentHash 完全匹配（sha256）→ DUPLICATE（confidence=1.0）
+ *   2. title 完全相同 + similarity ≥ titleMatchUpdateThreshold → UPDATE
+ *   3. similarity ≥ highSimilarityUpdateThreshold（无论 title）→ UPDATE
+ *   4. similarity ≥ newRelatedThreshold → NEW（标记可能相关，但不合并）
+ *   5. 其他 → NEW
+ *
+ * similarity 字段由 SimilarityEngine 给出（如 TokenJaccardSimilarityEngine），
+ * triage 信任引擎结果，不重新计算。
+ *
+ * 启发式适合 P1 测试和小规模数据；生产环境用 LlmTriageProvider
+ * 调用真正的 LLM 做语义判断。
+ *
+ * @module @co-engram/core/dedup
+ */
+import type { LlmTriageProvider, TriageInput, TriageResult } from "./types.js";
+/** 启发式 triage 阈值（可配置） */
+export interface HeuristicThresholds {
+    /** title 完全相同 + similarity ≥ 此值 → UPDATE */
+    readonly titleMatchUpdateThreshold: number;
+    /** similarity ≥ 此值（无论 title）→ UPDATE */
+    readonly highSimilarityUpdateThreshold: number;
+    /** similarity ≥ 此值 → 至少考虑为 NEW（不合并） */
+    readonly newRelatedThreshold: number;
+}
+export declare const DEFAULT_THRESHOLDS: HeuristicThresholds;
+/**
+ * 启发式 triage（不调用 LLM）
+ *
+ * 适合 P1 阶段测试和小规模数据；
+ * 当候选 < 5 且规则明确时，与 LLM 结果接近。
+ */
+export declare class LocalHeuristicTriage implements LlmTriageProvider {
+    private readonly thresholds;
+    constructor(thresholds?: HeuristicThresholds);
+    triage(input: TriageInput): Promise<TriageResult>;
+    /**
+     * 同步版本：用于 engram_create 自动 dedupe
+     */
+    triageSync(input: TriageInput): TriageResult;
+}
+//# sourceMappingURL=llm-triage.d.ts.map

package/dist/dedup/llm-triage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-triage.d.ts","sourceRoot":"","sources":["../../src/dedup/llm-triage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAGH,OAAO,KAAK,EAEV,iBAAiB,EACjB,WAAW,EACX,YAAY,EACb,MAAM,YAAY,CAAC;AAEpB,yBAAyB;AACzB,MAAM,WAAW,mBAAmB;IAClC,4CAA4C;IAC5C,QAAQ,CAAC,yBAAyB,EAAE,MAAM,CAAC;IAC3C,wCAAwC;IACxC,QAAQ,CAAC,6BAA6B,EAAE,MAAM,CAAC;IAC/C,uCAAuC;IACvC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACtC;AAED,eAAO,MAAM,kBAAkB,EAAE,mBAIhC,CAAC;AAEF;;;;;GAKG;AACH,qBAAa,oBAAqB,YAAW,iBAAiB;IAE1D,OAAO,CAAC,QAAQ,CAAC,UAAU;gBAAV,UAAU,GAAE,mBAAwC;IAGjE,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,YAAY,CAAC;IAIvD;;OAEG;IACH,UAAU,CAAC,KAAK,EAAE,WAAW,GAAG,YAAY;CAkE7C"}

package/dist/dedup/llm-triage.js

@@ -0,0 +1,100 @@
+/**
+ * LLM Triage（三态裁决）
+ *
+ * 接口：LlmTriageProvider（由宿主实现，绑定具体 LLM provider）
+ * 默认实现：LocalHeuristicTriage（启发式规则，无需 LLM）
+ *
+ * 启发式规则（P1 默认）：
+ *   1. contentHash 完全匹配（sha256）→ DUPLICATE（confidence=1.0）
+ *   2. title 完全相同 + similarity ≥ titleMatchUpdateThreshold → UPDATE
+ *   3. similarity ≥ highSimilarityUpdateThreshold（无论 title）→ UPDATE
+ *   4. similarity ≥ newRelatedThreshold → NEW（标记可能相关，但不合并）
+ *   5. 其他 → NEW
+ *
+ * similarity 字段由 SimilarityEngine 给出（如 TokenJaccardSimilarityEngine），
+ * triage 信任引擎结果，不重新计算。
+ *
+ * 启发式适合 P1 测试和小规模数据；生产环境用 LlmTriageProvider
+ * 调用真正的 LLM 做语义判断。
+ *
+ * @module @co-engram/core/dedup
+ */
+import { computeContentHash } from "../storage/hash.js";
+export const DEFAULT_THRESHOLDS = {
+    titleMatchUpdateThreshold: 0.7,
+    highSimilarityUpdateThreshold: 0.85,
+    newRelatedThreshold: 0.5,
+};
+/**
+ * 启发式 triage（不调用 LLM）
+ *
+ * 适合 P1 阶段测试和小规模数据；
+ * 当候选 < 5 且规则明确时，与 LLM 结果接近。
+ */
+export class LocalHeuristicTriage {
+    thresholds;
+    constructor(thresholds = DEFAULT_THRESHOLDS) {
+        this.thresholds = thresholds;
+    }
+    async triage(input) {
+        return this.triageSync(input);
+    }
+    /**
+     * 同步版本：用于 engram_create 自动 dedupe
+     */
+    triageSync(input) {
+        if (input.candidates.length === 0) {
+            return {
+                verdict: "NEW",
+                reason: "no candidates",
+                confidence: 1,
+            };
+        }
+        const newHash = computeContentHash(input.newContent);
+        let bestUpdate = null;
+        let bestRelated = null;
+        for (const candidate of input.candidates) {
+            // 1. hash 完全匹配 → DUPLICATE
+            if (newHash === candidate.contentHash) {
+                return {
+                    verdict: "DUPLICATE",
+                    duplicateOf: candidate.id,
+                    reason: `exact contentHash match: ${candidate.contentHash}`,
+                    confidence: 1,
+                };
+            }
+            const similarity = candidate.similarity;
+            const titleMatch = candidate.title === input.newTitle;
+            // 2/3. 判断 UPDATE 条件（信任引擎给出的 similarity）
+            const shouldUpdate = (titleMatch &&
+                similarity >= this.thresholds.titleMatchUpdateThreshold) ||
+                similarity >= this.thresholds.highSimilarityUpdateThreshold;
+            if (shouldUpdate && (!bestUpdate || similarity > bestUpdate.similarity)) {
+                bestUpdate = { candidate, similarity };
+                continue;
+            }
+            // 4. 记录可能相关（但不合并）
+            if (similarity >= this.thresholds.newRelatedThreshold) {
+                if (!bestRelated || similarity > bestRelated.similarity) {
+                    bestRelated = { candidate, similarity };
+                }
+            }
+        }
+        if (bestUpdate) {
+            return {
+                verdict: "UPDATE",
+                updateTarget: bestUpdate.candidate.id,
+                reason: `similarity=${bestUpdate.similarity.toFixed(3)} title=${bestUpdate.candidate.title === input.newTitle ? "match" : "diff"}`,
+                confidence: bestUpdate.similarity,
+            };
+        }
+        return {
+            verdict: "NEW",
+            reason: bestRelated
+                ? `best related similarity=${bestRelated.similarity.toFixed(3)} below update threshold`
+                : "no candidate above update threshold",
+            confidence: 0.9,
+        };
+    }
+}
+//# sourceMappingURL=llm-triage.js.map

package/dist/dedup/llm-triage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-triage.js","sourceRoot":"","sources":["../../src/dedup/llm-triage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAkBxD,MAAM,CAAC,MAAM,kBAAkB,GAAwB;IACrD,yBAAyB,EAAE,GAAG;IAC9B,6BAA6B,EAAE,IAAI;IACnC,mBAAmB,EAAE,GAAG;CACzB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,OAAO,oBAAoB;IAEZ;IADnB,YACmB,aAAkC,kBAAkB;QAApD,eAAU,GAAV,UAAU,CAA0C;IACpE,CAAC;IAEJ,KAAK,CAAC,MAAM,CAAC,KAAkB;QAC7B,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,KAAkB;QAC3B,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,MAAM,EAAE,eAAe;gBACvB,UAAU,EAAE,CAAC;aACd,CAAC;QACJ,CAAC;QAED,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAErD,IAAI,UAAU,GACZ,IAAI,CAAC;QACP,IAAI,WAAW,GACb,IAAI,CAAC;QAEP,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACzC,2BAA2B;YAC3B,IAAI,OAAO,KAAK,SAAS,CAAC,WAAW,EAAE,CAAC;gBACtC,OAAO;oBACL,OAAO,EAAE,WAAW;oBACpB,WAAW,EAAE,SAAS,CAAC,EAAE;oBACzB,MAAM,EAAE,4BAA4B,SAAS,CAAC,WAAW,EAAE;oBAC3D,UAAU,EAAE,CAAC;iBACd,CAAC;YACJ,CAAC;YAED,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;YACxC,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,KAAK,KAAK,CAAC,QAAQ,CAAC;YAEtD,wCAAwC;YACxC,MAAM,YAAY,GAChB,CAAC,UAAU;gBACT,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,yBAAyB,CAAC;gBAC1D,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,6BAA6B,CAAC;YAE9D,IAAI,YAAY,IAAI,CAAC,CAAC,UAAU,IAAI,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gBACxE,UAAU,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;gBACvC,SAAS;YACX,CAAC;YAED,kBAAkB;YAClB,IAAI,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,mBAAmB,EAAE,CAAC;gBACtD,IAAI,CAAC,WAAW,IAAI,UAAU,GAAG,WAAW,CAAC,UAAU,EAAE,CAAC;oBACxD,WAAW,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,OAAO;gBACL,OAAO,EAAE,QAAQ;gBACjB,YAAY,EAAE,UAAU,CAAC,SAAS,CAAC,EAAE;gBACrC,MAAM,EAAE,cAAc,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,UAAU,CAAC,SAAS,CAAC,KAAK,KAAK,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE;gBAClI,UAAU,EAAE,UAAU,CAAC,UAAU;aAClC,CAAC;QACJ,CAAC;QAED,OAAO;YACL,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,WAAW;gBACjB,CAAC,CAAC,2BAA2B,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,yBAAyB;gBACvF,CAAC,CAAC,qCAAqC;YACzC,UAAU,EAAE,GAAG;SAChB,CAAC;IACJ,CAAC;CACF"}

package/dist/dedup/merge.d.ts

@@ -0,0 +1,41 @@
+/**
+ * 合并路径（UPDATE）
+ *
+ * 当 triage 裁决 UPDATE 时，调用本模块合并新旧内容：
+ *   - 用新内容覆盖旧 content
+ *   - 保留旧 meta 中不可变字段（createdBy/createdAt）
+ *   - version += 1
+ *   - mergeHistory 追加一条记录
+ *   - 更新 updatedAt / updatedBy
+ *
+ * 注意：本模块只做合并语义；具体落盘通过 repository.updateEngram。
+ *
+ * @module @co-engram/core/dedup
+ */
+import type { EngramRepository } from "../storage/repository.js";
+import type { MergeHistoryEntry } from "./types.js";
+export interface MergeInput {
+    readonly id: string;
+    readonly newTitle?: string;
+    readonly newContent?: string;
+    readonly newSummary?: string;
+    readonly newImportance?: number;
+    readonly mergedBy: string;
+    readonly reason: string;
+}
+export interface MergeResult {
+    readonly id: string;
+    readonly version: number;
+    readonly mergeHistoryEntry: MergeHistoryEntry;
+}
+/**
+ * 合并 engram（UPDATE 路径）
+ *
+ * 流程：
+ *   1. 读旧 engram
+ *   2. 计算 fromHash / toHash
+ *   3. 用 updateEngram 写入新字段（version 自动 +1）
+ *   4. 在 meta.yaml 追加 mergeHistory（通过 updateMeta 单独写入）
+ */
+export declare function mergeEngram(repo: EngramRepository, input: MergeInput): MergeResult;
+//# sourceMappingURL=merge.d.ts.map

package/dist/dedup/merge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../src/dedup/merge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEpD,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC;CAC/C;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,gBAAgB,EACtB,KAAK,EAAE,UAAU,GAChB,WAAW,CAkCb"}

package/dist/dedup/merge.js

@@ -0,0 +1,55 @@
+/**
+ * 合并路径（UPDATE）
+ *
+ * 当 triage 裁决 UPDATE 时，调用本模块合并新旧内容：
+ *   - 用新内容覆盖旧 content
+ *   - 保留旧 meta 中不可变字段（createdBy/createdAt）
+ *   - version += 1
+ *   - mergeHistory 追加一条记录
+ *   - 更新 updatedAt / updatedBy
+ *
+ * 注意：本模块只做合并语义；具体落盘通过 repository.updateEngram。
+ *
+ * @module @co-engram/core/dedup
+ */
+/**
+ * 合并 engram（UPDATE 路径）
+ *
+ * 流程：
+ *   1. 读旧 engram
+ *   2. 计算 fromHash / toHash
+ *   3. 用 updateEngram 写入新字段（version 自动 +1）
+ *   4. 在 meta.yaml 追加 mergeHistory（通过 updateMeta 单独写入）
+ */
+export function mergeEngram(repo, input) {
+    if (!repo.exists(input.id)) {
+        throw new Error(`Engram not found: ${input.id}`);
+    }
+    const old = repo.readEngram(input.id);
+    const newContent = input.newContent ?? old.content;
+    // 1. 触发 updateEngram（version+1 + 字段更新）
+    const updated = repo.updateEngram(input.id, {
+        title: input.newTitle,
+        content: input.newContent,
+        summary: input.newSummary,
+        importance: input.newImportance,
+        updatedBy: input.mergedBy,
+    });
+    // 2. 构造 merge history entry
+    const entry = {
+        at: updated.updatedAt,
+        fromHash: old.contentHash,
+        toHash: updated.contentHash,
+        reason: input.reason,
+        mergedBy: input.mergedBy,
+    };
+    // 3. P1：mergeHistory 暂存在内存（不落盘）
+    //    P2 会扩展 meta schema 加 mergeHistory 数组字段
+    // 目前通过 mergeEngram 返回值暴露给调用方，由上层决定如何持久化
+    return {
+        id: input.id,
+        version: updated.version,
+        mergeHistoryEntry: entry,
+    };
+}
+//# sourceMappingURL=merge.js.map

package/dist/dedup/merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sourceRoot":"","sources":["../../src/dedup/merge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAqBH;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CACzB,IAAsB,EACtB,KAAiB;IAEjB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,IAAI,GAAG,CAAC,OAAO,CAAC;IAEnD,uCAAuC;IACvC,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,EAAE;QAC1C,KAAK,EAAE,KAAK,CAAC,QAAQ;QACrB,OAAO,EAAE,KAAK,CAAC,UAAU;QACzB,OAAO,EAAE,KAAK,CAAC,UAAU;QACzB,UAAU,EAAE,KAAK,CAAC,aAAa;QAC/B,SAAS,EAAE,KAAK,CAAC,QAAQ;KAC1B,CAAC,CAAC;IAEH,4BAA4B;IAC5B,MAAM,KAAK,GAAsB;QAC/B,EAAE,EAAE,OAAO,CAAC,SAAS;QACrB,QAAQ,EAAE,GAAG,CAAC,WAAW;QACzB,MAAM,EAAE,OAAO,CAAC,WAAW;QAC3B,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;KACzB,CAAC;IAEF,gCAAgC;IAChC,4CAA4C;IAC5C,wCAAwC;IAExC,OAAO;QACL,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,iBAAiB,EAAE,KAAK;KACzB,CAAC;AACJ,CAAC"}

package/dist/dedup/similar.d.ts

@@ -0,0 +1,45 @@
+/**
+ * 相似度候选查找
+ *
+ * P1 实现：Token Jaccard 相似度（中英混合分词）
+ * P2 升级：向量余弦相似度（embedding model）
+ *
+ * 接口稳定：SimilarityEngine 抽象，P2 替换底层实现即可。
+ *
+ * @module @co-engram/core/dedup
+ */
+import type { EngramRepository } from "../storage/repository.js";
+import type { DedupCandidate, SimilarityEngine } from "./types.js";
+/**
+ * Token 化（与 retrieval/fts.ts 保持一致的策略）
+ *
+ * - 中文：单字 + bigram
+ * - 英文：word boundary
+ * - 小写化
+ */
+export declare function tokenizeForDedup(text: string): Set<string>;
+/**
+ * Jaccard 相似度：|A ∩ B| / |A ∪ B|
+ *
+ * 返回 [0,1]，越大越相似。
+ */
+export declare function jaccardSimilarity(a: Set<string>, b: Set<string>): number;
+/**
+ * Token Jaccard 相似度引擎（P1 默认实现）
+ */
+export declare class TokenJaccardSimilarityEngine implements SimilarityEngine {
+    private readonly repo;
+    constructor(repo: EngramRepository);
+    findCandidates(text: string, options: {
+        topK: number;
+        minSimilarity: number;
+    }): Promise<readonly DedupCandidate[]>;
+    /**
+     * 同步版本：用于 engram_create 自动 dedupe（无 IO 等待）
+     */
+    findCandidatesSync(text: string, options: {
+        topK: number;
+        minSimilarity: number;
+    }): readonly DedupCandidate[];
+}
+//# sourceMappingURL=similar.d.ts.map

package/dist/dedup/similar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar.d.ts","sourceRoot":"","sources":["../../src/dedup/similar.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEnE;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAwB1D;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAQxE;AAED;;GAEG;AACH,qBAAa,4BAA6B,YAAW,gBAAgB;IACvD,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,EAAE,gBAAgB;IAE7C,cAAc,CAClB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,GAC/C,OAAO,CAAC,SAAS,cAAc,EAAE,CAAC;IAIrC;;OAEG;IACH,kBAAkB,CAChB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,GAC/C,SAAS,cAAc,EAAE;CA6B7B"}

package/dist/dedup/similar.js

@@ -0,0 +1,103 @@
+/**
+ * 相似度候选查找
+ *
+ * P1 实现：Token Jaccard 相似度（中英混合分词）
+ * P2 升级：向量余弦相似度（embedding model）
+ *
+ * 接口稳定：SimilarityEngine 抽象，P2 替换底层实现即可。
+ *
+ * @module @co-engram/core/dedup
+ */
+/**
+ * Token 化（与 retrieval/fts.ts 保持一致的策略）
+ *
+ * - 中文：单字 + bigram
+ * - 英文：word boundary
+ * - 小写化
+ */
+export function tokenizeForDedup(text) {
+    if (!text)
+        return new Set();
+    const lower = text.toLowerCase();
+    const tokens = new Set();
+    const englishWords = lower.match(/[a-z][a-z0-9_-]{1,}/g) ?? [];
+    for (const w of englishWords)
+        tokens.add(w);
+    const chineseSegments = lower.match(/[一-龥]+/g) ?? [];
+    for (const seg of chineseSegments) {
+        if (seg.length === 1) {
+            tokens.add(seg);
+        }
+        else {
+            for (let i = 0; i < seg.length - 1; i++) {
+                tokens.add(seg.slice(i, i + 2));
+            }
+            for (const ch of seg)
+                tokens.add(ch);
+        }
+    }
+    const numbers = lower.match(/\d+/g) ?? [];
+    for (const n of numbers)
+        tokens.add(n);
+    return tokens;
+}
+/**
+ * Jaccard 相似度：|A ∩ B| / |A ∪ B|
+ *
+ * 返回 [0,1]，越大越相似。
+ */
+export function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const t of a) {
+        if (b.has(t))
+            intersection += 1;
+    }
+    const union = a.size + b.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+/**
+ * Token Jaccard 相似度引擎（P1 默认实现）
+ */
+export class TokenJaccardSimilarityEngine {
+    repo;
+    constructor(repo) {
+        this.repo = repo;
+    }
+    async findCandidates(text, options) {
+        return this.findCandidatesSync(text, options);
+    }
+    /**
+     * 同步版本：用于 engram_create 自动 dedupe（无 IO 等待）
+     */
+    findCandidatesSync(text, options) {
+        const queryTokens = tokenizeForDedup(text);
+        if (queryTokens.size === 0)
+            return [];
+        const candidates = [];
+        for (const entry of this.repo.listEngrams()) {
+            const engram = this.repo.readEngram(entry.id);
+            const engramTokens = tokenizeForDedup(`${engram.title} ${engram.summary} ${engram.content}`);
+            const similarity = jaccardSimilarity(queryTokens, engramTokens);
+            if (similarity < options.minSimilarity)
+                continue;
+            candidates.push({
+                id: engram.id,
+                title: engram.title,
+                summary: engram.summary,
+                content: engram.content,
+                contentHash: engram.contentHash,
+                similarity,
+            });
+        }
+        return candidates
+            .sort((a, b) => {
+            if (a.similarity !== b.similarity)
+                return b.similarity - a.similarity;
+            return a.id < b.id ? -1 : 1; // 稳定排序
+        })
+            .slice(0, options.topK);
+    }
+}
+//# sourceMappingURL=similar.js.map

package/dist/dedup/similar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar.js","sourceRoot":"","sources":["../../src/dedup/similar.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IAEjC,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,EAAE,CAAC;IAC/D,KAAK,MAAM,CAAC,IAAI,YAAY;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE5C,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;IACrD,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;YACD,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;IAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,4BAA4B;IACV;IAA7B,YAA6B,IAAsB;QAAtB,SAAI,GAAJ,IAAI,CAAkB;IAAG,CAAC;IAEvD,KAAK,CAAC,cAAc,CAClB,IAAY,EACZ,OAAgD;QAEhD,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,kBAAkB,CAChB,IAAY,EACZ,OAAgD;QAEhD,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEtC,MAAM,UAAU,GAAqB,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,YAAY,GAAG,gBAAgB,CACnC,GAAG,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO,EAAE,CACtD,CAAC;YACF,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAChE,IAAI,UAAU,GAAG,OAAO,CAAC,aAAa;gBAAE,SAAS;YACjD,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,MAAM,CAAC,EAAE;gBACb,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,WAAW,EAAE,MAAM,CAAC,WAAW;gBAC/B,UAAU;aACX,CAAC,CAAC;QACL,CAAC;QAED,OAAO,UAAU;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACb,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;YACtE,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;QACtC,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;CACF"}

package/dist/dedup/types.d.ts

@@ -0,0 +1,72 @@
+/**
+ * 智能去重类型定义
+ *
+ * FlexMem 风格的三态判断（DUPLICATE / UPDATE / NEW）。
+ *
+ * 流程：
+ *   1. 精确匹配：contentHash 是否已存在 → DUPLICATE
+ *   2. 相似度召回：Top-K 候选（token Jaccard 或向量余弦）
+ *   3. LLM/启发式 triage：在候选中裁决 → DUPLICATE / UPDATE / NEW
+ *   4. 处理：
+ *      - DUPLICATE：跳过创建，强化原 engram（LTP）
+ *      - UPDATE：合并 + version+1 + mergeHistory 记录
+ *      - NEW：正常创建
+ *
+ * @module @co-engram/core/dedup
+ */
+import type { EngramId } from "../types/engram.js";
+/** 三态裁决 */
+export type DedupVerdict = "DUPLICATE" | "UPDATE" | "NEW";
+/** 去重候选 */
+export interface DedupCandidate {
+    readonly id: EngramId;
+    readonly title: string;
+    readonly summary: string;
+    readonly content: string;
+    readonly contentHash: string;
+    readonly similarity: number;
+}
+/** triage 输入（候选 + 新内容） */
+export interface TriageInput {
+    readonly newTitle: string;
+    readonly newContent: string;
+    readonly candidates: readonly DedupCandidate[];
+}
+/** triage 输出 */
+export interface TriageResult {
+    readonly verdict: DedupVerdict;
+    /** verdict=DUPLICATE 时指向被复制的 engram */
+    readonly duplicateOf?: EngramId;
+    /** verdict=UPDATE 时指向被更新的 engram */
+    readonly updateTarget?: EngramId;
+    readonly reason: string;
+    readonly confidence: number;
+}
+/** 去重总结果 */
+export interface DedupResult {
+    readonly verdict: DedupVerdict;
+    readonly targetId?: EngramId;
+    readonly reason: string;
+    readonly confidence: number;
+    readonly candidatesConsidered: number;
+}
+/** 相似度引擎接口（P1: token Jaccard；P2: 向量余弦） */
+export interface SimilarityEngine {
+    findCandidates(text: string, options: {
+        topK: number;
+        minSimilarity: number;
+    }): Promise<readonly DedupCandidate[]>;
+}
+/** LLM triage 接口（宿主提供，core 不绑定 provider） */
+export interface LlmTriageProvider {
+    triage(input: TriageInput): Promise<TriageResult>;
+}
+/** 合并记录（写入 meta.mergeHistory） */
+export interface MergeHistoryEntry {
+    readonly at: string;
+    readonly fromHash: string;
+    readonly toHash: string;
+    readonly reason: string;
+    readonly mergedBy: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/dedup/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/dedup/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAEnD,WAAW;AACX,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG,QAAQ,GAAG,KAAK,CAAC;AAE1D,WAAW;AACX,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,0BAA0B;AAC1B,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,SAAS,cAAc,EAAE,CAAC;CAChD;AAED,gBAAgB;AAChB,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,uCAAuC;IACvC,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC;IAChC,oCAAoC;IACpC,QAAQ,CAAC,YAAY,CAAC,EAAE,QAAQ,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,YAAY;AACZ,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;CACvC;AAED,0CAA0C;AAC1C,MAAM,WAAW,gBAAgB;IAC/B,cAAc,CACZ,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,GAC/C,OAAO,CAAC,SAAS,cAAc,EAAE,CAAC,CAAC;CACvC;AAED,4CAA4C;AAC5C,MAAM,WAAW,iBAAiB;IAChC,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CACnD;AAED,iCAAiC;AACjC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B"}

package/dist/dedup/types.js

@@ -0,0 +1,18 @@
+/**
+ * 智能去重类型定义
+ *
+ * FlexMem 风格的三态判断（DUPLICATE / UPDATE / NEW）。
+ *
+ * 流程：
+ *   1. 精确匹配：contentHash 是否已存在 → DUPLICATE
+ *   2. 相似度召回：Top-K 候选（token Jaccard 或向量余弦）
+ *   3. LLM/启发式 triage：在候选中裁决 → DUPLICATE / UPDATE / NEW
+ *   4. 处理：
+ *      - DUPLICATE：跳过创建，强化原 engram（LTP）
+ *      - UPDATE：合并 + version+1 + mergeHistory 记录
+ *      - NEW：正常创建
+ *
+ * @module @co-engram/core/dedup
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/dedup/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/dedup/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG"}

package/dist/disclosure/adaptive.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Adaptive Disclosure：按预算自动选择 tier
+ *
+ * 实现 spec 3.2 的 adaptiveDisclosure 伪代码：
+ *
+ *   candidates = semanticSearch(query)
+ *   loaded = { c.id: c.toCatalogEntry() for c in candidates }  // 阶段 1
+ *   for c in sortByScore(candidates):                          // 阶段 2
+ *     if budget.remaining > c.digestSize:
+ *       upgrade(c, 'digest')
+ *   for c in topK(candidates, k=adaptive):                     // 阶段 3
+ *     if budget.remaining > c.contentSize:
+ *       upgrade(c, 'content')
+ *   // 阶段 4：meta/synapse 由 agent 显式请求
+ *
+ * 关键特性：
+ *   - 每个 engram 独立决定 tier（不是全量分层）
+ *   - budget 不可用时（remaining ≤ 0）停止升级
+ *   - 相同输入产生相同输出（prompt cache 友好）
+ *
+ * @module @co-engram/core/disclosure
+ */
+import type { EngramId } from "../types/engram.js";
+import type { ContextBudget, DisclosureTier, EngramView } from "../types/disclosure.js";
+import type { EngramRepository } from "../storage/repository.js";
+import type { DigestLine } from "../index/types.js";
+/** 自适应披露输入 */
+export interface AdaptiveDisclosureInput {
+    /** 仓库（用于按需加载 tier） */
+    readonly repository: EngramRepository;
+    /** 候选集（含 score；通常来自 SearchOrchestrator） */
+    readonly candidates: ReadonlyArray<{
+        id: EngramId;
+        score: number;
+    }>;
+    /** 候选的 DigestLine（用于预估大小） */
+    readonly digestLines: Readonly<Record<EngramId, DigestLine>>;
+    /** Token 预算（会被消耗，返回剩余） */
+    readonly budget: ContextBudget;
+    /** Top-K 升级到 content 的 K 值（默认 min(5, candidates.length)） */
+    readonly topK?: number;
+    /** 摘要层（阶段 2 升级上限；默认全升级） */
+    readonly maxDigestUpgrades?: number;
+}
+/** 单条加载结果 */
+export interface LoadedEntry {
+    readonly id: EngramId;
+    readonly score: number;
+    readonly view: EngramView;
+}
+/** 自适应披露输出 */
+export interface AdaptiveDisclosureResult {
+    /** 加载的视图（按原 candidates 顺序） */
+    readonly loaded: readonly LoadedEntry[];
+    /** 实际消耗的 token 数（所有视图累加） */
+    readonly tokensUsed: number;
+    /** 剩余预算 */
+    readonly budgetRemaining: number;
+    /** 各 tier 分布：tier → count */
+    readonly tierBreakdown: Readonly<Record<DisclosureTier, number>>;
+    /** 触发的阶段（1=catalog、2=digest、3=content） */
+    readonly reachedStage: 1 | 2 | 3;
+}
+/**
+ * 执行自适应披露
+ *
+ * 算法（严格按 spec 顺序）：
+ *   1. 所有候选加载为 catalog
+ *   2. 按 score 倒序，逐个升级到 digest（若预算够）
+ *   3. Top-K（默认 min(5, len)）升级到 content（若预算够）
+ *   4. meta/synapse 留给 agent 显式请求
+ *
+ * 顺序稳定性：同 score 的 candidates 保持原数组顺序（稳定排序）。
+ */
+export declare function adaptiveDisclosure(input: AdaptiveDisclosureInput): AdaptiveDisclosureResult;
+/**
+ * 在自适应结果之上，按 agent 请求升级单个 engram 到指定 tier
+ *
+ * 用于阶段 4（meta / synapse）的按需请求。
+ */
+export declare function upgradeSingle(repository: EngramRepository, current: EngramView, target: DisclosureTier, budget: ContextBudget): {
+    view: EngramView;
+    budget: ContextBudget;
+    tierChanged: boolean;
+};
+//# sourceMappingURL=adaptive.d.ts.map

package/dist/disclosure/adaptive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adaptive.d.ts","sourceRoot":"","sources":["../../src/disclosure/adaptive.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EACV,aAAa,EACb,cAAc,EACd,UAAU,EACX,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAIpD,cAAc;AACd,MAAM,WAAW,uBAAuB;IACtC,sBAAsB;IACtB,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;IACtC,2CAA2C;IAC3C,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC;QAAE,EAAE,EAAE,QAAQ,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpE,6BAA6B;IAC7B,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;IAC7D,0BAA0B;IAC1B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,4DAA4D;IAC5D,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED,aAAa;AACb,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;CAC3B;AAED,cAAc;AACd,MAAM,WAAW,wBAAwB;IACvC,8BAA8B;IAC9B,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,4BAA4B;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,WAAW;IACX,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,6BAA6B;IAC7B,QAAQ,CAAC,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC;IACjE,0CAA0C;IAC1C,QAAQ,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;CAClC;AAUD;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,uBAAuB,GAC7B,wBAAwB,CAqG1B;AAoDD;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,UAAU,EAAE,gBAAgB,EAC5B,OAAO,EAAE,UAAU,EACnB,MAAM,EAAE,cAAc,EACtB,MAAM,EAAE,aAAa,GACpB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,aAAa,CAAC;IAAC,WAAW,EAAE,OAAO,CAAA;CAAE,CAenE"}