@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/feature-libraries/optional-field/optionalField.js

@@ -0,0 +1,444 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils";
+import { tagChange, areEqualChangeAtomIds, } from "../../core";
+import { fail, SizedNestedMap } from "../../util";
+import { getIntention, NodeExistenceState, } from "../modular-schema";
+import { nodeIdFromChangeAtom } from "../deltaUtils";
+import { makeOptionalFieldCodecFamily } from "./optionalFieldCodecs";
+class RegisterMap {
+    constructor() {
+        this.nestedMapData = new SizedNestedMap();
+    }
+    clone() {
+        const clone = new RegisterMap();
+        for (const [id, t] of this.entries()) {
+            clone.set(id, t);
+        }
+        return clone;
+    }
+    set(id, childChange) {
+        if (id === "self") {
+            this.nestedMapData.set("self", undefined, childChange);
+        }
+        else {
+            this.nestedMapData.set(id.localId, id.revision, childChange);
+        }
+    }
+    get(id) {
+        return id === "self"
+            ? this.nestedMapData.tryGet(id, undefined)
+            : this.nestedMapData.tryGet(id.localId, id.revision);
+    }
+    has(id) {
+        return this.get(id) !== undefined;
+    }
+    delete(id) {
+        return id === "self"
+            ? this.nestedMapData.delete("self", undefined)
+            : this.nestedMapData.delete(id.localId, id.revision);
+    }
+    keys() {
+        const changeIds = [];
+        for (const [localId, nestedMap] of this.nestedMapData) {
+            if (localId === "self") {
+                changeIds.push("self");
+            }
+            else {
+                for (const [revisionTag, _] of nestedMap) {
+                    changeIds.push(revisionTag === undefined
+                        ? { localId }
+                        : { localId, revision: revisionTag });
+                }
+            }
+        }
+        return changeIds;
+    }
+    values() {
+        return this.nestedMapData.values();
+    }
+    entries() {
+        const entries = [];
+        for (const changeId of this.keys()) {
+            if (changeId === "self") {
+                const entry = this.nestedMapData.tryGet("self", undefined);
+                assert(entry !== undefined, 0x770 /* Entry should not be undefined when iterating keys. */);
+                entries.push(["self", entry]);
+            }
+            else {
+                const entry = this.nestedMapData.tryGet(changeId.localId, changeId.revision);
+                assert(entry !== undefined, 0x771 /* Entry should not be undefined when iterating keys. */);
+                entries.push([changeId, entry]);
+            }
+        }
+        return entries;
+    }
+    get size() {
+        return this.nestedMapData.size;
+    }
+}
+/**
+ * Attempt to deduce whether the "self" register of a change is empty or filled in the input context.
+ * Optional changesets do not always carry enough information to determine this, in which case this
+ * returns `undefined`.
+ */
+function tryInferInputContext(change) {
+    if (change.reservedDetachId !== undefined) {
+        return "empty";
+    }
+    for (const [src] of change.moves) {
+        if (src === "self") {
+            return "filled";
+        }
+    }
+    return undefined;
+}
+export const optionalChangeRebaser = {
+    compose: (changes, composeChild, genId, crossFieldManager, revisionMetadata) => {
+        const getBidirectionalMaps = (moves) => {
+            const srcToDst = new RegisterMap();
+            const dstToSrc = new RegisterMap();
+            for (const [src, dst, target] of moves) {
+                srcToDst.set(src, [dst, target]);
+                dstToSrc.set(dst, src);
+            }
+            return { srcToDst, dstToSrc };
+        };
+        let latestReservedDetachId;
+        let inputContext;
+        const childChangesByOriginalId = new RegisterMap();
+        // TODO: It might be possible to compose moves in place rather than repeatedly copy.
+        // Additionally, working out a 'register allocation' strategy which enables frequent cancellation of noop moves
+        // for sandwich rebases would help with cloning if in-place proves too difficult
+        const current = getBidirectionalMaps([]);
+        for (const { change, revision } of changes) {
+            inputContext ?? (inputContext = tryInferInputContext(change));
+            const withIntention = (id) => {
+                if (id === "self") {
+                    return id;
+                }
+                const intention = getIntention(id.revision ?? revision, revisionMetadata);
+                return { revision: intention, localId: id.localId };
+            };
+            const nextSrcToDst = new RegisterMap();
+            const nextDstToSrc = new RegisterMap();
+            if (change.reservedDetachId !== undefined) {
+                latestReservedDetachId = withIntention(change.reservedDetachId);
+            }
+            // Compose all the things that `change` moved.
+            for (const [unintentionedSrc, unintentionedDst, target] of change.moves) {
+                const src = withIntention(unintentionedSrc);
+                const dst = withIntention(unintentionedDst);
+                let originalSrc = current.dstToSrc.get(src);
+                let currentTarget;
+                if (originalSrc !== undefined) {
+                    const [dst2, existingTarget] = current.srcToDst.get(originalSrc) ?? fail("expected backward mapping");
+                    assert(areEqualRegisterIds(dst2, src), 0x855 /* expected consistent backward mapping */);
+                    currentTarget = existingTarget;
+                }
+                else {
+                    originalSrc = src;
+                }
+                nextSrcToDst.set(originalSrc, [
+                    dst,
+                    target === "cellTargeting" &&
+                        (currentTarget === undefined || currentTarget === "cellTargeting")
+                        ? "cellTargeting"
+                        : "nodeTargeting",
+                ]);
+                nextDstToSrc.set(dst, originalSrc);
+            }
+            // Include any existing moves that `change` didn't affect.
+            for (const [src, [dst, target]] of current.srcToDst.entries()) {
+                if (!nextSrcToDst.has(src)) {
+                    const intentionedDst = withIntention(dst);
+                    nextSrcToDst.set(src, [intentionedDst, target]);
+                    nextDstToSrc.set(intentionedDst, src);
+                }
+            }
+            for (const [id, childChange] of change.childChanges) {
+                const intentionedId = withIntention(id);
+                const originalId = current.dstToSrc.get(intentionedId) ?? intentionedId;
+                const existingChanges = childChangesByOriginalId.get(originalId);
+                const taggedChange = tagChange(childChange, revision);
+                if (existingChanges === undefined) {
+                    childChangesByOriginalId.set(originalId, [taggedChange]);
+                }
+                else {
+                    existingChanges.push(taggedChange);
+                }
+            }
+            current.srcToDst = nextSrcToDst;
+            current.dstToSrc = nextDstToSrc;
+        }
+        const composedMoves = [];
+        for (const [src, [dst, target]] of current.srcToDst.entries()) {
+            composedMoves.push([src, dst, target]);
+        }
+        const composed = {
+            moves: composedMoves,
+            childChanges: Array.from(childChangesByOriginalId.entries(), ([id, childChanges]) => [
+                id,
+                composeChild(childChanges),
+            ]),
+        };
+        if (inputContext === "empty") {
+            composed.reservedDetachId = latestReservedDetachId;
+        }
+        return composed;
+    },
+    amendCompose: () => fail("Not implemented"),
+    invert: ({ revision, change }, invertChild, genId) => {
+        const { moves, childChanges } = change;
+        const invertIdMap = new RegisterMap();
+        const withIntention = (id) => {
+            if (id === "self") {
+                return id;
+            }
+            return { revision: id.revision ?? revision, localId: id.localId };
+        };
+        for (const [src, dst] of moves) {
+            invertIdMap.set(src, dst);
+        }
+        let inverseFillsSelf = false;
+        let inverseEmptiesSelf = false;
+        const invertedMoves = [];
+        for (const [src, dst] of moves) {
+            // TODO:AB#6298: This assert can legitimately fail for transactions, meaning we have little test coverage there.
+            assert(src === "self" || dst === "self", 0x856 /* Invert is not currently supported for changes that transfer nodes between non-self registers. */);
+            if (src !== "self" && dst === "self") {
+                inverseEmptiesSelf = true;
+                // TODO:AB#6319: This might lead to a situation where we put a node in a register it never came from, and that register may not be empty.
+                invertedMoves.push([withIntention(dst), withIntention(src), "cellTargeting"]);
+            }
+            else {
+                inverseFillsSelf = true;
+                invertedMoves.push([withIntention(dst), withIntention(src), "nodeTargeting"]);
+            }
+        }
+        const inverted = {
+            moves: invertedMoves,
+            childChanges: childChanges.map(([id, childChange]) => [
+                withIntention(invertIdMap.get(id) ?? id),
+                invertChild(childChange),
+            ]),
+        };
+        if (inverseFillsSelf && !inverseEmptiesSelf) {
+            inverted.reservedDetachId = { localId: genId.getNextId() };
+        }
+        return inverted;
+    },
+    rebase: (change, overTagged, rebaseChild, genId, crossFieldManager, revisionMetadata, existenceState) => {
+        const withIntention = (id) => {
+            if (id === "self") {
+                return id;
+            }
+            const intention = getIntention(id.revision ?? overTagged.revision, revisionMetadata);
+            return { revision: intention, localId: id.localId };
+        };
+        const { moves, childChanges } = change;
+        const { change: overChange } = overTagged;
+        const rebasedMoves = [];
+        const overDstToSrc = new RegisterMap();
+        const overSrcToDst = new RegisterMap();
+        for (const [src, dst] of overChange.moves) {
+            const srcTagged = withIntention(src);
+            const dstTagged = withIntention(dst);
+            overSrcToDst.set(srcTagged, dstTagged);
+            overDstToSrc.set(dstTagged, srcTagged);
+        }
+        let reservedDetachId = change.reservedDetachId;
+        const changeDstToSrc = new RegisterMap();
+        const changeSrcToDst = new RegisterMap();
+        for (const [src, dst] of moves) {
+            changeSrcToDst.set(src, dst);
+            changeDstToSrc.set(dst, src);
+        }
+        for (const [src, dst, target] of moves) {
+            if (target === "cellTargeting") {
+                assert(src === "self", 0x857 /* Cell targeting moves must have self as a source */);
+                // TODO: Should we drop cell targeting / node targeting and just special-case 'self'? Might be simpler to understand.
+                // Holding off on making a call until AB#6298 is addressed (possibly support for rebasing transactions makes the
+                // answer to this more obvious).
+                if (overSrcToDst.get(src) !== undefined &&
+                    overDstToSrc.get(src) === undefined &&
+                    reservedDetachId === undefined) {
+                    // Over removed the content occupying this cell and didn't fill it with other content.
+                    // This change includes field changes,
+                    reservedDetachId = dst;
+                }
+                else {
+                    // Cell-targeting.
+                    rebasedMoves.push([src, dst, target]);
+                }
+            }
+            else {
+                // Figure out where content in src ended up in `overTagged`
+                const rebasedSrc = overSrcToDst.get(src) ?? src;
+                // Note: we cannot drop changes which map a node to itself, as this loses the intention of the original edit
+                // (since the target kind is node targeting, it may not still map to a noop after further rebases)
+                rebasedMoves.push([rebasedSrc, dst, target]);
+            }
+        }
+        // We rebased a fill from an empty state over another edit which also sets this field.
+        // We need to make sure that we also empty the field.
+        const overFillsEmptyField = !overSrcToDst.has("self") && overDstToSrc.has("self");
+        if (overFillsEmptyField && reservedDetachId !== undefined) {
+            rebasedMoves.push(["self", reservedDetachId, "cellTargeting"]);
+            reservedDetachId = undefined;
+        }
+        const overChildChangesBySrc = new RegisterMap();
+        for (const [id, childChange] of overChange.childChanges ?? []) {
+            overChildChangesBySrc.set(withIntention(id) ?? id, childChange);
+        }
+        const rebasedChildChanges = [];
+        for (const [id, childChange] of childChanges) {
+            const overChildChange = overChildChangesBySrc.get(id);
+            const rebasedId = overSrcToDst.get(id) ?? id;
+            const rebasedChildChange = rebaseChild(childChange, overChildChange, rebasedId === "self" ? NodeExistenceState.Alive : NodeExistenceState.Dead);
+            if (rebasedChildChange !== undefined) {
+                rebasedChildChanges.push([rebasedId, rebasedChildChange]);
+            }
+        }
+        const rebased = {
+            moves: rebasedMoves,
+            childChanges: rebasedChildChanges,
+        };
+        if (reservedDetachId !== undefined) {
+            rebased.reservedDetachId = reservedDetachId;
+        }
+        return rebased;
+    },
+    prune: (change, pruneChild) => {
+        const childChanges = [];
+        const prunedChange = {
+            moves: change.moves,
+            childChanges,
+        };
+        if (change.reservedDetachId !== undefined) {
+            prunedChange.reservedDetachId = change.reservedDetachId;
+        }
+        for (const [id, childChange] of change.childChanges) {
+            const prunedChildChange = pruneChild(childChange);
+            if (prunedChildChange !== undefined) {
+                prunedChange.childChanges.push([id, prunedChildChange]);
+            }
+        }
+        return prunedChange;
+    },
+};
+export const optionalFieldEditor = {
+    set: (wasEmpty, ids) => {
+        const result = {
+            moves: [[{ localId: ids.fill }, "self", "nodeTargeting"]],
+            childChanges: [],
+        };
+        if (wasEmpty) {
+            result.reservedDetachId = { localId: ids.detach };
+        }
+        else {
+            result.moves.push(["self", { localId: ids.detach }, "cellTargeting"]);
+        }
+        return result;
+    },
+    clear: (wasEmpty, detachId) => wasEmpty
+        ? { moves: [], childChanges: [], reservedDetachId: { localId: detachId } }
+        : {
+            moves: [["self", { localId: detachId }, "cellTargeting"]],
+            childChanges: [],
+        },
+    buildChildChange: (index, childChange) => {
+        assert(index === 0, 0x404 /* Optional fields only support a single child node */);
+        return {
+            moves: [],
+            childChanges: [["self", childChange]],
+        };
+    },
+};
+export function optionalFieldIntoDelta({ change, revision }, deltaFromChild) {
+    const delta = {};
+    let markIsANoop = true;
+    const mark = { count: 1 };
+    if (change.moves.length > 0) {
+        const renames = [];
+        for (const [src, dst] of change.moves) {
+            if (src === "self" && dst !== "self") {
+                mark.detach = { major: dst.revision ?? revision, minor: dst.localId };
+                markIsANoop = false;
+            }
+            else if (dst === "self" && src !== "self") {
+                mark.attach = { major: src.revision ?? revision, minor: src.localId };
+                markIsANoop = false;
+            }
+            else if (src !== "self" && dst !== "self") {
+                renames.push({
+                    count: 1,
+                    oldId: { major: src.revision ?? revision, minor: src.localId },
+                    newId: { major: dst.revision ?? revision, minor: dst.localId },
+                });
+            }
+        }
+        if (renames.length > 0) {
+            delta.rename = renames;
+        }
+    }
+    if (change.childChanges.length > 0) {
+        const globals = [];
+        for (const [id, childChange] of change.childChanges) {
+            const childDelta = deltaFromChild(childChange);
+            if (id !== "self") {
+                const fields = childDelta;
+                globals.push({
+                    id: { major: id.revision ?? revision, minor: id.localId },
+                    fields,
+                });
+            }
+            else {
+                mark.fields = childDelta;
+                markIsANoop = false;
+            }
+        }
+        if (globals.length > 0) {
+            delta.global = globals;
+        }
+    }
+    if (!markIsANoop) {
+        delta.local = [mark];
+    }
+    return delta;
+}
+export const optionalChangeHandler = {
+    rebaser: optionalChangeRebaser,
+    codecsFactory: makeOptionalFieldCodecFamily,
+    editor: optionalFieldEditor,
+    intoDelta: optionalFieldIntoDelta,
+    relevantRemovedRoots,
+    isEmpty: (change) => change.childChanges.length === 0 && change.moves.length === 0,
+};
+function areEqualRegisterIds(a, b) {
+    if (typeof a === "string" || typeof b === "string") {
+        return a === b;
+    }
+    return areEqualChangeAtomIds(a, b);
+}
+function* relevantRemovedRoots({ change, revision }, relevantRemovedRootsFromChild) {
+    const alreadyYielded = new RegisterMap();
+    for (const [src] of change.moves) {
+        if (src !== "self" && !alreadyYielded.has(src)) {
+            alreadyYielded.set(src, true);
+            yield nodeIdFromChangeAtom(src, revision);
+        }
+    }
+    for (const [id, childChange] of change.childChanges) {
+        // Child changes make the tree they apply to relevant unless that tree existed in the starting context of
+        // of this change.
+        if (id !== "self" && !alreadyYielded.has(id)) {
+            alreadyYielded.set(id, true);
+            yield nodeIdFromChangeAtom(id);
+        }
+        yield* relevantRemovedRootsFromChild(childChange);
+    }
+}
+//# sourceMappingURL=optionalField.js.map

