flowcraft 2.8.0 → 2.8.1

package/dist/chunk-ZKINHLMS.js

@@ -1,230 +0,0 @@
-import { analyzeBlueprint } from './chunk-ZLW4QOTS.js';
-import { FlowcraftError } from './chunk-BCRWXTWX.js';
-
-// src/runtime/traverser.ts
-var GraphTraverser = class _GraphTraverser {
-  frontier = /* @__PURE__ */ new Set();
-  allPredecessors;
-  allSuccessors;
-  dynamicBlueprint;
-  completedNodes = /* @__PURE__ */ new Set();
-  nodesInLoops;
-  constructor(blueprint, isStrictMode = false) {
-    this.dynamicBlueprint = structuredClone(blueprint);
-    this.allPredecessors = /* @__PURE__ */ new Map();
-    this.allSuccessors = /* @__PURE__ */ new Map();
-    this.nodesInLoops = /* @__PURE__ */ new Map();
-    for (const node of this.dynamicBlueprint.nodes) {
-      this.allPredecessors.set(node.id, /* @__PURE__ */ new Set());
-      this.allSuccessors.set(node.id, /* @__PURE__ */ new Set());
-    }
-    for (const edge of this.dynamicBlueprint.edges) {
-      this.getPredecessors(edge.target).add(edge.source);
-    }
-    for (const edge of this.dynamicBlueprint.edges) {
-      this.getSuccessors(edge.source).add(edge.target);
-    }
-    const analysis = analyzeBlueprint(blueprint);
-    this.filterNodesInLoops(blueprint);
-    this.frontier = new Set(analysis.startNodeIds.filter((id) => !this.isFallbackNode(id)));
-    if (this.frontier.size === 0 && analysis.cycles.length > 0 && !isStrictMode) {
-      const uniqueStartNodes = /* @__PURE__ */ new Set();
-      const cycleEntryPoints = new Set(blueprint.metadata?.cycleEntryPoints || []);
-      for (const cycle of analysis.cycles) {
-        if (cycle.length > 0) {
-          const entryPoint = cycle.find((node) => cycleEntryPoints.has(node));
-          uniqueStartNodes.add(entryPoint || cycle[0]);
-        }
-      }
-      this.frontier = new Set(uniqueStartNodes);
-    }
-  }
-  /**
-   * Clears all nodes from the execution frontier.
-   */
-  clearFrontier() {
-    this.frontier.clear();
-  }
-  /**
-   * Creates and initializes a GraphTraverser from a saved workflow state.
-   * This is the correct way to prepare a traverser for a `resume` operation.
-   * @param blueprint The workflow blueprint.
-   * @param state The workflow state being resumed.
-   * @returns A configured GraphTraverser instance.
-   */
-  static fromState(blueprint, state) {
-    const traverser = new _GraphTraverser(blueprint);
-    traverser.clearFrontier();
-    const completedNodes = state.getCompletedNodes();
-    traverser.completedNodes = new Set(completedNodes);
-    for (const node of traverser.dynamicBlueprint.nodes) {
-      if (traverser.completedNodes.has(node.id)) continue;
-      const requiredPredecessors = traverser.allPredecessors.get(node.id);
-      const joinStrategy = traverser.getJoinStrategy(node.id);
-      if (!requiredPredecessors || requiredPredecessors.size === 0) {
-        traverser.frontier.add(node.id);
-        continue;
-      }
-      const completedPredecessors = [...requiredPredecessors].filter((p) => traverser.completedNodes.has(p));
-      const isReady = joinStrategy === "any" ? completedPredecessors.length > 0 : completedPredecessors.length === requiredPredecessors.size;
-      if (isReady) traverser.frontier.add(node.id);
-    }
-    return traverser;
-  }
-  isFallbackNode(nodeId) {
-    return this.dynamicBlueprint.nodes.some((n) => n.config?.fallback === nodeId);
-  }
-  getJoinStrategy(nodeId) {
-    const node = this.dynamicBlueprint.nodes.find((n) => n.id === nodeId);
-    const baseJoinStrategy = node?.config?.joinStrategy || "all";
-    return baseJoinStrategy;
-  }
-  filterNodesInLoops(blueprint) {
-    blueprint.nodes.forEach((node) => {
-      if (node.uses !== "loop-controller") return;
-      const nextInLoopId = blueprint.edges.find((e) => e.source === node.id && e.action === "continue")?.target;
-      if (!nextInLoopId) {
-        throw new FlowcraftError(
-          `Loop '${node.id}' has no continue edge to start node. Ensure edges are wired inside the loop and incoming/breaking edges point to the loop controller.`,
-          { nodeId: node.id, blueprintId: blueprint.id }
-        );
-      }
-      const set = /* @__PURE__ */ new Set();
-      set.add(nextInLoopId);
-      this.nodesInLoops.set(node.id, this.getAllLoopSuccessors(nextInLoopId, blueprint, set));
-    });
-  }
-  getAllLoopSuccessors(nodeId, blueprint, set) {
-    this.getSuccessors(nodeId).forEach((successor) => {
-      if (set.has(successor)) return;
-      const node = this.getNode(successor, blueprint);
-      if (!node || node.uses === "loop-controller") return;
-      set.add(successor);
-      this.getAllLoopSuccessors(successor, blueprint, set);
-    });
-    return set;
-  }
-  getReadyNodes() {
-    const readyNodes = [];
-    for (const nodeId of this.frontier) {
-      const nodeDef = this.dynamicBlueprint.nodes.find((n) => n.id === nodeId);
-      if (nodeDef) {
-        readyNodes.push({ nodeId, nodeDef });
-      }
-    }
-    this.frontier.clear();
-    return readyNodes;
-  }
-  hasMoreWork() {
-    return this.frontier.size > 0;
-  }
-  markNodeCompleted(nodeId, result, nextNodes) {
-    this.completedNodes.add(nodeId);
-    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.getPredecessors(gatherNodeId).add(dynamicNode.id);
-        }
-        this.frontier.add(dynamicNode.id);
-      }
-    }
-    for (const node of nextNodes) {
-      const joinStrategy = this.getJoinStrategy(node.id);
-      if (joinStrategy !== "any" && this.completedNodes.has(node.id)) continue;
-      const requiredPredecessors = this.getPredecessors(node.id);
-      const isReady = joinStrategy === "any" ? requiredPredecessors.has(nodeId) : [...requiredPredecessors].every((p) => this.completedNodes.has(p));
-      if (isReady) {
-        this.frontier.add(node.id);
-        if (node.uses === "loop-controller") {
-          this.getNodesInLoop(node.id).forEach((id) => {
-            this.resetNodeCompletion(id);
-          });
-        }
-      }
-    }
-    if (nextNodes.length === 0) {
-      for (const [potentialNextId, predecessors] of this.allPredecessors) {
-        if (predecessors.has(nodeId) && !this.completedNodes.has(potentialNextId)) {
-          const joinStrategy = this.getJoinStrategy(potentialNextId);
-          const isReady = joinStrategy === "any" ? predecessors.has(nodeId) : [...predecessors].every((p) => this.completedNodes.has(p));
-          if (isReady) {
-            this.frontier.add(potentialNextId);
-            const node = this.getNode(potentialNextId, this.dynamicBlueprint);
-            if (!node) continue;
-            if (node.uses === "loop-controller") {
-              this.getNodesInLoop(node.id).forEach((id) => {
-                this.resetNodeCompletion(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;
-  }
-  getCompletedNodes() {
-    return new Set(this.completedNodes);
-  }
-  getDynamicBlueprint() {
-    return this.dynamicBlueprint;
-  }
-  getAllPredecessors() {
-    return this.allPredecessors;
-  }
-  getAllSuccessors() {
-    return this.allSuccessors;
-  }
-  getPredecessors(nodeId) {
-    const predecessors = this.allPredecessors.get(nodeId);
-    if (!predecessors) return /* @__PURE__ */ new Set();
-    return predecessors;
-  }
-  getSuccessors(nodeId) {
-    const successors = this.allSuccessors.get(nodeId);
-    if (!successors) return /* @__PURE__ */ new Set();
-    return successors;
-  }
-  getNodesInLoop(id) {
-    const loopNodes = this.nodesInLoops.get(id);
-    if (!loopNodes) return /* @__PURE__ */ new Set();
-    return loopNodes;
-  }
-  resetNodeCompletion(nodeId) {
-    this.completedNodes.delete(nodeId);
-  }
-  getNode(nodeId, blueprint) {
-    return blueprint.nodes.find((n) => n.id === nodeId);
-  }
-  addDynamicNode(_nodeId, dynamicNode, predecessorId, gatherNodeId) {
-    this.dynamicBlueprint.nodes.push(dynamicNode);
-    this.allPredecessors.set(dynamicNode.id, /* @__PURE__ */ new Set([predecessorId]));
-    if (gatherNodeId) {
-      this.allPredecessors.get(gatherNodeId)?.add(dynamicNode.id);
-    }
-    this.frontier.add(dynamicNode.id);
-  }
-  /**
-   * Manually adds a node ID back to the execution frontier.
-   * Used by orchestrators that need fine-grained control over steps.
-   * @param nodeId The ID of the node to add to the frontier.
-   */
-  addToFrontier(nodeId) {
-    this.frontier.add(nodeId);
-  }
-};
-
-export { GraphTraverser };
-//# sourceMappingURL=chunk-ZKINHLMS.js.map
-//# sourceMappingURL=chunk-ZKINHLMS.js.map

package/dist/chunk-ZKINHLMS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/runtime/traverser.ts"],"names":[],"mappings":";;;;AAUO,IAAM,cAAA,GAAN,MAAM,eAAA,CAAe;AAAA,EACnB,QAAA,uBAAe,GAAA,EAAY;AAAA,EAC3B,eAAA;AAAA,EACA,aAAA;AAAA,EACA,gBAAA;AAAA,EACA,cAAA,uBAAqB,GAAA,EAAY;AAAA,EACjC,YAAA;AAAA,EAER,WAAA,CAAY,SAAA,EAA8B,YAAA,GAAwB,KAAA,EAAO;AACxE,IAAA,IAAA,CAAK,gBAAA,GAAmB,gBAAgB,SAAS,CAAA;AACjD,IAAA,IAAA,CAAK,eAAA,uBAAsB,GAAA,EAAyB;AACpD,IAAA,IAAA,CAAK,aAAA,uBAAoB,GAAA,EAAyB;AAClD,IAAA,IAAA,CAAK,YAAA,uBAAmB,GAAA,EAAyB;AACjD,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;AAC3C,MAAA,IAAA,CAAK,cAAc,GAAA,CAAI,IAAA,CAAK,EAAA,kBAAI,IAAI,KAAK,CAAA;AAAA,IAC1C;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO;AAC/C,MAAA,IAAA,CAAK,gBAAgB,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,IAClD;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO;AAC/C,MAAA,IAAA,CAAK,cAAc,IAAA,CAAK,MAAM,CAAA,CAAE,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,IAChD;AACA,IAAA,MAAM,QAAA,GAAW,iBAAiB,SAAS,CAAA;AAC3C,IAAA,IAAA,CAAK,mBAAmB,SAAS,CAAA;AACjC,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,SAAS,IAAA,KAAS,CAAA,IAAK,SAAS,MAAA,CAAO,MAAA,GAAS,CAAA,IAAK,CAAC,YAAA,EAAc;AAC5E,MAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAY;AACzC,MAAA,MAAM,mBAAmB,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU,gBAAA,IAAoB,EAAE,CAAA;AAC3E,MAAA,KAAA,MAAW,KAAA,IAAS,SAAS,MAAA,EAAQ;AACpC,QAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACrB,UAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,CAAC,SAAS,gBAAA,CAAiB,GAAA,CAAI,IAAI,CAAC,CAAA;AAClE,UAAA,gBAAA,CAAiB,GAAA,CAAI,UAAA,IAAc,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,QAC5C;AAAA,MACD;AACA,MAAA,IAAA,CAAK,QAAA,GAAW,IAAI,GAAA,CAAI,gBAAgB,CAAA;AAAA,IACzC;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKO,aAAA,GAAsB;AAC5B,IAAA,IAAA,CAAK,SAAS,KAAA,EAAM;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAc,SAAA,CAAU,SAAA,EAA8B,KAAA,EAA2C;AAChG,IAAA,MAAM,SAAA,GAAY,IAAI,eAAA,CAAe,SAAS,CAAA;AAG9C,IAAA,SAAA,CAAU,aAAA,EAAc;AAGxB,IAAA,MAAM,cAAA,GAAiB,MAAM,iBAAA,EAAkB;AAC/C,IAAA,SAAA,CAAU,cAAA,GAAiB,IAAI,GAAA,CAAI,cAAc,CAAA;AAEjD,IAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,gBAAA,CAAiB,KAAA,EAAO;AACpD,MAAA,IAAI,SAAA,CAAU,cAAA,CAAe,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAE3C,MAAA,MAAM,oBAAA,GAAuB,SAAA,CAAU,eAAA,CAAgB,GAAA,CAAI,KAAK,EAAE,CAAA;AAClE,MAAA,MAAM,YAAA,GAAe,SAAA,CAAU,eAAA,CAAgB,IAAA,CAAK,EAAE,CAAA;AAGtD,MAAA,IAAI,CAAC,oBAAA,IAAwB,oBAAA,CAAqB,IAAA,KAAS,CAAA,EAAG;AAC7D,QAAA,SAAA,CAAU,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC9B,QAAA;AAAA,MACD;AAEA,MAAA,MAAM,qBAAA,GAAwB,CAAC,GAAG,oBAAoB,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,SAAA,CAAU,cAAA,CAAe,GAAA,CAAI,CAAC,CAAC,CAAA;AACrG,MAAA,MAAM,OAAA,GACL,iBAAiB,KAAA,GACd,qBAAA,CAAsB,SAAS,CAAA,GAC/B,qBAAA,CAAsB,WAAW,oBAAA,CAAqB,IAAA;AAE1D,MAAA,IAAI,OAAA,EAAS,SAAA,CAAU,QAAA,CAAS,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,IAC5C;AAEA,IAAA,OAAO,SAAA;AAAA,EACR;AAAA,EAEQ,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,EAEQ,gBAAgB,MAAA,EAA+B;AACtD,IAAA,MAAM,IAAA,GAAO,KAAK,gBAAA,CAAiB,KAAA,CAAM,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA;AACpE,IAAA,MAAM,gBAAA,GAAmB,IAAA,EAAM,MAAA,EAAQ,YAAA,IAAgB,KAAA;AACvD,IAAA,OAAO,gBAAA;AAAA,EACR;AAAA,EAEQ,mBAAmB,SAAA,EAAoC;AAC9D,IAAA,SAAA,CAAU,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,KAAS;AACjC,MAAA,IAAI,IAAA,CAAK,SAAS,iBAAA,EAAmB;AAErC,MAAA,MAAM,YAAA,GAAe,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,IAAA,CAAK,EAAA,IAAM,CAAA,CAAE,MAAA,KAAW,UAAU,CAAA,EAAG,MAAA;AACnG,MAAA,IAAI,CAAC,YAAA,EAAc;AAClB,QAAA,MAAM,IAAI,cAAA;AAAA,UACT,CAAA,MAAA,EAAS,KAAK,EAAE,CAAA,sIAAA,CAAA;AAAA,UAEhB,EAAE,MAAA,EAAQ,IAAA,CAAK,EAAA,EAAI,WAAA,EAAa,UAAU,EAAA;AAAG,SAC9C;AAAA,MACD;AAEA,MAAA,MAAM,GAAA,uBAAuB,GAAA,EAAI;AACjC,MAAA,GAAA,CAAI,IAAI,YAAY,CAAA;AACpB,MAAA,IAAA,CAAK,YAAA,CAAa,IAAI,IAAA,CAAK,EAAA,EAAI,KAAK,oBAAA,CAAqB,YAAA,EAAc,SAAA,EAAW,GAAG,CAAC,CAAA;AAAA,IACvF,CAAC,CAAA;AAAA,EACF;AAAA,EAEQ,oBAAA,CAAqB,MAAA,EAAgB,SAAA,EAA8B,GAAA,EAA+B;AACzG,IAAA,IAAA,CAAK,aAAA,CAAc,MAAM,CAAA,CAAE,OAAA,CAAQ,CAAC,SAAA,KAAc;AACjD,MAAA,IAAI,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,SAAA,EAAW,SAAS,CAAA;AAC9C,MAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,iBAAA,EAAmB;AAC9C,MAAA,GAAA,CAAI,IAAI,SAAS,CAAA;AACjB,MAAA,IAAA,CAAK,oBAAA,CAAqB,SAAA,EAAW,SAAA,EAAW,GAAG,CAAA;AAAA,IACpD,CAAC,CAAA;AACD,IAAA,OAAO,GAAA;AAAA,EACR;AAAA,EAEA,aAAA,GAA6B;AAC5B,IAAA,MAAM,aAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,MAAA,IAAU,KAAK,QAAA,EAAU;AACnC,MAAA,MAAM,OAAA,GAAU,KAAK,gBAAA,CAAiB,KAAA,CAAM,KAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,MAAM,CAAA;AACvE,MAAA,IAAI,OAAA,EAAS;AACZ,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,MAAA,EAAQ,OAAA,EAAS,CAAA;AAAA,MACpC;AAAA,IACD;AACA,IAAA,IAAA,CAAK,SAAS,KAAA,EAAM;AACpB,IAAA,OAAO,UAAA;AAAA,EACR;AAAA,EAEA,WAAA,GAAuB;AACtB,IAAA,OAAO,IAAA,CAAK,SAAS,IAAA,GAAO,CAAA;AAAA,EAC7B;AAAA,EAEA,iBAAA,CAAkB,MAAA,EAAgB,MAAA,EAA8B,SAAA,EAAmC;AAClG,IAAA,IAAA,CAAK,cAAA,CAAe,IAAI,MAAM,CAAA;AAE9B,IAAA,IAAI,MAAA,EAAQ,YAAA,IAAgB,MAAA,CAAO,YAAA,CAAa,SAAS,CAAA,EAAG;AAC3D,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,eAAA,CAAgB,YAAY,CAAA,CAAE,GAAA,CAAI,YAAY,EAAE,CAAA;AAAA,QACtD;AACA,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,EAAE,CAAA;AAAA,MACjC;AAAA,IACD;AAEA,IAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC7B,MAAA,MAAM,YAAA,GAAe,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,EAAE,CAAA;AACjD,MAAA,IAAI,iBAAiB,KAAA,IAAS,IAAA,CAAK,eAAe,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAEhE,MAAA,MAAM,oBAAA,GAAuB,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,EAAE,CAAA;AAEzD,MAAA,MAAM,UACL,YAAA,KAAiB,KAAA,GACd,qBAAqB,GAAA,CAAI,MAAM,IAC/B,CAAC,GAAG,oBAAoB,CAAA,CAAE,MAAM,CAAC,CAAA,KAAM,KAAK,cAAA,CAAe,GAAA,CAAI,CAAC,CAAC,CAAA;AAErE,MAAA,IAAI,OAAA,EAAS;AACZ,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAEzB,QAAA,IAAI,IAAA,CAAK,SAAS,iBAAA,EAAmB;AACpC,UAAA,IAAA,CAAK,eAAe,IAAA,CAAK,EAAE,CAAA,CAAE,OAAA,CAAQ,CAAC,EAAA,KAAO;AAC5C,YAAA,IAAA,CAAK,oBAAoB,EAAE,CAAA;AAAA,UAC5B,CAAC,CAAA;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAEA,IAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC3B,MAAA,KAAA,MAAW,CAAC,eAAA,EAAiB,YAAY,CAAA,IAAK,KAAK,eAAA,EAAiB;AACnE,QAAA,IAAI,YAAA,CAAa,IAAI,MAAM,CAAA,IAAK,CAAC,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,eAAe,CAAA,EAAG;AAC1E,UAAA,MAAM,YAAA,GAAe,IAAA,CAAK,eAAA,CAAgB,eAAe,CAAA;AACzD,UAAA,MAAM,UACL,YAAA,KAAiB,KAAA,GACd,aAAa,GAAA,CAAI,MAAM,IACvB,CAAC,GAAG,YAAY,CAAA,CAAE,MAAM,CAAC,CAAA,KAAM,KAAK,cAAA,CAAe,GAAA,CAAI,CAAC,CAAC,CAAA;AAC7D,UAAA,IAAI,OAAA,EAAS;AACZ,YAAA,IAAA,CAAK,QAAA,CAAS,IAAI,eAAe,CAAA;AACjC,YAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,eAAA,EAAiB,KAAK,gBAAgB,CAAA;AAChE,YAAA,IAAI,CAAC,IAAA,EAAM;AAEX,YAAA,IAAI,IAAA,CAAK,SAAS,iBAAA,EAAmB;AACpC,cAAA,IAAA,CAAK,eAAe,IAAA,CAAK,EAAE,CAAA,CAAE,OAAA,CAAQ,CAAC,EAAA,KAAO;AAC5C,gBAAA,IAAA,CAAK,oBAAoB,EAAE,CAAA;AAAA,cAC5B,CAAC,CAAA;AAAA,YACF;AAAA,UACD;AAAA,QACD;AAAA,MACD;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,iBAAA,GAAiC;AAChC,IAAA,OAAO,IAAI,GAAA,CAAI,IAAA,CAAK,cAAc,CAAA;AAAA,EACnC;AAAA,EAEA,mBAAA,GAAyC;AACxC,IAAA,OAAO,IAAA,CAAK,gBAAA;AAAA,EACb;AAAA,EAEA,kBAAA,GAA+C;AAC9C,IAAA,OAAO,IAAA,CAAK,eAAA;AAAA,EACb;AAAA,EAEA,gBAAA,GAA6C;AAC5C,IAAA,OAAO,IAAA,CAAK,aAAA;AAAA,EACb;AAAA,EAEA,gBAAgB,MAAA,EAA6B;AAC5C,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,MAAM,CAAA;AACpD,IAAA,IAAI,CAAC,YAAA,EAAc,uBAAO,IAAI,GAAA,EAAI;AAClC,IAAA,OAAO,YAAA;AAAA,EACR;AAAA,EAEA,cAAc,MAAA,EAA6B;AAC1C,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA;AAChD,IAAA,IAAI,CAAC,UAAA,EAAY,uBAAO,IAAI,GAAA,EAAI;AAChC,IAAA,OAAO,UAAA;AAAA,EACR;AAAA,EAEA,eAAe,EAAA,EAAyB;AACvC,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,YAAA,CAAa,GAAA,CAAI,EAAE,CAAA;AAC1C,IAAA,IAAI,CAAC,SAAA,EAAW,uBAAO,IAAI,GAAA,EAAI;AAC/B,IAAA,OAAO,SAAA;AAAA,EACR;AAAA,EAEA,oBAAoB,MAAA,EAAsB;AACzC,IAAA,IAAA,CAAK,cAAA,CAAe,OAAO,MAAM,CAAA;AAAA,EAClC;AAAA,EAEA,OAAA,CAAQ,QAAgB,SAAA,EAA0D;AACjF,IAAA,OAAO,UAAU,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,MAAM,CAAA;AAAA,EACnD;AAAA,EAEA,cAAA,CAAe,OAAA,EAAiB,WAAA,EAA6B,aAAA,EAAuB,YAAA,EAA6B;AAChH,IAAA,IAAA,CAAK,gBAAA,CAAiB,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AAC5C,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAI,WAAA,CAAY,EAAA,sBAAQ,GAAA,CAAI,CAAC,aAAa,CAAC,CAAC,CAAA;AACjE,IAAA,IAAI,YAAA,EAAc;AACjB,MAAA,IAAA,CAAK,gBAAgB,GAAA,CAAI,YAAY,CAAA,EAAG,GAAA,CAAI,YAAY,EAAE,CAAA;AAAA,IAC3D;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,EAAE,CAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,cAAc,MAAA,EAAsB;AAC1C,IAAA,IAAA,CAAK,QAAA,CAAS,IAAI,MAAM,CAAA;AAAA,EACzB;AACD","file":"chunk-ZKINHLMS.js","sourcesContent":["import { analyzeBlueprint } from '../analysis'\nimport { FlowcraftError } from '../errors'\nimport type { NodeDefinition, NodeResult, WorkflowBlueprint } from '../types'\nimport type { WorkflowState } from './state'\n\nexport interface ReadyNode {\n\tnodeId: string\n\tnodeDef: NodeDefinition\n}\n\nexport class GraphTraverser {\n\tprivate frontier = new Set<string>()\n\tprivate allPredecessors: Map<string, Set<string>>\n\tprivate allSuccessors: Map<string, Set<string>>\n\tprivate dynamicBlueprint: WorkflowBlueprint\n\tprivate completedNodes = new Set<string>()\n\tprivate nodesInLoops: Map<string, Set<string>>\n\n\tconstructor(blueprint: WorkflowBlueprint, isStrictMode: boolean = false) {\n\t\tthis.dynamicBlueprint = structuredClone(blueprint) as WorkflowBlueprint\n\t\tthis.allPredecessors = new Map<string, Set<string>>()\n\t\tthis.allSuccessors = new Map<string, Set<string>>()\n\t\tthis.nodesInLoops = 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\tthis.allSuccessors.set(node.id, new Set())\n\t\t}\n\t\tfor (const edge of this.dynamicBlueprint.edges) {\n\t\t\tthis.getPredecessors(edge.target).add(edge.source)\n\t\t}\n\t\tfor (const edge of this.dynamicBlueprint.edges) {\n\t\t\tthis.getSuccessors(edge.source).add(edge.target)\n\t\t}\n\t\tconst analysis = analyzeBlueprint(blueprint)\n\t\tthis.filterNodesInLoops(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 && !isStrictMode) {\n\t\t\tconst uniqueStartNodes = new Set<string>()\n\t\t\tconst cycleEntryPoints = new Set(blueprint.metadata?.cycleEntryPoints || [])\n\t\t\tfor (const cycle of analysis.cycles) {\n\t\t\t\tif (cycle.length > 0) {\n\t\t\t\t\tconst entryPoint = cycle.find((node) => cycleEntryPoints.has(node))\n\t\t\t\t\tuniqueStartNodes.add(entryPoint || cycle[0])\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis.frontier = new Set(uniqueStartNodes)\n\t\t}\n\t}\n\n\t/**\n\t * Clears all nodes from the execution frontier.\n\t */\n\tpublic clearFrontier(): void {\n\t\tthis.frontier.clear()\n\t}\n\n\t/**\n\t * Creates and initializes a GraphTraverser from a saved workflow state.\n\t * This is the correct way to prepare a traverser for a `resume` operation.\n\t * @param blueprint The workflow blueprint.\n\t * @param state The workflow state being resumed.\n\t * @returns A configured GraphTraverser instance.\n\t */\n\tpublic static fromState(blueprint: WorkflowBlueprint, state: WorkflowState<any>): GraphTraverser {\n\t\tconst traverser = new GraphTraverser(blueprint)\n\n\t\t// clear auto-populated frontier from constructor\n\t\ttraverser.clearFrontier()\n\n\t\t// re-hydrate the set of completed nodes\n\t\tconst completedNodes = state.getCompletedNodes()\n\t\ttraverser.completedNodes = new Set(completedNodes)\n\n\t\tfor (const node of traverser.dynamicBlueprint.nodes) {\n\t\t\tif (traverser.completedNodes.has(node.id)) continue\n\n\t\t\tconst requiredPredecessors = traverser.allPredecessors.get(node.id)\n\t\t\tconst joinStrategy = traverser.getJoinStrategy(node.id)\n\n\t\t\t// if no predecessors and not completed, it's a start node and should be in the frontier\n\t\t\tif (!requiredPredecessors || requiredPredecessors.size === 0) {\n\t\t\t\ttraverser.frontier.add(node.id)\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tconst completedPredecessors = [...requiredPredecessors].filter((p) => traverser.completedNodes.has(p))\n\t\t\tconst isReady =\n\t\t\t\tjoinStrategy === 'any'\n\t\t\t\t\t? completedPredecessors.length > 0\n\t\t\t\t\t: completedPredecessors.length === requiredPredecessors.size\n\n\t\t\tif (isReady) traverser.frontier.add(node.id)\n\t\t}\n\n\t\treturn traverser\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\tprivate getJoinStrategy(nodeId: string): 'any' | 'all' {\n\t\tconst node = this.dynamicBlueprint.nodes.find((n) => n.id === nodeId)\n\t\tconst baseJoinStrategy = node?.config?.joinStrategy || 'all'\n\t\treturn baseJoinStrategy\n\t}\n\n\tprivate filterNodesInLoops(blueprint: WorkflowBlueprint): void {\n\t\tblueprint.nodes.forEach((node) => {\n\t\t\tif (node.uses !== 'loop-controller') return\n\n\t\t\tconst nextInLoopId = blueprint.edges.find((e) => e.source === node.id && e.action === 'continue')?.target\n\t\t\tif (!nextInLoopId) {\n\t\t\t\tthrow new FlowcraftError(\n\t\t\t\t\t`Loop '${node.id}' has no continue edge to start node. ` +\n\t\t\t\t\t\t`Ensure edges are wired inside the loop and incoming/breaking edges point to the loop controller.`,\n\t\t\t\t\t{ nodeId: node.id, blueprintId: blueprint.id },\n\t\t\t\t)\n\t\t\t}\n\n\t\t\tconst set: Set<string> = new Set()\n\t\t\tset.add(nextInLoopId)\n\t\t\tthis.nodesInLoops.set(node.id, this.getAllLoopSuccessors(nextInLoopId, blueprint, set))\n\t\t})\n\t}\n\n\tprivate getAllLoopSuccessors(nodeId: string, blueprint: WorkflowBlueprint, set: Set<string>): Set<string> {\n\t\tthis.getSuccessors(nodeId).forEach((successor) => {\n\t\t\tif (set.has(successor)) return\n\t\t\tconst node = this.getNode(successor, blueprint)\n\t\t\tif (!node || node.uses === 'loop-controller') return\n\t\t\tset.add(successor)\n\t\t\tthis.getAllLoopSuccessors(successor, blueprint, set)\n\t\t})\n\t\treturn set\n\t}\n\n\tgetReadyNodes(): ReadyNode[] {\n\t\tconst readyNodes: ReadyNode[] = []\n\t\tfor (const nodeId of this.frontier) {\n\t\t\tconst nodeDef = this.dynamicBlueprint.nodes.find((n) => n.id === nodeId)\n\t\t\tif (nodeDef) {\n\t\t\t\treadyNodes.push({ nodeId, nodeDef })\n\t\t\t}\n\t\t}\n\t\tthis.frontier.clear()\n\t\treturn readyNodes\n\t}\n\n\thasMoreWork(): boolean {\n\t\treturn this.frontier.size > 0\n\t}\n\n\tmarkNodeCompleted(nodeId: string, result: NodeResult<any, any>, nextNodes: NodeDefinition[]): void {\n\t\tthis.completedNodes.add(nodeId)\n\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.getPredecessors(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\n\t\tfor (const node of nextNodes) {\n\t\t\tconst joinStrategy = this.getJoinStrategy(node.id)\n\t\t\tif (joinStrategy !== 'any' && this.completedNodes.has(node.id)) continue\n\n\t\t\tconst requiredPredecessors = this.getPredecessors(node.id)\n\n\t\t\tconst isReady =\n\t\t\t\tjoinStrategy === 'any'\n\t\t\t\t\t? requiredPredecessors.has(nodeId)\n\t\t\t\t\t: [...requiredPredecessors].every((p) => this.completedNodes.has(p))\n\n\t\t\tif (isReady) {\n\t\t\t\tthis.frontier.add(node.id)\n\t\t\t\t// reset to uncompleted for all nodes in a loop\n\t\t\t\tif (node.uses === 'loop-controller') {\n\t\t\t\t\tthis.getNodesInLoop(node.id).forEach((id) => {\n\t\t\t\t\t\tthis.resetNodeCompletion(id)\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (nextNodes.length === 0) {\n\t\t\tfor (const [potentialNextId, predecessors] of this.allPredecessors) {\n\t\t\t\tif (predecessors.has(nodeId) && !this.completedNodes.has(potentialNextId)) {\n\t\t\t\t\tconst joinStrategy = this.getJoinStrategy(potentialNextId)\n\t\t\t\t\tconst isReady =\n\t\t\t\t\t\tjoinStrategy === 'any'\n\t\t\t\t\t\t\t? predecessors.has(nodeId)\n\t\t\t\t\t\t\t: [...predecessors].every((p) => this.completedNodes.has(p))\n\t\t\t\t\tif (isReady) {\n\t\t\t\t\t\tthis.frontier.add(potentialNextId)\n\t\t\t\t\t\tconst node = this.getNode(potentialNextId, this.dynamicBlueprint)\n\t\t\t\t\t\tif (!node) continue\n\t\t\t\t\t\t// reset to uncompleted for all nodes in a loop\n\t\t\t\t\t\tif (node.uses === 'loop-controller') {\n\t\t\t\t\t\t\tthis.getNodesInLoop(node.id).forEach((id) => {\n\t\t\t\t\t\t\t\tthis.resetNodeCompletion(id)\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}\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\tgetCompletedNodes(): Set<string> {\n\t\treturn new Set(this.completedNodes)\n\t}\n\n\tgetDynamicBlueprint(): WorkflowBlueprint {\n\t\treturn this.dynamicBlueprint\n\t}\n\n\tgetAllPredecessors(): Map<string, Set<string>> {\n\t\treturn this.allPredecessors\n\t}\n\n\tgetAllSuccessors(): Map<string, Set<string>> {\n\t\treturn this.allSuccessors\n\t}\n\n\tgetPredecessors(nodeId: string): Set<string> {\n\t\tconst predecessors = this.allPredecessors.get(nodeId)\n\t\tif (!predecessors) return new Set()\n\t\treturn predecessors\n\t}\n\n\tgetSuccessors(nodeId: string): Set<string> {\n\t\tconst successors = this.allSuccessors.get(nodeId)\n\t\tif (!successors) return new Set()\n\t\treturn successors\n\t}\n\n\tgetNodesInLoop(id: string): Set<string> {\n\t\tconst loopNodes = this.nodesInLoops.get(id)\n\t\tif (!loopNodes) return new Set()\n\t\treturn loopNodes\n\t}\n\n\tresetNodeCompletion(nodeId: string): void {\n\t\tthis.completedNodes.delete(nodeId)\n\t}\n\n\tgetNode(nodeId: string, blueprint: WorkflowBlueprint): NodeDefinition | undefined {\n\t\treturn blueprint.nodes.find((n) => n.id === nodeId)\n\t}\n\n\taddDynamicNode(_nodeId: string, dynamicNode: NodeDefinition, predecessorId: string, gatherNodeId?: string): void {\n\t\tthis.dynamicBlueprint.nodes.push(dynamicNode)\n\t\tthis.allPredecessors.set(dynamicNode.id, new Set([predecessorId]))\n\t\tif (gatherNodeId) {\n\t\t\tthis.allPredecessors.get(gatherNodeId)?.add(dynamicNode.id)\n\t\t}\n\t\tthis.frontier.add(dynamicNode.id)\n\t}\n\n\t/**\n\t * Manually adds a node ID back to the execution frontier.\n\t * Used by orchestrators that need fine-grained control over steps.\n\t * @param nodeId The ID of the node to add to the frontier.\n\t */\n\tpublic addToFrontier(nodeId: string): void {\n\t\tthis.frontier.add(nodeId)\n\t}\n}\n"]}

package/dist/chunk-ZLW4QOTS.js

@@ -1,192 +0,0 @@
-// src/analysis.ts
-function checkForCycles(blueprint) {
-  const cycles = [];
-  if (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {
-    return cycles;
-  }
-  const allNodeIds = blueprint.nodes.map((node) => node.id);
-  const adj = /* @__PURE__ */ new Map();
-  for (const id of allNodeIds) {
-    adj.set(id, []);
-  }
-  for (const edge of blueprint.edges) {
-    adj.get(edge.source)?.push(edge.target);
-  }
-  const state = /* @__PURE__ */ new Map();
-  for (const id of allNodeIds) {
-    state.set(id, 0);
-  }
-  for (const startNode of allNodeIds) {
-    if (state.get(startNode) !== 0) continue;
-    const stack = [{ node: startNode, path: [] }];
-    const pathSet = /* @__PURE__ */ new Set();
-    while (stack.length > 0) {
-      const { node, path } = stack[stack.length - 1];
-      if (state.get(node) === 0) {
-        state.set(node, 1);
-        pathSet.add(node);
-        path.push(node);
-      }
-      const neighbors = adj.get(node) || [];
-      let foundUnvisited = false;
-      for (const neighbor of neighbors) {
-        if (state.get(neighbor) === 1) {
-          const cycleStartIndex = path.indexOf(neighbor);
-          const cycle = path.slice(cycleStartIndex);
-          cycles.push([...cycle, neighbor]);
-        } else if (state.get(neighbor) === 0) {
-          stack.push({ node: neighbor, path: [...path] });
-          foundUnvisited = true;
-          break;
-        }
-      }
-      if (!foundUnvisited) {
-        state.set(node, 2);
-        stack.pop();
-        pathSet.delete(node);
-      }
-    }
-  }
-  return cycles;
-}
-function generateMermaid(blueprint) {
-  if (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {
-    return "flowchart TD\n    empty[Empty Blueprint]";
-  }
-  let mermaid = "flowchart TD\n";
-  for (const node of blueprint.nodes) {
-    const paramsString = node.params ? `<br/>params: ${JSON.stringify(node.params)}` : "";
-    const nodeLabel = `${node.id}${paramsString}`;
-    mermaid += `    ${node.id}["${nodeLabel}"]
-`;
-  }
-  for (const edge of blueprint.edges || []) {
-    const labelParts = [];
-    if (edge.action) {
-      labelParts.push(edge.action);
-    }
-    if (edge.condition) {
-      labelParts.push(edge.condition);
-    }
-    if (edge.transform) {
-      labelParts.push(edge.transform);
-    }
-    if (labelParts.length > 0) {
-      const edgeLabel = labelParts.join(" | ");
-      mermaid += `    ${edge.source} -- "${edgeLabel}" --> ${edge.target}
-`;
-    } else {
-      mermaid += `    ${edge.source} --> ${edge.target}
-`;
-    }
-  }
-  return mermaid;
-}
-function generateMermaidForRun(blueprint, events) {
-  if (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {
-    return "flowchart TD\n    empty[Empty Blueprint]";
-  }
-  let mermaid = "flowchart TD\n";
-  const successfulNodes = /* @__PURE__ */ new Set();
-  const failedNodes = /* @__PURE__ */ new Set();
-  const takenEdges = /* @__PURE__ */ new Set();
-  for (const event of events) {
-    switch (event.type) {
-      case "node:finish":
-        successfulNodes.add(event.payload.nodeId);
-        break;
-      case "node:error":
-        failedNodes.add(event.payload.nodeId);
-        break;
-      case "edge:evaluate":
-        if (event.payload.result) {
-          const edgeKey = `${event.payload.source}->${event.payload.target}`;
-          takenEdges.add(edgeKey);
-        }
-        break;
-    }
-  }
-  for (const node of blueprint.nodes) {
-    const paramsString = node.params ? `<br/>params: ${JSON.stringify(node.params)}` : "";
-    const nodeLabel = `${node.id}${paramsString}`;
-    mermaid += `    ${node.id}["${nodeLabel}"]
-`;
-  }
-  for (const node of blueprint.nodes) {
-    if (successfulNodes.has(node.id)) {
-      mermaid += `    style ${node.id} fill:#d4edda,stroke:#c3e6cb
-`;
-    } else if (failedNodes.has(node.id)) {
-      mermaid += `    style ${node.id} fill:#f8d7da,stroke:#f5c6cb
-`;
-    }
-  }
-  let edgeIndex = 0;
-  for (const edge of blueprint.edges || []) {
-    const labelParts = [];
-    if (edge.action) {
-      labelParts.push(edge.action);
-    }
-    if (edge.condition) {
-      labelParts.push(edge.condition);
-    }
-    if (edge.transform) {
-      labelParts.push(edge.transform);
-    }
-    const edgeKey = `${edge.source}->${edge.target}`;
-    const isTaken = takenEdges.has(edgeKey);
-    let edgeLine;
-    if (labelParts.length > 0) {
-      const edgeLabel = labelParts.join(" | ");
-      edgeLine = `    ${edge.source} -- "${edgeLabel}" --> ${edge.target}
-`;
-    } else {
-      edgeLine = `    ${edge.source} --> ${edge.target}
-`;
-    }
-    mermaid += edgeLine;
-    if (isTaken) {
-      mermaid += `    linkStyle ${edgeIndex} stroke:#007bff,stroke-width:3px
-`;
-    }
-    edgeIndex++;
-  }
-  return mermaid;
-}
-function analyzeBlueprint(blueprint) {
-  if (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {
-    return {
-      cycles: [],
-      startNodeIds: [],
-      terminalNodeIds: [],
-      nodeCount: 0,
-      edgeCount: 0,
-      isDag: true
-    };
-  }
-  const cycles = checkForCycles(blueprint);
-  const nodeCount = blueprint.nodes.length;
-  const edgeCount = blueprint.edges?.length || 0;
-  const nodesWithIncoming = /* @__PURE__ */ new Set();
-  for (const edge of blueprint.edges || []) {
-    nodesWithIncoming.add(edge.target);
-  }
-  const startNodeIds = blueprint.nodes.map((node) => node.id).filter((nodeId) => !nodesWithIncoming.has(nodeId));
-  const nodesWithOutgoing = /* @__PURE__ */ new Set();
-  for (const edge of blueprint.edges || []) {
-    nodesWithOutgoing.add(edge.source);
-  }
-  const terminalNodeIds = blueprint.nodes.map((node) => node.id).filter((nodeId) => !nodesWithOutgoing.has(nodeId));
-  return {
-    cycles,
-    startNodeIds,
-    terminalNodeIds,
-    nodeCount,
-    edgeCount,
-    isDag: cycles.length === 0
-  };
-}
-
-export { analyzeBlueprint, checkForCycles, generateMermaid, generateMermaidForRun };
-//# sourceMappingURL=chunk-ZLW4QOTS.js.map
-//# sourceMappingURL=chunk-ZLW4QOTS.js.map

package/dist/chunk-ZLW4QOTS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/analysis.ts"],"names":[],"mappings":";AA+BO,SAAS,eAAe,SAAA,EAAsC;AACpE,EAAA,MAAM,SAAiB,EAAC;AACxB,EAAA,IAAI,CAAC,aAAa,CAAC,SAAA,CAAU,SAAS,SAAA,CAAU,KAAA,CAAM,WAAW,CAAA,EAAG;AACnE,IAAA,OAAO,MAAA;AAAA,EACR;AAEA,EAAA,MAAM,aAAa,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,IAAA,KAAS,KAAK,EAAE,CAAA;AACxD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAsB;AACtC,EAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC5B,IAAA,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,EAAE,CAAA;AAAA,EACf;AACA,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,GAAA,CAAI,IAAI,IAAA,CAAK,MAAM,CAAA,EAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,EACvC;AAGA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC5B,IAAA,KAAA,CAAM,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,EAChB;AAEA,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AACnC,IAAA,IAAI,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,KAAM,CAAA,EAAG;AAEhC,IAAA,MAAM,KAAA,GAA4C,CAAC,EAAE,IAAA,EAAM,WAAW,IAAA,EAAM,IAAI,CAAA;AAChF,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,EAAE,IAAA,EAAM,IAAA,KAAS,KAAA,CAAM,KAAA,CAAM,SAAS,CAAC,CAAA;AAE7C,MAAA,IAAI,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,KAAM,CAAA,EAAG;AAE1B,QAAA,KAAA,CAAM,GAAA,CAAI,MAAM,CAAC,CAAA;AACjB,QAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,QAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,MACf;AAEA,MAAA,MAAM,SAAA,GAAY,GAAA,CAAI,GAAA,CAAI,IAAI,KAAK,EAAC;AACpC,MAAA,IAAI,cAAA,GAAiB,KAAA;AAErB,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AACjC,QAAA,IAAI,KAAA,CAAM,GAAA,CAAI,QAAQ,CAAA,KAAM,CAAA,EAAG;AAE9B,UAAA,MAAM,eAAA,GAAkB,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA;AAC7C,UAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,eAAe,CAAA;AACxC,UAAA,MAAA,CAAO,IAAA,CAAK,CAAC,GAAG,KAAA,EAAO,QAAQ,CAAC,CAAA;AAAA,QACjC,CAAA,MAAA,IAAW,KAAA,CAAM,GAAA,CAAI,QAAQ,MAAM,CAAA,EAAG;AAErC,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,QAAA,EAAU,MAAM,CAAC,GAAG,IAAI,CAAA,EAAG,CAAA;AAC9C,UAAA,cAAA,GAAiB,IAAA;AACjB,UAAA;AAAA,QACD;AAAA,MACD;AAEA,MAAA,IAAI,CAAC,cAAA,EAAgB;AAEpB,QAAA,KAAA,CAAM,GAAA,CAAI,MAAM,CAAC,CAAA;AACjB,QAAA,KAAA,CAAM,GAAA,EAAI;AACV,QAAA,OAAA,CAAQ,OAAO,IAAI,CAAA;AAAA,MACpB;AAAA,IACD;AAAA,EACD;AAEA,EAAA,OAAO,MAAA;AACR;AAOO,SAAS,gBAAgB,SAAA,EAAsC;AACrE,EAAA,IAAI,CAAC,aAAa,CAAC,SAAA,CAAU,SAAS,SAAA,CAAU,KAAA,CAAM,WAAW,CAAA,EAAG;AACnE,IAAA,OAAO,0CAAA;AAAA,EACR;AAEA,EAAA,IAAI,OAAA,GAAU,gBAAA;AAEd,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,MAAM,YAAA,GAAe,KAAK,MAAA,GAAS,CAAA,aAAA,EAAgB,KAAK,SAAA,CAAU,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,GAAK,EAAA;AACnF,IAAA,MAAM,SAAA,GAAY,CAAA,EAAG,IAAA,CAAK,EAAE,GAAG,YAAY,CAAA,CAAA;AAC3C,IAAA,OAAA,IAAW,CAAA,IAAA,EAAO,IAAA,CAAK,EAAE,CAAA,EAAA,EAAK,SAAS,CAAA;AAAA,CAAA;AAAA,EACxC;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,KAAA,IAAS,EAAC,EAAG;AACzC,IAAA,MAAM,aAAuB,EAAC;AAE9B,IAAA,IAAI,KAAK,MAAA,EAAQ;AAChB,MAAA,UAAA,CAAW,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,IAC5B;AACA,IAAA,IAAI,KAAK,SAAA,EAAW;AACnB,MAAA,UAAA,CAAW,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA,IAC/B;AACA,IAAA,IAAI,KAAK,SAAA,EAAW;AACnB,MAAA,UAAA,CAAW,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA,IAC/B;AAEA,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AAC1B,MAAA,MAAM,SAAA,GAAY,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA;AACvC,MAAA,OAAA,IAAW,OAAO,IAAA,CAAK,MAAM,QAAQ,SAAS,CAAA,MAAA,EAAS,KAAK,MAAM;AAAA,CAAA;AAAA,IACnE,CAAA,MAAO;AACN,MAAA,OAAA,IAAW,CAAA,IAAA,EAAO,IAAA,CAAK,MAAM,CAAA,KAAA,EAAQ,KAAK,MAAM;AAAA,CAAA;AAAA,IACjD;AAAA,EACD;AAEA,EAAA,OAAO,OAAA;AACR;AAQO,SAAS,qBAAA,CAAsB,WAA8B,MAAA,EAAkC;AACrG,EAAA,IAAI,CAAC,aAAa,CAAC,SAAA,CAAU,SAAS,SAAA,CAAU,KAAA,CAAM,WAAW,CAAA,EAAG;AACnE,IAAA,OAAO,0CAAA;AAAA,EACR;AAEA,EAAA,IAAI,OAAA,GAAU,gBAAA;AAEd,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAAY;AACxC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC3B,IAAA,QAAQ,MAAM,IAAA;AAAM,MACnB,KAAK,aAAA;AACJ,QAAA,eAAA,CAAgB,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA;AACxC,QAAA;AAAA,MACD,KAAK,YAAA;AACJ,QAAA,WAAA,CAAY,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA;AACpC,QAAA;AAAA,MACD,KAAK,eAAA;AACJ,QAAA,IAAI,KAAA,CAAM,QAAQ,MAAA,EAAQ;AACzB,UAAA,MAAM,OAAA,GAAU,GAAG,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAA,EAAK,KAAA,CAAM,QAAQ,MAAM,CAAA,CAAA;AAChE,UAAA,UAAA,CAAW,IAAI,OAAO,CAAA;AAAA,QACvB;AACA,QAAA;AAAA;AACF,EACD;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,MAAM,YAAA,GAAe,KAAK,MAAA,GAAS,CAAA,aAAA,EAAgB,KAAK,SAAA,CAAU,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,GAAK,EAAA;AACnF,IAAA,MAAM,SAAA,GAAY,CAAA,EAAG,IAAA,CAAK,EAAE,GAAG,YAAY,CAAA,CAAA;AAC3C,IAAA,OAAA,IAAW,CAAA,IAAA,EAAO,IAAA,CAAK,EAAE,CAAA,EAAA,EAAK,SAAS,CAAA;AAAA,CAAA;AAAA,EACxC;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACjC,MAAA,OAAA,IAAW,CAAA,UAAA,EAAa,KAAK,EAAE,CAAA;AAAA,CAAA;AAAA,IAChC,CAAA,MAAA,IAAW,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACpC,MAAA,OAAA,IAAW,CAAA,UAAA,EAAa,KAAK,EAAE,CAAA;AAAA,CAAA;AAAA,IAChC;AAAA,EACD;AAEA,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,KAAA,IAAS,EAAC,EAAG;AACzC,IAAA,MAAM,aAAuB,EAAC;AAE9B,IAAA,IAAI,KAAK,MAAA,EAAQ;AAChB,MAAA,UAAA,CAAW,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,IAC5B;AACA,IAAA,IAAI,KAAK,SAAA,EAAW;AACnB,MAAA,UAAA,CAAW,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA,IAC/B;AACA,IAAA,IAAI,KAAK,SAAA,EAAW;AACnB,MAAA,UAAA,CAAW,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA,IAC/B;AAEA,IAAA,MAAM,UAAU,CAAA,EAAG,IAAA,CAAK,MAAM,CAAA,EAAA,EAAK,KAAK,MAAM,CAAA,CAAA;AAC9C,IAAA,MAAM,OAAA,GAAU,UAAA,CAAW,GAAA,CAAI,OAAO,CAAA;AAEtC,IAAA,IAAI,QAAA;AACJ,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AAC1B,MAAA,MAAM,SAAA,GAAY,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA;AACvC,MAAA,QAAA,GAAW,OAAO,IAAA,CAAK,MAAM,QAAQ,SAAS,CAAA,MAAA,EAAS,KAAK,MAAM;AAAA,CAAA;AAAA,IACnE,CAAA,MAAO;AACN,MAAA,QAAA,GAAW,CAAA,IAAA,EAAO,IAAA,CAAK,MAAM,CAAA,KAAA,EAAQ,KAAK,MAAM;AAAA,CAAA;AAAA,IACjD;AAEA,IAAA,OAAA,IAAW,QAAA;AAEX,IAAA,IAAI,OAAA,EAAS;AACZ,MAAA,OAAA,IAAW,iBAAiB,SAAS,CAAA;AAAA,CAAA;AAAA,IACtC;AAEA,IAAA,SAAA,EAAA;AAAA,EACD;AAEA,EAAA,OAAO,OAAA;AACR;AAOO,SAAS,iBAAiB,SAAA,EAAiD;AACjF,EAAA,IAAI,CAAC,aAAa,CAAC,SAAA,CAAU,SAAS,SAAA,CAAU,KAAA,CAAM,WAAW,CAAA,EAAG;AACnE,IAAA,OAAO;AAAA,MACN,QAAQ,EAAC;AAAA,MACT,cAAc,EAAC;AAAA,MACf,iBAAiB,EAAC;AAAA,MAClB,SAAA,EAAW,CAAA;AAAA,MACX,SAAA,EAAW,CAAA;AAAA,MACX,KAAA,EAAO;AAAA,KACR;AAAA,EACD;AAEA,EAAA,MAAM,MAAA,GAAS,eAAe,SAAS,CAAA;AACvC,EAAA,MAAM,SAAA,GAAY,UAAU,KAAA,CAAM,MAAA;AAClC,EAAA,MAAM,SAAA,GAAY,SAAA,CAAU,KAAA,EAAO,MAAA,IAAU,CAAA;AAE7C,EAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAY;AAC1C,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,KAAA,IAAS,EAAC,EAAG;AACzC,IAAA,iBAAA,CAAkB,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EAClC;AAEA,EAAA,MAAM,eAAe,SAAA,CAAU,KAAA,CAAM,GAAA,CAAI,CAAC,SAAS,IAAA,CAAK,EAAE,CAAA,CAAE,MAAA,CAAO,CAAC,MAAA,KAAW,CAAC,iBAAA,CAAkB,GAAA,CAAI,MAAM,CAAC,CAAA;AAE7G,EAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAY;AAC1C,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,KAAA,IAAS,EAAC,EAAG;AACzC,IAAA,iBAAA,CAAkB,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EAClC;AAEA,EAAA,MAAM,kBAAkB,SAAA,CAAU,KAAA,CAAM,GAAA,CAAI,CAAC,SAAS,IAAA,CAAK,EAAE,CAAA,CAAE,MAAA,CAAO,CAAC,MAAA,KAAW,CAAC,iBAAA,CAAkB,GAAA,CAAI,MAAM,CAAC,CAAA;AAEhH,EAAA,OAAO;AAAA,IACN,MAAA;AAAA,IACA,YAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,SAAA;AAAA,IACA,KAAA,EAAO,OAAO,MAAA,KAAW;AAAA,GAC1B;AACD","file":"chunk-ZLW4QOTS.js","sourcesContent":["import type { FlowcraftEvent, WorkflowBlueprint } from './types'\n\n/**\n * A list of cycles found in the graph. Each cycle is an array of node IDs.\n */\nexport type Cycles = string[][]\n\n/**\n * Analysis result for a workflow blueprint\n */\nexport interface BlueprintAnalysis {\n\t/** Cycles found in the graph */\n\tcycles: Cycles\n\t/** Node IDs that have no incoming edges (start nodes) */\n\tstartNodeIds: string[]\n\t/** Node IDs that have no outgoing edges (terminal nodes) */\n\tterminalNodeIds: string[]\n\t/** Total number of nodes */\n\tnodeCount: number\n\t/** Total number of edges */\n\tedgeCount: number\n\t/** Whether the graph is a valid DAG (no cycles) */\n\tisDag: boolean\n}\n\n/**\n * Analyzes a workflow blueprint to detect cycles using an iterative DFS algorithm.\n * This avoids stack overflow issues for deep graphs compared to the recursive version.\n * @param blueprint The WorkflowBlueprint object containing nodes and edges.\n * @returns An array of cycles found. Each cycle is represented as an array of node IDs.\n */\nexport function checkForCycles(blueprint: WorkflowBlueprint): Cycles {\n\tconst cycles: Cycles = []\n\tif (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {\n\t\treturn cycles\n\t}\n\n\tconst allNodeIds = blueprint.nodes.map((node) => node.id)\n\tconst adj = new Map<string, string[]>()\n\tfor (const id of allNodeIds) {\n\t\tadj.set(id, [])\n\t}\n\tfor (const edge of blueprint.edges) {\n\t\tadj.get(edge.source)?.push(edge.target)\n\t}\n\n\t// 0 = not visited, 1 = visiting, 2 = visited\n\tconst state = new Map<string, number>()\n\tfor (const id of allNodeIds) {\n\t\tstate.set(id, 0)\n\t}\n\n\tfor (const startNode of allNodeIds) {\n\t\tif (state.get(startNode) !== 0) continue\n\n\t\tconst stack: { node: string; path: string[] }[] = [{ node: startNode, path: [] }]\n\t\tconst pathSet = new Set<string>()\n\n\t\twhile (stack.length > 0) {\n\t\t\tconst { node, path } = stack[stack.length - 1]\n\n\t\t\tif (state.get(node) === 0) {\n\t\t\t\t// first visit\n\t\t\t\tstate.set(node, 1) // visiting\n\t\t\t\tpathSet.add(node)\n\t\t\t\tpath.push(node)\n\t\t\t}\n\n\t\t\tconst neighbors = adj.get(node) || []\n\t\t\tlet foundUnvisited = false\n\n\t\t\tfor (const neighbor of neighbors) {\n\t\t\t\tif (state.get(neighbor) === 1) {\n\t\t\t\t\t// back edge, cycle found\n\t\t\t\t\tconst cycleStartIndex = path.indexOf(neighbor)\n\t\t\t\t\tconst cycle = path.slice(cycleStartIndex)\n\t\t\t\t\tcycles.push([...cycle, neighbor])\n\t\t\t\t} else if (state.get(neighbor) === 0) {\n\t\t\t\t\t// unvisited neighbor\n\t\t\t\t\tstack.push({ node: neighbor, path: [...path] })\n\t\t\t\t\tfoundUnvisited = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!foundUnvisited) {\n\t\t\t\t// all neighbors visited\n\t\t\t\tstate.set(node, 2) // visited\n\t\t\t\tstack.pop()\n\t\t\t\tpathSet.delete(node)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn cycles\n}\n\n/**\n * Generates Mermaid diagram syntax from a WorkflowBlueprint\n * @param blueprint The WorkflowBlueprint object containing nodes and edges\n * @returns Mermaid syntax string for the flowchart\n */\nexport function generateMermaid(blueprint: WorkflowBlueprint): string {\n\tif (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {\n\t\treturn 'flowchart TD\\n    empty[Empty Blueprint]'\n\t}\n\n\tlet mermaid = 'flowchart TD\\n'\n\n\tfor (const node of blueprint.nodes) {\n\t\tconst paramsString = node.params ? `<br/>params: ${JSON.stringify(node.params)}` : ''\n\t\tconst nodeLabel = `${node.id}${paramsString}`\n\t\tmermaid += `    ${node.id}[\"${nodeLabel}\"]\\n`\n\t}\n\n\tfor (const edge of blueprint.edges || []) {\n\t\tconst labelParts: string[] = []\n\n\t\tif (edge.action) {\n\t\t\tlabelParts.push(edge.action)\n\t\t}\n\t\tif (edge.condition) {\n\t\t\tlabelParts.push(edge.condition)\n\t\t}\n\t\tif (edge.transform) {\n\t\t\tlabelParts.push(edge.transform)\n\t\t}\n\n\t\tif (labelParts.length > 0) {\n\t\t\tconst edgeLabel = labelParts.join(' | ')\n\t\t\tmermaid += `    ${edge.source} -- \"${edgeLabel}\" --> ${edge.target}\\n`\n\t\t} else {\n\t\t\tmermaid += `    ${edge.source} --> ${edge.target}\\n`\n\t\t}\n\t}\n\n\treturn mermaid\n}\n\n/**\n * Generates Mermaid diagram syntax from a WorkflowBlueprint with execution history styling\n * @param blueprint The WorkflowBlueprint object containing nodes and edges\n * @param events Array of FlowcraftEvent objects from the workflow execution\n * @returns Mermaid syntax string for the flowchart with execution path highlighting\n */\nexport function generateMermaidForRun(blueprint: WorkflowBlueprint, events: FlowcraftEvent[]): string {\n\tif (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {\n\t\treturn 'flowchart TD\\n    empty[Empty Blueprint]'\n\t}\n\n\tlet mermaid = 'flowchart TD\\n'\n\n\tconst successfulNodes = new Set<string>()\n\tconst failedNodes = new Set<string>()\n\tconst takenEdges = new Set<string>()\n\n\tfor (const event of events) {\n\t\tswitch (event.type) {\n\t\t\tcase 'node:finish':\n\t\t\t\tsuccessfulNodes.add(event.payload.nodeId)\n\t\t\t\tbreak\n\t\t\tcase 'node:error':\n\t\t\t\tfailedNodes.add(event.payload.nodeId)\n\t\t\t\tbreak\n\t\t\tcase 'edge:evaluate':\n\t\t\t\tif (event.payload.result) {\n\t\t\t\t\tconst edgeKey = `${event.payload.source}->${event.payload.target}`\n\t\t\t\t\ttakenEdges.add(edgeKey)\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t}\n\t}\n\n\tfor (const node of blueprint.nodes) {\n\t\tconst paramsString = node.params ? `<br/>params: ${JSON.stringify(node.params)}` : ''\n\t\tconst nodeLabel = `${node.id}${paramsString}`\n\t\tmermaid += `    ${node.id}[\"${nodeLabel}\"]\\n`\n\t}\n\n\tfor (const node of blueprint.nodes) {\n\t\tif (successfulNodes.has(node.id)) {\n\t\t\tmermaid += `    style ${node.id} fill:#d4edda,stroke:#c3e6cb\\n`\n\t\t} else if (failedNodes.has(node.id)) {\n\t\t\tmermaid += `    style ${node.id} fill:#f8d7da,stroke:#f5c6cb\\n`\n\t\t}\n\t}\n\n\tlet edgeIndex = 0\n\tfor (const edge of blueprint.edges || []) {\n\t\tconst labelParts: string[] = []\n\n\t\tif (edge.action) {\n\t\t\tlabelParts.push(edge.action)\n\t\t}\n\t\tif (edge.condition) {\n\t\t\tlabelParts.push(edge.condition)\n\t\t}\n\t\tif (edge.transform) {\n\t\t\tlabelParts.push(edge.transform)\n\t\t}\n\n\t\tconst edgeKey = `${edge.source}->${edge.target}`\n\t\tconst isTaken = takenEdges.has(edgeKey)\n\n\t\tlet edgeLine: string\n\t\tif (labelParts.length > 0) {\n\t\t\tconst edgeLabel = labelParts.join(' | ')\n\t\t\tedgeLine = `    ${edge.source} -- \"${edgeLabel}\" --> ${edge.target}\\n`\n\t\t} else {\n\t\t\tedgeLine = `    ${edge.source} --> ${edge.target}\\n`\n\t\t}\n\n\t\tmermaid += edgeLine\n\n\t\tif (isTaken) {\n\t\t\tmermaid += `    linkStyle ${edgeIndex} stroke:#007bff,stroke-width:3px\\n`\n\t\t}\n\n\t\tedgeIndex++\n\t}\n\n\treturn mermaid\n}\n\n/**\n * Analyzes a workflow blueprint and returns comprehensive analysis\n * @param blueprint The WorkflowBlueprint object containing nodes and edges\n * @returns Analysis result with cycles, start nodes, terminal nodes, and other metrics\n */\nexport function analyzeBlueprint(blueprint: WorkflowBlueprint): BlueprintAnalysis {\n\tif (!blueprint || !blueprint.nodes || blueprint.nodes.length === 0) {\n\t\treturn {\n\t\t\tcycles: [],\n\t\t\tstartNodeIds: [],\n\t\t\tterminalNodeIds: [],\n\t\t\tnodeCount: 0,\n\t\t\tedgeCount: 0,\n\t\t\tisDag: true,\n\t\t}\n\t}\n\n\tconst cycles = checkForCycles(blueprint)\n\tconst nodeCount = blueprint.nodes.length\n\tconst edgeCount = blueprint.edges?.length || 0\n\n\tconst nodesWithIncoming = new Set<string>()\n\tfor (const edge of blueprint.edges || []) {\n\t\tnodesWithIncoming.add(edge.target)\n\t}\n\n\tconst startNodeIds = blueprint.nodes.map((node) => node.id).filter((nodeId) => !nodesWithIncoming.has(nodeId))\n\n\tconst nodesWithOutgoing = new Set<string>()\n\tfor (const edge of blueprint.edges || []) {\n\t\tnodesWithOutgoing.add(edge.source)\n\t}\n\n\tconst terminalNodeIds = blueprint.nodes.map((node) => node.id).filter((nodeId) => !nodesWithOutgoing.has(nodeId))\n\n\treturn {\n\t\tcycles,\n\t\tstartNodeIds,\n\t\tterminalNodeIds,\n\t\tnodeCount,\n\t\tedgeCount,\n\t\tisDag: cycles.length === 0,\n\t}\n}\n"]}

package/dist/container-factory.d.ts

@@ -1,17 +0,0 @@
-import { DIContainer } from './container.js';
-import { v as RuntimeDependencies, y as ILogger, D as ISerializer, x as IEvaluator, A as IEventBus, M as Middleware, o as NodeFunction, p as NodeClass, h as WorkflowBlueprint } from './types-Biip2gLh.js';
-import './errors.js';
-
-interface ContainerOptions<TDependencies extends RuntimeDependencies = RuntimeDependencies> {
-    logger?: ILogger;
-    serializer?: ISerializer;
-    evaluator?: IEvaluator;
-    eventBus?: IEventBus;
-    middleware?: Middleware[];
-    registry?: Record<string, NodeFunction | NodeClass>;
-    blueprints?: Record<string, WorkflowBlueprint>;
-    dependencies?: TDependencies;
-}
-declare function createDefaultContainer<TDependencies extends RuntimeDependencies = RuntimeDependencies>(options?: ContainerOptions<TDependencies>): DIContainer;
-
-export { type ContainerOptions, createDefaultContainer };

package/dist/container-factory.js

@@ -1,13 +0,0 @@
-export { createDefaultContainer } from './chunk-E6ICIXVR.js';
-import './chunk-QA2WDZPV.js';
-import './chunk-26VTGQAF.js';
-import './chunk-L3MX5MTA.js';
-import './chunk-L46TQXCV.js';
-import './chunk-4PELJWF7.js';
-import './chunk-6RKHCJUU.js';
-import './chunk-OOJEXFYY.js';
-import './chunk-ZETQCNEF.js';
-import './chunk-BCRWXTWX.js';
-import './chunk-PH2IYZHV.js';
-//# sourceMappingURL=container-factory.js.map
-//# sourceMappingURL=container-factory.js.map

package/dist/container-factory.js.map

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

package/dist/container.d.ts

@@ -1,23 +0,0 @@
-type ServiceToken<_T = any> = string | symbol;
-declare class DIContainer {
-    private services;
-    private factories;
-    register<T>(token: ServiceToken<T>, implementation: T): void;
-    registerFactory<T>(token: ServiceToken<T>, factory: (container: DIContainer) => T): void;
-    resolve<T>(token: ServiceToken<T>): T;
-    has(token: ServiceToken): boolean;
-    createChild(): DIContainer;
-}
-declare const ServiceTokens: {
-    readonly Logger: symbol;
-    readonly Serializer: symbol;
-    readonly Evaluator: symbol;
-    readonly EventBus: symbol;
-    readonly Orchestrator: symbol;
-    readonly Middleware: symbol;
-    readonly NodeRegistry: symbol;
-    readonly BlueprintRegistry: symbol;
-    readonly Dependencies: symbol;
-};
-
-export { DIContainer, type ServiceToken, ServiceTokens };

package/dist/container.js

@@ -1,3 +0,0 @@
-export { DIContainer, ServiceTokens } from './chunk-OOJEXFYY.js';
-//# sourceMappingURL=container.js.map
-//# sourceMappingURL=container.js.map

package/dist/container.js.map

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

package/dist/context.d.ts

@@ -1,65 +0,0 @@
-import { t as ISyncContext, u as IAsyncContext, P as PatchOperation } from './types-Biip2gLh.js';
-import './errors.js';
-import './container.js';
-
-/**
- * A default, high-performance, in-memory implementation of ISyncContext using a Map.
- */
-declare class Context<TContext extends Record<string, any>> implements ISyncContext<TContext> {
-    readonly type: "sync";
-    private data;
-    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>;
-}
-/**
- * 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.
- */
-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>>;
-    patch(_operations: PatchOperation[]): Promise<void>;
-}
-/**
- * A proxy wrapper that tracks changes to an async context for delta-based persistence.
- * Records all mutations (set/delete operations) to enable efficient partial updates.
- */
-declare class TrackedAsyncContext<TContext extends Record<string, any>> implements IAsyncContext<TContext> {
-    readonly type: "async";
-    private deltas;
-    private innerContext;
-    private eventBus?;
-    private executionId?;
-    private sourceNode?;
-    constructor(innerContext: IAsyncContext<TContext>, eventBus?: any, executionId?: string, sourceNode?: string);
-    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>>;
-    patch(operations: PatchOperation[]): Promise<void>;
-    getDeltas(): PatchOperation[];
-    clearDeltas(): void;
-    /**
-     * Configures the event emitter for tracking context changes.
-     * This enables the context to emit events when set/delete operations occur,
-     * allowing for external monitoring and persistence of context mutations.
-     *
-     * @param eventBus - The event bus instance to emit context change events
-     * @param executionId - The unique identifier for the current workflow execution
-     * @param sourceNode - Optional identifier for the node that triggered the context change
-     */
-    configureEventEmitter(eventBus: any, executionId: string, sourceNode?: string): void;
-}
-
-export { AsyncContextView, Context, TrackedAsyncContext };

package/dist/context.js

@@ -1,3 +0,0 @@
-export { AsyncContextView, Context, TrackedAsyncContext } from './chunk-ZETQCNEF.js';
-//# sourceMappingURL=context.js.map
-//# sourceMappingURL=context.js.map

package/dist/context.js.map

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

package/dist/error-mapper.d.ts

@@ -1,15 +0,0 @@
-import { h as WorkflowBlueprint } from './types-Biip2gLh.js';
-import './errors.js';
-import './container.js';
-
-/**
- * Creates an error mapper function that enhances runtime errors with source location information.
- * The mapper looks up node IDs in the provided manifest blueprints and returns enhanced errors
- * that point to the original TypeScript source code.
- *
- * @param manifestBlueprints - The compiled blueprint manifest containing source location data
- * @returns A function that maps errors to enhanced errors with source location information
- */
-declare function createErrorMapper(manifestBlueprints: Record<string, WorkflowBlueprint>): (error: Error) => Error;
-
-export { createErrorMapper };

package/dist/error-mapper.js

@@ -1,4 +0,0 @@
-export { createErrorMapper } from './chunk-27STBUGG.js';
-import './chunk-BCRWXTWX.js';
-//# sourceMappingURL=error-mapper.js.map
-//# sourceMappingURL=error-mapper.js.map