@usejunior/odf-core 0.9.1

package/dist/compare/diff.js

@@ -0,0 +1,189 @@
+/**
+ * Pure paragraph-level diff for ODF comparison (Slice 1).
+ *
+ * A language-agnostic O(N·M) LCS over two arrays of paragraph visible-text strings, returning a
+ * structured edit script in standard diff order. No DOM — this mirrors docx-core's `atomLcs.ts`
+ * (kept separate from emission so it is testable in isolation).
+ *
+ * Order convention: a paragraph "replaced" in place (text differs at a matched slot) surfaces as
+ * a `delete` of the original immediately followed by an `insert` of the revised, because at a
+ * mismatch we prefer the deletion branch. The emitter relies on this delete-before-insert order
+ * when both anchor at the same position.
+ */
+/**
+ * Diff two paragraph-text arrays into an ordered edit script.
+ * `equal` ops carry both indices; `insert` carries the revised index; `delete` the original index.
+ */
+export function diffParagraphs(original, revised) {
+    const n = original.length;
+    const m = revised.length;
+    // dp[i][j] = LCS length of original[i..] and revised[j..].
+    const dp = Array.from({ length: n + 1 }, () => new Array(m + 1).fill(0));
+    for (let i = n - 1; i >= 0; i--) {
+        for (let j = m - 1; j >= 0; j--) {
+            dp[i][j] =
+                original[i] === revised[j]
+                    ? dp[i + 1][j + 1] + 1
+                    : Math.max(dp[i + 1][j], dp[i][j + 1]);
+        }
+    }
+    const ops = [];
+    let i = 0;
+    let j = 0;
+    while (i < n && j < m) {
+        if (original[i] === revised[j]) {
+            ops.push({ kind: 'equal', originalIndex: i, revisedIndex: j });
+            i++;
+            j++;
+        }
+        else if (dp[i + 1][j] >= dp[i][j + 1]) {
+            // Prefer deletion at a tie so a replace surfaces as delete-then-insert.
+            ops.push({ kind: 'delete', originalIndex: i });
+            i++;
+        }
+        else {
+            ops.push({ kind: 'insert', revisedIndex: j });
+            j++;
+        }
+    }
+    while (i < n)
+        ops.push({ kind: 'delete', originalIndex: i++ });
+    while (j < m)
+        ops.push({ kind: 'insert', revisedIndex: j++ });
+    return ops;
+}
+/**
+ * Below this Jaccard word-overlap, an aligned delete/insert pair is a replacement, not an
+ * in-place edit. Matches docx-core's `DEFAULT_PARAGRAPH_SIMILARITY_THRESHOLD` reference point.
+ */
+export const DEFAULT_ODF_SIMILARITY_THRESHOLD = 0.25;
+/** Normalized word set for similarity: lowercase, punctuation stripped, whitespace collapsed. */
+function similarityWords(text) {
+    return new Set(text
+        .replace(/[^\w\s]/g, ' ')
+        .toLowerCase()
+        .split(/\s+/)
+        .filter((w) => w.length > 0));
+}
+/** Jaccard word overlap; 0 when either side has no words (empty paragraphs never pair). */
+function jaccard(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const w of a)
+        if (b.has(w))
+            intersection++;
+    return intersection / (a.size + b.size - intersection);
+}
+/**
+ * Post-pass over a `diffParagraphs` script: inside each gap (a run of deletes followed by a run
+ * of inserts between two anchors — the order `diffParagraphs`'s tie-break guarantees), convert
+ * similar delete/insert pairs into `modify` ops.
+ *
+ * Pairing is an order-constrained DP, deterministic by construction: maximize the pair count,
+ * then the total Jaccard similarity; a pair is admissible only when similarity ≥
+ * `similarityThreshold`. At ties, pairing beats skipping, and skipping a delete beats skipping
+ * an insert (keeps the delete-first convention). Output preserves merged document order:
+ * between pairs, unpaired deletes precede unpaired inserts, exactly as Slice 1 emitted them.
+ */
+export function pairModifications(ops, original, revised, similarityThreshold = DEFAULT_ODF_SIMILARITY_THRESHOLD) {
+    const out = [];
+    let gapDeletes = [];
+    let gapInserts = [];
+    const flushGap = () => {
+        if (gapDeletes.length === 0 || gapInserts.length === 0) {
+            for (const d of gapDeletes)
+                out.push({ kind: 'delete', originalIndex: d });
+            for (const ins of gapInserts)
+                out.push({ kind: 'insert', revisedIndex: ins });
+            gapDeletes = [];
+            gapInserts = [];
+            return;
+        }
+        const delWords = gapDeletes.map((d) => similarityWords(original[d] ?? ''));
+        const insWords = gapInserts.map((ins) => similarityWords(revised[ins] ?? ''));
+        const sim = (a, b) => jaccard(delWords[a], insWords[b]);
+        // dp[a][b] = best (pairCount, simSum) over gapDeletes[a..] × gapInserts[b..].
+        const d = gapDeletes.length;
+        const m2 = gapInserts.length;
+        const count = Array.from({ length: d + 1 }, () => new Array(m2 + 1).fill(0));
+        const sum = Array.from({ length: d + 1 }, () => new Array(m2 + 1).fill(0));
+        for (let a = d - 1; a >= 0; a--) {
+            for (let b = m2 - 1; b >= 0; b--) {
+                let bestCount = count[a + 1][b];
+                let bestSum = sum[a + 1][b];
+                if (count[a][b + 1] > bestCount || (count[a][b + 1] === bestCount && sum[a][b + 1] > bestSum)) {
+                    bestCount = count[a][b + 1];
+                    bestSum = sum[a][b + 1];
+                }
+                const s = sim(a, b);
+                if (s >= similarityThreshold) {
+                    const pairCount = count[a + 1][b + 1] + 1;
+                    const pairSum = sum[a + 1][b + 1] + s;
+                    if (pairCount > bestCount || (pairCount === bestCount && pairSum > bestSum)) {
+                        bestCount = pairCount;
+                        bestSum = pairSum;
+                    }
+                }
+                count[a][b] = bestCount;
+                sum[a][b] = bestSum;
+            }
+        }
+        // Backtrack with the stated preference order: pair > skip-delete > skip-insert. Skipped ops
+        // buffer until the next pair (or the end) so each segment emits deletes-then-inserts, the
+        // same per-gap order Slice 1 produced.
+        let a = 0;
+        let b = 0;
+        let pendingDeletes = [];
+        let pendingInserts = [];
+        const flushPending = () => {
+            for (const pd of pendingDeletes)
+                out.push({ kind: 'delete', originalIndex: pd });
+            for (const pi of pendingInserts)
+                out.push({ kind: 'insert', revisedIndex: pi });
+            pendingDeletes = [];
+            pendingInserts = [];
+        };
+        while (a < d && b < m2) {
+            const s = sim(a, b);
+            const pairCount = s >= similarityThreshold ? count[a + 1][b + 1] + 1 : -1;
+            const pairSum = s >= similarityThreshold ? sum[a + 1][b + 1] + s : 0;
+            if (pairCount === count[a][b] && pairSum === sum[a][b]) {
+                flushPending();
+                out.push({ kind: 'modify', originalIndex: gapDeletes[a], revisedIndex: gapInserts[b] });
+                a++;
+                b++;
+            }
+            else if (count[a + 1][b] === count[a][b] && sum[a + 1][b] === sum[a][b]) {
+                pendingDeletes.push(gapDeletes[a]);
+                a++;
+            }
+            else {
+                pendingInserts.push(gapInserts[b]);
+                b++;
+            }
+        }
+        while (a < d)
+            pendingDeletes.push(gapDeletes[a++]);
+        while (b < m2)
+            pendingInserts.push(gapInserts[b++]);
+        flushPending();
+        gapDeletes = [];
+        gapInserts = [];
+    };
+    for (const op of ops) {
+        if (op.kind === 'delete') {
+            gapDeletes.push(op.originalIndex);
+        }
+        else if (op.kind === 'insert') {
+            gapInserts.push(op.revisedIndex);
+        }
+        else {
+            flushGap();
+            out.push(op);
+        }
+    }
+    flushGap();
+    return out;
+}
+//# sourceMappingURL=diff.js.map

