atomic-queues 2.2.0 → 3.0.0

package/dist/wal/wal.service.js

@@ -0,0 +1,243 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.WalService = void 0;
+const common_1 = require("@nestjs/common");
+const utils_1 = require("../utils");
+const wal_scripts_1 = require("./wal.scripts");
+/**
+ * Write-Ahead Log service.
+ *
+ * Constructed via factory in the module (not via DI injection decorators)
+ * because it needs a serverId that's generated at startup.
+ */
+class WalService {
+    constructor(redis, config, serverId) {
+        this.redis = redis;
+        this.config = config;
+        this.logger = new common_1.Logger(WalService.name);
+        this.cleanupTimer = null;
+        this.deadLetterCallbacks = [];
+        this.keyPrefix = (0, utils_1.resolveKeyPrefix)(config);
+        this.serverId = serverId;
+        this.entryTTL = config.wal?.entryTTL ?? 86400;
+        this.cleanupInterval = config.wal?.cleanupInterval ?? 5000;
+    }
+    // =========================================================================
+    // KEY HELPERS
+    // =========================================================================
+    walEntryKey(entityKey, messageId) {
+        return `${this.keyPrefix}:wal:${this.serverId}:${entityKey}:${messageId}`;
+    }
+    walIndexKey() {
+        return `${this.keyPrefix}:wal:${this.serverId}:index`;
+    }
+    deadLetterKey(entityType) {
+        return `${this.keyPrefix}:dead:${entityType}`;
+    }
+    // =========================================================================
+    // WRITE — enqueue a message to the WAL
+    // =========================================================================
+    async write(entityKey, message) {
+        const entryKey = this.walEntryKey(entityKey, message.id);
+        const indexKey = this.walIndexKey();
+        const indexMember = `${entityKey}:${message.id}`;
+        const entry = {
+            state: 'enqueued',
+            message: JSON.stringify(message),
+            entity_key: entityKey,
+            enqueued_at: message.enqueuedAt.toString(),
+            correlation_id: message.correlationId ?? '',
+            server_id: this.serverId,
+        };
+        const pipeline = this.redis.pipeline();
+        pipeline.hset(entryKey, entry);
+        pipeline.expire(entryKey, this.entryTTL);
+        pipeline.zadd(indexKey, message.enqueuedAt, indexMember);
+        await pipeline.exec();
+    }
+    // =========================================================================
+    // STATE TRANSITIONS — atomic via Lua scripts
+    // =========================================================================
+    async markDispatched(entityKey, messageId, workerId) {
+        const entryKey = this.walEntryKey(entityKey, messageId);
+        const result = (await this.redis.eval(wal_scripts_1.DISPATCH_SCRIPT, 1, entryKey, Date.now().toString(), workerId.toString()));
+        return result === 1;
+    }
+    async markCompleted(entityKey, messageId) {
+        const entryKey = this.walEntryKey(entityKey, messageId);
+        const indexKey = this.walIndexKey();
+        const indexMember = `${entityKey}:${messageId}`;
+        const result = (await this.redis.eval(wal_scripts_1.COMPLETE_SCRIPT, 2, entryKey, indexKey, Date.now().toString(), indexMember));
+        return result === 1;
+    }
+    async markFailed(entityKey, messageId, error, stack) {
+        const entryKey = this.walEntryKey(entityKey, messageId);
+        const result = (await this.redis.eval(wal_scripts_1.FAIL_SCRIPT, 1, entryKey, Date.now().toString(), error, stack ?? ''));
+        return result === 1;
+    }
+    async markInterrupted(entityKey, messageId, reason) {
+        const entryKey = this.walEntryKey(entityKey, messageId);
+        const result = (await this.redis.eval(wal_scripts_1.INTERRUPT_SCRIPT, 1, entryKey, Date.now().toString(), reason));
+        return result === 1;
+    }
+    // =========================================================================
+    // READ — get a WAL entry
+    // =========================================================================
+    async getEntry(entityKey, messageId) {
+        const entryKey = this.walEntryKey(entityKey, messageId);
+        const raw = await this.redis.hgetall(entryKey);
+        if (!raw || !raw.state)
+            return null;
+        return {
+            messageId,
+            state: raw.state,
+            message: JSON.parse(raw.message),
+            entityKey: raw.entity_key,
+            serverId: raw.server_id,
+            enqueuedAt: parseInt(raw.enqueued_at, 10),
+            dispatchedAt: raw.dispatched_at ? parseInt(raw.dispatched_at, 10) : undefined,
+            completedAt: raw.completed_at ? parseInt(raw.completed_at, 10) : undefined,
+            error: raw.error || undefined,
+            errorStack: raw.error_stack || undefined,
+            correlationId: raw.correlation_id || undefined,
+            workerId: raw.worker_id ? parseInt(raw.worker_id, 10) : undefined,
+        };
+    }
+    // =========================================================================
+    // RECOVERY — run on startup to resolve orphaned entries
+    // =========================================================================
+    async recover() {
+        const indexKey = this.walIndexKey();
+        const members = await this.redis.zrange(indexKey, 0, -1);
+        let reEnqueued = 0;
+        let interrupted = 0;
+        let cleaned = 0;
+        for (const member of members) {
+            const parts = member.split(':');
+            const messageId = parts[parts.length - 1];
+            const entityKey = parts.slice(0, -1).join(':');
+            const entry = await this.getEntry(entityKey, messageId);
+            if (!entry) {
+                await this.redis.zrem(indexKey, member);
+                cleaned++;
+                continue;
+            }
+            switch (entry.state) {
+                case 'enqueued':
+                    reEnqueued++;
+                    break;
+                case 'dispatched': {
+                    await this.deadLetter(entry.message.entityType, entry.message, 'interrupted: process crashed during execution');
+                    interrupted++;
+                    const entryKey = this.walEntryKey(entityKey, messageId);
+                    await this.redis.del(entryKey);
+                    await this.redis.zrem(indexKey, member);
+                    break;
+                }
+                case 'completed':
+                case 'failed':
+                case 'interrupted': {
+                    const entryKey = this.walEntryKey(entityKey, messageId);
+                    await this.redis.del(entryKey);
+                    await this.redis.zrem(indexKey, member);
+                    cleaned++;
+                    break;
+                }
+            }
+        }
+        this.logger.log(`WAL recovery: ${reEnqueued} re-enqueued, ${interrupted} interrupted, ${cleaned} cleaned`);
+        return { reEnqueued, interrupted, cleaned };
+    }
+    /**
+     * Returns the messages that should be re-enqueued after recovery.
+     * Called by the recovery procedure to get pending messages.
+     */
+    async getPendingMessages() {
+        const indexKey = this.walIndexKey();
+        const members = await this.redis.zrange(indexKey, 0, -1);
+        const pending = [];
+        for (const member of members) {
+            const parts = member.split(':');
+            const messageId = parts[parts.length - 1];
+            const entityKey = parts.slice(0, -1).join(':');
+            const entry = await this.getEntry(entityKey, messageId);
+            if (entry && entry.state === 'enqueued') {
+                pending.push(entry.message);
+            }
+        }
+        return pending;
+    }
+    // =========================================================================
+    // DEAD LETTER
+    // =========================================================================
+    onDeadLetter(callback) {
+        this.deadLetterCallbacks.push(callback);
+    }
+    async deadLetter(entityType, message, reason) {
+        const deadKey = this.deadLetterKey(entityType);
+        await this.redis.lpush(deadKey, JSON.stringify({
+            ...message,
+            deadLetteredAt: Date.now(),
+            deadLetterReason: reason,
+        }));
+        this.logger.warn(`Dead-lettered ${message.name} for ${entityType}:${message.entityId}: ${reason}`);
+        for (const cb of this.deadLetterCallbacks) {
+            try {
+                cb(entityType, message, reason);
+            }
+            catch {
+                /* subscriber errors don't propagate */
+            }
+        }
+    }
+    async getDeadLetters(entityType, limit = 100) {
+        const deadKey = this.deadLetterKey(entityType);
+        const raw = await this.redis.lrange(deadKey, 0, limit - 1);
+        return raw.map((r) => JSON.parse(r));
+    }
+    // =========================================================================
+    // CLEANUP
+    // =========================================================================
+    startCleanup() {
+        if (this.cleanupTimer)
+            return;
+        this.cleanupTimer = setInterval(() => {
+            this.cleanup().catch((err) => {
+                this.logger.error(`WAL cleanup error: ${err.message}`);
+            });
+        }, this.cleanupInterval);
+    }
+    stopCleanup() {
+        if (this.cleanupTimer) {
+            clearInterval(this.cleanupTimer);
+            this.cleanupTimer = null;
+        }
+    }
+    async cleanup() {
+        const indexKey = this.walIndexKey();
+        const staleThreshold = Date.now() - this.entryTTL * 1000;
+        const members = await this.redis.zrangebyscore(indexKey, 0, staleThreshold);
+        if (members.length === 0)
+            return;
+        let cleaned = 0;
+        for (const member of members) {
+            const parts = member.split(':');
+            const messageId = parts[parts.length - 1];
+            const entityKey = parts.slice(0, -1).join(':');
+            const entryKey = this.walEntryKey(entityKey, messageId);
+            const state = await this.redis.hget(entryKey, 'state');
+            if (!state || state === 'completed' || state === 'failed' || state === 'interrupted') {
+                const pipeline = this.redis.pipeline();
+                pipeline.del(entryKey);
+                pipeline.zrem(indexKey, member);
+                await pipeline.exec();
+                cleaned++;
+            }
+        }
+        if (cleaned > 0) {
+            this.logger.debug(`WAL cleanup: removed ${cleaned} entries`);
+        }
+    }
+}
+exports.WalService = WalService;
+//# sourceMappingURL=wal.service.js.map

