@emmvish/stable-request 1.8.0 → 1.9.0

package/dist/utilities/validate-workflow-graph.d.ts

@@ -0,0 +1,10 @@
+import { WorkflowGraph, WorkflowGraphValidationResult } from '../types/index.js';
+export declare function validateWorkflowGraph<T = any, R = any>(graph: WorkflowGraph<T, R>): WorkflowGraphValidationResult;
+export declare function detectCycles<T = any, R = any>(graph: WorkflowGraph<T, R>): string[][];
+/**
+ * Detect nodes that cannot be reached from the entry point
+ */
+export declare function detectUnreachableNodes<T = any, R = any>(graph: WorkflowGraph<T, R>): string[];
+export declare function detectOrphanNodes<T = any, R = any>(graph: WorkflowGraph<T, R>): string[];
+export declare function calculateGraphDepth<T = any, R = any>(graph: WorkflowGraph<T, R>): number;
+//# sourceMappingURL=validate-workflow-graph.d.ts.map

package/dist/utilities/validate-workflow-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-workflow-graph.d.ts","sourceRoot":"","sources":["../../src/utilities/validate-workflow-graph.ts"],"names":[],"mappings":"AACA,OAAO,EACL,aAAa,EACb,6BAA6B,EAE9B,MAAM,mBAAmB,CAAC;AAE3B,wBAAgB,qBAAqB,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EACpD,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GACzB,6BAA6B,CA0D/B;AAwDD,wBAAgB,YAAY,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAC3C,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GACzB,MAAM,EAAE,EAAE,CAyCZ;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EACrD,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GACzB,MAAM,EAAE,CAoDV;AAED,wBAAgB,iBAAiB,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAChD,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GACzB,MAAM,EAAE,CA+BV;AAED,wBAAgB,mBAAmB,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAClD,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GACzB,MAAM,CA4BR"}

package/dist/utilities/validate-workflow-graph.js

