@procedures/collections 0.47.1 → 0.48.0

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

@@ -1,153 +0,0 @@
-/**
- * TreeMap - Red-black tree based sorted map implementation.
- *
- * Implements a self-balancing binary search tree that maintains keys in sorted
- * order. Mirrors java.util.TreeMap.
- *
- * Key features:
- * - O(log n) access, insert, delete
- * - Keys maintained in sorted order (natural or custom comparator)
- * - Navigation methods (floor, ceiling, lower, higher)
- * - Range view operations (subMap, headMap, tailMap)
- *
- * @example
- * const map = treeMap<string, number>()
- * map.set('c', 3)
- * map.set('a', 1)
- * map.set('b', 2)
- * // Iteration order: a, b, c (sorted)
- *
- * @example
- * // Custom comparator for descending order
- * const map = treeMap<number, string>({
- *   compare: (a, b) => b - a
- * })
- */
-import type { NavigableMap, SortedMap, Entry } from "../interfaces/map.js";
-import type { Eq, Compare } from "../core/traits.js";
-/**
- * Options for creating a TreeMap.
- */
-export interface TreeMapOptions<K, V> {
-    /**
-     * Comparison function for keys.
-     * @default defaultCompare
-     */
-    compare?: Compare<K>;
-    /**
-     * Equality function for keys.
-     * @default defaultEq
-     */
-    eq?: Eq<K>;
-    /**
-     * Equality function for values.
-     * @default defaultEq
-     */
-    valueEq?: Eq<V>;
-}
-/**
- * TreeMap<K, V> - Red-black tree based sorted map.
- *
- * Maintains keys in sorted order using a self-balancing binary search tree.
- * Provides O(log n) operations and navigation methods.
- */
-export declare class TreeMap<K, V> implements NavigableMap<K, V> {
-    private _root;
-    private _size;
-    private readonly _compare;
-    private readonly _eq;
-    private readonly _valueEq;
-    constructor(options?: TreeMapOptions<K, V>);
-    get size(): number;
-    get isEmpty(): boolean;
-    get comparator(): Compare<K>;
-    get keyEq(): Eq<K>;
-    get valueEq(): Eq<V>;
-    has(key: K): boolean;
-    containsKey(key: K): boolean;
-    containsValue(value: V): boolean;
-    get(key: K): V;
-    getOrUndefined(key: K): V | undefined;
-    getOrDefault(key: K, defaultValue: V): V;
-    set(key: K, value: V): V | undefined;
-    setIfAbsent(key: K, value: V): V;
-    replace(key: K, value: V): V | undefined;
-    replaceEntry(key: K, oldValue: V, newValue: V): boolean;
-    delete(key: K): V | undefined;
-    deleteEntry(key: K, value: V): boolean;
-    clear(): void;
-    putAll(other: NavigableMap<K, V> | Iterable<Entry<K, V>>): void;
-    computeIfAbsent(key: K, mappingFunction: (key: K) => V): V;
-    computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined;
-    compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined;
-    merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined;
-    firstKey(): K;
-    lastKey(): K;
-    headMap(toKey: K): SortedMap<K, V>;
-    tailMap(fromKey: K): SortedMap<K, V>;
-    subMap(fromKey: K, toKey: K): SortedMap<K, V>;
-    floorKey(key: K): K | undefined;
-    ceilingKey(key: K): K | undefined;
-    lowerKey(key: K): K | undefined;
-    higherKey(key: K): K | undefined;
-    floorEntry(key: K): Entry<K, V> | undefined;
-    ceilingEntry(key: K): Entry<K, V> | undefined;
-    lowerEntry(key: K): Entry<K, V> | undefined;
-    higherEntry(key: K): Entry<K, V> | undefined;
-    firstEntry(): Entry<K, V> | undefined;
-    lastEntry(): Entry<K, V> | undefined;
-    pollFirstEntry(): Entry<K, V> | undefined;
-    pollLastEntry(): Entry<K, V> | undefined;
-    descendingMap(): NavigableMap<K, V>;
-    descendingKeys(): IterableIterator<K>;
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-    entries(): IterableIterator<Entry<K, V>>;
-    [Symbol.iterator](): Iterator<Entry<K, V>>;
-    forEach(action: (value: V, key: K, map: this) => void): void;
-    toArray(): Entry<K, V>[];
-    private createNode;
-    private getNode;
-    private getFirstNode;
-    private getLastNode;
-    private findValue;
-    private inOrderTraversal;
-    private reverseInOrderTraversal;
-    private rotateLeft;
-    private rotateRight;
-    private fixAfterInsertion;
-    /**
-     * Deletes a node (the CLRS algorithm, as in java.util.TreeMap). A null leaf counts as black.
-     *
-     * Before (BUGS-2026-07 L10): the deletion of a black leaf skipped the fix-up, so the black
-     * heights drifted and the tree became unbalanced, and the fix-up treated a null leaf as
-     * "not black", so it chose the wrong case and rotated at null (a TypeError).
-     */
-    private deleteNode;
-    private fixAfterDeletion;
-    toString(): string;
-}
-/**
- * Factory function to create a TreeMap.
- *
- * @example
- * const map = treeMap<string, number>()
- * map.set('c', 3)
- * map.set('a', 1)
- * map.set('b', 2)
- * // Iteration order: a, b, c
- *
- * @example
- * // With initial entries
- * const map = treeMap<string, number>([
- *   ['c', 3],
- *   ['a', 1],
- *   ['b', 2]
- * ])
- *
- * @example
- * // Custom comparator for descending order
- * const map = treeMap<number, string>({ compare: (a, b) => b - a })
- */
-export declare function treeMap<K, V>(optionsOrEntries?: TreeMapOptions<K, V> | Iterable<[K, V]>): TreeMap<K, V>;
-//# sourceMappingURL=tree-map.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tree-map.d.ts","sourceRoot":"","sources":["../../src/impl/tree-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC3E,OAAO,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAwCrD;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,CAAC,EAAE,CAAC;IAClC;;;OAGG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAErB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEX;;;OAGG;IACH,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACjB;AAED;;;;;GAKG;AACH,qBAAa,OAAO,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;IACtD,OAAO,CAAC,KAAK,CAA+B;IAC5C,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAa;IACtC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IAEjC,YAAY,OAAO,GAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAM,EAU7C;IAMD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAE3B;IAED,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAEjB;IAED,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,CAEnB;IAMD,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAEnB;IAED,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAE3B;IAED,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAE/B;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAMb;IAED,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAGpC;IAED,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC,CAGvC;IAMD,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CA2CnC;IAED,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAO/B;IAED,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAMvC;IAED,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO,CAOtD;IAED,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAQ5B;IAED,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAQrC;IAED,KAAK,IAAI,IAAI,CAGZ;IAMD,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAU9D;IAMD,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAQzD;IAED,gBAAgB,CAAC,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAW9F;IAED,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAajG;IAED,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAgBrG;IAMD,QAAQ,IAAI,CAAC,CAKZ;IAED,OAAO,IAAI,CAAC,CAKX;IAED,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAiBjC;IAED,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAiBnC;IAED,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAmB5C;IAMD,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAE9B;IAED,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAEhC;IAED,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAE9B;IAED,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAE/B;IAED,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAiB1C;IAED,YAAY,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAiB5C;IAED,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAe1C;IAED,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAe3C;IAED,UAAU,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAIpC;IAED,SAAS,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAInC;IAED,cAAc,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAOxC;IAED,aAAa,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAOvC;IAED,aAAa,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAalC;IAEA,cAAc,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAErC;IAMA,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE3B;IAEA,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE7B;IAEA,OAAO,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAKxC;IAEA,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAE1C;IAED,OAAO,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAI3D;IAED,OAAO,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAEvB;IAMD,OAAO,CAAC,UAAU;IAWlB,OAAO,CAAC,OAAO;IAiBf,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,WAAW;IAOnB,OAAO,CAAC,SAAS;IAMjB,OAAO,CAAE,gBAAgB;IAUzB,OAAO,CAAE,uBAAuB;IAchC,OAAO,CAAC,UAAU;IAuBlB,OAAO,CAAC,WAAW;IAuBnB,OAAO,CAAC,iBAAiB;IAgDzB;;;;;;OAMG;IACH,OAAO,CAAC,UAAU;IAgClB,OAAO,CAAC,gBAAgB;IA4DxB,QAAQ,IAAI,MAAM,CAKjB;CACF;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAC1B,gBAAgB,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GACzD,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAUf"}