langchain 0.3.31 → 1.0.0-alpha.1

package/dist/node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../../../../../../node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.js"],"sourcesContent":["'use strict';\nmodule.exports = (promise, onFinally) => {\n\tonFinally = onFinally || (() => {});\n\n\treturn promise.then(\n\t\tval => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => val),\n\t\terr => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => {\n\t\t\tthrow err;\n\t\t})\n\t);\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CACA,OAAO,UAAU,CAAC,SAAS,cAAc;EACxC,YAAY,cAAc,MAAM,CAAE;AAElC,SAAO,QAAQ,KACd,SAAO,IAAI,QAAQ,aAAW;GAC7B,QAAQ,WAAW,CAAC;EACpB,GAAE,KAAK,MAAM,IAAI,EAClB,SAAO,IAAI,QAAQ,aAAW;GAC7B,QAAQ,WAAW,CAAC;EACpB,GAAE,KAAK,MAAM;AACb,SAAM;EACN,EAAC,CACF;CACD"}

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.cjs

@@ -0,0 +1,267 @@
+"use strict";
+
+
+const require_rolldown_runtime = require('../../../../../../_virtual/rolldown_runtime.cjs');
+const require_index = require('../../../../eventemitter3@4.0.7/node_modules/eventemitter3/index.cjs');
+const require_index$1 = require('../../../../p-timeout@3.2.0/node_modules/p-timeout/index.cjs');
+const require_priority_queue$1 = require('./priority-queue.cjs');
+
+//#region ../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js
+var require_dist = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	const EventEmitter = require_index.require_eventemitter3();
+	const p_timeout_1 = require_index$1.require_p_timeout();
+	const priority_queue_1 = require_priority_queue$1.require_priority_queue();
+	const empty = () => {};
+	const timeoutError = new p_timeout_1.TimeoutError();
+	/**
+	Promise queue with concurrency control.
+	*/
+	var PQueue = class extends EventEmitter {
+		constructor(options) {
+			var _a, _b, _c, _d;
+			super();
+			this._intervalCount = 0;
+			this._intervalEnd = 0;
+			this._pendingCount = 0;
+			this._resolveEmpty = empty;
+			this._resolveIdle = empty;
+			options = Object.assign({
+				carryoverConcurrencyCount: false,
+				intervalCap: Infinity,
+				interval: 0,
+				concurrency: Infinity,
+				autoStart: true,
+				queueClass: priority_queue_1.default
+			}, options);
+			if (!(typeof options.intervalCap === "number" && options.intervalCap >= 1)) throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${(_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : ""}\` (${typeof options.intervalCap})`);
+			if (options.interval === void 0 || !(Number.isFinite(options.interval) && options.interval >= 0)) throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${(_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : ""}\` (${typeof options.interval})`);
+			this._carryoverConcurrencyCount = options.carryoverConcurrencyCount;
+			this._isIntervalIgnored = options.intervalCap === Infinity || options.interval === 0;
+			this._intervalCap = options.intervalCap;
+			this._interval = options.interval;
+			this._queue = new options.queueClass();
+			this._queueClass = options.queueClass;
+			this.concurrency = options.concurrency;
+			this._timeout = options.timeout;
+			this._throwOnTimeout = options.throwOnTimeout === true;
+			this._isPaused = options.autoStart === false;
+		}
+		get _doesIntervalAllowAnother() {
+			return this._isIntervalIgnored || this._intervalCount < this._intervalCap;
+		}
+		get _doesConcurrentAllowAnother() {
+			return this._pendingCount < this._concurrency;
+		}
+		_next() {
+			this._pendingCount--;
+			this._tryToStartAnother();
+			this.emit("next");
+		}
+		_resolvePromises() {
+			this._resolveEmpty();
+			this._resolveEmpty = empty;
+			if (this._pendingCount === 0) {
+				this._resolveIdle();
+				this._resolveIdle = empty;
+				this.emit("idle");
+			}
+		}
+		_onResumeInterval() {
+			this._onInterval();
+			this._initializeIntervalIfNeeded();
+			this._timeoutId = void 0;
+		}
+		_isIntervalPaused() {
+			const now = Date.now();
+			if (this._intervalId === void 0) {
+				const delay = this._intervalEnd - now;
+				if (delay < 0) this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;
+				else {
+					if (this._timeoutId === void 0) this._timeoutId = setTimeout(() => {
+						this._onResumeInterval();
+					}, delay);
+					return true;
+				}
+			}
+			return false;
+		}
+		_tryToStartAnother() {
+			if (this._queue.size === 0) {
+				if (this._intervalId) clearInterval(this._intervalId);
+				this._intervalId = void 0;
+				this._resolvePromises();
+				return false;
+			}
+			if (!this._isPaused) {
+				const canInitializeInterval = !this._isIntervalPaused();
+				if (this._doesIntervalAllowAnother && this._doesConcurrentAllowAnother) {
+					const job = this._queue.dequeue();
+					if (!job) return false;
+					this.emit("active");
+					job();
+					if (canInitializeInterval) this._initializeIntervalIfNeeded();
+					return true;
+				}
+			}
+			return false;
+		}
+		_initializeIntervalIfNeeded() {
+			if (this._isIntervalIgnored || this._intervalId !== void 0) return;
+			this._intervalId = setInterval(() => {
+				this._onInterval();
+			}, this._interval);
+			this._intervalEnd = Date.now() + this._interval;
+		}
+		_onInterval() {
+			if (this._intervalCount === 0 && this._pendingCount === 0 && this._intervalId) {
+				clearInterval(this._intervalId);
+				this._intervalId = void 0;
+			}
+			this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;
+			this._processQueue();
+		}
+		/**
+		Executes all queued functions until it reaches the limit.
+		*/
+		_processQueue() {
+			while (this._tryToStartAnother());
+		}
+		get concurrency() {
+			return this._concurrency;
+		}
+		set concurrency(newConcurrency) {
+			if (!(typeof newConcurrency === "number" && newConcurrency >= 1)) throw new TypeError(`Expected \`concurrency\` to be a number from 1 and up, got \`${newConcurrency}\` (${typeof newConcurrency})`);
+			this._concurrency = newConcurrency;
+			this._processQueue();
+		}
+		/**
+		Adds a sync or async task to the queue. Always returns a promise.
+		*/
+		async add(fn, options = {}) {
+			return new Promise((resolve, reject) => {
+				const run = async () => {
+					this._pendingCount++;
+					this._intervalCount++;
+					try {
+						const operation = this._timeout === void 0 && options.timeout === void 0 ? fn() : p_timeout_1.default(Promise.resolve(fn()), options.timeout === void 0 ? this._timeout : options.timeout, () => {
+							if (options.throwOnTimeout === void 0 ? this._throwOnTimeout : options.throwOnTimeout) reject(timeoutError);
+							return void 0;
+						});
+						resolve(await operation);
+					} catch (error) {
+						reject(error);
+					}
+					this._next();
+				};
+				this._queue.enqueue(run, options);
+				this._tryToStartAnother();
+				this.emit("add");
+			});
+		}
+		/**
+		Same as `.add()`, but accepts an array of sync or async functions.
+		
+		@returns A promise that resolves when all functions are resolved.
+		*/
+		async addAll(functions, options) {
+			return Promise.all(functions.map(async (function_) => this.add(function_, options)));
+		}
+		/**
+		Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)
+		*/
+		start() {
+			if (!this._isPaused) return this;
+			this._isPaused = false;
+			this._processQueue();
+			return this;
+		}
+		/**
+		Put queue execution on hold.
+		*/
+		pause() {
+			this._isPaused = true;
+		}
+		/**
+		Clear the queue.
+		*/
+		clear() {
+			this._queue = new this._queueClass();
+		}
+		/**
+		Can be called multiple times. Useful if you for example add additional items at a later time.
+		
+		@returns A promise that settles when the queue becomes empty.
+		*/
+		async onEmpty() {
+			if (this._queue.size === 0) return;
+			return new Promise((resolve) => {
+				const existingResolve = this._resolveEmpty;
+				this._resolveEmpty = () => {
+					existingResolve();
+					resolve();
+				};
+			});
+		}
+		/**
+		The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.
+		
+		@returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.
+		*/
+		async onIdle() {
+			if (this._pendingCount === 0 && this._queue.size === 0) return;
+			return new Promise((resolve) => {
+				const existingResolve = this._resolveIdle;
+				this._resolveIdle = () => {
+					existingResolve();
+					resolve();
+				};
+			});
+		}
+		/**
+		Size of the queue.
+		*/
+		get size() {
+			return this._queue.size;
+		}
+		/**
+		Size of the queue, filtered by the given options.
+		
+		For example, this can be used to find the number of items remaining in the queue with a specific priority level.
+		*/
+		sizeBy(options) {
+			return this._queue.filter(options).length;
+		}
+		/**
+		Number of pending promises.
+		*/
+		get pending() {
+			return this._pendingCount;
+		}
+		/**
+		Whether the queue is currently paused.
+		*/
+		get isPaused() {
+			return this._isPaused;
+		}
+		get timeout() {
+			return this._timeout;
+		}
+		/**
+		Set the timeout for future operations.
+		*/
+		set timeout(milliseconds) {
+			this._timeout = milliseconds;
+		}
+	};
+	exports.default = PQueue;
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_dist();
+  }
+});
+//# sourceMappingURL=index.cjs.map

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":[],"sources":["../../../../../../../../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EventEmitter = require(\"eventemitter3\");\nconst p_timeout_1 = require(\"p-timeout\");\nconst priority_queue_1 = require(\"./priority-queue\");\n// eslint-disable-next-line @typescript-eslint/no-empty-function\nconst empty = () => { };\nconst timeoutError = new p_timeout_1.TimeoutError();\n/**\nPromise queue with concurrency control.\n*/\nclass PQueue extends EventEmitter {\n    constructor(options) {\n        var _a, _b, _c, _d;\n        super();\n        this._intervalCount = 0;\n        this._intervalEnd = 0;\n        this._pendingCount = 0;\n        this._resolveEmpty = empty;\n        this._resolveIdle = empty;\n        // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n        options = Object.assign({ carryoverConcurrencyCount: false, intervalCap: Infinity, interval: 0, concurrency: Infinity, autoStart: true, queueClass: priority_queue_1.default }, options);\n        if (!(typeof options.intervalCap === 'number' && options.intervalCap >= 1)) {\n            throw new TypeError(`Expected \\`intervalCap\\` to be a number from 1 and up, got \\`${(_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : ''}\\` (${typeof options.intervalCap})`);\n        }\n        if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {\n            throw new TypeError(`Expected \\`interval\\` to be a finite number >= 0, got \\`${(_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : ''}\\` (${typeof options.interval})`);\n        }\n        this._carryoverConcurrencyCount = options.carryoverConcurrencyCount;\n        this._isIntervalIgnored = options.intervalCap === Infinity || options.interval === 0;\n        this._intervalCap = options.intervalCap;\n        this._interval = options.interval;\n        this._queue = new options.queueClass();\n        this._queueClass = options.queueClass;\n        this.concurrency = options.concurrency;\n        this._timeout = options.timeout;\n        this._throwOnTimeout = options.throwOnTimeout === true;\n        this._isPaused = options.autoStart === false;\n    }\n    get _doesIntervalAllowAnother() {\n        return this._isIntervalIgnored || this._intervalCount < this._intervalCap;\n    }\n    get _doesConcurrentAllowAnother() {\n        return this._pendingCount < this._concurrency;\n    }\n    _next() {\n        this._pendingCount--;\n        this._tryToStartAnother();\n        this.emit('next');\n    }\n    _resolvePromises() {\n        this._resolveEmpty();\n        this._resolveEmpty = empty;\n        if (this._pendingCount === 0) {\n            this._resolveIdle();\n            this._resolveIdle = empty;\n            this.emit('idle');\n        }\n    }\n    _onResumeInterval() {\n        this._onInterval();\n        this._initializeIntervalIfNeeded();\n        this._timeoutId = undefined;\n    }\n    _isIntervalPaused() {\n        const now = Date.now();\n        if (this._intervalId === undefined) {\n            const delay = this._intervalEnd - now;\n            if (delay < 0) {\n                // Act as the interval was done\n                // We don't need to resume it here because it will be resumed on line 160\n                this._intervalCount = (this._carryoverConcurrencyCount) ? this._pendingCount : 0;\n            }\n            else {\n                // Act as the interval is pending\n                if (this._timeoutId === undefined) {\n                    this._timeoutId = setTimeout(() => {\n                        this._onResumeInterval();\n                    }, delay);\n                }\n                return true;\n            }\n        }\n        return false;\n    }\n    _tryToStartAnother() {\n        if (this._queue.size === 0) {\n            // We can clear the interval (\"pause\")\n            // Because we can redo it later (\"resume\")\n            if (this._intervalId) {\n                clearInterval(this._intervalId);\n            }\n            this._intervalId = undefined;\n            this._resolvePromises();\n            return false;\n        }\n        if (!this._isPaused) {\n            const canInitializeInterval = !this._isIntervalPaused();\n            if (this._doesIntervalAllowAnother && this._doesConcurrentAllowAnother) {\n                const job = this._queue.dequeue();\n                if (!job) {\n                    return false;\n                }\n                this.emit('active');\n                job();\n                if (canInitializeInterval) {\n                    this._initializeIntervalIfNeeded();\n                }\n                return true;\n            }\n        }\n        return false;\n    }\n    _initializeIntervalIfNeeded() {\n        if (this._isIntervalIgnored || this._intervalId !== undefined) {\n            return;\n        }\n        this._intervalId = setInterval(() => {\n            this._onInterval();\n        }, this._interval);\n        this._intervalEnd = Date.now() + this._interval;\n    }\n    _onInterval() {\n        if (this._intervalCount === 0 && this._pendingCount === 0 && this._intervalId) {\n            clearInterval(this._intervalId);\n            this._intervalId = undefined;\n        }\n        this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;\n        this._processQueue();\n    }\n    /**\n    Executes all queued functions until it reaches the limit.\n    */\n    _processQueue() {\n        // eslint-disable-next-line no-empty\n        while (this._tryToStartAnother()) { }\n    }\n    get concurrency() {\n        return this._concurrency;\n    }\n    set concurrency(newConcurrency) {\n        if (!(typeof newConcurrency === 'number' && newConcurrency >= 1)) {\n            throw new TypeError(`Expected \\`concurrency\\` to be a number from 1 and up, got \\`${newConcurrency}\\` (${typeof newConcurrency})`);\n        }\n        this._concurrency = newConcurrency;\n        this._processQueue();\n    }\n    /**\n    Adds a sync or async task to the queue. Always returns a promise.\n    */\n    async add(fn, options = {}) {\n        return new Promise((resolve, reject) => {\n            const run = async () => {\n                this._pendingCount++;\n                this._intervalCount++;\n                try {\n                    const operation = (this._timeout === undefined && options.timeout === undefined) ? fn() : p_timeout_1.default(Promise.resolve(fn()), (options.timeout === undefined ? this._timeout : options.timeout), () => {\n                        if (options.throwOnTimeout === undefined ? this._throwOnTimeout : options.throwOnTimeout) {\n                            reject(timeoutError);\n                        }\n                        return undefined;\n                    });\n                    resolve(await operation);\n                }\n                catch (error) {\n                    reject(error);\n                }\n                this._next();\n            };\n            this._queue.enqueue(run, options);\n            this._tryToStartAnother();\n            this.emit('add');\n        });\n    }\n    /**\n    Same as `.add()`, but accepts an array of sync or async functions.\n\n    @returns A promise that resolves when all functions are resolved.\n    */\n    async addAll(functions, options) {\n        return Promise.all(functions.map(async (function_) => this.add(function_, options)));\n    }\n    /**\n    Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)\n    */\n    start() {\n        if (!this._isPaused) {\n            return this;\n        }\n        this._isPaused = false;\n        this._processQueue();\n        return this;\n    }\n    /**\n    Put queue execution on hold.\n    */\n    pause() {\n        this._isPaused = true;\n    }\n    /**\n    Clear the queue.\n    */\n    clear() {\n        this._queue = new this._queueClass();\n    }\n    /**\n    Can be called multiple times. Useful if you for example add additional items at a later time.\n\n    @returns A promise that settles when the queue becomes empty.\n    */\n    async onEmpty() {\n        // Instantly resolve if the queue is empty\n        if (this._queue.size === 0) {\n            return;\n        }\n        return new Promise(resolve => {\n            const existingResolve = this._resolveEmpty;\n            this._resolveEmpty = () => {\n                existingResolve();\n                resolve();\n            };\n        });\n    }\n    /**\n    The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.\n\n    @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.\n    */\n    async onIdle() {\n        // Instantly resolve if none pending and if nothing else is queued\n        if (this._pendingCount === 0 && this._queue.size === 0) {\n            return;\n        }\n        return new Promise(resolve => {\n            const existingResolve = this._resolveIdle;\n            this._resolveIdle = () => {\n                existingResolve();\n                resolve();\n            };\n        });\n    }\n    /**\n    Size of the queue.\n    */\n    get size() {\n        return this._queue.size;\n    }\n    /**\n    Size of the queue, filtered by the given options.\n\n    For example, this can be used to find the number of items remaining in the queue with a specific priority level.\n    */\n    sizeBy(options) {\n        // eslint-disable-next-line unicorn/no-fn-reference-in-iterator\n        return this._queue.filter(options).length;\n    }\n    /**\n    Number of pending promises.\n    */\n    get pending() {\n        return this._pendingCount;\n    }\n    /**\n    Whether the queue is currently paused.\n    */\n    get isPaused() {\n        return this._isPaused;\n    }\n    get timeout() {\n        return this._timeout;\n    }\n    /**\n    Set the timeout for future operations.\n    */\n    set timeout(milliseconds) {\n        this._timeout = milliseconds;\n    }\n}\nexports.default = PQueue;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;CACA,OAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAM,EAAC;CAC7D,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,QAAQ,MAAM,CAAG;CACvB,MAAM,eAAe,IAAI,YAAY;;;;CAIrC,IAAM,SAAN,cAAqB,aAAa;EAC9B,YAAY,SAAS;GACjB,IAAI,IAAI,IAAI,IAAI;GAChB,OAAO;GACP,KAAK,iBAAiB;GACtB,KAAK,eAAe;GACpB,KAAK,gBAAgB;GACrB,KAAK,gBAAgB;GACrB,KAAK,eAAe;GAEpB,UAAU,OAAO,OAAO;IAAE,2BAA2B;IAAO,aAAa;IAAU,UAAU;IAAG,aAAa;IAAU,WAAW;IAAM,YAAY,iBAAiB;GAAS,GAAE,QAAQ;AACxL,OAAI,EAAE,OAAO,QAAQ,gBAAgB,YAAY,QAAQ,eAAe,GACpE,OAAM,IAAI,UAAU,CAAC,6DAA6D,GAAG,MAAM,KAAK,QAAQ,iBAAiB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO,QAAQ,YAAY,CAAC,CAAC;AAEpP,OAAI,QAAQ,aAAa,UAAa,EAAE,OAAO,SAAS,QAAQ,SAAS,IAAI,QAAQ,YAAY,GAC7F,OAAM,IAAI,UAAU,CAAC,wDAAwD,GAAG,MAAM,KAAK,QAAQ,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO,QAAQ,SAAS,CAAC,CAAC;GAEzO,KAAK,6BAA6B,QAAQ;GAC1C,KAAK,qBAAqB,QAAQ,gBAAgB,YAAY,QAAQ,aAAa;GACnF,KAAK,eAAe,QAAQ;GAC5B,KAAK,YAAY,QAAQ;GACzB,KAAK,SAAS,IAAI,QAAQ;GAC1B,KAAK,cAAc,QAAQ;GAC3B,KAAK,cAAc,QAAQ;GAC3B,KAAK,WAAW,QAAQ;GACxB,KAAK,kBAAkB,QAAQ,mBAAmB;GAClD,KAAK,YAAY,QAAQ,cAAc;EAC1C;EACD,IAAI,4BAA4B;AAC5B,UAAO,KAAK,sBAAsB,KAAK,iBAAiB,KAAK;EAChE;EACD,IAAI,8BAA8B;AAC9B,UAAO,KAAK,gBAAgB,KAAK;EACpC;EACD,QAAQ;GACJ,KAAK;GACL,KAAK,oBAAoB;GACzB,KAAK,KAAK,OAAO;EACpB;EACD,mBAAmB;GACf,KAAK,eAAe;GACpB,KAAK,gBAAgB;AACrB,OAAI,KAAK,kBAAkB,GAAG;IAC1B,KAAK,cAAc;IACnB,KAAK,eAAe;IACpB,KAAK,KAAK,OAAO;GACpB;EACJ;EACD,oBAAoB;GAChB,KAAK,aAAa;GAClB,KAAK,6BAA6B;GAClC,KAAK,aAAa;EACrB;EACD,oBAAoB;GAChB,MAAM,MAAM,KAAK,KAAK;AACtB,OAAI,KAAK,gBAAgB,QAAW;IAChC,MAAM,QAAQ,KAAK,eAAe;AAClC,QAAI,QAAQ,GAGR,KAAK,iBAAkB,KAAK,6BAA8B,KAAK,gBAAgB;SAE9E;AAED,SAAI,KAAK,eAAe,QACpB,KAAK,aAAa,WAAW,MAAM;MAC/B,KAAK,mBAAmB;KAC3B,GAAE,MAAM;AAEb,YAAO;IACV;GACJ;AACD,UAAO;EACV;EACD,qBAAqB;AACjB,OAAI,KAAK,OAAO,SAAS,GAAG;AAGxB,QAAI,KAAK,aACL,cAAc,KAAK,YAAY;IAEnC,KAAK,cAAc;IACnB,KAAK,kBAAkB;AACvB,WAAO;GACV;AACD,OAAI,CAAC,KAAK,WAAW;IACjB,MAAM,wBAAwB,CAAC,KAAK,mBAAmB;AACvD,QAAI,KAAK,6BAA6B,KAAK,6BAA6B;KACpE,MAAM,MAAM,KAAK,OAAO,SAAS;AACjC,SAAI,CAAC,IACD,QAAO;KAEX,KAAK,KAAK,SAAS;KACnB,KAAK;AACL,SAAI,uBACA,KAAK,6BAA6B;AAEtC,YAAO;IACV;GACJ;AACD,UAAO;EACV;EACD,8BAA8B;AAC1B,OAAI,KAAK,sBAAsB,KAAK,gBAAgB,OAChD;GAEJ,KAAK,cAAc,YAAY,MAAM;IACjC,KAAK,aAAa;GACrB,GAAE,KAAK,UAAU;GAClB,KAAK,eAAe,KAAK,KAAK,GAAG,KAAK;EACzC;EACD,cAAc;AACV,OAAI,KAAK,mBAAmB,KAAK,KAAK,kBAAkB,KAAK,KAAK,aAAa;IAC3E,cAAc,KAAK,YAAY;IAC/B,KAAK,cAAc;GACtB;GACD,KAAK,iBAAiB,KAAK,6BAA6B,KAAK,gBAAgB;GAC7E,KAAK,eAAe;EACvB;;;;EAID,gBAAgB;AAEZ,UAAO,KAAK,oBAAoB;EACnC;EACD,IAAI,cAAc;AACd,UAAO,KAAK;EACf;EACD,IAAI,YAAY,gBAAgB;AAC5B,OAAI,EAAE,OAAO,mBAAmB,YAAY,kBAAkB,GAC1D,OAAM,IAAI,UAAU,CAAC,6DAA6D,EAAE,eAAe,IAAI,EAAE,OAAO,eAAe,CAAC,CAAC;GAErI,KAAK,eAAe;GACpB,KAAK,eAAe;EACvB;;;;EAID,MAAM,IAAI,IAAI,UAAU,CAAE,GAAE;AACxB,UAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;IACpC,MAAM,MAAM,YAAY;KACpB,KAAK;KACL,KAAK;AACL,SAAI;MACA,MAAM,YAAa,KAAK,aAAa,UAAa,QAAQ,YAAY,SAAa,IAAI,GAAG,YAAY,QAAQ,QAAQ,QAAQ,IAAI,CAAC,EAAG,QAAQ,YAAY,SAAY,KAAK,WAAW,QAAQ,SAAU,MAAM;AAC1M,WAAI,QAAQ,mBAAmB,SAAY,KAAK,kBAAkB,QAAQ,gBACtE,OAAO,aAAa;AAExB,cAAO;MACV,EAAC;MACF,QAAQ,MAAM,UAAU;KAC3B,SACM,OAAO;MACV,OAAO,MAAM;KAChB;KACD,KAAK,OAAO;IACf;IACD,KAAK,OAAO,QAAQ,KAAK,QAAQ;IACjC,KAAK,oBAAoB;IACzB,KAAK,KAAK,MAAM;GACnB;EACJ;;;;;;EAMD,MAAM,OAAO,WAAW,SAAS;AAC7B,UAAO,QAAQ,IAAI,UAAU,IAAI,OAAO,cAAc,KAAK,IAAI,WAAW,QAAQ,CAAC,CAAC;EACvF;;;;EAID,QAAQ;AACJ,OAAI,CAAC,KAAK,UACN,QAAO;GAEX,KAAK,YAAY;GACjB,KAAK,eAAe;AACpB,UAAO;EACV;;;;EAID,QAAQ;GACJ,KAAK,YAAY;EACpB;;;;EAID,QAAQ;GACJ,KAAK,SAAS,IAAI,KAAK;EAC1B;;;;;;EAMD,MAAM,UAAU;AAEZ,OAAI,KAAK,OAAO,SAAS,EACrB;AAEJ,UAAO,IAAI,QAAQ,aAAW;IAC1B,MAAM,kBAAkB,KAAK;IAC7B,KAAK,gBAAgB,MAAM;KACvB,iBAAiB;KACjB,SAAS;IACZ;GACJ;EACJ;;;;;;EAMD,MAAM,SAAS;AAEX,OAAI,KAAK,kBAAkB,KAAK,KAAK,OAAO,SAAS,EACjD;AAEJ,UAAO,IAAI,QAAQ,aAAW;IAC1B,MAAM,kBAAkB,KAAK;IAC7B,KAAK,eAAe,MAAM;KACtB,iBAAiB;KACjB,SAAS;IACZ;GACJ;EACJ;;;;EAID,IAAI,OAAO;AACP,UAAO,KAAK,OAAO;EACtB;;;;;;EAMD,OAAO,SAAS;AAEZ,UAAO,KAAK,OAAO,OAAO,QAAQ,CAAC;EACtC;;;;EAID,IAAI,UAAU;AACV,UAAO,KAAK;EACf;;;;EAID,IAAI,WAAW;AACX,UAAO,KAAK;EACf;EACD,IAAI,UAAU;AACV,UAAO,KAAK;EACf;;;;EAID,IAAI,QAAQ,cAAc;GACtB,KAAK,WAAW;EACnB;CACJ;CACD,QAAQ,UAAU"}

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js

