@descryy/mcp 0.1.0

package/dist/tools/refusal-fetch.d.ts

@@ -0,0 +1,71 @@
+/**
+ * `refusal_fetch` — the fourteenth endpoint (`ai-layer-plan.md` §3), and the
+ * new work that endpoint's own re-derivation pointed at. §4 technique 4:
+ * *"Refusals summarised, never enumerated. A count, one verbatim exemplar, a
+ * handle to fetch the rest."*
+ *
+ * The logic underneath — `summariseRefusals`/`fetchRefusalPage`
+ * (`@descryy/core`'s `query/refusal-fetch.ts`) — is already built and
+ * unit-tested; this is the tool boundary its own header names as still open:
+ * *"An MCP surface that wants a prettier, shorter token... is free to wrap
+ * this — that is a presentation choice for P27."* No wrapping was needed —
+ * the handle is already opaque and self-describing — so this tool is thin:
+ * read the population, hand it to whichever of the two functions the call
+ * shape asks for.
+ *
+ * ## Two calls, one tool — same pattern `questions.ts` already uses
+ *
+ * No `handle` argument → a fresh summary (`summariseRefusals`): cheap, one
+ * count, one exemplar, a handle. A `handle` argument → redeem it for a real
+ * page (`fetchRefusalPage`). This mirrors `questions.ts`'s own "no `answer`
+ * argument is a pure read" split rather than inventing a second shape.
+ *
+ * ## The call-site trap this tool must not reproduce
+ *
+ * `refusal-fetch.ts`'s own header names it explicitly: the store reader
+ * defaults to `classified: true`, which silently drops every unclassified
+ * row (DEC-243's grouper only wants the classifiable subset). This tool
+ * always asks for `{ classified: false }` — the complete ledger, classified
+ * and unclassified alike — because a `refusal_fetch` that only showed the
+ * askable subset would be the empty-denominator defect wearing this
+ * technique's clothes, exactly what that module's header warns against.
+ *
+ * ## No cap on the population read
+ *
+ * `provider.unresolvedRefs({ classified: false })` is called with no
+ * `limit` — the handle's population fingerprint has to be stable between the
+ * summary call and every page redemption, and a capped read here would make
+ * "the ledger changed" indistinguishable from "the cap sampled differently
+ * this time." Correctness over a cheap shortcut, same choice `refusal-fetch.ts`
+ * itself already made.
+ */
+import { type ToolDefinition } from "./kit.ts";
+export interface RefusalFetchSummaryItem {
+    readonly fromNodeId: string;
+    readonly edgeType: string;
+    readonly rawTarget: string;
+    readonly file: string | null;
+    readonly line: number | null;
+    readonly producedBy: string;
+    readonly reason: string;
+}
+export interface RefusalFetchSummaryData {
+    readonly kind: "summary";
+    /** The honest denominator — every unresolved row in the graph, classified and unclassified alike. */
+    readonly count: number;
+    /** One row's `reason`, verbatim — never re-worded (§4 technique 4). `null` only when `count === 0`. */
+    readonly exemplar: string | null;
+    /** Redeem with a follow-up call passing this as `handle`. `null` only when `count === 0`. */
+    readonly handle: string | null;
+}
+export interface RefusalFetchPageData {
+    readonly kind: "page";
+    readonly items: readonly RefusalFetchSummaryItem[];
+    /** Restated on every page — the truncation rule pointed the other way (§5.5). */
+    readonly total: number;
+    /** Redeem for the next page. `null` on the last page. */
+    readonly nextHandle: string | null;
+}
+export type RefusalFetchData = RefusalFetchSummaryData | RefusalFetchPageData;
+export declare const refusalFetchTool: ToolDefinition;
+//# sourceMappingURL=refusal-fetch.d.ts.map

package/dist/tools/refusal-fetch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refusal-fetch.d.ts","sourceRoot":"","sources":["../../src/tools/refusal-fetch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAIH,OAAO,EAKL,KAAK,cAAc,EACpB,MAAM,UAAU,CAAC;AAqBlB,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,qGAAqG;IACrG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uGAAuG;IACvG,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,6FAA6F;IAC7F,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,SAAS,uBAAuB,EAAE,CAAC;IACnD,iFAAiF;IACjF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,yDAAyD;IACzD,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,MAAM,gBAAgB,GAAG,uBAAuB,GAAG,oBAAoB,CAAC;AAiF9E,eAAO,MAAM,gBAAgB,EAAE,cAe9B,CAAC"}

