@usejunior/docx-core 0.2.0 → 0.3.1

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"}

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

@@ -1,53 +0,0 @@
-/**
- * Baseline B: Run-level diff using diff-match-patch.
- *
- * Performs character-level diff on matched paragraphs, then maps
- * the diff operations back to run boundaries for track changes generation.
- */
-import type { RunInfo, RunDiffResult, DiffOp } from '../../shared/ooxml/types.js';
-/**
- * Compute a diff between two strings.
- *
- * @param original - Original text
- * @param revised - Revised text
- * @param cleanupSemantic - Apply semantic cleanup (default: true)
- * @returns Array of diff operations [operation, text]
- */
-export declare function computeDiff(original: string, revised: string, cleanupSemantic?: boolean): DiffOp[];
-/**
- * Compute a word-level diff (more suitable for document comparison).
- *
- * Tokenizes input by words, performs diff, then reconstructs.
- */
-export declare function computeWordDiff(original: string, revised: string): DiffOp[];
-/**
- * Split a run at a given character offset.
- *
- * @param run - The run to split
- * @param offset - Character offset to split at
- * @returns [before, after] runs
- */
-export declare function splitRun(run: RunInfo, offset: number): [RunInfo, RunInfo];
-/**
- * Extract text from runs.
- */
-export declare function extractText(runs: RunInfo[]): string;
-/**
- * Compute run-level diff between original and revised runs.
- *
- * Maps character-level diff back to run boundaries, splitting runs
- * when necessary.
- *
- * @param originalRuns - Runs from original paragraph
- * @param revisedRuns - Runs from revised paragraph
- * @returns Merged runs with revision markers
- */
-export declare function diffRuns(originalRuns: RunInfo[], revisedRuns: RunInfo[]): RunDiffResult;
-/**
- * Count changes in a diff result.
- */
-export declare function countChanges(diffs: DiffOp[]): {
-    insertions: number;
-    deletions: number;
-};
-//# sourceMappingURL=runDiff.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"runDiff.d.ts","sourceRoot":"","sources":["../../../src/baselines/diffmatch/runDiff.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,6BAA6B,CAAC;AAclF;;;;;;;GAOG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,eAAe,UAAO,GACrB,MAAM,EAAE,CAQV;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAkB3E;AAuFD;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAgBzE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAEnD;AAED;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CACtB,YAAY,EAAE,OAAO,EAAE,EACvB,WAAW,EAAE,OAAO,EAAE,GACrB,aAAa,CAkGf;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAavF"}

package/dist/baselines/diffmatch/runDiff.js

