driftdetect-core 0.1.0

package/dist/analyzers/ast-analyzer.js

@@ -0,0 +1,548 @@
+/**
+ * AST Analyzer - AST pattern analysis
+ *
+ * Performs AST pattern matching, subtree comparison, and provides
+ * traversal utilities for analyzing code structure.
+ *
+ * @requirements 3.5 - Parser SHALL provide a unified AST query interface across all languages
+ */
+/**
+ * AST Analyzer class for pattern matching and subtree comparison.
+ *
+ * Provides a unified interface for analyzing AST structures across
+ * all supported languages.
+ *
+ * @requirements 3.5 - Unified AST query interface across all languages
+ */
+export class ASTAnalyzer {
+    /**
+     * Find all nodes matching a pattern in the AST.
+     *
+     * @param ast - The AST to search
+     * @param pattern - The pattern to match
+     * @param options - Matching options
+     * @returns Array of pattern match results
+     */
+    findPattern(ast, pattern, options = {}) {
+        const results = [];
+        const { limit, includeNested = true, startPosition, endPosition, minConfidence = 0 } = options;
+        let limitReached = false;
+        this.traverse(ast, (node, _parent, _depth, _path) => {
+            // Check if limit already reached
+            if (limitReached) {
+                return false;
+            }
+            // Check position constraints
+            if (startPosition && !this.isAfterPosition(node.startPosition, startPosition)) {
+                return undefined;
+            }
+            if (endPosition && !this.isBeforePosition(node.endPosition, endPosition)) {
+                return undefined;
+            }
+            // Try to match the pattern
+            const captures = new Map();
+            const confidence = this.matchPattern(node, pattern, captures);
+            if (confidence >= minConfidence && confidence > 0) {
+                results.push({
+                    node,
+                    confidence,
+                    captures,
+                    location: {
+                        start: node.startPosition,
+                        end: node.endPosition,
+                    },
+                });
+                // Check limit after adding
+                if (limit !== undefined && results.length >= limit) {
+                    limitReached = true;
+                    return false;
+                }
+                // If not including nested matches, skip children of matched nodes
+                if (!includeNested) {
+                    return false;
+                }
+            }
+            return undefined;
+        });
+        return results;
+    }
+    /**
+     * Compare two AST subtrees for similarity.
+     *
+     * @param node1 - First subtree root
+     * @param node2 - Second subtree root
+     * @param options - Comparison options
+     * @returns Comparison result with similarity score and differences
+     */
+    compareSubtrees(node1, node2, options = {}) {
+        const differences = [];
+        const stats = { nodesCompared: 0, matchingNodes: 0, differentNodes: 0 };
+        const similarity = this.compareNodes(node1, node2, [], [], options, differences, stats, 0);
+        return {
+            isIdentical: differences.length === 0 && similarity === 1,
+            similarity,
+            differences,
+            stats,
+        };
+    }
+    /**
+     * Get statistics about an AST.
+     *
+     * @param ast - The AST to analyze
+     * @returns Statistics about the AST structure
+     */
+    getStats(ast) {
+        const nodesByType = {};
+        let nodeCount = 0;
+        let maxDepth = 0;
+        let totalChildren = 0;
+        let nonLeafNodes = 0;
+        this.traverse(ast, (node, _parent, depth) => {
+            nodeCount++;
+            maxDepth = Math.max(maxDepth, depth);
+            // Count by type
+            nodesByType[node.type] = (nodesByType[node.type] || 0) + 1;
+            // Track children for average calculation
+            if (node.children.length > 0) {
+                totalChildren += node.children.length;
+                nonLeafNodes++;
+            }
+        });
+        return {
+            nodeCount,
+            nodesByType,
+            maxDepth,
+            avgChildren: nonLeafNodes > 0 ? totalChildren / nonLeafNodes : 0,
+        };
+    }
+    /**
+     * Traverse the AST depth-first, calling the visitor for each node.
+     *
+     * @param ast - The AST to traverse
+     * @param visitor - Function called for each node. Return false to stop traversal of subtree.
+     */
+    traverse(ast, visitor) {
+        this.traverseNode(ast.rootNode, null, 0, [], visitor);
+    }
+    /**
+     * Find all nodes of a specific type in the AST.
+     *
+     * @param ast - The AST to search
+     * @param nodeType - The type of node to find
+     * @returns Array of matching nodes
+     */
+    findNodesByType(ast, nodeType) {
+        const results = [];
+        this.traverse(ast, (node) => {
+            if (node.type === nodeType) {
+                results.push(node);
+            }
+            return undefined;
+        });
+        return results;
+    }
+    /**
+     * Find the first node of a specific type in the AST.
+     *
+     * @param ast - The AST to search
+     * @param nodeType - The type of node to find
+     * @returns The first matching node, or null if not found
+     */
+    findFirstNodeByType(ast, nodeType) {
+        let result = null;
+        this.traverse(ast, (node) => {
+            if (node.type === nodeType) {
+                result = node;
+                return false; // Stop traversal
+            }
+            return undefined;
+        });
+        return result;
+    }
+    /**
+     * Find the node at a specific position in the source.
+     *
+     * @param ast - The AST to search
+     * @param position - The position to find
+     * @returns The most specific node at that position, or null
+     */
+    findNodeAtPosition(ast, position) {
+        let result = null;
+        this.traverse(ast, (node) => {
+            if (this.positionInRange(position, node.startPosition, node.endPosition)) {
+                result = node; // Keep updating to get the most specific (deepest) node
+            }
+            return undefined;
+        });
+        return result;
+    }
+    /**
+     * Get all descendants of a node.
+     *
+     * @param node - The node to get descendants of
+     * @returns Array of all descendant nodes
+     */
+    getDescendants(node) {
+        const descendants = [];
+        const collect = (n) => {
+            for (const child of n.children) {
+                descendants.push(child);
+                collect(child);
+            }
+        };
+        collect(node);
+        return descendants;
+    }
+    /**
+     * Get the depth of a node in the AST.
+     *
+     * @param ast - The AST containing the node
+     * @param targetNode - The node to get depth for
+     * @returns The depth (0 for root), or -1 if not found
+     */
+    getNodeDepth(ast, targetNode) {
+        let foundDepth = -1;
+        this.traverse(ast, (node, _parent, depth) => {
+            if (node === targetNode) {
+                foundDepth = depth;
+                return false;
+            }
+            return undefined;
+        });
+        return foundDepth;
+    }
+    /**
+     * Get the parent chain from root to a specific node.
+     *
+     * @param ast - The AST to search
+     * @param targetNode - The node to find parents for
+     * @returns Array of parent nodes from root to immediate parent
+     */
+    getParentChain(ast, targetNode) {
+        const parents = [];
+        const findParents = (node, chain) => {
+            if (node === targetNode) {
+                parents.push(...chain);
+                return true;
+            }
+            for (const child of node.children) {
+                if (findParents(child, [...chain, node])) {
+                    return true;
+                }
+            }
+            return false;
+        };
+        findParents(ast.rootNode, []);
+        return parents;
+    }
+    /**
+     * Check if a node is a leaf node (has no children).
+     *
+     * @param node - The node to check
+     * @returns true if the node has no children
+     */
+    isLeafNode(node) {
+        return node.children.length === 0;
+    }
+    /**
+     * Analyze an AST and return analysis results.
+     *
+     * @param ast - The AST to analyze
+     * @param patterns - Patterns to search for
+     * @returns Analysis result with matches and statistics
+     */
+    analyze(ast, patterns) {
+        const matches = [];
+        const stats = this.getStats(ast);
+        for (const [patternId, pattern] of patterns) {
+            const patternMatches = this.findPattern(ast, pattern);
+            for (const match of patternMatches) {
+                matches.push({
+                    patternId,
+                    location: match.location,
+                    confidence: match.confidence,
+                    isOutlier: false,
+                    node: match.node,
+                });
+            }
+        }
+        return { matches, stats };
+    }
+    // ============================================
+    // Private Helper Methods
+    // ============================================
+    /**
+     * Internal recursive traversal helper.
+     */
+    traverseNode(node, parent, depth, path, visitor) {
+        const result = visitor(node, parent, depth, path);
+        // If visitor returns false, stop entire traversal
+        if (result === false) {
+            return false;
+        }
+        // Traverse children
+        for (let i = 0; i < node.children.length; i++) {
+            const child = node.children[i];
+            if (child) {
+                const shouldContinue = this.traverseNode(child, node, depth + 1, [...path, i], visitor);
+                if (!shouldContinue) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+    /**
+     * Match a pattern against a node and return confidence score.
+     */
+    matchPattern(node, pattern, captures) {
+        let score = 1.0;
+        let matchCount = 0;
+        let totalChecks = 0;
+        // Check type
+        if (pattern.type !== undefined) {
+            totalChecks++;
+            if (node.type === pattern.type) {
+                matchCount++;
+            }
+            else {
+                return 0; // Type mismatch is a hard failure
+            }
+        }
+        // Check text
+        if (pattern.text !== undefined) {
+            totalChecks++;
+            const textMatches = this.matchText(node.text, pattern.text, pattern.exactText);
+            if (textMatches) {
+                matchCount++;
+            }
+            else {
+                return 0; // Text mismatch is a hard failure
+            }
+        }
+        // Check children count constraints
+        if (pattern.minChildren !== undefined) {
+            totalChecks++;
+            if (node.children.length >= pattern.minChildren) {
+                matchCount++;
+            }
+            else {
+                return 0;
+            }
+        }
+        if (pattern.maxChildren !== undefined) {
+            totalChecks++;
+            if (node.children.length <= pattern.maxChildren) {
+                matchCount++;
+            }
+            else {
+                return 0;
+            }
+        }
+        // Check custom predicate
+        if (pattern.predicate !== undefined) {
+            totalChecks++;
+            if (pattern.predicate(node)) {
+                matchCount++;
+            }
+            else {
+                return 0;
+            }
+        }
+        // Check child patterns
+        if (pattern.children !== undefined && pattern.children.length > 0) {
+            const childScore = this.matchChildPatterns(node, pattern.children, pattern.matchDescendants, captures);
+            if (childScore === 0) {
+                return 0;
+            }
+            score *= childScore;
+        }
+        // Capture the node if requested
+        if (pattern.capture !== undefined) {
+            captures.set(pattern.capture, node);
+        }
+        // Calculate final confidence
+        if (totalChecks > 0) {
+            score *= matchCount / totalChecks;
+        }
+        return score;
+    }
+    /**
+     * Match text against a pattern (string or regex).
+     */
+    matchText(text, pattern, exact) {
+        if (pattern instanceof RegExp) {
+            return pattern.test(text);
+        }
+        if (exact) {
+            return text === pattern;
+        }
+        return text.includes(pattern);
+    }
+    /**
+     * Match child patterns against node children.
+     */
+    matchChildPatterns(node, childPatterns, matchDescendants, captures) {
+        const nodesToSearch = matchDescendants ? this.getDescendants(node) : node.children;
+        let matchedCount = 0;
+        for (const childPattern of childPatterns) {
+            let found = false;
+            for (const child of nodesToSearch) {
+                const childCaptures = captures || new Map();
+                const confidence = this.matchPattern(child, childPattern, childCaptures);
+                if (confidence > 0) {
+                    found = true;
+                    matchedCount++;
+                    // Merge captures
+                    if (captures) {
+                        for (const [key, value] of childCaptures) {
+                            captures.set(key, value);
+                        }
+                    }
+                    break;
+                }
+            }
+            if (!found) {
+                return 0; // Required child pattern not found
+            }
+        }
+        return matchedCount / childPatterns.length;
+    }
+    /**
+     * Compare two nodes recursively.
+     */
+    compareNodes(node1, node2, path1, path2, options, differences, stats, depth) {
+        // Check max depth
+        if (options.maxDepth !== undefined && depth > options.maxDepth) {
+            return 1;
+        }
+        stats.nodesCompared++;
+        // Check if type should be ignored
+        if (options.ignoreTypes?.includes(node1.type) || options.ignoreTypes?.includes(node2.type)) {
+            stats.matchingNodes++;
+            return 1;
+        }
+        let similarity = 1.0;
+        let isMatch = true;
+        // Compare types
+        if (node1.type !== node2.type) {
+            differences.push({
+                type: 'type_mismatch',
+                path1,
+                path2,
+                description: `Type mismatch: '${node1.type}' vs '${node2.type}'`,
+                node1,
+                node2,
+            });
+            isMatch = false;
+            similarity *= 0.5;
+        }
+        // Compare text (unless ignored)
+        if (!options.ignoreText && node1.text !== node2.text) {
+            differences.push({
+                type: 'text_mismatch',
+                path1,
+                path2,
+                description: `Text mismatch at ${node1.type}`,
+                node1,
+                node2,
+            });
+            isMatch = false;
+            similarity *= 0.8;
+        }
+        // Compare children count
+        if (node1.children.length !== node2.children.length) {
+            differences.push({
+                type: 'children_count',
+                path1,
+                path2,
+                description: `Children count mismatch: ${node1.children.length} vs ${node2.children.length}`,
+                node1,
+                node2,
+            });
+            isMatch = false;
+        }
+        // Compare children
+        const maxChildren = Math.max(node1.children.length, node2.children.length);
+        if (maxChildren > 0) {
+            let childSimilaritySum = 0;
+            let childCount = 0;
+            for (let i = 0; i < maxChildren; i++) {
+                const child1 = node1.children[i];
+                const child2 = node2.children[i];
+                if (child1 && child2) {
+                    const childSimilarity = this.compareNodes(child1, child2, [...path1, i], [...path2, i], options, differences, stats, depth + 1);
+                    childSimilaritySum += childSimilarity;
+                    childCount++;
+                }
+                else if (child1 && !child2) {
+                    differences.push({
+                        type: 'extra_child',
+                        path1: [...path1, i],
+                        path2,
+                        description: `Extra child in first subtree at index ${i}`,
+                        node1: child1,
+                    });
+                    childCount++;
+                }
+                else if (!child1 && child2) {
+                    differences.push({
+                        type: 'missing_child',
+                        path1,
+                        path2: [...path2, i],
+                        description: `Missing child in first subtree at index ${i}`,
+                        node2: child2,
+                    });
+                    childCount++;
+                }
+            }
+            if (childCount > 0) {
+                similarity *= childSimilaritySum / childCount;
+            }
+        }
+        if (isMatch) {
+            stats.matchingNodes++;
+        }
+        else {
+            stats.differentNodes++;
+        }
+        return similarity;
+    }
+    /**
+     * Check if a position is within a range.
+     */
+    positionInRange(position, start, end) {
+        // Check if position is after start
+        if (position.row < start.row)
+            return false;
+        if (position.row === start.row && position.column < start.column)
+            return false;
+        // Check if position is before end
+        if (position.row > end.row)
+            return false;
+        if (position.row === end.row && position.column > end.column)
+            return false;
+        return true;
+    }
+    /**
+     * Check if position a is after position b.
+     */
+    isAfterPosition(a, b) {
+        if (a.row > b.row)
+            return true;
+        if (a.row === b.row && a.column >= b.column)
+            return true;
+        return false;
+    }
+    /**
+     * Check if position a is before position b.
+     */
+    isBeforePosition(a, b) {
+        if (a.row < b.row)
+            return true;
+        if (a.row === b.row && a.column <= b.column)
+            return true;
+        return false;
+    }
+}
+//# sourceMappingURL=ast-analyzer.js.map

package/dist/analyzers/ast-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-analyzer.js","sourceRoot":"","sources":["../../src/analyzers/ast-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAyJH;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACtB;;;;;;;OAOG;IACH,WAAW,CACT,GAAQ,EACR,OAAmB,EACnB,UAA+B,EAAE;QAEjC,MAAM,OAAO,GAAyB,EAAE,CAAC;QACzC,MAAM,EAAE,KAAK,EAAE,aAAa,GAAG,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;QAC/F,IAAI,YAAY,GAAG,KAAK,CAAC;QAEzB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE;YAClD,iCAAiC;YACjC,IAAI,YAAY,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC;YACf,CAAC;YAED,6BAA6B;YAC7B,IAAI,aAAa,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,CAAC;gBAC9E,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC;gBACzE,OAAO,SAAS,CAAC;YACnB,CAAC;YAED,2BAA2B;YAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YAE9D,IAAI,UAAU,IAAI,aAAa,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBAClD,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI;oBACJ,UAAU;oBACV,QAAQ;oBACR,QAAQ,EAAE;wBACR,KAAK,EAAE,IAAI,CAAC,aAAa;wBACzB,GAAG,EAAE,IAAI,CAAC,WAAW;qBACtB;iBACF,CAAC,CAAC;gBAEH,2BAA2B;gBAC3B,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;oBACnD,YAAY,GAAG,IAAI,CAAC;oBACpB,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,kEAAkE;gBAClE,IAAI,CAAC,aAAa,EAAE,CAAC;oBACnB,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YAED,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CACb,KAAc,EACd,KAAc,EACd,UAAiC,EAAE;QAEnC,MAAM,WAAW,GAAwB,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;QAExE,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAE3F,OAAO;YACL,WAAW,EAAE,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC;YACzD,UAAU;YACV,WAAW;YACX,KAAK;SACN,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,GAAQ;QACf,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE;YAC1C,SAAS,EAAE,CAAC;YACZ,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAErC,gBAAgB;YAChB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAE3D,yCAAyC;YACzC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;gBACtC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,SAAS;YACT,WAAW;YACX,QAAQ;YACR,WAAW,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;SACjE,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,GAAQ,EAAE,OAAqB;QACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,GAAQ,EAAE,QAAgB;QACxC,MAAM,OAAO,GAAc,EAAE,CAAC;QAE9B,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YAC1B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,mBAAmB,CAAC,GAAQ,EAAE,QAAgB;QAC5C,IAAI,MAAM,GAAmB,IAAI,CAAC;QAElC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YAC1B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC3B,MAAM,GAAG,IAAI,CAAC;gBACd,OAAO,KAAK,CAAC,CAAC,iBAAiB;YACjC,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,kBAAkB,CAAC,GAAQ,EAAE,QAAkB;QAC7C,IAAI,MAAM,GAAmB,IAAI,CAAC;QAElC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YAC1B,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACzE,MAAM,GAAG,IAAI,CAAC,CAAC,wDAAwD;YACzE,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,IAAa;QAC1B,MAAM,WAAW,GAAc,EAAE,CAAC;QAElC,MAAM,OAAO,GAAG,CAAC,CAAU,EAAQ,EAAE;YACnC,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC/B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxB,OAAO,CAAC,KAAK,CAAC,CAAC;YACjB,CAAC;QACH,CAAC,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,CAAC;QACd,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,GAAQ,EAAE,UAAmB;QACxC,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;QAEpB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE;YAC1C,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;gBACxB,UAAU,GAAG,KAAK,CAAC;gBACnB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,GAAQ,EAAE,UAAmB;QAC1C,MAAM,OAAO,GAAc,EAAE,CAAC;QAE9B,MAAM,WAAW,GAAG,CAAC,IAAa,EAAE,KAAgB,EAAW,EAAE;YAC/D,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;gBACvB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;oBACzC,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC9B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,IAAa;QACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,GAAQ,EAAE,QAAiC;QACjD,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAEjC,KAAK,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC5C,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;gBACnC,OAAO,CAAC,IAAI,CAAC;oBACX,SAAS;oBACT,QAAQ,EAAE,KAAK,CAAC,QAAQ;oBACxB,UAAU,EAAE,KAAK,CAAC,UAAU;oBAC5B,SAAS,EAAE,KAAK;oBAChB,IAAI,EAAE,KAAK,CAAC,IAAI;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED,+CAA+C;IAC/C,yBAAyB;IACzB,+CAA+C;IAE/C;;OAEG;IACK,YAAY,CAClB,IAAa,EACb,MAAsB,EACtB,KAAa,EACb,IAAc,EACd,OAAqB;QAErB,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAElD,kDAAkD;QAClD,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,oBAAoB;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBACxF,IAAI,CAAC,cAAc,EAAE,CAAC;oBACpB,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,IAAa,EACb,OAAmB,EACnB,QAA8B;QAE9B,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,aAAa;QACb,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,EAAE,CAAC;gBAC/B,UAAU,EAAE,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,CAAC,CAAC,kCAAkC;YAC9C,CAAC;QACH,CAAC;QAED,aAAa;QACb,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,EAAE,CAAC;YACd,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YAC/E,IAAI,WAAW,EAAE,CAAC;gBAChB,UAAU,EAAE,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,CAAC,CAAC,kCAAkC;YAC9C,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACtC,WAAW,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;gBAChD,UAAU,EAAE,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACtC,WAAW,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;gBAChD,UAAU,EAAE,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YACpC,WAAW,EAAE,CAAC;YACd,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,UAAU,EAAE,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClE,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,gBAAgB,EAAE,QAAQ,CAAC,CAAC;YACvG,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;gBACrB,OAAO,CAAC,CAAC;YACX,CAAC;YACD,KAAK,IAAI,UAAU,CAAC;QACtB,CAAC;QAED,gCAAgC;QAChC,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,6BAA6B;QAC7B,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,KAAK,IAAI,UAAU,GAAG,WAAW,CAAC;QACpC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,IAAY,EAAE,OAAwB,EAAE,KAAe;QACvE,IAAI,OAAO,YAAY,MAAM,EAAE,CAAC;YAC9B,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,IAAI,KAAK,OAAO,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,kBAAkB,CACxB,IAAa,EACb,aAA2B,EAC3B,gBAA0B,EAC1B,QAA+B;QAE/B,MAAM,aAAa,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;QACnF,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;YACzC,IAAI,KAAK,GAAG,KAAK,CAAC;YAElB,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;gBAClC,MAAM,aAAa,GAAG,QAAQ,IAAI,IAAI,GAAG,EAAmB,CAAC;gBAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;gBAEzE,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;oBACnB,KAAK,GAAG,IAAI,CAAC;oBACb,YAAY,EAAE,CAAC;oBAEf,iBAAiB;oBACjB,IAAI,QAAQ,EAAE,CAAC;wBACb,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;4BACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;wBAC3B,CAAC;oBACH,CAAC;oBACD,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,OAAO,CAAC,CAAC,CAAC,mCAAmC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,KAAc,EACd,KAAc,EACd,KAAe,EACf,KAAe,EACf,OAA8B,EAC9B,WAAgC,EAChC,KAA+E,EAC/E,KAAa;QAEb,kBAAkB;QAClB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAC/D,OAAO,CAAC,CAAC;QACX,CAAC;QAED,KAAK,CAAC,aAAa,EAAE,CAAC;QAEtB,kCAAkC;QAClC,IAAI,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3F,KAAK,CAAC,aAAa,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,UAAU,GAAG,GAAG,CAAC;QACrB,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,gBAAgB;QAChB,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YAC9B,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,eAAe;gBACrB,KAAK;gBACL,KAAK;gBACL,WAAW,EAAE,mBAAmB,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,IAAI,GAAG;gBAChE,KAAK;gBACL,KAAK;aACN,CAAC,CAAC;YACH,OAAO,GAAG,KAAK,CAAC;YAChB,UAAU,IAAI,GAAG,CAAC;QACpB,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YACrD,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,eAAe;gBACrB,KAAK;gBACL,KAAK;gBACL,WAAW,EAAE,oBAAoB,KAAK,CAAC,IAAI,EAAE;gBAC7C,KAAK;gBACL,KAAK;aACN,CAAC,CAAC;YACH,OAAO,GAAG,KAAK,CAAC;YAChB,UAAU,IAAI,GAAG,CAAC;QACpB,CAAC;QAED,yBAAyB;QACzB,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpD,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,gBAAgB;gBACtB,KAAK;gBACL,KAAK;gBACL,WAAW,EAAE,4BAA4B,KAAK,CAAC,QAAQ,CAAC,MAAM,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAC5F,KAAK;gBACL,KAAK;aACN,CAAC,CAAC;YACH,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC3E,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,kBAAkB,GAAG,CAAC,CAAC;YAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAEjC,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;oBACrB,MAAM,eAAe,GAAG,IAAI,CAAC,YAAY,CACvC,MAAM,EACN,MAAM,EACN,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,EACb,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,EACb,OAAO,EACP,WAAW,EACX,KAAK,EACL,KAAK,GAAG,CAAC,CACV,CAAC;oBACF,kBAAkB,IAAI,eAAe,CAAC;oBACtC,UAAU,EAAE,CAAC;gBACf,CAAC;qBAAM,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC7B,WAAW,CAAC,IAAI,CAAC;wBACf,IAAI,EAAE,aAAa;wBACnB,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;wBACpB,KAAK;wBACL,WAAW,EAAE,yCAAyC,CAAC,EAAE;wBACzD,KAAK,EAAE,MAAM;qBACd,CAAC,CAAC;oBACH,UAAU,EAAE,CAAC;gBACf,CAAC;qBAAM,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;oBAC7B,WAAW,CAAC,IAAI,CAAC;wBACf,IAAI,EAAE,eAAe;wBACrB,KAAK;wBACL,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;wBACpB,WAAW,EAAE,2CAA2C,CAAC,EAAE;wBAC3D,KAAK,EAAE,MAAM;qBACd,CAAC,CAAC;oBACH,UAAU,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;YAED,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBACnB,UAAU,IAAI,kBAAkB,GAAG,UAAU,CAAC;YAChD,CAAC;QACH,CAAC;QAED,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,CAAC,aAAa,EAAE,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,QAAkB,EAAE,KAAe,EAAE,GAAa;QACxE,mCAAmC;QACnC,IAAI,QAAQ,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QAC3C,IAAI,QAAQ,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAE/E,kCAAkC;QAClC,IAAI,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QACzC,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAE3E,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,CAAW,EAAE,CAAW;QAC9C,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}