@usejunior/docx-core 0.9.1 → 0.11.0

package/dist/baselines/atomizer/inPlaceModifier-bookmarks.js

@@ -0,0 +1,189 @@
+/**
+ * In-Place AST Modifier
+ *
+ * Modifies the revised document's AST in-place to add track changes markup.
+ * This replaces the reconstruction-based approach with direct tree manipulation.
+ */
+import { childElements, findChildByTagName, insertAfterElement } from '../../primitives/index.js';
+import { findAncestor, findTreeRoot, hasAncestorTag, paragraphHasParaInsMarker, } from './inPlaceModifier-shared.js';
+export function cloneParagraphBoundaryBookmarkMarkers(sourceParagraph) {
+    const kids = sourceParagraph ? childElements(sourceParagraph) : [];
+    if (!sourceParagraph || kids.length === 0) {
+        return { leading: [], trailing: [], sourceLeading: [], sourceTrailing: [] };
+    }
+    const children = kids;
+    let firstRunIdx = -1;
+    let lastRunIdx = -1;
+    for (let i = 0; i < children.length; i++) {
+        if (children[i]?.tagName === 'w:r') {
+            if (firstRunIdx < 0)
+                firstRunIdx = i;
+            lastRunIdx = i;
+        }
+    }
+    const leading = [];
+    const trailing = [];
+    const sourceLeading = [];
+    const sourceTrailing = [];
+    for (let i = 0; i < children.length; i++) {
+        const child = children[i];
+        if (child.tagName === 'w:bookmarkStart') {
+            if (firstRunIdx < 0 || i < firstRunIdx) {
+                const cloned = child.cloneNode(true);
+                leading.push(cloned);
+                sourceLeading.push(child);
+            }
+            continue;
+        }
+        if (child.tagName === 'w:bookmarkEnd') {
+            if (lastRunIdx < 0 || i > lastRunIdx) {
+                const cloned = child.cloneNode(true);
+                trailing.push(cloned);
+                sourceTrailing.push(child);
+            }
+        }
+    }
+    return { leading, trailing, sourceLeading, sourceTrailing };
+}
+export function insertLeadingMarkers(paragraph, markers) {
+    if (markers.length === 0)
+        return null;
+    const pPr = findChildByTagName(paragraph, 'w:pPr');
+    if (pPr) {
+        let anchor = pPr;
+        for (const marker of markers) {
+            insertAfterElement(anchor, marker);
+            anchor = marker;
+        }
+        return anchor;
+    }
+    for (let i = markers.length - 1; i >= 0; i--) {
+        paragraph.insertBefore(markers[i], paragraph.firstChild);
+    }
+    return markers[markers.length - 1] ?? null;
+}
+export function isBookmarkMarkerTag(tagName) {
+    return tagName === 'w:bookmarkStart' || tagName === 'w:bookmarkEnd';
+}
+/**
+ * Collect direct paragraph bookmark markers adjacent to a source run.
+ *
+ * Markers between runs (or at paragraph boundaries) are represented as siblings
+ * of w:r under w:p. We clone nearby markers so reconstructed deleted/moveFrom
+ * fragments preserve bookmark names/IDs needed for Reject All parity.
+ */
+export function collectAdjacentSourceBookmarkMarkers(sourceRun) {
+    const paragraph = sourceRun.parentNode;
+    if (!paragraph || paragraph.tagName !== 'w:p') {
+        return [];
+    }
+    const children = childElements(paragraph);
+    const runIndex = children.indexOf(sourceRun);
+    if (runIndex < 0) {
+        return [];
+    }
+    const before = [];
+    for (let i = runIndex - 1; i >= 0; i--) {
+        const child = children[i];
+        if (!child)
+            break;
+        if (child.tagName === 'w:r')
+            break;
+        if (isBookmarkMarkerTag(child.tagName)) {
+            before.unshift(child);
+        }
+    }
+    const after = [];
+    for (let i = runIndex + 1; i < children.length; i++) {
+        const child = children[i];
+        if (!child)
+            break;
+        if (child.tagName === 'w:r')
+            break;
+        if (isBookmarkMarkerTag(child.tagName)) {
+            after.push(child);
+        }
+    }
+    return [...before, ...after];
+}
+export function markerSurvivesReject(marker, context) {
+    // Markers nested in inserted/move-to content are removed by Reject All.
+    if (hasAncestorTag(marker, new Set(['w:ins', 'w:moveTo']))) {
+        return false;
+    }
+    // Paragraph-level insertion markers remove whole paragraphs on Reject All.
+    const paragraph = findAncestor(marker, 'w:p');
+    if (paragraph && context?.isParagraphRemovedOnReject?.(paragraph)) {
+        return false;
+    }
+    if (paragraphHasParaInsMarker(paragraph)) {
+        return false;
+    }
+    return true;
+}
+export function targetTreeHasEquivalentBookmarkMarker(targetParagraph, marker, context) {
+    const treeRoot = findTreeRoot(targetParagraph);
+    if (marker.tagName === 'w:bookmarkStart') {
+        const markerId = marker.getAttribute('w:id');
+        const markerName = marker.getAttribute('w:name');
+        for (const existing of Array.from(treeRoot.getElementsByTagName('w:bookmarkStart'))) {
+            if (!markerSurvivesReject(existing, context)) {
+                continue;
+            }
+            const existingName = existing.getAttribute('w:name');
+            const existingId = existing.getAttribute('w:id');
+            if (markerName && existingName === markerName)
+                return true;
+            if (!markerName && markerId && existingId === markerId)
+                return true;
+        }
+        return false;
+    }
+    if (marker.tagName === 'w:bookmarkEnd') {
+        const markerId = marker.getAttribute('w:id');
+        if (!markerId)
+            return false;
+        for (const existing of Array.from(treeRoot.getElementsByTagName('w:bookmarkEnd'))) {
+            if (!markerSurvivesReject(existing, context)) {
+                continue;
+            }
+            if (existing.getAttribute('w:id') === markerId)
+                return true;
+        }
+    }
+    return false;
+}
+export function cloneUnemittedSourceBookmarkMarkers(sourceRun, targetParagraph, state, context) {
+    const markers = collectAdjacentSourceBookmarkMarkers(sourceRun);
+    const clones = [];
+    for (const marker of markers) {
+        if (state.emittedSourceBookmarkMarkers.has(marker)) {
+            continue;
+        }
+        if (targetTreeHasEquivalentBookmarkMarker(targetParagraph, marker, context)) {
+            state.emittedSourceBookmarkMarkers.add(marker);
+            continue;
+        }
+        state.emittedSourceBookmarkMarkers.add(marker);
+        const cloned = marker.cloneNode(true);
+        clones.push(cloned);
+    }
+    return clones;
+}
+export function insertMarkersBeforeWrapper(wrapper, markers) {
+    const parent = wrapper.parentNode;
+    if (!parent)
+        return;
+    for (const marker of markers) {
+        if (!marker)
+            continue;
+        parent.insertBefore(marker, wrapper);
+    }
+}
+export function filterEquivalentBookmarkMarkers(markers, targetNode, context) {
+    return markers.filter((marker) => !targetTreeHasEquivalentBookmarkMarker(targetNode, marker, context));
+}
+/**
+ * Track change wrapper tag names.
+ */
+//# sourceMappingURL=inPlaceModifier-bookmarks.js.map

