@descryy/mcp 0.11.3 → 0.11.5

package/dist/tools/scope.js

@@ -1,186 +0,0 @@
-/**
- * `scope` — §12.5 diff scoping: what else does this change touch? Expansion stops
- * on score, not hop count — a payment gateway 4 hops out matters, a logging import
- * 1 hop out doesn't. A file the graph never heard of has two causes (not analysable,
- * or stale graph) — both disclosed, never reported as "0 affected" (§20.2's collapse). */
-import { nodesInFiles, scopeChange } from "@descryy/core";
-import { answer, briefNode, optionalEnum, optionalInteger, optionalStringArray, ToolInputError, } from "./kit.js";
-import { capped } from "../capped.js";
-const TRIGGERS = ["pre-push", "pr", "nightly"];
-const SCHEMA = {
-    type: "object",
-    properties: {
-        files: {
-            type: "array",
-            items: { type: "string" },
-            description: "Repository-relative paths that are changing. Every symbol declared in them seeds the " +
-                "blast radius.",
-        },
-        nodeIds: {
-            type: "array",
-            items: { type: "string" },
-            description: "Graph node ids to seed with directly, instead of or as well as files.",
-        },
-        trigger: {
-            type: "string",
-            enum: [...TRIGGERS],
-            description: "Which node budget to use: pre-push 200, pr 1000, nightly 5000. Default pr.",
-        },
-        budget: {
-            type: "integer",
-            minimum: 1,
-            description: "Override the trigger's node budget.",
-        },
-        limit: {
-            type: "integer",
-            minimum: 1,
-            description: "Cap how many nodes come back in the reply — applied to the changed list and the affected " +
-                "list alike. Default 25 (MK-9 — the same walk-cost reduction impact.ts applies, for the " +
-                "same reason). Capping the changed list shortens only the listing: every changed symbol " +
-                "still seeds the traversal, and changedTotal reports how many there were. A capped reply " +
-                "always discloses shown/total; raise this explicitly when the full set is needed.",
-        },
-    },
-    additionalProperties: false,
-};
-function shape(entry) {
-    return {
-        ...briefNode(entry.node),
-        score: Number(entry.score.toFixed(4)),
-        tier: entry.tier,
-        depth: entry.depth,
-        ...(entry.via === null ? {} : { via: entry.via.type }),
-    };
-}
-async function run(args, ctx) {
-    const files = optionalStringArray(args, "files") ?? [];
-    const seedIds = [...(optionalStringArray(args, "nodeIds") ?? [])];
-    const trigger = optionalEnum(args, "trigger", TRIGGERS) ?? "pr";
-    const budget = optionalInteger(args, "budget", 1);
-    const limit = optionalInteger(args, "limit", 1) ?? 25;
-    if (files.length === 0 && seedIds.length === 0) {
-        throw new ToolInputError('give at least one of "files" or "nodeIds"');
-    }
-    const notes = [];
-    const session = ctx.session;
-    if (files.length > 0) {
-        ctx.progress(`Resolving ${files.length} path(s) to graph nodes`);
-        const absolute = files.filter((f) => f.startsWith("/"));
-        if (absolute.length > 0) {
-            notes.push(`${absolute.length} path(s) were absolute. The graph stores repository-relative paths, so ` +
-                "these matched nothing. Pass paths relative to the repository root.");
-        }
-        const { nodes, missing } = nodesInFiles(session.store().driver, files);
-        for (const node of nodes)
-            seedIds.push(node.id);
-        if (missing.length > 0) {
-            notes.push(`${missing.length} of ${files.length} path(s) have no node in the graph ` +
-                `(${missing.slice(0, 5).join(", ")}${missing.length > 5 ? ", …" : ""}). Either no ` +
-                "configured adapter reads them or the graph predates them — run analyze. Their impact " +
-                "is not in this answer and they are not reported as having none.");
-        }
-    }
-    if (seedIds.length === 0) {
-        const base = session.provider().baseStamp();
-        return answer({
-            headline: "Nothing in the graph matches what you named, so no blast radius could be computed.",
-            state: "refused",
-            nameLevel: true,
-            resolutionFloor: 0,
-            commitSha: base.commitSha,
-            graphBuiltAt: base.graphBuiltAt,
-            irSchemaVersion: base.irSchemaVersion,
-            commitSpread: base.commitSpread,
-            repoCount: base.repoCount,
-            notes: [
-                ...notes,
-                "This is not a result of zero impact. No seed node was found, so the traversal never ran.",
-            ],
-            data: { changed: [], affected: [], seeds: 0 },
-        });
-    }
-    ctx.progress(`Expanding from ${seedIds.length} changed symbol(s)`);
-    const scoped = scopeChange(session.provider(), [...new Set(seedIds)], {
-        trigger,
-        ...(budget === undefined ? {} : { budget }),
-    });
-    const affected = scoped.data.affected;
-    // `capped()` produces the slice and its shown/total detail together, so this reply
-    // can't cap without carrying what it capped — previously hand-sliced with only the
-    // prose note updated, so `truncated`/`truncatedDetail` stayed unset on the wire.
-    const cap = capped(affected, limit);
-    if (cap.detail !== null) {
-        notes.push(`${cap.detail.total - cap.detail.shown} lower-scoring affected node(s) are in the scope but not ` +
-            `listed here — the reply is capped at ${limit}. Raise "limit" to see them; they were ` +
-            "analysed either way.");
-    }
-    // P6-B5. `limit` used to bound `affected` alone, and `changed` — one entry per
-    // symbol declared in the named files — went out whole. That is unbounded by
-    // anything the caller controls: it is the size of the files they named, not of
-    // the answer they asked for. One generated file produced 638 entries and 162k
-    // characters, past the client's token limit, and the invariant sweep in
-    // `truncation-invariant.test.ts` could not catch it because an uncapped list
-    // emits no capping prose to scan for. The seeds are still all *analysed* — the
-    // traversal runs over every one of them, and `changedTotal` reports how many
-    // there were, so a capped list can never read as a smaller change than it was.
-    const changedCap = capped(scoped.data.changed, limit);
-    if (changedCap.detail !== null) {
-        notes.push(`${changedCap.detail.total - changedCap.detail.shown} of ${changedCap.detail.total} changed ` +
-            `symbol(s) are not listed here — the reply is capped at ${limit}. All ${changedCap.detail.total} ` +
-            'seeded the traversal; only the listing is shortened. Raise "limit" to see them.');
-    }
-    const byTier = [1, 2, 3, 4].map((tier) => ({
-        tier,
-        count: tier === 1
-            ? scoped.data.changed.length
-            : affected.filter((node) => node.tier === tier).length,
-    }));
-    // One `truncatedDetail` for a reply that now caps two lists: the rows carried
-    // versus the rows there were. Summing is the only reading of "the primary
-    // collection" that stays true when either list is cut — reporting `affected`'s
-    // pair alone would say nothing was withheld on a reply that withheld 290 seeds.
-    const shownRows = changedCap.shown.length + cap.shown.length;
-    const totalRows = scoped.data.changed.length + affected.length;
-    const truncatedDetail = changedCap.detail === null && cap.detail === null
-        ? null
-        : { shown: shownRows, total: totalRows, more: null };
-    return {
-        result: {
-            ...scoped,
-            data: {
-                changed: changedCap.shown.map(shape),
-                changedTotal: scoped.data.changed.length,
-                affected: cap.shown.map(shape),
-                affectedTotal: affected.length,
-                droppedForBudget: scoped.data.dropped.length,
-                budget: scoped.data.budget,
-                budgetUsed: scoped.data.budgetUsed,
-                byTier,
-            },
-            // Deliberately not `scoped.truncated` (the node *budget*'s own drop flag,
-            // disclosed separately via `droppedForBudget`) — this `truncated` means "this
-            // reply is shorter than the scope computed," a different fact from that.
-            truncated: truncatedDetail !== null,
-            notes: [...scoped.notes, ...notes],
-        },
-        ...(truncatedDetail === null ? {} : { truncatedDetail }),
-        ...(affected.length === 0 ? { state: "empty" } : {}),
-        nameLevel: true,
-        headline: `${scoped.data.changed.length} changed symbol(s) reach ${affected.length} other node(s) ` +
-            `above the impact threshold, under the ${trigger} budget of ${scoped.data.budget}.`,
-    };
-}
-export const scopeTool = {
-    name: "scope",
-    class: "read",
-    tier: "evidence",
-    version: "1.0.0",
-    title: "Blast radius of a change",
-    description: "Given the files or symbols you are changing, return what else is affected, ranked by impact " +
-        "score and grouped into tiers 1-4. Expansion stops on score rather than hop count, so a " +
-        "distant high-impact dependency is kept and a nearby trivial one is dropped. Names the paths " +
-        "it could not find in the graph rather than reporting them as unaffected.",
-    inputSchema: SCHEMA,
-    run,
-};
-//# sourceMappingURL=scope.js.map

