@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/feature-libraries/sequence-field/helperTypes.js

@@ -0,0 +1,13 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export function tryGetVestigialEndpoint(mark) {
+    const vestige = mark.vestigialEndpoint;
+    return vestige;
+}
+export function isVestigialEndpoint(mark) {
+    const vestige = mark.vestigialEndpoint;
+    return vestige !== undefined;
+}
+//# sourceMappingURL=helperTypes.js.map

package/lib/feature-libraries/sequence-field/helperTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helperTypes.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/helperTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA2CH,MAAM,UAAU,uBAAuB,CAAI,IAAa;IACvD,MAAM,OAAO,GAAI,IAAmC,CAAC,iBAAiB,CAAC;IACvE,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAClC,IAAwC;IAExC,MAAM,OAAO,GAAI,IAAmC,CAAC,iBAAiB,CAAC;IACvE,OAAO,OAAO,KAAK,SAAS,CAAC;AAC9B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ChangeAtomId } from \"../../core\";\nimport {\n\tCellId,\n\tHasMarkFields,\n\tDetach,\n\tMark,\n\tCellMark,\n\tAttachAndDetach,\n\tMoveIn,\n\tMoveOut,\n} from \"./types\";\n\nexport type EmptyInputCellMark<TNodeChange> = Mark<TNodeChange> & DetachedCellMark;\n\nexport interface DetachedCellMark extends HasMarkFields {\n\tcellId: CellId;\n}\n\nexport type EmptyOutputCellMark<TNodeChange> = CellMark<Detach | AttachAndDetach, TNodeChange>;\n\nexport type MoveMarkEffect = MoveOut | MoveIn;\nexport type DetachOfRemovedNodes = Detach & { cellId: CellId };\nexport type CellRename = AttachAndDetach | DetachOfRemovedNodes;\n\n/**\n * Some marks need to be tagged with information that specifies they used to be the endpoint of a\n * move that has since been cancelled out. This is needed so we can send and apply effects to such marks.\n * This information may be set on the following mark types:\n * - Noop\n * - Delete\n * - MoveOut\n *\n * Note that in the case of MoveOut, this makes the mark a potential receiver of effects from\n * both the MoveIn that corresponds to the MoveOut, and from the MoveIn that corresponds to the cancelled out MoveOut.\n */\nexport interface VestigialEndpoint {\n\tvestigialEndpoint: ChangeAtomId;\n}\n\nexport type VestigialEndpointMark<T> = Mark<T> & VestigialEndpoint;\n\nexport function tryGetVestigialEndpoint<T>(mark: Mark<T>): ChangeAtomId | undefined {\n\tconst vestige = (mark as Partial<VestigialEndpoint>).vestigialEndpoint;\n\treturn vestige;\n}\n\nexport function isVestigialEndpoint<T>(\n\tmark: Mark<T> | VestigialEndpointMark<T>,\n): mark is VestigialEndpointMark<T> {\n\tconst vestige = (mark as Partial<VestigialEndpoint>).vestigialEndpoint;\n\treturn vestige !== undefined;\n}\n"]}

package/lib/feature-libraries/sequence-field/index.d.ts

@@ -0,0 +1,18 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { Changeset, Delete, Detach, HasMoveId, HasRevisionTag, Insert, Mark, MarkList, MoveIn, MoveOut, NodeChangeType, CellCount as NodeCount, MoveId, Attach, NoopMark, LineageEvent, CellId, HasMarkFields, HasLineage, IdRange, CellMark, AttachAndDetach, } from "./types";
+export { SequenceFieldChangeHandler, sequenceFieldChangeHandler, } from "./sequenceFieldChangeHandler";
+export { SequenceChangeRebaser, sequenceFieldChangeRebaser } from "./sequenceFieldChangeRebaser";
+export { sequenceFieldChangeCodecFactory } from "./sequenceFieldCodecs";
+export { sequenceFieldToDelta, ToDelta } from "./sequenceFieldToDelta";
+export { SequenceFieldEditor, sequenceFieldEditor } from "./sequenceFieldEditor";
+export { MarkListFactory } from "./markListFactory";
+export { NodeChangeRebaser, rebase } from "./rebase";
+export { invert, NodeChangeInverter } from "./invert";
+export { amendCompose, compose, NodeChangeComposer } from "./compose";
+export { areComposable, areRebasable, getInputLength, isDetach, DetachedNodeTracker, newCrossFieldTable, newMoveEffectTable, CrossFieldTable, cloneMark, extractMarkEffect, } from "./utils";
+export { isMoveMark, MoveMark, MoveEffectTable, MoveEffect } from "./moveEffectTable";
+export { relevantRemovedRoots } from "./relevantRemovedRoots";
+//# sourceMappingURL=index.d.ts.map

package/lib/feature-libraries/sequence-field/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,SAAS,EACT,MAAM,EACN,MAAM,EACN,SAAS,EACT,cAAc,EACd,MAAM,EACN,IAAI,EACJ,QAAQ,EACR,MAAM,EACN,OAAO,EACP,cAAc,EACd,SAAS,IAAI,SAAS,EACtB,MAAM,EACN,MAAM,EACN,QAAQ,EACR,YAAY,EACZ,MAAM,EACN,aAAa,EACb,UAAU,EACV,OAAO,EACP,QAAQ,EACR,eAAe,GACf,MAAM,SAAS,CAAC;AACjB,OAAO,EACN,0BAA0B,EAC1B,0BAA0B,GAC1B,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAAE,qBAAqB,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AACjG,OAAO,EAAE,+BAA+B,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,EAAE,oBAAoB,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACvE,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AACjF,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AACrD,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACtE,OAAO,EACN,aAAa,EACb,YAAY,EACZ,cAAc,EACd,QAAQ,EACR,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAClB,eAAe,EACf,SAAS,EACT,iBAAiB,GACjB,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEtF,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC"}

package/lib/feature-libraries/sequence-field/index.js

@@ -0,0 +1,17 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { sequenceFieldChangeHandler, } from "./sequenceFieldChangeHandler";
+export { sequenceFieldChangeRebaser } from "./sequenceFieldChangeRebaser";
+export { sequenceFieldChangeCodecFactory } from "./sequenceFieldCodecs";
+export { sequenceFieldToDelta } from "./sequenceFieldToDelta";
+export { sequenceFieldEditor } from "./sequenceFieldEditor";
+export { MarkListFactory } from "./markListFactory";
+export { rebase } from "./rebase";
+export { invert } from "./invert";
+export { amendCompose, compose } from "./compose";
+export { areComposable, areRebasable, getInputLength, isDetach, DetachedNodeTracker, newCrossFieldTable, newMoveEffectTable, cloneMark, extractMarkEffect, } from "./utils";
+export { isMoveMark } from "./moveEffectTable";
+export { relevantRemovedRoots } from "./relevantRemovedRoots";
+//# sourceMappingURL=index.js.map

package/lib/feature-libraries/sequence-field/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA0BH,OAAO,EAEN,0BAA0B,GAC1B,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAAyB,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AACjG,OAAO,EAAE,+BAA+B,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,EAAE,oBAAoB,EAAW,MAAM,wBAAwB,CAAC;AACvE,OAAO,EAAuB,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AACjF,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAqB,MAAM,EAAE,MAAM,UAAU,CAAC;AACrD,OAAO,EAAE,MAAM,EAAsB,MAAM,UAAU,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,OAAO,EAAsB,MAAM,WAAW,CAAC;AACtE,OAAO,EACN,aAAa,EACb,YAAY,EACZ,cAAc,EACd,QAAQ,EACR,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAElB,SAAS,EACT,iBAAiB,GACjB,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,UAAU,EAAyC,MAAM,mBAAmB,CAAC;AAEtF,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tChangeset,\n\tDelete,\n\tDetach,\n\tHasMoveId,\n\tHasRevisionTag,\n\tInsert,\n\tMark,\n\tMarkList,\n\tMoveIn,\n\tMoveOut,\n\tNodeChangeType,\n\tCellCount as NodeCount,\n\tMoveId,\n\tAttach,\n\tNoopMark,\n\tLineageEvent,\n\tCellId,\n\tHasMarkFields,\n\tHasLineage,\n\tIdRange,\n\tCellMark,\n\tAttachAndDetach,\n} from \"./types\";\nexport {\n\tSequenceFieldChangeHandler,\n\tsequenceFieldChangeHandler,\n} from \"./sequenceFieldChangeHandler\";\nexport { SequenceChangeRebaser, sequenceFieldChangeRebaser } from \"./sequenceFieldChangeRebaser\";\nexport { sequenceFieldChangeCodecFactory } from \"./sequenceFieldCodecs\";\nexport { sequenceFieldToDelta, ToDelta } from \"./sequenceFieldToDelta\";\nexport { SequenceFieldEditor, sequenceFieldEditor } from \"./sequenceFieldEditor\";\nexport { MarkListFactory } from \"./markListFactory\";\nexport { NodeChangeRebaser, rebase } from \"./rebase\";\nexport { invert, NodeChangeInverter } from \"./invert\";\nexport { amendCompose, compose, NodeChangeComposer } from \"./compose\";\nexport {\n\tareComposable,\n\tareRebasable,\n\tgetInputLength,\n\tisDetach,\n\tDetachedNodeTracker,\n\tnewCrossFieldTable,\n\tnewMoveEffectTable,\n\tCrossFieldTable,\n\tcloneMark,\n\textractMarkEffect,\n} from \"./utils\";\nexport { isMoveMark, MoveMark, MoveEffectTable, MoveEffect } from \"./moveEffectTable\";\n\nexport { relevantRemovedRoots } from \"./relevantRemovedRoots\";\n"]}