@@ -0,0 +1,263 @@
+
+
+import { __commonJS } from "../../../../../../_virtual/rolldown_runtime.js";
+import { require_eventemitter3 } from "../../../../eventemitter3@4.0.7/node_modules/eventemitter3/index.js";
+import { require_p_timeout } from "../../../../p-timeout@3.2.0/node_modules/p-timeout/index.js";
+import { require_priority_queue } from "./priority-queue.js";
+
+//#region ../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js
+var require_dist = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	const EventEmitter = require_eventemitter3();
+	const p_timeout_1 = require_p_timeout();
+	const priority_queue_1 = require_priority_queue();
+	const empty = () => {};
+	const timeoutError = new p_timeout_1.TimeoutError();
+	/**
+	Promise queue with concurrency control.
+	*/
+	var PQueue = class extends EventEmitter {
+		constructor(options) {
+			var _a, _b, _c, _d;
+			super();
+			this._intervalCount = 0;
+			this._intervalEnd = 0;
+			this._pendingCount = 0;
+			this._resolveEmpty = empty;
+			this._resolveIdle = empty;
+			options = Object.assign({
+				carryoverConcurrencyCount: false,
+				intervalCap: Infinity,
+				interval: 0,
+				concurrency: Infinity,
+				autoStart: true,
+				queueClass: priority_queue_1.default
+			}, options);
+			if (!(typeof options.intervalCap === "number" && options.intervalCap >= 1)) throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${(_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : ""}\` (${typeof options.intervalCap})`);
+			if (options.interval === void 0 || !(Number.isFinite(options.interval) && options.interval >= 0)) throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${(_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : ""}\` (${typeof options.interval})`);
+			this._carryoverConcurrencyCount = options.carryoverConcurrencyCount;
+			this._isIntervalIgnored = options.intervalCap === Infinity || options.interval === 0;
+			this._intervalCap = options.intervalCap;
+			this._interval = options.interval;
+			this._queue = new options.queueClass();
+			this._queueClass = options.queueClass;
+			this.concurrency = options.concurrency;
+			this._timeout = options.timeout;
+			this._throwOnTimeout = options.throwOnTimeout === true;
+			this._isPaused = options.autoStart === false;
+		}
+		get _doesIntervalAllowAnother() {
+			return this._isIntervalIgnored || this._intervalCount < this._intervalCap;
+		}
+		get _doesConcurrentAllowAnother() {
+			return this._pendingCount < this._concurrency;
+		}
+		_next() {
+			this._pendingCount--;
+			this._tryToStartAnother();
+			this.emit("next");
+		}
+		_resolvePromises() {
+			this._resolveEmpty();
+			this._resolveEmpty = empty;
+			if (this._pendingCount === 0) {
+				this._resolveIdle();
+				this._resolveIdle = empty;
+				this.emit("idle");
+			}
+		}
+		_onResumeInterval() {
+			this._onInterval();
+			this._initializeIntervalIfNeeded();
+			this._timeoutId = void 0;
+		}
+		_isIntervalPaused() {
+			const now = Date.now();
+			if (this._intervalId === void 0) {
+				const delay = this._intervalEnd - now;
+				if (delay < 0) this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;
+				else {
+					if (this._timeoutId === void 0) this._timeoutId = setTimeout(() => {
+						this._onResumeInterval();
+					}, delay);
+					return true;
+				}
+			}
+			return false;
+		}
+		_tryToStartAnother() {
+			if (this._queue.size === 0) {
+				if (this._intervalId) clearInterval(this._intervalId);
+				this._intervalId = void 0;
+				this._resolvePromises();
+				return false;
+			}
+			if (!this._isPaused) {
+				const canInitializeInterval = !this._isIntervalPaused();
+				if (this._doesIntervalAllowAnother && this._doesConcurrentAllowAnother) {
+					const job = this._queue.dequeue();
+					if (!job) return false;
+					this.emit("active");
+					job();
+					if (canInitializeInterval) this._initializeIntervalIfNeeded();
+					return true;
+				}
+			}
+			return false;
+		}
+		_initializeIntervalIfNeeded() {
+			if (this._isIntervalIgnored || this._intervalId !== void 0) return;
+			this._intervalId = setInterval(() => {
+				this._onInterval();
+			}, this._interval);
+			this._intervalEnd = Date.now() + this._interval;
+		}
+		_onInterval() {
+			if (this._intervalCount === 0 && this._pendingCount === 0 && this._intervalId) {
+				clearInterval(this._intervalId);
+				this._intervalId = void 0;
+			}
+			this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;
+			this._processQueue();
+		}
+		/**
+		Executes all queued functions until it reaches the limit.
+		*/
+		_processQueue() {
+			while (this._tryToStartAnother());
+		}
+		get concurrency() {
+			return this._concurrency;
+		}
+		set concurrency(newConcurrency) {
+			if (!(typeof newConcurrency === "number" && newConcurrency >= 1)) throw new TypeError(`Expected \`concurrency\` to be a number from 1 and up, got \`${newConcurrency}\` (${typeof newConcurrency})`);
+			this._concurrency = newConcurrency;
+			this._processQueue();
+		}
+		/**
+		Adds a sync or async task to the queue. Always returns a promise.
+		*/
+		async add(fn, options = {}) {
+			return new Promise((resolve, reject) => {
+				const run = async () => {
+					this._pendingCount++;
+					this._intervalCount++;
+					try {
+						const operation = this._timeout === void 0 && options.timeout === void 0 ? fn() : p_timeout_1.default(Promise.resolve(fn()), options.timeout === void 0 ? this._timeout : options.timeout, () => {
+							if (options.throwOnTimeout === void 0 ? this._throwOnTimeout : options.throwOnTimeout) reject(timeoutError);
+							return void 0;
+						});
+						resolve(await operation);
+					} catch (error) {
+						reject(error);
+					}
+					this._next();
+				};
+				this._queue.enqueue(run, options);
+				this._tryToStartAnother();
+				this.emit("add");
+			});
+		}
+		/**
+		Same as `.add()`, but accepts an array of sync or async functions.
+		
+		@returns A promise that resolves when all functions are resolved.
+		*/
+		async addAll(functions, options) {
+			return Promise.all(functions.map(async (function_) => this.add(function_, options)));
+		}
+		/**
+		Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)
+		*/
+		start() {
+			if (!this._isPaused) return this;
+			this._isPaused = false;
+			this._processQueue();
+			return this;
+		}
+		/**
+		Put queue execution on hold.
+		*/
+		pause() {
+			this._isPaused = true;
+		}
+		/**
+		Clear the queue.
+		*/
+		clear() {
+			this._queue = new this._queueClass();
+		}
+		/**
+		Can be called multiple times. Useful if you for example add additional items at a later time.
+		
+		@returns A promise that settles when the queue becomes empty.
+		*/
+		async onEmpty() {
+			if (this._queue.size === 0) return;
+			return new Promise((resolve) => {
+				const existingResolve = this._resolveEmpty;
+				this._resolveEmpty = () => {
+					existingResolve();
+					resolve();
+				};
+			});
+		}
+		/**
+		The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.
+		
+		@returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.
+		*/
+		async onIdle() {
+			if (this._pendingCount === 0 && this._queue.size === 0) return;
+			return new Promise((resolve) => {
+				const existingResolve = this._resolveIdle;
+				this._resolveIdle = () => {
+					existingResolve();
+					resolve();
+				};
+			});
+		}
+		/**
+		Size of the queue.
+		*/
+		get size() {
+			return this._queue.size;
+		}
+		/**
+		Size of the queue, filtered by the given options.
+		
+		For example, this can be used to find the number of items remaining in the queue with a specific priority level.
+		*/
+		sizeBy(options) {
+			return this._queue.filter(options).length;
+		}
+		/**
+		Number of pending promises.
+		*/
+		get pending() {
+			return this._pendingCount;
+		}
+		/**
+		Whether the queue is currently paused.
+		*/
+		get isPaused() {
+			return this._isPaused;
+		}
+		get timeout() {
+			return this._timeout;
+		}
+		/**
+		Set the timeout for future operations.
+		*/
+		set timeout(milliseconds) {
+			this._timeout = milliseconds;
+		}
+	};
+	exports.default = PQueue;
+}) });
+
+//#endregion
+export default require_dist();
+
+export { require_dist };
+//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../../../../../../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EventEmitter = require(\"eventemitter3\");\nconst p_timeout_1 = require(\"p-timeout\");\nconst priority_queue_1 = require(\"./priority-queue\");\n// eslint-disable-next-line @typescript-eslint/no-empty-function\nconst empty = () => { };\nconst timeoutError = new p_timeout_1.TimeoutError();\n/**\nPromise queue with concurrency control.\n*/\nclass PQueue extends EventEmitter {\n    constructor(options) {\n        var _a, _b, _c, _d;\n        super();\n        this._intervalCount = 0;\n        this._intervalEnd = 0;\n        this._pendingCount = 0;\n        this._resolveEmpty = empty;\n        this._resolveIdle = empty;\n        // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n        options = Object.assign({ carryoverConcurrencyCount: false, intervalCap: Infinity, interval: 0, concurrency: Infinity, autoStart: true, queueClass: priority_queue_1.default }, options);\n        if (!(typeof options.intervalCap === 'number' && options.intervalCap >= 1)) {\n            throw new TypeError(`Expected \\`intervalCap\\` to be a number from 1 and up, got \\`${(_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : ''}\\` (${typeof options.intervalCap})`);\n        }\n        if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {\n            throw new TypeError(`Expected \\`interval\\` to be a finite number >= 0, got \\`${(_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : ''}\\` (${typeof options.interval})`);\n        }\n        this._carryoverConcurrencyCount = options.carryoverConcurrencyCount;\n        this._isIntervalIgnored = options.intervalCap === Infinity || options.interval === 0;\n        this._intervalCap = options.intervalCap;\n        this._interval = options.interval;\n        this._queue = new options.queueClass();\n        this._queueClass = options.queueClass;\n        this.concurrency = options.concurrency;\n        this._timeout = options.timeout;\n        this._throwOnTimeout = options.throwOnTimeout === true;\n        this._isPaused = options.autoStart === false;\n    }\n    get _doesIntervalAllowAnother() {\n        return this._isIntervalIgnored || this._intervalCount < this._intervalCap;\n    }\n    get _doesConcurrentAllowAnother() {\n        return this._pendingCount < this._concurrency;\n    }\n    _next() {\n        this._pendingCount--;\n        this._tryToStartAnother();\n        this.emit('next');\n    }\n    _resolvePromises() {\n        this._resolveEmpty();\n        this._resolveEmpty = empty;\n        if (this._pendingCount === 0) {\n            this._resolveIdle();\n            this._resolveIdle = empty;\n            this.emit('idle');\n        }\n    }\n    _onResumeInterval() {\n        this._onInterval();\n        this._initializeIntervalIfNeeded();\n        this._timeoutId = undefined;\n    }\n    _isIntervalPaused() {\n        const now = Date.now();\n        if (this._intervalId === undefined) {\n            const delay = this._intervalEnd - now;\n            if (delay < 0) {\n                // Act as the interval was done\n                // We don't need to resume it here because it will be resumed on line 160\n                this._intervalCount = (this._carryoverConcurrencyCount) ? this._pendingCount : 0;\n            }\n            else {\n                // Act as the interval is pending\n                if (this._timeoutId === undefined) {\n                    this._timeoutId = setTimeout(() => {\n                        this._onResumeInterval();\n                    }, delay);\n                }\n                return true;\n            }\n        }\n        return false;\n    }\n    _tryToStartAnother() {\n        if (this._queue.size === 0) {\n            // We can clear the interval (\"pause\")\n            // Because we can redo it later (\"resume\")\n            if (this._intervalId) {\n                clearInterval(this._intervalId);\n            }\n            this._intervalId = undefined;\n            this._resolvePromises();\n            return false;\n        }\n        if (!this._isPaused) {\n            const canInitializeInterval = !this._isIntervalPaused();\n            if (this._doesIntervalAllowAnother && this._doesConcurrentAllowAnother) {\n                const job = this._queue.dequeue();\n                if (!job) {\n                    return false;\n                }\n                this.emit('active');\n                job();\n                if (canInitializeInterval) {\n                    this._initializeIntervalIfNeeded();\n                }\n                return true;\n            }\n        }\n        return false;\n    }\n    _initializeIntervalIfNeeded() {\n        if (this._isIntervalIgnored || this._intervalId !== undefined) {\n            return;\n        }\n        this._intervalId = setInterval(() => {\n            this._onInterval();\n        }, this._interval);\n        this._intervalEnd = Date.now() + this._interval;\n    }\n    _onInterval() {\n        if (this._intervalCount === 0 && this._pendingCount === 0 && this._intervalId) {\n            clearInterval(this._intervalId);\n            this._intervalId = undefined;\n        }\n        this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;\n        this._processQueue();\n    }\n    /**\n    Executes all queued functions until it reaches the limit.\n    */\n    _processQueue() {\n        // eslint-disable-next-line no-empty\n        while (this._tryToStartAnother()) { }\n    }\n    get concurrency() {\n        return this._concurrency;\n    }\n    set concurrency(newConcurrency) {\n        if (!(typeof newConcurrency === 'number' && newConcurrency >= 1)) {\n            throw new TypeError(`Expected \\`concurrency\\` to be a number from 1 and up, got \\`${newConcurrency}\\` (${typeof newConcurrency})`);\n        }\n        this._concurrency = newConcurrency;\n        this._processQueue();\n    }\n    /**\n    Adds a sync or async task to the queue. Always returns a promise.\n    */\n    async add(fn, options = {}) {\n        return new Promise((resolve, reject) => {\n            const run = async () => {\n                this._pendingCount++;\n                this._intervalCount++;\n                try {\n                    const operation = (this._timeout === undefined && options.timeout === undefined) ? fn() : p_timeout_1.default(Promise.resolve(fn()), (options.timeout === undefined ? this._timeout : options.timeout), () => {\n                        if (options.throwOnTimeout === undefined ? this._throwOnTimeout : options.throwOnTimeout) {\n                            reject(timeoutError);\n                        }\n                        return undefined;\n                    });\n                    resolve(await operation);\n                }\n                catch (error) {\n                    reject(error);\n                }\n                this._next();\n            };\n            this._queue.enqueue(run, options);\n            this._tryToStartAnother();\n            this.emit('add');\n        });\n    }\n    /**\n    Same as `.add()`, but accepts an array of sync or async functions.\n\n    @returns A promise that resolves when all functions are resolved.\n    */\n    async addAll(functions, options) {\n        return Promise.all(functions.map(async (function_) => this.add(function_, options)));\n    }\n    /**\n    Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)\n    */\n    start() {\n        if (!this._isPaused) {\n            return this;\n        }\n        this._isPaused = false;\n        this._processQueue();\n        return this;\n    }\n    /**\n    Put queue execution on hold.\n    */\n    pause() {\n        this._isPaused = true;\n    }\n    /**\n    Clear the queue.\n    */\n    clear() {\n        this._queue = new this._queueClass();\n    }\n    /**\n    Can be called multiple times. Useful if you for example add additional items at a later time.\n\n    @returns A promise that settles when the queue becomes empty.\n    */\n    async onEmpty() {\n        // Instantly resolve if the queue is empty\n        if (this._queue.size === 0) {\n            return;\n        }\n        return new Promise(resolve => {\n            const existingResolve = this._resolveEmpty;\n            this._resolveEmpty = () => {\n                existingResolve();\n                resolve();\n            };\n        });\n    }\n    /**\n    The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.\n\n    @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.\n    */\n    async onIdle() {\n        // Instantly resolve if none pending and if nothing else is queued\n        if (this._pendingCount === 0 && this._queue.size === 0) {\n            return;\n        }\n        return new Promise(resolve => {\n            const existingResolve = this._resolveIdle;\n            this._resolveIdle = () => {\n                existingResolve();\n                resolve();\n            };\n        });\n    }\n    /**\n    Size of the queue.\n    */\n    get size() {\n        return this._queue.size;\n    }\n    /**\n    Size of the queue, filtered by the given options.\n\n    For example, this can be used to find the number of items remaining in the queue with a specific priority level.\n    */\n    sizeBy(options) {\n        // eslint-disable-next-line unicorn/no-fn-reference-in-iterator\n        return this._queue.filter(options).length;\n    }\n    /**\n    Number of pending promises.\n    */\n    get pending() {\n        return this._pendingCount;\n    }\n    /**\n    Whether the queue is currently paused.\n    */\n    get isPaused() {\n        return this._isPaused;\n    }\n    get timeout() {\n        return this._timeout;\n    }\n    /**\n    Set the timeout for future operations.\n    */\n    set timeout(milliseconds) {\n        this._timeout = milliseconds;\n    }\n}\nexports.default = PQueue;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;CACA,OAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAM,EAAC;CAC7D,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,QAAQ,MAAM,CAAG;CACvB,MAAM,eAAe,IAAI,YAAY;;;;CAIrC,IAAM,SAAN,cAAqB,aAAa;EAC9B,YAAY,SAAS;GACjB,IAAI,IAAI,IAAI,IAAI;GAChB,OAAO;GACP,KAAK,iBAAiB;GACtB,KAAK,eAAe;GACpB,KAAK,gBAAgB;GACrB,KAAK,gBAAgB;GACrB,KAAK,eAAe;GAEpB,UAAU,OAAO,OAAO;IAAE,2BAA2B;IAAO,aAAa;IAAU,UAAU;IAAG,aAAa;IAAU,WAAW;IAAM,YAAY,iBAAiB;GAAS,GAAE,QAAQ;AACxL,OAAI,EAAE,OAAO,QAAQ,gBAAgB,YAAY,QAAQ,eAAe,GACpE,OAAM,IAAI,UAAU,CAAC,6DAA6D,GAAG,MAAM,KAAK,QAAQ,iBAAiB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO,QAAQ,YAAY,CAAC,CAAC;AAEpP,OAAI,QAAQ,aAAa,UAAa,EAAE,OAAO,SAAS,QAAQ,SAAS,IAAI,QAAQ,YAAY,GAC7F,OAAM,IAAI,UAAU,CAAC,wDAAwD,GAAG,MAAM,KAAK,QAAQ,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO,QAAQ,SAAS,CAAC,CAAC;GAEzO,KAAK,6BAA6B,QAAQ;GAC1C,KAAK,qBAAqB,QAAQ,gBAAgB,YAAY,QAAQ,aAAa;GACnF,KAAK,eAAe,QAAQ;GAC5B,KAAK,YAAY,QAAQ;GACzB,KAAK,SAAS,IAAI,QAAQ;GAC1B,KAAK,cAAc,QAAQ;GAC3B,KAAK,cAAc,QAAQ;GAC3B,KAAK,WAAW,QAAQ;GACxB,KAAK,kBAAkB,QAAQ,mBAAmB;GAClD,KAAK,YAAY,QAAQ,cAAc;EAC1C;EACD,IAAI,4BAA4B;AAC5B,UAAO,KAAK,sBAAsB,KAAK,iBAAiB,KAAK;EAChE;EACD,IAAI,8BAA8B;AAC9B,UAAO,KAAK,gBAAgB,KAAK;EACpC;EACD,QAAQ;GACJ,KAAK;GACL,KAAK,oBAAoB;GACzB,KAAK,KAAK,OAAO;EACpB;EACD,mBAAmB;GACf,KAAK,eAAe;GACpB,KAAK,gBAAgB;AACrB,OAAI,KAAK,kBAAkB,GAAG;IAC1B,KAAK,cAAc;IACnB,KAAK,eAAe;IACpB,KAAK,KAAK,OAAO;GACpB;EACJ;EACD,oBAAoB;GAChB,KAAK,aAAa;GAClB,KAAK,6BAA6B;GAClC,KAAK,aAAa;EACrB;EACD,oBAAoB;GAChB,MAAM,MAAM,KAAK,KAAK;AACtB,OAAI,KAAK,gBAAgB,QAAW;IAChC,MAAM,QAAQ,KAAK,eAAe;AAClC,QAAI,QAAQ,GAGR,KAAK,iBAAkB,KAAK,6BAA8B,KAAK,gBAAgB;SAE9E;AAED,SAAI,KAAK,eAAe,QACpB,KAAK,aAAa,WAAW,MAAM;MAC/B,KAAK,mBAAmB;KAC3B,GAAE,MAAM;AAEb,YAAO;IACV;GACJ;AACD,UAAO;EACV;EACD,qBAAqB;AACjB,OAAI,KAAK,OAAO,SAAS,GAAG;AAGxB,QAAI,KAAK,aACL,cAAc,KAAK,YAAY;IAEnC,KAAK,cAAc;IACnB,KAAK,kBAAkB;AACvB,WAAO;GACV;AACD,OAAI,CAAC,KAAK,WAAW;IACjB,MAAM,wBAAwB,CAAC,KAAK,mBAAmB;AACvD,QAAI,KAAK,6BAA6B,KAAK,6BAA6B;KACpE,MAAM,MAAM,KAAK,OAAO,SAAS;AACjC,SAAI,CAAC,IACD,QAAO;KAEX,KAAK,KAAK,SAAS;KACnB,KAAK;AACL,SAAI,uBACA,KAAK,6BAA6B;AAEtC,YAAO;IACV;GACJ;AACD,UAAO;EACV;EACD,8BAA8B;AAC1B,OAAI,KAAK,sBAAsB,KAAK,gBAAgB,OAChD;GAEJ,KAAK,cAAc,YAAY,MAAM;IACjC,KAAK,aAAa;GACrB,GAAE,KAAK,UAAU;GAClB,KAAK,eAAe,KAAK,KAAK,GAAG,KAAK;EACzC;EACD,cAAc;AACV,OAAI,KAAK,mBAAmB,KAAK,KAAK,kBAAkB,KAAK,KAAK,aAAa;IAC3E,cAAc,KAAK,YAAY;IAC/B,KAAK,cAAc;GACtB;GACD,KAAK,iBAAiB,KAAK,6BAA6B,KAAK,gBAAgB;GAC7E,KAAK,eAAe;EACvB;;;;EAID,gBAAgB;AAEZ,UAAO,KAAK,oBAAoB;EACnC;EACD,IAAI,cAAc;AACd,UAAO,KAAK;EACf;EACD,IAAI,YAAY,gBAAgB;AAC5B,OAAI,EAAE,OAAO,mBAAmB,YAAY,kBAAkB,GAC1D,OAAM,IAAI,UAAU,CAAC,6DAA6D,EAAE,eAAe,IAAI,EAAE,OAAO,eAAe,CAAC,CAAC;GAErI,KAAK,eAAe;GACpB,KAAK,eAAe;EACvB;;;;EAID,MAAM,IAAI,IAAI,UAAU,CAAE,GAAE;AACxB,UAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;IACpC,MAAM,MAAM,YAAY;KACpB,KAAK;KACL,KAAK;AACL,SAAI;MACA,MAAM,YAAa,KAAK,aAAa,UAAa,QAAQ,YAAY,SAAa,IAAI,GAAG,YAAY,QAAQ,QAAQ,QAAQ,IAAI,CAAC,EAAG,QAAQ,YAAY,SAAY,KAAK,WAAW,QAAQ,SAAU,MAAM;AAC1M,WAAI,QAAQ,mBAAmB,SAAY,KAAK,kBAAkB,QAAQ,gBACtE,OAAO,aAAa;AAExB,cAAO;MACV,EAAC;MACF,QAAQ,MAAM,UAAU;KAC3B,SACM,OAAO;MACV,OAAO,MAAM;KAChB;KACD,KAAK,OAAO;IACf;IACD,KAAK,OAAO,QAAQ,KAAK,QAAQ;IACjC,KAAK,oBAAoB;IACzB,KAAK,KAAK,MAAM;GACnB;EACJ;;;;;;EAMD,MAAM,OAAO,WAAW,SAAS;AAC7B,UAAO,QAAQ,IAAI,UAAU,IAAI,OAAO,cAAc,KAAK,IAAI,WAAW,QAAQ,CAAC,CAAC;EACvF;;;;EAID,QAAQ;AACJ,OAAI,CAAC,KAAK,UACN,QAAO;GAEX,KAAK,YAAY;GACjB,KAAK,eAAe;AACpB,UAAO;EACV;;;;EAID,QAAQ;GACJ,KAAK,YAAY;EACpB;;;;EAID,QAAQ;GACJ,KAAK,SAAS,IAAI,KAAK;EAC1B;;;;;;EAMD,MAAM,UAAU;AAEZ,OAAI,KAAK,OAAO,SAAS,EACrB;AAEJ,UAAO,IAAI,QAAQ,aAAW;IAC1B,MAAM,kBAAkB,KAAK;IAC7B,KAAK,gBAAgB,MAAM;KACvB,iBAAiB;KACjB,SAAS;IACZ;GACJ;EACJ;;;;;;EAMD,MAAM,SAAS;AAEX,OAAI,KAAK,kBAAkB,KAAK,KAAK,OAAO,SAAS,EACjD;AAEJ,UAAO,IAAI,QAAQ,aAAW;IAC1B,MAAM,kBAAkB,KAAK;IAC7B,KAAK,eAAe,MAAM;KACtB,iBAAiB;KACjB,SAAS;IACZ;GACJ;EACJ;;;;EAID,IAAI,OAAO;AACP,UAAO,KAAK,OAAO;EACtB;;;;;;EAMD,OAAO,SAAS;AAEZ,UAAO,KAAK,OAAO,OAAO,QAAQ,CAAC;EACtC;;;;EAID,IAAI,UAAU;AACV,UAAO,KAAK;EACf;;;;EAID,IAAI,WAAW;AACX,UAAO,KAAK;EACf;EACD,IAAI,UAAU;AACV,UAAO,KAAK;EACf;;;;EAID,IAAI,QAAQ,cAAc;GACtB,KAAK,WAAW;EACnB;CACJ;CACD,QAAQ,UAAU"}

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.cjs

