@fluid-experimental/tree 0.58.2002 → 0.59.1000

package/lib/test/HistoryEditFactory.tests.js

@@ -0,0 +1,90 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { revert } from '../HistoryEditFactory';
+import { ChangeInternal, Side, StablePlaceInternal, StableRangeInternal } from '../persisted-types';
+import { expectDefined } from './utilities/TestCommon';
+import { refreshTestTree } from './utilities/TestUtilities';
+describe('revert', () => {
+    const testTree = refreshTestTree();
+    it('can revert a single detached node', () => {
+        const firstDetachedId = 0;
+        const node = testTree.buildLeafInternal();
+        const firstBuild = ChangeInternal.build([node], firstDetachedId);
+        const insertedNodeId = 1;
+        const insertedBuild = ChangeInternal.build([firstDetachedId], insertedNodeId);
+        const insertChange = ChangeInternal.insert(insertedNodeId, {
+            referenceTrait: testTree.left.traitLocation,
+            side: Side.After,
+        });
+        const result = expectDefined(revert([firstBuild, insertedBuild, insertChange], testTree.view));
+        expect(result.length).to.equal(1);
+        const revertedChange = result[0];
+        expect(revertedChange.source.start.referenceSibling).to.deep.equal(node.identifier);
+        expect(revertedChange.source.end.referenceSibling).to.deep.equal(node.identifier);
+    });
+    it('can revert multiple detached nodes', () => {
+        const firstDetachedId = 0;
+        const firstNode = testTree.buildLeafInternal();
+        const firstBuild = ChangeInternal.build([firstNode], firstDetachedId);
+        const secondDetachedId = 1;
+        const secondNode = testTree.buildLeafInternal();
+        const secondBuild = ChangeInternal.build([secondNode], secondDetachedId);
+        const insertedNodeId = 2;
+        const insertedBuild = ChangeInternal.build([firstDetachedId, secondDetachedId], insertedNodeId);
+        const insertChange = ChangeInternal.insert(insertedNodeId, {
+            referenceTrait: testTree.left.traitLocation,
+            side: Side.After,
+        });
+        const result = expectDefined(revert([firstBuild, secondBuild, insertedBuild, insertChange], testTree.view));
+        expect(result.length).to.equal(1);
+        const revertedChange = result[0];
+        expect(revertedChange.source.start.referenceSibling).to.deep.equal(firstNode.identifier);
+        expect(revertedChange.source.end.referenceSibling).to.deep.equal(secondNode.identifier);
+    });
+    describe('returns undefined for reverts that require more context than the view directly before the edit', () => {
+        describe('because the edit conflicted', () => {
+            it('when reverting a detach of a node that is not in the tree', () => {
+                const nodeNotInTree = testTree.buildLeafInternal();
+                const change = ChangeInternal.detach(StableRangeInternal.only(nodeNotInTree));
+                const result = revert([change], testTree.view);
+                expect(result).to.be.undefined;
+            });
+            it('when reverting a set value of a node that is not in the tree', () => {
+                const nodeNotInTree = testTree.buildLeafInternal();
+                const change = ChangeInternal.setPayload(nodeNotInTree, '42');
+                const result = revert([change], testTree.view);
+                expect(result).to.be.undefined;
+            });
+        });
+        describe('because the edit was malformed', () => {
+            it('when reverting an insert whose source is not insertable', () => {
+                const detachedId = 0;
+                // Revert an insert where the source is not a valid detached sequence ID (nothing has been built/detached with that ID)
+                expect(revert([ChangeInternal.insert(detachedId, StablePlaceInternal.atStartOf(testTree.left.traitLocation))], testTree.view)).to.be.undefined;
+                // Revert a duplicate insert (the source has already been inserted by a previous insert in the same edit)
+                expect(revert([
+                    ChangeInternal.build([testTree.buildLeafInternal()], detachedId),
+                    ChangeInternal.insert(detachedId, StablePlaceInternal.atStartOf(testTree.left.traitLocation)),
+                    ChangeInternal.insert(detachedId, StablePlaceInternal.atStartOf(testTree.left.traitLocation)),
+                ], testTree.view)).to.be.undefined;
+            });
+            it('when reverting a detach whose destination is already occupied', () => {
+                const detachedId = 0;
+                // Revert a detach where the destination is already occupied due to a prior detach
+                expect(revert([
+                    ChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId),
+                    ChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId),
+                ], testTree.view)).to.be.undefined;
+                // Revert a detach where the destination is already occupied due to a prior build
+                expect(revert([
+                    ChangeInternal.build([testTree.buildLeafInternal()], detachedId),
+                    ChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId),
+                ], testTree.view)).to.be.undefined;
+            });
+        });
+    });
+});
+//# sourceMappingURL=HistoryEditFactory.tests.js.map

