@heyhuynhgiabuu/pi-diff 0.5.5 → 0.6.1

package/dist/core/replace.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Cascading text replacement engine for LLM edit tools.
+ *
+ * When an LLM calls the edit tool with oldString + newString, the oldString
+ * often doesn't match exactly due to:
+ *   - Whitespace differences (indentation, trailing spaces)
+ *   - Escape sequences (LLMs escaping \n, \t, quotes in tool call params)
+ *   - Minor formatting drift (tabs vs spaces, trimmed lines)
+ *
+ * This module provides a cascade of replacer strategies, each progressively
+ * more lenient. The first strategy that finds exactly one match wins.
+ * If multiple candidates exist for a fuzzy strategy, we reject (safety first).
+ *
+ * Design inspired by OpenCode's edit tool (anomalyco/opencode) and
+ * Cline's diff-apply evals, but restructured for independent use.
+ */
+export interface ReplaceResult {
+    /** The resulting content after replacement (unchanged if no match). */
+    content: string;
+    /** Whether a replacement was made. */
+    changed: boolean;
+    /** Name of the replacer strategy that matched, or "none". */
+    strategy: string;
+    /** Number of occurrences replaced (only when changed=true). */
+    count: number;
+}
+/**
+ * Replace oldString with newString in content using a cascade of matching
+ * strategies. Tries exact match first, then progressively relaxes matching
+ * rules. If no strategy finds a match, returns unchanged content.
+ *
+ * Safety: if a fuzzy strategy finds multiple candidates, it is skipped
+ * (we never auto-pick among ambiguous matches). Only exact matches
+ * (SimpleReplacer) are allowed to match multiple occurrences, and only
+ * when replaceAll=true.
+ *
+ * @param content - The full file content to edit.
+ * @param oldString - The text to find and replace.
+ * @param newString - The replacement text.
+ * @param options.replaceAll - When true, replace ALL non-overlapping
+ *   occurrences. Only safe for exact matches (simple replacer).
+ * @returns ReplaceResult with the new content and match strategy info.
+ */
+export declare function replace(content: string, oldString: string, newString: string, options?: {
+    replaceAll?: boolean;
+}): ReplaceResult;
+//# sourceMappingURL=replace.d.ts.map

package/dist/core/replace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replace.d.ts","sourceRoot":"","sources":["../../src/core/replace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH,MAAM,WAAW,aAAa;IAC7B,uEAAuE;IACvE,OAAO,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,OAAO,EAAE,OAAO,CAAC;IACjB,6DAA6D;IAC7D,QAAQ,EAAE,MAAM,CAAC;IACjB,+DAA+D;IAC/D,KAAK,EAAE,MAAM,CAAC;CACd;AAwZD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,OAAO,CACtB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,OAAO,CAAA;CAAE,GAChC,aAAa,CAqFf"}

package/dist/core/replace.js