package/lib/feature-libraries/sequence-field/invert.d.ts

@@ -0,0 +1,19 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { RevisionMetadataSource, TaggedChange } from "../../core";
+import { IdAllocator } from "../../util";
+import { CrossFieldManager } from "../modular-schema";
+import { Changeset } from "./types";
+export type NodeChangeInverter<TNodeChange> = (change: TNodeChange) => TNodeChange;
+/**
+ * Inverts a given changeset.
+ * @param change - The changeset to produce the inverse of.
+ * @returns The inverse of the given `change` such that the inverse can be applied after `change`.
+ *
+ * WARNING! This implementation is incomplete:
+ * - Support for slices is not implemented.
+ */
+export declare function invert<TNodeChange>(change: TaggedChange<Changeset<TNodeChange>>, invertChild: NodeChangeInverter<TNodeChange>, genId: IdAllocator, crossFieldManager: CrossFieldManager, revisionMetadata: RevisionMetadataSource): Changeset<TNodeChange>;
+//# sourceMappingURL=invert.d.ts.map

package/lib/feature-libraries/sequence-field/invert.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"invert.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/invert.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAgB,sBAAsB,EAAe,YAAY,EAAE,MAAM,YAAY,CAAC;AAC7F,OAAO,EAAE,WAAW,EAAQ,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAE,iBAAiB,EAAoB,MAAM,mBAAmB,CAAC;AACxE,OAAO,EACN,SAAS,EAUT,MAAM,SAAS,CAAC;AAkBjB,MAAM,MAAM,kBAAkB,CAAC,WAAW,IAAI,CAAC,MAAM,EAAE,WAAW,KAAK,WAAW,CAAC;AAEnF;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,WAAW,EACjC,MAAM,EAAE,YAAY,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,EAC5C,WAAW,EAAE,kBAAkB,CAAC,WAAW,CAAC,EAC5C,KAAK,EAAE,WAAW,EAClB,iBAAiB,EAAE,iBAAiB,EACpC,gBAAgB,EAAE,sBAAsB,GACtC,SAAS,CAAC,WAAW,CAAC,CAQxB"}

package/lib/feature-libraries/sequence-field/invert.js

@@ -0,0 +1,217 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert, unreachableCase } from "@fluidframework/core-utils";
+import { fail } from "../../util";
+import { CrossFieldTarget } from "../modular-schema";
+import { NoopMarkType, } from "./types";
+import { MarkListFactory } from "./markListFactory";
+import { areInputCellsEmpty, extractMarkEffect, getDetachOutputId, getEndpoint, getInputCellId, getOutputCellId, isAttach, isDetach, isImpactful, isReattach, normalizeCellRename, splitMark, withNodeChange, } from "./utils";
+/**
+ * Inverts a given changeset.
+ * @param change - The changeset to produce the inverse of.
+ * @returns The inverse of the given `change` such that the inverse can be applied after `change`.
+ *
+ * WARNING! This implementation is incomplete:
+ * - Support for slices is not implemented.
+ */
+export function invert(change, invertChild, genId, crossFieldManager, revisionMetadata) {
+    return invertMarkList(change.change, change.revision, invertChild, crossFieldManager, revisionMetadata);
+}
+function invertMarkList(markList, revision, invertChild, crossFieldManager, revisionMetadata) {
+    const inverseMarkList = new MarkListFactory();
+    for (const mark of markList) {
+        const inverseMarks = invertMark(mark, revision, invertChild, crossFieldManager, revisionMetadata);
+        inverseMarkList.push(...inverseMarks);
+    }
+    return inverseMarkList.list;
+}
+function invertMark(mark, revision, invertChild, crossFieldManager, revisionMetadata) {
+    if (!isImpactful(mark, revision, revisionMetadata)) {
+        return [invertNodeChangeOrSkip(mark.count, mark.changes, invertChild, mark.cellId)];
+    }
+    const type = mark.type;
+    switch (type) {
+        case NoopMarkType: {
+            const inverse = { ...mark };
+            if (mark.changes !== undefined) {
+                inverse.changes = invertChild(mark.changes);
+            }
+            return [inverse];
+        }
+        case "Delete": {
+            assert(revision !== undefined, 0x5a1 /* Unable to revert to undefined revision */);
+            const outputId = getOutputCellId(mark, revision, revisionMetadata);
+            const inverse = mark.cellId === undefined
+                ? {
+                    type: "Insert",
+                    id: mark.id,
+                    cellId: outputId,
+                    count: mark.count,
+                }
+                : {
+                    type: "Delete",
+                    id: mark.id,
+                    cellId: outputId,
+                    count: mark.count,
+                    redetachId: getInputCellId(mark, revision, revisionMetadata),
+                };
+            return [withNodeChange(inverse, invertNodeChange(mark.changes, invertChild))];
+        }
+        case "Insert": {
+            assert(mark.cellId !== undefined, 0x80c /* Active inserts should target empty cells */);
+            const deleteMark = {
+                type: "Delete",
+                count: mark.count,
+                id: mark.cellId.localId,
+            };
+            if (isReattach(mark)) {
+                deleteMark.redetachId = mark.cellId;
+            }
+            const inverse = withNodeChange(deleteMark, invertNodeChange(mark.changes, invertChild));
+            return [inverse];
+        }
+        case "MoveOut": {
+            if (mark.changes !== undefined) {
+                assert(mark.count === 1, 0x6ed /* Mark with changes can only target a single cell */);
+                const endpoint = getEndpoint(mark, revision);
+                crossFieldManager.set(CrossFieldTarget.Destination, endpoint.revision, endpoint.localId, mark.count, invertChild(mark.changes), true);
+            }
+            const cellId = getDetachOutputId(mark, mark.revision ?? revision ?? fail("Revision must be defined"), revisionMetadata) ?? {
+                revision: mark.revision ?? revision ?? fail("Revision must be defined"),
+                localId: mark.id,
+            };
+            const moveIn = {
+                type: "MoveIn",
+                id: mark.id,
+            };
+            if (mark.finalEndpoint !== undefined) {
+                moveIn.finalEndpoint = { localId: mark.finalEndpoint.localId };
+            }
+            let effect = moveIn;
+            if (areInputCellsEmpty(mark)) {
+                effect = {
+                    type: "AttachAndDetach",
+                    attach: moveIn,
+                    detach: {
+                        type: "Delete",
+                        id: mark.id,
+                        redetachId: getInputCellId(mark, revision, revisionMetadata),
+                    },
+                };
+            }
+            return [{ ...effect, count: mark.count, cellId }];
+        }
+        case "MoveIn": {
+            const invertedMark = {
+                type: "MoveOut",
+                id: mark.id,
+                count: mark.count,
+            };
+            if (mark.finalEndpoint) {
+                invertedMark.finalEndpoint = { localId: mark.finalEndpoint.localId };
+            }
+            if (isReattach(mark)) {
+                invertedMark.redetachId = mark.cellId;
+            }
+            return applyMovedChanges(invertedMark, revision, crossFieldManager);
+        }
+        case "AttachAndDetach": {
+            // Which should get the child change? Don't want to invert twice
+            const attach = {
+                count: mark.count,
+                cellId: mark.cellId,
+                ...mark.attach,
+            };
+            const idAfterAttach = getOutputCellId(attach, revision, undefined);
+            // We put `mark.changes` on the detach so that if it is a move source
+            // the changes can be sent to the endpoint.
+            const detach = {
+                count: mark.count,
+                cellId: idAfterAttach,
+                changes: mark.changes,
+                ...mark.detach,
+            };
+            const attachInverses = invertMark(attach, revision, invertChild, crossFieldManager, revisionMetadata);
+            const detachInverses = invertMark(detach, revision, invertChild, crossFieldManager, revisionMetadata);
+            if (detachInverses.length === 0) {
+                return attachInverses;
+            }
+            assert(detachInverses.length === 1, 0x80d /* Only expected MoveIn marks to be split when inverting */);
+            let detachInverse = detachInverses[0];
+            assert(isAttach(detachInverse), 0x80e /* Inverse of a detach should be an attach */);
+            const inverses = [];
+            for (const attachInverse of attachInverses) {
+                let detachInverseCurr = detachInverse;
+                if (attachInverse.count !== detachInverse.count) {
+                    [detachInverseCurr, detachInverse] = splitMark(detachInverse, attachInverse.count);
+                }
+                if (attachInverse.type === NoopMarkType) {
+                    if (attachInverse.changes !== undefined) {
+                        assert(detachInverseCurr.changes === undefined, 0x80f /* Unexpected node changes */);
+                        detachInverseCurr.changes = attachInverse.changes;
+                    }
+                    inverses.push(detachInverseCurr);
+                    continue;
+                }
+                assert(isDetach(attachInverse), 0x810 /* Inverse of an attach should be a detach */);
+                const inverted = {
+                    type: "AttachAndDetach",
+                    count: attachInverse.count,
+                    attach: extractMarkEffect(detachInverseCurr),
+                    detach: extractMarkEffect(attachInverse),
+                };
+                if (detachInverseCurr.cellId !== undefined) {
+                    inverted.cellId = detachInverseCurr.cellId;
+                }
+                if (detachInverseCurr.changes !== undefined) {
+                    inverted.changes = detachInverseCurr.changes;
+                }
+                if (attachInverse.changes !== undefined) {
+                    assert(inverted.changes === undefined, 0x811 /* Unexpected node changes */);
+                    inverted.changes = attachInverse.changes;
+                }
+                inverses.push(normalizeCellRename(inverted));
+            }
+            return inverses;
+        }
+        default:
+            unreachableCase(type);
+    }
+}
+function applyMovedChanges(mark, revision, manager) {
+    // Although this is a source mark, we query the destination because this was a destination mark during the original invert pass.
+    const entry = manager.get(CrossFieldTarget.Destination, mark.revision ?? revision, mark.id, mark.count, true);
+    if (entry.length < mark.count) {
+        const [mark1, mark2] = splitMark(mark, entry.length);
+        const mark1WithChanges = entry.value !== undefined
+            ? withNodeChange(mark1, entry.value)
+            : mark1;
+        return [mark1WithChanges, ...applyMovedChanges(mark2, revision, manager)];
+    }
+    if (entry.value !== undefined) {
+        return [
+            withNodeChange(mark, entry.value),
+        ];
+    }
+    return [mark];
+}
+function invertNodeChangeOrSkip(length, changes, inverter, detachEvent) {
+    if (changes !== undefined) {
+        assert(length === 1, 0x66c /* A modify mark must have length equal to one */);
+        const noop = {
+            count: 1,
+            changes: inverter(changes),
+        };
+        if (detachEvent !== undefined) {
+            noop.cellId = detachEvent;
+        }
+        return noop;
+    }
+    return { count: detachEvent === undefined ? length : 0 };
+}
+function invertNodeChange(change, inverter) {
+    return change === undefined ? undefined : inverter(change);
+}
+//# sourceMappingURL=invert.js.map

