docxmlater 11.0.10 → 12.1.0

package/dist/processors/RevisionWalker.js

@@ -30,9 +30,18 @@ const REVISION_ELEMENTS = {
         'w:customXmlMoveToRangeEnd',
     ],
 };
+const PRESERVED_ON_RESTORE = {
+    'w:pPr': { keys: ['w:rPr', 'w:sectPr'], position: 'after' },
+    'w:sectPr': { keys: ['w:headerReference', 'w:footerReference'], position: 'before' },
+};
+const DELETED_TEXT_RENAMES = {
+    'w:delText': 'w:t',
+    'w:delInstrText': 'w:instrText',
+};
 class RevisionWalker {
     static processTree(obj, options) {
         const opts = {
+            mode: options?.mode ?? 'accept',
             acceptInsertions: options?.acceptInsertions ?? true,
             acceptDeletions: options?.acceptDeletions ?? true,
             acceptMoves: options?.acceptMoves ?? true,
@@ -40,6 +49,9 @@ class RevisionWalker {
         };
         const clone = RevisionWalker.deepClone(obj);
         RevisionWalker.walkAndTransform(clone, opts);
+        if (opts.mode === 'reject' && opts.acceptDeletions) {
+            RevisionWalker.convertDeletedTextToNormal(clone);
+        }
         return clone;
     }
     static deepClone(obj) {
@@ -59,8 +71,21 @@ class RevisionWalker {
         if (obj === null || typeof obj !== 'object') {
             return;
         }
-        if (options.acceptDeletions && obj['w:tr']) {
-            RevisionWalker.filterDeletedRows(obj);
+        if (options.mode === 'reject') {
+            if (options.acceptInsertions && obj['w:tbl']) {
+                RevisionWalker.removeFullyMarkedTables(obj, 'w:ins');
+            }
+            if (options.acceptInsertions && obj['w:tr']) {
+                RevisionWalker.filterMarkedRows(obj, 'w:ins');
+            }
+        }
+        else {
+            if (options.acceptDeletions && obj['w:tbl']) {
+                RevisionWalker.removeFullyMarkedTables(obj, 'w:del');
+            }
+            if (options.acceptDeletions && obj['w:tr']) {
+                RevisionWalker.filterMarkedRows(obj, 'w:del');
+            }
         }
         const keys = Object.keys(obj).filter((k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren');
         for (const key of keys) {
@@ -76,70 +101,125 @@ class RevisionWalker {
         }
         RevisionWalker.processRevisions(obj, options);
     }
-    static filterDeletedRows(tbl) {
+    static filterMarkedRows(tbl, marker) {
         const rows = tbl['w:tr'];
-        const isRowDeleted = (row) => {
+        const isRowMarked = (row) => {
             if (!row || typeof row !== 'object')
                 return false;
             const trPr = row['w:trPr'];
             if (!trPr || typeof trPr !== 'object')
                 return false;
-            return !!trPr['w:del'];
+            return !!trPr[marker];
         };
         if (Array.isArray(rows)) {
-            const kept = rows.filter((r) => !isRowDeleted(r));
-            if (kept.length !== rows.length) {
-                if (kept.length === 0) {
-                    delete tbl['w:tr'];
-                }
-                else {
-                    tbl['w:tr'] = kept;
-                }
+            const removedIndices = new Set();
+            for (let i = 0; i < rows.length; i++) {
+                if (isRowMarked(rows[i]))
+                    removedIndices.add(i);
+            }
+            if (removedIndices.size === 0)
+                return;
+            const kept = rows.filter((_, i) => !removedIndices.has(i));
+            if (kept.length === 0) {
+                delete tbl['w:tr'];
+            }
+            else {
+                tbl['w:tr'] = kept;
             }
+            RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', removedIndices);
         }
-        else if (isRowDeleted(rows)) {
+        else if (isRowMarked(rows)) {
             delete tbl['w:tr'];
+            RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', new Set([0]));
         }
     }
+    static removeFullyMarkedTables(parent, marker) {
+        const tables = parent['w:tbl'];
+        const survivingWrappers = marker === 'w:del' ? ['w:ins', 'w:moveTo'] : ['w:del', 'w:moveFrom'];
+        const becomesRowless = (tbl) => {
+            if (!tbl || typeof tbl !== 'object' || tbl['w:tr'] === undefined)
+                return false;
+            RevisionWalker.filterMarkedRows(tbl, marker);
+            return (tbl['w:tr'] === undefined &&
+                !survivingWrappers.some((w) => tbl[w]) &&
+                !tbl['w:sdt'] &&
+                !tbl['w:customXml']);
+        };
+        if (Array.isArray(tables)) {
+            const removedIndices = new Set();
+            for (let i = 0; i < tables.length; i++) {
+                if (becomesRowless(tables[i]))
+                    removedIndices.add(i);
+            }
+            if (removedIndices.size === 0)
+                return;
+            const kept = tables.filter((_, i) => !removedIndices.has(i));
+            if (kept.length === 0) {
+                delete parent['w:tbl'];
+            }
+            else {
+                parent['w:tbl'] = kept;
+            }
+            RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', removedIndices);
+        }
+        else if (becomesRowless(tables)) {
+            delete parent['w:tbl'];
+            RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', new Set([0]));
+        }
+    }
+    static dropOrderedChildEntries(parent, type, removedIndices) {
+        if (!parent._orderedChildren)
+            return;
+        parent._orderedChildren = parent._orderedChildren.filter((c) => c.type !== type || !removedIndices.has(c.index));
+        RevisionWalker.reindexOrderedChildren(parent._orderedChildren);
+    }
     static processRevisions(parent, options) {
         if (!parent || typeof parent !== 'object') {
             return;
         }
         const keysToProcess = Object.keys(parent).filter((k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren');
         for (const key of keysToProcess) {
-            if (RevisionWalker.shouldUnwrap(key, options)) {
-                RevisionWalker.unwrapAllElements(parent, key);
-            }
-            else if (RevisionWalker.shouldRemove(key, options)) {
-                RevisionWalker.removeAllElements(parent, key);
+            switch (RevisionWalker.getActionForKey(key, options)) {
+                case 'unwrap':
+                    RevisionWalker.unwrapAllElements(parent, key);
+                    break;
+                case 'remove':
+                    RevisionWalker.removeAllElements(parent, key);
+                    break;
+                case 'restore':
+                    RevisionWalker.restorePropertyChange(parent, key);
+                    break;
+                case 'none':
+                    break;
             }
         }
     }
-    static shouldUnwrap(key, options) {
-        if (REVISION_ELEMENTS.UNWRAP.includes(key)) {
-            if (key === 'w:ins' && !options.acceptInsertions)
-                return false;
-            if (key === 'w:moveTo' && !options.acceptMoves)
-                return false;
-            return true;
-        }
-        return false;
-    }
-    static shouldRemove(key, options) {
-        if (REVISION_ELEMENTS.REMOVE.includes(key)) {
-            if (key === 'w:del' && !options.acceptDeletions)
-                return false;
-            if (key === 'w:moveFrom' && !options.acceptMoves)
-                return false;
-            return true;
+    static getActionForKey(key, options) {
+        const reject = options.mode === 'reject';
+        const isUnwrap = REVISION_ELEMENTS.UNWRAP.includes(key);
+        const isRemove = REVISION_ELEMENTS.REMOVE.includes(key);
+        if (isUnwrap || isRemove) {
+            const gate = key === 'w:ins'
+                ? options.acceptInsertions
+                : key === 'w:del'
+                    ? options.acceptDeletions
+                    : options.acceptMoves;
+            if (!gate)
+                return 'none';
+            const keepContent = reject ? isRemove : isUnwrap;
+            return keepContent ? 'unwrap' : 'remove';
         }
         if (REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key)) {
-            return options.acceptPropertyChanges;
+            if (!options.acceptPropertyChanges)
+                return 'none';
+            if (reject && key !== 'w:numberingChange')
+                return 'restore';
+            return 'remove';
         }
         if (REVISION_ELEMENTS.RANGE_MARKERS.includes(key)) {
-            return true;
+            return 'remove';
         }
-        return false;
+        return 'none';
     }
     static unwrapAllElements(parent, key) {
         const elements = parent[key];
@@ -245,6 +325,110 @@ class RevisionWalker {
         }
         delete parent[key];
     }
+    static restorePropertyChange(parent, changeKey) {
+        const changeRaw = parent[changeKey];
+        if (!changeRaw)
+            return;
+        const changeEl = Array.isArray(changeRaw) ? changeRaw[0] : changeRaw;
+        const previousKey = changeKey.replace(/Change$/, '');
+        const previousRaw = changeEl && typeof changeEl === 'object' ? changeEl[previousKey] : undefined;
+        if (previousRaw === undefined) {
+            RevisionWalker.removeAllElements(parent, changeKey);
+            return;
+        }
+        const previousEl = Array.isArray(previousRaw) ? previousRaw[0] : previousRaw;
+        const preserve = PRESERVED_ON_RESTORE[previousKey];
+        const preserveKeys = preserve?.keys ?? [];
+        const snapshotChildren = previousEl && typeof previousEl === 'object'
+            ? RevisionWalker.getOrderedChildList(previousEl).filter((c) => !preserveKeys.includes(c.type))
+            : [];
+        const preservedChildren = preserveKeys.length
+            ? RevisionWalker.getOrderedChildList(parent).filter((c) => preserveKeys.includes(c.type) && c.type !== changeKey)
+            : [];
+        const newChildren = preserve?.position === 'before'
+            ? [...preservedChildren, ...snapshotChildren]
+            : [...snapshotChildren, ...preservedChildren];
+        RevisionWalker.rebuildChildren(parent, newChildren);
+    }
+    static rebuildChildren(parent, ordered) {
+        for (const k of Object.keys(parent)) {
+            if (!k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren') {
+                delete parent[k];
+            }
+        }
+        const grouped = new Map();
+        for (const { type, element } of ordered) {
+            if (!grouped.has(type))
+                grouped.set(type, []);
+            grouped.get(type).push(element);
+        }
+        for (const [type, elements] of grouped) {
+            parent[type] = elements.length === 1 ? elements[0] : elements;
+        }
+        const orderedChildren = [];
+        const counters = new Map();
+        for (const { type } of ordered) {
+            const idx = counters.get(type) || 0;
+            counters.set(type, idx + 1);
+            orderedChildren.push({ type, index: idx });
+        }
+        if (orderedChildren.length > 0) {
+            parent._orderedChildren = orderedChildren;
+        }
+        else {
+            delete parent._orderedChildren;
+        }
+    }
+    static getOrderedChildList(el) {
+        const result = [];
+        const ordered = el._orderedChildren;
+        if (Array.isArray(ordered) && ordered.length > 0) {
+            const counters = new Map();
+            for (const entry of ordered) {
+                const { type } = entry;
+                const idx = counters.get(type) || 0;
+                counters.set(type, idx + 1);
+                const value = el[type];
+                if (value === undefined)
+                    continue;
+                const arr = Array.isArray(value) ? value : [value];
+                if (idx < arr.length)
+                    result.push({ type, element: arr[idx] });
+            }
+            return result;
+        }
+        for (const key of Object.keys(el)) {
+            if (key.startsWith('@_') || key === '#text' || key === '_orderedChildren')
+                continue;
+            const value = el[key];
+            const arr = Array.isArray(value) ? value : [value];
+            for (const element of arr)
+                result.push({ type: key, element });
+        }
+        return result;
+    }
+    static convertDeletedTextToNormal(obj) {
+        if (obj === null || typeof obj !== 'object')
+            return;
+        if (Array.isArray(obj)) {
+            for (const item of obj)
+                RevisionWalker.convertDeletedTextToNormal(item);
+            return;
+        }
+        const hasDeletedText = Object.keys(obj).some((k) => k in DELETED_TEXT_RENAMES);
+        if (hasDeletedText) {
+            const ordered = RevisionWalker.getOrderedChildList(obj).map((child) => ({
+                type: DELETED_TEXT_RENAMES[child.type] ?? child.type,
+                element: child.element,
+            }));
+            RevisionWalker.rebuildChildren(obj, ordered);
+        }
+        for (const key of Object.keys(obj)) {
+            if (key.startsWith('@_') || key === '#text' || key === '_orderedChildren')
+                continue;
+            RevisionWalker.convertDeletedTextToNormal(obj[key]);
+        }
+    }
     static mergeIntoParent(parent, childKey, childValue) {
         if (parent[childKey] === undefined) {
             parent[childKey] = childValue;

package/dist/processors/RevisionWalker.js.map

@@ -1 +1 @@
-{"version":3,"file":"RevisionWalker.js","sourceRoot":"","sources":["../../src/processors/RevisionWalker.ts"],"names":[],"mappings":";;;AAqCA,MAAM,iBAAiB,GAAG;IAExB,MAAM,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;IAG7B,MAAM,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC;IAG/B,gBAAgB,EAAE;QAChB,aAAa;QACb,aAAa;QACb,eAAe;QACf,cAAc;QACd,cAAc;QACd,gBAAgB;QAChB,iBAAiB;QACjB,mBAAmB;QACnB,iBAAiB;KAClB;IAGD,aAAa,EAAE;QACb,sBAAsB;QACtB,oBAAoB;QACpB,oBAAoB;QACpB,kBAAkB;QAClB,0BAA0B;QAC1B,wBAAwB;QACxB,0BAA0B;QAC1B,wBAAwB;QACxB,+BAA+B;QAC/B,6BAA6B;QAC7B,6BAA6B;QAC7B,2BAA2B;KAC5B;CACF,CAAC;AAcF,MAAa,cAAc;IAczB,MAAM,CAAC,WAAW,CAAC,GAAoB,EAAE,OAA+B;QACtE,MAAM,IAAI,GAAoC;YAC5C,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,IAAI,IAAI;YACnD,eAAe,EAAE,OAAO,EAAE,eAAe,IAAI,IAAI;YACjD,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,IAAI;YACzC,qBAAqB,EAAE,OAAO,EAAE,qBAAqB,IAAI,IAAI;SAC9D,CAAC;QAGF,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAG5C,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE7C,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO,GAAG,CAAC;QACb,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMO,MAAM,CAAC,gBAAgB,CAAC,GAAQ,EAAE,OAAwC;QAChF,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO;QACT,CAAC;QAQD,IAAI,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,cAAc,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QAGD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAGF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,cAAc,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;iBAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACvD,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAID,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAOO,MAAM,CAAC,iBAAiB,CAAC,GAAQ;QACvC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAW,EAAE;YACzC,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAIpD,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,gBAAgB,CAAC,MAAW,EAAE,OAAwC;QACnF,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC1C,OAAO;QACT,CAAC;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAEhC,IAAI,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC9C,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC;iBAAM,IAAI,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACrD,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,YAAY,CAAC,GAAW,EAAE,OAAwC;QAC/E,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB;gBAAE,OAAO,KAAK,CAAC;YAC/D,IAAI,GAAG,KAAK,UAAU,IAAI,CAAC,OAAO,CAAC,WAAW;gBAAE,OAAO,KAAK,CAAC;YAC7D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,YAAY,CAAC,GAAW,EAAE,OAAwC;QAC/E,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe;gBAAE,OAAO,KAAK,CAAC;YAC9D,IAAI,GAAG,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,WAAW;gBAAE,OAAO,KAAK,CAAC;YAC/D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,OAAO,OAAO,CAAC,qBAAqB,CAAC;QACvC,CAAC;QACD,IAAI,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAeO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAIrE,MAAM,eAAe,GAAqC,EAAE,CAAC;QAE7D,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAE5B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC/C,IAAI,cAAc,GAAG,CAAC,CAAC;YAEvB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC5C,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBAEvB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAEjB,MAAM,UAAU,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC;oBAChD,cAAc,EAAE,CAAC;oBAEjB,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;wBACjD,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;4BAEhC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;4BAChD,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;gCACrD,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC;gCAClC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gCACnD,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;gCAE3C,MAAM,aAAa,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;gCAC5C,IAAI,aAAa,EAAE,CAAC;oCAClB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;oCAClF,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;wCACjC,eAAe,CAAC,IAAI,CAAC;4CACnB,IAAI,EAAE,SAAS;4CACf,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC;yCAC9B,CAAC,CAAC;oCACL,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BAEN,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;4BACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gCACjC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;gCACxC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gCACzE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;oCAC/B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gCAC3D,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBAEN,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBAEhC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBACpC,IAAI,cAAc,EAAE,CAAC;wBACnB,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;wBACtF,IAAI,GAAG,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;4BAC7B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC5D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;QAGnB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;gBAChD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;YAGD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC1B,CAAC;YACH,CAAC;YAGD,MAAM,kBAAkB,GAAuB,EAAE,CAAC;YAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,eAAe,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBAChC,kBAAkB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;QAC/C,CAAC;aAAM,CAAC;YAEN,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ;oBAAE,SAAS;gBAEtD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAC7C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;gBAEF,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;oBACnC,cAAc,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACtE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO;QAGzB,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CACtD,CAAC,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CACxC,CAAC;YAEF,cAAc,CAAC,sBAAsB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACjE,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAKO,MAAM,CAAC,eAAe,CAAC,MAAW,EAAE,QAAgB,EAAE,UAAe;QAC3E,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;YAEnC,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;QAChC,CAAC;aAAM,CAAC;YAEN,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAEvE,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,sBAAsB,CAAC,eAAmC;QACvE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAKD,MAAM,CAAC,iBAAiB,CAAC,GAAW;QAClC,OAAO,CACL,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC;YAChD,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAC9C,CAAC;IACJ,CAAC;IAKD,MAAM,CAAC,4BAA4B;QACjC,OAAO,EAAE,GAAG,iBAAiB,EAAE,CAAC;IAClC,CAAC;CACF;AA7XD,wCA6XC","sourcesContent":["/**\n * RevisionWalker - DOM-based tree walker for accepting tracked changes\n *\n * Replaces the fragile RegEx-based revision acceptance with a robust\n * DOM-based approach that properly handles nested elements and preserves\n * element ordering.\n *\n * @module RevisionWalker\n */\n\nimport { ParsedXMLObject } from '../xml/XMLParser.js';\n\n/**\n * Options for controlling which revision types to accept\n */\nexport interface RevisionWalkerOptions {\n  /** Keep content, remove w:ins wrapper (default: true) */\n  acceptInsertions?: boolean;\n  /** Remove w:del and content entirely (default: true) */\n  acceptDeletions?: boolean;\n  /** Handle w:moveFrom/w:moveTo (default: true) */\n  acceptMoves?: boolean;\n  /** Remove *Change elements (default: true) */\n  acceptPropertyChanges?: boolean;\n}\n\n/**\n * Structure for tracking element order\n */\ninterface OrderedChildInfo {\n  type: string;\n  index: number;\n}\n\n/**\n * Revision element categories\n */\nconst REVISION_ELEMENTS = {\n  /** Elements to unwrap (keep content, remove wrapper) */\n  UNWRAP: ['w:ins', 'w:moveTo'],\n\n  /** Elements to remove entirely (with content) */\n  REMOVE: ['w:del', 'w:moveFrom'],\n\n  /** Property change tracking elements */\n  PROPERTY_CHANGES: [\n    'w:rPrChange',\n    'w:pPrChange',\n    'w:tblPrChange',\n    'w:tcPrChange',\n    'w:trPrChange',\n    'w:sectPrChange',\n    'w:tblGridChange',\n    'w:numberingChange',\n    'w:tblPrExChange',\n  ],\n\n  /** Range marker elements */\n  RANGE_MARKERS: [\n    'w:moveFromRangeStart',\n    'w:moveFromRangeEnd',\n    'w:moveToRangeStart',\n    'w:moveToRangeEnd',\n    'w:customXmlInsRangeStart',\n    'w:customXmlInsRangeEnd',\n    'w:customXmlDelRangeStart',\n    'w:customXmlDelRangeEnd',\n    'w:customXmlMoveFromRangeStart',\n    'w:customXmlMoveFromRangeEnd',\n    'w:customXmlMoveToRangeStart',\n    'w:customXmlMoveToRangeEnd',\n  ],\n};\n\n/**\n * DOM-based tree walker for accepting Word document revisions\n *\n * This class processes a parsed XML object tree (from XMLParser.parseToObject())\n * and accepts all tracked changes by:\n * - Unwrapping insertions (w:ins, w:moveTo) - keeping content\n * - Removing deletions (w:del, w:moveFrom) - discarding content\n * - Removing property changes (*Change elements)\n * - Removing range markers\n *\n * Element order is preserved using the _orderedChildren metadata.\n */\nexport class RevisionWalker {\n  /**\n   * Process a parsed XML object tree and accept all revisions\n   *\n   * @param obj - Parsed XML object from XMLParser.parseToObject()\n   * @param options - Options controlling which revisions to accept\n   * @returns New object tree with revisions accepted\n   *\n   * @example\n   * ```typescript\n   * const parsed = XMLParser.parseToObject(documentXml);\n   * const clean = RevisionWalker.processTree(parsed);\n   * ```\n   */\n  static processTree(obj: ParsedXMLObject, options?: RevisionWalkerOptions): ParsedXMLObject {\n    const opts: Required<RevisionWalkerOptions> = {\n      acceptInsertions: options?.acceptInsertions ?? true,\n      acceptDeletions: options?.acceptDeletions ?? true,\n      acceptMoves: options?.acceptMoves ?? true,\n      acceptPropertyChanges: options?.acceptPropertyChanges ?? true,\n    };\n\n    // Deep clone the object to avoid mutating the original\n    const clone = RevisionWalker.deepClone(obj);\n\n    // Walk and transform the tree\n    RevisionWalker.walkAndTransform(clone, opts);\n\n    return clone;\n  }\n\n  /**\n   * Deep clone an object\n   */\n  private static deepClone(obj: any): any {\n    if (obj === null || typeof obj !== 'object') {\n      return obj;\n    }\n\n    if (Array.isArray(obj)) {\n      return obj.map((item) => RevisionWalker.deepClone(item));\n    }\n\n    const clone: any = {};\n    for (const key of Object.keys(obj)) {\n      clone[key] = RevisionWalker.deepClone(obj[key]);\n    }\n    return clone;\n  }\n\n  /**\n   * Recursively walk and transform the object tree\n   * Processes children first (depth-first) to handle nested revisions\n   */\n  private static walkAndTransform(obj: any, options: Required<RevisionWalkerOptions>): void {\n    if (obj === null || typeof obj !== 'object') {\n      return;\n    }\n\n    // Pre-recursion: row-level tracked deletions (CT_TrPr > w:del per\n    // §17.13.5.14). Must run BEFORE the depth-first recursion — otherwise\n    // processRevisions in trPr would strip the w:del marker before we can\n    // detect it at the table level. The default `w:del` removal in\n    // processRevisions only strips the marker itself, leaving a zombie\n    // empty row; per spec, accepting the deletion removes the entire row.\n    if (options.acceptDeletions && obj['w:tr']) {\n      RevisionWalker.filterDeletedRows(obj);\n    }\n\n    // Get keys to process (excluding metadata keys)\n    const keys = Object.keys(obj).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    // First pass: recurse into children (depth-first)\n    for (const key of keys) {\n      const value = obj[key];\n      if (Array.isArray(value)) {\n        for (const item of value) {\n          RevisionWalker.walkAndTransform(item, options);\n        }\n      } else if (typeof value === 'object' && value !== null) {\n        RevisionWalker.walkAndTransform(value, options);\n      }\n    }\n\n    // Second pass: process revision elements at this level\n    // We need to iterate carefully because we're modifying the object\n    RevisionWalker.processRevisions(obj, options);\n  }\n\n  /**\n   * Remove `<w:tr>` entries whose `<w:trPr>` contains a self-closing\n   * `<w:del/>` row-level deletion marker. Operates on the parsed-object\n   * representation (arrays when multiple, single object otherwise).\n   */\n  private static filterDeletedRows(tbl: any): void {\n    const rows = tbl['w:tr'];\n    const isRowDeleted = (row: any): boolean => {\n      if (!row || typeof row !== 'object') return false;\n      const trPr = row['w:trPr'];\n      if (!trPr || typeof trPr !== 'object') return false;\n      // w:del at row level is a CT_TrackChange (no children). When absent\n      // the parser leaves no key; when present it's a self-closing tag\n      // parsed as an object with only @_w:id/@_w:author/@_w:date keys.\n      return !!trPr['w:del'];\n    };\n\n    if (Array.isArray(rows)) {\n      const kept = rows.filter((r) => !isRowDeleted(r));\n      if (kept.length !== rows.length) {\n        if (kept.length === 0) {\n          delete tbl['w:tr'];\n        } else {\n          tbl['w:tr'] = kept;\n        }\n      }\n    } else if (isRowDeleted(rows)) {\n      delete tbl['w:tr'];\n    }\n  }\n\n  /**\n   * Process revision elements at the current level\n   */\n  private static processRevisions(parent: any, options: Required<RevisionWalkerOptions>): void {\n    if (!parent || typeof parent !== 'object') {\n      return;\n    }\n\n    const keysToProcess = Object.keys(parent).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    for (const key of keysToProcess) {\n      // Check if this is a revision element\n      if (RevisionWalker.shouldUnwrap(key, options)) {\n        RevisionWalker.unwrapAllElements(parent, key);\n      } else if (RevisionWalker.shouldRemove(key, options)) {\n        RevisionWalker.removeAllElements(parent, key);\n      }\n    }\n  }\n\n  /**\n   * Check if an element should be unwrapped (content kept)\n   */\n  private static shouldUnwrap(key: string, options: Required<RevisionWalkerOptions>): boolean {\n    if (REVISION_ELEMENTS.UNWRAP.includes(key)) {\n      if (key === 'w:ins' && !options.acceptInsertions) return false;\n      if (key === 'w:moveTo' && !options.acceptMoves) return false;\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Check if an element should be removed (content discarded)\n   */\n  private static shouldRemove(key: string, options: Required<RevisionWalkerOptions>): boolean {\n    if (REVISION_ELEMENTS.REMOVE.includes(key)) {\n      if (key === 'w:del' && !options.acceptDeletions) return false;\n      if (key === 'w:moveFrom' && !options.acceptMoves) return false;\n      return true;\n    }\n    if (REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key)) {\n      return options.acceptPropertyChanges;\n    }\n    if (REVISION_ELEMENTS.RANGE_MARKERS.includes(key)) {\n      return true; // Always remove range markers\n    }\n    return false;\n  }\n\n  /**\n   * Unwrap all elements of a given type, promoting their children to parent\n   *\n   * This is the most complex operation in RevisionWalker. When we unwrap a\n   * revision element like w:ins, we need to:\n   * 1. Extract the children from inside w:ins\n   * 2. Insert them at the correct position in the parent's element arrays\n   * 3. Update _orderedChildren to reflect the new structure\n   *\n   * The key challenge is maintaining correct element order. For example:\n   *   Before: <w:tbl><w:tr>Row1</w:tr><w:ins><w:tr>Row2</w:tr></w:ins><w:tr>Row3</w:tr></w:tbl>\n   *   After:  <w:tbl><w:tr>Row1</w:tr><w:tr>Row2</w:tr><w:tr>Row3</w:tr></w:tbl>\n   */\n  private static unwrapAllElements(parent: any, key: string): void {\n    const elements = parent[key];\n    if (!elements) return;\n\n    const elementArray = Array.isArray(elements) ? elements : [elements];\n\n    // Build a complete ordered list of child elements by walking _orderedChildren\n    // This captures the intended order before we modify anything\n    const orderedElements: { type: string; element: any }[] = [];\n\n    if (parent._orderedChildren) {\n      // Track how many of each type we've seen to get correct array index\n      const typeCounters = new Map<string, number>();\n      let unwrappedIndex = 0;\n\n      for (const entry of parent._orderedChildren) {\n        const { type } = entry;\n\n        if (type === key) {\n          // This is a revision element - extract its children in order\n          const revElement = elementArray[unwrappedIndex];\n          unwrappedIndex++;\n\n          if (revElement && typeof revElement === 'object') {\n            if (revElement._orderedChildren) {\n              // Use the revision element's _orderedChildren for correct order\n              const childCounters = new Map<string, number>();\n              for (const childEntry of revElement._orderedChildren) {\n                const childType = childEntry.type;\n                const childIdx = childCounters.get(childType) || 0;\n                childCounters.set(childType, childIdx + 1);\n\n                const childElements = revElement[childType];\n                if (childElements) {\n                  const childArray = Array.isArray(childElements) ? childElements : [childElements];\n                  if (childIdx < childArray.length) {\n                    orderedElements.push({\n                      type: childType,\n                      element: childArray[childIdx],\n                    });\n                  }\n                }\n              }\n            } else {\n              // No _orderedChildren, extract children in object key order\n              const childKeys = Object.keys(revElement).filter(\n                (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n              );\n              for (const childKey of childKeys) {\n                const childValue = revElement[childKey];\n                const childArray = Array.isArray(childValue) ? childValue : [childValue];\n                for (const child of childArray) {\n                  orderedElements.push({ type: childKey, element: child });\n                }\n              }\n            }\n          }\n        } else {\n          // Regular element - get it from the parent\n          const idx = typeCounters.get(type) || 0;\n          typeCounters.set(type, idx + 1);\n\n          const parentElements = parent[type];\n          if (parentElements) {\n            const parentArray = Array.isArray(parentElements) ? parentElements : [parentElements];\n            if (idx < parentArray.length) {\n              orderedElements.push({ type, element: parentArray[idx] });\n            }\n          }\n        }\n      }\n    }\n\n    // Remove the revision wrapper\n    delete parent[key];\n\n    // If we have ordered elements, rebuild the arrays in correct order\n    if (orderedElements.length > 0) {\n      // Group elements by type\n      const rebuiltArrays = new Map<string, any[]>();\n\n      for (const { type, element } of orderedElements) {\n        if (!rebuiltArrays.has(type)) {\n          rebuiltArrays.set(type, []);\n        }\n        rebuiltArrays.get(type)!.push(element);\n      }\n\n      // Update parent with rebuilt arrays\n      for (const [type, elements] of rebuiltArrays) {\n        if (elements.length === 1) {\n          parent[type] = elements[0];\n        } else {\n          parent[type] = elements;\n        }\n      }\n\n      // Rebuild _orderedChildren\n      const newOrderedChildren: OrderedChildInfo[] = [];\n      const typeCounters = new Map<string, number>();\n\n      for (const { type } of orderedElements) {\n        const idx = typeCounters.get(type) || 0;\n        typeCounters.set(type, idx + 1);\n        newOrderedChildren.push({ type, index: idx });\n      }\n\n      parent._orderedChildren = newOrderedChildren;\n    } else {\n      // Fallback for when there's no _orderedChildren - just merge\n      for (const element of elementArray) {\n        if (!element || typeof element !== 'object') continue;\n\n        const elementKeys = Object.keys(element).filter(\n          (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n        );\n\n        for (const childKey of elementKeys) {\n          RevisionWalker.mergeIntoParent(parent, childKey, element[childKey]);\n        }\n      }\n    }\n  }\n\n  /**\n   * Remove all elements of a given type (including their content)\n   */\n  private static removeAllElements(parent: any, key: string): void {\n    if (!parent[key]) return;\n\n    // Update _orderedChildren before removing\n    if (parent._orderedChildren) {\n      parent._orderedChildren = parent._orderedChildren.filter(\n        (c: OrderedChildInfo) => c.type !== key\n      );\n      // Re-index remaining elements of same types\n      RevisionWalker.reindexOrderedChildren(parent._orderedChildren);\n    }\n\n    // Remove the element\n    delete parent[key];\n  }\n\n  /**\n   * Merge a child value into the parent, handling arrays properly\n   */\n  private static mergeIntoParent(parent: any, childKey: string, childValue: any): void {\n    if (parent[childKey] === undefined) {\n      // No existing value, just assign\n      parent[childKey] = childValue;\n    } else {\n      // Existing value, need to merge\n      const existing = parent[childKey];\n      const incoming = Array.isArray(childValue) ? childValue : [childValue];\n\n      if (Array.isArray(existing)) {\n        parent[childKey] = [...existing, ...incoming];\n      } else {\n        parent[childKey] = [existing, ...incoming];\n      }\n    }\n  }\n\n  /**\n   * Re-index _orderedChildren to ensure indices are sequential per type\n   */\n  private static reindexOrderedChildren(orderedChildren: OrderedChildInfo[]): void {\n    const typeCounters = new Map<string, number>();\n\n    for (const entry of orderedChildren) {\n      const currentIndex = typeCounters.get(entry.type) || 0;\n      entry.index = currentIndex;\n      typeCounters.set(entry.type, currentIndex + 1);\n    }\n  }\n\n  /**\n   * Check if an element is a revision-related element (any type)\n   */\n  static isRevisionElement(key: string): boolean {\n    return (\n      REVISION_ELEMENTS.UNWRAP.includes(key) ||\n      REVISION_ELEMENTS.REMOVE.includes(key) ||\n      REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key) ||\n      REVISION_ELEMENTS.RANGE_MARKERS.includes(key)\n    );\n  }\n\n  /**\n   * Get revision element categories (for external use/testing)\n   */\n  static getRevisionElementCategories(): typeof REVISION_ELEMENTS {\n    return { ...REVISION_ELEMENTS };\n  }\n}\n"]}
+{"version":3,"file":"RevisionWalker.js","sourceRoot":"","sources":["../../src/processors/RevisionWalker.ts"],"names":[],"mappings":";;;AA6DA,MAAM,iBAAiB,GAAG;IAExB,MAAM,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;IAG7B,MAAM,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC;IAG/B,gBAAgB,EAAE;QAChB,aAAa;QACb,aAAa;QACb,eAAe;QACf,cAAc;QACd,cAAc;QACd,gBAAgB;QAChB,iBAAiB;QACjB,mBAAmB;QACnB,iBAAiB;KAClB;IAGD,aAAa,EAAE;QACb,sBAAsB;QACtB,oBAAoB;QACpB,oBAAoB;QACpB,kBAAkB;QAClB,0BAA0B;QAC1B,wBAAwB;QACxB,0BAA0B;QAC1B,wBAAwB;QACxB,+BAA+B;QAC/B,6BAA6B;QAC7B,6BAA6B;QAC7B,2BAA2B;KAC5B;CACF,CAAC;AAeF,MAAM,oBAAoB,GAAqE;IAC7F,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE;IAC3D,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,mBAAmB,EAAE,mBAAmB,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;CACrF,CAAC;AAOF,MAAM,oBAAoB,GAA2B;IACnD,WAAW,EAAE,KAAK;IAClB,gBAAgB,EAAE,aAAa;CAChC,CAAC;AAcF,MAAa,cAAc;IAczB,MAAM,CAAC,WAAW,CAAC,GAAoB,EAAE,OAA+B;QACtE,MAAM,IAAI,GAAoC;YAC5C,IAAI,EAAE,OAAO,EAAE,IAAI,IAAI,QAAQ;YAC/B,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,IAAI,IAAI;YACnD,eAAe,EAAE,OAAO,EAAE,eAAe,IAAI,IAAI;YACjD,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,IAAI;YACzC,qBAAqB,EAAE,OAAO,EAAE,qBAAqB,IAAI,IAAI;SAC9D,CAAC;QAGF,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAG5C,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAM7C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACnD,cAAc,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC;QACnD,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO,GAAG,CAAC;QACb,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMO,MAAM,CAAC,gBAAgB,CAAC,GAAQ,EAAE,OAAwC;QAChF,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO;QACT,CAAC;QAiBD,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,OAAO,CAAC,gBAAgB,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7C,cAAc,CAAC,uBAAuB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;YACD,IAAI,OAAO,CAAC,gBAAgB,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5C,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5C,cAAc,CAAC,uBAAuB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;YACD,IAAI,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3C,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAGD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAGF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,cAAc,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;iBAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACvD,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAID,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAQO,MAAM,CAAC,gBAAgB,CAAC,GAAQ,EAAE,MAAyB;QACjE,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,WAAW,GAAG,CAAC,GAAQ,EAAW,EAAE;YACxC,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAIpD,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;YACrB,CAAC;YACD,cAAc,CAAC,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;QACtE,CAAC;aAAM,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;YACnB,cAAc,CAAC,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAcO,MAAM,CAAC,uBAAuB,CAAC,MAAW,EAAE,MAAyB;QAC3E,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAI/B,MAAM,iBAAiB,GACrB,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QACvE,MAAM,cAAc,GAAG,CAAC,GAAQ,EAAW,EAAE;YAG3C,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC/E,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC7C,OAAO,CACL,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS;gBACzB,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC,GAAG,CAAC,OAAO,CAAC;gBACb,CAAC,GAAG,CAAC,aAAa,CAAC,CACpB,CAAC;QACJ,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;YACD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO;YACtC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;YACzB,CAAC;YACD,cAAc,CAAC,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;YACvB,cAAc,CAAC,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IASO,MAAM,CAAC,uBAAuB,CACpC,MAAW,EACX,IAAY,EACZ,cAA2B;QAE3B,IAAI,CAAC,MAAM,CAAC,gBAAgB;YAAE,OAAO;QACrC,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CACtD,CAAC,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CACzE,CAAC;QACF,cAAc,CAAC,sBAAsB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;IACjE,CAAC;IAKO,MAAM,CAAC,gBAAgB,CAAC,MAAW,EAAE,OAAwC;QACnF,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC1C,OAAO;QACT,CAAC;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,QAAQ,cAAc,CAAC,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACrD,KAAK,QAAQ;oBACX,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;oBAC9C,MAAM;gBACR,KAAK,QAAQ;oBACX,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;oBAC9C,MAAM;gBACR,KAAK,SAAS;oBACZ,cAAc,CAAC,qBAAqB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;oBAClD,MAAM;gBACR,KAAK,MAAM;oBACT,MAAM;YACV,CAAC;QACH,CAAC;IACH,CAAC;IAOO,MAAM,CAAC,eAAe,CAC5B,GAAW,EACX,OAAwC;QAExC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC;QAKzC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACxD,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YAGzB,MAAM,IAAI,GACR,GAAG,KAAK,OAAO;gBACb,CAAC,CAAC,OAAO,CAAC,gBAAgB;gBAC1B,CAAC,CAAC,GAAG,KAAK,OAAO;oBACf,CAAC,CAAC,OAAO,CAAC,eAAe;oBACzB,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,OAAO,MAAM,CAAC;YACzB,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;YACjD,OAAO,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC3C,CAAC;QACD,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,OAAO,CAAC,qBAAqB;gBAAE,OAAO,MAAM,CAAC;YAIlD,IAAI,MAAM,IAAI,GAAG,KAAK,mBAAmB;gBAAE,OAAO,SAAS,CAAC;YAC5D,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,IAAI,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAeO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAIrE,MAAM,eAAe,GAAqC,EAAE,CAAC;QAE7D,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAE5B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC/C,IAAI,cAAc,GAAG,CAAC,CAAC;YAEvB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC5C,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBAEvB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAEjB,MAAM,UAAU,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC;oBAChD,cAAc,EAAE,CAAC;oBAEjB,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;wBACjD,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;4BAEhC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;4BAChD,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;gCACrD,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC;gCAClC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gCACnD,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;gCAE3C,MAAM,aAAa,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;gCAC5C,IAAI,aAAa,EAAE,CAAC;oCAClB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;oCAClF,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;wCACjC,eAAe,CAAC,IAAI,CAAC;4CACnB,IAAI,EAAE,SAAS;4CACf,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC;yCAC9B,CAAC,CAAC;oCACL,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BAEN,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;4BACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gCACjC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;gCACxC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gCACzE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;oCAC/B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gCAC3D,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBAEN,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBAEhC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBACpC,IAAI,cAAc,EAAE,CAAC;wBACnB,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;wBACtF,IAAI,GAAG,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;4BAC7B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC5D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;QAGnB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;gBAChD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;YAGD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC1B,CAAC;YACH,CAAC;YAGD,MAAM,kBAAkB,GAAuB,EAAE,CAAC;YAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,eAAe,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBAChC,kBAAkB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;QAC/C,CAAC;aAAM,CAAC;YAEN,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ;oBAAE,SAAS;gBAEtD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAC7C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;gBAEF,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;oBACnC,cAAc,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACtE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO;QAGzB,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CACtD,CAAC,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CACxC,CAAC;YAEF,cAAc,CAAC,sBAAsB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACjE,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAoBO,MAAM,CAAC,qBAAqB,CAAC,MAAW,EAAE,SAAiB;QACjE,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,SAAS;YAAE,OAAO;QACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAGrE,MAAM,WAAW,GAAG,SAAS,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,WAAW,GACf,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAK/E,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACpD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAE7E,MAAM,QAAQ,GAAG,oBAAoB,CAAC,WAAW,CAAC,CAAC;QACnD,MAAM,YAAY,GAAG,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC;QAI1C,MAAM,gBAAgB,GACpB,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ;YAC1C,CAAC,CAAC,cAAc,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC,MAAM,CACnD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CACtC;YACH,CAAC,CAAC,EAAE,CAAC;QAIT,MAAM,iBAAiB,GAAG,YAAY,CAAC,MAAM;YAC3C,CAAC,CAAC,cAAc,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,MAAM,CAC/C,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAC7D;YACH,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,WAAW,GACf,QAAQ,EAAE,QAAQ,KAAK,QAAQ;YAC7B,CAAC,CAAC,CAAC,GAAG,iBAAiB,EAAE,GAAG,gBAAgB,CAAC;YAC7C,CAAC,CAAC,CAAC,GAAG,gBAAgB,EAAE,GAAG,iBAAiB,CAAC,CAAC;QAElD,cAAc,CAAC,eAAe,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACtD,CAAC;IAQO,MAAM,CAAC,eAAe,CAAC,MAAW,EAAE,OAAyC;QACnF,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,EAAE,CAAC;gBACrE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC9C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,OAAO,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAChE,CAAC;QAED,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;YAC5B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,gBAAgB,GAAG,eAAe,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,OAAO,MAAM,CAAC,gBAAgB,CAAC;QACjC,CAAC;IACH,CAAC;IAMO,MAAM,CAAC,mBAAmB,CAAC,EAAO;QACxC,MAAM,MAAM,GAAqC,EAAE,CAAC;QACpD,MAAM,OAAO,GAAG,EAAE,CAAC,gBAAkD,CAAC;QAEtE,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC3C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBACvB,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;gBACvB,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAS;gBAClC,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACnD,IAAI,GAAG,GAAG,GAAG,CAAC,MAAM;oBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjE,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,kBAAkB;gBAAE,SAAS;YACpF,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACnD,KAAK,MAAM,OAAO,IAAI,GAAG;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IASO,MAAM,CAAC,0BAA0B,CAAC,GAAQ;QAChD,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,OAAO;QAEpD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,GAAG;gBAAE,cAAc,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC;YACxE,OAAO;QACT,CAAC;QAMD,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,oBAAoB,CAAC,CAAC;QAC/E,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,OAAO,GAAG,cAAc,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBACtE,IAAI,EAAE,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI;gBACpD,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB,CAAC,CAAC,CAAC;YACJ,cAAc,CAAC,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,kBAAkB;gBAAE,SAAS;YACpF,cAAc,CAAC,0BAA0B,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,eAAe,CAAC,MAAW,EAAE,QAAgB,EAAE,UAAe;QAC3E,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;YAEnC,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;QAChC,CAAC;aAAM,CAAC;YAEN,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAEvE,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,sBAAsB,CAAC,eAAmC;QACvE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAKD,MAAM,CAAC,iBAAiB,CAAC,GAAW;QAClC,OAAO,CACL,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC;YAChD,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAC9C,CAAC;IACJ,CAAC;IAKD,MAAM,CAAC,4BAA4B;QACjC,OAAO,EAAE,GAAG,iBAAiB,EAAE,CAAC;IAClC,CAAC;CACF;AAjqBD,wCAiqBC","sourcesContent":["/**\n * RevisionWalker - DOM-based tree walker for accepting tracked changes\n *\n * Replaces the fragile RegEx-based revision acceptance with a robust\n * DOM-based approach that properly handles nested elements and preserves\n * element ordering.\n *\n * @module RevisionWalker\n */\n\nimport { ParsedXMLObject } from '../xml/XMLParser.js';\n\n/**\n * Options for controlling which revision types to process\n */\nexport interface RevisionWalkerOptions {\n  /**\n   * Direction of processing (default: 'accept').\n   *\n   * - 'accept': keep inserted content, discard deleted content (the post-edit\n   *   document).\n   * - 'reject': discard inserted content, restore deleted content and previous\n   *   formatting (the original pre-edit document — the exact inverse of accept).\n   */\n  mode?: 'accept' | 'reject';\n  /**\n   * Process insertions. In 'accept' mode w:ins is unwrapped (content kept); in\n   * 'reject' mode w:ins is removed (content discarded). Inserted rows/tables are\n   * removed under 'reject'. (default: true)\n   */\n  acceptInsertions?: boolean;\n  /**\n   * Process deletions. In 'accept' mode w:del is removed (content discarded); in\n   * 'reject' mode w:del is unwrapped and w:delText restored to w:t. Deleted\n   * rows/tables are removed under 'accept'. (default: true)\n   */\n  acceptDeletions?: boolean;\n  /** Handle w:moveFrom/w:moveTo (default: true) */\n  acceptMoves?: boolean;\n  /**\n   * Process *Change elements. In 'accept' mode they are removed (current\n   * formatting kept); in 'reject' mode the previous formatting stored inside the\n   * change is restored. (default: true)\n   */\n  acceptPropertyChanges?: boolean;\n}\n\n/** Action to take on a revision element at a given level. */\ntype RevisionAction = 'unwrap' | 'remove' | 'restore' | 'none';\n\n/**\n * Structure for tracking element order\n */\ninterface OrderedChildInfo {\n  type: string;\n  index: number;\n}\n\n/**\n * Revision element categories\n */\nconst REVISION_ELEMENTS = {\n  /** Elements to unwrap (keep content, remove wrapper) */\n  UNWRAP: ['w:ins', 'w:moveTo'],\n\n  /** Elements to remove entirely (with content) */\n  REMOVE: ['w:del', 'w:moveFrom'],\n\n  /** Property change tracking elements */\n  PROPERTY_CHANGES: [\n    'w:rPrChange',\n    'w:pPrChange',\n    'w:tblPrChange',\n    'w:tcPrChange',\n    'w:trPrChange',\n    'w:sectPrChange',\n    'w:tblGridChange',\n    'w:numberingChange',\n    'w:tblPrExChange',\n  ],\n\n  /** Range marker elements */\n  RANGE_MARKERS: [\n    'w:moveFromRangeStart',\n    'w:moveFromRangeEnd',\n    'w:moveToRangeStart',\n    'w:moveToRangeEnd',\n    'w:customXmlInsRangeStart',\n    'w:customXmlInsRangeEnd',\n    'w:customXmlDelRangeStart',\n    'w:customXmlDelRangeEnd',\n    'w:customXmlMoveFromRangeStart',\n    'w:customXmlMoveFromRangeEnd',\n    'w:customXmlMoveToRangeStart',\n    'w:customXmlMoveToRangeEnd',\n  ],\n};\n\n/**\n * Children that are tracked independently of a property-change snapshot and\n * must be carried over (not wiped) when rejecting that change restores the\n * previous properties. Keyed by the wrapper element; `position` is where they\n * sit in the wrapper's ECMA-376 child order relative to the restored snapshot:\n *\n * - CT_PPr (§17.3.1.26): the paragraph-mark run properties (`w:rPr`) and the\n *   section properties (`w:sectPr`) follow the base paragraph properties, and a\n *   `w:pPrChange` snapshot is a CT_PPrBase that contains neither.\n * - CT_SectPr (§17.6.17): the header/footer references PRECEDE the section base\n *   contents, and a `w:sectPrChange` snapshot is a CT_SectPrBase that contains\n *   neither — so they must be prepended or the section loses its headers/footers.\n */\nconst PRESERVED_ON_RESTORE: Record<string, { keys: string[]; position: 'before' | 'after' }> = {\n  'w:pPr': { keys: ['w:rPr', 'w:sectPr'], position: 'after' },\n  'w:sectPr': { keys: ['w:headerReference', 'w:footerReference'], position: 'before' },\n};\n\n/**\n * Deleted run-content elements and the live elements they restore to when a\n * deletion is rejected (§17.3.3.7 w:delText is structurally CT_Text, identical\n * to w:t; w:delInstrText likewise mirrors w:instrText).\n */\nconst DELETED_TEXT_RENAMES: Record<string, string> = {\n  'w:delText': 'w:t',\n  'w:delInstrText': 'w:instrText',\n};\n\n/**\n * DOM-based tree walker for accepting Word document revisions\n *\n * This class processes a parsed XML object tree (from XMLParser.parseToObject())\n * and accepts all tracked changes by:\n * - Unwrapping insertions (w:ins, w:moveTo) - keeping content\n * - Removing deletions (w:del, w:moveFrom) - discarding content\n * - Removing property changes (*Change elements)\n * - Removing range markers\n *\n * Element order is preserved using the _orderedChildren metadata.\n */\nexport class RevisionWalker {\n  /**\n   * Process a parsed XML object tree and accept all revisions\n   *\n   * @param obj - Parsed XML object from XMLParser.parseToObject()\n   * @param options - Options controlling which revisions to accept\n   * @returns New object tree with revisions accepted\n   *\n   * @example\n   * ```typescript\n   * const parsed = XMLParser.parseToObject(documentXml);\n   * const clean = RevisionWalker.processTree(parsed);\n   * ```\n   */\n  static processTree(obj: ParsedXMLObject, options?: RevisionWalkerOptions): ParsedXMLObject {\n    const opts: Required<RevisionWalkerOptions> = {\n      mode: options?.mode ?? 'accept',\n      acceptInsertions: options?.acceptInsertions ?? true,\n      acceptDeletions: options?.acceptDeletions ?? true,\n      acceptMoves: options?.acceptMoves ?? true,\n      acceptPropertyChanges: options?.acceptPropertyChanges ?? true,\n    };\n\n    // Deep clone the object to avoid mutating the original\n    const clone = RevisionWalker.deepClone(obj);\n\n    // Walk and transform the tree\n    RevisionWalker.walkAndTransform(clone, opts);\n\n    // Reject restores deleted content by unwrapping w:del; the runs inside a\n    // deletion carry their text in w:delText (and field codes in\n    // w:delInstrText). Once unwrapped they are live content again, so convert\n    // those back to the normal w:t / w:instrText elements. (§17.3.3.7)\n    if (opts.mode === 'reject' && opts.acceptDeletions) {\n      RevisionWalker.convertDeletedTextToNormal(clone);\n    }\n\n    return clone;\n  }\n\n  /**\n   * Deep clone an object\n   */\n  private static deepClone(obj: any): any {\n    if (obj === null || typeof obj !== 'object') {\n      return obj;\n    }\n\n    if (Array.isArray(obj)) {\n      return obj.map((item) => RevisionWalker.deepClone(item));\n    }\n\n    const clone: any = {};\n    for (const key of Object.keys(obj)) {\n      clone[key] = RevisionWalker.deepClone(obj[key]);\n    }\n    return clone;\n  }\n\n  /**\n   * Recursively walk and transform the object tree\n   * Processes children first (depth-first) to handle nested revisions\n   */\n  private static walkAndTransform(obj: any, options: Required<RevisionWalkerOptions>): void {\n    if (obj === null || typeof obj !== 'object') {\n      return;\n    }\n\n    // Pre-recursion: row-level tracked deletions (CT_TrPr > w:del per\n    // §17.13.5.14). Must run BEFORE the depth-first recursion — otherwise\n    // processRevisions in trPr would strip the w:del marker before we can\n    // detect it at the table level. The default `w:del` removal in\n    // processRevisions only strips the marker itself, leaving a zombie\n    // empty row; per spec, accepting the deletion removes the entire row.\n    // Tables are checked from the parent first: a table whose rows are ALL\n    // tracked-deleted must be removed entirely (a row-less w:tbl violates\n    // §17.4.38's at-least-one-row requirement and Word's Accept All drops\n    // the whole table), and only the parent can remove the w:tbl itself.\n    // Reject is the mirror image: a row whose w:trPr carries a self-closing\n    // w:ins marker was added by the edit and must be removed to revert to the\n    // original (gated on acceptInsertions, since this undoes an insertion). A\n    // table whose rows are ALL insert-marked is removed entirely, mirroring the\n    // accept-side at-least-one-row handling.\n    if (options.mode === 'reject') {\n      if (options.acceptInsertions && obj['w:tbl']) {\n        RevisionWalker.removeFullyMarkedTables(obj, 'w:ins');\n      }\n      if (options.acceptInsertions && obj['w:tr']) {\n        RevisionWalker.filterMarkedRows(obj, 'w:ins');\n      }\n    } else {\n      if (options.acceptDeletions && obj['w:tbl']) {\n        RevisionWalker.removeFullyMarkedTables(obj, 'w:del');\n      }\n      if (options.acceptDeletions && obj['w:tr']) {\n        RevisionWalker.filterMarkedRows(obj, 'w:del');\n      }\n    }\n\n    // Get keys to process (excluding metadata keys)\n    const keys = Object.keys(obj).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    // First pass: recurse into children (depth-first)\n    for (const key of keys) {\n      const value = obj[key];\n      if (Array.isArray(value)) {\n        for (const item of value) {\n          RevisionWalker.walkAndTransform(item, options);\n        }\n      } else if (typeof value === 'object' && value !== null) {\n        RevisionWalker.walkAndTransform(value, options);\n      }\n    }\n\n    // Second pass: process revision elements at this level\n    // We need to iterate carefully because we're modifying the object\n    RevisionWalker.processRevisions(obj, options);\n  }\n\n  /**\n   * Remove `<w:tr>` entries whose `<w:trPr>` contains a self-closing row-level\n   * tracking marker. `marker` is `w:del` when accepting (drop deleted rows) or\n   * `w:ins` when rejecting (drop inserted rows). Operates on the parsed-object\n   * representation (arrays when multiple, single object otherwise).\n   */\n  private static filterMarkedRows(tbl: any, marker: 'w:del' | 'w:ins'): void {\n    const rows = tbl['w:tr'];\n    const isRowMarked = (row: any): boolean => {\n      if (!row || typeof row !== 'object') return false;\n      const trPr = row['w:trPr'];\n      if (!trPr || typeof trPr !== 'object') return false;\n      // The row-level marker is a CT_TrackChange (no children). When absent\n      // the parser leaves no key; when present it's a self-closing tag\n      // parsed as an object with only @_w:id/@_w:author/@_w:date keys.\n      return !!trPr[marker];\n    };\n\n    if (Array.isArray(rows)) {\n      const removedIndices = new Set<number>();\n      for (let i = 0; i < rows.length; i++) {\n        if (isRowMarked(rows[i])) removedIndices.add(i);\n      }\n      if (removedIndices.size === 0) return;\n      const kept = rows.filter((_, i) => !removedIndices.has(i));\n      if (kept.length === 0) {\n        delete tbl['w:tr'];\n      } else {\n        tbl['w:tr'] = kept;\n      }\n      RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', removedIndices);\n    } else if (isRowMarked(rows)) {\n      delete tbl['w:tr'];\n      RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', new Set([0]));\n    }\n  }\n\n  /**\n   * Remove `<w:tbl>` children whose rows are ALL marked with the given\n   * row-level tracking marker (`w:del` when accepting, `w:ins` when rejecting).\n   *\n   * Runs at the table's parent because filterMarkedRows (invoked on the table\n   * itself) has no reference back to the container holding the `w:tbl` key.\n   * Skips tables that still carry potential row containers — the wrappers that\n   * SURVIVE this direction (w:ins/w:moveTo when accepting deletions,\n   * w:del/w:moveFrom when rejecting insertions), plus w:sdt / w:customXml —\n   * since their rows only materialize as direct `w:tr` children later, when the\n   * wrappers are unwrapped during recursion.\n   */\n  private static removeFullyMarkedTables(parent: any, marker: 'w:del' | 'w:ins'): void {\n    const tables = parent['w:tbl'];\n    // Wrappers whose rows survive in this direction must not be treated as\n    // \"rowless\": accept keeps w:ins/w:moveTo content, reject keeps w:del/\n    // w:moveFrom content.\n    const survivingWrappers: string[] =\n      marker === 'w:del' ? ['w:ins', 'w:moveTo'] : ['w:del', 'w:moveFrom'];\n    const becomesRowless = (tbl: any): boolean => {\n      // Tables with no rows at all are pre-existing structures, not the\n      // result of a tracked change — leave them untouched.\n      if (!tbl || typeof tbl !== 'object' || tbl['w:tr'] === undefined) return false;\n      RevisionWalker.filterMarkedRows(tbl, marker);\n      return (\n        tbl['w:tr'] === undefined &&\n        !survivingWrappers.some((w) => tbl[w]) &&\n        !tbl['w:sdt'] &&\n        !tbl['w:customXml']\n      );\n    };\n\n    if (Array.isArray(tables)) {\n      const removedIndices = new Set<number>();\n      for (let i = 0; i < tables.length; i++) {\n        if (becomesRowless(tables[i])) removedIndices.add(i);\n      }\n      if (removedIndices.size === 0) return;\n      const kept = tables.filter((_: any, i: number) => !removedIndices.has(i));\n      if (kept.length === 0) {\n        delete parent['w:tbl'];\n      } else {\n        parent['w:tbl'] = kept;\n      }\n      RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', removedIndices);\n    } else if (becomesRowless(tables)) {\n      delete parent['w:tbl'];\n      RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', new Set([0]));\n    }\n  }\n\n  /**\n   * Drop specific {type, index} entries from `_orderedChildren` and\n   * re-index the survivors. The serializer maps each entry onto the\n   * element array by index, so stale entries left after filtering would\n   * shift surviving elements relative to inter-element siblings (e.g. a\n   * w:bookmarkEnd between table rows) or silently drop the tail.\n   */\n  private static dropOrderedChildEntries(\n    parent: any,\n    type: string,\n    removedIndices: Set<number>\n  ): void {\n    if (!parent._orderedChildren) return;\n    parent._orderedChildren = parent._orderedChildren.filter(\n      (c: OrderedChildInfo) => c.type !== type || !removedIndices.has(c.index)\n    );\n    RevisionWalker.reindexOrderedChildren(parent._orderedChildren);\n  }\n\n  /**\n   * Process revision elements at the current level\n   */\n  private static processRevisions(parent: any, options: Required<RevisionWalkerOptions>): void {\n    if (!parent || typeof parent !== 'object') {\n      return;\n    }\n\n    const keysToProcess = Object.keys(parent).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    for (const key of keysToProcess) {\n      switch (RevisionWalker.getActionForKey(key, options)) {\n        case 'unwrap':\n          RevisionWalker.unwrapAllElements(parent, key);\n          break;\n        case 'remove':\n          RevisionWalker.removeAllElements(parent, key);\n          break;\n        case 'restore':\n          RevisionWalker.restorePropertyChange(parent, key);\n          break;\n        case 'none':\n          break;\n      }\n    }\n  }\n\n  /**\n   * Resolve what to do with a revision element of the given key, honouring the\n   * processing direction. Accept and reject are exact inverses for content\n   * revisions; property changes are removed on accept and restored on reject.\n   */\n  private static getActionForKey(\n    key: string,\n    options: Required<RevisionWalkerOptions>\n  ): RevisionAction {\n    const reject = options.mode === 'reject';\n\n    // Content revisions are driven off REVISION_ELEMENTS so membership stays a\n    // single source of truth (shared with isRevisionElement). On accept, UNWRAP\n    // keeps content and REMOVE discards it; reject is the exact inverse.\n    const isUnwrap = REVISION_ELEMENTS.UNWRAP.includes(key);\n    const isRemove = REVISION_ELEMENTS.REMOVE.includes(key);\n    if (isUnwrap || isRemove) {\n      // Per-key gating: w:ins ↔ insertions, w:del ↔ deletions, w:moveTo/\n      // w:moveFrom ↔ moves.\n      const gate =\n        key === 'w:ins'\n          ? options.acceptInsertions\n          : key === 'w:del'\n            ? options.acceptDeletions\n            : options.acceptMoves;\n      if (!gate) return 'none';\n      const keepContent = reject ? isRemove : isUnwrap;\n      return keepContent ? 'unwrap' : 'remove';\n    }\n    if (REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key)) {\n      if (!options.acceptPropertyChanges) return 'none';\n      // w:numberingChange (CT_TrackChangeNumbering) is a legacy attribute-only\n      // marker with no embedded previous-properties element, so there is\n      // nothing to restore — drop it in both directions.\n      if (reject && key !== 'w:numberingChange') return 'restore';\n      return 'remove';\n    }\n    if (REVISION_ELEMENTS.RANGE_MARKERS.includes(key)) {\n      return 'remove'; // Always remove range markers\n    }\n    return 'none';\n  }\n\n  /**\n   * Unwrap all elements of a given type, promoting their children to parent\n   *\n   * This is the most complex operation in RevisionWalker. When we unwrap a\n   * revision element like w:ins, we need to:\n   * 1. Extract the children from inside w:ins\n   * 2. Insert them at the correct position in the parent's element arrays\n   * 3. Update _orderedChildren to reflect the new structure\n   *\n   * The key challenge is maintaining correct element order. For example:\n   *   Before: <w:tbl><w:tr>Row1</w:tr><w:ins><w:tr>Row2</w:tr></w:ins><w:tr>Row3</w:tr></w:tbl>\n   *   After:  <w:tbl><w:tr>Row1</w:tr><w:tr>Row2</w:tr><w:tr>Row3</w:tr></w:tbl>\n   */\n  private static unwrapAllElements(parent: any, key: string): void {\n    const elements = parent[key];\n    if (!elements) return;\n\n    const elementArray = Array.isArray(elements) ? elements : [elements];\n\n    // Build a complete ordered list of child elements by walking _orderedChildren\n    // This captures the intended order before we modify anything\n    const orderedElements: { type: string; element: any }[] = [];\n\n    if (parent._orderedChildren) {\n      // Track how many of each type we've seen to get correct array index\n      const typeCounters = new Map<string, number>();\n      let unwrappedIndex = 0;\n\n      for (const entry of parent._orderedChildren) {\n        const { type } = entry;\n\n        if (type === key) {\n          // This is a revision element - extract its children in order\n          const revElement = elementArray[unwrappedIndex];\n          unwrappedIndex++;\n\n          if (revElement && typeof revElement === 'object') {\n            if (revElement._orderedChildren) {\n              // Use the revision element's _orderedChildren for correct order\n              const childCounters = new Map<string, number>();\n              for (const childEntry of revElement._orderedChildren) {\n                const childType = childEntry.type;\n                const childIdx = childCounters.get(childType) || 0;\n                childCounters.set(childType, childIdx + 1);\n\n                const childElements = revElement[childType];\n                if (childElements) {\n                  const childArray = Array.isArray(childElements) ? childElements : [childElements];\n                  if (childIdx < childArray.length) {\n                    orderedElements.push({\n                      type: childType,\n                      element: childArray[childIdx],\n                    });\n                  }\n                }\n              }\n            } else {\n              // No _orderedChildren, extract children in object key order\n              const childKeys = Object.keys(revElement).filter(\n                (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n              );\n              for (const childKey of childKeys) {\n                const childValue = revElement[childKey];\n                const childArray = Array.isArray(childValue) ? childValue : [childValue];\n                for (const child of childArray) {\n                  orderedElements.push({ type: childKey, element: child });\n                }\n              }\n            }\n          }\n        } else {\n          // Regular element - get it from the parent\n          const idx = typeCounters.get(type) || 0;\n          typeCounters.set(type, idx + 1);\n\n          const parentElements = parent[type];\n          if (parentElements) {\n            const parentArray = Array.isArray(parentElements) ? parentElements : [parentElements];\n            if (idx < parentArray.length) {\n              orderedElements.push({ type, element: parentArray[idx] });\n            }\n          }\n        }\n      }\n    }\n\n    // Remove the revision wrapper\n    delete parent[key];\n\n    // If we have ordered elements, rebuild the arrays in correct order\n    if (orderedElements.length > 0) {\n      // Group elements by type\n      const rebuiltArrays = new Map<string, any[]>();\n\n      for (const { type, element } of orderedElements) {\n        if (!rebuiltArrays.has(type)) {\n          rebuiltArrays.set(type, []);\n        }\n        rebuiltArrays.get(type)!.push(element);\n      }\n\n      // Update parent with rebuilt arrays\n      for (const [type, elements] of rebuiltArrays) {\n        if (elements.length === 1) {\n          parent[type] = elements[0];\n        } else {\n          parent[type] = elements;\n        }\n      }\n\n      // Rebuild _orderedChildren\n      const newOrderedChildren: OrderedChildInfo[] = [];\n      const typeCounters = new Map<string, number>();\n\n      for (const { type } of orderedElements) {\n        const idx = typeCounters.get(type) || 0;\n        typeCounters.set(type, idx + 1);\n        newOrderedChildren.push({ type, index: idx });\n      }\n\n      parent._orderedChildren = newOrderedChildren;\n    } else {\n      // Fallback for when there's no _orderedChildren - just merge\n      for (const element of elementArray) {\n        if (!element || typeof element !== 'object') continue;\n\n        const elementKeys = Object.keys(element).filter(\n          (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n        );\n\n        for (const childKey of elementKeys) {\n          RevisionWalker.mergeIntoParent(parent, childKey, element[childKey]);\n        }\n      }\n    }\n  }\n\n  /**\n   * Remove all elements of a given type (including their content)\n   */\n  private static removeAllElements(parent: any, key: string): void {\n    if (!parent[key]) return;\n\n    // Update _orderedChildren before removing\n    if (parent._orderedChildren) {\n      parent._orderedChildren = parent._orderedChildren.filter(\n        (c: OrderedChildInfo) => c.type !== key\n      );\n      // Re-index remaining elements of same types\n      RevisionWalker.reindexOrderedChildren(parent._orderedChildren);\n    }\n\n    // Remove the element\n    delete parent[key];\n  }\n\n  /**\n   * Restore the previous formatting recorded by a property-change element\n   * (reject direction). A change such as `w:rPrChange` lives inside the\n   * properties wrapper it tracks (`w:rPr`) and embeds the complete previous\n   * wrapper as a child:\n   *\n   *   <w:rPr><w:b/><w:rPrChange><w:rPr><w:i/></w:rPr></w:rPrChange></w:rPr>\n   *\n   * Rejecting it replaces the current direct formatting (`w:b`) with the\n   * embedded previous formatting (`w:i`) and drops the change marker. Children\n   * that are tracked independently of the snapshot — e.g. a paragraph's mark\n   * run properties / section properties, or a section's header/footer\n   * references (see {@link PRESERVED_ON_RESTORE}) — are carried over from the\n   * current wrapper in their correct schema position rather than discarded.\n   *\n   * @param parent - the properties wrapper containing the change element\n   * @param changeKey - the change element key, e.g. 'w:rPrChange'\n   */\n  private static restorePropertyChange(parent: any, changeKey: string): void {\n    const changeRaw = parent[changeKey];\n    if (!changeRaw) return;\n    const changeEl = Array.isArray(changeRaw) ? changeRaw[0] : changeRaw;\n\n    // 'w:rPrChange' -> 'w:rPr', 'w:tblGridChange' -> 'w:tblGrid', etc.\n    const previousKey = changeKey.replace(/Change$/, '');\n    const previousRaw =\n      changeEl && typeof changeEl === 'object' ? changeEl[previousKey] : undefined;\n\n    // Malformed change with no embedded previous-properties snapshot: there is\n    // nothing to restore, so drop just the marker and leave the current\n    // formatting intact rather than emptying the wrapper.\n    if (previousRaw === undefined) {\n      RevisionWalker.removeAllElements(parent, changeKey);\n      return;\n    }\n    const previousEl = Array.isArray(previousRaw) ? previousRaw[0] : previousRaw;\n\n    const preserve = PRESERVED_ON_RESTORE[previousKey];\n    const preserveKeys = preserve?.keys ?? [];\n\n    // Snapshot children become the restored formatting (minus any preserved\n    // keys it might redundantly carry).\n    const snapshotChildren =\n      previousEl && typeof previousEl === 'object'\n        ? RevisionWalker.getOrderedChildList(previousEl).filter(\n            (c) => !preserveKeys.includes(c.type)\n          )\n        : [];\n\n    // Preserved children are read from the CURRENT wrapper in their existing\n    // document order (captured before the wrapper is cleared below).\n    const preservedChildren = preserveKeys.length\n      ? RevisionWalker.getOrderedChildList(parent).filter(\n          (c) => preserveKeys.includes(c.type) && c.type !== changeKey\n        )\n      : [];\n\n    const newChildren =\n      preserve?.position === 'before'\n        ? [...preservedChildren, ...snapshotChildren]\n        : [...snapshotChildren, ...preservedChildren];\n\n    RevisionWalker.rebuildChildren(parent, newChildren);\n  }\n\n  /**\n   * Replace all non-metadata children of `parent` with the supplied ordered\n   * `{type, element}` list, regrouping per-type arrays and rebuilding\n   * `_orderedChildren` so the serializer emits them in the given order.\n   * Attributes (`@_*`) and `#text` are left untouched.\n   */\n  private static rebuildChildren(parent: any, ordered: { type: string; element: any }[]): void {\n    for (const k of Object.keys(parent)) {\n      if (!k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren') {\n        delete parent[k];\n      }\n    }\n\n    const grouped = new Map<string, any[]>();\n    for (const { type, element } of ordered) {\n      if (!grouped.has(type)) grouped.set(type, []);\n      grouped.get(type)!.push(element);\n    }\n    for (const [type, elements] of grouped) {\n      parent[type] = elements.length === 1 ? elements[0] : elements;\n    }\n\n    const orderedChildren: OrderedChildInfo[] = [];\n    const counters = new Map<string, number>();\n    for (const { type } of ordered) {\n      const idx = counters.get(type) || 0;\n      counters.set(type, idx + 1);\n      orderedChildren.push({ type, index: idx });\n    }\n    if (orderedChildren.length > 0) {\n      parent._orderedChildren = orderedChildren;\n    } else {\n      delete parent._orderedChildren;\n    }\n  }\n\n  /**\n   * Flatten an element's children into an ordered `{type, element}` list,\n   * honouring `_orderedChildren` when present and falling back to key order.\n   */\n  private static getOrderedChildList(el: any): { type: string; element: any }[] {\n    const result: { type: string; element: any }[] = [];\n    const ordered = el._orderedChildren as OrderedChildInfo[] | undefined;\n\n    if (Array.isArray(ordered) && ordered.length > 0) {\n      const counters = new Map<string, number>();\n      for (const entry of ordered) {\n        const { type } = entry;\n        const idx = counters.get(type) || 0;\n        counters.set(type, idx + 1);\n        const value = el[type];\n        if (value === undefined) continue;\n        const arr = Array.isArray(value) ? value : [value];\n        if (idx < arr.length) result.push({ type, element: arr[idx] });\n      }\n      return result;\n    }\n\n    for (const key of Object.keys(el)) {\n      if (key.startsWith('@_') || key === '#text' || key === '_orderedChildren') continue;\n      const value = el[key];\n      const arr = Array.isArray(value) ? value : [value];\n      for (const element of arr) result.push({ type: key, element });\n    }\n    return result;\n  }\n\n  /**\n   * Convert restored deleted text back to live text throughout the tree\n   * (reject direction). After w:del unwrapping, the runs that were deleted\n   * still hold their text in w:delText / w:delInstrText; rename those to the\n   * normal w:t / w:instrText so the content is real again, fixing any\n   * `_orderedChildren` type references as we go.\n   */\n  private static convertDeletedTextToNormal(obj: any): void {\n    if (obj === null || typeof obj !== 'object') return;\n\n    if (Array.isArray(obj)) {\n      for (const item of obj) RevisionWalker.convertDeletedTextToNormal(item);\n      return;\n    }\n\n    // When this node carries any deleted-text element, rebuild its children\n    // from the document-ordered list with the deleted-text keys renamed. Going\n    // through the ordered list keeps text in its original position even if a\n    // run holds both a w:delText and a live w:t (CT_R permits interleaving).\n    const hasDeletedText = Object.keys(obj).some((k) => k in DELETED_TEXT_RENAMES);\n    if (hasDeletedText) {\n      const ordered = RevisionWalker.getOrderedChildList(obj).map((child) => ({\n        type: DELETED_TEXT_RENAMES[child.type] ?? child.type,\n        element: child.element,\n      }));\n      RevisionWalker.rebuildChildren(obj, ordered);\n    }\n\n    for (const key of Object.keys(obj)) {\n      if (key.startsWith('@_') || key === '#text' || key === '_orderedChildren') continue;\n      RevisionWalker.convertDeletedTextToNormal(obj[key]);\n    }\n  }\n\n  /**\n   * Merge a child value into the parent, handling arrays properly\n   */\n  private static mergeIntoParent(parent: any, childKey: string, childValue: any): void {\n    if (parent[childKey] === undefined) {\n      // No existing value, just assign\n      parent[childKey] = childValue;\n    } else {\n      // Existing value, need to merge\n      const existing = parent[childKey];\n      const incoming = Array.isArray(childValue) ? childValue : [childValue];\n\n      if (Array.isArray(existing)) {\n        parent[childKey] = [...existing, ...incoming];\n      } else {\n        parent[childKey] = [existing, ...incoming];\n      }\n    }\n  }\n\n  /**\n   * Re-index _orderedChildren to ensure indices are sequential per type\n   */\n  private static reindexOrderedChildren(orderedChildren: OrderedChildInfo[]): void {\n    const typeCounters = new Map<string, number>();\n\n    for (const entry of orderedChildren) {\n      const currentIndex = typeCounters.get(entry.type) || 0;\n      entry.index = currentIndex;\n      typeCounters.set(entry.type, currentIndex + 1);\n    }\n  }\n\n  /**\n   * Check if an element is a revision-related element (any type)\n   */\n  static isRevisionElement(key: string): boolean {\n    return (\n      REVISION_ELEMENTS.UNWRAP.includes(key) ||\n      REVISION_ELEMENTS.REMOVE.includes(key) ||\n      REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key) ||\n      REVISION_ELEMENTS.RANGE_MARKERS.includes(key)\n    );\n  }\n\n  /**\n   * Get revision element categories (for external use/testing)\n   */\n  static getRevisionElementCategories(): typeof REVISION_ELEMENTS {\n    return { ...REVISION_ELEMENTS };\n  }\n}\n"]}

package/dist/processors/SelectiveRevisionAcceptor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SelectiveRevisionAcceptor.d.ts","sourceRoot":"","sources":["../../src/processors/SelectiveRevisionAcceptor.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAEpD,OAAO,EAAY,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAIjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAKhE,MAAM,WAAW,qBAAqB;IAEpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,SAAS,EAAE,MAAM,EAAE,CAAC;IAEpB,OAAO,EAAE;QACP,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC;CACH;AAMD,qBAAa,yBAAyB;IAUpC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA4DhF,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA0DhF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAiFhC,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAmExC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IA8CpC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAmDjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAwDjC,MAAM,CAAC,OAAO,CACZ,GAAG,EAAE,QAAQ,EACb,QAAQ,EAAE,iBAAiB,EAC3B,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAC1B,qBAAqB;IAYxB,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,gBAAgB,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAazE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAYxE,MAAM,CAAC,oBAAoB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUjE,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUhE,MAAM,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUpE,MAAM,CAAC,wBAAwB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAOrE,OAAO,CAAC,MAAM,CAAC,eAAe;IAuD9B,OAAO,CAAC,MAAM,CAAC,mBAAmB;CA8BnC"}
+{"version":3,"file":"SelectiveRevisionAcceptor.d.ts","sourceRoot":"","sources":["../../src/processors/SelectiveRevisionAcceptor.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAEpD,OAAO,EAAY,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAIjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAMhE,MAAM,WAAW,qBAAqB;IAEpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,SAAS,EAAE,MAAM,EAAE,CAAC;IAEpB,OAAO,EAAE;QACP,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC;CACH;AAMD,qBAAa,yBAAyB;IAUpC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA0EhF,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA0DhF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAiFhC,OAAO,CAAC,MAAM,CAAC,yBAAyB;IA4ExC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IA8CpC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAwDjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAsGjC,MAAM,CAAC,OAAO,CACZ,GAAG,EAAE,QAAQ,EACb,QAAQ,EAAE,iBAAiB,EAC3B,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAC1B,qBAAqB;IAyExB,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,gBAAgB,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAazE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAYxE,MAAM,CAAC,oBAAoB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUjE,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUhE,MAAM,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUpE,MAAM,CAAC,wBAAwB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAOrE,OAAO,CAAC,MAAM,CAAC,eAAe;IAuD9B,OAAO,CAAC,MAAM,CAAC,mBAAmB;CA8BnC"}