@procedures/client 0.2.0 → 0.2.1

package/dist/client/middleware/batching.js

@@ -1,245 +0,0 @@
-/**
- * Batching Middleware
- *
- * Combines multiple requests into a single batch for efficiency.
- * Reduces network overhead and improves throughput.
- *
- * Works with both client and server!
- */
-/**
- * Batch queue for collecting requests.
- */
-class BatchQueue {
-    options;
-    processBatch;
-    requests = new Map();
-    timers = new Map();
-    stats = {
-        totalRequests: 0,
-        totalBatches: 0,
-    };
-    constructor(options, processBatch) {
-        this.options = options;
-        this.processBatch = processBatch;
-    }
-    /**
-     * Add request to batch queue.
-     */
-    add(key, request) {
-        this.stats.totalRequests++;
-        // Get or create batch for this key
-        let batch = this.requests.get(key);
-        if (!batch) {
-            batch = [];
-            this.requests.set(key, batch);
-        }
-        batch.push(request);
-        // Check if batch is full
-        if (batch.length >= this.options.maxBatchSize) {
-            this.flush(key);
-        }
-        else if (batch.length === 1) {
-            // First request in batch - start timer
-            this.startTimer(key);
-        }
-    }
-    /**
-     * Start timer for batch.
-     */
-    startTimer(key) {
-        const timer = setTimeout(() => {
-            this.flush(key);
-        }, this.options.maxWaitTime);
-        this.timers.set(key, timer);
-    }
-    /**
-     * Flush batch (send it).
-     */
-    flush(key) {
-        const batch = this.requests.get(key);
-        if (!batch || batch.length === 0) {
-            return;
-        }
-        // Clear timer
-        const timer = this.timers.get(key);
-        if (timer) {
-            clearTimeout(timer);
-            this.timers.delete(key);
-        }
-        // Remove from queue
-        this.requests.delete(key);
-        // Update stats
-        this.stats.totalBatches++;
-        // Notify callback
-        if (this.options.onBatchSent) {
-            this.options.onBatchSent(batch.length, key);
-        }
-        // Process batch
-        this.processBatch(key, batch);
-    }
-    /**
-     * Get statistics.
-     */
-    getStats() {
-        let pendingRequests = 0;
-        for (const batch of this.requests.values()) {
-            pendingRequests += batch.length;
-        }
-        const averageBatchSize = this.stats.totalBatches > 0
-            ? this.stats.totalRequests / this.stats.totalBatches
-            : 0;
-        return {
-            totalRequests: this.stats.totalRequests,
-            totalBatches: this.stats.totalBatches,
-            averageBatchSize,
-            pendingRequests,
-        };
-    }
-}
-/**
- * Create batching middleware.
- *
- * Automatically combines multiple requests into batches for efficiency.
- *
- * @param options - Batching configuration
- * @returns Middleware function
- *
- * @example
- * ```typescript
- * client.use(createBatchingMiddleware({
- *   maxBatchSize: 10,      // Combine up to 10 requests
- *   maxWaitTime: 10,       // Wait max 10ms before sending
- *   sameServiceOnly: true  // Only batch requests to same service
- * }));
- * ```
- *
- * @example
- * ```typescript
- * // Custom batching by operation
- * client.use(createBatchingMiddleware({
- *   getBatchKey: (msg) => `${msg.method.service}:${msg.method.operation}`
- * }));
- * ```
- */
-export function createBatchingMiddleware(options = {}) {
-    const sameServiceOnly = options.sameServiceOnly ?? true;
-    const opts = {
-        maxBatchSize: options.maxBatchSize ?? 10,
-        maxWaitTime: options.maxWaitTime ?? 10,
-        sameServiceOnly,
-        getBatchKey: options.getBatchKey ??
-            ((msg) => sameServiceOnly
-                ? msg.method.service
-                : "__all__"),
-        ...(options.onBatchSent !== undefined && { onBatchSent: options.onBatchSent }),
-    };
-    /**
-     * Process a batch of requests.
-     */
-    async function processBatch(_key, requests) {
-        // Note: This is a simplified implementation.
-        // In practice, you'd need transport-level support for batching.
-        // The transport would need to:
-        // 1. Accept multiple messages
-        // 2. Send them in a single network request
-        // 3. Return multiple responses
-        // 4. Match responses to requests by ID
-        // For now, we execute requests individually
-        // Real batching requires transport cooperation
-        for (const request of requests) {
-            try {
-                const response = request.next(request.context);
-                request.resolve(response);
-            }
-            catch (error) {
-                request.reject(error);
-            }
-        }
-    }
-    // Create shared batch queue
-    const queue = new BatchQueue(opts, processBatch);
-    return (next) => {
-        return async function* (context) {
-            // Get batch key for this request
-            const key = opts.getBatchKey(context.message);
-            // Create promise for batched response
-            const responsePromise = new Promise((resolve, reject) => {
-                queue.add(key, {
-                    context,
-                    next: next,
-                    resolve: resolve,
-                    reject,
-                });
-            });
-            // Wait for batch to complete and yield response
-            const response = await responsePromise;
-            yield* response;
-        };
-    };
-}
-/**
- * Get batching statistics.
- *
- * Note: This is a placeholder - proper implementation would
- * require exposing the queue through the middleware instance.
- */
-export function getBatchingStats(_middleware) {
-    return null;
-}
-/**
- * Create adaptive batching middleware.
- *
- * Automatically adjusts batch size based on request patterns.
- *
- * @example
- * ```typescript
- * client.use(createAdaptiveBatchingMiddleware({
- *   minBatchSize: 2,
- *   maxBatchSize: 50,
- *   targetLatency: 20  // Target 20ms latency
- * }));
- * ```
- */
-export function createAdaptiveBatchingMiddleware(options = {}) {
-    const { minBatchSize = 2, maxBatchSize = 50, targetLatency = 20, } = options;
-    let currentBatchSize = minBatchSize;
-    let recentLatencies = [];
-    /**
-     * Adjust batch size based on latency.
-     */
-    function adjustBatchSize() {
-        if (recentLatencies.length < 5) {
-            return;
-        }
-        const avgLatency = recentLatencies.reduce((sum, l) => sum + l, 0) / recentLatencies.length;
-        if (avgLatency > targetLatency && currentBatchSize > minBatchSize) {
-            // Too slow - reduce batch size
-            currentBatchSize = Math.max(minBatchSize, currentBatchSize - 1);
-        }
-        else if (avgLatency < targetLatency * 0.5 && currentBatchSize < maxBatchSize) {
-            // Too fast - increase batch size
-            currentBatchSize = Math.min(maxBatchSize, currentBatchSize + 1);
-        }
-        // Keep only recent latencies
-        recentLatencies = recentLatencies.slice(-10);
-    }
-    return (next) => {
-        const batchingMiddleware = createBatchingMiddleware({
-            maxBatchSize: currentBatchSize,
-            maxWaitTime: targetLatency,
-        });
-        return async function* (context) {
-            const start = Date.now();
-            try {
-                const batchedNext = batchingMiddleware(next);
-                yield* batchedNext(context);
-            }
-            finally {
-                const latency = Date.now() - start;
-                recentLatencies.push(latency);
-                adjustBatchSize();
-            }
-        };
-    };
-}
-//# sourceMappingURL=batching.js.map