package/dist/baselines/atomizer/inPlaceModifier-bookmarks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inPlaceModifier-bookmarks.js","sourceRoot":"","sources":["../../../src/baselines/atomizer/inPlaceModifier-bookmarks.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAClG,OAAO,EACL,YAAY,EACZ,YAAY,EACZ,cAAc,EACd,yBAAyB,GAE1B,MAAM,6BAA6B,CAAC;AASrC,MAAM,UAAU,qCAAqC,CACnD,eAAoC;IAEpC,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnE,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1C,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IAC9E,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC;IACtB,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,KAAK,KAAK,EAAE,CAAC;YACnC,IAAI,WAAW,GAAG,CAAC;gBAAE,WAAW,GAAG,CAAC,CAAC;YACrC,UAAU,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,aAAa,GAAc,EAAE,CAAC;IACpC,MAAM,cAAc,GAAc,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;YACxC,IAAI,WAAW,GAAG,CAAC,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAY,CAAC;gBAChD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,KAAK,eAAe,EAAE,CAAC;YACtC,IAAI,UAAU,GAAG,CAAC,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAY,CAAC;gBAChD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACtB,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,cAAc,EAAE,CAAC;AAC9D,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,SAAkB,EAClB,OAAkB;IAElB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,MAAM,GAAG,GAAG,kBAAkB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACnD,IAAI,GAAG,EAAE,CAAC;QACR,IAAI,MAAM,GAAY,GAAG,CAAC;QAC1B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACnC,MAAM,GAAG,MAAM,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC;AAC7C,CAAC;AAID,MAAM,UAAU,mBAAmB,CAAC,OAAe;IACjD,OAAO,OAAO,KAAK,iBAAiB,IAAI,OAAO,KAAK,eAAe,CAAC;AACtE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oCAAoC,CAAC,SAAkB;IACrE,MAAM,SAAS,GAAG,SAAS,CAAC,UAA4B,CAAC;IACzD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;QAC9C,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,QAAQ,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC7C,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK;YAAE,MAAM;QAClB,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK;YAAE,MAAM;QACnC,IAAI,mBAAmB,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK;YAAE,MAAM;QAClB,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK;YAAE,MAAM;QACnC,IAAI,mBAAmB,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;AAC/B,CAAC;AAOD,MAAM,UAAU,oBAAoB,CAAC,MAAe,EAAE,OAAiC;IACrF,wEAAwE;IACxE,IAAI,cAAc,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC9C,IAAI,SAAS,IAAI,OAAO,EAAE,0BAA0B,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;QAClE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,yBAAyB,CAAC,SAAS,CAAC,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,qCAAqC,CACnD,eAAwB,EACxB,MAAe,EACf,OAAiC;IAEjC,MAAM,QAAQ,GAAG,YAAY,CAAC,eAAe,CAAC,CAAC;IAE/C,IAAI,MAAM,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACjD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAc,EAAE,CAAC;YACjG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC7C,SAAS;YACX,CAAC;YACD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,UAAU,IAAI,YAAY,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC;YAC3D,IAAI,CAAC,UAAU,IAAI,QAAQ,IAAI,UAAU,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;QACtE,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,MAAM,CAAC,OAAO,KAAK,eAAe,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAC5B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,eAAe,CAAC,CAAc,EAAE,CAAC;YAC/F,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC7C,SAAS;YACX,CAAC;YACD,IAAI,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,mCAAmC,CACjD,SAAkB,EAClB,eAAwB,EACxB,KAAsB,EACtB,OAAiC;IAEjC,MAAM,OAAO,GAAG,oCAAoC,CAAC,SAAS,CAAC,CAAC;IAChE,MAAM,MAAM,GAAc,EAAE,CAAC;IAE7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACnD,SAAS;QACX,CAAC;QAED,IAAI,qCAAqC,CAAC,eAAe,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;YAC5E,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/C,SAAS;QACX,CAAC;QAED,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAY,CAAC;QACjD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,OAAgB,EAAE,OAAkB;IAC7E,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IAClC,IAAI,CAAC,MAAM;QAAE,OAAO;IACpB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,+BAA+B,CAC7C,OAAkB,EAClB,UAAmB,EACnB,OAAiC;IAEjC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,qCAAqC,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;AACzG,CAAC;AAED;;GAEG"}