package/lib/feature-libraries/sequence-field/invert.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"invert.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/invert.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAErE,OAAO,EAAe,IAAI,EAAE,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAqB,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAIN,YAAY,GAOZ,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EACN,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,WAAW,EACX,cAAc,EACd,eAAe,EACf,QAAQ,EACR,QAAQ,EACR,WAAW,EACX,UAAU,EACV,mBAAmB,EACnB,SAAS,EACT,cAAc,GACd,MAAM,SAAS,CAAC;AAIjB;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CACrB,MAA4C,EAC5C,WAA4C,EAC5C,KAAkB,EAClB,iBAAoC,EACpC,gBAAwC;IAExC,OAAO,cAAc,CACpB,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,QAAQ,EACf,WAAW,EACX,iBAAmD,EACnD,gBAAgB,CAChB,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACtB,QAA+B,EAC/B,QAAiC,EACjC,WAA4C,EAC5C,iBAAiD,EACjD,gBAAwC;IAExC,MAAM,eAAe,GAAG,IAAI,eAAe,EAAe,CAAC;IAE3D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;QAC5B,MAAM,YAAY,GAAG,UAAU,CAC9B,IAAI,EACJ,QAAQ,EACR,WAAW,EACX,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;QACF,eAAe,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;KACtC;IAED,OAAO,eAAe,CAAC,IAAI,CAAC;AAC7B,CAAC;AAED,SAAS,UAAU,CAClB,IAAuB,EACvB,QAAiC,EACjC,WAA4C,EAC5C,iBAAiD,EACjD,gBAAwC;IAExC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,gBAAgB,CAAC,EAAE;QACnD,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;KACpF;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,QAAQ,IAAI,EAAE;QACb,KAAK,YAAY,CAAC,CAAC;YAClB,MAAM,OAAO,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;gBAC/B,OAAO,CAAC,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aAC5C;YACD,OAAO,CAAC,OAAO,CAAC,CAAC;SACjB;QACD,KAAK,QAAQ,CAAC,CAAC;YACd,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;YACnF,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YACnE,MAAM,OAAO,GACZ,IAAI,CAAC,MAAM,KAAK,SAAS;gBACxB,CAAC,CAAC;oBACA,IAAI,EAAE,QAAQ;oBACd,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,MAAM,EAAE,QAAQ;oBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;iBAChB;gBACH,CAAC,CAAC;oBACA,IAAI,EAAE,QAAQ;oBACd,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,MAAM,EAAE,QAAQ;oBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,UAAU,EAAE,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,gBAAgB,CAAC;iBAC3D,CAAC;YACN,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,gBAAgB,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;SAC9E;QACD,KAAK,QAAQ,CAAC,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;YACxF,MAAM,UAAU,GAAkC;gBACjD,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;aACvB,CAAC;YAEF,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE;gBACrB,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;aACpC;YAED,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,EAAE,gBAAgB,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;YACxF,OAAO,CAAC,OAAO,CAAC,CAAC;SACjB;QACD,KAAK,SAAS,CAAC,CAAC;YACf,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;gBAC/B,MAAM,CACL,IAAI,CAAC,KAAK,KAAK,CAAC,EAChB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;gBAEF,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC7C,iBAAiB,CAAC,GAAG,CACpB,gBAAgB,CAAC,WAAW,EAC5B,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,OAAO,EAChB,IAAI,CAAC,KAAK,EACV,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EACzB,IAAI,CACJ,CAAC;aACF;YAED,MAAM,MAAM,GAAG,iBAAiB,CAC/B,IAAI,EACJ,IAAI,CAAC,QAAQ,IAAI,QAAQ,IAAI,IAAI,CAAC,0BAA0B,CAAC,EAC7D,gBAAgB,CAChB,IAAI;gBACJ,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,QAAQ,IAAI,IAAI,CAAC,0BAA0B,CAAC;gBACvE,OAAO,EAAE,IAAI,CAAC,EAAE;aAChB,CAAC;YAEF,MAAM,MAAM,GAAW;gBACtB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,IAAI,CAAC,EAAE;aACX,CAAC;YAEF,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE;gBACrC,MAAM,CAAC,aAAa,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;aAC/D;YACD,IAAI,MAAM,GAAe,MAAM,CAAC;YAChC,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE;gBAC7B,MAAM,GAAG;oBACR,IAAI,EAAE,iBAAiB;oBACvB,MAAM,EAAE,MAAM;oBACd,MAAM,EAAE;wBACP,IAAI,EAAE,QAAQ;wBACd,EAAE,EAAE,IAAI,CAAC,EAAE;wBACX,UAAU,EAAE,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,gBAAgB,CAAC;qBAC5D;iBACD,CAAC;aACF;YACD,OAAO,CAAC,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;SAClD;QACD,KAAK,QAAQ,CAAC,CAAC;YACd,MAAM,YAAY,GAAmC;gBACpD,IAAI,EAAE,SAAS;gBACf,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;aACjB,CAAC;YAEF,IAAI,IAAI,CAAC,aAAa,EAAE;gBACvB,YAAY,CAAC,aAAa,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;aACrE;YAED,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE;gBACrB,YAAY,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;aACtC;YAED,OAAO,iBAAiB,CAAC,YAAY,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;SACpE;QACD,KAAK,iBAAiB,CAAC,CAAC;YACvB,gEAAgE;YAChE,MAAM,MAAM,GAAsB;gBACjC,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,GAAG,IAAI,CAAC,MAAM;aACd,CAAC;YACF,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEnE,qEAAqE;YACrE,2CAA2C;YAC3C,MAAM,MAAM,GAAsB;gBACjC,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,aAAa;gBACrB,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,GAAG,IAAI,CAAC,MAAM;aACd,CAAC;YACF,MAAM,cAAc,GAAG,UAAU,CAChC,MAAM,EACN,QAAQ,EACR,WAAW,EACX,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;YACF,MAAM,cAAc,GAAG,UAAU,CAChC,MAAM,EACN,QAAQ,EACR,WAAW,EACX,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;YAEF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;gBAChC,OAAO,cAAc,CAAC;aACtB;YAED,MAAM,CACL,cAAc,CAAC,MAAM,KAAK,CAAC,EAC3B,KAAK,CAAC,2DAA2D,CACjE,CAAC;YAEF,IAAI,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;YAErF,MAAM,QAAQ,GAAwB,EAAE,CAAC;YACzC,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE;gBAC3C,IAAI,iBAAiB,GAAsB,aAAa,CAAC;gBACzD,IAAI,aAAa,CAAC,KAAK,KAAK,aAAa,CAAC,KAAK,EAAE;oBAChD,CAAC,iBAAiB,EAAE,aAAa,CAAC,GAAG,SAAS,CAC7C,aAAa,EACb,aAAa,CAAC,KAAK,CACnB,CAAC;iBACF;gBAED,IAAI,aAAa,CAAC,IAAI,KAAK,YAAY,EAAE;oBACxC,IAAI,aAAa,CAAC,OAAO,KAAK,SAAS,EAAE;wBACxC,MAAM,CACL,iBAAiB,CAAC,OAAO,KAAK,SAAS,EACvC,KAAK,CAAC,6BAA6B,CACnC,CAAC;wBACF,iBAAiB,CAAC,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC;qBAClD;oBACD,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;oBACjC,SAAS;iBACT;gBACD,MAAM,CACL,QAAQ,CAAC,aAAa,CAAC,EACvB,KAAK,CAAC,6CAA6C,CACnD,CAAC;gBAEF,MAAM,QAAQ,GAAsB;oBACnC,IAAI,EAAE,iBAAiB;oBACvB,KAAK,EAAE,aAAa,CAAC,KAAK;oBAC1B,MAAM,EAAE,iBAAiB,CAAC,iBAAiB,CAAC;oBAC5C,MAAM,EAAE,iBAAiB,CAAC,aAAa,CAAC;iBACxC,CAAC;gBAEF,IAAI,iBAAiB,CAAC,MAAM,KAAK,SAAS,EAAE;oBAC3C,QAAQ,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC;iBAC3C;gBAED,IAAI,iBAAiB,CAAC,OAAO,KAAK,SAAS,EAAE;oBAC5C,QAAQ,CAAC,OAAO,GAAG,iBAAiB,CAAC,OAAO,CAAC;iBAC7C;gBAED,IAAI,aAAa,CAAC,OAAO,KAAK,SAAS,EAAE;oBACxC,MAAM,CAAC,QAAQ,CAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,6BAA6B,CAAC,CAAC;oBAC5E,QAAQ,CAAC,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC;iBACzC;gBAED,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC;aAC7C;YAED,OAAO,QAAQ,CAAC;SAChB;QACD;YACC,eAAe,CAAC,IAAI,CAAC,CAAC;KACvB;AACF,CAAC;AAED,SAAS,iBAAiB,CACzB,IAAoC,EACpC,QAAiC,EACjC,OAAuC;IAEvC,gIAAgI;IAChI,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CACxB,gBAAgB,CAAC,WAAW,EAC5B,IAAI,CAAC,QAAQ,IAAI,QAAQ,EACzB,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,KAAK,EACV,IAAI,CACJ,CAAC;IAEF,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE;QAC9B,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,gBAAgB,GACrB,KAAK,CAAC,KAAK,KAAK,SAAS;YACxB,CAAC,CAAC,cAAc,CACd,KAAK,EACL,KAAK,CAAC,KAAK,CACV;YACH,CAAC,CAAC,KAAK,CAAC;QAEV,OAAO,CAAC,gBAAgB,EAAE,GAAG,iBAAiB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;KAC1E;IAED,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE;QAC9B,OAAO;YACN,cAAc,CAAuD,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC;SACvF,CAAC;KACF;IAED,OAAO,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,SAAS,sBAAsB,CAC9B,MAAc,EACd,OAAgC,EAChC,QAAyC,EACzC,WAA0B;IAE1B,IAAI,OAAO,KAAK,SAAS,EAAE;QAC1B,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,iDAAiD,CAAC,CAAC;QAC9E,MAAM,IAAI,GAAoC;YAC7C,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC;SAC1B,CAAC;QACF,IAAI,WAAW,KAAK,SAAS,EAAE;YAC9B,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;SAC1B;QACD,OAAO,IAAI,CAAC;KACZ;IAED,OAAO,EAAE,KAAK,EAAE,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,gBAAgB,CACxB,MAA+B,EAC/B,QAAyC;IAEzC,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAC5D,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, unreachableCase } from \"@fluidframework/core-utils\";\nimport { ChangeAtomId, RevisionMetadataSource, RevisionTag, TaggedChange } from \"../../core\";\nimport { IdAllocator, fail } from \"../../util\";\nimport { CrossFieldManager, CrossFieldTarget } from \"../modular-schema\";\nimport {\n\tChangeset,\n\tMark,\n\tMarkList,\n\tNoopMarkType,\n\tMoveOut,\n\tNoopMark,\n\tDelete,\n\tCellMark,\n\tMoveIn,\n\tMarkEffect,\n} from \"./types\";\nimport { MarkListFactory } from \"./markListFactory\";\nimport {\n\tareInputCellsEmpty,\n\textractMarkEffect,\n\tgetDetachOutputId,\n\tgetEndpoint,\n\tgetInputCellId,\n\tgetOutputCellId,\n\tisAttach,\n\tisDetach,\n\tisImpactful,\n\tisReattach,\n\tnormalizeCellRename,\n\tsplitMark,\n\twithNodeChange,\n} from \"./utils\";\n\nexport type NodeChangeInverter<TNodeChange> = (change: TNodeChange) => TNodeChange;\n\n/**\n * Inverts a given changeset.\n * @param change - The changeset to produce the inverse of.\n * @returns The inverse of the given `change` such that the inverse can be applied after `change`.\n *\n * WARNING! This implementation is incomplete:\n * - Support for slices is not implemented.\n */\nexport function invert<TNodeChange>(\n\tchange: TaggedChange<Changeset<TNodeChange>>,\n\tinvertChild: NodeChangeInverter<TNodeChange>,\n\tgenId: IdAllocator,\n\tcrossFieldManager: CrossFieldManager,\n\trevisionMetadata: RevisionMetadataSource,\n): Changeset<TNodeChange> {\n\treturn invertMarkList(\n\t\tchange.change,\n\t\tchange.revision,\n\t\tinvertChild,\n\t\tcrossFieldManager as CrossFieldManager<TNodeChange>,\n\t\trevisionMetadata,\n\t);\n}\n\nfunction invertMarkList<TNodeChange>(\n\tmarkList: MarkList<TNodeChange>,\n\trevision: RevisionTag | undefined,\n\tinvertChild: NodeChangeInverter<TNodeChange>,\n\tcrossFieldManager: CrossFieldManager<TNodeChange>,\n\trevisionMetadata: RevisionMetadataSource,\n): MarkList<TNodeChange> {\n\tconst inverseMarkList = new MarkListFactory<TNodeChange>();\n\n\tfor (const mark of markList) {\n\t\tconst inverseMarks = invertMark(\n\t\t\tmark,\n\t\t\trevision,\n\t\t\tinvertChild,\n\t\t\tcrossFieldManager,\n\t\t\trevisionMetadata,\n\t\t);\n\t\tinverseMarkList.push(...inverseMarks);\n\t}\n\n\treturn inverseMarkList.list;\n}\n\nfunction invertMark<TNodeChange>(\n\tmark: Mark<TNodeChange>,\n\trevision: RevisionTag | undefined,\n\tinvertChild: NodeChangeInverter<TNodeChange>,\n\tcrossFieldManager: CrossFieldManager<TNodeChange>,\n\trevisionMetadata: RevisionMetadataSource,\n): Mark<TNodeChange>[] {\n\tif (!isImpactful(mark, revision, revisionMetadata)) {\n\t\treturn [invertNodeChangeOrSkip(mark.count, mark.changes, invertChild, mark.cellId)];\n\t}\n\tconst type = mark.type;\n\tswitch (type) {\n\t\tcase NoopMarkType: {\n\t\t\tconst inverse = { ...mark };\n\t\t\tif (mark.changes !== undefined) {\n\t\t\t\tinverse.changes = invertChild(mark.changes);\n\t\t\t}\n\t\t\treturn [inverse];\n\t\t}\n\t\tcase \"Delete\": {\n\t\t\tassert(revision !== undefined, 0x5a1 /* Unable to revert to undefined revision */);\n\t\t\tconst outputId = getOutputCellId(mark, revision, revisionMetadata);\n\t\t\tconst inverse: Mark<TNodeChange> =\n\t\t\t\tmark.cellId === undefined\n\t\t\t\t\t? {\n\t\t\t\t\t\t\ttype: \"Insert\",\n\t\t\t\t\t\t\tid: mark.id,\n\t\t\t\t\t\t\tcellId: outputId,\n\t\t\t\t\t\t\tcount: mark.count,\n\t\t\t\t\t  }\n\t\t\t\t\t: {\n\t\t\t\t\t\t\ttype: \"Delete\",\n\t\t\t\t\t\t\tid: mark.id,\n\t\t\t\t\t\t\tcellId: outputId,\n\t\t\t\t\t\t\tcount: mark.count,\n\t\t\t\t\t\t\tredetachId: getInputCellId(mark, revision, revisionMetadata),\n\t\t\t\t\t  };\n\t\t\treturn [withNodeChange(inverse, invertNodeChange(mark.changes, invertChild))];\n\t\t}\n\t\tcase \"Insert\": {\n\t\t\tassert(mark.cellId !== undefined, 0x80c /* Active inserts should target empty cells */);\n\t\t\tconst deleteMark: CellMark<Delete, TNodeChange> = {\n\t\t\t\ttype: \"Delete\",\n\t\t\t\tcount: mark.count,\n\t\t\t\tid: mark.cellId.localId,\n\t\t\t};\n\n\t\t\tif (isReattach(mark)) {\n\t\t\t\tdeleteMark.redetachId = mark.cellId;\n\t\t\t}\n\n\t\t\tconst inverse = withNodeChange(deleteMark, invertNodeChange(mark.changes, invertChild));\n\t\t\treturn [inverse];\n\t\t}\n\t\tcase \"MoveOut\": {\n\t\t\tif (mark.changes !== undefined) {\n\t\t\t\tassert(\n\t\t\t\t\tmark.count === 1,\n\t\t\t\t\t0x6ed /* Mark with changes can only target a single cell */,\n\t\t\t\t);\n\n\t\t\t\tconst endpoint = getEndpoint(mark, revision);\n\t\t\t\tcrossFieldManager.set(\n\t\t\t\t\tCrossFieldTarget.Destination,\n\t\t\t\t\tendpoint.revision,\n\t\t\t\t\tendpoint.localId,\n\t\t\t\t\tmark.count,\n\t\t\t\t\tinvertChild(mark.changes),\n\t\t\t\t\ttrue,\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tconst cellId = getDetachOutputId(\n\t\t\t\tmark,\n\t\t\t\tmark.revision ?? revision ?? fail(\"Revision must be defined\"),\n\t\t\t\trevisionMetadata,\n\t\t\t) ?? {\n\t\t\t\trevision: mark.revision ?? revision ?? fail(\"Revision must be defined\"),\n\t\t\t\tlocalId: mark.id,\n\t\t\t};\n\n\t\t\tconst moveIn: MoveIn = {\n\t\t\t\ttype: \"MoveIn\",\n\t\t\t\tid: mark.id,\n\t\t\t};\n\n\t\t\tif (mark.finalEndpoint !== undefined) {\n\t\t\t\tmoveIn.finalEndpoint = { localId: mark.finalEndpoint.localId };\n\t\t\t}\n\t\t\tlet effect: MarkEffect = moveIn;\n\t\t\tif (areInputCellsEmpty(mark)) {\n\t\t\t\teffect = {\n\t\t\t\t\ttype: \"AttachAndDetach\",\n\t\t\t\t\tattach: moveIn,\n\t\t\t\t\tdetach: {\n\t\t\t\t\t\ttype: \"Delete\",\n\t\t\t\t\t\tid: mark.id,\n\t\t\t\t\t\tredetachId: getInputCellId(mark, revision, revisionMetadata),\n\t\t\t\t\t},\n\t\t\t\t};\n\t\t\t}\n\t\t\treturn [{ ...effect, count: mark.count, cellId }];\n\t\t}\n\t\tcase \"MoveIn\": {\n\t\t\tconst invertedMark: CellMark<MoveOut, TNodeChange> = {\n\t\t\t\ttype: \"MoveOut\",\n\t\t\t\tid: mark.id,\n\t\t\t\tcount: mark.count,\n\t\t\t};\n\n\t\t\tif (mark.finalEndpoint) {\n\t\t\t\tinvertedMark.finalEndpoint = { localId: mark.finalEndpoint.localId };\n\t\t\t}\n\n\t\t\tif (isReattach(mark)) {\n\t\t\t\tinvertedMark.redetachId = mark.cellId;\n\t\t\t}\n\n\t\t\treturn applyMovedChanges(invertedMark, revision, crossFieldManager);\n\t\t}\n\t\tcase \"AttachAndDetach\": {\n\t\t\t// Which should get the child change? Don't want to invert twice\n\t\t\tconst attach: Mark<TNodeChange> = {\n\t\t\t\tcount: mark.count,\n\t\t\t\tcellId: mark.cellId,\n\t\t\t\t...mark.attach,\n\t\t\t};\n\t\t\tconst idAfterAttach = getOutputCellId(attach, revision, undefined);\n\n\t\t\t// We put `mark.changes` on the detach so that if it is a move source\n\t\t\t// the changes can be sent to the endpoint.\n\t\t\tconst detach: Mark<TNodeChange> = {\n\t\t\t\tcount: mark.count,\n\t\t\t\tcellId: idAfterAttach,\n\t\t\t\tchanges: mark.changes,\n\t\t\t\t...mark.detach,\n\t\t\t};\n\t\t\tconst attachInverses = invertMark(\n\t\t\t\tattach,\n\t\t\t\trevision,\n\t\t\t\tinvertChild,\n\t\t\t\tcrossFieldManager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tconst detachInverses = invertMark(\n\t\t\t\tdetach,\n\t\t\t\trevision,\n\t\t\t\tinvertChild,\n\t\t\t\tcrossFieldManager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tif (detachInverses.length === 0) {\n\t\t\t\treturn attachInverses;\n\t\t\t}\n\n\t\t\tassert(\n\t\t\t\tdetachInverses.length === 1,\n\t\t\t\t0x80d /* Only expected MoveIn marks to be split when inverting */,\n\t\t\t);\n\n\t\t\tlet detachInverse = detachInverses[0];\n\t\t\tassert(isAttach(detachInverse), 0x80e /* Inverse of a detach should be an attach */);\n\n\t\t\tconst inverses: Mark<TNodeChange>[] = [];\n\t\t\tfor (const attachInverse of attachInverses) {\n\t\t\t\tlet detachInverseCurr: Mark<TNodeChange> = detachInverse;\n\t\t\t\tif (attachInverse.count !== detachInverse.count) {\n\t\t\t\t\t[detachInverseCurr, detachInverse] = splitMark(\n\t\t\t\t\t\tdetachInverse,\n\t\t\t\t\t\tattachInverse.count,\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\tif (attachInverse.type === NoopMarkType) {\n\t\t\t\t\tif (attachInverse.changes !== undefined) {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\tdetachInverseCurr.changes === undefined,\n\t\t\t\t\t\t\t0x80f /* Unexpected node changes */,\n\t\t\t\t\t\t);\n\t\t\t\t\t\tdetachInverseCurr.changes = attachInverse.changes;\n\t\t\t\t\t}\n\t\t\t\t\tinverses.push(detachInverseCurr);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tassert(\n\t\t\t\t\tisDetach(attachInverse),\n\t\t\t\t\t0x810 /* Inverse of an attach should be a detach */,\n\t\t\t\t);\n\n\t\t\t\tconst inverted: Mark<TNodeChange> = {\n\t\t\t\t\ttype: \"AttachAndDetach\",\n\t\t\t\t\tcount: attachInverse.count,\n\t\t\t\t\tattach: extractMarkEffect(detachInverseCurr),\n\t\t\t\t\tdetach: extractMarkEffect(attachInverse),\n\t\t\t\t};\n\n\t\t\t\tif (detachInverseCurr.cellId !== undefined) {\n\t\t\t\t\tinverted.cellId = detachInverseCurr.cellId;\n\t\t\t\t}\n\n\t\t\t\tif (detachInverseCurr.changes !== undefined) {\n\t\t\t\t\tinverted.changes = detachInverseCurr.changes;\n\t\t\t\t}\n\n\t\t\t\tif (attachInverse.changes !== undefined) {\n\t\t\t\t\tassert(inverted.changes === undefined, 0x811 /* Unexpected node changes */);\n\t\t\t\t\tinverted.changes = attachInverse.changes;\n\t\t\t\t}\n\n\t\t\t\tinverses.push(normalizeCellRename(inverted));\n\t\t\t}\n\n\t\t\treturn inverses;\n\t\t}\n\t\tdefault:\n\t\t\tunreachableCase(type);\n\t}\n}\n\nfunction applyMovedChanges<TNodeChange>(\n\tmark: CellMark<MoveOut, TNodeChange>,\n\trevision: RevisionTag | undefined,\n\tmanager: CrossFieldManager<TNodeChange>,\n): Mark<TNodeChange>[] {\n\t// Although this is a source mark, we query the destination because this was a destination mark during the original invert pass.\n\tconst entry = manager.get(\n\t\tCrossFieldTarget.Destination,\n\t\tmark.revision ?? revision,\n\t\tmark.id,\n\t\tmark.count,\n\t\ttrue,\n\t);\n\n\tif (entry.length < mark.count) {\n\t\tconst [mark1, mark2] = splitMark(mark, entry.length);\n\t\tconst mark1WithChanges =\n\t\t\tentry.value !== undefined\n\t\t\t\t? withNodeChange<CellMark<MoveOut, TNodeChange>, MoveOut, TNodeChange>(\n\t\t\t\t\t\tmark1,\n\t\t\t\t\t\tentry.value,\n\t\t\t\t  )\n\t\t\t\t: mark1;\n\n\t\treturn [mark1WithChanges, ...applyMovedChanges(mark2, revision, manager)];\n\t}\n\n\tif (entry.value !== undefined) {\n\t\treturn [\n\t\t\twithNodeChange<CellMark<MoveOut, TNodeChange>, MoveOut, TNodeChange>(mark, entry.value),\n\t\t];\n\t}\n\n\treturn [mark];\n}\n\nfunction invertNodeChangeOrSkip<TNodeChange>(\n\tlength: number,\n\tchanges: TNodeChange | undefined,\n\tinverter: NodeChangeInverter<TNodeChange>,\n\tdetachEvent?: ChangeAtomId,\n): Mark<TNodeChange> {\n\tif (changes !== undefined) {\n\t\tassert(length === 1, 0x66c /* A modify mark must have length equal to one */);\n\t\tconst noop: CellMark<NoopMark, TNodeChange> = {\n\t\t\tcount: 1,\n\t\t\tchanges: inverter(changes),\n\t\t};\n\t\tif (detachEvent !== undefined) {\n\t\t\tnoop.cellId = detachEvent;\n\t\t}\n\t\treturn noop;\n\t}\n\n\treturn { count: detachEvent === undefined ? length : 0 };\n}\n\nfunction invertNodeChange<TNodeChange>(\n\tchange: TNodeChange | undefined,\n\tinverter: NodeChangeInverter<TNodeChange>,\n): TNodeChange | undefined {\n\treturn change === undefined ? undefined : inverter(change);\n}\n"]}

