@procedures/collections 0.46.0 → 0.47.2

package/dist/async/async-queue.d.ts

@@ -1,170 +0,0 @@
-/**
- * AsyncQueue - An async iterable queue with backpressure support.
- *
- * Designed for producer-consumer patterns where producers can wait when
- * the queue is full and consumers can wait when the queue is empty.
- * Implements AsyncIterable for use with for-await-of loops.
- *
- * @example
- * const queue = asyncQueue<number>({ capacity: 10 })
- *
- * // Producer
- * await queue.put(42) // Waits if queue is full
- *
- * // Consumer
- * const value = await queue.take() // Waits if queue is empty
- *
- * // Async iteration
- * for await (const value of queue) {
- *   console.log(value)
- * }
- */
-import type { AsyncQueue as IAsyncQueue } from "../interfaces/queue.js";
-/**
- * Options for creating an AsyncQueue.
- */
-export interface AsyncQueueOptions {
-    /**
-     * Maximum capacity. Infinity for unbounded queue.
-     * @default Infinity
-     */
-    capacity?: number;
-    /**
-     * Timeout for put/take operations in milliseconds.
-     * @default undefined (no timeout)
-     */
-    timeout?: number;
-}
-/**
- * AsyncQueue<T> - Thread-safe async queue with backpressure.
- *
- * Features:
- * - Blocking put() when full (backpressure)
- * - Blocking take() when empty
- * - AsyncIterable support
- * - Graceful closing
- * - Timeouts
- *
- * Perfect for:
- * - Producer-consumer patterns
- * - Rate limiting
- * - Task queues
- * - Stream processing
- */
-export declare class AsyncQueue<T> implements IAsyncQueue<T> {
-    private buffer;
-    private putters;
-    private takers;
-    /** The calls of `peek` that wait: they see the next element, but they do not take it. */
-    private peekers;
-    private _isClosed;
-    private readonly capacity;
-    private readonly defaultTimeout?;
-    constructor(options?: AsyncQueueOptions);
-    get size(): number;
-    get isEmpty(): boolean;
-    get isFull(): boolean;
-    get isClosed(): boolean;
-    get remainingCapacity(): number;
-    /**
-     * Adds an element to the queue.
-     * If the queue is full, waits until space is available. With a capacity of 0, it waits until
-     * a taker takes the element (a rendezvous).
-     *
-     * @throws Error if queue is closed
-     * @throws Error if timeout expires
-     */
-    put(element: T, timeout?: number): Promise<void>;
-    /**
-     * Removes and returns an element from the queue.
-     * If the queue is empty, waits until an element is available.
-     *
-     * @throws Error if queue is closed and empty
-     * @throws Error if timeout expires
-     */
-    take(timeout?: number): Promise<T>;
-    /**
-     * This method waits for the next element, as `take` does, but it gives the element to
-     * `onElement` and the closure of the queue to `onClosed`. These calls are synchronous: they
-     * occur in the call that adds the element or closes the queue. The method has no timeout.
-     *
-     * The function that it returns withdraws the wait. A withdrawn wait gets no element, so no
-     * element goes to a taker that left. `select` races its cases with this method.
-     *
-     * @returns A function that withdraws the wait. It returns true when the wait had no element yet.
-     */
-    waitTake(onElement: (element: T) => void, onClosed: (error: Error) => void): () => boolean;
-    /**
-     * Attempts to add an element without waiting.
-     * Returns false if queue is full (with a capacity of 0: if no taker waits).
-     */
-    tryPut(element: T): boolean;
-    /**
-     * Attempts to remove an element without waiting.
-     * Returns undefined if queue is empty.
-     */
-    tryTake(): T | undefined;
-    /** Gives the element to a waiting taker, or puts it in the buffer when there is space. */
-    private tryPutNow;
-    /** Each waiting peek gets the element, which stays where it is. */
-    private wakePeekers;
-    /**
-     * Takes the next element: from the buffer (then a waiting putter moves its element into the
-     * buffer), or directly from a waiting putter (a capacity of 0). (Before, the direct path
-     * released the putter but never gave its element to the taker, so the taker waited forever:
-     * BUGS-2026-07 C11.)
-     */
-    private takeNow;
-    /**
-     * Returns the next element without removing it.
-     * Waits if queue is empty.
-     */
-    peek(): Promise<T>;
-    /**
-     * Returns the next element without waiting.
-     * Returns undefined if queue is empty.
-     */
-    tryPeek(): T | undefined;
-    /**
-     * Closes the queue. No more elements can be added.
-     * Existing elements can still be consumed.
-     */
-    close(): void;
-    /**
-     * Drains all elements into an array.
-     * Returns immediately with current elements.
-     */
-    drain(): T[];
-    /**
-     * Async iterator that yields elements as they become available.
-     * Stops when queue is closed and empty.
-     */
-    [Symbol.asyncIterator](): AsyncIterator<T>;
-    /** When the buffer has space, the first waiting putter moves its element into it. */
-    private admitPutter;
-    private clearTimeout;
-    /**
-     * Returns statistics about the queue.
-     */
-    getStats(): {
-        size: number;
-        capacity: number;
-        isEmpty: boolean;
-        isFull: boolean;
-        isClosed: boolean;
-        waitingPutters: number;
-        waitingTakers: number;
-        remainingCapacity: number;
-    };
-    toString(): string;
-}
-/**
- * Factory function to create an AsyncQueue.
- *
- * @example
- * const queue = asyncQueue<number>({ capacity: 100 })
- * await queue.put(42)
- * const value = await queue.take()
- */
-export declare function asyncQueue<T>(options?: AsyncQueueOptions): AsyncQueue<T>;
-//# sourceMappingURL=async-queue.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"async-queue.d.ts","sourceRoot":"","sources":["../../src/async/async-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,UAAU,IAAI,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAExE;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAgBD;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,WAAW,CAAC,CAAC,CAAC;IAClD,OAAO,CAAC,MAAM,CAAW;IACzB,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,MAAM,CAAqB;IACnC,yFAAyF;IACzF,OAAO,CAAC,OAAO,CAAqB;IACpC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAS;IAEzC,YAAY,OAAO,GAAE,iBAAsB,EAK1C;IAMD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,IAAI,iBAAiB,IAAI,MAAM,CAE9B;IAMD;;;;;;;OAOG;IACG,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CA2BrD;IAED;;;;;;OAMG;IACG,IAAI,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CA0BvC;IAED;;;;;;;;;OASG;IACH,QAAQ,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,IAAI,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,MAAM,OAAO,CAkBzF;IAMD;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAK1B;IAED;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS,CAGvB;IAED,0FAA0F;IAC1F,OAAO,CAAC,SAAS;IAiBjB,mEAAmE;IACnE,OAAO,CAAC,WAAW;IASnB;;;;;OAKG;IACH,OAAO,CAAC,OAAO;IAmBf;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC,CA4BvB;IAED;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS,CAEvB;IAMD;;;OAGG;IACH,KAAK,IAAI,IAAI,CAuBZ;IAED;;;OAGG;IACH,KAAK,IAAI,CAAC,EAAE,CAWX;IAMD;;;OAGG;IACI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAmBhD;IAMD,qFAAqF;IACrF,OAAO,CAAC,WAAW;IASnB,OAAO,CAAC,YAAY;IAUpB;;OAEG;IACH,QAAQ,IAAK;QACX,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,OAAO,CAAC;QACjB,MAAM,EAAE,OAAO,CAAC;QAChB,QAAQ,EAAE,OAAO,CAAC;QAClB,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAWA;IAED,QAAQ,IAAI,MAAM,CAEjB;CACF;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,UAAU,CAAC,CAAC,CAAC,CAExE"}