package/dist/tools/scope.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/tools/scope.ts"],"names":[],"mappings":"AAAA;;;;0FAI0F;AAE1F,OAAO,EAAE,YAAY,EAAE,WAAW,EAAmC,MAAM,eAAe,CAAC;AAG3F,OAAO,EACL,MAAM,EACN,SAAS,EACT,YAAY,EACZ,eAAe,EACf,mBAAmB,EACnB,cAAc,GAIf,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AA2CtC,MAAM,QAAQ,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,SAAS,CAAU,CAAC;AAExD,MAAM,MAAM,GAAG;IACb,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,KAAK,EAAE;YACL,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;YACzB,WAAW,EACT,uFAAuF;gBACvF,eAAe;SAClB;QACD,OAAO,EAAE;YACP,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;YACzB,WAAW,EAAE,uEAAuE;SACrF;QACD,OAAO,EAAE;YACP,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC;YACnB,WAAW,EACT,4EAA4E;SAC/E;QACD,MAAM,EAAE;YACN,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,CAAC;YACV,WAAW,EAAE,qCAAqC;SACnD;QACD,KAAK,EAAE;YACL,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,CAAC;YACV,WAAW,EACT,2FAA2F;gBAC3F,yFAAyF;gBACzF,yFAAyF;gBACzF,0FAA0F;gBAC1F,kFAAkF;SACrF;KACF;IACD,oBAAoB,EAAE,KAAK;CACnB,CAAC;AAEX,SAAS,KAAK,CAAC,KAAiB;IAC9B,OAAO;QACL,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;QACxB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;KACvD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,GAAG,CAChB,IAA6B,EAC7B,GAAgB;IAEhB,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClE,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC;IAChE,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAEtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,cAAc,CAAC,2CAA2C,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;IAE5B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,GAAG,CAAC,QAAQ,CAAC,aAAa,KAAK,CAAC,MAAM,yBAAyB,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CACR,GAAG,QAAQ,CAAC,MAAM,yEAAyE;gBACzF,oEAAoE,CACvE,CAAC;QACJ,CAAC;QACD,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACvE,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CACR,GAAG,OAAO,CAAC,MAAM,OAAO,KAAK,CAAC,MAAM,qCAAqC;gBACvE,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,eAAe;gBACnF,uFAAuF;gBACvF,iEAAiE,CACpE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,SAAS,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAY;YACvB,QAAQ,EAAE,oFAAoF;YAC9F,KAAK,EAAE,SAAS;YAChB,SAAS,EAAE,IAAI;YACf,eAAe,EAAE,CAAC;YAClB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE;gBACL,GAAG,KAAK;gBACR,0FAA0F;aAC3F;YACD,IAAI,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;SAC9C,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,QAAQ,CAAC,kBAAkB,OAAO,CAAC,MAAM,oBAAoB,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE;QACpE,OAAO;QACP,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;KAC5C,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IACtC,mFAAmF;IACnF,mFAAmF;IACnF,iFAAiF;IACjF,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACpC,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CACR,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,2DAA2D;YAC/F,wCAAwC,KAAK,yCAAyC;YACtF,sBAAsB,CACzB,CAAC;IACJ,CAAC;IAED,+EAA+E;IAC/E,4EAA4E;IAC5E,+EAA+E;IAC/E,8EAA8E;IAC9E,wEAAwE;IACxE,6EAA6E;IAC7E,+EAA+E;IAC/E,6EAA6E;IAC7E,+EAA+E;IAC/E,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACtD,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CACR,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,OAAO,UAAU,CAAC,MAAM,CAAC,KAAK,WAAW;YAC3F,0DAA0D,KAAK,SAAS,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG;YAClG,iFAAiF,CACpF,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACzC,IAAI;QACJ,KAAK,EACH,IAAI,KAAK,CAAC;YACR,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM;YAC5B,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,MAAM;KAC3D,CAAC,CAAC,CAAC;IAEJ,8EAA8E;IAC9E,0EAA0E;IAC1E,+EAA+E;IAC/E,gFAAgF;IAChF,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;IAC7D,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC/D,MAAM,eAAe,GACnB,UAAU,CAAC,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI;QAC/C,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAEzD,OAAO;QACL,MAAM,EAAE;YACN,GAAG,MAAM;YACT,IAAI,EAAE;gBACJ,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBACpC,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM;gBACxC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC9B,aAAa,EAAE,QAAQ,CAAC,MAAM;gBAC9B,gBAAgB,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM;gBAC5C,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;gBAC1B,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU;gBAClC,MAAM;aACP;YACD,0EAA0E;YAC1E,8EAA8E;YAC9E,yEAAyE;YACzE,SAAS,EAAE,eAAe,KAAK,IAAI;YACnC,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC;SACnC;QACD,GAAG,CAAC,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC;QACxD,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,SAAS,EAAE,IAAI;QACf,QAAQ,EACN,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,4BAA4B,QAAQ,CAAC,MAAM,iBAAiB;YACzF,yCAAyC,OAAO,cAAc,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG;KACtF,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,SAAS,GAAmB;IACvC,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,MAAM;IACb,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,OAAO;IAChB,KAAK,EAAE,0BAA0B;IACjC,WAAW,EACT,8FAA8F;QAC9F,yFAAyF;QACzF,8FAA8F;QAC9F,0EAA0E;IAC5E,WAAW,EAAE,MAA4C;IACzD,GAAG;CACJ,CAAC"}

