@kenkaiiii/ggcoder 4.14.2 → 4.15.0

package/dist/core/hashline-edit-benchmark.js

@@ -0,0 +1,342 @@
+/**
+ * Hashline (hash-anchored edits) vs current string-match edit — real-API
+ * measurement of whether Feature #2 is worth building.
+ *
+ * Two strategies produce the SAME edit against the SAME file, measured against
+ * live gpt-5.5:
+ *
+ *   BASELINE (what ggcoder does today): the model emits { old_text, new_text }
+ *   edits where old_text must be copied VERBATIM from the file with enough
+ *   surrounding context to match uniquely (this is exactly our edit tool's
+ *   contract — see tools/edit.ts). The reproduced context is what costs output
+ *   tokens, and a non-unique / drifted old_text is what causes apply failures.
+ *
+ *   HASHLINE (the proposed feature): every line is shown with a short content-
+ *   hash anchor (`a3f1│<line>`). The model references anchors instead of
+ *   reproducing text — it emits { from, to, lines } where from/to are anchors.
+ *   Anchors are unique by construction, so an edit either resolves exactly or is
+ *   rejected (never silently corrupts), and the model writes far fewer tokens.
+ *
+ * We measure, per task: model OUTPUT tokens (the headline -61% claim), whether
+ * the edit applied cleanly + produced the correct file, and an anchor-uniqueness
+ * / safety check. Edits are graded deterministically — no second model needed.
+ *
+ * Usage:
+ *   npx tsx src/core/hashline-edit-benchmark.ts
+ *
+ * Env overrides:
+ *   GG_HL_PROVIDER / GG_HL_MODEL   (default openai / gpt-5.5)
+ *   GG_HL_REPEAT                   (runs per task, default 1 — raise to average noise)
+ */
+import { stream } from "@kenkaiiii/gg-ai";
+import { AuthStorage } from "./auth-storage.js";
+import { anchorFile } from "./hashline.js";
+export function genFile(lines) {
+    const head = [
+        `import { EventEmitter } from "node:events";`,
+        `import { performance } from "node:perf_hooks";`,
+        ``,
+        `/** Auto-generated module with ${lines} lines for benchmarking. */`,
+        `export interface Config {`,
+        `  retries: number;`,
+        `  timeoutMs: number;`,
+        `  label: string;`,
+        `}`,
+        ``,
+        `const DEFAULT_TIMEOUT = 3000;`,
+        ``,
+    ];
+    const body = [];
+    let n = 0;
+    while (head.length + body.length < lines - 12) {
+        body.push(`export function task${n}(x: number): number {`, `  // step ${n}`, `  const y = x * ${n + 1} + DEFAULT_TIMEOUT;`, `  return y - ${n};`, `}`, ``);
+        n++;
+    }
+    const tail = [
+        `export function computeTimeout(cfg: Config): number {`,
+        `  return cfg.timeoutMs > 0 ? cfg.timeoutMs : DEFAULT_TIMEOUT;`,
+        `}`,
+        ``,
+        `export const SENTINEL_TAIL = "anchor_${lines}_end";`,
+        ``,
+    ];
+    return [...head, ...body, ...tail].join("\n");
+}
+export function buildTasks() {
+    const sizes = [
+        { name: "small", lines: 40 },
+        { name: "medium", lines: 160 },
+        { name: "large", lines: 420 },
+    ];
+    return sizes.map((s) => ({
+        name: s.name,
+        approxLines: s.lines,
+        file: genFile(s.lines),
+        instruction: "Change `computeTimeout` so that when `cfg.retries` is greater than 0 it returns " +
+            "`cfg.timeoutMs * cfg.retries` (capped at 30000), otherwise it keeps the existing behaviour. " +
+            "Also add a one-line JSDoc comment above the function describing it.",
+        mustContain: ["cfg.timeoutMs * cfg.retries", "30000", "computeTimeout"],
+        mustPreserve: ["DEFAULT_TIMEOUT = 3000", `SENTINEL_TAIL = "anchor_${s.lines}_end"`, "task0"],
+    }));
+}
+// ── Hashline anchoring lives in ./hashline.ts (shared with the read/edit tools) ──
+// ── Prompts ─────────────────────────────────────────────────
+function baselinePrompt(file, instruction) {
+    return [
+        {
+            role: "system",
+            content: "You are a coding agent's edit engine. Apply the edit by emitting search/replace " +
+                "operations. Output ONLY raw JSON, no markdown fence, in this shape:\n" +
+                `{"edits":[{"old_text":"<verbatim slice from the file>","new_text":"<replacement>"}]}\n` +
+                "RULES: old_text MUST be copied verbatim from the file, including enough surrounding " +
+                "context lines that it matches EXACTLY ONE location. Do not paraphrase. Do not explain.",
+        },
+        { role: "user", content: `FILE:\n\`\`\`ts\n${file}\n\`\`\`\n\nEDIT: ${instruction}` },
+    ];
+}
+function hashlinePrompt(rendered, instruction) {
+    return [
+        {
+            role: "system",
+            content: "You are a coding agent's edit engine. The file is shown with a unique 4-char anchor " +
+                "before each line as `anchor│code`. The anchors are NOT part of the file. Apply the edit " +
+                "by referencing anchors instead of retyping code. Output ONLY raw JSON, no markdown fence:\n" +
+                `{"edits":[{"from":"<anchor>","to":"<anchor>","lines":["<new line 1>","<new line 2>"]}]}\n` +
+                "Each edit REPLACES the inclusive span of lines from anchor `from` to anchor `to` with the " +
+                "`lines` array (write the full replacement lines, with correct indentation; never include the " +
+                "anchor prefixes). For a single-line change, set from === to. To ADD new lines (e.g. a JSDoc " +
+                "comment above a function), pick the existing line you are augmenting as both from and to, and " +
+                "put [new line(s), ...that original line] in `lines`. Every `from`/`to` MUST be an anchor that " +
+                "appears in the file. Do not explain.",
+        },
+        { role: "user", content: `FILE (anchored):\n${rendered}\n\nEDIT: ${instruction}` },
+    ];
+}
+export function stripFence(s) {
+    return s
+        .trim()
+        .replace(/^```[a-z]*\n?/i, "")
+        .replace(/\n?```$/i, "")
+        .trim();
+}
+export function checkAnchors(file, task) {
+    for (const s of task.mustContain)
+        if (!file.includes(s))
+            return false;
+    for (const s of task.mustPreserve)
+        if (!file.includes(s))
+            return false;
+    return true;
+}
+export function applyBaseline(raw, task) {
+    let parsed;
+    try {
+        parsed = JSON.parse(stripFence(raw));
+    }
+    catch {
+        return { applied: false, correct: false, ambiguousEdits: 0, parsedEdits: 0 };
+    }
+    const edits = parsed.edits ?? [];
+    let file = task.file;
+    let applied = edits.length > 0;
+    let ambiguous = 0;
+    for (const e of edits) {
+        const occ = file.split(e.old_text).length - 1;
+        if (occ === 1) {
+            file = file.replace(e.old_text, e.new_text);
+        }
+        else {
+            // 0 = not found (drift/paraphrase), >1 = non-unique → our real tool rejects both.
+            ambiguous++;
+            applied = false;
+        }
+    }
+    return {
+        applied,
+        correct: applied && checkAnchors(file, task),
+        ambiguousEdits: ambiguous,
+        parsedEdits: edits.length,
+    };
+}
+export function applyHashline(raw, task, anchored) {
+    let parsed;
+    try {
+        parsed = JSON.parse(stripFence(raw));
+    }
+    catch {
+        return { applied: false, correct: false, ambiguousEdits: 0, parsedEdits: 0 };
+    }
+    const edits = parsed.edits ?? [];
+    // Resolve every anchor first; reject the whole patch if any is unresolvable
+    // (this is the corruption-avoidance property — anchors must hit exactly once).
+    let ambiguous = 0;
+    const resolved = [];
+    for (const e of edits) {
+        const from = anchored.anchorToIndex.get(e.from);
+        const to = anchored.anchorToIndex.get(e.to);
+        if (from === undefined || to === undefined || from > to) {
+            ambiguous++;
+            continue;
+        }
+        resolved.push({ from, to, lines: e.lines ?? [] });
+    }
+    if (resolved.length !== edits.length || edits.length === 0) {
+        return { applied: false, correct: false, ambiguousEdits: ambiguous, parsedEdits: edits.length };
+    }
+    // Apply bottom-up so earlier indices stay valid.
+    resolved.sort((a, b) => b.from - a.from);
+    const out = [...anchored.lines];
+    for (const r of resolved)
+        out.splice(r.from, r.to - r.from + 1, ...r.lines);
+    const file = out.join("\n");
+    return {
+        applied: true,
+        correct: checkAnchors(file, task),
+        ambiguousEdits: ambiguous,
+        parsedEdits: edits.length,
+    };
+}
+function sleep(ms) {
+    return new Promise((r) => setTimeout(r, ms));
+}
+async function call(provider, model, c, messages, maxTokens) {
+    let lastErr;
+    for (let attempt = 0; attempt < 4; attempt++) {
+        try {
+            return await callOnce(provider, model, c, messages, maxTokens);
+        }
+        catch (err) {
+            lastErr = err;
+            await sleep(2000 * (attempt + 1));
+        }
+    }
+    throw lastErr;
+}
+async function callOnce(provider, model, c, messages, maxTokens) {
+    const start = Date.now();
+    let text = "";
+    const result = stream({
+        provider: provider,
+        model,
+        messages,
+        maxTokens,
+        apiKey: c.apiKey,
+        baseUrl: c.baseUrl,
+        accountId: c.accountId,
+    });
+    for await (const event of result) {
+        if (event.type === "text_delta")
+            text += event.text;
+    }
+    const response = await result.response;
+    const content = response.message.content;
+    const finalText = typeof content === "string"
+        ? content
+        : content
+            .filter((p) => p.type === "text")
+            .map((p) => p.text ?? "")
+            .join("");
+    return {
+        text: finalText || text,
+        outputTokens: response.usage.outputTokens,
+        inputTokens: response.usage.inputTokens,
+        wallMs: Date.now() - start,
+    };
+}
+async function main() {
+    const provider = process.env.GG_HL_PROVIDER ?? "openai";
+    const model = process.env.GG_HL_MODEL ?? "gpt-5.5";
+    const repeat = Math.max(1, parseInt(process.env.GG_HL_REPEAT ?? "1", 10));
+    const auth = new AuthStorage();
+    await auth.load();
+    const cr = await auth.resolveCredentials(provider);
+    const creds = { apiKey: cr.accessToken, baseUrl: cr.baseUrl, accountId: cr.accountId };
+    console.log(`\n🔗 Hashline edit benchmark — ${provider}/${model} (repeat ${repeat})\n`);
+    const tasks = buildTasks();
+    const rows = [];
+    for (const task of tasks) {
+        const anchored = anchorFile(task.file);
+        const agg = {
+            task: task.name,
+            lines: task.approxLines,
+            baseOutTok: 0,
+            baseInTok: 0,
+            baseOk: true,
+            baseAmbiguous: 0,
+            hlOutTok: 0,
+            hlInTok: 0,
+            hlOk: true,
+            hlAmbiguous: 0,
+        };
+        let baseOkCount = 0;
+        let hlOkCount = 0;
+        for (let r = 0; r < repeat; r++) {
+            process.stdout.write(`▶ ${task.name} (${task.approxLines} lines) run ${r + 1}/${repeat}\n`);
+            await sleep(1500);
+            const base = await call(provider, model, creds, baselinePrompt(task.file, task.instruction), 4096);
+            const baseOut = applyBaseline(base.text, task);
+            agg.baseOutTok += base.outputTokens;
+            agg.baseInTok += base.inputTokens;
+            agg.baseAmbiguous += baseOut.ambiguousEdits;
+            if (baseOut.correct)
+                baseOkCount++;
+            process.stdout.write(`   baseline: ${base.outputTokens} out tok | ${baseOut.correct ? "OK" : "FAIL"}` +
+                `${baseOut.ambiguousEdits ? ` (${baseOut.ambiguousEdits} non-unique)` : ""}\n`);
+            await sleep(1500);
+            const hl = await call(provider, model, creds, hashlinePrompt(anchored.rendered, task.instruction), 2048);
+            const hlOut = applyHashline(hl.text, task, anchored);
+            agg.hlOutTok += hl.outputTokens;
+            agg.hlInTok += hl.inputTokens;
+            agg.hlAmbiguous += hlOut.ambiguousEdits;
+            if (hlOut.correct)
+                hlOkCount++;
+            process.stdout.write(`   hashline: ${hl.outputTokens} out tok | ${hlOut.correct ? "OK" : "FAIL"}` +
+                `${hlOut.ambiguousEdits ? ` (${hlOut.ambiguousEdits} unresolved)` : ""}\n\n`);
+        }
+        agg.baseOutTok = Math.round(agg.baseOutTok / repeat);
+        agg.baseInTok = Math.round(agg.baseInTok / repeat);
+        agg.hlOutTok = Math.round(agg.hlOutTok / repeat);
+        agg.hlInTok = Math.round(agg.hlInTok / repeat);
+        agg.baseOk = baseOkCount === repeat;
+        agg.hlOk = hlOkCount === repeat;
+        rows.push(agg);
+    }
+    // ── Report ──
+    console.log("══════════════════════ RESULTS ══════════════════════\n");
+    console.log("Task    Lines | base out-tok | hashline out-tok |  Δ out  | in-tok base/hl | OK base/hl");
+    for (const r of rows) {
+        const delta = r.baseOutTok > 0 ? ((r.baseOutTok - r.hlOutTok) / r.baseOutTok) * 100 : 0;
+        console.log(`${r.task.padEnd(7)} ${String(r.lines).padStart(4)} | ` +
+            `${String(r.baseOutTok).padStart(12)} | ${String(r.hlOutTok).padStart(16)} | ` +
+            `${((delta >= 0 ? "-" : "+") + Math.abs(delta).toFixed(0) + "%").padStart(7)} | ` +
+            `${String(r.baseInTok).padStart(6)}/${String(r.hlInTok).padStart(6)} | ` +
+            `${r.baseOk ? "OK" : "FAIL"}/${r.hlOk ? "OK" : "FAIL"}`);
+    }
+    const sum = (f) => rows.reduce((s, r) => s + f(r), 0);
+    const baseOut = sum((r) => r.baseOutTok);
+    const hlOut = sum((r) => r.hlOutTok);
+    const baseIn = sum((r) => r.baseInTok);
+    const hlIn = sum((r) => r.hlInTok);
+    console.log(`\nOutput tokens: baseline ${baseOut} vs hashline ${hlOut} ` +
+        `→ ${baseOut > hlOut ? `${(((baseOut - hlOut) / baseOut) * 100).toFixed(0)}% fewer` : "no win"} ` +
+        `(claim from oh-my-pi: ~61% fewer)`);
+    console.log(`Input tokens:  baseline ${baseIn} vs hashline ${hlIn} ` +
+        `(hashline adds the anchor column: ${hlIn > baseIn ? `+${(((hlIn - baseIn) / baseIn) * 100).toFixed(0)}% input` : "no overhead"})`);
+    console.log(`Correctness:   baseline ${rows.filter((r) => r.baseOk).length}/${rows.length}, ` +
+        `hashline ${rows.filter((r) => r.hlOk).length}/${rows.length}`);
+    console.log(`Locator misses: baseline ${sum((r) => r.baseAmbiguous)} non-unique/not-found, ` +
+        `hashline ${sum((r) => r.hlAmbiguous)} unresolved (rejected before corruption)`);
+    console.log(`\nVerdict: hashline wins if output-token drop is large AND correctness ≥ baseline. ` +
+        `Net input overhead from the anchor column is the cost to weigh against it.\n`);
+}
+// Run when executed directly (not when imported by tests).
+const isDirectRun = process.argv[1]?.endsWith("hashline-edit-benchmark.ts") ||
+    process.argv[1]?.endsWith("hashline-edit-benchmark.js") ||
+    process.argv[1]?.endsWith("hashline-edit-benchmark");
+if (isDirectRun) {
+    main().catch((err) => {
+        console.error("Benchmark failed:", err);
+        process.exit(1);
+    });
+}
+//# sourceMappingURL=hashline-edit-benchmark.js.map

