flowcraft 1.0.0 → 2.1.0

package/dist/chunk-P3RPDZHO.js

@@ -1,36 +0,0 @@
-import { composeContext } from './chunk-R27FIYR5.js';
-import { SequenceFlow } from './chunk-L5PK5VL2.js';
-import { Node } from './chunk-HEO3XL4Z.js';
-
-// src/functions.ts
-function mapNode(fn) {
-  return new class extends Node {
-    async exec({ params }) {
-      return fn(params);
-    }
-  }();
-}
-function contextNode(fn) {
-  return new class extends Node {
-    async exec({ ctx, params }) {
-      return await fn(ctx, params);
-    }
-  }();
-}
-function transformNode(...transforms) {
-  return new class extends Node {
-    async prep({ ctx }) {
-      await composeContext(...transforms)(ctx);
-    }
-  }();
-}
-function pipeline(...nodes) {
-  return new SequenceFlow(...nodes);
-}
-function compose(f, g) {
-  return async (input) => f(await g(input));
-}
-
-export { compose, contextNode, mapNode, pipeline, transformNode };
-//# sourceMappingURL=chunk-P3RPDZHO.js.map
-//# sourceMappingURL=chunk-P3RPDZHO.js.map

package/dist/chunk-P3RPDZHO.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/functions.ts"],"names":[],"mappings":";;;;;AAkCO,SAAS,QAId,EAAA,EAAmE;AACpE,EAAA,OAAO,IAAI,cAAc,IAAA,CAAyC;AAAA,IACjE,MAAM,IAAA,CAAK,EAAE,MAAA,EAAO,EAAuD;AAC1E,MAAA,OAAO,GAAG,MAAa,CAAA;AAAA,IACxB;AAAA,GACD,EAAE;AACH;AAeO,SAAS,YAId,EAAA,EAAgF;AACjF,EAAA,OAAO,IAAI,cAAc,IAAA,CAAyC;AAAA,IACjE,MAAM,IAAA,CAAK,EAAE,GAAA,EAAK,QAAO,EAAuD;AAC/E,MAAA,OAAO,MAAM,EAAA,CAAG,GAAA,EAAK,MAAa,CAAA;AAAA,IACnC;AAAA,GACD,EAAE;AACH;AAeO,SAAS,iBAAqD,UAAA,EAAyE;AAC7I,EAAA,OAAO,IAAI,cAAc,IAAA,CAA4C;AAAA,IACpE,MAAM,IAAA,CAAK,EAAE,GAAA,EAAI,EAA2C;AAE3D,MAAA,MAAM,cAAA,CAAe,GAAG,UAAU,CAAA,CAAE,GAAG,CAAA;AAAA,IACxC;AAAA,GACD,EAAE;AACH;AAYO,SAAS,YAAgD,KAAA,EAA+E;AAC9I,EAAA,OAAO,IAAI,YAAA,CAAyC,GAAG,KAAK,CAAA;AAC7D;AAkBO,SAAS,OAAA,CAAiB,GAAuB,CAAA,EAA2C;AAClG,EAAA,OAAO,OAAO,KAAA,KAAa,CAAA,CAAE,MAAM,CAAA,CAAE,KAAK,CAAC,CAAA;AAC5C","file":"chunk-P3RPDZHO.js","sourcesContent":["import type { Context, ContextTransform } from './context'\nimport type { NodeArgs, Params } from './types'\nimport type { Flow, Node } from './workflow/index'\nimport { SequenceFlow } from './builder/patterns'\nimport { composeContext } from './context'\nimport { Node as BaseNode } from './workflow/index'\n\n/**\n * A type for a pure function that can be executed within a `Node`,\n * typically taking the node's `params` as input.\n * @template TIn The input type, corresponding to `params`.\n * @template TOut The output type, which becomes the node's `execRes`.\n */\nexport type NodeFunction<TIn = any, TOut = any> = (input: TIn) => TOut | Promise<TOut>\n\n/**\n * A type for a function that operates on the shared `Context` in addition\n * to the node's `params`.\n * @template TIn The input type, corresponding to `params`.\n * @template TOut The output type, which becomes the node's `execRes`.\n */\nexport type ContextFunction<TIn = any, TOut = any, TContext extends Context = Context> = (ctx: TContext, input: TIn) => TOut | Promise<TOut>\n\n/**\n * Creates a `Node` from a simple, pure function that transforms an input to an output.\n * The node's `params` object is passed as the input to the function.\n *\n * @example\n * const add = (n: number) => mapNode<{ value: number }, number>(params => params.value + n)\n * const add5Node = add(5) // A reusable node that adds 5 to its input parameter.\n *\n * @param fn A function that takes an input object and returns a result.\n * @returns A new `Node` instance that wraps the function.\n */\nexport function mapNode<\n\tTIn extends Params,\n\tTOut,\n\tTContext extends Context = Context,\n>(fn: NodeFunction<TIn, TOut>): Node<void, TOut, any, TIn, TContext> {\n\treturn new class extends BaseNode<void, TOut, any, TIn, TContext> {\n\t\tasync exec({ params }: NodeArgs<void, void, TIn, TContext>): Promise<TOut> {\n\t\t\treturn fn(params as TIn)\n\t\t}\n\t}()\n}\n\n/**\n * Creates a `Node` from a function that requires access to the shared `Context`.\n * Both the `Context` and the node's `params` are passed as arguments to the function.\n *\n * @example\n * const greeter = contextNode(async (ctx, params: { name: string }) => {\n *   const language = await ctx.get(LANGUAGE_KEY) || 'en'\n *   return language === 'en' ? `Hello, ${params.name}` : `Hola, ${params.name}`\n * })\n *\n * @param fn A function that takes the context and an input object, and returns a result.\n * @returns A new `Node` instance that wraps the function.\n */\nexport function contextNode<\n\tTIn extends Params,\n\tTOut,\n\tTContext extends Context = Context,\n>(fn: ContextFunction<TIn, TOut, TContext>): Node<void, TOut, any, TIn, TContext> {\n\treturn new class extends BaseNode<void, TOut, any, TIn, TContext> {\n\t\tasync exec({ ctx, params }: NodeArgs<void, void, TIn, TContext>): Promise<TOut> {\n\t\t\treturn await fn(ctx, params as TIn)\n\t\t}\n\t}()\n}\n\n/**\n * Creates a `Node` that declaratively applies a series of transformations to the `Context`.\n * This is a \"side-effect\" node used purely for state management; its logic runs in the `prep` phase,\n * and it does not produce an `exec` output.\n *\n * @example\n * const USER_ID = contextKey<string>('user_id')\n * const userLens = lens(USER_ID)\n * const setupUserContext = (userId: string) => transformNode(userLens.set(userId))\n *\n * @param transforms A sequence of `ContextTransform` functions (e.g., from a lens) to apply.\n * @returns A new `Node` instance that will mutate the context when executed.\n */\nexport function transformNode<TContext extends Context = Context>(...transforms: ContextTransform[]): Node<void, void, any, Params, TContext> {\n\treturn new class extends BaseNode<void, void, any, Params, TContext> {\n\t\tasync prep({ ctx }: NodeArgs<void, void, Params, TContext>) {\n\t\t\t// Apply the composed transformations directly to the mutable context.\n\t\t\tawait composeContext(...transforms)(ctx)\n\t\t}\n\t}()\n}\n\n/**\n * A functional-style alias for `SequenceFlow`. It constructs a linear workflow\n * where each node executes in the order it is provided.\n *\n * @example\n * const mathPipeline = pipeline(addNode(5), multiplyNode(2))\n *\n * @param nodes A sequence of `Node` instances to chain together.\n * @returns A `Flow` instance representing the linear sequence.\n */\nexport function pipeline<TContext extends Context = Context>(...nodes: Node<any, any, any, any, TContext>[]): Flow<any, any, Params, TContext> {\n\treturn new SequenceFlow<any, any, Params, TContext>(...nodes)\n}\n\n/**\n * A classic functional composition utility. It takes two functions, `f` and `g`,\n * and returns a new function that computes `f(g(x))`.\n *\n * This is a general-purpose helper, not a `Node` builder itself, but it can be\n * used to create more complex `NodeFunction`s to pass to `mapNode`.\n *\n * @example\n * const add5 = (x: number) => x + 5\n * const multiply2 = (x: number) => x * 2\n * const add5ThenMultiply2 = compose(multiply2, add5) // equivalent to: x => (x + 5) * 2\n *\n * @param f The outer function, which receives the result of `g`.\n * @param g The inner function, which receives the initial input.\n * @returns A new `NodeFunction` that combines both operations.\n */\nexport function compose<A, B, C>(f: NodeFunction<B, C>, g: NodeFunction<A, B>): NodeFunction<A, C> {\n\treturn async (input: A) => f(await g(input))\n}\n"]}

package/dist/chunk-PNWOW52F.js

@@ -1,19 +0,0 @@
-// src/utils/middleware.ts
-function applyMiddleware(middleware, nodeToRun) {
-  const runNode = (args) => {
-    return nodeToRun._run({
-      ...args,
-      params: { ...args.params, ...nodeToRun.params }
-    });
-  };
-  if (!middleware || middleware.length === 0)
-    return runNode;
-  return middleware.reduceRight(
-    (next, mw) => (args) => mw(args, next),
-    runNode
-  );
-}
-
-export { applyMiddleware };
-//# sourceMappingURL=chunk-PNWOW52F.js.map
-//# sourceMappingURL=chunk-PNWOW52F.js.map

package/dist/chunk-PNWOW52F.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/middleware.ts"],"names":[],"mappings":";AAOO,SAAS,eAAA,CAAyB,YAA6B,SAAA,EAA4C;AACjH,EAAA,MAAM,OAAA,GAA6B,CAAC,IAAA,KAAmB;AACtD,IAAA,OAAO,UAAU,IAAA,CAAK;AAAA,MACrB,GAAG,IAAA;AAAA,MACH,QAAQ,EAAE,GAAG,KAAK,MAAA,EAAQ,GAAG,UAAU,MAAA;AAAO,KAC9C,CAAA;AAAA,EACF,CAAA;AAEA,EAAA,IAAI,CAAC,UAAA,IAAc,UAAA,CAAW,MAAA,KAAW,CAAA;AACxC,IAAA,OAAO,OAAA;AAGR,EAAA,OAAO,UAAA,CAAW,WAAA;AAAA,IACjB,CAAC,IAAA,EAAM,EAAA,KAAO,CAAC,IAAA,KAAmB,EAAA,CAAG,MAAM,IAAI,CAAA;AAAA,IAC/C;AAAA,GACD;AACD","file":"chunk-PNWOW52F.js","sourcesContent":["import type { Middleware, MiddlewareNext, NodeArgs } from '../types'\nimport type { AbstractNode } from '../workflow/index'\n\n/**\n * Composes a chain of middleware functions around a node's execution.\n * @internal\n */\nexport function applyMiddleware<T = any>(middleware: Middleware<T>[], nodeToRun: AbstractNode): MiddlewareNext<T> {\n\tconst runNode: MiddlewareNext<T> = (args: NodeArgs) => {\n\t\treturn nodeToRun._run({\n\t\t\t...args,\n\t\t\tparams: { ...args.params, ...nodeToRun.params },\n\t\t})\n\t}\n\n\tif (!middleware || middleware.length === 0)\n\t\treturn runNode\n\n\t// Build the chain backwards, so the first middleware in the array is the outermost.\n\treturn middleware.reduceRight<MiddlewareNext<T>>(\n\t\t(next, mw) => (args: NodeArgs) => mw(args, next),\n\t\trunNode,\n\t)\n}\n"]}

package/dist/chunk-R27FIYR5.js

@@ -1,62 +0,0 @@
-// src/context.ts
-var contextKey = (description) => Symbol(description);
-var TypedContext = class {
-  data;
-  /**
-   * @param initialData An optional iterable (like an array of `[key, value]` pairs)
-   * to initialize the context with.
-   */
-  constructor(initialData) {
-    this.data = new Map(initialData);
-  }
-  async get(key) {
-    return this.data.get(key);
-  }
-  async set(key, value) {
-    this.data.set(key, value);
-    return this;
-  }
-  async has(key) {
-    return this.data.has(key);
-  }
-  async delete(key) {
-    return this.data.delete(key);
-  }
-  entries() {
-    return this.data.entries();
-  }
-  keys() {
-    return this.data.keys();
-  }
-  values() {
-    return this.data.values();
-  }
-};
-function lens(key) {
-  return {
-    get: async (ctx) => {
-      return await ctx.get(key);
-    },
-    set: (value) => async (ctx) => {
-      return await ctx.set(key, value);
-    },
-    update: (fn) => async (ctx) => {
-      const currentValue = await ctx.get(key);
-      const newValue = fn(currentValue);
-      return await ctx.set(key, newValue);
-    }
-  };
-}
-function composeContext(...transforms) {
-  return async (ctx) => {
-    let currentContext = ctx;
-    for (const transform of transforms) {
-      currentContext = await transform(currentContext);
-    }
-    return currentContext;
-  };
-}
-
-export { TypedContext, composeContext, contextKey, lens };
-//# sourceMappingURL=chunk-R27FIYR5.js.map
-//# sourceMappingURL=chunk-R27FIYR5.js.map

package/dist/chunk-R27FIYR5.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/context.ts"],"names":[],"mappings":";AAeO,IAAM,UAAA,GAAa,CAAI,WAAA,KAAwC,MAAA,CAAO,WAAW;AA6CjF,IAAM,eAAN,MAAsC;AAAA,EACpC,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKR,YAAY,WAAA,EAAyE;AACpF,IAAA,IAAA,CAAK,IAAA,GAAO,IAAI,GAAA,CAAc,WAAW,CAAA;AAAA,EAC1C;AAAA,EACA,MAAM,IAAI,GAAA,EAA6C;AAAE,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA;AAAA,EAAE;AAAA,EACnF,MAAM,GAAA,CAAI,GAAA,EAA+B,KAAA,EAA2B;AAAE,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAG,IAAA,OAAO,IAAA;AAAA,EAAK;AAAA,EAC7G,MAAM,IAAI,GAAA,EAAiD;AAAE,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA;AAAA,EAAE;AAAA,EACvF,MAAM,OAAO,GAAA,EAAiD;AAAE,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,MAAA,CAAO,GAAG,CAAA;AAAA,EAAE;AAAA,EAC7F,OAAA,GAAwC;AAAE,IAAA,OAAO,IAAA,CAAK,KAAK,OAAA,EAAQ;AAAA,EAAE;AAAA,EACrE,IAAA,GAA8B;AAAE,IAAA,OAAO,IAAA,CAAK,KAAK,IAAA,EAAK;AAAA,EAAE;AAAA,EACxD,MAAA,GAAgC;AAAE,IAAA,OAAO,IAAA,CAAK,KAAK,MAAA,EAAO;AAAA,EAAE;AAC7D;AAsCO,SAAS,KAAQ,GAAA,EAAoC;AAC3D,EAAA,OAAO;AAAA,IACN,GAAA,EAAK,OAAO,GAAA,KAAyC;AACpD,MAAA,OAAO,MAAM,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA;AAAA,IACzB,CAAA;AAAA,IACA,GAAA,EAAK,CAAC,KAAA,KAA+B,OAAO,GAAA,KAAiB;AAC5D,MAAA,OAAO,MAAM,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAA,IAChC,CAAA;AAAA,IACA,MAAA,EAAQ,CAAC,EAAA,KAAwD,OAAO,GAAA,KAAiB;AACxF,MAAA,MAAM,YAAA,GAAe,MAAM,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA;AACtC,MAAA,MAAM,QAAA,GAAW,GAAG,YAAY,CAAA;AAChC,MAAA,OAAO,MAAM,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,QAAQ,CAAA;AAAA,IACnC;AAAA,GACD;AACD;AASO,SAAS,kBAAkB,UAAA,EAAkD;AACnF,EAAA,OAAO,OAAO,GAAA,KAAiB;AAC9B,IAAA,IAAI,cAAA,GAAiB,GAAA;AACrB,IAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AACnC,MAAA,cAAA,GAAiB,MAAM,UAAU,cAAc,CAAA;AAAA,IAChD;AACA,IAAA,OAAO,cAAA;AAAA,EACR,CAAA;AACD","file":"chunk-R27FIYR5.js","sourcesContent":["/* eslint-disable style/lines-between-class-members, style/max-statements-per-line */\n\n/**\n * A type-safe, opaque key for storing and retrieving values from the Context.\n * Using a `ContextKey` provides compile-time safety for your workflow's state.\n * @template T The type of the value this key refers to.\n */\nexport type ContextKey<T> = symbol & { __type: T }\n\n/**\n * Creates a new, unique `ContextKey` for type-safe access to the `Context`.\n * @template T The type of the value this key will hold.\n * @param description An optional description for debugging purposes (e.g., in logs or test snapshots).\n * @returns A unique `ContextKey<T>`.\n */\nexport const contextKey = <T>(description?: string): ContextKey<T> => Symbol(description) as ContextKey<T>\n\n/**\n * Defines the interface for the shared context object passed through the workflow.\n * This interface is \"async-aware\", allowing for both synchronous (Map-based)\n * and asynchronous (e.g., Redis-backed) implementations.\n */\nexport interface Context {\n\t/**\n\t * Asynchronously retrieves a value from the context.\n\t * Callers should ALWAYS `await` the result of this method.\n\t */\n\tget: (<T>(key: ContextKey<T>) => Promise<T | undefined>)\n\t\t& (<T = any>(key: string) => Promise<T | undefined>)\n\t/** Asynchronously stores a value in the context. */\n\tset: (<T>(key: ContextKey<T>, value: T) => Promise<this>)\n\t\t& ((key: string, value: any) => Promise<this>)\n\t/** Asynchronously checks if a key exists in the context. */\n\thas: ((key: ContextKey<any>) => Promise<boolean>)\n\t\t& ((key: string) => Promise<boolean>)\n\t/** Asynchronously deletes a key from the context. */\n\tdelete: ((key: ContextKey<any>) => Promise<boolean>)\n\t\t& ((key: string) => Promise<boolean>)\n\t/**\n\t * Returns an iterator of all [key, value] pairs in the context.\n\t * NOTE: This may not be supported or may be inefficient in some async implementations.\n\t */\n\tentries: () => IterableIterator<[any, any]>\n\t/**\n\t * Returns an iterator of all keys in the context.\n\t * NOTE: This may not be supported or may be inefficient in some async implementations.\n\t */\n\tkeys: () => IterableIterator<any>\n\t/**\n\t * Returns an iterator of all values in the context.\n\t * NOTE: This may not be supported or may be inefficient in some async implementations.\n\t */\n\tvalues: () => IterableIterator<any>\n}\n\n/**\n * The default, `Map`-based implementation of the `Context` interface.\n * Its methods are async to satisfy the `Context` interface, but they wrap\n * synchronous operations.\n */\nexport class TypedContext implements Context {\n\tprivate data: Map<any, any>\n\t/**\n\t * @param initialData An optional iterable (like an array of `[key, value]` pairs)\n\t * to initialize the context with.\n\t */\n\tconstructor(initialData?: Iterable<readonly [ContextKey<any> | string, any]> | null) {\n\t\tthis.data = new Map<any, any>(initialData)\n\t}\n\tasync get(key: ContextKey<any> | string): Promise<any> { return this.data.get(key) }\n\tasync set(key: ContextKey<any> | string, value: any): Promise<this> { this.data.set(key, value); return this }\n\tasync has(key: ContextKey<any> | string): Promise<boolean> { return this.data.has(key) }\n\tasync delete(key: ContextKey<any> | string): Promise<boolean> { return this.data.delete(key) }\n\tentries(): IterableIterator<[any, any]> { return this.data.entries() }\n\tkeys(): IterableIterator<any> { return this.data.keys() }\n\tvalues(): IterableIterator<any> { return this.data.values() }\n}\n\n/** A function that takes a `Context` and returns a (potentially new) `Context`. */\nexport type ContextTransform = (ctx: Context) => Context | Promise<Context>\n\n/**\n * A \"lens\" provides a way to \"focus\" on a single key in the `Context`,\n * creating reusable, type-safe async functions to get, set, or update its value.\n * @template T The type of the value the lens focuses on.\n */\nexport interface ContextLens<T> {\n\t/** Asynchronously retrieves the value for the key from the context. */\n\tget: (ctx: Context) => Promise<T | undefined>\n\t/** Returns an asynchronous `ContextTransform` function that will set the key to the provided value. */\n\tset: (value: T) => ContextTransform\n\t/** Returns an asynchronous `ContextTransform` function that updates the key's value based on its current value. */\n\tupdate: (fn: (current: T | undefined) => T) => ContextTransform\n}\n\n/**\n * Creates a `ContextLens` object for a specific `ContextKey`.\n * This is the entry point for functional context manipulation.\n * All operations that read from the context are now async.\n *\n * @example\n * const NAME = contextKey<string>('name')\n * const nameLens = lens(NAME)\n *\n * // Usage in an async function:\n * async function exampleUsage(ctx: Context) {\n *   const currentName = await nameLens.get(ctx);\n *   const setNameTransform = nameLens.set('Alice');\n *   await setNameTransform(ctx);\n * }\n *\n * @param key The `ContextKey` to focus on.\n * @returns A `ContextLens<T>` object with async-aware methods.\n */\nexport function lens<T>(key: ContextKey<T>): ContextLens<T> {\n\treturn {\n\t\tget: async (ctx: Context): Promise<T | undefined> => {\n\t\t\treturn await ctx.get(key) as T | undefined\n\t\t},\n\t\tset: (value: T): ContextTransform => async (ctx: Context) => {\n\t\t\treturn await ctx.set(key, value)\n\t\t},\n\t\tupdate: (fn: (current: T | undefined) => T): ContextTransform => async (ctx: Context) => {\n\t\t\tconst currentValue = await ctx.get(key) as T | undefined\n\t\t\tconst newValue = fn(currentValue)\n\t\t\treturn await ctx.set(key, newValue)\n\t\t},\n\t}\n}\n\n/**\n * Composes multiple `ContextTransform` functions into a single `ContextTransform` function.\n * The transformations are applied in the order they are provided.\n *\n * @param transforms A sequence of `ContextTransform` functions.\n * @returns A single function that applies all transformations.\n */\nexport function composeContext(...transforms: ContextTransform[]): ContextTransform {\n\treturn async (ctx: Context) => {\n\t\tlet currentContext = ctx\n\t\tfor (const transform of transforms) {\n\t\t\tcurrentContext = await transform(currentContext)\n\t\t}\n\t\treturn currentContext\n\t}\n}\n"]}

package/dist/chunk-S4WFNGQG.js

@@ -1,17 +0,0 @@
-// src/workflow/registry.ts
-var flowConstructor;
-function registerFlow(constructor) {
-  flowConstructor = constructor;
-}
-function getFlowConstructor() {
-  if (!flowConstructor) {
-    throw new Error(
-      "Flow constructor has not been registered. This is an internal error in the framework, likely due to a module loading issue."
-    );
-  }
-  return flowConstructor;
-}
-
-export { getFlowConstructor, registerFlow };
-//# sourceMappingURL=chunk-S4WFNGQG.js.map
-//# sourceMappingURL=chunk-S4WFNGQG.js.map

package/dist/chunk-S4WFNGQG.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/workflow/registry.ts"],"names":[],"mappings":";AAMA,IAAI,eAAA;AAMG,SAAS,aAAa,WAAA,EAAoC;AAChE,EAAA,eAAA,GAAkB,WAAA;AACnB;AAMO,SAAS,kBAAA,GAAsC;AACrD,EAAA,IAAI,CAAC,eAAA,EAAiB;AACrB,IAAA,MAAM,IAAI,KAAA;AAAA,MACT;AAAA,KACD;AAAA,EACD;AACA,EAAA,OAAO,eAAA;AACR","file":"chunk-S4WFNGQG.js","sourcesContent":["import type { AbstractNode } from './AbstractNode'\nimport type { Flow } from './Flow'\n\n// A type alias for the Flow class constructor.\ntype FlowConstructor = new (start?: AbstractNode) => Flow\n\nlet flowConstructor: FlowConstructor | undefined\n\n/**\n * For internal use by the Flow class to register itself, breaking the circular dependency.\n * @internal\n */\nexport function registerFlow(constructor: FlowConstructor): void {\n\tflowConstructor = constructor\n}\n\n/**\n * For internal use by the Node class to get the Flow constructor without a direct import.\n * @internal\n */\nexport function getFlowConstructor(): FlowConstructor {\n\tif (!flowConstructor) {\n\t\tthrow new Error(\n\t\t\t'Flow constructor has not been registered. This is an internal error in the framework, likely due to a module loading issue.',\n\t\t)\n\t}\n\treturn flowConstructor\n}\n"]}

package/dist/chunk-TS3M7MWA.js

@@ -1,3 +0,0 @@
-
-//# sourceMappingURL=chunk-TS3M7MWA.js.map
-//# sourceMappingURL=chunk-TS3M7MWA.js.map

package/dist/chunk-TS3M7MWA.js.map

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

package/dist/chunk-UY4PNPBX.js

@@ -1,156 +0,0 @@
-import { Node } from './chunk-HEO3XL4Z.js';
-import { InMemoryExecutor } from './chunk-BRFMFLR6.js';
-import { registerFlow } from './chunk-S4WFNGQG.js';
-
-// src/workflow/Flow.ts
-var Flow = class extends Node {
-  /** The first node to be executed in this flow's graph. */
-  startNode;
-  /** An array of middleware functions to be applied to every node within this flow. */
-  middleware = [];
-  /**
-   * @param start An optional node to start the flow with.
-   */
-  constructor(start) {
-    super();
-    this.startNode = start;
-  }
-  _wrapError(e, phase) {
-    if (phase === "exec") {
-      return e;
-    }
-    return super._wrapError(e, phase);
-  }
-  /**
-   * Adds a middleware function to this flow. Middleware will be executed in the
-   * order it is added, wrapping the execution of every node within this flow.
-   * @param fn The middleware function to add.
-   * @returns The `Flow` instance for chaining.
-   */
-  use(fn) {
-    this.middleware.push(fn);
-    return this;
-  }
-  /**
-   * Sets the starting node of the flow's graph.
-   * @param start The node to start with.
-   * @returns The start node instance, allowing for further chaining (`.next()`).
-   */
-  start(start) {
-    this.startNode = start;
-    return start;
-  }
-  /**
-   * (Lifecycle) Executes this flow's internal graph when it is used as a sub-flow
-   * (a node within a larger flow).
-   * @internal
-   * @param args The arguments for the node, passed down from the parent executor.
-   * @returns The final action returned by the last node in this flow's graph.
-   */
-  async exec(args) {
-    if (!(args.executor instanceof InMemoryExecutor)) {
-      throw new TypeError("Programmatic sub-flow execution is only supported by the InMemoryExecutor. For other environments, use GraphBuilder to create a single, flattened workflow.");
-    }
-    if (!this.startNode) {
-      return super.exec(args);
-    }
-    const combinedParams = { ...args.params, ...this.params };
-    const internalOptions = {
-      logger: args.logger,
-      signal: args.signal,
-      params: combinedParams,
-      executor: args.executor
-    };
-    const finalAction = await args.executor._orch(
-      this.startNode,
-      this.middleware,
-      args.ctx,
-      internalOptions
-    );
-    return finalAction;
-  }
-  /**
-   * (Lifecycle) The post-execution step for a `Flow` node. It simply passes through
-   * the final action from its internal graph execution (`execRes`).
-   * @internal
-   */
-  async post({ execRes }) {
-    return execRes;
-  }
-  /**
-   * Runs the entire flow as a top-level entry point.
-   * @param ctx The shared workflow context.
-   * @param options Runtime options like a logger, abort controller, or a custom executor.
-   * @returns The final action returned by the last node in the flow.
-   */
-  async run(ctx, options) {
-    const executor = options?.executor ?? new InMemoryExecutor();
-    return executor.run(this, ctx, options);
-  }
-  /**
-   * Finds a node within the flow's graph by its unique ID.
-   *
-   * This method performs a breadth-first search starting from the `startNode`.
-   * It is a convenient way to get a reference to a specific node instance
-   * for debugging or dynamic modifications.
-   *
-   * @remarks
-   * This performs a graph traversal on each call, which has a time complexity
-   * proportional to the number of nodes and edges in the graph (O(V+E)). For
-   * performance-critical applications or flows built with `GraphBuilder`,
-   * it is more efficient to use the `nodeMap` returned by `GraphBuilder.build()`.
-   *
-   * @param id The unique ID of the node to find (set via `.withId()` or by the `GraphBuilder`).
-   * @returns The `AbstractNode` instance if found, otherwise `undefined`.
-   */
-  getNodeById(id) {
-    if (!this.startNode)
-      return void 0;
-    const queue = [this.startNode];
-    const visited = /* @__PURE__ */ new Set([this.startNode]);
-    while (queue.length > 0) {
-      const currentNode = queue.shift();
-      if (currentNode.id === id)
-        return currentNode;
-      for (const successorArray of currentNode.successors.values()) {
-        for (const successor of successorArray) {
-          if (!visited.has(successor)) {
-            visited.add(successor);
-            queue.push(successor);
-          }
-        }
-      }
-    }
-    return void 0;
-  }
-  /**
-   * Retrieves all unique nodes within the flow's graph.
-   * @internal
-   */
-  getAllNodes() {
-    const allNodes = /* @__PURE__ */ new Set();
-    if (!this.startNode)
-      return allNodes;
-    const queue = [this.startNode];
-    const visited = /* @__PURE__ */ new Set([this.startNode]);
-    allNodes.add(this.startNode);
-    while (queue.length > 0) {
-      const currentNode = queue.shift();
-      for (const successorArray of currentNode.successors.values()) {
-        for (const successor of successorArray) {
-          if (!visited.has(successor)) {
-            visited.add(successor);
-            queue.push(successor);
-            allNodes.add(successor);
-          }
-        }
-      }
-    }
-    return allNodes;
-  }
-};
-registerFlow(Flow);
-
-export { Flow };
-//# sourceMappingURL=chunk-UY4PNPBX.js.map
-//# sourceMappingURL=chunk-UY4PNPBX.js.map

package/dist/chunk-UY4PNPBX.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/workflow/Flow.ts"],"names":[],"mappings":";;;;;AAgBO,IAAM,IAAA,GAAN,cAKG,IAAA,CAAmD;AAAA;AAAA,EAErD,SAAA;AAAA;AAAA,EAEA,aAA2B,EAAC;AAAA;AAAA;AAAA;AAAA,EAKnC,YAAY,KAAA,EAA0C;AACrD,IAAA,KAAA,EAAM;AACN,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA;AAAA,EAClB;AAAA,EAEU,UAAA,CAAW,GAAQ,KAAA,EAAwC;AACpE,IAAA,IAAI,UAAU,MAAA,EAAQ;AAErB,MAAA,OAAO,CAAA;AAAA,IACR;AACA,IAAA,OAAO,KAAA,CAAM,UAAA,CAAW,CAAA,EAAG,KAAK,CAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,IAAI,EAAA,EAAsB;AAChC,IAAA,IAAA,CAAK,UAAA,CAAW,KAAK,EAAE,CAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAA0D,KAAA,EAA6B;AACtF,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA;AACjB,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,KAAK,IAAA,EAA+D;AAIzE,IAAA,IAAI,EAAE,IAAA,CAAK,QAAA,YAAoB,gBAAA,CAAA,EAAmB;AACjD,MAAA,MAAM,IAAI,UAAU,6JAA6J,CAAA;AAAA,IAClL;AAEA,IAAA,IAAI,CAAC,KAAK,SAAA,EAAW;AAEpB,MAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACvB;AAEA,IAAA,MAAM,iBAAiB,EAAE,GAAG,KAAK,MAAA,EAAQ,GAAG,KAAK,MAAA,EAAO;AACxD,IAAA,MAAM,eAAA,GAAsC;AAAA,MAC3C,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,MAAA,EAAQ,cAAA;AAAA,MACR,UAAU,IAAA,CAAK;AAAA,KAChB;AAEA,IAAA,MAAM,WAAA,GAAc,MAAM,IAAA,CAAK,QAAA,CAAS,KAAA;AAAA,MACvC,IAAA,CAAK,SAAA;AAAA,MACL,IAAA,CAAK,UAAA;AAAA,MACL,IAAA,CAAK,GAAA;AAAA,MACL;AAAA,KACD;AAEA,IAAA,OAAO,WAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAA,CAAK,EAAE,OAAA,EAAQ,EAAoE;AACxF,IAAA,OAAO,OAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,GAAA,CAAI,GAAA,EAAe,OAAA,EAAwC;AAChE,IAAA,MAAM,QAAA,GAAW,OAAA,EAAS,QAAA,IAAY,IAAI,gBAAA,EAAiB;AAC3D,IAAA,OAAO,QAAA,CAAS,GAAA,CAAI,IAAA,EAAM,GAAA,EAAK,OAAO,CAAA;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBO,YAAY,EAAA,EAAmE;AACrF,IAAA,IAAI,CAAC,IAAA,CAAK,SAAA;AACT,MAAA,OAAO,MAAA;AAER,IAAA,MAAM,KAAA,GAA4C,CAAC,IAAA,CAAK,SAAS,CAAA;AACjE,IAAA,MAAM,0BAAU,IAAI,GAAA,CAAsC,CAAC,IAAA,CAAK,SAAS,CAAC,CAAA;AAC1E,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,WAAA,GAAc,MAAM,KAAA,EAAM;AAEhC,MAAA,IAAI,YAAY,EAAA,KAAO,EAAA;AACtB,QAAA,OAAO,WAAA;AAER,MAAA,KAAA,MAAW,cAAA,IAAkB,WAAA,CAAY,UAAA,CAAW,MAAA,EAAO,EAAG;AAC7D,QAAA,KAAA,MAAW,aAAa,cAAA,EAAgB;AACvC,UAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AAC5B,YAAA,OAAA,CAAQ,IAAI,SAAS,CAAA;AACrB,YAAA,KAAA,CAAM,KAAK,SAAS,CAAA;AAAA,UACrB;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAEA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,WAAA,GAAiC;AACvC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAkB;AACvC,IAAA,IAAI,CAAC,IAAA,CAAK,SAAA;AACT,MAAA,OAAO,QAAA;AAER,IAAA,MAAM,KAAA,GAAwB,CAAC,IAAA,CAAK,SAAS,CAAA;AAC7C,IAAA,MAAM,0BAAU,IAAI,GAAA,CAAkB,CAAC,IAAA,CAAK,SAAS,CAAC,CAAA;AACtD,IAAA,QAAA,CAAS,GAAA,CAAI,KAAK,SAAS,CAAA;AAE3B,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,WAAA,GAAc,MAAM,KAAA,EAAM;AAChC,MAAA,KAAA,MAAW,cAAA,IAAkB,WAAA,CAAY,UAAA,CAAW,MAAA,EAAO,EAAG;AAC7D,QAAA,KAAA,MAAW,aAAa,cAAA,EAAgB;AACvC,UAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,EAAG;AAC5B,YAAA,OAAA,CAAQ,IAAI,SAAS,CAAA;AACrB,YAAA,KAAA,CAAM,KAAK,SAAS,CAAA;AACpB,YAAA,QAAA,CAAS,IAAI,SAAS,CAAA;AAAA,UACvB;AAAA,QACD;AAAA,MACD;AAAA,IACD;AACA,IAAA,OAAO,QAAA;AAAA,EACR;AACD;AAEA,YAAA,CAAa,IAAI,CAAA","file":"chunk-UY4PNPBX.js","sourcesContent":["import type { Context } from '../context'\nimport type { InternalRunOptions } from '../executors/types'\nimport type { Middleware, NodeArgs, Params, RunOptions } from '../types'\nimport type { AbstractNode } from './AbstractNode'\nimport { InMemoryExecutor } from '../executors/in-memory'\nimport { Node } from './Node'\nimport { registerFlow } from './registry'\n\n/**\n * A special type of `Node` that orchestrates a graph of other nodes.\n * It can contain its own middleware and can be composed within other flows.\n *\n * @template PrepRes The type of data returned by the `prep` phase.\n * @template ExecRes The type of data returned by the `exec` phase (the final action).\n * @template TParams The type for the flow's static parameters.\n */\nexport class Flow<\n\tPrepRes = any,\n\tExecRes = any,\n\tTParams extends Params = Params,\n\tTContext extends Context = Context,\n> extends Node<PrepRes, ExecRes, ExecRes, TParams, TContext> {\n\t/** The first node to be executed in this flow's graph. */\n\tpublic startNode?: AbstractNode<any, any>\n\t/** An array of middleware functions to be applied to every node within this flow. */\n\tpublic middleware: Middleware[] = []\n\n\t/**\n\t * @param start An optional node to start the flow with.\n\t */\n\tconstructor(start?: AbstractNode<any, any, TContext>) {\n\t\tsuper()\n\t\tthis.startNode = start\n\t}\n\n\tprotected _wrapError(e: any, phase: 'prep' | 'exec' | 'post'): Error {\n\t\tif (phase === 'exec') {\n\t\t\t// Errors from a sub-flow's orchestration are already wrapped, so we pass them through.\n\t\t\treturn e\n\t\t}\n\t\treturn super._wrapError(e, phase)\n\t}\n\n\t/**\n\t * Adds a middleware function to this flow. Middleware will be executed in the\n\t * order it is added, wrapping the execution of every node within this flow.\n\t * @param fn The middleware function to add.\n\t * @returns The `Flow` instance for chaining.\n\t */\n\tpublic use(fn: Middleware): this {\n\t\tthis.middleware.push(fn)\n\t\treturn this\n\t}\n\n\t/**\n\t * Sets the starting node of the flow's graph.\n\t * @param start The node to start with.\n\t * @returns The start node instance, allowing for further chaining (`.next()`).\n\t */\n\tstart<StartNode extends AbstractNode<any, any, TContext>>(start: StartNode): StartNode {\n\t\tthis.startNode = start\n\t\treturn start\n\t}\n\n\t/**\n\t * (Lifecycle) Executes this flow's internal graph when it is used as a sub-flow\n\t * (a node within a larger flow).\n\t * @internal\n\t * @param args The arguments for the node, passed down from the parent executor.\n\t * @returns The final action returned by the last node in this flow's graph.\n\t */\n\tasync exec(args: NodeArgs<any, any, TParams, TContext>): Promise<ExecRes> {\n\t\t// For programmatic composition, a Flow node orchestrates its own graph.\n\t\t// This is a feature of the InMemoryExecutor. Distributed systems should\n\t\t// rely on pre-flattened graphs produced by the GraphBuilder.\n\t\tif (!(args.executor instanceof InMemoryExecutor)) {\n\t\t\tthrow new TypeError('Programmatic sub-flow execution is only supported by the InMemoryExecutor. For other environments, use GraphBuilder to create a single, flattened workflow.')\n\t\t}\n\n\t\tif (!this.startNode) {\n\t\t\t// This handles logic-bearing flows like BatchFlow that override exec directly.\n\t\t\treturn super.exec(args)\n\t\t}\n\n\t\tconst combinedParams = { ...args.params, ...this.params }\n\t\tconst internalOptions: InternalRunOptions = {\n\t\t\tlogger: args.logger,\n\t\t\tsignal: args.signal,\n\t\t\tparams: combinedParams,\n\t\t\texecutor: args.executor,\n\t\t}\n\n\t\tconst finalAction = await args.executor._orch<ExecRes>(\n\t\t\tthis.startNode,\n\t\t\tthis.middleware,\n\t\t\targs.ctx,\n\t\t\tinternalOptions,\n\t\t)\n\n\t\treturn finalAction as ExecRes\n\t}\n\n\t/**\n\t * (Lifecycle) The post-execution step for a `Flow` node. It simply passes through\n\t * the final action from its internal graph execution (`execRes`).\n\t * @internal\n\t */\n\tasync post({ execRes }: NodeArgs<PrepRes, ExecRes, TParams, TContext>): Promise<ExecRes> {\n\t\treturn execRes\n\t}\n\n\t/**\n\t * Runs the entire flow as a top-level entry point.\n\t * @param ctx The shared workflow context.\n\t * @param options Runtime options like a logger, abort controller, or a custom executor.\n\t * @returns The final action returned by the last node in the flow.\n\t */\n\tasync run(ctx: TContext, options?: RunOptions): Promise<ExecRes> {\n\t\tconst executor = options?.executor ?? new InMemoryExecutor()\n\t\treturn executor.run(this, ctx, options)\n\t}\n\n\t/**\n\t * Finds a node within the flow's graph by its unique ID.\n\t *\n\t * This method performs a breadth-first search starting from the `startNode`.\n\t * It is a convenient way to get a reference to a specific node instance\n\t * for debugging or dynamic modifications.\n\t *\n\t * @remarks\n\t * This performs a graph traversal on each call, which has a time complexity\n\t * proportional to the number of nodes and edges in the graph (O(V+E)). For\n\t * performance-critical applications or flows built with `GraphBuilder`,\n\t * it is more efficient to use the `nodeMap` returned by `GraphBuilder.build()`.\n\t *\n\t * @param id The unique ID of the node to find (set via `.withId()` or by the `GraphBuilder`).\n\t * @returns The `AbstractNode` instance if found, otherwise `undefined`.\n\t */\n\tpublic getNodeById(id: string | number): AbstractNode<any, any, TContext> | undefined {\n\t\tif (!this.startNode)\n\t\t\treturn undefined\n\n\t\tconst queue: AbstractNode<any, any, TContext>[] = [this.startNode]\n\t\tconst visited = new Set<AbstractNode<any, any, TContext>>([this.startNode])\n\t\twhile (queue.length > 0) {\n\t\t\tconst currentNode = queue.shift()!\n\n\t\t\tif (currentNode.id === id)\n\t\t\t\treturn currentNode\n\n\t\t\tfor (const successorArray of currentNode.successors.values()) {\n\t\t\t\tfor (const successor of successorArray) {\n\t\t\t\t\tif (!visited.has(successor)) {\n\t\t\t\t\t\tvisited.add(successor)\n\t\t\t\t\t\tqueue.push(successor)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn undefined\n\t}\n\n\t/**\n\t * Retrieves all unique nodes within the flow's graph.\n\t * @internal\n\t */\n\tpublic getAllNodes(): Set<AbstractNode> {\n\t\tconst allNodes = new Set<AbstractNode>()\n\t\tif (!this.startNode)\n\t\t\treturn allNodes\n\n\t\tconst queue: AbstractNode[] = [this.startNode]\n\t\tconst visited = new Set<AbstractNode>([this.startNode])\n\t\tallNodes.add(this.startNode)\n\n\t\twhile (queue.length > 0) {\n\t\t\tconst currentNode = queue.shift()!\n\t\t\tfor (const successorArray of currentNode.successors.values()) {\n\t\t\t\tfor (const successor of successorArray) {\n\t\t\t\t\tif (!visited.has(successor)) {\n\t\t\t\t\t\tvisited.add(successor)\n\t\t\t\t\t\tqueue.push(successor)\n\t\t\t\t\t\tallNodes.add(successor)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn allNodes\n\t}\n}\n\nregisterFlow(Flow)\n"]}

package/dist/chunk-VMH2LRM6.js

@@ -1,114 +0,0 @@
-import { DEFAULT_ACTION, FILTER_FAILED } from './chunk-AOHBHYF6.js';
-
-// src/utils/mermaid.ts
-function getActionLabel(action) {
-  if (action === DEFAULT_ACTION)
-    return "";
-  if (action === FILTER_FAILED)
-    return '"filter failed"';
-  const sanitizedAction = action.toString().replace(/"/g, "");
-  return `"${sanitizedAction}"`;
-}
-function getNodeLabel(node, uniqueId) {
-  if (node.isParallelContainer)
-    return `  ${uniqueId}{Parallel Block}`;
-  if (node.constructor.name === "InputMappingNode")
-    return `  ${uniqueId}(("Inputs"))`;
-  if (node.constructor.name === "OutputMappingNode")
-    return `  ${uniqueId}(("Outputs"))`;
-  if (node.graphData) {
-    const type = node.graphData.type;
-    const id = node.graphData.id.split(":").pop();
-    return `  ${uniqueId}["${id} (${type})"]`;
-  }
-  return `  ${uniqueId}[${node.constructor.name}]`;
-}
-function getUniqueNodeId(node, nameCounts, idMap) {
-  if (idMap.has(node))
-    return idMap.get(node);
-  let baseName;
-  if (node.isParallelContainer) {
-    baseName = "ParallelBlock";
-  } else if (node.graphData) {
-    baseName = node.graphData.id;
-  } else if (node.id) {
-    baseName = String(node.id);
-  } else {
-    baseName = node.constructor.name;
-  }
-  const sanitizedBaseName = baseName.replace(/:/g, "_").replace(/\W/g, "");
-  const count = nameCounts.get(sanitizedBaseName) || 0;
-  const uniqueId = `${sanitizedBaseName}_${count}`;
-  nameCounts.set(sanitizedBaseName, count + 1);
-  idMap.set(node, uniqueId);
-  return uniqueId;
-}
-function generateMermaidGraph(flow) {
-  if (!flow.startNode)
-    return "graph TD\n  %% Empty Flow";
-  const nodes = /* @__PURE__ */ new Set();
-  const edges = /* @__PURE__ */ new Set();
-  const visited = /* @__PURE__ */ new Set();
-  const queue = [flow.startNode];
-  const idMap = /* @__PURE__ */ new Map();
-  const nameCounts = /* @__PURE__ */ new Map();
-  visited.add(flow.startNode);
-  getUniqueNodeId(flow.startNode, nameCounts, idMap);
-  while (queue.length > 0) {
-    const currentNode = queue.shift();
-    const sourceId = getUniqueNodeId(currentNode, nameCounts, idMap);
-    nodes.add(getNodeLabel(currentNode, sourceId));
-    if (currentNode.isParallelContainer) {
-      const container = currentNode;
-      for (const internalNode of container.nodesToRun) {
-        const targetId = getUniqueNodeId(internalNode, nameCounts, idMap);
-        edges.add(`  ${sourceId} --> ${targetId}`);
-        if (!visited.has(internalNode)) {
-          visited.add(internalNode);
-          queue.push(internalNode);
-        }
-      }
-    }
-    for (const [action, successorNodes] of currentNode.successors.entries()) {
-      for (const successorNode of successorNodes) {
-        const targetId = getUniqueNodeId(successorNode, nameCounts, idMap);
-        const label = getActionLabel(action);
-        const edge = label ? `  ${sourceId} -- ${label} --> ${targetId}` : `  ${sourceId} --> ${targetId}`;
-        edges.add(edge);
-        if (!visited.has(successorNode)) {
-          visited.add(successorNode);
-          queue.push(successorNode);
-        }
-      }
-    }
-  }
-  const mermaidLines = [
-    "graph TD",
-    ...Array.from(nodes),
-    ...Array.from(edges)
-  ];
-  return mermaidLines.join("\n");
-}
-function generateMermaidFromBlueprint(blueprint) {
-  let mermaidString = "graph TD\n";
-  for (const node of blueprint.nodes) {
-    const label = `${node.id.replace(/"/g, "#quot;")} (${node.type})`;
-    mermaidString += `    ${node.id}["${label}"]
-`;
-  }
-  mermaidString += "\n";
-  for (const edge of blueprint.edges) {
-    if (edge.action) {
-      mermaidString += `    ${edge.source} -->|${String(edge.action)}| ${edge.target}
-`;
-    } else {
-      mermaidString += `    ${edge.source} --> ${edge.target}
-`;
-    }
-  }
-  return mermaidString;
-}
-
-export { generateMermaidFromBlueprint, generateMermaidGraph };
-//# sourceMappingURL=chunk-VMH2LRM6.js.map
-//# sourceMappingURL=chunk-VMH2LRM6.js.map

package/dist/chunk-VMH2LRM6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/mermaid.ts"],"names":[],"mappings":";;;AASA,SAAS,eAAe,MAAA,EAAiC;AACxD,EAAA,IAAI,MAAA,KAAW,cAAA;AACd,IAAA,OAAO,EAAA;AAER,EAAA,IAAI,MAAA,KAAW,aAAA;AACd,IAAA,OAAO,iBAAA;AAGR,EAAA,MAAM,kBAAkB,MAAA,CAAO,QAAA,EAAS,CAAE,OAAA,CAAQ,MAAM,EAAE,CAAA;AAC1D,EAAA,OAAO,IAAI,eAAe,CAAA,CAAA,CAAA;AAC3B;AAQA,SAAS,YAAA,CAAa,MAAoB,QAAA,EAA0B;AACnE,EAAA,IAAK,IAAA,CAAa,mBAAA;AACjB,IAAA,OAAO,KAAK,QAAQ,CAAA,gBAAA,CAAA;AAErB,EAAA,IAAI,IAAA,CAAK,YAAY,IAAA,KAAS,kBAAA;AAC7B,IAAA,OAAO,KAAK,QAAQ,CAAA,YAAA,CAAA;AAErB,EAAA,IAAI,IAAA,CAAK,YAAY,IAAA,KAAS,mBAAA;AAC7B,IAAA,OAAO,KAAK,QAAQ,CAAA,aAAA,CAAA;AAErB,EAAA,IAAI,KAAK,SAAA,EAAW;AACnB,IAAA,MAAM,IAAA,GAAO,KAAK,SAAA,CAAU,IAAA;AAC5B,IAAA,MAAM,KAAK,IAAA,CAAK,SAAA,CAAU,GAAG,KAAA,CAAM,GAAG,EAAE,GAAA,EAAI;AAC5C,IAAA,OAAO,CAAA,EAAA,EAAK,QAAQ,CAAA,EAAA,EAAK,EAAE,KAAK,IAAI,CAAA,GAAA,CAAA;AAAA,EACrC;AAEA,EAAA,OAAO,CAAA,EAAA,EAAK,QAAQ,CAAA,CAAA,EAAI,IAAA,CAAK,YAAY,IAAI,CAAA,CAAA,CAAA;AAC9C;AAOA,SAAS,eAAA,CAAgB,IAAA,EAAoB,UAAA,EAAiC,KAAA,EAA0C;AACvH,EAAA,IAAI,KAAA,CAAM,IAAI,IAAI,CAAA;AACjB,IAAA,OAAO,KAAA,CAAM,IAAI,IAAI,CAAA;AAEtB,EAAA,IAAI,QAAA;AACJ,EAAA,IAAK,KAAa,mBAAA,EAAqB;AACtC,IAAA,QAAA,GAAW,eAAA;AAAA,EACZ,CAAA,MAAA,IACS,KAAK,SAAA,EAAW;AACxB,IAAA,QAAA,GAAW,KAAK,SAAA,CAAU,EAAA;AAAA,EAC3B,CAAA,MAAA,IACS,KAAK,EAAA,EAAI;AACjB,IAAA,QAAA,GAAW,MAAA,CAAO,KAAK,EAAE,CAAA;AAAA,EAC1B,CAAA,MACK;AACJ,IAAA,QAAA,GAAW,KAAK,WAAA,CAAY,IAAA;AAAA,EAC7B;AAGA,EAAA,MAAM,iBAAA,GAAoB,SAAS,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAA,CAAE,OAAA,CAAQ,OAAO,EAAE,CAAA;AACvE,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,GAAA,CAAI,iBAAiB,CAAA,IAAK,CAAA;AACnD,EAAA,MAAM,QAAA,GAAW,CAAA,EAAG,iBAAiB,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA;AAC9C,EAAA,UAAA,CAAW,GAAA,CAAI,iBAAA,EAAmB,KAAA,GAAQ,CAAC,CAAA;AAC3C,EAAA,KAAA,CAAM,GAAA,CAAI,MAAM,QAAQ,CAAA;AACxB,EAAA,OAAO,QAAA;AACR;AA+BO,SAAS,qBAAqB,IAAA,EAAoB;AACxD,EAAA,IAAI,CAAC,IAAA,CAAK,SAAA;AACT,IAAA,OAAO,2BAAA;AAER,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAkB;AACtC,EAAA,MAAM,KAAA,GAAwB,CAAC,IAAA,CAAK,SAAS,CAAA;AAC7C,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA0B;AAC5C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;AAE3C,EAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,SAAS,CAAA;AAC1B,EAAA,eAAA,CAAgB,IAAA,CAAK,SAAA,EAAW,UAAA,EAAY,KAAK,CAAA;AAEjD,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACxB,IAAA,MAAM,WAAA,GAAc,MAAM,KAAA,EAAM;AAChC,IAAA,MAAM,QAAA,GAAW,eAAA,CAAgB,WAAA,EAAa,UAAA,EAAY,KAAK,CAAA;AAE/D,IAAA,KAAA,CAAM,GAAA,CAAI,YAAA,CAAa,WAAA,EAAa,QAAQ,CAAC,CAAA;AAE7C,IAAA,IAAK,YAAoB,mBAAA,EAAqB;AAC7C,MAAA,MAAM,SAAA,GAAY,WAAA;AAClB,MAAA,KAAA,MAAW,YAAA,IAAgB,UAAU,UAAA,EAAY;AAChD,QAAA,MAAM,QAAA,GAAW,eAAA,CAAgB,YAAA,EAAc,UAAA,EAAY,KAAK,CAAA;AAChE,QAAA,KAAA,CAAM,GAAA,CAAI,CAAA,EAAA,EAAK,QAAQ,CAAA,KAAA,EAAQ,QAAQ,CAAA,CAAE,CAAA;AACzC,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,YAAY,CAAA,EAAG;AAC/B,UAAA,OAAA,CAAQ,IAAI,YAAY,CAAA;AACxB,UAAA,KAAA,CAAM,KAAK,YAAY,CAAA;AAAA,QACxB;AAAA,MACD;AAAA,IACD;AAEA,IAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,cAAc,KAAK,WAAA,CAAY,UAAA,CAAW,SAAQ,EAAG;AACxE,MAAA,KAAA,MAAW,iBAAiB,cAAA,EAAgB;AAC3C,QAAA,MAAM,QAAA,GAAW,eAAA,CAAgB,aAAA,EAAe,UAAA,EAAY,KAAK,CAAA;AACjE,QAAA,MAAM,KAAA,GAAQ,eAAe,MAAM,CAAA;AACnC,QAAA,MAAM,IAAA,GAAO,KAAA,GACV,CAAA,EAAA,EAAK,QAAQ,CAAA,IAAA,EAAO,KAAK,CAAA,KAAA,EAAQ,QAAQ,CAAA,CAAA,GACzC,CAAA,EAAA,EAAK,QAAQ,CAAA,KAAA,EAAQ,QAAQ,CAAA,CAAA;AAChC,QAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AAEd,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,aAAa,CAAA,EAAG;AAChC,UAAA,OAAA,CAAQ,IAAI,aAAa,CAAA;AACzB,UAAA,KAAA,CAAM,KAAK,aAAa,CAAA;AAAA,QACzB;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,EAAA,MAAM,YAAA,GAAe;AAAA,IACpB,UAAA;AAAA,IACA,GAAG,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAAA,IACnB,GAAG,KAAA,CAAM,IAAA,CAAK,KAAK;AAAA,GACpB;AAEA,EAAA,OAAO,YAAA,CAAa,KAAK,IAAI,CAAA;AAC9B;AAWO,SAAS,6BAA6B,SAAA,EAAsC;AAClF,EAAA,IAAI,aAAA,GAAgB,YAAA;AAGpB,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,MAAM,KAAA,GAAQ,CAAA,EAAG,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,MAAM,QAAQ,CAAC,CAAA,EAAA,EAAK,IAAA,CAAK,IAAI,CAAA,CAAA,CAAA;AAC9D,IAAA,aAAA,IAAiB,CAAA,IAAA,EAAO,IAAA,CAAK,EAAE,CAAA,EAAA,EAAK,KAAK,CAAA;AAAA,CAAA;AAAA,EAC1C;AAEA,EAAA,aAAA,IAAiB,IAAA;AAGjB,EAAA,KAAA,MAAW,IAAA,IAAQ,UAAU,KAAA,EAAO;AACnC,IAAA,IAAI,KAAK,MAAA,EAAQ;AAChB,MAAA,aAAA,IAAiB,CAAA,IAAA,EAAO,IAAA,CAAK,MAAM,CAAA,KAAA,EAAQ,MAAA,CAAO,KAAK,MAAM,CAAC,CAAA,EAAA,EAAK,IAAA,CAAK,MAAM;AAAA,CAAA;AAAA,IAC/E,CAAA,MACK;AACJ,MAAA,aAAA,IAAiB,CAAA,IAAA,EAAO,IAAA,CAAK,MAAM,CAAA,KAAA,EAAQ,KAAK,MAAM;AAAA,CAAA;AAAA,IACvD;AAAA,EACD;AAEA,EAAA,OAAO,aAAA;AACR","file":"chunk-VMH2LRM6.js","sourcesContent":["import type { WorkflowBlueprint } from '../builder/graph/types'\nimport type { AbstractNode, Flow } from '../workflow/index'\nimport { DEFAULT_ACTION, FILTER_FAILED } from '../types'\n\n/**\n * Converts a special action symbol to a user-friendly string for the graph label.\n * @param action The action symbol or string.\n * @returns A string label for the Mermaid edge.\n */\nfunction getActionLabel(action: string | symbol): string {\n\tif (action === DEFAULT_ACTION)\n\t\treturn ''\n\n\tif (action === FILTER_FAILED)\n\t\treturn '\"filter failed\"'\n\n\t// Sanitize labels to prevent breaking Mermaid syntax\n\tconst sanitizedAction = action.toString().replace(/\"/g, '')\n\treturn `\"${sanitizedAction}\"`\n}\n\n/**\n * Generates a descriptive label for a node to be used in the Mermaid graph.\n * @param node The node to generate a label for.\n * @param uniqueId The unique ID assigned to this node instance in the graph.\n * @returns A formatted string for the Mermaid node definition.\n */\nfunction getNodeLabel(node: AbstractNode, uniqueId: string): string {\n\tif ((node as any).isParallelContainer)\n\t\treturn `  ${uniqueId}{Parallel Block}`\n\n\tif (node.constructor.name === 'InputMappingNode')\n\t\treturn `  ${uniqueId}((\"Inputs\"))`\n\n\tif (node.constructor.name === 'OutputMappingNode')\n\t\treturn `  ${uniqueId}((\"Outputs\"))`\n\n\tif (node.graphData) {\n\t\tconst type = node.graphData.type\n\t\tconst id = node.graphData.id.split(':').pop()\n\t\treturn `  ${uniqueId}[\"${id} (${type})\"]`\n\t}\n\n\treturn `  ${uniqueId}[${node.constructor.name}]`\n}\n\n/**\n * Generates a unique, readable ID for a node instance.\n * @param node The node instance.\n * @returns A unique string ID.\n */\nfunction getUniqueNodeId(node: AbstractNode, nameCounts: Map<string, number>, idMap: Map<AbstractNode, string>): string {\n\tif (idMap.has(node))\n\t\treturn idMap.get(node)!\n\n\tlet baseName: string\n\tif ((node as any).isParallelContainer) {\n\t\tbaseName = 'ParallelBlock'\n\t}\n\telse if (node.graphData) {\n\t\tbaseName = node.graphData.id\n\t}\n\telse if (node.id) {\n\t\tbaseName = String(node.id)\n\t}\n\telse {\n\t\tbaseName = node.constructor.name\n\t}\n\n\t// Sanitize the name for Mermaid ID\n\tconst sanitizedBaseName = baseName.replace(/:/g, '_').replace(/\\W/g, '')\n\tconst count = nameCounts.get(sanitizedBaseName) || 0\n\tconst uniqueId = `${sanitizedBaseName}_${count}`\n\tnameCounts.set(sanitizedBaseName, count + 1)\n\tidMap.set(node, uniqueId)\n\treturn uniqueId\n}\n\n/**\n * Generates a Mermaid graph definition from a `Flow` instance.\n *\n * This utility traverses the workflow's node structure and outputs a string\n * that can be rendered by Mermaid.js to visualize the flow's logic,\n * including branching and cycles.\n *\n * @param flow The `Flow` instance to visualize.\n * @returns A string containing the Mermaid `graph TD` definition.\n *\n * @example\n * const startNode = new Node('start')\n * const processNode = new Node('process')\n * const endNode = new Node('end')\n *\n * startNode.next(processNode)\n * processNode.next(endNode)\n *\n * const myFlow = new Flow(startNode)\n * const mermaidSyntax = generateMermaidGraph(myFlow)\n * console.log(mermaidSyntax)\n * // Outputs:\n * // graph TD\n * //   Node_0[Node]\n * //   Node_1[Node]\n * //   Node_2[Node]\n * //   Node_0 --> Node_1\n * //   Node_1 --> Node_2\n */\nexport function generateMermaidGraph(flow: Flow): string {\n\tif (!flow.startNode)\n\t\treturn 'graph TD\\n  %% Empty Flow'\n\n\tconst nodes = new Set<string>()\n\tconst edges = new Set<string>()\n\tconst visited = new Set<AbstractNode>()\n\tconst queue: AbstractNode[] = [flow.startNode]\n\tconst idMap = new Map<AbstractNode, string>()\n\tconst nameCounts = new Map<string, number>()\n\n\tvisited.add(flow.startNode)\n\tgetUniqueNodeId(flow.startNode, nameCounts, idMap)\n\n\twhile (queue.length > 0) {\n\t\tconst currentNode = queue.shift()!\n\t\tconst sourceId = getUniqueNodeId(currentNode, nameCounts, idMap)\n\n\t\tnodes.add(getNodeLabel(currentNode, sourceId))\n\n\t\tif ((currentNode as any).isParallelContainer) {\n\t\t\tconst container = currentNode as any as { nodesToRun: AbstractNode[] }\n\t\t\tfor (const internalNode of container.nodesToRun) {\n\t\t\t\tconst targetId = getUniqueNodeId(internalNode, nameCounts, idMap)\n\t\t\t\tedges.add(`  ${sourceId} --> ${targetId}`)\n\t\t\t\tif (!visited.has(internalNode)) {\n\t\t\t\t\tvisited.add(internalNode)\n\t\t\t\t\tqueue.push(internalNode)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (const [action, successorNodes] of currentNode.successors.entries()) {\n\t\t\tfor (const successorNode of successorNodes) {\n\t\t\t\tconst targetId = getUniqueNodeId(successorNode, nameCounts, idMap)\n\t\t\t\tconst label = getActionLabel(action)\n\t\t\t\tconst edge = label\n\t\t\t\t\t? `  ${sourceId} -- ${label} --> ${targetId}`\n\t\t\t\t\t: `  ${sourceId} --> ${targetId}`\n\t\t\t\tedges.add(edge)\n\n\t\t\t\tif (!visited.has(successorNode)) {\n\t\t\t\t\tvisited.add(successorNode)\n\t\t\t\t\tqueue.push(successorNode)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tconst mermaidLines = [\n\t\t'graph TD',\n\t\t...Array.from(nodes),\n\t\t...Array.from(edges),\n\t]\n\n\treturn mermaidLines.join('\\n')\n}\n\n/**\n * Generates a Mermaid graph definition from a static `WorkflowBlueprint`.\n *\n * This utility iterates over the blueprint's nodes and edges to output a string\n * that can be rendered by Mermaid.js to visualize the entire workflow structure.\n *\n * @param blueprint The `WorkflowBlueprint` instance to visualize.\n * @returns A string containing the Mermaid `graph TD` definition.\n */\nexport function generateMermaidFromBlueprint(blueprint: WorkflowBlueprint): string {\n\tlet mermaidString = 'graph TD\\n'\n\n\t// Define nodes, quoting the ID to handle special characters and adding the type as a label\n\tfor (const node of blueprint.nodes) {\n\t\tconst label = `${node.id.replace(/\"/g, '#quot;')} (${node.type})`\n\t\tmermaidString += `    ${node.id}[\"${label}\"]\\n`\n\t}\n\n\tmermaidString += '\\n'\n\n\t// Define edges, adding the action as a label if it exists\n\tfor (const edge of blueprint.edges) {\n\t\tif (edge.action) {\n\t\t\tmermaidString += `    ${edge.source} -->|${String(edge.action)}| ${edge.target}\\n`\n\t\t}\n\t\telse {\n\t\t\tmermaidString += `    ${edge.source} --> ${edge.target}\\n`\n\t\t}\n\t}\n\n\treturn mermaidString\n}\n"]}

package/dist/chunk-VZDHIOCH.js

@@ -1,76 +0,0 @@
-import { DEFAULT_ACTION } from './chunk-AOHBHYF6.js';
-
-// src/workflow/AbstractNode.ts
-var AbstractNode = class {
-  /** A unique identifier for this node instance, often set by the GraphBuilder. */
-  id;
-  /** A key-value store for static parameters that configure the node's behavior. */
-  params = {};
-  /** A map of successor nodes, keyed by the action that triggers the transition. */
-  successors = /* @__PURE__ */ new Map();
-  /** The original graph definition for this node, if created by a GraphBuilder. */
-  graphData;
-  /** A flag indicating that this node is a container and should be passed through by distributed executors. */
-  isPassthrough = false;
-  /**
-   * Gets the original, un-prefixed ID of the node from its graph definition.
-   * This is useful for sub-workflow nodes where the runtime ID might be namespaced (e.g., 'parent:child').
-   */
-  get originalId() {
-    return this.graphData?.data?.originalId ?? this.id?.toString() ?? "";
-  }
-  /**
-   * Sets a unique identifier for this node instance.
-   * Primarily used by the GraphBuilder for wiring and debugging.
-   * @param id The unique ID for the node.
-   * @returns The node instance for chaining.
-   */
-  withId(id) {
-    this.id = id;
-    return this;
-  }
-  /**
-   * Attaches the original graph definition data to the node instance.
-   * @internal
-   * @param data The graph node definition.
-   * @returns The node instance for chaining.
-   */
-  withGraphData(data) {
-    this.graphData = data;
-    return this;
-  }
-  /**
-   * Sets or merges static parameters for the node. These parameters are available
-   * via `args.params` in the node's lifecycle methods.
-   * @param params The parameters to merge into the node's existing parameters.
-   * @returns The node instance for chaining.
-   */
-  withParams(params) {
-    this.params = { ...this.params, ...params };
-    return this;
-  }
-  /**
-   * Defines the next node in the sequence for a given action.
-   * This is the primary method for constructing a workflow graph.
-   *
-   * @param node The successor node or nodes to execute next.
-   * @param action The action from this node's `post` method that triggers
-   * the transition. Defaults to `DEFAULT_ACTION` for linear flows.
-   * @returns The successor node instance, allowing for further chaining. If multiple nodes are provided, it returns the first one.
-   */
-  next(node, action = DEFAULT_ACTION) {
-    const existing = this.successors.get(action) ?? [];
-    const newSuccessors = Array.isArray(node) ? node : [node];
-    for (const successor of newSuccessors) {
-      if (!existing.includes(successor)) {
-        existing.push(successor);
-      }
-    }
-    this.successors.set(action, existing);
-    return Array.isArray(node) ? node[0] : node;
-  }
-};
-
-export { AbstractNode };
-//# sourceMappingURL=chunk-VZDHIOCH.js.map
-//# sourceMappingURL=chunk-VZDHIOCH.js.map

package/dist/chunk-VZDHIOCH.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/workflow/AbstractNode.ts"],"names":[],"mappings":";;;AAYO,IAAe,eAAf,MAIL;AAAA;AAAA,EAEM,EAAA;AAAA;AAAA,EAEA,SAAkB,EAAC;AAAA;AAAA,EAEnB,UAAA,uBAAiB,GAAA,EAA0G;AAAA;AAAA,EAE3H,SAAA;AAAA;AAAA,EAEA,aAAA,GAAgB,KAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMvB,IAAW,UAAA,GAAqB;AAI/B,IAAA,OAAO,KAAK,SAAA,EAAW,IAAA,EAAM,cAAc,IAAA,CAAK,EAAA,EAAI,UAAS,IAAK,EAAA;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,EAAA,EAA2B;AACjC,IAAA,IAAA,CAAK,EAAA,GAAK,EAAA;AACV,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc,IAAA,EAAuB;AACpC,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,WAAW,MAAA,EAAgC;AAC1C,IAAA,IAAA,CAAK,SAAS,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,GAAG,MAAA,EAAO;AAC1C,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,IAAA,CACC,IAAA,EACA,MAAA,GAA2E,cAAA,EAChE;AACX,IAAA,MAAM,WAAW,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,KAAK,EAAC;AACjD,IAAA,MAAM,gBAAgB,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,CAAC,IAAI,CAAA;AAExD,IAAA,KAAA,MAAW,aAAa,aAAA,EAAe;AACtC,MAAA,IAAI,CAAC,QAAA,CAAS,QAAA,CAAS,SAAS,CAAA,EAAG;AAClC,QAAA,QAAA,CAAS,KAAK,SAAS,CAAA;AAAA,MACxB;AAAA,IACD;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAA,EAAQ,QAAQ,CAAA;AACpC,IAAA,OAAO,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,CAAK,CAAC,CAAA,GAAI,IAAA;AAAA,EACxC;AAQD","file":"chunk-VZDHIOCH.js","sourcesContent":["import type { GraphNode } from '../builder/graph/types'\nimport type { Context } from '../context'\nimport type { FILTER_FAILED, NodeRunContext, Params } from '../types'\nimport { DEFAULT_ACTION } from '../types'\n\n/**\n * The abstract base class for all executable units in a workflow.\n * It provides the core structure for connecting nodes into a graph.\n *\n * @template TPostRes The type for the action returned by the node's `post` method.\n * @template TParams The type for the node's static parameters.\n */\nexport abstract class AbstractNode<\n\tTPostRes = any,\n\tTParams extends Params = Params,\n\tTContext extends Context = Context,\n> {\n\t/** A unique identifier for this node instance, often set by the GraphBuilder. */\n\tpublic id?: number | string\n\t/** A key-value store for static parameters that configure the node's behavior. */\n\tpublic params: TParams = {} as TParams\n\t/** A map of successor nodes, keyed by the action that triggers the transition. */\n\tpublic successors = new Map<TPostRes | string | typeof DEFAULT_ACTION | typeof FILTER_FAILED, AbstractNode<any, any, TContext>[]>()\n\t/** The original graph definition for this node, if created by a GraphBuilder. */\n\tpublic graphData?: GraphNode\n\t/** A flag indicating that this node is a container and should be passed through by distributed executors. */\n\tpublic isPassthrough = false\n\n\t/**\n\t * Gets the original, un-prefixed ID of the node from its graph definition.\n\t * This is useful for sub-workflow nodes where the runtime ID might be namespaced (e.g., 'parent:child').\n\t */\n\tpublic get originalId(): string {\n\t\t// 1. Prefer the logical `originalId` injected by the GraphBuilder.\n\t\t// 2. Fall back to the primary runtime `id` property on the node instance.\n\t\t// 3. An uninitialized node with no id.\n\t\treturn this.graphData?.data?.originalId ?? this.id?.toString() ?? ''\n\t}\n\n\t/**\n\t * Sets a unique identifier for this node instance.\n\t * Primarily used by the GraphBuilder for wiring and debugging.\n\t * @param id The unique ID for the node.\n\t * @returns The node instance for chaining.\n\t */\n\twithId(id: number | string): this {\n\t\tthis.id = id\n\t\treturn this\n\t}\n\n\t/**\n\t * Attaches the original graph definition data to the node instance.\n\t * @internal\n\t * @param data The graph node definition.\n\t * @returns The node instance for chaining.\n\t */\n\twithGraphData(data: GraphNode): this {\n\t\tthis.graphData = data\n\t\treturn this\n\t}\n\n\t/**\n\t * Sets or merges static parameters for the node. These parameters are available\n\t * via `args.params` in the node's lifecycle methods.\n\t * @param params The parameters to merge into the node's existing parameters.\n\t * @returns The node instance for chaining.\n\t */\n\twithParams(params: Partial<TParams>): this {\n\t\tthis.params = { ...this.params, ...params }\n\t\treturn this\n\t}\n\n\t/**\n\t * Defines the next node in the sequence for a given action.\n\t * This is the primary method for constructing a workflow graph.\n\t *\n\t * @param node The successor node or nodes to execute next.\n\t * @param action The action from this node's `post` method that triggers\n\t * the transition. Defaults to `DEFAULT_ACTION` for linear flows.\n\t * @returns The successor node instance, allowing for further chaining. If multiple nodes are provided, it returns the first one.\n\t */\n\tnext<NextNode extends AbstractNode<any, any>>(\n\t\tnode: NextNode | NextNode[],\n\t\taction: TPostRes | string | typeof DEFAULT_ACTION | typeof FILTER_FAILED = DEFAULT_ACTION as any,\n\t): NextNode {\n\t\tconst existing = this.successors.get(action) ?? []\n\t\tconst newSuccessors = Array.isArray(node) ? node : [node]\n\n\t\tfor (const successor of newSuccessors) {\n\t\t\tif (!existing.includes(successor)) {\n\t\t\t\texisting.push(successor)\n\t\t\t}\n\t\t}\n\n\t\tthis.successors.set(action, existing)\n\t\treturn Array.isArray(node) ? node[0] : node\n\t}\n\n\t/**\n\t * The internal method that executes the node's full lifecycle.\n\t * It is called by an `IExecutor`.\n\t * @internal\n\t */\n\tabstract _run(ctx: NodeRunContext<TContext>): Promise<TPostRes>\n}\n"]}