package/lib/feature-libraries/optional-field/optionalField.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"optionalField.js","sourceRoot":"","sources":["../../../src/feature-libraries/optional-field/optionalField.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACpD,OAAO,EAEN,SAAS,EAGT,qBAAqB,GAOrB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,IAAI,EAAwB,cAAc,EAAE,MAAM,YAAY,CAAC;AACxE,OAAO,EASN,YAAY,EACZ,kBAAkB,GAIlB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAErD,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AAYrE,MAAM,WAAW;IAAjB;QACkB,kBAAa,GAAG,IAAI,cAAc,EAIhD,CAAC;IAgFL,CAAC;IA9EO,KAAK;QACX,MAAM,KAAK,GAAG,IAAI,WAAW,EAAK,CAAC;QACnC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YACrC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SACjB;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,GAAG,CAAC,EAAc,EAAE,WAAc;QACxC,IAAI,EAAE,KAAK,MAAM,EAAE;YAClB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;SACvD;aAAM;YACN,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;SAC7D;IACF,CAAC;IAEM,GAAG,CAAC,EAAc;QACxB,OAAO,EAAE,KAAK,MAAM;YACnB,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC;YAC1C,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAEM,GAAG,CAAC,EAAc;QACxB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC;IACnC,CAAC;IAEM,MAAM,CAAC,EAAc;QAC3B,OAAO,EAAE,KAAK,MAAM;YACnB,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC;YAC9C,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAEM,IAAI;QACV,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE;YACtD,IAAI,OAAO,KAAK,MAAM,EAAE;gBACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACvB;iBAAM;gBACN,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE;oBACzC,SAAS,CAAC,IAAI,CACb,WAAW,KAAK,SAAS;wBACxB,CAAC,CAAC,EAAE,OAAO,EAAE;wBACb,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,CACrC,CAAC;iBACF;aACD;SACD;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IACM,MAAM;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;IACpC,CAAC;IACM,OAAO;QACb,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE;YACnC,IAAI,QAAQ,KAAK,MAAM,EAAE;gBACxB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC3D,MAAM,CACL,KAAK,KAAK,SAAS,EACnB,KAAK,CAAC,wDAAwD,CAC9D,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;aAC9B;iBAAM;gBACN,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;gBAC7E,MAAM,CACL,KAAK,KAAK,SAAS,EACnB,KAAK,CAAC,wDAAwD,CAC9D,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;aAChC;SACD;QAED,OAAO,OAAO,CAAC;IAChB,CAAC;IACD,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;IAChC,CAAC;CACD;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,MAAyB;IACtD,IAAI,MAAM,CAAC,gBAAgB,KAAK,SAAS,EAAE;QAC1C,OAAO,OAAO,CAAC;KACf;IAED,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE;QACjC,IAAI,GAAG,KAAK,MAAM,EAAE;YACnB,OAAO,QAAQ,CAAC;SAChB;KACD;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,CAAC,MAAM,qBAAqB,GAA0C;IAC3E,OAAO,EAAE,CACR,OAA0C,EAC1C,YAAgC,EAChC,KAAkB,EAClB,iBAAoC,EACpC,gBAAwC,EACpB,EAAE;QACtB,MAAM,oBAAoB,GAAG,CAC5B,KAAiC,EAIhC,EAAE;YACH,MAAM,QAAQ,GAAG,IAAI,WAAW,EAE7B,CAAC;YACJ,MAAM,QAAQ,GAAG,IAAI,WAAW,EAAc,CAAC;YAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE;gBACvC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;gBACjC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aACvB;YACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;QAC/B,CAAC,CAAC;QAEF,IAAI,sBAA8C,CAAC;QACnD,IAAI,YAA4C,CAAC;QAEjD,MAAM,wBAAwB,GAAG,IAAI,WAAW,EAAiC,CAAC;QAClF,oFAAoF;QACpF,+GAA+G;QAC/G,gFAAgF;QAChF,MAAM,OAAO,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;QACzC,KAAK,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,OAAO,EAAE;YAC3C,YAAY,KAAZ,YAAY,GAAK,oBAAoB,CAAC,MAAM,CAAC,EAAC;YAC9C,MAAM,aAAa,GAAG,CAAC,EAAc,EAAc,EAAE;gBACpD,IAAI,EAAE,KAAK,MAAM,EAAE;oBAClB,OAAO,EAAE,CAAC;iBACV;gBACD,MAAM,SAAS,GAAG,YAAY,CAAC,EAAE,CAAC,QAAQ,IAAI,QAAQ,EAAE,gBAAgB,CAAC,CAAC;gBAC1E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,CAAC;YAEF,MAAM,YAAY,GAAG,IAAI,WAAW,EAEjC,CAAC;YACJ,MAAM,YAAY,GAAG,IAAI,WAAW,EAAc,CAAC;YAEnD,IAAI,MAAM,CAAC,gBAAgB,KAAK,SAAS,EAAE;gBAC1C,sBAAsB,GAAG,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;aAChE;YAED,8CAA8C;YAC9C,KAAK,MAAM,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE;gBACxE,MAAM,GAAG,GAAG,aAAa,CAAC,gBAAgB,CAAC,CAAC;gBAC5C,MAAM,GAAG,GAAG,aAAa,CAAC,gBAAgB,CAAC,CAAC;gBAC5C,IAAI,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5C,IAAI,aAA4D,CAAC;gBACjE,IAAI,WAAW,KAAK,SAAS,EAAE;oBAC9B,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,GAC3B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,2BAA2B,CAAC,CAAC;oBACxE,MAAM,CACL,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,EAC9B,KAAK,CAAC,0CAA0C,CAChD,CAAC;oBACF,aAAa,GAAG,cAAc,CAAC;iBAC/B;qBAAM;oBACN,WAAW,GAAG,GAAG,CAAC;iBAClB;gBACD,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE;oBAC7B,GAAG;oBACH,MAAM,KAAK,eAAe;wBAC1B,CAAC,aAAa,KAAK,SAAS,IAAI,aAAa,KAAK,eAAe,CAAC;wBACjE,CAAC,CAAC,eAAe;wBACjB,CAAC,CAAC,eAAe;iBAClB,CAAC,CAAC;gBACH,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;aACnC;YAED,0DAA0D;YAC1D,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;gBAC9D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;oBAC3B,MAAM,cAAc,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;oBAC1C,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC;oBAChD,YAAY,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;iBACtC;aACD;YAED,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE;gBACpD,MAAM,aAAa,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;gBACxC,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC;gBACxE,MAAM,eAAe,GAAG,wBAAwB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBACjE,MAAM,YAAY,GAAG,SAAS,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;gBACtD,IAAI,eAAe,KAAK,SAAS,EAAE;oBAClC,wBAAwB,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;iBACzD;qBAAM;oBACN,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;iBACnC;aACD;YAED,OAAO,CAAC,QAAQ,GAAG,YAAY,CAAC;YAChC,OAAO,CAAC,QAAQ,GAAG,YAAY,CAAC;SAChC;QAED,MAAM,aAAa,GAA+B,EAAE,CAAC;QACrD,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;YAC9D,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;SACvC;QAED,MAAM,QAAQ,GAAsB;YACnC,KAAK,EAAE,aAAa;YACpB,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,EAAE,EAAE,CAAC;gBACpF,EAAE;gBACF,YAAY,CAAC,YAAY,CAAC;aAC1B,CAAC;SACF,CAAC;QAEF,IAAI,YAAY,KAAK,OAAO,EAAE;YAC7B,QAAQ,CAAC,gBAAgB,GAAG,sBAAsB,CAAC;SACnD;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,YAAY,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC;IAE3C,MAAM,EAAE,CACP,EAAE,QAAQ,EAAE,MAAM,EAAmC,EACrD,WAA+B,EAC/B,KAAoC,EAChB,EAAE;QACtB,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;QACvC,MAAM,WAAW,GAAG,IAAI,WAAW,EAAc,CAAC;QAClD,MAAM,aAAa,GAAG,CAAC,EAAc,EAAc,EAAE;YACpD,IAAI,EAAE,KAAK,MAAM,EAAE;gBAClB,OAAO,EAAE,CAAC;aACV;YACD,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,QAAQ,IAAI,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC;QACnE,CAAC,CAAC;QACF,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE;YAC/B,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SAC1B;QAED,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAC/B,MAAM,aAAa,GAAwB,EAAE,CAAC;QAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE;YAC/B,gHAAgH;YAChH,MAAM,CACL,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,EAChC,KAAK,CAAC,mGAAmG,CACzG,CAAC;YACF,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,EAAE;gBACrC,kBAAkB,GAAG,IAAI,CAAC;gBAC1B,yIAAyI;gBACzI,aAAa,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;aAC9E;iBAAM;gBACN,gBAAgB,GAAG,IAAI,CAAC;gBACxB,aAAa,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;aAC9E;SACD;QACD,MAAM,QAAQ,GAAsB;YACnC,KAAK,EAAE,aAAa;YACpB,YAAY,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,EAAE,CAAC;gBACrD,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;gBACxC,WAAW,CAAC,WAAW,CAAC;aACxB,CAAC;SACF,CAAC;QAEF,IAAI,gBAAgB,IAAI,CAAC,kBAAkB,EAAE;YAC5C,QAAQ,CAAC,gBAAgB,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;SAC3D;QACD,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,MAAM,EAAE,CACP,MAAyB,EACzB,UAA2C,EAC3C,WAA8B,EAC9B,KAAkB,EAClB,iBAAoC,EACpC,gBAAwC,EACxC,cAAmC,EACf,EAAE;QACtB,MAAM,aAAa,GAAG,CAAC,EAAc,EAAc,EAAE;YACpD,IAAI,EAAE,KAAK,MAAM,EAAE;gBAClB,OAAO,EAAE,CAAC;aACV;YACD,MAAM,SAAS,GAAG,YAAY,CAAC,EAAE,CAAC,QAAQ,IAAI,UAAU,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YACrF,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC;QACrD,CAAC,CAAC;QAEF,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;QACvC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,UAAU,CAAC;QAC1C,MAAM,YAAY,GAAiB,EAAE,CAAC;QAEtC,MAAM,YAAY,GAAG,IAAI,WAAW,EAAc,CAAC;QACnD,MAAM,YAAY,GAAG,IAAI,WAAW,EAAc,CAAC;QACnD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,UAAU,CAAC,KAAK,EAAE;YAC1C,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACrC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACvC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;SACvC;QAED,IAAI,gBAAgB,GAA2B,MAAM,CAAC,gBAAgB,CAAC;QACvE,MAAM,cAAc,GAAG,IAAI,WAAW,EAAc,CAAC;QACrD,MAAM,cAAc,GAAG,IAAI,WAAW,EAAc,CAAC;QACrD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE;YAC/B,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7B,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SAC7B;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE;YACvC,IAAI,MAAM,KAAK,eAAe,EAAE;gBAC/B,MAAM,CAAC,GAAG,KAAK,MAAM,EAAE,KAAK,CAAC,qDAAqD,CAAC,CAAC;gBACpF,qHAAqH;gBACrH,gHAAgH;gBAChH,gCAAgC;gBAChC,IACC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;oBACnC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;oBACnC,gBAAgB,KAAK,SAAS,EAC7B;oBACD,sFAAsF;oBACtF,sCAAsC;oBACtC,gBAAgB,GAAG,GAAG,CAAC;iBACvB;qBAAM;oBACN,kBAAkB;oBAClB,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;iBACtC;aACD;iBAAM;gBACN,2DAA2D;gBAC3D,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;gBAChD,4GAA4G;gBAC5G,kGAAkG;gBAClG,YAAY,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;aAC7C;SACD;QAED,sFAAsF;QACtF,qDAAqD;QACrD,MAAM,mBAAmB,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClF,IAAI,mBAAmB,IAAI,gBAAgB,KAAK,SAAS,EAAE;YAC1D,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,gBAAgB,EAAE,eAAe,CAAC,CAAC,CAAC;YAC/D,gBAAgB,GAAG,SAAS,CAAC;SAC7B;QAED,MAAM,qBAAqB,GAAG,IAAI,WAAW,EAAiB,CAAC;QAC/D,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,UAAU,CAAC,YAAY,IAAI,EAAE,EAAE;YAC9D,qBAAqB,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,WAAW,CAAC,CAAC;SAChE;QAED,MAAM,mBAAmB,GAAwB,EAAE,CAAC;QACpD,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,YAAY,EAAE;YAC7C,MAAM,eAAe,GAAG,qBAAqB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEtD,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC7C,MAAM,kBAAkB,GAAG,WAAW,CACrC,WAAW,EACX,eAAe,EACf,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CACzE,CAAC;YACF,IAAI,kBAAkB,KAAK,SAAS,EAAE;gBACrC,mBAAmB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC,CAAC;aAC1D;SACD;QAED,MAAM,OAAO,GAAsB;YAClC,KAAK,EAAE,YAAY;YACnB,YAAY,EAAE,mBAAmB;SACjC,CAAC;QACF,IAAI,gBAAgB,KAAK,SAAS,EAAE;YACnC,OAAO,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;SAC5C;QACD,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,KAAK,EAAE,CAAC,MAAyB,EAAE,UAA4B,EAAqB,EAAE;QACrF,MAAM,YAAY,GAAsC,EAAE,CAAC;QAC3D,MAAM,YAAY,GAAsB;YACvC,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,YAAY;SACZ,CAAC;QACF,IAAI,MAAM,CAAC,gBAAgB,KAAK,SAAS,EAAE;YAC1C,YAAY,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC;SACxD;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE;YACpD,MAAM,iBAAiB,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,iBAAiB,KAAK,SAAS,EAAE;gBACpC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC,CAAC;aACxD;SACD;QAED,OAAO,YAAY,CAAC;IACrB,CAAC;CACD,CAAC;AA0BF,MAAM,CAAC,MAAM,mBAAmB,GAAwB;IACvD,GAAG,EAAE,CACJ,QAAiB,EACjB,GAIC,EACmB,EAAE;QACtB,MAAM,MAAM,GAAsB;YACjC,KAAK,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;YACzD,YAAY,EAAE,EAAE;SAChB,CAAC;QACF,IAAI,QAAQ,EAAE;YACb,MAAM,CAAC,gBAAgB,GAAG,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC;SAClD;aAAM;YACN,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC;SACtE;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED,KAAK,EAAE,CAAC,QAAiB,EAAE,QAA0B,EAAqB,EAAE,CAC3E,QAAQ;QACP,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE;QAC1E,CAAC,CAAC;YACA,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,eAAe,CAAC,CAAC;YACzD,YAAY,EAAE,EAAE;SACf;IAEL,gBAAgB,EAAE,CAAC,KAAa,EAAE,WAA0B,EAAqB,EAAE;QAClF,MAAM,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAClF,OAAO;YACN,KAAK,EAAE,EAAE;YACT,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;SACrC,CAAC;IACH,CAAC;CACD,CAAC;AAEF,MAAM,UAAU,sBAAsB,CACrC,EAAE,MAAM,EAAE,QAAQ,EAAmC,EACrD,cAAuB;IAEvB,MAAM,KAAK,GAA+B,EAAE,CAAC;IAE7C,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,MAAM,IAAI,GAAuB,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAE9C,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;QAC5B,MAAM,OAAO,GAA8B,EAAE,CAAC;QAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE;YACtC,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,EAAE;gBACrC,IAAI,CAAC,MAAM,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,IAAI,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC;gBACtE,WAAW,GAAG,KAAK,CAAC;aACpB;iBAAM,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,EAAE;gBAC5C,IAAI,CAAC,MAAM,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,IAAI,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC;gBACtE,WAAW,GAAG,KAAK,CAAC;aACpB;iBAAM,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,EAAE;gBAC5C,OAAO,CAAC,IAAI,CAAC;oBACZ,KAAK,EAAE,CAAC;oBACR,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,IAAI,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE;oBAC9D,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,IAAI,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE;iBAC9D,CAAC,CAAC;aACH;SACD;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC;SACvB;KACD;IAED,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;QACnC,MAAM,OAAO,GAA+B,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE;YACpD,MAAM,UAAU,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;YAC/C,IAAI,EAAE,KAAK,MAAM,EAAE;gBAClB,MAAM,MAAM,GAAG,UAAU,CAAC;gBAC1B,OAAO,CAAC,IAAI,CAAC;oBACZ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,QAAQ,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE;oBACzD,MAAM;iBACN,CAAC,CAAC;aACH;iBAAM;gBACN,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;gBACzB,WAAW,GAAG,KAAK,CAAC;aACpB;SACD;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC;SACvB;KACD;IAED,IAAI,CAAC,WAAW,EAAE;QACjB,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;KACrB;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,CAAC,MAAM,qBAAqB,GAA+D;IAChG,OAAO,EAAE,qBAAqB;IAC9B,aAAa,EAAE,4BAA4B;IAC3C,MAAM,EAAE,mBAAmB;IAE3B,SAAS,EAAE,sBAAsB;IACjC,oBAAoB;IAEpB,OAAO,EAAE,CAAC,MAAyB,EAAE,EAAE,CACtC,MAAM,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;CAC9D,CAAC;AAEF,SAAS,mBAAmB,CAAC,CAAa,EAAE,CAAa;IACxD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;QACnD,OAAO,CAAC,KAAK,CAAC,CAAC;KACf;IAED,OAAO,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,QAAQ,CAAC,CAAC,oBAAoB,CAC7B,EAAE,MAAM,EAAE,QAAQ,EAAmC,EACrD,6BAA4D;IAE5D,MAAM,cAAc,GAAG,IAAI,WAAW,EAAW,CAAC;IAElD,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE;QACjC,IAAI,GAAG,KAAK,MAAM,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YAC/C,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC9B,MAAM,oBAAoB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;SAC1C;KACD;IAED,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE;QACpD,yGAAyG;QACzG,kBAAkB;QAClB,IAAI,EAAE,KAAK,MAAM,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC7C,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC7B,MAAM,oBAAoB,CAAC,EAAE,CAAC,CAAC;SAC/B;QACD,KAAK,CAAC,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;KAClD;AACF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport {\n\tTaggedChange,\n\ttagChange,\n\tChangesetLocalId,\n\tRevisionTag,\n\tareEqualChangeAtomIds,\n\tRevisionMetadataSource,\n\tDeltaFieldChanges,\n\tDeltaDetachedNodeRename,\n\tDeltaMark,\n\tDeltaDetachedNodeId,\n\tDeltaDetachedNodeChanges,\n} from \"../../core\";\nimport { fail, Mutable, IdAllocator, SizedNestedMap } from \"../../util\";\nimport {\n\tToDelta,\n\tFieldChangeRebaser,\n\tNodeChangeComposer,\n\tNodeChangeInverter,\n\tNodeChangeRebaser,\n\tNodeChangeset,\n\tFieldEditor,\n\tCrossFieldManager,\n\tgetIntention,\n\tNodeExistenceState,\n\tFieldChangeHandler,\n\tRelevantRemovedRootsFromChild,\n\tNodeChangePruner,\n} from \"../modular-schema\";\nimport { nodeIdFromChangeAtom } from \"../deltaUtils\";\nimport { RegisterId, OptionalChangeset } from \"./optionalFieldChangeTypes\";\nimport { makeOptionalFieldCodecFamily } from \"./optionalFieldCodecs\";\n\ninterface IRegisterMap<T> {\n\tset(id: RegisterId, childChange: T): void;\n\tget(id: RegisterId): T | undefined;\n\tdelete(id: RegisterId): boolean;\n\tkeys(): Iterable<RegisterId>;\n\tvalues(): Iterable<T>;\n\tentries(): Iterable<[RegisterId, T]>;\n\treadonly size: number;\n}\n\nclass RegisterMap<T> implements IRegisterMap<T> {\n\tprivate readonly nestedMapData = new SizedNestedMap<\n\t\tChangesetLocalId | \"self\",\n\t\tRevisionTag | undefined,\n\t\tT\n\t>();\n\n\tpublic clone(): RegisterMap<T> {\n\t\tconst clone = new RegisterMap<T>();\n\t\tfor (const [id, t] of this.entries()) {\n\t\t\tclone.set(id, t);\n\t\t}\n\t\treturn clone;\n\t}\n\n\tpublic set(id: RegisterId, childChange: T): void {\n\t\tif (id === \"self\") {\n\t\t\tthis.nestedMapData.set(\"self\", undefined, childChange);\n\t\t} else {\n\t\t\tthis.nestedMapData.set(id.localId, id.revision, childChange);\n\t\t}\n\t}\n\n\tpublic get(id: RegisterId): T | undefined {\n\t\treturn id === \"self\"\n\t\t\t? this.nestedMapData.tryGet(id, undefined)\n\t\t\t: this.nestedMapData.tryGet(id.localId, id.revision);\n\t}\n\n\tpublic has(id: RegisterId): boolean {\n\t\treturn this.get(id) !== undefined;\n\t}\n\n\tpublic delete(id: RegisterId): boolean {\n\t\treturn id === \"self\"\n\t\t\t? this.nestedMapData.delete(\"self\", undefined)\n\t\t\t: this.nestedMapData.delete(id.localId, id.revision);\n\t}\n\n\tpublic keys(): Iterable<RegisterId> {\n\t\tconst changeIds: RegisterId[] = [];\n\t\tfor (const [localId, nestedMap] of this.nestedMapData) {\n\t\t\tif (localId === \"self\") {\n\t\t\t\tchangeIds.push(\"self\");\n\t\t\t} else {\n\t\t\t\tfor (const [revisionTag, _] of nestedMap) {\n\t\t\t\t\tchangeIds.push(\n\t\t\t\t\t\trevisionTag === undefined\n\t\t\t\t\t\t\t? { localId }\n\t\t\t\t\t\t\t: { localId, revision: revisionTag },\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn changeIds;\n\t}\n\tpublic values(): Iterable<T> {\n\t\treturn this.nestedMapData.values();\n\t}\n\tpublic entries(): Iterable<[RegisterId, T]> {\n\t\tconst entries: [RegisterId, T][] = [];\n\t\tfor (const changeId of this.keys()) {\n\t\t\tif (changeId === \"self\") {\n\t\t\t\tconst entry = this.nestedMapData.tryGet(\"self\", undefined);\n\t\t\t\tassert(\n\t\t\t\t\tentry !== undefined,\n\t\t\t\t\t0x770 /* Entry should not be undefined when iterating keys. */,\n\t\t\t\t);\n\t\t\t\tentries.push([\"self\", entry]);\n\t\t\t} else {\n\t\t\t\tconst entry = this.nestedMapData.tryGet(changeId.localId, changeId.revision);\n\t\t\t\tassert(\n\t\t\t\t\tentry !== undefined,\n\t\t\t\t\t0x771 /* Entry should not be undefined when iterating keys. */,\n\t\t\t\t);\n\t\t\t\tentries.push([changeId, entry]);\n\t\t\t}\n\t\t}\n\n\t\treturn entries;\n\t}\n\tpublic get size(): number {\n\t\treturn this.nestedMapData.size;\n\t}\n}\n\n/**\n * Attempt to deduce whether the \"self\" register of a change is empty or filled in the input context.\n * Optional changesets do not always carry enough information to determine this, in which case this\n * returns `undefined`.\n */\nfunction tryInferInputContext(change: OptionalChangeset): \"empty\" | \"filled\" | undefined {\n\tif (change.reservedDetachId !== undefined) {\n\t\treturn \"empty\";\n\t}\n\n\tfor (const [src] of change.moves) {\n\t\tif (src === \"self\") {\n\t\t\treturn \"filled\";\n\t\t}\n\t}\n\n\treturn undefined;\n}\n\nexport const optionalChangeRebaser: FieldChangeRebaser<OptionalChangeset> = {\n\tcompose: (\n\t\tchanges: TaggedChange<OptionalChangeset>[],\n\t\tcomposeChild: NodeChangeComposer,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldManager: CrossFieldManager,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): OptionalChangeset => {\n\t\tconst getBidirectionalMaps = (\n\t\t\tmoves: OptionalChangeset[\"moves\"],\n\t\t): {\n\t\t\tsrcToDst: RegisterMap<[dst: RegisterId, target: \"nodeTargeting\" | \"cellTargeting\"]>;\n\t\t\tdstToSrc: RegisterMap<RegisterId>;\n\t\t} => {\n\t\t\tconst srcToDst = new RegisterMap<\n\t\t\t\t[dst: RegisterId, target: \"nodeTargeting\" | \"cellTargeting\"]\n\t\t\t>();\n\t\t\tconst dstToSrc = new RegisterMap<RegisterId>();\n\t\t\tfor (const [src, dst, target] of moves) {\n\t\t\t\tsrcToDst.set(src, [dst, target]);\n\t\t\t\tdstToSrc.set(dst, src);\n\t\t\t}\n\t\t\treturn { srcToDst, dstToSrc };\n\t\t};\n\n\t\tlet latestReservedDetachId: RegisterId | undefined;\n\t\tlet inputContext: \"empty\" | \"filled\" | undefined;\n\n\t\tconst childChangesByOriginalId = new RegisterMap<TaggedChange<NodeChangeset>[]>();\n\t\t// TODO: It might be possible to compose moves in place rather than repeatedly copy.\n\t\t// Additionally, working out a 'register allocation' strategy which enables frequent cancellation of noop moves\n\t\t// for sandwich rebases would help with cloning if in-place proves too difficult\n\t\tconst current = getBidirectionalMaps([]);\n\t\tfor (const { change, revision } of changes) {\n\t\t\tinputContext ??= tryInferInputContext(change);\n\t\t\tconst withIntention = (id: RegisterId): RegisterId => {\n\t\t\t\tif (id === \"self\") {\n\t\t\t\t\treturn id;\n\t\t\t\t}\n\t\t\t\tconst intention = getIntention(id.revision ?? revision, revisionMetadata);\n\t\t\t\treturn { revision: intention, localId: id.localId };\n\t\t\t};\n\n\t\t\tconst nextSrcToDst = new RegisterMap<\n\t\t\t\t[dst: RegisterId, target: \"nodeTargeting\" | \"cellTargeting\"]\n\t\t\t>();\n\t\t\tconst nextDstToSrc = new RegisterMap<RegisterId>();\n\n\t\t\tif (change.reservedDetachId !== undefined) {\n\t\t\t\tlatestReservedDetachId = withIntention(change.reservedDetachId);\n\t\t\t}\n\n\t\t\t// Compose all the things that `change` moved.\n\t\t\tfor (const [unintentionedSrc, unintentionedDst, target] of change.moves) {\n\t\t\t\tconst src = withIntention(unintentionedSrc);\n\t\t\t\tconst dst = withIntention(unintentionedDst);\n\t\t\t\tlet originalSrc = current.dstToSrc.get(src);\n\t\t\t\tlet currentTarget: \"cellTargeting\" | \"nodeTargeting\" | undefined;\n\t\t\t\tif (originalSrc !== undefined) {\n\t\t\t\t\tconst [dst2, existingTarget] =\n\t\t\t\t\t\tcurrent.srcToDst.get(originalSrc) ?? fail(\"expected backward mapping\");\n\t\t\t\t\tassert(\n\t\t\t\t\t\tareEqualRegisterIds(dst2, src),\n\t\t\t\t\t\t0x855 /* expected consistent backward mapping */,\n\t\t\t\t\t);\n\t\t\t\t\tcurrentTarget = existingTarget;\n\t\t\t\t} else {\n\t\t\t\t\toriginalSrc = src;\n\t\t\t\t}\n\t\t\t\tnextSrcToDst.set(originalSrc, [\n\t\t\t\t\tdst,\n\t\t\t\t\ttarget === \"cellTargeting\" &&\n\t\t\t\t\t(currentTarget === undefined || currentTarget === \"cellTargeting\")\n\t\t\t\t\t\t? \"cellTargeting\"\n\t\t\t\t\t\t: \"nodeTargeting\",\n\t\t\t\t]);\n\t\t\t\tnextDstToSrc.set(dst, originalSrc);\n\t\t\t}\n\n\t\t\t// Include any existing moves that `change` didn't affect.\n\t\t\tfor (const [src, [dst, target]] of current.srcToDst.entries()) {\n\t\t\t\tif (!nextSrcToDst.has(src)) {\n\t\t\t\t\tconst intentionedDst = withIntention(dst);\n\t\t\t\t\tnextSrcToDst.set(src, [intentionedDst, target]);\n\t\t\t\t\tnextDstToSrc.set(intentionedDst, src);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (const [id, childChange] of change.childChanges) {\n\t\t\t\tconst intentionedId = withIntention(id);\n\t\t\t\tconst originalId = current.dstToSrc.get(intentionedId) ?? intentionedId;\n\t\t\t\tconst existingChanges = childChangesByOriginalId.get(originalId);\n\t\t\t\tconst taggedChange = tagChange(childChange, revision);\n\t\t\t\tif (existingChanges === undefined) {\n\t\t\t\t\tchildChangesByOriginalId.set(originalId, [taggedChange]);\n\t\t\t\t} else {\n\t\t\t\t\texistingChanges.push(taggedChange);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcurrent.srcToDst = nextSrcToDst;\n\t\t\tcurrent.dstToSrc = nextDstToSrc;\n\t\t}\n\n\t\tconst composedMoves: OptionalChangeset[\"moves\"] = [];\n\t\tfor (const [src, [dst, target]] of current.srcToDst.entries()) {\n\t\t\tcomposedMoves.push([src, dst, target]);\n\t\t}\n\n\t\tconst composed: OptionalChangeset = {\n\t\t\tmoves: composedMoves,\n\t\t\tchildChanges: Array.from(childChangesByOriginalId.entries(), ([id, childChanges]) => [\n\t\t\t\tid,\n\t\t\t\tcomposeChild(childChanges),\n\t\t\t]),\n\t\t};\n\n\t\tif (inputContext === \"empty\") {\n\t\t\tcomposed.reservedDetachId = latestReservedDetachId;\n\t\t}\n\n\t\treturn composed;\n\t},\n\n\tamendCompose: () => fail(\"Not implemented\"),\n\n\tinvert: (\n\t\t{ revision, change }: TaggedChange<OptionalChangeset>,\n\t\tinvertChild: NodeChangeInverter,\n\t\tgenId: IdAllocator<ChangesetLocalId>,\n\t): OptionalChangeset => {\n\t\tconst { moves, childChanges } = change;\n\t\tconst invertIdMap = new RegisterMap<RegisterId>();\n\t\tconst withIntention = (id: RegisterId): RegisterId => {\n\t\t\tif (id === \"self\") {\n\t\t\t\treturn id;\n\t\t\t}\n\t\t\treturn { revision: id.revision ?? revision, localId: id.localId };\n\t\t};\n\t\tfor (const [src, dst] of moves) {\n\t\t\tinvertIdMap.set(src, dst);\n\t\t}\n\n\t\tlet inverseFillsSelf = false;\n\t\tlet inverseEmptiesSelf = false;\n\t\tconst invertedMoves: typeof change.moves = [];\n\t\tfor (const [src, dst] of moves) {\n\t\t\t// TODO:AB#6298: This assert can legitimately fail for transactions, meaning we have little test coverage there.\n\t\t\tassert(\n\t\t\t\tsrc === \"self\" || dst === \"self\",\n\t\t\t\t0x856 /* Invert is not currently supported for changes that transfer nodes between non-self registers. */,\n\t\t\t);\n\t\t\tif (src !== \"self\" && dst === \"self\") {\n\t\t\t\tinverseEmptiesSelf = true;\n\t\t\t\t// TODO:AB#6319: This might lead to a situation where we put a node in a register it never came from, and that register may not be empty.\n\t\t\t\tinvertedMoves.push([withIntention(dst), withIntention(src), \"cellTargeting\"]);\n\t\t\t} else {\n\t\t\t\tinverseFillsSelf = true;\n\t\t\t\tinvertedMoves.push([withIntention(dst), withIntention(src), \"nodeTargeting\"]);\n\t\t\t}\n\t\t}\n\t\tconst inverted: OptionalChangeset = {\n\t\t\tmoves: invertedMoves,\n\t\t\tchildChanges: childChanges.map(([id, childChange]) => [\n\t\t\t\twithIntention(invertIdMap.get(id) ?? id),\n\t\t\t\tinvertChild(childChange),\n\t\t\t]),\n\t\t};\n\n\t\tif (inverseFillsSelf && !inverseEmptiesSelf) {\n\t\t\tinverted.reservedDetachId = { localId: genId.getNextId() };\n\t\t}\n\t\treturn inverted;\n\t},\n\n\trebase: (\n\t\tchange: OptionalChangeset,\n\t\toverTagged: TaggedChange<OptionalChangeset>,\n\t\trebaseChild: NodeChangeRebaser,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldManager: CrossFieldManager,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t\texistenceState?: NodeExistenceState,\n\t): OptionalChangeset => {\n\t\tconst withIntention = (id: RegisterId): RegisterId => {\n\t\t\tif (id === \"self\") {\n\t\t\t\treturn id;\n\t\t\t}\n\t\t\tconst intention = getIntention(id.revision ?? overTagged.revision, revisionMetadata);\n\t\t\treturn { revision: intention, localId: id.localId };\n\t\t};\n\n\t\tconst { moves, childChanges } = change;\n\t\tconst { change: overChange } = overTagged;\n\t\tconst rebasedMoves: typeof moves = [];\n\n\t\tconst overDstToSrc = new RegisterMap<RegisterId>();\n\t\tconst overSrcToDst = new RegisterMap<RegisterId>();\n\t\tfor (const [src, dst] of overChange.moves) {\n\t\t\tconst srcTagged = withIntention(src);\n\t\t\tconst dstTagged = withIntention(dst);\n\t\t\toverSrcToDst.set(srcTagged, dstTagged);\n\t\t\toverDstToSrc.set(dstTagged, srcTagged);\n\t\t}\n\n\t\tlet reservedDetachId: RegisterId | undefined = change.reservedDetachId;\n\t\tconst changeDstToSrc = new RegisterMap<RegisterId>();\n\t\tconst changeSrcToDst = new RegisterMap<RegisterId>();\n\t\tfor (const [src, dst] of moves) {\n\t\t\tchangeSrcToDst.set(src, dst);\n\t\t\tchangeDstToSrc.set(dst, src);\n\t\t}\n\n\t\tfor (const [src, dst, target] of moves) {\n\t\t\tif (target === \"cellTargeting\") {\n\t\t\t\tassert(src === \"self\", 0x857 /* Cell targeting moves must have self as a source */);\n\t\t\t\t// TODO: Should we drop cell targeting / node targeting and just special-case 'self'? Might be simpler to understand.\n\t\t\t\t// Holding off on making a call until AB#6298 is addressed (possibly support for rebasing transactions makes the\n\t\t\t\t// answer to this more obvious).\n\t\t\t\tif (\n\t\t\t\t\toverSrcToDst.get(src) !== undefined &&\n\t\t\t\t\toverDstToSrc.get(src) === undefined &&\n\t\t\t\t\treservedDetachId === undefined\n\t\t\t\t) {\n\t\t\t\t\t// Over removed the content occupying this cell and didn't fill it with other content.\n\t\t\t\t\t// This change includes field changes,\n\t\t\t\t\treservedDetachId = dst;\n\t\t\t\t} else {\n\t\t\t\t\t// Cell-targeting.\n\t\t\t\t\trebasedMoves.push([src, dst, target]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Figure out where content in src ended up in `overTagged`\n\t\t\t\tconst rebasedSrc = overSrcToDst.get(src) ?? src;\n\t\t\t\t// Note: we cannot drop changes which map a node to itself, as this loses the intention of the original edit\n\t\t\t\t// (since the target kind is node targeting, it may not still map to a noop after further rebases)\n\t\t\t\trebasedMoves.push([rebasedSrc, dst, target]);\n\t\t\t}\n\t\t}\n\n\t\t// We rebased a fill from an empty state over another edit which also sets this field.\n\t\t// We need to make sure that we also empty the field.\n\t\tconst overFillsEmptyField = !overSrcToDst.has(\"self\") && overDstToSrc.has(\"self\");\n\t\tif (overFillsEmptyField && reservedDetachId !== undefined) {\n\t\t\trebasedMoves.push([\"self\", reservedDetachId, \"cellTargeting\"]);\n\t\t\treservedDetachId = undefined;\n\t\t}\n\n\t\tconst overChildChangesBySrc = new RegisterMap<NodeChangeset>();\n\t\tfor (const [id, childChange] of overChange.childChanges ?? []) {\n\t\t\toverChildChangesBySrc.set(withIntention(id) ?? id, childChange);\n\t\t}\n\n\t\tconst rebasedChildChanges: typeof childChanges = [];\n\t\tfor (const [id, childChange] of childChanges) {\n\t\t\tconst overChildChange = overChildChangesBySrc.get(id);\n\n\t\t\tconst rebasedId = overSrcToDst.get(id) ?? id;\n\t\t\tconst rebasedChildChange = rebaseChild(\n\t\t\t\tchildChange,\n\t\t\t\toverChildChange,\n\t\t\t\trebasedId === \"self\" ? NodeExistenceState.Alive : NodeExistenceState.Dead,\n\t\t\t);\n\t\t\tif (rebasedChildChange !== undefined) {\n\t\t\t\trebasedChildChanges.push([rebasedId, rebasedChildChange]);\n\t\t\t}\n\t\t}\n\n\t\tconst rebased: OptionalChangeset = {\n\t\t\tmoves: rebasedMoves,\n\t\t\tchildChanges: rebasedChildChanges,\n\t\t};\n\t\tif (reservedDetachId !== undefined) {\n\t\t\trebased.reservedDetachId = reservedDetachId;\n\t\t}\n\t\treturn rebased;\n\t},\n\n\tprune: (change: OptionalChangeset, pruneChild: NodeChangePruner): OptionalChangeset => {\n\t\tconst childChanges: OptionalChangeset[\"childChanges\"] = [];\n\t\tconst prunedChange: OptionalChangeset = {\n\t\t\tmoves: change.moves,\n\t\t\tchildChanges,\n\t\t};\n\t\tif (change.reservedDetachId !== undefined) {\n\t\t\tprunedChange.reservedDetachId = change.reservedDetachId;\n\t\t}\n\n\t\tfor (const [id, childChange] of change.childChanges) {\n\t\t\tconst prunedChildChange = pruneChild(childChange);\n\t\t\tif (prunedChildChange !== undefined) {\n\t\t\t\tprunedChange.childChanges.push([id, prunedChildChange]);\n\t\t\t}\n\t\t}\n\n\t\treturn prunedChange;\n\t},\n};\n\nexport interface OptionalFieldEditor extends FieldEditor<OptionalChangeset> {\n\t/**\n\t * Creates a change which replaces the field with `newContent`\n\t * @param newContent - the new content for the field\n\t * @param wasEmpty - whether the field is empty when creating this change\n\t * @param changeId - the ID associated with the replacement of the current content.\n\t * @param buildId - the ID associated with the creation of the `newContent`.\n\t */\n\tset(\n\t\twasEmpty: boolean,\n\t\tids: {\n\t\t\tfill: ChangesetLocalId;\n\t\t\tdetach: ChangesetLocalId;\n\t\t},\n\t): OptionalChangeset;\n\n\t/**\n\t * Creates a change which clears the field's contents (if any).\n\t * @param wasEmpty - whether the field is empty when creating this change\n\t * @param changeId - the ID associated with the detach.\n\t */\n\tclear(wasEmpty: boolean, id: ChangesetLocalId): OptionalChangeset;\n}\n\nexport const optionalFieldEditor: OptionalFieldEditor = {\n\tset: (\n\t\twasEmpty: boolean,\n\t\tids: {\n\t\t\tfill: ChangesetLocalId;\n\t\t\t// Should be interpreted as a set of an empty field if undefined.\n\t\t\tdetach: ChangesetLocalId;\n\t\t},\n\t): OptionalChangeset => {\n\t\tconst result: OptionalChangeset = {\n\t\t\tmoves: [[{ localId: ids.fill }, \"self\", \"nodeTargeting\"]],\n\t\t\tchildChanges: [],\n\t\t};\n\t\tif (wasEmpty) {\n\t\t\tresult.reservedDetachId = { localId: ids.detach };\n\t\t} else {\n\t\t\tresult.moves.push([\"self\", { localId: ids.detach }, \"cellTargeting\"]);\n\t\t}\n\t\treturn result;\n\t},\n\n\tclear: (wasEmpty: boolean, detachId: ChangesetLocalId): OptionalChangeset =>\n\t\twasEmpty\n\t\t\t? { moves: [], childChanges: [], reservedDetachId: { localId: detachId } }\n\t\t\t: {\n\t\t\t\t\tmoves: [[\"self\", { localId: detachId }, \"cellTargeting\"]],\n\t\t\t\t\tchildChanges: [],\n\t\t\t  },\n\n\tbuildChildChange: (index: number, childChange: NodeChangeset): OptionalChangeset => {\n\t\tassert(index === 0, 0x404 /* Optional fields only support a single child node */);\n\t\treturn {\n\t\t\tmoves: [],\n\t\t\tchildChanges: [[\"self\", childChange]],\n\t\t};\n\t},\n};\n\nexport function optionalFieldIntoDelta(\n\t{ change, revision }: TaggedChange<OptionalChangeset>,\n\tdeltaFromChild: ToDelta,\n): DeltaFieldChanges {\n\tconst delta: Mutable<DeltaFieldChanges> = {};\n\n\tlet markIsANoop = true;\n\tconst mark: Mutable<DeltaMark> = { count: 1 };\n\n\tif (change.moves.length > 0) {\n\t\tconst renames: DeltaDetachedNodeRename[] = [];\n\t\tfor (const [src, dst] of change.moves) {\n\t\t\tif (src === \"self\" && dst !== \"self\") {\n\t\t\t\tmark.detach = { major: dst.revision ?? revision, minor: dst.localId };\n\t\t\t\tmarkIsANoop = false;\n\t\t\t} else if (dst === \"self\" && src !== \"self\") {\n\t\t\t\tmark.attach = { major: src.revision ?? revision, minor: src.localId };\n\t\t\t\tmarkIsANoop = false;\n\t\t\t} else if (src !== \"self\" && dst !== \"self\") {\n\t\t\t\trenames.push({\n\t\t\t\t\tcount: 1,\n\t\t\t\t\toldId: { major: src.revision ?? revision, minor: src.localId },\n\t\t\t\t\tnewId: { major: dst.revision ?? revision, minor: dst.localId },\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\tif (renames.length > 0) {\n\t\t\tdelta.rename = renames;\n\t\t}\n\t}\n\n\tif (change.childChanges.length > 0) {\n\t\tconst globals: DeltaDetachedNodeChanges[] = [];\n\t\tfor (const [id, childChange] of change.childChanges) {\n\t\t\tconst childDelta = deltaFromChild(childChange);\n\t\t\tif (id !== \"self\") {\n\t\t\t\tconst fields = childDelta;\n\t\t\t\tglobals.push({\n\t\t\t\t\tid: { major: id.revision ?? revision, minor: id.localId },\n\t\t\t\t\tfields,\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tmark.fields = childDelta;\n\t\t\t\tmarkIsANoop = false;\n\t\t\t}\n\t\t}\n\n\t\tif (globals.length > 0) {\n\t\t\tdelta.global = globals;\n\t\t}\n\t}\n\n\tif (!markIsANoop) {\n\t\tdelta.local = [mark];\n\t}\n\n\treturn delta;\n}\n\nexport const optionalChangeHandler: FieldChangeHandler<OptionalChangeset, OptionalFieldEditor> = {\n\trebaser: optionalChangeRebaser,\n\tcodecsFactory: makeOptionalFieldCodecFamily,\n\teditor: optionalFieldEditor,\n\n\tintoDelta: optionalFieldIntoDelta,\n\trelevantRemovedRoots,\n\n\tisEmpty: (change: OptionalChangeset) =>\n\t\tchange.childChanges.length === 0 && change.moves.length === 0,\n};\n\nfunction areEqualRegisterIds(a: RegisterId, b: RegisterId): boolean {\n\tif (typeof a === \"string\" || typeof b === \"string\") {\n\t\treturn a === b;\n\t}\n\n\treturn areEqualChangeAtomIds(a, b);\n}\n\nfunction* relevantRemovedRoots(\n\t{ change, revision }: TaggedChange<OptionalChangeset>,\n\trelevantRemovedRootsFromChild: RelevantRemovedRootsFromChild,\n): Iterable<DeltaDetachedNodeId> {\n\tconst alreadyYielded = new RegisterMap<boolean>();\n\n\tfor (const [src] of change.moves) {\n\t\tif (src !== \"self\" && !alreadyYielded.has(src)) {\n\t\t\talreadyYielded.set(src, true);\n\t\t\tyield nodeIdFromChangeAtom(src, revision);\n\t\t}\n\t}\n\n\tfor (const [id, childChange] of change.childChanges) {\n\t\t// Child changes make the tree they apply to relevant unless that tree existed in the starting context of\n\t\t// of this change.\n\t\tif (id !== \"self\" && !alreadyYielded.has(id)) {\n\t\t\talreadyYielded.set(id, true);\n\t\t\tyield nodeIdFromChangeAtom(id);\n\t\t}\n\t\tyield* relevantRemovedRootsFromChild(childChange);\n\t}\n}\n"]}

