@fluidframework/merge-tree 3.1.0 → 3.2.0

package/lib/collections/rbTree.d.ts

@@ -1,160 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * @internal
- */
-export declare const RBColor: {
-    readonly RED: 0;
-    readonly BLACK: 1;
-};
-/**
- * @internal
- */
-export type RBColor = (typeof RBColor)[keyof typeof RBColor];
-/**
- * @internal
- */
-export interface RBNode<TKey, TData> {
-    key: TKey;
-    data: TData;
-    left: RBNode<TKey, TData> | undefined;
-    right: RBNode<TKey, TData> | undefined;
-    color: RBColor;
-    size: number;
-}
-/**
- * @internal
- */
-export interface IRBAugmentation<TKey, TData> {
-    update(node: RBNode<TKey, TData>): void;
-}
-/**
- * @internal
- */
-export interface IRBMatcher<TKey, TData> {
-    continueSubtree(node: RBNode<TKey, TData> | undefined, key: TKey): boolean;
-    matchNode(node: RBNode<TKey, TData> | undefined, key: TKey): boolean;
-}
-/**
- * @internal
- */
-export interface RBNodeActions<TKey, TData> {
-    infix?(node: RBNode<TKey, TData>): boolean;
-    pre?(node: RBNode<TKey, TData>): boolean;
-    post?(node: RBNode<TKey, TData>): boolean;
-    showStructure?: boolean;
-}
-/**
- * @internal
- */
-export interface KeyComparer<TKey> {
-    (a: TKey, b: TKey): number;
-}
-/**
- * @internal
- */
-export interface Property<TKey, TData> {
-    key: TKey;
-    data: TData;
-}
-/**
- * @internal
- */
-export interface PropertyAction<TKey, TData> {
-    <TAccum>(p: Property<TKey, TData>, accum?: TAccum): boolean;
-}
-/**
- * @internal
- */
-export interface QProperty<TKey, TData> {
-    key?: TKey;
-    data?: TData;
-}
-/**
- * @internal
- */
-export type ConflictAction<TKey, TData> = (key: TKey, currentKey: TKey, data: TData, currentData: TData) => QProperty<TKey, TData>;
-/**
- * @internal
- */
-export interface SortedDictionary<TKey, TData> extends Dictionary<TKey, TData> {
-    max(): Property<TKey, TData> | undefined;
-    min(): Property<TKey, TData> | undefined;
-    mapRange<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum, start?: TKey, end?: TKey): void;
-}
-/**
- * @internal
- */
-export interface Dictionary<TKey, TData> {
-    get(key: TKey): Property<TKey, TData> | undefined;
-    put(key: TKey, data: TData, conflict?: ConflictAction<TKey, TData>): void;
-    remove(key: TKey): void;
-    map<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum): void;
-}
-/**
- * @internal
- */
-export declare class RedBlackTree<TKey, TData> implements SortedDictionary<TKey, TData> {
-    private readonly compareKeys;
-    private readonly aug?;
-    private root;
-    constructor(compareKeys: KeyComparer<TKey>, aug?: IRBAugmentation<TKey, TData> | undefined);
-    private makeNode;
-    private isRed;
-    private nodeSize;
-    size(): number;
-    isEmpty(): boolean;
-    get(key: TKey): RBNode<TKey, TData> | undefined;
-    private nodeGet;
-    private contains;
-    gather(key: TKey, matcher: IRBMatcher<TKey, TData>): RBNode<TKey, TData>[];
-    private nodeGather;
-    walkExactMatchesForward(compareFn: (node: RBNode<TKey, TData>) => number, actionFn: (node: RBNode<TKey, TData>) => void, continueLeftFn: (number: number) => boolean, continueRightFn: (number: number) => boolean): void;
-    private nodeWalkExactMatchesForward;
-    walkExactMatchesBackward(compareFn: (node: RBNode<TKey, TData>) => number, actionFn: (node: RBNode<TKey, TData>) => void, continueLeftFn: (number: number) => boolean, continueRightFn: (number: number) => boolean): void;
-    private nodeWalkExactMatchesBackward;
-    put(key: TKey, data: TData, conflict?: ConflictAction<TKey, TData>): void;
-    private nodePut;
-    private updateLocal;
-    private nodeRemoveMin;
-    remove(key: TKey): void;
-    removeExisting(key: TKey): void;
-    private nodeRemove;
-    /**
-     * Finds the largest node that is less than or equal to a given key.
-     */
-    floor(key: TKey): RBNode<TKey, TData> | undefined;
-    private nodeFloor;
-    /**
-     * Finds the smallest node that is greater than or equal to a given key.
-     */
-    ceil(key: TKey): RBNode<TKey, TData> | undefined;
-    private nodeCeil;
-    min(): RBNode<TKey, TData> | undefined;
-    private nodeMin;
-    max(): RBNode<TKey, TData> | undefined;
-    private nodeMax;
-    private rotateRight;
-    private rotateLeft;
-    private oppositeColor;
-    private flipColors;
-    private moveRedLeft;
-    private moveRedRight;
-    private balance;
-    mapRange<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum, start?: TKey, end?: TKey): void;
-    map<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum): void;
-    keys(): TKey[];
-    /**
-     * Depth-first traversal with custom action; if action returns
-     * false, traversal is halted.
-     * @param action - action to apply to each node
-     */
-    walk(actions: RBNodeActions<TKey, TData>): void;
-    walkBackward(actions: RBNodeActions<TKey, TData>): void;
-    private nodeWalk;
-    private nodeWalkBackward;
-    private nodeMap;
-}
-//# sourceMappingURL=rbTree.d.ts.map

