@fluidframework/matrix 0.56.7 → 0.57.1

package/dist/handlecache.js.map

@@ -1 +1 @@
-{"version":3,"file":"handlecache.js","sourceRoot":"","sources":["../src/handlecache.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+BAA+B;AAE/B,+DAAsD;AAEtD,+CAAsD;AAEtD,mCAAsC;AAEtC;;;;;GAKG;AACH,MAAa,WAAW;IAIpB,YAA4B,MAAyB;QAAzB,WAAM,GAAN,MAAM,CAAmB;QAH7C,YAAO,GAAa,EAAE,CAAC;QACvB,UAAK,GAAG,CAAC,CAAC;IAEuC,CAAC;IAE1D;;;OAGG;IACK,QAAQ,CAAC,QAAgB;QAC7B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACI,SAAS,CAAC,QAAgB;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAEtC,uFAAuF;QACvF,8BAA8B;QAE9B,oFAAoF;QACpF,qFAAqF;QACrF,uEAAuE;QAEvE,OAAO,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,8EAA8E;IACvE,SAAS,CAAC,QAAgB,EAAE,MAAc;QAC7C,qBAAM,CAAC,2BAAa,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAE3E,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,qBAAM,CAAC,CAAC,2BAAa,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EACtC,KAAK,CAAC,wEAAwE,CAAC,CAAC;YACpF,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;SAChC;IACL,CAAC;IAED,0EAA0E;IAClE,UAAU,CAAC,KAAa,EAAE,GAAW;QACzC,sFAAsF;QACtF,gBAAgB;QAEhB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAExB,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE;YACpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,MAAM,GAAG,OAA6B,CAAC;YAC7C,oEAAoE;YACpE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,MAAO,CAAC,CAAC;SACxC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAEO,SAAS,CAAC,QAAgB;QAC9B,mFAAmF;QACnF,yDAAyD;QACzD,MAAM,SAAS,GAAG,QAAQ,KAAK,CAAC,CAAC;QAEjC,8EAA8E;QAC9E,kBAAkB;QAElB,6EAA6E;QAC7E,+EAA+E;QAC/E,2BAA2B;QAE3B,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE;YACxB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3E,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC1B;aAAM;YACH,mBAAW,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAEhD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACrG,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAChD;IACL,CAAC;IAED,0BAA0B;IAE1B,YAAY,CAAC,KAAa,EAAE,YAAoB,EAAE,aAAqB;QACnE,8EAA8E;QAC9E,6EAA6E;QAC7E,aAAa;QACb,EAAE;QACF,4EAA4E;QAC5E,wBAAwB;QACxB,EAAE;QACF,6FAA6F;QAC7F,2EAA2E;QAC3E,EAAE;QACF,gFAAgF;QAEhF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,GAAI,KAAK,CAAC;SAChC;IACL,CAAC;CAGJ;AAjHD,kCAiHC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { IVectorConsumer } from \"@tiny-calc/nano\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { ensureRange } from \"./range\";\n\n/**\n * Used by PermutationVector to cache position -> handle lookups.\n *\n * Perf: Possibly, this should eventually be inlined into PermutationVector itself, but\n *       so far there's no measurable perf penalty for being a separate object (node 12 x64)\n */\nexport class HandleCache implements IVectorConsumer<Handle> {\n    private handles: Handle[] = [];\n    private start = 0;\n\n    constructor(public readonly vector: PermutationVector) { }\n\n    /**\n     * Returns the index of the given position in the 'handles' array as a Uint32.\n     * (If the position is not in the array, returns an integer greater than 'handles.length').\n     */\n    private getIndex(position: number) {\n        return (position - this.start) >>> 0;\n    }\n\n    /**\n     * Returns the handle currently assigned to the given 'position' (if any).  Check\n     * the result with 'isValidHandle(..)' to see if a handle has been allocated for\n     * the given position.\n     *\n     * Throws a 'RangeError' if the provided 'position' is out-of-bounds wrt. the\n     * PermutationVector's length.\n     */\n    public getHandle(position: number) {\n        const index = this.getIndex(position);\n\n        // Perf: To encourage inlining, handling of the 'cacheMiss(..)' case has been extracted\n        //       to a separate method.\n\n        // Perf: A cache hit implies that 'position' was in bounds.  Therefore, we can defer\n        //       checking that 'position' is in bounds until 'cacheMiss(..)'.  This yields an\n        //       ~40% speedup when the position is in the cache (node v12 x64).\n\n        return index < this.handles.length\n            ? this.handles[index]\n            : this.cacheMiss(position);\n    }\n\n    /** Update the cache when a handle has been allocated for a given position. */\n    public addHandle(position: number, handle: Handle) {\n        assert(isHandleValid(handle), 0x017 /* \"Trying to add invalid handle!\" */);\n\n        const index = this.getIndex(position);\n        if (index < this.handles.length) {\n            assert(!isHandleValid(this.handles[index]),\n                0x018 /* \"Trying to insert handle into position with already valid handle!\" */);\n            this.handles[index] = handle;\n        }\n    }\n\n    /** Used by 'CacheMiss()' to retrieve handles for a range of positions. */\n    private getHandles(start: number, end: number) {\n        // TODO: This can be accelerated substantially using 'walkSegments()'.  The only catch\n        //       is that\n\n        const handles: Handle[] = [];\n        const { vector } = this;\n\n        for (let pos = start; pos < end; pos++) {\n            const { segment, offset } = vector.getContainingSegment(pos);\n            const asPerm = segment as PermutationSegment;\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            handles.push(asPerm.start + offset!);\n        }\n\n        return handles;\n    }\n\n    private cacheMiss(position: number) {\n        // Coercing 'position' to an Uint32 allows us to handle a negative 'position' value\n        // with the same logic that handles 'position' >= length.\n        const _position = position >>> 0;\n\n        // TODO: To bound memory usage, there should be a limit on the maximum size of\n        //       handle[].\n\n        // TODO: To reduce MergeTree lookups, this code should opportunistically grow\n        //       the cache to the next MergeTree segment boundary (within the limits of\n        //       the handle cache).\n\n        if (_position < this.start) {\n            this.handles = this.getHandles(_position, this.start).concat(this.handles);\n            this.start = _position;\n            return this.handles[0];\n        } else {\n            ensureRange(_position, this.vector.getLength());\n\n            this.handles = this.handles.concat(this.getHandles(this.start + this.handles.length, _position + 1));\n            return this.handles[this.handles.length - 1];\n        }\n    }\n\n    // #region IVectorConsumer\n\n    itemsChanged(start: number, removedCount: number, insertedCount: number): void {\n        // If positions were inserted/removed, our current policy is to trim the array\n        // at the beginning of the invalidate range and lazily repopulate the handles\n        // on demand.\n        //\n        // Some alternatives to consider that preserve the previously cached handles\n        // that are still valid:\n        //\n        //      * Eagerly populate the 'handles[]' with the newly insert values (currently guaranteed\n        //        to be Handle.unallocated, so we don't even need to look them up.)\n        //\n        //      * Use a sentinel value or other mechanism to allow \"holes\" in the cache.\n\n        const index = this.getIndex(start);\n        if (index < this.handles.length) {\n            this.handles.length =  index;\n        }\n    }\n\n    // #endregion IVectorConsumer\n}\n"]}
+{"version":3,"file":"handlecache.js","sourceRoot":"","sources":["../src/handlecache.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+BAA+B;AAE/B,+DAAsD;AAEtD,+CAAsD;AAEtD,mCAAsC;AAEtC;;;;;GAKG;AACH,MAAa,WAAW;IAIpB,YAA4B,MAAyB;QAAzB,WAAM,GAAN,MAAM,CAAmB;QAH7C,YAAO,GAAa,EAAE,CAAC;QACvB,UAAK,GAAG,CAAC,CAAC;IAEuC,CAAC;IAE1D;;;OAGG;IACK,QAAQ,CAAC,QAAgB;QAC7B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACI,SAAS,CAAC,QAAgB;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAEtC,uFAAuF;QACvF,8BAA8B;QAE9B,oFAAoF;QACpF,qFAAqF;QACrF,uEAAuE;QAEvE,OAAO,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,8EAA8E;IACvE,SAAS,CAAC,QAAgB,EAAE,MAAc;QAC7C,qBAAM,CAAC,2BAAa,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAE3E,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,qBAAM,CAAC,CAAC,2BAAa,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EACtC,KAAK,CAAC,wEAAwE,CAAC,CAAC;YACpF,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;SAChC;IACL,CAAC;IAED,0EAA0E;IAClE,UAAU,CAAC,KAAa,EAAE,GAAW;QACzC,sFAAsF;QACtF,gBAAgB;QAEhB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAExB,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE;YACpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,MAAM,GAAG,OAA6B,CAAC;YAC7C,oEAAoE;YACpE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,MAAO,CAAC,CAAC;SACxC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAEO,SAAS,CAAC,QAAgB;QAC9B,mFAAmF;QACnF,yDAAyD;QACzD,MAAM,SAAS,GAAG,QAAQ,KAAK,CAAC,CAAC;QAEjC,8EAA8E;QAC9E,kBAAkB;QAElB,6EAA6E;QAC7E,+EAA+E;QAC/E,2BAA2B;QAE3B,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE;YACxB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3E,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC1B;aAAM;YACH,mBAAW,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAEhD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACrG,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAChD;IACL,CAAC;IAED,0BAA0B;IAE1B,YAAY,CAAC,KAAa,EAAE,YAAoB,EAAE,aAAqB;QACnE,8EAA8E;QAC9E,6EAA6E;QAC7E,aAAa;QACb,EAAE;QACF,4EAA4E;QAC5E,wBAAwB;QACxB,EAAE;QACF,6FAA6F;QAC7F,2EAA2E;QAC3E,EAAE;QACF,gFAAgF;QAEhF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC;SAC/B;IACL,CAAC;CAGJ;AAjHD,kCAiHC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { IVectorConsumer } from \"@tiny-calc/nano\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { ensureRange } from \"./range\";\n\n/**\n * Used by PermutationVector to cache position -> handle lookups.\n *\n * Perf: Possibly, this should eventually be inlined into PermutationVector itself, but\n *       so far there's no measurable perf penalty for being a separate object (node 12 x64)\n */\nexport class HandleCache implements IVectorConsumer<Handle> {\n    private handles: Handle[] = [];\n    private start = 0;\n\n    constructor(public readonly vector: PermutationVector) { }\n\n    /**\n     * Returns the index of the given position in the 'handles' array as a Uint32.\n     * (If the position is not in the array, returns an integer greater than 'handles.length').\n     */\n    private getIndex(position: number) {\n        return (position - this.start) >>> 0;\n    }\n\n    /**\n     * Returns the handle currently assigned to the given 'position' (if any).  Check\n     * the result with 'isValidHandle(..)' to see if a handle has been allocated for\n     * the given position.\n     *\n     * Throws a 'RangeError' if the provided 'position' is out-of-bounds wrt. the\n     * PermutationVector's length.\n     */\n    public getHandle(position: number) {\n        const index = this.getIndex(position);\n\n        // Perf: To encourage inlining, handling of the 'cacheMiss(..)' case has been extracted\n        //       to a separate method.\n\n        // Perf: A cache hit implies that 'position' was in bounds.  Therefore, we can defer\n        //       checking that 'position' is in bounds until 'cacheMiss(..)'.  This yields an\n        //       ~40% speedup when the position is in the cache (node v12 x64).\n\n        return index < this.handles.length\n            ? this.handles[index]\n            : this.cacheMiss(position);\n    }\n\n    /** Update the cache when a handle has been allocated for a given position. */\n    public addHandle(position: number, handle: Handle) {\n        assert(isHandleValid(handle), 0x017 /* \"Trying to add invalid handle!\" */);\n\n        const index = this.getIndex(position);\n        if (index < this.handles.length) {\n            assert(!isHandleValid(this.handles[index]),\n                0x018 /* \"Trying to insert handle into position with already valid handle!\" */);\n            this.handles[index] = handle;\n        }\n    }\n\n    /** Used by 'CacheMiss()' to retrieve handles for a range of positions. */\n    private getHandles(start: number, end: number) {\n        // TODO: This can be accelerated substantially using 'walkSegments()'.  The only catch\n        //       is that\n\n        const handles: Handle[] = [];\n        const { vector } = this;\n\n        for (let pos = start; pos < end; pos++) {\n            const { segment, offset } = vector.getContainingSegment(pos);\n            const asPerm = segment as PermutationSegment;\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            handles.push(asPerm.start + offset!);\n        }\n\n        return handles;\n    }\n\n    private cacheMiss(position: number) {\n        // Coercing 'position' to an Uint32 allows us to handle a negative 'position' value\n        // with the same logic that handles 'position' >= length.\n        const _position = position >>> 0;\n\n        // TODO: To bound memory usage, there should be a limit on the maximum size of\n        //       handle[].\n\n        // TODO: To reduce MergeTree lookups, this code should opportunistically grow\n        //       the cache to the next MergeTree segment boundary (within the limits of\n        //       the handle cache).\n\n        if (_position < this.start) {\n            this.handles = this.getHandles(_position, this.start).concat(this.handles);\n            this.start = _position;\n            return this.handles[0];\n        } else {\n            ensureRange(_position, this.vector.getLength());\n\n            this.handles = this.handles.concat(this.getHandles(this.start + this.handles.length, _position + 1));\n            return this.handles[this.handles.length - 1];\n        }\n    }\n\n    // #region IVectorConsumer\n\n    itemsChanged(start: number, removedCount: number, insertedCount: number): void {\n        // If positions were inserted/removed, our current policy is to trim the array\n        // at the beginning of the invalidate range and lazily repopulate the handles\n        // on demand.\n        //\n        // Some alternatives to consider that preserve the previously cached handles\n        // that are still valid:\n        //\n        //      * Eagerly populate the 'handles[]' with the newly insert values (currently guaranteed\n        //        to be Handle.unallocated, so we don't even need to look them up.)\n        //\n        //      * Use a sentinel value or other mechanism to allow \"holes\" in the cache.\n\n        const index = this.getIndex(start);\n        if (index < this.handles.length) {\n            this.handles.length = index;\n        }\n    }\n\n    // #endregion IVectorConsumer\n}\n"]}

package/dist/matrix.d.ts

@@ -89,7 +89,6 @@ export declare class SharedMatrix<T = any> extends SharedObject implements IMatr
      */
     protected loadCore(storage: IChannelStorageService): Promise<void>;
     protected processCore(rawMessage: ISequencedDocumentMessage, local: boolean, localOpMetadata: unknown): void;
-    protected registerCore(): void;
     private readonly onRowDelta;
     private readonly onColDelta;
     private readonly onRowHandlesRecycled;

