@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/feature-libraries/sequence-field/compose.js

@@ -0,0 +1,438 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ComposeQueue = exports.amendCompose = exports.compose = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const core_1 = require("../../core");
+const util_1 = require("../../util");
+const modular_schema_1 = require("../modular-schema");
+const types_1 = require("./types");
+const markListFactory_1 = require("./markListFactory");
+const markQueue_1 = require("./markQueue");
+const moveEffectTable_1 = require("./moveEffectTable");
+const utils_1 = require("./utils");
+/**
+ * Composes a sequence of changesets into a single changeset.
+ * @param changes - The changesets to be applied.
+ * Parts of the input may be reused in the output, but the input is not mutated.
+ * Each changeset in the list is assumed to be applicable after the previous one.
+ * @returns A changeset that is equivalent to applying each of the given `changes` in order.
+ *
+ * WARNING! This implementation is incomplete:
+ * - Tombstone information is ignored.
+ * - Support for moves is not implemented.
+ * - Support for slices is not implemented.
+ */
+function compose(changes, composeChild, genId, manager, revisionMetadata) {
+    let composed = [];
+    for (const change of changes) {
+        composed = composeMarkLists(composed, change.revision, change.change, composeChild, genId, manager, revisionMetadata);
+    }
+    return composed;
+}
+exports.compose = compose;
+function composeMarkLists(baseMarkList, newRev, newMarkList, composeChild, genId, moveEffects, revisionMetadata) {
+    const factory = new markListFactory_1.MarkListFactory();
+    const queue = new ComposeQueue(undefined, baseMarkList, newRev, newMarkList, genId, moveEffects, revisionMetadata, (a, b) => composeChildChanges(a, b, composeChild));
+    while (!queue.isEmpty()) {
+        const { baseMark, newMark } = queue.pop();
+        if (newMark === undefined) {
+            (0, core_utils_1.assert)(baseMark !== undefined, 0x4db /* Non-empty queue should not return two undefined marks */);
+            factory.push(baseMark);
+        }
+        else {
+            // We only compose changesets that will not be further rebased.
+            // It is therefore safe to remove any intentions that have no impact in the context they apply to.
+            const settledNewMark = (0, utils_1.settleMark)(newMark, newRev, revisionMetadata);
+            if (baseMark === undefined) {
+                factory.push(composeMark(settledNewMark, newRev, composeChild));
+            }
+            else {
+                // Past this point, we are guaranteed that `settledNewMark` and `baseMark` have the same length and
+                // start at the same location in the revision after the base changes.
+                // They therefore refer to the same range for that revision.
+                const composedMark = composeMarks(baseMark, newRev, settledNewMark, composeChild, genId, moveEffects, revisionMetadata);
+                factory.push(composedMark);
+            }
+        }
+    }
+    return factory.list;
+}
+/**
+ * Composes two marks where `newMark` is based on the state produced by `baseMark`.
+ * @param baseMark - The mark to compose with `newMark`.
+ * Its output range should be the same as `newMark`'s input range.
+ * @param newRev - The revision the new mark is part of.
+ * @param newMark - The mark to compose with `baseMark`.
+ * Its input range should be the same as `baseMark`'s output range.
+ * @returns A mark that is equivalent to applying both `baseMark` and `newMark` successively.
+ */
+function composeMarks(baseMark, newRev, newMark, composeChild, genId, moveEffects, revisionMetadata) {
+    let nodeChange = composeChildChanges(baseMark.changes, newMark.changes === undefined ? undefined : (0, core_1.tagChange)(newMark.changes, newRev), composeChild);
+    if (nodeChange !== undefined) {
+        const baseSource = (0, moveEffectTable_1.getMoveIn)(baseMark);
+        if (baseSource !== undefined) {
+            setModifyAfter(moveEffects, (0, utils_1.getEndpoint)(baseSource, undefined), nodeChange, newRev, composeChild);
+            nodeChange = undefined;
+        }
+    }
+    if ((0, utils_1.isImpactfulCellRename)(newMark, newRev, revisionMetadata)) {
+        const newAttachAndDetach = (0, utils_1.asAttachAndDetach)(newMark);
+        const newDetachRevision = newAttachAndDetach.detach.revision ?? newRev;
+        if ((0, utils_1.markEmptiesCells)(baseMark)) {
+            if ((0, moveEffectTable_1.isMoveIn)(newAttachAndDetach.attach) && (0, moveEffectTable_1.isMoveOut)(newAttachAndDetach.detach)) {
+                (0, core_utils_1.assert)((0, moveEffectTable_1.isMoveOut)(baseMark), 0x808 /* Unexpected mark type */);
+                // The base changeset and new changeset both move these nodes.
+                // Call the original position of the nodes A, the position after the base changeset is applied B,
+                // and the position after the new changeset is applied C.
+                // The new changeset moves the nodes from B, temporarily returns them to A, and then moves them to C.
+                // The composition of the base and new changesets will be a move directly from A to C,
+                // since the move from A to B cancels out with the return from B to A.
+                // This if-block is handling marks at A.
+                // When we compose the marks at B we will link the start of the base move (A to B)
+                // with the end of the new move (B to C).
+                // Because we are replacing the mark representing the start of the move with the new changeset's
+                // move-out from A, we update the base move-in at B to consider that its start point.
+                setEndpoint(moveEffects, modular_schema_1.CrossFieldTarget.Destination, (0, utils_1.getEndpoint)(baseMark, undefined), baseMark.count, { revision: newDetachRevision, localId: newAttachAndDetach.detach.id });
+            }
+            // baseMark is a detach which cancels with the attach portion of the AttachAndDetach,
+            // so we are just left with the detach portion of the AttachAndDetach.
+            const newDetach = {
+                ...newAttachAndDetach.detach,
+                count: baseMark.count,
+            };
+            // We may need to apply effects to the source location of the base MoveOut so we annotate the mark with
+            // information about that location.
+            if ((0, moveEffectTable_1.isMoveOut)(baseMark)) {
+                newDetach.vestigialEndpoint = {
+                    revision: baseMark.revision,
+                    localId: baseMark.id,
+                };
+            }
+            return (0, utils_1.withRevision)((0, utils_1.withNodeChange)(newDetach, nodeChange), newDetachRevision);
+        }
+        if ((0, utils_1.isImpactfulCellRename)(baseMark, undefined, revisionMetadata)) {
+            const baseAttachAndDetach = (0, utils_1.asAttachAndDetach)(baseMark);
+            const newOutputId = (0, utils_1.getOutputCellId)(newAttachAndDetach, newRev, revisionMetadata);
+            if ((0, utils_1.areEqualCellIds)(newOutputId, baseAttachAndDetach.cellId)) {
+                return (0, utils_1.withNodeChange)({ count: baseAttachAndDetach.count, cellId: baseAttachAndDetach.cellId }, nodeChange);
+            }
+            // `newMark`'s attach portion cancels with `baseMark`'s detach portion.
+            const originalAttach = { ...baseAttachAndDetach.attach };
+            const finalDetach = { ...newAttachAndDetach.detach };
+            const detachRevision = finalDetach.revision ?? newRev;
+            if (detachRevision !== undefined) {
+                finalDetach.revision = detachRevision;
+            }
+            return (0, utils_1.normalizeCellRename)({
+                type: "AttachAndDetach",
+                cellId: baseMark.cellId,
+                count: baseMark.count,
+                attach: originalAttach,
+                detach: finalDetach,
+            }, nodeChange);
+        }
+        return (0, utils_1.withRevision)((0, utils_1.normalizeCellRename)(newAttachAndDetach, nodeChange), newRev);
+    }
+    if ((0, utils_1.isImpactfulCellRename)(baseMark, undefined, revisionMetadata)) {
+        const baseAttachAndDetach = (0, utils_1.asAttachAndDetach)(baseMark);
+        if ((0, utils_1.markFillsCells)(newMark)) {
+            if ((0, moveEffectTable_1.isMoveIn)(baseAttachAndDetach.attach) && (0, moveEffectTable_1.isMoveOut)(baseAttachAndDetach.detach)) {
+                (0, core_utils_1.assert)((0, moveEffectTable_1.isMoveIn)(newMark), 0x809 /* Unexpected mark type */);
+                setEndpoint(moveEffects, modular_schema_1.CrossFieldTarget.Source, (0, utils_1.getEndpoint)(newMark, newRev), baseAttachAndDetach.count, {
+                    revision: baseAttachAndDetach.attach.revision,
+                    localId: baseAttachAndDetach.attach.id,
+                });
+            }
+            const originalAttach = (0, utils_1.withRevision)((0, utils_1.withNodeChange)({
+                ...baseAttachAndDetach.attach,
+                cellId: baseAttachAndDetach.cellId,
+                count: baseAttachAndDetach.count,
+            }, nodeChange), baseAttachAndDetach.attach.revision);
+            return originalAttach;
+        }
+        else {
+            // Other mark types have been handled by previous conditional branches.
+            (0, core_utils_1.assert)(newMark.type === types_1.NoopMarkType, 0x80a /* Unexpected mark type */);
+            return (0, utils_1.withNodeChange)(baseMark, nodeChange);
+        }
+    }
+    if (!(0, utils_1.markHasCellEffect)(baseMark) && !(0, utils_1.markHasCellEffect)(newMark)) {
+        if ((0, utils_1.isNoopMark)(baseMark)) {
+            return (0, utils_1.withNodeChange)(newMark, nodeChange);
+        }
+        else if ((0, utils_1.isNoopMark)(newMark)) {
+            return (0, utils_1.withNodeChange)(baseMark, nodeChange);
+        }
+        return createNoopMark(newMark.count, nodeChange, (0, utils_1.getInputCellId)(baseMark, undefined, undefined));
+    }
+    else if (!(0, utils_1.markHasCellEffect)(baseMark)) {
+        return (0, utils_1.withRevision)((0, utils_1.withNodeChange)(newMark, nodeChange), newRev);
+    }
+    else if (!(0, utils_1.markHasCellEffect)(newMark)) {
+        return (0, utils_1.withNodeChange)(baseMark, nodeChange);
+    }
+    else if ((0, utils_1.areInputCellsEmpty)(baseMark)) {
+        (0, core_utils_1.assert)((0, utils_1.isDetach)(newMark), 0x71c /* Unexpected mark type */);
+        (0, core_utils_1.assert)((0, utils_1.isAttach)(baseMark), 0x71d /* Expected generative mark */);
+        const attach = (0, utils_1.extractMarkEffect)(baseMark);
+        const detach = (0, utils_1.extractMarkEffect)((0, utils_1.withRevision)(newMark, newRev));
+        if ((0, moveEffectTable_1.isMoveIn)(attach) && (0, moveEffectTable_1.isMoveOut)(detach)) {
+            const finalSource = (0, utils_1.getEndpoint)(attach, undefined);
+            const finalDest = (0, utils_1.getEndpoint)(detach, newRev);
+            setEndpoint(moveEffects, modular_schema_1.CrossFieldTarget.Source, finalSource, baseMark.count, finalDest);
+            setEndpoint(moveEffects, modular_schema_1.CrossFieldTarget.Destination, finalDest, baseMark.count, finalSource);
+            // The `finalEndpoint` field of AttachAndDetach move effect pairs is not used,
+            // so we remove it as a normalization.
+            delete attach.finalEndpoint;
+            delete detach.finalEndpoint;
+        }
+        if ((0, utils_1.areEqualCellIds)((0, utils_1.getOutputCellId)(newMark, newRev, revisionMetadata), baseMark.cellId)) {
+            // The output and input cell IDs are the same, so this mark has no effect.
+            return (0, utils_1.withNodeChange)({ count: baseMark.count, cellId: baseMark.cellId }, nodeChange);
+        }
+        return (0, utils_1.normalizeCellRename)({
+            type: "AttachAndDetach",
+            cellId: baseMark.cellId,
+            count: baseMark.count,
+            attach,
+            detach,
+        }, nodeChange);
+    }
+    else {
+        if ((0, moveEffectTable_1.isMoveMark)(baseMark) && (0, moveEffectTable_1.isMoveMark)(newMark)) {
+            // The marks must be inverses, since `newMark` is filling the cells which `baseMark` emptied.
+            const nodeChanges = (0, moveEffectTable_1.getModifyAfter)(moveEffects, baseMark.revision, baseMark.id, baseMark.count);
+            // We return a noop that is annotated with information about the endpoint it used to be because there may
+            // be more node changes on `newMark`'s source mark which need to be included here.
+            // We will remove the the annotation during `amendCompose` or pruning.
+            const vestige = {
+                count: baseMark.count,
+                vestigialEndpoint: {
+                    revision: baseMark.revision,
+                    localId: baseMark.id,
+                },
+                changes: composeChildChanges(nodeChange, nodeChanges, composeChild),
+            };
+            return vestige;
+        }
+        const length = baseMark.count;
+        return createNoopMark(length, nodeChange);
+    }
+}
+function createNoopMark(length, nodeChange, cellId) {
+    const mark = { count: length };
+    if (nodeChange !== undefined) {
+        (0, core_utils_1.assert)(length === 1, 0x692 /* A mark with a node change must have length one */);
+        mark.changes = nodeChange;
+    }
+    if (cellId !== undefined) {
+        mark.cellId = cellId;
+    }
+    return mark;
+}
+function composeChildChanges(baseChange, newChange, composeChild) {
+    if (newChange === undefined) {
+        return baseChange;
+    }
+    else if (baseChange === undefined) {
+        return composeChild([newChange]);
+    }
+    else {
+        return composeChild([(0, core_1.makeAnonChange)(baseChange), newChange]);
+    }
+}
+function composeMark(mark, revision, composeChild) {
+    const cloned = (0, utils_1.cloneMark)(mark);
+    if (cloned.cellId !== undefined &&
+        cloned.cellId.revision === undefined &&
+        revision !== undefined) {
+        (0, util_1.asMutable)(cloned.cellId).revision = revision;
+    }
+    (0, utils_1.addRevision)(cloned, revision);
+    if (cloned.changes !== undefined) {
+        cloned.changes = composeChild([(0, core_1.tagChange)(cloned.changes, revision)]);
+        return cloned;
+    }
+    return cloned;
+}
+function amendCompose(marks, composeChild, genId, manager) {
+    return amendComposeI(marks, composeChild, manager);
+}
+exports.amendCompose = amendCompose;
+function amendComposeI(marks, composeChild, moveEffects) {
+    const factory = new markListFactory_1.MarkListFactory();
+    const queue = new markQueue_1.MarkQueue(marks, undefined, moveEffects, true, util_1.fakeIdAllocator, (a, b) => composeChildChanges(a, b, composeChild));
+    while (!queue.isEmpty()) {
+        const mark = queue.dequeue();
+        if (mark.vestigialEndpoint !== undefined) {
+            // Any effects that target this endpoint should have been applied either during the first compose pass,
+            // or during the `MarkQueue`'s reading for this pass.
+            delete mark.vestigialEndpoint;
+        }
+        factory.push(mark);
+    }
+    return factory.list;
+}
+class ComposeQueue {
+    constructor(baseRevision, baseMarks, newRevision, newMarks, genId, moveEffects, revisionMetadata, composeChanges) {
+        this.newRevision = newRevision;
+        this.revisionMetadata = revisionMetadata;
+        this.baseMarks = new markQueue_1.MarkQueue(baseMarks, baseRevision, moveEffects, true, genId, composeChanges);
+        this.newMarks = new markQueue_1.MarkQueue(newMarks, newRevision, moveEffects, true, genId, composeChanges);
+    }
+    isEmpty() {
+        return this.baseMarks.isEmpty() && this.newMarks.isEmpty();
+    }
+    pop() {
+        const baseMark = this.baseMarks.peek();
+        const newMark = this.newMarks.peek();
+        if (baseMark === undefined && newMark === undefined) {
+            return {};
+        }
+        else if (baseMark === undefined) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const length = (0, utils_1.getInputLength)(newMark);
+            return this.dequeueNew(length);
+        }
+        else if (newMark === undefined) {
+            const length = (0, utils_1.getOutputLength)(baseMark);
+            return this.dequeueBase(length);
+        }
+        else if ((0, utils_1.areOutputCellsEmpty)(baseMark) && (0, utils_1.areInputCellsEmpty)(newMark)) {
+            const baseCellId = (0, utils_1.getOutputCellId)(baseMark, this.baseMarks.revision, this.revisionMetadata) ??
+                (0, util_1.fail)("Expected defined output ID");
+            if ((0, utils_1.markEmptiesCells)(baseMark) && baseCellId.revision === undefined) {
+                // The base revision should always be defined except when squashing changes into a transaction.
+                // In the future, we want to support reattaches in the new change here.
+                // We will need to be able to order the base mark relative to the new mark by looking at the lineage of the new mark
+                // (which will be obtained by rebasing the reattach over interim changes
+                // (which requires the local changes to have a revision tag))
+                (0, core_utils_1.assert)((0, utils_1.isNewAttach)(newMark), 0x695 /* TODO: Assign revision tags to each change in a transaction */);
+                return this.dequeueNew();
+            }
+            const cmp = compareCellPositions(baseCellId, baseMark.count, newMark, this.newRevision, this.revisionMetadata);
+            if (cmp < 0) {
+                return { baseMark: this.baseMarks.dequeueUpTo(-cmp) };
+            }
+            else if (cmp > 0) {
+                return { newMark: this.newMarks.dequeueUpTo(cmp) };
+            }
+            else {
+                return this.dequeueBoth();
+            }
+        }
+        else if ((0, utils_1.areOutputCellsEmpty)(baseMark)) {
+            return this.dequeueBase();
+        }
+        else if ((0, utils_1.areInputCellsEmpty)(newMark)) {
+            return this.dequeueNew();
+        }
+        else {
+            return this.dequeueBoth();
+        }
+    }
+    dequeueBase(length = 0) {
+        const baseMark = this.baseMarks.dequeue();
+        return { baseMark, newMark: length > 0 ? { count: length } : undefined };
+    }
+    dequeueNew(length = 0) {
+        return {
+            baseMark: length > 0 ? { count: length } : undefined,
+            newMark: this.newMarks.dequeue(),
+        };
+    }
+    dequeueBoth() {
+        const baseMark = this.baseMarks.peek();
+        const newMark = this.newMarks.peek();
+        (0, core_utils_1.assert)(baseMark !== undefined && newMark !== undefined, 0x697 /* Cannot dequeue both unless both mark queues are non-empty */);
+        const length = Math.min(newMark.count, baseMark.count);
+        return {
+            baseMark: this.baseMarks.dequeueUpTo(length),
+            newMark: this.newMarks.dequeueUpTo(length),
+        };
+    }
+}
+exports.ComposeQueue = ComposeQueue;
+// TODO: Try to share more logic with the version in rebase.ts.
+/**
+ * Returns a number N which encodes how the cells of the two marks are aligned.
+ * - If N is zero, then the first cell of `baseMark` is the same as the first cell of `newMark`.
+ * - If N is positive, then the first N cells of `newMark` (or all its cells if N is greater than its length)
+ * are before the first cell of `baseMark`.
+ * - If N is negative, then the first N cells of `baseMark` (or all its cells if N is greater than its length)
+ * are before the first cell of `newMark`.
+ */
+function compareCellPositions(baseCellId, baseCellCount, newMark, newIntention, metadata) {
+    const newCellId = (0, utils_1.getInputCellId)(newMark, newIntention, metadata);
+    (0, core_utils_1.assert)(newCellId !== undefined, 0x71f /* Should have cell ID */);
+    if (baseCellId.revision === newCellId.revision) {
+        const comparison = (0, utils_1.compareCellsFromSameRevision)(baseCellId, baseCellCount, newCellId, newMark.count);
+        if (comparison !== undefined) {
+            return comparison;
+        }
+    }
+    const offsetInBase = (0, utils_1.getOffsetInCellRange)(baseCellId.lineage, newCellId.revision, newCellId.localId, newMark.count);
+    if (offsetInBase !== undefined) {
+        return offsetInBase > 0 ? offsetInBase : -Infinity;
+    }
+    const offsetInNew = (0, utils_1.getOffsetInCellRange)(newCellId.lineage, baseCellId.revision, baseCellId.localId, baseCellCount);
+    if (offsetInNew !== undefined) {
+        return offsetInNew > 0 ? -offsetInNew : Infinity;
+    }
+    const cmp = (0, utils_1.compareLineages)(baseCellId, newCellId);
+    if (cmp !== 0) {
+        return Math.sign(cmp) * Infinity;
+    }
+    (0, core_utils_1.assert)(baseCellId.revision !== undefined && newCellId.revision !== undefined, 0x858 /* Cells should have defined revisions */);
+    if (!(0, utils_1.isNewAttach)(newMark)) {
+        // If `newMark` were targeting a cell older than the composition window
+        // there would be lineage determining the relative order of `newCell` and `baseCell`.
+        // TODO:6127: Enable this assert
+        // assert(
+        // 	newRevisionIndex !== undefined,
+        // 	"Expected lineage to determine cell order",
+        // );
+        // `newCell` was detached by a change in this composition, so there will be a corresponding mark
+        // later in the base changeset.
+        return -Infinity;
+    }
+    const newRevisionIndex = metadata.getIndex(newCellId.revision);
+    const baseRevisionIndex = metadata.getIndex(baseCellId.revision);
+    (0, core_utils_1.assert)(newRevisionIndex !== undefined, 0x859 /* A cell from a new attach should have a defined revision index */);
+    // We use the tiebreaking policy of the newer cell.
+    return (baseRevisionIndex ?? -Infinity) > newRevisionIndex ? -Infinity : Infinity;
+}
+// TODO: Reduce the duplication between this and other MoveEffect helpers
+function setModifyAfter(moveEffects, { revision, localId: id }, modifyAfter, modifyRevision, composeChanges) {
+    const target = modular_schema_1.CrossFieldTarget.Source;
+    const count = 1;
+    const effect = (0, moveEffectTable_1.getMoveEffect)(moveEffects, target, revision, id, count, false);
+    let newEffect;
+    if (effect.value !== undefined) {
+        const nodeChange = effect.value.modifyAfter !== undefined
+            ? composeChanges([effect.value.modifyAfter, (0, core_1.tagChange)(modifyAfter, modifyRevision)])
+            : modifyAfter;
+        newEffect = { ...effect.value, modifyAfter: (0, core_1.makeAnonChange)(nodeChange) };
+    }
+    else {
+        newEffect = { modifyAfter: (0, core_1.tagChange)(modifyAfter, modifyRevision) };
+    }
+    (0, moveEffectTable_1.setMoveEffect)(moveEffects, target, revision, id, count, newEffect);
+}
+function setEndpoint(moveEffects, target, id, count, endpoint) {
+    const effect = (0, moveEffectTable_1.getMoveEffect)(moveEffects, target, id.revision, id.localId, count);
+    const newEffect = effect.value !== undefined ? { ...effect.value, endpoint } : { endpoint };
+    (0, moveEffectTable_1.setMoveEffect)(moveEffects, target, id.revision, id.localId, effect.length, newEffect);
+    const remainingCount = count - effect.length;
+    if (remainingCount > 0) {
+        setEndpoint(moveEffects, target, offsetChangeAtomId(id, effect.length), remainingCount, offsetChangeAtomId(endpoint, effect.length));
+    }
+}
+function offsetChangeAtomId(id, offset) {
+    return { ...id, localId: (0, util_1.brand)(id.localId + offset) };
+}
+//# sourceMappingURL=compose.js.map

