@shutterstock/p-map-iterable 0.0.1

package/LICENSE.md

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+=====================
+Copyright (c) `2022` `Shutterstock, Inc.`
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,110 @@
+[![License: MIT](https://img.shields.io/badge/License-MIT-green.svg)](https://opensource.org/licenses/MIT)
+
+# Overview
+
+Async iterable that maps an async iterable input with backpressure.
+
+A common use case for `pMapIterable` is as a "prefetcher" that will fetch, for example, DB or remote REST responses. By prefetching items the consumer is able to use 100% of the JS thread time for processing prefetched items instead of waiting for an item to arrive after each item is processed. This use case is most common in batch or queue consumers, not as much in request/response services.
+
+# Installation
+
+`npm i @shutterstock/p-map-iterable`
+
+# Features
+
+- `IterableMapper`
+  - Interface and concept based on: [p-map](https://github.com/sindresorhus/p-map)
+  - Allows a sync or async iterable input
+  - User supplied sync or async mapper function
+  - Exposes an async iterable interface for consuming mapped items
+  - Allows a maximum queue depth of mapped items - if the consumer stops consuming, the queue will fill up, at which point the mapper will stop being invoked until an item is consumed from the queue
+  - This allows mapping with back pressure so that the mapper does not consume unlimited resources (e.g. memory, disk, network, event loop time) by racing ahead of the consumer
+- `IterableMapperSimple`
+  - Wraps `IterableMapper`
+  - Discards results as they become available
+  - Exposes any accumulated errors through the `errors` property instead of throwing an `AggregateError`
+  - Retains the backpressure functionality of `IterableMapper`'s `enqueue` in that addtional items cannot be added if the max number of items are already queued and their mappers have not yet completed, but does not require that the results be read by the caller before the next item can be mapped since the results are discarded immediately after they are available
+
+# `IterableMapper`
+
+See [p-map](https://github.com/sindresorhus/p-map) docs for a good start in understanding what this does.
+
+The key difference between `IterableMapper` and `pMap` are that `IterableMapper` does not return when the entire mapping is done, rather it exposes an iterable that the caller loops through. This enables results to be processed while the mapping is still happening, while optionally allowing for back pressure to slow or stop the mapping if the caller is not consuming items fast enough. Common use cases include `prefetching` items from a remote service - the next set of requests are dispatched asyncronously while the current responses are processed and the prefetch requests will pause when the unread queue fills up.
+
+```typescript
+import { IterableMapper } from '@shutterstock/p-map-iterable';
+import { promisify } from 'util';
+const sleep = promisify(setTimeout);
+
+class SleepIterator implements AsyncIterable<number> {
+  private _max: number;
+  private _current = 1;
+
+  constructor(max: number) {
+    this._max = max;
+  }
+
+  async *[Symbol.asyncIterator](): AsyncIterator<number> {
+    for (let i = 0; i < this._max; i++) {
+      await sleep(1 * (i % 10));
+
+      if (this._current <= this._max) {
+        yield this._current;
+      }
+
+      this._current++;
+    }
+  }
+}
+
+const max = 100;
+const iterator = new SleepIterator(max);
+let total = 0;
+let callCount = 0;
+
+// Create an item prefetcher with IterableMapper
+// Use `npm i it-batch`'s `batch` function to batch the source iterable
+// into batches of a specific size, such as 50, if making batch requests
+// to a remote service.
+const prefetcher = new IterableMapper(
+  // Batch example:
+  //   batch(iterator, 50),
+  iterator,
+  // Batch example:
+  //   async (values: number[]): Promise<number> => {
+  async (value: number): Promise<number> => {
+    callCount++;
+    total += value;
+
+    // Simulate fetching an async item with varied delays
+    await sleep(10 * (callCount % 6));
+
+    return total;
+  },
+  { concurrency: 2, maxUnread: 10 },
+);
+
+let lastTotal = 0;
+let loopCount = 0;
+
+// Loop through the prefetched items or batches
+// Will pause and wait for prefetch to complete if none available
+// Will immediately start processing if prefetched item or batch is already available
+// If the `maxUnread` count was hit then no prefetches will be in progress until an item
+// is returned from the iterable here.  Once an item is returned a mapper
+// will be started; this will repeat until `concurrency` mappers are running again.
+for await (const item of prefetcher) {
+  loopCount++;
+  if (item > lastTotal) {
+    lastTotal = item;
+  }
+}
+```
+
+# Contributing - Setting up Build Environment
+
+- `nvm use`
+- `npm i`
+- `npm run build`
+- `npm run lint`
+- `npm run test`

package/dist/blocking-queue.d.ts

@@ -0,0 +1,57 @@
+interface BlockingQueueOptions {
+    /**
+     * Number of pending unread items.
+     *
+     * Must be an integer from 0 and up or `Infinity`, must be >= `concurrency`.
+     *
+     * @default 8
+     */
+    readonly maxUnread?: number;
+}
+export declare class BlockingQueue<Element> {
+    private _options;
+    private readonly _unreadQueue;
+    private readonly _readersWaiting;
+    private readonly _writersWaiting;
+    private _doneAdding;
+    /**
+     *
+     */
+    constructor({ maxUnread }?: BlockingQueueOptions);
+    get length(): number;
+    /**
+     * Indicate that no more items will be enqueued.
+     *
+     * This releases all readers blocked on `enqueue`
+     */
+    done(): void;
+    /**
+     * Add an item to the queue, wait if the queue is full.
+     *
+     * @param item Element to add
+     */
+    enqueue(item: Element): Promise<void>;
+    /**
+     * Gets an element when one is ready, waits if none are ready.
+     *
+     * @returns Element or undefined if queue is empty and `done` has been called
+     */
+    dequeue(): Promise<Element | undefined>;
+    private releaseAllReaders;
+    private areWeDone;
+    /**
+     * Waits for an item to be ready in the queue
+     * @returns Item from the ready queue
+     */
+    private readWhenReady;
+    /**
+     * Waits for an item to be ready in the queue
+     */
+    private waitForWrite;
+    /**
+     * Waits to be able to add an item to the queue when full
+     */
+    private waitForRead;
+}
+export {};
+//# sourceMappingURL=blocking-queue.d.ts.map

package/dist/blocking-queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocking-queue.d.ts","sourceRoot":"","sources":["../src/blocking-queue.ts"],"names":[],"mappings":"AAEA,UAAU,oBAAoB;IAC5B;;;;;;OAMG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAOD,qBAAa,aAAa,CAAC,OAAO;IAChC,OAAO,CAAC,QAAQ,CAAiC;IAKjD,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA+B;IAO5D,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0C;IAO1E,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0C;IAE1E,OAAO,CAAC,WAAW,CAAS;IAE5B;;OAEG;gBACS,EAAE,SAAa,EAAE,GAAE,oBAAyB;IAsBxD,IAAW,MAAM,IAAI,MAAM,CAE1B;IAED;;;;OAIG;IACI,IAAI,IAAI,IAAI;IAcnB;;;;OAIG;IACU,OAAO,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IA0BlD;;;;OAIG;IACU,OAAO,IAAI,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC;IAoCpD,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,SAAS;IAiBjB;;;OAGG;YACW,aAAa;IAgB3B;;OAEG;YACW,YAAY;IAW1B;;OAEG;YACW,WAAW;CAU1B"}

package/dist/blocking-queue.js

@@ -0,0 +1,193 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BlockingQueue = void 0;
+const tslib_1 = require("tslib");
+const queue_1 = require("./queue");
+class BlockingQueue {
+    /**
+     *
+     */
+    constructor({ maxUnread = 8 } = {}) {
+        // NOTE: unreadQueue has to be a proper FIFO queue with O(1) removal from the front
+        // as we may have O(m) unread items, where m may approach n, and Array.shift()
+        // would be O(m) (approaching O(n)) in that case as the array gets large.
+        this._unreadQueue = new queue_1.Queue();
+        // NOTE: Yes, it is possible to call next() multiple times in parallel (and we
+        // have a test that demonstrates that), so we may have multiple readers waiting
+        // and thus need a queue not just a single item.
+        // The items in the queue are 'resolve' functions that we call when an item
+        // is ready.
+        this._readersWaiting = new queue_1.Queue();
+        // NOTE: Yes, it is possible to call add() multiple times in parallel (and we
+        // have a test that demonstrates that), so we may have multiple writers waiting
+        // and thus need a queue not just a single item.
+        // The items in the queue are 'resolve' functions that we call when an item
+        // is ready.
+        this._writersWaiting = new queue_1.Queue();
+        this._doneAdding = false;
+        this._options = { maxUnread };
+        // Avoid undefined errors on options
+        if (this._options.maxUnread === undefined) {
+            throw new TypeError('`maxUnread` must be set');
+        }
+        // Validate maxUnread option
+        if (!((Number.isSafeInteger(this._options.maxUnread) ||
+            this._options.maxUnread === Number.POSITIVE_INFINITY) &&
+            this._options.maxUnread >= 0)) {
+            throw new TypeError(`Expected \`maxUnread\` to be an integer from 0 and up or \`Infinity\`, got \`${maxUnread}\` (${typeof maxUnread})`);
+        }
+    }
+    get length() {
+        return this._unreadQueue.length;
+    }
+    /**
+     * Indicate that no more items will be enqueued.
+     *
+     * This releases all readers blocked on `enqueue`
+     */
+    done() {
+        // Just mark that we're done adding
+        this._doneAdding = true;
+        // If there are writers waiting then then they will release the waiting readers
+        // The reader that sees the writer count hit zero will clean up
+        if (this._writersWaiting.length !== 0) {
+            return;
+        }
+        // If there are no writers waiting then we release all the readers
+        this.releaseAllReaders();
+    }
+    /**
+     * Add an item to the queue, wait if the queue is full.
+     *
+     * @param item Element to add
+     */
+    enqueue(item) {
+        return tslib_1.__awaiter(this, void 0, void 0, function* () {
+            if (this._doneAdding) {
+                throw new Error('`enqueue` called after `done` called');
+            }
+            // We always add to the internal queue, we just wait to return if the queue is full
+            this._unreadQueue.enqueue(item);
+            if (this._readersWaiting.length > 0) {
+                // Release a reader if one is waiting for an item
+                // Remove the first waiting reader Promise from the queue
+                const reader = this._readersWaiting.dequeue();
+                if (reader === undefined) {
+                    throw new TypeError('reader queue returned undefined');
+                }
+                // Resolve the Promise for a waiting reader
+                reader(undefined);
+            }
+            if (this._unreadQueue.length > this._options.maxUnread) {
+                // We wait if the queue is at max length
+                yield this.waitForRead();
+            }
+        });
+    }
+    /**
+     * Gets an element when one is ready, waits if none are ready.
+     *
+     * @returns Element or undefined if queue is empty and `done` has been called
+     */
+    dequeue() {
+        return tslib_1.__awaiter(this, void 0, void 0, function* () {
+            // Bail out and release all waiters if there are no more items coming
+            const done = this.areWeDone();
+            if (done) {
+                return undefined;
+            }
+            // Check if queue has an item
+            let item;
+            // Get the item if one is ready
+            if (this._unreadQueue.length !== 0 && this._readersWaiting.length === 0) {
+                // If there are items and no waiters, pop one and return it
+                item = this._unreadQueue.dequeue();
+            }
+            else {
+                // If there are no items and/or there are already waiters, we have to wait for one to be ready
+                yield this.waitForWrite();
+                item = this._unreadQueue.dequeue();
+            }
+            if (this._writersWaiting.length > 0) {
+                // Release a writer if one is waiting
+                // Remove the first waiting reader Promise from the queue
+                const writer = this._writersWaiting.dequeue();
+                if (writer === undefined) {
+                    throw new TypeError('writer queue returned undefined');
+                }
+                // Resolve the Promise for a waiting writer
+                writer(undefined);
+            }
+            return item;
+        });
+    }
+    releaseAllReaders() {
+        // Release all the waiting readers since we're done
+        let waiter;
+        while ((waiter = this._readersWaiting.dequeue()) !== undefined) {
+            waiter(undefined);
+        }
+    }
+    areWeDone() {
+        if (this._doneAdding) {
+            // No more calls to `enqueue` will be made
+            if (this._writersWaiting.length === 0) {
+                // No `enqueue` calls are waiting to add an item
+                if (this._unreadQueue.length === 0) {
+                    // There are no unread items left
+                    this.releaseAllReaders();
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Waits for an item to be ready in the queue
+     * @returns Item from the ready queue
+     */
+    readWhenReady() {
+        return tslib_1.__awaiter(this, void 0, void 0, function* () {
+            // If there are waiters, create a waiter promise and add to end of list
+            // Note: the background reader removes the promise from the readers waiting queue
+            const itemReady = new Promise((resolve) => {
+                this._readersWaiting.enqueue(resolve);
+            });
+            // Wait for our item to be ready
+            yield itemReady;
+            const item = this._unreadQueue.dequeue();
+            // Pull the item from the front
+            return item;
+        });
+    }
+    /**
+     * Waits for an item to be ready in the queue
+     */
+    waitForWrite() {
+        return tslib_1.__awaiter(this, void 0, void 0, function* () {
+            // If there are waiters, create a waiter promise and add to end of list
+            // Note: the background reader removes the promise from the readers waiting queue
+            const itemReady = new Promise((resolve) => {
+                this._readersWaiting.enqueue(resolve);
+            });
+            // Wait for our item to be ready
+            yield itemReady;
+        });
+    }
+    /**
+     * Waits to be able to add an item to the queue when full
+     */
+    waitForRead() {
+        return tslib_1.__awaiter(this, void 0, void 0, function* () {
+            // If there are waiters, create a waiter promise and add to end of list
+            // Note: the background reader removes the promise from the readers waiting queue
+            const writeReady = new Promise((resolve) => {
+                this._writersWaiting.enqueue(resolve);
+            });
+            // Wait for our turn to add to the queue
+            yield writeReady;
+        });
+    }
+}
+exports.BlockingQueue = BlockingQueue;
+//# sourceMappingURL=blocking-queue.js.map

package/dist/blocking-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocking-queue.js","sourceRoot":"","sources":["../src/blocking-queue.ts"],"names":[],"mappings":";;;;AAAA,mCAAgC;AAkBhC,MAAa,aAAa;IAwBxB;;OAEG;IACH,YAAY,EAAE,SAAS,GAAG,CAAC,KAA2B,EAAE;QAxBxD,mFAAmF;QACnF,8EAA8E;QAC9E,yEAAyE;QACxD,iBAAY,GAAmB,IAAI,aAAK,EAAE,CAAC;QAE5D,8EAA8E;QAC9E,+EAA+E;QAC/E,gDAAgD;QAChD,2EAA2E;QAC3E,YAAY;QACK,oBAAe,GAA8B,IAAI,aAAK,EAAE,CAAC;QAE1E,6EAA6E;QAC7E,+EAA+E;QAC/E,gDAAgD;QAChD,2EAA2E;QAC3E,YAAY;QACK,oBAAe,GAA8B,IAAI,aAAK,EAAE,CAAC;QAElE,gBAAW,GAAG,KAAK,CAAC;QAM1B,IAAI,CAAC,QAAQ,GAAG,EAAE,SAAS,EAAE,CAAC;QAE9B,oCAAoC;QACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE;YACzC,MAAM,IAAI,SAAS,CAAC,yBAAyB,CAAC,CAAC;SAChD;QAED,4BAA4B;QAC5B,IACE,CAAC,CACC,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;YAC5C,IAAI,CAAC,QAAQ,CAAC,SAAS,KAAK,MAAM,CAAC,iBAAiB,CAAC;YACvD,IAAI,CAAC,QAAQ,CAAC,SAAS,IAAI,CAAC,CAC7B,EACD;YACA,MAAM,IAAI,SAAS,CACjB,gFAAgF,SAAS,OAAO,OAAO,SAAS,GAAG,CACpH,CAAC;SACH;IACH,CAAC;IAED,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACI,IAAI;QACT,mCAAmC;QACnC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAExB,+EAA+E;QAC/E,+DAA+D;QAC/D,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE;YACrC,OAAO;SACR;QAED,kEAAkE;QAClE,IAAI,CAAC,iBAAiB,EAAE,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACU,OAAO,CAAC,IAAa;;YAChC,IAAI,IAAI,CAAC,WAAW,EAAE;gBACpB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;aACzD;YAED,mFAAmF;YACnF,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAEhC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE;gBACnC,iDAAiD;gBACjD,yDAAyD;gBACzD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC;gBAC9C,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;iBACxD;gBAED,2CAA2C;gBAC3C,MAAM,CAAC,SAAS,CAAC,CAAC;aACnB;YAED,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE;gBACtD,wCAAwC;gBACxC,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;aAC1B;QACH,CAAC;KAAA;IAED;;;;OAIG;IACU,OAAO;;YAClB,qEAAqE;YACrE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,IAAI,EAAE;gBACR,OAAO,SAAS,CAAC;aAClB;YAED,6BAA6B;YAC7B,IAAI,IAAyB,CAAC;YAE9B,+BAA+B;YAC/B,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE;gBACvE,2DAA2D;gBAC3D,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;aACpC;iBAAM;gBACL,8FAA8F;gBAC9F,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;gBAE1B,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;aACpC;YAED,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE;gBACnC,qCAAqC;gBACrC,yDAAyD;gBACzD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC;gBAC9C,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;iBACxD;gBAED,2CAA2C;gBAC3C,MAAM,CAAC,SAAS,CAAC,CAAC;aACnB;YAED,OAAO,IAAI,CAAC;QACd,CAAC;KAAA;IAEO,iBAAiB;QACvB,mDAAmD;QACnD,IAAI,MAAsC,CAAC;QAC3C,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,EAAE;YAC9D,MAAM,CAAC,SAAS,CAAC,CAAC;SACnB;IACH,CAAC;IAEO,SAAS;QACf,IAAI,IAAI,CAAC,WAAW,EAAE;YACpB,0CAA0C;YAC1C,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE;gBACrC,gDAAgD;gBAChD,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;oBAClC,iCAAiC;oBACjC,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBAEzB,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACW,aAAa;;YACzB,uEAAuE;YACvE,iFAAiF;YACjF,MAAM,SAAS,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACxC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,gCAAgC;YAChC,MAAM,SAAS,CAAC;YAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;YAEzC,+BAA+B;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC;KAAA;IAED;;OAEG;IACW,YAAY;;YACxB,uEAAuE;YACvE,iFAAiF;YACjF,MAAM,SAAS,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACxC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,gCAAgC;YAChC,MAAM,SAAS,CAAC;QAClB,CAAC;KAAA;IAED;;OAEG;IACW,WAAW;;YACvB,uEAAuE;YACvE,iFAAiF;YACjF,MAAM,UAAU,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACzC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,wCAAwC;YACxC,MAAM,UAAU,CAAC;QACnB,CAAC;KAAA;CACF;AAxND,sCAwNC"}

package/dist/blocking-queue.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=blocking-queue.test.d.ts.map

package/dist/blocking-queue.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocking-queue.test.d.ts","sourceRoot":"","sources":["../src/blocking-queue.test.ts"],"names":[],"mappings":""}

package/dist/blocking-queue.test.js

@@ -0,0 +1,175 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+/// <reference types="jest" />
+const blocking_queue_1 = require("./blocking-queue");
+describe('BlockingQueue', () => {
+    beforeAll(() => {
+        // nothing
+    });
+    beforeEach(() => {
+        jest.clearAllMocks();
+    });
+    describe('maxUnread: 0', () => {
+        it('single item enqueue/dequeue works', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 0 });
+            setTimeout(() => {
+                void queue.enqueue(1);
+            }, 1000);
+            const item = yield queue.dequeue();
+            queue.done();
+            expect(item).toBe(1);
+        }));
+        it('dequeue after done does not hang', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 0 });
+            setTimeout(() => {
+                void queue.enqueue(1);
+            }, 1000);
+            const item = yield queue.dequeue();
+            queue.done();
+            yield queue.dequeue();
+            expect(item).toBe(1);
+        }));
+        it('enqueue after done throws', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 0 });
+            setTimeout(() => {
+                void queue.enqueue(1);
+            }, 1000);
+            const item = yield queue.dequeue();
+            queue.done();
+            yield expect(() => tslib_1.__awaiter(void 0, void 0, void 0, function* () { return queue.enqueue(2); })).rejects.toThrowError('`enqueue` called after `done` called');
+            expect(item).toBe(1);
+        }));
+        it('balanced enqueue/dequeue works', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 0 });
+            const writers = [];
+            writers.push(queue.enqueue(1));
+            writers.push(queue.enqueue(2));
+            const readers = [];
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            yield Promise.all(writers);
+            queue.done();
+            yield Promise.all(readers);
+            expect(yield readers[0]).toBe(1);
+            expect(yield readers[1]).toBe(2);
+        }));
+        it('full queue blocks enqueue until dequeue', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            // Add first item
+            void queue.enqueue(1);
+            // Do not wait for second item to add (it will wait until an enqueue completes)
+            setTimeout(() => {
+                void queue.enqueue(2);
+            }, 2000);
+            const startTime = Date.now();
+            expect(yield queue.dequeue()).toBe(1);
+            expect(Date.now() - startTime).toBeLessThan(2000);
+            expect(yield queue.dequeue()).toBe(2);
+            expect(Date.now() - startTime).toBeGreaterThanOrEqual(2000);
+            queue.done();
+        }));
+    });
+    describe('maxUnread: 1', () => {
+        it('single item enqueue/dequeue works', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            yield queue.enqueue(1);
+            const item = yield queue.dequeue();
+            queue.done();
+            expect(item).toBe(1);
+        }));
+        it('dequeue after done does not hang', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            yield queue.enqueue(1);
+            const item = yield queue.dequeue();
+            queue.done();
+            yield queue.dequeue();
+            expect(item).toBe(1);
+        }));
+        it('dequeue after done and empty does not hang', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            yield queue.enqueue(1);
+            const item = yield queue.dequeue();
+            queue.done();
+            yield queue.dequeue();
+            expect(item).toBe(1);
+            yield queue.dequeue();
+        }));
+        it('enqueue after done throws', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            yield queue.enqueue(1);
+            const item = yield queue.dequeue();
+            queue.done();
+            yield expect(() => tslib_1.__awaiter(void 0, void 0, void 0, function* () { return queue.enqueue(2); })).rejects.toThrowError('`enqueue` called after `done` called');
+            expect(item).toBe(1);
+        }));
+        it('balanced enqueue/dequeue works', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            const writers = [];
+            writers.push(queue.enqueue(1));
+            writers.push(queue.enqueue(2));
+            const readers = [];
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            yield Promise.all(writers);
+            queue.done();
+            yield Promise.all(readers);
+            expect(yield readers[0]).toBe(1);
+            expect(yield readers[1]).toBe(2);
+        }));
+        it('more dequeue than enqueue works', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            const writers = [];
+            writers.push(queue.enqueue(1));
+            writers.push(queue.enqueue(2));
+            const readers = [];
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            yield Promise.all(writers);
+            queue.done();
+            yield Promise.all(readers);
+            expect(yield readers[0]).toBe(1);
+            expect(yield readers[1]).toBe(2);
+            expect(yield readers[2]).toBeUndefined();
+            expect(yield readers[3]).toBeUndefined();
+        }));
+        it('full queue blocks enqueue until dequeue', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 1 });
+            // Wait for first item to add
+            yield queue.enqueue(1);
+            // Do not wait for second item to add (it will wait until an enqueue completes)
+            setTimeout(() => {
+                void queue.enqueue(2);
+            }, 2000);
+            expect(yield queue.dequeue()).toBe(1);
+            const startTime = Date.now();
+            expect(yield queue.dequeue()).toBe(2);
+            const duration = Date.now() - startTime;
+            expect(duration).toBeGreaterThanOrEqual(2000);
+            queue.done();
+        }));
+    });
+    describe('maxUnread: 2', () => {
+        it('no reads until done works', () => tslib_1.__awaiter(void 0, void 0, void 0, function* () {
+            const queue = new blocking_queue_1.BlockingQueue({ maxUnread: 2 });
+            const writers = [];
+            writers.push(queue.enqueue(1));
+            writers.push(queue.enqueue(2));
+            yield Promise.all(writers);
+            queue.done();
+            const readers = [];
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            readers.push(queue.dequeue());
+            yield Promise.all(readers);
+            expect(yield readers[0]).toBe(1);
+            expect(yield readers[1]).toBe(2);
+            expect(yield readers[2]).toBeUndefined();
+            expect(yield readers[3]).toBeUndefined();
+        }));
+    });
+});
+//# sourceMappingURL=blocking-queue.test.js.map

