@fluidframework/tree 2.117.0 → 3.0.0

package/lib/feature-libraries/modular-schema/invert.js.map

@@ -1 +1 @@
-{"version":3,"file":"invert.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/invert.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EACN,8BAA8B,GAS9B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,KAAK,EAAE,oBAAoB,EAAoB,MAAM,qBAAqB,CAAC;AACpF,OAAO,EACN,oBAAoB,EACpB,oBAAoB,GAEpB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACN,qBAAqB,GAQrB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,2BAA2B,EAC3B,YAAY,EACZ,oBAAoB,EACpB,kBAAkB,EAClB,kBAAkB,EAClB,0BAA0B,GAE1B,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAE1D;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAClC,MAAsC,EACtC,UAAmB,EACnB,iBAA8B,EAC9B,UAA2D;IAE3D,iFAAiF;IACjF,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAE7E,wEAAwE;IACxE,MAAM,CACL,MAAM,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,EACpC,KAAK,CAAC,6CAA6C,CACnD,CAAC;IAEF,MAAM,QAAQ,GAAmB,UAAU;QAC1C,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;QAChE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;IAErC,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,0BAA0B,CAAC;IACpE,MAAM,0BAA0B,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC;IAEpE,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,OAAO,oBAAoB,CAAC;YAC3B,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAe;YACpC,SAAS,EAAE,QAAQ;YACnB,QAAQ;SACR,CAAC,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAgB,oBAAoB,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;IAE3E,MAAM,eAAe,GAAgB;QACpC,GAAG,kBAAkB,EAAe;QACpC,sBAAsB,EAAE,IAAI,GAAG,EAAE;QACjC,oBAAoB,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;KAC/D,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,MAAM,gBAAgB,GAAG,8BAA8B,CAAC,WAAW,CAAC,CAAC;IAErE,MAAM,cAAc,GAAG,cAAc,CACpC,MAAM,CAAC,MAAM,CAAC,YAAY,EAC1B,SAAS,EACT,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,UAAU,CACV,CAAC;IAEF,MAAM,aAAa,GAAG,oBAAoB,EAAiB,CAAC;IAC5D,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,aAAa,EAAE,EAAE;QAC5E,aAAa,CAAC,GAAG,CAChB,CAAC,QAAQ,EAAE,OAAO,CAAC,EACnB,gBAAgB,CACf,aAAa,EACb,EAAE,QAAQ,EAAE,OAAO,EAAE,EACrB,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,UAAU,CACV,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;QACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QAC9C,KAAK,MAAM,WAAW,IAAI,cAAc,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,WAAW,CAAC,MAAM,CAAC;YAC/C,MAAM,OAAO,GAAG,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACxE,MAAM,CACL,OAAO,KAAK,SAAS,EACrB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;YACF,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;YAE3C,MAAM,aAAa,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,MAAM,CACvF,mBAAmB,EACnB,UAAU,EACV,KAAK,EACL,iBAAiB,EACjB,IAAI,aAAa,CAAC,eAAe,EAAE,WAAW,EAAE,OAAO,CAAC,EACxD,gBAAgB,CAChB,CAAC;YACF,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;IAED,MAAM,cAAc,GAAG,sBAAsB,CAAC,cAAc,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;IAEzF,MAAM,eAAe,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAC9C,0BAA0B,CACzB,cAAc,EACd,eAAe,CAAC,QAAQ,EACxB,eAAe,EACf,aAAa,EACb,UAAU,CACV,CAAC;IAEF,OAAO,oBAAoB,CAAC;QAC3B,YAAY,EAAE,cAAc;QAC5B,WAAW,EAAE,aAAa;QAC1B,YAAY,EAAE,eAAe,CAAC,oBAAoB;QAClD,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,WAAW;QACtC,cAAc;QACd,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;QACvB,SAAS,EAAE,QAAQ;QACnB,wBAAwB,EAAE,eAAe,CAAC,cAAc;QACxD,kBAAkB;QAClB,0BAA0B;QAC1B,QAAQ;KACR,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CACtB,OAAuB,EACvB,QAA4B,EAC5B,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC,EACxC,iBAA8B,EAC9B,UAA2D;IAE3D,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;IAEjD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,OAAO,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,eAAe,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACzE,MAAM,cAAc,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,MAAM,CACxF,WAAW,CAAC,MAAM,EAClB,UAAU,EACV,KAAK,EACL,iBAAiB,EACjB,OAAO,EACP,gBAAgB,CAChB,CAAC;QAEF,MAAM,mBAAmB,GAAgB;YACxC,GAAG,WAAW;YACd,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC;SAC7B,CAAC;QACF,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAE/C,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,EAAE;YACvD,OAAO;YACP,aAAa,EAAE,mBAAmB;SAClC,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,cAAc,CAAC;AACvB,CAAC;AAED,SAAS,gBAAgB,CACxB,MAAqB,EACrB,EAAU,EACV,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC,EACxC,iBAA8B,EAC9B,UAA2D;IAE3D,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,gHAAgH;IAChH,iFAAiF;IACjF,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,EAAE,CAAC;QAC/C,OAAO,CAAC,4BAA4B,GAAG,MAAM,CAAC,oBAAoB,CAAC;IACpE,CAAC;IAED,mHAAmH;IACnH,gHAAgH;IAChH,wBAAwB;IACxB,IAAI,MAAM,CAAC,4BAA4B,KAAK,SAAS,EAAE,CAAC;QACvD,OAAO,CAAC,oBAAoB,GAAG,MAAM,CAAC,4BAA4B,CAAC;IACpE,CAAC;IAED,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QACvC,OAAO,CAAC,YAAY,GAAG,cAAc,CACpC,MAAM,CAAC,YAAY,EACnB,EAAE,EACF,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,UAAU,CACV,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CACpB,MAAgD;IAEhD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAYD,MAAM,aAAc,SAAQ,kBAA+B;IAC1D,YACC,KAAkB,EAClB,KAAkB,EACD,OAAgB,EACjC,UAAU,GAAG,IAAI;QAEjB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QAHf,YAAO,GAAP,OAAO,CAAS;IAIlC,CAAC;IAEe,QAAQ,CAAC,EAAgB;QACxC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACzE,CAAC;IAEe,OAAO,CACtB,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa;QAEb,IAAI,CAAC,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACnE,CAAC;IAED,IAAY,KAAK;QAChB,OAAO,IAAI,CAAC,eAA8B,CAAC;IAC5C,CAAC;CACD;AAED,SAAS,sBAAsB,CAC9B,MAAsB,EACtB,KAAuC,EACvC,UAA2D;IAE3D,MAAM,IAAI,GAAuB,qBAAqB,EAAE,CAAC;IACzD,qCAAqC,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAC3E,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE;QAC/C,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACrC,qCAAqC,CACpC,IAAI,EACJ,IAAI,CAAC,YAAY,EACjB;gBACC,QAAQ;gBACR,OAAO;aACP,EACD,UAAU,CACV,CAAC;QACH,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,qCAAqC,CAC7C,KAAyB,EACzB,MAAsB,EACtB,MAA0B,EAC1B,UAA2D;IAE3D,KAAK,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,iBAAiB,CACjF,WAAW,CAAC,MAAM,CAClB,CAAC;QACF,KAAK,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC5D,CAAC;IACF,CAAC;AACF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, fail } from \"@fluidframework/core-utils/internal\";\nimport {\n\trevisionMetadataSourceFromInfo,\n\ttype ChangeAtomId,\n\ttype ChangesetLocalId,\n\ttype FieldKindIdentifier,\n\ttype RevisionInfo,\n\ttype RevisionMetadataSource,\n\ttype RevisionTag,\n\ttype TaggedChange,\n\ttype TreeChunk,\n} from \"../../core/index.js\";\nimport { brand, idAllocatorFromMaxId, type IdAllocator } from \"../../util/index.js\";\nimport {\n\tnewChangeAtomIdBTree,\n\tsetInChangeAtomIdMap,\n\ttype ChangeAtomIdBTree,\n} from \"../changeAtomIdBTree.js\";\nimport {\n\tnewCrossFieldKeyTable,\n\ttype CrossFieldKeyTable,\n\ttype FieldChange,\n\ttype FieldChangeMap,\n\ttype FieldId,\n\ttype ModularChangeset,\n\ttype NodeChangeset,\n\ttype NodeId,\n} from \"./modularChangeTypes.js\";\nimport {\n\tCrossFieldManagerI,\n\tgetChangeHandler,\n\tgetRevInfoFromTaggedChanges,\n\thasConflicts,\n\tmakeModularChangeset,\n\tnewConstraintState,\n\tnewCrossFieldTable,\n\tupdateConstraintsForFields,\n\ttype CrossFieldTable,\n} from \"./modularChangeUtils.js\";\nimport type { CrossFieldTarget } from \"./crossFieldQueries.js\";\nimport type { FlexFieldKind } from \"./fieldKind.js\";\nimport { NodeAttachState } from \"./fieldChangeHandler.js\";\n\n/**\n * @param change - The change to invert.\n * @param isRollback - Whether the inverted change is meant to rollback a change on a branch as is the case when\n * performing a sandwich rebase.\n * @param revisionForInvert - The revision for the invert changeset.\n */\nexport function invertModularChange(\n\tchange: TaggedChange<ModularChangeset>,\n\tisRollback: boolean,\n\trevisionForInvert: RevisionTag,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): ModularChangeset {\n\t// Rollback changesets destroy the nodes created by the change being rolled back.\n\tconst destroys = isRollback ? invertBuilds(change.change.builds) : undefined;\n\n\t// Destroys only occur in rollback changesets, which are never inverted.\n\tassert(\n\t\tchange.change.destroys === undefined,\n\t\t0x89a /* Unexpected destroys in change to invert */,\n\t);\n\n\tconst revInfos: RevisionInfo[] = isRollback\n\t\t? [{ revision: revisionForInvert, rollbackOf: change.revision }]\n\t\t: [{ revision: revisionForInvert }];\n\n\tconst noChangeConstraint = change.change.noChangeConstraintOnRevert;\n\tconst noChangeConstraintOnRevert = change.change.noChangeConstraint;\n\n\tif (hasConflicts(change.change)) {\n\t\treturn makeModularChangeset({\n\t\t\tmaxId: change.change.maxId as number,\n\t\t\trevisions: revInfos,\n\t\t\tdestroys,\n\t\t});\n\t}\n\n\tconst genId: IdAllocator = idAllocatorFromMaxId(change.change.maxId ?? -1);\n\n\tconst crossFieldTable: InvertTable = {\n\t\t...newCrossFieldTable<FieldChange>(),\n\t\toriginalFieldToContext: new Map(),\n\t\tinvertedNodeToParent: brand(change.change.nodeToParent.clone()),\n\t};\n\tconst { revInfos: oldRevInfos } = getRevInfoFromTaggedChanges([change]);\n\tconst revisionMetadata = revisionMetadataSourceFromInfo(oldRevInfos);\n\n\tconst invertedFields = invertFieldMap(\n\t\tchange.change.fieldChanges,\n\t\tundefined,\n\t\tisRollback,\n\t\tgenId,\n\t\tcrossFieldTable,\n\t\trevisionMetadata,\n\t\trevisionForInvert,\n\t\tfieldKinds,\n\t);\n\n\tconst invertedNodes = newChangeAtomIdBTree<NodeChangeset>();\n\tchange.change.nodeChanges.forEachPair(([revision, localId], nodeChangeset) => {\n\t\tinvertedNodes.set(\n\t\t\t[revision, localId],\n\t\t\tinvertNodeChange(\n\t\t\t\tnodeChangeset,\n\t\t\t\t{ revision, localId },\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\tcrossFieldTable,\n\t\t\t\trevisionMetadata,\n\t\t\t\trevisionForInvert,\n\t\t\t\tfieldKinds,\n\t\t\t),\n\t\t);\n\t});\n\n\tif (crossFieldTable.invalidatedFields.size > 0) {\n\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\tfor (const fieldChange of fieldsToUpdate) {\n\t\t\tconst originalFieldChange = fieldChange.change;\n\t\t\tconst context = crossFieldTable.originalFieldToContext.get(fieldChange);\n\t\t\tassert(\n\t\t\t\tcontext !== undefined,\n\t\t\t\t0x851 /* Should have context for every invalidated field */,\n\t\t\t);\n\t\t\tconst { invertedField, fieldId } = context;\n\n\t\t\tconst amendedChange = getChangeHandler(fieldKinds, fieldChange.fieldKind).rebaser.invert(\n\t\t\t\toriginalFieldChange,\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\trevisionForInvert,\n\t\t\t\tnew InvertManager(crossFieldTable, fieldChange, fieldId),\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tinvertedField.change = brand(amendedChange);\n\t\t}\n\t}\n\n\tconst crossFieldKeys = makeCrossFieldKeyTable(invertedFields, invertedNodes, fieldKinds);\n\n\tconst constraintState = newConstraintState(0);\n\tupdateConstraintsForFields(\n\t\tinvertedFields,\n\t\tNodeAttachState.Attached,\n\t\tconstraintState,\n\t\tinvertedNodes,\n\t\tfieldKinds,\n\t);\n\n\treturn makeModularChangeset({\n\t\tfieldChanges: invertedFields,\n\t\tnodeChanges: invertedNodes,\n\t\tnodeToParent: crossFieldTable.invertedNodeToParent,\n\t\tnodeAliases: change.change.nodeAliases,\n\t\tcrossFieldKeys,\n\t\tmaxId: genId.getMaxId(),\n\t\trevisions: revInfos,\n\t\tconstraintViolationCount: constraintState.violationCount,\n\t\tnoChangeConstraint,\n\t\tnoChangeConstraintOnRevert,\n\t\tdestroys,\n\t});\n}\n\nfunction invertFieldMap(\n\tchanges: FieldChangeMap,\n\tparentId: NodeId | undefined,\n\tisRollback: boolean,\n\tgenId: IdAllocator,\n\tcrossFieldTable: InvertTable,\n\trevisionMetadata: RevisionMetadataSource,\n\trevisionForInvert: RevisionTag,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): FieldChangeMap {\n\tconst invertedFields: FieldChangeMap = new Map();\n\n\tfor (const [field, fieldChange] of changes) {\n\t\tconst fieldId = { nodeId: parentId, field };\n\t\tconst manager = new InvertManager(crossFieldTable, fieldChange, fieldId);\n\t\tconst invertedChange = getChangeHandler(fieldKinds, fieldChange.fieldKind).rebaser.invert(\n\t\t\tfieldChange.change,\n\t\t\tisRollback,\n\t\t\tgenId,\n\t\t\trevisionForInvert,\n\t\t\tmanager,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\tconst invertedFieldChange: FieldChange = {\n\t\t\t...fieldChange,\n\t\t\tchange: brand(invertedChange),\n\t\t};\n\t\tinvertedFields.set(field, invertedFieldChange);\n\n\t\tcrossFieldTable.originalFieldToContext.set(fieldChange, {\n\t\t\tfieldId,\n\t\t\tinvertedField: invertedFieldChange,\n\t\t});\n\t}\n\n\treturn invertedFields;\n}\n\nfunction invertNodeChange(\n\tchange: NodeChangeset,\n\tid: NodeId,\n\tisRollback: boolean,\n\tgenId: IdAllocator,\n\tcrossFieldTable: InvertTable,\n\trevisionMetadata: RevisionMetadataSource,\n\trevisionForInvert: RevisionTag,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): NodeChangeset {\n\tconst inverse: NodeChangeset = {};\n\n\t// If the node has a constraint, it should be inverted to a node-exist-on-revert constraint. This ensure that if\n\t// the inverse is inverted again, the original input constraint will be restored.\n\tif (change.nodeExistsConstraint !== undefined) {\n\t\tinverse.nodeExistsConstraintOnRevert = change.nodeExistsConstraint;\n\t}\n\n\t// The node-exist-on-revert constraint of a node is the constraint that should apply when the a change is reverted.\n\t// So, it should become the constraint in the inverse. If this constraint is violated when applying the inverse,\n\t// it will be discarded.\n\tif (change.nodeExistsConstraintOnRevert !== undefined) {\n\t\tinverse.nodeExistsConstraint = change.nodeExistsConstraintOnRevert;\n\t}\n\n\tif (change.fieldChanges !== undefined) {\n\t\tinverse.fieldChanges = invertFieldMap(\n\t\t\tchange.fieldChanges,\n\t\t\tid,\n\t\t\tisRollback,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t\trevisionForInvert,\n\t\t\tfieldKinds,\n\t\t);\n\t}\n\n\treturn inverse;\n}\n\nfunction invertBuilds(\n\tbuilds: ChangeAtomIdBTree<TreeChunk> | undefined,\n): ChangeAtomIdBTree<number> | undefined {\n\tif (builds !== undefined) {\n\t\treturn brand(builds.mapValues((chunk) => chunk.topLevelLength));\n\t}\n\treturn undefined;\n}\n\ninterface InvertTable extends CrossFieldTable<FieldChange> {\n\toriginalFieldToContext: Map<FieldChange, InvertContext>;\n\tinvertedNodeToParent: ChangeAtomIdBTree<FieldId>;\n}\n\ninterface InvertContext {\n\tfieldId: FieldId;\n\tinvertedField: FieldChange;\n}\n\nclass InvertManager extends CrossFieldManagerI<FieldChange> {\n\tpublic constructor(\n\t\ttable: InvertTable,\n\t\tfield: FieldChange,\n\t\tprivate readonly fieldId: FieldId,\n\t\tallowInval = true,\n\t) {\n\t\tsuper(table, field, allowInval);\n\t}\n\n\tpublic override onMoveIn(id: ChangeAtomId): void {\n\t\tsetInChangeAtomIdMap(this.table.invertedNodeToParent, id, this.fieldId);\n\t}\n\n\tpublic override moveKey(\n\t\ttarget: CrossFieldTarget,\n\t\trevision: RevisionTag | undefined,\n\t\tid: ChangesetLocalId,\n\t\tcount: number,\n\t): void {\n\t\tfail(0x9c5 /* Keys should not be moved manually during invert */);\n\t}\n\n\tprivate get table(): InvertTable {\n\t\treturn this.crossFieldTable as InvertTable;\n\t}\n}\n\nfunction makeCrossFieldKeyTable(\n\tfields: FieldChangeMap,\n\tnodes: ChangeAtomIdBTree<NodeChangeset>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): CrossFieldKeyTable {\n\tconst keys: CrossFieldKeyTable = newCrossFieldKeyTable();\n\tpopulateCrossFieldKeyTableForFieldMap(keys, fields, undefined, fieldKinds);\n\tnodes.forEachPair(([revision, localId], node) => {\n\t\tif (node.fieldChanges !== undefined) {\n\t\t\tpopulateCrossFieldKeyTableForFieldMap(\n\t\t\t\tkeys,\n\t\t\t\tnode.fieldChanges,\n\t\t\t\t{\n\t\t\t\t\trevision,\n\t\t\t\t\tlocalId,\n\t\t\t\t},\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t}\n\t});\n\n\treturn keys;\n}\n\nfunction populateCrossFieldKeyTableForFieldMap(\n\ttable: CrossFieldKeyTable,\n\tfields: FieldChangeMap,\n\tparent: NodeId | undefined,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): void {\n\tfor (const [fieldKey, fieldChange] of fields) {\n\t\tconst keys = getChangeHandler(fieldKinds, fieldChange.fieldKind).getCrossFieldKeys(\n\t\t\tfieldChange.change,\n\t\t);\n\t\tfor (const { key, count } of keys) {\n\t\t\ttable.set(key, count, { nodeId: parent, field: fieldKey });\n\t\t}\n\t}\n}\n"]}
+{"version":3,"file":"invert.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/invert.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EACN,8BAA8B,GAS9B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,KAAK,EAAE,oBAAoB,EAAoB,MAAM,qBAAqB,CAAC;AACpF,OAAO,EAAE,oBAAoB,EAA0B,MAAM,yBAAyB,CAAC;AASvF,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,2BAA2B,EAC3B,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,kBAAkB,EAClB,kBAAkB,EAClB,0BAA0B,GAE1B,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAE1D;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAClC,MAAsC,EACtC,UAAmB,EACnB,iBAA8B,EAC9B,UAA2D;IAE3D,iFAAiF;IACjF,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAE7E,wEAAwE;IACxE,MAAM,CACL,MAAM,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,EACpC,KAAK,CAAC,6CAA6C,CACnD,CAAC;IAEF,MAAM,QAAQ,GAAmB,UAAU;QAC1C,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;QAChE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;IAErC,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,0BAA0B,CAAC;IACpE,MAAM,0BAA0B,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC;IAEpE,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,OAAO,oBAAoB,CAAC;YAC3B,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAe;YACpC,SAAS,EAAE,QAAQ;YACnB,QAAQ;SACR,CAAC,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAgB,oBAAoB,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;IAE3E,MAAM,eAAe,GAAgB;QACpC,GAAG,kBAAkB,EAAe;QACpC,sBAAsB,EAAE,IAAI,GAAG,EAAE;KACjC,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,MAAM,gBAAgB,GAAG,8BAA8B,CAAC,WAAW,CAAC,CAAC;IAErE,MAAM,cAAc,GAAG,cAAc,CACpC,MAAM,CAAC,MAAM,CAAC,YAAY,EAC1B,SAAS,EACT,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,UAAU,CACV,CAAC;IAEF,MAAM,aAAa,GAAG,oBAAoB,EAAiB,CAAC;IAC5D,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,aAAa,EAAE,EAAE;QAC5E,aAAa,CAAC,GAAG,CAChB,CAAC,QAAQ,EAAE,OAAO,CAAC,EACnB,gBAAgB,CACf,aAAa,EACb,EAAE,QAAQ,EAAE,OAAO,EAAE,EACrB,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,UAAU,CACV,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;QACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QAC9C,KAAK,MAAM,WAAW,IAAI,cAAc,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,WAAW,CAAC,MAAM,CAAC;YAC/C,MAAM,OAAO,GAAG,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACxE,MAAM,CACL,OAAO,KAAK,SAAS,EACrB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;YACF,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;YAE3C,MAAM,aAAa,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,MAAM,CACvF,mBAAmB,EACnB,UAAU,EACV,KAAK,EACL,iBAAiB,EACjB,IAAI,aAAa,CAAC,eAAe,EAAE,WAAW,EAAE,OAAO,CAAC,EACxD,gBAAgB,CAChB,CAAC;YACF,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;IAED,MAAM,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,uBAAuB,CAC/D,cAAc,EACd,aAAa,EACb,UAAU,CACV,CAAC;IAEF,MAAM,eAAe,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAC9C,0BAA0B,CACzB,cAAc,EACd,eAAe,CAAC,QAAQ,EACxB,eAAe,EACf,aAAa,EACb,UAAU,CACV,CAAC;IAEF,OAAO,oBAAoB,CAAC;QAC3B,YAAY,EAAE,cAAc;QAC5B,WAAW,EAAE,aAAa;QAC1B,YAAY;QACZ,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,WAAW;QACtC,cAAc;QACd,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;QACvB,SAAS,EAAE,QAAQ;QACnB,wBAAwB,EAAE,eAAe,CAAC,cAAc;QACxD,kBAAkB;QAClB,0BAA0B;QAC1B,QAAQ;KACR,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CACtB,OAAuB,EACvB,QAA4B,EAC5B,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC,EACxC,iBAA8B,EAC9B,UAA2D;IAE3D,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;IAEjD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,OAAO,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,eAAe,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACzE,MAAM,cAAc,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,MAAM,CACxF,WAAW,CAAC,MAAM,EAClB,UAAU,EACV,KAAK,EACL,iBAAiB,EACjB,OAAO,EACP,gBAAgB,CAChB,CAAC;QAEF,MAAM,mBAAmB,GAAgB;YACxC,GAAG,WAAW;YACd,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC;SAC7B,CAAC;QACF,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAE/C,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,EAAE;YACvD,OAAO;YACP,aAAa,EAAE,mBAAmB;SAClC,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,cAAc,CAAC;AACvB,CAAC;AAED,SAAS,gBAAgB,CACxB,MAAqB,EACrB,EAAU,EACV,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC,EACxC,iBAA8B,EAC9B,UAA2D;IAE3D,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,gHAAgH;IAChH,iFAAiF;IACjF,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,EAAE,CAAC;QAC/C,OAAO,CAAC,4BAA4B,GAAG,MAAM,CAAC,oBAAoB,CAAC;IACpE,CAAC;IAED,mHAAmH;IACnH,gHAAgH;IAChH,wBAAwB;IACxB,IAAI,MAAM,CAAC,4BAA4B,KAAK,SAAS,EAAE,CAAC;QACvD,OAAO,CAAC,oBAAoB,GAAG,MAAM,CAAC,4BAA4B,CAAC;IACpE,CAAC;IAED,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QACvC,OAAO,CAAC,YAAY,GAAG,cAAc,CACpC,MAAM,CAAC,YAAY,EACnB,EAAE,EACF,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,iBAAiB,EACjB,UAAU,CACV,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CACpB,MAAgD;IAEhD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAWD,MAAM,aAAc,SAAQ,kBAA+B;IAIxC;IAHlB,YACC,KAAkB,EAClB,KAAkB,EACD,OAAgB,EACjC,UAAU,GAAG,IAAI;QAEjB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QAHf,YAAO,GAAP,OAAO,CAAS;IAIlC,CAAC;IAEe,QAAQ,CAAC,EAAgB,IAAS,CAAC;IAEnC,OAAO,CACtB,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa;QAEb,IAAI,CAAC,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACnE,CAAC;IAED,IAAY,KAAK;QAChB,OAAO,IAAI,CAAC,eAA8B,CAAC;IAC5C,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, fail } from \"@fluidframework/core-utils/internal\";\nimport {\n\trevisionMetadataSourceFromInfo,\n\ttype ChangeAtomId,\n\ttype ChangesetLocalId,\n\ttype FieldKindIdentifier,\n\ttype RevisionInfo,\n\ttype RevisionMetadataSource,\n\ttype RevisionTag,\n\ttype TaggedChange,\n\ttype TreeChunk,\n} from \"../../core/index.js\";\nimport { brand, idAllocatorFromMaxId, type IdAllocator } from \"../../util/index.js\";\nimport { newChangeAtomIdBTree, type ChangeAtomIdBTree } from \"../changeAtomIdBTree.js\";\nimport type {\n\tFieldChange,\n\tFieldChangeMap,\n\tFieldId,\n\tModularChangeset,\n\tNodeChangeset,\n\tNodeId,\n} from \"./modularChangeTypes.js\";\nimport {\n\tCrossFieldManagerI,\n\tgetChangeHandler,\n\tgetRevInfoFromTaggedChanges,\n\thasConflicts,\n\tmakeChangesetInversions,\n\tmakeModularChangeset,\n\tnewConstraintState,\n\tnewCrossFieldTable,\n\tupdateConstraintsForFields,\n\ttype CrossFieldTable,\n} from \"./modularChangeUtils.js\";\nimport type { CrossFieldTarget } from \"./crossFieldQueries.js\";\nimport type { FlexFieldKind } from \"./fieldKind.js\";\nimport { NodeAttachState } from \"./fieldChangeHandler.js\";\n\n/**\n * @param change - The change to invert.\n * @param isRollback - Whether the inverted change is meant to rollback a change on a branch as is the case when\n * performing a sandwich rebase.\n * @param revisionForInvert - The revision for the invert changeset.\n */\nexport function invertModularChange(\n\tchange: TaggedChange<ModularChangeset>,\n\tisRollback: boolean,\n\trevisionForInvert: RevisionTag,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): ModularChangeset {\n\t// Rollback changesets destroy the nodes created by the change being rolled back.\n\tconst destroys = isRollback ? invertBuilds(change.change.builds) : undefined;\n\n\t// Destroys only occur in rollback changesets, which are never inverted.\n\tassert(\n\t\tchange.change.destroys === undefined,\n\t\t0x89a /* Unexpected destroys in change to invert */,\n\t);\n\n\tconst revInfos: RevisionInfo[] = isRollback\n\t\t? [{ revision: revisionForInvert, rollbackOf: change.revision }]\n\t\t: [{ revision: revisionForInvert }];\n\n\tconst noChangeConstraint = change.change.noChangeConstraintOnRevert;\n\tconst noChangeConstraintOnRevert = change.change.noChangeConstraint;\n\n\tif (hasConflicts(change.change)) {\n\t\treturn makeModularChangeset({\n\t\t\tmaxId: change.change.maxId as number,\n\t\t\trevisions: revInfos,\n\t\t\tdestroys,\n\t\t});\n\t}\n\n\tconst genId: IdAllocator = idAllocatorFromMaxId(change.change.maxId ?? -1);\n\n\tconst crossFieldTable: InvertTable = {\n\t\t...newCrossFieldTable<FieldChange>(),\n\t\toriginalFieldToContext: new Map(),\n\t};\n\tconst { revInfos: oldRevInfos } = getRevInfoFromTaggedChanges([change]);\n\tconst revisionMetadata = revisionMetadataSourceFromInfo(oldRevInfos);\n\n\tconst invertedFields = invertFieldMap(\n\t\tchange.change.fieldChanges,\n\t\tundefined,\n\t\tisRollback,\n\t\tgenId,\n\t\tcrossFieldTable,\n\t\trevisionMetadata,\n\t\trevisionForInvert,\n\t\tfieldKinds,\n\t);\n\n\tconst invertedNodes = newChangeAtomIdBTree<NodeChangeset>();\n\tchange.change.nodeChanges.forEachPair(([revision, localId], nodeChangeset) => {\n\t\tinvertedNodes.set(\n\t\t\t[revision, localId],\n\t\t\tinvertNodeChange(\n\t\t\t\tnodeChangeset,\n\t\t\t\t{ revision, localId },\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\tcrossFieldTable,\n\t\t\t\trevisionMetadata,\n\t\t\t\trevisionForInvert,\n\t\t\t\tfieldKinds,\n\t\t\t),\n\t\t);\n\t});\n\n\tif (crossFieldTable.invalidatedFields.size > 0) {\n\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\tfor (const fieldChange of fieldsToUpdate) {\n\t\t\tconst originalFieldChange = fieldChange.change;\n\t\t\tconst context = crossFieldTable.originalFieldToContext.get(fieldChange);\n\t\t\tassert(\n\t\t\t\tcontext !== undefined,\n\t\t\t\t0x851 /* Should have context for every invalidated field */,\n\t\t\t);\n\t\t\tconst { invertedField, fieldId } = context;\n\n\t\t\tconst amendedChange = getChangeHandler(fieldKinds, fieldChange.fieldKind).rebaser.invert(\n\t\t\t\toriginalFieldChange,\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\trevisionForInvert,\n\t\t\t\tnew InvertManager(crossFieldTable, fieldChange, fieldId),\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tinvertedField.change = brand(amendedChange);\n\t\t}\n\t}\n\n\tconst { crossFieldKeys, nodeToParent } = makeChangesetInversions(\n\t\tinvertedFields,\n\t\tinvertedNodes,\n\t\tfieldKinds,\n\t);\n\n\tconst constraintState = newConstraintState(0);\n\tupdateConstraintsForFields(\n\t\tinvertedFields,\n\t\tNodeAttachState.Attached,\n\t\tconstraintState,\n\t\tinvertedNodes,\n\t\tfieldKinds,\n\t);\n\n\treturn makeModularChangeset({\n\t\tfieldChanges: invertedFields,\n\t\tnodeChanges: invertedNodes,\n\t\tnodeToParent,\n\t\tnodeAliases: change.change.nodeAliases,\n\t\tcrossFieldKeys,\n\t\tmaxId: genId.getMaxId(),\n\t\trevisions: revInfos,\n\t\tconstraintViolationCount: constraintState.violationCount,\n\t\tnoChangeConstraint,\n\t\tnoChangeConstraintOnRevert,\n\t\tdestroys,\n\t});\n}\n\nfunction invertFieldMap(\n\tchanges: FieldChangeMap,\n\tparentId: NodeId | undefined,\n\tisRollback: boolean,\n\tgenId: IdAllocator,\n\tcrossFieldTable: InvertTable,\n\trevisionMetadata: RevisionMetadataSource,\n\trevisionForInvert: RevisionTag,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): FieldChangeMap {\n\tconst invertedFields: FieldChangeMap = new Map();\n\n\tfor (const [field, fieldChange] of changes) {\n\t\tconst fieldId = { nodeId: parentId, field };\n\t\tconst manager = new InvertManager(crossFieldTable, fieldChange, fieldId);\n\t\tconst invertedChange = getChangeHandler(fieldKinds, fieldChange.fieldKind).rebaser.invert(\n\t\t\tfieldChange.change,\n\t\t\tisRollback,\n\t\t\tgenId,\n\t\t\trevisionForInvert,\n\t\t\tmanager,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\tconst invertedFieldChange: FieldChange = {\n\t\t\t...fieldChange,\n\t\t\tchange: brand(invertedChange),\n\t\t};\n\t\tinvertedFields.set(field, invertedFieldChange);\n\n\t\tcrossFieldTable.originalFieldToContext.set(fieldChange, {\n\t\t\tfieldId,\n\t\t\tinvertedField: invertedFieldChange,\n\t\t});\n\t}\n\n\treturn invertedFields;\n}\n\nfunction invertNodeChange(\n\tchange: NodeChangeset,\n\tid: NodeId,\n\tisRollback: boolean,\n\tgenId: IdAllocator,\n\tcrossFieldTable: InvertTable,\n\trevisionMetadata: RevisionMetadataSource,\n\trevisionForInvert: RevisionTag,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n): NodeChangeset {\n\tconst inverse: NodeChangeset = {};\n\n\t// If the node has a constraint, it should be inverted to a node-exist-on-revert constraint. This ensure that if\n\t// the inverse is inverted again, the original input constraint will be restored.\n\tif (change.nodeExistsConstraint !== undefined) {\n\t\tinverse.nodeExistsConstraintOnRevert = change.nodeExistsConstraint;\n\t}\n\n\t// The node-exist-on-revert constraint of a node is the constraint that should apply when the a change is reverted.\n\t// So, it should become the constraint in the inverse. If this constraint is violated when applying the inverse,\n\t// it will be discarded.\n\tif (change.nodeExistsConstraintOnRevert !== undefined) {\n\t\tinverse.nodeExistsConstraint = change.nodeExistsConstraintOnRevert;\n\t}\n\n\tif (change.fieldChanges !== undefined) {\n\t\tinverse.fieldChanges = invertFieldMap(\n\t\t\tchange.fieldChanges,\n\t\t\tid,\n\t\t\tisRollback,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t\trevisionForInvert,\n\t\t\tfieldKinds,\n\t\t);\n\t}\n\n\treturn inverse;\n}\n\nfunction invertBuilds(\n\tbuilds: ChangeAtomIdBTree<TreeChunk> | undefined,\n): ChangeAtomIdBTree<number> | undefined {\n\tif (builds !== undefined) {\n\t\treturn brand(builds.mapValues((chunk) => chunk.topLevelLength));\n\t}\n\treturn undefined;\n}\n\ninterface InvertTable extends CrossFieldTable<FieldChange> {\n\toriginalFieldToContext: Map<FieldChange, InvertContext>;\n}\n\ninterface InvertContext {\n\tfieldId: FieldId;\n\tinvertedField: FieldChange;\n}\n\nclass InvertManager extends CrossFieldManagerI<FieldChange> {\n\tpublic constructor(\n\t\ttable: InvertTable,\n\t\tfield: FieldChange,\n\t\tprivate readonly fieldId: FieldId,\n\t\tallowInval = true,\n\t) {\n\t\tsuper(table, field, allowInval);\n\t}\n\n\tpublic override onMoveIn(id: ChangeAtomId): void {}\n\n\tpublic override moveKey(\n\t\ttarget: CrossFieldTarget,\n\t\trevision: RevisionTag | undefined,\n\t\tid: ChangesetLocalId,\n\t\tcount: number,\n\t): void {\n\t\tfail(0x9c5 /* Keys should not be moved manually during invert */);\n\t}\n\n\tprivate get table(): InvertTable {\n\t\treturn this.crossFieldTable as InvertTable;\n\t}\n}\n"]}

