@dotdo/postgres 0.1.0

package/dist/streaming/buffer-pool.d.ts

@@ -0,0 +1,241 @@
+/**
+ * BufferPool - Shared buffer management utilities for streaming
+ *
+ * Provides reusable buffer pools and memory estimation utilities
+ * to reduce allocations in hot paths across streaming modules.
+ *
+ * @module streaming/buffer-pool
+ */
+/**
+ * Configuration for BufferPool
+ */
+export interface BufferPoolConfig {
+    /** Initial pool size (default: 16) */
+    initialSize?: number;
+    /** Maximum pool size (default: 1024) */
+    maxSize?: number;
+    /** Item factory function */
+    factory?: () => unknown;
+}
+/**
+ * Statistics for buffer pool monitoring
+ */
+export interface BufferPoolStats {
+    /** Current number of items in the pool */
+    poolSize: number;
+    /** Total items acquired from the pool */
+    acquired: number;
+    /** Total items returned to the pool */
+    released: number;
+    /** Items created when pool was empty */
+    misses: number;
+    /** Hit rate (percentage of acquisitions from pool) */
+    hitRate: number;
+}
+/** Base overhead for object allocation in V8 */
+export declare const OBJECT_BASE_OVERHEAD = 64;
+/** Bytes per character in a string (UTF-16) */
+export declare const BYTES_PER_CHAR = 2;
+/** Overhead for string header */
+export declare const STRING_HEADER_OVERHEAD = 24;
+/** Base overhead for array allocation */
+export declare const ARRAY_BASE_OVERHEAD = 24;
+/** Bytes per array element (pointer) */
+export declare const ARRAY_ELEMENT_OVERHEAD = 8;
+/**
+ * Fast size estimator that avoids JSON.stringify overhead.
+ * Uses heuristic-based estimation for better hot path performance.
+ *
+ * @param item - Item to estimate size for
+ * @param maxDepth - Maximum recursion depth (default: 10)
+ * @returns Estimated size in bytes
+ */
+export declare function estimateSize(item: unknown, maxDepth?: number): number;
+/**
+ * Estimate memory usage for an array of rows using fast heuristics.
+ *
+ * @param rows - Array of row objects
+ * @returns Estimated memory usage in bytes
+ */
+export declare function estimateRowsSize<T>(rows: T[]): number;
+/**
+ * Generic object pool for reducing allocations in hot paths.
+ *
+ * Pre-allocates objects and reuses them to avoid garbage collection overhead.
+ * Useful for frequently created/destroyed objects like buffer wrappers.
+ *
+ * @example
+ * ```typescript
+ * const pool = new BufferPool<{ data: string; processed: boolean }>({
+ *   factory: () => ({ data: '', processed: false }),
+ *   initialSize: 32,
+ * })
+ *
+ * // Acquire from pool (reuses existing object if available)
+ * const item = pool.acquire()
+ * item.data = 'some data'
+ * item.processed = false
+ *
+ * // Return to pool when done
+ * pool.release(item)
+ * ```
+ */
+export declare class BufferPool<T> {
+    private pool;
+    private readonly factory;
+    private readonly maxSize;
+    private acquired;
+    private released;
+    private misses;
+    constructor(config?: BufferPoolConfig);
+    /**
+     * Acquire an item from the pool.
+     * Creates a new one if the pool is empty.
+     */
+    acquire(): T;
+    /**
+     * Return an item to the pool for reuse.
+     * Item is discarded if pool is at max capacity.
+     */
+    release(item: T): void;
+    /**
+     * Clear all items from the pool.
+     */
+    clear(): void;
+    /**
+     * Get pool statistics.
+     */
+    getStats(): BufferPoolStats;
+    /**
+     * Reset statistics.
+     */
+    resetStats(): void;
+}
+/**
+ * Configuration for RingBuffer
+ */
+export interface RingBufferConfig {
+    /** Maximum capacity (default: 1024) */
+    capacity?: number;
+}
+/**
+ * RingBuffer provides O(1) push/shift operations for fixed-size queues.
+ *
+ * More efficient than Array.shift() which is O(n) for large arrays.
+ * Ideal for backpressure buffers with known maximum size.
+ *
+ * @example
+ * ```typescript
+ * const buffer = new RingBuffer<number>({ capacity: 100 })
+ *
+ * buffer.push(1)
+ * buffer.push(2)
+ * console.log(buffer.shift()) // 1
+ * console.log(buffer.shift()) // 2
+ * ```
+ */
+export declare class RingBuffer<T> {
+    private readonly items;
+    private readonly capacity;
+    private head;
+    private tail;
+    private count;
+    constructor(config?: RingBufferConfig);
+    /**
+     * Current number of items in the buffer.
+     */
+    get length(): number;
+    /**
+     * Check if buffer is empty.
+     */
+    get isEmpty(): boolean;
+    /**
+     * Check if buffer is full.
+     */
+    get isFull(): boolean;
+    /**
+     * Push an item to the end of the buffer.
+     * Returns false if buffer is full.
+     */
+    push(item: T): boolean;
+    /**
+     * Remove and return the first item from the buffer.
+     * Returns undefined if buffer is empty.
+     */
+    shift(): T | undefined;
+    /**
+     * Peek at the first item without removing it.
+     */
+    peek(): T | undefined;
+    /**
+     * Clear all items from the buffer.
+     */
+    clear(): void;
+    /**
+     * Convert buffer contents to an array.
+     */
+    toArray(): T[];
+}
+/**
+ * Configuration for BatchAccumulator
+ */
+export interface BatchAccumulatorConfig {
+    /** Batch size (default: 100) */
+    batchSize?: number;
+    /** Flush callback */
+    onFlush?: (batch: unknown[]) => void | Promise<void>;
+}
+/**
+ * BatchAccumulator collects items and flushes them in batches.
+ *
+ * Useful for efficient batch processing in streaming scenarios.
+ *
+ * @example
+ * ```typescript
+ * const accumulator = new BatchAccumulator<Row>({
+ *   batchSize: 100,
+ *   onFlush: async (batch) => {
+ *     await bulkInsert(batch)
+ *   },
+ * })
+ *
+ * for await (const row of stream) {
+ *   await accumulator.add(row)
+ * }
+ * await accumulator.flush() // Flush remaining items
+ * ```
+ */
+export declare class BatchAccumulator<T> {
+    private batch;
+    private readonly batchSize;
+    private readonly onFlush;
+    private totalFlushed;
+    constructor(config?: BatchAccumulatorConfig);
+    /**
+     * Current number of items in the batch.
+     */
+    get length(): number;
+    /**
+     * Total number of items that have been flushed.
+     */
+    get flushedCount(): number;
+    /**
+     * Add an item to the batch.
+     * Automatically flushes when batch size is reached.
+     */
+    add(item: T): Promise<void>;
+    /**
+     * Flush the current batch.
+     * Does nothing if batch is empty.
+     */
+    flush(): Promise<void>;
+    /**
+     * Clear the batch without flushing.
+     */
+    clear(): void;
+    /**
+     * Reset statistics.
+     */
+    resetStats(): void;
+}
+//# sourceMappingURL=buffer-pool.d.ts.map