package/dist/blocking-queue.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocking-queue.test.js","sourceRoot":"","sources":["../src/blocking-queue.test.ts"],"names":[],"mappings":";;;AAAA,8BAA8B;AAC9B,qDAAiD;AAEjD,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,SAAS,CAAC,GAAG,EAAE;QACb,UAAU;IACZ,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,GAAG,EAAE;QACd,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,mCAAmC,EAAE,GAAS,EAAE;YACjD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAS,EAAE;YAChD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAS,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,MAAM,CAAC,GAAS,EAAE,0DAAC,OAAA,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA,GAAA,CAAC,CAAC,OAAO,CAAC,YAAY,CAC7D,sCAAsC,CACvC,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAS,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,OAAO,GAAoB,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,OAAO,GAAkC,EAAE,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAE9B,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,KAAK,CAAC,IAAI,EAAE,CAAC;YAEb,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAS,EAAE;YACvD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAE1D,iBAAiB;YACjB,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACtB,+EAA+E;YAC/E,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;YAE5D,KAAK,CAAC,IAAI,EAAE,CAAC;QACf,CAAC,CAAA,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,mCAAmC,EAAE,GAAS,EAAE;YACjD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAS,EAAE;YAChD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAS,EAAE;YAC1D,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAErB,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;QACxB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAS,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,MAAM,CAAC,GAAS,EAAE,0DAAC,OAAA,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA,GAAA,CAAC,CAAC,OAAO,CAAC,YAAY,CAC7D,sCAAsC,CACvC,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAS,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,OAAO,GAAoB,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,OAAO,GAAkC,EAAE,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAE9B,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,KAAK,CAAC,IAAI,EAAE,CAAC;YAEb,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAS,EAAE;YAC/C,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,OAAO,GAAoB,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,OAAO,GAAkC,EAAE,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAE9B,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,KAAK,CAAC,IAAI,EAAE,CAAC;YAEb,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC3C,CAAC,CAAA,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAS,EAAE;YACvD,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAE1D,6BAA6B;YAC7B,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,+EAA+E;YAC/E,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;YAE9C,KAAK,CAAC,IAAI,EAAE,CAAC;QACf,CAAC,CAAA,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,2BAA2B,EAAE,GAAS,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,8BAAa,CAAS,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,OAAO,GAAoB,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAE/B,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,EAAE,CAAC;YAEb,MAAM,OAAO,GAAkC,EAAE,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAE9B,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3B,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC3C,CAAC,CAAA,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+import { IterableMapper } from './iterable-mapper';
+import { BlockingQueue } from './blocking-queue';
+import { IterableQueue } from './iterable-queue';
+import { IterableQueueMapper } from './iterable-queue-mapper';
+import { IterableQueueMapperSimple } from './iterable-queue-mapper-simple';
+import { Queue } from './queue';
+export { IterableMapper, IterableQueueMapper, IterableQueueMapperSimple, BlockingQueue, IterableQueue, Queue, };
+//# 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,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAC3E,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAEhC,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,yBAAyB,EACzB,aAAa,EACb,aAAa,EACb,KAAK,GACN,CAAC"}

