@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/test/rebase/revisionTagCodec.spec.js

@@ -1,56 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { createIdCompressor, createSessionId } from "@fluidframework/id-compressor";
-import { RevisionTagCodec } from "../../core/index.js";
-describe("RevisionTagCodec", () => {
-    it("handles the root constant revision tag", () => {
-        const rootRevisionTag = "root";
-        const localCompressor = createIdCompressor(createSessionId());
-        const remoteCompressor = createIdCompressor(createSessionId());
-        const codec = new RevisionTagCodec(localCompressor);
-        const encoded = codec.encode(rootRevisionTag);
-        assert.deepEqual(encoded, rootRevisionTag);
-        const decoded = codec.decode(encoded, { originatorId: localCompressor.localSessionId });
-        assert.deepEqual(decoded, rootRevisionTag);
-        const remoteEncoded = new RevisionTagCodec(remoteCompressor).encode(rootRevisionTag);
-        const decodedFromRemote = codec.decode(remoteEncoded, {
-            originatorId: remoteCompressor.localSessionId,
-        });
-        assert.deepEqual(decodedFromRemote, rootRevisionTag);
-    });
-    it("normalizes compressed IDs between op and session space", () => {
-        const localSession = createSessionId();
-        const remoteSession = createSessionId();
-        const localCompressor = createIdCompressor(localSession);
-        const remoteCompressor = createIdCompressor(remoteSession);
-        const localCodec = new RevisionTagCodec(localCompressor);
-        const remoteCodec = new RevisionTagCodec(remoteCompressor);
-        // Generate a compressed ID in the local space
-        const localId = localCompressor.generateCompressedId();
-        // The encoded ID will not have a final ID form
-        let localEncoded = localCodec.encode(localId);
-        assert.deepEqual(localId, localEncoded);
-        assert.deepEqual(localId, localCodec.decode(localEncoded, { originatorId: localSession }));
-        // A remote client should not be able to decode the local ID, as it has not received
-        // the creation range for it
-        assert.throws(() => remoteCodec.decode(localEncoded, { originatorId: localSession }));
-        // Simulate the remote client receiving the creation range for the local ID
-        const range = localCompressor.takeNextCreationRange();
-        localCompressor.finalizeCreationRange(range);
-        remoteCompressor.finalizeCreationRange(range);
-        // Locally encoding will have the final ID form, as will the remote client
-        localEncoded = localCodec.encode(localId);
-        const remoteDecoded = remoteCodec.decode(localEncoded, { originatorId: localSession });
-        const remoteEncoded = remoteCodec.encode(remoteDecoded);
-        assert.notDeepEqual(localId, localEncoded);
-        assert.deepEqual(localEncoded, remoteDecoded);
-        assert.deepEqual(remoteEncoded, remoteDecoded);
-        assert.deepEqual(localEncoded, remoteCodec.decode(localEncoded, { originatorId: localSession }));
-        // Simulate the remote client referencing the local client's ID
-        assert.deepEqual(localId, localCodec.decode(remoteEncoded, { originatorId: remoteSession }));
-    });
-});
-//# sourceMappingURL=revisionTagCodec.spec.js.map

package/lib/test/rebase/revisionTagCodec.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"revisionTagCodec.spec.js","sourceRoot":"","sources":["../../../src/test/rebase/revisionTagCodec.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AACpF,OAAO,EAAe,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAEpE,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,eAAe,GAAgB,MAAM,CAAC;QAC5C,MAAM,eAAe,GAAG,kBAAkB,CAAC,eAAe,EAAE,CAAC,CAAC;QAC9D,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,eAAe,EAAE,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,IAAI,gBAAgB,CAAC,eAAe,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QAC9C,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,YAAY,EAAE,eAAe,CAAC,cAAc,EAAE,CAAC,CAAC;QACxF,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC3C,MAAM,aAAa,GAAG,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QACrF,MAAM,iBAAiB,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE;YACrD,YAAY,EAAE,gBAAgB,CAAC,cAAc;SAC7C,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,iBAAiB,EAAE,eAAe,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QACjE,MAAM,YAAY,GAAG,eAAe,EAAE,CAAC;QACvC,MAAM,aAAa,GAAG,eAAe,EAAE,CAAC;QACxC,MAAM,eAAe,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;QACzD,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,aAAa,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,IAAI,gBAAgB,CAAC,eAAe,CAAC,CAAC;QACzD,MAAM,WAAW,GAAG,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;QAC3D,8CAA8C;QAC9C,MAAM,OAAO,GAAG,eAAe,CAAC,oBAAoB,EAAE,CAAC;QAEvD,+CAA+C;QAC/C,IAAI,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE9C,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QACxC,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAC3F,oFAAoF;QACpF,4BAA4B;QAC5B,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAEtF,2EAA2E;QAC3E,MAAM,KAAK,GAAG,eAAe,CAAC,qBAAqB,EAAE,CAAC;QACtD,eAAe,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC7C,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC9C,0EAA0E;QAC1E,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAAC;QACvF,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAExD,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC3C,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;QAC9C,MAAM,CAAC,SAAS,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CACf,YAAY,EACZ,WAAW,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAChE,CAAC;QACF,+DAA+D;QAC/D,MAAM,CAAC,SAAS,CACf,OAAO,EACP,UAAU,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC,CACjE,CAAC;IACH,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 { strict as assert } from \"assert\";\nimport { createIdCompressor, createSessionId } from \"@fluidframework/id-compressor\";\nimport { RevisionTag, RevisionTagCodec } from \"../../core/index.js\";\n\ndescribe(\"RevisionTagCodec\", () => {\n\tit(\"handles the root constant revision tag\", () => {\n\t\tconst rootRevisionTag: RevisionTag = \"root\";\n\t\tconst localCompressor = createIdCompressor(createSessionId());\n\t\tconst remoteCompressor = createIdCompressor(createSessionId());\n\t\tconst codec = new RevisionTagCodec(localCompressor);\n\t\tconst encoded = codec.encode(rootRevisionTag);\n\t\tassert.deepEqual(encoded, rootRevisionTag);\n\t\tconst decoded = codec.decode(encoded, { originatorId: localCompressor.localSessionId });\n\t\tassert.deepEqual(decoded, rootRevisionTag);\n\t\tconst remoteEncoded = new RevisionTagCodec(remoteCompressor).encode(rootRevisionTag);\n\t\tconst decodedFromRemote = codec.decode(remoteEncoded, {\n\t\t\toriginatorId: remoteCompressor.localSessionId,\n\t\t});\n\t\tassert.deepEqual(decodedFromRemote, rootRevisionTag);\n\t});\n\n\tit(\"normalizes compressed IDs between op and session space\", () => {\n\t\tconst localSession = createSessionId();\n\t\tconst remoteSession = createSessionId();\n\t\tconst localCompressor = createIdCompressor(localSession);\n\t\tconst remoteCompressor = createIdCompressor(remoteSession);\n\t\tconst localCodec = new RevisionTagCodec(localCompressor);\n\t\tconst remoteCodec = new RevisionTagCodec(remoteCompressor);\n\t\t// Generate a compressed ID in the local space\n\t\tconst localId = localCompressor.generateCompressedId();\n\n\t\t// The encoded ID will not have a final ID form\n\t\tlet localEncoded = localCodec.encode(localId);\n\n\t\tassert.deepEqual(localId, localEncoded);\n\t\tassert.deepEqual(localId, localCodec.decode(localEncoded, { originatorId: localSession }));\n\t\t// A remote client should not be able to decode the local ID, as it has not received\n\t\t// the creation range for it\n\t\tassert.throws(() => remoteCodec.decode(localEncoded, { originatorId: localSession }));\n\n\t\t// Simulate the remote client receiving the creation range for the local ID\n\t\tconst range = localCompressor.takeNextCreationRange();\n\t\tlocalCompressor.finalizeCreationRange(range);\n\t\tremoteCompressor.finalizeCreationRange(range);\n\t\t// Locally encoding will have the final ID form, as will the remote client\n\t\tlocalEncoded = localCodec.encode(localId);\n\t\tconst remoteDecoded = remoteCodec.decode(localEncoded, { originatorId: localSession });\n\t\tconst remoteEncoded = remoteCodec.encode(remoteDecoded);\n\n\t\tassert.notDeepEqual(localId, localEncoded);\n\t\tassert.deepEqual(localEncoded, remoteDecoded);\n\t\tassert.deepEqual(remoteEncoded, remoteDecoded);\n\t\tassert.deepEqual(\n\t\t\tlocalEncoded,\n\t\t\tremoteCodec.decode(localEncoded, { originatorId: localSession }),\n\t\t);\n\t\t// Simulate the remote client referencing the local client's ID\n\t\tassert.deepEqual(\n\t\t\tlocalId,\n\t\t\tlocalCodec.decode(remoteEncoded, { originatorId: remoteSession }),\n\t\t);\n\t});\n});\n"]}