@@ -0,0 +1,233 @@
+import { WorkflowNodeTypes } from '../enums/index.js';
+export function validateWorkflowGraph(graph) {
+    const errors = [];
+    const warnings = [];
+    if (!graph.entryPoint) {
+        errors.push('Graph must have an entry point');
+    }
+    else if (!graph.nodes.has(graph.entryPoint)) {
+        errors.push(`Entry point '${graph.entryPoint}' does not exist in graph nodes`);
+    }
+    if (graph.exitPoints) {
+        for (const exitPoint of graph.exitPoints) {
+            if (!graph.nodes.has(exitPoint)) {
+                errors.push(`Exit point '${exitPoint}' does not exist in graph nodes`);
+            }
+        }
+    }
+    for (const [fromId, edges] of graph.edges) {
+        if (!graph.nodes.has(fromId)) {
+            errors.push(`Edge source node '${fromId}' does not exist in graph`);
+        }
+        for (const edge of edges) {
+            if (!graph.nodes.has(edge.to)) {
+                errors.push(`Edge target node '${edge.to}' (from '${fromId}') does not exist in graph`);
+            }
+        }
+    }
+    for (const [nodeId, node] of graph.nodes) {
+        const nodeErrors = validateNode(node, graph);
+        errors.push(...nodeErrors);
+    }
+    const cycles = detectCycles(graph);
+    if (cycles.length > 0) {
+        errors.push(`Graph contains ${cycles.length} cycle(s), violating DAG constraints. Cycles: ${cycles.map(c => c.join(' → ')).join('; ')}`);
+    }
+    const unreachableNodes = detectUnreachableNodes(graph);
+    if (unreachableNodes.length > 0) {
+        warnings.push(`Found ${unreachableNodes.length} unreachable node(s): ${unreachableNodes.join(', ')}`);
+    }
+    const orphanNodes = detectOrphanNodes(graph);
+    if (orphanNodes.length > 0) {
+        warnings.push(`Found ${orphanNodes.length} orphan node(s) with no connections: ${orphanNodes.join(', ')}`);
+    }
+    return {
+        valid: errors.length === 0,
+        errors,
+        warnings,
+        cycles: cycles.length > 0 ? cycles : undefined,
+        unreachableNodes: unreachableNodes.length > 0 ? unreachableNodes : undefined,
+        orphanNodes: orphanNodes.length > 0 ? orphanNodes : undefined
+    };
+}
+function validateNode(node, graph) {
+    const errors = [];
+    switch (node.type) {
+        case WorkflowNodeTypes.PHASE:
+            if (!node.phase) {
+                errors.push(`Phase node '${node.id}' is missing phase configuration`);
+            }
+            else if (!node.phase.requests || node.phase.requests.length === 0) {
+                errors.push(`Phase node '${node.id}' has no requests`);
+            }
+            break;
+        case WorkflowNodeTypes.BRANCH:
+            if (!node.branch) {
+                errors.push(`Branch node '${node.id}' is missing branch configuration`);
+            }
+            else if (!node.branch.phases || node.branch.phases.length === 0) {
+                errors.push(`Branch node '${node.id}' has no phases`);
+            }
+            break;
+        case WorkflowNodeTypes.CONDITIONAL:
+            if (!node.condition || typeof node.condition.evaluate !== 'function') {
+                errors.push(`Conditional node '${node.id}' is missing evaluation function`);
+            }
+            break;
+        case WorkflowNodeTypes.PARALLEL_GROUP:
+            if (!node.parallelNodes || node.parallelNodes.length === 0) {
+                errors.push(`Parallel group node '${node.id}' has no parallel nodes specified`);
+            }
+            else {
+                for (const parallelNodeId of node.parallelNodes) {
+                    if (!graph.nodes.has(parallelNodeId)) {
+                        errors.push(`Parallel group node '${node.id}' references non-existent node '${parallelNodeId}'`);
+                    }
+                }
+            }
+            break;
+        case WorkflowNodeTypes.MERGE_POINT:
+            if (!node.waitForNodes || node.waitForNodes.length === 0) {
+                errors.push(`Merge point node '${node.id}' has no nodes to wait for`);
+            }
+            else {
+                for (const waitForNodeId of node.waitForNodes) {
+                    if (!graph.nodes.has(waitForNodeId)) {
+                        errors.push(`Merge point node '${node.id}' references non-existent node '${waitForNodeId}'`);
+                    }
+                }
+            }
+            break;
+    }
+    return errors;
+}
+export function detectCycles(graph) {
+    const cycles = [];
+    const visited = new Set();
+    const recursionStack = new Set();
+    const currentPath = [];
+    function dfs(nodeId) {
+        visited.add(nodeId);
+        recursionStack.add(nodeId);
+        currentPath.push(nodeId);
+        const edges = graph.edges.get(nodeId) || [];
+        for (const edge of edges) {
+            const targetId = edge.to;
+            if (!visited.has(targetId)) {
+                dfs(targetId);
+            }
+            else if (recursionStack.has(targetId)) {
+                const cycleStartIndex = currentPath.indexOf(targetId);
+                const cycle = currentPath.slice(cycleStartIndex);
+                cycle.push(targetId);
+                cycles.push(cycle);
+            }
+        }
+        currentPath.pop();
+        recursionStack.delete(nodeId);
+    }
+    if (graph.entryPoint && graph.nodes.has(graph.entryPoint)) {
+        dfs(graph.entryPoint);
+    }
+    for (const nodeId of graph.nodes.keys()) {
+        if (!visited.has(nodeId)) {
+            dfs(nodeId);
+        }
+    }
+    return cycles;
+}
+/**
+ * Detect nodes that cannot be reached from the entry point
+ */
+export function detectUnreachableNodes(graph) {
+    if (!graph.entryPoint) {
+        return Array.from(graph.nodes.keys());
+    }
+    const reachable = new Set();
+    const queue = [graph.entryPoint];
+    while (queue.length > 0) {
+        const nodeId = queue.shift();
+        if (reachable.has(nodeId)) {
+            continue;
+        }
+        reachable.add(nodeId);
+        const node = graph.nodes.get(nodeId);
+        if (!node)
+            continue;
+        const edges = graph.edges.get(nodeId) || [];
+        for (const edge of edges) {
+            if (!reachable.has(edge.to)) {
+                queue.push(edge.to);
+            }
+        }
+        if (node.type === WorkflowNodeTypes.PARALLEL_GROUP && node.parallelNodes) {
+            for (const parallelNodeId of node.parallelNodes) {
+                if (!reachable.has(parallelNodeId)) {
+                    queue.push(parallelNodeId);
+                }
+            }
+        }
+        if (node.type === WorkflowNodeTypes.MERGE_POINT && node.waitForNodes) {
+            for (const waitForNodeId of node.waitForNodes) {
+                if (!reachable.has(waitForNodeId)) {
+                    queue.push(waitForNodeId);
+                }
+            }
+        }
+    }
+    const unreachable = [];
+    for (const nodeId of graph.nodes.keys()) {
+        if (!reachable.has(nodeId)) {
+            unreachable.push(nodeId);
+        }
+    }
+    return unreachable;
+}
+export function detectOrphanNodes(graph) {
+    const hasOutgoing = new Set();
+    const hasIncoming = new Set();
+    for (const [fromId, edges] of graph.edges) {
+        if (edges.length > 0) {
+            hasOutgoing.add(fromId);
+        }
+        for (const edge of edges) {
+            hasIncoming.add(edge.to);
+        }
+    }
+    const orphans = [];
+    for (const nodeId of graph.nodes.keys()) {
+        if (nodeId === graph.entryPoint) {
+            continue;
+        }
+        if (graph.exitPoints && graph.exitPoints.includes(nodeId)) {
+            continue;
+        }
+        if (!hasOutgoing.has(nodeId) && !hasIncoming.has(nodeId)) {
+            orphans.push(nodeId);
+        }
+    }
+    return orphans;
+}
+export function calculateGraphDepth(graph) {
+    if (!graph.entryPoint) {
+        return 0;
+    }
+    const depths = new Map();
+    const visited = new Set();
+    function dfs(nodeId, depth) {
+        if (visited.has(nodeId)) {
+            return depths.get(nodeId) || 0;
+        }
+        visited.add(nodeId);
+        depths.set(nodeId, depth);
+        const edges = graph.edges.get(nodeId) || [];
+        let maxDepth = depth;
+        for (const edge of edges) {
+            const childDepth = dfs(edge.to, depth + 1);
+            maxDepth = Math.max(maxDepth, childDepth);
+        }
+        return maxDepth;
+    }
+    return dfs(graph.entryPoint, 0);
+}
+//# sourceMappingURL=validate-workflow-graph.js.map

