@morojs/moro 1.6.8 → 1.7.1

package/dist/core/queue/middleware/monitoring.d.ts

@@ -0,0 +1,84 @@
+/**
+ * Monitoring Middleware for Queue Processing
+ * Collects metrics and tracks job performance
+ */
+import type { JobHandler } from '../types.js';
+/**
+ * Job execution metrics
+ */
+export interface JobMetrics {
+    jobId: string;
+    queueName: string;
+    startTime: number;
+    endTime?: number;
+    duration?: number;
+    success: boolean;
+    error?: string;
+    attemptsMade: number;
+    memoryUsage?: NodeJS.MemoryUsage;
+}
+/**
+ * Queue metrics collector
+ */
+export declare class QueueMetricsCollector {
+    private metrics;
+    private aggregatedStats;
+    /**
+     * Record job start
+     */
+    recordStart(jobId: string, queueName: string, attemptsMade: number): void;
+    /**
+     * Record job completion
+     */
+    recordCompletion(jobId: string, success: boolean, error?: string): void;
+    /**
+     * Get metrics for a specific job
+     */
+    getJobMetrics(jobId: string): JobMetrics | undefined;
+    /**
+     * Get aggregated stats for a queue
+     */
+    getQueueStats(queueName: string): QueueStats | undefined;
+    /**
+     * Get all queue stats
+     */
+    getAllStats(): Map<string, QueueStats>;
+    /**
+     * Clear old metrics (keep last N)
+     */
+    cleanup(maxMetrics?: number): void;
+    /**
+     * Update aggregated statistics
+     */
+    private updateStats;
+}
+/**
+ * Aggregated queue statistics
+ */
+export interface QueueStats {
+    queueName: string;
+    totalJobs: number;
+    successfulJobs: number;
+    failedJobs: number;
+    totalDuration: number;
+    averageDuration: number;
+    minDuration: number;
+    maxDuration: number;
+    lastUpdated: number;
+}
+/**
+ * Monitoring middleware options
+ */
+export interface MonitoringOptions {
+    collector?: QueueMetricsCollector;
+    logMetrics?: boolean;
+    trackMemory?: boolean;
+}
+/**
+ * Create a monitoring middleware
+ */
+export declare function createMonitoringMiddleware<T = any, R = any>(handler: JobHandler<T, R>, options?: MonitoringOptions): JobHandler<T, R>;
+/**
+ * Global metrics collector instance
+ */
+export declare const globalMetricsCollector: QueueMetricsCollector;

package/dist/core/queue/middleware/monitoring.js