package/dist/core/hashline-edit-benchmark.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashline-edit-benchmark.js","sourceRoot":"","sources":["../../src/core/hashline-edit-benchmark.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,EAAE,MAAM,EAA8C,MAAM,kBAAkB,CAAC;AACtF,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAqB,MAAM,eAAe,CAAC;AAe9D,MAAM,UAAU,OAAO,CAAC,KAAa;IACnC,MAAM,IAAI,GAAG;QACX,6CAA6C;QAC7C,gDAAgD;QAChD,EAAE;QACF,kCAAkC,KAAK,6BAA6B;QACpE,2BAA2B;QAC3B,oBAAoB;QACpB,sBAAsB;QACtB,kBAAkB;QAClB,GAAG;QACH,EAAE;QACF,+BAA+B;QAC/B,EAAE;KACH,CAAC;IACF,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,EAAE,EAAE,CAAC;QAC9C,IAAI,CAAC,IAAI,CACP,uBAAuB,CAAC,uBAAuB,EAC/C,aAAa,CAAC,EAAE,EAChB,mBAAmB,CAAC,GAAG,CAAC,qBAAqB,EAC7C,gBAAgB,CAAC,GAAG,EACpB,GAAG,EACH,EAAE,CACH,CAAC;QACF,CAAC,EAAE,CAAC;IACN,CAAC;IACD,MAAM,IAAI,GAAG;QACX,uDAAuD;QACvD,+DAA+D;QAC/D,GAAG;QACH,EAAE;QACF,wCAAwC,KAAK,QAAQ;QACrD,EAAE;KACH,CAAC;IACF,OAAO,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,UAAU;IACxB,MAAM,KAAK,GAAG;QACZ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;QAC5B,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;QAC9B,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE;KAC9B,CAAC;IACF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACvB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,WAAW,EAAE,CAAC,CAAC,KAAK;QACpB,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;QACtB,WAAW,EACT,kFAAkF;YAClF,8FAA8F;YAC9F,qEAAqE;QACvE,WAAW,EAAE,CAAC,6BAA6B,EAAE,OAAO,EAAE,gBAAgB,CAAC;QACvE,YAAY,EAAE,CAAC,wBAAwB,EAAE,2BAA2B,CAAC,CAAC,KAAK,OAAO,EAAE,OAAO,CAAC;KAC7F,CAAC,CAAC,CAAC;AACN,CAAC;AAED,oFAAoF;AAEpF,+DAA+D;AAE/D,SAAS,cAAc,CAAC,IAAY,EAAE,WAAmB;IACvD,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EACL,kFAAkF;gBAClF,uEAAuE;gBACvE,wFAAwF;gBACxF,sFAAsF;gBACtF,wFAAwF;SAC3F;QACD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,oBAAoB,IAAI,qBAAqB,WAAW,EAAE,EAAE;KACtF,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,QAAgB,EAAE,WAAmB;IAC3D,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EACL,sFAAsF;gBACtF,0FAA0F;gBAC1F,6FAA6F;gBAC7F,2FAA2F;gBAC3F,4FAA4F;gBAC5F,+FAA+F;gBAC/F,8FAA8F;gBAC9F,gGAAgG;gBAChG,gGAAgG;gBAChG,sCAAsC;SACzC;QACD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,qBAAqB,QAAQ,aAAa,WAAW,EAAE,EAAE;KACnF,CAAC;AACJ,CAAC;AAYD,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,OAAO,CAAC;SACL,IAAI,EAAE;SACN,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC;SAC7B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,IAAc;IACvD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW;QAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACtE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,YAAY;QAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACvE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,GAAW,EAAE,IAAc;IACvD,IAAI,MAAiE,CAAC;IACtE,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;IAC/E,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;IACjC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACrB,IAAI,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,kFAAkF;YAClF,SAAS,EAAE,CAAC;YACZ,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO;QACL,OAAO;QACP,OAAO,EAAE,OAAO,IAAI,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;QAC5C,cAAc,EAAE,SAAS;QACzB,WAAW,EAAE,KAAK,CAAC,MAAM;KAC1B,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,GAAW,EAAE,IAAc,EAAE,QAAsB;IAC/E,IAAI,MAAwE,CAAC;IAC7E,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;IAC/E,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;IACjC,4EAA4E;IAC5E,+EAA+E;IAC/E,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,QAAQ,GAAyD,EAAE,CAAC;IAC1E,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,EAAE,GAAG,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YACxD,SAAS,EAAE,CAAC;YACZ,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IAClG,CAAC;IACD,iDAAiD;IACjD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO;QACL,OAAO,EAAE,IAAI;QACb,OAAO,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;QACjC,cAAc,EAAE,SAAS;QACzB,WAAW,EAAE,KAAK,CAAC,MAAM;KAC1B,CAAC;AACJ,CAAC;AAWD,SAAS,KAAK,CAAC,EAAU;IACvB,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC;AAQD,KAAK,UAAU,IAAI,CACjB,QAAgB,EAChB,KAAa,EACb,CAAQ,EACR,QAAmB,EACnB,SAAiB;IAEjB,IAAI,OAAgB,CAAC;IACrB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,MAAM,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACjE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,GAAG,GAAG,CAAC;YACd,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,MAAM,OAAO,CAAC;AAChB,CAAC;AAED,KAAK,UAAU,QAAQ,CACrB,QAAgB,EAChB,KAAa,EACb,CAAQ,EACR,QAAmB,EACnB,SAAiB;IAEjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,MAAM,MAAM,GAAG,MAAM,CAAC;QACpB,QAAQ,EAAE,QAAiB;QAC3B,KAAK;QACL,QAAQ;QACR,SAAS;QACT,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,SAAS,EAAE,CAAC,CAAC,SAAS;KACvB,CAAC,CAAC;IACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,MAAoC,EAAE,CAAC;QAC/D,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;YAAE,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC;IACtD,CAAC;IACD,MAAM,QAAQ,GAAuC,MAAM,MAAM,CAAC,QAAQ,CAAC;IAC3E,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC;IACzC,MAAM,SAAS,GACb,OAAO,OAAO,KAAK,QAAQ;QACzB,CAAC,CAAC,OAAO;QACT,CAAC,CAAE,OAAkD;aAChD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;aAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;aACxB,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,OAAO;QACL,IAAI,EAAE,SAAS,IAAI,IAAI;QACvB,YAAY,EAAE,QAAQ,CAAC,KAAK,CAAC,YAAY;QACzC,WAAW,EAAE,QAAQ,CAAC,KAAK,CAAC,WAAW;QACvC,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;KAC3B,CAAC;AACJ,CAAC;AAiBD,KAAK,UAAU,IAAI;IACjB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,IAAI,QAAQ,CAAC;IACxD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,SAAS,CAAC;IACnD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;IAE1E,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC;IAC/B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,KAAK,GAAU,EAAE,MAAM,EAAE,EAAE,CAAC,WAAW,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC;IAE9F,OAAO,CAAC,GAAG,CAAC,kCAAkC,QAAQ,IAAI,KAAK,YAAY,MAAM,KAAK,CAAC,CAAC;IAExF,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAU,EAAE,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,GAAG,GAAQ;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,WAAW;YACvB,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,IAAI;YACZ,aAAa,EAAE,CAAC;YAChB,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,IAAI;YACV,WAAW,EAAE,CAAC;SACf,CAAC;QACF,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,WAAW,eAAe,CAAC,GAAG,CAAC,IAAI,MAAM,IAAI,CAAC,CAAC;YAC5F,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,IAAI,GAAG,MAAM,IAAI,CACrB,QAAQ,EACR,KAAK,EACL,KAAK,EACL,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,EAC3C,IAAI,CACL,CAAC;YACF,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC/C,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC,YAAY,CAAC;YACpC,GAAG,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC;YAClC,GAAG,CAAC,aAAa,IAAI,OAAO,CAAC,cAAc,CAAC;YAC5C,IAAI,OAAO,CAAC,OAAO;gBAAE,WAAW,EAAE,CAAC;YACnC,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gBAAgB,IAAI,CAAC,YAAY,cAAc,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE;gBAC9E,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,cAAc,cAAc,CAAC,CAAC,CAAC,EAAE,IAAI,CACjF,CAAC;YAEF,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;YAClB,MAAM,EAAE,GAAG,MAAM,IAAI,CACnB,QAAQ,EACR,KAAK,EACL,KAAK,EACL,cAAc,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,EACnD,IAAI,CACL,CAAC;YACF,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YACrD,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,YAAY,CAAC;YAChC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,WAAW,CAAC;YAC9B,GAAG,CAAC,WAAW,IAAI,KAAK,CAAC,cAAc,CAAC;YACxC,IAAI,KAAK,CAAC,OAAO;gBAAE,SAAS,EAAE,CAAC;YAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gBAAgB,EAAE,CAAC,YAAY,cAAc,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE;gBAC1E,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,cAAc,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,CAC/E,CAAC;QACJ,CAAC;QAED,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;QACrD,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC;QACnD,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC;QACjD,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC;QAC/C,GAAG,CAAC,MAAM,GAAG,WAAW,KAAK,MAAM,CAAC;QACpC,GAAG,CAAC,IAAI,GAAG,SAAS,KAAK,MAAM,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,eAAe;IACf,OAAO,CAAC,GAAG,CAAC,yDAAyD,CAAC,CAAC;IACvE,OAAO,CAAC,GAAG,CACT,yFAAyF,CAC1F,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,OAAO,CAAC,GAAG,CACT,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;YACrD,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK;YAC9E,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;YACjF,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;YACxE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAC1D,CAAC;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAqB,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CACT,6BAA6B,OAAO,gBAAgB,KAAK,GAAG;QAC1D,KAAK,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,GAAG;QACjG,mCAAmC,CACtC,CAAC;IACF,OAAO,CAAC,GAAG,CACT,2BAA2B,MAAM,gBAAgB,IAAI,GAAG;QACtD,qCAAqC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,aAAa,GAAG,CACrI,CAAC;IACF,OAAO,CAAC,GAAG,CACT,2BAA2B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI;QAC/E,YAAY,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CACjE,CAAC;IACF,OAAO,CAAC,GAAG,CACT,4BAA4B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,yBAAyB;QAC9E,YAAY,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,0CAA0C,CAClF,CAAC;IACF,OAAO,CAAC,GAAG,CACT,qFAAqF;QACnF,8EAA8E,CACjF,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,MAAM,WAAW,GACf,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,4BAA4B,CAAC;IACvD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,4BAA4B,CAAC;IACvD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,yBAAyB,CAAC,CAAC;AAEvD,IAAI,WAAW,EAAE,CAAC;IAChB,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;QACnB,OAAO,CAAC,KAAK,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/core/hashline-edit-benchmark.test.d.ts

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

