ai-workflows 2.1.1 → 2.3.0

package/dist/every.js

@@ -8,6 +8,7 @@
  *   every('hour during business hours', $ => { ... })
  *   every('first Monday of the month at 9am', $ => { ... })
  */
+import { PLURAL_UNITS, isPluralUnitKey } from './types.js';
 /**
  * Registry of schedule handlers
  */
@@ -128,46 +129,64 @@ export async function toCron(description) {
         `Set up AI conversion with setCronConverter() for natural language schedules.`);
 }
 /**
- * Create the `every` proxy
+ * Create a typed EveryProxy with proper TypeScript generics
+ *
+ * This factory function creates a callable proxy that supports:
+ *   - Direct calls: every('natural language', handler)
+ *   - Simple patterns: every.hour(handler)
+ *   - Day + time: every.Monday.at9am(handler)
+ *   - Intervals: every.minutes(30)(handler)
+ *
+ * @param registerCallback - Function called when a handler is registered
+ * @returns A properly typed EveryProxy
+ *
+ * @example
+ * ```ts
+ * // Create proxy with custom registration
+ * const myEvery = createTypedEveryProxy((interval, handler) => {
+ *   myRegistry.push({ interval, handler })
+ * })
+ *
+ * myEvery.hour(handler) // Properly typed!
+ * myEvery.Monday.at9am(handler) // Chained access typed!
+ * ```
  */
