@cogitator-ai/workflows 0.1.0

package/dist/saga/compensation.js

@@ -0,0 +1,240 @@
+/**
+ * Compensation Manager for Saga pattern
+ *
+ * Features:
+ * - Automatic compensation on failure
+ * - Reverse-order execution
+ * - Partial compensation (only completed steps)
+ * - Compensation condition checking
+ * - Compensation result tracking
+ */
+/**
+ * Compensation Manager class
+ */
+export class CompensationManager {
+    steps = new Map();
+    completedNodes = new Map();
+    executionOrder = [];
+    /**
+     * Register a compensation step for a node
+     */
+    registerCompensation(nodeId, compensationFn, options = {}) {
+        this.steps.set(nodeId, {
+            nodeId,
+            compensationFn,
+            condition: options.condition,
+            order: options.order ?? 'reverse',
+            timeout: options.timeout,
+            retries: options.retries ?? 0,
+        });
+    }
+    /**
+     * Register compensation from config
+     */
+    registerFromConfig(nodeId, config) {
+        if (!config.compensate)
+            return;
+        this.registerCompensation(nodeId, config.compensate, {
+            condition: config.compensateCondition,
+            order: config.compensateOrder,
+        });
+    }
+    /**
+     * Mark a node as completed with its result
+     */
+    markCompleted(nodeId, result) {
+        this.completedNodes.set(nodeId, result);
+        this.executionOrder.push(nodeId);
+    }
+    /**
+     * Clear a node's completion status (for retries)
+     */
+    clearCompleted(nodeId) {
+        this.completedNodes.delete(nodeId);
+        const idx = this.executionOrder.indexOf(nodeId);
+        if (idx !== -1) {
+            this.executionOrder.splice(idx, 1);
+        }
+    }
+    /**
+     * Check if a node has a compensation step
+     */
+    hasCompensation(nodeId) {
+        return this.steps.has(nodeId);
+    }
+    /**
+     * Get nodes that need compensation (completed nodes with compensation steps)
+     */
+    getCompensableNodes() {
+        return this.executionOrder.filter((nodeId) => this.steps.has(nodeId) && this.completedNodes.has(nodeId));
+    }
+    /**
+     * Execute compensation for all completed nodes
+     */
+    async compensate(state, failedNodeId, error) {
+        const startTime = Date.now();
+        const compensated = [];
+        const partialFailures = [];
+        const nodesToCompensate = this.getCompensableNodes();
+        const sortedNodes = this.sortByCompensationOrder(nodesToCompensate);
+        for (const nodeId of sortedNodes) {
+            const step = this.steps.get(nodeId);
+            const originalResult = this.completedNodes.get(nodeId);
+            const stepStart = Date.now();
+            if (step.condition && !step.condition(state, error)) {
+                compensated.push({
+                    nodeId,
+                    success: true,
+                    duration: 0,
+                    skipped: true,
+                    skipReason: 'Condition not met',
+                });
+                continue;
+            }
+            let lastError;
+            let success = false;
+            for (let attempt = 0; attempt <= (step.retries ?? 0); attempt++) {
+                try {
+                    if (step.timeout) {
+                        await this.withTimeout(step.compensationFn(state, originalResult), step.timeout);
+                    }
+                    else {
+                        await step.compensationFn(state, originalResult);
+                    }
+                    success = true;
+                    break;
+                }
+                catch (err) {
+                    lastError = err instanceof Error ? err : new Error(String(err));
+                }
+            }
+            compensated.push({
+                nodeId,
+                success,
+                error: lastError,
+                duration: Date.now() - stepStart,
+                skipped: false,
+            });
+            if (!success) {
+                partialFailures.push(nodeId);
+            }
+        }
+        return {
+            triggeredBy: {
+                nodeId: failedNodeId,
+                error,
+            },
+            compensated,
+            totalDuration: Date.now() - startTime,
+            allSuccessful: partialFailures.length === 0,
+            partialFailures,
+        };
+    }
+    /**
+     * Sort nodes by their compensation order
+     */
+    sortByCompensationOrder(nodes) {
+        const result = [];
+        const parallel = [];
+        const reverse = [];
+        const forward = [];
+        for (const nodeId of nodes) {
+            const step = this.steps.get(nodeId);
+            const order = step?.order ?? 'reverse';
+            switch (order) {
+                case 'parallel':
+                    parallel.push(nodeId);
+                    break;
+                case 'forward':
+                    forward.push(nodeId);
+                    break;
+                case 'reverse':
+                default:
+                    reverse.push(nodeId);
+                    break;
+            }
+        }
+        result.push(...parallel);
+        const reverseOrder = [...this.executionOrder]
+            .reverse()
+            .filter((n) => reverse.includes(n));
+        result.push(...reverseOrder);
+        const forwardOrder = this.executionOrder.filter((n) => forward.includes(n));
+        result.push(...forwardOrder);
+        return result;
+    }
+    /**
+     * Execute with timeout
+     */
+    async withTimeout(promise, timeoutMs) {
+        return Promise.race([
+            promise,
+            new Promise((_, reject) => setTimeout(() => reject(new Error('Compensation timeout')), timeoutMs)),
+        ]);
+    }
+    /**
+     * Reset manager state
+     */
+    reset() {
+        this.completedNodes.clear();
+        this.executionOrder = [];
+    }
+    /**
+     * Get current state summary
+     */
+    getSummary() {
+        return {
+            registeredSteps: this.steps.size,
+            completedNodes: this.completedNodes.size,
+            compensableNodes: this.getCompensableNodes().length,
+            executionOrder: [...this.executionOrder],
+        };
+    }
+}
+/**
+ * Create a compensation manager
+ */
+export function createCompensationManager() {
+    return new CompensationManager();
+}
+/**
+ * Compensation builder for fluent API
+ */
+export class CompensationBuilder {
+    steps = [];
+    /**
+     * Add a compensation step
+     */
+    addStep(nodeId, fn, options = {}) {
+        this.steps.push({ nodeId, fn, options });
+        return this;
+    }
+    /**
+     * Add conditional compensation
+     */
+    addConditionalStep(nodeId, fn, condition, options = {}) {
+        this.steps.push({
+            nodeId,
+            fn,
+            options: { ...options, condition },
+        });
+        return this;
+    }
+    /**
+     * Build the compensation manager
+     */
+    build() {
+        const manager = new CompensationManager();
+        for (const step of this.steps) {
+            manager.registerCompensation(step.nodeId, step.fn, step.options);
+        }
+        return manager;
+    }
+}
+/**
+ * Create a compensation builder
+ */
+export function compensationBuilder() {
+    return new CompensationBuilder();
+}
+//# sourceMappingURL=compensation.js.map