@@ -0,0 +1,145 @@
+/**
+ * Monitoring Middleware for Queue Processing
+ * Collects metrics and tracks job performance
+ */
+/**
+ * Queue metrics collector
+ */
+export class QueueMetricsCollector {
+    metrics = new Map();
+    aggregatedStats = new Map();
+    /**
+     * Record job start
+     */
+    recordStart(jobId, queueName, attemptsMade) {
+        this.metrics.set(jobId, {
+            jobId,
+            queueName,
+            startTime: Date.now(),
+            success: false,
+            attemptsMade,
+            memoryUsage: process.memoryUsage(),
+        });
+    }
+    /**
+     * Record job completion
+     */
+    recordCompletion(jobId, success, error) {
+        const metric = this.metrics.get(jobId);
+        if (!metric) {
+            return;
+        }
+        metric.endTime = Date.now();
+        metric.duration = metric.endTime - metric.startTime;
+        metric.success = success;
+        metric.error = error;
+        // Update aggregated stats
+        this.updateStats(metric);
+    }
+    /**
+     * Get metrics for a specific job
+     */
+    getJobMetrics(jobId) {
+        return this.metrics.get(jobId);
+    }
+    /**
+     * Get aggregated stats for a queue
+     */
+    getQueueStats(queueName) {
+        return this.aggregatedStats.get(queueName);
+    }
+    /**
+     * Get all queue stats
+     */
+    getAllStats() {
+        return new Map(this.aggregatedStats);
+    }
+    /**
+     * Clear old metrics (keep last N)
+     */
+    cleanup(maxMetrics = 1000) {
+        if (this.metrics.size <= maxMetrics) {
+            return;
+        }
+        const metricsArray = Array.from(this.metrics.entries());
+        const toKeep = metricsArray.slice(-maxMetrics);
+        this.metrics = new Map(toKeep);
+    }
+    /**
+     * Update aggregated statistics
+     */
+    updateStats(metric) {
+        const queueName = metric.queueName;
+        let stats = this.aggregatedStats.get(queueName);
+        if (!stats) {
+            stats = {
+                queueName,
+                totalJobs: 0,
+                successfulJobs: 0,
+                failedJobs: 0,
+                totalDuration: 0,
+                averageDuration: 0,
+                minDuration: Infinity,
+                maxDuration: 0,
+                lastUpdated: Date.now(),
+            };
+            this.aggregatedStats.set(queueName, stats);
+        }
+        stats.totalJobs++;
+        if (metric.success) {
+            stats.successfulJobs++;
+        }
+        else {
+            stats.failedJobs++;
+        }
+        if (metric.duration !== undefined) {
+            stats.totalDuration += metric.duration;
+            stats.averageDuration = stats.totalDuration / stats.totalJobs;
+            stats.minDuration = Math.min(stats.minDuration, metric.duration);
+            stats.maxDuration = Math.max(stats.maxDuration, metric.duration);
+        }
+        stats.lastUpdated = Date.now();
+    }
+}
+/**
+ * Create a monitoring middleware
+ */
+export function createMonitoringMiddleware(handler, options = {}) {
+    const collector = options.collector || new QueueMetricsCollector();
+    return async (job) => {
+        // Record start
+        collector.recordStart(job.id, job.name, job.attemptsMade);
+        const startTime = Date.now();
+        const startMemory = options.trackMemory ? process.memoryUsage() : null;
+        try {
+            const result = await handler(job);
+            // Record success
+            collector.recordCompletion(job.id, true);
+            if (options.logMetrics) {
+                const duration = Date.now() - startTime;
+                job.log(`Job completed in ${duration}ms`);
+                if (startMemory && options.trackMemory) {
+                    const endMemory = process.memoryUsage();
+                    const heapDiff = endMemory.heapUsed - startMemory.heapUsed;
+                    job.log(`Heap usage: ${(heapDiff / 1024 / 1024).toFixed(2)}MB`);
+                }
+            }
+            return result;
+        }
+        catch (error) {
+            // Record failure
+            const errorMessage = error instanceof Error ? error.message : String(error);
+            collector.recordCompletion(job.id, false, errorMessage);
+            if (options.logMetrics) {
+                const duration = Date.now() - startTime;
+                job.log(`Job failed after ${duration}ms: ${errorMessage}`);
+            }
+            throw error;
+        }
+    };
+}
+/**
+ * Global metrics collector instance
+ */
+export const globalMetricsCollector = new QueueMetricsCollector();
+//# sourceMappingURL=monitoring.js.map

