agentic-qe 2.5.9 → 2.6.0

package/dist/code-intelligence/graph/GraphBuilder.d.ts

@@ -0,0 +1,126 @@
+/**
+ * Code Graph Builder
+ *
+ * Constructs a knowledge graph of code relationships:
+ * - Import/export dependencies
+ * - Class inheritance hierarchies
+ * - Function call graphs
+ * - Type usage relationships
+ *
+ * Integrates with AST parsing for accurate extraction.
+ */
+import { GraphNode, GraphEdge, GraphBuilderConfig, GraphStats, GraphQuery, GraphQueryResult, NodeType, EdgeType } from './types.js';
+export declare class GraphBuilder {
+    private config;
+    private graph;
+    private nodeIdCounter;
+    private edgeIdCounter;
+    constructor(config?: Partial<GraphBuilderConfig>);
+    /**
+     * Add a node to the graph.
+     */
+    addNode(type: NodeType, label: string, filePath: string, startLine: number, endLine: number, language: string, properties?: Record<string, unknown>): GraphNode;
+    /**
+     * Add an edge between nodes.
+     */
+    addEdge(sourceId: string, targetId: string, type: EdgeType, weight?: number, properties?: Record<string, unknown>): GraphEdge | null;
+    /**
+     * Find or create a node by label and file.
+     */
+    findOrCreateNode(type: NodeType, label: string, filePath: string, startLine?: number, endLine?: number, language?: string): GraphNode;
+    /**
+     * Find a node by label and optional filters.
+     */
+    findNode(label: string, filePath?: string, type?: NodeType): GraphNode | undefined;
+    /**
+     * Find nodes by type.
+     */
+    findNodesByType(type: NodeType): GraphNode[];
+    /**
+     * Find nodes in a file.
+     */
+    findNodesInFile(filePath: string): GraphNode[];
+    /**
+     * Get outgoing edges for a node.
+     */
+    getOutgoingEdges(nodeId: string): GraphEdge[];
+    /**
+     * Get incoming edges for a node.
+     */
+    getIncomingEdges(nodeId: string): GraphEdge[];
+    /**
+     * Get neighbors of a node.
+     */
+    getNeighbors(nodeId: string, direction?: 'outgoing' | 'incoming' | 'both'): GraphNode[];
+    /**
+     * Query the graph with traversal.
+     */
+    query(query: GraphQuery): GraphQueryResult;
+    /**
+     * Find path between two nodes.
+     */
+    findPath(startId: string, endId: string, maxDepth?: number): GraphNode[] | null;
+    /**
+     * Remove a node and its edges.
+     */
+    removeNode(nodeId: string): boolean;
+    /**
+     * Remove all nodes from a file.
+     */
+    removeFile(filePath: string): number;
+    /**
+     * Get graph statistics.
+     */
+    getStats(): GraphStats;
+    /**
+     * Get node by ID.
+     */
+    getNode(id: string): GraphNode | undefined;
+    /**
+     * Get edge by ID.
+     */
+    getEdge(id: string): GraphEdge | undefined;
+    /**
+     * Get all nodes.
+     */
+    getAllNodes(): GraphNode[];
+    /**
+     * Get all edges.
+     */
+    getAllEdges(): GraphEdge[];
+    /**
+     * Clear the graph.
+     */
+    clear(): void;
+    /**
+     * Get configuration.
+     */
+    getConfig(): GraphBuilderConfig;
+    /**
+     * Export graph for persistence.
+     */
+    exportGraph(): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    /**
+     * Import graph from persistence.
+     */
+    importGraph(data: {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }): void;
+    /**
+     * Create empty graph structure.
+     */
+    private createEmptyGraph;
+    /**
+     * Generate unique node ID.
+     */
+    private generateNodeId;
+    /**
+     * Generate unique edge ID.
+     */
+    private generateEdgeId;
+}
+//# sourceMappingURL=GraphBuilder.d.ts.map