package/lib/test/rebase/verifyChangeRebaser.spec.d.ts

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

package/lib/test/rebase/verifyChangeRebaser.spec.d.ts.map

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

package/lib/test/rebase/verifyChangeRebaser.spec.js

@@ -1,52 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { noFailure, verifyChangeRebaser } from "../../core/index.js";
-const counterRebaser = {
-    compose: (changes) => changes.map((c) => c.change).reduce((a, b) => a + b, 0),
-    invert: (change) => -change.change,
-    rebase: (change, over) => change,
-};
-const incorrectCounterRebaser = {
-    compose: (changes) => changes.map((c) => c.change).reduce((a, b) => a + b - 1, 0),
-    invert: (change) => -change.change + 1,
-    rebase: (change, over) => change + 1,
-};
-describe("verifyChangeRebaser", () => {
-    it("test counter with safe integers", () => {
-        const output = verifyChangeRebaser(counterRebaser, new Set([-1, 2, 3, 0, -2, 4]), isEquivalent);
-        assert.deepEqual(output, noFailure);
-    });
-    it("test counter with unsafe integers", () => {
-        const output = verifyChangeRebaser(counterRebaser, new Set([Number.MAX_SAFE_INTEGER, -10, 2]), isEquivalent);
-        assert.deepEqual(output.rebaseLeftDistributivity, []);
-        assert(output.composeAssociativity.length > 0);
-        assert.deepEqual(output.rebaseRightDistributivity, []);
-        assert.deepEqual(output.rebaseOverDoUndoPairIsNoOp, []);
-        assert.deepEqual(output.rebaseOverUndoRedoPairIsNoOp, []);
-        assert.deepEqual(output.composeWithInverseIsNoOp, []);
-        assert.deepEqual(output.composeWithEmptyIsNoOp, []);
-        assert.deepEqual(output.rebaseOverEmptyIsNoOp, []);
-        assert.deepEqual(output.rebaseEmptyIsEmpty, []);
-        assert.deepEqual(output.emptyInverseIsEmpty, []);
-    });
-    it("test incorrect counter with safe integers", () => {
-        const output = verifyChangeRebaser(incorrectCounterRebaser, new Set([-1, 2, 3, 0, -2, 4]), isEquivalent);
-        assert(output.rebaseLeftDistributivity.length > 0);
-        assert(output.composeAssociativity.length > 0);
-        assert(output.rebaseRightDistributivity.length > 0);
-        assert(output.rebaseOverDoUndoPairIsNoOp.length > 0);
-        assert(output.rebaseOverUndoRedoPairIsNoOp.length > 0);
-        assert(output.composeWithInverseIsNoOp.length > 0);
-        assert(output.composeWithEmptyIsNoOp.length > 0);
-        assert(output.rebaseOverEmptyIsNoOp.length > 0);
-        assert(output.rebaseEmptyIsEmpty.length > 0);
-        assert(output.emptyInverseIsEmpty.length > 0);
-    });
-});
-function isEquivalent(a, b) {
-    return a === b || (isNaN(a) && isNaN(b));
-}
-//# sourceMappingURL=verifyChangeRebaser.spec.js.map

package/lib/test/rebase/verifyChangeRebaser.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"verifyChangeRebaser.spec.js","sourceRoot":"","sources":["../../../src/test/rebase/verifyChangeRebaser.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAA+B,SAAS,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAElG,MAAM,cAAc,GAA0B;IAC7C,OAAO,EAAE,CAAC,OAA+B,EAAE,EAAE,CAC5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACxD,MAAM,EAAE,CAAC,MAA4B,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM;IACxD,MAAM,EAAE,CAAC,MAAc,EAAE,IAA0B,EAAE,EAAE,CAAC,MAAM;CAC9D,CAAC;AAEF,MAAM,uBAAuB,GAA0B;IACtD,OAAO,EAAE,CAAC,OAA+B,EAAE,EAAE,CAC5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5D,MAAM,EAAE,CAAC,MAA4B,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;IAC5D,MAAM,EAAE,CAAC,MAAc,EAAE,IAA0B,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC;CAClE,CAAC;AAEF,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACpC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG,mBAAmB,CACjC,cAAc,EACd,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAC7B,YAAY,CACZ,CAAC;QACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,MAAM,GAAG,mBAAmB,CACjC,cAAc,EACd,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAC1C,YAAY,CACZ,CAAC;QACF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,0BAA0B,EAAE,EAAE,CAAC,CAAC;QACxD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,4BAA4B,EAAE,EAAE,CAAC,CAAC;QAC1D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QACnD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;QAChD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,MAAM,GAAG,mBAAmB,CACjC,uBAAuB,EACvB,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAC7B,YAAY,CACZ,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,yBAAyB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,CAAC,0BAA0B,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,MAAM,CAAC,4BAA4B,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACzC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { ChangeRebaser, TaggedChange, noFailure, verifyChangeRebaser } from \"../../core/index.js\";\n\nconst counterRebaser: ChangeRebaser<number> = {\n\tcompose: (changes: TaggedChange<number>[]) =>\n\t\tchanges.map((c) => c.change).reduce((a, b) => a + b, 0),\n\tinvert: (change: TaggedChange<number>) => -change.change,\n\trebase: (change: number, over: TaggedChange<number>) => change,\n};\n\nconst incorrectCounterRebaser: ChangeRebaser<number> = {\n\tcompose: (changes: TaggedChange<number>[]) =>\n\t\tchanges.map((c) => c.change).reduce((a, b) => a + b - 1, 0),\n\tinvert: (change: TaggedChange<number>) => -change.change + 1,\n\trebase: (change: number, over: TaggedChange<number>) => change + 1,\n};\n\ndescribe(\"verifyChangeRebaser\", () => {\n\tit(\"test counter with safe integers\", () => {\n\t\tconst output = verifyChangeRebaser(\n\t\t\tcounterRebaser,\n\t\t\tnew Set([-1, 2, 3, 0, -2, 4]),\n\t\t\tisEquivalent,\n\t\t);\n\t\tassert.deepEqual(output, noFailure);\n\t});\n\n\tit(\"test counter with unsafe integers\", () => {\n\t\tconst output = verifyChangeRebaser(\n\t\t\tcounterRebaser,\n\t\t\tnew Set([Number.MAX_SAFE_INTEGER, -10, 2]),\n\t\t\tisEquivalent,\n\t\t);\n\t\tassert.deepEqual(output.rebaseLeftDistributivity, []);\n\t\tassert(output.composeAssociativity.length > 0);\n\t\tassert.deepEqual(output.rebaseRightDistributivity, []);\n\t\tassert.deepEqual(output.rebaseOverDoUndoPairIsNoOp, []);\n\t\tassert.deepEqual(output.rebaseOverUndoRedoPairIsNoOp, []);\n\t\tassert.deepEqual(output.composeWithInverseIsNoOp, []);\n\t\tassert.deepEqual(output.composeWithEmptyIsNoOp, []);\n\t\tassert.deepEqual(output.rebaseOverEmptyIsNoOp, []);\n\t\tassert.deepEqual(output.rebaseEmptyIsEmpty, []);\n\t\tassert.deepEqual(output.emptyInverseIsEmpty, []);\n\t});\n\n\tit(\"test incorrect counter with safe integers\", () => {\n\t\tconst output = verifyChangeRebaser(\n\t\t\tincorrectCounterRebaser,\n\t\t\tnew Set([-1, 2, 3, 0, -2, 4]),\n\t\t\tisEquivalent,\n\t\t);\n\t\tassert(output.rebaseLeftDistributivity.length > 0);\n\t\tassert(output.composeAssociativity.length > 0);\n\t\tassert(output.rebaseRightDistributivity.length > 0);\n\t\tassert(output.rebaseOverDoUndoPairIsNoOp.length > 0);\n\t\tassert(output.rebaseOverUndoRedoPairIsNoOp.length > 0);\n\t\tassert(output.composeWithInverseIsNoOp.length > 0);\n\t\tassert(output.composeWithEmptyIsNoOp.length > 0);\n\t\tassert(output.rebaseOverEmptyIsNoOp.length > 0);\n\t\tassert(output.rebaseEmptyIsEmpty.length > 0);\n\t\tassert(output.emptyInverseIsEmpty.length > 0);\n\t});\n});\n\nfunction isEquivalent(a: number, b: number): boolean {\n\treturn a === b || (isNaN(a) && isNaN(b));\n}\n"]}

