@grafema/util 0.3.0-beta

package/dist/core/FileOverview.js

@@ -0,0 +1,279 @@
+/**
+ * FileOverview - Get a structured overview of all entities in a file.
+ *
+ * Purpose: Show what a file contains and how its parts relate to each other.
+ * Unlike FileExplainer (which lists ALL nodes flat), FileOverview shows only
+ * meaningful entities (functions, classes, variables) with their key relationships
+ * (calls, extends, assigned-from).
+ *
+ * Unlike the context command (which shows ONE node's full neighborhood),
+ * FileOverview shows ALL entities at file level with curated edges.
+ *
+ * Use this when:
+ * - AI agent needs to understand a file before diving deeper
+ * - User wants a table-of-contents of a file with relationships
+ * - Quick orientation before using get_context on specific nodes
+ *
+ * @example
+ * ```typescript
+ * const overview = new FileOverview(backend);
+ * const result = await overview.getOverview('/abs/path/to/file.js');
+ * // result.functions[0].calls -> ["express", "Router"]
+ * ```
+ *
+ * @see REG-412
+ */
+import { findCallsInFunction } from '../queries/findCallsInFunction.js';
+/** Node types we display in the file overview */
+const OVERVIEW_NODE_TYPES = new Set([
+    'FUNCTION',
+    'CLASS',
+    'METHOD',
+    'VARIABLE',
+    'CONSTANT',
+    'IMPORT',
+    'EXPORT',
+]);
+export class FileOverview {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Get structured overview of a file's entities and relationships.
+     *
+     * @param filePath - Absolute file path (after realpath resolution)
+     * @param options - Optional: { includeEdges: boolean }
+     * @returns FileOverviewResult
+     */
+    async getOverview(filePath, options = {}) {
+        const { includeEdges = true } = options;
+        const moduleNode = await this.findModuleNode(filePath);
+        if (!moduleNode) {
+            return {
+                file: filePath,
+                status: 'NOT_ANALYZED',
+                imports: [],
+                exports: [],
+                classes: [],
+                functions: [],
+                variables: [],
+            };
+        }
+        const children = await this.getTopLevelEntities(moduleNode.id);
+        const imports = [];
+        const exports = [];
+        const classes = [];
+        const functions = [];
+        const variables = [];
+        for (const child of children) {
+            switch (child.type) {
+                case 'IMPORT':
+                    imports.push(this.buildImportInfo(child));
+                    break;
+                case 'EXPORT':
+                    exports.push(this.buildExportInfo(child));
+                    break;
+                case 'CLASS':
+                    classes.push(await this.buildClassOverview(child, includeEdges));
+                    break;
+                case 'FUNCTION':
+                case 'METHOD':
+                    functions.push(await this.buildFunctionOverview(child, includeEdges));
+                    break;
+                case 'VARIABLE':
+                case 'CONSTANT':
+                    variables.push(await this.buildVariableOverview(child, includeEdges));
+                    break;
+            }
+        }
+        const byLine = (a, b) => (a.line ?? 0) - (b.line ?? 0);
+        classes.sort(byLine);
+        functions.sort(byLine);
+        variables.sort(byLine);
+        return {
+            file: filePath,
+            status: 'ANALYZED',
+            imports,
+            exports,
+            classes,
+            functions,
+            variables,
+        };
+    }
+    /**
+     * Find the MODULE node for the given file path.
+     * Complexity: O(1) - server-side filtered query
+     */
+    async findModuleNode(filePath) {
+        const filter = { file: filePath, type: 'MODULE' };
+        for await (const node of this.graph.queryNodes(filter)) {
+            if (node.file === filePath && node.type === 'MODULE') {
+                return node;
+            }
+        }
+        return null;
+    }
+    /**
+     * Get direct children of MODULE node that are "interesting" types.
+     * Complexity: O(C) where C = total CONTAINS edges from MODULE
+     */
+    async getTopLevelEntities(moduleId) {
+        const containsEdges = await this.graph.getOutgoingEdges(moduleId, ['CONTAINS']);
+        const entities = [];
+        for (const edge of containsEdges) {
+            const child = await this.graph.getNode(edge.dst);
+            if (child && OVERVIEW_NODE_TYPES.has(child.type)) {
+                entities.push(child);
+            }
+        }
+        return entities;
+    }
+    /**
+     * Build ImportInfo from an IMPORT node.
+     * Data read directly from node record fields.
+     * Complexity: O(1)
+     */
+    buildImportInfo(node) {
+        const source = node.source ?? (node.name || '');
+        const rawSpecifiers = node.specifiers;
+        let specifierNames = [];
+        if (Array.isArray(rawSpecifiers)) {
+            specifierNames = rawSpecifiers.map((s) => s.local || s.imported || 'unknown');
+        }
+        return {
+            id: node.id,
+            source,
+            specifiers: specifierNames,
+        };
+    }
+    /**
+     * Build ExportInfo from an EXPORT node.
+     * Data read directly from node record fields.
+     * Complexity: O(1)
+     */
+    buildExportInfo(node) {
+        return {
+            id: node.id,
+            name: node.exportedName ?? node.name ?? '<anonymous>',
+            isDefault: node.isDefault ?? false,
+        };
+    }
+    /**
+     * Build FunctionOverview from a FUNCTION node.
+     * When includeEdges=true, resolves calls via findCallsInFunction.
+     * Complexity: Without edges O(1), with edges O(S + C)
+     */
+    async buildFunctionOverview(node, includeEdges) {
+        const overview = {
+            id: node.id,
+            name: node.name ?? '<anonymous>',
+            line: node.line,
+            async: node.async ?? false,
+            params: node.params,
+            calls: [],
+            returnType: node.returnType,
+            signature: node.signature,
+        };
+        if (includeEdges) {
+            const callInfos = await findCallsInFunction(this.graph, node.id, { transitive: false });
+            const callNames = new Set();
+            for (const call of callInfos) {
+                if (call.resolved && call.target) {
+                    callNames.add(call.target.name);
+                }
+                else {
+                    callNames.add(call.name);
+                }
+            }
+            // Fallback: when HAS_SCOPE edges are missing (orchestrator doesn't create
+            // FUNCTION → HAS_SCOPE), find CALL nodes by file + line range.
+            if (callNames.size === 0 && node.file && node.line != null) {
+                const endLine = node.endLine ?? node.line + 100000;
+                const nodeLine = node.line;
+                const filter = { file: node.file, type: 'CALL' };
+                for await (const callNode of this.graph.queryNodes(filter)) {
+                    const callLine = callNode.line;
+                    if (callLine != null && callLine >= nodeLine && callLine <= endLine) {
+                        const callsEdges = await this.graph.getOutgoingEdges(callNode.id, ['CALLS']);
+                        if (callsEdges.length > 0) {
+                            const target = await this.graph.getNode(callsEdges[0].dst);
+                            if (target) {
+                                callNames.add(target.name ?? callNode.name ?? '<unknown>');
+                            }
+                        }
+                        else {
+                            callNames.add(callNode.name ?? '<unknown>');
+                        }
+                    }
+                }
+            }
+            overview.calls = Array.from(callNames);
+        }
+        return overview;
+    }
+    /**
+     * Build ClassOverview from a CLASS node.
+     * Fetches EXTENDS edge and methods via CONTAINS.
+     * Complexity: Without edges O(M), with edges O(M * (S + C))
+     */
+    async buildClassOverview(node, includeEdges) {
+        const overview = {
+            id: node.id,
+            name: node.name ?? '<anonymous>',
+            line: node.line,
+            exported: node.exported ?? false,
+            methods: [],
+        };
+        // Get superclass
+        if (includeEdges) {
+            const extendsEdges = await this.graph.getOutgoingEdges(node.id, ['EXTENDS']);
+            if (extendsEdges.length > 0) {
+                const superNode = await this.graph.getNode(extendsEdges[0].dst);
+                overview.extends = superNode?.name ?? node.superClass;
+            }
+            else if (node.superClass) {
+                overview.extends = node.superClass;
+            }
+        }
+        else if (node.superClass) {
+            overview.extends = node.superClass;
+        }
+        // Get methods via CONTAINS or HAS_METHOD edges
+        const containsEdges = await this.graph.getOutgoingEdges(node.id, ['CONTAINS', 'HAS_METHOD']);
+        for (const edge of containsEdges) {
+            const child = await this.graph.getNode(edge.dst);
+            if (!child)
+                continue;
+            if (child.type === 'FUNCTION' || child.type === 'METHOD') {
+                const methodOverview = await this.buildFunctionOverview(child, includeEdges);
+                overview.methods.push(methodOverview);
+            }
+        }
+        overview.methods.sort((a, b) => (a.line ?? 0) - (b.line ?? 0));
+        return overview;
+    }
+    /**
+     * Build VariableOverview from a VARIABLE or CONSTANT node.
+     * Complexity: Without edges O(1), with edges O(1)
+     */
+    async buildVariableOverview(node, includeEdges) {
+        const overview = {
+            id: node.id,
+            name: node.name ?? '<anonymous>',
+            line: node.line,
+            kind: node.kind ?? 'const',
+        };
+        if (includeEdges) {
+            const assignedEdges = await this.graph.getOutgoingEdges(node.id, ['ASSIGNED_FROM']);
+            if (assignedEdges.length > 0) {
+                const sourceNode = await this.graph.getNode(assignedEdges[0].dst);
+                if (sourceNode) {
+                    overview.assignedFrom = sourceNode.name ?? sourceNode.type;
+                }
+            }
+        }
+        return overview;
+    }
+}
+//# sourceMappingURL=FileOverview.js.map

