langgraph-ui-components 0.0.27 → 0.0.29

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs.js","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"],"names":["dist","EventEmitter","require$$0","p_timeout_1","require$$1","priority_queue_1","require$$2","empty","timeoutError","PQueue","options","_a","_b","_c","_d","now","delay","canInitializeInterval","job","newConcurrency","fn","resolve","reject","run","operation","error","functions","function_","existingResolve","milliseconds"],"mappings":"kYACA,OAAO,eAAeA,EAAAA,UAAS,aAAc,CAAE,MAAO,GAAM,EAC5D,MAAMC,EAAeC,EAAAA,UAAA,EACfC,EAAcC,EAAAA,UAAA,EACdC,EAAmBC,EAAAA,UAAA,EAEnBC,EAAQ,IAAM,CAAA,EACdC,EAAe,IAAIL,EAAY,aAIrC,MAAMM,UAAeR,CAAa,CAC9B,YAAYS,EAAS,CACjB,IAAIC,EAAIC,EAAIC,EAAIC,EAShB,GARA,MAAK,EACL,KAAK,eAAiB,EACtB,KAAK,aAAe,EACpB,KAAK,cAAgB,EACrB,KAAK,cAAgBP,EACrB,KAAK,aAAeA,EAEpBG,EAAU,OAAO,OAAO,CAAE,0BAA2B,GAAO,YAAa,IAAU,SAAU,EAAG,YAAa,IAAU,UAAW,GAAM,WAAYL,EAAiB,OAAO,EAAIK,CAAO,EACnL,EAAE,OAAOA,EAAQ,aAAgB,UAAYA,EAAQ,aAAe,GACpE,MAAM,IAAI,UAAU,iEAAiEE,GAAMD,EAAKD,EAAQ,eAAiB,MAAQC,IAAO,OAAS,OAASA,EAAG,SAAQ,KAAQ,MAAQC,IAAO,OAASA,EAAK,EAAE,OAAO,OAAOF,EAAQ,WAAW,GAAG,EAEpP,GAAIA,EAAQ,WAAa,QAAa,EAAE,OAAO,SAASA,EAAQ,QAAQ,GAAKA,EAAQ,UAAY,GAC7F,MAAM,IAAI,UAAU,4DAA4DI,GAAMD,EAAKH,EAAQ,YAAc,MAAQG,IAAO,OAAS,OAASA,EAAG,SAAQ,KAAQ,MAAQC,IAAO,OAASA,EAAK,EAAE,OAAO,OAAOJ,EAAQ,QAAQ,GAAG,EAEzO,KAAK,2BAA6BA,EAAQ,0BAC1C,KAAK,mBAAqBA,EAAQ,cAAgB,KAAYA,EAAQ,WAAa,EACnF,KAAK,aAAeA,EAAQ,YAC5B,KAAK,UAAYA,EAAQ,SACzB,KAAK,OAAS,IAAIA,EAAQ,WAC1B,KAAK,YAAcA,EAAQ,WAC3B,KAAK,YAAcA,EAAQ,YAC3B,KAAK,SAAWA,EAAQ,QACxB,KAAK,gBAAkBA,EAAQ,iBAAmB,GAClD,KAAK,UAAYA,EAAQ,YAAc,EAC/C,CACI,IAAI,2BAA4B,CAC5B,OAAO,KAAK,oBAAsB,KAAK,eAAiB,KAAK,YACrE,CACI,IAAI,6BAA8B,CAC9B,OAAO,KAAK,cAAgB,KAAK,YACzC,CACI,OAAQ,CACJ,KAAK,gBACL,KAAK,mBAAkB,EACvB,KAAK,KAAK,MAAM,CACxB,CACI,kBAAmB,CACf,KAAK,cAAa,EAClB,KAAK,cAAgBH,EACjB,KAAK,gBAAkB,IACvB,KAAK,aAAY,EACjB,KAAK,aAAeA,EACpB,KAAK,KAAK,MAAM,EAE5B,CACI,mBAAoB,CAChB,KAAK,YAAW,EAChB,KAAK,4BAA2B,EAChC,KAAK,WAAa,MAC1B,CACI,mBAAoB,CAChB,MAAMQ,EAAM,KAAK,IAAG,EACpB,GAAI,KAAK,cAAgB,OAAW,CAChC,MAAMC,EAAQ,KAAK,aAAeD,EAClC,GAAIC,EAAQ,EAGR,KAAK,eAAkB,KAAK,2BAA8B,KAAK,cAAgB,MAI/E,QAAI,KAAK,aAAe,SACpB,KAAK,WAAa,WAAW,IAAM,CAC/B,KAAK,kBAAiB,CAC9C,EAAuBA,CAAK,GAEL,EAEvB,CACQ,MAAO,EACf,CACI,oBAAqB,CACjB,GAAI,KAAK,OAAO,OAAS,EAGrB,OAAI,KAAK,aACL,cAAc,KAAK,WAAW,EAElC,KAAK,YAAc,OACnB,KAAK,iBAAgB,EACd,GAEX,GAAI,CAAC,KAAK,UAAW,CACjB,MAAMC,EAAwB,CAAC,KAAK,kBAAiB,EACrD,GAAI,KAAK,2BAA6B,KAAK,4BAA6B,CACpE,MAAMC,EAAM,KAAK,OAAO,QAAO,EAC/B,OAAKA,GAGL,KAAK,KAAK,QAAQ,EAClBA,EAAG,EACCD,GACA,KAAK,4BAA2B,EAE7B,IAPI,EAQ3B,CACA,CACQ,MAAO,EACf,CACI,6BAA8B,CACtB,KAAK,oBAAsB,KAAK,cAAgB,SAGpD,KAAK,YAAc,YAAY,IAAM,CACjC,KAAK,YAAW,CAC5B,EAAW,KAAK,SAAS,EACjB,KAAK,aAAe,KAAK,IAAG,EAAK,KAAK,UAC9C,CACI,aAAc,CACN,KAAK,iBAAmB,GAAK,KAAK,gBAAkB,GAAK,KAAK,cAC9D,cAAc,KAAK,WAAW,EAC9B,KAAK,YAAc,QAEvB,KAAK,eAAiB,KAAK,2BAA6B,KAAK,cAAgB,EAC7E,KAAK,cAAa,CAC1B,CAII,eAAgB,CAEZ,KAAO,KAAK,mBAAkB,GAAI,CAC1C,CACI,IAAI,aAAc,CACd,OAAO,KAAK,YACpB,CACI,IAAI,YAAYE,EAAgB,CAC5B,GAAI,EAAE,OAAOA,GAAmB,UAAYA,GAAkB,GAC1D,MAAM,IAAI,UAAU,gEAAgEA,CAAc,OAAO,OAAOA,CAAc,GAAG,EAErI,KAAK,aAAeA,EACpB,KAAK,cAAa,CAC1B,CAII,MAAM,IAAIC,EAAIV,EAAU,GAAI,CACxB,OAAO,IAAI,QAAQ,CAACW,EAASC,IAAW,CACpC,MAAMC,EAAM,SAAY,CACpB,KAAK,gBACL,KAAK,iBACL,GAAI,CACA,MAAMC,EAAa,KAAK,WAAa,QAAad,EAAQ,UAAY,OAAaU,EAAE,EAAKjB,EAAY,QAAQ,QAAQ,QAAQiB,GAAI,EAAIV,EAAQ,UAAY,OAAY,KAAK,SAAWA,EAAQ,QAAU,IAAM,EACtMA,EAAQ,iBAAmB,OAAY,KAAK,gBAAkBA,EAAQ,iBACtEY,EAAOd,CAAY,CAG/C,CAAqB,EACDa,EAAQ,MAAMG,CAAS,CAC3C,OACuBC,EAAO,CACVH,EAAOG,CAAK,CAChC,CACgB,KAAK,MAAK,CAC1B,EACY,KAAK,OAAO,QAAQF,EAAKb,CAAO,EAChC,KAAK,mBAAkB,EACvB,KAAK,KAAK,KAAK,CAC3B,CAAS,CACT,CAMI,MAAM,OAAOgB,EAAWhB,EAAS,CAC7B,OAAO,QAAQ,IAAIgB,EAAU,IAAI,MAAOC,GAAc,KAAK,IAAIA,EAAWjB,CAAO,CAAC,CAAC,CAC3F,CAII,OAAQ,CACJ,OAAK,KAAK,WAGV,KAAK,UAAY,GACjB,KAAK,cAAa,EACX,MAJI,IAKnB,CAII,OAAQ,CACJ,KAAK,UAAY,EACzB,CAII,OAAQ,CACJ,KAAK,OAAS,IAAI,KAAK,WAC/B,CAMI,MAAM,SAAU,CAEZ,GAAI,KAAK,OAAO,OAAS,EAGzB,OAAO,IAAI,QAAQW,GAAW,CAC1B,MAAMO,EAAkB,KAAK,cAC7B,KAAK,cAAgB,IAAM,CACvBA,EAAe,EACfP,EAAO,CACvB,CACA,CAAS,CACT,CAMI,MAAM,QAAS,CAEX,GAAI,OAAK,gBAAkB,GAAK,KAAK,OAAO,OAAS,GAGrD,OAAO,IAAI,QAAQA,GAAW,CAC1B,MAAMO,EAAkB,KAAK,aAC7B,KAAK,aAAe,IAAM,CACtBA,EAAe,EACfP,EAAO,CACvB,CACA,CAAS,CACT,CAII,IAAI,MAAO,CACP,OAAO,KAAK,OAAO,IAC3B,CAMI,OAAOX,EAAS,CAEZ,OAAO,KAAK,OAAO,OAAOA,CAAO,EAAE,MAC3C,CAII,IAAI,SAAU,CACV,OAAO,KAAK,aACpB,CAII,IAAI,UAAW,CACX,OAAO,KAAK,SACpB,CACI,IAAI,SAAU,CACV,OAAO,KAAK,QACpB,CAII,IAAI,QAAQmB,EAAc,CACtB,KAAK,SAAWA,CACxB,CACA,CACA7B,OAAAA,EAAAA,UAAA,QAAkBS","x_google_ignoreList":[0]}

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