package/dist/utilities/validate-workflow-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-workflow-graph.js","sourceRoot":"","sources":["../../src/utilities/validate-workflow-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAOrD,MAAM,UAAU,qBAAqB,CACnC,KAA0B;IAE1B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;IAChD,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAC9C,MAAM,CAAC,IAAI,CAAC,gBAAgB,KAAK,CAAC,UAAU,iCAAiC,CAAC,CAAC;IACjF,CAAC;IAED,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,IAAI,CAAC,eAAe,SAAS,iCAAiC,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,qBAAqB,MAAM,2BAA2B,CAAC,CAAC;QACtE,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,EAAE,YAAY,MAAM,4BAA4B,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACzC,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7C,MAAM,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,CAAC,kBAAkB,MAAM,CAAC,MAAM,iDAAiD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3I,CAAC;IAED,MAAM,gBAAgB,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IACvD,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,QAAQ,CAAC,IAAI,CAAC,SAAS,gBAAgB,CAAC,MAAM,yBAAyB,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxG,CAAC;IAED,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7C,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,QAAQ,CAAC,IAAI,CAAC,SAAS,WAAW,CAAC,MAAM,wCAAwC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7G,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;QACN,QAAQ;QACR,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;QAC9C,gBAAgB,EAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS;QAC5E,WAAW,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;KAC9D,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAO,IAAwB,EAAE,KAA0B;IAC9E,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,iBAAiB,CAAC,KAAK;YAC1B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,EAAE,kCAAkC,CAAC,CAAC;YACxE,CAAC;iBAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACpE,MAAM,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACzD,CAAC;YACD,MAAM;QAER,KAAK,iBAAiB,CAAC,MAAM;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,EAAE,mCAAmC,CAAC,CAAC;YAC1E,CAAC;iBAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAClE,MAAM,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;YACxD,CAAC;YACD,MAAM;QAER,KAAK,iBAAiB,CAAC,WAAW;YAChC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;gBACrE,MAAM,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,EAAE,kCAAkC,CAAC,CAAC;YAC9E,CAAC;YACD,MAAM;QAER,KAAK,iBAAiB,CAAC,cAAc;YACnC,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC3D,MAAM,CAAC,IAAI,CAAC,wBAAwB,IAAI,CAAC,EAAE,mCAAmC,CAAC,CAAC;YAClF,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,cAAc,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;oBAChD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;wBACrC,MAAM,CAAC,IAAI,CAAC,wBAAwB,IAAI,CAAC,EAAE,mCAAmC,cAAc,GAAG,CAAC,CAAC;oBACnG,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;QAER,KAAK,iBAAiB,CAAC,WAAW;YAChC,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzD,MAAM,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,EAAE,4BAA4B,CAAC,CAAC;YACxE,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBAC9C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;wBACpC,MAAM,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,EAAE,mCAAmC,aAAa,GAAG,CAAC,CAAC;oBAC/F,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;IACV,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,KAA0B;IAE1B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,SAAS,GAAG,CAAC,MAAc;QACzB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAE5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC;YAEzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACtD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,WAAW,CAAC,GAAG,EAAE,CAAC;QAClB,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAC1D,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACxB,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,GAAG,CAAC,MAAM,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAA0B;IAE1B,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAE3C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE9B,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,CAAC,cAAc,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACzE,KAAK,MAAM,cAAc,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBAChD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;oBACnC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,CAAC,WAAW,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACrE,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC9C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;oBAClC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAA0B;IAE1B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,MAAM,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;YAChC,SAAS;QACX,CAAC;QAED,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1D,SAAS;QACX,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,KAA0B;IAE1B,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACtB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,SAAS,GAAG,CAAC,MAAc,EAAE,KAAa;QACxC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAE1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC3C,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC5C,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,GAAG,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC"}