package/dist/core/FileOverview.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FileOverview.js","sourceRoot":"","sources":["../../src/core/FileOverview.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAsDxE,iDAAiD;AACjD,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,UAAU;IACV,OAAO;IACP,QAAQ;IACR,UAAU;IACV,UAAU;IACV,QAAQ;IACR,QAAQ;CACT,CAAC,CAAC;AAEH,MAAM,OAAO,YAAY;IACH;IAApB,YAAoB,KAAmB;QAAnB,UAAK,GAAL,KAAK,CAAc;IAAG,CAAC;IAE3C;;;;;;OAMG;IACH,KAAK,CAAC,WAAW,CACf,QAAgB,EAChB,UAAsC,EAAE;QAExC,MAAM,EAAE,YAAY,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;QAExC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,MAAM,EAAE,cAAc;gBACtB,OAAO,EAAE,EAAE;gBACX,OAAO,EAAE,EAAE;gBACX,OAAO,EAAE,EAAE;gBACX,SAAS,EAAE,EAAE;gBACb,SAAS,EAAE,EAAE;aACd,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAE/D,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAoB,EAAE,CAAC;QACpC,MAAM,SAAS,GAAuB,EAAE,CAAC;QACzC,MAAM,SAAS,GAAuB,EAAE,CAAC;QAEzC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;gBACnB,KAAK,QAAQ;oBACX,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC1C,MAAM;gBACR,KAAK,QAAQ;oBACX,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC1C,MAAM;gBACR,KAAK,OAAO;oBACV,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,UAAU,CAAC;gBAChB,KAAK,QAAQ;oBACX,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC;oBACtE,MAAM;gBACR,KAAK,UAAU,CAAC;gBAChB,KAAK,UAAU;oBACb,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC;oBACtE,MAAM;YACV,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,CAAC,CAAoB,EAAE,CAAoB,EAAE,EAAE,CAC5D,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;QAEhC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEvB,OAAO;YACL,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,UAAU;YAClB,OAAO;YACP,OAAO;YACP,OAAO;YACP,SAAS;YACT,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,cAAc,CAC1B,QAAgB;QAEhB,MAAM,MAAM,GAAe,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;QAC9D,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,mBAAmB,CAC/B,QAAgB;QAEhB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CACrD,QAAQ,EACR,CAAC,UAAU,CAAC,CACb,CAAC;QAEF,MAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,KAAK,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,IAAoB;QAC1C,MAAM,MAAM,GAAI,IAAI,CAAC,MAAiB,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC;QACtC,IAAI,cAAc,GAAa,EAAE,CAAC;QAElC,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;YACjC,cAAc,GAAG,aAAa,CAAC,GAAG,CAChC,CAAC,CAAuD,EAAE,EAAE,CAC1D,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,QAAQ,IAAI,SAAS,CACrC,CAAC;QACJ,CAAC;QAED,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,MAAM;YACN,UAAU,EAAE,cAAc;SAC3B,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,IAAoB;QAC1C,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAG,IAAI,CAAC,YAAuB,IAAI,IAAI,CAAC,IAAI,IAAI,aAAa;YACjE,SAAS,EAAG,IAAI,CAAC,SAAqB,IAAI,KAAK;SAChD,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,qBAAqB,CACjC,IAAoB,EACpB,YAAqB;QAErB,MAAM,QAAQ,GAAqB;YACjC,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,aAAa;YAChC,IAAI,EAAE,IAAI,CAAC,IAA0B;YACrC,KAAK,EAAG,IAAI,CAAC,KAAiB,IAAI,KAAK;YACvC,MAAM,EAAE,IAAI,CAAC,MAA8B;YAC3C,KAAK,EAAE,EAAE;YACT,UAAU,EAAE,IAAI,CAAC,UAAgC;YACjD,SAAS,EAAE,IAAI,CAAC,SAA+B;SAChD,CAAC;QAEF,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,SAAS,GAAe,MAAM,mBAAmB,CACrD,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,EAAE,EACP,EAAE,UAAU,EAAE,KAAK,EAAE,CACtB,CAAC;YAEF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YACpC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBACjC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YAED,0EAA0E;YAC1E,+DAA+D;YAC/D,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;gBAC3D,MAAM,OAAO,GAAI,IAAI,CAAC,OAA8B,IAAK,IAAI,CAAC,IAAe,GAAG,MAAM,CAAC;gBACvF,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAc,CAAC;gBACrC,MAAM,MAAM,GAAe,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;gBAC7D,IAAI,KAAK,EAAE,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3D,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAA0B,CAAC;oBACrD,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,OAAO,EAAE,CAAC;wBACpE,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;wBAC7E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC1B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;4BAC3D,IAAI,MAAM,EAAE,CAAC;gCACX,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,IAAI,WAAW,CAAC,CAAC;4BAC7D,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACN,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,WAAW,CAAC,CAAC;wBAC9C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,kBAAkB,CAC9B,IAAoB,EACpB,YAAqB;QAErB,MAAM,QAAQ,GAAkB;YAC9B,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,aAAa;YAChC,IAAI,EAAE,IAAI,CAAC,IAA0B;YACrC,QAAQ,EAAG,IAAI,CAAC,QAAoB,IAAI,KAAK;YAC7C,OAAO,EAAE,EAAE;SACZ,CAAC;QAEF,iBAAiB;QACjB,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CACpD,IAAI,CAAC,EAAE,EACP,CAAC,SAAS,CAAC,CACZ,CAAC;YACF,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChE,QAAQ,CAAC,OAAO,GAAG,SAAS,EAAE,IAAI,IAAK,IAAI,CAAC,UAAqB,CAAC;YACpE,CAAC;iBAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC3B,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC,UAAoB,CAAC;YAC/C,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3B,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC,UAAoB,CAAC;QAC/C,CAAC;QAED,+CAA+C;QAC/C,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CACrD,IAAI,CAAC,EAAE,EACP,CAAC,UAAU,EAAE,YAAY,CAAC,CAC3B,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACzD,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,qBAAqB,CACrD,KAAK,EACL,YAAY,CACb,CAAC;gBACF,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QAE/D,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,qBAAqB,CACjC,IAAoB,EACpB,YAAqB;QAErB,MAAM,QAAQ,GAAqB;YACjC,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,aAAa;YAChC,IAAI,EAAE,IAAI,CAAC,IAA0B;YACrC,IAAI,EAAG,IAAI,CAAC,IAAe,IAAI,OAAO;SACvC,CAAC;QAEF,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CACrD,IAAI,CAAC,EAAE,EACP,CAAC,eAAe,CAAC,CAClB,CAAC;YACF,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClE,IAAI,UAAU,EAAE,CAAC;oBACf,QAAQ,CAAC,YAAY,GAAG,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC;gBAC7D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}

