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

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

@@ -1,59 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { RevisionTagCodec } from "../../../core/index.js";
-import { makeOptionalFieldCodecFamily,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/optional-field/index.js";
-import { brand } from "../../../util/index.js";
-import { TestChange } from "../../testChange.js";
-import { takeJsonSnapshot, useSnapshotDirectory } from "../../snapshots/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { createSnapshotCompressor } from "../../snapshots/testTrees.js";
-import { Change } from "./optionalFieldUtils.js";
-function generateTestChangesets(idCompressor) {
-    const revision = idCompressor.generateCompressedId();
-    const localId = brand(42);
-    const childChange = TestChange.mint([], 1);
-    return [
-        {
-            name: "empty",
-            change: Change.empty(),
-        },
-        {
-            name: "change with moves",
-            change: Change.atOnce(Change.move({ revision, localId }, "self"), Change.clear("self", { revision, localId }), Change.move(localId, localId)),
-        },
-        {
-            name: "with child change",
-            change: Change.atOnce(Change.childAt({ revision, localId }, childChange), Change.childAt(localId, childChange), Change.child(childChange)),
-        },
-        {
-            name: "with reserved detach",
-            change: Change.reserve("self", { revision, localId }),
-        },
-    ];
-}
-export function testSnapshots() {
-    describe("Snapshots", () => {
-        useSnapshotDirectory("optional-field");
-        const snapshotCompressor = createSnapshotCompressor();
-        const changesets = generateTestChangesets(snapshotCompressor);
-        const family = makeOptionalFieldCodecFamily(TestChange.codec, new RevisionTagCodec(snapshotCompressor));
-        for (const version of family.getSupportedFormats()) {
-            describe(`version ${version}`, () => {
-                const codec = family.resolve(version);
-                for (const { name, change } of changesets) {
-                    it(name, () => {
-                        const encoded = codec.json.encode(change, {
-                            originatorId: snapshotCompressor.localSessionId,
-                        });
-                        takeJsonSnapshot(encoded);
-                    });
-                }
-            });
-        }
-    });
-}
-//# sourceMappingURL=optionalFieldSnapshots.test.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"optionalFieldSnapshots.test.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/optional-field/optionalFieldSnapshots.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAoB,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC5E,OAAO,EAEN,4BAA4B;AAC5B,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAClF,sDAAsD;AACtD,OAAO,EAAE,wBAAwB,EAAE,MAAM,8BAA8B,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAEjD,SAAS,sBAAsB,CAC9B,YAA2B;IAE3B,MAAM,QAAQ,GAAG,YAAY,CAAC,oBAAoB,EAAE,CAAC;IACrD,MAAM,OAAO,GAAqB,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3C,OAAO;QACN;YACC,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE;SACtB;QACD;YACC,IAAI,EAAE,mBAAmB;YACzB,MAAM,EAAE,MAAM,CAAC,MAAM,CACpB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAC1C,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,EAC3C,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAC7B;SACD;QACD;YACC,IAAI,EAAE,mBAAmB;YACzB,MAAM,EAAE,MAAM,CAAC,MAAM,CACpB,MAAM,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,WAAW,CAAC,EAClD,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,EACpC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CACzB;SACD;QACD;YACC,IAAI,EAAE,sBAAsB;YAC5B,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;SACrD;KACD,CAAC;AACH,CAAC;AAED,MAAM,UAAU,aAAa;IAC5B,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QAC1B,oBAAoB,CAAC,gBAAgB,CAAC,CAAC;QACvC,MAAM,kBAAkB,GAAG,wBAAwB,EAAE,CAAC;QACtD,MAAM,UAAU,GAAG,sBAAsB,CAAC,kBAAkB,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,4BAA4B,CAC1C,UAAU,CAAC,KAAK,EAChB,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,CACxC,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,mBAAmB,EAAE,EAAE;YACnD,QAAQ,CAAC,WAAW,OAAO,EAAE,EAAE,GAAG,EAAE;gBACnC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBACtC,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE;oBAC1C,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;wBACb,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;4BACzC,YAAY,EAAE,kBAAkB,CAAC,cAAc;yBAC/C,CAAC,CAAC;wBACH,gBAAgB,CAAC,OAAO,CAAC,CAAC;oBAC3B,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;SACH;IACF,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 { IIdCompressor } from \"@fluidframework/id-compressor\";\nimport { ChangesetLocalId, RevisionTagCodec } from \"../../../core/index.js\";\nimport {\n\tOptionalChangeset,\n\tmakeOptionalFieldCodecFamily,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/optional-field/index.js\";\nimport { brand } from \"../../../util/index.js\";\nimport { TestChange } from \"../../testChange.js\";\nimport { takeJsonSnapshot, useSnapshotDirectory } from \"../../snapshots/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { createSnapshotCompressor } from \"../../snapshots/testTrees.js\";\nimport { Change } from \"./optionalFieldUtils.js\";\n\nfunction generateTestChangesets(\n\tidCompressor: IIdCompressor,\n): { name: string; change: OptionalChangeset<TestChange> }[] {\n\tconst revision = idCompressor.generateCompressedId();\n\tconst localId: ChangesetLocalId = brand(42);\n\tconst childChange = TestChange.mint([], 1);\n\treturn [\n\t\t{\n\t\t\tname: \"empty\",\n\t\t\tchange: Change.empty(),\n\t\t},\n\t\t{\n\t\t\tname: \"change with moves\",\n\t\t\tchange: Change.atOnce(\n\t\t\t\tChange.move({ revision, localId }, \"self\"),\n\t\t\t\tChange.clear(\"self\", { revision, localId }),\n\t\t\t\tChange.move(localId, localId),\n\t\t\t),\n\t\t},\n\t\t{\n\t\t\tname: \"with child change\",\n\t\t\tchange: Change.atOnce(\n\t\t\t\tChange.childAt({ revision, localId }, childChange),\n\t\t\t\tChange.childAt(localId, childChange),\n\t\t\t\tChange.child(childChange),\n\t\t\t),\n\t\t},\n\t\t{\n\t\t\tname: \"with reserved detach\",\n\t\t\tchange: Change.reserve(\"self\", { revision, localId }),\n\t\t},\n\t];\n}\n\nexport function testSnapshots() {\n\tdescribe(\"Snapshots\", () => {\n\t\tuseSnapshotDirectory(\"optional-field\");\n\t\tconst snapshotCompressor = createSnapshotCompressor();\n\t\tconst changesets = generateTestChangesets(snapshotCompressor);\n\t\tconst family = makeOptionalFieldCodecFamily(\n\t\t\tTestChange.codec,\n\t\t\tnew RevisionTagCodec(snapshotCompressor),\n\t\t);\n\n\t\tfor (const version of family.getSupportedFormats()) {\n\t\t\tdescribe(`version ${version}`, () => {\n\t\t\t\tconst codec = family.resolve(version);\n\t\t\t\tfor (const { name, change } of changesets) {\n\t\t\t\t\tit(name, () => {\n\t\t\t\t\t\tconst encoded = codec.json.encode(change, {\n\t\t\t\t\t\t\toriginatorId: snapshotCompressor.localSessionId,\n\t\t\t\t\t\t});\n\t\t\t\t\t\ttakeJsonSnapshot(encoded);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n}\n"]}

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

@@ -1,62 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ChangeAtomId, ChangesetLocalId, RevisionTag, TaggedChange } from "../../../core/index.js";
-import { RegisterId, OptionalChangeset } from "../../../feature-libraries/optional-field/index.js";
-export interface ProtoChange {
-    type: "write";
-    content: RegisterId;
-}
-export declare const Change: {
-    /**
-     * @returns An empty changeset
-     */
-    empty: () => OptionalChangeset<never>;
-    /**
-     * @param src - The register to move a node from. The register must be full in the input context of the changeset.
-     * @param dst - The register to move that node to.
-     * The register must be empty in the input context of the changeset, or emptied as part of the changeset.
-     * @returns A changeset that moves a node from src to dst.
-     */
-    move: (src: RegisterId | ChangesetLocalId, dst: RegisterId | ChangesetLocalId) => OptionalChangeset<never> | ProtoChange;
-    /**
-     * @param target - The register remove a node from. The register must be full in the input context of the changeset.
-     * @param dst - The register to move the contents of the target register to.
-     * The register must be empty in the input context of the changeset, or emptied as part of the changeset.
-     * @returns A changeset that clears a register and moves the contents to another register.
-     */
-    clear: (target: RegisterId | ChangesetLocalId, dst: ChangeAtomId | ChangesetLocalId) => OptionalChangeset<never>;
-    /**
-     * @param target - The register to reserve. The register must NOT be full in the input context of the changeset.
-     * @param dst - The register that the contents of the target register should be moved to should it become populated.
-     * The register must be empty in the input context of the changeset, or emptied as part of the changeset.
-     * @returns A changeset that reserves an register.
-     */
-    reserve: (target: RegisterId | ChangesetLocalId, dst: ChangeAtomId | ChangesetLocalId) => OptionalChangeset<never>;
-    /**
-     * @param location - The register that contains the child node to be changed.
-     * That register must be full in the input context of the changeset.
-     * @param change - A change to apply to a child node.
-     * @returns A changeset that applies the given change to the child node in the given register.
-     */
-    childAt: <TChild>(location: RegisterId | ChangesetLocalId, change: TChild) => OptionalChangeset<TChild>;
-    /**
-     * @param change - A change to apply to a child node in the "self" register.
-     * @returns A changeset that applies the given change to the child node in the "self" register.
-     * The "self" register must be full in the input context of the changeset.
-     */
-    child: <TChild_1>(change: TChild_1) => OptionalChangeset<TChild_1>;
-    /**
-     * Combines multiple changesets for the same input context into a single changeset.
-     * @param changes - The change to apply as part of the changeset. Interpreted as applying to the same input context.
-     * @returns A single changeset that applies all of the given changes.
-     */
-    atOnce: <TChild_2>(...changes: (ProtoChange | OptionalChangeset<TChild_2>)[]) => OptionalChangeset<TChild_2>;
-};
-export declare function assertTaggedEqual(a: TaggedChange<OptionalChangeset> | undefined, b: TaggedChange<OptionalChangeset> | undefined): void;
-export declare function assertEqual(a: OptionalChangeset | undefined, b: OptionalChangeset | undefined): void;
-export declare function taggedRegister(id: RegisterId, revision: RevisionTag | undefined): RegisterId;
-export declare function taggedAtomId(id: ChangeAtomId, revision: RevisionTag | undefined): ChangeAtomId;
-export declare function verifyContextChain(a: TaggedChange<OptionalChangeset>, b: TaggedChange<OptionalChangeset>): void;
-//# sourceMappingURL=optionalFieldUtils.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"optionalFieldUtils.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/optional-field/optionalFieldUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACX,YAAY,EAIZ,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACN,UAAU,EACV,iBAAiB,EAIjB,MAAM,oDAAoD,CAAC;AAiB5D,MAAM,WAAW,WAAW;IAC3B,IAAI,EAAE,OAAO,CAAC;IACd,OAAO,EAAE,UAAU,CAAC;CACpB;AAED,eAAO,MAAM,MAAM;IAClB;;OAEG;iBACQ,kBAAkB,KAAK,CAAC;IACnC;;;;;OAKG;gBAEG,UAAU,GAAG,gBAAgB,OAC7B,UAAU,GAAG,gBAAgB,KAChC,kBAAkB,KAAK,CAAC,GAAG,WAAW;IAezC;;;;;OAKG;oBAEM,UAAU,GAAG,gBAAgB,OAChC,YAAY,GAAG,gBAAgB,KAClC,kBAAkB,KAAK,CAAC;IAW3B;;;;;OAKG;sBAEM,UAAU,GAAG,gBAAgB,OAChC,YAAY,GAAG,gBAAgB,KAClC,kBAAkB,KAAK,CAAC;IAQ3B;;;;;OAKG;gCAEQ,UAAU,GAAG,gBAAgB;IAMxC;;;;OAIG;;IAEH;;;;OAIG;;CAgCH,CAAC;AAGF,wBAAgB,iBAAiB,CAChC,CAAC,EAAE,YAAY,CAAC,iBAAiB,CAAC,GAAG,SAAS,EAC9C,CAAC,EAAE,YAAY,CAAC,iBAAiB,CAAC,GAAG,SAAS,GAC5C,IAAI,CAmCN;AAED,wBAAgB,WAAW,CAC1B,CAAC,EAAE,iBAAiB,GAAG,SAAS,EAChC,CAAC,EAAE,iBAAiB,GAAG,SAAS,GAC9B,IAAI,CAMN;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,GAAG,SAAS,GAAG,UAAU,CAM5F;AAED,wBAAgB,YAAY,CAAC,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,GAAG,SAAS,GAAG,YAAY,CAE9F;AA0CD,wBAAgB,kBAAkB,CACjC,CAAC,EAAE,YAAY,CAAC,iBAAiB,CAAC,EAClC,CAAC,EAAE,YAAY,CAAC,iBAAiB,CAAC,GAChC,IAAI,CAmBN"}

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