package/lib/collections/rbTree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"rbTree.d.ts","sourceRoot":"","sources":["../../src/collections/rbTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO;;;CAGV,CAAC;AAEX;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,OAAO,OAAO,CAAC,CAAC;AAE7D;;GAEG;AACH,MAAM,WAAW,MAAM,CAAC,IAAI,EAAE,KAAK;IAClC,GAAG,EAAE,IAAI,CAAC;IACV,IAAI,EAAE,KAAK,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC;IACtC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC;IACvC,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACb;AACD;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,IAAI,EAAE,KAAK;IAC3C,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;CACxC;AACD;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,IAAI,EAAE,KAAK;IACtC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,EAAE,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC;IAC3E,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,EAAE,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC;CACrE;AAED;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,IAAI,EAAE,KAAK;IACzC,KAAK,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC;IAC3C,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC;IACzC,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC;IAC1C,aAAa,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,IAAI;IAEhC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ,CAAC,IAAI,EAAE,KAAK;IACpC,GAAG,EAAE,IAAI,CAAC;IACV,IAAI,EAAE,KAAK,CAAC;CACZ;AAED;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,IAAI,EAAE,KAAK;IAE1C,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5D;AAED;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,IAAI,EAAE,KAAK;IACrC,GAAG,CAAC,EAAE,IAAI,CAAC;IACX,IAAI,CAAC,EAAE,KAAK,CAAC;CACb;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,CAAC,IAAI,EAAE,KAAK,IAAI,CACzC,GAAG,EAAE,IAAI,EACT,UAAU,EAAE,IAAI,EAChB,IAAI,EAAE,KAAK,EACX,WAAW,EAAE,KAAK,KACd,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE5B;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAE,SAAQ,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC;IAC7E,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC;IACzC,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC;IACzC,QAAQ,CAAC,MAAM,EACd,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EACnC,KAAK,CAAC,EAAE,MAAM,EACd,KAAK,CAAC,EAAE,IAAI,EACZ,GAAG,CAAC,EAAE,IAAI,GACR,IAAI,CAAC;CACR;AAED;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,IAAI,EAAE,KAAK;IACtC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC;IAClD,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;IAC1E,MAAM,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC;IACxB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACvE;AAED;;GAEG;AACH,qBAAa,YAAY,CAAC,IAAI,EAAE,KAAK,CAAE,YAAW,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC;IAI7E,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;IAJtB,OAAO,CAAC,IAAI,CAAkC;gBAG5B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,EAC9B,GAAG,CAAC,EAAE,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,YAAA;IAGpD,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,KAAK;IAIb,OAAO,CAAC,QAAQ;IAGT,IAAI,IAAI,MAAM;IAGd,OAAO,IAAI,OAAO;IAGlB,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS;IAKtD,OAAO,CAAC,OAAO;IAgBf,OAAO,CAAC,QAAQ;IAIT,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;IAQjF,OAAO,CAAC,UAAU;IAmBX,uBAAuB,CAC7B,SAAS,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,MAAM,EAChD,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,EAC7C,cAAc,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,EAC3C,eAAe,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,GAC1C,IAAI;IAUP,OAAO,CAAC,2BAA2B;IAkC5B,wBAAwB,CAC9B,SAAS,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,MAAM,EAChD,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,EAC7C,cAAc,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,EAC3C,eAAe,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,GAC1C,IAAI;IAUP,OAAO,CAAC,4BAA4B;IAkC7B,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI;IAWhF,OAAO,CAAC,OAAO;IA4Cf,OAAO,CAAC,WAAW;IAcnB,OAAO,CAAC,aAAa;IAad,MAAM,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI;IAWvB,cAAc,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI;IAWtC,OAAO,CAAC,UAAU;IAmClB;;OAEG;IACI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS;IAMxD,OAAO,CAAC,SAAS;IAiBjB;;OAEG;IACI,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS;IAMvD,OAAO,CAAC,QAAQ;IAiBT,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS;IAM7C,OAAO,CAAC,OAAO;IAIR,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS;IAM7C,OAAO,CAAC,OAAO;IAIf,OAAO,CAAC,WAAW;IAgBnB,OAAO,CAAC,UAAU;IAgBlB,OAAO,CAAC,aAAa;IAIrB,OAAO,CAAC,UAAU;IAQlB,OAAO,CAAC,WAAW;IAanB,OAAO,CAAC,YAAY;IAWpB,OAAO,CAAC,OAAO;IAmBR,QAAQ,CAAC,MAAM,EACrB,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EACnC,KAAK,CAAC,EAAE,MAAM,EACd,KAAK,CAAC,EAAE,IAAI,EACZ,GAAG,CAAC,EAAE,IAAI,GACR,IAAI;IAIA,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IAKtE,IAAI,IAAI,IAAI,EAAE;IAarB;;;;OAIG;IACI,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI;IAI/C,YAAY,CAAC,OAAO,EAAE,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI;IAI9D,OAAO,CAAC,QAAQ;IAyBhB,OAAO,CAAC,gBAAgB;IAyBxB,OAAO,CAAC,OAAO;CAmCf"}

