@procedures/client 0.0.0-stage → 0.1.0

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

@@ -0,0 +1,387 @@
+/**
+ * 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 { defaultEq, defaultCompare } from "../utils/defaults.js";
+/**
+ * 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 class ArrayList {
+    _array;
+    _size;
+    _eq;
+    supportsRandomAccess = true;
+    constructor(options = {}) {
+        const { initialCapacity = 10, eq = defaultEq } = options;
+        this._array = new Array(initialCapacity);
+        this._size = 0;
+        this._eq = eq;
+    }
+    // ========================================================================
+    // Size and capacity
+    // ========================================================================
+    get size() {
+        return this._size;
+    }
+    get isEmpty() {
+        return this._size === 0;
+    }
+    /**
+     * Current capacity of the underlying array.
+     */
+    get capacity() {
+        return this._array.length;
+    }
+    get eq() {
+        return this._eq;
+    }
+    // ========================================================================
+    // Indexed access
+    // ========================================================================
+    get(index) {
+        this.checkIndex(index);
+        return this._array[index];
+    }
+    set(index, element) {
+        this.checkIndex(index);
+        const old = this._array[index];
+        this._array[index] = element;
+        return old;
+    }
+    // ========================================================================
+    // Search
+    // ========================================================================
+    contains(element) {
+        return this.indexOf(element) !== -1;
+    }
+    indexOf(element, fromIndex = 0) {
+        if (fromIndex < 0)
+            fromIndex = 0;
+        for (let i = fromIndex; i < this._size; i++) {
+            if (this._eq(this._array[i], element)) {
+                return i;
+            }
+        }
+        return -1;
+    }
+    lastIndexOf(element, fromIndex) {
+        const start = fromIndex !== undefined
+            ? Math.min(fromIndex, this._size - 1)
+            : this._size - 1;
+        for (let i = start; i >= 0; i--) {
+            if (this._eq(this._array[i], element)) {
+                return i;
+            }
+        }
+        return -1;
+    }
+    containsAll(other) {
+        for (const element of other) {
+            if (!this.contains(element))
+                return false;
+        }
+        return true;
+    }
+    // ========================================================================
+    // Addition
+    // ========================================================================
+    add(element) {
+        this.ensureCapacity(this._size + 1);
+        this._array[this._size++] = element;
+        return true;
+    }
+    push(element) {
+        this.add(element);
+    }
+    unshift(element) {
+        this.insert(0, element);
+    }
+    insert(index, element) {
+        this.checkInsertIndex(index);
+        this.ensureCapacity(this._size + 1);
+        // Shift elements to the right
+        for (let i = this._size; i > index; i--) {
+            this._array[i] = this._array[i - 1];
+        }
+        this._array[index] = element;
+        this._size++;
+    }
+    insertAll(index, other) {
+        this.checkInsertIndex(index);
+        const elements = Array.isArray(other) ? other : Array.from(other);
+        if (elements.length === 0)
+            return false;
+        this.ensureCapacity(this._size + elements.length);
+        // Shift existing elements to the right
+        for (let i = this._size - 1; i >= index; i--) {
+            this._array[i + elements.length] = this._array[i];
+        }
+        // Insert new elements
+        for (let i = 0; i < elements.length; i++) {
+            this._array[index + i] = elements[i];
+        }
+        this._size += elements.length;
+        return true;
+    }
+    addAll(other) {
+        const elements = Array.isArray(other) ? other : Array.from(other);
+        if (elements.length === 0)
+            return false;
+        this.ensureCapacity(this._size + elements.length);
+        for (const element of elements) {
+            this._array[this._size++] = element;
+        }
+        return true;
+    }
+    // ========================================================================
+    // Removal
+    // ========================================================================
+    remove(element) {
+        const index = this.indexOf(element);
+        if (index === -1)
+            return false;
+        this.removeAt(index);
+        return true;
+    }
+    removeAt(index) {
+        this.checkIndex(index);
+        const old = this._array[index];
+        // Shift elements to the left
+        for (let i = index; i < this._size - 1; i++) {
+            this._array[i] = this._array[i + 1];
+        }
+        this._size--;
+        // Clear the last element to allow GC
+        this._array[this._size] = undefined;
+        return old;
+    }
+    pop() {
+        if (this.isEmpty) {
+            throw new Error("Cannot pop from empty list");
+        }
+        return this.removeAt(this._size - 1);
+    }
+    shift() {
+        if (this.isEmpty) {
+            throw new Error("Cannot shift from empty list");
+        }
+        return this.removeAt(0);
+    }
+    removeRange(fromIndex, toIndex) {
+        this.checkRange(fromIndex, toIndex);
+        const numToRemove = toIndex - fromIndex;
+        if (numToRemove === 0)
+            return;
+        // Shift elements to the left
+        for (let i = toIndex; i < this._size; i++) {
+            this._array[i - numToRemove] = this._array[i];
+        }
+        // Clear removed elements
+        for (let i = this._size - numToRemove; i < this._size; i++) {
+            this._array[i] = undefined;
+        }
+        this._size -= numToRemove;
+    }
+    removeAll(other) {
+        const toRemove = new Set();
+        for (const element of other) {
+            toRemove.add(element);
+        }
+        let writeIndex = 0;
+        let modified = false;
+        for (let readIndex = 0; readIndex < this._size; readIndex++) {
+            const element = this._array[readIndex];
+            let shouldRemove = false;
+            // Check if element matches any in toRemove using custom equality
+            for (const removeElement of toRemove) {
+                if (this._eq(element, removeElement)) {
+                    shouldRemove = true;
+                    modified = true;
+                    break;
+                }
+            }
+            if (!shouldRemove) {
+                this._array[writeIndex++] = element;
+            }
+        }
+        // Clear remaining elements
+        for (let i = writeIndex; i < this._size; i++) {
+            this._array[i] = undefined;
+        }
+        this._size = writeIndex;
+        return modified;
+    }
+    retainAll(other) {
+        const toRetain = Array.from(other);
+        let writeIndex = 0;
+        let modified = false;
+        for (let readIndex = 0; readIndex < this._size; readIndex++) {
+            const element = this._array[readIndex];
+            let shouldRetain = false;
+            // Check if element matches any in toRetain using custom equality
+            for (const retainElement of toRetain) {
+                if (this._eq(element, retainElement)) {
+                    shouldRetain = true;
+                    break;
+                }
+            }
+            if (shouldRetain) {
+                this._array[writeIndex++] = element;
+            }
+            else {
+                modified = true;
+            }
+        }
+        // Clear remaining elements
+        for (let i = writeIndex; i < this._size; i++) {
+            this._array[i] = undefined;
+        }
+        this._size = writeIndex;
+        return modified;
+    }
+    clear() {
+        // Clear all elements to allow GC
+        for (let i = 0; i < this._size; i++) {
+            this._array[i] = undefined;
+        }
+        this._size = 0;
+    }
+    // ========================================================================
+    // Ordering
+    // ========================================================================
+    sort(compare = defaultCompare) {
+        // Sort only the used portion of the array
+        const slice = this._array.slice(0, this._size);
+        slice.sort(compare);
+        for (let i = 0; i < this._size; i++) {
+            this._array[i] = slice[i];
+        }
+    }
+    reverse() {
+        let left = 0;
+        let right = this._size - 1;
+        while (left < right) {
+            const temp = this._array[left];
+            this._array[left] = this._array[right];
+            this._array[right] = temp;
+            left++;
+            right--;
+        }
+    }
+    // ========================================================================
+    // Views
+    // ========================================================================
+    first() {
+        if (this.isEmpty) {
+            throw new Error("List is empty");
+        }
+        return this._array[0];
+    }
+    last() {
+        if (this.isEmpty) {
+            throw new Error("List is empty");
+        }
+        return this._array[this._size - 1];
+    }
+    subList(fromIndex, toIndex) {
+        this.checkRange(fromIndex, toIndex);
+        // For now, return a copy. Later we can implement a view.
+        const sub = new ArrayList({ eq: this._eq });
+        for (let i = fromIndex; i < toIndex; i++) {
+            sub.add(this._array[i]);
+        }
+        return sub;
+    }
+    // ========================================================================
+    // Iteration
+    // ========================================================================
+    *[Symbol.iterator]() {
+        for (let i = 0; i < this._size; i++) {
+            yield this._array[i];
+        }
+    }
+    forEach(action) {
+        for (let i = 0; i < this._size; i++) {
+            action(this._array[i], i);
+        }
+    }
+    toArray() {
+        return this._array.slice(0, this._size);
+    }
+    // ========================================================================
+    // Capacity management
+    // ========================================================================
+    /**
+     * Ensures that the capacity is at least the specified minimum.
+     */
+    ensureCapacity(minCapacity) {
+        if (minCapacity <= this._array.length)
+            return;
+        // Grow by 1.5x or to minCapacity, whichever is larger
+        const newCapacity = Math.max(minCapacity, Math.floor(this._array.length * 1.5) + 1);
+        const newArray = new Array(newCapacity);
+        for (let i = 0; i < this._size; i++) {
+            newArray[i] = this._array[i];
+        }
+        this._array = newArray;
+    }
+    /**
+     * Trims the capacity to the current size to minimize memory usage.
+     */
+    trimToSize() {
+        if (this._size < this._array.length) {
+            this._array = this._array.slice(0, this._size);
+        }
+    }
+    // ========================================================================
+    // Private helpers
+    // ========================================================================
+    checkIndex(index) {
+        if (index < 0 || index >= this._size) {
+            throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);
+        }
+    }
+    checkInsertIndex(index) {
+        if (index < 0 || index > this._size) {
+            throw new RangeError(`Index ${index} out of bounds for insert (size ${this._size})`);
+        }
+    }
+    checkRange(fromIndex, toIndex) {
+        if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {
+            throw new RangeError(`Invalid range [${fromIndex}, ${toIndex}) for size ${this._size}`);
+        }
+    }
+}
+/**
+ * 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 function arrayList(optionsOrElements) {
+    // Check if it's an iterable (not options)
+    if (optionsOrElements && Symbol.iterator in optionsOrElements) {
+        const list = new ArrayList();
+        list.addAll(optionsOrElements);
+        return list;
+    }
+    const list = new ArrayList(optionsOrElements);
+    return list;
+}
+//# sourceMappingURL=array-list.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"array-list.js","sourceRoot":"","sources":["../../../src/collections/impl/array-list.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAmBjE;;;;;;;GAOG;AACH,MAAM,OAAO,SAAS;IACZ,MAAM,CAAM;IACZ,KAAK,CAAS;IACL,GAAG,CAAQ;IAEnB,oBAAoB,GAAG,IAAa,CAAC;IAE9C,YAAY,UAA+B,EAAE;QAC3C,MAAM,EAAE,eAAe,GAAG,EAAE,EAAE,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC;QACzD,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,oBAAoB;IACpB,2EAA2E;IAE3E,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,iBAAiB;IACjB,2EAA2E;IAE3E,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;IAC7B,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,OAAU;QAC3B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAC7B,OAAO,GAAI,CAAC;IACd,CAAC;IAED,2EAA2E;IAC3E,SAAS;IACT,2EAA2E;IAE3E,QAAQ,CAAC,OAAU;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,CAAC,OAAU,EAAE,YAAoB,CAAC;QACvC,IAAI,SAAS,GAAG,CAAC;YAAE,SAAS,GAAG,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,EAAE,CAAC;gBACvC,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,WAAW,CAAC,OAAU,EAAE,SAAkB;QACxC,MAAM,KAAK,GACT,SAAS,KAAK,SAAS;YACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACrC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,EAAE,CAAC;gBACvC,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,WAAW,CAAC,KAAkB;QAC5B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC5C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2EAA2E;IAC3E,WAAW;IACX,2EAA2E;IAE3E,GAAG,CAAC,OAAU;QACZ,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,OAAU;QACb,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,CAAC,KAAa,EAAE,OAAU;QAC9B,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAEpC,8BAA8B;QAC9B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QACvC,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,SAAS,CAAC,KAAa,EAAE,KAAkB;QACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAExC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAElD,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;QACrD,CAAC;QAED,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,KAAkB;QACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAExC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAElD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;QACtC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2EAA2E;IAC3E,UAAU;IACV,2EAA2E;IAE3E,MAAM,CAAC,OAAU;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,KAAa;QACpB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAEhC,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QACvC,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,qCAAqC;QACrC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAgB,CAAC;QAE3C,OAAO,GAAG,CAAC;IACb,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,WAAW,CAAC,SAAiB,EAAE,OAAe;QAC5C,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACpC,MAAM,WAAW,GAAG,OAAO,GAAG,SAAS,CAAC;QACxC,IAAI,WAAW,KAAK,CAAC;YAAE,OAAO;QAE9B,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;QACjD,CAAC;QAED,yBAAyB;QACzB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,WAAW,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAgB,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,KAAK,IAAI,WAAW,CAAC;IAC5B,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,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAE,CAAC;YACxC,IAAI,YAAY,GAAG,KAAK,CAAC;YAEzB,iEAAiE;YACjE,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,QAAQ,GAAG,IAAI,CAAC;oBAChB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,GAAG,OAAO,CAAC;YACtC,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAgB,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;QACxB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAE,CAAC;YACxC,IAAI,YAAY,GAAG,KAAK,CAAC;YAEzB,iEAAiE;YACjE,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;YAED,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,GAAG,OAAO,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAgB,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;QACxB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK;QACH,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAgB,CAAC;QACpC,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,WAAW;IACX,2EAA2E;IAE3E,IAAI,CAAC,UAAsB,cAAc;QACvC,0CAA0C;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC3B,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;YACxC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,QAAQ;IACR,2EAA2E;IAE3E,KAAK;QACH,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;IACzB,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC;IACtC,CAAC;IAED,OAAO,CAAC,SAAiB,EAAE,OAAe;QACxC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACpC,yDAAyD;QACzD,MAAM,GAAG,GAAG,IAAI,SAAS,CAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2EAA2E;IAC3E,YAAY;IACZ,2EAA2E;IAE3E,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAA2C;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED,2EAA2E;IAC3E,sBAAsB;IACtB,2EAA2E;IAE3E;;OAEG;IACH,cAAc,CAAC,WAAmB;QAChC,IAAI,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO;QAE9C,sDAAsD;QACtD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,WAAW,EACX,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CACzC,CAAC;QAEF,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAEnE,UAAU,CAAC,KAAa;QAC9B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,IAAI,UAAU,CAClB,SAAS,KAAK,2BAA2B,IAAI,CAAC,KAAK,EAAE,CACtD,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,gBAAgB,CAAC,KAAa;QACpC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,IAAI,UAAU,CAClB,SAAS,KAAK,mCAAmC,IAAI,CAAC,KAAK,GAAG,CAC/D,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,SAAiB,EAAE,OAAe;QACnD,IAAI,SAAS,GAAG,CAAC,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;YACjE,MAAM,IAAI,UAAU,CAClB,kBAAkB,SAAS,KAAK,OAAO,cAAc,IAAI,CAAC,KAAK,EAAE,CAClE,CAAC;QACJ,CAAC;IACH,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CACvB,iBAAqD;IAErD,0CAA0C;IAC1C,IAAI,iBAAiB,IAAI,MAAM,CAAC,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,SAAS,EAAK,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,iBAAgC,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,SAAS,CAAI,iBAAwC,CAAC,CAAC;IACxE,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/collections/impl/hash-map.d.ts

@@ -0,0 +1,141 @@
+/**
+ * HashMap implementation - A hash table with custom equality and hashing.
+ *
+ * Provides O(1) average case lookup, insertion, and deletion.
+ * Supports custom equality and hash functions for keys.
+ * Mirrors java.util.HashMap.
+ *
+ * @example
+ * const map = hashMap<string, number>()
+ * map.set('one', 1)
+ * map.set('two', 2)
+ * console.log(map.get('one')) // 1
+ *
+ * // Custom equality for object keys
+ * const userMap = hashMap<User, Data>({
+ *   keyEq: (a, b) => a.id === b.id,
+ *   keyHash: (u) => hashString(u.id)
+ * })
+ */
+import type { MapLike, Entry } from "../interfaces/map.js";
+import type { Eq, Hash } from "../core/traits.js";
+/**
+ * Options for creating a HashMap.
+ */
+export interface HashMapOptions<K, V> {
+    /**
+     * Initial capacity (number of buckets).
+     * Must be a power of 2.
+     * @default 16
+     */
+    initialCapacity?: number;
+    /**
+     * Load factor threshold for resizing (0-1).
+     * When size > capacity * loadFactor, the map resizes.
+     * @default 0.75
+     */
+    loadFactor?: number;
+    /**
+     * Equality function for keys.
+     * @default defaultEq (===)
+     */
+    keyEq?: Eq<K>;
+    /**
+     * Hash function for keys.
+     * @default defaultHash
+     */
+    keyHash?: Hash<K>;
+    /**
+     * Equality function for values (used in containsValue).
+     * @default defaultEq (===)
+     */
+    valueEq?: Eq<V>;
+}
+/**
+ * HashMap<K, V> - Hash table implementation with custom equality/hashing.
+ *
+ * Uses separate chaining for collision resolution.
+ * Automatically resizes when load factor is exceeded.
+ *
+ * Not thread-safe. Use synchronized() behavior for concurrent access.
+ */
+export declare class HashMap<K, V> implements MapLike<K, V> {
+    private _buckets;
+    private _size;
+    private readonly _loadFactor;
+    private readonly _keyEq;
+    private readonly _keyHash;
+    private readonly _valueEq;
+    private _threshold;
+    constructor(options?: HashMapOptions<K, V>);
+    get size(): number;
+    get isEmpty(): boolean;
+    get keyEq(): Eq<K>;
+    get valueEq(): Eq<V>;
+    has(key: K): boolean;
+    get(key: K): V;
+    getOrUndefined(key: K): V | undefined;
+    getOrDefault(key: K, defaultValue: V): V;
+    containsValue(value: V): boolean;
+    set(key: K, value: V): V | undefined;
+    setIfAbsent(key: K, value: V): V;
+    delete(key: K): V | undefined;
+    deleteEntry(key: K, value: V): boolean;
+    replace(key: K, value: V): V | undefined;
+    replaceEntry(key: K, oldValue: V, newValue: V): boolean;
+    computeIfAbsent(key: K, mappingFunction: (key: K) => V): V;
+    computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined;
+    compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined;
+    merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined;
+    putAll(other: MapLike<K, V> | Iterable<Entry<K, V>>): void;
+    clear(): void;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V>;
+    entries(): IterableIterator<Entry<K, V>>;
+    [Symbol.iterator](): Iterator<Entry<K, V>>;
+    forEach(action: (value: V, key: K, map: this) => void): void;
+    /**
+     * Returns the bucket index for a given hash.
+     */
+    private bucketIndex;
+    /**
+     * Resizes the hash table to double its current capacity.
+     */
+    private resize;
+    /**
+     * Returns the next power of 2 >= n.
+     */
+    private nextPowerOfTwo;
+    /**
+     * Returns the current number of buckets.
+     */
+    get capacity(): number;
+    /**
+     * Returns the current load factor (size / capacity).
+     */
+    get loadFactor(): number;
+    /**
+     * Returns statistics about bucket distribution (for debugging).
+     */
+    getStats(): {
+        size: number;
+        capacity: number;
+        loadFactor: number;
+        avgChainLength: number;
+        maxChainLength: number;
+        emptyBuckets: number;
+    };
+}
+/**
+ * Factory function to create a HashMap.
+ *
+ * @example
+ * const map = hashMap<string, number>()
+ * const mapWithOptions = hashMap<User, Data>({
+ *   keyEq: (a, b) => a.id === b.id,
+ *   keyHash: (u) => hashString(u.id)
+ * })
+ * const mapFromEntries = hashMap([['a', 1], ['b', 2]])
+ */
+export declare function hashMap<K, V>(optionsOrEntries?: HashMapOptions<K, V> | Iterable<readonly [K, V]>): HashMap<K, V>;
+//# sourceMappingURL=hash-map.d.ts.map

