flowcraft 1.0.0 → 2.1.0

package/dist/chunk-UETC63DP.js

@@ -0,0 +1,65 @@
+import { analyzeBlueprint } from './chunk-HN72TZY5.js';
+
+// src/linter.ts
+function lintBlueprint(blueprint, registry) {
+  const issues = [];
+  const nodeIds = new Set(blueprint.nodes.map((n) => n.id));
+  const registryKeys = registry instanceof Map ? new Set(registry.keys()) : new Set(Object.keys(registry));
+  for (const node of blueprint.nodes) {
+    if (!node.uses.startsWith("batch-") && !node.uses.startsWith("loop-") && !registryKeys.has(node.uses)) {
+      issues.push({
+        code: "MISSING_NODE_IMPLEMENTATION",
+        message: `Node implementation key '${node.uses}' is not found in the provided registry.`,
+        nodeId: node.id
+      });
+    }
+  }
+  for (const edge of blueprint.edges || []) {
+    if (!nodeIds.has(edge.source)) {
+      issues.push({
+        code: "INVALID_EDGE_SOURCE",
+        message: `Edge source '${edge.source}' does not correspond to a valid node ID.`,
+        relatedId: edge.target
+      });
+    }
+    if (!nodeIds.has(edge.target)) {
+      issues.push({
+        code: "INVALID_EDGE_TARGET",
+        message: `Edge target '${edge.target}' does not correspond to a valid node ID.`,
+        relatedId: edge.source
+      });
+    }
+  }
+  if (blueprint.nodes.length > 1) {
+    const analysis = analyzeBlueprint(blueprint);
+    const connectedNodes = /* @__PURE__ */ new Set();
+    const nodesToVisit = [...analysis.startNodeIds];
+    const visited = /* @__PURE__ */ new Set();
+    while (nodesToVisit.length > 0) {
+      const currentId = nodesToVisit.pop();
+      if (!currentId || visited.has(currentId)) continue;
+      visited.add(currentId);
+      connectedNodes.add(currentId);
+      for (const e of blueprint.edges.filter((e2) => e2.source === currentId)) {
+        nodesToVisit.push(e.target);
+      }
+    }
+    for (const nodeId of nodeIds) {
+      if (!connectedNodes.has(nodeId)) {
+        issues.push({
+          code: "ORPHAN_NODE",
+          message: `Node '${nodeId}' is not reachable from any start node.`,
+          nodeId
+        });
+      }
+    }
+  }
+  return {
+    isValid: issues.length === 0,
+    issues
+  };
+}
+
+export { lintBlueprint };
+//# sourceMappingURL=chunk-UETC63DP.js.map
+//# sourceMappingURL=chunk-UETC63DP.js.map

