@neat.is/mcp 0.2.8 → 0.2.10

package/dist/index.cjs

@@ -240,6 +240,9 @@ function registerResources(server2, client2, options = {}) {
   };
 }
 
+// src/index.ts
+var import_types3 = require("@neat.is/types");
+
 // src/tools.ts
 var import_types = require("@neat.is/types");
 
@@ -638,6 +641,62 @@ async function checkPolicies(client2, input) {
     return formatErrorResponse(`Error talking to neat-core: ${err.message}`);
   }
 }
+function buildDivergencesPath(input) {
+  const params = new URLSearchParams();
+  if (input.type && input.type.length > 0) params.set("type", input.type.join(","));
+  if (input.minConfidence !== void 0) {
+    params.set("minConfidence", String(input.minConfidence));
+  }
+  if (input.node) params.set("node", input.node);
+  const qs = params.size > 0 ? `?${params.toString()}` : "";
+  return projectPath(input.project, `/graph/divergences${qs}`);
+}
+function formatDivergenceLine(d) {
+  switch (d.type) {
+    case "missing-observed":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} (${d.edgeType}) \u2014 confidence ${d.confidence.toFixed(2)}`;
+    case "missing-extracted":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} (${d.edgeType}) \u2014 confidence ${d.confidence.toFixed(2)}`;
+    case "version-mismatch":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} \u2014 declared ${d.extractedVersion}, observed engine ${d.observedVersion} (${d.compatibility})`;
+    case "host-mismatch":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} \u2014 declared host ${d.extractedHost}, observed host ${d.observedHost}`;
+    case "compat-violation":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} \u2014 ${d.rule.kind}${d.rule.package ? ` (${d.rule.package})` : ""}`;
+  }
+}
+async function getDivergences(client2, input) {
+  try {
+    const result = await client2.get(buildDivergencesPath(input));
+    if (result.totalAffected === 0) {
+      return formatEmptyResponse(
+        "No divergences found between the declared (EXTRACTED) and observed (OBSERVED) views of the graph."
+      );
+    }
+    const headline = result.divergences[0];
+    const summary = `Found ${result.totalAffected} divergence${result.totalAffected === 1 ? "" : "s"} between code and production. Highest-confidence: ${headline.type} on ${headline.source} \u2192 ${headline.target}. ${headline.reason}`;
+    const blockLines = [];
+    for (const d of result.divergences) {
+      blockLines.push(formatDivergenceLine(d));
+      blockLines.push(`    reason: ${d.reason}`);
+      blockLines.push(`    recommendation: ${d.recommendation}`);
+    }
+    const maxConfidence = result.divergences.reduce(
+      (m, d) => Math.max(m, d.confidence),
+      0
+    );
+    return formatToolResponse({
+      summary,
+      block: blockLines.join("\n"),
+      confidence: maxConfidence,
+      // Composite provenance — divergences sit between EXTRACTED and
+      // OBSERVED by construction; that's what makes them divergences.
+      provenance: "composite (EXTRACTED + OBSERVED)"
+    });
+  } catch (err) {
+    return formatErrorResponse(`Error talking to neat-core: ${err.message}`);
+  }
+}
 async function postJson(client2, path, body) {
   const c = client2;
   if (typeof c.post !== "function") {
@@ -737,6 +796,19 @@ server.tool(
   },
   async (input) => getRecentStaleEdges(client, { ...input, project: projectFor(input) })
 );
+server.tool(
+  "get_divergences",
+  "Returns places where what the code declares (EXTRACTED) doesn't match what production observed (OBSERVED). The single most NEAT-shaped query \u2014 the one that justifies the whole graph. Use when the user asks 'is anything weird?' or 'what does production do that the code doesn't?' or 'find me a bug' on an unfamiliar codebase. Returns divergences ranked by confidence \xD7 severity. Prefer this over `get_root_cause` when no specific node is failing.",
+  {
+    type: import_zod.z.array(import_types3.DivergenceTypeSchema).optional().describe(
+      "Filter by divergence type. One or more of: missing-observed, missing-extracted, version-mismatch, host-mismatch, compat-violation. Omit for all."
+    ),
+    minConfidence: import_zod.z.number().min(0).max(1).optional().describe("Drop divergences below this confidence threshold (0.0 - 1.0)."),
+    node: import_zod.z.string().optional().describe("Scope to divergences involving this node id (as source or target)."),
+    project: projectField
+  },
+  async (input) => getDivergences(client, { ...input, project: projectFor(input) })
+);
 server.tool(
   "check_policies",
   "Inspect or dry-run the project's policy.json. Without hypotheticalAction, returns currently-recorded violations. With hypotheticalAction, returns violations that would result if the action were applied. Architectural assertions in five shapes (structural / compatibility / provenance / ownership / blast-radius).",

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/client.ts","../src/resources.ts","../src/tools.ts","../src/format.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js'\nimport { z } from 'zod'\nimport { CheckPoliciesScopeSchema, HypotheticalActionSchema } from '@neat.is/types'\nimport { createHttpClient } from './client.js'\nimport { registerResources } from './resources.js'\nimport {\n  checkPolicies,\n  getBlastRadius,\n  getDependencies,\n  getGraphDiff,\n  getIncidentHistory,\n  getObservedDependencies,\n  getRecentStaleEdges,\n  getRootCause,\n  semanticSearch,\n} from './tools.js'\n\nconst baseUrl = process.env.NEAT_CORE_URL ?? 'http://localhost:8080'\nconst client = createHttpClient(baseUrl)\n\n// `NEAT_DEFAULT_PROJECT` is the implicit project for tool calls that don't\n// pass a `project` arg. Unset means \"use the core's `default` project\" — we\n// route those calls through the legacy unprefixed URL so an older core (one\n// that predates #83) still gets the request it expects.\nconst defaultProject = process.env.NEAT_DEFAULT_PROJECT\nconst projectFor = (input: { project?: string }): string | undefined =>\n  input.project ?? defaultProject\n\nconst projectField = z\n  .string()\n  .optional()\n  .describe(\n    'Project name when the core hosts more than one (set NEAT_PROJECTS=...). Omit to use the default project.',\n  )\n\nconst server = new McpServer({\n  name: 'neat',\n  version: '0.1.0',\n})\n\nserver.tool(\n  'get_root_cause',\n  'Trace a failing node up its dependency graph to find the underlying cause. Use this when something is breaking and you want to know which upstream component is the actual culprit.',\n  {\n    errorNode: z\n      .string()\n      .describe('Graph node id where the error surfaced, e.g. \"database:payments-db\"'),\n    errorId: z\n      .string()\n      .optional()\n      .describe('Specific error event id from incident history; if set, the result is coloured with that error message'),\n    project: projectField,\n  },\n  async (input) => getRootCause(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_blast_radius',\n  'List every node downstream of the given node — what would break if this node failed or was redeployed.',\n  {\n    nodeId: z.string().describe('Graph node id to compute blast radius from'),\n    depth: z\n      .number()\n      .int()\n      .nonnegative()\n      .max(20)\n      .optional()\n      .describe('Max BFS depth (default 10)'),\n    project: projectField,\n  },\n  async (input) => getBlastRadius(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_dependencies',\n  'List the transitive outgoing dependencies of a node, BFS to depth N (default 3, max 10). Each result carries distance, edge type, and provenance — both static (EXTRACTED) and runtime (OBSERVED). Pass depth=1 for direct-only.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    depth: z\n      .number()\n      .int()\n      .min(1)\n      .max(10)\n      .optional()\n      .describe('BFS depth (default 3, max 10). depth=1 returns direct dependencies only.'),\n    project: projectField,\n  },\n  async (input) => getDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_observed_dependencies',\n  'List only the runtime (OBSERVED via OTel) outgoing dependencies of a node. Use this to compare what code SAYS the service depends on vs what production actually does.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    project: projectField,\n  },\n  async (input) => getObservedDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_incident_history',\n  'Return recent OTel error events recorded against a node, most recent first.',\n  {\n    nodeId: z.string().describe('Graph node id to query'),\n    limit: z.number().int().positive().max(100).optional().describe('Max events to return (default 20)'),\n    project: projectField,\n  },\n  async (input) => getIncidentHistory(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'semantic_search',\n  'Search nodes by natural-language query. Uses embedding vectors when an embedder is available (Ollama nomic-embed-text → in-process MiniLM → substring fallback) — phrase the query the way you would describe what you want.',\n  {\n    query: z.string().describe('Free-text query, e.g. \"service handling checkout payments\"'),\n    project: projectField,\n  },\n  async (input) => semanticSearch(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_graph_diff',\n  'Diff a saved graph snapshot against the current live graph. Useful for change reviews and post-incidents — answers \"what changed in the architecture between then and now.\" Returns added/removed/changed nodes and edges with both snapshot timestamps.',\n  {\n    againstSnapshot: z\n      .string()\n      .describe(\n        'Path or http(s) URL of the snapshot to diff against (the \"before\" state). The current graph is the \"after\".',\n      ),\n    project: projectField,\n  },\n  async (input) => getGraphDiff(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_recent_stale_edges',\n  'List the most recent OBSERVED → STALE edge transitions. Use this to spot integrations that have gone quiet — a CALLS edge that just went stale typically means an upstream stopped calling, not that the link is healthy.',\n  {\n    limit: z\n      .number()\n      .int()\n      .positive()\n      .max(200)\n      .optional()\n      .describe('Max events to return (default 50)'),\n    edgeType: z\n      .string()\n      .optional()\n      .describe('Filter by edge type — e.g. \"CALLS\" or \"CONNECTS_TO\"'),\n    project: projectField,\n  },\n  async (input) => getRecentStaleEdges(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'check_policies',\n  'Inspect or dry-run the project\\'s policy.json. Without hypotheticalAction, returns currently-recorded violations. With hypotheticalAction, returns violations that would result if the action were applied. Architectural assertions in five shapes (structural / compatibility / provenance / ownership / blast-radius).',\n  {\n    scope: CheckPoliciesScopeSchema.optional().describe(\n      'Narrow to a subset. Default \"all\".',\n    ),\n    hypotheticalAction: HypotheticalActionSchema.optional().describe(\n      'Dry-run mode: simulate the action and return resulting violations. Omit for current state.',\n    ),\n    project: projectField,\n  },\n  async (input) =>\n    checkPolicies(client, {\n      ...input,\n      project: projectFor(input),\n    } as Parameters<typeof checkPolicies>[1]),\n)\n\n// Resources sit alongside tools — same data, different access pattern. Read\n// the per-node resource for raw attrs+edges JSON; subscribe to the incidents\n// resource to be notified when new errors land. The eight tools above are\n// unchanged.\nconst incidentsPollMs = process.env.NEAT_RESOURCE_POLL_MS\n  ? Number(process.env.NEAT_RESOURCE_POLL_MS)\n  : undefined\nconst resourceRegistration = registerResources(server, client, {\n  ...(incidentsPollMs !== undefined ? { incidentsPollMs } : {}),\n  ...(defaultProject ? { project: defaultProject } : {}),\n})\n\nasync function main(): Promise<void> {\n  const transport = new StdioServerTransport()\n  await server.connect(transport)\n}\n\nconst stopPolling = (): void => {\n  resourceRegistration.stop()\n}\nprocess.on('SIGTERM', stopPolling)\nprocess.on('SIGINT', stopPolling)\n\nmain().catch((err) => {\n  console.error(err)\n  process.exit(1)\n})\n","// Thin HTTP client for the neat-core REST surface. Tools call out via this\n// instead of fetch() directly so tests can swap in a stub implementation\n// without monkey-patching globals.\n\nexport interface HttpClient {\n  get<T>(path: string): Promise<T>\n  // POST is optional on the interface so test stubs that only need GET don't\n  // have to implement it. Production createHttpClient always provides it.\n  post?<T>(path: string, body: unknown): Promise<T>\n}\n\nexport function createHttpClient(baseUrl: string): HttpClient {\n  const root = baseUrl.replace(/\\/$/, '')\n  return {\n    async get<T>(path: string): Promise<T> {\n      const res = await fetch(`${root}${path}`)\n      if (!res.ok) {\n        const body = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on GET ${path}: ${body}`)\n      }\n      return (await res.json()) as T\n    },\n    async post<T>(path: string, body: unknown): Promise<T> {\n      const res = await fetch(`${root}${path}`, {\n        method: 'POST',\n        headers: { 'content-type': 'application/json' },\n        body: JSON.stringify(body),\n      })\n      if (!res.ok) {\n        const text = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on POST ${path}: ${text}`)\n      }\n      return (await res.json()) as T\n    },\n  }\n}\n\nexport class HttpError extends Error {\n  constructor(\n    public readonly status: number,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'HttpError'\n  }\n}\n","// MCP Resources — additive surface alongside the eight tools. Two resources:\n//\n//   neat://node/<id>          — one resource per graph node. Read returns the\n//                                node attributes plus its outbound edges.\n//   neat://incidents/recent   — most recent error events. Pollable by the SDK\n//                                via subscribe; we send `notifications/resources/\n//                                updated` when /incidents grows.\n//\n// Pure read helpers are exported so tests can exercise them without spinning up\n// an MCP transport. `registerResources()` does the SDK wiring + the poll loop.\n\nimport type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport {\n  ResourceTemplate,\n} from '@modelcontextprotocol/sdk/server/mcp.js'\nimport type {\n  ListResourcesResult,\n  ReadResourceResult,\n} from '@modelcontextprotocol/sdk/types.js'\nimport type { ErrorEvent, GraphEdge, GraphNode, PolicyViolation } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\ninterface SerializedGraph {\n  nodes: GraphNode[]\n  edges: GraphEdge[]\n}\n\nconst NODE_RESOURCE_MIME = 'application/json'\nconst INCIDENTS_URI = 'neat://incidents/recent'\nconst INCIDENTS_DEFAULT_LIMIT = 50\nconst POLICY_VIOLATIONS_URI = 'neat://policies/violations'\nconst POLICY_VIOLATIONS_DEFAULT_LIMIT = 100\n\nfunction nodeUri(id: string): string {\n  // Node ids contain `:` which RFC 6570 percent-encodes; doing it explicitly\n  // here keeps the URI we hand the SDK identical to what `list` produces.\n  return `neat://node/${encodeURIComponent(id)}`\n}\n\n// Project-aware URL prefix for the underlying core. When unset, hit the\n// legacy unprefixed routes (which the core resolves to project=`default`).\nfunction corePrefix(project: string | undefined): string {\n  return project ? `/projects/${encodeURIComponent(project)}` : ''\n}\n\nfunction nameFromAttrs(attrs: GraphNode): string {\n  return (attrs as { name?: string }).name ?? attrs.id\n}\n\nexport async function listNodeResources(\n  client: HttpClient,\n  project?: string,\n): Promise<ListResourcesResult> {\n  const graph = await client.get<SerializedGraph>(`${corePrefix(project)}/graph`)\n  return {\n    resources: graph.nodes.map((n) => ({\n      uri: nodeUri(n.id),\n      name: nameFromAttrs(n),\n      description: `${n.type} — ${nameFromAttrs(n)}`,\n      mimeType: NODE_RESOURCE_MIME,\n    })),\n  }\n}\n\nexport async function readNodeResource(\n  client: HttpClient,\n  id: string,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const uri = nodeUri(id)\n  const prefix = corePrefix(project)\n  try {\n    const [attrs, edges] = await Promise.all([\n      client.get<GraphNode>(`${prefix}/graph/node/${encodeURIComponent(id)}`),\n      client.get<EdgesResponse>(`${prefix}/graph/edges/${encodeURIComponent(id)}`),\n    ])\n    const body = {\n      node: attrs,\n      // Outbound only — the issue spec says \"attrs + outbound edges\". Inbound\n      // edges are still reachable via the other endpoint and would double the\n      // payload for hub nodes (e.g. a shared database).\n      outboundEdges: edges.outbound,\n    }\n    return {\n      contents: [\n        {\n          uri,\n          mimeType: NODE_RESOURCE_MIME,\n          text: JSON.stringify(body, null, 2),\n        },\n      ],\n    }\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return {\n        contents: [\n          {\n            uri,\n            mimeType: NODE_RESOURCE_MIME,\n            text: JSON.stringify({ error: 'node not found', id }),\n          },\n        ],\n      }\n    }\n    throw err\n  }\n}\n\nexport async function readPolicyViolationsResource(\n  client: HttpClient,\n  limit: number = POLICY_VIOLATIONS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const violations = await client.get<PolicyViolation[]>(\n    `${corePrefix(project)}/policies/violations`,\n  )\n  // Latest first; cap at limit so an exploding violations log doesn't blow\n  // up the resource read. The full file is still on disk for forensic use.\n  const ordered = [...violations].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: POLICY_VIOLATIONS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: violations.length, violations: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\nexport async function readRecentIncidentsResource(\n  client: HttpClient,\n  limit: number = INCIDENTS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n  // ndjson order is append-time = oldest first. Reverse so most-recent leads.\n  const ordered = [...events].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: INCIDENTS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: events.length, events: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\n// Pure helper so the poll loop can be tested without timers. Returns true when\n// the visible state of /incidents has changed in a way subscribers should hear\n// about. Compares total count + the id of the newest event — either is enough\n// on its own, but the pair makes deletes (if they ever happen) survive a\n// missed update.\nexport function incidentsChanged(\n  prev: { total: number; lastId?: string } | null,\n  next: { total: number; lastId?: string },\n): boolean {\n  if (!prev) return false // first observation seeds, doesn't notify\n  if (prev.total !== next.total) return true\n  if (prev.lastId !== next.lastId) return true\n  return false\n}\n\nexport interface RegisterResourcesOptions {\n  // Poll interval for /incidents in ms. 5s by default; 0 disables polling.\n  incidentsPollMs?: number\n  // Project this MCP instance reports against. Unset → core's `default`\n  // project via the legacy unprefixed URLs.\n  project?: string\n}\n\nexport interface ResourceRegistration {\n  // Stops the poll loop. The SDK keeps the registered resources around as\n  // long as the server is alive — calling stop() doesn't unregister them.\n  stop: () => void\n}\n\nexport function registerResources(\n  server: McpServer,\n  client: HttpClient,\n  options: RegisterResourcesOptions = {},\n): ResourceRegistration {\n  const pollMs = options.incidentsPollMs ?? 5000\n  const project = options.project\n\n  // neat://node/<id> — templated. The list callback enumerates current nodes;\n  // the read callback resolves a specific id.\n  server.registerResource(\n    'graph-node',\n    new ResourceTemplate('neat://node/{id}', {\n      list: async () => listNodeResources(client, project),\n    }),\n    {\n      description:\n        'A single graph node by id. Reading returns the node attributes plus its outbound edges as JSON.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async (_uri, variables) => {\n      const raw = variables.id\n      const id = Array.isArray(raw) ? raw[0] : raw\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new Error('neat://node/{id} requires an id')\n      }\n      const decoded = id.includes('%') ? decodeURIComponent(id) : id\n      return readNodeResource(client, decoded, project)\n    },\n  )\n\n  // neat://incidents/recent — static. Subscribers get notifications/resources/\n  // updated on each tick where /incidents has changed.\n  server.registerResource(\n    'incidents-recent',\n    INCIDENTS_URI,\n    {\n      description:\n        'Most recent error events recorded by neat-core, newest first. JSON: { count, total, events[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readRecentIncidentsResource(client, INCIDENTS_DEFAULT_LIMIT, project),\n  )\n\n  // neat://policies/violations — static. Same poll-and-notify pattern as\n  // incidents. Subscribers get resource-updated notifications when the\n  // policy-violations.ndjson grows. ADR-045.\n  server.registerResource(\n    'policies-violations',\n    POLICY_VIOLATIONS_URI,\n    {\n      description:\n        'Current policy violations from policy-violations.ndjson, newest first. JSON: { count, total, violations[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readPolicyViolationsResource(client, POLICY_VIOLATIONS_DEFAULT_LIMIT, project),\n  )\n\n  let stopped = false\n  let timer: NodeJS.Timeout | null = null\n  let lastIncidents: { total: number; lastId?: string } | null = null\n  let lastViolations: { total: number; lastId?: string } | null = null\n\n  const tick = async (): Promise<void> => {\n    if (stopped) return\n    // Incidents poll.\n    try {\n      const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n      const next = {\n        total: events.length,\n        lastId: events.length > 0 ? events[events.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastIncidents, next)) {\n        await server.server.sendResourceUpdated({ uri: INCIDENTS_URI }).catch(() => {})\n      }\n      lastIncidents = next\n    } catch {\n      // Core down — keep polling, next tick will catch up.\n    }\n    // Policy-violations poll. Fires the alert action's notifications/\n    // resources/updated for neat://policies/violations subscribers per\n    // ADR-044 §alert. Same change-detection shape as incidents.\n    try {\n      const violations = await client.get<PolicyViolation[]>(\n        `${corePrefix(project)}/policies/violations`,\n      )\n      const next = {\n        total: violations.length,\n        lastId:\n          violations.length > 0 ? violations[violations.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastViolations, next)) {\n        await server.server\n          .sendResourceUpdated({ uri: POLICY_VIOLATIONS_URI })\n          .catch(() => {})\n      }\n      lastViolations = next\n    } catch {\n      // Core down or no policies yet — keep polling.\n    }\n  }\n\n  if (pollMs > 0) {\n    // Seed `last` on first tick so we don't fire an \"updated\" notification\n    // when the server first comes up.\n    timer = setInterval(() => {\n      void tick()\n    }, pollMs)\n    if (typeof timer.unref === 'function') timer.unref()\n  }\n\n  return {\n    stop: (): void => {\n      stopped = true\n      if (timer) clearInterval(timer)\n      timer = null\n    },\n  }\n}\n","// Tool implementations. Each one takes an HttpClient + the validated input and\n// returns an MCP CallToolResult routed through formatToolResponse for the\n// three-part shape (NL + structured + footer) per ADR-039 / contract #12.\n// Keeping these as pure functions of (client, input) means tests don't need a\n// running server — just a stub client that returns canned JSON.\n\nimport type {\n  BlastRadiusAffectedNode,\n  BlastRadiusResult,\n  ErrorEvent,\n  GraphEdge,\n  GraphNode,\n  HypotheticalAction,\n  PolicyViolation,\n  RootCauseResult,\n  TransitiveDependenciesResult,\n} from '@neat.is/types'\nimport { Provenance } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\nimport {\n  formatEmptyResponse,\n  formatErrorResponse,\n  formatToolResponse,\n  type ToolResponse,\n} from './format.js'\n\nexport type { ToolResponse } from './format.js'\n\n// Project-aware path builder. When `project` is set, route through\n// /projects/<name>/...; otherwise hit the legacy root URL (which the core\n// resolves to project=`default`). Keeping the legacy path means callers\n// running an older core still talk to a known route.\nfunction projectPath(project: string | undefined, suffix: string): string {\n  if (!project) return suffix\n  return `/projects/${encodeURIComponent(project)}${suffix}`\n}\n\n// Most tools want \"node missing → friendly message, anything else → real error\".\nasync function withMissingNodeFallback(\n  fn: () => Promise<ToolResponse>,\n  notFoundMessage: string,\n): Promise<ToolResponse> {\n  try {\n    return await fn()\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return formatEmptyResponse(notFoundMessage)\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface RootCauseInput {\n  errorNode: string\n  errorId?: string\n  project?: string\n}\n\nexport async function getRootCause(client: HttpClient, input: RootCauseInput): Promise<ToolResponse> {\n  const qs = input.errorId ? `?errorId=${encodeURIComponent(input.errorId)}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/root-cause/${encodeURIComponent(input.errorNode)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<RootCauseResult>(path)\n    const arrowPath = result.traversalPath.join(' ← ')\n    const provenances = result.edgeProvenances.length\n      ? result.edgeProvenances.join(', ')\n      : '(direct, no edges traversed)'\n    const summary =\n      `Root cause for ${input.errorNode} is ${result.rootCauseNode}. ` +\n      result.rootCauseReason +\n      (result.fixRecommendation ? ` Recommended fix: ${result.fixRecommendation}.` : '')\n    const blockLines = [\n      `Traversal path: ${arrowPath}`,\n      `Edge provenances: ${provenances}`,\n    ]\n    if (result.fixRecommendation) {\n      blockLines.push(`Recommended fix: ${result.fixRecommendation}`)\n    }\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      confidence: result.confidence,\n      provenance: result.edgeProvenances.length ? result.edgeProvenances : undefined,\n    })\n  }, `No root cause found for ${input.errorNode}. The node may be healthy, or it may not exist in the graph.`)\n}\n\nexport interface BlastRadiusInput {\n  nodeId: string\n  depth?: number\n  project?: string\n}\n\nexport async function getBlastRadius(\n  client: HttpClient,\n  input: BlastRadiusInput,\n): Promise<ToolResponse> {\n  const qs = input.depth !== undefined ? `?depth=${input.depth}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/blast-radius/${encodeURIComponent(input.nodeId)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<BlastRadiusResult>(path)\n    if (result.totalAffected === 0) {\n      return formatEmptyResponse(\n        `${result.origin} has no downstream dependencies. Nothing else would break if it failed.`,\n      )\n    }\n    const sorted = [...result.affectedNodes].sort(\n      (a, b) => a.distance - b.distance || a.nodeId.localeCompare(b.nodeId),\n    )\n    const blockLines = sorted.map(formatBlastEntry)\n    // Worst-case confidence — the path with the lowest cascaded confidence\n    // is the headline number; agents should treat this as \"what's the\n    // weakest reachability NEAT actually knows about?\"\n    const minConfidence = sorted.reduce(\n      (m, n) => Math.min(m, n.confidence),\n      Number.POSITIVE_INFINITY,\n    )\n    const provenances = [...new Set(sorted.map((n) => n.edgeProvenance))]\n    return formatToolResponse({\n      summary: `Blast radius for ${result.origin}: ${result.totalAffected} affected node${result.totalAffected === 1 ? '' : 's'} reachable downstream.`,\n      block: blockLines.join('\\n'),\n      confidence: Number.isFinite(minConfidence) ? minConfidence : undefined,\n      provenance: provenances.length ? provenances : undefined,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction formatBlastEntry(n: BlastRadiusAffectedNode): string {\n  const tag = n.edgeProvenance === Provenance.STALE ? ' [STALE — last seen too long ago]' : ''\n  return `  • ${n.nodeId} (distance ${n.distance}, ${n.edgeProvenance})${tag}`\n}\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\nexport interface DependenciesInput {\n  nodeId: string\n  // BFS depth. Default 3; max 10. Direct-only consumers pass 1.\n  depth?: number\n  project?: string\n}\n\n// Transitive get_dependencies (issue #144). Calls the new core endpoint\n// /graph/node/:id/dependencies?depth=N which BFS-walks outbound. The output\n// groups results by hop so direct dependencies stand out from transitives —\n// agents asked \"what does X depend on?\" usually want the direct list with\n// transitives as context.\nexport async function getDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  const depth = input.depth ?? 3\n  const path = projectPath(\n    input.project,\n    `/graph/node/${encodeURIComponent(input.nodeId)}/dependencies?depth=${depth}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<TransitiveDependenciesResult>(path)\n    if (result.total === 0) {\n      return formatEmptyResponse(\n        depth === 1\n          ? `${input.nodeId} has no direct dependencies in the graph.`\n          : `${input.nodeId} has no dependencies (BFS to depth ${depth}).`,\n      )\n    }\n    // Group by distance so the structured block reads as concentric rings.\n    const byDistance = new Map<number, typeof result.dependencies>()\n    for (const dep of result.dependencies) {\n      const ring = byDistance.get(dep.distance) ?? []\n      ring.push(dep)\n      byDistance.set(dep.distance, ring)\n    }\n    const blockLines: string[] = []\n    for (const distance of [...byDistance.keys()].sort((a, b) => a - b)) {\n      const label = distance === 1 ? 'Direct (distance 1)' : `Distance ${distance}`\n      blockLines.push(`${label}:`)\n      for (const dep of byDistance.get(distance)!) {\n        blockLines.push(`  • ${dep.nodeId} — ${dep.edgeType} (${dep.provenance})`)\n      }\n    }\n    const provenances = [...new Set(result.dependencies.map((d) => d.provenance))]\n    const directCount = byDistance.get(1)?.length ?? 0\n    const summary =\n      depth === 1\n        ? `${input.nodeId} has ${directCount} direct dependenc${directCount === 1 ? 'y' : 'ies'}.`\n        : `${input.nodeId} has ${result.total} dependenc${result.total === 1 ? 'y' : 'ies'} reachable to depth ${depth} (${directCount} direct).`\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      provenance: provenances,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport async function getObservedDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const edges = await client.get<EdgesResponse>(\n      projectPath(input.project, `/graph/edges/${encodeURIComponent(input.nodeId)}`),\n    )\n    const observed = edges.outbound.filter((e) => e.provenance === Provenance.OBSERVED)\n    if (observed.length === 0) {\n      const hasExtracted = edges.outbound.some((e) => e.provenance === Provenance.EXTRACTED)\n      const note = hasExtracted\n        ? ' Static (EXTRACTED) dependencies exist but no runtime traffic has been seen — is OTel running?'\n        : ''\n      return formatEmptyResponse(`No OBSERVED dependencies for ${input.nodeId}.${note}`)\n    }\n    const blockLines = observed.map((e) => `  • ${e.target} — ${e.type}${edgeMeta(e)}`)\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${observed.length} runtime dependenc${observed.length === 1 ? 'y' : 'ies'} confirmed by OTel.`,\n      block: blockLines.join('\\n'),\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction edgeMeta(e: GraphEdge): string {\n  const bits: string[] = []\n  if (e.signal) {\n    // Prefer the runtime signal numbers — \"saw 1,247 calls, 3 errors\" reads\n    // better than a derived 0.94 confidence.\n    bits.push(`spans=${e.signal.spanCount}`)\n    if (e.signal.errorCount > 0) bits.push(`errors=${e.signal.errorCount}`)\n    if (e.signal.lastObservedAgeMs !== undefined) {\n      bits.push(`age=${formatDuration(e.signal.lastObservedAgeMs)}`)\n    }\n  } else if (e.callCount !== undefined) {\n    bits.push(`callCount=${e.callCount}`)\n  }\n  if (e.lastObserved) bits.push(`lastObserved=${e.lastObserved}`)\n  if (e.confidence !== undefined) bits.push(`confidence=${e.confidence}`)\n  return bits.length ? ` [${bits.join(', ')}]` : ''\n}\n\nfunction formatDuration(ms: number): string {\n  if (ms < 1000) return `${Math.round(ms)}ms`\n  const s = Math.round(ms / 1000)\n  if (s < 60) return `${s}s`\n  const m = Math.round(s / 60)\n  if (m < 60) return `${m}m`\n  const h = Math.round(m / 60)\n  if (h < 48) return `${h}h`\n  return `${Math.round(h / 24)}d`\n}\n\nexport interface IncidentHistoryInput {\n  nodeId: string\n  limit?: number\n  project?: string\n}\n\nexport async function getIncidentHistory(\n  client: HttpClient,\n  input: IncidentHistoryInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const events = await client.get<ErrorEvent[]>(\n      projectPath(input.project, `/incidents/${encodeURIComponent(input.nodeId)}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(`No incidents recorded against ${input.nodeId}.`)\n    }\n    // ndjson order is append-time = oldest first. Reverse so the most recent\n    // event leads, then trim to the requested limit.\n    const ordered = [...events].reverse().slice(0, input.limit ?? 20)\n    const blockLines: string[] = []\n    for (const ev of ordered) {\n      blockLines.push(`  ${ev.timestamp} — ${ev.service}: ${ev.errorMessage}`)\n      blockLines.push(`    trace=${ev.traceId} span=${ev.spanId}`)\n    }\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${events.length} recorded incident${events.length === 1 ? '' : 's'}; showing the ${ordered.length} most recent.`,\n      block: blockLines.join('\\n'),\n      // ErrorEvents are observation records, not graph edges — provenance is\n      // OBSERVED by definition (the OTel span happened).\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport interface SemanticSearchInput {\n  query: string\n  project?: string\n}\n\ninterface SearchResponse {\n  query: string\n  provider?: 'ollama' | 'transformers' | 'substring'\n  matches: (GraphNode & { score?: number })[]\n}\n\nexport async function semanticSearch(\n  client: HttpClient,\n  input: SemanticSearchInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<SearchResponse>(\n      projectPath(input.project, `/search?q=${encodeURIComponent(input.query)}`),\n    )\n    if (result.matches.length === 0) {\n      return formatEmptyResponse(`No matches for \"${input.query}\".`)\n    }\n    const provider = result.provider ?? 'substring'\n    const blockLines: string[] = []\n    let topScore: number | undefined\n    for (const n of result.matches) {\n      // Embedding tiers attach a cosine score in [0,1]; substring fallback\n      // doesn't, so we elide the score when it's the placeholder 1.\n      const score = provider !== 'substring' && typeof n.score === 'number' ? n.score : undefined\n      const scoreBit = score !== undefined ? ` [score=${score.toFixed(2)}]` : ''\n      if (score !== undefined && (topScore === undefined || score > topScore)) topScore = score\n      blockLines.push(\n        `  • ${n.id} (${n.type}) — ${(n as { name?: string }).name ?? n.id}${scoreBit}`,\n      )\n    }\n    return formatToolResponse({\n      summary: `Found ${result.matches.length} match${result.matches.length === 1 ? '' : 'es'} for \"${input.query}\" via ${provider} provider.`,\n      block: blockLines.join('\\n'),\n      // Top similarity score doubles as a \"how confident is the embedder\n      // about the best match\" signal. Substring provider returns no score —\n      // the footer shows n/a in that case.\n      confidence: topScore,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface GraphDiffInput {\n  againstSnapshot: string\n  project?: string\n}\n\ninterface GraphDiffResponse {\n  base: { exportedAt?: string }\n  current: { exportedAt: string }\n  added: { nodes: GraphNode[]; edges: GraphEdge[] }\n  removed: { nodes: GraphNode[]; edges: GraphEdge[] }\n  changed: {\n    nodes: { id: string; before: GraphNode; after: GraphNode }[]\n    edges: { id: string; before: GraphEdge; after: GraphEdge }[]\n  }\n}\n\nexport async function getGraphDiff(\n  client: HttpClient,\n  input: GraphDiffInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<GraphDiffResponse>(\n      projectPath(\n        input.project,\n        `/graph/diff?against=${encodeURIComponent(input.againstSnapshot)}`,\n      ),\n    )\n    const total =\n      result.added.nodes.length +\n      result.added.edges.length +\n      result.removed.nodes.length +\n      result.removed.edges.length +\n      result.changed.nodes.length +\n      result.changed.edges.length\n    const baseLabel = result.base.exportedAt ?? 'unknown'\n    if (total === 0) {\n      return formatEmptyResponse(\n        `No differences between the current graph and ${input.againstSnapshot} (base exportedAt=${baseLabel}).`,\n      )\n    }\n    const blockLines: string[] = [\n      `  base exportedAt:    ${baseLabel}`,\n      `  current exportedAt: ${result.current.exportedAt}`,\n      '',\n    ]\n    if (result.added.nodes.length || result.added.edges.length) {\n      blockLines.push('Added:')\n      for (const n of result.added.nodes) blockLines.push(`  + node ${n.id} (${n.type})`)\n      for (const e of result.added.edges)\n        blockLines.push(`  + edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.removed.nodes.length || result.removed.edges.length) {\n      blockLines.push('Removed:')\n      for (const n of result.removed.nodes) blockLines.push(`  - node ${n.id} (${n.type})`)\n      for (const e of result.removed.edges)\n        blockLines.push(`  - edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.changed.nodes.length || result.changed.edges.length) {\n      blockLines.push('Changed:')\n      for (const c of result.changed.nodes) {\n        blockLines.push(`  ~ node ${c.id} — ${summariseAttrDiff(c.before, c.after)}`)\n      }\n      for (const c of result.changed.edges) {\n        const provBit =\n          c.before.provenance !== c.after.provenance\n            ? `provenance ${c.before.provenance} → ${c.after.provenance}`\n            : summariseAttrDiff(c.before, c.after)\n        blockLines.push(`  ~ edge ${c.id} — ${provBit}`)\n      }\n    }\n    return formatToolResponse({\n      summary: `Diff against ${input.againstSnapshot}: ${total} change${total === 1 ? '' : 's'} between the snapshot and the live graph.`,\n      block: blockLines.join('\\n').trimEnd(),\n      // Diff results don't have a per-result provenance — the diff spans\n      // every edge type and provenance kind. Footer shows n/a.\n    })\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 400) {\n      return formatErrorResponse(\n        `Could not load snapshot ${input.againstSnapshot}: ${err.message}`,\n      )\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nfunction summariseAttrDiff(\n  before: Record<string, unknown>,\n  after: Record<string, unknown>,\n): string {\n  const keys = new Set([...Object.keys(before), ...Object.keys(after)])\n  const changed: string[] = []\n  for (const k of keys) {\n    if (JSON.stringify(before[k]) !== JSON.stringify(after[k])) changed.push(k)\n  }\n  return changed.length === 0\n    ? 'attributes differ'\n    : `fields changed: ${changed.sort().join(', ')}`\n}\n\nexport interface RecentStaleEdgesInput {\n  limit?: number\n  edgeType?: string\n  project?: string\n}\n\ninterface StaleEventResponse {\n  edgeId: string\n  source: string\n  target: string\n  edgeType: string\n  thresholdMs: number\n  ageMs: number\n  lastObserved: string\n  transitionedAt: string\n}\n\nexport async function getRecentStaleEdges(\n  client: HttpClient,\n  input: RecentStaleEdgesInput,\n): Promise<ToolResponse> {\n  const params = new URLSearchParams()\n  if (input.limit !== undefined) params.set('limit', String(input.limit))\n  if (input.edgeType) params.set('edgeType', input.edgeType)\n  const qs = params.size > 0 ? `?${params.toString()}` : ''\n\n  try {\n    const events = await client.get<StaleEventResponse[]>(\n      projectPath(input.project, `/incidents/stale${qs}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(\n        input.edgeType\n          ? `No stale ${input.edgeType} edges recorded.`\n          : 'No stale-edge transitions recorded yet.',\n      )\n    }\n    const blockLines = events.map(\n      (e) =>\n        `  ${e.transitionedAt} — ${e.source} -[${e.edgeType}]-> ${e.target}` +\n        ` (last seen ${e.lastObserved}, threshold ${formatDuration(e.thresholdMs)})`,\n    )\n    return formatToolResponse({\n      summary: `${events.length} stale-edge transition${events.length === 1 ? '' : 's'} recorded${input.edgeType ? ` for ${input.edgeType}` : ''}.`,\n      block: blockLines.join('\\n'),\n      // STALE by definition — every event is a transition into STALE.\n      provenance: Provenance.STALE,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface CheckPoliciesInput {\n  // 'all' (default) returns every current violation. 'unresolved' is reserved\n  // for future resolution tracking — for the MVP it behaves the same as 'all'.\n  // { policyId } narrows to violations of one named policy.\n  scope?: 'all' | 'unresolved' | { policyId: string }\n  // When provided, dry-run evaluation: return violations that *would* result\n  // if the action were applied. Without it, return current violations.\n  hypotheticalAction?: HypotheticalAction\n  project?: string\n}\n\ninterface PoliciesCheckResponse {\n  allowed: boolean\n  hypotheticalAction?: HypotheticalAction\n  violations: PolicyViolation[]\n}\n\n// check_policies — single MCP tool covering both state-read and dry-run modes\n// per ADR-045. The contract explicitly rejects the audit's two-tool split\n// (evaluate_policy + get_policy_violations); both modes route through here.\nexport async function checkPolicies(\n  client: HttpClient,\n  input: CheckPoliciesInput,\n): Promise<ToolResponse> {\n  try {\n    let violations: PolicyViolation[]\n    let allowed = true\n    let hypothetical: HypotheticalAction | undefined\n\n    if (input.hypotheticalAction) {\n      // Dry-run via POST /policies/check.\n      const body = await postJson<PoliciesCheckResponse>(\n        client,\n        projectPath(input.project, '/policies/check'),\n        { hypotheticalAction: input.hypotheticalAction },\n      )\n      violations = body.violations\n      allowed = body.allowed\n      hypothetical = body.hypotheticalAction\n    } else {\n      // State read via GET /policies/violations. Optional scope filters via\n      // ?policyId=, severity isn't surfaced in the tool input today.\n      const qsParams = new URLSearchParams()\n      if (typeof input.scope === 'object' && 'policyId' in input.scope) {\n        qsParams.set('policyId', input.scope.policyId)\n      }\n      const qs = qsParams.size > 0 ? `?${qsParams.toString()}` : ''\n      violations = await client.get<PolicyViolation[]>(\n        projectPath(input.project, `/policies/violations${qs}`),\n      )\n      allowed = violations.every((v) => v.onViolation !== 'block')\n    }\n\n    if (violations.length === 0) {\n      return formatEmptyResponse(\n        hypothetical\n          ? `No violations would result from the hypothetical action (${hypothetical.kind}).`\n          : 'No policy violations recorded.',\n      )\n    }\n\n    const blockCount = violations.filter((v) => v.onViolation === 'block').length\n    const summaryParts: string[] = []\n    if (hypothetical) {\n      summaryParts.push(\n        `Hypothetical ${hypothetical.kind} would surface ${violations.length} violation${violations.length === 1 ? '' : 's'}`,\n      )\n    } else {\n      summaryParts.push(\n        `${violations.length} policy violation${violations.length === 1 ? '' : 's'} currently recorded`,\n      )\n    }\n    if (blockCount > 0) {\n      summaryParts.push(`${blockCount} of which block`)\n    }\n    if (!allowed && hypothetical) {\n      summaryParts.push('action denied')\n    }\n    const summary = summaryParts.join('; ') + '.'\n\n    const blockLines = violations.map((v) => {\n      const subject = v.subject.nodeId ?? v.subject.edgeId ?? v.subject.path?.[0] ?? '(global)'\n      return `  • [${v.severity}/${v.onViolation}] ${v.policyName}: ${v.message} — ${subject}`\n    })\n    const severities = [...new Set(violations.map((v) => v.severity))]\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      // Confidence: hypothetical results inherit a 0.7 cap (the engine\n      // can't fully simulate every action shape in MVP); confirmed\n      // violations report 1.00 since the engine ran against current state.\n      confidence: hypothetical ? 0.7 : 1,\n      provenance: severities.join(' '),\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nasync function postJson<T>(\n  client: HttpClient,\n  path: string,\n  body: unknown,\n): Promise<T> {\n  // The base HttpClient interface only exposes get(). For POST we need to\n  // reach into the underlying transport. Most callers pass the client built\n  // by createHttpClient which has post; types are kept minimal so test\n  // stubs don't have to implement post unless the tool needs it.\n  const c = client as HttpClient & { post?: <U>(p: string, b: unknown) => Promise<U> }\n  if (typeof c.post !== 'function') {\n    throw new Error('HttpClient does not support POST — required for check_policies dry-run')\n  }\n  return c.post<T>(path, body)\n}\n","// Standardized three-part response format for every MCP tool (ADR-039,\n// issue #143). Output shape:\n//\n//   {summary — NL paragraph: what was found, why it matters}\n//\n//   {block — typed payload, formatted}\n//\n//   confidence: 0.94 · provenance: OBSERVED\n//\n// Empty result → footer reads \"confidence: n/a · provenance: n/a\". Every tool\n// in packages/mcp/src/tools.ts routes through this helper so consumers get a\n// consistent shape — agents can pattern-match on the footer to know how much\n// to trust the answer.\n\nexport interface ToolResponse {\n  [x: string]: unknown\n  content: { type: 'text'; text: string }[]\n  isError?: boolean\n}\n\nexport interface FormatToolResponseInput {\n  // NL paragraph. One or two sentences. What was found and why it matters.\n  summary: string\n  // Structured block. The formatted typed payload — usually a bullet list,\n  // sometimes a multi-section breakdown. May be empty when the summary\n  // already conveys everything.\n  block?: string\n  // Per-result confidence in [0, 1]. Undefined → footer reads \"n/a\".\n  confidence?: number\n  // Per-result provenance. Single value, or an array if the result spans\n  // mixed provenances (e.g. a path of OBSERVED + EXTRACTED edges). Undefined\n  // → footer reads \"n/a\".\n  provenance?: string | string[]\n  // Set on transport / 5xx errors. Routes through ToolResponse.isError so\n  // MCP clients can surface a non-\"normal\" return.\n  isError?: boolean\n}\n\nfunction formatFooter(\n  confidence: number | undefined,\n  provenance: string | string[] | undefined,\n): string {\n  const c = confidence === undefined ? 'n/a' : confidence.toFixed(2)\n  const p =\n    provenance === undefined\n      ? 'n/a'\n      : Array.isArray(provenance)\n        ? [...new Set(provenance)].join(', ')\n        : provenance\n  return `confidence: ${c} · provenance: ${p}`\n}\n\nexport function formatToolResponse(input: FormatToolResponseInput): ToolResponse {\n  const sections: string[] = [input.summary.trim()]\n  if (input.block && input.block.trim().length > 0) {\n    sections.push(input.block.trimEnd())\n  }\n  sections.push(formatFooter(input.confidence, input.provenance))\n  const text = sections.join('\\n\\n')\n  return {\n    content: [{ type: 'text', text }],\n    ...(input.isError ? { isError: true } : {}),\n  }\n}\n\n// Convenience for the \"node not found / empty graph\" path. Keeps the\n// three-part shape (summary still landed) but sets the footer to n/a / n/a\n// since there's nothing to confidence-tag or provenance-tag.\nexport function formatEmptyResponse(summary: string): ToolResponse {\n  return formatToolResponse({ summary })\n}\n\n// Convenience for transport / 5xx errors at the MCP boundary. isError set\n// so MCP clients route the response into their error path.\nexport function formatErrorResponse(message: string): ToolResponse {\n  return formatToolResponse({ summary: message, isError: true })\n}\n"],"mappings":";;;;AAEA,IAAAA,cAA0B;AAC1B,mBAAqC;AACrC,iBAAkB;AAClB,IAAAC,gBAAmE;;;ACM5D,SAAS,iBAAiBC,UAA6B;AAC5D,QAAM,OAAOA,SAAQ,QAAQ,OAAO,EAAE;AACtC,SAAO;AAAA,IACL,MAAM,IAAO,MAA0B;AACrC,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,EAAE;AACxC,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,WAAW,IAAI,KAAK,IAAI,EAAE;AAAA,MAC3F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,IACA,MAAM,KAAQ,MAAc,MAA2B;AACrD,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,IAAI;AAAA,QACxC,QAAQ;AAAA,QACR,SAAS,EAAE,gBAAgB,mBAAmB;AAAA,QAC9C,MAAM,KAAK,UAAU,IAAI;AAAA,MAC3B,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,YAAY,IAAI,KAAK,IAAI,EAAE;AAAA,MAC5F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,EACF;AACF;AAEO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACkB,QAChB,SACA;AACA,UAAM,OAAO;AAHG;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;;;ACjCA,iBAEO;AAkBP,IAAM,qBAAqB;AAC3B,IAAM,gBAAgB;AACtB,IAAM,0BAA0B;AAChC,IAAM,wBAAwB;AAC9B,IAAM,kCAAkC;AAExC,SAAS,QAAQ,IAAoB;AAGnC,SAAO,eAAe,mBAAmB,EAAE,CAAC;AAC9C;AAIA,SAAS,WAAW,SAAqC;AACvD,SAAO,UAAU,aAAa,mBAAmB,OAAO,CAAC,KAAK;AAChE;AAEA,SAAS,cAAc,OAA0B;AAC/C,SAAQ,MAA4B,QAAQ,MAAM;AACpD;AAEA,eAAsB,kBACpBC,SACA,SAC8B;AAC9B,QAAM,QAAQ,MAAMA,QAAO,IAAqB,GAAG,WAAW,OAAO,CAAC,QAAQ;AAC9E,SAAO;AAAA,IACL,WAAW,MAAM,MAAM,IAAI,CAAC,OAAO;AAAA,MACjC,KAAK,QAAQ,EAAE,EAAE;AAAA,MACjB,MAAM,cAAc,CAAC;AAAA,MACrB,aAAa,GAAG,EAAE,IAAI,WAAM,cAAc,CAAC,CAAC;AAAA,MAC5C,UAAU;AAAA,IACZ,EAAE;AAAA,EACJ;AACF;AAEA,eAAsB,iBACpBA,SACA,IACA,SAC6B;AAC7B,QAAM,MAAM,QAAQ,EAAE;AACtB,QAAM,SAAS,WAAW,OAAO;AACjC,MAAI;AACF,UAAM,CAAC,OAAO,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,MACvCA,QAAO,IAAe,GAAG,MAAM,eAAe,mBAAmB,EAAE,CAAC,EAAE;AAAA,MACtEA,QAAO,IAAmB,GAAG,MAAM,gBAAgB,mBAAmB,EAAE,CAAC,EAAE;AAAA,IAC7E,CAAC;AACD,UAAM,OAAO;AAAA,MACX,MAAM;AAAA;AAAA;AAAA;AAAA,MAIN,eAAe,MAAM;AAAA,IACvB;AACA,WAAO;AAAA,MACL,UAAU;AAAA,QACR;AAAA,UACE;AAAA,UACA,UAAU;AAAA,UACV,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAAA,EACF,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,UAAU;AAAA,UACR;AAAA,YACE;AAAA,YACA,UAAU;AAAA,YACV,MAAM,KAAK,UAAU,EAAE,OAAO,kBAAkB,GAAG,CAAC;AAAA,UACtD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACF;AAEA,eAAsB,6BACpBA,SACA,QAAgB,iCAChB,SAC6B;AAC7B,QAAM,aAAa,MAAMA,QAAO;AAAA,IAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,EACxB;AAGA,QAAM,UAAU,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACxD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,WAAW,QAAQ,YAAY,QAAQ;AAAA,UACvE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAsB,4BACpBA,SACA,QAAgB,yBAChB,SAC6B;AAC7B,QAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAEhF,QAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACpD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,OAAO,QAAQ,QAAQ,QAAQ;AAAA,UAC/D;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOO,SAAS,iBACd,MACA,MACS;AACT,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,KAAK,UAAU,KAAK,MAAO,QAAO;AACtC,MAAI,KAAK,WAAW,KAAK,OAAQ,QAAO;AACxC,SAAO;AACT;AAgBO,SAAS,kBACdC,SACAD,SACA,UAAoC,CAAC,GACf;AACtB,QAAM,SAAS,QAAQ,mBAAmB;AAC1C,QAAM,UAAU,QAAQ;AAIxB,EAAAC,QAAO;AAAA,IACL;AAAA,IACA,IAAI,4BAAiB,oBAAoB;AAAA,MACvC,MAAM,YAAY,kBAAkBD,SAAQ,OAAO;AAAA,IACrD,CAAC;AAAA,IACD;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,OAAO,MAAM,cAAc;AACzB,YAAM,MAAM,UAAU;AACtB,YAAM,KAAK,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,IAAI;AACzC,UAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAAG;AAC7C,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AACA,YAAM,UAAU,GAAG,SAAS,GAAG,IAAI,mBAAmB,EAAE,IAAI;AAC5D,aAAO,iBAAiBA,SAAQ,SAAS,OAAO;AAAA,IAClD;AAAA,EACF;AAIA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,4BAA4BD,SAAQ,yBAAyB,OAAO;AAAA,EAClF;AAKA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,6BAA6BD,SAAQ,iCAAiC,OAAO;AAAA,EAC3F;AAEA,MAAI,UAAU;AACd,MAAI,QAA+B;AACnC,MAAI,gBAA2D;AAC/D,MAAI,iBAA4D;AAEhE,QAAM,OAAO,YAA2B;AACtC,QAAI,QAAS;AAEb,QAAI;AACF,YAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAChF,YAAM,OAAO;AAAA,QACX,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO,SAAS,IAAI,OAAO,OAAO,SAAS,CAAC,EAAE,KAAK;AAAA,MAC7D;AACA,UAAI,iBAAiB,eAAe,IAAI,GAAG;AACzC,cAAMC,QAAO,OAAO,oBAAoB,EAAE,KAAK,cAAc,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MAChF;AACA,sBAAgB;AAAA,IAClB,QAAQ;AAAA,IAER;AAIA,QAAI;AACF,YAAM,aAAa,MAAMD,QAAO;AAAA,QAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,MACxB;AACA,YAAM,OAAO;AAAA,QACX,OAAO,WAAW;AAAA,QAClB,QACE,WAAW,SAAS,IAAI,WAAW,WAAW,SAAS,CAAC,EAAE,KAAK;AAAA,MACnE;AACA,UAAI,iBAAiB,gBAAgB,IAAI,GAAG;AAC1C,cAAMC,QAAO,OACV,oBAAoB,EAAE,KAAK,sBAAsB,CAAC,EAClD,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACnB;AACA,uBAAiB;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,MAAI,SAAS,GAAG;AAGd,YAAQ,YAAY,MAAM;AACxB,WAAK,KAAK;AAAA,IACZ,GAAG,MAAM;AACT,QAAI,OAAO,MAAM,UAAU,WAAY,OAAM,MAAM;AAAA,EACrD;AAEA,SAAO;AAAA,IACL,MAAM,MAAY;AAChB,gBAAU;AACV,UAAI,MAAO,eAAc,KAAK;AAC9B,cAAQ;AAAA,IACV;AAAA,EACF;AACF;;;ACpSA,mBAA2B;;;ACqB3B,SAAS,aACP,YACA,YACQ;AACR,QAAM,IAAI,eAAe,SAAY,QAAQ,WAAW,QAAQ,CAAC;AACjE,QAAM,IACJ,eAAe,SACX,QACA,MAAM,QAAQ,UAAU,IACtB,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,IAAI,IAClC;AACR,SAAO,eAAe,CAAC,qBAAkB,CAAC;AAC5C;AAEO,SAAS,mBAAmB,OAA8C;AAC/E,QAAM,WAAqB,CAAC,MAAM,QAAQ,KAAK,CAAC;AAChD,MAAI,MAAM,SAAS,MAAM,MAAM,KAAK,EAAE,SAAS,GAAG;AAChD,aAAS,KAAK,MAAM,MAAM,QAAQ,CAAC;AAAA,EACrC;AACA,WAAS,KAAK,aAAa,MAAM,YAAY,MAAM,UAAU,CAAC;AAC9D,QAAM,OAAO,SAAS,KAAK,MAAM;AACjC,SAAO;AAAA,IACL,SAAS,CAAC,EAAE,MAAM,QAAQ,KAAK,CAAC;AAAA,IAChC,GAAI,MAAM,UAAU,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,EAC3C;AACF;AAKO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,QAAQ,CAAC;AACvC;AAIO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,SAAS,SAAS,SAAS,KAAK,CAAC;AAC/D;;;AD5CA,SAAS,YAAY,SAA6B,QAAwB;AACxE,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,aAAa,mBAAmB,OAAO,CAAC,GAAG,MAAM;AAC1D;AAGA,eAAe,wBACb,IACA,iBACuB;AACvB,MAAI;AACF,WAAO,MAAM,GAAG;AAAA,EAClB,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO,oBAAoB,eAAe;AAAA,IAC5C;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAQA,eAAsB,aAAaC,SAAoB,OAA8C;AACnG,QAAM,KAAK,MAAM,UAAU,YAAY,mBAAmB,MAAM,OAAO,CAAC,KAAK;AAC7E,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,wBAAwB,mBAAmB,MAAM,SAAS,CAAC,GAAG,EAAE;AAAA,EAClE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAqB,IAAI;AACrD,UAAM,YAAY,OAAO,cAAc,KAAK,UAAK;AACjD,UAAM,cAAc,OAAO,gBAAgB,SACvC,OAAO,gBAAgB,KAAK,IAAI,IAChC;AACJ,UAAM,UACJ,kBAAkB,MAAM,SAAS,OAAO,OAAO,aAAa,OAC5D,OAAO,mBACN,OAAO,oBAAoB,qBAAqB,OAAO,iBAAiB,MAAM;AACjF,UAAM,aAAa;AAAA,MACjB,mBAAmB,SAAS;AAAA,MAC5B,qBAAqB,WAAW;AAAA,IAClC;AACA,QAAI,OAAO,mBAAmB;AAC5B,iBAAW,KAAK,oBAAoB,OAAO,iBAAiB,EAAE;AAAA,IAChE;AACA,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO,gBAAgB,SAAS,OAAO,kBAAkB;AAAA,IACvE,CAAC;AAAA,EACH,GAAG,2BAA2B,MAAM,SAAS,8DAA8D;AAC7G;AAQA,eAAsB,eACpBA,SACA,OACuB;AACvB,QAAM,KAAK,MAAM,UAAU,SAAY,UAAU,MAAM,KAAK,KAAK;AACjE,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,0BAA0B,mBAAmB,MAAM,MAAM,CAAC,GAAG,EAAE;AAAA,EACjE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAuB,IAAI;AACvD,QAAI,OAAO,kBAAkB,GAAG;AAC9B,aAAO;AAAA,QACL,GAAG,OAAO,MAAM;AAAA,MAClB;AAAA,IACF;AACA,UAAM,SAAS,CAAC,GAAG,OAAO,aAAa,EAAE;AAAA,MACvC,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,IACtE;AACA,UAAM,aAAa,OAAO,IAAI,gBAAgB;AAI9C,UAAM,gBAAgB,OAAO;AAAA,MAC3B,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,UAAU;AAAA,MAClC,OAAO;AAAA,IACT;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AACpE,WAAO,mBAAmB;AAAA,MACxB,SAAS,oBAAoB,OAAO,MAAM,KAAK,OAAO,aAAa,iBAAiB,OAAO,kBAAkB,IAAI,KAAK,GAAG;AAAA,MACzH,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO,SAAS,aAAa,IAAI,gBAAgB;AAAA,MAC7D,YAAY,YAAY,SAAS,cAAc;AAAA,IACjD,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,iBAAiB,GAAoC;AAC5D,QAAM,MAAM,EAAE,mBAAmB,wBAAW,QAAQ,2CAAsC;AAC1F,SAAO,YAAO,EAAE,MAAM,cAAc,EAAE,QAAQ,KAAK,EAAE,cAAc,IAAI,GAAG;AAC5E;AAmBA,eAAsB,gBACpBA,SACA,OACuB;AACvB,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,eAAe,mBAAmB,MAAM,MAAM,CAAC,uBAAuB,KAAK;AAAA,EAC7E;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAkC,IAAI;AAClE,QAAI,OAAO,UAAU,GAAG;AACtB,aAAO;AAAA,QACL,UAAU,IACN,GAAG,MAAM,MAAM,8CACf,GAAG,MAAM,MAAM,sCAAsC,KAAK;AAAA,MAChE;AAAA,IACF;AAEA,UAAM,aAAa,oBAAI,IAAwC;AAC/D,eAAW,OAAO,OAAO,cAAc;AACrC,YAAM,OAAO,WAAW,IAAI,IAAI,QAAQ,KAAK,CAAC;AAC9C,WAAK,KAAK,GAAG;AACb,iBAAW,IAAI,IAAI,UAAU,IAAI;AAAA,IACnC;AACA,UAAM,aAAuB,CAAC;AAC9B,eAAW,YAAY,CAAC,GAAG,WAAW,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG;AACnE,YAAM,QAAQ,aAAa,IAAI,wBAAwB,YAAY,QAAQ;AAC3E,iBAAW,KAAK,GAAG,KAAK,GAAG;AAC3B,iBAAW,OAAO,WAAW,IAAI,QAAQ,GAAI;AAC3C,mBAAW,KAAK,YAAO,IAAI,MAAM,WAAM,IAAI,QAAQ,KAAK,IAAI,UAAU,GAAG;AAAA,MAC3E;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,aAAa,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAC7E,UAAM,cAAc,WAAW,IAAI,CAAC,GAAG,UAAU;AACjD,UAAM,UACJ,UAAU,IACN,GAAG,MAAM,MAAM,QAAQ,WAAW,oBAAoB,gBAAgB,IAAI,MAAM,KAAK,MACrF,GAAG,MAAM,MAAM,QAAQ,OAAO,KAAK,aAAa,OAAO,UAAU,IAAI,MAAM,KAAK,uBAAuB,KAAK,KAAK,WAAW;AAClI,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,eAAsB,wBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,QAAQ,MAAMA,QAAO;AAAA,MACzB,YAAY,MAAM,SAAS,gBAAgB,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC/E;AACA,UAAM,WAAW,MAAM,SAAS,OAAO,CAAC,MAAM,EAAE,eAAe,wBAAW,QAAQ;AAClF,QAAI,SAAS,WAAW,GAAG;AACzB,YAAM,eAAe,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,eAAe,wBAAW,SAAS;AACrF,YAAM,OAAO,eACT,wGACA;AACJ,aAAO,oBAAoB,gCAAgC,MAAM,MAAM,IAAI,IAAI,EAAE;AAAA,IACnF;AACA,UAAM,aAAa,SAAS,IAAI,CAAC,MAAM,YAAO,EAAE,MAAM,WAAM,EAAE,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE;AAClF,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,SAAS,MAAM,qBAAqB,SAAS,WAAW,IAAI,MAAM,KAAK;AAAA,MACvG,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,wBAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,SAAS,GAAsB;AACtC,QAAM,OAAiB,CAAC;AACxB,MAAI,EAAE,QAAQ;AAGZ,SAAK,KAAK,SAAS,EAAE,OAAO,SAAS,EAAE;AACvC,QAAI,EAAE,OAAO,aAAa,EAAG,MAAK,KAAK,UAAU,EAAE,OAAO,UAAU,EAAE;AACtE,QAAI,EAAE,OAAO,sBAAsB,QAAW;AAC5C,WAAK,KAAK,OAAO,eAAe,EAAE,OAAO,iBAAiB,CAAC,EAAE;AAAA,IAC/D;AAAA,EACF,WAAW,EAAE,cAAc,QAAW;AACpC,SAAK,KAAK,aAAa,EAAE,SAAS,EAAE;AAAA,EACtC;AACA,MAAI,EAAE,aAAc,MAAK,KAAK,gBAAgB,EAAE,YAAY,EAAE;AAC9D,MAAI,EAAE,eAAe,OAAW,MAAK,KAAK,cAAc,EAAE,UAAU,EAAE;AACtE,SAAO,KAAK,SAAS,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM;AACjD;AAEA,SAAS,eAAe,IAAoB;AAC1C,MAAI,KAAK,IAAM,QAAO,GAAG,KAAK,MAAM,EAAE,CAAC;AACvC,QAAM,IAAI,KAAK,MAAM,KAAK,GAAI;AAC9B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,SAAO,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC;AAC9B;AAQA,eAAsB,mBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,cAAc,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC7E;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,oBAAoB,iCAAiC,MAAM,MAAM,GAAG;AAAA,IAC7E;AAGA,UAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,SAAS,EAAE;AAChE,UAAM,aAAuB,CAAC;AAC9B,eAAW,MAAM,SAAS;AACxB,iBAAW,KAAK,KAAK,GAAG,SAAS,WAAM,GAAG,OAAO,KAAK,GAAG,YAAY,EAAE;AACvE,iBAAW,KAAK,aAAa,GAAG,OAAO,SAAS,GAAG,MAAM,EAAE;AAAA,IAC7D;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,OAAO,MAAM,qBAAqB,OAAO,WAAW,IAAI,KAAK,GAAG,iBAAiB,QAAQ,MAAM;AAAA,MAC/H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA,MAG3B,YAAY,wBAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAaA,eAAsB,eACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,aAAa,mBAAmB,MAAM,KAAK,CAAC,EAAE;AAAA,IAC3E;AACA,QAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,aAAO,oBAAoB,mBAAmB,MAAM,KAAK,IAAI;AAAA,IAC/D;AACA,UAAM,WAAW,OAAO,YAAY;AACpC,UAAM,aAAuB,CAAC;AAC9B,QAAI;AACJ,eAAW,KAAK,OAAO,SAAS;AAG9B,YAAM,QAAQ,aAAa,eAAe,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAClF,YAAM,WAAW,UAAU,SAAY,WAAW,MAAM,QAAQ,CAAC,CAAC,MAAM;AACxE,UAAI,UAAU,WAAc,aAAa,UAAa,QAAQ,UAAW,YAAW;AACpF,iBAAW;AAAA,QACT,YAAO,EAAE,EAAE,KAAK,EAAE,IAAI,YAAQ,EAAwB,QAAQ,EAAE,EAAE,GAAG,QAAQ;AAAA,MAC/E;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,SAAS,OAAO,QAAQ,MAAM,SAAS,OAAO,QAAQ,WAAW,IAAI,KAAK,IAAI,SAAS,MAAM,KAAK,SAAS,QAAQ;AAAA,MAC5H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAkBA,eAAsB,aACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B;AAAA,QACE,MAAM;AAAA,QACN,uBAAuB,mBAAmB,MAAM,eAAe,CAAC;AAAA,MAClE;AAAA,IACF;AACA,UAAM,QACJ,OAAO,MAAM,MAAM,SACnB,OAAO,MAAM,MAAM,SACnB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM;AACvB,UAAM,YAAY,OAAO,KAAK,cAAc;AAC5C,QAAI,UAAU,GAAG;AACf,aAAO;AAAA,QACL,gDAAgD,MAAM,eAAe,qBAAqB,SAAS;AAAA,MACrG;AAAA,IACF;AACA,UAAM,aAAuB;AAAA,MAC3B,yBAAyB,SAAS;AAAA,MAClC,yBAAyB,OAAO,QAAQ,UAAU;AAAA,MAClD;AAAA,IACF;AACA,QAAI,OAAO,MAAM,MAAM,UAAU,OAAO,MAAM,MAAM,QAAQ;AAC1D,iBAAW,KAAK,QAAQ;AACxB,iBAAW,KAAK,OAAO,MAAM,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AAClF,iBAAW,KAAK,OAAO,MAAM;AAC3B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AACpF,iBAAW,KAAK,OAAO,QAAQ;AAC7B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,kBAAkB,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE;AAAA,MAC9E;AACA,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,cAAM,UACJ,EAAE,OAAO,eAAe,EAAE,MAAM,aAC5B,cAAc,EAAE,OAAO,UAAU,WAAM,EAAE,MAAM,UAAU,KACzD,kBAAkB,EAAE,QAAQ,EAAE,KAAK;AACzC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,OAAO,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,gBAAgB,MAAM,eAAe,KAAK,KAAK,UAAU,UAAU,IAAI,KAAK,GAAG;AAAA,MACxF,OAAO,WAAW,KAAK,IAAI,EAAE,QAAQ;AAAA;AAAA;AAAA,IAGvC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,2BAA2B,MAAM,eAAe,KAAK,IAAI,OAAO;AAAA,MAClE;AAAA,IACF;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,SAAS,kBACP,QACA,OACQ;AACR,QAAM,OAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AACpE,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,MAAM;AACpB,QAAI,KAAK,UAAU,OAAO,CAAC,CAAC,MAAM,KAAK,UAAU,MAAM,CAAC,CAAC,EAAG,SAAQ,KAAK,CAAC;AAAA,EAC5E;AACA,SAAO,QAAQ,WAAW,IACtB,sBACA,mBAAmB,QAAQ,KAAK,EAAE,KAAK,IAAI,CAAC;AAClD;AAmBA,eAAsB,oBACpBA,SACA,OACuB;AACvB,QAAM,SAAS,IAAI,gBAAgB;AACnC,MAAI,MAAM,UAAU,OAAW,QAAO,IAAI,SAAS,OAAO,MAAM,KAAK,CAAC;AACtE,MAAI,MAAM,SAAU,QAAO,IAAI,YAAY,MAAM,QAAQ;AACzD,QAAM,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,SAAS,CAAC,KAAK;AAEvD,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,mBAAmB,EAAE,EAAE;AAAA,IACpD;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,QACL,MAAM,WACF,YAAY,MAAM,QAAQ,qBAC1B;AAAA,MACN;AAAA,IACF;AACA,UAAM,aAAa,OAAO;AAAA,MACxB,CAAC,MACC,KAAK,EAAE,cAAc,WAAM,EAAE,MAAM,MAAM,EAAE,QAAQ,OAAO,EAAE,MAAM,eACnD,EAAE,YAAY,eAAe,eAAe,EAAE,WAAW,CAAC;AAAA,IAC7E;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,OAAO,MAAM,yBAAyB,OAAO,WAAW,IAAI,KAAK,GAAG,YAAY,MAAM,WAAW,QAAQ,MAAM,QAAQ,KAAK,EAAE;AAAA,MAC1I,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA,MAE3B,YAAY,wBAAW;AAAA,IACzB,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAsBA,eAAsB,cACpBA,SACA,OACuB;AACvB,MAAI;AACF,QAAI;AACJ,QAAI,UAAU;AACd,QAAI;AAEJ,QAAI,MAAM,oBAAoB;AAE5B,YAAM,OAAO,MAAM;AAAA,QACjBA;AAAA,QACA,YAAY,MAAM,SAAS,iBAAiB;AAAA,QAC5C,EAAE,oBAAoB,MAAM,mBAAmB;AAAA,MACjD;AACA,mBAAa,KAAK;AAClB,gBAAU,KAAK;AACf,qBAAe,KAAK;AAAA,IACtB,OAAO;AAGL,YAAM,WAAW,IAAI,gBAAgB;AACrC,UAAI,OAAO,MAAM,UAAU,YAAY,cAAc,MAAM,OAAO;AAChE,iBAAS,IAAI,YAAY,MAAM,MAAM,QAAQ;AAAA,MAC/C;AACA,YAAM,KAAK,SAAS,OAAO,IAAI,IAAI,SAAS,SAAS,CAAC,KAAK;AAC3D,mBAAa,MAAMA,QAAO;AAAA,QACxB,YAAY,MAAM,SAAS,uBAAuB,EAAE,EAAE;AAAA,MACxD;AACA,gBAAU,WAAW,MAAM,CAAC,MAAM,EAAE,gBAAgB,OAAO;AAAA,IAC7D;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL,eACI,4DAA4D,aAAa,IAAI,OAC7E;AAAA,MACN;AAAA,IACF;AAEA,UAAM,aAAa,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,OAAO,EAAE;AACvE,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAChB,mBAAa;AAAA,QACX,gBAAgB,aAAa,IAAI,kBAAkB,WAAW,MAAM,aAAa,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MACrH;AAAA,IACF,OAAO;AACL,mBAAa;AAAA,QACX,GAAG,WAAW,MAAM,oBAAoB,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MAC5E;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,mBAAa,KAAK,GAAG,UAAU,iBAAiB;AAAA,IAClD;AACA,QAAI,CAAC,WAAW,cAAc;AAC5B,mBAAa,KAAK,eAAe;AAAA,IACnC;AACA,UAAM,UAAU,aAAa,KAAK,IAAI,IAAI;AAE1C,UAAM,aAAa,WAAW,IAAI,CAAC,MAAM;AACvC,YAAM,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,OAAO,CAAC,KAAK;AAC/E,aAAO,aAAQ,EAAE,QAAQ,IAAI,EAAE,WAAW,KAAK,EAAE,UAAU,KAAK,EAAE,OAAO,WAAM,OAAO;AAAA,IACxF,CAAC;AACD,UAAM,aAAa,CAAC,GAAG,IAAI,IAAI,WAAW,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AACjE,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY,eAAe,MAAM;AAAA,MACjC,YAAY,WAAW,KAAK,GAAG;AAAA,IACjC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,eAAe,SACbA,SACA,MACA,MACY;AAKZ,QAAM,IAAIA;AACV,MAAI,OAAO,EAAE,SAAS,YAAY;AAChC,UAAM,IAAI,MAAM,6EAAwE;AAAA,EAC1F;AACA,SAAO,EAAE,KAAQ,MAAM,IAAI;AAC7B;;;AH9kBA,IAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,IAAM,SAAS,iBAAiB,OAAO;AAMvC,IAAM,iBAAiB,QAAQ,IAAI;AACnC,IAAM,aAAa,CAAC,UAClB,MAAM,WAAW;AAEnB,IAAM,eAAe,aAClB,OAAO,EACP,SAAS,EACT;AAAA,EACC;AACF;AAEF,IAAM,SAAS,IAAI,sBAAU;AAAA,EAC3B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,WAAW,aACR,OAAO,EACP,SAAS,qEAAqE;AAAA,IACjF,SAAS,aACN,OAAO,EACP,SAAS,EACT,SAAS,uGAAuG;AAAA,IACnH,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,4CAA4C;AAAA,IACxE,OAAO,aACJ,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,IAAI,EAAE,EACN,SAAS,EACT,SAAS,4BAA4B;AAAA,IACxC,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,OAAO,aACJ,OAAO,EACP,IAAI,EACJ,IAAI,CAAC,EACL,IAAI,EAAE,EACN,SAAS,EACT,SAAS,0EAA0E;AAAA,IACtF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,gBAAgB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACnF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,wBAAwB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAC3F;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,wBAAwB;AAAA,IACpD,OAAO,aAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS,mCAAmC;AAAA,IACnG,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,mBAAmB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACtF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,aAAE,OAAO,EAAE,SAAS,4DAA4D;AAAA,IACvF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,iBAAiB,aACd,OAAO,EACP;AAAA,MACC;AAAA,IACF;AAAA,IACF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,aACJ,OAAO,EACP,IAAI,EACJ,SAAS,EACT,IAAI,GAAG,EACP,SAAS,EACT,SAAS,mCAAmC;AAAA,IAC/C,UAAU,aACP,OAAO,EACP,SAAS,EACT,SAAS,0DAAqD;AAAA,IACjE,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,oBAAoB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACvF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,uCAAyB,SAAS,EAAE;AAAA,MACzC;AAAA,IACF;AAAA,IACA,oBAAoB,uCAAyB,SAAS,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,IACA,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UACL,cAAc,QAAQ;AAAA,IACpB,GAAG;AAAA,IACH,SAAS,WAAW,KAAK;AAAA,EAC3B,CAAwC;AAC5C;AAMA,IAAM,kBAAkB,QAAQ,IAAI,wBAChC,OAAO,QAAQ,IAAI,qBAAqB,IACxC;AACJ,IAAM,uBAAuB,kBAAkB,QAAQ,QAAQ;AAAA,EAC7D,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,EAC3D,GAAI,iBAAiB,EAAE,SAAS,eAAe,IAAI,CAAC;AACtD,CAAC;AAED,eAAe,OAAsB;AACnC,QAAM,YAAY,IAAI,kCAAqB;AAC3C,QAAM,OAAO,QAAQ,SAAS;AAChC;AAEA,IAAM,cAAc,MAAY;AAC9B,uBAAqB,KAAK;AAC5B;AACA,QAAQ,GAAG,WAAW,WAAW;AACjC,QAAQ,GAAG,UAAU,WAAW;AAEhC,KAAK,EAAE,MAAM,CAAC,QAAQ;AACpB,UAAQ,MAAM,GAAG;AACjB,UAAQ,KAAK,CAAC;AAChB,CAAC;","names":["import_mcp","import_types","baseUrl","client","server","client"]}
+{"version":3,"sources":["../src/index.ts","../src/client.ts","../src/resources.ts","../src/tools.ts","../src/format.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js'\nimport { z } from 'zod'\nimport { CheckPoliciesScopeSchema, HypotheticalActionSchema } from '@neat.is/types'\nimport { createHttpClient } from './client.js'\nimport { registerResources } from './resources.js'\nimport { DivergenceTypeSchema } from '@neat.is/types'\nimport {\n  checkPolicies,\n  getBlastRadius,\n  getDependencies,\n  getDivergences,\n  getGraphDiff,\n  getIncidentHistory,\n  getObservedDependencies,\n  getRecentStaleEdges,\n  getRootCause,\n  semanticSearch,\n} from './tools.js'\n\nconst baseUrl = process.env.NEAT_CORE_URL ?? 'http://localhost:8080'\nconst client = createHttpClient(baseUrl)\n\n// `NEAT_DEFAULT_PROJECT` is the implicit project for tool calls that don't\n// pass a `project` arg. Unset means \"use the core's `default` project\" — we\n// route those calls through the legacy unprefixed URL so an older core (one\n// that predates #83) still gets the request it expects.\nconst defaultProject = process.env.NEAT_DEFAULT_PROJECT\nconst projectFor = (input: { project?: string }): string | undefined =>\n  input.project ?? defaultProject\n\nconst projectField = z\n  .string()\n  .optional()\n  .describe(\n    'Project name when the core hosts more than one (set NEAT_PROJECTS=...). Omit to use the default project.',\n  )\n\nconst server = new McpServer({\n  name: 'neat',\n  version: '0.1.0',\n})\n\nserver.tool(\n  'get_root_cause',\n  'Trace a failing node up its dependency graph to find the underlying cause. Use this when something is breaking and you want to know which upstream component is the actual culprit.',\n  {\n    errorNode: z\n      .string()\n      .describe('Graph node id where the error surfaced, e.g. \"database:payments-db\"'),\n    errorId: z\n      .string()\n      .optional()\n      .describe('Specific error event id from incident history; if set, the result is coloured with that error message'),\n    project: projectField,\n  },\n  async (input) => getRootCause(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_blast_radius',\n  'List every node downstream of the given node — what would break if this node failed or was redeployed.',\n  {\n    nodeId: z.string().describe('Graph node id to compute blast radius from'),\n    depth: z\n      .number()\n      .int()\n      .nonnegative()\n      .max(20)\n      .optional()\n      .describe('Max BFS depth (default 10)'),\n    project: projectField,\n  },\n  async (input) => getBlastRadius(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_dependencies',\n  'List the transitive outgoing dependencies of a node, BFS to depth N (default 3, max 10). Each result carries distance, edge type, and provenance — both static (EXTRACTED) and runtime (OBSERVED). Pass depth=1 for direct-only.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    depth: z\n      .number()\n      .int()\n      .min(1)\n      .max(10)\n      .optional()\n      .describe('BFS depth (default 3, max 10). depth=1 returns direct dependencies only.'),\n    project: projectField,\n  },\n  async (input) => getDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_observed_dependencies',\n  'List only the runtime (OBSERVED via OTel) outgoing dependencies of a node. Use this to compare what code SAYS the service depends on vs what production actually does.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    project: projectField,\n  },\n  async (input) => getObservedDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_incident_history',\n  'Return recent OTel error events recorded against a node, most recent first.',\n  {\n    nodeId: z.string().describe('Graph node id to query'),\n    limit: z.number().int().positive().max(100).optional().describe('Max events to return (default 20)'),\n    project: projectField,\n  },\n  async (input) => getIncidentHistory(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'semantic_search',\n  'Search nodes by natural-language query. Uses embedding vectors when an embedder is available (Ollama nomic-embed-text → in-process MiniLM → substring fallback) — phrase the query the way you would describe what you want.',\n  {\n    query: z.string().describe('Free-text query, e.g. \"service handling checkout payments\"'),\n    project: projectField,\n  },\n  async (input) => semanticSearch(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_graph_diff',\n  'Diff a saved graph snapshot against the current live graph. Useful for change reviews and post-incidents — answers \"what changed in the architecture between then and now.\" Returns added/removed/changed nodes and edges with both snapshot timestamps.',\n  {\n    againstSnapshot: z\n      .string()\n      .describe(\n        'Path or http(s) URL of the snapshot to diff against (the \"before\" state). The current graph is the \"after\".',\n      ),\n    project: projectField,\n  },\n  async (input) => getGraphDiff(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_recent_stale_edges',\n  'List the most recent OBSERVED → STALE edge transitions. Use this to spot integrations that have gone quiet — a CALLS edge that just went stale typically means an upstream stopped calling, not that the link is healthy.',\n  {\n    limit: z\n      .number()\n      .int()\n      .positive()\n      .max(200)\n      .optional()\n      .describe('Max events to return (default 50)'),\n    edgeType: z\n      .string()\n      .optional()\n      .describe('Filter by edge type — e.g. \"CALLS\" or \"CONNECTS_TO\"'),\n    project: projectField,\n  },\n  async (input) => getRecentStaleEdges(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_divergences',\n  \"Returns places where what the code declares (EXTRACTED) doesn't match what production observed (OBSERVED). The single most NEAT-shaped query — the one that justifies the whole graph. Use when the user asks 'is anything weird?' or 'what does production do that the code doesn't?' or 'find me a bug' on an unfamiliar codebase. Returns divergences ranked by confidence × severity. Prefer this over `get_root_cause` when no specific node is failing.\",\n  {\n    type: z\n      .array(DivergenceTypeSchema)\n      .optional()\n      .describe(\n        'Filter by divergence type. One or more of: missing-observed, missing-extracted, version-mismatch, host-mismatch, compat-violation. Omit for all.',\n      ),\n    minConfidence: z\n      .number()\n      .min(0)\n      .max(1)\n      .optional()\n      .describe('Drop divergences below this confidence threshold (0.0 - 1.0).'),\n    node: z\n      .string()\n      .optional()\n      .describe('Scope to divergences involving this node id (as source or target).'),\n    project: projectField,\n  },\n  async (input) =>\n    getDivergences(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'check_policies',\n  'Inspect or dry-run the project\\'s policy.json. Without hypotheticalAction, returns currently-recorded violations. With hypotheticalAction, returns violations that would result if the action were applied. Architectural assertions in five shapes (structural / compatibility / provenance / ownership / blast-radius).',\n  {\n    scope: CheckPoliciesScopeSchema.optional().describe(\n      'Narrow to a subset. Default \"all\".',\n    ),\n    hypotheticalAction: HypotheticalActionSchema.optional().describe(\n      'Dry-run mode: simulate the action and return resulting violations. Omit for current state.',\n    ),\n    project: projectField,\n  },\n  async (input) =>\n    checkPolicies(client, {\n      ...input,\n      project: projectFor(input),\n    } as Parameters<typeof checkPolicies>[1]),\n)\n\n// Resources sit alongside tools — same data, different access pattern. Read\n// the per-node resource for raw attrs+edges JSON; subscribe to the incidents\n// resource to be notified when new errors land. The eight tools above are\n// unchanged.\nconst incidentsPollMs = process.env.NEAT_RESOURCE_POLL_MS\n  ? Number(process.env.NEAT_RESOURCE_POLL_MS)\n  : undefined\nconst resourceRegistration = registerResources(server, client, {\n  ...(incidentsPollMs !== undefined ? { incidentsPollMs } : {}),\n  ...(defaultProject ? { project: defaultProject } : {}),\n})\n\nasync function main(): Promise<void> {\n  const transport = new StdioServerTransport()\n  await server.connect(transport)\n}\n\nconst stopPolling = (): void => {\n  resourceRegistration.stop()\n}\nprocess.on('SIGTERM', stopPolling)\nprocess.on('SIGINT', stopPolling)\n\nmain().catch((err) => {\n  console.error(err)\n  process.exit(1)\n})\n","// Thin HTTP client for the neat-core REST surface. Tools call out via this\n// instead of fetch() directly so tests can swap in a stub implementation\n// without monkey-patching globals.\n\nexport interface HttpClient {\n  get<T>(path: string): Promise<T>\n  // POST is optional on the interface so test stubs that only need GET don't\n  // have to implement it. Production createHttpClient always provides it.\n  post?<T>(path: string, body: unknown): Promise<T>\n}\n\nexport function createHttpClient(baseUrl: string): HttpClient {\n  const root = baseUrl.replace(/\\/$/, '')\n  return {\n    async get<T>(path: string): Promise<T> {\n      const res = await fetch(`${root}${path}`)\n      if (!res.ok) {\n        const body = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on GET ${path}: ${body}`)\n      }\n      return (await res.json()) as T\n    },\n    async post<T>(path: string, body: unknown): Promise<T> {\n      const res = await fetch(`${root}${path}`, {\n        method: 'POST',\n        headers: { 'content-type': 'application/json' },\n        body: JSON.stringify(body),\n      })\n      if (!res.ok) {\n        const text = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on POST ${path}: ${text}`)\n      }\n      return (await res.json()) as T\n    },\n  }\n}\n\nexport class HttpError extends Error {\n  constructor(\n    public readonly status: number,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'HttpError'\n  }\n}\n","// MCP Resources — additive surface alongside the eight tools. Two resources:\n//\n//   neat://node/<id>          — one resource per graph node. Read returns the\n//                                node attributes plus its outbound edges.\n//   neat://incidents/recent   — most recent error events. Pollable by the SDK\n//                                via subscribe; we send `notifications/resources/\n//                                updated` when /incidents grows.\n//\n// Pure read helpers are exported so tests can exercise them without spinning up\n// an MCP transport. `registerResources()` does the SDK wiring + the poll loop.\n\nimport type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport {\n  ResourceTemplate,\n} from '@modelcontextprotocol/sdk/server/mcp.js'\nimport type {\n  ListResourcesResult,\n  ReadResourceResult,\n} from '@modelcontextprotocol/sdk/types.js'\nimport type { ErrorEvent, GraphEdge, GraphNode, PolicyViolation } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\ninterface SerializedGraph {\n  nodes: GraphNode[]\n  edges: GraphEdge[]\n}\n\nconst NODE_RESOURCE_MIME = 'application/json'\nconst INCIDENTS_URI = 'neat://incidents/recent'\nconst INCIDENTS_DEFAULT_LIMIT = 50\nconst POLICY_VIOLATIONS_URI = 'neat://policies/violations'\nconst POLICY_VIOLATIONS_DEFAULT_LIMIT = 100\n\nfunction nodeUri(id: string): string {\n  // Node ids contain `:` which RFC 6570 percent-encodes; doing it explicitly\n  // here keeps the URI we hand the SDK identical to what `list` produces.\n  return `neat://node/${encodeURIComponent(id)}`\n}\n\n// Project-aware URL prefix for the underlying core. When unset, hit the\n// legacy unprefixed routes (which the core resolves to project=`default`).\nfunction corePrefix(project: string | undefined): string {\n  return project ? `/projects/${encodeURIComponent(project)}` : ''\n}\n\nfunction nameFromAttrs(attrs: GraphNode): string {\n  return (attrs as { name?: string }).name ?? attrs.id\n}\n\nexport async function listNodeResources(\n  client: HttpClient,\n  project?: string,\n): Promise<ListResourcesResult> {\n  const graph = await client.get<SerializedGraph>(`${corePrefix(project)}/graph`)\n  return {\n    resources: graph.nodes.map((n) => ({\n      uri: nodeUri(n.id),\n      name: nameFromAttrs(n),\n      description: `${n.type} — ${nameFromAttrs(n)}`,\n      mimeType: NODE_RESOURCE_MIME,\n    })),\n  }\n}\n\nexport async function readNodeResource(\n  client: HttpClient,\n  id: string,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const uri = nodeUri(id)\n  const prefix = corePrefix(project)\n  try {\n    const [attrs, edges] = await Promise.all([\n      client.get<GraphNode>(`${prefix}/graph/node/${encodeURIComponent(id)}`),\n      client.get<EdgesResponse>(`${prefix}/graph/edges/${encodeURIComponent(id)}`),\n    ])\n    const body = {\n      node: attrs,\n      // Outbound only — the issue spec says \"attrs + outbound edges\". Inbound\n      // edges are still reachable via the other endpoint and would double the\n      // payload for hub nodes (e.g. a shared database).\n      outboundEdges: edges.outbound,\n    }\n    return {\n      contents: [\n        {\n          uri,\n          mimeType: NODE_RESOURCE_MIME,\n          text: JSON.stringify(body, null, 2),\n        },\n      ],\n    }\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return {\n        contents: [\n          {\n            uri,\n            mimeType: NODE_RESOURCE_MIME,\n            text: JSON.stringify({ error: 'node not found', id }),\n          },\n        ],\n      }\n    }\n    throw err\n  }\n}\n\nexport async function readPolicyViolationsResource(\n  client: HttpClient,\n  limit: number = POLICY_VIOLATIONS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const violations = await client.get<PolicyViolation[]>(\n    `${corePrefix(project)}/policies/violations`,\n  )\n  // Latest first; cap at limit so an exploding violations log doesn't blow\n  // up the resource read. The full file is still on disk for forensic use.\n  const ordered = [...violations].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: POLICY_VIOLATIONS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: violations.length, violations: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\nexport async function readRecentIncidentsResource(\n  client: HttpClient,\n  limit: number = INCIDENTS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n  // ndjson order is append-time = oldest first. Reverse so most-recent leads.\n  const ordered = [...events].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: INCIDENTS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: events.length, events: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\n// Pure helper so the poll loop can be tested without timers. Returns true when\n// the visible state of /incidents has changed in a way subscribers should hear\n// about. Compares total count + the id of the newest event — either is enough\n// on its own, but the pair makes deletes (if they ever happen) survive a\n// missed update.\nexport function incidentsChanged(\n  prev: { total: number; lastId?: string } | null,\n  next: { total: number; lastId?: string },\n): boolean {\n  if (!prev) return false // first observation seeds, doesn't notify\n  if (prev.total !== next.total) return true\n  if (prev.lastId !== next.lastId) return true\n  return false\n}\n\nexport interface RegisterResourcesOptions {\n  // Poll interval for /incidents in ms. 5s by default; 0 disables polling.\n  incidentsPollMs?: number\n  // Project this MCP instance reports against. Unset → core's `default`\n  // project via the legacy unprefixed URLs.\n  project?: string\n}\n\nexport interface ResourceRegistration {\n  // Stops the poll loop. The SDK keeps the registered resources around as\n  // long as the server is alive — calling stop() doesn't unregister them.\n  stop: () => void\n}\n\nexport function registerResources(\n  server: McpServer,\n  client: HttpClient,\n  options: RegisterResourcesOptions = {},\n): ResourceRegistration {\n  const pollMs = options.incidentsPollMs ?? 5000\n  const project = options.project\n\n  // neat://node/<id> — templated. The list callback enumerates current nodes;\n  // the read callback resolves a specific id.\n  server.registerResource(\n    'graph-node',\n    new ResourceTemplate('neat://node/{id}', {\n      list: async () => listNodeResources(client, project),\n    }),\n    {\n      description:\n        'A single graph node by id. Reading returns the node attributes plus its outbound edges as JSON.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async (_uri, variables) => {\n      const raw = variables.id\n      const id = Array.isArray(raw) ? raw[0] : raw\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new Error('neat://node/{id} requires an id')\n      }\n      const decoded = id.includes('%') ? decodeURIComponent(id) : id\n      return readNodeResource(client, decoded, project)\n    },\n  )\n\n  // neat://incidents/recent — static. Subscribers get notifications/resources/\n  // updated on each tick where /incidents has changed.\n  server.registerResource(\n    'incidents-recent',\n    INCIDENTS_URI,\n    {\n      description:\n        'Most recent error events recorded by neat-core, newest first. JSON: { count, total, events[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readRecentIncidentsResource(client, INCIDENTS_DEFAULT_LIMIT, project),\n  )\n\n  // neat://policies/violations — static. Same poll-and-notify pattern as\n  // incidents. Subscribers get resource-updated notifications when the\n  // policy-violations.ndjson grows. ADR-045.\n  server.registerResource(\n    'policies-violations',\n    POLICY_VIOLATIONS_URI,\n    {\n      description:\n        'Current policy violations from policy-violations.ndjson, newest first. JSON: { count, total, violations[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readPolicyViolationsResource(client, POLICY_VIOLATIONS_DEFAULT_LIMIT, project),\n  )\n\n  let stopped = false\n  let timer: NodeJS.Timeout | null = null\n  let lastIncidents: { total: number; lastId?: string } | null = null\n  let lastViolations: { total: number; lastId?: string } | null = null\n\n  const tick = async (): Promise<void> => {\n    if (stopped) return\n    // Incidents poll.\n    try {\n      const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n      const next = {\n        total: events.length,\n        lastId: events.length > 0 ? events[events.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastIncidents, next)) {\n        await server.server.sendResourceUpdated({ uri: INCIDENTS_URI }).catch(() => {})\n      }\n      lastIncidents = next\n    } catch {\n      // Core down — keep polling, next tick will catch up.\n    }\n    // Policy-violations poll. Fires the alert action's notifications/\n    // resources/updated for neat://policies/violations subscribers per\n    // ADR-044 §alert. Same change-detection shape as incidents.\n    try {\n      const violations = await client.get<PolicyViolation[]>(\n        `${corePrefix(project)}/policies/violations`,\n      )\n      const next = {\n        total: violations.length,\n        lastId:\n          violations.length > 0 ? violations[violations.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastViolations, next)) {\n        await server.server\n          .sendResourceUpdated({ uri: POLICY_VIOLATIONS_URI })\n          .catch(() => {})\n      }\n      lastViolations = next\n    } catch {\n      // Core down or no policies yet — keep polling.\n    }\n  }\n\n  if (pollMs > 0) {\n    // Seed `last` on first tick so we don't fire an \"updated\" notification\n    // when the server first comes up.\n    timer = setInterval(() => {\n      void tick()\n    }, pollMs)\n    if (typeof timer.unref === 'function') timer.unref()\n  }\n\n  return {\n    stop: (): void => {\n      stopped = true\n      if (timer) clearInterval(timer)\n      timer = null\n    },\n  }\n}\n","// Tool implementations. Each one takes an HttpClient + the validated input and\n// returns an MCP CallToolResult routed through formatToolResponse for the\n// three-part shape (NL + structured + footer) per ADR-039 / contract #12.\n// Keeping these as pure functions of (client, input) means tests don't need a\n// running server — just a stub client that returns canned JSON.\n\nimport type {\n  BlastRadiusAffectedNode,\n  BlastRadiusResult,\n  Divergence,\n  DivergenceResult,\n  DivergenceType,\n  ErrorEvent,\n  GraphEdge,\n  GraphNode,\n  HypotheticalAction,\n  PolicyViolation,\n  RootCauseResult,\n  TransitiveDependenciesResult,\n} from '@neat.is/types'\nimport { Provenance } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\nimport {\n  formatEmptyResponse,\n  formatErrorResponse,\n  formatToolResponse,\n  type ToolResponse,\n} from './format.js'\n\nexport type { ToolResponse } from './format.js'\n\n// Project-aware path builder. When `project` is set, route through\n// /projects/<name>/...; otherwise hit the legacy root URL (which the core\n// resolves to project=`default`). Keeping the legacy path means callers\n// running an older core still talk to a known route.\nfunction projectPath(project: string | undefined, suffix: string): string {\n  if (!project) return suffix\n  return `/projects/${encodeURIComponent(project)}${suffix}`\n}\n\n// Most tools want \"node missing → friendly message, anything else → real error\".\nasync function withMissingNodeFallback(\n  fn: () => Promise<ToolResponse>,\n  notFoundMessage: string,\n): Promise<ToolResponse> {\n  try {\n    return await fn()\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return formatEmptyResponse(notFoundMessage)\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface RootCauseInput {\n  errorNode: string\n  errorId?: string\n  project?: string\n}\n\nexport async function getRootCause(client: HttpClient, input: RootCauseInput): Promise<ToolResponse> {\n  const qs = input.errorId ? `?errorId=${encodeURIComponent(input.errorId)}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/root-cause/${encodeURIComponent(input.errorNode)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<RootCauseResult>(path)\n    const arrowPath = result.traversalPath.join(' ← ')\n    const provenances = result.edgeProvenances.length\n      ? result.edgeProvenances.join(', ')\n      : '(direct, no edges traversed)'\n    const summary =\n      `Root cause for ${input.errorNode} is ${result.rootCauseNode}. ` +\n      result.rootCauseReason +\n      (result.fixRecommendation ? ` Recommended fix: ${result.fixRecommendation}.` : '')\n    const blockLines = [\n      `Traversal path: ${arrowPath}`,\n      `Edge provenances: ${provenances}`,\n    ]\n    if (result.fixRecommendation) {\n      blockLines.push(`Recommended fix: ${result.fixRecommendation}`)\n    }\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      confidence: result.confidence,\n      provenance: result.edgeProvenances.length ? result.edgeProvenances : undefined,\n    })\n  }, `No root cause found for ${input.errorNode}. The node may be healthy, or it may not exist in the graph.`)\n}\n\nexport interface BlastRadiusInput {\n  nodeId: string\n  depth?: number\n  project?: string\n}\n\nexport async function getBlastRadius(\n  client: HttpClient,\n  input: BlastRadiusInput,\n): Promise<ToolResponse> {\n  const qs = input.depth !== undefined ? `?depth=${input.depth}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/blast-radius/${encodeURIComponent(input.nodeId)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<BlastRadiusResult>(path)\n    if (result.totalAffected === 0) {\n      return formatEmptyResponse(\n        `${result.origin} has no downstream dependencies. Nothing else would break if it failed.`,\n      )\n    }\n    const sorted = [...result.affectedNodes].sort(\n      (a, b) => a.distance - b.distance || a.nodeId.localeCompare(b.nodeId),\n    )\n    const blockLines = sorted.map(formatBlastEntry)\n    // Worst-case confidence — the path with the lowest cascaded confidence\n    // is the headline number; agents should treat this as \"what's the\n    // weakest reachability NEAT actually knows about?\"\n    const minConfidence = sorted.reduce(\n      (m, n) => Math.min(m, n.confidence),\n      Number.POSITIVE_INFINITY,\n    )\n    const provenances = [...new Set(sorted.map((n) => n.edgeProvenance))]\n    return formatToolResponse({\n      summary: `Blast radius for ${result.origin}: ${result.totalAffected} affected node${result.totalAffected === 1 ? '' : 's'} reachable downstream.`,\n      block: blockLines.join('\\n'),\n      confidence: Number.isFinite(minConfidence) ? minConfidence : undefined,\n      provenance: provenances.length ? provenances : undefined,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction formatBlastEntry(n: BlastRadiusAffectedNode): string {\n  const tag = n.edgeProvenance === Provenance.STALE ? ' [STALE — last seen too long ago]' : ''\n  return `  • ${n.nodeId} (distance ${n.distance}, ${n.edgeProvenance})${tag}`\n}\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\nexport interface DependenciesInput {\n  nodeId: string\n  // BFS depth. Default 3; max 10. Direct-only consumers pass 1.\n  depth?: number\n  project?: string\n}\n\n// Transitive get_dependencies (issue #144). Calls the new core endpoint\n// /graph/node/:id/dependencies?depth=N which BFS-walks outbound. The output\n// groups results by hop so direct dependencies stand out from transitives —\n// agents asked \"what does X depend on?\" usually want the direct list with\n// transitives as context.\nexport async function getDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  const depth = input.depth ?? 3\n  const path = projectPath(\n    input.project,\n    `/graph/node/${encodeURIComponent(input.nodeId)}/dependencies?depth=${depth}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<TransitiveDependenciesResult>(path)\n    if (result.total === 0) {\n      return formatEmptyResponse(\n        depth === 1\n          ? `${input.nodeId} has no direct dependencies in the graph.`\n          : `${input.nodeId} has no dependencies (BFS to depth ${depth}).`,\n      )\n    }\n    // Group by distance so the structured block reads as concentric rings.\n    const byDistance = new Map<number, typeof result.dependencies>()\n    for (const dep of result.dependencies) {\n      const ring = byDistance.get(dep.distance) ?? []\n      ring.push(dep)\n      byDistance.set(dep.distance, ring)\n    }\n    const blockLines: string[] = []\n    for (const distance of [...byDistance.keys()].sort((a, b) => a - b)) {\n      const label = distance === 1 ? 'Direct (distance 1)' : `Distance ${distance}`\n      blockLines.push(`${label}:`)\n      for (const dep of byDistance.get(distance)!) {\n        blockLines.push(`  • ${dep.nodeId} — ${dep.edgeType} (${dep.provenance})`)\n      }\n    }\n    const provenances = [...new Set(result.dependencies.map((d) => d.provenance))]\n    const directCount = byDistance.get(1)?.length ?? 0\n    const summary =\n      depth === 1\n        ? `${input.nodeId} has ${directCount} direct dependenc${directCount === 1 ? 'y' : 'ies'}.`\n        : `${input.nodeId} has ${result.total} dependenc${result.total === 1 ? 'y' : 'ies'} reachable to depth ${depth} (${directCount} direct).`\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      provenance: provenances,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport async function getObservedDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const edges = await client.get<EdgesResponse>(\n      projectPath(input.project, `/graph/edges/${encodeURIComponent(input.nodeId)}`),\n    )\n    const observed = edges.outbound.filter((e) => e.provenance === Provenance.OBSERVED)\n    if (observed.length === 0) {\n      const hasExtracted = edges.outbound.some((e) => e.provenance === Provenance.EXTRACTED)\n      const note = hasExtracted\n        ? ' Static (EXTRACTED) dependencies exist but no runtime traffic has been seen — is OTel running?'\n        : ''\n      return formatEmptyResponse(`No OBSERVED dependencies for ${input.nodeId}.${note}`)\n    }\n    const blockLines = observed.map((e) => `  • ${e.target} — ${e.type}${edgeMeta(e)}`)\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${observed.length} runtime dependenc${observed.length === 1 ? 'y' : 'ies'} confirmed by OTel.`,\n      block: blockLines.join('\\n'),\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction edgeMeta(e: GraphEdge): string {\n  const bits: string[] = []\n  if (e.signal) {\n    // Prefer the runtime signal numbers — \"saw 1,247 calls, 3 errors\" reads\n    // better than a derived 0.94 confidence.\n    bits.push(`spans=${e.signal.spanCount}`)\n    if (e.signal.errorCount > 0) bits.push(`errors=${e.signal.errorCount}`)\n    if (e.signal.lastObservedAgeMs !== undefined) {\n      bits.push(`age=${formatDuration(e.signal.lastObservedAgeMs)}`)\n    }\n  } else if (e.callCount !== undefined) {\n    bits.push(`callCount=${e.callCount}`)\n  }\n  if (e.lastObserved) bits.push(`lastObserved=${e.lastObserved}`)\n  if (e.confidence !== undefined) bits.push(`confidence=${e.confidence}`)\n  return bits.length ? ` [${bits.join(', ')}]` : ''\n}\n\nfunction formatDuration(ms: number): string {\n  if (ms < 1000) return `${Math.round(ms)}ms`\n  const s = Math.round(ms / 1000)\n  if (s < 60) return `${s}s`\n  const m = Math.round(s / 60)\n  if (m < 60) return `${m}m`\n  const h = Math.round(m / 60)\n  if (h < 48) return `${h}h`\n  return `${Math.round(h / 24)}d`\n}\n\nexport interface IncidentHistoryInput {\n  nodeId: string\n  limit?: number\n  project?: string\n}\n\nexport async function getIncidentHistory(\n  client: HttpClient,\n  input: IncidentHistoryInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const events = await client.get<ErrorEvent[]>(\n      projectPath(input.project, `/incidents/${encodeURIComponent(input.nodeId)}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(`No incidents recorded against ${input.nodeId}.`)\n    }\n    // ndjson order is append-time = oldest first. Reverse so the most recent\n    // event leads, then trim to the requested limit.\n    const ordered = [...events].reverse().slice(0, input.limit ?? 20)\n    const blockLines: string[] = []\n    for (const ev of ordered) {\n      blockLines.push(`  ${ev.timestamp} — ${ev.service}: ${ev.errorMessage}`)\n      blockLines.push(`    trace=${ev.traceId} span=${ev.spanId}`)\n    }\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${events.length} recorded incident${events.length === 1 ? '' : 's'}; showing the ${ordered.length} most recent.`,\n      block: blockLines.join('\\n'),\n      // ErrorEvents are observation records, not graph edges — provenance is\n      // OBSERVED by definition (the OTel span happened).\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport interface SemanticSearchInput {\n  query: string\n  project?: string\n}\n\ninterface SearchResponse {\n  query: string\n  provider?: 'ollama' | 'transformers' | 'substring'\n  matches: (GraphNode & { score?: number })[]\n}\n\nexport async function semanticSearch(\n  client: HttpClient,\n  input: SemanticSearchInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<SearchResponse>(\n      projectPath(input.project, `/search?q=${encodeURIComponent(input.query)}`),\n    )\n    if (result.matches.length === 0) {\n      return formatEmptyResponse(`No matches for \"${input.query}\".`)\n    }\n    const provider = result.provider ?? 'substring'\n    const blockLines: string[] = []\n    let topScore: number | undefined\n    for (const n of result.matches) {\n      // Embedding tiers attach a cosine score in [0,1]; substring fallback\n      // doesn't, so we elide the score when it's the placeholder 1.\n      const score = provider !== 'substring' && typeof n.score === 'number' ? n.score : undefined\n      const scoreBit = score !== undefined ? ` [score=${score.toFixed(2)}]` : ''\n      if (score !== undefined && (topScore === undefined || score > topScore)) topScore = score\n      blockLines.push(\n        `  • ${n.id} (${n.type}) — ${(n as { name?: string }).name ?? n.id}${scoreBit}`,\n      )\n    }\n    return formatToolResponse({\n      summary: `Found ${result.matches.length} match${result.matches.length === 1 ? '' : 'es'} for \"${input.query}\" via ${provider} provider.`,\n      block: blockLines.join('\\n'),\n      // Top similarity score doubles as a \"how confident is the embedder\n      // about the best match\" signal. Substring provider returns no score —\n      // the footer shows n/a in that case.\n      confidence: topScore,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface GraphDiffInput {\n  againstSnapshot: string\n  project?: string\n}\n\ninterface GraphDiffResponse {\n  base: { exportedAt?: string }\n  current: { exportedAt: string }\n  added: { nodes: GraphNode[]; edges: GraphEdge[] }\n  removed: { nodes: GraphNode[]; edges: GraphEdge[] }\n  changed: {\n    nodes: { id: string; before: GraphNode; after: GraphNode }[]\n    edges: { id: string; before: GraphEdge; after: GraphEdge }[]\n  }\n}\n\nexport async function getGraphDiff(\n  client: HttpClient,\n  input: GraphDiffInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<GraphDiffResponse>(\n      projectPath(\n        input.project,\n        `/graph/diff?against=${encodeURIComponent(input.againstSnapshot)}`,\n      ),\n    )\n    const total =\n      result.added.nodes.length +\n      result.added.edges.length +\n      result.removed.nodes.length +\n      result.removed.edges.length +\n      result.changed.nodes.length +\n      result.changed.edges.length\n    const baseLabel = result.base.exportedAt ?? 'unknown'\n    if (total === 0) {\n      return formatEmptyResponse(\n        `No differences between the current graph and ${input.againstSnapshot} (base exportedAt=${baseLabel}).`,\n      )\n    }\n    const blockLines: string[] = [\n      `  base exportedAt:    ${baseLabel}`,\n      `  current exportedAt: ${result.current.exportedAt}`,\n      '',\n    ]\n    if (result.added.nodes.length || result.added.edges.length) {\n      blockLines.push('Added:')\n      for (const n of result.added.nodes) blockLines.push(`  + node ${n.id} (${n.type})`)\n      for (const e of result.added.edges)\n        blockLines.push(`  + edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.removed.nodes.length || result.removed.edges.length) {\n      blockLines.push('Removed:')\n      for (const n of result.removed.nodes) blockLines.push(`  - node ${n.id} (${n.type})`)\n      for (const e of result.removed.edges)\n        blockLines.push(`  - edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.changed.nodes.length || result.changed.edges.length) {\n      blockLines.push('Changed:')\n      for (const c of result.changed.nodes) {\n        blockLines.push(`  ~ node ${c.id} — ${summariseAttrDiff(c.before, c.after)}`)\n      }\n      for (const c of result.changed.edges) {\n        const provBit =\n          c.before.provenance !== c.after.provenance\n            ? `provenance ${c.before.provenance} → ${c.after.provenance}`\n            : summariseAttrDiff(c.before, c.after)\n        blockLines.push(`  ~ edge ${c.id} — ${provBit}`)\n      }\n    }\n    return formatToolResponse({\n      summary: `Diff against ${input.againstSnapshot}: ${total} change${total === 1 ? '' : 's'} between the snapshot and the live graph.`,\n      block: blockLines.join('\\n').trimEnd(),\n      // Diff results don't have a per-result provenance — the diff spans\n      // every edge type and provenance kind. Footer shows n/a.\n    })\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 400) {\n      return formatErrorResponse(\n        `Could not load snapshot ${input.againstSnapshot}: ${err.message}`,\n      )\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nfunction summariseAttrDiff(\n  before: Record<string, unknown>,\n  after: Record<string, unknown>,\n): string {\n  const keys = new Set([...Object.keys(before), ...Object.keys(after)])\n  const changed: string[] = []\n  for (const k of keys) {\n    if (JSON.stringify(before[k]) !== JSON.stringify(after[k])) changed.push(k)\n  }\n  return changed.length === 0\n    ? 'attributes differ'\n    : `fields changed: ${changed.sort().join(', ')}`\n}\n\nexport interface RecentStaleEdgesInput {\n  limit?: number\n  edgeType?: string\n  project?: string\n}\n\ninterface StaleEventResponse {\n  edgeId: string\n  source: string\n  target: string\n  edgeType: string\n  thresholdMs: number\n  ageMs: number\n  lastObserved: string\n  transitionedAt: string\n}\n\nexport async function getRecentStaleEdges(\n  client: HttpClient,\n  input: RecentStaleEdgesInput,\n): Promise<ToolResponse> {\n  const params = new URLSearchParams()\n  if (input.limit !== undefined) params.set('limit', String(input.limit))\n  if (input.edgeType) params.set('edgeType', input.edgeType)\n  const qs = params.size > 0 ? `?${params.toString()}` : ''\n\n  try {\n    const events = await client.get<StaleEventResponse[]>(\n      projectPath(input.project, `/incidents/stale${qs}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(\n        input.edgeType\n          ? `No stale ${input.edgeType} edges recorded.`\n          : 'No stale-edge transitions recorded yet.',\n      )\n    }\n    const blockLines = events.map(\n      (e) =>\n        `  ${e.transitionedAt} — ${e.source} -[${e.edgeType}]-> ${e.target}` +\n        ` (last seen ${e.lastObserved}, threshold ${formatDuration(e.thresholdMs)})`,\n    )\n    return formatToolResponse({\n      summary: `${events.length} stale-edge transition${events.length === 1 ? '' : 's'} recorded${input.edgeType ? ` for ${input.edgeType}` : ''}.`,\n      block: blockLines.join('\\n'),\n      // STALE by definition — every event is a transition into STALE.\n      provenance: Provenance.STALE,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface CheckPoliciesInput {\n  // 'all' (default) returns every current violation. 'unresolved' is reserved\n  // for future resolution tracking — for the MVP it behaves the same as 'all'.\n  // { policyId } narrows to violations of one named policy.\n  scope?: 'all' | 'unresolved' | { policyId: string }\n  // When provided, dry-run evaluation: return violations that *would* result\n  // if the action were applied. Without it, return current violations.\n  hypotheticalAction?: HypotheticalAction\n  project?: string\n}\n\ninterface PoliciesCheckResponse {\n  allowed: boolean\n  hypotheticalAction?: HypotheticalAction\n  violations: PolicyViolation[]\n}\n\n// check_policies — single MCP tool covering both state-read and dry-run modes\n// per ADR-045. The contract explicitly rejects the audit's two-tool split\n// (evaluate_policy + get_policy_violations); both modes route through here.\nexport async function checkPolicies(\n  client: HttpClient,\n  input: CheckPoliciesInput,\n): Promise<ToolResponse> {\n  try {\n    let violations: PolicyViolation[]\n    let allowed = true\n    let hypothetical: HypotheticalAction | undefined\n\n    if (input.hypotheticalAction) {\n      // Dry-run via POST /policies/check.\n      const body = await postJson<PoliciesCheckResponse>(\n        client,\n        projectPath(input.project, '/policies/check'),\n        { hypotheticalAction: input.hypotheticalAction },\n      )\n      violations = body.violations\n      allowed = body.allowed\n      hypothetical = body.hypotheticalAction\n    } else {\n      // State read via GET /policies/violations. Optional scope filters via\n      // ?policyId=, severity isn't surfaced in the tool input today.\n      const qsParams = new URLSearchParams()\n      if (typeof input.scope === 'object' && 'policyId' in input.scope) {\n        qsParams.set('policyId', input.scope.policyId)\n      }\n      const qs = qsParams.size > 0 ? `?${qsParams.toString()}` : ''\n      violations = await client.get<PolicyViolation[]>(\n        projectPath(input.project, `/policies/violations${qs}`),\n      )\n      allowed = violations.every((v) => v.onViolation !== 'block')\n    }\n\n    if (violations.length === 0) {\n      return formatEmptyResponse(\n        hypothetical\n          ? `No violations would result from the hypothetical action (${hypothetical.kind}).`\n          : 'No policy violations recorded.',\n      )\n    }\n\n    const blockCount = violations.filter((v) => v.onViolation === 'block').length\n    const summaryParts: string[] = []\n    if (hypothetical) {\n      summaryParts.push(\n        `Hypothetical ${hypothetical.kind} would surface ${violations.length} violation${violations.length === 1 ? '' : 's'}`,\n      )\n    } else {\n      summaryParts.push(\n        `${violations.length} policy violation${violations.length === 1 ? '' : 's'} currently recorded`,\n      )\n    }\n    if (blockCount > 0) {\n      summaryParts.push(`${blockCount} of which block`)\n    }\n    if (!allowed && hypothetical) {\n      summaryParts.push('action denied')\n    }\n    const summary = summaryParts.join('; ') + '.'\n\n    const blockLines = violations.map((v) => {\n      const subject = v.subject.nodeId ?? v.subject.edgeId ?? v.subject.path?.[0] ?? '(global)'\n      return `  • [${v.severity}/${v.onViolation}] ${v.policyName}: ${v.message} — ${subject}`\n    })\n    const severities = [...new Set(violations.map((v) => v.severity))]\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      // Confidence: hypothetical results inherit a 0.7 cap (the engine\n      // can't fully simulate every action shape in MVP); confirmed\n      // violations report 1.00 since the engine ran against current state.\n      confidence: hypothetical ? 0.7 : 1,\n      provenance: severities.join(' '),\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// get_divergences (ADR-060) — the thesis surface\n// ──────────────────────────────────────────────────────────────────────────\n\nexport interface DivergencesInput {\n  type?: ReadonlyArray<DivergenceType>\n  minConfidence?: number\n  node?: string\n  project?: string\n}\n\nfunction buildDivergencesPath(input: DivergencesInput): string {\n  const params = new URLSearchParams()\n  if (input.type && input.type.length > 0) params.set('type', input.type.join(','))\n  if (input.minConfidence !== undefined) {\n    params.set('minConfidence', String(input.minConfidence))\n  }\n  if (input.node) params.set('node', input.node)\n  const qs = params.size > 0 ? `?${params.toString()}` : ''\n  return projectPath(input.project, `/graph/divergences${qs}`)\n}\n\nfunction formatDivergenceLine(d: Divergence): string {\n  switch (d.type) {\n    case 'missing-observed':\n      return `  • [${d.type}] ${d.source} → ${d.target} (${d.edgeType}) — confidence ${d.confidence.toFixed(2)}`\n    case 'missing-extracted':\n      return `  • [${d.type}] ${d.source} → ${d.target} (${d.edgeType}) — confidence ${d.confidence.toFixed(2)}`\n    case 'version-mismatch':\n      return `  • [${d.type}] ${d.source} → ${d.target} — declared ${d.extractedVersion}, observed engine ${d.observedVersion} (${d.compatibility})`\n    case 'host-mismatch':\n      return `  • [${d.type}] ${d.source} → ${d.target} — declared host ${d.extractedHost}, observed host ${d.observedHost}`\n    case 'compat-violation':\n      return `  • [${d.type}] ${d.source} → ${d.target} — ${d.rule.kind}${d.rule.package ? ` (${d.rule.package})` : ''}`\n  }\n}\n\nexport async function getDivergences(\n  client: HttpClient,\n  input: DivergencesInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<DivergenceResult>(buildDivergencesPath(input))\n    if (result.totalAffected === 0) {\n      return formatEmptyResponse(\n        'No divergences found between the declared (EXTRACTED) and observed (OBSERVED) views of the graph.',\n      )\n    }\n    // Sorted by confidence descending already; first entry is the headline.\n    const headline = result.divergences[0]!\n    const summary =\n      `Found ${result.totalAffected} divergence${result.totalAffected === 1 ? '' : 's'} between code and production. ` +\n      `Highest-confidence: ${headline.type} on ${headline.source} → ${headline.target}. ${headline.reason}`\n    const blockLines: string[] = []\n    for (const d of result.divergences) {\n      blockLines.push(formatDivergenceLine(d))\n      blockLines.push(`    reason: ${d.reason}`)\n      blockLines.push(`    recommendation: ${d.recommendation}`)\n    }\n    const maxConfidence = result.divergences.reduce(\n      (m, d) => Math.max(m, d.confidence),\n      0,\n    )\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      confidence: maxConfidence,\n      // Composite provenance — divergences sit between EXTRACTED and\n      // OBSERVED by construction; that's what makes them divergences.\n      provenance: 'composite (EXTRACTED + OBSERVED)',\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nasync function postJson<T>(\n  client: HttpClient,\n  path: string,\n  body: unknown,\n): Promise<T> {\n  // The base HttpClient interface only exposes get(). For POST we need to\n  // reach into the underlying transport. Most callers pass the client built\n  // by createHttpClient which has post; types are kept minimal so test\n  // stubs don't have to implement post unless the tool needs it.\n  const c = client as HttpClient & { post?: <U>(p: string, b: unknown) => Promise<U> }\n  if (typeof c.post !== 'function') {\n    throw new Error('HttpClient does not support POST — required for check_policies dry-run')\n  }\n  return c.post<T>(path, body)\n}\n","// Standardized three-part response format for every MCP tool (ADR-039,\n// issue #143). Output shape:\n//\n//   {summary — NL paragraph: what was found, why it matters}\n//\n//   {block — typed payload, formatted}\n//\n//   confidence: 0.94 · provenance: OBSERVED\n//\n// Empty result → footer reads \"confidence: n/a · provenance: n/a\". Every tool\n// in packages/mcp/src/tools.ts routes through this helper so consumers get a\n// consistent shape — agents can pattern-match on the footer to know how much\n// to trust the answer.\n\nexport interface ToolResponse {\n  [x: string]: unknown\n  content: { type: 'text'; text: string }[]\n  isError?: boolean\n}\n\nexport interface FormatToolResponseInput {\n  // NL paragraph. One or two sentences. What was found and why it matters.\n  summary: string\n  // Structured block. The formatted typed payload — usually a bullet list,\n  // sometimes a multi-section breakdown. May be empty when the summary\n  // already conveys everything.\n  block?: string\n  // Per-result confidence in [0, 1]. Undefined → footer reads \"n/a\".\n  confidence?: number\n  // Per-result provenance. Single value, or an array if the result spans\n  // mixed provenances (e.g. a path of OBSERVED + EXTRACTED edges). Undefined\n  // → footer reads \"n/a\".\n  provenance?: string | string[]\n  // Set on transport / 5xx errors. Routes through ToolResponse.isError so\n  // MCP clients can surface a non-\"normal\" return.\n  isError?: boolean\n}\n\nfunction formatFooter(\n  confidence: number | undefined,\n  provenance: string | string[] | undefined,\n): string {\n  const c = confidence === undefined ? 'n/a' : confidence.toFixed(2)\n  const p =\n    provenance === undefined\n      ? 'n/a'\n      : Array.isArray(provenance)\n        ? [...new Set(provenance)].join(', ')\n        : provenance\n  return `confidence: ${c} · provenance: ${p}`\n}\n\nexport function formatToolResponse(input: FormatToolResponseInput): ToolResponse {\n  const sections: string[] = [input.summary.trim()]\n  if (input.block && input.block.trim().length > 0) {\n    sections.push(input.block.trimEnd())\n  }\n  sections.push(formatFooter(input.confidence, input.provenance))\n  const text = sections.join('\\n\\n')\n  return {\n    content: [{ type: 'text', text }],\n    ...(input.isError ? { isError: true } : {}),\n  }\n}\n\n// Convenience for the \"node not found / empty graph\" path. Keeps the\n// three-part shape (summary still landed) but sets the footer to n/a / n/a\n// since there's nothing to confidence-tag or provenance-tag.\nexport function formatEmptyResponse(summary: string): ToolResponse {\n  return formatToolResponse({ summary })\n}\n\n// Convenience for transport / 5xx errors at the MCP boundary. isError set\n// so MCP clients route the response into their error path.\nexport function formatErrorResponse(message: string): ToolResponse {\n  return formatToolResponse({ summary: message, isError: true })\n}\n"],"mappings":";;;;AAEA,IAAAA,cAA0B;AAC1B,mBAAqC;AACrC,iBAAkB;AAClB,IAAAC,gBAAmE;;;ACM5D,SAAS,iBAAiBC,UAA6B;AAC5D,QAAM,OAAOA,SAAQ,QAAQ,OAAO,EAAE;AACtC,SAAO;AAAA,IACL,MAAM,IAAO,MAA0B;AACrC,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,EAAE;AACxC,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,WAAW,IAAI,KAAK,IAAI,EAAE;AAAA,MAC3F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,IACA,MAAM,KAAQ,MAAc,MAA2B;AACrD,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,IAAI;AAAA,QACxC,QAAQ;AAAA,QACR,SAAS,EAAE,gBAAgB,mBAAmB;AAAA,QAC9C,MAAM,KAAK,UAAU,IAAI;AAAA,MAC3B,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,YAAY,IAAI,KAAK,IAAI,EAAE;AAAA,MAC5F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,EACF;AACF;AAEO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACkB,QAChB,SACA;AACA,UAAM,OAAO;AAHG;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;;;ACjCA,iBAEO;AAkBP,IAAM,qBAAqB;AAC3B,IAAM,gBAAgB;AACtB,IAAM,0BAA0B;AAChC,IAAM,wBAAwB;AAC9B,IAAM,kCAAkC;AAExC,SAAS,QAAQ,IAAoB;AAGnC,SAAO,eAAe,mBAAmB,EAAE,CAAC;AAC9C;AAIA,SAAS,WAAW,SAAqC;AACvD,SAAO,UAAU,aAAa,mBAAmB,OAAO,CAAC,KAAK;AAChE;AAEA,SAAS,cAAc,OAA0B;AAC/C,SAAQ,MAA4B,QAAQ,MAAM;AACpD;AAEA,eAAsB,kBACpBC,SACA,SAC8B;AAC9B,QAAM,QAAQ,MAAMA,QAAO,IAAqB,GAAG,WAAW,OAAO,CAAC,QAAQ;AAC9E,SAAO;AAAA,IACL,WAAW,MAAM,MAAM,IAAI,CAAC,OAAO;AAAA,MACjC,KAAK,QAAQ,EAAE,EAAE;AAAA,MACjB,MAAM,cAAc,CAAC;AAAA,MACrB,aAAa,GAAG,EAAE,IAAI,WAAM,cAAc,CAAC,CAAC;AAAA,MAC5C,UAAU;AAAA,IACZ,EAAE;AAAA,EACJ;AACF;AAEA,eAAsB,iBACpBA,SACA,IACA,SAC6B;AAC7B,QAAM,MAAM,QAAQ,EAAE;AACtB,QAAM,SAAS,WAAW,OAAO;AACjC,MAAI;AACF,UAAM,CAAC,OAAO,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,MACvCA,QAAO,IAAe,GAAG,MAAM,eAAe,mBAAmB,EAAE,CAAC,EAAE;AAAA,MACtEA,QAAO,IAAmB,GAAG,MAAM,gBAAgB,mBAAmB,EAAE,CAAC,EAAE;AAAA,IAC7E,CAAC;AACD,UAAM,OAAO;AAAA,MACX,MAAM;AAAA;AAAA;AAAA;AAAA,MAIN,eAAe,MAAM;AAAA,IACvB;AACA,WAAO;AAAA,MACL,UAAU;AAAA,QACR;AAAA,UACE;AAAA,UACA,UAAU;AAAA,UACV,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAAA,EACF,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,UAAU;AAAA,UACR;AAAA,YACE;AAAA,YACA,UAAU;AAAA,YACV,MAAM,KAAK,UAAU,EAAE,OAAO,kBAAkB,GAAG,CAAC;AAAA,UACtD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACF;AAEA,eAAsB,6BACpBA,SACA,QAAgB,iCAChB,SAC6B;AAC7B,QAAM,aAAa,MAAMA,QAAO;AAAA,IAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,EACxB;AAGA,QAAM,UAAU,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACxD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,WAAW,QAAQ,YAAY,QAAQ;AAAA,UACvE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAsB,4BACpBA,SACA,QAAgB,yBAChB,SAC6B;AAC7B,QAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAEhF,QAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACpD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,OAAO,QAAQ,QAAQ,QAAQ;AAAA,UAC/D;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOO,SAAS,iBACd,MACA,MACS;AACT,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,KAAK,UAAU,KAAK,MAAO,QAAO;AACtC,MAAI,KAAK,WAAW,KAAK,OAAQ,QAAO;AACxC,SAAO;AACT;AAgBO,SAAS,kBACdC,SACAD,SACA,UAAoC,CAAC,GACf;AACtB,QAAM,SAAS,QAAQ,mBAAmB;AAC1C,QAAM,UAAU,QAAQ;AAIxB,EAAAC,QAAO;AAAA,IACL;AAAA,IACA,IAAI,4BAAiB,oBAAoB;AAAA,MACvC,MAAM,YAAY,kBAAkBD,SAAQ,OAAO;AAAA,IACrD,CAAC;AAAA,IACD;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,OAAO,MAAM,cAAc;AACzB,YAAM,MAAM,UAAU;AACtB,YAAM,KAAK,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,IAAI;AACzC,UAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAAG;AAC7C,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AACA,YAAM,UAAU,GAAG,SAAS,GAAG,IAAI,mBAAmB,EAAE,IAAI;AAC5D,aAAO,iBAAiBA,SAAQ,SAAS,OAAO;AAAA,IAClD;AAAA,EACF;AAIA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,4BAA4BD,SAAQ,yBAAyB,OAAO;AAAA,EAClF;AAKA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,6BAA6BD,SAAQ,iCAAiC,OAAO;AAAA,EAC3F;AAEA,MAAI,UAAU;AACd,MAAI,QAA+B;AACnC,MAAI,gBAA2D;AAC/D,MAAI,iBAA4D;AAEhE,QAAM,OAAO,YAA2B;AACtC,QAAI,QAAS;AAEb,QAAI;AACF,YAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAChF,YAAM,OAAO;AAAA,QACX,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO,SAAS,IAAI,OAAO,OAAO,SAAS,CAAC,EAAE,KAAK;AAAA,MAC7D;AACA,UAAI,iBAAiB,eAAe,IAAI,GAAG;AACzC,cAAMC,QAAO,OAAO,oBAAoB,EAAE,KAAK,cAAc,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MAChF;AACA,sBAAgB;AAAA,IAClB,QAAQ;AAAA,IAER;AAIA,QAAI;AACF,YAAM,aAAa,MAAMD,QAAO;AAAA,QAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,MACxB;AACA,YAAM,OAAO;AAAA,QACX,OAAO,WAAW;AAAA,QAClB,QACE,WAAW,SAAS,IAAI,WAAW,WAAW,SAAS,CAAC,EAAE,KAAK;AAAA,MACnE;AACA,UAAI,iBAAiB,gBAAgB,IAAI,GAAG;AAC1C,cAAMC,QAAO,OACV,oBAAoB,EAAE,KAAK,sBAAsB,CAAC,EAClD,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACnB;AACA,uBAAiB;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,MAAI,SAAS,GAAG;AAGd,YAAQ,YAAY,MAAM;AACxB,WAAK,KAAK;AAAA,IACZ,GAAG,MAAM;AACT,QAAI,OAAO,MAAM,UAAU,WAAY,OAAM,MAAM;AAAA,EACrD;AAEA,SAAO;AAAA,IACL,MAAM,MAAY;AAChB,gBAAU;AACV,UAAI,MAAO,eAAc,KAAK;AAC9B,cAAQ;AAAA,IACV;AAAA,EACF;AACF;;;AF7SA,IAAAC,gBAAqC;;;AGYrC,mBAA2B;;;ACkB3B,SAAS,aACP,YACA,YACQ;AACR,QAAM,IAAI,eAAe,SAAY,QAAQ,WAAW,QAAQ,CAAC;AACjE,QAAM,IACJ,eAAe,SACX,QACA,MAAM,QAAQ,UAAU,IACtB,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,IAAI,IAClC;AACR,SAAO,eAAe,CAAC,qBAAkB,CAAC;AAC5C;AAEO,SAAS,mBAAmB,OAA8C;AAC/E,QAAM,WAAqB,CAAC,MAAM,QAAQ,KAAK,CAAC;AAChD,MAAI,MAAM,SAAS,MAAM,MAAM,KAAK,EAAE,SAAS,GAAG;AAChD,aAAS,KAAK,MAAM,MAAM,QAAQ,CAAC;AAAA,EACrC;AACA,WAAS,KAAK,aAAa,MAAM,YAAY,MAAM,UAAU,CAAC;AAC9D,QAAM,OAAO,SAAS,KAAK,MAAM;AACjC,SAAO;AAAA,IACL,SAAS,CAAC,EAAE,MAAM,QAAQ,KAAK,CAAC;AAAA,IAChC,GAAI,MAAM,UAAU,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,EAC3C;AACF;AAKO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,QAAQ,CAAC;AACvC;AAIO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,SAAS,SAAS,SAAS,KAAK,CAAC;AAC/D;;;ADzCA,SAAS,YAAY,SAA6B,QAAwB;AACxE,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,aAAa,mBAAmB,OAAO,CAAC,GAAG,MAAM;AAC1D;AAGA,eAAe,wBACb,IACA,iBACuB;AACvB,MAAI;AACF,WAAO,MAAM,GAAG;AAAA,EAClB,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO,oBAAoB,eAAe;AAAA,IAC5C;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAQA,eAAsB,aAAaC,SAAoB,OAA8C;AACnG,QAAM,KAAK,MAAM,UAAU,YAAY,mBAAmB,MAAM,OAAO,CAAC,KAAK;AAC7E,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,wBAAwB,mBAAmB,MAAM,SAAS,CAAC,GAAG,EAAE;AAAA,EAClE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAqB,IAAI;AACrD,UAAM,YAAY,OAAO,cAAc,KAAK,UAAK;AACjD,UAAM,cAAc,OAAO,gBAAgB,SACvC,OAAO,gBAAgB,KAAK,IAAI,IAChC;AACJ,UAAM,UACJ,kBAAkB,MAAM,SAAS,OAAO,OAAO,aAAa,OAC5D,OAAO,mBACN,OAAO,oBAAoB,qBAAqB,OAAO,iBAAiB,MAAM;AACjF,UAAM,aAAa;AAAA,MACjB,mBAAmB,SAAS;AAAA,MAC5B,qBAAqB,WAAW;AAAA,IAClC;AACA,QAAI,OAAO,mBAAmB;AAC5B,iBAAW,KAAK,oBAAoB,OAAO,iBAAiB,EAAE;AAAA,IAChE;AACA,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO,gBAAgB,SAAS,OAAO,kBAAkB;AAAA,IACvE,CAAC;AAAA,EACH,GAAG,2BAA2B,MAAM,SAAS,8DAA8D;AAC7G;AAQA,eAAsB,eACpBA,SACA,OACuB;AACvB,QAAM,KAAK,MAAM,UAAU,SAAY,UAAU,MAAM,KAAK,KAAK;AACjE,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,0BAA0B,mBAAmB,MAAM,MAAM,CAAC,GAAG,EAAE;AAAA,EACjE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAuB,IAAI;AACvD,QAAI,OAAO,kBAAkB,GAAG;AAC9B,aAAO;AAAA,QACL,GAAG,OAAO,MAAM;AAAA,MAClB;AAAA,IACF;AACA,UAAM,SAAS,CAAC,GAAG,OAAO,aAAa,EAAE;AAAA,MACvC,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,IACtE;AACA,UAAM,aAAa,OAAO,IAAI,gBAAgB;AAI9C,UAAM,gBAAgB,OAAO;AAAA,MAC3B,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,UAAU;AAAA,MAClC,OAAO;AAAA,IACT;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AACpE,WAAO,mBAAmB;AAAA,MACxB,SAAS,oBAAoB,OAAO,MAAM,KAAK,OAAO,aAAa,iBAAiB,OAAO,kBAAkB,IAAI,KAAK,GAAG;AAAA,MACzH,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO,SAAS,aAAa,IAAI,gBAAgB;AAAA,MAC7D,YAAY,YAAY,SAAS,cAAc;AAAA,IACjD,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,iBAAiB,GAAoC;AAC5D,QAAM,MAAM,EAAE,mBAAmB,wBAAW,QAAQ,2CAAsC;AAC1F,SAAO,YAAO,EAAE,MAAM,cAAc,EAAE,QAAQ,KAAK,EAAE,cAAc,IAAI,GAAG;AAC5E;AAmBA,eAAsB,gBACpBA,SACA,OACuB;AACvB,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,eAAe,mBAAmB,MAAM,MAAM,CAAC,uBAAuB,KAAK;AAAA,EAC7E;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAkC,IAAI;AAClE,QAAI,OAAO,UAAU,GAAG;AACtB,aAAO;AAAA,QACL,UAAU,IACN,GAAG,MAAM,MAAM,8CACf,GAAG,MAAM,MAAM,sCAAsC,KAAK;AAAA,MAChE;AAAA,IACF;AAEA,UAAM,aAAa,oBAAI,IAAwC;AAC/D,eAAW,OAAO,OAAO,cAAc;AACrC,YAAM,OAAO,WAAW,IAAI,IAAI,QAAQ,KAAK,CAAC;AAC9C,WAAK,KAAK,GAAG;AACb,iBAAW,IAAI,IAAI,UAAU,IAAI;AAAA,IACnC;AACA,UAAM,aAAuB,CAAC;AAC9B,eAAW,YAAY,CAAC,GAAG,WAAW,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG;AACnE,YAAM,QAAQ,aAAa,IAAI,wBAAwB,YAAY,QAAQ;AAC3E,iBAAW,KAAK,GAAG,KAAK,GAAG;AAC3B,iBAAW,OAAO,WAAW,IAAI,QAAQ,GAAI;AAC3C,mBAAW,KAAK,YAAO,IAAI,MAAM,WAAM,IAAI,QAAQ,KAAK,IAAI,UAAU,GAAG;AAAA,MAC3E;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,aAAa,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAC7E,UAAM,cAAc,WAAW,IAAI,CAAC,GAAG,UAAU;AACjD,UAAM,UACJ,UAAU,IACN,GAAG,MAAM,MAAM,QAAQ,WAAW,oBAAoB,gBAAgB,IAAI,MAAM,KAAK,MACrF,GAAG,MAAM,MAAM,QAAQ,OAAO,KAAK,aAAa,OAAO,UAAU,IAAI,MAAM,KAAK,uBAAuB,KAAK,KAAK,WAAW;AAClI,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,eAAsB,wBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,QAAQ,MAAMA,QAAO;AAAA,MACzB,YAAY,MAAM,SAAS,gBAAgB,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC/E;AACA,UAAM,WAAW,MAAM,SAAS,OAAO,CAAC,MAAM,EAAE,eAAe,wBAAW,QAAQ;AAClF,QAAI,SAAS,WAAW,GAAG;AACzB,YAAM,eAAe,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,eAAe,wBAAW,SAAS;AACrF,YAAM,OAAO,eACT,wGACA;AACJ,aAAO,oBAAoB,gCAAgC,MAAM,MAAM,IAAI,IAAI,EAAE;AAAA,IACnF;AACA,UAAM,aAAa,SAAS,IAAI,CAAC,MAAM,YAAO,EAAE,MAAM,WAAM,EAAE,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE;AAClF,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,SAAS,MAAM,qBAAqB,SAAS,WAAW,IAAI,MAAM,KAAK;AAAA,MACvG,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,wBAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,SAAS,GAAsB;AACtC,QAAM,OAAiB,CAAC;AACxB,MAAI,EAAE,QAAQ;AAGZ,SAAK,KAAK,SAAS,EAAE,OAAO,SAAS,EAAE;AACvC,QAAI,EAAE,OAAO,aAAa,EAAG,MAAK,KAAK,UAAU,EAAE,OAAO,UAAU,EAAE;AACtE,QAAI,EAAE,OAAO,sBAAsB,QAAW;AAC5C,WAAK,KAAK,OAAO,eAAe,EAAE,OAAO,iBAAiB,CAAC,EAAE;AAAA,IAC/D;AAAA,EACF,WAAW,EAAE,cAAc,QAAW;AACpC,SAAK,KAAK,aAAa,EAAE,SAAS,EAAE;AAAA,EACtC;AACA,MAAI,EAAE,aAAc,MAAK,KAAK,gBAAgB,EAAE,YAAY,EAAE;AAC9D,MAAI,EAAE,eAAe,OAAW,MAAK,KAAK,cAAc,EAAE,UAAU,EAAE;AACtE,SAAO,KAAK,SAAS,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM;AACjD;AAEA,SAAS,eAAe,IAAoB;AAC1C,MAAI,KAAK,IAAM,QAAO,GAAG,KAAK,MAAM,EAAE,CAAC;AACvC,QAAM,IAAI,KAAK,MAAM,KAAK,GAAI;AAC9B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,SAAO,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC;AAC9B;AAQA,eAAsB,mBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,cAAc,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC7E;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,oBAAoB,iCAAiC,MAAM,MAAM,GAAG;AAAA,IAC7E;AAGA,UAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,SAAS,EAAE;AAChE,UAAM,aAAuB,CAAC;AAC9B,eAAW,MAAM,SAAS;AACxB,iBAAW,KAAK,KAAK,GAAG,SAAS,WAAM,GAAG,OAAO,KAAK,GAAG,YAAY,EAAE;AACvE,iBAAW,KAAK,aAAa,GAAG,OAAO,SAAS,GAAG,MAAM,EAAE;AAAA,IAC7D;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,OAAO,MAAM,qBAAqB,OAAO,WAAW,IAAI,KAAK,GAAG,iBAAiB,QAAQ,MAAM;AAAA,MAC/H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA,MAG3B,YAAY,wBAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAaA,eAAsB,eACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,aAAa,mBAAmB,MAAM,KAAK,CAAC,EAAE;AAAA,IAC3E;AACA,QAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,aAAO,oBAAoB,mBAAmB,MAAM,KAAK,IAAI;AAAA,IAC/D;AACA,UAAM,WAAW,OAAO,YAAY;AACpC,UAAM,aAAuB,CAAC;AAC9B,QAAI;AACJ,eAAW,KAAK,OAAO,SAAS;AAG9B,YAAM,QAAQ,aAAa,eAAe,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAClF,YAAM,WAAW,UAAU,SAAY,WAAW,MAAM,QAAQ,CAAC,CAAC,MAAM;AACxE,UAAI,UAAU,WAAc,aAAa,UAAa,QAAQ,UAAW,YAAW;AACpF,iBAAW;AAAA,QACT,YAAO,EAAE,EAAE,KAAK,EAAE,IAAI,YAAQ,EAAwB,QAAQ,EAAE,EAAE,GAAG,QAAQ;AAAA,MAC/E;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,SAAS,OAAO,QAAQ,MAAM,SAAS,OAAO,QAAQ,WAAW,IAAI,KAAK,IAAI,SAAS,MAAM,KAAK,SAAS,QAAQ;AAAA,MAC5H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAkBA,eAAsB,aACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B;AAAA,QACE,MAAM;AAAA,QACN,uBAAuB,mBAAmB,MAAM,eAAe,CAAC;AAAA,MAClE;AAAA,IACF;AACA,UAAM,QACJ,OAAO,MAAM,MAAM,SACnB,OAAO,MAAM,MAAM,SACnB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM;AACvB,UAAM,YAAY,OAAO,KAAK,cAAc;AAC5C,QAAI,UAAU,GAAG;AACf,aAAO;AAAA,QACL,gDAAgD,MAAM,eAAe,qBAAqB,SAAS;AAAA,MACrG;AAAA,IACF;AACA,UAAM,aAAuB;AAAA,MAC3B,yBAAyB,SAAS;AAAA,MAClC,yBAAyB,OAAO,QAAQ,UAAU;AAAA,MAClD;AAAA,IACF;AACA,QAAI,OAAO,MAAM,MAAM,UAAU,OAAO,MAAM,MAAM,QAAQ;AAC1D,iBAAW,KAAK,QAAQ;AACxB,iBAAW,KAAK,OAAO,MAAM,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AAClF,iBAAW,KAAK,OAAO,MAAM;AAC3B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AACpF,iBAAW,KAAK,OAAO,QAAQ;AAC7B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,kBAAkB,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE;AAAA,MAC9E;AACA,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,cAAM,UACJ,EAAE,OAAO,eAAe,EAAE,MAAM,aAC5B,cAAc,EAAE,OAAO,UAAU,WAAM,EAAE,MAAM,UAAU,KACzD,kBAAkB,EAAE,QAAQ,EAAE,KAAK;AACzC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,OAAO,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,gBAAgB,MAAM,eAAe,KAAK,KAAK,UAAU,UAAU,IAAI,KAAK,GAAG;AAAA,MACxF,OAAO,WAAW,KAAK,IAAI,EAAE,QAAQ;AAAA;AAAA;AAAA,IAGvC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,2BAA2B,MAAM,eAAe,KAAK,IAAI,OAAO;AAAA,MAClE;AAAA,IACF;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,SAAS,kBACP,QACA,OACQ;AACR,QAAM,OAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AACpE,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,MAAM;AACpB,QAAI,KAAK,UAAU,OAAO,CAAC,CAAC,MAAM,KAAK,UAAU,MAAM,CAAC,CAAC,EAAG,SAAQ,KAAK,CAAC;AAAA,EAC5E;AACA,SAAO,QAAQ,WAAW,IACtB,sBACA,mBAAmB,QAAQ,KAAK,EAAE,KAAK,IAAI,CAAC;AAClD;AAmBA,eAAsB,oBACpBA,SACA,OACuB;AACvB,QAAM,SAAS,IAAI,gBAAgB;AACnC,MAAI,MAAM,UAAU,OAAW,QAAO,IAAI,SAAS,OAAO,MAAM,KAAK,CAAC;AACtE,MAAI,MAAM,SAAU,QAAO,IAAI,YAAY,MAAM,QAAQ;AACzD,QAAM,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,SAAS,CAAC,KAAK;AAEvD,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,mBAAmB,EAAE,EAAE;AAAA,IACpD;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,QACL,MAAM,WACF,YAAY,MAAM,QAAQ,qBAC1B;AAAA,MACN;AAAA,IACF;AACA,UAAM,aAAa,OAAO;AAAA,MACxB,CAAC,MACC,KAAK,EAAE,cAAc,WAAM,EAAE,MAAM,MAAM,EAAE,QAAQ,OAAO,EAAE,MAAM,eACnD,EAAE,YAAY,eAAe,eAAe,EAAE,WAAW,CAAC;AAAA,IAC7E;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,OAAO,MAAM,yBAAyB,OAAO,WAAW,IAAI,KAAK,GAAG,YAAY,MAAM,WAAW,QAAQ,MAAM,QAAQ,KAAK,EAAE;AAAA,MAC1I,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA,MAE3B,YAAY,wBAAW;AAAA,IACzB,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAsBA,eAAsB,cACpBA,SACA,OACuB;AACvB,MAAI;AACF,QAAI;AACJ,QAAI,UAAU;AACd,QAAI;AAEJ,QAAI,MAAM,oBAAoB;AAE5B,YAAM,OAAO,MAAM;AAAA,QACjBA;AAAA,QACA,YAAY,MAAM,SAAS,iBAAiB;AAAA,QAC5C,EAAE,oBAAoB,MAAM,mBAAmB;AAAA,MACjD;AACA,mBAAa,KAAK;AAClB,gBAAU,KAAK;AACf,qBAAe,KAAK;AAAA,IACtB,OAAO;AAGL,YAAM,WAAW,IAAI,gBAAgB;AACrC,UAAI,OAAO,MAAM,UAAU,YAAY,cAAc,MAAM,OAAO;AAChE,iBAAS,IAAI,YAAY,MAAM,MAAM,QAAQ;AAAA,MAC/C;AACA,YAAM,KAAK,SAAS,OAAO,IAAI,IAAI,SAAS,SAAS,CAAC,KAAK;AAC3D,mBAAa,MAAMA,QAAO;AAAA,QACxB,YAAY,MAAM,SAAS,uBAAuB,EAAE,EAAE;AAAA,MACxD;AACA,gBAAU,WAAW,MAAM,CAAC,MAAM,EAAE,gBAAgB,OAAO;AAAA,IAC7D;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL,eACI,4DAA4D,aAAa,IAAI,OAC7E;AAAA,MACN;AAAA,IACF;AAEA,UAAM,aAAa,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,OAAO,EAAE;AACvE,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAChB,mBAAa;AAAA,QACX,gBAAgB,aAAa,IAAI,kBAAkB,WAAW,MAAM,aAAa,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MACrH;AAAA,IACF,OAAO;AACL,mBAAa;AAAA,QACX,GAAG,WAAW,MAAM,oBAAoB,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MAC5E;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,mBAAa,KAAK,GAAG,UAAU,iBAAiB;AAAA,IAClD;AACA,QAAI,CAAC,WAAW,cAAc;AAC5B,mBAAa,KAAK,eAAe;AAAA,IACnC;AACA,UAAM,UAAU,aAAa,KAAK,IAAI,IAAI;AAE1C,UAAM,aAAa,WAAW,IAAI,CAAC,MAAM;AACvC,YAAM,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,OAAO,CAAC,KAAK;AAC/E,aAAO,aAAQ,EAAE,QAAQ,IAAI,EAAE,WAAW,KAAK,EAAE,UAAU,KAAK,EAAE,OAAO,WAAM,OAAO;AAAA,IACxF,CAAC;AACD,UAAM,aAAa,CAAC,GAAG,IAAI,IAAI,WAAW,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AACjE,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY,eAAe,MAAM;AAAA,MACjC,YAAY,WAAW,KAAK,GAAG;AAAA,IACjC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAaA,SAAS,qBAAqB,OAAiC;AAC7D,QAAM,SAAS,IAAI,gBAAgB;AACnC,MAAI,MAAM,QAAQ,MAAM,KAAK,SAAS,EAAG,QAAO,IAAI,QAAQ,MAAM,KAAK,KAAK,GAAG,CAAC;AAChF,MAAI,MAAM,kBAAkB,QAAW;AACrC,WAAO,IAAI,iBAAiB,OAAO,MAAM,aAAa,CAAC;AAAA,EACzD;AACA,MAAI,MAAM,KAAM,QAAO,IAAI,QAAQ,MAAM,IAAI;AAC7C,QAAM,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,SAAS,CAAC,KAAK;AACvD,SAAO,YAAY,MAAM,SAAS,qBAAqB,EAAE,EAAE;AAC7D;AAEA,SAAS,qBAAqB,GAAuB;AACnD,UAAQ,EAAE,MAAM;AAAA,IACd,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,KAAK,EAAE,QAAQ,uBAAkB,EAAE,WAAW,QAAQ,CAAC,CAAC;AAAA,IAC1G,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,KAAK,EAAE,QAAQ,uBAAkB,EAAE,WAAW,QAAQ,CAAC,CAAC;AAAA,IAC1G,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,oBAAe,EAAE,gBAAgB,qBAAqB,EAAE,eAAe,KAAK,EAAE,aAAa;AAAA,IAC7I,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,yBAAoB,EAAE,aAAa,mBAAmB,EAAE,YAAY;AAAA,IACtH,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,WAAM,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,UAAU,KAAK,EAAE,KAAK,OAAO,MAAM,EAAE;AAAA,EACpH;AACF;AAEA,eAAsB,eACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO,IAAsB,qBAAqB,KAAK,CAAC;AAC7E,QAAI,OAAO,kBAAkB,GAAG;AAC9B,aAAO;AAAA,QACL;AAAA,MACF;AAAA,IACF;AAEA,UAAM,WAAW,OAAO,YAAY,CAAC;AACrC,UAAM,UACJ,SAAS,OAAO,aAAa,cAAc,OAAO,kBAAkB,IAAI,KAAK,GAAG,qDACzD,SAAS,IAAI,OAAO,SAAS,MAAM,WAAM,SAAS,MAAM,KAAK,SAAS,MAAM;AACrG,UAAM,aAAuB,CAAC;AAC9B,eAAW,KAAK,OAAO,aAAa;AAClC,iBAAW,KAAK,qBAAqB,CAAC,CAAC;AACvC,iBAAW,KAAK,eAAe,EAAE,MAAM,EAAE;AACzC,iBAAW,KAAK,uBAAuB,EAAE,cAAc,EAAE;AAAA,IAC3D;AACA,UAAM,gBAAgB,OAAO,YAAY;AAAA,MACvC,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,UAAU;AAAA,MAClC;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY;AAAA;AAAA;AAAA,MAGZ,YAAY;AAAA,IACd,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,eAAe,SACbA,SACA,MACA,MACY;AAKZ,QAAM,IAAIA;AACV,MAAI,OAAO,EAAE,SAAS,YAAY;AAChC,UAAM,IAAI,MAAM,6EAAwE;AAAA,EAC1F;AACA,SAAO,EAAE,KAAQ,MAAM,IAAI;AAC7B;;;AH3pBA,IAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,IAAM,SAAS,iBAAiB,OAAO;AAMvC,IAAM,iBAAiB,QAAQ,IAAI;AACnC,IAAM,aAAa,CAAC,UAClB,MAAM,WAAW;AAEnB,IAAM,eAAe,aAClB,OAAO,EACP,SAAS,EACT;AAAA,EACC;AACF;AAEF,IAAM,SAAS,IAAI,sBAAU;AAAA,EAC3B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,WAAW,aACR,OAAO,EACP,SAAS,qEAAqE;AAAA,IACjF,SAAS,aACN,OAAO,EACP,SAAS,EACT,SAAS,uGAAuG;AAAA,IACnH,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,4CAA4C;AAAA,IACxE,OAAO,aACJ,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,IAAI,EAAE,EACN,SAAS,EACT,SAAS,4BAA4B;AAAA,IACxC,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,OAAO,aACJ,OAAO,EACP,IAAI,EACJ,IAAI,CAAC,EACL,IAAI,EAAE,EACN,SAAS,EACT,SAAS,0EAA0E;AAAA,IACtF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,gBAAgB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACnF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,wBAAwB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAC3F;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,aAAE,OAAO,EAAE,SAAS,wBAAwB;AAAA,IACpD,OAAO,aAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS,mCAAmC;AAAA,IACnG,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,mBAAmB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACtF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,aAAE,OAAO,EAAE,SAAS,4DAA4D;AAAA,IACvF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,iBAAiB,aACd,OAAO,EACP;AAAA,MACC;AAAA,IACF;AAAA,IACF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,aACJ,OAAO,EACP,IAAI,EACJ,SAAS,EACT,IAAI,GAAG,EACP,SAAS,EACT,SAAS,mCAAmC;AAAA,IAC/C,UAAU,aACP,OAAO,EACP,SAAS,EACT,SAAS,0DAAqD;AAAA,IACjE,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,oBAAoB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACvF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,MAAM,aACH,MAAM,kCAAoB,EAC1B,SAAS,EACT;AAAA,MACC;AAAA,IACF;AAAA,IACF,eAAe,aACZ,OAAO,EACP,IAAI,CAAC,EACL,IAAI,CAAC,EACL,SAAS,EACT,SAAS,+DAA+D;AAAA,IAC3E,MAAM,aACH,OAAO,EACP,SAAS,EACT,SAAS,oEAAoE;AAAA,IAChF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UACL,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACnE;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,uCAAyB,SAAS,EAAE;AAAA,MACzC;AAAA,IACF;AAAA,IACA,oBAAoB,uCAAyB,SAAS,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,IACA,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UACL,cAAc,QAAQ;AAAA,IACpB,GAAG;AAAA,IACH,SAAS,WAAW,KAAK;AAAA,EAC3B,CAAwC;AAC5C;AAMA,IAAM,kBAAkB,QAAQ,IAAI,wBAChC,OAAO,QAAQ,IAAI,qBAAqB,IACxC;AACJ,IAAM,uBAAuB,kBAAkB,QAAQ,QAAQ;AAAA,EAC7D,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,EAC3D,GAAI,iBAAiB,EAAE,SAAS,eAAe,IAAI,CAAC;AACtD,CAAC;AAED,eAAe,OAAsB;AACnC,QAAM,YAAY,IAAI,kCAAqB;AAC3C,QAAM,OAAO,QAAQ,SAAS;AAChC;AAEA,IAAM,cAAc,MAAY;AAC9B,uBAAqB,KAAK;AAC5B;AACA,QAAQ,GAAG,WAAW,WAAW;AACjC,QAAQ,GAAG,UAAU,WAAW;AAEhC,KAAK,EAAE,MAAM,CAAC,QAAQ;AACpB,UAAQ,MAAM,GAAG;AACjB,UAAQ,KAAK,CAAC;AAChB,CAAC;","names":["import_mcp","import_types","baseUrl","client","server","import_types","client"]}

package/dist/index.js

@@ -241,6 +241,9 @@ function registerResources(server2, client2, options = {}) {
   };
 }
 
+// src/index.ts
+import { DivergenceTypeSchema } from "@neat.is/types";
+
 // src/tools.ts
 import { Provenance } from "@neat.is/types";
 
@@ -639,6 +642,62 @@ async function checkPolicies(client2, input) {
     return formatErrorResponse(`Error talking to neat-core: ${err.message}`);
   }
 }
