@crawlee/core 4.0.0-beta.65 → 4.0.0-beta.66

package/storages/request_queue_v2.d.ts

@@ -1,88 +0,0 @@
-import type { BatchAddRequestsResult, Dictionary } from '@crawlee/types';
-import type { Configuration } from '../configuration.js';
-import type { Request, Source } from '../request.js';
-import type { RequestsLike } from './request_manager.js';
-import type { RequestProviderOptions, RequestQueueOperationInfo, RequestQueueOperationOptions } from './request_provider.js';
-import { RequestProvider } from './request_provider.js';
-/**
- * Represents a queue of URLs to crawl, which is used for deep crawling of websites
- * where you start with several URLs and then recursively
- * follow links to other pages. The data structure supports both breadth-first and depth-first crawling orders.
- *
- * Each URL is represented using an instance of the {@link Request} class.
- * The queue can only contain unique URLs. More precisely, it can only contain {@link Request} instances
- * with distinct `uniqueKey` properties. By default, `uniqueKey` is generated from the URL, but it can also be overridden.
- * To add a single URL multiple times to the queue,
- * corresponding {@link Request} objects will need to have different `uniqueKey` properties.
- *
- * Do not instantiate this class directly, use the {@link RequestQueue.open} function instead.
- *
- * `RequestQueue` is used by {@link BasicCrawler}, {@link CheerioCrawler}, {@link PuppeteerCrawler}
- * and {@link PlaywrightCrawler} as a source of URLs to crawl.
- * Unlike {@link RequestList}, `RequestQueue` supports dynamic adding and removing of requests.
- * On the other hand, the queue is not optimized for operations that add or remove a large number of URLs in a batch.
- *
- * **Example usage:**
- *
- * ```javascript
- * // Open the default request queue associated with the crawler run
- * const queue = await RequestQueue.open();
- *
- * // Open a named request queue
- * const queueWithName = await RequestQueue.open('some-name');
- *
- * // Enqueue few requests
- * await queue.addRequest({ url: 'http://example.com/aaa' });
- * await queue.addRequest({ url: 'http://example.com/bbb' });
- * await queue.addRequest({ url: 'http://example.com/foo/bar' }, { forefront: true });
- * ```
- * @category Sources
- */
-export declare class RequestQueue extends RequestProvider {
-    private listHeadAndLockPromise;
-    private queueHasLockedRequests;
-    private shouldCheckForForefrontRequests;
-    private dequeuedRequestCount;
-    constructor(options: RequestProviderOptions, config?: Configuration);
-    /**
-     * Caches information about request to beware of unneeded addRequest() calls.
-     */
-    protected _cacheRequest(cacheKey: string, queueOperationInfo: RequestQueueOperationInfo): void;
-    /**
-     * @inheritDoc
-     */
-    addRequest(requestLike: Source, options?: RequestQueueOperationOptions): Promise<RequestQueueOperationInfo>;
-    /**
-     * @inheritDoc
-     */
-    addRequests(requestsLike: RequestsLike, options?: RequestQueueOperationOptions): Promise<BatchAddRequestsResult>;
-    /**
-     * @inheritDoc
-     */
-    fetchNextRequest<T extends Dictionary = Dictionary>(): Promise<Request<T> | null>;
-    /**
-     * @inheritDoc
-     */
-    markRequestHandled(request: Request): Promise<RequestQueueOperationInfo | null>;
-    /**
-     * @inheritDoc
-     */
-    isFinished(): Promise<boolean>;
-    /**
-     * @inheritDoc
-     */
-    reclaimRequest(...args: Parameters<RequestProvider['reclaimRequest']>): ReturnType<RequestProvider['reclaimRequest']>;
-    protected ensureHeadIsNonEmpty(): Promise<void>;
-    private giveUpLock;
-    private _listHeadAndLock;
-    private getOrHydrateRequest;
-    private _prolongRequestLock;
-    protected _reset(): void;
-    protected _maybeAddRequestToQueueHead(): void;
-    protected _clearPossibleLocks(): Promise<void>;
-    /**
-     * @inheritDoc
-     */
-    static open(...args: Parameters<typeof RequestProvider.open>): Promise<RequestQueue>;
-}
-//# sourceMappingURL=request_queue_v2.d.ts.map

