@kenkaiiii/ggcoder 5.74.3 → 5.75.0

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

@@ -1,518 +0,0 @@
-/**
- * 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.
- *
- * The BASELINE apply path runs ggcoder's REAL edit ladder (fuzzy match +
- * indent-flex + blank-edge strip + dotdotdots — the same edit-diff functions
- * tools/edit.ts uses), so baseline numbers reflect what our tool actually
- * recovers, not a naive exact-replace.
- *
- * Usage:
- *   npx tsx src/core/hashline-edit-benchmark.ts
- *
- * Env overrides:
- *   GG_HL_PROVIDER / GG_HL_MODEL   (default anthropic / claude-sonnet-5)
- *   GG_HL_AUTH_KEY                 (auth.json key when it differs from the provider name,
- *                                   e.g. `xiaomi-credits` for provider `xiaomi`)
- *   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";
-import { fuzzyFindText, countOccurrences, applyMissingLeadingWhitespace, applyDotdotdots, stripBlankEdges, } from "../tools/edit-diff.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");
-}
-/** Near-identical handler blocks — uniqueness pressure for string matching. */
-export function genRepetitiveFile(blocks) {
-    const out = [
-        `import { parse, ok, error, type Request, type Response } from "./http.js";`,
-        ``,
-    ];
-    for (let i = 0; i < blocks; i++) {
-        out.push(`export function handleCase${i}(req: Request): Response {`, `  const value = parse(req);`, `  if (!value) {`, `    return error(400);`, `  }`, `  return ok(value);`, `}`, ``);
-    }
-    out.push(`export const HANDLER_COUNT = ${blocks};`, ``);
-    return out.join("\n");
-}
-export function buildTasks() {
-    const sizes = [
-        { name: "small", lines: 40 },
-        { name: "medium", lines: 160 },
-        { name: "large", lines: 420 },
-    ];
-    const sized = 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"],
-    }));
-    // Repetitive: 12 identical bodies; only handleCase7 must change.
-    const repFile = genRepetitiveFile(12);
-    const repetitive = {
-        name: "repeat",
-        approxLines: repFile.split("\n").length,
-        file: repFile,
-        instruction: "In `handleCase7` ONLY, change `error(400)` to `error(422)`. " +
-            "Every other handler must keep returning error(400).",
-        mustContain: ["error(422)"],
-        mustPreserve: ["HANDLER_COUNT = 12", "handleCase0", "handleCase11"],
-        validate: (file) => {
-            if (countOccurrences(file, "error(422)") !== 1)
-                return false;
-            if (countOccurrences(file, "error(400)") !== 11)
-                return false;
-            const seven = file.indexOf("export function handleCase7");
-            const eight = file.indexOf("export function handleCase8");
-            const idx = file.indexOf("error(422)");
-            return seven !== -1 && idx > seven && (eight === -1 || idx < eight);
-        },
-    };
-    // Multi-edit: three scattered changes in one response.
-    const multiFile = genFile(200);
-    const multi = {
-        name: "multi",
-        approxLines: 200,
-        file: multiFile,
-        instruction: "Make THREE changes: (1) rename the constant `DEFAULT_TIMEOUT` to `FALLBACK_TIMEOUT_MS` " +
-            "everywhere it appears, (2) add a `maxRetries: number;` field to the `Config` interface, " +
-            "(3) in `computeTimeout`, return `0` when `cfg.label` is the empty string (before the " +
-            "existing logic).",
-        mustContain: ["FALLBACK_TIMEOUT_MS", "maxRetries: number;", "cfg.label"],
-        mustPreserve: [`SENTINEL_TAIL = "anchor_200_end"`, "task0"],
-        validate: (file) => countOccurrences(file, "DEFAULT_TIMEOUT") === 0,
-    };
-    return [...sized, repetitive, multi];
-}
-// ── 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();
-}
-/**
- * Parse the model's JSON envelope, tolerating literal (unescaped) newlines and
- * tabs inside string values. In production, edits arrive as STRUCTURED
- * tool-call arguments — the JSON envelope is a benchmark artifact — so both
- * strategies get the same repair to keep the comparison about the EDIT FORMAT,
- * not about JSON string-escaping discipline.
- */
-export function parseEnvelope(raw) {
-    const text = stripFence(raw);
-    try {
-        return JSON.parse(text);
-    }
-    catch {
-        // Repair pass: escape raw control chars that appear inside string literals.
-        let out = "";
-        let inString = false;
-        let escaped = false;
-        for (const ch of text) {
-            if (inString) {
-                if (escaped) {
-                    out += ch;
-                    escaped = false;
-                    continue;
-                }
-                if (ch === "\\") {
-                    out += ch;
-                    escaped = true;
-                    continue;
-                }
-                if (ch === '"') {
-                    inString = false;
-                    out += ch;
-                    continue;
-                }
-                if (ch === "\n") {
-                    out += "\\n";
-                    continue;
-                }
-                if (ch === "\r") {
-                    out += "\\r";
-                    continue;
-                }
-                if (ch === "\t") {
-                    out += "\\t";
-                    continue;
-                }
-                out += ch;
-                continue;
-            }
-            if (ch === '"')
-                inString = true;
-            out += ch;
-        }
-        try {
-            return JSON.parse(out);
-        }
-        catch {
-            return null;
-        }
-    }
-}
-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;
-    if (task.validate && !task.validate(file))
-        return false;
-    return true;
-}
-/**
- * ggcoder's REAL apply ladder, mirroring tools/edit.ts:
- *   1. exact + smart-quote/dash fuzzy
- *   2. indent-flex
- *   3. blank-edge strip, retry 1+2
- *   4. dotdotdots elision
- * Returns the new working buffer or a failure reason.
- */
-export function applyLadder(working, oldText, newText) {
-    const occurrences = countOccurrences(working, oldText);
-    if (occurrences > 1)
-        return { ok: false, reason: "ambiguous" };
-    if (occurrences === 1) {
-        const match = fuzzyFindText(working, oldText);
-        if (match.found) {
-            return {
-                ok: true,
-                working: working.slice(0, match.index) + newText + working.slice(match.index + match.matchLength),
-            };
-        }
-    }
-    // not_found → fallback ladder (ambiguous deliberately does not fall through)
-    const flexed = applyMissingLeadingWhitespace(working, oldText, newText);
-    if (flexed !== null)
-        return { ok: true, working: flexed };
-    const stripped = stripBlankEdges(oldText);
-    if (stripped !== null) {
-        const strippedFlexed = applyMissingLeadingWhitespace(working, stripped, newText);
-        if (strippedFlexed !== null)
-            return { ok: true, working: strippedFlexed };
-        if (countOccurrences(working, stripped) === 1) {
-            const m = fuzzyFindText(working, stripped);
-            if (m.found) {
-                return {
-                    ok: true,
-                    working: working.slice(0, m.index) + newText + working.slice(m.index + m.matchLength),
-                };
-            }
-        }
-    }
-    const elided = applyDotdotdots(working, oldText, newText);
-    if (elided !== null)
-        return { ok: true, working: elided };
-    return { ok: false, reason: "not_found" };
-}
-export function applyBaseline(raw, task) {
-    const parsed = parseEnvelope(raw);
-    if (parsed === null) {
-        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) {
-        // Run the REAL edit ladder (fuzzy + indent-flex + blank-strip + dotdotdots),
-        // so the baseline gets full credit for everything our tool recovers today.
-        const result = applyLadder(file, e.old_text ?? "", e.new_text ?? "");
-        if (result.ok) {
-            file = result.working;
-        }
-        else {
-            ambiguous++;
-            applied = false;
-        }
-    }
-    return {
-        applied,
-        correct: applied && checkAnchors(file, task),
-        ambiguousEdits: ambiguous,
-        parsedEdits: edits.length,
-    };
-}
-export function applyHashline(raw, task, anchored) {
-    const parsed = parseEnvelope(raw);
-    if (parsed === null) {
-        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 ?? "anthropic";
-    const model = process.env.GG_HL_MODEL ?? "claude-sonnet-5";
-    const repeat = Math.max(1, parseInt(process.env.GG_HL_REPEAT ?? "1", 10));
-    const auth = new AuthStorage();
-    await auth.load();
-    // Credit-based accounts store under a key that is not the provider name
-    // (`xiaomi-credits` serves provider `xiaomi`), so the two stay separable.
-    const cr = await auth.resolveCredentials(process.env.GG_HL_AUTH_KEY ?? 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,
-            baseMs: 0,
-            hlOutTok: 0,
-            hlInTok: 0,
-            hlOk: true,
-            hlAmbiguous: 0,
-            hlMs: 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), 8192);
-            const baseOut = applyBaseline(base.text, task);
-            if (!baseOut.correct && process.env.GG_HL_DEBUG) {
-                process.stdout.write(`   [debug] baseline raw:\n${base.text.slice(0, 1200)}\n`);
-            }
-            agg.baseOutTok += base.outputTokens;
-            agg.baseInTok += base.inputTokens;
-            agg.baseAmbiguous += baseOut.ambiguousEdits;
-            agg.baseMs += base.wallMs;
-            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);
-            // Same cap as baseline — an asymmetric cap truncates multi-edit responses
-            // and shows up as a fake FAIL.
-            const hl = await call(provider, model, creds, hashlinePrompt(anchored.rendered, task.instruction), 8192);
-            const hlOut = applyHashline(hl.text, task, anchored);
-            if (!hlOut.correct && process.env.GG_HL_DEBUG) {
-                process.stdout.write(`   [debug] hashline raw:\n${hl.text.slice(0, 1200)}\n`);
-            }
-            agg.hlOutTok += hl.outputTokens;
-            agg.hlInTok += hl.inputTokens;
-            agg.hlAmbiguous += hlOut.ambiguousEdits;
-            agg.hlMs += hl.wallMs;
-            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.baseMs = Math.round(agg.baseMs / repeat);
-        agg.hlOutTok = Math.round(agg.hlOutTok / repeat);
-        agg.hlInTok = Math.round(agg.hlInTok / repeat);
-        agg.hlMs = Math.round(agg.hlMs / 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 | ms 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)} | ` +
-            `${String(r.baseMs).padStart(5)}/${String(r.hlMs).padStart(5)} | ` +
-            `${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

@@ -1 +0,0 @@
-{"version":3,"file":"hashline-edit-benchmark.js","sourceRoot":"","sources":["../../src/core/hashline-edit-benchmark.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,OAAO,EAAE,MAAM,EAA8C,MAAM,kBAAkB,CAAC;AACtF,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAqB,MAAM,eAAe,CAAC;AAC9D,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,6BAA6B,EAC7B,eAAe,EACf,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAiB/B,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,+EAA+E;AAC/E,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,MAAM,GAAG,GAAa;QACpB,4EAA4E;QAC5E,EAAE;KACH,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CACN,6BAA6B,CAAC,4BAA4B,EAC1D,6BAA6B,EAC7B,iBAAiB,EACjB,wBAAwB,EACxB,KAAK,EACL,qBAAqB,EACrB,GAAG,EACH,EAAE,CACH,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,gCAAgC,MAAM,GAAG,EAAE,EAAE,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxB,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,MAAM,KAAK,GAAe,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,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;IAEJ,iEAAiE;IACjE,MAAM,OAAO,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,UAAU,GAAa;QAC3B,IAAI,EAAE,QAAQ;QACd,WAAW,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;QACvC,IAAI,EAAE,OAAO;QACb,WAAW,EACT,8DAA8D;YAC9D,qDAAqD;QACvD,WAAW,EAAE,CAAC,YAAY,CAAC;QAC3B,YAAY,EAAE,CAAC,oBAAoB,EAAE,aAAa,EAAE,cAAc,CAAC;QACnE,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;YACjB,IAAI,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7D,IAAI,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,KAAK,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC9D,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,6BAA6B,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,6BAA6B,CAAC,CAAC;YAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;YACvC,OAAO,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC;QACtE,CAAC;KACF,CAAC;IAEF,uDAAuD;IACvD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAa;QACtB,IAAI,EAAE,OAAO;QACb,WAAW,EAAE,GAAG;QAChB,IAAI,EAAE,SAAS;QACf,WAAW,EACT,yFAAyF;YACzF,0FAA0F;YAC1F,uFAAuF;YACvF,kBAAkB;QACpB,WAAW,EAAE,CAAC,qBAAqB,EAAE,qBAAqB,EAAE,WAAW,CAAC;QACxE,YAAY,EAAE,CAAC,kCAAkC,EAAE,OAAO,CAAC;QAC3D,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAgB,CAAC,IAAI,EAAE,iBAAiB,CAAC,KAAK,CAAC;KACpE,CAAC;IAEF,OAAO,CAAC,GAAG,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;AACvC,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;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAI,GAAW;IAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAM,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,4EAA4E;QAC5E,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,OAAO,EAAE,CAAC;oBACZ,GAAG,IAAI,EAAE,CAAC;oBACV,OAAO,GAAG,KAAK,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,GAAG,IAAI,EAAE,CAAC;oBACV,OAAO,GAAG,IAAI,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;oBACf,QAAQ,GAAG,KAAK,CAAC;oBACjB,GAAG,IAAI,EAAE,CAAC;oBACV,SAAS;gBACX,CAAC;gBACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,GAAG,IAAI,KAAK,CAAC;oBACb,SAAS;gBACX,CAAC;gBACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,GAAG,IAAI,KAAK,CAAC;oBACb,SAAS;gBACX,CAAC;gBACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,GAAG,IAAI,KAAK,CAAC;oBACb,SAAS;gBACX,CAAC;gBACD,GAAG,IAAI,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,IAAI,EAAE,KAAK,GAAG;gBAAE,QAAQ,GAAG,IAAI,CAAC;YAChC,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAM,CAAC;QAC9B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,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,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACxD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CACzB,OAAe,EACf,OAAe,EACf,OAAe;IAEf,MAAM,WAAW,GAAG,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACvD,IAAI,WAAW,GAAG,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAC/D,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC9C,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO;gBACL,EAAE,EAAE,IAAI;gBACR,OAAO,EACL,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC;aAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IACD,6EAA6E;IAC7E,MAAM,MAAM,GAAG,6BAA6B,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACxE,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC1D,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAC1C,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,MAAM,cAAc,GAAG,6BAA6B,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACjF,IAAI,cAAc,KAAK,IAAI;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;QAC1E,IAAI,gBAAgB,CAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC3C,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACZ,OAAO;oBACL,EAAE,EAAE,IAAI;oBACR,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,WAAW,CAAC;iBACtF,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1D,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC1D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AAC5C,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,GAAW,EAAE,IAAc;IACvD,MAAM,MAAM,GAAG,aAAa,CAA4D,GAAG,CAAC,CAAC;IAC7F,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,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,6EAA6E;QAC7E,2EAA2E;QAC3E,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;QACrE,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACd,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,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,MAAM,MAAM,GAAG,aAAa,CAC1B,GAAG,CACJ,CAAC;IACF,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,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;AAmBD,KAAK,UAAU,IAAI;IACjB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,IAAI,WAAW,CAAC;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,iBAAiB,CAAC;IAC3D,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,wEAAwE;IACxE,0EAA0E;IAC1E,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,IAAI,QAAQ,CAAC,CAAC;IACjF,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,MAAM,EAAE,CAAC;YACT,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,IAAI;YACV,WAAW,EAAE,CAAC;YACd,IAAI,EAAE,CAAC;SACR,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,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;gBAChD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,6BAA6B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAClF,CAAC;YACD,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,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;YAC1B,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,0EAA0E;YAC1E,+BAA+B;YAC/B,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,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;gBAC9C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,6BAA6B,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAChF,CAAC;YACD,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,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,MAAM,CAAC;YACtB,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,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;QAC7C,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,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC;QACzC,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,sGAAsG,CACvG,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,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;YAClE,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/semantic-search-benchmark.d.ts

@@ -1,36 +0,0 @@
-/**
- * Semantic AST-chunk retrieval vs whole-file reads — real-API measurement of
- * whether Feature #3 is worth building.
- *
- * The claim (cocoindex-code / oh-my-pi): replacing "grep then read whole files"
- * with "retrieve only the relevant AST chunks" cuts ~70% of the tokens an agent
- * spends locating code, with no loss of answer quality. We test that directly on
- * OUR OWN repo against a live model.
- *
- * For a set of natural-language questions about real files in this repo, we build
- * three context strategies and ask the model the same question with each:
- *
- *   BASELINE (whole-file): deliver the FULL text of the top files a lexical
- *   grep would surface — this is what the agent reads today (read + grep).
- *
- *   SEMANTIC (AST chunks): parse every file into top-level declarations
- *   (functions / classes / interfaces / consts), rank chunks with a real BM25
- *   retriever, and deliver only the top-k chunks. No embedding model needed; a
- *   learned embedding retriever would land between BM25 and ORACLE.
- *
- *   ORACLE (upper bound): deliver only the hand-labelled answer chunk(s) — the
- *   best case any retriever could achieve.
- *
- * We measure, per question and strategy: INPUT tokens delivered (the headline
- * cost) and whether the model's answer was correct (deterministic keyword grade).
- * The verdict: does SEMANTIC reach BASELINE-level correctness at a fraction of
- * the input tokens?
- *
- * Usage:
- *   npx tsx src/core/semantic-search-benchmark.ts
- *
- * Env overrides:
- *   GG_SS_PROVIDER / GG_SS_MODEL   (default openai / gpt-6.1-sol)
- *   GG_SS_TOPK                     (chunks/files delivered, default 3)
- */
-export declare function grade(answer: string, mustInclude: string[]): boolean;