package/lib/test/rebaserAxiomaticTests.d.ts

@@ -1,15 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FieldStateTree, ChildStateGenerator, BoundFieldChangeRebaser } from "./exhaustiveRebaserUtils.js";
-interface ExhaustiveSuiteOptions {
-    skipRebaseOverCompose?: boolean;
-    groupSubSuites?: boolean;
-    numberOfEditsToRebase?: number;
-    numberOfEditsToRebaseOver?: number;
-    numberOfEditsToVerifyAssociativity?: number;
-}
-export declare function runExhaustiveComposeRebaseSuite<TContent, TChangeset>(initialStates: FieldStateTree<TContent, TChangeset>[], generateChildStates: ChildStateGenerator<TContent, TChangeset>, fieldRebaser: BoundFieldChangeRebaser<TChangeset>, options?: ExhaustiveSuiteOptions): void;
-export {};
-//# sourceMappingURL=rebaserAxiomaticTests.d.ts.map

package/lib/test/rebaserAxiomaticTests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"rebaserAxiomaticTests.d.ts","sourceRoot":"","sources":["../../src/test/rebaserAxiomaticTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAeH,OAAO,EACN,cAAc,EAEd,mBAAmB,EACnB,uBAAuB,EAGvB,MAAM,6BAA6B,CAAC;AAErC,UAAU,sBAAsB;IAC/B,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,yBAAyB,CAAC,EAAE,MAAM,CAAC;IACnC,kCAAkC,CAAC,EAAE,MAAM,CAAC;CAC5C;AAwCD,wBAAgB,+BAA+B,CAAC,QAAQ,EAAE,UAAU,EACnE,aAAa,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,EAAE,EACrD,mBAAmB,EAAE,mBAAmB,CAAC,QAAQ,EAAE,UAAU,CAAC,EAC9D,YAAY,EAAE,uBAAuB,CAAC,UAAU,CAAC,EACjD,OAAO,CAAC,EAAE,sBAAsB,QAwKhC"}

package/lib/test/rebaserAxiomaticTests.js

@@ -1,202 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { makeAnonChange, tagChange, tagRollbackInverse, } from "../core/index.js";
-import { fail } from "../util/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { rebaseRevisionMetadataFromInfo } from "../feature-libraries/modular-schema/index.js";
-import { defaultRevInfosFromChanges, defaultRevisionMetadataFromChanges } from "./utils.js";
-import { generatePossibleSequenceOfEdits, makeIntentionMinter, } from "./exhaustiveRebaserUtils.js";
-const defaultSuiteOptions = {
-    /**
-     * Some FieldKinds don't pass this suite and can override this option to skip it.
-     */
-    skipRebaseOverCompose: false,
-    /**
-     * Runs sub-suites as an individual test to reduce test discovery time
-     */
-    groupSubSuites: false,
-    numberOfEditsToRebase: 2,
-    numberOfEditsToRebaseOver: 2,
-    numberOfEditsToVerifyAssociativity: 4,
-};
-/**
- * Rebases `change` over all edits in `rebasePath`.
- * @param rebase - The rebase function to use.
- * @param change - The change to rebase
- * @param rebasePath - The edits to rebase over.
- * Must contain all the prior edits from the branch that `change` comes from.
- * For example, if `change` is B in branch [A, B, C], being rebased over edits [X, Y],
- * then `rebasePath` must be [A⁻¹, X, Y, A'].
- */
-function rebaseTagged(rebase, change, rebasePath) {
-    let currChange = change;
-    const revisionInfo = defaultRevInfosFromChanges(rebasePath);
-    for (const base of rebasePath) {
-        const metadata = rebaseRevisionMetadataFromInfo(revisionInfo, [base.revision]);
-        currChange = tagChange(rebase(currChange.change, base, metadata), currChange.revision);
-    }
-    return currChange;
-}
-export function runExhaustiveComposeRebaseSuite(initialStates, generateChildStates, fieldRebaser, options) {
-    const assertDeepEqual = getDefaultedEqualityAssert(fieldRebaser);
-    const definedOptions = { ...defaultSuiteOptions, ...options };
-    // To limit combinatorial explosion, we test 'rebasing over a compose is equivalent to rebasing over the individual edits'
-    // by:
-    // - Rebasing a single edit over N sequential edits
-    // - Rebasing N sequential edits over a single edit, sandwich-rebasing style
-    //   (meaning [A, B, C] ↷ D involves B ↷ compose([A⁻¹, D, A']) and C ↷ compose([B⁻¹, A⁻¹, D, A', B']))
-    const { numberOfEditsToRebaseOver, numberOfEditsToRebase, numberOfEditsToVerifyAssociativity, groupSubSuites, } = definedOptions;
-    // Skip the "Rebase over compose" suite if specified to in the suite options.
-    const rebaseOverComposeDescribe = definedOptions.skipRebaseOverCompose
-        ? describe.skip
-        : describe;
-    const [outerFixture, innerFixture] = groupSubSuites
-        ? [it, (title, fn) => fn()]
-        : [describe, it];
-    rebaseOverComposeDescribe("Rebase over compose", () => {
-        for (const initialState of initialStates) {
-            const intentionMinter = makeIntentionMinter();
-            outerFixture(`starting with contents ${JSON.stringify(initialState.content)}`, () => {
-                const localEdits = Array.from(generatePossibleSequenceOfEdits(initialState, generateChildStates, 1, "local-rev-", intentionMinter));
-                const trunkEdits = Array.from(generatePossibleSequenceOfEdits(initialState, generateChildStates, numberOfEditsToRebaseOver, "trunk-rev-", intentionMinter));
-                for (const [{ description: name, changeset: edit }] of localEdits) {
-                    for (const namedEditsToRebaseOver of trunkEdits) {
-                        const title = `Rebase ${name} over compose ${JSON.stringify(namedEditsToRebaseOver.map(({ description }) => description))}`;
-                        innerFixture(title, () => {
-                            rebaseOverSinglesVsRebaseOverCompositions(edit, namedEditsToRebaseOver, fieldRebaser);
-                        });
-                    }
-                }
-            });
-        }
-    });
-    describe("Composed sandwich rebase over single edit", () => {
-        for (const initialState of initialStates) {
-            outerFixture(`starting with contents ${JSON.stringify(initialState.content)}`, () => {
-                const intentionMinter = makeIntentionMinter();
-                const localEdits = Array.from(generatePossibleSequenceOfEdits(initialState, generateChildStates, numberOfEditsToRebase, "local-rev-", intentionMinter));
-                const trunkEdits = Array.from(generatePossibleSequenceOfEdits(initialState, generateChildStates, 1, "trunk-rev-", intentionMinter));
-                for (const namedSourceEdits of localEdits) {
-                    for (const [{ description: name, changeset: namedEditToRebaseOver },] of trunkEdits) {
-                        const title = `Rebase ${JSON.stringify(namedSourceEdits.map(({ description }) => description))} over ${name}`;
-                        innerFixture(title, () => {
-                            const editToRebaseOver = namedEditToRebaseOver;
-                            const sourceEdits = namedSourceEdits.map(({ changeset }) => changeset);
-                            const rollbacks = sourceEdits.map((change) => tagRollbackInverse(fieldRebaser.invert(change, true), `rollback-${change.revision}`, change.revision));
-                            rollbacks.reverse();
-                            const rebasedEditsWithoutCompose = sandwichRebaseWithoutCompose(sourceEdits, rollbacks, editToRebaseOver, fieldRebaser);
-                            const rebasedEditsWithCompose = sandwichRebaseWithCompose(sourceEdits, rollbacks, editToRebaseOver, fieldRebaser);
-                            for (let i = 0; i < rebasedEditsWithoutCompose.length; i++) {
-                                assertDeepEqual(rebasedEditsWithoutCompose[i], rebasedEditsWithCompose[i]);
-                            }
-                            // TODO: consider testing the compose associativity with the `rebasedEditsWithoutCompose` as well.
-                            const allTaggedEdits = [
-                                ...rollbacks,
-                                editToRebaseOver,
-                                ...rebasedEditsWithCompose,
-                            ];
-                            verifyComposeAssociativity(allTaggedEdits, fieldRebaser);
-                        });
-                    }
-                }
-            });
-        }
-    });
-    describe("Compose associativity", () => {
-        for (const initialState of initialStates) {
-            outerFixture(`starting with contents ${JSON.stringify(initialState.content)}`, () => {
-                for (const namedSourceEdits of generatePossibleSequenceOfEdits(initialState, generateChildStates, numberOfEditsToVerifyAssociativity, "rev-")) {
-                    const title = `for ${JSON.stringify(namedSourceEdits.map(({ description }) => description))}`;
-                    // Note that this test case doesn't verify associativity of rollback inverses.
-                    // That's covered some by "Composed sandwich rebase over single edit"
-                    innerFixture(title, () => {
-                        const edits = namedSourceEdits.map(({ changeset }) => changeset);
-                        verifyComposeAssociativity(edits, fieldRebaser);
-                    });
-                }
-            });
-        }
-    });
-}
-function sandwichRebaseWithCompose(sourceEdits, rollbacks, editToRebaseOver, fieldRebaser) {
-    const rebasedEditsWithCompose = [];
-    let compositionScope = [editToRebaseOver];
-    let currentComposedEdit = editToRebaseOver;
-    // This needs to be used to pass an updated RevisionMetadataSource to rebase.
-    for (let i = 0; i < sourceEdits.length; i++) {
-        const edit = sourceEdits[i];
-        const rebasePath = [
-            ...rollbacks.slice(sourceEdits.length - i),
-            editToRebaseOver,
-            ...sourceEdits.slice(0, i),
-        ];
-        const rebaseMetadata = rebaseRevisionMetadataFromInfo(defaultRevInfosFromChanges(rebasePath), [editToRebaseOver.revision]);
-        const rebasedEdit = tagChange(fieldRebaser.rebaseComposed(rebaseMetadata, edit.change, currentComposedEdit), edit.revision);
-        rebasedEditsWithCompose.push(rebasedEdit);
-        compositionScope = [
-            rollbacks[sourceEdits.length - i - 1],
-            ...compositionScope,
-            rebasedEdit,
-        ];
-        const composeMetadata = defaultRevisionMetadataFromChanges(compositionScope);
-        currentComposedEdit = makeAnonChange(fieldRebaser.compose(rollbacks[sourceEdits.length - i - 1], currentComposedEdit, composeMetadata));
-        currentComposedEdit = makeAnonChange(fieldRebaser.compose(currentComposedEdit, rebasedEdit, composeMetadata));
-    }
-    return rebasedEditsWithCompose;
-}
-function sandwichRebaseWithoutCompose(sourceEdits, rollbacks, editToRebaseOver, fieldRebaser) {
-    const rebasedEditsWithoutCompose = [];
-    for (let i = 0; i < sourceEdits.length; i++) {
-        const edit = sourceEdits[i];
-        const rebasePath = [
-            ...rollbacks.slice(sourceEdits.length - i),
-            editToRebaseOver,
-            ...rebasedEditsWithoutCompose,
-        ];
-        rebasedEditsWithoutCompose.push(rebaseTagged(fieldRebaser.rebase, edit, rebasePath));
-    }
-    return rebasedEditsWithoutCompose;
-}
-function rebaseOverSinglesVsRebaseOverCompositions(edit, namedEditsToRebaseOver, fieldRebaser) {
-    const editsToRebaseOver = namedEditsToRebaseOver.map(({ changeset }) => changeset);
-    // Rebase over each base edit individually
-    const rebaseWithoutCompose = rebaseTagged(fieldRebaser.rebase, edit, editsToRebaseOver).change;
-    // Rebase over the composition of base edits
-    const metadata = rebaseRevisionMetadataFromInfo(defaultRevInfosFromChanges(editsToRebaseOver), editsToRebaseOver.map(({ revision }) => revision));
-    const rebaseWithCompose = fieldRebaser.rebaseComposed(metadata, edit.change, ...editsToRebaseOver);
-    const assertDeepEqual = getDefaultedEqualityAssert(fieldRebaser);
-    assertDeepEqual(tagChange(rebaseWithCompose, edit.revision), tagChange(rebaseWithoutCompose, edit.revision));
-}
-function verifyComposeAssociativity(edits, fieldRebaser) {
-    const metadata = defaultRevisionMetadataFromChanges(edits);
-    const singlyComposed = makeAnonChange(composeArray(fieldRebaser, edits, metadata));
-    const leftPartialCompositions = [
-        edits.at(0) ?? fail("Expected at least one edit"),
-    ];
-    for (let i = 1; i < edits.length; i++) {
-        leftPartialCompositions.push(makeAnonChange(fieldRebaser.compose(leftPartialCompositions.at(-1) ?? fail("Expected at least one edit"), edits[i], metadata)));
-    }
-    const rightPartialCompositions = [
-        edits.at(-1) ?? fail("Expected at least one edit"),
-    ];
-    for (let i = edits.length - 2; i >= 0; i--) {
-        rightPartialCompositions.push(makeAnonChange(fieldRebaser.compose(edits[i], rightPartialCompositions.at(-1) ?? fail("Expected at least one edit"), metadata)));
-    }
-    const assertDeepEqual = getDefaultedEqualityAssert(fieldRebaser);
-    assertDeepEqual(leftPartialCompositions.at(-1), singlyComposed);
-    assertDeepEqual(rightPartialCompositions.at(-1), singlyComposed);
-}
-function getDefaultedEqualityAssert(fieldRebaser) {
-    return fieldRebaser.assertEqual ?? ((a, b) => assert.deepEqual(a, b));
-}
-function composeArray(fieldRebaser, changes, metadata) {
-    let composed = fieldRebaser.createEmpty();
-    for (const change of changes) {
-        composed = fieldRebaser.compose(makeAnonChange(composed), change, metadata);
-    }
-    return composed;
-}
-//# sourceMappingURL=rebaserAxiomaticTests.js.map