package/dist/baselines/atomizer/inPlaceModifier-containers.d.ts

@@ -0,0 +1,74 @@
+/**
+ * In-Place AST Modifier
+ *
+ * Modifies the revised document's AST in-place to add track changes markup.
+ * This replaces the reconstruction-based approach with direct tree manipulation.
+ */
+import type { ComparisonUnitAtom } from '../../core-types.js';
+import { CorrelationStatus } from '../../core-types.js';
+interface ContainerResolutionContext {
+    body: Element;
+    lastProcessedParagraph: Element | null;
+    lastParaByContainer: Map<Element, Element>;
+}
+export declare class ContainerResolutionError extends Error {
+    constructor(message: string);
+}
+/** A single step in a structural path from a paragraph up to w:body. */
+export interface ContainerPathStep {
+    tag: string;
+    index: number;
+}
+/**
+ * Compute the structural path from a paragraph to the document body.
+ * Walks `parentNode` from the paragraph, recording {tag, index} for each
+ * structural container (w:tc, w:tr, w:tbl). Stops at w:body.
+ * Returns innermost-first order.
+ *
+ * Uses original-tree nodes — safe because only the revised tree is mutated.
+ */
+export declare function getContainerPath(paragraph: Element): ContainerPathStep[];
+/**
+ * Resolve a container path in the revised tree.
+ * Walks the path in reverse (outermost → innermost) from `body`.
+ * Returns the deepest container (typically w:tc), or null on mismatch.
+ */
+export declare function resolveContainerInRevised(path: ContainerPathStep[], body: Element): Element | null;
+/**
+ * Validate that the revised tree has compatible topology at the given path.
+ * Checks row count and cell count match at the target position.
+ * Returns false if there's a structural mismatch (row/cell additions, gridSpan divergence).
+ */
+export declare function validateContainerTopology(path: ContainerPathStep[], body: Element): boolean;
+/**
+ * Find the correct container and insertion anchor for a deleted/moved-source atom.
+ *
+ * For body-level atoms, returns ctx.body with the global lastProcessedParagraph anchor.
+ * For table-cell atoms, maps from the original tree container to the revised tree container
+ * by structural position, and uses the per-container anchor from lastParaByContainer.
+ *
+ * Returns null if container resolution fails (topology mismatch) — caller must throw
+ * ContainerResolutionError to trigger rebuild fallback.
+ */
+export declare function findTargetContainerForAtom(atom: ComparisonUnitAtom, ctx: ContainerResolutionContext): {
+    container: Element;
+    insertAfter: Element | null;
+} | null;
+/**
+ * Determine whether an atom is "whitespace-only" for paragraph-level classification.
+ *
+ * We treat pure whitespace runs/tabs/breaks as ignorable noise, because LCS alignment
+ * can mark them Equal even when a whole paragraph was inserted/deleted. If we don't
+ * ignore them, Word can end up with a stub paragraph after Accept/Reject All.
+ */
+export declare function isWhitespaceAtom(atom: ComparisonUnitAtom): boolean;
+/**
+ * Returns true if every non-empty atom in this paragraph is of the specified status,
+ * ignoring whitespace-only atoms.
+ *
+ * Mirrors the rebuild reconstructor's whole-paragraph classification so that inplace
+ * output behaves the same under Word's Accept/Reject All.
+ */
+export declare function isEntireParagraphAtomsWithStatus(atoms: ComparisonUnitAtom[], status: CorrelationStatus): boolean;
+export {};
+//# sourceMappingURL=inPlaceModifier-containers.d.ts.map