package/dist/wal/wal.service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wal.service.js","sourceRoot":"","sources":["../../src/wal/wal.service.ts"],"names":[],"mappings":";;;AAAA,2CAAwC;AAGxC,oCAA4C;AAE5C,+CAAgG;AAEhG;;;;;GAKG;AACH,MAAa,UAAU;IAWrB,YACmB,KAAY,EACZ,MAAgD,EACjE,QAAgB;QAFC,UAAK,GAAL,KAAK,CAAO;QACZ,WAAM,GAAN,MAAM,CAA0C;QAZlD,WAAM,GAAG,IAAI,eAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAK9C,iBAAY,GAA0B,IAAI,CAAC;QAClC,wBAAmB,GAEhC,EAAE,CAAC;QAOL,IAAI,CAAC,SAAS,GAAG,IAAA,wBAAgB,EAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,EAAE,QAAQ,IAAI,KAAK,CAAC;QAC9C,IAAI,CAAC,eAAe,GAAG,MAAM,CAAC,GAAG,EAAE,eAAe,IAAI,IAAI,CAAC;IAC7D,CAAC;IAED,4EAA4E;IAC5E,cAAc;IACd,4EAA4E;IAE5E,WAAW,CAAC,SAAiB,EAAE,SAAiB;QAC9C,OAAO,GAAG,IAAI,CAAC,SAAS,QAAQ,IAAI,CAAC,QAAQ,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;IAC5E,CAAC;IAED,WAAW;QACT,OAAO,GAAG,IAAI,CAAC,SAAS,QAAQ,IAAI,CAAC,QAAQ,QAAQ,CAAC;IACxD,CAAC;IAED,aAAa,CAAC,UAAkB;QAC9B,OAAO,GAAG,IAAI,CAAC,SAAS,SAAS,UAAU,EAAE,CAAC;IAChD,CAAC;IAED,4EAA4E;IAC5E,uCAAuC;IACvC,4EAA4E;IAE5E,KAAK,CAAC,KAAK,CAAC,SAAiB,EAAE,OAA2B;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,GAAG,SAAS,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;QAEjD,MAAM,KAAK,GAA2B;YACpC,KAAK,EAAE,UAAU;YACjB,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YAChC,UAAU,EAAE,SAAS;YACrB,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE;YAC1C,cAAc,EAAE,OAAO,CAAC,aAAa,IAAI,EAAE;YAC3C,SAAS,EAAE,IAAI,CAAC,QAAQ;SACzB,CAAC;QAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACvC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC/B,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACzD,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,4EAA4E;IAC5E,6CAA6C;IAC7C,4EAA4E;IAE5E,KAAK,CAAC,cAAc,CAAC,SAAiB,EAAE,SAAiB,EAAE,QAAgB;QACzE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CACnC,6BAAe,EACf,CAAC,EACD,QAAQ,EACR,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,EACrB,QAAQ,CAAC,QAAQ,EAAE,CACpB,CAAW,CAAC;QACb,OAAO,MAAM,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,SAAiB,EAAE,SAAiB;QACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,GAAG,SAAS,IAAI,SAAS,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CACnC,6BAAe,EACf,CAAC,EACD,QAAQ,EACR,QAAQ,EACR,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,EACrB,WAAW,CACZ,CAAW,CAAC;QACb,OAAO,MAAM,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,UAAU,CACd,SAAiB,EACjB,SAAiB,EACjB,KAAa,EACb,KAAc;QAEd,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CACnC,yBAAW,EACX,CAAC,EACD,QAAQ,EACR,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,EACrB,KAAK,EACL,KAAK,IAAI,EAAE,CACZ,CAAW,CAAC;QACb,OAAO,MAAM,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,SAAiB,EAAE,SAAiB,EAAE,MAAc;QACxE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CACnC,8BAAgB,EAChB,CAAC,EACD,QAAQ,EACR,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,EACrB,MAAM,CACP,CAAW,CAAC;QACb,OAAO,MAAM,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,4EAA4E;IAC5E,yBAAyB;IACzB,4EAA4E;IAE5E,KAAK,CAAC,QAAQ,CAAC,SAAiB,EAAE,SAAiB;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QAEpC,OAAO;YACL,SAAS;YACT,KAAK,EAAE,GAAG,CAAC,KAAiB;YAC5B,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;YAChC,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC;YACzC,YAAY,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;YAC7E,WAAW,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;YAC1E,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,SAAS;YAC7B,UAAU,EAAE,GAAG,CAAC,WAAW,IAAI,SAAS;YACxC,aAAa,EAAE,GAAG,CAAC,cAAc,IAAI,SAAS;YAC9C,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;SAClE,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,wDAAwD;IACxD,4EAA4E;IAE5E,KAAK,CAAC,OAAO;QACX,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEzD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAE/C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBACxC,OAAO,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YAED,QAAQ,KAAK,CAAC,KAAK,EAAE,CAAC;gBACpB,KAAK,UAAU;oBACb,UAAU,EAAE,CAAC;oBACb,MAAM;gBAER,KAAK,YAAY,CAAC,CAAC,CAAC;oBAClB,MAAM,IAAI,CAAC,UAAU,CACnB,KAAK,CAAC,OAAO,CAAC,UAAU,EACxB,KAAK,CAAC,OAAO,EACb,+CAA+C,CAChD,CAAC;oBACF,WAAW,EAAE,CAAC;oBAEd,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACxD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC/B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;oBACxC,MAAM;gBACR,CAAC;gBAED,KAAK,WAAW,CAAC;gBACjB,KAAK,QAAQ,CAAC;gBACd,KAAK,aAAa,CAAC,CAAC,CAAC;oBACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACxD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC/B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;oBACxC,OAAO,EAAE,CAAC;oBACV,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,GAAG,CACb,iBAAiB,UAAU,iBAAiB,WAAW,iBAAiB,OAAO,UAAU,CAC1F,CAAC;QAEF,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;IAC9C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,kBAAkB;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,OAAO,GAAyB,EAAE,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAE/C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxD,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4EAA4E;IAC5E,cAAc;IACd,4EAA4E;IAE5E,YAAY,CACV,QAAmF;QAEnF,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,UAAkB,EAAE,OAA2B,EAAE,MAAc;QAC9E,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CACpB,OAAO,EACP,IAAI,CAAC,SAAS,CAAC;YACb,GAAG,OAAO;YACV,cAAc,EAAE,IAAI,CAAC,GAAG,EAAE;YAC1B,gBAAgB,EAAE,MAAM;SACzB,CAAC,CACH,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,iBAAiB,OAAO,CAAC,IAAI,QAAQ,UAAU,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,EAAE,CACjF,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC1C,IAAI,CAAC;gBACH,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAClC,CAAC;YAAC,MAAM,CAAC;gBACP,uCAAuC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,UAAkB,EAAE,KAAK,GAAG,GAAG;QAClD,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3D,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,4EAA4E;IAC5E,UAAU;IACV,4EAA4E;IAE5E,YAAY;QACV,IAAI,IAAI,CAAC,YAAY;YAAE,OAAO;QAC9B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE;YACnC,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;gBAC3B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,sBAAuB,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;IAC3B,CAAC;IAED,WAAW;QACT,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;IAEO,KAAK,CAAC,OAAO;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACzD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;QAE5E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEjC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAE/C,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAEvD,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,WAAW,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;gBACrF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACvC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAChC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACtB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,wBAAwB,OAAO,UAAU,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;CACF;AAjUD,gCAiUC"}