package/dist/core/hashline-edit-benchmark.test.d.ts.map

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

package/dist/core/hashline-edit-benchmark.test.js

@@ -0,0 +1,141 @@
+import { describe, it, expect } from "vitest";
+import { lineHash, anchorFile } from "./hashline.js";
+import { applyBaseline, applyHashline, checkAnchors, stripFence, genFile, buildTasks, } from "./hashline-edit-benchmark.js";
+/**
+ * These tests prove the DETERMINISTIC half of the hashline benchmark — the
+ * apply + grading logic that decides OK / FAIL / corruption. The live-model
+ * numbers are only trustworthy if this logic is correct, so we exercise it from
+ * every angle: anchor uniqueness, corruption-avoidance, multi-edit ordering,
+ * malformed input, and the string-match baseline's ambiguity handling.
+ */
+/** Build a minimal EditTask around a hand-written file for precise assertions. */
+function taskFor(file, mustContain, mustPreserve) {
+    return {
+        name: "t",
+        approxLines: file.split("\n").length,
+        file,
+        instruction: "",
+        mustContain,
+        mustPreserve,
+    };
+}
+const FN_FILE = [
+    "export function computeTimeout(cfg: Config): number {",
+    "  return cfg.timeoutMs > 0 ? cfg.timeoutMs : DEFAULT_TIMEOUT;",
+    "}",
+].join("\n");
+/** The anchor for a given 0-based line index of a file. */
+function anchorAt(file, index) {
+    return lineHash(file.split("\n")[index], index);
+}
+describe("hashline anchoring", () => {
+    it("1. folds line position into the hash so identical lines get distinct anchors", () => {
+        // Two identical lines at different positions must NOT collide.
+        expect(lineHash("  return x;", 3)).not.toBe(lineHash("  return x;", 9));
+        // Same content + same position is stable (deterministic).
+        expect(lineHash("  return x;", 3)).toBe(lineHash("  return x;", 3));
+    });
+    it("2. gives every line a unique resolvable anchor — even repeated blank lines", () => {
+        const file = ["a", "", "b", "", "c"].join("\n"); // two blank lines
+        const a = anchorFile(file);
+        expect(a.ambiguous.size).toBe(0);
+        expect(a.anchorToIndex.size).toBe(5);
+        expect([...a.anchorToIndex.values()].sort((x, y) => x - y)).toEqual([0, 1, 2, 3, 4]);
+    });
+    it("3. renders as `anchor│line` and the line column reconstructs the file", () => {
+        const a = anchorFile(FN_FILE);
+        const stripped = a.rendered
+            .split("\n")
+            .map((l) => l.slice(l.indexOf("│") + 1))
+            .join("\n");
+        expect(stripped).toBe(FN_FILE);
+    });
+});
+describe("applyHashline (proposed)", () => {
+    it("4. applies a valid single-line edit and grades it correct", () => {
+        const anchored = anchorFile(FN_FILE);
+        const anchor = anchorAt(FN_FILE, 1); // the `return ...` line
+        const raw = JSON.stringify({
+            edits: [
+                {
+                    from: anchor,
+                    to: anchor,
+                    lines: [
+                        "  return cfg.retries > 0 ? Math.min(cfg.timeoutMs * cfg.retries, 30000) : (cfg.timeoutMs > 0 ? cfg.timeoutMs : DEFAULT_TIMEOUT);",
+                    ],
+                },
+            ],
+        });
+        const task = taskFor(FN_FILE, ["cfg.timeoutMs * cfg.retries", "30000"], ["computeTimeout", "DEFAULT_TIMEOUT"]);
+        const out = applyHashline(raw, task, anchored);
+        expect(out.applied).toBe(true);
+        expect(out.correct).toBe(true);
+        expect(out.ambiguousEdits).toBe(0);
+    });
+    it("5. rejects an edit whose anchor is not in the file — never corrupts", () => {
+        const anchored = anchorFile(FN_FILE);
+        const raw = JSON.stringify({ edits: [{ from: "0000", to: "0000", lines: ["// hijacked"] }] });
+        const task = taskFor(FN_FILE, [], ["computeTimeout"]);
+        const out = applyHashline(raw, task, anchored);
+        expect(out.applied).toBe(false);
+        expect(out.correct).toBe(false);
+        expect(out.ambiguousEdits).toBe(1);
+    });
+    it("6. rejects a reversed range (from after to)", () => {
+        const anchored = anchorFile(FN_FILE);
+        const raw = JSON.stringify({
+            edits: [{ from: anchorAt(FN_FILE, 2), to: anchorAt(FN_FILE, 0), lines: ["x"] }],
+        });
+        const out = applyHashline(raw, taskFor(FN_FILE, [], []), anchored);
+        expect(out.applied).toBe(false);
+    });
+    it("7. applies multiple edits bottom-up so earlier indices stay valid", () => {
+        const file = ["const a = 1;", "const b = 2;", "const c = 3;"].join("\n");
+        const anchored = anchorFile(file);
+        const raw = JSON.stringify({
+            edits: [
+                { from: anchorAt(file, 0), to: anchorAt(file, 0), lines: ["const a = 10;"] },
+                { from: anchorAt(file, 2), to: anchorAt(file, 2), lines: ["const c = 30;"] },
+            ],
+        });
+        const out = applyHashline(raw, taskFor(file, ["const a = 10;", "const c = 30;"], ["const b = 2;"]), anchored);
+        expect(out.applied).toBe(true);
+        expect(out.correct).toBe(true);
+    });
+    it("8. returns a clean failure on malformed JSON instead of throwing", () => {
+        const anchored = anchorFile(FN_FILE);
+        expect(() => applyHashline("not json {", taskFor(FN_FILE, [], []), anchored)).not.toThrow();
+        const out = applyHashline("not json {", taskFor(FN_FILE, [], []), anchored);
+        expect(out.applied).toBe(false);
+        expect(out.parsedEdits).toBe(0);
+    });
+});
+describe("applyBaseline (current string-match) + helpers", () => {
+    it("9. applies a unique old_text but rejects a non-unique one", () => {
+        const unique = taskFor("const x = 1;\nconst y = 2;\n", ["const x = 100;"], ["const y = 2;"]);
+        const okRaw = JSON.stringify({
+            edits: [{ old_text: "const x = 1;", new_text: "const x = 100;" }],
+        });
+        expect(applyBaseline(okRaw, unique).applied).toBe(true);
+        // Same literal appears twice → the real edit tool refuses; so must we.
+        const dup = taskFor("const x = 1;\nconst y = 2;\nconst x = 1;\n", [], []);
+        const dupRaw = JSON.stringify({
+            edits: [{ old_text: "const x = 1;", new_text: "const x = 9;" }],
+        });
+        const out = applyBaseline(dupRaw, dup);
+        expect(out.applied).toBe(false);
+        expect(out.ambiguousEdits).toBe(1);
+    });
+    it("10. flags not-found old_text, strips code fences, and grades generated tasks", () => {
+        // Paraphrased / drifted old_text that isn't in the file → rejected.
+        const notFound = JSON.stringify({ edits: [{ old_text: "const z = 0;", new_text: "x" }] });
+        expect(applyBaseline(notFound, taskFor("const a = 1;\n", [], [])).applied).toBe(false);
+        // stripFence removes ```ts ... ``` wrappers the model sometimes adds.
+        expect(stripFence('```ts\n{"edits":[]}\n```')).toBe('{"edits":[]}');
+        // The generator + grader agree: a freshly generated file preserves its anchors.
+        const task = buildTasks()[0];
+        expect(genFile(task.approxLines)).toContain("computeTimeout");
+        expect(checkAnchors(task.file, taskFor(task.file, [], task.mustPreserve))).toBe(true);
+    });
+});
+//# sourceMappingURL=hashline-edit-benchmark.test.js.map