@@ -1,198 +0,0 @@
-import { __exports as u } from "../../../../../../_virtual/index.es5.js";
-import { __require as c } from "../../../../eventemitter3@4.0.7/node_modules/eventemitter3/index.es.js";
-import { __require as m } from "../../../../p-timeout@3.2.0/node_modules/p-timeout/index.es.js";
-import { __require as f } from "./priority-queue.es.js";
-var l;
-function q() {
-  if (l) return u;
-  l = 1, Object.defineProperty(u, "__esModule", { value: !0 });
-  const _ = c(), o = m(), h = f(), s = () => {
-  }, d = new o.TimeoutError();
-  class v extends _ {
-    constructor(e) {
-      var t, r, i, n;
-      if (super(), this._intervalCount = 0, this._intervalEnd = 0, this._pendingCount = 0, this._resolveEmpty = s, this._resolveIdle = s, e = Object.assign({ carryoverConcurrencyCount: !1, intervalCap: 1 / 0, interval: 0, concurrency: 1 / 0, autoStart: !0, queueClass: h.default }, e), !(typeof e.intervalCap == "number" && e.intervalCap >= 1))
-        throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${(r = (t = e.intervalCap) === null || t === void 0 ? void 0 : t.toString()) !== null && r !== void 0 ? r : ""}\` (${typeof e.intervalCap})`);
-      if (e.interval === void 0 || !(Number.isFinite(e.interval) && e.interval >= 0))
-        throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${(n = (i = e.interval) === null || i === void 0 ? void 0 : i.toString()) !== null && n !== void 0 ? n : ""}\` (${typeof e.interval})`);
-      this._carryoverConcurrencyCount = e.carryoverConcurrencyCount, this._isIntervalIgnored = e.intervalCap === 1 / 0 || e.interval === 0, this._intervalCap = e.intervalCap, this._interval = e.interval, this._queue = new e.queueClass(), this._queueClass = e.queueClass, this.concurrency = e.concurrency, this._timeout = e.timeout, this._throwOnTimeout = e.throwOnTimeout === !0, this._isPaused = e.autoStart === !1;
-    }
-    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 = s, this._pendingCount === 0 && (this._resolveIdle(), this._resolveIdle = s, this.emit("idle"));
-    }
-    _onResumeInterval() {
-      this._onInterval(), this._initializeIntervalIfNeeded(), this._timeoutId = void 0;
-    }
-    _isIntervalPaused() {
-      const e = Date.now();
-      if (this._intervalId === void 0) {
-        const t = this._intervalEnd - e;
-        if (t < 0)
-          this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;
-        else
-          return this._timeoutId === void 0 && (this._timeoutId = setTimeout(() => {
-            this._onResumeInterval();
-          }, t)), !0;
-      }
-      return !1;
-    }
-    _tryToStartAnother() {
-      if (this._queue.size === 0)
-        return this._intervalId && clearInterval(this._intervalId), this._intervalId = void 0, this._resolvePromises(), !1;
-      if (!this._isPaused) {
-        const e = !this._isIntervalPaused();
-        if (this._doesIntervalAllowAnother && this._doesConcurrentAllowAnother) {
-          const t = this._queue.dequeue();
-          return t ? (this.emit("active"), t(), e && this._initializeIntervalIfNeeded(), !0) : !1;
-        }
-      }
-      return !1;
-    }
-    _initializeIntervalIfNeeded() {
-      this._isIntervalIgnored || this._intervalId !== void 0 || (this._intervalId = setInterval(() => {
-        this._onInterval();
-      }, this._interval), this._intervalEnd = Date.now() + this._interval);
-    }
-    _onInterval() {
-      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() {
-      for (; this._tryToStartAnother(); )
-        ;
-    }
-    get concurrency() {
-      return this._concurrency;
-    }
-    set concurrency(e) {
-      if (!(typeof e == "number" && e >= 1))
-        throw new TypeError(`Expected \`concurrency\` to be a number from 1 and up, got \`${e}\` (${typeof e})`);
-      this._concurrency = e, this._processQueue();
-    }
-    /**
-    Adds a sync or async task to the queue. Always returns a promise.
-    */
-    async add(e, t = {}) {
-      return new Promise((r, i) => {
-        const n = async () => {
-          this._pendingCount++, this._intervalCount++;
-          try {
-            const a = this._timeout === void 0 && t.timeout === void 0 ? e() : o.default(Promise.resolve(e()), t.timeout === void 0 ? this._timeout : t.timeout, () => {
-              (t.throwOnTimeout === void 0 ? this._throwOnTimeout : t.throwOnTimeout) && i(d);
-            });
-            r(await a);
-          } catch (a) {
-            i(a);
-          }
-          this._next();
-        };
-        this._queue.enqueue(n, t), 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(e, t) {
-      return Promise.all(e.map(async (r) => this.add(r, t)));
-    }
-    /**
-    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() {
-      return this._isPaused ? (this._isPaused = !1, this._processQueue(), this) : this;
-    }
-    /**
-    Put queue execution on hold.
-    */
-    pause() {
-      this._isPaused = !0;
-    }
-    /**
-    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 new Promise((e) => {
-          const t = this._resolveEmpty;
-          this._resolveEmpty = () => {
-            t(), e();
-          };
-        });
-    }
-    /**
-    	    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 new Promise((e) => {
-          const t = this._resolveIdle;
-          this._resolveIdle = () => {
-            t(), e();
-          };
-        });
-    }
-    /**
-    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(e) {
-      return this._queue.filter(e).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(e) {
-      this._timeout = e;
-    }
-  }
-  return u.default = v, u;
-}
-export {
-  q as __require
-};
-//# sourceMappingURL=index.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.es.js","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"],"names":["dist","EventEmitter","require$$0","p_timeout_1","require$$1","priority_queue_1","require$$2","empty","timeoutError","PQueue","options","_a","_b","_c","_d","now","delay","canInitializeInterval","job","newConcurrency","fn","resolve","reject","run","operation","error","functions","function_","existingResolve","milliseconds"],"mappings":";;;;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5D,QAAMC,IAAeC,EAAA,GACfC,IAAcC,EAAA,GACdC,IAAmBC,EAAA,GAEnBC,IAAQ,MAAM;AAAA,EAAA,GACdC,IAAe,IAAIL,EAAY,aAAY;AAAA,EAIjD,MAAMM,UAAeR,EAAa;AAAA,IAC9B,YAAYS,GAAS;AACjB,UAAIC,GAAIC,GAAIC,GAAIC;AAShB,UARA,MAAK,GACL,KAAK,iBAAiB,GACtB,KAAK,eAAe,GACpB,KAAK,gBAAgB,GACrB,KAAK,gBAAgBP,GACrB,KAAK,eAAeA,GAEpBG,IAAU,OAAO,OAAO,EAAE,2BAA2B,IAAO,aAAa,OAAU,UAAU,GAAG,aAAa,OAAU,WAAW,IAAM,YAAYL,EAAiB,QAAO,GAAIK,CAAO,GACnL,EAAE,OAAOA,EAAQ,eAAgB,YAAYA,EAAQ,eAAe;AACpE,cAAM,IAAI,UAAU,iEAAiEE,KAAMD,IAAKD,EAAQ,iBAAiB,QAAQC,MAAO,SAAS,SAASA,EAAG,SAAQ,OAAQ,QAAQC,MAAO,SAASA,IAAK,EAAE,OAAO,OAAOF,EAAQ,WAAW,GAAG;AAEpP,UAAIA,EAAQ,aAAa,UAAa,EAAE,OAAO,SAASA,EAAQ,QAAQ,KAAKA,EAAQ,YAAY;AAC7F,cAAM,IAAI,UAAU,4DAA4DI,KAAMD,IAAKH,EAAQ,cAAc,QAAQG,MAAO,SAAS,SAASA,EAAG,SAAQ,OAAQ,QAAQC,MAAO,SAASA,IAAK,EAAE,OAAO,OAAOJ,EAAQ,QAAQ,GAAG;AAEzO,WAAK,6BAA6BA,EAAQ,2BAC1C,KAAK,qBAAqBA,EAAQ,gBAAgB,SAAYA,EAAQ,aAAa,GACnF,KAAK,eAAeA,EAAQ,aAC5B,KAAK,YAAYA,EAAQ,UACzB,KAAK,SAAS,IAAIA,EAAQ,WAAU,GACpC,KAAK,cAAcA,EAAQ,YAC3B,KAAK,cAAcA,EAAQ,aAC3B,KAAK,WAAWA,EAAQ,SACxB,KAAK,kBAAkBA,EAAQ,mBAAmB,IAClD,KAAK,YAAYA,EAAQ,cAAc;AAAA,IAC/C;AAAA,IACI,IAAI,4BAA4B;AAC5B,aAAO,KAAK,sBAAsB,KAAK,iBAAiB,KAAK;AAAA,IACrE;AAAA,IACI,IAAI,8BAA8B;AAC9B,aAAO,KAAK,gBAAgB,KAAK;AAAA,IACzC;AAAA,IACI,QAAQ;AACJ,WAAK,iBACL,KAAK,mBAAkB,GACvB,KAAK,KAAK,MAAM;AAAA,IACxB;AAAA,IACI,mBAAmB;AACf,WAAK,cAAa,GAClB,KAAK,gBAAgBH,GACjB,KAAK,kBAAkB,MACvB,KAAK,aAAY,GACjB,KAAK,eAAeA,GACpB,KAAK,KAAK,MAAM;AAAA,IAE5B;AAAA,IACI,oBAAoB;AAChB,WAAK,YAAW,GAChB,KAAK,4BAA2B,GAChC,KAAK,aAAa;AAAA,IAC1B;AAAA,IACI,oBAAoB;AAChB,YAAMQ,IAAM,KAAK,IAAG;AACpB,UAAI,KAAK,gBAAgB,QAAW;AAChC,cAAMC,IAAQ,KAAK,eAAeD;AAClC,YAAIC,IAAQ;AAGR,eAAK,iBAAkB,KAAK,6BAA8B,KAAK,gBAAgB;AAAA;AAI/E,iBAAI,KAAK,eAAe,WACpB,KAAK,aAAa,WAAW,MAAM;AAC/B,iBAAK,kBAAiB;AAAA,UAC9C,GAAuBA,CAAK,IAEL;AAAA,MAEvB;AACQ,aAAO;AAAA,IACf;AAAA,IACI,qBAAqB;AACjB,UAAI,KAAK,OAAO,SAAS;AAGrB,eAAI,KAAK,eACL,cAAc,KAAK,WAAW,GAElC,KAAK,cAAc,QACnB,KAAK,iBAAgB,GACd;AAEX,UAAI,CAAC,KAAK,WAAW;AACjB,cAAMC,IAAwB,CAAC,KAAK,kBAAiB;AACrD,YAAI,KAAK,6BAA6B,KAAK,6BAA6B;AACpE,gBAAMC,IAAM,KAAK,OAAO,QAAO;AAC/B,iBAAKA,KAGL,KAAK,KAAK,QAAQ,GAClBA,EAAG,GACCD,KACA,KAAK,4BAA2B,GAE7B,MAPI;AAAA,QAQ3B;AAAA,MACA;AACQ,aAAO;AAAA,IACf;AAAA,IACI,8BAA8B;AAC1B,MAAI,KAAK,sBAAsB,KAAK,gBAAgB,WAGpD,KAAK,cAAc,YAAY,MAAM;AACjC,aAAK,YAAW;AAAA,MAC5B,GAAW,KAAK,SAAS,GACjB,KAAK,eAAe,KAAK,IAAG,IAAK,KAAK;AAAA,IAC9C;AAAA,IACI,cAAc;AACV,MAAI,KAAK,mBAAmB,KAAK,KAAK,kBAAkB,KAAK,KAAK,gBAC9D,cAAc,KAAK,WAAW,GAC9B,KAAK,cAAc,SAEvB,KAAK,iBAAiB,KAAK,6BAA6B,KAAK,gBAAgB,GAC7E,KAAK,cAAa;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA,IAII,gBAAgB;AAEZ,aAAO,KAAK,mBAAkB;AAAI;AAAA,IAC1C;AAAA,IACI,IAAI,cAAc;AACd,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,IAAI,YAAYE,GAAgB;AAC5B,UAAI,EAAE,OAAOA,KAAmB,YAAYA,KAAkB;AAC1D,cAAM,IAAI,UAAU,gEAAgEA,CAAc,OAAO,OAAOA,CAAc,GAAG;AAErI,WAAK,eAAeA,GACpB,KAAK,cAAa;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA,IAII,MAAM,IAAIC,GAAIV,IAAU,IAAI;AACxB,aAAO,IAAI,QAAQ,CAACW,GAASC,MAAW;AACpC,cAAMC,IAAM,YAAY;AACpB,eAAK,iBACL,KAAK;AACL,cAAI;AACA,kBAAMC,IAAa,KAAK,aAAa,UAAad,EAAQ,YAAY,SAAaU,EAAE,IAAKjB,EAAY,QAAQ,QAAQ,QAAQiB,GAAI,GAAIV,EAAQ,YAAY,SAAY,KAAK,WAAWA,EAAQ,SAAU,MAAM;AAC1M,eAAIA,EAAQ,mBAAmB,SAAY,KAAK,kBAAkBA,EAAQ,mBACtEY,EAAOd,CAAY;AAAA,YAG/C,CAAqB;AACD,YAAAa,EAAQ,MAAMG,CAAS;AAAA,UAC3C,SACuBC,GAAO;AACV,YAAAH,EAAOG,CAAK;AAAA,UAChC;AACgB,eAAK,MAAK;AAAA,QAC1B;AACY,aAAK,OAAO,QAAQF,GAAKb,CAAO,GAChC,KAAK,mBAAkB,GACvB,KAAK,KAAK,KAAK;AAAA,MAC3B,CAAS;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMI,MAAM,OAAOgB,GAAWhB,GAAS;AAC7B,aAAO,QAAQ,IAAIgB,EAAU,IAAI,OAAOC,MAAc,KAAK,IAAIA,GAAWjB,CAAO,CAAC,CAAC;AAAA,IAC3F;AAAA;AAAA;AAAA;AAAA,IAII,QAAQ;AACJ,aAAK,KAAK,aAGV,KAAK,YAAY,IACjB,KAAK,cAAa,GACX,QAJI;AAAA,IAKnB;AAAA;AAAA;AAAA;AAAA,IAII,QAAQ;AACJ,WAAK,YAAY;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA,IAII,QAAQ;AACJ,WAAK,SAAS,IAAI,KAAK,YAAW;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMI,MAAM,UAAU;AAEZ,UAAI,KAAK,OAAO,SAAS;AAGzB,eAAO,IAAI,QAAQ,CAAAW,MAAW;AAC1B,gBAAMO,IAAkB,KAAK;AAC7B,eAAK,gBAAgB,MAAM;AACvB,YAAAA,EAAe,GACfP,EAAO;AAAA,UACvB;AAAA,QACA,CAAS;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMI,MAAM,SAAS;AAEX,UAAI,OAAK,kBAAkB,KAAK,KAAK,OAAO,SAAS;AAGrD,eAAO,IAAI,QAAQ,CAAAA,MAAW;AAC1B,gBAAMO,IAAkB,KAAK;AAC7B,eAAK,eAAe,MAAM;AACtB,YAAAA,EAAe,GACfP,EAAO;AAAA,UACvB;AAAA,QACA,CAAS;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAII,IAAI,OAAO;AACP,aAAO,KAAK,OAAO;AAAA,IAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMI,OAAOX,GAAS;AAEZ,aAAO,KAAK,OAAO,OAAOA,CAAO,EAAE;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA,IAII,IAAI,UAAU;AACV,aAAO,KAAK;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA,IAII,IAAI,WAAW;AACX,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,IAAI,UAAU;AACV,aAAO,KAAK;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA,IAII,IAAI,QAAQmB,GAAc;AACtB,WAAK,WAAWA;AAAA,IACxB;AAAA,EACA;AACA,SAAA7B,EAAA,UAAkBS;;","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("../../../../../../_virtual/lower-bound.cjs.js");var i;function d(){if(i)return t.__exports;i=1,Object.defineProperty(t.__exports,"__esModule",{value:!0});function l(u,s,_){let r=0,e=u.length;for(;e>0;){const o=e/2|0;let n=r+o;_(u[n],s)<=0?(r=++n,e-=o+1):e=o}return r}return t.__exports.default=l,t.__exports}exports.__require=d;
-//# sourceMappingURL=lower-bound.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"lower-bound.cjs.js","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"],"names":["lowerBound_1","lowerBound","array","value","comparator","first","count","step","it"],"mappings":"gMACA,OAAO,eAAeA,EAAAA,UAAS,aAAc,CAAE,MAAO,GAAM,EAG5D,SAASC,EAAWC,EAAOC,EAAOC,EAAY,CAC1C,IAAIC,EAAQ,EACRC,EAAQJ,EAAM,OAClB,KAAOI,EAAQ,GAAG,CACd,MAAMC,EAAQD,EAAQ,EAAK,EAC3B,IAAIE,EAAKH,EAAQE,EACbH,EAAWF,EAAMM,CAAE,EAAGL,CAAK,GAAK,GAChCE,EAAQ,EAAEG,EACVF,GAASC,EAAO,GAGhBD,EAAQC,CAEpB,CACI,OAAOF,CACX,CACAL,OAAAA,EAAAA,UAAA,QAAkBC","x_google_ignoreList":[0]}

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

@@ -1,20 +0,0 @@
-import { __exports as r } from "../../../../../../_virtual/lower-bound.es.js";
-var i;
-function _() {
-  if (i) return r;
-  i = 1, Object.defineProperty(r, "__esModule", { value: !0 });
-  function l(u, s, d) {
-    let t = 0, e = u.length;
-    for (; e > 0; ) {
-      const o = e / 2 | 0;
-      let n = t + o;
-      d(u[n], s) <= 0 ? (t = ++n, e -= o + 1) : e = o;
-    }
-    return t;
-  }
-  return r.default = l, r;
-}
-export {
-  _ as __require
-};
-//# sourceMappingURL=lower-bound.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"lower-bound.es.js","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"],"names":["lowerBound_1","lowerBound","array","value","comparator","first","count","step","it"],"mappings":";;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAG5D,WAASC,EAAWC,GAAOC,GAAOC,GAAY;AAC1C,QAAIC,IAAQ,GACRC,IAAQJ,EAAM;AAClB,WAAOI,IAAQ,KAAG;AACd,YAAMC,IAAQD,IAAQ,IAAK;AAC3B,UAAIE,IAAKH,IAAQE;AACjB,MAAIH,EAAWF,EAAMM,CAAE,GAAGL,CAAK,KAAK,KAChCE,IAAQ,EAAEG,GACVF,KAASC,IAAO,KAGhBD,IAAQC;AAAA,IAEpB;AACI,WAAOF;AAAA,EACX;AACAL,SAAAA,EAAA,UAAkBC;;","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("../../../../../../_virtual/priority-queue.cjs.js"),p=require("./lower-bound.cjs.js");var u;function q(){if(u)return i.__exports;u=1,Object.defineProperty(i.__exports,"__esModule",{value:!0});const o=p.__require();class s{constructor(){this._queue=[]}enqueue(r,e){e=Object.assign({priority:0},e);const t={priority:e.priority,run:r};if(this.size&&this._queue[this.size-1].priority>=e.priority){this._queue.push(t);return}const n=o.default(this._queue,t,(_,l)=>l.priority-_.priority);this._queue.splice(n,0,t)}dequeue(){const r=this._queue.shift();return r?.run}filter(r){return this._queue.filter(e=>e.priority===r.priority).map(e=>e.run)}get size(){return this._queue.length}}return i.__exports.default=s,i.__exports}exports.__require=q;
-//# sourceMappingURL=priority-queue.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.cjs.js","sources":["../../../../../../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/priority-queue.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst lower_bound_1 = require(\"./lower-bound\");\nclass PriorityQueue {\n    constructor() {\n        this._queue = [];\n    }\n    enqueue(run, options) {\n        options = Object.assign({ priority: 0 }, options);\n        const element = {\n            priority: options.priority,\n            run\n        };\n        if (this.size && this._queue[this.size - 1].priority >= options.priority) {\n            this._queue.push(element);\n            return;\n        }\n        const index = lower_bound_1.default(this._queue, element, (a, b) => b.priority - a.priority);\n        this._queue.splice(index, 0, element);\n    }\n    dequeue() {\n        const item = this._queue.shift();\n        return item === null || item === void 0 ? void 0 : item.run;\n    }\n    filter(options) {\n        return this._queue.filter((element) => element.priority === options.priority).map((element) => element.run);\n    }\n    get size() {\n        return this._queue.length;\n    }\n}\nexports.default = PriorityQueue;\n"],"names":["priorityQueue","lower_bound_1","require$$0","PriorityQueue","run","options","element","index","a","b","item"],"mappings":"qOACA,OAAO,eAAeA,EAAAA,UAAS,aAAc,CAAE,MAAO,GAAM,EAC5D,MAAMC,EAAgBC,EAAAA,UAAA,EACtB,MAAMC,CAAc,CAChB,aAAc,CACV,KAAK,OAAS,CAAA,CACtB,CACI,QAAQC,EAAKC,EAAS,CAClBA,EAAU,OAAO,OAAO,CAAE,SAAU,CAAC,EAAIA,CAAO,EAChD,MAAMC,EAAU,CACZ,SAAUD,EAAQ,SAClB,IAAAD,GAEJ,GAAI,KAAK,MAAQ,KAAK,OAAO,KAAK,KAAO,CAAC,EAAE,UAAYC,EAAQ,SAAU,CACtE,KAAK,OAAO,KAAKC,CAAO,EACxB,MACZ,CACQ,MAAMC,EAAQN,EAAc,QAAQ,KAAK,OAAQK,EAAS,CAACE,EAAGC,IAAMA,EAAE,SAAWD,EAAE,QAAQ,EAC3F,KAAK,OAAO,OAAOD,EAAO,EAAGD,CAAO,CAC5C,CACI,SAAU,CACN,MAAMI,EAAO,KAAK,OAAO,MAAK,EAC9B,OAAmDA,GAAK,GAChE,CACI,OAAOL,EAAS,CACZ,OAAO,KAAK,OAAO,OAAQC,GAAYA,EAAQ,WAAaD,EAAQ,QAAQ,EAAE,IAAKC,GAAYA,EAAQ,GAAG,CAClH,CACI,IAAI,MAAO,CACP,OAAO,KAAK,OAAO,MAC3B,CACA,CACAN,OAAAA,EAAAA,UAAA,QAAkBG","x_google_ignoreList":[0]}

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

@@ -1,41 +0,0 @@
-import { __exports as i } from "../../../../../../_virtual/priority-queue.es.js";
-import { __require as q } from "./lower-bound.es.js";
-var t;
-function a() {
-  if (t) return i;
-  t = 1, Object.defineProperty(i, "__esModule", { value: !0 });
-  const o = q();
-  class s {
-    constructor() {
-      this._queue = [];
-    }
-    enqueue(r, e) {
-      e = Object.assign({ priority: 0 }, e);
-      const u = {
-        priority: e.priority,
-        run: r
-      };
-      if (this.size && this._queue[this.size - 1].priority >= e.priority) {
-        this._queue.push(u);
-        return;
-      }
-      const n = o.default(this._queue, u, (_, p) => p.priority - _.priority);
-      this._queue.splice(n, 0, u);
-    }
-    dequeue() {
-      const r = this._queue.shift();
-      return r?.run;
-    }
-    filter(r) {
-      return this._queue.filter((e) => e.priority === r.priority).map((e) => e.run);
-    }
-    get size() {
-      return this._queue.length;
-    }
-  }
-  return i.default = s, i;
-}
-export {
-  a as __require
-};
-//# sourceMappingURL=priority-queue.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.es.js","sources":["../../../../../../../node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/priority-queue.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst lower_bound_1 = require(\"./lower-bound\");\nclass PriorityQueue {\n    constructor() {\n        this._queue = [];\n    }\n    enqueue(run, options) {\n        options = Object.assign({ priority: 0 }, options);\n        const element = {\n            priority: options.priority,\n            run\n        };\n        if (this.size && this._queue[this.size - 1].priority >= options.priority) {\n            this._queue.push(element);\n            return;\n        }\n        const index = lower_bound_1.default(this._queue, element, (a, b) => b.priority - a.priority);\n        this._queue.splice(index, 0, element);\n    }\n    dequeue() {\n        const item = this._queue.shift();\n        return item === null || item === void 0 ? void 0 : item.run;\n    }\n    filter(options) {\n        return this._queue.filter((element) => element.priority === options.priority).map((element) => element.run);\n    }\n    get size() {\n        return this._queue.length;\n    }\n}\nexports.default = PriorityQueue;\n"],"names":["priorityQueue","lower_bound_1","require$$0","PriorityQueue","run","options","element","index","a","b","item"],"mappings":";;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5D,QAAMC,IAAgBC,EAAA;AAAA,EACtB,MAAMC,EAAc;AAAA,IAChB,cAAc;AACV,WAAK,SAAS,CAAA;AAAA,IACtB;AAAA,IACI,QAAQC,GAAKC,GAAS;AAClB,MAAAA,IAAU,OAAO,OAAO,EAAE,UAAU,EAAC,GAAIA,CAAO;AAChD,YAAMC,IAAU;AAAA,QACZ,UAAUD,EAAQ;AAAA,QAClB,KAAAD;AAAA;AAEJ,UAAI,KAAK,QAAQ,KAAK,OAAO,KAAK,OAAO,CAAC,EAAE,YAAYC,EAAQ,UAAU;AACtE,aAAK,OAAO,KAAKC,CAAO;AACxB;AAAA,MACZ;AACQ,YAAMC,IAAQN,EAAc,QAAQ,KAAK,QAAQK,GAAS,CAACE,GAAGC,MAAMA,EAAE,WAAWD,EAAE,QAAQ;AAC3F,WAAK,OAAO,OAAOD,GAAO,GAAGD,CAAO;AAAA,IAC5C;AAAA,IACI,UAAU;AACN,YAAMI,IAAO,KAAK,OAAO,MAAK;AAC9B,aAAmDA,GAAK;AAAA,IAChE;AAAA,IACI,OAAOL,GAAS;AACZ,aAAO,KAAK,OAAO,OAAO,CAACC,MAAYA,EAAQ,aAAaD,EAAQ,QAAQ,EAAE,IAAI,CAACC,MAAYA,EAAQ,GAAG;AAAA,IAClH;AAAA,IACI,IAAI,OAAO;AACP,aAAO,KAAK,OAAO;AAAA,IAC3B;AAAA,EACA;AACA,SAAAN,EAAA,UAAkBG;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/p-timeout@3.2.0/node_modules/p-timeout/index.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("../../../../../_virtual/index.cjs8.js"),y=require("../../../p-finally@1.0.0/node_modules/p-finally/index.cjs.js");var m;function T(){if(m)return o.__module.exports;m=1;const c=y.__require();class i extends Error{constructor(e){super(e),this.name="TimeoutError"}}const s=(t,e,r)=>new Promise((n,u)=>{if(typeof e!="number"||e<0)throw new TypeError("Expected `milliseconds` to be a positive number");if(e===1/0){n(t);return}const _=setTimeout(()=>{if(typeof r=="function"){try{n(r())}catch(f){u(f)}return}const p=typeof r=="string"?r:`Promise timed out after ${e} milliseconds`,d=r instanceof Error?r:new i(p);typeof t.cancel=="function"&&t.cancel(),u(d)},e);c(t.then(n,u),()=>{clearTimeout(_)})});return o.__module.exports=s,o.__module.exports.default=s,o.__module.exports.TimeoutError=i,o.__module.exports}exports.__require=T;
-//# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/.pnpm/p-timeout@3.2.0/node_modules/p-timeout/index.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs.js","sources":["../../../../../../node_modules/.pnpm/p-timeout@3.2.0/node_modules/p-timeout/index.js"],"sourcesContent":["'use strict';\n\nconst pFinally = require('p-finally');\n\nclass TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\nconst pTimeout = (promise, milliseconds, fallback) => new Promise((resolve, reject) => {\n\tif (typeof milliseconds !== 'number' || milliseconds < 0) {\n\t\tthrow new TypeError('Expected `milliseconds` to be a positive number');\n\t}\n\n\tif (milliseconds === Infinity) {\n\t\tresolve(promise);\n\t\treturn;\n\t}\n\n\tconst timer = setTimeout(() => {\n\t\tif (typeof fallback === 'function') {\n\t\t\ttry {\n\t\t\t\tresolve(fallback());\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tconst message = typeof fallback === 'string' ? fallback : `Promise timed out after ${milliseconds} milliseconds`;\n\t\tconst timeoutError = fallback instanceof Error ? fallback : new TimeoutError(message);\n\n\t\tif (typeof promise.cancel === 'function') {\n\t\t\tpromise.cancel();\n\t\t}\n\n\t\treject(timeoutError);\n\t}, milliseconds);\n\n\t// TODO: Use native `finally` keyword when targeting Node.js 10\n\tpFinally(\n\t\t// eslint-disable-next-line promise/prefer-await-to-then\n\t\tpromise.then(resolve, reject),\n\t\t() => {\n\t\t\tclearTimeout(timer);\n\t\t}\n\t);\n});\n\nmodule.exports = pTimeout;\n// TODO: Remove this for the next major release\nmodule.exports.default = pTimeout;\n\nmodule.exports.TimeoutError = TimeoutError;\n"],"names":["pFinally","require$$0","TimeoutError","message","pTimeout","promise","milliseconds","fallback","resolve","reject","timer","error","timeoutError","pTimeoutModule"],"mappings":"yQAEA,MAAMA,EAAWC,EAAAA,UAAA,EAEjB,MAAMC,UAAqB,KAAM,CAChC,YAAYC,EAAS,CACpB,MAAMA,CAAO,EACb,KAAK,KAAO,cACd,CACA,CAEA,MAAMC,EAAW,CAACC,EAASC,EAAcC,IAAa,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtF,GAAI,OAAOH,GAAiB,UAAYA,EAAe,EACtD,MAAM,IAAI,UAAU,iDAAiD,EAGtE,GAAIA,IAAiB,IAAU,CAC9BE,EAAQH,CAAO,EACf,MACF,CAEC,MAAMK,EAAQ,WAAW,IAAM,CAC9B,GAAI,OAAOH,GAAa,WAAY,CACnC,GAAI,CACHC,EAAQD,EAAQ,CAAE,CACtB,OAAYI,EAAO,CACfF,EAAOE,CAAK,CAChB,CAEG,MACH,CAEE,MAAMR,EAAU,OAAOI,GAAa,SAAWA,EAAW,2BAA2BD,CAAY,gBAC3FM,EAAeL,aAAoB,MAAQA,EAAW,IAAIL,EAAaC,CAAO,EAEhF,OAAOE,EAAQ,QAAW,YAC7BA,EAAQ,OAAM,EAGfI,EAAOG,CAAY,CACrB,EAAIN,CAAY,EAGfN,EAECK,EAAQ,KAAKG,EAASC,CAAM,EAC5B,IAAM,CACL,aAAaC,CAAK,CACrB,EAEA,CAAC,EAEDG,OAAAA,EAAAA,SAAA,QAAiBT,EAEjBS,WAAA,QAAA,QAAyBT,EAEzBS,WAAA,QAAA,aAA8BX","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/p-timeout@3.2.0/node_modules/p-timeout/index.es.js

@@ -1,45 +0,0 @@
-import { __module as o } from "../../../../../_virtual/index.es8.js";
-import { __require as a } from "../../../p-finally@1.0.0/node_modules/p-finally/index.es.js";
-var m;
-function _() {
-  if (m) return o.exports;
-  m = 1;
-  const p = a();
-  class u extends Error {
-    constructor(r) {
-      super(r), this.name = "TimeoutError";
-    }
-  }
-  const s = (e, r, t) => new Promise((i, n) => {
-    if (typeof r != "number" || r < 0)
-      throw new TypeError("Expected `milliseconds` to be a positive number");
-    if (r === 1 / 0) {
-      i(e);
-      return;
-    }
-    const f = setTimeout(() => {
-      if (typeof t == "function") {
-        try {
-          i(t());
-        } catch (y) {
-          n(y);
-        }
-        return;
-      }
-      const c = typeof t == "string" ? t : `Promise timed out after ${r} milliseconds`, T = t instanceof Error ? t : new u(c);
-      typeof e.cancel == "function" && e.cancel(), n(T);
-    }, r);
-    p(
-      // eslint-disable-next-line promise/prefer-await-to-then
-      e.then(i, n),
-      () => {
-        clearTimeout(f);
-      }
-    );
-  });
-  return o.exports = s, o.exports.default = s, o.exports.TimeoutError = u, o.exports;
-}
-export {
-  _ as __require
-};
-//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/p-timeout@3.2.0/node_modules/p-timeout/index.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.es.js","sources":["../../../../../../node_modules/.pnpm/p-timeout@3.2.0/node_modules/p-timeout/index.js"],"sourcesContent":["'use strict';\n\nconst pFinally = require('p-finally');\n\nclass TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\nconst pTimeout = (promise, milliseconds, fallback) => new Promise((resolve, reject) => {\n\tif (typeof milliseconds !== 'number' || milliseconds < 0) {\n\t\tthrow new TypeError('Expected `milliseconds` to be a positive number');\n\t}\n\n\tif (milliseconds === Infinity) {\n\t\tresolve(promise);\n\t\treturn;\n\t}\n\n\tconst timer = setTimeout(() => {\n\t\tif (typeof fallback === 'function') {\n\t\t\ttry {\n\t\t\t\tresolve(fallback());\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tconst message = typeof fallback === 'string' ? fallback : `Promise timed out after ${milliseconds} milliseconds`;\n\t\tconst timeoutError = fallback instanceof Error ? fallback : new TimeoutError(message);\n\n\t\tif (typeof promise.cancel === 'function') {\n\t\t\tpromise.cancel();\n\t\t}\n\n\t\treject(timeoutError);\n\t}, milliseconds);\n\n\t// TODO: Use native `finally` keyword when targeting Node.js 10\n\tpFinally(\n\t\t// eslint-disable-next-line promise/prefer-await-to-then\n\t\tpromise.then(resolve, reject),\n\t\t() => {\n\t\t\tclearTimeout(timer);\n\t\t}\n\t);\n});\n\nmodule.exports = pTimeout;\n// TODO: Remove this for the next major release\nmodule.exports.default = pTimeout;\n\nmodule.exports.TimeoutError = TimeoutError;\n"],"names":["pFinally","require$$0","TimeoutError","message","pTimeout","promise","milliseconds","fallback","resolve","reject","timer","error","timeoutError","pTimeoutModule"],"mappings":";;;;;;AAEA,QAAMA,IAAWC,EAAA;AAAA,EAEjB,MAAMC,UAAqB,MAAM;AAAA,IAChC,YAAYC,GAAS;AACpB,YAAMA,CAAO,GACb,KAAK,OAAO;AAAA,IACd;AAAA,EACA;AAEA,QAAMC,IAAW,CAACC,GAASC,GAAcC,MAAa,IAAI,QAAQ,CAACC,GAASC,MAAW;AACtF,QAAI,OAAOH,KAAiB,YAAYA,IAAe;AACtD,YAAM,IAAI,UAAU,iDAAiD;AAGtE,QAAIA,MAAiB,OAAU;AAC9B,MAAAE,EAAQH,CAAO;AACf;AAAA,IACF;AAEC,UAAMK,IAAQ,WAAW,MAAM;AAC9B,UAAI,OAAOH,KAAa,YAAY;AACnC,YAAI;AACH,UAAAC,EAAQD,EAAQ,CAAE;AAAA,QACtB,SAAYI,GAAO;AACf,UAAAF,EAAOE,CAAK;AAAA,QAChB;AAEG;AAAA,MACH;AAEE,YAAMR,IAAU,OAAOI,KAAa,WAAWA,IAAW,2BAA2BD,CAAY,iBAC3FM,IAAeL,aAAoB,QAAQA,IAAW,IAAIL,EAAaC,CAAO;AAEpF,MAAI,OAAOE,EAAQ,UAAW,cAC7BA,EAAQ,OAAM,GAGfI,EAAOG,CAAY;AAAA,IACrB,GAAIN,CAAY;AAGf,IAAAN;AAAA;AAAA,MAECK,EAAQ,KAAKG,GAASC,CAAM;AAAA,MAC5B,MAAM;AACL,qBAAaC,CAAK;AAAA,MACrB;AAAA;EAEA,CAAC;AAEDG,SAAAA,EAAA,UAAiBT,GAEjBS,EAAA,QAAA,UAAyBT,GAEzBS,EAAA,QAAA,eAA8BX;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("../internal/parse-options.cjs.js"),d=require("../internal/re.cjs.js"),_=require("../functions/cmp.cjs.js"),W=require("../internal/debug.cjs.js"),g=require("./semver.cjs.js"),O=require("./range.cjs.js");var o,q;function p(){if(q)return o;q=1;const t=Symbol("SemVer ANY");class i{static get ANY(){return t}constructor(e,r){if(r=n(r),e instanceof i){if(e.loose===!!r.loose)return e;e=e.value}e=e.trim().split(/\s+/).join(" "),u("comparator",e,r),this.options=r,this.loose=!!r.loose,this.parse(e),this.semver===t?this.value="":this.value=this.operator+this.semver.version,u("comp",this)}parse(e){const r=this.options.loose?h[l.COMPARATORLOOSE]:h[l.COMPARATOR],s=e.match(r);if(!s)throw new TypeError(`Invalid comparator: ${e}`);this.operator=s[1]!==void 0?s[1]:"",this.operator==="="&&(this.operator=""),s[2]?this.semver=new f(s[2],this.options.loose):this.semver=t}toString(){return this.value}test(e){if(u("Comparator.test",e,this.options.loose),this.semver===t||e===t)return!0;if(typeof e=="string")try{e=new f(e,this.options)}catch{return!1}return a(e,this.operator,this.semver,this.options)}intersects(e,r){if(!(e instanceof i))throw new TypeError("a Comparator is required");return this.operator===""?this.value===""?!0:new v(e.value,r).test(this.value):e.operator===""?e.value===""?!0:new v(this.value,r).test(e.semver):(r=n(r),r.includePrerelease&&(this.value==="<0.0.0-0"||e.value==="<0.0.0-0")||!r.includePrerelease&&(this.value.startsWith("<0.0.0")||e.value.startsWith("<0.0.0"))?!1:!!(this.operator.startsWith(">")&&e.operator.startsWith(">")||this.operator.startsWith("<")&&e.operator.startsWith("<")||this.semver.version===e.semver.version&&this.operator.includes("=")&&e.operator.includes("=")||a(this.semver,"<",e.semver,r)&&this.operator.startsWith(">")&&e.operator.startsWith("<")||a(this.semver,">",e.semver,r)&&this.operator.startsWith("<")&&e.operator.startsWith(">")))}}o=i;const n=c.__require(),{safeRe:h,t:l}=d.__require(),a=_.__require(),u=W.__require(),f=g.__require(),v=O.__require();return o}exports.__require=p;
-//# sourceMappingURL=comparator.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"comparator.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.js"],"sourcesContent":["'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n"],"names":["ANY","Comparator","comp","options","parseOptions","debug","re","t","m","SemVer","version","cmp","Range","comparator","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5"],"mappings":"kVAEA,MAAMA,EAAM,OAAO,YAAY,EAE/B,MAAMC,CAAW,CACf,WAAW,KAAO,CAChB,OAAOD,CACX,CAEE,YAAaE,EAAMC,EAAS,CAG1B,GAFAA,EAAUC,EAAaD,CAAO,EAE1BD,aAAgBD,EAAY,CAC9B,GAAIC,EAAK,QAAU,CAAC,CAACC,EAAQ,MAC3B,OAAOD,EAEPA,EAAOA,EAAK,KAEpB,CAEIA,EAAOA,EAAK,KAAI,EAAG,MAAM,KAAK,EAAE,KAAK,GAAG,EACxCG,EAAM,aAAcH,EAAMC,CAAO,EACjC,KAAK,QAAUA,EACf,KAAK,MAAQ,CAAC,CAACA,EAAQ,MACvB,KAAK,MAAMD,CAAI,EAEX,KAAK,SAAWF,EAClB,KAAK,MAAQ,GAEb,KAAK,MAAQ,KAAK,SAAW,KAAK,OAAO,QAG3CK,EAAM,OAAQ,IAAI,CACtB,CAEE,MAAOH,EAAM,CACX,MAAM,EAAI,KAAK,QAAQ,MAAQI,EAAGC,EAAE,eAAe,EAAID,EAAGC,EAAE,UAAU,EAChEC,EAAIN,EAAK,MAAM,CAAC,EAEtB,GAAI,CAACM,EACH,MAAM,IAAI,UAAU,uBAAuBN,CAAI,EAAE,EAGnD,KAAK,SAAWM,EAAE,CAAC,IAAM,OAAYA,EAAE,CAAC,EAAI,GACxC,KAAK,WAAa,MACpB,KAAK,SAAW,IAIbA,EAAE,CAAC,EAGN,KAAK,OAAS,IAAIC,EAAOD,EAAE,CAAC,EAAG,KAAK,QAAQ,KAAK,EAFjD,KAAK,OAASR,CAIpB,CAEE,UAAY,CACV,OAAO,KAAK,KAChB,CAEE,KAAMU,EAAS,CAGb,GAFAL,EAAM,kBAAmBK,EAAS,KAAK,QAAQ,KAAK,EAEhD,KAAK,SAAWV,GAAOU,IAAYV,EACrC,MAAO,GAGT,GAAI,OAAOU,GAAY,SACrB,GAAI,CACFA,EAAU,IAAID,EAAOC,EAAS,KAAK,OAAO,CAClD,MAAmB,CACX,MAAO,EACf,CAGI,OAAOC,EAAID,EAAS,KAAK,SAAU,KAAK,OAAQ,KAAK,OAAO,CAChE,CAEE,WAAYR,EAAMC,EAAS,CACzB,GAAI,EAAED,aAAgBD,GACpB,MAAM,IAAI,UAAU,0BAA0B,EAGhD,OAAI,KAAK,WAAa,GAChB,KAAK,QAAU,GACV,GAEF,IAAIW,EAAMV,EAAK,MAAOC,CAAO,EAAE,KAAK,KAAK,KAAK,EAC5CD,EAAK,WAAa,GACvBA,EAAK,QAAU,GACV,GAEF,IAAIU,EAAM,KAAK,MAAOT,CAAO,EAAE,KAAKD,EAAK,MAAM,GAGxDC,EAAUC,EAAaD,CAAO,EAG1BA,EAAQ,oBACT,KAAK,QAAU,YAAcD,EAAK,QAAU,aAG3C,CAACC,EAAQ,oBACV,KAAK,MAAM,WAAW,QAAQ,GAAKD,EAAK,MAAM,WAAW,QAAQ,GAC3D,GAIL,QAAK,SAAS,WAAW,GAAG,GAAKA,EAAK,SAAS,WAAW,GAAG,GAI7D,KAAK,SAAS,WAAW,GAAG,GAAKA,EAAK,SAAS,WAAW,GAAG,GAK9D,KAAK,OAAO,UAAYA,EAAK,OAAO,SACrC,KAAK,SAAS,SAAS,GAAG,GAAKA,EAAK,SAAS,SAAS,GAAG,GAIvDS,EAAI,KAAK,OAAQ,IAAKT,EAAK,OAAQC,CAAO,GAC5C,KAAK,SAAS,WAAW,GAAG,GAAKD,EAAK,SAAS,WAAW,GAAG,GAI3DS,EAAI,KAAK,OAAQ,IAAKT,EAAK,OAAQC,CAAO,GAC5C,KAAK,SAAS,WAAW,GAAG,GAAKD,EAAK,SAAS,WAAW,GAAG,GAInE,CACA,CAEAW,EAAiBZ,EAEjB,MAAMG,EAAeU,EAAAA,UAAA,EACf,CAAE,OAAQR,EAAI,EAAAC,CAAC,EAAKQ,EAAAA,UAAA,EACpBJ,EAAMK,EAAAA,UAAA,EACNX,EAAQY,EAAAA,UAAA,EACRR,EAASS,EAAAA,UAAA,EACTN,EAAQO,EAAAA,UAAA","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.es.js

@@ -1,57 +0,0 @@
-import { __require as q } from "../internal/parse-options.es.js";
-import { __require as p } from "../internal/re.es.js";
-import { __require as _ } from "../functions/cmp.es.js";
-import { __require as d } from "../internal/debug.es.js";
-import { __require as W } from "./semver.es.js";
-import { __require as R } from "./range.es.js";
-var o, m;
-function S() {
-  if (m) return o;
-  m = 1;
-  const t = /* @__PURE__ */ Symbol("SemVer ANY");
-  class i {
-    static get ANY() {
-      return t;
-    }
-    constructor(r, e) {
-      if (e = h(e), r instanceof i) {
-        if (r.loose === !!e.loose)
-          return r;
-        r = r.value;
-      }
-      r = r.trim().split(/\s+/).join(" "), u("comparator", r, e), this.options = e, this.loose = !!e.loose, this.parse(r), this.semver === t ? this.value = "" : this.value = this.operator + this.semver.version, u("comp", this);
-    }
-    parse(r) {
-      const e = this.options.loose ? n[l.COMPARATORLOOSE] : n[l.COMPARATOR], s = r.match(e);
-      if (!s)
-        throw new TypeError(`Invalid comparator: ${r}`);
-      this.operator = s[1] !== void 0 ? s[1] : "", this.operator === "=" && (this.operator = ""), s[2] ? this.semver = new f(s[2], this.options.loose) : this.semver = t;
-    }
-    toString() {
-      return this.value;
-    }
-    test(r) {
-      if (u("Comparator.test", r, this.options.loose), this.semver === t || r === t)
-        return !0;
-      if (typeof r == "string")
-        try {
-          r = new f(r, this.options);
-        } catch {
-          return !1;
-        }
-      return a(r, this.operator, this.semver, this.options);
-    }
-    intersects(r, e) {
-      if (!(r instanceof i))
-        throw new TypeError("a Comparator is required");
-      return this.operator === "" ? this.value === "" ? !0 : new v(r.value, e).test(this.value) : r.operator === "" ? r.value === "" ? !0 : new v(this.value, e).test(r.semver) : (e = h(e), e.includePrerelease && (this.value === "<0.0.0-0" || r.value === "<0.0.0-0") || !e.includePrerelease && (this.value.startsWith("<0.0.0") || r.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && r.operator.startsWith(">") || this.operator.startsWith("<") && r.operator.startsWith("<") || this.semver.version === r.semver.version && this.operator.includes("=") && r.operator.includes("=") || a(this.semver, "<", r.semver, e) && this.operator.startsWith(">") && r.operator.startsWith("<") || a(this.semver, ">", r.semver, e) && this.operator.startsWith("<") && r.operator.startsWith(">")));
-    }
-  }
-  o = i;
-  const h = q(), { safeRe: n, t: l } = p(), a = _(), u = d(), f = W(), v = R();
-  return o;
-}
-export {
-  S as __require
-};
-//# sourceMappingURL=comparator.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"comparator.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.js"],"sourcesContent":["'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n"],"names":["ANY","Comparator","comp","options","parseOptions","debug","r","re","t","m","SemVer","version","cmp","Range","comparator","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5"],"mappings":";;;;;;;;;;AAEA,QAAMA,IAAM,uBAAO,YAAY;AAAA,EAE/B,MAAMC,EAAW;AAAA,IACf,WAAW,MAAO;AAChB,aAAOD;AAAA,IACX;AAAA,IAEE,YAAaE,GAAMC,GAAS;AAG1B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAgBD,GAAY;AAC9B,YAAIC,EAAK,UAAU,CAAC,CAACC,EAAQ;AAC3B,iBAAOD;AAEP,QAAAA,IAAOA,EAAK;AAAA,MAEpB;AAEI,MAAAA,IAAOA,EAAK,KAAI,EAAG,MAAM,KAAK,EAAE,KAAK,GAAG,GACxCG,EAAM,cAAcH,GAAMC,CAAO,GACjC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,MAAMD,CAAI,GAEX,KAAK,WAAWF,IAClB,KAAK,QAAQ,KAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO,SAG3CK,EAAM,QAAQ,IAAI;AAAA,IACtB;AAAA,IAEE,MAAOH,GAAM;AACX,YAAMI,IAAI,KAAK,QAAQ,QAAQC,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,GAChEC,IAAIP,EAAK,MAAMI,CAAC;AAEtB,UAAI,CAACG;AACH,cAAM,IAAI,UAAU,uBAAuBP,CAAI,EAAE;AAGnD,WAAK,WAAWO,EAAE,CAAC,MAAM,SAAYA,EAAE,CAAC,IAAI,IACxC,KAAK,aAAa,QACpB,KAAK,WAAW,KAIbA,EAAE,CAAC,IAGN,KAAK,SAAS,IAAIC,EAAOD,EAAE,CAAC,GAAG,KAAK,QAAQ,KAAK,IAFjD,KAAK,SAAST;AAAA,IAIpB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,KAAMW,GAAS;AAGb,UAFAN,EAAM,mBAAmBM,GAAS,KAAK,QAAQ,KAAK,GAEhD,KAAK,WAAWX,KAAOW,MAAYX;AACrC,eAAO;AAGT,UAAI,OAAOW,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAID,EAAOC,GAAS,KAAK,OAAO;AAAA,QAClD,QAAmB;AACX,iBAAO;AAAA,QACf;AAGI,aAAOC,EAAID,GAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;AAAA,IAChE;AAAA,IAEE,WAAYT,GAAMC,GAAS;AACzB,UAAI,EAAED,aAAgBD;AACpB,cAAM,IAAI,UAAU,0BAA0B;AAGhD,aAAI,KAAK,aAAa,KAChB,KAAK,UAAU,KACV,KAEF,IAAIY,EAAMX,EAAK,OAAOC,CAAO,EAAE,KAAK,KAAK,KAAK,IAC5CD,EAAK,aAAa,KACvBA,EAAK,UAAU,KACV,KAEF,IAAIW,EAAM,KAAK,OAAOV,CAAO,EAAE,KAAKD,EAAK,MAAM,KAGxDC,IAAUC,EAAaD,CAAO,GAG1BA,EAAQ,sBACT,KAAK,UAAU,cAAcD,EAAK,UAAU,eAG3C,CAACC,EAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAKD,EAAK,MAAM,WAAW,QAAQ,KAC3D,KAIL,QAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAI7D,KAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAK9D,KAAK,OAAO,YAAYA,EAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAKA,EAAK,SAAS,SAAS,GAAG,KAIvDU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG,KAI3DU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG;AAAA,IAInE;AAAA,EACA;AAEA,EAAAY,IAAiBb;AAEjB,QAAMG,IAAeW,EAAA,GACf,EAAE,QAAQR,GAAI,GAAAC,EAAC,IAAKQ,EAAA,GACpBJ,IAAMK,EAAA,GACNZ,IAAQa,EAAA,GACRR,IAASS,EAAA,GACTN,IAAQO,EAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const V=require("../internal/lrucache.cjs.js"),B=require("../internal/parse-options.cjs.js"),K=require("./comparator.cjs.js"),J=require("../internal/debug.cjs.js"),Q=require("./semver.cjs.js"),W=require("../internal/re.cjs.js"),Z=require("../internal/constants.cjs.js");var S,L;function m(){if(L)return S;L=1;const _=/\s+/g;class E{constructor(e,i){if(i=C(i),e instanceof E)return e.loose===!!i.loose&&e.includePrerelease===!!i.includePrerelease?e:new E(e.raw,i);if(e instanceof O)return this.raw=e.value,this.set=[[e]],this.formatted=void 0,this;if(this.options=i,this.loose=!!i.loose,this.includePrerelease=!!i.includePrerelease,this.raw=e.trim().replace(_," "),this.set=this.raw.split("||").map(r=>this.parseRange(r.trim())).filter(r=>r.length),!this.set.length)throw new TypeError(`Invalid SemVer Range: ${this.raw}`);if(this.set.length>1){const r=this.set[0];if(this.set=this.set.filter(l=>!q(l[0])),this.set.length===0)this.set=[r];else if(this.set.length>1){for(const l of this.set)if(l.length===1&&g(l[0])){this.set=[l];break}}}this.formatted=void 0}get range(){if(this.formatted===void 0){this.formatted="";for(let e=0;e<this.set.length;e++){e>0&&(this.formatted+="||");const i=this.set[e];for(let r=0;r<i.length;r++)r>0&&(this.formatted+=" "),this.formatted+=i[r].toString().trim()}}return this.formatted}format(){return this.range}toString(){return this.range}parseRange(e){const r=((this.options.includePrerelease&&I)|(this.options.loose&&N))+":"+e,l=A.get(r);if(l)return l;const s=this.options.loose,n=s?h[o.HYPHENRANGELOOSE]:h[o.HYPHENRANGE];e=e.replace(n,z(this.options.includePrerelease)),$("hyphen replace",e),e=e.replace(h[o.COMPARATORTRIM],y),$("comparator trim",e),e=e.replace(h[o.TILDETRIM],v),$("tilde trim",e),e=e.replace(h[o.CARETTRIM],G),$("caret trim",e);let c=e.split(" ").map(f=>b(f,this.options)).join(" ").split(/\s+/).map(f=>k(f,this.options));s&&(c=c.filter(f=>($("loose invalid filter",f,this.options),!!f.match(h[o.COMPARATORLOOSE])))),$("range list",c);const a=new Map,u=c.map(f=>new O(f,this.options));for(const f of u){if(q(f))return[f];a.set(f.value,f)}a.size>1&&a.has("")&&a.delete("");const R=[...a.values()];return A.set(r,R),R}intersects(e,i){if(!(e instanceof E))throw new TypeError("a Range is required");return this.set.some(r=>w(r,i)&&e.set.some(l=>w(l,i)&&r.every(s=>l.every(n=>s.intersects(n,i)))))}test(e){if(!e)return!1;if(typeof e=="string")try{e=new P(e,this.options)}catch{return!1}for(let i=0;i<this.set.length;i++)if(F(this.set[i],e,this.options))return!0;return!1}}S=E;const p=V.__require(),A=new p,C=B.__require(),O=K.__require(),$=J.__require(),P=Q.__require(),{safeRe:h,t:o,comparatorTrimReplace:y,tildeTrimReplace:v,caretTrimReplace:G}=W.__require(),{FLAG_INCLUDE_PRERELEASE:I,FLAG_LOOSE:N}=Z.__require(),q=t=>t.value==="<0.0.0-0",g=t=>t.value==="",w=(t,e)=>{let i=!0;const r=t.slice();let l=r.pop();for(;i&&r.length;)i=r.every(s=>l.intersects(s,e)),l=r.pop();return i},b=(t,e)=>(t=t.replace(h[o.BUILD],""),$("comp",t,e),t=X(t,e),$("caret",t),t=j(t,e),$("tildes",t),t=H(t,e),$("xrange",t),t=Y(t,e),$("stars",t),t),d=t=>!t||t.toLowerCase()==="x"||t==="*",j=(t,e)=>t.trim().split(/\s+/).map(i=>x(i,e)).join(" "),x=(t,e)=>{const i=e.loose?h[o.TILDELOOSE]:h[o.TILDE];return t.replace(i,(r,l,s,n,c)=>{$("tilde",t,r,l,s,n,c);let a;return d(l)?a="":d(s)?a=`>=${l}.0.0 <${+l+1}.0.0-0`:d(n)?a=`>=${l}.${s}.0 <${l}.${+s+1}.0-0`:c?($("replaceTilde pr",c),a=`>=${l}.${s}.${n}-${c} <${l}.${+s+1}.0-0`):a=`>=${l}.${s}.${n} <${l}.${+s+1}.0-0`,$("tilde return",a),a})},X=(t,e)=>t.trim().split(/\s+/).map(i=>D(i,e)).join(" "),D=(t,e)=>{$("caret",t,e);const i=e.loose?h[o.CARETLOOSE]:h[o.CARET],r=e.includePrerelease?"-0":"";return t.replace(i,(l,s,n,c,a)=>{$("caret",t,l,s,n,c,a);let u;return d(s)?u="":d(n)?u=`>=${s}.0.0${r} <${+s+1}.0.0-0`:d(c)?s==="0"?u=`>=${s}.${n}.0${r} <${s}.${+n+1}.0-0`:u=`>=${s}.${n}.0${r} <${+s+1}.0.0-0`:a?($("replaceCaret pr",a),s==="0"?n==="0"?u=`>=${s}.${n}.${c}-${a} <${s}.${n}.${+c+1}-0`:u=`>=${s}.${n}.${c}-${a} <${s}.${+n+1}.0-0`:u=`>=${s}.${n}.${c}-${a} <${+s+1}.0.0-0`):($("no pr"),s==="0"?n==="0"?u=`>=${s}.${n}.${c}${r} <${s}.${n}.${+c+1}-0`:u=`>=${s}.${n}.${c}${r} <${s}.${+n+1}.0-0`:u=`>=${s}.${n}.${c} <${+s+1}.0.0-0`),$("caret return",u),u})},H=(t,e)=>($("replaceXRanges",t,e),t.split(/\s+/).map(i=>U(i,e)).join(" ")),U=(t,e)=>{t=t.trim();const i=e.loose?h[o.XRANGELOOSE]:h[o.XRANGE];return t.replace(i,(r,l,s,n,c,a)=>{$("xRange",t,r,l,s,n,c,a);const u=d(s),R=u||d(n),f=R||d(c),T=f;return l==="="&&T&&(l=""),a=e.includePrerelease?"-0":"",u?l===">"||l==="<"?r="<0.0.0-0":r="*":l&&T?(R&&(n=0),c=0,l===">"?(l=">=",R?(s=+s+1,n=0,c=0):(n=+n+1,c=0)):l==="<="&&(l="<",R?s=+s+1:n=+n+1),l==="<"&&(a="-0"),r=`${l+s}.${n}.${c}${a}`):R?r=`>=${s}.0.0${a} <${+s+1}.0.0-0`:f&&(r=`>=${s}.${n}.0${a} <${s}.${+n+1}.0-0`),$("xRange return",r),r})},Y=(t,e)=>($("replaceStars",t,e),t.trim().replace(h[o.STAR],"")),k=(t,e)=>($("replaceGTE0",t,e),t.trim().replace(h[e.includePrerelease?o.GTE0PRE:o.GTE0],"")),z=t=>(e,i,r,l,s,n,c,a,u,R,f,T)=>(d(r)?i="":d(l)?i=`>=${r}.0.0${t?"-0":""}`:d(s)?i=`>=${r}.${l}.0${t?"-0":""}`:n?i=`>=${i}`:i=`>=${i}${t?"-0":""}`,d(u)?a="":d(R)?a=`<${+u+1}.0.0-0`:d(f)?a=`<${u}.${+R+1}.0-0`:T?a=`<=${u}.${R}.${f}-${T}`:t?a=`<${u}.${R}.${+f+1}-0`:a=`<=${a}`,`${i} ${a}`.trim()),F=(t,e,i)=>{for(let r=0;r<t.length;r++)if(!t[r].test(e))return!1;if(e.prerelease.length&&!i.includePrerelease){for(let r=0;r<t.length;r++)if($(t[r].semver),t[r].semver!==O.ANY&&t[r].semver.prerelease.length>0){const l=t[r].semver;if(l.major===e.major&&l.minor===e.minor&&l.patch===e.patch)return!0}return!1}return!0};return S}exports.__require=m;
-//# sourceMappingURL=range.cjs.js.map