package/storages/request_queue_v2.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"request_queue_v2.d.ts","sourceRoot":"","sources":["../../src/storages/request_queue_v2.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEzE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEzD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAGrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EACR,sBAAsB,EACtB,yBAAyB,EACzB,4BAA4B,EAC/B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAiBxD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,qBAAa,YAAa,SAAQ,eAAe;IAC7C,OAAO,CAAC,sBAAsB,CAA8B;IAC5D,OAAO,CAAC,sBAAsB,CAAkC;IAChE,OAAO,CAAC,+BAA+B,CAAS;IAChD,OAAO,CAAC,oBAAoB,CAAK;gBAErB,OAAO,EAAE,sBAAsB,EAAE,MAAM,GAAE,aAAiD;IAoBtG;;OAEG;cACgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,kBAAkB,EAAE,yBAAyB,GAAG,IAAI;IAevG;;OAEG;IACY,UAAU,CACrB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,4BAAiC,GAC3C,OAAO,CAAC,yBAAyB,CAAC;IAQrC;;OAEG;IACY,WAAW,CACtB,YAAY,EAAE,YAAY,EAC1B,OAAO,GAAE,4BAAiC,GAC3C,OAAO,CAAC,sBAAsB,CAAC;IAWlC;;OAEG;IACY,gBAAgB,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAiDhG;;OAEG;IACY,kBAAkB,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,yBAAyB,GAAG,IAAI,CAAC;IAK9F;;OAEG;IACY,UAAU,IAAI,OAAO,CAAC,OAAO,CAAC;IA+E7C;;OAEG;IACY,cAAc,CACzB,GAAG,IAAI,EAAE,UAAU,CAAC,eAAe,CAAC,gBAAgB,CAAC,CAAC,GACvD,UAAU,CAAC,eAAe,CAAC,gBAAgB,CAAC,CAAC;cAqBhC,oBAAoB;YAqBtB,UAAU;YAYV,gBAAgB;YAmFhB,mBAAmB;YAuFnB,mBAAmB;cAiBd,MAAM;cAMN,2BAA2B;cAI9B,mBAAmB;IAcnC;;OAEG;WACmB,IAAI,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,YAAY,CAAC;CAGtG"}

package/storages/request_queue_v2.js

