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

package/dist/collections/intervalTree.js

@@ -0,0 +1,99 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IntervalTree = exports.integerRangeToString = void 0;
+const rbTree_1 = require("./rbTree");
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+const integerRangeToString = (range) => `[${range.start},${range.end})`;
+exports.integerRangeToString = integerRangeToString;
+const intervalComparer = (a, b) => a.compare(b);
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+class IntervalTree {
+    constructor() {
+        this.intervals = new rbTree_1.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;
+//# sourceMappingURL=intervalTree.js.map

package/dist/collections/intervalTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intervalTree.js","sourceRoot":"","sources":["../../src/collections/intervalTree.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAMH,qCAA4G;AAU5G;;;GAGG;AACI,MAAM,oBAAoB,GAAG,CAAC,KAAoB,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC;AAAjF,QAAA,oBAAoB,wBAA6D;AAgB9F,MAAM,gBAAgB,GAAG,CAAC,CAAY,EAAE,CAAY,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAYtE;;;GAGG;AACH,MAAa,YAAY;IAAzB;QAEW,cAAS,GAAG,IAAI,qBAAY,CAA2B,gBAAgB,EAAE,IAAI,CAAC,CAAC;IAkF1F,CAAC;IAhFU,MAAM,CAAC,CAAI;QACd,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAEM,cAAc,CAAC,CAAI;QACtB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAEM,GAAG,CAAC,CAAI,EAAE,QAAsC;QACnD,IAAI,UAAgE,CAAC;QACrE,IAAI,QAAQ,EAAE;YACV,UAAU,GAAG,CAAC,GAAM,EAAE,UAAa,EAAE,EAAE;gBACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;gBACvC,OAAO;oBACH,GAAG,EAAE,IAAI;iBACZ,CAAC;YACN,CAAC,CAAC;SACL;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IAEM,GAAG,CAAC,EAAkB;QACzB,MAAM,OAAO,GAA4C;YACrD,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;gBACZ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACb,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,aAAa,EAAE,IAAI;SACtB,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAEM,QAAQ,CAAC,EAAqB;QACjC,MAAM,OAAO,GAA4C;YACrD,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;gBACZ,OAAO,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxB,CAAC;YACD,aAAa,EAAE,IAAI;SACtB,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAEM,WAAW,CAAC,EAAkB;QACjC,MAAM,OAAO,GAA4C;YACrD,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;gBACZ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACb,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,aAAa,EAAE,IAAI;SACtB,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,mBAAmB;IACZ,KAAK,CAAC,CAAI;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAEM,SAAS,CAAC,IAAiC,EAAE,GAAM;QACtD,OAAO,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC5C,CAAC;IAEM,eAAe,CAAC,IAAiC,EAAE,GAAM;QAC5D,OAAO,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACpD,CAAC;IAEM,MAAM,CAAC,IAAqB;QAC/B,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAC7B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SAC5D;aAAM;YACH,IAAI,IAAI,CAAC,IAAI,EAAE;gBACX,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aAC5D;iBAAM,IAAI,IAAI,CAAC,KAAK,EAAE;gBACnB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aAC7D;iBAAM;gBACH,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;aACvC;SACJ;IACL,CAAC;CACJ;AApFD,oCAoFC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport {\n    IIntegerRange,\n} from \"../base\";\nimport { ConflictAction, IRBAugmentation, IRBMatcher, RBNode, RBNodeActions, RedBlackTree } from \"./rbTree\";\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport interface AugmentedIntervalNode {\n    minmax: IInterval;\n}\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport const integerRangeToString = (range: IIntegerRange) => `[${range.start},${range.end})`;\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport interface IInterval {\n    clone(): IInterval;\n    compare(b: IInterval): number;\n    compareStart(b: IInterval): number;\n    compareEnd(b: IInterval): number;\n    modify(label: string, start: number, end: number, op?: ISequencedDocumentMessage): IInterval | undefined;\n    overlaps(b: IInterval): boolean;\n    union(b: IInterval): IInterval;\n}\n\nconst intervalComparer = (a: IInterval, b: IInterval) => a.compare(b);\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport type IntervalNode<T extends IInterval> = RBNode<T, AugmentedIntervalNode>;\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport type IntervalConflictResolver<TInterval> = (a: TInterval, b: TInterval) => TInterval;\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport class IntervalTree<T extends IInterval> implements IRBAugmentation<T, AugmentedIntervalNode>,\n    IRBMatcher<T, AugmentedIntervalNode> {\n    public intervals = new RedBlackTree<T, AugmentedIntervalNode>(intervalComparer, this);\n\n    public remove(x: T) {\n        this.intervals.remove(x);\n    }\n\n    public removeExisting(x: T) {\n        this.intervals.removeExisting(x);\n    }\n\n    public put(x: T, conflict?: IntervalConflictResolver<T>) {\n        let rbConflict: ConflictAction<T, AugmentedIntervalNode> | undefined;\n        if (conflict) {\n            rbConflict = (key: T, currentKey: T) => {\n                const ival = conflict(key, currentKey);\n                return {\n                    key: ival,\n                };\n            };\n        }\n        this.intervals.put(x, { minmax: x.clone() }, rbConflict);\n    }\n\n    public map(fn: (x: T) => void) {\n        const actions: RBNodeActions<T, AugmentedIntervalNode> = {\n            infix: (node) => {\n                fn(node.key);\n                return true;\n            },\n            showStructure: true,\n        };\n        this.intervals.walk(actions);\n    }\n\n    public mapUntil(fn: (X: T) => boolean) {\n        const actions: RBNodeActions<T, AugmentedIntervalNode> = {\n            infix: (node) => {\n                return fn(node.key);\n            },\n            showStructure: true,\n        };\n        this.intervals.walk(actions);\n    }\n\n    public mapBackward(fn: (x: T) => void) {\n        const actions: RBNodeActions<T, AugmentedIntervalNode> = {\n            infix: (node) => {\n                fn(node.key);\n                return true;\n            },\n            showStructure: true,\n        };\n        this.intervals.walkBackward(actions);\n    }\n\n    // TODO: toString()\n    public match(x: T) {\n        return this.intervals.gather(x, this);\n    }\n\n    public matchNode(node: IntervalNode<T> | undefined, key: T) {\n        return !!node && node.key.overlaps(key);\n    }\n\n    public continueSubtree(node: IntervalNode<T> | undefined, key: T) {\n        return !!node && node.data.minmax.overlaps(key);\n    }\n\n    public update(node: IntervalNode<T>) {\n        if (node.left && node.right) {\n            node.data.minmax = node.key.union(\n                node.left.data.minmax.union(node.right.data.minmax));\n        } else {\n            if (node.left) {\n                node.data.minmax = node.key.union(node.left.data.minmax);\n            } else if (node.right) {\n                node.data.minmax = node.key.union(node.right.data.minmax);\n            } else {\n                node.data.minmax = node.key.clone();\n            }\n        }\n    }\n}\n"]}

