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

package/lib/test/feature-libraries/optional-field/optionalChangeRebaser.test.js

@@ -1,352 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { describeStress } from "@fluid-private/stochastic-test-utils";
-import { makeAnonChange, tagChange, tagRollbackInverse, } from "../../../core/index.js";
-// TODO: Throughout this file, we use TestChange as the child change type.
-// This is the same approach used in sequenceChangeRebaser.spec.ts, but it requires casting in this file
-// since OptionalChangeset is not generic over the child changeset type.
-// Search this file for "as any" and "as NodeChangeset"
-import { TestChange } from "../../testChange.js";
-import { deepFreeze, defaultRevInfosFromChanges, defaultRevisionMetadataFromChanges, isDeltaVisible, } from "../../utils.js";
-import { brand, idAllocatorFromMaxId } from "../../../util/index.js";
-import { optionalChangeRebaser, optionalFieldEditor, optionalFieldIntoDelta,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/optional-field/index.js";
-import { getSequentialEdits, generatePossibleSequenceOfEdits, getSequentialStates, } from "../../exhaustiveRebaserUtils.js";
-import { runExhaustiveComposeRebaseSuite } from "../../rebaserAxiomaticTests.js";
-import { rebaseRevisionMetadataFromInfo,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/modular-schema/index.js";
-import { Change, assertTaggedEqual, verifyContextChain } from "./optionalFieldUtils.js";
-function makeRevisionTagMinter(prefix = "rev") {
-    // Rather than use UUIDs, allocate these sequentially for an easier time debugging tests.
-    let currentRevision = 0;
-    return () => `${prefix}${currentRevision++}`;
-}
-const type = brand("Node");
-const mintRevisionTag = makeRevisionTagMinter();
-const tag1 = mintRevisionTag();
-const OptionalChange = {
-    set(value, wasEmpty, ids) {
-        return optionalFieldEditor.set(wasEmpty, ids);
-    },
-    clear(wasEmpty, id) {
-        return optionalFieldEditor.clear(wasEmpty, id);
-    },
-    buildChildChange(childChange) {
-        return optionalFieldEditor.buildChildChange(0, childChange);
-    },
-};
-const failCrossFieldManager = {
-    get: () => assert.fail("Should not query CrossFieldManager"),
-    set: () => assert.fail("Should not modify CrossFieldManager"),
-};
-function toDelta(change, revision) {
-    return optionalFieldIntoDelta(tagChange(change, revision), (childChange) => TestChange.toDelta(tagChange(childChange, revision)));
-}
-function getMaxId(...changes) {
-    let max;
-    const ingest = (candidate) => {
-        if (max === undefined || (candidate !== undefined && candidate > max)) {
-            max = candidate;
-        }
-    };
-    for (const change of changes) {
-        for (const [src, dst] of change.moves) {
-            ingest(src.localId);
-            ingest(dst.localId);
-        }
-        for (const [id] of change.childChanges) {
-            if (id !== "self") {
-                // Child changes do not need to be ingested for this test file, as TestChange (which is used as a child)
-                // doesn't have any `ChangesetLocalId`s.
-                ingest(id.localId);
-            }
-        }
-        if (change.valueReplace !== undefined) {
-            ingest(change.valueReplace.dst.localId);
-            if (change.valueReplace.src !== undefined && change.valueReplace.src !== "self") {
-                ingest(change.valueReplace.src.localId);
-            }
-        }
-    }
-    return max;
-}
-function invert(change, isRollback) {
-    const inverted = optionalChangeRebaser.invert(change, TestChange.invert, isRollback, idAllocatorFromMaxId(), failCrossFieldManager, defaultRevisionMetadataFromChanges([change]));
-    verifyContextChain(change, makeAnonChange(inverted));
-    return inverted;
-}
-function rebase(change, base, metadataArg) {
-    deepFreeze(change);
-    deepFreeze(base);
-    const metadata = metadataArg ??
-        rebaseRevisionMetadataFromInfo(defaultRevInfosFromChanges([base, makeAnonChange(change)]), [
-            base.revision,
-        ]);
-    const moveEffects = failCrossFieldManager;
-    const idAllocator = idAllocatorFromMaxId(getMaxId(change, base.change));
-    const rebased = optionalChangeRebaser.rebase(change, base, TestChange.rebase, idAllocator, moveEffects, metadata, undefined);
-    verifyContextChain(base, makeAnonChange(rebased));
-    return rebased;
-}
-function rebaseTagged(change, ...baseChanges) {
-    let currChange = change;
-    for (const base of baseChanges) {
-        currChange = tagChange(rebase(currChange.change, base), currChange.revision);
-        verifyContextChain(base, currChange);
-    }
-    return currChange;
-}
-function rebaseComposed(metadata, change, ...baseChanges) {
-    baseChanges.forEach((base) => deepFreeze(base));
-    deepFreeze(change);
-    const composed = composeList(baseChanges, metadata);
-    const moveEffects = failCrossFieldManager;
-    const idAllocator = idAllocatorFromMaxId(getMaxId(composed));
-    const rebased = optionalChangeRebaser.rebase(change, makeAnonChange(composed), TestChange.rebase, idAllocator, moveEffects, metadata, undefined);
-    const lastBase = baseChanges.at(-1);
-    if (lastBase !== undefined) {
-        verifyContextChain(lastBase, makeAnonChange(rebased));
-    }
-    return rebased;
-}
-function composeList(changes, metadata) {
-    const moveEffects = failCrossFieldManager;
-    const idAllocator = idAllocatorFromMaxId(getMaxId(...changes.map((c) => c.change)));
-    let composed = Change.empty();
-    const metadataOrDefault = metadata ?? defaultRevisionMetadataFromChanges(changes);
-    for (const change of changes) {
-        verifyContextChain(makeAnonChange(composed), change);
-        composed = optionalChangeRebaser.compose(makeAnonChange(composed), change, TestChange.compose, idAllocator, moveEffects, metadataOrDefault);
-    }
-    return composed;
-}
-function compose(change1, change2, metadata) {
-    verifyContextChain(change1, change2);
-    const moveEffects = failCrossFieldManager;
-    const idAllocator = idAllocatorFromMaxId(getMaxId(change1.change, change2.change));
-    return optionalChangeRebaser.compose(change1, change2, TestChange.compose, idAllocator, moveEffects, metadata ?? defaultRevisionMetadataFromChanges([change1, change2]));
-}
-function computeChildChangeInputContext(inputState) {
-    // This is effectively a filter of the intentions from all edits such that it only includes
-    // intentions for edits which modify the same child as the final one in the changeset.
-    // Note: this takes a dependency on the fact that `generateChildStates` doesn't set matching string
-    // content for what are meant to represent different nodes.
-    const states = getSequentialStates(inputState);
-    const finalContent = states.at(-1)?.content;
-    assert(finalContent !== undefined, "Child change input context should only be computed when the optional field has content.");
-    const intentions = [];
-    let currentContent;
-    for (const state of states) {
-        if (state.mostRecentEdit !== undefined &&
-            currentContent === finalContent &&
-            state.mostRecentEdit.changeset.change.childChanges.length > 0) {
-            if (state.mostRecentEdit.changeset.change.childChanges !== undefined) {
-                intentions.push(state.mostRecentEdit.intention);
-            }
-        }
-        currentContent = state.content;
-    }
-    return intentions;
-}
-/**
- * See {@link ChildStateGenerator}
- */
-const generateChildStates = function* (state, tagFromIntention, mintIntention) {
-    const mintId = mintIntention;
-    const edits = getSequentialEdits(state);
-    if (state.content !== undefined) {
-        const changeChildIntention = mintIntention();
-        yield {
-            content: state.content,
-            mostRecentEdit: {
-                changeset: tagChange(OptionalChange.buildChildChange(TestChange.mint(computeChildChangeInputContext(state), changeChildIntention)), tagFromIntention(changeChildIntention)),
-                intention: changeChildIntention,
-                description: `ChildChange${changeChildIntention}`,
-            },
-            parent: state,
-        };
-        const setUndefinedIntention = mintIntention();
-        yield {
-            content: undefined,
-            mostRecentEdit: {
-                changeset: tagChange(OptionalChange.clear(false, mintId()), tagFromIntention(setUndefinedIntention)),
-                intention: setUndefinedIntention,
-                description: "Remove",
-            },
-            parent: state,
-        };
-    }
-    else {
-        // Even if there is no content, optional field supports an explicit clear operation with LWW semantics,
-        // as a concurrent set operation may populate the field.
-        const setUndefinedIntention = mintIntention();
-        yield {
-            content: undefined,
-            mostRecentEdit: {
-                changeset: tagChange(OptionalChange.clear(true, mintId()), tagFromIntention(setUndefinedIntention)),
-                intention: setUndefinedIntention,
-                description: "Remove",
-            },
-            parent: state,
-        };
-    }
-    for (const value of ["A", "B"]) {
-        const setIntention = mintIntention();
-        const [fill, detach] = [mintId(), mintId()];
-        // Using length of the input context guarantees set operations generated at different times also have different
-        // values, which should tend to be easier to debug.
-        // This also makes the logic to determine intentions simpler.
-        const newContents = `${value},${edits.length}`;
-        yield {
-            content: newContents,
-            mostRecentEdit: {
-                changeset: tagChange(OptionalChange.set(newContents, state.content === undefined, {
-                    fill,
-                    detach,
-                }), tagFromIntention(setIntention)),
-                intention: setIntention,
-                description: `Set${newContents}`,
-            },
-            parent: state,
-        };
-    }
-    if (state.mostRecentEdit !== undefined) {
-        const undoIntention = mintIntention();
-        // We don't use the `invert` helper here, as `TestChange.invert` has logic to negate the intention
-        // of the most recent edit. Instead, we want to mint a new intention. Having correct composition for
-        // the 'negate' operation is already tested via sandwich rebasing.
-        const invertTestChangeViaNewIntention = (change) => {
-            if ("inputContext" in change) {
-                return {
-                    inputContext: change.outputContext,
-                    outputContext: [...change.outputContext, undoIntention],
-                    intentions: [undoIntention],
-                };
-            }
-            return TestChange.emptyChange;
-        };
-        const inverseChangeset = optionalChangeRebaser.invert(state.mostRecentEdit.changeset, invertTestChangeViaNewIntention, false, idAllocatorFromMaxId(), failCrossFieldManager, defaultRevisionMetadataFromChanges([state.mostRecentEdit.changeset]));
-        yield {
-            content: state.parent?.content,
-            mostRecentEdit: {
-                changeset: tagChange(inverseChangeset, tagFromIntention(undoIntention)),
-                intention: undoIntention,
-                description: `Undo:${state.mostRecentEdit.description}`,
-            },
-            parent: state,
-        };
-    }
-};
-/**
- * Runs a suite of axiomatic tests which use combinations of single edits that are valid to apply from an initial state.
- */
-function runSingleEditRebaseAxiomSuite(initialState) {
-    const singleTestChanges = (prefix) => generatePossibleSequenceOfEdits(initialState, generateChildStates, 1, prefix);
-    /**
-     * This test simulates rebasing over an do-inverse pair.
-     */
-    describe("A ↷ [B, B⁻¹] === A", () => {
-        for (const [{ description: name1, changeset: change1 }] of singleTestChanges("A")) {
-            for (const [{ description: name2, changeset: change2 }] of singleTestChanges("B")) {
-                const title = `(${name1} ↷ ${name2}) ↷ ${name2}⁻¹ => ${name1}`;
-                it(title, () => {
-                    const inv = tagRollbackInverse(invert(change2, true), tag1, change2.revision);
-                    const r1 = rebaseTagged(change1, change2);
-                    const r2 = rebaseTagged(r1, inv);
-                    assert.deepEqual(r2.change, change1.change);
-                });
-            }
-        }
-    });
-    /**
-     * This test simulates rebasing over an do-undo pair.
-     * It is different from the above in two ways:
-     * - The undo(B) changeset bears a different RevisionTag than B
-     * - The inverse produced by undo(B) is not a rollback
-     */
-    describe("A ↷ [B, undo(B)] => A", () => {
-        for (const [{ description: name1, changeset: change1 }] of singleTestChanges("A")) {
-            for (const [{ description: name2, changeset: change2 }] of singleTestChanges("B")) {
-                const title = `${name1} ↷ [${name2}, undo(${name2})] => ${name1}`;
-                it(title, () => {
-                    const inv = tagChange(invert(change2, false), tag1);
-                    const r1 = rebaseTagged(change1, change2);
-                    const r2 = rebaseTagged(r1, inv);
-                    assert.deepEqual(r2.change, change1.change);
-                });
-            }
-        }
-    });
-    /**
-     * This test simulates sandwich rebasing:
-     * a change is first rebased over the inverse of a change it took for granted
-     * then rebased over the updated version of that change (the same as the original in our case).
-     *
-     * The first rebase (A ↷ B) is purely for the purpose of manufacturing a change to which we can
-     * apply the inverse of some change.
-     */
-    describe("(A ↷ B) ↷ [B⁻¹, B] === A ↷ B", () => {
-        for (const [{ description: name1, changeset: change1 }] of singleTestChanges("A")) {
-            for (const [{ description: name2, changeset: change2 }] of singleTestChanges("B")) {
-                const title = `${name1} ↷ [${name2}, ${name2}⁻¹, ${name2}] => ${name1} ↷ ${name2}`;
-                it(title, () => {
-                    const inverse2 = tagRollbackInverse(invert(change2, true), tag1, change2.revision);
-                    const r1 = rebaseTagged(change1, change2);
-                    const r2 = rebaseTagged(r1, inverse2);
-                    const r3 = rebaseTagged(r2, change2);
-                    assert.deepEqual(r3.change, r1.change);
-                });
-            }
-        }
-    });
-    describe("A ○ A⁻¹ === ε", () => {
-        for (const [{ description: name, changeset: change }] of singleTestChanges("A")) {
-            it(`${name} ○ ${name}⁻¹ === ε`, () => {
-                const inv = invert(change, true);
-                const actual = compose(change, tagRollbackInverse(inv, tag1, change.revision));
-                const delta = toDelta(actual);
-                assert.equal(isDeltaVisible(delta), false);
-            });
-        }
-    });
-    describe("A⁻¹ ○ A === ε", () => {
-        for (const [{ description: name, changeset: change }] of singleTestChanges("A")) {
-            it(`${name}⁻¹ ○ ${name} === ε`, () => {
-                const inv = tagRollbackInverse(invert(change, true), tag1, change.revision);
-                const actual = compose(inv, change);
-                const delta = toDelta(actual);
-                assert.equal(isDeltaVisible(delta), false);
-            });
-        }
-    });
-}
-export function testRebaserAxioms() {
-    describe("Rebaser Axioms", () => {
-        describe("Using valid edits from an undefined field", () => {
-            runSingleEditRebaseAxiomSuite({ content: undefined });
-        });
-        describe("Using valid edits from a field with content", () => {
-            runSingleEditRebaseAxiomSuite({ content: "A" });
-        });
-        describeStress("Exhaustive", ({ isStress }) => {
-            runExhaustiveComposeRebaseSuite([{ content: undefined }, { content: "A" }], generateChildStates, {
-                rebase,
-                rebaseComposed,
-                compose,
-                invert,
-                assertEqual: assertTaggedEqual,
-                createEmpty: Change.empty,
-            }, {
-                numberOfEditsToRebase: 3,
-                numberOfEditsToRebaseOver: isStress ? 5 : 3,
-                numberOfEditsToVerifyAssociativity: isStress ? 6 : 3,
-            });
-        });
-    });
-}
-//# sourceMappingURL=optionalChangeRebaser.test.js.map

package/lib/test/feature-libraries/optional-field/optionalChangeRebaser.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"optionalChangeRebaser.test.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/optional-field/optionalChangeRebaser.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AAEtE,OAAO,EAGN,cAAc,EAGd,SAAS,EAET,kBAAkB,GAElB,MAAM,wBAAwB,CAAC;AAChC,0EAA0E;AAC1E,wGAAwG;AACxG,wEAAwE;AACxE,uDAAuD;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EACN,UAAU,EACV,0BAA0B,EAC1B,kCAAkC,EAClC,cAAc,GACd,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,KAAK,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AACrE,OAAO,EACN,qBAAqB,EACrB,mBAAmB,EACnB,sBAAsB;AAEtB,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAEN,kBAAkB,EAClB,+BAA+B,EAE/B,mBAAmB,GACnB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,+BAA+B,EAAE,MAAM,gCAAgC,CAAC;AACjF,OAAO,EAEN,8BAA8B;AAC9B,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAE,MAAM,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAIxF,SAAS,qBAAqB,CAAC,MAAM,GAAG,KAAK;IAC5C,yFAAyF;IACzF,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,OAAO,GAAG,EAAE,CAAC,GAAG,MAAM,GAAG,eAAe,EAAE,EAA4B,CAAC;AACxE,CAAC;AAED,MAAM,IAAI,GAA6B,KAAK,CAAC,MAAM,CAAC,CAAC;AACrD,MAAM,eAAe,GAAG,qBAAqB,EAAE,CAAC;AAChD,MAAM,IAAI,GAAG,eAAe,EAAE,CAAC;AAE/B,MAAM,cAAc,GAAG;IACtB,GAAG,CACF,KAAa,EACb,QAAiB,EACjB,GAGC;QAED,OAAO,mBAAmB,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,QAAiB,EAAE,EAAoB;QAC5C,OAAO,mBAAmB,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,gBAAgB,CAAC,WAAuB;QACvC,OAAO,mBAAmB,CAAC,gBAAgB,CAAC,CAAC,EAAE,WAA4B,CAAC,CAAC;IAC9E,CAAC;CACD,CAAC;AAEF,MAAM,qBAAqB,GAAsB;IAChD,GAAG,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,oCAAoC,CAAC;IAC5D,GAAG,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,qCAAqC,CAAC;CAC7D,CAAC;AAEF,SAAS,OAAO,CAAC,MAAyB,EAAE,QAAsB;IACjE,OAAO,sBAAsB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAC1E,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,WAAyB,EAAE,QAAQ,CAAC,CAAC,CAClE,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,GAAG,OAA4B;IAChD,IAAI,GAAiC,CAAC;IACtC,MAAM,MAAM,GAAG,CAAC,SAAuC,EAAE,EAAE;QAC1D,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG,GAAG,CAAC,EAAE;YACtE,GAAG,GAAG,SAAS,CAAC;SAChB;IACF,CAAC,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE;YACtC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;SACpB;QAED,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE;YACvC,IAAI,EAAE,KAAK,MAAM,EAAE;gBAClB,wGAAwG;gBACxG,wCAAwC;gBACxC,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;aACnB;SACD;QAED,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;YACtC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,SAAS,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,MAAM,EAAE;gBAChF,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;aACxC;SACD;KACD;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,MAAM,CAAC,MAAuC,EAAE,UAAmB;IAC3E,MAAM,QAAQ,GAAG,qBAAqB,CAAC,MAAM,CAC5C,MAAM,EACN,UAAU,CAAC,MAAa,EACxB,UAAU,EACV,oBAAoB,EAAE,EACtB,qBAAqB,EACrB,kCAAkC,CAAC,CAAC,MAAM,CAAC,CAAC,CAC5C,CAAC;IACF,kBAAkB,CAAC,MAAM,EAAE,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;IACrD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,MAAM,CACd,MAAyB,EACzB,IAAqC,EACrC,WAAoC;IAEpC,UAAU,CAAC,MAAM,CAAC,CAAC;IACnB,UAAU,CAAC,IAAI,CAAC,CAAC;IAEjB,MAAM,QAAQ,GACb,WAAW;QACX,8BAA8B,CAAC,0BAA0B,CAAC,CAAC,IAAI,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YAC1F,IAAI,CAAC,QAAQ;SACb,CAAC,CAAC;IACJ,MAAM,WAAW,GAAG,qBAAqB,CAAC;IAC1C,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,MAAM,OAAO,GAAG,qBAAqB,CAAC,MAAM,CAC3C,MAAM,EACN,IAAI,EACJ,UAAU,CAAC,MAAa,EACxB,WAAW,EACX,WAAW,EACX,QAAQ,EACR,SAAS,CACT,CAAC;IACF,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;IAClD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CACpB,MAAuC,EACvC,GAAG,WAA8C;IAEjD,IAAI,UAAU,GAAG,MAAM,CAAC;IACxB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE;QAC/B,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC7E,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;KACrC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,SAAS,cAAc,CACtB,QAAgC,EAChC,MAAyB,EACzB,GAAG,WAA8C;IAEjD,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAChD,UAAU,CAAC,MAAM,CAAC,CAAC;IAEnB,MAAM,QAAQ,GAAG,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACpD,MAAM,WAAW,GAAG,qBAAqB,CAAC;IAC1C,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAG,qBAAqB,CAAC,MAAM,CAC3C,MAAM,EACN,cAAc,CAAC,QAAQ,CAAC,EACxB,UAAU,CAAC,MAAa,EACxB,WAAW,EACX,WAAW,EACX,QAAQ,EACR,SAAS,CACT,CAAC;IACF,MAAM,QAAQ,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,kBAAkB,CAAC,QAAQ,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;KACtD;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,WAAW,CACnB,OAA0C,EAC1C,QAAiC;IAEjC,MAAM,WAAW,GAAG,qBAAqB,CAAC;IAC1C,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpF,IAAI,QAAQ,GAAsB,MAAM,CAAC,KAAK,EAAE,CAAC;IACjD,MAAM,iBAAiB,GAAG,QAAQ,IAAI,kCAAkC,CAAC,OAAO,CAAC,CAAC;IAElF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,kBAAkB,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;QACrD,QAAQ,GAAG,qBAAqB,CAAC,OAAO,CACvC,cAAc,CAAC,QAAQ,CAAC,EACxB,MAAM,EACN,UAAU,CAAC,OAAc,EACzB,WAAW,EACX,WAAW,EACX,iBAAiB,CACjB,CAAC;KACF;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,OAAO,CACf,OAAwC,EACxC,OAAwC,EACxC,QAAiC;IAEjC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,qBAAqB,CAAC;IAC1C,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IACnF,OAAO,qBAAqB,CAAC,OAAO,CACnC,OAAO,EACP,OAAO,EACP,UAAU,CAAC,OAAc,EACzB,WAAW,EACX,WAAW,EACX,QAAQ,IAAI,kCAAkC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAClE,CAAC;AACH,CAAC;AAID,SAAS,8BAA8B,CAAC,UAAkC;IACzE,2FAA2F;IAC3F,sFAAsF;IACtF,mGAAmG;IACnG,2DAA2D;IAC3D,MAAM,MAAM,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAC/C,MAAM,YAAY,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;IAC5C,MAAM,CACL,YAAY,KAAK,SAAS,EAC1B,yFAAyF,CACzF,CAAC;IACF,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,cAAkC,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC3B,IACC,KAAK,CAAC,cAAc,KAAK,SAAS;YAClC,cAAc,KAAK,YAAY;YAC/B,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAC5D;YACD,IAAI,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;gBACrE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;aAChD;SACD;QAED,cAAc,GAAG,KAAK,CAAC,OAAO,CAAC;KAC/B;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,mBAAmB,GAA+D,QAAQ,CAAC,EAChG,KAA6B,EAC7B,gBAAoD,EACpD,aAA2B;IAE3B,MAAM,MAAM,GAAG,aAAuC,CAAC;IACvD,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACxC,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE;QAChC,MAAM,oBAAoB,GAAG,aAAa,EAAE,CAAC;QAC7C,MAAM;YACL,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,cAAc,EAAE;gBACf,SAAS,EAAE,SAAS,CACnB,cAAc,CAAC,gBAAgB,CAC9B,UAAU,CAAC,IAAI,CACd,8BAA8B,CAAC,KAAK,CAAC,EACrC,oBAAoB,CACpB,CACD,EACD,gBAAgB,CAAC,oBAAoB,CAAC,CACtC;gBACD,SAAS,EAAE,oBAAoB;gBAC/B,WAAW,EAAE,cAAc,oBAAoB,EAAE;aACjD;YACD,MAAM,EAAE,KAAK;SACb,CAAC;QAEF,MAAM,qBAAqB,GAAG,aAAa,EAAE,CAAC;QAC9C,MAAM;YACL,OAAO,EAAE,SAAS;YAClB,cAAc,EAAE;gBACf,SAAS,EAAE,SAAS,CACnB,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EACrC,gBAAgB,CAAC,qBAAqB,CAAC,CACvC;gBACD,SAAS,EAAE,qBAAqB;gBAChC,WAAW,EAAE,QAAQ;aACrB;YACD,MAAM,EAAE,KAAK;SACb,CAAC;KACF;SAAM;QACN,uGAAuG;QACvG,wDAAwD;QACxD,MAAM,qBAAqB,GAAG,aAAa,EAAE,CAAC;QAC9C,MAAM;YACL,OAAO,EAAE,SAAS;YAClB,cAAc,EAAE;gBACf,SAAS,EAAE,SAAS,CACnB,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EACpC,gBAAgB,CAAC,qBAAqB,CAAC,CACvC;gBACD,SAAS,EAAE,qBAAqB;gBAChC,WAAW,EAAE,QAAQ;aACrB;YACD,MAAM,EAAE,KAAK;SACb,CAAC;KACF;IAED,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;QAC/B,MAAM,YAAY,GAAG,aAAa,EAAE,CAAC;QACrC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QAC5C,+GAA+G;QAC/G,mDAAmD;QACnD,6DAA6D;QAC7D,MAAM,WAAW,GAAG,GAAG,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM;YACL,OAAO,EAAE,WAAW;YACpB,cAAc,EAAE;gBACf,SAAS,EAAE,SAAS,CACnB,cAAc,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE;oBAC5D,IAAI;oBACJ,MAAM;iBACN,CAAC,EACF,gBAAgB,CAAC,YAAY,CAAC,CAC9B;gBACD,SAAS,EAAE,YAAY;gBACvB,WAAW,EAAE,MAAM,WAAW,EAAE;aAChC;YACD,MAAM,EAAE,KAAK;SACb,CAAC;KACF;IAED,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,EAAE;QACvC,MAAM,aAAa,GAAG,aAAa,EAAE,CAAC;QACtC,kGAAkG;QAClG,oGAAoG;QACpG,kEAAkE;QAClE,MAAM,+BAA+B,GAAG,CAAC,MAAkB,EAAc,EAAE;YAC1E,IAAI,cAAc,IAAI,MAAM,EAAE;gBAC7B,OAAO;oBACN,YAAY,EAAE,MAAM,CAAC,aAAa;oBAClC,aAAa,EAAE,CAAC,GAAG,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC;oBACvD,UAAU,EAAE,CAAC,aAAa,CAAC;iBAC3B,CAAC;aACF;YACD,OAAO,UAAU,CAAC,WAAW,CAAC;QAC/B,CAAC,CAAC;QAEF,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,MAAM,CACpD,KAAK,CAAC,cAAc,CAAC,SAAS,EAC9B,+BAAsC,EACtC,KAAK,EACL,oBAAoB,EAAE,EACtB,qBAAqB,EACrB,kCAAkC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CACpE,CAAC;QACF,MAAM;YACL,OAAO,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO;YAC9B,cAAc,EAAE;gBACf,SAAS,EAAE,SAAS,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,aAAa,CAAC,CAAC;gBACvE,SAAS,EAAE,aAAa;gBACxB,WAAW,EAAE,QAAQ,KAAK,CAAC,cAAc,CAAC,WAAW,EAAE;aACvD;YACD,MAAM,EAAE,KAAK;SACb,CAAC;KACF;AACF,CAAC,CAAC;AAEF;;GAEG;AACH,SAAS,6BAA6B,CAAC,YAAoC;IAC1E,MAAM,iBAAiB,GAAG,CAAC,MAAc,EAAE,EAAE,CAC5C,+BAA+B,CAAC,YAAY,EAAE,mBAAmB,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IAE/E;;OAEG;IACH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;YAClF,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;gBAClF,MAAM,KAAK,GAAG,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,SAAS,KAAK,EAAE,CAAC;gBAC/D,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;oBACd,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAC9E,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAC1C,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;oBACjC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC7C,CAAC,CAAC,CAAC;aACH;SACD;IACF,CAAC,CAAC,CAAC;IAEH;;;;;OAKG;IACH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACtC,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;YAClF,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;gBAClF,MAAM,KAAK,GAAG,GAAG,KAAK,OAAO,KAAK,UAAU,KAAK,SAAS,KAAK,EAAE,CAAC;gBAClE,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;oBACd,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;oBACpD,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAC1C,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;oBACjC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC7C,CAAC,CAAC,CAAC;aACH;SACD;IACF,CAAC,CAAC,CAAC;IAEH;;;;;;;OAOG;IACH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC7C,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;YAClF,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;gBAClF,MAAM,KAAK,GAAG,GAAG,KAAK,OAAO,KAAK,KAAK,KAAK,OAAO,KAAK,QAAQ,KAAK,MAAM,KAAK,EAAE,CAAC;gBACnF,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;oBACd,MAAM,QAAQ,GAAG,kBAAkB,CAClC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EACrB,IAAI,EACJ,OAAO,CAAC,QAAQ,CAChB,CAAC;oBACF,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAC1C,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;oBACtC,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;oBACrC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC;aACH;SACD;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC9B,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;YAChF,EAAE,CAAC,GAAG,IAAI,MAAM,IAAI,UAAU,EAAE,GAAG,EAAE;gBACpC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,kBAAkB,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC/E,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;YAC5C,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC9B,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE;YAChF,EAAE,CAAC,GAAG,IAAI,QAAQ,IAAI,QAAQ,EAAE,GAAG,EAAE;gBACpC,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC5E,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;YAC5C,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB;IAChC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC/B,QAAQ,CAAC,2CAA2C,EAAE,GAAG,EAAE;YAC1D,6BAA6B,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,6CAA6C,EAAE,GAAG,EAAE;YAC5D,6BAA6B,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,cAAc,CAAC,YAAY,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE;YAC7C,+BAA+B,CAC9B,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAC1C,mBAAmB,EACnB;gBACC,MAAM;gBACN,cAAc;gBACd,OAAO;gBACP,MAAM;gBACN,WAAW,EAAE,iBAAiB;gBAC9B,WAAW,EAAE,MAAM,CAAC,KAAK;aACzB,EACD;gBACC,qBAAqB,EAAE,CAAC;gBACxB,yBAAyB,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,kCAAkC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACpD,CACD,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,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 { describeStress } from \"@fluid-private/stochastic-test-utils\";\nimport { CrossFieldManager, NodeChangeset } from \"../../../feature-libraries/index.js\";\nimport {\n\tChangesetLocalId,\n\tDeltaFieldChanges,\n\tmakeAnonChange,\n\tRevisionMetadataSource,\n\tRevisionTag,\n\ttagChange,\n\tTaggedChange,\n\ttagRollbackInverse,\n\tTreeNodeSchemaIdentifier,\n} from \"../../../core/index.js\";\n// TODO: Throughout this file, we use TestChange as the child change type.\n// This is the same approach used in sequenceChangeRebaser.spec.ts, but it requires casting in this file\n// since OptionalChangeset is not generic over the child changeset type.\n// Search this file for \"as any\" and \"as NodeChangeset\"\nimport { TestChange } from \"../../testChange.js\";\nimport {\n\tdeepFreeze,\n\tdefaultRevInfosFromChanges,\n\tdefaultRevisionMetadataFromChanges,\n\tisDeltaVisible,\n} from \"../../utils.js\";\nimport { brand, idAllocatorFromMaxId } from \"../../../util/index.js\";\nimport {\n\toptionalChangeRebaser,\n\toptionalFieldEditor,\n\toptionalFieldIntoDelta,\n\tOptionalChangeset,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/optional-field/index.js\";\nimport {\n\tFieldStateTree,\n\tgetSequentialEdits,\n\tgeneratePossibleSequenceOfEdits,\n\tChildStateGenerator,\n\tgetSequentialStates,\n} from \"../../exhaustiveRebaserUtils.js\";\nimport { runExhaustiveComposeRebaseSuite } from \"../../rebaserAxiomaticTests.js\";\nimport {\n\tRebaseRevisionMetadata,\n\trebaseRevisionMetadataFromInfo,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/modular-schema/index.js\";\nimport { Change, assertTaggedEqual, verifyContextChain } from \"./optionalFieldUtils.js\";\n\ntype RevisionTagMinter = () => RevisionTag;\n\nfunction makeRevisionTagMinter(prefix = \"rev\"): RevisionTagMinter {\n\t// Rather than use UUIDs, allocate these sequentially for an easier time debugging tests.\n\tlet currentRevision = 0;\n\treturn () => `${prefix}${currentRevision++}` as unknown as RevisionTag;\n}\n\nconst type: TreeNodeSchemaIdentifier = brand(\"Node\");\nconst mintRevisionTag = makeRevisionTagMinter();\nconst tag1 = mintRevisionTag();\n\nconst OptionalChange = {\n\tset(\n\t\tvalue: string,\n\t\twasEmpty: boolean,\n\t\tids: {\n\t\t\tfill: ChangesetLocalId;\n\t\t\tdetach: ChangesetLocalId;\n\t\t},\n\t) {\n\t\treturn optionalFieldEditor.set(wasEmpty, ids);\n\t},\n\n\tclear(wasEmpty: boolean, id: ChangesetLocalId) {\n\t\treturn optionalFieldEditor.clear(wasEmpty, id);\n\t},\n\n\tbuildChildChange(childChange: TestChange) {\n\t\treturn optionalFieldEditor.buildChildChange(0, childChange as NodeChangeset);\n\t},\n};\n\nconst failCrossFieldManager: CrossFieldManager = {\n\tget: () => assert.fail(\"Should not query CrossFieldManager\"),\n\tset: () => assert.fail(\"Should not modify CrossFieldManager\"),\n};\n\nfunction toDelta(change: OptionalChangeset, revision?: RevisionTag): DeltaFieldChanges {\n\treturn optionalFieldIntoDelta(tagChange(change, revision), (childChange) =>\n\t\tTestChange.toDelta(tagChange(childChange as TestChange, revision)),\n\t);\n}\n\nfunction getMaxId(...changes: OptionalChangeset[]): ChangesetLocalId | undefined {\n\tlet max: ChangesetLocalId | undefined;\n\tconst ingest = (candidate: ChangesetLocalId | undefined) => {\n\t\tif (max === undefined || (candidate !== undefined && candidate > max)) {\n\t\t\tmax = candidate;\n\t\t}\n\t};\n\n\tfor (const change of changes) {\n\t\tfor (const [src, dst] of change.moves) {\n\t\t\tingest(src.localId);\n\t\t\tingest(dst.localId);\n\t\t}\n\n\t\tfor (const [id] of change.childChanges) {\n\t\t\tif (id !== \"self\") {\n\t\t\t\t// Child changes do not need to be ingested for this test file, as TestChange (which is used as a child)\n\t\t\t\t// doesn't have any `ChangesetLocalId`s.\n\t\t\t\tingest(id.localId);\n\t\t\t}\n\t\t}\n\n\t\tif (change.valueReplace !== undefined) {\n\t\t\tingest(change.valueReplace.dst.localId);\n\t\t\tif (change.valueReplace.src !== undefined && change.valueReplace.src !== \"self\") {\n\t\t\t\tingest(change.valueReplace.src.localId);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn max;\n}\n\nfunction invert(change: TaggedChange<OptionalChangeset>, isRollback: boolean): OptionalChangeset {\n\tconst inverted = optionalChangeRebaser.invert(\n\t\tchange,\n\t\tTestChange.invert as any,\n\t\tisRollback,\n\t\tidAllocatorFromMaxId(),\n\t\tfailCrossFieldManager,\n\t\tdefaultRevisionMetadataFromChanges([change]),\n\t);\n\tverifyContextChain(change, makeAnonChange(inverted));\n\treturn inverted;\n}\n\nfunction rebase(\n\tchange: OptionalChangeset,\n\tbase: TaggedChange<OptionalChangeset>,\n\tmetadataArg?: RebaseRevisionMetadata,\n): OptionalChangeset {\n\tdeepFreeze(change);\n\tdeepFreeze(base);\n\n\tconst metadata =\n\t\tmetadataArg ??\n\t\trebaseRevisionMetadataFromInfo(defaultRevInfosFromChanges([base, makeAnonChange(change)]), [\n\t\t\tbase.revision,\n\t\t]);\n\tconst moveEffects = failCrossFieldManager;\n\tconst idAllocator = idAllocatorFromMaxId(getMaxId(change, base.change));\n\tconst rebased = optionalChangeRebaser.rebase(\n\t\tchange,\n\t\tbase,\n\t\tTestChange.rebase as any,\n\t\tidAllocator,\n\t\tmoveEffects,\n\t\tmetadata,\n\t\tundefined,\n\t);\n\tverifyContextChain(base, makeAnonChange(rebased));\n\treturn rebased;\n}\n\nfunction rebaseTagged(\n\tchange: TaggedChange<OptionalChangeset>,\n\t...baseChanges: TaggedChange<OptionalChangeset>[]\n): TaggedChange<OptionalChangeset> {\n\tlet currChange = change;\n\tfor (const base of baseChanges) {\n\t\tcurrChange = tagChange(rebase(currChange.change, base), currChange.revision);\n\t\tverifyContextChain(base, currChange);\n\t}\n\n\treturn currChange;\n}\n\nfunction rebaseComposed(\n\tmetadata: RebaseRevisionMetadata,\n\tchange: OptionalChangeset,\n\t...baseChanges: TaggedChange<OptionalChangeset>[]\n): OptionalChangeset {\n\tbaseChanges.forEach((base) => deepFreeze(base));\n\tdeepFreeze(change);\n\n\tconst composed = composeList(baseChanges, metadata);\n\tconst moveEffects = failCrossFieldManager;\n\tconst idAllocator = idAllocatorFromMaxId(getMaxId(composed));\n\tconst rebased = optionalChangeRebaser.rebase(\n\t\tchange,\n\t\tmakeAnonChange(composed),\n\t\tTestChange.rebase as any,\n\t\tidAllocator,\n\t\tmoveEffects,\n\t\tmetadata,\n\t\tundefined,\n\t);\n\tconst lastBase = baseChanges.at(-1);\n\tif (lastBase !== undefined) {\n\t\tverifyContextChain(lastBase, makeAnonChange(rebased));\n\t}\n\treturn rebased;\n}\n\nfunction composeList(\n\tchanges: TaggedChange<OptionalChangeset>[],\n\tmetadata?: RevisionMetadataSource,\n): OptionalChangeset {\n\tconst moveEffects = failCrossFieldManager;\n\tconst idAllocator = idAllocatorFromMaxId(getMaxId(...changes.map((c) => c.change)));\n\tlet composed: OptionalChangeset = Change.empty();\n\tconst metadataOrDefault = metadata ?? defaultRevisionMetadataFromChanges(changes);\n\n\tfor (const change of changes) {\n\t\tverifyContextChain(makeAnonChange(composed), change);\n\t\tcomposed = optionalChangeRebaser.compose(\n\t\t\tmakeAnonChange(composed),\n\t\t\tchange,\n\t\t\tTestChange.compose as any,\n\t\t\tidAllocator,\n\t\t\tmoveEffects,\n\t\t\tmetadataOrDefault,\n\t\t);\n\t}\n\treturn composed;\n}\n\nfunction compose(\n\tchange1: TaggedChange<OptionalChangeset>,\n\tchange2: TaggedChange<OptionalChangeset>,\n\tmetadata?: RevisionMetadataSource,\n): OptionalChangeset {\n\tverifyContextChain(change1, change2);\n\tconst moveEffects = failCrossFieldManager;\n\tconst idAllocator = idAllocatorFromMaxId(getMaxId(change1.change, change2.change));\n\treturn optionalChangeRebaser.compose(\n\t\tchange1,\n\t\tchange2,\n\t\tTestChange.compose as any,\n\t\tidAllocator,\n\t\tmoveEffects,\n\t\tmetadata ?? defaultRevisionMetadataFromChanges([change1, change2]),\n\t);\n}\n\ntype OptionalFieldTestState = FieldStateTree<string | undefined, OptionalChangeset>;\n\nfunction computeChildChangeInputContext(inputState: OptionalFieldTestState): number[] {\n\t// This is effectively a filter of the intentions from all edits such that it only includes\n\t// intentions for edits which modify the same child as the final one in the changeset.\n\t// Note: this takes a dependency on the fact that `generateChildStates` doesn't set matching string\n\t// content for what are meant to represent different nodes.\n\tconst states = getSequentialStates(inputState);\n\tconst finalContent = states.at(-1)?.content;\n\tassert(\n\t\tfinalContent !== undefined,\n\t\t\"Child change input context should only be computed when the optional field has content.\",\n\t);\n\tconst intentions: number[] = [];\n\tlet currentContent: string | undefined;\n\tfor (const state of states) {\n\t\tif (\n\t\t\tstate.mostRecentEdit !== undefined &&\n\t\t\tcurrentContent === finalContent &&\n\t\t\tstate.mostRecentEdit.changeset.change.childChanges.length > 0\n\t\t) {\n\t\t\tif (state.mostRecentEdit.changeset.change.childChanges !== undefined) {\n\t\t\t\tintentions.push(state.mostRecentEdit.intention);\n\t\t\t}\n\t\t}\n\n\t\tcurrentContent = state.content;\n\t}\n\n\treturn intentions;\n}\n\n/**\n * See {@link ChildStateGenerator}\n */\nconst generateChildStates: ChildStateGenerator<string | undefined, OptionalChangeset> = function* (\n\tstate: OptionalFieldTestState,\n\ttagFromIntention: (intention: number) => RevisionTag,\n\tmintIntention: () => number,\n): Iterable<OptionalFieldTestState> {\n\tconst mintId = mintIntention as () => ChangesetLocalId;\n\tconst edits = getSequentialEdits(state);\n\tif (state.content !== undefined) {\n\t\tconst changeChildIntention = mintIntention();\n\t\tyield {\n\t\t\tcontent: state.content,\n\t\t\tmostRecentEdit: {\n\t\t\t\tchangeset: tagChange(\n\t\t\t\t\tOptionalChange.buildChildChange(\n\t\t\t\t\t\tTestChange.mint(\n\t\t\t\t\t\t\tcomputeChildChangeInputContext(state),\n\t\t\t\t\t\t\tchangeChildIntention,\n\t\t\t\t\t\t),\n\t\t\t\t\t),\n\t\t\t\t\ttagFromIntention(changeChildIntention),\n\t\t\t\t),\n\t\t\t\tintention: changeChildIntention,\n\t\t\t\tdescription: `ChildChange${changeChildIntention}`,\n\t\t\t},\n\t\t\tparent: state,\n\t\t};\n\n\t\tconst setUndefinedIntention = mintIntention();\n\t\tyield {\n\t\t\tcontent: undefined,\n\t\t\tmostRecentEdit: {\n\t\t\t\tchangeset: tagChange(\n\t\t\t\t\tOptionalChange.clear(false, mintId()),\n\t\t\t\t\ttagFromIntention(setUndefinedIntention),\n\t\t\t\t),\n\t\t\t\tintention: setUndefinedIntention,\n\t\t\t\tdescription: \"Remove\",\n\t\t\t},\n\t\t\tparent: state,\n\t\t};\n\t} else {\n\t\t// Even if there is no content, optional field supports an explicit clear operation with LWW semantics,\n\t\t// as a concurrent set operation may populate the field.\n\t\tconst setUndefinedIntention = mintIntention();\n\t\tyield {\n\t\t\tcontent: undefined,\n\t\t\tmostRecentEdit: {\n\t\t\t\tchangeset: tagChange(\n\t\t\t\t\tOptionalChange.clear(true, mintId()),\n\t\t\t\t\ttagFromIntention(setUndefinedIntention),\n\t\t\t\t),\n\t\t\t\tintention: setUndefinedIntention,\n\t\t\t\tdescription: \"Remove\",\n\t\t\t},\n\t\t\tparent: state,\n\t\t};\n\t}\n\n\tfor (const value of [\"A\", \"B\"]) {\n\t\tconst setIntention = mintIntention();\n\t\tconst [fill, detach] = [mintId(), mintId()];\n\t\t// Using length of the input context guarantees set operations generated at different times also have different\n\t\t// values, which should tend to be easier to debug.\n\t\t// This also makes the logic to determine intentions simpler.\n\t\tconst newContents = `${value},${edits.length}`;\n\t\tyield {\n\t\t\tcontent: newContents,\n\t\t\tmostRecentEdit: {\n\t\t\t\tchangeset: tagChange(\n\t\t\t\t\tOptionalChange.set(newContents, state.content === undefined, {\n\t\t\t\t\t\tfill,\n\t\t\t\t\t\tdetach,\n\t\t\t\t\t}),\n\t\t\t\t\ttagFromIntention(setIntention),\n\t\t\t\t),\n\t\t\t\tintention: setIntention,\n\t\t\t\tdescription: `Set${newContents}`,\n\t\t\t},\n\t\t\tparent: state,\n\t\t};\n\t}\n\n\tif (state.mostRecentEdit !== undefined) {\n\t\tconst undoIntention = mintIntention();\n\t\t// We don't use the `invert` helper here, as `TestChange.invert` has logic to negate the intention\n\t\t// of the most recent edit. Instead, we want to mint a new intention. Having correct composition for\n\t\t// the 'negate' operation is already tested via sandwich rebasing.\n\t\tconst invertTestChangeViaNewIntention = (change: TestChange): TestChange => {\n\t\t\tif (\"inputContext\" in change) {\n\t\t\t\treturn {\n\t\t\t\t\tinputContext: change.outputContext,\n\t\t\t\t\toutputContext: [...change.outputContext, undoIntention],\n\t\t\t\t\tintentions: [undoIntention],\n\t\t\t\t};\n\t\t\t}\n\t\t\treturn TestChange.emptyChange;\n\t\t};\n\n\t\tconst inverseChangeset = optionalChangeRebaser.invert(\n\t\t\tstate.mostRecentEdit.changeset,\n\t\t\tinvertTestChangeViaNewIntention as any,\n\t\t\tfalse,\n\t\t\tidAllocatorFromMaxId(),\n\t\t\tfailCrossFieldManager,\n\t\t\tdefaultRevisionMetadataFromChanges([state.mostRecentEdit.changeset]),\n\t\t);\n\t\tyield {\n\t\t\tcontent: state.parent?.content,\n\t\t\tmostRecentEdit: {\n\t\t\t\tchangeset: tagChange(inverseChangeset, tagFromIntention(undoIntention)),\n\t\t\t\tintention: undoIntention,\n\t\t\t\tdescription: `Undo:${state.mostRecentEdit.description}`,\n\t\t\t},\n\t\t\tparent: state,\n\t\t};\n\t}\n};\n\n/**\n * Runs a suite of axiomatic tests which use combinations of single edits that are valid to apply from an initial state.\n */\nfunction runSingleEditRebaseAxiomSuite(initialState: OptionalFieldTestState) {\n\tconst singleTestChanges = (prefix: string) =>\n\t\tgeneratePossibleSequenceOfEdits(initialState, generateChildStates, 1, prefix);\n\n\t/**\n\t * This test simulates rebasing over an do-inverse pair.\n\t */\n\tdescribe(\"A ↷ [B, B⁻¹] === A\", () => {\n\t\tfor (const [{ description: name1, changeset: change1 }] of singleTestChanges(\"A\")) {\n\t\t\tfor (const [{ description: name2, changeset: change2 }] of singleTestChanges(\"B\")) {\n\t\t\t\tconst title = `(${name1} ↷ ${name2}) ↷ ${name2}⁻¹ => ${name1}`;\n\t\t\t\tit(title, () => {\n\t\t\t\t\tconst inv = tagRollbackInverse(invert(change2, true), tag1, change2.revision);\n\t\t\t\t\tconst r1 = rebaseTagged(change1, change2);\n\t\t\t\t\tconst r2 = rebaseTagged(r1, inv);\n\t\t\t\t\tassert.deepEqual(r2.change, change1.change);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t});\n\n\t/**\n\t * This test simulates rebasing over an do-undo pair.\n\t * It is different from the above in two ways:\n\t * - The undo(B) changeset bears a different RevisionTag than B\n\t * - The inverse produced by undo(B) is not a rollback\n\t */\n\tdescribe(\"A ↷ [B, undo(B)] => A\", () => {\n\t\tfor (const [{ description: name1, changeset: change1 }] of singleTestChanges(\"A\")) {\n\t\t\tfor (const [{ description: name2, changeset: change2 }] of singleTestChanges(\"B\")) {\n\t\t\t\tconst title = `${name1} ↷ [${name2}, undo(${name2})] => ${name1}`;\n\t\t\t\tit(title, () => {\n\t\t\t\t\tconst inv = tagChange(invert(change2, false), tag1);\n\t\t\t\t\tconst r1 = rebaseTagged(change1, change2);\n\t\t\t\t\tconst r2 = rebaseTagged(r1, inv);\n\t\t\t\t\tassert.deepEqual(r2.change, change1.change);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t});\n\n\t/**\n\t * This test simulates sandwich rebasing:\n\t * a change is first rebased over the inverse of a change it took for granted\n\t * then rebased over the updated version of that change (the same as the original in our case).\n\t *\n\t * The first rebase (A ↷ B) is purely for the purpose of manufacturing a change to which we can\n\t * apply the inverse of some change.\n\t */\n\tdescribe(\"(A ↷ B) ↷ [B⁻¹, B] === A ↷ B\", () => {\n\t\tfor (const [{ description: name1, changeset: change1 }] of singleTestChanges(\"A\")) {\n\t\t\tfor (const [{ description: name2, changeset: change2 }] of singleTestChanges(\"B\")) {\n\t\t\t\tconst title = `${name1} ↷ [${name2}, ${name2}⁻¹, ${name2}] => ${name1} ↷ ${name2}`;\n\t\t\t\tit(title, () => {\n\t\t\t\t\tconst inverse2 = tagRollbackInverse(\n\t\t\t\t\t\tinvert(change2, true),\n\t\t\t\t\t\ttag1,\n\t\t\t\t\t\tchange2.revision,\n\t\t\t\t\t);\n\t\t\t\t\tconst r1 = rebaseTagged(change1, change2);\n\t\t\t\t\tconst r2 = rebaseTagged(r1, inverse2);\n\t\t\t\t\tconst r3 = rebaseTagged(r2, change2);\n\t\t\t\t\tassert.deepEqual(r3.change, r1.change);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t});\n\n\tdescribe(\"A ○ A⁻¹ === ε\", () => {\n\t\tfor (const [{ description: name, changeset: change }] of singleTestChanges(\"A\")) {\n\t\t\tit(`${name} ○ ${name}⁻¹ === ε`, () => {\n\t\t\t\tconst inv = invert(change, true);\n\t\t\t\tconst actual = compose(change, tagRollbackInverse(inv, tag1, change.revision));\n\t\t\t\tconst delta = toDelta(actual);\n\t\t\t\tassert.equal(isDeltaVisible(delta), false);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"A⁻¹ ○ A === ε\", () => {\n\t\tfor (const [{ description: name, changeset: change }] of singleTestChanges(\"A\")) {\n\t\t\tit(`${name}⁻¹ ○ ${name} === ε`, () => {\n\t\t\t\tconst inv = tagRollbackInverse(invert(change, true), tag1, change.revision);\n\t\t\t\tconst actual = compose(inv, change);\n\t\t\t\tconst delta = toDelta(actual);\n\t\t\t\tassert.equal(isDeltaVisible(delta), false);\n\t\t\t});\n\t\t}\n\t});\n}\n\nexport function testRebaserAxioms() {\n\tdescribe(\"Rebaser Axioms\", () => {\n\t\tdescribe(\"Using valid edits from an undefined field\", () => {\n\t\t\trunSingleEditRebaseAxiomSuite({ content: undefined });\n\t\t});\n\n\t\tdescribe(\"Using valid edits from a field with content\", () => {\n\t\t\trunSingleEditRebaseAxiomSuite({ content: \"A\" });\n\t\t});\n\n\t\tdescribeStress(\"Exhaustive\", ({ isStress }) => {\n\t\t\trunExhaustiveComposeRebaseSuite(\n\t\t\t\t[{ content: undefined }, { content: \"A\" }],\n\t\t\t\tgenerateChildStates,\n\t\t\t\t{\n\t\t\t\t\trebase,\n\t\t\t\t\trebaseComposed,\n\t\t\t\t\tcompose,\n\t\t\t\t\tinvert,\n\t\t\t\t\tassertEqual: assertTaggedEqual,\n\t\t\t\t\tcreateEmpty: Change.empty,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tnumberOfEditsToRebase: 3,\n\t\t\t\t\tnumberOfEditsToRebaseOver: isStress ? 5 : 3,\n\t\t\t\t\tnumberOfEditsToVerifyAssociativity: isStress ? 6 : 3,\n\t\t\t\t},\n\t\t\t);\n\t\t});\n\t});\n}\n"]}

package/lib/test/feature-libraries/optional-field/optionalField.spec.d.ts

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

package/lib/test/feature-libraries/optional-field/optionalField.spec.d.ts.map

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