@fluid-experimental/tree 2.0.0-rc.2.0.1 → 2.0.0-rc.3.0.0

package/lib/test/HistoryEditFactory.tests.js

@@ -1,170 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { HistoryEditFactoryEvents, revert } from '../HistoryEditFactory.js';
-import { ChangeInternal, StablePlaceInternal, StableRangeInternal } from '../persisted-types/index.js';
-import { expectDefined } from './utilities/TestCommon.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-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, StablePlaceInternal.atStartOf(testTree.left.traitLocation));
-        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, StablePlaceInternal.atStartOf(testTree.left.traitLocation));
-        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);
-    });
-    it('handles reverting the insert of empty nodes, with subsequent non-empty nodes', () => {
-        // build and insert of empty traits
-        const emptyTraitNodeId = 0;
-        const emptyTraitBuild = ChangeInternal.build([], emptyTraitNodeId);
-        const emptyTraitInsert = ChangeInternal.insert(emptyTraitNodeId, StablePlaceInternal.atStartOf(testTree.left.traitLocation));
-        // build and insert of non-empty traits
-        const firstDetachedId = 1;
-        const firstNode = testTree.buildLeafInternal();
-        const firstBuild = ChangeInternal.build([firstNode], firstDetachedId);
-        const insertedNodeId = 3;
-        const insertedBuild = ChangeInternal.build([firstDetachedId], insertedNodeId);
-        const insertChange = ChangeInternal.insert(insertedNodeId, StablePlaceInternal.atStartOf(testTree.left.traitLocation));
-        const result = expectDefined(revert([emptyTraitBuild, emptyTraitInsert, firstBuild, insertedBuild, insertChange], testTree.view));
-        expect(result.length).to.equal(1);
-        const revertedChange = result[0];
-        expect(revertedChange.source.start.referenceSibling).to.deep.equal(firstNode.identifier);
-    });
-    /** This is a regression test for a bug where we make sure that any built/detached nodes are cleared when any
-     * empty insert/detach change is skipped once encountered. The expected outcome is undefined, as during the second
-     * empty insert (with the same DetachSequenceId), there should be no such node in the builtNodes.
-     */
-    it('handles reverting the insert of empty nodes, with subsequent empty nodes of same DetachedSequenceId', () => {
-        const emptyTraitNodeId = 0;
-        const emptyTraitBuild = ChangeInternal.build([], emptyTraitNodeId);
-        const emptyTraitInsert = ChangeInternal.insert(emptyTraitNodeId, StablePlaceInternal.atStartOf(testTree.left.traitLocation));
-        const result = revert([emptyTraitBuild, emptyTraitInsert, emptyTraitInsert], testTree.view);
-        expect(result).to.be.undefined;
-    });
-    it('handles reverting the detach of an empty trait', () => {
-        const insertedNodeId = 0;
-        const result = expectDefined(revert([
-            ChangeInternal.detach(StableRangeInternal.all({
-                label: 'someNonExistentTraitLabel',
-                parent: testTree.identifier,
-            }), insertedNodeId),
-        ], testTree.view));
-        expect(result).to.have.lengthOf(0);
-    });
-    it('handles reverting the insert of an empty trait', () => {
-        const emptyTraitNodeId = 0;
-        const emptyTraitBuild = ChangeInternal.build([], emptyTraitNodeId);
-        const emptyTraitInsert = ChangeInternal.insert(emptyTraitNodeId, StablePlaceInternal.atStartOf(testTree.left.traitLocation));
-        const result = expectDefined(revert([emptyTraitBuild, emptyTraitInsert], testTree.view));
-        expect(result).to.have.lengthOf(0);
-    });
-    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', () => {
-                let missingNodeEvents = 0;
-                const nodeNotInTree = testTree.buildLeafInternal();
-                const change = ChangeInternal.detach(StableRangeInternal.only(nodeNotInTree));
-                const result = revert([change], testTree.view, undefined, (event) => {
-                    if (event === HistoryEditFactoryEvents.MissingNodes) {
-                        missingNodeEvents++;
-                    }
-                });
-                expect(missingNodeEvents).to.equal(1);
-                expect(result).to.be.undefined;
-            });
-            it('when reverting a set value of a node that is not in the tree', () => {
-                let missingNodeEvents = 0;
-                const nodeNotInTree = testTree.buildLeafInternal();
-                const change = ChangeInternal.setPayload(nodeNotInTree, '42');
-                const result = revert([change], testTree.view, undefined, (event) => {
-                    if (event === HistoryEditFactoryEvents.MissingNodes) {
-                        missingNodeEvents++;
-                    }
-                });
-                expect(missingNodeEvents).to.equal(1);
-                expect(result).to.be.undefined;
-            });
-        });
-        describe('because the edit was malformed', () => {
-            it('when reverting an insert whose source is not insertable', () => {
-                const detachedId = 0;
-                let missingNodeEvents = 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, undefined, (event) => {
-                    if (event === HistoryEditFactoryEvents.MissingNodes) {
-                        missingNodeEvents++;
-                    }
-                })).to.be.undefined;
-                expect(missingNodeEvents).to.equal(1);
-                // 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, undefined, (event) => {
-                    if (event === HistoryEditFactoryEvents.MissingNodes) {
-                        missingNodeEvents++;
-                    }
-                })).to.be.undefined;
-                expect(missingNodeEvents).to.equal(2);
-            });
-            it('when reverting a detach whose destination is already occupied', () => {
-                const detachedId = 0;
-                let malformedEditEvents = 0;
-                let missingNodeEvents = 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, undefined, (event) => {
-                    if (event === HistoryEditFactoryEvents.MalformedEdit) {
-                        malformedEditEvents++;
-                    }
-                    if (event === HistoryEditFactoryEvents.MissingNodes) {
-                        missingNodeEvents++;
-                    }
-                })).to.be.undefined;
-                expect(missingNodeEvents).to.equal(1);
-                // 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, undefined, (event) => {
-                    if (event === HistoryEditFactoryEvents.MalformedEdit) {
-                        malformedEditEvents++;
-                    }
-                    if (event === HistoryEditFactoryEvents.MissingNodes) {
-                        missingNodeEvents++;
-                    }
-                })).to.be.undefined;
-                expect(malformedEditEvents).to.equal(1);
-            });
-        });
-    });
-});
-//# sourceMappingURL=HistoryEditFactory.tests.js.map

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