package/dist/compare/diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/compare/diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AASH;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,QAAkB,EAAE,OAAiB;IAClE,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IAEzB,2DAA2D;IAC3D,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBACP,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC;oBACxB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC;oBACxB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/D,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,IAAI,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC;YAC5C,wEAAwE;YACxE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/D,OAAO,CAAC,GAAG,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IAC9D,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,IAAI,CAAC;AAErD,iGAAiG;AACjG,SAAS,eAAe,CAAC,IAAY;IACnC,OAAO,IAAI,GAAG,CACZ,IAAI;SACD,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,WAAW,EAAE;SACb,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED,2FAA2F;AAC3F,SAAS,OAAO,CAAC,CAAc,EAAE,CAAc;IAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IAChD,OAAO,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,GAAa,EACb,QAAkB,EAClB,OAAiB,EACjB,sBAA8B,gCAAgC;IAE9D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,UAAU,GAAa,EAAE,CAAC;IAC9B,IAAI,UAAU,GAAa,EAAE,CAAC;IAE9B,MAAM,QAAQ,GAAG,GAAS,EAAE;QAC1B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvD,KAAK,MAAM,CAAC,IAAI,UAAU;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,KAAK,MAAM,GAAG,IAAI,UAAU;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9E,UAAU,GAAG,EAAE,CAAC;YAChB,UAAU,GAAG,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3E,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9E,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QAElF,8EAA8E;QAC9E,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;QAC5B,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC;QAC7B,MAAM,KAAK,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjG,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;gBAClC,IAAI,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;gBAC9B,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,SAAS,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,KAAK,SAAS,IAAI,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,OAAO,CAAC,EAAE,CAAC;oBACpG,SAAS,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;oBAC9B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;gBAC5B,CAAC;gBACD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,IAAI,mBAAmB,EAAE,CAAC;oBAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC;oBAC5C,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC;oBACxC,IAAI,SAAS,GAAG,SAAS,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,OAAO,GAAG,OAAO,CAAC,EAAE,CAAC;wBAC5E,SAAS,GAAG,SAAS,CAAC;wBACtB,OAAO,GAAG,OAAO,CAAC;oBACpB,CAAC;gBACH,CAAC;gBACD,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBACzB,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YACvB,CAAC;QACH,CAAC;QAED,4FAA4F;QAC5F,0FAA0F;QAC1F,uCAAuC;QACvC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,cAAc,GAAa,EAAE,CAAC;QAClC,IAAI,cAAc,GAAa,EAAE,CAAC;QAClC,MAAM,YAAY,GAAG,GAAS,EAAE;YAC9B,KAAK,MAAM,EAAE,IAAI,cAAc;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC;YACjF,KAAK,MAAM,EAAE,IAAI,cAAc;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC;YAChF,cAAc,GAAG,EAAE,CAAC;YACpB,cAAc,GAAG,EAAE,CAAC;QACtB,CAAC,CAAC;QACF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,SAAS,GAAG,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,MAAM,OAAO,GAAG,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,SAAS,KAAK,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,IAAI,OAAO,KAAK,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,EAAE,CAAC;gBAC3D,YAAY,EAAE,CAAC;gBACf,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC,CAAE,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC;gBAC1F,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,KAAK,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,KAAK,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,EAAE,CAAC;gBAClF,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC;gBACpC,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,CAAC;gBACN,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC;gBACpC,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,CAAC;YAAE,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;QACpD,OAAO,CAAC,GAAG,EAAE;YAAE,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;QACrD,YAAY,EAAE,CAAC;QACf,UAAU,GAAG,EAAE,CAAC;QAChB,UAAU,GAAG,EAAE,CAAC;IAClB,CAAC,CAAC;IAEF,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC;QACpC,CAAC;aAAM,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAChC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,QAAQ,EAAE,CAAC;YACX,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IACD,QAAQ,EAAE,CAAC;IACX,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/compare/emit.d.ts

