@procedures/collections 0.47.1 → 0.48.0

package/dist/impl/linked-list.js

@@ -1,494 +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 { defaultEq, defaultCompare } from "../utils/defaults.js";
-/**
- * Internal node structure for the linked list.
- */
-class Node {
-    value;
-    prev;
-    next;
-    constructor(value, prev = null, next = null) {
-        this.value = value;
-        this.prev = prev;
-        this.next = next;
-    }
-}
-/**
- * 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 class LinkedList {
-    _head = null;
-    _tail = null;
-    _size = 0;
-    _eq;
-    constructor(options = {}) {
-        const { eq = defaultEq } = options;
-        this._eq = eq;
-    }
-    // ========================================================================
-    // Size
-    // ========================================================================
-    get size() {
-        return this._size;
-    }
-    get isEmpty() {
-        return this._size === 0;
-    }
-    get eq() {
-        return this._eq;
-    }
-    // ========================================================================
-    // Deque operations (both ends)
-    // ========================================================================
-    addFirst(element) {
-        const newNode = new Node(element, null, this._head);
-        if (this._head) {
-            this._head.prev = newNode;
-        }
-        this._head = newNode;
-        if (!this._tail) {
-            this._tail = newNode;
-        }
-        this._size++;
-    }
-    addLast(element) {
-        const newNode = new Node(element, this._tail, null);
-        if (this._tail) {
-            this._tail.next = newNode;
-        }
-        this._tail = newNode;
-        if (!this._head) {
-            this._head = newNode;
-        }
-        this._size++;
-    }
-    removeFirst() {
-        if (!this._head) {
-            throw new Error("List is empty");
-        }
-        return this.pollFirst();
-    }
-    removeLast() {
-        if (!this._tail) {
-            throw new Error("List is empty");
-        }
-        return this.pollLast();
-    }
-    pollFirst() {
-        if (!this._head)
-            return undefined;
-        const value = this._head.value;
-        this._head = this._head.next;
-        if (this._head) {
-            this._head.prev = null;
-        }
-        else {
-            this._tail = null;
-        }
-        this._size--;
-        return value;
-    }
-    pollLast() {
-        if (!this._tail)
-            return undefined;
-        const value = this._tail.value;
-        this._tail = this._tail.prev;
-        if (this._tail) {
-            this._tail.next = null;
-        }
-        else {
-            this._head = null;
-        }
-        this._size--;
-        return value;
-    }
-    peekFirst() {
-        if (!this._head) {
-            throw new Error("List is empty");
-        }
-        return this._head.value;
-    }
-    peekLast() {
-        if (!this._tail) {
-            throw new Error("List is empty");
-        }
-        return this._tail.value;
-    }
-    peekFirstOrUndefined() {
-        return this._head?.value;
-    }
-    peekLastOrUndefined() {
-        return this._tail?.value;
-    }
-    offerFirst(element) {
-        this.addFirst(element);
-        return true;
-    }
-    offerLast(element) {
-        this.addLast(element);
-        return true;
-    }
-    // ========================================================================
-    // Stack operations (LIFO at the end, as on a JavaScript array)
-    // ========================================================================
-    // push and pop work at the end, and shift/unshift at the front, in every collection of this
-    // package. Before, they worked at the front here (the Java Deque rule), so a LinkedList used
-    // as a List reversed the pushed elements (ARCHITECTURE-PROPOSALS P8).
-    push(element) {
-        this.addLast(element);
-    }
-    pop() {
-        return this.removeLast();
-    }
-    // ========================================================================
-    // Queue operations (FIFO)
-    // ========================================================================
-    offer(element) {
-        return this.offerLast(element);
-    }
-    poll() {
-        return this.removeFirst();
-    }
-    peek() {
-        return this.peekFirst();
-    }
-    peekOrUndefined() {
-        return this.peekFirstOrUndefined();
-    }
-    pollOrUndefined() {
-        return this.pollFirst();
-    }
-    enqueue(element) {
-        return this.offer(element);
-    }
-    dequeue() {
-        return this.poll();
-    }
-    // ========================================================================
-    // List operations
-    // ========================================================================
-    get(index) {
-        const node = this.getNode(index);
-        return node.value;
-    }
-    set(index, element) {
-        const node = this.getNode(index);
-        const old = node.value;
-        node.value = element;
-        return old;
-    }
-    insert(index, element) {
-        if (index < 0 || index > this._size) {
-            throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);
-        }
-        if (index === 0) {
-            this.addFirst(element);
-            return;
-        }
-        if (index === this._size) {
-            this.addLast(element);
-            return;
-        }
-        const nextNode = this.getNode(index);
-        const prevNode = nextNode.prev;
-        const newNode = new Node(element, prevNode, nextNode);
-        prevNode.next = newNode;
-        nextNode.prev = newNode;
-        this._size++;
-    }
-    insertAll(index, other) {
-        if (index < 0 || index > this._size) {
-            throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);
-        }
-        const elements = Array.from(other);
-        if (elements.length === 0)
-            return false;
-        for (let i = 0; i < elements.length; i++) {
-            this.insert(index + i, elements[i]);
-        }
-        return true;
-    }
-    removeAt(index) {
-        const node = this.getNode(index);
-        return this.unlinkNode(node);
-    }
-    removeRange(fromIndex, toIndex) {
-        if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {
-            throw new RangeError(`Invalid range [${fromIndex}, ${toIndex})`);
-        }
-        for (let i = fromIndex; i < toIndex; i++) {
-            this.removeAt(fromIndex);
-        }
-    }
-    indexOf(element, fromIndex = 0) {
-        let index = 0;
-        let node = this._head;
-        while (node) {
-            if (index >= fromIndex && this._eq(node.value, element)) {
-                return index;
-            }
-            node = node.next;
-            index++;
-        }
-        return -1;
-    }
-    lastIndexOf(element, fromIndex) {
-        const start = fromIndex !== undefined ? fromIndex : this._size - 1;
-        let index = this._size - 1;
-        let node = this._tail;
-        while (node && index >= 0) {
-            if (index <= start && this._eq(node.value, element)) {
-                return index;
-            }
-            node = node.prev;
-            index--;
-        }
-        return -1;
-    }
-    first() {
-        return this.peekFirst();
-    }
-    last() {
-        return this.peekLast();
-    }
-    shift() {
-        return this.removeFirst();
-    }
-    unshift(element) {
-        this.addFirst(element);
-    }
-    // ========================================================================
-    // Collection operations
-    // ========================================================================
-    add(element) {
-        this.addLast(element);
-        return true;
-    }
-    addAll(other) {
-        let modified = false;
-        for (const element of other) {
-            this.addLast(element);
-            modified = true;
-        }
-        return modified;
-    }
-    contains(element) {
-        return this.indexOf(element) !== -1;
-    }
-    containsAll(other) {
-        for (const element of other) {
-            if (!this.contains(element))
-                return false;
-        }
-        return true;
-    }
-    remove(element) {
-        let node = this._head;
-        while (node) {
-            if (this._eq(node.value, element)) {
-                this.unlinkNode(node);
-                return true;
-            }
-            node = node.next;
-        }
-        return false;
-    }
-    removeAll(other) {
-        const toRemove = new Set(other);
-        let modified = false;
-        for (const element of toRemove) {
-            while (this.remove(element)) {
-                modified = true;
-            }
-        }
-        return modified;
-    }
-    retainAll(other) {
-        const toRetain = new Set(other);
-        let node = this._head;
-        let modified = false;
-        while (node) {
-            const next = node.next;
-            let shouldRetain = false;
-            for (const retainElement of toRetain) {
-                if (this._eq(node.value, retainElement)) {
-                    shouldRetain = true;
-                    break;
-                }
-            }
-            if (!shouldRetain) {
-                this.unlinkNode(node);
-                modified = true;
-            }
-            node = next;
-        }
-        return modified;
-    }
-    clear() {
-        this._head = null;
-        this._tail = null;
-        this._size = 0;
-    }
-    // ========================================================================
-    // Sorting and reversing
-    // ========================================================================
-    sort(compare = defaultCompare) {
-        if (this._size <= 1)
-            return;
-        // Convert to array, sort, rebuild list
-        const array = this.toArray();
-        array.sort(compare);
-        this.clear();
-        for (const element of array) {
-            this.addLast(element);
-        }
-    }
-    reverse() {
-        if (this._size <= 1)
-            return;
-        let node = this._head;
-        this._head = this._tail;
-        this._tail = node;
-        while (node) {
-            const next = node.next;
-            node.next = node.prev;
-            node.prev = next;
-            node = next;
-        }
-    }
-    // ========================================================================
-    // Views
-    // ========================================================================
-    subList(fromIndex, toIndex) {
-        if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {
-            throw new RangeError(`Invalid range [${fromIndex}, ${toIndex})`);
-        }
-        const sub = new LinkedList({ eq: this._eq });
-        let index = 0;
-        let node = this._head;
-        while (node && index < toIndex) {
-            if (index >= fromIndex) {
-                sub.addLast(node.value);
-            }
-            node = node.next;
-            index++;
-        }
-        return sub;
-    }
-    // ========================================================================
-    // Iteration
-    // ========================================================================
-    *[Symbol.iterator]() {
-        let node = this._head;
-        while (node) {
-            yield node.value;
-            node = node.next;
-        }
-    }
-    forEach(action) {
-        let index = 0;
-        let node = this._head;
-        while (node) {
-            action(node.value, index);
-            node = node.next;
-            index++;
-        }
-    }
-    toArray() {
-        const result = [];
-        let node = this._head;
-        while (node) {
-            result.push(node.value);
-            node = node.next;
-        }
-        return result;
-    }
-    // ========================================================================
-    // Private helpers
-    // ========================================================================
-    getNode(index) {
-        if (index < 0 || index >= this._size) {
-            throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);
-        }
-        // Optimize: start from head or tail depending on index
-        if (index < this._size / 2) {
-            // Start from head
-            let node = this._head;
-            for (let i = 0; i < index; i++) {
-                node = node.next;
-            }
-            return node;
-        }
-        else {
-            // Start from tail
-            let node = this._tail;
-            for (let i = this._size - 1; i > index; i--) {
-                node = node.prev;
-            }
-            return node;
-        }
-    }
-    unlinkNode(node) {
-        const value = node.value;
-        if (node.prev) {
-            node.prev.next = node.next;
-        }
-        else {
-            this._head = node.next;
-        }
-        if (node.next) {
-            node.next.prev = node.prev;
-        }
-        else {
-            this._tail = node.prev;
-        }
-        this._size--;
-        return value;
-    }
-    // ========================================================================
-    // Inspection
-    // ========================================================================
-    toString() {
-        return `LinkedList[${this.toArray().join(", ")}]`;
-    }
-}
-/**
- * Factory function to create a LinkedList.
- *
- * @example
- * const list = linkedList<number>()
- * const listFromArray = linkedList([1, 2, 3])
- */
-export function linkedList(optionsOrElements) {
-    // Check if it's an iterable (not options)
-    if (optionsOrElements && Symbol.iterator in optionsOrElements) {
-        const list = new LinkedList();
-        list.addAll(optionsOrElements);
-        return list;
-    }
-    return new LinkedList(optionsOrElements);
-}
-//# sourceMappingURL=linked-list.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../../src/impl/linked-list.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEjE;;GAEG;AACH,MAAM,IAAI;IAEC,KAAK;IACL,IAAI;IACJ,IAAI;IAHb,YACS,KAAQ,EACR,IAAI,GAAmB,IAAI,EAC3B,IAAI,GAAmB,IAAI;qBAF3B,KAAK;oBACL,IAAI;oBACJ,IAAI;IACV,CAAC;CACL;AAaD;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,UAAU;IACb,KAAK,GAAmB,IAAI,CAAC;IAC7B,KAAK,GAAmB,IAAI,CAAC;IAC7B,KAAK,GAAW,CAAC,CAAC;IACT,GAAG,CAAQ;IAE5B,YAAY,OAAO,GAAyB,EAAE;QAC5C,MAAM,EAAE,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC;QACnC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;IAChB,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,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,+BAA+B;IAC/B,2EAA2E;IAE3E,QAAQ,CAAC,OAAU;QACjB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC;QAC5B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC;QAC5B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,WAAW;QACT,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,EAAG,CAAC;IAC3B,CAAC;IAED,UAAU;QACR,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,EAAG,CAAC;IAC1B,CAAC;IAED,SAAS;QACP,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAElC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAE7B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAElC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAE7B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS;QACP,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,oBAAoB;QAClB,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,mBAAmB;QACjB,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,UAAU,CAAC,OAAU;QACnB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,OAAU;QAClB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2EAA2E;IAC3E,+DAA+D;IAC/D,2EAA2E;IAE3E,4FAA4F;IAC5F,6FAA6F;IAC7F,sEAAsE;IACtE,IAAI,CAAC,OAAU;QACb,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACxB,CAAC;IAED,GAAG;QACD,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC3B,CAAC;IAED,2EAA2E;IAC3E,0BAA0B;IAC1B,2EAA2E;IAE3E,KAAK,CAAC,OAAU;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,oBAAoB,EAAE,CAAC;IACrC,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E,GAAG,CAAC,KAAa;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,OAAU;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,KAAa,EAAE,OAAU;QAC9B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,IAAI,UAAU,CAAC,SAAS,KAAK,2BAA2B,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACvB,OAAO;QACT,CAAC;QAED,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAK,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEtD,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC;QACxB,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,SAAS,CAAC,KAAa,EAAE,KAAkB;QACzC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,IAAI,UAAU,CAAC,SAAS,KAAK,2BAA2B,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAExC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,KAAa;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,WAAW,CAAC,SAAiB,EAAE,OAAe;QAC5C,IAAI,SAAS,GAAG,CAAC,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;YACjE,MAAM,IAAI,UAAU,CAAC,kBAAkB,SAAS,KAAK,OAAO,GAAG,CAAC,CAAC;QACnE,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,OAAU,EAAE,SAAS,GAAW,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEtB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,KAAK,IAAI,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;gBACxD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACjB,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,WAAW,CAAC,OAAU,EAAE,SAAkB;QACxC,MAAM,KAAK,GAAG,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACnE,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC3B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEtB,OAAO,IAAI,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YAC1B,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;gBACpD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACjB,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IACzB,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,2EAA2E;IAC3E,wBAAwB;IACxB,2EAA2E;IAE3E,GAAG,CAAC,OAAU;QACZ,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,KAAkB;QACvB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACtB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,OAAU;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,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,MAAM,CAAC,OAAU;QACf,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEtB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACtB,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,YAAY,GAAG,KAAK,CAAC;YAEzB,KAAK,MAAM,aAAa,IAAI,QAAQ,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;oBACxC,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACtB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YAED,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,wBAAwB;IACxB,2EAA2E;IAE3E,IAAI,CAAC,OAAO,GAAe,cAAc;QACvC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;YAAE,OAAO;QAE5B,uCAAuC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAEpB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;YAAE,OAAO;QAE5B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAElB,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,QAAQ;IACR,2EAA2E;IAE3E,OAAO,CAAC,SAAiB,EAAE,OAAe;QACxC,IAAI,SAAS,GAAG,CAAC,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;YACjE,MAAM,IAAI,UAAU,CAAC,kBAAkB,SAAS,KAAK,OAAO,GAAG,CAAC,CAAC;QACnE,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,UAAU,CAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEtB,OAAO,IAAI,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;YAC/B,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACjB,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2EAA2E;IAC3E,YAAY;IACZ,2EAA2E;IAE3E,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,IAAI,CAAC,KAAK,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAA2C;QACjD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEtB,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC1B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACjB,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEtB,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAEnE,OAAO,CAAC,KAAa;QAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,IAAI,UAAU,CAAC,SAAS,KAAK,2BAA2B,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,uDAAuD;QACvD,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YAC3B,kBAAkB;YAClB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,GAAG,IAAI,CAAC,IAAK,CAAC;YACpB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,kBAAkB;YAClB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,GAAG,IAAI,CAAC,IAAK,CAAC;YACpB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,IAAa;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QACzB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QACzB,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,aAAa;IACb,2EAA2E;IAE3E,QAAQ;QACN,OAAO,cAAc,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACpD,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACxB,iBAAsD;IAEtD,0CAA0C;IAC1C,IAAI,iBAAiB,IAAI,MAAM,CAAC,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,iBAAgC,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,UAAU,CAAI,iBAAyC,CAAC,CAAC;AACtE,CAAC"}