package/dist/utilities/workflow-graph-builder.d.ts

@@ -0,0 +1,37 @@
+import { WorkflowGraph, EdgeCondition, STABLE_WORKFLOW_PHASE, STABLE_WORKFLOW_BRANCH, ConditionalEvaluationContext } from '../types/index.js';
+export declare class WorkflowGraphBuilder<RequestDataType = any, ResponseDataType = any> {
+    private nodes;
+    private edges;
+    private entryPointId?;
+    private exitPointIds;
+    private metadata;
+    private enforceDAG;
+    addPhase(id: string, phase: STABLE_WORKFLOW_PHASE<RequestDataType, ResponseDataType>): this;
+    addBranch(id: string, branch: STABLE_WORKFLOW_BRANCH<RequestDataType, ResponseDataType>): this;
+    addConditional(id: string, evaluate: (context: ConditionalEvaluationContext<ResponseDataType>) => string | Promise<string>): this;
+    addParallelGroup(id: string, nodeIds: string[]): this;
+    addMergePoint(id: string, waitForNodes: string[]): this;
+    connect(from: string, to: string, options?: {
+        condition?: EdgeCondition;
+        weight?: number;
+        label?: string;
+        metadata?: Record<string, any>;
+    }): this;
+    connectSequence(...nodeIds: string[]): this;
+    connectToMany(from: string, toNodes: string[], condition?: EdgeCondition): this;
+    connectManyTo(fromNodes: string[], to: string, condition?: EdgeCondition): this;
+    setEntryPoint(id: string): this;
+    addExitPoint(id: string): this;
+    setMetadata(metadata: Record<string, any>): this;
+    setEnforceDAG(enforce: boolean): this;
+    build(): WorkflowGraph<RequestDataType, ResponseDataType>;
+    private detectExitPoints;
+    clear(): this;
+    getNodeCount(): number;
+    getEdgeCount(): number;
+    hasNode(id: string): boolean;
+    removeNode(id: string): this;
+    removeEdge(from: string, to: string): this;
+}
+export declare function createLinearWorkflowGraph<T = any, R = any>(phases: STABLE_WORKFLOW_PHASE<T, R>[]): WorkflowGraph<T, R>;
+//# sourceMappingURL=workflow-graph-builder.d.ts.map