@@ -0,0 +1,64 @@
+/**
+ * ODF tracked-changes emitter: paragraph-granularity (Slice 1) + intra-paragraph modify pairs
+ * (issue #356).
+ *
+ * Mutates the REVISED `content.xml` DOM in place, adding a `text:tracked-changes` container (first
+ * child of `office:text`) plus the lightweight in-body markers that reference it. The exact markup
+ * shapes were confirmed by driving LibreOffice to author each change and inspecting its output
+ * (see the `add-odf-compare` and `add-odf-intra-paragraph-compare` design notes):
+ *
+ *  - Insertion: `text:change-start` / `text:change-end` brackets the inserted run, referencing a
+ *    `text:insertion` region; inserted content stays inline. Forward (a following kept paragraph
+ *    exists): start at the inserted run's first paragraph, end at the following paragraph's start.
+ *    End-of-document: start at the preceding paragraph's end, end at the inserted run's last
+ *    paragraph's end.
+ *  - Deletion (paragraph-break merge): the deleted paragraphs live out-of-line in a `text:deletion`
+ *    region; an inline `text:change` point marker sits in the nearest SURVIVING paragraph — at the
+ *    start of the following one (forward) or the end of the preceding one (backward, for a run
+ *    reaching end-of-document). Consecutive deletions coalesce into ONE region with all deleted
+ *    paragraphs plus one empty merge-artifact paragraph (artifact last for forward, first for
+ *    backward). `text:change` is inline and is never a direct block child of `office:text`.
+ *  - Modify pair (intra-paragraph): the revised paragraph stays in place. An inserted span keeps
+ *    its content inline bracketed by `text:change-start`/`text:change-end`; a deleted span leaves
+ *    one `text:change` point marker and its content is stored out-of-line in a `text:deletion`
+ *    region holding ONE block mirroring the host (`text:p`/`text:h` + style/outline-level) — no
+ *    merge-artifact paragraph (no paragraph break died). A replace orders the insertion bracket
+ *    first and the deletion point after its `text:change-end` (LibreOffice's authored order); at
+ *    one offset the document order is `change-end`, `change`, `change-start`. A pair whose spans
+ *    cannot be mapped degrades to the Slice-1 whole-paragraph delete+insert, decided before any
+ *    markup is written.
+ *  - A run with no surviving paragraph to anchor to (every paragraph deleted) fails closed.
+ *
+ * All element creation/matching is by `namespaceURI` + `localName` (ODF prefixes are not guaranteed).
+ */
+import type { EditOp } from './diff.js';
+export type EmitParams = {
+    /** The revised `content.xml` DOM; mutated in place. */
+    revisedDoc: Document;
+    /** Revised body paragraphs in document order (excludes `text:tracked-changes`). */
+    revisedBlocks: Element[];
+    /** Original body paragraphs in document order (source of deleted content). */
+    originalBlocks: Element[];
+    /** The edit script from `diffParagraphs(original, revised)`. */
+    ops: EditOp[];
+    /** Change author for `dc:creator`. */
+    author: string;
+    /** Change date for `dc:date` (ODF 8601, no fractional seconds). */
+    date: string;
+};
+export declare class OdfEmitError extends Error {
+}
+/** Per-emission accounting so reported stats always match the emitted markup. */
+export type EmitResult = {
+    /** Modify pairs that survived as inline markup. */
+    modifications: number;
+    /** Modify pairs that fell back to whole-paragraph delete+insert. */
+    degradedModifications: number;
+    /** Inserted spans inside surviving modify pairs (one `text:insertion` region each). */
+    inlineInsertions: number;
+    /** Deleted spans inside surviving modify pairs (one `text:deletion` region each). */
+    inlineDeletions: number;
+};
+/** Apply the tracked-changes markup for `ops` to `revisedDoc`. */
+export declare function emitTrackedChanges(params: EmitParams): EmitResult;
+//# sourceMappingURL=emit.d.ts.map