package/lib/feature-libraries/modular-schema/minimizeModularChange.d.ts

@@ -2,7 +2,8 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import type { ModularChangeFamily } from "./modularChangeFamily.js";
+import { type FieldKindIdentifier, type IEditableForest } from "../../core/index.js";
+import type { FlexFieldKind } from "./fieldKind.js";
 import type { ModularChangeset } from "./modularChangeTypes.js";
 /**
  * "Minimizes" a {@link ModularChangeset} so that it contains no extraneous
@@ -13,12 +14,9 @@ import type { ModularChangeset } from "./modularChangeTypes.js";
  * 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.
  */
-export declare function minimizeModularChangeset(change: ModularChangeset, changeFamily: ModularChangeFamily): ModularChangeset;
+export declare function minimizeModularChangeset(change: ModularChangeset, fieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>, forestFactory: () => IEditableForest): ModularChangeset;
 //# sourceMappingURL=minimizeModularChange.d.ts.map

package/lib/feature-libraries/modular-schema/minimizeModularChange.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"minimizeModularChange.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/minimizeModularChange.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AACpE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAEhE;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,wBAAwB,CACvC,MAAM,EAAE,gBAAgB,EACxB,YAAY,EAAE,mBAAmB,GAC/B,gBAAgB,CAGlB"}
+{"version":3,"file":"minimizeModularChange.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/minimizeModularChange.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAcN,KAAK,mBAAmB,EACxB,KAAK,eAAe,EAEpB,MAAM,qBAAqB,CAAC;AAsB7B,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAIpD,OAAO,KAAK,EAIX,gBAAgB,EAGhB,MAAM,yBAAyB,CAAC;AASjC;;;;;;;;;;;;GAYG;AACH,wBAAgB,wBAAwB,CACvC,MAAM,EAAE,gBAAgB,EACxB,UAAU,EAAE,WAAW,CAAC,mBAAmB,EAAE,aAAa,CAAC,EAC3D,aAAa,EAAE,MAAM,eAAe,GAClC,gBAAgB,CAElB"}

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