package/dist/streaming/buffer-pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffer-pool.d.ts","sourceRoot":"","sources":["../../src/streaming/buffer-pool.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sCAAsC;IACtC,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,4BAA4B;IAC5B,OAAO,CAAC,EAAE,MAAM,OAAO,CAAA;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,0CAA0C;IAC1C,QAAQ,EAAE,MAAM,CAAA;IAChB,yCAAyC;IACzC,QAAQ,EAAE,MAAM,CAAA;IAChB,uCAAuC;IACvC,QAAQ,EAAE,MAAM,CAAA;IAChB,wCAAwC;IACxC,MAAM,EAAE,MAAM,CAAA;IACd,sDAAsD;IACtD,OAAO,EAAE,MAAM,CAAA;CAChB;AAMD,gDAAgD;AAChD,eAAO,MAAM,oBAAoB,KAAK,CAAA;AACtC,+CAA+C;AAC/C,eAAO,MAAM,cAAc,IAAI,CAAA;AAC/B,iCAAiC;AACjC,eAAO,MAAM,sBAAsB,KAAK,CAAA;AACxC,yCAAyC;AACzC,eAAO,MAAM,mBAAmB,KAAK,CAAA;AACrC,wCAAwC;AACxC,eAAO,MAAM,sBAAsB,IAAI,CAAA;AAMvC;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,GAAE,MAAW,GAAG,MAAM,CAEzE;AAuED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,MAAM,CAQrD;AAMD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,UAAU,CAAC,CAAC;IACvB,OAAO,CAAC,IAAI,CAAU;IACtB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAQ;IAChC,OAAO,CAAC,QAAQ,CAAI;IACpB,OAAO,CAAC,QAAQ,CAAI;IACpB,OAAO,CAAC,MAAM,CAAI;gBAEN,MAAM,GAAE,gBAAqB;IAWzC;;;OAGG;IACH,OAAO,IAAI,CAAC;IASZ;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI;IAOtB;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,QAAQ,IAAI,eAAe;IAa3B;;OAEG;IACH,UAAU,IAAI,IAAI;CAKnB;AAMD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,uCAAuC;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,UAAU,CAAC,CAAC;IACvB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmB;IACzC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IACjC,OAAO,CAAC,IAAI,CAAI;IAChB,OAAO,CAAC,IAAI,CAAI;IAChB,OAAO,CAAC,KAAK,CAAI;gBAEL,MAAM,GAAE,gBAAqB;IAKzC;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,OAAO,CAErB;IAED;;OAEG;IACH,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED;;;OAGG;IACH,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO;IAWtB;;;OAGG;IACH,KAAK,IAAI,CAAC,GAAG,SAAS;IAYtB;;OAEG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAOrB;;OAEG;IACH,KAAK,IAAI,IAAI;IASb;;OAEG;IACH,OAAO,IAAI,CAAC,EAAE;CASf;AAMD;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,gCAAgC;IAChC,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,qBAAqB;IACrB,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;CACrD;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,gBAAgB,CAAC,CAAC;IAC7B,OAAO,CAAC,KAAK,CAAU;IACvB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAQ;IAClC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAsC;IAC9D,OAAO,CAAC,YAAY,CAAI;gBAEZ,MAAM,GAAE,sBAA2B;IAK/C;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;OAEG;IACH,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED;;;OAGG;IACG,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAOjC;;;OAGG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAS5B;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,UAAU,IAAI,IAAI;CAGnB"}