package/dist/client/middleware/batching.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"batching.js","sourceRoot":"","sources":["../../../src/client/middleware/batching.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AA4DH;;GAEG;AACH,MAAM,UAAU;IASJ;IAOA;IAfF,QAAQ,GAAkC,IAAI,GAAG,EAAE,CAAC;IACpD,MAAM,GAA+C,IAAI,GAAG,EAAE,CAAC;IAC/D,KAAK,GAAG;QACd,aAAa,EAAE,CAAC;QAChB,YAAY,EAAE,CAAC;KAChB,CAAC;IAEF,YACU,OAMP,EACO,YAA+D;QAP/D,YAAO,GAAP,OAAO,CAMd;QACO,iBAAY,GAAZ,YAAY,CAAmD;IACtE,CAAC;IAEJ;;OAEG;IACH,GAAG,CACD,GAAW,EACX,OAAmC;QAEnC,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAE3B,mCAAmC;QACnC,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,CAAC;YACX,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,OAAyB,CAAC,CAAC;QAEtC,yBAAyB;QACzB,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,uCAAuC;YACvC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,GAAW;QAC5B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAE7B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,GAAW;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO;QACT,CAAC;QAED,cAAc;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,KAAK,EAAE,CAAC;YACV,YAAY,CAAC,KAAK,CAAC,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAE1B,eAAe;QACf,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QAE1B,kBAAkB;QAClB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC9C,CAAC;QAED,gBAAgB;QAChB,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,eAAe,IAAI,KAAK,CAAC,MAAM,CAAC;QAClC,CAAC;QAED,MAAM,gBAAgB,GACpB,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY;YACpD,CAAC,CAAC,CAAC,CAAC;QAER,OAAO;YACL,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;YACvC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY;YACrC,gBAAgB;YAChB,eAAe;SAChB,CAAC;IACJ,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,wBAAwB,CACtC,UAA2B,EAAE;IAE7B,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,IAAI,CAAC;IACxD,MAAM,IAAI,GAAG;QACX,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,EAAE;QACxC,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,EAAE;QACtC,eAAe;QACf,WAAW,EACT,OAAO,CAAC,WAAW;YACnB,CAAC,CAAC,GAAG,EAAE,EAAE,CACP,eAAe;gBACb,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO;gBACpB,CAAC,CAAC,SAAS,CAAC;QAClB,GAAG,CAAC,OAAO,CAAC,WAAW,KAAK,SAAS,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC;KAC/E,CAAC;IAEF;;OAEG;IACH,KAAK,UAAU,YAAY,CAAC,IAAY,EAAE,QAA0B;QAClE,6CAA6C;QAC7C,gEAAgE;QAChE,+BAA+B;QAC/B,8BAA8B;QAC9B,2CAA2C;QAC3C,+BAA+B;QAC/B,uCAAuC;QAEvC,4CAA4C;QAC5C,+CAA+C;QAC/C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC/C,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,MAAM,CAAC,KAAc,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAEjD,OAAO,CAAa,IAA8B,EAA4B,EAAE;QAC9E,OAAO,KAAK,SAAS,CAAC,EAAE,OAA4B;YAClD,iCAAiC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAE9C,sCAAsC;YACtC,MAAM,eAAe,GAAG,IAAI,OAAO,CACjC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAClB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;oBACb,OAAO;oBACP,IAAI,EAAE,IAAsC;oBAC5C,OAAO,EAAE,OAAmE;oBAC5E,MAAM;iBACP,CAAC,CAAC;YACL,CAAC,CACF,CAAC;YAEF,gDAAgD;YAChD,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC;YACvC,KAAK,CAAC,CAAC,QAAQ,CAAC;QAClB,CAAC,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,WAA6B;IAE7B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,gCAAgC,CAAC,UAI7C,EAAE;IACJ,MAAM,EACJ,YAAY,GAAG,CAAC,EAChB,YAAY,GAAG,EAAE,EACjB,aAAa,GAAG,EAAE,GACnB,GAAG,OAAO,CAAC;IAEZ,IAAI,gBAAgB,GAAG,YAAY,CAAC;IACpC,IAAI,eAAe,GAAa,EAAE,CAAC;IAEnC;;OAEG;IACH,SAAS,eAAe;QACtB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,OAAO;QACT,CAAC;QAED,MAAM,UAAU,GACd,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC;QAE1E,IAAI,UAAU,GAAG,aAAa,IAAI,gBAAgB,GAAG,YAAY,EAAE,CAAC;YAClE,+BAA+B;YAC/B,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;aAAM,IAAI,UAAU,GAAG,aAAa,GAAG,GAAG,IAAI,gBAAgB,GAAG,YAAY,EAAE,CAAC;YAC/E,iCAAiC;YACjC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,6BAA6B;QAC7B,eAAe,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,CAAa,IAA8B,EAA4B,EAAE;QAC9E,MAAM,kBAAkB,GAAG,wBAAwB,CAAC;YAClD,YAAY,EAAE,gBAAgB;YAC9B,WAAW,EAAE,aAAa;SAC3B,CAAiC,CAAC;QAEnC,OAAO,KAAK,SAAS,CAAC,EAAE,OAA4B;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAEzB,IAAI,CAAC;gBACH,MAAM,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;gBAC7C,KAAK,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;oBAAS,CAAC;gBACT,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;gBACnC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC9B,eAAe,EAAE,CAAC;YACpB,CAAC;QACH,CAAC,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC"}

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

