@path58/n8n-mcp 0.1.0

package/dist/validation/l6-checks/loops.js

@@ -0,0 +1,370 @@
+/**
+ * L6 Loop Detection Checks
+ *
+ * RAG-2.2.77: L6 New Pattern Checks
+ * Created: 2026-01-17
+ * Updated: 2026-01-22 (RAG-2.2.92.10: Add pattern detection for intentional loops)
+ *
+ * Validates workflow graph for circular references (infinite loops):
+ * - CIRCULAR_REFERENCE: Cycle detected in workflow graph
+ *
+ * Uses depth-first search (DFS) with recursion stack tracking
+ * to detect cycles in the directed graph of workflow connections.
+ *
+ * RAG-2.2.92.10: Now applies the same pattern detection logic as L4 to filter out
+ * intentional iteration patterns (879 L6_CIRCULAR_REFERENCE warnings were false positives).
+ */
+import { getL6Severity, blocksCertification } from '../config/l6-severity.js';
+/** Intentional loop node types that create valid cycles */
+const INTENTIONAL_LOOP_TYPES = new Set([
+    'n8n-nodes-base.splitInBatches',
+    'n8n-nodes-base.loop',
+]);
+/** Node types that indicate valid polling/retry patterns */
+const POLLING_RETRY_NODE_TYPES = new Set([
+    'n8n-nodes-base.wait',
+    'n8n-nodes-base.if',
+    'n8n-nodes-base.switch',
+]);
+/** Node types that indicate valid conversational/iterative patterns */
+const CONVERSATIONAL_NODE_TYPES = new Set([
+    '@n8n/n8n-nodes-langchain.agent',
+    'n8n-nodes-base.formTrigger',
+    'n8n-nodes-base.webhook',
+]);
+/** Node types used for code-based iteration control */
+const CODE_ITERATION_NODE_TYPES = new Set([
+    'n8n-nodes-base.code',
+    'n8n-nodes-base.set',
+]);
+/**
+ * Keywords indicating intentional iteration patterns
+ * (from L4_ITERATIVE_LOOP_PATTERNS.md)
+ */
+const ITERATION_KEYWORDS = [
+    // Loop control keywords
+    'loop', 'vars', 'iteration', 'step', 'next', 'retry', 'cycle',
+    // Validation keywords
+    'check', 'validate', 'verify', 'status', 'poll',
+    // Content generation keywords
+    'generate', 'create', 'planner',
+    // Human-in-the-loop keywords
+    'approval', 'review', 'feedback', 'revision', 'human',
+    // Router/command keywords
+    'router', 'responder', 'command',
+    // Data processing keywords (common in ETL/sync workflows)
+    'refresh', 'token', 'download', 'upload', 'load', 'merge', 'extract',
+    // Conditional loop keywords
+    'exists', 'invalid', 'complete', 'loaded', 'open', 'all', 'finished',
+    // Pagination/cursor keywords
+    'page', 'cursor', 'increment', 'more', 'list', 'get',
+    // Sync/update keywords
+    'sync', 'update', 'clear', 'duplicate', 'rename', 'set',
+    // Automation/deployment keywords
+    'docker', 'compose', 'pull', 'image', 'deploy', 'approve', 'notif',
+    // Audio/voice processing keywords
+    'voice', 'audio', 'fetch', 'text', 'speech', 'tts',
+];
+/**
+ * Build a map of node names to their types
+ */
+function buildNodeTypeMap(workflow) {
+    const map = new Map();
+    if (workflow.nodes && Array.isArray(workflow.nodes)) {
+        for (const node of workflow.nodes) {
+            map.set(node.name, node.type);
+        }
+    }
+    return map;
+}
+/**
+ * Check if cycle contains a Wait/delay node
+ */
+function hasWaitNode(cycleNodeTypes) {
+    return cycleNodeTypes.includes('n8n-nodes-base.wait');
+}
+/**
+ * Check if cycle contains If/Switch conditional nodes
+ */
+function hasConditionalNode(cycleNodeTypes) {
+    return cycleNodeTypes.some((type) => type === 'n8n-nodes-base.if' || type === 'n8n-nodes-base.switch');
+}
+/**
+ * Check if cycle represents a status polling pattern
+ */
+function isStatusPollingPattern(cycleLower, hasWait) {
+    if (!hasWait)
+        return false;
+    const statusKeywords = ['status', 'check', 'verify', 'complete', 'ready', 'progress'];
+    return statusKeywords.some((kw) => cycleLower.includes(kw));
+}
+/**
+ * Check if cycle represents a result polling pattern
+ */
+function isResultPollingPattern(cycleLower, hasWait) {
+    if (!hasWait)
+        return false;
+    return cycleLower.includes('get results') ||
+        cycleLower.includes('get result') ||
+        cycleLower.includes('get status');
+}
+/**
+ * Check if cycle represents an AI agent conversational loop
+ */
+function isAgentLoopPattern(cycleNodeTypes, cycleLower, cycleLength) {
+    if (cycleLength < 3)
+        return false;
+    return cycleNodeTypes.some((type) => type === '@n8n/n8n-nodes-langchain.agent' || type?.includes('agent')) || cycleLower.includes('agent');
+}
+/**
+ * Check if cycle represents a form validation retry pattern
+ */
+function isFormRetryPattern(cycleNodeTypes, cycleLower) {
+    const hasFormNode = cycleNodeTypes.some((type) => type === 'n8n-nodes-base.formTrigger' || type === 'n8n-nodes-base.webhook');
+    if (!hasFormNode)
+        return false;
+    const formKeywords = ['form', 'validation', 'retry', 'reenter', 'correct'];
+    return formKeywords.some((kw) => cycleLower.includes(kw));
+}
+/**
+ * Check if cycle represents a code-based iteration pattern
+ *
+ * These are intentional loops that use IF/Switch + Code/Set nodes instead of
+ * explicit loop nodes. Common in n8n.io published workflows.
+ *
+ * See: docs/validation/levels/l4/L4_ITERATIVE_LOOP_PATTERNS.md
+ */
+function isCodeBasedIterationPattern(cycle, nodeTypeMap) {
+    const cycleNodeTypes = cycle.map((name) => nodeTypeMap.get(name)).filter(Boolean);
+    const cycleLower = cycle.join(' → ').toLowerCase();
+    // Pattern 1: Has IF/Switch node + iteration keywords
+    const hasIfNode = cycleNodeTypes.some((t) => t === 'n8n-nodes-base.if' || t === 'n8n-nodes-base.switch');
+    const hasIterationKeyword = ITERATION_KEYWORDS.some((kw) => cycleLower.includes(kw));
+    if (hasIfNode && hasIterationKeyword) {
+        return true;
+    }
+    // Pattern 2: Has Code/Set nodes for loop control (vars pattern)
+    const hasCodeIteration = cycleNodeTypes.some((t) => CODE_ITERATION_NODE_TYPES.has(t));
+    const hasVarsPattern = cycleLower.includes('vars') || cycleLower.includes('parameters');
+    if (hasCodeIteration && hasVarsPattern) {
+        return true;
+    }
+    // Pattern 3: Status polling pattern (Get + Check/Status + IF)
+    const hasGetAndCheck = cycleLower.includes('get') &&
+        (cycleLower.includes('status') || cycleLower.includes('check'));
+    if (hasGetAndCheck && hasIfNode) {
+        return true;
+    }
+    // Pattern 4: Self-loop (same node name repeated) - often Airtable/table patterns
+    // Example: "Table: Tools → Table: Tools"
+    if (cycle.length === 2 && cycle[0] === cycle[cycle.length - 1]) {
+        return true;
+    }
+    // Pattern 5: AI/LLM chain patterns
+    const hasAiChain = cycleLower.includes('chain') ||
+        cycleLower.includes('summariz') ||
+        cycleLower.includes('ai ') ||
+        cycleLower.includes('llm') ||
+        cycleLower.includes('gpt');
+    if (hasAiChain) {
+        return true;
+    }
+    // Pattern 6: Any cycle with IF node (conservative fallback for published n8n.io workflows)
+    // These are almost always intentional - IF nodes control loop termination
+    if (hasIfNode) {
+        return true;
+    }
+    return false;
+}
+/**
+ * Check if a cycle is a valid polling/retry pattern
+ */
+function isPollingOrRetryPattern(cycle, nodeTypeMap) {
+    const cycleLower = cycle.join(' → ').toLowerCase();
+    const cycleNodeTypes = cycle.map((name) => nodeTypeMap.get(name)).filter(Boolean);
+    const hasWait = hasWaitNode(cycleNodeTypes);
+    return (isStatusPollingPattern(cycleLower, hasWait) ||
+        (hasConditionalNode(cycleNodeTypes) && hasWait) ||
+        isResultPollingPattern(cycleLower, hasWait) ||
+        hasWait ||
+        isAgentLoopPattern(cycleNodeTypes, cycleLower, cycle.length) ||
+        isFormRetryPattern(cycleNodeTypes, cycleLower) ||
+        isCodeBasedIterationPattern(cycle, nodeTypeMap));
+}
+/**
+ * Check if a cycle is an intentional loop pattern
+ *
+ * RAG-2.2.92.10: Apply same logic as L4 to filter out intentional loops.
+ * Returns true if the cycle should be SKIPPED (not reported as an error).
+ */
+function isIntentionalLoopPattern(cycle, nodeTypeMap) {
+    // Check for explicit loop nodes first
+    for (const nodeName of cycle) {
+        const nodeType = nodeTypeMap.get(nodeName);
+        if (nodeType && INTENTIONAL_LOOP_TYPES.has(nodeType)) {
+            return true;
+        }
+    }
+    // Check for polling/retry/conversational patterns
+    for (const nodeName of cycle) {
+        const nodeType = nodeTypeMap.get(nodeName);
+        if (nodeType && (POLLING_RETRY_NODE_TYPES.has(nodeType) || CONVERSATIONAL_NODE_TYPES.has(nodeType))) {
+            return true;
+        }
+    }
+    // Check for code-based iteration patterns
+    if (isPollingOrRetryPattern(cycle, nodeTypeMap)) {
+        return true;
+    }
+    return false;
+}
+/**
+ * Get outgoing connection target node names from a source node
+ * @param nodeName - Source node name
+ * @param workflow - Workflow to analyze
+ * @returns Array of target node names
+ */
+function getOutgoingConnections(nodeName, workflow) {
+    const targets = [];
+    const outgoing = workflow.connections?.[nodeName];
+    if (!outgoing) {
+        return targets;
+    }
+    for (const outputType of Object.keys(outgoing)) {
+        const connections = outgoing[outputType];
+        if (!connections || !Array.isArray(connections)) {
+            continue;
+        }
+        for (const connectionGroup of connections) {
+            if (Array.isArray(connectionGroup)) {
+                for (const connection of connectionGroup) {
+                    if (connection && typeof connection === 'object' && connection.node) {
+                        targets.push(connection.node);
+                    }
+                }
+            }
+            else if (connectionGroup && typeof connectionGroup === 'object' && 'node' in connectionGroup) {
+                const conn = connectionGroup;
+                if (typeof conn.node === 'string') {
+                    targets.push(conn.node);
+                }
+            }
+        }
+    }
+    return targets;
+}
+/**
+ * Check for circular references (infinite loops) in workflow graph
+ *
+ * Uses DFS with recursion stack tracking to detect cycles.
+ * Reports all nodes involved in cycles.
+ *
+ * RAG-2.2.92.10: Now filters out intentional loop patterns using the same
+ * detection logic as L4. Intentional patterns include:
+ * - Explicit loop nodes (SplitInBatches, Loop)
+ * - Polling/retry patterns (Wait + If/Switch)
+ * - AI agent conversational loops
+ * - Code-based iteration patterns (IF + iteration keywords)
+ *
+ * @param context - L6 validation context
+ * @returns Array of L6Error for each cycle detected (excluding intentional patterns)
+ */
+export function checkCircularReferences(context) {
+    const { workflow } = context;
+    const errors = [];
+    // Guard: Ensure workflow.nodes exists
+    if (!workflow.nodes || !Array.isArray(workflow.nodes)) {
+        return errors;
+    }
+    // RAG-2.2.92.10: Build node type map for pattern detection
+    const nodeTypeMap = buildNodeTypeMap(workflow);
+    const visited = new Set();
+    const recursionStack = new Set();
+    const reportedCycles = new Set(); // Avoid duplicate cycle reports
+    /**
+     * Depth-first search to detect cycles
+     * @param nodeName - Current node being visited
+     * @param path - Path of nodes visited to reach current node
+     */
+    function dfs(nodeName, path) {
+        // If node is in recursion stack, we found a cycle
+        if (recursionStack.has(nodeName)) {
+            const cycleStart = path.indexOf(nodeName);
+            const cycle = path.slice(cycleStart);
+            // Create unique key for this cycle to avoid duplicates
+            const cycleKey = [...cycle].sort().join('->');
+            if (reportedCycles.has(cycleKey)) {
+                return;
+            }
+            reportedCycles.add(cycleKey);
+            // RAG-2.2.92.10: Skip intentional loop patterns
+            if (isIntentionalLoopPattern(cycle, nodeTypeMap)) {
+                return;
+            }
+            const code = 'CIRCULAR_REFERENCE';
+            errors.push({
+                code: 'CIRCULAR_REFERENCE',
+                message: `Circular reference detected: ${cycle.join(' → ')} → ${nodeName}`,
+                path: `workflow.connections`,
+                node_name: nodeName,
+                severity: getL6Severity(code),
+                blocks_certification: blocksCertification(code),
+                details: {
+                    cycle_nodes: cycle,
+                    cycle_length: cycle.length,
+                },
+                suggested_fix: {
+                    id: `fix-circular-${nodeName}-${Date.now()}`,
+                    fix_type: 'remove_connection',
+                    confidence: 0.7,
+                    auto_applicable: false,
+                    description: `Remove one connection to break the cycle: ${cycle.join(' → ')}`,
+                    target_node: nodeName,
+                    patch: {},
+                    context: {
+                        cycle_nodes: cycle,
+                        suggested_break_point: cycle[cycle.length - 1], // Last node before cycle repeats
+                    },
+                },
+            });
+            return;
+        }
+        // If already fully visited, skip
+        if (visited.has(nodeName)) {
+            return;
+        }
+        // Mark as visiting (in recursion stack)
+        visited.add(nodeName);
+        recursionStack.add(nodeName);
+        // Visit all connected nodes
+        const connections = getOutgoingConnections(nodeName, workflow);
+        for (const targetNode of connections) {
+            dfs(targetNode, [...path, nodeName]);
+        }
+        // Remove from recursion stack when done
+        recursionStack.delete(nodeName);
+    }
+    // Start DFS from all nodes to handle disconnected subgraphs
+    for (const node of workflow.nodes) {
+        if (!visited.has(node.name)) {
+            dfs(node.name, []);
+        }
+    }
+    return errors;
+}
+/**
+ * Run all loop detection checks
+ *
+ * @param context - L6 validation context
+ * @returns Object containing errors and warnings
+ */
+export async function checkLoops(context) {
+    const startTime = performance.now();
+    const circularErrors = checkCircularReferences(context);
+    const duration = performance.now() - startTime;
+    return {
+        errors: circularErrors,
+        warnings: [], // No loop-related warnings currently
+    };
+}
+//# sourceMappingURL=loops.js.map

