@vorionsys/security 1.0.0

package/dist/common/adapters/memory-lock.d.ts

@@ -0,0 +1,75 @@
+/**
+ * In-Memory Lock Adapter
+ *
+ * Provides a distributed locking implementation that runs entirely in memory,
+ * suitable for development, testing, or single-instance deployments.
+ *
+ * Features:
+ * - Lock storage with Map
+ * - Unique lock IDs for ownership verification
+ * - TTL with automatic expiration
+ * - Retry with configurable attempts and delay
+ *
+ * Note: In-memory locks are NOT distributed across instances.
+ * Use Redis-backed locks for multi-instance deployments.
+ *
+ * @packageDocumentation
+ */
+import type { ILockAdapter, LockOptions, LockResult } from './types.js';
+/**
+ * In-memory lock adapter implementation
+ */
+export declare class MemoryLockAdapter implements ILockAdapter {
+    private locks;
+    private cleanupTimer;
+    constructor();
+    /**
+     * Attempt to acquire a lock
+     */
+    acquire(key: string, options?: LockOptions): Promise<LockResult>;
+    /**
+     * Release a lock
+     */
+    release(key: string, lockId: string): Promise<boolean>;
+    /**
+     * Extend a lock's TTL
+     */
+    extend(key: string, lockId: string, additionalMs: number): Promise<boolean>;
+    /**
+     * Check if a lock is held (for debugging/monitoring)
+     */
+    isLocked(key: string): boolean;
+    /**
+     * Get the number of active locks (for monitoring)
+     */
+    get activeCount(): number;
+    /**
+     * Stop the background cleanup timer
+     */
+    stop(): void;
+    /**
+     * Start background cleanup of expired locks
+     */
+    private startCleanup;
+    /**
+     * Remove expired locks
+     */
+    private cleanupExpired;
+    /**
+     * Sleep helper for retry delays
+     */
+    private sleep;
+}
+/**
+ * Get the default memory lock adapter instance
+ */
+export declare function getMemoryLockAdapter(): ILockAdapter;
+/**
+ * Create a new memory lock adapter instance (for testing)
+ */
+export declare function createMemoryLockAdapter(): MemoryLockAdapter;
+/**
+ * Reset the default instance (for testing)
+ */
+export declare function resetMemoryLockAdapter(): void;
+//# sourceMappingURL=memory-lock.d.ts.map

package/dist/common/adapters/memory-lock.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-lock.d.ts","sourceRoot":"","sources":["../../../src/common/adapters/memory-lock.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAsBxE;;GAEG;AACH,qBAAa,iBAAkB,YAAW,YAAY;IACpD,OAAO,CAAC,KAAK,CAAgC;IAC7C,OAAO,CAAC,YAAY,CAA+B;;IAQnD;;OAEG;IACG,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC;IAgDtE;;OAEG;IACG,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IA6B5D;;OAEG;IACG,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAmCjF;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAe9B;;OAEG;IACH,IAAI,WAAW,IAAI,MAAM,CAGxB;IAED;;OAEG;IACH,IAAI,IAAI,IAAI;IAOZ;;OAEG;IACH,OAAO,CAAC,YAAY;IAUpB;;OAEG;IACH,OAAO,CAAC,cAAc;IAgBtB;;OAEG;IACH,OAAO,CAAC,KAAK;CAGd;AAOD;;GAEG;AACH,wBAAgB,oBAAoB,IAAI,YAAY,CAKnD;AAED;;GAEG;AACH,wBAAgB,uBAAuB,IAAI,iBAAiB,CAE3D;AAED;;GAEG;AACH,wBAAgB,sBAAsB,IAAI,IAAI,CAK7C"}

package/dist/common/adapters/memory-lock.js

