spectra-cli 4.1.1 → 4.2.0

package/dist/knowledge-graph/query-helpers.d.ts

@@ -0,0 +1,164 @@
+/**
+ * Feature 155 — Agent-Context MCP Tools 的查询基建。
+ *
+ * 暴露给 src/mcp/agent-context-tools.ts 的工具函数：
+ *   - bfsTraverse：反向 / 正向 BFS，遍历前 budget 截断（FR-012）
+ *   - canonicalizeSymbolId：把用户传入的 symbol id 归一到 graph 实际 id
+ *   - findFuzzyMatches：symbol-not-found 时返回最多 N 个候选
+ *   - computeRiskTier：按 directCallers + transitive 判定 low / medium / high
+ *   - getReverseAdjacency：反向邻接表 lazy 构建 + LRU 缓存
+ *
+ * 输入合同：
+ *   query-helpers 直接消费 GraphJSON `{nodes, links}`（与 graph.json 序列化形态一致），
+ *   不依赖 UnifiedGraph in-memory 类型，避免与 build-time 路径耦合。
+ *
+ * 不变量：
+ *   - 所有函数对 graphData 只读（禁止修改 nodes / links / metadata）
+ *   - confidence 数值直接读 link.confidenceScore；缺失时尝试 link.confidence
+ *     通过 CONFIDENCE_SCORES 映射；仍失败 → 跳过该边并记 'missing-confidence-score' warning
+ *   - canonicalize 控制字符 / 非 UTF-8 → 返回 null（调用方按 invalid-symbol-id 处理）
+ *   - reverse adjacency cache key = `${graphPath}::${mtimeMs}::${sizeBytes}::${linksLength}::${relations}`
+ *     graph.json 重生成（mtime/size 必变）→ 自动 evict
+ */
+import type { GraphJSON, GraphEdge, GraphNode } from '../panoramic/graph/graph-types.js';
+/** BFS 方向语义 */
+export type BfsDirection = 'upstream' | 'downstream' | 'both';
+/** BFS 遍历输入选项 */
+export interface BfsTraverseOptions {
+    /** 遍历深度上限，0 表示不展开（仅返回 start node 自身的可达邻居计数为 0） */
+    depth: number;
+    /** 数值置信度阈值（0..1），按 link.confidenceScore >= minConfidence 过滤 */
+    minConfidence: number;
+    /** BFS 方向 */
+    direction: BfsDirection;
+    /** 输出节点上限（不含 start node），遍历前严格截断 */
+    budget: number;
+    /** 多 startId 共享 visited Set（detect_changes 跨 changedSymbol 共享），可选 */
+    sharedVisited?: Set<string>;
+    /** 用作 reverse adjacency cache key 的一部分 */
+    graphPath: string;
+    /** 用作 reverse adjacency cache key 的一部分（graph.json mtime） */
+    graphMtimeMs: number;
+    /** 用作 reverse adjacency cache key 的一部分（graph.json 字节数） */
+    graphSizeBytes: number;
+    /** 仅遍历指定 relation 的边（default ['calls']） */
+    relations?: ReadonlyArray<string>;
+}
+/** BFS 输出条目 */
+export interface BfsAffected {
+    id: string;
+    depth: number;
+    confidence: number;
+    reason: string;
+    /** 从 start 到 self 的 ancestor 链（含 self），可选用于自动化测试 */
+    path: string[];
+}
+/** BFS 输出 */
+export interface BfsTraverseResult {
+    affected: BfsAffected[];
+    warnings: string[];
+}
+/** 反向邻接表项 */
+interface ReverseAdjEntry {
+    sourceId: string;
+    edge: GraphEdge;
+}
+/** 反向邻接表（target id → 进入此节点的 inbound 边列表） */
+export type ReverseAdj = Map<string, ReverseAdjEntry[]>;
+/** baseRef / symbol id 不可见字符快速校验 */
+/**
+ * 解析一条边的 confidence 数值。
+ *
+ * 优先级：edge.confidenceScore（已含数字）→ edge.confidence 走 CONFIDENCE_SCORES 映射 → null。
+ *
+ * 返回 null 表示"无法判定 confidence"，调用方应跳过该边并记 warning。
+ */
+export declare function resolveEdgeConfidence(edge: GraphEdge): number | null;
+/**
+ * 把用户输入的 target / symbolId 归一到 graph 实际 id。
+ *
+ * 归一规则（按顺序尝试，命中即返回）：
+ *   1. graph.nodes 中存在字面相等的 id → 直接返回
+ *   2. 把 `./prefix` `a/` `b/` 等前缀剥掉 → 再查
+ *   3. 三段输入 `A::B::C` 容错为 `A::B.C` → 再查（Codex round-1 C-1 修订）
+ *   4. 把绝对路径 → 仓库相对路径（按 graphData.graph?.metadata 或 projectRoot 选项）→ 再查
+ *
+ * 失败返回 null，调用方按 symbol-not-found 处理（建议同时调 findFuzzyMatches 提候选）。
+ *
+ * 控制字符 / 非 UTF-8 / 空字符串段输入返回 null（调用方按 invalid-symbol-id 处理）。
+ */
+export declare function canonicalizeSymbolId(rawTarget: string, graphData: Readonly<GraphJSON>, options?: {
+    projectRoot?: string;
+}): {
+    canonicalId: string | null;
+    reason: 'ok' | 'not-found' | 'invalid';
+};
+/**
+ * 当 symbolId 找不到时，返回最多 limit 个相似候选。
+ *
+ * 算法（轻量、无外部依赖）：
+ *   - 把 query 拆 token（按 `::` `/` `.` `-` `_` 拆分，过滤空 token）
+ *   - 给每个 graph node id 打分：
+ *       * 命中 token 数 +1 / token
+ *       * id 含 query 子串 +0.5
+ *   - 按分数降序，取前 limit 个 id
+ *
+ * 不实现 Levenshtein（避免引入新依赖）；substring + token 命中已足够给 LLM agent
+ * 第二次正确输入的提示。
+ */
+export declare function findFuzzyMatches(graphData: Readonly<GraphJSON>, queryId: string, limit: number): string[];
+/**
+ * 按 directCallers + transitive 节点数判定 risk tier。
+ *
+ * 阈值（spec FR-014）：
+ *   - directCallers ≥ 10 或 transitive ≥ 50 → high
+ *   - directCallers ≥ 3  或 transitive ≥ 15 → medium
+ *   - 其余 → low
+ */
+export declare function computeRiskTier(directCallers: number, transitive: number): 'low' | 'medium' | 'high';
+/**
+ * 获取（或构建）反向邻接表。
+ *
+ * direction 决定邻接方向：
+ *   - upstream：target → 进入此节点的 inbound 边（callers）
+ *   - downstream：source → 离开此节点的 outbound 边（callees）
+ *   - both：合并 inbound + outbound
+ *
+ * 仅保留 relation 在 relations 集合内的边；其他 relation 的边不进入邻接表。
+ */
+export declare function getReverseAdjacency(graphData: Readonly<GraphJSON>, graphPath: string, mtimeMs: number, sizeBytes: number, relations: ReadonlyArray<string>, direction: BfsDirection): ReverseAdj;
+/** 测试 / debug 用：清空 reverse adjacency cache */
+export declare function clearReverseAdjacencyCache(): void;
+/**
+ * 从 startId 出发做 BFS，返回受影响的节点列表。
+ *
+ * 关键合同（FR-012）：
+ *   - budget 在**遍历前**应用：每次准备 enqueue 一个新节点之前，检查
+ *     `affected.length + 1 > effectiveBudget`，超即停止入队并 push 'budget-truncated' warning
+ *   - start node 不计入 budget；budget 仅约束 affected 数量
+ *   - depth 是边数：depth=2 含 direct caller (depth=1) + 二级 caller (depth=2)
+ *   - confidence 缺失：跳过 + 记 'missing-confidence-score' warning（不当作 0 静默通过）
+ *   - sharedVisited 跨调用共享：detect_changes 多 changedSymbol 用同一 globalVisited
+ *     去重，让 affected 不重复计入同一节点
+ *
+ * 返回的 warnings 是去重的：同一类 warning 多次触发只 push 一次。
+ */
+export declare function bfsTraverse(graphData: Readonly<GraphJSON>, startId: string, options: BfsTraverseOptions): BfsTraverseResult;
+/**
+ * 取节点的 module file 部分。
+ *
+ * 兼容两种分隔符（同一个 graph 内可能并存）：
+ *   - Feature 151 新格式：`<file>::<symbolName>` 例 `micrograd/engine.py::Value.__add__`
+ *   - 旧 panoramic 格式：`<file>#<symbolName>` 例 `micrograd/engine.py#Value`
+ *
+ * 模块节点本身（id 既不含 `::` 也不含 `#`）→ 返回 id 自身。
+ * 取最早出现的分隔符位置作为 cut 点。
+ */
+export declare function moduleFileFromId(nodeId: string): string;
+/**
+ * 在 graph 中找指定 node 的 GraphNode 对象。
+ * O(n) — 仅小规模 graph 使用，调用频率不高（仅 context handler 的 definition 字段）。
+ */
+export declare function findNode(graphData: Readonly<GraphJSON>, id: string): GraphNode | null;
+export {};
+//# sourceMappingURL=query-helpers.d.ts.map