package/dist/core/queue/middleware/monitoring.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"monitoring.js","sourceRoot":"","sources":["../../../../src/core/queue/middleware/monitoring.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAmBH;;GAEG;AACH,MAAM,OAAO,qBAAqB;IACxB,OAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC7C,eAAe,GAA4B,IAAI,GAAG,EAAE,CAAC;IAE7D;;OAEG;IACH,WAAW,CAAC,KAAa,EAAE,SAAiB,EAAE,YAAoB;QAChE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE;YACtB,KAAK;YACL,SAAS;YACT,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,OAAO,EAAE,KAAK;YACd,YAAY;YACZ,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE;SACnC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAa,EAAE,OAAgB,EAAE,KAAc;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;QACT,CAAC;QAED,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC5B,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC;QACpD,MAAM,CAAC,OAAO,GAAG,OAAO,CAAC;QACzB,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;QAErB,0BAA0B;QAC1B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAa;QACzB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,SAAiB;QAC7B,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,aAAqB,IAAI;QAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,UAAU,EAAE,CAAC;YACpC,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,MAAkB;QACpC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QACnC,IAAI,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAEhD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG;gBACN,SAAS;gBACT,SAAS,EAAE,CAAC;gBACZ,cAAc,EAAE,CAAC;gBACjB,UAAU,EAAE,CAAC;gBACb,aAAa,EAAE,CAAC;gBAChB,eAAe,EAAE,CAAC;gBAClB,WAAW,EAAE,QAAQ;gBACrB,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;aACxB,CAAC;YACF,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,KAAK,CAAC,SAAS,EAAE,CAAC;QAClB,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,CAAC;QAED,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAClC,KAAK,CAAC,aAAa,IAAI,MAAM,CAAC,QAAQ,CAAC;YACvC,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC;YAC9D,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;YACjE,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnE,CAAC;QAED,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;CACF;AA0BD;;GAEG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAAyB,EACzB,UAA6B,EAAE;IAE/B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,qBAAqB,EAAE,CAAC;IAEnE,OAAO,KAAK,EAAE,GAAkB,EAAc,EAAE;QAC9C,eAAe;QACf,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;QAE1D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAEvE,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;YAElC,iBAAiB;YACjB,SAAS,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAEzC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;gBACxC,GAAG,CAAC,GAAG,CAAC,oBAAoB,QAAQ,IAAI,CAAC,CAAC;gBAE1C,IAAI,WAAW,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;oBACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC;oBAC3D,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClE,CAAC;YACH,CAAC;YAED,OAAO,MAAM,CAAC;QAChB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,iBAAiB;YACjB,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5E,SAAS,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YAExD,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;gBACxC,GAAG,CAAC,GAAG,CAAC,oBAAoB,QAAQ,OAAO,YAAY,EAAE,CAAC,CAAC;YAC7D,CAAC;YAED,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,qBAAqB,EAAE,CAAC"}

package/dist/core/queue/middleware/priority.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Priority Handling Middleware for Queue Processing
+ * Manages job priority and execution order
+ */
+import type { JobHandler } from '../types.js';
+/**
+ * Priority levels
+ */
+export declare enum Priority {
+    CRITICAL = 1,
+    HIGH = 2,
+    NORMAL = 3,
+    LOW = 4,
+    VERY_LOW = 5
+}
+/**
+ * Priority middleware options
+ */
+export interface PriorityOptions {
+    defaultPriority?: Priority;
+    logPriority?: boolean;
+}
+/**
+ * Create a priority-aware job handler
+ */
+export declare function createPriorityMiddleware<T = any, R = any>(handler: JobHandler<T, R>, options?: PriorityOptions): JobHandler<T, R>;
+/**
+ * Priority queue helper
+ * Sorts jobs by priority before processing
+ */
+export declare class PriorityQueue<T> {
+    private items;
+    /**
+     * Add an item to the priority queue
+     */
+    enqueue(value: T, priority?: number): void;
+    /**
+     * Remove and return the highest priority item
+     */
+    dequeue(): T | undefined;
+    /**
+     * Peek at the highest priority item without removing it
+     */
+    peek(): T | undefined;
+    /**
+     * Get queue size
+     */
+    size(): number;
+    /**
+     * Check if queue is empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Clear all items
+     */
+    clear(): void;
+    /**
+     * Get all items sorted by priority
+     */
+    toArray(): T[];
+}

package/dist/core/queue/middleware/priority.js