package/lib/test/rebaserAxiomaticTests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rebaserAxiomaticTests.js","sourceRoot":"","sources":["../../src/test/rebaserAxiomaticTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,cAAc,EAGd,SAAS,EAET,kBAAkB,GAClB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,sDAAsD;AACtD,OAAO,EAAE,8BAA8B,EAAE,MAAM,8CAA8C,CAAC;AAC9F,OAAO,EAAE,0BAA0B,EAAE,kCAAkC,EAAE,MAAM,YAAY,CAAC;AAC5F,OAAO,EAEN,+BAA+B,EAG/B,mBAAmB,GAEnB,MAAM,6BAA6B,CAAC;AAUrC,MAAM,mBAAmB,GAAqC;IAC7D;;OAEG;IACH,qBAAqB,EAAE,KAAK;IAC5B;;OAEG;IACH,cAAc,EAAE,KAAK;IACrB,qBAAqB,EAAE,CAAC;IACxB,yBAAyB,EAAE,CAAC;IAC5B,kCAAkC,EAAE,CAAC;CACrC,CAAC;AAEF;;;;;;;;GAQG;AACH,SAAS,YAAY,CACpB,MAAqD,EACrD,MAAgC,EAChC,UAAsC;IAEtC,IAAI,UAAU,GAAG,MAAM,CAAC;IACxB,MAAM,YAAY,GAAG,0BAA0B,CAAC,UAAU,CAAC,CAAC;IAC5D,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE;QAC9B,MAAM,QAAQ,GAAG,8BAA8B,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/E,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;KACvF;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,+BAA+B,CAC9C,aAAqD,EACrD,mBAA8D,EAC9D,YAAiD,EACjD,OAAgC;IAEhC,MAAM,eAAe,GAAG,0BAA0B,CAAC,YAAY,CAAC,CAAC;IACjE,MAAM,cAAc,GAAG,EAAE,GAAG,mBAAmB,EAAE,GAAG,OAAO,EAAE,CAAC;IAE9D,0HAA0H;IAC1H,MAAM;IACN,mDAAmD;IACnD,4EAA4E;IAC5E,sGAAsG;IACtG,MAAM,EACL,yBAAyB,EACzB,qBAAqB,EACrB,kCAAkC,EAClC,cAAc,GACd,GAAG,cAAc,CAAC;IAEnB,6EAA6E;IAC7E,MAAM,yBAAyB,GAAG,cAAc,CAAC,qBAAqB;QACrE,CAAC,CAAC,QAAQ,CAAC,IAAI;QACf,CAAC,CAAC,QAAQ,CAAC;IAEZ,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,GAAG,cAAc;QAClD,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAa,EAAE,EAAc,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAElB,yBAAyB,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACrD,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;YACzC,MAAM,eAAe,GAAG,mBAAmB,EAAE,CAAC;YAC9C,YAAY,CAAC,0BAA0B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACnF,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAC5B,+BAA+B,CAC9B,YAAY,EACZ,mBAAmB,EACnB,CAAC,EACD,YAAY,EACZ,eAAe,CACf,CACD,CAAC;gBACF,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAC5B,+BAA+B,CAC9B,YAAY,EACZ,mBAAmB,EACnB,yBAAyB,EACzB,YAAY,EACZ,eAAe,CACf,CACD,CAAC;gBACF,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,IAAI,UAAU,EAAE;oBAClE,KAAK,MAAM,sBAAsB,IAAI,UAAU,EAAE;wBAChD,MAAM,KAAK,GAAG,UAAU,IAAI,iBAAiB,IAAI,CAAC,SAAS,CAC1D,sBAAsB,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,CAC5D,EAAE,CAAC;wBAEJ,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;4BACxB,yCAAyC,CACxC,IAAI,EACJ,sBAAsB,EACtB,YAAY,CACZ,CAAC;wBACH,CAAC,CAAC,CAAC;qBACH;iBACD;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2CAA2C,EAAE,GAAG,EAAE;QAC1D,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;YACzC,YAAY,CAAC,0BAA0B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACnF,MAAM,eAAe,GAAG,mBAAmB,EAAE,CAAC;gBAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAC5B,+BAA+B,CAC9B,YAAY,EACZ,mBAAmB,EACnB,qBAAqB,EACrB,YAAY,EACZ,eAAe,CACf,CACD,CAAC;gBACF,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAC5B,+BAA+B,CAC9B,YAAY,EACZ,mBAAmB,EACnB,CAAC,EACD,YAAY,EACZ,eAAe,CACf,CACD,CAAC;gBACF,KAAK,MAAM,gBAAgB,IAAI,UAAU,EAAE;oBAC1C,KAAK,MAAM,CACV,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,qBAAqB,EAAE,EACvD,IAAI,UAAU,EAAE;wBAChB,MAAM,KAAK,GAAG,UAAU,IAAI,CAAC,SAAS,CACrC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,CACtD,SAAS,IAAI,EAAE,CAAC;wBAEjB,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;4BACxB,MAAM,gBAAgB,GAAG,qBAAqB,CAAC;4BAC/C,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;4BAEvE,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAC5C,kBAAkB,CACjB,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EACjC,YAAY,MAAM,CAAC,QAAQ,EAA4B,EACvD,MAAM,CAAC,QAAQ,CACf,CACD,CAAC;4BACF,SAAS,CAAC,OAAO,EAAE,CAAC;4BAEpB,MAAM,0BAA0B,GAAG,4BAA4B,CAC9D,WAAW,EACX,SAAS,EACT,gBAAgB,EAChB,YAAY,CACZ,CAAC;4BAEF,MAAM,uBAAuB,GAAG,yBAAyB,CACxD,WAAW,EACX,SAAS,EACT,gBAAgB,EAChB,YAAY,CACZ,CAAC;4BAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,0BAA0B,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCAC3D,eAAe,CACd,0BAA0B,CAAC,CAAC,CAAC,EAC7B,uBAAuB,CAAC,CAAC,CAAC,CAC1B,CAAC;6BACF;4BAED,kGAAkG;4BAClG,MAAM,cAAc,GAAG;gCACtB,GAAG,SAAS;gCACZ,gBAAgB;gCAChB,GAAG,uBAAuB;6BAC1B,CAAC;4BACF,0BAA0B,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;wBAC1D,CAAC,CAAC,CAAC;qBACH;iBACD;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACtC,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;YACzC,YAAY,CAAC,0BAA0B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACnF,KAAK,MAAM,gBAAgB,IAAI,+BAA+B,CAC7D,YAAY,EACZ,mBAAmB,EACnB,kCAAkC,EAClC,MAAM,CACN,EAAE;oBACF,MAAM,KAAK,GAAG,OAAO,IAAI,CAAC,SAAS,CAClC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,CACtD,EAAE,CAAC;oBAEJ,8EAA8E;oBAC9E,qEAAqE;oBACrE,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;wBACxB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;wBACjE,0BAA0B,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;oBACjD,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,yBAAyB,CACjC,WAAuC,EACvC,SAAqC,EACrC,gBAA0C,EAC1C,YAAiD;IAEjD,MAAM,uBAAuB,GAA+B,EAAE,CAAC;IAC/D,IAAI,gBAAgB,GAA+B,CAAC,gBAAgB,CAAC,CAAC;IACtE,IAAI,mBAAmB,GAAG,gBAAgB,CAAC;IAC3C,6EAA6E;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,UAAU,GAAG;YAClB,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1C,gBAAgB;YAChB,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SAC1B,CAAC;QACF,MAAM,cAAc,GAAG,8BAA8B,CACpD,0BAA0B,CAAC,UAAU,CAAC,EACtC,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAC3B,CAAC;QACF,MAAM,WAAW,GAAG,SAAS,CAC5B,YAAY,CAAC,cAAc,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC,EAC7E,IAAI,CAAC,QAAQ,CACb,CAAC;QACF,uBAAuB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC1C,gBAAgB,GAAG;YAClB,SAAS,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;YACrC,GAAG,gBAAgB;YACnB,WAAW;SACX,CAAC;QACF,MAAM,eAAe,GAAG,kCAAkC,CAAC,gBAAgB,CAAC,CAAC;QAC7E,mBAAmB,GAAG,cAAc,CACnC,YAAY,CAAC,OAAO,CACnB,SAAS,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,EACrC,mBAAmB,EACnB,eAAe,CACf,CACD,CAAC;QAEF,mBAAmB,GAAG,cAAc,CACnC,YAAY,CAAC,OAAO,CAAC,mBAAmB,EAAE,WAAW,EAAE,eAAe,CAAC,CACvE,CAAC;KACF;IACD,OAAO,uBAAuB,CAAC;AAChC,CAAC;AAED,SAAS,4BAA4B,CACpC,WAAuC,EACvC,SAA8B,EAC9B,gBAA0C,EAC1C,YAAiD;IAEjD,MAAM,0BAA0B,GAA+B,EAAE,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,UAAU,GAAG;YAClB,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1C,gBAAgB;YAChB,GAAG,0BAA0B;SAC7B,CAAC;QACF,0BAA0B,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;KACrF;IACD,OAAO,0BAA0B,CAAC;AACnC,CAAC;AAED,SAAS,yCAAyC,CACjD,IAA8B,EAC9B,sBAAoD,EACpD,YAAiD;IAEjD,MAAM,iBAAiB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;IAEnF,0CAA0C;IAC1C,MAAM,oBAAoB,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAC,MAAM,CAAC;IAE/F,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,8BAA8B,CAC9C,0BAA0B,CAAC,iBAAiB,CAAC,EAC7C,iBAAiB,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,CACjD,CAAC;IACF,MAAM,iBAAiB,GAAG,YAAY,CAAC,cAAc,CACpD,QAAQ,EACR,IAAI,CAAC,MAAM,EACX,GAAG,iBAAiB,CACpB,CAAC;IAEF,MAAM,eAAe,GAAG,0BAA0B,CAAC,YAAY,CAAC,CAAC;IACjE,eAAe,CACd,SAAS,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,EAC3C,SAAS,CAAC,oBAAoB,EAAE,IAAI,CAAC,QAAQ,CAAC,CAC9C,CAAC;AACH,CAAC;AAED,SAAS,0BAA0B,CAClC,KAAiC,EACjC,YAAiD;IAEjD,MAAM,QAAQ,GAAG,kCAAkC,CAAC,KAAK,CAAC,CAAC;IAC3D,MAAM,cAAc,GAAG,cAAc,CAAC,YAAY,CAAC,YAAY,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;IACnF,MAAM,uBAAuB,GAA+B;QAC3D,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,4BAA4B,CAAC;KACjD,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,uBAAuB,CAAC,IAAI,CAC3B,cAAc,CACb,YAAY,CAAC,OAAO,CACnB,uBAAuB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,4BAA4B,CAAC,EACpE,KAAK,CAAC,CAAC,CAAC,EACR,QAAQ,CACR,CACD,CACD,CAAC;KACF;IAED,MAAM,wBAAwB,GAA+B;QAC5D,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,4BAA4B,CAAC;KAClD,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3C,wBAAwB,CAAC,IAAI,CAC5B,cAAc,CACb,YAAY,CAAC,OAAO,CACnB,KAAK,CAAC,CAAC,CAAC,EACR,wBAAwB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,4BAA4B,CAAC,EACrE,QAAQ,CACR,CACD,CACD,CAAC;KACF;IAED,MAAM,eAAe,GAAG,0BAA0B,CAAC,YAAY,CAAC,CAAC;IACjE,eAAe,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAChE,eAAe,CAAC,wBAAwB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,0BAA0B,CAAa,YAAiD;IAChG,OAAO,YAAY,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,YAAY,CACpB,YAAiD,EACjD,OAAmC,EACnC,QAAgC;IAEhC,IAAI,QAAQ,GAAe,YAAY,CAAC,WAAW,EAAE,CAAC;IACtD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;KAC5E;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport {\n\tmakeAnonChange,\n\tRevisionMetadataSource,\n\tRevisionTag,\n\ttagChange,\n\tTaggedChange,\n\ttagRollbackInverse,\n} from \"../core/index.js\";\nimport { fail } from \"../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { rebaseRevisionMetadataFromInfo } from \"../feature-libraries/modular-schema/index.js\";\nimport { defaultRevInfosFromChanges, defaultRevisionMetadataFromChanges } from \"./utils.js\";\nimport {\n\tFieldStateTree,\n\tgeneratePossibleSequenceOfEdits,\n\tChildStateGenerator,\n\tBoundFieldChangeRebaser,\n\tmakeIntentionMinter,\n\tNamedChangeset,\n} from \"./exhaustiveRebaserUtils.js\";\n\ninterface ExhaustiveSuiteOptions {\n\tskipRebaseOverCompose?: boolean;\n\tgroupSubSuites?: boolean;\n\tnumberOfEditsToRebase?: number;\n\tnumberOfEditsToRebaseOver?: number;\n\tnumberOfEditsToVerifyAssociativity?: number;\n}\n\nconst defaultSuiteOptions: Required<ExhaustiveSuiteOptions> = {\n\t/**\n\t * Some FieldKinds don't pass this suite and can override this option to skip it.\n\t */\n\tskipRebaseOverCompose: false,\n\t/**\n\t * Runs sub-suites as an individual test to reduce test discovery time\n\t */\n\tgroupSubSuites: false,\n\tnumberOfEditsToRebase: 2,\n\tnumberOfEditsToRebaseOver: 2,\n\tnumberOfEditsToVerifyAssociativity: 4,\n};\n\n/**\n * Rebases `change` over all edits in `rebasePath`.\n * @param rebase - The rebase function to use.\n * @param change - The change to rebase\n * @param rebasePath - The edits to rebase over.\n * Must contain all the prior edits from the branch that `change` comes from.\n * For example, if `change` is B in branch [A, B, C], being rebased over edits [X, Y],\n * then `rebasePath` must be [A⁻¹, X, Y, A'].\n */\nfunction rebaseTagged<TChangeset>(\n\trebase: BoundFieldChangeRebaser<TChangeset>[\"rebase\"],\n\tchange: TaggedChange<TChangeset>,\n\trebasePath: TaggedChange<TChangeset>[],\n): TaggedChange<TChangeset> {\n\tlet currChange = change;\n\tconst revisionInfo = defaultRevInfosFromChanges(rebasePath);\n\tfor (const base of rebasePath) {\n\t\tconst metadata = rebaseRevisionMetadataFromInfo(revisionInfo, [base.revision]);\n\t\tcurrChange = tagChange(rebase(currChange.change, base, metadata), currChange.revision);\n\t}\n\n\treturn currChange;\n}\n\nexport function runExhaustiveComposeRebaseSuite<TContent, TChangeset>(\n\tinitialStates: FieldStateTree<TContent, TChangeset>[],\n\tgenerateChildStates: ChildStateGenerator<TContent, TChangeset>,\n\tfieldRebaser: BoundFieldChangeRebaser<TChangeset>,\n\toptions?: ExhaustiveSuiteOptions,\n) {\n\tconst assertDeepEqual = getDefaultedEqualityAssert(fieldRebaser);\n\tconst definedOptions = { ...defaultSuiteOptions, ...options };\n\n\t// To limit combinatorial explosion, we test 'rebasing over a compose is equivalent to rebasing over the individual edits'\n\t// by:\n\t// - Rebasing a single edit over N sequential edits\n\t// - Rebasing N sequential edits over a single edit, sandwich-rebasing style\n\t//   (meaning [A, B, C] ↷ D involves B ↷ compose([A⁻¹, D, A']) and C ↷ compose([B⁻¹, A⁻¹, D, A', B']))\n\tconst {\n\t\tnumberOfEditsToRebaseOver,\n\t\tnumberOfEditsToRebase,\n\t\tnumberOfEditsToVerifyAssociativity,\n\t\tgroupSubSuites,\n\t} = definedOptions;\n\n\t// Skip the \"Rebase over compose\" suite if specified to in the suite options.\n\tconst rebaseOverComposeDescribe = definedOptions.skipRebaseOverCompose\n\t\t? describe.skip\n\t\t: describe;\n\n\tconst [outerFixture, innerFixture] = groupSubSuites\n\t\t? [it, (title: string, fn: () => void) => fn()]\n\t\t: [describe, it];\n\n\trebaseOverComposeDescribe(\"Rebase over compose\", () => {\n\t\tfor (const initialState of initialStates) {\n\t\t\tconst intentionMinter = makeIntentionMinter();\n\t\t\touterFixture(`starting with contents ${JSON.stringify(initialState.content)}`, () => {\n\t\t\t\tconst localEdits = Array.from(\n\t\t\t\t\tgeneratePossibleSequenceOfEdits(\n\t\t\t\t\t\tinitialState,\n\t\t\t\t\t\tgenerateChildStates,\n\t\t\t\t\t\t1,\n\t\t\t\t\t\t\"local-rev-\",\n\t\t\t\t\t\tintentionMinter,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tconst trunkEdits = Array.from(\n\t\t\t\t\tgeneratePossibleSequenceOfEdits(\n\t\t\t\t\t\tinitialState,\n\t\t\t\t\t\tgenerateChildStates,\n\t\t\t\t\t\tnumberOfEditsToRebaseOver,\n\t\t\t\t\t\t\"trunk-rev-\",\n\t\t\t\t\t\tintentionMinter,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tfor (const [{ description: name, changeset: edit }] of localEdits) {\n\t\t\t\t\tfor (const namedEditsToRebaseOver of trunkEdits) {\n\t\t\t\t\t\tconst title = `Rebase ${name} over compose ${JSON.stringify(\n\t\t\t\t\t\t\tnamedEditsToRebaseOver.map(({ description }) => description),\n\t\t\t\t\t\t)}`;\n\n\t\t\t\t\t\tinnerFixture(title, () => {\n\t\t\t\t\t\t\trebaseOverSinglesVsRebaseOverCompositions<TChangeset>(\n\t\t\t\t\t\t\t\tedit,\n\t\t\t\t\t\t\t\tnamedEditsToRebaseOver,\n\t\t\t\t\t\t\t\tfieldRebaser,\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}\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"Composed sandwich rebase over single edit\", () => {\n\t\tfor (const initialState of initialStates) {\n\t\t\touterFixture(`starting with contents ${JSON.stringify(initialState.content)}`, () => {\n\t\t\t\tconst intentionMinter = makeIntentionMinter();\n\t\t\t\tconst localEdits = Array.from(\n\t\t\t\t\tgeneratePossibleSequenceOfEdits(\n\t\t\t\t\t\tinitialState,\n\t\t\t\t\t\tgenerateChildStates,\n\t\t\t\t\t\tnumberOfEditsToRebase,\n\t\t\t\t\t\t\"local-rev-\",\n\t\t\t\t\t\tintentionMinter,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tconst trunkEdits = Array.from(\n\t\t\t\t\tgeneratePossibleSequenceOfEdits(\n\t\t\t\t\t\tinitialState,\n\t\t\t\t\t\tgenerateChildStates,\n\t\t\t\t\t\t1,\n\t\t\t\t\t\t\"trunk-rev-\",\n\t\t\t\t\t\tintentionMinter,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tfor (const namedSourceEdits of localEdits) {\n\t\t\t\t\tfor (const [\n\t\t\t\t\t\t{ description: name, changeset: namedEditToRebaseOver },\n\t\t\t\t\t] of trunkEdits) {\n\t\t\t\t\t\tconst title = `Rebase ${JSON.stringify(\n\t\t\t\t\t\t\tnamedSourceEdits.map(({ description }) => description),\n\t\t\t\t\t\t)} over ${name}`;\n\n\t\t\t\t\t\tinnerFixture(title, () => {\n\t\t\t\t\t\t\tconst editToRebaseOver = namedEditToRebaseOver;\n\t\t\t\t\t\t\tconst sourceEdits = namedSourceEdits.map(({ changeset }) => changeset);\n\n\t\t\t\t\t\t\tconst rollbacks = sourceEdits.map((change) =>\n\t\t\t\t\t\t\t\ttagRollbackInverse(\n\t\t\t\t\t\t\t\t\tfieldRebaser.invert(change, true),\n\t\t\t\t\t\t\t\t\t`rollback-${change.revision}` as unknown as RevisionTag,\n\t\t\t\t\t\t\t\t\tchange.revision,\n\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\trollbacks.reverse();\n\n\t\t\t\t\t\t\tconst rebasedEditsWithoutCompose = sandwichRebaseWithoutCompose(\n\t\t\t\t\t\t\t\tsourceEdits,\n\t\t\t\t\t\t\t\trollbacks,\n\t\t\t\t\t\t\t\teditToRebaseOver,\n\t\t\t\t\t\t\t\tfieldRebaser,\n\t\t\t\t\t\t\t);\n\n\t\t\t\t\t\t\tconst rebasedEditsWithCompose = sandwichRebaseWithCompose(\n\t\t\t\t\t\t\t\tsourceEdits,\n\t\t\t\t\t\t\t\trollbacks,\n\t\t\t\t\t\t\t\teditToRebaseOver,\n\t\t\t\t\t\t\t\tfieldRebaser,\n\t\t\t\t\t\t\t);\n\n\t\t\t\t\t\t\tfor (let i = 0; i < rebasedEditsWithoutCompose.length; i++) {\n\t\t\t\t\t\t\t\tassertDeepEqual(\n\t\t\t\t\t\t\t\t\trebasedEditsWithoutCompose[i],\n\t\t\t\t\t\t\t\t\trebasedEditsWithCompose[i],\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// TODO: consider testing the compose associativity with the `rebasedEditsWithoutCompose` as well.\n\t\t\t\t\t\t\tconst allTaggedEdits = [\n\t\t\t\t\t\t\t\t...rollbacks,\n\t\t\t\t\t\t\t\teditToRebaseOver,\n\t\t\t\t\t\t\t\t...rebasedEditsWithCompose,\n\t\t\t\t\t\t\t];\n\t\t\t\t\t\t\tverifyComposeAssociativity(allTaggedEdits, fieldRebaser);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"Compose associativity\", () => {\n\t\tfor (const initialState of initialStates) {\n\t\t\touterFixture(`starting with contents ${JSON.stringify(initialState.content)}`, () => {\n\t\t\t\tfor (const namedSourceEdits of generatePossibleSequenceOfEdits(\n\t\t\t\t\tinitialState,\n\t\t\t\t\tgenerateChildStates,\n\t\t\t\t\tnumberOfEditsToVerifyAssociativity,\n\t\t\t\t\t\"rev-\",\n\t\t\t\t)) {\n\t\t\t\t\tconst title = `for ${JSON.stringify(\n\t\t\t\t\t\tnamedSourceEdits.map(({ description }) => description),\n\t\t\t\t\t)}`;\n\n\t\t\t\t\t// Note that this test case doesn't verify associativity of rollback inverses.\n\t\t\t\t\t// That's covered some by \"Composed sandwich rebase over single edit\"\n\t\t\t\t\tinnerFixture(title, () => {\n\t\t\t\t\t\tconst edits = namedSourceEdits.map(({ changeset }) => changeset);\n\t\t\t\t\t\tverifyComposeAssociativity(edits, fieldRebaser);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n}\n\nfunction sandwichRebaseWithCompose<TChangeset>(\n\tsourceEdits: TaggedChange<TChangeset>[],\n\trollbacks: TaggedChange<TChangeset>[],\n\teditToRebaseOver: TaggedChange<TChangeset>,\n\tfieldRebaser: BoundFieldChangeRebaser<TChangeset>,\n): TaggedChange<TChangeset>[] {\n\tconst rebasedEditsWithCompose: TaggedChange<TChangeset>[] = [];\n\tlet compositionScope: TaggedChange<TChangeset>[] = [editToRebaseOver];\n\tlet currentComposedEdit = editToRebaseOver;\n\t// This needs to be used to pass an updated RevisionMetadataSource to rebase.\n\tfor (let i = 0; i < sourceEdits.length; i++) {\n\t\tconst edit = sourceEdits[i];\n\t\tconst rebasePath = [\n\t\t\t...rollbacks.slice(sourceEdits.length - i),\n\t\t\teditToRebaseOver,\n\t\t\t...sourceEdits.slice(0, i),\n\t\t];\n\t\tconst rebaseMetadata = rebaseRevisionMetadataFromInfo(\n\t\t\tdefaultRevInfosFromChanges(rebasePath),\n\t\t\t[editToRebaseOver.revision],\n\t\t);\n\t\tconst rebasedEdit = tagChange(\n\t\t\tfieldRebaser.rebaseComposed(rebaseMetadata, edit.change, currentComposedEdit),\n\t\t\tedit.revision,\n\t\t);\n\t\trebasedEditsWithCompose.push(rebasedEdit);\n\t\tcompositionScope = [\n\t\t\trollbacks[sourceEdits.length - i - 1],\n\t\t\t...compositionScope,\n\t\t\trebasedEdit,\n\t\t];\n\t\tconst composeMetadata = defaultRevisionMetadataFromChanges(compositionScope);\n\t\tcurrentComposedEdit = makeAnonChange(\n\t\t\tfieldRebaser.compose(\n\t\t\t\trollbacks[sourceEdits.length - i - 1],\n\t\t\t\tcurrentComposedEdit,\n\t\t\t\tcomposeMetadata,\n\t\t\t),\n\t\t);\n\n\t\tcurrentComposedEdit = makeAnonChange(\n\t\t\tfieldRebaser.compose(currentComposedEdit, rebasedEdit, composeMetadata),\n\t\t);\n\t}\n\treturn rebasedEditsWithCompose;\n}\n\nfunction sandwichRebaseWithoutCompose<TChangeset>(\n\tsourceEdits: TaggedChange<TChangeset>[],\n\trollbacks: TaggedChange<any>[],\n\teditToRebaseOver: TaggedChange<TChangeset>,\n\tfieldRebaser: BoundFieldChangeRebaser<TChangeset>,\n): TaggedChange<TChangeset>[] {\n\tconst rebasedEditsWithoutCompose: TaggedChange<TChangeset>[] = [];\n\tfor (let i = 0; i < sourceEdits.length; i++) {\n\t\tconst edit = sourceEdits[i];\n\t\tconst rebasePath = [\n\t\t\t...rollbacks.slice(sourceEdits.length - i),\n\t\t\teditToRebaseOver,\n\t\t\t...rebasedEditsWithoutCompose,\n\t\t];\n\t\trebasedEditsWithoutCompose.push(rebaseTagged(fieldRebaser.rebase, edit, rebasePath));\n\t}\n\treturn rebasedEditsWithoutCompose;\n}\n\nfunction rebaseOverSinglesVsRebaseOverCompositions<TChangeset>(\n\tedit: TaggedChange<TChangeset>,\n\tnamedEditsToRebaseOver: NamedChangeset<TChangeset>[],\n\tfieldRebaser: BoundFieldChangeRebaser<TChangeset>,\n) {\n\tconst editsToRebaseOver = namedEditsToRebaseOver.map(({ changeset }) => changeset);\n\n\t// Rebase over each base edit individually\n\tconst rebaseWithoutCompose = rebaseTagged(fieldRebaser.rebase, edit, editsToRebaseOver).change;\n\n\t// Rebase over the composition of base edits\n\tconst metadata = rebaseRevisionMetadataFromInfo(\n\t\tdefaultRevInfosFromChanges(editsToRebaseOver),\n\t\teditsToRebaseOver.map(({ revision }) => revision),\n\t);\n\tconst rebaseWithCompose = fieldRebaser.rebaseComposed(\n\t\tmetadata,\n\t\tedit.change,\n\t\t...editsToRebaseOver,\n\t);\n\n\tconst assertDeepEqual = getDefaultedEqualityAssert(fieldRebaser);\n\tassertDeepEqual(\n\t\ttagChange(rebaseWithCompose, edit.revision),\n\t\ttagChange(rebaseWithoutCompose, edit.revision),\n\t);\n}\n\nfunction verifyComposeAssociativity<TChangeset>(\n\tedits: TaggedChange<TChangeset>[],\n\tfieldRebaser: BoundFieldChangeRebaser<TChangeset>,\n) {\n\tconst metadata = defaultRevisionMetadataFromChanges(edits);\n\tconst singlyComposed = makeAnonChange(composeArray(fieldRebaser, edits, metadata));\n\tconst leftPartialCompositions: TaggedChange<TChangeset>[] = [\n\t\tedits.at(0) ?? fail(\"Expected at least one edit\"),\n\t];\n\tfor (let i = 1; i < edits.length; i++) {\n\t\tleftPartialCompositions.push(\n\t\t\tmakeAnonChange(\n\t\t\t\tfieldRebaser.compose(\n\t\t\t\t\tleftPartialCompositions.at(-1) ?? fail(\"Expected at least one edit\"),\n\t\t\t\t\tedits[i],\n\t\t\t\t\tmetadata,\n\t\t\t\t),\n\t\t\t),\n\t\t);\n\t}\n\n\tconst rightPartialCompositions: TaggedChange<TChangeset>[] = [\n\t\tedits.at(-1) ?? fail(\"Expected at least one edit\"),\n\t];\n\tfor (let i = edits.length - 2; i >= 0; i--) {\n\t\trightPartialCompositions.push(\n\t\t\tmakeAnonChange(\n\t\t\t\tfieldRebaser.compose(\n\t\t\t\t\tedits[i],\n\t\t\t\t\trightPartialCompositions.at(-1) ?? fail(\"Expected at least one edit\"),\n\t\t\t\t\tmetadata,\n\t\t\t\t),\n\t\t\t),\n\t\t);\n\t}\n\n\tconst assertDeepEqual = getDefaultedEqualityAssert(fieldRebaser);\n\tassertDeepEqual(leftPartialCompositions.at(-1), singlyComposed);\n\tassertDeepEqual(rightPartialCompositions.at(-1), singlyComposed);\n}\n\nfunction getDefaultedEqualityAssert<TChangeset>(fieldRebaser: BoundFieldChangeRebaser<TChangeset>) {\n\treturn fieldRebaser.assertEqual ?? ((a, b) => assert.deepEqual(a, b));\n}\n\nfunction composeArray<TChangeset>(\n\tfieldRebaser: BoundFieldChangeRebaser<TChangeset>,\n\tchanges: TaggedChange<TChangeset>[],\n\tmetadata: RevisionMetadataSource,\n): TChangeset {\n\tlet composed: TChangeset = fieldRebaser.createEmpty();\n\tfor (const change of changes) {\n\t\tcomposed = fieldRebaser.compose(makeAnonChange(composed), change, metadata);\n\t}\n\n\treturn composed;\n}\n"]}