@@ -0,0 +1,32 @@
+"use strict";
+
+
+const require_rolldown_runtime = require('../../../../../../_virtual/rolldown_runtime.cjs');
+
+//#region ../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js
+var require_lower_bound = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	function lowerBound(array, value, comparator) {
+		let first = 0;
+		let count = array.length;
+		while (count > 0) {
+			const step = count / 2 | 0;
+			let it = first + step;
+			if (comparator(array[it], value) <= 0) {
+				first = ++it;
+				count -= step + 1;
+			} else count = step;
+		}
+		return first;
+	}
+	exports.default = lowerBound;
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_lower_bound();
+  }
+});
+//# sourceMappingURL=lower-bound.cjs.map

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"lower-bound.cjs","names":[],"sources":["../../../../../../../../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// Port of lower_bound from https://en.cppreference.com/w/cpp/algorithm/lower_bound\n// Used to compute insertion index to keep queue sorted after insertion\nfunction lowerBound(array, value, comparator) {\n    let first = 0;\n    let count = array.length;\n    while (count > 0) {\n        const step = (count / 2) | 0;\n        let it = first + step;\n        if (comparator(array[it], value) <= 0) {\n            first = ++it;\n            count -= step + 1;\n        }\n        else {\n            count = step;\n        }\n    }\n    return first;\n}\nexports.default = lowerBound;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;CACA,OAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAM,EAAC;CAG7D,SAAS,WAAW,OAAO,OAAO,YAAY;EAC1C,IAAI,QAAQ;EACZ,IAAI,QAAQ,MAAM;AAClB,SAAO,QAAQ,GAAG;GACd,MAAM,OAAQ,QAAQ,IAAK;GAC3B,IAAI,KAAK,QAAQ;AACjB,OAAI,WAAW,MAAM,KAAK,MAAM,IAAI,GAAG;IACnC,QAAQ,EAAE;IACV,SAAS,OAAO;GACnB,OAEG,QAAQ;EAEf;AACD,SAAO;CACV;CACD,QAAQ,UAAU"}

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js