package/dist/wal/wal.types.d.ts

@@ -0,0 +1,23 @@
+import { ISerializedMessage, IWalConfig } from '../domain';
+export type WalState = 'enqueued' | 'dispatched' | 'completed' | 'failed' | 'interrupted';
+export interface IWalEntry {
+    messageId: string;
+    state: WalState;
+    message: ISerializedMessage;
+    entityKey: string;
+    serverId: string;
+    enqueuedAt: number;
+    dispatchedAt?: number;
+    completedAt?: number;
+    error?: string;
+    errorStack?: string;
+    correlationId?: string;
+    workerId?: number;
+}
+export { IWalConfig };
+export interface IWalRecoveryResult {
+    reEnqueued: number;
+    interrupted: number;
+    cleaned: number;
+}
+//# sourceMappingURL=wal.types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"wal.types.d.ts","sourceRoot":"","sources":["../../src/wal/wal.types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE3D,MAAM,MAAM,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa,CAAC;AAE1F,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,QAAQ,CAAC;IAChB,OAAO,EAAE,kBAAkB,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,OAAO,EAAE,UAAU,EAAE,CAAC;AAEtB,MAAM,WAAW,kBAAkB;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;CACjB"}

package/dist/wal/wal.types.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=wal.types.js.map

package/dist/wal/wal.types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wal.types.js","sourceRoot":"","sources":["../../src/wal/wal.types.ts"],"names":[],"mappings":""}