package/dist/validation/l6-checks/loops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loops.js","sourceRoot":"","sources":["../../../src/validation/l6-checks/loops.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE3E,2DAA2D;AAC3D,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC;IACrC,+BAA+B;IAC/B,qBAAqB;CACtB,CAAC,CAAC;AAEH,4DAA4D;AAC5D,MAAM,wBAAwB,GAAG,IAAI,GAAG,CAAC;IACvC,qBAAqB;IACrB,mBAAmB;IACnB,uBAAuB;CACxB,CAAC,CAAC;AAEH,uEAAuE;AACvE,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC;IACxC,gCAAgC;IAChC,4BAA4B;IAC5B,wBAAwB;CACzB,CAAC,CAAC;AAEH,uDAAuD;AACvD,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC;IACxC,qBAAqB;IACrB,oBAAoB;CACrB,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,kBAAkB,GAAG;IACzB,wBAAwB;IACxB,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IAC7D,sBAAsB;IACtB,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM;IAC/C,8BAA8B;IAC9B,UAAU,EAAE,QAAQ,EAAE,SAAS;IAC/B,6BAA6B;IAC7B,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO;IACrD,0BAA0B;IAC1B,QAAQ,EAAE,WAAW,EAAE,SAAS;IAChC,0DAA0D;IAC1D,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS;IACpE,4BAA4B;IAC5B,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU;IACpE,6BAA6B;IAC7B,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;IACpD,uBAAuB;IACvB,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK;IACvD,iCAAiC;IACjC,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO;IAClE,kCAAkC;IAClC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK;CACnD,CAAC;AAEF;;GAEG;AACH,SAAS,gBAAgB,CAAC,QAAkB;IAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,IAAI,QAAQ,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,cAAwB;IAC3C,OAAO,cAAc,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,cAAwB;IAClD,OAAO,cAAc,CAAC,IAAI,CACxB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,mBAAmB,IAAI,IAAI,KAAK,uBAAuB,CAC3E,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,UAAkB,EAAE,OAAgB;IAClE,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,cAAc,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IACtF,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,UAAkB,EAAE,OAAgB;IAClE,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,OAAO,UAAU,CAAC,QAAQ,CAAC,aAAa,CAAC;QAClC,UAAU,CAAC,QAAQ,CAAC,YAAY,CAAC;QACjC,UAAU,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,cAAwB,EAAE,UAAkB,EAAE,WAAmB;IAC3F,IAAI,WAAW,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAClC,OAAO,cAAc,CAAC,IAAI,CACxB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,gCAAgC,IAAI,IAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,CAC/E,IAAI,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,cAAwB,EAAE,UAAkB;IACtE,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CACrC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,4BAA4B,IAAI,IAAI,KAAK,wBAAwB,CACrF,CAAC;IACF,IAAI,CAAC,WAAW;QAAE,OAAO,KAAK,CAAC;IAC/B,MAAM,YAAY,GAAG,CAAC,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAC3E,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,2BAA2B,CAClC,KAAe,EACf,WAAgC;IAEhC,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC;IAC9F,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;IAEnD,qDAAqD;IACrD,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,mBAAmB,IAAI,CAAC,KAAK,uBAAuB,CAClE,CAAC;IACF,MAAM,mBAAmB,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAErF,IAAI,SAAS,IAAI,mBAAmB,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,MAAM,gBAAgB,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,yBAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,cAAc,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;IAExF,IAAI,gBAAgB,IAAI,cAAc,EAAE,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IAC9D,MAAM,cAAc,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC;QAC/C,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;IAElE,IAAI,cAAc,IAAI,SAAS,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iFAAiF;IACjF,yCAAyC;IACzC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;QAC/D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mCAAmC;IACnC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC;QAC7C,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC/B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC;QAC1B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC;QAC1B,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE7B,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2FAA2F;IAC3F,0EAA0E;IAC1E,IAAI,SAAS,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,KAAe,EAAE,WAAgC;IAChF,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;IACnD,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC;IAC9F,MAAM,OAAO,GAAG,WAAW,CAAC,cAAc,CAAC,CAAC;IAE5C,OAAO,CACL,sBAAsB,CAAC,UAAU,EAAE,OAAO,CAAC;QAC3C,CAAC,kBAAkB,CAAC,cAAc,CAAC,IAAI,OAAO,CAAC;QAC/C,sBAAsB,CAAC,UAAU,EAAE,OAAO,CAAC;QAC3C,OAAO;QACP,kBAAkB,CAAC,cAAc,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC;QAC5D,kBAAkB,CAAC,cAAc,EAAE,UAAU,CAAC;QAC9C,2BAA2B,CAAC,KAAK,EAAE,WAAW,CAAC,CAChD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,wBAAwB,CAAC,KAAe,EAAE,WAAgC;IACjF,sCAAsC;IACtC,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,QAAQ,IAAI,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,QAAQ,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,yBAAyB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YACpG,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,IAAI,uBAAuB,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,CAAC;QAChD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,sBAAsB,CAAC,QAAgB,EAAE,QAAkB;IAClE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC;IAElD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAChD,SAAS;QACX,CAAC;QAED,KAAK,MAAM,eAAe,IAAI,WAAW,EAAE,CAAC;YAC1C,IAAI,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;gBACnC,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;oBACzC,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC;wBACpE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBAChC,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,eAAe,IAAI,OAAO,eAAe,KAAK,QAAQ,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;gBAC/F,MAAM,IAAI,GAAG,eAAmC,CAAC;gBACjD,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,uBAAuB,CAAC,OAAkB;IACxD,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC7B,MAAM,MAAM,GAAc,EAAE,CAAC;IAE7B,sCAAsC;IACtC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2DAA2D;IAC3D,MAAM,WAAW,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAE/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,gCAAgC;IAE1E;;;;OAIG;IACH,SAAS,GAAG,CAAC,QAAgB,EAAE,IAAc;QAC3C,kDAAkD;QAClD,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAErC,uDAAuD;YACvD,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjC,OAAO;YACT,CAAC;YACD,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE7B,gDAAgD;YAChD,IAAI,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,CAAC;gBACjD,OAAO;YACT,CAAC;YAED,MAAM,IAAI,GAAG,oBAAoB,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,oBAAoB;gBAC1B,OAAO,EAAE,gCAAgC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,EAAE;gBAC1E,IAAI,EAAE,sBAAsB;gBAC5B,SAAS,EAAE,QAAQ;gBACnB,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC;gBAC7B,oBAAoB,EAAE,mBAAmB,CAAC,IAAI,CAAC;gBAC/C,OAAO,EAAE;oBACP,WAAW,EAAE,KAAK;oBAClB,YAAY,EAAE,KAAK,CAAC,MAAM;iBAC3B;gBACD,aAAa,EAAE;oBACb,EAAE,EAAE,gBAAgB,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE;oBAC5C,QAAQ,EAAE,mBAAmB;oBAC7B,UAAU,EAAE,GAAG;oBACf,eAAe,EAAE,KAAK;oBACtB,WAAW,EAAE,6CAA6C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;oBAC7E,WAAW,EAAE,QAAQ;oBACrB,KAAK,EAAE,EAAE;oBACT,OAAO,EAAE;wBACP,WAAW,EAAE,KAAK;wBAClB,qBAAqB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,iCAAiC;qBAClF;iBACF;aACF,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,iCAAiC;QACjC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,wCAAwC;QACxC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtB,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE7B,4BAA4B;QAC5B,MAAM,WAAW,GAAG,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC/D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,GAAG,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,wCAAwC;QACxC,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED,4DAA4D;IAC5D,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAAkB;IAIjD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAEpC,MAAM,cAAc,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAExD,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAE/C,OAAO;QACL,MAAM,EAAE,cAAc;QACtB,QAAQ,EAAE,EAAE,EAAE,qCAAqC;KACpD,CAAC;AACJ,CAAC"}