package/dist/compare/emit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"emit.d.ts","sourceRoot":"","sources":["../../src/compare/emit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAIH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAIxC,MAAM,MAAM,UAAU,GAAG;IACvB,uDAAuD;IACvD,UAAU,EAAE,QAAQ,CAAC;IACrB,mFAAmF;IACnF,aAAa,EAAE,OAAO,EAAE,CAAC;IACzB,8EAA8E;IAC9E,cAAc,EAAE,OAAO,EAAE,CAAC;IAC1B,gEAAgE;IAChE,GAAG,EAAE,MAAM,EAAE,CAAC;IACd,sCAAsC;IACtC,MAAM,EAAE,MAAM,CAAC;IACf,mEAAmE;IACnE,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF,qBAAa,YAAa,SAAQ,KAAK;CAAG;AAE1C,iFAAiF;AACjF,MAAM,MAAM,UAAU,GAAG;IACvB,mDAAmD;IACnD,aAAa,EAAE,MAAM,CAAC;IACtB,oEAAoE;IACpE,qBAAqB,EAAE,MAAM,CAAC;IAC9B,uFAAuF;IACvF,gBAAgB,EAAE,MAAM,CAAC;IACzB,qFAAqF;IACrF,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AAyBF,kEAAkE;AAClE,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,CAuKjE"}