package/lib/feature-libraries/sequence-field/markListFactory.d.ts

@@ -0,0 +1,21 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Mark, MarkList } from "./types";
+/**
+ * Helper class for constructing an offset list of marks that...
+ * - Does not insert offsets if there is no content after them
+ * - Does not insert 0-sized offsets
+ * - Merges runs of offsets together
+ * - Merges marks together
+ */
+export declare class MarkListFactory<TNodeChange> {
+    private offset;
+    readonly list: MarkList<TNodeChange>;
+    constructor();
+    push(...marks: Mark<TNodeChange>[]): void;
+    pushOffset(offset: number): void;
+    pushContent(mark: Mark<TNodeChange>): void;
+}
+//# sourceMappingURL=markListFactory.d.ts.map

package/lib/feature-libraries/sequence-field/markListFactory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"markListFactory.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/markListFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGzC;;;;;;GAMG;AACH,qBAAa,eAAe,CAAC,WAAW;IACvC,OAAO,CAAC,MAAM,CAAK;IACnB,SAAgB,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAM;;IAI1C,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI;IAMzC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIhC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI;CAsBjD"}

package/lib/feature-libraries/sequence-field/markListFactory.js

@@ -0,0 +1,51 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { isVestigialEndpoint } from "./helperTypes";
+import { isNoopMark, tryMergeMarks as tryMergeMarks } from "./utils";
+/**
+ * Helper class for constructing an offset list of marks that...
+ * - Does not insert offsets if there is no content after them
+ * - Does not insert 0-sized offsets
+ * - Merges runs of offsets together
+ * - Merges marks together
+ */
+export class MarkListFactory {
+    constructor() {
+        this.offset = 0;
+        this.list = [];
+    }
+    push(...marks) {
+        for (const item of marks) {
+            this.pushContent(item);
+        }
+    }
+    pushOffset(offset) {
+        this.offset += offset;
+    }
+    pushContent(mark) {
+        if (isNoopMark(mark) && mark.changes === undefined && !isVestigialEndpoint(mark)) {
+            // A noop targeting an empty cell can be omitted from the final mark list
+            if (mark.cellId === undefined) {
+                this.pushOffset(mark.count);
+            }
+        }
+        else {
+            if (this.offset > 0) {
+                this.list.push({ count: this.offset });
+                this.offset = 0;
+            }
+            const prev = this.list[this.list.length - 1];
+            if (prev !== undefined && prev.type === mark.type) {
+                const merged = tryMergeMarks(prev, mark);
+                if (merged !== undefined) {
+                    this.list.splice(this.list.length - 1, 1, merged);
+                    return;
+                }
+            }
+            this.list.push(mark);
+        }
+    }
+}
+//# sourceMappingURL=markListFactory.js.map