package/dist/workers/consistent-hash.d.ts

@@ -0,0 +1,97 @@
+/**
+ * MurmurHash3 (32-bit) — deterministic, fast, excellent distribution.
+ * Pure JS implementation, no dependencies.
+ */
+export declare function murmurhash3(key: string, seed?: number): number;
+/**
+ * A node on the consistent hash ring.
+ */
+export interface HashRingNode<T = unknown> {
+    /** Unique identifier for this node (e.g. workerId, serverId) */
+    id: string;
+    /** Arbitrary metadata attached to the node */
+    data: T;
+}
+/**
+ * Consistent hash ring with virtual nodes.
+ *
+ * Provides O(log n) lookups and minimizes entity reassignment
+ * when nodes are added or removed (~1/N entities move).
+ *
+ * @example
+ * ```typescript
+ * const ring = new ConsistentHashRing<number>(150);
+ * ring.addNode({ id: 'worker-0', data: 0 });
+ * ring.addNode({ id: 'worker-1', data: 1 });
+ *
+ * const owner = ring.getNode('account:a-123');
+ * // owner.data === 0 or 1 (deterministic for same key)
+ * ```
+ */
+export declare class ConsistentHashRing<T = unknown> {
+    private ring;
+    private readonly nodes;
+    private readonly virtualNodesPerNode;
+    constructor(virtualNodesPerNode?: number);
+    /**
+     * Add a node to the ring with its virtual nodes.
+     * If a node with this ID already exists, it is replaced.
+     */
+    addNode(node: HashRingNode<T>): void;
+    /**
+     * Remove a node and all its virtual nodes from the ring.
+     */
+    removeNode(nodeId: string): void;
+    /**
+     * Get the node that owns the given key.
+     * Returns null if the ring is empty.
+     *
+     * Uses binary search to find the first virtual node
+     * whose hash is >= the key's hash (clockwise walk).
+     */
+    getNode(key: string): HashRingNode<T> | null;
+    /**
+     * Get the node that owns the given key, but only consider nodes
+     * that pass the filter. Walks clockwise until a matching node is found.
+     *
+     * Useful for entity-type affinity: skip nodes that don't handle
+     * the entity type.
+     *
+     * Returns null if no matching node exists.
+     */
+    getNodeFiltered(key: string, filter: (node: HashRingNode<T>) => boolean): HashRingNode<T> | null;
+    /**
+     * Check if a specific node owns the given key.
+     */
+    isOwner(nodeId: string, key: string): boolean;
+    /**
+     * Get all node IDs currently in the ring.
+     */
+    getNodeIds(): string[];
+    /**
+     * Get the number of physical nodes in the ring.
+     */
+    get size(): number;
+    /**
+     * Check if a node exists in the ring.
+     */
+    hasNode(nodeId: string): boolean;
+    /**
+     * Get a node by its ID.
+     */
+    getNodeById(nodeId: string): HashRingNode<T> | null;
+    /**
+     * Compute which keys from the given set would be reassigned
+     * if a node were added or removed.
+     *
+     * Returns a map of key → new owner node ID.
+     */
+    computeReassignment(keys: Iterable<string>, operation: {
+        type: 'add';
+        node: HashRingNode<T>;
+    } | {
+        type: 'remove';
+        nodeId: string;
+    }): Map<string, string>;
+}
+//# sourceMappingURL=consistent-hash.d.ts.map