package/dist/async/async-queue.js

@@ -1,404 +0,0 @@
-/**
- * AsyncQueue - An async iterable queue with backpressure support.
- *
- * Designed for producer-consumer patterns where producers can wait when
- * the queue is full and consumers can wait when the queue is empty.
- * Implements AsyncIterable for use with for-await-of loops.
- *
- * @example
- * const queue = asyncQueue<number>({ capacity: 10 })
- *
- * // Producer
- * await queue.put(42) // Waits if queue is full
- *
- * // Consumer
- * const value = await queue.take() // Waits if queue is empty
- *
- * // Async iteration
- * for await (const value of queue) {
- *   console.log(value)
- * }
- */
-/**
- * AsyncQueue<T> - Thread-safe async queue with backpressure.
- *
- * Features:
- * - Blocking put() when full (backpressure)
- * - Blocking take() when empty
- * - AsyncIterable support
- * - Graceful closing
- * - Timeouts
- *
- * Perfect for:
- * - Producer-consumer patterns
- * - Rate limiting
- * - Task queues
- * - Stream processing
- */
-export class AsyncQueue {
-    buffer = [];
-    putters = [];
-    takers = [];
-    /** The calls of `peek` that wait: they see the next element, but they do not take it. */
-    peekers = [];
-    _isClosed = false;
-    capacity;
-    defaultTimeout;
-    constructor(options = {}) {
-        this.capacity = options.capacity ?? Infinity;
-        if (options.timeout !== undefined) {
-            this.defaultTimeout = options.timeout;
-        }
-    }
-    // ========================================================================
-    // Size and state
-    // ========================================================================
-    get size() {
-        return this.buffer.length;
-    }
-    get isEmpty() {
-        return this.buffer.length === 0;
-    }
-    get isFull() {
-        return this.buffer.length >= this.capacity;
-    }
-    get isClosed() {
-        return this._isClosed;
-    }
-    get remainingCapacity() {
-        return this.capacity === Infinity ? Infinity : this.capacity - this.buffer.length;
-    }
-    // ========================================================================
-    // Blocking operations
-    // ========================================================================
-    /**
-     * Adds an element to the queue.
-     * If the queue is full, waits until space is available. With a capacity of 0, it waits until
-     * a taker takes the element (a rendezvous).
-     *
-     * @throws Error if queue is closed
-     * @throws Error if timeout expires
-     */
-    async put(element, timeout) {
-        if (this._isClosed) {
-            throw new Error("Queue is closed");
-        }
-        if (this.tryPutNow(element)) {
-            return;
-        }
-        // A waiting peek sees the element of a waiting put (a capacity of 0)
-        this.wakePeekers(element);
-        // Queue is full: wait with the element. (Before, a waiting putter kept only its resolve
-        // function, so its element was dropped when space came: BUGS-2026-07 C11.)
-        return new Promise((resolve, reject) => {
-            const putter = { element, resolve, reject };
-            const timeoutMs = timeout ?? this.defaultTimeout;
-            if (timeoutMs !== undefined) {
-                putter.timeoutId = setTimeout(() => {
-                    const index = this.putters.indexOf(putter);
-                    if (index !== -1) {
-                        this.putters.splice(index, 1);
-                    }
-                    reject(new Error(`Put timeout after ${timeoutMs}ms`));
-                }, timeoutMs);
-            }
-            this.putters.push(putter);
-        });
-    }
-    /**
-     * Removes and returns an element from the queue.
-     * If the queue is empty, waits until an element is available.
-     *
-     * @throws Error if queue is closed and empty
-     * @throws Error if timeout expires
-     */
-    async take(timeout) {
-        const next = this.takeNow();
-        if (next.found) {
-            return next.element;
-        }
-        // If closed and empty, throw
-        if (this._isClosed) {
-            throw new Error("Queue is closed and empty");
-        }
-        // Wait for an element
-        return new Promise((resolve, reject) => {
-            const taker = { resolve, reject };
-            const timeoutMs = timeout ?? this.defaultTimeout;
-            if (timeoutMs !== undefined) {
-                taker.timeoutId = setTimeout(() => {
-                    const index = this.takers.indexOf(taker);
-                    if (index !== -1) {
-                        this.takers.splice(index, 1);
-                    }
-                    reject(new Error(`Take timeout after ${timeoutMs}ms`));
-                }, timeoutMs);
-            }
-            this.takers.push(taker);
-        });
-    }
-    /**
-     * This method waits for the next element, as `take` does, but it gives the element to
-     * `onElement` and the closure of the queue to `onClosed`. These calls are synchronous: they
-     * occur in the call that adds the element or closes the queue. The method has no timeout.
-     *
-     * The function that it returns withdraws the wait. A withdrawn wait gets no element, so no
-     * element goes to a taker that left. `select` races its cases with this method.
-     *
-     * @returns A function that withdraws the wait. It returns true when the wait had no element yet.
-     */
-    waitTake(onElement, onClosed) {
-        const next = this.takeNow();
-        if (next.found) {
-            onElement(next.element);
-            return () => false;
-        }
-        if (this._isClosed) {
-            onClosed(new Error("Queue is closed and empty"));
-            return () => false;
-        }
-        const taker = { resolve: onElement, reject: onClosed };
-        this.takers.push(taker);
-        return () => {
-            const index = this.takers.indexOf(taker);
-            if (index === -1)
-                return false;
-            this.takers.splice(index, 1);
-            return true;
-        };
-    }
-    // ========================================================================
-    // Non-blocking operations
-    // ========================================================================
-    /**
-     * Attempts to add an element without waiting.
-     * Returns false if queue is full (with a capacity of 0: if no taker waits).
-     */
-    tryPut(element) {
-        if (this._isClosed) {
-            return false;
-        }
-        return this.tryPutNow(element);
-    }
-    /**
-     * Attempts to remove an element without waiting.
-     * Returns undefined if queue is empty.
-     */
-    tryTake() {
-        const next = this.takeNow();
-        return next.found ? next.element : undefined;
-    }
-    /** Gives the element to a waiting taker, or puts it in the buffer when there is space. */
-    tryPutNow(element) {
-        // A waiting taker gets the element directly (the buffer is empty when a taker waits)
-        const taker = this.takers.shift();
-        if (taker) {
-            this.wakePeekers(element);
-            this.clearTimeout(taker);
-            taker.resolve(element);
-            return true;
-        }
-        if (this.buffer.length < this.capacity) {
-            this.buffer.push(element);
-            this.wakePeekers(element);
-            return true;
-        }
-        return false;
-    }
-    /** Each waiting peek gets the element, which stays where it is. */
-    wakePeekers(element) {
-        const peekers = this.peekers;
-        this.peekers = [];
-        for (const peeker of peekers) {
-            this.clearTimeout(peeker);
-            peeker.resolve(element);
-        }
-    }
-    /**
-     * Takes the next element: from the buffer (then a waiting putter moves its element into the
-     * buffer), or directly from a waiting putter (a capacity of 0). (Before, the direct path
-     * released the putter but never gave its element to the taker, so the taker waited forever:
-     * BUGS-2026-07 C11.)
-     */
-    takeNow() {
-        if (this.buffer.length > 0) {
-            const element = this.buffer.shift();
-            this.admitPutter();
-            return { found: true, element };
-        }
-        const putter = this.putters.shift();
-        if (putter) {
-            this.clearTimeout(putter);
-            putter.resolve();
-            return { found: true, element: putter.element };
-        }
-        return { found: false };
-    }
-    // ========================================================================
-    // Peeking
-    // ========================================================================
-    /**
-     * Returns the next element without removing it.
-     * Waits if queue is empty.
-     */
-    async peek() {
-        if (this.buffer.length > 0) {
-            return this.buffer[0];
-        }
-        if (this.putters.length > 0) {
-            return this.putters[0].element;
-        }
-        if (this._isClosed) {
-            throw new Error("Queue is closed and empty");
-        }
-        // Wait for the next element without a take. (Before, peek took the element and put it back
-        // at the front: a take that waited after it kept waiting, and the order changed: audit pass 2.)
-        return new Promise((resolve, reject) => {
-            const peeker = { resolve, reject };
-            const timeoutMs = this.defaultTimeout;
-            if (timeoutMs !== undefined) {
-                peeker.timeoutId = setTimeout(() => {
-                    const index = this.peekers.indexOf(peeker);
-                    if (index !== -1) {
-                        this.peekers.splice(index, 1);
-                    }
-                    reject(new Error(`Peek timeout after ${timeoutMs}ms`));
-                }, timeoutMs);
-            }
-            this.peekers.push(peeker);
-        });
-    }
-    /**
-     * Returns the next element without waiting.
-     * Returns undefined if queue is empty.
-     */
-    tryPeek() {
-        return this.buffer.length > 0 ? this.buffer[0] : this.putters[0]?.element;
-    }
-    // ========================================================================
-    // Closing and draining
-    // ========================================================================
-    /**
-     * Closes the queue. No more elements can be added.
-     * Existing elements can still be consumed.
-     */
-    close() {
-        this._isClosed = true;
-        // Reject all waiting putters
-        for (const putter of this.putters) {
-            this.clearTimeout(putter);
-            putter.reject(new Error("Queue closed"));
-        }
-        this.putters = [];
-        // Wake up takers if queue is empty
-        if (this.buffer.length === 0) {
-            for (const taker of this.takers) {
-                this.clearTimeout(taker);
-                taker.reject(new Error("Queue closed and empty"));
-            }
-            this.takers = [];
-            for (const peeker of this.peekers) {
-                this.clearTimeout(peeker);
-                peeker.reject(new Error("Queue closed and empty"));
-            }
-            this.peekers = [];
-        }
-    }
-    /**
-     * Drains all elements into an array.
-     * Returns immediately with current elements.
-     */
-    drain() {
-        // The buffer, then the elements of the waiting putters, in order. (Before, the waiting
-        // putters were released but their elements were dropped.)
-        const elements = this.buffer.slice();
-        this.buffer = [];
-        for (const putter of this.putters.splice(0)) {
-            this.clearTimeout(putter);
-            putter.resolve();
-            elements.push(putter.element);
-        }
-        return elements;
-    }
-    // ========================================================================
-    // Async iteration
-    // ========================================================================
-    /**
-     * Async iterator that yields elements as they become available.
-     * Stops when queue is closed and empty.
-     */
-    async *[Symbol.asyncIterator]() {
-        while (true) {
-            const next = this.takeNow();
-            if (next.found) {
-                yield next.element;
-            }
-            else if (this._isClosed) {
-                break;
-            }
-            else {
-                let element;
-                try {
-                    element = await this.take();
-                }
-                catch (error) {
-                    // The queue was closed while the iterator waited
-                    if (this._isClosed)
-                        break;
-                    throw error;
-                }
-                yield element;
-            }
-        }
-    }
-    // ========================================================================
-    // Private helpers
-    // ========================================================================
-    /** When the buffer has space, the first waiting putter moves its element into it. */
-    admitPutter() {
-        if (this.putters.length > 0 && this.buffer.length < this.capacity) {
-            const putter = this.putters.shift();
-            this.clearTimeout(putter);
-            this.buffer.push(putter.element);
-            putter.resolve();
-        }
-    }
-    clearTimeout(resolver) {
-        if (resolver.timeoutId) {
-            clearTimeout(resolver.timeoutId);
-        }
-    }
-    // ========================================================================
-    // Utility methods
-    // ========================================================================
-    /**
-     * Returns statistics about the queue.
-     */
-    getStats() {
-        return {
-            size: this.size,
-            capacity: this.capacity,
-            isEmpty: this.isEmpty,
-            isFull: this.isFull,
-            isClosed: this._isClosed,
-            waitingPutters: this.putters.length,
-            waitingTakers: this.takers.length,
-            remainingCapacity: this.remainingCapacity,
-        };
-    }
-    toString() {
-        return `AsyncQueue[size=${this.size}, capacity=${this.capacity}, closed=${this._isClosed}]`;
-    }
-}
-/**
- * Factory function to create an AsyncQueue.
- *
- * @example
- * const queue = asyncQueue<number>({ capacity: 100 })
- * await queue.put(42)
- * const value = await queue.take()
- */
-export function asyncQueue(options) {
-    return new AsyncQueue(options);
-}
-//# sourceMappingURL=async-queue.js.map