@@ -1 +0,0 @@
-{"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,wBAAwB,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAE5E,OAAO,EAAE,cAAc,EAAkB,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AACvH,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,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,CACzC,cAAc,EACd,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;QACF,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,CACzC,cAAc,EACd,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;QACF,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,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACvF,mCAAmC;QACnC,MAAM,gBAAgB,GAAG,CAAuB,CAAC;QACjD,MAAM,eAAe,GAAG,cAAc,CAAC,KAAK,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QACnE,MAAM,gBAAgB,GAAG,cAAc,CAAC,MAAM,CAC7C,gBAAgB,EAChB,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;QAEF,uCAAuC;QACvC,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,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,CACzC,cAAc,EACd,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;QACF,MAAM,MAAM,GAAG,aAAa,CAC3B,MAAM,CAAC,CAAC,eAAe,EAAE,gBAAgB,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CACnG,CAAC;QACF,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;IAC1F,CAAC,CAAC,CAAC;IAEH;;;OAGG;IACH,EAAE,CAAC,qGAAqG,EAAE,GAAG,EAAE;QAC9G,MAAM,gBAAgB,GAAG,CAAuB,CAAC;QACjD,MAAM,eAAe,GAAG,cAAc,CAAC,KAAK,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QACnE,MAAM,gBAAgB,GAAG,cAAc,CAAC,MAAM,CAC7C,gBAAgB,EAChB,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,eAAe,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC5F,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,cAAc,GAAG,CAAuB,CAAC;QAC/C,MAAM,MAAM,GAAG,aAAa,CAC3B,MAAM,CACL;YACC,cAAc,CAAC,MAAM,CACpB,mBAAmB,CAAC,GAAG,CAAC;gBACvB,KAAK,EAAE,2BAAyC;gBAChD,MAAM,EAAE,QAAQ,CAAC,UAAU;aAC3B,CAAC,EACF,cAAc,CACd;SACD,EACD,QAAQ,CAAC,IAAI,CACb,CACD,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,gBAAgB,GAAG,CAAuB,CAAC;QACjD,MAAM,eAAe,GAAG,cAAc,CAAC,KAAK,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QACnE,MAAM,gBAAgB,GAAG,cAAc,CAAC,MAAM,CAC7C,gBAAgB,EAChB,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;QACF,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,eAAe,EAAE,gBAAgB,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACpC,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,IAAI,iBAAiB,GAAG,CAAC,CAAC;gBAC1B,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,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE;oBACnE,IAAI,KAAK,KAAK,wBAAwB,CAAC,YAAY,EAAE;wBACpD,iBAAiB,EAAE,CAAC;qBACpB;gBACF,CAAC,CAAC,CAAC;gBACH,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAChC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;gBACvE,IAAI,iBAAiB,GAAG,CAAC,CAAC;gBAC1B,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,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE;oBACnE,IAAI,KAAK,KAAK,wBAAwB,CAAC,YAAY,EAAE;wBACpD,iBAAiB,EAAE,CAAC;qBACpB;gBACF,CAAC,CAAC,CAAC;gBACH,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtC,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,IAAI,iBAAiB,GAAG,CAAC,CAAC;gBAC1B,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,EACb,SAAS,EACT,CAAC,KAAK,EAAE,EAAE;oBACT,IAAI,KAAK,KAAK,wBAAwB,CAAC,YAAY,EAAE;wBACpD,iBAAiB,EAAE,CAAC;qBACpB;gBACF,CAAC,CACD,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClB,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtC,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,EACb,SAAS,EACT,CAAC,KAAK,EAAE,EAAE;oBACT,IAAI,KAAK,KAAK,wBAAwB,CAAC,YAAY,EAAE;wBACpD,iBAAiB,EAAE,CAAC;qBACpB;gBACF,CAAC,CACD,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClB,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;gBACxE,MAAM,UAAU,GAAG,CAAuB,CAAC;gBAC3C,IAAI,mBAAmB,GAAG,CAAC,CAAC;gBAC5B,IAAI,iBAAiB,GAAG,CAAC,CAAC;gBAC1B,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,EACb,SAAS,EACT,CAAC,KAAK,EAAE,EAAE;oBACT,IAAI,KAAK,KAAK,wBAAwB,CAAC,aAAa,EAAE;wBACrD,mBAAmB,EAAE,CAAC;qBACtB;oBAED,IAAI,KAAK,KAAK,wBAAwB,CAAC,YAAY,EAAE;wBACpD,iBAAiB,EAAE,CAAC;qBACpB;gBACF,CAAC,CACD,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClB,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtC,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,EACb,SAAS,EACT,CAAC,KAAK,EAAE,EAAE;oBACT,IAAI,KAAK,KAAK,wBAAwB,CAAC,aAAa,EAAE;wBACrD,mBAAmB,EAAE,CAAC;qBACtB;oBAED,IAAI,KAAK,KAAK,wBAAwB,CAAC,YAAY,EAAE;wBACpD,iBAAiB,EAAE,CAAC;qBACpB;gBACF,CAAC,CACD,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClB,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACzC,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 { HistoryEditFactoryEvents, revert } from '../HistoryEditFactory.js';\nimport { DetachedSequenceId, TraitLabel } from '../Identifiers.js';\nimport { ChangeInternal, DetachInternal, StablePlaceInternal, StableRangeInternal } from '../persisted-types/index.js';\nimport { expectDefined } from './utilities/TestCommon.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\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(\n\t\t\tinsertedNodeId,\n\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\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(\n\t\t\tinsertedNodeId,\n\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\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\tit('handles reverting the insert of empty nodes, with subsequent non-empty nodes', () => {\n\t\t// build and insert of empty traits\n\t\tconst emptyTraitNodeId = 0 as DetachedSequenceId;\n\t\tconst emptyTraitBuild = ChangeInternal.build([], emptyTraitNodeId);\n\t\tconst emptyTraitInsert = ChangeInternal.insert(\n\t\t\temptyTraitNodeId,\n\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t);\n\n\t\t// build and insert of non-empty traits\n\t\tconst firstDetachedId = 1 as DetachedSequenceId;\n\t\tconst firstNode = testTree.buildLeafInternal();\n\t\tconst firstBuild = ChangeInternal.build([firstNode], firstDetachedId);\n\t\tconst insertedNodeId = 3 as DetachedSequenceId;\n\t\tconst insertedBuild = ChangeInternal.build([firstDetachedId], insertedNodeId);\n\t\tconst insertChange = ChangeInternal.insert(\n\t\t\tinsertedNodeId,\n\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t);\n\t\tconst result = expectDefined(\n\t\t\trevert([emptyTraitBuild, emptyTraitInsert, firstBuild, insertedBuild, insertChange], testTree.view)\n\t\t);\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});\n\n\t/** This is a regression test for a bug where we make sure that any built/detached nodes are cleared when any\n\t * empty insert/detach change is skipped once encountered. The expected outcome is undefined, as during the second\n\t * empty insert (with the same DetachSequenceId), there should be no such node in the builtNodes.\n\t */\n\tit('handles reverting the insert of empty nodes, with subsequent empty nodes of same DetachedSequenceId', () => {\n\t\tconst emptyTraitNodeId = 0 as DetachedSequenceId;\n\t\tconst emptyTraitBuild = ChangeInternal.build([], emptyTraitNodeId);\n\t\tconst emptyTraitInsert = ChangeInternal.insert(\n\t\t\temptyTraitNodeId,\n\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t);\n\t\tconst result = revert([emptyTraitBuild, emptyTraitInsert, emptyTraitInsert], testTree.view);\n\t\texpect(result).to.be.undefined;\n\t});\n\n\tit('handles reverting the detach of an empty trait', () => {\n\t\tconst insertedNodeId = 0 as DetachedSequenceId;\n\t\tconst result = expectDefined(\n\t\t\trevert(\n\t\t\t\t[\n\t\t\t\t\tChangeInternal.detach(\n\t\t\t\t\t\tStableRangeInternal.all({\n\t\t\t\t\t\t\tlabel: 'someNonExistentTraitLabel' as TraitLabel,\n\t\t\t\t\t\t\tparent: testTree.identifier,\n\t\t\t\t\t\t}),\n\t\t\t\t\t\tinsertedNodeId\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\ttestTree.view\n\t\t\t)\n\t\t);\n\t\texpect(result).to.have.lengthOf(0);\n\t});\n\n\tit('handles reverting the insert of an empty trait', () => {\n\t\tconst emptyTraitNodeId = 0 as DetachedSequenceId;\n\t\tconst emptyTraitBuild = ChangeInternal.build([], emptyTraitNodeId);\n\t\tconst emptyTraitInsert = ChangeInternal.insert(\n\t\t\temptyTraitNodeId,\n\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t);\n\t\tconst result = expectDefined(revert([emptyTraitBuild, emptyTraitInsert], testTree.view));\n\t\texpect(result).to.have.lengthOf(0);\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\tlet missingNodeEvents = 0;\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, undefined, (event) => {\n\t\t\t\t\tif (event === HistoryEditFactoryEvents.MissingNodes) {\n\t\t\t\t\t\tmissingNodeEvents++;\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\texpect(missingNodeEvents).to.equal(1);\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\tlet missingNodeEvents = 0;\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, undefined, (event) => {\n\t\t\t\t\tif (event === HistoryEditFactoryEvents.MissingNodes) {\n\t\t\t\t\t\tmissingNodeEvents++;\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\texpect(missingNodeEvents).to.equal(1);\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\tlet missingNodeEvents = 0;\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\tundefined,\n\t\t\t\t\t\t(event) => {\n\t\t\t\t\t\t\tif (event === HistoryEditFactoryEvents.MissingNodes) {\n\t\t\t\t\t\t\t\tmissingNodeEvents++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t\texpect(missingNodeEvents).to.equal(1);\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\tundefined,\n\t\t\t\t\t\t(event) => {\n\t\t\t\t\t\t\tif (event === HistoryEditFactoryEvents.MissingNodes) {\n\t\t\t\t\t\t\t\tmissingNodeEvents++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t\texpect(missingNodeEvents).to.equal(2);\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\tlet malformedEditEvents = 0;\n\t\t\t\tlet missingNodeEvents = 0;\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\tundefined,\n\t\t\t\t\t\t(event) => {\n\t\t\t\t\t\t\tif (event === HistoryEditFactoryEvents.MalformedEdit) {\n\t\t\t\t\t\t\t\tmalformedEditEvents++;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (event === HistoryEditFactoryEvents.MissingNodes) {\n\t\t\t\t\t\t\t\tmissingNodeEvents++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t\texpect(missingNodeEvents).to.equal(1);\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\tundefined,\n\t\t\t\t\t\t(event) => {\n\t\t\t\t\t\t\tif (event === HistoryEditFactoryEvents.MalformedEdit) {\n\t\t\t\t\t\t\t\tmalformedEditEvents++;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (event === HistoryEditFactoryEvents.MissingNodes) {\n\t\t\t\t\t\t\t\tmissingNodeEvents++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t).to.be.undefined;\n\t\t\t\texpect(malformedEditEvents).to.equal(1);\n\t\t\t});\n\t\t});\n\t});\n});\n"]}

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