package/dist/tools/similar-incidents.d.ts

@@ -1,43 +0,0 @@
-/** `similar_incidents` ranks existing `INCIDENT` nodes against a failure with no graph node yet,
- *  deterministically (file/token Jaccard, no vector store). DEC-274 found zero `INCIDENT` nodes
- *  across three repos (734/459/203 commits): recall is 0/0, not 0% — an empty result never means
- *  "no similar incident exists" (DEC-279). §1.3a: a zero-incident graph is `refused`, never `empty`
- *  — the same split `contracts` and `propagation` apply to their own zero-population case. */
-import { type SimilarIncidentSignalKind } from "@descryy/core";
-import { type BriefNode, type ToolDefinition } from "./kit.ts";
-/** One signal that fired for a candidate — the "why", never a bare score. */
-export interface SimilarIncidentSignalReport {
-    readonly kind: SimilarIncidentSignalKind;
-    /** Jaccard similarity for this signal alone, 0..1. */
-    readonly score: number;
-}
-export interface SimilarIncidentReport {
-    readonly incident: BriefNode;
-    /** The `FIX_PATTERN` this incident resolved to, when a `FIXED_BY` edge exists. */
-    readonly fix: BriefNode | null;
-    /** How this incident was detected (`attrs.detectedVia`) — reported per match since the
-     *  mechanisms differ: revert, `Fixes #123`, a process dying at runtime, or `developer-confirmed`
-     *  testimony (capped at reliability B, DEC-223). `null` for incidents minted before this field. */
-    readonly detectedVia: string | null;
-    readonly signals: readonly SimilarIncidentSignalReport[];
-    /** Weighted combination of every signal the query attempted, 0..1. */
-    readonly score: number;
-}
-/** One shape, both branches: `analysed: false` with `incidentsInGraph: 0` is the zero-denominator
- *  case, `state: "refused"`. Counts live in the payload, not just prose, so a caller can read the
- *  denominator without parsing a sentence. */
-export interface SimilarIncidentsData {
-    readonly query: {
-        readonly touchedFiles: readonly string[];
-        readonly errorMessage: string | null;
-    };
-    readonly matches: readonly SimilarIncidentReport[];
-    /** Count before `limit` — honest about what was capped. */
-    readonly matchesTotal: number;
-    /** How many `INCIDENT` nodes were available to compare against. Zero is the headline fact. */
-    readonly incidentsInGraph: number;
-    /** False when the graph holds no `INCIDENT` node at all: nothing was compared. */
-    readonly analysed: boolean;
-}
-export declare const similarIncidentsTool: ToolDefinition;
-//# sourceMappingURL=similar-incidents.d.ts.map

