@co-engram/core 0.1.0

package/dist/observability/necessity-evaluator.js

@@ -0,0 +1,487 @@
+/**
+ * 必要性评估器(Necessity Evaluator)
+ *
+ * 在 cluster 晋升 proposal 前,判断"这个反复出现的话题是否值得固化为团队记忆"。
+ * 设计参考 flexmem 的 task 层 `shouldSkipSummary`(8 条规则)+ mem0 的"重要性
+ * 判断交给 extraction LLM,filter 层只过滤明显垃圾"的分工哲学。
+ *
+ * 两层设计:
+ *   - Layer 1(proposal-engine.observe 入口):规则预过滤,零成本挡机械噪声
+ *   - Layer 2(proposal-engine.maybePromoteToProposal):必要性评估
+ *     - 默认 RuleBasedNecessityEvaluator(零依赖,挡 80% 低质量提案)
+ *     - host 可注入 LlmNecessityEvaluator(用 LLM 判断语义必要性)
+ *
+ * core 不绑定 LLM provider,通过 LlmClient 接口抽象;host 自行实现具体适配器
+ * (Anthropic / OpenAI-compatible / 本地模型)。
+ *
+ * @module @co-engram/core/observability
+ */
+// ============================================================
+// Layer 1:消息预过滤(纯函数,observe 入口调用)
+// ============================================================
+/**
+ * Trivial 词集合(中英双语)
+ *
+ * 参考 flexmem TRIVIAL_PATTERNS,适配 co-engram 的"团队决策记忆"场景。
+ * 单独的问候/确认/测试内容不应触发聚类。
+ *
+ * 判断逻辑(参考 flexmem looksLikeTrivialContent):
+ *   - 把消息按空白切成词(CJK 段按 bigram 切)
+ *   - 统计 trivial 词占比
+ *   - 占比 > 60% → 视为 trivial 内容
+ *
+ * 这比 "^(ok|hi|...)$" 整条匹配更稳健,能识别 "ok ok ok done done" 这种重复 trivial。
+ */
+const TRIVIAL_WORDS = new Set([
+    // 英文
+    "test",
+    "testing",
+    "hello",
+    "hi",
+    "hey",
+    "ok",
+    "okay",
+    "yes",
+    "no",
+    "yeah",
+    "nope",
+    "sure",
+    "thanks",
+    "thank",
+    "you",
+    "thx",
+    "ping",
+    "pong",
+    "done",
+    "next",
+    "continue",
+    "go",
+    "stop",
+    "wait",
+    "confirm",
+    "lol",
+    "haha",
+    "hmm",
+    "aaa",
+    "bbb",
+    "xxx",
+    "zzz",
+    "123",
+    "asdf",
+    "qwer",
+    // 中文(单字 + 双字)
+    "测试",
+    "你好",
+    "好的",
+    "嗯",
+    "是的",
+    "不是",
+    "谢谢",
+    "继续",
+    "下一个",
+    "完成",
+    "确认",
+    "对",
+    "不对",
+    "行",
+    "不行",
+    "可以",
+    "不可以",
+    "搞定",
+    "收到",
+]);
+/** 仅空白/标点 */
+const ONLY_PUNCT_RE = /^[\s\p{P}\p{S}]*$/u;
+/**
+ * 判断消息是否由 trivial 词主导(占比 > 60%)
+ *
+ * 用于 Layer 1 入口和 Layer 2 cluster 评估
+ */
+export function isTrivialDominated(content, threshold = 0.6) {
+    const tokens = tokenizeForTrivial(content);
+    if (tokens.length === 0)
+        return false;
+    const trivialCount = tokens.filter((t) => TRIVIAL_WORDS.has(t.toLowerCase())).length;
+    return trivialCount / tokens.length > threshold;
+}
+/** 把消息切成可统计的 token(CJK 按 bigram,其他按空白分) */
+function tokenizeForTrivial(text) {
+    const tokens = [];
+    for (const word of text.split(/\s+/).filter(Boolean)) {
+        if (CJK_RUN.test(word)) {
+            if (word.length === 1) {
+                tokens.push(word);
+                continue;
+            }
+            for (let i = 0; i + 1 < word.length; i++) {
+                tokens.push(word.slice(i, i + 2));
+            }
+        }
+        else {
+            tokens.push(word);
+        }
+    }
+    return tokens;
+}
+/**
+ * Layer 1 预过滤单条消息
+ *
+ * @param content 消息原文
+ * @param role 消息角色(user/assistant/system)
+ * @returns accepted=true 通过;accepted=false 时 rule/reason 标明拒绝原因
+ */
+export function prefilterMessage(content, role) {
+    if (role === "system") {
+        return {
+            accepted: false,
+            rule: "system_role",
+            reason: "system role not observed",
+        };
+    }
+    const trimmed = content.trim();
+    if (trimmed.length === 0) {
+        return { accepted: false, rule: "empty", reason: "empty content" };
+    }
+    // 长度:对 user 收紧(30+),对 assistant 放宽(15+,允许简短确认)
+    const minLen = role === "user" ? 30 : 15;
+    if (trimmed.length < minLen) {
+        return {
+            accepted: false,
+            rule: "too_short",
+            reason: `${trimmed.length} < ${minLen} chars`,
+        };
+    }
+    // Trivial 占比(参考 flexmem looksLikeTrivialContent)
+    if (isTrivialDominated(trimmed)) {
+        return {
+            accepted: false,
+            rule: "trivial_pattern",
+            reason: "trivial/test content dominated",
+        };
+    }
+    // 仅标点
+    if (ONLY_PUNCT_RE.test(trimmed)) {
+        return {
+            accepted: false,
+            rule: "only_punct",
+            reason: "only punctuation/symbols",
+        };
+    }
+    // 信息密度:去停用词后有效 token 数
+    const meaningful = countMeaningfulTokens(trimmed);
+    if (meaningful < 4) {
+        return {
+            accepted: false,
+            rule: "low_density",
+            reason: `only ${meaningful} meaningful tokens`,
+        };
+    }
+    return { accepted: true };
+}
+/**
+ * 计算去停用词后的有效 token 数
+ *
+ * 复用 proposal-engine 的 normalize 思路,但内联以避免循环依赖
+ */
+function countMeaningfulTokens(text) {
+    const normalized = text.toLowerCase().replace(/[^\p{L}\p{N}\s]/gu, " ");
+    const tokens = normalized
+        .split(/\s+/)
+        .filter((t) => t.length >= 2 && !STOP_WORDS.has(t));
+    // CJK 段按 bigram 切分,每个 bigram 算一个有效 token
+    let count = 0;
+    for (const tok of tokens) {
+        if (CJK_RUN.test(tok)) {
+            count += Math.max(1, tok.length - 1);
+        }
+        else {
+            count += 1;
+        }
+    }
+    return count;
+}
+const STOP_WORDS = new Set([
+    "the",
+    "a",
+    "an",
+    "and",
+    "or",
+    "but",
+    "is",
+    "are",
+    "was",
+    "were",
+    "be",
+    "been",
+    "being",
+    "have",
+    "has",
+    "had",
+    "do",
+    "does",
+    "did",
+    "will",
+    "would",
+    "could",
+    "should",
+    "may",
+    "might",
+    "must",
+    "shall",
+    "of",
+    "in",
+    "on",
+    "at",
+    "to",
+    "for",
+    "with",
+    "by",
+    "from",
+    "as",
+    "i",
+    "me",
+    "my",
+    "we",
+    "us",
+    "our",
+    "you",
+    "your",
+    "he",
+    "him",
+    "his",
+    "she",
+    "her",
+    "it",
+    "its",
+    "they",
+    "them",
+    "their",
+    "this",
+    "that",
+    "的",
+    "了",
+    "是",
+    "在",
+    "和",
+    "与",
+    "或",
+    "但",
+    "可以",
+    "应该",
+    "需要",
+    "我",
+    "你",
+    "他",
+    "她",
+    "它",
+    "我们",
+    "你们",
+    "他们",
+    "这",
+    "那",
+]);
+const CJK_RUN = /[㐀-鿿豈-﫿぀-ヿ가-힯]/;
+// ============================================================
+// Layer 2 默认实现:RuleBasedNecessityEvaluator
+// ============================================================
+/**
+ * 规则版必要性评估器
+ *
+ * 在 cluster 累积到 threshold 后,从 samples/occurrences 判断是否值得提案。
+ * 规则参考 flexmem `shouldSkipSummary`,适配 co-engram 单层 proposal 场景:
+ *   - rule:high_repetition     samples 内 uniqueRatio < 0.5(机械重复)
+ *   - rule:few_unique_samples  unique samples < 2(完全雷同)
+ *   - rule:too_short           平均长度 < 30 chars
+ *   - rule:low_density         平均有效 token < 5
+ *   - rule:trivial_dominated   70%+ samples 命中 trivial 词表
+ *
+ * 全部通过 → necessary=true,reason="通过 N 条规则检查"
+ */
+export class RuleBasedNecessityEvaluator {
+    async evaluate(input) {
+        const { samples, occurrences } = input;
+        if (samples.length === 0) {
+            return {
+                necessary: false,
+                rule: "no_samples",
+                reason: "No samples accumulated",
+            };
+        }
+        // 1. 完全雷同(只有 1 条独特样本,但 occurrences > 1)— 最严格的重复判断,先于 high_repetition
+        const normalizedSamples = samples.map((s) => s.trim().toLowerCase());
+        const uniqueSet = new Set(normalizedSamples);
+        if (uniqueSet.size < 2 && occurrences > 1) {
+            return {
+                necessary: false,
+                rule: "few_unique_samples",
+                reason: "All samples are identical — likely automated retry or paste",
+            };
+        }
+        // 2. 重复率(机械复制粘贴检测)
+        const uniqueRatio = uniqueSet.size / samples.length;
+        if (uniqueRatio < 0.5) {
+            return {
+                necessary: false,
+                rule: "high_repetition",
+                reason: `Mechanical repetition: ${uniqueSet.size}/${samples.length} unique samples (ratio ${uniqueRatio.toFixed(2)} < 0.5)`,
+            };
+        }
+        // 3. 平均长度
+        const avgLen = samples.reduce((s, x) => s + x.length, 0) / samples.length;
+        if (avgLen < 30) {
+            return {
+                necessary: false,
+                rule: "too_short",
+                reason: `Samples too short: avg ${avgLen.toFixed(0)} chars < 30`,
+            };
+        }
+        // 4. 平均信息密度
+        const avgTokens = samples.reduce((s, x) => s + countMeaningfulTokens(x), 0) /
+            samples.length;
+        if (avgTokens < 5) {
+            return {
+                necessary: false,
+                rule: "low_density",
+                reason: `Low information density: avg ${avgTokens.toFixed(1)} meaningful tokens < 5`,
+            };
+        }
+        // 5. trivial 占比
+        const trivialCount = samples.filter((s) => isTrivialDominated(s)).length;
+        if (trivialCount / samples.length > 0.7) {
+            return {
+                necessary: false,
+                rule: "trivial_dominated",
+                reason: `${trivialCount}/${samples.length} samples are trivial/test content`,
+            };
+        }
+        return {
+            necessary: true,
+            reason: `Passed 5 rule checks: ${uniqueSet.size} unique samples, avg ${avgLen.toFixed(0)} chars, ${avgTokens.toFixed(1)} tokens`,
+        };
+    }
+}
+// ============================================================
+// Layer 2 LLM 实现:LlmNecessityEvaluator
+// ============================================================
+const LLM_NECESSITY_PROMPT = `You are evaluating whether a recurring conversation topic is worth saving as a long-term team memory.
+
+A "team memory" should capture reusable decisions, preferences, design rationale, debugging lessons, or patterns that will be relevant to future conversations. It is NOT for one-off questions, transient status updates, or content that can be derived from the code.
+
+Below are ${"<SAMPLE_COUNT>"} samples (out of ${"<OCCURRENCES>"} total occurrences) of a recurring topic that the proposal engine has clustered together:
+
+${"<SAMPLES_BLOCK>"}
+
+Evaluate whether this topic should be promoted to a team memory. Return STRICT JSON only (no markdown, no prose) with this shape:
+
+{
+  "necessary": true | false,
+  "reason": "<one sentence explaining why>",
+  "suggestedTitle": "<if necessary, a concise 4-10 word title; else empty string>"
+}
+
+ STRICT criteria — necessary=true only if ALL three hold:
+  1. Repeatable: this topic will recur across future conversations (not a one-off task)
+  2. Transferable: the resolution/preference would be useful to other team members or future sessions
+  3. Technical depth: contains non-trivial decisions, configurations, lessons, or rationale
+
+ EXCLUDE (necessary=false):
+  - Status reports / progress updates ("done with X", "50% complete")
+  - Mechanical retries of the same question
+  - Code/output pastes without decision context
+  - Trivial confirmations ("ok", "thanks", "got it")
+  - One-off personal tasks with no team relevance
+  - Pure factual Q&A already answerable from docs
+  - Content already covered by existing memory titles: ${"<EXISTING_TITLES>"}`;
+/**
+ * LLM 版必要性评估器
+ *
+ * host 注入 LlmClient,core 不绑定 provider。
+ * LLM 失败时 fallback 到 RuleBasedNecessityEvaluator,保证可用性。
+ */
+export class LlmNecessityEvaluator {
+    client;
+    fallback;
+    constructor(client) {
+        this.client = client;
+        this.fallback = new RuleBasedNecessityEvaluator();
+    }
+    async evaluate(input) {
+        const samplesBlock = input.samples
+            .map((s, i) => `[${i + 1}] ${s}`)
+            .join("\n");
+        const existingTitles = input.existingTitles.length > 0
+            ? input.existingTitles.slice(0, 20).join(" | ")
+            : "(none)";
+        const prompt = LLM_NECESSITY_PROMPT.replace("<SAMPLE_COUNT>", String(input.samples.length))
+            .replace("<OCCURRENCES>", String(input.occurrences))
+            .replace("<SAMPLES_BLOCK>", samplesBlock)
+            .replace("<EXISTING_TITLES>", existingTitles);
+        let raw;
+        try {
+            // maxTokens=1500 留足 reasoning 模型预算
+            // reasoning 模型(Qwen3 / DeepSeek-R1 / DeepSeek-V4 / GLM-5.2 / Claude w/ thinking)
+            // 会先输出 reasoning_content 再输出 content,300 tokens 不够会在思考阶段就截断
+            raw = await this.client.complete(prompt, {
+                maxTokens: 1500,
+                temperature: 0.1,
+                timeoutMs: 30_000,
+            });
+        }
+        catch {
+            // LLM 调用失败 → fallback 到规则
+            const verdict = await this.fallback.evaluate(input);
+            return {
+                ...verdict,
+                reason: `[llm-unavailable, rule-fallback] ${verdict.reason}`,
+            };
+        }
+        const parsed = parseLlmVerdict(raw);
+        if (!parsed) {
+            // LLM 返回非 JSON → fallback 到规则
+            const verdict = await this.fallback.evaluate(input);
+            return {
+                ...verdict,
+                reason: `[llm-parse-failed, rule-fallback] ${verdict.reason}`,
+            };
+        }
+        return parsed;
+    }
+}
+/**
+ * 解析 LLM 返回的 JSON
+ *
+ * 容忍常见的不规范输出:前后带 markdown fence / 多余空白 / 嵌套在别的字段里
+ */
+function parseLlmVerdict(raw) {
+    let text = raw.trim();
+    // 剥 markdown fence
+    const fenceMatch = text.match(/```(?:json)?\s*([\s\S]*?)```/);
+    if (fenceMatch) {
+        text = fenceMatch[1].trim();
+    }
+    // 抽取最外层 { ... }
+    const start = text.indexOf("{");
+    const end = text.lastIndexOf("}");
+    if (start === -1 || end === -1 || end <= start)
+        return null;
+    const jsonStr = text.slice(start, end + 1);
+    let obj;
+    try {
+        obj = JSON.parse(jsonStr);
+    }
+    catch {
+        return null;
+    }
+    const necessary = obj.necessary === true;
+    const reason = typeof obj.reason === "string" && obj.reason.trim().length > 0
+        ? obj.reason.trim()
+        : necessary
+            ? "LLM approved"
+            : "LLM rejected";
+    const suggestedTitle = typeof obj.suggestedTitle === "string" &&
+        obj.suggestedTitle.trim().length > 0
+        ? obj.suggestedTitle.trim().slice(0, 200)
+        : undefined;
+    return { necessary, reason, suggestedTitle };
+}
+//# sourceMappingURL=necessity-evaluator.js.map

