@procedures/collections 0.46.0 → 0.47.2

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

@@ -1,442 +0,0 @@
-/**
- * LinkedHashMap - HashMap that maintains insertion order.
- *
- * Combines a hash table with a doubly-linked list to maintain predictable
- * iteration order. Mirrors java.util.LinkedHashMap.
- *
- * Key features:
- * - O(1) access, insert, delete (like HashMap)
- * - Predictable iteration order (insertion order or access order)
- * - Perfect for LRU caches when accessOrder is true
- *
- * @example
- * const map = linkedHashMap<string, number>()
- * map.set('a', 1)
- * map.set('b', 2)
- * map.set('c', 3)
- * // Iteration order: a, b, c (insertion order)
- *
- * @example
- * // LRU cache with access order
- * const lru = linkedHashMap<string, number>({ accessOrder: true })
- * lru.set('a', 1)
- * lru.set('b', 2)
- * lru.get('a') // Moves 'a' to end
- * // Iteration order: b, a (access order)
- */
-import { defaultEq, defaultHash } from "../utils/defaults.js";
-/**
- * LinkedHashMap<K, V> - Hash map with predictable iteration order.
- *
- * Maintains a doubly-linked list of entries to preserve insertion order
- * (or access order if accessOrder is true).
- */
-export class LinkedHashMap {
-    _buckets;
-    _size = 0;
-    _loadFactor;
-    _eq;
-    _hash;
-    _valueEq;
-    _accessOrder;
-    // Doubly-linked list sentinels
-    _head = null;
-    _tail = null;
-    constructor(options = {}) {
-        const { initialCapacity = 16, loadFactor = 0.75, eq = defaultEq, hash = defaultHash, valueEq = defaultEq, accessOrder = false, } = options;
-        this._buckets = new Array(Math.max(1, initialCapacity)).fill(null);
-        this._loadFactor = loadFactor;
-        this._eq = eq;
-        this._hash = hash;
-        this._valueEq = valueEq;
-        this._accessOrder = accessOrder;
-    }
-    // ========================================================================
-    // Size and state
-    // ========================================================================
-    get size() {
-        return this._size;
-    }
-    get isEmpty() {
-        return this._size === 0;
-    }
-    get eq() {
-        return this._eq;
-    }
-    get keyEq() {
-        return this._eq;
-    }
-    get valueEq() {
-        return this._valueEq;
-    }
-    get hash() {
-        return this._hash;
-    }
-    // ========================================================================
-    // Lookup operations
-    // ========================================================================
-    has(key) {
-        return this.getNode(key) !== null;
-    }
-    containsKey(key) {
-        return this.has(key);
-    }
-    containsValue(value) {
-        let node = this._head;
-        while (node !== null) {
-            if (this._valueEq(node.value, value)) {
-                return true;
-            }
-            node = node.after;
-        }
-        return false;
-    }
-    get(key) {
-        const node = this.getNode(key);
-        if (node === null) {
-            throw new Error("Key not found");
-        }
-        if (this._accessOrder) {
-            this.moveToEnd(node);
-        }
-        return node.value;
-    }
-    getOrUndefined(key) {
-        const node = this.getNode(key);
-        if (node === null)
-            return undefined;
-        if (this._accessOrder) {
-            this.moveToEnd(node);
-        }
-        return node.value;
-    }
-    getOrDefault(key, defaultValue) {
-        const node = this.getNode(key);
-        if (node === null)
-            return defaultValue;
-        if (this._accessOrder) {
-            this.moveToEnd(node);
-        }
-        return node.value;
-    }
-    // ========================================================================
-    // Modification operations
-    // ========================================================================
-    set(key, value) {
-        const hashCode = this._hash(key);
-        const index = this.getBucketIndex(hashCode);
-        let node = this._buckets[index] ?? null;
-        // Check if key already exists
-        while (node !== null) {
-            if (node.hash === hashCode && this._eq(node.key, key)) {
-                const oldValue = node.value;
-                node.value = value;
-                if (this._accessOrder) {
-                    this.moveToEnd(node);
-                }
-                return oldValue;
-            }
-            node = node.next;
-        }
-        // Key doesn't exist, add new entry
-        const newNode = {
-            key,
-            value,
-            hash: hashCode,
-            next: this._buckets[index] ?? null,
-            before: null,
-            after: null,
-        };
-        this._buckets[index] = newNode;
-        this._size++;
-        // Add to linked list
-        this.addToEnd(newNode);
-        // Resize if needed
-        if (this._size > this._buckets.length * this._loadFactor) {
-            this.resize();
-        }
-        return undefined;
-    }
-    setIfAbsent(key, value) {
-        const existing = this.getNode(key);
-        if (existing !== null) {
-            if (this._accessOrder) {
-                this.moveToEnd(existing);
-            }
-            return existing.value;
-        }
-        this.set(key, value);
-        return value;
-    }
-    replace(key, value) {
-        const node = this.getNode(key);
-        if (node === null)
-            return undefined;
-        const oldValue = node.value;
-        node.value = value;
-        if (this._accessOrder) {
-            this.moveToEnd(node);
-        }
-        return oldValue;
-    }
-    replaceEntry(key, oldValue, newValue) {
-        const node = this.getNode(key);
-        if (node === null || !this._valueEq(node.value, oldValue)) {
-            return false;
-        }
-        node.value = newValue;
-        if (this._accessOrder) {
-            this.moveToEnd(node);
-        }
-        return true;
-    }
-    delete(key) {
-        const node = this.getNode(key);
-        if (node === null)
-            return undefined;
-        const oldValue = node.value;
-        // Remove from bucket
-        this.removeFromBucket(node);
-        // Remove from linked list
-        this.removeFromList(node);
-        this._size--;
-        return oldValue;
-    }
-    deleteEntry(key, value) {
-        const node = this.getNode(key);
-        if (node === null || !this._valueEq(node.value, value)) {
-            return false;
-        }
-        // Remove from bucket
-        this.removeFromBucket(node);
-        // Remove from linked list
-        this.removeFromList(node);
-        this._size--;
-        return true;
-    }
-    clear() {
-        this._buckets = new Array(this._buckets.length).fill(null);
-        this._size = 0;
-        this._head = null;
-        this._tail = null;
-    }
-    // ========================================================================
-    // Bulk operations
-    // ========================================================================
-    putAll(other) {
-        if ('entries' in other && typeof other.entries === 'function') {
-            for (const entry of other.entries()) {
-                this.set(entry.key, entry.value);
-            }
-        }
-        else {
-            for (const entry of other) {
-                this.set(entry.key, entry.value);
-            }
-        }
-    }
-    // ========================================================================
-    // Computed operations
-    // ========================================================================
-    computeIfAbsent(key, mappingFunction) {
-        const existing = this.getNode(key);
-        if (existing !== null) {
-            if (this._accessOrder) {
-                this.moveToEnd(existing);
-            }
-            return existing.value;
-        }
-        const value = mappingFunction(key);
-        this.set(key, value);
-        return value;
-    }
-    computeIfPresent(key, remappingFunction) {
-        const existing = this.getNode(key);
-        if (existing === null)
-            return undefined;
-        const newValue = remappingFunction(key, existing.value);
-        if (newValue === undefined) {
-            this.delete(key);
-            return undefined;
-        }
-        existing.value = newValue;
-        if (this._accessOrder) {
-            this.moveToEnd(existing);
-        }
-        return newValue;
-    }
-    compute(key, remappingFunction) {
-        const existing = this.getNode(key);
-        const newValue = remappingFunction(key, existing?.value);
-        if (newValue === undefined) {
-            if (existing !== null) {
-                this.delete(key);
-            }
-            return undefined;
-        }
-        this.set(key, newValue);
-        return newValue;
-    }
-    merge(key, value, remappingFunction) {
-        const existing = this.getNode(key);
-        if (existing === null) {
-            this.set(key, value);
-            return value;
-        }
-        const merged = remappingFunction(existing.value, value);
-        if (merged === undefined) {
-            this.delete(key);
-            return undefined;
-        }
-        existing.value = merged;
-        if (this._accessOrder) {
-            this.moveToEnd(existing);
-        }
-        return merged;
-    }
-    // ========================================================================
-    // View operations
-    // ========================================================================
-    *keys() {
-        let node = this._head;
-        while (node !== null) {
-            yield node.key;
-            node = node.after;
-        }
-    }
-    *values() {
-        let node = this._head;
-        while (node !== null) {
-            yield node.value;
-            node = node.after;
-        }
-    }
-    *entries() {
-        let node = this._head;
-        while (node !== null) {
-            yield { key: node.key, value: node.value };
-            node = node.after;
-        }
-    }
-    *[Symbol.iterator]() {
-        yield* this.entries();
-    }
-    forEach(action) {
-        for (const entry of this.entries()) {
-            action(entry.value, entry.key, this);
-        }
-    }
-    toArray() {
-        return Array.from(this.entries());
-    }
-    // ========================================================================
-    // Private helpers
-    // ========================================================================
-    getNode(key) {
-        const hashCode = this._hash(key);
-        const index = this.getBucketIndex(hashCode);
-        let node = this._buckets[index] ?? null;
-        while (node !== null) {
-            if (node.hash === hashCode && this._eq(node.key, key)) {
-                return node;
-            }
-            node = node.next;
-        }
-        return null;
-    }
-    getBucketIndex(hashCode) {
-        return Math.abs(hashCode) % this._buckets.length;
-    }
-    removeFromBucket(node) {
-        const index = this.getBucketIndex(node.hash);
-        let current = this._buckets[index] ?? null;
-        let prev = null;
-        while (current !== null) {
-            if (current === node) {
-                if (prev === null) {
-                    this._buckets[index] = current.next;
-                }
-                else {
-                    prev.next = current.next;
-                }
-                return;
-            }
-            prev = current;
-            current = current.next;
-        }
-    }
-    addToEnd(node) {
-        node.before = this._tail;
-        node.after = null;
-        if (this._tail === null)
-            this._head = node;
-        else
-            this._tail.after = node;
-        this._tail = node;
-    }
-    removeFromList(node) {
-        if (node.before !== null)
-            node.before.after = node.after;
-        else
-            this._head = node.after;
-        if (node.after !== null)
-            node.after.before = node.before;
-        else
-            this._tail = node.before;
-        node.before = node.after = null;
-    }
-    moveToEnd(node) {
-        if (node === this._tail)
-            return; // Already at end
-        this.removeFromList(node);
-        this.addToEnd(node);
-    }
-    resize() {
-        this._buckets = new Array(this._buckets.length * 2).fill(null);
-        // Rebuild the bucket chains (`next`) from the order list (`after`)
-        for (let node = this._head; node !== null; node = node.after) {
-            const index = this.getBucketIndex(node.hash);
-            node.next = this._buckets[index] ?? null;
-            this._buckets[index] = node;
-        }
-    }
-    // ========================================================================
-    // Utility methods
-    // ========================================================================
-    toString() {
-        const entries = Array.from(this.entries())
-            .map(({ key, value }) => `${key}=${value}`)
-            .join(', ');
-        return `LinkedHashMap{${entries}}`;
-    }
-}
-/**
- * Factory function to create a LinkedHashMap.
- *
- * @example
- * const map = linkedHashMap<string, number>()
- * map.set('a', 1)
- * map.set('b', 2)
- *
- * @example
- * // With initial entries
- * const map = linkedHashMap<string, number>([
- *   ['a', 1],
- *   ['b', 2]
- * ])
- *
- * @example
- * // LRU cache with access order
- * const lru = linkedHashMap<string, number>({ accessOrder: true })
- */
-export function linkedHashMap(optionsOrEntries) {
-    if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {
-        const map = new LinkedHashMap();
-        for (const [key, value] of optionsOrEntries) {
-            map.set(key, value);
-        }
-        return map;
-    }
-    return new LinkedHashMap(optionsOrEntries);
-}
-//# sourceMappingURL=linked-hash-map.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"linked-hash-map.js","sourceRoot":"","sources":["../../src/impl/linked-hash-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAIH,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AA6D9D;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IAChB,QAAQ,CAA8B;IACtC,KAAK,GAAW,CAAC,CAAC;IACT,WAAW,CAAS;IACpB,GAAG,CAAQ;IACX,KAAK,CAAU;IACf,QAAQ,CAAQ;IAChB,YAAY,CAAU;IAEvC,+BAA+B;IACvB,KAAK,GAA4B,IAAI,CAAC;IACtC,KAAK,GAA4B,IAAI,CAAC;IAE9C,YAAY,OAAO,GAA+B,EAAE;QAClD,MAAM,EACJ,eAAe,GAAG,EAAE,EACpB,UAAU,GAAG,IAAI,EACjB,EAAE,GAAG,SAAS,EACd,IAAI,GAAG,WAAW,EAClB,OAAO,GAAG,SAAS,EACnB,WAAW,GAAG,KAAK,GACpB,GAAG,OAAO,CAAC;QAEZ,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IAED,2EAA2E;IAC3E,iBAAiB;IACjB,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,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,2EAA2E;IAC3E,oBAAoB;IACpB,2EAA2E;IAE3E,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;IACpC,CAAC;IAED,WAAW,CAAC,GAAM;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,aAAa,CAAC,KAAQ;QACpB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBACrC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,cAAc,CAAC,GAAM;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,SAAS,CAAC;QACpC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,YAAY,CAAC,GAAM,EAAE,YAAe;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,YAAY,CAAC;QACvC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,2EAA2E;IAC3E,0BAA0B;IAC1B,2EAA2E;IAE3E,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC5C,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,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;gBACD,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,mCAAmC;QACnC,MAAM,OAAO,GAAqB;YAChC,GAAG;YACH,KAAK;YACL,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI;YAClC,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,IAAI;SACZ,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,qBAAqB;QACrB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEvB,mBAAmB;QACnB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACzD,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,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YAC3B,CAAC;YACD,OAAO,QAAQ,CAAC,KAAK,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,GAAM,EAAE,KAAQ;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,SAAS,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,YAAY,CAAC,GAAM,EAAE,QAAW,EAAE,QAAW;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QACtB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,SAAS,CAAC;QAEpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;QAE5B,qBAAqB;QACrB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAE5B,0BAA0B;QAC1B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAE1B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,WAAW,CAAC,GAAM,EAAE,KAAQ;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YACvD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,qBAAqB;QACrB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAE5B,0BAA0B;QAC1B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAE1B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,MAAM,CAAC,KAA4C;QACjD,IAAI,SAAS,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;YAC9D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,KAAK,IAAI,KAA8B,EAAE,CAAC;gBACnD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,sBAAsB;IACtB,2EAA2E;IAE3E,eAAe,CAAC,GAAM,EAAE,eAA8B;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YAC3B,CAAC;YACD,OAAO,QAAQ,CAAC,KAAK,CAAC;QACxB,CAAC;QACD,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gBAAgB,CAAC,GAAM,EAAE,iBAAsD;QAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO,SAAS,CAAC;QAExC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC;QAC1B,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,GAAM,EAAE,iBAAkE;QAChF,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAEzD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;gBACtB,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,CAAC,GAAM,EAAE,KAAQ,EAAE,iBAA8D;QACpF,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,QAAQ,CAAC,KAAK,GAAG,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,CAAC,IAAI;QACH,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC,GAAG,CAAC;YACf,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,CAAC,MAAM;QACL,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC,KAAK,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,CAAC,OAAO;QACN,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3C,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,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,OAAO;QACL,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAEnE,OAAO,CAAC,GAAM;QACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC5C,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,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACtD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,cAAc,CAAC,QAAgB;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IACnD,CAAC;IAEO,gBAAgB,CAAC,IAAsB;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;QAC3C,IAAI,IAAI,GAA4B,IAAI,CAAC;QAEzC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;gBACD,OAAO;YACT,CAAC;YACD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAEO,QAAQ,CAAC,IAAsB;QACrC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;;YACtC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEO,cAAc,CAAC,IAAsB;QAC3C,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;;YACpD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC7B,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;;YACpD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IAClC,CAAC;IAEO,SAAS,CAAC,IAAsB;QACtC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,iBAAiB;QAClD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAEO,MAAM;QACZ,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,mEAAmE;QACnE,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;YACzC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,QAAQ;QACN,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;aACvC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,KAAK,EAAE,CAAC;aAC1C,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,OAAO,iBAAiB,OAAO,GAAG,CAAC;IACrC,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,aAAa,CAC3B,gBAAgE;IAEhE,IAAI,gBAAgB,IAAI,MAAM,CAAC,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAI,aAAa,EAAQ,CAAC;QACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,gBAAoC,EAAE,CAAC;YAChE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,IAAI,aAAa,CAAO,gBAA8C,CAAC,CAAC;AACjF,CAAC"}