package/dist/validation/l6-checks/performance.js

@@ -0,0 +1,182 @@
+/**
+ * L6 Performance Checks
+ *
+ * RAG-2.2.77: L6 New Pattern Checks
+ * Created: 2026-01-17
+ *
+ * Validates workflow performance characteristics:
+ * - OVERSIZED_WORKFLOW: Workflow has excessive number of nodes (50+)
+ * - EXCESSIVE_RETRY: Node has excessive retry configuration (>10)
+ *
+ * These are warnings that don't block certification but flag
+ * potential performance and maintainability issues.
+ */
+import { getL6Severity, blocksCertification } from '../config/l6-severity.js';
+/**
+ * Workflow size thresholds
+ */
+const SIZE_THRESHOLDS = {
+    /** Warning threshold - workflow is getting large */
+    warning: 50,
+    /** Critical threshold - workflow is too large, suggest splitting */
+    critical: 100,
+};
+/**
+ * Maximum reasonable retry count
+ */
+const MAX_REASONABLE_RETRIES = 10;
+/**
+ * Check for oversized workflows (50+ nodes)
+ *
+ * Large workflows can impact:
+ * - Performance during execution
+ * - Maintainability and debugging
+ * - n8n editor responsiveness
+ *
+ * @param context - L6 validation context
+ * @returns Array of L6Warning for oversized workflows
+ */
+export function checkWorkflowSize(context) {
+    const { workflow } = context;
+    const warnings = [];
+    // Guard: Ensure workflow.nodes exists
+    if (!workflow.nodes || !Array.isArray(workflow.nodes)) {
+        return warnings;
+    }
+    const nodeCount = workflow.nodes.length;
+    // Only report if above critical threshold (100+)
+    // Per assignment: trigger at SIZE_THRESHOLDS.critical
+    if (nodeCount >= SIZE_THRESHOLDS.critical) {
+        const code = 'OVERSIZED_WORKFLOW';
+        warnings.push({
+            code: 'OVERSIZED_WORKFLOW',
+            message: `Workflow has ${nodeCount} nodes (>${SIZE_THRESHOLDS.critical}). Consider splitting into sub-workflows for better maintainability.`,
+            node_name: '__workflow__',
+            severity: getL6Severity(code),
+            blocks_certification: blocksCertification(code),
+            details: {
+                node_count: nodeCount,
+                threshold: SIZE_THRESHOLDS.critical,
+                warning_threshold: SIZE_THRESHOLDS.warning,
+            },
+            suggested_fix: {
+                id: `fix-oversized-workflow-${Date.now()}`,
+                fix_type: 'split_workflow',
+                confidence: 0.5,
+                auto_applicable: false,
+                description: 'Split workflow into smaller sub-workflows using Execute Workflow node',
+                target_node: '__workflow__',
+                patch: {},
+                context: {
+                    current_node_count: nodeCount,
+                    recommendation: 'Consider grouping related nodes into sub-workflows',
+                },
+            },
+        });
+    }
+    else if (nodeCount >= SIZE_THRESHOLDS.warning) {
+        // Warn at 50+ nodes but less critical
+        const code = 'OVERSIZED_WORKFLOW';
+        warnings.push({
+            code: 'OVERSIZED_WORKFLOW',
+            message: `Workflow has ${nodeCount} nodes (>${SIZE_THRESHOLDS.warning}). May impact performance.`,
+            node_name: '__workflow__',
+            severity: getL6Severity(code),
+            blocks_certification: blocksCertification(code),
+            details: {
+                node_count: nodeCount,
+                threshold: SIZE_THRESHOLDS.warning,
+            },
+        });
+    }
+    return warnings;
+}
+/**
+ * Check for excessive retry configurations (>10 retries)
+ *
+ * Nodes with too many retries can cause:
+ * - Long delays during failure scenarios
+ * - Resource exhaustion
+ * - Poor user experience
+ *
+ * @param context - L6 validation context
+ * @returns Array of L6Warning for nodes with excessive retries
+ */
+export function checkExcessiveRetries(context) {
+    const { workflow } = context;
+    const warnings = [];
+    // Guard: Ensure workflow.nodes exists
+    if (!workflow.nodes || !Array.isArray(workflow.nodes)) {
+        return warnings;
+    }
+    for (const node of workflow.nodes) {
+        // Check if node has retry configured
+        // n8n uses retryOnFail boolean and maxTries number
+        const retryOnFail = node.retryOnFail;
+        const maxTries = node.maxTries || 3;
+        const waitBetweenTries = node.waitBetweenTries || 1000;
+        // Only check if retry is actually enabled
+        if (!retryOnFail) {
+            continue;
+        }
+        if (maxTries > MAX_REASONABLE_RETRIES) {
+            const maxWaitSeconds = (maxTries * waitBetweenTries) / 1000;
+            const code = 'EXCESSIVE_RETRY';
+            warnings.push({
+                code: 'EXCESSIVE_RETRY',
+                message: `Node "${node.name}" has ${maxTries} retries (>${MAX_REASONABLE_RETRIES}). Maximum wait time: ${maxWaitSeconds}s.`,
+                node_name: node.name,
+                node_type: node.type,
+                severity: getL6Severity(code),
+                blocks_certification: blocksCertification(code),
+                details: {
+                    max_tries: maxTries,
+                    threshold: MAX_REASONABLE_RETRIES,
+                    wait_between_tries_ms: waitBetweenTries,
+                    max_wait_seconds: maxWaitSeconds,
+                },
+                suggested_fix: {
+                    id: `fix-excessive-retry-${node.name}-${Date.now()}`,
+                    fix_type: 'reduce_retries',
+                    confidence: 0.8,
+                    auto_applicable: true,
+                    description: `Reduce maxTries from ${maxTries} to ${MAX_REASONABLE_RETRIES} or less`,
+                    target_node: node.name,
+                    patch: {
+                        node_settings: {
+                            maxTries: MAX_REASONABLE_RETRIES,
+                        },
+                    },
+                    context: {
+                        current_max_tries: maxTries,
+                        recommended_max_tries: MAX_REASONABLE_RETRIES,
+                    },
+                },
+            });
+        }
+    }
+    return warnings;
+}
+/**
+ * Run all performance checks
+ *
+ * @param context - L6 validation context
+ * @returns Object containing errors and warnings
+ */
+export async function checkPerformance(context) {
+    const startTime = performance.now();
+    // Run checks in parallel
+    const [oversizedWarnings, excessiveRetryWarnings,] = await Promise.all([
+        Promise.resolve(checkWorkflowSize(context)),
+        Promise.resolve(checkExcessiveRetries(context)),
+    ]);
+    const duration = performance.now() - startTime;
+    return {
+        errors: [], // Performance checks are warnings only
+        warnings: [
+            ...oversizedWarnings,
+            ...excessiveRetryWarnings,
+        ],
+    };
+}
+//# sourceMappingURL=performance.js.map