package/dist/observability/necessity-evaluator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"necessity-evaluator.js","sourceRoot":"","sources":["../../src/observability/necessity-evaluator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAkEH,+DAA+D;AAC/D,kCAAkC;AAClC,+DAA+D;AAE/D;;;;;;;;;;;;GAYG;AACH,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC5B,KAAK;IACL,MAAM;IACN,SAAS;IACT,OAAO;IACP,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,IAAI;IACJ,MAAM;IACN,MAAM;IACN,MAAM;IACN,QAAQ;IACR,OAAO;IACP,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,UAAU;IACV,IAAI;IACJ,MAAM;IACN,MAAM;IACN,SAAS;IACT,KAAK;IACL,MAAM;IACN,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,cAAc;IACd,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,IAAI;IACJ,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;CACL,CAAC,CAAC;AAEH,aAAa;AACb,MAAM,aAAa,GAAG,oBAAoB,CAAC;AAS3C;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAe,EAAE,SAAS,GAAG,GAAG;IACjE,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACvC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CACnC,CAAC,MAAM,CAAC;IACT,OAAO,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC;AAClD,CAAC;AAED,2CAA2C;AAC3C,SAAS,kBAAkB,CAAC,IAAY;IACtC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACrD,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,OAAe,EACf,IAAqC;IAErC,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,aAAa;YACnB,MAAM,EAAE,0BAA0B;SACnC,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IACrE,CAAC;IAED,+CAA+C;IAC/C,MAAM,MAAM,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACzC,IAAI,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;QAC5B,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,WAAW;YACjB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,MAAM,MAAM,QAAQ;SAC9C,CAAC;IACJ,CAAC;IAED,iDAAiD;IACjD,IAAI,kBAAkB,CAAC,OAAO,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,iBAAiB;YACvB,MAAM,EAAE,gCAAgC;SACzC,CAAC;IACJ,CAAC;IAED,MAAM;IACN,IAAI,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,0BAA0B;SACnC,CAAC;IACJ,CAAC;IAED,uBAAuB;IACvB,MAAM,UAAU,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;IAClD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,aAAa;YACnB,MAAM,EAAE,QAAQ,UAAU,oBAAoB;SAC/C,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,IAAY;IACzC,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC;IACxE,MAAM,MAAM,GAAG,UAAU;SACtB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,yCAAyC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK;IACL,GAAG;IACH,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,KAAK;IACL,OAAO;IACP,MAAM;IACN,OAAO;IACP,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,GAAG;IACH,GAAG;CACJ,CAAC,CAAC;AAEH,MAAM,OAAO,GAAG,gBAAgB,CAAC;AAEjC,+DAA+D;AAC/D,2CAA2C;AAC3C,+DAA+D;AAE/D;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,2BAA2B;IACtC,KAAK,CAAC,QAAQ,CAAC,KAAqB;QAClC,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;QAEvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO;gBACL,SAAS,EAAE,KAAK;gBAChB,IAAI,EAAE,YAAY;gBAClB,MAAM,EAAE,wBAAwB;aACjC,CAAC;QACJ,CAAC;QAED,qEAAqE;QACrE,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;QACrE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,CAAC;QAC7C,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YAC1C,OAAO;gBACL,SAAS,EAAE,KAAK;gBAChB,IAAI,EAAE,oBAAoB;gBAC1B,MAAM,EAAE,6DAA6D;aACtE,CAAC;QACJ,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC;QACpD,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;YACtB,OAAO;gBACL,SAAS,EAAE,KAAK;gBAChB,IAAI,EAAE,iBAAiB;gBACvB,MAAM,EAAE,0BAA0B,SAAS,CAAC,IAAI,IAAI,OAAO,CAAC,MAAM,0BAA0B,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;aAC5H,CAAC;QACJ,CAAC;QAED,UAAU;QACV,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QAC1E,IAAI,MAAM,GAAG,EAAE,EAAE,CAAC;YAChB,OAAO;gBACL,SAAS,EAAE,KAAK;gBAChB,IAAI,EAAE,WAAW;gBACjB,MAAM,EAAE,0BAA0B,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa;aACjE,CAAC;QACJ,CAAC;QAED,YAAY;QACZ,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzD,OAAO,CAAC,MAAM,CAAC;QACjB,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,OAAO;gBACL,SAAS,EAAE,KAAK;gBAChB,IAAI,EAAE,aAAa;gBACnB,MAAM,EAAE,gCAAgC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,wBAAwB;aACrF,CAAC;QACJ,CAAC;QAED,gBAAgB;QAChB,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACzE,IAAI,YAAY,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACxC,OAAO;gBACL,SAAS,EAAE,KAAK;gBAChB,IAAI,EAAE,mBAAmB;gBACzB,MAAM,EAAE,GAAG,YAAY,IAAI,OAAO,CAAC,MAAM,mCAAmC;aAC7E,CAAC;QACJ,CAAC;QAED,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,yBAAyB,SAAS,CAAC,IAAI,wBAAwB,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;SACjI,CAAC;IACJ,CAAC;CACF;AAED,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;AAE/D,MAAM,oBAAoB,GAAG;;;;YAIjB,gBAAgB,oBAAoB,eAAe;;EAE7D,iBAAiB;;;;;;;;;;;;;;;;;;;;;;yDAsBsC,mBAAmB,EAAE,CAAC;AAE/E;;;;;GAKG;AACH,MAAM,OAAO,qBAAqB;IAGH;IAFZ,QAAQ,CAA8B;IAEvD,YAA6B,MAAiB;QAAjB,WAAM,GAAN,MAAM,CAAW;QAC5C,IAAI,CAAC,QAAQ,GAAG,IAAI,2BAA2B,EAAE,CAAC;IACpD,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAqB;QAClC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO;aAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;aAChC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,MAAM,cAAc,GAClB,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;YAC7B,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC/C,CAAC,CAAC,QAAQ,CAAC;QAEf,MAAM,MAAM,GAAG,oBAAoB,CAAC,OAAO,CACzC,gBAAgB,EAChB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAC7B;aACE,OAAO,CAAC,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;aACnD,OAAO,CAAC,iBAAiB,EAAE,YAAY,CAAC;aACxC,OAAO,CAAC,mBAAmB,EAAE,cAAc,CAAC,CAAC;QAEhD,IAAI,GAAW,CAAC;QAChB,IAAI,CAAC;YACH,mCAAmC;YACnC,iFAAiF;YACjF,4DAA4D;YAC5D,GAAG,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACvC,SAAS,EAAE,IAAI;gBACf,WAAW,EAAE,GAAG;gBAChB,SAAS,EAAE,MAAM;aAClB,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;YAC1B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACpD,OAAO;gBACL,GAAG,OAAO;gBACV,MAAM,EAAE,oCAAoC,OAAO,CAAC,MAAM,EAAE;aAC7D,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,8BAA8B;YAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACpD,OAAO;gBACL,GAAG,OAAO;gBACV,MAAM,EAAE,qCAAqC,OAAO,CAAC,MAAM,EAAE;aAC9D,CAAC;QACJ,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,GAAW;IAClC,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAEtB,mBAAmB;IACnB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAC9D,IAAI,UAAU,EAAE,CAAC;QACf,IAAI,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;IAC/B,CAAC;IAED,gBAAgB;IAChB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK;QAAE,OAAO,IAAI,CAAC;IAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAE3C,IAAI,GAAwE,CAAC;IAC7E,IAAI,CAAC;QACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,KAAK,IAAI,CAAC;IACzC,MAAM,MAAM,GACV,OAAO,GAAG,CAAC,MAAM,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAC5D,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;QACnB,CAAC,CAAC,SAAS;YACT,CAAC,CAAC,cAAc;YAChB,CAAC,CAAC,cAAc,CAAC;IACvB,MAAM,cAAc,GAClB,OAAO,GAAG,CAAC,cAAc,KAAK,QAAQ;QACtC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAClC,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QACzC,CAAC,CAAC,SAAS,CAAC;IAEhB,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;AAC/C,CAAC"}