package/dist/collections/list.d.ts

@@ -0,0 +1,39 @@
+/*!
+ * 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 function ListRemoveEntry<U>(entry: List<U>): List<U> | undefined;
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export declare function ListMakeHead<U>(): List<U>;
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+export declare class List<T> {
+    isHead: boolean;
+    data: T | undefined;
+    next: List<T>;
+    prev: List<T>;
+    constructor(isHead: boolean, data: T | undefined);
+    clear(): void;
+    private add;
+    dequeue(): T | undefined;
+    enqueue(data: T): List<T>;
+    pop?(): T | undefined;
+    walk(fn: (data: T, l: List<T>) => void): void;
+    some(fn: (data: T, l: List<T>) => boolean, rev?: boolean): T[];
+    count(): number;
+    first(): T | undefined;
+    last(): T | undefined;
+    empty(): boolean;
+    unshift(data: T): void;
+    [Symbol.iterator](): IterableIterator<T>;
+}
+//# sourceMappingURL=list.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../src/collections/list.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAYtE;AAMD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAEzC;AAED;;;GAGG;AACH,qBAAa,IAAI,CAAC,CAAC;IAII,MAAM,EAAE,OAAO;IAAS,IAAI,EAAE,CAAC,GAAG,SAAS;IAHvD,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEF,MAAM,EAAE,OAAO,EAAS,IAAI,EAAE,CAAC,GAAG,SAAS;IAKvD,KAAK,IAAI,IAAI;IAOpB,OAAO,CAAC,GAAG;IASJ,OAAO,IAAI,CAAC,GAAG,SAAS;IAQxB,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAIzB,GAAG,CAAC,IAAI,CAAC,GAAG,SAAS;IAKrB,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI;IAO7C,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE;IAkB9D,KAAK,IAAI,MAAM;IAWf,KAAK,IAAI,CAAC,GAAG,SAAS;IAMtB,IAAI,IAAI,CAAC,GAAG,SAAS;IAMrB,KAAK,IAAI,OAAO;IAIhB,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI;IAUtB,CAAC,MAAM,CAAC,QAAQ,CAAC;CAmB3B"}

package/dist/collections/list.js

@@ -0,0 +1,155 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.List = exports.ListMakeHead = exports.ListRemoveEntry = void 0;
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+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;
+        entry.next = deadhead;
+        entry.prev = deadhead;
+    }
+    return (entry);
+}
+exports.ListRemoveEntry = ListRemoveEntry;
+function ListMakeEntry(data) {
+    return new List(false, data);
+}
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+function ListMakeHead() {
+    return new List(true, undefined);
+}
+exports.ListMakeHead = ListMakeHead;
+/**
+ * @deprecated  for internal use only. public export will be removed.
+ * @internal
+ */
+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);
+    }
+    pop() {
+        const removedEntry = ListRemoveEntry(this.prev);
+        return removedEntry ? removedEntry.data : undefined;
+    }
+    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);
+    }
+    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]() {
+        let node = this.next;
+        const iterator = {
+            next() {
+                while (node && node.isHead === false) {
+                    const value = node.data;
+                    node = node.next;
+                    if (value !== undefined) {
+                        return { value, done: false };
+                    }
+                }
+                return { value: undefined, done: true };
+            },
+            [Symbol.iterator]() {
+                return this;
+            },
+        };
+        return iterator;
+    }
+}
+exports.List = List;
+const deadhead = ListMakeHead();
+//# sourceMappingURL=list.js.map