package/dist/core/hashline-edit-benchmark.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashline-edit-benchmark.test.js","sourceRoot":"","sources":["../../src/core/hashline-edit-benchmark.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,EACL,aAAa,EACb,aAAa,EACb,YAAY,EACZ,UAAU,EACV,OAAO,EACP,UAAU,GAEX,MAAM,8BAA8B,CAAC;AAEtC;;;;;;GAMG;AAEH,kFAAkF;AAClF,SAAS,OAAO,CAAC,IAAY,EAAE,WAAqB,EAAE,YAAsB;IAC1E,OAAO;QACL,IAAI,EAAE,GAAG;QACT,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;QACpC,IAAI;QACJ,WAAW,EAAE,EAAE;QACf,WAAW;QACX,YAAY;KACb,CAAC;AACJ,CAAC;AAED,MAAM,OAAO,GAAG;IACd,uDAAuD;IACvD,+DAA+D;IAC/D,GAAG;CACJ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAEb,2DAA2D;AAC3D,SAAS,QAAQ,CAAC,IAAY,EAAE,KAAa;IAC3C,OAAO,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAE,EAAE,KAAK,CAAC,CAAC;AACnD,CAAC;AAED,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,+DAA+D;QAC/D,MAAM,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;QACxE,0DAA0D;QAC1D,MAAM,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4EAA4E,EAAE,GAAG,EAAE;QACpF,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB;QACnE,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ;aACxB,KAAK,CAAC,IAAI,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;aACvC,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,wBAAwB;QAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;YACzB,KAAK,EAAE;gBACL;oBACE,IAAI,EAAE,MAAM;oBACZ,EAAE,EAAE,MAAM;oBACV,KAAK,EAAE;wBACL,kIAAkI;qBACnI;iBACF;aACF;SACF,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,OAAO,CAClB,OAAO,EACP,CAAC,6BAA6B,EAAE,OAAO,CAAC,EACxC,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CACtC,CAAC;QACF,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9F,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;YACzB,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;SAChF,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QACnE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,IAAI,GAAG,CAAC,cAAc,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;YACzB,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,eAAe,CAAC,EAAE;gBAC5E,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,eAAe,CAAC,EAAE;aAC7E;SACF,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,aAAa,CACvB,GAAG,EACH,OAAO,CAAC,IAAI,EAAE,CAAC,eAAe,EAAE,eAAe,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,EACnE,QAAQ,CACT,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,YAAY,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QAC5F,MAAM,GAAG,GAAG,aAAa,CAAC,YAAY,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gDAAgD,EAAE,GAAG,EAAE;IAC9D,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,MAAM,GAAG,OAAO,CAAC,8BAA8B,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;YAC3B,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC;SAClE,CAAC,CAAC;QACH,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAExD,uEAAuE;QACvE,MAAM,GAAG,GAAG,OAAO,CAAC,4CAA4C,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1E,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;YAC5B,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC;SAChE,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,oEAAoE;QACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1F,MAAM,CAAC,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,gBAAgB,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEvF,sEAAsE;QACtE,MAAM,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAEpE,gFAAgF;QAChF,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC,CAAE,CAAC;QAC9B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC;QAC9D,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/core/hashline.d.ts