package/dist/collections/impl/hash-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-map.d.ts","sourceRoot":"","sources":["../../../src/collections/impl/hash-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAalD;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,CAAC,EAAE,CAAC;IAClC;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEd;;;OAGG;IACH,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAElB;;;OAGG;IACH,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACjB;AAED;;;;;;;GAOG;AACH,qBAAa,OAAO,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACjD,OAAO,CAAC,QAAQ,CAAwB;IACxC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAQ;IAC/B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAU;IACnC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IACjC,OAAO,CAAC,UAAU,CAAS;gBAEf,OAAO,GAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAM;IAuB9C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAEjB;IAED,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,CAEnB;IAMD,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAepB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;IAQd,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAerC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC;IAKxC,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAiBhC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAiCpC,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC;IAShC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IA0B7B,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO;IA4BtC,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAiBxC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO;IAwBvD,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC;IAW1D,gBAAgB,CACd,GAAG,EAAE,CAAC,EACN,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GACrD,CAAC,GAAG,SAAS;IAgBhB,OAAO,CACL,GAAG,EAAE,CAAC,EACN,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG,SAAS,GACjE,CAAC,GAAG,SAAS;IAehB,KAAK,CACH,GAAG,EAAE,CAAC,EACN,KAAK,EAAE,CAAC,EACR,iBAAiB,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAC7D,CAAC,GAAG,SAAS;IAsBhB,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI;IAM1D,KAAK,IAAI,IAAI;IASZ,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAU3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAU7B,OAAO,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAcxC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAI3C,OAAO,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAU5D;;OAEG;IACH,OAAO,CAAC,WAAW;IAMnB;;OAEG;IACH,OAAO,CAAC,MAAM;IAwBd;;OAEG;IACH,OAAO,CAAC,cAAc;IAetB;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED;;OAEG;IACH,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED;;OAEG;IACH,QAAQ,IAAI;QACV,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,MAAM,CAAC;QACnB,cAAc,EAAE,MAAM,CAAC;QACvB,cAAc,EAAE,MAAM,CAAC;QACvB,YAAY,EAAE,MAAM,CAAC;KACtB;CA6BF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAC1B,gBAAgB,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAClE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWf"}