package/lib/feature-libraries/optional-field/optionalFieldChangeFormat.d.ts

@@ -0,0 +1,38 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Static, TSchema } from "@sinclair/typebox";
+export declare const EncodedRegisterId: import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TObject<{
+    revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+    localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+}>, import("@sinclair/typebox").TLiteral<0>]>;
+export type EncodedRegisterId = Static<typeof EncodedRegisterId>;
+export declare const EncodedBuild: import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TObject<{
+    revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+    localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+}>]>;
+export type EncodedBuild = Static<typeof EncodedBuild>;
+export declare const EncodedOptionalChangeset: <Schema extends TSchema>(tNodeChange: Schema) => import("@sinclair/typebox").TObject<{
+    b: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TObject<{
+        revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+        localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+    }>]>>>;
+    m: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TObject<{
+        revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+        localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+    }>, import("@sinclair/typebox").TLiteral<0>]>, import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TObject<{
+        revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+        localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+    }>, import("@sinclair/typebox").TLiteral<0>]>, import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TBoolean>]>>>;
+    c: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TObject<{
+        revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+        localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+    }>, import("@sinclair/typebox").TLiteral<0>]>, Schema]>>>;
+    d: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TObject<{
+        revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+        localId: import("@sinclair/typebox").TUnsafe<import("../..").ChangesetLocalId>;
+    }>, import("@sinclair/typebox").TLiteral<0>]>>;
+}>;
+export type EncodedOptionalChangeset<Schema extends TSchema> = Static<ReturnType<typeof EncodedOptionalChangeset<Schema>>>;
+//# sourceMappingURL=optionalFieldChangeFormat.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"optionalFieldChangeFormat.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/optional-field/optionalFieldChangeFormat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAiB,OAAO,EAAQ,MAAM,mBAAmB,CAAC;AAOzE,eAAO,MAAM,iBAAiB;;;6CAAqD,CAAC;AACpF,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAEjE,eAAO,MAAM,YAAY;;;IAAoC,CAAC;AAC9D,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;AAEvD,eAAO,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;;;EAiBnC,CAAC;AAEH,MAAM,MAAM,wBAAwB,CAAC,MAAM,SAAS,OAAO,IAAI,MAAM,CACpE,UAAU,CAAC,OAAO,wBAAwB,CAAC,MAAM,CAAC,CAAC,CACnD,CAAC"}