package/dist/tools/refusal-fetch.js

@@ -0,0 +1,137 @@
+/**
+ * `refusal_fetch` — the fourteenth endpoint (`ai-layer-plan.md` §3), and the
+ * new work that endpoint's own re-derivation pointed at. §4 technique 4:
+ * *"Refusals summarised, never enumerated. A count, one verbatim exemplar, a
+ * handle to fetch the rest."*
+ *
+ * The logic underneath — `summariseRefusals`/`fetchRefusalPage`
+ * (`@descryy/core`'s `query/refusal-fetch.ts`) — is already built and
+ * unit-tested; this is the tool boundary its own header names as still open:
+ * *"An MCP surface that wants a prettier, shorter token... is free to wrap
+ * this — that is a presentation choice for P27."* No wrapping was needed —
+ * the handle is already opaque and self-describing — so this tool is thin:
+ * read the population, hand it to whichever of the two functions the call
+ * shape asks for.
+ *
+ * ## Two calls, one tool — same pattern `questions.ts` already uses
+ *
+ * No `handle` argument → a fresh summary (`summariseRefusals`): cheap, one
+ * count, one exemplar, a handle. A `handle` argument → redeem it for a real
+ * page (`fetchRefusalPage`). This mirrors `questions.ts`'s own "no `answer`
+ * argument is a pure read" split rather than inventing a second shape.
+ *
+ * ## The call-site trap this tool must not reproduce
+ *
+ * `refusal-fetch.ts`'s own header names it explicitly: the store reader
+ * defaults to `classified: true`, which silently drops every unclassified
+ * row (DEC-243's grouper only wants the classifiable subset). This tool
+ * always asks for `{ classified: false }` — the complete ledger, classified
+ * and unclassified alike — because a `refusal_fetch` that only showed the
+ * askable subset would be the empty-denominator defect wearing this
+ * technique's clothes, exactly what that module's header warns against.
+ *
+ * ## No cap on the population read
+ *
+ * `provider.unresolvedRefs({ classified: false })` is called with no
+ * `limit` — the handle's population fingerprint has to be stable between the
+ * summary call and every page redemption, and a capped read here would make
+ * "the ledger changed" indistinguishable from "the cap sampled differently
+ * this time." Correctness over a cheap shortcut, same choice `refusal-fetch.ts`
+ * itself already made.
+ */
+import { fetchRefusalPage, summariseRefusals } from "@descryy/core";
+import { answer, optionalInteger, optionalString, } from "./kit.js";
+const SCHEMA = {
+    type: "object",
+    properties: {
+        handle: {
+            type: "string",
+            description: "Redeem a handle from a prior refusal_fetch call to fetch the next page of rows. Omit for " +
+                "a fresh summary — count, one exemplar reason, and a handle to start paging.",
+        },
+        pageSize: {
+            type: "integer",
+            minimum: 1,
+            description: "Rows per page when minting a fresh handle (a summary call). Default 50. Ignored on a paged call — the page size travels inside the handle itself.",
+        },
+    },
+    additionalProperties: false,
+};
+function brief(ref) {
+    return {
+        fromNodeId: ref.fromNodeId,
+        edgeType: ref.edgeType,
+        rawTarget: ref.rawTarget,
+        file: ref.file,
+        line: ref.line,
+        producedBy: ref.producedBy,
+        reason: ref.reason,
+    };
+}
+async function run(args, ctx) {
+    const handle = optionalString(args, "handle");
+    const pageSize = optionalInteger(args, "pageSize", 1);
+    const base = ctx.session.provider().baseStamp();
+    ctx.progress("Reading the unresolved-reference ledger");
+    const { refs } = ctx.session.provider().unresolvedRefs({ classified: false });
+    const envelopeBase = {
+        resolutionFloor: 0, // a ledger read, not a graph traversal claim — same convention as similar_incidents' R0 floor
+        commitSha: base.commitSha,
+        graphBuiltAt: base.graphBuiltAt,
+        irSchemaVersion: base.irSchemaVersion,
+        nameLevel: true,
+    };
+    if (handle === undefined) {
+        ctx.progress(`Summarising ${refs.length} unresolved reference(s)`);
+        const summary = summariseRefusals(refs, pageSize);
+        return answer({
+            ...envelopeBase,
+            state: summary.count === 0 ? "empty" : "ok",
+            headline: summary.count === 0
+                ? "No unresolved references are recorded — nothing for refusal_fetch to page through."
+                : `${summary.count} unresolved reference(s) recorded. Exemplar: "${summary.exemplar}". Call again with { "handle": "${summary.handle}" } to page through the rest.`,
+            notes: summary.count === 0
+                ? ["The graph has no unresolved-reference rows at all — every edge either resolved or was never attempted."]
+                : [],
+            data: { kind: "summary", count: summary.count, exemplar: summary.exemplar, handle: summary.handle },
+        });
+    }
+    ctx.progress("Redeeming the refusal_fetch handle");
+    const page = fetchRefusalPage(refs, handle);
+    if (page.state === "refused") {
+        return answer({
+            ...envelopeBase,
+            state: "refused",
+            headline: "This refusal_fetch handle could not be redeemed.",
+            notes: [page.reason],
+            data: { kind: "page", items: [], total: 0, nextHandle: null },
+        });
+    }
+    return answer({
+        ...envelopeBase,
+        headline: `Page of ${page.items.length} unresolved reference(s), of ${page.total} total.`,
+        notes: [],
+        data: {
+            kind: "page",
+            items: page.items.map(brief),
+            total: page.total,
+            nextHandle: page.nextHandle,
+        },
+    });
+}
+export const refusalFetchTool = {
+    name: "refusal_fetch",
+    class: "read",
+    tier: "evidence",
+    version: "1.0.0",
+    title: "Page through the graph's recorded refusals",
+    description: "The graph's full ledger of unresolved references — edges an adapter could not resolve, with " +
+        "the reason recorded rather than guessed. Call with no arguments for a one-line summary (count, " +
+        "one exemplar reason, a handle); call again with that handle to page through every row. Never " +
+        "enumerates in full on the first call — §4 technique 4: summarise, don't enumerate. A handle " +
+        "issued against a population that has since changed (a re-analyse ran) refuses rather than " +
+        "silently returning a wrong page.",
+    inputSchema: SCHEMA,
+    run,
+};
+//# sourceMappingURL=refusal-fetch.js.map