package/dist/impl/linked-list.d.ts

@@ -1,109 +0,0 @@
-/**
- * LinkedList implementation - A doubly-linked list.
- *
- * Provides O(1) insertion/removal at both ends and at known positions.
- * Slower random access O(n) compared to ArrayList.
- * Mirrors java.util.LinkedList.
- *
- * @example
- * const list = linkedList<number>()
- * list.addFirst(1)
- * list.addLast(2)
- * list.add(3)
- */
-import type { List } from "../interfaces/list.js";
-import type { Deque } from "../interfaces/queue.js";
-import type { Eq, Compare } from "../core/traits.js";
-/**
- * Options for creating a LinkedList.
- */
-export interface LinkedListOptions<T> {
-    /**
-     * Equality function for comparing elements.
-     * @default defaultEq (===)
-     */
-    eq?: Eq<T>;
-}
-/**
- * LinkedList<T> - Doubly-linked list implementation.
- *
- * Efficient for:
- * - Insertion/removal at ends: O(1)
- * - Insertion/removal at known position: O(1)
- * - Sequential iteration: O(n)
- *
- * Not efficient for:
- * - Random access by index: O(n)
- * - Search: O(n)
- *
- * Implements both List and Deque interfaces.
- */
-export declare class LinkedList<T> implements List<T>, Deque<T> {
-    private _head;
-    private _tail;
-    private _size;
-    private readonly _eq;
-    constructor(options?: LinkedListOptions<T>);
-    get size(): number;
-    get isEmpty(): boolean;
-    get eq(): Eq<T>;
-    addFirst(element: T): void;
-    addLast(element: T): void;
-    removeFirst(): T;
-    removeLast(): T;
-    pollFirst(): T | undefined;
-    pollLast(): T | undefined;
-    peekFirst(): T;
-    peekLast(): T;
-    peekFirstOrUndefined(): T | undefined;
-    peekLastOrUndefined(): T | undefined;
-    offerFirst(element: T): boolean;
-    offerLast(element: T): boolean;
-    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;
-    get(index: number): T;
-    set(index: number, element: T): T;
-    insert(index: number, element: T): void;
-    insertAll(index: number, other: Iterable<T>): boolean;
-    removeAt(index: number): T;
-    removeRange(fromIndex: number, toIndex: number): void;
-    indexOf(element: T, fromIndex?: number): number;
-    lastIndexOf(element: T, fromIndex?: number): number;
-    first(): T;
-    last(): T;
-    shift(): T;
-    unshift(element: T): void;
-    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;
-    sort(compare?: Compare<T>): void;
-    reverse(): void;
-    subList(fromIndex: number, toIndex: number): List<T>;
-    [Symbol.iterator](): Iterator<T>;
-    forEach(action: (element: T, index: number) => void): void;
-    toArray(): T[];
-    private getNode;
-    private unlinkNode;
-    toString(): string;
-}
-/**
- * Factory function to create a LinkedList.
- *
- * @example
- * const list = linkedList<number>()
- * const listFromArray = linkedList([1, 2, 3])
- */
-export declare function linkedList<T>(optionsOrElements?: LinkedListOptions<T> | Iterable<T>): LinkedList<T>;
-//# sourceMappingURL=linked-list.d.ts.map