@@ -1,437 +0,0 @@
-import { serviceLocator } from '../service_locator.js';
-import { checkStorageAccess } from './access_checking.js';
-import { RequestProvider } from './request_provider.js';
-import { getRequestId } from './utils.js';
-// Double the limit of RequestQueue v1 (1_000_000) as we also store keyed by request.id, not just from uniqueKey
-const MAX_CACHED_REQUESTS = 2_000_000;
-/**
- * This number must be large enough so that processing of all these requests cannot be done in
- * a time lower than expected maximum latency of DynamoDB, but low enough not to waste too much memory.
- * @internal
- */
-const RECENTLY_HANDLED_CACHE_SIZE = 1000;
-const LIST_AND_LOCK_HEAD_LIMIT = 25;
-const QUEUE_HEAD_REFILL_THRESHOLD = 1;
-/**
- * Represents a queue of URLs to crawl, which is used for deep crawling of websites
- * where you start with several URLs and then recursively
- * follow links to other pages. The data structure supports both breadth-first and depth-first crawling orders.
- *
- * Each URL is represented using an instance of the {@link Request} class.
- * The queue can only contain unique URLs. More precisely, it can only contain {@link Request} instances
- * with distinct `uniqueKey` properties. By default, `uniqueKey` is generated from the URL, but it can also be overridden.
- * To add a single URL multiple times to the queue,
- * corresponding {@link Request} objects will need to have different `uniqueKey` properties.
- *
- * Do not instantiate this class directly, use the {@link RequestQueue.open} function instead.
- *
- * `RequestQueue` is used by {@link BasicCrawler}, {@link CheerioCrawler}, {@link PuppeteerCrawler}
- * and {@link PlaywrightCrawler} as a source of URLs to crawl.
- * Unlike {@link RequestList}, `RequestQueue` supports dynamic adding and removing of requests.
- * On the other hand, the queue is not optimized for operations that add or remove a large number of URLs in a batch.
- *
- * **Example usage:**
- *
- * ```javascript
- * // Open the default request queue associated with the crawler run
- * const queue = await RequestQueue.open();
- *
- * // Open a named request queue
- * const queueWithName = await RequestQueue.open('some-name');
- *
- * // Enqueue few requests
- * await queue.addRequest({ url: 'http://example.com/aaa' });
- * await queue.addRequest({ url: 'http://example.com/bbb' });
- * await queue.addRequest({ url: 'http://example.com/foo/bar' }, { forefront: true });
- * ```
- * @category Sources
- */
-export class RequestQueue extends RequestProvider {
-    listHeadAndLockPromise = null;
-    queueHasLockedRequests = undefined;
-    shouldCheckForForefrontRequests = false;
-    dequeuedRequestCount = 0;
-    constructor(options, config = serviceLocator.getConfiguration()) {
-        super({
-            ...options,
-            logPrefix: 'RequestQueue2',
-            recentlyHandledRequestsMaxSize: RECENTLY_HANDLED_CACHE_SIZE,
-            requestCacheMaxSize: MAX_CACHED_REQUESTS,
-        }, config);
-        this.events.on("migrating" /* EventType.MIGRATING */, async () => {
-            await this._clearPossibleLocks();
-        });
-        this.events.on("aborting" /* EventType.ABORTING */, async () => {
-            await this._clearPossibleLocks();
-        });
-    }
-    /**
-     * Caches information about request to beware of unneeded addRequest() calls.
-     */
-    _cacheRequest(cacheKey, queueOperationInfo) {
-        super._cacheRequest(cacheKey, queueOperationInfo);
-        this.requestCache.remove(queueOperationInfo.requestId);
-        this.requestCache.add(queueOperationInfo.requestId, {
-            id: queueOperationInfo.requestId,
-            isHandled: queueOperationInfo.wasAlreadyHandled,
-            uniqueKey: queueOperationInfo.uniqueKey,
-            forefront: queueOperationInfo.forefront,
-            hydrated: null,
-            lockExpiresAt: null,
-        });
-    }
-    /**
-     * @inheritDoc
-     */
-    async addRequest(requestLike, options = {}) {
-        const result = await super.addRequest(requestLike, options);
-        if (!result.wasAlreadyPresent && options.forefront) {
-            this.shouldCheckForForefrontRequests = true;
-        }
-        return result;
-    }
-    /**
-     * @inheritDoc
-     */
-    async addRequests(requestsLike, options = {}) {
-        const result = await super.addRequests(requestsLike, options);
-        for (const request of result.processedRequests) {
-            if (!request.wasAlreadyPresent && options.forefront) {
-                this.shouldCheckForForefrontRequests = true;
-                break;
-            }
-        }
-        return result;
-    }
-    /**
-     * @inheritDoc
-     */
-    async fetchNextRequest() {
-        checkStorageAccess();
-        if (this.queuePausedForMigration) {
-            return null;
-        }
-        this.lastActivity = new Date();
-        await this.ensureHeadIsNonEmpty();
-        const nextRequestId = this.queueHeadIds.removeFirst();
-        // We are likely done at this point.
-        if (!nextRequestId) {
-            return null;
-        }
-        const request = await this.getOrHydrateRequest(nextRequestId);
-        // NOTE: It can happen that the queue head index is inconsistent with the main queue table. This can occur in two situations:
-        // 1) Queue head index is ahead of the main table and the request is not present in the main table yet (i.e. getRequest() returned null).
-        //    In this case, keep the request marked as in progress for a short while,
-        //    so that isFinished() doesn't return true and _ensureHeadIsNonEmpty() doesn't not load the request
-        //    into the queueHeadDict straight again. After the interval expires, fetchNextRequest()
-        //    will try to fetch this request again, until it eventually appears in the main table.
-        if (!request) {
-            this.log.debug('Cannot find a request from the beginning of queue or lost lock, will be retried later', {
-                nextRequestId,
-            });
-            return null;
-        }
-        // 2) Queue head index is behind the main table and the underlying request was already handled
-        //    (by some other client, since we keep the track of handled requests in recentlyHandled dictionary).
-        //    We just add the request to the recentlyHandled dictionary so that next call to _ensureHeadIsNonEmpty()
-        //    will not put the request again to queueHeadDict.
-        if (request.handledAt) {
-            this.log.debug('Request fetched from the beginning of queue was already handled', { nextRequestId });
-            return null;
-        }
-        this.dequeuedRequestCount += 1;
-        return request;
-    }
-    /**
-     * @inheritDoc
-     */
-    async markRequestHandled(request) {
-        this.dequeuedRequestCount -= 1;
-        return await super.markRequestHandled(request);
-    }
-    /**
-     * @inheritDoc
-     */
-    async isFinished() {
-        // We are not finished if we're still adding new requests in the background
-        if (this.inProgressRequestBatchCount > 0) {
-            return false;
-        }
-        // If the local queue head is non-empty, we don't need to query the "upstream" queue to know we are not finished yet
-        if (this.queueHeadIds.length() > 0) {
-            return false;
-        }
-        // Local queue head is empty - try to fetch and lock more requests
-        await this.ensureHeadIsNonEmpty();
-        // We managed to lock something - we are not finished
-        if (this.queueHeadIds.length() > 0) {
-            return false;
-        }
-        // We could not lock any new requests - decide based on whether the queue contains requests locked by another client
-        if (this.queueHasLockedRequests !== undefined) {
-            // The `% 25` was absolutely arbitrarily picked. It's just to not spam the logs too much.
-            if (this.queueHasLockedRequests &&
-                this.dequeuedRequestCount === 0 &&
-                ++this.isFinishedCalledWhileHeadWasNotEmpty % 25 === 0) {
-                this.log.info('The queue still contains requests locked by another client');
-            }
-            return !this.queueHasLockedRequests;
-        }
-        // The following is a legacy algorithm for checking if the queue is finished. It is used only for request queue clients that do not provide the `queueHasLockedRequests` flag.
-        const currentHead = await this.client.listHead({ limit: 2 });
-        if (currentHead.items.length === 0) {
-            return true;
-        }
-        // Give users some more concrete info as to why their crawlers seem to be "hanging" doing nothing while we're waiting because the queue is technically
-        // not empty. We decided that a queue with elements in its head but that are also locked shouldn't return true in this function.
-        // If that ever changes, this function might need a rewrite
-        // The `% 25` was absolutely arbitrarily picked. It's just to not spam the logs too much. This is also a very specific path that most crawlers shouldn't hit
-        if (++this.isFinishedCalledWhileHeadWasNotEmpty % 25 === 0) {
-            const requests = await Promise.all(currentHead.items.map(async (item) => this.client.getRequest(item.id)));
-            this.log.info(`Queue head still returned requests that need to be processed (or that are locked by other clients)`, {
-                requests: requests
-                    .map((r) => {
-                    if (!r) {
-                        return null;
-                    }
-                    return {
-                        id: r.id,
-                        lockExpiresAt: r.lockExpiresAt,
-                        lockedBy: r.lockByClient,
-                    };
-                })
-                    .filter(Boolean),
-                clientKey: this.clientKey,
-            });
-        }
-        else {
-            this.log.debug('Queue head still returned requests that need to be processed (or that are locked by other clients)', {
-                requestIds: currentHead.items.map((item) => item.id),
-            });
-        }
-        return false;
-    }
-    /**
-     * @inheritDoc
-     */
-    async reclaimRequest(...args) {
-        const res = await super.reclaimRequest(...args);
-        if (res) {
-            const [request, options] = args;
-            if (options?.forefront) {
-                this.shouldCheckForForefrontRequests = true;
-            }
-            // Try to delete the request lock if possible
-            try {
-                await this.client.deleteRequestLock(request.id, { forefront: options?.forefront ?? false });
-            }
-            catch (err) {
-                this.log.debug(`Failed to delete request lock for request ${request.id}`, { err });
-            }
-        }
-        return res;
-    }
-    async ensureHeadIsNonEmpty() {
-        checkStorageAccess();
-        // Stop fetching if we are paused for migration
-        if (this.queuePausedForMigration) {
-            return;
-        }
-        // We want to fetch ahead of time to minimize dead time
-        // If we need to check for newly added forefront requests, we do it even if we already have some locked requests
-        if (this.queueHeadIds.length() > QUEUE_HEAD_REFILL_THRESHOLD && !this.shouldCheckForForefrontRequests) {
-            return;
-        }
-        this.listHeadAndLockPromise ??= this._listHeadAndLock().finally(() => {
-            this.listHeadAndLockPromise = null;
-        });
-        await this.listHeadAndLockPromise;
-    }
-    async giveUpLock(id, uniqueKey) {
-        if (id === undefined) {
-            return;
-        }
-        try {
-            await this.client.deleteRequestLock(id);
-        }
-        catch {
-            this.log.debug('Failed to delete request lock', { id, uniqueKey });
-        }
-    }
-    async _listHeadAndLock() {
-        // Make a copy so that we can clear the flag only if the whole method executes after the flag was set
-        // (i.e, it was not set in the middle of the execution of the method)
-        const shouldCheckForForefrontRequests = this.shouldCheckForForefrontRequests;
-        // NOTE: in theory, if we're not checking for forefront requests, we could fetch just enough requests to fill the local queue head to the limit.
-        // We chose not to do this because 1. it's simpler and 2. the queue is being processed while we're fetching and we want to avoid underruns.
-        // If we are checking for forefront requests, we need to fetch enough requests to be sure that we won't miss any new forefront ones.
-        const headData = await this.client.listAndLockHead({
-            limit: LIST_AND_LOCK_HEAD_LIMIT,
-            lockSecs: this.requestLockSecs,
-        });
-        this.queueHasLockedRequests = headData.queueHasLockedRequests;
-        const headIdBuffer = [];
-        const forefrontHeadIdBuffer = [];
-        // Go through the fetched requests, ensure they are cached locally and sort them into normal and forefront groups
-        for (const { id, uniqueKey } of headData.items) {
-            if (!id || !uniqueKey) {
-                this.log.warning(`Skipping request from queue head as it's invalid. Please report this with the provided metadata!`, {
-                    id,
-                    uniqueKey,
-                });
-                // Remove the lock from the request for now, so that it can be picked up later
-                // This may/may not succeed, but that's fine
-                await this.giveUpLock(id, uniqueKey);
-                continue;
-            }
-            // If we remember that we added the request ourselves and we added it to the forefront,
-            // we will put it to the beginning of the local queue head to preserve the expected order.
-            // If we do not remember that, we will enqueue it normally.
-            const forefront = this.requestCache.get(getRequestId(uniqueKey))?.forefront ?? false;
-            if (forefront) {
-                forefrontHeadIdBuffer.unshift(id);
-            }
-            else {
-                headIdBuffer.push(id);
-            }
-            // Ensure that the request is cached locally
-            this._cacheRequest(getRequestId(uniqueKey), {
-                requestId: id,
-                uniqueKey,
-                wasAlreadyPresent: true,
-                wasAlreadyHandled: false,
-                forefront,
-            });
-        }
-        // Insert the newly fetched requests into the local queue head
-        for (const id of headIdBuffer) {
-            this.queueHeadIds.add(id, id, false);
-        }
-        for (const id of forefrontHeadIdBuffer) {
-            this.queueHeadIds.add(id, id, true);
-        }
-        // Unlock and forget requests that would make the local queue head grow over the limit
-        const toUnlock = [];
-        const limit = shouldCheckForForefrontRequests
-            ? LIST_AND_LOCK_HEAD_LIMIT // we may have received up to LIST_AND_LOCK_HEAD_LIMIT newly added forefront requests - we need to make sure that anything we already had in the queue gets unlocked
-            : LIST_AND_LOCK_HEAD_LIMIT + QUEUE_HEAD_REFILL_THRESHOLD; // we tolerate up to QUEUE_HEAD_REFILL_THRESHOLD additional requests to avoid frequent, yet unnecessary unlocks
-        while (this.queueHeadIds.length() > limit) {
-            toUnlock.push(this.queueHeadIds.removeLast());
-        }
-        if (toUnlock.length > 0) {
-            await Promise.all(toUnlock.map(async (id) => await this.giveUpLock(id)));
-        }
-        // We went through the whole procedure after `this.shouldCheckForForefrontRequests` was set -> we can clear the flag now
-        if (shouldCheckForForefrontRequests) {
-            this.shouldCheckForForefrontRequests = false;
-        }
-    }
-    async getOrHydrateRequest(requestId) {
-        checkStorageAccess();
-        const cachedEntry = this.requestCache.get(requestId);
-        if (!cachedEntry) {
-            // 2.1. Attempt to prolong the request lock to see if we still own the request
-            const prolongResult = await this._prolongRequestLock(requestId);
-            if (!prolongResult) {
-                return null;
-            }
-            // 2.1.1. If successful, hydrate the request and return it
-            const hydratedRequest = await this.getRequest(requestId);
-            // Queue head index is ahead of the main table and the request is not present in the main table yet (i.e. getRequest() returned null).
-            if (!hydratedRequest) {
-                // Remove the lock from the request for now, so that it can be picked up later
-                // This may/may not succeed, but that's fine
-                try {
-                    await this.client.deleteRequestLock(requestId);
-                }
-                catch {
-                    // Ignore
-                }
-                return null;
-            }
-            this.requestCache.add(requestId, {
-                id: requestId,
-                uniqueKey: hydratedRequest.uniqueKey,
-                hydrated: hydratedRequest,
-                isHandled: hydratedRequest.handledAt !== null,
-                lockExpiresAt: prolongResult.getTime(),
-                forefront: false,
-            });
-            return hydratedRequest;
-        }
-        // 1.1. If hydrated, prolong the lock more and return it
-        if (cachedEntry.hydrated) {
-            // 1.1.1. If the lock expired on the hydrated requests, try to prolong. If we fail, we lost the request (or it was handled already)
-            if (cachedEntry.lockExpiresAt && cachedEntry.lockExpiresAt < Date.now()) {
-                const prolonged = await this._prolongRequestLock(cachedEntry.id);
-                if (!prolonged) {
-                    return null;
-                }
-                cachedEntry.lockExpiresAt = prolonged.getTime();
-            }
-            return cachedEntry.hydrated;
-        }
-        // 1.2. If not hydrated, try to prolong the lock first (to ensure we keep it in our queue), hydrate and return it
-        const prolonged = await this._prolongRequestLock(cachedEntry.id);
-        if (!prolonged) {
-            return null;
-        }
-        // This might still return null if the queue head is inconsistent with the main queue table.
-        const hydratedRequest = await this.getRequest(cachedEntry.id);
-        cachedEntry.hydrated = hydratedRequest;
-        // Queue head index is ahead of the main table and the request is not present in the main table yet (i.e. getRequest() returned null).
-        if (!hydratedRequest) {
-            // Remove the lock from the request for now, so that it can be picked up later
-            // This may/may not succeed, but that's fine
-            try {
-                await this.client.deleteRequestLock(cachedEntry.id);
-            }
-            catch {
-                // Ignore
-            }
-            return null;
-        }
-        return hydratedRequest;
-    }
-    async _prolongRequestLock(requestId) {
-        try {
-            const res = await this.client.prolongRequestLock(requestId, { lockSecs: this.requestLockSecs });
-            return res.lockExpiresAt;
-        }
-        catch (err) {
-            // Most likely we do not own the lock anymore
-            this.log.warning(`Failed to prolong lock for cached request ${requestId}, either lost the lock or the request was already handled\n`, {
-                err,
-            });
-            return null;
-        }
-    }
-    _reset() {
-        super._reset();
-        this.listHeadAndLockPromise = null;
-        this.queueHasLockedRequests = undefined;
-    }
-    _maybeAddRequestToQueueHead() {
-        // Do nothing for request queue v2, as we are only able to lock requests when listing the head
-    }
-    async _clearPossibleLocks() {
-        this.queuePausedForMigration = true;
-        let requestId;
-        // eslint-disable-next-line no-cond-assign
-        while ((requestId = this.queueHeadIds.removeFirst()) !== null) {
-            try {
-                await this.client.deleteRequestLock(requestId);
-            }
-            catch {
-                // We don't have the lock, or the request was never locked. Either way it's fine
-            }
-        }
-    }
-    /**
-     * @inheritDoc
-     */
-    static async open(...args) {
-        return super.open(...args);
-    }
-}
-//# sourceMappingURL=request_queue_v2.js.map

