@procedures/client 0.0.0-stage → 0.1.0

package/dist/collections/impl/hash-map.js

@@ -0,0 +1,450 @@
+/**
+ * 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 { defaultEq, defaultHash } from "../utils/defaults.js";
+/**
+ * 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 class HashMap {
+    _buckets;
+    _size;
+    _loadFactor;
+    _keyEq;
+    _keyHash;
+    _valueEq;
+    _threshold;
+    constructor(options = {}) {
+        const { initialCapacity = 16, loadFactor = 0.75, keyEq = defaultEq, keyHash = defaultHash, valueEq = defaultEq, } = options;
+        const capacity = this.nextPowerOfTwo(Math.max(4, initialCapacity));
+        this._buckets = new Array(capacity).fill(null);
+        this._size = 0;
+        this._loadFactor = loadFactor;
+        this._keyEq = keyEq;
+        this._keyHash = keyHash;
+        this._valueEq = valueEq;
+        this._threshold = Math.floor(capacity * loadFactor);
+    }
+    // ========================================================================
+    // Size
+    // ========================================================================
+    get size() {
+        return this._size;
+    }
+    get isEmpty() {
+        return this._size === 0;
+    }
+    get keyEq() {
+        return this._keyEq;
+    }
+    get valueEq() {
+        return this._valueEq;
+    }
+    // ========================================================================
+    // Lookup
+    // ========================================================================
+    has(key) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        while (node !== null) {
+            if (node.hash === hash && this._keyEq(node.key, key)) {
+                return true;
+            }
+            node = node.next;
+        }
+        return false;
+    }
+    get(key) {
+        const value = this.getOrUndefined(key);
+        if (value === undefined) {
+            throw new Error(`Key not found: ${key}`);
+        }
+        return value;
+    }
+    getOrUndefined(key) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        while (node !== null) {
+            if (node.hash === hash && this._keyEq(node.key, key)) {
+                return node.value;
+            }
+            node = node.next;
+        }
+        return undefined;
+    }
+    getOrDefault(key, defaultValue) {
+        const value = this.getOrUndefined(key);
+        return value !== undefined ? value : defaultValue;
+    }
+    containsValue(value) {
+        for (const bucket of this._buckets) {
+            let node = bucket;
+            while (node !== null) {
+                if (this._valueEq(node.value, value)) {
+                    return true;
+                }
+                node = node.next;
+            }
+        }
+        return false;
+    }
+    // ========================================================================
+    // Modification
+    // ========================================================================
+    set(key, value) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        // Check if key already exists
+        while (node !== null) {
+            if (node.hash === hash && this._keyEq(node.key, key)) {
+                const oldValue = node.value;
+                node.value = value;
+                return oldValue;
+            }
+            node = node.next;
+        }
+        // Key doesn't exist, add new entry
+        const newNode = {
+            key,
+            value,
+            hash,
+            next: this._buckets[index] ?? null,
+        };
+        this._buckets[index] = newNode;
+        this._size++;
+        // Check if resize is needed
+        if (this._size > this._threshold) {
+            this.resize();
+        }
+        return undefined;
+    }
+    setIfAbsent(key, value) {
+        const existing = this.getOrUndefined(key);
+        if (existing !== undefined) {
+            return existing;
+        }
+        this.set(key, value);
+        return value;
+    }
+    delete(key) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        let prev = null;
+        while (node !== null) {
+            if (node.hash === hash && this._keyEq(node.key, key)) {
+                // Found the node to delete
+                if (prev === null) {
+                    // Node is at head of bucket
+                    this._buckets[index] = node.next;
+                }
+                else {
+                    // Node is in middle or end
+                    prev.next = node.next;
+                }
+                this._size--;
+                return node.value;
+            }
+            prev = node;
+            node = node.next;
+        }
+        return undefined;
+    }
+    deleteEntry(key, value) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        let prev = null;
+        while (node !== null) {
+            if (node.hash === hash &&
+                this._keyEq(node.key, key) &&
+                this._valueEq(node.value, value)) {
+                // Found the entry to delete
+                if (prev === null) {
+                    this._buckets[index] = node.next;
+                }
+                else {
+                    prev.next = node.next;
+                }
+                this._size--;
+                return true;
+            }
+            prev = node;
+            node = node.next;
+        }
+        return false;
+    }
+    replace(key, value) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        while (node !== null) {
+            if (node.hash === hash && this._keyEq(node.key, key)) {
+                const oldValue = node.value;
+                node.value = value;
+                return oldValue;
+            }
+            node = node.next;
+        }
+        return undefined;
+    }
+    replaceEntry(key, oldValue, newValue) {
+        const hash = this._keyHash(key);
+        const index = this.bucketIndex(hash);
+        let node = this._buckets[index] ?? null;
+        while (node !== null) {
+            if (node.hash === hash &&
+                this._keyEq(node.key, key) &&
+                this._valueEq(node.value, oldValue)) {
+                node.value = newValue;
+                return true;
+            }
+            node = node.next;
+        }
+        return false;
+    }
+    // ========================================================================
+    // Compute operations
+    // ========================================================================
+    computeIfAbsent(key, mappingFunction) {
+        const existing = this.getOrUndefined(key);
+        if (existing !== undefined) {
+            return existing;
+        }
+        const newValue = mappingFunction(key);
+        this.set(key, newValue);
+        return newValue;
+    }
+    computeIfPresent(key, remappingFunction) {
+        const existing = this.getOrUndefined(key);
+        if (existing === undefined) {
+            return undefined;
+        }
+        const newValue = remappingFunction(key, existing);
+        if (newValue === undefined) {
+            this.delete(key);
+            return undefined;
+        }
+        this.set(key, newValue);
+        return newValue;
+    }
+    compute(key, remappingFunction) {
+        const existing = this.getOrUndefined(key);
+        const newValue = remappingFunction(key, existing);
+        if (newValue === undefined) {
+            if (existing !== undefined) {
+                this.delete(key);
+            }
+            return undefined;
+        }
+        this.set(key, newValue);
+        return newValue;
+    }
+    merge(key, value, remappingFunction) {
+        const existing = this.getOrUndefined(key);
+        if (existing === undefined) {
+            this.set(key, value);
+            return value;
+        }
+        const merged = remappingFunction(existing, value);
+        if (merged === undefined) {
+            this.delete(key);
+            return undefined;
+        }
+        this.set(key, merged);
+        return merged;
+    }
+    // ========================================================================
+    // Bulk operations
+    // ========================================================================
+    putAll(other) {
+        for (const entry of other) {
+            this.set(entry.key, entry.value);
+        }
+    }
+    clear() {
+        this._buckets.fill(null);
+        this._size = 0;
+    }
+    // ========================================================================
+    // Views
+    // ========================================================================
+    *keys() {
+        for (const bucket of this._buckets) {
+            let node = bucket;
+            while (node !== null) {
+                yield node.key;
+                node = node.next;
+            }
+        }
+    }
+    *values() {
+        for (const bucket of this._buckets) {
+            let node = bucket;
+            while (node !== null) {
+                yield node.value;
+                node = node.next;
+            }
+        }
+    }
+    *entries() {
+        for (const bucket of this._buckets) {
+            let node = bucket;
+            while (node !== null) {
+                yield { key: node.key, value: node.value };
+                node = node.next;
+            }
+        }
+    }
+    // ========================================================================
+    // Iteration
+    // ========================================================================
+    *[Symbol.iterator]() {
+        yield* this.entries();
+    }
+    forEach(action) {
+        for (const entry of this.entries()) {
+            action(entry.value, entry.key, this);
+        }
+    }
+    // ========================================================================
+    // Internal helpers
+    // ========================================================================
+    /**
+     * Returns the bucket index for a given hash.
+     */
+    bucketIndex(hash) {
+        // Use bitwise AND with (length - 1) for efficient modulo
+        // This works because length is always a power of 2
+        return hash & (this._buckets.length - 1);
+    }
+    /**
+     * Resizes the hash table to double its current capacity.
+     */
+    resize() {
+        const oldBuckets = this._buckets;
+        const newCapacity = oldBuckets.length << 1; // Double capacity
+        if (newCapacity < 0) {
+            throw new Error("Map too large");
+        }
+        this._buckets = new Array(newCapacity).fill(null);
+        this._threshold = Math.floor(newCapacity * this._loadFactor);
+        // Rehash all entries
+        for (const bucket of oldBuckets) {
+            let node = bucket;
+            while (node !== null) {
+                const next = node.next;
+                const index = this.bucketIndex(node.hash);
+                node.next = this._buckets[index] ?? null;
+                this._buckets[index] = node;
+                node = next;
+            }
+        }
+    }
+    /**
+     * 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 number of buckets.
+     */
+    get capacity() {
+        return this._buckets.length;
+    }
+    /**
+     * Returns the current load factor (size / capacity).
+     */
+    get loadFactor() {
+        return this._size / this._buckets.length;
+    }
+    /**
+     * Returns statistics about bucket distribution (for debugging).
+     */
+    getStats() {
+        let maxChainLength = 0;
+        let totalChainLength = 0;
+        let emptyBuckets = 0;
+        for (const bucket of this._buckets) {
+            if (bucket === null) {
+                emptyBuckets++;
+            }
+            else {
+                let length = 0;
+                let node = bucket;
+                while (node !== null) {
+                    length++;
+                    node = node.next;
+                }
+                totalChainLength += length;
+                maxChainLength = Math.max(maxChainLength, length);
+            }
+        }
+        return {
+            size: this._size,
+            capacity: this._buckets.length,
+            loadFactor: this.loadFactor,
+            avgChainLength: this._size > 0 ? totalChainLength / (this._buckets.length - emptyBuckets) : 0,
+            maxChainLength,
+            emptyBuckets,
+        };
+    }
+}
+/**
+ * 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 function hashMap(optionsOrEntries) {
+    // Check if it's an iterable of entries
+    if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {
+        const map = new HashMap();
+        for (const [key, value] of optionsOrEntries) {
+            map.set(key, value);
+        }
+        return map;
+    }
+    return new HashMap(optionsOrEntries);
+}
+//# sourceMappingURL=hash-map.js.map

package/dist/collections/impl/hash-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-map.js","sourceRoot":"","sources":["../../../src/collections/impl/hash-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAiD9D;;;;;;;GAOG;AACH,MAAM,OAAO,OAAO;IACV,QAAQ,CAAwB;IAChC,KAAK,CAAS;IACL,WAAW,CAAS;IACpB,MAAM,CAAQ;IACd,QAAQ,CAAU;IAClB,QAAQ,CAAQ;IACzB,UAAU,CAAS;IAE3B,YAAY,UAAgC,EAAE;QAC5C,MAAM,EACJ,eAAe,GAAG,EAAE,EACpB,UAAU,GAAG,IAAI,EACjB,KAAK,GAAG,SAAS,EACjB,OAAO,GAAG,WAAW,EACrB,OAAO,GAAG,SAAS,GACpB,GAAG,OAAO,CAAC;QAEZ,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAC,CAAC;IACtD,CAAC;IAED,2EAA2E;IAC3E,OAAO;IACP,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,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,2EAA2E;IAC3E,SAAS;IACT,2EAA2E;IAE3E,GAAG,CAAC,GAAM;QACR,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QAExC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,cAAc,CAAC,GAAM;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QAExC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAC,KAAK,CAAC;YACpB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,YAAY,CAAC,GAAM,EAAE,YAAe;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACvC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC;IACpD,CAAC;IAED,aAAa,CAAC,KAAQ;QACpB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,MAAM,CAAC;YAClB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;oBACrC,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,eAAe;IACf,2EAA2E;IAE3E,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QAExC,8BAA8B;QAC9B,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,mCAAmC;QACnC,MAAM,OAAO,GAAe;YAC1B,GAAG;YACH,KAAK;YACL,IAAI;YACJ,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI;SACnC,CAAC;QACF,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,4BAA4B;QAC5B,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,WAAW,CAAC,GAAM,EAAE,KAAQ;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QACxC,IAAI,IAAI,GAAsB,IAAI,CAAC;QAEnC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrD,2BAA2B;gBAC3B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,4BAA4B;oBAC5B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACnC,CAAC;qBAAM,CAAC;oBACN,2BAA2B;oBAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACxB,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC,KAAK,CAAC;YACpB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,WAAW,CAAC,GAAM,EAAE,KAAQ;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QACxC,IAAI,IAAI,GAAsB,IAAI,CAAC;QAEnC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;gBAClB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAChC,CAAC;gBACD,4BAA4B;gBAC5B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACnC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACxB,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,GAAM,EAAE,KAAQ;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QAExC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,YAAY,CAAC,GAAM,EAAE,QAAW,EAAE,QAAW;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QAExC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;gBAClB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EACnC,CAAC;gBACD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;gBACtB,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,qBAAqB;IACrB,2EAA2E;IAE3E,eAAe,CAAC,GAAM,EAAE,eAA8B;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,gBAAgB,CACd,GAAM,EACN,iBAAsD;QAEtD,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAClD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,CACL,GAAM,EACN,iBAAkE;QAElE,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAElD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK,CACH,GAAM,EACN,KAAQ,EACR,iBAA8D;QAE9D,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAE1C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,MAAM,GAAG,iBAAiB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAClD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,MAAM,CAAC,KAA4C;QACjD,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,QAAQ;IACR,2EAA2E;IAE3E,CAAC,IAAI;QACH,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,MAAM,CAAC;YAClB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,CAAC,GAAG,CAAC;gBACf,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,CAAC,MAAM;QACL,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,MAAM,CAAC;YAClB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,CAAC,KAAK,CAAC;gBACjB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,CAAC,OAAO;QACN,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,MAAM,CAAC;YAClB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC3C,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,YAAY;IACZ,2EAA2E;IAE3E,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,OAAO,CAAC,MAA6C;QACnD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,mBAAmB;IACnB,2EAA2E;IAE3E;;OAEG;IACK,WAAW,CAAC,IAAY;QAC9B,yDAAyD;QACzD,mDAAmD;QACnD,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACK,MAAM;QACZ,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,kBAAkB;QAE9D,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAE7D,qBAAqB;QACrB,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,IAAI,IAAI,GAAG,MAAM,CAAC;YAClB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACvB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC1C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;gBACzC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;gBAC5B,IAAI,GAAG,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,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,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,QAAQ;QAQN,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,YAAY,EAAE,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,IAAI,MAAM,GAAG,CAAC,CAAC;gBACf,IAAI,IAAI,GAAsB,MAAM,CAAC;gBACrC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;oBACrB,MAAM,EAAE,CAAC;oBACT,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACnB,CAAC;gBACD,gBAAgB,IAAI,MAAM,CAAC;gBAC3B,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK;YAChB,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;YAC9B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,cAAc,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7F,cAAc;YACd,YAAY;SACb,CAAC;IACJ,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,OAAO,CACrB,gBAAmE;IAEnE,uCAAuC;IACvC,IAAI,gBAAgB,IAAI,MAAM,CAAC,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAI,OAAO,EAAQ,CAAC;QAChC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,gBAA6C,EAAE,CAAC;YACzE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,IAAI,OAAO,CAAO,gBAAwC,CAAC,CAAC;AACrE,CAAC"}

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

@@ -0,0 +1,125 @@
+/**
+ * HashSet implementation - A set backed by a HashMap.
+ *
+ * Provides O(1) average case for add, remove, and contains operations.
+ * Elements are unique based on custom equality and hash functions.
+ * Mirrors java.util.HashSet.
+ *
+ * @example
+ * const set = hashSet<number>()
+ * set.add(1)
+ * set.add(2)
+ * set.add(1) // Returns false, already present
+ * set.size // 2
+ */
+import type { Set } from "../interfaces/set.js";
+import type { Eq, Hash } from "../core/traits.js";
+import { HashMap } from "./hash-map.js";
+/**
+ * Options for creating a HashSet.
+ */
+export interface HashSetOptions<T> {
+    /**
+     * Initial capacity.
+     * @default 16
+     */
+    initialCapacity?: number;
+    /**
+     * Load factor threshold for resizing.
+     * @default 0.75
+     */
+    loadFactor?: number;
+    /**
+     * Equality function for elements.
+     * @default defaultEq (===)
+     */
+    eq?: Eq<T>;
+    /**
+     * Hash function for elements.
+     * @default defaultHash
+     */
+    hash?: Hash<T>;
+}
+/**
+ * HashSet<T> - Hash table implementation of the Set interface.
+ *
+ * Backed by a HashMap where values are a dummy constant.
+ * Provides constant-time performance for basic operations.
+ *
+ * Not thread-safe. Use synchronized() behavior for concurrent access.
+ */
+export declare class HashSet<T> implements Set<T> {
+    private readonly _map;
+    private readonly _eq;
+    constructor(options?: HashSetOptions<T>);
+    get size(): number;
+    get isEmpty(): boolean;
+    get eq(): Eq<T>;
+    add(element: T): boolean;
+    remove(element: T): boolean;
+    contains(element: T): boolean;
+    addAll(other: Iterable<T>): boolean;
+    removeAll(other: Iterable<T>): boolean;
+    retainAll(other: Iterable<T>): boolean;
+    containsAll(other: Iterable<T>): boolean;
+    clear(): void;
+    /**
+     * Returns a new set that is the union of this set and the other set.
+     * Contains all elements from both sets.
+     */
+    union(other: Iterable<T>): HashSet<T>;
+    /**
+     * Returns a new set that is the intersection of this set and the other set.
+     * Contains only elements present in both sets.
+     */
+    intersection(other: Iterable<T>): HashSet<T>;
+    /**
+     * Returns a new set that is the difference of this set and the other set.
+     * Contains elements in this set but not in the other set.
+     */
+    difference(other: Iterable<T>): HashSet<T>;
+    /**
+     * Returns a new set that is the symmetric difference of this set and the other set.
+     * Contains elements in either set but not in both.
+     */
+    symmetricDifference(other: Iterable<T>): HashSet<T>;
+    /**
+     * Returns true if this set is a subset of the other set.
+     * All elements in this set are also in the other set.
+     */
+    isSubsetOf(other: Iterable<T>): boolean;
+    /**
+     * Returns true if this set is a superset of the other set.
+     * All elements in the other set are also in this set.
+     */
+    isSupersetOf(other: Iterable<T>): boolean;
+    /**
+     * Returns true if this set and the other set have no elements in common.
+     */
+    isDisjointFrom(other: Iterable<T>): boolean;
+    [Symbol.iterator](): Iterator<T>;
+    forEach(action: (element: T, index: number) => void): void;
+    toArray(): T[];
+    /**
+     * Creates a shallow copy of this set.
+     */
+    clone(): HashSet<T>;
+    /**
+     * Returns statistics about the underlying hash table.
+     */
+    getStats(): ReturnType<HashMap<T, symbol>["getStats"]>;
+    /**
+     * Returns a string representation for debugging.
+     */
+    toString(): string;
+}
+/**
+ * Factory function to create a HashSet.
+ *
+ * @example
+ * const set = hashSet<number>()
+ * const setFromArray = hashSet([1, 2, 3, 2, 1]) // {1, 2, 3}
+ * const setWithOptions = hashSet<string>({ initialCapacity: 32 })
+ */
+export declare function hashSet<T>(optionsOrElements?: HashSetOptions<T> | Iterable<T>): HashSet<T>;
+//# sourceMappingURL=hash-set.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hash-set.d.ts","sourceRoot":"","sources":["../../../src/collections/impl/hash-set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAQxC;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEX;;;OAGG;IACH,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;CAChB;AAED;;;;;;;GAOG;AACH,qBAAa,OAAO,CAAC,CAAC,CAAE,YAAW,GAAG,CAAC,CAAC,CAAC;IACvC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAqB;IAC1C,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;gBAEhB,OAAO,GAAE,cAAc,CAAC,CAAC,CAAM;IAqB3C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAMD,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAMxB,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAI3B,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAQ7B,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAUnC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAUtC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IA0BtC,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IASxC,KAAK,IAAI,IAAI;IAQb;;;OAGG;IACH,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAMrC;;;OAGG;IACH,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAa5C;;;OAGG;IACH,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAM1C;;;OAGG;IACH,mBAAmB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAOnD;;;OAGG;IACH,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAYvC;;;OAGG;IACH,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IASzC;;OAEG;IACH,cAAc,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO;IAa1C,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;IAO1D,OAAO,IAAI,CAAC,EAAE;IAQd;;OAEG;IACH,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC;IAMnB;;OAEG;IACH,QAAQ,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;IAItD;;OAEG;IACH,QAAQ,IAAI,MAAM;CAGnB;AAED;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,iBAAiB,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAClD,OAAO,CAAC,CAAC,CAAC,CASZ"}