package/dist/saga/compensation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compensation.js","sourceRoot":"","sources":["../../src/saga/compensation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AA8CH;;GAEG;AACH,MAAM,OAAO,mBAAmB;IACtB,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC/C,cAAc,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,cAAc,GAAa,EAAE,CAAC;IAEtC;;OAEG;IACH,oBAAoB,CAClB,MAAc,EACd,cAAoE,EACpE,UAA2E,EAAE;QAE7E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE;YACrB,MAAM;YACN,cAAc;YACd,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,SAAS;YACjC,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,CAAC;SAC9B,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,MAAc,EAAE,MAA6B;QAC9D,IAAI,CAAC,MAAM,CAAC,UAAU;YAAE,OAAO;QAE/B,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE;YACnD,SAAS,EAAE,MAAM,CAAC,mBAAmB;YACrC,KAAK,EAAE,MAAM,CAAC,eAAe;SAC9B,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,MAAc,EAAE,MAAe;QAC3C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc;QAC3B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,MAAc;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,mBAAmB;QACjB,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAC/B,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CACtE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,KAAQ,EACR,YAAoB,EACpB,KAAY;QAEZ,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,MAAM,iBAAiB,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAErD,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,CAAC;QAEpE,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACrC,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAE7B,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBACpD,WAAW,CAAC,IAAI,CAAC;oBACf,MAAM;oBACN,OAAO,EAAE,IAAI;oBACb,QAAQ,EAAE,CAAC;oBACX,OAAO,EAAE,IAAI;oBACb,UAAU,EAAE,mBAAmB;iBAChC,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,IAAI,SAA4B,CAAC;YACjC,IAAI,OAAO,GAAG,KAAK,CAAC;YAEpB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC;gBAChE,IAAI,CAAC;oBACH,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;wBACjB,MAAM,IAAI,CAAC,WAAW,CACpB,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,cAAc,CAAC,EAC1C,IAAI,CAAC,OAAO,CACb,CAAC;oBACJ,CAAC;yBAAM,CAAC;wBACN,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;oBACnD,CAAC;oBACD,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,SAAS,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClE,CAAC;YACH,CAAC;YAED,WAAW,CAAC,IAAI,CAAC;gBACf,MAAM;gBACN,OAAO;gBACP,KAAK,EAAE,SAAS;gBAChB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;gBAChC,OAAO,EAAE,KAAK;aACf,CAAC,CAAC;YAEH,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO;YACL,WAAW,EAAE;gBACX,MAAM,EAAE,YAAY;gBACpB,KAAK;aACN;YACD,WAAW;YACX,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YACrC,aAAa,EAAE,eAAe,CAAC,MAAM,KAAK,CAAC;YAC3C,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,KAAe;QAC7C,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,SAAS,CAAC;YAEvC,QAAQ,KAAK,EAAE,CAAC;gBACd,KAAK,UAAU;oBACb,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACtB,MAAM;gBACR,KAAK,SAAS;oBACZ,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACrB,MAAM;gBACR,KAAK,SAAS,CAAC;gBACf;oBACE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACrB,MAAM;YACV,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;QAEzB,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC;aAC1C,OAAO,EAAE;aACT,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAE7B,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAE7B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW,CACvB,OAAmB,EACnB,SAAiB;QAEjB,OAAO,OAAO,CAAC,IAAI,CAAC;YAClB,OAAO;YACP,IAAI,OAAO,CAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAC3B,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,EAAE,SAAS,CAAC,CACvE;SACF,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO;YACL,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAChC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI;YACxC,gBAAgB,EAAE,IAAI,CAAC,mBAAmB,EAAE,CAAC,MAAM;YACnD,cAAc,EAAE,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC;SACzC,CAAC;IACJ,CAAC;CACF;AAYD;;GAEG;AACH,MAAM,UAAU,yBAAyB;IACvC,OAAO,IAAI,mBAAmB,EAAK,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,mBAAmB;IACtB,KAAK,GAIP,EAAE,CAAC;IAET;;OAEG;IACH,OAAO,CACL,MAAc,EACd,EAAgD,EAChD,UAA2E,EAAE;QAE7E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,kBAAkB,CAChB,MAAc,EACd,EAAgD,EAChD,SAA8C,EAC9C,UAAyF,EAAE;QAE3F,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;YACd,MAAM;YACN,EAAE;YACF,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE;SACnC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,OAAO,GAAG,IAAI,mBAAmB,EAAK,CAAC;QAE7C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACnE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO,IAAI,mBAAmB,EAAK,CAAC;AACtC,CAAC"}