package/dist/tools/similar-incidents.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"similar-incidents.d.ts","sourceRoot":"","sources":["../../src/tools/similar-incidents.ts"],"names":[],"mappings":"AAAA;;;;8FAI8F;AAE9F,OAAO,EAAoB,KAAK,yBAAyB,EAAE,MAAM,eAAe,CAAC;AAEjF,OAAO,EAOL,KAAK,SAAS,EAEd,KAAK,cAAc,EACpB,MAAM,UAAU,CAAC;AAiClB,6EAA6E;AAC7E,MAAM,WAAW,2BAA2B;IAC1C,QAAQ,CAAC,IAAI,EAAE,yBAAyB,CAAC;IACzC,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC;IAC7B,kFAAkF;IAClF,QAAQ,CAAC,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC;IAC/B;;uGAEmG;IACnG,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,2BAA2B,EAAE,CAAC;IACzD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;8CAE8C;AAC9C,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE;QACd,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;QACzC,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;KACtC,CAAC;IACF,QAAQ,CAAC,OAAO,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACnD,2DAA2D;IAC3D,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,8FAA8F;IAC9F,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,kFAAkF;IAClF,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AA0JD,eAAO,MAAM,oBAAoB,EAAE,cAqBlC,CAAC"}

package/dist/tools/similar-incidents.js