package/dist/streaming/buffer-pool.js

@@ -0,0 +1,381 @@
+/**
+ * BufferPool - Shared buffer management utilities for streaming
+ *
+ * Provides reusable buffer pools and memory estimation utilities
+ * to reduce allocations in hot paths across streaming modules.
+ *
+ * @module streaming/buffer-pool
+ */
+// ============================================================================
+// Size Estimation Constants
+// ============================================================================
+/** Base overhead for object allocation in V8 */
+export const OBJECT_BASE_OVERHEAD = 64;
+/** Bytes per character in a string (UTF-16) */
+export const BYTES_PER_CHAR = 2;
+/** Overhead for string header */
+export const STRING_HEADER_OVERHEAD = 24;
+/** Base overhead for array allocation */
+export const ARRAY_BASE_OVERHEAD = 24;
+/** Bytes per array element (pointer) */
+export const ARRAY_ELEMENT_OVERHEAD = 8;
+// ============================================================================
+// Size Estimation Utilities
+// ============================================================================
+/**
+ * Fast size estimator that avoids JSON.stringify overhead.
+ * Uses heuristic-based estimation for better hot path performance.
+ *
+ * @param item - Item to estimate size for
+ * @param maxDepth - Maximum recursion depth (default: 10)
+ * @returns Estimated size in bytes
+ */
+export function estimateSize(item, maxDepth = 10) {
+    return estimateSizeRecursive(item, 0, maxDepth);
+}
+function estimateSizeRecursive(item, depth, maxDepth) {
+    // Prevent stack overflow on deeply nested objects
+    if (depth > maxDepth) {
+        return 1024;
+    }
+    if (item === null || item === undefined) {
+        return 8;
+    }
+    const type = typeof item;
+    if (type === 'string') {
+        return item.length * BYTES_PER_CHAR + STRING_HEADER_OVERHEAD;
+    }
+    if (type === 'number') {
+        return 8;
+    }
+    if (type === 'boolean') {
+        return 4;
+    }
+    if (type === 'bigint') {
+        return 16;
+    }
+    if (Array.isArray(item)) {
+        let size = ARRAY_BASE_OVERHEAD + item.length * ARRAY_ELEMENT_OVERHEAD;
+        for (let i = 0; i < item.length; i++) {
+            size += estimateSizeRecursive(item[i], depth + 1, maxDepth);
+        }
+        return size;
+    }
+    if (type === 'object') {
+        // Handle special types
+        if (item instanceof Date) {
+            return 24;
+        }
+        if (item instanceof ArrayBuffer) {
+            return item.byteLength + 16;
+        }
+        if (ArrayBuffer.isView(item)) {
+            return item.byteLength + 16;
+        }
+        // Regular object - estimate keys and values
+        let size = OBJECT_BASE_OVERHEAD;
+        try {
+            const obj = item;
+            const keys = Object.keys(obj);
+            for (let i = 0; i < keys.length; i++) {
+                const key = keys[i];
+                size += key.length * BYTES_PER_CHAR + STRING_HEADER_OVERHEAD;
+                size += estimateSizeRecursive(obj[key], depth + 1, maxDepth);
+            }
+        }
+        catch {
+            // Fallback for objects that throw on property access
+            return 1024;
+        }
+        return size;
+    }
+    // Function or Symbol - minimal estimate
+    return 64;
+}
+/**
+ * Estimate memory usage for an array of rows using fast heuristics.
+ *
+ * @param rows - Array of row objects
+ * @returns Estimated memory usage in bytes
+ */
+export function estimateRowsSize(rows) {
+    if (rows.length === 0)
+        return 0;
+    let total = ARRAY_BASE_OVERHEAD + rows.length * ARRAY_ELEMENT_OVERHEAD;
+    for (let i = 0; i < rows.length; i++) {
+        total += estimateSize(rows[i]);
+    }
+    return total;
+}
+// ============================================================================
+// BufferPool Class
+// ============================================================================
+/**
+ * Generic object pool for reducing allocations in hot paths.
+ *
+ * Pre-allocates objects and reuses them to avoid garbage collection overhead.
+ * Useful for frequently created/destroyed objects like buffer wrappers.
+ *
+ * @example
+ * ```typescript
+ * const pool = new BufferPool<{ data: string; processed: boolean }>({
+ *   factory: () => ({ data: '', processed: false }),
+ *   initialSize: 32,
+ * })
+ *
+ * // Acquire from pool (reuses existing object if available)
+ * const item = pool.acquire()
+ * item.data = 'some data'
+ * item.processed = false
+ *
+ * // Return to pool when done
+ * pool.release(item)
+ * ```
+ */
+export class BufferPool {
+    pool = [];
+    factory;
+    maxSize;
+    acquired = 0;
+    released = 0;
+    misses = 0;
+    constructor(config = {}) {
+        this.factory = config.factory ?? (() => ({}));
+        this.maxSize = config.maxSize ?? 1024;
+        // Pre-populate pool
+        const initialSize = config.initialSize ?? 16;
+        for (let i = 0; i < initialSize; i++) {
+            this.pool.push(this.factory());
+        }
+    }
+    /**
+     * Acquire an item from the pool.
+     * Creates a new one if the pool is empty.
+     */
+    acquire() {
+        this.acquired++;
+        if (this.pool.length > 0) {
+            return this.pool.pop();
+        }
+        this.misses++;
+        return this.factory();
+    }
+    /**
+     * Return an item to the pool for reuse.
+     * Item is discarded if pool is at max capacity.
+     */
+    release(item) {
+        this.released++;
+        if (this.pool.length < this.maxSize) {
+            this.pool.push(item);
+        }
+    }
+    /**
+     * Clear all items from the pool.
+     */
+    clear() {
+        this.pool = [];
+    }
+    /**
+     * Get pool statistics.
+     */
+    getStats() {
+        const hitRate = this.acquired > 0 ? Math.round(((this.acquired - this.misses) / this.acquired) * 100) : 100;
+        return {
+            poolSize: this.pool.length,
+            acquired: this.acquired,
+            released: this.released,
+            misses: this.misses,
+            hitRate,
+        };
+    }
+    /**
+     * Reset statistics.
+     */
+    resetStats() {
+        this.acquired = 0;
+        this.released = 0;
+        this.misses = 0;
+    }
+}
+/**
+ * RingBuffer provides O(1) push/shift operations for fixed-size queues.
+ *
+ * More efficient than Array.shift() which is O(n) for large arrays.
+ * Ideal for backpressure buffers with known maximum size.
+ *
+ * @example
+ * ```typescript
+ * const buffer = new RingBuffer<number>({ capacity: 100 })
+ *
+ * buffer.push(1)
+ * buffer.push(2)
+ * console.log(buffer.shift()) // 1
+ * console.log(buffer.shift()) // 2
+ * ```
+ */
+export class RingBuffer {
+    items;
+    capacity;
+    head = 0;
+    tail = 0;
+    count = 0;
+    constructor(config = {}) {
+        this.capacity = config.capacity ?? 1024;
+        this.items = new Array(this.capacity);
+    }
+    /**
+     * Current number of items in the buffer.
+     */
+    get length() {
+        return this.count;
+    }
+    /**
+     * Check if buffer is empty.
+     */
+    get isEmpty() {
+        return this.count === 0;
+    }
+    /**
+     * Check if buffer is full.
+     */
+    get isFull() {
+        return this.count === this.capacity;
+    }
+    /**
+     * Push an item to the end of the buffer.
+     * Returns false if buffer is full.
+     */
+    push(item) {
+        if (this.count === this.capacity) {
+            return false;
+        }
+        this.items[this.tail] = item;
+        this.tail = (this.tail + 1) % this.capacity;
+        this.count++;
+        return true;
+    }
+    /**
+     * Remove and return the first item from the buffer.
+     * Returns undefined if buffer is empty.
+     */
+    shift() {
+        if (this.count === 0) {
+            return undefined;
+        }
+        const item = this.items[this.head];
+        this.items[this.head] = undefined; // Allow GC
+        this.head = (this.head + 1) % this.capacity;
+        this.count--;
+        return item;
+    }
+    /**
+     * Peek at the first item without removing it.
+     */
+    peek() {
+        if (this.count === 0) {
+            return undefined;
+        }
+        return this.items[this.head];
+    }
+    /**
+     * Clear all items from the buffer.
+     */
+    clear() {
+        for (let i = 0; i < this.capacity; i++) {
+            this.items[i] = undefined;
+        }
+        this.head = 0;
+        this.tail = 0;
+        this.count = 0;
+    }
+    /**
+     * Convert buffer contents to an array.
+     */
+    toArray() {
+        const result = [];
+        let index = this.head;
+        for (let i = 0; i < this.count; i++) {
+            result.push(this.items[index]);
+            index = (index + 1) % this.capacity;
+        }
+        return result;
+    }
+}
+/**
+ * BatchAccumulator collects items and flushes them in batches.
+ *
+ * Useful for efficient batch processing in streaming scenarios.
+ *
+ * @example
+ * ```typescript
+ * const accumulator = new BatchAccumulator<Row>({
+ *   batchSize: 100,
+ *   onFlush: async (batch) => {
+ *     await bulkInsert(batch)
+ *   },
+ * })
+ *
+ * for await (const row of stream) {
+ *   await accumulator.add(row)
+ * }
+ * await accumulator.flush() // Flush remaining items
+ * ```
+ */
+export class BatchAccumulator {
+    batch = [];
+    batchSize;
+    onFlush;
+    totalFlushed = 0;
+    constructor(config = {}) {
+        this.batchSize = config.batchSize ?? 100;
+        this.onFlush = config.onFlush ?? (() => { });
+    }
+    /**
+     * Current number of items in the batch.
+     */
+    get length() {
+        return this.batch.length;
+    }
+    /**
+     * Total number of items that have been flushed.
+     */
+    get flushedCount() {
+        return this.totalFlushed;
+    }
+    /**
+     * Add an item to the batch.
+     * Automatically flushes when batch size is reached.
+     */
+    async add(item) {
+        this.batch.push(item);
+        if (this.batch.length >= this.batchSize) {
+            await this.flush();
+        }
+    }
+    /**
+     * Flush the current batch.
+     * Does nothing if batch is empty.
+     */
+    async flush() {
+        if (this.batch.length === 0)
+            return;
+        const toFlush = this.batch;
+        this.batch = [];
+        this.totalFlushed += toFlush.length;
+        await this.onFlush(toFlush);
+    }
+    /**
+     * Clear the batch without flushing.
+     */
+    clear() {
+        this.batch = [];
+    }
+    /**
+     * Reset statistics.
+     */
+    resetStats() {
+        this.totalFlushed = 0;
+    }
+}
+//# sourceMappingURL=buffer-pool.js.map