package/dist/saga/dead-letter.d.ts

@@ -0,0 +1,113 @@
+/**
+ * Dead Letter Queue (DLQ) for failed workflow nodes
+ *
+ * Features:
+ * - Multiple storage backends (memory, file)
+ * - Failed node tracking with full context
+ * - Retry capability
+ * - Expiration/cleanup
+ * - Query and filtering
+ */
+import type { DeadLetterEntry, WorkflowState } from '@cogitator-ai/types';
+/**
+ * Extended dead letter entry (alias for DeadLetterEntry, for backwards compat)
+ */
+export type ExtendedDeadLetterEntry = DeadLetterEntry;
+/**
+ * DLQ query filters
+ */
+export interface DLQFilters {
+    workflowId?: string;
+    workflowName?: string;
+    nodeId?: string;
+    minAttempts?: number;
+    maxAttempts?: number;
+    createdAfter?: number;
+    createdBefore?: number;
+    tags?: string[];
+    limit?: number;
+    offset?: number;
+}
+/**
+ * Abstract DLQ implementation
+ */
+export declare abstract class BaseDLQ {
+    abstract add(entry: DeadLetterEntry): Promise<string>;
+    abstract get(id: string): Promise<DeadLetterEntry | null>;
+    abstract list(filters?: DLQFilters): Promise<DeadLetterEntry[]>;
+    abstract retry(id: string): Promise<boolean>;
+    abstract remove(id: string): Promise<boolean>;
+    abstract count(filters?: DLQFilters): Promise<number>;
+    abstract clear(): Promise<void>;
+}
+/**
+ * In-memory Dead Letter Queue
+ */
+export declare class InMemoryDLQ extends BaseDLQ {
+    private entries;
+    private defaultTTL;
+    private cleanupInterval?;
+    constructor(options?: {
+        defaultTTL?: number;
+        cleanupIntervalMs?: number;
+    });
+    add(entry: DeadLetterEntry): Promise<string>;
+    get(id: string): Promise<DeadLetterEntry | null>;
+    list(filters?: DLQFilters): Promise<DeadLetterEntry[]>;
+    retry(id: string): Promise<boolean>;
+    remove(id: string): Promise<boolean>;
+    count(filters?: DLQFilters): Promise<number>;
+    clear(): Promise<void>;
+    /**
+     * Cleanup expired entries
+     */
+    private cleanup;
+    /**
+     * Stop cleanup interval
+     */
+    destroy(): void;
+}
+/**
+ * File-based Dead Letter Queue
+ */
+export declare class FileDLQ extends BaseDLQ {
+    private directory;
+    private defaultTTL;
+    private initialized;
+    constructor(directory: string, options?: {
+        defaultTTL?: number;
+    });
+    private ensureInitialized;
+    private getFilePath;
+    add(entry: DeadLetterEntry): Promise<string>;
+    get(id: string): Promise<DeadLetterEntry | null>;
+    list(filters?: DLQFilters): Promise<DeadLetterEntry[]>;
+    retry(id: string): Promise<boolean>;
+    remove(id: string): Promise<boolean>;
+    count(filters?: DLQFilters): Promise<number>;
+    clear(): Promise<void>;
+}
+/**
+ * Create DLQ entry from error
+ */
+export declare function createDLQEntry(nodeId: string, workflowId: string, workflowName: string, state: WorkflowState, error: Error, options?: {
+    input?: unknown;
+    attempts?: number;
+    maxAttempts?: number;
+    tags?: string[];
+    metadata?: Record<string, unknown>;
+}): DeadLetterEntry;
+/**
+ * Create an in-memory DLQ
+ */
+export declare function createInMemoryDLQ(options?: {
+    defaultTTL?: number;
+    cleanupIntervalMs?: number;
+}): InMemoryDLQ;
+/**
+ * Create a file-based DLQ
+ */
+export declare function createFileDLQ(directory: string, options?: {
+    defaultTTL?: number;
+}): FileDLQ;
+//# sourceMappingURL=dead-letter.d.ts.map