@@ -1,179 +0,0 @@
-/** `similar_incidents` ranks existing `INCIDENT` nodes against a failure with no graph node yet,
- *  deterministically (file/token Jaccard, no vector store). DEC-274 found zero `INCIDENT` nodes
- *  across three repos (734/459/203 commits): recall is 0/0, not 0% — an empty result never means
- *  "no similar incident exists" (DEC-279). §1.3a: a zero-incident graph is `refused`, never `empty`
- *  — the same split `contracts` and `propagation` apply to their own zero-population case. */
-import { similarIncidents } from "@descryy/core";
-import { answer, briefNode, optionalInteger, optionalString, optionalStringArray, ToolInputError, } from "./kit.js";
-const SCHEMA = {
-    type: "object",
-    properties: {
-        touchedFiles: {
-            type: "array",
-            items: { type: "string" },
-            description: "Repository-relative paths the failure touched — from a stack trace, a failing test's " +
-                "imports, or the diff being investigated. Matched against each incident's own correlated " +
-                "file set.",
-        },
-        errorMessage: {
-            type: "string",
-            description: "The failure's error or exception text. Matched against each incident's text, which today " +
-                "is always a commit subject line — real signal, but thin.",
-        },
-        minScore: {
-            type: "number",
-            minimum: 0,
-            maximum: 1,
-            description: "Drop candidates scoring below this. Default 0, meaning any signal that fired at all is " +
-                "returned — ranked, so a weak match is visible as a weak match rather than hidden.",
-        },
-        limit: { type: "integer", minimum: 1, description: "Cap on matches in the reply. Default 20." },
-    },
-    additionalProperties: false,
-};
-/** The mandatory disclosure sentence, shaped per branch. Written once here rather than inline at
- *  three return sites, so no branch can forget it. */
-function recallDisclosure(incidentsInGraph) {
-    return ((incidentsInGraph === 0
-        ? "This graph holds no INCIDENT node at all, so nothing was compared. "
-        : `${incidentsInGraph} INCIDENT node(s) were available to compare against. `) +
-        "Absence is not evidence here, and the reason is measured rather than assumed. An INCIDENT is " +
-        "minted only where somebody declared a failure or a machine witnessed one: a revert (written " +
-        "by git or by hand), a \"Fixes #123\", a service dying during an observed run, or " +
-        "\"mark_incident\". An ordinary fix-forward commit — how most bugs are actually fixed — mints " +
-        "nothing, and the heuristic that would have changed that was built, measured at 25% precision " +
-        "against a 90% threshold, and refused. DEC-274 found zero INCIDENT nodes across three real " +
-        "repositories of 734, 459 and 203 commits. So this matcher's recall is not computable (0/0) " +
-        "rather than 0%, and a failure this repository has genuinely hit before can be absent from " +
-        "these results entirely. The corpus grows fastest through \"mark_incident\": one call, at the " +
-        "moment you already know the answer.");
-}
-async function run(args, ctx) {
-    const touchedFiles = optionalStringArray(args, "touchedFiles") ?? [];
-    const errorMessage = optionalString(args, "errorMessage");
-    const limit = optionalInteger(args, "limit", 1) ?? 20;
-    const rawMinScore = args["minScore"];
-    if (rawMinScore !== undefined && rawMinScore !== null) {
-        if (typeof rawMinScore !== "number" || rawMinScore < 0 || rawMinScore > 1) {
-            throw new ToolInputError('"minScore" must be a number between 0 and 1');
-        }
-    }
-    const minScore = typeof rawMinScore === "number" ? rawMinScore : undefined;
-    // Describing nothing and being told "0 matches" is the empty-denominator
-    // defect at the input side: the reply would be indistinguishable from a real
-    // search that found nothing.
-    if (touchedFiles.length === 0 && (errorMessage === undefined || errorMessage === "")) {
-        throw new ToolInputError('give at least one of "touchedFiles" or "errorMessage" — with neither, there is nothing to ' +
-            "compare an incident against, and an empty answer would look like a search that ran");
-    }
-    const provider = ctx.session.provider();
-    // The population, read for its own sake. `similarIncidents` scans the same
-    // set internally but returns only what matched, and the count of what did
-    // *not* match is the number this tool's honesty rests on.
-    ctx.progress("Reading the incident population");
-    const population = provider.nodesOfType("INCIDENT");
-    const incidentsInGraph = population.nodes.length;
-    const base = provider.baseStamp();
-    if (incidentsInGraph === 0) {
-        return answer({
-            headline: "No incident is recorded in this graph, so nothing was compared against the failure you " +
-                "described. This is not a finding that the failure is new.",
-            // A refusal, not an empty result — §1.3a. `not_analysable` is the value
-            // today's envelope has for it; §1.1 renames it `refused` in P2.
-            state: "refused",
-            // Whether an incident resembles a failure is a claim about names and
-            // paths, not about shapes — the same class as `history`'s co-change
-            // rows. R0 is the honest floor: an INCIDENT is minted from a commit
-            // log, which is R0 by nature rather than by degradation.
-            nameLevel: true,
-            resolutionFloor: 0,
-            commitSha: base.commitSha,
-            graphBuiltAt: base.graphBuiltAt,
-            irSchemaVersion: base.irSchemaVersion,
-            commitSpread: base.commitSpread,
-            repoCount: base.repoCount,
-            notes: [recallDisclosure(0)],
-            data: {
-                query: { touchedFiles, errorMessage: errorMessage ?? null },
-                matches: [],
-                matchesTotal: 0,
-                incidentsInGraph: 0,
-                analysed: false,
-            },
-        });
-    }
-    ctx.progress(`Ranking ${incidentsInGraph} incident(s) against the failure`);
-    const ranked = similarIncidents(provider, {
-        ...(touchedFiles.length === 0 ? {} : { touchedFiles }),
-        ...(errorMessage === undefined ? {} : { errorMessage }),
-    }, { ...(minScore === undefined ? {} : { minScore }) });
-    const shown = ranked.data.slice(0, limit);
-    const notes = [...ranked.notes, recallDisclosure(incidentsInGraph)];
-    if (shown.length < ranked.data.length) {
-        notes.push(`${ranked.data.length - shown.length} further match(es) scored above the threshold but are ` +
-            `not listed — the reply is capped at ${limit}.`);
-    }
-    if (population.truncated) {
-        notes.push("The incident read was capped, so some INCIDENT nodes were never scored. The counts here " +
-            "are a lower bound.");
-    }
-    return {
-        result: {
-            data: {
-                query: { touchedFiles, errorMessage: errorMessage ?? null },
-                matches: shown.map((match) => ({
-                    incident: briefNode(match.incident),
-                    fix: match.fix === null ? null : briefNode(match.fix),
-                    // Read off the node rather than inferred from anything about the
-                    // match: which mechanism minted an incident is a fact about the
-                    // incident, not about how well it scored.
-                    detectedVia: typeof match.incident.attrs?.["detectedVia"] === "string"
-                        ? match.incident.attrs["detectedVia"]
-                        : null,
-                    signals: match.signals.map((s) => ({ kind: s.kind, score: Number(s.score.toFixed(4)) })),
-                    score: Number(match.combinedScore.toFixed(4)),
-                })),
-                matchesTotal: ranked.data.length,
-                incidentsInGraph,
-                analysed: true,
-            },
-            stamp: ranked.stamp,
-            truncated: ranked.truncated || shown.length < ranked.data.length || population.truncated,
-            notes,
-        },
-        ...(ranked.data.length === 0 ? { state: "empty" } : {}),
-        ...(shown.length < ranked.data.length
-            ? { truncatedDetail: { shown: shown.length, total: ranked.data.length, more: null } }
-            : {}),
-        nameLevel: true,
-        headline: ranked.data.length === 0
-            ? `None of the ${incidentsInGraph} incident(s) in this graph share a file or a phrase with ` +
-                "the failure you described. That is a statement about this graph's incident record, not " +
-                "about the failure."
-            : `${ranked.data.length} of ${incidentsInGraph} recorded incident(s) resemble this failure; ` +
-                `closest: ${shown[0].incident.name}` +
-                `${shown[0].fix === null ? "" : ` (fixed by: ${shown[0].fix.name})`}.`,
-    };
-}
-export const similarIncidentsTool = {
-    name: "similar_incidents",
-    class: "read",
-    tier: "evidence",
-    version: "1.0.0",
-    title: "Past incidents that resemble a failure happening now",
-    description: "Given the files a failure touched and/or its error text, rank the incidents already recorded " +
-        "in the graph by how much they resemble it, and name which signal fired for each — file " +
-        "overlap, message similarity, or both. Use this for a failure that has no graph node yet (a " +
-        "stack trace, a red test); use \"impact\" instead for incidents linked to a symbol that " +
-        "already exists. Deterministic graph and text matching only; no embedding search runs. Two " +
-        "absences and they are different answers: an empty result means this graph's recorded " +
-        "incidents were compared and none matched, while a refusal means the graph holds no incident " +
-        "at all — common, because an incident is only minted where somebody declared a failure (a " +
-        "revert, a \"Fixes #123\", a \"mark_incident\" call) or a machine witnessed one (a service " +
-        "dying during an observed run), and an ordinary fix-forward commit mints nothing. Neither " +
-        "absence is evidence that the failure is new. Every match reports its own \"detectedVia\", " +
-        "because a revert and a person's say-so are not the same kind of claim.",
-    inputSchema: SCHEMA,
-    run,
-};
-//# sourceMappingURL=similar-incidents.js.map