package/dist/workers/consistent-hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consistent-hash.d.ts","sourceRoot":"","sources":["../../src/workers/consistent-hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,MAAM,CAiDzD;AAED;;GAEG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,GAAG,OAAO;IACvC,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX,8CAA8C;IAC9C,IAAI,EAAE,CAAC,CAAC;CACT;AAQD;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,kBAAkB,CAAC,CAAC,GAAG,OAAO;IACzC,OAAO,CAAC,IAAI,CAAwB;IACpC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAsC;IAC5D,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAS;gBAEjC,mBAAmB,SAAM;IAIrC;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAmBpC;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAKhC;;;;;;OAMG;IACH,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAyB5C;;;;;;;;OAQG;IACH,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAoChG;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO;IAK7C;;OAEG;IACH,UAAU,IAAI,MAAM,EAAE;IAItB;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIhC;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI;IAInD;;;;;OAKG;IACH,mBAAmB,CACjB,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,EACtB,SAAS,EAAE;QAAE,IAAI,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAA;KAAE,GAAG;QAAE,IAAI,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GACrF,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;CA0BvB"}

package/dist/workers/consistent-hash.js

@@ -0,0 +1,231 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ConsistentHashRing = void 0;
+exports.murmurhash3 = murmurhash3;
+/**
+ * MurmurHash3 (32-bit) — deterministic, fast, excellent distribution.
+ * Pure JS implementation, no dependencies.
+ */
+function murmurhash3(key, seed = 0) {
+    let h1 = seed >>> 0;
+    const len = key.length;
+    const nblocks = len >> 2;
+    const c1 = 0xcc9e2d51;
+    const c2 = 0x1b873593;
+    // Body
+    for (let i = 0; i < nblocks; i++) {
+        let k1 = (key.charCodeAt(i * 4) & 0xff) |
+            ((key.charCodeAt(i * 4 + 1) & 0xff) << 8) |
+            ((key.charCodeAt(i * 4 + 2) & 0xff) << 16) |
+            ((key.charCodeAt(i * 4 + 3) & 0xff) << 24);
+        k1 = Math.imul(k1, c1);
+        k1 = (k1 << 15) | (k1 >>> 17);
+        k1 = Math.imul(k1, c2);
+        h1 ^= k1;
+        h1 = (h1 << 13) | (h1 >>> 19);
+        h1 = Math.imul(h1, 5) + 0xe6546b64;
+    }
+    // Tail
+    const tail = nblocks * 4;
+    let k1 = 0;
+    const remainder = len & 3;
+    if (remainder >= 3)
+        k1 ^= (key.charCodeAt(tail + 2) & 0xff) << 16;
+    if (remainder >= 2)
+        k1 ^= (key.charCodeAt(tail + 1) & 0xff) << 8;
+    if (remainder >= 1) {
+        k1 ^= key.charCodeAt(tail) & 0xff;
+        k1 = Math.imul(k1, c1);
+        k1 = (k1 << 15) | (k1 >>> 17);
+        k1 = Math.imul(k1, c2);
+        h1 ^= k1;
+    }
+    // Finalization
+    h1 ^= len;
+    h1 ^= h1 >>> 16;
+    h1 = Math.imul(h1, 0x85ebca6b);
+    h1 ^= h1 >>> 13;
+    h1 = Math.imul(h1, 0xc2b2ae35);
+    h1 ^= h1 >>> 16;
+    return h1 >>> 0;
+}
+/**
+ * Consistent hash ring with virtual nodes.
+ *
+ * Provides O(log n) lookups and minimizes entity reassignment
+ * when nodes are added or removed (~1/N entities move).
+ *
+ * @example
+ * ```typescript
+ * const ring = new ConsistentHashRing<number>(150);
+ * ring.addNode({ id: 'worker-0', data: 0 });
+ * ring.addNode({ id: 'worker-1', data: 1 });
+ *
+ * const owner = ring.getNode('account:a-123');
+ * // owner.data === 0 or 1 (deterministic for same key)
+ * ```
+ */
+class ConsistentHashRing {
+    constructor(virtualNodesPerNode = 150) {
+        this.ring = [];
+        this.nodes = new Map();
+        this.virtualNodesPerNode = virtualNodesPerNode;
+    }
+    /**
+     * Add a node to the ring with its virtual nodes.
+     * If a node with this ID already exists, it is replaced.
+     */
+    addNode(node) {
+        if (this.nodes.has(node.id)) {
+            this.removeNode(node.id);
+        }
+        this.nodes.set(node.id, node);
+        for (let i = 0; i < this.virtualNodesPerNode; i++) {
+            const key = `${node.id}:vnode:${i}`;
+            this.ring.push({
+                hash: murmurhash3(key),
+                nodeId: node.id,
+                data: node.data,
+            });
+        }
+        this.ring.sort((a, b) => a.hash - b.hash);
+    }
+    /**
+     * Remove a node and all its virtual nodes from the ring.
+     */
+    removeNode(nodeId) {
+        this.nodes.delete(nodeId);
+        this.ring = this.ring.filter((vn) => vn.nodeId !== nodeId);
+    }
+    /**
+     * Get the node that owns the given key.
+     * Returns null if the ring is empty.
+     *
+     * Uses binary search to find the first virtual node
+     * whose hash is >= the key's hash (clockwise walk).
+     */
+    getNode(key) {
+        if (this.ring.length === 0)
+            return null;
+        const hash = murmurhash3(key);
+        // Binary search for first virtual node with hash >= key hash
+        let lo = 0;
+        let hi = this.ring.length;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if (this.ring[mid].hash < hash) {
+                lo = mid + 1;
+            }
+            else {
+                hi = mid;
+            }
+        }
+        // Wrap around to the first node if we're past the end
+        const idx = lo < this.ring.length ? lo : 0;
+        const vnode = this.ring[idx];
+        return this.nodes.get(vnode.nodeId) ?? null;
+    }
+    /**
+     * Get the node that owns the given key, but only consider nodes
+     * that pass the filter. Walks clockwise until a matching node is found.
+     *
+     * Useful for entity-type affinity: skip nodes that don't handle
+     * the entity type.
+     *
+     * Returns null if no matching node exists.
+     */
+    getNodeFiltered(key, filter) {
+        if (this.ring.length === 0)
+            return null;
+        const hash = murmurhash3(key);
+        // Find starting position
+        let lo = 0;
+        let hi = this.ring.length;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if (this.ring[mid].hash < hash) {
+                lo = mid + 1;
+            }
+            else {
+                hi = mid;
+            }
+        }
+        // Walk clockwise, checking filter
+        const visited = new Set();
+        for (let i = 0; i < this.ring.length; i++) {
+            const idx = (lo + i) % this.ring.length;
+            const vnode = this.ring[idx];
+            if (visited.has(vnode.nodeId))
+                continue;
+            visited.add(vnode.nodeId);
+            const node = this.nodes.get(vnode.nodeId);
+            if (node && filter(node))
+                return node;
+            // If we've checked all distinct nodes, stop
+            if (visited.size >= this.nodes.size)
+                break;
+        }
+        return null;
+    }
+    /**
+     * Check if a specific node owns the given key.
+     */
+    isOwner(nodeId, key) {
+        const owner = this.getNode(key);
+        return owner?.id === nodeId;
+    }
+    /**
+     * Get all node IDs currently in the ring.
+     */
+    getNodeIds() {
+        return Array.from(this.nodes.keys());
+    }
+    /**
+     * Get the number of physical nodes in the ring.
+     */
+    get size() {
+        return this.nodes.size;
+    }
+    /**
+     * Check if a node exists in the ring.
+     */
+    hasNode(nodeId) {
+        return this.nodes.has(nodeId);
+    }
+    /**
+     * Get a node by its ID.
+     */
+    getNodeById(nodeId) {
+        return this.nodes.get(nodeId) ?? null;
+    }
+    /**
+     * Compute which keys from the given set would be reassigned
+     * if a node were added or removed.
+     *
+     * Returns a map of key → new owner node ID.
+     */
+    computeReassignment(keys, operation) {
+        // Create a hypothetical ring with the change applied
+        const hypothetical = new ConsistentHashRing(this.virtualNodesPerNode);
+        for (const [id, node] of this.nodes) {
+            if (operation.type === 'remove' && id === operation.nodeId)
+                continue;
+            hypothetical.addNode(node);
+        }
+        if (operation.type === 'add') {
+            hypothetical.addNode(operation.node);
+        }
+        // Find keys that changed ownership
+        const reassignment = new Map();
+        for (const key of keys) {
+            const currentOwner = this.getNode(key);
+            const newOwner = hypothetical.getNode(key);
+            if (currentOwner?.id !== newOwner?.id && newOwner) {
+                reassignment.set(key, newOwner.id);
+            }
+        }
+        return reassignment;
+    }
+}
+exports.ConsistentHashRing = ConsistentHashRing;
+//# sourceMappingURL=consistent-hash.js.map