@@ -0,0 +1,90 @@
+/**
+ * Priority Handling Middleware for Queue Processing
+ * Manages job priority and execution order
+ */
+/**
+ * Priority levels
+ */
+export var Priority;
+(function (Priority) {
+    Priority[Priority["CRITICAL"] = 1] = "CRITICAL";
+    Priority[Priority["HIGH"] = 2] = "HIGH";
+    Priority[Priority["NORMAL"] = 3] = "NORMAL";
+    Priority[Priority["LOW"] = 4] = "LOW";
+    Priority[Priority["VERY_LOW"] = 5] = "VERY_LOW";
+})(Priority || (Priority = {}));
+/**
+ * Create a priority-aware job handler
+ */
+export function createPriorityMiddleware(handler, options = {}) {
+    return async (job) => {
+        const priority = job.opts.priority || options.defaultPriority || Priority.NORMAL;
+        if (options.logPriority) {
+            const priorityName = Priority[priority] || 'UNKNOWN';
+            job.log(`Processing job with priority: ${priorityName} (${priority})`);
+        }
+        return await handler(job);
+    };
+}
+/**
+ * Priority queue helper
+ * Sorts jobs by priority before processing
+ */
+export class PriorityQueue {
+    items = [];
+    /**
+     * Add an item to the priority queue
+     */
+    enqueue(value, priority = Priority.NORMAL) {
+        const item = { priority, value };
+        // Find correct position based on priority
+        let added = false;
+        for (let i = 0; i < this.items.length; i++) {
+            if (item.priority < this.items[i].priority) {
+                this.items.splice(i, 0, item);
+                added = true;
+                break;
+            }
+        }
+        if (!added) {
+            this.items.push(item);
+        }
+    }
+    /**
+     * Remove and return the highest priority item
+     */
+    dequeue() {
+        return this.items.shift()?.value;
+    }
+    /**
+     * Peek at the highest priority item without removing it
+     */
+    peek() {
+        return this.items[0]?.value;
+    }
+    /**
+     * Get queue size
+     */
+    size() {
+        return this.items.length;
+    }
+    /**
+     * Check if queue is empty
+     */
+    isEmpty() {
+        return this.items.length === 0;
+    }
+    /**
+     * Clear all items
+     */
+    clear() {
+        this.items = [];
+    }
+    /**
+     * Get all items sorted by priority
+     */
+    toArray() {
+        return this.items.map(item => item.value);
+    }
+}
+//# sourceMappingURL=priority.js.map

package/dist/core/queue/middleware/priority.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority.js","sourceRoot":"","sources":["../../../../src/core/queue/middleware/priority.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;GAEG;AACH,MAAM,CAAN,IAAY,QAMX;AAND,WAAY,QAAQ;IAClB,+CAAY,CAAA;IACZ,uCAAQ,CAAA;IACR,2CAAU,CAAA;IACV,qCAAO,CAAA;IACP,+CAAY,CAAA;AACd,CAAC,EANW,QAAQ,KAAR,QAAQ,QAMnB;AAUD;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,OAAyB,EACzB,UAA2B,EAAE;IAE7B,OAAO,KAAK,EAAE,GAAkB,EAAc,EAAE;QAC9C,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,eAAe,IAAI,QAAQ,CAAC,MAAM,CAAC;QAEjF,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC;YACrD,GAAG,CAAC,GAAG,CAAC,iCAAiC,YAAY,KAAK,QAAQ,GAAG,CAAC,CAAC;QACzE,CAAC;QAED,OAAO,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,aAAa;IAChB,KAAK,GAA0C,EAAE,CAAC;IAE1D;;OAEG;IACH,OAAO,CAAC,KAAQ,EAAE,WAAmB,QAAQ,CAAC,MAAM;QAClD,MAAM,IAAI,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAEjC,0CAA0C;QAC1C,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBAC9B,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,KAAK,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;CACF"}

package/dist/core/queue/middleware/rate-limit.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Rate Limiting Middleware for Queue Processing
+ * Limits the rate at which jobs are processed
+ */
+import type { JobHandler } from '../types.js';
+/**
+ * Rate limiter configuration
+ */
+export interface RateLimiterOptions {
+    max: number;
+    duration: number;
+    throwOnLimit?: boolean;
+}
+/**
+ * Create a rate-limited job handler
+ */
+export declare function createRateLimitMiddleware<T = any, R = any>(handler: JobHandler<T, R>, options: RateLimiterOptions): JobHandler<T, R>;
+/**
+ * Rate limiter factory for queue configuration
+ */
+export declare class RateLimiter {
+    /**
+     * Create a rate limiter that allows X jobs per second
+     */
+    static perSecond(max: number): RateLimiterOptions;
+    /**
+     * Create a rate limiter that allows X jobs per minute
+     */
+    static perMinute(max: number): RateLimiterOptions;
+    /**
+     * Create a rate limiter that allows X jobs per hour
+     */
+    static perHour(max: number): RateLimiterOptions;
+}