package/dist/async/async-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-queue.js","sourceRoot":"","sources":["../../src/async/async-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAmCH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,UAAU;IACb,MAAM,GAAQ,EAAE,CAAC;IACjB,OAAO,GAAgB,EAAE,CAAC;IAC1B,MAAM,GAAkB,EAAE,CAAC;IACnC,yFAAyF;IACjF,OAAO,GAAkB,EAAE,CAAC;IAC5B,SAAS,GAAG,KAAK,CAAC;IACT,QAAQ,CAAS;IACjB,cAAc,CAAU;IAEzC,YAAY,OAAO,GAAsB,EAAE;QACzC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC7C,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC;QACxC,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,iBAAiB;IACjB,2EAA2E;IAE3E,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC;IAC7C,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IACpF,CAAC;IAED,2EAA2E;IAC3E,sBAAsB;IACtB,2EAA2E;IAE3E;;;;;;;OAOG;IACH,KAAK,CAAC,GAAG,CAAC,OAAU,EAAE,OAAgB;QACpC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QAED,qEAAqE;QACrE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAE1B,wFAAwF;QACxF,2EAA2E;QAC3E,OAAO,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YAC3C,MAAM,MAAM,GAAc,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;YACvD,MAAM,SAAS,GAAG,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC;YACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;oBACjC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC3C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;wBACjB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBAChC,CAAC;oBACD,MAAM,CAAC,IAAI,KAAK,CAAC,qBAAqB,SAAS,IAAI,CAAC,CAAC,CAAC;gBACxD,CAAC,EAAE,SAAS,CAAC,CAAC;YAChB,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,IAAI,CAAC,OAAgB;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAED,6BAA6B;QAC7B,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAC/C,CAAC;QAED,sBAAsB;QACtB,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,MAAM,KAAK,GAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;YAC/C,MAAM,SAAS,GAAG,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC;YACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,KAAK,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;oBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACzC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;wBACjB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBAC/B,CAAC;oBACD,MAAM,CAAC,IAAI,KAAK,CAAC,sBAAsB,SAAS,IAAI,CAAC,CAAC,CAAC;gBACzD,CAAC,EAAE,SAAS,CAAC,CAAC;YAChB,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;OASG;IACH,QAAQ,CAAC,SAA+B,EAAE,QAAgC;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,QAAQ,CAAC,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC,CAAC;YACjD,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;QACrB,CAAC;QACD,MAAM,KAAK,GAAgB,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;QACpE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,GAAG,EAAE;YACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,KAAK,KAAK,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,0BAA0B;IAC1B,2EAA2E;IAE3E;;;OAGG;IACH,MAAM,CAAC,OAAU;QACf,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IAED,0FAA0F;IAClF,SAAS,CAAC,OAAU;QAC1B,qFAAqF;QACrF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YACzB,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC1B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mEAAmE;IAC3D,WAAW,CAAC,OAAU;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1B,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,OAAO;QACb,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAG,CAAC;YACrC,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAClC,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1B,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC;QAClD,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,2EAA2E;IAC3E,UAAU;IACV,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;QACzB,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;QAClC,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAC/C,CAAC;QAED,2FAA2F;QAC3F,gGAAgG;QAChG,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,MAAM,MAAM,GAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC;YACtC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;oBACjC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC3C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;wBACjB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBAChC,CAAC;oBACD,MAAM,CAAC,IAAI,KAAK,CAAC,sBAAsB,SAAS,IAAI,CAAC,CAAC,CAAC;gBACzD,CAAC,EAAE,SAAS,CAAC,CAAC;YAChB,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;IAC5E,CAAC;IAED,2EAA2E;IAC3E,uBAAuB;IACvB,2EAA2E;IAE3E;;;OAGG;IACH,KAAK;QACH,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAEtB,6BAA6B;QAC7B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAElB,mCAAmC;QACnC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBACzB,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC,CAAC;YACpD,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC,CAAC;YACrD,CAAC;YACD,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,uFAAuF;QACvF,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACrC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1B,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,IAAI,CAAC,OAAO,CAAC;YACrB,CAAC;iBAAM,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC1B,MAAM;YACR,CAAC;iBAAM,CAAC;gBACN,IAAI,OAAU,CAAC;gBACf,IAAI,CAAC;oBACH,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC9B,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,iDAAiD;oBACjD,IAAI,IAAI,CAAC,SAAS;wBAAE,MAAM;oBAC1B,MAAM,KAAK,CAAC;gBACd,CAAC;gBACD,MAAM,OAAO,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,qFAAqF;IAC7E,WAAW;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAG,CAAC;YACrC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACjC,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IAEO,YAAY,CAAC,QAAuB;QAC1C,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YACvB,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E;;OAEG;IACH,QAAQ;QAUN,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YACnC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;YACjC,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;SAC1C,CAAC;IACJ,CAAC;IAED,QAAQ;QACN,OAAO,mBAAmB,IAAI,CAAC,IAAI,cAAc,IAAI,CAAC,QAAQ,YAAY,IAAI,CAAC,SAAS,GAAG,CAAC;IAC9F,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAI,OAA2B;IACvD,OAAO,IAAI,UAAU,CAAI,OAAO,CAAC,CAAC;AACpC,CAAC"}