package/lib/feature-libraries/sequence-field/markListFactory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markListFactory.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/markListFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,aAAa,IAAI,aAAa,EAAE,MAAM,SAAS,CAAC;AAErE;;;;;;GAMG;AACH,MAAM,OAAO,eAAe;IAI3B;QAHQ,WAAM,GAAG,CAAC,CAAC;QACH,SAAI,GAA0B,EAAE,CAAC;IAE3B,CAAC;IAEhB,IAAI,CAAC,GAAG,KAA0B;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACzB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;SACvB;IACF,CAAC;IAEM,UAAU,CAAC,MAAc;QAC/B,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC;IACvB,CAAC;IAEM,WAAW,CAAC,IAAuB;QACzC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE;YACjF,yEAAyE;YACzE,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;gBAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC5B;SACD;aAAM;YACN,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;gBACvC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;aAChB;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;gBAClD,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACzC,IAAI,MAAM,KAAK,SAAS,EAAE;oBACzB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;oBAClD,OAAO;iBACP;aACD;YACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrB;IACF,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { isVestigialEndpoint } from \"./helperTypes\";\nimport { Mark, MarkList } from \"./types\";\nimport { isNoopMark, tryMergeMarks as tryMergeMarks } from \"./utils\";\n\n/**\n * Helper class for constructing an offset list of marks that...\n * - Does not insert offsets if there is no content after them\n * - Does not insert 0-sized offsets\n * - Merges runs of offsets together\n * - Merges marks together\n */\nexport class MarkListFactory<TNodeChange> {\n\tprivate offset = 0;\n\tpublic readonly list: MarkList<TNodeChange> = [];\n\n\tpublic constructor() {}\n\n\tpublic push(...marks: Mark<TNodeChange>[]): void {\n\t\tfor (const item of marks) {\n\t\t\tthis.pushContent(item);\n\t\t}\n\t}\n\n\tpublic pushOffset(offset: number): void {\n\t\tthis.offset += offset;\n\t}\n\n\tpublic pushContent(mark: Mark<TNodeChange>): void {\n\t\tif (isNoopMark(mark) && mark.changes === undefined && !isVestigialEndpoint(mark)) {\n\t\t\t// A noop targeting an empty cell can be omitted from the final mark list\n\t\t\tif (mark.cellId === undefined) {\n\t\t\t\tthis.pushOffset(mark.count);\n\t\t\t}\n\t\t} else {\n\t\t\tif (this.offset > 0) {\n\t\t\t\tthis.list.push({ count: this.offset });\n\t\t\t\tthis.offset = 0;\n\t\t\t}\n\t\t\tconst prev = this.list[this.list.length - 1];\n\t\t\tif (prev !== undefined && prev.type === mark.type) {\n\t\t\t\tconst merged = tryMergeMarks(prev, mark);\n\t\t\t\tif (merged !== undefined) {\n\t\t\t\t\tthis.list.splice(this.list.length - 1, 1, merged);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis.list.push(mark);\n\t\t}\n\t}\n}\n"]}