package/dist/core/queue/middleware/rate-limit.js

@@ -0,0 +1,109 @@
+/**
+ * Rate Limiting Middleware for Queue Processing
+ * Limits the rate at which jobs are processed
+ */
+/**
+ * Token bucket implementation for rate limiting
+ */
+class TokenBucket {
+    max;
+    refillRate;
+    tokens;
+    lastRefill;
+    constructor(max, refillRate) {
+        this.max = max;
+        this.refillRate = refillRate;
+        this.tokens = max;
+        this.lastRefill = Date.now();
+    }
+    /**
+     * Try to consume a token
+     */
+    consume() {
+        this.refill();
+        if (this.tokens >= 1) {
+            this.tokens -= 1;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Refill tokens based on time elapsed
+     */
+    refill() {
+        const now = Date.now();
+        const elapsed = now - this.lastRefill;
+        const tokensToAdd = (elapsed / 1000) * this.refillRate;
+        if (tokensToAdd > 0) {
+            this.tokens = Math.min(this.max, this.tokens + tokensToAdd);
+            this.lastRefill = now;
+        }
+    }
+    /**
+     * Get time until next token is available (in ms)
+     */
+    getWaitTime() {
+        if (this.tokens >= 1) {
+            return 0;
+        }
+        const tokensNeeded = 1 - this.tokens;
+        return (tokensNeeded / this.refillRate) * 1000;
+    }
+}
+/**
+ * Create a rate-limited job handler
+ */
+export function createRateLimitMiddleware(handler, options) {
+    const refillRate = options.max / (options.duration / 1000);
+    const bucket = new TokenBucket(options.max, refillRate);
+    return async (job) => {
+        // Try to consume a token
+        if (!bucket.consume()) {
+            if (options.throwOnLimit) {
+                throw new Error('Rate limit exceeded');
+            }
+            // Wait for next token
+            const waitTime = bucket.getWaitTime();
+            job.log(`Rate limit reached, waiting ${Math.ceil(waitTime)}ms`);
+            await new Promise(resolve => setTimeout(resolve, waitTime));
+            // Try again after waiting
+            if (!bucket.consume()) {
+                throw new Error('Rate limit still exceeded after waiting');
+            }
+        }
+        return await handler(job);
+    };
+}
+/**
+ * Rate limiter factory for queue configuration
+ */
+export class RateLimiter {
+    /**
+     * Create a rate limiter that allows X jobs per second
+     */
+    static perSecond(max) {
+        return {
+            max,
+            duration: 1000,
+        };
+    }
+    /**
+     * Create a rate limiter that allows X jobs per minute
+     */
+    static perMinute(max) {
+        return {
+            max,
+            duration: 60000,
+        };
+    }
+    /**
+     * Create a rate limiter that allows X jobs per hour
+     */
+    static perHour(max) {
+        return {
+            max,
+            duration: 3600000,
+        };
+    }
+}
+//# sourceMappingURL=rate-limit.js.map

package/dist/core/queue/middleware/rate-limit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rate-limit.js","sourceRoot":"","sources":["../../../../src/core/queue/middleware/rate-limit.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAaH;;GAEG;AACH,MAAM,WAAW;IAKL;IACA;IALF,MAAM,CAAS;IACf,UAAU,CAAS;IAE3B,YACU,GAAW,EACX,UAAkB;QADlB,QAAG,GAAH,GAAG,CAAQ;QACX,eAAU,GAAV,UAAU,CAAQ;QAE1B,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,MAAM;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QACtC,MAAM,WAAW,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAEvD,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;YAC5D,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,WAAW;QACT,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACrC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC;IACjD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,OAAyB,EACzB,OAA2B;IAE3B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;IAExD,OAAO,KAAK,EAAE,GAAkB,EAAc,EAAE;QAC9C,yBAAyB;QACzB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YACtB,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACzC,CAAC;YAED,sBAAsB;YACtB,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACtC,GAAG,CAAC,GAAG,CAAC,+BAA+B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAEhE,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;YAE5D,0BAA0B;YAC1B,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBACtB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,OAAO,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,WAAW;IACtB;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,GAAW;QAC1B,OAAO;YACL,GAAG;YACH,QAAQ,EAAE,IAAI;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,GAAW;QAC1B,OAAO;YACL,GAAG;YACH,QAAQ,EAAE,KAAK;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,GAAW;QACxB,OAAO;YACL,GAAG;YACH,QAAQ,EAAE,OAAO;SAClB,CAAC;IACJ,CAAC;CACF"}

package/dist/core/queue/queue-adapter.d.ts

@@ -0,0 +1,73 @@
+/**
+ * Base Queue Adapter Interface
+ * Defines the contract that all queue adapters must implement
+ */
+import type { IQueueAdapter, Job, JobOptions, JobHandler, JobStatus, QueueMetrics, BulkJobData } from './types.js';
+/**
+ * Abstract base class for queue adapters
+ * Provides common functionality and enforces interface implementation
+ */
+export declare abstract class QueueAdapter implements IQueueAdapter {
+    abstract name: string;
+    isReady: boolean;
+    /**
+     * Initialize the queue adapter
+     */
+    abstract initialize(): Promise<void>;
+    /**
+     * Add a single job to the queue
+     */
+    abstract addJob<T = any>(queueName: string, data: T, options?: JobOptions): Promise<Job<T>>;
+    /**
+     * Add multiple jobs to the queue in bulk
+     */
+    abstract addBulkJobs<T = any>(queueName: string, jobs: BulkJobData<T>[]): Promise<Job<T>[]>;
+    /**
+     * Register a processor for the queue
+     */
+    abstract process<T = any, R = any>(queueName: string, concurrency: number, handler: JobHandler<T, R>): Promise<void>;
+    /**
+     * Get a specific job by ID
+     */
+    abstract getJob(queueName: string, jobId: string): Promise<Job | null>;
+    /**
+     * Get jobs by status
+     */
+    abstract getJobs(queueName: string, status?: JobStatus, start?: number, end?: number): Promise<Job[]>;
+    /**
+     * Remove a job from the queue
+     */
+    abstract removeJob(queueName: string, jobId: string): Promise<void>;
+    /**
+     * Retry a failed job
+     */
+    abstract retryJob(queueName: string, jobId: string): Promise<void>;
+    /**
+     * Pause the queue
+     */
+    abstract pauseQueue(queueName: string): Promise<void>;
+    /**
+     * Resume the queue
+     */
+    abstract resumeQueue(queueName: string): Promise<void>;
+    /**
+     * Get queue metrics
+     */
+    abstract getMetrics(queueName: string): Promise<QueueMetrics>;
+    /**
+     * Clean old jobs from the queue
+     */
+    abstract clean(queueName: string, gracePeriod: number, status?: JobStatus): Promise<void>;
+    /**
+     * Completely remove a queue and all its data
+     */
+    abstract obliterate(queueName: string): Promise<void>;
+    /**
+     * Close the adapter and cleanup resources
+     */
+    abstract close(): Promise<void>;
+    /**
+     * Helper to ensure the adapter is initialized
+     */
+    protected ensureReady(): void;
+}

package/dist/core/queue/queue-adapter.js

@@ -0,0 +1,20 @@
+/**
+ * Base Queue Adapter Interface
+ * Defines the contract that all queue adapters must implement
+ */
+/**
+ * Abstract base class for queue adapters
+ * Provides common functionality and enforces interface implementation
+ */
+export class QueueAdapter {
+    isReady = false;
+    /**
+     * Helper to ensure the adapter is initialized
+     */
+    ensureReady() {
+        if (!this.isReady) {
+            throw new Error(`Queue adapter ${this.name} is not initialized`);
+        }
+    }
+}
+//# sourceMappingURL=queue-adapter.js.map

package/dist/core/queue/queue-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue-adapter.js","sourceRoot":"","sources":["../../../src/core/queue/queue-adapter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAYH;;;GAGG;AACH,MAAM,OAAgB,YAAY;IAEzB,OAAO,GAAY,KAAK,CAAC;IAiFhC;;OAEG;IACO,WAAW;QACnB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,IAAI,qBAAqB,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;CACF"}