package/storages/request_queue_v2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"request_queue_v2.js","sourceRoot":"","sources":["../../src/storages/request_queue_v2.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAO1D,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1C,gHAAgH;AAChH,MAAM,mBAAmB,GAAG,SAAS,CAAC;AAEtC;;;;GAIG;AACH,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAEzC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAEpC,MAAM,2BAA2B,GAAG,CAAC,CAAC;AAEtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,MAAM,OAAO,YAAa,SAAQ,eAAe;IACrC,sBAAsB,GAAyB,IAAI,CAAC;IACpD,sBAAsB,GAAwB,SAAS,CAAC;IACxD,+BAA+B,GAAG,KAAK,CAAC;IACxC,oBAAoB,GAAG,CAAC,CAAC;IAEjC,YAAY,OAA+B,EAAE,SAAwB,cAAc,CAAC,gBAAgB,EAAE;QAClG,KAAK,CACD;YACI,GAAG,OAAO;YACV,SAAS,EAAE,eAAe;YAC1B,8BAA8B,EAAE,2BAA2B;YAC3D,mBAAmB,EAAE,mBAAmB;SAC3C,EACD,MAAM,CACT,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,EAAE,wCAAsB,KAAK,IAAI,EAAE;YAC3C,MAAM,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,MAAM,CAAC,EAAE,sCAAqB,KAAK,IAAI,EAAE;YAC1C,MAAM,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;OAEG;IACgB,aAAa,CAAC,QAAgB,EAAE,kBAA6C;QAC5F,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAElD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAEvD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,kBAAkB,CAAC,SAAS,EAAE;YAChD,EAAE,EAAE,kBAAkB,CAAC,SAAS;YAChC,SAAS,EAAE,kBAAkB,CAAC,iBAAiB;YAC/C,SAAS,EAAE,kBAAkB,CAAC,SAAS;YACvC,SAAS,EAAE,kBAAkB,CAAC,SAAS;YACvC,QAAQ,EAAE,IAAI;YACd,aAAa,EAAE,IAAI;SACtB,CAAC,CAAC;IACP,CAAC;IAED;;OAEG;IACM,KAAK,CAAC,UAAU,CACrB,WAAmB,EACnB,UAAwC,EAAE;QAE1C,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,CAAC,MAAM,CAAC,iBAAiB,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;YACjD,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC;QAChD,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACM,KAAK,CAAC,WAAW,CACtB,YAA0B,EAC1B,UAAwC,EAAE;QAE1C,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,iBAAiB,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBAClD,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC;gBAC5C,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACM,KAAK,CAAC,gBAAgB;QAC3B,kBAAkB,EAAE,CAAC;QAErB,IAAI,IAAI,CAAC,uBAAuB,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC;QAE/B,MAAM,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAElC,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC;QAEtD,oCAAoC;QACpC,IAAI,CAAC,aAAa,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,OAAO,GAAmB,MAAM,IAAI,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;QAE9E,6HAA6H;QAE7H,yIAAyI;QACzI,6EAA6E;QAC7E,uGAAuG;QACvG,2FAA2F;QAC3F,0FAA0F;QAC1F,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,uFAAuF,EAAE;gBACpG,aAAa;aAChB,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,8FAA8F;QAC9F,wGAAwG;QACxG,4GAA4G;QAC5G,sDAAsD;QACtD,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,iEAAiE,EAAE,EAAE,aAAa,EAAE,CAAC,CAAC;YACrG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;QAE/B,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;OAEG;IACM,KAAK,CAAC,kBAAkB,CAAC,OAAgB;QAC9C,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;QAC/B,OAAO,MAAM,KAAK,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACM,KAAK,CAAC,UAAU;QACrB,2EAA2E;QAC3E,IAAI,IAAI,CAAC,2BAA2B,GAAG,CAAC,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,oHAAoH;QACpH,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,kEAAkE;QAClE,MAAM,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAElC,qDAAqD;QACrD,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,oHAAoH;QACpH,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,EAAE,CAAC;YAC5C,yFAAyF;YACzF,IACI,IAAI,CAAC,sBAAsB;gBAC3B,IAAI,CAAC,oBAAoB,KAAK,CAAC;gBAC/B,EAAE,IAAI,CAAC,oCAAoC,GAAG,EAAE,KAAK,CAAC,EACxD,CAAC;gBACC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,4DAA4D,CAAC,CAAC;YAChF,CAAC;YAED,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC;QACxC,CAAC;QAED,8KAA8K;QAE9K,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAE7D,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,sJAAsJ;QACtJ,gIAAgI;QAChI,2DAA2D;QAC3D,4JAA4J;QAC5J,IAAI,EAAE,IAAI,CAAC,oCAAoC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE3G,IAAI,CAAC,GAAG,CAAC,IAAI,CACT,oGAAoG,EACpG;gBACI,QAAQ,EAAE,QAAQ;qBACb,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBACP,IAAI,CAAC,CAAC,EAAE,CAAC;wBACL,OAAO,IAAI,CAAC;oBAChB,CAAC;oBAED,OAAO;wBACH,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,aAAa,EAAE,CAAC,CAAC,aAAa;wBAC9B,QAAQ,EAAE,CAAC,CAAC,YAAY;qBAC3B,CAAC;gBACN,CAAC,CAAC;qBACD,MAAM,CAAC,OAAO,CAAC;gBACpB,SAAS,EAAE,IAAI,CAAC,SAAS;aAC5B,CACJ,CAAC;QACN,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,GAAG,CAAC,KAAK,CACV,oGAAoG,EACpG;gBACI,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;aACvD,CACJ,CAAC;QACN,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACM,KAAK,CAAC,cAAc,CACzB,GAAG,IAAmD;QAEtD,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,CAAC;QAEhD,IAAI,GAAG,EAAE,CAAC;YACN,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;YAEhC,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC;gBACrB,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC;YAChD,CAAC;YAED,6CAA6C;YAC7C,IAAI,CAAC;gBACD,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAG,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,IAAI,KAAK,EAAE,CAAC,CAAC;YACjG,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,6CAA6C,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACvF,CAAC;QACL,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAES,KAAK,CAAC,oBAAoB;QAChC,kBAAkB,EAAE,CAAC;QAErB,+CAA+C;QAC/C,IAAI,IAAI,CAAC,uBAAuB,EAAE,CAAC;YAC/B,OAAO;QACX,CAAC;QAED,uDAAuD;QACvD,gHAAgH;QAChH,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,2BAA2B,IAAI,CAAC,IAAI,CAAC,+BAA+B,EAAE,CAAC;YACpG,OAAO;QACX,CAAC;QAED,IAAI,CAAC,sBAAsB,KAAK,IAAI,CAAC,gBAAgB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;YACjE,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,MAAM,IAAI,CAAC,sBAAsB,CAAC;IACtC,CAAC;IAEO,KAAK,CAAC,UAAU,CAAC,EAAW,EAAE,SAAkB;QACpD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACnB,OAAO;QACX,CAAC;QAED,IAAI,CAAC;YACD,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;QAAC,MAAM,CAAC;YACL,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,+BAA+B,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;QACvE,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,gBAAgB;QAC1B,qGAAqG;QACrG,qEAAqE;QACrE,MAAM,+BAA+B,GAAG,IAAI,CAAC,+BAA+B,CAAC;QAE7E,gJAAgJ;QAChJ,2IAA2I;QAC3I,oIAAoI;QACpI,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;YAC/C,KAAK,EAAE,wBAAwB;YAC/B,QAAQ,EAAE,IAAI,CAAC,eAAe;SACjC,CAAC,CAAC;QAEH,IAAI,CAAC,sBAAsB,GAAG,QAAQ,CAAC,sBAAsB,CAAC;QAE9D,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,MAAM,qBAAqB,GAAG,EAAE,CAAC;QAEjC,iHAAiH;QACjH,KAAK,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC7C,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,OAAO,CACZ,kGAAkG,EAClG;oBACI,EAAE;oBACF,SAAS;iBACZ,CACJ,CAAC;gBAEF,8EAA8E;gBAC9E,4CAA4C;gBAC5C,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBACrC,SAAS;YACb,CAAC;YAED,uFAAuF;YACvF,0FAA0F;YAC1F,2DAA2D;YAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,IAAI,KAAK,CAAC;YACrF,IAAI,SAAS,EAAE,CAAC;gBACZ,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACJ,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;YAED,4CAA4C;YAC5C,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE;gBACxC,SAAS,EAAE,EAAE;gBACb,SAAS;gBACT,iBAAiB,EAAE,IAAI;gBACvB,iBAAiB,EAAE,KAAK;gBACxB,SAAS;aACZ,CAAC,CAAC;QACP,CAAC;QAED,8DAA8D;QAC9D,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC5B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,qBAAqB,EAAE,CAAC;YACrC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;QAED,sFAAsF;QACtF,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,+BAA+B;YACzC,CAAC,CAAC,wBAAwB,CAAC,oKAAoK;YAC/L,CAAC,CAAC,wBAAwB,GAAG,2BAA2B,CAAC,CAAC,+GAA+G;QAC7K,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;YACxC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAG,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7E,CAAC;QAED,wHAAwH;QACxH,IAAI,+BAA+B,EAAE,CAAC;YAClC,IAAI,CAAC,+BAA+B,GAAG,KAAK,CAAC;QACjD,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAC7B,SAAiB;QAEjB,kBAAkB,EAAE,CAAC;QAErB,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAErD,IAAI,CAAC,WAAW,EAAE,CAAC;YACf,8EAA8E;YAC9E,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YAEhE,IAAI,CAAC,aAAa,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,0DAA0D;YAC1D,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YAEzD,sIAAsI;YACtI,IAAI,CAAC,eAAe,EAAE,CAAC;gBACnB,8EAA8E;gBAC9E,4CAA4C;gBAC5C,IAAI,CAAC;oBACD,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBACnD,CAAC;gBAAC,MAAM,CAAC;oBACL,SAAS;gBACb,CAAC;gBAED,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE;gBAC7B,EAAE,EAAE,SAAS;gBACb,SAAS,EAAE,eAAe,CAAC,SAAS;gBACpC,QAAQ,EAAE,eAAe;gBACzB,SAAS,EAAE,eAAe,CAAC,SAAS,KAAK,IAAI;gBAC7C,aAAa,EAAE,aAAa,CAAC,OAAO,EAAE;gBACtC,SAAS,EAAE,KAAK;aACnB,CAAC,CAAC;YAEH,OAAO,eAAe,CAAC;QAC3B,CAAC;QAED,wDAAwD;QACxD,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;YACvB,mIAAmI;YACnI,IAAI,WAAW,CAAC,aAAa,IAAI,WAAW,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;gBACtE,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBAEjE,IAAI,CAAC,SAAS,EAAE,CAAC;oBACb,OAAO,IAAI,CAAC;gBAChB,CAAC;gBAED,WAAW,CAAC,aAAa,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;YACpD,CAAC;YAED,OAAO,WAAW,CAAC,QAAQ,CAAC;QAChC,CAAC;QAED,iHAAiH;QACjH,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAEjE,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,4FAA4F;QAC5F,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAE9D,WAAW,CAAC,QAAQ,GAAG,eAAe,CAAC;QAEvC,sIAAsI;QACtI,IAAI,CAAC,eAAe,EAAE,CAAC;YACnB,8EAA8E;YAC9E,4CAA4C;YAC5C,IAAI,CAAC;gBACD,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACxD,CAAC;YAAC,MAAM,CAAC;gBACL,SAAS;YACb,CAAC;YAED,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,eAAe,CAAC;IAC3B,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAAC,SAAiB;QAC/C,IAAI,CAAC;YACD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;YAChG,OAAO,GAAG,CAAC,aAAa,CAAC;QAC7B,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAChB,6CAA6C;YAC7C,IAAI,CAAC,GAAG,CAAC,OAAO,CACZ,6CAA6C,SAAS,6DAA6D,EACnH;gBACI,GAAG;aACN,CACJ,CAAC;YAEF,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAEkB,MAAM;QACrB,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC;QACnC,IAAI,CAAC,sBAAsB,GAAG,SAAS,CAAC;IAC5C,CAAC;IAEkB,2BAA2B;QAC1C,8FAA8F;IAClG,CAAC;IAES,KAAK,CAAC,mBAAmB;QAC/B,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC;QACpC,IAAI,SAAwB,CAAC;QAE7B,0CAA0C;QAC1C,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5D,IAAI,CAAC;gBACD,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;YACnD,CAAC;YAAC,MAAM,CAAC;gBACL,gFAAgF;YACpF,CAAC;QACL,CAAC;IACL,CAAC;IAED;;OAEG;IACH,MAAM,CAAU,KAAK,CAAC,IAAI,CAAC,GAAG,IAA6C;QACvE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAA0B,CAAC;IACxD,CAAC;CACJ"}