@fluidframework/merge-tree 1.2.1 → 2.0.0-internal.1.0.0

package/dist/{collections.js → collections/rbTree.js}

@@ -4,216 +4,19 @@
  * Licensed under the MIT License.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.TST = exports.IntervalTree = exports.integerRangeToString = exports.RedBlackTree = exports.RBColor = exports.Heap = exports.List = exports.ListMakeHead = exports.ListRemoveEntry = exports.Stack = void 0;
-class Stack {
-    constructor() {
-        this.items = [];
-    }
-    push(val) {
-        this.items.push(val);
-    }
-    empty() {
-        return this.items.length === 0;
-    }
-    top() {
-        return this.items[this.items.length - 1];
-    }
-    pop() {
-        return this.items.pop();
-    }
-}
-exports.Stack = Stack;
-function ListRemoveEntry(entry) {
-    if (entry === undefined) {
-        return undefined;
-    }
-    else if (entry.isHead) {
-        return undefined;
-    }
-    else {
-        entry.next.prev = entry.prev;
-        entry.prev.next = entry.next;
-    }
-    return (entry);
-}
-exports.ListRemoveEntry = ListRemoveEntry;
-function ListMakeEntry(data) {
-    return new List(false, data);
-}
-function ListMakeHead() {
-    return new List(true, undefined);
-}
-exports.ListMakeHead = ListMakeHead;
-class List {
-    constructor(isHead, data) {
-        this.isHead = isHead;
-        this.data = data;
-        this.prev = this;
-        this.next = this;
-    }
-    clear() {
-        if (this.isHead) {
-            this.prev = this;
-            this.next = this;
-        }
-    }
-    add(data) {
-        const entry = ListMakeEntry(data);
-        this.prev.next = entry;
-        entry.next = this;
-        entry.prev = this.prev;
-        this.prev = entry;
-        return (entry);
-    }
-    dequeue() {
-        if (!this.empty()) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            const removedEntry = ListRemoveEntry(this.next);
-            return removedEntry.data;
-        }
-    }
-    enqueue(data) {
-        return this.add(data);
-    }
-    walk(fn) {
-        for (let entry = this.next; !(entry.isHead); entry = entry.next) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            fn(entry.data, entry);
-        }
-    }
-    some(fn, rev) {
-        const rtn = [];
-        const start = rev ? this.prev : this.next;
-        for (let entry = start; !(entry.isHead); entry = rev ? entry.prev : entry.next) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            const data = entry.data;
-            if (fn(data, entry)) {
-                if (rev) {
-                    // preserve list order when in reverse
-                    rtn.unshift(data);
-                }
-                else {
-                    rtn.push(data);
-                }
-            }
-        }
-        return rtn;
-    }
-    count() {
-        let entry;
-        let i;
-        entry = this.next;
-        for (i = 0; !(entry.isHead); i++) {
-            entry = entry.next;
-        }
-        return (i);
-    }
-    first() {
-        if (!this.empty()) {
-            return (this.next.data);
-        }
-    }
-    last() {
-        if (!this.empty()) {
-            return (this.prev.data);
-        }
-    }
-    empty() {
-        return (this.next === this);
-    }
-    /**
-     * @deprecated - use unshift
-     */
-    push(data) {
-        this.unshift(data);
-    }
-    unshift(data) {
-        const entry = ListMakeEntry(data);
-        entry.data = data;
-        entry.isHead = false;
-        entry.next = this.next;
-        entry.prev = this;
-        this.next = entry;
-        entry.next.prev = entry;
-    }
-    [Symbol.iterator]() {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias
-        let node = this;
-        const iterator = {
-            next() {
-                while (node && node.next.isHead === false) {
-                    node = node.next;
-                    if (node.data !== undefined) {
-                        return { value: node.data, done: false };
-                    }
-                }
-                return { value: undefined, done: true };
-            },
-            [Symbol.iterator]() {
-                return this;
-            },
-        };
-        return iterator;
-    }
-}
-exports.List = List;
-class Heap {
-    constructor(a, comp) {
-        this.comp = comp;
-        this.L = [comp.min];
-        for (let i = 0, len = a.length; i < len; i++) {
-            this.add(a[i]);
-        }
-    }
-    count() {
-        return this.L.length - 1;
-    }
-    peek() {
-        return this.L[1];
-    }
-    get() {
-        const x = this.L[1];
-        this.L[1] = this.L[this.count()];
-        this.L.pop();
-        this.fixDown(1);
-        return x;
-    }
-    add(x) {
-        this.L.push(x);
-        this.fixup(this.count());
-    }
-    /* eslint-disable no-bitwise */
-    fixup(k) {
-        let _k = k;
-        while (_k > 1 && (this.comp.compare(this.L[_k >> 1], this.L[_k]) > 0)) {
-            const tmp = this.L[_k >> 1];
-            this.L[_k >> 1] = this.L[_k];
-            this.L[_k] = tmp;
-            _k = _k >> 1;
-        }
-    }
-    fixDown(k) {
-        let _k = k;
-        while ((_k << 1) <= (this.count())) {
-            let j = _k << 1;
-            if ((j < this.count()) && (this.comp.compare(this.L[j], this.L[j + 1]) > 0)) {
-                j++;
-            }
-            if (this.comp.compare(this.L[_k], this.L[j]) <= 0) {
-                break;
-            }
-            const tmp = this.L[_k];
-            this.L[_k] = this.L[j];
-            this.L[j] = tmp;
-            _k = j;
-        }
-    }
-}
-exports.Heap = Heap;
+exports.RedBlackTree = exports.RBColor = void 0;
+/* eslint-disable @typescript-eslint/consistent-type-assertions */
+/* Remove once strictNullCheck is enabled */
+/**
+ * @internal
+ */
 exports.RBColor = {
     RED: 0,
     BLACK: 1,
 };