@@ -0,0 +1,50 @@
+/**
+ * 4-hex-char anchor for a line. Position is folded into the hash so anchors are
+ * UNIQUE by construction (blank lines and repeated lines no longer collide).
+ * Resolution stays O(1) via a lookup map. `index` is the 0-based line index.
+ */
+export declare function lineHash(line: string, index: number): string;
+/** File rendered with `anchor│line` prefixes for the model to read. */
+export declare function renderWithAnchors(file: string): string;
+export interface AnchoredFile {
+    /** File rendered with `anchor│line` prefixes for the model to read. */
+    rendered: string;
+    /** anchor → line index (0-based). Only UNIQUE anchors are resolvable. */
+    anchorToIndex: Map<string, number>;
+    /** anchors that collided (ambiguous → unresolvable, like a stale-file reject). */
+    ambiguous: Set<string>;
+    lines: string[];
+}
+export declare function anchorFile(file: string): AnchoredFile;
+/**
+ * True when the line at `index` (0-based) still hashes to `hash`. Out-of-range
+ * indices return false. This is the staleness gate the edit tool uses.
+ */
+export declare function verifyAnchor(lines: string[], index: number, hash: string): boolean;
+/** Optional per-edit anchor guard: pin both endpoints of an edit by line+hash. */
+export interface EditAnchor {
+    /** 1-based line number of the first line of the edited span. */
+    start_line: number;
+    /** Content anchor of the first line (from a `read` with `anchors: true`). */
+    start_hash: string;
+    /** 1-based line number of the last line of the edited span. */
+    end_line: number;
+    /** Content anchor of the last line. */
+    end_hash: string;
+}
+export type AnchorFailure = "out_of_range" | "hash_mismatch" | "reversed";
+export interface AnchorResolution {
+    ok: boolean;
+    /** 0-based index of the first line (only when ok). */
+    startIndex?: number;
+    /** 0-based index of the last line (only when ok). */
+    endIndex?: number;
+    reason?: AnchorFailure;
+}
+/**
+ * Resolve an anchor against the current file lines (0-based). Rejects the edit
+ * if either endpoint is out of range, the range is reversed, or either hash no
+ * longer matches — the corruption-avoidance property.
+ */
+export declare function resolveAnchoredEdit(lines: string[], anchor: EditAnchor): AnchorResolution;
+//# sourceMappingURL=hashline.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hashline.d.ts","sourceRoot":"","sources":["../../src/core/hashline.ts"],"names":[],"mappings":"AAYA;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE5D;AAED,uEAAuE;AACvE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAKtD;AAED,MAAM,WAAW,YAAY;IAC3B,uEAAuE;IACvE,QAAQ,EAAE,MAAM,CAAC;IACjB,yEAAyE;IACzE,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,kFAAkF;IAClF,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAiBrD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAGlF;AAED,kFAAkF;AAClF,MAAM,WAAW,UAAU;IACzB,gEAAgE;IAChE,UAAU,EAAE,MAAM,CAAC;IACnB,6EAA6E;IAC7E,UAAU,EAAE,MAAM,CAAC;IACnB,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,CAAC;IACjB,uCAAuC;IACvC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,aAAa,GAAG,cAAc,GAAG,eAAe,GAAG,UAAU,CAAC;AAE1E,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,OAAO,CAAC;IACZ,sDAAsD;IACtD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,aAAa,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,UAAU,GAAG,gBAAgB,CAgBzF"}