@fluidframework/tree 2.118.1 → 3.0.1

package/dist/feature-libraries/modular-schema/minimizeModularChange.js

@@ -4,7 +4,17 @@
  * Licensed under the MIT License.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.minimizeModularChangeset = void 0;
+exports.minimizeModularChangeset = minimizeModularChangeset;
+const index_js_1 = require("../../core/index.js");
+const index_js_2 = require("../../util/index.js");
+const changeAtomIdBTree_js_1 = require("../changeAtomIdBTree.js");
+const crossFieldQueries_js_1 = require("./crossFieldQueries.js");
+const fieldChangeHandler_js_1 = require("./fieldChangeHandler.js");
+const filterEdits_js_1 = require("./filterEdits.js");
+const invert_js_1 = require("./invert.js");
+const modularChangeFamily_js_1 = require("./modularChangeFamily.js");
+const modularChangeUtils_js_1 = require("./modularChangeUtils.js");
+const internal_1 = require("@fluidframework/core-utils/internal");
 /**
  * "Minimizes" a {@link ModularChangeset} so that it contains no extraneous
  * information, i.e. no new content that isn't observable from document tree
@@ -14,16 +24,455 @@ exports.minimizeModularChangeset = void 0;
  * transaction, or changes whose effects cancel out to nothing. Minimizing reduces the size of an edit without altering
  * its observable effect.
  *
- * This is the eventual home of the minimization algorithm, colocated with {@link ModularChangeFamily} so it can use its
- * internals. It is currently a no-op that returns the change unchanged; a real implementation will be provided in a
- * future change.
- *
  * @param change - The change to minimize.
- * @param changeFamily - The change family used to compute the change's delta and identify built nodes.
+ * @param fieldKinds - The field kinds used in the changeset.
+ * @param forestFactory - A function that returns a new forest instance.
  */
