@procedures/client 0.0.0-stage → 0.1.0

package/dist/collections/impl/array-deque.d.ts

@@ -0,0 +1,107 @@
+/**
+ * ArrayDeque implementation - A ring buffer backed double-ended queue.
+ *
+ * Provides O(1) insertion and removal at both ends.
+ * More efficient than ArrayList for queue/stack operations.
+ * Mirrors java.util.ArrayDeque.
+ *
+ * @example
+ * const deque = arrayDeque<number>()
+ * deque.addFirst(1)
+ * deque.addLast(2)
+ * deque.removeFirst() // 1
+ */
+import type { Deque } from "../interfaces/queue.js";
+import type { Eq } from "../core/traits.js";
+/**
+ * Options for creating an ArrayDeque.
+ */
+export interface ArrayDequeOptions<T> {
+    /**
+     * Initial capacity of the underlying array.
+     * Must be a power of 2 for efficient modulo operations.
+     * @default 16
+     */
+    initialCapacity?: number;
+    /**
+     * Equality function for comparing elements.
+     * @default defaultEq (===)
+     */
+    eq?: Eq<T>;
+}
+/**
+ * ArrayDeque<T> - Ring buffer implementation of Deque.
+ *
+ * Uses a circular array to provide O(1) operations at both ends.
+ * The array grows automatically when full.
+ *
+ * Not thread-safe. Use synchronized() behavior for concurrent access.
+ */
+export declare class ArrayDeque<T> implements Deque<T> {
+    private _elements;
+    private _head;
+    private _tail;
+    private readonly _eq;
+    constructor(options?: ArrayDequeOptions<T>);
+    get size(): number;
+    get isEmpty(): boolean;
+    get eq(): Eq<T>;
+    addFirst(element: T): void;
+    offerFirst(element: T): boolean;
+    removeFirst(): T;
+    pollFirst(): T | undefined;
+    peekFirst(): T;
+    peekFirstOrUndefined(): T | undefined;
+    addLast(element: T): void;
+    offerLast(element: T): boolean;
+    removeLast(): T;
+    pollLast(): T | undefined;
+    peekLast(): T;
+    peekLastOrUndefined(): T | undefined;
+    push(element: T): void;
+    pop(): T;
+    offer(element: T): boolean;
+    poll(): T;
+    peek(): T;
+    peekOrUndefined(): T | undefined;
+    pollOrUndefined(): T | undefined;
+    enqueue(element: T): boolean;
+    dequeue(): T;
+    add(element: T): boolean;
+    addAll(other: Iterable<T>): boolean;
+    contains(element: T): boolean;
+    containsAll(other: Iterable<T>): boolean;
+    remove(element: T): boolean;
+    removeAll(other: Iterable<T>): boolean;
+    retainAll(other: Iterable<T>): boolean;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    forEach(action: (element: T, index: number) => void): void;
+    toArray(): T[];
+    /**
+     * Doubles the capacity of the deque.
+     */
+    private grow;
+    /**
+     * Returns the next power of 2 >= n.
+     */
+    private nextPowerOfTwo;
+    /**
+     * Returns the current capacity of the underlying array.
+     */
+    get capacity(): number;
+    /**
+     * Returns a string representation for debugging.
+     */
+    toString(): string;
+}
+/**
+ * Factory function to create an ArrayDeque.
+ *
+ * @example
+ * const deque = arrayDeque<number>()
+ * const dequeFromArray = arrayDeque([1, 2, 3])
+ * const dequeWithOptions = arrayDeque<string>({ initialCapacity: 32 })
+ */
+export declare function arrayDeque<T>(optionsOrElements?: ArrayDequeOptions<T> | Iterable<T>): ArrayDeque<T>;
+//# sourceMappingURL=array-deque.d.ts.map