@@ -1,6 +0,0 @@
-/*!
- * 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

@@ -1 +0,0 @@
-{"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

@@ -1,290 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable @typescript-eslint/no-non-null-assertion */
-import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
-import { take } from '@fluid-private/stochastic-test-utils';
-import { fail } from '../Common.js';
-import { defaultClusterCapacity, IdCompressor, isFinalId, isLocalId } from '../id-compressor/IdCompressor.js';
-import { createSessionId, numericUuidFromStableId, stableIdFromNumericUuid } from '../id-compressor/NumericUuid.js';
-import { Client, IdCompressorTestNetwork, makeOpGenerator, performFuzzActions, sessionIds, } from './utilities/IdCompressorTestUtilities.js';
-describe('IdCompressor Perf', () => {
-    const type = BenchmarkType.Measurement;
-    const localClient = Client.Client1;
-    const remoteClient = Client.Client2;
-    let perfCompressor;
-    let network;
-    let compressor;
-    function setupCompressors(clusterSize, allowLocal, includeOverrides) {
-        network = new IdCompressorTestNetwork(clusterSize);
-        [compressor] = createPerfCompressor(network, allowLocal, includeOverrides, localClient);
-        perfCompressor = undefined;
-        return network;
-    }
-    function createPerfCompressor(network, allowLocal, includeOverrides, client) {
-        const maxClusterSize = 25;
-        const generator = take(1000, makeOpGenerator({ includeOverrides, validateInterval: 2000, maxClusterSize }));
-        if (network.initialClusterSize > maxClusterSize) {
-            network.enqueueCapacityChange(maxClusterSize);
-        }
-        performFuzzActions(generator, network, Math.E, allowLocal ? undefined : client, !allowLocal);
-        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((override) => {
-        const numericSource = numericUuidFromStableId(createSessionId());
-        let overrideIndex = 0;
-        benchmark({
-            type,
-            title: `allocate local ID (${override ? 'override' : 'sequential'})`,
-            before: () => {
-                setupCompressors(defaultClusterCapacity, true, false);
-                perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-            },
-            benchmarkFn: () => {
-                perfCompressor.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);
-                    perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-                },
-                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,
-                        },
-                    };
-                    perfCompressor.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;
-                },
-            });
-        }
-    });
-    benchmark({
-        type,
-        title: `takes a ID creation range'})`,
-        before: () => {
-            setupCompressors(defaultClusterCapacity, true, false);
-            perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-        },
-        benchmarkFn: () => {
-            perfCompressor.generateCompressedId();
-            perfCompressor.takeNextCreationRange();
-        },
-    });
-    benchmarkWithIdTypes((local, override, titleSuffix) => {
-        let idToDecompress;
-        const before = () => {
-            idToDecompress = setupCompressorWithId(local, override, true);
-            perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-        };
-        const benchmarkFn = () => {
-            perfCompressor.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);
-                            perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-                        },
-                        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);
-                perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-            },
-            benchmarkFn: () => {
-                perfCompressor.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');
-            perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-        },
-        benchmarkFn: () => {
-            perfCompressor.normalizeToSessionSpace(final, compressor.localSessionId);
-        },
-    });
-    function getLastLocalId(client, network) {
-        const log = network.getIdLog(client);
-        for (let i = log.length - 1; i > 0; i--) {
-            const cur = log[i].id;
-            if (isLocalId(cur)) {
-                return cur;
-            }
-        }
-        fail('no local ID found in log');
-    }
-    let localId;
-    benchmark({
-        type,
-        title: `normalize a local ID from the local session to session space`,
-        before: () => {
-            const network = setupCompressors(defaultClusterCapacity, true, true);
-            network.deliverOperations(localClient);
-            localId = getLastLocalId(localClient, network);
-            perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-        },
-        benchmarkFn: () => {
-            perfCompressor.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.deliverOperations(localClient);
-            opSpaceId = getLastLocalId(remoteClient, network);
-            perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-        },
-        benchmarkFn: () => {
-            perfCompressor.normalizeToSessionSpace(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);
-                perfCompressor = network.getCompressorUnsafeNoProxy(localClient);
-            },
-            benchmarkFn: () => {
-                perfCompressor.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

@@ -1 +0,0 @@
-{"version":3,"file":"IdCompressor.perf.tests.js","sourceRoot":"","sources":["../../src/test/IdCompressor.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,6DAA6D;AAE7D,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,MAAM,sCAAsC,CAAC;AAC5D,OAAO,EAAE,IAAI,EAAW,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,sBAAsB,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAE9G,OAAO,EAAE,eAAe,EAAE,uBAAuB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAEpH,OAAO,EACN,MAAM,EACN,uBAAuB,EACvB,eAAe,EACf,kBAAkB,EAClB,UAAU,GAEV,MAAM,0CAA0C,CAAC;AAElD,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,cAAwC,CAAC;IAC7C,IAAI,OAAgC,CAAC;IACrC,IAAI,UAAwB,CAAC;IAE7B,SAAS,gBAAgB,CACxB,WAAmB,EACnB,UAAmB,EACnB,gBAAyB;QAEzB,OAAO,GAAG,IAAI,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,CAAC,UAAU,CAAC,GAAG,oBAAoB,CAAC,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,WAAW,CAAC,CAAC;QACxF,cAAc,GAAG,SAAS,CAAC;QAC3B,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,SAAS,oBAAoB,CAC5B,OAAgC,EAChC,UAAmB,EACnB,gBAAyB,EACzB,MAAc;QAEd,MAAM,cAAc,GAAG,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;QAC5G,IAAI,OAAO,CAAC,kBAAkB,GAAG,cAAc,EAAE;YAChD,OAAO,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;SAC9C;QACD,kBAAkB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC;QAC7F,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,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;gBACtD,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;YAClE,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,cAAe,CAAC,oBAAoB,CACnC,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;oBAC5C,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;gBAClE,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,cAAe,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;oBAE7C,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,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,8BAA8B;QACrC,MAAM,EAAE,GAAG,EAAE;YACZ,gBAAgB,CAAC,sBAAsB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACtD,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;QAClE,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,cAAe,CAAC,oBAAoB,EAAE,CAAC;YACvC,cAAe,CAAC,qBAAqB,EAAE,CAAC;QACzC,CAAC;KACD,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;YAC9D,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;QAClE,CAAC,CAAC;QACF,MAAM,WAAW,GAAG,GAAG,EAAE;YACxB,cAAe,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;QAC5C,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;4BAC5E,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;wBAClE,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;gBAClD,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;YAClE,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,cAAe,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;YAC9C,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;YACpD,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;QAClE,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,cAAe,CAAC,uBAAuB,CAAC,KAAK,EAAE,UAAU,CAAC,cAAc,CAAC,CAAC;QAC3E,CAAC;KACD,CAAC,CAAC;IAEH,SAAS,cAAc,CAAC,MAAc,EAAE,OAAgC;QACvE,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE;gBACnB,OAAO,GAAG,CAAC;aACX;SACD;QACD,IAAI,CAAC,0BAA0B,CAAC,CAAC;IAClC,CAAC;IAED,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,iBAAiB,CAAC,WAAW,CAAC,CAAC;YACvC,OAAO,GAAG,cAAc,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAC/C,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;QAClE,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,cAAe,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC7C,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,iBAAiB,CAAC,WAAW,CAAC,CAAC;YACvC,SAAS,GAAG,cAAc,CAAC,YAAY,EAAE,OAAO,CAAwB,CAAC;YACzE,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;QAClE,CAAC;QACD,WAAW,EAAE,GAAG,EAAE;YACjB,cAAe,CAAC,uBAAuB,CAAC,SAAS,IAAI,IAAI,EAAE,EAAE,eAAe,CAAC,CAAC;QAC/E,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;gBACpE,cAAc,GAAG,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC;YAClE,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,cAAe,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAClC,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\n/* eslint-disable @typescript-eslint/no-non-null-assertion */\n\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { take } from '@fluid-private/stochastic-test-utils';\nimport { fail, Mutable } from '../Common.js';\nimport { defaultClusterCapacity, IdCompressor, isFinalId, isLocalId } from '../id-compressor/IdCompressor.js';\nimport { IdCreationRange, UnackedLocalId, SerializedIdCompressorWithNoSession } from '../id-compressor/index.js';\nimport { createSessionId, numericUuidFromStableId, stableIdFromNumericUuid } from '../id-compressor/NumericUuid.js';\nimport { CompressedId, FinalCompressedId, LocalCompressedId, OpSpaceCompressedId, SessionId } from '../Identifiers.js';\nimport {\n\tClient,\n\tIdCompressorTestNetwork,\n\tmakeOpGenerator,\n\tperformFuzzActions,\n\tsessionIds,\n\tTestIdData,\n} from './utilities/IdCompressorTestUtilities.js';\n\ndescribe('IdCompressor Perf', () => {\n\tconst type = BenchmarkType.Measurement;\n\tconst localClient = Client.Client1;\n\tconst remoteClient = Client.Client2;\n\tlet perfCompressor: IdCompressor | undefined;\n\tlet network: IdCompressorTestNetwork;\n\tlet compressor: IdCompressor;\n\n\tfunction setupCompressors(\n\t\tclusterSize: number,\n\t\tallowLocal: boolean,\n\t\tincludeOverrides: boolean\n\t): IdCompressorTestNetwork {\n\t\tnetwork = new IdCompressorTestNetwork(clusterSize);\n\t\t[compressor] = createPerfCompressor(network, allowLocal, includeOverrides, localClient);\n\t\tperfCompressor = undefined;\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\tconst maxClusterSize = 25;\n\t\tconst generator = take(1000, makeOpGenerator({ includeOverrides, validateInterval: 2000, maxClusterSize }));\n\t\tif (network.initialClusterSize > maxClusterSize) {\n\t\t\tnetwork.enqueueCapacityChange(maxClusterSize);\n\t\t}\n\t\tperformFuzzActions(generator, network, Math.E, allowLocal ? undefined : client, !allowLocal);\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((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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tperfCompressor!.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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\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\tperfCompressor!.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\tbenchmark({\n\t\ttype,\n\t\ttitle: `takes a ID creation range'})`,\n\t\tbefore: () => {\n\t\t\tsetupCompressors(defaultClusterCapacity, true, false);\n\t\t\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tperfCompressor!.generateCompressedId();\n\t\t\tperfCompressor!.takeNextCreationRange();\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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t};\n\t\tconst benchmarkFn = () => {\n\t\t\tperfCompressor!.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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tperfCompressor!.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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tperfCompressor!.normalizeToSessionSpace(final, compressor.localSessionId);\n\t\t},\n\t});\n\n\tfunction getLastLocalId(client: Client, network: IdCompressorTestNetwork): LocalCompressedId {\n\t\tconst log = network.getIdLog(client);\n\t\tfor (let i = log.length - 1; i > 0; i--) {\n\t\t\tconst cur = log[i].id;\n\t\t\tif (isLocalId(cur)) {\n\t\t\t\treturn cur;\n\t\t\t}\n\t\t}\n\t\tfail('no local ID found in log');\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.deliverOperations(localClient);\n\t\t\tlocalId = getLastLocalId(localClient, network);\n\t\t\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tperfCompressor!.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.deliverOperations(localClient);\n\t\t\topSpaceId = getLastLocalId(remoteClient, network) as OpSpaceCompressedId;\n\t\t\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t},\n\t\tbenchmarkFn: () => {\n\t\t\tperfCompressor!.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\tperfCompressor = network.getCompressorUnsafeNoProxy(localClient);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tperfCompressor!.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

@@ -1,6 +0,0 @@
-/*!
- * 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

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