package/dist/knowledge-graph/query-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-helpers.d.ts","sourceRoot":"","sources":["../../src/knowledge-graph/query-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAGH,OAAO,KAAK,EACV,SAAS,EACT,SAAS,EACT,SAAS,EAEV,MAAM,mCAAmC,CAAC;AAO3C,eAAe;AACf,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,YAAY,GAAG,MAAM,CAAC;AAE9D,iBAAiB;AACjB,MAAM,WAAW,kBAAkB;IACjC,kDAAkD;IAClD,KAAK,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa;IACb,SAAS,EAAE,YAAY,CAAC;IACxB,oCAAoC;IACpC,MAAM,EAAE,MAAM,CAAC;IACf,qEAAqE;IACrE,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC5B,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAC;IAClB,4DAA4D;IAC5D,YAAY,EAAE,MAAM,CAAC;IACrB,0DAA0D;IAC1D,cAAc,EAAE,MAAM,CAAC;IACvB,2CAA2C;IAC3C,SAAS,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CACnC;AAED,eAAe;AACf,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,oDAAoD;IACpD,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED,aAAa;AACb,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,aAAa;AACb,UAAU,eAAe;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,SAAS,CAAC;CACjB;AAED,4CAA4C;AAC5C,MAAM,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC;AAWxD,oCAAoC;AAOpC;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,IAAI,CASpE;AAMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC9B,OAAO,GAAE;IAAE,WAAW,CAAC,EAAE,MAAM,CAAA;CAAO,GACrC;IAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,MAAM,EAAE,IAAI,GAAG,WAAW,GAAG,SAAS,CAAA;CAAE,CAgExE;AAaD;;;;;;;;;;;;GAYG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC9B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,GACZ,MAAM,EAAE,CAuBV;AAMD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,GACjB,KAAK,GAAG,QAAQ,GAAG,MAAM,CAI3B;AA2BD;;;;;;;;;GASG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC9B,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,aAAa,CAAC,MAAM,CAAC,EAChC,SAAS,EAAE,YAAY,GACtB,UAAU,CAiCZ;AAED,8CAA8C;AAC9C,wBAAgB,0BAA0B,IAAI,IAAI,CAEjD;AAMD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CACzB,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC9B,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,kBAAkB,GAC1B,iBAAiB,CA2FnB;AAkBD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAOvD;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CACtB,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC9B,EAAE,EAAE,MAAM,GACT,SAAS,GAAG,IAAI,CAKlB"}