package/dist/tools/similar-incidents.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"similar-incidents.js","sourceRoot":"","sources":["../../src/tools/similar-incidents.ts"],"names":[],"mappings":"AAAA;;;;8FAI8F;AAE9F,OAAO,EAAE,gBAAgB,EAAkC,MAAM,eAAe,CAAC;AAEjF,OAAO,EACL,MAAM,EACN,SAAS,EACT,eAAe,EACf,cAAc,EACd,mBAAmB,EACnB,cAAc,GAIf,MAAM,UAAU,CAAC;AAGlB,MAAM,MAAM,GAAG;IACb,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,YAAY,EAAE;YACZ,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;YACzB,WAAW,EACT,uFAAuF;gBACvF,0FAA0F;gBAC1F,WAAW;SACd;QACD,YAAY,EAAE;YACZ,IAAI,EAAE,QAAQ;YACd,WAAW,EACT,2FAA2F;gBAC3F,0DAA0D;SAC7D;QACD,QAAQ,EAAE;YACR,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,WAAW,EACT,yFAAyF;gBACzF,mFAAmF;SACtF;QACD,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,0CAA0C,EAAE;KAChG;IACD,oBAAoB,EAAE,KAAK;CACnB,CAAC;AAuCX;sDACsD;AACtD,SAAS,gBAAgB,CAAC,gBAAwB;IAChD,OAAO,CACL,CAAC,gBAAgB,KAAK,CAAC;QACrB,CAAC,CAAC,qEAAqE;QACvE,CAAC,CAAC,GAAG,gBAAgB,uDAAuD,CAAC;QAC/E,+FAA+F;QAC/F,8FAA8F;QAC9F,mFAAmF;QACnF,+FAA+F;QAC/F,+FAA+F;QAC/F,4FAA4F;QAC5F,6FAA6F;QAC7F,4FAA4F;QAC5F,+FAA+F;QAC/F,qCAAqC,CACtC,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,GAAG,CAChB,IAA6B,EAC7B,GAAgB;IAEhB,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,EAAE,CAAC;IACrE,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACtD,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IACrC,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;QACtD,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YAC1E,MAAM,IAAI,cAAc,CAAC,6CAA6C,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;IAE3E,yEAAyE;IACzE,6EAA6E;IAC7E,6BAA6B;IAC7B,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,YAAY,KAAK,EAAE,CAAC,EAAE,CAAC;QACrF,MAAM,IAAI,cAAc,CACtB,4FAA4F;YAC1F,oFAAoF,CACvF,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;IAExC,2EAA2E;IAC3E,0EAA0E;IAC1E,0DAA0D;IAC1D,GAAG,CAAC,QAAQ,CAAC,iCAAiC,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,gBAAgB,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC;IAEjD,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;IAElC,IAAI,gBAAgB,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,MAAM,CAAC;YACZ,QAAQ,EACN,yFAAyF;gBACzF,2DAA2D;YAC7D,wEAAwE;YACxE,gEAAgE;YAChE,KAAK,EAAE,SAAS;YAChB,qEAAqE;YACrE,oEAAoE;YACpE,oEAAoE;YACpE,yDAAyD;YACzD,SAAS,EAAE,IAAI;YACf,eAAe,EAAE,CAAC;YAClB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,EAAE;gBACJ,KAAK,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,IAAI,IAAI,EAAE;gBAC3D,OAAO,EAAE,EAAE;gBACX,YAAY,EAAE,CAAC;gBACf,gBAAgB,EAAE,CAAC;gBACnB,QAAQ,EAAE,KAAK;aAChB;SACF,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,QAAQ,CAAC,WAAW,gBAAgB,kCAAkC,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR;QACE,GAAG,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC;QACtD,GAAG,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC;KACxD,EACD,EAAE,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CACpD,CAAC;IAEF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CACR,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,wDAAwD;YAC1F,uCAAuC,KAAK,GAAG,CAClD,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CACR,0FAA0F;YACxF,oBAAoB,CACvB,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM,EAAE;YACN,IAAI,EAAE;gBACJ,KAAK,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,IAAI,IAAI,EAAE;gBAC3D,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;oBAC7B,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC;oBACnC,GAAG,EAAE,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC;oBACrD,iEAAiE;oBACjE,gEAAgE;oBAChE,0CAA0C;oBAC1C,WAAW,EACT,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,aAAa,CAAC,KAAK,QAAQ;wBACvD,CAAC,CAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAY;wBACjD,CAAC,CAAC,IAAI;oBACV,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACxF,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBAC9C,CAAC,CAAC;gBACH,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;gBAChC,gBAAgB;gBAChB,QAAQ,EAAE,IAAI;aACf;YACD,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,SAAS;YACxF,KAAK;SACN;QACD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM;YACnC,CAAC,CAAC,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;YACrF,CAAC,CAAC,EAAE,CAAC;QACP,SAAS,EAAE,IAAI;QACf,QAAQ,EACN,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACtB,CAAC,CAAC,eAAe,gBAAgB,2DAA2D;gBAC1F,yFAAyF;gBACzF,oBAAoB;YACtB,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,OAAO,gBAAgB,+CAA+C;gBAC3F,YAAY,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,IAAI,EAAE;gBACrC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG;KAC/E,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,oBAAoB,GAAmB;IAClD,IAAI,EAAE,mBAAmB;IACzB,KAAK,EAAE,MAAM;IACb,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,OAAO;IAChB,KAAK,EAAE,sDAAsD;IAC7D,WAAW,EACT,+FAA+F;QAC/F,yFAAyF;QACzF,6FAA6F;QAC7F,yFAAyF;QACzF,4FAA4F;QAC5F,uFAAuF;QACvF,8FAA8F;QAC9F,2FAA2F;QAC3F,4FAA4F;QAC5F,2FAA2F;QAC3F,4FAA4F;QAC5F,wEAAwE;IAC1E,WAAW,EAAE,MAA4C;IACzD,GAAG;CACJ,CAAC"}