package/dist/index.js

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Queue = exports.IterableQueue = exports.BlockingQueue = exports.IterableQueueMapperSimple = exports.IterableQueueMapper = exports.IterableMapper = void 0;
+const iterable_mapper_1 = require("./iterable-mapper");
+Object.defineProperty(exports, "IterableMapper", { enumerable: true, get: function () { return iterable_mapper_1.IterableMapper; } });
+const blocking_queue_1 = require("./blocking-queue");
+Object.defineProperty(exports, "BlockingQueue", { enumerable: true, get: function () { return blocking_queue_1.BlockingQueue; } });
+const iterable_queue_1 = require("./iterable-queue");
+Object.defineProperty(exports, "IterableQueue", { enumerable: true, get: function () { return iterable_queue_1.IterableQueue; } });
+const iterable_queue_mapper_1 = require("./iterable-queue-mapper");
+Object.defineProperty(exports, "IterableQueueMapper", { enumerable: true, get: function () { return iterable_queue_mapper_1.IterableQueueMapper; } });
+const iterable_queue_mapper_simple_1 = require("./iterable-queue-mapper-simple");
+Object.defineProperty(exports, "IterableQueueMapperSimple", { enumerable: true, get: function () { return iterable_queue_mapper_simple_1.IterableQueueMapperSimple; } });
+const queue_1 = require("./queue");
+Object.defineProperty(exports, "Queue", { enumerable: true, get: function () { return queue_1.Queue; } });
+//# 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,uDAAmD;AAQjD,+FARO,gCAAc,OAQP;AAPhB,qDAAiD;AAU/C,8FAVO,8BAAa,OAUP;AATf,qDAAiD;AAU/C,8FAVO,8BAAa,OAUP;AATf,mEAA8D;AAM5D,oGANO,2CAAmB,OAMP;AALrB,iFAA2E;AAMzE,0GANO,wDAAyB,OAMP;AAL3B,mCAAgC;AAQ9B,sFARO,aAAK,OAQP"}