-function minimizeModularChangeset(change, changeFamily) {
-    // TODO: Actually minimize the change. For now this is a no-op that returns the change unchanged.
-    return change;
+function minimizeModularChangeset(change, fieldKinds, forestFactory) {
+    return new ModularChangeMinimizer(change, fieldKinds).minimize(forestFactory);
+}
+class ModularChangeMinimizer {
+    change;
+    fieldKinds;
+    builtNodeIds;
+    builtRootIds;
+    outputAttachStates;
+    outputToInputRootId;
+    rootIdToNodeId;
+    attachedRootIds;
+    constructor(change, fieldKinds) {
+        this.change = change;
+        this.fieldKinds = fieldKinds;
+        this.outputAttachStates = getOutputNodeAttachStates(change, fieldKinds);
+        const nodeInfo = getNodeInfo(change, fieldKinds);
+        this.builtNodeIds = nodeInfo.builtNodeIds;
+        this.builtRootIds = nodeInfo.builtRootIds;
+        this.rootIdToNodeId = nodeInfo.rootIdToNodeId;
+        const delta = (0, modularChangeFamily_js_1.intoDelta)((0, index_js_1.makeAnonChange)(change), fieldKinds);
+        this.outputToInputRootId = outputToInputRootIdFromDelta(delta);
+        this.attachedRootIds = collectAttachedRootIds(delta, this.outputToInputRootId);
+    }
+    minimize(forestFactory) {
+        const residualChange = (0, filterEdits_js_1.filterEdits)(this.change, this.filterEditsForResidualChange.bind(this), this.fieldKinds);
+        residualChange.builds = this.squashBuilds(forestFactory);
+        (0, modularChangeUtils_js_1.validateChangeset)(residualChange, this.fieldKinds);
+        return residualChange;
+    }
+    isNodeIdInBuiltTree(nodeId) {
+        return (nodeId !== undefined &&
+            (0, changeAtomIdBTree_js_1.getFromChangeAtomIdMap)(this.builtNodeIds, (0, modularChangeUtils_js_1.normalizeNodeId)(nodeId, this.change.nodeAliases)) === true);
+    }
+    isNodeDetachedInOutput(nodeId) {
+        return (((0, changeAtomIdBTree_js_1.getFromChangeAtomIdMap)(this.outputAttachStates, (0, modularChangeUtils_js_1.normalizeNodeId)(nodeId, this.change.nodeAliases)) ?? (0, internal_1.fail)(0xd37 /* Should have attach state for every node ID */)) ===
+            fieldChangeHandler_js_1.NodeAttachState.Detached);
+    }
+    isFieldDetachedInOutput(fieldId) {
+        return fieldId.nodeId !== undefined && this.isNodeDetachedInOutput(fieldId.nodeId);
+    }
+    shouldSquashDetach(fieldId, inputRootId) {
+        // `inputRootId === undefined` indicates that this is a move of a transiently attached built root.
+        // In that case, we convert the move to an insert at the final location, discarding the detach portion.
+        return this.isNodeIdInBuiltTree(fieldId.nodeId) && inputRootId === undefined;
+    }
+    shouldSquashAttach(fieldId, rootInputId, count, endpoint) {
+        if (!this.isNodeIdInBuiltTree(fieldId.nodeId)) {
+            return { value: false, length: count };
+        }
+        let countProcessed = count;
+        const isMoveOfBuiltRootEntry = this.builtRootIds.getFirst(rootInputId, countProcessed);
+        countProcessed = isMoveOfBuiltRootEntry.length;
+        const isAttachOfBuiltRoot = isMoveOfBuiltRootEntry?.value ?? false;
+        const isMoveFromBuiltTree = endpoint?.nodeId !== undefined && this.isNodeIdInBuiltTree(endpoint.nodeId);
+        const isAttachOfBuiltNode = isAttachOfBuiltRoot || isMoveFromBuiltTree;
+        return { value: isAttachOfBuiltNode, length: countProcessed };
+    }
+    shouldDropAttach(fieldId, rootInputId, count, endpoint) {
+        const isInDetachedTree = this.isFieldDetachedInOutput(fieldId);
+        let countProcessed = count;
+        const shouldSquashAttachEntry = this.shouldSquashAttach(fieldId, rootInputId, countProcessed, endpoint);
+        countProcessed = shouldSquashAttachEntry.length;
+        const isBuiltRootEntry = this.builtRootIds.getFirst(rootInputId, countProcessed);
+        countProcessed = isBuiltRootEntry.length;
+        const isAttachOfBuild = isBuiltRootEntry.value ??
+            (endpoint !== undefined && this.isNodeIdInBuiltTree(endpoint.nodeId));
+        const isAttachedRootEntry = this.attachedRootIds.getFirst(rootInputId, countProcessed);
+        countProcessed = isAttachedRootEntry.length;
+        const isTransientAttachOfBuild = isAttachOfBuild && !isAttachedRootEntry.value;
+        return {
+            value: isInDetachedTree || shouldSquashAttachEntry.value || isTransientAttachOfBuild,
+            length: countProcessed,
+        };
+    }
+    shouldDropDetach(fieldId, detachId, rootInputId, count, endpoint) {
+        let countProcessed = count;
+        if (this.shouldSquashDetach(fieldId, rootInputId)) {
+            return { value: true, length: countProcessed };
+        }
+        if (rootInputId !== undefined) {
+            // `inputRootId` is defined when this detach represents the rename of a detached root.
+            const isDetachOfBuiltRootEntry = this.builtRootIds.getFirst(rootInputId, countProcessed);
+            countProcessed = isDetachOfBuiltRootEntry.length;
+            const isDetachOfBuiltRoot = isDetachOfBuiltRootEntry.value !== undefined;
+            if (isDetachOfBuiltRoot)
+                // If this is a rename of a built node, either it ends detached, or is moved elsewhere.
+                // If moved, we squash the detach away, leaving only an attach at the destination.
+                // If detached, the build is not used, so we drop the rename.
+                return {
+                    value: true,
+                    length: countProcessed,
+                };
+        }
+        if (endpoint !== undefined) {
+            const shouldDropAttachEntry = this.shouldDropAttach(endpoint, rootInputId ?? detachId, countProcessed, fieldId);
+            countProcessed = shouldDropAttachEntry.length;
+            if (!shouldDropAttachEntry.value) {
+                // This detach is part of a move, and we are not dropping the attach, so we must preserve the detach as well.
+                return { value: false, length: countProcessed };
+            }
+        }
+        return { value: this.isFieldDetachedInOutput(fieldId), length: countProcessed };
+    }
+    filterEditsForBuildChange(fieldChange, fieldId) {
+        return {
+            ...fieldChange,
+            change: (0, index_js_2.brand)((0, modularChangeUtils_js_1.getChangeHandler)(this.fieldKinds, fieldChange.fieldKind).rebaser.filterEdits(fieldChange.change, {
+                filterDetach: (detachId, count, inputRootId, endpoint) => this.filterDetachForBuildChange(fieldId, detachId, count, inputRootId, endpoint),
+                filterAttach: (id, count, _outputRootId, endpoint) => this.filterAttachForBuildChange(fieldId, id, count, endpoint),
+                preserveOtherEdits: false,
+            })),
+        };
+    }
+    filterDetachForBuildChange(fieldId, detachId, count, inputRootId, endpoint) {
+        if (!this.shouldSquashDetach(fieldId, inputRootId)) {
+            return {
+                value: { action: fieldChangeHandler_js_1.EditFilterStatus.Remove, shouldRemoveChild: false },
+                length: count,
+            };
+        }
+        let countProcessed = count;
+        const moveEndpointEntry = this.change.crossFieldKeys.getFirst({ ...(endpoint ?? detachId), target: crossFieldQueries_js_1.CrossFieldTarget.Destination }, countProcessed);
+        countProcessed = moveEndpointEntry.length;
+        if (moveEndpointEntry.value !== undefined) {
+            const willSquashEndpointEntry = this.shouldSquashAttach(moveEndpointEntry.value, inputRootId ?? detachId, countProcessed, fieldId);
+            countProcessed = willSquashEndpointEntry.length;
+            const action = willSquashEndpointEntry.value
+                ? fieldChangeHandler_js_1.EditFilterStatus.Preserve
+                : fieldChangeHandler_js_1.EditFilterStatus.PreserveWithoutMove;
+            return { value: { action }, length: countProcessed };
+        }
+        return { value: { action: fieldChangeHandler_js_1.EditFilterStatus.Preserve }, length: countProcessed };
+    }
+    filterAttachForBuildChange(fieldId, id, count, endpoint) {
+        let countProcessed = count;
+        const moveId = endpoint ?? id;
+        const moveEndpointEntry = this.change.crossFieldKeys.getFirst({ ...moveId, target: crossFieldQueries_js_1.CrossFieldTarget.Source }, countProcessed);
+        countProcessed = moveEndpointEntry.length;
+        const inputIdEntry = this.outputToInputRootId.getFirst(moveId, countProcessed);
+        countProcessed = inputIdEntry.length;
+        const rootInputId = inputIdEntry.value ?? moveId;
+        const shouldSquashEntry = this.shouldSquashAttach(fieldId, rootInputId, countProcessed, moveEndpointEntry.value);
+        countProcessed = shouldSquashEntry.length;
+        const isMove = moveEndpointEntry.value !== undefined;
+        if (!shouldSquashEntry.value) {
+            return { value: { action: fieldChangeHandler_js_1.EditFilterStatus.Remove }, length: countProcessed };
+        }
+        if (isMove) {
+            const movedNodeId = (0, changeAtomIdBTree_js_1.getFromChangeAtomIdMap)(this.rootIdToNodeId, moveId);
+            return {
+                value: {
+                    action: fieldChangeHandler_js_1.EditFilterStatus.PreserveWithoutMove,
+                    nodeId: movedNodeId,
+                    newAttachId: rootInputId,
+                },
+                length: countProcessed,
+            };
+        }
+        return {
+            value: { action: fieldChangeHandler_js_1.EditFilterStatus.Preserve },
+            length: countProcessed,
+        };
+    }
+    /**
+     * Returns a version of `fieldChange` to be used in the final minimized change.
+     * The filtered change will have dropped:
+     * - Edits which were squashed into the built trees.
+     * - Detaches of built roots. If part of a move, these are instead represented as an attach at the final location.
+     * - Edits to nodes which are detached in the output, except for detaches of content which does end attached.
+     */
+    filterEditsForResidualChange(fieldChange, fieldId) {
+        return {
+            ...fieldChange,
+            change: (0, index_js_2.brand)((0, modularChangeUtils_js_1.getChangeHandler)(this.fieldKinds, fieldChange.fieldKind).rebaser.filterEdits(fieldChange.change, {
+                filterDetach: (...args) => this.filterDetachForResidualChange(fieldId, ...args),
+                filterAttach: (...args) => this.filterAttachForResidualChange(fieldId, ...args),
+                preserveOtherEdits: false,
+            })),
+        };
+    }
+    filterDetachForResidualChange(fieldId, detachId, count, inputRootId, endpoint) {
+        let countProcessed = count;
+        const moveId = endpoint ?? detachId;
+        const moveEndpointEntry = this.change.crossFieldKeys.getFirst({ ...moveId, target: crossFieldQueries_js_1.CrossFieldTarget.Destination }, count);
+        countProcessed = moveEndpointEntry.length;
+        const shouldDropEntry = this.shouldDropDetach(fieldId, detachId, inputRootId, countProcessed, moveEndpointEntry.value);
+        countProcessed = shouldDropEntry.length;
+        let hasPreservedAttach = false;
+        let hasDroppedAttach = false;
+        if (moveEndpointEntry.value !== undefined) {
+            const willDropAttachEntry = this.shouldDropAttach(moveEndpointEntry.value, inputRootId ?? detachId, countProcessed, fieldId);
+            countProcessed = willDropAttachEntry.length;
+            hasDroppedAttach = willDropAttachEntry.value;
+            hasPreservedAttach = !willDropAttachEntry.value;
+        }
+        if (shouldDropEntry.value) {
+            // If there is a preserved attach, we will represent any child change at that location,
+            // so we must remove them from here.
+            return {
+                value: { action: fieldChangeHandler_js_1.EditFilterStatus.Remove, shouldRemoveChild: hasPreservedAttach },
+                length: countProcessed,
+            };
+        }
+        return {
+            value: {
+                action: hasDroppedAttach
+                    ? fieldChangeHandler_js_1.EditFilterStatus.PreserveWithoutMove
+                    : fieldChangeHandler_js_1.EditFilterStatus.Preserve,
+            },
+            length: countProcessed,
+        };
+    }
+    filterAttachForResidualChange(fieldId, id, count, outputRootId, endpoint) {
+        let countProcessed = count;
+        const moveId = endpoint ?? id;
+        const moveEndpointEntry = this.change.crossFieldKeys.getFirst({ ...moveId, target: crossFieldQueries_js_1.CrossFieldTarget.Source }, countProcessed);
+        countProcessed = moveEndpointEntry.length;
+        const inputIdEntry = this.outputToInputRootId.getFirst(moveId, countProcessed);
+        countProcessed = inputIdEntry.length;
+        const rootInputId = inputIdEntry.value ?? moveId;
+        const shouldDropEntry = this.shouldDropAttach(fieldId, rootInputId, countProcessed, moveEndpointEntry.value);
+        countProcessed = shouldDropEntry.length;
+        if (shouldDropEntry.value) {
+            return {
+                value: { action: fieldChangeHandler_js_1.EditFilterStatus.Remove },
+                length: countProcessed,
+            };
+        }
+        if (moveEndpointEntry.value !== undefined) {
+            const willDropEndpointEntry = this.shouldDropDetach(moveEndpointEntry.value, moveId, inputIdEntry.value, countProcessed, fieldId);
+            countProcessed = willDropEndpointEntry.length;
+            if (willDropEndpointEntry.value) {
+                const movedNodeId = (0, changeAtomIdBTree_js_1.getFromChangeAtomIdMap)(this.rootIdToNodeId, moveId);
+                return {
+                    value: {
+                        action: fieldChangeHandler_js_1.EditFilterStatus.PreserveWithoutMove,
+                        nodeId: movedNodeId,
+                        newAttachId: inputIdEntry.value ?? moveId,
+                    },
+                    length: countProcessed,
+                };
+            }
+        }
+        return {
+            value: { action: fieldChangeHandler_js_1.EditFilterStatus.Preserve },
+            length: countProcessed,
+        };
+    }
+    squashBuilds(forestFactory) {
+        const changeForBuilds = (0, filterEdits_js_1.filterEdits)(this.change, this.filterEditsForBuildChange.bind(this), this.fieldKinds);
+        const deltaForBuilds = (0, modularChangeFamily_js_1.intoDelta)((0, index_js_1.makeAnonChange)(changeForBuilds), this.fieldKinds);
+        (0, internal_1.assert)(!(0, index_js_1.deltaFieldMapHasChanges)(deltaForBuilds.fields), 0xd38 /* Expected all changes to attached tree to be filtered out */);
+        // There may still be paths to existing nodes in the delta, which must be removed before being applied to an empty forest.
+        // It is safe to remove these, because there are no edits to them, as asserted above.
+        deltaForBuilds.fields = new Map();
+        const forest = forestFactory();
+        const detachedFieldIndex = (0, index_js_1.makeDetachedFieldIndex)();
+        (0, index_js_1.visitDelta)(deltaForBuilds, forest.acquireVisitor(), detachedFieldIndex, undefined);
+        const squashedBuilds = (0, changeAtomIdBTree_js_1.newChangeAtomIdBTree)();
+        const cursor = forest.getCursorAboveDetachedFields();
+        for (const entry of detachedFieldIndex.entries()) {
+            cursor.enterField(detachedFieldIndex.toFieldKey(entry.root));
+            const chunks = forest.chunkField(cursor);
+            // Delta visiting currently splits ranges of nodes into individual elements,
+            // so for now we will not have more than one node in a detached field.
+            (0, internal_1.assert)((0, index_js_2.hasSingle)(chunks), 0xd39 /* TODO: Handle multiple chunks */);
+            const chunk = chunks[0];
+            (0, internal_1.assert)(chunk.topLevelLength === 1, 0xd3a /* TODO: Handle chunk with range of nodes */);
+            const rootId = {
+                revision: entry.id.major,
+                localId: (0, index_js_2.brand)(entry.id.minor),
+            };
+            const isAttachedEntry = this.attachedRootIds.getFirst(rootId, chunk.topLevelLength);
+            (0, internal_1.assert)(isAttachedEntry.length === chunk.topLevelLength, 0xd3b /* TODO: Handle chunks which are only partially attached */);
+            if (isAttachedEntry.value) {
+                (0, changeAtomIdBTree_js_1.setInChangeAtomIdMap)(squashedBuilds, rootId, chunk);
+            }
+            cursor.exitField();
+        }
+        return squashedBuilds;
+    }
+}
+function getOutputNodeAttachStates(change, fieldKinds) {
+    const inverse = (0, invert_js_1.invertModularChange)((0, index_js_1.makeAnonChange)(change), true, "root", fieldKinds);
+    return getInputNodeAttachStates(inverse, fieldKinds);
+}
+function getInputNodeAttachStates(change, fieldKinds) {
+    const nodeAttachStates = (0, changeAtomIdBTree_js_1.newChangeAtomIdBTree)();
+    addInputNodeAttachStatesForFields(fieldChangeHandler_js_1.NodeAttachState.Attached, change.fieldChanges, change.nodeChanges, change.nodeAliases, fieldKinds, nodeAttachStates);
+    return nodeAttachStates;
+}
+function addInputNodeAttachStatesForFields(parentState, fields, nodes, nodeAliases, fieldKinds, nodeAttachStates) {
+    for (const fieldChange of fields.values()) {
+        const children = (0, modularChangeUtils_js_1.getChangeHandler)(fieldKinds, fieldChange.fieldKind).getNestedChanges(fieldChange.change);
+        for (const { nodeId, inputRootId: inputId } of children) {
+            const normalizedNodeId = (0, modularChangeUtils_js_1.normalizeNodeId)(nodeId, nodeAliases);
+            const attachState = parentState === fieldChangeHandler_js_1.NodeAttachState.Attached && inputId === undefined
+                ? fieldChangeHandler_js_1.NodeAttachState.Attached
+                : fieldChangeHandler_js_1.NodeAttachState.Detached;
+            nodeAttachStates.set([normalizedNodeId.revision, normalizedNodeId.localId], attachState);
+            const nodeChangeset = (0, modularChangeUtils_js_1.nodeChangeFromId)(nodes, normalizedNodeId);
+            if (nodeChangeset.fieldChanges !== undefined) {
+                addInputNodeAttachStatesForFields(attachState, nodeChangeset.fieldChanges, nodes, nodeAliases, fieldKinds, nodeAttachStates);
+            }
+        }
+    }
+}
+function getNodeInfo(change, fieldKinds) {
+    const builtRootIds = (0, index_js_1.newChangeAtomIdRangeMap)();
+    if (change.builds !== undefined) {
+        for (const [rootId, chunk] of change.builds.entries()) {
+            builtRootIds.set((0, index_js_1.makeChangeAtomId)(rootId[1], rootId[0]), chunk.topLevelLength, true);
+        }
+    }
+    const builtNodeIds = (0, changeAtomIdBTree_js_1.newChangeAtomIdBTree)();
+    const rootIdToNodeId = (0, changeAtomIdBTree_js_1.newChangeAtomIdBTree)();
+    addNodeInfoForFields(false, change.fieldChanges, change.nodeChanges, change.nodeAliases, builtRootIds, fieldKinds, builtNodeIds, rootIdToNodeId);
+    return { builtRootIds, builtNodeIds, rootIdToNodeId };
+}
+function addNodeInfoForFields(parentIsBuilt, fields, nodes, nodeAliases, buildIds, fieldKinds, builtNodeIds, rootIdToNodeId) {
+    for (const fieldChange of fields.values()) {
+        const children = (0, modularChangeUtils_js_1.getChangeHandler)(fieldKinds, fieldChange.fieldKind).getNestedChanges(fieldChange.change);
+        for (const { nodeId, inputRootId: inputId, detachId } of children) {
+            const normalizedNodeId = (0, modularChangeUtils_js_1.normalizeNodeId)(nodeId, nodeAliases);
+            const isPartOfBuild = parentIsBuilt ||
+                (inputId !== undefined && buildIds.getFirst(inputId, 1).value === true);
+            if (isPartOfBuild) {
+                builtNodeIds.set([normalizedNodeId.revision, normalizedNodeId.localId], true);
+            }
+            if (inputId !== undefined) {
+                (0, changeAtomIdBTree_js_1.setInChangeAtomIdMap)(rootIdToNodeId, inputId, normalizedNodeId);
+            }
+            if (detachId !== undefined) {
+                (0, changeAtomIdBTree_js_1.setInChangeAtomIdMap)(rootIdToNodeId, detachId, normalizedNodeId);
+            }
+            const nodeChangeset = (0, modularChangeUtils_js_1.nodeChangeFromId)(nodes, normalizedNodeId);
+            if (nodeChangeset.fieldChanges !== undefined) {
+                addNodeInfoForFields(isPartOfBuild, nodeChangeset.fieldChanges, nodes, nodeAliases, buildIds, fieldKinds, builtNodeIds, rootIdToNodeId);
+            }
+        }
+    }
+}
+/**
+ * Collects the set of root IDs whose content ends up attached within the live document tree
+ * once the given change is applied.
+ * There are entries both for nodes which are detached in the input context,
+ * and also for nodes which are detached by this delta.
+ * The keys are pre-rename IDs.
+ *
+ * @remarks
+ * These are the "used" nodes: any build whose nodes are not in this set has no observable
+ * effect on the resulting document and can be dropped.
+ */
+function collectAttachedRootIds(delta, outputToInputRootId) {
+    const detachIdToNodeChanges = getDeltaNodeChangesByDetachId(delta);
+    const attached = (0, index_js_1.newChangeAtomIdRangeMap)();
+    // Worklist of detached node ID ranges newly discovered to be live, whose own nested content must be visited.
+    const worklist = [];
+    const markLive = (attachId, count) => {
+        for (const inputIdEntry of outputToInputRootId.getAll(attachId, count)) {
+            const inputId = inputIdEntry.value ?? (0, index_js_1.offsetChangeAtomId)(attachId, inputIdEntry.offset);
+            // Only the sub-ranges of `[id, id + count)` that are not already live are newly discovered.
+            // Mark each such run live in a single range operation and enqueue it for processing.
+            for (const fragment of attached.getAll(inputId, inputIdEntry.length)) {
+                if (fragment.value === undefined) {
+                    const runStart = (0, index_js_1.offsetChangeAtomId)(inputId, fragment.offset);
+                    attached.set(runStart, fragment.length, true);
+                    worklist.push({ id: runStart, count: fragment.length });
+                }
+            }
+        }
+    };
+    const visitLiveFields = (fields) => {
+        if (fields === undefined) {
+            return;
+        }
+        for (const field of fields.values()) {
+            for (const mark of field.marks) {
+                if (mark.attach !== undefined) {
+                    markLive({ revision: mark.attach.major, localId: (0, index_js_2.brand)(mark.attach.minor) }, mark.count);
+                }
+                // `mark.fields` edits the cell's pre-existing content. Only descend when that content
+                // stays in the live tree (i.e. it is not being detached out of the tree).
+                if (mark.detach === undefined) {
+                    visitLiveFields(mark.fields);
+                }
+            }
+        }
+    };
+    visitLiveFields(delta.fields);
+    // Process node ranges discovered to be live: pull in their nested content and propagate
+    // liveness backwards across renames (a node attached under its post-rename ID was built under its
+    // pre-rename ID). Iterate to a fixed point.
+    while (worklist.length > 0) {
+        const next = worklist.pop();
+        if (next === undefined) {
+            break;
+        }
+        const { id, count } = next;
+        // Nested content is keyed per node, so it must be visited one ID at a time.
+        for (let offset = 0; offset < count; offset += 1) {
+            visitLiveFields(detachIdToNodeChanges.get(id.revision)?.get((0, index_js_2.brand)(id.localId + offset)));
+        }
+    }
+    return attached;
+}
+/**
+ * Returns a mapping from root ID to the field changes for that node.
+ * There are entries both for nodes which are detached in the input context,
+ * and also for nodes which are detached by this delta.
+ * The keys are pre-rename IDs.
+ */
+function getDeltaNodeChangesByDetachId(delta) {
+    const detachIdToChanges = new Map();
+    const visitFields = (fields) => {
+        for (const fieldChange of fields.values()) {
+            for (const mark of fieldChange.marks) {
+                if (mark.fields !== undefined) {
+                    visitFields(mark.fields);
+                    if (mark.detach !== undefined) {
+                        (0, index_js_2.setInNestedMap)(detachIdToChanges, mark.detach.major, mark.detach.minor, mark.fields);
+                    }
+                }
+            }
+        }
+    };
+    if (delta.fields !== undefined) {
+        visitFields(delta.fields);
+    }
+    if (delta.global !== undefined) {
+        for (const { id, fields } of delta.global) {
+            (0, index_js_2.setInNestedMap)(detachIdToChanges, id.major, id.minor, fields);
+            visitFields(fields);
+        }
+    }
+    return detachIdToChanges;
+}
+function outputToInputRootIdFromDelta(delta) {
+    const outputToInputRootId = (0, index_js_1.newChangeAtomIdTransform)();
+    if (delta.rename !== undefined) {
+        for (const { oldId, newId, count } of delta.rename) {
+            outputToInputRootId.set((0, index_js_1.makeChangeAtomId)((0, index_js_2.brand)(newId.minor), newId.major), count, (0, index_js_1.makeChangeAtomId)((0, index_js_2.brand)(oldId.minor), oldId.major));
+        }
+    }
+    return outputToInputRootId;
 }
-exports.minimizeModularChangeset = minimizeModularChangeset;
 //# sourceMappingURL=minimizeModularChange.js.map

package/dist/feature-libraries/modular-schema/minimizeModularChange.js.map

@@ -1 +1 @@
-{"version":3,"file":"minimizeModularChange.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/minimizeModularChange.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAKH;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,wBAAwB,CACvC,MAAwB,EACxB,YAAiC;IAEjC,iGAAiG;IACjG,OAAO,MAAM,CAAC;AACf,CAAC;AAND,4DAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport type { ModularChangeFamily } from \"./modularChangeFamily.js\";\nimport type { ModularChangeset } from \"./modularChangeTypes.js\";\n\n/**\n * \"Minimizes\" a {@link ModularChangeset} so that it contains no extraneous\n * information, i.e. no new content that isn't observable from document tree\n * and no edits without net observed effect on the document tree.\n * @remarks\n * \"Extraneous information\" includes, for example, data for nodes that were both created and removed within the same\n * transaction, or changes whose effects cancel out to nothing. Minimizing reduces the size of an edit without altering\n * its observable effect.\n *\n * This is the eventual home of the minimization algorithm, colocated with {@link ModularChangeFamily} so it can use its\n * internals. It is currently a no-op that returns the change unchanged; a real implementation will be provided in a\n * future change.\n *\n * @param change - The change to minimize.\n * @param changeFamily - The change family used to compute the change's delta and identify built nodes.\n */\nexport function minimizeModularChangeset(\n\tchange: ModularChangeset,\n\tchangeFamily: ModularChangeFamily,\n): ModularChangeset {\n\t// TODO: Actually minimize the change. For now this is a no-op that returns the change unchanged.\n\treturn change;\n}\n"]}
+{"version":3,"file":"minimizeModularChange.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/minimizeModularChange.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AA0EH,4DAMC;AA9ED,kDAiB6B;AAC7B,kDAM6B;AAC7B,kEAKiC;AACjC,iEAA0D;AAC1D,mEAKiC;AAGjC,qDAA+C;AAC/C,2CAAkD;AAClD,qEAAqD;AASrD,mEAKiC;AACjC,kEAAmE;AAEnE;;;;;;;;;;;;GAYG;AACH,SAAgB,wBAAwB,CACvC,MAAwB,EACxB,UAA2D,EAC3D,aAAoC;IAEpC,OAAO,IAAI,sBAAsB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;AAC/E,CAAC;AAED,MAAM,sBAAsB;IAST;IACA;IATD,YAAY,CAA0B;IACtC,YAAY,CAA6B;IACzC,kBAAkB,CAAqC;IACvD,mBAAmB,CAAqC;IACxD,cAAc,CAA4B;IAC1C,eAAe,CAAuB;IAEvD,YACkB,MAAwB,EACxB,UAA2D;QAD3D,WAAM,GAAN,MAAM,CAAkB;QACxB,eAAU,GAAV,UAAU,CAAiD;QAE5E,IAAI,CAAC,kBAAkB,GAAG,yBAAyB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACjD,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC;QAC1C,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC;QAC1C,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC;QAE9C,MAAM,KAAK,GAAG,IAAA,kCAAS,EAAC,IAAA,yBAAc,EAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;QAC5D,IAAI,CAAC,mBAAmB,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;QAC/D,IAAI,CAAC,eAAe,GAAG,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAChF,CAAC;IAEM,QAAQ,CAAC,aAAoC;QACnD,MAAM,cAAc,GAAG,IAAA,4BAAW,EACjC,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,IAAI,CAAC,EAC5C,IAAI,CAAC,UAAU,CACf,CAAC;QAED,cAA4C,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACxF,IAAA,yCAAiB,EAAC,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACnD,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,mBAAmB,CAAC,MAA0B;QACrD,OAAO,CACN,MAAM,KAAK,SAAS;YACpB,IAAA,6CAAsB,EACrB,IAAI,CAAC,YAAY,EACjB,IAAA,uCAAe,EAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAChD,KAAK,IAAI,CACV,CAAC;IACH,CAAC;IAEO,sBAAsB,CAAC,MAAc;QAC5C,OAAO,CACN,CAAC,IAAA,6CAAsB,EACtB,IAAI,CAAC,kBAAkB,EACvB,IAAA,uCAAe,EAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAChD,IAAI,IAAA,eAAI,EAAC,KAAK,CAAC,gDAAgD,CAAC,CAAC;YAClE,uCAAe,CAAC,QAAQ,CACxB,CAAC;IACH,CAAC;IAEO,uBAAuB,CAAC,OAAgB;QAC/C,OAAO,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACpF,CAAC;IAEO,kBAAkB,CACzB,OAAgB,EAChB,WAAqC;QAErC,kGAAkG;QAClG,uGAAuG;QACvG,OAAO,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,WAAW,KAAK,SAAS,CAAC;IAC9E,CAAC;IAEO,kBAAkB,CACzB,OAAgB,EAChB,WAAyB,EACzB,KAAa,EACb,QAA6B;QAE7B,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QACxC,CAAC;QAED,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,MAAM,sBAAsB,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;QACvF,cAAc,GAAG,sBAAsB,CAAC,MAAM,CAAC;QAE/C,MAAM,mBAAmB,GAAG,sBAAsB,EAAE,KAAK,IAAI,KAAK,CAAC;QACnE,MAAM,mBAAmB,GACxB,QAAQ,EAAE,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAE7E,MAAM,mBAAmB,GAAG,mBAAmB,IAAI,mBAAmB,CAAC;QACvE,OAAO,EAAE,KAAK,EAAE,mBAAmB,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IAC/D,CAAC;IAEO,gBAAgB,CACvB,OAAgB,EAChB,WAAyB,EACzB,KAAa,EACb,QAA6B;QAE7B,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;QAE/D,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,MAAM,uBAAuB,GAAG,IAAI,CAAC,kBAAkB,CACtD,OAAO,EACP,WAAW,EACX,cAAc,EACd,QAAQ,CACR,CAAC;QACF,cAAc,GAAG,uBAAuB,CAAC,MAAM,CAAC;QAEhD,MAAM,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;QACjF,cAAc,GAAG,gBAAgB,CAAC,MAAM,CAAC;QAEzC,MAAM,eAAe,GACpB,gBAAgB,CAAC,KAAK;YACtB,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAEvE,MAAM,mBAAmB,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;QACvF,cAAc,GAAG,mBAAmB,CAAC,MAAM,CAAC;QAE5C,MAAM,wBAAwB,GAAG,eAAe,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC;QAC/E,OAAO;YACN,KAAK,EAAE,gBAAgB,IAAI,uBAAuB,CAAC,KAAK,IAAI,wBAAwB;YACpF,MAAM,EAAE,cAAc;SACtB,CAAC;IACH,CAAC;IAEO,gBAAgB,CACvB,OAAgB,EAChB,QAAsB,EACtB,WAAqC,EACrC,KAAa,EACb,QAA6B;QAE7B,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,IAAI,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;YACnD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;QAChD,CAAC;QAED,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC/B,sFAAsF;YACtF,MAAM,wBAAwB,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;YACzF,cAAc,GAAG,wBAAwB,CAAC,MAAM,CAAC;YACjD,MAAM,mBAAmB,GAAG,wBAAwB,CAAC,KAAK,KAAK,SAAS,CAAC;YACzE,IAAI,mBAAmB;gBACtB,uFAAuF;gBACvF,kFAAkF;gBAClF,6DAA6D;gBAC7D,OAAO;oBACN,KAAK,EAAE,IAAI;oBACX,MAAM,EAAE,cAAc;iBACtB,CAAC;QACJ,CAAC;QAED,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,qBAAqB,GAAG,IAAI,CAAC,gBAAgB,CAClD,QAAQ,EACR,WAAW,IAAI,QAAQ,EACvB,cAAc,EACd,OAAO,CACP,CAAC;YACF,cAAc,GAAG,qBAAqB,CAAC,MAAM,CAAC;YAE9C,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC;gBAClC,6GAA6G;gBAC7G,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;YACjD,CAAC;QACF,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IACjF,CAAC;IAEO,yBAAyB,CAAC,WAAwB,EAAE,OAAgB;QAC3E,OAAO;YACN,GAAG,WAAW;YACd,MAAM,EAAE,IAAA,gBAAK,EACZ,IAAA,wCAAgB,EAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,WAAW,CAC3E,WAAW,CAAC,MAAM,EAClB;gBACC,YAAY,EAAE,CAAC,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,EAAE,CACxD,IAAI,CAAC,0BAA0B,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,CAAC;gBACjF,YAAY,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,EAAE,CACpD,IAAI,CAAC,0BAA0B,CAAC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC;gBAC9D,kBAAkB,EAAE,KAAK;aACzB,CACD,CACD;SACD,CAAC;IACH,CAAC;IAEO,0BAA0B,CACjC,OAAgB,EAChB,QAAsB,EACtB,KAAa,EACb,WAAqC,EACrC,QAAuB;QAEvB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;YACpD,OAAO;gBACN,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,MAAM,EAAE,iBAAiB,EAAE,KAAK,EAAE;gBACpE,MAAM,EAAE,KAAK;aACb,CAAC;QACH,CAAC;QAED,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAC5D,EAAE,GAAG,CAAC,QAAQ,IAAI,QAAQ,CAAC,EAAE,MAAM,EAAE,uCAAgB,CAAC,WAAW,EAAE,EACnE,cAAc,CACd,CAAC;QACF,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC;QAE1C,IAAI,iBAAiB,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3C,MAAM,uBAAuB,GAAG,IAAI,CAAC,kBAAkB,CACtD,iBAAiB,CAAC,KAAK,EACvB,WAAW,IAAI,QAAQ,EACvB,cAAc,EACd,OAAO,CACP,CAAC;YACF,cAAc,GAAG,uBAAuB,CAAC,MAAM,CAAC;YAEhD,MAAM,MAAM,GAAG,uBAAuB,CAAC,KAAK;gBAC3C,CAAC,CAAC,wCAAgB,CAAC,QAAQ;gBAC3B,CAAC,CAAC,wCAAgB,CAAC,mBAAmB,CAAC;YAExC,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;QACtD,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IACjF,CAAC;IAEO,0BAA0B,CACjC,OAAgB,EAChB,EAAgB,EAChB,KAAa,EACb,QAAuB;QAEvB,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;QAC9B,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAC5D,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,uCAAgB,CAAC,MAAM,EAAE,EAC9C,cAAc,CACd,CAAC;QACF,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC;QAE1C,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAC/E,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC;QAErC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,IAAI,MAAM,CAAC;QACjD,MAAM,iBAAiB,GAAG,IAAI,CAAC,kBAAkB,CAChD,OAAO,EACP,WAAW,EACX,cAAc,EACd,iBAAiB,CAAC,KAAK,CACvB,CAAC;QACF,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC;QAE1C,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,KAAK,SAAS,CAAC;QACrD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;YAC9B,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;QAC/E,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACZ,MAAM,WAAW,GAAG,IAAA,6CAAsB,EAAC,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;YACxE,OAAO;gBACN,KAAK,EAAE;oBACN,MAAM,EAAE,wCAAgB,CAAC,mBAAmB;oBAC5C,MAAM,EAAE,WAAW;oBACnB,WAAW,EAAE,WAAW;iBACxB;gBACD,MAAM,EAAE,cAAc;aACtB,CAAC;QACH,CAAC;QAED,OAAO;YACN,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,QAAQ,EAAE;YAC5C,MAAM,EAAE,cAAc;SACtB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,4BAA4B,CACnC,WAAwB,EACxB,OAAgB;QAEhB,OAAO;YACN,GAAG,WAAW;YACd,MAAM,EAAE,IAAA,gBAAK,EACZ,IAAA,wCAAgB,EAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,WAAW,CAC3E,WAAW,CAAC,MAAM,EAClB;gBACC,YAAY,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,6BAA6B,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC;gBAC/E,YAAY,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,6BAA6B,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC;gBAC/E,kBAAkB,EAAE,KAAK;aACzB,CACD,CACD;SACD,CAAC;IACH,CAAC;IAEO,6BAA6B,CACpC,OAAgB,EAChB,QAAsB,EACtB,KAAa,EACb,WAAqC,EACrC,QAAuB;QAEvB,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,MAAM,MAAM,GAAG,QAAQ,IAAI,QAAQ,CAAC;QACpC,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAC5D,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,uCAAgB,CAAC,WAAW,EAAE,EACnD,KAAK,CACL,CAAC;QACF,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC;QAE1C,MAAM,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAC5C,OAAO,EACP,QAAQ,EACR,WAAW,EACX,cAAc,EACd,iBAAiB,CAAC,KAAK,CACvB,CAAC;QACF,cAAc,GAAG,eAAe,CAAC,MAAM,CAAC;QAExC,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAC/B,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IAAI,iBAAiB,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3C,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAChD,iBAAiB,CAAC,KAAK,EACvB,WAAW,IAAI,QAAQ,EACvB,cAAc,EACd,OAAO,CACP,CAAC;YACF,cAAc,GAAG,mBAAmB,CAAC,MAAM,CAAC;YAC5C,gBAAgB,GAAG,mBAAmB,CAAC,KAAK,CAAC;YAC7C,kBAAkB,GAAG,CAAC,mBAAmB,CAAC,KAAK,CAAC;QACjD,CAAC;QAED,IAAI,eAAe,CAAC,KAAK,EAAE,CAAC;YAC3B,uFAAuF;YACvF,oCAAoC;YACpC,OAAO;gBACN,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,MAAM,EAAE,iBAAiB,EAAE,kBAAkB,EAAE;gBACjF,MAAM,EAAE,cAAc;aACtB,CAAC;QACH,CAAC;QAED,OAAO;YACN,KAAK,EAAE;gBACN,MAAM,EAAE,gBAAgB;oBACvB,CAAC,CAAC,wCAAgB,CAAC,mBAAmB;oBACtC,CAAC,CAAC,wCAAgB,CAAC,QAAQ;aAC5B;YACD,MAAM,EAAE,cAAc;SACtB,CAAC;IACH,CAAC;IAEO,6BAA6B,CACpC,OAAgB,EAChB,EAAgB,EAChB,KAAa,EACb,YAAsC,EACtC,QAAuB;QAEvB,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;QAC9B,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAC5D,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,uCAAgB,CAAC,MAAM,EAAE,EAC9C,cAAc,CACd,CAAC;QACF,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC;QAE1C,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAC/E,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC;QAErC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,IAAI,MAAM,CAAC;QACjD,MAAM,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAC5C,OAAO,EACP,WAAW,EACX,cAAc,EACd,iBAAiB,CAAC,KAAK,CACvB,CAAC;QACF,cAAc,GAAG,eAAe,CAAC,MAAM,CAAC;QAExC,IAAI,eAAe,CAAC,KAAK,EAAE,CAAC;YAC3B,OAAO;gBACN,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,MAAM,EAAE;gBAC1C,MAAM,EAAE,cAAc;aACtB,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3C,MAAM,qBAAqB,GAAG,IAAI,CAAC,gBAAgB,CAClD,iBAAiB,CAAC,KAAK,EACvB,MAAM,EACN,YAAY,CAAC,KAAK,EAClB,cAAc,EACd,OAAO,CACP,CAAC;YACF,cAAc,GAAG,qBAAqB,CAAC,MAAM,CAAC;YAC9C,IAAI,qBAAqB,CAAC,KAAK,EAAE,CAAC;gBACjC,MAAM,WAAW,GAAG,IAAA,6CAAsB,EAAC,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBACxE,OAAO;oBACN,KAAK,EAAE;wBACN,MAAM,EAAE,wCAAgB,CAAC,mBAAmB;wBAC5C,MAAM,EAAE,WAAW;wBACnB,WAAW,EAAE,YAAY,CAAC,KAAK,IAAI,MAAM;qBACzC;oBACD,MAAM,EAAE,cAAc;iBACtB,CAAC;YACH,CAAC;QACF,CAAC;QAED,OAAO;YACN,KAAK,EAAE,EAAE,MAAM,EAAE,wCAAgB,CAAC,QAAQ,EAAE;YAC5C,MAAM,EAAE,cAAc;SACtB,CAAC;IACH,CAAC;IAEO,YAAY,CAAC,aAAoC;QACxD,MAAM,eAAe,GAAG,IAAA,4BAAW,EAClC,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,EACzC,IAAI,CAAC,UAAU,CACf,CAAC;QAEF,MAAM,cAAc,GAAG,IAAA,kCAAS,EAAC,IAAA,yBAAc,EAAC,eAAe,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACnF,IAAA,iBAAM,EACL,CAAC,IAAA,kCAAuB,EAAC,cAAc,CAAC,MAAM,CAAC,EAC/C,KAAK,CAAC,8DAA8D,CACpE,CAAC;QAEF,0HAA0H;QAC1H,qFAAqF;QACpF,cAA8C,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QAEnE,MAAM,MAAM,GAAG,aAAa,EAAE,CAAC;QAC/B,MAAM,kBAAkB,GAAG,IAAA,iCAAsB,GAAE,CAAC;QAEpD,IAAA,qBAAU,EAAC,cAAc,EAAE,MAAM,CAAC,cAAc,EAAE,EAAE,kBAAkB,EAAE,SAAS,CAAC,CAAC;QACnF,MAAM,cAAc,GAAG,IAAA,2CAAoB,GAAa,CAAC;QACzD,MAAM,MAAM,GAAG,MAAM,CAAC,4BAA4B,EAAE,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAEzC,4EAA4E;YAC5E,sEAAsE;YACtE,IAAA,iBAAM,EAAC,IAAA,oBAAS,EAAC,MAAM,CAAC,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;YACpE,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAA,iBAAM,EAAC,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;YAEvF,MAAM,MAAM,GAAiB;gBAC5B,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,KAAK;gBACxB,OAAO,EAAE,IAAA,gBAAK,EAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC;aAC9B,CAAC;YAEF,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;YACpF,IAAA,iBAAM,EACL,eAAe,CAAC,MAAM,KAAK,KAAK,CAAC,cAAc,EAC/C,KAAK,CAAC,2DAA2D,CACjE,CAAC;YAEF,IAAI,eAAe,CAAC,KAAK,EAAE,CAAC;gBAC3B,IAAA,2CAAoB,EAAC,cAAc,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC;YAED,MAAM,CAAC,SAAS,EAAE,CAAC;QACpB,CAAC;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;CACD;AAED,SAAS,yBAAyB,CACjC,MAAwB,EACxB,UAA2D;IAE3D,MAAM,OAAO,GAAG,IAAA,+BAAmB,EAAC,IAAA,yBAAc,EAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IACtF,OAAO,wBAAwB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,wBAAwB,CAChC,MAAwB,EACxB,UAA2D;IAE3D,MAAM,gBAAgB,GAAG,IAAA,2CAAoB,GAAmB,CAAC;IACjE,iCAAiC,CAChC,uCAAe,CAAC,QAAQ,EACxB,MAAM,CAAC,YAAY,EACnB,MAAM,CAAC,WAAW,EAClB,MAAM,CAAC,WAAW,EAClB,UAAU,EACV,gBAAgB,CAChB,CAAC;IACF,OAAO,gBAAgB,CAAC;AACzB,CAAC;AAED,SAAS,iCAAiC,CACzC,WAA4B,EAC5B,MAAsB,EACtB,KAAuC,EACvC,WAAsC,EACtC,UAA2D,EAC3D,gBAAoD;IAEpD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAA,wCAAgB,EAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,gBAAgB,CACpF,WAAW,CAAC,MAAM,CAClB,CAAC;QAEF,KAAK,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,QAAQ,EAAE,CAAC;YACzD,MAAM,gBAAgB,GAAG,IAAA,uCAAe,EAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC9D,MAAM,WAAW,GAChB,WAAW,KAAK,uCAAe,CAAC,QAAQ,IAAI,OAAO,KAAK,SAAS;gBAChE,CAAC,CAAC,uCAAe,CAAC,QAAQ;gBAC1B,CAAC,CAAC,uCAAe,CAAC,QAAQ,CAAC;YAE7B,gBAAgB,CAAC,GAAG,CAAC,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,CAAC;YAEzF,MAAM,aAAa,GAAG,IAAA,wCAAgB,EAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAChE,IAAI,aAAa,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC9C,iCAAiC,CAChC,WAAW,EACX,aAAa,CAAC,YAAY,EAC1B,KAAK,EACL,WAAW,EACX,UAAU,EACV,gBAAgB,CAChB,CAAC;YACH,CAAC;QACF,CAAC;IACF,CAAC;AACF,CAAC;AAED,SAAS,WAAW,CACnB,MAAwB,EACxB,UAA2D;IAU3D,MAAM,YAAY,GAAG,IAAA,kCAAuB,GAAQ,CAAC;IACrD,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YACvD,YAAY,CAAC,GAAG,CAAC,IAAA,2BAAgB,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACtF,CAAC;IACF,CAAC;IAED,MAAM,YAAY,GAAG,IAAA,2CAAoB,GAAQ,CAAC;IAClD,MAAM,cAAc,GAAG,IAAA,2CAAoB,GAAU,CAAC;IACtD,oBAAoB,CACnB,KAAK,EACL,MAAM,CAAC,YAAY,EACnB,MAAM,CAAC,WAAW,EAClB,MAAM,CAAC,WAAW,EAClB,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,cAAc,CACd,CAAC;IAEF,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AACvD,CAAC;AAED,SAAS,oBAAoB,CAC5B,aAAsB,EACtB,MAAsB,EACtB,KAAuC,EACvC,WAAsC,EACtC,QAAoC,EACpC,UAA2D,EAC3D,YAAqC,EACrC,cAAyC;IAEzC,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAA,wCAAgB,EAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,gBAAgB,CACpF,WAAW,CAAC,MAAM,CAClB,CAAC;QAEF,KAAK,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,QAAQ,EAAE,CAAC;YACnE,MAAM,gBAAgB,GAAG,IAAA,uCAAe,EAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC9D,MAAM,aAAa,GAClB,aAAa;gBACb,CAAC,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;YAEzE,IAAI,aAAa,EAAE,CAAC;gBACnB,YAAY,CAAC,GAAG,CAAC,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/E,CAAC;YAED,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC3B,IAAA,2CAAoB,EAAC,cAAc,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;YACjE,CAAC;YAED,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC5B,IAAA,2CAAoB,EAAC,cAAc,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YAClE,CAAC;YAED,MAAM,aAAa,GAAG,IAAA,wCAAgB,EAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAChE,IAAI,aAAa,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC9C,oBAAoB,CACnB,aAAa,EACb,aAAa,CAAC,YAAY,EAC1B,KAAK,EACL,WAAW,EACX,QAAQ,EACR,UAAU,EACV,YAAY,EACZ,cAAc,CACd,CAAC;YACH,CAAC;QACF,CAAC;IACF,CAAC;AACF,CAAC;AAcD;;;;;;;;;;GAUG;AACH,SAAS,sBAAsB,CAC9B,KAAgB,EAChB,mBAAuD;IAEvD,MAAM,qBAAqB,GAAG,6BAA6B,CAAC,KAAK,CAAC,CAAC;IACnE,MAAM,QAAQ,GAAyB,IAAA,kCAAuB,GAAQ,CAAC;IAEvE,6GAA6G;IAC7G,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,MAAM,QAAQ,GAAG,CAAC,QAAsB,EAAE,KAAa,EAAQ,EAAE;QAChE,KAAK,MAAM,YAAY,IAAI,mBAAmB,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,IAAI,IAAA,6BAAkB,EAAC,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;YAExF,4FAA4F;YAC5F,qFAAqF;YACrF,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtE,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBAClC,MAAM,QAAQ,GAAG,IAAA,6BAAkB,EAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;oBAC9D,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC9C,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;gBACzD,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC,CAAC;IAEF,MAAM,eAAe,GAAG,CAAC,MAAiC,EAAQ,EAAE;QACnE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO;QACR,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBAC/B,QAAQ,CACP,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,IAAA,gBAAK,EAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAClE,IAAI,CAAC,KAAK,CACV,CAAC;gBACH,CAAC;gBACD,sFAAsF;gBACtF,0EAA0E;gBAC1E,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBAC/B,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC9B,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC,CAAC;IAEF,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAE9B,wFAAwF;IACxF,kGAAkG;IAClG,4CAA4C;IAC5C,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM;QACP,CAAC;QACD,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAC3B,4EAA4E;QAC5E,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,EAAE,MAAM,IAAI,CAAC,EAAE,CAAC;YAClD,eAAe,CAAC,qBAAqB,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,IAAA,gBAAK,EAAC,EAAE,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1F,CAAC;IACF,CAAC;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAS,6BAA6B,CAAC,KAAgB;IACtD,MAAM,iBAAiB,GAAmC,IAAI,GAAG,EAAE,CAAC;IAEpE,MAAM,WAAW,GAAG,CAAC,MAAqB,EAAQ,EAAE;QACnD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBAC/B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAEzB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;wBAC/B,IAAA,yBAAc,EACb,iBAAiB,EACjB,IAAI,CAAC,MAAM,CAAC,KAAK,EACjB,IAAI,CAAC,MAAM,CAAC,KAAK,EACjB,IAAI,CAAC,MAAM,CACX,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC,CAAC;IAEF,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAChC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAChC,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YAC3C,IAAA,yBAAc,EAAC,iBAAiB,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC9D,WAAW,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;IAED,OAAO,iBAAiB,CAAC;AAC1B,CAAC;AAED,SAAS,4BAA4B,CAAC,KAAgB;IACrD,MAAM,mBAAmB,GAAG,IAAA,mCAAwB,GAAE,CAAC;IACvD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAChC,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACpD,mBAAmB,CAAC,GAAG,CACtB,IAAA,2BAAgB,EAAC,IAAA,gBAAK,EAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,EACjD,KAAK,EACL,IAAA,2BAAgB,EAAC,IAAA,gBAAK,EAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CACjD,CAAC;QACH,CAAC;IACF,CAAC;IAED,OAAO,mBAAmB,CAAC;AAC5B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tdeltaFieldMapHasChanges,\n\tmakeAnonChange,\n\tmakeChangeAtomId,\n\tmakeDetachedFieldIndex,\n\tnewChangeAtomIdRangeMap,\n\tnewChangeAtomIdTransform,\n\toffsetChangeAtomId,\n\tvisitDelta,\n\ttype ChangeAtomId,\n\ttype ChangeAtomIdMap,\n\ttype ChangeAtomIdRangeMap,\n\ttype DeltaFieldMap,\n\ttype DeltaRoot,\n\ttype FieldKindIdentifier,\n\ttype IEditableForest,\n\ttype TreeChunk,\n} from \"../../core/index.js\";\nimport {\n\tbrand,\n\thasSingle,\n\tsetInNestedMap,\n\ttype Mutable,\n\ttype RangeQueryResult,\n} from \"../../util/index.js\";\nimport {\n\tgetFromChangeAtomIdMap,\n\tnewChangeAtomIdBTree,\n\tsetInChangeAtomIdMap,\n\ttype ChangeAtomIdBTree,\n} from \"../changeAtomIdBTree.js\";\nimport { CrossFieldTarget } from \"./crossFieldQueries.js\";\nimport {\n\tEditFilterStatus,\n\tNodeAttachState,\n\ttype FilterAttachResult,\n\ttype FilterDetachResult,\n} from \"./fieldChangeHandler.js\";\n\nimport type { FlexFieldKind } from \"./fieldKind.js\";\nimport { filterEdits } from \"./filterEdits.js\";\nimport { invertModularChange } from \"./invert.js\";\nimport { intoDelta } from \"./modularChangeFamily.js\";\nimport type {\n\tFieldChange,\n\tFieldChangeMap,\n\tFieldId,\n\tModularChangeset,\n\tNodeChangeset,\n\tNodeId,\n} from \"./modularChangeTypes.js\";\nimport {\n\tgetChangeHandler,\n\tnodeChangeFromId,\n\tnormalizeNodeId,\n\tvalidateChangeset,\n} from \"./modularChangeUtils.js\";\nimport { assert, fail } from \"@fluidframework/core-utils/internal\";\n\n/**\n * \"Minimizes\" a {@link ModularChangeset} so that it contains no extraneous\n * information, i.e. no new content that isn't observable from document tree\n * and no edits without net observed effect on the document tree.\n * @remarks\n * \"Extraneous information\" includes, for example, data for nodes that were both created and removed within the same\n * transaction, or changes whose effects cancel out to nothing. Minimizing reduces the size of an edit without altering\n * its observable effect.\n *\n * @param change - The change to minimize.\n * @param fieldKinds - The field kinds used in the changeset.\n * @param forestFactory - A function that returns a new forest instance.\n */\nexport function minimizeModularChangeset(\n\tchange: ModularChangeset,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n\tforestFactory: () => IEditableForest,\n): ModularChangeset {\n\treturn new ModularChangeMinimizer(change, fieldKinds).minimize(forestFactory);\n}\n\nclass ModularChangeMinimizer {\n\tprivate readonly builtNodeIds: ChangeAtomIdBTree<true>;\n\tprivate readonly builtRootIds: ChangeAtomIdRangeMap<true>;\n\tprivate readonly outputAttachStates: ChangeAtomIdBTree<NodeAttachState>;\n\tprivate readonly outputToInputRootId: ChangeAtomIdRangeMap<ChangeAtomId>;\n\tprivate readonly rootIdToNodeId: ChangeAtomIdBTree<NodeId>;\n\tprivate readonly attachedRootIds: ChangeAtomIdRangeSet;\n\n\tpublic constructor(\n\t\tprivate readonly change: ModularChangeset,\n\t\tprivate readonly fieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n\t) {\n\t\tthis.outputAttachStates = getOutputNodeAttachStates(change, fieldKinds);\n\t\tconst nodeInfo = getNodeInfo(change, fieldKinds);\n\t\tthis.builtNodeIds = nodeInfo.builtNodeIds;\n\t\tthis.builtRootIds = nodeInfo.builtRootIds;\n\t\tthis.rootIdToNodeId = nodeInfo.rootIdToNodeId;\n\n\t\tconst delta = intoDelta(makeAnonChange(change), fieldKinds);\n\t\tthis.outputToInputRootId = outputToInputRootIdFromDelta(delta);\n\t\tthis.attachedRootIds = collectAttachedRootIds(delta, this.outputToInputRootId);\n\t}\n\n\tpublic minimize(forestFactory: () => IEditableForest): ModularChangeset {\n\t\tconst residualChange = filterEdits(\n\t\t\tthis.change,\n\t\t\tthis.filterEditsForResidualChange.bind(this),\n\t\t\tthis.fieldKinds,\n\t\t);\n\n\t\t(residualChange as Mutable<ModularChangeset>).builds = this.squashBuilds(forestFactory);\n\t\tvalidateChangeset(residualChange, this.fieldKinds);\n\t\treturn residualChange;\n\t}\n\n\tprivate isNodeIdInBuiltTree(nodeId: NodeId | undefined): boolean {\n\t\treturn (\n\t\t\tnodeId !== undefined &&\n\t\t\tgetFromChangeAtomIdMap(\n\t\t\t\tthis.builtNodeIds,\n\t\t\t\tnormalizeNodeId(nodeId, this.change.nodeAliases),\n\t\t\t) === true\n\t\t);\n\t}\n\n\tprivate isNodeDetachedInOutput(nodeId: NodeId): boolean {\n\t\treturn (\n\t\t\t(getFromChangeAtomIdMap(\n\t\t\t\tthis.outputAttachStates,\n\t\t\t\tnormalizeNodeId(nodeId, this.change.nodeAliases),\n\t\t\t) ?? fail(0xd37 /* Should have attach state for every node ID */)) ===\n\t\t\tNodeAttachState.Detached\n\t\t);\n\t}\n\n\tprivate isFieldDetachedInOutput(fieldId: FieldId): boolean {\n\t\treturn fieldId.nodeId !== undefined && this.isNodeDetachedInOutput(fieldId.nodeId);\n\t}\n\n\tprivate shouldSquashDetach(\n\t\tfieldId: FieldId,\n\t\tinputRootId: ChangeAtomId | undefined,\n\t): boolean {\n\t\t// `inputRootId === undefined` indicates that this is a move of a transiently attached built root.\n\t\t// In that case, we convert the move to an insert at the final location, discarding the detach portion.\n\t\treturn this.isNodeIdInBuiltTree(fieldId.nodeId) && inputRootId === undefined;\n\t}\n\n\tprivate shouldSquashAttach(\n\t\tfieldId: FieldId,\n\t\trootInputId: ChangeAtomId,\n\t\tcount: number,\n\t\tendpoint: FieldId | undefined,\n\t): RangeQueryResult<boolean> {\n\t\tif (!this.isNodeIdInBuiltTree(fieldId.nodeId)) {\n\t\t\treturn { value: false, length: count };\n\t\t}\n\n\t\tlet countProcessed = count;\n\t\tconst isMoveOfBuiltRootEntry = this.builtRootIds.getFirst(rootInputId, countProcessed);\n\t\tcountProcessed = isMoveOfBuiltRootEntry.length;\n\n\t\tconst isAttachOfBuiltRoot = isMoveOfBuiltRootEntry?.value ?? false;\n\t\tconst isMoveFromBuiltTree =\n\t\t\tendpoint?.nodeId !== undefined && this.isNodeIdInBuiltTree(endpoint.nodeId);\n\n\t\tconst isAttachOfBuiltNode = isAttachOfBuiltRoot || isMoveFromBuiltTree;\n\t\treturn { value: isAttachOfBuiltNode, length: countProcessed };\n\t}\n\n\tprivate shouldDropAttach(\n\t\tfieldId: FieldId,\n\t\trootInputId: ChangeAtomId,\n\t\tcount: number,\n\t\tendpoint: FieldId | undefined,\n\t): RangeQueryResult<boolean> {\n\t\tconst isInDetachedTree = this.isFieldDetachedInOutput(fieldId);\n\n\t\tlet countProcessed = count;\n\t\tconst shouldSquashAttachEntry = this.shouldSquashAttach(\n\t\t\tfieldId,\n\t\t\trootInputId,\n\t\t\tcountProcessed,\n\t\t\tendpoint,\n\t\t);\n\t\tcountProcessed = shouldSquashAttachEntry.length;\n\n\t\tconst isBuiltRootEntry = this.builtRootIds.getFirst(rootInputId, countProcessed);\n\t\tcountProcessed = isBuiltRootEntry.length;\n\n\t\tconst isAttachOfBuild =\n\t\t\tisBuiltRootEntry.value ??\n\t\t\t(endpoint !== undefined && this.isNodeIdInBuiltTree(endpoint.nodeId));\n\n\t\tconst isAttachedRootEntry = this.attachedRootIds.getFirst(rootInputId, countProcessed);\n\t\tcountProcessed = isAttachedRootEntry.length;\n\n\t\tconst isTransientAttachOfBuild = isAttachOfBuild && !isAttachedRootEntry.value;\n\t\treturn {\n\t\t\tvalue: isInDetachedTree || shouldSquashAttachEntry.value || isTransientAttachOfBuild,\n\t\t\tlength: countProcessed,\n\t\t};\n\t}\n\n\tprivate shouldDropDetach(\n\t\tfieldId: FieldId,\n\t\tdetachId: ChangeAtomId,\n\t\trootInputId: ChangeAtomId | undefined,\n\t\tcount: number,\n\t\tendpoint: FieldId | undefined,\n\t): RangeQueryResult<boolean> {\n\t\tlet countProcessed = count;\n\t\tif (this.shouldSquashDetach(fieldId, rootInputId)) {\n\t\t\treturn { value: true, length: countProcessed };\n\t\t}\n\n\t\tif (rootInputId !== undefined) {\n\t\t\t// `inputRootId` is defined when this detach represents the rename of a detached root.\n\t\t\tconst isDetachOfBuiltRootEntry = this.builtRootIds.getFirst(rootInputId, countProcessed);\n\t\t\tcountProcessed = isDetachOfBuiltRootEntry.length;\n\t\t\tconst isDetachOfBuiltRoot = isDetachOfBuiltRootEntry.value !== undefined;\n\t\t\tif (isDetachOfBuiltRoot)\n\t\t\t\t// If this is a rename of a built node, either it ends detached, or is moved elsewhere.\n\t\t\t\t// If moved, we squash the detach away, leaving only an attach at the destination.\n\t\t\t\t// If detached, the build is not used, so we drop the rename.\n\t\t\t\treturn {\n\t\t\t\t\tvalue: true,\n\t\t\t\t\tlength: countProcessed,\n\t\t\t\t};\n\t\t}\n\n\t\tif (endpoint !== undefined) {\n\t\t\tconst shouldDropAttachEntry = this.shouldDropAttach(\n\t\t\t\tendpoint,\n\t\t\t\trootInputId ?? detachId,\n\t\t\t\tcountProcessed,\n\t\t\t\tfieldId,\n\t\t\t);\n\t\t\tcountProcessed = shouldDropAttachEntry.length;\n\n\t\t\tif (!shouldDropAttachEntry.value) {\n\t\t\t\t// This detach is part of a move, and we are not dropping the attach, so we must preserve the detach as well.\n\t\t\t\treturn { value: false, length: countProcessed };\n\t\t\t}\n\t\t}\n\n\t\treturn { value: this.isFieldDetachedInOutput(fieldId), length: countProcessed };\n\t}\n\n\tprivate filterEditsForBuildChange(fieldChange: FieldChange, fieldId: FieldId): FieldChange {\n\t\treturn {\n\t\t\t...fieldChange,\n\t\t\tchange: brand(\n\t\t\t\tgetChangeHandler(this.fieldKinds, fieldChange.fieldKind).rebaser.filterEdits(\n\t\t\t\t\tfieldChange.change,\n\t\t\t\t\t{\n\t\t\t\t\t\tfilterDetach: (detachId, count, inputRootId, endpoint) =>\n\t\t\t\t\t\t\tthis.filterDetachForBuildChange(fieldId, detachId, count, inputRootId, endpoint),\n\t\t\t\t\t\tfilterAttach: (id, count, _outputRootId, endpoint) =>\n\t\t\t\t\t\t\tthis.filterAttachForBuildChange(fieldId, id, count, endpoint),\n\t\t\t\t\t\tpreserveOtherEdits: false,\n\t\t\t\t\t},\n\t\t\t\t),\n\t\t\t),\n\t\t};\n\t}\n\n\tprivate filterDetachForBuildChange(\n\t\tfieldId: FieldId,\n\t\tdetachId: ChangeAtomId,\n\t\tcount: number,\n\t\tinputRootId: ChangeAtomId | undefined,\n\t\tendpoint?: ChangeAtomId,\n\t): RangeQueryResult<FilterDetachResult> {\n\t\tif (!this.shouldSquashDetach(fieldId, inputRootId)) {\n\t\t\treturn {\n\t\t\t\tvalue: { action: EditFilterStatus.Remove, shouldRemoveChild: false },\n\t\t\t\tlength: count,\n\t\t\t};\n\t\t}\n\n\t\tlet countProcessed = count;\n\t\tconst moveEndpointEntry = this.change.crossFieldKeys.getFirst(\n\t\t\t{ ...(endpoint ?? detachId), target: CrossFieldTarget.Destination },\n\t\t\tcountProcessed,\n\t\t);\n\t\tcountProcessed = moveEndpointEntry.length;\n\n\t\tif (moveEndpointEntry.value !== undefined) {\n\t\t\tconst willSquashEndpointEntry = this.shouldSquashAttach(\n\t\t\t\tmoveEndpointEntry.value,\n\t\t\t\tinputRootId ?? detachId,\n\t\t\t\tcountProcessed,\n\t\t\t\tfieldId,\n\t\t\t);\n\t\t\tcountProcessed = willSquashEndpointEntry.length;\n\n\t\t\tconst action = willSquashEndpointEntry.value\n\t\t\t\t? EditFilterStatus.Preserve\n\t\t\t\t: EditFilterStatus.PreserveWithoutMove;\n\n\t\t\treturn { value: { action }, length: countProcessed };\n\t\t}\n\n\t\treturn { value: { action: EditFilterStatus.Preserve }, length: countProcessed };\n\t}\n\n\tprivate filterAttachForBuildChange(\n\t\tfieldId: FieldId,\n\t\tid: ChangeAtomId,\n\t\tcount: number,\n\t\tendpoint?: ChangeAtomId,\n\t): RangeQueryResult<FilterAttachResult> {\n\t\tlet countProcessed = count;\n\t\tconst moveId = endpoint ?? id;\n\t\tconst moveEndpointEntry = this.change.crossFieldKeys.getFirst(\n\t\t\t{ ...moveId, target: CrossFieldTarget.Source },\n\t\t\tcountProcessed,\n\t\t);\n\t\tcountProcessed = moveEndpointEntry.length;\n\n\t\tconst inputIdEntry = this.outputToInputRootId.getFirst(moveId, countProcessed);\n\t\tcountProcessed = inputIdEntry.length;\n\n\t\tconst rootInputId = inputIdEntry.value ?? moveId;\n\t\tconst shouldSquashEntry = this.shouldSquashAttach(\n\t\t\tfieldId,\n\t\t\trootInputId,\n\t\t\tcountProcessed,\n\t\t\tmoveEndpointEntry.value,\n\t\t);\n\t\tcountProcessed = shouldSquashEntry.length;\n\n\t\tconst isMove = moveEndpointEntry.value !== undefined;\n\t\tif (!shouldSquashEntry.value) {\n\t\t\treturn { value: { action: EditFilterStatus.Remove }, length: countProcessed };\n\t\t}\n\n\t\tif (isMove) {\n\t\t\tconst movedNodeId = getFromChangeAtomIdMap(this.rootIdToNodeId, moveId);\n\t\t\treturn {\n\t\t\t\tvalue: {\n\t\t\t\t\taction: EditFilterStatus.PreserveWithoutMove,\n\t\t\t\t\tnodeId: movedNodeId,\n\t\t\t\t\tnewAttachId: rootInputId,\n\t\t\t\t},\n\t\t\t\tlength: countProcessed,\n\t\t\t};\n\t\t}\n\n\t\treturn {\n\t\t\tvalue: { action: EditFilterStatus.Preserve },\n\t\t\tlength: countProcessed,\n\t\t};\n\t}\n\n\t/**\n\t * Returns a version of `fieldChange` to be used in the final minimized change.\n\t * The filtered change will have dropped:\n\t * - Edits which were squashed into the built trees.\n\t * - Detaches of built roots. If part of a move, these are instead represented as an attach at the final location.\n\t * - Edits to nodes which are detached in the output, except for detaches of content which does end attached.\n\t */\n\tprivate filterEditsForResidualChange(\n\t\tfieldChange: FieldChange,\n\t\tfieldId: FieldId,\n\t): FieldChange {\n\t\treturn {\n\t\t\t...fieldChange,\n\t\t\tchange: brand(\n\t\t\t\tgetChangeHandler(this.fieldKinds, fieldChange.fieldKind).rebaser.filterEdits(\n\t\t\t\t\tfieldChange.change,\n\t\t\t\t\t{\n\t\t\t\t\t\tfilterDetach: (...args) => this.filterDetachForResidualChange(fieldId, ...args),\n\t\t\t\t\t\tfilterAttach: (...args) => this.filterAttachForResidualChange(fieldId, ...args),\n\t\t\t\t\t\tpreserveOtherEdits: false,\n\t\t\t\t\t},\n\t\t\t\t),\n\t\t\t),\n\t\t};\n\t}\n\n\tprivate filterDetachForResidualChange(\n\t\tfieldId: FieldId,\n\t\tdetachId: ChangeAtomId,\n\t\tcount: number,\n\t\tinputRootId: ChangeAtomId | undefined,\n\t\tendpoint?: ChangeAtomId,\n\t): RangeQueryResult<FilterDetachResult> {\n\t\tlet countProcessed = count;\n\t\tconst moveId = endpoint ?? detachId;\n\t\tconst moveEndpointEntry = this.change.crossFieldKeys.getFirst(\n\t\t\t{ ...moveId, target: CrossFieldTarget.Destination },\n\t\t\tcount,\n\t\t);\n\t\tcountProcessed = moveEndpointEntry.length;\n\n\t\tconst shouldDropEntry = this.shouldDropDetach(\n\t\t\tfieldId,\n\t\t\tdetachId,\n\t\t\tinputRootId,\n\t\t\tcountProcessed,\n\t\t\tmoveEndpointEntry.value,\n\t\t);\n\t\tcountProcessed = shouldDropEntry.length;\n\n\t\tlet hasPreservedAttach = false;\n\t\tlet hasDroppedAttach = false;\n\t\tif (moveEndpointEntry.value !== undefined) {\n\t\t\tconst willDropAttachEntry = this.shouldDropAttach(\n\t\t\t\tmoveEndpointEntry.value,\n\t\t\t\tinputRootId ?? detachId,\n\t\t\t\tcountProcessed,\n\t\t\t\tfieldId,\n\t\t\t);\n\t\t\tcountProcessed = willDropAttachEntry.length;\n\t\t\thasDroppedAttach = willDropAttachEntry.value;\n\t\t\thasPreservedAttach = !willDropAttachEntry.value;\n\t\t}\n\n\t\tif (shouldDropEntry.value) {\n\t\t\t// If there is a preserved attach, we will represent any child change at that location,\n\t\t\t// so we must remove them from here.\n\t\t\treturn {\n\t\t\t\tvalue: { action: EditFilterStatus.Remove, shouldRemoveChild: hasPreservedAttach },\n\t\t\t\tlength: countProcessed,\n\t\t\t};\n\t\t}\n\n\t\treturn {\n\t\t\tvalue: {\n\t\t\t\taction: hasDroppedAttach\n\t\t\t\t\t? EditFilterStatus.PreserveWithoutMove\n\t\t\t\t\t: EditFilterStatus.Preserve,\n\t\t\t},\n\t\t\tlength: countProcessed,\n\t\t};\n\t}\n\n\tprivate filterAttachForResidualChange(\n\t\tfieldId: FieldId,\n\t\tid: ChangeAtomId,\n\t\tcount: number,\n\t\toutputRootId: ChangeAtomId | undefined,\n\t\tendpoint?: ChangeAtomId,\n\t): RangeQueryResult<FilterAttachResult> {\n\t\tlet countProcessed = count;\n\t\tconst moveId = endpoint ?? id;\n\t\tconst moveEndpointEntry = this.change.crossFieldKeys.getFirst(\n\t\t\t{ ...moveId, target: CrossFieldTarget.Source },\n\t\t\tcountProcessed,\n\t\t);\n\t\tcountProcessed = moveEndpointEntry.length;\n\n\t\tconst inputIdEntry = this.outputToInputRootId.getFirst(moveId, countProcessed);\n\t\tcountProcessed = inputIdEntry.length;\n\n\t\tconst rootInputId = inputIdEntry.value ?? moveId;\n\t\tconst shouldDropEntry = this.shouldDropAttach(\n\t\t\tfieldId,\n\t\t\trootInputId,\n\t\t\tcountProcessed,\n\t\t\tmoveEndpointEntry.value,\n\t\t);\n\t\tcountProcessed = shouldDropEntry.length;\n\n\t\tif (shouldDropEntry.value) {\n\t\t\treturn {\n\t\t\t\tvalue: { action: EditFilterStatus.Remove },\n\t\t\t\tlength: countProcessed,\n\t\t\t};\n\t\t}\n\n\t\tif (moveEndpointEntry.value !== undefined) {\n\t\t\tconst willDropEndpointEntry = this.shouldDropDetach(\n\t\t\t\tmoveEndpointEntry.value,\n\t\t\t\tmoveId,\n\t\t\t\tinputIdEntry.value,\n\t\t\t\tcountProcessed,\n\t\t\t\tfieldId,\n\t\t\t);\n\t\t\tcountProcessed = willDropEndpointEntry.length;\n\t\t\tif (willDropEndpointEntry.value) {\n\t\t\t\tconst movedNodeId = getFromChangeAtomIdMap(this.rootIdToNodeId, moveId);\n\t\t\t\treturn {\n\t\t\t\t\tvalue: {\n\t\t\t\t\t\taction: EditFilterStatus.PreserveWithoutMove,\n\t\t\t\t\t\tnodeId: movedNodeId,\n\t\t\t\t\t\tnewAttachId: inputIdEntry.value ?? moveId,\n\t\t\t\t\t},\n\t\t\t\t\tlength: countProcessed,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn {\n\t\t\tvalue: { action: EditFilterStatus.Preserve },\n\t\t\tlength: countProcessed,\n\t\t};\n\t}\n\n\tprivate squashBuilds(forestFactory: () => IEditableForest): ChangeAtomIdBTree<TreeChunk> {\n\t\tconst changeForBuilds = filterEdits(\n\t\t\tthis.change,\n\t\t\tthis.filterEditsForBuildChange.bind(this),\n\t\t\tthis.fieldKinds,\n\t\t);\n\n\t\tconst deltaForBuilds = intoDelta(makeAnonChange(changeForBuilds), this.fieldKinds);\n\t\tassert(\n\t\t\t!deltaFieldMapHasChanges(deltaForBuilds.fields),\n\t\t\t0xd38 /* Expected all changes to attached tree to be filtered out */,\n\t\t);\n\n\t\t// There may still be paths to existing nodes in the delta, which must be removed before being applied to an empty forest.\n\t\t// It is safe to remove these, because there are no edits to them, as asserted above.\n\t\t(deltaForBuilds as Mutable<DeltaRoot<unknown>>).fields = new Map();\n\n\t\tconst forest = forestFactory();\n\t\tconst detachedFieldIndex = makeDetachedFieldIndex();\n\n\t\tvisitDelta(deltaForBuilds, forest.acquireVisitor(), detachedFieldIndex, undefined);\n\t\tconst squashedBuilds = newChangeAtomIdBTree<TreeChunk>();\n\t\tconst cursor = forest.getCursorAboveDetachedFields();\n\t\tfor (const entry of detachedFieldIndex.entries()) {\n\t\t\tcursor.enterField(detachedFieldIndex.toFieldKey(entry.root));\n\t\t\tconst chunks = forest.chunkField(cursor);\n\n\t\t\t// Delta visiting currently splits ranges of nodes into individual elements,\n\t\t\t// so for now we will not have more than one node in a detached field.\n\t\t\tassert(hasSingle(chunks), 0xd39 /* TODO: Handle multiple chunks */);\n\t\t\tconst chunk = chunks[0];\n\t\t\tassert(chunk.topLevelLength === 1, 0xd3a /* TODO: Handle chunk with range of nodes */);\n\n\t\t\tconst rootId: ChangeAtomId = {\n\t\t\t\trevision: entry.id.major,\n\t\t\t\tlocalId: brand(entry.id.minor),\n\t\t\t};\n\n\t\t\tconst isAttachedEntry = this.attachedRootIds.getFirst(rootId, chunk.topLevelLength);\n\t\t\tassert(\n\t\t\t\tisAttachedEntry.length === chunk.topLevelLength,\n\t\t\t\t0xd3b /* TODO: Handle chunks which are only partially attached */,\n\t\t\t);\n\n\t\t\tif (isAttachedEntry.value) {\n\t\t\t\tsetInChangeAtomIdMap(squashedBuilds, rootId, chunk);\n\t\t\t}\n\n\t\t\tcursor.exitField();\n\t\t}\n\n\t\treturn squashedBuilds;\n\t}\n}\n\nfunction getOutputNodeAttachStates(\n\tchange: ModularChangeset,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): ChangeAtomIdBTree<NodeAttachState> {\n\tconst inverse = invertModularChange(makeAnonChange(change), true, \"root\", fieldKinds);\n\treturn getInputNodeAttachStates(inverse, fieldKinds);\n}\n\nfunction getInputNodeAttachStates(\n\tchange: ModularChangeset,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): ChangeAtomIdBTree<NodeAttachState> {\n\tconst nodeAttachStates = newChangeAtomIdBTree<NodeAttachState>();\n\taddInputNodeAttachStatesForFields(\n\t\tNodeAttachState.Attached,\n\t\tchange.fieldChanges,\n\t\tchange.nodeChanges,\n\t\tchange.nodeAliases,\n\t\tfieldKinds,\n\t\tnodeAttachStates,\n\t);\n\treturn nodeAttachStates;\n}\n\nfunction addInputNodeAttachStatesForFields(\n\tparentState: NodeAttachState,\n\tfields: FieldChangeMap,\n\tnodes: ChangeAtomIdBTree<NodeChangeset>,\n\tnodeAliases: ChangeAtomIdBTree<NodeId>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n\tnodeAttachStates: ChangeAtomIdBTree<NodeAttachState>,\n): void {\n\tfor (const fieldChange of fields.values()) {\n\t\tconst children = getChangeHandler(fieldKinds, fieldChange.fieldKind).getNestedChanges(\n\t\t\tfieldChange.change,\n\t\t);\n\n\t\tfor (const { nodeId, inputRootId: inputId } of children) {\n\t\t\tconst normalizedNodeId = normalizeNodeId(nodeId, nodeAliases);\n\t\t\tconst attachState =\n\t\t\t\tparentState === NodeAttachState.Attached && inputId === undefined\n\t\t\t\t\t? NodeAttachState.Attached\n\t\t\t\t\t: NodeAttachState.Detached;\n\n\t\t\tnodeAttachStates.set([normalizedNodeId.revision, normalizedNodeId.localId], attachState);\n\n\t\t\tconst nodeChangeset = nodeChangeFromId(nodes, normalizedNodeId);\n\t\t\tif (nodeChangeset.fieldChanges !== undefined) {\n\t\t\t\taddInputNodeAttachStatesForFields(\n\t\t\t\t\tattachState,\n\t\t\t\t\tnodeChangeset.fieldChanges,\n\t\t\t\t\tnodes,\n\t\t\t\t\tnodeAliases,\n\t\t\t\t\tfieldKinds,\n\t\t\t\t\tnodeAttachStates,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction getNodeInfo(\n\tchange: ModularChangeset,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): {\n\treadonly builtRootIds: ChangeAtomIdRangeMap<true>;\n\treadonly builtNodeIds: ChangeAtomIdBTree<true>;\n\t/**\n\t * Maps from the input context ID for roots which are already detached,\n\t * or detach ID for roots which are detached or moved by `change`.\n\t */\n\treadonly rootIdToNodeId: ChangeAtomIdBTree<NodeId>;\n} {\n\tconst builtRootIds = newChangeAtomIdRangeMap<true>();\n\tif (change.builds !== undefined) {\n\t\tfor (const [rootId, chunk] of change.builds.entries()) {\n\t\t\tbuiltRootIds.set(makeChangeAtomId(rootId[1], rootId[0]), chunk.topLevelLength, true);\n\t\t}\n\t}\n\n\tconst builtNodeIds = newChangeAtomIdBTree<true>();\n\tconst rootIdToNodeId = newChangeAtomIdBTree<NodeId>();\n\taddNodeInfoForFields(\n\t\tfalse,\n\t\tchange.fieldChanges,\n\t\tchange.nodeChanges,\n\t\tchange.nodeAliases,\n\t\tbuiltRootIds,\n\t\tfieldKinds,\n\t\tbuiltNodeIds,\n\t\trootIdToNodeId,\n\t);\n\n\treturn { builtRootIds, builtNodeIds, rootIdToNodeId };\n}\n\nfunction addNodeInfoForFields(\n\tparentIsBuilt: boolean,\n\tfields: FieldChangeMap,\n\tnodes: ChangeAtomIdBTree<NodeChangeset>,\n\tnodeAliases: ChangeAtomIdBTree<NodeId>,\n\tbuildIds: ChangeAtomIdRangeMap<true>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n\tbuiltNodeIds: ChangeAtomIdBTree<true>,\n\trootIdToNodeId: ChangeAtomIdBTree<NodeId>,\n): void {\n\tfor (const fieldChange of fields.values()) {\n\t\tconst children = getChangeHandler(fieldKinds, fieldChange.fieldKind).getNestedChanges(\n\t\t\tfieldChange.change,\n\t\t);\n\n\t\tfor (const { nodeId, inputRootId: inputId, detachId } of children) {\n\t\t\tconst normalizedNodeId = normalizeNodeId(nodeId, nodeAliases);\n\t\t\tconst isPartOfBuild =\n\t\t\t\tparentIsBuilt ||\n\t\t\t\t(inputId !== undefined && buildIds.getFirst(inputId, 1).value === true);\n\n\t\t\tif (isPartOfBuild) {\n\t\t\t\tbuiltNodeIds.set([normalizedNodeId.revision, normalizedNodeId.localId], true);\n\t\t\t}\n\n\t\t\tif (inputId !== undefined) {\n\t\t\t\tsetInChangeAtomIdMap(rootIdToNodeId, inputId, normalizedNodeId);\n\t\t\t}\n\n\t\t\tif (detachId !== undefined) {\n\t\t\t\tsetInChangeAtomIdMap(rootIdToNodeId, detachId, normalizedNodeId);\n\t\t\t}\n\n\t\t\tconst nodeChangeset = nodeChangeFromId(nodes, normalizedNodeId);\n\t\t\tif (nodeChangeset.fieldChanges !== undefined) {\n\t\t\t\taddNodeInfoForFields(\n\t\t\t\t\tisPartOfBuild,\n\t\t\t\t\tnodeChangeset.fieldChanges,\n\t\t\t\t\tnodes,\n\t\t\t\t\tnodeAliases,\n\t\t\t\t\tbuildIds,\n\t\t\t\t\tfieldKinds,\n\t\t\t\t\tbuiltNodeIds,\n\t\t\t\t\trootIdToNodeId,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n}\n\n/** A contiguous run of node IDs starting at `id` and spanning `count` consecutive IDs. */\ninterface ChangeAtomIdRange {\n\treadonly id: ChangeAtomId;\n\treadonly count: number;\n}\n\n/**\n * A set of node IDs, stored as a {@link ChangeAtomIdRangeMap} so that consecutive runs of IDs are\n * represented (and marked/queried) as ranges rather than one entry per ID.\n */\ntype ChangeAtomIdRangeSet = ChangeAtomIdRangeMap<true>;\n\n/**\n * Collects the set of root IDs whose content ends up attached within the live document tree\n * once the given change is applied.\n * There are entries both for nodes which are detached in the input context,\n * and also for nodes which are detached by this delta.\n * The keys are pre-rename IDs.\n *\n * @remarks\n * These are the \"used\" nodes: any build whose nodes are not in this set has no observable\n * effect on the resulting document and can be dropped.\n */\nfunction collectAttachedRootIds(\n\tdelta: DeltaRoot,\n\toutputToInputRootId: ChangeAtomIdRangeMap<ChangeAtomId>,\n): ChangeAtomIdRangeSet {\n\tconst detachIdToNodeChanges = getDeltaNodeChangesByDetachId(delta);\n\tconst attached: ChangeAtomIdRangeSet = newChangeAtomIdRangeMap<true>();\n\n\t// Worklist of detached node ID ranges newly discovered to be live, whose own nested content must be visited.\n\tconst worklist: ChangeAtomIdRange[] = [];\n\tconst markLive = (attachId: ChangeAtomId, count: number): void => {\n\t\tfor (const inputIdEntry of outputToInputRootId.getAll(attachId, count)) {\n\t\t\tconst inputId = inputIdEntry.value ?? offsetChangeAtomId(attachId, inputIdEntry.offset);\n\n\t\t\t// Only the sub-ranges of `[id, id + count)` that are not already live are newly discovered.\n\t\t\t// Mark each such run live in a single range operation and enqueue it for processing.\n\t\t\tfor (const fragment of attached.getAll(inputId, inputIdEntry.length)) {\n\t\t\t\tif (fragment.value === undefined) {\n\t\t\t\t\tconst runStart = offsetChangeAtomId(inputId, fragment.offset);\n\t\t\t\t\tattached.set(runStart, fragment.length, true);\n\t\t\t\t\tworklist.push({ id: runStart, count: fragment.length });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n\n\tconst visitLiveFields = (fields: DeltaFieldMap | undefined): void => {\n\t\tif (fields === undefined) {\n\t\t\treturn;\n\t\t}\n\t\tfor (const field of fields.values()) {\n\t\t\tfor (const mark of field.marks) {\n\t\t\t\tif (mark.attach !== undefined) {\n\t\t\t\t\tmarkLive(\n\t\t\t\t\t\t{ revision: mark.attach.major, localId: brand(mark.attach.minor) },\n\t\t\t\t\t\tmark.count,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\t// `mark.fields` edits the cell's pre-existing content. Only descend when that content\n\t\t\t\t// stays in the live tree (i.e. it is not being detached out of the tree).\n\t\t\t\tif (mark.detach === undefined) {\n\t\t\t\t\tvisitLiveFields(mark.fields);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n\n\tvisitLiveFields(delta.fields);\n\n\t// Process node ranges discovered to be live: pull in their nested content and propagate\n\t// liveness backwards across renames (a node attached under its post-rename ID was built under its\n\t// pre-rename ID). Iterate to a fixed point.\n\twhile (worklist.length > 0) {\n\t\tconst next = worklist.pop();\n\t\tif (next === undefined) {\n\t\t\tbreak;\n\t\t}\n\t\tconst { id, count } = next;\n\t\t// Nested content is keyed per node, so it must be visited one ID at a time.\n\t\tfor (let offset = 0; offset < count; offset += 1) {\n\t\t\tvisitLiveFields(detachIdToNodeChanges.get(id.revision)?.get(brand(id.localId + offset)));\n\t\t}\n\t}\n\n\treturn attached;\n}\n\n/**\n * Returns a mapping from root ID to the field changes for that node.\n * There are entries both for nodes which are detached in the input context,\n * and also for nodes which are detached by this delta.\n * The keys are pre-rename IDs.\n */\nfunction getDeltaNodeChangesByDetachId(delta: DeltaRoot): ChangeAtomIdMap<DeltaFieldMap> {\n\tconst detachIdToChanges: ChangeAtomIdMap<DeltaFieldMap> = new Map();\n\n\tconst visitFields = (fields: DeltaFieldMap): void => {\n\t\tfor (const fieldChange of fields.values()) {\n\t\t\tfor (const mark of fieldChange.marks) {\n\t\t\t\tif (mark.fields !== undefined) {\n\t\t\t\t\tvisitFields(mark.fields);\n\n\t\t\t\t\tif (mark.detach !== undefined) {\n\t\t\t\t\t\tsetInNestedMap(\n\t\t\t\t\t\t\tdetachIdToChanges,\n\t\t\t\t\t\t\tmark.detach.major,\n\t\t\t\t\t\t\tmark.detach.minor,\n\t\t\t\t\t\t\tmark.fields,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n\n\tif (delta.fields !== undefined) {\n\t\tvisitFields(delta.fields);\n\t}\n\n\tif (delta.global !== undefined) {\n\t\tfor (const { id, fields } of delta.global) {\n\t\t\tsetInNestedMap(detachIdToChanges, id.major, id.minor, fields);\n\t\t\tvisitFields(fields);\n\t\t}\n\t}\n\n\treturn detachIdToChanges;\n}\n\nfunction outputToInputRootIdFromDelta(delta: DeltaRoot): ChangeAtomIdRangeMap<ChangeAtomId> {\n\tconst outputToInputRootId = newChangeAtomIdTransform();\n\tif (delta.rename !== undefined) {\n\t\tfor (const { oldId, newId, count } of delta.rename) {\n\t\t\toutputToInputRootId.set(\n\t\t\t\tmakeChangeAtomId(brand(newId.minor), newId.major),\n\t\t\t\tcount,\n\t\t\t\tmakeChangeAtomId(brand(oldId.minor), oldId.major),\n\t\t\t);\n\t\t}\n\t}\n\n\treturn outputToInputRootId;\n}\n"]}