package/dist/collections/list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/collections/list.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH;;;GAGG;AACH,SAAgB,eAAe,CAAI,KAAc;IAC7C,IAAI,KAAK,KAAK,SAAS,EAAE;QACrB,OAAO,SAAS,CAAC;KACpB;SAAM,IAAI,KAAK,CAAC,MAAM,EAAE;QACrB,OAAO,SAAS,CAAC;KACpB;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAC7B,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;KACzB;IACD,OAAO,CAAC,KAAK,CAAC,CAAC;AACnB,CAAC;AAZD,0CAYC;AAED,SAAS,aAAa,CAAI,IAAO;IAC7B,OAAO,IAAI,IAAI,CAAI,KAAK,EAAE,IAAI,CAAC,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY;IACxB,OAAO,IAAI,IAAI,CAAI,IAAI,EAAE,SAAS,CAAC,CAAC;AACxC,CAAC;AAFD,oCAEC;AAED;;;GAGG;AACH,MAAa,IAAI;IAIb,YAAmB,MAAe,EAAS,IAAmB;QAA3C,WAAM,GAAN,MAAM,CAAS;QAAS,SAAI,GAAJ,IAAI,CAAe;QAC1D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAEM,KAAK;QACR,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SACpB;IACL,CAAC;IAEO,GAAG,CAAC,IAAO;QACf,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QACvB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QAClB,OAAO,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAEM,OAAO;QACV,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE;YACf,oEAAoE;YACpE,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;YACjD,OAAO,YAAY,CAAC,IAAI,CAAC;SAC5B;IACL,CAAC;IAEM,OAAO,CAAC,IAAO;QAClB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEM,GAAG;QACN,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,OAAO,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACxD,CAAC;IAEM,IAAI,CAAC,EAAiC;QACzC,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE;YAC7D,oEAAoE;YACpE,EAAE,CAAC,KAAK,CAAC,IAAK,EAAE,KAAK,CAAC,CAAC;SAC1B;IACL,CAAC;IAEM,IAAI,CAAC,EAAoC,EAAE,GAAa;QAC3D,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAC1C,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE;YAC5E,oEAAoE;YACpE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAK,CAAC;YACzB,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;gBACjB,IAAI,GAAG,EAAE;oBACL,sCAAsC;oBACtC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;iBACrB;qBAAM;oBACH,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAClB;aACJ;SACJ;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAEM,KAAK;QACR,IAAI,KAAc,CAAC;QACnB,IAAI,CAAS,CAAC;QAEd,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE;YAC9B,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;SACtB;QACD,OAAO,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAEM,KAAK;QACR,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE;YACf,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACL,CAAC;IAEM,IAAI;QACP,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE;YACf,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACL,CAAC;IAEM,KAAK;QACR,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAChC,CAAC;IAEM,OAAO,CAAC,IAAO;QAClB,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC;QACrB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IAC5B,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAwB,IAAI,CAAC,IAAI,CAAC;QAC1C,MAAM,QAAQ,GAAwB;YAClC,IAAI;gBACA,OAAO,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,EAAE;oBAClC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;oBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACjB,IAAI,KAAK,KAAK,SAAS,EAAE;wBACrB,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;qBACjC;iBACJ;gBACD,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC5C,CAAC;YACD,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACb,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;QACF,OAAO,QAAQ,CAAC;IACpB,CAAC;CACJ;AA3HD,oBA2HC;AAED,MAAM,QAAQ,GAAG,YAAY,EAAO,CAAC","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 function ListRemoveEntry<U>(entry: List<U>): List<U> | undefined {\n    if (entry === undefined) {\n        return undefined;\n    } else if (entry.isHead) {\n        return undefined;\n    } else {\n        entry.next.prev = entry.prev;\n        entry.prev.next = entry.next;\n        entry.next = deadhead;\n        entry.prev = deadhead;\n    }\n    return (entry);\n}\n\nfunction ListMakeEntry<U>(data: U): List<U> {\n    return new List<U>(false, data);\n}\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport function ListMakeHead<U>(): List<U> {\n    return new List<U>(true, undefined);\n}\n\n/**\n * @deprecated  for internal use only. public export will be removed.\n * @internal\n */\nexport class List<T> {\n    public next: List<T>;\n    public prev: List<T>;\n\n    constructor(public isHead: boolean, public data: T | undefined) {\n        this.prev = this;\n        this.next = this;\n    }\n\n    public clear(): void {\n        if (this.isHead) {\n            this.prev = this;\n            this.next = this;\n        }\n    }\n\n    private add(data: T): List<T> {\n        const entry = ListMakeEntry(data);\n        this.prev.next = entry;\n        entry.next = this;\n        entry.prev = this.prev;\n        this.prev = entry;\n        return (entry);\n    }\n\n    public dequeue(): T | undefined {\n        if (!this.empty()) {\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const removedEntry = ListRemoveEntry(this.next)!;\n            return removedEntry.data;\n        }\n    }\n\n    public enqueue(data: T): List<T> {\n        return this.add(data);\n    }\n\n    public pop?(): T | undefined {\n        const removedEntry = ListRemoveEntry(this.prev);\n        return removedEntry ? removedEntry.data : undefined;\n    }\n\n    public walk(fn: (data: T, l: List<T>) => void): void {\n        for (let entry = this.next; !(entry.isHead); entry = entry.next) {\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            fn(entry.data!, entry);\n        }\n    }\n\n    public some(fn: (data: T, l: List<T>) => boolean, rev?: boolean): T[] {\n        const rtn: T[] = [];\n        const start = rev ? this.prev : this.next;\n        for (let entry = start; !(entry.isHead); entry = rev ? entry.prev : entry.next) {\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const data = entry.data!;\n            if (fn(data, entry)) {\n                if (rev) {\n                    // preserve list order when in reverse\n                    rtn.unshift(data);\n                } else {\n                    rtn.push(data);\n                }\n            }\n        }\n        return rtn;\n    }\n\n    public count(): number {\n        let entry: List<T>;\n        let i: number;\n\n        entry = this.next;\n        for (i = 0; !(entry.isHead); i++) {\n            entry = entry.next;\n        }\n        return (i);\n    }\n\n    public first(): T | undefined {\n        if (!this.empty()) {\n            return (this.next.data);\n        }\n    }\n\n    public last(): T | undefined {\n        if (!this.empty()) {\n            return (this.prev.data);\n        }\n    }\n\n    public empty(): boolean {\n        return (this.next === this);\n    }\n\n    public unshift(data: T): void {\n        const entry = ListMakeEntry(data);\n        entry.data = data;\n        entry.isHead = false;\n        entry.next = this.next;\n        entry.prev = this;\n        this.next = entry;\n        entry.next.prev = entry;\n    }\n\n    public [Symbol.iterator]() {\n        let node: List<T> | undefined = this.next;\n        const iterator: IterableIterator<T> = {\n            next(): IteratorResult<T> {\n                while (node && node.isHead === false) {\n                    const value = node.data;\n                    node = node.next;\n                    if (value !== undefined) {\n                        return { value, done: false };\n                    }\n                }\n                return { value: undefined, done: true };\n            },\n            [Symbol.iterator]() {\n                return this;\n            },\n        };\n        return iterator;\n    }\n}\n\nconst deadhead = ListMakeHead<any>();\n"]}

package/dist/collections/rbTree.d.ts

@@ -0,0 +1,154 @@
+/*!
+ * 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 declare 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 declare 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;
+    floor(key: TKey): RBNode<TKey, TData> | undefined;
+    private nodeFloor;
+    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/dist/collections/rbTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rbTree.d.ts","sourceRoot":"","sources":["../../src/collections/rbTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH;;GAEG;AACH,eAAO,MAAM,OAAO;;;CAGV,CAAC;AAEX;;GAEG;AACH,oBAAY,OAAO,GAAG,OAAO,OAAO,CAAC,MAAM,OAAO,OAAO,CAAC,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,MAAM,CAAC,IAAI,EAAE,KAAK;IAC/B,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;CAChB;AACD;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,IAAI,EAAE,KAAK;IACxC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;CAC3C;AACD;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,IAAI,EAAE,KAAK;IACnC,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;CACxE;AAED;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,IAAI,EAAE,KAAK;IACtC,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;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,IAAI;IAE7B,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC;CAC9B;AAED;;GAEG;AACF,MAAM,WAAW,QAAQ,CAAC,IAAI,EAAE,KAAK;IAClC,GAAG,EAAE,IAAI,CAAC;IACV,IAAI,EAAE,KAAK,CAAC;CACf;AAED;;GAEG;AACF,MAAM,WAAW,cAAc,CAAC,IAAI,EAAE,KAAK;IAExC,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CAC/D;AAED;;GAEG;AACF,MAAM,WAAW,SAAS,CAAC,IAAI,EAAE,KAAK;IACnC,GAAG,CAAC,EAAE,IAAI,CAAC;IACX,IAAI,CAAC,EAAE,KAAK,CAAC;CAChB;AAED;;GAEG;AACH,oBAAY,cAAc,CAAC,IAAI,EAAE,KAAK,IAClC,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,KAAK,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE7F;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAE,SAAQ,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC;IAC1E,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,EAAE,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;CACzG;AAED;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,IAAI,EAAE,KAAK;IACnC,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;CAC1E;AAED;;GAEG;AACH,qBAAa,YAAY,CAAC,IAAI,EAAE,KAAK,CAAE,YAAW,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC;IAIvE,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;IAJzB,OAAO,CAAC,IAAI,CAAkC;gBAGzB,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,EAC9B,GAAG,CAAC,0CAA8B;IAGvD,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,KAAK;IAIb,OAAO,CAAC,QAAQ;IAGT,IAAI;IAGJ,OAAO;IAGP,GAAG,CAAC,GAAG,EAAE,IAAI;IAKpB,OAAO,CAAC,OAAO;IAaf,OAAO,CAAC,QAAQ;IAIT,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC;IAQzD,OAAO,CAAC,UAAU;IAkBX,uBAAuB,CAC1B,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;IAIhD,OAAO,CAAC,2BAA2B;IAqB5B,wBAAwB,CAC3B,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;IAIhD,OAAO,CAAC,4BAA4B;IAqB7B,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC;IAWzE,OAAO,CAAC,OAAO;IA+Cf,OAAO,CAAC,WAAW;IAcnB,OAAO,CAAC,aAAa;IAad,MAAM,CAAC,GAAG,EAAE,IAAI;IAWhB,cAAc,CAAC,GAAG,EAAE,IAAI;IAW/B,OAAO,CAAC,UAAU;IAmCX,KAAK,CAAC,GAAG,EAAE,IAAI;IAMtB,OAAO,CAAC,SAAS;IAkBV,IAAI,CAAC,GAAG,EAAE,IAAI;IAMrB,OAAO,CAAC,QAAQ;IAkBT,GAAG;IAMV,OAAO,CAAC,OAAO;IAQR,GAAG;IAMV,OAAO,CAAC,OAAO;IAQf,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,EAAE,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI;IAI9F,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;IAK/D,IAAI;IAaX;;;;OAIG;IACI,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC;IAIxC,YAAY,CAAC,OAAO,EAAE,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC;IAIvD,OAAO,CAAC,QAAQ;IA4BhB,OAAO,CAAC,gBAAgB;IA4BxB,OAAO,CAAC,OAAO;CAiClB"}