package/dist/core/GrafemaUri.d.ts

@@ -0,0 +1,66 @@
+/**
+ * GrafemaUri -- conversion between compact semantic IDs and grafema:// URIs.
+ *
+ * URI format: grafema://{authority}/{file}#{encoded_fragment}
+ * Virtual nodes: grafema://{authority}/_/{encoded_full_id}
+ * Module nodes: grafema://{authority}/{file}#MODULE
+ *
+ * Fragment encoding: only > [ ] # need percent-encoding.
+ */
+/**
+ * Check if a string is a grafema:// URI.
+ */
+export declare function isGrafemaUri(str: string): boolean;
+/**
+ * Encode a fragment string for grafema:// URIs.
+ * Only 4 chars need percent-encoding: > [ ] #
+ */
+export declare function encodeFragment(raw: string): string;
+/**
+ * Decode a percent-encoded fragment back to raw string.
+ */
+export declare function decodeFragment(encoded: string): string;
+/**
+ * Convert a compact semantic ID to a grafema:// URI.
+ *
+ * @param compactId - Compact format: "file->TYPE->name[in:p,h:x]#N", "MODULE#file", "EXTERNAL_MODULE->x"
+ * @param authority - URI authority: "github.com/owner/repo" or "localhost/project"
+ * @returns grafema:// URI string
+ */
+export declare function toGrafemaUri(compactId: string, authority: string): string;
+/**
+ * Parsed grafema:// URI components.
+ */
+export interface ParsedGrafemaUri {
+    /** URI authority, e.g. "github.com/owner/repo" */
+    authority: string;
+    /** File path within the project, or empty for virtual nodes */
+    filePath: string;
+    /** Decoded symbol part (the fragment, decoded) */
+    symbolPart: string;
+    /** Reconstructed compact semantic ID */
+    semanticId: string;
+    /** Whether this is a virtual node (uses _/ path) */
+    isVirtual: boolean;
+}
+/**
+ * Parse a grafema:// URI into components.
+ *
+ * @returns Parsed components or null if not a valid grafema:// URI
+ */
+export declare function parseGrafemaUri(uri: string): ParsedGrafemaUri | null;
+/**
+ * Convert a grafema:// URI to compact semantic ID format.
+ * Convenience wrapper around parseGrafemaUri.
+ *
+ * @returns Compact semantic ID or the input unchanged if not a grafema:// URI
+ */
+export declare function toCompactSemanticId(uri: string): string;
+/**
+ * Normalize a semantic ID input -- accepts either URI or compact format.
+ * If it's a URI, converts to compact. If already compact, returns as-is.
+ *
+ * Useful in MCP handlers that need to accept both formats.
+ */
+export declare function normalizeSemanticId(input: string): string;
+//# sourceMappingURL=GrafemaUri.d.ts.map