package/dist/baselines/atomizer/inPlaceModifier-containers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inPlaceModifier-containers.d.ts","sourceRoot":"","sources":["../../../src/baselines/atomizer/inPlaceModifier-containers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAKxD,UAAU,0BAA0B;IAClC,IAAI,EAAE,OAAO,CAAC;IACd,sBAAsB,EAAE,OAAO,GAAG,IAAI,CAAC;IACvC,mBAAmB,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;CAC5C;AAMD,qBAAa,wBAAyB,SAAQ,KAAK;gBACrC,OAAO,EAAE,MAAM;CAI5B;AAED,wEAAwE;AACxE,MAAM,WAAW,iBAAiB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,OAAO,GAAG,iBAAiB,EAAE,CAwBxE;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,iBAAiB,EAAE,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,GAAG,IAAI,CAalG;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,iBAAiB,EAAE,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAW3F;AAED;;;;;;;;;GASG;AACH,wBAAgB,0BAA0B,CACxC,IAAI,EAAE,kBAAkB,EACxB,GAAG,EAAE,0BAA0B,GAC9B;IAAE,SAAS,EAAE,OAAO,CAAC;IAAC,WAAW,EAAE,OAAO,GAAG,IAAI,CAAA;CAAE,GAAG,IAAI,CAiC5D;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,kBAAkB,GAAG,OAAO,CAKlE;AAED;;;;;;GAMG;AACH,wBAAgB,gCAAgC,CAC9C,KAAK,EAAE,kBAAkB,EAAE,EAC3B,MAAM,EAAE,iBAAiB,GACxB,OAAO,CAoBT"}

package/dist/baselines/atomizer/inPlaceModifier-containers.js