package/lib/feature-libraries/sequence-field/markQueue.d.ts

@@ -0,0 +1,30 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { RevisionTag, TaggedChange } from "../../core";
+import { IdAllocator } from "../../util";
+import { Mark } from "./types";
+import { MoveEffectTable } from "./moveEffectTable";
+export declare class MarkQueue<T> {
+    private readonly list;
+    readonly revision: RevisionTag | undefined;
+    private readonly moveEffects;
+    private readonly consumeEffects;
+    private readonly genId;
+    private readonly composeChanges?;
+    private readonly stack;
+    private index;
+    constructor(list: readonly Mark<T>[], revision: RevisionTag | undefined, moveEffects: MoveEffectTable<T>, consumeEffects: boolean, genId: IdAllocator, composeChanges?: ((a: T | undefined, b: TaggedChange<T>) => T | undefined) | undefined);
+    isEmpty(): boolean;
+    dequeue(): Mark<T>;
+    tryDequeue(): Mark<T> | undefined;
+    /**
+     * Dequeues the first `length` sized portion of the next mark.
+     * The caller must verify that the next mark (as returned by peek) is longer than this length.
+     * @param length - The length to dequeue, measured in the input context.
+     */
+    dequeueUpTo(length: number): Mark<T>;
+    peek(): Mark<T> | undefined;
+}
+//# sourceMappingURL=markQueue.d.ts.map