package/dist/tools/refusal-fetch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refusal-fetch.js","sourceRoot":"","sources":["../../src/tools/refusal-fetch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAEH,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAEpE,OAAO,EACL,MAAM,EACN,eAAe,EACf,cAAc,GAGf,MAAM,UAAU,CAAC;AAGlB,MAAM,MAAM,GAAG;IACb,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,MAAM,EAAE;YACN,IAAI,EAAE,QAAQ;YACd,WAAW,EACT,2FAA2F;gBAC3F,6EAA6E;SAChF;QACD,QAAQ,EAAE;YACR,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,CAAC;YACV,WAAW,EAAE,mJAAmJ;SACjK;KACF;IACD,oBAAoB,EAAE,KAAK;CACnB,CAAC;AAiCX,SAAS,KAAK,CAAC,GAQd;IACC,OAAO;QACL,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,MAAM,EAAE,GAAG,CAAC,MAAM;KACnB,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,GAAG,CAAC,IAA6B,EAAE,GAAgB;IAChE,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAEtD,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,SAAS,EAAE,CAAC;IAChD,GAAG,CAAC,QAAQ,CAAC,yCAAyC,CAAC,CAAC;IACxD,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,cAAc,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;IAE9E,MAAM,YAAY,GAAG;QACnB,eAAe,EAAE,CAAU,EAAE,8FAA8F;QAC3H,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,YAAY,EAAE,IAAI,CAAC,YAAY;QAC/B,eAAe,EAAE,IAAI,CAAC,eAAe;QACrC,SAAS,EAAE,IAAI;KAChB,CAAC;IAEF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,GAAG,CAAC,QAAQ,CAAC,eAAe,IAAI,CAAC,MAAM,0BAA0B,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAClD,OAAO,MAAM,CAAC;YACZ,GAAG,YAAY;YACf,KAAK,EAAE,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;YAC3C,QAAQ,EACN,OAAO,CAAC,KAAK,KAAK,CAAC;gBACjB,CAAC,CAAC,oFAAoF;gBACtF,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,iDAAiD,OAAO,CAAC,QAAQ,mCAAmC,OAAO,CAAC,MAAM,+BAA+B;YACvK,KAAK,EACH,OAAO,CAAC,KAAK,KAAK,CAAC;gBACjB,CAAC,CAAC,CAAC,wGAAwG,CAAC;gBAC5G,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE;SACpG,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,QAAQ,CAAC,oCAAoC,CAAC,CAAC;IACnD,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC5C,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAC;YACZ,GAAG,YAAY;YACf,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,kDAAkD;YAC5D,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC;YACpB,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE;SAC9D,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;QACZ,GAAG,YAAY;QACf,QAAQ,EAAE,WAAW,IAAI,CAAC,KAAK,CAAC,MAAM,gCAAgC,IAAI,CAAC,KAAK,SAAS;QACzF,KAAK,EAAE,EAAE;QACT,IAAI,EAAE;YACJ,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;YAC5B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B;KACF,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,MAAM,gBAAgB,GAAmB;IAC9C,IAAI,EAAE,eAAe;IACrB,KAAK,EAAE,MAAM;IACb,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,OAAO;IAChB,KAAK,EAAE,4CAA4C;IACnD,WAAW,EACT,8FAA8F;QAC9F,iGAAiG;QACjG,+FAA+F;QAC/F,8FAA8F;QAC9F,4FAA4F;QAC5F,kCAAkC;IACpC,WAAW,EAAE,MAA4C;IACzD,GAAG;CACJ,CAAC"}

