@procedures/collections 0.47.1 → 0.48.0

package/dist/impl/priority-queue.js

@@ -1,343 +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 { defaultEq, defaultCompare } from "../utils/defaults.js";
-/**
- * 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 class PriorityQueue {
-    _heap;
-    _compare;
-    _eq;
-    constructor(options = {}) {
-        const { compare = defaultCompare, eq = defaultEq, } = options;
-        // The heap starts empty: a JavaScript array grows by itself, so initialCapacity is only a
-        // hint. (Before, `new Array(initialCapacity)` made 11 holes: an empty queue had size 11,
-        // and the heap compared holes. BUGS-2026-07 C9.)
-        this._heap = [];
-        this._compare = compare;
-        this._eq = eq;
-    }
-    // ========================================================================
-    // Size
-    // ========================================================================
-    get size() {
-        return this._heap.length;
-    }
-    get isEmpty() {
-        return this._heap.length === 0;
-    }
-    get eq() {
-        return this._eq;
-    }
-    get compare() {
-        return this._compare;
-    }
-    get comparator() {
-        return this._compare;
-    }
-    // ========================================================================
-    // Priority queue operations
-    // ========================================================================
-    offer(element) {
-        this._heap.push(element);
-        this.bubbleUp(this._heap.length - 1);
-        return true;
-    }
-    poll() {
-        if (this.isEmpty) {
-            throw new Error("Priority queue is empty");
-        }
-        return this.pollOrUndefined();
-    }
-    pollOrUndefined() {
-        if (this.isEmpty) {
-            return undefined;
-        }
-        const result = this._heap[0];
-        if (this._heap.length === 1) {
-            this._heap.pop();
-        }
-        else {
-            this._heap[0] = this._heap.pop();
-            this.bubbleDown(0);
-        }
-        return result;
-    }
-    peek() {
-        if (this.isEmpty) {
-            throw new Error("Priority queue is empty");
-        }
-        return this._heap[0];
-    }
-    peekOrUndefined() {
-        return this.isEmpty ? undefined : this._heap[0];
-    }
-    // ========================================================================
-    // Queue interface compatibility
-    // ========================================================================
-    enqueue(element) {
-        return this.offer(element);
-    }
-    dequeue() {
-        return this.poll();
-    }
-    // ========================================================================
-    // Collection operations
-    // ========================================================================
-    add(element) {
-        return this.offer(element);
-    }
-    addAll(other) {
-        let modified = false;
-        for (const element of other) {
-            this.offer(element);
-            modified = true;
-        }
-        return modified;
-    }
-    contains(element) {
-        for (const item of this._heap) {
-            if (this._eq(item, element)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    containsAll(other) {
-        for (const element of other) {
-            if (!this.contains(element)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    remove(element) {
-        const index = this._heap.findIndex((item) => this._eq(item, element));
-        if (index === -1) {
-            return false;
-        }
-        if (index === this._heap.length - 1) {
-            this._heap.pop();
-        }
-        else {
-            this._heap[index] = this._heap.pop();
-            this.bubbleDown(index);
-            this.bubbleUp(index);
-        }
-        return true;
-    }
-    removeAll(other) {
-        let modified = false;
-        for (const element of other) {
-            while (this.remove(element)) {
-                modified = true;
-            }
-        }
-        return modified;
-    }
-    retainAll(other) {
-        const toRetain = new Set(other);
-        const newHeap = [];
-        for (const element of this._heap) {
-            let shouldRetain = false;
-            for (const retainElement of toRetain) {
-                if (this._eq(element, retainElement)) {
-                    shouldRetain = true;
-                    break;
-                }
-            }
-            if (shouldRetain) {
-                newHeap.push(element);
-            }
-        }
-        const modified = newHeap.length !== this._heap.length;
-        this._heap = newHeap;
-        this.heapify();
-        return modified;
-    }
-    clear() {
-        this._heap = [];
-    }
-    // ========================================================================
-    // Iteration
-    // ========================================================================
-    /**
-     * Iterator returns elements in arbitrary order (not priority order).
-     * To get elements in priority order, repeatedly call poll().
-     */
-    *[Symbol.iterator]() {
-        yield* this._heap;
-    }
-    forEach(action) {
-        this._heap.forEach((element, index) => action(element, index));
-    }
-    /**
-     * Returns elements in arbitrary heap order (not sorted).
-     */
-    toArray() {
-        return this._heap.slice();
-    }
-    /**
-     * Returns elements in priority order (sorted).
-     * This is a destructive operation that drains the queue.
-     */
-    toSortedArray() {
-        const result = [];
-        const clone = this.clone();
-        while (!clone.isEmpty) {
-            result.push(clone.poll());
-        }
-        return result;
-    }
-    // ========================================================================
-    // Heap operations
-    // ========================================================================
-    /**
-     * Bubbles an element up the heap to maintain heap property.
-     */
-    bubbleUp(index) {
-        const element = this._heap[index];
-        while (index > 0) {
-            const parentIndex = Math.floor((index - 1) / 2);
-            const parent = this._heap[parentIndex];
-            if (this._compare(element, parent) >= 0) {
-                break;
-            }
-            this._heap[index] = parent;
-            index = parentIndex;
-        }
-        this._heap[index] = element;
-    }
-    /**
-     * 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.)
-     */
-    bubbleDown(index) {
-        const length = this._heap.length;
-        const element = this._heap[index];
-        while (true) {
-            const leftChildIndex = 2 * index + 1;
-            const rightChildIndex = 2 * index + 2;
-            if (leftChildIndex >= length) {
-                break;
-            }
-            let childIndex = leftChildIndex;
-            if (rightChildIndex < length &&
-                this._compare(this._heap[rightChildIndex], this._heap[leftChildIndex]) < 0) {
-                childIndex = rightChildIndex;
-            }
-            if (this._compare(this._heap[childIndex], element) >= 0) {
-                break;
-            }
-            this._heap[index] = this._heap[childIndex];
-            index = childIndex;
-        }
-        this._heap[index] = element;
-    }
-    /**
-     * Rebuilds the heap from an arbitrary array.
-     * Uses Floyd's algorithm (O(n) time).
-     */
-    heapify() {
-        // Start from last non-leaf node and bubble down
-        for (let i = Math.floor(this._heap.length / 2) - 1; i >= 0; i--) {
-            this.bubbleDown(i);
-        }
-    }
-    // ========================================================================
-    // Utility methods
-    // ========================================================================
-    /**
-     * Creates a shallow copy of this priority queue.
-     */
-    clone() {
-        const clone = new PriorityQueue({
-            compare: this._compare,
-            eq: this._eq,
-        });
-        clone._heap = this._heap.slice();
-        return clone;
-    }
-    /**
-     * Validates the heap property (for debugging).
-     * Returns true if the heap is valid.
-     */
-    validate() {
-        for (let i = 0; i < this._heap.length; i++) {
-            const leftChildIndex = 2 * i + 1;
-            const rightChildIndex = 2 * i + 2;
-            if (leftChildIndex < this._heap.length &&
-                this._compare(this._heap[i], this._heap[leftChildIndex]) > 0) {
-                return false;
-            }
-            if (rightChildIndex < this._heap.length &&
-                this._compare(this._heap[i], this._heap[rightChildIndex]) > 0) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Returns a string representation for debugging.
-     */
-    toString() {
-        return `PriorityQueue[${this._heap.join(", ")}]`;
-    }
-}
-/**
- * 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 function priorityQueue(optionsOrElementsOrComparator) {
-    // If it's a function, treat it as a comparator
-    if (typeof optionsOrElementsOrComparator === "function") {
-        return new PriorityQueue({
-            compare: optionsOrElementsOrComparator,
-        });
-    }
-    // Check if it's an iterable (not options)
-    if (optionsOrElementsOrComparator && Symbol.iterator in optionsOrElementsOrComparator) {
-        const pq = new PriorityQueue();
-        pq.addAll(optionsOrElementsOrComparator);
-        return pq;
-    }
-    return new PriorityQueue(optionsOrElementsOrComparator);
-}
-//# sourceMappingURL=priority-queue.js.map

package/dist/impl/priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../src/impl/priority-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AA0BjE;;;;;;;;;;GAUG;AACH,MAAM,OAAO,aAAa;IAChB,KAAK,CAAM;IACF,QAAQ,CAAa;IACrB,GAAG,CAAQ;IAE5B,YAAY,OAAO,GAA4B,EAAE;QAC/C,MAAM,EACJ,OAAO,GAAG,cAAc,EACxB,EAAE,GAAG,SAAS,GACf,GAAG,OAAO,CAAC;QAEZ,0FAA0F;QAC1F,yFAAyF;QACzF,iDAAiD;QACjD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,OAAO;IACP,2EAA2E;IAE3E,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,2EAA2E;IAC3E,4BAA4B;IAC5B,2EAA2E;IAE3E,KAAK,CAAC,OAAU;QACd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,EAAG,CAAC;IACjC,CAAC;IAED,eAAe;QACb,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAE7B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;IACxB,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,2EAA2E;IAC3E,gCAAgC;IAChC,2EAA2E;IAE3E,OAAO,CAAC,OAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IAED,2EAA2E;IAC3E,wBAAwB;IACxB,2EAA2E;IAE3E,GAAG,CAAC,OAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,KAAkB;QACvB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACpB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,OAAU;QACjB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,WAAW,CAAC,KAAkB;QAC5B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,OAAU;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QACtE,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,KAAkB;QAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,OAAO,GAAQ,EAAE,CAAC;QAExB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,KAAK,MAAM,aAAa,IAAI,QAAQ,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;oBACrC,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,YAAY,EAAE,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACtD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;QAEf,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,YAAY;IACZ,2EAA2E;IAE3E;;;OAGG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,MAA2C;QACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;IACjE,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,aAAa;QACX,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAE3B,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC5B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E;;OAEG;IACK,QAAQ,CAAC,KAAa;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC;QAEnC,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAE,CAAC;YAExC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,MAAM;YACR,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;YAC3B,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;IAC9B,CAAC;IAED;;;;;;;OAOG;IACK,UAAU,CAAC,KAAa;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC;QAEnC,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACrC,MAAM,eAAe,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACtC,IAAI,cAAc,IAAI,MAAM,EAAE,CAAC;gBAC7B,MAAM;YACR,CAAC;YAED,IAAI,UAAU,GAAG,cAAc,CAAC;YAChC,IACE,eAAe,GAAG,MAAM;gBACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAE,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,CAAE,CAAC,GAAG,CAAC,EAC5E,CAAC;gBACD,UAAU,GAAG,eAAe,CAAC;YAC/B,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzD,MAAM;YACR,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,CAAC;YAC5C,KAAK,GAAG,UAAU,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACK,OAAO;QACb,gDAAgD;QAChD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAE3E;;OAEG;IACH,KAAK;QACH,MAAM,KAAK,GAAG,IAAI,aAAa,CAAI;YACjC,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,EAAE,EAAE,IAAI,CAAC,GAAG;SACb,CAAC,CAAC;QACH,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAElC,IACE,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBAClC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,CAAE,CAAC,GAAG,CAAC,EAC9D,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IACE,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAC,eAAe,CAAE,CAAC,GAAG,CAAC,EAC/D,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,iBAAiB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACnD,CAAC;CACF;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,aAAa,CAC3B,6BAGc;IAEd,+CAA+C;IAC/C,IAAI,OAAO,6BAA6B,KAAK,UAAU,EAAE,CAAC;QACxD,OAAO,IAAI,aAAa,CAAI;YAC1B,OAAO,EAAE,6BAA2C;SACrD,CAAC,CAAC;IACL,CAAC;IAED,0CAA0C;IAC1C,IAAI,6BAA6B,IAAI,MAAM,CAAC,QAAQ,IAAI,6BAA6B,EAAE,CAAC;QACtF,MAAM,EAAE,GAAG,IAAI,aAAa,EAAK,CAAC;QAClC,EAAE,CAAC,MAAM,CAAC,6BAA4C,CAAC,CAAC;QACxD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,IAAI,aAAa,CACtB,6BAAwD,CACzD,CAAC;AACJ,CAAC"}

package/dist/impl/summary-tree.d.ts

@@ -1,146 +0,0 @@
-/**
- * SummaryTree: a persistent sequence of leaves with a summary of each part.
- *
- * The tree is a balanced binary tree (AVL) with one leaf in each node. Each node keeps the summary of its subtree.
- * A summary is a value of a monoid: the caller gives the monoid as data, with `empty` and `combine`. The order of the
- * leaves is kept, so `combine` must be associative, but it can be non-commutative.
- *
- * Each operation returns a new tree and keeps the old tree. The two trees share the nodes that did not change.
- * Concatenation, a split at an index or at a summary search, an edit and a lookup are O(log n).
- *
- * The algorithms are the "join" algorithms of Blelloch, Ferizovic and Sun, "Just Join for Parallel Ordered Sets"
- * (SPAA 2016).
- *
- * @example
- * // The number of leaves and the total length of the strings
- * const spec = {
- *   monoid: { empty: { count: 0, length: 0 }, combine: (a, b) => ({ count: a.count + b.count, length: a.length + b.length }) },
- *   measure: (leaf: string) => ({ count: 1, length: leaf.length }),
- * };
- * const tree = summaryTree(spec, ["ab", "cde", "f"]);
- * tree.summary; // { count: 3, length: 6 }
- * const [left, right] = tree.split((prefix) => prefix.length > 2); // left: ["ab"], right: ["cde", "f"]
- */
-/** A monoid as data: the identity value `empty` and an associative operation `combine`. */
-export interface SummaryMonoid<Summary> {
-    /** The summary of a sequence with no leaf. `combine(empty, s)` and `combine(s, empty)` are equal to `s`. */
-    readonly empty: Summary;
-    /** This function gives the summary of a sequence from the summaries of its two parts, left first. */
-    readonly combine: (left: Summary, right: Summary) => Summary;
-}
-/** The data that a tree needs: the monoid of the summaries and the summary of one leaf. */
-export interface SummarySpec<Leaf, Summary> {
-    readonly monoid: SummaryMonoid<Summary>;
-    /** This function gives the summary of one leaf. */
-    readonly measure: (leaf: Leaf) => Summary;
-    /**
-     * This optional function joins two neighbor leaves at a seam into one leaf, or gives `undefined` to keep both. A seam
-     * is the place where `concat`, `append`, `prepend`, `splice`, `insert` or `remove` puts two leaves next to each other.
-     * The tree calls it once at each seam, and not between the leaves that one call inserts. `set` does not call it.
-     */
-    readonly merge?: (left: Leaf, right: Leaf) => Leaf | undefined;
-}
-/** The result of a summary search: the first leaf whose prefix summary satisfies the predicate. */
-export interface SummarySearch<Leaf, Summary> {
-    /** The index of the leaf. */
-    readonly index: number;
-    readonly leaf: Leaf;
-    /** The summary of the leaves before the leaf. */
-    readonly before: Summary;
-    /** The summary of the leaves before the leaf, and of the leaf. */
-    readonly through: Summary;
-}
-/** The result of `locate`: the leaf that holds a position of an additive key, and the position in that leaf. */
-export interface SummaryLocation<Leaf> {
-    /** The index of the leaf. */
-    readonly index: number;
-    readonly leaf: Leaf;
-    /** The position in the leaf: the target minus the key of the leaves before the leaf. */
-    readonly offset: number;
-}
-/**
- * A persistent sequence of leaves with a summary of each part. Make one with `summaryTree`. Each method that changes
- * the sequence returns a new tree.
- */
-export declare class SummaryTree<Leaf, Summary> implements Iterable<Leaf> {
-    private readonly builder;
-    private readonly root;
-    private constructor();
-    /** This function makes a tree of a spec from leaves, as `summaryTree` does. */
-    static of<Leaf, Summary>(spec: SummarySpec<Leaf, Summary>, leaves?: Iterable<Leaf>): SummaryTree<Leaf, Summary>;
-    private wrap;
-    private treeOf;
-    /** The spec of the tree: its monoid and its measure. */
-    get spec(): SummarySpec<Leaf, Summary>;
-    /** The number of leaves. */
-    get size(): number;
-    get isEmpty(): boolean;
-    /** The summary of all the leaves, in their order. An empty tree has the summary `monoid.empty`. */
-    get summary(): Summary;
-    /** The height of the tree: 0 for an empty tree. The height is at most 1.45 log2(size + 2). */
-    get height(): number;
-    /**
-     * This function gives the leaf at an index, or `undefined` when the index is not in the tree. A negative index counts
-     * from the end, as `Array.prototype.at` does.
-     */
-    at(index: number): Leaf | undefined;
-    /** This function gives the summary of the leaves from `start` to `end`, with `end` not included. */
-    summaryOf(start?: number, end?: number): Summary;
-    /** This function gives the tree of the leaves of this tree, then the leaves of `other`. The two trees must have the same spec. */
-    concat(other: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary>;
-    /** This function splits the tree into its first `index` leaves and the other leaves. */
-    splitAt(index: number): [SummaryTree<Leaf, Summary>, SummaryTree<Leaf, Summary>];
-    /**
-     * This function splits the tree before the first leaf whose prefix summary satisfies the predicate. The prefix of a
-     * leaf includes the leaf. The predicate must be monotone: after it is true for a prefix, it is true for each longer
-     * prefix. When no prefix satisfies it, the right tree is empty.
-     */
-    split(predicate: (prefix: Summary) => boolean): [SummaryTree<Leaf, Summary>, SummaryTree<Leaf, Summary>];
-    /**
-     * This function finds the first leaf whose prefix summary satisfies a monotone predicate, as `split` does. It changes
-     * nothing. It gives `undefined` when no prefix satisfies the predicate.
-     */
-    search(predicate: (prefix: Summary) => boolean): SummarySearch<Leaf, Summary> | undefined;
-    /**
-     * This function finds the leaf that holds a position of an additive key, and it calls no `combine`. The key must be
-     * additive and not negative: `key(combine(a, b))` is `key(a) + key(b)`. The function descends by the key of each left
-     * subtree and of each leaf, and subtracts it from the target. It gives the first leaf whose prefix key is more than
-     * the target, or `undefined` when the target is not in `[0, key(summary))`.
-     *
-     * @example
-     * // The leaf and the offset in it of the code unit at position 1000 of a rope
-     * const at = rope.locate((s) => s.length, 1000);
-     */
-    locate(key: (summary: Summary) => number, target: number): SummaryLocation<Leaf> | undefined;
-    /** This function gives the tree of the leaves from `start` to `end`, with `end` not included. A negative index counts from the end. */
-    slice(start?: number, end?: number): SummaryTree<Leaf, Summary>;
-    /**
-     * This function removes `deleteCount` leaves at `start` and puts the leaves of `inserted` there, as
-     * `Array.prototype.splice` does. It returns the new tree, not the removed leaves.
-     */
-    splice(start: number, deleteCount?: number, inserted?: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary>;
-    /** This function puts the leaves of `inserted` before the leaf at `index`. */
-    insert(index: number, inserted: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary>;
-    /** This function removes the leaves from `start` to `end`, with `end` not included. */
-    remove(start: number, end?: number): SummaryTree<Leaf, Summary>;
-    /**
-     * This function replaces the leaf at an index. A negative index counts from the end, as `Array.prototype.with` does.
-     * An index that is not in the tree changes nothing. It copies only the path to the leaf, and it does not call
-     * `spec.merge`.
-     */
-    set(index: number, leaf: Leaf): SummaryTree<Leaf, Summary>;
-    /** This function adds leaves after the last leaf. */
-    append(...leaves: Leaf[]): SummaryTree<Leaf, Summary>;
-    /** This function adds leaves before the first leaf. */
-    prepend(...leaves: Leaf[]): SummaryTree<Leaf, Summary>;
-    /** This function gives the leaves in their order. */
-    [Symbol.iterator](): Iterator<Leaf>;
-    /** This function gives the leaves in an array. */
-    toArray(): Leaf[];
-}
-/**
- * This function makes a persistent tree of leaves with a summary of each part. Use the same `spec` object for each
- * tree that `concat` or `splice` joins.
- */
-export declare function summaryTree<Leaf, Summary>(spec: SummarySpec<Leaf, Summary>, leaves?: Iterable<Leaf>): SummaryTree<Leaf, Summary>;
-//# sourceMappingURL=summary-tree.d.ts.map

package/dist/impl/summary-tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"summary-tree.d.ts","sourceRoot":"","sources":["../../src/impl/summary-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,2FAA2F;AAC3F,MAAM,WAAW,aAAa,CAAC,OAAO;IACpC,4GAA4G;IAC5G,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,qGAAqG;IACrG,QAAQ,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC;CAC9D;AAED,2FAA2F;AAC3F,MAAM,WAAW,WAAW,CAAC,IAAI,EAAE,OAAO;IACxC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IACxC,mDAAmD;IACnD,QAAQ,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAC;IAC1C;;;;OAIG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,KAAK,IAAI,GAAG,SAAS,CAAC;CAChE;AAED,mGAAmG;AACnG,MAAM,WAAW,aAAa,CAAC,IAAI,EAAE,OAAO;IAC1C,6BAA6B;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,iDAAiD;IACjD,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,kEAAkE;IAClE,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED,gHAAgH;AAChH,MAAM,WAAW,eAAe,CAAC,IAAI;IACnC,6BAA6B;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,wFAAwF;IACxF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AA8PD;;;GAGG;AACH,qBAAa,WAAW,CAAC,IAAI,EAAE,OAAO,CAAE,YAAW,QAAQ,CAAC,IAAI,CAAC;IAE7D,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,IAAI;IAFvB,OAAO,eAGH;IAEJ,+EAA+E;IAC/E,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,MAAM,GAAE,QAAQ,CAAC,IAAI,CAAM,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAIlH;IAED,OAAO,CAAC,IAAI;IAIZ,OAAO,CAAC,MAAM;IASd,wDAAwD;IACxD,IAAI,IAAI,IAAI,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAErC;IAED,4BAA4B;IAC5B,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,mGAAmG;IACnG,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,8FAA8F;IAC9F,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;;OAGG;IACH,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAGlC;IAED,oGAAoG;IACpG,SAAS,CAAC,KAAK,SAAI,EAAE,GAAG,GAAE,MAAkB,GAAG,OAAO,CAErD;IAED,kIAAkI;IAClI,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAGrF;IAED,wFAAwF;IACxF,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAG/E;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,OAAO,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAGvG;IAED;;;OAGG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,OAAO,GAAG,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,SAAS,CAkBxF;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,GAAG,SAAS,CAsB3F;IAED,uIAAuI;IACvI,KAAK,CAAC,KAAK,SAAI,EAAE,GAAG,GAAE,MAAkB,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAOpE;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,GAAE,MAAkB,EAAE,QAAQ,GAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAM,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CA8B7I;IAED,8EAA8E;IAC9E,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAEvG;IAED,uFAAuF;IACvF,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAGzE;IAED;;;;OAIG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAGzD;IAED,qDAAqD;IACrD,MAAM,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAEpD;IAED,uDAAuD;IACvD,OAAO,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAGrD;IAED,qDAAqD;IACrD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAElC;IAED,kDAAkD;IAClD,OAAO,IAAI,IAAI,EAAE,CAEhB;CACF;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,MAAM,GAAE,QAAQ,CAAC,IAAI,CAAM,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAEpI"}