package/dist/utilities/workflow-graph-builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow-graph-builder.d.ts","sourceRoot":"","sources":["../../src/utilities/workflow-graph-builder.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,aAAa,EAGb,aAAa,EACb,qBAAqB,EACrB,sBAAsB,EACtB,4BAA4B,EAC7B,MAAM,mBAAmB,CAAC;AAI3B,qBAAa,oBAAoB,CAAC,eAAe,GAAG,GAAG,EAAE,gBAAgB,GAAG,GAAG;IAC7E,OAAO,CAAC,KAAK,CAAsE;IACnF,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,YAAY,CAAC,CAAS;IAC9B,OAAO,CAAC,YAAY,CAAgB;IACpC,OAAO,CAAC,QAAQ,CAA2B;IAC3C,OAAO,CAAC,UAAU,CAAiB;IAEnC,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,qBAAqB,CAAC,eAAe,EAAE,gBAAgB,CAAC,GAAG,IAAI;IAc3F,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,sBAAsB,CAAC,eAAe,EAAE,gBAAgB,CAAC,GAAG,IAAI;IAc9F,cAAc,CACZ,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,CAAC,OAAO,EAAE,4BAA4B,CAAC,gBAAgB,CAAC,KAAK,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,GAC9F,IAAI;IAcP,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAkBrD,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,IAAI;IAkBvD,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAC1C,SAAS,CAAC,EAAE,aAAa,CAAC;QAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;KAChC,GAAG,IAAI;IAiBR,eAAe,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAO3C,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,SAAS,CAAC,EAAE,aAAa,GAAG,IAAI;IAO/E,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,aAAa,GAAG,IAAI;IAO/E,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAQ/B,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAU9B,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI;IAKhD,aAAa,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI;IAKrC,KAAK,IAAI,aAAa,CAAC,eAAe,EAAE,gBAAgB,CAAC;IA+BzD,OAAO,CAAC,gBAAgB;IAaxB,KAAK,IAAI,IAAI;IASb,YAAY,IAAI,MAAM;IAItB,YAAY,IAAI,MAAM;IAQtB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAkB5B,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI;CAY3C;AAED,wBAAgB,yBAAyB,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EACxD,MAAM,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GACpC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAiBrB"}

package/dist/utilities/workflow-graph-builder.js