package/lib/collections/rbTree.js

@@ -1,492 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * @internal
- */
-export const RBColor = {
-    RED: 0,
-    BLACK: 1,
-};
-/**
- * @internal
- */
-export class RedBlackTree {
-    compareKeys;
-    aug;
-    root;
-    constructor(compareKeys, aug) {
-        this.compareKeys = compareKeys;
-        this.aug = aug;
-    }
-    makeNode(key, data, color, size) {
-        return { key, data, color, size };
-    }
-    isRed(node) {
-        return !!node && node.color === RBColor.RED;
-    }
-    nodeSize(node) {
-        return node ? node.size : 0;
-    }
-    size() {
-        return this.nodeSize(this.root);
-    }
-    isEmpty() {
-        return !this.root;
-    }
-    get(key) {
-        if (key !== undefined) {
-            return this.nodeGet(this.root, key);
-        }
-    }
-    nodeGet(node, key) {
-        let _node = node;
-        while (_node) {
-            const cmp = this.compareKeys(key, _node.key);
-            if (cmp < 0) {
-                _node = _node.left;
-            }
-            else if (cmp > 0) {
-                _node = _node.right;
-            }
-            else {
-                return _node;
-            }
-        }
-    }
-    contains(key) {
-        return this.get(key);
-    }
-    gather(key, matcher) {
-        const results = [];
-        if (key !== undefined) {
-            this.nodeGather(this.root, results, key, matcher);
-        }
-        return results;
-    }
-    nodeGather(node, results, key, matcher) {
-        if (node) {
-            if (matcher.continueSubtree(node.left, key)) {
-                this.nodeGather(node.left, results, key, matcher);
-            }
-            if (matcher.matchNode(node, key)) {
-                results.push(node);
-            }
-            if (matcher.continueSubtree(node.right, key)) {
-                this.nodeGather(node.right, results, key, matcher);
-            }
-        }
-    }
-    walkExactMatchesForward(compareFn, actionFn, continueLeftFn, continueRightFn) {
-        this.nodeWalkExactMatchesForward(this.root, compareFn, actionFn, continueLeftFn, continueRightFn);
-    }
-    nodeWalkExactMatchesForward(node, compareFn, actionFn, continueLeftFn, continueRightFn) {
-        if (!node) {
-            return;
-        }
-        const result = compareFn(node);
-        if (continueLeftFn(result)) {
-            this.nodeWalkExactMatchesForward(node.left, compareFn, actionFn, continueLeftFn, continueRightFn);
-        }
-        if (result === 0) {
-            actionFn(node);
-        }
-        if (continueRightFn(result)) {
-            this.nodeWalkExactMatchesForward(node.right, compareFn, actionFn, continueLeftFn, continueRightFn);
-        }
-    }
-    walkExactMatchesBackward(compareFn, actionFn, continueLeftFn, continueRightFn) {
-        this.nodeWalkExactMatchesBackward(this.root, compareFn, actionFn, continueLeftFn, continueRightFn);
-    }
-    nodeWalkExactMatchesBackward(node, compareFn, actionFn, continueLeftFn, continueRightFn) {
-        if (!node) {
-            return;
-        }
-        const result = compareFn(node);
-        if (continueRightFn(result)) {
-            this.nodeWalkExactMatchesBackward(node.right, compareFn, actionFn, continueLeftFn, continueRightFn);
-        }
-        if (result === 0) {
-            actionFn(node);
-        }
-        if (continueLeftFn(result)) {
-            this.nodeWalkExactMatchesBackward(node.left, compareFn, actionFn, continueLeftFn, continueRightFn);
-        }
-    }
-    put(key, data, conflict) {
-        if (key !== undefined) {
-            if (data === undefined) {
-                this.remove(key);
-            }
-            else {
-                this.root = this.nodePut(this.root, key, data, conflict);
-                this.root.color = RBColor.BLACK;
-            }
-        }
-    }
-    nodePut(node, key, data, conflict) {
-        let _node = node;
-        if (_node) {
-            const cmp = this.compareKeys(key, _node.key);
-            if (cmp < 0) {
-                _node.left = this.nodePut(_node.left, key, data, conflict);
-            }
-            else if (cmp > 0) {
-                _node.right = this.nodePut(_node.right, key, data, conflict);
-            }
-            else {
-                if (conflict) {
-                    const kd = conflict(key, _node.key, data, _node.data);
-                    if (kd.key) {
-                        _node.key = kd.key;
-                    }
-                    _node.data = kd.data ?? data;
-                }
-                else {
-                    _node.data = data;
-                }
-            }
-            if (this.isRed(_node.right) && !this.isRed(_node.left)) {
-                _node = this.rotateLeft(_node);
-            }
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            if (this.isRed(_node.left) && this.isRed(_node.left.left)) {
-                _node = this.rotateRight(_node);
-            }
-            if (this.isRed(_node.left) && this.isRed(_node.right)) {
-                this.flipColors(_node);
-            }
-            _node.size = this.nodeSize(_node.left) + this.nodeSize(_node.right) + 1;
-            if (this.aug) {
-                this.updateLocal(_node);
-            }
-            return _node;
-        }
-        else {
-            return this.makeNode(key, data, RBColor.RED, 1);
-        }
-    }
-    updateLocal(node) {
-        if (this.aug) {
-            if (this.isRed(node.left)) {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                this.aug.update(node.left);
-            }
-            if (this.isRed(node.right)) {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                this.aug.update(node.right);
-            }
-            this.aug.update(node);
-        }
-    }
-    nodeRemoveMin(node) {
-        let _node = node;
-        if (_node.left) {
-            if (!this.isRed(_node.left) && !this.isRed(_node.left.left)) {
-                _node = this.moveRedLeft(_node);
-            }
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            _node.left = this.nodeRemoveMin(_node.left);
-            return this.balance(_node);
-        }
-    }
-    remove(key) {
-        if (key !== undefined) {
-            if (!this.contains(key)) {
-                return;
-            }
-            this.removeExisting(key);
-        }
-        // TODO: error on undefined key
-    }
-    removeExisting(key) {
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        if (!this.isRed(this.root.left) && !this.isRed(this.root.right)) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            this.root.color = RBColor.RED;
-        }
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        this.root = this.nodeRemove(this.root, key);
-    }
-    nodeRemove(node, key) {
-        let _node = node;
-        if (this.compareKeys(key, _node.key) < 0) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            if (!this.isRed(_node.left) && !this.isRed(_node.left.left)) {
-                _node = this.moveRedLeft(_node);
-            }
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            _node.left = this.nodeRemove(_node.left, key);
-        }
-        else {
-            if (this.isRed(_node.left)) {
-                _node = this.rotateRight(_node);
-            }
-            if (this.compareKeys(key, _node.key) === 0 && !_node.right) {
-                return undefined;
-            }
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            if (!this.isRed(_node.right) && !this.isRed(_node.right.left)) {
-                _node = this.moveRedRight(_node);
-            }
-            if (this.compareKeys(key, _node.key) === 0) {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                const subtreeMin = this.nodeMin(_node.right);
-                _node.key = subtreeMin.key;
-                _node.data = subtreeMin.data;
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                _node.right = this.nodeRemoveMin(_node.right);
-            }
-            else {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                _node.right = this.nodeRemove(_node.right, key);
-            }
-        }
-        return this.balance(_node);
-    }
-    /**
-     * Finds the largest node that is less than or equal to a given key.
-     */
-    floor(key) {
-        if (!this.isEmpty()) {
-            return this.nodeFloor(this.root, key);
-        }
-    }
-    nodeFloor(node, key) {
-        if (node) {
-            const cmp = this.compareKeys(key, node.key);
-            if (cmp === 0) {
-                return node;
-            }
-            else if (cmp < 0) {
-                return this.nodeFloor(node.left, key);
-            }
-            else {
-                const rightFloor = this.nodeFloor(node.right, key);
-                return rightFloor ?? node;
-            }
-        }
-    }
-    /**
-     * Finds the smallest node that is greater than or equal to a given key.
-     */
-    ceil(key) {
-        if (!this.isEmpty()) {
-            return this.nodeCeil(this.root, key);
-        }
-    }
-    nodeCeil(node, key) {
-        if (node) {
-            const cmp = this.compareKeys(key, node.key);
-            if (cmp === 0) {
-                return node;
-            }
-            else if (cmp > 0) {
-                return this.nodeCeil(node.right, key);
-            }
-            else {
-                const leftCeil = this.nodeCeil(node.left, key);
-                return leftCeil ?? node;
-            }
-        }
-    }
-    min() {
-        if (this.root) {
-            return this.nodeMin(this.root);
-        }
-    }
-    nodeMin(node) {
-        return node.left ? this.nodeMin(node.left) : node;
-    }
-    max() {
-        if (this.root) {
-            return this.nodeMax(this.root);
-        }
-    }
-    nodeMax(node) {
-        return node.right ? this.nodeMax(node.right) : node;
-    }
-    rotateRight(node) {
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        const leftChild = node.left;
-        node.left = leftChild.right;
-        leftChild.right = node;
-        leftChild.color = leftChild.right.color;
-        leftChild.right.color = RBColor.RED;
-        leftChild.size = node.size;
-        node.size = this.nodeSize(node.left) + this.nodeSize(node.right) + 1;
-        if (this.aug) {
-            this.updateLocal(node);
-            this.updateLocal(leftChild);
-        }
-        return leftChild;
-    }
-    rotateLeft(node) {
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        const rightChild = node.right;
-        node.right = rightChild.left;
-        rightChild.left = node;
-        rightChild.color = rightChild.left.color;
-        rightChild.left.color = RBColor.RED;
-        rightChild.size = node.size;
-        node.size = this.nodeSize(node.left) + this.nodeSize(node.right) + 1;
-        if (this.aug) {
-            this.updateLocal(node);
-            this.updateLocal(rightChild);
-        }
-        return rightChild;
-    }
-    oppositeColor(c) {
-        return c === RBColor.BLACK ? RBColor.RED : RBColor.BLACK;
-    }
-    flipColors(node) {
-        node.color = this.oppositeColor(node.color);
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        node.left.color = this.oppositeColor(node.left.color);
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        node.right.color = this.oppositeColor(node.right.color);
-    }
-    moveRedLeft(node) {
-        let _node = node;
-        this.flipColors(_node);
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        if (this.isRed(_node.right.left)) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            _node.right = this.rotateRight(_node.right);
-            _node = this.rotateLeft(_node);
-            this.flipColors(_node);
-        }
-        return _node;
-    }
-    moveRedRight(node) {
-        let _node = node;
-        this.flipColors(_node);
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        if (this.isRed(_node.left.left)) {
-            _node = this.rotateRight(_node);
-            this.flipColors(_node);
-        }
-        return _node;
-    }
-    balance(input) {
-        let node = input;
-        if (this.isRed(node.right)) {
-            node = this.rotateLeft(node);
-        }
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-        if (this.isRed(node.left) && this.isRed(node.left.left)) {
-            node = this.rotateRight(node);
-        }
-        if (this.isRed(node.left) && this.isRed(node.right)) {
-            this.flipColors(node);
-        }
-        node.size = this.nodeSize(node.left) + this.nodeSize(node.right) + 1;
-        if (this.aug) {
-            this.aug.update(node);
-        }
-        return node;
-    }
-    mapRange(action, accum, start, end) {
-        this.nodeMap(this.root, action, accum, start, end);
-    }
-    map(action, accum) {
-        // TODO: optimize to avoid comparisons
-        this.nodeMap(this.root, action, accum);
-    }
-    keys() {
-        const keyList = [];
-        const actions = {
-            showStructure: true,
-            infix: (node) => {
-                keyList.push(node.key);
-                return true;
-            },
-        };
-        this.walk(actions);
-        return keyList;
-    }
-    /**
-     * Depth-first traversal with custom action; if action returns
-     * false, traversal is halted.
-     * @param action - action to apply to each node
-     */
-    walk(actions) {
-        this.nodeWalk(this.root, actions);
-    }
-    walkBackward(actions) {
-        this.nodeWalkBackward(this.root, actions);
-    }
-    nodeWalk(node, actions) {
-        let go = true;
-        if (node) {
-            if (actions.pre && (!!actions.showStructure || node.color === RBColor.BLACK)) {
-                go = actions.pre(node);
-            }
-            if (node.left) {
-                go = this.nodeWalk(node.left, actions);
-            }
-            if (go && actions.infix && (!!actions.showStructure || node.color === RBColor.BLACK)) {
-                go = actions.infix(node);
-            }
-            if (go) {
-                go = this.nodeWalk(node.right, actions);
-            }
-            if (go && actions.post && (!!actions.showStructure || node.color === RBColor.BLACK)) {
-                go = actions.post(node);
-            }
-        }
-        return go;
-    }
-    nodeWalkBackward(node, actions) {
-        let go = true;
-        if (node) {
-            if (actions.pre && (!!actions.showStructure || node.color === RBColor.BLACK)) {
-                go = actions.pre(node);
-            }
-            if (node.right) {
-                go = this.nodeWalkBackward(node.right, actions);
-            }
-            if (go && actions.infix && (!!actions.showStructure || node.color === RBColor.BLACK)) {
-                go = actions.infix(node);
-            }
-            if (go) {
-                go = this.nodeWalkBackward(node.left, actions);
-            }
-            if (go && actions.post && (!!actions.showStructure || node.color === RBColor.BLACK)) {
-                go = actions.post(node);
-            }
-        }
-        return go;
-    }
-    nodeMap(node, action, accum, start, end) {
-        let _start = start;
-        let _end = end;
-        if (!node) {
-            return true;
-        }
-        // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing -- using ??= could change behavior if value is falsy
-        if (_start === undefined) {
-            _start = this.nodeMin(node).key;
-        }
-        // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing -- using ??= could change behavior if value is falsy
-        if (_end === undefined) {
-            _end = this.nodeMax(node).key;
-        }
-        const cmpStart = this.compareKeys(_start, node.key);
-        const cmpEnd = this.compareKeys(_end, node.key);
-        let go = true;
-        if (cmpStart < 0) {
-            go = this.nodeMap(node.left, action, accum, _start, _end);
-        }
-        if (go && cmpStart <= 0 && cmpEnd >= 0) {
-            // REVIEW: test for black node here
-            go = action(node, accum);
-        }
-        if (go && cmpEnd > 0) {
-            go = this.nodeMap(node.right, action, accum, _start, _end);
-        }
-        return go;
-    }
-}
-//# sourceMappingURL=rbTree.js.map