package/dist/streaming/buffer-pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffer-pool.js","sourceRoot":"","sources":["../../src/streaming/buffer-pool.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAkCH,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E,gDAAgD;AAChD,MAAM,CAAC,MAAM,oBAAoB,GAAG,EAAE,CAAA;AACtC,+CAA+C;AAC/C,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAA;AAC/B,iCAAiC;AACjC,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAA;AACxC,yCAAyC;AACzC,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAA;AACrC,wCAAwC;AACxC,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAA;AAEvC,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAa,EAAE,WAAmB,EAAE;IAC/D,OAAO,qBAAqB,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;AACjD,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAa,EAAE,KAAa,EAAE,QAAgB;IAC3E,kDAAkD;IAClD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;QACrB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACxC,OAAO,CAAC,CAAA;IACV,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,IAAI,CAAA;IAExB,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,OAAQ,IAAe,CAAC,MAAM,GAAG,cAAc,GAAG,sBAAsB,CAAA;IAC1E,CAAC;IAED,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,OAAO,CAAC,CAAA;IACV,CAAC;IAED,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,CAAC,CAAA;IACV,CAAC;IAED,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,OAAO,EAAE,CAAA;IACX,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,IAAI,GAAG,mBAAmB,GAAG,IAAI,CAAC,MAAM,GAAG,sBAAsB,CAAA;QACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAA;QAC7D,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,uBAAuB;QACvB,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;YACzB,OAAO,EAAE,CAAA;QACX,CAAC;QACD,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;YAChC,OAAQ,IAAoB,CAAC,UAAU,GAAG,EAAE,CAAA;QAC9C,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,OAAQ,IAAwB,CAAC,UAAU,GAAG,EAAE,CAAA;QAClD,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,GAAG,oBAAoB,CAAA;QAC/B,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAA+B,CAAA;YAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;gBACpB,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,cAAc,GAAG,sBAAsB,CAAA;gBAC5D,IAAI,IAAI,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAA;YAC9D,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,qDAAqD;YACrD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,wCAAwC;IACxC,OAAO,EAAE,CAAA;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAI,IAAS;IAC3C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAE/B,IAAI,KAAK,GAAG,mBAAmB,GAAG,IAAI,CAAC,MAAM,GAAG,sBAAsB,CAAA;IACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,UAAU;IACb,IAAI,GAAQ,EAAE,CAAA;IACL,OAAO,CAAS;IAChB,OAAO,CAAQ;IACxB,QAAQ,GAAG,CAAC,CAAA;IACZ,QAAQ,GAAG,CAAC,CAAA;IACZ,MAAM,GAAG,CAAC,CAAA;IAElB,YAAY,SAA2B,EAAE;QACvC,IAAI,CAAC,OAAO,GAAI,MAAM,CAAC,OAAmB,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAM,CAAC,CAAA;QAC/D,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI,CAAA;QAErC,oBAAoB;QACpB,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,EAAE,CAAA;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAA;QAChC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,IAAI,CAAC,QAAQ,EAAE,CAAA;QACf,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAA;QACzB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAA;QACb,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACvB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAO;QACb,IAAI,CAAC,QAAQ,EAAE,CAAA;QACf,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,EAAE,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,OAAO,GACX,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;QAE7F,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;YAC1B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,OAAO;SACR,CAAA;IACH,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;QACjB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACjB,CAAC;CACF;AAcD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,UAAU;IACJ,KAAK,CAAmB;IACxB,QAAQ,CAAQ;IACzB,IAAI,GAAG,CAAC,CAAA;IACR,IAAI,GAAG,CAAC,CAAA;IACR,KAAK,GAAG,CAAC,CAAA;IAEjB,YAAY,SAA2B,EAAE;QACvC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,IAAI,CAAA;QACvC,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACvC,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAA;IACzB,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAA;IACrC,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,IAAO;QACV,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;YACjC,OAAO,KAAK,CAAA;QACd,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;QAC5B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC3C,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAA,CAAC,WAAW;QAC7C,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC3C,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;QAC3B,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,MAAM,MAAM,GAAQ,EAAE,CAAA;QACtB,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAM,CAAC,CAAA;YACnC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;QACrC,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;CACF;AAgBD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,gBAAgB;IACnB,KAAK,GAAQ,EAAE,CAAA;IACN,SAAS,CAAQ;IACjB,OAAO,CAAsC;IACtD,YAAY,GAAG,CAAC,CAAA;IAExB,YAAY,SAAiC,EAAE;QAC7C,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,GAAG,CAAA;QACxC,IAAI,CAAC,OAAO,GAAI,MAAM,CAAC,OAAgD,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;IACvF,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,YAAY,CAAA;IAC1B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,CAAC,IAAO;QACf,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACrB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,IAAI,CAAC,KAAK,EAAE,CAAA;QACpB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QAEnC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAA;QAC1B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;QACf,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC,MAAM,CAAA;QACnC,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;IACjB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;IACvB,CAAC;CACF"}