-function createEveryProxy() {
-    const handler = {
-        get(_target, prop) {
+export function createTypedEveryProxy(registerCallback) {
+    // Create typed handler for day schedule patterns with time modifiers
+    const createDayScheduleHandler = (pattern, prop) => ({
+        get(_target, timeKey, _receiver) {
+            const time = TIME_PATTERNS[timeKey];
+            if (time) {
+                const cron = combineWithTime(pattern, time);
+                return (handlerFn) => {
+                    registerCallback({ type: 'cron', expression: cron, natural: `${prop}.${timeKey}` }, handlerFn);
+                };
+            }
+            return undefined;
+        },
+        apply(_target, _thisArg, args) {
+            registerCallback({ type: 'cron', expression: pattern, natural: prop }, args[0]);
+        }
+    });
+    // Create the main EveryProxy handler
+    const everyHandler = {
+        get(_target, prop, _receiver) {
             // Check if it's a known pattern
             const pattern = KNOWN_PATTERNS[prop];
             if (pattern) {
                 // Return an object that can either be called directly or have time accessors
                 const result = (handlerFn) => {
-                    registerScheduleHandler({ type: 'cron', expression: pattern, natural: prop }, handlerFn);
+                    registerCallback({ type: 'cron', expression: pattern, natural: prop }, handlerFn);
                 };
-                // Add time accessors
-                return new Proxy(result, {
-                    get(_t, timeKey) {
-                        const time = TIME_PATTERNS[timeKey];
-                        if (time) {
-                            const cron = combineWithTime(pattern, time);
-                            return (handlerFn) => {
-                                registerScheduleHandler({ type: 'cron', expression: cron, natural: `${prop}.${timeKey}` }, handlerFn);
-                            };
-                        }
-                        return undefined;
-                    },
-                    apply(_t, _thisArg, args) {
-                        registerScheduleHandler({ type: 'cron', expression: pattern, natural: prop }, args[0]);
-                    }
-                });
+                // Add time accessors with typed handler
+                return new Proxy(result, createDayScheduleHandler(pattern, prop));
             }
             // Check for plural time units (e.g., seconds(5), minutes(30))
-            const pluralUnits = {
-                seconds: 'second',
-                minutes: 'minute',
-                hours: 'hour',
-                days: 'day',
-                weeks: 'week',
-            };
-            if (pluralUnits[prop]) {
+            // Using type guard and typed constant for type-safe interval creation
+            if (isPluralUnitKey(prop)) {
+                const intervalType = PLURAL_UNITS[prop];
                 return (value) => (handlerFn) => {
-                    registerScheduleHandler({ type: pluralUnits[prop], value, natural: `${value} ${prop}` }, handlerFn);
+                    registerCallback({ type: intervalType, value, natural: `${value} ${prop}` }, handlerFn);
                 };
             }
             return undefined;
@@ -177,11 +196,23 @@ function createEveryProxy() {
             const [description, handler] = args;
             if (typeof description === 'string' && typeof handler === 'function') {
                 // Register with natural language - will be converted to cron at runtime
-                registerScheduleHandler({ type: 'natural', description }, handler);
+                registerCallback({ type: 'natural', description }, handler);
             }
         }
     };
-    return new Proxy(function () { }, handler);
+    // Create callable target with proper typing
+    // The function serves as the Proxy target - actual behavior is in the handler's apply trap
+    const target = function (_description, _handler) { };
+    return new Proxy(target, everyHandler);
+}
+/**
+ * Create the `every` proxy using the global schedule registry
+ *
+ * This is the default implementation that uses registerScheduleHandler
+ * for backward compatibility with the standalone `every` export.
+ */
+function createEveryProxy() {
+    return createTypedEveryProxy(registerScheduleHandler);
 }
 /**
  * The `every` function/object for registering scheduled handlers

package/dist/every.js.map

@@ -1 +1 @@
-{"version":3,"file":"every.js","sourceRoot":"","sources":["../src/every.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH;;GAEG;AACH,MAAM,gBAAgB,GAA2B,EAAE,CAAA;AAEnD;;GAEG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO,CAAC,GAAG,gBAAgB,CAAC,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB;IACnC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAA;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,QAA0B,EAC1B,OAAwB;IAExB,gBAAgB,CAAC,IAAI,CAAC;QACpB,QAAQ;QACR,OAAO;QACP,MAAM,EAAE,OAAO,CAAC,QAAQ,EAAE;KAC3B,CAAC,CAAA;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,cAAc,GAA2B;IAC7C,aAAa;IACb,QAAQ,EAAE,aAAa;IACvB,QAAQ,EAAE,WAAW;IACrB,MAAM,EAAE,WAAW;IACnB,KAAK,EAAE,WAAW;IAClB,MAAM,EAAE,WAAW;IACnB,OAAO,EAAE,WAAW;IACpB,MAAM,EAAE,WAAW;IAEnB,eAAe;IACf,QAAQ,EAAE,WAAW;IACrB,SAAS,EAAE,WAAW;IACtB,WAAW,EAAE,WAAW;IACxB,UAAU,EAAE,WAAW;IACvB,QAAQ,EAAE,WAAW;IACrB,UAAU,EAAE,WAAW;IACvB,QAAQ,EAAE,WAAW;IAErB,kBAAkB;IAClB,SAAS,EAAE,aAAa;IACxB,SAAS,EAAE,aAAa;IACxB,UAAU,EAAE,WAAW;IACvB,MAAM,EAAE,YAAY;CACrB,CAAA;AAED;;GAEG;AACH,MAAM,aAAa,GAAqD;IACtE,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,YAAY,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;CACrC,CAAA;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAe;IACxC,OAAO,cAAc,CAAC,OAAO,CAAC,IAAI,IAAI,CAAA;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,QAAgB,EAAE,IAAsC;IAC/E,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACjC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC9B,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC;AAED;;GAEG;AACH,IAAI,aAAa,GAAsD,IAAI,CAAA;AAE3E;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAmD;IAClF,aAAa,GAAG,SAAS,CAAA;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,WAAmB;IAC9C,6BAA6B;IAC7B,MAAM,KAAK,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAA;IAC5C,IAAI,KAAK;QAAE,OAAO,KAAK,CAAA;IAEvB,qCAAqC;IACrC,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,aAAa,CAAC,WAAW,CAAC,CAAA;IACnC,CAAC;IAED,4DAA4D;IAC5D,IAAI,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;QAC1C,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,MAAM,IAAI,KAAK,CACb,8BAA8B,WAAW,KAAK;QAC9C,8EAA8E,CAC/E,CAAA;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB;IACvB,MAAM,OAAO,GAAG;QACd,GAAG,CAAC,OAAgB,EAAE,IAAY;YAChC,gCAAgC;YAChC,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;YACpC,IAAI,OAAO,EAAE,CAAC;gBACZ,6EAA6E;gBAC7E,MAAM,MAAM,GAAG,CAAC,SAA0B,EAAE,EAAE;oBAC5C,uBAAuB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS,CAAC,CAAA;gBAC1F,CAAC,CAAA;gBACD,qBAAqB;gBACrB,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;oBACvB,GAAG,CAAC,EAAE,EAAE,OAAe;wBACrB,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAA;wBACnC,IAAI,IAAI,EAAE,CAAC;4BACT,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;4BAC3C,OAAO,CAAC,SAA0B,EAAE,EAAE;gCACpC,uBAAuB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,IAAI,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,CAAA;4BACvG,CAAC,CAAA;wBACH,CAAC;wBACD,OAAO,SAAS,CAAA;oBAClB,CAAC;oBACD,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI;wBACtB,uBAAuB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;oBACxF,CAAC;iBACF,CAAC,CAAA;YACJ,CAAC;YAED,8DAA8D;YAC9D,MAAM,WAAW,GAA2B;gBAC1C,OAAO,EAAE,QAAQ;gBACjB,OAAO,EAAE,QAAQ;gBACjB,KAAK,EAAE,MAAM;gBACb,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,MAAM;aACd,CAAA;YACD,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,SAA0B,EAAE,EAAE;oBACvD,uBAAuB,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,CAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,KAAK,IAAI,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC,CAAA;gBAC5G,CAAC,CAAA;YACH,CAAC;YAED,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,KAAK,CAAC,OAAgB,EAAE,QAAiB,EAAE,IAAe;YACxD,2DAA2D;YAC3D,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAiC,CAAA;YAEhE,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;gBACrE,wEAAwE;gBACxE,uBAAuB,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,OAAO,CAAC,CAAA;YACpE,CAAC;QACH,CAAC;KACF,CAAA;IAED,OAAO,IAAI,KAAK,CAAC,cAAY,CAAQ,EAAE,OAAO,CAAC,CAAA;AACjD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,gBAAgB,EAAE,CAAA;AAEvC;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAA0B;IACrD,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,QAAQ;YACX,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAA;QACrC,KAAK,QAAQ;YACX,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAA;QAC1C,KAAK,MAAM;YACT,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAA;QAC/C,KAAK,KAAK;YACR,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAA;QACpD,KAAK,MAAM;YACT,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAA;QACxD,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS;YACZ,iDAAiD;YACjD,OAAO,CAAC,CAAA;IACZ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAA0B;IACvD,IAAI,SAAS,IAAI,QAAQ,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC9C,OAAO,QAAQ,CAAC,OAAO,CAAA;IACzB,CAAC;IAED,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,UAAU;gBACnC,CAAC,CAAC,cAAc,CAAA;QACpB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,UAAU;gBACnC,CAAC,CAAC,cAAc,CAAA;QACpB,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,QAAQ;gBACjC,CAAC,CAAC,YAAY,CAAA;QAClB,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,OAAO;gBAChC,CAAC,CAAC,WAAW,CAAA;QACjB,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,QAAQ;gBACjC,CAAC,CAAC,YAAY,CAAA;QAClB,KAAK,MAAM;YACT,OAAO,SAAS,QAAQ,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,SAAS;YACZ,OAAO,QAAQ,CAAC,WAAW,CAAA;IAC/B,CAAC;AACH,CAAC"}
+{"version":3,"file":"every.js","sourceRoot":"","sources":["../src/every.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAWH,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AAE1D;;GAEG;AACH,MAAM,gBAAgB,GAA2B,EAAE,CAAA;AAEnD;;GAEG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO,CAAC,GAAG,gBAAgB,CAAC,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB;IACnC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAA;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,QAA0B,EAC1B,OAAwB;IAExB,gBAAgB,CAAC,IAAI,CAAC;QACpB,QAAQ;QACR,OAAO;QACP,MAAM,EAAE,OAAO,CAAC,QAAQ,EAAE;KAC3B,CAAC,CAAA;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,cAAc,GAA2B;IAC7C,aAAa;IACb,QAAQ,EAAE,aAAa;IACvB,QAAQ,EAAE,WAAW;IACrB,MAAM,EAAE,WAAW;IACnB,KAAK,EAAE,WAAW;IAClB,MAAM,EAAE,WAAW;IACnB,OAAO,EAAE,WAAW;IACpB,MAAM,EAAE,WAAW;IAEnB,eAAe;IACf,QAAQ,EAAE,WAAW;IACrB,SAAS,EAAE,WAAW;IACtB,WAAW,EAAE,WAAW;IACxB,UAAU,EAAE,WAAW;IACvB,QAAQ,EAAE,WAAW;IACrB,UAAU,EAAE,WAAW;IACvB,QAAQ,EAAE,WAAW;IAErB,kBAAkB;IAClB,SAAS,EAAE,aAAa;IACxB,SAAS,EAAE,aAAa;IACxB,UAAU,EAAE,WAAW;IACvB,MAAM,EAAE,YAAY;CACrB,CAAA;AAED;;GAEG;AACH,MAAM,aAAa,GAAqD;IACtE,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAC/B,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IACjC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAChC,YAAY,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;CACrC,CAAA;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAe;IACxC,OAAO,cAAc,CAAC,OAAO,CAAC,IAAI,IAAI,CAAA;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,QAAgB,EAAE,IAAsC;IAC/E,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACjC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC9B,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC;AAED;;GAEG;AACH,IAAI,aAAa,GAAsD,IAAI,CAAA;AAE3E;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAmD;IAClF,aAAa,GAAG,SAAS,CAAA;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,WAAmB;IAC9C,6BAA6B;IAC7B,MAAM,KAAK,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAA;IAC5C,IAAI,KAAK;QAAE,OAAO,KAAK,CAAA;IAEvB,qCAAqC;IACrC,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,aAAa,CAAC,WAAW,CAAC,CAAA;IACnC,CAAC;IAED,4DAA4D;IAC5D,IAAI,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;QAC1C,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,MAAM,IAAI,KAAK,CACb,8BAA8B,WAAW,KAAK;QAC9C,8EAA8E,CAC/E,CAAA;AACH,CAAC;AAWD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,qBAAqB,CAAC,gBAAgD;IACpF,qEAAqE;IACrE,MAAM,wBAAwB,GAAG,CAC/B,OAAe,EACf,IAAY,EACa,EAAE,CAAC,CAAC;QAC7B,GAAG,CACD,OAA2C,EAC3C,OAAe,EACf,SAAkB;YAElB,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAA;YACnC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;gBAC3C,OAAO,CAAC,SAA0B,EAAE,EAAE;oBACpC,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,IAAI,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,CAAA;gBAChG,CAAC,CAAA;YACH,CAAC;YACD,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,KAAK,CACH,OAA2C,EAC3C,QAAiB,EACjB,IAAuB;YAEvB,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACjF,CAAC;KACF,CAAC,CAAA;IAEF,qCAAqC;IACrC,MAAM,YAAY,GAAsB;QACtC,GAAG,CACD,OAAyB,EACzB,IAAY,EACZ,SAAkB;YAElB,gCAAgC;YAChC,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;YACpC,IAAI,OAAO,EAAE,CAAC;gBACZ,6EAA6E;gBAC7E,MAAM,MAAM,GAAG,CAAC,SAA0B,EAAE,EAAE;oBAC5C,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS,CAAC,CAAA;gBACnF,CAAC,CAAA;gBACD,wCAAwC;gBACxC,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE,wBAAwB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAA;YACnE,CAAC;YAED,8DAA8D;YAC9D,sEAAsE;YACtE,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;gBACvC,OAAO,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,SAA0B,EAAE,EAAE;oBACvD,gBAAgB,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,KAAK,IAAI,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC,CAAA;gBACzF,CAAC,CAAA;YACH,CAAC;YAED,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,KAAK,CACH,OAAyB,EACzB,QAAiB,EACjB,IAA+B;YAE/B,2DAA2D;YAC3D,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAI,CAAA;YAEnC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;gBACrE,wEAAwE;gBACxE,gBAAgB,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,OAAO,CAAC,CAAA;YAC7D,CAAC;QACH,CAAC;KACF,CAAA;IAED,4CAA4C;IAC5C,2FAA2F;IAC3F,MAAM,MAAM,GAAqB,UAAS,YAAoB,EAAE,QAAyB,IAAG,CAAC,CAAA;IAC7F,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE,YAAY,CAAe,CAAA;AACtD,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB;IACvB,OAAO,qBAAqB,CAAC,uBAAuB,CAAC,CAAA;AACvD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,gBAAgB,EAAE,CAAA;AAEvC;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAA0B;IACrD,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,QAAQ;YACX,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAA;QACrC,KAAK,QAAQ;YACX,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAA;QAC1C,KAAK,MAAM;YACT,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAA;QAC/C,KAAK,KAAK;YACR,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAA;QACpD,KAAK,MAAM;YACT,OAAO,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAA;QACxD,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS;YACZ,iDAAiD;YACjD,OAAO,CAAC,CAAA;IACZ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAA0B;IACvD,IAAI,SAAS,IAAI,QAAQ,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC9C,OAAO,QAAQ,CAAC,OAAO,CAAA;IACzB,CAAC;IAED,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,UAAU;gBACnC,CAAC,CAAC,cAAc,CAAA;QACpB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,UAAU;gBACnC,CAAC,CAAC,cAAc,CAAA;QACpB,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,QAAQ;gBACjC,CAAC,CAAC,YAAY,CAAA;QAClB,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,OAAO;gBAChC,CAAC,CAAC,WAAW,CAAA;QACjB,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC;gBACzC,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,QAAQ;gBACjC,CAAC,CAAC,YAAY,CAAA;QAClB,KAAK,MAAM;YACT,OAAO,SAAS,QAAQ,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,SAAS;YACZ,OAAO,QAAQ,CAAC,WAAW,CAAA;IAC/B,CAAC;AACH,CAAC"}

package/dist/graph/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Graph algorithms for workflow execution ordering
+ *
+ * Provides topological sorting and execution level grouping for
+ * managing workflow step dependencies.
+ */
+export { topologicalSort, topologicalSortKahn, topologicalSortDFS, getExecutionLevels, CycleDetectedError, MissingNodeError, type SortableNode, type ExecutionLevel, type TopologicalSortOptions, type TopologicalSortResult, } from './topological-sort.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,EAChB,KAAK,YAAY,EACjB,KAAK,cAAc,EACnB,KAAK,sBAAsB,EAC3B,KAAK,qBAAqB,GAC3B,MAAM,uBAAuB,CAAA"}

package/dist/graph/index.js

@@ -0,0 +1,8 @@
+/**
+ * Graph algorithms for workflow execution ordering
+ *
+ * Provides topological sorting and execution level grouping for
+ * managing workflow step dependencies.
+ */
+export { topologicalSort, topologicalSortKahn, topologicalSortDFS, getExecutionLevels, CycleDetectedError, MissingNodeError, } from './topological-sort.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,GAKjB,MAAM,uBAAuB,CAAA"}

package/dist/graph/topological-sort.d.ts

@@ -0,0 +1,121 @@
+/**
+ * Topological Sort Implementation for Workflow Execution Ordering
+ *
+ * Provides multiple algorithms for topologically sorting workflow steps:
+ * - Kahn's algorithm (BFS-based, good for detecting cycles)
+ * - DFS-based algorithm (classic approach, provides cycle path)
+ *
+ * Features:
+ * - Cycle detection with path reporting
+ * - Parallel execution level grouping
+ * - Stable, deterministic ordering
+ * - Support for missing dependency handling
+ */
+/**
+ * A node that can be topologically sorted
+ */
+export interface SortableNode {
+    /** Unique identifier for the node */
+    id: string;
+    /** IDs of nodes this node depends on */
+    dependencies: string[];
+}
+/**
+ * Execution level containing nodes that can run in parallel
+ */
+export interface ExecutionLevel {
+    /** Level number (0 = no dependencies, 1 = depends on level 0, etc.) */
+    level: number;
+    /** Node IDs that can run concurrently at this level */
+    nodes: string[];
+}
+/**
+ * Options for topological sort
+ */
+export interface TopologicalSortOptions {
+    /** Throw CycleDetectedError instead of returning hasCycle: true (default: false) */
+    throwOnCycle?: boolean;
+    /** Which algorithm to use (default: 'kahn') */
+    algorithm?: 'kahn' | 'dfs';
+    /** Throw on missing dependencies (default: false) */
+    strict?: boolean;
+}
+/**
+ * Result of topological sort operation
+ */
+export interface TopologicalSortResult {
+    /** Sorted node IDs in execution order */
+    order: string[];
+    /** Whether a cycle was detected */
+    hasCycle: boolean;
+    /** Path of nodes forming the cycle (if detected) */
+    cyclePath?: string[];
+    /** Additional metadata from the algorithm */
+    metadata?: {
+        /** In-degrees for each node (Kahn's algorithm) */
+        inDegrees?: Record<string, number>;
+    };
+}
+/**
+ * Error thrown when a cycle is detected in the dependency graph
+ */
+export declare class CycleDetectedError extends Error {
+    /** The path of nodes forming the cycle */
+    cyclePath: string[];
+    constructor(cyclePath: string[]);
+}
+/**
+ * Error thrown when a dependency references a non-existent node
+ */
+export declare class MissingNodeError extends Error {
+    /** The missing node ID */
+    missingNode: string;
+    /** The node that references the missing node */
+    referencedBy: string;
+    constructor(missingNode: string, referencedBy: string);
+}
+/**
+ * Topological sort using Kahn's algorithm (BFS-based)
+ *
+ * Algorithm:
+ * 1. Calculate in-degree for each node
+ * 2. Add all nodes with in-degree 0 to queue
+ * 3. While queue not empty:
+ *    - Remove node from queue, add to result
+ *    - Decrease in-degree of all dependents
+ *    - Add nodes with in-degree 0 to queue
+ * 4. If result size < node count, cycle exists
+ */
+export declare function topologicalSortKahn(nodes: SortableNode[], options?: TopologicalSortOptions): TopologicalSortResult;
+/**
+ * Topological sort using DFS-based algorithm
+ *
+ * Algorithm:
+ * 1. For each unvisited node:
+ *    - Mark as "in progress"
+ *    - Recursively visit all dependencies
+ *    - Mark as "visited" and add to result (in reverse)
+ * 2. If we encounter a node "in progress", we found a cycle
+ */
+export declare function topologicalSortDFS(nodes: SortableNode[], options?: TopologicalSortOptions): TopologicalSortResult;
+/**
+ * Main topological sort function with algorithm selection
+ *
+ * @param nodes - Array of nodes to sort
+ * @param options - Sort options
+ * @returns Sorted result with order and cycle information
+ */
+export declare function topologicalSort(nodes: SortableNode[], options?: TopologicalSortOptions): TopologicalSortResult;
+/**
+ * Get execution levels for parallel execution
+ *
+ * Groups nodes by their execution level:
+ * - Level 0: Nodes with no dependencies
+ * - Level N: Nodes whose dependencies are all at level < N
+ *
+ * @param nodes - Array of nodes to analyze
+ * @returns Array of execution levels, sorted by level number
+ * @throws CycleDetectedError if a cycle is detected
+ */
+export declare function getExecutionLevels(nodes: SortableNode[]): ExecutionLevel[];
+//# sourceMappingURL=topological-sort.d.ts.map

package/dist/graph/topological-sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.d.ts","sourceRoot":"","sources":["../../src/graph/topological-sort.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,qCAAqC;IACrC,EAAE,EAAE,MAAM,CAAA;IACV,wCAAwC;IACxC,YAAY,EAAE,MAAM,EAAE,CAAA;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,uEAAuE;IACvE,KAAK,EAAE,MAAM,CAAA;IACb,uDAAuD;IACvD,KAAK,EAAE,MAAM,EAAE,CAAA;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,oFAAoF;IACpF,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,+CAA+C;IAC/C,SAAS,CAAC,EAAE,MAAM,GAAG,KAAK,CAAA;IAC1B,qDAAqD;IACrD,MAAM,CAAC,EAAE,OAAO,CAAA;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,yCAAyC;IACzC,KAAK,EAAE,MAAM,EAAE,CAAA;IACf,mCAAmC;IACnC,QAAQ,EAAE,OAAO,CAAA;IACjB,oDAAoD;IACpD,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;IACpB,6CAA6C;IAC7C,QAAQ,CAAC,EAAE;QACT,kDAAkD;QAClD,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KACnC,CAAA;CACF;AAED;;GAEG;AACH,qBAAa,kBAAmB,SAAQ,KAAK;IAC3C,0CAA0C;IAC1C,SAAS,EAAE,MAAM,EAAE,CAAA;gBAEP,SAAS,EAAE,MAAM,EAAE;CAMhC;AAED;;GAEG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,0BAA0B;IAC1B,WAAW,EAAE,MAAM,CAAA;IACnB,gDAAgD;IAChD,YAAY,EAAE,MAAM,CAAA;gBAER,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;CAMtD;AA8CD;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,YAAY,EAAE,EACrB,OAAO,GAAE,sBAA2B,GACnC,qBAAqB,CAiDvB;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,YAAY,EAAE,EACrB,OAAO,GAAE,sBAA2B,GACnC,qBAAqB,CA2EvB;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,YAAY,EAAE,EACrB,OAAO,GAAE,sBAA2B,GACnC,qBAAqB,CAwBvB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,cAAc,EAAE,CAqE1E"}

package/dist/graph/topological-sort.js

@@ -0,0 +1,292 @@
+/**
+ * Topological Sort Implementation for Workflow Execution Ordering
+ *
+ * Provides multiple algorithms for topologically sorting workflow steps:
+ * - Kahn's algorithm (BFS-based, good for detecting cycles)
+ * - DFS-based algorithm (classic approach, provides cycle path)
+ *
+ * Features:
+ * - Cycle detection with path reporting
+ * - Parallel execution level grouping
+ * - Stable, deterministic ordering
+ * - Support for missing dependency handling
+ */
+/**
+ * Error thrown when a cycle is detected in the dependency graph
+ */
+export class CycleDetectedError extends Error {
+    /** The path of nodes forming the cycle */
+    cyclePath;
+    constructor(cyclePath) {
+        const pathStr = cyclePath.join(' -> ');
+        super(`Cycle detected in dependency graph: ${pathStr}`);
+        this.name = 'CycleDetectedError';
+        this.cyclePath = cyclePath;
+    }
+}
+/**
+ * Error thrown when a dependency references a non-existent node
+ */
+export class MissingNodeError extends Error {
+    /** The missing node ID */
+    missingNode;
+    /** The node that references the missing node */
+    referencedBy;
+    constructor(missingNode, referencedBy) {
+        super(`Missing dependency '${missingNode}' referenced by '${referencedBy}'`);
+        this.name = 'MissingNodeError';
+        this.missingNode = missingNode;
+        this.referencedBy = referencedBy;
+    }
+}
+/**
+ * Build adjacency list and compute in-degrees for Kahn's algorithm
+ */
+function buildGraph(nodes, strict) {
+    const nodeSet = new Set(nodes.map((n) => n.id));
+    const adjacencyList = new Map();
+    const inDegrees = new Map();
+    // Initialize all nodes
+    for (const node of nodes) {
+        adjacencyList.set(node.id, []);
+        inDegrees.set(node.id, 0);
+    }
+    // Build edges (dependency -> dependent)
+    for (const node of nodes) {
+        // Deduplicate dependencies
+        const uniqueDeps = [...new Set(node.dependencies)];
+        for (const dep of uniqueDeps) {
+            if (!nodeSet.has(dep)) {
+                if (strict) {
+                    throw new MissingNodeError(dep, node.id);
+                }
+                // Skip missing dependencies in non-strict mode
+                continue;
+            }
+            // Add edge from dependency to this node
+            adjacencyList.get(dep).push(node.id);
+            inDegrees.set(node.id, inDegrees.get(node.id) + 1);
+        }
+    }
+    return { adjacencyList, inDegrees, nodeSet };
+}
+/**
+ * Topological sort using Kahn's algorithm (BFS-based)
+ *
+ * Algorithm:
+ * 1. Calculate in-degree for each node
+ * 2. Add all nodes with in-degree 0 to queue
+ * 3. While queue not empty:
+ *    - Remove node from queue, add to result
+ *    - Decrease in-degree of all dependents
+ *    - Add nodes with in-degree 0 to queue
+ * 4. If result size < node count, cycle exists
+ */
+export function topologicalSortKahn(nodes, options = {}) {
+    const { strict = false } = options;
+    if (nodes.length === 0) {
+        return { order: [], hasCycle: false };
+    }
+    const { adjacencyList, inDegrees, nodeSet } = buildGraph(nodes, strict);
+    const order = [];
+    const inDegreesCopy = new Map(inDegrees);
+    // Start with nodes that have no dependencies (in-degree 0)
+    // Sort alphabetically for determinism
+    const queue = [...nodeSet].filter((id) => inDegreesCopy.get(id) === 0).sort();
+    while (queue.length > 0) {
+        // Sort queue for deterministic ordering
+        queue.sort();
+        const current = queue.shift();
+        order.push(current);
+        // Decrease in-degree for all dependents
+        for (const dependent of adjacencyList.get(current) || []) {
+            const newDegree = inDegreesCopy.get(dependent) - 1;
+            inDegreesCopy.set(dependent, newDegree);
+            if (newDegree === 0) {
+                queue.push(dependent);
+            }
+        }
+    }
+    // If we didn't process all nodes, there's a cycle
+    const hasCycle = order.length < nodeSet.size;
+    // Convert in-degrees to record
+    const inDegreesRecord = {};
+    for (const [id, degree] of inDegrees) {
+        inDegreesRecord[id] = degree;
+    }
+    return {
+        order,
+        hasCycle,
+        metadata: {
+            inDegrees: inDegreesRecord,
+        },
+    };
+}
+/**
+ * Topological sort using DFS-based algorithm
+ *
+ * Algorithm:
+ * 1. For each unvisited node:
+ *    - Mark as "in progress"
+ *    - Recursively visit all dependencies
+ *    - Mark as "visited" and add to result (in reverse)
+ * 2. If we encounter a node "in progress", we found a cycle
+ */
+export function topologicalSortDFS(nodes, options = {}) {
+    const { strict = false } = options;
+    if (nodes.length === 0) {
+        return { order: [], hasCycle: false };
+    }
+    const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+    const nodeSet = new Set(nodes.map((n) => n.id));
+    const visited = new Set();
+    const inProgress = new Set();
+    const order = [];
+    let cyclePath;
+    function dfs(nodeId, path) {
+        if (inProgress.has(nodeId)) {
+            // Found a cycle - construct the cycle path
+            const cycleStart = path.indexOf(nodeId);
+            cyclePath = [...path.slice(cycleStart), nodeId];
+            return true; // Cycle detected
+        }
+        if (visited.has(nodeId)) {
+            return false; // Already processed
+        }
+        inProgress.add(nodeId);
+        path.push(nodeId);
+        const node = nodeMap.get(nodeId);
+        if (node) {
+            // Deduplicate and sort dependencies for determinism
+            const uniqueDeps = [...new Set(node.dependencies)].sort();
+            for (const dep of uniqueDeps) {
+                if (!nodeSet.has(dep)) {
+                    if (strict) {
+                        throw new MissingNodeError(dep, nodeId);
+                    }
+                    continue; // Skip missing deps in non-strict mode
+                }
+                if (dfs(dep, path)) {
+                    return true; // Propagate cycle detection
+                }
+            }
+        }
+        path.pop();
+        inProgress.delete(nodeId);
+        visited.add(nodeId);
+        order.push(nodeId);
+        return false;
+    }
+    // Process nodes in sorted order for determinism
+    const sortedNodeIds = [...nodeSet].sort();
+    for (const nodeId of sortedNodeIds) {
+        if (!visited.has(nodeId)) {
+            if (dfs(nodeId, [])) {
+                break; // Stop on first cycle
+            }
+        }
+    }
+    const hasCycle = cyclePath !== undefined;
+    return {
+        order: hasCycle ? order : order, // DFS produces correct order
+        hasCycle,
+        ...(cyclePath !== undefined && { cyclePath }),
+    };
+}
+/**
+ * Main topological sort function with algorithm selection
+ *
+ * @param nodes - Array of nodes to sort
+ * @param options - Sort options
+ * @returns Sorted result with order and cycle information
+ */
+export function topologicalSort(nodes, options = {}) {
+    const { algorithm = 'dfs', throwOnCycle = false } = options;
+    let result;
+    if (algorithm === 'kahn') {
+        result = topologicalSortKahn(nodes, options);
+        // Kahn's algorithm doesn't provide cycle path, so detect it separately
+        if (result.hasCycle) {
+            const dfsResult = topologicalSortDFS(nodes, options);
+            if (dfsResult.cyclePath !== undefined) {
+                result = { ...result, cyclePath: dfsResult.cyclePath };
+            }
+        }
+    }
+    else {
+        result = topologicalSortDFS(nodes, options);
+    }
+    if (result.hasCycle && throwOnCycle) {
+        throw new CycleDetectedError(result.cyclePath || ['unknown']);
+    }
+    return result;
+}
+/**
+ * Get execution levels for parallel execution
+ *
+ * Groups nodes by their execution level:
+ * - Level 0: Nodes with no dependencies
+ * - Level N: Nodes whose dependencies are all at level < N
+ *
+ * @param nodes - Array of nodes to analyze
+ * @returns Array of execution levels, sorted by level number
+ * @throws CycleDetectedError if a cycle is detected
+ */
+export function getExecutionLevels(nodes) {
+    if (nodes.length === 0) {
+        return [];
+    }
+    // First, verify no cycles exist
+    const sortResult = topologicalSort(nodes, { throwOnCycle: true });
+    const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+    const nodeSet = new Set(nodes.map((n) => n.id));
+    const levels = new Map();
+    // Calculate level for each node
+    function calculateLevel(nodeId) {
+        if (levels.has(nodeId)) {
+            return levels.get(nodeId);
+        }
+        const node = nodeMap.get(nodeId);
+        if (!node) {
+            return 0;
+        }
+        // Filter to only existing dependencies
+        const validDeps = node.dependencies.filter((d) => nodeSet.has(d));
+        if (validDeps.length === 0) {
+            levels.set(nodeId, 0);
+            return 0;
+        }
+        let maxDepLevel = -1;
+        for (const dep of validDeps) {
+            const depLevel = calculateLevel(dep);
+            maxDepLevel = Math.max(maxDepLevel, depLevel);
+        }
+        const level = maxDepLevel + 1;
+        levels.set(nodeId, level);
+        return level;
+    }
+    // Calculate levels for all nodes
+    for (const node of nodes) {
+        calculateLevel(node.id);
+    }
+    // Group nodes by level
+    const levelGroups = new Map();
+    for (const [nodeId, level] of levels) {
+        if (!levelGroups.has(level)) {
+            levelGroups.set(level, []);
+        }
+        levelGroups.get(level).push(nodeId);
+    }
+    // Convert to sorted array of ExecutionLevels
+    const result = [];
+    const sortedLevels = [...levelGroups.keys()].sort((a, b) => a - b);
+    for (const level of sortedLevels) {
+        result.push({
+            level,
+            // Sort nodes within level for determinism
+            nodes: levelGroups.get(level).sort(),
+        });
+    }
+    return result;
+}
+//# sourceMappingURL=topological-sort.js.map

package/dist/graph/topological-sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.js","sourceRoot":"","sources":["../../src/graph/topological-sort.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAmDH;;GAEG;AACH,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IAC3C,0CAA0C;IAC1C,SAAS,CAAU;IAEnB,YAAY,SAAmB;QAC7B,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACtC,KAAK,CAAC,uCAAuC,OAAO,EAAE,CAAC,CAAA;QACvD,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAA;QAChC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC5B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACzC,0BAA0B;IAC1B,WAAW,CAAQ;IACnB,gDAAgD;IAChD,YAAY,CAAQ;IAEpB,YAAY,WAAmB,EAAE,YAAoB;QACnD,KAAK,CAAC,uBAAuB,WAAW,oBAAoB,YAAY,GAAG,CAAC,CAAA;QAC5E,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAA;QAC9B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;QAC9B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;CACF;AAED;;GAEG;AACH,SAAS,UAAU,CACjB,KAAqB,EACrB,MAAe;IAMf,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAA;IACjD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;IAE3C,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IAC3B,CAAC;IAED,wCAAwC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,2BAA2B;QAC3B,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAA;QAElD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,IAAI,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC1C,CAAC;gBACD,+CAA+C;gBAC/C,SAAQ;YACV,CAAC;YAED,wCAAwC;YACxC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACrC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;AAC9C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAqB,EACrB,UAAkC,EAAE;IAEpC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,OAAO,CAAA;IAElC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;IACvC,CAAC;IAED,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IAEvE,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAA;IAExC,2DAA2D;IAC3D,sCAAsC;IACtC,MAAM,KAAK,GAAa,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IAEvF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,wCAAwC;QACxC,KAAK,CAAC,IAAI,EAAE,CAAA;QACZ,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAC9B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAEnB,wCAAwC;QACxC,KAAK,MAAM,SAAS,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACzD,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAE,GAAG,CAAC,CAAA;YACnD,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;YAEvC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,IAAI,CAAA;IAE5C,+BAA+B;IAC/B,MAAM,eAAe,GAA2B,EAAE,CAAA;IAClD,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACrC,eAAe,CAAC,EAAE,CAAC,GAAG,MAAM,CAAA;IAC9B,CAAC;IAED,OAAO;QACL,KAAK;QACL,QAAQ;QACR,QAAQ,EAAE;YACR,SAAS,EAAE,eAAe;SAC3B;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAqB,EACrB,UAAkC,EAAE;IAEpC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,OAAO,CAAA;IAElC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;IACvC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IACpD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAE/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;IACpC,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,SAA+B,CAAA;IAEnC,SAAS,GAAG,CAAC,MAAc,EAAE,IAAc;QACzC,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,2CAA2C;YAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;YACvC,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,CAAA;YAC/C,OAAO,IAAI,CAAA,CAAC,iBAAiB;QAC/B,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAA,CAAC,oBAAoB;QACnC,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACtB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAEjB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChC,IAAI,IAAI,EAAE,CAAC;YACT,oDAAoD;YACpD,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;YAEzD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,IAAI,gBAAgB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;oBACzC,CAAC;oBACD,SAAQ,CAAC,uCAAuC;gBAClD,CAAC;gBAED,IAAI,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;oBACnB,OAAO,IAAI,CAAA,CAAC,4BAA4B;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAA;QACV,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QACzB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAElB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,gDAAgD;IAChD,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAA;IAEzC,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;gBACpB,MAAK,CAAC,sBAAsB;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,KAAK,SAAS,CAAA;IAExC,OAAO;QACL,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,6BAA6B;QAC9D,QAAQ;QACR,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,CAAC;KAC9C,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAqB,EACrB,UAAkC,EAAE;IAEpC,MAAM,EAAE,SAAS,GAAG,KAAK,EAAE,YAAY,GAAG,KAAK,EAAE,GAAG,OAAO,CAAA;IAE3D,IAAI,MAA6B,CAAA;IAEjC,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACzB,MAAM,GAAG,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QAE5C,uEAAuE;QACvE,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;YACpD,IAAI,SAAS,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACtC,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,SAAS,EAAE,CAAA;YACxD,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;IAC7C,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,IAAI,YAAY,EAAE,CAAC;QACpC,MAAM,IAAI,kBAAkB,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,CAAC,CAAA;IAC/D,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqB;IACtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAA;IACX,CAAC;IAED,gCAAgC;IAChC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAA;IAEjE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IACpD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IAExC,gCAAgC;IAChC,SAAS,cAAc,CAAC,MAAc;QACpC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;QAC5B,CAAC;QAED,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,CAAC,CAAA;QACV,CAAC;QAED,uCAAuC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAEjE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;YACrB,OAAO,CAAC,CAAA;QACV,CAAC;QAED,IAAI,WAAW,GAAG,CAAC,CAAC,CAAA;QACpB,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAA;YACpC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAA;QAC/C,CAAC;QAED,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,CAAA;QAC7B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QACzB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzB,CAAC;IAED,uBAAuB;IACvB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC/C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACtC,CAAC;IAED,6CAA6C;IAC7C,MAAM,MAAM,GAAqB,EAAE,CAAA;IACnC,MAAM,YAAY,GAAG,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAElE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC;YACV,KAAK;YACL,0CAA0C;YAC1C,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,EAAE;SACtC,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/index.d.ts

@@ -60,9 +60,18 @@
  * ```
  */
 export { Workflow, createTestContext, parseEvent, type WorkflowInstance } from './workflow.js';
+export { createWorkflowRuntime, type WorkflowRuntime, type WorkflowRuntimeOptions, } from './runtime.js';
 export { on, registerEventHandler, getEventHandlers, clearEventHandlers } from './on.js';
 export { every, registerScheduleHandler, getScheduleHandlers, clearScheduleHandlers, setCronConverter, toCron, intervalToMs, formatInterval, } from './every.js';
 export { send, getEventBus } from './send.js';
 export { createWorkflowContext, createIsolatedContext } from './context.js';
-export type { EventHandler, ScheduleHandler, WorkflowContext, WorkflowState, WorkflowHistoryEntry, EventRegistration, ScheduleRegistration, ScheduleInterval, WorkflowDefinition, WorkflowOptions, ParsedEvent, OnProxy, EveryProxy, HandlerFunction, DatabaseContext, ActionData, ArtifactData, } from './types.js';
+export { createCascadeContext, recordStep, withCascadeContext, type CascadeContext, type CascadeStep, type CascadeContextOptions, type SerializedCascadeContext, type SerializedCascadeStep, type TraceContext, type FiveWHEvent, type StepStatus, } from './cascade-context.js';
+export { DependencyGraph, CircularDependencyError, MissingDependencyError, type GraphNode, type ParallelGroup, type GraphJSON, type EventRegistrationWithDeps, } from './dependency-graph.js';
+export { topologicalSort, topologicalSortKahn, topologicalSortDFS, getExecutionLevels, CycleDetectedError, MissingNodeError, type SortableNode, type ExecutionLevel, type TopologicalSortOptions, type TopologicalSortResult, } from './graph/topological-sort.js';
+export { Barrier, BarrierTimeoutError, createBarrier, waitForAll, waitForAny, withConcurrencyLimit, type BarrierOptions, type BarrierProgress, type BarrierResult, type WaitForAllOptions, type WaitForAnyOptions, type WaitForAnyResult, type ConcurrencyOptions, } from './barrier.js';
+export { CascadeExecutor, CascadeTimeoutError, TierSkippedError, AllTiersFailedError, TIER_ORDER, DEFAULT_TIER_TIMEOUTS, type CapabilityTier, type TierHandler, type TierContext, type TierResult, type TierRetryConfig, type CascadeConfig, type CascadeResult, type CascadeMetrics, type SkipCondition, } from './cascade-executor.js';
+export { DurableStep, StepContext as DurableStepContext, type StepConfig, type StepMetadata, type RetryConfig as DurableRetryConfig, type WorkflowStep, type StepFunction as DurableStepFunction, DurableCascadeStep, AllTiersFailed, CascadeTimeout, DEFAULT_CASCADE_TIMEOUTS, CASCADE_TIER_ORDER, type CascadeTier, type CascadeConfig as DurableCascadeConfig, type CascadeTierConfig, type CascadeTierResult, type CascadeResult as DurableCascadeResult, type CascadeContext as DurableCascadeContext, type CascadeTierContext, type AiBinding, type HumanReviewRequest, type CodeTierHandler, type AiTierHandler, type HumanTierHandler, } from './worker/durable-step.js';
+export { workflow, WorkflowBuilder, type StepDefinition, type StepChain, type ConditionalChain, type LoopChain, type BuiltWorkflow, type StepContext, type RetryConfig, type StepFunction, type ConditionFunction, type ErrorHandler, type LoopOptions, type ForEachOptions, } from './workflow-builder.js';
+export { WorkflowStateAdapter, type PersistedWorkflowState, type StepCheckpoint, type WorkflowHistoryEntry as StateHistoryEntry, type SnapshotInfo, type DatabaseConnection, } from './worker/state-adapter.js';
+export type { EventHandler, ScheduleHandler, WorkflowContext, WorkflowState, WorkflowHistoryEntry, EventRegistration, ScheduleRegistration, ScheduleInterval, WorkflowDefinition, WorkflowOptions, ParsedEvent, OnProxy, EveryProxy, HandlerFunction, DatabaseContext, ActionData, ArtifactData, DependencyConfig, DependencyType, } from './types.js';
 //# sourceMappingURL=index.d.ts.map