package/dist/tools/validate.d.ts

@@ -1,133 +0,0 @@
-/**
- * `validate` — §15 static validation: env/config checks.
- * Omits a var unless its read fails-on-absence AND declaration surface is complete
- * (18/107 wrong findings measured otherwise); refuses rather than `ok` when no reads
- * exist. Pass `files` for NEW_READ_UNDECLARED — catches accessor-shape-independent reads.
- * Add `changedLines` (from get_git_diff's patch) to verify against an added line rather
- * than a file scope, and get `defect` instead of `lead` back for it — see C2, UAT phase 4. */
-import type { AttributeFinding, AttributeReport, ConfigGraph, ConfigReadSite, EnvClaim, EnvEvidence, EnvFindingKind, EnvReport, MigrationIntegrityFinding, MigrationIntegrityReport, ObservedRouteFinding, OrmRegistrationFinding, OrmRegistrationReport, RollbackFinding, RollbackReport } from "@descryy/core";
-import type { ResolutionLevel } from "@descryy/ir";
-import { type ToolDefinition } from "./kit.ts";
-/** One env/config finding. `claim` distinguishes `defect` (code contradiction) from
- *  `lead` (worth a look) — conflating them caused 18/107 wrong findings on two repos. */
-export interface EnvFindingReport {
-    readonly kind: EnvFindingKind;
-    readonly name: string;
-    readonly claim: EnvClaim;
-    readonly detail: string;
-    /** Every location the finding rests on. Never empty. */
-    readonly evidence: readonly EnvEvidence[];
-    readonly resolution: ResolutionLevel;
-}
-/** A variable and how much of the repo depends on it (§15.3's third check feeding
- *  the first). Only variables with a computable dependent set appear — unknown ≠ zero. */
-export interface ConfigDependencyReport {
-    readonly name: string;
-    /** A lower bound, never a total. */
-    readonly dependents: number | null;
-    /** True when the traversal's budget stopped it short. */
-    readonly truncated: boolean;
-    /** Up to three read sites. */
-    readonly readAt: readonly ConfigReadSite[];
-    /** A few dependent files, for a reader who wants to look. */
-    readonly sample: readonly string[];
-}
-export interface ValidateData {
-    readonly findings: readonly EnvFindingReport[];
-    /** The count before `maxFindings` capped it — P27's disclosed remainder (§4 technique 5). */
-    readonly findingsTotal: number;
-    readonly surfaces: EnvReport["surfaces"];
-    readonly reads: EnvReport["reads"];
-    /** Null when no read existed at all, so the coverage guard could not be evaluated. */
-    readonly coverage: EnvReport["coverage"];
-    /** Declared and read nowhere. A dead-configuration lead, not a finding. */
-    readonly declaredNeverRead: number;
-    /** False when no adapter supplied environment reads — otherwise "no missing
-     *  variables" would misstate code that was never read as clean. */
-    readonly readsAvailable: boolean;
-    readonly configGraph: {
-        readonly counts: ConfigGraph["counts"];
-        /** True when the graph carried at least one resolved import edge. */
-        readonly importsAvailable: boolean;
-        /** The ten most-depended-on variables that had a computable dependent set. */
-        readonly mostDependedOn: readonly ConfigDependencyReport[];
-    };
-    readonly rollback: {
-        readonly findings: readonly RollbackFinding[];
-        /** The count before `maxFindings` capped it — P27's disclosed remainder (§4 technique 5). */
-        readonly findingsTotal: number;
-        readonly examined: RollbackReport["examined"];
-        /** Operations this check declined to report, by reason. The size of what it did not say. */
-        readonly withheld: RollbackReport["withheld"];
-        /** False when no source supplied migration operations. */
-        readonly ran: boolean;
-        /** Named in plain words when `ran` is false. */
-        readonly blockers: readonly string[];
-    };
-    /** §"attribute read, type doesn't declare it" — always a defect (graph-provable
-     *  contradiction between two producers), never a lead. */
-    readonly attributeExistence: {
-        readonly findings: readonly AttributeFinding[];
-        readonly findingsTotal: number;
-        readonly examined: AttributeReport["examined"];
-        /** False when no READS edge onto a type-like node carried field-existence info at all. */
-        readonly ran: boolean;
-    };
-    /** §"migration outside its directory, or broken revision chain" — both always
-     *  defects, both graph-provable. */
-    readonly migrationIntegrity: {
-        readonly findings: readonly MigrationIntegrityFinding[];
-        readonly findingsTotal: number;
-        readonly examined: MigrationIntegrityReport["examined"];
-        readonly migrationsDirectory: string | null;
-        /** False when no module in the graph carried migration revision attrs. */
-        readonly ran: boolean;
-        readonly withheld: MigrationIntegrityReport["withheld"];
-    };
-    /** §"ORM model inherits the declarative base but no __init__.py in its package
-     *  reaches its module" — always a lead, never a defect: a model registered by an
-     *  explicit scan rather than by import, or deliberately excluded from migrations,
-     *  triggers this without being a bug. See `orm-registration.ts`'s header. */
-    readonly ormRegistration: {
-        readonly findings: readonly OrmRegistrationFinding[];
-        readonly findingsTotal: number;
-        readonly examined: OrmRegistrationReport["examined"];
-        /** False when no MODEL node in the graph carried an outgoing INHERITS edge. */
-        readonly ran: boolean;
-        readonly withheld: OrmRegistrationReport["withheld"];
-    };
-    /** §"an observed HTTP response against a path no route serves" — UAT phase 5 §5
-     *  (D2). Always a lead: a status code and path alone can never rule out a
-     *  legitimately missing resource. See `@descryy/core`'s `observed-routes.ts`. */
-    readonly observedRoutes: {
-        readonly findings: readonly ObservedRouteFinding[];
-        readonly findingsTotal: number;
-        readonly examined: number;
-        /** False when no evidence database exists yet, or it holds no NETWORK_RESPONSE/
-         *  HTTP_ERROR events — never created here: this is a read tool. */
-        readonly ran: boolean;
-    };
-}
-/** The minimal shape every one of `validate`'s finding sources satisfies — enough
- *  for a composer to count and rank without knowing which producer emitted an item. */
-export interface ValidateFinding {
-    readonly claim: "defect" | "lead";
-    readonly detail: string;
-}
-/**
- * Flattens every one of `validate`'s finding sources into one array: the
- * top-level env array plus the nested reports (`rollback`, `attributeExistence`,
- * `migrationIntegrity`, `ormRegistration`, `observedRoutes`).
- *
- * `validate` publishes findings across several separate sub-objects because
- * each check examines a different kind of evidence and discloses its own
- * `ran`/`examined`/`withheld` detail alongside its findings. A composer that
- * reads only one of them silently drops the rest — the exact failure UAT
- * phase 5 §4 found in `pre_push`, which read `data.findings` and nothing
- * else. This function is the one place that knows the full list, so a new
- * sub-check added here is inherited by every composer automatically instead
- * of requiring a second, easily-forgotten edit at each call site.
- */
-export declare function collectValidateFindings(data: ValidateData): readonly ValidateFinding[];
-export declare const validateTool: ToolDefinition;
-//# sourceMappingURL=validate.d.ts.map