@@ -0,0 +1,225 @@
+import { WorkflowNodeTypes } from '../enums/index.js';
+import { detectCycles } from './validate-workflow-graph.js';
+export class WorkflowGraphBuilder {
+    nodes = new Map();
+    edges = new Map();
+    entryPointId;
+    exitPointIds = [];
+    metadata = {};
+    enforceDAG = true;
+    addPhase(id, phase) {
+        if (this.nodes.has(id)) {
+            throw new Error(`Node with id '${id}' already exists`);
+        }
+        this.nodes.set(id, {
+            id,
+            type: WorkflowNodeTypes.PHASE,
+            phase: { ...phase, id }
+        });
+        return this;
+    }
+    addBranch(id, branch) {
+        if (this.nodes.has(id)) {
+            throw new Error(`Node with id '${id}' already exists`);
+        }
+        this.nodes.set(id, {
+            id,
+            type: WorkflowNodeTypes.BRANCH,
+            branch: { ...branch, id }
+        });
+        return this;
+    }
+    addConditional(id, evaluate) {
+        if (this.nodes.has(id)) {
+            throw new Error(`Node with id '${id}' already exists`);
+        }
+        this.nodes.set(id, {
+            id,
+            type: WorkflowNodeTypes.CONDITIONAL,
+            condition: { evaluate }
+        });
+        return this;
+    }
+    addParallelGroup(id, nodeIds) {
+        if (this.nodes.has(id)) {
+            throw new Error(`Node with id '${id}' already exists`);
+        }
+        if (nodeIds.length === 0) {
+            throw new Error('Parallel group must have at least one node');
+        }
+        this.nodes.set(id, {
+            id,
+            type: WorkflowNodeTypes.PARALLEL_GROUP,
+            parallelNodes: [...nodeIds]
+        });
+        return this;
+    }
+    addMergePoint(id, waitForNodes) {
+        if (this.nodes.has(id)) {
+            throw new Error(`Node with id '${id}' already exists`);
+        }
+        if (waitForNodes.length === 0) {
+            throw new Error('Merge point must wait for at least one node');
+        }
+        this.nodes.set(id, {
+            id,
+            type: WorkflowNodeTypes.MERGE_POINT,
+            waitForNodes: [...waitForNodes]
+        });
+        return this;
+    }
+    connect(from, to, options) {
+        if (!this.edges.has(from)) {
+            this.edges.set(from, []);
+        }
+        this.edges.get(from).push({
+            from,
+            to,
+            condition: options?.condition,
+            weight: options?.weight,
+            label: options?.label,
+            metadata: options?.metadata
+        });
+        return this;
+    }
+    connectSequence(...nodeIds) {
+        for (let i = 0; i < nodeIds.length - 1; i++) {
+            this.connect(nodeIds[i], nodeIds[i + 1]);
+        }
+        return this;
+    }
+    connectToMany(from, toNodes, condition) {
+        for (const to of toNodes) {
+            this.connect(from, to, { condition });
+        }
+        return this;
+    }
+    connectManyTo(fromNodes, to, condition) {
+        for (const from of fromNodes) {
+            this.connect(from, to, { condition });
+        }
+        return this;
+    }
+    setEntryPoint(id) {
+        if (!this.nodes.has(id)) {
+            throw new Error(`Entry point node '${id}' does not exist`);
+        }
+        this.entryPointId = id;
+        return this;
+    }
+    addExitPoint(id) {
+        if (!this.nodes.has(id)) {
+            throw new Error(`Exit point node '${id}' does not exist`);
+        }
+        if (!this.exitPointIds.includes(id)) {
+            this.exitPointIds.push(id);
+        }
+        return this;
+    }
+    setMetadata(metadata) {
+        this.metadata = { ...this.metadata, ...metadata };
+        return this;
+    }
+    setEnforceDAG(enforce) {
+        this.enforceDAG = enforce;
+        return this;
+    }
+    build() {
+        if (!this.entryPointId) {
+            throw new Error('Entry point must be set before building the graph');
+        }
+        if (this.exitPointIds.length === 0) {
+            this.exitPointIds = this.detectExitPoints();
+        }
+        const graph = {
+            nodes: new Map(this.nodes),
+            edges: new Map(this.edges),
+            entryPoint: this.entryPointId,
+            exitPoints: this.exitPointIds.length > 0 ? [...this.exitPointIds] : undefined,
+            metadata: { ...this.metadata }
+        };
+        if (this.enforceDAG) {
+            const cycles = detectCycles(graph);
+            if (cycles.length > 0) {
+                const cycleDescriptions = cycles.map((cycle) => cycle.join(' → ')).join('; ');
+                throw new Error(`Cannot build graph: DAG constraint violated. Found ${cycles.length} cycle(s): ${cycleDescriptions}. ` +
+                    `Cycles must be removed to ensure workflow can complete. Use builder.setEnforceDAG(false) to disable this check.`);
+            }
+        }
+        return graph;
+    }
+    detectExitPoints() {
+        const exitPoints = [];
+        for (const [nodeId] of this.nodes) {
+            const outgoingEdges = this.edges.get(nodeId);
+            if (!outgoingEdges || outgoingEdges.length === 0) {
+                exitPoints.push(nodeId);
+            }
+        }
+        return exitPoints;
+    }
+    clear() {
+        this.nodes.clear();
+        this.edges.clear();
+        this.entryPointId = undefined;
+        this.exitPointIds = [];
+        this.metadata = {};
+        return this;
+    }
+    getNodeCount() {
+        return this.nodes.size;
+    }
+    getEdgeCount() {
+        let count = 0;
+        for (const edges of this.edges.values()) {
+            count += edges.length;
+        }
+        return count;
+    }
+    hasNode(id) {
+        return this.nodes.has(id);
+    }
+    removeNode(id) {
+        this.nodes.delete(id);
+        this.edges.delete(id);
+        for (const [nodeId, edges] of this.edges) {
+            const filteredEdges = edges.filter(edge => edge.to !== id);
+            if (filteredEdges.length === 0) {
+                this.edges.delete(nodeId);
+            }
+            else {
+                this.edges.set(nodeId, filteredEdges);
+            }
+        }
+        this.exitPointIds = this.exitPointIds.filter(exitId => exitId !== id);
+        return this;
+    }
+    removeEdge(from, to) {
+        const edges = this.edges.get(from);
+        if (edges) {
+            const filteredEdges = edges.filter(edge => edge.to !== to);
+            if (filteredEdges.length === 0) {
+                this.edges.delete(from);
+            }
+            else {
+                this.edges.set(from, filteredEdges);
+            }
+        }
+        return this;
+    }
+}
+export function createLinearWorkflowGraph(phases) {
+    const builder = new WorkflowGraphBuilder();
+    if (phases.length === 0) {
+        throw new Error('Cannot create workflow from empty phases array');
+    }
+    phases.forEach((phase, index) => {
+        const phaseId = phase.id || `phase-${index + 1}`;
+        builder.addPhase(phaseId, phase);
+    });
+    const phaseIds = phases.map((p, i) => p.id || `phase-${i + 1}`);
+    builder.connectSequence(...phaseIds);
+    builder.setEntryPoint(phaseIds[0]);
+    return builder.build();
+}
+//# sourceMappingURL=workflow-graph-builder.js.map