package/dist/knowledge-graph/query-helpers.js

@@ -0,0 +1,394 @@
+/**
+ * Feature 155 — Agent-Context MCP Tools 的查询基建。
+ *
+ * 暴露给 src/mcp/agent-context-tools.ts 的工具函数：
+ *   - bfsTraverse：反向 / 正向 BFS，遍历前 budget 截断（FR-012）
+ *   - canonicalizeSymbolId：把用户传入的 symbol id 归一到 graph 实际 id
+ *   - findFuzzyMatches：symbol-not-found 时返回最多 N 个候选
+ *   - computeRiskTier：按 directCallers + transitive 判定 low / medium / high
+ *   - getReverseAdjacency：反向邻接表 lazy 构建 + LRU 缓存
+ *
+ * 输入合同：
+ *   query-helpers 直接消费 GraphJSON `{nodes, links}`（与 graph.json 序列化形态一致），
+ *   不依赖 UnifiedGraph in-memory 类型，避免与 build-time 路径耦合。
+ *
+ * 不变量：
+ *   - 所有函数对 graphData 只读（禁止修改 nodes / links / metadata）
+ *   - confidence 数值直接读 link.confidenceScore；缺失时尝试 link.confidence
+ *     通过 CONFIDENCE_SCORES 映射；仍失败 → 跳过该边并记 'missing-confidence-score' warning
+ *   - canonicalize 控制字符 / 非 UTF-8 → 返回 null（调用方按 invalid-symbol-id 处理）
+ *   - reverse adjacency cache key = `${graphPath}::${mtimeMs}::${sizeBytes}::${linksLength}::${relations}`
+ *     graph.json 重生成（mtime/size 必变）→ 自动 evict
+ */
+import path from 'node:path';
+import { CONFIDENCE_SCORES } from '../panoramic/graph/confidence-mapper.js';
+// ============================================================
+// 常量
+// ============================================================
+const DEFAULT_RELATIONS = ['calls'];
+/** 控制字符正则（包含 \x00-\x1f, \x7f；保留制表符不在内是因为 git diff 路径不会含 \t） */
+const CONTROL_CHAR_RE = /[\x00-\x1f\x7f]/;
+/** baseRef / symbol id 不可见字符快速校验 */
+// NON_PRINTABLE_RE removed - CONTROL_CHAR_RE is sufficient
+// ============================================================
+// confidence 数值解析
+// ============================================================
+/**
+ * 解析一条边的 confidence 数值。
+ *
+ * 优先级：edge.confidenceScore（已含数字）→ edge.confidence 走 CONFIDENCE_SCORES 映射 → null。
+ *
+ * 返回 null 表示"无法判定 confidence"，调用方应跳过该边并记 warning。
+ */
+export function resolveEdgeConfidence(edge) {
+    if (typeof edge.confidenceScore === 'number' && Number.isFinite(edge.confidenceScore)) {
+        return edge.confidenceScore;
+    }
+    const tier = edge.confidence;
+    if (tier !== undefined && tier in CONFIDENCE_SCORES) {
+        return CONFIDENCE_SCORES[tier];
+    }
+    return null;
+}
+// ============================================================
+// canonicalize symbol id
+// ============================================================
+/**
+ * 把用户输入的 target / symbolId 归一到 graph 实际 id。
+ *
+ * 归一规则（按顺序尝试，命中即返回）：
+ *   1. graph.nodes 中存在字面相等的 id → 直接返回
+ *   2. 把 `./prefix` `a/` `b/` 等前缀剥掉 → 再查
+ *   3. 三段输入 `A::B::C` 容错为 `A::B.C` → 再查（Codex round-1 C-1 修订）
+ *   4. 把绝对路径 → 仓库相对路径（按 graphData.graph?.metadata 或 projectRoot 选项）→ 再查
+ *
+ * 失败返回 null，调用方按 symbol-not-found 处理（建议同时调 findFuzzyMatches 提候选）。
+ *
+ * 控制字符 / 非 UTF-8 / 空字符串段输入返回 null（调用方按 invalid-symbol-id 处理）。
+ */
+export function canonicalizeSymbolId(rawTarget, graphData, options = {}) {
+    if (typeof rawTarget !== 'string') {
+        return { canonicalId: null, reason: 'invalid' };
+    }
+    // 入口先 NFC normalize + trim，避免空白 / unicode 表示差异让用户输入被误判
+    const normalized = rawTarget.normalize('NFC').trim();
+    if (normalized.length === 0) {
+        return { canonicalId: null, reason: 'invalid' };
+    }
+    if (CONTROL_CHAR_RE.test(normalized)) {
+        return { canonicalId: null, reason: 'invalid' };
+    }
+    // 拒绝多 `::` 或空段
+    const segs = normalized.split('::');
+    if (segs.some((s) => s.length === 0)) {
+        return { canonicalId: null, reason: 'invalid' };
+    }
+    // 直接命中
+    if (hasNode(graphData, normalized)) {
+        return { canonicalId: normalized, reason: 'ok' };
+    }
+    const candidates = [];
+    // 剥前缀：./ a/ b/
+    const stripped = normalized
+        .replace(/^\.\//, '')
+        .replace(/^a\//, '')
+        .replace(/^b\//, '');
+    if (stripped !== normalized) {
+        candidates.push(stripped);
+    }
+    // 三段 → 两段（A::B::C → A::B.C）
+    if (segs.length >= 3) {
+        const merged = segs[0] + '::' + segs.slice(1).join('.');
+        candidates.push(merged);
+    }
+    // 绝对路径 → repo-relative（按 projectRoot 截断）
+    const projectRoot = options.projectRoot;
+    if (projectRoot && normalized.startsWith(projectRoot)) {
+        const relative = path.relative(projectRoot, normalized);
+        if (relative.length > 0) {
+            candidates.push(relative);
+        }
+    }
+    // repo-relative → 绝对路径（graph 实际可能用绝对 path 形态，例如 baseline 跑出的 graph.json）
+    if (projectRoot && !path.isAbsolute(normalized.split('::')[0] ?? '')) {
+        const filePart = normalized.split('::')[0] ?? '';
+        const symbolPart = normalized.includes('::') ? normalized.slice(filePart.length) : '';
+        const abs = path.join(projectRoot, filePart) + symbolPart;
+        candidates.push(abs);
+    }
+    for (const c of candidates) {
+        if (hasNode(graphData, c)) {
+            return { canonicalId: c, reason: 'ok' };
+        }
+    }
+    return { canonicalId: null, reason: 'not-found' };
+}
+function hasNode(graphData, id) {
+    for (const n of graphData.nodes) {
+        if (n.id === id)
+            return true;
+    }
+    return false;
+}
+// ============================================================
+// fuzzy match
+// ============================================================
+/**
+ * 当 symbolId 找不到时，返回最多 limit 个相似候选。
+ *
+ * 算法（轻量、无外部依赖）：
+ *   - 把 query 拆 token（按 `::` `/` `.` `-` `_` 拆分，过滤空 token）
+ *   - 给每个 graph node id 打分：
+ *       * 命中 token 数 +1 / token
+ *       * id 含 query 子串 +0.5
+ *   - 按分数降序，取前 limit 个 id
+ *
+ * 不实现 Levenshtein（避免引入新依赖）；substring + token 命中已足够给 LLM agent
+ * 第二次正确输入的提示。
+ */
+export function findFuzzyMatches(graphData, queryId, limit) {
+    if (limit <= 0 || queryId.length === 0)
+        return [];
+    const tokens = queryId
+        .toLowerCase()
+        .split(/[:/.\-_]+/)
+        .filter((t) => t.length > 0);
+    if (tokens.length === 0)
+        return [];
+    const lowerQuery = queryId.toLowerCase();
+    const scored = [];
+    for (const node of graphData.nodes) {
+        const lowerId = node.id.toLowerCase();
+        let score = 0;
+        for (const t of tokens) {
+            if (lowerId.includes(t))
+                score += 1;
+        }
+        if (lowerId.includes(lowerQuery))
+            score += 0.5;
+        if (score > 0) {
+            scored.push({ id: node.id, score });
+        }
+    }
+    scored.sort((a, b) => b.score - a.score);
+    return scored.slice(0, limit).map((x) => x.id);
+}
+// ============================================================
+// risk tier
+// ============================================================
+/**
+ * 按 directCallers + transitive 节点数判定 risk tier。
+ *
+ * 阈值（spec FR-014）：
+ *   - directCallers ≥ 10 或 transitive ≥ 50 → high
+ *   - directCallers ≥ 3  或 transitive ≥ 15 → medium
+ *   - 其余 → low
+ */
+export function computeRiskTier(directCallers, transitive) {
+    if (directCallers >= 10 || transitive >= 50)
+        return 'high';
+    if (directCallers >= 3 || transitive >= 15)
+        return 'medium';
+    return 'low';
+}
+// ============================================================
+// reverse adjacency cache（LRU ≤ 8）
+// ============================================================
+const ADJ_CACHE_LIMIT = 8;
+/**
+ * 反向邻接表 cache（按 graphPath + mtime + size + linksLength + relations 建 key）。
+ *
+ * 用 Map 实现 LRU：超过 LIMIT 时按插入顺序 evict 最早条目。同 key 命中时
+ * delete + set 把它放到最尾，模拟 "recently used"。
+ */
+const adjCache = new Map();
+function buildAdjKey(graphPath, mtimeMs, sizeBytes, linksLength, relations, direction) {
+    return `${graphPath}::${mtimeMs}::${sizeBytes}::${linksLength}::${relations.join(',')}::${direction}`;
+}
+/**
+ * 获取（或构建）反向邻接表。
+ *
+ * direction 决定邻接方向：
+ *   - upstream：target → 进入此节点的 inbound 边（callers）
+ *   - downstream：source → 离开此节点的 outbound 边（callees）
+ *   - both：合并 inbound + outbound
+ *
+ * 仅保留 relation 在 relations 集合内的边；其他 relation 的边不进入邻接表。
+ */
+export function getReverseAdjacency(graphData, graphPath, mtimeMs, sizeBytes, relations, direction) {
+    const key = buildAdjKey(graphPath, mtimeMs, sizeBytes, graphData.links.length, relations, direction);
+    const cached = adjCache.get(key);
+    if (cached !== undefined) {
+        // LRU：把命中的条目挪到最尾
+        adjCache.delete(key);
+        adjCache.set(key, cached);
+        return cached;
+    }
+    const adj = new Map();
+    const allowedRelations = new Set(relations);
+    for (const link of graphData.links) {
+        if (!allowedRelations.has(link.relation))
+            continue;
+        if (direction === 'upstream' || direction === 'both') {
+            // target ← source
+            const list = adj.get(link.target) ?? [];
+            list.push({ sourceId: link.source, edge: link });
+            adj.set(link.target, list);
+        }
+        if (direction === 'downstream' || direction === 'both') {
+            // source → target，但反向邻接表存储到 source 的 list 上以便 BFS 统一从 currentId 找下一跳
+            const list = adj.get(link.source) ?? [];
+            list.push({ sourceId: link.target, edge: link });
+            adj.set(link.source, list);
+        }
+    }
+    // 写入 cache，超 LIMIT 时 evict 最早
+    if (adjCache.size >= ADJ_CACHE_LIMIT) {
+        const oldestKey = adjCache.keys().next().value;
+        if (oldestKey !== undefined)
+            adjCache.delete(oldestKey);
+    }
+    adjCache.set(key, adj);
+    return adj;
+}
+/** 测试 / debug 用：清空 reverse adjacency cache */
+export function clearReverseAdjacencyCache() {
+    adjCache.clear();
+}
+// ============================================================
+// BFS traverse（核心）
+// ============================================================
+/**
+ * 从 startId 出发做 BFS，返回受影响的节点列表。
+ *
+ * 关键合同（FR-012）：
+ *   - budget 在**遍历前**应用：每次准备 enqueue 一个新节点之前，检查
+ *     `affected.length + 1 > effectiveBudget`，超即停止入队并 push 'budget-truncated' warning
+ *   - start node 不计入 budget；budget 仅约束 affected 数量
+ *   - depth 是边数：depth=2 含 direct caller (depth=1) + 二级 caller (depth=2)
+ *   - confidence 缺失：跳过 + 记 'missing-confidence-score' warning（不当作 0 静默通过）
+ *   - sharedVisited 跨调用共享：detect_changes 多 changedSymbol 用同一 globalVisited
+ *     去重，让 affected 不重复计入同一节点
+ *
+ * 返回的 warnings 是去重的：同一类 warning 多次触发只 push 一次。
+ */
+export function bfsTraverse(graphData, startId, options) {
+    const effectiveDepth = Math.max(0, Math.floor(options.depth));
+    const effectiveBudget = Math.max(0, Math.floor(options.budget));
+    const minConfidence = Math.max(0, Math.min(1, options.minConfidence));
+    const relations = options.relations && options.relations.length > 0 ? options.relations : DEFAULT_RELATIONS;
+    const warnings = new Set();
+    const affected = [];
+    if (effectiveDepth === 0) {
+        if (options.depth !== effectiveDepth)
+            warnings.add('depth-clamped');
+        return { affected, warnings: [...warnings] };
+    }
+    if (effectiveBudget === 0) {
+        return { affected, warnings: ['budget-zero'] };
+    }
+    const visited = options.sharedVisited ?? new Set();
+    visited.add(startId);
+    const adj = getReverseAdjacency(graphData, options.graphPath, options.graphMtimeMs, options.graphSizeBytes, relations, options.direction);
+    const queue = [{ id: startId, depth: 0, path: [startId] }];
+    let confidenceFiltered = 0;
+    let truncated = false;
+    // BFS 主循环
+    while (queue.length > 0) {
+        if (truncated)
+            break;
+        const cur = queue.shift();
+        if (cur.depth >= effectiveDepth)
+            continue;
+        const neighbors = adj.get(cur.id);
+        if (neighbors === undefined)
+            continue;
+        for (const ne of neighbors) {
+            if (truncated)
+                break;
+            const conf = resolveEdgeConfidence(ne.edge);
+            if (conf === null) {
+                warnings.add('missing-confidence-score');
+                continue;
+            }
+            if (conf < minConfidence) {
+                confidenceFiltered++;
+                continue;
+            }
+            if (visited.has(ne.sourceId))
+                continue;
+            // budget 遍历前截断（FR-012 关键合同）
+            if (affected.length + 1 > effectiveBudget) {
+                warnings.add('budget-truncated');
+                truncated = true;
+                break;
+            }
+            visited.add(ne.sourceId);
+            const nextDepth = cur.depth + 1;
+            const nextPath = [...cur.path, ne.sourceId];
+            const reason = buildReason(cur.id, ne.sourceId, ne.edge);
+            affected.push({
+                id: ne.sourceId,
+                depth: nextDepth,
+                confidence: conf,
+                reason,
+                path: nextPath,
+            });
+            // 只有还能继续展开（下一深度 < effectiveDepth）才入队
+            if (nextDepth < effectiveDepth) {
+                queue.push({ id: ne.sourceId, depth: nextDepth, path: nextPath });
+            }
+        }
+    }
+    if (affected.length === 0 && confidenceFiltered > 0) {
+        warnings.add('confidence-filtered-all');
+    }
+    if (options.depth !== effectiveDepth || options.budget !== effectiveBudget) {
+        warnings.add('input-clamped');
+    }
+    return { affected, warnings: [...warnings] };
+}
+function buildReason(fromId, toId, edge) {
+    const fromLabel = labelFromId(fromId);
+    const toLabel = labelFromId(toId);
+    return `${edge.relation} via ${fromLabel} ← ${toLabel}`;
+}
+function labelFromId(id) {
+    // 取 `file::Class.method` 中最右侧 segment 作为可读 label
+    const idx = id.lastIndexOf('::');
+    return idx >= 0 ? id.slice(idx + 2) : id;
+}
+// ============================================================
+// 节点 id → 节点 metadata 抽取（context tool 用）
+// ============================================================
+/**
+ * 取节点的 module file 部分。
+ *
+ * 兼容两种分隔符（同一个 graph 内可能并存）：
+ *   - Feature 151 新格式：`<file>::<symbolName>` 例 `micrograd/engine.py::Value.__add__`
+ *   - 旧 panoramic 格式：`<file>#<symbolName>` 例 `micrograd/engine.py#Value`
+ *
+ * 模块节点本身（id 既不含 `::` 也不含 `#`）→ 返回 id 自身。
+ * 取最早出现的分隔符位置作为 cut 点。
+ */
+export function moduleFileFromId(nodeId) {
+    const idxColon = nodeId.indexOf('::');
+    const idxHash = nodeId.indexOf('#');
+    const cuts = [idxColon, idxHash].filter((i) => i >= 0);
+    if (cuts.length === 0)
+        return nodeId;
+    const first = Math.min(...cuts);
+    return nodeId.slice(0, first);
+}
+/**
+ * 在 graph 中找指定 node 的 GraphNode 对象。
+ * O(n) — 仅小规模 graph 使用，调用频率不高（仅 context handler 的 definition 字段）。
+ */
+export function findNode(graphData, id) {
+    for (const n of graphData.nodes) {
+        if (n.id === id)
+            return n;
+    }
+    return null;
+}
+//# sourceMappingURL=query-helpers.js.map

package/dist/knowledge-graph/query-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-helpers.js","sourceRoot":"","sources":["../../src/knowledge-graph/query-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,IAAI,MAAM,WAAW,CAAC;AAO7B,OAAO,EAAE,iBAAiB,EAAE,MAAM,yCAAyC,CAAC;AAwD5E,+DAA+D;AAC/D,KAAK;AACL,+DAA+D;AAE/D,MAAM,iBAAiB,GAA0B,CAAC,OAAO,CAAC,CAAC;AAE3D,+DAA+D;AAC/D,MAAM,eAAe,GAAG,iBAAiB,CAAC;AAE1C,oCAAoC;AACpC,2DAA2D;AAE3D,+DAA+D;AAC/D,kBAAkB;AAClB,+DAA+D;AAE/D;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAe;IACnD,IAAI,OAAO,IAAI,CAAC,eAAe,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;QACtF,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAyC,CAAC;IAC5D,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,iBAAiB,EAAE,CAAC;QACpD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAE/D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAClC,SAAiB,EACjB,SAA8B,EAC9B,UAAoC,EAAE;IAEtC,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;QAClC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IACD,uDAAuD;IACvD,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACrD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IACD,IAAI,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IACD,eAAe;IACf,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IAED,OAAO;IACP,IAAI,OAAO,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;QACnC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACnD,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,eAAe;IACf,MAAM,QAAQ,GAAG,UAAU;SACxB,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;SACpB,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;SACnB,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;QAC5B,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED,4BAA4B;IAC5B,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,yCAAyC;IACzC,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IACxC,IAAI,WAAW,IAAI,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACxD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QACrE,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjD,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC;QAC1D,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,OAAO,CAAC,SAA8B,EAAE,EAAU;IACzD,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+DAA+D;AAC/D,cAAc;AACd,+DAA+D;AAE/D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAA8B,EAC9B,OAAe,EACf,KAAa;IAEb,IAAI,KAAK,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClD,MAAM,MAAM,GAAG,OAAO;SACnB,WAAW,EAAE;SACb,KAAK,CAAC,WAAW,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAEzC,MAAM,MAAM,GAAyC,EAAE,CAAC;IACxD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACtC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,KAAK,IAAI,GAAG,CAAC;QAC/C,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,+DAA+D;AAC/D,YAAY;AACZ,+DAA+D;AAE/D;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,aAAqB,EACrB,UAAkB;IAElB,IAAI,aAAa,IAAI,EAAE,IAAI,UAAU,IAAI,EAAE;QAAE,OAAO,MAAM,CAAC;IAC3D,IAAI,aAAa,IAAI,CAAC,IAAI,UAAU,IAAI,EAAE;QAAE,OAAO,QAAQ,CAAC;IAC5D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAE/D,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B;;;;;GAKG;AACH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;AAE/C,SAAS,WAAW,CAClB,SAAiB,EACjB,OAAe,EACf,SAAiB,EACjB,WAAmB,EACnB,SAAgC,EAChC,SAAuB;IAEvB,OAAO,GAAG,SAAS,KAAK,OAAO,KAAK,SAAS,KAAK,WAAW,KAAK,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;AACxG,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CACjC,SAA8B,EAC9B,SAAiB,EACjB,OAAe,EACf,SAAiB,EACjB,SAAgC,EAChC,SAAuB;IAEvB,MAAM,GAAG,GAAG,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACrG,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,iBAAiB;QACjB,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC1B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,GAAG,GAAe,IAAI,GAAG,EAAE,CAAC;IAClC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS;QACnD,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,kBAAkB;YAClB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACjD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,SAAS,KAAK,YAAY,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACvD,qEAAqE;YACrE,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACjD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,8BAA8B;IAC9B,IAAI,QAAQ,CAAC,IAAI,IAAI,eAAe,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC/C,IAAI,SAAS,KAAK,SAAS;YAAE,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1D,CAAC;IACD,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACvB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,0BAA0B;IACxC,QAAQ,CAAC,KAAK,EAAE,CAAC;AACnB,CAAC;AAED,+DAA+D;AAC/D,mBAAmB;AACnB,+DAA+D;AAE/D;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,WAAW,CACzB,SAA8B,EAC9B,OAAe,EACf,OAA2B;IAE3B,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9D,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAE5G,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,QAAQ,GAAkB,EAAE,CAAC;IAEnC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,KAAK,KAAK,cAAc;YAAE,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QACpE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;IAC/C,CAAC;IACD,IAAI,eAAe,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC;IACjD,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC,aAAa,IAAI,IAAI,GAAG,EAAU,CAAC;IAC3D,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAErB,MAAM,GAAG,GAAG,mBAAmB,CAC7B,SAAS,EACT,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,YAAY,EACpB,OAAO,CAAC,cAAc,EACtB,SAAS,EACT,OAAO,CAAC,SAAS,CAClB,CAAC;IAQF,MAAM,KAAK,GAAgB,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAExE,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,UAAU;IACV,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,SAAS;YAAE,MAAM;QACrB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC3B,IAAI,GAAG,CAAC,KAAK,IAAI,cAAc;YAAE,SAAS;QAC1C,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,SAAS,KAAK,SAAS;YAAE,SAAS;QACtC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,SAAS;gBAAE,MAAM;YACrB,MAAM,IAAI,GAAG,qBAAqB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;gBACzC,SAAS;YACX,CAAC;YACD,IAAI,IAAI,GAAG,aAAa,EAAE,CAAC;gBACzB,kBAAkB,EAAE,CAAC;gBACrB,SAAS;YACX,CAAC;YACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACvC,4BAA4B;YAC5B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,eAAe,EAAE,CAAC;gBAC1C,QAAQ,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;gBACjC,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;YACzB,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,EAAE,CAAC,QAAQ;gBACf,KAAK,EAAE,SAAS;gBAChB,UAAU,EAAE,IAAI;gBAChB,MAAM;gBACN,IAAI,EAAE,QAAQ;aACf,CAAC,CAAC;YACH,qCAAqC;YACrC,IAAI,SAAS,GAAG,cAAc,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;QACpD,QAAQ,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,KAAK,cAAc,IAAI,OAAO,CAAC,MAAM,KAAK,eAAe,EAAE,CAAC;QAC3E,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;AAC/C,CAAC;AAED,SAAS,WAAW,CAAC,MAAc,EAAE,IAAY,EAAE,IAAe;IAChE,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,GAAG,IAAI,CAAC,QAAQ,QAAQ,SAAS,MAAM,OAAO,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,WAAW,CAAC,EAAU;IAC7B,iDAAiD;IACjD,MAAM,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IACjC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED,+DAA+D;AAC/D,yCAAyC;AACzC,+DAA+D;AAE/D;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc;IAC7C,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CACtB,SAA8B,EAC9B,EAAU;IAEV,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}