package/dist/collections/impl/array-deque.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-deque.d.ts","sourceRoot":"","sources":["../../../src/collections/impl/array-deque.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,mBAAmB,CAAC;AAG5C;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAClC;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACZ;AAED;;;;;;;GAOG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,KAAK,CAAC,CAAC,CAAC;IAC5C,OAAO,CAAC,SAAS,CAAoB;IACrC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;gBAEhB,OAAO,GAAE,iBAAiB,CAAC,CAAC,CAAM;IAc9C,IAAI,IAAI,IAAI,MAAM,CAGjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAMD,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI;IAQ1B,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAK/B,WAAW,IAAI,CAAC;IAOhB,SAAS,IAAI,CAAC,GAAG,SAAS;IAU1B,SAAS,IAAI,CAAC;IAOd,oBAAoB,IAAI,CAAC,GAAG,SAAS;IAQrC,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI;IAQzB,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAK9B,UAAU,IAAI,CAAC;IAOf,QAAQ,IAAI,CAAC,GAAG,SAAS;IAUzB,QAAQ,IAAI,CAAC;IAQb,mBAAmB,IAAI,CAAC,GAAG,SAAS;IAYpC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI;IAItB,GAAG,IAAI,CAAC;IAQR,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAI1B,IAAI,IAAI,CAAC;IAIT,IAAI,IAAI,CAAC;IAIT,eAAe,IAAI,CAAC,GAAG,SAAS;IAIhC,eAAe,IAAI,CAAC,GAAG,SAAS;IAIhC,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAI5B,OAAO,IAAI,CAAC;IAQZ,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAKxB,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IASnC,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAS7B,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IASxC,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IA6C3B,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAetC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAyBtC,KAAK,IAAI,IAAI;IAeZ,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAQjC,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAU1D,OAAO,IAAI,CAAC,EAAE;IAYd;;OAEG;IACH,OAAO,CAAC,IAAI;IA4BZ;;OAEG;IACH,OAAO,CAAC,cAAc;IAetB;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED;;OAEG;IACH,QAAQ,IAAI,MAAM;CAGnB;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,iBAAiB,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GACrD,UAAU,CAAC,CAAC,CAAC,CASf"}

package/dist/collections/impl/array-deque.js