@@ -1,232 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { asChangeAtomId, makeAnonChange, makeChangeAtomId, } from "../../../core/index.js";
-import { RegisterMap,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/optional-field/index.js";
-import { brand } from "../../../util/index.js";
-const dummyDetachId = { localId: brand(0) };
-function asRegister(input) {
-    if (typeof input === "string" || typeof input === "object") {
-        return input;
-    }
-    return { localId: input };
-}
-export const Change = {
-    /**
-     * @returns An empty changeset
-     */
-    empty: () => ({ moves: [], childChanges: [] }),
-    /**
-     * @param src - The register to move a node from. The register must be full in the input context of the changeset.
-     * @param dst - The register to move that node to.
-     * The register must be empty in the input context of the changeset, or emptied as part of the changeset.
-     * @returns A changeset that moves a node from src to dst.
-     */
-    move: (src, dst) => {
-        if (dst === "self") {
-            return {
-                type: "write",
-                content: asRegister(src),
-            };
-        }
-        if (src === "self") {
-            return Change.clear("self", dst);
-        }
-        return {
-            moves: [[asChangeAtomId(src), asChangeAtomId(dst)]],
-            childChanges: [],
-        };
-    },
-    /**
-     * @param target - The register remove a node from. The register must be full in the input context of the changeset.
-     * @param dst - The register to move the contents of the target register to.
-     * The register must be empty in the input context of the changeset, or emptied as part of the changeset.
-     * @returns A changeset that clears a register and moves the contents to another register.
-     */
-    clear: (target, dst) => target === "self"
-        ? {
-            moves: [],
-            childChanges: [],
-            valueReplace: { isEmpty: false, dst: asChangeAtomId(dst) },
-        }
-        : {
-            moves: [[asChangeAtomId(target), asChangeAtomId(dst)]],
-            childChanges: [],
-        },
-    /**
-     * @param target - The register to reserve. The register must NOT be full in the input context of the changeset.
-     * @param dst - The register that the contents of the target register should be moved to should it become populated.
-     * The register must be empty in the input context of the changeset, or emptied as part of the changeset.
-     * @returns A changeset that reserves an register.
-     */
-    reserve: (target, dst) => {
-        assert(target === "self", "Reserve cell only supports self as source");
-        return {
-            moves: [],
-            childChanges: [],
-            valueReplace: { isEmpty: true, dst: asChangeAtomId(dst) },
-        };
-    },
-    /**
-     * @param location - The register that contains the child node to be changed.
-     * That register must be full in the input context of the changeset.
-     * @param change - A change to apply to a child node.
-     * @returns A changeset that applies the given change to the child node in the given register.
-     */
-    childAt: (location, change) => ({
-        moves: [],
-        childChanges: [[asRegister(location), change]],
-    }),
-    /**
-     * @param change - A change to apply to a child node in the "self" register.
-     * @returns A changeset that applies the given change to the child node in the "self" register.
-     * The "self" register must be full in the input context of the changeset.
-     */
-    child: (change) => Change.childAt("self", change),
-    /**
-     * Combines multiple changesets for the same input context into a single changeset.
-     * @param changes - The change to apply as part of the changeset. Interpreted as applying to the same input context.
-     * @returns A single changeset that applies all of the given changes.
-     */
-    atOnce: (...changes) => {
-        const moves = [];
-        const childChanges = [];
-        let replace;
-        const changeset = { moves, childChanges };
-        for (const changeLike of changes) {
-            if ("type" in changeLike === false) {
-                const change = changeLike;
-                // Note: this will stack overflow if there are too many moves.
-                moves.push(...change.moves);
-                // Note: this will stack overflow if there are too many child changes.
-                childChanges.push(...change.childChanges);
-                if (change.valueReplace !== undefined) {
-                    assert(replace === undefined, "Multiple reserved detach ids");
-                    replace = change.valueReplace;
-                }
-            }
-        }
-        for (const change of changes) {
-            if ("type" in change) {
-                assert(replace !== undefined, "Invalid write without detach");
-                replace.src = change.content;
-            }
-        }
-        if (replace !== undefined) {
-            changeset.valueReplace = replace;
-        }
-        return changeset;
-    },
-};
-// Optional changesets may be equivalent but not evaluate to be deep-equal, as some ordering is irrelevant.
-export function assertTaggedEqual(a, b) {
-    if (a === undefined || b === undefined) {
-        assert.equal(a, b);
-        return;
-    }
-    const normalizeRegisterId = (registerId) => {
-        if (typeof registerId === "string") {
-            return `s${registerId}`;
-        }
-        return `r${registerId.revision}id${registerId.localId}`;
-    };
-    const compareRegisterIds = (c, d) => normalizeRegisterId(c).localeCompare(normalizeRegisterId(d));
-    // The composed rebase implementation deep-freezes.
-    const aCopy = { ...a, change: { ...a.change, moves: [...a.change.moves] } };
-    const bCopy = { ...b, change: { ...b.change, moves: [...b.change.moves] } };
-    aCopy.change.moves.sort(([c], [d]) => compareRegisterIds(c, d));
-    bCopy.change.moves.sort(([c], [d]) => compareRegisterIds(c, d));
-    if (aCopy.change.valueReplace !== undefined) {
-        assert(bCopy.change.valueReplace !== undefined);
-        if (aCopy.change.valueReplace.isEmpty) {
-            assert(bCopy.change.valueReplace.isEmpty);
-            // Detach IDs are only relevant if the field was not empty, so we tolerate compose
-            // assigning them arbitrarily in this case.
-            aCopy.change.valueReplace = { ...aCopy.change.valueReplace, dst: dummyDetachId };
-            bCopy.change.valueReplace = { ...bCopy.change.valueReplace, dst: dummyDetachId };
-        }
-    }
-    delete aCopy.change.valueReplace;
-    delete bCopy.change.valueReplace;
-    assert.deepEqual(aCopy, bCopy);
-}
-export function assertEqual(a, b) {
-    if (a === undefined || b === undefined) {
-        assert.equal(a, b);
-        return;
-    }
-    assertTaggedEqual(makeAnonChange(a), makeAnonChange(b));
-}
-export function taggedRegister(id, revision) {
-    if (id === "self") {
-        return id;
-    }
-    return taggedAtomId(id, revision);
-}
-export function taggedAtomId(id, revision) {
-    return makeChangeAtomId(id.localId, id.revision ?? revision);
-}
-function getTouchedRegisters({ change, revision }) {
-    const src = new RegisterMap();
-    const dst = new RegisterMap();
-    for (const leg1 of change.moves) {
-        if (!isNoopMove(leg1)) {
-            src.set(taggedRegister(leg1[0], revision), true);
-            dst.set(taggedRegister(leg1[1], revision), true);
-        }
-    }
-    if (change.valueReplace !== undefined && change.valueReplace.src !== "self") {
-        if (change.valueReplace.isEmpty === false) {
-            src.set(taggedRegister("self", revision), true);
-            dst.set(taggedRegister(change.valueReplace.dst, revision), true);
-        }
-        if (change.valueReplace.src !== undefined) {
-            src.set(taggedRegister(change.valueReplace.src, revision), true);
-            dst.set(taggedRegister("self", revision), true);
-        }
-    }
-    return { src, dst };
-}
-function getOutputRegisterStatues(a) {
-    const { src, dst } = getTouchedRegisters(a);
-    const statuses = new RegisterMap();
-    for (const detach of src.keys()) {
-        statuses.set(detach, "empty");
-    }
-    for (const attach of dst.keys()) {
-        statuses.set(attach, "full");
-    }
-    return statuses;
-}
-export function verifyContextChain(a, b) {
-    const statuses = getOutputRegisterStatues(a);
-    const { src, dst } = getTouchedRegisters(b);
-    for (const detach of src.keys()) {
-        const status = statuses.get(detach);
-        if (status !== undefined) {
-            assert.equal(status, "full", "Invalid detach on empty register");
-        }
-    }
-    for (const attach of dst.keys()) {
-        if (!src.has(attach)) {
-            const status = statuses.get(attach);
-            if (status !== undefined) {
-                assert.equal(status, "empty", "Invalid attach on full register");
-            }
-        }
-    }
-}
-function isNoopMove(move) {
-    return registerEqual(move[0], move[1]);
-}
-function registerEqual(a, b) {
-    if (typeof a === "string" || typeof b === "string") {
-        return a === b;
-    }
-    return a.revision === b.revision && a.localId === b.localId;
-}
-//# sourceMappingURL=optionalFieldUtils.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"optionalFieldUtils.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/optional-field/optionalFieldUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAKN,cAAc,EACd,cAAc,EACd,gBAAgB,GAChB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAGN,WAAW;AAEX,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAW,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAOxD,MAAM,aAAa,GAAiB,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;AAE1D,SAAS,UAAU,CAAC,KAAoC;IACvD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC3D,OAAO,KAAK,CAAC;KACb;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAOD,MAAM,CAAC,MAAM,MAAM,GAAG;IACrB;;OAEG;IACH,KAAK,EAAE,GAA6B,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;IACxE;;;;;OAKG;IACH,IAAI,EAAE,CACL,GAAkC,EAClC,GAAkC,EACO,EAAE;QAC3C,IAAI,GAAG,KAAK,MAAM,EAAE;YACnB,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC;aACxB,CAAC;SACF;QACD,IAAI,GAAG,KAAK,MAAM,EAAE;YACnB,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;SACjC;QACD,OAAO;YACN,KAAK,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;YACnD,YAAY,EAAE,EAAE;SAChB,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACH,KAAK,EAAE,CACN,MAAqC,EACrC,GAAoC,EACT,EAAE,CAC7B,MAAM,KAAK,MAAM;QAChB,CAAC,CAAC;YACA,KAAK,EAAE,EAAE;YACT,YAAY,EAAE,EAAE;YAChB,YAAY,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE;SACzD;QACH,CAAC,CAAC;YACA,KAAK,EAAE,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,YAAY,EAAE,EAAE;SACf;IACL;;;;;OAKG;IACH,OAAO,EAAE,CACR,MAAqC,EACrC,GAAoC,EACT,EAAE;QAC7B,MAAM,CAAC,MAAM,KAAK,MAAM,EAAE,2CAA2C,CAAC,CAAC;QACvE,OAAO;YACN,KAAK,EAAE,EAAE;YACT,YAAY,EAAE,EAAE;YAChB,YAAY,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE;SACzD,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACH,OAAO,EAAE,CACR,QAAuC,EACvC,MAAc,EACc,EAAE,CAAC,CAAC;QAChC,KAAK,EAAE,EAAE;QACT,YAAY,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;KAC9C,CAAC;IACF;;;;OAIG;IACH,KAAK,EAAE,CAAS,MAAc,EAA6B,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC;IAC5F;;;;OAIG;IACH,MAAM,EAAE,CACP,GAAG,OAAoD,EAC3B,EAAE;QAC9B,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,MAAM,YAAY,GAA0B,EAAE,CAAC;QAC/C,IAAI,OAAqC,CAAC;QAC1C,MAAM,SAAS,GAAuC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;QAC9E,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE;YACjC,IAAI,MAAM,IAAI,UAAU,KAAK,KAAK,EAAE;gBACnC,MAAM,MAAM,GAAG,UAAuC,CAAC;gBACvD,8DAA8D;gBAC9D,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5B,sEAAsE;gBACtE,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;gBAC1C,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;oBACtC,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,8BAA8B,CAAC,CAAC;oBAC9D,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC;iBAC9B;aACD;SACD;QACD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC7B,IAAI,MAAM,IAAI,MAAM,EAAE;gBACrB,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,8BAA8B,CAAC,CAAC;gBAC9D,OAAO,CAAC,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC;aAC7B;SACD;QACD,IAAI,OAAO,KAAK,SAAS,EAAE;YAC1B,SAAS,CAAC,YAAY,GAAG,OAAO,CAAC;SACjC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;CACD,CAAC;AAEF,2GAA2G;AAC3G,MAAM,UAAU,iBAAiB,CAChC,CAA8C,EAC9C,CAA8C;IAE9C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnB,OAAO;KACP;IACD,MAAM,mBAAmB,GAAG,CAAC,UAAsB,EAAU,EAAE;QAC9D,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE;YACnC,OAAO,IAAI,UAAU,EAAE,CAAC;SACxB;QACD,OAAO,IAAI,UAAU,CAAC,QAAQ,KAAK,UAAU,CAAC,OAAO,EAAE,CAAC;IACzD,CAAC,CAAC;IACF,MAAM,kBAAkB,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,EAAE,CAC3D,mBAAmB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,mDAAmD;IACnD,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;IAC5E,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;IAC5E,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhE,IAAI,KAAK,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;QAC5C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC;QAEhD,IAAI,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE;YACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAE1C,kFAAkF;YAClF,2CAA2C;YAC3C,KAAK,CAAC,MAAM,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;YACjF,KAAK,CAAC,MAAM,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;SACjF;KACD;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;IACjC,OAAO,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,WAAW,CAC1B,CAAgC,EAChC,CAAgC;IAEhC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnB,OAAO;KACP;IACD,iBAAiB,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,EAAc,EAAE,QAAiC;IAC/E,IAAI,EAAE,KAAK,MAAM,EAAE;QAClB,OAAO,EAAE,CAAC;KACV;IAED,OAAO,YAAY,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,EAAgB,EAAE,QAAiC;IAC/E,OAAO,gBAAgB,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,mBAAmB,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAmC;IAIjF,MAAM,GAAG,GAAG,IAAI,WAAW,EAAQ,CAAC;IACpC,MAAM,GAAG,GAAG,IAAI,WAAW,EAAQ,CAAC;IACpC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE;QAChC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;YACtB,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;YACjD,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;SACjD;KACD;IAED,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,MAAM,EAAE;QAC5E,IAAI,MAAM,CAAC,YAAY,CAAC,OAAO,KAAK,KAAK,EAAE;YAC1C,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;YAChD,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;SACjE;QACD,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,SAAS,EAAE;YAC1C,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;YACjE,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;SAChD;KACD;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACrB,CAAC;AAED,SAAS,wBAAwB,CAChC,CAAkC;IAElC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,WAAW,EAAoB,CAAC;IACrD,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE;QAChC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KAC9B;IACD,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE;QAChC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAC7B;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,kBAAkB,CACjC,CAAkC,EAClC,CAAkC;IAElC,MAAM,QAAQ,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAE5C,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE;YACzB,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,kCAAkC,CAAC,CAAC;SACjE;KACD;IAED,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACrB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,iCAAiC,CAAC,CAAC;aACjE;SACD;KACD;AACF,CAAC;AAED,SAAS,UAAU,CAAC,IAAU;IAC7B,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,aAAa,CAAC,CAAa,EAAE,CAAa;IAClD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;QACnD,OAAO,CAAC,KAAK,CAAC,CAAC;KACf;IACD,OAAO,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,CAAC;AAC7D,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\tChangeAtomId,\n\tChangesetLocalId,\n\tRevisionTag,\n\tTaggedChange,\n\tasChangeAtomId,\n\tmakeAnonChange,\n\tmakeChangeAtomId,\n} from \"../../../core/index.js\";\nimport {\n\tRegisterId,\n\tOptionalChangeset,\n\tRegisterMap,\n\tMove,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/optional-field/index.js\";\nimport { Mutable, brand } from \"../../../util/index.js\";\nimport {\n\tChildChange,\n\tReplace,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/optional-field/optionalFieldChangeTypes.js\";\n\nconst dummyDetachId: ChangeAtomId = { localId: brand(0) };\n\nfunction asRegister(input: RegisterId | ChangesetLocalId): RegisterId {\n\tif (typeof input === \"string\" || typeof input === \"object\") {\n\t\treturn input;\n\t}\n\treturn { localId: input };\n}\n\nexport interface ProtoChange {\n\ttype: \"write\";\n\tcontent: RegisterId;\n}\n\nexport const Change = {\n\t/**\n\t * @returns An empty changeset\n\t */\n\tempty: (): OptionalChangeset<never> => ({ moves: [], childChanges: [] }),\n\t/**\n\t * @param src - The register to move a node from. The register must be full in the input context of the changeset.\n\t * @param dst - The register to move that node to.\n\t * The register must be empty in the input context of the changeset, or emptied as part of the changeset.\n\t * @returns A changeset that moves a node from src to dst.\n\t */\n\tmove: (\n\t\tsrc: RegisterId | ChangesetLocalId,\n\t\tdst: RegisterId | ChangesetLocalId,\n\t): OptionalChangeset<never> | ProtoChange => {\n\t\tif (dst === \"self\") {\n\t\t\treturn {\n\t\t\t\ttype: \"write\",\n\t\t\t\tcontent: asRegister(src),\n\t\t\t};\n\t\t}\n\t\tif (src === \"self\") {\n\t\t\treturn Change.clear(\"self\", dst);\n\t\t}\n\t\treturn {\n\t\t\tmoves: [[asChangeAtomId(src), asChangeAtomId(dst)]],\n\t\t\tchildChanges: [],\n\t\t};\n\t},\n\t/**\n\t * @param target - The register remove a node from. The register must be full in the input context of the changeset.\n\t * @param dst - The register to move the contents of the target register to.\n\t * The register must be empty in the input context of the changeset, or emptied as part of the changeset.\n\t * @returns A changeset that clears a register and moves the contents to another register.\n\t */\n\tclear: (\n\t\ttarget: RegisterId | ChangesetLocalId,\n\t\tdst: ChangeAtomId | ChangesetLocalId,\n\t): OptionalChangeset<never> =>\n\t\ttarget === \"self\"\n\t\t\t? {\n\t\t\t\t\tmoves: [],\n\t\t\t\t\tchildChanges: [],\n\t\t\t\t\tvalueReplace: { isEmpty: false, dst: asChangeAtomId(dst) },\n\t\t\t  }\n\t\t\t: {\n\t\t\t\t\tmoves: [[asChangeAtomId(target), asChangeAtomId(dst)]],\n\t\t\t\t\tchildChanges: [],\n\t\t\t  },\n\t/**\n\t * @param target - The register to reserve. The register must NOT be full in the input context of the changeset.\n\t * @param dst - The register that the contents of the target register should be moved to should it become populated.\n\t * The register must be empty in the input context of the changeset, or emptied as part of the changeset.\n\t * @returns A changeset that reserves an register.\n\t */\n\treserve: (\n\t\ttarget: RegisterId | ChangesetLocalId,\n\t\tdst: ChangeAtomId | ChangesetLocalId,\n\t): OptionalChangeset<never> => {\n\t\tassert(target === \"self\", \"Reserve cell only supports self as source\");\n\t\treturn {\n\t\t\tmoves: [],\n\t\t\tchildChanges: [],\n\t\t\tvalueReplace: { isEmpty: true, dst: asChangeAtomId(dst) },\n\t\t};\n\t},\n\t/**\n\t * @param location - The register that contains the child node to be changed.\n\t * That register must be full in the input context of the changeset.\n\t * @param change - A change to apply to a child node.\n\t * @returns A changeset that applies the given change to the child node in the given register.\n\t */\n\tchildAt: <TChild>(\n\t\tlocation: RegisterId | ChangesetLocalId,\n\t\tchange: TChild,\n\t): OptionalChangeset<TChild> => ({\n\t\tmoves: [],\n\t\tchildChanges: [[asRegister(location), change]],\n\t}),\n\t/**\n\t * @param change - A change to apply to a child node in the \"self\" register.\n\t * @returns A changeset that applies the given change to the child node in the \"self\" register.\n\t * The \"self\" register must be full in the input context of the changeset.\n\t */\n\tchild: <TChild>(change: TChild): OptionalChangeset<TChild> => Change.childAt(\"self\", change),\n\t/**\n\t * Combines multiple changesets for the same input context into a single changeset.\n\t * @param changes - The change to apply as part of the changeset. Interpreted as applying to the same input context.\n\t * @returns A single changeset that applies all of the given changes.\n\t */\n\tatOnce: <TChild>(\n\t\t...changes: (ProtoChange | OptionalChangeset<TChild>)[]\n\t): OptionalChangeset<TChild> => {\n\t\tconst moves: Move[] = [];\n\t\tconst childChanges: ChildChange<TChild>[] = [];\n\t\tlet replace: Mutable<Replace> | undefined;\n\t\tconst changeset: Mutable<OptionalChangeset<TChild>> = { moves, childChanges };\n\t\tfor (const changeLike of changes) {\n\t\t\tif (\"type\" in changeLike === false) {\n\t\t\t\tconst change = changeLike as OptionalChangeset<TChild>;\n\t\t\t\t// Note: this will stack overflow if there are too many moves.\n\t\t\t\tmoves.push(...change.moves);\n\t\t\t\t// Note: this will stack overflow if there are too many child changes.\n\t\t\t\tchildChanges.push(...change.childChanges);\n\t\t\t\tif (change.valueReplace !== undefined) {\n\t\t\t\t\tassert(replace === undefined, \"Multiple reserved detach ids\");\n\t\t\t\t\treplace = change.valueReplace;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (const change of changes) {\n\t\t\tif (\"type\" in change) {\n\t\t\t\tassert(replace !== undefined, \"Invalid write without detach\");\n\t\t\t\treplace.src = change.content;\n\t\t\t}\n\t\t}\n\t\tif (replace !== undefined) {\n\t\t\tchangeset.valueReplace = replace;\n\t\t}\n\t\treturn changeset;\n\t},\n};\n\n// Optional changesets may be equivalent but not evaluate to be deep-equal, as some ordering is irrelevant.\nexport function assertTaggedEqual(\n\ta: TaggedChange<OptionalChangeset> | undefined,\n\tb: TaggedChange<OptionalChangeset> | undefined,\n): void {\n\tif (a === undefined || b === undefined) {\n\t\tassert.equal(a, b);\n\t\treturn;\n\t}\n\tconst normalizeRegisterId = (registerId: RegisterId): string => {\n\t\tif (typeof registerId === \"string\") {\n\t\t\treturn `s${registerId}`;\n\t\t}\n\t\treturn `r${registerId.revision}id${registerId.localId}`;\n\t};\n\tconst compareRegisterIds = (c: RegisterId, d: RegisterId) =>\n\t\tnormalizeRegisterId(c).localeCompare(normalizeRegisterId(d));\n\t// The composed rebase implementation deep-freezes.\n\tconst aCopy = { ...a, change: { ...a.change, moves: [...a.change.moves] } };\n\tconst bCopy = { ...b, change: { ...b.change, moves: [...b.change.moves] } };\n\taCopy.change.moves.sort(([c], [d]) => compareRegisterIds(c, d));\n\tbCopy.change.moves.sort(([c], [d]) => compareRegisterIds(c, d));\n\n\tif (aCopy.change.valueReplace !== undefined) {\n\t\tassert(bCopy.change.valueReplace !== undefined);\n\n\t\tif (aCopy.change.valueReplace.isEmpty) {\n\t\t\tassert(bCopy.change.valueReplace.isEmpty);\n\n\t\t\t// Detach IDs are only relevant if the field was not empty, so we tolerate compose\n\t\t\t// assigning them arbitrarily in this case.\n\t\t\taCopy.change.valueReplace = { ...aCopy.change.valueReplace, dst: dummyDetachId };\n\t\t\tbCopy.change.valueReplace = { ...bCopy.change.valueReplace, dst: dummyDetachId };\n\t\t}\n\t}\n\n\tdelete aCopy.change.valueReplace;\n\tdelete bCopy.change.valueReplace;\n\tassert.deepEqual(aCopy, bCopy);\n}\n\nexport function assertEqual(\n\ta: OptionalChangeset | undefined,\n\tb: OptionalChangeset | undefined,\n): void {\n\tif (a === undefined || b === undefined) {\n\t\tassert.equal(a, b);\n\t\treturn;\n\t}\n\tassertTaggedEqual(makeAnonChange(a), makeAnonChange(b));\n}\n\nexport function taggedRegister(id: RegisterId, revision: RevisionTag | undefined): RegisterId {\n\tif (id === \"self\") {\n\t\treturn id;\n\t}\n\n\treturn taggedAtomId(id, revision);\n}\n\nexport function taggedAtomId(id: ChangeAtomId, revision: RevisionTag | undefined): ChangeAtomId {\n\treturn makeChangeAtomId(id.localId, id.revision ?? revision);\n}\n\nfunction getTouchedRegisters({ change, revision }: TaggedChange<OptionalChangeset>): {\n\tsrc: RegisterMap<true>;\n\tdst: RegisterMap<true>;\n} {\n\tconst src = new RegisterMap<true>();\n\tconst dst = new RegisterMap<true>();\n\tfor (const leg1 of change.moves) {\n\t\tif (!isNoopMove(leg1)) {\n\t\t\tsrc.set(taggedRegister(leg1[0], revision), true);\n\t\t\tdst.set(taggedRegister(leg1[1], revision), true);\n\t\t}\n\t}\n\n\tif (change.valueReplace !== undefined && change.valueReplace.src !== \"self\") {\n\t\tif (change.valueReplace.isEmpty === false) {\n\t\t\tsrc.set(taggedRegister(\"self\", revision), true);\n\t\t\tdst.set(taggedRegister(change.valueReplace.dst, revision), true);\n\t\t}\n\t\tif (change.valueReplace.src !== undefined) {\n\t\t\tsrc.set(taggedRegister(change.valueReplace.src, revision), true);\n\t\t\tdst.set(taggedRegister(\"self\", revision), true);\n\t\t}\n\t}\n\treturn { src, dst };\n}\n\nfunction getOutputRegisterStatues(\n\ta: TaggedChange<OptionalChangeset>,\n): RegisterMap<\"full\" | \"empty\"> {\n\tconst { src, dst } = getTouchedRegisters(a);\n\tconst statuses = new RegisterMap<\"full\" | \"empty\">();\n\tfor (const detach of src.keys()) {\n\t\tstatuses.set(detach, \"empty\");\n\t}\n\tfor (const attach of dst.keys()) {\n\t\tstatuses.set(attach, \"full\");\n\t}\n\treturn statuses;\n}\n\nexport function verifyContextChain(\n\ta: TaggedChange<OptionalChangeset>,\n\tb: TaggedChange<OptionalChangeset>,\n): void {\n\tconst statuses = getOutputRegisterStatues(a);\n\tconst { src, dst } = getTouchedRegisters(b);\n\n\tfor (const detach of src.keys()) {\n\t\tconst status = statuses.get(detach);\n\t\tif (status !== undefined) {\n\t\t\tassert.equal(status, \"full\", \"Invalid detach on empty register\");\n\t\t}\n\t}\n\n\tfor (const attach of dst.keys()) {\n\t\tif (!src.has(attach)) {\n\t\t\tconst status = statuses.get(attach);\n\t\t\tif (status !== undefined) {\n\t\t\t\tassert.equal(status, \"empty\", \"Invalid attach on full register\");\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction isNoopMove(move: Move): boolean {\n\treturn registerEqual(move[0], move[1]);\n}\n\nfunction registerEqual(a: RegisterId, b: RegisterId): boolean {\n\tif (typeof a === \"string\" || typeof b === \"string\") {\n\t\treturn a === b;\n\t}\n\treturn a.revision === b.revision && a.localId === b.localId;\n}\n"]}

package/lib/test/feature-libraries/schema-aware/schemaAware.spec.d.ts

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

package/lib/test/feature-libraries/schema-aware/schemaAware.spec.d.ts.map

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

package/lib/test/feature-libraries/schema-aware/schemaAware.spec.js

@@ -1,133 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { valueSymbol, FieldKinds, typeNameSymbol, FlexFieldSchema, } from "../../../feature-libraries/index.js";
-import { leaf, SchemaBuilder } from "../../../domains/index.js";
-// Test UnbrandedName
-{
-}
-{
-    // Aliases for conciseness
-    const { optional, required, sequence } = FieldKinds;
-    // Example Schema:
-    const builder = new SchemaBuilder({ scope: "SchemaAwareTests" });
-    // Declare a simple type which just holds a number.
-    const numberSchema = leaf.number;
-    // Check the various ways to refer to child types produce the same results
-    {
-        const numberField1 = FlexFieldSchema.create(required, [numberSchema]);
-        const numberField2 = SchemaBuilder.required(numberSchema);
-        const numberField3 = FlexFieldSchema.createUnsafe(required, [numberSchema]);
-        const numberFieldLazy = FlexFieldSchema.create(required, [() => numberSchema]);
-    }
-    // Simple object
-    {
-        const simpleObject = builder.object("simple", {
-            x: builder.required(numberSchema),
-        });
-    }
-    const ballSchema = builder.object("ball", {
-        // Test schema objects in as well as lazy functions
-        x: numberSchema,
-        y: [() => numberSchema],
-        size: builder.optional(numberSchema),
-    });
-    // Recursive case:
-    const boxSchema = builder.objectRecursive("box", {
-        children: FlexFieldSchema.createUnsafe(sequence, [ballSchema, () => boxSchema]),
-    });
-    {
-    }
-    const schemaData = builder.intoLibrary();
-    {
-    }
-    const n1 = 5;
-    const b1 = { x: 1, y: 2, size: 10 };
-    const b1x = { x: 1, y: 2, size: undefined }; // TODO: restore ability to omit optional fields.
-    const b2 = { [typeNameSymbol]: ballSchema.name, x: 1, y: 2, size: undefined };
-    const b4 = {
-        [typeNameSymbol]: "SchemaAwareTests.ball",
-        x: 1,
-        y: 5,
-        size: undefined,
-    };
-    const b6 = { [typeNameSymbol]: ballSchema.name, x: 1, y: 5, size: undefined };
-    // This is type safe, so we can only access fields that are in the schema.
-    // @ts-expect-error This is an error since it accesses an invalid field.
-    const b5 = { [typeNameSymbol]: ballSchema.name, x: 1, z: 5 };
-    // @ts-expect-error Missing required field
-    const b7 = { [typeNameSymbol]: ballSchema.name, x: 1 };
-    {
-    }
-    // @ts-expect-error Wrong type
-    const nError1 = { [typeNameSymbol]: ballSchema.name, [valueSymbol]: 5 };
-    {
-    }
-    // Test terminal cases:
-    {
-    }
-    // Test non recursive cases:
-    {
-    }
-    // Test polymorphic cases:
-    {
-        const builder2 = new SchemaBuilder({ scope: "SchemaAwarePolymorphicTest" });
-        const bool = leaf.boolean;
-        const str = leaf.string;
-        const parentField = SchemaBuilder.required([str, bool]);
-        const parent = builder2.object("parent", { child: parentField });
-        // Check child handling
-        {
-        }
-        {
-        }
-    }
-    // Test simple recursive cases:
-    {
-        const builder2 = new SchemaBuilder({ scope: "SchemaAwareRecursiveTest" });
-        const rec = builder2.objectRecursive("rec", {
-            x: FlexFieldSchema.createUnsafe(optional, [() => rec]),
-        });
-        {
-        }
-        // Confirm schema's recursive type is correct.
-        {
-        }
-        // Check generated schema aware types
-        {
-            // Check Simple's field type unit tests
-            {
-            }
-        }
-    }
-    // Test recursive cases:
-    {
-        // Check child handling
-        {
-            {
-                {
-                }
-            }
-        }
-        {
-            const child = {
-                [typeNameSymbol]: boxSchema.name,
-                children: [],
-            };
-            const parent = {
-                [typeNameSymbol]: boxSchema.name,
-                children: [
-                    child,
-                    {
-                        [typeNameSymbol]: ballSchema.name,
-                        x: 1,
-                        y: 2,
-                        size: undefined,
-                    },
-                ],
-            };
-        }
-    }
-}
-//# sourceMappingURL=schemaAware.spec.js.map

package/lib/test/feature-libraries/schema-aware/schemaAware.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schemaAware.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/schema-aware/schemaAware.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAiBH,OAAO,EACN,WAAW,EACX,UAAU,EACV,cAAc,EAGd,eAAe,GAEf,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAOhE,qBAAqB;AACrB;CAIC;AAED;IACC,0BAA0B;IAC1B,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC;IAEpD,kBAAkB;IAClB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC;IAEjE,mDAAmD;IACnD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC;IAEjC,0EAA0E;IAC1E;QACC,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QACtE,MAAM,YAAY,GAAG,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,YAAY,GAAG,eAAe,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAK5E,MAAM,eAAe,GAAG,eAAe,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;KAG/E;IAED,gBAAgB;IAChB;QACC,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE;YAC7C,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC;SACjC,CAAC,CAAC;KACH;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE;QACzC,mDAAmD;QACnD,CAAC,EAAE,YAAY;QACf,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC;QACvB,IAAI,EAAE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC;KACpC,CAAC,CAAC;IAEH,kBAAkB;IAClB,MAAM,SAAS,GAAG,OAAO,CAAC,eAAe,CAAC,KAAK,EAAE;QAChD,QAAQ,EAAE,eAAe,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;KAC/E,CAAC,CAAC;IAEH;KAGC;IAGD,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAKzC;KAEC;IAKD,MAAM,EAAE,GAAe,CAAC,CAAC;IAEzB,MAAM,EAAE,GAAa,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC9C,MAAM,GAAG,GAAa,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,iDAAiD;IACxG,MAAM,EAAE,GAAa,EAAE,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACxF,MAAM,EAAE,GAAa;QACpB,CAAC,cAAc,CAAC,EAAE,uBAAuB;QACzC,CAAC,EAAE,CAAC;QACJ,CAAC,EAAE,CAAC;QACJ,IAAI,EAAE,SAAS;KACf,CAAC;IACF,MAAM,EAAE,GAAa,EAAE,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAExF,0EAA0E;IAC1E,wEAAwE;IACxE,MAAM,EAAE,GAAa,EAAE,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAEvE,0CAA0C;IAC1C,MAAM,EAAE,GAAa,EAAE,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAEjE;KAMC;IAED,8BAA8B;IAC9B,MAAM,OAAO,GAAe,EAAE,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;IAEpF;KAcC;IASD,uBAAuB;IACvB;KAGC;IAwBD,4BAA4B;IAC5B;KAGC;IAED,0BAA0B;IAC1B;QACC,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,4BAA4B,EAAE,CAAC,CAAC;QAC5E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;QAOjE,uBAAuB;QACvB;SAYC;QAED;SAGC;KACD;IAED,+BAA+B;IAC/B;QACC,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,0BAA0B,EAAE,CAAC,CAAC;QAC1E,MAAM,GAAG,GAAG,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE;YAC3C,CAAC,EAAE,eAAe,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;SACtD,CAAC,CAAC;QAKH;SAIC;QAED,8CAA8C;QAC9C;SAIC;QAED,qCAAqC;QACrC;YAiBC,uCAAuC;YACvC;aAGC;SAKD;KACD;IAED,wBAAwB;IACxB;QAQC,uBAAuB;QACvB;YAWC;gBACC;iBASC;aACD;SAGD;QAED;YACC,MAAM,KAAK,GAAM;gBAChB,CAAC,cAAc,CAAC,EAAE,SAAS,CAAC,IAAI;gBAChC,QAAQ,EAAE,EAAE;aACZ,CAAC;YACF,MAAM,MAAM,GAAM;gBACjB,CAAC,cAAc,CAAC,EAAE,SAAS,CAAC,IAAI;gBAChC,QAAQ,EAAE;oBACT,KAAK;oBACL;wBACC,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,IAAI;wBACjC,CAAC,EAAE,CAAC;wBACJ,CAAC,EAAE,CAAC;wBACJ,IAAI,EAAE,SAAS;qBACf;iBACD;aACD,CAAC;SACF;KACD;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// This file replicates a lot of generated types manually for test comparisons.\n// Since \"type\" and \"interface\" type check slightly different, this file needs to create types when the linter recommends interfaces.\n/* eslint-disable @typescript-eslint/consistent-type-definitions */\n\nimport {\n\tAllowedTypesToFlexInsertableTree,\n\tInsertableFlexNode,\n\tInsertableFlexField,\n\tTypedFields,\n\tUnbrandedName,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/schema-aware/schemaAware.js\";\n\nimport { TreeNodeSchemaIdentifier } from \"../../../core/index.js\";\nimport { areSafelyAssignable, requireAssignableTo, requireTrue } from \"../../../util/index.js\";\nimport {\n\tvalueSymbol,\n\tFieldKinds,\n\ttypeNameSymbol,\n\tContextuallyTypedNodeDataObject,\n\tFlexTreeNodeSchema,\n\tFlexFieldSchema,\n\tFlexAllowedTypes,\n} from \"../../../feature-libraries/index.js\";\nimport { leaf, SchemaBuilder } from \"../../../domains/index.js\";\nimport {\n\tFlexList,\n\tFlexListToNonLazyArray,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/typed-schema/flexList.js\";\n\n// Test UnbrandedName\n{\n\ttype BrandedName = TreeNodeSchemaIdentifier<\"X\">;\n\ttype Unbranded = UnbrandedName<BrandedName>;\n\ttype _check = requireTrue<areSafelyAssignable<Unbranded, \"X\">>;\n}\n\n{\n\t// Aliases for conciseness\n\tconst { optional, required, sequence } = FieldKinds;\n\n\t// Example Schema:\n\tconst builder = new SchemaBuilder({ scope: \"SchemaAwareTests\" });\n\n\t// Declare a simple type which just holds a number.\n\tconst numberSchema = leaf.number;\n\n\t// Check the various ways to refer to child types produce the same results\n\t{\n\t\tconst numberField1 = FlexFieldSchema.create(required, [numberSchema]);\n\t\tconst numberField2 = SchemaBuilder.required(numberSchema);\n\t\tconst numberField3 = FlexFieldSchema.createUnsafe(required, [numberSchema]);\n\t\ttype check1_ = requireAssignableTo<typeof numberField1, typeof numberField2>;\n\t\ttype check2_ = requireAssignableTo<typeof numberField2, typeof numberField3>;\n\t\ttype check3_ = requireAssignableTo<typeof numberField3, typeof numberField1>;\n\n\t\tconst numberFieldLazy = FlexFieldSchema.create(required, [() => numberSchema]);\n\t\ttype NonLazy = FlexListToNonLazyArray<typeof numberFieldLazy.allowedTypes>;\n\t\ttype check4_ = requireAssignableTo<NonLazy, typeof numberField1.allowedTypes>;\n\t}\n\n\t// Simple object\n\t{\n\t\tconst simpleObject = builder.object(\"simple\", {\n\t\t\tx: builder.required(numberSchema),\n\t\t});\n\t}\n\n\tconst ballSchema = builder.object(\"ball\", {\n\t\t// Test schema objects in as well as lazy functions\n\t\tx: numberSchema,\n\t\ty: [() => numberSchema],\n\t\tsize: builder.optional(numberSchema),\n\t});\n\n\t// Recursive case:\n\tconst boxSchema = builder.objectRecursive(\"box\", {\n\t\tchildren: FlexFieldSchema.createUnsafe(sequence, [ballSchema, () => boxSchema]),\n\t});\n\n\t{\n\t\t// Recursive objects don't get this type checking automatically, so confirm it\n\t\ttype _check = requireAssignableTo<typeof boxSchema, FlexTreeNodeSchema>;\n\t}\n\n\ttype x = typeof numberSchema.name;\n\tconst schemaData = builder.intoLibrary();\n\n\t// Example Use:\n\ttype BallTree = InsertableFlexNode<typeof ballSchema>;\n\n\t{\n\t\ttype check1_ = requireAssignableTo<BallTree, ContextuallyTypedNodeDataObject>;\n\t}\n\n\t// We can also get the type for the \"number\" nodes.\n\ttype NumberTree = InsertableFlexNode<typeof numberSchema>;\n\n\tconst n1: NumberTree = 5;\n\n\tconst b1: BallTree = { x: 1, y: 2, size: 10 };\n\tconst b1x: BallTree = { x: 1, y: 2, size: undefined }; // TODO: restore ability to omit optional fields.\n\tconst b2: BallTree = { [typeNameSymbol]: ballSchema.name, x: 1, y: 2, size: undefined };\n\tconst b4: BallTree = {\n\t\t[typeNameSymbol]: \"SchemaAwareTests.ball\",\n\t\tx: 1,\n\t\ty: 5,\n\t\tsize: undefined,\n\t};\n\tconst b6: BallTree = { [typeNameSymbol]: ballSchema.name, x: 1, y: 5, size: undefined };\n\n\t// This is type safe, so we can only access fields that are in the schema.\n\t// @ts-expect-error This is an error since it accesses an invalid field.\n\tconst b5: BallTree = { [typeNameSymbol]: ballSchema.name, x: 1, z: 5 };\n\n\t// @ts-expect-error Missing required field\n\tconst b7: BallTree = { [typeNameSymbol]: ballSchema.name, x: 1 };\n\n\t{\n\t\ttype XField = (typeof ballSchema)[\"objectNodeFieldsObject\"][\"x\"];\n\t\ttype XMultiplicity = XField[\"kind\"][\"multiplicity\"];\n\t\ttype XContent = InsertableFlexField<XField>;\n\t\ttype XChild = XField[\"allowedTypes\"];\n\t\ttype _check = requireAssignableTo<XContent, number>;\n\t}\n\n\t// @ts-expect-error Wrong type\n\tconst nError1: NumberTree = { [typeNameSymbol]: ballSchema.name, [valueSymbol]: 5 };\n\n\t{\n\t\t// A concrete example for the \"x\" field:\n\t\ttype BallXFieldInfo = typeof ballSchema.objectNodeFieldsObject.x;\n\t\ttype BallXFieldTypes = BallXFieldInfo[\"allowedTypes\"];\n\t\ttype check_ = requireAssignableTo<BallXFieldTypes, readonly [typeof numberSchema]>;\n\n\t\ttype Child = AllowedTypesToFlexInsertableTree<BallXFieldTypes>;\n\n\t\ttype check3_ = requireAssignableTo<Child, NumberTree>;\n\t\ttype check4_ = requireAssignableTo<NumberTree, Child>;\n\t\ttype Child2 = AllowedTypesToFlexInsertableTree<[typeof numberSchema]>;\n\n\t\ttype check3x_ = requireAssignableTo<Child2, NumberTree>;\n\t\ttype check4x_ = requireAssignableTo<NumberTree, Child2>;\n\t}\n\n\ttype FlexNumber =\n\t\t| number\n\t\t| {\n\t\t\t\t[typeNameSymbol]?: \"com.fluidframework.leaf.number\";\n\t\t\t\t[valueSymbol]: number;\n\t\t  };\n\n\t// Test terminal cases:\n\t{\n\t\ttype S = InsertableFlexNode<typeof numberSchema>;\n\t\ttype _check4 = requireTrue<areSafelyAssignable<S, number>>;\n\t}\n\n\tinterface FlexBall {\n\t\t[typeNameSymbol]?: \"SchemaAwareTests.ball\";\n\t\tx: FlexNumber;\n\t\ty: FlexNumber;\n\t\tsize: FlexNumber | undefined;\n\t}\n\n\tinterface EditableBall {\n\t\t[typeNameSymbol]: typeof ballSchema.name;\n\t\tx: number;\n\t\ty: number;\n\t\tsize: number | undefined;\n\t}\n\n\t// This type type checks differently if its an interface, which breaks.\n\ttype SimpleBall = {\n\t\t[typeNameSymbol]?: \"SchemaAwareTests.ball\";\n\t\tx: number;\n\t\ty: number;\n\t\tsize: number | undefined;\n\t};\n\n\t// Test non recursive cases:\n\t{\n\t\ttype S = InsertableFlexNode<typeof ballSchema>;\n\t\ttype _check4 = requireTrue<areSafelyAssignable<S, SimpleBall>>;\n\t}\n\n\t// Test polymorphic cases:\n\t{\n\t\tconst builder2 = new SchemaBuilder({ scope: \"SchemaAwarePolymorphicTest\" });\n\t\tconst bool = leaf.boolean;\n\t\tconst str = leaf.string;\n\t\tconst parentField = SchemaBuilder.required([str, bool]);\n\t\tconst parent = builder2.object(\"parent\", { child: parentField });\n\n\t\tinterface SimpleParent {\n\t\t\t[typeNameSymbol]?: \"SchemaAwarePolymorphicTest.parent\";\n\t\t\tchild: boolean | string;\n\t\t}\n\n\t\t// Check child handling\n\t\t{\n\t\t\ttype ChildSchema = typeof parentField;\n\t\t\ttype ChildSchemaTypes = ChildSchema extends FlexFieldSchema<any, infer Types>\n\t\t\t\t? Types\n\t\t\t\t: never;\n\t\t\ttype AllowedChildTypes = ChildSchema[\"allowedTypes\"];\n\t\t\ttype _check = requireAssignableTo<ChildSchemaTypes, AllowedChildTypes>;\n\t\t\ttype BoolChild = ChildSchemaTypes[1];\n\t\t\ttype _check3 = requireAssignableTo<ChildSchemaTypes, FlexAllowedTypes>;\n\t\t\ttype _check4 = requireAssignableTo<ChildSchemaTypes, FlexList<FlexTreeNodeSchema>>;\n\t\t\ttype NormalizedChildSchemaTypes = FlexListToNonLazyArray<ChildSchemaTypes>;\n\t\t\ttype ChildTypes = AllowedTypesToFlexInsertableTree<ChildSchemaTypes>;\n\t\t}\n\n\t\t{\n\t\t\ttype S = InsertableFlexNode<typeof parent>;\n\t\t\ttype _check4 = requireTrue<areSafelyAssignable<S, SimpleParent>>;\n\t\t}\n\t}\n\n\t// Test simple recursive cases:\n\t{\n\t\tconst builder2 = new SchemaBuilder({ scope: \"SchemaAwareRecursiveTest\" });\n\t\tconst rec = builder2.objectRecursive(\"rec\", {\n\t\t\tx: FlexFieldSchema.createUnsafe(optional, [() => rec]),\n\t\t});\n\n\t\ttype RecObjectSchema = typeof rec;\n\t\ttype RecFieldSchema = typeof rec.objectNodeFieldsObject.x;\n\n\t\t{\n\t\t\t// Recursive objects don't get this type checking automatically, so confirm it\n\t\t\ttype _check1 = requireAssignableTo<RecObjectSchema, FlexTreeNodeSchema>;\n\t\t\ttype _check2 = requireAssignableTo<RecFieldSchema, FlexFieldSchema>;\n\t\t}\n\n\t\t// Confirm schema's recursive type is correct.\n\t\t{\n\t\t\ttype Allowed = RecFieldSchema[\"allowedTypes\"];\n\t\t\ttype AllowedNonLazy = FlexListToNonLazyArray<Allowed>[0];\n\t\t\ttype _check1 = requireTrue<areSafelyAssignable<AllowedNonLazy, RecObjectSchema>>;\n\t\t}\n\n\t\t// Check generated schema aware types\n\t\t{\n\t\t\ttype ExpectedFlexible = {\n\t\t\t\t[typeNameSymbol]?: \"SchemaAwareRecursiveTest.rec\";\n\t\t\t\tx: ExpectedFlexible | undefined;\n\t\t\t};\n\n\t\t\ttype ExpectedSimple = {\n\t\t\t\t[typeNameSymbol]?: \"SchemaAwareRecursiveTest.rec\";\n\t\t\t\tx: ExpectedSimple | undefined;\n\t\t\t};\n\n\t\t\ttype ExpectedSimple2 = {\n\t\t\t\tx: ExpectedSimple2 | undefined;\n\t\t\t};\n\n\t\t\ttype Simple = InsertableFlexNode<typeof rec>;\n\n\t\t\t// Check Simple's field type unit tests\n\t\t\t{\n\t\t\t\ttype ChildTree = AllowedTypesToFlexInsertableTree<RecFieldSchema[\"allowedTypes\"]>;\n\t\t\t\ttype SimpleField = InsertableFlexField<RecFieldSchema>;\n\t\t\t}\n\n\t\t\t// Overall integration tests\n\t\t\t// type _check2 = requireTrue<areSafelyAssignable<XB, EditableParent>>;\n\t\t\ttype _check3 = requireTrue<areSafelyAssignable<Simple, ExpectedSimple>>;\n\t\t}\n\t}\n\n\t// Test recursive cases:\n\t{\n\t\ttype S = InsertableFlexNode<typeof boxSchema>;\n\n\t\tinterface FlexBox {\n\t\t\t[typeNameSymbol]?: \"SchemaAwareTests.box\";\n\t\t\tchildren: (FlexBall | FlexBox)[];\n\t\t}\n\n\t\t// Check child handling\n\t\t{\n\t\t\ttype ChildSchema = typeof boxSchema.objectNodeFieldsObject.children;\n\t\t\ttype ChildSchemaTypes = ChildSchema extends FlexFieldSchema<any, infer Types>\n\t\t\t\t? Types\n\t\t\t\t: never;\n\t\t\ttype AllowedChildTypes = ChildSchema[\"allowedTypes\"];\n\t\t\ttype _check = requireAssignableTo<ChildSchemaTypes, AllowedChildTypes>;\n\t\t\ttype BoxChild = ChildSchemaTypes[1];\n\t\t\ttype _check3 = requireAssignableTo<ChildSchemaTypes, FlexAllowedTypes>;\n\t\t\ttype _check4 = requireAssignableTo<ChildSchemaTypes, FlexList<FlexTreeNodeSchema>>;\n\t\t\ttype NormalizedChildSchemaTypes = FlexListToNonLazyArray<ChildSchemaTypes>;\n\t\t\t{\n\t\t\t\t{\n\t\t\t\t\t// Should be the same as FlexBox\n\t\t\t\t\ttype BoxChildType3 = InsertableFlexNode<typeof boxSchema>;\n\n\t\t\t\t\ttype BoxChildTypeFields = TypedFields<typeof boxSchema.objectNodeFieldsObject>;\n\n\t\t\t\t\ttype BoxChildTypeField = InsertableFlexField<\n\t\t\t\t\t\ttypeof boxSchema.objectNodeFieldsObject.children\n\t\t\t\t\t>;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttype ChildTypes = AllowedTypesToFlexInsertableTree<ChildSchemaTypes>;\n\t\t\ttype Field = InsertableFlexField<ChildSchema>;\n\t\t}\n\n\t\t{\n\t\t\tconst child: S = {\n\t\t\t\t[typeNameSymbol]: boxSchema.name,\n\t\t\t\tchildren: [],\n\t\t\t};\n\t\t\tconst parent: S = {\n\t\t\t\t[typeNameSymbol]: boxSchema.name,\n\t\t\t\tchildren: [\n\t\t\t\t\tchild,\n\t\t\t\t\t{\n\t\t\t\t\t\t[typeNameSymbol]: ballSchema.name,\n\t\t\t\t\t\tx: 1,\n\t\t\t\t\t\ty: 2,\n\t\t\t\t\t\tsize: undefined,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t};\n\t\t}\n\t}\n}\n"]}

package/lib/test/feature-libraries/schema-aware/schemaComplex.d.ts

@@ -1,16 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FlexFieldSchema } from "../../../feature-libraries/index.js";
-export declare const stringTaskSchema: import("../../../feature-libraries/index.js").FlexFieldNodeSchema<"Complex Schema Example.StringTask", FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.string", import("../../../index.js").ValueSchema.String>]>>;
-export declare const listTaskSchema: import("../../../feature-libraries/index.js").FlexObjectNodeSchema<"Complex Schema Example.ListTask", {
-    readonly items: FlexFieldSchema<import("../../../feature-libraries/index.js").Sequence, readonly [import("../../../feature-libraries/index.js").FlexFieldNodeSchema<"Complex Schema Example.StringTask", FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.string", import("../../../index.js").ValueSchema.String>]>>, () => import("../../../feature-libraries/index.js").FlexObjectNodeSchema<"Complex Schema Example.ListTask", any>]>;
-}>;
-export declare const rootFieldSchema: FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").FlexFieldNodeSchema<"Complex Schema Example.StringTask", FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.string", import("../../../index.js").ValueSchema.String>]>>, import("../../../feature-libraries/index.js").FlexObjectNodeSchema<"Complex Schema Example.ListTask", {
-    readonly items: FlexFieldSchema<import("../../../feature-libraries/index.js").Sequence, readonly [import("../../../feature-libraries/index.js").FlexFieldNodeSchema<"Complex Schema Example.StringTask", FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.string", import("../../../index.js").ValueSchema.String>]>>, () => import("../../../feature-libraries/index.js").FlexObjectNodeSchema<"Complex Schema Example.ListTask", any>]>;
-}>]>;
-export declare const appSchemaData: import("../../../feature-libraries/index.js").FlexTreeSchema<FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").FlexFieldNodeSchema<"Complex Schema Example.StringTask", FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.string", import("../../../index.js").ValueSchema.String>]>>, import("../../../feature-libraries/index.js").FlexObjectNodeSchema<"Complex Schema Example.ListTask", {
-    readonly items: FlexFieldSchema<import("../../../feature-libraries/index.js").Sequence, readonly [import("../../../feature-libraries/index.js").FlexFieldNodeSchema<"Complex Schema Example.StringTask", FlexFieldSchema<import("../../../feature-libraries/index.js").Required, readonly [import("../../../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.string", import("../../../index.js").ValueSchema.String>]>>, () => import("../../../feature-libraries/index.js").FlexObjectNodeSchema<"Complex Schema Example.ListTask", any>]>;
-}>]>>;
-//# sourceMappingURL=schemaComplex.d.ts.map

package/lib/test/feature-libraries/schema-aware/schemaComplex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"schemaComplex.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/schema-aware/schemaComplex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAIN,eAAe,EAEf,MAAM,qCAAqC,CAAC;AAM7C,eAAO,MAAM,gBAAgB,4UAAkD,CAAC;AAEhF,eAAO,MAAM,cAAc;;EAKzB,CAAC;AAOH,eAAO,MAAM,eAAe;;IAA6D,CAAC;AAE1F,eAAO,MAAM,aAAa;;KAAsC,CAAC"}