package/dist/utilities/workflow-graph-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow-graph-builder.js","sourceRoot":"","sources":["../../src/utilities/workflow-graph-builder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAYrD,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAE5D,MAAM,OAAO,oBAAoB;IACvB,KAAK,GAAG,IAAI,GAAG,EAA2D,CAAC;IAC3E,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC1C,YAAY,CAAU;IACtB,YAAY,GAAa,EAAE,CAAC;IAC5B,QAAQ,GAAwB,EAAE,CAAC;IACnC,UAAU,GAAY,IAAI,CAAC;IAEnC,QAAQ,CAAC,EAAU,EAAE,KAA+D;QAClF,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,IAAI,EAAE,iBAAiB,CAAC,KAAK;YAC7B,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,EAAE;SACxB,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,EAAU,EAAE,MAAiE;QACrF,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,IAAI,EAAE,iBAAiB,CAAC,MAAM;YAC9B,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE;SAC1B,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,cAAc,CACZ,EAAU,EACV,QAA+F;QAE/F,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,IAAI,EAAE,iBAAiB,CAAC,WAAW;YACnC,SAAS,EAAE,EAAE,QAAQ,EAAE;SACxB,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gBAAgB,CAAC,EAAU,EAAE,OAAiB;QAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,IAAI,EAAE,iBAAiB,CAAC,cAAc;YACtC,aAAa,EAAE,CAAC,GAAG,OAAO,CAAC;SAC5B,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa,CAAC,EAAU,EAAE,YAAsB;QAC9C,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,IAAI,EAAE,iBAAiB,CAAC,WAAW;YACnC,YAAY,EAAE,CAAC,GAAG,YAAY,CAAC;SAChC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,OAKjC;QACC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3B,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC;YACzB,IAAI;YACJ,EAAE;YACF,SAAS,EAAE,OAAO,EAAE,SAAS;YAC7B,MAAM,EAAE,OAAO,EAAE,MAAM;YACvB,KAAK,EAAE,OAAO,EAAE,KAAK;YACrB,QAAQ,EAAE,OAAO,EAAE,QAAQ;SAC5B,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,eAAe,CAAC,GAAG,OAAiB;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa,CAAC,IAAY,EAAE,OAAiB,EAAE,SAAyB;QACtE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa,CAAC,SAAmB,EAAE,EAAU,EAAE,SAAyB;QACtE,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa,CAAC,EAAU;QACtB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,qBAAqB,EAAE,kBAAkB,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,YAAY,CAAC,EAAU;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,oBAAoB,EAAE,kBAAkB,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW,CAAC,QAA6B;QACvC,IAAI,CAAC,QAAQ,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa,CAAC,OAAgB;QAC5B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;QACvE,CAAC;QAED,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC9C,CAAC;QAED,MAAM,KAAK,GAAqD;YAC9D,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC1B,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC1B,UAAU,EAAE,IAAI,CAAC,YAAY;YAC7B,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS;YAC7E,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;SAC/B,CAAC;QAEF,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,iBAAiB,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAe,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxF,MAAM,IAAI,KAAK,CACb,sDAAsD,MAAM,CAAC,MAAM,cAAc,iBAAiB,IAAI;oBACtG,iHAAiH,CAClH,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,gBAAgB;QACtB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;QAC9B,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,YAAY;QACV,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;QACxB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;QAEtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,UAAU,CAAC,IAAY,EAAE,EAAU;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED,MAAM,UAAU,yBAAyB,CACvC,MAAqC;IAErC,MAAM,OAAO,GAAG,IAAI,oBAAoB,EAAQ,CAAC;IAEjD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,OAAO,GAAG,KAAK,CAAC,EAAE,IAAI,SAAS,KAAK,GAAG,CAAC,EAAE,CAAC;QACjD,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChE,OAAO,CAAC,eAAe,CAAC,GAAG,QAAQ,CAAC,CAAC;IACrC,OAAO,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnC,OAAO,OAAO,CAAC,KAAK,EAAE,CAAC;AACzB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@emmvish/stable-request",
-  "version": "1.8.0",
+  "version": "1.9.0",
   "description": "A production-grade HTTP Workflow Execution Engine for Node.js that transforms unreliable API calls into resilient, observable, and sophisticated multi-phase workflows with intelligent retry strategies, circuit breakers, and advanced execution patterns.",
   "type": "module",
   "main": "dist/index.js",