package/lib/test/scalableTestTrees.d.ts

@@ -1,89 +0,0 @@
-import { FlexFieldSchema, typeNameSymbol } from "../feature-libraries/index.js";
-import { FlexTreeView, TreeContent } from "../shared-tree/index.js";
-import { FieldKey, UpPath } from "../core/index.js";
-/**
- * Test trees which can be parametrically scaled to any size.
- */
-/**
- * Arbitrary key used when a field key is needed in this file.
- */
-export declare const localFieldKey: FieldKey;
-declare const linkedListSchema: import("../feature-libraries/index.js").FlexObjectNodeSchema<"scalable.linkedList", {
-    readonly foo: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [() => import("../feature-libraries/index.js").FlexObjectNodeSchema<"scalable.linkedList", any>, import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>;
-export declare const wideRootSchema: import("../feature-libraries/index.js").FlexObjectNodeSchema<"scalable.WideRoot", {
-    readonly foo: FlexFieldSchema<import("../feature-libraries/index.js").Sequence, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>;
-export declare const wideSchema: import("../feature-libraries/index.js").FlexTreeSchema<FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [import("../feature-libraries/index.js").FlexObjectNodeSchema<"scalable.WideRoot", {
-    readonly foo: FlexFieldSchema<import("../feature-libraries/index.js").Sequence, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>]>>;
-export declare const deepSchema: import("../feature-libraries/index.js").FlexTreeSchema<FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [import("../feature-libraries/index.js").FlexObjectNodeSchema<"scalable.linkedList", {
-    readonly foo: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [() => import("../feature-libraries/index.js").FlexObjectNodeSchema<"scalable.linkedList", any>, import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>, import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>>;
-/**
- * JS object like a deep tree.
- * Compatible with ContextuallyTypedNodeData
- */
-export interface JSDeepTree {
-    [typeNameSymbol]?: typeof linkedListSchema.name | undefined;
-    foo: JSDeepTree | number;
-}
-/**
- * JS object like a wide tree.
- * Compatible with ContextuallyTypedNodeData
- */
-export interface JSWideTree {
-    foo: number[];
-}
-export declare function makeJsDeepTree(depth: number, leafValue: number): JSDeepTree | number;
-export declare function makeDeepContent(depth: number, leafValue?: number): TreeContent<typeof deepSchema.rootFieldSchema>;
-/**
- *
- * @param numberOfNodes - number of nodes of the tree
- * @param endLeafValue - the value of the end leaf of the tree
- * @returns a tree with specified number of nodes, with the end leaf node set to the endLeafValue
- */
-export declare function makeWideContentWithEndValue(numberOfNodes: number, endLeafValue: number): TreeContent<typeof wideSchema.rootFieldSchema>;
-/**
- *
- * @param numberOfNodes - number of nodes of the tree
- * @param endLeafValue - the value of the end leaf of the tree
- * @returns a tree with specified number of nodes, with the end leaf node set to the endLeafValue
- */
-export declare function makeJsWideTreeWithEndValue(numberOfNodes: number, endLeafValue: number): JSWideTree;
-export declare function readDeepTreeAsJSObject(tree: JSDeepTree): {
-    depth: number;
-    value: number;
-};
-export declare function readWideTreeAsJSObject(tree: JSWideTree): {
-    nodesCount: number;
-    sum: number;
-};
-export declare function readWideCursorTree(tree: FlexTreeView<typeof wideSchema.rootFieldSchema>): {
-    nodesCount: number;
-    sum: number;
-};
-export declare function readDeepCursorTree(tree: FlexTreeView<typeof deepSchema.rootFieldSchema>): {
-    depth: number;
-    value: number;
-};
-/**
- * Path to linked list node at provided depth.
- * Depth 1 points to the root node.
- */
-export declare function deepPath(depth: number): UpPath;
-/**
- * Path to linked list node at provided depth.
- * Depth 1 points to the root node.
- */
-export declare function wideLeafPath(index: number): UpPath;
-export declare function readWideEditableTree(tree: FlexTreeView<typeof wideSchema.rootFieldSchema>): {
-    nodesCount: number;
-    sum: number;
-};
-export declare function readDeepEditableTree(tree: FlexTreeView<typeof deepSchema.rootFieldSchema>): {
-    depth: number;
-    value: number;
-};
-export {};
-//# sourceMappingURL=scalableTestTrees.d.ts.map

package/lib/test/scalableTestTrees.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"scalableTestTrees.d.ts","sourceRoot":"","sources":["../../src/test/scalableTestTrees.ts"],"names":[],"mappings":"AAKA,OAAO,EAIN,eAAe,EACf,cAAc,EAEd,MAAM,+BAA+B,CAAC;AAGvC,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,QAAQ,EAAqC,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAEvF;;GAEG;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa,EAAE,QAAuB,CAAC;AASpD,QAAA,MAAM,gBAAgB;;EAEpB,CAAC;AAQH,eAAO,MAAM,cAAc;;EAEzB,CAAC;AAEH,eAAO,MAAM,UAAU;;KAAyC,CAAC;AAEjE,eAAO,MAAM,UAAU;;8IAA0D,CAAC;AAElF;;;GAGG;AACH,MAAM,WAAW,UAAU;IAC1B,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,gBAAgB,CAAC,IAAI,GAAG,SAAS,CAAC;IAC5D,GAAG,EAAE,UAAU,GAAG,MAAM,CAAC;CACzB;AAUD;;;GAGG;AACH,MAAM,WAAW,UAAU;IAC1B,GAAG,EAAE,MAAM,EAAE,CAAC;CACd;AAQD,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,CAEpF;AAED,wBAAgB,eAAe,CAC9B,KAAK,EAAE,MAAM,EACb,SAAS,GAAE,MAAU,GACnB,WAAW,CAAC,OAAO,UAAU,CAAC,eAAe,CAAC,CAOhD;AAED;;;;;GAKG;AACH,wBAAgB,2BAA2B,CAC1C,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GAClB,WAAW,CAAC,OAAO,UAAU,CAAC,eAAe,CAAC,CAOhD;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACzC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GAClB,UAAU,CAOZ;AAED,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,UAAU,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAazF;AAED,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,UAAU,GAAG;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAS5F;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG;IAC1F,UAAU,EAAE,MAAM,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;CACZ,CAaA;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG;IAC1F,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACd,CAcA;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAe9C;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAWlD;AAED,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,YAAY,CAAC,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG;IAC5F,UAAU,EAAE,MAAM,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;CACZ,CAWA;AAED,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,YAAY,CAAC,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG;IAC5F,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACd,CASA"}