gsd-pi 2.8.3 → 2.10.0

package/node_modules/@gsd/pi-coding-agent/dist/core/tools/hashline.js

@@ -0,0 +1,522 @@
+/**
+ * Hashline edit mode — a line-addressable edit format using content-hash anchors.
+ *
+ * Each line in a file is identified by its 1-indexed line number and a short
+ * hash derived from the normalized line text (xxHash32, truncated to 2 chars
+ * from a custom nibble alphabet).
+ *
+ * The combined `LINE#ID` reference acts as both an address and a staleness check:
+ * if the file has changed since the caller last read it, hash mismatches are caught
+ * before any mutation occurs.
+ *
+ * Displayed format: `LINENUM#HASH:TEXT`
+ * Reference format: `"LINENUM#HASH"` (e.g. `"5#QQ"`)
+ *
+ * Adapted from Oh My Pi's hashline implementation for Node.js (no Bun dependency).
+ */
+// ═══════════════════════════════════════════════════════════════════════════
+// xxHash32 — pure JS implementation (no native dependencies)
+// ═══════════════════════════════════════════════════════════════════════════
+const PRIME32_1 = 0x9e3779b1;
+const PRIME32_2 = 0x85ebca77;
+const PRIME32_3 = 0xc2b2ae3d;
+const PRIME32_4 = 0x27d4eb2f;
+const PRIME32_5 = 0x165667b1;
+function rotl32(val, bits) {
+    return ((val << bits) | (val >>> (32 - bits))) >>> 0;
+}
+function imul32(a, b) {
+    return Math.imul(a, b) >>> 0;
+}
+/**
+ * Pure JS xxHash32 operating on a UTF-8 encoded string.
+ * Matches Bun.hash.xxHash32(str, seed) behavior.
+ */
+function xxHash32(input, seed) {
+    const buf = Buffer.from(input, "utf-8");
+    const len = buf.length;
+    let h32;
+    let i = 0;
+    if (len >= 16) {
+        let v1 = (seed + PRIME32_1 + PRIME32_2) >>> 0;
+        let v2 = (seed + PRIME32_2) >>> 0;
+        let v3 = (seed + 0) >>> 0;
+        let v4 = (seed - PRIME32_1) >>> 0;
+        while (i <= len - 16) {
+            v1 = (imul32(rotl32((v1 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;
+            i += 4;
+            v2 = (imul32(rotl32((v2 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;
+            i += 4;
+            v3 = (imul32(rotl32((v3 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;
+            i += 4;
+            v4 = (imul32(rotl32((v4 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;
+            i += 4;
+        }
+        h32 = (rotl32(v1, 1) + rotl32(v2, 7) + rotl32(v3, 12) + rotl32(v4, 18)) >>> 0;
+    }
+    else {
+        h32 = (seed + PRIME32_5) >>> 0;
+    }
+    h32 = (h32 + len) >>> 0;
+    while (i <= len - 4) {
+        h32 = (h32 + imul32(buf.readUInt32LE(i), PRIME32_3)) >>> 0;
+        h32 = imul32(rotl32(h32, 17), PRIME32_4);
+        i += 4;
+    }
+    while (i < len) {
+        h32 = (h32 + imul32(buf[i], PRIME32_5)) >>> 0;
+        h32 = imul32(rotl32(h32, 11), PRIME32_1);
+        i += 1;
+    }
+    h32 = imul32(h32 ^ (h32 >>> 15), PRIME32_2);
+    h32 = imul32(h32 ^ (h32 >>> 13), PRIME32_3);
+    h32 = (h32 ^ (h32 >>> 16)) >>> 0;
+    return h32;
+}
+const NIBBLE_STR = "ZPMQVRWSNKTXJBYH";
+const DICT = Array.from({ length: 256 }, (_, i) => {
+    const h = i >>> 4;
+    const l = i & 0x0f;
+    return `${NIBBLE_STR[h]}${NIBBLE_STR[l]}`;
+});
+const RE_SIGNIFICANT = /[\p{L}\p{N}]/u;
+/**
+ * Compute a short hash of a single line.
+ *
+ * Uses xxHash32 on a trailing-whitespace-trimmed, CR-stripped line, truncated to 2 chars
+ * from the nibble alphabet. For lines containing no alphanumeric characters (only
+ * punctuation/symbols/whitespace), the line number is mixed in to reduce hash collisions.
+ */
+export function computeLineHash(idx, line) {
+    line = line.replace(/\r/g, "").trimEnd();
+    let seed = 0;
+    if (!RE_SIGNIFICANT.test(line)) {
+        seed = idx;
+    }
+    return DICT[xxHash32(line, seed) & 0xff];
+}
+/**
+ * Formats a tag given the line number and text.
+ */
+export function formatLineTag(line, text) {
+    return `${line}#${computeLineHash(line, text)}`;
+}
+/**
+ * Format file text with hashline prefixes for display.
+ *
+ * Each line becomes `LINENUM#HASH:TEXT` where LINENUM is 1-indexed.
+ */
+export function formatHashLines(text, startLine = 1) {
+    const lines = text.split("\n");
+    return lines
+        .map((line, i) => {
+        const num = startLine + i;
+        return `${formatLineTag(num, line)}:${line}`;
+    })
+        .join("\n");
+}
+/**
+ * Parse a line reference string like `"5#QQ"` into structured form.
+ *
+ * @throws Error if the format is invalid
+ */
+export function parseTag(ref) {
+    const match = ref.match(/^\s*[>+-]*\s*(\d+)\s*#\s*([ZPMQVRWSNKTXJBYH]{2})/);
+    if (!match) {
+        throw new Error(`Invalid line reference "${ref}". Expected format "LINE#ID" (e.g. "5#QQ").`);
+    }
+    const line = Number.parseInt(match[1], 10);
+    if (line < 1) {
+        throw new Error(`Line number must be >= 1, got ${line} in "${ref}".`);
+    }
+    return { line, hash: match[2] };
+}
+const MISMATCH_CONTEXT = 2;
+/**
+ * Error thrown when one or more hashline references have stale hashes.
+ * Displays grep-style output with `>>>` markers on mismatched lines,
+ * showing the correct `LINE#ID` so the caller can fix all refs at once.
+ */
+export class HashlineMismatchError extends Error {
+    constructor(mismatches, fileLines) {
+        super(HashlineMismatchError.formatMessage(mismatches, fileLines));
+        this.name = "HashlineMismatchError";
+        this.mismatches = mismatches;
+        this.fileLines = fileLines;
+        const remaps = new Map();
+        for (const m of mismatches) {
+            const actual = computeLineHash(m.line, fileLines[m.line - 1]);
+            remaps.set(`${m.line}#${m.expected}`, `${m.line}#${actual}`);
+        }
+        this.remaps = remaps;
+    }
+    static formatMessage(mismatches, fileLines) {
+        const mismatchSet = new Map();
+        for (const m of mismatches) {
+            mismatchSet.set(m.line, m);
+        }
+        const displayLines = new Set();
+        for (const m of mismatches) {
+            const lo = Math.max(1, m.line - MISMATCH_CONTEXT);
+            const hi = Math.min(fileLines.length, m.line + MISMATCH_CONTEXT);
+            for (let i = lo; i <= hi; i++) {
+                displayLines.add(i);
+            }
+        }
+        const sorted = [...displayLines].sort((a, b) => a - b);
+        const lines = [];
+        lines.push(`${mismatches.length} line${mismatches.length > 1 ? "s have" : " has"} changed since last read. Use the updated LINE#ID references shown below (>>> marks changed lines).`);
+        lines.push("");
+        let prevLine = -1;
+        for (const lineNum of sorted) {
+            if (prevLine !== -1 && lineNum > prevLine + 1) {
+                lines.push("    ...");
+            }
+            prevLine = lineNum;
+            const text = fileLines[lineNum - 1];
+            const hash = computeLineHash(lineNum, text);
+            const prefix = `${lineNum}#${hash}`;
+            if (mismatchSet.has(lineNum)) {
+                lines.push(`>>> ${prefix}:${text}`);
+            }
+            else {
+                lines.push(`    ${prefix}:${text}`);
+            }
+        }
+        return lines.join("\n");
+    }
+}
+/**
+ * Validate that a line reference points to an existing line with a matching hash.
+ */
+export function validateLineRef(ref, fileLines) {
+    if (ref.line < 1 || ref.line > fileLines.length) {
+        throw new Error(`Line ${ref.line} does not exist (file has ${fileLines.length} lines)`);
+    }
+    const actualHash = computeLineHash(ref.line, fileLines[ref.line - 1]);
+    if (actualHash !== ref.hash) {
+        throw new HashlineMismatchError([{ line: ref.line, expected: ref.hash, actual: actualHash }], fileLines);
+    }
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// Prefix Stripping
+// ═══════════════════════════════════════════════════════════════════════════
+/** Pattern matching hashline display format prefixes: `LINE#ID:CONTENT` and `#ID:CONTENT` */
+const HASHLINE_PREFIX_RE = /^\s*(?:>>>|>>)?\s*(?:\d+\s*#\s*|#\s*)[ZPMQVRWSNKTXJBYH]{2}:/;
+/** Pattern matching a unified-diff added-line `+` prefix (but not `++`). */
+const DIFF_PLUS_RE = /^[+](?![+])/;
+/**
+ * Strip hashline display prefixes and diff `+` markers from replacement lines.
+ *
+ * Models frequently copy the `LINE#ID` prefix from read output into their
+ * replacement content. This strips them heuristically before application.
+ */
+export function stripNewLinePrefixes(lines) {
+    let hashPrefixCount = 0;
+    let diffPlusCount = 0;
+    let nonEmpty = 0;
+    for (const l of lines) {
+        if (l.length === 0)
+            continue;
+        nonEmpty++;
+        if (HASHLINE_PREFIX_RE.test(l))
+            hashPrefixCount++;
+        if (DIFF_PLUS_RE.test(l))
+            diffPlusCount++;
+    }
+    if (nonEmpty === 0)
+        return lines;
+    const stripHash = hashPrefixCount > 0 && hashPrefixCount === nonEmpty;
+    const stripPlus = !stripHash && diffPlusCount > 0 && diffPlusCount >= nonEmpty * 0.5;
+    if (!stripHash && !stripPlus)
+        return lines;
+    return lines.map(l => {
+        if (stripHash)
+            return l.replace(HASHLINE_PREFIX_RE, "");
+        if (stripPlus)
+            return l.replace(DIFF_PLUS_RE, "");
+        return l;
+    });
+}
+/**
+ * Parse edit content — handles string, array, or null input.
+ * Strips hashline prefixes and diff markers from model output.
+ */
+export function hashlineParseText(edit) {
+    if (edit === null)
+        return [];
+    if (typeof edit === "string") {
+        const normalizedEdit = edit.endsWith("\n") ? edit.slice(0, -1) : edit;
+        edit = normalizedEdit.replaceAll("\r", "").split("\n");
+    }
+    return stripNewLinePrefixes(edit);
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// Auto-correction Heuristics
+// ═══════════════════════════════════════════════════════════════════════════
+function maybeAutocorrectEscapedTabIndentation(edits, warnings) {
+    for (const edit of edits) {
+        if (edit.lines.length === 0)
+            continue;
+        const hasEscapedTabs = edit.lines.some(line => line.includes("\\t"));
+        if (!hasEscapedTabs)
+            continue;
+        const hasRealTabs = edit.lines.some(line => line.includes("\t"));
+        if (hasRealTabs)
+            continue;
+        let correctedCount = 0;
+        const corrected = edit.lines.map(line => line.replace(/^((?:\\t)+)/, escaped => {
+            correctedCount += escaped.length / 2;
+            return "\t".repeat(escaped.length / 2);
+        }));
+        if (correctedCount === 0)
+            continue;
+        edit.lines = corrected;
+        warnings.push(`Auto-corrected escaped tab indentation in edit: converted leading \\t sequence(s) to real tab characters`);
+    }
+}
+const MIN_AUTOCORRECT_LENGTH = 2;
+function shouldAutocorrect(line, otherLine) {
+    if (!line || line !== otherLine)
+        return false;
+    line = line.trim();
+    if (line.length < MIN_AUTOCORRECT_LENGTH) {
+        return line.endsWith("}") || line.endsWith(")");
+    }
+    return true;
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// Edit Application
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Apply an array of hashline edits to file content.
+ *
+ * Each edit operation identifies target lines directly (`replace`,
+ * `append`, `prepend`). Line references are resolved via parseTag
+ * and hashes validated before any mutation.
+ *
+ * Edits are sorted bottom-up (highest effective line first) so earlier
+ * splices don't invalidate later line numbers.
+ *
+ * @returns The modified content and the 1-indexed first changed line number
+ */
+export function applyHashlineEdits(text, edits) {
+    if (edits.length === 0) {
+        return { lines: text, firstChangedLine: undefined };
+    }
+    const fileLines = text.split("\n");
+    const originalFileLines = [...fileLines];
+    let firstChangedLine;
+    const noopEdits = [];
+    const warnings = [];
+    // Pre-validate: collect all hash mismatches before mutating
+    const mismatches = [];
+    function validateRef(ref) {
+        if (ref.line < 1 || ref.line > fileLines.length) {
+            throw new Error(`Line ${ref.line} does not exist (file has ${fileLines.length} lines)`);
+        }
+        const actualHash = computeLineHash(ref.line, fileLines[ref.line - 1]);
+        if (actualHash === ref.hash) {
+            return true;
+        }
+        mismatches.push({ line: ref.line, expected: ref.hash, actual: actualHash });
+        return false;
+    }
+    for (const edit of edits) {
+        switch (edit.op) {
+            case "replace": {
+                if (edit.end) {
+                    const startValid = validateRef(edit.pos);
+                    const endValid = validateRef(edit.end);
+                    if (!startValid || !endValid)
+                        continue;
+                    if (edit.pos.line > edit.end.line) {
+                        throw new Error(`Range start line ${edit.pos.line} must be <= end line ${edit.end.line}`);
+                    }
+                }
+                else {
+                    if (!validateRef(edit.pos))
+                        continue;
+                }
+                break;
+            }
+            case "append": {
+                if (edit.pos && !validateRef(edit.pos))
+                    continue;
+                if (edit.lines.length === 0) {
+                    edit.lines = [""];
+                }
+                break;
+            }
+            case "prepend": {
+                if (edit.pos && !validateRef(edit.pos))
+                    continue;
+                if (edit.lines.length === 0) {
+                    edit.lines = [""];
+                }
+                break;
+            }
+        }
+    }
+    if (mismatches.length > 0) {
+        throw new HashlineMismatchError(mismatches, fileLines);
+    }
+    maybeAutocorrectEscapedTabIndentation(edits, warnings);
+    // Deduplicate identical edits targeting the same line(s)
+    const seenEditKeys = new Map();
+    const dedupIndices = new Set();
+    for (let i = 0; i < edits.length; i++) {
+        const edit = edits[i];
+        let lineKey;
+        switch (edit.op) {
+            case "replace":
+                lineKey = edit.end ? `r:${edit.pos.line}:${edit.end.line}` : `s:${edit.pos.line}`;
+                break;
+            case "append":
+                lineKey = edit.pos ? `i:${edit.pos.line}` : "ieof";
+                break;
+            case "prepend":
+                lineKey = edit.pos ? `ib:${edit.pos.line}` : "ibef";
+                break;
+        }
+        const dstKey = `${lineKey}:${edit.lines.join("\n")}`;
+        if (seenEditKeys.has(dstKey)) {
+            dedupIndices.add(i);
+        }
+        else {
+            seenEditKeys.set(dstKey, i);
+        }
+    }
+    if (dedupIndices.size > 0) {
+        for (let i = edits.length - 1; i >= 0; i--) {
+            if (dedupIndices.has(i))
+                edits.splice(i, 1);
+        }
+    }
+    // Compute sort key (descending) — bottom-up application
+    const annotated = edits.map((edit, idx) => {
+        let sortLine;
+        let precedence;
+        switch (edit.op) {
+            case "replace":
+                sortLine = edit.end ? edit.end.line : edit.pos.line;
+                precedence = 0;
+                break;
+            case "append":
+                sortLine = edit.pos ? edit.pos.line : fileLines.length + 1;
+                precedence = 1;
+                break;
+            case "prepend":
+                sortLine = edit.pos ? edit.pos.line : 0;
+                precedence = 2;
+                break;
+        }
+        return { edit, idx, sortLine, precedence };
+    });
+    annotated.sort((a, b) => b.sortLine - a.sortLine || a.precedence - b.precedence || a.idx - b.idx);
+    function trackFirstChanged(line) {
+        if (firstChangedLine === undefined || line < firstChangedLine) {
+            firstChangedLine = line;
+        }
+    }
+    // Apply edits bottom-up
+    for (const { edit, idx } of annotated) {
+        switch (edit.op) {
+            case "replace": {
+                if (!edit.end) {
+                    const origLines = originalFileLines.slice(edit.pos.line - 1, edit.pos.line);
+                    const newLines = edit.lines;
+                    if (origLines.length === newLines.length && origLines.every((line, i) => line === newLines[i])) {
+                        noopEdits.push({
+                            editIndex: idx,
+                            loc: `${edit.pos.line}#${edit.pos.hash}`,
+                            current: origLines.join("\n"),
+                        });
+                        break;
+                    }
+                    fileLines.splice(edit.pos.line - 1, 1, ...newLines);
+                    trackFirstChanged(edit.pos.line);
+                }
+                else {
+                    const count = edit.end.line - edit.pos.line + 1;
+                    const newLines = [...edit.lines];
+                    const trailingReplacementLine = newLines[newLines.length - 1]?.trimEnd();
+                    const nextSurvivingLine = fileLines[edit.end.line]?.trimEnd();
+                    if (shouldAutocorrect(trailingReplacementLine, nextSurvivingLine) &&
+                        fileLines[edit.end.line - 1]?.trimEnd() !== trailingReplacementLine) {
+                        newLines.pop();
+                        warnings.push(`Auto-corrected range replace ${edit.pos.line}#${edit.pos.hash}-${edit.end.line}#${edit.end.hash}: removed trailing replacement line "${trailingReplacementLine}" that duplicated next surviving line`);
+                    }
+                    const leadingReplacementLine = newLines[0]?.trimEnd();
+                    const prevSurvivingLine = fileLines[edit.pos.line - 2]?.trimEnd();
+                    if (shouldAutocorrect(leadingReplacementLine, prevSurvivingLine) &&
+                        fileLines[edit.pos.line - 1]?.trimEnd() !== leadingReplacementLine) {
+                        newLines.shift();
+                        warnings.push(`Auto-corrected range replace ${edit.pos.line}#${edit.pos.hash}-${edit.end.line}#${edit.end.hash}: removed leading replacement line "${leadingReplacementLine}" that duplicated preceding surviving line`);
+                    }
+                    fileLines.splice(edit.pos.line - 1, count, ...newLines);
+                    trackFirstChanged(edit.pos.line);
+                }
+                break;
+            }
+            case "append": {
+                const inserted = edit.lines;
+                if (inserted.length === 0) {
+                    noopEdits.push({
+                        editIndex: idx,
+                        loc: edit.pos ? `${edit.pos.line}#${edit.pos.hash}` : "EOF",
+                        current: edit.pos ? originalFileLines[edit.pos.line - 1] : "",
+                    });
+                    break;
+                }
+                if (edit.pos) {
+                    fileLines.splice(edit.pos.line, 0, ...inserted);
+                    trackFirstChanged(edit.pos.line + 1);
+                }
+                else {
+                    if (fileLines.length === 1 && fileLines[0] === "") {
+                        fileLines.splice(0, 1, ...inserted);
+                        trackFirstChanged(1);
+                    }
+                    else {
+                        fileLines.splice(fileLines.length, 0, ...inserted);
+                        trackFirstChanged(fileLines.length - inserted.length + 1);
+                    }
+                }
+                break;
+            }
+            case "prepend": {
+                const inserted = edit.lines;
+                if (inserted.length === 0) {
+                    noopEdits.push({
+                        editIndex: idx,
+                        loc: edit.pos ? `${edit.pos.line}#${edit.pos.hash}` : "BOF",
+                        current: edit.pos ? originalFileLines[edit.pos.line - 1] : "",
+                    });
+                    break;
+                }
+                if (edit.pos) {
+                    fileLines.splice(edit.pos.line - 1, 0, ...inserted);
+                    trackFirstChanged(edit.pos.line);
+                }
+                else {
+                    if (fileLines.length === 1 && fileLines[0] === "") {
+                        fileLines.splice(0, 1, ...inserted);
+                    }
+                    else {
+                        fileLines.splice(0, 0, ...inserted);
+                    }
+                    trackFirstChanged(1);
+                }
+                break;
+            }
+        }
+    }
+    return {
+        lines: fileLines.join("\n"),
+        firstChangedLine,
+        ...(warnings.length > 0 ? { warnings } : {}),
+        ...(noopEdits.length > 0 ? { noopEdits } : {}),
+    };
+}
+//# sourceMappingURL=hashline.js.map

package/node_modules/@gsd/pi-coding-agent/dist/core/tools/hashline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashline.js","sourceRoot":"","sources":["../../../src/core/tools/hashline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,8EAA8E;AAC9E,6DAA6D;AAC7D,8EAA8E;AAE9E,MAAM,SAAS,GAAG,UAAU,CAAC;AAC7B,MAAM,SAAS,GAAG,UAAU,CAAC;AAC7B,MAAM,SAAS,GAAG,UAAU,CAAC;AAC7B,MAAM,SAAS,GAAG,UAAU,CAAC;AAC7B,MAAM,SAAS,GAAG,UAAU,CAAC;AAE7B,SAAS,MAAM,CAAC,GAAW,EAAE,IAAY;IACxC,OAAO,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,KAAa,EAAE,IAAY;IAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;IACvB,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,IAAI,GAAG,IAAI,EAAE,EAAE,CAAC;QACf,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAElC,OAAO,CAAC,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACtB,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;YAChG,CAAC,IAAI,CAAC,CAAC;YACP,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;YAChG,CAAC,IAAI,CAAC,CAAC;YACP,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;YAChG,CAAC,IAAI,CAAC,CAAC;YACP,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;YAChG,CAAC,IAAI,CAAC,CAAC;QACR,CAAC;QAED,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/E,CAAC;SAAM,CAAC;QACP,GAAG,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAExB,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACrB,GAAG,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3D,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QACzC,CAAC,IAAI,CAAC,CAAC;IACR,CAAC;IAED,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;QAChB,GAAG,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9C,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QACzC,CAAC,IAAI,CAAC,CAAC;IACR,CAAC;IAED,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAC5C,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAC5C,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAEjC,OAAO,GAAG,CAAC;AACZ,CAAC;AAYD,MAAM,UAAU,GAAG,kBAAkB,CAAC;AAEtC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;IACjD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IACnB,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3C,CAAC,CAAC,CAAC;AAEH,MAAM,cAAc,GAAG,eAAe,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW,EAAE,IAAY;IACxD,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IAEzC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,IAAI,GAAG,GAAG,CAAC;IACZ,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,IAAY;IACvD,OAAO,GAAG,IAAI,IAAI,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;AACjD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,SAAS,GAAG,CAAC;IAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,OAAO,KAAK;SACV,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAChB,MAAM,GAAG,GAAG,SAAS,GAAG,CAAC,CAAC;QAC1B,OAAO,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;IAC9C,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAW;IACnC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,kDAAkD,CAAC,CAAC;IAC5E,IAAI,CAAC,KAAK,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,2BAA2B,GAAG,6CAA6C,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC3C,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;AACjC,CAAC;AAYD,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B;;;;GAIG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAI/C,YACC,UAA0B,EAC1B,SAAmB;QAEnB,KAAK,CAAC,qBAAqB,CAAC,aAAa,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;IAED,MAAM,CAAC,aAAa,CAAC,UAA0B,EAAE,SAAmB;QACnE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;QACpD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC5B,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC,CAAC;YAClD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC,CAAC;YACjE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QAED,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,KAAK,CAAC,IAAI,CACT,GAAG,UAAU,CAAC,MAAM,QAAQ,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,qGAAqG,CAC1K,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;YAC9B,IAAI,QAAQ,KAAK,CAAC,CAAC,IAAI,OAAO,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC;gBAC/C,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;YACD,QAAQ,GAAG,OAAO,CAAC;YAEnB,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,GAAG,OAAO,IAAI,IAAI,EAAE,CAAC;YAEpC,IAAI,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACP,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC;YACrC,CAAC;QACF,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;CACD;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW,EAAE,SAAmB;IAC/D,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,QAAQ,GAAG,CAAC,IAAI,6BAA6B,SAAS,CAAC,MAAM,SAAS,CAAC,CAAC;IACzF,CAAC;IACD,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,IAAI,UAAU,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;QAC7B,MAAM,IAAI,qBAAqB,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1G,CAAC;AACF,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,6FAA6F;AAC7F,MAAM,kBAAkB,GAAG,6DAA6D,CAAC;AAEzF,4EAA4E;AAC5E,MAAM,YAAY,GAAG,aAAa,CAAC;AAEnC;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAe;IACnD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC7B,QAAQ,EAAE,CAAC;QACX,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,eAAe,EAAE,CAAC;QAClD,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,aAAa,EAAE,CAAC;IAC3C,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEjC,MAAM,SAAS,GAAG,eAAe,GAAG,CAAC,IAAI,eAAe,KAAK,QAAQ,CAAC;IACtE,MAAM,SAAS,GAAG,CAAC,SAAS,IAAI,aAAa,GAAG,CAAC,IAAI,aAAa,IAAI,QAAQ,GAAG,GAAG,CAAC;IACrF,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IAE3C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACpB,IAAI,SAAS;YAAE,OAAO,CAAC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;QACxD,IAAI,SAAS;YAAE,OAAO,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAClD,OAAO,CAAC,CAAC;IACV,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAA8B;IAC/D,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,EAAE,CAAC;IAC7B,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACtE,IAAI,GAAG,cAAc,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E,SAAS,qCAAqC,CAAC,KAAqB,EAAE,QAAkB;IACvF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACtC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,cAAc;YAAE,SAAS;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACjE,IAAI,WAAW;YAAE,SAAS;QAC1B,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CACvC,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,EAAE;YACrC,cAAc,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CACF,CAAC;QACF,IAAI,cAAc,KAAK,CAAC;YAAE,SAAS;QACnC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,QAAQ,CAAC,IAAI,CACZ,0GAA0G,CAC1G,CAAC;IACH,CAAC;AACF,CAAC;AAED,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAEjC,SAAS,iBAAiB,CAAC,IAAY,EAAE,SAAiB;IACzD,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC9C,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IACnB,IAAI,IAAI,CAAC,MAAM,GAAG,sBAAsB,EAAE,CAAC;QAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CACjC,IAAY,EACZ,KAAqB;IAOrB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC;IACrD,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,iBAAiB,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACzC,IAAI,gBAAoC,CAAC;IACzC,MAAM,SAAS,GAA+D,EAAE,CAAC;IACjF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,4DAA4D;IAC5D,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,SAAS,WAAW,CAAC,GAAW;QAC/B,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,IAAI,KAAK,CAAC,QAAQ,GAAG,CAAC,IAAI,6BAA6B,SAAS,CAAC,MAAM,SAAS,CAAC,CAAC;QACzF,CAAC;QACD,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,UAAU,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACb,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;QAC5E,OAAO,KAAK,CAAC;IACd,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACjB,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;oBACd,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACzC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACvC,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ;wBAAE,SAAS;oBACvC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;wBACnC,MAAM,IAAI,KAAK,CAAC,oBAAoB,IAAI,CAAC,GAAG,CAAC,IAAI,wBAAwB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC3F,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC;wBAAE,SAAS;gBACtC,CAAC;gBACD,MAAM;YACP,CAAC;YACD,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACf,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACjD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnB,CAAC;gBACD,MAAM;YACP,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACjD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnB,CAAC;gBACD,MAAM;YACP,CAAC;QACF,CAAC;IACF,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,qBAAqB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IACD,qCAAqC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAEvD,yDAAyD;IACzD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,OAAe,CAAC;QACpB,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACjB,KAAK,SAAS;gBACb,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAClF,MAAM;YACP,KAAK,QAAQ;gBACZ,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;gBACnD,MAAM;YACP,KAAK,SAAS;gBACb,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;gBACpD,MAAM;QACR,CAAC;QACD,MAAM,MAAM,GAAG,GAAG,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACrD,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACP,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;IACF,CAAC;IACD,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;IAED,wDAAwD;IACxD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACzC,IAAI,QAAgB,CAAC;QACrB,IAAI,UAAkB,CAAC;QACvB,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACjB,KAAK,SAAS;gBACb,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBACpD,UAAU,GAAG,CAAC,CAAC;gBACf,MAAM;YACP,KAAK,QAAQ;gBACZ,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC3D,UAAU,GAAG,CAAC,CAAC;gBACf,MAAM;YACP,KAAK,SAAS;gBACb,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,UAAU,GAAG,CAAC,CAAC;gBACf,MAAM;QACR,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAElG,SAAS,iBAAiB,CAAC,IAAY;QACtC,IAAI,gBAAgB,KAAK,SAAS,IAAI,IAAI,GAAG,gBAAgB,EAAE,CAAC;YAC/D,gBAAgB,GAAG,IAAI,CAAC;QACzB,CAAC;IACF,CAAC;IAED,wBAAwB;IACxB,KAAK,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,SAAS,EAAE,CAAC;QACvC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACjB,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;oBACf,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;oBAC5B,IAAI,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAChG,SAAS,CAAC,IAAI,CAAC;4BACd,SAAS,EAAE,GAAG;4BACd,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;4BACxC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;yBAC7B,CAAC,CAAC;wBACH,MAAM;oBACP,CAAC;oBACD,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;oBACpD,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;qBAAM,CAAC;oBACP,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;oBAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;oBACjC,MAAM,uBAAuB,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;oBACzE,MAAM,iBAAiB,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC;oBAC9D,IACC,iBAAiB,CAAC,uBAAuB,EAAE,iBAAiB,CAAC;wBAC7D,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,uBAAuB,EAClE,CAAC;wBACF,QAAQ,CAAC,GAAG,EAAE,CAAC;wBACf,QAAQ,CAAC,IAAI,CACZ,gCAAgC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,wCAAwC,uBAAuB,uCAAuC,CACtM,CAAC;oBACH,CAAC;oBACD,MAAM,sBAAsB,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;oBACtD,MAAM,iBAAiB,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;oBAClE,IACC,iBAAiB,CAAC,sBAAsB,EAAE,iBAAiB,CAAC;wBAC5D,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,sBAAsB,EACjE,CAAC;wBACF,QAAQ,CAAC,KAAK,EAAE,CAAC;wBACjB,QAAQ,CAAC,IAAI,CACZ,gCAAgC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,uCAAuC,sBAAsB,4CAA4C,CACzM,CAAC;oBACH,CAAC;oBACD,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,CAAC;oBACxD,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;gBACD,MAAM;YACP,CAAC;YACD,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACf,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC3B,SAAS,CAAC,IAAI,CAAC;wBACd,SAAS,EAAE,GAAG;wBACd,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK;wBAC3D,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;qBAC7D,CAAC,CAAC;oBACH,MAAM;gBACP,CAAC;gBACD,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;oBACd,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;oBAChD,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACP,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;wBACnD,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;wBACpC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACP,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;wBACnD,iBAAiB,CAAC,SAAS,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC3D,CAAC;gBACF,CAAC;gBACD,MAAM;YACP,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC3B,SAAS,CAAC,IAAI,CAAC;wBACd,SAAS,EAAE,GAAG;wBACd,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK;wBAC3D,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;qBAC7D,CAAC,CAAC;oBACH,MAAM;gBACP,CAAC;gBACD,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;oBACd,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;oBACpD,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;qBAAM,CAAC;oBACP,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;wBACnD,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;oBACrC,CAAC;yBAAM,CAAC;wBACP,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;oBACrC,CAAC;oBACD,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC;gBACD,MAAM;YACP,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO;QACN,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;QAC3B,gBAAgB;QAChB,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9C,CAAC;AACH,CAAC","sourcesContent":["/**\n * Hashline edit mode — a line-addressable edit format using content-hash anchors.\n *\n * Each line in a file is identified by its 1-indexed line number and a short\n * hash derived from the normalized line text (xxHash32, truncated to 2 chars\n * from a custom nibble alphabet).\n *\n * The combined `LINE#ID` reference acts as both an address and a staleness check:\n * if the file has changed since the caller last read it, hash mismatches are caught\n * before any mutation occurs.\n *\n * Displayed format: `LINENUM#HASH:TEXT`\n * Reference format: `\"LINENUM#HASH\"` (e.g. `\"5#QQ\"`)\n *\n * Adapted from Oh My Pi's hashline implementation for Node.js (no Bun dependency).\n */\n\n// ═══════════════════════════════════════════════════════════════════════════\n// xxHash32 — pure JS implementation (no native dependencies)\n// ═══════════════════════════════════════════════════════════════════════════\n\nconst PRIME32_1 = 0x9e3779b1;\nconst PRIME32_2 = 0x85ebca77;\nconst PRIME32_3 = 0xc2b2ae3d;\nconst PRIME32_4 = 0x27d4eb2f;\nconst PRIME32_5 = 0x165667b1;\n\nfunction rotl32(val: number, bits: number): number {\n\treturn ((val << bits) | (val >>> (32 - bits))) >>> 0;\n}\n\nfunction imul32(a: number, b: number): number {\n\treturn Math.imul(a, b) >>> 0;\n}\n\n/**\n * Pure JS xxHash32 operating on a UTF-8 encoded string.\n * Matches Bun.hash.xxHash32(str, seed) behavior.\n */\nfunction xxHash32(input: string, seed: number): number {\n\tconst buf = Buffer.from(input, \"utf-8\");\n\tconst len = buf.length;\n\tlet h32: number;\n\tlet i = 0;\n\n\tif (len >= 16) {\n\t\tlet v1 = (seed + PRIME32_1 + PRIME32_2) >>> 0;\n\t\tlet v2 = (seed + PRIME32_2) >>> 0;\n\t\tlet v3 = (seed + 0) >>> 0;\n\t\tlet v4 = (seed - PRIME32_1) >>> 0;\n\n\t\twhile (i <= len - 16) {\n\t\t\tv1 = (imul32(rotl32((v1 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;\n\t\t\ti += 4;\n\t\t\tv2 = (imul32(rotl32((v2 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;\n\t\t\ti += 4;\n\t\t\tv3 = (imul32(rotl32((v3 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;\n\t\t\ti += 4;\n\t\t\tv4 = (imul32(rotl32((v4 + imul32(buf.readUInt32LE(i), PRIME32_2)) >>> 0, 13), PRIME32_1)) >>> 0;\n\t\t\ti += 4;\n\t\t}\n\n\t\th32 = (rotl32(v1, 1) + rotl32(v2, 7) + rotl32(v3, 12) + rotl32(v4, 18)) >>> 0;\n\t} else {\n\t\th32 = (seed + PRIME32_5) >>> 0;\n\t}\n\n\th32 = (h32 + len) >>> 0;\n\n\twhile (i <= len - 4) {\n\t\th32 = (h32 + imul32(buf.readUInt32LE(i), PRIME32_3)) >>> 0;\n\t\th32 = imul32(rotl32(h32, 17), PRIME32_4);\n\t\ti += 4;\n\t}\n\n\twhile (i < len) {\n\t\th32 = (h32 + imul32(buf[i], PRIME32_5)) >>> 0;\n\t\th32 = imul32(rotl32(h32, 11), PRIME32_1);\n\t\ti += 1;\n\t}\n\n\th32 = imul32(h32 ^ (h32 >>> 15), PRIME32_2);\n\th32 = imul32(h32 ^ (h32 >>> 13), PRIME32_3);\n\th32 = (h32 ^ (h32 >>> 16)) >>> 0;\n\n\treturn h32;\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Hash Computation\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport type Anchor = { line: number; hash: string };\nexport type HashlineEdit =\n\t| { op: \"replace\"; pos: Anchor; end?: Anchor; lines: string[] }\n\t| { op: \"append\"; pos?: Anchor; lines: string[] }\n\t| { op: \"prepend\"; pos?: Anchor; lines: string[] };\n\nconst NIBBLE_STR = \"ZPMQVRWSNKTXJBYH\";\n\nconst DICT = Array.from({ length: 256 }, (_, i) => {\n\tconst h = i >>> 4;\n\tconst l = i & 0x0f;\n\treturn `${NIBBLE_STR[h]}${NIBBLE_STR[l]}`;\n});\n\nconst RE_SIGNIFICANT = /[\\p{L}\\p{N}]/u;\n\n/**\n * Compute a short hash of a single line.\n *\n * Uses xxHash32 on a trailing-whitespace-trimmed, CR-stripped line, truncated to 2 chars\n * from the nibble alphabet. For lines containing no alphanumeric characters (only\n * punctuation/symbols/whitespace), the line number is mixed in to reduce hash collisions.\n */\nexport function computeLineHash(idx: number, line: string): string {\n\tline = line.replace(/\\r/g, \"\").trimEnd();\n\n\tlet seed = 0;\n\tif (!RE_SIGNIFICANT.test(line)) {\n\t\tseed = idx;\n\t}\n\treturn DICT[xxHash32(line, seed) & 0xff];\n}\n\n/**\n * Formats a tag given the line number and text.\n */\nexport function formatLineTag(line: number, text: string): string {\n\treturn `${line}#${computeLineHash(line, text)}`;\n}\n\n/**\n * Format file text with hashline prefixes for display.\n *\n * Each line becomes `LINENUM#HASH:TEXT` where LINENUM is 1-indexed.\n */\nexport function formatHashLines(text: string, startLine = 1): string {\n\tconst lines = text.split(\"\\n\");\n\treturn lines\n\t\t.map((line, i) => {\n\t\t\tconst num = startLine + i;\n\t\t\treturn `${formatLineTag(num, line)}:${line}`;\n\t\t})\n\t\t.join(\"\\n\");\n}\n\n/**\n * Parse a line reference string like `\"5#QQ\"` into structured form.\n *\n * @throws Error if the format is invalid\n */\nexport function parseTag(ref: string): Anchor {\n\tconst match = ref.match(/^\\s*[>+-]*\\s*(\\d+)\\s*#\\s*([ZPMQVRWSNKTXJBYH]{2})/);\n\tif (!match) {\n\t\tthrow new Error(`Invalid line reference \"${ref}\". Expected format \"LINE#ID\" (e.g. \"5#QQ\").`);\n\t}\n\tconst line = Number.parseInt(match[1], 10);\n\tif (line < 1) {\n\t\tthrow new Error(`Line number must be >= 1, got ${line} in \"${ref}\".`);\n\t}\n\treturn { line, hash: match[2] };\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Hash Mismatch Error\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface HashMismatch {\n\tline: number;\n\texpected: string;\n\tactual: string;\n}\n\nconst MISMATCH_CONTEXT = 2;\n\n/**\n * Error thrown when one or more hashline references have stale hashes.\n * Displays grep-style output with `>>>` markers on mismatched lines,\n * showing the correct `LINE#ID` so the caller can fix all refs at once.\n */\nexport class HashlineMismatchError extends Error {\n\treadonly mismatches: HashMismatch[];\n\treadonly fileLines: string[];\n\treadonly remaps: ReadonlyMap<string, string>;\n\tconstructor(\n\t\tmismatches: HashMismatch[],\n\t\tfileLines: string[],\n\t) {\n\t\tsuper(HashlineMismatchError.formatMessage(mismatches, fileLines));\n\t\tthis.name = \"HashlineMismatchError\";\n\t\tthis.mismatches = mismatches;\n\t\tthis.fileLines = fileLines;\n\t\tconst remaps = new Map<string, string>();\n\t\tfor (const m of mismatches) {\n\t\t\tconst actual = computeLineHash(m.line, fileLines[m.line - 1]);\n\t\t\tremaps.set(`${m.line}#${m.expected}`, `${m.line}#${actual}`);\n\t\t}\n\t\tthis.remaps = remaps;\n\t}\n\n\tstatic formatMessage(mismatches: HashMismatch[], fileLines: string[]): string {\n\t\tconst mismatchSet = new Map<number, HashMismatch>();\n\t\tfor (const m of mismatches) {\n\t\t\tmismatchSet.set(m.line, m);\n\t\t}\n\n\t\tconst displayLines = new Set<number>();\n\t\tfor (const m of mismatches) {\n\t\t\tconst lo = Math.max(1, m.line - MISMATCH_CONTEXT);\n\t\t\tconst hi = Math.min(fileLines.length, m.line + MISMATCH_CONTEXT);\n\t\t\tfor (let i = lo; i <= hi; i++) {\n\t\t\t\tdisplayLines.add(i);\n\t\t\t}\n\t\t}\n\n\t\tconst sorted = [...displayLines].sort((a, b) => a - b);\n\t\tconst lines: string[] = [];\n\n\t\tlines.push(\n\t\t\t`${mismatches.length} line${mismatches.length > 1 ? \"s have\" : \" has\"} changed since last read. Use the updated LINE#ID references shown below (>>> marks changed lines).`,\n\t\t);\n\t\tlines.push(\"\");\n\n\t\tlet prevLine = -1;\n\t\tfor (const lineNum of sorted) {\n\t\t\tif (prevLine !== -1 && lineNum > prevLine + 1) {\n\t\t\t\tlines.push(\"    ...\");\n\t\t\t}\n\t\t\tprevLine = lineNum;\n\n\t\t\tconst text = fileLines[lineNum - 1];\n\t\t\tconst hash = computeLineHash(lineNum, text);\n\t\t\tconst prefix = `${lineNum}#${hash}`;\n\n\t\t\tif (mismatchSet.has(lineNum)) {\n\t\t\t\tlines.push(`>>> ${prefix}:${text}`);\n\t\t\t} else {\n\t\t\t\tlines.push(`    ${prefix}:${text}`);\n\t\t\t}\n\t\t}\n\t\treturn lines.join(\"\\n\");\n\t}\n}\n\n/**\n * Validate that a line reference points to an existing line with a matching hash.\n */\nexport function validateLineRef(ref: Anchor, fileLines: string[]): void {\n\tif (ref.line < 1 || ref.line > fileLines.length) {\n\t\tthrow new Error(`Line ${ref.line} does not exist (file has ${fileLines.length} lines)`);\n\t}\n\tconst actualHash = computeLineHash(ref.line, fileLines[ref.line - 1]);\n\tif (actualHash !== ref.hash) {\n\t\tthrow new HashlineMismatchError([{ line: ref.line, expected: ref.hash, actual: actualHash }], fileLines);\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Prefix Stripping\n// ═══════════════════════════════════════════════════════════════════════════\n\n/** Pattern matching hashline display format prefixes: `LINE#ID:CONTENT` and `#ID:CONTENT` */\nconst HASHLINE_PREFIX_RE = /^\\s*(?:>>>|>>)?\\s*(?:\\d+\\s*#\\s*|#\\s*)[ZPMQVRWSNKTXJBYH]{2}:/;\n\n/** Pattern matching a unified-diff added-line `+` prefix (but not `++`). */\nconst DIFF_PLUS_RE = /^[+](?![+])/;\n\n/**\n * Strip hashline display prefixes and diff `+` markers from replacement lines.\n *\n * Models frequently copy the `LINE#ID` prefix from read output into their\n * replacement content. This strips them heuristically before application.\n */\nexport function stripNewLinePrefixes(lines: string[]): string[] {\n\tlet hashPrefixCount = 0;\n\tlet diffPlusCount = 0;\n\tlet nonEmpty = 0;\n\tfor (const l of lines) {\n\t\tif (l.length === 0) continue;\n\t\tnonEmpty++;\n\t\tif (HASHLINE_PREFIX_RE.test(l)) hashPrefixCount++;\n\t\tif (DIFF_PLUS_RE.test(l)) diffPlusCount++;\n\t}\n\tif (nonEmpty === 0) return lines;\n\n\tconst stripHash = hashPrefixCount > 0 && hashPrefixCount === nonEmpty;\n\tconst stripPlus = !stripHash && diffPlusCount > 0 && diffPlusCount >= nonEmpty * 0.5;\n\tif (!stripHash && !stripPlus) return lines;\n\n\treturn lines.map(l => {\n\t\tif (stripHash) return l.replace(HASHLINE_PREFIX_RE, \"\");\n\t\tif (stripPlus) return l.replace(DIFF_PLUS_RE, \"\");\n\t\treturn l;\n\t});\n}\n\n/**\n * Parse edit content — handles string, array, or null input.\n * Strips hashline prefixes and diff markers from model output.\n */\nexport function hashlineParseText(edit: string[] | string | null): string[] {\n\tif (edit === null) return [];\n\tif (typeof edit === \"string\") {\n\t\tconst normalizedEdit = edit.endsWith(\"\\n\") ? edit.slice(0, -1) : edit;\n\t\tedit = normalizedEdit.replaceAll(\"\\r\", \"\").split(\"\\n\");\n\t}\n\treturn stripNewLinePrefixes(edit);\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Auto-correction Heuristics\n// ═══════════════════════════════════════════════════════════════════════════\n\nfunction maybeAutocorrectEscapedTabIndentation(edits: HashlineEdit[], warnings: string[]): void {\n\tfor (const edit of edits) {\n\t\tif (edit.lines.length === 0) continue;\n\t\tconst hasEscapedTabs = edit.lines.some(line => line.includes(\"\\\\t\"));\n\t\tif (!hasEscapedTabs) continue;\n\t\tconst hasRealTabs = edit.lines.some(line => line.includes(\"\\t\"));\n\t\tif (hasRealTabs) continue;\n\t\tlet correctedCount = 0;\n\t\tconst corrected = edit.lines.map(line =>\n\t\t\tline.replace(/^((?:\\\\t)+)/, escaped => {\n\t\t\t\tcorrectedCount += escaped.length / 2;\n\t\t\t\treturn \"\\t\".repeat(escaped.length / 2);\n\t\t\t}),\n\t\t);\n\t\tif (correctedCount === 0) continue;\n\t\tedit.lines = corrected;\n\t\twarnings.push(\n\t\t\t`Auto-corrected escaped tab indentation in edit: converted leading \\\\t sequence(s) to real tab characters`,\n\t\t);\n\t}\n}\n\nconst MIN_AUTOCORRECT_LENGTH = 2;\n\nfunction shouldAutocorrect(line: string, otherLine: string): boolean {\n\tif (!line || line !== otherLine) return false;\n\tline = line.trim();\n\tif (line.length < MIN_AUTOCORRECT_LENGTH) {\n\t\treturn line.endsWith(\"}\") || line.endsWith(\")\");\n\t}\n\treturn true;\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Edit Application\n// ═══════════════════════════════════════════════════════════════════════════\n\n/**\n * Apply an array of hashline edits to file content.\n *\n * Each edit operation identifies target lines directly (`replace`,\n * `append`, `prepend`). Line references are resolved via parseTag\n * and hashes validated before any mutation.\n *\n * Edits are sorted bottom-up (highest effective line first) so earlier\n * splices don't invalidate later line numbers.\n *\n * @returns The modified content and the 1-indexed first changed line number\n */\nexport function applyHashlineEdits(\n\ttext: string,\n\tedits: HashlineEdit[],\n): {\n\tlines: string;\n\tfirstChangedLine: number | undefined;\n\twarnings?: string[];\n\tnoopEdits?: Array<{ editIndex: number; loc: string; current: string }>;\n} {\n\tif (edits.length === 0) {\n\t\treturn { lines: text, firstChangedLine: undefined };\n\t}\n\n\tconst fileLines = text.split(\"\\n\");\n\tconst originalFileLines = [...fileLines];\n\tlet firstChangedLine: number | undefined;\n\tconst noopEdits: Array<{ editIndex: number; loc: string; current: string }> = [];\n\tconst warnings: string[] = [];\n\n\t// Pre-validate: collect all hash mismatches before mutating\n\tconst mismatches: HashMismatch[] = [];\n\tfunction validateRef(ref: Anchor): boolean {\n\t\tif (ref.line < 1 || ref.line > fileLines.length) {\n\t\t\tthrow new Error(`Line ${ref.line} does not exist (file has ${fileLines.length} lines)`);\n\t\t}\n\t\tconst actualHash = computeLineHash(ref.line, fileLines[ref.line - 1]);\n\t\tif (actualHash === ref.hash) {\n\t\t\treturn true;\n\t\t}\n\t\tmismatches.push({ line: ref.line, expected: ref.hash, actual: actualHash });\n\t\treturn false;\n\t}\n\tfor (const edit of edits) {\n\t\tswitch (edit.op) {\n\t\t\tcase \"replace\": {\n\t\t\t\tif (edit.end) {\n\t\t\t\t\tconst startValid = validateRef(edit.pos);\n\t\t\t\t\tconst endValid = validateRef(edit.end);\n\t\t\t\t\tif (!startValid || !endValid) continue;\n\t\t\t\t\tif (edit.pos.line > edit.end.line) {\n\t\t\t\t\t\tthrow new Error(`Range start line ${edit.pos.line} must be <= end line ${edit.end.line}`);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (!validateRef(edit.pos)) continue;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"append\": {\n\t\t\t\tif (edit.pos && !validateRef(edit.pos)) continue;\n\t\t\t\tif (edit.lines.length === 0) {\n\t\t\t\t\tedit.lines = [\"\"];\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"prepend\": {\n\t\t\t\tif (edit.pos && !validateRef(edit.pos)) continue;\n\t\t\t\tif (edit.lines.length === 0) {\n\t\t\t\t\tedit.lines = [\"\"];\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (mismatches.length > 0) {\n\t\tthrow new HashlineMismatchError(mismatches, fileLines);\n\t}\n\tmaybeAutocorrectEscapedTabIndentation(edits, warnings);\n\n\t// Deduplicate identical edits targeting the same line(s)\n\tconst seenEditKeys = new Map<string, number>();\n\tconst dedupIndices = new Set<number>();\n\tfor (let i = 0; i < edits.length; i++) {\n\t\tconst edit = edits[i];\n\t\tlet lineKey: string;\n\t\tswitch (edit.op) {\n\t\t\tcase \"replace\":\n\t\t\t\tlineKey = edit.end ? `r:${edit.pos.line}:${edit.end.line}` : `s:${edit.pos.line}`;\n\t\t\t\tbreak;\n\t\t\tcase \"append\":\n\t\t\t\tlineKey = edit.pos ? `i:${edit.pos.line}` : \"ieof\";\n\t\t\t\tbreak;\n\t\t\tcase \"prepend\":\n\t\t\t\tlineKey = edit.pos ? `ib:${edit.pos.line}` : \"ibef\";\n\t\t\t\tbreak;\n\t\t}\n\t\tconst dstKey = `${lineKey}:${edit.lines.join(\"\\n\")}`;\n\t\tif (seenEditKeys.has(dstKey)) {\n\t\t\tdedupIndices.add(i);\n\t\t} else {\n\t\t\tseenEditKeys.set(dstKey, i);\n\t\t}\n\t}\n\tif (dedupIndices.size > 0) {\n\t\tfor (let i = edits.length - 1; i >= 0; i--) {\n\t\t\tif (dedupIndices.has(i)) edits.splice(i, 1);\n\t\t}\n\t}\n\n\t// Compute sort key (descending) — bottom-up application\n\tconst annotated = edits.map((edit, idx) => {\n\t\tlet sortLine: number;\n\t\tlet precedence: number;\n\t\tswitch (edit.op) {\n\t\t\tcase \"replace\":\n\t\t\t\tsortLine = edit.end ? edit.end.line : edit.pos.line;\n\t\t\t\tprecedence = 0;\n\t\t\t\tbreak;\n\t\t\tcase \"append\":\n\t\t\t\tsortLine = edit.pos ? edit.pos.line : fileLines.length + 1;\n\t\t\t\tprecedence = 1;\n\t\t\t\tbreak;\n\t\t\tcase \"prepend\":\n\t\t\t\tsortLine = edit.pos ? edit.pos.line : 0;\n\t\t\t\tprecedence = 2;\n\t\t\t\tbreak;\n\t\t}\n\t\treturn { edit, idx, sortLine, precedence };\n\t});\n\n\tannotated.sort((a, b) => b.sortLine - a.sortLine || a.precedence - b.precedence || a.idx - b.idx);\n\n\tfunction trackFirstChanged(line: number): void {\n\t\tif (firstChangedLine === undefined || line < firstChangedLine) {\n\t\t\tfirstChangedLine = line;\n\t\t}\n\t}\n\n\t// Apply edits bottom-up\n\tfor (const { edit, idx } of annotated) {\n\t\tswitch (edit.op) {\n\t\t\tcase \"replace\": {\n\t\t\t\tif (!edit.end) {\n\t\t\t\t\tconst origLines = originalFileLines.slice(edit.pos.line - 1, edit.pos.line);\n\t\t\t\t\tconst newLines = edit.lines;\n\t\t\t\t\tif (origLines.length === newLines.length && origLines.every((line, i) => line === newLines[i])) {\n\t\t\t\t\t\tnoopEdits.push({\n\t\t\t\t\t\t\teditIndex: idx,\n\t\t\t\t\t\t\tloc: `${edit.pos.line}#${edit.pos.hash}`,\n\t\t\t\t\t\t\tcurrent: origLines.join(\"\\n\"),\n\t\t\t\t\t\t});\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tfileLines.splice(edit.pos.line - 1, 1, ...newLines);\n\t\t\t\t\ttrackFirstChanged(edit.pos.line);\n\t\t\t\t} else {\n\t\t\t\t\tconst count = edit.end.line - edit.pos.line + 1;\n\t\t\t\t\tconst newLines = [...edit.lines];\n\t\t\t\t\tconst trailingReplacementLine = newLines[newLines.length - 1]?.trimEnd();\n\t\t\t\t\tconst nextSurvivingLine = fileLines[edit.end.line]?.trimEnd();\n\t\t\t\t\tif (\n\t\t\t\t\t\tshouldAutocorrect(trailingReplacementLine, nextSurvivingLine) &&\n\t\t\t\t\t\tfileLines[edit.end.line - 1]?.trimEnd() !== trailingReplacementLine\n\t\t\t\t\t) {\n\t\t\t\t\t\tnewLines.pop();\n\t\t\t\t\t\twarnings.push(\n\t\t\t\t\t\t\t`Auto-corrected range replace ${edit.pos.line}#${edit.pos.hash}-${edit.end.line}#${edit.end.hash}: removed trailing replacement line \"${trailingReplacementLine}\" that duplicated next surviving line`,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tconst leadingReplacementLine = newLines[0]?.trimEnd();\n\t\t\t\t\tconst prevSurvivingLine = fileLines[edit.pos.line - 2]?.trimEnd();\n\t\t\t\t\tif (\n\t\t\t\t\t\tshouldAutocorrect(leadingReplacementLine, prevSurvivingLine) &&\n\t\t\t\t\t\tfileLines[edit.pos.line - 1]?.trimEnd() !== leadingReplacementLine\n\t\t\t\t\t) {\n\t\t\t\t\t\tnewLines.shift();\n\t\t\t\t\t\twarnings.push(\n\t\t\t\t\t\t\t`Auto-corrected range replace ${edit.pos.line}#${edit.pos.hash}-${edit.end.line}#${edit.end.hash}: removed leading replacement line \"${leadingReplacementLine}\" that duplicated preceding surviving line`,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tfileLines.splice(edit.pos.line - 1, count, ...newLines);\n\t\t\t\t\ttrackFirstChanged(edit.pos.line);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"append\": {\n\t\t\t\tconst inserted = edit.lines;\n\t\t\t\tif (inserted.length === 0) {\n\t\t\t\t\tnoopEdits.push({\n\t\t\t\t\t\teditIndex: idx,\n\t\t\t\t\t\tloc: edit.pos ? `${edit.pos.line}#${edit.pos.hash}` : \"EOF\",\n\t\t\t\t\t\tcurrent: edit.pos ? originalFileLines[edit.pos.line - 1] : \"\",\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (edit.pos) {\n\t\t\t\t\tfileLines.splice(edit.pos.line, 0, ...inserted);\n\t\t\t\t\ttrackFirstChanged(edit.pos.line + 1);\n\t\t\t\t} else {\n\t\t\t\t\tif (fileLines.length === 1 && fileLines[0] === \"\") {\n\t\t\t\t\t\tfileLines.splice(0, 1, ...inserted);\n\t\t\t\t\t\ttrackFirstChanged(1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfileLines.splice(fileLines.length, 0, ...inserted);\n\t\t\t\t\t\ttrackFirstChanged(fileLines.length - inserted.length + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"prepend\": {\n\t\t\t\tconst inserted = edit.lines;\n\t\t\t\tif (inserted.length === 0) {\n\t\t\t\t\tnoopEdits.push({\n\t\t\t\t\t\teditIndex: idx,\n\t\t\t\t\t\tloc: edit.pos ? `${edit.pos.line}#${edit.pos.hash}` : \"BOF\",\n\t\t\t\t\t\tcurrent: edit.pos ? originalFileLines[edit.pos.line - 1] : \"\",\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (edit.pos) {\n\t\t\t\t\tfileLines.splice(edit.pos.line - 1, 0, ...inserted);\n\t\t\t\t\ttrackFirstChanged(edit.pos.line);\n\t\t\t\t} else {\n\t\t\t\t\tif (fileLines.length === 1 && fileLines[0] === \"\") {\n\t\t\t\t\t\tfileLines.splice(0, 1, ...inserted);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfileLines.splice(0, 0, ...inserted);\n\t\t\t\t\t}\n\t\t\t\t\ttrackFirstChanged(1);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tlines: fileLines.join(\"\\n\"),\n\t\tfirstChangedLine,\n\t\t...(warnings.length > 0 ? { warnings } : {}),\n\t\t...(noopEdits.length > 0 ? { noopEdits } : {}),\n\t};\n}\n"]}

package/node_modules/@gsd/pi-coding-agent/dist/core/tools/hashline.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=hashline.test.d.ts.map

package/node_modules/@gsd/pi-coding-agent/dist/core/tools/hashline.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashline.test.d.ts","sourceRoot":"","sources":["../../../src/core/tools/hashline.test.ts"],"names":[],"mappings":""}