@vizalice/codegraph 1.5.0

package/dist/mcp/explore-dedup.js

@@ -0,0 +1,236 @@
+"use strict";
+/**
+ * Cross-call source dedup for `codegraph_explore` (CG-18).
+ *
+ * The session record (CG-17) knows what earlier calls already sent. This module
+ * is the algebra that turns that record into a decision for the call being
+ * rendered: of the line ranges this call WOULD emit, which does the agent
+ * already hold, and what is genuinely new.
+ *
+ * Three rules shape everything here, and all three come from the same place —
+ * an insufficient-feeling response is what sends an agent to Read, and one or
+ * two of those early in a session teach it to abandon codegraph entirely
+ * (CLAUDE.md):
+ *
+ *   1. **A pointer, never a bare omission.** Removed source is replaced by a
+ *      back-reference naming the file, the symbols, and the line span, worded so
+ *      it is unmistakable that the source was already delivered IN THIS
+ *      CONVERSATION and is still current. Silence reads as "codegraph didn't
+ *      find it".
+ *   2. **Only prove-it dedup.** A span is withheld only when the file's bytes
+ *      are byte-identical to what was served (a content fingerprint, not an
+ *      mtime and not the index's drift flag). An edit between calls means the
+ *      agent's copy is wrong, so the source is re-emitted in full.
+ *   3. **Cut chunks, not slivers.** Only a covered run of at least
+ *      {@link EXPLORE_DEDUP.MIN_COVERED_LINES} lines is worth replacing. Below
+ *      that the pointer costs more than the source, and shattering a block into
+ *      one-line fragments produces exactly the ragged output that reads as a
+ *      failure. Everything not withheld is emitted — where the algebra is
+ *      unsure, it re-serves.
+ *
+ * Which way to be wrong, restated for this layer: re-serving something the agent
+ * has is a few hundred wasted chars; withholding something it never saw is a
+ * Read. Every threshold below leans to the first.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EXPLORE_DEDUP = void 0;
+exports.exploreDedupEnabled = exploreDedupEnabled;
+exports.fileFingerprint = fileFingerprint;
+exports.mergeRanges = mergeRanges;
+exports.intersectRange = intersectRange;
+exports.subtractRange = subtractRange;
+exports.dedupeRange = dedupeRange;
+exports.servedRangesForFile = servedRangesForFile;
+exports.formatSpans = formatSpans;
+exports.formatBackReference = formatBackReference;
+exports.symbolsInSpans = symbolsInSpans;
+const crypto_1 = require("crypto");
+exports.EXPLORE_DEDUP = {
+    /**
+     * Shortest already-served run that may be replaced by a back-reference.
+     *
+     * Sized against what dedup is actually FOR — a later call re-serving a whole
+     * method or file it already sent. A shorter covered run is either a signature
+     * line in a skeleton render or the ±3 lines of context padding around a
+     * cluster, and swapping either for a pointer trades bytes for noise: the
+     * pointer sentence is itself ~140 chars, so under this length dedup would
+     * make the response BIGGER while making it read as full of holes.
+     */
+    MIN_COVERED_LINES: 8,
+    /**
+     * Below this many chars of NEW source, a file's remainder is folded into its
+     * back-reference instead of being fenced on its own.
+     *
+     * The shape this exists for, seen on the CG-17 fixture: a third call whose
+     * only unheld line was the file's trailing blank one, rendered as a code fence
+     * containing `228\t`. A fence holding two lines of nothing reads as a broken
+     * response, and reading as broken is the expensive failure — it is the thing
+     * that sends an agent to Read and keeps it there. So a remainder this small is
+     * dropped rather than shown. It is the one place this module withholds
+     * something the agent has not seen, and it is bounded to ~two lines that sit
+     * directly against source the agent does hold; the file is still named, with
+     * its symbols, so one follow-up explore fetches it whole.
+     */
+    MIN_DELTA_CHARS: 160,
+    /** Line spans named in one pointer before it summarises the rest. */
+    MAX_SPANS_IN_POINTER: 4,
+    /** Symbols named in one pointer before it summarises the rest. */
+    MAX_SYMBOLS_IN_POINTER: 5,
+};
+const OFF = new Set(['0', 'false', 'off', 'no']);
+/**
+ * Kill switch: `CODEGRAPH_EXPLORE_DEDUP=0` renders every call as if the session
+ * had no history. Read per call (not memoized) so a test can toggle it.
+ */
+function exploreDedupEnabled() {
+    const raw = process.env.CODEGRAPH_EXPLORE_DEDUP;
+    if (raw === undefined)
+        return true;
+    return !OFF.has(raw.trim().toLowerCase());
+}
+/**
+ * Identity of the bytes a call served for one file.
+ *
+ * This — not the index's drift flag — is what gates dedup. `isFileStaleOnDisk`
+ * answers "did the file change since the last INDEX SYNC", which is a different
+ * question with a different answer: two calls inside one drift window served the
+ * same current bytes (dedup is correct), while a file edited and re-synced
+ * between two calls is never "stale" and yet the agent's copy is now wrong
+ * (dedup would be actively harmful). Length is prefixed so a hash prefix
+ * collision cannot alias two files of different size.
+ */
+function fileFingerprint(content) {
+    return `${content.length}:${(0, crypto_1.createHash)('sha1').update(content).digest('hex').slice(0, 16)}`;
+}
+/** Sort + merge overlapping/adjacent spans into the smallest equivalent set. */
+function mergeRanges(ranges) {
+    const valid = ranges
+        .filter((r) => Number.isFinite(r.start) && Number.isFinite(r.end) && r.end >= r.start && r.start >= 1)
+        .map((r) => ({ start: Math.floor(r.start), end: Math.floor(r.end) }))
+        .sort((a, b) => a.start - b.start || a.end - b.end);
+    const out = [];
+    for (const r of valid) {
+        const last = out[out.length - 1];
+        if (last && r.start <= last.end + 1)
+            last.end = Math.max(last.end, r.end);
+        else
+            out.push({ ...r });
+    }
+    return out;
+}
+/** The parts of `range` that `served` covers. */
+function intersectRange(range, served) {
+    const out = [];
+    for (const s of served) {
+        const start = Math.max(range.start, s.start);
+        const end = Math.min(range.end, s.end);
+        if (end >= start)
+            out.push({ start, end });
+    }
+    return mergeRanges(out);
+}
+/** The parts of `range` that `cut` does NOT cover. */
+function subtractRange(range, cut) {
+    const out = [];
+    let cursor = range.start;
+    for (const c of mergeRanges(cut)) {
+        if (c.end < cursor)
+            continue;
+        if (c.start > range.end)
+            break;
+        if (c.start > cursor)
+            out.push({ start: cursor, end: Math.min(c.start - 1, range.end) });
+        cursor = Math.max(cursor, c.end + 1);
+        if (cursor > range.end)
+            break;
+    }
+    if (cursor <= range.end)
+        out.push({ start: cursor, end: range.end });
+    return out;
+}
+/**
+ * Split one intended span into what to emit and what to point back at.
+ *
+ * Covered runs shorter than {@link EXPLORE_DEDUP.MIN_COVERED_LINES} are left in
+ * the emit set on purpose (rule 3 above) — so a span the agent holds "almost
+ * all of" still comes back whole rather than as a stutter of fragments around
+ * pointers.
+ */
+function dedupeRange(range, served, minCovered = exports.EXPLORE_DEDUP.MIN_COVERED_LINES) {
+    if (served.length === 0 || range.end < range.start)
+        return { emit: [range], covered: [] };
+    const covered = intersectRange(range, served).filter((r) => r.end - r.start + 1 >= minCovered);
+    if (covered.length === 0)
+        return { emit: [range], covered: [] };
+    return { emit: subtractRange(range, covered), covered };
+}
+/**
+ * Every line span this session has already served for one file, but ONLY from
+ * calls that served the SAME BYTES.
+ *
+ * A record with no fingerprint is ignored rather than trusted: it cannot prove
+ * the agent's copy matches the file on disk now, and an unprovable match is
+ * exactly the case where re-serving is right.
+ */
+function servedRangesForFile(prior, filePath, fingerprint) {
+    if (!prior)
+        return [];
+    const spans = [];
+    for (const call of prior.calls) {
+        for (const file of call.files) {
+            if (file.path !== filePath)
+                continue;
+            if (!file.fingerprint || file.fingerprint !== fingerprint)
+                continue;
+            spans.push(...file.ranges);
+        }
+    }
+    return mergeRanges(spans);
+}
+/** `L12`, `L12-40`, capped with a `+N more` tail. */
+function formatSpans(spans) {
+    const shown = spans.slice(0, exports.EXPLORE_DEDUP.MAX_SPANS_IN_POINTER)
+        .map((r) => (r.start === r.end ? `L${r.start}` : `L${r.start}-${r.end}`))
+        .join(', ');
+    const more = spans.length - exports.EXPLORE_DEDUP.MAX_SPANS_IN_POINTER;
+    return more > 0 ? `${shown}, +${more} more span${more === 1 ? '' : 's'}` : shown;
+}
+/**
+ * The line that replaces withheld source.
+ *
+ * It has one job: make the agent reach into its own context instead of into
+ * Read. So it carries the three things needed to find the source it already has
+ * — path, symbols, line spans — plus the two facts that make using it safe:
+ * that it came from THIS conversation, and that the file has not changed since
+ * (which is checked, not asserted — see {@link fileFingerprint}). It never says
+ * "omitted", and it never steers to Read.
+ */
+function formatBackReference(filePath, covered, symbols, opts) {
+    const names = symbols.slice(0, exports.EXPLORE_DEDUP.MAX_SYMBOLS_IN_POINTER);
+    const moreNames = symbols.length - names.length;
+    const symbolPart = names.length > 0
+        ? ` (${names.join(', ')}${moreNames > 0 ? `, +${moreNames} more` : ''})`
+        : '';
+    const head = `> **Already sent earlier in this conversation:** \`${filePath}\` ${formatSpans(covered)}${symbolPart}`;
+    const tail = opts.partial
+        ? ' — unchanged on disk since, so that copy is still exact. Only the NEW lines are shown below; scroll back for the rest. Do NOT Read this file.'
+        : ' — unchanged on disk since, so that copy is still exact and is not repeated here. Use it from your context; do NOT Read this file.';
+    return head + tail;
+}
+/** Symbol names whose definitions fall inside the withheld spans. */
+function symbolsInSpans(nodes, spans) {
+    const out = [];
+    const seen = new Set();
+    for (const n of nodes) {
+        if (n.kind === 'import' || n.kind === 'export')
+            continue;
+        if (!spans.some((s) => n.startLine <= s.end && (n.endLine || n.startLine) >= s.start))
+            continue;
+        if (seen.has(n.name))
+            continue;
+        seen.add(n.name);
+        out.push(n.name);
+    }
+    return out;
+}
+//# sourceMappingURL=explore-dedup.js.map