@@ -0,0 +1,171 @@
+/**
+ * In-Place AST Modifier
+ *
+ * Modifies the revised document's AST in-place to add track changes markup.
+ * This replaces the reconstruction-based approach with direct tree manipulation.
+ */
+import { EMPTY_PARAGRAPH_TAG } from '../../atomizer.js';
+import { childElements, getLeafText } from '../../primitives/index.js';
+import { findAncestorByTag } from './inPlaceModifier-shared.js';
+// @lean-segment: container-topology
+// Lean traceability anchor — cited by verification/lean/LeanSpike/Spec.lean for
+// the container-topology-mismatch failure mode that makes the inplace candidate
+// partial. Grep this anchor instead of relying on line numbers (refactor-stable).
+export class ContainerResolutionError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'ContainerResolutionError';
+    }
+}
+/**
+ * Compute the structural path from a paragraph to the document body.
+ * Walks `parentNode` from the paragraph, recording {tag, index} for each
+ * structural container (w:tc, w:tr, w:tbl). Stops at w:body.
+ * Returns innermost-first order.
+ *
+ * Uses original-tree nodes — safe because only the revised tree is mutated.
+ */
+export function getContainerPath(paragraph) {
+    const path = [];
+    let current = paragraph.parentNode;
+    while (current && current.tagName) {
+        const el = current;
+        if (el.tagName === 'w:body')
+            break;
+        if (el.tagName === 'w:tc' || el.tagName === 'w:tr' || el.tagName === 'w:tbl') {
+            const parent = el.parentNode;
+            if (parent) {
+                let index = 0;
+                let sibling = el.previousSibling;
+                while (sibling) {
+                    if (sibling.nodeType === 1 && sibling.tagName === el.tagName) {
+                        index++;
+                    }
+                    sibling = sibling.previousSibling;
+                }
+                path.push({ tag: el.tagName, index });
+            }
+        }
+        current = el.parentNode;
+    }
+    return path;
+}
+/**
+ * Resolve a container path in the revised tree.
+ * Walks the path in reverse (outermost → innermost) from `body`.
+ * Returns the deepest container (typically w:tc), or null on mismatch.
+ */
+export function resolveContainerInRevised(path, body) {
+    if (path.length === 0)
+        return null;
+    let current = body;
+    // Walk outermost to innermost (path is innermost-first, so reverse)
+    for (let i = path.length - 1; i >= 0; i--) {
+        const step = path[i];
+        const children = childElements(current).filter(c => c.tagName === step.tag);
+        const child = children[step.index];
+        if (!child)
+            return null; // Structural mismatch
+        current = child;
+    }
+    return current;
+}
+/**
+ * Validate that the revised tree has compatible topology at the given path.
+ * Checks row count and cell count match at the target position.
+ * Returns false if there's a structural mismatch (row/cell additions, gridSpan divergence).
+ */
+export function validateContainerTopology(path, body) {
+    if (path.length === 0)
+        return true; // Body-level, always valid
+    let current = body;
+    for (let i = path.length - 1; i >= 0; i--) {
+        const step = path[i];
+        const children = childElements(current).filter(c => c.tagName === step.tag);
+        if (step.index >= children.length)
+            return false;
+        current = children[step.index];
+    }
+    return true;
+}
+/**
+ * Find the correct container and insertion anchor for a deleted/moved-source atom.
+ *
+ * For body-level atoms, returns ctx.body with the global lastProcessedParagraph anchor.
+ * For table-cell atoms, maps from the original tree container to the revised tree container
+ * by structural position, and uses the per-container anchor from lastParaByContainer.
+ *
+ * Returns null if container resolution fails (topology mismatch) — caller must throw
+ * ContainerResolutionError to trigger rebuild fallback.
+ */
+export function findTargetContainerForAtom(atom, ctx) {
+    // 1. Check if atom was in a table cell (original tree ancestors)
+    const sourceTc = findAncestorByTag(atom, 'w:tc');
+    if (!sourceTc) {
+        // Body-level paragraph — use global anchor (current behavior, correct)
+        return { container: ctx.body, insertAfter: ctx.lastProcessedParagraph };
+    }
+    // 2. Compute structural path from original tree
+    const sourcePara = atom.sourceParagraphElement;
+    if (!sourcePara) {
+        return null; // Can't resolve → force rebuild
+    }
+    const path = getContainerPath(sourcePara);
+    if (path.length === 0) {
+        // Paragraph has a w:tc ancestor but path is empty — shouldn't happen
+        return null;
+    }
+    // 3. Validate topology match before resolving
+    if (!validateContainerTopology(path, ctx.body)) {
+        return null; // Structural mismatch → force rebuild
+    }
+    // 4. Resolve container in revised tree
+    const revisedContainer = resolveContainerInRevised(path, ctx.body);
+    if (!revisedContainer) {
+        return null; // Resolution failed → force rebuild
+    }
+    // 5. Find container-local insertion anchor
+    const anchor = ctx.lastParaByContainer.get(revisedContainer) ?? null;
+    return { container: revisedContainer, insertAfter: anchor };
+}
+/**
+ * Determine whether an atom is "whitespace-only" for paragraph-level classification.
+ *
+ * We treat pure whitespace runs/tabs/breaks as ignorable noise, because LCS alignment
+ * can mark them Equal even when a whole paragraph was inserted/deleted. If we don't
+ * ignore them, Word can end up with a stub paragraph after Accept/Reject All.
+ */
+export function isWhitespaceAtom(atom) {
+    const el = atom.contentElement;
+    if (el.tagName === EMPTY_PARAGRAPH_TAG)
+        return true;
+    if (el.tagName === 'w:t')
+        return ((getLeafText(el) ?? '').trim() === '');
+    return el.tagName === 'w:tab' || el.tagName === 'w:br' || el.tagName === 'w:cr';
+}
+/**
+ * Returns true if every non-empty atom in this paragraph is of the specified status,
+ * ignoring whitespace-only atoms.
+ *
+ * Mirrors the rebuild reconstructor's whole-paragraph classification so that inplace
+ * output behaves the same under Word's Accept/Reject All.
+ */
+export function isEntireParagraphAtomsWithStatus(atoms, status) {
+    let sawAnyContent = false;
+    let sawTargetStatus = false;
+    for (const atom of atoms) {
+        const el = atom.contentElement;
+        if (el.tagName === EMPTY_PARAGRAPH_TAG)
+            continue;
+        sawAnyContent = true;
+        if (atom.correlationStatus === status) {
+            sawTargetStatus = true;
+            continue;
+        }
+        if (isWhitespaceAtom(atom))
+            continue;
+        return false;
+    }
+    return sawAnyContent && sawTargetStatus;
+}
+//# sourceMappingURL=inPlaceModifier-containers.js.map