@@ -1,144 +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;
-    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.
-     *
-     * @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>;
-    /**
-     * Attempts to add an element without waiting.
-     * Returns false if queue is full.
-     */
-    tryPut(element: T): boolean;
-    /**
-     * Attempts to remove an element without waiting.
-     * Returns undefined if queue is empty.
-     */
-    tryTake(): T | undefined;
-    /**
-     * 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>;
-    private fulfillPutter;
-    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/collections/async/async-queue.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-queue.d.ts","sourceRoot":"","sources":["../../../src/collections/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;AAWD;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,WAAW,CAAC,CAAC,CAAC;IAClD,OAAO,CAAC,MAAM,CAAW;IACzB,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,MAAM,CAAqB;IACnC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAS;gBAE7B,OAAO,GAAE,iBAAsB;IAW3C,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;;;;;;OAMG;IACG,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqDtD;;;;;;OAMG;IACG,IAAI,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IAqDxC;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAiB3B;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS;IAcxB;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC;IAexB;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS;IAQxB;;;OAGG;IACH,KAAK,IAAI,IAAI;IAoBb;;;OAGG;IACH,KAAK,IAAI,CAAC,EAAE;IAgBZ;;;OAGG;IACI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC;IAsBjD,OAAO,CAAC,aAAa;IAQrB,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;IAaD,QAAQ,IAAI,MAAM;CAGnB;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,UAAU,CAAC,CAAC,CAAC,CAExE"}