@usejunior/docx-core 0.3.0 → 0.3.1

package/dist/baselines/diffmatch/documentBuilder.js

@@ -1,227 +0,0 @@
-/**
- * Document builder for reconstructing DOCX with track changes.
- *
- * Takes alignment results and produces a new document.xml with
- * insertions and deletions marked using OOXML track changes.
- */
-import { diffRuns } from './runDiff.js';
-import { renderTrackChanges, generateDeletedParagraph, generateInsertedParagraph, wrapInParagraph, } from './trackChangesRenderer.js';
-import { extractSectPr } from './xmlParser.js';
-/**
- * Generate paragraph operations from alignment result.
- *
- * This converts the alignment result into a list of XML paragraph operations
- * that can be used to build the output document.
- */
-export function generateParagraphOperations(alignment, originalParagraphs, revisedParagraphs, options) {
-    const operations = [];
-    const { author, date } = options;
-    // Build lookup maps for original paragraphs by index
-    const originalByIndex = new Map();
-    for (const p of originalParagraphs) {
-        originalByIndex.set(p.originalIndex, p);
-    }
-    // Build lookup maps for revised paragraphs by index
-    const revisedByIndex = new Map();
-    for (const p of revisedParagraphs) {
-        revisedByIndex.set(p.originalIndex, p);
-    }
-    // Track which original paragraphs have been matched
-    const matchedOriginalIndices = new Set();
-    const matchedRevisedIndices = new Set();
-    // Build a map from revised index to the matching original paragraph
-    const revisedToOriginal = new Map();
-    for (const match of alignment.matched) {
-        const origPara = match.original;
-        const revPara = match.revised;
-        matchedOriginalIndices.add(origPara.originalIndex);
-        matchedRevisedIndices.add(revPara.originalIndex);
-        revisedToOriginal.set(revPara.originalIndex, origPara);
-    }
-    // Build output in revised document order
-    // For each position in the revised document, we output:
-    // 1. Any deleted paragraphs that came before the matching original
-    // 2. The matched/inserted paragraph
-    let lastOriginalIndex = -1;
-    for (let revIdx = 0; revIdx < revisedParagraphs.length; revIdx++) {
-        const revPara = revisedParagraphs[revIdx];
-        if (matchedRevisedIndices.has(revIdx)) {
-            // This is a matched paragraph
-            const origPara = revisedToOriginal.get(revIdx);
-            // First, output any deleted paragraphs between last and this
-            for (let i = lastOriginalIndex + 1; i < origPara.originalIndex; i++) {
-                if (!matchedOriginalIndices.has(i)) {
-                    const deletedPara = originalByIndex.get(i);
-                    if (deletedPara) {
-                        operations.push({
-                            type: 'deleted',
-                            xml: generateDeletedParagraph(deletedPara.runs, author, date, extractPPrContent(deletedPara.pPrXml)),
-                            originalIndex: i,
-                        });
-                    }
-                }
-            }
-            // Check if paragraphs are identical or modified
-            const similarity = alignment.matched.find(m => m.revised.originalIndex === revIdx)?.similarity ?? 0;
-            if (similarity >= 0.9999) {
-                // Unchanged paragraph - use revised content as-is
-                operations.push({
-                    type: 'unchanged',
-                    xml: generateParagraphXml(revPara),
-                    originalIndex: origPara.originalIndex,
-                    revisedIndex: revIdx,
-                });
-            }
-            else {
-                // Modified paragraph - diff the runs
-                const diffResult = diffRuns(origPara.runs, revPara.runs);
-                const trackChangesContent = renderTrackChanges(diffResult.mergedRuns, {
-                    author,
-                    date,
-                });
-                operations.push({
-                    type: 'modified',
-                    xml: wrapInParagraph(trackChangesContent, extractPPrContent(revPara.pPrXml)),
-                    originalIndex: origPara.originalIndex,
-                    revisedIndex: revIdx,
-                });
-            }
-            lastOriginalIndex = origPara.originalIndex;
-        }
-        else {
-            // This is an inserted paragraph
-            operations.push({
-                type: 'inserted',
-                xml: generateInsertedParagraph(revPara.runs, author, date, extractPPrContent(revPara.pPrXml)),
-                revisedIndex: revIdx,
-            });
-        }
-    }
-    // Output any remaining deleted paragraphs at the end
-    for (let i = lastOriginalIndex + 1; i < originalParagraphs.length; i++) {
-        if (!matchedOriginalIndices.has(i)) {
-            const deletedPara = originalByIndex.get(i);
-            if (deletedPara) {
-                operations.push({
-                    type: 'deleted',
-                    xml: generateDeletedParagraph(deletedPara.runs, author, date, extractPPrContent(deletedPara.pPrXml)),
-                    originalIndex: i,
-                });
-            }
-        }
-    }
-    return operations;
-}
-/**
- * Build a new document.xml with track changes applied.
- *
- * @param originalXml - The original document.xml content
- * @param operations - Ordered list of paragraph operations
- * @returns The new document.xml content
- */
-export function buildDocumentWithTrackChanges(originalXml, operations) {
-    // Extract document structure
-    const { beforeBody, bodyContent, afterBody } = getDocumentParts(originalXml);
-    // Extract sectPr from body (must be preserved at end)
-    const { sectPr } = extractSectPr(bodyContent);
-    // Build new body content from operations
-    const paragraphXmls = operations.map(op => op.xml);
-    // Combine: paragraphs + sectPr (if present) + closing
-    let newBodyContent = paragraphXmls.join('\n');
-    if (sectPr) {
-        newBodyContent += '\n' + sectPr;
-    }
-    // Reconstruct document
-    return beforeBody + newBodyContent + afterBody;
-}
-/**
- * Extract document parts for reconstruction.
- */
-function getDocumentParts(documentXml) {
-    // Find w:body opening and closing
-    const bodyOpenMatch = documentXml.match(/<w:body[^>]*>/);
-    const bodyCloseMatch = documentXml.match(/<\/w:body>/);
-    if (!bodyOpenMatch || !bodyCloseMatch) {
-        return {
-            beforeBody: documentXml,
-            bodyContent: '',
-            afterBody: '',
-        };
-    }
-    const bodyOpenEnd = documentXml.indexOf(bodyOpenMatch[0]) + bodyOpenMatch[0].length;
-    const bodyCloseStart = documentXml.lastIndexOf('</w:body>');
-    return {
-        beforeBody: documentXml.slice(0, bodyOpenEnd),
-        bodyContent: documentXml.slice(bodyOpenEnd, bodyCloseStart),
-        afterBody: documentXml.slice(bodyCloseStart),
-    };
-}
-/**
- * Generate XML for an unchanged paragraph.
- */
-function generateParagraphXml(para) {
-    // Build paragraph from runs
-    const runsXml = para.runs.map(run => generateRunXml(run)).join('');
-    const pPr = para.pPrXml ? para.pPrXml : '';
-    return `<w:p>${pPr}${runsXml}</w:p>`;
-}
-/**
- * Generate XML for a single run.
- */
-function generateRunXml(run) {
-    const rPr = generateRunPropertiesXml(run.properties);
-    // Handle whitespace preservation
-    const needsSpace = run.text.startsWith(' ') || run.text.endsWith(' ') || run.text.includes('  ');
-    const spaceAttr = needsSpace ? ' xml:space="preserve"' : '';
-    return `<w:r>${rPr}<w:t${spaceAttr}>${escapeXml(run.text)}</w:t></w:r>`;
-}
-/**
- * Generate run properties XML.
- */
-function generateRunPropertiesXml(props) {
-    if (!props)
-        return '';
-    const parts = [];
-    if (props.bold)
-        parts.push('<w:b/>');
-    if (props.italic)
-        parts.push('<w:i/>');
-    if (props.underline)
-        parts.push(`<w:u w:val="${escapeXml(props.underline)}"/>`);
-    if (props.strikethrough)
-        parts.push('<w:strike/>');
-    if (props.highlight)
-        parts.push(`<w:highlight w:val="${escapeXml(props.highlight)}"/>`);
-    if (props.color)
-        parts.push(`<w:color w:val="${escapeXml(props.color)}"/>`);
-    if (props.fontSize !== undefined)
-        parts.push(`<w:sz w:val="${props.fontSize}"/>`);
-    if (props.fontFamily)
-        parts.push(`<w:rFonts w:ascii="${escapeXml(props.fontFamily)}" w:hAnsi="${escapeXml(props.fontFamily)}"/>`);
-    if (parts.length === 0)
-        return '';
-    return `<w:rPr>${parts.join('')}</w:rPr>`;
-}
-/**
- * Extract inner pPr content from full pPr XML.
- * Removes the outer <w:pPr> tags.
- */
-function extractPPrContent(pPrXml) {
-    if (!pPrXml)
-        return undefined;
-    // Remove outer tags
-    const match = pPrXml.match(/<w:pPr[^>]*>([\s\S]*)<\/w:pPr>/);
-    return match ? match[1] : undefined;
-}
-/**
- * Escape XML special characters.
- */
-function escapeXml(text) {
-    return text
-        .replace(/&/g, '&amp;')
-        .replace(/</g, '&lt;')
-        .replace(/>/g, '&gt;')
-        .replace(/"/g, '&quot;')
-        .replace(/'/g, '&apos;');
-}
-//# sourceMappingURL=documentBuilder.js.map

package/dist/baselines/diffmatch/documentBuilder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"documentBuilder.js","sourceRoot":"","sources":["../../../src/baselines/diffmatch/documentBuilder.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EACL,kBAAkB,EAClB,wBAAwB,EACxB,yBAAyB,EACzB,eAAe,GAChB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,aAAa,EAA8B,MAAM,gBAAgB,CAAC;AAwB3E;;;;;GAKG;AACH,MAAM,UAAU,2BAA2B,CACzC,SAA0B,EAC1B,kBAA2C,EAC3C,iBAA0C,EAC1C,OAAqB;IAErB,MAAM,UAAU,GAAyB,EAAE,CAAC;IAC5C,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IAEjC,qDAAqD;IACrD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAiC,CAAC;IACjE,KAAK,MAAM,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACnC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,oDAAoD;IACpD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAiC,CAAC;IAChE,KAAK,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;QAClC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,oDAAoD;IACpD,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAU,CAAC;IACjD,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAU,CAAC;IAEhD,oEAAoE;IACpE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAiC,CAAC;IAEnE,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAiC,CAAC;QACzD,MAAM,OAAO,GAAG,KAAK,CAAC,OAAgC,CAAC;QAEvD,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QACnD,qBAAqB,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QACjD,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED,yCAAyC;IACzC,wDAAwD;IACxD,mEAAmE;IACnE,oCAAoC;IAEpC,IAAI,iBAAiB,GAAG,CAAC,CAAC,CAAC;IAE3B,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;QACjE,MAAM,OAAO,GAAG,iBAAiB,CAAC,MAAM,CAAE,CAAC;QAE3C,IAAI,qBAAqB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACtC,8BAA8B;YAC9B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAEhD,6DAA6D;YAC7D,KAAK,IAAI,CAAC,GAAG,iBAAiB,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpE,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnC,MAAM,WAAW,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC3C,IAAI,WAAW,EAAE,CAAC;wBAChB,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,SAAS;4BACf,GAAG,EAAE,wBAAwB,CAC3B,WAAW,CAAC,IAAI,EAChB,MAAM,EACN,IAAI,EACJ,iBAAiB,CAAC,WAAW,CAAC,MAAM,CAAC,CACtC;4BACD,aAAa,EAAE,CAAC;yBACjB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;YAED,gDAAgD;YAChD,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CACvC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,OAAiC,CAAC,aAAa,KAAK,MAAM,CACnE,EAAE,UAAU,IAAI,CAAC,CAAC;YAEnB,IAAI,UAAU,IAAI,MAAM,EAAE,CAAC;gBACzB,kDAAkD;gBAClD,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,WAAW;oBACjB,GAAG,EAAE,oBAAoB,CAAC,OAAO,CAAC;oBAClC,aAAa,EAAE,QAAQ,CAAC,aAAa;oBACrC,YAAY,EAAE,MAAM;iBACrB,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,qCAAqC;gBACrC,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;gBACzD,MAAM,mBAAmB,GAAG,kBAAkB,CAAC,UAAU,CAAC,UAAU,EAAE;oBACpE,MAAM;oBACN,IAAI;iBACL,CAAC,CAAC;gBAEH,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,UAAU;oBAChB,GAAG,EAAE,eAAe,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC5E,aAAa,EAAE,QAAQ,CAAC,aAAa;oBACrC,YAAY,EAAE,MAAM;iBACrB,CAAC,CAAC;YACL,CAAC;YAED,iBAAiB,GAAG,QAAQ,CAAC,aAAa,CAAC;QAC7C,CAAC;aAAM,CAAC;YACN,gCAAgC;YAChC,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,UAAU;gBAChB,GAAG,EAAE,yBAAyB,CAC5B,OAAO,CAAC,IAAI,EACZ,MAAM,EACN,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,MAAM,CAAC,CAClC;gBACD,YAAY,EAAE,MAAM;aACrB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,KAAK,IAAI,CAAC,GAAG,iBAAiB,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvE,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,MAAM,WAAW,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,WAAW,EAAE,CAAC;gBAChB,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,SAAS;oBACf,GAAG,EAAE,wBAAwB,CAC3B,WAAW,CAAC,IAAI,EAChB,MAAM,EACN,IAAI,EACJ,iBAAiB,CAAC,WAAW,CAAC,MAAM,CAAC,CACtC;oBACD,aAAa,EAAE,CAAC;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,6BAA6B,CAC3C,WAAmB,EACnB,UAAgC;IAEhC,6BAA6B;IAC7B,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAE7E,sDAAsD;IACtD,MAAM,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAE9C,yCAAyC;IACzC,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAEnD,sDAAsD;IACtD,IAAI,cAAc,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,MAAM,EAAE,CAAC;QACX,cAAc,IAAI,IAAI,GAAG,MAAM,CAAC;IAClC,CAAC;IAED,uBAAuB;IACvB,OAAO,UAAU,GAAG,cAAc,GAAG,SAAS,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,WAAmB;IAK3C,kCAAkC;IAClC,MAAM,aAAa,GAAG,WAAW,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACzD,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAEvD,IAAI,CAAC,aAAa,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,OAAO;YACL,UAAU,EAAE,WAAW;YACvB,WAAW,EAAE,EAAE;YACf,SAAS,EAAE,EAAE;SACd,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACpF,MAAM,cAAc,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAE5D,OAAO;QACL,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;QAC7C,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,cAAc,CAAC;QAC3D,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,cAAc,CAAC;KAC7C,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,IAA2B;IACvD,4BAA4B;IAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnE,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAE3C,OAAO,QAAQ,GAAG,GAAG,OAAO,QAAQ,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,GAAY;IAClC,MAAM,GAAG,GAAG,wBAAwB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAErD,iCAAiC;IACjC,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACjG,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,CAAC;IAE5D,OAAO,QAAQ,GAAG,OAAO,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;AAC1E,CAAC;AAED;;GAEG;AACH,SAAS,wBAAwB,CAAC,KAA2D;IAC3F,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAEtB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,KAAK,CAAC,IAAI;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,KAAK,CAAC,MAAM;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,eAAe,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAChF,IAAI,KAAK,CAAC,aAAa;QAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnD,IAAI,KAAK,CAAC,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,uBAAuB,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACxF,IAAI,KAAK,CAAC,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,mBAAmB,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5E,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,KAAK,CAAC,QAAQ,KAAK,CAAC,CAAC;IAClF,IAAI,KAAK,CAAC,UAAU;QAAE,KAAK,CAAC,IAAI,CAAC,sBAAsB,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,cAAc,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAElI,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,OAAO,UAAU,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,MAAe;IACxC,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAE9B,oBAAoB;IACpB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,gCAAgC,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,IAAI;SACR,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;SACtB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;SACrB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;SACrB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;SACvB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC7B,CAAC"}

package/dist/baselines/diffmatch/paragraphAlignment.d.ts

@@ -1,75 +0,0 @@
-/**
- * Baseline B: Paragraph alignment using LCS (Longest Common Subsequence).
- *
- * Aligns paragraphs between original and revised documents to identify:
- * - Matched paragraphs (same or similar content)
- * - Inserted paragraphs (only in revised)
- * - Deleted paragraphs (only in original)
- * - Modified paragraphs (matched but with differences)
- */
-import type { ParagraphInfo, AlignmentResult } from '../../shared/ooxml/types.js';
-/**
- * Compute a hash for a paragraph's normalized text.
- *
- * Used for fast comparison during LCS.
- */
-export declare function hashParagraph(text: string): string;
-/**
- * Normalize paragraph text for comparison.
- *
- * - Trim whitespace
- * - Collapse multiple spaces
- * - Lowercase for case-insensitive comparison
- */
-export declare function normalizeParagraphText(text: string): string;
-/**
- * Compute similarity between two strings using Jaccard index on words.
- *
- * @returns Value between 0 (completely different) and 1 (identical)
- */
-export declare function computeSimilarity(a: string, b: string): number;
-/**
- * Compute the Longest Common Subsequence of two arrays using dynamic programming.
- *
- * @param a - First array
- * @param b - Second array
- * @param keyFn - Function to extract comparison key from elements
- * @returns Array of [indexA, indexB] pairs representing the LCS
- */
-export declare function lcs<T>(a: T[], b: T[], keyFn: (item: T) => string): Array<[number, number]>;
-/**
- * Align paragraphs between original and revised documents.
- *
- * Uses hash-based LCS to find matching paragraphs, then classifies
- * unmatched paragraphs as inserted or deleted.
- *
- * @param original - Paragraphs from original document
- * @param revised - Paragraphs from revised document
- * @param similarityThreshold - Minimum similarity to consider a match (default: 0.5)
- */
-export declare function alignParagraphs(original: ParagraphInfo[], revised: ParagraphInfo[], similarityThreshold?: number): AlignmentResult;
-/**
- * Classify paragraph matches into categories.
- */
-export interface ParagraphClassification {
-    /** Identical paragraphs (similarity = 1.0) */
-    identical: Array<{
-        original: ParagraphInfo;
-        revised: ParagraphInfo;
-    }>;
-    /** Modified paragraphs (0 < similarity < 1.0) */
-    modified: Array<{
-        original: ParagraphInfo;
-        revised: ParagraphInfo;
-        similarity: number;
-    }>;
-    /** Deleted paragraphs */
-    deleted: ParagraphInfo[];
-    /** Inserted paragraphs */
-    inserted: ParagraphInfo[];
-}
-/**
- * Classify alignment result into more granular categories.
- */
-export declare function classifyAlignment(alignment: AlignmentResult): ParagraphClassification;
-//# sourceMappingURL=paragraphAlignment.d.ts.map

package/dist/baselines/diffmatch/paragraphAlignment.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"paragraphAlignment.d.ts","sourceRoot":"","sources":["../../../src/baselines/diffmatch/paragraphAlignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAElF;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGlD;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAK3D;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAe9D;AAED;;;;;;;GAOG;AACH,wBAAgB,GAAG,CAAC,CAAC,EACnB,CAAC,EAAE,CAAC,EAAE,EACN,CAAC,EAAE,CAAC,EAAE,EACN,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GACzB,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAqCzB;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,aAAa,EAAE,EACzB,OAAO,EAAE,aAAa,EAAE,EACxB,mBAAmB,SAAM,GACxB,eAAe,CA6FjB;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,8CAA8C;IAC9C,SAAS,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,aAAa,CAAC;QAAC,OAAO,EAAE,aAAa,CAAA;KAAE,CAAC,CAAC;IACtE,iDAAiD;IACjD,QAAQ,EAAE,KAAK,CAAC;QACd,QAAQ,EAAE,aAAa,CAAC;QACxB,OAAO,EAAE,aAAa,CAAC;QACvB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC,CAAC;IACH,yBAAyB;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,0BAA0B;IAC1B,QAAQ,EAAE,aAAa,EAAE,CAAC;CAC3B;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,eAAe,GAAG,uBAAuB,CAoBrF"}

package/dist/baselines/diffmatch/paragraphAlignment.js

@@ -1,206 +0,0 @@
-/**
- * Baseline B: Paragraph alignment using LCS (Longest Common Subsequence).
- *
- * Aligns paragraphs between original and revised documents to identify:
- * - Matched paragraphs (same or similar content)
- * - Inserted paragraphs (only in revised)
- * - Deleted paragraphs (only in original)
- * - Modified paragraphs (matched but with differences)
- */
-import { createHash } from 'crypto';
-/**
- * Compute a hash for a paragraph's normalized text.
- *
- * Used for fast comparison during LCS.
- */
-export function hashParagraph(text) {
-    const normalized = normalizeParagraphText(text);
-    return createHash('sha1').update(normalized).digest('hex');
-}
-/**
- * Normalize paragraph text for comparison.
- *
- * - Trim whitespace
- * - Collapse multiple spaces
- * - Lowercase for case-insensitive comparison
- */
-export function normalizeParagraphText(text) {
-    return text
-        .trim()
-        .replace(/\s+/g, ' ')
-        .toLowerCase();
-}
-/**
- * Compute similarity between two strings using Jaccard index on words.
- *
- * @returns Value between 0 (completely different) and 1 (identical)
- */
-export function computeSimilarity(a, b) {
-    const wordsA = new Set(normalizeParagraphText(a).split(' ').filter(w => w.length > 0));
-    const wordsB = new Set(normalizeParagraphText(b).split(' ').filter(w => w.length > 0));
-    if (wordsA.size === 0 && wordsB.size === 0) {
-        return 1; // Both empty
-    }
-    if (wordsA.size === 0 || wordsB.size === 0) {
-        return 0; // One empty
-    }
-    const intersection = new Set([...wordsA].filter(x => wordsB.has(x)));
-    const union = new Set([...wordsA, ...wordsB]);
-    return intersection.size / union.size;
-}
-/**
- * Compute the Longest Common Subsequence of two arrays using dynamic programming.
- *
- * @param a - First array
- * @param b - Second array
- * @param keyFn - Function to extract comparison key from elements
- * @returns Array of [indexA, indexB] pairs representing the LCS
- */
-export function lcs(a, b, keyFn) {
-    const m = a.length;
-    const n = b.length;
-    // Build DP table
-    const dp = Array.from({ length: m + 1 }, () => Array.from({ length: n + 1 }, () => 0));
-    for (let i = 1; i <= m; i++) {
-        for (let j = 1; j <= n; j++) {
-            if (keyFn(a[i - 1]) === keyFn(b[j - 1])) {
-                dp[i][j] = dp[i - 1][j - 1] + 1;
-            }
-            else {
-                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
-            }
-        }
-    }
-    // Backtrack to find LCS
-    const result = [];
-    let i = m;
-    let j = n;
-    while (i > 0 && j > 0) {
-        if (keyFn(a[i - 1]) === keyFn(b[j - 1])) {
-            result.push([i - 1, j - 1]);
-            i--;
-            j--;
-        }
-        else if (dp[i - 1][j] > dp[i][j - 1]) {
-            i--;
-        }
-        else {
-            j--;
-        }
-    }
-    return result.reverse();
-}
-/**
- * Align paragraphs between original and revised documents.
- *
- * Uses hash-based LCS to find matching paragraphs, then classifies
- * unmatched paragraphs as inserted or deleted.
- *
- * @param original - Paragraphs from original document
- * @param revised - Paragraphs from revised document
- * @param similarityThreshold - Minimum similarity to consider a match (default: 0.5)
- */
-export function alignParagraphs(original, revised, similarityThreshold = 0.5) {
-    // Compute hashes for all paragraphs
-    const originalHashes = original.map(p => ({
-        para: p,
-        hash: hashParagraph(p.text),
-    }));
-    const revisedHashes = revised.map(p => ({
-        para: p,
-        hash: hashParagraph(p.text),
-    }));
-    // Find LCS based on hashes
-    const lcsResult = lcs(originalHashes, revisedHashes, item => item.hash);
-    // Build sets of matched indices
-    const matchedOriginal = new Set(lcsResult.map(([i]) => i));
-    const matchedRevised = new Set(lcsResult.map(([, j]) => j));
-    // Build alignment result
-    const result = {
-        matched: [],
-        deleted: [],
-        inserted: [],
-    };
-    // Add matched paragraphs
-    for (const [origIdx, revIdx] of lcsResult) {
-        const origPara = original[origIdx];
-        const revPara = revised[revIdx];
-        const similarity = computeSimilarity(origPara.text, revPara.text);
-        result.matched.push({
-            original: origPara,
-            revised: revPara,
-            similarity,
-        });
-    }
-    // Add deleted paragraphs (in original but not matched)
-    for (let i = 0; i < original.length; i++) {
-        if (!matchedOriginal.has(i)) {
-            result.deleted.push(original[i]);
-        }
-    }
-    // Add inserted paragraphs (in revised but not matched)
-    for (let j = 0; j < revised.length; j++) {
-        if (!matchedRevised.has(j)) {
-            result.inserted.push(revised[j]);
-        }
-    }
-    // Try to find near-matches for unmatched paragraphs
-    // This helps with paragraphs that were modified significantly
-    const unmatchedOriginal = [...result.deleted];
-    const unmatchedRevised = [...result.inserted];
-    result.deleted = [];
-    result.inserted = [];
-    for (const origPara of unmatchedOriginal) {
-        let bestMatch = null;
-        for (const revPara of unmatchedRevised) {
-            const similarity = computeSimilarity(origPara.text, revPara.text);
-            if (similarity >= similarityThreshold) {
-                if (!bestMatch || similarity > bestMatch.similarity) {
-                    bestMatch = { para: revPara, similarity };
-                }
-            }
-        }
-        if (bestMatch) {
-            // Remove from unmatched revised
-            const idx = unmatchedRevised.indexOf(bestMatch.para);
-            if (idx !== -1) {
-                unmatchedRevised.splice(idx, 1);
-            }
-            result.matched.push({
-                original: origPara,
-                revised: bestMatch.para,
-                similarity: bestMatch.similarity,
-            });
-        }
-        else {
-            result.deleted.push(origPara);
-        }
-    }
-    // Remaining unmatched revised are insertions
-    result.inserted = unmatchedRevised;
-    return result;
-}
-/**
- * Classify alignment result into more granular categories.
- */
-export function classifyAlignment(alignment) {
-    const result = {
-        identical: [],
-        modified: [],
-        deleted: alignment.deleted,
-        inserted: alignment.inserted,
-    };
-    for (const match of alignment.matched) {
-        if (match.similarity >= 0.9999) {
-            result.identical.push({
-                original: match.original,
-                revised: match.revised,
-            });
-        }
-        else {
-            result.modified.push(match);
-        }
-    }
-    return result;
-}
-//# sourceMappingURL=paragraphAlignment.js.map

package/dist/baselines/diffmatch/paragraphAlignment.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"paragraphAlignment.js","sourceRoot":"","sources":["../../../src/baselines/diffmatch/paragraphAlignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAGpC;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,MAAM,UAAU,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAY;IACjD,OAAO,IAAI;SACR,IAAI,EAAE;SACN,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,WAAW,EAAE,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAS,EAAE,CAAS;IACpD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACvF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,CAAC,CAAC,CAAC,aAAa;IACzB,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,CAAC,CAAC,CAAC,YAAY;IACxB,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;IAE9C,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CACjB,CAAM,EACN,CAAM,EACN,KAA0B;IAE1B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,iBAAiB;IACjB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CACxD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CACvC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;gBAC1C,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,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;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC;YAC3C,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,CAAC;YACN,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAyB,EACzB,OAAwB,EACxB,mBAAmB,GAAG,GAAG;IAEzB,oCAAoC;IACpC,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;KAC5B,CAAC,CAAC,CAAC;IACJ,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;KAC5B,CAAC,CAAC,CAAC;IAEJ,2BAA2B;IAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,cAAc,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAExE,gCAAgC;IAChC,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5D,yBAAyB;IACzB,MAAM,MAAM,GAAoB;QAC9B,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE,EAAE;KACb,CAAC;IAEF,yBAAyB;IACzB,KAAK,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAE,CAAC;QACpC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC;QACjC,MAAM,UAAU,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAElE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;YAClB,QAAQ,EAAE,QAAQ;YAClB,OAAO,EAAE,OAAO;YAChB,UAAU;SACX,CAAC,CAAC;IACL,CAAC;IAED,uDAAuD;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,8DAA8D;IAC9D,MAAM,iBAAiB,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9C,MAAM,gBAAgB,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAE9C,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,MAAM,CAAC,QAAQ,GAAG,EAAE,CAAC;IAErB,KAAK,MAAM,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QACzC,IAAI,SAAS,GAAuD,IAAI,CAAC;QAEzE,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;YACvC,MAAM,UAAU,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;YAClE,IAAI,UAAU,IAAI,mBAAmB,EAAE,CAAC;gBACtC,IAAI,CAAC,SAAS,IAAI,UAAU,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;oBACpD,SAAS,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,EAAE,CAAC;YACd,gCAAgC;YAChC,MAAM,GAAG,GAAG,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrD,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,gBAAgB,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClC,CAAC;YAED,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,OAAO,EAAE,SAAS,CAAC,IAAI;gBACvB,UAAU,EAAE,SAAS,CAAC,UAAU;aACjC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,MAAM,CAAC,QAAQ,GAAG,gBAAgB,CAAC;IAEnC,OAAO,MAAM,CAAC;AAChB,CAAC;AAoBD;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,SAA0B;IAC1D,MAAM,MAAM,GAA4B;QACtC,SAAS,EAAE,EAAE;QACb,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,SAAS,CAAC,OAAO;QAC1B,QAAQ,EAAE,SAAS,CAAC,QAAQ;KAC7B,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,UAAU,IAAI,MAAM,EAAE,CAAC;YAC/B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC;gBACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/baselines/diffmatch/pipeline.d.ts

@@ -1,33 +0,0 @@
-/**
- * Baseline B: Pure TypeScript document comparison pipeline.
- *
- * Orchestrates the comparison flow:
- * 1. Load DOCX archives
- * 2. Extract paragraphs
- * 3. Align paragraphs (LCS + similarity)
- * 4. Diff runs within matched paragraphs
- * 5. Render track changes
- * 6. Build output document
- */
-import type { CompareResult } from '../../index.js';
-/**
- * Options for Baseline B comparison.
- */
-export interface BaselineBOptions {
-    /** Author name for track changes. Default: "Comparison" */
-    author?: string;
-    /** Timestamp for track changes. Default: current time */
-    date?: Date;
-    /** Minimum similarity to consider paragraphs matched. Default: 0.5 */
-    similarityThreshold?: number;
-}
-/**
- * Compare two DOCX documents using the Baseline B (pure TypeScript) approach.
- *
- * @param original - Original document as Buffer
- * @param revised - Revised document as Buffer
- * @param options - Comparison options
- * @returns Comparison result with track changes document
- */
-export declare function compareDocumentsBaselineB(original: Buffer, revised: Buffer, options?: BaselineBOptions): Promise<CompareResult>;
-//# sourceMappingURL=pipeline.d.ts.map

package/dist/baselines/diffmatch/pipeline.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../../src/baselines/diffmatch/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAgB,MAAM,gBAAgB,CAAC;AAWlE;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,2DAA2D;IAC3D,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,IAAI,CAAC,EAAE,IAAI,CAAC;IACZ,sEAAsE;IACtE,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED;;;;;;;GAOG;AACH,wBAAsB,yBAAyB,CAC7C,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,gBAAqB,GAC7B,OAAO,CAAC,aAAa,CAAC,CAqDxB"}

package/dist/baselines/diffmatch/pipeline.js

@@ -1,84 +0,0 @@
-/**
- * Baseline B: Pure TypeScript document comparison pipeline.
- *
- * Orchestrates the comparison flow:
- * 1. Load DOCX archives
- * 2. Extract paragraphs
- * 3. Align paragraphs (LCS + similarity)
- * 4. Diff runs within matched paragraphs
- * 5. Render track changes
- * 6. Build output document
- */
-import { DocxArchive } from '../../shared/docx/DocxArchive.js';
-import { extractParagraphs } from './xmlParser.js';
-import { alignParagraphs, classifyAlignment } from './paragraphAlignment.js';
-import { resetRevisionIds } from './trackChangesRenderer.js';
-import { generateParagraphOperations, buildDocumentWithTrackChanges, } from './documentBuilder.js';
-/**
- * Compare two DOCX documents using the Baseline B (pure TypeScript) approach.
- *
- * @param original - Original document as Buffer
- * @param revised - Revised document as Buffer
- * @param options - Comparison options
- * @returns Comparison result with track changes document
- */
-export async function compareDocumentsBaselineB(original, revised, options = {}) {
-    const { author = 'Comparison', date = new Date(), similarityThreshold = 0.5, } = options;
-    // 1. Load archives
-    const originalArchive = await DocxArchive.load(original);
-    const revisedArchive = await DocxArchive.load(revised);
-    // 2. Extract document XML
-    const originalXml = await originalArchive.getDocumentXml();
-    const revisedXml = await revisedArchive.getDocumentXml();
-    // 3. Extract paragraphs from both documents
-    const originalParagraphs = extractParagraphs(originalXml);
-    const revisedParagraphs = extractParagraphs(revisedXml);
-    // 4. Reset revision ID counter for this comparison
-    resetRevisionIds();
-    // 5. Align paragraphs between documents
-    const alignment = alignParagraphs(originalParagraphs, revisedParagraphs, similarityThreshold);
-    // 6. Generate paragraph operations with track changes
-    const operations = generateParagraphOperations(alignment, originalParagraphs, revisedParagraphs, { author, date });
-    // 7. Build new document.xml with track changes
-    const newDocumentXml = buildDocumentWithTrackChanges(originalXml, operations);
-    // 8. Clone original archive and update document.xml
-    const resultArchive = await originalArchive.clone();
-    resultArchive.setDocumentXml(newDocumentXml);
-    // 9. Save result and compute stats
-    const resultBuffer = await resultArchive.save();
-    const stats = computeStats(alignment, operations);
-    return {
-        document: resultBuffer,
-        stats,
-        engine: 'diffmatch',
-    };
-}
-/**
- * Compute comparison statistics from alignment and operations.
- */
-function computeStats(alignment, operations) {
-    // Count operations
-    let insertions = 0;
-    let deletions = 0;
-    let modifications = 0;
-    for (const op of operations) {
-        if (op.type === 'inserted') {
-            insertions++;
-        }
-        else if (op.type === 'deleted') {
-            deletions++;
-        }
-        else if (op.type === 'modified') {
-            modifications++;
-        }
-    }
-    // Also count modifications from alignment for more accurate stats
-    const classification = classifyAlignment(alignment);
-    modifications = classification.modified.length;
-    return {
-        insertions,
-        deletions,
-        modifications,
-    };
-}
-//# sourceMappingURL=pipeline.js.map

package/dist/baselines/diffmatch/pipeline.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pipeline.js","sourceRoot":"","sources":["../../../src/baselines/diffmatch/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAG/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC7E,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EACL,2BAA2B,EAC3B,6BAA6B,GAE9B,MAAM,sBAAsB,CAAC;AAc9B;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,QAAgB,EAChB,OAAe,EACf,UAA4B,EAAE;IAE9B,MAAM,EACJ,MAAM,GAAG,YAAY,EACrB,IAAI,GAAG,IAAI,IAAI,EAAE,EACjB,mBAAmB,GAAG,GAAG,GAC1B,GAAG,OAAO,CAAC;IAEZ,mBAAmB;IACnB,MAAM,eAAe,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,cAAc,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAEvD,0BAA0B;IAC1B,MAAM,WAAW,GAAG,MAAM,eAAe,CAAC,cAAc,EAAE,CAAC;IAC3D,MAAM,UAAU,GAAG,MAAM,cAAc,CAAC,cAAc,EAAE,CAAC;IAEzD,4CAA4C;IAC5C,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAC1D,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAExD,mDAAmD;IACnD,gBAAgB,EAAE,CAAC;IAEnB,wCAAwC;IACxC,MAAM,SAAS,GAAG,eAAe,CAC/B,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,CACpB,CAAC;IAEF,sDAAsD;IACtD,MAAM,UAAU,GAAG,2BAA2B,CAC5C,SAAS,EACT,kBAAkB,EAClB,iBAAiB,EACjB,EAAE,MAAM,EAAE,IAAI,EAAE,CACjB,CAAC;IAEF,+CAA+C;IAC/C,MAAM,cAAc,GAAG,6BAA6B,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IAE9E,oDAAoD;IACpD,MAAM,aAAa,GAAG,MAAM,eAAe,CAAC,KAAK,EAAE,CAAC;IACpD,aAAa,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;IAE7C,mCAAmC;IACnC,MAAM,YAAY,GAAG,MAAM,aAAa,CAAC,IAAI,EAAE,CAAC;IAChD,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAElD,OAAO;QACL,QAAQ,EAAE,YAAY;QACtB,KAAK;QACL,MAAM,EAAE,WAAW;KACpB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CACnB,SAA0B,EAC1B,UAAgC;IAEhC,mBAAmB;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,UAAU,EAAE,CAAC;QACf,CAAC;aAAM,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACjC,SAAS,EAAE,CAAC;QACd,CAAC;aAAM,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAClC,aAAa,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,MAAM,cAAc,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACpD,aAAa,GAAG,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC;IAE/C,OAAO;QACL,UAAU;QACV,SAAS;QACT,aAAa;KACd,CAAC;AACJ,CAAC"}