package/lib/feature-libraries/sequence-field/markQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"markQueue.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/markQueue.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAA0B,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG5E,qBAAa,SAAS,CAAC,CAAC;IAKtB,OAAO,CAAC,QAAQ,CAAC,IAAI;aACL,QAAQ,EAAE,WAAW,GAAG,SAAS;IACjD,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,cAAc;IAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC;IATjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiB;IACvC,OAAO,CAAC,KAAK,CAAK;gBAGA,IAAI,EAAE,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,EACzB,QAAQ,EAAE,WAAW,GAAG,SAAS,EAChC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAC/B,cAAc,EAAE,OAAO,EACvB,KAAK,EAAE,WAAW,EAClB,cAAc,CAAC,OAAM,CAAC,GAAG,SAAS,KAAK,aAAa,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,aAAA;IAKnF,OAAO,IAAI,OAAO;IAIlB,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;IAMlB,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS;IA6BxC;;;;OAIG;IACI,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IAWpC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS;CAOlC"}

package/lib/feature-libraries/sequence-field/markQueue.js

@@ -0,0 +1,70 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils";
+import { applyMoveEffectsToMark } from "./moveEffectTable";
+import { splitMark } from "./utils";
+export class MarkQueue {
+    constructor(list, revision, moveEffects, consumeEffects, genId, composeChanges) {
+        this.list = list;
+        this.revision = revision;
+        this.moveEffects = moveEffects;
+        this.consumeEffects = consumeEffects;
+        this.genId = genId;
+        this.composeChanges = composeChanges;
+        this.stack = [];
+        this.index = 0;
+        this.list = list;
+    }
+    isEmpty() {
+        return this.peek() === undefined;
+    }
+    dequeue() {
+        const output = this.tryDequeue();
+        assert(output !== undefined, 0x4e2 /* Unexpected end of mark queue */);
+        return output;
+    }
+    tryDequeue() {
+        if (this.stack.length > 0) {
+            return this.stack.pop();
+        }
+        else if (this.index < this.list.length) {
+            const mark = this.list[this.index++];
+            if (mark === undefined) {
+                return undefined;
+            }
+            const splitMarks = applyMoveEffectsToMark(mark, this.revision, this.moveEffects, this.consumeEffects, this.composeChanges);
+            if (splitMarks.length === 0) {
+                return undefined;
+            }
+            const result = splitMarks[0];
+            for (let i = splitMarks.length - 1; i > 0; i--) {
+                this.stack.push(splitMarks[i]);
+            }
+            return result;
+        }
+    }
+    /**
+     * Dequeues the first `length` sized portion of the next mark.
+     * The caller must verify that the next mark (as returned by peek) is longer than this length.
+     * @param length - The length to dequeue, measured in the input context.
+     */
+    dequeueUpTo(length) {
+        const mark = this.dequeue();
+        if (mark.count <= length) {
+            return mark;
+        }
+        const [mark1, mark2] = splitMark(mark, length);
+        this.stack.push(mark2);
+        return mark1;
+    }
+    peek() {
+        const mark = this.tryDequeue();
+        if (mark !== undefined) {
+            this.stack.push(mark);
+        }
+        return mark;
+    }
+}
+//# sourceMappingURL=markQueue.js.map