package/dist/baselines/atomizer/inPlaceModifier-containers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inPlaceModifier-containers.js","sourceRoot":"","sources":["../../../src/baselines/atomizer/inPlaceModifier-containers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAQhE,oCAAoC;AACpC,gFAAgF;AAChF,gFAAgF;AAChF,kFAAkF;AAClF,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AAQD;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAkB;IACjD,MAAM,IAAI,GAAwB,EAAE,CAAC;IACrC,IAAI,OAAO,GAAgB,SAAS,CAAC,UAAU,CAAC;IAChD,OAAO,OAAO,IAAK,OAAmB,CAAC,OAAO,EAAE,CAAC;QAC/C,MAAM,EAAE,GAAG,OAAkB,CAAC;QAC9B,IAAI,EAAE,CAAC,OAAO,KAAK,QAAQ;YAAE,MAAM;QAEnC,IAAI,EAAE,CAAC,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;YAC7E,MAAM,MAAM,GAAG,EAAE,CAAC,UAAqB,CAAC;YACxC,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,KAAK,GAAG,CAAC,CAAC;gBACd,IAAI,OAAO,GAAG,EAAE,CAAC,eAAe,CAAC;gBACjC,OAAO,OAAO,EAAE,CAAC;oBACf,IAAI,OAAO,CAAC,QAAQ,KAAK,CAAC,IAAK,OAAmB,CAAC,OAAO,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;wBAC1E,KAAK,EAAE,CAAC;oBACV,CAAC;oBACD,OAAO,GAAG,OAAO,CAAC,eAAe,CAAC;gBACpC,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QACD,OAAO,GAAG,EAAE,CAAC,UAAU,CAAC;IAC1B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAyB,EAAE,IAAa;IAChF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEnC,IAAI,OAAO,GAAY,IAAI,CAAC;IAC5B,oEAAoE;IACpE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5E,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,CAAC,sBAAsB;QAC/C,OAAO,GAAG,KAAK,CAAC;IAClB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAyB,EAAE,IAAa;IAChF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,2BAA2B;IAE/D,IAAI,OAAO,GAAY,IAAI,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5E,IAAI,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAChD,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,0BAA0B,CACxC,IAAwB,EACxB,GAA+B;IAE/B,iEAAiE;IACjE,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,uEAAuE;QACvE,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,CAAC,sBAAsB,EAAE,CAAC;IAC1E,CAAC;IAED,gDAAgD;IAChD,MAAM,UAAU,GAAG,IAAI,CAAC,sBAAsB,CAAC;IAC/C,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,OAAO,IAAI,CAAC,CAAC,gCAAgC;IAC/C,CAAC;IACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,qEAAqE;QACrE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8CAA8C;IAC9C,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,OAAO,IAAI,CAAC,CAAC,sCAAsC;IACrD,CAAC;IAED,uCAAuC;IACvC,MAAM,gBAAgB,GAAG,yBAAyB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACnE,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,CAAC,oCAAoC;IACnD,CAAC;IAED,2CAA2C;IAC3C,MAAM,MAAM,GAAG,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,IAAI,CAAC;IACrE,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;AAC9D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAwB;IACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;IAC/B,IAAI,EAAE,CAAC,OAAO,KAAK,mBAAmB;QAAE,OAAO,IAAI,CAAC;IACpD,IAAI,EAAE,CAAC,OAAO,KAAK,KAAK;QAAE,OAAO,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACzE,OAAO,EAAE,CAAC,OAAO,KAAK,OAAO,IAAI,EAAE,CAAC,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,OAAO,KAAK,MAAM,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gCAAgC,CAC9C,KAA2B,EAC3B,MAAyB;IAEzB,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,eAAe,GAAG,KAAK,CAAC;IAE5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,EAAE,CAAC,OAAO,KAAK,mBAAmB;YAAE,SAAS;QAEjD,aAAa,GAAG,IAAI,CAAC;QAErB,IAAI,IAAI,CAAC,iBAAiB,KAAK,MAAM,EAAE,CAAC;YACtC,eAAe,GAAG,IAAI,CAAC;YACvB,SAAS;QACX,CAAC;QAED,IAAI,gBAAgB,CAAC,IAAI,CAAC;YAAE,SAAS;QACrC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,aAAa,IAAI,eAAe,CAAC;AAC1C,CAAC"}