package/dist/validation/l6-checks/performance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"performance.js","sourceRoot":"","sources":["../../../src/validation/l6-checks/performance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE3E;;GAEG;AACH,MAAM,eAAe,GAAG;IACtB,oDAAoD;IACpD,OAAO,EAAE,EAAE;IACX,oEAAoE;IACpE,QAAQ,EAAE,GAAG;CACd,CAAC;AAEF;;GAEG;AACH,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAkB;IAClD,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC7B,MAAM,QAAQ,GAAgB,EAAE,CAAC;IAEjC,sCAAsC;IACtC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;IAExC,iDAAiD;IACjD,sDAAsD;IACtD,IAAI,SAAS,IAAI,eAAe,CAAC,QAAQ,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,oBAAoB;YAC1B,OAAO,EAAE,gBAAgB,SAAS,YAAY,eAAe,CAAC,QAAQ,sEAAsE;YAC5I,SAAS,EAAE,cAAc;YACzB,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC;YAC7B,oBAAoB,EAAE,mBAAmB,CAAC,IAAI,CAAC;YAC/C,OAAO,EAAE;gBACP,UAAU,EAAE,SAAS;gBACrB,SAAS,EAAE,eAAe,CAAC,QAAQ;gBACnC,iBAAiB,EAAE,eAAe,CAAC,OAAO;aAC3C;YACD,aAAa,EAAE;gBACb,EAAE,EAAE,0BAA0B,IAAI,CAAC,GAAG,EAAE,EAAE;gBAC1C,QAAQ,EAAE,gBAAgB;gBAC1B,UAAU,EAAE,GAAG;gBACf,eAAe,EAAE,KAAK;gBACtB,WAAW,EAAE,uEAAuE;gBACpF,WAAW,EAAE,cAAc;gBAC3B,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE;oBACP,kBAAkB,EAAE,SAAS;oBAC7B,cAAc,EAAE,oDAAoD;iBACrE;aACF;SACF,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,SAAS,IAAI,eAAe,CAAC,OAAO,EAAE,CAAC;QAChD,sCAAsC;QACtC,MAAM,IAAI,GAAG,oBAAoB,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,oBAAoB;YAC1B,OAAO,EAAE,gBAAgB,SAAS,YAAY,eAAe,CAAC,OAAO,4BAA4B;YACjG,SAAS,EAAE,cAAc;YACzB,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC;YAC7B,oBAAoB,EAAE,mBAAmB,CAAC,IAAI,CAAC;YAC/C,OAAO,EAAE;gBACP,UAAU,EAAE,SAAS;gBACrB,SAAS,EAAE,eAAe,CAAC,OAAO;aACnC;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAkB;IACtD,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC7B,MAAM,QAAQ,GAAgB,EAAE,CAAC;IAEjC,sCAAsC;IACtC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,qCAAqC;QACrC,mDAAmD;QACnD,MAAM,WAAW,GAAI,IAAiD,CAAC,WAAW,CAAC;QACnF,MAAM,QAAQ,GAAI,IAA6C,CAAC,QAAQ,IAAI,CAAC,CAAC;QAC9E,MAAM,gBAAgB,GAAI,IAAqD,CAAC,gBAAgB,IAAI,IAAI,CAAC;QAEzG,0CAA0C;QAC1C,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,SAAS;QACX,CAAC;QAED,IAAI,QAAQ,GAAG,sBAAsB,EAAE,CAAC;YACtC,MAAM,cAAc,GAAG,CAAC,QAAQ,GAAG,gBAAgB,CAAC,GAAG,IAAI,CAAC;YAC5D,MAAM,IAAI,GAAG,iBAAiB,CAAC;YAE/B,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,iBAAiB;gBACvB,OAAO,EAAE,SAAS,IAAI,CAAC,IAAI,SAAS,QAAQ,cAAc,sBAAsB,yBAAyB,cAAc,IAAI;gBAC3H,SAAS,EAAE,IAAI,CAAC,IAAI;gBACpB,SAAS,EAAE,IAAI,CAAC,IAAI;gBACpB,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC;gBAC7B,oBAAoB,EAAE,mBAAmB,CAAC,IAAI,CAAC;gBAC/C,OAAO,EAAE;oBACP,SAAS,EAAE,QAAQ;oBACnB,SAAS,EAAE,sBAAsB;oBACjC,qBAAqB,EAAE,gBAAgB;oBACvC,gBAAgB,EAAE,cAAc;iBACjC;gBACD,aAAa,EAAE;oBACb,EAAE,EAAE,uBAAuB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE;oBACpD,QAAQ,EAAE,gBAAgB;oBAC1B,UAAU,EAAE,GAAG;oBACf,eAAe,EAAE,IAAI;oBACrB,WAAW,EAAE,wBAAwB,QAAQ,OAAO,sBAAsB,UAAU;oBACpF,WAAW,EAAE,IAAI,CAAC,IAAI;oBACtB,KAAK,EAAE;wBACL,aAAa,EAAE;4BACb,QAAQ,EAAE,sBAAsB;yBACjC;qBACF;oBACD,OAAO,EAAE;wBACP,iBAAiB,EAAE,QAAQ;wBAC3B,qBAAqB,EAAE,sBAAsB;qBAC9C;iBACF;aACF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,OAAkB;IAIvD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAEpC,yBAAyB;IACzB,MAAM,CACJ,iBAAiB,EACjB,sBAAsB,EACvB,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACpB,OAAO,CAAC,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,CAAC,OAAO,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;KAChD,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAE/C,OAAO;QACL,MAAM,EAAE,EAAE,EAAE,uCAAuC;QACnD,QAAQ,EAAE;YACR,GAAG,iBAAiB;YACpB,GAAG,sBAAsB;SAC1B;KACF,CAAC;AACJ,CAAC"}