package/dist/feature-libraries/sequence-field/compose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compose.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/compose.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,qCAOoB;AACpB,qCAAkF;AAClF,sDAAwE;AACxE,mCASiB;AACjB,uDAAoD;AACpD,2CAAwC;AACxC,uDAU2B;AAC3B,mCA4BiB;AAQjB;;;;;;;;;;;GAWG;AACH,SAAgB,OAAO,CACtB,OAA+C,EAC/C,YAA6C,EAC7C,KAAkB,EAClB,OAA0B,EAC1B,gBAAwC;IAExC,IAAI,QAAQ,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,QAAQ,GAAG,gBAAgB,CAC1B,QAAQ,EACR,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,MAAM,EACb,YAAY,EACZ,KAAK,EACL,OAAuC,EACvC,gBAAgB,CAChB,CAAC;KACF;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AApBD,0BAoBC;AAED,SAAS,gBAAgB,CACxB,YAAmC,EACnC,MAA+B,EAC/B,WAAkC,EAClC,YAA6C,EAC7C,KAAkB,EAClB,WAAyC,EACzC,gBAAwC;IAExC,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAe,CAAC;IACnD,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,SAAS,EACT,YAAY,EACZ,MAAM,EACN,WAAW,EACX,KAAK,EACL,WAAW,EACX,gBAAgB,EAChB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CACjD,CAAC;IACF,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE;QACxB,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QAC1C,IAAI,OAAO,KAAK,SAAS,EAAE;YAC1B,IAAA,mBAAM,EACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,2DAA2D,CACjE,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SACvB;aAAM;YACN,+DAA+D;YAC/D,kGAAkG;YAClG,MAAM,cAAc,GAAG,IAAA,kBAAU,EAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;YACrE,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;aAChE;iBAAM;gBACN,mGAAmG;gBACnG,qEAAqE;gBACrE,4DAA4D;gBAC5D,MAAM,YAAY,GAAG,YAAY,CAChC,QAAQ,EACR,MAAM,EACN,cAAc,EACd,YAAY,EACZ,KAAK,EACL,WAAW,EACX,gBAAgB,CAChB,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aAC3B;SACD;KACD;IAED,OAAO,OAAO,CAAC,IAAI,CAAC;AACrB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,YAAY,CACpB,QAA2B,EAC3B,MAA+B,EAC/B,OAA0B,EAC1B,YAA6C,EAC7C,KAAkB,EAClB,WAAyC,EACzC,gBAAwC;IAExC,IAAI,UAAU,GAAG,mBAAmB,CACnC,QAAQ,CAAC,OAAO,EAChB,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAA,gBAAS,EAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,EAC9E,YAAY,CACZ,CAAC;IACF,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,MAAM,UAAU,GAAG,IAAA,2BAAS,EAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,cAAc,CACb,WAAW,EACX,IAAA,mBAAW,EAAC,UAAU,EAAE,SAAS,CAAC,EAClC,UAAU,EACV,MAAM,EACN,YAAY,CACZ,CAAC;YACF,UAAU,GAAG,SAAS,CAAC;SACvB;KACD;IACD,IAAI,IAAA,6BAAqB,EAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,EAAE;QAC7D,MAAM,kBAAkB,GAAG,IAAA,yBAAiB,EAAC,OAAO,CAAC,CAAC;QACtD,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC;QACvE,IAAI,IAAA,wBAAgB,EAAC,QAAQ,CAAC,EAAE;YAC/B,IAAI,IAAA,0BAAQ,EAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,IAAA,2BAAS,EAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE;gBAChF,IAAA,mBAAM,EAAC,IAAA,2BAAS,EAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBAE9D,8DAA8D;gBAC9D,iGAAiG;gBACjG,yDAAyD;gBACzD,qGAAqG;gBACrG,sFAAsF;gBACtF,sEAAsE;gBACtE,wCAAwC;gBACxC,kFAAkF;gBAClF,yCAAyC;gBACzC,gGAAgG;gBAChG,qFAAqF;gBACrF,WAAW,CACV,WAAW,EACX,iCAAgB,CAAC,WAAW,EAC5B,IAAA,mBAAW,EAAC,QAAQ,EAAE,SAAS,CAAC,EAChC,QAAQ,CAAC,KAAK,EACd,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,kBAAkB,CAAC,MAAM,CAAC,EAAE,EAAE,CACtE,CAAC;aACF;YAED,qFAAqF;YACrF,sEAAsE;YACtE,MAAM,SAAS,GAA+D;gBAC7E,GAAG,kBAAkB,CAAC,MAAM;gBAC5B,KAAK,EAAE,QAAQ,CAAC,KAAK;aACrB,CAAC;YACF,uGAAuG;YACvG,mCAAmC;YACnC,IAAI,IAAA,2BAAS,EAAC,QAAQ,CAAC,EAAE;gBACxB,SAAS,CAAC,iBAAiB,GAAG;oBAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;oBAC3B,OAAO,EAAE,QAAQ,CAAC,EAAE;iBACpB,CAAC;aACF;YACD,OAAO,IAAA,oBAAY,EAAC,IAAA,sBAAc,EAAC,SAAS,EAAE,UAAU,CAAC,EAAE,iBAAiB,CAAC,CAAC;SAC9E;QAED,IAAI,IAAA,6BAAqB,EAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,CAAC,EAAE;YACjE,MAAM,mBAAmB,GAAG,IAAA,yBAAiB,EAAC,QAAQ,CAAC,CAAC;YACxD,MAAM,WAAW,GAAG,IAAA,uBAAe,EAAC,kBAAkB,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;YAClF,IAAI,IAAA,uBAAe,EAAC,WAAW,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE;gBAC7D,OAAO,IAAA,sBAAc,EACpB,EAAE,KAAK,EAAE,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,mBAAmB,CAAC,MAAM,EAAE,EACxE,UAAU,CACV,CAAC;aACF;YAED,uEAAuE;YACvE,MAAM,cAAc,GAAG,EAAE,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC;YACzD,MAAM,WAAW,GAAG,EAAE,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC;YACrD,MAAM,cAAc,GAAG,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;YACtD,IAAI,cAAc,KAAK,SAAS,EAAE;gBACjC,WAAW,CAAC,QAAQ,GAAG,cAAc,CAAC;aACtC;YAED,OAAO,IAAA,2BAAmB,EACzB;gBACC,IAAI,EAAE,iBAAiB;gBACvB,MAAM,EAAE,QAAQ,CAAC,MAAM;gBACvB,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,MAAM,EAAE,cAAc;gBACtB,MAAM,EAAE,WAAW;aACnB,EACD,UAAU,CACV,CAAC;SACF;QAED,OAAO,IAAA,oBAAY,EAAC,IAAA,2BAAmB,EAAC,kBAAkB,EAAE,UAAU,CAAC,EAAE,MAAM,CAAC,CAAC;KACjF;IACD,IAAI,IAAA,6BAAqB,EAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,CAAC,EAAE;QACjE,MAAM,mBAAmB,GAAG,IAAA,yBAAiB,EAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,IAAA,sBAAc,EAAC,OAAO,CAAC,EAAE;YAC5B,IAAI,IAAA,0BAAQ,EAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,IAAA,2BAAS,EAAC,mBAAmB,CAAC,MAAM,CAAC,EAAE;gBAClF,IAAA,mBAAM,EAAC,IAAA,0BAAQ,EAAC,OAAO,CAAC,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBAC5D,WAAW,CACV,WAAW,EACX,iCAAgB,CAAC,MAAM,EACvB,IAAA,mBAAW,EAAC,OAAO,EAAE,MAAM,CAAC,EAC5B,mBAAmB,CAAC,KAAK,EACzB;oBACC,QAAQ,EAAE,mBAAmB,CAAC,MAAM,CAAC,QAAQ;oBAC7C,OAAO,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE;iBACtC,CACD,CAAC;aACF;YAED,MAAM,cAAc,GAAG,IAAA,oBAAY,EAClC,IAAA,sBAAc,EACb;gBACC,GAAG,mBAAmB,CAAC,MAAM;gBAC7B,MAAM,EAAE,mBAAmB,CAAC,MAAM;gBAClC,KAAK,EAAE,mBAAmB,CAAC,KAAK;aAChC,EACD,UAAU,CACV,EACD,mBAAmB,CAAC,MAAM,CAAC,QAAQ,CACnC,CAAC;YACF,OAAO,cAAc,CAAC;SACtB;aAAM;YACN,uEAAuE;YACvE,IAAA,mBAAM,EAAC,OAAO,CAAC,IAAI,KAAK,oBAAY,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;YACxE,OAAO,IAAA,sBAAc,EAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;SAC5C;KACD;IAED,IAAI,CAAC,IAAA,yBAAiB,EAAC,QAAQ,CAAC,IAAI,CAAC,IAAA,yBAAiB,EAAC,OAAO,CAAC,EAAE;QAChE,IAAI,IAAA,kBAAU,EAAC,QAAQ,CAAC,EAAE;YACzB,OAAO,IAAA,sBAAc,EAAC,OAAO,EAAE,UAAU,CAAC,CAAC;SAC3C;aAAM,IAAI,IAAA,kBAAU,EAAC,OAAO,CAAC,EAAE;YAC/B,OAAO,IAAA,sBAAc,EAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;SAC5C;QACD,OAAO,cAAc,CACpB,OAAO,CAAC,KAAK,EACb,UAAU,EACV,IAAA,sBAAc,EAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,CAAC,CAC9C,CAAC;KACF;SAAM,IAAI,CAAC,IAAA,yBAAiB,EAAC,QAAQ,CAAC,EAAE;QACxC,OAAO,IAAA,oBAAY,EAAC,IAAA,sBAAc,EAAC,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,CAAC,CAAC;KACjE;SAAM,IAAI,CAAC,IAAA,yBAAiB,EAAC,OAAO,CAAC,EAAE;QACvC,OAAO,IAAA,sBAAc,EAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;KAC5C;SAAM,IAAI,IAAA,0BAAkB,EAAC,QAAQ,CAAC,EAAE;QACxC,IAAA,mBAAM,EAAC,IAAA,gBAAQ,EAAC,OAAO,CAAC,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAC5D,IAAA,mBAAM,EAAC,IAAA,gBAAQ,EAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAEjE,MAAM,MAAM,GAAG,IAAA,yBAAiB,EAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAA,yBAAiB,EAAC,IAAA,oBAAY,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;QAEhE,IAAI,IAAA,0BAAQ,EAAC,MAAM,CAAC,IAAI,IAAA,2BAAS,EAAC,MAAM,CAAC,EAAE;YAC1C,MAAM,WAAW,GAAG,IAAA,mBAAW,EAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACnD,MAAM,SAAS,GAAG,IAAA,mBAAW,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAE9C,WAAW,CACV,WAAW,EACX,iCAAgB,CAAC,MAAM,EACvB,WAAW,EACX,QAAQ,CAAC,KAAK,EACd,SAAS,CACT,CAAC;YAEF,WAAW,CACV,WAAW,EACX,iCAAgB,CAAC,WAAW,EAC5B,SAAS,EACT,QAAQ,CAAC,KAAK,EACd,WAAW,CACX,CAAC;YAEF,8EAA8E;YAC9E,sCAAsC;YACtC,OAAO,MAAM,CAAC,aAAa,CAAC;YAC5B,OAAO,MAAM,CAAC,aAAa,CAAC;SAC5B;QAED,IAAI,IAAA,uBAAe,EAAC,IAAA,uBAAe,EAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE;YACzF,0EAA0E;YAC1E,OAAO,IAAA,sBAAc,EAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,CAAC;SACtF;QACD,OAAO,IAAA,2BAAmB,EACzB;YACC,IAAI,EAAE,iBAAiB;YACvB,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,MAAM;YACN,MAAM;SACN,EACD,UAAU,CACV,CAAC;KACF;SAAM;QACN,IAAI,IAAA,4BAAU,EAAC,QAAQ,CAAC,IAAI,IAAA,4BAAU,EAAC,OAAO,CAAC,EAAE;YAChD,6FAA6F;YAC7F,MAAM,WAAW,GAAG,IAAA,gCAAc,EACjC,WAAW,EACX,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,EAAE,EACX,QAAQ,CAAC,KAAK,CACd,CAAC;YAEF,yGAAyG;YACzG,kFAAkF;YAClF,sEAAsE;YACtE,MAAM,OAAO,GAA0C;gBACtD,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,iBAAiB,EAAE;oBAClB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;oBAC3B,OAAO,EAAE,QAAQ,CAAC,EAAE;iBACpB;gBACD,OAAO,EAAE,mBAAmB,CAAC,UAAU,EAAE,WAAW,EAAE,YAAY,CAAC;aACnE,CAAC;YACF,OAAO,OAAO,CAAC;SACf;QACD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC9B,OAAO,cAAc,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;KAC1C;AACF,CAAC;AAED,SAAS,cAAc,CACtB,MAAc,EACd,UAAmC,EACnC,MAAqB;IAErB,MAAM,IAAI,GAAoC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChE,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,IAAA,mBAAM,EAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,oDAAoD,CAAC,CAAC;QACjF,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC;KAC1B;IACD,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;KACrB;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAC3B,UAAmC,EACnC,SAAgD,EAChD,YAA6C;IAE7C,IAAI,SAAS,KAAK,SAAS,EAAE;QAC5B,OAAO,UAAU,CAAC;KAClB;SAAM,IAAI,UAAU,KAAK,SAAS,EAAE;QACpC,OAAO,YAAY,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;KACjC;SAAM;QACN,OAAO,YAAY,CAAC,CAAC,IAAA,qBAAc,EAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;KAC7D;AACF,CAAC;AAED,SAAS,WAAW,CACnB,IAAW,EACX,QAAiC,EACjC,YAA6C;IAE7C,MAAM,MAAM,GAAG,IAAA,iBAAS,EAAC,IAAI,CAAC,CAAC;IAC/B,IACC,MAAM,CAAC,MAAM,KAAK,SAAS;QAC3B,MAAM,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS;QACpC,QAAQ,KAAK,SAAS,EACrB;QACD,IAAA,gBAAS,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;KAC7C;IAED,IAAA,mBAAW,EAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9B,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE;QACjC,MAAM,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC,IAAA,gBAAS,EAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrE,OAAO,MAAM,CAAC;KACd;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAgB,YAAY,CAC3B,KAA4B,EAC5B,YAA6C,EAC7C,KAAkB,EAClB,OAA0B;IAE1B,OAAO,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,OAAuC,CAAC,CAAC;AACpF,CAAC;AAPD,oCAOC;AAED,SAAS,aAAa,CACrB,KAA4B,EAC5B,YAA6C,EAC7C,WAAyC;IAEzC,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAe,CAAC;IACnD,MAAM,KAAK,GAAG,IAAI,qBAAS,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,sBAAe,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC1F,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CACvC,CAAC;IAEF,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAoD,CAAC;QAC/E,IAAI,IAAI,CAAC,iBAAiB,KAAK,SAAS,EAAE;YACzC,uGAAuG;YACvG,qDAAqD;YACrD,OAAO,IAAI,CAAC,iBAAiB,CAAC;SAC9B;QACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;KACnB;IAED,OAAO,OAAO,CAAC,IAAI,CAAC;AACrB,CAAC;AAED,MAAa,YAAY;IAIxB,YACC,YAAqC,EACrC,SAAuB,EACN,WAAoC,EACrD,QAAsB,EACtB,KAAkB,EAClB,WAA+B,EACd,gBAAwC,EACzD,cAAwE;QALvD,gBAAW,GAAX,WAAW,CAAyB;QAIpC,qBAAgB,GAAhB,gBAAgB,CAAwB;QAGzD,IAAI,CAAC,SAAS,GAAG,IAAI,qBAAS,CAC7B,SAAS,EACT,YAAY,EACZ,WAAW,EACX,IAAI,EACJ,KAAK,EACL,cAAc,CACd,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,IAAI,qBAAS,CAC5B,QAAQ,EACR,WAAW,EACX,WAAW,EACX,IAAI,EACJ,KAAK,EACL,cAAc,CACd,CAAC;IACH,CAAC;IAEM,OAAO;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;IAC5D,CAAC;IAEM,GAAG;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACrC,IAAI,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE;YACpD,OAAO,EAAE,CAAC;SACV;aAAM,IAAI,QAAQ,KAAK,SAAS,EAAE;YAClC,oEAAoE;YACpE,MAAM,MAAM,GAAG,IAAA,sBAAc,EAAC,OAAQ,CAAC,CAAC;YACxC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;SAC/B;aAAM,IAAI,OAAO,KAAK,SAAS,EAAE;YACjC,MAAM,MAAM,GAAG,IAAA,uBAAe,EAAC,QAAQ,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SAChC;aAAM,IAAI,IAAA,2BAAmB,EAAC,QAAQ,CAAC,IAAI,IAAA,0BAAkB,EAAC,OAAO,CAAC,EAAE;YACxE,MAAM,UAAU,GACf,IAAA,uBAAe,EAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC;gBACzE,IAAA,WAAI,EAAC,4BAA4B,CAAC,CAAC;YAEpC,IAAI,IAAA,wBAAgB,EAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,EAAE;gBACpE,+FAA+F;gBAC/F,uEAAuE;gBACvE,oHAAoH;gBACpH,wEAAwE;gBACxE,6DAA6D;gBAC7D,IAAA,mBAAM,EACL,IAAA,mBAAW,EAAC,OAAO,CAAC,EACpB,KAAK,CAAC,gEAAgE,CACtE,CAAC;gBACF,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;aACzB;YAED,MAAM,GAAG,GAAG,oBAAoB,CAC/B,UAAU,EACV,QAAQ,CAAC,KAAK,EACd,OAAO,EACP,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,gBAAgB,CACrB,CAAC;YACF,IAAI,GAAG,GAAG,CAAC,EAAE;gBACZ,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;aACtD;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE;gBACnB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;aACnD;iBAAM;gBACN,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;aAC1B;SACD;aAAM,IAAI,IAAA,2BAAmB,EAAC,QAAQ,CAAC,EAAE;YACzC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;SAC1B;aAAM,IAAI,IAAA,0BAAkB,EAAC,OAAO,CAAC,EAAE;YACvC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;SACzB;aAAM;YACN,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;SAC1B;IACF,CAAC;IAEO,WAAW,CAAC,SAAiB,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QAC1C,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC1E,CAAC;IAEO,UAAU,CAAC,SAAiB,CAAC;QACpC,OAAO;YACN,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS;YACpD,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE;SAChC,CAAC;IACH,CAAC;IAEO,WAAW;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACrC,IAAA,mBAAM,EACL,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAC/C,KAAK,CAAC,+DAA+D,CACrE,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QACvD,OAAO;YACN,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YAC5C,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC;SAC1C,CAAC;IACH,CAAC;CACD;AAlHD,oCAkHC;AAOD,+DAA+D;AAC/D;;;;;;;GAOG;AACH,SAAS,oBAAoB,CAC5B,UAAkB,EAClB,aAAqB,EACrB,OAAoC,EACpC,YAAqC,EACrC,QAAgC;IAEhC,MAAM,SAAS,GAAG,IAAA,sBAAc,EAAC,OAAO,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IAClE,IAAA,mBAAM,EAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACjE,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,CAAC,QAAQ,EAAE;QAC/C,MAAM,UAAU,GAAG,IAAA,oCAA4B,EAC9C,UAAU,EACV,aAAa,EACb,SAAS,EACT,OAAO,CAAC,KAAK,CACb,CAAC;QAEF,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,UAAU,CAAC;SAClB;KACD;IAED,MAAM,YAAY,GAAG,IAAA,4BAAoB,EACxC,UAAU,CAAC,OAAO,EAClB,SAAS,CAAC,QAAQ,EAClB,SAAS,CAAC,OAAO,EACjB,OAAO,CAAC,KAAK,CACb,CAAC;IACF,IAAI,YAAY,KAAK,SAAS,EAAE;QAC/B,OAAO,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;KACnD;IAED,MAAM,WAAW,GAAG,IAAA,4BAAoB,EACvC,SAAS,CAAC,OAAO,EACjB,UAAU,CAAC,QAAQ,EACnB,UAAU,CAAC,OAAO,EAClB,aAAa,CACb,CAAC;IACF,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC;KACjD;IAED,MAAM,GAAG,GAAG,IAAA,uBAAe,EAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACnD,IAAI,GAAG,KAAK,CAAC,EAAE;QACd,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;KACjC;IAED,IAAA,mBAAM,EACL,UAAU,CAAC,QAAQ,KAAK,SAAS,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,EACrE,KAAK,CAAC,yCAAyC,CAC/C,CAAC;IAEF,IAAI,CAAC,IAAA,mBAAW,EAAC,OAAO,CAAC,EAAE;QAC1B,uEAAuE;QACvE,qFAAqF;QAErF,gCAAgC;QAChC,UAAU;QACV,mCAAmC;QACnC,+CAA+C;QAC/C,KAAK;QAEL,gGAAgG;QAChG,+BAA+B;QAC/B,OAAO,CAAC,QAAQ,CAAC;KACjB;IAED,MAAM,gBAAgB,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC/D,MAAM,iBAAiB,GAAG,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IACjE,IAAA,mBAAM,EACL,gBAAgB,KAAK,SAAS,EAC9B,KAAK,CAAC,mEAAmE,CACzE,CAAC;IAEF,mDAAmD;IACnD,OAAO,CAAC,iBAAiB,IAAI,CAAC,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;AACnF,CAAC;AAED,yEAAyE;AACzE,SAAS,cAAc,CACtB,WAA+B,EAC/B,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAgB,EACvC,WAAc,EACd,cAAuC,EACvC,cAAqC;IAErC,MAAM,MAAM,GAAG,iCAAgB,CAAC,MAAM,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,MAAM,GAAG,IAAA,+BAAa,EAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC9E,IAAI,SAAwB,CAAC;IAC7B,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE;QAC/B,MAAM,UAAU,GACf,MAAM,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS;YACrC,CAAC,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,IAAA,gBAAS,EAAC,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC;YACpF,CAAC,CAAC,WAAW,CAAC;QAChB,SAAS,GAAG,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,IAAA,qBAAc,EAAC,UAAU,CAAC,EAAE,CAAC;KACzE;SAAM;QACN,SAAS,GAAG,EAAE,WAAW,EAAE,IAAA,gBAAS,EAAC,WAAW,EAAE,cAAc,CAAC,EAAE,CAAC;KACpE;IACD,IAAA,+BAAa,EAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC;AAED,SAAS,WAAW,CACnB,WAAqC,EACrC,MAAwB,EACxB,EAAgB,EAChB,KAAa,EACb,QAAsB;IAEtB,MAAM,MAAM,GAAG,IAAA,+BAAa,EAAC,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAClF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC;IAC5F,IAAA,+BAAa,EAAC,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAEtF,MAAM,cAAc,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7C,IAAI,cAAc,GAAG,CAAC,EAAE;QACvB,WAAW,CACV,WAAW,EACX,MAAM,EACN,kBAAkB,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EACrC,cAAc,EACd,kBAAkB,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAC3C,CAAC;KACF;AACF,CAAC;AAED,SAAS,kBAAkB,CAAC,EAAgB,EAAE,MAAc;IAC3D,OAAO,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC;AACvD,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\tChangeAtomId,\n\tmakeAnonChange,\n\tRevisionMetadataSource,\n\tRevisionTag,\n\ttagChange,\n\tTaggedChange,\n} from \"../../core\";\nimport { asMutable, brand, fail, fakeIdAllocator, IdAllocator } from \"../../util\";\nimport { CrossFieldManager, CrossFieldTarget } from \"../modular-schema\";\nimport {\n\tChangeset,\n\tMark,\n\tMarkList,\n\tNoopMarkType,\n\tCellId,\n\tNoopMark,\n\tCellMark,\n\tDetach,\n} from \"./types\";\nimport { MarkListFactory } from \"./markListFactory\";\nimport { MarkQueue } from \"./markQueue\";\nimport {\n\tgetMoveEffect,\n\tsetMoveEffect,\n\tisMoveMark,\n\tMoveEffectTable,\n\tgetModifyAfter,\n\tMoveEffect,\n\tisMoveIn,\n\tisMoveOut,\n\tgetMoveIn,\n} from \"./moveEffectTable\";\nimport {\n\tgetInputLength,\n\tgetOutputLength,\n\tisNoopMark,\n\tgetOffsetInCellRange,\n\tcloneMark,\n\tareOutputCellsEmpty,\n\tareInputCellsEmpty,\n\tcompareLineages,\n\tisDetach,\n\tmarkHasCellEffect,\n\twithNodeChange,\n\twithRevision,\n\tmarkEmptiesCells,\n\tisNewAttach,\n\tgetInputCellId,\n\tisAttach,\n\tgetOutputCellId,\n\tmarkFillsCells,\n\textractMarkEffect,\n\tgetEndpoint,\n\tareEqualCellIds,\n\taddRevision,\n\tnormalizeCellRename,\n\tasAttachAndDetach,\n\tisImpactfulCellRename,\n\tsettleMark,\n\tcompareCellsFromSameRevision,\n} from \"./utils\";\nimport { EmptyInputCellMark, VestigialEndpoint } from \"./helperTypes\";\n\n/**\n * @internal\n */\nexport type NodeChangeComposer<TNodeChange> = (changes: TaggedChange<TNodeChange>[]) => TNodeChange;\n\n/**\n * Composes a sequence of changesets into a single changeset.\n * @param changes - The changesets to be applied.\n * Parts of the input may be reused in the output, but the input is not mutated.\n * Each changeset in the list is assumed to be applicable after the previous one.\n * @returns A changeset that is equivalent to applying each of the given `changes` in order.\n *\n * WARNING! This implementation is incomplete:\n * - Tombstone information is ignored.\n * - Support for moves is not implemented.\n * - Support for slices is not implemented.\n */\nexport function compose<TNodeChange>(\n\tchanges: TaggedChange<Changeset<TNodeChange>>[],\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n\tgenId: IdAllocator,\n\tmanager: CrossFieldManager,\n\trevisionMetadata: RevisionMetadataSource,\n): Changeset<TNodeChange> {\n\tlet composed: Changeset<TNodeChange> = [];\n\tfor (const change of changes) {\n\t\tcomposed = composeMarkLists(\n\t\t\tcomposed,\n\t\t\tchange.revision,\n\t\t\tchange.change,\n\t\t\tcomposeChild,\n\t\t\tgenId,\n\t\t\tmanager as MoveEffectTable<TNodeChange>,\n\t\t\trevisionMetadata,\n\t\t);\n\t}\n\treturn composed;\n}\n\nfunction composeMarkLists<TNodeChange>(\n\tbaseMarkList: MarkList<TNodeChange>,\n\tnewRev: RevisionTag | undefined,\n\tnewMarkList: MarkList<TNodeChange>,\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n\tgenId: IdAllocator,\n\tmoveEffects: MoveEffectTable<TNodeChange>,\n\trevisionMetadata: RevisionMetadataSource,\n): MarkList<TNodeChange> {\n\tconst factory = new MarkListFactory<TNodeChange>();\n\tconst queue = new ComposeQueue(\n\t\tundefined,\n\t\tbaseMarkList,\n\t\tnewRev,\n\t\tnewMarkList,\n\t\tgenId,\n\t\tmoveEffects,\n\t\trevisionMetadata,\n\t\t(a, b) => composeChildChanges(a, b, composeChild),\n\t);\n\twhile (!queue.isEmpty()) {\n\t\tconst { baseMark, newMark } = queue.pop();\n\t\tif (newMark === undefined) {\n\t\t\tassert(\n\t\t\t\tbaseMark !== undefined,\n\t\t\t\t0x4db /* Non-empty queue should not return two undefined marks */,\n\t\t\t);\n\t\t\tfactory.push(baseMark);\n\t\t} else {\n\t\t\t// We only compose changesets that will not be further rebased.\n\t\t\t// It is therefore safe to remove any intentions that have no impact in the context they apply to.\n\t\t\tconst settledNewMark = settleMark(newMark, newRev, revisionMetadata);\n\t\t\tif (baseMark === undefined) {\n\t\t\t\tfactory.push(composeMark(settledNewMark, newRev, composeChild));\n\t\t\t} else {\n\t\t\t\t// Past this point, we are guaranteed that `settledNewMark` and `baseMark` have the same length and\n\t\t\t\t// start at the same location in the revision after the base changes.\n\t\t\t\t// They therefore refer to the same range for that revision.\n\t\t\t\tconst composedMark = composeMarks(\n\t\t\t\t\tbaseMark,\n\t\t\t\t\tnewRev,\n\t\t\t\t\tsettledNewMark,\n\t\t\t\t\tcomposeChild,\n\t\t\t\t\tgenId,\n\t\t\t\t\tmoveEffects,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tfactory.push(composedMark);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn factory.list;\n}\n\n/**\n * Composes two marks where `newMark` is based on the state produced by `baseMark`.\n * @param baseMark - The mark to compose with `newMark`.\n * Its output range should be the same as `newMark`'s input range.\n * @param newRev - The revision the new mark is part of.\n * @param newMark - The mark to compose with `baseMark`.\n * Its input range should be the same as `baseMark`'s output range.\n * @returns A mark that is equivalent to applying both `baseMark` and `newMark` successively.\n */\nfunction composeMarks<TNodeChange>(\n\tbaseMark: Mark<TNodeChange>,\n\tnewRev: RevisionTag | undefined,\n\tnewMark: Mark<TNodeChange>,\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n\tgenId: IdAllocator,\n\tmoveEffects: MoveEffectTable<TNodeChange>,\n\trevisionMetadata: RevisionMetadataSource,\n): Mark<TNodeChange> {\n\tlet nodeChange = composeChildChanges(\n\t\tbaseMark.changes,\n\t\tnewMark.changes === undefined ? undefined : tagChange(newMark.changes, newRev),\n\t\tcomposeChild,\n\t);\n\tif (nodeChange !== undefined) {\n\t\tconst baseSource = getMoveIn(baseMark);\n\t\tif (baseSource !== undefined) {\n\t\t\tsetModifyAfter(\n\t\t\t\tmoveEffects,\n\t\t\t\tgetEndpoint(baseSource, undefined),\n\t\t\t\tnodeChange,\n\t\t\t\tnewRev,\n\t\t\t\tcomposeChild,\n\t\t\t);\n\t\t\tnodeChange = undefined;\n\t\t}\n\t}\n\tif (isImpactfulCellRename(newMark, newRev, revisionMetadata)) {\n\t\tconst newAttachAndDetach = asAttachAndDetach(newMark);\n\t\tconst newDetachRevision = newAttachAndDetach.detach.revision ?? newRev;\n\t\tif (markEmptiesCells(baseMark)) {\n\t\t\tif (isMoveIn(newAttachAndDetach.attach) && isMoveOut(newAttachAndDetach.detach)) {\n\t\t\t\tassert(isMoveOut(baseMark), 0x808 /* Unexpected mark type */);\n\n\t\t\t\t// The base changeset and new changeset both move these nodes.\n\t\t\t\t// Call the original position of the nodes A, the position after the base changeset is applied B,\n\t\t\t\t// and the position after the new changeset is applied C.\n\t\t\t\t// The new changeset moves the nodes from B, temporarily returns them to A, and then moves them to C.\n\t\t\t\t// The composition of the base and new changesets will be a move directly from A to C,\n\t\t\t\t// since the move from A to B cancels out with the return from B to A.\n\t\t\t\t// This if-block is handling marks at A.\n\t\t\t\t// When we compose the marks at B we will link the start of the base move (A to B)\n\t\t\t\t// with the end of the new move (B to C).\n\t\t\t\t// Because we are replacing the mark representing the start of the move with the new changeset's\n\t\t\t\t// move-out from A, we update the base move-in at B to consider that its start point.\n\t\t\t\tsetEndpoint(\n\t\t\t\t\tmoveEffects,\n\t\t\t\t\tCrossFieldTarget.Destination,\n\t\t\t\t\tgetEndpoint(baseMark, undefined),\n\t\t\t\t\tbaseMark.count,\n\t\t\t\t\t{ revision: newDetachRevision, localId: newAttachAndDetach.detach.id },\n\t\t\t\t);\n\t\t\t}\n\n\t\t\t// baseMark is a detach which cancels with the attach portion of the AttachAndDetach,\n\t\t\t// so we are just left with the detach portion of the AttachAndDetach.\n\t\t\tconst newDetach: CellMark<Detach, TNodeChange> & Partial<VestigialEndpoint> = {\n\t\t\t\t...newAttachAndDetach.detach,\n\t\t\t\tcount: baseMark.count,\n\t\t\t};\n\t\t\t// We may need to apply effects to the source location of the base MoveOut so we annotate the mark with\n\t\t\t// information about that location.\n\t\t\tif (isMoveOut(baseMark)) {\n\t\t\t\tnewDetach.vestigialEndpoint = {\n\t\t\t\t\trevision: baseMark.revision,\n\t\t\t\t\tlocalId: baseMark.id,\n\t\t\t\t};\n\t\t\t}\n\t\t\treturn withRevision(withNodeChange(newDetach, nodeChange), newDetachRevision);\n\t\t}\n\n\t\tif (isImpactfulCellRename(baseMark, undefined, revisionMetadata)) {\n\t\t\tconst baseAttachAndDetach = asAttachAndDetach(baseMark);\n\t\t\tconst newOutputId = getOutputCellId(newAttachAndDetach, newRev, revisionMetadata);\n\t\t\tif (areEqualCellIds(newOutputId, baseAttachAndDetach.cellId)) {\n\t\t\t\treturn withNodeChange(\n\t\t\t\t\t{ count: baseAttachAndDetach.count, cellId: baseAttachAndDetach.cellId },\n\t\t\t\t\tnodeChange,\n\t\t\t\t);\n\t\t\t}\n\n\t\t\t// `newMark`'s attach portion cancels with `baseMark`'s detach portion.\n\t\t\tconst originalAttach = { ...baseAttachAndDetach.attach };\n\t\t\tconst finalDetach = { ...newAttachAndDetach.detach };\n\t\t\tconst detachRevision = finalDetach.revision ?? newRev;\n\t\t\tif (detachRevision !== undefined) {\n\t\t\t\tfinalDetach.revision = detachRevision;\n\t\t\t}\n\n\t\t\treturn normalizeCellRename(\n\t\t\t\t{\n\t\t\t\t\ttype: \"AttachAndDetach\",\n\t\t\t\t\tcellId: baseMark.cellId,\n\t\t\t\t\tcount: baseMark.count,\n\t\t\t\t\tattach: originalAttach,\n\t\t\t\t\tdetach: finalDetach,\n\t\t\t\t},\n\t\t\t\tnodeChange,\n\t\t\t);\n\t\t}\n\n\t\treturn withRevision(normalizeCellRename(newAttachAndDetach, nodeChange), newRev);\n\t}\n\tif (isImpactfulCellRename(baseMark, undefined, revisionMetadata)) {\n\t\tconst baseAttachAndDetach = asAttachAndDetach(baseMark);\n\t\tif (markFillsCells(newMark)) {\n\t\t\tif (isMoveIn(baseAttachAndDetach.attach) && isMoveOut(baseAttachAndDetach.detach)) {\n\t\t\t\tassert(isMoveIn(newMark), 0x809 /* Unexpected mark type */);\n\t\t\t\tsetEndpoint(\n\t\t\t\t\tmoveEffects,\n\t\t\t\t\tCrossFieldTarget.Source,\n\t\t\t\t\tgetEndpoint(newMark, newRev),\n\t\t\t\t\tbaseAttachAndDetach.count,\n\t\t\t\t\t{\n\t\t\t\t\t\trevision: baseAttachAndDetach.attach.revision,\n\t\t\t\t\t\tlocalId: baseAttachAndDetach.attach.id,\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tconst originalAttach = withRevision(\n\t\t\t\twithNodeChange(\n\t\t\t\t\t{\n\t\t\t\t\t\t...baseAttachAndDetach.attach,\n\t\t\t\t\t\tcellId: baseAttachAndDetach.cellId,\n\t\t\t\t\t\tcount: baseAttachAndDetach.count,\n\t\t\t\t\t},\n\t\t\t\t\tnodeChange,\n\t\t\t\t),\n\t\t\t\tbaseAttachAndDetach.attach.revision,\n\t\t\t);\n\t\t\treturn originalAttach;\n\t\t} else {\n\t\t\t// Other mark types have been handled by previous conditional branches.\n\t\t\tassert(newMark.type === NoopMarkType, 0x80a /* Unexpected mark type */);\n\t\t\treturn withNodeChange(baseMark, nodeChange);\n\t\t}\n\t}\n\n\tif (!markHasCellEffect(baseMark) && !markHasCellEffect(newMark)) {\n\t\tif (isNoopMark(baseMark)) {\n\t\t\treturn withNodeChange(newMark, nodeChange);\n\t\t} else if (isNoopMark(newMark)) {\n\t\t\treturn withNodeChange(baseMark, nodeChange);\n\t\t}\n\t\treturn createNoopMark(\n\t\t\tnewMark.count,\n\t\t\tnodeChange,\n\t\t\tgetInputCellId(baseMark, undefined, undefined),\n\t\t);\n\t} else if (!markHasCellEffect(baseMark)) {\n\t\treturn withRevision(withNodeChange(newMark, nodeChange), newRev);\n\t} else if (!markHasCellEffect(newMark)) {\n\t\treturn withNodeChange(baseMark, nodeChange);\n\t} else if (areInputCellsEmpty(baseMark)) {\n\t\tassert(isDetach(newMark), 0x71c /* Unexpected mark type */);\n\t\tassert(isAttach(baseMark), 0x71d /* Expected generative mark */);\n\n\t\tconst attach = extractMarkEffect(baseMark);\n\t\tconst detach = extractMarkEffect(withRevision(newMark, newRev));\n\n\t\tif (isMoveIn(attach) && isMoveOut(detach)) {\n\t\t\tconst finalSource = getEndpoint(attach, undefined);\n\t\t\tconst finalDest = getEndpoint(detach, newRev);\n\n\t\t\tsetEndpoint(\n\t\t\t\tmoveEffects,\n\t\t\t\tCrossFieldTarget.Source,\n\t\t\t\tfinalSource,\n\t\t\t\tbaseMark.count,\n\t\t\t\tfinalDest,\n\t\t\t);\n\n\t\t\tsetEndpoint(\n\t\t\t\tmoveEffects,\n\t\t\t\tCrossFieldTarget.Destination,\n\t\t\t\tfinalDest,\n\t\t\t\tbaseMark.count,\n\t\t\t\tfinalSource,\n\t\t\t);\n\n\t\t\t// The `finalEndpoint` field of AttachAndDetach move effect pairs is not used,\n\t\t\t// so we remove it as a normalization.\n\t\t\tdelete attach.finalEndpoint;\n\t\t\tdelete detach.finalEndpoint;\n\t\t}\n\n\t\tif (areEqualCellIds(getOutputCellId(newMark, newRev, revisionMetadata), baseMark.cellId)) {\n\t\t\t// The output and input cell IDs are the same, so this mark has no effect.\n\t\t\treturn withNodeChange({ count: baseMark.count, cellId: baseMark.cellId }, nodeChange);\n\t\t}\n\t\treturn normalizeCellRename(\n\t\t\t{\n\t\t\t\ttype: \"AttachAndDetach\",\n\t\t\t\tcellId: baseMark.cellId,\n\t\t\t\tcount: baseMark.count,\n\t\t\t\tattach,\n\t\t\t\tdetach,\n\t\t\t},\n\t\t\tnodeChange,\n\t\t);\n\t} else {\n\t\tif (isMoveMark(baseMark) && isMoveMark(newMark)) {\n\t\t\t// The marks must be inverses, since `newMark` is filling the cells which `baseMark` emptied.\n\t\t\tconst nodeChanges = getModifyAfter(\n\t\t\t\tmoveEffects,\n\t\t\t\tbaseMark.revision,\n\t\t\t\tbaseMark.id,\n\t\t\t\tbaseMark.count,\n\t\t\t);\n\n\t\t\t// We return a noop that is annotated with information about the endpoint it used to be because there may\n\t\t\t// be more node changes on `newMark`'s source mark which need to be included here.\n\t\t\t// We will remove the the annotation during `amendCompose` or pruning.\n\t\t\tconst vestige: Mark<TNodeChange> & VestigialEndpoint = {\n\t\t\t\tcount: baseMark.count,\n\t\t\t\tvestigialEndpoint: {\n\t\t\t\t\trevision: baseMark.revision,\n\t\t\t\t\tlocalId: baseMark.id,\n\t\t\t\t},\n\t\t\t\tchanges: composeChildChanges(nodeChange, nodeChanges, composeChild),\n\t\t\t};\n\t\t\treturn vestige;\n\t\t}\n\t\tconst length = baseMark.count;\n\t\treturn createNoopMark(length, nodeChange);\n\t}\n}\n\nfunction createNoopMark<TNodeChange>(\n\tlength: number,\n\tnodeChange: TNodeChange | undefined,\n\tcellId?: ChangeAtomId,\n): Mark<TNodeChange> {\n\tconst mark: CellMark<NoopMark, TNodeChange> = { count: length };\n\tif (nodeChange !== undefined) {\n\t\tassert(length === 1, 0x692 /* A mark with a node change must have length one */);\n\t\tmark.changes = nodeChange;\n\t}\n\tif (cellId !== undefined) {\n\t\tmark.cellId = cellId;\n\t}\n\treturn mark;\n}\n\nfunction composeChildChanges<TNodeChange>(\n\tbaseChange: TNodeChange | undefined,\n\tnewChange: TaggedChange<TNodeChange> | undefined,\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n): TNodeChange | undefined {\n\tif (newChange === undefined) {\n\t\treturn baseChange;\n\t} else if (baseChange === undefined) {\n\t\treturn composeChild([newChange]);\n\t} else {\n\t\treturn composeChild([makeAnonChange(baseChange), newChange]);\n\t}\n}\n\nfunction composeMark<TNodeChange, TMark extends Mark<TNodeChange>>(\n\tmark: TMark,\n\trevision: RevisionTag | undefined,\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n): TMark {\n\tconst cloned = cloneMark(mark);\n\tif (\n\t\tcloned.cellId !== undefined &&\n\t\tcloned.cellId.revision === undefined &&\n\t\trevision !== undefined\n\t) {\n\t\tasMutable(cloned.cellId).revision = revision;\n\t}\n\n\taddRevision(cloned, revision);\n\tif (cloned.changes !== undefined) {\n\t\tcloned.changes = composeChild([tagChange(cloned.changes, revision)]);\n\t\treturn cloned;\n\t}\n\n\treturn cloned;\n}\n\nexport function amendCompose<TNodeChange>(\n\tmarks: MarkList<TNodeChange>,\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n\tgenId: IdAllocator,\n\tmanager: CrossFieldManager,\n): MarkList<TNodeChange> {\n\treturn amendComposeI(marks, composeChild, manager as MoveEffectTable<TNodeChange>);\n}\n\nfunction amendComposeI<TNodeChange>(\n\tmarks: MarkList<TNodeChange>,\n\tcomposeChild: NodeChangeComposer<TNodeChange>,\n\tmoveEffects: MoveEffectTable<TNodeChange>,\n): MarkList<TNodeChange> {\n\tconst factory = new MarkListFactory<TNodeChange>();\n\tconst queue = new MarkQueue(marks, undefined, moveEffects, true, fakeIdAllocator, (a, b) =>\n\t\tcomposeChildChanges(a, b, composeChild),\n\t);\n\n\twhile (!queue.isEmpty()) {\n\t\tconst mark = queue.dequeue() as Mark<TNodeChange> & Partial<VestigialEndpoint>;\n\t\tif (mark.vestigialEndpoint !== undefined) {\n\t\t\t// Any effects that target this endpoint should have been applied either during the first compose pass,\n\t\t\t// or during the `MarkQueue`'s reading for this pass.\n\t\t\tdelete mark.vestigialEndpoint;\n\t\t}\n\t\tfactory.push(mark);\n\t}\n\n\treturn factory.list;\n}\n\nexport class ComposeQueue<T> {\n\tprivate readonly baseMarks: MarkQueue<T>;\n\tprivate readonly newMarks: MarkQueue<T>;\n\n\tpublic constructor(\n\t\tbaseRevision: RevisionTag | undefined,\n\t\tbaseMarks: Changeset<T>,\n\t\tprivate readonly newRevision: RevisionTag | undefined,\n\t\tnewMarks: Changeset<T>,\n\t\tgenId: IdAllocator,\n\t\tmoveEffects: MoveEffectTable<T>,\n\t\tprivate readonly revisionMetadata: RevisionMetadataSource,\n\t\tcomposeChanges?: (a: T | undefined, b: TaggedChange<T>) => T | undefined,\n\t) {\n\t\tthis.baseMarks = new MarkQueue(\n\t\t\tbaseMarks,\n\t\t\tbaseRevision,\n\t\t\tmoveEffects,\n\t\t\ttrue,\n\t\t\tgenId,\n\t\t\tcomposeChanges,\n\t\t);\n\t\tthis.newMarks = new MarkQueue(\n\t\t\tnewMarks,\n\t\t\tnewRevision,\n\t\t\tmoveEffects,\n\t\t\ttrue,\n\t\t\tgenId,\n\t\t\tcomposeChanges,\n\t\t);\n\t}\n\n\tpublic isEmpty(): boolean {\n\t\treturn this.baseMarks.isEmpty() && this.newMarks.isEmpty();\n\t}\n\n\tpublic pop(): ComposeMarks<T> {\n\t\tconst baseMark = this.baseMarks.peek();\n\t\tconst newMark = this.newMarks.peek();\n\t\tif (baseMark === undefined && newMark === undefined) {\n\t\t\treturn {};\n\t\t} else if (baseMark === undefined) {\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tconst length = getInputLength(newMark!);\n\t\t\treturn this.dequeueNew(length);\n\t\t} else if (newMark === undefined) {\n\t\t\tconst length = getOutputLength(baseMark);\n\t\t\treturn this.dequeueBase(length);\n\t\t} else if (areOutputCellsEmpty(baseMark) && areInputCellsEmpty(newMark)) {\n\t\t\tconst baseCellId: ChangeAtomId =\n\t\t\t\tgetOutputCellId(baseMark, this.baseMarks.revision, this.revisionMetadata) ??\n\t\t\t\tfail(\"Expected defined output ID\");\n\n\t\t\tif (markEmptiesCells(baseMark) && baseCellId.revision === undefined) {\n\t\t\t\t// The base revision should always be defined except when squashing changes into a transaction.\n\t\t\t\t// In the future, we want to support reattaches in the new change here.\n\t\t\t\t// We will need to be able to order the base mark relative to the new mark by looking at the lineage of the new mark\n\t\t\t\t// (which will be obtained by rebasing the reattach over interim changes\n\t\t\t\t// (which requires the local changes to have a revision tag))\n\t\t\t\tassert(\n\t\t\t\t\tisNewAttach(newMark),\n\t\t\t\t\t0x695 /* TODO: Assign revision tags to each change in a transaction */,\n\t\t\t\t);\n\t\t\t\treturn this.dequeueNew();\n\t\t\t}\n\n\t\t\tconst cmp = compareCellPositions(\n\t\t\t\tbaseCellId,\n\t\t\t\tbaseMark.count,\n\t\t\t\tnewMark,\n\t\t\t\tthis.newRevision,\n\t\t\t\tthis.revisionMetadata,\n\t\t\t);\n\t\t\tif (cmp < 0) {\n\t\t\t\treturn { baseMark: this.baseMarks.dequeueUpTo(-cmp) };\n\t\t\t} else if (cmp > 0) {\n\t\t\t\treturn { newMark: this.newMarks.dequeueUpTo(cmp) };\n\t\t\t} else {\n\t\t\t\treturn this.dequeueBoth();\n\t\t\t}\n\t\t} else if (areOutputCellsEmpty(baseMark)) {\n\t\t\treturn this.dequeueBase();\n\t\t} else if (areInputCellsEmpty(newMark)) {\n\t\t\treturn this.dequeueNew();\n\t\t} else {\n\t\t\treturn this.dequeueBoth();\n\t\t}\n\t}\n\n\tprivate dequeueBase(length: number = 0): ComposeMarks<T> {\n\t\tconst baseMark = this.baseMarks.dequeue();\n\t\treturn { baseMark, newMark: length > 0 ? { count: length } : undefined };\n\t}\n\n\tprivate dequeueNew(length: number = 0): ComposeMarks<T> {\n\t\treturn {\n\t\t\tbaseMark: length > 0 ? { count: length } : undefined,\n\t\t\tnewMark: this.newMarks.dequeue(),\n\t\t};\n\t}\n\n\tprivate dequeueBoth(): ComposeMarks<T> {\n\t\tconst baseMark = this.baseMarks.peek();\n\t\tconst newMark = this.newMarks.peek();\n\t\tassert(\n\t\t\tbaseMark !== undefined && newMark !== undefined,\n\t\t\t0x697 /* Cannot dequeue both unless both mark queues are non-empty */,\n\t\t);\n\t\tconst length = Math.min(newMark.count, baseMark.count);\n\t\treturn {\n\t\t\tbaseMark: this.baseMarks.dequeueUpTo(length),\n\t\t\tnewMark: this.newMarks.dequeueUpTo(length),\n\t\t};\n\t}\n}\n\ninterface ComposeMarks<T> {\n\tbaseMark?: Mark<T>;\n\tnewMark?: Mark<T>;\n}\n\n// TODO: Try to share more logic with the version in rebase.ts.\n/**\n * Returns a number N which encodes how the cells of the two marks are aligned.\n * - If N is zero, then the first cell of `baseMark` is the same as the first cell of `newMark`.\n * - If N is positive, then the first N cells of `newMark` (or all its cells if N is greater than its length)\n * are before the first cell of `baseMark`.\n * - If N is negative, then the first N cells of `baseMark` (or all its cells if N is greater than its length)\n * are before the first cell of `newMark`.\n */\nfunction compareCellPositions(\n\tbaseCellId: CellId,\n\tbaseCellCount: number,\n\tnewMark: EmptyInputCellMark<unknown>,\n\tnewIntention: RevisionTag | undefined,\n\tmetadata: RevisionMetadataSource,\n): number {\n\tconst newCellId = getInputCellId(newMark, newIntention, metadata);\n\tassert(newCellId !== undefined, 0x71f /* Should have cell ID */);\n\tif (baseCellId.revision === newCellId.revision) {\n\t\tconst comparison = compareCellsFromSameRevision(\n\t\t\tbaseCellId,\n\t\t\tbaseCellCount,\n\t\t\tnewCellId,\n\t\t\tnewMark.count,\n\t\t);\n\n\t\tif (comparison !== undefined) {\n\t\t\treturn comparison;\n\t\t}\n\t}\n\n\tconst offsetInBase = getOffsetInCellRange(\n\t\tbaseCellId.lineage,\n\t\tnewCellId.revision,\n\t\tnewCellId.localId,\n\t\tnewMark.count,\n\t);\n\tif (offsetInBase !== undefined) {\n\t\treturn offsetInBase > 0 ? offsetInBase : -Infinity;\n\t}\n\n\tconst offsetInNew = getOffsetInCellRange(\n\t\tnewCellId.lineage,\n\t\tbaseCellId.revision,\n\t\tbaseCellId.localId,\n\t\tbaseCellCount,\n\t);\n\tif (offsetInNew !== undefined) {\n\t\treturn offsetInNew > 0 ? -offsetInNew : Infinity;\n\t}\n\n\tconst cmp = compareLineages(baseCellId, newCellId);\n\tif (cmp !== 0) {\n\t\treturn Math.sign(cmp) * Infinity;\n\t}\n\n\tassert(\n\t\tbaseCellId.revision !== undefined && newCellId.revision !== undefined,\n\t\t0x858 /* Cells should have defined revisions */,\n\t);\n\n\tif (!isNewAttach(newMark)) {\n\t\t// If `newMark` were targeting a cell older than the composition window\n\t\t// there would be lineage determining the relative order of `newCell` and `baseCell`.\n\n\t\t// TODO:6127: Enable this assert\n\t\t// assert(\n\t\t// \tnewRevisionIndex !== undefined,\n\t\t// \t\"Expected lineage to determine cell order\",\n\t\t// );\n\n\t\t// `newCell` was detached by a change in this composition, so there will be a corresponding mark\n\t\t// later in the base changeset.\n\t\treturn -Infinity;\n\t}\n\n\tconst newRevisionIndex = metadata.getIndex(newCellId.revision);\n\tconst baseRevisionIndex = metadata.getIndex(baseCellId.revision);\n\tassert(\n\t\tnewRevisionIndex !== undefined,\n\t\t0x859 /* A cell from a new attach should have a defined revision index */,\n\t);\n\n\t// We use the tiebreaking policy of the newer cell.\n\treturn (baseRevisionIndex ?? -Infinity) > newRevisionIndex ? -Infinity : Infinity;\n}\n\n// TODO: Reduce the duplication between this and other MoveEffect helpers\nfunction setModifyAfter<T>(\n\tmoveEffects: MoveEffectTable<T>,\n\t{ revision, localId: id }: ChangeAtomId,\n\tmodifyAfter: T,\n\tmodifyRevision: RevisionTag | undefined,\n\tcomposeChanges: NodeChangeComposer<T>,\n) {\n\tconst target = CrossFieldTarget.Source;\n\tconst count = 1;\n\tconst effect = getMoveEffect(moveEffects, target, revision, id, count, false);\n\tlet newEffect: MoveEffect<T>;\n\tif (effect.value !== undefined) {\n\t\tconst nodeChange =\n\t\t\teffect.value.modifyAfter !== undefined\n\t\t\t\t? composeChanges([effect.value.modifyAfter, tagChange(modifyAfter, modifyRevision)])\n\t\t\t\t: modifyAfter;\n\t\tnewEffect = { ...effect.value, modifyAfter: makeAnonChange(nodeChange) };\n\t} else {\n\t\tnewEffect = { modifyAfter: tagChange(modifyAfter, modifyRevision) };\n\t}\n\tsetMoveEffect(moveEffects, target, revision, id, count, newEffect);\n}\n\nfunction setEndpoint(\n\tmoveEffects: MoveEffectTable<unknown>,\n\ttarget: CrossFieldTarget,\n\tid: ChangeAtomId,\n\tcount: number,\n\tendpoint: ChangeAtomId,\n) {\n\tconst effect = getMoveEffect(moveEffects, target, id.revision, id.localId, count);\n\tconst newEffect = effect.value !== undefined ? { ...effect.value, endpoint } : { endpoint };\n\tsetMoveEffect(moveEffects, target, id.revision, id.localId, effect.length, newEffect);\n\n\tconst remainingCount = count - effect.length;\n\tif (remainingCount > 0) {\n\t\tsetEndpoint(\n\t\t\tmoveEffects,\n\t\t\ttarget,\n\t\t\toffsetChangeAtomId(id, effect.length),\n\t\t\tremainingCount,\n\t\t\toffsetChangeAtomId(endpoint, effect.length),\n\t\t);\n\t}\n}\n\nfunction offsetChangeAtomId(id: ChangeAtomId, offset: number): ChangeAtomId {\n\treturn { ...id, localId: brand(id.localId + offset) };\n}\n"]}