package/dist/baselines/atomizer/inPlaceModifier-deletion.d.ts

@@ -0,0 +1,88 @@
+/**
+ * In-Place AST Modifier
+ *
+ * Modifies the revised document's AST in-place to add track changes markup.
+ * This replaces the reconstruction-based approach with direct tree manipulation.
+ */
+import type { ComparisonUnitAtom } from '../../core-types.js';
+import { type RevisionIdState } from './inPlaceModifier-shared.js';
+import { type BookmarkSurvivalContext } from './inPlaceModifier-bookmarks.js';
+export declare function getInsertableAtomContentElements(atom: ComparisonUnitAtom, filterRun?: Element): Element[];
+/**
+ * Clone a source run and replace its non-rPr children with atom content.
+ *
+ * This keeps run-level formatting while allowing atom-level fragment insertion.
+ *
+ * @param filterRun - When provided, only include content elements belonging
+ *   to this source run (for multi-run collapsed field replay).
+ */
+export declare function cloneRunWithAtomContent(sourceRun: Element, atom: ComparisonUnitAtom, filterRun?: Element): Element;
+/**
+ * Clone a deleted run from the original document and insert it into the revised document.
+ *
+ * For a single-content atom this wraps one cloned run in `<w:del>` and returns
+ * the `<w:del>` element. For a collapsed-field atom (issue #217), control
+ * routes to `insertFragmentedDeletedField` which emits multiple sibling
+ * elements — `w:fldChar` runs at sibling level (unwrapped) and individual
+ * `<w:del>` wrappers around each payload run — and returns the LAST inserted
+ * sibling (which may be a `<w:r>` carrying the end fldChar, not a `<w:del>`).
+ * Callers use the return value purely as the next insertion anchor.
+ *
+ * @param deletedAtom - Atom with the deleted content
+ * @param insertAfterRun - The run to insert after (null to insert at beginning of paragraph)
+ * @param targetParagraph - The paragraph to insert into
+ * @param author - Author name
+ * @param dateStr - Formatted date
+ * @param state - Revision ID state
+ * @returns The last inserted sibling element (a `<w:del>` for non-collapsed-field
+ *   atoms; possibly a `<w:r>` for fragmented collapsed-field atoms), or null
+ *   if insertion failed.
+ */
+export declare function insertDeletedRun(deletedAtom: ComparisonUnitAtom, insertAfterRun: Element | null, targetParagraph: Element, author: string, dateStr: string, state: RevisionIdState, context?: BookmarkSurvivalContext): Element | null;
+/**
+ * Emit a fragmented deletion of a collapsed-field atom: walks the constituent
+ * source runs in document order, cloning each into the target paragraph as
+ * either a sibling-level unwrapped run (for `w:fldChar`) or a `<w:del>`-wrapped
+ * run (for payload runs whose text is renamed to `w:delText` / `w:delInstrText`).
+ *
+ * Returns the last sibling element inserted, which the caller uses as the
+ * next insertion anchor (preserving the contract of `insertDeletedRun`).
+ *
+ * @conformance ECMA-376 edition 5, Part 4 § 17.16.5
+ *
+ * Rule: `w:delInstrText` MUST appear inside `<w:del>`;
+ * by extension and by issue #217's deep-research conclusion, `w:fldChar` runs
+ * stay at sibling level.
+ */
+export declare function insertFragmentedDeletedField(deletedAtom: ComparisonUnitAtom, sourceRun: Element, insertAfterRun: Element | null, targetParagraph: Element, author: string, dateStr: string, state: RevisionIdState, context?: BookmarkSurvivalContext): Element | null;
+/**
+ * Clone a moved-from run from the original document and insert it into the revised document.
+ *
+ * MovedSource atoms have their sourceRunElement in the ORIGINAL tree, but we need to
+ * insert the content into the REVISED tree. This function clones the run, wraps it with
+ * <w:moveFrom> and range markers, and inserts at the correct position.
+ *
+ * @param atom - Atom with the moved-from content
+ * @param moveName - Name for linking source and destination
+ * @param insertAfterRun - The run to insert after (null to insert at beginning of paragraph)
+ * @param targetParagraph - The paragraph to insert into
+ * @param author - Author name
+ * @param dateStr - Formatted date
+ * @param state - Revision ID state
+ * @returns The inserted moveFrom element, or null if insertion failed
+ */
+export declare function insertMoveFromRun(atom: ComparisonUnitAtom, moveName: string, insertAfterRun: Element | null, targetParagraph: Element, author: string, dateStr: string, state: RevisionIdState, context?: BookmarkSurvivalContext): Element | null;
+/**
+ * Clone a deleted paragraph from the original document and insert it.
+ *
+ * @param deletedAtom - Atom representing the deleted paragraph
+ * @param insertAfterParagraph - Paragraph to insert after (null to insert at body start)
+ * @param targetBody - The body element to insert into
+ * @param author - Author name
+ * @param dateStr - Formatted date
+ * @param state - Revision ID state
+ * @returns The inserted paragraph, or null if insertion failed
+ */
+export declare function insertDeletedParagraph(deletedAtom: ComparisonUnitAtom, insertAfterParagraph: Element | null, targetContainer: Element, author: string, dateStr: string, state: RevisionIdState): Element | null;
+export declare const FIELD_CHAR_TAG_NAMES: ReadonlySet<string>;
+//# sourceMappingURL=inPlaceModifier-deletion.d.ts.map