package/dist/tools/scope.d.ts

@@ -0,0 +1,60 @@
+/**
+ * `scope` — "I am about to change this. What else does it touch?"
+ *
+ * §12.5's diff scoping, exposed. Expansion stops on **score**, not hop count:
+ * a delete reaching a payment gateway four hops out matters and a logging import
+ * one hop out does not, and hop-count scoping cannot tell those apart.
+ *
+ * ## Files in, node ids out — and the misses are part of the answer
+ *
+ * A developer names files; scoping seeds on nodes. A path in the request that
+ * the graph has never heard of is the interesting case, and it has two very
+ * different causes that look identical from here: the file is not analysable by
+ * any configured adapter, or the graph is stale and predates the file. Both mean
+ * the blast radius omits it, so both are disclosed. Reporting "0 affected" for a
+ * file the graph does not contain would be the exact confirmed-clean-versus-not-
+ * analysable collapse §20.2 exists to prevent.
+ */
+import { type ScopeTier } from "@descryy/core";
+import type { EdgeType } from "@descryy/ir";
+import { type BriefNode, type ToolDefinition } from "./kit.ts";
+/** A node in the scope, with why it is in it. */
+export interface ScopedNodeReport extends BriefNode {
+    readonly score: number;
+    readonly tier: ScopeTier;
+    readonly depth: number;
+    /** The edge type this node was reached through. Absent for a seed. */
+    readonly via?: EdgeType;
+}
+/** Tier 1 is the changed set itself; 2-4 are the scoring bands beneath it. */
+export interface ScopeTierCount {
+    readonly tier: number;
+    readonly count: number;
+}
+export interface ScopeReport {
+    readonly changed: readonly ScopedNodeReport[];
+    /** Capped by `limit`; `affectedTotal` is the uncapped count. */
+    readonly affected: readonly ScopedNodeReport[];
+    readonly affectedTotal: number;
+    readonly droppedForBudget: number;
+    readonly budget: number;
+    readonly budgetUsed: number;
+    readonly byTier: readonly ScopeTierCount[];
+}
+/**
+ * Nothing the caller named is in the graph, so the traversal never ran.
+ *
+ * A genuinely different shape rather than a `ScopeReport` full of zeroes, and
+ * the absent keys are the tell: there is no `budget` because nothing was
+ * spent, and no `affectedTotal` because nothing was counted. `changed` and
+ * `affected` are always empty here and `seeds` is always 0 — narrow on
+ * `"seeds" in data`.
+ */
+export interface ScopeNotSeeded {
+    readonly changed: readonly ScopedNodeReport[];
+    readonly affected: readonly ScopedNodeReport[];
+    readonly seeds: number;
+}
+export type ScopeData = ScopeReport | ScopeNotSeeded;
+export declare const scopeTool: ToolDefinition;
+//# sourceMappingURL=scope.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scope.d.ts","sourceRoot":"","sources":["../../src/tools/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAA8C,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAC3F,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAE5C,OAAO,EAOL,KAAK,SAAS,EAEd,KAAK,cAAc,EACpB,MAAM,UAAU,CAAC;AAGlB,iDAAiD;AACjD,MAAM,WAAW,gBAAiB,SAAQ,SAAS;IACjD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,sEAAsE;IACtE,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;CACzB;AAED,8EAA8E;AAC9E,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC9C,gEAAgE;IAChE,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC/C,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,CAAC;CAC5C;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC9C,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC/C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,MAAM,SAAS,GAAG,WAAW,GAAG,cAAc,CAAC;AA0JrD,eAAO,MAAM,SAAS,EAAE,cAavB,CAAC"}