package/dist/impl/linked-list.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"linked-list.d.ts","sourceRoot":"","sources":["../../src/impl/linked-list.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAcrD;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAClC;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACZ;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACrD,OAAO,CAAC,KAAK,CAAwB;IACrC,OAAO,CAAC,KAAK,CAAwB;IACrC,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAE5B,YAAY,OAAO,GAAE,iBAAiB,CAAC,CAAC,CAAM,EAG7C;IAMD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAMD,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAUzB;IAED,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAUxB;IAED,WAAW,IAAI,CAAC,CAKf;IAED,UAAU,IAAI,CAAC,CAKd;IAED,SAAS,IAAI,CAAC,GAAG,SAAS,CAczB;IAED,QAAQ,IAAI,CAAC,GAAG,SAAS,CAcxB;IAED,SAAS,IAAI,CAAC,CAKb;IAED,QAAQ,IAAI,CAAC,CAKZ;IAED,oBAAoB,IAAI,CAAC,GAAG,SAAS,CAEpC;IAED,mBAAmB,IAAI,CAAC,GAAG,SAAS,CAEnC;IAED,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAG9B;IAED,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAG7B;IASD,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAErB;IAED,GAAG,IAAI,CAAC,CAEP;IAMD,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAEzB;IAED,IAAI,IAAI,CAAC,CAER;IAED,IAAI,IAAI,CAAC,CAER;IAED,eAAe,IAAI,CAAC,GAAG,SAAS,CAE/B;IAED,eAAe,IAAI,CAAC,GAAG,SAAS,CAE/B;IAED,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAE3B;IAED,OAAO,IAAI,CAAC,CAEX;IAMD,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAGpB;IAED,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAKhC;IAED,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAsBtC;IAED,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAapD;IAED,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAGzB;IAED,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAQpD;IAED,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,GAAE,MAAU,GAAG,MAAM,CAajD;IAED,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAclD;IAED,KAAK,IAAI,CAAC,CAET;IAED,IAAI,IAAI,CAAC,CAER;IAED,KAAK,IAAI,CAAC,CAET;IAED,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAExB;IAMD,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAGvB;IAED,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAOlC;IAED,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAE5B;IAED,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAKvC;IAED,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAY1B;IAED,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAWrC;IAED,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAyBrC;IAED,KAAK,IAAI,IAAI,CAIZ;IAMD,IAAI,CAAC,OAAO,GAAE,OAAO,CAAC,CAAC,CAAkB,GAAG,IAAI,CAW/C;IAED,OAAO,IAAI,IAAI,CAad;IAMD,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAkBnD;IAMA,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAMhC;IAED,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CASzD;IAED,OAAO,IAAI,CAAC,EAAE,CAUb;IAMD,OAAO,CAAC,OAAO;IAuBf,OAAO,CAAC,UAAU;IAuBlB,QAAQ,IAAI,MAAM,CAEjB;CACF;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,iBAAiB,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GACrD,UAAU,CAAC,CAAC,CAAC,CASf"}