package/dist/core/GrafemaUri.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GrafemaUri.d.ts","sourceRoot":"","sources":["../../src/core/GrafemaUri.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH;;GAEG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEjD;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAalD;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAStD;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CA4BzE;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,kDAAkD;IAClD,SAAS,EAAE,MAAM,CAAC;IAClB,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,CAAC;IACjB,kDAAkD;IAClD,UAAU,EAAE,MAAM,CAAC;IACnB,wCAAwC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,oDAAoD;IACpD,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI,CAkFpE;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAKvD;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEzD"}

package/dist/core/GrafemaUri.js

@@ -0,0 +1,191 @@
+/**
+ * GrafemaUri -- conversion between compact semantic IDs and grafema:// URIs.
+ *
+ * URI format: grafema://{authority}/{file}#{encoded_fragment}
+ * Virtual nodes: grafema://{authority}/_/{encoded_full_id}
+ * Module nodes: grafema://{authority}/{file}#MODULE
+ *
+ * Fragment encoding: only > [ ] # need percent-encoding.
+ */
+const GRAFEMA_SCHEME = 'grafema://';
+/**
+ * Check if a string is a grafema:// URI.
+ */
+export function isGrafemaUri(str) {
+    return str.startsWith(GRAFEMA_SCHEME);
+}
+/**
+ * Encode a fragment string for grafema:// URIs.
+ * Only 4 chars need percent-encoding: > [ ] #
+ */
+export function encodeFragment(raw) {
+    let out = '';
+    for (let i = 0; i < raw.length; i++) {
+        const ch = raw[i];
+        switch (ch) {
+            case '>':
+                out += '%3E';
+                break;
+            case '[':
+                out += '%5B';
+                break;
+            case ']':
+                out += '%5D';
+                break;
+            case '#':
+                out += '%23';
+                break;
+            default: out += ch;
+        }
+    }
+    return out;
+}
+/**
+ * Decode a percent-encoded fragment back to raw string.
+ */
+export function decodeFragment(encoded) {
+    return encoded
+        .replaceAll('%3E', '>')
+        .replaceAll('%3e', '>')
+        .replaceAll('%5B', '[')
+        .replaceAll('%5b', '[')
+        .replaceAll('%5D', ']')
+        .replaceAll('%5d', ']')
+        .replaceAll('%23', '#');
+}
+/**
+ * Convert a compact semantic ID to a grafema:// URI.
+ *
+ * @param compactId - Compact format: "file->TYPE->name[in:p,h:x]#N", "MODULE#file", "EXTERNAL_MODULE->x"
+ * @param authority - URI authority: "github.com/owner/repo" or "localhost/project"
+ * @returns grafema:// URI string
+ */
+export function toGrafemaUri(compactId, authority) {
+    // Case 1: MODULE#file
+    if (compactId.startsWith('MODULE#')) {
+        const file = compactId.slice(7); // len("MODULE#") = 7
+        return `${GRAFEMA_SCHEME}${authority}/${file}#MODULE`;
+    }
+    // Case 2 & 3: Check for file->REST pattern
+    const firstArrow = compactId.indexOf('->');
+    if (firstArrow !== -1) {
+        const beforeArrow = compactId.slice(0, firstArrow);
+        // Heuristic: file paths contain '/' or '.'
+        const isFilePath = beforeArrow.includes('/') || beforeArrow.includes('.');
+        if (isFilePath) {
+            // Standard node: file->REST
+            const file = beforeArrow;
+            const rest = compactId.slice(firstArrow + 2);
+            return `${GRAFEMA_SCHEME}${authority}/${file}#${encodeFragment(rest)}`;
+        }
+        else {
+            // Virtual node: encode the whole ID
+            return `${GRAFEMA_SCHEME}${authority}/_/${encodeFragment(compactId)}`;
+        }
+    }
+    // No arrow -- virtual node
+    return `${GRAFEMA_SCHEME}${authority}/_/${encodeFragment(compactId)}`;
+}
+/**
+ * Parse a grafema:// URI into components.
+ *
+ * @returns Parsed components or null if not a valid grafema:// URI
+ */
+export function parseGrafemaUri(uri) {
+    if (!uri.startsWith(GRAFEMA_SCHEME))
+        return null;
+    const rest = uri.slice(GRAFEMA_SCHEME.length); // "authority/file#fragment"
+    // Find the authority: everything up to the first '/' after the host
+    // Authority format: "host/project" (e.g., "github.com/owner/repo" or "localhost/project")
+    // We need to find where authority ends and file path begins.
+    // Convention: authority is "host/path" where host has no '/', so we split on first '/' after host.
+    // Actually, authority can be multi-segment (github.com/owner/repo = 3 segments).
+    // Strategy: find '#' first (fragment delimiter), then split the path part.
+    const hashPos = rest.indexOf('#');
+    const slashUnderscoreSlash = rest.indexOf('/_/');
+    if (slashUnderscoreSlash !== -1 && (hashPos === -1 || slashUnderscoreSlash < hashPos)) {
+        // Virtual node: authority/_/encoded_id
+        const authority = rest.slice(0, slashUnderscoreSlash);
+        const encodedId = rest.slice(slashUnderscoreSlash + 3); // after "/_/"
+        const decodedId = decodeFragment(encodedId);
+        // Reconstruct compact ID -- it's just the decoded full ID
+        return {
+            authority,
+            filePath: '',
+            symbolPart: decodedId,
+            semanticId: decodedId,
+            isVirtual: true,
+        };
+    }
+    if (hashPos === -1)
+        return null; // No fragment = invalid
+    const pathPart = rest.slice(0, hashPos); // "authority/file/path"
+    const fragment = rest.slice(hashPos + 1); // "TYPE-%3Ename..."
+    const decodedFragment = decodeFragment(fragment);
+    // Split pathPart into authority and filePath.
+    // The authority is the first N segments that represent the host+project.
+    // Problem: we don't know where authority ends and file begins.
+    // Convention from the plan: authority = "host/project" (e.g., "localhost/grafema")
+    //   or "github.com/owner/repo" (3 segments).
+    // The file path typically starts with src/, lib/, etc.
+    //
+    // Better approach: find the file path by working backward from the fragment.
+    // The fragment's decoded form tells us the type. The module_id for MODULE# format
+    // means filePath = pathPart minus authority.
+    //
+    // Simplest reliable approach: the authority is stored separately or we use a heuristic.
+    // For now: authority = first 2 segments for "host/project" format,
+    // first 3 segments for known hosts (github.com, gitlab.com, bitbucket.org).
+    const segments = pathPart.split('/');
+    let authoritySegments;
+    const host = segments[0];
+    if (host === 'github.com' || host === 'gitlab.com' || host === 'bitbucket.org') {
+        authoritySegments = 3; // host/owner/repo
+    }
+    else {
+        authoritySegments = 2; // host/project (localhost/grafema)
+    }
+    if (segments.length < authoritySegments)
+        return null;
+    const authority = segments.slice(0, authoritySegments).join('/');
+    const filePath = segments.slice(authoritySegments).join('/');
+    // Reconstruct compact semantic ID
+    let semanticId;
+    if (decodedFragment === 'MODULE') {
+        semanticId = `MODULE#${filePath}`;
+    }
+    else {
+        semanticId = `${filePath}->${decodedFragment}`;
+    }
+    return {
+        authority,
+        filePath,
+        symbolPart: decodedFragment,
+        semanticId,
+        isVirtual: false,
+    };
+}
+/**
+ * Convert a grafema:// URI to compact semantic ID format.
+ * Convenience wrapper around parseGrafemaUri.
+ *
+ * @returns Compact semantic ID or the input unchanged if not a grafema:// URI
+ */
+export function toCompactSemanticId(uri) {
+    if (!isGrafemaUri(uri))
+        return uri;
+    const parsed = parseGrafemaUri(uri);
+    if (!parsed)
+        return uri;
+    return parsed.semanticId;
+}
+/**
+ * Normalize a semantic ID input -- accepts either URI or compact format.
+ * If it's a URI, converts to compact. If already compact, returns as-is.
+ *
+ * Useful in MCP handlers that need to accept both formats.
+ */
+export function normalizeSemanticId(input) {
+    return toCompactSemanticId(input);
+}
+//# sourceMappingURL=GrafemaUri.js.map

