@molecule/api-queue-memory 1.0.0

package/LICENSE

@@ -0,0 +1,115 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work.
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship.
+
+      "Contribution" shall mean any work of authorship, including the
+      original version of the Work and any modifications or additions
+      to that Work, that is intentionally submitted to the Licensor for
+      inclusion in the Work by the copyright owner or by an individual or
+      Legal Entity authorized to submit on behalf of the copyright owner.
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by the Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      patent license to make, have made, use, offer to sell, sell, import,
+      and otherwise transfer the Work.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file.
+
+   5. Submission of Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND.
+
+   8. Limitation of Liability. In no event and under no legal theory shall
+      any Contributor be liable to You for damages.
+
+   9. Accepting Warranty or Additional Liability.
+
+   Copyright 2026 Molecule Dev, Inc.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/dist/browser-guard.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=browser-guard.d.ts.map

package/dist/browser-guard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"browser-guard.d.ts","sourceRoot":"","sources":["../src/browser-guard.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,CAAA"}

package/dist/browser-guard.js

@@ -0,0 +1,19 @@
+/**
+ * Browser guard — `@molecule/api-queue-memory` is SERVER-ONLY.
+ *
+ * Generated by scripts/gen-browser-guards.mjs (workspace root) — edit THAT, not this.
+ * Evaluating a server package in a browser bundle is always an import-graph mistake
+ * (node APIs, secrets); without this guard it surfaces as a cryptic downstream crash
+ * ("Buffer is not defined") far from the culprit. Throwing here names the package and
+ * the fix at the exact moment the client bundle evaluates it. jsdom tests and SSR are
+ * unaffected: the throw requires browser globals AND the absence of a node runtime.
+ */
+const g = globalThis;
+if (g.window !== undefined && g.document !== undefined && !g.process?.versions?.node) {
+    throw new Error('@molecule/api-queue-memory is SERVER-ONLY: it was bundled into browser/client code. Import it only ' +
+        'from server code (a server route/function or your API), or dynamic-import it inside ' +
+        'the server handler — never from components or shared client modules, and never ' +
+        'polyfill Buffer/process to silence this.');
+}
+export {};
+//# sourceMappingURL=browser-guard.js.map