+function buildDivergencesPath(input) {
+  const params = new URLSearchParams();
+  if (input.type && input.type.length > 0) params.set("type", input.type.join(","));
+  if (input.minConfidence !== void 0) {
+    params.set("minConfidence", String(input.minConfidence));
+  }
+  if (input.node) params.set("node", input.node);
+  const qs = params.size > 0 ? `?${params.toString()}` : "";
+  return projectPath(input.project, `/graph/divergences${qs}`);
+}
+function formatDivergenceLine(d) {
+  switch (d.type) {
+    case "missing-observed":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} (${d.edgeType}) \u2014 confidence ${d.confidence.toFixed(2)}`;
+    case "missing-extracted":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} (${d.edgeType}) \u2014 confidence ${d.confidence.toFixed(2)}`;
+    case "version-mismatch":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} \u2014 declared ${d.extractedVersion}, observed engine ${d.observedVersion} (${d.compatibility})`;
+    case "host-mismatch":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} \u2014 declared host ${d.extractedHost}, observed host ${d.observedHost}`;
+    case "compat-violation":
+      return `  \u2022 [${d.type}] ${d.source} \u2192 ${d.target} \u2014 ${d.rule.kind}${d.rule.package ? ` (${d.rule.package})` : ""}`;
+  }
+}
+async function getDivergences(client2, input) {
+  try {
+    const result = await client2.get(buildDivergencesPath(input));
+    if (result.totalAffected === 0) {
+      return formatEmptyResponse(
+        "No divergences found between the declared (EXTRACTED) and observed (OBSERVED) views of the graph."
+      );
+    }
+    const headline = result.divergences[0];
+    const summary = `Found ${result.totalAffected} divergence${result.totalAffected === 1 ? "" : "s"} between code and production. Highest-confidence: ${headline.type} on ${headline.source} \u2192 ${headline.target}. ${headline.reason}`;
+    const blockLines = [];
+    for (const d of result.divergences) {
+      blockLines.push(formatDivergenceLine(d));
+      blockLines.push(`    reason: ${d.reason}`);
+      blockLines.push(`    recommendation: ${d.recommendation}`);
+    }
+    const maxConfidence = result.divergences.reduce(
+      (m, d) => Math.max(m, d.confidence),
+      0
+    );
+    return formatToolResponse({
+      summary,
+      block: blockLines.join("\n"),
+      confidence: maxConfidence,
+      // Composite provenance — divergences sit between EXTRACTED and
+      // OBSERVED by construction; that's what makes them divergences.
+      provenance: "composite (EXTRACTED + OBSERVED)"
+    });
+  } catch (err) {
+    return formatErrorResponse(`Error talking to neat-core: ${err.message}`);
+  }
+}
 async function postJson(client2, path, body) {
   const c = client2;
   if (typeof c.post !== "function") {
@@ -738,6 +797,19 @@ server.tool(
   },
   async (input) => getRecentStaleEdges(client, { ...input, project: projectFor(input) })
 );
+server.tool(
+  "get_divergences",
+  "Returns places where what the code declares (EXTRACTED) doesn't match what production observed (OBSERVED). The single most NEAT-shaped query \u2014 the one that justifies the whole graph. Use when the user asks 'is anything weird?' or 'what does production do that the code doesn't?' or 'find me a bug' on an unfamiliar codebase. Returns divergences ranked by confidence \xD7 severity. Prefer this over `get_root_cause` when no specific node is failing.",
+  {
+    type: z.array(DivergenceTypeSchema).optional().describe(
+      "Filter by divergence type. One or more of: missing-observed, missing-extracted, version-mismatch, host-mismatch, compat-violation. Omit for all."
+    ),
+    minConfidence: z.number().min(0).max(1).optional().describe("Drop divergences below this confidence threshold (0.0 - 1.0)."),
+    node: z.string().optional().describe("Scope to divergences involving this node id (as source or target)."),
+    project: projectField
+  },
+  async (input) => getDivergences(client, { ...input, project: projectFor(input) })
+);
 server.tool(
   "check_policies",
   "Inspect or dry-run the project's policy.json. Without hypotheticalAction, returns currently-recorded violations. With hypotheticalAction, returns violations that would result if the action were applied. Architectural assertions in five shapes (structural / compatibility / provenance / ownership / blast-radius).",

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/client.ts","../src/resources.ts","../src/tools.ts","../src/format.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js'\nimport { z } from 'zod'\nimport { CheckPoliciesScopeSchema, HypotheticalActionSchema } from '@neat.is/types'\nimport { createHttpClient } from './client.js'\nimport { registerResources } from './resources.js'\nimport {\n  checkPolicies,\n  getBlastRadius,\n  getDependencies,\n  getGraphDiff,\n  getIncidentHistory,\n  getObservedDependencies,\n  getRecentStaleEdges,\n  getRootCause,\n  semanticSearch,\n} from './tools.js'\n\nconst baseUrl = process.env.NEAT_CORE_URL ?? 'http://localhost:8080'\nconst client = createHttpClient(baseUrl)\n\n// `NEAT_DEFAULT_PROJECT` is the implicit project for tool calls that don't\n// pass a `project` arg. Unset means \"use the core's `default` project\" — we\n// route those calls through the legacy unprefixed URL so an older core (one\n// that predates #83) still gets the request it expects.\nconst defaultProject = process.env.NEAT_DEFAULT_PROJECT\nconst projectFor = (input: { project?: string }): string | undefined =>\n  input.project ?? defaultProject\n\nconst projectField = z\n  .string()\n  .optional()\n  .describe(\n    'Project name when the core hosts more than one (set NEAT_PROJECTS=...). Omit to use the default project.',\n  )\n\nconst server = new McpServer({\n  name: 'neat',\n  version: '0.1.0',\n})\n\nserver.tool(\n  'get_root_cause',\n  'Trace a failing node up its dependency graph to find the underlying cause. Use this when something is breaking and you want to know which upstream component is the actual culprit.',\n  {\n    errorNode: z\n      .string()\n      .describe('Graph node id where the error surfaced, e.g. \"database:payments-db\"'),\n    errorId: z\n      .string()\n      .optional()\n      .describe('Specific error event id from incident history; if set, the result is coloured with that error message'),\n    project: projectField,\n  },\n  async (input) => getRootCause(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_blast_radius',\n  'List every node downstream of the given node — what would break if this node failed or was redeployed.',\n  {\n    nodeId: z.string().describe('Graph node id to compute blast radius from'),\n    depth: z\n      .number()\n      .int()\n      .nonnegative()\n      .max(20)\n      .optional()\n      .describe('Max BFS depth (default 10)'),\n    project: projectField,\n  },\n  async (input) => getBlastRadius(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_dependencies',\n  'List the transitive outgoing dependencies of a node, BFS to depth N (default 3, max 10). Each result carries distance, edge type, and provenance — both static (EXTRACTED) and runtime (OBSERVED). Pass depth=1 for direct-only.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    depth: z\n      .number()\n      .int()\n      .min(1)\n      .max(10)\n      .optional()\n      .describe('BFS depth (default 3, max 10). depth=1 returns direct dependencies only.'),\n    project: projectField,\n  },\n  async (input) => getDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_observed_dependencies',\n  'List only the runtime (OBSERVED via OTel) outgoing dependencies of a node. Use this to compare what code SAYS the service depends on vs what production actually does.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    project: projectField,\n  },\n  async (input) => getObservedDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_incident_history',\n  'Return recent OTel error events recorded against a node, most recent first.',\n  {\n    nodeId: z.string().describe('Graph node id to query'),\n    limit: z.number().int().positive().max(100).optional().describe('Max events to return (default 20)'),\n    project: projectField,\n  },\n  async (input) => getIncidentHistory(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'semantic_search',\n  'Search nodes by natural-language query. Uses embedding vectors when an embedder is available (Ollama nomic-embed-text → in-process MiniLM → substring fallback) — phrase the query the way you would describe what you want.',\n  {\n    query: z.string().describe('Free-text query, e.g. \"service handling checkout payments\"'),\n    project: projectField,\n  },\n  async (input) => semanticSearch(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_graph_diff',\n  'Diff a saved graph snapshot against the current live graph. Useful for change reviews and post-incidents — answers \"what changed in the architecture between then and now.\" Returns added/removed/changed nodes and edges with both snapshot timestamps.',\n  {\n    againstSnapshot: z\n      .string()\n      .describe(\n        'Path or http(s) URL of the snapshot to diff against (the \"before\" state). The current graph is the \"after\".',\n      ),\n    project: projectField,\n  },\n  async (input) => getGraphDiff(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_recent_stale_edges',\n  'List the most recent OBSERVED → STALE edge transitions. Use this to spot integrations that have gone quiet — a CALLS edge that just went stale typically means an upstream stopped calling, not that the link is healthy.',\n  {\n    limit: z\n      .number()\n      .int()\n      .positive()\n      .max(200)\n      .optional()\n      .describe('Max events to return (default 50)'),\n    edgeType: z\n      .string()\n      .optional()\n      .describe('Filter by edge type — e.g. \"CALLS\" or \"CONNECTS_TO\"'),\n    project: projectField,\n  },\n  async (input) => getRecentStaleEdges(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'check_policies',\n  'Inspect or dry-run the project\\'s policy.json. Without hypotheticalAction, returns currently-recorded violations. With hypotheticalAction, returns violations that would result if the action were applied. Architectural assertions in five shapes (structural / compatibility / provenance / ownership / blast-radius).',\n  {\n    scope: CheckPoliciesScopeSchema.optional().describe(\n      'Narrow to a subset. Default \"all\".',\n    ),\n    hypotheticalAction: HypotheticalActionSchema.optional().describe(\n      'Dry-run mode: simulate the action and return resulting violations. Omit for current state.',\n    ),\n    project: projectField,\n  },\n  async (input) =>\n    checkPolicies(client, {\n      ...input,\n      project: projectFor(input),\n    } as Parameters<typeof checkPolicies>[1]),\n)\n\n// Resources sit alongside tools — same data, different access pattern. Read\n// the per-node resource for raw attrs+edges JSON; subscribe to the incidents\n// resource to be notified when new errors land. The eight tools above are\n// unchanged.\nconst incidentsPollMs = process.env.NEAT_RESOURCE_POLL_MS\n  ? Number(process.env.NEAT_RESOURCE_POLL_MS)\n  : undefined\nconst resourceRegistration = registerResources(server, client, {\n  ...(incidentsPollMs !== undefined ? { incidentsPollMs } : {}),\n  ...(defaultProject ? { project: defaultProject } : {}),\n})\n\nasync function main(): Promise<void> {\n  const transport = new StdioServerTransport()\n  await server.connect(transport)\n}\n\nconst stopPolling = (): void => {\n  resourceRegistration.stop()\n}\nprocess.on('SIGTERM', stopPolling)\nprocess.on('SIGINT', stopPolling)\n\nmain().catch((err) => {\n  console.error(err)\n  process.exit(1)\n})\n","// Thin HTTP client for the neat-core REST surface. Tools call out via this\n// instead of fetch() directly so tests can swap in a stub implementation\n// without monkey-patching globals.\n\nexport interface HttpClient {\n  get<T>(path: string): Promise<T>\n  // POST is optional on the interface so test stubs that only need GET don't\n  // have to implement it. Production createHttpClient always provides it.\n  post?<T>(path: string, body: unknown): Promise<T>\n}\n\nexport function createHttpClient(baseUrl: string): HttpClient {\n  const root = baseUrl.replace(/\\/$/, '')\n  return {\n    async get<T>(path: string): Promise<T> {\n      const res = await fetch(`${root}${path}`)\n      if (!res.ok) {\n        const body = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on GET ${path}: ${body}`)\n      }\n      return (await res.json()) as T\n    },\n    async post<T>(path: string, body: unknown): Promise<T> {\n      const res = await fetch(`${root}${path}`, {\n        method: 'POST',\n        headers: { 'content-type': 'application/json' },\n        body: JSON.stringify(body),\n      })\n      if (!res.ok) {\n        const text = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on POST ${path}: ${text}`)\n      }\n      return (await res.json()) as T\n    },\n  }\n}\n\nexport class HttpError extends Error {\n  constructor(\n    public readonly status: number,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'HttpError'\n  }\n}\n","// MCP Resources — additive surface alongside the eight tools. Two resources:\n//\n//   neat://node/<id>          — one resource per graph node. Read returns the\n//                                node attributes plus its outbound edges.\n//   neat://incidents/recent   — most recent error events. Pollable by the SDK\n//                                via subscribe; we send `notifications/resources/\n//                                updated` when /incidents grows.\n//\n// Pure read helpers are exported so tests can exercise them without spinning up\n// an MCP transport. `registerResources()` does the SDK wiring + the poll loop.\n\nimport type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport {\n  ResourceTemplate,\n} from '@modelcontextprotocol/sdk/server/mcp.js'\nimport type {\n  ListResourcesResult,\n  ReadResourceResult,\n} from '@modelcontextprotocol/sdk/types.js'\nimport type { ErrorEvent, GraphEdge, GraphNode, PolicyViolation } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\ninterface SerializedGraph {\n  nodes: GraphNode[]\n  edges: GraphEdge[]\n}\n\nconst NODE_RESOURCE_MIME = 'application/json'\nconst INCIDENTS_URI = 'neat://incidents/recent'\nconst INCIDENTS_DEFAULT_LIMIT = 50\nconst POLICY_VIOLATIONS_URI = 'neat://policies/violations'\nconst POLICY_VIOLATIONS_DEFAULT_LIMIT = 100\n\nfunction nodeUri(id: string): string {\n  // Node ids contain `:` which RFC 6570 percent-encodes; doing it explicitly\n  // here keeps the URI we hand the SDK identical to what `list` produces.\n  return `neat://node/${encodeURIComponent(id)}`\n}\n\n// Project-aware URL prefix for the underlying core. When unset, hit the\n// legacy unprefixed routes (which the core resolves to project=`default`).\nfunction corePrefix(project: string | undefined): string {\n  return project ? `/projects/${encodeURIComponent(project)}` : ''\n}\n\nfunction nameFromAttrs(attrs: GraphNode): string {\n  return (attrs as { name?: string }).name ?? attrs.id\n}\n\nexport async function listNodeResources(\n  client: HttpClient,\n  project?: string,\n): Promise<ListResourcesResult> {\n  const graph = await client.get<SerializedGraph>(`${corePrefix(project)}/graph`)\n  return {\n    resources: graph.nodes.map((n) => ({\n      uri: nodeUri(n.id),\n      name: nameFromAttrs(n),\n      description: `${n.type} — ${nameFromAttrs(n)}`,\n      mimeType: NODE_RESOURCE_MIME,\n    })),\n  }\n}\n\nexport async function readNodeResource(\n  client: HttpClient,\n  id: string,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const uri = nodeUri(id)\n  const prefix = corePrefix(project)\n  try {\n    const [attrs, edges] = await Promise.all([\n      client.get<GraphNode>(`${prefix}/graph/node/${encodeURIComponent(id)}`),\n      client.get<EdgesResponse>(`${prefix}/graph/edges/${encodeURIComponent(id)}`),\n    ])\n    const body = {\n      node: attrs,\n      // Outbound only — the issue spec says \"attrs + outbound edges\". Inbound\n      // edges are still reachable via the other endpoint and would double the\n      // payload for hub nodes (e.g. a shared database).\n      outboundEdges: edges.outbound,\n    }\n    return {\n      contents: [\n        {\n          uri,\n          mimeType: NODE_RESOURCE_MIME,\n          text: JSON.stringify(body, null, 2),\n        },\n      ],\n    }\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return {\n        contents: [\n          {\n            uri,\n            mimeType: NODE_RESOURCE_MIME,\n            text: JSON.stringify({ error: 'node not found', id }),\n          },\n        ],\n      }\n    }\n    throw err\n  }\n}\n\nexport async function readPolicyViolationsResource(\n  client: HttpClient,\n  limit: number = POLICY_VIOLATIONS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const violations = await client.get<PolicyViolation[]>(\n    `${corePrefix(project)}/policies/violations`,\n  )\n  // Latest first; cap at limit so an exploding violations log doesn't blow\n  // up the resource read. The full file is still on disk for forensic use.\n  const ordered = [...violations].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: POLICY_VIOLATIONS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: violations.length, violations: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\nexport async function readRecentIncidentsResource(\n  client: HttpClient,\n  limit: number = INCIDENTS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n  // ndjson order is append-time = oldest first. Reverse so most-recent leads.\n  const ordered = [...events].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: INCIDENTS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: events.length, events: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\n// Pure helper so the poll loop can be tested without timers. Returns true when\n// the visible state of /incidents has changed in a way subscribers should hear\n// about. Compares total count + the id of the newest event — either is enough\n// on its own, but the pair makes deletes (if they ever happen) survive a\n// missed update.\nexport function incidentsChanged(\n  prev: { total: number; lastId?: string } | null,\n  next: { total: number; lastId?: string },\n): boolean {\n  if (!prev) return false // first observation seeds, doesn't notify\n  if (prev.total !== next.total) return true\n  if (prev.lastId !== next.lastId) return true\n  return false\n}\n\nexport interface RegisterResourcesOptions {\n  // Poll interval for /incidents in ms. 5s by default; 0 disables polling.\n  incidentsPollMs?: number\n  // Project this MCP instance reports against. Unset → core's `default`\n  // project via the legacy unprefixed URLs.\n  project?: string\n}\n\nexport interface ResourceRegistration {\n  // Stops the poll loop. The SDK keeps the registered resources around as\n  // long as the server is alive — calling stop() doesn't unregister them.\n  stop: () => void\n}\n\nexport function registerResources(\n  server: McpServer,\n  client: HttpClient,\n  options: RegisterResourcesOptions = {},\n): ResourceRegistration {\n  const pollMs = options.incidentsPollMs ?? 5000\n  const project = options.project\n\n  // neat://node/<id> — templated. The list callback enumerates current nodes;\n  // the read callback resolves a specific id.\n  server.registerResource(\n    'graph-node',\n    new ResourceTemplate('neat://node/{id}', {\n      list: async () => listNodeResources(client, project),\n    }),\n    {\n      description:\n        'A single graph node by id. Reading returns the node attributes plus its outbound edges as JSON.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async (_uri, variables) => {\n      const raw = variables.id\n      const id = Array.isArray(raw) ? raw[0] : raw\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new Error('neat://node/{id} requires an id')\n      }\n      const decoded = id.includes('%') ? decodeURIComponent(id) : id\n      return readNodeResource(client, decoded, project)\n    },\n  )\n\n  // neat://incidents/recent — static. Subscribers get notifications/resources/\n  // updated on each tick where /incidents has changed.\n  server.registerResource(\n    'incidents-recent',\n    INCIDENTS_URI,\n    {\n      description:\n        'Most recent error events recorded by neat-core, newest first. JSON: { count, total, events[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readRecentIncidentsResource(client, INCIDENTS_DEFAULT_LIMIT, project),\n  )\n\n  // neat://policies/violations — static. Same poll-and-notify pattern as\n  // incidents. Subscribers get resource-updated notifications when the\n  // policy-violations.ndjson grows. ADR-045.\n  server.registerResource(\n    'policies-violations',\n    POLICY_VIOLATIONS_URI,\n    {\n      description:\n        'Current policy violations from policy-violations.ndjson, newest first. JSON: { count, total, violations[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readPolicyViolationsResource(client, POLICY_VIOLATIONS_DEFAULT_LIMIT, project),\n  )\n\n  let stopped = false\n  let timer: NodeJS.Timeout | null = null\n  let lastIncidents: { total: number; lastId?: string } | null = null\n  let lastViolations: { total: number; lastId?: string } | null = null\n\n  const tick = async (): Promise<void> => {\n    if (stopped) return\n    // Incidents poll.\n    try {\n      const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n      const next = {\n        total: events.length,\n        lastId: events.length > 0 ? events[events.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastIncidents, next)) {\n        await server.server.sendResourceUpdated({ uri: INCIDENTS_URI }).catch(() => {})\n      }\n      lastIncidents = next\n    } catch {\n      // Core down — keep polling, next tick will catch up.\n    }\n    // Policy-violations poll. Fires the alert action's notifications/\n    // resources/updated for neat://policies/violations subscribers per\n    // ADR-044 §alert. Same change-detection shape as incidents.\n    try {\n      const violations = await client.get<PolicyViolation[]>(\n        `${corePrefix(project)}/policies/violations`,\n      )\n      const next = {\n        total: violations.length,\n        lastId:\n          violations.length > 0 ? violations[violations.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastViolations, next)) {\n        await server.server\n          .sendResourceUpdated({ uri: POLICY_VIOLATIONS_URI })\n          .catch(() => {})\n      }\n      lastViolations = next\n    } catch {\n      // Core down or no policies yet — keep polling.\n    }\n  }\n\n  if (pollMs > 0) {\n    // Seed `last` on first tick so we don't fire an \"updated\" notification\n    // when the server first comes up.\n    timer = setInterval(() => {\n      void tick()\n    }, pollMs)\n    if (typeof timer.unref === 'function') timer.unref()\n  }\n\n  return {\n    stop: (): void => {\n      stopped = true\n      if (timer) clearInterval(timer)\n      timer = null\n    },\n  }\n}\n","// Tool implementations. Each one takes an HttpClient + the validated input and\n// returns an MCP CallToolResult routed through formatToolResponse for the\n// three-part shape (NL + structured + footer) per ADR-039 / contract #12.\n// Keeping these as pure functions of (client, input) means tests don't need a\n// running server — just a stub client that returns canned JSON.\n\nimport type {\n  BlastRadiusAffectedNode,\n  BlastRadiusResult,\n  ErrorEvent,\n  GraphEdge,\n  GraphNode,\n  HypotheticalAction,\n  PolicyViolation,\n  RootCauseResult,\n  TransitiveDependenciesResult,\n} from '@neat.is/types'\nimport { Provenance } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\nimport {\n  formatEmptyResponse,\n  formatErrorResponse,\n  formatToolResponse,\n  type ToolResponse,\n} from './format.js'\n\nexport type { ToolResponse } from './format.js'\n\n// Project-aware path builder. When `project` is set, route through\n// /projects/<name>/...; otherwise hit the legacy root URL (which the core\n// resolves to project=`default`). Keeping the legacy path means callers\n// running an older core still talk to a known route.\nfunction projectPath(project: string | undefined, suffix: string): string {\n  if (!project) return suffix\n  return `/projects/${encodeURIComponent(project)}${suffix}`\n}\n\n// Most tools want \"node missing → friendly message, anything else → real error\".\nasync function withMissingNodeFallback(\n  fn: () => Promise<ToolResponse>,\n  notFoundMessage: string,\n): Promise<ToolResponse> {\n  try {\n    return await fn()\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return formatEmptyResponse(notFoundMessage)\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface RootCauseInput {\n  errorNode: string\n  errorId?: string\n  project?: string\n}\n\nexport async function getRootCause(client: HttpClient, input: RootCauseInput): Promise<ToolResponse> {\n  const qs = input.errorId ? `?errorId=${encodeURIComponent(input.errorId)}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/root-cause/${encodeURIComponent(input.errorNode)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<RootCauseResult>(path)\n    const arrowPath = result.traversalPath.join(' ← ')\n    const provenances = result.edgeProvenances.length\n      ? result.edgeProvenances.join(', ')\n      : '(direct, no edges traversed)'\n    const summary =\n      `Root cause for ${input.errorNode} is ${result.rootCauseNode}. ` +\n      result.rootCauseReason +\n      (result.fixRecommendation ? ` Recommended fix: ${result.fixRecommendation}.` : '')\n    const blockLines = [\n      `Traversal path: ${arrowPath}`,\n      `Edge provenances: ${provenances}`,\n    ]\n    if (result.fixRecommendation) {\n      blockLines.push(`Recommended fix: ${result.fixRecommendation}`)\n    }\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      confidence: result.confidence,\n      provenance: result.edgeProvenances.length ? result.edgeProvenances : undefined,\n    })\n  }, `No root cause found for ${input.errorNode}. The node may be healthy, or it may not exist in the graph.`)\n}\n\nexport interface BlastRadiusInput {\n  nodeId: string\n  depth?: number\n  project?: string\n}\n\nexport async function getBlastRadius(\n  client: HttpClient,\n  input: BlastRadiusInput,\n): Promise<ToolResponse> {\n  const qs = input.depth !== undefined ? `?depth=${input.depth}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/blast-radius/${encodeURIComponent(input.nodeId)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<BlastRadiusResult>(path)\n    if (result.totalAffected === 0) {\n      return formatEmptyResponse(\n        `${result.origin} has no downstream dependencies. Nothing else would break if it failed.`,\n      )\n    }\n    const sorted = [...result.affectedNodes].sort(\n      (a, b) => a.distance - b.distance || a.nodeId.localeCompare(b.nodeId),\n    )\n    const blockLines = sorted.map(formatBlastEntry)\n    // Worst-case confidence — the path with the lowest cascaded confidence\n    // is the headline number; agents should treat this as \"what's the\n    // weakest reachability NEAT actually knows about?\"\n    const minConfidence = sorted.reduce(\n      (m, n) => Math.min(m, n.confidence),\n      Number.POSITIVE_INFINITY,\n    )\n    const provenances = [...new Set(sorted.map((n) => n.edgeProvenance))]\n    return formatToolResponse({\n      summary: `Blast radius for ${result.origin}: ${result.totalAffected} affected node${result.totalAffected === 1 ? '' : 's'} reachable downstream.`,\n      block: blockLines.join('\\n'),\n      confidence: Number.isFinite(minConfidence) ? minConfidence : undefined,\n      provenance: provenances.length ? provenances : undefined,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction formatBlastEntry(n: BlastRadiusAffectedNode): string {\n  const tag = n.edgeProvenance === Provenance.STALE ? ' [STALE — last seen too long ago]' : ''\n  return `  • ${n.nodeId} (distance ${n.distance}, ${n.edgeProvenance})${tag}`\n}\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\nexport interface DependenciesInput {\n  nodeId: string\n  // BFS depth. Default 3; max 10. Direct-only consumers pass 1.\n  depth?: number\n  project?: string\n}\n\n// Transitive get_dependencies (issue #144). Calls the new core endpoint\n// /graph/node/:id/dependencies?depth=N which BFS-walks outbound. The output\n// groups results by hop so direct dependencies stand out from transitives —\n// agents asked \"what does X depend on?\" usually want the direct list with\n// transitives as context.\nexport async function getDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  const depth = input.depth ?? 3\n  const path = projectPath(\n    input.project,\n    `/graph/node/${encodeURIComponent(input.nodeId)}/dependencies?depth=${depth}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<TransitiveDependenciesResult>(path)\n    if (result.total === 0) {\n      return formatEmptyResponse(\n        depth === 1\n          ? `${input.nodeId} has no direct dependencies in the graph.`\n          : `${input.nodeId} has no dependencies (BFS to depth ${depth}).`,\n      )\n    }\n    // Group by distance so the structured block reads as concentric rings.\n    const byDistance = new Map<number, typeof result.dependencies>()\n    for (const dep of result.dependencies) {\n      const ring = byDistance.get(dep.distance) ?? []\n      ring.push(dep)\n      byDistance.set(dep.distance, ring)\n    }\n    const blockLines: string[] = []\n    for (const distance of [...byDistance.keys()].sort((a, b) => a - b)) {\n      const label = distance === 1 ? 'Direct (distance 1)' : `Distance ${distance}`\n      blockLines.push(`${label}:`)\n      for (const dep of byDistance.get(distance)!) {\n        blockLines.push(`  • ${dep.nodeId} — ${dep.edgeType} (${dep.provenance})`)\n      }\n    }\n    const provenances = [...new Set(result.dependencies.map((d) => d.provenance))]\n    const directCount = byDistance.get(1)?.length ?? 0\n    const summary =\n      depth === 1\n        ? `${input.nodeId} has ${directCount} direct dependenc${directCount === 1 ? 'y' : 'ies'}.`\n        : `${input.nodeId} has ${result.total} dependenc${result.total === 1 ? 'y' : 'ies'} reachable to depth ${depth} (${directCount} direct).`\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      provenance: provenances,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport async function getObservedDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const edges = await client.get<EdgesResponse>(\n      projectPath(input.project, `/graph/edges/${encodeURIComponent(input.nodeId)}`),\n    )\n    const observed = edges.outbound.filter((e) => e.provenance === Provenance.OBSERVED)\n    if (observed.length === 0) {\n      const hasExtracted = edges.outbound.some((e) => e.provenance === Provenance.EXTRACTED)\n      const note = hasExtracted\n        ? ' Static (EXTRACTED) dependencies exist but no runtime traffic has been seen — is OTel running?'\n        : ''\n      return formatEmptyResponse(`No OBSERVED dependencies for ${input.nodeId}.${note}`)\n    }\n    const blockLines = observed.map((e) => `  • ${e.target} — ${e.type}${edgeMeta(e)}`)\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${observed.length} runtime dependenc${observed.length === 1 ? 'y' : 'ies'} confirmed by OTel.`,\n      block: blockLines.join('\\n'),\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction edgeMeta(e: GraphEdge): string {\n  const bits: string[] = []\n  if (e.signal) {\n    // Prefer the runtime signal numbers — \"saw 1,247 calls, 3 errors\" reads\n    // better than a derived 0.94 confidence.\n    bits.push(`spans=${e.signal.spanCount}`)\n    if (e.signal.errorCount > 0) bits.push(`errors=${e.signal.errorCount}`)\n    if (e.signal.lastObservedAgeMs !== undefined) {\n      bits.push(`age=${formatDuration(e.signal.lastObservedAgeMs)}`)\n    }\n  } else if (e.callCount !== undefined) {\n    bits.push(`callCount=${e.callCount}`)\n  }\n  if (e.lastObserved) bits.push(`lastObserved=${e.lastObserved}`)\n  if (e.confidence !== undefined) bits.push(`confidence=${e.confidence}`)\n  return bits.length ? ` [${bits.join(', ')}]` : ''\n}\n\nfunction formatDuration(ms: number): string {\n  if (ms < 1000) return `${Math.round(ms)}ms`\n  const s = Math.round(ms / 1000)\n  if (s < 60) return `${s}s`\n  const m = Math.round(s / 60)\n  if (m < 60) return `${m}m`\n  const h = Math.round(m / 60)\n  if (h < 48) return `${h}h`\n  return `${Math.round(h / 24)}d`\n}\n\nexport interface IncidentHistoryInput {\n  nodeId: string\n  limit?: number\n  project?: string\n}\n\nexport async function getIncidentHistory(\n  client: HttpClient,\n  input: IncidentHistoryInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const events = await client.get<ErrorEvent[]>(\n      projectPath(input.project, `/incidents/${encodeURIComponent(input.nodeId)}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(`No incidents recorded against ${input.nodeId}.`)\n    }\n    // ndjson order is append-time = oldest first. Reverse so the most recent\n    // event leads, then trim to the requested limit.\n    const ordered = [...events].reverse().slice(0, input.limit ?? 20)\n    const blockLines: string[] = []\n    for (const ev of ordered) {\n      blockLines.push(`  ${ev.timestamp} — ${ev.service}: ${ev.errorMessage}`)\n      blockLines.push(`    trace=${ev.traceId} span=${ev.spanId}`)\n    }\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${events.length} recorded incident${events.length === 1 ? '' : 's'}; showing the ${ordered.length} most recent.`,\n      block: blockLines.join('\\n'),\n      // ErrorEvents are observation records, not graph edges — provenance is\n      // OBSERVED by definition (the OTel span happened).\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport interface SemanticSearchInput {\n  query: string\n  project?: string\n}\n\ninterface SearchResponse {\n  query: string\n  provider?: 'ollama' | 'transformers' | 'substring'\n  matches: (GraphNode & { score?: number })[]\n}\n\nexport async function semanticSearch(\n  client: HttpClient,\n  input: SemanticSearchInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<SearchResponse>(\n      projectPath(input.project, `/search?q=${encodeURIComponent(input.query)}`),\n    )\n    if (result.matches.length === 0) {\n      return formatEmptyResponse(`No matches for \"${input.query}\".`)\n    }\n    const provider = result.provider ?? 'substring'\n    const blockLines: string[] = []\n    let topScore: number | undefined\n    for (const n of result.matches) {\n      // Embedding tiers attach a cosine score in [0,1]; substring fallback\n      // doesn't, so we elide the score when it's the placeholder 1.\n      const score = provider !== 'substring' && typeof n.score === 'number' ? n.score : undefined\n      const scoreBit = score !== undefined ? ` [score=${score.toFixed(2)}]` : ''\n      if (score !== undefined && (topScore === undefined || score > topScore)) topScore = score\n      blockLines.push(\n        `  • ${n.id} (${n.type}) — ${(n as { name?: string }).name ?? n.id}${scoreBit}`,\n      )\n    }\n    return formatToolResponse({\n      summary: `Found ${result.matches.length} match${result.matches.length === 1 ? '' : 'es'} for \"${input.query}\" via ${provider} provider.`,\n      block: blockLines.join('\\n'),\n      // Top similarity score doubles as a \"how confident is the embedder\n      // about the best match\" signal. Substring provider returns no score —\n      // the footer shows n/a in that case.\n      confidence: topScore,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface GraphDiffInput {\n  againstSnapshot: string\n  project?: string\n}\n\ninterface GraphDiffResponse {\n  base: { exportedAt?: string }\n  current: { exportedAt: string }\n  added: { nodes: GraphNode[]; edges: GraphEdge[] }\n  removed: { nodes: GraphNode[]; edges: GraphEdge[] }\n  changed: {\n    nodes: { id: string; before: GraphNode; after: GraphNode }[]\n    edges: { id: string; before: GraphEdge; after: GraphEdge }[]\n  }\n}\n\nexport async function getGraphDiff(\n  client: HttpClient,\n  input: GraphDiffInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<GraphDiffResponse>(\n      projectPath(\n        input.project,\n        `/graph/diff?against=${encodeURIComponent(input.againstSnapshot)}`,\n      ),\n    )\n    const total =\n      result.added.nodes.length +\n      result.added.edges.length +\n      result.removed.nodes.length +\n      result.removed.edges.length +\n      result.changed.nodes.length +\n      result.changed.edges.length\n    const baseLabel = result.base.exportedAt ?? 'unknown'\n    if (total === 0) {\n      return formatEmptyResponse(\n        `No differences between the current graph and ${input.againstSnapshot} (base exportedAt=${baseLabel}).`,\n      )\n    }\n    const blockLines: string[] = [\n      `  base exportedAt:    ${baseLabel}`,\n      `  current exportedAt: ${result.current.exportedAt}`,\n      '',\n    ]\n    if (result.added.nodes.length || result.added.edges.length) {\n      blockLines.push('Added:')\n      for (const n of result.added.nodes) blockLines.push(`  + node ${n.id} (${n.type})`)\n      for (const e of result.added.edges)\n        blockLines.push(`  + edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.removed.nodes.length || result.removed.edges.length) {\n      blockLines.push('Removed:')\n      for (const n of result.removed.nodes) blockLines.push(`  - node ${n.id} (${n.type})`)\n      for (const e of result.removed.edges)\n        blockLines.push(`  - edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.changed.nodes.length || result.changed.edges.length) {\n      blockLines.push('Changed:')\n      for (const c of result.changed.nodes) {\n        blockLines.push(`  ~ node ${c.id} — ${summariseAttrDiff(c.before, c.after)}`)\n      }\n      for (const c of result.changed.edges) {\n        const provBit =\n          c.before.provenance !== c.after.provenance\n            ? `provenance ${c.before.provenance} → ${c.after.provenance}`\n            : summariseAttrDiff(c.before, c.after)\n        blockLines.push(`  ~ edge ${c.id} — ${provBit}`)\n      }\n    }\n    return formatToolResponse({\n      summary: `Diff against ${input.againstSnapshot}: ${total} change${total === 1 ? '' : 's'} between the snapshot and the live graph.`,\n      block: blockLines.join('\\n').trimEnd(),\n      // Diff results don't have a per-result provenance — the diff spans\n      // every edge type and provenance kind. Footer shows n/a.\n    })\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 400) {\n      return formatErrorResponse(\n        `Could not load snapshot ${input.againstSnapshot}: ${err.message}`,\n      )\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nfunction summariseAttrDiff(\n  before: Record<string, unknown>,\n  after: Record<string, unknown>,\n): string {\n  const keys = new Set([...Object.keys(before), ...Object.keys(after)])\n  const changed: string[] = []\n  for (const k of keys) {\n    if (JSON.stringify(before[k]) !== JSON.stringify(after[k])) changed.push(k)\n  }\n  return changed.length === 0\n    ? 'attributes differ'\n    : `fields changed: ${changed.sort().join(', ')}`\n}\n\nexport interface RecentStaleEdgesInput {\n  limit?: number\n  edgeType?: string\n  project?: string\n}\n\ninterface StaleEventResponse {\n  edgeId: string\n  source: string\n  target: string\n  edgeType: string\n  thresholdMs: number\n  ageMs: number\n  lastObserved: string\n  transitionedAt: string\n}\n\nexport async function getRecentStaleEdges(\n  client: HttpClient,\n  input: RecentStaleEdgesInput,\n): Promise<ToolResponse> {\n  const params = new URLSearchParams()\n  if (input.limit !== undefined) params.set('limit', String(input.limit))\n  if (input.edgeType) params.set('edgeType', input.edgeType)\n  const qs = params.size > 0 ? `?${params.toString()}` : ''\n\n  try {\n    const events = await client.get<StaleEventResponse[]>(\n      projectPath(input.project, `/incidents/stale${qs}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(\n        input.edgeType\n          ? `No stale ${input.edgeType} edges recorded.`\n          : 'No stale-edge transitions recorded yet.',\n      )\n    }\n    const blockLines = events.map(\n      (e) =>\n        `  ${e.transitionedAt} — ${e.source} -[${e.edgeType}]-> ${e.target}` +\n        ` (last seen ${e.lastObserved}, threshold ${formatDuration(e.thresholdMs)})`,\n    )\n    return formatToolResponse({\n      summary: `${events.length} stale-edge transition${events.length === 1 ? '' : 's'} recorded${input.edgeType ? ` for ${input.edgeType}` : ''}.`,\n      block: blockLines.join('\\n'),\n      // STALE by definition — every event is a transition into STALE.\n      provenance: Provenance.STALE,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface CheckPoliciesInput {\n  // 'all' (default) returns every current violation. 'unresolved' is reserved\n  // for future resolution tracking — for the MVP it behaves the same as 'all'.\n  // { policyId } narrows to violations of one named policy.\n  scope?: 'all' | 'unresolved' | { policyId: string }\n  // When provided, dry-run evaluation: return violations that *would* result\n  // if the action were applied. Without it, return current violations.\n  hypotheticalAction?: HypotheticalAction\n  project?: string\n}\n\ninterface PoliciesCheckResponse {\n  allowed: boolean\n  hypotheticalAction?: HypotheticalAction\n  violations: PolicyViolation[]\n}\n\n// check_policies — single MCP tool covering both state-read and dry-run modes\n// per ADR-045. The contract explicitly rejects the audit's two-tool split\n// (evaluate_policy + get_policy_violations); both modes route through here.\nexport async function checkPolicies(\n  client: HttpClient,\n  input: CheckPoliciesInput,\n): Promise<ToolResponse> {\n  try {\n    let violations: PolicyViolation[]\n    let allowed = true\n    let hypothetical: HypotheticalAction | undefined\n\n    if (input.hypotheticalAction) {\n      // Dry-run via POST /policies/check.\n      const body = await postJson<PoliciesCheckResponse>(\n        client,\n        projectPath(input.project, '/policies/check'),\n        { hypotheticalAction: input.hypotheticalAction },\n      )\n      violations = body.violations\n      allowed = body.allowed\n      hypothetical = body.hypotheticalAction\n    } else {\n      // State read via GET /policies/violations. Optional scope filters via\n      // ?policyId=, severity isn't surfaced in the tool input today.\n      const qsParams = new URLSearchParams()\n      if (typeof input.scope === 'object' && 'policyId' in input.scope) {\n        qsParams.set('policyId', input.scope.policyId)\n      }\n      const qs = qsParams.size > 0 ? `?${qsParams.toString()}` : ''\n      violations = await client.get<PolicyViolation[]>(\n        projectPath(input.project, `/policies/violations${qs}`),\n      )\n      allowed = violations.every((v) => v.onViolation !== 'block')\n    }\n\n    if (violations.length === 0) {\n      return formatEmptyResponse(\n        hypothetical\n          ? `No violations would result from the hypothetical action (${hypothetical.kind}).`\n          : 'No policy violations recorded.',\n      )\n    }\n\n    const blockCount = violations.filter((v) => v.onViolation === 'block').length\n    const summaryParts: string[] = []\n    if (hypothetical) {\n      summaryParts.push(\n        `Hypothetical ${hypothetical.kind} would surface ${violations.length} violation${violations.length === 1 ? '' : 's'}`,\n      )\n    } else {\n      summaryParts.push(\n        `${violations.length} policy violation${violations.length === 1 ? '' : 's'} currently recorded`,\n      )\n    }\n    if (blockCount > 0) {\n      summaryParts.push(`${blockCount} of which block`)\n    }\n    if (!allowed && hypothetical) {\n      summaryParts.push('action denied')\n    }\n    const summary = summaryParts.join('; ') + '.'\n\n    const blockLines = violations.map((v) => {\n      const subject = v.subject.nodeId ?? v.subject.edgeId ?? v.subject.path?.[0] ?? '(global)'\n      return `  • [${v.severity}/${v.onViolation}] ${v.policyName}: ${v.message} — ${subject}`\n    })\n    const severities = [...new Set(violations.map((v) => v.severity))]\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      // Confidence: hypothetical results inherit a 0.7 cap (the engine\n      // can't fully simulate every action shape in MVP); confirmed\n      // violations report 1.00 since the engine ran against current state.\n      confidence: hypothetical ? 0.7 : 1,\n      provenance: severities.join(' '),\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nasync function postJson<T>(\n  client: HttpClient,\n  path: string,\n  body: unknown,\n): Promise<T> {\n  // The base HttpClient interface only exposes get(). For POST we need to\n  // reach into the underlying transport. Most callers pass the client built\n  // by createHttpClient which has post; types are kept minimal so test\n  // stubs don't have to implement post unless the tool needs it.\n  const c = client as HttpClient & { post?: <U>(p: string, b: unknown) => Promise<U> }\n  if (typeof c.post !== 'function') {\n    throw new Error('HttpClient does not support POST — required for check_policies dry-run')\n  }\n  return c.post<T>(path, body)\n}\n","// Standardized three-part response format for every MCP tool (ADR-039,\n// issue #143). Output shape:\n//\n//   {summary — NL paragraph: what was found, why it matters}\n//\n//   {block — typed payload, formatted}\n//\n//   confidence: 0.94 · provenance: OBSERVED\n//\n// Empty result → footer reads \"confidence: n/a · provenance: n/a\". Every tool\n// in packages/mcp/src/tools.ts routes through this helper so consumers get a\n// consistent shape — agents can pattern-match on the footer to know how much\n// to trust the answer.\n\nexport interface ToolResponse {\n  [x: string]: unknown\n  content: { type: 'text'; text: string }[]\n  isError?: boolean\n}\n\nexport interface FormatToolResponseInput {\n  // NL paragraph. One or two sentences. What was found and why it matters.\n  summary: string\n  // Structured block. The formatted typed payload — usually a bullet list,\n  // sometimes a multi-section breakdown. May be empty when the summary\n  // already conveys everything.\n  block?: string\n  // Per-result confidence in [0, 1]. Undefined → footer reads \"n/a\".\n  confidence?: number\n  // Per-result provenance. Single value, or an array if the result spans\n  // mixed provenances (e.g. a path of OBSERVED + EXTRACTED edges). Undefined\n  // → footer reads \"n/a\".\n  provenance?: string | string[]\n  // Set on transport / 5xx errors. Routes through ToolResponse.isError so\n  // MCP clients can surface a non-\"normal\" return.\n  isError?: boolean\n}\n\nfunction formatFooter(\n  confidence: number | undefined,\n  provenance: string | string[] | undefined,\n): string {\n  const c = confidence === undefined ? 'n/a' : confidence.toFixed(2)\n  const p =\n    provenance === undefined\n      ? 'n/a'\n      : Array.isArray(provenance)\n        ? [...new Set(provenance)].join(', ')\n        : provenance\n  return `confidence: ${c} · provenance: ${p}`\n}\n\nexport function formatToolResponse(input: FormatToolResponseInput): ToolResponse {\n  const sections: string[] = [input.summary.trim()]\n  if (input.block && input.block.trim().length > 0) {\n    sections.push(input.block.trimEnd())\n  }\n  sections.push(formatFooter(input.confidence, input.provenance))\n  const text = sections.join('\\n\\n')\n  return {\n    content: [{ type: 'text', text }],\n    ...(input.isError ? { isError: true } : {}),\n  }\n}\n\n// Convenience for the \"node not found / empty graph\" path. Keeps the\n// three-part shape (summary still landed) but sets the footer to n/a / n/a\n// since there's nothing to confidence-tag or provenance-tag.\nexport function formatEmptyResponse(summary: string): ToolResponse {\n  return formatToolResponse({ summary })\n}\n\n// Convenience for transport / 5xx errors at the MCP boundary. isError set\n// so MCP clients route the response into their error path.\nexport function formatErrorResponse(message: string): ToolResponse {\n  return formatToolResponse({ summary: message, isError: true })\n}\n"],"mappings":";;;AAEA,SAAS,iBAAiB;AAC1B,SAAS,4BAA4B;AACrC,SAAS,SAAS;AAClB,SAAS,0BAA0B,gCAAgC;;;ACM5D,SAAS,iBAAiBA,UAA6B;AAC5D,QAAM,OAAOA,SAAQ,QAAQ,OAAO,EAAE;AACtC,SAAO;AAAA,IACL,MAAM,IAAO,MAA0B;AACrC,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,EAAE;AACxC,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,WAAW,IAAI,KAAK,IAAI,EAAE;AAAA,MAC3F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,IACA,MAAM,KAAQ,MAAc,MAA2B;AACrD,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,IAAI;AAAA,QACxC,QAAQ;AAAA,QACR,SAAS,EAAE,gBAAgB,mBAAmB;AAAA,QAC9C,MAAM,KAAK,UAAU,IAAI;AAAA,MAC3B,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,YAAY,IAAI,KAAK,IAAI,EAAE;AAAA,MAC5F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,EACF;AACF;AAEO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACkB,QAChB,SACA;AACA,UAAM,OAAO;AAHG;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;;;ACjCA;AAAA,EACE;AAAA,OACK;AAkBP,IAAM,qBAAqB;AAC3B,IAAM,gBAAgB;AACtB,IAAM,0BAA0B;AAChC,IAAM,wBAAwB;AAC9B,IAAM,kCAAkC;AAExC,SAAS,QAAQ,IAAoB;AAGnC,SAAO,eAAe,mBAAmB,EAAE,CAAC;AAC9C;AAIA,SAAS,WAAW,SAAqC;AACvD,SAAO,UAAU,aAAa,mBAAmB,OAAO,CAAC,KAAK;AAChE;AAEA,SAAS,cAAc,OAA0B;AAC/C,SAAQ,MAA4B,QAAQ,MAAM;AACpD;AAEA,eAAsB,kBACpBC,SACA,SAC8B;AAC9B,QAAM,QAAQ,MAAMA,QAAO,IAAqB,GAAG,WAAW,OAAO,CAAC,QAAQ;AAC9E,SAAO;AAAA,IACL,WAAW,MAAM,MAAM,IAAI,CAAC,OAAO;AAAA,MACjC,KAAK,QAAQ,EAAE,EAAE;AAAA,MACjB,MAAM,cAAc,CAAC;AAAA,MACrB,aAAa,GAAG,EAAE,IAAI,WAAM,cAAc,CAAC,CAAC;AAAA,MAC5C,UAAU;AAAA,IACZ,EAAE;AAAA,EACJ;AACF;AAEA,eAAsB,iBACpBA,SACA,IACA,SAC6B;AAC7B,QAAM,MAAM,QAAQ,EAAE;AACtB,QAAM,SAAS,WAAW,OAAO;AACjC,MAAI;AACF,UAAM,CAAC,OAAO,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,MACvCA,QAAO,IAAe,GAAG,MAAM,eAAe,mBAAmB,EAAE,CAAC,EAAE;AAAA,MACtEA,QAAO,IAAmB,GAAG,MAAM,gBAAgB,mBAAmB,EAAE,CAAC,EAAE;AAAA,IAC7E,CAAC;AACD,UAAM,OAAO;AAAA,MACX,MAAM;AAAA;AAAA;AAAA;AAAA,MAIN,eAAe,MAAM;AAAA,IACvB;AACA,WAAO;AAAA,MACL,UAAU;AAAA,QACR;AAAA,UACE;AAAA,UACA,UAAU;AAAA,UACV,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAAA,EACF,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,UAAU;AAAA,UACR;AAAA,YACE;AAAA,YACA,UAAU;AAAA,YACV,MAAM,KAAK,UAAU,EAAE,OAAO,kBAAkB,GAAG,CAAC;AAAA,UACtD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACF;AAEA,eAAsB,6BACpBA,SACA,QAAgB,iCAChB,SAC6B;AAC7B,QAAM,aAAa,MAAMA,QAAO;AAAA,IAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,EACxB;AAGA,QAAM,UAAU,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACxD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,WAAW,QAAQ,YAAY,QAAQ;AAAA,UACvE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAsB,4BACpBA,SACA,QAAgB,yBAChB,SAC6B;AAC7B,QAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAEhF,QAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACpD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,OAAO,QAAQ,QAAQ,QAAQ;AAAA,UAC/D;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOO,SAAS,iBACd,MACA,MACS;AACT,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,KAAK,UAAU,KAAK,MAAO,QAAO;AACtC,MAAI,KAAK,WAAW,KAAK,OAAQ,QAAO;AACxC,SAAO;AACT;AAgBO,SAAS,kBACdC,SACAD,SACA,UAAoC,CAAC,GACf;AACtB,QAAM,SAAS,QAAQ,mBAAmB;AAC1C,QAAM,UAAU,QAAQ;AAIxB,EAAAC,QAAO;AAAA,IACL;AAAA,IACA,IAAI,iBAAiB,oBAAoB;AAAA,MACvC,MAAM,YAAY,kBAAkBD,SAAQ,OAAO;AAAA,IACrD,CAAC;AAAA,IACD;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,OAAO,MAAM,cAAc;AACzB,YAAM,MAAM,UAAU;AACtB,YAAM,KAAK,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,IAAI;AACzC,UAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAAG;AAC7C,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AACA,YAAM,UAAU,GAAG,SAAS,GAAG,IAAI,mBAAmB,EAAE,IAAI;AAC5D,aAAO,iBAAiBA,SAAQ,SAAS,OAAO;AAAA,IAClD;AAAA,EACF;AAIA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,4BAA4BD,SAAQ,yBAAyB,OAAO;AAAA,EAClF;AAKA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,6BAA6BD,SAAQ,iCAAiC,OAAO;AAAA,EAC3F;AAEA,MAAI,UAAU;AACd,MAAI,QAA+B;AACnC,MAAI,gBAA2D;AAC/D,MAAI,iBAA4D;AAEhE,QAAM,OAAO,YAA2B;AACtC,QAAI,QAAS;AAEb,QAAI;AACF,YAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAChF,YAAM,OAAO;AAAA,QACX,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO,SAAS,IAAI,OAAO,OAAO,SAAS,CAAC,EAAE,KAAK;AAAA,MAC7D;AACA,UAAI,iBAAiB,eAAe,IAAI,GAAG;AACzC,cAAMC,QAAO,OAAO,oBAAoB,EAAE,KAAK,cAAc,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MAChF;AACA,sBAAgB;AAAA,IAClB,QAAQ;AAAA,IAER;AAIA,QAAI;AACF,YAAM,aAAa,MAAMD,QAAO;AAAA,QAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,MACxB;AACA,YAAM,OAAO;AAAA,QACX,OAAO,WAAW;AAAA,QAClB,QACE,WAAW,SAAS,IAAI,WAAW,WAAW,SAAS,CAAC,EAAE,KAAK;AAAA,MACnE;AACA,UAAI,iBAAiB,gBAAgB,IAAI,GAAG;AAC1C,cAAMC,QAAO,OACV,oBAAoB,EAAE,KAAK,sBAAsB,CAAC,EAClD,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACnB;AACA,uBAAiB;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,MAAI,SAAS,GAAG;AAGd,YAAQ,YAAY,MAAM;AACxB,WAAK,KAAK;AAAA,IACZ,GAAG,MAAM;AACT,QAAI,OAAO,MAAM,UAAU,WAAY,OAAM,MAAM;AAAA,EACrD;AAEA,SAAO;AAAA,IACL,MAAM,MAAY;AAChB,gBAAU;AACV,UAAI,MAAO,eAAc,KAAK;AAC9B,cAAQ;AAAA,IACV;AAAA,EACF;AACF;;;ACpSA,SAAS,kBAAkB;;;ACqB3B,SAAS,aACP,YACA,YACQ;AACR,QAAM,IAAI,eAAe,SAAY,QAAQ,WAAW,QAAQ,CAAC;AACjE,QAAM,IACJ,eAAe,SACX,QACA,MAAM,QAAQ,UAAU,IACtB,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,IAAI,IAClC;AACR,SAAO,eAAe,CAAC,qBAAkB,CAAC;AAC5C;AAEO,SAAS,mBAAmB,OAA8C;AAC/E,QAAM,WAAqB,CAAC,MAAM,QAAQ,KAAK,CAAC;AAChD,MAAI,MAAM,SAAS,MAAM,MAAM,KAAK,EAAE,SAAS,GAAG;AAChD,aAAS,KAAK,MAAM,MAAM,QAAQ,CAAC;AAAA,EACrC;AACA,WAAS,KAAK,aAAa,MAAM,YAAY,MAAM,UAAU,CAAC;AAC9D,QAAM,OAAO,SAAS,KAAK,MAAM;AACjC,SAAO;AAAA,IACL,SAAS,CAAC,EAAE,MAAM,QAAQ,KAAK,CAAC;AAAA,IAChC,GAAI,MAAM,UAAU,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,EAC3C;AACF;AAKO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,QAAQ,CAAC;AACvC;AAIO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,SAAS,SAAS,SAAS,KAAK,CAAC;AAC/D;;;AD5CA,SAAS,YAAY,SAA6B,QAAwB;AACxE,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,aAAa,mBAAmB,OAAO,CAAC,GAAG,MAAM;AAC1D;AAGA,eAAe,wBACb,IACA,iBACuB;AACvB,MAAI;AACF,WAAO,MAAM,GAAG;AAAA,EAClB,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO,oBAAoB,eAAe;AAAA,IAC5C;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAQA,eAAsB,aAAaC,SAAoB,OAA8C;AACnG,QAAM,KAAK,MAAM,UAAU,YAAY,mBAAmB,MAAM,OAAO,CAAC,KAAK;AAC7E,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,wBAAwB,mBAAmB,MAAM,SAAS,CAAC,GAAG,EAAE;AAAA,EAClE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAqB,IAAI;AACrD,UAAM,YAAY,OAAO,cAAc,KAAK,UAAK;AACjD,UAAM,cAAc,OAAO,gBAAgB,SACvC,OAAO,gBAAgB,KAAK,IAAI,IAChC;AACJ,UAAM,UACJ,kBAAkB,MAAM,SAAS,OAAO,OAAO,aAAa,OAC5D,OAAO,mBACN,OAAO,oBAAoB,qBAAqB,OAAO,iBAAiB,MAAM;AACjF,UAAM,aAAa;AAAA,MACjB,mBAAmB,SAAS;AAAA,MAC5B,qBAAqB,WAAW;AAAA,IAClC;AACA,QAAI,OAAO,mBAAmB;AAC5B,iBAAW,KAAK,oBAAoB,OAAO,iBAAiB,EAAE;AAAA,IAChE;AACA,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO,gBAAgB,SAAS,OAAO,kBAAkB;AAAA,IACvE,CAAC;AAAA,EACH,GAAG,2BAA2B,MAAM,SAAS,8DAA8D;AAC7G;AAQA,eAAsB,eACpBA,SACA,OACuB;AACvB,QAAM,KAAK,MAAM,UAAU,SAAY,UAAU,MAAM,KAAK,KAAK;AACjE,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,0BAA0B,mBAAmB,MAAM,MAAM,CAAC,GAAG,EAAE;AAAA,EACjE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAuB,IAAI;AACvD,QAAI,OAAO,kBAAkB,GAAG;AAC9B,aAAO;AAAA,QACL,GAAG,OAAO,MAAM;AAAA,MAClB;AAAA,IACF;AACA,UAAM,SAAS,CAAC,GAAG,OAAO,aAAa,EAAE;AAAA,MACvC,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,IACtE;AACA,UAAM,aAAa,OAAO,IAAI,gBAAgB;AAI9C,UAAM,gBAAgB,OAAO;AAAA,MAC3B,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,UAAU;AAAA,MAClC,OAAO;AAAA,IACT;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AACpE,WAAO,mBAAmB;AAAA,MACxB,SAAS,oBAAoB,OAAO,MAAM,KAAK,OAAO,aAAa,iBAAiB,OAAO,kBAAkB,IAAI,KAAK,GAAG;AAAA,MACzH,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO,SAAS,aAAa,IAAI,gBAAgB;AAAA,MAC7D,YAAY,YAAY,SAAS,cAAc;AAAA,IACjD,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,iBAAiB,GAAoC;AAC5D,QAAM,MAAM,EAAE,mBAAmB,WAAW,QAAQ,2CAAsC;AAC1F,SAAO,YAAO,EAAE,MAAM,cAAc,EAAE,QAAQ,KAAK,EAAE,cAAc,IAAI,GAAG;AAC5E;AAmBA,eAAsB,gBACpBA,SACA,OACuB;AACvB,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,eAAe,mBAAmB,MAAM,MAAM,CAAC,uBAAuB,KAAK;AAAA,EAC7E;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAkC,IAAI;AAClE,QAAI,OAAO,UAAU,GAAG;AACtB,aAAO;AAAA,QACL,UAAU,IACN,GAAG,MAAM,MAAM,8CACf,GAAG,MAAM,MAAM,sCAAsC,KAAK;AAAA,MAChE;AAAA,IACF;AAEA,UAAM,aAAa,oBAAI,IAAwC;AAC/D,eAAW,OAAO,OAAO,cAAc;AACrC,YAAM,OAAO,WAAW,IAAI,IAAI,QAAQ,KAAK,CAAC;AAC9C,WAAK,KAAK,GAAG;AACb,iBAAW,IAAI,IAAI,UAAU,IAAI;AAAA,IACnC;AACA,UAAM,aAAuB,CAAC;AAC9B,eAAW,YAAY,CAAC,GAAG,WAAW,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG;AACnE,YAAM,QAAQ,aAAa,IAAI,wBAAwB,YAAY,QAAQ;AAC3E,iBAAW,KAAK,GAAG,KAAK,GAAG;AAC3B,iBAAW,OAAO,WAAW,IAAI,QAAQ,GAAI;AAC3C,mBAAW,KAAK,YAAO,IAAI,MAAM,WAAM,IAAI,QAAQ,KAAK,IAAI,UAAU,GAAG;AAAA,MAC3E;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,aAAa,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAC7E,UAAM,cAAc,WAAW,IAAI,CAAC,GAAG,UAAU;AACjD,UAAM,UACJ,UAAU,IACN,GAAG,MAAM,MAAM,QAAQ,WAAW,oBAAoB,gBAAgB,IAAI,MAAM,KAAK,MACrF,GAAG,MAAM,MAAM,QAAQ,OAAO,KAAK,aAAa,OAAO,UAAU,IAAI,MAAM,KAAK,uBAAuB,KAAK,KAAK,WAAW;AAClI,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,eAAsB,wBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,QAAQ,MAAMA,QAAO;AAAA,MACzB,YAAY,MAAM,SAAS,gBAAgB,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC/E;AACA,UAAM,WAAW,MAAM,SAAS,OAAO,CAAC,MAAM,EAAE,eAAe,WAAW,QAAQ;AAClF,QAAI,SAAS,WAAW,GAAG;AACzB,YAAM,eAAe,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,eAAe,WAAW,SAAS;AACrF,YAAM,OAAO,eACT,wGACA;AACJ,aAAO,oBAAoB,gCAAgC,MAAM,MAAM,IAAI,IAAI,EAAE;AAAA,IACnF;AACA,UAAM,aAAa,SAAS,IAAI,CAAC,MAAM,YAAO,EAAE,MAAM,WAAM,EAAE,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE;AAClF,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,SAAS,MAAM,qBAAqB,SAAS,WAAW,IAAI,MAAM,KAAK;AAAA,MACvG,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,WAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,SAAS,GAAsB;AACtC,QAAM,OAAiB,CAAC;AACxB,MAAI,EAAE,QAAQ;AAGZ,SAAK,KAAK,SAAS,EAAE,OAAO,SAAS,EAAE;AACvC,QAAI,EAAE,OAAO,aAAa,EAAG,MAAK,KAAK,UAAU,EAAE,OAAO,UAAU,EAAE;AACtE,QAAI,EAAE,OAAO,sBAAsB,QAAW;AAC5C,WAAK,KAAK,OAAO,eAAe,EAAE,OAAO,iBAAiB,CAAC,EAAE;AAAA,IAC/D;AAAA,EACF,WAAW,EAAE,cAAc,QAAW;AACpC,SAAK,KAAK,aAAa,EAAE,SAAS,EAAE;AAAA,EACtC;AACA,MAAI,EAAE,aAAc,MAAK,KAAK,gBAAgB,EAAE,YAAY,EAAE;AAC9D,MAAI,EAAE,eAAe,OAAW,MAAK,KAAK,cAAc,EAAE,UAAU,EAAE;AACtE,SAAO,KAAK,SAAS,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM;AACjD;AAEA,SAAS,eAAe,IAAoB;AAC1C,MAAI,KAAK,IAAM,QAAO,GAAG,KAAK,MAAM,EAAE,CAAC;AACvC,QAAM,IAAI,KAAK,MAAM,KAAK,GAAI;AAC9B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,SAAO,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC;AAC9B;AAQA,eAAsB,mBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,cAAc,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC7E;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,oBAAoB,iCAAiC,MAAM,MAAM,GAAG;AAAA,IAC7E;AAGA,UAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,SAAS,EAAE;AAChE,UAAM,aAAuB,CAAC;AAC9B,eAAW,MAAM,SAAS;AACxB,iBAAW,KAAK,KAAK,GAAG,SAAS,WAAM,GAAG,OAAO,KAAK,GAAG,YAAY,EAAE;AACvE,iBAAW,KAAK,aAAa,GAAG,OAAO,SAAS,GAAG,MAAM,EAAE;AAAA,IAC7D;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,OAAO,MAAM,qBAAqB,OAAO,WAAW,IAAI,KAAK,GAAG,iBAAiB,QAAQ,MAAM;AAAA,MAC/H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA,MAG3B,YAAY,WAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAaA,eAAsB,eACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,aAAa,mBAAmB,MAAM,KAAK,CAAC,EAAE;AAAA,IAC3E;AACA,QAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,aAAO,oBAAoB,mBAAmB,MAAM,KAAK,IAAI;AAAA,IAC/D;AACA,UAAM,WAAW,OAAO,YAAY;AACpC,UAAM,aAAuB,CAAC;AAC9B,QAAI;AACJ,eAAW,KAAK,OAAO,SAAS;AAG9B,YAAM,QAAQ,aAAa,eAAe,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAClF,YAAM,WAAW,UAAU,SAAY,WAAW,MAAM,QAAQ,CAAC,CAAC,MAAM;AACxE,UAAI,UAAU,WAAc,aAAa,UAAa,QAAQ,UAAW,YAAW;AACpF,iBAAW;AAAA,QACT,YAAO,EAAE,EAAE,KAAK,EAAE,IAAI,YAAQ,EAAwB,QAAQ,EAAE,EAAE,GAAG,QAAQ;AAAA,MAC/E;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,SAAS,OAAO,QAAQ,MAAM,SAAS,OAAO,QAAQ,WAAW,IAAI,KAAK,IAAI,SAAS,MAAM,KAAK,SAAS,QAAQ;AAAA,MAC5H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAkBA,eAAsB,aACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B;AAAA,QACE,MAAM;AAAA,QACN,uBAAuB,mBAAmB,MAAM,eAAe,CAAC;AAAA,MAClE;AAAA,IACF;AACA,UAAM,QACJ,OAAO,MAAM,MAAM,SACnB,OAAO,MAAM,MAAM,SACnB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM;AACvB,UAAM,YAAY,OAAO,KAAK,cAAc;AAC5C,QAAI,UAAU,GAAG;AACf,aAAO;AAAA,QACL,gDAAgD,MAAM,eAAe,qBAAqB,SAAS;AAAA,MACrG;AAAA,IACF;AACA,UAAM,aAAuB;AAAA,MAC3B,yBAAyB,SAAS;AAAA,MAClC,yBAAyB,OAAO,QAAQ,UAAU;AAAA,MAClD;AAAA,IACF;AACA,QAAI,OAAO,MAAM,MAAM,UAAU,OAAO,MAAM,MAAM,QAAQ;AAC1D,iBAAW,KAAK,QAAQ;AACxB,iBAAW,KAAK,OAAO,MAAM,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AAClF,iBAAW,KAAK,OAAO,MAAM;AAC3B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AACpF,iBAAW,KAAK,OAAO,QAAQ;AAC7B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,kBAAkB,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE;AAAA,MAC9E;AACA,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,cAAM,UACJ,EAAE,OAAO,eAAe,EAAE,MAAM,aAC5B,cAAc,EAAE,OAAO,UAAU,WAAM,EAAE,MAAM,UAAU,KACzD,kBAAkB,EAAE,QAAQ,EAAE,KAAK;AACzC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,OAAO,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,gBAAgB,MAAM,eAAe,KAAK,KAAK,UAAU,UAAU,IAAI,KAAK,GAAG;AAAA,MACxF,OAAO,WAAW,KAAK,IAAI,EAAE,QAAQ;AAAA;AAAA;AAAA,IAGvC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,2BAA2B,MAAM,eAAe,KAAK,IAAI,OAAO;AAAA,MAClE;AAAA,IACF;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,SAAS,kBACP,QACA,OACQ;AACR,QAAM,OAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AACpE,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,MAAM;AACpB,QAAI,KAAK,UAAU,OAAO,CAAC,CAAC,MAAM,KAAK,UAAU,MAAM,CAAC,CAAC,EAAG,SAAQ,KAAK,CAAC;AAAA,EAC5E;AACA,SAAO,QAAQ,WAAW,IACtB,sBACA,mBAAmB,QAAQ,KAAK,EAAE,KAAK,IAAI,CAAC;AAClD;AAmBA,eAAsB,oBACpBA,SACA,OACuB;AACvB,QAAM,SAAS,IAAI,gBAAgB;AACnC,MAAI,MAAM,UAAU,OAAW,QAAO,IAAI,SAAS,OAAO,MAAM,KAAK,CAAC;AACtE,MAAI,MAAM,SAAU,QAAO,IAAI,YAAY,MAAM,QAAQ;AACzD,QAAM,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,SAAS,CAAC,KAAK;AAEvD,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,mBAAmB,EAAE,EAAE;AAAA,IACpD;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,QACL,MAAM,WACF,YAAY,MAAM,QAAQ,qBAC1B;AAAA,MACN;AAAA,IACF;AACA,UAAM,aAAa,OAAO;AAAA,MACxB,CAAC,MACC,KAAK,EAAE,cAAc,WAAM,EAAE,MAAM,MAAM,EAAE,QAAQ,OAAO,EAAE,MAAM,eACnD,EAAE,YAAY,eAAe,eAAe,EAAE,WAAW,CAAC;AAAA,IAC7E;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,OAAO,MAAM,yBAAyB,OAAO,WAAW,IAAI,KAAK,GAAG,YAAY,MAAM,WAAW,QAAQ,MAAM,QAAQ,KAAK,EAAE;AAAA,MAC1I,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA,MAE3B,YAAY,WAAW;AAAA,IACzB,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAsBA,eAAsB,cACpBA,SACA,OACuB;AACvB,MAAI;AACF,QAAI;AACJ,QAAI,UAAU;AACd,QAAI;AAEJ,QAAI,MAAM,oBAAoB;AAE5B,YAAM,OAAO,MAAM;AAAA,QACjBA;AAAA,QACA,YAAY,MAAM,SAAS,iBAAiB;AAAA,QAC5C,EAAE,oBAAoB,MAAM,mBAAmB;AAAA,MACjD;AACA,mBAAa,KAAK;AAClB,gBAAU,KAAK;AACf,qBAAe,KAAK;AAAA,IACtB,OAAO;AAGL,YAAM,WAAW,IAAI,gBAAgB;AACrC,UAAI,OAAO,MAAM,UAAU,YAAY,cAAc,MAAM,OAAO;AAChE,iBAAS,IAAI,YAAY,MAAM,MAAM,QAAQ;AAAA,MAC/C;AACA,YAAM,KAAK,SAAS,OAAO,IAAI,IAAI,SAAS,SAAS,CAAC,KAAK;AAC3D,mBAAa,MAAMA,QAAO;AAAA,QACxB,YAAY,MAAM,SAAS,uBAAuB,EAAE,EAAE;AAAA,MACxD;AACA,gBAAU,WAAW,MAAM,CAAC,MAAM,EAAE,gBAAgB,OAAO;AAAA,IAC7D;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL,eACI,4DAA4D,aAAa,IAAI,OAC7E;AAAA,MACN;AAAA,IACF;AAEA,UAAM,aAAa,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,OAAO,EAAE;AACvE,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAChB,mBAAa;AAAA,QACX,gBAAgB,aAAa,IAAI,kBAAkB,WAAW,MAAM,aAAa,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MACrH;AAAA,IACF,OAAO;AACL,mBAAa;AAAA,QACX,GAAG,WAAW,MAAM,oBAAoB,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MAC5E;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,mBAAa,KAAK,GAAG,UAAU,iBAAiB;AAAA,IAClD;AACA,QAAI,CAAC,WAAW,cAAc;AAC5B,mBAAa,KAAK,eAAe;AAAA,IACnC;AACA,UAAM,UAAU,aAAa,KAAK,IAAI,IAAI;AAE1C,UAAM,aAAa,WAAW,IAAI,CAAC,MAAM;AACvC,YAAM,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,OAAO,CAAC,KAAK;AAC/E,aAAO,aAAQ,EAAE,QAAQ,IAAI,EAAE,WAAW,KAAK,EAAE,UAAU,KAAK,EAAE,OAAO,WAAM,OAAO;AAAA,IACxF,CAAC;AACD,UAAM,aAAa,CAAC,GAAG,IAAI,IAAI,WAAW,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AACjE,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY,eAAe,MAAM;AAAA,MACjC,YAAY,WAAW,KAAK,GAAG;AAAA,IACjC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,eAAe,SACbA,SACA,MACA,MACY;AAKZ,QAAM,IAAIA;AACV,MAAI,OAAO,EAAE,SAAS,YAAY;AAChC,UAAM,IAAI,MAAM,6EAAwE;AAAA,EAC1F;AACA,SAAO,EAAE,KAAQ,MAAM,IAAI;AAC7B;;;AH9kBA,IAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,IAAM,SAAS,iBAAiB,OAAO;AAMvC,IAAM,iBAAiB,QAAQ,IAAI;AACnC,IAAM,aAAa,CAAC,UAClB,MAAM,WAAW;AAEnB,IAAM,eAAe,EAClB,OAAO,EACP,SAAS,EACT;AAAA,EACC;AACF;AAEF,IAAM,SAAS,IAAI,UAAU;AAAA,EAC3B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,WAAW,EACR,OAAO,EACP,SAAS,qEAAqE;AAAA,IACjF,SAAS,EACN,OAAO,EACP,SAAS,EACT,SAAS,uGAAuG;AAAA,IACnH,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,4CAA4C;AAAA,IACxE,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,IAAI,EAAE,EACN,SAAS,EACT,SAAS,4BAA4B;AAAA,IACxC,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,IAAI,CAAC,EACL,IAAI,EAAE,EACN,SAAS,EACT,SAAS,0EAA0E;AAAA,IACtF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,gBAAgB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACnF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,wBAAwB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAC3F;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,wBAAwB;AAAA,IACpD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS,mCAAmC;AAAA,IACnG,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,mBAAmB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACtF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,EAAE,OAAO,EAAE,SAAS,4DAA4D;AAAA,IACvF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,iBAAiB,EACd,OAAO,EACP;AAAA,MACC;AAAA,IACF;AAAA,IACF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,SAAS,EACT,IAAI,GAAG,EACP,SAAS,EACT,SAAS,mCAAmC;AAAA,IAC/C,UAAU,EACP,OAAO,EACP,SAAS,EACT,SAAS,0DAAqD;AAAA,IACjE,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,oBAAoB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACvF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,yBAAyB,SAAS,EAAE;AAAA,MACzC;AAAA,IACF;AAAA,IACA,oBAAoB,yBAAyB,SAAS,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,IACA,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UACL,cAAc,QAAQ;AAAA,IACpB,GAAG;AAAA,IACH,SAAS,WAAW,KAAK;AAAA,EAC3B,CAAwC;AAC5C;AAMA,IAAM,kBAAkB,QAAQ,IAAI,wBAChC,OAAO,QAAQ,IAAI,qBAAqB,IACxC;AACJ,IAAM,uBAAuB,kBAAkB,QAAQ,QAAQ;AAAA,EAC7D,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,EAC3D,GAAI,iBAAiB,EAAE,SAAS,eAAe,IAAI,CAAC;AACtD,CAAC;AAED,eAAe,OAAsB;AACnC,QAAM,YAAY,IAAI,qBAAqB;AAC3C,QAAM,OAAO,QAAQ,SAAS;AAChC;AAEA,IAAM,cAAc,MAAY;AAC9B,uBAAqB,KAAK;AAC5B;AACA,QAAQ,GAAG,WAAW,WAAW;AACjC,QAAQ,GAAG,UAAU,WAAW;AAEhC,KAAK,EAAE,MAAM,CAAC,QAAQ;AACpB,UAAQ,MAAM,GAAG;AACjB,UAAQ,KAAK,CAAC;AAChB,CAAC;","names":["baseUrl","client","server","client"]}
+{"version":3,"sources":["../src/index.ts","../src/client.ts","../src/resources.ts","../src/tools.ts","../src/format.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js'\nimport { z } from 'zod'\nimport { CheckPoliciesScopeSchema, HypotheticalActionSchema } from '@neat.is/types'\nimport { createHttpClient } from './client.js'\nimport { registerResources } from './resources.js'\nimport { DivergenceTypeSchema } from '@neat.is/types'\nimport {\n  checkPolicies,\n  getBlastRadius,\n  getDependencies,\n  getDivergences,\n  getGraphDiff,\n  getIncidentHistory,\n  getObservedDependencies,\n  getRecentStaleEdges,\n  getRootCause,\n  semanticSearch,\n} from './tools.js'\n\nconst baseUrl = process.env.NEAT_CORE_URL ?? 'http://localhost:8080'\nconst client = createHttpClient(baseUrl)\n\n// `NEAT_DEFAULT_PROJECT` is the implicit project for tool calls that don't\n// pass a `project` arg. Unset means \"use the core's `default` project\" — we\n// route those calls through the legacy unprefixed URL so an older core (one\n// that predates #83) still gets the request it expects.\nconst defaultProject = process.env.NEAT_DEFAULT_PROJECT\nconst projectFor = (input: { project?: string }): string | undefined =>\n  input.project ?? defaultProject\n\nconst projectField = z\n  .string()\n  .optional()\n  .describe(\n    'Project name when the core hosts more than one (set NEAT_PROJECTS=...). Omit to use the default project.',\n  )\n\nconst server = new McpServer({\n  name: 'neat',\n  version: '0.1.0',\n})\n\nserver.tool(\n  'get_root_cause',\n  'Trace a failing node up its dependency graph to find the underlying cause. Use this when something is breaking and you want to know which upstream component is the actual culprit.',\n  {\n    errorNode: z\n      .string()\n      .describe('Graph node id where the error surfaced, e.g. \"database:payments-db\"'),\n    errorId: z\n      .string()\n      .optional()\n      .describe('Specific error event id from incident history; if set, the result is coloured with that error message'),\n    project: projectField,\n  },\n  async (input) => getRootCause(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_blast_radius',\n  'List every node downstream of the given node — what would break if this node failed or was redeployed.',\n  {\n    nodeId: z.string().describe('Graph node id to compute blast radius from'),\n    depth: z\n      .number()\n      .int()\n      .nonnegative()\n      .max(20)\n      .optional()\n      .describe('Max BFS depth (default 10)'),\n    project: projectField,\n  },\n  async (input) => getBlastRadius(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_dependencies',\n  'List the transitive outgoing dependencies of a node, BFS to depth N (default 3, max 10). Each result carries distance, edge type, and provenance — both static (EXTRACTED) and runtime (OBSERVED). Pass depth=1 for direct-only.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    depth: z\n      .number()\n      .int()\n      .min(1)\n      .max(10)\n      .optional()\n      .describe('BFS depth (default 3, max 10). depth=1 returns direct dependencies only.'),\n    project: projectField,\n  },\n  async (input) => getDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_observed_dependencies',\n  'List only the runtime (OBSERVED via OTel) outgoing dependencies of a node. Use this to compare what code SAYS the service depends on vs what production actually does.',\n  {\n    nodeId: z.string().describe('Graph node id to inspect'),\n    project: projectField,\n  },\n  async (input) => getObservedDependencies(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_incident_history',\n  'Return recent OTel error events recorded against a node, most recent first.',\n  {\n    nodeId: z.string().describe('Graph node id to query'),\n    limit: z.number().int().positive().max(100).optional().describe('Max events to return (default 20)'),\n    project: projectField,\n  },\n  async (input) => getIncidentHistory(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'semantic_search',\n  'Search nodes by natural-language query. Uses embedding vectors when an embedder is available (Ollama nomic-embed-text → in-process MiniLM → substring fallback) — phrase the query the way you would describe what you want.',\n  {\n    query: z.string().describe('Free-text query, e.g. \"service handling checkout payments\"'),\n    project: projectField,\n  },\n  async (input) => semanticSearch(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_graph_diff',\n  'Diff a saved graph snapshot against the current live graph. Useful for change reviews and post-incidents — answers \"what changed in the architecture between then and now.\" Returns added/removed/changed nodes and edges with both snapshot timestamps.',\n  {\n    againstSnapshot: z\n      .string()\n      .describe(\n        'Path or http(s) URL of the snapshot to diff against (the \"before\" state). The current graph is the \"after\".',\n      ),\n    project: projectField,\n  },\n  async (input) => getGraphDiff(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_recent_stale_edges',\n  'List the most recent OBSERVED → STALE edge transitions. Use this to spot integrations that have gone quiet — a CALLS edge that just went stale typically means an upstream stopped calling, not that the link is healthy.',\n  {\n    limit: z\n      .number()\n      .int()\n      .positive()\n      .max(200)\n      .optional()\n      .describe('Max events to return (default 50)'),\n    edgeType: z\n      .string()\n      .optional()\n      .describe('Filter by edge type — e.g. \"CALLS\" or \"CONNECTS_TO\"'),\n    project: projectField,\n  },\n  async (input) => getRecentStaleEdges(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'get_divergences',\n  \"Returns places where what the code declares (EXTRACTED) doesn't match what production observed (OBSERVED). The single most NEAT-shaped query — the one that justifies the whole graph. Use when the user asks 'is anything weird?' or 'what does production do that the code doesn't?' or 'find me a bug' on an unfamiliar codebase. Returns divergences ranked by confidence × severity. Prefer this over `get_root_cause` when no specific node is failing.\",\n  {\n    type: z\n      .array(DivergenceTypeSchema)\n      .optional()\n      .describe(\n        'Filter by divergence type. One or more of: missing-observed, missing-extracted, version-mismatch, host-mismatch, compat-violation. Omit for all.',\n      ),\n    minConfidence: z\n      .number()\n      .min(0)\n      .max(1)\n      .optional()\n      .describe('Drop divergences below this confidence threshold (0.0 - 1.0).'),\n    node: z\n      .string()\n      .optional()\n      .describe('Scope to divergences involving this node id (as source or target).'),\n    project: projectField,\n  },\n  async (input) =>\n    getDivergences(client, { ...input, project: projectFor(input) }),\n)\n\nserver.tool(\n  'check_policies',\n  'Inspect or dry-run the project\\'s policy.json. Without hypotheticalAction, returns currently-recorded violations. With hypotheticalAction, returns violations that would result if the action were applied. Architectural assertions in five shapes (structural / compatibility / provenance / ownership / blast-radius).',\n  {\n    scope: CheckPoliciesScopeSchema.optional().describe(\n      'Narrow to a subset. Default \"all\".',\n    ),\n    hypotheticalAction: HypotheticalActionSchema.optional().describe(\n      'Dry-run mode: simulate the action and return resulting violations. Omit for current state.',\n    ),\n    project: projectField,\n  },\n  async (input) =>\n    checkPolicies(client, {\n      ...input,\n      project: projectFor(input),\n    } as Parameters<typeof checkPolicies>[1]),\n)\n\n// Resources sit alongside tools — same data, different access pattern. Read\n// the per-node resource for raw attrs+edges JSON; subscribe to the incidents\n// resource to be notified when new errors land. The eight tools above are\n// unchanged.\nconst incidentsPollMs = process.env.NEAT_RESOURCE_POLL_MS\n  ? Number(process.env.NEAT_RESOURCE_POLL_MS)\n  : undefined\nconst resourceRegistration = registerResources(server, client, {\n  ...(incidentsPollMs !== undefined ? { incidentsPollMs } : {}),\n  ...(defaultProject ? { project: defaultProject } : {}),\n})\n\nasync function main(): Promise<void> {\n  const transport = new StdioServerTransport()\n  await server.connect(transport)\n}\n\nconst stopPolling = (): void => {\n  resourceRegistration.stop()\n}\nprocess.on('SIGTERM', stopPolling)\nprocess.on('SIGINT', stopPolling)\n\nmain().catch((err) => {\n  console.error(err)\n  process.exit(1)\n})\n","// Thin HTTP client for the neat-core REST surface. Tools call out via this\n// instead of fetch() directly so tests can swap in a stub implementation\n// without monkey-patching globals.\n\nexport interface HttpClient {\n  get<T>(path: string): Promise<T>\n  // POST is optional on the interface so test stubs that only need GET don't\n  // have to implement it. Production createHttpClient always provides it.\n  post?<T>(path: string, body: unknown): Promise<T>\n}\n\nexport function createHttpClient(baseUrl: string): HttpClient {\n  const root = baseUrl.replace(/\\/$/, '')\n  return {\n    async get<T>(path: string): Promise<T> {\n      const res = await fetch(`${root}${path}`)\n      if (!res.ok) {\n        const body = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on GET ${path}: ${body}`)\n      }\n      return (await res.json()) as T\n    },\n    async post<T>(path: string, body: unknown): Promise<T> {\n      const res = await fetch(`${root}${path}`, {\n        method: 'POST',\n        headers: { 'content-type': 'application/json' },\n        body: JSON.stringify(body),\n      })\n      if (!res.ok) {\n        const text = await res.text().catch(() => '')\n        throw new HttpError(res.status, `${res.status} ${res.statusText} on POST ${path}: ${text}`)\n      }\n      return (await res.json()) as T\n    },\n  }\n}\n\nexport class HttpError extends Error {\n  constructor(\n    public readonly status: number,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'HttpError'\n  }\n}\n","// MCP Resources — additive surface alongside the eight tools. Two resources:\n//\n//   neat://node/<id>          — one resource per graph node. Read returns the\n//                                node attributes plus its outbound edges.\n//   neat://incidents/recent   — most recent error events. Pollable by the SDK\n//                                via subscribe; we send `notifications/resources/\n//                                updated` when /incidents grows.\n//\n// Pure read helpers are exported so tests can exercise them without spinning up\n// an MCP transport. `registerResources()` does the SDK wiring + the poll loop.\n\nimport type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js'\nimport {\n  ResourceTemplate,\n} from '@modelcontextprotocol/sdk/server/mcp.js'\nimport type {\n  ListResourcesResult,\n  ReadResourceResult,\n} from '@modelcontextprotocol/sdk/types.js'\nimport type { ErrorEvent, GraphEdge, GraphNode, PolicyViolation } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\ninterface SerializedGraph {\n  nodes: GraphNode[]\n  edges: GraphEdge[]\n}\n\nconst NODE_RESOURCE_MIME = 'application/json'\nconst INCIDENTS_URI = 'neat://incidents/recent'\nconst INCIDENTS_DEFAULT_LIMIT = 50\nconst POLICY_VIOLATIONS_URI = 'neat://policies/violations'\nconst POLICY_VIOLATIONS_DEFAULT_LIMIT = 100\n\nfunction nodeUri(id: string): string {\n  // Node ids contain `:` which RFC 6570 percent-encodes; doing it explicitly\n  // here keeps the URI we hand the SDK identical to what `list` produces.\n  return `neat://node/${encodeURIComponent(id)}`\n}\n\n// Project-aware URL prefix for the underlying core. When unset, hit the\n// legacy unprefixed routes (which the core resolves to project=`default`).\nfunction corePrefix(project: string | undefined): string {\n  return project ? `/projects/${encodeURIComponent(project)}` : ''\n}\n\nfunction nameFromAttrs(attrs: GraphNode): string {\n  return (attrs as { name?: string }).name ?? attrs.id\n}\n\nexport async function listNodeResources(\n  client: HttpClient,\n  project?: string,\n): Promise<ListResourcesResult> {\n  const graph = await client.get<SerializedGraph>(`${corePrefix(project)}/graph`)\n  return {\n    resources: graph.nodes.map((n) => ({\n      uri: nodeUri(n.id),\n      name: nameFromAttrs(n),\n      description: `${n.type} — ${nameFromAttrs(n)}`,\n      mimeType: NODE_RESOURCE_MIME,\n    })),\n  }\n}\n\nexport async function readNodeResource(\n  client: HttpClient,\n  id: string,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const uri = nodeUri(id)\n  const prefix = corePrefix(project)\n  try {\n    const [attrs, edges] = await Promise.all([\n      client.get<GraphNode>(`${prefix}/graph/node/${encodeURIComponent(id)}`),\n      client.get<EdgesResponse>(`${prefix}/graph/edges/${encodeURIComponent(id)}`),\n    ])\n    const body = {\n      node: attrs,\n      // Outbound only — the issue spec says \"attrs + outbound edges\". Inbound\n      // edges are still reachable via the other endpoint and would double the\n      // payload for hub nodes (e.g. a shared database).\n      outboundEdges: edges.outbound,\n    }\n    return {\n      contents: [\n        {\n          uri,\n          mimeType: NODE_RESOURCE_MIME,\n          text: JSON.stringify(body, null, 2),\n        },\n      ],\n    }\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return {\n        contents: [\n          {\n            uri,\n            mimeType: NODE_RESOURCE_MIME,\n            text: JSON.stringify({ error: 'node not found', id }),\n          },\n        ],\n      }\n    }\n    throw err\n  }\n}\n\nexport async function readPolicyViolationsResource(\n  client: HttpClient,\n  limit: number = POLICY_VIOLATIONS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const violations = await client.get<PolicyViolation[]>(\n    `${corePrefix(project)}/policies/violations`,\n  )\n  // Latest first; cap at limit so an exploding violations log doesn't blow\n  // up the resource read. The full file is still on disk for forensic use.\n  const ordered = [...violations].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: POLICY_VIOLATIONS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: violations.length, violations: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\nexport async function readRecentIncidentsResource(\n  client: HttpClient,\n  limit: number = INCIDENTS_DEFAULT_LIMIT,\n  project?: string,\n): Promise<ReadResourceResult> {\n  const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n  // ndjson order is append-time = oldest first. Reverse so most-recent leads.\n  const ordered = [...events].reverse().slice(0, limit)\n  return {\n    contents: [\n      {\n        uri: INCIDENTS_URI,\n        mimeType: NODE_RESOURCE_MIME,\n        text: JSON.stringify(\n          { count: ordered.length, total: events.length, events: ordered },\n          null,\n          2,\n        ),\n      },\n    ],\n  }\n}\n\n// Pure helper so the poll loop can be tested without timers. Returns true when\n// the visible state of /incidents has changed in a way subscribers should hear\n// about. Compares total count + the id of the newest event — either is enough\n// on its own, but the pair makes deletes (if they ever happen) survive a\n// missed update.\nexport function incidentsChanged(\n  prev: { total: number; lastId?: string } | null,\n  next: { total: number; lastId?: string },\n): boolean {\n  if (!prev) return false // first observation seeds, doesn't notify\n  if (prev.total !== next.total) return true\n  if (prev.lastId !== next.lastId) return true\n  return false\n}\n\nexport interface RegisterResourcesOptions {\n  // Poll interval for /incidents in ms. 5s by default; 0 disables polling.\n  incidentsPollMs?: number\n  // Project this MCP instance reports against. Unset → core's `default`\n  // project via the legacy unprefixed URLs.\n  project?: string\n}\n\nexport interface ResourceRegistration {\n  // Stops the poll loop. The SDK keeps the registered resources around as\n  // long as the server is alive — calling stop() doesn't unregister them.\n  stop: () => void\n}\n\nexport function registerResources(\n  server: McpServer,\n  client: HttpClient,\n  options: RegisterResourcesOptions = {},\n): ResourceRegistration {\n  const pollMs = options.incidentsPollMs ?? 5000\n  const project = options.project\n\n  // neat://node/<id> — templated. The list callback enumerates current nodes;\n  // the read callback resolves a specific id.\n  server.registerResource(\n    'graph-node',\n    new ResourceTemplate('neat://node/{id}', {\n      list: async () => listNodeResources(client, project),\n    }),\n    {\n      description:\n        'A single graph node by id. Reading returns the node attributes plus its outbound edges as JSON.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async (_uri, variables) => {\n      const raw = variables.id\n      const id = Array.isArray(raw) ? raw[0] : raw\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new Error('neat://node/{id} requires an id')\n      }\n      const decoded = id.includes('%') ? decodeURIComponent(id) : id\n      return readNodeResource(client, decoded, project)\n    },\n  )\n\n  // neat://incidents/recent — static. Subscribers get notifications/resources/\n  // updated on each tick where /incidents has changed.\n  server.registerResource(\n    'incidents-recent',\n    INCIDENTS_URI,\n    {\n      description:\n        'Most recent error events recorded by neat-core, newest first. JSON: { count, total, events[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readRecentIncidentsResource(client, INCIDENTS_DEFAULT_LIMIT, project),\n  )\n\n  // neat://policies/violations — static. Same poll-and-notify pattern as\n  // incidents. Subscribers get resource-updated notifications when the\n  // policy-violations.ndjson grows. ADR-045.\n  server.registerResource(\n    'policies-violations',\n    POLICY_VIOLATIONS_URI,\n    {\n      description:\n        'Current policy violations from policy-violations.ndjson, newest first. JSON: { count, total, violations[] }.',\n      mimeType: NODE_RESOURCE_MIME,\n    },\n    async () => readPolicyViolationsResource(client, POLICY_VIOLATIONS_DEFAULT_LIMIT, project),\n  )\n\n  let stopped = false\n  let timer: NodeJS.Timeout | null = null\n  let lastIncidents: { total: number; lastId?: string } | null = null\n  let lastViolations: { total: number; lastId?: string } | null = null\n\n  const tick = async (): Promise<void> => {\n    if (stopped) return\n    // Incidents poll.\n    try {\n      const events = await client.get<ErrorEvent[]>(`${corePrefix(project)}/incidents`)\n      const next = {\n        total: events.length,\n        lastId: events.length > 0 ? events[events.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastIncidents, next)) {\n        await server.server.sendResourceUpdated({ uri: INCIDENTS_URI }).catch(() => {})\n      }\n      lastIncidents = next\n    } catch {\n      // Core down — keep polling, next tick will catch up.\n    }\n    // Policy-violations poll. Fires the alert action's notifications/\n    // resources/updated for neat://policies/violations subscribers per\n    // ADR-044 §alert. Same change-detection shape as incidents.\n    try {\n      const violations = await client.get<PolicyViolation[]>(\n        `${corePrefix(project)}/policies/violations`,\n      )\n      const next = {\n        total: violations.length,\n        lastId:\n          violations.length > 0 ? violations[violations.length - 1].id : undefined,\n      }\n      if (incidentsChanged(lastViolations, next)) {\n        await server.server\n          .sendResourceUpdated({ uri: POLICY_VIOLATIONS_URI })\n          .catch(() => {})\n      }\n      lastViolations = next\n    } catch {\n      // Core down or no policies yet — keep polling.\n    }\n  }\n\n  if (pollMs > 0) {\n    // Seed `last` on first tick so we don't fire an \"updated\" notification\n    // when the server first comes up.\n    timer = setInterval(() => {\n      void tick()\n    }, pollMs)\n    if (typeof timer.unref === 'function') timer.unref()\n  }\n\n  return {\n    stop: (): void => {\n      stopped = true\n      if (timer) clearInterval(timer)\n      timer = null\n    },\n  }\n}\n","// Tool implementations. Each one takes an HttpClient + the validated input and\n// returns an MCP CallToolResult routed through formatToolResponse for the\n// three-part shape (NL + structured + footer) per ADR-039 / contract #12.\n// Keeping these as pure functions of (client, input) means tests don't need a\n// running server — just a stub client that returns canned JSON.\n\nimport type {\n  BlastRadiusAffectedNode,\n  BlastRadiusResult,\n  Divergence,\n  DivergenceResult,\n  DivergenceType,\n  ErrorEvent,\n  GraphEdge,\n  GraphNode,\n  HypotheticalAction,\n  PolicyViolation,\n  RootCauseResult,\n  TransitiveDependenciesResult,\n} from '@neat.is/types'\nimport { Provenance } from '@neat.is/types'\nimport { HttpError, type HttpClient } from './client.js'\nimport {\n  formatEmptyResponse,\n  formatErrorResponse,\n  formatToolResponse,\n  type ToolResponse,\n} from './format.js'\n\nexport type { ToolResponse } from './format.js'\n\n// Project-aware path builder. When `project` is set, route through\n// /projects/<name>/...; otherwise hit the legacy root URL (which the core\n// resolves to project=`default`). Keeping the legacy path means callers\n// running an older core still talk to a known route.\nfunction projectPath(project: string | undefined, suffix: string): string {\n  if (!project) return suffix\n  return `/projects/${encodeURIComponent(project)}${suffix}`\n}\n\n// Most tools want \"node missing → friendly message, anything else → real error\".\nasync function withMissingNodeFallback(\n  fn: () => Promise<ToolResponse>,\n  notFoundMessage: string,\n): Promise<ToolResponse> {\n  try {\n    return await fn()\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 404) {\n      return formatEmptyResponse(notFoundMessage)\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface RootCauseInput {\n  errorNode: string\n  errorId?: string\n  project?: string\n}\n\nexport async function getRootCause(client: HttpClient, input: RootCauseInput): Promise<ToolResponse> {\n  const qs = input.errorId ? `?errorId=${encodeURIComponent(input.errorId)}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/root-cause/${encodeURIComponent(input.errorNode)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<RootCauseResult>(path)\n    const arrowPath = result.traversalPath.join(' ← ')\n    const provenances = result.edgeProvenances.length\n      ? result.edgeProvenances.join(', ')\n      : '(direct, no edges traversed)'\n    const summary =\n      `Root cause for ${input.errorNode} is ${result.rootCauseNode}. ` +\n      result.rootCauseReason +\n      (result.fixRecommendation ? ` Recommended fix: ${result.fixRecommendation}.` : '')\n    const blockLines = [\n      `Traversal path: ${arrowPath}`,\n      `Edge provenances: ${provenances}`,\n    ]\n    if (result.fixRecommendation) {\n      blockLines.push(`Recommended fix: ${result.fixRecommendation}`)\n    }\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      confidence: result.confidence,\n      provenance: result.edgeProvenances.length ? result.edgeProvenances : undefined,\n    })\n  }, `No root cause found for ${input.errorNode}. The node may be healthy, or it may not exist in the graph.`)\n}\n\nexport interface BlastRadiusInput {\n  nodeId: string\n  depth?: number\n  project?: string\n}\n\nexport async function getBlastRadius(\n  client: HttpClient,\n  input: BlastRadiusInput,\n): Promise<ToolResponse> {\n  const qs = input.depth !== undefined ? `?depth=${input.depth}` : ''\n  const path = projectPath(\n    input.project,\n    `/traverse/blast-radius/${encodeURIComponent(input.nodeId)}${qs}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<BlastRadiusResult>(path)\n    if (result.totalAffected === 0) {\n      return formatEmptyResponse(\n        `${result.origin} has no downstream dependencies. Nothing else would break if it failed.`,\n      )\n    }\n    const sorted = [...result.affectedNodes].sort(\n      (a, b) => a.distance - b.distance || a.nodeId.localeCompare(b.nodeId),\n    )\n    const blockLines = sorted.map(formatBlastEntry)\n    // Worst-case confidence — the path with the lowest cascaded confidence\n    // is the headline number; agents should treat this as \"what's the\n    // weakest reachability NEAT actually knows about?\"\n    const minConfidence = sorted.reduce(\n      (m, n) => Math.min(m, n.confidence),\n      Number.POSITIVE_INFINITY,\n    )\n    const provenances = [...new Set(sorted.map((n) => n.edgeProvenance))]\n    return formatToolResponse({\n      summary: `Blast radius for ${result.origin}: ${result.totalAffected} affected node${result.totalAffected === 1 ? '' : 's'} reachable downstream.`,\n      block: blockLines.join('\\n'),\n      confidence: Number.isFinite(minConfidence) ? minConfidence : undefined,\n      provenance: provenances.length ? provenances : undefined,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction formatBlastEntry(n: BlastRadiusAffectedNode): string {\n  const tag = n.edgeProvenance === Provenance.STALE ? ' [STALE — last seen too long ago]' : ''\n  return `  • ${n.nodeId} (distance ${n.distance}, ${n.edgeProvenance})${tag}`\n}\n\ninterface EdgesResponse {\n  inbound: GraphEdge[]\n  outbound: GraphEdge[]\n}\n\nexport interface DependenciesInput {\n  nodeId: string\n  // BFS depth. Default 3; max 10. Direct-only consumers pass 1.\n  depth?: number\n  project?: string\n}\n\n// Transitive get_dependencies (issue #144). Calls the new core endpoint\n// /graph/node/:id/dependencies?depth=N which BFS-walks outbound. The output\n// groups results by hop so direct dependencies stand out from transitives —\n// agents asked \"what does X depend on?\" usually want the direct list with\n// transitives as context.\nexport async function getDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  const depth = input.depth ?? 3\n  const path = projectPath(\n    input.project,\n    `/graph/node/${encodeURIComponent(input.nodeId)}/dependencies?depth=${depth}`,\n  )\n\n  return withMissingNodeFallback(async () => {\n    const result = await client.get<TransitiveDependenciesResult>(path)\n    if (result.total === 0) {\n      return formatEmptyResponse(\n        depth === 1\n          ? `${input.nodeId} has no direct dependencies in the graph.`\n          : `${input.nodeId} has no dependencies (BFS to depth ${depth}).`,\n      )\n    }\n    // Group by distance so the structured block reads as concentric rings.\n    const byDistance = new Map<number, typeof result.dependencies>()\n    for (const dep of result.dependencies) {\n      const ring = byDistance.get(dep.distance) ?? []\n      ring.push(dep)\n      byDistance.set(dep.distance, ring)\n    }\n    const blockLines: string[] = []\n    for (const distance of [...byDistance.keys()].sort((a, b) => a - b)) {\n      const label = distance === 1 ? 'Direct (distance 1)' : `Distance ${distance}`\n      blockLines.push(`${label}:`)\n      for (const dep of byDistance.get(distance)!) {\n        blockLines.push(`  • ${dep.nodeId} — ${dep.edgeType} (${dep.provenance})`)\n      }\n    }\n    const provenances = [...new Set(result.dependencies.map((d) => d.provenance))]\n    const directCount = byDistance.get(1)?.length ?? 0\n    const summary =\n      depth === 1\n        ? `${input.nodeId} has ${directCount} direct dependenc${directCount === 1 ? 'y' : 'ies'}.`\n        : `${input.nodeId} has ${result.total} dependenc${result.total === 1 ? 'y' : 'ies'} reachable to depth ${depth} (${directCount} direct).`\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      provenance: provenances,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport async function getObservedDependencies(\n  client: HttpClient,\n  input: DependenciesInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const edges = await client.get<EdgesResponse>(\n      projectPath(input.project, `/graph/edges/${encodeURIComponent(input.nodeId)}`),\n    )\n    const observed = edges.outbound.filter((e) => e.provenance === Provenance.OBSERVED)\n    if (observed.length === 0) {\n      const hasExtracted = edges.outbound.some((e) => e.provenance === Provenance.EXTRACTED)\n      const note = hasExtracted\n        ? ' Static (EXTRACTED) dependencies exist but no runtime traffic has been seen — is OTel running?'\n        : ''\n      return formatEmptyResponse(`No OBSERVED dependencies for ${input.nodeId}.${note}`)\n    }\n    const blockLines = observed.map((e) => `  • ${e.target} — ${e.type}${edgeMeta(e)}`)\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${observed.length} runtime dependenc${observed.length === 1 ? 'y' : 'ies'} confirmed by OTel.`,\n      block: blockLines.join('\\n'),\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nfunction edgeMeta(e: GraphEdge): string {\n  const bits: string[] = []\n  if (e.signal) {\n    // Prefer the runtime signal numbers — \"saw 1,247 calls, 3 errors\" reads\n    // better than a derived 0.94 confidence.\n    bits.push(`spans=${e.signal.spanCount}`)\n    if (e.signal.errorCount > 0) bits.push(`errors=${e.signal.errorCount}`)\n    if (e.signal.lastObservedAgeMs !== undefined) {\n      bits.push(`age=${formatDuration(e.signal.lastObservedAgeMs)}`)\n    }\n  } else if (e.callCount !== undefined) {\n    bits.push(`callCount=${e.callCount}`)\n  }\n  if (e.lastObserved) bits.push(`lastObserved=${e.lastObserved}`)\n  if (e.confidence !== undefined) bits.push(`confidence=${e.confidence}`)\n  return bits.length ? ` [${bits.join(', ')}]` : ''\n}\n\nfunction formatDuration(ms: number): string {\n  if (ms < 1000) return `${Math.round(ms)}ms`\n  const s = Math.round(ms / 1000)\n  if (s < 60) return `${s}s`\n  const m = Math.round(s / 60)\n  if (m < 60) return `${m}m`\n  const h = Math.round(m / 60)\n  if (h < 48) return `${h}h`\n  return `${Math.round(h / 24)}d`\n}\n\nexport interface IncidentHistoryInput {\n  nodeId: string\n  limit?: number\n  project?: string\n}\n\nexport async function getIncidentHistory(\n  client: HttpClient,\n  input: IncidentHistoryInput,\n): Promise<ToolResponse> {\n  return withMissingNodeFallback(async () => {\n    const events = await client.get<ErrorEvent[]>(\n      projectPath(input.project, `/incidents/${encodeURIComponent(input.nodeId)}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(`No incidents recorded against ${input.nodeId}.`)\n    }\n    // ndjson order is append-time = oldest first. Reverse so the most recent\n    // event leads, then trim to the requested limit.\n    const ordered = [...events].reverse().slice(0, input.limit ?? 20)\n    const blockLines: string[] = []\n    for (const ev of ordered) {\n      blockLines.push(`  ${ev.timestamp} — ${ev.service}: ${ev.errorMessage}`)\n      blockLines.push(`    trace=${ev.traceId} span=${ev.spanId}`)\n    }\n    return formatToolResponse({\n      summary: `${input.nodeId} has ${events.length} recorded incident${events.length === 1 ? '' : 's'}; showing the ${ordered.length} most recent.`,\n      block: blockLines.join('\\n'),\n      // ErrorEvents are observation records, not graph edges — provenance is\n      // OBSERVED by definition (the OTel span happened).\n      provenance: Provenance.OBSERVED,\n    })\n  }, `Node ${input.nodeId} not found in the graph.`)\n}\n\nexport interface SemanticSearchInput {\n  query: string\n  project?: string\n}\n\ninterface SearchResponse {\n  query: string\n  provider?: 'ollama' | 'transformers' | 'substring'\n  matches: (GraphNode & { score?: number })[]\n}\n\nexport async function semanticSearch(\n  client: HttpClient,\n  input: SemanticSearchInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<SearchResponse>(\n      projectPath(input.project, `/search?q=${encodeURIComponent(input.query)}`),\n    )\n    if (result.matches.length === 0) {\n      return formatEmptyResponse(`No matches for \"${input.query}\".`)\n    }\n    const provider = result.provider ?? 'substring'\n    const blockLines: string[] = []\n    let topScore: number | undefined\n    for (const n of result.matches) {\n      // Embedding tiers attach a cosine score in [0,1]; substring fallback\n      // doesn't, so we elide the score when it's the placeholder 1.\n      const score = provider !== 'substring' && typeof n.score === 'number' ? n.score : undefined\n      const scoreBit = score !== undefined ? ` [score=${score.toFixed(2)}]` : ''\n      if (score !== undefined && (topScore === undefined || score > topScore)) topScore = score\n      blockLines.push(\n        `  • ${n.id} (${n.type}) — ${(n as { name?: string }).name ?? n.id}${scoreBit}`,\n      )\n    }\n    return formatToolResponse({\n      summary: `Found ${result.matches.length} match${result.matches.length === 1 ? '' : 'es'} for \"${input.query}\" via ${provider} provider.`,\n      block: blockLines.join('\\n'),\n      // Top similarity score doubles as a \"how confident is the embedder\n      // about the best match\" signal. Substring provider returns no score —\n      // the footer shows n/a in that case.\n      confidence: topScore,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface GraphDiffInput {\n  againstSnapshot: string\n  project?: string\n}\n\ninterface GraphDiffResponse {\n  base: { exportedAt?: string }\n  current: { exportedAt: string }\n  added: { nodes: GraphNode[]; edges: GraphEdge[] }\n  removed: { nodes: GraphNode[]; edges: GraphEdge[] }\n  changed: {\n    nodes: { id: string; before: GraphNode; after: GraphNode }[]\n    edges: { id: string; before: GraphEdge; after: GraphEdge }[]\n  }\n}\n\nexport async function getGraphDiff(\n  client: HttpClient,\n  input: GraphDiffInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<GraphDiffResponse>(\n      projectPath(\n        input.project,\n        `/graph/diff?against=${encodeURIComponent(input.againstSnapshot)}`,\n      ),\n    )\n    const total =\n      result.added.nodes.length +\n      result.added.edges.length +\n      result.removed.nodes.length +\n      result.removed.edges.length +\n      result.changed.nodes.length +\n      result.changed.edges.length\n    const baseLabel = result.base.exportedAt ?? 'unknown'\n    if (total === 0) {\n      return formatEmptyResponse(\n        `No differences between the current graph and ${input.againstSnapshot} (base exportedAt=${baseLabel}).`,\n      )\n    }\n    const blockLines: string[] = [\n      `  base exportedAt:    ${baseLabel}`,\n      `  current exportedAt: ${result.current.exportedAt}`,\n      '',\n    ]\n    if (result.added.nodes.length || result.added.edges.length) {\n      blockLines.push('Added:')\n      for (const n of result.added.nodes) blockLines.push(`  + node ${n.id} (${n.type})`)\n      for (const e of result.added.edges)\n        blockLines.push(`  + edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.removed.nodes.length || result.removed.edges.length) {\n      blockLines.push('Removed:')\n      for (const n of result.removed.nodes) blockLines.push(`  - node ${n.id} (${n.type})`)\n      for (const e of result.removed.edges)\n        blockLines.push(`  - edge ${e.id} — ${e.source} -> ${e.target} (${e.type}, ${e.provenance})`)\n      blockLines.push('')\n    }\n    if (result.changed.nodes.length || result.changed.edges.length) {\n      blockLines.push('Changed:')\n      for (const c of result.changed.nodes) {\n        blockLines.push(`  ~ node ${c.id} — ${summariseAttrDiff(c.before, c.after)}`)\n      }\n      for (const c of result.changed.edges) {\n        const provBit =\n          c.before.provenance !== c.after.provenance\n            ? `provenance ${c.before.provenance} → ${c.after.provenance}`\n            : summariseAttrDiff(c.before, c.after)\n        blockLines.push(`  ~ edge ${c.id} — ${provBit}`)\n      }\n    }\n    return formatToolResponse({\n      summary: `Diff against ${input.againstSnapshot}: ${total} change${total === 1 ? '' : 's'} between the snapshot and the live graph.`,\n      block: blockLines.join('\\n').trimEnd(),\n      // Diff results don't have a per-result provenance — the diff spans\n      // every edge type and provenance kind. Footer shows n/a.\n    })\n  } catch (err) {\n    if (err instanceof HttpError && err.status === 400) {\n      return formatErrorResponse(\n        `Could not load snapshot ${input.againstSnapshot}: ${err.message}`,\n      )\n    }\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nfunction summariseAttrDiff(\n  before: Record<string, unknown>,\n  after: Record<string, unknown>,\n): string {\n  const keys = new Set([...Object.keys(before), ...Object.keys(after)])\n  const changed: string[] = []\n  for (const k of keys) {\n    if (JSON.stringify(before[k]) !== JSON.stringify(after[k])) changed.push(k)\n  }\n  return changed.length === 0\n    ? 'attributes differ'\n    : `fields changed: ${changed.sort().join(', ')}`\n}\n\nexport interface RecentStaleEdgesInput {\n  limit?: number\n  edgeType?: string\n  project?: string\n}\n\ninterface StaleEventResponse {\n  edgeId: string\n  source: string\n  target: string\n  edgeType: string\n  thresholdMs: number\n  ageMs: number\n  lastObserved: string\n  transitionedAt: string\n}\n\nexport async function getRecentStaleEdges(\n  client: HttpClient,\n  input: RecentStaleEdgesInput,\n): Promise<ToolResponse> {\n  const params = new URLSearchParams()\n  if (input.limit !== undefined) params.set('limit', String(input.limit))\n  if (input.edgeType) params.set('edgeType', input.edgeType)\n  const qs = params.size > 0 ? `?${params.toString()}` : ''\n\n  try {\n    const events = await client.get<StaleEventResponse[]>(\n      projectPath(input.project, `/incidents/stale${qs}`),\n    )\n    if (events.length === 0) {\n      return formatEmptyResponse(\n        input.edgeType\n          ? `No stale ${input.edgeType} edges recorded.`\n          : 'No stale-edge transitions recorded yet.',\n      )\n    }\n    const blockLines = events.map(\n      (e) =>\n        `  ${e.transitionedAt} — ${e.source} -[${e.edgeType}]-> ${e.target}` +\n        ` (last seen ${e.lastObserved}, threshold ${formatDuration(e.thresholdMs)})`,\n    )\n    return formatToolResponse({\n      summary: `${events.length} stale-edge transition${events.length === 1 ? '' : 's'} recorded${input.edgeType ? ` for ${input.edgeType}` : ''}.`,\n      block: blockLines.join('\\n'),\n      // STALE by definition — every event is a transition into STALE.\n      provenance: Provenance.STALE,\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nexport interface CheckPoliciesInput {\n  // 'all' (default) returns every current violation. 'unresolved' is reserved\n  // for future resolution tracking — for the MVP it behaves the same as 'all'.\n  // { policyId } narrows to violations of one named policy.\n  scope?: 'all' | 'unresolved' | { policyId: string }\n  // When provided, dry-run evaluation: return violations that *would* result\n  // if the action were applied. Without it, return current violations.\n  hypotheticalAction?: HypotheticalAction\n  project?: string\n}\n\ninterface PoliciesCheckResponse {\n  allowed: boolean\n  hypotheticalAction?: HypotheticalAction\n  violations: PolicyViolation[]\n}\n\n// check_policies — single MCP tool covering both state-read and dry-run modes\n// per ADR-045. The contract explicitly rejects the audit's two-tool split\n// (evaluate_policy + get_policy_violations); both modes route through here.\nexport async function checkPolicies(\n  client: HttpClient,\n  input: CheckPoliciesInput,\n): Promise<ToolResponse> {\n  try {\n    let violations: PolicyViolation[]\n    let allowed = true\n    let hypothetical: HypotheticalAction | undefined\n\n    if (input.hypotheticalAction) {\n      // Dry-run via POST /policies/check.\n      const body = await postJson<PoliciesCheckResponse>(\n        client,\n        projectPath(input.project, '/policies/check'),\n        { hypotheticalAction: input.hypotheticalAction },\n      )\n      violations = body.violations\n      allowed = body.allowed\n      hypothetical = body.hypotheticalAction\n    } else {\n      // State read via GET /policies/violations. Optional scope filters via\n      // ?policyId=, severity isn't surfaced in the tool input today.\n      const qsParams = new URLSearchParams()\n      if (typeof input.scope === 'object' && 'policyId' in input.scope) {\n        qsParams.set('policyId', input.scope.policyId)\n      }\n      const qs = qsParams.size > 0 ? `?${qsParams.toString()}` : ''\n      violations = await client.get<PolicyViolation[]>(\n        projectPath(input.project, `/policies/violations${qs}`),\n      )\n      allowed = violations.every((v) => v.onViolation !== 'block')\n    }\n\n    if (violations.length === 0) {\n      return formatEmptyResponse(\n        hypothetical\n          ? `No violations would result from the hypothetical action (${hypothetical.kind}).`\n          : 'No policy violations recorded.',\n      )\n    }\n\n    const blockCount = violations.filter((v) => v.onViolation === 'block').length\n    const summaryParts: string[] = []\n    if (hypothetical) {\n      summaryParts.push(\n        `Hypothetical ${hypothetical.kind} would surface ${violations.length} violation${violations.length === 1 ? '' : 's'}`,\n      )\n    } else {\n      summaryParts.push(\n        `${violations.length} policy violation${violations.length === 1 ? '' : 's'} currently recorded`,\n      )\n    }\n    if (blockCount > 0) {\n      summaryParts.push(`${blockCount} of which block`)\n    }\n    if (!allowed && hypothetical) {\n      summaryParts.push('action denied')\n    }\n    const summary = summaryParts.join('; ') + '.'\n\n    const blockLines = violations.map((v) => {\n      const subject = v.subject.nodeId ?? v.subject.edgeId ?? v.subject.path?.[0] ?? '(global)'\n      return `  • [${v.severity}/${v.onViolation}] ${v.policyName}: ${v.message} — ${subject}`\n    })\n    const severities = [...new Set(violations.map((v) => v.severity))]\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      // Confidence: hypothetical results inherit a 0.7 cap (the engine\n      // can't fully simulate every action shape in MVP); confirmed\n      // violations report 1.00 since the engine ran against current state.\n      confidence: hypothetical ? 0.7 : 1,\n      provenance: severities.join(' '),\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// get_divergences (ADR-060) — the thesis surface\n// ──────────────────────────────────────────────────────────────────────────\n\nexport interface DivergencesInput {\n  type?: ReadonlyArray<DivergenceType>\n  minConfidence?: number\n  node?: string\n  project?: string\n}\n\nfunction buildDivergencesPath(input: DivergencesInput): string {\n  const params = new URLSearchParams()\n  if (input.type && input.type.length > 0) params.set('type', input.type.join(','))\n  if (input.minConfidence !== undefined) {\n    params.set('minConfidence', String(input.minConfidence))\n  }\n  if (input.node) params.set('node', input.node)\n  const qs = params.size > 0 ? `?${params.toString()}` : ''\n  return projectPath(input.project, `/graph/divergences${qs}`)\n}\n\nfunction formatDivergenceLine(d: Divergence): string {\n  switch (d.type) {\n    case 'missing-observed':\n      return `  • [${d.type}] ${d.source} → ${d.target} (${d.edgeType}) — confidence ${d.confidence.toFixed(2)}`\n    case 'missing-extracted':\n      return `  • [${d.type}] ${d.source} → ${d.target} (${d.edgeType}) — confidence ${d.confidence.toFixed(2)}`\n    case 'version-mismatch':\n      return `  • [${d.type}] ${d.source} → ${d.target} — declared ${d.extractedVersion}, observed engine ${d.observedVersion} (${d.compatibility})`\n    case 'host-mismatch':\n      return `  • [${d.type}] ${d.source} → ${d.target} — declared host ${d.extractedHost}, observed host ${d.observedHost}`\n    case 'compat-violation':\n      return `  • [${d.type}] ${d.source} → ${d.target} — ${d.rule.kind}${d.rule.package ? ` (${d.rule.package})` : ''}`\n  }\n}\n\nexport async function getDivergences(\n  client: HttpClient,\n  input: DivergencesInput,\n): Promise<ToolResponse> {\n  try {\n    const result = await client.get<DivergenceResult>(buildDivergencesPath(input))\n    if (result.totalAffected === 0) {\n      return formatEmptyResponse(\n        'No divergences found between the declared (EXTRACTED) and observed (OBSERVED) views of the graph.',\n      )\n    }\n    // Sorted by confidence descending already; first entry is the headline.\n    const headline = result.divergences[0]!\n    const summary =\n      `Found ${result.totalAffected} divergence${result.totalAffected === 1 ? '' : 's'} between code and production. ` +\n      `Highest-confidence: ${headline.type} on ${headline.source} → ${headline.target}. ${headline.reason}`\n    const blockLines: string[] = []\n    for (const d of result.divergences) {\n      blockLines.push(formatDivergenceLine(d))\n      blockLines.push(`    reason: ${d.reason}`)\n      blockLines.push(`    recommendation: ${d.recommendation}`)\n    }\n    const maxConfidence = result.divergences.reduce(\n      (m, d) => Math.max(m, d.confidence),\n      0,\n    )\n    return formatToolResponse({\n      summary,\n      block: blockLines.join('\\n'),\n      confidence: maxConfidence,\n      // Composite provenance — divergences sit between EXTRACTED and\n      // OBSERVED by construction; that's what makes them divergences.\n      provenance: 'composite (EXTRACTED + OBSERVED)',\n    })\n  } catch (err) {\n    return formatErrorResponse(`Error talking to neat-core: ${(err as Error).message}`)\n  }\n}\n\nasync function postJson<T>(\n  client: HttpClient,\n  path: string,\n  body: unknown,\n): Promise<T> {\n  // The base HttpClient interface only exposes get(). For POST we need to\n  // reach into the underlying transport. Most callers pass the client built\n  // by createHttpClient which has post; types are kept minimal so test\n  // stubs don't have to implement post unless the tool needs it.\n  const c = client as HttpClient & { post?: <U>(p: string, b: unknown) => Promise<U> }\n  if (typeof c.post !== 'function') {\n    throw new Error('HttpClient does not support POST — required for check_policies dry-run')\n  }\n  return c.post<T>(path, body)\n}\n","// Standardized three-part response format for every MCP tool (ADR-039,\n// issue #143). Output shape:\n//\n//   {summary — NL paragraph: what was found, why it matters}\n//\n//   {block — typed payload, formatted}\n//\n//   confidence: 0.94 · provenance: OBSERVED\n//\n// Empty result → footer reads \"confidence: n/a · provenance: n/a\". Every tool\n// in packages/mcp/src/tools.ts routes through this helper so consumers get a\n// consistent shape — agents can pattern-match on the footer to know how much\n// to trust the answer.\n\nexport interface ToolResponse {\n  [x: string]: unknown\n  content: { type: 'text'; text: string }[]\n  isError?: boolean\n}\n\nexport interface FormatToolResponseInput {\n  // NL paragraph. One or two sentences. What was found and why it matters.\n  summary: string\n  // Structured block. The formatted typed payload — usually a bullet list,\n  // sometimes a multi-section breakdown. May be empty when the summary\n  // already conveys everything.\n  block?: string\n  // Per-result confidence in [0, 1]. Undefined → footer reads \"n/a\".\n  confidence?: number\n  // Per-result provenance. Single value, or an array if the result spans\n  // mixed provenances (e.g. a path of OBSERVED + EXTRACTED edges). Undefined\n  // → footer reads \"n/a\".\n  provenance?: string | string[]\n  // Set on transport / 5xx errors. Routes through ToolResponse.isError so\n  // MCP clients can surface a non-\"normal\" return.\n  isError?: boolean\n}\n\nfunction formatFooter(\n  confidence: number | undefined,\n  provenance: string | string[] | undefined,\n): string {\n  const c = confidence === undefined ? 'n/a' : confidence.toFixed(2)\n  const p =\n    provenance === undefined\n      ? 'n/a'\n      : Array.isArray(provenance)\n        ? [...new Set(provenance)].join(', ')\n        : provenance\n  return `confidence: ${c} · provenance: ${p}`\n}\n\nexport function formatToolResponse(input: FormatToolResponseInput): ToolResponse {\n  const sections: string[] = [input.summary.trim()]\n  if (input.block && input.block.trim().length > 0) {\n    sections.push(input.block.trimEnd())\n  }\n  sections.push(formatFooter(input.confidence, input.provenance))\n  const text = sections.join('\\n\\n')\n  return {\n    content: [{ type: 'text', text }],\n    ...(input.isError ? { isError: true } : {}),\n  }\n}\n\n// Convenience for the \"node not found / empty graph\" path. Keeps the\n// three-part shape (summary still landed) but sets the footer to n/a / n/a\n// since there's nothing to confidence-tag or provenance-tag.\nexport function formatEmptyResponse(summary: string): ToolResponse {\n  return formatToolResponse({ summary })\n}\n\n// Convenience for transport / 5xx errors at the MCP boundary. isError set\n// so MCP clients route the response into their error path.\nexport function formatErrorResponse(message: string): ToolResponse {\n  return formatToolResponse({ summary: message, isError: true })\n}\n"],"mappings":";;;AAEA,SAAS,iBAAiB;AAC1B,SAAS,4BAA4B;AACrC,SAAS,SAAS;AAClB,SAAS,0BAA0B,gCAAgC;;;ACM5D,SAAS,iBAAiBA,UAA6B;AAC5D,QAAM,OAAOA,SAAQ,QAAQ,OAAO,EAAE;AACtC,SAAO;AAAA,IACL,MAAM,IAAO,MAA0B;AACrC,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,EAAE;AACxC,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,WAAW,IAAI,KAAK,IAAI,EAAE;AAAA,MAC3F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,IACA,MAAM,KAAQ,MAAc,MAA2B;AACrD,YAAM,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,IAAI;AAAA,QACxC,QAAQ;AAAA,QACR,SAAS,EAAE,gBAAgB,mBAAmB;AAAA,QAC9C,MAAM,KAAK,UAAU,IAAI;AAAA,MAC3B,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC5C,cAAM,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,YAAY,IAAI,KAAK,IAAI,EAAE;AAAA,MAC5F;AACA,aAAQ,MAAM,IAAI,KAAK;AAAA,IACzB;AAAA,EACF;AACF;AAEO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACkB,QAChB,SACA;AACA,UAAM,OAAO;AAHG;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;;;ACjCA;AAAA,EACE;AAAA,OACK;AAkBP,IAAM,qBAAqB;AAC3B,IAAM,gBAAgB;AACtB,IAAM,0BAA0B;AAChC,IAAM,wBAAwB;AAC9B,IAAM,kCAAkC;AAExC,SAAS,QAAQ,IAAoB;AAGnC,SAAO,eAAe,mBAAmB,EAAE,CAAC;AAC9C;AAIA,SAAS,WAAW,SAAqC;AACvD,SAAO,UAAU,aAAa,mBAAmB,OAAO,CAAC,KAAK;AAChE;AAEA,SAAS,cAAc,OAA0B;AAC/C,SAAQ,MAA4B,QAAQ,MAAM;AACpD;AAEA,eAAsB,kBACpBC,SACA,SAC8B;AAC9B,QAAM,QAAQ,MAAMA,QAAO,IAAqB,GAAG,WAAW,OAAO,CAAC,QAAQ;AAC9E,SAAO;AAAA,IACL,WAAW,MAAM,MAAM,IAAI,CAAC,OAAO;AAAA,MACjC,KAAK,QAAQ,EAAE,EAAE;AAAA,MACjB,MAAM,cAAc,CAAC;AAAA,MACrB,aAAa,GAAG,EAAE,IAAI,WAAM,cAAc,CAAC,CAAC;AAAA,MAC5C,UAAU;AAAA,IACZ,EAAE;AAAA,EACJ;AACF;AAEA,eAAsB,iBACpBA,SACA,IACA,SAC6B;AAC7B,QAAM,MAAM,QAAQ,EAAE;AACtB,QAAM,SAAS,WAAW,OAAO;AACjC,MAAI;AACF,UAAM,CAAC,OAAO,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,MACvCA,QAAO,IAAe,GAAG,MAAM,eAAe,mBAAmB,EAAE,CAAC,EAAE;AAAA,MACtEA,QAAO,IAAmB,GAAG,MAAM,gBAAgB,mBAAmB,EAAE,CAAC,EAAE;AAAA,IAC7E,CAAC;AACD,UAAM,OAAO;AAAA,MACX,MAAM;AAAA;AAAA;AAAA;AAAA,MAIN,eAAe,MAAM;AAAA,IACvB;AACA,WAAO;AAAA,MACL,UAAU;AAAA,QACR;AAAA,UACE;AAAA,UACA,UAAU;AAAA,UACV,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAAA,EACF,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,UAAU;AAAA,UACR;AAAA,YACE;AAAA,YACA,UAAU;AAAA,YACV,MAAM,KAAK,UAAU,EAAE,OAAO,kBAAkB,GAAG,CAAC;AAAA,UACtD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACF;AAEA,eAAsB,6BACpBA,SACA,QAAgB,iCAChB,SAC6B;AAC7B,QAAM,aAAa,MAAMA,QAAO;AAAA,IAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,EACxB;AAGA,QAAM,UAAU,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACxD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,WAAW,QAAQ,YAAY,QAAQ;AAAA,UACvE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAsB,4BACpBA,SACA,QAAgB,yBAChB,SAC6B;AAC7B,QAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAEhF,QAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACpD,SAAO;AAAA,IACL,UAAU;AAAA,MACR;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,UACT,EAAE,OAAO,QAAQ,QAAQ,OAAO,OAAO,QAAQ,QAAQ,QAAQ;AAAA,UAC/D;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOO,SAAS,iBACd,MACA,MACS;AACT,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,KAAK,UAAU,KAAK,MAAO,QAAO;AACtC,MAAI,KAAK,WAAW,KAAK,OAAQ,QAAO;AACxC,SAAO;AACT;AAgBO,SAAS,kBACdC,SACAD,SACA,UAAoC,CAAC,GACf;AACtB,QAAM,SAAS,QAAQ,mBAAmB;AAC1C,QAAM,UAAU,QAAQ;AAIxB,EAAAC,QAAO;AAAA,IACL;AAAA,IACA,IAAI,iBAAiB,oBAAoB;AAAA,MACvC,MAAM,YAAY,kBAAkBD,SAAQ,OAAO;AAAA,IACrD,CAAC;AAAA,IACD;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,OAAO,MAAM,cAAc;AACzB,YAAM,MAAM,UAAU;AACtB,YAAM,KAAK,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,IAAI;AACzC,UAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAAG;AAC7C,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AACA,YAAM,UAAU,GAAG,SAAS,GAAG,IAAI,mBAAmB,EAAE,IAAI;AAC5D,aAAO,iBAAiBA,SAAQ,SAAS,OAAO;AAAA,IAClD;AAAA,EACF;AAIA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,4BAA4BD,SAAQ,yBAAyB,OAAO;AAAA,EAClF;AAKA,EAAAC,QAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,MACE,aACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,IACA,YAAY,6BAA6BD,SAAQ,iCAAiC,OAAO;AAAA,EAC3F;AAEA,MAAI,UAAU;AACd,MAAI,QAA+B;AACnC,MAAI,gBAA2D;AAC/D,MAAI,iBAA4D;AAEhE,QAAM,OAAO,YAA2B;AACtC,QAAI,QAAS;AAEb,QAAI;AACF,YAAM,SAAS,MAAMA,QAAO,IAAkB,GAAG,WAAW,OAAO,CAAC,YAAY;AAChF,YAAM,OAAO;AAAA,QACX,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO,SAAS,IAAI,OAAO,OAAO,SAAS,CAAC,EAAE,KAAK;AAAA,MAC7D;AACA,UAAI,iBAAiB,eAAe,IAAI,GAAG;AACzC,cAAMC,QAAO,OAAO,oBAAoB,EAAE,KAAK,cAAc,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MAChF;AACA,sBAAgB;AAAA,IAClB,QAAQ;AAAA,IAER;AAIA,QAAI;AACF,YAAM,aAAa,MAAMD,QAAO;AAAA,QAC9B,GAAG,WAAW,OAAO,CAAC;AAAA,MACxB;AACA,YAAM,OAAO;AAAA,QACX,OAAO,WAAW;AAAA,QAClB,QACE,WAAW,SAAS,IAAI,WAAW,WAAW,SAAS,CAAC,EAAE,KAAK;AAAA,MACnE;AACA,UAAI,iBAAiB,gBAAgB,IAAI,GAAG;AAC1C,cAAMC,QAAO,OACV,oBAAoB,EAAE,KAAK,sBAAsB,CAAC,EAClD,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACnB;AACA,uBAAiB;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,MAAI,SAAS,GAAG;AAGd,YAAQ,YAAY,MAAM;AACxB,WAAK,KAAK;AAAA,IACZ,GAAG,MAAM;AACT,QAAI,OAAO,MAAM,UAAU,WAAY,OAAM,MAAM;AAAA,EACrD;AAEA,SAAO;AAAA,IACL,MAAM,MAAY;AAChB,gBAAU;AACV,UAAI,MAAO,eAAc,KAAK;AAC9B,cAAQ;AAAA,IACV;AAAA,EACF;AACF;;;AF7SA,SAAS,4BAA4B;;;AGYrC,SAAS,kBAAkB;;;ACkB3B,SAAS,aACP,YACA,YACQ;AACR,QAAM,IAAI,eAAe,SAAY,QAAQ,WAAW,QAAQ,CAAC;AACjE,QAAM,IACJ,eAAe,SACX,QACA,MAAM,QAAQ,UAAU,IACtB,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,IAAI,IAClC;AACR,SAAO,eAAe,CAAC,qBAAkB,CAAC;AAC5C;AAEO,SAAS,mBAAmB,OAA8C;AAC/E,QAAM,WAAqB,CAAC,MAAM,QAAQ,KAAK,CAAC;AAChD,MAAI,MAAM,SAAS,MAAM,MAAM,KAAK,EAAE,SAAS,GAAG;AAChD,aAAS,KAAK,MAAM,MAAM,QAAQ,CAAC;AAAA,EACrC;AACA,WAAS,KAAK,aAAa,MAAM,YAAY,MAAM,UAAU,CAAC;AAC9D,QAAM,OAAO,SAAS,KAAK,MAAM;AACjC,SAAO;AAAA,IACL,SAAS,CAAC,EAAE,MAAM,QAAQ,KAAK,CAAC;AAAA,IAChC,GAAI,MAAM,UAAU,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,EAC3C;AACF;AAKO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,QAAQ,CAAC;AACvC;AAIO,SAAS,oBAAoB,SAA+B;AACjE,SAAO,mBAAmB,EAAE,SAAS,SAAS,SAAS,KAAK,CAAC;AAC/D;;;ADzCA,SAAS,YAAY,SAA6B,QAAwB;AACxE,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,aAAa,mBAAmB,OAAO,CAAC,GAAG,MAAM;AAC1D;AAGA,eAAe,wBACb,IACA,iBACuB;AACvB,MAAI;AACF,WAAO,MAAM,GAAG;AAAA,EAClB,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO,oBAAoB,eAAe;AAAA,IAC5C;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAQA,eAAsB,aAAaC,SAAoB,OAA8C;AACnG,QAAM,KAAK,MAAM,UAAU,YAAY,mBAAmB,MAAM,OAAO,CAAC,KAAK;AAC7E,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,wBAAwB,mBAAmB,MAAM,SAAS,CAAC,GAAG,EAAE;AAAA,EAClE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAqB,IAAI;AACrD,UAAM,YAAY,OAAO,cAAc,KAAK,UAAK;AACjD,UAAM,cAAc,OAAO,gBAAgB,SACvC,OAAO,gBAAgB,KAAK,IAAI,IAChC;AACJ,UAAM,UACJ,kBAAkB,MAAM,SAAS,OAAO,OAAO,aAAa,OAC5D,OAAO,mBACN,OAAO,oBAAoB,qBAAqB,OAAO,iBAAiB,MAAM;AACjF,UAAM,aAAa;AAAA,MACjB,mBAAmB,SAAS;AAAA,MAC5B,qBAAqB,WAAW;AAAA,IAClC;AACA,QAAI,OAAO,mBAAmB;AAC5B,iBAAW,KAAK,oBAAoB,OAAO,iBAAiB,EAAE;AAAA,IAChE;AACA,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO,gBAAgB,SAAS,OAAO,kBAAkB;AAAA,IACvE,CAAC;AAAA,EACH,GAAG,2BAA2B,MAAM,SAAS,8DAA8D;AAC7G;AAQA,eAAsB,eACpBA,SACA,OACuB;AACvB,QAAM,KAAK,MAAM,UAAU,SAAY,UAAU,MAAM,KAAK,KAAK;AACjE,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,0BAA0B,mBAAmB,MAAM,MAAM,CAAC,GAAG,EAAE;AAAA,EACjE;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAuB,IAAI;AACvD,QAAI,OAAO,kBAAkB,GAAG;AAC9B,aAAO;AAAA,QACL,GAAG,OAAO,MAAM;AAAA,MAClB;AAAA,IACF;AACA,UAAM,SAAS,CAAC,GAAG,OAAO,aAAa,EAAE;AAAA,MACvC,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,IACtE;AACA,UAAM,aAAa,OAAO,IAAI,gBAAgB;AAI9C,UAAM,gBAAgB,OAAO;AAAA,MAC3B,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,UAAU;AAAA,MAClC,OAAO;AAAA,IACT;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AACpE,WAAO,mBAAmB;AAAA,MACxB,SAAS,oBAAoB,OAAO,MAAM,KAAK,OAAO,aAAa,iBAAiB,OAAO,kBAAkB,IAAI,KAAK,GAAG;AAAA,MACzH,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,OAAO,SAAS,aAAa,IAAI,gBAAgB;AAAA,MAC7D,YAAY,YAAY,SAAS,cAAc;AAAA,IACjD,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,iBAAiB,GAAoC;AAC5D,QAAM,MAAM,EAAE,mBAAmB,WAAW,QAAQ,2CAAsC;AAC1F,SAAO,YAAO,EAAE,MAAM,cAAc,EAAE,QAAQ,KAAK,EAAE,cAAc,IAAI,GAAG;AAC5E;AAmBA,eAAsB,gBACpBA,SACA,OACuB;AACvB,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,eAAe,mBAAmB,MAAM,MAAM,CAAC,uBAAuB,KAAK;AAAA,EAC7E;AAEA,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO,IAAkC,IAAI;AAClE,QAAI,OAAO,UAAU,GAAG;AACtB,aAAO;AAAA,QACL,UAAU,IACN,GAAG,MAAM,MAAM,8CACf,GAAG,MAAM,MAAM,sCAAsC,KAAK;AAAA,MAChE;AAAA,IACF;AAEA,UAAM,aAAa,oBAAI,IAAwC;AAC/D,eAAW,OAAO,OAAO,cAAc;AACrC,YAAM,OAAO,WAAW,IAAI,IAAI,QAAQ,KAAK,CAAC;AAC9C,WAAK,KAAK,GAAG;AACb,iBAAW,IAAI,IAAI,UAAU,IAAI;AAAA,IACnC;AACA,UAAM,aAAuB,CAAC;AAC9B,eAAW,YAAY,CAAC,GAAG,WAAW,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG;AACnE,YAAM,QAAQ,aAAa,IAAI,wBAAwB,YAAY,QAAQ;AAC3E,iBAAW,KAAK,GAAG,KAAK,GAAG;AAC3B,iBAAW,OAAO,WAAW,IAAI,QAAQ,GAAI;AAC3C,mBAAW,KAAK,YAAO,IAAI,MAAM,WAAM,IAAI,QAAQ,KAAK,IAAI,UAAU,GAAG;AAAA,MAC3E;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,aAAa,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAC7E,UAAM,cAAc,WAAW,IAAI,CAAC,GAAG,UAAU;AACjD,UAAM,UACJ,UAAU,IACN,GAAG,MAAM,MAAM,QAAQ,WAAW,oBAAoB,gBAAgB,IAAI,MAAM,KAAK,MACrF,GAAG,MAAM,MAAM,QAAQ,OAAO,KAAK,aAAa,OAAO,UAAU,IAAI,MAAM,KAAK,uBAAuB,KAAK,KAAK,WAAW;AAClI,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,eAAsB,wBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,QAAQ,MAAMA,QAAO;AAAA,MACzB,YAAY,MAAM,SAAS,gBAAgB,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC/E;AACA,UAAM,WAAW,MAAM,SAAS,OAAO,CAAC,MAAM,EAAE,eAAe,WAAW,QAAQ;AAClF,QAAI,SAAS,WAAW,GAAG;AACzB,YAAM,eAAe,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,eAAe,WAAW,SAAS;AACrF,YAAM,OAAO,eACT,wGACA;AACJ,aAAO,oBAAoB,gCAAgC,MAAM,MAAM,IAAI,IAAI,EAAE;AAAA,IACnF;AACA,UAAM,aAAa,SAAS,IAAI,CAAC,MAAM,YAAO,EAAE,MAAM,WAAM,EAAE,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE;AAClF,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,SAAS,MAAM,qBAAqB,SAAS,WAAW,IAAI,MAAM,KAAK;AAAA,MACvG,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY,WAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAEA,SAAS,SAAS,GAAsB;AACtC,QAAM,OAAiB,CAAC;AACxB,MAAI,EAAE,QAAQ;AAGZ,SAAK,KAAK,SAAS,EAAE,OAAO,SAAS,EAAE;AACvC,QAAI,EAAE,OAAO,aAAa,EAAG,MAAK,KAAK,UAAU,EAAE,OAAO,UAAU,EAAE;AACtE,QAAI,EAAE,OAAO,sBAAsB,QAAW;AAC5C,WAAK,KAAK,OAAO,eAAe,EAAE,OAAO,iBAAiB,CAAC,EAAE;AAAA,IAC/D;AAAA,EACF,WAAW,EAAE,cAAc,QAAW;AACpC,SAAK,KAAK,aAAa,EAAE,SAAS,EAAE;AAAA,EACtC;AACA,MAAI,EAAE,aAAc,MAAK,KAAK,gBAAgB,EAAE,YAAY,EAAE;AAC9D,MAAI,EAAE,eAAe,OAAW,MAAK,KAAK,cAAc,EAAE,UAAU,EAAE;AACtE,SAAO,KAAK,SAAS,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM;AACjD;AAEA,SAAS,eAAe,IAAoB;AAC1C,MAAI,KAAK,IAAM,QAAO,GAAG,KAAK,MAAM,EAAE,CAAC;AACvC,QAAM,IAAI,KAAK,MAAM,KAAK,GAAI;AAC9B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,QAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,MAAI,IAAI,GAAI,QAAO,GAAG,CAAC;AACvB,SAAO,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC;AAC9B;AAQA,eAAsB,mBACpBA,SACA,OACuB;AACvB,SAAO,wBAAwB,YAAY;AACzC,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,cAAc,mBAAmB,MAAM,MAAM,CAAC,EAAE;AAAA,IAC7E;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,oBAAoB,iCAAiC,MAAM,MAAM,GAAG;AAAA,IAC7E;AAGA,UAAM,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,SAAS,EAAE;AAChE,UAAM,aAAuB,CAAC;AAC9B,eAAW,MAAM,SAAS;AACxB,iBAAW,KAAK,KAAK,GAAG,SAAS,WAAM,GAAG,OAAO,KAAK,GAAG,YAAY,EAAE;AACvE,iBAAW,KAAK,aAAa,GAAG,OAAO,SAAS,GAAG,MAAM,EAAE;AAAA,IAC7D;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,MAAM,MAAM,QAAQ,OAAO,MAAM,qBAAqB,OAAO,WAAW,IAAI,KAAK,GAAG,iBAAiB,QAAQ,MAAM;AAAA,MAC/H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA,MAG3B,YAAY,WAAW;AAAA,IACzB,CAAC;AAAA,EACH,GAAG,QAAQ,MAAM,MAAM,0BAA0B;AACnD;AAaA,eAAsB,eACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,aAAa,mBAAmB,MAAM,KAAK,CAAC,EAAE;AAAA,IAC3E;AACA,QAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,aAAO,oBAAoB,mBAAmB,MAAM,KAAK,IAAI;AAAA,IAC/D;AACA,UAAM,WAAW,OAAO,YAAY;AACpC,UAAM,aAAuB,CAAC;AAC9B,QAAI;AACJ,eAAW,KAAK,OAAO,SAAS;AAG9B,YAAM,QAAQ,aAAa,eAAe,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAClF,YAAM,WAAW,UAAU,SAAY,WAAW,MAAM,QAAQ,CAAC,CAAC,MAAM;AACxE,UAAI,UAAU,WAAc,aAAa,UAAa,QAAQ,UAAW,YAAW;AACpF,iBAAW;AAAA,QACT,YAAO,EAAE,EAAE,KAAK,EAAE,IAAI,YAAQ,EAAwB,QAAQ,EAAE,EAAE,GAAG,QAAQ;AAAA,MAC/E;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,SAAS,OAAO,QAAQ,MAAM,SAAS,OAAO,QAAQ,WAAW,IAAI,KAAK,IAAI,SAAS,MAAM,KAAK,SAAS,QAAQ;AAAA,MAC5H,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY;AAAA,IACd,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAkBA,eAAsB,aACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B;AAAA,QACE,MAAM;AAAA,QACN,uBAAuB,mBAAmB,MAAM,eAAe,CAAC;AAAA,MAClE;AAAA,IACF;AACA,UAAM,QACJ,OAAO,MAAM,MAAM,SACnB,OAAO,MAAM,MAAM,SACnB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM,SACrB,OAAO,QAAQ,MAAM;AACvB,UAAM,YAAY,OAAO,KAAK,cAAc;AAC5C,QAAI,UAAU,GAAG;AACf,aAAO;AAAA,QACL,gDAAgD,MAAM,eAAe,qBAAqB,SAAS;AAAA,MACrG;AAAA,IACF;AACA,UAAM,aAAuB;AAAA,MAC3B,yBAAyB,SAAS;AAAA,MAClC,yBAAyB,OAAO,QAAQ,UAAU;AAAA,MAClD;AAAA,IACF;AACA,QAAI,OAAO,MAAM,MAAM,UAAU,OAAO,MAAM,MAAM,QAAQ;AAC1D,iBAAW,KAAK,QAAQ;AACxB,iBAAW,KAAK,OAAO,MAAM,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AAClF,iBAAW,KAAK,OAAO,MAAM;AAC3B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,MAAO,YAAW,KAAK,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG;AACpF,iBAAW,KAAK,OAAO,QAAQ;AAC7B,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,UAAU,GAAG;AAC9F,iBAAW,KAAK,EAAE;AAAA,IACpB;AACA,QAAI,OAAO,QAAQ,MAAM,UAAU,OAAO,QAAQ,MAAM,QAAQ;AAC9D,iBAAW,KAAK,UAAU;AAC1B,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,kBAAkB,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE;AAAA,MAC9E;AACA,iBAAW,KAAK,OAAO,QAAQ,OAAO;AACpC,cAAM,UACJ,EAAE,OAAO,eAAe,EAAE,MAAM,aAC5B,cAAc,EAAE,OAAO,UAAU,WAAM,EAAE,MAAM,UAAU,KACzD,kBAAkB,EAAE,QAAQ,EAAE,KAAK;AACzC,mBAAW,KAAK,YAAY,EAAE,EAAE,WAAM,OAAO,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,gBAAgB,MAAM,eAAe,KAAK,KAAK,UAAU,UAAU,IAAI,KAAK,GAAG;AAAA,MACxF,OAAO,WAAW,KAAK,IAAI,EAAE,QAAQ;AAAA;AAAA;AAAA,IAGvC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,QAAI,eAAe,aAAa,IAAI,WAAW,KAAK;AAClD,aAAO;AAAA,QACL,2BAA2B,MAAM,eAAe,KAAK,IAAI,OAAO;AAAA,MAClE;AAAA,IACF;AACA,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,SAAS,kBACP,QACA,OACQ;AACR,QAAM,OAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AACpE,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,MAAM;AACpB,QAAI,KAAK,UAAU,OAAO,CAAC,CAAC,MAAM,KAAK,UAAU,MAAM,CAAC,CAAC,EAAG,SAAQ,KAAK,CAAC;AAAA,EAC5E;AACA,SAAO,QAAQ,WAAW,IACtB,sBACA,mBAAmB,QAAQ,KAAK,EAAE,KAAK,IAAI,CAAC;AAClD;AAmBA,eAAsB,oBACpBA,SACA,OACuB;AACvB,QAAM,SAAS,IAAI,gBAAgB;AACnC,MAAI,MAAM,UAAU,OAAW,QAAO,IAAI,SAAS,OAAO,MAAM,KAAK,CAAC;AACtE,MAAI,MAAM,SAAU,QAAO,IAAI,YAAY,MAAM,QAAQ;AACzD,QAAM,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,SAAS,CAAC,KAAK;AAEvD,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO;AAAA,MAC1B,YAAY,MAAM,SAAS,mBAAmB,EAAE,EAAE;AAAA,IACpD;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,QACL,MAAM,WACF,YAAY,MAAM,QAAQ,qBAC1B;AAAA,MACN;AAAA,IACF;AACA,UAAM,aAAa,OAAO;AAAA,MACxB,CAAC,MACC,KAAK,EAAE,cAAc,WAAM,EAAE,MAAM,MAAM,EAAE,QAAQ,OAAO,EAAE,MAAM,eACnD,EAAE,YAAY,eAAe,eAAe,EAAE,WAAW,CAAC;AAAA,IAC7E;AACA,WAAO,mBAAmB;AAAA,MACxB,SAAS,GAAG,OAAO,MAAM,yBAAyB,OAAO,WAAW,IAAI,KAAK,GAAG,YAAY,MAAM,WAAW,QAAQ,MAAM,QAAQ,KAAK,EAAE;AAAA,MAC1I,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA,MAE3B,YAAY,WAAW;AAAA,IACzB,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAsBA,eAAsB,cACpBA,SACA,OACuB;AACvB,MAAI;AACF,QAAI;AACJ,QAAI,UAAU;AACd,QAAI;AAEJ,QAAI,MAAM,oBAAoB;AAE5B,YAAM,OAAO,MAAM;AAAA,QACjBA;AAAA,QACA,YAAY,MAAM,SAAS,iBAAiB;AAAA,QAC5C,EAAE,oBAAoB,MAAM,mBAAmB;AAAA,MACjD;AACA,mBAAa,KAAK;AAClB,gBAAU,KAAK;AACf,qBAAe,KAAK;AAAA,IACtB,OAAO;AAGL,YAAM,WAAW,IAAI,gBAAgB;AACrC,UAAI,OAAO,MAAM,UAAU,YAAY,cAAc,MAAM,OAAO;AAChE,iBAAS,IAAI,YAAY,MAAM,MAAM,QAAQ;AAAA,MAC/C;AACA,YAAM,KAAK,SAAS,OAAO,IAAI,IAAI,SAAS,SAAS,CAAC,KAAK;AAC3D,mBAAa,MAAMA,QAAO;AAAA,QACxB,YAAY,MAAM,SAAS,uBAAuB,EAAE,EAAE;AAAA,MACxD;AACA,gBAAU,WAAW,MAAM,CAAC,MAAM,EAAE,gBAAgB,OAAO;AAAA,IAC7D;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL,eACI,4DAA4D,aAAa,IAAI,OAC7E;AAAA,MACN;AAAA,IACF;AAEA,UAAM,aAAa,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,OAAO,EAAE;AACvE,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAChB,mBAAa;AAAA,QACX,gBAAgB,aAAa,IAAI,kBAAkB,WAAW,MAAM,aAAa,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MACrH;AAAA,IACF,OAAO;AACL,mBAAa;AAAA,QACX,GAAG,WAAW,MAAM,oBAAoB,WAAW,WAAW,IAAI,KAAK,GAAG;AAAA,MAC5E;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,mBAAa,KAAK,GAAG,UAAU,iBAAiB;AAAA,IAClD;AACA,QAAI,CAAC,WAAW,cAAc;AAC5B,mBAAa,KAAK,eAAe;AAAA,IACnC;AACA,UAAM,UAAU,aAAa,KAAK,IAAI,IAAI;AAE1C,UAAM,aAAa,WAAW,IAAI,CAAC,MAAM;AACvC,YAAM,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,UAAU,EAAE,QAAQ,OAAO,CAAC,KAAK;AAC/E,aAAO,aAAQ,EAAE,QAAQ,IAAI,EAAE,WAAW,KAAK,EAAE,UAAU,KAAK,EAAE,OAAO,WAAM,OAAO;AAAA,IACxF,CAAC;AACD,UAAM,aAAa,CAAC,GAAG,IAAI,IAAI,WAAW,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AACjE,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,MAI3B,YAAY,eAAe,MAAM;AAAA,MACjC,YAAY,WAAW,KAAK,GAAG;AAAA,IACjC,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAaA,SAAS,qBAAqB,OAAiC;AAC7D,QAAM,SAAS,IAAI,gBAAgB;AACnC,MAAI,MAAM,QAAQ,MAAM,KAAK,SAAS,EAAG,QAAO,IAAI,QAAQ,MAAM,KAAK,KAAK,GAAG,CAAC;AAChF,MAAI,MAAM,kBAAkB,QAAW;AACrC,WAAO,IAAI,iBAAiB,OAAO,MAAM,aAAa,CAAC;AAAA,EACzD;AACA,MAAI,MAAM,KAAM,QAAO,IAAI,QAAQ,MAAM,IAAI;AAC7C,QAAM,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,SAAS,CAAC,KAAK;AACvD,SAAO,YAAY,MAAM,SAAS,qBAAqB,EAAE,EAAE;AAC7D;AAEA,SAAS,qBAAqB,GAAuB;AACnD,UAAQ,EAAE,MAAM;AAAA,IACd,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,KAAK,EAAE,QAAQ,uBAAkB,EAAE,WAAW,QAAQ,CAAC,CAAC;AAAA,IAC1G,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,KAAK,EAAE,QAAQ,uBAAkB,EAAE,WAAW,QAAQ,CAAC,CAAC;AAAA,IAC1G,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,oBAAe,EAAE,gBAAgB,qBAAqB,EAAE,eAAe,KAAK,EAAE,aAAa;AAAA,IAC7I,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,yBAAoB,EAAE,aAAa,mBAAmB,EAAE,YAAY;AAAA,IACtH,KAAK;AACH,aAAO,aAAQ,EAAE,IAAI,KAAK,EAAE,MAAM,WAAM,EAAE,MAAM,WAAM,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,UAAU,KAAK,EAAE,KAAK,OAAO,MAAM,EAAE;AAAA,EACpH;AACF;AAEA,eAAsB,eACpBA,SACA,OACuB;AACvB,MAAI;AACF,UAAM,SAAS,MAAMA,QAAO,IAAsB,qBAAqB,KAAK,CAAC;AAC7E,QAAI,OAAO,kBAAkB,GAAG;AAC9B,aAAO;AAAA,QACL;AAAA,MACF;AAAA,IACF;AAEA,UAAM,WAAW,OAAO,YAAY,CAAC;AACrC,UAAM,UACJ,SAAS,OAAO,aAAa,cAAc,OAAO,kBAAkB,IAAI,KAAK,GAAG,qDACzD,SAAS,IAAI,OAAO,SAAS,MAAM,WAAM,SAAS,MAAM,KAAK,SAAS,MAAM;AACrG,UAAM,aAAuB,CAAC;AAC9B,eAAW,KAAK,OAAO,aAAa;AAClC,iBAAW,KAAK,qBAAqB,CAAC,CAAC;AACvC,iBAAW,KAAK,eAAe,EAAE,MAAM,EAAE;AACzC,iBAAW,KAAK,uBAAuB,EAAE,cAAc,EAAE;AAAA,IAC3D;AACA,UAAM,gBAAgB,OAAO,YAAY;AAAA,MACvC,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,UAAU;AAAA,MAClC;AAAA,IACF;AACA,WAAO,mBAAmB;AAAA,MACxB;AAAA,MACA,OAAO,WAAW,KAAK,IAAI;AAAA,MAC3B,YAAY;AAAA;AAAA;AAAA,MAGZ,YAAY;AAAA,IACd,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,WAAO,oBAAoB,+BAAgC,IAAc,OAAO,EAAE;AAAA,EACpF;AACF;AAEA,eAAe,SACbA,SACA,MACA,MACY;AAKZ,QAAM,IAAIA;AACV,MAAI,OAAO,EAAE,SAAS,YAAY;AAChC,UAAM,IAAI,MAAM,6EAAwE;AAAA,EAC1F;AACA,SAAO,EAAE,KAAQ,MAAM,IAAI;AAC7B;;;AH3pBA,IAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,IAAM,SAAS,iBAAiB,OAAO;AAMvC,IAAM,iBAAiB,QAAQ,IAAI;AACnC,IAAM,aAAa,CAAC,UAClB,MAAM,WAAW;AAEnB,IAAM,eAAe,EAClB,OAAO,EACP,SAAS,EACT;AAAA,EACC;AACF;AAEF,IAAM,SAAS,IAAI,UAAU;AAAA,EAC3B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,WAAW,EACR,OAAO,EACP,SAAS,qEAAqE;AAAA,IACjF,SAAS,EACN,OAAO,EACP,SAAS,EACT,SAAS,uGAAuG;AAAA,IACnH,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,4CAA4C;AAAA,IACxE,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,IAAI,EAAE,EACN,SAAS,EACT,SAAS,4BAA4B;AAAA,IACxC,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,IAAI,CAAC,EACL,IAAI,EAAE,EACN,SAAS,EACT,SAAS,0EAA0E;AAAA,IACtF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,gBAAgB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACnF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,0BAA0B;AAAA,IACtD,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,wBAAwB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAC3F;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,QAAQ,EAAE,OAAO,EAAE,SAAS,wBAAwB;AAAA,IACpD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS,mCAAmC;AAAA,IACnG,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,mBAAmB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACtF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,EAAE,OAAO,EAAE,SAAS,4DAA4D;AAAA,IACvF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAClF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,iBAAiB,EACd,OAAO,EACP;AAAA,MACC;AAAA,IACF;AAAA,IACF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,aAAa,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AAChF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,SAAS,EACT,IAAI,GAAG,EACP,SAAS,EACT,SAAS,mCAAmC;AAAA,IAC/C,UAAU,EACP,OAAO,EACP,SAAS,EACT,SAAS,0DAAqD;AAAA,IACjE,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UAAU,oBAAoB,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACvF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,MAAM,EACH,MAAM,oBAAoB,EAC1B,SAAS,EACT;AAAA,MACC;AAAA,IACF;AAAA,IACF,eAAe,EACZ,OAAO,EACP,IAAI,CAAC,EACL,IAAI,CAAC,EACL,SAAS,EACT,SAAS,+DAA+D;AAAA,IAC3E,MAAM,EACH,OAAO,EACP,SAAS,EACT,SAAS,oEAAoE;AAAA,IAChF,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UACL,eAAe,QAAQ,EAAE,GAAG,OAAO,SAAS,WAAW,KAAK,EAAE,CAAC;AACnE;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,IACE,OAAO,yBAAyB,SAAS,EAAE;AAAA,MACzC;AAAA,IACF;AAAA,IACA,oBAAoB,yBAAyB,SAAS,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,IACA,SAAS;AAAA,EACX;AAAA,EACA,OAAO,UACL,cAAc,QAAQ;AAAA,IACpB,GAAG;AAAA,IACH,SAAS,WAAW,KAAK;AAAA,EAC3B,CAAwC;AAC5C;AAMA,IAAM,kBAAkB,QAAQ,IAAI,wBAChC,OAAO,QAAQ,IAAI,qBAAqB,IACxC;AACJ,IAAM,uBAAuB,kBAAkB,QAAQ,QAAQ;AAAA,EAC7D,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,EAC3D,GAAI,iBAAiB,EAAE,SAAS,eAAe,IAAI,CAAC;AACtD,CAAC;AAED,eAAe,OAAsB;AACnC,QAAM,YAAY,IAAI,qBAAqB;AAC3C,QAAM,OAAO,QAAQ,SAAS;AAChC;AAEA,IAAM,cAAc,MAAY;AAC9B,uBAAqB,KAAK;AAC5B;AACA,QAAQ,GAAG,WAAW,WAAW;AACjC,QAAQ,GAAG,UAAU,WAAW;AAEhC,KAAK,EAAE,MAAM,CAAC,QAAQ;AACpB,UAAQ,MAAM,GAAG;AACjB,UAAQ,KAAK,CAAC;AAChB,CAAC;","names":["baseUrl","client","server","client"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@neat.is/mcp",
-  "version": "0.2.8",
+  "version": "0.2.10",
   "description": "NEAT MCP server: exposes graph queries to AI agents over stdio",
   "license": "BUSL-1.1",
   "homepage": "https://neat.is",
@@ -42,7 +42,7 @@
   },
   "dependencies": {
     "@modelcontextprotocol/sdk": "^1.0.0",
-    "@neat.is/types": "^0.2.8",
+    "@neat.is/types": "^0.2.10",
     "zod": "^3.23.8"
   },
   "devDependencies": {