package/dist/saga/dead-letter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dead-letter.d.ts","sourceRoot":"","sources":["../../src/saga/dead-letter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAK1E;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG,eAAe,CAAC;AAEtD;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,8BAAsB,OAAO;IAC3B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IACrD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IACzD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAC/D,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAC5C,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAC7C,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;IACrD,QAAQ,CAAC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAChC;AAED;;GAEG;AACH,qBAAa,WAAY,SAAQ,OAAO;IACtC,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,eAAe,CAAC,CAAiC;gBAE7C,OAAO,GAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,iBAAiB,CAAC,EAAE,MAAM,CAAA;KAAO;IAYvE,GAAG,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAe5C,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IAYhD,IAAI,CAAC,OAAO,GAAE,UAAe,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IA+B1D,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAUnC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAIpC,KAAK,CAAC,OAAO,GAAE,UAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAKhD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;YACW,OAAO;IAerB;;OAEG;IACH,OAAO,IAAI,IAAI;CAMhB;AAED;;GAEG;AACH,qBAAa,OAAQ,SAAQ,OAAO;IAClC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,WAAW,CAAS;gBAG1B,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAO;YAOzB,iBAAiB;IAU/B,OAAO,CAAC,WAAW;IAIb,GAAG,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAmB5C,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IAmBhD,IAAI,CAAC,OAAO,GAAE,UAAe,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAkD1D,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAanC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IASpC,KAAK,CAAC,OAAO,GAAE,UAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAKhD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAa7B;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,aAAa,EACpB,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE;IACP,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC/B,GACL,eAAe,CAoBjB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAAE,GAC5D,WAAW,CAEb;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GAChC,OAAO,CAET"}

package/dist/saga/dead-letter.js