@@ -0,0 +1,496 @@
+/**
+ * Cascading text replacement engine for LLM edit tools.
+ *
+ * When an LLM calls the edit tool with oldString + newString, the oldString
+ * often doesn't match exactly due to:
+ *   - Whitespace differences (indentation, trailing spaces)
+ *   - Escape sequences (LLMs escaping \n, \t, quotes in tool call params)
+ *   - Minor formatting drift (tabs vs spaces, trimmed lines)
+ *
+ * This module provides a cascade of replacer strategies, each progressively
+ * more lenient. The first strategy that finds exactly one match wins.
+ * If multiple candidates exist for a fuzzy strategy, we reject (safety first).
+ *
+ * Design inspired by OpenCode's edit tool (anomalyco/opencode) and
+ * Cline's diff-apply evals, but restructured for independent use.
+ */
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+function countOccurrences(content, substring) {
+    if (substring.length === 0)
+        return 0;
+    let count = 0;
+    let pos = 0;
+    while (true) {
+        pos = content.indexOf(substring, pos);
+        if (pos === -1)
+            break;
+        count++;
+        pos += substring.length;
+    }
+    return count;
+}
+/** Levenshtein distance for block anchor similarity comparison. */
+function levenshtein(a, b) {
+    if (a === "" || b === "")
+        return Math.max(a.length, b.length);
+    const matrix = Array.from({ length: a.length + 1 }, (_, i) => Array.from({ length: b.length + 1 }, (_, j) => (i === 0 ? j : j === 0 ? i : 0)));
+    for (let i = 1; i <= a.length; i++) {
+        for (let j = 1; j <= b.length; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            matrix[i][j] = Math.min(matrix[i - 1][j] + 1, matrix[i][j - 1] + 1, matrix[i - 1][j - 1] + cost);
+        }
+    }
+    return matrix[a.length][b.length];
+}
+// ---------------------------------------------------------------------------
+// Replacers (in priority order)
+// ---------------------------------------------------------------------------
+/**
+ * 1. Simple exact match.
+ */
+const SimpleReplacer = function* (content, find) {
+    if (content.includes(find))
+        yield find;
+};
+/**
+ * 2. Escape-normalized match — unescapes common escape sequences
+ * in the find string before matching. Handles LLMs that escape
+ * tool call parameters (\\n, \\t, \\", etc.).
+ *
+ * Runs early (after Simple) so unescaped content flows through
+ * line-level strategies (LineTrimmed, BlockAnchor) correctly.
+ * Inspired by OpenCode's EscapeNormalizedReplacer.
+ */
+const EscapeNormalizedReplacer = function* (content, find) {
+    const unescapeStr = (str) => {
+        return str.replace(/\\([nrt'"`\\$])/g, (_match, char) => {
+            switch (char) {
+                case "n":
+                    return "\n";
+                case "t":
+                    return "\t";
+                case "r":
+                    return "\r";
+                case "'":
+                    return "'";
+                case '"':
+                    return '"';
+                case "`":
+                    return "`";
+                case "\\":
+                    return "\\";
+                case "$":
+                    return "$";
+                default:
+                    return char;
+            }
+        });
+    };
+    const unescaped = unescapeStr(find);
+    if (unescaped === find)
+        return; // nothing was escaped, skip
+    if (unescaped.length === 0)
+        return;
+    // Yield the unescaped string if found directly in content
+    if (content.includes(unescaped)) {
+        yield unescaped;
+        return;
+    }
+    // Fallback: find matching blocks in content
+    const contentLines = content.split("\n");
+    const findLines = unescaped.split("\n");
+    for (let i = 0; i <= contentLines.length - findLines.length; i++) {
+        const block = contentLines.slice(i, i + findLines.length).join("\n");
+        if (block === unescaped || block.trim() === unescaped.trim()) {
+            yield block;
+            return;
+        }
+    }
+};
+/**
+ * 3. Line-trimmed match — compares lines after trimming whitespace.
+ * Handles cases where indentation or trailing whitespace differs.
+ */
+const LineTrimmedReplacer = function* (content, find) {
+    const contentLines = content.split("\n");
+    const findLines = find.split("\n");
+    // Remove trailing empty line from find if present
+    if (findLines.length > 1 && findLines[findLines.length - 1] === "") {
+        findLines.pop();
+    }
+    if (findLines.length > contentLines.length)
+        return;
+    for (let i = 0; i <= contentLines.length - findLines.length; i++) {
+        let matches = true;
+        for (let j = 0; j < findLines.length; j++) {
+            if (contentLines[i + j].trim() !== findLines[j].trim()) {
+                matches = false;
+                break;
+            }
+        }
+        if (matches) {
+            // Compute the actual substring in the original content
+            let startPos = 0;
+            for (let k = 0; k < i; k++) {
+                startPos += contentLines[k].length + 1;
+            }
+            let endPos = startPos;
+            for (let k = 0; k < findLines.length; k++) {
+                endPos += contentLines[i + k].length;
+                if (k < findLines.length - 1)
+                    endPos += 1;
+            }
+            yield content.slice(startPos, endPos);
+        }
+    }
+};
+/**
+ * 4. Block anchor match — uses first and last lines as anchors,
+ * then compares middle lines with Levenshtein similarity.
+ * Requires at least 3 lines in the find string.
+ *
+ * Dual threshold: single candidates get a lower bar (anchors alone
+ * are strong evidence), multiple candidates need higher similarity
+ * to disambiguate. Inspired by OpenCode's BlockAnchorReplacer.
+ */
+const BlockAnchorReplacer = function* (content, find) {
+    const contentLines = content.split("\n");
+    const findLines = find.split("\n");
+    // Need at least 3 lines for meaningful anchor matching
+    if (findLines.length < 3)
+        return;
+    if (findLines[findLines.length - 1] === "")
+        findLines.pop();
+    if (findLines.length < 3)
+        return;
+    const firstAnchor = findLines[0].trim();
+    const lastAnchor = findLines[findLines.length - 1].trim();
+    const searchBlockSize = findLines.length;
+    const SINGLE_CANDIDATE_THRESHOLD = 0.25;
+    const MULTIPLE_CANDIDATES_THRESHOLD = 0.4;
+    // Collect candidate positions where both anchors match
+    const candidates = [];
+    for (let i = 0; i < contentLines.length; i++) {
+        if (contentLines[i].trim() !== firstAnchor)
+            continue;
+        // Look for matching last line after this first line
+        for (let j = i + 2; j < contentLines.length; j++) {
+            if (contentLines[j].trim() === lastAnchor) {
+                candidates.push({ startLine: i, endLine: j });
+                break;
+            }
+        }
+    }
+    if (candidates.length === 0)
+        return;
+    // Score each candidate by Levenshtein similarity
+    // Single candidate: relaxed threshold (anchors provide strong signal)
+    // Multiple candidates: require higher similarity to disambiguate
+    const isSingleCandidate = candidates.length === 1;
+    const threshold = isSingleCandidate ? SINGLE_CANDIDATE_THRESHOLD : MULTIPLE_CANDIDATES_THRESHOLD;
+    if (isSingleCandidate) {
+        const { startLine, endLine } = candidates[0];
+        const actualBlockSize = endLine - startLine + 1;
+        const middleCount = Math.min(searchBlockSize - 2, actualBlockSize - 2);
+        let similarity = 0;
+        if (middleCount > 0) {
+            for (let j = 1; j <= middleCount; j++) {
+                const originalLine = contentLines[startLine + j].trim();
+                const searchLine = findLines[j].trim();
+                const maxLen = Math.max(originalLine.length, searchLine.length);
+                if (maxLen === 0)
+                    continue;
+                const distance = levenshtein(originalLine, searchLine);
+                similarity += 1 - distance / maxLen;
+            }
+            similarity /= middleCount;
+        }
+        else {
+            // No middle lines — anchors alone suffice
+            similarity = 1;
+        }
+        if (similarity >= threshold) {
+            let startPos = 0;
+            for (let k = 0; k < startLine; k++)
+                startPos += contentLines[k].length + 1;
+            let endPos = startPos;
+            for (let k = startLine; k <= endLine; k++) {
+                endPos += contentLines[k].length;
+                if (k < endLine)
+                    endPos += 1;
+            }
+            yield content.slice(startPos, endPos);
+        }
+        return;
+    }
+    // Multiple candidates: pick best match above higher threshold
+    let bestMatch = null;
+    let bestSimilarity = -1;
+    for (const candidate of candidates) {
+        const { startLine, endLine } = candidate;
+        const actualBlockSize = endLine - startLine + 1;
+        const middleCount = Math.min(searchBlockSize - 2, actualBlockSize - 2);
+        let similarity = 0;
+        if (middleCount > 0) {
+            for (let j = 1; j <= middleCount; j++) {
+                const originalLine = contentLines[startLine + j].trim();
+                const searchLine = findLines[j].trim();
+                const maxLen = Math.max(originalLine.length, searchLine.length);
+                if (maxLen === 0)
+                    continue;
+                const distance = levenshtein(originalLine, searchLine);
+                similarity += 1 - distance / maxLen;
+            }
+            similarity /= middleCount;
+        }
+        else {
+            similarity = 1;
+        }
+        if (similarity > bestSimilarity) {
+            bestSimilarity = similarity;
+            bestMatch = candidate;
+        }
+    }
+    if (!bestMatch || bestSimilarity < threshold)
+        return;
+    // Yield the actual content substring
+    const { startLine, endLine } = bestMatch;
+    let startPos = 0;
+    for (let k = 0; k < startLine; k++) {
+        startPos += contentLines[k].length + 1;
+    }
+    let endPos = startPos;
+    for (let k = startLine; k <= endLine; k++) {
+        endPos += contentLines[k].length;
+        if (k < endLine)
+            endPos += 1;
+    }
+    yield content.slice(startPos, endPos);
+};
+/**
+ * 5. Whitespace-normalized match — collapses all whitespace runs
+ * to single spaces and trims. Handles any whitespace differences.
+ */
+const WhitespaceNormalizedReplacer = function* (content, find) {
+    const normalize = (text) => text.replace(/\s+/g, " ").trim();
+    const normalizedFind = normalize(find);
+    if (normalizedFind.length === 0)
+        return;
+    const contentLines = content.split("\n");
+    const findLines = find.split("\n");
+    // Single-line: find by normalized line content
+    if (findLines.length <= 1 || (findLines.length === 2 && findLines[1] === "")) {
+        for (let i = 0; i < contentLines.length; i++) {
+            if (normalize(contentLines[i]) === normalizedFind) {
+                yield contentLines[i];
+            }
+        }
+        return;
+    }
+    // Multi-line: find blocks where normalized content matches
+    const effectiveFindLines = findLines[findLines.length - 1] === "" ? findLines.slice(0, -1) : findLines;
+    for (let i = 0; i <= contentLines.length - effectiveFindLines.length; i++) {
+        const block = contentLines.slice(i, i + effectiveFindLines.length);
+        if (normalize(block.join("\n")) === normalizedFind) {
+            yield block.join("\n");
+        }
+    }
+};
+/**
+ * 6. Indentation-flexible match — strips common leading indentation
+ * before comparing. Handles blocks that shifted indent level.
+ * NOTE: Excluded from the REPLACERS cascade — LineTrimmedReplacer's
+ * per-line trim() is a superset. Kept here as documentation artifact.
+ */
+const IndentationFlexibleReplacer = function* (content, find) {
+    const removeIndent = (text) => {
+        const lines = text.split("\n");
+        const nonEmpty = lines.filter((l) => l.trim().length > 0);
+        if (nonEmpty.length === 0)
+            return text;
+        const minIndent = Math.min(...nonEmpty.map((l) => {
+            const m = l.match(/^(\s*)/);
+            return m ? m[1].length : 0;
+        }));
+        return lines.map((l) => (l.trim().length === 0 ? l : l.slice(minIndent))).join("\n");
+    };
+    const normalizedFind = removeIndent(find);
+    if (normalizedFind.length === 0)
+        return;
+    const contentLines = content.split("\n");
+    const findLines = find.split("\n");
+    const effectiveFindLines = findLines[findLines.length - 1] === "" ? findLines.slice(0, -1) : findLines;
+    for (let i = 0; i <= contentLines.length - effectiveFindLines.length; i++) {
+        const block = contentLines.slice(i, i + effectiveFindLines.length).join("\n");
+        if (removeIndent(block) === normalizedFind) {
+            yield block;
+        }
+    }
+};
+/**
+ * 7. Trimmed-boundary match — trims leading/trailing whitespace
+ * from the find string before matching. Handles accidental
+ * whitespace at boundaries.
+ */
+const TrimmedBoundaryReplacer = function* (content, find) {
+    const trimmed = find.trim();
+    if (trimmed === find || trimmed.length === 0)
+        return;
+    if (content.includes(trimmed)) {
+        yield trimmed;
+        return;
+    }
+    // Fallback: find blocks where the trimmed version matches
+    const contentLines = content.split("\n");
+    const findLines = find.split("\n");
+    for (let i = 0; i <= contentLines.length - findLines.length; i++) {
+        const block = contentLines.slice(i, i + findLines.length).join("\n");
+        if (block.trim() === trimmed) {
+            yield block;
+            return;
+        }
+    }
+};
+/**
+ * 8. Multi-occurrence replacer — yields ALL exact matches.
+ * NOTE: Excluded from the REPLACERS cascade because replaceAll is
+ * handled directly in the public `replace()` fast path for exact
+ * matches. Fuzzy-strategy replaceAll would be unsafe (ambiguous).
+ * Kept here as documentation artifact.
+ */
+const MultiOccurrenceReplacer = function* (content, find) {
+    if (find.length === 0)
+        return;
+    let pos = 0;
+    while (true) {
+        const idx = content.indexOf(find, pos);
+        if (idx === -1)
+            break;
+        yield find;
+        pos = idx + find.length;
+    }
+};
+/**
+ * 9. Context-aware match — uses first and last lines as context
+ * anchors, then checks trimmed-line similarity (50%) for middle
+ * lines. Simpler than BlockAnchor (no Levenshtein).
+ * NOTE: Excluded from the REPLACERS cascade — BlockAnchorReplacer's
+ * Levenshtein-based scoring subsumes this. Kept as documentation.
+ */
+const ContextAwareReplacer = function* (_content, _find) {
+    // Reference implementation in OpenCode:
+    // https://github.com/anomalyco/opencode/blob/dev/packages/opencode/src/tool/edit.ts
+};
+// ---------------------------------------------------------------------------
+// All replacers in priority order (active members)
+// ---------------------------------------------------------------------------
+const REPLACERS = [
+    SimpleReplacer,
+    EscapeNormalizedReplacer,
+    LineTrimmedReplacer,
+    BlockAnchorReplacer,
+    WhitespaceNormalizedReplacer,
+    TrimmedBoundaryReplacer,
+];
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Replace oldString with newString in content using a cascade of matching
+ * strategies. Tries exact match first, then progressively relaxes matching
+ * rules. If no strategy finds a match, returns unchanged content.
+ *
+ * Safety: if a fuzzy strategy finds multiple candidates, it is skipped
+ * (we never auto-pick among ambiguous matches). Only exact matches
+ * (SimpleReplacer) are allowed to match multiple occurrences, and only
+ * when replaceAll=true.
+ *
+ * @param content - The full file content to edit.
+ * @param oldString - The text to find and replace.
+ * @param newString - The replacement text.
+ * @param options.replaceAll - When true, replace ALL non-overlapping
+ *   occurrences. Only safe for exact matches (simple replacer).
+ * @returns ReplaceResult with the new content and match strategy info.
+ */
+export function replace(content, oldString, newString, options) {
+    if (oldString.length === 0) {
+        return { content, changed: false, strategy: "none", count: 0 };
+    }
+    if (oldString === newString) {
+        return { content, changed: false, strategy: "none", count: 0 };
+    }
+    const replaceAll = options?.replaceAll ?? false;
+    // Fast path: simple exact match with replaceAll
+    if (replaceAll && content.includes(oldString)) {
+        const result = content.replaceAll(oldString, newString);
+        if (result !== content) {
+            const count = countOccurrences(content, oldString);
+            return { content: result, changed: true, strategy: "simple-replaceAll", count };
+        }
+    }
+    // Fast path: single exact match
+    if (!replaceAll) {
+        const idx = content.indexOf(oldString);
+        if (idx !== -1) {
+            const lastIdx = content.lastIndexOf(oldString);
+            if (idx === lastIdx) {
+                // Exactly one occurrence
+                const result = content.slice(0, idx) + newString + content.slice(idx + oldString.length);
+                return { content: result, changed: true, strategy: "simple", count: 1 };
+            }
+            // Multiple occurrences — fall through to fuzzy strategies
+            // (we never auto-pick among duplicates)
+        }
+    }
+    // Run through each replacer strategy in priority order
+    for (const replacer of REPLACERS) {
+        // Skip SimpleReplacer — already handled above
+        if (replacer === SimpleReplacer)
+            continue;
+        const candidates = [];
+        for (const candidate of replacer(content, oldString)) {
+            candidates.push(candidate);
+        }
+        if (candidates.length === 0)
+            continue;
+        if (replaceAll) {
+            // For replaceAll, use all candidates
+            let result = content;
+            let totalCount = 0;
+            for (const candidate of candidates) {
+                const count = countOccurrences(result, candidate);
+                if (count > 0) {
+                    result = result.replaceAll(candidate, newString);
+                    totalCount += count;
+                }
+            }
+            if (totalCount > 0) {
+                const strategyName = replacer.name
+                    .replace("Replacer", "")
+                    .replace(/([a-z])([A-Z])/g, "$1-$2")
+                    .toLowerCase();
+                return { content: result, changed: true, strategy: `${strategyName}-replaceAll`, count: totalCount };
+            }
+            continue;
+        }
+        // Single replacement: must have exactly one candidate
+        if (candidates.length === 1) {
+            const candidate = candidates[0];
+            const idx = content.indexOf(candidate);
+            if (idx !== -1) {
+                const result = content.slice(0, idx) + newString + content.slice(idx + candidate.length);
+                const strategyName = replacer.name
+                    .replace("Replacer", "")
+                    .replace(/([a-z])([A-Z])/g, "$1-$2")
+                    .toLowerCase();
+                return { content: result, changed: true, strategy: strategyName, count: 1 };
+            }
+        }
+        // Multiple candidates — skip this strategy (safety first)
+    }
+    // No match found
+    return { content, changed: false, strategy: "none", count: 0 };
+}
+//# sourceMappingURL=replace.js.map

package/dist/core/replace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replace.js","sourceRoot":"","sources":["../../src/core/replace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAwBH,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,gBAAgB,CAAC,OAAe,EAAE,SAAiB;IAC3D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACrC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,IAAI,EAAE,CAAC;QACb,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,MAAM;QACtB,KAAK,EAAE,CAAC;QACR,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,mEAAmE;AACnE,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACxC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC5D,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC/E,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAClG,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E;;GAEG;AACH,MAAM,cAAc,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACxD,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,CAAC;AACxC,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,wBAAwB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IAClE,MAAM,WAAW,GAAG,CAAC,GAAW,EAAU,EAAE;QAC3C,OAAO,GAAG,CAAC,OAAO,CAAC,kBAAkB,EAAE,CAAC,MAAc,EAAE,IAAY,EAAE,EAAE;YACvE,QAAQ,IAAI,EAAE,CAAC;gBACd,KAAK,GAAG;oBACP,OAAO,IAAI,CAAC;gBACb,KAAK,GAAG;oBACP,OAAO,IAAI,CAAC;gBACb,KAAK,GAAG;oBACP,OAAO,IAAI,CAAC;gBACb,KAAK,GAAG;oBACP,OAAO,GAAG,CAAC;gBACZ,KAAK,GAAG;oBACP,OAAO,GAAG,CAAC;gBACZ,KAAK,GAAG;oBACP,OAAO,GAAG,CAAC;gBACZ,KAAK,IAAI;oBACR,OAAO,IAAI,CAAC;gBACb,KAAK,GAAG;oBACP,OAAO,GAAG,CAAC;gBACZ;oBACC,OAAO,IAAI,CAAC;YACd,CAAC;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,SAAS,KAAK,IAAI;QAAE,OAAO,CAAC,4BAA4B;IAC5D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEnC,0DAA0D;IAC1D,IAAI,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACjC,MAAM,SAAS,CAAC;QAChB,OAAO;IACR,CAAC;IAED,4CAA4C;IAC5C,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9D,MAAM,KAAK,CAAC;YACZ,OAAO;QACR,CAAC;IACF,CAAC;AACF,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,mBAAmB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IAC7D,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEnC,kDAAkD;IAClD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QACpE,SAAS,CAAC,GAAG,EAAE,CAAC;IACjB,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM;QAAE,OAAO;IAEnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClE,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACxD,OAAO,GAAG,KAAK,CAAC;gBAChB,MAAM;YACP,CAAC;QACF,CAAC;QACD,IAAI,OAAO,EAAE,CAAC;YACb,uDAAuD;YACvD,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,QAAQ,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACxC,CAAC;YACD,IAAI,MAAM,GAAG,QAAQ,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;gBACrC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,MAAM,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;IACF,CAAC;AACF,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,mBAAmB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IAC7D,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEnC,uDAAuD;IACvD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO;IAEjC,IAAI,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE;QAAE,SAAS,CAAC,GAAG,EAAE,CAAC;IAC5D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO;IAEjC,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1D,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;IACzC,MAAM,0BAA0B,GAAG,IAAI,CAAC;IACxC,MAAM,6BAA6B,GAAG,GAAG,CAAC;IAE1C,uDAAuD;IACvD,MAAM,UAAU,GAAkD,EAAE,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,WAAW;YAAE,SAAS;QACrD,oDAAoD;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,UAAU,EAAE,CAAC;gBAC3C,UAAU,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM;YACP,CAAC;QACF,CAAC;IACF,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEpC,iDAAiD;IACjD,sEAAsE;IACtE,iEAAiE;IACjE,MAAM,iBAAiB,GAAG,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,6BAA6B,CAAC;IAEjG,IAAI,iBAAiB,EAAE,CAAC;QACvB,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,eAAe,GAAG,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;QACvE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,YAAY,GAAG,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACxD,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChE,IAAI,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAC3B,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;gBACvD,UAAU,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;YACrC,CAAC;YACD,UAAU,IAAI,WAAW,CAAC;QAC3B,CAAC;aAAM,CAAC;YACP,0CAA0C;YAC1C,UAAU,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;gBAAE,QAAQ,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YAC3E,IAAI,MAAM,GAAG,QAAQ,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACjC,IAAI,CAAC,GAAG,OAAO;oBAAE,MAAM,IAAI,CAAC,CAAC;YAC9B,CAAC;YACD,MAAM,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,OAAO;IACR,CAAC;IAED,8DAA8D;IAC9D,IAAI,SAAS,GAAkD,IAAI,CAAC;IACpE,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;IACxB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC;QACzC,MAAM,eAAe,GAAG,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;QACvE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,YAAY,GAAG,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACxD,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChE,IAAI,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAC3B,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;gBACvD,UAAU,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;YACrC,CAAC;YACD,UAAU,IAAI,WAAW,CAAC;QAC3B,CAAC;aAAM,CAAC;YACP,UAAU,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;YACjC,cAAc,GAAG,UAAU,CAAC;YAC5B,SAAS,GAAG,SAAS,CAAC;QACvB,CAAC;IACF,CAAC;IACD,IAAI,CAAC,SAAS,IAAI,cAAc,GAAG,SAAS;QAAE,OAAO;IAErD,qCAAqC;IACrC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC;IACzC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,QAAQ,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,GAAG,OAAO;YAAE,MAAM,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,MAAM,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,4BAA4B,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACtE,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACrE,MAAM,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAEvC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IACxC,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEnC,+CAA+C;IAC/C,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;QAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,cAAc,EAAE,CAAC;gBACnD,MAAM,YAAY,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;QACF,CAAC;QACD,OAAO;IACR,CAAC;IAED,2DAA2D;IAC3D,MAAM,kBAAkB,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3E,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACnE,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,cAAc,EAAE,CAAC;YACpD,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACF,CAAC;AACF,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,2BAA2B,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACrE,MAAM,YAAY,GAAG,CAAC,IAAY,EAAU,EAAE;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CACzB,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC5B,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CACF,CAAC;QACF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtF,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAC1C,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAExC,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,kBAAkB,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEvG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3E,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9E,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,cAAc,EAAE,CAAC;YAC5C,MAAM,KAAK,CAAC;QACb,CAAC;IACF,CAAC;AACF,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,uBAAuB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACjE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAErD,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/B,MAAM,OAAO,CAAC;QACd,OAAO;IACR,CAAC;IAED,0DAA0D;IAC1D,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,OAAO,EAAE,CAAC;YAC9B,MAAM,KAAK,CAAC;YACZ,OAAO;QACR,CAAC;IACF,CAAC;AACF,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,uBAAuB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACjE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,IAAI,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACvC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,MAAM;QACtB,MAAM,IAAI,CAAC;QACX,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACzB,CAAC;AACF,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,oBAAoB,GAAa,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK;IAChE,wCAAwC;IACxC,oFAAoF;AACrF,CAAC,CAAC;AAEF,8EAA8E;AAC9E,mDAAmD;AACnD,8EAA8E;AAE9E,MAAM,SAAS,GAAe;IAC7B,cAAc;IACd,wBAAwB;IACxB,mBAAmB;IACnB,mBAAmB;IACnB,4BAA4B;IAC5B,uBAAuB;CACvB,CAAC;AAEF,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,OAAO,CACtB,OAAe,EACf,SAAiB,EACjB,SAAiB,EACjB,OAAkC;IAElC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAChE,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAChE,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,KAAK,CAAC;IAEhD,gDAAgD;IAChD,IAAI,UAAU,IAAI,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxD,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YACnD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,mBAAmB,EAAE,KAAK,EAAE,CAAC;QACjF,CAAC;IACF,CAAC;IAED,gCAAgC;IAChC,IAAI,CAAC,UAAU,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACvC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YAC/C,IAAI,GAAG,KAAK,OAAO,EAAE,CAAC;gBACrB,yBAAyB;gBACzB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;gBACzF,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACzE,CAAC;YACD,0DAA0D;YAC1D,wCAAwC;QACzC,CAAC;IACF,CAAC;IAED,uDAAuD;IACvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAClC,8CAA8C;QAC9C,IAAI,QAAQ,KAAK,cAAc;YAAE,SAAS;QAE1C,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;YACtD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEtC,IAAI,UAAU,EAAE,CAAC;YAChB,qCAAqC;YACrC,IAAI,MAAM,GAAG,OAAO,CAAC;YACrB,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACpC,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAClD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACf,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACjD,UAAU,IAAI,KAAK,CAAC;gBACrB,CAAC;YACF,CAAC;YACD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI;qBAChC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;qBACvB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;qBACnC,WAAW,EAAE,CAAC;gBAChB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,YAAY,aAAa,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;YACtG,CAAC;YACD,SAAS;QACV,CAAC;QAED,sDAAsD;QACtD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACvC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBAChB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;gBACzF,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI;qBAChC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;qBACvB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;qBACnC,WAAW,EAAE,CAAC;gBAChB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC7E,CAAC;QACF,CAAC;QACD,0DAA0D;IAC3D,CAAC;IAED,iBAAiB;IACjB,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAChE,CAAC"}

package/dist/index.d.ts

@@ -20,9 +20,10 @@
  *   • Large-diff fallback (skip highlighting, still show diff)
  *   • Async rendering with invalidate() for non-blocking preview
  */
-import type { BundledLanguage } from "shiki";
-import { computeHunkBlocks, type ParsedDiff, getSepStyle, parseDiff, parsePatchFiles, resolveSepStyle } from "./core/diff.js";
 import type { ExtensionAPI } from "@earendil-works/pi-coding-agent";
+import { codeToANSI } from "@shikijs/cli";
+import { computeHunkBlocks, getSepStyle, type ParsedDiff, parseDiff, parsePatchFiles, resolveSepStyle } from "./core/diff.js";
+type BundledLanguage = Parameters<typeof codeToANSI>[1];
 /** Resolved ANSI colors for diff rendering — theme overrides hardcoded defaults. */
 interface DiffColors {
     fgAdd: string;

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAOH,OAAO,KAAK,EAAE,eAAe,EAAgB,MAAM,OAAO,CAAC;AAG3D,OAAO,EAAE,iBAAiB,EAAiB,KAAK,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,EAAE,eAAe,EAAkC,MAAM,gBAAgB,CAAC;AAE7K,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AA8cpE,oFAAoF;AACpF,UAAU,UAAU;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACd;AAuKD,iBAAS,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAIpD;AAuVD,iBAAe,aAAa,CAC3B,IAAI,EAAE,UAAU,EAChB,QAAQ,EAAE,eAAe,GAAG,SAAS,EACrC,GAAG,SAAmB,EACtB,EAAE,GAAE,UAAgC,GAClC,OAAO,CAAC,MAAM,CAAC,CA6HjB;AAMD,iBAAe,WAAW,CACzB,IAAI,EAAE,UAAU,EAChB,QAAQ,EAAE,eAAe,GAAG,SAAS,EACrC,GAAG,SAAoB,EACvB,EAAE,GAAE,UAAgC,GAClC,OAAO,CAAC,MAAM,CAAC,CAkKjB;AAMD,eAAO,MAAM,SAAS;;;;;;;;;CASrB,CAAC;AAIF,wBAA8B,qBAAqB,CAAC,EAAE,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CA4gBnF"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAEpE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAG1C,OAAO,EACL,iBAAiB,EAEjB,WAAW,EACX,KAAK,UAAU,EACf,SAAS,EACT,eAAe,EACf,eAAe,EAGhB,MAAM,gBAAgB,CAAC;AAaxB,KAAK,eAAe,GAAG,UAAU,CAAC,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAgdxD,oFAAoF;AACpF,UAAU,UAAU;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAuKD,iBAAS,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAIpD;AA6VD,iBAAe,aAAa,CAC1B,IAAI,EAAE,UAAU,EAChB,QAAQ,EAAE,eAAe,GAAG,SAAS,EACrC,GAAG,SAAmB,EACtB,EAAE,GAAE,UAAgC,GACnC,OAAO,CAAC,MAAM,CAAC,CA8HjB;AAMD,iBAAe,WAAW,CACxB,IAAI,EAAE,UAAU,EAChB,QAAQ,EAAE,eAAe,GAAG,SAAS,EACrC,GAAG,SAAoB,EACvB,EAAE,GAAE,UAAgC,GACnC,OAAO,CAAC,MAAM,CAAC,CAmLjB;AAMD,eAAO,MAAM,SAAS;;;;;;;;;CASrB,CAAC;AAEF,wBAA8B,qBAAqB,CAAC,EAAE,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAoxBnF"}