package/dist/workers/consistent-hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consistent-hash.js","sourceRoot":"","sources":["../../src/workers/consistent-hash.ts"],"names":[],"mappings":";;;AAIA,kCAiDC;AArDD;;;GAGG;AACH,SAAgB,WAAW,CAAC,GAAW,EAAE,IAAI,GAAG,CAAC;IAC/C,IAAI,EAAE,GAAG,IAAI,KAAK,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;IACvB,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,CAAC;IAEzB,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IAEtB,OAAO;IACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,EAAE,GACJ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;YAC9B,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1C,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAE7C,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEvB,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;IACrC,CAAC;IAED,OAAO;IACP,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC;IACzB,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC;IAE1B,IAAI,SAAS,IAAI,CAAC;QAAE,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAClE,IAAI,SAAS,IAAI,CAAC;QAAE,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACjE,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QAClC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,IAAI,EAAE,CAAC;IACX,CAAC;IAED,eAAe;IACf,EAAE,IAAI,GAAG,CAAC;IACV,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAChB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAC/B,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAChB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAC/B,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAEhB,OAAO,EAAE,KAAK,CAAC,CAAC;AAClB,CAAC;AAkBD;;;;;;;;;;;;;;;GAeG;AACH,MAAa,kBAAkB;IAK7B,YAAY,mBAAmB,GAAG,GAAG;QAJ7B,SAAI,GAAqB,EAAE,CAAC;QACnB,UAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QAI1D,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;IACjD,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAqB;QAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC;gBACtB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAc;QACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,GAAW;QACjB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAExC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAE9B,6DAA6D;QAC7D,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAE1B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC;gBAC/B,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,EAAE,GAAG,GAAG,CAAC;YACX,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,MAAM,GAAG,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE7B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IAC9C,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,GAAW,EAAE,MAA0C;QACrE,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAExC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAE9B,yBAAyB;QACzB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC1B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC;gBAC/B,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,EAAE,GAAG,GAAG,CAAC;YACX,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAE7B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;gBAAE,SAAS;YACxC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAE1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAEtC,4CAA4C;YAC5C,IAAI,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI;gBAAE,MAAM;QAC7C,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc,EAAE,GAAW;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAChC,OAAO,KAAK,EAAE,EAAE,KAAK,MAAM,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAAc;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IAED;;;;;OAKG;IACH,mBAAmB,CACjB,IAAsB,EACtB,SAAsF;QAEtF,qDAAqD;QACrD,MAAM,YAAY,GAAG,IAAI,kBAAkB,CAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAEzE,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ,IAAI,EAAE,KAAK,SAAS,CAAC,MAAM;gBAAE,SAAS;YACrE,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC7B,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;QAED,mCAAmC;QACnC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC/C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAE3C,IAAI,YAAY,EAAE,EAAE,KAAK,QAAQ,EAAE,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAClD,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;CACF;AA5LD,gDA4LC"}