@@ -0,0 +1,307 @@
+/**
+ * Dead Letter Queue (DLQ) for failed workflow nodes
+ *
+ * Features:
+ * - Multiple storage backends (memory, file)
+ * - Failed node tracking with full context
+ * - Retry capability
+ * - Expiration/cleanup
+ * - Query and filtering
+ */
+import { nanoid } from 'nanoid';
+import { promises as fs } from 'fs';
+import { join } from 'path';
+/**
+ * Abstract DLQ implementation
+ */
+export class BaseDLQ {
+}
+/**
+ * In-memory Dead Letter Queue
+ */
+export class InMemoryDLQ extends BaseDLQ {
+    entries = new Map();
+    defaultTTL;
+    cleanupInterval;
+    constructor(options = {}) {
+        super();
+        this.defaultTTL = options.defaultTTL ?? 7 * 24 * 60 * 60 * 1000;
+        if (options.cleanupIntervalMs) {
+            this.cleanupInterval = setInterval(() => void this.cleanup(), options.cleanupIntervalMs);
+        }
+    }
+    async add(entry) {
+        const id = `dlq_${nanoid(12)}`;
+        const now = Date.now();
+        const extended = {
+            ...entry,
+            id,
+            createdAt: now,
+            expiresAt: now + this.defaultTTL,
+        };
+        this.entries.set(id, extended);
+        return id;
+    }
+    async get(id) {
+        const entry = this.entries.get(id);
+        if (!entry)
+            return null;
+        if (entry.expiresAt && entry.expiresAt < Date.now()) {
+            this.entries.delete(id);
+            return null;
+        }
+        return entry;
+    }
+    async list(filters = {}) {
+        const now = Date.now();
+        let results = [];
+        for (const entry of this.entries.values()) {
+            if (entry.expiresAt && entry.expiresAt < now)
+                continue;
+            if (filters.workflowId && entry.workflowId !== filters.workflowId)
+                continue;
+            if (filters.workflowName && entry.workflowName !== filters.workflowName)
+                continue;
+            if (filters.nodeId && entry.nodeId !== filters.nodeId)
+                continue;
+            if (filters.minAttempts !== undefined && entry.attempts < filters.minAttempts)
+                continue;
+            if (filters.maxAttempts !== undefined && entry.attempts > filters.maxAttempts)
+                continue;
+            if (filters.createdAfter !== undefined && entry.createdAt < filters.createdAfter)
+                continue;
+            if (filters.createdBefore !== undefined && entry.createdAt > filters.createdBefore)
+                continue;
+            if (filters.tags && !filters.tags.every((t) => entry.tags?.includes(t)))
+                continue;
+            results.push(entry);
+        }
+        results.sort((a, b) => b.createdAt - a.createdAt);
+        if (filters.offset) {
+            results = results.slice(filters.offset);
+        }
+        if (filters.limit) {
+            results = results.slice(0, filters.limit);
+        }
+        return results;
+    }
+    async retry(id) {
+        const entry = await this.get(id);
+        if (!entry)
+            return false;
+        entry.attempts++;
+        entry.lastAttempt = Date.now();
+        return true;
+    }
+    async remove(id) {
+        return this.entries.delete(id);
+    }
+    async count(filters = {}) {
+        const results = await this.list(filters);
+        return results.length;
+    }
+    async clear() {
+        this.entries.clear();
+    }
+    /**
+     * Cleanup expired entries
+     */
+    async cleanup() {
+        const now = Date.now();
+        const toDelete = [];
+        for (const [id, entry] of this.entries) {
+            if (entry.expiresAt && entry.expiresAt < now) {
+                toDelete.push(id);
+            }
+        }
+        for (const id of toDelete) {
+            this.entries.delete(id);
+        }
+    }
+    /**
+     * Stop cleanup interval
+     */
+    destroy() {
+        if (this.cleanupInterval) {
+            clearInterval(this.cleanupInterval);
+            this.cleanupInterval = undefined;
+        }
+    }
+}
+/**
+ * File-based Dead Letter Queue
+ */
+export class FileDLQ extends BaseDLQ {
+    directory;
+    defaultTTL;
+    initialized = false;
+    constructor(directory, options = {}) {
+        super();
+        this.directory = directory;
+        this.defaultTTL = options.defaultTTL ?? 7 * 24 * 60 * 60 * 1000;
+    }
+    async ensureInitialized() {
+        if (this.initialized)
+            return;
+        try {
+            await fs.mkdir(this.directory, { recursive: true });
+        }
+        catch {
+        }
+        this.initialized = true;
+    }
+    getFilePath(id) {
+        return join(this.directory, `${id}.json`);
+    }
+    async add(entry) {
+        await this.ensureInitialized();
+        const id = `dlq_${nanoid(12)}`;
+        const now = Date.now();
+        const extended = {
+            ...entry,
+            id,
+            createdAt: now,
+            expiresAt: now + this.defaultTTL,
+        };
+        const filePath = this.getFilePath(id);
+        await fs.writeFile(filePath, JSON.stringify(extended, null, 2));
+        return id;
+    }
+    async get(id) {
+        await this.ensureInitialized();
+        try {
+            const filePath = this.getFilePath(id);
+            const content = await fs.readFile(filePath, 'utf-8');
+            const entry = JSON.parse(content);
+            if (entry.expiresAt && entry.expiresAt < Date.now()) {
+                await this.remove(id);
+                return null;
+            }
+            return entry;
+        }
+        catch {
+            return null;
+        }
+    }
+    async list(filters = {}) {
+        await this.ensureInitialized();
+        const now = Date.now();
+        let results = [];
+        try {
+            const files = await fs.readdir(this.directory);
+            for (const file of files) {
+                if (!file.endsWith('.json'))
+                    continue;
+                const filePath = join(this.directory, file);
+                try {
+                    const content = await fs.readFile(filePath, 'utf-8');
+                    const entry = JSON.parse(content);
+                    if (entry.expiresAt && entry.expiresAt < now) {
+                        await fs.unlink(filePath).catch(() => { });
+                        continue;
+                    }
+                    if (filters.workflowId && entry.workflowId !== filters.workflowId)
+                        continue;
+                    if (filters.workflowName && entry.workflowName !== filters.workflowName)
+                        continue;
+                    if (filters.nodeId && entry.nodeId !== filters.nodeId)
+                        continue;
+                    if (filters.minAttempts !== undefined && entry.attempts < filters.minAttempts)
+                        continue;
+                    if (filters.maxAttempts !== undefined && entry.attempts > filters.maxAttempts)
+                        continue;
+                    if (filters.createdAfter !== undefined && entry.createdAt < filters.createdAfter)
+                        continue;
+                    if (filters.createdBefore !== undefined && entry.createdAt > filters.createdBefore)
+                        continue;
+                    if (filters.tags && !filters.tags.every((t) => entry.tags?.includes(t)))
+                        continue;
+                    results.push(entry);
+                }
+                catch {
+                }
+            }
+        }
+        catch {
+        }
+        results.sort((a, b) => b.createdAt - a.createdAt);
+        if (filters.offset) {
+            results = results.slice(filters.offset);
+        }
+        if (filters.limit) {
+            results = results.slice(0, filters.limit);
+        }
+        return results;
+    }
+    async retry(id) {
+        const entry = await this.get(id);
+        if (!entry)
+            return false;
+        entry.attempts++;
+        entry.lastAttempt = Date.now();
+        const filePath = this.getFilePath(id);
+        await fs.writeFile(filePath, JSON.stringify(entry, null, 2));
+        return true;
+    }
+    async remove(id) {
+        try {
+            await fs.unlink(this.getFilePath(id));
+            return true;
+        }
+        catch {
+            return false;
+        }
+    }
+    async count(filters = {}) {
+        const results = await this.list(filters);
+        return results.length;
+    }
+    async clear() {
+        await this.ensureInitialized();
+        try {
+            const files = await fs.readdir(this.directory);
+            await Promise.all(files
+                .filter((f) => f.endsWith('.json'))
+                .map((f) => fs.unlink(join(this.directory, f)).catch(() => { })));
+        }
+        catch {
+        }
+    }
+}
+/**
+ * Create DLQ entry from error
+ */
+export function createDLQEntry(nodeId, workflowId, workflowName, state, error, options = {}) {
+    return {
+        id: '',
+        nodeId,
+        workflowId,
+        workflowName,
+        state,
+        input: options.input,
+        error: {
+            name: error.name,
+            message: error.message,
+            stack: error.stack,
+        },
+        attempts: options.attempts ?? 1,
+        maxAttempts: options.maxAttempts ?? 1,
+        lastAttempt: Date.now(),
+        createdAt: Date.now(),
+        tags: options.tags,
+        metadata: options.metadata,
+    };
+}
+/**
+ * Create an in-memory DLQ
+ */
+export function createInMemoryDLQ(options) {
+    return new InMemoryDLQ(options);
+}
+/**
+ * Create a file-based DLQ
+ */
+export function createFileDLQ(directory, options) {
+    return new FileDLQ(directory, options);
+}
+//# sourceMappingURL=dead-letter.js.map