@hazeljs/flow 0.2.0-beta.75

package/LICENSE

@@ -0,0 +1,192 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   Copyright 2024 HazelJS Team
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+
+---
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+   Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+   stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+   that You distribute, all copyright, patent, trademark, and
+   attribution notices from the Source form of the Work,
+   excluding those notices that do not pertain to any part of
+   the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+   distribution, then any Derivative Works that You distribute must
+   include a readable copy of the attribution notices contained
+   within such NOTICE file, excluding those notices that do not
+   pertain to any part of the Derivative Works, in at least one
+   of the following places: within a NOTICE text file distributed
+   as part of the Derivative Works; within the Source form or
+   documentation, if provided along with the Derivative Works; or,
+   within a display generated by the Derivative Works, if and
+   wherever such third-party notices normally appear. The contents
+   of the NOTICE file are for informational purposes only and
+   do not modify the License. You may add Your own attribution
+   notices within Derivative Works that You distribute, alongside
+   or as an addendum to the NOTICE text from the Work, provided
+   that such additional attribution notices cannot be construed
+   as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

package/README.md

@@ -0,0 +1,111 @@
+# @hazeljs/flow
+
+[![npm version](https://img.shields.io/npm/v/@hazeljs/flow.svg)](https://www.npmjs.com/package/@hazeljs/flow)
+[![npm downloads](https://img.shields.io/npm/dm/@hazeljs/flow)](https://www.npmjs.com/package/@hazeljs/flow)
+[![License: Apache-2.0](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](https://www.apache.org/licenses/LICENSE-2.0)
+
+Durable execution graph engine ("workflow OS kernel"). Fully independent of Hazel core.
+
+**Storage:** By default the engine uses **in-memory storage** (no database). For durable persistence, install `@prisma/client` and use the Prisma storage adapter (see [Persistence](#persistence)).
+
+## Features
+
+- Flow definitions (nodes + edges)
+- Flow runs with stateful execution
+- **In-memory by default**; optional Postgres persistence via Prisma
+- Audit event timeline
+- Retry/backoff, timeouts
+- Idempotency keys
+- WAIT state + resume
+- Optional Postgres advisory locks when using Prisma storage
+
+## Installation
+
+```bash
+pnpm add @hazeljs/flow
+```
+
+No database or env vars are required for the default in-memory mode.
+
+## Usage
+
+### Decorator-based (recommended)
+
+```typescript
+import { FlowEngine, Flow, Entry, Node, Edge, buildFlowDefinition } from '@hazeljs/flow';
+import type { FlowContext, NodeResult } from '@hazeljs/flow';
+
+@Flow('my-flow', '1.0.0')
+class MyFlow {
+  @Entry()
+  @Node('start')
+  @Edge('end')
+  async start(): Promise<NodeResult> {
+    return { status: 'ok', output: 1 };
+  }
+
+  @Node('end')
+  async end(ctx: FlowContext): Promise<NodeResult> {
+    return { status: 'ok', output: ctx.outputs.start };
+  }
+}
+
+const engine = new FlowEngine();
+const def = buildFlowDefinition(MyFlow);
+await engine.registerDefinition(def);
+
+const { runId } = await engine.startRun({
+  flowId: 'my-flow',
+  version: '1.0.0',
+  input: {},
+});
+
+let run = await engine.getRun(runId);
+while (run?.status === 'RUNNING') {
+  run = await engine.tick(runId);
+}
+```
+
+### Functional builder (alternative)
+
+```typescript
+import { FlowEngine, flow } from '@hazeljs/flow';
+
+const def = flow('my-flow', '1.0.0')
+  .entry('start')
+  .node('start', async (ctx) => ({ status: 'ok', output: 1 }))
+  .node('end', async (ctx) => ({ status: 'ok', output: ctx.outputs.start }))
+  .edge('start', 'end')
+  .build();
+```
+
+## Persistence
+
+By default the engine uses in-memory storage. To persist runs and definitions to Postgres:
+
+1. Install Prisma client: `pnpm add @prisma/client`
+2. Set `DATABASE_URL` and run migrations (from this package’s `prisma/` schema).
+3. Create the engine with Prisma storage:
+
+```typescript
+import { FlowEngine, buildFlowDefinition } from '@hazeljs/flow';
+import { createPrismaStorage, createFlowPrismaClient } from '@hazeljs/flow/prisma';
+
+const prisma = createFlowPrismaClient();
+const engine = new FlowEngine({ storage: createPrismaStorage(prisma) });
+// ... register definitions, start runs, etc.
+```
+
+The migration SQL in `prisma/migrations/` is only needed when you use this adapter.
+
+## Scripts
+
+- `prisma:generate` - Generate Prisma client
+- `prisma:migrate` - Run migrations (dev)
+- `prisma:deploy` - Deploy migrations (prod)
+- `prisma:studio` - Open Prisma Studio
+- `test` - Run Vitest tests
+
+## License
+
+Apache 2.0 © [HazelJS](https://hazeljs.com)

package/dist/decorators/flow.decorators.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Decorator-based flow definitions
+ */
+import 'reflect-metadata';
+import type { FlowDefinition, FlowContext, RetryPolicy } from '../types/FlowTypes.js';
+export interface NodeDecoratorOptions {
+    name?: string;
+    retry?: RetryPolicy;
+    timeoutMs?: number;
+    idempotencyKey?: (ctx: FlowContext) => string;
+}
+/**
+ * Mark a class as a flow definition
+ */
+export declare function Flow(flowId: string, version: string): ClassDecorator;
+/**
+ * Mark a node as the entry point
+ */
+export declare function Entry(): MethodDecorator;
+/**
+ * Mark a method as a flow node. Method name is used as nodeId if not provided.
+ */
+export declare function Node(nodeIdOrOptions?: string | NodeDecoratorOptions, options?: NodeDecoratorOptions): MethodDecorator;
+/**
+ * Add an edge from this node to another. Stack multiple for branching.
+ */
+export declare function Edge(to: string, when?: (ctx: FlowContext) => boolean, priority?: number): MethodDecorator;
+/**
+ * Build a FlowDefinition from a decorated flow class
+ */
+export declare function buildFlowDefinition(FlowClass: new () => object): FlowDefinition;
+//# sourceMappingURL=flow.decorators.d.ts.map

package/dist/decorators/flow.decorators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow.decorators.d.ts","sourceRoot":"","sources":["../../src/decorators/flow.decorators.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,kBAAkB,CAAC;AAC1B,OAAO,KAAK,EACV,cAAc,EAGd,WAAW,EAEX,WAAW,EACZ,MAAM,uBAAuB,CAAC;AAO/B,MAAM,WAAW,oBAAoB;IACnC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,cAAc,CAAC,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,MAAM,CAAC;CAC/C;AAED;;GAEG;AACH,wBAAgB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,cAAc,CAIpE;AAED;;GAEG;AACH,wBAAgB,KAAK,IAAI,eAAe,CAIvC;AAED;;GAEG;AACH,wBAAgB,IAAI,CAClB,eAAe,CAAC,EAAE,MAAM,GAAG,oBAAoB,EAC/C,OAAO,CAAC,EAAE,oBAAoB,GAC7B,eAAe,CAQjB;AAED;;GAEG;AACH,wBAAgB,IAAI,CAClB,EAAE,EAAE,MAAM,EACV,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,OAAO,EACpC,QAAQ,CAAC,EAAE,MAAM,GAChB,eAAe,CAQjB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,UAAU,MAAM,GAAG,cAAc,CAuD/E"}

package/dist/decorators/flow.decorators.js

@@ -0,0 +1,100 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Flow = Flow;
+exports.Entry = Entry;
+exports.Node = Node;
+exports.Edge = Edge;
+exports.buildFlowDefinition = buildFlowDefinition;
+/**
+ * Decorator-based flow definitions
+ */
+require("reflect-metadata");
+const FLOW_METADATA_KEY = 'flow:definition';
+const NODE_METADATA_KEY = 'flow:nodes';
+const EDGE_METADATA_KEY = 'flow:edges';
+const ENTRY_METADATA_KEY = 'flow:entry';
+/**
+ * Mark a class as a flow definition
+ */
+function Flow(flowId, version) {
+    return (target) => {
+        Reflect.defineMetadata(FLOW_METADATA_KEY, { flowId, version }, target);
+    };
+}
+/**
+ * Mark a node as the entry point
+ */
+function Entry() {
+    return (target, propertyKey) => {
+        Reflect.defineMetadata(ENTRY_METADATA_KEY, true, target, propertyKey);
+    };
+}
+/**
+ * Mark a method as a flow node. Method name is used as nodeId if not provided.
+ */
+function Node(nodeIdOrOptions, options) {
+    const nodeId = typeof nodeIdOrOptions === 'string' ? nodeIdOrOptions : undefined;
+    const opts = (typeof nodeIdOrOptions === 'object' ? nodeIdOrOptions : options) ?? {};
+    return (target, propertyKey, descriptor) => {
+        const id = nodeId ?? (typeof propertyKey === 'string' ? propertyKey : String(propertyKey));
+        Reflect.defineMetadata(NODE_METADATA_KEY, { id, options: opts }, target, propertyKey);
+        return descriptor;
+    };
+}
+/**
+ * Add an edge from this node to another. Stack multiple for branching.
+ */
+function Edge(to, when, priority) {
+    return (target, propertyKey) => {
+        const from = typeof propertyKey === 'string' ? propertyKey : String(propertyKey);
+        const edges = Reflect.getMetadata(EDGE_METADATA_KEY, target, propertyKey) ?? [];
+        edges.push({ from, to, when, priority: priority ?? 0 });
+        Reflect.defineMetadata(EDGE_METADATA_KEY, edges, target, propertyKey);
+    };
+}
+/**
+ * Build a FlowDefinition from a decorated flow class
+ */
+function buildFlowDefinition(FlowClass) {
+    const flowMeta = Reflect.getMetadata(FLOW_METADATA_KEY, FlowClass);
+    if (!flowMeta) {
+        throw new Error(`Class ${FlowClass.name} is not decorated with @Flow(flowId, version)`);
+    }
+    const { flowId, version } = flowMeta;
+    const prototype = FlowClass.prototype;
+    const nodes = {};
+    const edges = [];
+    let entryNodeId = null;
+    const methodNames = Object.getOwnPropertyNames(prototype).filter((k) => k !== 'constructor' && typeof prototype[k] === 'function');
+    const instance = new FlowClass();
+    for (const methodName of methodNames) {
+        const nodeMeta = Reflect.getMetadata(NODE_METADATA_KEY, prototype, methodName);
+        if (!nodeMeta)
+            continue;
+        const { id: nodeId, options } = nodeMeta;
+        const handler = prototype[methodName].bind(instance);
+        nodes[nodeId] = {
+            id: nodeId,
+            name: options?.name,
+            handler: handler,
+            retry: options?.retry,
+            timeoutMs: options?.timeoutMs,
+            idempotencyKey: options?.idempotencyKey,
+        };
+        if (Reflect.getMetadata(ENTRY_METADATA_KEY, prototype, methodName)) {
+            entryNodeId = nodeId;
+        }
+        const nodeEdges = Reflect.getMetadata(EDGE_METADATA_KEY, prototype, methodName) ?? [];
+        edges.push(...nodeEdges);
+    }
+    if (!entryNodeId) {
+        throw new Error(`Flow ${flowId}@${version} must have exactly one @Entry() node`);
+    }
+    return {
+        flowId,
+        version,
+        entry: entryNodeId,
+        nodes,
+        edges,
+    };
+}

package/dist/dsl/flow.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Fluent DSL builder for flow definitions
+ */
+import type { FlowDefinition, FlowContext, NodeResult, RetryPolicy } from '../types/FlowTypes.js';
+type NodeId = string;
+interface FlowBuilder {
+    entry(nodeId: NodeId): FlowBuilder;
+    node(nodeId: NodeId, handler: (ctx: FlowContext) => Promise<NodeResult>, options?: {
+        name?: string;
+        retry?: RetryPolicy;
+        timeoutMs?: number;
+        idempotencyKey?: (ctx: FlowContext) => string;
+    }): FlowBuilder;
+    edge(from: NodeId, to: NodeId, when?: (ctx: FlowContext) => boolean, priority?: number): FlowBuilder;
+    build(): FlowDefinition;
+}
+export declare function flow(flowId: string, version: string): FlowBuilder;
+export {};
+//# sourceMappingURL=flow.d.ts.map

package/dist/dsl/flow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow.d.ts","sourceRoot":"","sources":["../../src/dsl/flow.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EACV,cAAc,EAGd,WAAW,EACX,UAAU,EACV,WAAW,EACZ,MAAM,uBAAuB,CAAC;AAE/B,KAAK,MAAM,GAAG,MAAM,CAAC;AAErB,UAAU,WAAW;IACnB,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC;IACnC,IAAI,CACF,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,OAAO,CAAC,UAAU,CAAC,EAClD,OAAO,CAAC,EAAE;QACR,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,KAAK,CAAC,EAAE,WAAW,CAAC;QACpB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,cAAc,CAAC,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,MAAM,CAAC;KAC/C,GACA,WAAW,CAAC;IACf,IAAI,CACF,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,OAAO,EACpC,QAAQ,CAAC,EAAE,MAAM,GAChB,WAAW,CAAC;IACf,KAAK,IAAI,cAAc,CAAC;CACzB;AAED,wBAAgB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,WAAW,CA4DjE"}

package/dist/dsl/flow.js

@@ -0,0 +1,46 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.flow = flow;
+function flow(flowId, version) {
+    const nodes = {};
+    const edges = [];
+    let entryNodeId = null;
+    return {
+        entry(nodeId) {
+            entryNodeId = nodeId;
+            return this;
+        },
+        node(nodeId, handler, options) {
+            nodes[nodeId] = {
+                id: nodeId,
+                name: options?.name,
+                handler,
+                retry: options?.retry,
+                timeoutMs: options?.timeoutMs,
+                idempotencyKey: options?.idempotencyKey,
+            };
+            return this;
+        },
+        edge(from, to, when, priority) {
+            edges.push({
+                from,
+                to,
+                when,
+                priority: priority ?? 0,
+            });
+            return this;
+        },
+        build() {
+            if (!entryNodeId) {
+                throw new Error('Flow must have an entry node. Call .entry(nodeId) first.');
+            }
+            return {
+                flowId,
+                version,
+                entry: entryNodeId,
+                nodes,
+                edges,
+            };
+        },
+    };
+}

package/dist/dsl/types.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Re-export DSL-related types
+ */
+export type { FlowDefinition, NodeDefinition, EdgeDefinition, FlowContext, NodeResult, RetryPolicy, } from '../types/FlowTypes.js';
+//# sourceMappingURL=types.d.ts.map

package/dist/dsl/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/dsl/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,YAAY,EACV,cAAc,EACd,cAAc,EACd,cAAc,EACd,WAAW,EACX,UAAU,EACV,WAAW,GACZ,MAAM,uBAAuB,CAAC"}

package/dist/dsl/types.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/engine/Executor.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Executes a single node within a flow run
+ */
+import type { FlowContext, NodeDefinition, NodeResult } from '../types/FlowTypes.js';
+import type { IFlowEventRepo, IIdempotencyRepo } from '../persistence/storage.js';
+export declare function executeNode(node: NodeDefinition, ctx: FlowContext, eventRepo: IFlowEventRepo, idempotencyRepo: IIdempotencyRepo): Promise<{
+    result: NodeResult;
+    cached: boolean;
+}>;
+export declare function applyPatch(state: Record<string, unknown>, patch?: Record<string, unknown>): Record<string, unknown>;
+//# sourceMappingURL=Executor.d.ts.map

package/dist/engine/Executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Executor.d.ts","sourceRoot":"","sources":["../../src/engine/Executor.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACrF,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAQlF,wBAAsB,WAAW,CAC/B,IAAI,EAAE,cAAc,EACpB,GAAG,EAAE,WAAW,EAChB,SAAS,EAAE,cAAc,EACzB,eAAe,EAAE,gBAAgB,GAChC,OAAO,CAAC;IAAE,MAAM,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,CAAC,CAkHlD;AAED,wBAAgB,UAAU,CACxB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC9B,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAGzB"}

package/dist/engine/Executor.js

@@ -0,0 +1,113 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.executeNode = executeNode;
+exports.applyPatch = applyPatch;
+const Idempotency_js_1 = require("./Idempotency.js");
+const Timeout_js_1 = require("./Timeout.js");
+const Retry_js_1 = require("./Retry.js");
+const utils_js_1 = require("./utils.js");
+const RETRYABLE_ERROR_CODES = new Set(['TIMEOUT', 'NETWORK_ERROR', 'RATE_LIMIT']);
+async function executeNode(node, ctx, eventRepo, idempotencyRepo) {
+    const attempt = (ctx.meta.attempts[node.id] ?? 0) + 1;
+    ctx.meta.attempts[node.id] = attempt;
+    await eventRepo.append(ctx.runId, 'NODE_STARTED', { nodeId: node.id, attempt });
+    // Idempotency check
+    if (node.idempotencyKey) {
+        const key = node.idempotencyKey(ctx);
+        const cached = await (0, Idempotency_js_1.checkIdempotency)(idempotencyRepo, key);
+        if (cached) {
+            await eventRepo.append(ctx.runId, 'NODE_FINISHED', {
+                nodeId: node.id,
+                attempt,
+                cached: true,
+            });
+            return {
+                result: {
+                    status: 'ok',
+                    output: cached.output,
+                    patch: cached.patch,
+                },
+                cached: true,
+            };
+        }
+    }
+    let lastError = null;
+    const maxAttempts = node.retry?.maxAttempts ?? 1;
+    for (let a = 0; a < maxAttempts; a++) {
+        try {
+            let handlerPromise = node.handler(ctx);
+            if (node.timeoutMs) {
+                handlerPromise = (0, Timeout_js_1.withTimeout)(handlerPromise, node.timeoutMs, node.id);
+            }
+            const result = await handlerPromise;
+            if (result.status === 'ok') {
+                if (node.idempotencyKey) {
+                    const key = node.idempotencyKey(ctx);
+                    await (0, Idempotency_js_1.storeIdempotency)(idempotencyRepo, key, ctx.runId, node.id, result.output, result.patch);
+                }
+                await eventRepo.append(ctx.runId, 'NODE_FINISHED', {
+                    nodeId: node.id,
+                    attempt: a + 1,
+                    cached: false,
+                });
+                return { result, cached: false };
+            }
+            if (result.status === 'wait') {
+                await eventRepo.append(ctx.runId, 'NODE_FINISHED', {
+                    nodeId: node.id,
+                    attempt: a + 1,
+                    cached: false,
+                });
+                return { result, cached: false };
+            }
+            // result.status === 'error'
+            lastError = result.error;
+            await eventRepo.append(ctx.runId, 'NODE_FAILED', {
+                nodeId: node.id,
+                attempt: a + 1,
+                error: result.error,
+            });
+            const retryable = result.error.retryable ?? RETRYABLE_ERROR_CODES.has(result.error.code);
+            if (!retryable || a === maxAttempts - 1) {
+                return { result, cached: false };
+            }
+            const delayMs = node.retry ? (0, Retry_js_1.getRetryDelayMs)(a, node.retry) : -1;
+            if (delayMs > 0) {
+                await (0, Retry_js_1.delay)(delayMs);
+            }
+        }
+        catch (err) {
+            const message = err instanceof Error ? err.message : String(err);
+            const code = err instanceof Error && 'code' in err ? String(err.code) : 'UNKNOWN';
+            lastError = { code, message, retryable: code === 'TIMEOUT' };
+            await eventRepo.append(ctx.runId, 'NODE_FAILED', {
+                nodeId: node.id,
+                attempt: a + 1,
+                error: lastError,
+            });
+            if (code === 'TIMEOUT' && node.retry && a < maxAttempts - 1) {
+                const delayMs = (0, Retry_js_1.getRetryDelayMs)(a, node.retry);
+                if (delayMs > 0)
+                    await (0, Retry_js_1.delay)(delayMs);
+            }
+            else {
+                return {
+                    result: { status: 'error', error: lastError },
+                    cached: false,
+                };
+            }
+        }
+    }
+    return {
+        result: {
+            status: 'error',
+            error: lastError ?? { code: 'UNKNOWN', message: 'Max retries exceeded' },
+        },
+        cached: false,
+    };
+}
+function applyPatch(state, patch) {
+    if (!patch || Object.keys(patch).length === 0)
+        return state;
+    return (0, utils_js_1.deepMerge)(state, patch);
+}