package/dist/tools/validate.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../src/tools/validate.ts"],"names":[],"mappings":"AAAA;;;;;;8FAM8F;AAkB9F,OAAO,KAAK,EAEV,gBAAgB,EAChB,eAAe,EACf,WAAW,EACX,cAAc,EACd,QAAQ,EACR,WAAW,EACX,cAAc,EACd,SAAS,EACT,yBAAyB,EACzB,wBAAwB,EACxB,oBAAoB,EACpB,sBAAsB,EACtB,qBAAqB,EACrB,eAAe,EACf,cAAc,EACf,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAInD,OAAO,EAKL,KAAK,cAAc,EACpB,MAAM,UAAU,CAAC;AAIlB;yFACyF;AACzF,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wDAAwD;IACxD,QAAQ,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,eAAe,CAAC;CACtC;AAED;0FAC0F;AAC1F,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,oCAAoC;IACpC,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,yDAAyD;IACzD,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,8BAA8B;IAC9B,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,CAAC;IAC3C,6DAA6D;IAC7D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC/C,6FAA6F;IAC7F,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;IACzC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;IACnC,sFAAsF;IACtF,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;IACzC,2EAA2E;IAC3E,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC;uEACmE;IACnE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,WAAW,EAAE;QACpB,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QACvC,qEAAqE;QACrE,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;QACnC,8EAA8E;QAC9E,QAAQ,CAAC,cAAc,EAAE,SAAS,sBAAsB,EAAE,CAAC;KAC5D,CAAC;IACF,QAAQ,CAAC,QAAQ,EAAE;QACjB,QAAQ,CAAC,QAAQ,EAAE,SAAS,eAAe,EAAE,CAAC;QAC9C,6FAA6F;QAC7F,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;QAC/B,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC,UAAU,CAAC,CAAC;QAC9C,4FAA4F;QAC5F,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC,UAAU,CAAC,CAAC;QAC9C,0DAA0D;QAC1D,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC;QACtB,gDAAgD;QAChD,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;KACtC,CAAC;IACF;8DAC0D;IAC1D,QAAQ,CAAC,kBAAkB,EAAE;QAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;QAC/C,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;QAC/B,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,0FAA0F;QAC1F,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC;KACvB,CAAC;IACF;wCACoC;IACpC,QAAQ,CAAC,kBAAkB,EAAE;QAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,yBAAyB,EAAE,CAAC;QACxD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;QAC/B,QAAQ,CAAC,QAAQ,EAAE,wBAAwB,CAAC,UAAU,CAAC,CAAC;QACxD,QAAQ,CAAC,mBAAmB,EAAE,MAAM,GAAG,IAAI,CAAC;QAC5C,0EAA0E;QAC1E,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC;QACtB,QAAQ,CAAC,QAAQ,EAAE,wBAAwB,CAAC,UAAU,CAAC,CAAC;KACzD,CAAC;IACF;;;iFAG6E;IAC7E,QAAQ,CAAC,eAAe,EAAE;QACxB,QAAQ,CAAC,QAAQ,EAAE,SAAS,sBAAsB,EAAE,CAAC;QACrD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;QAC/B,QAAQ,CAAC,QAAQ,EAAE,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACrD,+EAA+E;QAC/E,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC;QACtB,QAAQ,CAAC,QAAQ,EAAE,qBAAqB,CAAC,UAAU,CAAC,CAAC;KACtD,CAAC;IACF;;qFAEiF;IACjF,QAAQ,CAAC,cAAc,EAAE;QACvB,QAAQ,CAAC,QAAQ,EAAE,SAAS,oBAAoB,EAAE,CAAC;QACnD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;QAC/B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B;2EACmE;QACnE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC;KACvB,CAAC;CACH;AAED;uFACuF;AACvF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,eAAe,EAAE,CAStF;AA+ZD,eAAO,MAAM,YAAY,EAAE,cAsC1B,CAAC"}