package/dist/mcp/explore-dedup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"explore-dedup.js","sourceRoot":"","sources":["../../src/mcp/explore-dedup.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;;;AA4CH,kDAIC;AAaD,0CAEC;AAGD,kCAYC;AAGD,wCAWC;AAGD,sCAeC;AAkBD,kCASC;AAUD,kDAeC;AAGD,kCAMC;AAYD,kDAgBC;AAGD,wCAcC;AAtND,mCAAoC;AAGvB,QAAA,aAAa,GAAG;IAC3B;;;;;;;;;OASG;IACH,iBAAiB,EAAE,CAAC;IACpB;;;;;;;;;;;;;OAaG;IACH,eAAe,EAAE,GAAG;IACpB,qEAAqE;IACrE,oBAAoB,EAAE,CAAC;IACvB,kEAAkE;IAClE,sBAAsB,EAAE,CAAC;CACjB,CAAC;AAEX,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAEjD;;;GAGG;AACH,SAAgB,mBAAmB;IACjC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC;IAChD,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,eAAe,CAAC,OAAe;IAC7C,OAAO,GAAG,OAAO,CAAC,MAAM,IAAI,IAAA,mBAAU,EAAC,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AAC9F,CAAC;AAED,gFAAgF;AAChF,SAAgB,WAAW,CAAC,MAAuC;IACjE,MAAM,KAAK,GAAG,MAAM;SACjB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;SACrG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SACpE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACtD,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC;YAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;;YACrE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iDAAiD;AACjD,SAAgB,cAAc,CAC5B,KAAuB,EACvB,MAAuC;IAEvC,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,GAAG,IAAI,KAAK;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED,sDAAsD;AACtD,SAAgB,aAAa,CAC3B,KAAuB,EACvB,GAAoC;IAEpC,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,GAAG,GAAG,MAAM;YAAE,SAAS;QAC7B,IAAI,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG;YAAE,MAAM;QAC/B,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzF,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,MAAM,GAAG,KAAK,CAAC,GAAG;YAAE,MAAM;IAChC,CAAC;IACD,IAAI,MAAM,IAAI,KAAK,CAAC,GAAG;QAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;IACrE,OAAO,GAAG,CAAC;AACb,CAAC;AAUD;;;;;;;GAOG;AACH,SAAgB,WAAW,CACzB,KAAuB,EACvB,MAAuC,EACvC,aAAqB,qBAAa,CAAC,iBAAiB;IAEpD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK;QAAE,OAAO,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC1F,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC;IAC/F,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAChE,OAAO,EAAE,IAAI,EAAE,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC;AAC1D,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,mBAAmB,CACjC,KAAiC,EACjC,QAAgB,EAChB,WAAmB;IAEnB,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,MAAM,KAAK,GAAuB,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YACrC,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW;gBAAE,SAAS;YACpE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED,qDAAqD;AACrD,SAAgB,WAAW,CAAC,KAAsC;IAChE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAa,CAAC,oBAAoB,CAAC;SAC7D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;SACxE,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,qBAAa,CAAC,oBAAoB,CAAC;IAC/D,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,IAAI,aAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;AACnF,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,mBAAmB,CACjC,QAAgB,EAChB,OAAwC,EACxC,OAA8B,EAC9B,IAA0B;IAE1B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAa,CAAC,sBAAsB,CAAC,CAAC;IACrE,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAChD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC;QACjC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,SAAS,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG;QACxE,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,IAAI,GAAG,sDAAsD,QAAQ,MAAM,WAAW,CAAC,OAAO,CAAC,GAAG,UAAU,EAAE,CAAC;IACrH,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO;QACvB,CAAC,CAAC,+IAA+I;QACjJ,CAAC,CAAC,oIAAoI,CAAC;IACzI,OAAO,IAAI,GAAG,IAAI,CAAC;AACrB,CAAC;AAED,qEAAqE;AACrE,SAAgB,cAAc,CAC5B,KAAwF,EACxF,KAAsC;IAEtC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QACzD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS;QAChG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAS;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/mcp/explore-diagnostics.d.ts

@@ -0,0 +1,287 @@
+/**
+ * Per-file allocation diagnostic for `codegraph_explore` (CG-4).
+ *
+ * The explore response is a fixed byte envelope (`budget.maxOutputChars`, hard-
+ * capped at 25K so the host never externalizes the result). WHICH files fill it,
+ * and in what proportion, is decided by a long chain of gates, tiers and caps
+ * spread across `handleExplore`. That chain is currently unobservable: you can
+ * read the output and guess, but you cannot say "this file took 16% of the
+ * envelope and that one took 21%" without hand-counting.
+ *
+ * This module is the instrument. Enabled by `CODEGRAPH_EXPLORE_DEBUG`, it
+ * records, for one explore call:
+ *   - per candidate file: relevance score, graph (RWR) mass, distinct query-term
+ *     hits, ranking flags, render mode, bytes of source actually emitted, that
+ *     file's share of the final envelope, whether it was clipped, whether it
+ *     carries a flow-spine symbol — and for the ones that didn't render, why;
+ *   - totals: envelope vs `maxOutputChars` vs the hard ceiling, source bytes vs
+ *     meta-text overhead, files considered at each filter stage, and the score
+ *     floor / relevance-gate thresholds that were applied.
+ *
+ * HARD CONSTRAINT — this ships in the product binary: when the env var is unset
+ * the diagnostic must not exist. `start()` returns `null`, every call site is a
+ * `diag?.` no-op, and the agent-facing response is byte-identical. The
+ * diagnostic never mutates render state, and every method is wrapped so a bug in
+ * here can never fail an explore call.
+ *
+ * Sinks (value of `CODEGRAPH_EXPLORE_DEBUG`):
+ *   `1` / `true` / `on` / `yes` / `stderr` → human-readable table on stderr
+ *   `json`                                 → one JSON object on stderr
+ *   anything else                          → treated as a path; one JSON object
+ *                                            per line appended (JSONL sidecar)
+ */
+import type { ExploreProjectState } from './explore-session-state';
+/** How a file's source was rendered into the response. */
+export type ExploreRenderMode = 'whole' | 'clusters' | 'focused' | 'skeleton' | 'stale-omitted' | 'backref' | 'dropped';
+/** Why a ranked candidate never reached the output. */
+export type ExploreSkipReason = 'max-files' | 'cliff' | 'budget-whole-file' | 'budget-clusters' | 'unreadable' | 'no-ranges';
+/** Ranking inputs for one candidate file, captured before the render loop. */
+export interface ExploreCandidateMeta {
+    rank: number;
+    score: number;
+    graphScore: number;
+    termHits: number;
+    nodes: number;
+    named: boolean;
+    central: boolean;
+    entry: boolean;
+    spine: boolean;
+    lowValue: boolean;
+    generated: boolean;
+    /**
+     * Nothing but type declarations in this file, and nothing in the index
+     * depends on it (CG-28) — it cannot answer a flow question, so it ranks on
+     * discounted signals unless the query named one of the types it declares.
+     */
+    ambientDeclaration: boolean;
+    /**
+     * Multiplier `rankPenalty` applied to BOTH `score` and `graphScore` (1 = no
+     * penalty). Generated and test/i18n files rank on discounted signals, so the
+     * raw values are `score / penalty` — worth reporting, since "why did this
+     * generated file lose?" is otherwise invisible in the numbers (CG-10).
+     */
+    penalty: number;
+    /**
+     * Which NodeKinds the file's matched symbols were, most-numerous first
+     * (`function:4 constant:1`). The scoring is kind-weighted, so this is the
+     * breakdown that explains a score — a file carried by one isolated `constant`
+     * is the #1500 failure, and it is legible here at a glance.
+     */
+    kinds: string;
+}
+/** Budget fields the diagnostic reports. Structural, to avoid a cyclic import. */
+interface BudgetShape {
+    maxOutputChars: number;
+    maxCharsPerFile: number;
+    defaultMaxFiles: number;
+}
+/** One file's line in the report. Also the JSONL sidecar's per-file shape. */
+export interface ExploreDiagnosticFile extends ExploreCandidateMeta {
+    path: string;
+    allowance: number | null;
+    /** Reservation + inherited slack — the bound the render paths actually use. */
+    spendable: number | null;
+    /** Render ceiling after holding back what is still owed to unreached files. */
+    funded: number | null;
+    render: ExploreRenderMode | null;
+    skipped: ExploreSkipReason | null;
+    clipped: boolean;
+    dedupSavedChars: number;
+    dedupCovered: Array<[number, number]>;
+    emittedChars: number;
+    finalChars: number;
+    share: number;
+    allocatedShare: number;
+}
+/**
+ * This session's explore history for this project, as of BEFORE the call being
+ * reported (CG-17). Present only when the caller tracks session state — the CLI
+ * and bare-handler callers don't, so it is absent there rather than zeroed.
+ */
+export interface ExploreDiagnosticSession {
+    /** 1-based index of THIS call within the session, for this project. */
+    callIndex: number;
+    /** Calls already served this session for this project. */
+    priorCalls: number;
+    /** Response chars already served this session for this project. */
+    priorResponseChars: number;
+    /** Files already served source this session, most-recent call first. */
+    priorFiles: Array<{
+        path: string;
+        ranges: Array<[number, number]>;
+        bytes: number;
+    }>;
+}
+/** The full report — one per explore call, JSON-serialized to the sink. */
+export interface ExploreDiagnosticReport {
+    tool: 'codegraph_explore';
+    query: string;
+    projectRoot: string;
+    indexedFileCount: number;
+    note?: string;
+    /** Session-scoped call state (CG-17); absent when the caller tracks none. */
+    session?: ExploreDiagnosticSession;
+    budget: {
+        maxOutputChars: number;
+        maxCharsPerFile: number;
+        maxFiles: number;
+        hardCeiling: number;
+    };
+    envelope: {
+        /** Chars actually returned to the agent (post-truncation). */
+        chars: number;
+        /** Chars the render loop produced, BEFORE the hard-ceiling cut. */
+        allocatedChars: number;
+        overBudget: boolean;
+        truncated: boolean;
+        sourceChars: number;
+        sourceShare: number;
+        metaChars: number;
+        metaShare: number;
+    };
+    selection: {
+        scoreFloor: number;
+        maxGraph: number;
+        graphGateThreshold: number;
+        graphGateApplied: boolean;
+        filesGrouped: number;
+        filesPastLowValueFilter: number;
+        filesPastScoreFloor: number;
+        filesRanked: number;
+        filesRenderedByLoop: number;
+        filesInFinalOutput: number;
+    };
+    /**
+     * Cross-call source dedup (CG-18): what this call did NOT re-send because an
+     * earlier call in this session already sent it, and where those bytes went.
+     * `savedChars` 0 with a non-empty session block means nothing overlapped.
+     */
+    dedup: {
+        savedChars: number;
+        backReferenced: string[];
+        /** Files fully replaced by a pointer — each one also freed a `maxFiles` slot. */
+        fullyBackReferenced: string[];
+    };
+    /** The proportional split (CG-12): what each file was promised, and why. */
+    allocation: {
+        /** Chars divided among admitted files (envelope minus per-file overhead). */
+        pool: number;
+        /** Weight threshold the cliff fired at; 0 when nothing was cliffed. */
+        cliffAt: number;
+        /** Files given zero source — pointers in the not-shown list instead. */
+        cliffed: string[];
+        /** Sum of reservations. Must not exceed `pool`. */
+        reserved: number;
+    };
+    files: ExploreDiagnosticFile[];
+}
+export declare class ExploreDiagnostics {
+    private readonly sink;
+    private readonly query;
+    private readonly projectRoot;
+    private readonly budget;
+    private readonly maxFiles;
+    private readonly indexedFileCount;
+    private readonly files;
+    private readonly stages;
+    private scoreFloor;
+    private maxGraph;
+    private graphGateThreshold;
+    private graphGateApplied;
+    private note;
+    private session;
+    private allocPool;
+    private allocCliffAt;
+    private allocCliffed;
+    private constructor();
+    /**
+     * Returns `null` when `CODEGRAPH_EXPLORE_DEBUG` is unset/off — the whole
+     * instrument then costs one env read per explore call and nothing else.
+     */
+    static start(query: string, projectRoot: string, budget: BudgetShape, maxFiles: number, indexedFileCount: number): ExploreDiagnostics | null;
+    /**
+     * Candidate count after the test/spec/icon/i18n hard-exclude — the FIRST
+     * selection stage, ahead of the score floor.
+     */
+    setLowValueFiltered(grouped: number, kept: number): void;
+    /**
+     * Record what this session had already been served for this project (CG-17),
+     * so the report says which call in the session it is and what the earlier ones
+     * cost. Read-only for now: nothing in the render loop consults it, which is
+     * what keeps the response byte-identical at this stage.
+     *
+     * Files are listed most-recent call first and de-duplicated by path — the same
+     * file re-served across calls is the pattern this instrument exists to make
+     * visible, and its ranges are unioned so a glance shows what of it the agent
+     * already holds.
+     */
+    noteSession(prior: ExploreProjectState | null): void;
+    /** Candidate count after the `group.score >= floor` filter. */
+    setScoreFloor(floor: number, kept: number): void;
+    /** Graph-relevance gate: threshold, whether it actually pruned, what survived. */
+    setRelevanceGate(maxGraph: number, threshold: number, applied: boolean, kept: number): void;
+    /** Record one ranked candidate's scoring inputs, in final sort order. */
+    noteCandidate(path: string, meta: ExploreCandidateMeta): void;
+    /**
+     * Record the proportional split (CG-12), taken right after ranking and before
+     * a single byte renders. Called once per explore.
+     */
+    setAllocation(allowances: ReadonlyMap<string, number>, cliffed: readonly string[], cliffAt: number, pool: number): void;
+    /**
+     * What the render loop will let this file spend — reservation plus inherited
+     * slack. Called once per file, before any of its render paths run.
+     */
+    recordSpendable(path: string, chars: number): void;
+    /**
+     * What the render loop will let this file spend once the reservations still
+     * owed BELOW it are held back (CG-31). Called alongside `recordSpendable`.
+     */
+    recordFunded(path: string, chars: number): void;
+    /** A candidate rendered source into the response. */
+    recordRender(path: string, render: ExploreRenderMode, sourceChars: number, clipped: boolean): void;
+    /**
+     * Source this call withheld because the session already holds it (CG-18).
+     * Called with `(path, 0, [])` to clear a record — the anti-abandonment restore
+     * puts a suppressed file's source back, and a diagnostic still claiming the
+     * saving would misreport where the envelope went.
+     */
+    recordDedup(path: string, savedChars: number, covered: ReadonlyArray<{
+        start: number;
+        end: number;
+    }>): void;
+    /**
+     * A candidate was passed over before rendering. First reason wins — the
+     * blanket `max-files` sweep must not overwrite a file's specific reason.
+     */
+    recordSkip(path: string, reason: ExploreSkipReason): void;
+    /** Explore returned early (no subgraph). Emits a minimal record. */
+    finishEmpty(reason: string): void;
+    /**
+     * Final pass: attribute the FINAL text's bytes back to files (so the hard
+     * ceiling's truncation is reflected in what each file actually delivered),
+     * then emit.
+     *
+     * `allocatedChars` is the pre-truncation length — the size the render loop
+     * *chose*. Reporting both is the point: the allocator's decision and the
+     * agent's delivered payload diverge exactly when the ceiling cuts, and
+     * conflating them is how a dropped trailing file goes unnoticed.
+     */
+    finish(finalText: string, allocatedChars: number, hardCeiling: number, filesIncluded: number): void;
+    private buildReport;
+    private emit;
+}
+/**
+ * Attribute the final response's source bytes back to files by walking the
+ * rendered markdown: a ``**`path`**`` section header followed by a fenced code
+ * block. Reading the FINAL text (rather than trusting the render loop's running
+ * total) is what makes the numbers truthful — it accounts for the hard-ceiling
+ * truncation that can drop whole trailing sections after they were "emitted".
+ *
+ * Line numbering is on by default, so a source line that is itself a ``` fence
+ * arrives as `42\t```` and cannot close the block early.
+ */
+export declare function attributeSourceBytes(finalText: string): Map<string, number>;
+/** Human-readable stderr rendering of the JSON report. */
+export declare function renderTable(report: ExploreDiagnosticReport): string;
+export {};
+//# sourceMappingURL=explore-diagnostics.d.ts.map

package/dist/mcp/explore-diagnostics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"explore-diagnostics.d.ts","sourceRoot":"","sources":["../../src/mcp/explore-diagnostics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAGH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAEnE,0DAA0D;AAC1D,MAAM,MAAM,iBAAiB,GACzB,OAAO,GACP,UAAU,GACV,SAAS,GACT,UAAU,GACV,eAAe,GACf,SAAS,GACT,SAAS,CAAC;AAEd,uDAAuD;AACvD,MAAM,MAAM,iBAAiB,GACzB,WAAW,GACX,OAAO,GACP,mBAAmB,GACnB,iBAAiB,GACjB,YAAY,GACZ,WAAW,CAAC;AAEhB,8EAA8E;AAC9E,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,OAAO,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB;;;;OAIG;IACH,kBAAkB,EAAE,OAAO,CAAC;IAC5B;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;OAKG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAsED,kFAAkF;AAClF,UAAU,WAAW;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,8EAA8E;AAC9E,MAAM,WAAW,qBAAsB,SAAQ,oBAAoB;IACjE,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,+EAA+E;IAC/E,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,+EAA+E;IAC/E,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC;IACjC,OAAO,EAAE,iBAAiB,GAAG,IAAI,CAAC;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACtC,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;GAIG;AACH,MAAM,WAAW,wBAAwB;IACvC,uEAAuE;IACvE,SAAS,EAAE,MAAM,CAAC;IAClB,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IACnB,mEAAmE;IACnE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,wEAAwE;IACxE,UAAU,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACrF;AAED,2EAA2E;AAC3E,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,mBAAmB,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,6EAA6E;IAC7E,OAAO,CAAC,EAAE,wBAAwB,CAAC;IACnC,MAAM,EAAE;QACN,cAAc,EAAE,MAAM,CAAC;QACvB,eAAe,EAAE,MAAM,CAAC;QACxB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;IACF,QAAQ,EAAE;QACR,8DAA8D;QAC9D,KAAK,EAAE,MAAM,CAAC;QACd,mEAAmE;QACnE,cAAc,EAAE,MAAM,CAAC;QACvB,UAAU,EAAE,OAAO,CAAC;QACpB,SAAS,EAAE,OAAO,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC;QACpB,WAAW,EAAE,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,SAAS,EAAE;QACT,UAAU,EAAE,MAAM,CAAC;QACnB,QAAQ,EAAE,MAAM,CAAC;QACjB,kBAAkB,EAAE,MAAM,CAAC;QAC3B,gBAAgB,EAAE,OAAO,CAAC;QAC1B,YAAY,EAAE,MAAM,CAAC;QACrB,uBAAuB,EAAE,MAAM,CAAC;QAChC,mBAAmB,EAAE,MAAM,CAAC;QAC5B,WAAW,EAAE,MAAM,CAAC;QACpB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,kBAAkB,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF;;;;OAIG;IACH,KAAK,EAAE;QACL,UAAU,EAAE,MAAM,CAAC;QACnB,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,iFAAiF;QACjF,mBAAmB,EAAE,MAAM,EAAE,CAAC;KAC/B,CAAC;IACF,4EAA4E;IAC5E,UAAU,EAAE;QACV,6EAA6E;QAC7E,IAAI,EAAE,MAAM,CAAC;QACb,uEAAuE;QACvE,OAAO,EAAE,MAAM,CAAC;QAChB,wEAAwE;QACxE,OAAO,EAAE,MAAM,EAAE,CAAC;QAClB,mDAAmD;QACnD,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC;IACF,KAAK,EAAE,qBAAqB,EAAE,CAAC;CAChC;AA2BD,qBAAa,kBAAkB;IAgB3B,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IApBnC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiC;IACvD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAErB;IACF,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,QAAQ,CAAK;IACrB,OAAO,CAAC,kBAAkB,CAAK;IAC/B,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,IAAI,CAAM;IAClB,OAAO,CAAC,OAAO,CAAuC;IACtD,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,YAAY,CAAgB;IAEpC,OAAO;IASP;;;OAGG;IACH,MAAM,CAAC,KAAK,CACV,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EACnB,QAAQ,EAAE,MAAM,EAChB,gBAAgB,EAAE,MAAM,GACvB,kBAAkB,GAAG,IAAI;IAU5B;;;OAGG;IACH,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAOxD;;;;;;;;;;OAUG;IACH,WAAW,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI,GAAG,IAAI;IAuBpD,+DAA+D;IAC/D,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAMhD,kFAAkF;IAClF,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAO3F,yEAAyE;IACzE,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,GAAG,IAAI;IAQ7D;;;OAGG;IACH,aAAa,CACX,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EACvC,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,GACX,IAAI;IAcP;;;OAGG;IACH,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAKlD;;;OAGG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAK/C,qDAAqD;IACrD,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;IASlG;;;;;OAKG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAO3G;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,GAAG,IAAI;IAMzD,oEAAoE;IACpE,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAKjC;;;;;;;;;OASG;IACH,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,IAAI;IAuBnG,OAAO,CAAC,WAAW;IA2FnB,OAAO,CAAC,IAAI;CAeb;AAID;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAAC,SAAS,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAoC3E;AAED,0DAA0D;AAC1D,wBAAgB,WAAW,CAAC,MAAM,EAAE,uBAAuB,GAAG,MAAM,CAyHnE"}