package/dist/baselines/atomizer/inPlaceModifier-deletion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inPlaceModifier-deletion.d.ts","sourceRoot":"","sources":["../../../src/baselines/atomizer/inPlaceModifier-deletion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAE9D,OAAO,EAML,KAAK,eAAe,EACrB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAGL,KAAK,uBAAuB,EAC7B,MAAM,gCAAgC,CAAC;AAGxC,wBAAgB,gCAAgC,CAC9C,IAAI,EAAE,kBAAkB,EACxB,SAAS,CAAC,EAAE,OAAO,GAClB,OAAO,EAAE,CAaX;AAED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,OAAO,EAClB,IAAI,EAAE,kBAAkB,EACxB,SAAS,CAAC,EAAE,OAAO,GAClB,OAAO,CAwBT;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,gBAAgB,CAC9B,WAAW,EAAE,kBAAkB,EAC/B,cAAc,EAAE,OAAO,GAAG,IAAI,EAC9B,eAAe,EAAE,OAAO,EACxB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,eAAe,EACtB,OAAO,CAAC,EAAE,uBAAuB,GAChC,OAAO,GAAG,IAAI,CA2DhB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,4BAA4B,CAC1C,WAAW,EAAE,kBAAkB,EAC/B,SAAS,EAAE,OAAO,EAClB,cAAc,EAAE,OAAO,GAAG,IAAI,EAC9B,eAAe,EAAE,OAAO,EACxB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,eAAe,EACtB,OAAO,CAAC,EAAE,uBAAuB,GAChC,OAAO,GAAG,IAAI,CA2DhB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,kBAAkB,EACxB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,OAAO,GAAG,IAAI,EAC9B,eAAe,EAAE,OAAO,EACxB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,eAAe,EACtB,OAAO,CAAC,EAAE,uBAAuB,GAChC,OAAO,GAAG,IAAI,CA0EhB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CACpC,WAAW,EAAE,kBAAkB,EAC/B,oBAAoB,EAAE,OAAO,GAAG,IAAI,EACpC,eAAe,EAAE,OAAO,EACxB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,eAAe,GACrB,OAAO,GAAG,IAAI,CA+BhB;AAGD,eAAO,MAAM,oBAAoB,EAAE,WAAW,CAAC,MAAM,CAEnD,CAAC"}