package/dist/impl/priority-queue.d.ts

@@ -1,139 +0,0 @@
-/**
- * PriorityQueue implementation - A binary heap-based priority queue.
- *
- * Elements are ordered according to their natural ordering (via comparator).
- * The head of the queue is the least element according to the comparator.
- * Provides O(log n) enqueue and O(log n) dequeue operations.
- * Mirrors java.util.PriorityQueue.
- *
- * @example
- * const pq = priorityQueue<number>((a, b) => a - b) // Min heap
- * pq.offer(5)
- * pq.offer(2)
- * pq.offer(8)
- * pq.poll() // 2 (smallest element)
- */
-import type { PriorityQueue as IPriorityQueue } from "../interfaces/queue.js";
-import type { Eq, Compare } from "../core/traits.js";
-/**
- * Options for creating a PriorityQueue.
- */
-export interface PriorityQueueOptions<T> {
-    /**
-     * Initial capacity of the heap.
-     * @default 11
-     */
-    initialCapacity?: number;
-    /**
-     * Comparator for ordering elements.
-     * Lower values have higher priority (min heap).
-     * @default defaultCompare
-     */
-    compare?: Compare<T>;
-    /**
-     * Equality function for elements.
-     * @default defaultEq
-     */
-    eq?: Eq<T>;
-}
-/**
- * PriorityQueue<T> - Binary heap implementation of priority queue.
- *
- * Elements are always retrieved in priority order (according to comparator).
- * Not a FIFO queue - order depends on priority, not insertion order.
- *
- * The heap is a min heap by default (smallest element has highest priority).
- * For max heap, use reversed comparator: (a, b) => compare(b, a)
- *
- * Not thread-safe. Use synchronized() behavior for concurrent access.
- */
-export declare class PriorityQueue<T> implements IPriorityQueue<T> {
-    private _heap;
-    private readonly _compare;
-    private readonly _eq;
-    constructor(options?: PriorityQueueOptions<T>);
-    get size(): number;
-    get isEmpty(): boolean;
-    get eq(): Eq<T>;
-    get compare(): Compare<T>;
-    get comparator(): Compare<T>;
-    offer(element: T): boolean;
-    poll(): T;
-    pollOrUndefined(): T | undefined;
-    peek(): T;
-    peekOrUndefined(): T | undefined;
-    enqueue(element: T): boolean;
-    dequeue(): T;
-    add(element: T): boolean;
-    addAll(other: Iterable<T>): boolean;
-    contains(element: T): boolean;
-    containsAll(other: Iterable<T>): boolean;
-    remove(element: T): boolean;
-    removeAll(other: Iterable<T>): boolean;
-    retainAll(other: Iterable<T>): boolean;
-    clear(): void;
-    /**
-     * Iterator returns elements in arbitrary order (not priority order).
-     * To get elements in priority order, repeatedly call poll().
-     */
-    [Symbol.iterator](): Iterator<T>;
-    forEach(action: (element: T, index: number) => void): void;
-    /**
-     * Returns elements in arbitrary heap order (not sorted).
-     */
-    toArray(): T[];
-    /**
-     * Returns elements in priority order (sorted).
-     * This is a destructive operation that drains the queue.
-     */
-    toSortedArray(): T[];
-    /**
-     * Bubbles an element up the heap to maintain heap property.
-     */
-    private bubbleUp;
-    /**
-     * Bubbles an element down the heap to maintain heap property.
-     *
-     * The element moves down through a hole: a smaller child moves up into the hole, and the
-     * element goes into the last hole. The children are compared with the element. (Before, they
-     * were compared with `_heap[index]`, which after the first step is a copy of the child that
-     * moved up: a poll could leave a larger element above a smaller one.)
-     */
-    private bubbleDown;
-    /**
-     * Rebuilds the heap from an arbitrary array.
-     * Uses Floyd's algorithm (O(n) time).
-     */
-    private heapify;
-    /**
-     * Creates a shallow copy of this priority queue.
-     */
-    clone(): PriorityQueue<T>;
-    /**
-     * Validates the heap property (for debugging).
-     * Returns true if the heap is valid.
-     */
-    validate(): boolean;
-    /**
-     * Returns a string representation for debugging.
-     */
-    toString(): string;
-}
-/**
- * Factory function to create a PriorityQueue.
- *
- * @example
- * // Min heap (default)
- * const minHeap = priorityQueue<number>()
- *
- * // Max heap
- * const maxHeap = priorityQueue<number>((a, b) => b - a)
- *
- * // From array
- * const pq = priorityQueue([5, 2, 8, 1, 9])
- *
- * // With custom comparator
- * const pq = priorityQueue<Task>((a, b) => a.priority - b.priority)
- */
-export declare function priorityQueue<T>(optionsOrElementsOrComparator?: PriorityQueueOptions<T> | Iterable<T> | Compare<T>): PriorityQueue<T>;
-//# sourceMappingURL=priority-queue.d.ts.map