package/dist/core/GrafemaUri.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GrafemaUri.js","sourceRoot":"","sources":["../../src/core/GrafemaUri.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,cAAc,GAAG,YAAY,CAAC;AAEpC;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,OAAO,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,GAAW;IACxC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,QAAQ,EAAE,EAAE,CAAC;YACX,KAAK,GAAG;gBAAE,GAAG,IAAI,KAAK,CAAC;gBAAC,MAAM;YAC9B,KAAK,GAAG;gBAAE,GAAG,IAAI,KAAK,CAAC;gBAAC,MAAM;YAC9B,KAAK,GAAG;gBAAE,GAAG,IAAI,KAAK,CAAC;gBAAC,MAAM;YAC9B,KAAK,GAAG;gBAAE,GAAG,IAAI,KAAK,CAAC;gBAAC,MAAM;YAC9B,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,OAAO,OAAO;SACX,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;SACtB,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;SACtB,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;SACtB,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;SACtB,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;SACtB,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;SACtB,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB,EAAE,SAAiB;IAC/D,sBAAsB;IACtB,IAAI,SAAS,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;QACtD,OAAO,GAAG,cAAc,GAAG,SAAS,IAAI,IAAI,SAAS,CAAC;IACxD,CAAC;IAED,2CAA2C;IAC3C,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAEnD,2CAA2C;QAC3C,MAAM,UAAU,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAE1E,IAAI,UAAU,EAAE,CAAC;YACf,4BAA4B;YAC5B,MAAM,IAAI,GAAG,WAAW,CAAC;YACzB,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;YAC7C,OAAO,GAAG,cAAc,GAAG,SAAS,IAAI,IAAI,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,oCAAoC;YACpC,OAAO,GAAG,cAAc,GAAG,SAAS,MAAM,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,OAAO,GAAG,cAAc,GAAG,SAAS,MAAM,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC;AACxE,CAAC;AAkBD;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,4BAA4B;IAE3E,oEAAoE;IACpE,0FAA0F;IAC1F,6DAA6D;IAC7D,mGAAmG;IACnG,iFAAiF;IACjF,2EAA2E;IAE3E,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,oBAAoB,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjD,IAAI,oBAAoB,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,IAAI,oBAAoB,GAAG,OAAO,CAAC,EAAE,CAAC;QACtF,uCAAuC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc;QACtE,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAE5C,0DAA0D;QAC1D,OAAO;YACL,SAAS;YACT,QAAQ,EAAE,EAAE;YACZ,UAAU,EAAE,SAAS;YACrB,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,IAAI;SAChB,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,wBAAwB;IAEzD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,wBAAwB;IACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB;IAC9D,MAAM,eAAe,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAEjD,8CAA8C;IAC9C,yEAAyE;IACzE,+DAA+D;IAC/D,mFAAmF;IACnF,6CAA6C;IAC7C,uDAAuD;IACvD,EAAE;IACF,6EAA6E;IAC7E,kFAAkF;IAClF,6CAA6C;IAC7C,EAAE;IACF,wFAAwF;IACxF,mEAAmE;IACnE,4EAA4E;IAE5E,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,iBAAyB,CAAC;IAE9B,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,eAAe,EAAE,CAAC;QAC/E,iBAAiB,GAAG,CAAC,CAAC,CAAC,kBAAkB;IAC3C,CAAC;SAAM,CAAC;QACN,iBAAiB,GAAG,CAAC,CAAC,CAAC,mCAAmC;IAC5D,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,GAAG,iBAAiB;QAAE,OAAO,IAAI,CAAC;IAErD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAE7D,kCAAkC;IAClC,IAAI,UAAkB,CAAC;IACvB,IAAI,eAAe,KAAK,QAAQ,EAAE,CAAC;QACjC,UAAU,GAAG,UAAU,QAAQ,EAAE,CAAC;IACpC,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,GAAG,QAAQ,KAAK,eAAe,EAAE,CAAC;IACjD,CAAC;IAED,OAAO;QACL,SAAS;QACT,QAAQ;QACR,UAAU,EAAE,eAAe;QAC3B,UAAU;QACV,SAAS,EAAE,KAAK;KACjB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAW;IAC7C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IACnC,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM;QAAE,OAAO,GAAG,CAAC;IACxB,OAAO,MAAM,CAAC,UAAU,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC;AACpC,CAAC"}