package/dist/chunk-UETC63DP.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/linter.ts"],"names":["e"],"mappings":";;;AA6BO,SAAS,aAAA,CACf,WACA,QAAA,EACe;AACf,EAAA,MAAM,SAAwB,EAAC;AAC/B,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AACxD,EAAA,MAAM,YAAA,GAAe,QAAA,YAAoB,GAAA,GAAM,IAAI,IAAI,QAAA,CAAS,IAAA,EAAM,CAAA,GAAI,IAAI,GAAA,CAAI,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAC,CAAA;AAGvG,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,QAAQ,KAAK,CAAC,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA,IAAK,CAAC,aAAa,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA,EAAG;AACtG,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACX,IAAA,EAAM,6BAAA;AAAA,QACN,OAAA,EAAS,CAAA,yBAAA,EAA4B,IAAA,CAAK,IAAI,CAAA,wCAAA,CAAA;AAAA,QAC9C,QAAQ,IAAA,CAAK;AAAA,OACb,CAAA;AAAA,IACF;AAAA,EACD;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,KAAA,IAAS,EAAC,EAAG;AACzC,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9B,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACX,IAAA,EAAM,qBAAA;AAAA,QACN,OAAA,EAAS,CAAA,aAAA,EAAgB,IAAA,CAAK,MAAM,CAAA,yCAAA,CAAA;AAAA,QACpC,WAAW,IAAA,CAAK;AAAA,OAChB,CAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9B,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACX,IAAA,EAAM,qBAAA;AAAA,QACN,OAAA,EAAS,CAAA,aAAA,EAAgB,IAAA,CAAK,MAAM,CAAA,yCAAA,CAAA;AAAA,QACpC,WAAW,IAAA,CAAK;AAAA,OAChB,CAAA;AAAA,IACF;AAAA,EACD;AAGA,EAAA,IAAI,SAAA,CAAU,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG;AAC/B,IAAA,MAAM,QAAA,GAAW,iBAAiB,SAAS,CAAA;AAC3C,IAAA,MAAM,cAAA,uBAAqB,GAAA,EAAY;AACvC,IAAA,MAAM,YAAA,GAAe,CAAC,GAAG,QAAA,CAAS,YAAY,CAAA;AAC9C,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,IAAA,OAAO,YAAA,CAAa,SAAS,CAAA,EAAG;AAC/B,MAAA,MAAM,SAAA,GAAY,aAAa,GAAA,EAAI;AACnC,MAAA,IAAI,CAAC,SAAA,IAAa,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AAE1C,MAAA,OAAA,CAAQ,IAAI,SAAS,CAAA;AACrB,MAAA,cAAA,CAAe,IAAI,SAAS,CAAA;AAE5B,MAAA,KAAA,MAAW,CAAA,IAAK,UAAU,KAAA,CAAM,MAAA,CAAO,CAACA,EAAAA,KAAMA,EAAAA,CAAE,MAAA,KAAW,SAAS,CAAA,EAAG;AACtE,QAAA,YAAA,CAAa,IAAA,CAAK,EAAE,MAAM,CAAA;AAAA,MAC3B;AAAA,IACD;AAEA,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC7B,MAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAI,MAAM,CAAA,EAAG;AAChC,QAAA,MAAA,CAAO,IAAA,CAAK;AAAA,UACX,IAAA,EAAM,aAAA;AAAA,UACN,OAAA,EAAS,SAAS,MAAM,CAAA,uCAAA,CAAA;AAAA,UACxB;AAAA,SACA,CAAA;AAAA,MACF;AAAA,IACD;AAAA,EACD;AAEA,EAAA,OAAO;AAAA,IACN,OAAA,EAAS,OAAO,MAAA,KAAW,CAAA;AAAA,IAC3B;AAAA,GACD;AACD","file":"chunk-UETC63DP.js","sourcesContent":["import { analyzeBlueprint } from './analysis'\nimport type { NodeClass, NodeFunction, WorkflowBlueprint } from './types'\n\nexport type LinterIssueCode =\n\t| 'INVALID_EDGE_SOURCE'\n\t| 'INVALID_EDGE_TARGET'\n\t| 'MISSING_NODE_IMPLEMENTATION'\n\t| 'ORPHAN_NODE'\n\nexport interface LinterIssue {\n\tcode: LinterIssueCode\n\tmessage: string\n\tnodeId?: string\n\trelatedId?: string\n}\n\nexport interface LinterResult {\n\tisValid: boolean\n\tissues: LinterIssue[]\n}\n\n/**\n * Statically analyzes a workflow blueprint against a registry of implementations\n * to find common errors before runtime.\n *\n * @param blueprint The WorkflowBlueprint to analyze.\n * @param registry A map of node implementations (functions or classes) to check against.\n * @returns A LinterResult object containing any issues found.\n */\nexport function lintBlueprint(\n\tblueprint: WorkflowBlueprint,\n\tregistry: Map<string, NodeFunction | NodeClass> | Record<string, NodeFunction | NodeClass>,\n): LinterResult {\n\tconst issues: LinterIssue[] = []\n\tconst nodeIds = new Set(blueprint.nodes.map((n) => n.id))\n\tconst registryKeys = registry instanceof Map ? new Set(registry.keys()) : new Set(Object.keys(registry))\n\n\t// check for missing node implementations\n\tfor (const node of blueprint.nodes) {\n\t\tif (!node.uses.startsWith('batch-') && !node.uses.startsWith('loop-') && !registryKeys.has(node.uses)) {\n\t\t\tissues.push({\n\t\t\t\tcode: 'MISSING_NODE_IMPLEMENTATION',\n\t\t\t\tmessage: `Node implementation key '${node.uses}' is not found in the provided registry.`,\n\t\t\t\tnodeId: node.id,\n\t\t\t})\n\t\t}\n\t}\n\n\t// check for graph integrity (edges must point to valid nodes)\n\tfor (const edge of blueprint.edges || []) {\n\t\tif (!nodeIds.has(edge.source)) {\n\t\t\tissues.push({\n\t\t\t\tcode: 'INVALID_EDGE_SOURCE',\n\t\t\t\tmessage: `Edge source '${edge.source}' does not correspond to a valid node ID.`,\n\t\t\t\trelatedId: edge.target,\n\t\t\t})\n\t\t}\n\t\tif (!nodeIds.has(edge.target)) {\n\t\t\tissues.push({\n\t\t\t\tcode: 'INVALID_EDGE_TARGET',\n\t\t\t\tmessage: `Edge target '${edge.target}' does not correspond to a valid node ID.`,\n\t\t\t\trelatedId: edge.source,\n\t\t\t})\n\t\t}\n\t}\n\n\t// check for orphan nodes (not connected to the main graph)\n\tif (blueprint.nodes.length > 1) {\n\t\tconst analysis = analyzeBlueprint(blueprint)\n\t\tconst connectedNodes = new Set<string>()\n\t\tconst nodesToVisit = [...analysis.startNodeIds]\n\t\tconst visited = new Set<string>()\n\n\t\twhile (nodesToVisit.length > 0) {\n\t\t\tconst currentId = nodesToVisit.pop()\n\t\t\tif (!currentId || visited.has(currentId)) continue\n\n\t\t\tvisited.add(currentId)\n\t\t\tconnectedNodes.add(currentId)\n\n\t\t\tfor (const e of blueprint.edges.filter((e) => e.source === currentId)) {\n\t\t\t\tnodesToVisit.push(e.target)\n\t\t\t}\n\t\t}\n\n\t\tfor (const nodeId of nodeIds) {\n\t\t\tif (!connectedNodes.has(nodeId)) {\n\t\t\t\tissues.push({\n\t\t\t\t\tcode: 'ORPHAN_NODE',\n\t\t\t\t\tmessage: `Node '${nodeId}' is not reachable from any start node.`,\n\t\t\t\t\tnodeId,\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tisValid: issues.length === 0,\n\t\tissues,\n\t}\n}\n"]}

package/dist/chunk-UMXW3TCY.js

@@ -0,0 +1,165 @@
+import { CancelledWorkflowError } from './chunk-5ZXV3R5D.js';
+import { analyzeBlueprint } from './chunk-HN72TZY5.js';
+
+// src/runtime/traverser.ts
+var GraphTraverser = class {
+  constructor(blueprint, runtime, state, functionRegistry, executionId, signal, concurrency) {
+    this.runtime = runtime;
+    this.state = state;
+    this.functionRegistry = functionRegistry;
+    this.executionId = executionId;
+    this.signal = signal;
+    this.concurrency = concurrency;
+    this.dynamicBlueprint = structuredClone(blueprint);
+    this.allPredecessors = /* @__PURE__ */ new Map();
+    for (const node of this.dynamicBlueprint.nodes) {
+      this.allPredecessors.set(node.id, /* @__PURE__ */ new Set());
+    }
+    for (const edge of this.dynamicBlueprint.edges) {
+      this.allPredecessors.get(edge.target)?.add(edge.source);
+    }
+    const analysis = analyzeBlueprint(blueprint);
+    this.frontier = new Set(analysis.startNodeIds.filter((id) => !this.isFallbackNode(id)));
+    if (this.frontier.size === 0 && analysis.cycles.length > 0 && this.runtime.options.strict !== true) {
+      const uniqueStartNodes = /* @__PURE__ */ new Set();
+      for (const cycle of analysis.cycles) {
+        if (cycle.length > 0) uniqueStartNodes.add(cycle[0]);
+      }
+      this.frontier = new Set(uniqueStartNodes);
+    }
+  }
+  frontier = /* @__PURE__ */ new Set();
+  allPredecessors;
+  dynamicBlueprint;
+  isFallbackNode(nodeId) {
+    return this.dynamicBlueprint.nodes.some((n) => n.config?.fallback === nodeId);
+  }
+  async traverse() {
+    try {
+      this.signal?.throwIfAborted();
+    } catch (error) {
+      if (error instanceof DOMException && error.name === "AbortError")
+        throw new CancelledWorkflowError("Workflow cancelled");
+      throw error;
+    }
+    let iterations = 0;
+    const maxIterations = 1e4;
+    while (this.frontier.size > 0) {
+      if (++iterations > maxIterations) throw new Error("Traversal exceeded maximum iterations, possible infinite loop");
+      try {
+        this.signal?.throwIfAborted();
+        const currentJobs = Array.from(this.frontier);
+        this.frontier.clear();
+        const settledResults = await this.executeWithConcurrency(currentJobs);
+        const completedThisTurn = /* @__PURE__ */ new Set();
+        for (const promiseResult of settledResults) {
+          if (promiseResult.status === "rejected") {
+            const { nodeId: nodeId2, error } = promiseResult.reason;
+            if (error instanceof CancelledWorkflowError) throw error;
+            this.state.addError(nodeId2, error);
+            continue;
+          }
+          const { nodeId, result } = promiseResult.value;
+          this.state.addCompletedNode(nodeId, result.output);
+          completedThisTurn.add(nodeId);
+          if (result._fallbackExecuted) this.state.markFallbackExecuted();
+          await this.handleDynamicNodes(nodeId, result);
+          if (!result._fallbackExecuted) {
+            const matched = await this.runtime.determineNextNodes(
+              this.dynamicBlueprint,
+              nodeId,
+              result,
+              this.state.getContext()
+            );
+            const loopControllerMatch = matched.find((m) => m.node.uses === "loop-controller");
+            const finalMatched = loopControllerMatch ? [loopControllerMatch] : matched;
+            for (const { node, edge } of finalMatched) {
+              const joinStrategy = node.config?.joinStrategy || "all";
+              if (joinStrategy !== "any" && this.state.getCompletedNodes().has(node.id)) continue;
+              await this.runtime.applyEdgeTransform(edge, result, node, this.state.getContext(), this.allPredecessors);
+              const requiredPredecessors = this.allPredecessors.get(node.id);
+              if (!requiredPredecessors) continue;
+              const isReady = joinStrategy === "any" ? [...requiredPredecessors].some((p) => completedThisTurn.has(p)) : [...requiredPredecessors].every((p) => this.state.getCompletedNodes().has(p));
+              if (isReady) this.frontier.add(node.id);
+            }
+            if (matched.length === 0) {
+              for (const [potentialNextId, predecessors] of this.allPredecessors) {
+                if (predecessors.has(nodeId) && !this.state.getCompletedNodes().has(potentialNextId)) {
+                  const joinStrategy = this.dynamicBlueprint.nodes.find((n) => n.id === potentialNextId)?.config?.joinStrategy || "all";
+                  const isReady = joinStrategy === "any" ? [...predecessors].some((p) => completedThisTurn.has(p)) : [...predecessors].every((p) => this.state.getCompletedNodes().has(p));
+                  if (isReady) this.frontier.add(potentialNextId);
+                }
+              }
+            }
+          }
+        }
+      } catch (error) {
+        if (error instanceof DOMException && error.name === "AbortError") {
+          throw new CancelledWorkflowError("Workflow cancelled");
+        }
+        throw error;
+      }
+    }
+  }
+  async executeWithConcurrency(nodeIds) {
+    const maxConcurrency = this.concurrency || nodeIds.length;
+    const results = [];
+    for (let i = 0; i < nodeIds.length; i += maxConcurrency) {
+      const batch = nodeIds.slice(i, i + maxConcurrency);
+      const batchPromises = batch.map(async (nodeId) => {
+        try {
+          const result = await this.runtime.executeNode(
+            this.dynamicBlueprint,
+            nodeId,
+            this.state,
+            this.allPredecessors,
+            this.functionRegistry,
+            this.executionId,
+            this.signal
+          );
+          results.push({
+            status: "fulfilled",
+            value: { nodeId, result }
+          });
+        } catch (error) {
+          results.push({
+            status: "rejected",
+            reason: { nodeId, error }
+          });
+        }
+      });
+      await Promise.all(batchPromises);
+    }
+    return results;
+  }
+  async handleDynamicNodes(nodeId, result) {
+    if (result.dynamicNodes && result.dynamicNodes.length > 0) {
+      const gatherNodeId = result.output?.gatherNodeId;
+      for (const dynamicNode of result.dynamicNodes) {
+        this.dynamicBlueprint.nodes.push(dynamicNode);
+        this.allPredecessors.set(dynamicNode.id, /* @__PURE__ */ new Set([nodeId]));
+        if (gatherNodeId) {
+          this.allPredecessors.get(gatherNodeId)?.add(dynamicNode.id);
+        }
+        this.frontier.add(dynamicNode.id);
+      }
+    }
+  }
+  getAllNodeIds() {
+    return new Set(this.dynamicBlueprint.nodes.map((n) => n.id));
+  }
+  getFallbackNodeIds() {
+    const fallbackNodeIds = /* @__PURE__ */ new Set();
+    for (const node of this.dynamicBlueprint.nodes) {
+      if (node.config?.fallback) fallbackNodeIds.add(node.config.fallback);
+    }
+    return fallbackNodeIds;
+  }
+  getDynamicBlueprint() {
+    return this.dynamicBlueprint;
+  }
+};
+
+export { GraphTraverser };
+//# sourceMappingURL=chunk-UMXW3TCY.js.map
+//# sourceMappingURL=chunk-UMXW3TCY.js.map

package/dist/chunk-UMXW3TCY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/runtime/traverser.ts"],"names":["nodeId"],"mappings":";;;;AAMO,IAAM,iBAAN,MAAsG;AAAA,EAK5G,YACC,SAAA,EACQ,OAAA,EACA,OACA,gBAAA,EACA,WAAA,EACA,QACA,WAAA,EACP;AANO,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AACA,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,gBAAA,GAAA,gBAAA;AACA,IAAA,IAAA,CAAA,WAAA,GAAA,WAAA;AACA,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACA,IAAA,IAAA,CAAA,WAAA,GAAA,WAAA;AAER,IAAA,IAAA,CAAK,gBAAA,GAAmB,gBAAgB,SAAS,CAAA;AACjD,IAAA,IAAA,CAAK,eAAA,uBAAsB,GAAA,EAAyB;AACpD,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO;AAC/C,MAAA,IAAA,CAAK,gBAAgB,GAAA,CAAI,IAAA,CAAK,EAAA,kBAAI,IAAI,KAAK,CAAA;AAAA,IAC5C;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO;AAC/C,MAAA,IAAA,CAAK,gBAAgB,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,IACvD;AACA,IAAA,MAAM,QAAA,GAAW,iBAAiB,SAAS,CAAA;AAC3C,IAAA,IAAA,CAAK,QAAA,GAAW,IAAI,GAAA,CAAI,QAAA,CAAS,YAAA,CAAa,MAAA,CAAO,CAAC,EAAA,KAAO,CAAC,IAAA,CAAK,cAAA,CAAe,EAAE,CAAC,CAAC,CAAA;AACtF,IAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,CAAA,IAAK,QAAA,CAAS,MAAA,CAAO,MAAA,GAAS,CAAA,IAAK,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,MAAA,KAAW,IAAA,EAAM;AACnG,MAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAY;AACzC,MAAA,KAAA,MAAW,KAAA,IAAS,SAAS,MAAA,EAAQ;AACpC,QAAA,IAAI,MAAM,MAAA,GAAS,CAAA,mBAAoB,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,MACpD;AACA,MAAA,IAAA,CAAK,QAAA,GAAW,IAAI,GAAA,CAAI,gBAAgB,CAAA;AAAA,IACzC;AAAA,EACD;AAAA,EA9BQ,QAAA,uBAAe,GAAA,EAAY;AAAA,EAC3B,eAAA;AAAA,EACA,gBAAA;AAAA,EA8BA,eAAe,MAAA,EAAyB;AAC/C,IAAA,OAAO,IAAA,CAAK,iBAAiB,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,EAAQ,QAAA,KAAa,MAAM,CAAA;AAAA,EAC7E;AAAA,EAEA,MAAM,QAAA,GAA0B;AAC/B,IAAA,IAAI;AACH,MAAA,IAAA,CAAK,QAAQ,cAAA,EAAe;AAAA,IAC7B,SAAS,KAAA,EAAO;AACf,MAAA,IAAI,KAAA,YAAiB,YAAA,IAAgB,KAAA,CAAM,IAAA,KAAS,YAAA;AACnD,QAAA,MAAM,IAAI,uBAAuB,oBAAoB,CAAA;AACtD,MAAA,MAAM,KAAA;AAAA,IACP;AACA,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,MAAM,aAAA,GAAgB,GAAA;AACtB,IAAA,OAAO,IAAA,CAAK,QAAA,CAAS,IAAA,GAAO,CAAA,EAAG;AAC9B,MAAA,IAAI,EAAE,UAAA,GAAa,aAAA,EAAe,MAAM,IAAI,MAAM,+DAA+D,CAAA;AAEjH,MAAA,IAAI;AACH,QAAA,IAAA,CAAK,QAAQ,cAAA,EAAe;AAC5B,QAAA,MAAM,WAAA,GAAc,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,QAAQ,CAAA;AAC5C,QAAA,IAAA,CAAK,SAAS,KAAA,EAAM;AACpB,QAAA,MAAM,cAAA,GAAiB,MAAM,IAAA,CAAK,sBAAA,CAAuB,WAAW,CAAA;AACpE,QAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAY;AAC1C,QAAA,KAAA,MAAW,iBAAiB,cAAA,EAAgB;AAC3C,UAAA,IAAI,aAAA,CAAc,WAAW,UAAA,EAAY;AACxC,YAAA,MAAM,EAAE,MAAA,EAAAA,OAAAA,EAAQ,KAAA,KAAU,aAAA,CAAc,MAAA;AACxC,YAAA,IAAI,KAAA,YAAiB,wBAAwB,MAAM,KAAA;AACnD,YAAA,IAAA,CAAK,KAAA,CAAM,QAAA,CAASA,OAAAA,EAAQ,KAAc,CAAA;AAC1C,YAAA;AAAA,UACD;AACA,UAAA,MAAM,EAAE,MAAA,EAAQ,MAAA,EAAO,GAAI,aAAA,CAAc,KAAA;AACzC,UAAA,IAAA,CAAK,KAAA,CAAM,gBAAA,CAAiB,MAAA,EAAQ,MAAA,CAAO,MAAM,CAAA;AACjD,UAAA,iBAAA,CAAkB,IAAI,MAAM,CAAA;AAC5B,UAAA,IAAI,MAAA,CAAO,iBAAA,EAAmB,IAAA,CAAK,KAAA,CAAM,oBAAA,EAAqB;AAC9D,UAAA,MAAM,IAAA,CAAK,kBAAA,CAAmB,MAAA,EAAQ,MAAM,CAAA;AAC5C,UAAA,IAAI,CAAC,OAAO,iBAAA,EAAmB;AAC9B,YAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,kBAAA;AAAA,cAClC,IAAA,CAAK,gBAAA;AAAA,cACL,MAAA;AAAA,cACA,MAAA;AAAA,cACA,IAAA,CAAK,MAAM,UAAA;AAAW,aACvB;AAGA,YAAA,MAAM,mBAAA,GAAsB,QAAQ,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,CAAK,SAAS,iBAAiB,CAAA;AACjF,YAAA,MAAM,YAAA,GAAe,mBAAA,GAAsB,CAAC,mBAAmB,CAAA,GAAI,OAAA;AAEnE,YAAA,KAAA,MAAW,EAAE,IAAA,EAAM,IAAA,EAAK,IAAK,YAAA,EAAc;AAC1C,cAAA,MAAM,YAAA,GAAe,IAAA,CAAK,MAAA,EAAQ,YAAA,IAAgB,KAAA;AAClD,cAAA,IAAI,YAAA,KAAiB,SAAS,IAAA,CAAK,KAAA,CAAM,mBAAkB,CAAE,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC3E,cAAA,MAAM,IAAA,CAAK,OAAA,CAAQ,kBAAA,CAAmB,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,UAAA,EAAW,EAAG,IAAA,CAAK,eAAe,CAAA;AACvG,cAAA,MAAM,oBAAA,GAAuB,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,KAAK,EAAE,CAAA;AAC7D,cAAA,IAAI,CAAC,oBAAA,EAAsB;AAC3B,cAAA,MAAM,OAAA,GACL,YAAA,KAAiB,KAAA,GACd,CAAC,GAAG,oBAAoB,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,iBAAA,CAAkB,GAAA,CAAI,CAAC,CAAC,CAAA,GAC9D,CAAC,GAAG,oBAAoB,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,IAAA,CAAK,KAAA,CAAM,iBAAA,EAAkB,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA;AAChF,cAAA,IAAI,OAAA,EAAS,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,YACvC;AACA,YAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACzB,cAAA,KAAA,MAAW,CAAC,eAAA,EAAiB,YAAY,CAAA,IAAK,KAAK,eAAA,EAAiB;AACnE,gBAAA,IAAI,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA,IAAK,CAAC,IAAA,CAAK,KAAA,CAAM,iBAAA,EAAkB,CAAE,GAAA,CAAI,eAAe,CAAA,EAAG;AACrF,kBAAA,MAAM,YAAA,GACL,IAAA,CAAK,gBAAA,CAAiB,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,eAAe,CAAA,EAAG,MAAA,EAAQ,YAAA,IAAgB,KAAA;AAC5F,kBAAA,MAAM,OAAA,GACL,YAAA,KAAiB,KAAA,GACd,CAAC,GAAG,YAAY,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,iBAAA,CAAkB,GAAA,CAAI,CAAC,CAAC,CAAA,GACtD,CAAC,GAAG,YAAY,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,IAAA,CAAK,KAAA,CAAM,iBAAA,EAAkB,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA;AACxE,kBAAA,IAAI,OAAA,EAAS,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,eAAe,CAAA;AAAA,gBAC/C;AAAA,cACD;AAAA,YACD;AAAA,UACD;AAAA,QACD;AAAA,MACD,SAAS,KAAA,EAAO;AACf,QAAA,IAAI,KAAA,YAAiB,YAAA,IAAgB,KAAA,CAAM,IAAA,KAAS,YAAA,EAAc;AACjE,UAAA,MAAM,IAAI,uBAAuB,oBAAoB,CAAA;AAAA,QACtD;AACA,QAAA,MAAM,KAAA;AAAA,MACP;AAAA,IACD;AAAA,EACD;AAAA,EAEA,MAAc,uBACb,OAAA,EAMC;AACD,IAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,WAAA,IAAe,OAAA,CAAQ,MAAA;AACnD,IAAA,MAAM,UAGF,EAAC;AAEL,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,MAAA,EAAQ,KAAK,cAAA,EAAgB;AACxD,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,IAAI,cAAc,CAAA;AACjD,MAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,GAAA,CAAI,OAAO,MAAA,KAAW;AACjD,QAAA,IAAI;AACH,UAAA,MAAM,MAAA,GAAS,MAAM,IAAA,CAAK,OAAA,CAAQ,WAAA;AAAA,YACjC,IAAA,CAAK,gBAAA;AAAA,YACL,MAAA;AAAA,YACA,IAAA,CAAK,KAAA;AAAA,YACL,IAAA,CAAK,eAAA;AAAA,YACL,IAAA,CAAK,gBAAA;AAAA,YACL,IAAA,CAAK,WAAA;AAAA,YACL,IAAA,CAAK;AAAA,WACN;AACA,UAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,YACZ,MAAA,EAAQ,WAAA;AAAA,YACR,KAAA,EAAO,EAAE,MAAA,EAAQ,MAAA;AAAO,WACxB,CAAA;AAAA,QACF,SAAS,KAAA,EAAO;AACf,UAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,YACZ,MAAA,EAAQ,UAAA;AAAA,YACR,MAAA,EAAQ,EAAE,MAAA,EAAQ,KAAA;AAAM,WACxB,CAAA;AAAA,QACF;AAAA,MACD,CAAC,CAAA;AAED,MAAA,MAAM,OAAA,CAAQ,IAAI,aAAa,CAAA;AAAA,IAChC;AAEA,IAAA,OAAO,OAAA;AAAA,EACR;AAAA,EAEA,MAAc,kBAAA,CAAmB,MAAA,EAAgB,MAAA,EAA8B;AAC9E,IAAA,IAAI,MAAA,CAAO,YAAA,IAAgB,MAAA,CAAO,YAAA,CAAa,SAAS,CAAA,EAAG;AAC1D,MAAA,MAAM,YAAA,GAAe,OAAO,MAAA,EAAQ,YAAA;AACpC,MAAA,KAAA,MAAW,WAAA,IAAe,OAAO,YAAA,EAAc;AAC9C,QAAA,IAAA,CAAK,gBAAA,CAAiB,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AAC5C,QAAA,IAAA,CAAK,eAAA,CAAgB,IAAI,WAAA,CAAY,EAAA,sBAAQ,GAAA,CAAI,CAAC,MAAM,CAAC,CAAC,CAAA;AAC1D,QAAA,IAAI,YAAA,EAAc;AACjB,UAAA,IAAA,CAAK,gBAAgB,GAAA,CAAI,YAAY,CAAA,EAAG,GAAA,CAAI,YAAY,EAAE,CAAA;AAAA,QAC3D;AACA,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,EAAE,CAAA;AAAA,MACjC;AAAA,IACD;AAAA,EACD;AAAA,EAEA,aAAA,GAA6B;AAC5B,IAAA,OAAO,IAAI,GAAA,CAAI,IAAA,CAAK,gBAAA,CAAiB,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAAA,EAC5D;AAAA,EAEA,kBAAA,GAAkC;AACjC,IAAA,MAAM,eAAA,uBAAsB,GAAA,EAAY;AACxC,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO;AAC/C,MAAA,IAAI,KAAK,MAAA,EAAQ,QAAA,kBAA0B,GAAA,CAAI,IAAA,CAAK,OAAO,QAAQ,CAAA;AAAA,IACpE;AACA,IAAA,OAAO,eAAA;AAAA,EACR;AAAA,EAEA,mBAAA,GAAyC;AACxC,IAAA,OAAO,IAAA,CAAK,gBAAA;AAAA,EACb;AACD","file":"chunk-UMXW3TCY.js","sourcesContent":["import { analyzeBlueprint } from '../analysis'\nimport { CancelledWorkflowError } from '../errors'\nimport type { NodeResult, WorkflowBlueprint } from '../types'\nimport type { WorkflowState } from './state'\nimport type { IRuntime } from './types'\n\nexport class GraphTraverser<TContext extends Record<string, any>, TDependencies extends Record<string, any>> {\n\tprivate frontier = new Set<string>()\n\tprivate allPredecessors: Map<string, Set<string>>\n\tprivate dynamicBlueprint: WorkflowBlueprint\n\n\tconstructor(\n\t\tblueprint: WorkflowBlueprint,\n\t\tprivate runtime: IRuntime<TContext, TDependencies>,\n\t\tprivate state: WorkflowState<TContext>,\n\t\tprivate functionRegistry: Map<string, any> | undefined,\n\t\tprivate executionId: string,\n\t\tprivate signal?: AbortSignal,\n\t\tprivate concurrency?: number,\n\t) {\n\t\tthis.dynamicBlueprint = structuredClone(blueprint) as WorkflowBlueprint\n\t\tthis.allPredecessors = new Map<string, Set<string>>()\n\t\tfor (const node of this.dynamicBlueprint.nodes) {\n\t\t\tthis.allPredecessors.set(node.id, new Set())\n\t\t}\n\t\tfor (const edge of this.dynamicBlueprint.edges) {\n\t\t\tthis.allPredecessors.get(edge.target)?.add(edge.source)\n\t\t}\n\t\tconst analysis = analyzeBlueprint(blueprint)\n\t\tthis.frontier = new Set(analysis.startNodeIds.filter((id) => !this.isFallbackNode(id)))\n\t\tif (this.frontier.size === 0 && analysis.cycles.length > 0 && this.runtime.options.strict !== true) {\n\t\t\tconst uniqueStartNodes = new Set<string>()\n\t\t\tfor (const cycle of analysis.cycles) {\n\t\t\t\tif (cycle.length > 0) uniqueStartNodes.add(cycle[0])\n\t\t\t}\n\t\t\tthis.frontier = new Set(uniqueStartNodes)\n\t\t}\n\t}\n\n\tprivate isFallbackNode(nodeId: string): boolean {\n\t\treturn this.dynamicBlueprint.nodes.some((n) => n.config?.fallback === nodeId)\n\t}\n\n\tasync traverse(): Promise<void> {\n\t\ttry {\n\t\t\tthis.signal?.throwIfAborted()\n\t\t} catch (error) {\n\t\t\tif (error instanceof DOMException && error.name === 'AbortError')\n\t\t\t\tthrow new CancelledWorkflowError('Workflow cancelled')\n\t\t\tthrow error\n\t\t}\n\t\tlet iterations = 0\n\t\tconst maxIterations = 10000\n\t\twhile (this.frontier.size > 0) {\n\t\t\tif (++iterations > maxIterations) throw new Error('Traversal exceeded maximum iterations, possible infinite loop')\n\n\t\t\ttry {\n\t\t\t\tthis.signal?.throwIfAborted()\n\t\t\t\tconst currentJobs = Array.from(this.frontier)\n\t\t\t\tthis.frontier.clear()\n\t\t\t\tconst settledResults = await this.executeWithConcurrency(currentJobs)\n\t\t\t\tconst completedThisTurn = new Set<string>()\n\t\t\t\tfor (const promiseResult of settledResults) {\n\t\t\t\t\tif (promiseResult.status === 'rejected') {\n\t\t\t\t\t\tconst { nodeId, error } = promiseResult.reason\n\t\t\t\t\t\tif (error instanceof CancelledWorkflowError) throw error\n\t\t\t\t\t\tthis.state.addError(nodeId, error as Error)\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tconst { nodeId, result } = promiseResult.value\n\t\t\t\t\tthis.state.addCompletedNode(nodeId, result.output)\n\t\t\t\t\tcompletedThisTurn.add(nodeId)\n\t\t\t\t\tif (result._fallbackExecuted) this.state.markFallbackExecuted()\n\t\t\t\t\tawait this.handleDynamicNodes(nodeId, result)\n\t\t\t\t\tif (!result._fallbackExecuted) {\n\t\t\t\t\t\tconst matched = await this.runtime.determineNextNodes(\n\t\t\t\t\t\t\tthis.dynamicBlueprint,\n\t\t\t\t\t\t\tnodeId,\n\t\t\t\t\t\t\tresult,\n\t\t\t\t\t\t\tthis.state.getContext(),\n\t\t\t\t\t\t)\n\n\t\t\t\t\t\t// If one of the next nodes is a loop controller, prioritize it to avoid ambiguity from manual cycle edges.\n\t\t\t\t\t\tconst loopControllerMatch = matched.find((m) => m.node.uses === 'loop-controller')\n\t\t\t\t\t\tconst finalMatched = loopControllerMatch ? [loopControllerMatch] : matched\n\n\t\t\t\t\t\tfor (const { node, edge } of finalMatched) {\n\t\t\t\t\t\t\tconst joinStrategy = node.config?.joinStrategy || 'all'\n\t\t\t\t\t\t\tif (joinStrategy !== 'any' && this.state.getCompletedNodes().has(node.id)) continue\n\t\t\t\t\t\t\tawait this.runtime.applyEdgeTransform(edge, result, node, this.state.getContext(), this.allPredecessors)\n\t\t\t\t\t\t\tconst requiredPredecessors = this.allPredecessors.get(node.id)\n\t\t\t\t\t\t\tif (!requiredPredecessors) continue\n\t\t\t\t\t\t\tconst isReady =\n\t\t\t\t\t\t\t\tjoinStrategy === 'any'\n\t\t\t\t\t\t\t\t\t? [...requiredPredecessors].some((p) => completedThisTurn.has(p))\n\t\t\t\t\t\t\t\t\t: [...requiredPredecessors].every((p) => this.state.getCompletedNodes().has(p))\n\t\t\t\t\t\t\tif (isReady) this.frontier.add(node.id)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (matched.length === 0) {\n\t\t\t\t\t\t\tfor (const [potentialNextId, predecessors] of this.allPredecessors) {\n\t\t\t\t\t\t\t\tif (predecessors.has(nodeId) && !this.state.getCompletedNodes().has(potentialNextId)) {\n\t\t\t\t\t\t\t\t\tconst joinStrategy =\n\t\t\t\t\t\t\t\t\t\tthis.dynamicBlueprint.nodes.find((n) => n.id === potentialNextId)?.config?.joinStrategy || 'all'\n\t\t\t\t\t\t\t\t\tconst isReady =\n\t\t\t\t\t\t\t\t\t\tjoinStrategy === 'any'\n\t\t\t\t\t\t\t\t\t\t\t? [...predecessors].some((p) => completedThisTurn.has(p))\n\t\t\t\t\t\t\t\t\t\t\t: [...predecessors].every((p) => this.state.getCompletedNodes().has(p))\n\t\t\t\t\t\t\t\t\tif (isReady) this.frontier.add(potentialNextId)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\tif (error instanceof DOMException && error.name === 'AbortError') {\n\t\t\t\t\tthrow new CancelledWorkflowError('Workflow cancelled')\n\t\t\t\t}\n\t\t\t\tthrow error\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate async executeWithConcurrency(\n\t\tnodeIds: string[],\n\t): Promise<\n\t\tArray<\n\t\t\t| { status: 'fulfilled'; value: { nodeId: string; result: NodeResult<any, any> } }\n\t\t\t| { status: 'rejected'; reason: { nodeId: string; error: unknown } }\n\t\t>\n\t> {\n\t\tconst maxConcurrency = this.concurrency || nodeIds.length\n\t\tconst results: Array<\n\t\t\t| { status: 'fulfilled'; value: { nodeId: string; result: NodeResult<any, any> } }\n\t\t\t| { status: 'rejected'; reason: { nodeId: string; error: unknown } }\n\t\t> = []\n\n\t\tfor (let i = 0; i < nodeIds.length; i += maxConcurrency) {\n\t\t\tconst batch = nodeIds.slice(i, i + maxConcurrency)\n\t\t\tconst batchPromises = batch.map(async (nodeId) => {\n\t\t\t\ttry {\n\t\t\t\t\tconst result = await this.runtime.executeNode(\n\t\t\t\t\t\tthis.dynamicBlueprint,\n\t\t\t\t\t\tnodeId,\n\t\t\t\t\t\tthis.state,\n\t\t\t\t\t\tthis.allPredecessors,\n\t\t\t\t\t\tthis.functionRegistry,\n\t\t\t\t\t\tthis.executionId,\n\t\t\t\t\t\tthis.signal,\n\t\t\t\t\t)\n\t\t\t\t\tresults.push({\n\t\t\t\t\t\tstatus: 'fulfilled' as const,\n\t\t\t\t\t\tvalue: { nodeId, result },\n\t\t\t\t\t})\n\t\t\t\t} catch (error) {\n\t\t\t\t\tresults.push({\n\t\t\t\t\t\tstatus: 'rejected' as const,\n\t\t\t\t\t\treason: { nodeId, error },\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tawait Promise.all(batchPromises)\n\t\t}\n\n\t\treturn results\n\t}\n\n\tprivate async handleDynamicNodes(nodeId: string, result: NodeResult<any, any>) {\n\t\tif (result.dynamicNodes && result.dynamicNodes.length > 0) {\n\t\t\tconst gatherNodeId = result.output?.gatherNodeId\n\t\t\tfor (const dynamicNode of result.dynamicNodes) {\n\t\t\t\tthis.dynamicBlueprint.nodes.push(dynamicNode)\n\t\t\t\tthis.allPredecessors.set(dynamicNode.id, new Set([nodeId]))\n\t\t\t\tif (gatherNodeId) {\n\t\t\t\t\tthis.allPredecessors.get(gatherNodeId)?.add(dynamicNode.id)\n\t\t\t\t}\n\t\t\t\tthis.frontier.add(dynamicNode.id)\n\t\t\t}\n\t\t}\n\t}\n\n\tgetAllNodeIds(): Set<string> {\n\t\treturn new Set(this.dynamicBlueprint.nodes.map((n) => n.id))\n\t}\n\n\tgetFallbackNodeIds(): Set<string> {\n\t\tconst fallbackNodeIds = new Set<string>()\n\t\tfor (const node of this.dynamicBlueprint.nodes) {\n\t\t\tif (node.config?.fallback) fallbackNodeIds.add(node.config.fallback)\n\t\t}\n\t\treturn fallbackNodeIds\n\t}\n\n\tgetDynamicBlueprint(): WorkflowBlueprint {\n\t\treturn this.dynamicBlueprint\n\t}\n}\n"]}

package/dist/context.d.ts

@@ -1,113 +1,31 @@
+import { I as ISyncContext, h as IAsyncContext } from './types-lG3xCzp_.js';
+
 /**
- * A type-safe, opaque key for storing and retrieving values from the Context.
- * Using a `ContextKey` provides compile-time safety for your workflow's state.
- * @template T The type of the value this key refers to.
- */
-type ContextKey<T> = symbol & {
-    __type: T;
-};
-/**
- * Creates a new, unique `ContextKey` for type-safe access to the `Context`.
- * @template T The type of the value this key will hold.
- * @param description An optional description for debugging purposes (e.g., in logs or test snapshots).
- * @returns A unique `ContextKey<T>`.
- */
-declare const contextKey: <T>(description?: string) => ContextKey<T>;
-/**
- * Defines the interface for the shared context object passed through the workflow.
- * This interface is "async-aware", allowing for both synchronous (Map-based)
- * and asynchronous (e.g., Redis-backed) implementations.
- */
-interface Context {
-    /**
-     * Asynchronously retrieves a value from the context.
-     * Callers should ALWAYS `await` the result of this method.
-     */
-    get: (<T>(key: ContextKey<T>) => Promise<T | undefined>) & (<T = any>(key: string) => Promise<T | undefined>);
-    /** Asynchronously stores a value in the context. */
-    set: (<T>(key: ContextKey<T>, value: T) => Promise<this>) & ((key: string, value: any) => Promise<this>);
-    /** Asynchronously checks if a key exists in the context. */
-    has: ((key: ContextKey<any>) => Promise<boolean>) & ((key: string) => Promise<boolean>);
-    /** Asynchronously deletes a key from the context. */
-    delete: ((key: ContextKey<any>) => Promise<boolean>) & ((key: string) => Promise<boolean>);
-    /**
-     * Returns an iterator of all [key, value] pairs in the context.
-     * NOTE: This may not be supported or may be inefficient in some async implementations.
-     */
-    entries: () => IterableIterator<[any, any]>;
-    /**
-     * Returns an iterator of all keys in the context.
-     * NOTE: This may not be supported or may be inefficient in some async implementations.
-     */
-    keys: () => IterableIterator<any>;
-    /**
-     * Returns an iterator of all values in the context.
-     * NOTE: This may not be supported or may be inefficient in some async implementations.
-     */
-    values: () => IterableIterator<any>;
-}
-/**
- * The default, `Map`-based implementation of the `Context` interface.
- * Its methods are async to satisfy the `Context` interface, but they wrap
- * synchronous operations.
+ * A default, high-performance, in-memory implementation of ISyncContext using a Map.
  */
-declare class TypedContext implements Context {
+declare class Context<TContext extends Record<string, any>> implements ISyncContext<TContext> {
+    readonly type: "sync";
     private data;
-    /**
-     * @param initialData An optional iterable (like an array of `[key, value]` pairs)
-     * to initialize the context with.
-     */
-    constructor(initialData?: Iterable<readonly [ContextKey<any> | string, any]> | null);
-    get(key: ContextKey<any> | string): Promise<any>;
-    set(key: ContextKey<any> | string, value: any): Promise<this>;
-    has(key: ContextKey<any> | string): Promise<boolean>;
-    delete(key: ContextKey<any> | string): Promise<boolean>;
-    entries(): IterableIterator<[any, any]>;
-    keys(): IterableIterator<any>;
-    values(): IterableIterator<any>;
+    constructor(initialData?: Partial<TContext>);
+    get<K extends keyof TContext>(key: K): TContext[K] | undefined;
+    set<K extends keyof TContext>(key: K, value: TContext[K]): void;
+    has<K extends keyof TContext>(key: K): boolean;
+    delete<K extends keyof TContext>(key: K): boolean;
+    toJSON(): Record<string, any>;
 }
-/** A function that takes a `Context` and returns a (potentially new) `Context`. */
-type ContextTransform = (ctx: Context) => Context | Promise<Context>;
 /**
- * A "lens" provides a way to "focus" on a single key in the `Context`,
- * creating reusable, type-safe async functions to get, set, or update its value.
- * @template T The type of the value the lens focuses on.
+ * An adapter that provides a consistent, Promise-based view of a synchronous context.
+ * This is created by the runtime and is transparent to the node author.
  */
-interface ContextLens<T> {
-    /** Asynchronously retrieves the value for the key from the context. */
-    get: (ctx: Context) => Promise<T | undefined>;
-    /** Returns an asynchronous `ContextTransform` function that will set the key to the provided value. */
-    set: (value: T) => ContextTransform;
-    /** Returns an asynchronous `ContextTransform` function that updates the key's value based on its current value. */
-    update: (fn: (current: T | undefined) => T) => ContextTransform;
+declare class AsyncContextView<TContext extends Record<string, any>> implements IAsyncContext<TContext> {
+    private syncContext;
+    readonly type: "async";
+    constructor(syncContext: ISyncContext<TContext>);
+    get<K extends keyof TContext>(key: K): Promise<TContext[K] | undefined>;
+    set<K extends keyof TContext>(key: K, value: TContext[K]): Promise<void>;
+    has<K extends keyof TContext>(key: K): Promise<boolean>;
+    delete<K extends keyof TContext>(key: K): Promise<boolean>;
+    toJSON(): Promise<Record<string, any>>;
 }
-/**
- * Creates a `ContextLens` object for a specific `ContextKey`.
- * This is the entry point for functional context manipulation.
- * All operations that read from the context are now async.
- *
- * @example
- * const NAME = contextKey<string>('name')
- * const nameLens = lens(NAME)
- *
- * // Usage in an async function:
- * async function exampleUsage(ctx: Context) {
- *   const currentName = await nameLens.get(ctx);
- *   const setNameTransform = nameLens.set('Alice');
- *   await setNameTransform(ctx);
- * }
- *
- * @param key The `ContextKey` to focus on.
- * @returns A `ContextLens<T>` object with async-aware methods.
- */
-declare function lens<T>(key: ContextKey<T>): ContextLens<T>;
-/**
- * Composes multiple `ContextTransform` functions into a single `ContextTransform` function.
- * The transformations are applied in the order they are provided.
- *
- * @param transforms A sequence of `ContextTransform` functions.
- * @returns A single function that applies all transformations.
- */
-declare function composeContext(...transforms: ContextTransform[]): ContextTransform;
 
-export { type Context, type ContextKey, type ContextLens, type ContextTransform, TypedContext, composeContext, contextKey, lens };
+export { AsyncContextView, Context };

package/dist/context.js

@@ -1,3 +1,3 @@
-export { TypedContext, composeContext, contextKey, lens } from './chunk-R27FIYR5.js';
+export { AsyncContextView, Context } from './chunk-KWQHFT7E.js';
 //# sourceMappingURL=context.js.map
 //# sourceMappingURL=context.js.map

package/dist/errors.d.ts

@@ -1,35 +1,19 @@
-/**
- * Error thrown when a workflow is gracefully aborted via an `AbortSignal`.
- * This error is caught by the execution engine to halt the flow.
- */
-declare class AbortError extends Error {
-    constructor(message?: string);
+/** Error thrown when a node fails during execution. */
+declare class NodeExecutionError extends Error {
+    readonly nodeId: string;
+    readonly blueprintId: string;
+    readonly originalError?: Error | undefined;
+    readonly executionId?: string | undefined;
+    constructor(message: string, nodeId: string, blueprintId: string, originalError?: Error | undefined, executionId?: string | undefined);
 }
-/**
- * A custom error class for failures within a workflow, providing additional
- * context about where and when the error occurred.
- */
-declare class WorkflowError extends Error {
-    readonly nodeName: string;
-    readonly phase: 'prep' | 'exec' | 'post';
-    readonly originalError?: Error;
-    /**
-     * @param message The error message.
-     * @param nodeName The name of the `Node` class where the error occurred.
-     * @param phase The lifecycle phase (`'prep'`, `'exec'`, or `'post'`) where the error was thrown.
-     * @param originalError The underlying error that was caught and wrapped.
-     */
-    constructor(message: string, nodeName: string, phase: 'prep' | 'exec' | 'post', originalError?: Error);
+/** Error thrown when a workflow is gracefully aborted. */
+declare class CancelledWorkflowError extends Error {
+    readonly executionId?: string | undefined;
+    constructor(message?: string, executionId?: string | undefined);
 }
-/**
- * An error thrown by a node to indicate a non-recoverable failure.
- *
- * When an executor catches this error, it should immediately terminate the
- * entire workflow run, bypassing any remaining retries, fallbacks, or
- * subsequent nodes in the graph.
- */
-declare class FatalWorkflowError extends WorkflowError {
-    constructor(message: string, nodeName: string, phase: 'prep' | 'exec' | 'post', originalError?: Error);
+/** Error thrown for a non-recoverable failure that should halt the workflow immediately. */
+declare class FatalNodeExecutionError extends NodeExecutionError {
+    constructor(message: string, nodeId: string, blueprintId: string, originalError?: Error, executionId?: string);
 }
 
-export { AbortError, FatalWorkflowError, WorkflowError };
+export { CancelledWorkflowError, FatalNodeExecutionError, NodeExecutionError };

package/dist/errors.js

@@ -1,3 +1,3 @@
-export { AbortError, FatalWorkflowError, WorkflowError } from './chunk-64DNBF5W.js';
+export { CancelledWorkflowError, FatalNodeExecutionError, NodeExecutionError } from './chunk-5ZXV3R5D.js';
 //# sourceMappingURL=errors.js.map
 //# sourceMappingURL=errors.js.map

package/dist/evaluator.d.ts

@@ -0,0 +1,30 @@
+import { k as IEvaluator } from './types-lG3xCzp_.js';
+
+/**
+ * A safe evaluator that only allows simple property access.
+ * It cannot execute arbitrary code and is secure for untrusted inputs.
+ *
+ * Example expressions:
+ * - "result.output.status"
+ * - "context.user.isAdmin"
+ * - "input.value"
+ */
+declare class PropertyEvaluator implements IEvaluator {
+    evaluate(expression: string, context: Record<string, any>): any;
+}
+/**
+ * @warning This evaluator uses `new Function()` and can execute arbitrary
+ * JavaScript code. It poses a significant security risk if the expressions
+ * are not from a trusted source (e.g., user input).
+ *
+ * It should only be used in controlled environments where all workflow
+ * definitions are static and authored by trusted developers.
+ *
+ * For safer evaluation, use the default `PropertyEvaluator` or install a
+ * sandboxed library like `jsep` to create a custom, secure evaluator.
+ */
+declare class UnsafeEvaluator implements IEvaluator {
+    evaluate(expression: string, context: Record<string, any>): any;
+}
+
+export { PropertyEvaluator, UnsafeEvaluator };

package/dist/evaluator.js

@@ -0,0 +1,3 @@
+export { PropertyEvaluator, UnsafeEvaluator } from './chunk-PH2IYZHV.js';
+//# sourceMappingURL=evaluator.js.map
+//# sourceMappingURL=evaluator.js.map

package/dist/evaluator.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"evaluator.js"}

package/dist/flow.d.ts

@@ -0,0 +1,55 @@
+import { d as NodeFunction, e as NodeClass, N as NodeDefinition, E as EdgeDefinition, W as WorkflowBlueprint } from './types-lG3xCzp_.js';
+
+/**
+ * A fluent API for programmatically constructing a WorkflowBlueprint.
+ */
+declare class Flow<TContext extends Record<string, any> = Record<string, any>, TDependencies extends Record<string, any> = Record<string, any>> {
+    private blueprint;
+    private functionRegistry;
+    private loopControllerIds;
+    private loopDefinitions;
+    constructor(id: string);
+    node<TInput = any, TOutput = any, TAction extends string = string>(id: string, implementation: NodeFunction<TContext, TDependencies, TInput, TOutput, TAction> | NodeClass<TContext, TDependencies, TInput, TOutput, TAction>, options?: Omit<NodeDefinition, 'id' | 'uses'>): this;
+    edge(source: string, target: string, options?: Omit<EdgeDefinition, 'source' | 'target'>): this;
+    /**
+     * Creates a batch processing pattern.
+     * It takes an input array, runs a worker node on each item in parallel, and gathers the results.
+     * @param id The base ID for this batch operation.
+     * @param worker The node implementation to run on each item.
+     * @param options Configuration for the batch operation.
+     * @param options.inputKey The key in the context that holds the input array for the batch.
+     * @param options.outputKey The key in the context where the array of results will be stored.
+     * @returns The Flow instance for chaining.
+     */
+    batch<TInput = any, TOutput = any, TAction extends string = string>(id: string, worker: NodeFunction<TContext, TDependencies, TInput, TOutput, TAction> | NodeClass<TContext, TDependencies, TInput, TOutput, TAction>, options: {
+        /** The key in the context that holds the input array for the batch. */
+        inputKey: string;
+        /** The key in the context where the array of results will be stored. */
+        outputKey: string;
+    }): this;
+    /**
+     * Creates a loop pattern in the workflow graph.
+     * @param id A unique identifier for the loop construct.
+     * @param options Defines the start, end, and continuation condition of the loop.
+     * @param options.startNodeId The ID of the first node inside the loop body.
+     * @param options.endNodeId The ID of the last node inside the loop body.
+     * @param options.condition An expression that, if true, causes the loop to run again.
+     */
+    loop(id: string, options: {
+        /** The ID of the first node inside the loop body. */
+        startNodeId: string;
+        /** The ID of the last node inside the loop body. */
+        endNodeId: string;
+        /** An expression that, if true, causes the loop to run again. */
+        condition: string;
+    }): this;
+    getLoopControllerId(id: string): string;
+    toBlueprint(): WorkflowBlueprint;
+    getFunctionRegistry(): Map<string, NodeClass | NodeFunction>;
+}
+/**
+ * Helper function to create a new Flow builder instance.
+ */
+declare function createFlow<TContext extends Record<string, any> = Record<string, any>, TDependencies extends Record<string, any> = Record<string, any>>(id: string): Flow<TContext, TDependencies>;
+
+export { Flow, createFlow };

package/dist/flow.js

@@ -0,0 +1,4 @@
+export { Flow, createFlow } from './chunk-5ZWYSKMH.js';
+import './chunk-5QMPFUKA.js';
+//# sourceMappingURL=flow.js.map
+//# sourceMappingURL=flow.js.map

package/dist/flow.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"flow.js"}

package/dist/index.d.ts

@@ -1,16 +1,15 @@
-export { A as AbstractNode, B as BlueprintBuildResult, k as BuildResult, D as DEFAULT_ACTION, a as FILTER_FAILED, F as Flow, o as GraphBuilderOptions, G as GraphEdge, l as GraphNode, I as IExecutor, p as InternalRunOptions, e as Middleware, M as MiddlewareNext, N as Node, b as NodeArgs, g as NodeConstructorOptions, d as NodeOptions, n as NodeRegistry, c as NodeRunContext, f as NodeTypeMap, O as OriginalPredecessorIdMap, P as Params, j as PredecessorIdMap, R as RunOptions, S as SubWorkflowResolver, T as TypedGraphNode, i as TypedNodeRegistry, h as TypedWorkflowGraph, W as WorkflowBlueprint, m as WorkflowGraph } from './types-U76Ukj96.js';
-export { ExecNode, PostNode, PreNode } from './workflow/node-patterns.js';
-export { Context, ContextKey, ContextLens, ContextTransform, TypedContext, composeContext, contextKey, lens } from './context.js';
-export { AbortError, FatalWorkflowError, WorkflowError } from './errors.js';
-export { ConsoleLogger, Logger, NullLogger } from './logger.js';
-export { GraphBuilder, createNodeRegistry } from './builder/graph/graph.js';
-export { ConditionalJoinNode, InputMappingNode, OutputMappingNode, ParallelBranchContainer, SubWorkflowContainerNode } from './builder/graph/internal-nodes.js';
-export { BlueprintExecutor } from './builder/graph/runner.js';
-export { BatchFlow, ParallelBatchFlow, ParallelFlow, SequenceFlow, filterCollection, mapCollection, reduceCollection } from './builder/patterns.js';
-export { InMemoryExecutor } from './executors/in-memory.js';
-export { ContextFunction, NodeFunction, compose, contextNode, mapNode, pipeline, transformNode } from './functions.js';
-export { GraphAnalysis, ValidationError, Validator, analyzeGraph, checkForCycles, createNodeRule, isNodeType } from './utils/analysis.js';
-export { generateMermaidFromBlueprint, generateMermaidGraph } from './utils/mermaid.js';
-export { applyMiddleware } from './utils/middleware.js';
-export { sanitizeGraph } from './utils/sanitize.js';
-export { sleep } from './utils/sleep.js';
+export { BlueprintAnalysis, Cycles, analyzeBlueprint, checkForCycles, generateMermaid } from './analysis.js';
+export { AsyncContextView, Context } from './context.js';
+export { CancelledWorkflowError, FatalNodeExecutionError, NodeExecutionError } from './errors.js';
+export { PropertyEvaluator, UnsafeEvaluator } from './evaluator.js';
+export { Flow, createFlow } from './flow.js';
+export { LinterIssue, LinterIssueCode, LinterResult, lintBlueprint } from './linter.js';
+export { ConsoleLogger, NullLogger } from './logger.js';
+export { B as BaseNode, C as ContextImplementation, E as EdgeDefinition, h as IAsyncContext, k as IEvaluator, m as IEventBus, l as ILogger, n as ISerializer, I as ISyncContext, M as Middleware, e as NodeClass, a as NodeConfig, c as NodeContext, N as NodeDefinition, d as NodeFunction, f as NodeImplementation, g as NodeRegistry, b as NodeResult, R as RuntimeDependencies, j as RuntimeOptions, W as WorkflowBlueprint, o as WorkflowError, p as WorkflowResult, i as isNodeClass } from './types-lG3xCzp_.js';
+export { AdapterOptions, BaseDistributedAdapter, ICoordinationStore, JobPayload } from './runtime/adapter.js';
+export { BuiltInNodeExecutor, ClassNodeExecutor, ExecutionStrategy, FunctionNodeExecutor } from './runtime/executors.js';
+export { FlowRuntime } from './runtime/runtime.js';
+export { WorkflowState } from './runtime/state.js';
+export { GraphTraverser } from './runtime/traverser.js';
+export { sanitizeBlueprint } from './sanitizer.js';
+import './runtime/types.js';