@@ -0,0 +1,381 @@
+/**
+ * ArrayDeque implementation - A ring buffer backed double-ended queue.
+ *
+ * Provides O(1) insertion and removal at both ends.
+ * More efficient than ArrayList for queue/stack operations.
+ * Mirrors java.util.ArrayDeque.
+ *
+ * @example
+ * const deque = arrayDeque<number>()
+ * deque.addFirst(1)
+ * deque.addLast(2)
+ * deque.removeFirst() // 1
+ */
+import { defaultEq } from "../utils/defaults.js";
+/**
+ * ArrayDeque<T> - Ring buffer implementation of Deque.
+ *
+ * Uses a circular array to provide O(1) operations at both ends.
+ * The array grows automatically when full.
+ *
+ * Not thread-safe. Use synchronized() behavior for concurrent access.
+ */
+export class ArrayDeque {
+    _elements;
+    _head; // Index of first element
+    _tail; // Index where next element will be added
+    _eq;
+    constructor(options = {}) {
+        const { initialCapacity = 16, eq = defaultEq } = options;
+        // Ensure capacity is a power of 2 for efficient modulo using bitwise AND
+        const capacity = this.nextPowerOfTwo(Math.max(8, initialCapacity));
+        this._elements = new Array(capacity);
+        this._head = 0;
+        this._tail = 0;
+        this._eq = eq;
+    }
+    // ========================================================================
+    // Size
+    // ========================================================================
+    get size() {
+        // Handle wraparound: (tail - head) & mask
+        return (this._tail - this._head) & (this._elements.length - 1);
+    }
+    get isEmpty() {
+        return this._head === this._tail;
+    }
+    get eq() {
+        return this._eq;
+    }
+    // ========================================================================
+    // Front operations (head)
+    // ========================================================================
+    addFirst(element) {
+        this._head = (this._head - 1) & (this._elements.length - 1);
+        this._elements[this._head] = element;
+        if (this._head === this._tail) {
+            this.grow();
+        }
+    }
+    offerFirst(element) {
+        this.addFirst(element);
+        return true;
+    }
+    removeFirst() {
+        if (this.isEmpty) {
+            throw new Error("Deque is empty");
+        }
+        return this.pollFirst();
+    }
+    pollFirst() {
+        if (this.isEmpty) {
+            return undefined;
+        }
+        const element = this._elements[this._head];
+        this._elements[this._head] = undefined;
+        this._head = (this._head + 1) & (this._elements.length - 1);
+        return element;
+    }
+    peekFirst() {
+        if (this.isEmpty) {
+            throw new Error("Deque is empty");
+        }
+        return this._elements[this._head];
+    }
+    peekFirstOrUndefined() {
+        return this.isEmpty ? undefined : this._elements[this._head];
+    }
+    // ========================================================================
+    // Back operations (tail)
+    // ========================================================================
+    addLast(element) {
+        this._elements[this._tail] = element;
+        this._tail = (this._tail + 1) & (this._elements.length - 1);
+        if (this._tail === this._head) {
+            this.grow();
+        }
+    }
+    offerLast(element) {
+        this.addLast(element);
+        return true;
+    }
+    removeLast() {
+        if (this.isEmpty) {
+            throw new Error("Deque is empty");
+        }
+        return this.pollLast();
+    }
+    pollLast() {
+        if (this.isEmpty) {
+            return undefined;
+        }
+        this._tail = (this._tail - 1) & (this._elements.length - 1);
+        const element = this._elements[this._tail];
+        this._elements[this._tail] = undefined;
+        return element;
+    }
+    peekLast() {
+        if (this.isEmpty) {
+            throw new Error("Deque is empty");
+        }
+        const lastIndex = (this._tail - 1) & (this._elements.length - 1);
+        return this._elements[lastIndex];
+    }
+    peekLastOrUndefined() {
+        if (this.isEmpty) {
+            return undefined;
+        }
+        const lastIndex = (this._tail - 1) & (this._elements.length - 1);
+        return this._elements[lastIndex];
+    }
+    // ========================================================================
+    // Stack operations (LIFO - use first end)
+    // ========================================================================
+    push(element) {
+        this.addFirst(element);
+    }
+    pop() {
+        return this.removeFirst();
+    }
+    // ========================================================================
+    // Queue operations (FIFO - add last, remove first)
+    // ========================================================================
+    offer(element) {
+        return this.offerLast(element);
+    }
+    poll() {
+        return this.removeFirst();
+    }
+    peek() {
+        return this.peekFirst();
+    }
+    peekOrUndefined() {
+        return this.peekFirstOrUndefined();
+    }
+    pollOrUndefined() {
+        return this.pollFirst();
+    }
+    enqueue(element) {
+        return this.offer(element);
+    }
+    dequeue() {
+        return this.poll();
+    }
+    // ========================================================================
+    // Collection operations
+    // ========================================================================
+    add(element) {
+        this.addLast(element);
+        return true;
+    }
+    addAll(other) {
+        let modified = false;
+        for (const element of other) {
+            this.addLast(element);
+            modified = true;
+        }
+        return modified;
+    }
+    contains(element) {
+        for (const item of this) {
+            if (this._eq(item, element)) {
+                return true;
+            }
+        }
+        return false;
+    }
+    containsAll(other) {
+        for (const element of other) {
+            if (!this.contains(element)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    remove(element) {
+        // Linear search and remove first occurrence
+        let index = this._head;
+        let found = false;
+        for (let i = 0; i < this.size; i++) {
+            if (this._eq(this._elements[index], element)) {
+                found = true;
+                break;
+            }
+            index = (index + 1) & (this._elements.length - 1);
+        }
+        if (!found)
+            return false;
+        // Remove at index by shifting elements
+        const isCloserToHead = (index - this._head) &
+            (this._elements.length - 1 < this._tail - index ? 1 : 0) &
+            (this._elements.length - 1);
+        if (isCloserToHead) {
+            // Shift elements from head to index forward
+            while (index !== this._head) {
+                const prevIndex = (index - 1) & (this._elements.length - 1);
+                this._elements[index] = this._elements[prevIndex];
+                index = prevIndex;
+            }
+            this._elements[this._head] = undefined;
+            this._head = (this._head + 1) & (this._elements.length - 1);
+        }
+        else {
+            // Shift elements from index to tail backward
+            while (index !== this._tail) {
+                const nextIndex = (index + 1) & (this._elements.length - 1);
+                if (nextIndex === this._tail)
+                    break;
+                this._elements[index] = this._elements[nextIndex];
+                index = nextIndex;
+            }
+            this._tail = (this._tail - 1) & (this._elements.length - 1);
+            this._elements[this._tail] = undefined;
+        }
+        return true;
+    }
+    removeAll(other) {
+        const toRemove = new Set();
+        for (const element of other) {
+            toRemove.add(element);
+        }
+        let modified = false;
+        for (const element of toRemove) {
+            while (this.remove(element)) {
+                modified = true;
+            }
+        }
+        return modified;
+    }
+    retainAll(other) {
+        const toRetain = new Set(other);
+        const newDeque = new ArrayDeque({ eq: this._eq });
+        for (const element of this) {
+            let shouldRetain = false;
+            for (const retainElement of toRetain) {
+                if (this._eq(element, retainElement)) {
+                    shouldRetain = true;
+                    break;
+                }
+            }
+            if (shouldRetain) {
+                newDeque.addLast(element);
+            }
+        }
+        const modified = newDeque.size !== this.size;
+        this._elements = newDeque._elements;
+        this._head = newDeque._head;
+        this._tail = newDeque._tail;
+        return modified;
+    }
+    clear() {
+        // Clear all elements for GC
+        let index = this._head;
+        while (index !== this._tail) {
+            this._elements[index] = undefined;
+            index = (index + 1) & (this._elements.length - 1);
+        }
+        this._head = 0;
+        this._tail = 0;
+    }
+    // ========================================================================
+    // Iteration
+    // ========================================================================
+    *[Symbol.iterator]() {
+        let index = this._head;
+        while (index !== this._tail) {
+            yield this._elements[index];
+            index = (index + 1) & (this._elements.length - 1);
+        }
+    }
+    forEach(action) {
+        let arrayIndex = this._head;
+        let logicalIndex = 0;
+        while (arrayIndex !== this._tail) {
+            action(this._elements[arrayIndex], logicalIndex);
+            arrayIndex = (arrayIndex + 1) & (this._elements.length - 1);
+            logicalIndex++;
+        }
+    }
+    toArray() {
+        const result = [];
+        for (const element of this) {
+            result.push(element);
+        }
+        return result;
+    }
+    // ========================================================================
+    // Capacity management
+    // ========================================================================
+    /**
+     * Doubles the capacity of the deque.
+     */
+    grow() {
+        const oldCapacity = this._elements.length;
+        const newCapacity = oldCapacity << 1; // Double capacity
+        if (newCapacity < 0) {
+            throw new Error("Deque too large");
+        }
+        const newElements = new Array(newCapacity);
+        const size = this.size;
+        // Copy elements from head to end of old array
+        const rightSize = oldCapacity - this._head;
+        for (let i = 0; i < rightSize; i++) {
+            newElements[i] = this._elements[this._head + i];
+        }
+        // Copy wrapped elements from start of old array
+        const leftSize = this._head;
+        for (let i = 0; i < leftSize; i++) {
+            newElements[rightSize + i] = this._elements[i];
+        }
+        this._elements = newElements;
+        this._head = 0;
+        this._tail = size;
+    }
+    /**
+     * Returns the next power of 2 >= n.
+     */
+    nextPowerOfTwo(n) {
+        if (n <= 0)
+            return 1;
+        n--;
+        n |= n >> 1;
+        n |= n >> 2;
+        n |= n >> 4;
+        n |= n >> 8;
+        n |= n >> 16;
+        return n + 1;
+    }
+    // ========================================================================
+    // Inspection
+    // ========================================================================
+    /**
+     * Returns the current capacity of the underlying array.
+     */
+    get capacity() {
+        return this._elements.length;
+    }
+    /**
+     * Returns a string representation for debugging.
+     */
+    toString() {
+        return `ArrayDeque[${this.toArray().join(", ")}]`;
+    }
+}
+/**
+ * Factory function to create an ArrayDeque.
+ *
+ * @example
+ * const deque = arrayDeque<number>()
+ * const dequeFromArray = arrayDeque([1, 2, 3])
+ * const dequeWithOptions = arrayDeque<string>({ initialCapacity: 32 })
+ */
+export function arrayDeque(optionsOrElements) {
+    // Check if it's an iterable (not options)
+    if (optionsOrElements && Symbol.iterator in optionsOrElements) {
+        const deque = new ArrayDeque();
+        deque.addAll(optionsOrElements);
+        return deque;
+    }
+    return new ArrayDeque(optionsOrElements);
+}
+//# sourceMappingURL=array-deque.js.map

package/dist/collections/impl/array-deque.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-deque.js","sourceRoot":"","sources":["../../../src/collections/impl/array-deque.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAoBjD;;;;;;;GAOG;AACH,MAAM,OAAO,UAAU;IACb,SAAS,CAAoB;IAC7B,KAAK,CAAS,CAAC,yBAAyB;IACxC,KAAK,CAAS,CAAC,yCAAyC;IAC/C,GAAG,CAAQ;IAE5B,YAAY,UAAgC,EAAE;QAC5C,MAAM,EAAE,eAAe,GAAG,EAAE,EAAE,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC;QACzD,yEAAyE;QACzE,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,SAAS,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,OAAO;IACP,2EAA2E;IAE3E,IAAI,IAAI;QACN,0CAA0C;QAC1C,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC;IACnC,CAAC;IAED,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,0BAA0B;IAC1B,2EAA2E;IAE3E,QAAQ,CAAC,OAAU;QACjB,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QACrC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED,UAAU,CAAC,OAAU;QACnB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW;QACT,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,EAAG,CAAC;IAC3B,CAAC;IAED,SAAS;QACP,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,SAAS;QACP,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IACrC,CAAC;IAED,oBAAoB;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,CAAC;IAED,2EAA2E;IAC3E,yBAAyB;IACzB,2EAA2E;IAE3E,OAAO,CAAC,OAAU;QAChB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED,SAAS,CAAC,OAAU;QAClB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,EAAG,CAAC;IAC1B,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QACvC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAE,CAAC;IACpC,CAAC;IAED,mBAAmB;QACjB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAED,2EAA2E;IAC3E,0CAA0C;IAC1C,2EAA2E;IAE3E,IAAI,CAAC,OAAU;QACb,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,GAAG;QACD,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IAED,2EAA2E;IAC3E,mDAAmD;IACnD,2EAA2E;IAE3E,KAAK,CAAC,OAAU;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,oBAAoB,EAAE,CAAC;IACrC,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IAED,2EAA2E;IAC3E,wBAAwB;IACxB,2EAA2E;IAE3E,GAAG,CAAC,OAAU;QACZ,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,KAAkB;QACvB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACtB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,OAAU;QACjB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,WAAW,CAAC,KAAkB;QAC5B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,OAAU;QACf,4CAA4C;QAC5C,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,IAAI,KAAK,GAAG,KAAK,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAE,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC9C,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM;YACR,CAAC;YACD,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QAEzB,uCAAuC;QACvC,MAAM,cAAc,GAClB,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE9B,IAAI,cAAc,EAAE,CAAC;YACnB,4CAA4C;YAC5C,OAAO,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC5D,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gBAClD,KAAK,GAAG,SAAS,CAAC;YACpB,CAAC;YACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;YACvC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;aAAM,CAAC;YACN,6CAA6C;YAC7C,OAAO,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC5D,IAAI,SAAS,KAAK,IAAI,CAAC,KAAK;oBAAE,MAAM;gBACpC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gBAClD,KAAK,GAAG,SAAS,CAAC;YACpB,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAK,CAAC;QAC9B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;QAED,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAErD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,KAAK,MAAM,aAAa,IAAI,QAAQ,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;oBACrC,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,YAAY,EAAE,CAAC;gBACjB,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;QAE5B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK;QACH,4BAA4B;QAC5B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,OAAO,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;YAClC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,YAAY;IACZ,2EAA2E;IAE3E,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,OAAO,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAE,CAAC;YAC7B,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAA2C;QACjD,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,OAAO,UAAU,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAE,EAAE,YAAY,CAAC,CAAC;YAClD,UAAU,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5D,YAAY,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,sBAAsB;IACtB,2EAA2E;IAE3E;;OAEG;IACK,IAAI;QACV,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;QAC1C,MAAM,WAAW,GAAG,WAAW,IAAI,CAAC,CAAC,CAAC,kBAAkB;QAExD,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,8CAA8C;QAC9C,MAAM,SAAS,GAAG,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,gDAAgD;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,CAAS;QAC9B,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QACrB,CAAC,EAAE,CAAC;QACJ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACb,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,aAAa;IACb,2EAA2E;IAE3E;;OAEG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,cAAc,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,iBAAsD;IAEtD,0CAA0C;IAC1C,IAAI,iBAAiB,IAAI,MAAM,CAAC,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QAC9D,MAAM,KAAK,GAAG,IAAI,UAAU,EAAK,CAAC;QAClC,KAAK,CAAC,MAAM,CAAC,iBAAgC,CAAC,CAAC;QAC/C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,IAAI,UAAU,CAAI,iBAAyC,CAAC,CAAC;AACtE,CAAC"}

package/dist/collections/impl/array-list.d.ts

@@ -0,0 +1,101 @@
+/**
+ * ArrayList implementation - A dynamic array-backed list.
+ *
+ * Provides O(1) indexed access and amortized O(1) append.
+ * Mirrors java.util.ArrayList.
+ *
+ * @example
+ * const list = arrayList<number>()
+ * list.add(1)
+ * list.add(2)
+ * list.add(3)
+ * console.log(list.get(1)) // 2
+ */
+import type { List, RandomAccess } from "../interfaces/list.js";
+import type { Eq, Compare } from "../core/traits.js";
+/**
+ * Options for creating an ArrayList.
+ */
+export interface ArrayListOptions<T> {
+    /**
+     * Initial capacity of the underlying array.
+     * @default 10
+     */
+    initialCapacity?: number;
+    /**
+     * Equality function for comparing elements.
+     * @default defaultEq (===)
+     */
+    eq?: Eq<T>;
+}
+/**
+ * ArrayList<T> - Resizable array implementation of the List interface.
+ *
+ * Provides fast random access (O(1)) and fast append (amortized O(1)).
+ * Insertion and removal in the middle require shifting elements (O(n)).
+ *
+ * This is the most commonly used list implementation.
+ */
+export declare class ArrayList<T> implements List<T>, RandomAccess {
+    private _array;
+    private _size;
+    private readonly _eq;
+    readonly supportsRandomAccess: true;
+    constructor(options?: ArrayListOptions<T>);
+    get size(): number;
+    get isEmpty(): boolean;
+    /**
+     * Current capacity of the underlying array.
+     */
+    get capacity(): number;
+    get eq(): Eq<T>;
+    get(index: number): T;
+    set(index: number, element: T): T;
+    contains(element: T): boolean;
+    indexOf(element: T, fromIndex?: number): number;
+    lastIndexOf(element: T, fromIndex?: number): number;
+    containsAll(other: Iterable<T>): boolean;
+    add(element: T): boolean;
+    push(element: T): void;
+    unshift(element: T): void;
+    insert(index: number, element: T): void;
+    insertAll(index: number, other: Iterable<T>): boolean;
+    addAll(other: Iterable<T>): boolean;
+    remove(element: T): boolean;
+    removeAt(index: number): T;
+    pop(): T;
+    shift(): T;
+    removeRange(fromIndex: number, toIndex: number): void;
+    removeAll(other: Iterable<T>): boolean;
+    retainAll(other: Iterable<T>): boolean;
+    clear(): void;
+    sort(compare?: Compare<T>): void;
+    reverse(): void;
+    first(): T;
+    last(): T;
+    subList(fromIndex: number, toIndex: number): List<T>;
+    [Symbol.iterator](): Iterator<T>;
+    forEach(action: (element: T, index: number) => void): void;
+    toArray(): T[];
+    /**
+     * Ensures that the capacity is at least the specified minimum.
+     */
+    ensureCapacity(minCapacity: number): void;
+    /**
+     * Trims the capacity to the current size to minimize memory usage.
+     */
+    trimToSize(): void;
+    private checkIndex;
+    private checkInsertIndex;
+    private checkRange;
+}
+/**
+ * Factory function to create an ArrayList.
+ *
+ * @example
+ * const list = arrayList<number>()
+ * const listWithEq = arrayList<User>({ eq: (a, b) => a.id === b.id })
+ * const listFromArray = arrayList([1, 2, 3])
+ */
+export declare function arrayList<T>(optionsOrElements?: ArrayListOptions<T> | Iterable<T>): ArrayList<T>;
+//# sourceMappingURL=array-list.d.ts.map

package/dist/collections/impl/array-list.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-list.d.ts","sourceRoot":"","sources":["../../../src/collections/impl/array-list.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAGrD;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACZ;AAED;;;;;;;GAOG;AACH,qBAAa,SAAS,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,CAAC,CAAC,EAAE,YAAY;IACxD,OAAO,CAAC,MAAM,CAAM;IACpB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAE5B,QAAQ,CAAC,oBAAoB,EAAG,IAAI,CAAU;gBAElC,OAAO,GAAE,gBAAgB,CAAC,CAAC,CAAM;IAW7C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAMD,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAKrB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC;IAWjC,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAI7B,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,GAAE,MAAU,GAAG,MAAM;IAUlD,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM;IAanD,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAWxC,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAMxB,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI;IAItB,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI;IAIzB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI;IAavC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAqBrD,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAiBnC,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAO3B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAgB1B,GAAG,IAAI,CAAC;IAOR,KAAK,IAAI,CAAC;IAOV,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IAkBrD,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAoCtC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAiCtC,KAAK,IAAI,IAAI;IAYb,IAAI,CAAC,OAAO,GAAE,OAAO,CAAC,CAAC,CAAkB,GAAG,IAAI;IAShD,OAAO,IAAI,IAAI;IAgBf,KAAK,IAAI,CAAC;IAOV,IAAI,IAAI,CAAC;IAOT,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IAcnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAMjC,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAM1D,OAAO,IAAI,CAAC,EAAE;IAQd;;OAEG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IAgBzC;;OAEG;IACH,UAAU,IAAI,IAAI;IAUlB,OAAO,CAAC,UAAU;IAQlB,OAAO,CAAC,gBAAgB;IAQxB,OAAO,CAAC,UAAU;CAOnB;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,iBAAiB,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GACpD,SAAS,CAAC,CAAC,CAAC,CAUd"}