package/dist/matrix.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,sCAAsC,CAAC;AACjF,OAAO,EACH,sBAAsB,EACtB,sBAAsB,EACtB,YAAY,EACZ,kBAAkB,EACrB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACH,gBAAgB,EAGhB,YAAY,EACZ,iBAAiB,EACpB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAE5E,OAAO,EACH,eAAe,EACf,eAAe,EACf,aAAa,EACb,aAAa,EAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAkD,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAItG,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAIhD,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAsBxC;;;GAGG;AACH,oBAAY,UAAU,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;AAEvE;;;;;;;;;;;GAWG;AACH,qBAAa,YAAY,CAAC,CAAC,GAAG,GAAG,CAC7B,SAAQ,YACR,YAAW,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC5B,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAYwB,EAAE,EAAE,MAAM;IAV9D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6C;WAEzD,UAAU;IAExB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IACzC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IAEzC,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,OAAO,CAA+B;gBAElC,OAAO,EAAE,sBAAsB,EAAS,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB;IAkB9F,OAAO,CAAC,IAAI,CAAC,CAAwB;IAErC;;OAEG;IACI,QAAQ,CAAC,QAAQ,EAAE,aAAa;IASvC,OAAO,KAAK,UAAU,GAAoC;IAC1D,OAAO,KAAK,UAAU,GAAoC;IAE1D;;OAEG;WACW,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,EAAE,EAAE,CAAC,EAAE,MAAM;IAMpE,UAAU,CACN,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAK/B,WAAW,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IAQ3D,IAAW,QAAQ,WAAoC;IACvD,IAAW,QAAQ,WAAoC;IAEhD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IAqBvD,IAAW,cAAc,IAAI,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAiB;IAIrE,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IAatD,QAAQ,CACX,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;IA6BtC,OAAO,CAAC,WAAW;IA4BnB,OAAO,CAAC,aAAa;IA2BrB,OAAO,CAAC,mBAAmB;IAkC3B,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA4CzD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA4CzD,SAAS,CAAC,aAAa,CAAC,UAAU,EAAE,gBAAgB,GAAG,qBAAqB;IAY5E;;;OAGG;IACH,SAAS,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB;IAQzD;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IAUpB,SAAS,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,EAAE,GAAG;IAchE,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,EAAE,OAAO;IAyC7D,SAAS,CAAC,YAAY;IAEtB;;OAEG;cACa,QAAQ,CAAC,OAAO,EAAE,sBAAsB;IAmBxD,SAAS,CAAC,WAAW,CAAC,UAAU,EAAE,yBAAyB,EAAE,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO;IA4DrG,SAAS,CAAC,YAAY;IAMtB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAGF,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF;;;;;;;OAOG;IACH,OAAO,CAAC,oBAAoB;IAgBrB,QAAQ;IAkBf,SAAS,CAAC,cAAc;CAG3B"}
+{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,sCAAsC,CAAC;AACjF,OAAO,EACH,sBAAsB,EACtB,sBAAsB,EACtB,YAAY,EACZ,kBAAkB,EACrB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACH,gBAAgB,EAGhB,YAAY,EACZ,iBAAiB,EACpB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAE5E,OAAO,EACH,eAAe,EACf,eAAe,EACf,aAAa,EACb,aAAa,EAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAkD,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAItG,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAIhD,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAsBxC;;;GAGG;AACH,oBAAY,UAAU,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;AAEvE;;;;;;;;;;;GAWG;AACH,qBAAa,YAAY,CAAC,CAAC,GAAG,GAAG,CAC7B,SAAQ,YACR,YAAW,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC5B,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAYwB,EAAE,EAAE,MAAM;IAV9D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6C;WAEzD,UAAU;IAExB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IACzC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IAEzC,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,OAAO,CAA+B;gBAElC,OAAO,EAAE,sBAAsB,EAAS,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB;IAkB9F,OAAO,CAAC,IAAI,CAAC,CAAwB;IAErC;;OAEG;IACI,QAAQ,CAAC,QAAQ,EAAE,aAAa;IASvC,OAAO,KAAK,UAAU,GAAoC;IAC1D,OAAO,KAAK,UAAU,GAAoC;IAE1D;;OAEG;WACW,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,EAAE,EAAE,CAAC,EAAE,MAAM;IAMpE,UAAU,CACN,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAK/B,WAAW,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IAQ3D,IAAW,QAAQ,WAAoC;IACvD,IAAW,QAAQ,WAAoC;IAEhD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IAqBvD,IAAW,cAAc,IAAI,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAiB;IAIrE,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IAatD,QAAQ,CACX,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;IA6BtC,OAAO,CAAC,WAAW;IA0BnB,OAAO,CAAC,aAAa;IA2BrB,OAAO,CAAC,mBAAmB;IAkC3B,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA2CzD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA2CzD,SAAS,CAAC,aAAa,CAAC,UAAU,EAAE,gBAAgB,GAAG,qBAAqB;IAY5E;;;OAGG;IACH,SAAS,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB;IAQzD;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IAUpB,SAAS,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,EAAE,GAAG;IAchE,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,EAAE,OAAO;IAyC7D,SAAS,CAAC,YAAY;IAEtB;;OAEG;cACa,QAAQ,CAAC,OAAO,EAAE,sBAAsB;IAmBxD,SAAS,CAAC,WAAW,CAAC,UAAU,EAAE,yBAAyB,EAAE,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO;IA6DrG,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAGF,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF;;;;;;;OAOG;IACH,OAAO,CAAC,oBAAoB;IAgBrB,QAAQ;IAkBf,SAAS,CAAC,cAAc;CAG3B"}

package/dist/matrix.js

@@ -145,7 +145,6 @@ class SharedMatrix extends shared_object_base_1.SharedObject {
     setCellCore(row, col, value, rowHandle = this.rows.getAllocatedHandle(row), colHandle = this.cols.getAllocatedHandle(col)) {
         if (this.undo !== undefined) {
             let oldValue = this.cells.getCell(rowHandle, colHandle);
-            // eslint-disable-next-line no-null/no-null
             if (oldValue === null) {
                 oldValue = undefined;
             }
@@ -231,7 +230,6 @@ class SharedMatrix extends shared_object_base_1.SharedObject {
             for (let col = 0; col < this.colCount; col++) {
                 const colHandle = this.colHandles.getHandle(col);
                 const value = this.cells.getCell(rowHandle, colHandle);
-                // eslint-disable-next-line no-null/no-null
                 if (this.isAttached() && value !== undefined && value !== null) {
                     this.sendSetCellOp(row, col, value, rowHandle, colHandle);
                 }
@@ -263,7 +261,6 @@ class SharedMatrix extends shared_object_base_1.SharedObject {
             for (let row = 0; row < this.rowCount; row++) {
                 const rowHandle = this.rowHandles.getHandle(row);
                 const value = this.cells.getCell(rowHandle, colHandle);
-                // eslint-disable-next-line no-null/no-null
                 if (this.isAttached() && value !== undefined && value !== null) {
                     this.sendSetCellOp(row, col, value, rowHandle, colHandle);
                 }
@@ -422,10 +419,6 @@ class SharedMatrix extends shared_object_base_1.SharedObject {
             }
         }
     }
-    registerCore() {
-        this.rows.startOrUpdateCollaboration(this.runtime.clientId, 0);
-        this.cols.startOrUpdateCollaboration(this.runtime.clientId, 0);
-    }
     /**
      * Returns true if the latest pending write to the cell indicated by the given row/col handles
      * matches the given 'localSeq'.

package/dist/matrix.js.map

@@ -1 +1 @@
-{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAQtD,2EAM4C;AAE5C,iEAA2F;AAQ3F,+BAAiC;AACjC,2DAA4E;AAC5E,mDAAgD;AAChD,uCAAgD;AAChD,+CAAsD;AACtD,mDAAkD;AAClD,mCAAsC;AAEtC,iDAAoD;AA2BpD;;;;;;;;;;;GAWG;AACH,MAAa,YACT,SAAQ,iCAAY;IAepB,YAAY,OAA+B,EAAS,EAAU,EAAE,UAA8B;QAC1F,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QADiB,OAAE,GAAF,EAAE,CAAQ;QAV7C,cAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;QAO/D,UAAK,GAAG,IAAI,6BAAa,EAAiB,CAAC,CAAK,sBAAsB;QACtE,YAAO,GAAG,IAAI,6BAAa,EAAU,CAAC,CAAU,yBAAyB;QA0hBjF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QA/iBE,IAAI,CAAC,IAAI,GAAG,IAAI,qCAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,GAAG,IAAI,qCAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACnC,CAAC;IAxBM,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,6BAAmB,EAAE,CAAC,CAAC,CAAC;IA4BhE;;OAEG;IACI,QAAQ,CAAC,QAAuB;QACnC,qBAAM,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAC1B,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,IAAI,CAAC,IAAI,GAAG,IAAI,iCAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,qBAAqB;IAErB,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,MAAM,CAAI,OAA+B,EAAE,EAAW;QAChE,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,6BAAmB,CAAC,IAAI,CAAoB,CAAC;IAClF,CAAC;IAED,0BAA0B;IAE1B,UAAU,CACN,QAAwC;QAExC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,WAAW,CAAC,QAAwC;QAChD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED,6BAA6B;IAE7B,wBAAwB;IAExB,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACvD,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAEhD,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,kFAAkF;QAClF,iFAAiF;QACjF,6EAA6E;QAE7E,4DAA4D;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,2BAAa,CAAC,SAAS,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,2BAAa,CAAC,SAAS,CAAC,EAAE;gBAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;aACnD;SACJ;aAAM;YACH,gFAAgF;YAChF,oCAAoC;YACpC,mBAAW,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;SAC3C;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAW,cAAc,KAAqC,OAAO,IAAI,CAAC,CAAC,CAAC;IAE5E,2BAA2B;IAEpB,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,qBAAM,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ;eAC/B,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,EAClC,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAErD,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAElC,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;SAC/C;IACL,CAAC;IAEM,QAAQ,CACX,QAAgB,EAChB,QAAgB,EAChB,QAAgB,EAChB,MAAkC;QAElC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QAErD,qBAAM,CAAC,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;eACzD,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAC3C,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAE/D,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,IAAI,CAAC,GAAG,QAAQ,CAAC;QACjB,IAAI,CAAC,GAAG,QAAQ,CAAC;QAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAE9B,IAAI,EAAE,CAAC,KAAK,MAAM,EAAE;gBAChB,CAAC,GAAG,QAAQ,CAAC;gBACb,CAAC,EAAE,CAAC;aACP;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACvE;IACL,CAAC;IAEO,WAAW,CACf,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAC7C,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC;QAE7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAExD,2CAA2C;YAC3C,IAAI,QAAQ,KAAK,IAAI,EAAE;gBACnB,QAAQ,GAAG,SAAS,CAAC;aACxB;YAED,IAAI,CAAC,IAAI,CAAC,OAAO,CACb,SAAS,EACT,SAAS,EACT,QAAQ,CAAC,CAAC;SACjB;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAEhD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;SAC7D;IACL,CAAC;IAEO,aAAa,CACjB,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAiB,EACjB,SAAiB,EACjB,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE;QAE9B,qBAAM,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,KAAK,CAAC,yEAAyE,CAAC,CAAC;QAE3G,MAAM,EAAE,GAAc;YAClB,IAAI,EAAE,cAAQ,CAAC,GAAG;YAClB,GAAG;YACH,GAAG;YACH,KAAK;SACR,CAAC;QAEF,MAAM,QAAQ,GAAmB;YAC7B,SAAS;YACT,SAAS;YACT,QAAQ;SACX,CAAC;QAEF,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IAEO,mBAAmB,CACvB,aAAgC,EAChC,cAAiC,EACjC,SAAgD,EAChD,OAAY;QAEZ,oGAAoG;QACpG,wGAAwG;QACxG,mEAAmE;QACnE,MAAM,QAAQ,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;QAC1D,MAAM,cAAc,GAAG,cAAc,CAAC,eAAe,EAAE,CAAC;QAExD,4GAA4G;QAC5G,6DAA6D;QAC7D,qBAAM,CAAC,QAAQ,IAAI,cAAc,CAAC,QAAQ,EACtC,KAAK,CAAC,iGAAiG,CAAC,CAAC;QAE7G,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEnC,sGAAsG;QACtG,sFAAsF;QACtF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,oFAAoF;YACpF,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;YAE3B,IAAI,CAAC,kBAAkB,CACnB,OAAO,EACP,aAAa,CAAC,wBAAwB,CAClC,OAAO,CAAC,IAAI,kBAA6B;gBACrC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM;gBACpB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACrB;IACL,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,kEAAkE;QAClE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,2CAA2C;gBAC3C,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,qEAAqE;QACrE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,2CAA2C;gBAC3C,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAES,aAAa,CAAC,UAA4B;QAChD,MAAM,OAAO,GAAG,IAAI,kCAAkB,EAAE,CAAC;QACzC,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,OAAO,sBACX,UAAU,CAAC,SAAS,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACrB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;SAC1B,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACrB,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACO,iBAAiB,CAAC,UAA6B;QACrD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;YAC1C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;aAC7D;SACJ;IACL,CAAC;IAED;;;;;OAKG;IACK,YAAY;QAChB,oGAAoG;QACpG,qGAAqG;QACrG,mGAAmG;QACnG,+BAA+B;QAE/B,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAAE,CAAC;QACvC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;IAClD,CAAC;IAES,kBAAkB,CAAC,OAAY,EAAE,eAAqB;QAC5D,0DAA0D;QAC1D,sEAAsE;QACtE,qBAAM,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAEtG,KAAK,CAAC,kBAAkB,CAAC,4CAAuB,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC;QAE1G,0EAA0E;QAC1E,qBAAM,CACF,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAC7E,KAAK,CAAC,4DAA4D,CACrE,CAAC;IACN,CAAC;IAES,SAAS;;QACf,8DAA8D;QAC9D,qFAAqF;QACrF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;YAC1E,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;SAC7E;IACL,CAAC;IAES,SAAS;QACf,qBAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,EAC1F,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,6FAA6F;QAC7F,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;IAC1E,CAAC;IAES,YAAY,CAAC,OAAY,EAAE,eAAwB;QACzD,QAAQ,OAAO,CAAC,MAAM,EAAE;YACpB;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,qBAAM,CAAC,OAAO,CAAC,IAAI,KAAK,cAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAErF,MAAM,KAAK,GAAG,OAAkC,CAAC;gBACjD,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;gBAE7E,qFAAqF;gBACrF,yFAAyF;gBACzF,qFAAqF;gBACrF,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;oBAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAE5D,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;wBACtB,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,CAAC,KAAK,EACX,SAAS,EACT,SAAS,EACT,QAAQ,CACX,CAAC;qBACL;iBACJ;gBACD,MAAM;aACT;SACJ;IACL,CAAC;IAES,YAAY,KAAI,CAAC;IAE3B;;OAEG;IACO,KAAK,CAAC,QAAQ,CAAC,OAA+B;QACpD,IAAI;YACA,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sCAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sCAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,CAAC,QAAQ,EAAE,iBAAiB,CAAC,GAAG,MAAM,+BAAe,CAAC,OAAO,uBAAsB,IAAI,CAAC,UAAU,CAAC,CAAC;YAE1G,IAAI,CAAC,KAAK,GAAG,6BAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,OAAO,GAAG,6BAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;SACxD;QAAC,OAAO,KAAK,EAAE;YACZ,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;SACxE;IACL,CAAC;IAES,WAAW,CAAC,UAAqC,EAAE,KAAc,EAAE,eAAwB;QACjG,MAAM,GAAG,GAAG,iCAAY,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;QAE9B,QAAQ,QAAQ,CAAC,MAAM,EAAE;YACrB;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,qBAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,cAAQ,CAAC,GAAG,EACjC,KAAK,CAAC,2DAA2D,CAAC,CAAC;gBAEvE,MAAM,EAAE,uBAAuB,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC;gBACjE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC;gBAE9B,IAAI,KAAK,EAAE;oBACP,8DAA8D;oBAC9D,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;oBAE7E,+EAA+E;oBAC/E,gEAAgE;oBAChE,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;wBAC3D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;qBACzD;iBACJ;qBAAM;oBACH,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;oBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;wBAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;wBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;wBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;4BAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAE5D,qBAAM,CAAC,2BAAa,CAAC,SAAS,CAAC,IAAI,2BAAa,CAAC,SAAS,CAAC,EACvD,KAAK,CAAC,wDAAwD,CAAC,CAAC;4BAEpE,oFAAoF;4BACpF,gDAAgD;4BAChD,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,SAAS,EAAE;gCAC1D,MAAM,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC;gCAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gCAEhD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;oCAC5C,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;iCAC/D;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ;IACL,CAAC;IAES,YAAY;QAClB,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IA8BD;;;;;;;OAOG;IACK,oBAAoB,CAAC,SAAiB,EAAE,SAAiB,EAAE,QAAgB;QAC/E,oEAAoE;QACpE,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAE,CAAC;QAEpE,yFAAyF;QACzF,+FAA+F;QAC/F,kCAAkC;QAClC,qBAAM,CAAC,CAAC,CAAC,eAAe,GAAG,QAAQ,CAAC;QAChC,mCAAmC;QACnC,KAAK,CAAC,uGAAuG,CAAC,CAAC;QAEnH,wFAAwF;QACxF,mDAAmD;QACnD,OAAO,eAAe,KAAK,QAAQ,CAAC;IACxC,CAAC;IAEM,QAAQ;QACX,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,OAAO,CAAC,QAAQ,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC;QAE5G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;YACpC,CAAC,IAAI,KAAK,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,CAAC,GAAG,CAAC,EAAE;oBACP,CAAC,IAAI,IAAI,CAAC;iBACb;gBAED,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;aACxE;YACD,CAAC,IAAI,KAAK,CAAC;SACd;QAED,OAAO,GAAG,CAAC,IAAI,CAAC;IACpB,CAAC;IAES,cAAc;QACpB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACvC,CAAC;CACJ;AAjnBD,oCAinBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport {\n    IFluidDataStoreRuntime,\n    IChannelStorageService,\n    Serializable,\n    IChannelAttributes,\n} from \"@fluidframework/datastore-definitions\";\nimport {\n    IFluidSerializer,\n    makeHandlesSerializable,\n    parseHandles,\n    SharedObject,\n    SummarySerializer,\n} from \"@fluidframework/shared-object-base\";\nimport { ISummaryTreeWithStats } from \"@fluidframework/runtime-definitions\";\nimport { ObjectStoragePartition, SummaryTreeBuilder } from \"@fluidframework/runtime-utils\";\nimport {\n    IMatrixProducer,\n    IMatrixConsumer,\n    IMatrixReader,\n    IMatrixWriter,\n} from \"@tiny-calc/nano\";\nimport { MergeTreeDeltaType, IMergeTreeOp, SegmentGroup, ISegment } from \"@fluidframework/merge-tree\";\nimport { MatrixOp } from \"./ops\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { SparseArray2D } from \"./sparsearray2d\";\nimport { SharedMatrixFactory } from \"./runtime\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { deserializeBlob } from \"./serialization\";\nimport { ensureRange } from \"./range\";\nimport { IUndoConsumer } from \"./types\";\nimport { MatrixUndoProvider } from \"./undoprovider\";\n\nconst enum SnapshotPath {\n    rows = \"rows\",\n    cols = \"cols\",\n    cells = \"cells\",\n}\n\ninterface ISetOp<T> {\n    type: MatrixOp.set,\n    row: number,\n    col: number,\n    value: MatrixItem<T>,\n}\n\ninterface ISetOpMetadata {\n    rowHandle: Handle,\n    colHandle: Handle,\n    localSeq: number,\n}\n\n/**\n * A matrix cell value may be undefined (indicating an empty cell) or any serializable type,\n * excluding null.  (However, nulls may be embedded inside objects and arrays.)\n */\nexport type MatrixItem<T> = Serializable<Exclude<T, null>> | undefined;\n\n/**\n * A SharedMatrix holds a rectangular 2D array of values.  Supported operations\n * include setting values and inserting/removing rows and columns.\n *\n * Matrix values may be any Fluid serializable type, which is the set of JSON\n * serializable types extended to include IFluidHandles.\n *\n * Fluid's SharedMatrix implementation works equally well for dense and sparse\n * matrix data and physically stores data in Z-order to leverage CPU caches and\n * prefetching when reading in either row or column major order.  (See README.md\n * for more details.)\n */\nexport class SharedMatrix<T = any>\n    extends SharedObject\n    implements IMatrixProducer<MatrixItem<T>>,\n    IMatrixReader<MatrixItem<T>>,\n    IMatrixWriter<MatrixItem<T>>\n{\n    private readonly consumers = new Set<IMatrixConsumer<MatrixItem<T>>>();\n\n    public static getFactory() { return new SharedMatrixFactory(); }\n\n    private readonly rows: PermutationVector;   // Map logical row to storage handle (if any)\n    private readonly cols: PermutationVector;   // Map logical col to storage handle (if any)\n\n    private cells = new SparseArray2D<MatrixItem<T>>();     // Stores cell values.\n    private pending = new SparseArray2D<number>();          // Tracks pending writes.\n\n    constructor(runtime: IFluidDataStoreRuntime, public id: string, attributes: IChannelAttributes) {\n        super(id, runtime, attributes);\n\n        this.rows = new PermutationVector(\n            SnapshotPath.rows,\n            this.logger,\n            runtime,\n            this.onRowDelta,\n            this.onRowHandlesRecycled);\n\n        this.cols = new PermutationVector(\n            SnapshotPath.cols,\n            this.logger,\n            runtime,\n            this.onColDelta,\n            this.onColHandlesRecycled);\n    }\n\n    private undo?: MatrixUndoProvider<T>;\n\n    /**\n     * Subscribes the given IUndoConsumer to the matrix.\n     */\n    public openUndo(consumer: IUndoConsumer) {\n        assert(this.undo === undefined,\n            0x019 /* \"SharedMatrix.openUndo() supports at most a single IUndoConsumer.\" */);\n\n        this.undo = new MatrixUndoProvider(consumer, this, this.rows, this.cols);\n    }\n\n    // TODO: closeUndo()?\n\n    private get rowHandles() { return this.rows.handleCache; }\n    private get colHandles() { return this.cols.handleCache; }\n\n    /**\n     * {@inheritDoc @fluidframework/datastore-definitions#IChannelFactory.create}\n     */\n    public static create<T>(runtime: IFluidDataStoreRuntime, id?: string) {\n        return runtime.createChannel(id, SharedMatrixFactory.Type) as SharedMatrix<T>;\n    }\n\n    // #region IMatrixProducer\n\n    openMatrix(\n        consumer: IMatrixConsumer<MatrixItem<T>>,\n    ): IMatrixReader<MatrixItem<T>> {\n        this.consumers.add(consumer);\n        return this;\n    }\n\n    closeMatrix(consumer: IMatrixConsumer<MatrixItem<T>>): void {\n        this.consumers.delete(consumer);\n    }\n\n    // #endregion IMatrixProducer\n\n    // #region IMatrixReader\n\n    public get rowCount() { return this.rows.getLength(); }\n    public get colCount() { return this.cols.getLength(); }\n\n    public getCell(row: number, col: number): MatrixItem<T> {\n        // Perf: When possible, bounds checking is performed inside the implementation for\n        //       'getHandle()' so that it can be elided in the case of a cache hit.  This\n        //       yields an ~40% improvement in the case of a cache hit (node v12 x64)\n\n        // Map the logical (row, col) to associated storage handles.\n        const rowHandle = this.rowHandles.getHandle(row);\n        if (isHandleValid(rowHandle)) {\n            const colHandle = this.colHandles.getHandle(col);\n            if (isHandleValid(colHandle)) {\n                return this.cells.getCell(rowHandle, colHandle);\n            }\n        } else {\n            // If we early exit because the given rowHandle is unallocated, we still need to\n            // bounds-check the 'col' parameter.\n            ensureRange(col, this.cols.getLength());\n        }\n\n        return undefined;\n    }\n\n    public get matrixProducer(): IMatrixProducer<MatrixItem<T>> { return this; }\n\n    // #endregion IMatrixReader\n\n    public setCell(row: number, col: number, value: MatrixItem<T>) {\n        assert(0 <= row && row < this.rowCount\n            && 0 <= col && col < this.colCount,\n            0x01a /* \"Trying to set out-of-bounds cell!\" */);\n\n        this.setCellCore(row, col, value);\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(row, col, 1, 1, this);\n        }\n    }\n\n    public setCells(\n        rowStart: number,\n        colStart: number,\n        colCount: number,\n        values: readonly (MatrixItem<T>)[],\n    ) {\n        const rowCount = Math.ceil(values.length / colCount);\n\n        assert((0 <= rowStart && rowStart < this.rowCount)\n            && (0 <= colStart && colStart < this.colCount)\n            && (1 <= colCount && colCount <= (this.colCount - colStart))\n            && (rowCount <= (this.rowCount - rowStart)),\n            0x01b /* \"Trying to set multiple out-of-bounds cells!\" */);\n\n        const endCol = colStart + colCount;\n        let r = rowStart;\n        let c = colStart;\n\n        for (const value of values) {\n            this.setCellCore(r, c, value);\n\n            if (++c === endCol) {\n                c = colStart;\n                r++;\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, colStart, rowCount, colCount, this);\n        }\n    }\n\n    private setCellCore(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle = this.rows.getAllocatedHandle(row),\n        colHandle = this.cols.getAllocatedHandle(col),\n    ) {\n        if (this.undo !== undefined) {\n            let oldValue = this.cells.getCell(rowHandle, colHandle);\n\n            // eslint-disable-next-line no-null/no-null\n            if (oldValue === null) {\n                oldValue = undefined;\n            }\n\n            this.undo.cellSet(\n                rowHandle,\n                colHandle,\n                oldValue);\n        }\n\n        this.cells.setCell(rowHandle, colHandle, value);\n\n        if (this.isAttached()) {\n            this.sendSetCellOp(row, col, value, rowHandle, colHandle);\n        }\n    }\n\n    private sendSetCellOp(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle: Handle,\n        colHandle: Handle,\n        localSeq = this.nextLocalSeq(),\n    ) {\n        assert(this.isAttached(), 0x1e2 /* \"Caller must ensure 'isAttached()' before calling 'sendSetCellOp'.\" */);\n\n        const op: ISetOp<T> = {\n            type: MatrixOp.set,\n            row,\n            col,\n            value,\n        };\n\n        const metadata: ISetOpMetadata = {\n            rowHandle,\n            colHandle,\n            localSeq,\n        };\n\n        this.submitLocalMessage(op, metadata);\n        this.pending.setCell(rowHandle, colHandle, localSeq);\n    }\n\n    private submitVectorMessage(\n        currentVector: PermutationVector,\n        oppositeVector: PermutationVector,\n        dimension: SnapshotPath.rows | SnapshotPath.cols,\n        message: any,\n    ) {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally advance each MergeTree's 'localSeq' counter\n        // for each submitted op it not aware of to keep them synchronized.\n        const localSeq = currentVector.getCollabWindow().localSeq;\n        const oppositeWindow = oppositeVector.getCollabWindow();\n\n        // Note that the comparison is '>=' because, in the case the MergeTree is regenerating ops for reconnection,\n        // the MergeTree submits the op with the original 'localSeq'.\n        assert(localSeq >= oppositeWindow.localSeq,\n            0x01c /* \"The 'localSeq' of the vector submitting an op must >= the 'localSeq' of the other vector.\" */);\n\n        oppositeWindow.localSeq = localSeq;\n\n        // If the SharedMatrix is local, it's state will be submitted via a Snapshot when initially connected.\n        // Do not queue a message or track the pending op, as there will never be an ACK, etc.\n        if (this.isAttached()) {\n            // Record whether this `op` targets rows or cols.  (See dispatch in `processCore()`)\n            message.target = dimension;\n\n            this.submitLocalMessage(\n                message,\n                currentVector.peekPendingSegmentGroups(\n                    message.type === MergeTreeDeltaType.GROUP\n                        ? message.ops.length\n                        : 1));\n        }\n    }\n\n    private submitColMessage(message: any) {\n        this.submitVectorMessage(this.cols, this.rows, SnapshotPath.cols, message);\n    }\n\n    public insertCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.insert(colStart, count));\n    }\n\n    public removeCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.remove(colStart, count));\n    }\n\n    private submitRowMessage(message: any) {\n        this.submitVectorMessage(this.rows, this.cols, SnapshotPath.rows, message);\n    }\n\n    public insertRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.insert(rowStart, count));\n    }\n\n    public removeRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.remove(rowStart, count));\n    }\n\n    /** @internal */ public _undoRemoveRows(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of rows at the original position.\n        const { op, inserted } = this.rows.insertRelative(original, original.cachedLength);\n        this.submitRowMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'rowsChanged'\n        // callback, which occurs before the handle span is populated.\n        const rowStart = this.rows.getPosition(inserted);\n        this.rows.handleCache.itemsChanged(\n            rowStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted rows.\n        let rowHandle = inserted.start;\n        const rowCount = inserted.cachedLength;\n        for (let row = rowStart; row < rowStart + rowCount; row++, rowHandle++) {\n            for (let col = 0; col < this.colCount; col++) {\n                const colHandle = this.colHandles.getHandle(col);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                // eslint-disable-next-line no-null/no-null\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, /* colStart: */ 0, rowCount, this.colCount, this);\n        }\n    }\n\n    /** @internal */ public _undoRemoveCols(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of columns at the original position.\n        const { op, inserted } = this.cols.insertRelative(original, original.cachedLength);\n        this.submitColMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'colsChanged'\n        // callback, which occurs before the handle span is populated.\n        const colStart = this.cols.getPosition(inserted);\n        this.cols.handleCache.itemsChanged(\n            colStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted cols.\n        let colHandle = inserted.start;\n        const colCount = inserted.cachedLength;\n        for (let col = colStart; col < colStart + colCount; col++, colHandle++) {\n            for (let row = 0; row < this.rowCount; row++) {\n                const rowHandle = this.rowHandles.getHandle(row);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                // eslint-disable-next-line no-null/no-null\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(/* rowStart: */ 0, colStart, this.rowCount, colCount, this);\n        }\n    }\n\n    protected summarizeCore(serializer: IFluidSerializer): ISummaryTreeWithStats {\n        const builder = new SummaryTreeBuilder();\n        builder.addWithStats(SnapshotPath.rows, this.rows.summarize(this.runtime, this.handle, serializer));\n        builder.addWithStats(SnapshotPath.cols, this.cols.summarize(this.runtime, this.handle, serializer));\n        builder.addBlob(SnapshotPath.cells,\n            serializer.stringify([\n                this.cells.snapshot(),\n                this.pending.snapshot(),\n            ], this.handle));\n        return builder.getSummaryTree();\n    }\n\n    /**\n     * Runs serializer on the GC data for this SharedMatrix.\n     * All the IFluidHandle's stored in the cells represent routes to other objects.\n     */\n    protected processGCDataCore(serializer: SummarySerializer) {\n        for (let row = 0; row < this.rowCount; row++) {\n            for (let col = 0; col < this.colCount; col++) {\n                serializer.stringify(this.getCell(row, col), this.handle);\n            }\n        }\n    }\n\n    /**\n     * Advances the 'localSeq' counter for the cell data operation currently being queued.\n     *\n     * Do not use with 'submitColMessage()/submitRowMessage()' as these helpers + the MergeTree will\n     * automatically advance 'localSeq'.\n     */\n    private nextLocalSeq() {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally bump each MergeTree's 'localSeq' counter\n        // for SharedMatrix ops it's not aware of to keep them synchronized.  (For cell data operations, we\n        // need to bump both counters.)\n\n        this.cols.getCollabWindow().localSeq++;\n        return ++this.rows.getCollabWindow().localSeq;\n    }\n\n    protected submitLocalMessage(message: any, localOpMetadata?: any) {\n        // TODO: Recommend moving this assertion into SharedObject\n        //       (See https://github.com/microsoft/FluidFramework/issues/2559)\n        assert(this.isAttached() === true, 0x01d /* \"Trying to submit message to runtime while detached!\" */);\n\n        super.submitLocalMessage(makeHandlesSerializable(message, this.serializer, this.handle), localOpMetadata);\n\n        // Ensure that row/col 'localSeq' are synchronized (see 'nextLocalSeq()').\n        assert(\n            this.rows.getCollabWindow().localSeq === this.cols.getCollabWindow().localSeq,\n            0x01e /* \"Row and col collab window 'localSeq' desynchronized!\" */,\n        );\n    }\n\n    protected didAttach() {\n        // We've attached we need to start generating and sending ops.\n        // so start collaboration and provide a default client id incase we are not connected\n        if (this.isAttached()) {\n            this.rows.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n            this.cols.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n        }\n    }\n\n    protected onConnect() {\n        assert(this.rows.getCollabWindow().collaborating === this.cols.getCollabWindow().collaborating,\n            0x01f /* \"Row and col collab window 'collaborating' status desynchronized!\" */);\n\n        // Update merge tree collaboration information with new client ID and then resend pending ops\n        this.rows.startOrUpdateCollaboration(this.runtime.clientId as string);\n        this.cols.startOrUpdateCollaboration(this.runtime.clientId as string);\n    }\n\n    protected reSubmitCore(content: any, localOpMetadata: unknown) {\n        switch (content.target) {\n            case SnapshotPath.cols:\n                this.submitColMessage(this.cols.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            case SnapshotPath.rows:\n                this.submitRowMessage(this.rows.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            default: {\n                assert(content.type === MatrixOp.set, 0x020 /* \"Unknown SharedMatrix 'op' type.\" */);\n\n                const setOp = content as ISetOp<Serializable<T>>;\n                const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                // If there are more pending local writes to the same row/col handle, it is important\n                // to skip resubmitting this op since it is possible the row/col handle has been recycled\n                // and now refers to a different position than when this op was originally submitted.\n                if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                    const row = this.rows.handleToPosition(rowHandle, localSeq);\n                    const col = this.cols.handleToPosition(colHandle, localSeq);\n\n                    if (row >= 0 && col >= 0) {\n                        this.sendSetCellOp(\n                            row,\n                            col,\n                            setOp.value,\n                            rowHandle,\n                            colHandle,\n                            localSeq,\n                        );\n                    }\n                }\n                break;\n            }\n        }\n    }\n\n    protected onDisconnect() {}\n\n    /**\n     * {@inheritDoc @fluidframework/shared-object-base#SharedObject.loadCore}\n     */\n    protected async loadCore(storage: IChannelStorageService) {\n        try {\n            await this.rows.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.rows),\n                this.serializer);\n            await this.cols.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.cols),\n                this.serializer);\n            const [cellData, pendingCliSeqData] = await deserializeBlob(storage, SnapshotPath.cells, this.serializer);\n\n            this.cells = SparseArray2D.load(cellData);\n            this.pending = SparseArray2D.load(pendingCliSeqData);\n        } catch (error) {\n            this.logger.sendErrorEvent({ eventName: \"MatrixLoadFailed\" }, error);\n        }\n    }\n\n    protected processCore(rawMessage: ISequencedDocumentMessage, local: boolean, localOpMetadata: unknown) {\n        const msg = parseHandles(rawMessage, this.serializer);\n\n        const contents = msg.contents;\n\n        switch (contents.target) {\n            case SnapshotPath.cols:\n                this.cols.applyMsg(msg);\n                break;\n            case SnapshotPath.rows:\n                this.rows.applyMsg(msg);\n                break;\n            default: {\n                assert(contents.type === MatrixOp.set,\n                    0x021 /* \"SharedMatrix message contents have unexpected type!\" */);\n\n                const { referenceSequenceNumber: refSeq, clientId } = rawMessage;\n                const { row, col } = contents;\n\n                if (local) {\n                    // We are receiving the ACK for a local pending set operation.\n                    const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                    // If this is the most recent write to the cell by the local client, remove our\n                    // entry from 'pendingCliSeqs' to resume allowing remote writes.\n                    if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                        this.pending.setCell(rowHandle, colHandle, undefined);\n                    }\n                } else {\n                    const rowClientId = this.rows.getOrAddShortClientId(clientId);\n                    const adjustedRow = this.rows.adjustPosition(row, refSeq, rowClientId);\n\n                    if (adjustedRow !== undefined) {\n                        const colClientId = this.cols.getOrAddShortClientId(clientId);\n                        const adjustedCol = this.cols.adjustPosition(col, refSeq, colClientId);\n\n                        if (adjustedCol !== undefined) {\n                            const rowHandle = this.rows.getAllocatedHandle(adjustedRow);\n                            const colHandle = this.cols.getAllocatedHandle(adjustedCol);\n\n                            assert(isHandleValid(rowHandle) && isHandleValid(colHandle),\n                                0x022 /* \"SharedMatrix row and/or col handles are invalid!\" */);\n\n                            // If there is a pending (unACKed) local write to the same cell, skip the current op\n                            // since it \"happened before\" the pending write.\n                            if (this.pending.getCell(rowHandle, colHandle) === undefined) {\n                                const { value } = contents;\n                                this.cells.setCell(rowHandle, colHandle, value);\n\n                                for (const consumer of this.consumers.values()) {\n                                    consumer.cellsChanged(adjustedRow, adjustedCol, 1, 1, this);\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n\n    protected registerCore() {\n        this.rows.startOrUpdateCollaboration(this.runtime.clientId, 0);\n        this.cols.startOrUpdateCollaboration(this.runtime.clientId, 0);\n    }\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of row insertion/deletions.\n    private readonly onRowDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.rowsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of col insertion/deletions.\n    private readonly onColDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.colsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    private readonly onRowHandlesRecycled = (rowHandles: Handle[]) => {\n        for (const rowHandle of rowHandles) {\n            this.cells.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n            this.pending.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n        }\n    };\n\n    private readonly onColHandlesRecycled = (colHandles: Handle[]) => {\n        for (const colHandle of colHandles) {\n            this.cells.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n            this.pending.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n        }\n    };\n\n    /**\n     * Returns true if the latest pending write to the cell indicated by the given row/col handles\n     * matches the given 'localSeq'.\n     *\n     * A return value of `true` indicates that there are no later local operations queued that will\n     * clobber the write op at the given 'localSeq'.  This includes later ops that overwrite the cell\n     * with a different value as well as row/col removals that might recycled the given row/col handles.\n     */\n    private isLatestPendingWrite(rowHandle: Handle, colHandle: Handle, localSeq: number) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const pendingLocalSeq = this.pending.getCell(rowHandle, colHandle)!;\n\n        // Note while we're awaiting the ACK for a local set, it's possible for the row/col to be\n        // locally removed and the row/col handles recycled.  If this happens, the pendingLocalSeq will\n        // be 'undefined' or > 'localSeq'.\n        assert(!(pendingLocalSeq < localSeq),\n            // eslint-disable-next-line max-len\n            0x023 /* \"The 'localSeq' of pending write (if any) must be <= the localSeq of the currently processed op.\" */);\n\n        // If this is the most recent write to the cell by the local client, the stored localSeq\n        // will be an exact match for the given 'localSeq'.\n        return pendingLocalSeq === localSeq;\n    }\n\n    public toString() {\n        let s = `client:${this.runtime.clientId}\\nrows: ${this.rows.toString()}\\ncols: ${this.cols.toString()}\\n\\n`;\n\n        for (let r = 0; r < this.rowCount; r++) {\n            s += `  [`;\n            for (let c = 0; c < this.colCount; c++) {\n                if (c > 0) {\n                    s += \", \";\n                }\n\n                s += `${this.serializer.stringify(this.getCell(r, c), this.handle)}`;\n            }\n            s += \"]\\n\";\n        }\n\n        return `${s}\\n`;\n    }\n\n    protected applyStashedOp() {\n        throw new Error(\"not implemented\");\n    }\n}\n"]}
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAQtD,2EAM4C;AAE5C,iEAA2F;AAQ3F,+BAAiC;AACjC,2DAA4E;AAC5E,mDAAgD;AAChD,uCAAgD;AAChD,+CAAsD;AACtD,mDAAkD;AAClD,mCAAsC;AAEtC,iDAAoD;AA2BpD;;;;;;;;;;;GAWG;AACH,MAAa,YACT,SAAQ,iCAAY;IAepB,YAAY,OAA+B,EAAS,EAAU,EAAE,UAA8B;QAC1F,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QADiB,OAAE,GAAF,EAAE,CAAQ;QAV7C,cAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;QAO/D,UAAK,GAAG,IAAI,6BAAa,EAAiB,CAAC,CAAK,sBAAsB;QACtE,YAAO,GAAG,IAAI,6BAAa,EAAU,CAAC,CAAU,yBAAyB;QAihBjF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QAtiBE,IAAI,CAAC,IAAI,GAAG,IAAI,qCAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,GAAG,IAAI,qCAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACnC,CAAC;IAxBM,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,6BAAmB,EAAE,CAAC,CAAC,CAAC;IA4BhE;;OAEG;IACI,QAAQ,CAAC,QAAuB;QACnC,qBAAM,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAC1B,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,IAAI,CAAC,IAAI,GAAG,IAAI,iCAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,qBAAqB;IAErB,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,MAAM,CAAI,OAA+B,EAAE,EAAW;QAChE,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,6BAAmB,CAAC,IAAI,CAAoB,CAAC;IAClF,CAAC;IAED,0BAA0B;IAE1B,UAAU,CACN,QAAwC;QAExC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,WAAW,CAAC,QAAwC;QAChD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED,6BAA6B;IAE7B,wBAAwB;IAExB,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACvD,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAEhD,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,kFAAkF;QAClF,iFAAiF;QACjF,6EAA6E;QAE7E,4DAA4D;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,2BAAa,CAAC,SAAS,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,2BAAa,CAAC,SAAS,CAAC,EAAE;gBAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;aACnD;SACJ;aAAM;YACH,gFAAgF;YAChF,oCAAoC;YACpC,mBAAW,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;SAC3C;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAW,cAAc,KAAqC,OAAO,IAAI,CAAC,CAAC,CAAC;IAE5E,2BAA2B;IAEpB,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,qBAAM,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ;eAC/B,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,EAClC,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAErD,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAElC,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;SAC/C;IACL,CAAC;IAEM,QAAQ,CACX,QAAgB,EAChB,QAAgB,EAChB,QAAgB,EAChB,MAAkC;QAElC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QAErD,qBAAM,CAAC,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;eACzD,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAC3C,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAE/D,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,IAAI,CAAC,GAAG,QAAQ,CAAC;QACjB,IAAI,CAAC,GAAG,QAAQ,CAAC;QAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAE9B,IAAI,EAAE,CAAC,KAAK,MAAM,EAAE;gBAChB,CAAC,GAAG,QAAQ,CAAC;gBACb,CAAC,EAAE,CAAC;aACP;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACvE;IACL,CAAC;IAEO,WAAW,CACf,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAC7C,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC;QAE7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxD,IAAI,QAAQ,KAAK,IAAI,EAAE;gBACnB,QAAQ,GAAG,SAAS,CAAC;aACxB;YAED,IAAI,CAAC,IAAI,CAAC,OAAO,CACb,SAAS,EACT,SAAS,EACT,QAAQ,CAAC,CAAC;SACjB;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAEhD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;SAC7D;IACL,CAAC;IAEO,aAAa,CACjB,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAiB,EACjB,SAAiB,EACjB,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE;QAE9B,qBAAM,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,KAAK,CAAC,yEAAyE,CAAC,CAAC;QAE3G,MAAM,EAAE,GAAc;YAClB,IAAI,EAAE,cAAQ,CAAC,GAAG;YAClB,GAAG;YACH,GAAG;YACH,KAAK;SACR,CAAC;QAEF,MAAM,QAAQ,GAAmB;YAC7B,SAAS;YACT,SAAS;YACT,QAAQ;SACX,CAAC;QAEF,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IAEO,mBAAmB,CACvB,aAAgC,EAChC,cAAiC,EACjC,SAAgD,EAChD,OAAY;QAEZ,oGAAoG;QACpG,wGAAwG;QACxG,mEAAmE;QACnE,MAAM,QAAQ,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;QAC1D,MAAM,cAAc,GAAG,cAAc,CAAC,eAAe,EAAE,CAAC;QAExD,4GAA4G;QAC5G,6DAA6D;QAC7D,qBAAM,CAAC,QAAQ,IAAI,cAAc,CAAC,QAAQ,EACtC,KAAK,CAAC,iGAAiG,CAAC,CAAC;QAE7G,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEnC,sGAAsG;QACtG,sFAAsF;QACtF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,oFAAoF;YACpF,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;YAE3B,IAAI,CAAC,kBAAkB,CACnB,OAAO,EACP,aAAa,CAAC,wBAAwB,CAClC,OAAO,CAAC,IAAI,kBAA6B;gBACrC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM;gBACpB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACrB;IACL,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,kEAAkE;QAClE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,qEAAqE;QACrE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAES,aAAa,CAAC,UAA4B;QAChD,MAAM,OAAO,GAAG,IAAI,kCAAkB,EAAE,CAAC;QACzC,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,OAAO,sBACX,UAAU,CAAC,SAAS,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACrB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;SAC1B,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACrB,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACO,iBAAiB,CAAC,UAA6B;QACrD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;YAC1C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;aAC7D;SACJ;IACL,CAAC;IAED;;;;;OAKG;IACK,YAAY;QAChB,oGAAoG;QACpG,qGAAqG;QACrG,mGAAmG;QACnG,+BAA+B;QAE/B,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAAE,CAAC;QACvC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;IAClD,CAAC;IAES,kBAAkB,CAAC,OAAY,EAAE,eAAqB;QAC5D,0DAA0D;QAC1D,sEAAsE;QACtE,qBAAM,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAEtG,KAAK,CAAC,kBAAkB,CAAC,4CAAuB,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC;QAE1G,0EAA0E;QAC1E,qBAAM,CACF,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAC7E,KAAK,CAAC,4DAA4D,CACrE,CAAC;IACN,CAAC;IAES,SAAS;;QACf,8DAA8D;QAC9D,qFAAqF;QACrF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;YAC1E,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;SAC7E;IACL,CAAC;IAES,SAAS;QACf,qBAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,EAC1F,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,6FAA6F;QAC7F,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;IAC1E,CAAC;IAES,YAAY,CAAC,OAAY,EAAE,eAAwB;QACzD,QAAQ,OAAO,CAAC,MAAM,EAAE;YACpB;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,qBAAM,CAAC,OAAO,CAAC,IAAI,KAAK,cAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAErF,MAAM,KAAK,GAAG,OAAkC,CAAC;gBACjD,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;gBAE7E,qFAAqF;gBACrF,yFAAyF;gBACzF,qFAAqF;gBACrF,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;oBAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAE5D,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;wBACtB,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,CAAC,KAAK,EACX,SAAS,EACT,SAAS,EACT,QAAQ,CACX,CAAC;qBACL;iBACJ;gBACD,MAAM;aACT;SACJ;IACL,CAAC;IAES,YAAY,KAAI,CAAC;IAE3B;;OAEG;IACO,KAAK,CAAC,QAAQ,CAAC,OAA+B;QACpD,IAAI;YACA,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sCAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sCAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,CAAC,QAAQ,EAAE,iBAAiB,CAAC,GAAG,MAAM,+BAAe,CAAC,OAAO,uBAAsB,IAAI,CAAC,UAAU,CAAC,CAAC;YAE1G,IAAI,CAAC,KAAK,GAAG,6BAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,OAAO,GAAG,6BAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;SACxD;QAAC,OAAO,KAAK,EAAE;YACZ,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;SACxE;IACL,CAAC;IAES,WAAW,CAAC,UAAqC,EAAE,KAAc,EAAE,eAAwB;QACjG,MAAM,GAAG,GAAG,iCAAY,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;QAE9B,QAAQ,QAAQ,CAAC,MAAM,EAAE;YACrB;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,qBAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,cAAQ,CAAC,GAAG,EACjC,KAAK,CAAC,2DAA2D,CAAC,CAAC;gBAEvE,MAAM,EAAE,uBAAuB,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC;gBACjE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC;gBAE9B,IAAI,KAAK,EAAE;oBACP,8DAA8D;oBAC9D,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;oBAE7E,+EAA+E;oBAC/E,gEAAgE;oBAChE,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;wBAC3D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;qBACzD;iBACJ;qBAAM;oBACH,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;oBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;wBAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;wBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;wBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;4BAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAE5D,qBAAM,CAAC,2BAAa,CAAC,SAAS,CAAC,IAAI,2BAAa,CAAC,SAAS,CAAC,EACvD,KAAK,CAAC,wDAAwD,CAAC,CAAC;4BAEpE,oFAAoF;4BACpF,gDAAgD;4BAChD,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,SAAS,EAAE;gCAC1D,MAAM,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC;gCAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gCAEhD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;oCAC5C,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;iCAC/D;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ;IACL,CAAC;IA8BD;;;;;;;OAOG;IACK,oBAAoB,CAAC,SAAiB,EAAE,SAAiB,EAAE,QAAgB;QAC/E,oEAAoE;QACpE,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAE,CAAC;QAEpE,yFAAyF;QACzF,+FAA+F;QAC/F,kCAAkC;QAClC,qBAAM,CAAC,CAAC,CAAC,eAAe,GAAG,QAAQ,CAAC;QAChC,mCAAmC;QACnC,KAAK,CAAC,uGAAuG,CAAC,CAAC;QAEnH,wFAAwF;QACxF,mDAAmD;QACnD,OAAO,eAAe,KAAK,QAAQ,CAAC;IACxC,CAAC;IAEM,QAAQ;QACX,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,OAAO,CAAC,QAAQ,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC;QAE5G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;YACpC,CAAC,IAAI,KAAK,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,CAAC,GAAG,CAAC,EAAE;oBACP,CAAC,IAAI,IAAI,CAAC;iBACb;gBAED,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;aACxE;YACD,CAAC,IAAI,KAAK,CAAC;SACd;QAED,OAAO,GAAG,CAAC,IAAI,CAAC;IACpB,CAAC;IAES,cAAc;QACpB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACvC,CAAC;CACJ;AAxmBD,oCAwmBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport {\n    IFluidDataStoreRuntime,\n    IChannelStorageService,\n    Serializable,\n    IChannelAttributes,\n} from \"@fluidframework/datastore-definitions\";\nimport {\n    IFluidSerializer,\n    makeHandlesSerializable,\n    parseHandles,\n    SharedObject,\n    SummarySerializer,\n} from \"@fluidframework/shared-object-base\";\nimport { ISummaryTreeWithStats } from \"@fluidframework/runtime-definitions\";\nimport { ObjectStoragePartition, SummaryTreeBuilder } from \"@fluidframework/runtime-utils\";\nimport {\n    IMatrixProducer,\n    IMatrixConsumer,\n    IMatrixReader,\n    IMatrixWriter,\n} from \"@tiny-calc/nano\";\nimport { MergeTreeDeltaType, IMergeTreeOp, SegmentGroup, ISegment } from \"@fluidframework/merge-tree\";\nimport { MatrixOp } from \"./ops\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { SparseArray2D } from \"./sparsearray2d\";\nimport { SharedMatrixFactory } from \"./runtime\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { deserializeBlob } from \"./serialization\";\nimport { ensureRange } from \"./range\";\nimport { IUndoConsumer } from \"./types\";\nimport { MatrixUndoProvider } from \"./undoprovider\";\n\nconst enum SnapshotPath {\n    rows = \"rows\",\n    cols = \"cols\",\n    cells = \"cells\",\n}\n\ninterface ISetOp<T> {\n    type: MatrixOp.set,\n    row: number,\n    col: number,\n    value: MatrixItem<T>,\n}\n\ninterface ISetOpMetadata {\n    rowHandle: Handle,\n    colHandle: Handle,\n    localSeq: number,\n}\n\n/**\n * A matrix cell value may be undefined (indicating an empty cell) or any serializable type,\n * excluding null.  (However, nulls may be embedded inside objects and arrays.)\n */\nexport type MatrixItem<T> = Serializable<Exclude<T, null>> | undefined;\n\n/**\n * A SharedMatrix holds a rectangular 2D array of values.  Supported operations\n * include setting values and inserting/removing rows and columns.\n *\n * Matrix values may be any Fluid serializable type, which is the set of JSON\n * serializable types extended to include IFluidHandles.\n *\n * Fluid's SharedMatrix implementation works equally well for dense and sparse\n * matrix data and physically stores data in Z-order to leverage CPU caches and\n * prefetching when reading in either row or column major order.  (See README.md\n * for more details.)\n */\nexport class SharedMatrix<T = any>\n    extends SharedObject\n    implements IMatrixProducer<MatrixItem<T>>,\n    IMatrixReader<MatrixItem<T>>,\n    IMatrixWriter<MatrixItem<T>>\n{\n    private readonly consumers = new Set<IMatrixConsumer<MatrixItem<T>>>();\n\n    public static getFactory() { return new SharedMatrixFactory(); }\n\n    private readonly rows: PermutationVector;   // Map logical row to storage handle (if any)\n    private readonly cols: PermutationVector;   // Map logical col to storage handle (if any)\n\n    private cells = new SparseArray2D<MatrixItem<T>>();     // Stores cell values.\n    private pending = new SparseArray2D<number>();          // Tracks pending writes.\n\n    constructor(runtime: IFluidDataStoreRuntime, public id: string, attributes: IChannelAttributes) {\n        super(id, runtime, attributes);\n\n        this.rows = new PermutationVector(\n            SnapshotPath.rows,\n            this.logger,\n            runtime,\n            this.onRowDelta,\n            this.onRowHandlesRecycled);\n\n        this.cols = new PermutationVector(\n            SnapshotPath.cols,\n            this.logger,\n            runtime,\n            this.onColDelta,\n            this.onColHandlesRecycled);\n    }\n\n    private undo?: MatrixUndoProvider<T>;\n\n    /**\n     * Subscribes the given IUndoConsumer to the matrix.\n     */\n    public openUndo(consumer: IUndoConsumer) {\n        assert(this.undo === undefined,\n            0x019 /* \"SharedMatrix.openUndo() supports at most a single IUndoConsumer.\" */);\n\n        this.undo = new MatrixUndoProvider(consumer, this, this.rows, this.cols);\n    }\n\n    // TODO: closeUndo()?\n\n    private get rowHandles() { return this.rows.handleCache; }\n    private get colHandles() { return this.cols.handleCache; }\n\n    /**\n     * {@inheritDoc @fluidframework/datastore-definitions#IChannelFactory.create}\n     */\n    public static create<T>(runtime: IFluidDataStoreRuntime, id?: string) {\n        return runtime.createChannel(id, SharedMatrixFactory.Type) as SharedMatrix<T>;\n    }\n\n    // #region IMatrixProducer\n\n    openMatrix(\n        consumer: IMatrixConsumer<MatrixItem<T>>,\n    ): IMatrixReader<MatrixItem<T>> {\n        this.consumers.add(consumer);\n        return this;\n    }\n\n    closeMatrix(consumer: IMatrixConsumer<MatrixItem<T>>): void {\n        this.consumers.delete(consumer);\n    }\n\n    // #endregion IMatrixProducer\n\n    // #region IMatrixReader\n\n    public get rowCount() { return this.rows.getLength(); }\n    public get colCount() { return this.cols.getLength(); }\n\n    public getCell(row: number, col: number): MatrixItem<T> {\n        // Perf: When possible, bounds checking is performed inside the implementation for\n        //       'getHandle()' so that it can be elided in the case of a cache hit.  This\n        //       yields an ~40% improvement in the case of a cache hit (node v12 x64)\n\n        // Map the logical (row, col) to associated storage handles.\n        const rowHandle = this.rowHandles.getHandle(row);\n        if (isHandleValid(rowHandle)) {\n            const colHandle = this.colHandles.getHandle(col);\n            if (isHandleValid(colHandle)) {\n                return this.cells.getCell(rowHandle, colHandle);\n            }\n        } else {\n            // If we early exit because the given rowHandle is unallocated, we still need to\n            // bounds-check the 'col' parameter.\n            ensureRange(col, this.cols.getLength());\n        }\n\n        return undefined;\n    }\n\n    public get matrixProducer(): IMatrixProducer<MatrixItem<T>> { return this; }\n\n    // #endregion IMatrixReader\n\n    public setCell(row: number, col: number, value: MatrixItem<T>) {\n        assert(0 <= row && row < this.rowCount\n            && 0 <= col && col < this.colCount,\n            0x01a /* \"Trying to set out-of-bounds cell!\" */);\n\n        this.setCellCore(row, col, value);\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(row, col, 1, 1, this);\n        }\n    }\n\n    public setCells(\n        rowStart: number,\n        colStart: number,\n        colCount: number,\n        values: readonly (MatrixItem<T>)[],\n    ) {\n        const rowCount = Math.ceil(values.length / colCount);\n\n        assert((0 <= rowStart && rowStart < this.rowCount)\n            && (0 <= colStart && colStart < this.colCount)\n            && (1 <= colCount && colCount <= (this.colCount - colStart))\n            && (rowCount <= (this.rowCount - rowStart)),\n            0x01b /* \"Trying to set multiple out-of-bounds cells!\" */);\n\n        const endCol = colStart + colCount;\n        let r = rowStart;\n        let c = colStart;\n\n        for (const value of values) {\n            this.setCellCore(r, c, value);\n\n            if (++c === endCol) {\n                c = colStart;\n                r++;\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, colStart, rowCount, colCount, this);\n        }\n    }\n\n    private setCellCore(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle = this.rows.getAllocatedHandle(row),\n        colHandle = this.cols.getAllocatedHandle(col),\n    ) {\n        if (this.undo !== undefined) {\n            let oldValue = this.cells.getCell(rowHandle, colHandle);\n            if (oldValue === null) {\n                oldValue = undefined;\n            }\n\n            this.undo.cellSet(\n                rowHandle,\n                colHandle,\n                oldValue);\n        }\n\n        this.cells.setCell(rowHandle, colHandle, value);\n\n        if (this.isAttached()) {\n            this.sendSetCellOp(row, col, value, rowHandle, colHandle);\n        }\n    }\n\n    private sendSetCellOp(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle: Handle,\n        colHandle: Handle,\n        localSeq = this.nextLocalSeq(),\n    ) {\n        assert(this.isAttached(), 0x1e2 /* \"Caller must ensure 'isAttached()' before calling 'sendSetCellOp'.\" */);\n\n        const op: ISetOp<T> = {\n            type: MatrixOp.set,\n            row,\n            col,\n            value,\n        };\n\n        const metadata: ISetOpMetadata = {\n            rowHandle,\n            colHandle,\n            localSeq,\n        };\n\n        this.submitLocalMessage(op, metadata);\n        this.pending.setCell(rowHandle, colHandle, localSeq);\n    }\n\n    private submitVectorMessage(\n        currentVector: PermutationVector,\n        oppositeVector: PermutationVector,\n        dimension: SnapshotPath.rows | SnapshotPath.cols,\n        message: any,\n    ) {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally advance each MergeTree's 'localSeq' counter\n        // for each submitted op it not aware of to keep them synchronized.\n        const localSeq = currentVector.getCollabWindow().localSeq;\n        const oppositeWindow = oppositeVector.getCollabWindow();\n\n        // Note that the comparison is '>=' because, in the case the MergeTree is regenerating ops for reconnection,\n        // the MergeTree submits the op with the original 'localSeq'.\n        assert(localSeq >= oppositeWindow.localSeq,\n            0x01c /* \"The 'localSeq' of the vector submitting an op must >= the 'localSeq' of the other vector.\" */);\n\n        oppositeWindow.localSeq = localSeq;\n\n        // If the SharedMatrix is local, it's state will be submitted via a Snapshot when initially connected.\n        // Do not queue a message or track the pending op, as there will never be an ACK, etc.\n        if (this.isAttached()) {\n            // Record whether this `op` targets rows or cols.  (See dispatch in `processCore()`)\n            message.target = dimension;\n\n            this.submitLocalMessage(\n                message,\n                currentVector.peekPendingSegmentGroups(\n                    message.type === MergeTreeDeltaType.GROUP\n                        ? message.ops.length\n                        : 1));\n        }\n    }\n\n    private submitColMessage(message: any) {\n        this.submitVectorMessage(this.cols, this.rows, SnapshotPath.cols, message);\n    }\n\n    public insertCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.insert(colStart, count));\n    }\n\n    public removeCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.remove(colStart, count));\n    }\n\n    private submitRowMessage(message: any) {\n        this.submitVectorMessage(this.rows, this.cols, SnapshotPath.rows, message);\n    }\n\n    public insertRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.insert(rowStart, count));\n    }\n\n    public removeRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.remove(rowStart, count));\n    }\n\n    /** @internal */ public _undoRemoveRows(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of rows at the original position.\n        const { op, inserted } = this.rows.insertRelative(original, original.cachedLength);\n        this.submitRowMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'rowsChanged'\n        // callback, which occurs before the handle span is populated.\n        const rowStart = this.rows.getPosition(inserted);\n        this.rows.handleCache.itemsChanged(\n            rowStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted rows.\n        let rowHandle = inserted.start;\n        const rowCount = inserted.cachedLength;\n        for (let row = rowStart; row < rowStart + rowCount; row++, rowHandle++) {\n            for (let col = 0; col < this.colCount; col++) {\n                const colHandle = this.colHandles.getHandle(col);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, /* colStart: */ 0, rowCount, this.colCount, this);\n        }\n    }\n\n    /** @internal */ public _undoRemoveCols(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of columns at the original position.\n        const { op, inserted } = this.cols.insertRelative(original, original.cachedLength);\n        this.submitColMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'colsChanged'\n        // callback, which occurs before the handle span is populated.\n        const colStart = this.cols.getPosition(inserted);\n        this.cols.handleCache.itemsChanged(\n            colStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted cols.\n        let colHandle = inserted.start;\n        const colCount = inserted.cachedLength;\n        for (let col = colStart; col < colStart + colCount; col++, colHandle++) {\n            for (let row = 0; row < this.rowCount; row++) {\n                const rowHandle = this.rowHandles.getHandle(row);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(/* rowStart: */ 0, colStart, this.rowCount, colCount, this);\n        }\n    }\n\n    protected summarizeCore(serializer: IFluidSerializer): ISummaryTreeWithStats {\n        const builder = new SummaryTreeBuilder();\n        builder.addWithStats(SnapshotPath.rows, this.rows.summarize(this.runtime, this.handle, serializer));\n        builder.addWithStats(SnapshotPath.cols, this.cols.summarize(this.runtime, this.handle, serializer));\n        builder.addBlob(SnapshotPath.cells,\n            serializer.stringify([\n                this.cells.snapshot(),\n                this.pending.snapshot(),\n            ], this.handle));\n        return builder.getSummaryTree();\n    }\n\n    /**\n     * Runs serializer on the GC data for this SharedMatrix.\n     * All the IFluidHandle's stored in the cells represent routes to other objects.\n     */\n    protected processGCDataCore(serializer: SummarySerializer) {\n        for (let row = 0; row < this.rowCount; row++) {\n            for (let col = 0; col < this.colCount; col++) {\n                serializer.stringify(this.getCell(row, col), this.handle);\n            }\n        }\n    }\n\n    /**\n     * Advances the 'localSeq' counter for the cell data operation currently being queued.\n     *\n     * Do not use with 'submitColMessage()/submitRowMessage()' as these helpers + the MergeTree will\n     * automatically advance 'localSeq'.\n     */\n    private nextLocalSeq() {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally bump each MergeTree's 'localSeq' counter\n        // for SharedMatrix ops it's not aware of to keep them synchronized.  (For cell data operations, we\n        // need to bump both counters.)\n\n        this.cols.getCollabWindow().localSeq++;\n        return ++this.rows.getCollabWindow().localSeq;\n    }\n\n    protected submitLocalMessage(message: any, localOpMetadata?: any) {\n        // TODO: Recommend moving this assertion into SharedObject\n        //       (See https://github.com/microsoft/FluidFramework/issues/2559)\n        assert(this.isAttached() === true, 0x01d /* \"Trying to submit message to runtime while detached!\" */);\n\n        super.submitLocalMessage(makeHandlesSerializable(message, this.serializer, this.handle), localOpMetadata);\n\n        // Ensure that row/col 'localSeq' are synchronized (see 'nextLocalSeq()').\n        assert(\n            this.rows.getCollabWindow().localSeq === this.cols.getCollabWindow().localSeq,\n            0x01e /* \"Row and col collab window 'localSeq' desynchronized!\" */,\n        );\n    }\n\n    protected didAttach() {\n        // We've attached we need to start generating and sending ops.\n        // so start collaboration and provide a default client id incase we are not connected\n        if (this.isAttached()) {\n            this.rows.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n            this.cols.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n        }\n    }\n\n    protected onConnect() {\n        assert(this.rows.getCollabWindow().collaborating === this.cols.getCollabWindow().collaborating,\n            0x01f /* \"Row and col collab window 'collaborating' status desynchronized!\" */);\n\n        // Update merge tree collaboration information with new client ID and then resend pending ops\n        this.rows.startOrUpdateCollaboration(this.runtime.clientId as string);\n        this.cols.startOrUpdateCollaboration(this.runtime.clientId as string);\n    }\n\n    protected reSubmitCore(content: any, localOpMetadata: unknown) {\n        switch (content.target) {\n            case SnapshotPath.cols:\n                this.submitColMessage(this.cols.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            case SnapshotPath.rows:\n                this.submitRowMessage(this.rows.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            default: {\n                assert(content.type === MatrixOp.set, 0x020 /* \"Unknown SharedMatrix 'op' type.\" */);\n\n                const setOp = content as ISetOp<Serializable<T>>;\n                const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                // If there are more pending local writes to the same row/col handle, it is important\n                // to skip resubmitting this op since it is possible the row/col handle has been recycled\n                // and now refers to a different position than when this op was originally submitted.\n                if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                    const row = this.rows.handleToPosition(rowHandle, localSeq);\n                    const col = this.cols.handleToPosition(colHandle, localSeq);\n\n                    if (row >= 0 && col >= 0) {\n                        this.sendSetCellOp(\n                            row,\n                            col,\n                            setOp.value,\n                            rowHandle,\n                            colHandle,\n                            localSeq,\n                        );\n                    }\n                }\n                break;\n            }\n        }\n    }\n\n    protected onDisconnect() {}\n\n    /**\n     * {@inheritDoc @fluidframework/shared-object-base#SharedObject.loadCore}\n     */\n    protected async loadCore(storage: IChannelStorageService) {\n        try {\n            await this.rows.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.rows),\n                this.serializer);\n            await this.cols.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.cols),\n                this.serializer);\n            const [cellData, pendingCliSeqData] = await deserializeBlob(storage, SnapshotPath.cells, this.serializer);\n\n            this.cells = SparseArray2D.load(cellData);\n            this.pending = SparseArray2D.load(pendingCliSeqData);\n        } catch (error) {\n            this.logger.sendErrorEvent({ eventName: \"MatrixLoadFailed\" }, error);\n        }\n    }\n\n    protected processCore(rawMessage: ISequencedDocumentMessage, local: boolean, localOpMetadata: unknown) {\n        const msg = parseHandles(rawMessage, this.serializer);\n\n        const contents = msg.contents;\n\n        switch (contents.target) {\n            case SnapshotPath.cols:\n                this.cols.applyMsg(msg);\n                break;\n            case SnapshotPath.rows:\n                this.rows.applyMsg(msg);\n                break;\n            default: {\n                assert(contents.type === MatrixOp.set,\n                    0x021 /* \"SharedMatrix message contents have unexpected type!\" */);\n\n                const { referenceSequenceNumber: refSeq, clientId } = rawMessage;\n                const { row, col } = contents;\n\n                if (local) {\n                    // We are receiving the ACK for a local pending set operation.\n                    const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                    // If this is the most recent write to the cell by the local client, remove our\n                    // entry from 'pendingCliSeqs' to resume allowing remote writes.\n                    if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                        this.pending.setCell(rowHandle, colHandle, undefined);\n                    }\n                } else {\n                    const rowClientId = this.rows.getOrAddShortClientId(clientId);\n                    const adjustedRow = this.rows.adjustPosition(row, refSeq, rowClientId);\n\n                    if (adjustedRow !== undefined) {\n                        const colClientId = this.cols.getOrAddShortClientId(clientId);\n                        const adjustedCol = this.cols.adjustPosition(col, refSeq, colClientId);\n\n                        if (adjustedCol !== undefined) {\n                            const rowHandle = this.rows.getAllocatedHandle(adjustedRow);\n                            const colHandle = this.cols.getAllocatedHandle(adjustedCol);\n\n                            assert(isHandleValid(rowHandle) && isHandleValid(colHandle),\n                                0x022 /* \"SharedMatrix row and/or col handles are invalid!\" */);\n\n                            // If there is a pending (unACKed) local write to the same cell, skip the current op\n                            // since it \"happened before\" the pending write.\n                            if (this.pending.getCell(rowHandle, colHandle) === undefined) {\n                                const { value } = contents;\n                                this.cells.setCell(rowHandle, colHandle, value);\n\n                                for (const consumer of this.consumers.values()) {\n                                    consumer.cellsChanged(adjustedRow, adjustedCol, 1, 1, this);\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of row insertion/deletions.\n    private readonly onRowDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.rowsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of col insertion/deletions.\n    private readonly onColDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.colsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    private readonly onRowHandlesRecycled = (rowHandles: Handle[]) => {\n        for (const rowHandle of rowHandles) {\n            this.cells.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n            this.pending.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n        }\n    };\n\n    private readonly onColHandlesRecycled = (colHandles: Handle[]) => {\n        for (const colHandle of colHandles) {\n            this.cells.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n            this.pending.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n        }\n    };\n\n    /**\n     * Returns true if the latest pending write to the cell indicated by the given row/col handles\n     * matches the given 'localSeq'.\n     *\n     * A return value of `true` indicates that there are no later local operations queued that will\n     * clobber the write op at the given 'localSeq'.  This includes later ops that overwrite the cell\n     * with a different value as well as row/col removals that might recycled the given row/col handles.\n     */\n    private isLatestPendingWrite(rowHandle: Handle, colHandle: Handle, localSeq: number) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const pendingLocalSeq = this.pending.getCell(rowHandle, colHandle)!;\n\n        // Note while we're awaiting the ACK for a local set, it's possible for the row/col to be\n        // locally removed and the row/col handles recycled.  If this happens, the pendingLocalSeq will\n        // be 'undefined' or > 'localSeq'.\n        assert(!(pendingLocalSeq < localSeq),\n            // eslint-disable-next-line max-len\n            0x023 /* \"The 'localSeq' of pending write (if any) must be <= the localSeq of the currently processed op.\" */);\n\n        // If this is the most recent write to the cell by the local client, the stored localSeq\n        // will be an exact match for the given 'localSeq'.\n        return pendingLocalSeq === localSeq;\n    }\n\n    public toString() {\n        let s = `client:${this.runtime.clientId}\\nrows: ${this.rows.toString()}\\ncols: ${this.cols.toString()}\\n\\n`;\n\n        for (let r = 0; r < this.rowCount; r++) {\n            s += `  [`;\n            for (let c = 0; c < this.colCount; c++) {\n                if (c > 0) {\n                    s += \", \";\n                }\n\n                s += `${this.serializer.stringify(this.getCell(r, c), this.handle)}`;\n            }\n            s += \"]\\n\";\n        }\n\n        return `${s}\\n`;\n    }\n\n    protected applyStashedOp() {\n        throw new Error(\"not implemented\");\n    }\n}\n"]}

package/dist/packageVersion.d.ts

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export declare const pkgName = "@fluidframework/matrix";
-export declare const pkgVersion = "0.56.7";
+export declare const pkgVersion = "0.57.1";
 //# sourceMappingURL=packageVersion.d.ts.map

package/dist/packageVersion.js

@@ -8,5 +8,5 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.pkgVersion = exports.pkgName = void 0;
 exports.pkgName = "@fluidframework/matrix";
-exports.pkgVersion = "0.56.7";
+exports.pkgVersion = "0.57.1";
 //# sourceMappingURL=packageVersion.js.map

package/dist/packageVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEU,QAAA,OAAO,GAAG,wBAAwB,CAAC;AACnC,QAAA,UAAU,GAAG,QAAQ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"0.56.7\";\n"]}
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEU,QAAA,OAAO,GAAG,wBAAwB,CAAC;AACnC,QAAA,UAAU,GAAG,QAAQ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"0.57.1\";\n"]}

package/dist/sparsearray2d.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparsearray2d.d.ts","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAkC/D,aAAK,gBAAgB,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7C,aAAK,UAAU,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;AAY3C,aAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAE/B;;GAEG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC;IACnF,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,GAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAe;IAEtE,IAAW,QAAQ,WAAyB;IAC5C,IAAW,QAAQ,WAAyB;IAErC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAqBvD,IAAW,cAAc,QAA+B;IAEjD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS;IAW7D;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB,wEAAwE;IACjE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,uEAAuE;IAChE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,OAAO,CAAC,QAAQ;IAQT,QAAQ;WAID,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;CAG5C"}
+{"version":3,"file":"sparsearray2d.d.ts","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAkC/D,aAAK,gBAAgB,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7C,aAAK,UAAU,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;AAW3C,aAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAE/B;;GAEG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC;IACnF,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,GAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAe;IAEtE,IAAW,QAAQ,WAAyB;IAC5C,IAAW,QAAQ,WAAyB;IAErC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAqBvD,IAAW,cAAc,QAA+B;IAEjD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS;IAW7D;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB,wEAAwE;IACjE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,uEAAuE;IAChE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,OAAO,CAAC,QAAQ;IAQT,QAAQ;WAID,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;CAG5C"}

package/dist/sparsearray2d.js

@@ -33,7 +33,6 @@ const c0ToMorton16 = (col) => interlaceBitsX16(col) >>> 0;
 const r0c0ToMorton2x16 = (row, col) => (r0ToMorton16(row) | c0ToMorton16(col)) >>> 0;
 /** Undo JSON serialization's coercion of 'undefined' to null. */
 const nullToUndefined = (array) => array.map((value) => {
-    // eslint-disable-next-line no-null/no-null
     return value === null
         ? undefined
         : Array.isArray(value)

package/dist/sparsearray2d.js.map

@@ -1 +1 @@
-{"version":3,"file":"sparsearray2d.js","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAMH,8EAA8E;AAC9E,6EAA6E;AAC7E,EAAE;AACF,6EAA6E;AAC7E,yDAAyD;AACzD,MAAM,iBAAiB,GACnB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC,CAAC;AAEP,iFAAiF;AACjF,6DAA6D;AAC7D,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;AAC1C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AACjD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAClD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAElD,uEAAuE;AACvE,yEAAyE;AACzE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AAEhH,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;AACzE,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAElE,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAKrG,iEAAiE;AACjE,MAAM,eAAe,GAAG,CAAI,KAA2B,EAA6B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;IACvG,2CAA2C;IAC3C,OAAO,KAAK,KAAK,IAAI;QACjB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAClB,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC;AACpB,CAAC,CAAC,CAAC;AAIH;;GAEG;AACH,MAAa,aAAa;IACtB,YAA6B,OAA8B,CAAC,SAAS,CAAC;QAAzC,SAAI,GAAJ,IAAI,CAAqC;IAAI,CAAC;IAE3E,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAC5C,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAErC,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,SAAS,EAAE;YACtB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;wBACtB,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;qBAC/B;iBACJ;aACJ;SACJ;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,+DAA+D;IAC/D,IAAW,cAAc,KAAK,OAAO,SAAgB,CAAC,CAAC,CAAC;IAEjD,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,OAAe,EAAE,QAA+B;QACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;SACjD;IACL,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,GAAW,EAAE,QAA+B;QAChE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;SAC7C;IACL,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,wEAAwE;IACjE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAED,uEAAuE;IAChE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAEO,QAAQ,CAAI,MAAiB,EAAE,MAAc;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,+DAA+D;QAC/D,OAAO,KAAK,KAAK,SAAS;YACtB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACnD,CAAC,CAAC,KAAK,CAAC;IAChB,CAAC;IAEM,QAAQ;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAEM,MAAM,CAAC,IAAI,CAAI,IAAmB;QACrC,OAAO,IAAI,aAAa,CAAI,eAAe,CAAI,IAAI,CAA6B,CAAC,CAAC;IACtF,CAAC;CACJ;AA/KD,sCA+KC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { IMatrixReader, IMatrixWriter } from \"@tiny-calc/nano\";\n\n// Build a lookup table that maps a uint8 to the corresponding uint16 where 0s\n// are interleaved between the original bits. (e.g., 1111... -> 01010101...).\n//\n// (Lookup table ~17% faster than inlining the bit-twiddling on Node v12 x64)\n// (Array<T> ~2% faster than typed array on Node v12 x64)\nconst x8ToInterlacedX16 =\n    new Array(256).fill(0).map((value, i) => {\n        let j = i;\n        j = (j | (j << 4)) & 0x0f0f; // .... 7654 .... 3210\n        j = (j | (j << 2)) & 0x3333; // ..76 ..54 ..32 ..10\n        j = (j | (j << 1)) & 0x5555; // .7.6 .5.4 .3.2 .1.0\n        return j;\n    });\n\n// Selects individual bytes from a given 32b integer.  The left shift are used to\n// clear upper bits (faster than using masks on Node 10 x64).\nconst byte0 = (x32: number) => x32 >>> 24;\nconst byte1 = (x32: number) => (x32 << 8) >>> 24;\nconst byte2 = (x32: number) => (x32 << 16) >>> 24;\nconst byte3 = (x32: number) => (x32 << 24) >>> 24;\n\n// Given a uint16 returns the corresponding uint32 integer where 0s are\n// interleaved between the original bits. (e.g., 1111... -> 01010101...).\nconst interlaceBitsX16 = (x16: number) => (x8ToInterlacedX16[byte2(x16)] << 16) | x8ToInterlacedX16[byte3(x16)];\n\nconst r0ToMorton16 = (row: number) => (interlaceBitsX16(row) << 1) >>> 0;\nconst c0ToMorton16 = (col: number) => interlaceBitsX16(col) >>> 0;\n\n// Given a 2D uint16 coordinate returns the corresponding unt32 Morton coded\n// coordinate.  (See https://en.wikipedia.org/wiki/Z-order_curve)\nconst r0c0ToMorton2x16 = (row: number, col: number) => (r0ToMorton16(row) | c0ToMorton16(col)) >>> 0;\n\ntype RecurArrayHelper<T> = RecurArray<T> | T;\ntype RecurArray<T> = RecurArrayHelper<T>[];\n\n/** Undo JSON serialization's coercion of 'undefined' to null. */\nconst nullToUndefined = <T>(array: RecurArray<T | null>): RecurArray<T | undefined> => array.map((value) => {\n    // eslint-disable-next-line no-null/no-null\n    return value === null\n        ? undefined\n        : Array.isArray(value)\n            ? nullToUndefined(value)\n            : value;\n});\n\ntype UA<T> = (T | undefined)[];\n\n/**\n * A sparse 4 billion x 4 billion array stored as 16x16 tiles.\n */\nexport class SparseArray2D<T> implements IMatrixReader<T | undefined>, IMatrixWriter<T | undefined> {\n    constructor(private readonly root: UA<UA<UA<UA<UA<T>>>>> = [undefined]) { }\n\n    public get rowCount() { return 0xFFFFFFFF; }\n    public get colCount() { return 0xFFFFFFFF; }\n\n    public getCell(row: number, col: number): T | undefined {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const level0 = this.root[keyHi];\n        if (level0 !== undefined) {\n            const keyLo = r0c0ToMorton2x16(row, col);\n            const level1 = level0[byte0(keyLo)];\n            if (level1 !== undefined) {\n                const level2 = level1[byte1(keyLo)];\n                if (level2 !== undefined) {\n                    const level3 = level2[byte2(keyLo)];\n                    if (level3 !== undefined) {\n                        return level3[byte3(keyLo)];\n                    }\n                }\n            }\n        }\n\n        return undefined;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n    public get matrixProducer() { return undefined as any; }\n\n    public setCell(row: number, col: number, value: T | undefined) {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const keyLo = r0c0ToMorton2x16(row, col);\n\n        const level0 = this.getLevel(this.root, keyHi);\n        const level1 = this.getLevel(level0, byte0(keyLo));\n        const level2 = this.getLevel(level1, byte1(keyLo));\n        const level3 = this.getLevel(level2, byte2(keyLo));\n        level3[byte3(keyLo)] = value;\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated row.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInRow(rowBits: number, callback: (key: number) => void) {\n        for (let col = 0; col < 16; col++) {\n            // Perf: Potentially faster to replace 'c0ToMorton16()' with a short look up table?\n            callback((rowBits | c0ToMorton16(col)) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated col.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInCol(col: number, callback: (key: number) => void) {\n        for (let row = 0; row < 16; row++) {\n            // Perf: Potentially faster to replace 'r0ToMorton16()' with a short look up table?\n            callback((r0ToMorton16(row) | col) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given row  in the 'currentLevel'.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInRow<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        rowBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInRow(rowBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given col in the 'currentLevel'.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInCol<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        colBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInCol(colBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /** Clears the all cells contained within the specified span of rows. */\n    public clearRows(rowStart: number, rowCount: number) {\n        const rowEnd = rowStart + rowCount;\n        for (let row = rowStart; row < rowEnd; row++) {\n            const rowHi = r0ToMorton16(row >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let colHi = 0; colHi < 0x10000; colHi++) {\n                const keyHi = (rowHi | c0ToMorton16(colHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const rowLo = r0ToMorton16(row);\n                    this.forEachInRow(level0, byte0(rowLo), (level1) => {\n                        this.forEachInRow(level1, byte1(rowLo), (level2) => {\n                            this.forEachInRow(level2, byte2(rowLo), (level3) => {\n                                this.forEachKeyInRow(byte3(rowLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    /** Clears the all cells contained within the specifed span of cols. */\n    public clearCols(colStart: number, colCount: number) {\n        const colEnd = colStart + colCount;\n        for (let col = colStart; col < colEnd; col++) {\n            const colHi = c0ToMorton16(col >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let rowHi = 0; rowHi < 0x10000; rowHi++) {\n                const keyHi = (colHi | r0ToMorton16(rowHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const colLo = c0ToMorton16(col);\n                    this.forEachInCol(level0, byte0(colLo), (level1) => {\n                        this.forEachInCol(level1, byte1(colLo), (level2) => {\n                            this.forEachInCol(level2, byte2(colLo), (level3) => {\n                                this.forEachKeyInCol(byte3(colLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    private getLevel<T>(parent: UA<UA<T>>, subKey: number) {\n        const level = parent[subKey];\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n        return level === undefined\n            ? (parent[subKey] = new Array(256).fill(undefined))\n            : level;\n    }\n\n    public snapshot() {\n        return this.root;\n    }\n\n    public static load<T>(data: RecurArray<T>) {\n        return new SparseArray2D<T>(nullToUndefined<T>(data) as SparseArray2D<T>[\"root\"]);\n    }\n}\n"]}
+{"version":3,"file":"sparsearray2d.js","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAMH,8EAA8E;AAC9E,6EAA6E;AAC7E,EAAE;AACF,6EAA6E;AAC7E,yDAAyD;AACzD,MAAM,iBAAiB,GACnB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC,CAAC;AAEP,iFAAiF;AACjF,6DAA6D;AAC7D,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;AAC1C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AACjD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAClD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAElD,uEAAuE;AACvE,yEAAyE;AACzE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AAEhH,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;AACzE,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAElE,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAKrG,iEAAiE;AACjE,MAAM,eAAe,GAAG,CAAI,KAA2B,EAA6B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;IACvG,OAAO,KAAK,KAAK,IAAI;QACjB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAClB,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC;AACpB,CAAC,CAAC,CAAC;AAIH;;GAEG;AACH,MAAa,aAAa;IACtB,YAA6B,OAA8B,CAAC,SAAS,CAAC;QAAzC,SAAI,GAAJ,IAAI,CAAqC;IAAI,CAAC;IAE3E,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAC5C,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAErC,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,SAAS,EAAE;YACtB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;wBACtB,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;qBAC/B;iBACJ;aACJ;SACJ;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,+DAA+D;IAC/D,IAAW,cAAc,KAAK,OAAO,SAAgB,CAAC,CAAC,CAAC;IAEjD,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,OAAe,EAAE,QAA+B;QACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;SACjD;IACL,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,GAAW,EAAE,QAA+B;QAChE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;SAC7C;IACL,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,wEAAwE;IACjE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAED,uEAAuE;IAChE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAEO,QAAQ,CAAI,MAAiB,EAAE,MAAc;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,+DAA+D;QAC/D,OAAO,KAAK,KAAK,SAAS;YACtB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACnD,CAAC,CAAC,KAAK,CAAC;IAChB,CAAC;IAEM,QAAQ;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAEM,MAAM,CAAC,IAAI,CAAI,IAAmB;QACrC,OAAO,IAAI,aAAa,CAAI,eAAe,CAAI,IAAI,CAA6B,CAAC,CAAC;IACtF,CAAC;CACJ;AA/KD,sCA+KC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { IMatrixReader, IMatrixWriter } from \"@tiny-calc/nano\";\n\n// Build a lookup table that maps a uint8 to the corresponding uint16 where 0s\n// are interleaved between the original bits. (e.g., 1111... -> 01010101...).\n//\n// (Lookup table ~17% faster than inlining the bit-twiddling on Node v12 x64)\n// (Array<T> ~2% faster than typed array on Node v12 x64)\nconst x8ToInterlacedX16 =\n    new Array(256).fill(0).map((value, i) => {\n        let j = i;\n        j = (j | (j << 4)) & 0x0f0f; // .... 7654 .... 3210\n        j = (j | (j << 2)) & 0x3333; // ..76 ..54 ..32 ..10\n        j = (j | (j << 1)) & 0x5555; // .7.6 .5.4 .3.2 .1.0\n        return j;\n    });\n\n// Selects individual bytes from a given 32b integer.  The left shift are used to\n// clear upper bits (faster than using masks on Node 10 x64).\nconst byte0 = (x32: number) => x32 >>> 24;\nconst byte1 = (x32: number) => (x32 << 8) >>> 24;\nconst byte2 = (x32: number) => (x32 << 16) >>> 24;\nconst byte3 = (x32: number) => (x32 << 24) >>> 24;\n\n// Given a uint16 returns the corresponding uint32 integer where 0s are\n// interleaved between the original bits. (e.g., 1111... -> 01010101...).\nconst interlaceBitsX16 = (x16: number) => (x8ToInterlacedX16[byte2(x16)] << 16) | x8ToInterlacedX16[byte3(x16)];\n\nconst r0ToMorton16 = (row: number) => (interlaceBitsX16(row) << 1) >>> 0;\nconst c0ToMorton16 = (col: number) => interlaceBitsX16(col) >>> 0;\n\n// Given a 2D uint16 coordinate returns the corresponding unt32 Morton coded\n// coordinate.  (See https://en.wikipedia.org/wiki/Z-order_curve)\nconst r0c0ToMorton2x16 = (row: number, col: number) => (r0ToMorton16(row) | c0ToMorton16(col)) >>> 0;\n\ntype RecurArrayHelper<T> = RecurArray<T> | T;\ntype RecurArray<T> = RecurArrayHelper<T>[];\n\n/** Undo JSON serialization's coercion of 'undefined' to null. */\nconst nullToUndefined = <T>(array: RecurArray<T | null>): RecurArray<T | undefined> => array.map((value) => {\n    return value === null\n        ? undefined\n        : Array.isArray(value)\n            ? nullToUndefined(value)\n            : value;\n});\n\ntype UA<T> = (T | undefined)[];\n\n/**\n * A sparse 4 billion x 4 billion array stored as 16x16 tiles.\n */\nexport class SparseArray2D<T> implements IMatrixReader<T | undefined>, IMatrixWriter<T | undefined> {\n    constructor(private readonly root: UA<UA<UA<UA<UA<T>>>>> = [undefined]) { }\n\n    public get rowCount() { return 0xFFFFFFFF; }\n    public get colCount() { return 0xFFFFFFFF; }\n\n    public getCell(row: number, col: number): T | undefined {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const level0 = this.root[keyHi];\n        if (level0 !== undefined) {\n            const keyLo = r0c0ToMorton2x16(row, col);\n            const level1 = level0[byte0(keyLo)];\n            if (level1 !== undefined) {\n                const level2 = level1[byte1(keyLo)];\n                if (level2 !== undefined) {\n                    const level3 = level2[byte2(keyLo)];\n                    if (level3 !== undefined) {\n                        return level3[byte3(keyLo)];\n                    }\n                }\n            }\n        }\n\n        return undefined;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n    public get matrixProducer() { return undefined as any; }\n\n    public setCell(row: number, col: number, value: T | undefined) {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const keyLo = r0c0ToMorton2x16(row, col);\n\n        const level0 = this.getLevel(this.root, keyHi);\n        const level1 = this.getLevel(level0, byte0(keyLo));\n        const level2 = this.getLevel(level1, byte1(keyLo));\n        const level3 = this.getLevel(level2, byte2(keyLo));\n        level3[byte3(keyLo)] = value;\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated row.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInRow(rowBits: number, callback: (key: number) => void) {\n        for (let col = 0; col < 16; col++) {\n            // Perf: Potentially faster to replace 'c0ToMorton16()' with a short look up table?\n            callback((rowBits | c0ToMorton16(col)) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated col.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInCol(col: number, callback: (key: number) => void) {\n        for (let row = 0; row < 16; row++) {\n            // Perf: Potentially faster to replace 'r0ToMorton16()' with a short look up table?\n            callback((r0ToMorton16(row) | col) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given row  in the 'currentLevel'.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInRow<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        rowBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInRow(rowBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given col in the 'currentLevel'.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInCol<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        colBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInCol(colBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /** Clears the all cells contained within the specified span of rows. */\n    public clearRows(rowStart: number, rowCount: number) {\n        const rowEnd = rowStart + rowCount;\n        for (let row = rowStart; row < rowEnd; row++) {\n            const rowHi = r0ToMorton16(row >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let colHi = 0; colHi < 0x10000; colHi++) {\n                const keyHi = (rowHi | c0ToMorton16(colHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const rowLo = r0ToMorton16(row);\n                    this.forEachInRow(level0, byte0(rowLo), (level1) => {\n                        this.forEachInRow(level1, byte1(rowLo), (level2) => {\n                            this.forEachInRow(level2, byte2(rowLo), (level3) => {\n                                this.forEachKeyInRow(byte3(rowLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    /** Clears the all cells contained within the specifed span of cols. */\n    public clearCols(colStart: number, colCount: number) {\n        const colEnd = colStart + colCount;\n        for (let col = colStart; col < colEnd; col++) {\n            const colHi = c0ToMorton16(col >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let rowHi = 0; rowHi < 0x10000; rowHi++) {\n                const keyHi = (colHi | r0ToMorton16(rowHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const colLo = c0ToMorton16(col);\n                    this.forEachInCol(level0, byte0(colLo), (level1) => {\n                        this.forEachInCol(level1, byte1(colLo), (level2) => {\n                            this.forEachInCol(level2, byte2(colLo), (level3) => {\n                                this.forEachKeyInCol(byte3(colLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    private getLevel<T>(parent: UA<UA<T>>, subKey: number) {\n        const level = parent[subKey];\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n        return level === undefined\n            ? (parent[subKey] = new Array(256).fill(undefined))\n            : level;\n    }\n\n    public snapshot() {\n        return this.root;\n    }\n\n    public static load<T>(data: RecurArray<T>) {\n        return new SparseArray2D<T>(nullToUndefined<T>(data) as SparseArray2D<T>[\"root\"]);\n    }\n}\n"]}

package/lib/handlecache.js.map

@@ -1 +1 @@
-{"version":3,"file":"handlecache.js","sourceRoot":"","sources":["../src/handlecache.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAEtD,OAAO,EAAU,aAAa,EAAE,MAAM,eAAe,CAAC;AAEtD,OAAO,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAEtC;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IAIpB,YAA4B,MAAyB;QAAzB,WAAM,GAAN,MAAM,CAAmB;QAH7C,YAAO,GAAa,EAAE,CAAC;QACvB,UAAK,GAAG,CAAC,CAAC;IAEuC,CAAC;IAE1D;;;OAGG;IACK,QAAQ,CAAC,QAAgB;QAC7B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACI,SAAS,CAAC,QAAgB;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAEtC,uFAAuF;QACvF,8BAA8B;QAE9B,oFAAoF;QACpF,qFAAqF;QACrF,uEAAuE;QAEvE,OAAO,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,8EAA8E;IACvE,SAAS,CAAC,QAAgB,EAAE,MAAc;QAC7C,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAE3E,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,MAAM,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EACtC,KAAK,CAAC,wEAAwE,CAAC,CAAC;YACpF,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;SAChC;IACL,CAAC;IAED,0EAA0E;IAClE,UAAU,CAAC,KAAa,EAAE,GAAW;QACzC,sFAAsF;QACtF,gBAAgB;QAEhB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAExB,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE;YACpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,MAAM,GAAG,OAA6B,CAAC;YAC7C,oEAAoE;YACpE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,MAAO,CAAC,CAAC;SACxC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAEO,SAAS,CAAC,QAAgB;QAC9B,mFAAmF;QACnF,yDAAyD;QACzD,MAAM,SAAS,GAAG,QAAQ,KAAK,CAAC,CAAC;QAEjC,8EAA8E;QAC9E,kBAAkB;QAElB,6EAA6E;QAC7E,+EAA+E;QAC/E,2BAA2B;QAE3B,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE;YACxB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3E,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC1B;aAAM;YACH,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAEhD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACrG,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAChD;IACL,CAAC;IAED,0BAA0B;IAE1B,YAAY,CAAC,KAAa,EAAE,YAAoB,EAAE,aAAqB;QACnE,8EAA8E;QAC9E,6EAA6E;QAC7E,aAAa;QACb,EAAE;QACF,4EAA4E;QAC5E,wBAAwB;QACxB,EAAE;QACF,6FAA6F;QAC7F,2EAA2E;QAC3E,EAAE;QACF,gFAAgF;QAEhF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,GAAI,KAAK,CAAC;SAChC;IACL,CAAC;CAGJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { IVectorConsumer } from \"@tiny-calc/nano\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { ensureRange } from \"./range\";\n\n/**\n * Used by PermutationVector to cache position -> handle lookups.\n *\n * Perf: Possibly, this should eventually be inlined into PermutationVector itself, but\n *       so far there's no measurable perf penalty for being a separate object (node 12 x64)\n */\nexport class HandleCache implements IVectorConsumer<Handle> {\n    private handles: Handle[] = [];\n    private start = 0;\n\n    constructor(public readonly vector: PermutationVector) { }\n\n    /**\n     * Returns the index of the given position in the 'handles' array as a Uint32.\n     * (If the position is not in the array, returns an integer greater than 'handles.length').\n     */\n    private getIndex(position: number) {\n        return (position - this.start) >>> 0;\n    }\n\n    /**\n     * Returns the handle currently assigned to the given 'position' (if any).  Check\n     * the result with 'isValidHandle(..)' to see if a handle has been allocated for\n     * the given position.\n     *\n     * Throws a 'RangeError' if the provided 'position' is out-of-bounds wrt. the\n     * PermutationVector's length.\n     */\n    public getHandle(position: number) {\n        const index = this.getIndex(position);\n\n        // Perf: To encourage inlining, handling of the 'cacheMiss(..)' case has been extracted\n        //       to a separate method.\n\n        // Perf: A cache hit implies that 'position' was in bounds.  Therefore, we can defer\n        //       checking that 'position' is in bounds until 'cacheMiss(..)'.  This yields an\n        //       ~40% speedup when the position is in the cache (node v12 x64).\n\n        return index < this.handles.length\n            ? this.handles[index]\n            : this.cacheMiss(position);\n    }\n\n    /** Update the cache when a handle has been allocated for a given position. */\n    public addHandle(position: number, handle: Handle) {\n        assert(isHandleValid(handle), 0x017 /* \"Trying to add invalid handle!\" */);\n\n        const index = this.getIndex(position);\n        if (index < this.handles.length) {\n            assert(!isHandleValid(this.handles[index]),\n                0x018 /* \"Trying to insert handle into position with already valid handle!\" */);\n            this.handles[index] = handle;\n        }\n    }\n\n    /** Used by 'CacheMiss()' to retrieve handles for a range of positions. */\n    private getHandles(start: number, end: number) {\n        // TODO: This can be accelerated substantially using 'walkSegments()'.  The only catch\n        //       is that\n\n        const handles: Handle[] = [];\n        const { vector } = this;\n\n        for (let pos = start; pos < end; pos++) {\n            const { segment, offset } = vector.getContainingSegment(pos);\n            const asPerm = segment as PermutationSegment;\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            handles.push(asPerm.start + offset!);\n        }\n\n        return handles;\n    }\n\n    private cacheMiss(position: number) {\n        // Coercing 'position' to an Uint32 allows us to handle a negative 'position' value\n        // with the same logic that handles 'position' >= length.\n        const _position = position >>> 0;\n\n        // TODO: To bound memory usage, there should be a limit on the maximum size of\n        //       handle[].\n\n        // TODO: To reduce MergeTree lookups, this code should opportunistically grow\n        //       the cache to the next MergeTree segment boundary (within the limits of\n        //       the handle cache).\n\n        if (_position < this.start) {\n            this.handles = this.getHandles(_position, this.start).concat(this.handles);\n            this.start = _position;\n            return this.handles[0];\n        } else {\n            ensureRange(_position, this.vector.getLength());\n\n            this.handles = this.handles.concat(this.getHandles(this.start + this.handles.length, _position + 1));\n            return this.handles[this.handles.length - 1];\n        }\n    }\n\n    // #region IVectorConsumer\n\n    itemsChanged(start: number, removedCount: number, insertedCount: number): void {\n        // If positions were inserted/removed, our current policy is to trim the array\n        // at the beginning of the invalidate range and lazily repopulate the handles\n        // on demand.\n        //\n        // Some alternatives to consider that preserve the previously cached handles\n        // that are still valid:\n        //\n        //      * Eagerly populate the 'handles[]' with the newly insert values (currently guaranteed\n        //        to be Handle.unallocated, so we don't even need to look them up.)\n        //\n        //      * Use a sentinel value or other mechanism to allow \"holes\" in the cache.\n\n        const index = this.getIndex(start);\n        if (index < this.handles.length) {\n            this.handles.length =  index;\n        }\n    }\n\n    // #endregion IVectorConsumer\n}\n"]}
+{"version":3,"file":"handlecache.js","sourceRoot":"","sources":["../src/handlecache.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAEtD,OAAO,EAAU,aAAa,EAAE,MAAM,eAAe,CAAC;AAEtD,OAAO,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAEtC;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IAIpB,YAA4B,MAAyB;QAAzB,WAAM,GAAN,MAAM,CAAmB;QAH7C,YAAO,GAAa,EAAE,CAAC;QACvB,UAAK,GAAG,CAAC,CAAC;IAEuC,CAAC;IAE1D;;;OAGG;IACK,QAAQ,CAAC,QAAgB;QAC7B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACI,SAAS,CAAC,QAAgB;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAEtC,uFAAuF;QACvF,8BAA8B;QAE9B,oFAAoF;QACpF,qFAAqF;QACrF,uEAAuE;QAEvE,OAAO,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,8EAA8E;IACvE,SAAS,CAAC,QAAgB,EAAE,MAAc;QAC7C,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAE3E,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,MAAM,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EACtC,KAAK,CAAC,wEAAwE,CAAC,CAAC;YACpF,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;SAChC;IACL,CAAC;IAED,0EAA0E;IAClE,UAAU,CAAC,KAAa,EAAE,GAAW;QACzC,sFAAsF;QACtF,gBAAgB;QAEhB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAExB,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE;YACpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,MAAM,GAAG,OAA6B,CAAC;YAC7C,oEAAoE;YACpE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,MAAO,CAAC,CAAC;SACxC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAEO,SAAS,CAAC,QAAgB;QAC9B,mFAAmF;QACnF,yDAAyD;QACzD,MAAM,SAAS,GAAG,QAAQ,KAAK,CAAC,CAAC;QAEjC,8EAA8E;QAC9E,kBAAkB;QAElB,6EAA6E;QAC7E,+EAA+E;QAC/E,2BAA2B;QAE3B,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE;YACxB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3E,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC1B;aAAM;YACH,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAEhD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACrG,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAChD;IACL,CAAC;IAED,0BAA0B;IAE1B,YAAY,CAAC,KAAa,EAAE,YAAoB,EAAE,aAAqB;QACnE,8EAA8E;QAC9E,6EAA6E;QAC7E,aAAa;QACb,EAAE;QACF,4EAA4E;QAC5E,wBAAwB;QACxB,EAAE;QACF,6FAA6F;QAC7F,2EAA2E;QAC3E,EAAE;QACF,gFAAgF;QAEhF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC;SAC/B;IACL,CAAC;CAGJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { IVectorConsumer } from \"@tiny-calc/nano\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { ensureRange } from \"./range\";\n\n/**\n * Used by PermutationVector to cache position -> handle lookups.\n *\n * Perf: Possibly, this should eventually be inlined into PermutationVector itself, but\n *       so far there's no measurable perf penalty for being a separate object (node 12 x64)\n */\nexport class HandleCache implements IVectorConsumer<Handle> {\n    private handles: Handle[] = [];\n    private start = 0;\n\n    constructor(public readonly vector: PermutationVector) { }\n\n    /**\n     * Returns the index of the given position in the 'handles' array as a Uint32.\n     * (If the position is not in the array, returns an integer greater than 'handles.length').\n     */\n    private getIndex(position: number) {\n        return (position - this.start) >>> 0;\n    }\n\n    /**\n     * Returns the handle currently assigned to the given 'position' (if any).  Check\n     * the result with 'isValidHandle(..)' to see if a handle has been allocated for\n     * the given position.\n     *\n     * Throws a 'RangeError' if the provided 'position' is out-of-bounds wrt. the\n     * PermutationVector's length.\n     */\n    public getHandle(position: number) {\n        const index = this.getIndex(position);\n\n        // Perf: To encourage inlining, handling of the 'cacheMiss(..)' case has been extracted\n        //       to a separate method.\n\n        // Perf: A cache hit implies that 'position' was in bounds.  Therefore, we can defer\n        //       checking that 'position' is in bounds until 'cacheMiss(..)'.  This yields an\n        //       ~40% speedup when the position is in the cache (node v12 x64).\n\n        return index < this.handles.length\n            ? this.handles[index]\n            : this.cacheMiss(position);\n    }\n\n    /** Update the cache when a handle has been allocated for a given position. */\n    public addHandle(position: number, handle: Handle) {\n        assert(isHandleValid(handle), 0x017 /* \"Trying to add invalid handle!\" */);\n\n        const index = this.getIndex(position);\n        if (index < this.handles.length) {\n            assert(!isHandleValid(this.handles[index]),\n                0x018 /* \"Trying to insert handle into position with already valid handle!\" */);\n            this.handles[index] = handle;\n        }\n    }\n\n    /** Used by 'CacheMiss()' to retrieve handles for a range of positions. */\n    private getHandles(start: number, end: number) {\n        // TODO: This can be accelerated substantially using 'walkSegments()'.  The only catch\n        //       is that\n\n        const handles: Handle[] = [];\n        const { vector } = this;\n\n        for (let pos = start; pos < end; pos++) {\n            const { segment, offset } = vector.getContainingSegment(pos);\n            const asPerm = segment as PermutationSegment;\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            handles.push(asPerm.start + offset!);\n        }\n\n        return handles;\n    }\n\n    private cacheMiss(position: number) {\n        // Coercing 'position' to an Uint32 allows us to handle a negative 'position' value\n        // with the same logic that handles 'position' >= length.\n        const _position = position >>> 0;\n\n        // TODO: To bound memory usage, there should be a limit on the maximum size of\n        //       handle[].\n\n        // TODO: To reduce MergeTree lookups, this code should opportunistically grow\n        //       the cache to the next MergeTree segment boundary (within the limits of\n        //       the handle cache).\n\n        if (_position < this.start) {\n            this.handles = this.getHandles(_position, this.start).concat(this.handles);\n            this.start = _position;\n            return this.handles[0];\n        } else {\n            ensureRange(_position, this.vector.getLength());\n\n            this.handles = this.handles.concat(this.getHandles(this.start + this.handles.length, _position + 1));\n            return this.handles[this.handles.length - 1];\n        }\n    }\n\n    // #region IVectorConsumer\n\n    itemsChanged(start: number, removedCount: number, insertedCount: number): void {\n        // If positions were inserted/removed, our current policy is to trim the array\n        // at the beginning of the invalidate range and lazily repopulate the handles\n        // on demand.\n        //\n        // Some alternatives to consider that preserve the previously cached handles\n        // that are still valid:\n        //\n        //      * Eagerly populate the 'handles[]' with the newly insert values (currently guaranteed\n        //        to be Handle.unallocated, so we don't even need to look them up.)\n        //\n        //      * Use a sentinel value or other mechanism to allow \"holes\" in the cache.\n\n        const index = this.getIndex(start);\n        if (index < this.handles.length) {\n            this.handles.length = index;\n        }\n    }\n\n    // #endregion IVectorConsumer\n}\n"]}

package/lib/matrix.d.ts

@@ -89,7 +89,6 @@ export declare class SharedMatrix<T = any> extends SharedObject implements IMatr
      */
     protected loadCore(storage: IChannelStorageService): Promise<void>;
     protected processCore(rawMessage: ISequencedDocumentMessage, local: boolean, localOpMetadata: unknown): void;
-    protected registerCore(): void;
     private readonly onRowDelta;
     private readonly onColDelta;
     private readonly onRowHandlesRecycled;

package/lib/matrix.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,sCAAsC,CAAC;AACjF,OAAO,EACH,sBAAsB,EACtB,sBAAsB,EACtB,YAAY,EACZ,kBAAkB,EACrB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACH,gBAAgB,EAGhB,YAAY,EACZ,iBAAiB,EACpB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAE5E,OAAO,EACH,eAAe,EACf,eAAe,EACf,aAAa,EACb,aAAa,EAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAkD,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAItG,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAIhD,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAsBxC;;;GAGG;AACH,oBAAY,UAAU,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;AAEvE;;;;;;;;;;;GAWG;AACH,qBAAa,YAAY,CAAC,CAAC,GAAG,GAAG,CAC7B,SAAQ,YACR,YAAW,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC5B,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAYwB,EAAE,EAAE,MAAM;IAV9D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6C;WAEzD,UAAU;IAExB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IACzC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IAEzC,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,OAAO,CAA+B;gBAElC,OAAO,EAAE,sBAAsB,EAAS,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB;IAkB9F,OAAO,CAAC,IAAI,CAAC,CAAwB;IAErC;;OAEG;IACI,QAAQ,CAAC,QAAQ,EAAE,aAAa;IASvC,OAAO,KAAK,UAAU,GAAoC;IAC1D,OAAO,KAAK,UAAU,GAAoC;IAE1D;;OAEG;WACW,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,EAAE,EAAE,CAAC,EAAE,MAAM;IAMpE,UAAU,CACN,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAK/B,WAAW,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IAQ3D,IAAW,QAAQ,WAAoC;IACvD,IAAW,QAAQ,WAAoC;IAEhD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IAqBvD,IAAW,cAAc,IAAI,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAiB;IAIrE,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IAatD,QAAQ,CACX,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;IA6BtC,OAAO,CAAC,WAAW;IA4BnB,OAAO,CAAC,aAAa;IA2BrB,OAAO,CAAC,mBAAmB;IAkC3B,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA4CzD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA4CzD,SAAS,CAAC,aAAa,CAAC,UAAU,EAAE,gBAAgB,GAAG,qBAAqB;IAY5E;;;OAGG;IACH,SAAS,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB;IAQzD;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IAUpB,SAAS,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,EAAE,GAAG;IAchE,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,EAAE,OAAO;IAyC7D,SAAS,CAAC,YAAY;IAEtB;;OAEG;cACa,QAAQ,CAAC,OAAO,EAAE,sBAAsB;IAmBxD,SAAS,CAAC,WAAW,CAAC,UAAU,EAAE,yBAAyB,EAAE,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO;IA4DrG,SAAS,CAAC,YAAY;IAMtB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAGF,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF;;;;;;;OAOG;IACH,OAAO,CAAC,oBAAoB;IAgBrB,QAAQ;IAkBf,SAAS,CAAC,cAAc;CAG3B"}
+{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,sCAAsC,CAAC;AACjF,OAAO,EACH,sBAAsB,EACtB,sBAAsB,EACtB,YAAY,EACZ,kBAAkB,EACrB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACH,gBAAgB,EAGhB,YAAY,EACZ,iBAAiB,EACpB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAE5E,OAAO,EACH,eAAe,EACf,eAAe,EACf,aAAa,EACb,aAAa,EAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAkD,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAItG,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAIhD,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAsBxC;;;GAGG;AACH,oBAAY,UAAU,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;AAEvE;;;;;;;;;;;GAWG;AACH,qBAAa,YAAY,CAAC,CAAC,GAAG,GAAG,CAC7B,SAAQ,YACR,YAAW,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC5B,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAYwB,EAAE,EAAE,MAAM;IAV9D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6C;WAEzD,UAAU;IAExB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IACzC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IAEzC,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,OAAO,CAA+B;gBAElC,OAAO,EAAE,sBAAsB,EAAS,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB;IAkB9F,OAAO,CAAC,IAAI,CAAC,CAAwB;IAErC;;OAEG;IACI,QAAQ,CAAC,QAAQ,EAAE,aAAa;IASvC,OAAO,KAAK,UAAU,GAAoC;IAC1D,OAAO,KAAK,UAAU,GAAoC;IAE1D;;OAEG;WACW,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,EAAE,EAAE,CAAC,EAAE,MAAM;IAMpE,UAAU,CACN,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GACzC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAK/B,WAAW,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;IAQ3D,IAAW,QAAQ,WAAoC;IACvD,IAAW,QAAQ,WAAoC;IAEhD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IAqBvD,IAAW,cAAc,IAAI,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAiB;IAIrE,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IAatD,QAAQ,CACX,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;IA6BtC,OAAO,CAAC,WAAW;IA0BnB,OAAO,CAAC,aAAa;IA2BrB,OAAO,CAAC,mBAAmB;IAkC3B,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,OAAO,CAAC,gBAAgB;IAIjB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI1C,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIjD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA2CzD,gBAAgB,CAAQ,eAAe,CAAC,OAAO,EAAE,QAAQ;IA2CzD,SAAS,CAAC,aAAa,CAAC,UAAU,EAAE,gBAAgB,GAAG,qBAAqB;IAY5E;;;OAGG;IACH,SAAS,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB;IAQzD;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IAUpB,SAAS,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,EAAE,GAAG;IAchE,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,SAAS;IASnB,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,EAAE,OAAO;IAyC7D,SAAS,CAAC,YAAY;IAEtB;;OAEG;cACa,QAAQ,CAAC,OAAO,EAAE,sBAAsB;IAmBxD,SAAS,CAAC,WAAW,CAAC,UAAU,EAAE,yBAAyB,EAAE,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO;IA6DrG,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAGF,OAAO,CAAC,QAAQ,CAAC,UAAU,CAIzB;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAKnC;IAEF;;;;;;;OAOG;IACH,OAAO,CAAC,oBAAoB;IAgBrB,QAAQ;IAkBf,SAAS,CAAC,cAAc;CAG3B"}

package/lib/matrix.js

@@ -142,7 +142,6 @@ export class SharedMatrix extends SharedObject {
     setCellCore(row, col, value, rowHandle = this.rows.getAllocatedHandle(row), colHandle = this.cols.getAllocatedHandle(col)) {
         if (this.undo !== undefined) {
             let oldValue = this.cells.getCell(rowHandle, colHandle);
-            // eslint-disable-next-line no-null/no-null
             if (oldValue === null) {
                 oldValue = undefined;
             }
@@ -228,7 +227,6 @@ export class SharedMatrix extends SharedObject {
             for (let col = 0; col < this.colCount; col++) {
                 const colHandle = this.colHandles.getHandle(col);
                 const value = this.cells.getCell(rowHandle, colHandle);
-                // eslint-disable-next-line no-null/no-null
                 if (this.isAttached() && value !== undefined && value !== null) {
                     this.sendSetCellOp(row, col, value, rowHandle, colHandle);
                 }
@@ -260,7 +258,6 @@ export class SharedMatrix extends SharedObject {
             for (let row = 0; row < this.rowCount; row++) {
                 const rowHandle = this.rowHandles.getHandle(row);
                 const value = this.cells.getCell(rowHandle, colHandle);
-                // eslint-disable-next-line no-null/no-null
                 if (this.isAttached() && value !== undefined && value !== null) {
                     this.sendSetCellOp(row, col, value, rowHandle, colHandle);
                 }
@@ -419,10 +416,6 @@ export class SharedMatrix extends SharedObject {
             }
         }
     }
-    registerCore() {
-        this.rows.startOrUpdateCollaboration(this.runtime.clientId, 0);
-        this.cols.startOrUpdateCollaboration(this.runtime.clientId, 0);
-    }
     /**
      * Returns true if the latest pending write to the cell indicated by the given row/col handles
      * matches the given 'localSeq'.

package/lib/matrix.js.map

@@ -1 +1 @@
-{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAQtD,OAAO,EAEH,uBAAuB,EACvB,YAAY,EACZ,YAAY,GAEf,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAQ3F,OAAO,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AACjC,OAAO,EAAE,iBAAiB,EAAsB,MAAM,qBAAqB,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAChD,OAAO,EAAU,aAAa,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAEtC,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AA2BpD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,YACT,SAAQ,YAAY;IAepB,YAAY,OAA+B,EAAS,EAAU,EAAE,UAA8B;QAC1F,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QADiB,OAAE,GAAF,EAAE,CAAQ;QAV7C,cAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;QAO/D,UAAK,GAAG,IAAI,aAAa,EAAiB,CAAC,CAAK,sBAAsB;QACtE,YAAO,GAAG,IAAI,aAAa,EAAU,CAAC,CAAU,yBAAyB;QA0hBjF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QA/iBE,IAAI,CAAC,IAAI,GAAG,IAAI,iBAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,GAAG,IAAI,iBAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACnC,CAAC;IAxBM,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,mBAAmB,EAAE,CAAC,CAAC,CAAC;IA4BhE;;OAEG;IACI,QAAQ,CAAC,QAAuB;QACnC,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAC1B,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,IAAI,CAAC,IAAI,GAAG,IAAI,kBAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,qBAAqB;IAErB,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,MAAM,CAAI,OAA+B,EAAE,EAAW;QAChE,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,mBAAmB,CAAC,IAAI,CAAoB,CAAC;IAClF,CAAC;IAED,0BAA0B;IAE1B,UAAU,CACN,QAAwC;QAExC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,WAAW,CAAC,QAAwC;QAChD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED,6BAA6B;IAE7B,wBAAwB;IAExB,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACvD,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAEhD,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,kFAAkF;QAClF,iFAAiF;QACjF,6EAA6E;QAE7E,4DAA4D;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,aAAa,CAAC,SAAS,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,aAAa,CAAC,SAAS,CAAC,EAAE;gBAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;aACnD;SACJ;aAAM;YACH,gFAAgF;YAChF,oCAAoC;YACpC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;SAC3C;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAW,cAAc,KAAqC,OAAO,IAAI,CAAC,CAAC,CAAC;IAE5E,2BAA2B;IAEpB,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ;eAC/B,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,EAClC,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAErD,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAElC,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;SAC/C;IACL,CAAC;IAEM,QAAQ,CACX,QAAgB,EAChB,QAAgB,EAChB,QAAgB,EAChB,MAAkC;QAElC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QAErD,MAAM,CAAC,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;eACzD,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAC3C,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAE/D,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,IAAI,CAAC,GAAG,QAAQ,CAAC;QACjB,IAAI,CAAC,GAAG,QAAQ,CAAC;QAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAE9B,IAAI,EAAE,CAAC,KAAK,MAAM,EAAE;gBAChB,CAAC,GAAG,QAAQ,CAAC;gBACb,CAAC,EAAE,CAAC;aACP;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACvE;IACL,CAAC;IAEO,WAAW,CACf,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAC7C,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC;QAE7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAExD,2CAA2C;YAC3C,IAAI,QAAQ,KAAK,IAAI,EAAE;gBACnB,QAAQ,GAAG,SAAS,CAAC;aACxB;YAED,IAAI,CAAC,IAAI,CAAC,OAAO,CACb,SAAS,EACT,SAAS,EACT,QAAQ,CAAC,CAAC;SACjB;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAEhD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;SAC7D;IACL,CAAC;IAEO,aAAa,CACjB,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAiB,EACjB,SAAiB,EACjB,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE;QAE9B,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,KAAK,CAAC,yEAAyE,CAAC,CAAC;QAE3G,MAAM,EAAE,GAAc;YAClB,IAAI,EAAE,QAAQ,CAAC,GAAG;YAClB,GAAG;YACH,GAAG;YACH,KAAK;SACR,CAAC;QAEF,MAAM,QAAQ,GAAmB;YAC7B,SAAS;YACT,SAAS;YACT,QAAQ;SACX,CAAC;QAEF,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IAEO,mBAAmB,CACvB,aAAgC,EAChC,cAAiC,EACjC,SAAgD,EAChD,OAAY;QAEZ,oGAAoG;QACpG,wGAAwG;QACxG,mEAAmE;QACnE,MAAM,QAAQ,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;QAC1D,MAAM,cAAc,GAAG,cAAc,CAAC,eAAe,EAAE,CAAC;QAExD,4GAA4G;QAC5G,6DAA6D;QAC7D,MAAM,CAAC,QAAQ,IAAI,cAAc,CAAC,QAAQ,EACtC,KAAK,CAAC,iGAAiG,CAAC,CAAC;QAE7G,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEnC,sGAAsG;QACtG,sFAAsF;QACtF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,oFAAoF;YACpF,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;YAE3B,IAAI,CAAC,kBAAkB,CACnB,OAAO,EACP,aAAa,CAAC,wBAAwB,CAClC,OAAO,CAAC,IAAI,kBAA6B;gBACrC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM;gBACpB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACrB;IACL,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,kEAAkE;QAClE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,2CAA2C;gBAC3C,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,qEAAqE;QACrE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,2CAA2C;gBAC3C,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAES,aAAa,CAAC,UAA4B;QAChD,MAAM,OAAO,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACzC,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,OAAO,sBACX,UAAU,CAAC,SAAS,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACrB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;SAC1B,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACrB,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACO,iBAAiB,CAAC,UAA6B;QACrD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;YAC1C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;aAC7D;SACJ;IACL,CAAC;IAED;;;;;OAKG;IACK,YAAY;QAChB,oGAAoG;QACpG,qGAAqG;QACrG,mGAAmG;QACnG,+BAA+B;QAE/B,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAAE,CAAC;QACvC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;IAClD,CAAC;IAES,kBAAkB,CAAC,OAAY,EAAE,eAAqB;QAC5D,0DAA0D;QAC1D,sEAAsE;QACtE,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAEtG,KAAK,CAAC,kBAAkB,CAAC,uBAAuB,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC;QAE1G,0EAA0E;QAC1E,MAAM,CACF,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAC7E,KAAK,CAAC,4DAA4D,CACrE,CAAC;IACN,CAAC;IAES,SAAS;;QACf,8DAA8D;QAC9D,qFAAqF;QACrF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;YAC1E,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;SAC7E;IACL,CAAC;IAES,SAAS;QACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,EAC1F,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,6FAA6F;QAC7F,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;IAC1E,CAAC;IAES,YAAY,CAAC,OAAY,EAAE,eAAwB;QACzD,QAAQ,OAAO,CAAC,MAAM,EAAE;YACpB;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAErF,MAAM,KAAK,GAAG,OAAkC,CAAC;gBACjD,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;gBAE7E,qFAAqF;gBACrF,yFAAyF;gBACzF,qFAAqF;gBACrF,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;oBAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAE5D,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;wBACtB,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,CAAC,KAAK,EACX,SAAS,EACT,SAAS,EACT,QAAQ,CACX,CAAC;qBACL;iBACJ;gBACD,MAAM;aACT;SACJ;IACL,CAAC;IAES,YAAY,KAAI,CAAC;IAE3B;;OAEG;IACO,KAAK,CAAC,QAAQ,CAAC,OAA+B;QACpD,IAAI;YACA,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sBAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sBAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,CAAC,QAAQ,EAAE,iBAAiB,CAAC,GAAG,MAAM,eAAe,CAAC,OAAO,uBAAsB,IAAI,CAAC,UAAU,CAAC,CAAC;YAE1G,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;SACxD;QAAC,OAAO,KAAK,EAAE;YACZ,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;SACxE;IACL,CAAC;IAES,WAAW,CAAC,UAAqC,EAAE,KAAc,EAAE,eAAwB;QACjG,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;QAE9B,QAAQ,QAAQ,CAAC,MAAM,EAAE;YACrB;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,GAAG,EACjC,KAAK,CAAC,2DAA2D,CAAC,CAAC;gBAEvE,MAAM,EAAE,uBAAuB,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC;gBACjE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC;gBAE9B,IAAI,KAAK,EAAE;oBACP,8DAA8D;oBAC9D,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;oBAE7E,+EAA+E;oBAC/E,gEAAgE;oBAChE,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;wBAC3D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;qBACzD;iBACJ;qBAAM;oBACH,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;oBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;wBAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;wBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;wBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;4BAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAE5D,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,SAAS,CAAC,EACvD,KAAK,CAAC,wDAAwD,CAAC,CAAC;4BAEpE,oFAAoF;4BACpF,gDAAgD;4BAChD,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,SAAS,EAAE;gCAC1D,MAAM,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC;gCAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gCAEhD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;oCAC5C,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;iCAC/D;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ;IACL,CAAC;IAES,YAAY;QAClB,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IA8BD;;;;;;;OAOG;IACK,oBAAoB,CAAC,SAAiB,EAAE,SAAiB,EAAE,QAAgB;QAC/E,oEAAoE;QACpE,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAE,CAAC;QAEpE,yFAAyF;QACzF,+FAA+F;QAC/F,kCAAkC;QAClC,MAAM,CAAC,CAAC,CAAC,eAAe,GAAG,QAAQ,CAAC;QAChC,mCAAmC;QACnC,KAAK,CAAC,uGAAuG,CAAC,CAAC;QAEnH,wFAAwF;QACxF,mDAAmD;QACnD,OAAO,eAAe,KAAK,QAAQ,CAAC;IACxC,CAAC;IAEM,QAAQ;QACX,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,OAAO,CAAC,QAAQ,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC;QAE5G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;YACpC,CAAC,IAAI,KAAK,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,CAAC,GAAG,CAAC,EAAE;oBACP,CAAC,IAAI,IAAI,CAAC;iBACb;gBAED,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;aACxE;YACD,CAAC,IAAI,KAAK,CAAC;SACd;QAED,OAAO,GAAG,CAAC,IAAI,CAAC;IACpB,CAAC;IAES,cAAc;QACpB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACvC,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport {\n    IFluidDataStoreRuntime,\n    IChannelStorageService,\n    Serializable,\n    IChannelAttributes,\n} from \"@fluidframework/datastore-definitions\";\nimport {\n    IFluidSerializer,\n    makeHandlesSerializable,\n    parseHandles,\n    SharedObject,\n    SummarySerializer,\n} from \"@fluidframework/shared-object-base\";\nimport { ISummaryTreeWithStats } from \"@fluidframework/runtime-definitions\";\nimport { ObjectStoragePartition, SummaryTreeBuilder } from \"@fluidframework/runtime-utils\";\nimport {\n    IMatrixProducer,\n    IMatrixConsumer,\n    IMatrixReader,\n    IMatrixWriter,\n} from \"@tiny-calc/nano\";\nimport { MergeTreeDeltaType, IMergeTreeOp, SegmentGroup, ISegment } from \"@fluidframework/merge-tree\";\nimport { MatrixOp } from \"./ops\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { SparseArray2D } from \"./sparsearray2d\";\nimport { SharedMatrixFactory } from \"./runtime\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { deserializeBlob } from \"./serialization\";\nimport { ensureRange } from \"./range\";\nimport { IUndoConsumer } from \"./types\";\nimport { MatrixUndoProvider } from \"./undoprovider\";\n\nconst enum SnapshotPath {\n    rows = \"rows\",\n    cols = \"cols\",\n    cells = \"cells\",\n}\n\ninterface ISetOp<T> {\n    type: MatrixOp.set,\n    row: number,\n    col: number,\n    value: MatrixItem<T>,\n}\n\ninterface ISetOpMetadata {\n    rowHandle: Handle,\n    colHandle: Handle,\n    localSeq: number,\n}\n\n/**\n * A matrix cell value may be undefined (indicating an empty cell) or any serializable type,\n * excluding null.  (However, nulls may be embedded inside objects and arrays.)\n */\nexport type MatrixItem<T> = Serializable<Exclude<T, null>> | undefined;\n\n/**\n * A SharedMatrix holds a rectangular 2D array of values.  Supported operations\n * include setting values and inserting/removing rows and columns.\n *\n * Matrix values may be any Fluid serializable type, which is the set of JSON\n * serializable types extended to include IFluidHandles.\n *\n * Fluid's SharedMatrix implementation works equally well for dense and sparse\n * matrix data and physically stores data in Z-order to leverage CPU caches and\n * prefetching when reading in either row or column major order.  (See README.md\n * for more details.)\n */\nexport class SharedMatrix<T = any>\n    extends SharedObject\n    implements IMatrixProducer<MatrixItem<T>>,\n    IMatrixReader<MatrixItem<T>>,\n    IMatrixWriter<MatrixItem<T>>\n{\n    private readonly consumers = new Set<IMatrixConsumer<MatrixItem<T>>>();\n\n    public static getFactory() { return new SharedMatrixFactory(); }\n\n    private readonly rows: PermutationVector;   // Map logical row to storage handle (if any)\n    private readonly cols: PermutationVector;   // Map logical col to storage handle (if any)\n\n    private cells = new SparseArray2D<MatrixItem<T>>();     // Stores cell values.\n    private pending = new SparseArray2D<number>();          // Tracks pending writes.\n\n    constructor(runtime: IFluidDataStoreRuntime, public id: string, attributes: IChannelAttributes) {\n        super(id, runtime, attributes);\n\n        this.rows = new PermutationVector(\n            SnapshotPath.rows,\n            this.logger,\n            runtime,\n            this.onRowDelta,\n            this.onRowHandlesRecycled);\n\n        this.cols = new PermutationVector(\n            SnapshotPath.cols,\n            this.logger,\n            runtime,\n            this.onColDelta,\n            this.onColHandlesRecycled);\n    }\n\n    private undo?: MatrixUndoProvider<T>;\n\n    /**\n     * Subscribes the given IUndoConsumer to the matrix.\n     */\n    public openUndo(consumer: IUndoConsumer) {\n        assert(this.undo === undefined,\n            0x019 /* \"SharedMatrix.openUndo() supports at most a single IUndoConsumer.\" */);\n\n        this.undo = new MatrixUndoProvider(consumer, this, this.rows, this.cols);\n    }\n\n    // TODO: closeUndo()?\n\n    private get rowHandles() { return this.rows.handleCache; }\n    private get colHandles() { return this.cols.handleCache; }\n\n    /**\n     * {@inheritDoc @fluidframework/datastore-definitions#IChannelFactory.create}\n     */\n    public static create<T>(runtime: IFluidDataStoreRuntime, id?: string) {\n        return runtime.createChannel(id, SharedMatrixFactory.Type) as SharedMatrix<T>;\n    }\n\n    // #region IMatrixProducer\n\n    openMatrix(\n        consumer: IMatrixConsumer<MatrixItem<T>>,\n    ): IMatrixReader<MatrixItem<T>> {\n        this.consumers.add(consumer);\n        return this;\n    }\n\n    closeMatrix(consumer: IMatrixConsumer<MatrixItem<T>>): void {\n        this.consumers.delete(consumer);\n    }\n\n    // #endregion IMatrixProducer\n\n    // #region IMatrixReader\n\n    public get rowCount() { return this.rows.getLength(); }\n    public get colCount() { return this.cols.getLength(); }\n\n    public getCell(row: number, col: number): MatrixItem<T> {\n        // Perf: When possible, bounds checking is performed inside the implementation for\n        //       'getHandle()' so that it can be elided in the case of a cache hit.  This\n        //       yields an ~40% improvement in the case of a cache hit (node v12 x64)\n\n        // Map the logical (row, col) to associated storage handles.\n        const rowHandle = this.rowHandles.getHandle(row);\n        if (isHandleValid(rowHandle)) {\n            const colHandle = this.colHandles.getHandle(col);\n            if (isHandleValid(colHandle)) {\n                return this.cells.getCell(rowHandle, colHandle);\n            }\n        } else {\n            // If we early exit because the given rowHandle is unallocated, we still need to\n            // bounds-check the 'col' parameter.\n            ensureRange(col, this.cols.getLength());\n        }\n\n        return undefined;\n    }\n\n    public get matrixProducer(): IMatrixProducer<MatrixItem<T>> { return this; }\n\n    // #endregion IMatrixReader\n\n    public setCell(row: number, col: number, value: MatrixItem<T>) {\n        assert(0 <= row && row < this.rowCount\n            && 0 <= col && col < this.colCount,\n            0x01a /* \"Trying to set out-of-bounds cell!\" */);\n\n        this.setCellCore(row, col, value);\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(row, col, 1, 1, this);\n        }\n    }\n\n    public setCells(\n        rowStart: number,\n        colStart: number,\n        colCount: number,\n        values: readonly (MatrixItem<T>)[],\n    ) {\n        const rowCount = Math.ceil(values.length / colCount);\n\n        assert((0 <= rowStart && rowStart < this.rowCount)\n            && (0 <= colStart && colStart < this.colCount)\n            && (1 <= colCount && colCount <= (this.colCount - colStart))\n            && (rowCount <= (this.rowCount - rowStart)),\n            0x01b /* \"Trying to set multiple out-of-bounds cells!\" */);\n\n        const endCol = colStart + colCount;\n        let r = rowStart;\n        let c = colStart;\n\n        for (const value of values) {\n            this.setCellCore(r, c, value);\n\n            if (++c === endCol) {\n                c = colStart;\n                r++;\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, colStart, rowCount, colCount, this);\n        }\n    }\n\n    private setCellCore(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle = this.rows.getAllocatedHandle(row),\n        colHandle = this.cols.getAllocatedHandle(col),\n    ) {\n        if (this.undo !== undefined) {\n            let oldValue = this.cells.getCell(rowHandle, colHandle);\n\n            // eslint-disable-next-line no-null/no-null\n            if (oldValue === null) {\n                oldValue = undefined;\n            }\n\n            this.undo.cellSet(\n                rowHandle,\n                colHandle,\n                oldValue);\n        }\n\n        this.cells.setCell(rowHandle, colHandle, value);\n\n        if (this.isAttached()) {\n            this.sendSetCellOp(row, col, value, rowHandle, colHandle);\n        }\n    }\n\n    private sendSetCellOp(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle: Handle,\n        colHandle: Handle,\n        localSeq = this.nextLocalSeq(),\n    ) {\n        assert(this.isAttached(), 0x1e2 /* \"Caller must ensure 'isAttached()' before calling 'sendSetCellOp'.\" */);\n\n        const op: ISetOp<T> = {\n            type: MatrixOp.set,\n            row,\n            col,\n            value,\n        };\n\n        const metadata: ISetOpMetadata = {\n            rowHandle,\n            colHandle,\n            localSeq,\n        };\n\n        this.submitLocalMessage(op, metadata);\n        this.pending.setCell(rowHandle, colHandle, localSeq);\n    }\n\n    private submitVectorMessage(\n        currentVector: PermutationVector,\n        oppositeVector: PermutationVector,\n        dimension: SnapshotPath.rows | SnapshotPath.cols,\n        message: any,\n    ) {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally advance each MergeTree's 'localSeq' counter\n        // for each submitted op it not aware of to keep them synchronized.\n        const localSeq = currentVector.getCollabWindow().localSeq;\n        const oppositeWindow = oppositeVector.getCollabWindow();\n\n        // Note that the comparison is '>=' because, in the case the MergeTree is regenerating ops for reconnection,\n        // the MergeTree submits the op with the original 'localSeq'.\n        assert(localSeq >= oppositeWindow.localSeq,\n            0x01c /* \"The 'localSeq' of the vector submitting an op must >= the 'localSeq' of the other vector.\" */);\n\n        oppositeWindow.localSeq = localSeq;\n\n        // If the SharedMatrix is local, it's state will be submitted via a Snapshot when initially connected.\n        // Do not queue a message or track the pending op, as there will never be an ACK, etc.\n        if (this.isAttached()) {\n            // Record whether this `op` targets rows or cols.  (See dispatch in `processCore()`)\n            message.target = dimension;\n\n            this.submitLocalMessage(\n                message,\n                currentVector.peekPendingSegmentGroups(\n                    message.type === MergeTreeDeltaType.GROUP\n                        ? message.ops.length\n                        : 1));\n        }\n    }\n\n    private submitColMessage(message: any) {\n        this.submitVectorMessage(this.cols, this.rows, SnapshotPath.cols, message);\n    }\n\n    public insertCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.insert(colStart, count));\n    }\n\n    public removeCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.remove(colStart, count));\n    }\n\n    private submitRowMessage(message: any) {\n        this.submitVectorMessage(this.rows, this.cols, SnapshotPath.rows, message);\n    }\n\n    public insertRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.insert(rowStart, count));\n    }\n\n    public removeRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.remove(rowStart, count));\n    }\n\n    /** @internal */ public _undoRemoveRows(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of rows at the original position.\n        const { op, inserted } = this.rows.insertRelative(original, original.cachedLength);\n        this.submitRowMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'rowsChanged'\n        // callback, which occurs before the handle span is populated.\n        const rowStart = this.rows.getPosition(inserted);\n        this.rows.handleCache.itemsChanged(\n            rowStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted rows.\n        let rowHandle = inserted.start;\n        const rowCount = inserted.cachedLength;\n        for (let row = rowStart; row < rowStart + rowCount; row++, rowHandle++) {\n            for (let col = 0; col < this.colCount; col++) {\n                const colHandle = this.colHandles.getHandle(col);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                // eslint-disable-next-line no-null/no-null\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, /* colStart: */ 0, rowCount, this.colCount, this);\n        }\n    }\n\n    /** @internal */ public _undoRemoveCols(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of columns at the original position.\n        const { op, inserted } = this.cols.insertRelative(original, original.cachedLength);\n        this.submitColMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'colsChanged'\n        // callback, which occurs before the handle span is populated.\n        const colStart = this.cols.getPosition(inserted);\n        this.cols.handleCache.itemsChanged(\n            colStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted cols.\n        let colHandle = inserted.start;\n        const colCount = inserted.cachedLength;\n        for (let col = colStart; col < colStart + colCount; col++, colHandle++) {\n            for (let row = 0; row < this.rowCount; row++) {\n                const rowHandle = this.rowHandles.getHandle(row);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                // eslint-disable-next-line no-null/no-null\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(/* rowStart: */ 0, colStart, this.rowCount, colCount, this);\n        }\n    }\n\n    protected summarizeCore(serializer: IFluidSerializer): ISummaryTreeWithStats {\n        const builder = new SummaryTreeBuilder();\n        builder.addWithStats(SnapshotPath.rows, this.rows.summarize(this.runtime, this.handle, serializer));\n        builder.addWithStats(SnapshotPath.cols, this.cols.summarize(this.runtime, this.handle, serializer));\n        builder.addBlob(SnapshotPath.cells,\n            serializer.stringify([\n                this.cells.snapshot(),\n                this.pending.snapshot(),\n            ], this.handle));\n        return builder.getSummaryTree();\n    }\n\n    /**\n     * Runs serializer on the GC data for this SharedMatrix.\n     * All the IFluidHandle's stored in the cells represent routes to other objects.\n     */\n    protected processGCDataCore(serializer: SummarySerializer) {\n        for (let row = 0; row < this.rowCount; row++) {\n            for (let col = 0; col < this.colCount; col++) {\n                serializer.stringify(this.getCell(row, col), this.handle);\n            }\n        }\n    }\n\n    /**\n     * Advances the 'localSeq' counter for the cell data operation currently being queued.\n     *\n     * Do not use with 'submitColMessage()/submitRowMessage()' as these helpers + the MergeTree will\n     * automatically advance 'localSeq'.\n     */\n    private nextLocalSeq() {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally bump each MergeTree's 'localSeq' counter\n        // for SharedMatrix ops it's not aware of to keep them synchronized.  (For cell data operations, we\n        // need to bump both counters.)\n\n        this.cols.getCollabWindow().localSeq++;\n        return ++this.rows.getCollabWindow().localSeq;\n    }\n\n    protected submitLocalMessage(message: any, localOpMetadata?: any) {\n        // TODO: Recommend moving this assertion into SharedObject\n        //       (See https://github.com/microsoft/FluidFramework/issues/2559)\n        assert(this.isAttached() === true, 0x01d /* \"Trying to submit message to runtime while detached!\" */);\n\n        super.submitLocalMessage(makeHandlesSerializable(message, this.serializer, this.handle), localOpMetadata);\n\n        // Ensure that row/col 'localSeq' are synchronized (see 'nextLocalSeq()').\n        assert(\n            this.rows.getCollabWindow().localSeq === this.cols.getCollabWindow().localSeq,\n            0x01e /* \"Row and col collab window 'localSeq' desynchronized!\" */,\n        );\n    }\n\n    protected didAttach() {\n        // We've attached we need to start generating and sending ops.\n        // so start collaboration and provide a default client id incase we are not connected\n        if (this.isAttached()) {\n            this.rows.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n            this.cols.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n        }\n    }\n\n    protected onConnect() {\n        assert(this.rows.getCollabWindow().collaborating === this.cols.getCollabWindow().collaborating,\n            0x01f /* \"Row and col collab window 'collaborating' status desynchronized!\" */);\n\n        // Update merge tree collaboration information with new client ID and then resend pending ops\n        this.rows.startOrUpdateCollaboration(this.runtime.clientId as string);\n        this.cols.startOrUpdateCollaboration(this.runtime.clientId as string);\n    }\n\n    protected reSubmitCore(content: any, localOpMetadata: unknown) {\n        switch (content.target) {\n            case SnapshotPath.cols:\n                this.submitColMessage(this.cols.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            case SnapshotPath.rows:\n                this.submitRowMessage(this.rows.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            default: {\n                assert(content.type === MatrixOp.set, 0x020 /* \"Unknown SharedMatrix 'op' type.\" */);\n\n                const setOp = content as ISetOp<Serializable<T>>;\n                const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                // If there are more pending local writes to the same row/col handle, it is important\n                // to skip resubmitting this op since it is possible the row/col handle has been recycled\n                // and now refers to a different position than when this op was originally submitted.\n                if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                    const row = this.rows.handleToPosition(rowHandle, localSeq);\n                    const col = this.cols.handleToPosition(colHandle, localSeq);\n\n                    if (row >= 0 && col >= 0) {\n                        this.sendSetCellOp(\n                            row,\n                            col,\n                            setOp.value,\n                            rowHandle,\n                            colHandle,\n                            localSeq,\n                        );\n                    }\n                }\n                break;\n            }\n        }\n    }\n\n    protected onDisconnect() {}\n\n    /**\n     * {@inheritDoc @fluidframework/shared-object-base#SharedObject.loadCore}\n     */\n    protected async loadCore(storage: IChannelStorageService) {\n        try {\n            await this.rows.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.rows),\n                this.serializer);\n            await this.cols.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.cols),\n                this.serializer);\n            const [cellData, pendingCliSeqData] = await deserializeBlob(storage, SnapshotPath.cells, this.serializer);\n\n            this.cells = SparseArray2D.load(cellData);\n            this.pending = SparseArray2D.load(pendingCliSeqData);\n        } catch (error) {\n            this.logger.sendErrorEvent({ eventName: \"MatrixLoadFailed\" }, error);\n        }\n    }\n\n    protected processCore(rawMessage: ISequencedDocumentMessage, local: boolean, localOpMetadata: unknown) {\n        const msg = parseHandles(rawMessage, this.serializer);\n\n        const contents = msg.contents;\n\n        switch (contents.target) {\n            case SnapshotPath.cols:\n                this.cols.applyMsg(msg);\n                break;\n            case SnapshotPath.rows:\n                this.rows.applyMsg(msg);\n                break;\n            default: {\n                assert(contents.type === MatrixOp.set,\n                    0x021 /* \"SharedMatrix message contents have unexpected type!\" */);\n\n                const { referenceSequenceNumber: refSeq, clientId } = rawMessage;\n                const { row, col } = contents;\n\n                if (local) {\n                    // We are receiving the ACK for a local pending set operation.\n                    const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                    // If this is the most recent write to the cell by the local client, remove our\n                    // entry from 'pendingCliSeqs' to resume allowing remote writes.\n                    if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                        this.pending.setCell(rowHandle, colHandle, undefined);\n                    }\n                } else {\n                    const rowClientId = this.rows.getOrAddShortClientId(clientId);\n                    const adjustedRow = this.rows.adjustPosition(row, refSeq, rowClientId);\n\n                    if (adjustedRow !== undefined) {\n                        const colClientId = this.cols.getOrAddShortClientId(clientId);\n                        const adjustedCol = this.cols.adjustPosition(col, refSeq, colClientId);\n\n                        if (adjustedCol !== undefined) {\n                            const rowHandle = this.rows.getAllocatedHandle(adjustedRow);\n                            const colHandle = this.cols.getAllocatedHandle(adjustedCol);\n\n                            assert(isHandleValid(rowHandle) && isHandleValid(colHandle),\n                                0x022 /* \"SharedMatrix row and/or col handles are invalid!\" */);\n\n                            // If there is a pending (unACKed) local write to the same cell, skip the current op\n                            // since it \"happened before\" the pending write.\n                            if (this.pending.getCell(rowHandle, colHandle) === undefined) {\n                                const { value } = contents;\n                                this.cells.setCell(rowHandle, colHandle, value);\n\n                                for (const consumer of this.consumers.values()) {\n                                    consumer.cellsChanged(adjustedRow, adjustedCol, 1, 1, this);\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n\n    protected registerCore() {\n        this.rows.startOrUpdateCollaboration(this.runtime.clientId, 0);\n        this.cols.startOrUpdateCollaboration(this.runtime.clientId, 0);\n    }\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of row insertion/deletions.\n    private readonly onRowDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.rowsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of col insertion/deletions.\n    private readonly onColDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.colsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    private readonly onRowHandlesRecycled = (rowHandles: Handle[]) => {\n        for (const rowHandle of rowHandles) {\n            this.cells.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n            this.pending.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n        }\n    };\n\n    private readonly onColHandlesRecycled = (colHandles: Handle[]) => {\n        for (const colHandle of colHandles) {\n            this.cells.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n            this.pending.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n        }\n    };\n\n    /**\n     * Returns true if the latest pending write to the cell indicated by the given row/col handles\n     * matches the given 'localSeq'.\n     *\n     * A return value of `true` indicates that there are no later local operations queued that will\n     * clobber the write op at the given 'localSeq'.  This includes later ops that overwrite the cell\n     * with a different value as well as row/col removals that might recycled the given row/col handles.\n     */\n    private isLatestPendingWrite(rowHandle: Handle, colHandle: Handle, localSeq: number) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const pendingLocalSeq = this.pending.getCell(rowHandle, colHandle)!;\n\n        // Note while we're awaiting the ACK for a local set, it's possible for the row/col to be\n        // locally removed and the row/col handles recycled.  If this happens, the pendingLocalSeq will\n        // be 'undefined' or > 'localSeq'.\n        assert(!(pendingLocalSeq < localSeq),\n            // eslint-disable-next-line max-len\n            0x023 /* \"The 'localSeq' of pending write (if any) must be <= the localSeq of the currently processed op.\" */);\n\n        // If this is the most recent write to the cell by the local client, the stored localSeq\n        // will be an exact match for the given 'localSeq'.\n        return pendingLocalSeq === localSeq;\n    }\n\n    public toString() {\n        let s = `client:${this.runtime.clientId}\\nrows: ${this.rows.toString()}\\ncols: ${this.cols.toString()}\\n\\n`;\n\n        for (let r = 0; r < this.rowCount; r++) {\n            s += `  [`;\n            for (let c = 0; c < this.colCount; c++) {\n                if (c > 0) {\n                    s += \", \";\n                }\n\n                s += `${this.serializer.stringify(this.getCell(r, c), this.handle)}`;\n            }\n            s += \"]\\n\";\n        }\n\n        return `${s}\\n`;\n    }\n\n    protected applyStashedOp() {\n        throw new Error(\"not implemented\");\n    }\n}\n"]}
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAQtD,OAAO,EAEH,uBAAuB,EACvB,YAAY,EACZ,YAAY,GAEf,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAQ3F,OAAO,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AACjC,OAAO,EAAE,iBAAiB,EAAsB,MAAM,qBAAqB,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAChD,OAAO,EAAU,aAAa,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAEtC,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AA2BpD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,YACT,SAAQ,YAAY;IAepB,YAAY,OAA+B,EAAS,EAAU,EAAE,UAA8B;QAC1F,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QADiB,OAAE,GAAF,EAAE,CAAQ;QAV7C,cAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;QAO/D,UAAK,GAAG,IAAI,aAAa,EAAiB,CAAC,CAAK,sBAAsB;QACtE,YAAO,GAAG,IAAI,aAAa,EAAU,CAAC,CAAU,yBAAyB;QAihBjF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEF,sFAAsF;QACrE,eAAU,GAAG,CAAC,QAAgB,EAAE,YAAoB,EAAE,aAAqB,EAAE,EAAE;YAC5F,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;gBACnC,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;aACrE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QAEe,yBAAoB,GAAG,CAAC,UAAoB,EAAE,EAAE;YAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;gBAChC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;aACxE;QACL,CAAC,CAAC;QAtiBE,IAAI,CAAC,IAAI,GAAG,IAAI,iBAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,GAAG,IAAI,iBAAiB,oBAE7B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACnC,CAAC;IAxBM,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,mBAAmB,EAAE,CAAC,CAAC,CAAC;IA4BhE;;OAEG;IACI,QAAQ,CAAC,QAAuB;QACnC,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAC1B,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,IAAI,CAAC,IAAI,GAAG,IAAI,kBAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,qBAAqB;IAErB,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,IAAY,UAAU,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,MAAM,CAAI,OAA+B,EAAE,EAAW;QAChE,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,mBAAmB,CAAC,IAAI,CAAoB,CAAC;IAClF,CAAC;IAED,0BAA0B;IAE1B,UAAU,CACN,QAAwC;QAExC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,WAAW,CAAC,QAAwC;QAChD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED,6BAA6B;IAE7B,wBAAwB;IAExB,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACvD,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAEhD,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,kFAAkF;QAClF,iFAAiF;QACjF,6EAA6E;QAE7E,4DAA4D;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,aAAa,CAAC,SAAS,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,aAAa,CAAC,SAAS,CAAC,EAAE;gBAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;aACnD;SACJ;aAAM;YACH,gFAAgF;YAChF,oCAAoC;YACpC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;SAC3C;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAW,cAAc,KAAqC,OAAO,IAAI,CAAC,CAAC,CAAC;IAE5E,2BAA2B;IAEpB,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ;eAC/B,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,EAClC,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAErD,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAElC,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;SAC/C;IACL,CAAC;IAEM,QAAQ,CACX,QAAgB,EAChB,QAAgB,EAChB,QAAgB,EAChB,MAAkC;QAElC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QAErD,MAAM,CAAC,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;eAC3C,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;eACzD,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAC3C,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAE/D,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,IAAI,CAAC,GAAG,QAAQ,CAAC;QACjB,IAAI,CAAC,GAAG,QAAQ,CAAC;QAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAE9B,IAAI,EAAE,CAAC,KAAK,MAAM,EAAE;gBAChB,CAAC,GAAG,QAAQ,CAAC;gBACb,CAAC,EAAE,CAAC;aACP;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACvE;IACL,CAAC;IAEO,WAAW,CACf,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAC7C,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC;QAE7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxD,IAAI,QAAQ,KAAK,IAAI,EAAE;gBACnB,QAAQ,GAAG,SAAS,CAAC;aACxB;YAED,IAAI,CAAC,IAAI,CAAC,OAAO,CACb,SAAS,EACT,SAAS,EACT,QAAQ,CAAC,CAAC;SACjB;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAEhD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;SAC7D;IACL,CAAC;IAEO,aAAa,CACjB,GAAW,EACX,GAAW,EACX,KAAoB,EACpB,SAAiB,EACjB,SAAiB,EACjB,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE;QAE9B,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,KAAK,CAAC,yEAAyE,CAAC,CAAC;QAE3G,MAAM,EAAE,GAAc;YAClB,IAAI,EAAE,QAAQ,CAAC,GAAG;YAClB,GAAG;YACH,GAAG;YACH,KAAK;SACR,CAAC;QAEF,MAAM,QAAQ,GAAmB;YAC7B,SAAS;YACT,SAAS;YACT,QAAQ;SACX,CAAC;QAEF,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IAEO,mBAAmB,CACvB,aAAgC,EAChC,cAAiC,EACjC,SAAgD,EAChD,OAAY;QAEZ,oGAAoG;QACpG,wGAAwG;QACxG,mEAAmE;QACnE,MAAM,QAAQ,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;QAC1D,MAAM,cAAc,GAAG,cAAc,CAAC,eAAe,EAAE,CAAC;QAExD,4GAA4G;QAC5G,6DAA6D;QAC7D,MAAM,CAAC,QAAQ,IAAI,cAAc,CAAC,QAAQ,EACtC,KAAK,CAAC,iGAAiG,CAAC,CAAC;QAE7G,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEnC,sGAAsG;QACtG,sFAAsF;QACtF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,oFAAoF;YACpF,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;YAE3B,IAAI,CAAC,kBAAkB,CACnB,OAAO,EACP,aAAa,CAAC,wBAAwB,CAClC,OAAO,CAAC,IAAI,kBAA6B;gBACrC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM;gBACpB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACrB;IACL,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEO,gBAAgB,CAAC,OAAY;QACjC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,qBAAqB,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,UAAU,CAAC,QAAgB,EAAE,KAAa;QAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,kEAAkE;QAClE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAED,gBAAgB,CAAQ,eAAe,CAAC,OAAiB;QACrD,MAAM,QAAQ,GAAG,OAA6B,CAAC;QAE/C,qEAAqE;QACrE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE1B,kFAAkF;QAClF,0BAA0B;QAC1B,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAEzC,+EAA+E;QAC/E,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAC9B,QAAQ;QACR,mBAAmB,CAAC,CAAC;QACrB,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,uEAAuE;QACvE,IAAI,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,YAAY,CAAC;QACvC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,QAAQ,GAAG,QAAQ,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACvD,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;oBAC5D,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,EACL,SAAS,EACT,SAAS,CAAC,CAAC;iBAClB;aACJ;SACJ;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YAC5C,QAAQ,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SACrF;IACL,CAAC;IAES,aAAa,CAAC,UAA4B;QAChD,MAAM,OAAO,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACzC,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,YAAY,oBAAoB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACpG,OAAO,CAAC,OAAO,sBACX,UAAU,CAAC,SAAS,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACrB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;SAC1B,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACrB,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACO,iBAAiB,CAAC,UAA6B;QACrD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;YAC1C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;gBAC1C,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;aAC7D;SACJ;IACL,CAAC;IAED;;;;;OAKG;IACK,YAAY;QAChB,oGAAoG;QACpG,qGAAqG;QACrG,mGAAmG;QACnG,+BAA+B;QAE/B,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAAE,CAAC;QACvC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;IAClD,CAAC;IAES,kBAAkB,CAAC,OAAY,EAAE,eAAqB;QAC5D,0DAA0D;QAC1D,sEAAsE;QACtE,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAEtG,KAAK,CAAC,kBAAkB,CAAC,uBAAuB,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC;QAE1G,0EAA0E;QAC1E,MAAM,CACF,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,EAC7E,KAAK,CAAC,4DAA4D,CACrE,CAAC;IACN,CAAC;IAES,SAAS;;QACf,8DAA8D;QAC9D,qFAAqF;QACrF,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;YAC1E,IAAI,CAAC,IAAI,CAAC,0BAA0B,OAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,mCAAI,UAAU,CAAC,CAAC;SAC7E;IACL,CAAC;IAES,SAAS;QACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,KAAK,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,aAAa,EAC1F,KAAK,CAAC,wEAAwE,CAAC,CAAC;QAEpF,6FAA6F;QAC7F,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,QAAkB,CAAC,CAAC;IAC1E,CAAC;IAES,YAAY,CAAC,OAAY,EAAE,eAAwB;QACzD,QAAQ,OAAO,CAAC,MAAM,EAAE;YACpB;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV;gBACI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAC/C,OAAuB,EACvB,eAAgD,CAAC,CAAC,CAAC;gBACvD,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAErF,MAAM,KAAK,GAAG,OAAkC,CAAC;gBACjD,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;gBAE7E,qFAAqF;gBACrF,yFAAyF;gBACzF,qFAAqF;gBACrF,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;oBAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAE5D,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;wBACtB,IAAI,CAAC,aAAa,CACd,GAAG,EACH,GAAG,EACH,KAAK,CAAC,KAAK,EACX,SAAS,EACT,SAAS,EACT,QAAQ,CACX,CAAC;qBACL;iBACJ;gBACD,MAAM;aACT;SACJ;IACL,CAAC;IAES,YAAY,KAAI,CAAC;IAE3B;;OAEG;IACO,KAAK,CAAC,QAAQ,CAAC,OAA+B;QACpD,IAAI;YACA,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sBAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAChB,IAAI,CAAC,OAAO,EACZ,IAAI,sBAAsB,CAAC,OAAO,oBAAoB,EACtD,IAAI,CAAC,UAAU,CAAC,CAAC;YACrB,MAAM,CAAC,QAAQ,EAAE,iBAAiB,CAAC,GAAG,MAAM,eAAe,CAAC,OAAO,uBAAsB,IAAI,CAAC,UAAU,CAAC,CAAC;YAE1G,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;SACxD;QAAC,OAAO,KAAK,EAAE;YACZ,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;SACxE;IACL,CAAC;IAES,WAAW,CAAC,UAAqC,EAAE,KAAc,EAAE,eAAwB;QACjG,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;QAE9B,QAAQ,QAAQ,CAAC,MAAM,EAAE;YACrB;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV;gBACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM;YACV,OAAO,CAAC,CAAC;gBACL,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,GAAG,EACjC,KAAK,CAAC,2DAA2D,CAAC,CAAC;gBAEvE,MAAM,EAAE,uBAAuB,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC;gBACjE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC;gBAE9B,IAAI,KAAK,EAAE;oBACP,8DAA8D;oBAC9D,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,eAAiC,CAAC;oBAE7E,+EAA+E;oBAC/E,gEAAgE;oBAChE,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE;wBAC3D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;qBACzD;iBACJ;qBAAM;oBACH,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;oBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;wBAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;wBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;wBAEvE,IAAI,WAAW,KAAK,SAAS,EAAE;4BAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;4BAE5D,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,SAAS,CAAC,EACvD,KAAK,CAAC,wDAAwD,CAAC,CAAC;4BAEpE,oFAAoF;4BACpF,gDAAgD;4BAChD,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,SAAS,EAAE;gCAC1D,MAAM,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC;gCAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gCAEhD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;oCAC5C,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;iCAC/D;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ;IACL,CAAC;IA8BD;;;;;;;OAOG;IACK,oBAAoB,CAAC,SAAiB,EAAE,SAAiB,EAAE,QAAgB;QAC/E,oEAAoE;QACpE,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAE,CAAC;QAEpE,yFAAyF;QACzF,+FAA+F;QAC/F,kCAAkC;QAClC,MAAM,CAAC,CAAC,CAAC,eAAe,GAAG,QAAQ,CAAC;QAChC,mCAAmC;QACnC,KAAK,CAAC,uGAAuG,CAAC,CAAC;QAEnH,wFAAwF;QACxF,mDAAmD;QACnD,OAAO,eAAe,KAAK,QAAQ,CAAC;IACxC,CAAC;IAEM,QAAQ;QACX,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,OAAO,CAAC,QAAQ,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC;QAE5G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;YACpC,CAAC,IAAI,KAAK,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,CAAC,GAAG,CAAC,EAAE;oBACP,CAAC,IAAI,IAAI,CAAC;iBACb;gBAED,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;aACxE;YACD,CAAC,IAAI,KAAK,CAAC;SACd;QAED,OAAO,GAAG,CAAC,IAAI,CAAC;IACpB,CAAC;IAES,cAAc;QACpB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACvC,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport {\n    IFluidDataStoreRuntime,\n    IChannelStorageService,\n    Serializable,\n    IChannelAttributes,\n} from \"@fluidframework/datastore-definitions\";\nimport {\n    IFluidSerializer,\n    makeHandlesSerializable,\n    parseHandles,\n    SharedObject,\n    SummarySerializer,\n} from \"@fluidframework/shared-object-base\";\nimport { ISummaryTreeWithStats } from \"@fluidframework/runtime-definitions\";\nimport { ObjectStoragePartition, SummaryTreeBuilder } from \"@fluidframework/runtime-utils\";\nimport {\n    IMatrixProducer,\n    IMatrixConsumer,\n    IMatrixReader,\n    IMatrixWriter,\n} from \"@tiny-calc/nano\";\nimport { MergeTreeDeltaType, IMergeTreeOp, SegmentGroup, ISegment } from \"@fluidframework/merge-tree\";\nimport { MatrixOp } from \"./ops\";\nimport { PermutationVector, PermutationSegment } from \"./permutationvector\";\nimport { SparseArray2D } from \"./sparsearray2d\";\nimport { SharedMatrixFactory } from \"./runtime\";\nimport { Handle, isHandleValid } from \"./handletable\";\nimport { deserializeBlob } from \"./serialization\";\nimport { ensureRange } from \"./range\";\nimport { IUndoConsumer } from \"./types\";\nimport { MatrixUndoProvider } from \"./undoprovider\";\n\nconst enum SnapshotPath {\n    rows = \"rows\",\n    cols = \"cols\",\n    cells = \"cells\",\n}\n\ninterface ISetOp<T> {\n    type: MatrixOp.set,\n    row: number,\n    col: number,\n    value: MatrixItem<T>,\n}\n\ninterface ISetOpMetadata {\n    rowHandle: Handle,\n    colHandle: Handle,\n    localSeq: number,\n}\n\n/**\n * A matrix cell value may be undefined (indicating an empty cell) or any serializable type,\n * excluding null.  (However, nulls may be embedded inside objects and arrays.)\n */\nexport type MatrixItem<T> = Serializable<Exclude<T, null>> | undefined;\n\n/**\n * A SharedMatrix holds a rectangular 2D array of values.  Supported operations\n * include setting values and inserting/removing rows and columns.\n *\n * Matrix values may be any Fluid serializable type, which is the set of JSON\n * serializable types extended to include IFluidHandles.\n *\n * Fluid's SharedMatrix implementation works equally well for dense and sparse\n * matrix data and physically stores data in Z-order to leverage CPU caches and\n * prefetching when reading in either row or column major order.  (See README.md\n * for more details.)\n */\nexport class SharedMatrix<T = any>\n    extends SharedObject\n    implements IMatrixProducer<MatrixItem<T>>,\n    IMatrixReader<MatrixItem<T>>,\n    IMatrixWriter<MatrixItem<T>>\n{\n    private readonly consumers = new Set<IMatrixConsumer<MatrixItem<T>>>();\n\n    public static getFactory() { return new SharedMatrixFactory(); }\n\n    private readonly rows: PermutationVector;   // Map logical row to storage handle (if any)\n    private readonly cols: PermutationVector;   // Map logical col to storage handle (if any)\n\n    private cells = new SparseArray2D<MatrixItem<T>>();     // Stores cell values.\n    private pending = new SparseArray2D<number>();          // Tracks pending writes.\n\n    constructor(runtime: IFluidDataStoreRuntime, public id: string, attributes: IChannelAttributes) {\n        super(id, runtime, attributes);\n\n        this.rows = new PermutationVector(\n            SnapshotPath.rows,\n            this.logger,\n            runtime,\n            this.onRowDelta,\n            this.onRowHandlesRecycled);\n\n        this.cols = new PermutationVector(\n            SnapshotPath.cols,\n            this.logger,\n            runtime,\n            this.onColDelta,\n            this.onColHandlesRecycled);\n    }\n\n    private undo?: MatrixUndoProvider<T>;\n\n    /**\n     * Subscribes the given IUndoConsumer to the matrix.\n     */\n    public openUndo(consumer: IUndoConsumer) {\n        assert(this.undo === undefined,\n            0x019 /* \"SharedMatrix.openUndo() supports at most a single IUndoConsumer.\" */);\n\n        this.undo = new MatrixUndoProvider(consumer, this, this.rows, this.cols);\n    }\n\n    // TODO: closeUndo()?\n\n    private get rowHandles() { return this.rows.handleCache; }\n    private get colHandles() { return this.cols.handleCache; }\n\n    /**\n     * {@inheritDoc @fluidframework/datastore-definitions#IChannelFactory.create}\n     */\n    public static create<T>(runtime: IFluidDataStoreRuntime, id?: string) {\n        return runtime.createChannel(id, SharedMatrixFactory.Type) as SharedMatrix<T>;\n    }\n\n    // #region IMatrixProducer\n\n    openMatrix(\n        consumer: IMatrixConsumer<MatrixItem<T>>,\n    ): IMatrixReader<MatrixItem<T>> {\n        this.consumers.add(consumer);\n        return this;\n    }\n\n    closeMatrix(consumer: IMatrixConsumer<MatrixItem<T>>): void {\n        this.consumers.delete(consumer);\n    }\n\n    // #endregion IMatrixProducer\n\n    // #region IMatrixReader\n\n    public get rowCount() { return this.rows.getLength(); }\n    public get colCount() { return this.cols.getLength(); }\n\n    public getCell(row: number, col: number): MatrixItem<T> {\n        // Perf: When possible, bounds checking is performed inside the implementation for\n        //       'getHandle()' so that it can be elided in the case of a cache hit.  This\n        //       yields an ~40% improvement in the case of a cache hit (node v12 x64)\n\n        // Map the logical (row, col) to associated storage handles.\n        const rowHandle = this.rowHandles.getHandle(row);\n        if (isHandleValid(rowHandle)) {\n            const colHandle = this.colHandles.getHandle(col);\n            if (isHandleValid(colHandle)) {\n                return this.cells.getCell(rowHandle, colHandle);\n            }\n        } else {\n            // If we early exit because the given rowHandle is unallocated, we still need to\n            // bounds-check the 'col' parameter.\n            ensureRange(col, this.cols.getLength());\n        }\n\n        return undefined;\n    }\n\n    public get matrixProducer(): IMatrixProducer<MatrixItem<T>> { return this; }\n\n    // #endregion IMatrixReader\n\n    public setCell(row: number, col: number, value: MatrixItem<T>) {\n        assert(0 <= row && row < this.rowCount\n            && 0 <= col && col < this.colCount,\n            0x01a /* \"Trying to set out-of-bounds cell!\" */);\n\n        this.setCellCore(row, col, value);\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(row, col, 1, 1, this);\n        }\n    }\n\n    public setCells(\n        rowStart: number,\n        colStart: number,\n        colCount: number,\n        values: readonly (MatrixItem<T>)[],\n    ) {\n        const rowCount = Math.ceil(values.length / colCount);\n\n        assert((0 <= rowStart && rowStart < this.rowCount)\n            && (0 <= colStart && colStart < this.colCount)\n            && (1 <= colCount && colCount <= (this.colCount - colStart))\n            && (rowCount <= (this.rowCount - rowStart)),\n            0x01b /* \"Trying to set multiple out-of-bounds cells!\" */);\n\n        const endCol = colStart + colCount;\n        let r = rowStart;\n        let c = colStart;\n\n        for (const value of values) {\n            this.setCellCore(r, c, value);\n\n            if (++c === endCol) {\n                c = colStart;\n                r++;\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, colStart, rowCount, colCount, this);\n        }\n    }\n\n    private setCellCore(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle = this.rows.getAllocatedHandle(row),\n        colHandle = this.cols.getAllocatedHandle(col),\n    ) {\n        if (this.undo !== undefined) {\n            let oldValue = this.cells.getCell(rowHandle, colHandle);\n            if (oldValue === null) {\n                oldValue = undefined;\n            }\n\n            this.undo.cellSet(\n                rowHandle,\n                colHandle,\n                oldValue);\n        }\n\n        this.cells.setCell(rowHandle, colHandle, value);\n\n        if (this.isAttached()) {\n            this.sendSetCellOp(row, col, value, rowHandle, colHandle);\n        }\n    }\n\n    private sendSetCellOp(\n        row: number,\n        col: number,\n        value: MatrixItem<T>,\n        rowHandle: Handle,\n        colHandle: Handle,\n        localSeq = this.nextLocalSeq(),\n    ) {\n        assert(this.isAttached(), 0x1e2 /* \"Caller must ensure 'isAttached()' before calling 'sendSetCellOp'.\" */);\n\n        const op: ISetOp<T> = {\n            type: MatrixOp.set,\n            row,\n            col,\n            value,\n        };\n\n        const metadata: ISetOpMetadata = {\n            rowHandle,\n            colHandle,\n            localSeq,\n        };\n\n        this.submitLocalMessage(op, metadata);\n        this.pending.setCell(rowHandle, colHandle, localSeq);\n    }\n\n    private submitVectorMessage(\n        currentVector: PermutationVector,\n        oppositeVector: PermutationVector,\n        dimension: SnapshotPath.rows | SnapshotPath.cols,\n        message: any,\n    ) {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally advance each MergeTree's 'localSeq' counter\n        // for each submitted op it not aware of to keep them synchronized.\n        const localSeq = currentVector.getCollabWindow().localSeq;\n        const oppositeWindow = oppositeVector.getCollabWindow();\n\n        // Note that the comparison is '>=' because, in the case the MergeTree is regenerating ops for reconnection,\n        // the MergeTree submits the op with the original 'localSeq'.\n        assert(localSeq >= oppositeWindow.localSeq,\n            0x01c /* \"The 'localSeq' of the vector submitting an op must >= the 'localSeq' of the other vector.\" */);\n\n        oppositeWindow.localSeq = localSeq;\n\n        // If the SharedMatrix is local, it's state will be submitted via a Snapshot when initially connected.\n        // Do not queue a message or track the pending op, as there will never be an ACK, etc.\n        if (this.isAttached()) {\n            // Record whether this `op` targets rows or cols.  (See dispatch in `processCore()`)\n            message.target = dimension;\n\n            this.submitLocalMessage(\n                message,\n                currentVector.peekPendingSegmentGroups(\n                    message.type === MergeTreeDeltaType.GROUP\n                        ? message.ops.length\n                        : 1));\n        }\n    }\n\n    private submitColMessage(message: any) {\n        this.submitVectorMessage(this.cols, this.rows, SnapshotPath.cols, message);\n    }\n\n    public insertCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.insert(colStart, count));\n    }\n\n    public removeCols(colStart: number, count: number) {\n        this.submitColMessage(this.cols.remove(colStart, count));\n    }\n\n    private submitRowMessage(message: any) {\n        this.submitVectorMessage(this.rows, this.cols, SnapshotPath.rows, message);\n    }\n\n    public insertRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.insert(rowStart, count));\n    }\n\n    public removeRows(rowStart: number, count: number) {\n        this.submitRowMessage(this.rows.remove(rowStart, count));\n    }\n\n    /** @internal */ public _undoRemoveRows(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of rows at the original position.\n        const { op, inserted } = this.rows.insertRelative(original, original.cachedLength);\n        this.submitRowMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'rowsChanged'\n        // callback, which occurs before the handle span is populated.\n        const rowStart = this.rows.getPosition(inserted);\n        this.rows.handleCache.itemsChanged(\n            rowStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted rows.\n        let rowHandle = inserted.start;\n        const rowCount = inserted.cachedLength;\n        for (let row = rowStart; row < rowStart + rowCount; row++, rowHandle++) {\n            for (let col = 0; col < this.colCount; col++) {\n                const colHandle = this.colHandles.getHandle(col);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(rowStart, /* colStart: */ 0, rowCount, this.colCount, this);\n        }\n    }\n\n    /** @internal */ public _undoRemoveCols(segment: ISegment) {\n        const original = segment as PermutationSegment;\n\n        // (Re)insert the removed number of columns at the original position.\n        const { op, inserted } = this.cols.insertRelative(original, original.cachedLength);\n        this.submitColMessage(op);\n\n        // Transfer handles and undo/redo tracking groups from the original segment to the\n        // newly inserted segment.\n        original.transferToReplacement(inserted);\n\n        // Invalidate the handleCache in case it was populated during the 'colsChanged'\n        // callback, which occurs before the handle span is populated.\n        const colStart = this.cols.getPosition(inserted);\n        this.cols.handleCache.itemsChanged(\n            colStart,\n            /* removedCount: */ 0,\n            /* insertedCount: */ inserted.cachedLength);\n\n        // Generate setCell ops for each populated cell in the reinserted cols.\n        let colHandle = inserted.start;\n        const colCount = inserted.cachedLength;\n        for (let col = colStart; col < colStart + colCount; col++, colHandle++) {\n            for (let row = 0; row < this.rowCount; row++) {\n                const rowHandle = this.rowHandles.getHandle(row);\n                const value = this.cells.getCell(rowHandle, colHandle);\n                if (this.isAttached() && value !== undefined && value !== null) {\n                    this.sendSetCellOp(\n                        row,\n                        col,\n                        value,\n                        rowHandle,\n                        colHandle);\n                }\n            }\n        }\n\n        // Avoid reentrancy by raising change notifications after the op is queued.\n        for (const consumer of this.consumers.values()) {\n            consumer.cellsChanged(/* rowStart: */ 0, colStart, this.rowCount, colCount, this);\n        }\n    }\n\n    protected summarizeCore(serializer: IFluidSerializer): ISummaryTreeWithStats {\n        const builder = new SummaryTreeBuilder();\n        builder.addWithStats(SnapshotPath.rows, this.rows.summarize(this.runtime, this.handle, serializer));\n        builder.addWithStats(SnapshotPath.cols, this.cols.summarize(this.runtime, this.handle, serializer));\n        builder.addBlob(SnapshotPath.cells,\n            serializer.stringify([\n                this.cells.snapshot(),\n                this.pending.snapshot(),\n            ], this.handle));\n        return builder.getSummaryTree();\n    }\n\n    /**\n     * Runs serializer on the GC data for this SharedMatrix.\n     * All the IFluidHandle's stored in the cells represent routes to other objects.\n     */\n    protected processGCDataCore(serializer: SummarySerializer) {\n        for (let row = 0; row < this.rowCount; row++) {\n            for (let col = 0; col < this.colCount; col++) {\n                serializer.stringify(this.getCell(row, col), this.handle);\n            }\n        }\n    }\n\n    /**\n     * Advances the 'localSeq' counter for the cell data operation currently being queued.\n     *\n     * Do not use with 'submitColMessage()/submitRowMessage()' as these helpers + the MergeTree will\n     * automatically advance 'localSeq'.\n     */\n    private nextLocalSeq() {\n        // Ideally, we would have a single 'localSeq' counter that is shared between both PermutationVectors\n        // and the SharedMatrix's cell data.  Instead, we externally bump each MergeTree's 'localSeq' counter\n        // for SharedMatrix ops it's not aware of to keep them synchronized.  (For cell data operations, we\n        // need to bump both counters.)\n\n        this.cols.getCollabWindow().localSeq++;\n        return ++this.rows.getCollabWindow().localSeq;\n    }\n\n    protected submitLocalMessage(message: any, localOpMetadata?: any) {\n        // TODO: Recommend moving this assertion into SharedObject\n        //       (See https://github.com/microsoft/FluidFramework/issues/2559)\n        assert(this.isAttached() === true, 0x01d /* \"Trying to submit message to runtime while detached!\" */);\n\n        super.submitLocalMessage(makeHandlesSerializable(message, this.serializer, this.handle), localOpMetadata);\n\n        // Ensure that row/col 'localSeq' are synchronized (see 'nextLocalSeq()').\n        assert(\n            this.rows.getCollabWindow().localSeq === this.cols.getCollabWindow().localSeq,\n            0x01e /* \"Row and col collab window 'localSeq' desynchronized!\" */,\n        );\n    }\n\n    protected didAttach() {\n        // We've attached we need to start generating and sending ops.\n        // so start collaboration and provide a default client id incase we are not connected\n        if (this.isAttached()) {\n            this.rows.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n            this.cols.startOrUpdateCollaboration(this.runtime.clientId ?? \"attached\");\n        }\n    }\n\n    protected onConnect() {\n        assert(this.rows.getCollabWindow().collaborating === this.cols.getCollabWindow().collaborating,\n            0x01f /* \"Row and col collab window 'collaborating' status desynchronized!\" */);\n\n        // Update merge tree collaboration information with new client ID and then resend pending ops\n        this.rows.startOrUpdateCollaboration(this.runtime.clientId as string);\n        this.cols.startOrUpdateCollaboration(this.runtime.clientId as string);\n    }\n\n    protected reSubmitCore(content: any, localOpMetadata: unknown) {\n        switch (content.target) {\n            case SnapshotPath.cols:\n                this.submitColMessage(this.cols.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            case SnapshotPath.rows:\n                this.submitRowMessage(this.rows.regeneratePendingOp(\n                    content as IMergeTreeOp,\n                    localOpMetadata as SegmentGroup | SegmentGroup[]));\n                break;\n            default: {\n                assert(content.type === MatrixOp.set, 0x020 /* \"Unknown SharedMatrix 'op' type.\" */);\n\n                const setOp = content as ISetOp<Serializable<T>>;\n                const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                // If there are more pending local writes to the same row/col handle, it is important\n                // to skip resubmitting this op since it is possible the row/col handle has been recycled\n                // and now refers to a different position than when this op was originally submitted.\n                if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                    const row = this.rows.handleToPosition(rowHandle, localSeq);\n                    const col = this.cols.handleToPosition(colHandle, localSeq);\n\n                    if (row >= 0 && col >= 0) {\n                        this.sendSetCellOp(\n                            row,\n                            col,\n                            setOp.value,\n                            rowHandle,\n                            colHandle,\n                            localSeq,\n                        );\n                    }\n                }\n                break;\n            }\n        }\n    }\n\n    protected onDisconnect() {}\n\n    /**\n     * {@inheritDoc @fluidframework/shared-object-base#SharedObject.loadCore}\n     */\n    protected async loadCore(storage: IChannelStorageService) {\n        try {\n            await this.rows.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.rows),\n                this.serializer);\n            await this.cols.load(\n                this.runtime,\n                new ObjectStoragePartition(storage, SnapshotPath.cols),\n                this.serializer);\n            const [cellData, pendingCliSeqData] = await deserializeBlob(storage, SnapshotPath.cells, this.serializer);\n\n            this.cells = SparseArray2D.load(cellData);\n            this.pending = SparseArray2D.load(pendingCliSeqData);\n        } catch (error) {\n            this.logger.sendErrorEvent({ eventName: \"MatrixLoadFailed\" }, error);\n        }\n    }\n\n    protected processCore(rawMessage: ISequencedDocumentMessage, local: boolean, localOpMetadata: unknown) {\n        const msg = parseHandles(rawMessage, this.serializer);\n\n        const contents = msg.contents;\n\n        switch (contents.target) {\n            case SnapshotPath.cols:\n                this.cols.applyMsg(msg);\n                break;\n            case SnapshotPath.rows:\n                this.rows.applyMsg(msg);\n                break;\n            default: {\n                assert(contents.type === MatrixOp.set,\n                    0x021 /* \"SharedMatrix message contents have unexpected type!\" */);\n\n                const { referenceSequenceNumber: refSeq, clientId } = rawMessage;\n                const { row, col } = contents;\n\n                if (local) {\n                    // We are receiving the ACK for a local pending set operation.\n                    const { rowHandle, colHandle, localSeq } = localOpMetadata as ISetOpMetadata;\n\n                    // If this is the most recent write to the cell by the local client, remove our\n                    // entry from 'pendingCliSeqs' to resume allowing remote writes.\n                    if (this.isLatestPendingWrite(rowHandle, colHandle, localSeq)) {\n                        this.pending.setCell(rowHandle, colHandle, undefined);\n                    }\n                } else {\n                    const rowClientId = this.rows.getOrAddShortClientId(clientId);\n                    const adjustedRow = this.rows.adjustPosition(row, refSeq, rowClientId);\n\n                    if (adjustedRow !== undefined) {\n                        const colClientId = this.cols.getOrAddShortClientId(clientId);\n                        const adjustedCol = this.cols.adjustPosition(col, refSeq, colClientId);\n\n                        if (adjustedCol !== undefined) {\n                            const rowHandle = this.rows.getAllocatedHandle(adjustedRow);\n                            const colHandle = this.cols.getAllocatedHandle(adjustedCol);\n\n                            assert(isHandleValid(rowHandle) && isHandleValid(colHandle),\n                                0x022 /* \"SharedMatrix row and/or col handles are invalid!\" */);\n\n                            // If there is a pending (unACKed) local write to the same cell, skip the current op\n                            // since it \"happened before\" the pending write.\n                            if (this.pending.getCell(rowHandle, colHandle) === undefined) {\n                                const { value } = contents;\n                                this.cells.setCell(rowHandle, colHandle, value);\n\n                                for (const consumer of this.consumers.values()) {\n                                    consumer.cellsChanged(adjustedRow, adjustedCol, 1, 1, this);\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of row insertion/deletions.\n    private readonly onRowDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.rowsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    // Invoked by PermutationVector to notify IMatrixConsumers of col insertion/deletions.\n    private readonly onColDelta = (position: number, removedCount: number, insertedCount: number) => {\n        for (const consumer of this.consumers) {\n            consumer.colsChanged(position, removedCount, insertedCount, this);\n        }\n    };\n\n    private readonly onRowHandlesRecycled = (rowHandles: Handle[]) => {\n        for (const rowHandle of rowHandles) {\n            this.cells.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n            this.pending.clearRows(/* rowStart: */ rowHandle, /* rowCount: */ 1);\n        }\n    };\n\n    private readonly onColHandlesRecycled = (colHandles: Handle[]) => {\n        for (const colHandle of colHandles) {\n            this.cells.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n            this.pending.clearCols(/* colStart: */ colHandle, /* colCount: */ 1);\n        }\n    };\n\n    /**\n     * Returns true if the latest pending write to the cell indicated by the given row/col handles\n     * matches the given 'localSeq'.\n     *\n     * A return value of `true` indicates that there are no later local operations queued that will\n     * clobber the write op at the given 'localSeq'.  This includes later ops that overwrite the cell\n     * with a different value as well as row/col removals that might recycled the given row/col handles.\n     */\n    private isLatestPendingWrite(rowHandle: Handle, colHandle: Handle, localSeq: number) {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const pendingLocalSeq = this.pending.getCell(rowHandle, colHandle)!;\n\n        // Note while we're awaiting the ACK for a local set, it's possible for the row/col to be\n        // locally removed and the row/col handles recycled.  If this happens, the pendingLocalSeq will\n        // be 'undefined' or > 'localSeq'.\n        assert(!(pendingLocalSeq < localSeq),\n            // eslint-disable-next-line max-len\n            0x023 /* \"The 'localSeq' of pending write (if any) must be <= the localSeq of the currently processed op.\" */);\n\n        // If this is the most recent write to the cell by the local client, the stored localSeq\n        // will be an exact match for the given 'localSeq'.\n        return pendingLocalSeq === localSeq;\n    }\n\n    public toString() {\n        let s = `client:${this.runtime.clientId}\\nrows: ${this.rows.toString()}\\ncols: ${this.cols.toString()}\\n\\n`;\n\n        for (let r = 0; r < this.rowCount; r++) {\n            s += `  [`;\n            for (let c = 0; c < this.colCount; c++) {\n                if (c > 0) {\n                    s += \", \";\n                }\n\n                s += `${this.serializer.stringify(this.getCell(r, c), this.handle)}`;\n            }\n            s += \"]\\n\";\n        }\n\n        return `${s}\\n`;\n    }\n\n    protected applyStashedOp() {\n        throw new Error(\"not implemented\");\n    }\n}\n"]}

package/lib/packageVersion.d.ts

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export declare const pkgName = "@fluidframework/matrix";
-export declare const pkgVersion = "0.56.7";
+export declare const pkgVersion = "0.57.1";
 //# sourceMappingURL=packageVersion.d.ts.map

package/lib/packageVersion.js

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export const pkgName = "@fluidframework/matrix";
-export const pkgVersion = "0.56.7";
+export const pkgVersion = "0.57.1";
 //# sourceMappingURL=packageVersion.js.map

package/lib/packageVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,wBAAwB,CAAC;AAChD,MAAM,CAAC,MAAM,UAAU,GAAG,QAAQ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"0.56.7\";\n"]}
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,wBAAwB,CAAC;AAChD,MAAM,CAAC,MAAM,UAAU,GAAG,QAAQ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"0.57.1\";\n"]}

package/lib/sparsearray2d.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparsearray2d.d.ts","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAkC/D,aAAK,gBAAgB,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7C,aAAK,UAAU,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;AAY3C,aAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAE/B;;GAEG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC;IACnF,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,GAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAe;IAEtE,IAAW,QAAQ,WAAyB;IAC5C,IAAW,QAAQ,WAAyB;IAErC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAqBvD,IAAW,cAAc,QAA+B;IAEjD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS;IAW7D;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB,wEAAwE;IACjE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,uEAAuE;IAChE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,OAAO,CAAC,QAAQ;IAQT,QAAQ;WAID,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;CAG5C"}
+{"version":3,"file":"sparsearray2d.d.ts","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAkC/D,aAAK,gBAAgB,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7C,aAAK,UAAU,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;AAW3C,aAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAE/B;;GAEG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,SAAS,CAAC;IACnF,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,GAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAe;IAEtE,IAAW,QAAQ,WAAyB;IAC5C,IAAW,QAAQ,WAAyB;IAErC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAqBvD,IAAW,cAAc,QAA+B;IAEjD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS;IAW7D;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAOvB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB;;;;;;OAMG;IACH,OAAO,CAAC,YAAY;IAapB,wEAAwE;IACjE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,uEAAuE;IAChE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IA0BnD,OAAO,CAAC,QAAQ;IAQT,QAAQ;WAID,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;CAG5C"}

package/lib/sparsearray2d.js

@@ -30,7 +30,6 @@ const c0ToMorton16 = (col) => interlaceBitsX16(col) >>> 0;
 const r0c0ToMorton2x16 = (row, col) => (r0ToMorton16(row) | c0ToMorton16(col)) >>> 0;
 /** Undo JSON serialization's coercion of 'undefined' to null. */
 const nullToUndefined = (array) => array.map((value) => {
-    // eslint-disable-next-line no-null/no-null
     return value === null
         ? undefined
         : Array.isArray(value)

package/lib/sparsearray2d.js.map

@@ -1 +1 @@
-{"version":3,"file":"sparsearray2d.js","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,8EAA8E;AAC9E,6EAA6E;AAC7E,EAAE;AACF,6EAA6E;AAC7E,yDAAyD;AACzD,MAAM,iBAAiB,GACnB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC,CAAC;AAEP,iFAAiF;AACjF,6DAA6D;AAC7D,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;AAC1C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AACjD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAClD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAElD,uEAAuE;AACvE,yEAAyE;AACzE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AAEhH,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;AACzE,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAElE,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAKrG,iEAAiE;AACjE,MAAM,eAAe,GAAG,CAAI,KAA2B,EAA6B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;IACvG,2CAA2C;IAC3C,OAAO,KAAK,KAAK,IAAI;QACjB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAClB,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC;AACpB,CAAC,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,OAAO,aAAa;IACtB,YAA6B,OAA8B,CAAC,SAAS,CAAC;QAAzC,SAAI,GAAJ,IAAI,CAAqC;IAAI,CAAC;IAE3E,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAC5C,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAErC,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,SAAS,EAAE;YACtB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;wBACtB,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;qBAC/B;iBACJ;aACJ;SACJ;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,+DAA+D;IAC/D,IAAW,cAAc,KAAK,OAAO,SAAgB,CAAC,CAAC,CAAC;IAEjD,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,OAAe,EAAE,QAA+B;QACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;SACjD;IACL,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,GAAW,EAAE,QAA+B;QAChE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;SAC7C;IACL,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,wEAAwE;IACjE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAED,uEAAuE;IAChE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAEO,QAAQ,CAAI,MAAiB,EAAE,MAAc;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,+DAA+D;QAC/D,OAAO,KAAK,KAAK,SAAS;YACtB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACnD,CAAC,CAAC,KAAK,CAAC;IAChB,CAAC;IAEM,QAAQ;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAEM,MAAM,CAAC,IAAI,CAAI,IAAmB;QACrC,OAAO,IAAI,aAAa,CAAI,eAAe,CAAI,IAAI,CAA6B,CAAC,CAAC;IACtF,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { IMatrixReader, IMatrixWriter } from \"@tiny-calc/nano\";\n\n// Build a lookup table that maps a uint8 to the corresponding uint16 where 0s\n// are interleaved between the original bits. (e.g., 1111... -> 01010101...).\n//\n// (Lookup table ~17% faster than inlining the bit-twiddling on Node v12 x64)\n// (Array<T> ~2% faster than typed array on Node v12 x64)\nconst x8ToInterlacedX16 =\n    new Array(256).fill(0).map((value, i) => {\n        let j = i;\n        j = (j | (j << 4)) & 0x0f0f; // .... 7654 .... 3210\n        j = (j | (j << 2)) & 0x3333; // ..76 ..54 ..32 ..10\n        j = (j | (j << 1)) & 0x5555; // .7.6 .5.4 .3.2 .1.0\n        return j;\n    });\n\n// Selects individual bytes from a given 32b integer.  The left shift are used to\n// clear upper bits (faster than using masks on Node 10 x64).\nconst byte0 = (x32: number) => x32 >>> 24;\nconst byte1 = (x32: number) => (x32 << 8) >>> 24;\nconst byte2 = (x32: number) => (x32 << 16) >>> 24;\nconst byte3 = (x32: number) => (x32 << 24) >>> 24;\n\n// Given a uint16 returns the corresponding uint32 integer where 0s are\n// interleaved between the original bits. (e.g., 1111... -> 01010101...).\nconst interlaceBitsX16 = (x16: number) => (x8ToInterlacedX16[byte2(x16)] << 16) | x8ToInterlacedX16[byte3(x16)];\n\nconst r0ToMorton16 = (row: number) => (interlaceBitsX16(row) << 1) >>> 0;\nconst c0ToMorton16 = (col: number) => interlaceBitsX16(col) >>> 0;\n\n// Given a 2D uint16 coordinate returns the corresponding unt32 Morton coded\n// coordinate.  (See https://en.wikipedia.org/wiki/Z-order_curve)\nconst r0c0ToMorton2x16 = (row: number, col: number) => (r0ToMorton16(row) | c0ToMorton16(col)) >>> 0;\n\ntype RecurArrayHelper<T> = RecurArray<T> | T;\ntype RecurArray<T> = RecurArrayHelper<T>[];\n\n/** Undo JSON serialization's coercion of 'undefined' to null. */\nconst nullToUndefined = <T>(array: RecurArray<T | null>): RecurArray<T | undefined> => array.map((value) => {\n    // eslint-disable-next-line no-null/no-null\n    return value === null\n        ? undefined\n        : Array.isArray(value)\n            ? nullToUndefined(value)\n            : value;\n});\n\ntype UA<T> = (T | undefined)[];\n\n/**\n * A sparse 4 billion x 4 billion array stored as 16x16 tiles.\n */\nexport class SparseArray2D<T> implements IMatrixReader<T | undefined>, IMatrixWriter<T | undefined> {\n    constructor(private readonly root: UA<UA<UA<UA<UA<T>>>>> = [undefined]) { }\n\n    public get rowCount() { return 0xFFFFFFFF; }\n    public get colCount() { return 0xFFFFFFFF; }\n\n    public getCell(row: number, col: number): T | undefined {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const level0 = this.root[keyHi];\n        if (level0 !== undefined) {\n            const keyLo = r0c0ToMorton2x16(row, col);\n            const level1 = level0[byte0(keyLo)];\n            if (level1 !== undefined) {\n                const level2 = level1[byte1(keyLo)];\n                if (level2 !== undefined) {\n                    const level3 = level2[byte2(keyLo)];\n                    if (level3 !== undefined) {\n                        return level3[byte3(keyLo)];\n                    }\n                }\n            }\n        }\n\n        return undefined;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n    public get matrixProducer() { return undefined as any; }\n\n    public setCell(row: number, col: number, value: T | undefined) {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const keyLo = r0c0ToMorton2x16(row, col);\n\n        const level0 = this.getLevel(this.root, keyHi);\n        const level1 = this.getLevel(level0, byte0(keyLo));\n        const level2 = this.getLevel(level1, byte1(keyLo));\n        const level3 = this.getLevel(level2, byte2(keyLo));\n        level3[byte3(keyLo)] = value;\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated row.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInRow(rowBits: number, callback: (key: number) => void) {\n        for (let col = 0; col < 16; col++) {\n            // Perf: Potentially faster to replace 'c0ToMorton16()' with a short look up table?\n            callback((rowBits | c0ToMorton16(col)) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated col.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInCol(col: number, callback: (key: number) => void) {\n        for (let row = 0; row < 16; row++) {\n            // Perf: Potentially faster to replace 'r0ToMorton16()' with a short look up table?\n            callback((r0ToMorton16(row) | col) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given row  in the 'currentLevel'.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInRow<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        rowBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInRow(rowBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given col in the 'currentLevel'.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInCol<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        colBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInCol(colBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /** Clears the all cells contained within the specified span of rows. */\n    public clearRows(rowStart: number, rowCount: number) {\n        const rowEnd = rowStart + rowCount;\n        for (let row = rowStart; row < rowEnd; row++) {\n            const rowHi = r0ToMorton16(row >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let colHi = 0; colHi < 0x10000; colHi++) {\n                const keyHi = (rowHi | c0ToMorton16(colHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const rowLo = r0ToMorton16(row);\n                    this.forEachInRow(level0, byte0(rowLo), (level1) => {\n                        this.forEachInRow(level1, byte1(rowLo), (level2) => {\n                            this.forEachInRow(level2, byte2(rowLo), (level3) => {\n                                this.forEachKeyInRow(byte3(rowLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    /** Clears the all cells contained within the specifed span of cols. */\n    public clearCols(colStart: number, colCount: number) {\n        const colEnd = colStart + colCount;\n        for (let col = colStart; col < colEnd; col++) {\n            const colHi = c0ToMorton16(col >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let rowHi = 0; rowHi < 0x10000; rowHi++) {\n                const keyHi = (colHi | r0ToMorton16(rowHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const colLo = c0ToMorton16(col);\n                    this.forEachInCol(level0, byte0(colLo), (level1) => {\n                        this.forEachInCol(level1, byte1(colLo), (level2) => {\n                            this.forEachInCol(level2, byte2(colLo), (level3) => {\n                                this.forEachKeyInCol(byte3(colLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    private getLevel<T>(parent: UA<UA<T>>, subKey: number) {\n        const level = parent[subKey];\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n        return level === undefined\n            ? (parent[subKey] = new Array(256).fill(undefined))\n            : level;\n    }\n\n    public snapshot() {\n        return this.root;\n    }\n\n    public static load<T>(data: RecurArray<T>) {\n        return new SparseArray2D<T>(nullToUndefined<T>(data) as SparseArray2D<T>[\"root\"]);\n    }\n}\n"]}
+{"version":3,"file":"sparsearray2d.js","sourceRoot":"","sources":["../src/sparsearray2d.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,8EAA8E;AAC9E,6EAA6E;AAC7E,EAAE;AACF,6EAA6E;AAC7E,yDAAyD;AACzD,MAAM,iBAAiB,GACnB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,sBAAsB;IACnD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC,CAAC;AAEP,iFAAiF;AACjF,6DAA6D;AAC7D,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;AAC1C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AACjD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAClD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AAElD,uEAAuE;AACvE,yEAAyE;AACzE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AAEhH,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;AACzE,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAElE,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,gBAAgB,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAKrG,iEAAiE;AACjE,MAAM,eAAe,GAAG,CAAI,KAA2B,EAA6B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;IACvG,OAAO,KAAK,KAAK,IAAI;QACjB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAClB,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC;AACpB,CAAC,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,OAAO,aAAa;IACtB,YAA6B,OAA8B,CAAC,SAAS,CAAC;QAAzC,SAAI,GAAJ,IAAI,CAAqC;IAAI,CAAC;IAE3E,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAC5C,IAAW,QAAQ,KAAK,OAAO,UAAU,CAAC,CAAC,CAAC;IAErC,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,SAAS,EAAE;YACtB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;wBACtB,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;qBAC/B;iBACJ;aACJ;SACJ;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,+DAA+D;IAC/D,IAAW,cAAc,KAAK,OAAO,SAAgB,CAAC,CAAC,CAAC;IAEjD,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,KAAoB;QACzD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,OAAe,EAAE,QAA+B;QACpE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;SACjD;IACL,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,GAAW,EAAE,QAA+B;QAChE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;YAC/B,mFAAmF;YACnF,QAAQ,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;SAC7C;IACL,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAChB,YAAe,EACf,OAAe,EACf,QAA4B;QAE5B,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,QAAQ,CAAC,SAAS,CAAC,CAAC;aACvB;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,wEAAwE;IACjE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAED,uEAAuE;IAChE,SAAS,CAAC,QAAgB,EAAE,QAAgB;QAC/C,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvC,+EAA+E;YAC/E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,yDAAyD;oBACzD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;4BAC/C,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gCAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;oCACvC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;gCAC5B,CAAC,CAAC,CAAC;4BACP,CAAC,CAAC,CAAC;wBACP,CAAC,CAAC,CAAC;oBACP,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAEO,QAAQ,CAAI,MAAiB,EAAE,MAAc;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,+DAA+D;QAC/D,OAAO,KAAK,KAAK,SAAS;YACtB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACnD,CAAC,CAAC,KAAK,CAAC;IAChB,CAAC;IAEM,QAAQ;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAEM,MAAM,CAAC,IAAI,CAAI,IAAmB;QACrC,OAAO,IAAI,aAAa,CAAI,eAAe,CAAI,IAAI,CAA6B,CAAC,CAAC;IACtF,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { IMatrixReader, IMatrixWriter } from \"@tiny-calc/nano\";\n\n// Build a lookup table that maps a uint8 to the corresponding uint16 where 0s\n// are interleaved between the original bits. (e.g., 1111... -> 01010101...).\n//\n// (Lookup table ~17% faster than inlining the bit-twiddling on Node v12 x64)\n// (Array<T> ~2% faster than typed array on Node v12 x64)\nconst x8ToInterlacedX16 =\n    new Array(256).fill(0).map((value, i) => {\n        let j = i;\n        j = (j | (j << 4)) & 0x0f0f; // .... 7654 .... 3210\n        j = (j | (j << 2)) & 0x3333; // ..76 ..54 ..32 ..10\n        j = (j | (j << 1)) & 0x5555; // .7.6 .5.4 .3.2 .1.0\n        return j;\n    });\n\n// Selects individual bytes from a given 32b integer.  The left shift are used to\n// clear upper bits (faster than using masks on Node 10 x64).\nconst byte0 = (x32: number) => x32 >>> 24;\nconst byte1 = (x32: number) => (x32 << 8) >>> 24;\nconst byte2 = (x32: number) => (x32 << 16) >>> 24;\nconst byte3 = (x32: number) => (x32 << 24) >>> 24;\n\n// Given a uint16 returns the corresponding uint32 integer where 0s are\n// interleaved between the original bits. (e.g., 1111... -> 01010101...).\nconst interlaceBitsX16 = (x16: number) => (x8ToInterlacedX16[byte2(x16)] << 16) | x8ToInterlacedX16[byte3(x16)];\n\nconst r0ToMorton16 = (row: number) => (interlaceBitsX16(row) << 1) >>> 0;\nconst c0ToMorton16 = (col: number) => interlaceBitsX16(col) >>> 0;\n\n// Given a 2D uint16 coordinate returns the corresponding unt32 Morton coded\n// coordinate.  (See https://en.wikipedia.org/wiki/Z-order_curve)\nconst r0c0ToMorton2x16 = (row: number, col: number) => (r0ToMorton16(row) | c0ToMorton16(col)) >>> 0;\n\ntype RecurArrayHelper<T> = RecurArray<T> | T;\ntype RecurArray<T> = RecurArrayHelper<T>[];\n\n/** Undo JSON serialization's coercion of 'undefined' to null. */\nconst nullToUndefined = <T>(array: RecurArray<T | null>): RecurArray<T | undefined> => array.map((value) => {\n    return value === null\n        ? undefined\n        : Array.isArray(value)\n            ? nullToUndefined(value)\n            : value;\n});\n\ntype UA<T> = (T | undefined)[];\n\n/**\n * A sparse 4 billion x 4 billion array stored as 16x16 tiles.\n */\nexport class SparseArray2D<T> implements IMatrixReader<T | undefined>, IMatrixWriter<T | undefined> {\n    constructor(private readonly root: UA<UA<UA<UA<UA<T>>>>> = [undefined]) { }\n\n    public get rowCount() { return 0xFFFFFFFF; }\n    public get colCount() { return 0xFFFFFFFF; }\n\n    public getCell(row: number, col: number): T | undefined {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const level0 = this.root[keyHi];\n        if (level0 !== undefined) {\n            const keyLo = r0c0ToMorton2x16(row, col);\n            const level1 = level0[byte0(keyLo)];\n            if (level1 !== undefined) {\n                const level2 = level1[byte1(keyLo)];\n                if (level2 !== undefined) {\n                    const level3 = level2[byte2(keyLo)];\n                    if (level3 !== undefined) {\n                        return level3[byte3(keyLo)];\n                    }\n                }\n            }\n        }\n\n        return undefined;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n    public get matrixProducer() { return undefined as any; }\n\n    public setCell(row: number, col: number, value: T | undefined) {\n        const keyHi = r0c0ToMorton2x16(row >>> 16, col >>> 16);\n        const keyLo = r0c0ToMorton2x16(row, col);\n\n        const level0 = this.getLevel(this.root, keyHi);\n        const level1 = this.getLevel(level0, byte0(keyLo));\n        const level2 = this.getLevel(level1, byte1(keyLo));\n        const level3 = this.getLevel(level2, byte2(keyLo));\n        level3[byte3(keyLo)] = value;\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated row.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInRow(rowBits: number, callback: (key: number) => void) {\n        for (let col = 0; col < 16; col++) {\n            // Perf: Potentially faster to replace 'c0ToMorton16()' with a short look up table?\n            callback((rowBits | c0ToMorton16(col)) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the given 'callback' for each key in a 16 x 16 tile at the indicated col.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachKeyInCol(col: number, callback: (key: number) => void) {\n        for (let row = 0; row < 16; row++) {\n            // Perf: Potentially faster to replace 'r0ToMorton16()' with a short look up table?\n            callback((r0ToMorton16(row) | col) >>> 0);\n        }\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given row  in the 'currentLevel'.\n     *\n     * (Note that 'rowBits' is the appropriate byte from 'r0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInRow<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        rowBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInRow(rowBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /**\n     * Invokes the give 'callback' with the next 'level' array for each populated region\n     * of the given col in the 'currentLevel'.\n     *\n     * (Note that 'colBits' is the appropriate byte from 'c0ToMorton16' for the current\n     * level being traversed.)\n     */\n    private forEachInCol<V extends UA<any>, U extends UA<V>>(\n        currentLevel: U,\n        colBits: number,\n        callback: (level: V) => void,\n    ) {\n        this.forEachKeyInCol(colBits, (key) => {\n            const nextLevel = currentLevel[key];\n            if (nextLevel !== undefined) {\n                callback(nextLevel);\n            }\n        });\n    }\n\n    /** Clears the all cells contained within the specified span of rows. */\n    public clearRows(rowStart: number, rowCount: number) {\n        const rowEnd = rowStart + rowCount;\n        for (let row = rowStart; row < rowEnd; row++) {\n            const rowHi = r0ToMorton16(row >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let colHi = 0; colHi < 0x10000; colHi++) {\n                const keyHi = (rowHi | c0ToMorton16(colHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const rowLo = r0ToMorton16(row);\n                    this.forEachInRow(level0, byte0(rowLo), (level1) => {\n                        this.forEachInRow(level1, byte1(rowLo), (level2) => {\n                            this.forEachInRow(level2, byte2(rowLo), (level3) => {\n                                this.forEachKeyInRow(byte3(rowLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    /** Clears the all cells contained within the specifed span of cols. */\n    public clearCols(colStart: number, colCount: number) {\n        const colEnd = colStart + colCount;\n        for (let col = colStart; col < colEnd; col++) {\n            const colHi = c0ToMorton16(col >>> 16);\n\n            // The top level of tree is a 64k x 64k tile.  We need to scan all 64k entries.\n            for (let rowHi = 0; rowHi < 0x10000; rowHi++) {\n                const keyHi = (colHi | r0ToMorton16(rowHi)) >>> 0;\n                const level0 = this.root[keyHi];\n                if (level0 !== undefined) {\n                    // The remainder of the tree is divided in 16 x 16 tiles.\n                    const colLo = c0ToMorton16(col);\n                    this.forEachInCol(level0, byte0(colLo), (level1) => {\n                        this.forEachInCol(level1, byte1(colLo), (level2) => {\n                            this.forEachInCol(level2, byte2(colLo), (level3) => {\n                                this.forEachKeyInCol(byte3(colLo), (key) => {\n                                    level3[key] = undefined;\n                                });\n                            });\n                        });\n                    });\n                }\n            }\n        }\n    }\n\n    private getLevel<T>(parent: UA<UA<T>>, subKey: number) {\n        const level = parent[subKey];\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n        return level === undefined\n            ? (parent[subKey] = new Array(256).fill(undefined))\n            : level;\n    }\n\n    public snapshot() {\n        return this.root;\n    }\n\n    public static load<T>(data: RecurArray<T>) {\n        return new SparseArray2D<T>(nullToUndefined<T>(data) as SparseArray2D<T>[\"root\"]);\n    }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fluidframework/matrix",
-  "version": "0.56.7",
+  "version": "0.57.1",
   "description": "Distributed matrix",
   "homepage": "https://fluidframework.com",
   "repository": "https://github.com/microsoft/FluidFramework",
@@ -57,23 +57,23 @@
     "@fluidframework/common-definitions": "^0.20.1",
     "@fluidframework/common-utils": "^0.32.1",
     "@fluidframework/core-interfaces": "^0.42.0",
-    "@fluidframework/datastore-definitions": "^0.56.7",
-    "@fluidframework/merge-tree": "^0.56.7",
+    "@fluidframework/datastore-definitions": "^0.57.1",
+    "@fluidframework/merge-tree": "^0.57.1",
     "@fluidframework/protocol-base": "^0.1034.0",
     "@fluidframework/protocol-definitions": "^0.1026.0",
-    "@fluidframework/runtime-definitions": "^0.56.7",
-    "@fluidframework/runtime-utils": "^0.56.7",
-    "@fluidframework/shared-object-base": "^0.56.7",
-    "@fluidframework/telemetry-utils": "^0.56.7",
+    "@fluidframework/runtime-definitions": "^0.57.1",
+    "@fluidframework/runtime-utils": "^0.57.1",
+    "@fluidframework/shared-object-base": "^0.57.1",
+    "@fluidframework/telemetry-utils": "^0.57.1",
     "@tiny-calc/nano": "0.0.0-alpha.5",
     "tslib": "^1.10.0"
   },
   "devDependencies": {
-    "@fluid-internal/test-dds-utils": "^0.56.7",
+    "@fluid-internal/test-dds-utils": "^0.57.1",
     "@fluidframework/build-common": "^0.23.0",
-    "@fluidframework/eslint-config-fluid": "^0.25.0",
-    "@fluidframework/mocha-test-setup": "^0.56.7",
-    "@fluidframework/test-runtime-utils": "^0.56.7",
+    "@fluidframework/eslint-config-fluid": "^0.26.0",
+    "@fluidframework/mocha-test-setup": "^0.57.1",
+    "@fluidframework/test-runtime-utils": "^0.57.1",
     "@microsoft/api-extractor": "^7.16.1",
     "@rushstack/eslint-config": "^2.5.1",
     "@tiny-calc/micro": "0.0.0-alpha.5",

package/src/handlecache.ts

@@ -125,7 +125,7 @@ export class HandleCache implements IVectorConsumer<Handle> {
 
         const index = this.getIndex(start);
         if (index < this.handles.length) {
-            this.handles.length =  index;
+            this.handles.length = index;
         }
     }
 

package/src/matrix.ts

@@ -232,8 +232,6 @@ export class SharedMatrix<T = any>
     ) {
         if (this.undo !== undefined) {
             let oldValue = this.cells.getCell(rowHandle, colHandle);
-
-            // eslint-disable-next-line no-null/no-null
             if (oldValue === null) {
                 oldValue = undefined;
             }
@@ -362,7 +360,6 @@ export class SharedMatrix<T = any>
             for (let col = 0; col < this.colCount; col++) {
                 const colHandle = this.colHandles.getHandle(col);
                 const value = this.cells.getCell(rowHandle, colHandle);
-                // eslint-disable-next-line no-null/no-null
                 if (this.isAttached() && value !== undefined && value !== null) {
                     this.sendSetCellOp(
                         row,
@@ -406,7 +403,6 @@ export class SharedMatrix<T = any>
             for (let row = 0; row < this.rowCount; row++) {
                 const rowHandle = this.rowHandles.getHandle(row);
                 const value = this.cells.getCell(rowHandle, colHandle);
-                // eslint-disable-next-line no-null/no-null
                 if (this.isAttached() && value !== undefined && value !== null) {
                     this.sendSetCellOp(
                         row,
@@ -621,11 +617,6 @@ export class SharedMatrix<T = any>
         }
     }
 
-    protected registerCore() {
-        this.rows.startOrUpdateCollaboration(this.runtime.clientId, 0);
-        this.cols.startOrUpdateCollaboration(this.runtime.clientId, 0);
-    }
-
     // Invoked by PermutationVector to notify IMatrixConsumers of row insertion/deletions.
     private readonly onRowDelta = (position: number, removedCount: number, insertedCount: number) => {
         for (const consumer of this.consumers) {

package/src/packageVersion.ts

@@ -6,4 +6,4 @@
  */
 
 export const pkgName = "@fluidframework/matrix";
-export const pkgVersion = "0.56.7";
+export const pkgVersion = "0.57.1";

package/src/sparsearray2d.ts

@@ -44,7 +44,6 @@ type RecurArray<T> = RecurArrayHelper<T>[];
 
 /** Undo JSON serialization's coercion of 'undefined' to null. */
 const nullToUndefined = <T>(array: RecurArray<T | null>): RecurArray<T | undefined> => array.map((value) => {
-    // eslint-disable-next-line no-null/no-null
     return value === null
         ? undefined
         : Array.isArray(value)