@nahisaho/musubix-dfg 1.8.5

package/dist/graph/index.js

@@ -0,0 +1,552 @@
+/**
+ * Graph data structures for DFG/CFG
+ *
+ * @packageDocumentation
+ * @module @nahisaho/musubix-dfg/graph
+ */
+// ============================================================================
+// Data Flow Graph Implementation
+// ============================================================================
+/**
+ * Data Flow Graph builder and analyzer
+ *
+ * @example
+ * ```typescript
+ * const dfg = new DFGBuilder('module.ts');
+ * dfg.addNode({ id: 'n1', type: 'variable', name: 'x', ... });
+ * dfg.addEdge({ id: 'e1', type: 'def-use', source: 'n1', target: 'n2', ... });
+ * const graph = dfg.build();
+ * ```
+ */
+export class DFGBuilder {
+    filePath;
+    id;
+    nodes = new Map();
+    edges = new Map();
+    entryPoints = [];
+    exitPoints = [];
+    nodeCounter = 0;
+    edgeCounter = 0;
+    constructor(filePath, id = `dfg-${Date.now()}`) {
+        this.filePath = filePath;
+        this.id = id;
+    }
+    /**
+     * Generate unique node ID
+     */
+    generateNodeId(prefix = 'n') {
+        return `${prefix}_${++this.nodeCounter}`;
+    }
+    /**
+     * Generate unique edge ID
+     */
+    generateEdgeId(prefix = 'e') {
+        return `${prefix}_${++this.edgeCounter}`;
+    }
+    /**
+     * Add a node to the graph
+     */
+    addNode(node) {
+        this.nodes.set(node.id, node);
+        return this;
+    }
+    /**
+     * Add an edge to the graph
+     */
+    addEdge(edge) {
+        this.edges.set(edge.id, edge);
+        return this;
+    }
+    /**
+     * Add entry point
+     */
+    addEntryPoint(nodeId) {
+        if (!this.entryPoints.includes(nodeId)) {
+            this.entryPoints.push(nodeId);
+        }
+        return this;
+    }
+    /**
+     * Add exit point
+     */
+    addExitPoint(nodeId) {
+        if (!this.exitPoints.includes(nodeId)) {
+            this.exitPoints.push(nodeId);
+        }
+        return this;
+    }
+    /**
+     * Get node by ID
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * Get edge by ID
+     */
+    getEdge(id) {
+        return this.edges.get(id);
+    }
+    /**
+     * Get outgoing edges from a node
+     */
+    getOutgoingEdges(nodeId) {
+        return Array.from(this.edges.values()).filter((e) => e.source === nodeId);
+    }
+    /**
+     * Get incoming edges to a node
+     */
+    getIncomingEdges(nodeId) {
+        return Array.from(this.edges.values()).filter((e) => e.target === nodeId);
+    }
+    /**
+     * Build the final DataFlowGraph
+     */
+    build() {
+        return {
+            id: this.id,
+            filePath: this.filePath,
+            nodes: new Map(this.nodes),
+            edges: new Map(this.edges),
+            entryPoints: [...this.entryPoints],
+            exitPoints: [...this.exitPoints],
+            metadata: {
+                analyzedAt: new Date(),
+                languageVersion: 'TypeScript 5.x',
+                nodeCount: this.nodes.size,
+                edgeCount: this.edges.size,
+            },
+        };
+    }
+}
+/**
+ * Data Flow Graph query and analysis utilities
+ */
+export class DFGAnalyzer {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Find all paths from source to target
+     */
+    findPaths(sourceId, targetId, maxPaths = 100) {
+        const paths = [];
+        const visited = new Set();
+        const dfs = (current, path) => {
+            if (paths.length >= maxPaths)
+                return;
+            if (current === targetId) {
+                const sourceNode = this.graph.nodes.get(sourceId);
+                const targetNode = this.graph.nodes.get(targetId);
+                if (sourceNode && targetNode) {
+                    paths.push({
+                        source: sourceNode,
+                        chain: [...path],
+                        target: targetNode,
+                        length: path.length,
+                    });
+                }
+                return;
+            }
+            if (visited.has(current))
+                return;
+            visited.add(current);
+            const outEdges = this.getOutgoingEdges(current);
+            for (const edge of outEdges) {
+                dfs(edge.target, [...path, edge]);
+            }
+            visited.delete(current);
+        };
+        dfs(sourceId, []);
+        return paths;
+    }
+    /**
+     * Get outgoing edges from a node
+     */
+    getOutgoingEdges(nodeId) {
+        return Array.from(this.graph.edges.values()).filter((e) => e.source === nodeId);
+    }
+    /**
+     * Get incoming edges to a node
+     */
+    getIncomingEdges(nodeId) {
+        return Array.from(this.graph.edges.values()).filter((e) => e.target === nodeId);
+    }
+    /**
+     * Get all data dependencies for a variable
+     */
+    getDataDependencies(variableName) {
+        const results = [];
+        const definitions = new Map();
+        const uses = new Map();
+        // Find all definitions
+        for (const node of this.graph.nodes.values()) {
+            if (node.name === variableName) {
+                if (node.type === 'variable' ||
+                    node.type === 'parameter' ||
+                    node.type === 'assignment') {
+                    definitions.set(node.id, node);
+                    uses.set(node.id, []);
+                }
+            }
+        }
+        // Find all uses via def-use edges
+        for (const edge of this.graph.edges.values()) {
+            if (edge.type === 'def-use' && definitions.has(edge.source)) {
+                const useNode = this.graph.nodes.get(edge.target);
+                if (useNode) {
+                    uses.get(edge.source)?.push(useNode);
+                }
+            }
+        }
+        // Build results
+        for (const [defId, defNode] of definitions) {
+            const nodeUses = uses.get(defId) || [];
+            results.push({
+                variable: variableName,
+                definition: defNode,
+                uses: nodeUses,
+                isDeadCode: nodeUses.length === 0,
+            });
+        }
+        return results;
+    }
+    /**
+     * Find taint propagation from source
+     */
+    findTaintPropagation(sourceId) {
+        const tainted = new Set();
+        const queue = [sourceId];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (tainted.has(current))
+                continue;
+            tainted.add(current);
+            const outEdges = this.getOutgoingEdges(current);
+            for (const edge of outEdges) {
+                if (edge.type === 'def-use' ||
+                    edge.type === 'data-dep' ||
+                    edge.type === 'alias') {
+                    queue.push(edge.target);
+                }
+            }
+        }
+        return Array.from(tainted)
+            .map((id) => this.graph.nodes.get(id))
+            .filter((n) => n !== undefined);
+    }
+    /**
+     * Find dead code (definitions without uses)
+     */
+    findDeadCode() {
+        const dead = [];
+        for (const node of this.graph.nodes.values()) {
+            if (node.type === 'variable' ||
+                node.type === 'assignment') {
+                const outEdges = this.getOutgoingEdges(node.id);
+                const hasUse = outEdges.some((e) => e.type === 'def-use');
+                if (!hasUse) {
+                    dead.push(node);
+                }
+            }
+        }
+        return dead;
+    }
+    /**
+     * Export graph to DOT format for visualization
+     */
+    toDot() {
+        const lines = ['digraph DFG {', '  rankdir=TB;'];
+        // Nodes
+        for (const node of this.graph.nodes.values()) {
+            const label = `${node.name}\\n(${node.type})`;
+            const shape = this.getNodeShape(node.type);
+            lines.push(`  "${node.id}" [label="${label}" shape=${shape}];`);
+        }
+        // Edges
+        for (const edge of this.graph.edges.values()) {
+            const label = edge.label || edge.type;
+            const style = edge.type === 'control-dep' ? 'dashed' : 'solid';
+            lines.push(`  "${edge.source}" -> "${edge.target}" [label="${label}" style=${style}];`);
+        }
+        lines.push('}');
+        return lines.join('\n');
+    }
+    getNodeShape(type) {
+        switch (type) {
+            case 'function':
+            case 'class':
+                return 'box';
+            case 'conditional':
+                return 'diamond';
+            case 'call':
+                return 'parallelogram';
+            default:
+                return 'ellipse';
+        }
+    }
+}
+// ============================================================================
+// Control Flow Graph Implementation
+// ============================================================================
+/**
+ * Control Flow Graph builder
+ */
+export class CFGBuilder {
+    functionName;
+    filePath;
+    id;
+    blocks = new Map();
+    edges = new Map();
+    entryBlock = '';
+    exitBlocks = [];
+    blockCounter = 0;
+    edgeCounter = 0;
+    constructor(functionName, filePath, id = `cfg-${Date.now()}`) {
+        this.functionName = functionName;
+        this.filePath = filePath;
+        this.id = id;
+    }
+    /**
+     * Generate unique block ID
+     */
+    generateBlockId(prefix = 'b') {
+        return `${prefix}_${++this.blockCounter}`;
+    }
+    /**
+     * Generate unique edge ID
+     */
+    generateEdgeId(prefix = 'e') {
+        return `${prefix}_${++this.edgeCounter}`;
+    }
+    /**
+     * Add a basic block
+     */
+    addBlock(block) {
+        this.blocks.set(block.id, block);
+        return this;
+    }
+    /**
+     * Add an edge
+     */
+    addEdge(edge) {
+        this.edges.set(edge.id, edge);
+        // Update predecessor/successor
+        const sourceBlock = this.blocks.get(edge.source);
+        const targetBlock = this.blocks.get(edge.target);
+        if (sourceBlock && !sourceBlock.successors.includes(edge.target)) {
+            sourceBlock.successors.push(edge.target);
+        }
+        if (targetBlock && !targetBlock.predecessors.includes(edge.source)) {
+            targetBlock.predecessors.push(edge.source);
+        }
+        return this;
+    }
+    /**
+     * Set entry block
+     */
+    setEntryBlock(blockId) {
+        this.entryBlock = blockId;
+        return this;
+    }
+    /**
+     * Add exit block
+     */
+    addExitBlock(blockId) {
+        if (!this.exitBlocks.includes(blockId)) {
+            this.exitBlocks.push(blockId);
+        }
+        return this;
+    }
+    /**
+     * Build the final ControlFlowGraph
+     */
+    build() {
+        const cyclomaticComplexity = this.computeCyclomaticComplexity();
+        const maxLoopDepth = this.computeMaxLoopDepth();
+        return {
+            id: this.id,
+            functionName: this.functionName,
+            filePath: this.filePath,
+            entryBlock: this.entryBlock,
+            exitBlocks: [...this.exitBlocks],
+            blocks: new Map(this.blocks),
+            edges: new Map(this.edges),
+            metadata: {
+                analyzedAt: new Date(),
+                cyclomaticComplexity,
+                maxLoopDepth,
+                blockCount: this.blocks.size,
+                edgeCount: this.edges.size,
+            },
+        };
+    }
+    computeCyclomaticComplexity() {
+        // M = E - N + 2P (for single connected component, P=1)
+        return this.edges.size - this.blocks.size + 2;
+    }
+    computeMaxLoopDepth() {
+        let maxDepth = 0;
+        for (const block of this.blocks.values()) {
+            if (block.loopDepth > maxDepth) {
+                maxDepth = block.loopDepth;
+            }
+        }
+        return maxDepth;
+    }
+}
+/**
+ * Control Flow Graph analyzer
+ */
+export class CFGAnalyzer {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Find all execution paths from entry to exit
+     */
+    findAllPaths(maxPaths = 100) {
+        const paths = [];
+        const visited = new Set();
+        const dfs = (current, path) => {
+            if (paths.length >= maxPaths)
+                return;
+            const block = this.graph.blocks.get(current);
+            if (!block)
+                return;
+            path.blocks.push(block);
+            if (this.graph.exitBlocks.includes(current)) {
+                const conditions = path.edges
+                    .filter((e) => e.condition)
+                    .map((e) => e.condition);
+                paths.push({
+                    id: `path_${paths.length + 1}`,
+                    blocks: [...path.blocks],
+                    edges: [...path.edges],
+                    conditions,
+                    isFeasible: true, // Would need SMT solver for actual feasibility
+                });
+                path.blocks.pop();
+                return;
+            }
+            const pathKey = path.blocks.map((b) => b.id).join(',');
+            if (visited.has(pathKey)) {
+                path.blocks.pop();
+                return;
+            }
+            visited.add(pathKey);
+            const outEdges = this.getOutgoingEdges(current);
+            for (const edge of outEdges) {
+                if (!edge.isBackEdge) {
+                    // Skip back edges to avoid infinite loops
+                    path.edges.push(edge);
+                    dfs(edge.target, path);
+                    path.edges.pop();
+                }
+            }
+            visited.delete(pathKey);
+            path.blocks.pop();
+        };
+        dfs(this.graph.entryBlock, { blocks: [], edges: [] });
+        return paths;
+    }
+    /**
+     * Get outgoing edges from a block
+     */
+    getOutgoingEdges(blockId) {
+        return Array.from(this.graph.edges.values()).filter((e) => e.source === blockId);
+    }
+    /**
+     * Get incoming edges to a block
+     */
+    getIncomingEdges(blockId) {
+        return Array.from(this.graph.edges.values()).filter((e) => e.target === blockId);
+    }
+    /**
+     * Find all loops (natural loops)
+     */
+    findLoops() {
+        const loops = [];
+        // Find back edges
+        const backEdges = Array.from(this.graph.edges.values()).filter((e) => e.isBackEdge);
+        for (const backEdge of backEdges) {
+            const header = this.graph.blocks.get(backEdge.target);
+            if (!header)
+                continue;
+            // Find loop body via reverse DFS from back edge source
+            const body = new Set();
+            const stack = [backEdge.source];
+            while (stack.length > 0) {
+                const current = stack.pop();
+                if (current === backEdge.target)
+                    continue;
+                const block = this.graph.blocks.get(current);
+                if (!block || body.has(block))
+                    continue;
+                body.add(block);
+                for (const predId of block.predecessors) {
+                    stack.push(predId);
+                }
+            }
+            loops.push({
+                header,
+                body: Array.from(body),
+            });
+        }
+        return loops;
+    }
+    /**
+     * Compute cyclomatic complexity
+     */
+    getCyclomaticComplexity() {
+        return this.graph.metadata.cyclomaticComplexity;
+    }
+    /**
+     * Export graph to DOT format
+     */
+    toDot() {
+        const lines = [
+            `digraph CFG_${this.graph.functionName} {`,
+            '  rankdir=TB;',
+        ];
+        // Blocks
+        for (const block of this.graph.blocks.values()) {
+            const label = block.statements.length > 0
+                ? block.statements
+                    .map((s) => s.text.replace(/"/g, '\\"'))
+                    .join('\\n')
+                : block.label;
+            const shape = this.getBlockShape(block.type);
+            const color = block.loopDepth > 0 ? 'lightblue' : 'white';
+            lines.push(`  "${block.id}" [label="${label}" shape=${shape} style=filled fillcolor=${color}];`);
+        }
+        // Edges
+        for (const edge of this.graph.edges.values()) {
+            const label = edge.condition || edge.type;
+            const style = edge.isBackEdge ? 'dashed' : 'solid';
+            const color = edge.isBackEdge ? 'red' : 'black';
+            lines.push(`  "${edge.source}" -> "${edge.target}" [label="${label}" style=${style} color=${color}];`);
+        }
+        lines.push('}');
+        return lines.join('\n');
+    }
+    getBlockShape(type) {
+        switch (type) {
+            case 'entry':
+            case 'exit':
+                return 'ellipse';
+            case 'conditional':
+                return 'diamond';
+            case 'loop-header':
+                return 'hexagon';
+            default:
+                return 'box';
+        }
+    }
+}
+// Re-export
+export { DFGBuilder as DataFlowGraphBuilder };
+export { CFGBuilder as ControlFlowGraphBuilder };
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAgBH,+EAA+E;AAC/E,iCAAiC;AACjC,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAM,OAAO,UAAU;IASF;IACA;IATX,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAC;IACxC,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAC;IACxC,WAAW,GAAa,EAAE,CAAC;IAC3B,UAAU,GAAa,EAAE,CAAC;IAC1B,WAAW,GAAG,CAAC,CAAC;IAChB,WAAW,GAAG,CAAC,CAAC;IAExB,YACmB,QAAgB,EAChB,KAAa,OAAO,IAAI,CAAC,GAAG,EAAE,EAAE;QADhC,aAAQ,GAAR,QAAQ,CAAQ;QAChB,OAAE,GAAF,EAAE,CAA8B;IAChD,CAAC;IAEJ;;OAEG;IACH,cAAc,CAAC,SAAiB,GAAG;QACjC,OAAO,GAAG,MAAM,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,SAAiB,GAAG;QACjC,OAAO,GAAG,MAAM,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAa;QACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAa;QACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,MAAc;QAC1B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc;QACzB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC1B,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC1B,WAAW,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;YAClC,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;YAChC,QAAQ,EAAE;gBACR,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,eAAe,EAAE,gBAAgB;gBACjC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;gBAC1B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;aAC3B;SACF,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,WAAW;IACO;IAA7B,YAA6B,KAAoB;QAApB,UAAK,GAAL,KAAK,CAAe;IAAG,CAAC;IAErD;;OAEG;IACH,SAAS,CACP,QAAgB,EAChB,QAAgB,EAChB,WAAmB,GAAG;QAEtB,MAAM,KAAK,GAA0B,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,MAAM,GAAG,GAAG,CAAC,OAAe,EAAE,IAAe,EAAQ,EAAE;YACrD,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ;gBAAE,OAAO;YAErC,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAClD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAClD,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,UAAU;wBAClB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;wBAChB,MAAM,EAAE,UAAU;wBAClB,MAAM,EAAE,IAAI,CAAC,MAAM;qBACpB,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO;YACT,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,OAAO;YACjC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACpC,CAAC;YAED,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAClB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,YAAoB;QACtC,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;QAE1C,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAC/B,IACE,IAAI,CAAC,IAAI,KAAK,UAAU;oBACxB,IAAI,CAAC,IAAI,KAAK,WAAW;oBACzB,IAAI,CAAC,IAAI,KAAK,YAAY,EAC1B,CAAC;oBACD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAClD,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;YAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ,EAAE,YAAY;gBACtB,UAAU,EAAE,OAAO;gBACnB,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC;aAClC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,QAAgB;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IACE,IAAI,CAAC,IAAI,KAAK,SAAS;oBACvB,IAAI,CAAC,IAAI,KAAK,UAAU;oBACxB,IAAI,CAAC,IAAI,KAAK,OAAO,EACrB,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;aACvB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACrC,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,YAAY;QACV,MAAM,IAAI,GAAc,EAAE,CAAC;QAE3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IACE,IAAI,CAAC,IAAI,KAAK,UAAU;gBACxB,IAAI,CAAC,IAAI,KAAK,YAAY,EAC1B,CAAC;gBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChD,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;gBAC1D,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,KAAK,GAAa,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;QAE3D,QAAQ;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,GAAG,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,aAAa,KAAK,WAAW,KAAK,IAAI,CAAC,CAAC;QAClE,CAAC;QAED,QAAQ;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;YAC/D,KAAK,CAAC,IAAI,CACR,MAAM,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,MAAM,aAAa,KAAK,WAAW,KAAK,IAAI,CAC5E,CAAC;QACJ,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEO,YAAY,CAClB,IAAY;QAEZ,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,UAAU,CAAC;YAChB,KAAK,OAAO;gBACV,OAAO,KAAK,CAAC;YACf,KAAK,aAAa;gBAChB,OAAO,SAAS,CAAC;YACnB,KAAK,MAAM;gBACT,OAAO,eAAe,CAAC;YACzB;gBACE,OAAO,SAAS,CAAC;QACrB,CAAC;IACH,CAAC;CACF;AAED,+EAA+E;AAC/E,oCAAoC;AACpC,+EAA+E;AAE/E;;GAEG;AACH,MAAM,OAAO,UAAU;IASF;IACA;IACA;IAVX,MAAM,GAA0B,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAC;IACxC,UAAU,GAAW,EAAE,CAAC;IACxB,UAAU,GAAa,EAAE,CAAC;IAC1B,YAAY,GAAG,CAAC,CAAC;IACjB,WAAW,GAAG,CAAC,CAAC;IAExB,YACmB,YAAoB,EACpB,QAAgB,EAChB,KAAa,OAAO,IAAI,CAAC,GAAG,EAAE,EAAE;QAFhC,iBAAY,GAAZ,YAAY,CAAQ;QACpB,aAAQ,GAAR,QAAQ,CAAQ;QAChB,OAAE,GAAF,EAAE,CAA8B;IAChD,CAAC;IAEJ;;OAEG;IACH,eAAe,CAAC,SAAiB,GAAG;QAClC,OAAO,GAAG,MAAM,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,SAAiB,GAAG;QACjC,OAAO,GAAG,MAAM,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAe;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAa;QACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE9B,+BAA+B;QAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEjD,IAAI,WAAW,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACjE,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,WAAW,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACnE,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,OAAe;QAC3B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,OAAe;QAC1B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,oBAAoB,GAAG,IAAI,CAAC,2BAA2B,EAAE,CAAC;QAChE,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAEhD,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;YAChC,MAAM,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YAC5B,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC1B,QAAQ,EAAE;gBACR,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,oBAAoB;gBACpB,YAAY;gBACZ,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;gBAC5B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;aAC3B;SACF,CAAC;IACJ,CAAC;IAEO,2BAA2B;QACjC,uDAAuD;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IAChD,CAAC;IAEO,mBAAmB;QACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,SAAS,GAAG,QAAQ,EAAE,CAAC;gBAC/B,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC;YAC7B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,WAAW;IACO;IAA7B,YAA6B,KAAuB;QAAvB,UAAK,GAAL,KAAK,CAAkB;IAAG,CAAC;IAExD;;OAEG;IACH,YAAY,CAAC,WAAmB,GAAG;QACjC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,MAAM,GAAG,GAAG,CACV,OAAe,EACf,IAA8C,EACxC,EAAE;YACR,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ;gBAAE,OAAO;YAErC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK;gBAAE,OAAO;YAEnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAExB,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK;qBAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;qBAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAU,CAAC,CAAC;gBAE5B,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,QAAQ,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;oBAC9B,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;oBACxB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;oBACtB,UAAU;oBACV,UAAU,EAAE,IAAI,EAAE,+CAA+C;iBAClE,CAAC,CAAC;gBACH,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;gBAClB,OAAO;YACT,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvD,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;gBAClB,OAAO;YACT,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;oBACrB,0CAA0C;oBAC1C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACtB,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBACvB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;gBACnB,CAAC;YACH,CAAC;YAED,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACtD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,OAAe;QAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,OAAe;QAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,MAAM,KAAK,GAAkD,EAAE,CAAC;QAEhE,kBAAkB;QAClB,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC5D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CACpB,CAAC;QAEF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACtD,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,uDAAuD;YACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAY,CAAC;YACjC,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAE1C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBAC7B,IAAI,OAAO,KAAK,QAAQ,CAAC,MAAM;oBAAE,SAAS;gBAE1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC7C,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAExC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAChB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;oBACxC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,MAAM;gBACN,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;aACvB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,uBAAuB;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,oBAAoB,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,KAAK,GAAa;YACtB,eAAe,IAAI,CAAC,KAAK,CAAC,YAAY,IAAI;YAC1C,eAAe;SAChB,CAAC;QAEF,SAAS;QACT,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GACT,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;gBACzB,CAAC,CAAC,KAAK,CAAC,UAAU;qBACb,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;qBACvC,IAAI,CAAC,KAAK,CAAC;gBAChB,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;YAC1D,KAAK,CAAC,IAAI,CACR,MAAM,KAAK,CAAC,EAAE,aAAa,KAAK,WAAW,KAAK,2BAA2B,KAAK,IAAI,CACrF,CAAC;QACJ,CAAC;QAED,QAAQ;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;YACnD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;YAChD,KAAK,CAAC,IAAI,CACR,MAAM,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,MAAM,aAAa,KAAK,WAAW,KAAK,UAAU,KAAK,IAAI,CAC3F,CAAC;QACJ,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEO,aAAa,CAAC,IAAY;QAChC,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,OAAO,CAAC;YACb,KAAK,MAAM;gBACT,OAAO,SAAS,CAAC;YACnB,KAAK,aAAa;gBAChB,OAAO,SAAS,CAAC;YACnB,KAAK,aAAa;gBAChB,OAAO,SAAS,CAAC;YACnB;gBACE,OAAO,KAAK,CAAC;QACjB,CAAC;IACH,CAAC;CACF;AAED,YAAY;AACZ,OAAO,EAAE,UAAU,IAAI,oBAAoB,EAAE,CAAC;AAC9C,OAAO,EAAE,UAAU,IAAI,uBAAuB,EAAE,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,35 @@
+/**
+ * @nahisaho/musubix-dfg
+ *
+ * Data Flow Graph (DFG) and Control Flow Graph (CFG) analysis
+ * for MUSUBIX neuro-symbolic code understanding.
+ *
+ * @packageDocumentation
+ * @module @nahisaho/musubix-dfg
+ *
+ * @example
+ * ```typescript
+ * import { DataFlowAnalyzer, ControlFlowAnalyzer } from '@nahisaho/musubix-dfg';
+ *
+ * // Analyze TypeScript code
+ * const dfgAnalyzer = new DataFlowAnalyzer();
+ * const dfg = await dfgAnalyzer.analyze('src/user-service.ts');
+ *
+ * // Get data dependencies
+ * const deps = dfg.getDataDependencies('userId');
+ *
+ * // Analyze control flow
+ * const cfgAnalyzer = new ControlFlowAnalyzer();
+ * const cfg = await cfgAnalyzer.analyze('src/user-service.ts');
+ *
+ * // Get all paths from entry to exit
+ * const paths = cfg.getAllPaths();
+ * ```
+ *
+ * @traces REQ-DFG-001, REQ-DFG-002, REQ-DFG-003
+ */
+export * from './types/index.js';
+export * from './graph/index.js';
+export * from './analyzers/index.js';
+export * from './yata/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAGH,cAAc,kBAAkB,CAAC;AAGjC,cAAc,kBAAkB,CAAC;AAGjC,cAAc,sBAAsB,CAAC;AAGrC,cAAc,iBAAiB,CAAC"}

package/dist/index.js

@@ -0,0 +1,39 @@
+/**
+ * @nahisaho/musubix-dfg
+ *
+ * Data Flow Graph (DFG) and Control Flow Graph (CFG) analysis
+ * for MUSUBIX neuro-symbolic code understanding.
+ *
+ * @packageDocumentation
+ * @module @nahisaho/musubix-dfg
+ *
+ * @example
+ * ```typescript
+ * import { DataFlowAnalyzer, ControlFlowAnalyzer } from '@nahisaho/musubix-dfg';
+ *
+ * // Analyze TypeScript code
+ * const dfgAnalyzer = new DataFlowAnalyzer();
+ * const dfg = await dfgAnalyzer.analyze('src/user-service.ts');
+ *
+ * // Get data dependencies
+ * const deps = dfg.getDataDependencies('userId');
+ *
+ * // Analyze control flow
+ * const cfgAnalyzer = new ControlFlowAnalyzer();
+ * const cfg = await cfgAnalyzer.analyze('src/user-service.ts');
+ *
+ * // Get all paths from entry to exit
+ * const paths = cfg.getAllPaths();
+ * ```
+ *
+ * @traces REQ-DFG-001, REQ-DFG-002, REQ-DFG-003
+ */
+// Types
+export * from './types/index.js';
+// Graph structures
+export * from './graph/index.js';
+// Analyzers
+export * from './analyzers/index.js';
+// YATA integration
+export * from './yata/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,QAAQ;AACR,cAAc,kBAAkB,CAAC;AAEjC,mBAAmB;AACnB,cAAc,kBAAkB,CAAC;AAEjC,YAAY;AACZ,cAAc,sBAAsB,CAAC;AAErC,mBAAmB;AACnB,cAAc,iBAAiB,CAAC"}