@@ -0,0 +1,219 @@
+/**
+ * In-Memory Lock Adapter
+ *
+ * Provides a distributed locking implementation that runs entirely in memory,
+ * suitable for development, testing, or single-instance deployments.
+ *
+ * Features:
+ * - Lock storage with Map
+ * - Unique lock IDs for ownership verification
+ * - TTL with automatic expiration
+ * - Retry with configurable attempts and delay
+ *
+ * Note: In-memory locks are NOT distributed across instances.
+ * Use Redis-backed locks for multi-instance deployments.
+ *
+ * @packageDocumentation
+ */
+import { randomUUID } from 'node:crypto';
+import { createLogger } from '../logger.js';
+const logger = createLogger({ component: 'memory-lock' });
+/**
+ * Default lock options
+ */
+const DEFAULT_LOCK_OPTIONS = {
+    ttlMs: 30000, // 30 seconds
+    retryCount: 3,
+    retryDelayMs: 100,
+};
+/**
+ * In-memory lock adapter implementation
+ */
+export class MemoryLockAdapter {
+    locks = new Map();
+    cleanupTimer = null;
+    constructor() {
+        // Start background cleanup for expired locks
+        this.startCleanup();
+        logger.debug({}, 'Memory lock adapter created');
+    }
+    /**
+     * Attempt to acquire a lock
+     */
+    async acquire(key, options) {
+        const opts = { ...DEFAULT_LOCK_OPTIONS, ...options };
+        const lockId = randomUUID();
+        for (let attempt = 0; attempt <= opts.retryCount; attempt++) {
+            // Check if lock exists and is still valid
+            const existingLock = this.locks.get(key);
+            if (existingLock) {
+                // Check if expired
+                if (existingLock.expiresAt <= Date.now()) {
+                    // Expired, can take over
+                    this.locks.delete(key);
+                }
+                else {
+                    // Lock is held, retry if we have attempts left
+                    if (attempt < opts.retryCount) {
+                        await this.sleep(opts.retryDelayMs);
+                        continue;
+                    }
+                    logger.debug({ key, attempts: attempt + 1 }, 'Lock acquisition failed after retries');
+                    return { acquired: false };
+                }
+            }
+            // Acquire the lock
+            const entry = {
+                lockId,
+                key,
+                expiresAt: Date.now() + opts.ttlMs,
+            };
+            this.locks.set(key, entry);
+            logger.debug({ key, lockId, ttlMs: opts.ttlMs }, 'Lock acquired');
+            return { acquired: true, lockId };
+        }
+        return { acquired: false };
+    }
+    /**
+     * Release a lock
+     */
+    async release(key, lockId) {
+        const existingLock = this.locks.get(key);
+        if (!existingLock) {
+            logger.debug({ key, lockId }, 'Lock release failed: not found');
+            return false;
+        }
+        // Verify ownership
+        if (existingLock.lockId !== lockId) {
+            logger.debug({ key, lockId, actualLockId: existingLock.lockId }, 'Lock release failed: not owner');
+            return false;
+        }
+        // Check if expired (still return false as we don't own it anymore)
+        if (existingLock.expiresAt <= Date.now()) {
+            this.locks.delete(key);
+            logger.debug({ key, lockId }, 'Lock release failed: expired');
+            return false;
+        }
+        this.locks.delete(key);
+        logger.debug({ key, lockId }, 'Lock released');
+        return true;
+    }
+    /**
+     * Extend a lock's TTL
+     */
+    async extend(key, lockId, additionalMs) {
+        const existingLock = this.locks.get(key);
+        if (!existingLock) {
+            logger.debug({ key, lockId }, 'Lock extend failed: not found');
+            return false;
+        }
+        // Verify ownership
+        if (existingLock.lockId !== lockId) {
+            logger.debug({ key, lockId, actualLockId: existingLock.lockId }, 'Lock extend failed: not owner');
+            return false;
+        }
+        // Check if expired
+        if (existingLock.expiresAt <= Date.now()) {
+            this.locks.delete(key);
+            logger.debug({ key, lockId }, 'Lock extend failed: expired');
+            return false;
+        }
+        // Extend the TTL
+        existingLock.expiresAt = Date.now() + additionalMs;
+        logger.debug({ key, lockId, additionalMs }, 'Lock extended');
+        return true;
+    }
+    /**
+     * Check if a lock is held (for debugging/monitoring)
+     */
+    isLocked(key) {
+        const entry = this.locks.get(key);
+        if (!entry) {
+            return false;
+        }
+        // Check expiration
+        if (entry.expiresAt <= Date.now()) {
+            this.locks.delete(key);
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Get the number of active locks (for monitoring)
+     */
+    get activeCount() {
+        this.cleanupExpired();
+        return this.locks.size;
+    }
+    /**
+     * Stop the background cleanup timer
+     */
+    stop() {
+        if (this.cleanupTimer) {
+            clearInterval(this.cleanupTimer);
+            this.cleanupTimer = null;
+        }
+    }
+    /**
+     * Start background cleanup of expired locks
+     */
+    startCleanup() {
+        // Cleanup every 10 seconds
+        this.cleanupTimer = setInterval(() => {
+            this.cleanupExpired();
+        }, 10000);
+        // Don't block process exit
+        this.cleanupTimer.unref();
+    }
+    /**
+     * Remove expired locks
+     */
+    cleanupExpired() {
+        const now = Date.now();
+        let expiredCount = 0;
+        for (const [key, entry] of this.locks.entries()) {
+            if (entry.expiresAt <= now) {
+                this.locks.delete(key);
+                expiredCount++;
+            }
+        }
+        if (expiredCount > 0) {
+            logger.debug({ expiredCount }, 'Cleaned up expired locks');
+        }
+    }
+    /**
+     * Sleep helper for retry delays
+     */
+    sleep(ms) {
+        return new Promise(resolve => setTimeout(resolve, ms));
+    }
+}
+/**
+ * Singleton instance for default usage
+ */
+let defaultInstance = null;
+/**
+ * Get the default memory lock adapter instance
+ */
+export function getMemoryLockAdapter() {
+    if (!defaultInstance) {
+        defaultInstance = new MemoryLockAdapter();
+    }
+    return defaultInstance;
+}
+/**
+ * Create a new memory lock adapter instance (for testing)
+ */
+export function createMemoryLockAdapter() {
+    return new MemoryLockAdapter();
+}
+/**
+ * Reset the default instance (for testing)
+ */
+export function resetMemoryLockAdapter() {
+    if (defaultInstance) {
+        defaultInstance.stop();
+        defaultInstance = null;
+    }
+}
+//# sourceMappingURL=memory-lock.js.map

package/dist/common/adapters/memory-lock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-lock.js","sourceRoot":"","sources":["../../../src/common/adapters/memory-lock.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAG5C,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC;AAW1D;;GAEG;AACH,MAAM,oBAAoB,GAA0B;IAClD,KAAK,EAAE,KAAK,EAAE,aAAa;IAC3B,UAAU,EAAE,CAAC;IACb,YAAY,EAAE,GAAG;CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,iBAAiB;IACpB,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IACrC,YAAY,GAA0B,IAAI,CAAC;IAEnD;QACE,6CAA6C;QAC7C,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,6BAA6B,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,GAAW,EAAE,OAAqB;QAC9C,MAAM,IAAI,GAAG,EAAE,GAAG,oBAAoB,EAAE,GAAG,OAAO,EAAE,CAAC;QACrD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;QAE5B,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;YAC5D,0CAA0C;YAC1C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEzC,IAAI,YAAY,EAAE,CAAC;gBACjB,mBAAmB;gBACnB,IAAI,YAAY,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;oBACzC,yBAAyB;oBACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACN,+CAA+C;oBAC/C,IAAI,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;wBAC9B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;wBACpC,SAAS;oBACX,CAAC;oBAED,MAAM,CAAC,KAAK,CACV,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,GAAG,CAAC,EAAE,EAC9B,uCAAuC,CACxC,CAAC;oBACF,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;gBAC7B,CAAC;YACH,CAAC;YAED,mBAAmB;YACnB,MAAM,KAAK,GAAc;gBACvB,MAAM;gBACN,GAAG;gBACH,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK;aACnC,CAAC;YAEF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAE3B,MAAM,CAAC,KAAK,CACV,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAClC,eAAe,CAChB,CAAC;YAEF,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QACpC,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,GAAW,EAAE,MAAc;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEzC,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,gCAAgC,CAAC,CAAC;YAChE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mBAAmB;QACnB,IAAI,YAAY,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACnC,MAAM,CAAC,KAAK,CACV,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,CAAC,MAAM,EAAE,EAClD,gCAAgC,CACjC,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mEAAmE;QACnE,IAAI,YAAY,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,8BAA8B,CAAC,CAAC;YAC9D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,eAAe,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,GAAW,EAAE,MAAc,EAAE,YAAoB;QAC5D,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEzC,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,+BAA+B,CAAC,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mBAAmB;QACnB,IAAI,YAAY,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACnC,MAAM,CAAC,KAAK,CACV,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,CAAC,MAAM,EAAE,EAClD,+BAA+B,CAChC,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mBAAmB;QACnB,IAAI,YAAY,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,6BAA6B,CAAC,CAAC;YAC7D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,iBAAiB;QACjB,YAAY,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;QAEnD,MAAM,CAAC,KAAK,CACV,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,EAC7B,eAAe,CAChB,CAAC;QAEF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,GAAW;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mBAAmB;QACnB,IAAI,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,IAAI,WAAW;QACb,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACjC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,2BAA2B;QAC3B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE;YACnC,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,CAAC,EAAE,KAAK,CAAC,CAAC;QAEV,2BAA2B;QAC3B,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,IAAI,KAAK,CAAC,SAAS,IAAI,GAAG,EAAE,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACvB,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,EAAE,0BAA0B,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,EAAU;QACtB,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;CACF;AAED;;GAEG;AACH,IAAI,eAAe,GAA6B,IAAI,CAAC;AAErD;;GAEG;AACH,MAAM,UAAU,oBAAoB;IAClC,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,eAAe,GAAG,IAAI,iBAAiB,EAAE,CAAC;IAC5C,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB;IACrC,OAAO,IAAI,iBAAiB,EAAE,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB;IACpC,IAAI,eAAe,EAAE,CAAC;QACpB,eAAe,CAAC,IAAI,EAAE,CAAC;QACvB,eAAe,GAAG,IAAI,CAAC;IACzB,CAAC;AACH,CAAC"}

package/dist/common/adapters/memory-queue.d.ts

@@ -0,0 +1,64 @@
+/**
+ * In-Memory Queue Adapter
+ *
+ * Provides a queue implementation that runs entirely in memory,
+ * suitable for development, testing, or single-instance deployments.
+ *
+ * Features:
+ * - Job storage with Map
+ * - Async processing with setImmediate
+ * - Retry with exponential backoff
+ * - Job lifecycle tracking (waiting, active, completed, failed)
+ *
+ * @packageDocumentation
+ */
+import type { IQueueAdapter, QueueJobOptions, JobCounts, JobHandler } from './types.js';
+/**
+ * In-memory queue adapter implementation
+ */
+export declare class MemoryQueueAdapter implements IQueueAdapter {
+    private jobs;
+    private handlers;
+    private processing;
+    private closed;
+    private processTimer;
+    private readonly name;
+    constructor(name: string);
+    /**
+     * Add a job to the queue
+     */
+    add<T>(name: string, data: T, options?: QueueJobOptions): Promise<string>;
+    /**
+     * Register a job handler
+     */
+    process<T>(handler: JobHandler<T>): void;
+    /**
+     * Get job counts by status
+     */
+    getJobCounts(): Promise<JobCounts>;
+    /**
+     * Close the queue and stop processing
+     */
+    close(): Promise<void>;
+    /**
+     * Schedule job processing
+     */
+    private scheduleProcessing;
+    /**
+     * Process jobs in the queue
+     */
+    private processJobs;
+    /**
+     * Process a single job
+     */
+    private processJob;
+    /**
+     * Check if there are waiting jobs
+     */
+    private hasWaitingJobs;
+}
+/**
+ * Factory function to create a memory queue adapter
+ */
+export declare function createMemoryQueueAdapter(name: string): IQueueAdapter;
+//# sourceMappingURL=memory-queue.d.ts.map

package/dist/common/adapters/memory-queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-queue.d.ts","sourceRoot":"","sources":["../../../src/common/adapters/memory-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,KAAK,EACV,aAAa,EACb,eAAe,EACf,SAAS,EACT,UAAU,EAEX,MAAM,YAAY,CAAC;AA2BpB;;GAEG;AACH,qBAAa,kBAAmB,YAAW,aAAa;IACtD,OAAO,CAAC,IAAI,CAAkC;IAC9C,OAAO,CAAC,QAAQ,CAAoB;IACpC,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,YAAY,CAA+B;IACnD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;gBAElB,IAAI,EAAE,MAAM;IAKxB;;OAEG;IACG,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAkC/E;;OAEG;IACH,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAQxC;;OAEG;IACG,YAAY,IAAI,OAAO,CAAC,SAAS,CAAC;IAgBxC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAmB5B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAW1B;;OAEG;YACW,WAAW;IA4CzB;;OAEG;YACW,UAAU;IAsExB;;OAEG;IACH,OAAO,CAAC,cAAc;CAQvB;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAEpE"}

package/dist/common/adapters/memory-queue.js

@@ -0,0 +1,233 @@
+/**
+ * In-Memory Queue Adapter
+ *
+ * Provides a queue implementation that runs entirely in memory,
+ * suitable for development, testing, or single-instance deployments.
+ *
+ * Features:
+ * - Job storage with Map
+ * - Async processing with setImmediate
+ * - Retry with exponential backoff
+ * - Job lifecycle tracking (waiting, active, completed, failed)
+ *
+ * @packageDocumentation
+ */
+import { randomUUID } from 'node:crypto';
+import { createLogger } from '../logger.js';
+const logger = createLogger({ component: 'memory-queue' });
+/**
+ * Default job options
+ */
+const DEFAULT_JOB_OPTIONS = {
+    attempts: 3,
+    backoff: { type: 'exponential', delay: 1000 },
+};
+/**
+ * In-memory queue adapter implementation
+ */
+export class MemoryQueueAdapter {
+    jobs = new Map();
+    handlers = [];
+    processing = false;
+    closed = false;
+    processTimer = null;
+    name;
+    constructor(name) {
+        this.name = name;
+        logger.debug({ queueName: name }, 'Memory queue created');
+    }
+    /**
+     * Add a job to the queue
+     */
+    async add(name, data, options) {
+        if (this.closed) {
+            throw new Error('Queue is closed');
+        }
+        const jobId = options?.jobId ?? randomUUID();
+        const mergedOptions = { ...DEFAULT_JOB_OPTIONS, ...options };
+        const now = Date.now();
+        const delay = mergedOptions.delay ?? 0;
+        const job = {
+            id: jobId,
+            name,
+            data,
+            options: mergedOptions,
+            status: delay > 0 ? 'delayed' : 'waiting',
+            attemptsMade: 0,
+            createdAt: now,
+            processAt: now + delay,
+        };
+        this.jobs.set(jobId, job);
+        logger.debug({ queueName: this.name, jobId, jobName: name, delay }, 'Job added to queue');
+        // Trigger processing
+        this.scheduleProcessing();
+        return jobId;
+    }
+    /**
+     * Register a job handler
+     */
+    process(handler) {
+        this.handlers.push(handler);
+        logger.debug({ queueName: this.name }, 'Handler registered');
+        // Start processing if there are jobs
+        this.scheduleProcessing();
+    }
+    /**
+     * Get job counts by status
+     */
+    async getJobCounts() {
+        const counts = {
+            waiting: 0,
+            active: 0,
+            completed: 0,
+            failed: 0,
+            delayed: 0,
+        };
+        for (const job of this.jobs.values()) {
+            counts[job.status]++;
+        }
+        return counts;
+    }
+    /**
+     * Close the queue and stop processing
+     */
+    async close() {
+        this.closed = true;
+        if (this.processTimer) {
+            clearTimeout(this.processTimer);
+            this.processTimer = null;
+        }
+        // Wait for active jobs to complete (with timeout)
+        const startTime = Date.now();
+        const timeout = 5000;
+        while (this.processing && Date.now() - startTime < timeout) {
+            await new Promise(resolve => setTimeout(resolve, 100));
+        }
+        logger.debug({ queueName: this.name }, 'Memory queue closed');
+    }
+    /**
+     * Schedule job processing
+     */
+    scheduleProcessing() {
+        if (this.closed || this.processing || this.handlers.length === 0) {
+            return;
+        }
+        // Use setImmediate for async processing
+        this.processTimer = setTimeout(() => {
+            void this.processJobs();
+        }, 0);
+    }
+    /**
+     * Process jobs in the queue
+     */
+    async processJobs() {
+        if (this.closed || this.processing) {
+            return;
+        }
+        this.processing = true;
+        try {
+            const now = Date.now();
+            // Move delayed jobs to waiting if ready
+            for (const job of this.jobs.values()) {
+                if (job.status === 'delayed' && job.processAt <= now) {
+                    job.status = 'waiting';
+                }
+            }
+            // Find next waiting job
+            let nextJob = null;
+            let lowestPriority = Infinity;
+            for (const job of this.jobs.values()) {
+                if (job.status === 'waiting') {
+                    const priority = job.options.priority ?? 0;
+                    if (priority < lowestPriority) {
+                        lowestPriority = priority;
+                        nextJob = job;
+                    }
+                }
+            }
+            if (nextJob) {
+                await this.processJob(nextJob);
+            }
+        }
+        finally {
+            this.processing = false;
+            // Continue processing if there are more jobs
+            if (!this.closed && this.hasWaitingJobs()) {
+                this.scheduleProcessing();
+            }
+        }
+    }
+    /**
+     * Process a single job
+     */
+    async processJob(job) {
+        job.status = 'active';
+        job.attemptsMade++;
+        const jobObj = {
+            id: job.id,
+            data: job.data,
+            attemptsMade: job.attemptsMade,
+        };
+        logger.debug({ queueName: this.name, jobId: job.id, attempt: job.attemptsMade }, 'Processing job');
+        try {
+            // Run all handlers
+            for (const handler of this.handlers) {
+                await handler(jobObj);
+            }
+            job.status = 'completed';
+            logger.debug({ queueName: this.name, jobId: job.id }, 'Job completed');
+            // Clean up completed jobs after a delay
+            setTimeout(() => {
+                if (job.status === 'completed') {
+                    this.jobs.delete(job.id);
+                }
+            }, 60000); // Keep for 1 minute
+        }
+        catch (error) {
+            job.error = error instanceof Error ? error : new Error(String(error));
+            const maxAttempts = job.options.attempts ?? 3;
+            if (job.attemptsMade >= maxAttempts) {
+                job.status = 'failed';
+                logger.error({ queueName: this.name, jobId: job.id, error: job.error.message }, 'Job failed after max retries');
+            }
+            else {
+                // Schedule retry with backoff
+                const backoff = job.options.backoff ?? { type: 'exponential', delay: 1000 };
+                let delay;
+                if (backoff.type === 'exponential') {
+                    delay = backoff.delay * Math.pow(2, job.attemptsMade - 1);
+                }
+                else {
+                    delay = backoff.delay;
+                }
+                job.status = 'delayed';
+                job.processAt = Date.now() + delay;
+                logger.debug({ queueName: this.name, jobId: job.id, retryIn: delay }, 'Job scheduled for retry');
+                // Schedule delayed processing
+                setTimeout(() => {
+                    if (!this.closed) {
+                        this.scheduleProcessing();
+                    }
+                }, delay);
+            }
+        }
+    }
+    /**
+     * Check if there are waiting jobs
+     */
+    hasWaitingJobs() {
+        for (const job of this.jobs.values()) {
+            if (job.status === 'waiting') {
+                return true;
+            }
+        }
+        return false;
+    }
+}
+/**
+ * Factory function to create a memory queue adapter
+ */
+export function createMemoryQueueAdapter(name) {
+    return new MemoryQueueAdapter(name);
+}
+//# sourceMappingURL=memory-queue.js.map

package/dist/common/adapters/memory-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-queue.js","sourceRoot":"","sources":["../../../src/common/adapters/memory-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAS5C,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC,CAAC;AAiB3D;;GAEG;AACH,MAAM,mBAAmB,GAAoB;IAC3C,QAAQ,EAAE,CAAC;IACX,OAAO,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,IAAI,EAAE;CAC9C,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,kBAAkB;IACrB,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IACtC,QAAQ,GAAiB,EAAE,CAAC;IAC5B,UAAU,GAAG,KAAK,CAAC;IACnB,MAAM,GAAG,KAAK,CAAC;IACf,YAAY,GAA0B,IAAI,CAAC;IAClC,IAAI,CAAS;IAE9B,YAAY,IAAY;QACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,sBAAsB,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAI,IAAY,EAAE,IAAO,EAAE,OAAyB;QAC3D,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,UAAU,EAAE,CAAC;QAC7C,MAAM,aAAa,GAAG,EAAE,GAAG,mBAAmB,EAAE,GAAG,OAAO,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,IAAI,CAAC,CAAC;QAEvC,MAAM,GAAG,GAAmB;YAC1B,EAAE,EAAE,KAAK;YACT,IAAI;YACJ,IAAI;YACJ,OAAO,EAAE,aAAa;YACtB,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YACzC,YAAY,EAAE,CAAC;YACf,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG,GAAG,KAAK;SACvB,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAE1B,MAAM,CAAC,KAAK,CACV,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EACrD,oBAAoB,CACrB,CAAC;QAEF,qBAAqB;QACrB,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAE1B,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,OAAO,CAAI,OAAsB;QAC/B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAqB,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,oBAAoB,CAAC,CAAC;QAE7D,qCAAqC;QACrC,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY;QAChB,MAAM,MAAM,GAAc;YACxB,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,CAAC;YACT,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;SACX,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACvB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;QAED,kDAAkD;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC;QAErB,OAAO,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,OAAO,EAAE,CAAC;YAC3D,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,qBAAqB,CAAC,CAAC;IAChE,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjE,OAAO;QACT,CAAC;QAED,wCAAwC;QACxC,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC,GAAG,EAAE;YAClC,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;QAC1B,CAAC,EAAE,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW;QACvB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QAEvB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAEvB,wCAAwC;YACxC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACrC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,GAAG,CAAC,SAAS,IAAI,GAAG,EAAE,CAAC;oBACrD,GAAG,CAAC,MAAM,GAAG,SAAS,CAAC;gBACzB,CAAC;YACH,CAAC;YAED,wBAAwB;YACxB,IAAI,OAAO,GAAuB,IAAI,CAAC;YACvC,IAAI,cAAc,GAAG,QAAQ,CAAC;YAE9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACrC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;oBAC3C,IAAI,QAAQ,GAAG,cAAc,EAAE,CAAC;wBAC9B,cAAc,GAAG,QAAQ,CAAC;wBAC1B,OAAO,GAAG,GAAG,CAAC;oBAChB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YAExB,6CAA6C;YAC7C,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;gBAC1C,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,GAAgB;QACvC,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC;QACtB,GAAG,CAAC,YAAY,EAAE,CAAC;QAEnB,MAAM,MAAM,GAAQ;YAClB,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,YAAY,EAAE,GAAG,CAAC,YAAY;SAC/B,CAAC;QAEF,MAAM,CAAC,KAAK,CACV,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,YAAY,EAAE,EAClE,gBAAgB,CACjB,CAAC;QAEF,IAAI,CAAC;YACH,mBAAmB;YACnB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;YAED,GAAG,CAAC,MAAM,GAAG,WAAW,CAAC;YACzB,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;YAEvE,wCAAwC;YACxC,UAAU,CAAC,GAAG,EAAE;gBACd,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,oBAAoB;QACjC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,GAAG,CAAC,KAAK,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAEtE,MAAM,WAAW,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;YAE9C,IAAI,GAAG,CAAC,YAAY,IAAI,WAAW,EAAE,CAAC;gBACpC,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC;gBACtB,MAAM,CAAC,KAAK,CACV,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,EACjE,8BAA8B,CAC/B,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,8BAA8B;gBAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;gBAC5E,IAAI,KAAa,CAAC;gBAElB,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;oBACnC,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;gBAC5D,CAAC;qBAAM,CAAC;oBACN,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;gBACxB,CAAC;gBAED,GAAG,CAAC,MAAM,GAAG,SAAS,CAAC;gBACvB,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;gBAEnC,MAAM,CAAC,KAAK,CACV,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EACvD,yBAAyB,CAC1B,CAAC;gBAEF,8BAA8B;gBAC9B,UAAU,CAAC,GAAG,EAAE;oBACd,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;wBACjB,IAAI,CAAC,kBAAkB,EAAE,CAAC;oBAC5B,CAAC;gBACH,CAAC,EAAE,KAAK,CAAC,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAAY;IACnD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC"}