@@ -0,0 +1,28 @@
+
+
+import { __commonJS } from "../../../../../../_virtual/rolldown_runtime.js";
+
+//#region ../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js
+var require_lower_bound = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	function lowerBound(array, value, comparator) {
+		let first = 0;
+		let count = array.length;
+		while (count > 0) {
+			const step = count / 2 | 0;
+			let it = first + step;
+			if (comparator(array[it], value) <= 0) {
+				first = ++it;
+				count -= step + 1;
+			} else count = step;
+		}
+		return first;
+	}
+	exports.default = lowerBound;
+}) });
+
+//#endregion
+export default require_lower_bound();
+
+export { require_lower_bound };
+//# sourceMappingURL=lower-bound.js.map

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lower-bound.js","names":[],"sources":["../../../../../../../../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/lower-bound.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// Port of lower_bound from https://en.cppreference.com/w/cpp/algorithm/lower_bound\n// Used to compute insertion index to keep queue sorted after insertion\nfunction lowerBound(array, value, comparator) {\n    let first = 0;\n    let count = array.length;\n    while (count > 0) {\n        const step = (count / 2) | 0;\n        let it = first + step;\n        if (comparator(array[it], value) <= 0) {\n            first = ++it;\n            count -= step + 1;\n        }\n        else {\n            count = step;\n        }\n    }\n    return first;\n}\nexports.default = lowerBound;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CACA,OAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAM,EAAC;CAG7D,SAAS,WAAW,OAAO,OAAO,YAAY;EAC1C,IAAI,QAAQ;EACZ,IAAI,QAAQ,MAAM;AAClB,SAAO,QAAQ,GAAG;GACd,MAAM,OAAQ,QAAQ,IAAK;GAC3B,IAAI,KAAK,QAAQ;AACjB,OAAI,WAAW,MAAM,KAAK,MAAM,IAAI,GAAG;IACnC,QAAQ,EAAE;IACV,SAAS,OAAO;GACnB,OAEG,QAAQ;EAEf;AACD,SAAO;CACV;CACD,QAAQ,UAAU"}