package/lib/feature-libraries/optional-field/optionalFieldChangeFormat.js

@@ -0,0 +1,22 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Type } from "@sinclair/typebox";
+import { EncodedChangeAtomId } from "../modular-schema";
+const noAdditionalProps = { additionalProperties: false };
+// 0 signifies "self". Using undefined doesn't actually JSON round-trip conveniently, since
+// undefined is converted to null when inside an array (which happens in e.g. the moves array).
+export const EncodedRegisterId = Type.Union([EncodedChangeAtomId, Type.Literal(0)]);
+export const EncodedBuild = Type.Tuple([EncodedChangeAtomId]);
+export const EncodedOptionalChangeset = (tNodeChange) => Type.Object({
+    b: Type.Optional(Type.Array(EncodedBuild)),
+    m: Type.Optional(Type.Array(Type.Tuple([
+        EncodedRegisterId,
+        EncodedRegisterId,
+        Type.Optional(Type.Boolean()),
+    ]))),
+    c: Type.Optional(Type.Array(Type.Tuple([EncodedRegisterId, tNodeChange]))),
+    d: Type.Optional(EncodedRegisterId),
+}, noAdditionalProps);
+//# sourceMappingURL=optionalFieldChangeFormat.js.map

package/lib/feature-libraries/optional-field/optionalFieldChangeFormat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"optionalFieldChangeFormat.js","sourceRoot":"","sources":["../../../src/feature-libraries/optional-field/optionalFieldChangeFormat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAkC,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AAExD,MAAM,iBAAiB,GAAkB,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;AAEzE,2FAA2F;AAC3F,+FAA+F;AAC/F,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,mBAAmB,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAGpF,MAAM,CAAC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC;AAG9D,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAyB,WAAmB,EAAE,EAAE,CACvF,IAAI,CAAC,MAAM,CACV;IACC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC,EAAE,IAAI,CAAC,QAAQ,CACf,IAAI,CAAC,KAAK,CACT,IAAI,CAAC,KAAK,CAAC;QACV,iBAAiB;QACjB,iBAAiB;QACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;KAC7B,CAAC,CACF,CACD;IACD,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC;CACnC,EACD,iBAAiB,CACjB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Static, ObjectOptions, TSchema, Type } from \"@sinclair/typebox\";\nimport { EncodedChangeAtomId } from \"../modular-schema\";\n\nconst noAdditionalProps: ObjectOptions = { additionalProperties: false };\n\n// 0 signifies \"self\". Using undefined doesn't actually JSON round-trip conveniently, since\n// undefined is converted to null when inside an array (which happens in e.g. the moves array).\nexport const EncodedRegisterId = Type.Union([EncodedChangeAtomId, Type.Literal(0)]);\nexport type EncodedRegisterId = Static<typeof EncodedRegisterId>;\n\nexport const EncodedBuild = Type.Tuple([EncodedChangeAtomId]);\nexport type EncodedBuild = Static<typeof EncodedBuild>;\n\nexport const EncodedOptionalChangeset = <Schema extends TSchema>(tNodeChange: Schema) =>\n\tType.Object(\n\t\t{\n\t\t\tb: Type.Optional(Type.Array(EncodedBuild)),\n\t\t\tm: Type.Optional(\n\t\t\t\tType.Array(\n\t\t\t\t\tType.Tuple([\n\t\t\t\t\t\tEncodedRegisterId,\n\t\t\t\t\t\tEncodedRegisterId,\n\t\t\t\t\t\tType.Optional(Type.Boolean()),\n\t\t\t\t\t]),\n\t\t\t\t),\n\t\t\t),\n\t\t\tc: Type.Optional(Type.Array(Type.Tuple([EncodedRegisterId, tNodeChange]))),\n\t\t\td: Type.Optional(EncodedRegisterId),\n\t\t},\n\t\tnoAdditionalProps,\n\t);\n\nexport type EncodedOptionalChangeset<Schema extends TSchema> = Static<\n\tReturnType<typeof EncodedOptionalChangeset<Schema>>\n>;\n"]}