package/dist/code-intelligence/graph/GraphBuilder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphBuilder.d.ts","sourceRoot":"","sources":["../../../src/code-intelligence/graph/GraphBuilder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EACL,SAAS,EACT,SAAS,EAET,kBAAkB,EAClB,UAAU,EACV,UAAU,EACV,gBAAgB,EAChB,QAAQ,EACR,QAAQ,EAET,MAAM,YAAY,CAAC;AAEpB,qBAAa,YAAY;IACvB,OAAO,CAAC,MAAM,CAAqB;IACnC,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,aAAa,CAAa;IAClC,OAAO,CAAC,aAAa,CAAa;gBAEtB,MAAM,GAAE,OAAO,CAAC,kBAAkB,CAAM;IAKpD;;OAEG;IACH,OAAO,CACL,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,EAChB,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GACvC,SAAS;IA4BZ;;OAEG;IACH,OAAO,CACL,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,QAAQ,EACd,MAAM,GAAE,MAAY,EACpB,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GACvC,SAAS,GAAG,IAAI;IA+BnB;;OAEG;IACH,gBAAgB,CACd,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,SAAS,GAAE,MAAU,EACrB,OAAO,GAAE,MAAU,EACnB,QAAQ,GAAE,MAAkB,GAC3B,SAAS;IASZ;;OAEG;IACH,QAAQ,CACN,KAAK,EAAE,MAAM,EACb,QAAQ,CAAC,EAAE,MAAM,EACjB,IAAI,CAAC,EAAE,QAAQ,GACd,SAAS,GAAG,SAAS;IAUxB;;OAEG;IACH,eAAe,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,EAAE;IAK5C;;OAEG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE;IAO9C;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE;IAO7C;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE;IAO7C;;OAEG;IACH,YAAY,CACV,MAAM,EAAE,MAAM,EACd,SAAS,GAAE,UAAU,GAAG,UAAU,GAAG,MAAe,GACnD,SAAS,EAAE;IA+Bd;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,UAAU,GAAG,gBAAgB;IAgE1C;;OAEG;IACH,QAAQ,CACN,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,QAAQ,GAAE,MAAU,GACnB,SAAS,EAAE,GAAG,IAAI;IAiCrB;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAyBnC;;OAEG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAYpC;;OAEG;IACH,QAAQ,IAAI,UAAU;IAiCtB;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS;IAI1C;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS;IAI1C;;OAEG;IACH,WAAW,IAAI,SAAS,EAAE;IAI1B;;OAEG;IACH,WAAW,IAAI,SAAS,EAAE;IAI1B;;OAEG;IACH,KAAK,IAAI,IAAI;IAMb;;OAEG;IACH,SAAS,IAAI,kBAAkB;IAI/B;;OAEG;IACH,WAAW,IAAI;QACb,KAAK,EAAE,SAAS,EAAE,CAAC;QACnB,KAAK,EAAE,SAAS,EAAE,CAAC;KACpB;IAOD;;OAEG;IACH,WAAW,CAAC,IAAI,EAAE;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,GAAG,IAAI;IA2BnE;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAUxB;;OAEG;IACH,OAAO,CAAC,cAAc;IAItB;;OAEG;IACH,OAAO,CAAC,cAAc;CAGvB"}

package/dist/code-intelligence/graph/GraphBuilder.js