+/**
+ * @internal
+ */
 class RedBlackTree {
     constructor(compareKeys, aug) {
         this.compareKeys = compareKeys;
@@ -718,245 +521,4 @@ class RedBlackTree {
     }
 }
 exports.RedBlackTree = RedBlackTree;
-const integerRangeToString = (range) => `[${range.start},${range.end})`;
-exports.integerRangeToString = integerRangeToString;
-const intervalComparer = (a, b) => a.compare(b);
-class IntervalTree {
-    constructor() {
-        this.intervals = new RedBlackTree(intervalComparer, this);
-    }
-    remove(x) {
-        this.intervals.remove(x);
-    }
-    removeExisting(x) {
-        this.intervals.removeExisting(x);
-    }
-    put(x, conflict) {
-        let rbConflict;
-        if (conflict) {
-            rbConflict = (key, currentKey) => {
-                const ival = conflict(key, currentKey);
-                return {
-                    key: ival,
-                };
-            };
-        }
-        this.intervals.put(x, { minmax: x.clone() }, rbConflict);
-    }
-    map(fn) {
-        const actions = {
-            infix: (node) => {
-                fn(node.key);
-                return true;
-            },
-            showStructure: true,
-        };
-        this.intervals.walk(actions);
-    }
-    mapUntil(fn) {
-        const actions = {
-            infix: (node) => {
-                return fn(node.key);
-            },
-            showStructure: true,
-        };
-        this.intervals.walk(actions);
-    }
-    mapBackward(fn) {
-        const actions = {
-            infix: (node) => {
-                fn(node.key);
-                return true;
-            },
-            showStructure: true,
-        };
-        this.intervals.walkBackward(actions);
-    }
-    // TODO: toString()
-    match(x) {
-        return this.intervals.gather(x, this);
-    }
-    matchNode(node, key) {
-        return !!node && node.key.overlaps(key);
-    }
-    continueSubtree(node, key) {
-        return !!node && node.data.minmax.overlaps(key);
-    }
-    update(node) {
-        if (node.left && node.right) {
-            node.data.minmax = node.key.union(node.left.data.minmax.union(node.right.data.minmax));
-        }
-        else {
-            if (node.left) {
-                node.data.minmax = node.key.union(node.left.data.minmax);
-            }
-            else if (node.right) {
-                node.data.minmax = node.key.union(node.right.data.minmax);
-            }
-            else {
-                node.data.minmax = node.key.clone();
-            }
-        }
-    }
-}
-exports.IntervalTree = IntervalTree;
-class TST {
-    constructor() {
-        this.n = 0;
-    }
-    size() {
-        return this.n;
-    }
-    contains(key) {
-        return this.get(key);
-    }
-    get(key) {
-        const x = this.nodeGet(this.root, key, 0);
-        if (x === undefined) {
-            return undefined;
-        }
-        return x.val;
-    }
-    nodeGet(x, key, d) {
-        if (x === undefined) {
-            return undefined;
-        }
-        const c = key.charAt(d);
-        if (c < x.c) {
-            return this.nodeGet(x.left, key, d);
-        }
-        else if (c > x.c) {
-            return this.nodeGet(x.right, key, d);
-        }
-        else if (d < (key.length - 1)) {
-            return this.nodeGet(x.mid, key, d + 1);
-        }
-        else {
-            return x;
-        }
-    }
-    put(key, val) {
-        if (!this.contains(key)) {
-            this.n++;
-        }
-        this.root = this.nodePut(this.root, key, val, 0);
-    }
-    nodePut(x, key, val, d) {
-        let _x = x;
-        const c = key.charAt(d);
-        if (_x === undefined) {
-            _x = { c };
-        }
-        if (c < _x.c) {
-            _x.left = this.nodePut(_x.left, key, val, d);
-        }
-        else if (c > _x.c) {
-            _x.right = this.nodePut(_x.right, key, val, d);
-        }
-        else if (d < (key.length - 1)) {
-            _x.mid = this.nodePut(_x.mid, key, val, d + 1);
-        }
-        else {
-            _x.val = val;
-        }
-        return _x;
-    }
-    neighbors(text, distance = 2) {
-        let q = [];
-        this.nodeProximity(this.root, { text: "" }, 0, text, distance, q);
-        q = q.filter((value) => (value.text.length > 0));
-        return q;
-    }
-    keysWithPrefix(text) {
-        const q = [];
-        const x = this.nodeGet(this.root, text, 0);
-        if (x === undefined) {
-            return q;
-        }
-        if (x.val !== undefined) {
-            q.push(text);
-        }
-        this.collect(x.mid, { text }, q);
-        return q;
-    }
-    collect(x, prefix, q) {
-        if (x === undefined) {
-            return;
-        }
-        this.collect(x.left, prefix, q);
-        if (x.val !== undefined) {
-            q.push(prefix.text + x.c);
-        }
-        this.collect(x.mid, { text: prefix.text + x.c }, q);
-        this.collect(x.right, prefix, q);
-    }
-    mapNode(x, prefix, fn) {
-        if (x === undefined) {
-            return;
-        }
-        const key = prefix.text + x.c;
-        this.mapNode(x.left, prefix, fn);
-        if (x.val) {
-            fn(key, x.val);
-        }
-        this.mapNode(x.mid, { text: key }, fn);
-        this.mapNode(x.right, prefix, fn);
-    }
-    map(fn) {
-        this.mapNode(this.root, { text: "" }, fn);
-    }
-    pairsWithPrefix(text) {
-        const q = [];
-        const x = this.nodeGet(this.root, text, 0);
-        if (x === undefined) {
-            return q;
-        }
-        if (x.val !== undefined) {
-            q.push({ key: text, val: x.val });
-        }
-        this.collectPairs(x.mid, { text }, q);
-        return q;
-    }
-    collectPairs(x, prefix, q) {
-        if (x === undefined) {
-            return;
-        }
-        this.collectPairs(x.left, prefix, q);
-        if (x.val !== undefined) {
-            q.push({ key: prefix.text + x.c, val: x.val });
-        }
-        this.collectPairs(x.mid, { text: prefix.text + x.c }, q);
-        this.collectPairs(x.right, prefix, q);
-    }
-    nodeProximity(x, prefix, d, pattern, distance, q) {
-        if ((x === undefined) || (distance < 0)) {
-            return;
-        }
-        const c = pattern.charAt(d);
-        if ((distance > 0) || (c < x.c)) {
-            this.nodeProximity(x.left, prefix, d, pattern, distance, q);
-        }
-        if (x.val !== undefined) {
-            const remD = distance - (pattern.length - d);
-            if (remD >= 0) {
-                let invD = distance;
-                if (c !== x.c) {
-                    invD--;
-                }
-                q.push({ text: prefix.text + x.c, val: x.val, invDistance: invD });
-            }
-        }
-        const recurD = (d < (pattern.length - 1)) ? d + 1 : d;
-        if (c === x.c) {
-            this.nodeProximity(x.mid, { text: prefix.text + x.c }, recurD, pattern, distance, q);
-        }
-        else {
-            this.nodeProximity(x.mid, { text: prefix.text + x.c }, recurD, pattern, distance - 1, q);
-        }
-        if ((distance > 0) || (c > x.c)) {
-            this.nodeProximity(x.right, prefix, d, pattern, distance, q);
-        }
-    }
-}
-exports.TST = TST;
-//# sourceMappingURL=collections.js.map
+//# sourceMappingURL=rbTree.js.map

package/dist/collections/rbTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rbTree.js","sourceRoot":"","sources":["../../src/collections/rbTree.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAAkE;AAElE,4CAA4C;AAE5C;;GAEG;AACU,QAAA,OAAO,GAAG;IACnB,GAAG,EAAE,CAAC;IACN,KAAK,EAAE,CAAC;CACF,CAAC;AAmGX;;GAEG;AACH,MAAa,YAAY;IAGrB,YACqB,WAA8B,EAC9B,GAAkC;QADlC,gBAAW,GAAX,WAAW,CAAmB;QAC9B,QAAG,GAAH,GAAG,CAA+B;IACnD,CAAC;IAEG,QAAQ,CAAC,GAAS,EAAE,IAAW,EAAE,KAAc,EAAE,IAAY;QACjE,OAA4B,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAC3D,CAAC;IAEO,KAAK,CAAC,IAAqC;QAC/C,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC;IAEO,QAAQ,CAAC,IAAqC;QAClD,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACM,IAAI;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACM,OAAO;QACV,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;IACtB,CAAC;IACM,GAAG,CAAC,GAAS;QAChB,IAAI,GAAG,KAAK,SAAS,EAAE;YACnB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;SACvC;IACL,CAAC;IACO,OAAO,CAAC,IAAqC,EAAE,GAAS;QAC5D,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,OAAO,KAAK,EAAE;YACV,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7C,IAAI,GAAG,GAAG,CAAC,EAAE;gBACT,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;aACtB;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE;gBAChB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;aACvB;iBAAM;gBACH,OAAO,KAAK,CAAC;aAChB;SACJ;IACL,CAAC;IACO,QAAQ,CAAC,GAAS;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAEM,MAAM,CAAC,GAAS,EAAE,OAAgC;QACrD,MAAM,OAAO,GAAG,EAA2B,CAAC;QAC5C,IAAI,GAAG,KAAK,SAAS,EAAE;YACnB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;SACrD;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAEO,UAAU,CACd,IAAqC,EACrC,OAA8B,EAC9B,GAAS,EACT,OAAgC;QAChC,IAAI,IAAI,EAAE;YACN,IAAI,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;gBACzC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;aACrD;YACD,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;gBAC9B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACtB;YACD,IAAI,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE;gBAC1C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;aACtD;SACJ;IACL,CAAC;IAEM,uBAAuB,CAC1B,SAAgD,EAChD,QAA6C,EAC7C,cAA2C,EAC3C,eAA4C;QAC5C,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;IACtG,CAAC;IAEO,2BAA2B,CAC/B,IAAqC,EACrC,SAAgD,EAChD,QAA6C,EAC7C,cAA2C,EAC3C,eAA4C;QAC5C,IAAI,CAAC,IAAI,EAAE;YACP,OAAO;SACV;QACD,MAAM,MAAM,GAAW,SAAS,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE;YACxB,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;SACrG;QACD,IAAI,MAAM,KAAK,CAAC,EAAE;YACd,QAAQ,CAAC,IAAI,CAAC,CAAC;SAClB;QACD,IAAI,eAAe,CAAC,MAAM,CAAC,EAAE;YACzB,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;SACtG;IACL,CAAC;IAEM,wBAAwB,CAC3B,SAAgD,EAChD,QAA6C,EAC7C,cAA2C,EAC3C,eAA4C;QAC5C,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;IACvG,CAAC;IAEO,4BAA4B,CAChC,IAAqC,EACrC,SAAgD,EAChD,QAA6C,EAC7C,cAAwC,EACxC,eAAyC;QACzC,IAAI,CAAC,IAAI,EAAE;YACP,OAAO;SACV;QACD,MAAM,MAAM,GAAW,SAAS,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,eAAe,CAAC,MAAM,CAAC,EAAE;YACzB,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;SACvG;QACD,IAAI,MAAM,KAAK,CAAC,EAAE;YACd,QAAQ,CAAC,IAAI,CAAC,CAAC;SAClB;QACD,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE;YACxB,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;SACtG;IACL,CAAC;IAEM,GAAG,CAAC,GAAS,EAAE,IAAW,EAAE,QAAsC;QACrE,IAAI,GAAG,KAAK,SAAS,EAAE;YACnB,IAAI,IAAI,KAAK,SAAS,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;aACpB;iBAAM;gBACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBACzD,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,KAAK,CAAC;aACnC;SACJ;IACL,CAAC;IAEO,OAAO,CACX,IAAqC,EACrC,GAAS,EAAE,IAAW,EACtB,QAAsC;QAEtC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,EAAE;YACR,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,eAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;SACnD;aAAM;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7C,IAAI,GAAG,GAAG,CAAC,EAAE;gBACT,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;aAC9D;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE;gBAChB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;aAChE;iBAAM;gBACH,IAAI,QAAQ,EAAE;oBACV,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;oBACtD,IAAI,EAAE,CAAC,GAAG,EAAE;wBACR,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC;qBACtB;oBACD,IAAI,EAAE,CAAC,IAAI,EAAE;wBACT,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;qBACxB;yBAAM;wBACH,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;qBACrB;iBACJ;qBAAM;oBACH,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;iBACrB;aACJ;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE;gBACtD,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;aAClC;YACD,oEAAoE;YACpE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAK,CAAC,IAAI,CAAC,EAAE;gBACxD,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;gBACnD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;aAC1B;YACD,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACxE,IAAI,IAAI,CAAC,GAAG,EAAE;gBACV,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;aAC3B;YACD,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;IAEO,WAAW,CAAC,IAAyB;QACzC,IAAI,IAAI,CAAC,GAAG,EAAE;YACV,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACvB,oEAAoE;gBACpE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;aAC/B;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACxB,oEAAoE;gBACpE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,CAAC,CAAC;aAChC;YACD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SACzB;IACL,CAAC;IAEO,aAAa,CAAC,IAAyB;QAC3C,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,KAAK,CAAC,IAAI,EAAE;YACZ,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;gBAC7D,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;aACnC;YAED,oEAAoE;YACpE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAK,CAAC,CAAC;YAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;SAC9B;IACL,CAAC;IAEM,MAAM,CAAC,GAAS;QACnB,IAAI,GAAG,KAAK,SAAS,EAAE;YACnB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;gBACrB,OAAO;aACV;YAED,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;SAC5B;QACD,+BAA+B;IACnC,CAAC;IAEM,cAAc,CAAC,GAAS;QAC3B,oEAAoE;QACpE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAK,CAAC,KAAK,CAAC,CAAC,EAAE;YACnE,oEAAoE;YACpE,IAAI,CAAC,IAAK,CAAC,KAAK,GAAG,eAAO,CAAC,GAAG,CAAC;SAClC;QAED,oEAAoE;QACpE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAK,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;IAEO,UAAU,CAAC,IAAyB,EAAE,GAAS;QACnD,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACtC,oEAAoE;YACpE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAK,CAAC,IAAI,CAAC,CAAC,EAAE;gBAC9D,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,oEAAoE;YACpE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAK,EAAE,GAAG,CAAC,CAAC;SAClD;aAAM;YACH,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;gBACxB,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;gBAC5D,OAAO,SAAS,CAAC;aACpB;YACD,oEAAoE;YACpE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAM,CAAC,IAAI,CAAC,CAAC,EAAE;gBAChE,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;aACpC;YACD,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACxC,oEAAoE;gBACpE,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAM,CAAC,CAAC;gBAC9C,KAAK,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC;gBAC3B,KAAK,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC;gBAC7B,oEAAoE;gBACpE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,KAAM,CAAC,CAAC;aAClD;iBAAM;gBACH,oEAAoE;gBACpE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAM,EAAE,GAAG,CAAC,CAAC;aACpD;SACJ;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAEM,KAAK,CAAC,GAAS;QAClB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE;YACjB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;SACzC;IACL,CAAC;IAEO,SAAS,CAAC,IAAqC,EAAE,GAAS;QAC9D,IAAI,IAAI,EAAE;YACN,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5C,IAAI,GAAG,KAAK,CAAC,EAAE;gBACX,OAAO,IAAI,CAAC;aACf;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE;gBAChB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;aACzC;iBAAM;gBACH,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBACnD,IAAI,UAAU,EAAE;oBACZ,OAAO,UAAU,CAAC;iBACrB;qBAAM;oBACH,OAAO,IAAI,CAAC;iBACf;aACJ;SACJ;IACL,CAAC;IAEM,IAAI,CAAC,GAAS;QACjB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE;YACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;SACxC;IACL,CAAC;IAEO,QAAQ,CAAC,IAAqC,EAAE,GAAS;QAC7D,IAAI,IAAI,EAAE;YACN,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5C,IAAI,GAAG,KAAK,CAAC,EAAE;gBACX,OAAO,IAAI,CAAC;aACf;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE;gBAChB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;aACzC;iBAAM;gBACH,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC/C,IAAI,QAAQ,EAAE;oBACV,OAAO,QAAQ,CAAC;iBACnB;qBAAM;oBACH,OAAO,IAAI,CAAC;iBACf;aACJ;SACJ;IACL,CAAC;IAEM,GAAG;QACN,IAAI,IAAI,CAAC,IAAI,EAAE;YACX,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAClC;IACL,CAAC;IAEO,OAAO,CAAC,IAAyB;QACrC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACZ,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAClC;IACL,CAAC;IAEM,GAAG;QACN,IAAI,IAAI,CAAC,IAAI,EAAE;YACX,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAClC;IACL,CAAC;IAEO,OAAO,CAAC,IAAyB;QACrC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACb,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnC;IACL,CAAC;IAEO,WAAW,CAAC,IAAyB;QACzC,oEAAoE;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,IAAK,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC;QAC5B,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC;QACvB,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC;QACxC,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,eAAO,CAAC,GAAG,CAAC;QACpC,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrE,IAAI,IAAI,CAAC,GAAG,EAAE;YACV,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;SAC/B;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAEO,UAAU,CAAC,IAAyB;QACxC,oEAAoE;QACpE,MAAM,UAAU,GAAG,IAAI,CAAC,KAAM,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC;QAC7B,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC;QACvB,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;QACzC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,GAAG,CAAC;QACpC,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrE,IAAI,IAAI,CAAC,GAAG,EAAE;YACV,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;SAChC;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;IAEO,aAAa,CAAC,CAAU;QAC5B,OAAO,CAAC,CAAC,KAAK,eAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,eAAO,CAAC,GAAG,CAAC,CAAC,CAAC,eAAO,CAAC,KAAK,CAAC;IAC/D,CAAC;IAEO,UAAU,CAAC,IAAyB;QACxC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,oEAAoE;QACpE,IAAI,CAAC,IAAK,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAK,CAAC,KAAK,CAAC,CAAC;QACxD,oEAAoE;QACpE,IAAI,CAAC,KAAM,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAM,CAAC,KAAK,CAAC,CAAC;IAC9D,CAAC;IAEO,WAAW,CAAC,IAAyB;QACzC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,oEAAoE;QACpE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAM,CAAC,IAAI,CAAC,EAAE;YAC/B,oEAAoE;YACpE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAM,CAAC,CAAC;YAC7C,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;SAC1B;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,YAAY,CAAC,IAAyB;QAC1C,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,oEAAoE;QACpE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAK,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;SAC1B;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,OAAO,CAAC,KAA0B;QACtC,IAAI,IAAI,GAAoC,KAAK,CAAC;QAClD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACxB,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SAChC;QACD,oEAAoE;QACpE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAK,CAAC,IAAI,CAAC,EAAE;YACtD,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;SACjC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;YACnD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACzB;QACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrE,IAAI,IAAI,CAAC,GAAG,EAAE;YACV,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SACzB;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,QAAQ,CAAS,MAAmC,EAAE,KAAc,EAAE,KAAY,EAAE,GAAU;QACjG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAChD,CAAC;IAEM,GAAG,CAAS,MAAmC,EAAE,KAAc;QAClE,sCAAsC;QACtC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAEM,IAAI;QACP,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,MAAM,OAAO,GAA+B;YACxC,aAAa,EAAE,IAAI;YACnB,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;gBACZ,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnB,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,OAAmC;QAC3C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtC,CAAC;IAEM,YAAY,CAAC,OAAmC;QACnD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAEO,QAAQ,CAAC,IAAqC,EAAE,OAAmC;QACvF,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,IAAI,EAAE;YACN,IAAI,OAAO,CAAC,GAAG,EAAE;gBACb,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,KAAK,CAAC,EAAE;oBACzD,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;iBAC1B;aACJ;YACD,IAAI,IAAI,CAAC,IAAI,EAAE;gBACX,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;aAC1C;YACD,IAAI,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE;gBACrB,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,KAAK,CAAC,EAAE;oBACzD,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;iBAC5B;aACJ;YACD,IAAI,EAAE,EAAE;gBACJ,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;aAC3C;YACD,IAAI,EAAE,IAAI,OAAO,CAAC,IAAI,EAAE;gBACpB,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,KAAK,CAAC,EAAE;oBACzD,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAC3B;aACJ;SACJ;QACD,OAAO,EAAE,CAAC;IACd,CAAC;IAEO,gBAAgB,CAAC,IAAqC,EAAE,OAAmC;QAC/F,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,IAAI,EAAE;YACN,IAAI,OAAO,CAAC,GAAG,EAAE;gBACb,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,KAAK,CAAC,EAAE;oBACzD,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;iBAC1B;aACJ;YACD,IAAI,IAAI,CAAC,KAAK,EAAE;gBACZ,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;aACnD;YACD,IAAI,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE;gBACrB,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,KAAK,CAAC,EAAE;oBACzD,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;iBAC5B;aACJ;YACD,IAAI,EAAE,EAAE;gBACJ,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;aAClD;YACD,IAAI,EAAE,IAAI,OAAO,CAAC,IAAI,EAAE;gBACpB,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,eAAO,CAAC,KAAK,CAAC,EAAE;oBACzD,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAC3B;aACJ;SACJ;QACD,OAAO,EAAE,CAAC;IACd,CAAC;IAEO,OAAO,CACX,IAAqC,EACrC,MAAmC,EACnC,KAAc,EACd,KAAY,EACZ,GAAU;QAEV,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,EAAE;YACP,OAAO,IAAI,CAAC;SACf;QACD,IAAI,MAAM,KAAK,SAAS,EAAE;YACtB,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;SACnC;QACD,IAAI,IAAI,KAAK,SAAS,EAAE;YACpB,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;SACjC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,QAAQ,GAAG,CAAC,EAAE;YACd,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;SAC7D;QACD,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE;YACxC,mCAAmC;YACnC,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;SAC5B;QACD,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;YACpB,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;SAC9D;QACD,OAAO,EAAE,CAAC;IACd,CAAC;CACJ;AAhjBD,oCAgjBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable @typescript-eslint/consistent-type-assertions */\n\n/* Remove once strictNullCheck is enabled */\n\n/**\n * @internal\n */\nexport const RBColor = {\n    RED: 0,\n    BLACK: 1,\n} as const;\n\n/**\n * @internal\n */\nexport type RBColor = typeof RBColor[keyof typeof RBColor];\n\n/**\n * @internal\n */\nexport interface RBNode<TKey, TData> {\n    key: TKey;\n    data: TData;\n    left: RBNode<TKey, TData> | undefined;\n    right: RBNode<TKey, TData> | undefined;\n    color: RBColor;\n    size: number;\n}\n/**\n * @internal\n */\nexport interface IRBAugmentation<TKey, TData> {\n    update(node: RBNode<TKey, TData>): void;\n}\n/**\n * @internal\n */\nexport interface IRBMatcher<TKey, TData> {\n    continueSubtree(node: RBNode<TKey, TData> | undefined, key: TKey): boolean;\n    matchNode(node: RBNode<TKey, TData> | undefined, key: TKey): boolean;\n}\n\n/**\n * @internal\n */\nexport interface RBNodeActions<TKey, TData> {\n    infix?(node: RBNode<TKey, TData>): boolean;\n    pre?(node: RBNode<TKey, TData>): boolean;\n    post?(node: RBNode<TKey, TData>): boolean;\n    showStructure?: boolean;\n}\n\n/**\n * @internal\n */\nexport interface KeyComparer<TKey> {\n    // eslint-disable-next-line @typescript-eslint/prefer-function-type\n    (a: TKey, b: TKey): number;\n}\n\n/**\n * @internal\n */\n export interface Property<TKey, TData> {\n    key: TKey;\n    data: TData;\n}\n\n/**\n * @internal\n */\n export interface PropertyAction<TKey, TData> {\n    // eslint-disable-next-line @typescript-eslint/prefer-function-type\n    <TAccum>(p: Property<TKey, TData>, accum?: TAccum): boolean;\n}\n\n/**\n * @internal\n */\n export interface QProperty<TKey, TData> {\n    key?: TKey;\n    data?: TData;\n}\n\n/**\n * @internal\n */\nexport type ConflictAction<TKey, TData> =\n    (key: TKey, currentKey: TKey, data: TData, currentData: TData) => QProperty<TKey, TData>;\n\n/**\n * @internal\n */\nexport interface SortedDictionary<TKey, TData> extends Dictionary<TKey, TData> {\n    max(): Property<TKey, TData> | undefined;\n    min(): Property<TKey, TData> | undefined;\n    mapRange<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum, start?: TKey, end?: TKey): void;\n}\n\n/**\n * @internal\n */\nexport interface Dictionary<TKey, TData> {\n    get(key: TKey): Property<TKey, TData> | undefined;\n    put(key: TKey, data: TData, conflict?: ConflictAction<TKey, TData>): void;\n    remove(key: TKey): void;\n    map<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum): void;\n}\n\n/**\n * @internal\n */\nexport class RedBlackTree<TKey, TData> implements SortedDictionary<TKey, TData> {\n    private root: RBNode<TKey, TData> | undefined;\n\n    constructor(\n        private readonly compareKeys: KeyComparer<TKey>,\n        private readonly aug?: IRBAugmentation<TKey, TData>,\n    ) { }\n\n    private makeNode(key: TKey, data: TData, color: RBColor, size: number) {\n        return <RBNode<TKey, TData>>{ key, data, color, size };\n    }\n\n    private isRed(node: RBNode<TKey, TData> | undefined) {\n        return !!node && (node.color === RBColor.RED);\n    }\n\n    private nodeSize(node: RBNode<TKey, TData> | undefined) {\n        return node ? node.size : 0;\n    }\n    public size() {\n        return this.nodeSize(this.root);\n    }\n    public isEmpty() {\n        return !this.root;\n    }\n    public get(key: TKey) {\n        if (key !== undefined) {\n            return this.nodeGet(this.root, key);\n        }\n    }\n    private nodeGet(node: RBNode<TKey, TData> | undefined, key: TKey) {\n        let _node = node;\n        while (_node) {\n            const cmp = this.compareKeys(key, _node.key);\n            if (cmp < 0) {\n                _node = _node.left;\n            } else if (cmp > 0) {\n                _node = _node.right;\n            } else {\n                return _node;\n            }\n        }\n    }\n    private contains(key: TKey) {\n        return this.get(key);\n    }\n\n    public gather(key: TKey, matcher: IRBMatcher<TKey, TData>) {\n        const results = [] as RBNode<TKey, TData>[];\n        if (key !== undefined) {\n            this.nodeGather(this.root, results, key, matcher);\n        }\n        return results;\n    }\n\n    private nodeGather(\n        node: RBNode<TKey, TData> | undefined,\n        results: RBNode<TKey, TData>[],\n        key: TKey,\n        matcher: IRBMatcher<TKey, TData>) {\n        if (node) {\n            if (matcher.continueSubtree(node.left, key)) {\n                this.nodeGather(node.left, results, key, matcher);\n            }\n            if (matcher.matchNode(node, key)) {\n                results.push(node);\n            }\n            if (matcher.continueSubtree(node.right, key)) {\n                this.nodeGather(node.right, results, key, matcher);\n            }\n        }\n    }\n\n    public walkExactMatchesForward(\n        compareFn: (node: RBNode<TKey, TData>) => number,\n        actionFn: (node: RBNode<TKey, TData>) => void,\n        continueLeftFn: (number: number) => boolean,\n        continueRightFn: (number: number) => boolean) {\n        this.nodeWalkExactMatchesForward(this.root, compareFn, actionFn, continueLeftFn, continueRightFn);\n    }\n\n    private nodeWalkExactMatchesForward(\n        node: RBNode<TKey, TData> | undefined,\n        compareFn: (node: RBNode<TKey, TData>) => number,\n        actionFn: (node: RBNode<TKey, TData>) => void,\n        continueLeftFn: (number: number) => boolean,\n        continueRightFn: (number: number) => boolean) {\n        if (!node) {\n            return;\n        }\n        const result: number = compareFn(node);\n        if (continueLeftFn(result)) {\n            this.nodeWalkExactMatchesForward(node.left, compareFn, actionFn, continueLeftFn, continueRightFn);\n        }\n        if (result === 0) {\n            actionFn(node);\n        }\n        if (continueRightFn(result)) {\n            this.nodeWalkExactMatchesForward(node.right, compareFn, actionFn, continueLeftFn, continueRightFn);\n        }\n    }\n\n    public walkExactMatchesBackward(\n        compareFn: (node: RBNode<TKey, TData>) => number,\n        actionFn: (node: RBNode<TKey, TData>) => void,\n        continueLeftFn: (number: number) => boolean,\n        continueRightFn: (number: number) => boolean) {\n        this.nodeWalkExactMatchesBackward(this.root, compareFn, actionFn, continueLeftFn, continueRightFn);\n    }\n\n    private nodeWalkExactMatchesBackward(\n        node: RBNode<TKey, TData> | undefined,\n        compareFn: (node: RBNode<TKey, TData>) => number,\n        actionFn: (node: RBNode<TKey, TData>) => void,\n        continueLeftFn: (cmp: number) => boolean,\n        continueRightFn: (cmp: number) => boolean) {\n        if (!node) {\n            return;\n        }\n        const result: number = compareFn(node);\n        if (continueRightFn(result)) {\n            this.nodeWalkExactMatchesBackward(node.right, compareFn, actionFn, continueLeftFn, continueRightFn);\n        }\n        if (result === 0) {\n            actionFn(node);\n        }\n        if (continueLeftFn(result)) {\n            this.nodeWalkExactMatchesBackward(node.left, compareFn, actionFn, continueLeftFn, continueRightFn);\n        }\n    }\n\n    public put(key: TKey, data: TData, conflict?: ConflictAction<TKey, TData>) {\n        if (key !== undefined) {\n            if (data === undefined) {\n                this.remove(key);\n            } else {\n                this.root = this.nodePut(this.root, key, data, conflict);\n                this.root.color = RBColor.BLACK;\n            }\n        }\n    }\n\n    private nodePut(\n        node: RBNode<TKey, TData> | undefined,\n        key: TKey, data: TData,\n        conflict?: ConflictAction<TKey, TData>,\n    ) {\n        let _node = node;\n        if (!_node) {\n            return this.makeNode(key, data, RBColor.RED, 1);\n        } else {\n            const cmp = this.compareKeys(key, _node.key);\n            if (cmp < 0) {\n                _node.left = this.nodePut(_node.left, key, data, conflict);\n            } else if (cmp > 0) {\n                _node.right = this.nodePut(_node.right, key, data, conflict);\n            } else {\n                if (conflict) {\n                    const kd = conflict(key, _node.key, data, _node.data);\n                    if (kd.key) {\n                        _node.key = kd.key;\n                    }\n                    if (kd.data) {\n                        _node.data = kd.data;\n                    } else {\n                        _node.data = data;\n                    }\n                } else {\n                    _node.data = data;\n                }\n            }\n            if (this.isRed(_node.right) && (!this.isRed(_node.left))) {\n                _node = this.rotateLeft(_node);\n            }\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            if (this.isRed(_node.left) && this.isRed(_node.left!.left)) {\n                _node = this.rotateRight(_node);\n            }\n            if (this.isRed(_node.left) && this.isRed(_node.right)) {\n                this.flipColors(_node);\n            }\n            _node.size = this.nodeSize(_node.left) + this.nodeSize(_node.right) + 1;\n            if (this.aug) {\n                this.updateLocal(_node);\n            }\n            return _node;\n        }\n    }\n\n    private updateLocal(node: RBNode<TKey, TData>) {\n        if (this.aug) {\n            if (this.isRed(node.left)) {\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                this.aug.update(node.left!);\n            }\n            if (this.isRed(node.right)) {\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                this.aug.update(node.right!);\n            }\n            this.aug.update(node);\n        }\n    }\n\n    private nodeRemoveMin(node: RBNode<TKey, TData>) {\n        let _node = node;\n        if (_node.left) {\n            if ((!this.isRed(_node.left)) && (!this.isRed(_node.left.left))) {\n                _node = this.moveRedLeft(_node);\n            }\n\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            _node.left = this.nodeRemoveMin(_node.left!);\n            return this.balance(_node);\n        }\n    }\n\n    public remove(key: TKey) {\n        if (key !== undefined) {\n            if (!this.contains(key)) {\n                return;\n            }\n\n            this.removeExisting(key);\n        }\n        // TODO: error on undefined key\n    }\n\n    public removeExisting(key: TKey) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if ((!this.isRed(this.root!.left)) && (!this.isRed(this.root!.right))) {\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            this.root!.color = RBColor.RED;\n        }\n\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        this.root = this.nodeRemove(this.root!, key);\n    }\n\n    private nodeRemove(node: RBNode<TKey, TData>, key: TKey) {\n        let _node = node;\n        if (this.compareKeys(key, _node.key) < 0) {\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            if ((!this.isRed(_node.left)) && (!this.isRed(_node.left!.left))) {\n                _node = this.moveRedLeft(_node);\n            }\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            _node.left = this.nodeRemove(_node.left!, key);\n        } else {\n            if (this.isRed(_node.left)) {\n                _node = this.rotateRight(_node);\n            }\n            if ((this.compareKeys(key, _node.key) === 0) && (!_node.right)) {\n                return undefined;\n            }\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            if ((!this.isRed(_node.right)) && (!this.isRed(_node.right!.left))) {\n                _node = this.moveRedRight(_node);\n            }\n            if (this.compareKeys(key, _node.key) === 0) {\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                const subtreeMin = this.nodeMin(_node.right!);\n                _node.key = subtreeMin.key;\n                _node.data = subtreeMin.data;\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                _node.right = this.nodeRemoveMin(_node.right!);\n            } else {\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                _node.right = this.nodeRemove(_node.right!, key);\n            }\n        }\n        return this.balance(_node);\n    }\n\n    public floor(key: TKey) {\n        if (!this.isEmpty()) {\n            return this.nodeFloor(this.root, key);\n        }\n    }\n\n    private nodeFloor(node: RBNode<TKey, TData> | undefined, key: TKey): RBNode<TKey, TData> | undefined {\n        if (node) {\n            const cmp = this.compareKeys(key, node.key);\n            if (cmp === 0) {\n                return node;\n            } else if (cmp < 0) {\n                return this.nodeFloor(node.left, key);\n            } else {\n                const rightFloor = this.nodeFloor(node.right, key);\n                if (rightFloor) {\n                    return rightFloor;\n                } else {\n                    return node;\n                }\n            }\n        }\n    }\n\n    public ceil(key: TKey) {\n        if (!this.isEmpty()) {\n            return this.nodeCeil(this.root, key);\n        }\n    }\n\n    private nodeCeil(node: RBNode<TKey, TData> | undefined, key: TKey): RBNode<TKey, TData> | undefined {\n        if (node) {\n            const cmp = this.compareKeys(key, node.key);\n            if (cmp === 0) {\n                return node;\n            } else if (cmp > 0) {\n                return this.nodeCeil(node.right, key);\n            } else {\n                const leftCeil = this.nodeCeil(node.left, key);\n                if (leftCeil) {\n                    return leftCeil;\n                } else {\n                    return node;\n                }\n            }\n        }\n    }\n\n    public min() {\n        if (this.root) {\n            return this.nodeMin(this.root);\n        }\n    }\n\n    private nodeMin(node: RBNode<TKey, TData>): RBNode<TKey, TData> {\n        if (!node.left) {\n            return node;\n        } else {\n            return this.nodeMin(node.left);\n        }\n    }\n\n    public max() {\n        if (this.root) {\n            return this.nodeMax(this.root);\n        }\n    }\n\n    private nodeMax(node: RBNode<TKey, TData>): RBNode<TKey, TData> {\n        if (!node.right) {\n            return node;\n        } else {\n            return this.nodeMax(node.right);\n        }\n    }\n\n    private rotateRight(node: RBNode<TKey, TData>) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const leftChild = node.left!;\n        node.left = leftChild.right;\n        leftChild.right = node;\n        leftChild.color = leftChild.right.color;\n        leftChild.right.color = RBColor.RED;\n        leftChild.size = node.size;\n        node.size = this.nodeSize(node.left) + this.nodeSize(node.right) + 1;\n        if (this.aug) {\n            this.updateLocal(node);\n            this.updateLocal(leftChild);\n        }\n        return leftChild;\n    }\n\n    private rotateLeft(node: RBNode<TKey, TData>) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const rightChild = node.right!;\n        node.right = rightChild.left;\n        rightChild.left = node;\n        rightChild.color = rightChild.left.color;\n        rightChild.left.color = RBColor.RED;\n        rightChild.size = node.size;\n        node.size = this.nodeSize(node.left) + this.nodeSize(node.right) + 1;\n        if (this.aug) {\n            this.updateLocal(node);\n            this.updateLocal(rightChild);\n        }\n        return rightChild;\n    }\n\n    private oppositeColor(c: RBColor) {\n        return (c === RBColor.BLACK) ? RBColor.RED : RBColor.BLACK;\n    }\n\n    private flipColors(node: RBNode<TKey, TData>) {\n        node.color = this.oppositeColor(node.color);\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        node.left!.color = this.oppositeColor(node.left!.color);\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        node.right!.color = this.oppositeColor(node.right!.color);\n    }\n\n    private moveRedLeft(node: RBNode<TKey, TData>) {\n        let _node = node;\n        this.flipColors(_node);\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (this.isRed(_node.right!.left)) {\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            _node.right = this.rotateRight(_node.right!);\n            _node = this.rotateLeft(_node);\n            this.flipColors(_node);\n        }\n        return _node;\n    }\n\n    private moveRedRight(node: RBNode<TKey, TData>) {\n        let _node = node;\n        this.flipColors(_node);\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (this.isRed(_node.left!.left)) {\n            _node = this.rotateRight(_node);\n            this.flipColors(_node);\n        }\n        return _node;\n    }\n\n    private balance(input: RBNode<TKey, TData>) {\n        let node: RBNode<TKey, TData> | undefined = input;\n        if (this.isRed(node.right)) {\n            node = this.rotateLeft(node);\n        }\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (this.isRed(node.left) && this.isRed(node.left!.left)) {\n            node = this.rotateRight(node);\n        }\n        if (this.isRed(node.left) && (this.isRed(node.right))) {\n            this.flipColors(node);\n        }\n        node.size = this.nodeSize(node.left) + this.nodeSize(node.right) + 1;\n        if (this.aug) {\n            this.aug.update(node);\n        }\n        return node;\n    }\n\n    public mapRange<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum, start?: TKey, end?: TKey) {\n        this.nodeMap(this.root, action, start, end);\n    }\n\n    public map<TAccum>(action: PropertyAction<TKey, TData>, accum?: TAccum) {\n        // TODO: optimize to avoid comparisons\n        this.nodeMap(this.root, action, accum);\n    }\n\n    public keys() {\n        const keyList = <TKey[]>[];\n        const actions = <RBNodeActions<TKey, TData>>{\n            showStructure: true,\n            infix: (node) => {\n                keyList.push(node.key);\n                return true;\n            },\n        };\n        this.walk(actions);\n        return keyList;\n    }\n\n    /**\n     * Depth-first traversal with custom action; if action returns\n     * false, traversal is halted.\n     * @param action - action to apply to each node\n     */\n    public walk(actions: RBNodeActions<TKey, TData>) {\n        this.nodeWalk(this.root, actions);\n    }\n\n    public walkBackward(actions: RBNodeActions<TKey, TData>) {\n        this.nodeWalkBackward(this.root, actions);\n    }\n\n    private nodeWalk(node: RBNode<TKey, TData> | undefined, actions: RBNodeActions<TKey, TData>): boolean {\n        let go = true;\n        if (node) {\n            if (actions.pre) {\n                if (actions.showStructure || (node.color === RBColor.BLACK)) {\n                    go = actions.pre(node);\n                }\n            }\n            if (node.left) {\n                go = this.nodeWalk(node.left, actions);\n            }\n            if (go && actions.infix) {\n                if (actions.showStructure || (node.color === RBColor.BLACK)) {\n                    go = actions.infix(node);\n                }\n            }\n            if (go) {\n                go = this.nodeWalk(node.right, actions);\n            }\n            if (go && actions.post) {\n                if (actions.showStructure || (node.color === RBColor.BLACK)) {\n                    go = actions.post(node);\n                }\n            }\n        }\n        return go;\n    }\n\n    private nodeWalkBackward(node: RBNode<TKey, TData> | undefined, actions: RBNodeActions<TKey, TData>): boolean {\n        let go = true;\n        if (node) {\n            if (actions.pre) {\n                if (actions.showStructure || (node.color === RBColor.BLACK)) {\n                    go = actions.pre(node);\n                }\n            }\n            if (node.right) {\n                go = this.nodeWalkBackward(node.right, actions);\n            }\n            if (go && actions.infix) {\n                if (actions.showStructure || (node.color === RBColor.BLACK)) {\n                    go = actions.infix(node);\n                }\n            }\n            if (go) {\n                go = this.nodeWalkBackward(node.left, actions);\n            }\n            if (go && actions.post) {\n                if (actions.showStructure || (node.color === RBColor.BLACK)) {\n                    go = actions.post(node);\n                }\n            }\n        }\n        return go;\n    }\n\n    private nodeMap<TAccum>(\n        node: RBNode<TKey, TData> | undefined,\n        action: PropertyAction<TKey, TData>,\n        accum?: TAccum,\n        start?: TKey,\n        end?: TKey,\n    ): boolean {\n        let _start = start;\n        let _end = end;\n        if (!node) {\n            return true;\n        }\n        if (_start === undefined) {\n            _start = this.nodeMin(node).key;\n        }\n        if (_end === undefined) {\n            _end = this.nodeMax(node).key;\n        }\n        const cmpStart = this.compareKeys(_start, node.key);\n        const cmpEnd = this.compareKeys(_end, node.key);\n        let go = true;\n        if (cmpStart < 0) {\n            go = this.nodeMap(node.left, action, accum, _start, _end);\n        }\n        if (go && (cmpStart <= 0) && (cmpEnd >= 0)) {\n            // REVIEW: test for black node here\n            go = action(node, accum);\n        }\n        if (go && (cmpEnd > 0)) {\n            go = this.nodeMap(node.right, action, accum, _start, _end);\n        }\n        return go;\n    }\n}\n"]}

package/dist/collections/stack.d.ts

@@ -0,0 +1,16 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export declare class Stack<T> {
+    items: T[];
+    push(val: T): void;
+    empty(): boolean;
+    top(): T | undefined;
+    pop(): T | undefined;
+}
+//# sourceMappingURL=stack.d.ts.map

package/dist/collections/stack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.d.ts","sourceRoot":"","sources":["../../src/collections/stack.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AACH,qBAAa,KAAK,CAAC,CAAC;IACT,KAAK,EAAE,CAAC,EAAE,CAAM;IAChB,IAAI,CAAC,GAAG,EAAE,CAAC;IAIX,KAAK;IAIL,GAAG,IAAI,CAAC,GAAG,SAAS;IAIpB,GAAG,IAAI,CAAC,GAAG,SAAS;CAG9B"}

package/dist/collections/stack.js

@@ -0,0 +1,30 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Stack = void 0;
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+class Stack {
+    constructor() {
+        this.items = [];
+    }
+    push(val) {
+        this.items.push(val);
+    }
+    empty() {
+        return this.items.length === 0;
+    }
+    top() {
+        return this.items[this.items.length - 1];
+    }
+    pop() {
+        return this.items.pop();
+    }
+}
+exports.Stack = Stack;
+//# sourceMappingURL=stack.js.map

package/dist/collections/stack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.js","sourceRoot":"","sources":["../../src/collections/stack.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH;;;GAGG;AACH,MAAa,KAAK;IAAlB;QACW,UAAK,GAAQ,EAAE,CAAC;IAgB3B,CAAC;IAfU,IAAI,CAAC,GAAM;QACd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAEM,KAAK;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACnC,CAAC;IAEM,GAAG;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IAEM,GAAG;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC5B,CAAC;CACJ;AAjBD,sBAiBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport class Stack<T> {\n    public items: T[] = [];\n    public push(val: T) {\n        this.items.push(val);\n    }\n\n    public empty() {\n        return this.items.length === 0;\n    }\n\n    public top(): T | undefined {\n        return this.items[this.items.length - 1];\n    }\n\n    public pop(): T | undefined {\n        return this.items.pop();\n    }\n}\n"]}

package/dist/collections/tst.d.ts

@@ -0,0 +1,55 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export interface TSTResult<T> {
+    key: string;
+    val: T;
+}
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export interface TSTNode<T> {
+    c: string;
+    left?: TSTNode<T>;
+    mid?: TSTNode<T>;
+    right?: TSTNode<T>;
+    val?: T;
+}
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export interface ProxString<T> {
+    text: string;
+    invDistance: number;
+    val: T;
+}
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export declare class TST<T> {
+    private n;
+    private root;
+    size(): number;
+    private contains;
+    get(key: string): T | undefined;
+    private nodeGet;
+    put(key: string, val: T): void;
+    private nodePut;
+    neighbors(text: string, distance?: number): ProxString<T>[];
+    keysWithPrefix(text: string): string[];
+    private collect;
+    private mapNode;
+    map(fn: (key: string, val: T) => void): void;
+    pairsWithPrefix(text: string): TSTResult<T>[];
+    private collectPairs;
+    private nodeProximity;
+}
+//# sourceMappingURL=tst.d.ts.map

package/dist/collections/tst.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tst.d.ts","sourceRoot":"","sources":["../../src/collections/tst.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AACF,MAAM,WAAW,SAAS,CAAC,CAAC;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,CAAC,CAAC;CACV;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO,CAAC,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAClB,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACnB,GAAG,CAAC,EAAE,CAAC,CAAC;CACX;AAMD;;;GAGG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,GAAG,EAAE,CAAC,CAAC;CACV;AAED;;;GAGG;AACH,qBAAa,GAAG,CAAC,CAAC;IACd,OAAO,CAAC,CAAC,CAAK;IACd,OAAO,CAAC,IAAI,CAAyB;IAE9B,IAAI;IAIX,OAAO,CAAC,QAAQ;IAIT,GAAG,CAAC,GAAG,EAAE,MAAM;IAQtB,OAAO,CAAC,OAAO;IAcR,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAO9B,OAAO,CAAC,OAAO;IAkBR,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAI;IAOpC,cAAc,CAAC,IAAI,EAAE,MAAM;IAalC,OAAO,CAAC,OAAO;IAYf,OAAO,CAAC,OAAO;IAaR,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI;IAIrC,eAAe,CAAC,IAAI,EAAE,MAAM;IAanC,OAAO,CAAC,YAAY;IAYpB,OAAO,CAAC,aAAa;CAkCxB"}