package/lib/test/HistoryEditFactory.tests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HistoryEditFactory.tests.js","sourceRoot":"","sources":["../../src/test/HistoryEditFactory.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAE/C,OAAO,EAAE,cAAc,EAAkB,IAAI,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACpH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACvB,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,eAAe,GAAG,CAAuB,CAAC;QAChD,MAAM,IAAI,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;QAC1C,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,CAAC;QACjE,MAAM,cAAc,GAAG,CAAuB,CAAC;QAC/C,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,cAAc,CAAC,CAAC;QAC9E,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC,cAAc,EAAE;YAC1D,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;YAC3C,IAAI,EAAE,IAAI,CAAC,KAAK;SAChB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/F,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,cAAc,GAAG,MAAM,CAAC,CAAC,CAAmB,CAAC;QACnD,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpF,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,eAAe,GAAG,CAAuB,CAAC;QAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;QAC/C,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,eAAe,CAAC,CAAC;QACtE,MAAM,gBAAgB,GAAG,CAAuB,CAAC;QACjD,MAAM,UAAU,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACzE,MAAM,cAAc,GAAG,CAAuB,CAAC;QAC/C,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,EAAE,gBAAgB,CAAC,EAAE,cAAc,CAAC,CAAC;QAChG,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC,cAAc,EAAE;YAC1D,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;YAC3C,IAAI,EAAE,IAAI,CAAC,KAAK;SAChB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5G,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,cAAc,GAAG,MAAM,CAAC,CAAC,CAAmB,CAAC;QACnD,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACzF,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gGAAgG,EAAE,GAAG,EAAE;QAC/G,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;YAC5C,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;gBACpE,MAAM,aAAa,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;gBAC9E,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAChC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;gBACvE,MAAM,aAAa,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,cAAc,CAAC,UAAU,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;gBAC9D,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAChC,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC/C,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;gBAClE,MAAM,UAAU,GAAG,CAAuB,CAAC;gBAC3C,uHAAuH;gBACvH,MAAM,CACL,MAAM,CACL,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAC/F,QAAQ,CAAC,IAAI,CACb,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClB,yGAAyG;gBACzG,MAAM,CACL,MAAM,CACL;oBACC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,UAAU,CAAC;oBAChE,cAAc,CAAC,MAAM,CACpB,UAAU,EACV,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D;oBACD,cAAc,CAAC,MAAM,CACpB,UAAU,EACV,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D;iBACD,EACD,QAAQ,CAAC,IAAI,CACb,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YACnB,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;gBACxE,MAAM,UAAU,GAAG,CAAuB,CAAC;gBAC3C,kFAAkF;gBAClF,MAAM,CACL,MAAM,CACL;oBACC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;oBAC1E,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;iBAC1E,EACD,QAAQ,CAAC,IAAI,CACb,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClB,iFAAiF;gBACjF,MAAM,CACL,MAAM,CACL;oBACC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,UAAU,CAAC;oBAChE,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;iBAC1E,EACD,QAAQ,CAAC,IAAI,CACb,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YACnB,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { revert } from '../HistoryEditFactory';\nimport { DetachedSequenceId } from '../Identifiers';\nimport { ChangeInternal, DetachInternal, Side, StablePlaceInternal, StableRangeInternal } from '../persisted-types';\nimport { expectDefined } from './utilities/TestCommon';\nimport { refreshTestTree } from './utilities/TestUtilities';\n\ndescribe('revert', () => {\n\tconst testTree = refreshTestTree();\n\n\tit('can revert a single detached node', () => {\n\t\tconst firstDetachedId = 0 as DetachedSequenceId;\n\t\tconst node = testTree.buildLeafInternal();\n\t\tconst firstBuild = ChangeInternal.build([node], firstDetachedId);\n\t\tconst insertedNodeId = 1 as DetachedSequenceId;\n\t\tconst insertedBuild = ChangeInternal.build([firstDetachedId], insertedNodeId);\n\t\tconst insertChange = ChangeInternal.insert(insertedNodeId, {\n\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\tside: Side.After,\n\t\t});\n\t\tconst result = expectDefined(revert([firstBuild, insertedBuild, insertChange], testTree.view));\n\t\texpect(result.length).to.equal(1);\n\t\tconst revertedChange = result[0] as DetachInternal;\n\t\texpect(revertedChange.source.start.referenceSibling).to.deep.equal(node.identifier);\n\t\texpect(revertedChange.source.end.referenceSibling).to.deep.equal(node.identifier);\n\t});\n\n\tit('can revert multiple detached nodes', () => {\n\t\tconst firstDetachedId = 0 as DetachedSequenceId;\n\t\tconst firstNode = testTree.buildLeafInternal();\n\t\tconst firstBuild = ChangeInternal.build([firstNode], firstDetachedId);\n\t\tconst secondDetachedId = 1 as DetachedSequenceId;\n\t\tconst secondNode = testTree.buildLeafInternal();\n\t\tconst secondBuild = ChangeInternal.build([secondNode], secondDetachedId);\n\t\tconst insertedNodeId = 2 as DetachedSequenceId;\n\t\tconst insertedBuild = ChangeInternal.build([firstDetachedId, secondDetachedId], insertedNodeId);\n\t\tconst insertChange = ChangeInternal.insert(insertedNodeId, {\n\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\tside: Side.After,\n\t\t});\n\t\tconst result = expectDefined(revert([firstBuild, secondBuild, insertedBuild, insertChange], testTree.view));\n\t\texpect(result.length).to.equal(1);\n\t\tconst revertedChange = result[0] as DetachInternal;\n\t\texpect(revertedChange.source.start.referenceSibling).to.deep.equal(firstNode.identifier);\n\t\texpect(revertedChange.source.end.referenceSibling).to.deep.equal(secondNode.identifier);\n\t});\n\n\tdescribe('returns undefined for reverts that require more context than the view directly before the edit', () => {\n\t\tdescribe('because the edit conflicted', () => {\n\t\t\tit('when reverting a detach of a node that is not in the tree', () => {\n\t\t\t\tconst nodeNotInTree = testTree.buildLeafInternal();\n\t\t\t\tconst change = ChangeInternal.detach(StableRangeInternal.only(nodeNotInTree));\n\t\t\t\tconst result = revert([change], testTree.view);\n\t\t\t\texpect(result).to.be.undefined;\n\t\t\t});\n\n\t\t\tit('when reverting a set value of a node that is not in the tree', () => {\n\t\t\t\tconst nodeNotInTree = testTree.buildLeafInternal();\n\t\t\t\tconst change = ChangeInternal.setPayload(nodeNotInTree, '42');\n\t\t\t\tconst result = revert([change], testTree.view);\n\t\t\t\texpect(result).to.be.undefined;\n\t\t\t});\n\t\t});\n\n\t\tdescribe('because the edit was malformed', () => {\n\t\t\tit('when reverting an insert whose source is not insertable', () => {\n\t\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\t\t// Revert an insert where the source is not a valid detached sequence ID (nothing has been built/detached with that ID)\n\t\t\t\texpect(\n\t\t\t\t\trevert(\n\t\t\t\t\t\t[ChangeInternal.insert(detachedId, StablePlaceInternal.atStartOf(testTree.left.traitLocation))],\n\t\t\t\t\t\ttestTree.view\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t\t// Revert a duplicate insert (the source has already been inserted by a previous insert in the same edit)\n\t\t\t\texpect(\n\t\t\t\t\trevert(\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\tChangeInternal.build([testTree.buildLeafInternal()], detachedId),\n\t\t\t\t\t\t\tChangeInternal.insert(\n\t\t\t\t\t\t\t\tdetachedId,\n\t\t\t\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\tChangeInternal.insert(\n\t\t\t\t\t\t\t\tdetachedId,\n\t\t\t\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t],\n\t\t\t\t\t\ttestTree.view\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t});\n\n\t\t\tit('when reverting a detach whose destination is already occupied', () => {\n\t\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\t\t// Revert a detach where the destination is already occupied due to a prior detach\n\t\t\t\texpect(\n\t\t\t\t\trevert(\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId),\n\t\t\t\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId),\n\t\t\t\t\t\t],\n\t\t\t\t\t\ttestTree.view\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t\t// Revert a detach where the destination is already occupied due to a prior build\n\t\t\t\texpect(\n\t\t\t\t\trevert(\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\tChangeInternal.build([testTree.buildLeafInternal()], detachedId),\n\t\t\t\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId),\n\t\t\t\t\t\t],\n\t\t\t\t\t\ttestTree.view\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t});\n\t\t});\n\t});\n});\n"]}

package/lib/test/IdCompressor.perf.tests.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=IdCompressor.perf.tests.d.ts.map

package/lib/test/IdCompressor.perf.tests.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IdCompressor.perf.tests.d.ts","sourceRoot":"","sources":["../../src/test/IdCompressor.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/IdCompressor.perf.tests.js

@@ -0,0 +1,304 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
+import { v4 } from 'uuid';
+import { fail } from '../Common';
+import { defaultClusterCapacity, IdCompressor, isFinalId, isLocalId, } from '../id-compressor/IdCompressor';
+import { createSessionId, numericUuidFromStableId, stableIdFromNumericUuid } from '../id-compressor/NumericUuid';
+import { Client, IdCompressorTestNetwork, performFuzzActions, sessionIds, } from './utilities/IdCompressorTestUtilities';
+describe('IdCompressor Perf', () => {
+    const type = BenchmarkType.Measurement;
+    const localClient = Client.Client1;
+    const remoteClient = Client.Client2;
+    let compressor;
+    let remoteCompressor;
+    function setupCompressors(clusterSize, allowLocal, includeOverrides) {
+        const network = new IdCompressorTestNetwork(clusterSize);
+        [compressor] = createPerfCompressor(network, allowLocal, includeOverrides, localClient);
+        [remoteCompressor] = createPerfCompressor(network, allowLocal, includeOverrides, remoteClient);
+        return network;
+    }
+    function createPerfCompressor(network, allowLocal, includeOverrides, client) {
+        performFuzzActions(network, Math.E, includeOverrides, client, allowLocal ? false : true);
+        return [network.getCompressorUnsafe(client), network.getIdLog(client)];
+    }
+    function setupCompressorWithId(local, override, clusterHasOtherOverrides) {
+        const clusterCapacity = defaultClusterCapacity;
+        const network = setupCompressors(clusterCapacity, true, true);
+        if (!clusterHasOtherOverrides) {
+            network.allocateAndSendIds(localClient, clusterCapacity);
+        }
+        else {
+            network.allocateAndSendIds(localClient, 2, {
+                0: 'override1',
+                1: 'override2',
+            });
+        }
+        if (override) {
+            network.allocateAndSendIds(localClient, 1, { 0: 'override3' });
+        }
+        else {
+            network.allocateAndSendIds(localClient, 1);
+        }
+        if (!local) {
+            network.deliverOperations(localClient);
+        }
+        const ids = network.getIdLog(localClient);
+        const lastId = ids[ids.length - 1].id;
+        return lastId;
+    }
+    function benchmarkWithIdTypes(creator) {
+        for (const local of [true, false]) {
+            for (const override of [true, false]) {
+                const titleSuffix = ` (${override ? 'override' : 'sequential'})`;
+                creator(local, override, titleSuffix);
+            }
+        }
+    }
+    [true, false].forEach((isLocal) => {
+        let range;
+        let sessionId;
+        const numIds = 100;
+        const clusterSize = Math.round(numIds / 2);
+        const setupRange = (isLocal) => {
+            setupCompressors(clusterSize, true, false);
+            const originCompressor = isLocal ? compressor : remoteCompressor;
+            sessionId = originCompressor.localSessionId;
+            range = originCompressor.generateCompressedIdRange(numIds);
+            const creationRange = originCompressor.takeNextCreationRange();
+            compressor.finalizeCreationRange(creationRange);
+        };
+        const beforeLocal = () => setupRange(false);
+        const beforeRemote = () => setupRange(true);
+        benchmark({
+            type,
+            title: `get ${numIds} sequential IDs for a ${isLocal ? 'local' : 'remote'} range`,
+            before: isLocal ? beforeLocal : beforeRemote,
+            benchmarkFn: () => {
+                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                const ids = compressor.getIdsFromRange(range, sessionId);
+                for (let i = 0; i < numIds; i++) {
+                    ids.get(i); // get a sequential ID
+                }
+            },
+        });
+    });
+    [true, false].forEach((override) => {
+        const numericSource = numericUuidFromStableId(createSessionId());
+        let overrideIndex = 0;
+        benchmark({
+            type,
+            title: `allocate local ID (${override ? 'override' : 'sequential'})`,
+            before: () => {
+                setupCompressors(defaultClusterCapacity, true, false);
+            },
+            benchmarkFn: () => {
+                compressor.generateCompressedId(override ? stableIdFromNumericUuid(numericSource, overrideIndex++) : undefined);
+            },
+        });
+    });
+    [true, false].forEach((override) => {
+        for (const clusterSize of [1, 10, 500, 1000]) {
+            const overrideCount = 3;
+            const numIds = 7;
+            const session1 = '8150a099-5302-4672-b5f3-7a4492b59418';
+            const session2 = 'f2ded886-92da-4248-967b-eb96ee04cf51';
+            let session = session1;
+            let lastFinalizedLocalId1 = 0;
+            let lastFinalizedLocalId2 = 0;
+            let overrideIndex = 0;
+            benchmark({
+                type,
+                title: `finalize a range of IDs (cluster size =${clusterSize}${override ? ', overrides present' : ''})`,
+                before: () => {
+                    setupCompressors(clusterSize, false, false);
+                },
+                benchmarkFn: () => {
+                    // Create a range with as minimal overhead as possible, as we'd like for this code to not exist
+                    // in the timing loop at all (but benchmark forces us to do so)
+                    const isLocal = session === session1;
+                    const first = ((isLocal ? lastFinalizedLocalId1 : lastFinalizedLocalId2) - 1);
+                    let overrides;
+                    const actualOverrideCount = override ? overrideCount : 0;
+                    if (actualOverrideCount > 0) {
+                        overrides = [];
+                        for (let i = 0; i < actualOverrideCount; i++) {
+                            overrides.push([
+                                (first - i),
+                                `override${overrideIndex++}`,
+                            ]);
+                        }
+                    }
+                    const last = (first - numIds);
+                    const range = {
+                        sessionId: session,
+                        ids: {
+                            first,
+                            last,
+                            overrides,
+                        },
+                    };
+                    compressor.finalizeCreationRange(range);
+                    if (isLocal) {
+                        lastFinalizedLocalId1 = last;
+                    }
+                    else {
+                        lastFinalizedLocalId2 = last;
+                    }
+                    // Alternate clients to sidestep optimization that packs them all into last cluster
+                    session = isLocal ? session1 : session2;
+                },
+            });
+        }
+    });
+    [true, false].forEach((override) => {
+        const idCount = 5;
+        benchmark({
+            type,
+            title: `creates an ID range (${override ? 'with overrides' : ''})`,
+            before: () => {
+                setupCompressors(defaultClusterCapacity, true, false);
+            },
+            benchmarkFn: () => {
+                if (override) {
+                    compressor.generateCompressedId(v4());
+                }
+                compressor.generateCompressedIdRange(idCount);
+                compressor.takeNextCreationRange();
+            },
+        });
+    });
+    benchmarkWithIdTypes((local, override, titleSuffix) => {
+        let idToDecompress;
+        const before = () => {
+            idToDecompress = setupCompressorWithId(local, override, true);
+        };
+        const benchmarkFn = () => {
+            compressor.decompress(idToDecompress);
+        };
+        if (local) {
+            benchmark({
+                type,
+                title: `decompress local ID into stable IDs${titleSuffix}`,
+                before,
+                benchmarkFn,
+            });
+        }
+        else {
+            const titleBase = 'decompress final ID into stable IDs';
+            if (override) {
+                benchmark({
+                    type,
+                    title: titleBase + titleSuffix,
+                    before,
+                    benchmarkFn,
+                });
+            }
+            else {
+                for (const clusterHasOverride of [true, false]) {
+                    benchmark({
+                        type,
+                        title: `${titleBase} (sequential, overrides ${clusterHasOverride ? 'present' : 'not present'} in owning cluster)`,
+                        before: () => {
+                            idToDecompress = setupCompressorWithId(local, override, clusterHasOverride);
+                        },
+                        benchmarkFn,
+                    });
+                }
+            }
+        }
+    });
+    benchmarkWithIdTypes((local, override, titleSuffix) => {
+        let stableToCompress;
+        benchmark({
+            type,
+            title: `compress a stable ID to a ${local ? 'local' : 'final'} ID${titleSuffix}`,
+            before: () => {
+                const idAdded = setupCompressorWithId(local, override, true);
+                stableToCompress = compressor.decompress(idAdded);
+            },
+            benchmarkFn: () => {
+                compressor.recompress(stableToCompress);
+            },
+        });
+    });
+    let final;
+    benchmark({
+        type,
+        title: `normalize a final ID from the local session to session space`,
+        before: () => {
+            const network = setupCompressors(defaultClusterCapacity, true, true);
+            network.allocateAndSendIds(localClient, 1);
+            network.deliverOperations(localClient);
+            const log = network.getSequencedIdLog(localClient);
+            const id = compressor.normalizeToOpSpace(log[log.length - 1].id);
+            final = isFinalId(id) ? id : fail('not a final ID');
+        },
+        benchmarkFn: () => {
+            compressor.normalizeToSessionSpace(final, compressor.localSessionId);
+        },
+    });
+    let localId;
+    benchmark({
+        type,
+        title: `normalize a local ID from the local session to session space`,
+        before: () => {
+            const network = setupCompressors(defaultClusterCapacity, true, true);
+            network.allocateAndSendIds(localClient, 1);
+            network.deliverOperations(localClient);
+            const log = network.getIdLog(localClient);
+            const id = log[log.length - 1].id;
+            localId = isLocalId(id) ? id : fail('not a local ID');
+        },
+        benchmarkFn: () => {
+            compressor.normalizeToOpSpace(localId);
+        },
+    });
+    const remoteSessionId = sessionIds.get(remoteClient);
+    let opSpaceId;
+    benchmark({
+        type,
+        title: `normalize a local ID from a remote session to session space`,
+        before: () => {
+            const network = setupCompressors(defaultClusterCapacity, true, true);
+            network.allocateAndSendIds(remoteClient, 1);
+            const log = network.getIdLog(remoteClient);
+            const id = remoteCompressor.normalizeToOpSpace(log[log.length - 1].id);
+            opSpaceId = isLocalId(id) ? id : fail('not a local ID');
+            // Ensure id is finalized on local compressor
+            network.deliverOperations(localClient);
+        },
+        benchmarkFn: () => {
+            compressor.normalizeToSessionSpace(opSpaceId !== null && opSpaceId !== void 0 ? opSpaceId : fail(), remoteSessionId);
+        },
+    });
+    for (const overrideInClusters of [true, false]) {
+        const titleSuffix = ` (${overrideInClusters ? 'with' : 'without'} overrides)`;
+        benchmark({
+            type,
+            title: `serialize an IdCompressor${titleSuffix}`,
+            before: () => {
+                setupCompressors(defaultClusterCapacity, false, overrideInClusters);
+            },
+            benchmarkFn: () => {
+                compressor.serialize(false);
+            },
+        });
+        let serialized;
+        const remoteSessionId = createSessionId();
+        benchmark({
+            type,
+            title: `deserialize an IdCompressor${titleSuffix}`,
+            before: () => {
+                setupCompressors(defaultClusterCapacity, false, overrideInClusters);
+                serialized = compressor.serialize(false);
+            },
+            benchmarkFn: () => {
+                IdCompressor.deserialize(serialized, remoteSessionId);
+            },
+        });
+    }
+});
+//# sourceMappingURL=IdCompressor.perf.tests.js.map

package/lib/test/IdCompressor.perf.tests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IdCompressor.perf.tests.js","sourceRoot":"","sources":["../../src/test/IdCompressor.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAC1B,OAAO,EAAE,IAAI,EAAW,MAAM,WAAW,CAAC;AAC1C,OAAO,EACN,sBAAsB,EACtB,YAAY,EAEZ,SAAS,EACT,SAAS,GACT,MAAM,+BAA+B,CAAC;AAEvC,OAAO,EAAE,eAAe,EAAE,uBAAuB,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AASjH,OAAO,EACN,MAAM,EACN,uBAAuB,EACvB,kBAAkB,EAClB,UAAU,GAEV,MAAM,uCAAuC,CAAC;AAE/C,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC,MAAM,IAAI,GAAG,aAAa,CAAC,WAAW,CAAC;IACvC,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC;IACnC,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC;IACpC,IAAI,UAAwB,CAAC;IAC7B,IAAI,gBAA8B,CAAC;IAEnC,SAAS,gBAAgB,CACxB,WAAmB,EACnB,UAAmB,EACnB,gBAAyB;QAEzB,MAAM,OAAO,GAAG,IAAI,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACzD,CAAC,UAAU,CAAC,GAAG,oBAAoB,CAAC,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,WAAW,CAAC,CAAC;QACxF,CAAC,gBAAgB,CAAC,GAAG,oBAAoB,CAAC,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,YAAY,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,SAAS,oBAAoB,CAC5B,OAAgC,EAChC,UAAmB,EACnB,gBAAyB,EACzB,MAAc;QAEd,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,gBAAgB,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzF,OAAO,CAAC,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,SAAS,qBAAqB,CAAC,KAAc,EAAE,QAAiB,EAAE,wBAAiC;QAClG,MAAM,eAAe,GAAG,sBAAsB,CAAC;QAC/C,MAAM,OAAO,GAAG,gBAAgB,CAAC,eAAe,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9D,IAAI,CAAC,wBAAwB,EAAE;YAC9B,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;SACzD;aAAM;YACN,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,CAAC,EAAE;gBAC1C,CAAC,EAAE,WAAW;gBACd,CAAC,EAAE,WAAW;aACd,CAAC,CAAC;SACH;QACD,IAAI,QAAQ,EAAE;YACb,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC;SAC/D;aAAM;YACN,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;SAC3C;QAED,IAAI,CAAC,KAAK,EAAE;YACX,OAAO,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;SACvC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,OAAO,MAAM,CAAC;IACf,CAAC;IAED,SAAS,oBAAoB,CAAC,OAAyE;QACtG,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;YAClC,KAAK,MAAM,QAAQ,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;gBACrC,MAAM,WAAW,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC;gBACjE,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;aACtC;SACD;IACF,CAAC;IAED,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QACjC,IAAI,KAAkD,CAAC;QACvD,IAAI,SAAoB,CAAC;QACzB,MAAM,MAAM,GAAG,GAAG,CAAC;QACnB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,CAAC,OAAgB,EAAE,EAAE;YACvC,gBAAgB,CAAC,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC3C,MAAM,gBAAgB,GAAG,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC;YACjE,SAAS,GAAG,gBAAgB,CAAC,cAAc,CAAC;YAC5C,KAAK,GAAG,gBAAgB,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YAC3D,MAAM,aAAa,GAAG,gBAAgB,CAAC,qBAAqB,EAAE,CAAC;YAC/D,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QACjD,CAAC,CAAC;QACF,MAAM,WAAW,GAAG,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,YAAY,GAAG,GAAG,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC5C,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,OAAO,MAAM,yBAAyB,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,QAAQ;YACjF,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY;YAC5C,WAAW,EAAE,GAAG,EAAE;gBACjB,oEAAoE;gBACpE,MAAM,GAAG,GAAG,UAAU,CAAC,eAAe,CAAC,KAAM,EAAE,SAAU,CAAC,CAAC;gBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;oBAChC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB;iBAClC;YACF,CAAC;SACD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;QAClC,MAAM,aAAa,GAAG,uBAAuB,CAAC,eAAe,EAAE,CAAC,CAAC;QACjE,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,sBAAsB,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,GAAG;YACpE,MAAM,EAAE,GAAG,EAAE;gBACZ,gBAAgB,CAAC,sBAAsB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACvD,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,UAAU,CAAC,oBAAoB,CAC9B,QAAQ,CAAC,CAAC,CAAC,uBAAuB,CAAC,aAAa,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAC9E,CAAC;YACH,CAAC;SACD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;QAClC,KAAK,MAAM,WAAW,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;YAC7C,MAAM,aAAa,GAAG,CAAC,CAAC;YACxB,MAAM,MAAM,GAAG,CAAC,CAAC;YACjB,MAAM,QAAQ,GAAG,sCAAmD,CAAC;YACrE,MAAM,QAAQ,GAAG,sCAAmD,CAAC;YACrE,IAAI,OAAO,GAAc,QAAQ,CAAC;YAClC,IAAI,qBAAqB,GAAG,CAAsB,CAAC;YACnD,IAAI,qBAAqB,GAAG,CAAsB,CAAC;YACnD,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,SAAS,CAAC;gBACT,IAAI;gBACJ,KAAK,EAAE,0CAA0C,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,EAAE,GAAG;gBACvG,MAAM,EAAE,GAAG,EAAE;oBACZ,gBAAgB,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC7C,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,+FAA+F;oBAC/F,+DAA+D;oBAC/D,MAAM,OAAO,GAAG,OAAO,KAAK,QAAQ,CAAC;oBACrC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,CAAC,GAAG,CAAC,CACxD,CAAC;oBACrB,IAAI,SAAyD,CAAC;oBAC9D,MAAM,mBAAmB,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzD,IAAI,mBAAmB,GAAG,CAAC,EAAE;wBAC5B,SAAS,GAAG,EAAmD,CAAC;wBAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,EAAE,CAAC,EAAE,EAAE;4BAC7C,SAAS,CAAC,IAAI,CAAC;gCACd,CAAC,KAAK,GAAG,CAAC,CAA4C;gCACtD,WAAW,aAAa,EAAE,EAAE;6BAC5B,CAAC,CAAC;yBACH;qBACD;oBAED,MAAM,IAAI,GAAG,CAAC,KAAK,GAAG,MAAM,CAAmB,CAAC;oBAChD,MAAM,KAAK,GAAoB;wBAC9B,SAAS,EAAE,OAAO;wBAClB,GAAG,EAAE;4BACJ,KAAK;4BACL,IAAI;4BACJ,SAAS;yBACT;qBACD,CAAC;oBAEF,UAAU,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;oBAExC,IAAI,OAAO,EAAE;wBACZ,qBAAqB,GAAG,IAAI,CAAC;qBAC7B;yBAAM;wBACN,qBAAqB,GAAG,IAAI,CAAC;qBAC7B;oBACD,mFAAmF;oBACnF,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACzC,CAAC;aACD,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;QAClC,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,wBAAwB,QAAQ,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,GAAG;YAClE,MAAM,EAAE,GAAG,EAAE;gBACZ,gBAAgB,CAAC,sBAAsB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACvD,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,IAAI,QAAQ,EAAE;oBACb,UAAU,CAAC,oBAAoB,CAAC,EAAE,EAAE,CAAC,CAAC;iBACtC;gBACD,UAAU,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;gBAC9C,UAAU,CAAC,qBAAqB,EAAE,CAAC;YACpC,CAAC;SACD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,oBAAoB,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE;QACrD,IAAI,cAA6B,CAAC;QAClC,MAAM,MAAM,GAAG,GAAG,EAAE;YACnB,cAAc,GAAG,qBAAqB,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/D,CAAC,CAAC;QACF,MAAM,WAAW,GAAG,GAAG,EAAE;YACxB,UAAU,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;QACvC,CAAC,CAAC;QACF,IAAI,KAAK,EAAE;YACV,SAAS,CAAC;gBACT,IAAI;gBACJ,KAAK,EAAE,sCAAsC,WAAW,EAAE;gBAC1D,MAAM;gBACN,WAAW;aACX,CAAC,CAAC;SACH;aAAM;YACN,MAAM,SAAS,GAAG,qCAAqC,CAAC;YACxD,IAAI,QAAQ,EAAE;gBACb,SAAS,CAAC;oBACT,IAAI;oBACJ,KAAK,EAAE,SAAS,GAAG,WAAW;oBAC9B,MAAM;oBACN,WAAW;iBACX,CAAC,CAAC;aACH;iBAAM;gBACN,KAAK,MAAM,kBAAkB,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;oBAC/C,SAAS,CAAC;wBACT,IAAI;wBACJ,KAAK,EAAE,GAAG,SAAS,2BAClB,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,aAClC,qBAAqB;wBACrB,MAAM,EAAE,GAAG,EAAE;4BACZ,cAAc,GAAG,qBAAqB,CAAC,KAAK,EAAE,QAAQ,EAAE,kBAAkB,CAAC,CAAC;wBAC7E,CAAC;wBACD,WAAW;qBACX,CAAC,CAAC;iBACH;aACD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,oBAAoB,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE;QACrD,IAAI,gBAAyB,CAAC;QAC9B,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,6BAA6B,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,MAAM,WAAW,EAAE;YAChF,MAAM,EAAE,GAAG,EAAE;gBACZ,MAAM,OAAO,GAAG,qBAAqB,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;gBAC7D,gBAAgB,GAAG,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACnD,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,UAAU,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;YACzC,CAAC;SACD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,KAAyB,CAAC;IAC9B,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,8DAA8D;QACrE,MAAM,EAAE,GAAG,EAAE;YACZ,MAAM,OAAO,GAAG,gBAAgB,CAAC,sBAAsB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACrE,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC3C,OAAO,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;YACvC,MAAM,GAAG,GAAG,OAAO,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,UAAU,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjE,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACrD,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,UAAU,CAAC,uBAAuB,CAAC,KAAK,EAAE,UAAU,CAAC,cAAc,CAAC,CAAC;QACtE,CAAC;KACD,CAAC,CAAC;IAEH,IAAI,OAA2B,CAAC;IAChC,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,8DAA8D;QACrE,MAAM,EAAE,GAAG,EAAE;YACZ,MAAM,OAAO,GAAG,gBAAgB,CAAC,sBAAsB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACrE,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC3C,OAAO,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;YACvC,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAC1C,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,OAAO,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACvD,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,UAAU,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;KACD,CAAC,CAAC;IAEH,MAAM,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IACrD,IAAI,SAA0C,CAAC;IAC/C,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,6DAA6D;QACpE,MAAM,EAAE,GAAG,EAAE;YACZ,MAAM,OAAO,GAAG,gBAAgB,CAAC,sBAAsB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACrE,OAAO,CAAC,kBAAkB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,gBAAgB,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACvE,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACxD,6CAA6C;YAC7C,OAAO,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;QACxC,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,UAAU,CAAC,uBAAuB,CAAC,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,IAAI,EAAE,EAAE,eAAe,CAAC,CAAC;QAC1E,CAAC;KACD,CAAC,CAAC;IAEH,KAAK,MAAM,kBAAkB,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;QAC/C,MAAM,WAAW,GAAG,KAAK,kBAAkB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,aAAa,CAAC;QAC9E,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,4BAA4B,WAAW,EAAE;YAChD,MAAM,EAAE,GAAG,EAAE;gBACZ,gBAAgB,CAAC,sBAAsB,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC;YACrE,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,UAAgD,CAAC;QACrD,MAAM,eAAe,GAAG,eAAe,EAAE,CAAC;QAC1C,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,8BAA8B,WAAW,EAAE;YAClD,MAAM,EAAE,GAAG,EAAE;gBACZ,gBAAgB,CAAC,sBAAsB,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC;gBACpE,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC1C,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,YAAY,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC;KACH;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { v4 } from 'uuid';\nimport { fail, Mutable } from '../Common';\nimport {\n\tdefaultClusterCapacity,\n\tIdCompressor,\n\tIdRangeDescriptor,\n\tisFinalId,\n\tisLocalId,\n} from '../id-compressor/IdCompressor';\nimport { IdCreationRange, UnackedLocalId, SerializedIdCompressorWithNoSession } from '../id-compressor';\nimport { createSessionId, numericUuidFromStableId, stableIdFromNumericUuid } from '../id-compressor/NumericUuid';\nimport {\n\tCompressedId,\n\tFinalCompressedId,\n\tLocalCompressedId,\n\tOpSpaceCompressedId,\n\tSessionId,\n\tSessionSpaceCompressedId,\n} from '../Identifiers';\nimport {\n\tClient,\n\tIdCompressorTestNetwork,\n\tperformFuzzActions,\n\tsessionIds,\n\tTestIdData,\n} from './utilities/IdCompressorTestUtilities';\n\ndescribe('IdCompressor Perf', () => {\n\tconst type = BenchmarkType.Measurement;\n\tconst localClient = Client.Client1;\n\tconst remoteClient = Client.Client2;\n\tlet compressor: IdCompressor;\n\tlet remoteCompressor: IdCompressor;\n\n\tfunction setupCompressors(\n\t\tclusterSize: number,\n\t\tallowLocal: boolean,\n\t\tincludeOverrides: boolean\n\t): IdCompressorTestNetwork {\n\t\tconst network = new IdCompressorTestNetwork(clusterSize);\n\t\t[compressor] = createPerfCompressor(network, allowLocal, includeOverrides, localClient);\n\t\t[remoteCompressor] = createPerfCompressor(network, allowLocal, includeOverrides, remoteClient);\n\t\treturn network;\n\t}\n\n\tfunction createPerfCompressor(\n\t\tnetwork: IdCompressorTestNetwork,\n\t\tallowLocal: boolean,\n\t\tincludeOverrides: boolean,\n\t\tclient: Client\n\t): [IdCompressor, readonly TestIdData[]] {\n\t\tperformFuzzActions(network, Math.E, includeOverrides, client, allowLocal ? false : true);\n\t\treturn [network.getCompressorUnsafe(client), network.getIdLog(client)];\n\t}\n\n\tfunction setupCompressorWithId(local: boolean, override: boolean, clusterHasOtherOverrides: boolean): CompressedId {\n\t\tconst clusterCapacity = defaultClusterCapacity;\n\t\tconst network = setupCompressors(clusterCapacity, true, true);\n\t\tif (!clusterHasOtherOverrides) {\n\t\t\tnetwork.allocateAndSendIds(localClient, clusterCapacity);\n\t\t} else {\n\t\t\tnetwork.allocateAndSendIds(localClient, 2, {\n\t\t\t\t0: 'override1',\n\t\t\t\t1: 'override2',\n\t\t\t});\n\t\t}\n\t\tif (override) {\n\t\t\tnetwork.allocateAndSendIds(localClient, 1, { 0: 'override3' });\n\t\t} else {\n\t\t\tnetwork.allocateAndSendIds(localClient, 1);\n\t\t}\n\n\t\tif (!local) {\n\t\t\tnetwork.deliverOperations(localClient);\n\t\t}\n\n\t\tconst ids = network.getIdLog(localClient);\n\t\tconst lastId = ids[ids.length - 1].id;\n\t\treturn lastId;\n\t}\n\n\tfunction benchmarkWithIdTypes(creator: (local: boolean, override: boolean, titleSuffix: string) => void) {\n\t\tfor (const local of [true, false]) {\n\t\t\tfor (const override of [true, false]) {\n\t\t\t\tconst titleSuffix = ` (${override ? 'override' : 'sequential'})`;\n\t\t\t\tcreator(local, override, titleSuffix);\n\t\t\t}\n\t\t}\n\t}\n\n\t[true, false].forEach((isLocal) => {\n\t\tlet range: IdRangeDescriptor<SessionSpaceCompressedId>;\n\t\tlet sessionId: SessionId;\n\t\tconst numIds = 100;\n\t\tconst clusterSize = Math.round(numIds / 2);\n\t\tconst setupRange = (isLocal: boolean) => {\n\t\t\tsetupCompressors(clusterSize, true, false);\n\t\t\tconst originCompressor = isLocal ? compressor : remoteCompressor;\n\t\t\tsessionId = originCompressor.localSessionId;\n\t\t\trange = originCompressor.generateCompressedIdRange(numIds);\n\t\t\tconst creationRange = originCompressor.takeNextCreationRange();\n\t\t\tcompressor.finalizeCreationRange(creationRange);\n\t\t};\n\t\tconst beforeLocal = () => setupRange(false);\n\t\tconst beforeRemote = () => setupRange(true);\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `get ${numIds} sequential IDs for a ${isLocal ? 'local' : 'remote'} range`,\n\t\t\tbefore: isLocal ? beforeLocal : beforeRemote,\n\t\t\tbenchmarkFn: () => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tconst ids = compressor.getIdsFromRange(range!, sessionId!);\n\t\t\t\tfor (let i = 0; i < numIds; i++) {\n\t\t\t\t\tids.get(i); // get a sequential ID\n\t\t\t\t}\n\t\t\t},\n\t\t});\n\t});\n\n\t[true, false].forEach((override) => {\n\t\tconst numericSource = numericUuidFromStableId(createSessionId());\n\t\tlet overrideIndex = 0;\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `allocate local ID (${override ? 'override' : 'sequential'})`,\n\t\t\tbefore: () => {\n\t\t\t\tsetupCompressors(defaultClusterCapacity, true, false);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tcompressor.generateCompressedId(\n\t\t\t\t\toverride ? stableIdFromNumericUuid(numericSource, overrideIndex++) : undefined\n\t\t\t\t);\n\t\t\t},\n\t\t});\n\t});\n\n\t[true, false].forEach((override) => {\n\t\tfor (const clusterSize of [1, 10, 500, 1000]) {\n\t\t\tconst overrideCount = 3;\n\t\t\tconst numIds = 7;\n\t\t\tconst session1 = '8150a099-5302-4672-b5f3-7a4492b59418' as SessionId;\n\t\t\tconst session2 = 'f2ded886-92da-4248-967b-eb96ee04cf51' as SessionId;\n\t\t\tlet session: SessionId = session1;\n\t\t\tlet lastFinalizedLocalId1 = 0 as LocalCompressedId;\n\t\t\tlet lastFinalizedLocalId2 = 0 as LocalCompressedId;\n\t\t\tlet overrideIndex = 0;\n\t\t\tbenchmark({\n\t\t\t\ttype,\n\t\t\t\ttitle: `finalize a range of IDs (cluster size =${clusterSize}${override ? ', overrides present' : ''})`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\tsetupCompressors(clusterSize, false, false);\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\t// Create a range with as minimal overhead as possible, as we'd like for this code to not exist\n\t\t\t\t\t// in the timing loop at all (but benchmark forces us to do so)\n\t\t\t\t\tconst isLocal = session === session1;\n\t\t\t\t\tconst first = ((isLocal ? lastFinalizedLocalId1 : lastFinalizedLocalId2) - 1) as LocalCompressedId &\n\t\t\t\t\t\tOpSpaceCompressedId;\n\t\t\t\t\tlet overrides: Mutable<IdCreationRange.Overrides> | undefined;\n\t\t\t\t\tconst actualOverrideCount = override ? overrideCount : 0;\n\t\t\t\t\tif (actualOverrideCount > 0) {\n\t\t\t\t\t\toverrides = [] as unknown as Mutable<IdCreationRange.Overrides>;\n\t\t\t\t\t\tfor (let i = 0; i < actualOverrideCount; i++) {\n\t\t\t\t\t\t\toverrides.push([\n\t\t\t\t\t\t\t\t(first - i) as LocalCompressedId & OpSpaceCompressedId,\n\t\t\t\t\t\t\t\t`override${overrideIndex++}`,\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tconst last = (first - numIds) as UnackedLocalId;\n\t\t\t\t\tconst range: IdCreationRange = {\n\t\t\t\t\t\tsessionId: session,\n\t\t\t\t\t\tids: {\n\t\t\t\t\t\t\tfirst,\n\t\t\t\t\t\t\tlast,\n\t\t\t\t\t\t\toverrides,\n\t\t\t\t\t\t},\n\t\t\t\t\t};\n\n\t\t\t\t\tcompressor.finalizeCreationRange(range);\n\n\t\t\t\t\tif (isLocal) {\n\t\t\t\t\t\tlastFinalizedLocalId1 = last;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tlastFinalizedLocalId2 = last;\n\t\t\t\t\t}\n\t\t\t\t\t// Alternate clients to sidestep optimization that packs them all into last cluster\n\t\t\t\t\tsession = isLocal ? session1 : session2;\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t});\n\n\t[true, false].forEach((override) => {\n\t\tconst idCount = 5;\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `creates an ID range (${override ? 'with overrides' : ''})`,\n\t\t\tbefore: () => {\n\t\t\t\tsetupCompressors(defaultClusterCapacity, true, false);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tif (override) {\n\t\t\t\t\tcompressor.generateCompressedId(v4());\n\t\t\t\t}\n\t\t\t\tcompressor.generateCompressedIdRange(idCount);\n\t\t\t\tcompressor.takeNextCreationRange();\n\t\t\t},\n\t\t});\n\t});\n\n\tbenchmarkWithIdTypes((local, override, titleSuffix) => {\n\t\tlet idToDecompress!: CompressedId;\n\t\tconst before = () => {\n\t\t\tidToDecompress = setupCompressorWithId(local, override, true);\n\t\t};\n\t\tconst benchmarkFn = () => {\n\t\t\tcompressor.decompress(idToDecompress);\n\t\t};\n\t\tif (local) {\n\t\t\tbenchmark({\n\t\t\t\ttype,\n\t\t\t\ttitle: `decompress local ID into stable IDs${titleSuffix}`,\n\t\t\t\tbefore,\n\t\t\t\tbenchmarkFn,\n\t\t\t});\n\t\t} else {\n\t\t\tconst titleBase = 'decompress final ID into stable IDs';\n\t\t\tif (override) {\n\t\t\t\tbenchmark({\n\t\t\t\t\ttype,\n\t\t\t\t\ttitle: titleBase + titleSuffix,\n\t\t\t\t\tbefore,\n\t\t\t\t\tbenchmarkFn,\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tfor (const clusterHasOverride of [true, false]) {\n\t\t\t\t\tbenchmark({\n\t\t\t\t\t\ttype,\n\t\t\t\t\t\ttitle: `${titleBase} (sequential, overrides ${\n\t\t\t\t\t\t\tclusterHasOverride ? 'present' : 'not present'\n\t\t\t\t\t\t} in owning cluster)`,\n\t\t\t\t\t\tbefore: () => {\n\t\t\t\t\t\t\tidToDecompress = setupCompressorWithId(local, override, clusterHasOverride);\n\t\t\t\t\t\t},\n\t\t\t\t\t\tbenchmarkFn,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t});\n\n\tbenchmarkWithIdTypes((local, override, titleSuffix) => {\n\t\tlet stableToCompress!: string;\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `compress a stable ID to a ${local ? 'local' : 'final'} ID${titleSuffix}`,\n\t\t\tbefore: () => {\n\t\t\t\tconst idAdded = setupCompressorWithId(local, override, true);\n\t\t\t\tstableToCompress = compressor.decompress(idAdded);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tcompressor.recompress(stableToCompress);\n\t\t\t},\n\t\t});\n\t});\n\n\tlet final!: FinalCompressedId;\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `normalize a final ID from the local session to session space`,\n\t\tbefore: () => {\n\t\t\tconst network = setupCompressors(defaultClusterCapacity, true, true);\n\t\t\tnetwork.allocateAndSendIds(localClient, 1);\n\t\t\tnetwork.deliverOperations(localClient);\n\t\t\tconst log = network.getSequencedIdLog(localClient);\n\t\t\tconst id = compressor.normalizeToOpSpace(log[log.length - 1].id);\n\t\t\tfinal = isFinalId(id) ? id : fail('not a final ID');\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tcompressor.normalizeToSessionSpace(final, compressor.localSessionId);\n\t\t},\n\t});\n\n\tlet localId!: LocalCompressedId;\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `normalize a local ID from the local session to session space`,\n\t\tbefore: () => {\n\t\t\tconst network = setupCompressors(defaultClusterCapacity, true, true);\n\t\t\tnetwork.allocateAndSendIds(localClient, 1);\n\t\t\tnetwork.deliverOperations(localClient);\n\t\t\tconst log = network.getIdLog(localClient);\n\t\t\tconst id = log[log.length - 1].id;\n\t\t\tlocalId = isLocalId(id) ? id : fail('not a local ID');\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tcompressor.normalizeToOpSpace(localId);\n\t\t},\n\t});\n\n\tconst remoteSessionId = sessionIds.get(remoteClient);\n\tlet opSpaceId: OpSpaceCompressedId | undefined;\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `normalize a local ID from a remote session to session space`,\n\t\tbefore: () => {\n\t\t\tconst network = setupCompressors(defaultClusterCapacity, true, true);\n\t\t\tnetwork.allocateAndSendIds(remoteClient, 1);\n\t\t\tconst log = network.getIdLog(remoteClient);\n\t\t\tconst id = remoteCompressor.normalizeToOpSpace(log[log.length - 1].id);\n\t\t\topSpaceId = isLocalId(id) ? id : fail('not a local ID');\n\t\t\t// Ensure id is finalized on local compressor\n\t\t\tnetwork.deliverOperations(localClient);\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tcompressor.normalizeToSessionSpace(opSpaceId ?? fail(), remoteSessionId);\n\t\t},\n\t});\n\n\tfor (const overrideInClusters of [true, false]) {\n\t\tconst titleSuffix = ` (${overrideInClusters ? 'with' : 'without'} overrides)`;\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `serialize an IdCompressor${titleSuffix}`,\n\t\t\tbefore: () => {\n\t\t\t\tsetupCompressors(defaultClusterCapacity, false, overrideInClusters);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tcompressor.serialize(false);\n\t\t\t},\n\t\t});\n\n\t\tlet serialized!: SerializedIdCompressorWithNoSession;\n\t\tconst remoteSessionId = createSessionId();\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `deserialize an IdCompressor${titleSuffix}`,\n\t\t\tbefore: () => {\n\t\t\t\tsetupCompressors(defaultClusterCapacity, false, overrideInClusters);\n\t\t\t\tserialized = compressor.serialize(false);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tIdCompressor.deserialize(serialized, remoteSessionId);\n\t\t\t},\n\t\t});\n\t}\n});\n"]}

package/lib/test/IdCompressor.tests.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=IdCompressor.tests.d.ts.map

package/lib/test/IdCompressor.tests.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IdCompressor.tests.d.ts","sourceRoot":"","sources":["../../src/test/IdCompressor.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}