@@ -0,0 +1,416 @@
+"use strict";
+/**
+ * Code Graph Builder
+ *
+ * Constructs a knowledge graph of code relationships:
+ * - Import/export dependencies
+ * - Class inheritance hierarchies
+ * - Function call graphs
+ * - Type usage relationships
+ *
+ * Integrates with AST parsing for accurate extraction.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphBuilder = void 0;
+const types_js_1 = require("./types.js");
+class GraphBuilder {
+    constructor(config = {}) {
+        this.nodeIdCounter = 0;
+        this.edgeIdCounter = 0;
+        this.config = { ...types_js_1.DEFAULT_GRAPH_BUILDER_CONFIG, ...config };
+        this.graph = this.createEmptyGraph();
+    }
+    /**
+     * Add a node to the graph.
+     */
+    addNode(type, label, filePath, startLine, endLine, language, properties = {}) {
+        const id = this.generateNodeId();
+        const node = {
+            id,
+            type,
+            label,
+            filePath,
+            startLine,
+            endLine,
+            language,
+            properties,
+        };
+        this.graph.nodes.set(id, node);
+        // Update file index
+        const fileNodes = this.graph.fileNodes.get(filePath) || [];
+        fileNodes.push(id);
+        this.graph.fileNodes.set(filePath, fileNodes);
+        // Initialize edge lists
+        this.graph.outgoingEdges.set(id, []);
+        this.graph.incomingEdges.set(id, []);
+        return node;
+    }
+    /**
+     * Add an edge between nodes.
+     */
+    addEdge(sourceId, targetId, type, weight = 1.0, properties = {}) {
+        // Verify nodes exist
+        if (!this.graph.nodes.has(sourceId) || !this.graph.nodes.has(targetId)) {
+            return null;
+        }
+        const id = this.generateEdgeId();
+        const edge = {
+            id,
+            source: sourceId,
+            target: targetId,
+            type,
+            weight,
+            properties,
+        };
+        this.graph.edges.set(id, edge);
+        // Update indices
+        const outgoing = this.graph.outgoingEdges.get(sourceId) || [];
+        outgoing.push(id);
+        this.graph.outgoingEdges.set(sourceId, outgoing);
+        const incoming = this.graph.incomingEdges.get(targetId) || [];
+        incoming.push(id);
+        this.graph.incomingEdges.set(targetId, incoming);
+        return edge;
+    }
+    /**
+     * Find or create a node by label and file.
+     */
+    findOrCreateNode(type, label, filePath, startLine = 0, endLine = 0, language = 'unknown') {
+        // Try to find existing node
+        const existing = this.findNode(label, filePath, type);
+        if (existing)
+            return existing;
+        // Create new node
+        return this.addNode(type, label, filePath, startLine, endLine, language);
+    }
+    /**
+     * Find a node by label and optional filters.
+     */
+    findNode(label, filePath, type) {
+        for (const node of this.graph.nodes.values()) {
+            if (node.label !== label)
+                continue;
+            if (filePath && node.filePath !== filePath)
+                continue;
+            if (type && node.type !== type)
+                continue;
+            return node;
+        }
+        return undefined;
+    }
+    /**
+     * Find nodes by type.
+     */
+    findNodesByType(type) {
+        return Array.from(this.graph.nodes.values())
+            .filter(n => n.type === type);
+    }
+    /**
+     * Find nodes in a file.
+     */
+    findNodesInFile(filePath) {
+        const nodeIds = this.graph.fileNodes.get(filePath) || [];
+        return nodeIds
+            .map(id => this.graph.nodes.get(id))
+            .filter((n) => n !== undefined);
+    }
+    /**
+     * Get outgoing edges for a node.
+     */
+    getOutgoingEdges(nodeId) {
+        const edgeIds = this.graph.outgoingEdges.get(nodeId) || [];
+        return edgeIds
+            .map(id => this.graph.edges.get(id))
+            .filter((e) => e !== undefined);
+    }
+    /**
+     * Get incoming edges for a node.
+     */
+    getIncomingEdges(nodeId) {
+        const edgeIds = this.graph.incomingEdges.get(nodeId) || [];
+        return edgeIds
+            .map(id => this.graph.edges.get(id))
+            .filter((e) => e !== undefined);
+    }
+    /**
+     * Get neighbors of a node.
+     */
+    getNeighbors(nodeId, direction = 'both') {
+        const neighbors = [];
+        const seen = new Set();
+        if (direction === 'outgoing' || direction === 'both') {
+            for (const edge of this.getOutgoingEdges(nodeId)) {
+                if (!seen.has(edge.target)) {
+                    const node = this.graph.nodes.get(edge.target);
+                    if (node) {
+                        neighbors.push(node);
+                        seen.add(edge.target);
+                    }
+                }
+            }
+        }
+        if (direction === 'incoming' || direction === 'both') {
+            for (const edge of this.getIncomingEdges(nodeId)) {
+                if (!seen.has(edge.source)) {
+                    const node = this.graph.nodes.get(edge.source);
+                    if (node) {
+                        neighbors.push(node);
+                        seen.add(edge.source);
+                    }
+                }
+            }
+        }
+        return neighbors;
+    }
+    /**
+     * Query the graph with traversal.
+     */
+    query(query) {
+        const startTime = Date.now();
+        const resultNodes = [];
+        const resultEdges = [];
+        const visited = new Set();
+        // Get starting nodes
+        let startNodes = [];
+        if (query.startNode) {
+            const node = this.graph.nodes.get(query.startNode);
+            if (node)
+                startNodes = [node];
+        }
+        else if (query.nodeType) {
+            startNodes = this.findNodesByType(query.nodeType);
+        }
+        else {
+            startNodes = Array.from(this.graph.nodes.values());
+        }
+        // BFS traversal
+        const queue = startNodes.map(n => ({ node: n, depth: 0 }));
+        while (queue.length > 0 && resultNodes.length < query.limit) {
+            const { node, depth } = queue.shift();
+            if (visited.has(node.id))
+                continue;
+            visited.add(node.id);
+            // Check node type filter
+            if (!query.nodeType || node.type === query.nodeType) {
+                resultNodes.push(node);
+            }
+            // Continue traversal if within depth
+            if (depth < query.maxDepth) {
+                const edges = query.direction === 'incoming'
+                    ? this.getIncomingEdges(node.id)
+                    : query.direction === 'outgoing'
+                        ? this.getOutgoingEdges(node.id)
+                        : [...this.getOutgoingEdges(node.id), ...this.getIncomingEdges(node.id)];
+                for (const edge of edges) {
+                    // Check edge type filter
+                    if (query.edgeType && edge.type !== query.edgeType)
+                        continue;
+                    resultEdges.push(edge);
+                    const nextId = edge.source === node.id ? edge.target : edge.source;
+                    const nextNode = this.graph.nodes.get(nextId);
+                    if (nextNode && !visited.has(nextId)) {
+                        queue.push({ node: nextNode, depth: depth + 1 });
+                    }
+                }
+            }
+        }
+        return {
+            nodes: resultNodes.slice(0, query.limit),
+            edges: resultEdges,
+            executionTimeMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Find path between two nodes.
+     */
+    findPath(startId, endId, maxDepth = 5) {
+        if (!this.graph.nodes.has(startId) || !this.graph.nodes.has(endId)) {
+            return null;
+        }
+        const visited = new Set();
+        const queue = [
+            { nodeId: startId, path: [startId] }
+        ];
+        while (queue.length > 0) {
+            const { nodeId, path } = queue.shift();
+            if (nodeId === endId) {
+                return path.map(id => this.graph.nodes.get(id));
+            }
+            if (visited.has(nodeId) || path.length > maxDepth)
+                continue;
+            visited.add(nodeId);
+            for (const edge of this.getOutgoingEdges(nodeId)) {
+                if (!visited.has(edge.target)) {
+                    queue.push({
+                        nodeId: edge.target,
+                        path: [...path, edge.target],
+                    });
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * Remove a node and its edges.
+     */
+    removeNode(nodeId) {
+        const node = this.graph.nodes.get(nodeId);
+        if (!node)
+            return false;
+        // Remove all edges
+        for (const edgeId of this.graph.outgoingEdges.get(nodeId) || []) {
+            this.graph.edges.delete(edgeId);
+        }
+        for (const edgeId of this.graph.incomingEdges.get(nodeId) || []) {
+            this.graph.edges.delete(edgeId);
+        }
+        // Remove from file index
+        const fileNodes = this.graph.fileNodes.get(node.filePath) || [];
+        const index = fileNodes.indexOf(nodeId);
+        if (index !== -1)
+            fileNodes.splice(index, 1);
+        // Remove node
+        this.graph.nodes.delete(nodeId);
+        this.graph.outgoingEdges.delete(nodeId);
+        this.graph.incomingEdges.delete(nodeId);
+        return true;
+    }
+    /**
+     * Remove all nodes from a file.
+     */
+    removeFile(filePath) {
+        const nodeIds = this.graph.fileNodes.get(filePath) || [];
+        let removed = 0;
+        for (const nodeId of [...nodeIds]) {
+            if (this.removeNode(nodeId))
+                removed++;
+        }
+        this.graph.fileNodes.delete(filePath);
+        return removed;
+    }
+    /**
+     * Get graph statistics.
+     */
+    getStats() {
+        const nodesByType = {};
+        const edgesByType = {};
+        const edgeCounts = [];
+        for (const node of this.graph.nodes.values()) {
+            nodesByType[node.type] = (nodesByType[node.type] || 0) + 1;
+            const edgeCount = (this.graph.outgoingEdges.get(node.id)?.length || 0) +
+                (this.graph.incomingEdges.get(node.id)?.length || 0);
+            edgeCounts.push({ nodeId: node.id, edgeCount });
+        }
+        for (const edge of this.graph.edges.values()) {
+            edgesByType[edge.type] = (edgesByType[edge.type] || 0) + 1;
+        }
+        edgeCounts.sort((a, b) => b.edgeCount - a.edgeCount);
+        return {
+            nodeCount: this.graph.nodes.size,
+            edgeCount: this.graph.edges.size,
+            nodesByType: nodesByType,
+            edgesByType: edgesByType,
+            fileCount: this.graph.fileNodes.size,
+            avgEdgesPerNode: this.graph.nodes.size > 0
+                ? this.graph.edges.size * 2 / this.graph.nodes.size
+                : 0,
+            mostConnected: edgeCounts.slice(0, 10),
+        };
+    }
+    /**
+     * Get node by ID.
+     */
+    getNode(id) {
+        return this.graph.nodes.get(id);
+    }
+    /**
+     * Get edge by ID.
+     */
+    getEdge(id) {
+        return this.graph.edges.get(id);
+    }
+    /**
+     * Get all nodes.
+     */
+    getAllNodes() {
+        return Array.from(this.graph.nodes.values());
+    }
+    /**
+     * Get all edges.
+     */
+    getAllEdges() {
+        return Array.from(this.graph.edges.values());
+    }
+    /**
+     * Clear the graph.
+     */
+    clear() {
+        this.graph = this.createEmptyGraph();
+        this.nodeIdCounter = 0;
+        this.edgeIdCounter = 0;
+    }
+    /**
+     * Get configuration.
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+    /**
+     * Export graph for persistence.
+     */
+    exportGraph() {
+        return {
+            nodes: Array.from(this.graph.nodes.values()),
+            edges: Array.from(this.graph.edges.values()),
+        };
+    }
+    /**
+     * Import graph from persistence.
+     */
+    importGraph(data) {
+        this.clear();
+        for (const node of data.nodes) {
+            this.graph.nodes.set(node.id, node);
+            const fileNodes = this.graph.fileNodes.get(node.filePath) || [];
+            fileNodes.push(node.id);
+            this.graph.fileNodes.set(node.filePath, fileNodes);
+            this.graph.outgoingEdges.set(node.id, []);
+            this.graph.incomingEdges.set(node.id, []);
+        }
+        for (const edge of data.edges) {
+            this.graph.edges.set(edge.id, edge);
+            const outgoing = this.graph.outgoingEdges.get(edge.source) || [];
+            outgoing.push(edge.id);
+            this.graph.outgoingEdges.set(edge.source, outgoing);
+            const incoming = this.graph.incomingEdges.get(edge.target) || [];
+            incoming.push(edge.id);
+            this.graph.incomingEdges.set(edge.target, incoming);
+        }
+    }
+    /**
+     * Create empty graph structure.
+     */
+    createEmptyGraph() {
+        return {
+            nodes: new Map(),
+            edges: new Map(),
+            outgoingEdges: new Map(),
+            incomingEdges: new Map(),
+            fileNodes: new Map(),
+        };
+    }
+    /**
+     * Generate unique node ID.
+     */
+    generateNodeId() {
+        return `node_${++this.nodeIdCounter}`;
+    }
+    /**
+     * Generate unique edge ID.
+     */
+    generateEdgeId() {
+        return `edge_${++this.edgeIdCounter}`;
+    }
+}
+exports.GraphBuilder = GraphBuilder;
+//# sourceMappingURL=GraphBuilder.js.map

package/dist/code-intelligence/graph/GraphBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphBuilder.js","sourceRoot":"","sources":["../../../src/code-intelligence/graph/GraphBuilder.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAEH,yCAWoB;AAEpB,MAAa,YAAY;IAMvB,YAAY,SAAsC,EAAE;QAH5C,kBAAa,GAAW,CAAC,CAAC;QAC1B,kBAAa,GAAW,CAAC,CAAC;QAGhC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,uCAA4B,EAAE,GAAG,MAAM,EAAE,CAAC;QAC7D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,OAAO,CACL,IAAc,EACd,KAAa,EACb,QAAgB,EAChB,SAAiB,EACjB,OAAe,EACf,QAAgB,EAChB,aAAsC,EAAE;QAExC,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAEjC,MAAM,IAAI,GAAc;YACtB,EAAE;YACF,IAAI;YACJ,KAAK;YACL,QAAQ;YACR,SAAS;YACT,OAAO;YACP,QAAQ;YACR,UAAU;SACX,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,oBAAoB;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC3D,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE9C,wBAAwB;QACxB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAErC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CACL,QAAgB,EAChB,QAAgB,EAChB,IAAc,EACd,SAAiB,GAAG,EACpB,aAAsC,EAAE;QAExC,qBAAqB;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAEjC,MAAM,IAAI,GAAc;YACtB,EAAE;YACF,MAAM,EAAE,QAAQ;YAChB,MAAM,EAAE,QAAQ;YAChB,IAAI;YACJ,MAAM;YACN,UAAU;SACX,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,iBAAiB;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC9D,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEjD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC9D,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEjD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,IAAc,EACd,KAAa,EACb,QAAgB,EAChB,YAAoB,CAAC,EACrB,UAAkB,CAAC,EACnB,WAAmB,SAAS;QAE5B,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QACtD,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAE9B,kBAAkB;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3E,CAAC;IAED;;OAEG;IACH,QAAQ,CACN,KAAa,EACb,QAAiB,EACjB,IAAe;QAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK;gBAAE,SAAS;YACnC,IAAI,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBAAE,SAAS;YACrD,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,SAAS;YACzC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,IAAc;QAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;aACzC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,QAAgB;QAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACzD,OAAO,OAAO;aACX,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3D,OAAO,OAAO;aACX,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3D,OAAO,OAAO;aACX,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,YAAY,CACV,MAAc,EACd,YAA8C,MAAM;QAEpD,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC/C,IAAI,IAAI,EAAE,CAAC;wBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC/C,IAAI,IAAI,EAAE,CAAC;wBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAiB;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,qBAAqB;QACrB,IAAI,UAAU,GAAgB,EAAE,CAAC;QAEjC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,IAAI;gBAAE,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC1B,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,gBAAgB;QAChB,MAAM,KAAK,GACT,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE/C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5D,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEvC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAErB,yBAAyB;YACzB,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;YAED,qCAAqC;YACrC,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,KAAK,UAAU;oBAC1C,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,CAAC,CAAC,KAAK,CAAC,SAAS,KAAK,UAAU;wBAChC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;wBAChC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE3E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,yBAAyB;oBACzB,IAAI,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,QAAQ;wBAAE,SAAS;oBAE7D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAEvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAE9C,IAAI,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBACrC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC;YACxC,KAAK,EAAE,WAAW;YAClB,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACxC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,QAAQ,CACN,OAAe,EACf,KAAa,EACb,WAAmB,CAAC;QAEpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA8C;YACvD,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;SACrC,CAAC;QAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAExC,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;YACnD,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ;gBAAE,SAAS;YAC5D,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,IAAI,CAAC,MAAM;wBACnB,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC;qBAC7B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAc;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,mBAAmB;QACnB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAChE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAChE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;QAED,yBAAyB;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAChE,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAE7C,cAAc;QACd,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAExC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,QAAgB;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACzD,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,MAAM,UAAU,GAAiD,EAAE,CAAC;QAEpE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAE3D,MAAM,SAAS,GACb,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;gBACpD,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;YACvD,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;QAClD,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,CAAC;QAED,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAErD,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;YAChC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;YAChC,WAAW,EAAE,WAAuC;YACpD,WAAW,EAAE,WAAuC;YACpD,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI;YACpC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;gBACxC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;gBACnD,CAAC,CAAC,CAAC;YACL,aAAa,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACvC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACrC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,WAAW;QAIT,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC5C,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SAC7C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,IAAgD;QAC1D,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAEpC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEnD,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAEpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACjE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAEpD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACjE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,OAAO;YACL,KAAK,EAAE,IAAI,GAAG,EAAE;YAChB,KAAK,EAAE,IAAI,GAAG,EAAE;YAChB,aAAa,EAAE,IAAI,GAAG,EAAE;YACxB,aAAa,EAAE,IAAI,GAAG,EAAE;YACxB,SAAS,EAAE,IAAI,GAAG,EAAE;SACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,OAAO,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,OAAO,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC;IACxC,CAAC;CACF;AApfD,oCAofC"}

package/dist/code-intelligence/graph/ImportParser.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Import Parser
+ *
+ * Parses import/require statements from source code
+ * to build the IMPORTS relationship in the graph.
+ */
+export interface ParsedImport {
+    /** Import type */
+    type: 'named' | 'default' | 'namespace' | 'side-effect' | 'require' | 'dynamic';
+    /** Module specifier (e.g., './utils' or 'lodash') */
+    moduleSpecifier: string;
+    /** Imported names (for named imports) */
+    importedNames: string[];
+    /** Local alias (for default/namespace imports) */
+    localName?: string;
+    /** Whether this is a type-only import (TypeScript) */
+    isTypeOnly: boolean;
+    /** Line number in source */
+    line: number;
+}
+export interface ResolvedImport extends ParsedImport {
+    /** Resolved absolute file path */
+    resolvedPath?: string;
+    /** Whether the import is external (node_modules) */
+    isExternal: boolean;
+    /** Whether the import is relative */
+    isRelative: boolean;
+}
+export declare class ImportParser {
+    private readonly patterns;
+    /**
+     * Parse imports from source code.
+     */
+    parseImports(content: string, language: string): ParsedImport[];
+    /**
+     * Resolve import path to absolute file path.
+     */
+    resolveImportPath(imp: ParsedImport, sourceFilePath: string, projectRoot?: string): string | null;
+    /**
+     * Check if a module specifier is an external package.
+     */
+    isExternalPackage(moduleSpecifier: string): boolean;
+    /**
+     * Parse JavaScript/TypeScript imports.
+     */
+    private parseJavaScriptImports;
+    /**
+     * Parse Python imports.
+     */
+    private parsePythonImports;
+    /**
+     * Parse Go imports.
+     */
+    private parseGoImports;
+    /**
+     * Parse Rust use statements.
+     */
+    private parseRustImports;
+    /**
+     * Parse named import list (e.g., "foo, bar as baz").
+     */
+    private parseNamedImportList;
+    /**
+     * Get line number from character index.
+     */
+    private getLineNumber;
+    /**
+     * Get line content from character index.
+     */
+    private getLine;
+}
+//# sourceMappingURL=ImportParser.d.ts.map

package/dist/code-intelligence/graph/ImportParser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ImportParser.d.ts","sourceRoot":"","sources":["../../../src/code-intelligence/graph/ImportParser.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,WAAW,YAAY;IAC3B,kBAAkB;IAClB,IAAI,EAAE,OAAO,GAAG,SAAS,GAAG,WAAW,GAAG,aAAa,GAAG,SAAS,GAAG,SAAS,CAAC;IAEhF,qDAAqD;IACrD,eAAe,EAAE,MAAM,CAAC;IAExB,yCAAyC;IACzC,aAAa,EAAE,MAAM,EAAE,CAAC;IAExB,kDAAkD;IAClD,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,sDAAsD;IACtD,UAAU,EAAE,OAAO,CAAC;IAEpB,4BAA4B;IAC5B,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,cAAe,SAAQ,YAAY;IAClD,kCAAkC;IAClC,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB,oDAAoD;IACpD,UAAU,EAAE,OAAO,CAAC;IAEpB,qCAAqC;IACrC,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,qBAAa,YAAY;IAEvB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAuCvB;IAEF;;OAEG;IACH,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,YAAY,EAAE;IAuB/D;;OAEG;IACH,iBAAiB,CACf,GAAG,EAAE,YAAY,EACjB,cAAc,EAAE,MAAM,EACtB,WAAW,GAAE,MAAY,GACxB,MAAM,GAAG,IAAI;IAoChB;;OAEG;IACH,iBAAiB,CAAC,eAAe,EAAE,MAAM,GAAG,OAAO;IAkCnD;;OAEG;IACH,OAAO,CAAC,sBAAsB;IA+I9B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IA8C1B;;OAEG;IACH,OAAO,CAAC,cAAc;IAoCtB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAsBxB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAY5B;;OAEG;IACH,OAAO,CAAC,aAAa;IAIrB;;OAEG;IACH,OAAO,CAAC,OAAO;CAKhB"}