@@ -1,253 +0,0 @@
-/**
- * Baseline B: Run-level diff using diff-match-patch.
- *
- * Performs character-level diff on matched paragraphs, then maps
- * the diff operations back to run boundaries for track changes generation.
- */
-import DiffMatchPatch from 'diff-match-patch';
-/** Diff operation codes from diff-match-patch */
-const DIFF_DELETE = -1;
-const DIFF_INSERT = 1;
-const DIFF_EQUAL = 0;
-/** Create a shared diff-match-patch instance */
-const dmp = new DiffMatchPatch();
-// Configure diff-match-patch for better document comparison
-dmp.Diff_Timeout = 5; // 5 seconds timeout
-dmp.Diff_EditCost = 4; // Favor fewer, larger edits
-/**
- * Compute a diff between two strings.
- *
- * @param original - Original text
- * @param revised - Revised text
- * @param cleanupSemantic - Apply semantic cleanup (default: true)
- * @returns Array of diff operations [operation, text]
- */
-export function computeDiff(original, revised, cleanupSemantic = true) {
-    const diffs = dmp.diff_main(original, revised);
-    if (cleanupSemantic) {
-        dmp.diff_cleanupSemantic(diffs);
-    }
-    return diffs;
-}
-/**
- * Compute a word-level diff (more suitable for document comparison).
- *
- * Tokenizes input by words, performs diff, then reconstructs.
- */
-export function computeWordDiff(original, revised) {
-    // Tokenize by words (keep punctuation attached to words)
-    const tokenize = (text) => {
-        return text.match(/\S+\s*/g) ?? [];
-    };
-    const originalTokens = tokenize(original);
-    const revisedTokens = tokenize(revised);
-    // Convert tokens to characters for diff-match-patch (1 token = 1 char)
-    const { chars1, chars2, lineArray } = tokensToChars(originalTokens, revisedTokens);
-    // Compute diff on character representation
-    const diffs = dmp.diff_main(chars1, chars2);
-    dmp.diff_cleanupSemantic(diffs);
-    // Convert back to actual text
-    return charsToTokens(diffs, lineArray);
-}
-/**
- * Convert token arrays to character sequences for diffing.
- */
-function tokensToChars(tokens1, tokens2) {
-    const tokenSet = new Map();
-    const lineArray = [];
-    const encode = (tokens) => {
-        let chars = '';
-        for (const token of tokens) {
-            if (!tokenSet.has(token)) {
-                tokenSet.set(token, lineArray.length);
-                lineArray.push(token);
-            }
-            chars += String.fromCharCode(tokenSet.get(token));
-        }
-        return chars;
-    };
-    const chars1 = encode(tokens1);
-    const chars2 = encode(tokens2);
-    return { chars1, chars2, lineArray };
-}
-/**
- * Convert character diff back to token diff.
- */
-function charsToTokens(diffs, lineArray) {
-    const result = [];
-    for (const [op, chars] of diffs) {
-        let text = '';
-        for (let i = 0; i < chars.length; i++) {
-            text += lineArray[chars.charCodeAt(i)] ?? '';
-        }
-        if (text) {
-            result.push([op, text]);
-        }
-    }
-    return result;
-}
-/**
- * Map a character offset to a position in the run array.
- */
-function offsetToRunPosition(runs, offset) {
-    let charCount = 0;
-    for (let i = 0; i < runs.length; i++) {
-        const run = runs[i];
-        const runLength = run.text.length;
-        if (charCount + runLength > offset) {
-            return {
-                runIndex: i,
-                charOffset: offset - charCount,
-            };
-        }
-        charCount += runLength;
-    }
-    // Offset is at or past end
-    return {
-        runIndex: runs.length - 1,
-        charOffset: runs[runs.length - 1]?.text.length ?? 0,
-    };
-}
-/**
- * Split a run at a given character offset.
- *
- * @param run - The run to split
- * @param offset - Character offset to split at
- * @returns [before, after] runs
- */
-export function splitRun(run, offset) {
-    const before = {
-        text: run.text.slice(0, offset),
-        start: run.start,
-        end: run.start + offset,
-        properties: run.properties ? { ...run.properties } : undefined,
-    };
-    const after = {
-        text: run.text.slice(offset),
-        start: run.start + offset,
-        end: run.end,
-        properties: run.properties ? { ...run.properties } : undefined,
-    };
-    return [before, after];
-}
-/**
- * Extract text from runs.
- */
-export function extractText(runs) {
-    return runs.map(r => r.text).join('');
-}
-/**
- * Compute run-level diff between original and revised runs.
- *
- * Maps character-level diff back to run boundaries, splitting runs
- * when necessary.
- *
- * @param originalRuns - Runs from original paragraph
- * @param revisedRuns - Runs from revised paragraph
- * @returns Merged runs with revision markers
- */
-export function diffRuns(originalRuns, revisedRuns) {
-    const originalText = extractText(originalRuns);
-    const revisedText = extractText(revisedRuns);
-    // Compute character-level diff
-    const diffs = computeDiff(originalText, revisedText);
-    // Build merged runs with revision markers
-    const mergedRuns = [];
-    let originalOffset = 0;
-    let revisedOffset = 0;
-    for (const [op, text] of diffs) {
-        if (op === DIFF_EQUAL) {
-            // Equal text - use revised runs' formatting
-            const startPos = offsetToRunPosition(revisedRuns, revisedOffset);
-            const endPos = offsetToRunPosition(revisedRuns, revisedOffset + text.length);
-            // Extract runs that cover this range
-            for (let i = startPos.runIndex; i <= endPos.runIndex && i < revisedRuns.length; i++) {
-                const run = revisedRuns[i];
-                const runStart = i === startPos.runIndex ? startPos.charOffset : 0;
-                const runEnd = i === endPos.runIndex ? endPos.charOffset : run.text.length;
-                if (runEnd > runStart) {
-                    mergedRuns.push({
-                        text: run.text.slice(runStart, runEnd),
-                        start: revisedOffset + runStart,
-                        end: revisedOffset + runEnd,
-                        properties: run.properties,
-                    });
-                }
-            }
-            originalOffset += text.length;
-            revisedOffset += text.length;
-        }
-        else if (op === DIFF_DELETE) {
-            // Deleted text - use original runs' formatting, mark as deletion
-            const startPos = offsetToRunPosition(originalRuns, originalOffset);
-            const endPos = offsetToRunPosition(originalRuns, originalOffset + text.length);
-            for (let i = startPos.runIndex; i <= endPos.runIndex && i < originalRuns.length; i++) {
-                const run = originalRuns[i];
-                const runStart = i === startPos.runIndex ? startPos.charOffset : 0;
-                const runEnd = i === endPos.runIndex ? endPos.charOffset : run.text.length;
-                if (runEnd > runStart) {
-                    mergedRuns.push({
-                        text: run.text.slice(runStart, runEnd),
-                        start: originalOffset + runStart,
-                        end: originalOffset + runEnd,
-                        properties: run.properties,
-                        revision: {
-                            id: 0, // Will be assigned later
-                            author: '',
-                            date: new Date(),
-                            type: 'deletion',
-                        },
-                    });
-                }
-            }
-            originalOffset += text.length;
-        }
-        else if (op === DIFF_INSERT) {
-            // Inserted text - use revised runs' formatting, mark as insertion
-            const startPos = offsetToRunPosition(revisedRuns, revisedOffset);
-            const endPos = offsetToRunPosition(revisedRuns, revisedOffset + text.length);
-            for (let i = startPos.runIndex; i <= endPos.runIndex && i < revisedRuns.length; i++) {
-                const run = revisedRuns[i];
-                const runStart = i === startPos.runIndex ? startPos.charOffset : 0;
-                const runEnd = i === endPos.runIndex ? endPos.charOffset : run.text.length;
-                if (runEnd > runStart) {
-                    mergedRuns.push({
-                        text: run.text.slice(runStart, runEnd),
-                        start: revisedOffset + runStart,
-                        end: revisedOffset + runEnd,
-                        properties: run.properties,
-                        revision: {
-                            id: 0, // Will be assigned later
-                            author: '',
-                            date: new Date(),
-                            type: 'insertion',
-                        },
-                    });
-                }
-            }
-            revisedOffset += text.length;
-        }
-    }
-    return {
-        originalRuns,
-        revisedRuns,
-        mergedRuns,
-    };
-}
-/**
- * Count changes in a diff result.
- */
-export function countChanges(diffs) {
-    let insertions = 0;
-    let deletions = 0;
-    for (const [op, text] of diffs) {
-        if (op === DIFF_INSERT) {
-            insertions += text.length;
-        }
-        else if (op === DIFF_DELETE) {
-            deletions += text.length;
-        }
-    }
-    return { insertions, deletions };
-}
-//# sourceMappingURL=runDiff.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"runDiff.js","sourceRoot":"","sources":["../../../src/baselines/diffmatch/runDiff.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,cAAc,MAAM,kBAAkB,CAAC;AAG9C,iDAAiD;AACjD,MAAM,WAAW,GAAG,CAAC,CAAC,CAAC;AACvB,MAAM,WAAW,GAAG,CAAC,CAAC;AACtB,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB,gDAAgD;AAChD,MAAM,GAAG,GAAG,IAAI,cAAc,EAAE,CAAC;AAEjC,4DAA4D;AAC5D,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,oBAAoB;AAC1C,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,4BAA4B;AAEnD;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CACzB,QAAgB,EAChB,OAAe,EACf,eAAe,GAAG,IAAI;IAEtB,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAE/C,IAAI,eAAe,EAAE,CAAC;QACpB,GAAG,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,KAAiB,CAAC;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgB,EAAE,OAAe;IAC/D,yDAAyD;IACzD,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAY,EAAE;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;IACrC,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAExC,uEAAuE;IACvE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,aAAa,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;IAEnF,2CAA2C;IAC3C,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,GAAG,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAEhC,8BAA8B;IAC9B,OAAO,aAAa,CAAC,KAAK,EAAE,SAAS,CAAa,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CACpB,OAAiB,EACjB,OAAiB;IAEjB,MAAM,QAAQ,GAAwB,IAAI,GAAG,EAAE,CAAC;IAChD,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,MAAM,MAAM,GAAG,CAAC,MAAgB,EAAU,EAAE;QAC1C,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBACtC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;YACD,KAAK,IAAI,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAE/B,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CACpB,KAA8B,EAC9B,SAAmB;IAEnB,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;QAChC,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/C,CAAC;QACD,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,CAAC,IAAI,CAAC,CAAC,EAAgB,EAAE,IAAI,CAAC,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAUD;;GAEG;AACH,SAAS,mBAAmB,CAAC,IAAe,EAAE,MAAc;IAC1D,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACrB,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;QAElC,IAAI,SAAS,GAAG,SAAS,GAAG,MAAM,EAAE,CAAC;YACnC,OAAO;gBACL,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,MAAM,GAAG,SAAS;aAC/B,CAAC;QACJ,CAAC;QAED,SAAS,IAAI,SAAS,CAAC;IACzB,CAAC;IAED,2BAA2B;IAC3B,OAAO;QACL,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;QACzB,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC;KACpD,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAY,EAAE,MAAc;IACnD,MAAM,MAAM,GAAY;QACtB,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC;QAC/B,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,GAAG,EAAE,GAAG,CAAC,KAAK,GAAG,MAAM;QACvB,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS;KAC/D,CAAC;IAEF,MAAM,KAAK,GAAY;QACrB,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,KAAK,EAAE,GAAG,CAAC,KAAK,GAAG,MAAM;QACzB,GAAG,EAAE,GAAG,CAAC,GAAG;QACZ,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS;KAC/D,CAAC;IAEF,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,IAAe;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CACtB,YAAuB,EACvB,WAAsB;IAEtB,MAAM,YAAY,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IAC/C,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;IAE7C,+BAA+B;IAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;IAErD,0CAA0C;IAC1C,MAAM,UAAU,GAAc,EAAE,CAAC;IACjC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/B,IAAI,EAAE,KAAK,UAAU,EAAE,CAAC;YACtB,4CAA4C;YAC5C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;YACjE,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAE7E,qCAAqC;YACrC,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpF,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,CAAC,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,CAAC,KAAK,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAE3E,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;oBACtB,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC;wBACtC,KAAK,EAAE,aAAa,GAAG,QAAQ;wBAC/B,GAAG,EAAE,aAAa,GAAG,MAAM;wBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;qBAC3B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,cAAc,IAAI,IAAI,CAAC,MAAM,CAAC;YAC9B,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC;QAC/B,CAAC;aAAM,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;YAC9B,iEAAiE;YACjE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;YACnE,MAAM,MAAM,GAAG,mBAAmB,CAAC,YAAY,EAAE,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAE/E,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrF,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAE,CAAC;gBAC7B,MAAM,QAAQ,GAAG,CAAC,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,CAAC,KAAK,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAE3E,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;oBACtB,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC;wBACtC,KAAK,EAAE,cAAc,GAAG,QAAQ;wBAChC,GAAG,EAAE,cAAc,GAAG,MAAM;wBAC5B,UAAU,EAAE,GAAG,CAAC,UAAU;wBAC1B,QAAQ,EAAE;4BACR,EAAE,EAAE,CAAC,EAAE,yBAAyB;4BAChC,MAAM,EAAE,EAAE;4BACV,IAAI,EAAE,IAAI,IAAI,EAAE;4BAChB,IAAI,EAAE,UAAU;yBACjB;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,cAAc,IAAI,IAAI,CAAC,MAAM,CAAC;QAChC,CAAC;aAAM,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;YAC9B,kEAAkE;YAClE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;YACjE,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAE7E,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpF,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,CAAC,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,CAAC,KAAK,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAE3E,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;oBACtB,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC;wBACtC,KAAK,EAAE,aAAa,GAAG,QAAQ;wBAC/B,GAAG,EAAE,aAAa,GAAG,MAAM;wBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;wBAC1B,QAAQ,EAAE;4BACR,EAAE,EAAE,CAAC,EAAE,yBAAyB;4BAChC,MAAM,EAAE,EAAE;4BACV,IAAI,EAAE,IAAI,IAAI,EAAE;4BAChB,IAAI,EAAE,WAAW;yBAClB;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO;QACL,YAAY;QACZ,WAAW;QACX,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,KAAe;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/B,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;YACvB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;aAAM,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;YAC9B,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AACnC,CAAC"}