package/dist/browser-guard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"browser-guard.js","sourceRoot":"","sources":["../src/browser-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,GAAG,UAIT,CAAA;AACD,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IACrF,MAAM,IAAI,KAAK,CACb,qGAAqG;QACnG,sFAAsF;QACtF,iFAAiF;QACjF,0CAA0C,CAC7C,CAAA;AACH,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,61 @@
+/**
+ * In-memory queue provider for molecule.dev.
+ *
+ * A zero-dependency, zero-configuration, in-process queue provider for
+ * development and testing — no broker, no credentials, no environment
+ * variables. Implements the full `@molecule/api-queue` contract with
+ * SQS-style semantics: named queues, at-least-once delivery via visibility
+ * leases, delayed messages (`delaySeconds`), redelivery on subscriber
+ * handler failure or `nack()`, a bounded delivery cap with optional
+ * dead-letter routing, FIFO group ordering + deduplication, long-polling
+ * `receive()`, and `maxMessages`-bounded subscriber concurrency.
+ *
+ * @example
+ * ```typescript
+ * import { setProvider, queue } from '@molecule/api-queue'
+ * import { provider } from '@molecule/api-queue-memory'
+ *
+ * setProvider(provider) // no configuration, no env vars
+ *
+ * const emails = queue('emails')
+ * const unsubscribe = emails.subscribe(async (message) => {
+ *   await deliver(message.body)
+ *   await message.ack() // handler success also auto-acks
+ * })
+ *
+ * await emails.send({ body: { to: 'a@b.c' } })
+ * await emails.send({ body: { to: 'later@b.c' }, delaySeconds: 60 })
+ * ```
+ *
+ * @remarks
+ * Single-process and DEV-ONLY. Messages live in this process's memory: there
+ * is NO persistence (everything is lost on restart) and NO cross-instance
+ * delivery, so it must not be used for multi-instance production — swap in
+ * `@molecule/api-queue-redis`, `@molecule/api-queue-rabbitmq`, or
+ * `@molecule/api-queue-sqs` for production workloads. Delivery is
+ * at-least-once: a message whose visibility lease expires without `ack()` is
+ * redelivered (with an incremented `receiveCount`), and a message delivered
+ * more than `maxReceiveCount` times (default 3) is routed to the queue's
+ * dead-letter queue when one was configured via `createQueue()` — otherwise
+ * it is dropped with an error log. Message bodies are `structuredClone`d on
+ * send and per delivery (like a real broker's serialization), so bodies must
+ * be structured-cloneable and post-send mutations never leak to consumers.
+ * `QueueCreateOptions.maxMessageSize` is not enforced (nothing is
+ * serialized). `close()` clears all timers, resolves pending long-polls with
+ * `[]`, and stops all delivery.
+ *
+ * Two distinct redelivery delays (both `MemoryQueueOptions`, provider-wide):
+ * an explicit `nack()` redelivers per `redeliveryDelaySeconds` (default `0`
+ * — a deliberate caller decision, honored immediately), while an UNCAUGHT
+ * `subscribe()` handler throw redelivers per
+ * `handlerFailureRedeliveryDelaySeconds` (default `1` — an unplanned failure
+ * gets a real retry window instead of burning all `maxReceiveCount` attempts
+ * within milliseconds, mirroring the Redis bond's `attempts: 3, backoff:
+ * { type: 'exponential', delay: 1000 }`).
+ *
+ * @module
+ */
+export * from './browser-guard.js';
+export * from './provider.js';
+export * from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwDG;AAEH,cAAc,oBAAoB,CAAA;AAClC,cAAc,eAAe,CAAA;AAC7B,cAAc,YAAY,CAAA"}

package/dist/index.js

@@ -0,0 +1,61 @@
+/**
+ * In-memory queue provider for molecule.dev.
+ *
+ * A zero-dependency, zero-configuration, in-process queue provider for
+ * development and testing — no broker, no credentials, no environment
+ * variables. Implements the full `@molecule/api-queue` contract with
+ * SQS-style semantics: named queues, at-least-once delivery via visibility
+ * leases, delayed messages (`delaySeconds`), redelivery on subscriber
+ * handler failure or `nack()`, a bounded delivery cap with optional
+ * dead-letter routing, FIFO group ordering + deduplication, long-polling
+ * `receive()`, and `maxMessages`-bounded subscriber concurrency.
+ *
+ * @example
+ * ```typescript
+ * import { setProvider, queue } from '@molecule/api-queue'
+ * import { provider } from '@molecule/api-queue-memory'
+ *
+ * setProvider(provider) // no configuration, no env vars
+ *
+ * const emails = queue('emails')
+ * const unsubscribe = emails.subscribe(async (message) => {
+ *   await deliver(message.body)
+ *   await message.ack() // handler success also auto-acks
+ * })
+ *
+ * await emails.send({ body: { to: 'a@b.c' } })
+ * await emails.send({ body: { to: 'later@b.c' }, delaySeconds: 60 })
+ * ```
+ *
+ * @remarks
+ * Single-process and DEV-ONLY. Messages live in this process's memory: there
+ * is NO persistence (everything is lost on restart) and NO cross-instance
+ * delivery, so it must not be used for multi-instance production — swap in
+ * `@molecule/api-queue-redis`, `@molecule/api-queue-rabbitmq`, or
+ * `@molecule/api-queue-sqs` for production workloads. Delivery is
+ * at-least-once: a message whose visibility lease expires without `ack()` is
+ * redelivered (with an incremented `receiveCount`), and a message delivered
+ * more than `maxReceiveCount` times (default 3) is routed to the queue's
+ * dead-letter queue when one was configured via `createQueue()` — otherwise
+ * it is dropped with an error log. Message bodies are `structuredClone`d on
+ * send and per delivery (like a real broker's serialization), so bodies must
+ * be structured-cloneable and post-send mutations never leak to consumers.
+ * `QueueCreateOptions.maxMessageSize` is not enforced (nothing is
+ * serialized). `close()` clears all timers, resolves pending long-polls with
+ * `[]`, and stops all delivery.
+ *
+ * Two distinct redelivery delays (both `MemoryQueueOptions`, provider-wide):
+ * an explicit `nack()` redelivers per `redeliveryDelaySeconds` (default `0`
+ * — a deliberate caller decision, honored immediately), while an UNCAUGHT
+ * `subscribe()` handler throw redelivers per
+ * `handlerFailureRedeliveryDelaySeconds` (default `1` — an unplanned failure
+ * gets a real retry window instead of burning all `maxReceiveCount` attempts
+ * within milliseconds, mirroring the Redis bond's `attempts: 3, backoff:
+ * { type: 'exponential', delay: 1000 }`).
+ *
+ * @module
+ */
+export * from './browser-guard.js';
+export * from './provider.js';
+export * from './types.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwDG;AAEH,cAAc,oBAAoB,CAAA;AAClC,cAAc,eAAe,CAAA;AAC7B,cAAc,YAAY,CAAA"}

package/dist/provider.d.ts

@@ -0,0 +1,25 @@
+/**
+ * In-memory queue provider implementation.
+ *
+ * A zero-dependency, zero-configuration queue provider for development and
+ * testing. No broker process, no credentials, no environment variables.
+ *
+ * @module
+ */
+import type { QueueProvider } from '@molecule/api-queue';
+import type { MemoryQueueOptions } from './types.js';
+/**
+ * Creates an in-memory queue provider. Queues are created implicitly on first
+ * access (like the Redis bond) or explicitly via `createQueue()` with FIFO,
+ * visibility-timeout, retention, and dead-letter options. All state lives in
+ * this process and is lost on restart.
+ *
+ * @param options - Optional delivery defaults (visibility timeout, delivery cap, nack redelivery delay, handler-failure redelivery delay). Everything defaults sensibly — no configuration is required.
+ * @returns A `QueueProvider` backed by in-process queues.
+ */
+export declare const createProvider: (options?: MemoryQueueOptions) => QueueProvider;
+/**
+ * Lazily-initialized in-memory queue provider proxy that creates the provider on first access.
+ */
+export declare const provider: QueueProvider;
+//# sourceMappingURL=provider.d.ts.map

package/dist/provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"provider.d.ts","sourceRoot":"","sources":["../src/provider.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAA6B,aAAa,EAAE,MAAM,qBAAqB,CAAA;AAGnF,OAAO,KAAK,EAAqB,kBAAkB,EAAE,MAAM,YAAY,CAAA;AAEvE;;;;;;;;GAQG;AACH,eAAO,MAAM,cAAc,GAAI,UAAU,kBAAkB,KAAG,aA2D7D,CAAA;AAKD;;GAEG;AACH,eAAO,MAAM,QAAQ,EAAE,aAUrB,CAAA"}

package/dist/provider.js

@@ -0,0 +1,88 @@
+/**
+ * In-memory queue provider implementation.
+ *
+ * A zero-dependency, zero-configuration queue provider for development and
+ * testing. No broker process, no credentials, no environment variables.
+ *
+ * @module
+ */
+import { createQueue } from './queue.js';
+/**
+ * Creates an in-memory queue provider. Queues are created implicitly on first
+ * access (like the Redis bond) or explicitly via `createQueue()` with FIFO,
+ * visibility-timeout, retention, and dead-letter options. All state lives in
+ * this process and is lost on restart.
+ *
+ * @param options - Optional delivery defaults (visibility timeout, delivery cap, nack redelivery delay, handler-failure redelivery delay). Everything defaults sensibly — no configuration is required.
+ * @returns A `QueueProvider` backed by in-process queues.
+ */
+export const createProvider = (options) => {
+    const visibilityTimeoutSeconds = options?.visibilityTimeoutSeconds ?? 30;
+    const maxReceiveCount = options?.maxReceiveCount ?? 3;
+    const redeliveryDelaySeconds = options?.redeliveryDelaySeconds ?? 0;
+    const handlerFailureRedeliveryDelaySeconds = options?.handlerFailureRedeliveryDelaySeconds ?? 1;
+    const handles = new Map();
+    const getOrCreateQueue = (name, createOptions) => {
+        let handle = handles.get(name);
+        if (!handle) {
+            handle = createQueue(name, {
+                defaultVisibilityTimeoutSeconds: createOptions?.visibilityTimeout ?? visibilityTimeoutSeconds,
+                maxReceiveCount,
+                redeliveryDelaySeconds,
+                handlerFailureRedeliveryDelaySeconds,
+                fifo: createOptions?.fifo ?? false,
+                messageRetentionSeconds: createOptions?.messageRetentionSeconds,
+                deadLetterQueue: createOptions?.deadLetterQueue,
+                resolveQueue: (dlqName) => getOrCreateQueue(dlqName),
+            });
+            handles.set(name, handle);
+        }
+        return handle.queue;
+    };
+    const provider = {
+        queue(name) {
+            return getOrCreateQueue(name);
+        },
+        async listQueues() {
+            return Array.from(handles.keys());
+        },
+        async createQueue(name, createOptions) {
+            // Like the Redis bond: returns the existing queue when already created
+            // (creation options only apply to a queue's first creation).
+            return getOrCreateQueue(name, createOptions);
+        },
+        async deleteQueue(name) {
+            const handle = handles.get(name);
+            if (handle) {
+                handle.close();
+                handles.delete(name);
+            }
+        },
+        async close() {
+            for (const handle of handles.values()) {
+                handle.close();
+            }
+            handles.clear();
+        },
+    };
+    return provider;
+};
+/** Lazily-initialized in-memory queue provider, created on first property access via a Proxy. */
+let _provider = null;
+/**
+ * Lazily-initialized in-memory queue provider proxy that creates the provider on first access.
+ */
+export const provider = new Proxy({}, {
+    get(_, prop, receiver) {
+        if (!_provider)
+            _provider = createProvider();
+        return Reflect.get(_provider, prop, receiver);
+    },
+    // set trap: methods run with `this` bound to the proxy — without it, instance-state writes land on the dummy target and are lost (see api-push-notifications-web-push)
+    set(_, prop, value) {
+        if (!_provider)
+            _provider = createProvider();
+        return Reflect.set(_provider, prop, value);
+    },
+});
+//# sourceMappingURL=provider.js.map

package/dist/provider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"provider.js","sourceRoot":"","sources":["../src/provider.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAGxC;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,OAA4B,EAAiB,EAAE;IAC5E,MAAM,wBAAwB,GAAG,OAAO,EAAE,wBAAwB,IAAI,EAAE,CAAA;IACxE,MAAM,eAAe,GAAG,OAAO,EAAE,eAAe,IAAI,CAAC,CAAA;IACrD,MAAM,sBAAsB,GAAG,OAAO,EAAE,sBAAsB,IAAI,CAAC,CAAA;IACnE,MAAM,oCAAoC,GAAG,OAAO,EAAE,oCAAoC,IAAI,CAAC,CAAA;IAE/F,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAA;IAEpD,MAAM,gBAAgB,GAAG,CAAC,IAAY,EAAE,aAAkC,EAAS,EAAE;QACnF,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE;gBACzB,+BAA+B,EAC7B,aAAa,EAAE,iBAAiB,IAAI,wBAAwB;gBAC9D,eAAe;gBACf,sBAAsB;gBACtB,oCAAoC;gBACpC,IAAI,EAAE,aAAa,EAAE,IAAI,IAAI,KAAK;gBAClC,uBAAuB,EAAE,aAAa,EAAE,uBAAuB;gBAC/D,eAAe,EAAE,aAAa,EAAE,eAAe;gBAC/C,YAAY,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,gBAAgB,CAAC,OAAO,CAAC;aACrD,CAAC,CAAA;YACF,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,CAAA;IACrB,CAAC,CAAA;IAED,MAAM,QAAQ,GAAkB;QAC9B,KAAK,CAAC,IAAY;YAChB,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC;QAED,KAAK,CAAC,UAAU;YACd,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;QACnC,CAAC;QAED,KAAK,CAAC,WAAW,CAAC,IAAY,EAAE,aAAkC;YAChE,uEAAuE;YACvE,6DAA6D;YAC7D,OAAO,gBAAgB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAA;QAC9C,CAAC;QAED,KAAK,CAAC,WAAW,CAAC,IAAY;YAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAChC,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,KAAK,EAAE,CAAA;gBACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,KAAK;YACT,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,KAAK,EAAE,CAAA;YAChB,CAAC;YACD,OAAO,CAAC,KAAK,EAAE,CAAA;QACjB,CAAC;KACF,CAAA;IAED,OAAO,QAAQ,CAAA;AACjB,CAAC,CAAA;AAED,iGAAiG;AACjG,IAAI,SAAS,GAAyB,IAAI,CAAA;AAE1C;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAkB,IAAI,KAAK,CAAC,EAAmB,EAAE;IACpE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ;QACnB,IAAI,CAAC,SAAS;YAAE,SAAS,GAAG,cAAc,EAAE,CAAA;QAC5C,OAAO,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;IAC/C,CAAC;IACD,uKAAuK;IACvK,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK;QAChB,IAAI,CAAC,SAAS;YAAE,SAAS,GAAG,cAAc,EAAE,CAAA;QAC5C,OAAO,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC5C,CAAC;CACF,CAAC,CAAA"}

package/dist/queue.d.ts

@@ -0,0 +1,28 @@
+/**
+ * In-memory queue implementation.
+ *
+ * SQS-style visibility-lease semantics over an in-process message list:
+ * messages are leased (invisible) on delivery and return to the queue when
+ * the lease expires without an `ack()`, giving at-least-once delivery with
+ * redelivery on subscriber handler failure. A single lazily-armed
+ * `setTimeout` per queue drives delayed visibility and lease reclaim; it is
+ * tracked, `unref()`d, and cleared on `close()` so nothing leaks.
+ *
+ * @module
+ */
+import type { MemoryQueueConfig, MemoryQueueHandle } from './types.js';
+/**
+ * Creates an in-memory `Queue` with SQS-style visibility-lease delivery:
+ * send/sendBatch (with `delaySeconds` and FIFO group/dedup support), pull
+ * `receive()` (with long polling via `waitTimeSeconds`), push `subscribe()`
+ * (with `maxMessages`-bounded concurrency, auto-ack on handler success, and
+ * redelivery on handler failure), `size()`, and `purge()`. Messages
+ * exceeding the delivery cap are routed to the configured dead-letter queue
+ * or dropped with an error log.
+ *
+ * @param queueName - The queue name.
+ * @param config - Resolved queue configuration (defaults, FIFO mode, DLQ, queue resolver).
+ * @returns A handle with the `Queue` and an internal `close()` for the provider.
+ */
+export declare const createQueue: (queueName: string, config: MemoryQueueConfig) => MemoryQueueHandle;
+//# sourceMappingURL=queue.d.ts.map

package/dist/queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../src/queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAWH,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAA;AA8DtE;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,WAAW,GAAI,WAAW,MAAM,EAAE,QAAQ,iBAAiB,KAAG,iBAsW1E,CAAA"}

package/dist/queue.js

@@ -0,0 +1,369 @@
+/**
+ * In-memory queue implementation.
+ *
+ * SQS-style visibility-lease semantics over an in-process message list:
+ * messages are leased (invisible) on delivery and return to the queue when
+ * the lease expires without an `ack()`, giving at-least-once delivery with
+ * redelivery on subscriber handler failure. A single lazily-armed
+ * `setTimeout` per queue drives delayed visibility and lease reclaim; it is
+ * tracked, `unref()`d, and cleared on `close()` so nothing leaks.
+ *
+ * @module
+ */
+import { getLogger } from '@molecule/api-bond';
+const logger = getLogger();
+/**
+ * How long (ms) a FIFO `deduplicationId` suppresses duplicate sends —
+ * mirrors SQS's 5-minute deduplication window.
+ */
+const DEDUP_WINDOW_MS = 5 * 60_000;
+/**
+ * Creates an in-memory `Queue` with SQS-style visibility-lease delivery:
+ * send/sendBatch (with `delaySeconds` and FIFO group/dedup support), pull
+ * `receive()` (with long polling via `waitTimeSeconds`), push `subscribe()`
+ * (with `maxMessages`-bounded concurrency, auto-ack on handler success, and
+ * redelivery on handler failure), `size()`, and `purge()`. Messages
+ * exceeding the delivery cap are routed to the configured dead-letter queue
+ * or dropped with an error log.
+ *
+ * @param queueName - The queue name.
+ * @param config - Resolved queue configuration (defaults, FIFO mode, DLQ, queue resolver).
+ * @returns A handle with the `Queue` and an internal `close()` for the provider.
+ */
+export const createQueue = (queueName, config) => {
+    const messages = [];
+    const subscribers = new Map();
+    const waiters = new Set();
+    const dedupIds = new Map();
+    let wakeTimer = null;
+    let closed = false;
+    const maxReceiveCount = () => config.deadLetterQueue?.maxReceiveCount ?? config.maxReceiveCount;
+    const isStored = (message) => messages.includes(message);
+    const removeMessage = (message) => {
+        const index = messages.indexOf(message);
+        if (index !== -1)
+            messages.splice(index, 1);
+    };
+    const pruneDedup = (now) => {
+        for (const [key, entry] of dedupIds) {
+            if (entry.expiresAt <= now)
+                dedupIds.delete(key);
+        }
+    };
+    /**
+     * Routes a delivery-cap-exceeded message to the dead-letter queue when one
+     * is configured (and isn't this queue itself), otherwise drops it loudly.
+     */
+    const deadLetter = (message) => {
+        removeMessage(message);
+        const dlqName = config.deadLetterQueue?.name;
+        if (dlqName && dlqName !== queueName) {
+            logger.warn(`Memory queue "${queueName}": message ${message.id} exceeded ${maxReceiveCount()} deliveries — routing to dead-letter queue "${dlqName}"`);
+            config
+                .resolveQueue(dlqName)
+                .send({
+                id: message.id,
+                body: message.body,
+                attributes: message.attributes,
+                groupId: message.groupId,
+            })
+                .catch((error) => {
+                logger.error(`Memory queue "${queueName}": failed to dead-letter message ${message.id} to "${dlqName}"`, error);
+            });
+        }
+        else {
+            logger.error(`Memory queue "${queueName}": message ${message.id} exceeded ${maxReceiveCount()} deliveries and no dead-letter queue is configured — message dropped`);
+        }
+    };
+    /**
+     * Collects and leases up to `max` deliverable messages, applying delayed
+     * visibility, retention expiry, FIFO group head-of-line blocking, and the
+     * dead-letter delivery cap. Mutates lease state (at-least-once bookkeeping).
+     */
+    const leaseMessages = (max, visibilityTimeoutMs) => {
+        if (max <= 0)
+            return [];
+        const now = Date.now();
+        const leased = [];
+        const blockedGroups = new Set();
+        if (config.fifo) {
+            for (const message of messages) {
+                if (message.leaseExpiresAt !== null && message.leaseExpiresAt > now) {
+                    blockedGroups.add(message.groupId ?? '');
+                }
+            }
+        }
+        // Iterate a copy — retention expiry and dead-lettering splice the array.
+        for (const message of [...messages]) {
+            if (leased.length >= max)
+                break;
+            if (message.leaseExpiresAt !== null && message.leaseExpiresAt > now)
+                continue;
+            if (config.messageRetentionSeconds !== undefined &&
+                message.sentAt.getTime() + config.messageRetentionSeconds * 1000 <= now) {
+                removeMessage(message);
+                logger.debug(`Memory queue "${queueName}": message ${message.id} exceeded retention (${config.messageRetentionSeconds}s) — discarded`);
+                continue;
+            }
+            if (config.fifo) {
+                const group = message.groupId ?? '';
+                if (blockedGroups.has(group))
+                    continue;
+                // Head-of-line: later messages in this group must not overtake this
+                // one, whether it's delivered now, still delayed, or dead-lettered.
+                blockedGroups.add(group);
+            }
+            if (message.visibleAt > now)
+                continue;
+            if (message.receiveCount >= maxReceiveCount()) {
+                deadLetter(message);
+                continue;
+            }
+            message.leaseExpiresAt = now + visibilityTimeoutMs;
+            message.receiveCount += 1;
+            message.receiptHandle = crypto.randomUUID();
+            leased.push(message);
+        }
+        return leased;
+    };
+    /**
+     * Wraps a leased message for the consumer. `ack()`/`nack()` only act while
+     * this delivery's receipt handle is still current — once the lease expires
+     * and the message is redelivered, stale receipts become documented no-ops
+     * (making `ack()` idempotent and late acks after redelivery harmless).
+     */
+    const toReceivedMessage = (message) => {
+        const receipt = message.receiptHandle;
+        return {
+            id: message.id,
+            body: structuredClone(message.body),
+            receiptHandle: receipt,
+            attributes: message.attributes ? { ...message.attributes } : undefined,
+            receiveCount: message.receiveCount,
+            sentTimestamp: message.sentAt,
+            async ack() {
+                if (message.receiptHandle === receipt && isStored(message)) {
+                    removeMessage(message);
+                    pump();
+                }
+            },
+            async nack() {
+                if (message.receiptHandle === receipt && isStored(message)) {
+                    message.leaseExpiresAt = null;
+                    message.visibleAt = Date.now() + config.redeliveryDelaySeconds * 1000;
+                    pump();
+                }
+            },
+        };
+    };
+    /**
+     * Leases a message to a subscriber and runs its handler. Handler success
+     * auto-acks (a no-op if the handler already acked or the lease rotated);
+     * handler failure logs and returns the message for redelivery.
+     */
+    const dispatch = (subscriber, message) => {
+        const received = toReceivedMessage(message);
+        const receipt = message.receiptHandle;
+        void (async () => {
+            try {
+                await subscriber.handler(received);
+                if (message.receiptHandle === receipt && isStored(message)) {
+                    removeMessage(message);
+                }
+            }
+            catch (error) {
+                logger.warn(`Memory queue "${queueName}": subscriber handler failed for message ${message.id} — scheduling redelivery in ${config.handlerFailureRedeliveryDelaySeconds}s`, error);
+                if (message.receiptHandle === receipt && isStored(message)) {
+                    message.leaseExpiresAt = null;
+                    // An uncaught throw is an UNPLANNED failure (e.g. a transient
+                    // downstream 503) — give it a real retry window instead of the
+                    // instant redelivery an explicit nack() gets. With the default
+                    // maxReceiveCount of 3, a 0-delay default here would burn every
+                    // attempt within milliseconds and drop the message with no real
+                    // chance to recover.
+                    message.visibleAt = Date.now() + config.handlerFailureRedeliveryDelaySeconds * 1000;
+                }
+            }
+            finally {
+                subscriber.active -= 1;
+                pump();
+            }
+        })();
+    };
+    /**
+     * Arms the single wake timer for the earliest future event (delayed
+     * visibility or lease expiry) — only while someone (subscriber or long-poll
+     * waiter) is waiting for delivery; a fully idle queue holds no timer.
+     */
+    const scheduleNextWake = () => {
+        if (wakeTimer) {
+            clearTimeout(wakeTimer);
+            wakeTimer = null;
+        }
+        if (closed)
+            return;
+        if (subscribers.size === 0 && waiters.size === 0)
+            return;
+        const now = Date.now();
+        let next = Infinity;
+        for (const message of messages) {
+            if (message.leaseExpiresAt !== null && message.leaseExpiresAt > now) {
+                next = Math.min(next, message.leaseExpiresAt);
+            }
+            else if (message.visibleAt > now) {
+                next = Math.min(next, message.visibleAt);
+            }
+        }
+        if (!Number.isFinite(next))
+            return;
+        wakeTimer = setTimeout(() => {
+            wakeTimer = null;
+            pump();
+        }, Math.max(1, next - now));
+        wakeTimer.unref?.();
+    };
+    /**
+     * Delivery engine: dispatches deliverable messages to subscribers with free
+     * capacity, satisfies pending long-poll waiters, then re-arms the wake
+     * timer. Called after every state change.
+     */
+    const pump = () => {
+        if (closed)
+            return;
+        for (const subscriber of subscribers.values()) {
+            while (subscriber.active < subscriber.concurrency) {
+                const [message] = leaseMessages(1, subscriber.visibilityTimeoutMs);
+                if (!message)
+                    break;
+                subscriber.active += 1;
+                dispatch(subscriber, message);
+            }
+        }
+        for (const waiter of [...waiters]) {
+            const leased = leaseMessages(waiter.maxMessages, waiter.visibilityTimeoutMs);
+            if (leased.length > 0) {
+                waiters.delete(waiter);
+                clearTimeout(waiter.timer);
+                waiter.resolve(leased.map((message) => toReceivedMessage(message)));
+            }
+        }
+        scheduleNextWake();
+    };
+    const assertOpen = () => {
+        if (closed) {
+            throw new Error(`Memory queue "${queueName}" is closed`);
+        }
+    };
+    const queue = {
+        name: queueName,
+        async send(message) {
+            assertOpen();
+            const now = Date.now();
+            if (config.fifo && message.deduplicationId) {
+                pruneDedup(now);
+                const existing = dedupIds.get(message.deduplicationId);
+                if (existing)
+                    return existing.id;
+            }
+            const id = message.id ?? crypto.randomUUID();
+            const stored = {
+                id,
+                // Clone like a real broker serializes — post-send mutations of the
+                // caller's object must not affect what consumers receive.
+                body: structuredClone(message.body),
+                attributes: message.attributes ? { ...message.attributes } : undefined,
+                groupId: message.groupId,
+                sentAt: new Date(now),
+                visibleAt: now + (message.delaySeconds ?? 0) * 1000,
+                leaseExpiresAt: null,
+                receiveCount: 0,
+                receiptHandle: '',
+            };
+            messages.push(stored);
+            if (config.fifo && message.deduplicationId) {
+                dedupIds.set(message.deduplicationId, { id, expiresAt: now + DEDUP_WINDOW_MS });
+            }
+            pump();
+            return id;
+        },
+        async sendBatch(batch) {
+            const ids = [];
+            for (const message of batch) {
+                ids.push(await this.send(message));
+            }
+            return ids;
+        },
+        async receive(options) {
+            if (closed)
+                return [];
+            const maxMessages = options?.maxMessages ?? 10;
+            const visibilityTimeoutMs = (options?.visibilityTimeout ?? config.defaultVisibilityTimeoutSeconds) * 1000;
+            const leased = leaseMessages(maxMessages, visibilityTimeoutMs);
+            if (leased.length > 0 || !options?.waitTimeSeconds) {
+                scheduleNextWake();
+                return leased.map((message) => toReceivedMessage(message));
+            }
+            // Long poll: resolve as soon as a message becomes available, or with
+            // `[]` when `waitTimeSeconds` elapses (or the queue closes).
+            const waitTimeMs = options.waitTimeSeconds * 1000;
+            return new Promise((resolve) => {
+                const waiter = {
+                    maxMessages,
+                    visibilityTimeoutMs,
+                    resolve: resolve,
+                    timer: setTimeout(() => {
+                        waiters.delete(waiter);
+                        resolve([]);
+                    }, waitTimeMs),
+                };
+                waiter.timer.unref?.();
+                waiters.add(waiter);
+                scheduleNextWake();
+            });
+        },
+        subscribe(handler, options) {
+            assertOpen();
+            const subscriberId = crypto.randomUUID();
+            const subscriber = {
+                handler: handler,
+                concurrency: options?.maxMessages ?? 1,
+                visibilityTimeoutMs: (options?.visibilityTimeout ?? config.defaultVisibilityTimeoutSeconds) * 1000,
+                active: 0,
+            };
+            subscribers.set(subscriberId, subscriber);
+            pump();
+            return () => {
+                subscribers.delete(subscriberId);
+                scheduleNextWake();
+            };
+        },
+        async size() {
+            // Ready + delayed + in-flight, mirroring the Redis bond's
+            // waiting + active + delayed job counts.
+            return messages.length;
+        },
+        async purge() {
+            messages.length = 0;
+            scheduleNextWake();
+        },
+    };
+    const close = () => {
+        if (closed)
+            return;
+        closed = true;
+        if (wakeTimer) {
+            clearTimeout(wakeTimer);
+            wakeTimer = null;
+        }
+        for (const waiter of waiters) {
+            clearTimeout(waiter.timer);
+            waiter.resolve([]);
+        }
+        waiters.clear();
+        subscribers.clear();
+        messages.length = 0;
+        dedupIds.clear();
+    };
+    return { queue, close };
+};
+//# sourceMappingURL=queue.js.map

package/dist/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../src/queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAW9C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAA;AAE1B;;;GAGG;AACH,MAAM,eAAe,GAAG,CAAC,GAAG,MAAM,CAAA;AAsDlC;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,SAAiB,EAAE,MAAyB,EAAqB,EAAE;IAC7F,MAAM,QAAQ,GAAoB,EAAE,CAAA;IACpC,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAA;IACtD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6C,CAAA;IACrE,IAAI,SAAS,GAAyC,IAAI,CAAA;IAC1D,IAAI,MAAM,GAAG,KAAK,CAAA;IAElB,MAAM,eAAe,GAAG,GAAW,EAAE,CACnC,MAAM,CAAC,eAAe,EAAE,eAAe,IAAI,MAAM,CAAC,eAAe,CAAA;IAEnE,MAAM,QAAQ,GAAG,CAAC,OAAsB,EAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;IAEhF,MAAM,aAAa,GAAG,CAAC,OAAsB,EAAQ,EAAE;QACrD,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QACvC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC7C,CAAC,CAAA;IAED,MAAM,UAAU,GAAG,CAAC,GAAW,EAAQ,EAAE;QACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,SAAS,IAAI,GAAG;gBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAClD,CAAC;IACH,CAAC,CAAA;IAED;;;OAGG;IACH,MAAM,UAAU,GAAG,CAAC,OAAsB,EAAQ,EAAE;QAClD,aAAa,CAAC,OAAO,CAAC,CAAA;QACtB,MAAM,OAAO,GAAG,MAAM,CAAC,eAAe,EAAE,IAAI,CAAA;QAC5C,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CACT,iBAAiB,SAAS,cAAc,OAAO,CAAC,EAAE,aAAa,eAAe,EAAE,+CAA+C,OAAO,GAAG,CAC1I,CAAA;YACD,MAAM;iBACH,YAAY,CAAC,OAAO,CAAC;iBACrB,IAAI,CAAC;gBACJ,EAAE,EAAE,OAAO,CAAC,EAAE;gBACd,IAAI,EAAE,OAAO,CAAC,IAAI;gBAClB,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,OAAO,EAAE,OAAO,CAAC,OAAO;aACzB,CAAC;iBACD,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBACf,MAAM,CAAC,KAAK,CACV,iBAAiB,SAAS,oCAAoC,OAAO,CAAC,EAAE,QAAQ,OAAO,GAAG,EAC1F,KAAK,CACN,CAAA;YACH,CAAC,CAAC,CAAA;QACN,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,KAAK,CACV,iBAAiB,SAAS,cAAc,OAAO,CAAC,EAAE,aAAa,eAAe,EAAE,sEAAsE,CACvJ,CAAA;QACH,CAAC;IACH,CAAC,CAAA;IAED;;;;OAIG;IACH,MAAM,aAAa,GAAG,CAAC,GAAW,EAAE,mBAA2B,EAAmB,EAAE;QAClF,IAAI,GAAG,IAAI,CAAC;YAAE,OAAO,EAAE,CAAA;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,MAAM,MAAM,GAAoB,EAAE,CAAA;QAClC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;QACvC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YAChB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,OAAO,CAAC,cAAc,KAAK,IAAI,IAAI,OAAO,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC;oBACpE,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAA;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QACD,yEAAyE;QACzE,KAAK,MAAM,OAAO,IAAI,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;YACpC,IAAI,MAAM,CAAC,MAAM,IAAI,GAAG;gBAAE,MAAK;YAC/B,IAAI,OAAO,CAAC,cAAc,KAAK,IAAI,IAAI,OAAO,CAAC,cAAc,GAAG,GAAG;gBAAE,SAAQ;YAC7E,IACE,MAAM,CAAC,uBAAuB,KAAK,SAAS;gBAC5C,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,uBAAuB,GAAG,IAAI,IAAI,GAAG,EACvE,CAAC;gBACD,aAAa,CAAC,OAAO,CAAC,CAAA;gBACtB,MAAM,CAAC,KAAK,CACV,iBAAiB,SAAS,cAAc,OAAO,CAAC,EAAE,wBAAwB,MAAM,CAAC,uBAAuB,gBAAgB,CACzH,CAAA;gBACD,SAAQ;YACV,CAAC;YACD,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAChB,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,CAAA;gBACnC,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAQ;gBACtC,oEAAoE;gBACpE,oEAAoE;gBACpE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAC1B,CAAC;YACD,IAAI,OAAO,CAAC,SAAS,GAAG,GAAG;gBAAE,SAAQ;YACrC,IAAI,OAAO,CAAC,YAAY,IAAI,eAAe,EAAE,EAAE,CAAC;gBAC9C,UAAU,CAAC,OAAO,CAAC,CAAA;gBACnB,SAAQ;YACV,CAAC;YACD,OAAO,CAAC,cAAc,GAAG,GAAG,GAAG,mBAAmB,CAAA;YAClD,OAAO,CAAC,YAAY,IAAI,CAAC,CAAA;YACzB,OAAO,CAAC,aAAa,GAAG,MAAM,CAAC,UAAU,EAAE,CAAA;YAC3C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACtB,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC,CAAA;IAED;;;;;OAKG;IACH,MAAM,iBAAiB,GAAG,CAAI,OAAsB,EAAsB,EAAE;QAC1E,MAAM,OAAO,GAAG,OAAO,CAAC,aAAa,CAAA;QACrC,OAAO;YACL,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,IAAI,EAAE,eAAe,CAAC,OAAO,CAAC,IAAI,CAAM;YACxC,aAAa,EAAE,OAAO;YACtB,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS;YACtE,YAAY,EAAE,OAAO,CAAC,YAAY;YAClC,aAAa,EAAE,OAAO,CAAC,MAAM;YAE7B,KAAK,CAAC,GAAG;gBACP,IAAI,OAAO,CAAC,aAAa,KAAK,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC3D,aAAa,CAAC,OAAO,CAAC,CAAA;oBACtB,IAAI,EAAE,CAAA;gBACR,CAAC;YACH,CAAC;YAED,KAAK,CAAC,IAAI;gBACR,IAAI,OAAO,CAAC,aAAa,KAAK,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC3D,OAAO,CAAC,cAAc,GAAG,IAAI,CAAA;oBAC7B,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,sBAAsB,GAAG,IAAI,CAAA;oBACrE,IAAI,EAAE,CAAA;gBACR,CAAC;YACH,CAAC;SACF,CAAA;IACH,CAAC,CAAA;IAED;;;;OAIG;IACH,MAAM,QAAQ,GAAG,CAAC,UAA2B,EAAE,OAAsB,EAAQ,EAAE;QAC7E,MAAM,QAAQ,GAAG,iBAAiB,CAAU,OAAO,CAAC,CAAA;QACpD,MAAM,OAAO,GAAG,OAAO,CAAC,aAAa,CAAA;QACrC,KAAK,CAAC,KAAK,IAAI,EAAE;YACf,IAAI,CAAC;gBACH,MAAM,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;gBAClC,IAAI,OAAO,CAAC,aAAa,KAAK,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC3D,aAAa,CAAC,OAAO,CAAC,CAAA;gBACxB,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CACT,iBAAiB,SAAS,4CAA4C,OAAO,CAAC,EAAE,+BAA+B,MAAM,CAAC,oCAAoC,GAAG,EAC7J,KAAK,CACN,CAAA;gBACD,IAAI,OAAO,CAAC,aAAa,KAAK,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC3D,OAAO,CAAC,cAAc,GAAG,IAAI,CAAA;oBAC7B,8DAA8D;oBAC9D,+DAA+D;oBAC/D,+DAA+D;oBAC/D,gEAAgE;oBAChE,gEAAgE;oBAChE,qBAAqB;oBACrB,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,oCAAoC,GAAG,IAAI,CAAA;gBACrF,CAAC;YACH,CAAC;oBAAS,CAAC;gBACT,UAAU,CAAC,MAAM,IAAI,CAAC,CAAA;gBACtB,IAAI,EAAE,CAAA;YACR,CAAC;QACH,CAAC,CAAC,EAAE,CAAA;IACN,CAAC,CAAA;IAED;;;;OAIG;IACH,MAAM,gBAAgB,GAAG,GAAS,EAAE;QAClC,IAAI,SAAS,EAAE,CAAC;YACd,YAAY,CAAC,SAAS,CAAC,CAAA;YACvB,SAAS,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,IAAI,MAAM;YAAE,OAAM;QAClB,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,OAAM;QACxD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,IAAI,IAAI,GAAG,QAAQ,CAAA;QACnB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,OAAO,CAAC,cAAc,KAAK,IAAI,IAAI,OAAO,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC;gBACpE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,cAAc,CAAC,CAAA;YAC/C,CAAC;iBAAM,IAAI,OAAO,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC;gBACnC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,CAAA;YAC1C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAM;QAClC,SAAS,GAAG,UAAU,CACpB,GAAG,EAAE;YACH,SAAS,GAAG,IAAI,CAAA;YAChB,IAAI,EAAE,CAAA;QACR,CAAC,EACD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG,CAAC,CACxB,CAAA;QACD,SAAS,CAAC,KAAK,EAAE,EAAE,CAAA;IACrB,CAAC,CAAA;IAED;;;;OAIG;IACH,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,IAAI,MAAM;YAAE,OAAM;QAClB,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,OAAO,UAAU,CAAC,MAAM,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,mBAAmB,CAAC,CAAA;gBAClE,IAAI,CAAC,OAAO;oBAAE,MAAK;gBACnB,UAAU,CAAC,MAAM,IAAI,CAAC,CAAA;gBACtB,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,mBAAmB,CAAC,CAAA;YAC5E,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;gBACtB,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;gBAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,iBAAiB,CAAU,OAAO,CAAC,CAAC,CAAC,CAAA;YAC9E,CAAC;QACH,CAAC;QACD,gBAAgB,EAAE,CAAA;IACpB,CAAC,CAAA;IAED,MAAM,UAAU,GAAG,GAAS,EAAE;QAC5B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,aAAa,CAAC,CAAA;QAC1D,CAAC;IACH,CAAC,CAAA;IAED,MAAM,KAAK,GAAU;QACnB,IAAI,EAAE,SAAS;QAEf,KAAK,CAAC,IAAI,CAAc,OAAwB;YAC9C,UAAU,EAAE,CAAA;YACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;YACtB,IAAI,MAAM,CAAC,IAAI,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;gBAC3C,UAAU,CAAC,GAAG,CAAC,CAAA;gBACf,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAA;gBACtD,IAAI,QAAQ;oBAAE,OAAO,QAAQ,CAAC,EAAE,CAAA;YAClC,CAAC;YACD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,IAAI,MAAM,CAAC,UAAU,EAAE,CAAA;YAC5C,MAAM,MAAM,GAAkB;gBAC5B,EAAE;gBACF,mEAAmE;gBACnE,0DAA0D;gBAC1D,IAAI,EAAE,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC;gBACnC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS;gBACtE,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC;gBACrB,SAAS,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,IAAI;gBACnD,cAAc,EAAE,IAAI;gBACpB,YAAY,EAAE,CAAC;gBACf,aAAa,EAAE,EAAE;aAClB,CAAA;YACD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YACrB,IAAI,MAAM,CAAC,IAAI,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;gBAC3C,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,GAAG,eAAe,EAAE,CAAC,CAAA;YACjF,CAAC;YACD,IAAI,EAAE,CAAA;YACN,OAAO,EAAE,CAAA;QACX,CAAC;QAED,KAAK,CAAC,SAAS,CAAc,KAAwB;YACnD,MAAM,GAAG,GAAa,EAAE,CAAA;YACxB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;gBAC5B,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAA;YACpC,CAAC;YACD,OAAO,GAAG,CAAA;QACZ,CAAC;QAED,KAAK,CAAC,OAAO,CAAc,OAAwB;YACjD,IAAI,MAAM;gBAAE,OAAO,EAAE,CAAA;YACrB,MAAM,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,EAAE,CAAA;YAC9C,MAAM,mBAAmB,GACvB,CAAC,OAAO,EAAE,iBAAiB,IAAI,MAAM,CAAC,+BAA+B,CAAC,GAAG,IAAI,CAAA;YAC/E,MAAM,MAAM,GAAG,aAAa,CAAC,WAAW,EAAE,mBAAmB,CAAC,CAAA;YAC9D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,EAAE,CAAC;gBACnD,gBAAgB,EAAE,CAAA;gBAClB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,iBAAiB,CAAI,OAAO,CAAC,CAAC,CAAA;YAC/D,CAAC;YACD,qEAAqE;YACrE,6DAA6D;YAC7D,MAAM,UAAU,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAA;YACjD,OAAO,IAAI,OAAO,CAAuB,CAAC,OAAO,EAAE,EAAE;gBACnD,MAAM,MAAM,GAAW;oBACrB,WAAW;oBACX,mBAAmB;oBACnB,OAAO,EAAE,OAAyD;oBAClE,KAAK,EAAE,UAAU,CAAC,GAAG,EAAE;wBACrB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;wBACtB,OAAO,CAAC,EAAE,CAAC,CAAA;oBACb,CAAC,EAAE,UAAU,CAAC;iBACf,CAAA;gBACD,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAA;gBACtB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBACnB,gBAAgB,EAAE,CAAA;YACpB,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,SAAS,CAAc,OAA0B,EAAE,OAAwB;YACzE,UAAU,EAAE,CAAA;YACZ,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,EAAE,CAAA;YACxC,MAAM,UAAU,GAAoB;gBAClC,OAAO,EAAE,OAAkC;gBAC3C,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,CAAC;gBACtC,mBAAmB,EACjB,CAAC,OAAO,EAAE,iBAAiB,IAAI,MAAM,CAAC,+BAA+B,CAAC,GAAG,IAAI;gBAC/E,MAAM,EAAE,CAAC;aACV,CAAA;YACD,WAAW,CAAC,GAAG,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;YACzC,IAAI,EAAE,CAAA;YACN,OAAO,GAAG,EAAE;gBACV,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;gBAChC,gBAAgB,EAAE,CAAA;YACpB,CAAC,CAAA;QACH,CAAC;QAED,KAAK,CAAC,IAAI;YACR,0DAA0D;YAC1D,yCAAyC;YACzC,OAAO,QAAQ,CAAC,MAAM,CAAA;QACxB,CAAC;QAED,KAAK,CAAC,KAAK;YACT,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;YACnB,gBAAgB,EAAE,CAAA;QACpB,CAAC;KACF,CAAA;IAED,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,IAAI,MAAM;YAAE,OAAM;QAClB,MAAM,GAAG,IAAI,CAAA;QACb,IAAI,SAAS,EAAE,CAAC;YACd,YAAY,CAAC,SAAS,CAAC,CAAA;YACvB,SAAS,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAC1B,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QACpB,CAAC;QACD,OAAO,CAAC,KAAK,EAAE,CAAA;QACf,WAAW,CAAC,KAAK,EAAE,CAAA;QACnB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;QACnB,QAAQ,CAAC,KAAK,EAAE,CAAA;IAClB,CAAC,CAAA;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;AACzB,CAAC,CAAA"}

package/dist/types.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Type definitions for the in-memory queue provider.
+ *
+ * @module
+ */
+import type { Queue, QueueCreateOptions } from '@molecule/api-queue';
+export type { MessageHandler, Queue, QueueCreateOptions, QueueMessage, QueueProvider, ReceivedMessage, ReceiveOptions, } from '@molecule/api-queue';
+/**
+ * Options for creating an in-memory queue provider.
+ *
+ * All options have working defaults — the provider is fully functional with
+ * zero configuration and zero environment variables.
+ */
+export interface MemoryQueueOptions {
+    /**
+     * Default visibility timeout in seconds applied to received/dispatched
+     * messages when `ReceiveOptions.visibilityTimeout` is not given.
+     * A leased (in-flight) message whose lease expires without an `ack()`
+     * becomes visible again and is redelivered (at-least-once delivery).
+     * Defaults to `30`.
+     */
+    visibilityTimeoutSeconds?: number;
+    /**
+     * Maximum number of times a message may be delivered before it is routed
+     * to the queue's dead-letter queue (when configured via
+     * `QueueCreateOptions.deadLetterQueue`) or dropped with an error log.
+     * Mirrors the Redis bond's `attempts: 3`. Defaults to `3`.
+     */
+    maxReceiveCount?: number;
+    /**
+     * Delay in seconds before a message is redelivered after an explicit
+     * `nack()` (a pull `receive()` consumer's deliberate "put this back now").
+     * Defaults to `0` (immediate redelivery) — an explicit `nack()` is a
+     * caller decision that should be honored right away, not throttled.
+     */
+    redeliveryDelaySeconds?: number;
+    /**
+     * Delay in seconds before a message is redelivered after an UNCAUGHT
+     * `subscribe()` handler failure (a thrown error) — distinct from
+     * `redeliveryDelaySeconds` because a throw is an unplanned failure (e.g. a
+     * downstream 503) that deserves a real retry window, mirroring the Redis
+     * bond's `attempts: 3, backoff: { type: 'exponential', delay: 1000 }`.
+     * Defaults to `1`. With the default `maxReceiveCount` of `3`, a
+     * `redeliveryDelaySeconds` of `0` would burn all delivery attempts within
+     * milliseconds and drop the message with no real chance for a transient
+     * downstream failure to recover — this option exists so "retry" means a
+     * few real seconds apart, not a hot loop.
+     */
+    handlerFailureRedeliveryDelaySeconds?: number;
+}
+/**
+ * Internal configuration for a single in-memory queue instance, resolved by
+ * the provider from `MemoryQueueOptions` and per-queue `QueueCreateOptions`.
+ */
+export interface MemoryQueueConfig {
+    /**
+     * Default visibility timeout in seconds for leases without an explicit
+     * `ReceiveOptions.visibilityTimeout`.
+     */
+    defaultVisibilityTimeoutSeconds: number;
+    /**
+     * Maximum deliveries before dead-lettering/dropping. Overridden per queue
+     * by `deadLetterQueue.maxReceiveCount` when a dead-letter queue is set.
+     */
+    maxReceiveCount: number;
+    /**
+     * Delay in seconds before redelivery after an explicit `nack()`.
+     */
+    redeliveryDelaySeconds: number;
+    /**
+     * Delay in seconds before redelivery after an uncaught `subscribe()`
+     * handler failure.
+     */
+    handlerFailureRedeliveryDelaySeconds: number;
+    /**
+     * Whether this queue enforces FIFO semantics (per-`groupId` ordered,
+     * head-of-line-blocking delivery plus `deduplicationId` deduplication).
+     */
+    fifo: boolean;
+    /**
+     * Optional retention period in seconds; messages older than this are
+     * discarded when next scanned.
+     */
+    messageRetentionSeconds?: number;
+    /**
+     * Optional dead-letter queue for messages exceeding the delivery cap.
+     */
+    deadLetterQueue?: QueueCreateOptions['deadLetterQueue'];
+    /**
+     * Resolves another queue by name — used to route dead-lettered messages.
+     */
+    resolveQueue: (name: string) => Queue;
+}
+/**
+ * Handle pairing a `Queue` with the internal lifecycle control the provider
+ * uses to shut it down (`close()` is not part of the core `Queue` interface).
+ */
+export interface MemoryQueueHandle {
+    /**
+     * The in-memory queue implementation.
+     */
+    queue: Queue;
+    /**
+     * Stops all timers, resolves pending long-polls with `[]`, discards all
+     * messages and subscribers, and rejects further sends.
+     */
+    close(): void;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAA;AAGpE,YAAY,EACV,cAAc,EACd,KAAK,EACL,kBAAkB,EAClB,YAAY,EACZ,aAAa,EACb,eAAe,EACf,cAAc,GACf,MAAM,qBAAqB,CAAA;AAE5B;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC;;;;;;OAMG;IACH,wBAAwB,CAAC,EAAE,MAAM,CAAA;IAEjC;;;;;OAKG;IACH,eAAe,CAAC,EAAE,MAAM,CAAA;IAExB;;;;;OAKG;IACH,sBAAsB,CAAC,EAAE,MAAM,CAAA;IAE/B;;;;;;;;;;;OAWG;IACH,oCAAoC,CAAC,EAAE,MAAM,CAAA;CAC9C;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,+BAA+B,EAAE,MAAM,CAAA;IAEvC;;;OAGG;IACH,eAAe,EAAE,MAAM,CAAA;IAEvB;;OAEG;IACH,sBAAsB,EAAE,MAAM,CAAA;IAE9B;;;OAGG;IACH,oCAAoC,EAAE,MAAM,CAAA;IAE5C;;;OAGG;IACH,IAAI,EAAE,OAAO,CAAA;IAEb;;;OAGG;IACH,uBAAuB,CAAC,EAAE,MAAM,CAAA;IAEhC;;OAEG;IACH,eAAe,CAAC,EAAE,kBAAkB,CAAC,iBAAiB,CAAC,CAAA;IAEvD;;OAEG;IACH,YAAY,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,KAAK,CAAA;CACtC;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,KAAK,EAAE,KAAK,CAAA;IAEZ;;;OAGG;IACH,KAAK,IAAI,IAAI,CAAA;CACd"}

package/dist/types.js

@@ -0,0 +1,7 @@
+/**
+ * Type definitions for the in-memory queue provider.
+ *
+ * @module
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

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

package/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "@molecule/api-queue-memory",
+  "version": "1.0.0",
+  "description": "In-memory queue provider for molecule.dev.",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "scripts": {
+    "build": "tsc",
+    "test": "vitest run",
+    "test:watch": "vitest"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "keywords": [
+    "molecule",
+    "queue",
+    "memory",
+    "messaging"
+  ],
+  "license": "Apache-2.0",
+  "peerDependencies": {
+    "@molecule/api-bond": "^1.0.0",
+    "@molecule/api-queue": "^1.0.0"
+  },
+  "devDependencies": {
+    "@types/node": "26.1.2",
+    "typescript": "6.0.3",
+    "vitest": "4.1.10"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/molecule-dev/molecule.git",
+    "directory": "packages/api/bonds/queue/memory"
+  },
+  "homepage": "https://github.com/molecule-dev/molecule/tree/main/packages/api/bonds/queue/memory",
+  "bugs": "https://github.com/molecule-dev/molecule/issues",
+  "publishConfig": {
+    "access": "public"
+  }
+}