package/lib/feature-libraries/sequence-field/markQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markQueue.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/markQueue.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAIpD,OAAO,EAAE,sBAAsB,EAAmB,MAAM,mBAAmB,CAAC;AAC5E,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEpC,MAAM,OAAO,SAAS;IAIrB,YACkB,IAAwB,EACzB,QAAiC,EAChC,WAA+B,EAC/B,cAAuB,EACvB,KAAkB,EAClB,cAAwE;QALxE,SAAI,GAAJ,IAAI,CAAoB;QACzB,aAAQ,GAAR,QAAQ,CAAyB;QAChC,gBAAW,GAAX,WAAW,CAAoB;QAC/B,mBAAc,GAAd,cAAc,CAAS;QACvB,UAAK,GAAL,KAAK,CAAa;QAClB,mBAAc,GAAd,cAAc,CAA0D;QATzE,UAAK,GAAc,EAAE,CAAC;QAC/B,UAAK,GAAG,CAAC,CAAC;QAUjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAEM,OAAO;QACb,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,SAAS,CAAC;IAClC,CAAC;IAEM,OAAO;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACvE,OAAO,MAAM,CAAC;IACf,CAAC;IAEM,UAAU;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;SACxB;aAAM,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,KAAK,SAAS,EAAE;gBACvB,OAAO,SAAS,CAAC;aACjB;YAED,MAAM,UAAU,GAAG,sBAAsB,CACxC,IAAI,EACJ,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,CACnB,CAAC;YAEF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;gBAC5B,OAAO,SAAS,CAAC;aACjB;YAED,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC/C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;aAC/B;YACD,OAAO,MAAM,CAAC;SACd;IACF,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,MAAc;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,IAAI,MAAM,EAAE;YACzB,OAAO,IAAI,CAAC;SACZ;QAED,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,IAAI;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,IAAI,KAAK,SAAS,EAAE;YACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACtB;QACD,OAAO,IAAI,CAAC;IACb,CAAC;CACD","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 { RevisionTag, TaggedChange } from \"../../core\";\nimport { IdAllocator } from \"../../util\";\nimport { Mark } from \"./types\";\nimport { applyMoveEffectsToMark, MoveEffectTable } from \"./moveEffectTable\";\nimport { splitMark } from \"./utils\";\n\nexport class MarkQueue<T> {\n\tprivate readonly stack: Mark<T>[] = [];\n\tprivate index = 0;\n\n\tpublic constructor(\n\t\tprivate readonly list: readonly Mark<T>[],\n\t\tpublic readonly revision: RevisionTag | undefined,\n\t\tprivate readonly moveEffects: MoveEffectTable<T>,\n\t\tprivate readonly consumeEffects: boolean,\n\t\tprivate readonly genId: IdAllocator,\n\t\tprivate readonly composeChanges?: (a: T | undefined, b: TaggedChange<T>) => T | undefined,\n\t) {\n\t\tthis.list = list;\n\t}\n\n\tpublic isEmpty(): boolean {\n\t\treturn this.peek() === undefined;\n\t}\n\n\tpublic dequeue(): Mark<T> {\n\t\tconst output = this.tryDequeue();\n\t\tassert(output !== undefined, 0x4e2 /* Unexpected end of mark queue */);\n\t\treturn output;\n\t}\n\n\tpublic tryDequeue(): Mark<T> | undefined {\n\t\tif (this.stack.length > 0) {\n\t\t\treturn this.stack.pop();\n\t\t} else if (this.index < this.list.length) {\n\t\t\tconst mark = this.list[this.index++];\n\t\t\tif (mark === undefined) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\n\t\t\tconst splitMarks = applyMoveEffectsToMark(\n\t\t\t\tmark,\n\t\t\t\tthis.revision,\n\t\t\t\tthis.moveEffects,\n\t\t\t\tthis.consumeEffects,\n\t\t\t\tthis.composeChanges,\n\t\t\t);\n\n\t\t\tif (splitMarks.length === 0) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\n\t\t\tconst result = splitMarks[0];\n\t\t\tfor (let i = splitMarks.length - 1; i > 0; i--) {\n\t\t\t\tthis.stack.push(splitMarks[i]);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\n\t/**\n\t * Dequeues the first `length` sized portion of the next mark.\n\t * The caller must verify that the next mark (as returned by peek) is longer than this length.\n\t * @param length - The length to dequeue, measured in the input context.\n\t */\n\tpublic dequeueUpTo(length: number): Mark<T> {\n\t\tconst mark = this.dequeue();\n\t\tif (mark.count <= length) {\n\t\t\treturn mark;\n\t\t}\n\n\t\tconst [mark1, mark2] = splitMark(mark, length);\n\t\tthis.stack.push(mark2);\n\t\treturn mark1;\n\t}\n\n\tpublic peek(): Mark<T> | undefined {\n\t\tconst mark = this.tryDequeue();\n\t\tif (mark !== undefined) {\n\t\t\tthis.stack.push(mark);\n\t\t}\n\t\treturn mark;\n\t}\n}\n"]}

package/lib/feature-libraries/sequence-field/moveEffectTable.d.ts

@@ -0,0 +1,48 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ChangeAtomId, RevisionTag, TaggedChange } from "../../core";
+import { CrossFieldManager, CrossFieldTarget } from "../modular-schema";
+import { RangeQueryResult } from "../../util";
+import { CellMark, Mark, MarkEffect, MoveId, MoveIn, MoveOut } from "./types";
+import { MoveMarkEffect } from "./helperTypes";
+export type MoveEffectTable<T> = CrossFieldManager<MoveEffect<T>>;
+/**
+ * Changes to be applied to a move mark.
+ */
+export interface MoveEffect<T> {
+    /**
+     * Node changes which should be applied to this mark.
+     * If this mark already has node changes, `modifyAfter` should be composed as later changes.
+     */
+    modifyAfter?: TaggedChange<T>;
+    /**
+     * A mark which should be moved to the same position as this mark.
+     */
+    movedMark?: Mark<T>;
+    /**
+     * The ID of the new endpoint associated with this mark.
+     */
+    endpoint?: ChangeAtomId;
+}
+export declare enum MoveEnd {
+    Source = 0,
+    Dest = 1
+}
+export interface MovePartition<TNodeChange> {
+    id: MoveId;
+    count?: number;
+    replaceWith?: Mark<TNodeChange>[];
+    modifyAfter?: TaggedChange<TNodeChange>;
+}
+export declare function setMoveEffect<T>(moveEffects: MoveEffectTable<T>, target: CrossFieldTarget, revision: RevisionTag | undefined, id: MoveId, count: number, effect: MoveEffect<T>, invalidate?: boolean): void;
+export declare function getMoveEffect<T>(moveEffects: MoveEffectTable<T>, target: CrossFieldTarget, revision: RevisionTag | undefined, id: MoveId, count: number, addDependency?: boolean): RangeQueryResult<MoveEffect<T>>;
+export type MoveMark<T> = CellMark<MoveMarkEffect, T>;
+export declare function isMoveMark(effect: MarkEffect): effect is MoveMarkEffect;
+export declare function isMoveOut(effect: MarkEffect): effect is MoveOut;
+export declare function isMoveIn(effect: MarkEffect): effect is MoveIn;
+export declare function getMoveIn(effect: MarkEffect): MoveIn | undefined;
+export declare function applyMoveEffectsToMark<T>(mark: Mark<T>, revision: RevisionTag | undefined, effects: MoveEffectTable<T>, consumeEffect: boolean, composeChildren?: (a: T | undefined, b: TaggedChange<T>) => T | undefined): Mark<T>[];
+export declare function getModifyAfter<T>(moveEffects: MoveEffectTable<T>, revision: RevisionTag | undefined, id: MoveId, count: number, consumeEffect?: boolean): TaggedChange<T> | undefined;
+//# sourceMappingURL=moveEffectTable.d.ts.map

package/lib/feature-libraries/sequence-field/moveEffectTable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"moveEffectTable.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/moveEffectTable.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAAE,gBAAgB,EAAS,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAE9E,OAAO,EAAE,cAAc,EAA2B,MAAM,eAAe,CAAC;AAExE,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAElE;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC5B;;;OAGG;IACH,WAAW,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IAE9B;;OAEG;IACH,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAEpB;;OAEG;IACH,QAAQ,CAAC,EAAE,YAAY,CAAC;CACxB;AAUD,oBAAY,OAAO;IAClB,MAAM,IAAA;IACN,IAAI,IAAA;CACJ;AAED,MAAM,WAAW,aAAa,CAAC,WAAW;IACzC,EAAE,EAAE,MAAM,CAAC;IAGX,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;IAClC,WAAW,CAAC,EAAE,YAAY,CAAC,WAAW,CAAC,CAAC;CACxC;AAED,wBAAgB,aAAa,CAAC,CAAC,EAC9B,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAC/B,MAAM,EAAE,gBAAgB,EACxB,QAAQ,EAAE,WAAW,GAAG,SAAS,EACjC,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,EACrB,UAAU,GAAE,OAAc,QAI1B;AAED,wBAAgB,aAAa,CAAC,CAAC,EAC9B,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAC/B,MAAM,EAAE,gBAAgB,EACxB,QAAQ,EAAE,WAAW,GAAG,SAAS,EACjC,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,aAAa,GAAE,OAAc,GAC3B,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAKjC;AAED,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;AAEtD,wBAAgB,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,IAAI,cAAc,CAEvE;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,IAAI,OAAO,CAE/D;AAED,wBAAgB,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,IAAI,MAAM,CAE7D;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAShE;AAuHD,wBAAgB,sBAAsB,CAAC,CAAC,EACvC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EACb,QAAQ,EAAE,WAAW,GAAG,SAAS,EACjC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,EAC3B,aAAa,EAAE,OAAO,EACtB,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,GACvE,IAAI,CAAC,CAAC,CAAC,EAAE,CAcX;AAiND,wBAAgB,cAAc,CAAC,CAAC,EAC/B,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAC/B,QAAQ,EAAE,WAAW,GAAG,SAAS,EACjC,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,aAAa,GAAE,OAAc,GAC3B,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS,CAe7B"}