@@ -2,6 +2,16 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
+import { deltaFieldMapHasChanges, makeAnonChange, makeChangeAtomId, makeDetachedFieldIndex, newChangeAtomIdRangeMap, newChangeAtomIdTransform, offsetChangeAtomId, visitDelta, } from "../../core/index.js";
+import { brand, hasSingle, setInNestedMap, } from "../../util/index.js";
+import { getFromChangeAtomIdMap, newChangeAtomIdBTree, setInChangeAtomIdMap, } from "../changeAtomIdBTree.js";
+import { CrossFieldTarget } from "./crossFieldQueries.js";
+import { EditFilterStatus, NodeAttachState, } from "./fieldChangeHandler.js";
+import { filterEdits } from "./filterEdits.js";
+import { invertModularChange } from "./invert.js";
+import { intoDelta } from "./modularChangeFamily.js";
+import { getChangeHandler, nodeChangeFromId, normalizeNodeId, validateChangeset, } from "./modularChangeUtils.js";
+import { assert, fail } from "@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
@@ -11,15 +21,455 @@
  * 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.
+ */
+export 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 = intoDelta(makeAnonChange(change), fieldKinds);
+        this.outputToInputRootId = outputToInputRootIdFromDelta(delta);
+        this.attachedRootIds = collectAttachedRootIds(delta, this.outputToInputRootId);
+    }
+    minimize(forestFactory) {
+        const residualChange = filterEdits(this.change, this.filterEditsForResidualChange.bind(this), this.fieldKinds);
+        residualChange.builds = this.squashBuilds(forestFactory);
+        validateChangeset(residualChange, this.fieldKinds);
+        return residualChange;
+    }
+    isNodeIdInBuiltTree(nodeId) {
+        return (nodeId !== undefined &&
+            getFromChangeAtomIdMap(this.builtNodeIds, normalizeNodeId(nodeId, this.change.nodeAliases)) === true);
+    }
+    isNodeDetachedInOutput(nodeId) {
+        return ((getFromChangeAtomIdMap(this.outputAttachStates, normalizeNodeId(nodeId, this.change.nodeAliases)) ?? fail(0xd37 /* Should have attach state for every node ID */)) ===
+            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: brand(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: EditFilterStatus.Remove, shouldRemoveChild: false },
+                length: count,
+            };
+        }
+        let countProcessed = count;
+        const moveEndpointEntry = this.change.crossFieldKeys.getFirst({ ...(endpoint ?? detachId), target: 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
+                ? EditFilterStatus.Preserve
+                : EditFilterStatus.PreserveWithoutMove;
+            return { value: { action }, length: countProcessed };
+        }
+        return { value: { action: EditFilterStatus.Preserve }, length: countProcessed };
+    }
+    filterAttachForBuildChange(fieldId, id, count, endpoint) {
+        let countProcessed = count;
+        const moveId = endpoint ?? id;
+        const moveEndpointEntry = this.change.crossFieldKeys.getFirst({ ...moveId, target: 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: EditFilterStatus.Remove }, length: countProcessed };
+        }
+        if (isMove) {
+            const movedNodeId = getFromChangeAtomIdMap(this.rootIdToNodeId, moveId);
+            return {
+                value: {
+                    action: EditFilterStatus.PreserveWithoutMove,
+                    nodeId: movedNodeId,
+                    newAttachId: rootInputId,
+                },
+                length: countProcessed,
+            };
+        }
+        return {
+            value: { action: 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: brand(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: 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: EditFilterStatus.Remove, shouldRemoveChild: hasPreservedAttach },
+                length: countProcessed,
+            };
+        }
+        return {
+            value: {
+                action: hasDroppedAttach
+                    ? EditFilterStatus.PreserveWithoutMove
+                    : 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: 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: 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 = getFromChangeAtomIdMap(this.rootIdToNodeId, moveId);
+                return {
+                    value: {
+                        action: EditFilterStatus.PreserveWithoutMove,
+                        nodeId: movedNodeId,
+                        newAttachId: inputIdEntry.value ?? moveId,
+                    },
+                    length: countProcessed,
+                };
+            }
+        }
+        return {
+            value: { action: EditFilterStatus.Preserve },
+            length: countProcessed,
+        };
+    }
+    squashBuilds(forestFactory) {
+        const changeForBuilds = filterEdits(this.change, this.filterEditsForBuildChange.bind(this), this.fieldKinds);
+        const deltaForBuilds = intoDelta(makeAnonChange(changeForBuilds), this.fieldKinds);
+        assert(!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 = makeDetachedFieldIndex();
+        visitDelta(deltaForBuilds, forest.acquireVisitor(), detachedFieldIndex, undefined);
+        const squashedBuilds = 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.
+            assert(hasSingle(chunks), 0xd39 /* TODO: Handle multiple chunks */);
+            const chunk = chunks[0];
+            assert(chunk.topLevelLength === 1, 0xd3a /* TODO: Handle chunk with range of nodes */);
+            const rootId = {
+                revision: entry.id.major,
+                localId: brand(entry.id.minor),
+            };
+            const isAttachedEntry = this.attachedRootIds.getFirst(rootId, chunk.topLevelLength);
+            assert(isAttachedEntry.length === chunk.topLevelLength, 0xd3b /* TODO: Handle chunks which are only partially attached */);
+            if (isAttachedEntry.value) {
+                setInChangeAtomIdMap(squashedBuilds, rootId, chunk);
+            }
+            cursor.exitField();
+        }
+        return squashedBuilds;
+    }
+}
+function getOutputNodeAttachStates(change, fieldKinds) {
+    const inverse = invertModularChange(makeAnonChange(change), true, "root", fieldKinds);
+    return getInputNodeAttachStates(inverse, fieldKinds);
+}
+function getInputNodeAttachStates(change, fieldKinds) {
+    const nodeAttachStates = newChangeAtomIdBTree();
+    addInputNodeAttachStatesForFields(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 = getChangeHandler(fieldKinds, fieldChange.fieldKind).getNestedChanges(fieldChange.change);
+        for (const { nodeId, inputRootId: inputId } of children) {
+            const normalizedNodeId = normalizeNodeId(nodeId, nodeAliases);
+            const attachState = parentState === NodeAttachState.Attached && inputId === undefined
+                ? NodeAttachState.Attached
+                : NodeAttachState.Detached;
+            nodeAttachStates.set([normalizedNodeId.revision, normalizedNodeId.localId], attachState);
+            const nodeChangeset = nodeChangeFromId(nodes, normalizedNodeId);
+            if (nodeChangeset.fieldChanges !== undefined) {
+                addInputNodeAttachStatesForFields(attachState, nodeChangeset.fieldChanges, nodes, nodeAliases, fieldKinds, nodeAttachStates);
+            }
+        }
+    }
+}
+function getNodeInfo(change, fieldKinds) {
+    const builtRootIds = newChangeAtomIdRangeMap();
+    if (change.builds !== undefined) {
+        for (const [rootId, chunk] of change.builds.entries()) {
+            builtRootIds.set(makeChangeAtomId(rootId[1], rootId[0]), chunk.topLevelLength, true);
+        }
+    }
+    const builtNodeIds = newChangeAtomIdBTree();
+    const rootIdToNodeId = 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 = getChangeHandler(fieldKinds, fieldChange.fieldKind).getNestedChanges(fieldChange.change);
+        for (const { nodeId, inputRootId: inputId, detachId } of children) {
+            const normalizedNodeId = 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) {
+                setInChangeAtomIdMap(rootIdToNodeId, inputId, normalizedNodeId);
+            }
+            if (detachId !== undefined) {
+                setInChangeAtomIdMap(rootIdToNodeId, detachId, normalizedNodeId);
+            }
+            const nodeChangeset = 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.
  */
-export function minimizeModularChangeset(change, changeFamily) {
-    // TODO: Actually minimize the change. For now this is a no-op that returns the change unchanged.
-    return change;
+function collectAttachedRootIds(delta, outputToInputRootId) {
+    const detachIdToNodeChanges = getDeltaNodeChangesByDetachId(delta);
+    const attached = 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 ?? 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 = 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: 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(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) {
+                        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) {
+            setInNestedMap(detachIdToChanges, id.major, id.minor, fields);
+            visitFields(fields);
+        }
+    }
+    return detachIdToChanges;
+}
+function outputToInputRootIdFromDelta(delta) {
+    const outputToInputRootId = newChangeAtomIdTransform();
+    if (delta.rename !== undefined) {
+        for (const { oldId, newId, count } of delta.rename) {
+            outputToInputRootId.set(makeChangeAtomId(brand(newId.minor), newId.major), count, makeChangeAtomId(brand(oldId.minor), oldId.major));
+        }
+    }
+    return outputToInputRootId;
 }
 //# sourceMappingURL=minimizeModularChange.js.map