package/dist/tools/scope.js

@@ -0,0 +1,160 @@
+/**
+ * `scope` — "I am about to change this. What else does it touch?"
+ *
+ * §12.5's diff scoping, exposed. Expansion stops on **score**, not hop count:
+ * a delete reaching a payment gateway four hops out matters and a logging import
+ * one hop out does not, and hop-count scoping cannot tell those apart.
+ *
+ * ## Files in, node ids out — and the misses are part of the answer
+ *
+ * A developer names files; scoping seeds on nodes. A path in the request that
+ * the graph has never heard of is the interesting case, and it has two very
+ * different causes that look identical from here: the file is not analysable by
+ * any configured adapter, or the graph is stale and predates the file. Both mean
+ * the blast radius omits it, so both are disclosed. Reporting "0 affected" for a
+ * file the graph does not contain would be the exact confirmed-clean-versus-not-
+ * analysable collapse §20.2 exists to prevent.
+ */
+import { nodesInFiles, scopeChange } from "@descryy/core";
+import { answer, briefNode, optionalEnum, optionalInteger, optionalStringArray, ToolInputError, } from "./kit.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 affected nodes come back in the reply. Default 25 (MK-9 — the same walk-cost " +
+                "reduction impact.ts applies, for the same reason). 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,
+            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;
+    const shown = affected.slice(0, limit);
+    if (shown.length < affected.length) {
+        notes.push(`${affected.length - shown.length} 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.");
+    }
+    const byTier = [1, 2, 3, 4].map((tier) => ({
+        tier,
+        count: tier === 1
+            ? scoped.data.changed.length
+            : affected.filter((node) => node.tier === tier).length,
+    }));
+    return {
+        result: {
+            ...scoped,
+            data: {
+                changed: scoped.data.changed.map(shape),
+                affected: shown.map(shape),
+                affectedTotal: affected.length,
+                droppedForBudget: scoped.data.dropped.length,
+                budget: scoped.data.budget,
+                budgetUsed: scoped.data.budgetUsed,
+                byTier,
+            },
+            notes: [...scoped.notes, ...notes],
+        },
+        ...(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

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/tools/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,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;AA8ClB,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,4FAA4F;gBAC5F,qFAAqF;gBACrF,iEAAiE;SACpE;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,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,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CACR,GAAG,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,2DAA2D;YAC1F,wCAAwC,KAAK,yCAAyC;YACtF,sBAAsB,CACzB,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,OAAO;QACL,MAAM,EAAE;YACN,GAAG,MAAM;YACT,IAAI,EAAE;gBACJ,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBACvC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC1B,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,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC;SACnC;QACD,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

@@ -0,0 +1,105 @@
+/**
+ * `similar_incidents` — "have we seen this failure before?", asked about a
+ * failure that is **not yet in the graph**.
+ *
+ * ## Why this is a separate tool from `impact`'s `related` field
+ *
+ * `rootCauseSearch` — the `related` list every `impact` reply carries — walks
+ * `INCIDENT_CORRELATED`/`FIXED_BY` edges out of a node that already exists.
+ * It cannot help with a failure observed a moment ago: a stack trace and a set
+ * of touched files have no node, so there is nothing to walk from. This tool
+ * is the other direction. It takes the failure as a description and ranks the
+ * `INCIDENT` nodes the graph already holds against it, using the two signals
+ * `similarIncidents` (`@descryy/core`, DEC-274 step 2) computes from data the
+ * graph already has: file-set Jaccard over `INCIDENT_CORRELATED`, and
+ * token-set Jaccard over the incident's own text. Deterministic, no vector
+ * store, no model call.
+ *
+ * ## The disclosure this tool exists to carry, and it is not optional
+ *
+ * DEC-279 makes one sentence mandatory here, and DEC-274 is why. That
+ * measurement ran the correlation machinery over `descry-core`,
+ * `descry-runtime` and `descry-adapters` — 734, 459 and 203 commits — and
+ * found **zero `INCIDENT` nodes in all three**. Not few: zero. Only an
+ * explicit `git revert` mints an `INCIDENT` today; a fix-forward commit, which
+ * is how almost every real bug is actually fixed, mints nothing at all.
+ *
+ * So this matcher's **recall is not computable — 0/0, not 0%**. It has never
+ * been handed a real incident to find, and no number describes how many it
+ * would miss. An empty result therefore means *"no linked incident in this
+ * graph, and this graph has few or no incidents"* and must never be read as
+ * *"no similar incident exists."* That is the same *absence is not evidence*
+ * obligation `impact` already carries on every reply, and `similar-incidents.test.ts`
+ * fails if it goes missing from either the empty or the non-empty branch.
+ *
+ * ## Two different absences, and they are not the same result
+ *
+ * `ai-tool-contract.md` §1.3a splits them, and the split is the whole reason
+ * this endpoint is interesting:
+ *
+ * - **Incidents exist and none matched.** The denominator is real, the tool
+ *   looked completely, and the absence is a fact about the code. `state:
+ *   "empty"`, per §1.1's split.
+ * - **The graph holds zero `INCIDENT` nodes.** There is no denominator.
+ *   Nothing was looked at, and the reason is Descry's producer coverage
+ *   rather than anything about this repository: only `git revert` mints an
+ *   `INCIDENT` and fix-forward mints nothing. Answering "empty" there would
+ *   say *"this code has no similar incidents"* when the true statement is
+ *   *"Descry cannot see most incidents in any codebase"* — the
+ *   empty-denominator defect inside the endpoint written to demonstrate the
+ *   rule against it. So it is a refusal, carried as `state: "refused"` (§1.1:
+ *   `refused` is a result state, and `not analysable` is a report category —
+ *   different axes, never this).
+ *
+ * §1.3a generalises it past this tool: **when a query's population is itself
+ * zero, the answer is a refusal, never an empty result.** That puts this in
+ * line with its siblings rather than apart from them — `contracts` refuses on
+ * a graph with no endpoint, `propagation` when no walked edge type touches
+ * the start node.
+ *
+ * The denominator travels in the payload either way. `incidentsInGraph` is
+ * the population and `analysed` is false only when it is zero, so a caller
+ * can tell the two absences apart **from the payload alone, with no string
+ * matching on prose** — §1's distinguishability requirement, satisfied
+ * without waiting for the wider envelope.
+ */
+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;
+    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
+ * and arrives with `state: "refused"`; every other reply is `ok`.
+ * The two counts are in the payload rather than only in the prose because a
+ * caller deciding what to say about an empty list needs the denominator, and
+ * a sentence it has to parse is not a denominator.
+ */
+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

@@ -0,0 +1 @@
+{"version":3,"file":"similar-incidents.d.ts","sourceRoot":"","sources":["../../src/tools/similar-incidents.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgEG;AAEH,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,QAAQ,CAAC,OAAO,EAAE,SAAS,2BAA2B,EAAE,CAAC;IACzD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;GAQG;AACH,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;AAiJD,eAAO,MAAM,oBAAoB,EAAE,cAkBlC,CAAC"}