package/dist/impl/priority-queue.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.d.ts","sourceRoot":"","sources":["../../src/impl/priority-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,aAAa,IAAI,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAC9E,OAAO,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAGrD;;GAEG;AACH,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACrC;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;;OAIG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAErB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACZ;AAED;;;;;;;;;;GAUG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,YAAW,cAAc,CAAC,CAAC,CAAC;IACxD,OAAO,CAAC,KAAK,CAAM;IACnB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAa;IACtC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAE5B,YAAY,OAAO,GAAE,oBAAoB,CAAC,CAAC,CAAM,EAYhD;IAMD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAED,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,CAExB;IAED,IAAI,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAE3B;IAMD,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAIzB;IAED,IAAI,IAAI,CAAC,CAKR;IAED,eAAe,IAAI,CAAC,GAAG,SAAS,CAe/B;IAED,IAAI,IAAI,CAAC,CAKR;IAED,eAAe,IAAI,CAAC,GAAG,SAAS,CAE/B;IAMD,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAE3B;IAED,OAAO,IAAI,CAAC,CAEX;IAMD,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAEvB;IAED,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAOlC;IAED,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAO5B;IAED,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAOvC;IAED,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAe1B;IAED,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAQrC;IAED,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAsBrC;IAED,KAAK,IAAI,IAAI,CAEZ;IAMD;;;OAGG;IACF,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAEhC;IAED,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAEzD;IAED;;OAEG;IACH,OAAO,IAAI,CAAC,EAAE,CAEb;IAED;;;OAGG;IACH,aAAa,IAAI,CAAC,EAAE,CASnB;IAMD;;OAEG;IACH,OAAO,CAAC,QAAQ;IAkBhB;;;;;;;OAOG;IACH,OAAO,CAAC,UAAU;IA8BlB;;;OAGG;IACH,OAAO,CAAC,OAAO;IAWf;;OAEG;IACH,KAAK,IAAI,aAAa,CAAC,CAAC,CAAC,CAOxB;IAED;;;OAGG;IACH,QAAQ,IAAI,OAAO,CAqBlB;IAED;;OAEG;IACH,QAAQ,IAAI,MAAM,CAEjB;CACF;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,6BAA6B,CAAC,EAC1B,oBAAoB,CAAC,CAAC,CAAC,GACvB,QAAQ,CAAC,CAAC,CAAC,GACX,OAAO,CAAC,CAAC,CAAC,GACb,aAAa,CAAC,CAAC,CAAC,CAkBlB"}