@neat.is/core 0.3.3 → 0.3.4

package/dist/chunk-33ZZ2ZID.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph.ts","../src/compat.ts","../compat.json","../src/traverse.ts","../src/ingest.ts","../src/policy.ts","../src/events.ts","../src/extract/errors.ts","../src/extract/services.ts","../src/extract/shared.ts","../src/extract/python.ts","../src/extract/owners.ts","../src/extract/aliases.ts","../src/extract/databases/index.ts","../src/extract/databases/db-config-yaml.ts","../src/extract/databases/dotenv.ts","../src/extract/databases/shared.ts","../src/extract/databases/prisma.ts","../src/extract/databases/drizzle.ts","../src/extract/databases/knex.ts","../src/extract/databases/ormconfig.ts","../src/extract/databases/typeorm.ts","../src/extract/databases/sequelize.ts","../src/extract/databases/docker-compose.ts","../src/extract/configs.ts","../src/extract/calls/index.ts","../src/extract/calls/http.ts","../src/extract/calls/shared.ts","../src/extract/calls/kafka.ts","../src/extract/calls/redis.ts","../src/extract/calls/aws.ts","../src/extract/calls/grpc.ts","../src/extract/infra/docker-compose.ts","../src/extract/infra/shared.ts","../src/extract/infra/dockerfile.ts","../src/extract/infra/terraform.ts","../src/extract/infra/k8s.ts","../src/extract/infra/index.ts","../src/extract/index.ts","../src/extract/retire.ts","../src/persist.ts","../src/diff.ts","../src/projects.ts","../src/registry.ts","../src/api.ts","../src/divergences.ts","../src/streaming.ts"],"sourcesContent":["import GraphDefault from 'graphology'\nimport type { MultiDirectedGraph as MDGType } from 'graphology'\nimport type { GraphEdge, GraphNode } from '@neat.is/types'\n\n// graphology ships as a CJS bundle that does `module.exports = Graph` with\n// the other constructors attached as properties (`Graph.MultiDirectedGraph =\n// ...`). cjs-module-lexer can't see through that attachment, so a named\n// import like `import { MultiDirectedGraph } from 'graphology'` fails under\n// strict Node ESM (Node 22+ via tsx in particular). Pull the constructor off\n// the default export instead — same shape under tsx and tsup-bundled output.\ntype MultiDirectedGraphCtor = typeof MDGType\nconst MultiDirectedGraph: MultiDirectedGraphCtor = (\n  GraphDefault as unknown as { MultiDirectedGraph: MultiDirectedGraphCtor }\n).MultiDirectedGraph\n\n// Multi because two nodes can have edges of different types simultaneously\n// (e.g. CALLS and DEPENDS_ON between the same pair of services).\nexport type NeatGraph = MDGType<GraphNode, GraphEdge>\n\nexport const DEFAULT_PROJECT = 'default'\n\n// One graph per project. The map is the source of truth; getGraph() with no\n// arg or with 'default' hits the legacy single-project path so existing\n// callers keep working byte-for-byte (ADR-026).\nconst graphs = new Map<string, NeatGraph>()\n\nfunction makeGraph(): NeatGraph {\n  return new MultiDirectedGraph<GraphNode, GraphEdge>({ allowSelfLoops: false })\n}\n\nexport function getGraph(project: string = DEFAULT_PROJECT): NeatGraph {\n  let g = graphs.get(project)\n  if (!g) {\n    g = makeGraph()\n    graphs.set(project, g)\n  }\n  return g\n}\n\nexport function hasProject(project: string): boolean {\n  return graphs.has(project)\n}\n\nexport function listProjects(): string[] {\n  return [...graphs.keys()].sort()\n}\n\n// Reset a single project, or all of them when the arg is omitted. Tests use\n// the no-arg form between cases; runtime never calls it.\nexport function resetGraph(project?: string): void {\n  if (project === undefined) {\n    graphs.clear()\n    return\n  }\n  graphs.delete(project)\n}\n","import { promises as fs } from 'node:fs'\nimport os from 'node:os'\nimport path from 'node:path'\nimport semver from 'semver'\nimport compatData from '../compat.json' with { type: 'json' }\n\nexport interface CompatibilityResult {\n  compatible: boolean\n  reason?: string\n  minDriverVersion?: string\n}\n\nexport interface CompatPair {\n  kind?: 'driver-engine'\n  driver: string\n  engine: string\n  minDriverVersion: string\n  // The driver constraint only kicks in once the engine is at this major or higher.\n  // Older engines (e.g. PostgreSQL 13) accept the older driver fine.\n  minEngineVersion?: string\n  reason: string\n}\n\nexport interface NodeEngineConstraint {\n  kind?: 'node-engine'\n  package: string\n  packageMinVersion?: string\n  minNodeVersion: string\n  reason: string\n}\n\nexport interface PackageConflict {\n  kind?: 'package-conflict'\n  package: string\n  packageMinVersion?: string\n  requires: { name: string; minVersion: string }\n  reason: string\n}\n\nexport interface DeprecatedApi {\n  kind?: 'deprecated-api'\n  package: string\n  packageMaxVersion?: string\n  reason: string\n}\n\nexport interface CompatMatrix {\n  pairs: CompatPair[]\n  nodeEngineConstraints?: NodeEngineConstraint[]\n  packageConflicts?: PackageConflict[]\n  deprecatedApis?: DeprecatedApi[]\n}\n\nconst bundledMatrix = compatData as CompatMatrix\nlet mergedMatrix: CompatMatrix | null = null\nlet remoteLoadAttempted = false\n\nconst REMOTE_CACHE_DIR = path.join(os.homedir(), '.neat')\nconst REMOTE_CACHE_PATH = path.join(REMOTE_CACHE_DIR, 'compat-cache.json')\nconst REMOTE_TTL_MS = 24 * 60 * 60 * 1000\n\ninterface RemoteCacheFile {\n  fetchedAt: string\n  url: string\n  matrix: CompatMatrix\n}\n\n// Engines like Postgres/MySQL only carry a major in the version field, so semver\n// won't always parse them cleanly. Compare as integers when both sides look like\n// majors; otherwise fall back to semver.coerce.\nfunction engineMeetsThreshold(engineVersion: string, threshold: string): boolean {\n  const e = parseInt(engineVersion, 10)\n  const t = parseInt(threshold, 10)\n  if (Number.isFinite(e) && Number.isFinite(t)) return e >= t\n\n  const ec = semver.coerce(engineVersion)\n  const tc = semver.coerce(threshold)\n  if (ec && tc) return semver.gte(ec, tc)\n\n  return false\n}\n\nexport function checkCompatibility(\n  driver: string,\n  driverVersion: string,\n  engine: string,\n  engineVersion: string,\n): CompatibilityResult {\n  const matrix = currentMatrix()\n  const pair = matrix.pairs.find((p) => p.driver === driver && p.engine === engine)\n  if (!pair) return { compatible: true }\n\n  if (pair.minEngineVersion && !engineMeetsThreshold(engineVersion, pair.minEngineVersion)) {\n    return { compatible: true }\n  }\n\n  const driverCoerced = semver.coerce(driverVersion)\n  if (!driverCoerced) return { compatible: true }\n\n  if (semver.lt(driverCoerced, pair.minDriverVersion)) {\n    return {\n      compatible: false,\n      reason: pair.reason,\n      minDriverVersion: pair.minDriverVersion,\n    }\n  }\n\n  return { compatible: true }\n}\n\nexport interface NodeEngineCheck {\n  compatible: boolean\n  reason?: string\n  requiredNodeVersion?: string\n}\n\n// True when `serviceNodeRange` (a service's `engines.node`) is guaranteed to\n// admit `requiredNodeVersion`. We use a permissive semver compare via `coerce`\n// — exact ranges like \">=20\" parse fine, exotic ones like \"^20 || ^22\" pass as\n// long as semver can resolve them. If the range can't be parsed at all, we\n// don't claim a conflict — under-flag rather than over-flag.\nfunction rangeAdmitsVersion(serviceNodeRange: string, requiredNodeVersion: string): boolean {\n  try {\n    const required = semver.coerce(requiredNodeVersion)\n    if (!required) return true\n    // Is every version that satisfies the service's range >= required? If yes,\n    // the service guarantees the requirement; if not, there's at least one\n    // admissible Node version that won't satisfy the dep — that's the\n    // conflict.\n    return semver.subset(serviceNodeRange, `>=${required.version}`, {\n      includePrerelease: false,\n    })\n  } catch {\n    return true\n  }\n}\n\nexport function checkNodeEngineConstraint(\n  constraint: NodeEngineConstraint,\n  declaredPackageVersion: string | undefined,\n  serviceNodeRange: string | undefined,\n): NodeEngineCheck {\n  if (constraint.packageMinVersion && declaredPackageVersion) {\n    const v = semver.coerce(declaredPackageVersion)\n    if (v && semver.lt(v, constraint.packageMinVersion)) {\n      return { compatible: true }\n    }\n  }\n  if (!serviceNodeRange) {\n    return { compatible: true }\n  }\n  if (rangeAdmitsVersion(serviceNodeRange, constraint.minNodeVersion)) {\n    return { compatible: true }\n  }\n  return {\n    compatible: false,\n    reason: constraint.reason,\n    requiredNodeVersion: constraint.minNodeVersion,\n  }\n}\n\nexport interface PackageConflictCheck {\n  compatible: boolean\n  reason?: string\n  requires?: { name: string; minVersion: string }\n  foundVersion?: string\n}\n\nexport function checkPackageConflict(\n  conflict: PackageConflict,\n  declaredPackageVersion: string | undefined,\n  declaredRequiredVersion: string | undefined,\n): PackageConflictCheck {\n  if (!declaredPackageVersion) return { compatible: true }\n  if (conflict.packageMinVersion) {\n    const v = semver.coerce(declaredPackageVersion)\n    if (v && semver.lt(v, conflict.packageMinVersion)) {\n      return { compatible: true }\n    }\n  }\n  if (!declaredRequiredVersion) {\n    return {\n      compatible: false,\n      reason: conflict.reason,\n      requires: conflict.requires,\n    }\n  }\n  const requiredCoerced = semver.coerce(declaredRequiredVersion)\n  if (!requiredCoerced) return { compatible: true }\n  if (semver.lt(requiredCoerced, conflict.requires.minVersion)) {\n    return {\n      compatible: false,\n      reason: conflict.reason,\n      requires: conflict.requires,\n      foundVersion: declaredRequiredVersion,\n    }\n  }\n  return { compatible: true }\n}\n\nexport function checkDeprecatedApi(\n  rule: DeprecatedApi,\n  declaredVersion: string | undefined,\n): { compatible: boolean; reason?: string } {\n  if (declaredVersion === undefined) return { compatible: true }\n  if (rule.packageMaxVersion) {\n    const v = semver.coerce(declaredVersion)\n    const max = semver.coerce(rule.packageMaxVersion)\n    if (v && max && semver.gt(v, max)) return { compatible: true }\n  }\n  return { compatible: false, reason: rule.reason }\n}\n\nfunction currentMatrix(): CompatMatrix {\n  return mergedMatrix ?? bundledMatrix\n}\n\nfunction mergeMatrices(a: CompatMatrix, b: CompatMatrix): CompatMatrix {\n  return {\n    pairs: [...a.pairs, ...(b.pairs ?? [])],\n    nodeEngineConstraints: [\n      ...(a.nodeEngineConstraints ?? []),\n      ...(b.nodeEngineConstraints ?? []),\n    ],\n    packageConflicts: [...(a.packageConflicts ?? []), ...(b.packageConflicts ?? [])],\n    deprecatedApis: [...(a.deprecatedApis ?? []), ...(b.deprecatedApis ?? [])],\n  }\n}\n\nasync function readRemoteCache(url: string): Promise<CompatMatrix | null> {\n  try {\n    const raw = await fs.readFile(REMOTE_CACHE_PATH, 'utf8')\n    const parsed = JSON.parse(raw) as RemoteCacheFile\n    if (parsed.url !== url) return null\n    const age = Date.now() - new Date(parsed.fetchedAt).getTime()\n    if (age > REMOTE_TTL_MS) return null\n    return parsed.matrix\n  } catch {\n    return null\n  }\n}\n\nasync function writeRemoteCache(url: string, matrix: CompatMatrix): Promise<void> {\n  const file: RemoteCacheFile = {\n    fetchedAt: new Date().toISOString(),\n    url,\n    matrix,\n  }\n  try {\n    await fs.mkdir(REMOTE_CACHE_DIR, { recursive: true })\n    await fs.writeFile(REMOTE_CACHE_PATH, JSON.stringify(file), 'utf8')\n  } catch (err) {\n    console.warn(`[neat] failed to cache compat matrix: ${(err as Error).message}`)\n  }\n}\n\n// Loads the bundled matrix and, if `NEAT_COMPAT_URL` is set, merges in a\n// remote extension. Falls back to a fresh fetch when the on-disk cache is\n// stale (24h TTL) or missing. Returns the merged matrix; subsequent calls are\n// memoised.\n//\n// Async because the fetch happens lazily on first use. Extract phase 2 awaits\n// this before iterating pairs; everything else goes through the sync\n// `currentMatrix()` view, which is fine because by the time CLI / traversal\n// runs, extraction has already loaded.\nexport async function ensureCompatLoaded(): Promise<CompatMatrix> {\n  if (mergedMatrix) return mergedMatrix\n  if (remoteLoadAttempted) {\n    mergedMatrix = bundledMatrix\n    return mergedMatrix\n  }\n  remoteLoadAttempted = true\n\n  const url = process.env.NEAT_COMPAT_URL\n  if (!url) {\n    mergedMatrix = bundledMatrix\n    return mergedMatrix\n  }\n\n  const cached = await readRemoteCache(url)\n  if (cached) {\n    mergedMatrix = mergeMatrices(bundledMatrix, cached)\n    return mergedMatrix\n  }\n\n  try {\n    const res = await fetch(url)\n    if (!res.ok) throw new Error(`${res.status} ${res.statusText}`)\n    const remote = (await res.json()) as CompatMatrix\n    await writeRemoteCache(url, remote)\n    mergedMatrix = mergeMatrices(bundledMatrix, remote)\n    return mergedMatrix\n  } catch (err) {\n    console.warn(\n      `[neat] NEAT_COMPAT_URL fetch failed (${(err as Error).message}); using bundled matrix only`,\n    )\n    mergedMatrix = bundledMatrix\n    return mergedMatrix\n  }\n}\n\n// Reset the merged-matrix memo. Intended for tests so each test starts with a\n// freshly loaded matrix.\nexport function resetCompatMatrix(): void {\n  mergedMatrix = null\n  remoteLoadAttempted = false\n}\n\nexport function compatPairs(): readonly CompatPair[] {\n  return currentMatrix().pairs\n}\n\nexport function nodeEngineConstraints(): readonly NodeEngineConstraint[] {\n  return currentMatrix().nodeEngineConstraints ?? []\n}\n\nexport function packageConflicts(): readonly PackageConflict[] {\n  return currentMatrix().packageConflicts ?? []\n}\n\nexport function deprecatedApis(): readonly DeprecatedApi[] {\n  return currentMatrix().deprecatedApis ?? []\n}\n","{\n  \"pairs\": [\n    {\n      \"kind\": \"driver-engine\",\n      \"driver\": \"pg\",\n      \"engine\": \"postgresql\",\n      \"minDriverVersion\": \"8.0.0\",\n      \"minEngineVersion\": \"14\",\n      \"reason\": \"PostgreSQL 14+ requires scram-sha-256 auth by default; pg < 8.0.0 only speaks md5.\"\n    },\n    {\n      \"kind\": \"driver-engine\",\n      \"driver\": \"mysql2\",\n      \"engine\": \"mysql\",\n      \"minDriverVersion\": \"3.0.0\",\n      \"minEngineVersion\": \"8\",\n      \"reason\": \"MySQL 8 defaults to caching_sha2_password; mysql2 < 3.0.0 doesn't negotiate it.\"\n    },\n    {\n      \"kind\": \"driver-engine\",\n      \"driver\": \"mongoose\",\n      \"engine\": \"mongodb\",\n      \"minDriverVersion\": \"7.0.0\",\n      \"minEngineVersion\": \"7\",\n      \"reason\": \"MongoDB 7 drops legacy wire-protocol opcodes that mongoose < 7.0.0 still emits.\"\n    },\n    {\n      \"kind\": \"driver-engine\",\n      \"driver\": \"psycopg2\",\n      \"engine\": \"postgresql\",\n      \"minDriverVersion\": \"2.9.0\",\n      \"minEngineVersion\": \"14\",\n      \"reason\": \"PostgreSQL 14+ requires scram-sha-256 auth by default; psycopg2 < 2.9.0 only speaks md5.\"\n    },\n    {\n      \"kind\": \"driver-engine\",\n      \"driver\": \"pymongo\",\n      \"engine\": \"mongodb\",\n      \"minDriverVersion\": \"4.0.0\",\n      \"minEngineVersion\": \"7\",\n      \"reason\": \"MongoDB 7 drops legacy wire-protocol opcodes that pymongo < 4.0.0 still emits.\"\n    },\n    {\n      \"kind\": \"driver-engine\",\n      \"driver\": \"mysql-connector-python\",\n      \"engine\": \"mysql\",\n      \"minDriverVersion\": \"8.0.0\",\n      \"minEngineVersion\": \"8\",\n      \"reason\": \"MySQL 8 defaults to caching_sha2_password; mysql-connector-python < 8.0.0 doesn't negotiate it.\"\n    }\n  ],\n  \"nodeEngineConstraints\": [\n    {\n      \"kind\": \"node-engine\",\n      \"package\": \"vitest\",\n      \"packageMinVersion\": \"2.0.0\",\n      \"minNodeVersion\": \"18.0.0\",\n      \"reason\": \"vitest >= 2.0 drops Node 16 support; requires Node 18+.\"\n    },\n    {\n      \"kind\": \"node-engine\",\n      \"package\": \"next\",\n      \"packageMinVersion\": \"14.0.0\",\n      \"minNodeVersion\": \"18.17.0\",\n      \"reason\": \"Next 14+ requires Node 18.17+ (uses APIs introduced in that minor).\"\n    },\n    {\n      \"kind\": \"node-engine\",\n      \"package\": \"@modelcontextprotocol/sdk\",\n      \"packageMinVersion\": \"1.0.0\",\n      \"minNodeVersion\": \"18.0.0\",\n      \"reason\": \"@modelcontextprotocol/sdk >= 1 requires Node 18+ (web-streams polyfill removed).\"\n    }\n  ],\n  \"packageConflicts\": [\n    {\n      \"kind\": \"package-conflict\",\n      \"package\": \"@tanstack/react-query\",\n      \"packageMinVersion\": \"5.0.0\",\n      \"requires\": {\n        \"name\": \"react\",\n        \"minVersion\": \"18.0.0\"\n      },\n      \"reason\": \"@tanstack/react-query 5+ uses useSyncExternalStore — only available in React 18+.\"\n    },\n    {\n      \"kind\": \"package-conflict\",\n      \"package\": \"react-router-dom\",\n      \"packageMinVersion\": \"7.0.0\",\n      \"requires\": {\n        \"name\": \"react\",\n        \"minVersion\": \"18.0.0\"\n      },\n      \"reason\": \"react-router-dom 7+ requires React 18+.\"\n    },\n    {\n      \"kind\": \"package-conflict\",\n      \"package\": \"next\",\n      \"packageMinVersion\": \"14.0.0\",\n      \"requires\": {\n        \"name\": \"react\",\n        \"minVersion\": \"18.2.0\"\n      },\n      \"reason\": \"Next.js 14+ requires React 18.2+.\"\n    }\n  ],\n  \"deprecatedApis\": [\n    {\n      \"kind\": \"deprecated-api\",\n      \"package\": \"request\",\n      \"packageMaxVersion\": \"2.88.2\",\n      \"reason\": \"request is deprecated; use undici, node-fetch, or axios instead.\"\n    },\n    {\n      \"kind\": \"deprecated-api\",\n      \"package\": \"node-uuid\",\n      \"reason\": \"node-uuid is deprecated; use the `uuid` package.\"\n    }\n  ]\n}\n","import type {\n  BlastRadiusAffectedNode,\n  BlastRadiusResult,\n  DatabaseNode,\n  ErrorEvent,\n  GraphEdge,\n  GraphNode,\n  RootCauseResult,\n  ServiceNode,\n  TransitiveDependenciesResult,\n  TransitiveDependency,\n} from '@neat.is/types'\nimport {\n  BlastRadiusResultSchema,\n  NodeType,\n  PROV_RANK,\n  Provenance,\n  RootCauseResultSchema,\n  TransitiveDependenciesResultSchema,\n} from '@neat.is/types'\nimport type { NeatGraph } from './graph.js'\nimport {\n  checkCompatibility,\n  checkNodeEngineConstraint,\n  checkPackageConflict,\n  compatPairs,\n  nodeEngineConstraints,\n  packageConflicts,\n} from './compat.js'\n\n// Contract anchors (see /docs/contracts.md + docs/contracts/provenance.md):\n//   * Rule 2 — Coexistence: walk by provenance priority, never collapse edges.\n//   * Rule 3 — FRONTIER edges must be skipped, not merely deprioritized.\n//     If a node's only edges are FRONTIER, traversal stops there.\n//   * Rule 5 — Validate results against RootCauseResultSchema /\n//     BlastRadiusResultSchema before returning.\n//   * Rule 8 — No demo-name hardcoding: driver/engine identifiers come from\n//     node properties + compatPairs(), never literals.\n//   * ADR-029 — PROV_RANK is the canonical provenance ranking, imported\n//     from @neat.is/types so consumers (traversal, MCP, policies) all agree.\n\nconst ROOT_CAUSE_MAX_DEPTH = 5\nconst BLAST_RADIUS_DEFAULT_DEPTH = 10\n\n// Multiple edges between the same pair coexist by provenance (EXTRACTED next to\n// OBSERVED next to INFERRED). Traversal walks the system as the graph \"sees it\n// best\", so for any neighbour pair we pick the highest-provenance edge.\n// FRONTIER means unknown territory — ADR-036 / Rule 3 require these edges to\n// be skipped, not merely deprioritized. Filtering happens here so the rest of\n// traversal can stay generic.\nfunction bestEdgeBySource(graph: NeatGraph, edgeIds: string[]): Map<string, GraphEdge> {\n  const best = new Map<string, GraphEdge>()\n  for (const id of edgeIds) {\n    const e = graph.getEdgeAttributes(id) as GraphEdge\n    if (e.provenance === Provenance.FRONTIER) continue\n    const cur = best.get(e.source)\n    if (!cur || PROV_RANK[e.provenance] > PROV_RANK[cur.provenance]) {\n      best.set(e.source, e)\n    }\n  }\n  return best\n}\n\nfunction bestEdgeByTarget(graph: NeatGraph, edgeIds: string[]): Map<string, GraphEdge> {\n  const best = new Map<string, GraphEdge>()\n  for (const id of edgeIds) {\n    const e = graph.getEdgeAttributes(id) as GraphEdge\n    if (e.provenance === Provenance.FRONTIER) continue\n    const cur = best.get(e.target)\n    if (!cur || PROV_RANK[e.provenance] > PROV_RANK[cur.provenance]) {\n      best.set(e.target, e)\n    }\n  }\n  return best\n}\n\n// Per-edge confidence is provenance × volume × recency × cleanliness.\n//   * provenance gives a ceiling: OBSERVED 1.0, INFERRED 0.7, EXTRACTED 0.5,\n//     STALE/FRONTIER 0.3.\n//   * volume: log-scaled span count, saturating quickly so 1 span ≈ 0.55 and\n//     ~1k spans ≈ 1.0.\n//   * recency: 1.0 within an hour; decays toward 0.5 by 24h, toward 0.3 past.\n//   * cleanliness: error rate above ~10% pulls the score down — a flapping\n//     edge with thousands of spans shouldn't outrank a clean low-traffic one.\n// Bounded to [0, 1]. Walks of multiple edges multiply per-edge confidences.\nconst PROVENANCE_CEILING: Record<string, number> = {\n  OBSERVED: 1.0,\n  INFERRED: 0.7,\n  EXTRACTED: 0.5,\n  STALE: 0.3,\n  FRONTIER: 0.3,\n}\n\nfunction volumeWeight(spanCount: number | undefined): number {\n  if (!spanCount || spanCount <= 0) return 0.5\n  // log10 saturating around ~1000 spans → ~1.0.\n  const w = 0.5 + Math.log10(spanCount + 1) / 3\n  return Math.min(1, w)\n}\n\nfunction recencyWeight(ageMs: number | undefined): number {\n  if (ageMs === undefined) return 0.8\n  const hour = 60 * 60 * 1000\n  if (ageMs <= hour) return 1.0\n  if (ageMs <= 24 * hour) {\n    const t = (ageMs - hour) / (23 * hour)\n    return 1.0 - 0.5 * t\n  }\n  return 0.3\n}\n\nfunction cleanlinessWeight(spanCount: number | undefined, errorCount: number | undefined): number {\n  if (!spanCount || spanCount <= 0) return 1\n  const rate = (errorCount ?? 0) / spanCount\n  if (rate <= 0.01) return 1\n  if (rate >= 0.5) return 0.3\n  return 1 - rate * 1.4\n}\n\nexport function confidenceForEdge(edge: GraphEdge, now = Date.now()): number {\n  const ceiling = PROVENANCE_CEILING[edge.provenance] ?? 0.5\n\n  // No runtime signal yet → the provenance ceiling is all we have. This keeps\n  // EXTRACTED-only graphs returning the same coarse 0.3/0.5/0.7/1.0 ladder\n  // they always have, while letting OBSERVED edges with real OTel data move\n  // off the ceiling once ingest starts populating signal counters.\n  const spanCount = edge.signal?.spanCount ?? edge.callCount\n  const ageMs = edge.signal?.lastObservedAgeMs ?? lastObservedAge(edge, now)\n  if (spanCount === undefined && ageMs === undefined && edge.signal === undefined) {\n    return ceiling\n  }\n\n  const v = volumeWeight(spanCount)\n  const r = recencyWeight(ageMs)\n  const c = cleanlinessWeight(spanCount, edge.signal?.errorCount)\n  return Math.max(0, Math.min(1, ceiling * v * r * c))\n}\n\nfunction lastObservedAge(edge: GraphEdge, now: number): number | undefined {\n  if (!edge.lastObserved) return undefined\n  const t = Date.parse(edge.lastObserved)\n  if (!Number.isFinite(t)) return undefined\n  return Math.max(0, now - t)\n}\n\n// Path-level confidence is the *product* of per-edge confidences (ADR-036).\n// Each hop is independent evidence and uncertainty compounds — a 3-hop path\n// of edges at confidence 0.8 each gives 0.512, not 0.8. Multiplying punishes\n// long walks accordingly, which is the contract's intent: traversal should\n// surface the cumulative trust the graph actually has, not the weakest link\n// alone.\nfunction confidenceFromMix(edges: GraphEdge[], now = Date.now()): number {\n  if (edges.length === 0) return 1.0\n  let product = 1\n  for (const e of edges) {\n    product *= confidenceForEdge(e, now)\n  }\n  return Math.max(0, Math.min(1, product))\n}\n\ninterface Walk {\n  path: string[]\n  edges: GraphEdge[]\n}\n\n// DFS along incoming edges from start, depth-bounded. Returns the longest path\n// reachable, picking best-provenance edges per neighbour pair so the walk\n// reflects the system as the graph knows it most reliably.\nfunction longestIncomingWalk(graph: NeatGraph, start: string, maxDepth: number): Walk {\n  let best: Walk = { path: [start], edges: [] }\n  const visited = new Set<string>([start])\n\n  function step(node: string, path: string[], edges: GraphEdge[]): void {\n    if (path.length > best.path.length) {\n      best = { path: [...path], edges: [...edges] }\n    }\n    if (path.length - 1 >= maxDepth) return\n\n    const incoming = bestEdgeBySource(graph, graph.inboundEdges(node))\n    for (const [srcId, edge] of incoming) {\n      if (visited.has(srcId)) continue\n      visited.add(srcId)\n      path.push(srcId)\n      edges.push(edge)\n      step(srcId, path, edges)\n      path.pop()\n      edges.pop()\n      visited.delete(srcId)\n    }\n  }\n\n  step(start, [start], [])\n  return best\n}\n\n// Per-shape match result. Each shape walks the same incoming `walk.path` but\n// looks for a different class of incompatibility. Adding a new shape (e.g. a\n// future ConfigNode \"missing required env var\" rule) is one entry in\n// `rootCauseShapes` plus its match function — no restructure to getRootCause.\ninterface RootCauseMatch {\n  rootCauseNode: string\n  rootCauseReason: string\n  fixRecommendation?: string\n}\n\ntype RootCauseShape = (\n  graph: NeatGraph,\n  origin: GraphNode,\n  walk: Walk,\n) => RootCauseMatch | null\n\n// DatabaseNode origin → driver/engine compat (the original v0.1.x behavior,\n// preserved verbatim). The walk ignores non-ServiceNodes; the first upstream\n// service whose declared driver fails compat against the origin DB's\n// (engine, engineVersion) wins.\nfunction databaseRootCauseShape(\n  graph: NeatGraph,\n  origin: GraphNode,\n  walk: Walk,\n): RootCauseMatch | null {\n  const targetDb = origin as DatabaseNode\n  // Pairs that could possibly hit on this engine — narrowed once outside the\n  // walk so we don't re-scan the matrix for every service we visit.\n  const candidatePairs = compatPairs().filter((p) => p.engine === targetDb.engine)\n  if (candidatePairs.length === 0) return null\n\n  for (const id of walk.path) {\n    const attrs = graph.getNodeAttributes(id) as GraphNode\n    if (attrs.type !== NodeType.ServiceNode) continue\n    const svc = attrs as ServiceNode\n    const deps = svc.dependencies ?? {}\n    for (const pair of candidatePairs) {\n      const declared = deps[pair.driver]\n      if (!declared) continue\n      const result = checkCompatibility(\n        pair.driver,\n        declared,\n        targetDb.engine,\n        targetDb.engineVersion,\n      )\n      if (!result.compatible) {\n        return {\n          rootCauseNode: id,\n          rootCauseReason: result.reason ?? 'incompatible driver',\n          ...(result.minDriverVersion\n            ? {\n                fixRecommendation: `Upgrade ${svc.name} ${pair.driver} driver to >= ${result.minDriverVersion}`,\n              }\n            : {}),\n        }\n      }\n    }\n  }\n  return null\n}\n\n// ServiceNode origin → node-engine + package-conflict shapes from compat.ts.\n// The check is over each ServiceNode along the incoming walk (the origin\n// itself + any upstream callers): a node-engine constraint failing against\n// the service's `engines.node`, or a package-conflict where a declared dep\n// requires a peer at a higher version than the service has.\nfunction serviceRootCauseShape(\n  graph: NeatGraph,\n  _origin: GraphNode,\n  walk: Walk,\n): RootCauseMatch | null {\n  for (const id of walk.path) {\n    const attrs = graph.getNodeAttributes(id) as GraphNode\n    if (attrs.type !== NodeType.ServiceNode) continue\n    const svc = attrs as ServiceNode\n    const deps = svc.dependencies ?? {}\n    const serviceNodeEngine = svc.nodeEngine\n\n    for (const constraint of nodeEngineConstraints()) {\n      const declared = deps[constraint.package]\n      if (!declared) continue\n      const result = checkNodeEngineConstraint(constraint, declared, serviceNodeEngine)\n      if (!result.compatible && result.reason) {\n        return {\n          rootCauseNode: id,\n          rootCauseReason: result.reason,\n          ...(result.requiredNodeVersion\n            ? {\n                fixRecommendation: `Bump ${svc.name}'s engines.node to >= ${result.requiredNodeVersion}`,\n              }\n            : {}),\n        }\n      }\n    }\n\n    for (const conflict of packageConflicts()) {\n      const declared = deps[conflict.package]\n      if (!declared) continue\n      const requiredDeclared = deps[conflict.requires.name]\n      const result = checkPackageConflict(conflict, declared, requiredDeclared)\n      if (!result.compatible && result.reason) {\n        return {\n          rootCauseNode: id,\n          rootCauseReason: result.reason,\n          fixRecommendation: `Upgrade ${svc.name}'s ${conflict.requires.name} to >= ${conflict.requires.minVersion}`,\n        }\n      }\n    }\n  }\n  return null\n}\n\n// Dispatch by origin node type per ADR-037. Origin types not present here\n// (InfraNode, ConfigNode, FrontierNode) cleanly return null — getRootCause\n// needs an explicit shape to know what an \"incompatibility\" looks like for\n// that origin, and those types don't have one yet.\nconst rootCauseShapes: Partial<Record<GraphNode['type'], RootCauseShape>> = {\n  [NodeType.DatabaseNode]: databaseRootCauseShape,\n  [NodeType.ServiceNode]: serviceRootCauseShape,\n}\n\nexport function getRootCause(\n  graph: NeatGraph,\n  errorNodeId: string,\n  errorEvent?: ErrorEvent,\n): RootCauseResult | null {\n  if (!graph.hasNode(errorNodeId)) return null\n  const origin = graph.getNodeAttributes(errorNodeId) as GraphNode\n  const shape = rootCauseShapes[origin.type]\n  if (!shape) return null\n\n  const walk = longestIncomingWalk(graph, errorNodeId, ROOT_CAUSE_MAX_DEPTH)\n  const match = shape(graph, origin, walk)\n  if (!match) return null\n\n  const reason = errorEvent\n    ? `${match.rootCauseReason} (observed error: ${errorEvent.errorMessage})`\n    : match.rootCauseReason\n\n  // Schema-validate before return (ADR-036, #139). A drift in the result\n  // shape becomes a runtime throw at the call site rather than a silently\n  // malformed payload reaching MCP / REST consumers.\n  return RootCauseResultSchema.parse({\n    rootCauseNode: match.rootCauseNode,\n    rootCauseReason: reason,\n    traversalPath: walk.path,\n    edgeProvenances: walk.edges.map((e) => e.provenance),\n    confidence: confidenceFromMix(walk.edges),\n    fixRecommendation: match.fixRecommendation,\n  })\n}\n\n// BFS along outgoing edges from origin. Records each reachable node with the\n// shortest distance back to origin and the provenance of the edge that brought\n// us to it. Best-provenance edge selection per pair mirrors getRootCause.\nexport function getBlastRadius(\n  graph: NeatGraph,\n  nodeId: string,\n  maxDepth = BLAST_RADIUS_DEFAULT_DEPTH,\n): BlastRadiusResult {\n  if (!graph.hasNode(nodeId)) {\n    return BlastRadiusResultSchema.parse({ origin: nodeId, affectedNodes: [], totalAffected: 0 })\n  }\n\n  // Each frame carries its full predecessor chain so the affected-node payload\n  // can surface `path` (origin → ... → nodeId) and `confidence` (cascaded over\n  // every edge along that path). The BFS visits each reachable node once on\n  // its shortest-distance path; later frames at greater distance are dropped.\n  interface Frame {\n    nodeId: string\n    distance: number\n    path: string[]\n    pathEdges: GraphEdge[]\n  }\n\n  const seen = new Map<string, BlastRadiusAffectedNode>()\n  const queue: Frame[] = [{ nodeId, distance: 0, path: [nodeId], pathEdges: [] }]\n  const enqueued = new Set<string>([nodeId])\n\n  while (queue.length > 0) {\n    const frame = queue.shift()!\n    if (frame.distance > 0 && frame.pathEdges.length > 0) {\n      const lastEdge = frame.pathEdges[frame.pathEdges.length - 1]!\n      seen.set(frame.nodeId, {\n        nodeId: frame.nodeId,\n        distance: frame.distance,\n        edgeProvenance: lastEdge.provenance,\n        path: frame.path,\n        confidence: confidenceFromMix(frame.pathEdges),\n      })\n    }\n    if (frame.distance >= maxDepth) continue\n\n    const outgoing = bestEdgeByTarget(graph, graph.outboundEdges(frame.nodeId))\n    for (const [tgtId, edge] of outgoing) {\n      if (enqueued.has(tgtId)) continue\n      enqueued.add(tgtId)\n      queue.push({\n        nodeId: tgtId,\n        distance: frame.distance + 1,\n        path: [...frame.path, tgtId],\n        pathEdges: [...frame.pathEdges, edge],\n      })\n    }\n  }\n\n  const affectedNodes = [...seen.values()].sort(\n    (a, b) => a.distance - b.distance || a.nodeId.localeCompare(b.nodeId),\n  )\n  return BlastRadiusResultSchema.parse({\n    origin: nodeId,\n    affectedNodes,\n    totalAffected: affectedNodes.length,\n  })\n}\n\n// Default + max depth for transitive get_dependencies (issue #144). Default\n// 3 keeps the output legible at the agent layer; the contract caps the\n// caller-supplied value at 10 to prevent BFS blow-up on dense graphs.\nexport const TRANSITIVE_DEPENDENCIES_DEFAULT_DEPTH = 3\nexport const TRANSITIVE_DEPENDENCIES_MAX_DEPTH = 10\n\n// Transitive get_dependencies (ADR-039 / #144). BFS outbound from origin to\n// `depth` hops, returning a flat list with distance, edgeType, and provenance\n// per dependency. Origin is never in the list. Direct-only consumers pass\n// depth=1; the MCP get_dependencies tool defaults to 3.\n//\n// Reuses bestEdgeByTarget (FRONTIER filtered, PROV_RANK-best per pair) so\n// dedup behavior matches the rest of traversal. Result is schema-validated\n// before return per ADR-036 §Result schema validation.\nexport function getTransitiveDependencies(\n  graph: NeatGraph,\n  nodeId: string,\n  depth: number = TRANSITIVE_DEPENDENCIES_DEFAULT_DEPTH,\n): TransitiveDependenciesResult {\n  if (!graph.hasNode(nodeId)) {\n    return TransitiveDependenciesResultSchema.parse({\n      origin: nodeId,\n      depth,\n      dependencies: [],\n      total: 0,\n    })\n  }\n\n  interface Frame {\n    nodeId: string\n    distance: number\n    edge: GraphEdge | null\n  }\n\n  const seen = new Map<string, TransitiveDependency>()\n  const queue: Frame[] = [{ nodeId, distance: 0, edge: null }]\n  const enqueued = new Set<string>([nodeId])\n\n  while (queue.length > 0) {\n    const frame = queue.shift()!\n    if (frame.distance > 0 && frame.edge) {\n      seen.set(frame.nodeId, {\n        nodeId: frame.nodeId,\n        distance: frame.distance,\n        edgeType: frame.edge.type,\n        provenance: frame.edge.provenance,\n      })\n    }\n    if (frame.distance >= depth) continue\n\n    const outgoing = bestEdgeByTarget(graph, graph.outboundEdges(frame.nodeId))\n    for (const [tgtId, edge] of outgoing) {\n      if (enqueued.has(tgtId)) continue\n      enqueued.add(tgtId)\n      queue.push({ nodeId: tgtId, distance: frame.distance + 1, edge })\n    }\n  }\n\n  const dependencies = [...seen.values()].sort(\n    (a, b) => a.distance - b.distance || a.nodeId.localeCompare(b.nodeId),\n  )\n  return TransitiveDependenciesResultSchema.parse({\n    origin: nodeId,\n    depth,\n    dependencies,\n    total: dependencies.length,\n  })\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport type {\n  DatabaseNode,\n  ErrorEvent,\n  FrontierNode,\n  GraphEdge,\n  Policy,\n  ServiceNode,\n  StaleEvent,\n} from '@neat.is/types'\nimport type { EvaluationContext as PolicyEvaluationContext } from './policy.js'\nimport { canPromoteFrontier } from './policy.js'\nimport {\n  EdgeType,\n  NodeType,\n  Provenance,\n  confidenceForObservedSignal,\n  databaseId,\n  extractedEdgeId,\n  frontierEdgeId,\n  frontierId,\n  inferredEdgeId,\n  observedEdgeId,\n  serviceId,\n  type EdgeTypeValue,\n} from '@neat.is/types'\nimport type { NeatGraph } from './graph.js'\nimport { DEFAULT_PROJECT } from './graph.js'\nimport type { ParsedSpan } from './otel.js'\nimport { emitNeatEvent } from './events.js'\n\n// Maps OTel spans to graph signal:\n//   * Cross-service span → upsert CALLS edge.\n//   * Database span (db.system attr present) → upsert CONNECTS_TO edge to a\n//     DatabaseNode resolved by host.\n//   * Span with status.code === 2 → ErrorEvent appended to errors.ndjson.\n//\n// Contract anchors (see /docs/contracts.md):\n//   * Rule 1 — Provenance: every edge here carries Provenance.X from @neat.is/types.\n//   * Rule 2 — Coexistence: OBSERVED edges live alongside EXTRACTED ones with a\n//     distinct id pattern (`${type}:OBSERVED:src->tgt`). Never write OBSERVED\n//     under the EXTRACTED id; that erases the gap NEAT exists to surface.\n//   * Rule 4 — Per-edge-type staleness (ADR-024): STALE_THRESHOLDS_BY_EDGE_TYPE\n//     governs decay; never hardcode a flat 24h threshold.\n//   * Rule 8 — No demo names: derive driver/engine identifiers from node\n//     properties, not literals.\n\nexport interface IngestContext {\n  graph: NeatGraph\n  errorsPath: string\n  // Project name for event-bus routing (ADR-051). Defaults to DEFAULT_PROJECT\n  // when omitted — keeps single-project tests / scripts wire-compatible.\n  project?: string\n  now?: () => number\n  // Set to false when the receiver already wrote the ErrorEvent synchronously\n  // (production daemons via watch.ts wire this). When true or omitted, handleSpan\n  // appends the ErrorEvent itself — the path used by ad-hoc scripts and tests\n  // that don't go through buildOtelReceiver. ADR-033 §Error events.\n  writeErrorEventInline?: boolean\n  // Post-mutation policy trigger (ADR-043). Fires after handleSpan finishes\n  // and the queue is drained. Daemons wire this to evaluateAllPolicies +\n  // PolicyViolationsLog.append. Ad-hoc callers leave it undefined; their tests\n  // don't need policy side effects.\n  onPolicyTrigger?: (graph: NeatGraph) => Promise<void> | void\n}\n\nconst HOUR_MS = 60 * 60 * 1000\nconst DAY_MS = 24 * HOUR_MS\n\n// Per-edge-type stale thresholds. HTTP CALLS at 24h is meaningless because\n// healthy traffic recurs in seconds; infra DEPENDS_ON is the opposite — a\n// docker-compose service can sit idle overnight without anything being wrong.\n// Override via NEAT_STALE_THRESHOLDS (JSON, ms-per-edge-type).\nconst DEFAULT_STALE_THRESHOLDS: Record<string, number> = {\n  CALLS: HOUR_MS,\n  CONNECTS_TO: 4 * HOUR_MS,\n  PUBLISHES_TO: 4 * HOUR_MS,\n  CONSUMES_FROM: 4 * HOUR_MS,\n  DEPENDS_ON: DAY_MS,\n  CONFIGURED_BY: DAY_MS,\n  RUNS_ON: DAY_MS,\n}\n// Fallback for any edge type not in the map (forward compat — adding a new\n// EdgeType shouldn't break staleness sweeps).\nconst FALLBACK_STALE_THRESHOLD_MS = DAY_MS\n\nfunction loadStaleThresholdsFromEnv(): Record<string, number> {\n  const raw = process.env.NEAT_STALE_THRESHOLDS\n  if (!raw) return DEFAULT_STALE_THRESHOLDS\n  try {\n    const overrides = JSON.parse(raw) as Record<string, unknown>\n    const merged = { ...DEFAULT_STALE_THRESHOLDS }\n    for (const [k, v] of Object.entries(overrides)) {\n      if (typeof v === 'number' && Number.isFinite(v) && v >= 0) merged[k] = v\n    }\n    return merged\n  } catch (err) {\n    console.warn(\n      `[neat] NEAT_STALE_THRESHOLDS could not be parsed (${(err as Error).message}); using defaults`,\n    )\n    return DEFAULT_STALE_THRESHOLDS\n  }\n}\n\nexport function thresholdForEdgeType(\n  edgeType: string,\n  overrides?: Record<string, number>,\n): number {\n  const map = overrides ?? loadStaleThresholdsFromEnv()\n  return map[edgeType] ?? FALLBACK_STALE_THRESHOLD_MS\n}\n\nfunction nowIso(ctx: IngestContext): string {\n  return new Date(ctx.now ? ctx.now() : Date.now()).toISOString()\n}\n\nfunction pickAttr(span: ParsedSpan, ...keys: string[]): string | undefined {\n  for (const k of keys) {\n    const v = span.attributes[k]\n    if (typeof v === 'string' && v.length > 0) return v\n  }\n  return undefined\n}\n\nfunction hostFromUrl(u: string | undefined): string | undefined {\n  if (!u) return undefined\n  try {\n    return new URL(u).hostname\n  } catch {\n    return undefined\n  }\n}\n\n// OTel HTTP/db semconv has gone through several names for \"the host on the\n// other end of this call.\" Try the modern ones first, fall back to the legacy\n// ones, then last resort parse out of a full URL.\nfunction pickAddress(span: ParsedSpan): string | undefined {\n  return (\n    pickAttr(span, 'server.address', 'net.peer.name', 'net.host.name') ??\n    hostFromUrl(pickAttr(span, 'url.full', 'http.url'))\n  )\n}\n\n// Edge id helpers live in @neat.is/types/identity.ts (ADR-029). The local\n// signatures below preserve the (type, source, target) argument order ingest.ts\n// has used historically while delegating to the canonical wire-format helpers.\nfunction makeObservedEdgeId(type: EdgeTypeValue, source: string, target: string): string {\n  return observedEdgeId(source, target, type)\n}\n\nfunction makeInferredEdgeId(type: EdgeTypeValue, source: string, target: string): string {\n  return inferredEdgeId(source, target, type)\n}\n\nconst INFERRED_CONFIDENCE = 0.6\nconst STITCH_MAX_DEPTH = 2\n\n// Parent-span TTL cache (ADR-033). Address-based peer resolution (server.address /\n// net.peer.name / url.full) misses non-HTTP RPCs and any span with an opaque\n// peer. The cache stores each span's service keyed by `${traceId}:${spanId}` so\n// a child span whose address resolution fails can fall back to its parent's\n// service, identifying a cross-service CALLS edge from parent → current.\n//\n// Bounded size + TTL — out-of-order arrival (child before parent) drops the\n// child rather than buffering. We accept that loss because the cache is best-\n// effort: for every cross-service call, the CLIENT span on the caller side\n// covers the same edge via address-based resolution, so missing one direction\n// is recoverable.\nconst PARENT_SPAN_CACHE_SIZE = 10_000\nconst PARENT_SPAN_CACHE_TTL_MS = 5 * 60 * 1000\n\ninterface ParentSpanCacheEntry {\n  service: string\n  expiresAt: number\n}\n\nconst parentSpanCache = new Map<string, ParentSpanCacheEntry>()\n\nfunction parentSpanKey(traceId: string, spanId: string): string {\n  return `${traceId}:${spanId}`\n}\n\nfunction cacheSpanService(span: ParsedSpan, now: number): void {\n  if (!span.traceId || !span.spanId) return\n  const key = parentSpanKey(span.traceId, span.spanId)\n  // Map preserves insertion order, so deleting + re-inserting bumps an entry to\n  // the back. Eviction is \"drop oldest\" once size exceeds the cap.\n  parentSpanCache.delete(key)\n  parentSpanCache.set(key, { service: span.service, expiresAt: now + PARENT_SPAN_CACHE_TTL_MS })\n  while (parentSpanCache.size > PARENT_SPAN_CACHE_SIZE) {\n    const oldest = parentSpanCache.keys().next().value\n    if (!oldest) break\n    parentSpanCache.delete(oldest)\n  }\n}\n\nfunction lookupParentSpanService(\n  traceId: string,\n  parentSpanId: string,\n  now: number,\n): string | null {\n  const entry = parentSpanCache.get(parentSpanKey(traceId, parentSpanId))\n  if (!entry) return null\n  if (entry.expiresAt <= now) {\n    parentSpanCache.delete(parentSpanKey(traceId, parentSpanId))\n    return null\n  }\n  return entry.service\n}\n\n// Test seam: lets unit tests start from a clean slate.\nexport function resetParentSpanCache(): void {\n  parentSpanCache.clear()\n}\n\nfunction resolveServiceId(graph: NeatGraph, host: string): string | null {\n  const direct = serviceId(host)\n  if (graph.hasNode(direct)) return direct\n\n  // Service hostnames in the demo can match either the package name (which the\n  // node id is built from) or the directory basename — handled by the name\n  // check below. Beyond that, anything in `aliases` (compose service names,\n  // k8s metadata.name + cluster-DNS variants, Dockerfile labels) should\n  // resolve too. Population happens in the extract phases; consumption is\n  // here.\n  let found: string | null = null\n  graph.forEachNode((id, attrs) => {\n    if (found) return\n    const a = attrs as ServiceNode & { type?: string }\n    if (a.type !== NodeType.ServiceNode) return\n    if (a.name === host) {\n      found = id\n      return\n    }\n    if (a.aliases && a.aliases.includes(host)) {\n      found = id\n    }\n  })\n  return found\n}\n\nexport function frontierIdFor(host: string): string {\n  return frontierId(host)\n}\n\n// Auto-create a minimal ServiceNode for span.service when no such node exists.\n// Used at the top of handleSpan so subsequent edge upserts always have endpoints\n// — without it, OBSERVED edges silently drop for any service the static\n// extractor hasn't reached yet (and never reaches at all in OTel-only setups).\n// `language: 'unknown'` is the contract's specified placeholder (ADR-033). When\n// static extraction later produces a ServiceNode at the same id, addServiceNodes\n// merges and flips discoveredVia to 'merged' rather than overwriting.\nfunction ensureServiceNode(graph: NeatGraph, serviceName: string): string {\n  const id = serviceId(serviceName)\n  if (graph.hasNode(id)) return id\n  const node: ServiceNode = {\n    id,\n    type: NodeType.ServiceNode,\n    name: serviceName,\n    language: 'unknown',\n    discoveredVia: 'otel',\n  }\n  graph.addNode(id, node)\n  return id\n}\n\n// Same shape for unseen db.system + host pairs. Engine comes off the OTel\n// attribute as a string per Rule 8 — no hardcoded engine list. compatibleDrivers\n// is empty until static extraction merges in the matrix-derived drivers.\nfunction ensureDatabaseNode(graph: NeatGraph, host: string, engine: string): string {\n  const id = databaseId(host)\n  if (graph.hasNode(id)) return id\n  const node: DatabaseNode = {\n    id,\n    type: NodeType.DatabaseNode,\n    name: host,\n    engine,\n    engineVersion: 'unknown',\n    compatibleDrivers: [],\n    host,\n    discoveredVia: 'otel',\n  }\n  graph.addNode(id, node)\n  return id\n}\n\nfunction ensureFrontierNode(graph: NeatGraph, host: string, ts: string): string {\n  const id = frontierIdFor(host)\n  if (graph.hasNode(id)) {\n    const existing = graph.getNodeAttributes(id) as FrontierNode\n    graph.replaceNodeAttributes(id, { ...existing, lastObserved: ts })\n    return id\n  }\n  const node: FrontierNode = {\n    id,\n    type: NodeType.FrontierNode,\n    name: host,\n    host,\n    firstObserved: ts,\n    lastObserved: ts,\n  }\n  graph.addNode(id, node)\n  return id\n}\n\nfunction upsertFrontierEdge(\n  graph: NeatGraph,\n  type: EdgeTypeValue,\n  source: string,\n  target: string,\n  ts: string,\n): void {\n  const id = frontierEdgeId(source, target, type)\n  if (graph.hasEdge(id)) {\n    const existing = graph.getEdgeAttributes(id) as GraphEdge\n    const updated: GraphEdge = {\n      ...existing,\n      provenance: Provenance.FRONTIER,\n      lastObserved: ts,\n      callCount: (existing.callCount ?? 0) + 1,\n    }\n    graph.replaceEdgeAttributes(id, updated)\n    return\n  }\n  const edge: GraphEdge = {\n    id,\n    source,\n    target,\n    type,\n    provenance: Provenance.FRONTIER,\n    confidence: 1.0,\n    lastObserved: ts,\n    callCount: 1,\n  }\n  graph.addEdgeWithKey(id, source, target, edge)\n}\n\ninterface UpsertResult {\n  edge: GraphEdge\n  created: boolean\n}\n\nfunction upsertObservedEdge(\n  graph: NeatGraph,\n  type: EdgeTypeValue,\n  source: string,\n  target: string,\n  ts: string,\n  isError = false,\n): UpsertResult | null {\n  if (!graph.hasNode(source) || !graph.hasNode(target)) return null\n\n  const id = makeObservedEdgeId(type, source, target)\n  if (graph.hasEdge(id)) {\n    const existing = graph.getEdgeAttributes(id) as GraphEdge\n    const newSpanCount = (existing.signal?.spanCount ?? existing.callCount ?? 0) + 1\n    const newErrorCount = (existing.signal?.errorCount ?? 0) + (isError ? 1 : 0)\n    const newSignal = {\n      spanCount: newSpanCount,\n      errorCount: newErrorCount,\n      lastObservedAgeMs: 0,\n    }\n    // ADR-066 §2 — confidence grades from the signal block. PROV_RANK stays;\n    // the grade reflects volume + recency + error ratio within the OBSERVED\n    // tier.\n    const updated: GraphEdge = {\n      ...existing,\n      provenance: Provenance.OBSERVED,\n      lastObserved: ts,\n      callCount: newSpanCount,\n      signal: newSignal,\n      confidence: confidenceForObservedSignal(newSignal),\n    }\n    graph.replaceEdgeAttributes(id, updated)\n    return { edge: updated, created: false }\n  }\n\n  const signal = {\n    spanCount: 1,\n    errorCount: isError ? 1 : 0,\n    lastObservedAgeMs: 0,\n  }\n  const edge: GraphEdge = {\n    id,\n    source,\n    target,\n    type,\n    provenance: Provenance.OBSERVED,\n    confidence: confidenceForObservedSignal(signal),\n    lastObserved: ts,\n    callCount: 1,\n    signal,\n  }\n  graph.addEdgeWithKey(id, source, target, edge)\n  return { edge, created: true }\n}\n\n// When a span errors, the system is exercising its dependencies right now even\n// if some of them aren't auto-instrumented (pg 7.4.0 in the demo, see ADR-014).\n// Walk EXTRACTED edges out from the erroring service for a couple of hops and\n// promote them to INFERRED twins so traversal can prefer them over the bare\n// static edges without claiming OBSERVED-grade certainty.\nfunction stitchTrace(graph: NeatGraph, sourceServiceId: string, ts: string): void {\n  if (!graph.hasNode(sourceServiceId)) return\n\n  const visited = new Set<string>([sourceServiceId])\n  const queue: { nodeId: string; depth: number }[] = [{ nodeId: sourceServiceId, depth: 0 }]\n\n  while (queue.length > 0) {\n    const { nodeId, depth } = queue.shift()!\n    if (depth >= STITCH_MAX_DEPTH) continue\n\n    const outbound = graph.outboundEdges(nodeId)\n    for (const edgeId of outbound) {\n      const edge = graph.getEdgeAttributes(edgeId) as GraphEdge\n      if (edge.provenance !== Provenance.EXTRACTED) continue\n\n      // OBSERVED twin already covers this hop with ground truth — no inference\n      // needed (ADR-034). Stomping it with INFERRED erases the gap NEAT exists\n      // to surface; skipping it keeps the OBSERVED edge as the authoritative\n      // record and avoids cluttering the graph with a redundant INFERRED twin.\n      if (graph.hasEdge(observedEdgeId(edge.source, edge.target, edge.type))) continue\n\n      upsertInferredEdge(graph, edge.type, edge.source, edge.target, ts)\n\n      if (!visited.has(edge.target)) {\n        visited.add(edge.target)\n        queue.push({ nodeId: edge.target, depth: depth + 1 })\n      }\n    }\n  }\n}\n\nfunction upsertInferredEdge(\n  graph: NeatGraph,\n  type: EdgeTypeValue,\n  source: string,\n  target: string,\n  ts: string,\n): void {\n  const id = makeInferredEdgeId(type, source, target)\n  if (graph.hasEdge(id)) {\n    const existing = graph.getEdgeAttributes(id) as GraphEdge\n    const updated: GraphEdge = { ...existing, lastObserved: ts }\n    graph.replaceEdgeAttributes(id, updated)\n    return\n  }\n\n  const edge: GraphEdge = {\n    id,\n    source,\n    target,\n    type,\n    provenance: Provenance.INFERRED,\n    confidence: INFERRED_CONFIDENCE,\n    lastObserved: ts,\n  }\n  graph.addEdgeWithKey(id, source, target, edge)\n}\n\nasync function appendErrorEvent(ctx: IngestContext, ev: ErrorEvent): Promise<void> {\n  await fs.mkdir(path.dirname(ctx.errorsPath), { recursive: true })\n  await fs.appendFile(ctx.errorsPath, JSON.stringify(ev) + '\\n', 'utf8')\n}\n\n// Build the minimal ErrorEvent the receiver writes synchronously before\n// replying (ADR-033 §Error events, amended). affectedNode resolves to the\n// originating service because graph state isn't available at this point —\n// the queued handleSpan path may reach a more precise target later, but the\n// durable record is what the receiver writes here.\nexport function buildErrorEventForReceiver(span: ParsedSpan): ErrorEvent | null {\n  if (span.statusCode !== 2) return null\n  const ts = span.startTimeIso ?? new Date().toISOString()\n  return {\n    id: `${span.traceId}:${span.spanId}`,\n    timestamp: ts,\n    service: span.service,\n    traceId: span.traceId,\n    spanId: span.spanId,\n    errorMessage:\n      span.exception?.message ?? span.errorMessage ?? span.name ?? 'unknown error',\n    ...(span.exception?.type ? { exceptionType: span.exception.type } : {}),\n    ...(span.exception?.stacktrace\n      ? { exceptionStacktrace: span.exception.stacktrace }\n      : {}),\n    affectedNode: serviceId(span.service),\n  }\n}\n\n// Synchronous file-write helper bound to a receiver. The receiver awaits this\n// before replying, so a write failure surfaces as 500 → OTel SDK retries.\nexport function makeErrorSpanWriter(\n  errorsPath: string,\n): (span: ParsedSpan) => Promise<void> {\n  return async (span) => {\n    const ev = buildErrorEventForReceiver(span)\n    if (!ev) return\n    await fs.mkdir(path.dirname(errorsPath), { recursive: true })\n    await fs.appendFile(errorsPath, JSON.stringify(ev) + '\\n', 'utf8')\n  }\n}\n\nexport async function handleSpan(ctx: IngestContext, span: ParsedSpan): Promise<void> {\n  // lastObserved derives from the span's own startTime per ADR-033 — replayed\n  // traces and out-of-order spans get a timestamp that reflects when the call\n  // actually fired, not when the receiver received it. Wall-clock is only the\n  // fallback for spans whose startTimeUnixNano is missing or unparseable.\n  const ts = span.startTimeIso ?? nowIso(ctx)\n  const nowMs = ctx.now ? ctx.now() : Date.now()\n  // Auto-create a minimal ServiceNode for unseen span.service so OBSERVED\n  // edges land instead of silently dropping. Static extraction merges richer\n  // fields when it later finds the same id (ADR-033).\n  const sourceId = ensureServiceNode(ctx.graph, span.service)\n  const isError = span.statusCode === 2\n  // Stash this span in the parent-span cache so any later child whose address\n  // resolution misses can still resolve the cross-service edge via parentSpanId.\n  cacheSpanService(span, nowMs)\n\n  let affectedNode = sourceId\n\n  if (span.dbSystem) {\n    // Database span — try to resolve the DatabaseNode by host.\n    const host = pickAddress(span)\n    if (host) {\n      // Auto-create a minimal DatabaseNode when this host hasn't been seen.\n      // Engine comes off the OTel attribute as a string per Rule 8.\n      ensureDatabaseNode(ctx.graph, host, span.dbSystem)\n      const targetId = databaseId(host)\n      const result = upsertObservedEdge(\n        ctx.graph,\n        EdgeType.CONNECTS_TO,\n        sourceId,\n        targetId,\n        ts,\n        isError,\n      )\n      if (result) affectedNode = targetId\n    }\n  } else {\n    // Possibly a cross-service call. Resolve the peer; if it matches a known\n    // ServiceNode, record an OBSERVED CALLS edge. If it matches nothing — pod\n    // IP, ingress hostname, AWS PrivateLink endpoint — drop a FRONTIER\n    // placeholder so the call isn't lost. promoteFrontierNodes (run by the\n    // extract orchestrator) replaces it once a later round records the host\n    // as an alias on a real service.\n    const host = pickAddress(span)\n    let resolvedViaAddress = false\n    if (host && host !== span.service) {\n      const targetId = resolveServiceId(ctx.graph, host)\n      if (targetId && targetId !== sourceId) {\n        upsertObservedEdge(\n          ctx.graph,\n          EdgeType.CALLS,\n          sourceId,\n          targetId,\n          ts,\n          isError,\n        )\n        affectedNode = targetId\n        resolvedViaAddress = true\n      } else if (!targetId) {\n        const frontierId = ensureFrontierNode(ctx.graph, host, ts)\n        if (ctx.graph.hasNode(sourceId)) {\n          upsertFrontierEdge(ctx.graph, EdgeType.CALLS, sourceId, frontierId, ts)\n        }\n        affectedNode = frontierId\n        resolvedViaAddress = true\n      }\n    }\n\n    // Parent-span fallback (ADR-033): when address-based resolution didn't\n    // produce an edge and the span has a parentSpanId we've cached, the\n    // parent's service identifies the caller. The current span is the server\n    // side of the call, so the edge direction is parent.service → current.\n    if (!resolvedViaAddress && span.parentSpanId) {\n      const parentService = lookupParentSpanService(span.traceId, span.parentSpanId, nowMs)\n      if (parentService && parentService !== span.service) {\n        const parentId = ensureServiceNode(ctx.graph, parentService)\n        upsertObservedEdge(\n          ctx.graph,\n          EdgeType.CALLS,\n          parentId,\n          sourceId,\n          ts,\n          isError,\n        )\n      }\n    }\n  }\n\n  if (span.statusCode === 2) {\n    stitchTrace(ctx.graph, sourceId, ts)\n    // The durable ErrorEvent write moved to the receiver so the file write\n    // happens synchronously before the 200 reply (ADR-033 §Error events,\n    // amended). watch.ts wires makeErrorSpanWriter into onErrorSpanSync.\n    // handleSpan still runs the in-graph error effects (stitchTrace above);\n    // it just doesn't append to errors.ndjson anymore. ctx.errorsPath stays\n    // for the optional opt-in path below — daemon-less callers (CLI tests,\n    // ad-hoc scripts) that skip the receiver hook still get a write here.\n    if (ctx.writeErrorEventInline !== false) {\n      const ev: ErrorEvent = {\n        id: `${span.traceId}:${span.spanId}`,\n        timestamp: ts,\n        service: span.service,\n        traceId: span.traceId,\n        spanId: span.spanId,\n        errorMessage:\n          span.exception?.message ?? span.errorMessage ?? span.name ?? 'unknown error',\n        ...(span.exception?.type ? { exceptionType: span.exception.type } : {}),\n        ...(span.exception?.stacktrace\n          ? { exceptionStacktrace: span.exception.stacktrace }\n          : {}),\n        affectedNode,\n      }\n      await appendErrorEvent(ctx, ev)\n    }\n  }\n  void affectedNode\n\n  // Post-ingest policy trigger (ADR-043). The hook is awaited so failures\n  // surface; daemons wrap it in a try/catch that logs without throwing.\n  if (ctx.onPolicyTrigger) await ctx.onPolicyTrigger(ctx.graph)\n}\n\nexport { stitchTrace }\n\n// Promote any frontier:<host> placeholder whose host matches an alias on a\n// real ServiceNode: re-link inbound/outbound edges to the service, then drop\n// the placeholder. Returns the count of nodes promoted, for tests + logs.\n//\n// Called at the end of every extraction round. Static rounds are when new\n// aliases land (compose names, k8s metadata.name, Dockerfile labels), so\n// running it there picks up the case the issue describes: ingest fills in a\n// frontier when traffic arrives for an unknown host, and the next extraction\n// round resolves it.\n// Optional gate for block-action policies (ADR-044). When `policies` is\n// non-empty, each candidate FrontierNode runs through `canPromoteFrontier`\n// before its incident edges are rewired. Block-action policies that fire on\n// the frontier veto the promotion — the FrontierNode persists; the next\n// extract pass tries again.\nexport interface PromoteFrontierOptions {\n  policies?: Policy[]\n  policyCtx?: PolicyEvaluationContext\n}\n\nexport function promoteFrontierNodes(\n  graph: NeatGraph,\n  opts: PromoteFrontierOptions = {},\n): number {\n  const aliasIndex = new Map<string, string>()\n  graph.forEachNode((id, attrs) => {\n    const a = attrs as ServiceNode & { type?: string }\n    if (a.type !== NodeType.ServiceNode) return\n    aliasIndex.set(a.name, id)\n    if (a.aliases) {\n      for (const alias of a.aliases) aliasIndex.set(alias, id)\n    }\n  })\n\n  const toPromote: { frontierId: string; serviceId: string }[] = []\n  graph.forEachNode((id, attrs) => {\n    const a = attrs as FrontierNode & { type?: string }\n    if (a.type !== NodeType.FrontierNode) return\n    const target = aliasIndex.get(a.host)\n    if (!target) return\n    if (target === id) return\n    toPromote.push({ frontierId: id, serviceId: target })\n  })\n\n  let promoted = 0\n  for (const { frontierId, serviceId } of toPromote) {\n    if (opts.policies && opts.policies.length > 0 && opts.policyCtx) {\n      const gate = canPromoteFrontier(graph, frontierId, opts.policies, opts.policyCtx)\n      if (!gate.allowed) {\n        // Block-action policy fired on this frontier — skip the rewire and\n        // leave the FrontierNode in place. Violations already surfaced via\n        // the policy log on the same evaluation pass.\n        continue\n      }\n    }\n    rewireFrontierEdges(graph, frontierId, serviceId)\n    graph.dropNode(frontierId)\n    promoted++\n  }\n  return promoted\n}\n\nfunction rewireFrontierEdges(graph: NeatGraph, frontierId: string, serviceId: string): void {\n  const inbound = [...graph.inboundEdges(frontierId)]\n  const outbound = [...graph.outboundEdges(frontierId)]\n\n  for (const edgeId of inbound) {\n    const edge = graph.getEdgeAttributes(edgeId) as GraphEdge\n    rebuildEdge(graph, edge, edge.source, serviceId, edgeId)\n  }\n  for (const edgeId of outbound) {\n    const edge = graph.getEdgeAttributes(edgeId) as GraphEdge\n    rebuildEdge(graph, edge, serviceId, edge.target, edgeId)\n  }\n}\n\nfunction rebuildEdge(\n  graph: NeatGraph,\n  edge: GraphEdge,\n  newSource: string,\n  newTarget: string,\n  oldEdgeId: string,\n): void {\n  graph.dropEdge(oldEdgeId)\n  // FRONTIER provenance gets upgraded to OBSERVED on promotion: the call\n  // certainty was always there; only the target identity was unknown, and now\n  // it isn't.\n  const promotedProvenance =\n    edge.provenance === Provenance.FRONTIER ? Provenance.OBSERVED : edge.provenance\n  const newId =\n    promotedProvenance === Provenance.OBSERVED\n      ? observedEdgeId(newSource, newTarget, edge.type)\n      : promotedProvenance === Provenance.INFERRED\n        ? inferredEdgeId(newSource, newTarget, edge.type)\n        : promotedProvenance === Provenance.EXTRACTED\n          ? extractedEdgeId(newSource, newTarget, edge.type)\n          : frontierEdgeId(newSource, newTarget, edge.type)\n\n  if (graph.hasEdge(newId)) {\n    const existing = graph.getEdgeAttributes(newId) as GraphEdge\n    const merged: GraphEdge = {\n      ...existing,\n      callCount: (existing.callCount ?? 0) + (edge.callCount ?? 0),\n      lastObserved: pickLater(existing.lastObserved, edge.lastObserved),\n    }\n    graph.replaceEdgeAttributes(newId, merged)\n    return\n  }\n\n  const rebuilt: GraphEdge = {\n    ...edge,\n    id: newId,\n    source: newSource,\n    target: newTarget,\n    provenance: promotedProvenance,\n  }\n  graph.addEdgeWithKey(newId, newSource, newTarget, rebuilt)\n}\n\nfunction pickLater(a: string | undefined, b: string | undefined): string | undefined {\n  if (!a) return b\n  if (!b) return a\n  return new Date(a).getTime() >= new Date(b).getTime() ? a : b\n}\n\nexport function makeSpanHandler(ctx: IngestContext): (span: ParsedSpan) => Promise<void> {\n  return (span) => handleSpan(ctx, span)\n}\n\nexport type { StaleEvent }\n\nexport interface MarkStaleOptions {\n  // Per-edge-type override map. Defaults to DEFAULT_STALE_THRESHOLDS, merged\n  // with NEAT_STALE_THRESHOLDS if the env var is set.\n  thresholds?: Record<string, number>\n  now?: number\n  // ndjson path. When set, every OBSERVED → STALE transition appends one\n  // line. Skipped if undefined — tests and embedded use cases don't need a\n  // log.\n  staleEventsPath?: string\n  // Project tag for event-bus routing (ADR-051). Defaults to DEFAULT_PROJECT.\n  project?: string\n}\n\n// Demote OBSERVED edges that haven't been seen in a while. Per-edge-type\n// thresholds: HTTP CALLS go stale fast; infra DEPENDS_ON is patient. Returns\n// the count of demotions and the events appended to the log.\nexport async function markStaleEdges(\n  graph: NeatGraph,\n  options: MarkStaleOptions = {},\n): Promise<{ count: number; events: StaleEvent[] }> {\n  const thresholds = options.thresholds ?? loadStaleThresholdsFromEnv()\n  const now = options.now ?? Date.now()\n  const events: StaleEvent[] = []\n\n  const project = options.project ?? DEFAULT_PROJECT\n  graph.forEachEdge((id, attrs) => {\n    const e = attrs as GraphEdge\n    if (e.provenance !== Provenance.OBSERVED) return\n    if (!e.lastObserved) return\n    const threshold = thresholdForEdgeType(e.type, thresholds)\n    const age = now - new Date(e.lastObserved).getTime()\n    if (age > threshold) {\n      const updated: GraphEdge = { ...e, provenance: Provenance.STALE, confidence: 0.3 }\n      graph.replaceEdgeAttributes(id, updated)\n      events.push({\n        edgeId: id,\n        source: e.source,\n        target: e.target,\n        edgeType: e.type,\n        thresholdMs: threshold,\n        ageMs: age,\n        lastObserved: e.lastObserved,\n        transitionedAt: new Date(now).toISOString(),\n      })\n      // Stale-transition fires through the bus (ADR-051). The graph\n      // subscription in events.ts can't see the OBSERVED→STALE semantic on\n      // its own — a provenance flip is just an attribute update from\n      // graphology's view.\n      emitNeatEvent({\n        type: 'stale-transition',\n        project,\n        payload: {\n          edgeId: id,\n          from: Provenance.OBSERVED,\n          to: Provenance.STALE,\n        },\n      })\n    }\n  })\n\n  if (options.staleEventsPath && events.length > 0) {\n    await appendStaleEvents(options.staleEventsPath, events)\n  }\n\n  return { count: events.length, events }\n}\n\nasync function appendStaleEvents(staleEventsPath: string, events: StaleEvent[]): Promise<void> {\n  await fs.mkdir(path.dirname(staleEventsPath), { recursive: true })\n  const lines = events.map((e) => JSON.stringify(e)).join('\\n') + '\\n'\n  await fs.appendFile(staleEventsPath, lines, 'utf8')\n}\n\nexport async function readStaleEvents(staleEventsPath: string): Promise<StaleEvent[]> {\n  try {\n    const raw = await fs.readFile(staleEventsPath, 'utf8')\n    return raw\n      .split('\\n')\n      .filter((line) => line.length > 0)\n      .map((line) => JSON.parse(line) as StaleEvent)\n  } catch (err) {\n    if ((err as NodeJS.ErrnoException).code === 'ENOENT') return []\n    throw err\n  }\n}\n\nexport interface StalenessLoopOptions {\n  thresholds?: Record<string, number>\n  intervalMs?: number\n  staleEventsPath?: string\n  // Project tag for event-bus routing (ADR-051).\n  project?: string\n  // Post-stale-transition policy trigger (ADR-043). Fires after each tick of\n  // markStaleEdges so policies see the new STALE state. Daemons wire this to\n  // evaluateAllPolicies + PolicyViolationsLog.append.\n  onPolicyTrigger?: (graph: NeatGraph) => Promise<void> | void\n}\n\nexport function startStalenessLoop(\n  graph: NeatGraph,\n  options: StalenessLoopOptions = {},\n): () => void {\n  let stopped = false\n  const intervalMs = options.intervalMs ?? 60_000\n  const tick = (): void => {\n    if (stopped) return\n    void (async () => {\n      try {\n        await markStaleEdges(graph, {\n          thresholds: options.thresholds,\n          staleEventsPath: options.staleEventsPath,\n          project: options.project,\n        })\n        if (options.onPolicyTrigger) await options.onPolicyTrigger(graph)\n      } catch (err) {\n        console.error('staleness tick failed', err)\n      }\n    })()\n  }\n  const interval = setInterval(tick, intervalMs)\n  if (typeof interval.unref === 'function') interval.unref()\n  return () => {\n    stopped = true\n    clearInterval(interval)\n  }\n}\n\nexport async function readErrorEvents(errorsPath: string): Promise<ErrorEvent[]> {\n  try {\n    const raw = await fs.readFile(errorsPath, 'utf8')\n    return raw\n      .split('\\n')\n      .filter((line) => line.length > 0)\n      .map((line) => JSON.parse(line) as ErrorEvent)\n  } catch (err) {\n    if ((err as NodeJS.ErrnoException).code === 'ENOENT') return []\n    throw err\n  }\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport type {\n  GraphEdge,\n  GraphNode,\n  Policy,\n  PolicyAction,\n  PolicyFile,\n  PolicyRule,\n  PolicySeverity,\n  PolicyViolation,\n  ServiceNode,\n} from '@neat.is/types'\nimport {\n  EdgeType,\n  NodeType,\n  PolicyFileSchema,\n  Provenance,\n} from '@neat.is/types'\nimport type { NeatGraph } from './graph.js'\nimport { DEFAULT_PROJECT } from './graph.js'\nimport {\n  checkCompatibility,\n  checkDeprecatedApi,\n  checkNodeEngineConstraint,\n  checkPackageConflict,\n  compatPairs,\n  deprecatedApis,\n  nodeEngineConstraints,\n  packageConflicts,\n} from './compat.js'\nimport { emitNeatEvent } from './events.js'\nimport { getBlastRadius } from './traverse.js'\n\n// Policy evaluation engine (ADR-043). The entry point evaluateAllPolicies is\n// pure: same graph + same policies → same violations. Per-rule-type dispatch\n// via the policyEvaluators table. Adding a new rule type means one new\n// evaluator entry plus the schema entry in @neat.is/types/policy.ts.\n//\n// Deterministic violation ids per ADR-043: ${policy.id}:${context}. The\n// context is shape-specific (nodeId, edgeId, or composite). The\n// policy-violations.ndjson writer skips on duplicate ids.\n\nexport interface EvaluationContext {\n  // Wall-clock provider. Tests pin this; production uses Date.now.\n  now: () => number\n}\n\ninterface RuleEvaluatorArgs<T extends PolicyRule = PolicyRule> {\n  graph: NeatGraph\n  policy: Policy\n  rule: T\n  ctx: EvaluationContext\n}\n\ntype RuleEvaluator<T extends PolicyRule = PolicyRule> = (\n  args: RuleEvaluatorArgs<T>,\n) => PolicyViolation[]\n\n// Severity-driven default action per ADR-044.\nconst DEFAULT_ACTION_BY_SEVERITY: Record<PolicySeverity, PolicyAction> = {\n  info: 'log',\n  warning: 'alert',\n  error: 'alert',\n  critical: 'block',\n}\n\nexport function resolveOnViolation(policy: Policy): PolicyAction {\n  return policy.onViolation ?? DEFAULT_ACTION_BY_SEVERITY[policy.severity]\n}\n\nfunction makeViolation(\n  policy: Policy,\n  rule: PolicyRule,\n  contextSuffix: string,\n  message: string,\n  subject: PolicyViolation['subject'],\n  ctx: EvaluationContext,\n): PolicyViolation {\n  return {\n    id: `${policy.id}:${contextSuffix}`,\n    policyId: policy.id,\n    policyName: policy.name,\n    severity: policy.severity,\n    onViolation: resolveOnViolation(policy),\n    ruleType: rule.type,\n    subject,\n    message,\n    observedAt: new Date(ctx.now()).toISOString(),\n  }\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Per-rule-type evaluators\n// ──────────────────────────────────────────────────────────────────────────\n\nconst evaluateStructural: RuleEvaluator<Extract<PolicyRule, { type: 'structural' }>> = ({\n  graph,\n  policy,\n  rule,\n  ctx,\n}) => {\n  const violations: PolicyViolation[] = []\n  graph.forEachNode((id, attrs) => {\n    const a = attrs as GraphNode\n    if (a.type !== rule.fromNodeType) return\n    let satisfied = false\n    for (const edgeId of graph.outboundEdges(id)) {\n      const e = graph.getEdgeAttributes(edgeId) as GraphEdge\n      if (e.type !== rule.edgeType) continue\n      if (e.provenance === Provenance.FRONTIER) continue\n      const target = graph.getNodeAttributes(e.target) as GraphNode\n      if (target.type === rule.toNodeType) {\n        satisfied = true\n        break\n      }\n    }\n    if (!satisfied) {\n      violations.push(\n        makeViolation(\n          policy,\n          rule,\n          id,\n          `${rule.fromNodeType} ${id} has no ${rule.edgeType} edge to a ${rule.toNodeType}`,\n          { nodeId: id },\n          ctx,\n        ),\n      )\n    }\n  })\n  return violations\n}\n\nconst evaluateOwnership: RuleEvaluator<Extract<PolicyRule, { type: 'ownership' }>> = ({\n  graph,\n  policy,\n  rule,\n  ctx,\n}) => {\n  const violations: PolicyViolation[] = []\n  graph.forEachNode((id, attrs) => {\n    const a = attrs as GraphNode & Record<string, unknown>\n    if (a.type !== rule.nodeType) return\n    const value = a[rule.field]\n    if (typeof value !== 'string' || value.length === 0) {\n      violations.push(\n        makeViolation(\n          policy,\n          rule,\n          id,\n          `${rule.nodeType} ${id} is missing required field \"${rule.field}\"`,\n          { nodeId: id },\n          ctx,\n        ),\n      )\n    }\n  })\n  return violations\n}\n\nconst evaluateProvenance: RuleEvaluator<Extract<PolicyRule, { type: 'provenance' }>> = ({\n  graph,\n  policy,\n  rule,\n  ctx,\n}) => {\n  const required = Array.isArray(rule.required) ? new Set(rule.required) : new Set([rule.required])\n  const violations: PolicyViolation[] = []\n  graph.forEachEdge((edgeId, attrs) => {\n    const e = attrs as GraphEdge\n    if (e.type !== rule.edgeType) return\n    if (rule.targetNodeId && e.target !== rule.targetNodeId) return\n    if (!required.has(e.provenance)) {\n      const requiredList = [...required].join(' | ')\n      violations.push(\n        makeViolation(\n          policy,\n          rule,\n          edgeId,\n          `${rule.edgeType} edge ${edgeId} has provenance ${e.provenance}; required ${requiredList}`,\n          { edgeId },\n          ctx,\n        ),\n      )\n    }\n  })\n  return violations\n}\n\nconst evaluateBlastRadius: RuleEvaluator<Extract<PolicyRule, { type: 'blast-radius' }>> = ({\n  graph,\n  policy,\n  rule,\n  ctx,\n}) => {\n  const violations: PolicyViolation[] = []\n  const depth = rule.depth\n  graph.forEachNode((id, attrs) => {\n    const a = attrs as GraphNode\n    if (a.type !== rule.nodeType) return\n    const result = depth !== undefined ? getBlastRadius(graph, id, depth) : getBlastRadius(graph, id)\n    if (result.totalAffected > rule.maxAffected) {\n      violations.push(\n        makeViolation(\n          policy,\n          rule,\n          id,\n          `${rule.nodeType} ${id} has blast radius ${result.totalAffected} > ${rule.maxAffected}`,\n          { nodeId: id, path: [id] },\n          ctx,\n        ),\n      )\n    }\n  })\n  return violations\n}\n\nconst evaluateCompatibility: RuleEvaluator<Extract<PolicyRule, { type: 'compatibility' }>> = ({\n  graph,\n  policy,\n  rule,\n  ctx,\n}) => {\n  const violations: PolicyViolation[] = []\n  // Iterate every ServiceNode and re-run the compat shapes the static\n  // extractor runs at extract time. Catches OBSERVED-vs-EXTRACTED divergence:\n  // a service whose dep manifest changed since the last extract gets re-flagged\n  // here on every evaluation cycle.\n  const wantsKind = (kind: NonNullable<typeof rule.kind>): boolean =>\n    rule.kind === undefined || rule.kind === kind\n\n  graph.forEachNode((svcId, attrs) => {\n    const a = attrs as GraphNode\n    if (a.type !== NodeType.ServiceNode) return\n    const svc = a as ServiceNode\n    const deps = svc.dependencies ?? {}\n\n    if (wantsKind('driver-engine')) {\n      // Walk every CONNECTS_TO edge from this service to a DatabaseNode,\n      // then run the driver-engine compat for each (driver, declared, engine,\n      // engineVersion) tuple.\n      for (const edgeId of graph.outboundEdges(svcId)) {\n        const e = graph.getEdgeAttributes(edgeId) as GraphEdge\n        if (e.type !== EdgeType.CONNECTS_TO) continue\n        if (e.provenance === Provenance.FRONTIER) continue\n        const dbAttrs = graph.getNodeAttributes(e.target) as GraphNode\n        if (dbAttrs.type !== NodeType.DatabaseNode) continue\n        const db = dbAttrs as { engine: string; engineVersion: string }\n        for (const pair of compatPairs()) {\n          if (pair.engine !== db.engine) continue\n          const declared = deps[pair.driver]\n          if (!declared) continue\n          const result = checkCompatibility(pair.driver, declared, db.engine, db.engineVersion)\n          if (!result.compatible && result.reason) {\n            violations.push(\n              makeViolation(\n                policy,\n                rule,\n                `${svcId}:driver-engine:${pair.driver}@${declared}:${db.engine}@${db.engineVersion}`,\n                result.reason,\n                { nodeId: svcId, edgeId },\n                ctx,\n              ),\n            )\n          }\n        }\n      }\n    }\n\n    if (wantsKind('node-engine')) {\n      const serviceNodeRange = svc.nodeEngine\n      for (const constraint of nodeEngineConstraints()) {\n        const declared = deps[constraint.package]\n        if (!declared) continue\n        const result = checkNodeEngineConstraint(constraint, declared, serviceNodeRange)\n        if (!result.compatible && result.reason) {\n          violations.push(\n            makeViolation(\n              policy,\n              rule,\n              `${svcId}:node-engine:${constraint.package}@${declared}`,\n              result.reason,\n              { nodeId: svcId },\n              ctx,\n            ),\n          )\n        }\n      }\n    }\n\n    if (wantsKind('package-conflict')) {\n      for (const conflict of packageConflicts()) {\n        const declared = deps[conflict.package]\n        if (!declared) continue\n        const requiredDeclared = deps[conflict.requires.name]\n        const result = checkPackageConflict(conflict, declared, requiredDeclared)\n        if (!result.compatible && result.reason) {\n          violations.push(\n            makeViolation(\n              policy,\n              rule,\n              `${svcId}:package-conflict:${conflict.package}@${declared}`,\n              result.reason,\n              { nodeId: svcId },\n              ctx,\n            ),\n          )\n        }\n      }\n    }\n\n    if (wantsKind('deprecated-api')) {\n      for (const dep of deprecatedApis()) {\n        const declared = deps[dep.package]\n        if (!declared) continue\n        const result = checkDeprecatedApi(dep, declared)\n        if (!result.compatible && result.reason) {\n          violations.push(\n            makeViolation(\n              policy,\n              rule,\n              `${svcId}:deprecated-api:${dep.package}@${declared}`,\n              result.reason,\n              { nodeId: svcId },\n              ctx,\n            ),\n          )\n        }\n      }\n    }\n  })\n\n  return violations\n}\n\nconst policyEvaluators: { [K in PolicyRule['type']]: RuleEvaluator<Extract<PolicyRule, { type: K }>> } = {\n  structural: evaluateStructural,\n  ownership: evaluateOwnership,\n  provenance: evaluateProvenance,\n  'blast-radius': evaluateBlastRadius,\n  compatibility: evaluateCompatibility,\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Public entry point\n// ──────────────────────────────────────────────────────────────────────────\n\n// Block-action gating for FrontierNode promotion (ADR-044 §block, MVP scope).\n// Runs the policy evaluator and returns the subset of block-action violations\n// that mention the candidate FrontierNode. Callers (ingest.ts\n// promoteFrontierNodes) check `allowed` before rewiring; when false, the\n// promotion is skipped and the violations surface through the standard\n// policy-violations.ndjson channel.\n//\n// Block scope is tightly bounded per the contract: FrontierNode promotion\n// only. Other gating points (deploy, codemod, OTel auto-create) need their\n// own ADRs before this function expands.\nexport function canPromoteFrontier(\n  graph: NeatGraph,\n  frontierId: string,\n  policies: Policy[],\n  ctx: EvaluationContext,\n): { allowed: boolean; violations: PolicyViolation[] } {\n  if (policies.length === 0) return { allowed: true, violations: [] }\n  const all = evaluateAllPolicies(graph, policies, ctx)\n  const blocking = all.filter((v) => {\n    if (v.onViolation !== 'block') return false\n    return (\n      v.subject.nodeId === frontierId ||\n      v.subject.path?.includes(frontierId) === true\n    )\n  })\n  return { allowed: blocking.length === 0, violations: blocking }\n}\n\nexport function evaluateAllPolicies(\n  graph: NeatGraph,\n  policies: Policy[],\n  ctx: EvaluationContext,\n): PolicyViolation[] {\n  const out: PolicyViolation[] = []\n  for (const policy of policies) {\n    const evaluator = policyEvaluators[policy.rule.type] as RuleEvaluator\n    const violations = evaluator({ graph, policy, rule: policy.rule, ctx })\n    for (const v of violations) out.push(v)\n  }\n  return out\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Loader\n// ──────────────────────────────────────────────────────────────────────────\n\n// Reads <projectRoot>/policy.json. Returns [] when the file doesn't exist —\n// a project without policies is a perfectly fine state. Failures to parse\n// throw with the Zod error so the daemon surfaces malformed files loudly\n// instead of silently dropping rules.\nexport async function loadPolicyFile(policyPath: string): Promise<Policy[]> {\n  let raw: string\n  try {\n    raw = await fs.readFile(policyPath, 'utf8')\n  } catch (err) {\n    if ((err as NodeJS.ErrnoException).code === 'ENOENT') return []\n    throw err\n  }\n  const json = JSON.parse(raw) as unknown\n  const file: PolicyFile = PolicyFileSchema.parse(json)\n  return file.policies\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Append-only ndjson writer with id-based dedup\n// ──────────────────────────────────────────────────────────────────────────\n\n// Keeps an in-memory Set of seen violation ids so re-evaluation cycles don't\n// produce duplicate ndjson lines. The set hydrates from disk on first append\n// — startups that load an existing log don't lose dedup state.\nexport class PolicyViolationsLog {\n  private readonly path: string\n  private readonly project: string\n  private seen: Set<string> | null = null\n\n  constructor(logPath: string, project: string = DEFAULT_PROJECT) {\n    this.path = logPath\n    this.project = project\n  }\n\n  async append(v: PolicyViolation): Promise<boolean> {\n    if (!this.seen) await this.hydrate()\n    if (this.seen!.has(v.id)) return false\n    this.seen!.add(v.id)\n    await fs.mkdir(path.dirname(this.path), { recursive: true })\n    await fs.appendFile(this.path, JSON.stringify(v) + '\\n', 'utf8')\n    // Emit policy-violation only on first sighting (post-dedup) so SSE\n    // consumers don't see the same violation again on every evaluation\n    // cycle (ADR-051 #2).\n    emitNeatEvent({\n      type: 'policy-violation',\n      project: this.project,\n      payload: { violation: v },\n    })\n    return true\n  }\n\n  async readAll(): Promise<PolicyViolation[]> {\n    try {\n      const raw = await fs.readFile(this.path, 'utf8')\n      return raw\n        .split('\\n')\n        .filter(Boolean)\n        .map((line) => JSON.parse(line) as PolicyViolation)\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === 'ENOENT') return []\n      throw err\n    }\n  }\n\n  private async hydrate(): Promise<void> {\n    this.seen = new Set()\n    const existing = await this.readAll()\n    for (const v of existing) this.seen.add(v.id)\n  }\n}\n","// Frontend-facing event bus (ADR-051). The single in-process EventEmitter\n// every producer (ingest / extract / watch / policy) emits through and the\n// only thing the SSE handler in streaming.ts subscribes to.\n//\n// Direct producer-to-handler coupling is a contract violation — every event\n// goes through `eventBus.emit('event', envelope)` so the SSE layer is the\n// only consumer that has to know the wire taxonomy.\n//\n// The taxonomy is locked at eight types (ADR-051 #2). Adding a ninth type\n// requires a successor ADR.\n\nimport { EventEmitter } from 'node:events'\nimport type { GraphEdge, GraphNode, PolicyViolation, Provenance } from '@neat.is/types'\nimport type { NeatGraph } from './graph.js'\n\n// Locked event taxonomy. Eight values. Tests assert the array shape\n// directly, so adding here without updating the contract is a regression.\nexport const NEAT_EVENT_TYPES = [\n  'node-added',\n  'node-updated',\n  'node-removed',\n  'edge-added',\n  'edge-removed',\n  'extraction-complete',\n  'policy-violation',\n  'stale-transition',\n] as const\n\nexport type NeatEventType = (typeof NEAT_EVENT_TYPES)[number]\n\n// Per-type payload shapes. The wire layer (SSE) writes the payload as the\n// `data` field; producers use `emit*` helpers below for type safety.\nexport interface NodeAddedPayload {\n  node: GraphNode\n}\nexport interface NodeUpdatedPayload {\n  id: string\n  changes: Partial<GraphNode>\n}\nexport interface NodeRemovedPayload {\n  id: string\n}\nexport interface EdgeAddedPayload {\n  edge: GraphEdge\n}\nexport interface EdgeRemovedPayload {\n  id: string\n}\nexport interface ExtractionCompletePayload {\n  project: string\n  fileCount: number\n  nodesAdded: number\n  edgesAdded: number\n}\nexport interface PolicyViolationPayload {\n  violation: PolicyViolation\n}\nexport interface StaleTransitionPayload {\n  edgeId: string\n  from: typeof Provenance.OBSERVED\n  to: typeof Provenance.STALE\n}\n\nexport type NeatEventPayload = {\n  'node-added': NodeAddedPayload\n  'node-updated': NodeUpdatedPayload\n  'node-removed': NodeRemovedPayload\n  'edge-added': EdgeAddedPayload\n  'edge-removed': EdgeRemovedPayload\n  'extraction-complete': ExtractionCompletePayload\n  'policy-violation': PolicyViolationPayload\n  'stale-transition': StaleTransitionPayload\n}\n\n// What the bus carries internally. Project is metadata used by the SSE\n// handler to route between /events and /projects/:project/events; it never\n// lands in the wire payload.\nexport interface NeatEventEnvelope<T extends NeatEventType = NeatEventType> {\n  type: T\n  project: string\n  payload: NeatEventPayload[T]\n}\n\n// Single event channel — listeners filter by `envelope.type` and\n// `envelope.project`. Using one channel keeps the contract surface narrow\n// and matches the SSE handler's needs (one subscription, fan out).\nexport const EVENT_BUS_CHANNEL = 'event'\n\nclass NeatEventBus extends EventEmitter {}\n\n// Singleton. Process-wide so producers in ingest / extract / watch / policy\n// can emit without threading a bus instance through every call site.\nexport const eventBus: NeatEventBus = new NeatEventBus()\n\n// EventEmitter defaults to 10 listeners; SSE clients add up quickly under a\n// browser refresh storm, so lift the cap.\neventBus.setMaxListeners(0)\n\nexport function emitNeatEvent<T extends NeatEventType>(envelope: NeatEventEnvelope<T>): void {\n  eventBus.emit(EVENT_BUS_CHANNEL, envelope)\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Graph subscription — one place to wire graphology mutation events into\n// the bus so producers don't have to instrument every addNode/addEdge.\n// ──────────────────────────────────────────────────────────────────────────\n\nexport interface AttachOptions {\n  project: string\n}\n\n// Subscribes to a NeatGraph and re-emits node/edge add/remove + node/edge\n// attribute updates as bus envelopes scoped to `project`. Returns a detach\n// fn that removes every listener it installed.\n//\n// Stale-transition is NOT routed through here — a provenance flip is just an\n// attribute update from graphology's view, and we'd lose the OBSERVED→STALE\n// semantic. ingest.ts emits stale-transition itself.\nexport function attachGraphToEventBus(graph: NeatGraph, opts: AttachOptions): () => void {\n  const { project } = opts\n\n  const onNodeAdded = (payload: { key: string; attributes: GraphNode }): void => {\n    emitNeatEvent({\n      type: 'node-added',\n      project,\n      payload: { node: payload.attributes },\n    })\n  }\n  const onNodeDropped = (payload: { key: string }): void => {\n    emitNeatEvent({\n      type: 'node-removed',\n      project,\n      payload: { id: payload.key },\n    })\n  }\n  const onEdgeAdded = (payload: { key: string; attributes: GraphEdge }): void => {\n    emitNeatEvent({\n      type: 'edge-added',\n      project,\n      payload: { edge: payload.attributes },\n    })\n  }\n  const onEdgeDropped = (payload: { key: string }): void => {\n    emitNeatEvent({\n      type: 'edge-removed',\n      project,\n      payload: { id: payload.key },\n    })\n  }\n  const onNodeAttrsUpdated = (payload: { key: string; attributes: GraphNode }): void => {\n    emitNeatEvent({\n      type: 'node-updated',\n      project,\n      payload: { id: payload.key, changes: payload.attributes },\n    })\n  }\n\n  graph.on('nodeAdded', onNodeAdded)\n  graph.on('nodeDropped', onNodeDropped)\n  graph.on('edgeAdded', onEdgeAdded)\n  graph.on('edgeDropped', onEdgeDropped)\n  graph.on('nodeAttributesUpdated', onNodeAttrsUpdated)\n\n  return () => {\n    graph.off('nodeAdded', onNodeAdded)\n    graph.off('nodeDropped', onNodeDropped)\n    graph.off('edgeAdded', onEdgeAdded)\n    graph.off('edgeDropped', onEdgeDropped)\n    graph.off('nodeAttributesUpdated', onNodeAttrsUpdated)\n  }\n}\n","// ADR-065 — loud failure mode for static extraction.\n//\n// Per-file extraction failures used to land as a single `console.warn` line\n// with no aggregate count and no on-disk record. The 2026-05-12 medusa\n// experiment ran `neat init` against ~90 files that all silently failed\n// extraction with \"Invalid argument\"; the snapshot shipped with those files\n// missing, the user had no signal it had happened, and the divergence query\n// couldn't surface gaps it didn't know it had.\n//\n// This module is the failure-mode plumbing: a process-local sink that every\n// producer appends to when a per-file parse fails, with helpers to drain the\n// sink to `<projectDir>/neat-out/errors.ndjson` and to surface the aggregate\n// count in init / watch banners.\n\nimport { promises as fs } from 'node:fs'\nimport path from 'node:path'\n\nexport interface ExtractionError {\n  // Producer name (e.g. \"http\", \"services\", \"infra docker-compose\"). Stable\n  // human-readable identifier for logs and contract assertions.\n  producer: string\n  // Absolute or relative path of the file that failed. Stored verbatim from\n  // the call site; no normalisation here.\n  file: string\n  // The error's `.message`. Stringified if the throw value wasn't an Error.\n  error: string\n  // Optional stack trace (captured at the call site). Useful for diagnosing\n  // tree-sitter \"Invalid argument\" cases where the message alone is generic.\n  stack?: string\n  // ISO timestamp of when the error was recorded.\n  ts: string\n  // Discriminator for `errors.ndjson` consumers — separates extract failures\n  // from OTel error events that share the same file (ADR-033).\n  source: 'extract'\n}\n\nconst sink: ExtractionError[] = []\n\n// Record a per-file extraction failure. Preserves the visible warn line so\n// existing scripts/CI consumers still see a per-file message; appends to the\n// process-local sink so the aggregate count + sidecar write can fire later.\nexport function recordExtractionError(\n  producer: string,\n  file: string,\n  err: unknown,\n): void {\n  const e = err instanceof Error ? err : new Error(String(err))\n  sink.push({\n    producer,\n    file,\n    error: e.message,\n    stack: e.stack,\n    ts: new Date().toISOString(),\n    source: 'extract',\n  })\n  // Visible warn preserved (pre-ADR-065 callers logged this). Banners\n  // aggregate, but per-file context still useful for tail -f sessions.\n  console.warn(`[neat] ${producer} skipped ${file}: ${e.message}`)\n}\n\n// Drain all queued errors. Idempotent — subsequent calls return an empty\n// array until new errors land. Callers (extractFromDirectory) drain at start\n// to clear stale state from prior runs, then drain again at end to collect\n// the pass's failures.\nexport function drainExtractionErrors(): ExtractionError[] {\n  return sink.splice(0, sink.length)\n}\n\n// Read-only count of currently-queued errors. Used by callers that want the\n// count without consuming the sink (the banner case — we want the count for\n// display and the entries for `errors.ndjson`).\nexport function pendingExtractionErrors(): number {\n  return sink.length\n}\n\n// Append the drained entries to `<projectDir>/neat-out/errors.ndjson`. The\n// file is shared with OTel error events (per ADR-033); the `source: 'extract'`\n// discriminator separates them for consumers. Creates the directory if\n// missing. Append-only — never rewritten.\nexport async function writeExtractionErrors(\n  errors: ExtractionError[],\n  errorsPath: string,\n): Promise<void> {\n  if (errors.length === 0) return\n  await fs.mkdir(path.dirname(errorsPath), { recursive: true })\n  const lines = errors.map((e) => JSON.stringify(e)).join('\\n') + '\\n'\n  await fs.appendFile(errorsPath, lines, 'utf8')\n}\n\n// ADR-065 — `NEAT_STRICT_EXTRACTION=1` makes any per-file extraction failure\n// cause the calling command to exit non-zero. Default is forgiving (banner\n// only). The check is at the caller (cli.ts / server.ts / watch.ts) so the\n// extraction phase itself stays library-shaped.\nexport function isStrictExtractionEnabled(): boolean {\n  const raw = process.env.NEAT_STRICT_EXTRACTION\n  return raw === '1' || raw === 'true'\n}\n\n// Format the unconditional summary banner. Zero errors is a positive signal\n// (\"0 files skipped\") so callers print this even on clean runs.\nexport function formatExtractionBanner(count: number): string {\n  if (count === 1) return `[neat] 1 file skipped due to parse errors`\n  return `[neat] ${count} files skipped due to parse errors`\n}\n\n// ─────────────────────────────────────────────────────────────────────────\n// ADR-066 — precision-floor drop accounting.\n//\n// EXTRACTED candidates whose graded confidence falls below\n// NEAT_EXTRACTED_PRECISION_FLOOR (default 0.7) are computed but never added\n// to the graph. The drop count surfaces on the extraction banner;\n// NEAT_EXTRACTED_REJECTED_LOG=1 routes the per-candidate detail to\n// `<projectDir>/neat-out/rejected.ndjson`. The default keeps the sidecar\n// surface quiet.\n// ─────────────────────────────────────────────────────────────────────────\n\nexport interface DroppedExtractedEdge {\n  source: string\n  target: string\n  type: string\n  confidence: number\n  confidenceKind: string\n  evidence: { file: string; line?: number; snippet?: string }\n}\n\nconst droppedSink: DroppedExtractedEdge[] = []\n\nexport function noteExtractedDropped(edge: DroppedExtractedEdge): void {\n  droppedSink.push(edge)\n}\n\nexport function drainDroppedExtracted(): DroppedExtractedEdge[] {\n  return droppedSink.splice(0, droppedSink.length)\n}\n\nexport function pendingDroppedExtracted(): number {\n  return droppedSink.length\n}\n\nexport function isRejectedLogEnabled(): boolean {\n  const raw = process.env.NEAT_EXTRACTED_REJECTED_LOG\n  return raw === '1' || raw === 'true'\n}\n\nexport async function writeRejectedExtracted(\n  drops: DroppedExtractedEdge[],\n  rejectedPath: string,\n): Promise<void> {\n  if (drops.length === 0) return\n  await fs.mkdir(path.dirname(rejectedPath), { recursive: true })\n  const lines = drops.map((d) => JSON.stringify({ ...d, ts: new Date().toISOString() })).join('\\n') + '\\n'\n  await fs.appendFile(rejectedPath, lines, 'utf8')\n}\n\nexport function formatPrecisionFloorBanner(count: number): string {\n  if (count === 1) return `[neat] 1 extracted edge dropped below precision floor`\n  return `[neat] ${count} extracted edges dropped below precision floor`\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport ignore, { type Ignore } from 'ignore'\nimport { minimatch } from 'minimatch'\nimport type { ServiceNode } from '@neat.is/types'\nimport { NodeType, serviceId } from '@neat.is/types'\nimport type { NeatGraph } from '../graph.js'\nimport {\n  IGNORED_DIRS,\n  exists,\n  readJson,\n  type DiscoveredService,\n  type PackageJson,\n} from './shared.js'\nimport { discoverPythonService, pythonToPackage } from './python.js'\nimport { computeServiceOwner, loadCodeowners } from './owners.js'\nimport { recordExtractionError } from './errors.js'\n\nconst DEFAULT_SCAN_DEPTH = 5\n\ninterface RootPackageJson extends PackageJson {\n  workspaces?: string[] | { packages?: string[] }\n}\n\nfunction parseScanDepth(): number {\n  const raw = process.env.NEAT_SCAN_DEPTH\n  if (!raw) return DEFAULT_SCAN_DEPTH\n  const n = Number.parseInt(raw, 10)\n  return Number.isFinite(n) && n >= 0 ? n : DEFAULT_SCAN_DEPTH\n}\n\nfunction workspaceGlobs(pkg: RootPackageJson): string[] | null {\n  const ws = pkg.workspaces\n  if (!ws) return null\n  if (Array.isArray(ws)) return ws.length > 0 ? ws : null\n  if (Array.isArray(ws.packages)) return ws.packages.length > 0 ? ws.packages : null\n  return null\n}\n\nasync function loadGitignore(scanPath: string): Promise<Ignore | null> {\n  const gitignorePath = path.join(scanPath, '.gitignore')\n  if (!(await exists(gitignorePath))) return null\n  const raw = await fs.readFile(gitignorePath, 'utf8')\n  return ignore().add(raw)\n}\n\ninterface WalkOptions {\n  maxDepth: number\n  ig: Ignore | null\n}\n\nasync function walkDirs(\n  start: string,\n  scanPath: string,\n  options: WalkOptions,\n  visit: (dir: string) => Promise<void> | void,\n): Promise<void> {\n  async function recurse(current: string, depth: number): Promise<void> {\n    if (depth > options.maxDepth) return\n    const entries = await fs.readdir(current, { withFileTypes: true }).catch(() => [])\n    for (const entry of entries) {\n      if (!entry.isDirectory()) continue\n      if (IGNORED_DIRS.has(entry.name)) continue\n      const child = path.join(current, entry.name)\n      if (options.ig) {\n        const rel = path.relative(scanPath, child).split(path.sep).join('/')\n        // Trailing slash so `ignore` evaluates the entry as a directory; without\n        // it, gitignore patterns like `dist/` won't match because the lib\n        // distinguishes file vs. directory tests.\n        if (rel && options.ig.ignores(rel + '/')) continue\n      }\n      await visit(child)\n      await recurse(child, depth + 1)\n    }\n  }\n  await recurse(start, 0)\n}\n\nasync function expandWorkspaceGlobs(\n  scanPath: string,\n  globs: string[],\n): Promise<string[]> {\n  const found = new Set<string>()\n  const scanDepth = parseScanDepth()\n\n  for (const raw of globs) {\n    const pattern = raw.replace(/^\\.\\//, '')\n\n    if (!pattern.includes('*')) {\n      const candidate = path.join(scanPath, pattern)\n      if (await exists(path.join(candidate, 'package.json'))) found.add(candidate)\n      continue\n    }\n\n    const segments = pattern.split('/')\n    const staticSegments: string[] = []\n    for (const seg of segments) {\n      if (seg.includes('*')) break\n      staticSegments.push(seg)\n    }\n    const start = path.join(scanPath, ...staticSegments)\n    if (!(await exists(start))) continue\n\n    const hasDoubleStar = pattern.includes('**')\n    const walkDepth = hasDoubleStar\n      ? scanDepth\n      : Math.max(0, segments.length - staticSegments.length - 1)\n\n    await walkDirs(start, scanPath, { maxDepth: walkDepth, ig: null }, async (dir) => {\n      const rel = path.relative(scanPath, dir).split(path.sep).join('/')\n      if (minimatch(rel, pattern) && (await exists(path.join(dir, 'package.json')))) {\n        found.add(dir)\n      }\n    })\n  }\n\n  return [...found]\n}\n\nasync function discoverNodeService(\n  scanPath: string,\n  dir: string,\n): Promise<DiscoveredService | null> {\n  const pkgPath = path.join(dir, 'package.json')\n  if (!(await exists(pkgPath))) return null\n  let pkg: PackageJson\n  try {\n    pkg = await readJson<PackageJson>(pkgPath)\n  } catch (err) {\n    recordExtractionError('services', path.relative(scanPath, pkgPath), err)\n    return null\n  }\n  if (!pkg.name) return null\n  const node: ServiceNode = {\n    id: serviceId(pkg.name),\n    type: NodeType.ServiceNode,\n    name: pkg.name,\n    language: 'javascript',\n    version: pkg.version,\n    dependencies: pkg.dependencies ?? {},\n    repoPath: path.relative(scanPath, dir),\n    ...(pkg.engines?.node ? { nodeEngine: pkg.engines.node } : {}),\n  }\n  return { pkg, dir, node }\n}\n\nasync function discoverPyService(\n  scanPath: string,\n  dir: string,\n): Promise<DiscoveredService | null> {\n  const py = await discoverPythonService(dir)\n  if (!py) return null\n  const pkg = pythonToPackage(py)\n  const node: ServiceNode = {\n    id: serviceId(py.name),\n    type: NodeType.ServiceNode,\n    name: py.name,\n    language: 'python',\n    version: py.version,\n    dependencies: py.dependencies,\n    repoPath: path.relative(scanPath, dir),\n  }\n  return { pkg, dir, node }\n}\n\n// Phase 1 — discover service directories under scanPath. A service is any\n// directory containing a JS/TS manifest (`package.json`) or a Python manifest\n// (`pyproject.toml` / `requirements.txt` / `setup.py`). JS wins on tie.\n//\n// If the root `package.json` declares `workspaces`, those globs are\n// authoritative — we don't fall back to a free recursive walk. Otherwise we\n// walk recursively, depth-bounded by `NEAT_SCAN_DEPTH` (default 5), skipping\n// `IGNORED_DIRS` and anything matched by the root `.gitignore`.\n//\n// Two manifests sharing a `name` collapse to one node per ADR-010; the\n// duplicate logs a warning naming both paths.\nexport async function discoverServices(scanPath: string): Promise<DiscoveredService[]> {\n  const rootPkgPath = path.join(scanPath, 'package.json')\n  let rootPkg: RootPackageJson | null = null\n  if (await exists(rootPkgPath)) {\n    try {\n      rootPkg = await readJson<RootPackageJson>(rootPkgPath)\n    } catch (err) {\n      recordExtractionError(\n        'services workspaces',\n        path.relative(scanPath, rootPkgPath),\n        err,\n      )\n    }\n  }\n  const wsGlobs = rootPkg ? workspaceGlobs(rootPkg) : null\n\n  const candidateDirs: string[] = []\n  if (wsGlobs) {\n    candidateDirs.push(...(await expandWorkspaceGlobs(scanPath, wsGlobs)))\n  } else {\n    if (rootPkg && rootPkg.name) candidateDirs.push(scanPath)\n    const ig = await loadGitignore(scanPath)\n    await walkDirs(\n      scanPath,\n      scanPath,\n      { maxDepth: parseScanDepth(), ig },\n      async (dir) => {\n        if (await exists(path.join(dir, 'package.json'))) {\n          candidateDirs.push(dir)\n        } else if (\n          (await exists(path.join(dir, 'pyproject.toml'))) ||\n          (await exists(path.join(dir, 'requirements.txt'))) ||\n          (await exists(path.join(dir, 'setup.py')))\n        ) {\n          candidateDirs.push(dir)\n        }\n      },\n    )\n  }\n\n  candidateDirs.sort()\n\n  const seen = new Map<string, string>()\n  const out: DiscoveredService[] = []\n  for (const dir of candidateDirs) {\n    const service =\n      (await discoverNodeService(scanPath, dir)) ??\n      (await discoverPyService(scanPath, dir))\n    if (!service) continue\n\n    const existingDir = seen.get(service.node.name)\n    if (existingDir !== undefined) {\n      const a = path.relative(scanPath, existingDir) || '.'\n      const b = path.relative(scanPath, dir) || '.'\n      console.warn(\n        `[neat] duplicate package name \"${service.node.name}\" — keeping ${a}, ignoring ${b}`,\n      )\n      continue\n    }\n    seen.set(service.node.name, dir)\n    out.push(service)\n  }\n\n  // Owner extraction (ADR-054). CODEOWNERS first, package.json `author`\n  // fallback, undefined otherwise. Read once per discovery pass; the file\n  // is small and parsing it per-service would be wasteful.\n  const codeowners = await loadCodeowners(scanPath)\n  for (const service of out) {\n    const owner = await computeServiceOwner(codeowners, service.node.repoPath, service.dir)\n    if (owner !== undefined) service.node.owner = owner\n  }\n\n  return out\n}\n\nexport function addServiceNodes(graph: NeatGraph, services: DiscoveredService[]): number {\n  let nodesAdded = 0\n  for (const service of services) {\n    if (!graph.hasNode(service.node.id)) {\n      graph.addNode(service.node.id, { ...service.node, discoveredVia: 'static' })\n      nodesAdded++\n      continue\n    }\n    // OTel ingest may have auto-created a minimal node at this id. Merge per\n    // ADR-033 / identity contract: static fields override OTel-derived fields,\n    // and discoveredVia flips to 'merged' when both layers contributed.\n    const existing = graph.getNodeAttributes(service.node.id) as ServiceNode\n    const mergedDiscoveredVia: 'static' | 'otel' | 'merged' =\n      existing.discoveredVia === 'otel' ? 'merged' : 'static'\n    graph.replaceNodeAttributes(service.node.id, {\n      ...existing,\n      ...service.node,\n      discoveredVia: mergedDiscoveredVia,\n    })\n  }\n  return nodesAdded\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport { parse as parseYaml } from 'yaml'\nimport type { ServiceNode } from '@neat.is/types'\n\nexport interface PackageJson {\n  name: string\n  version?: string\n  dependencies?: Record<string, string>\n  devDependencies?: Record<string, string>\n  engines?: { node?: string }\n}\n\nexport interface DiscoveredService {\n  pkg: PackageJson\n  dir: string\n  node: ServiceNode\n}\n\nexport const SERVICE_FILE_EXTENSIONS = new Set(['.js', '.mjs', '.cjs', '.ts', '.tsx', '.py'])\nexport const CONFIG_FILE_EXTENSIONS = new Set(['.yaml', '.yml'])\nexport const IGNORED_DIRS = new Set([\n  'node_modules',\n  '.git',\n  '.turbo',\n  'dist',\n  'build',\n  '.next',\n])\n\nexport function isConfigFile(name: string): { match: boolean; fileType: string } {\n  const ext = path.extname(name)\n  if (CONFIG_FILE_EXTENSIONS.has(ext)) return { match: true, fileType: ext.slice(1) }\n  // .env, .env.local, .env.production. Bare filename or any dotted-suffix\n  // variant; folder names get filtered upstream by walking files only.\n  // ADR-065 #4 filters .env.template / .env.example / .env.sample (and the\n  // dotted-suffix variants) at the producer level — those are documentation,\n  // not runtime config.\n  if (name === '.env' || name.startsWith('.env.')) {\n    if (isEnvTemplateFile(name)) return { match: false, fileType: '' }\n    return { match: true, fileType: 'env' }\n  }\n  return { match: false, fileType: '' }\n}\n\n// ─────────────────────────────────────────────────────────────────────────\n// ADR-065 precision-filter helpers. Pre-emit gates inside the producer pass.\n// Filtered candidates are never written to the graph (idempotency intact).\n// ─────────────────────────────────────────────────────────────────────────\n\n// ADR-065 #1 — test-scope exclusion. Returns true when the file path matches\n// any test-scope pattern. Path is normalised to forward slashes before\n// matching so callers can pass either form.\n//\n// Patterns:\n//   - any segment named __tests__, __fixtures__, or integration-tests\n//   - basename matches *.spec.{ts,tsx,js,jsx,mjs,cjs,py}\n//   - basename matches *.test.{ts,tsx,js,jsx,mjs,cjs,py}\nexport function isTestPath(filePath: string): boolean {\n  const normalised = filePath.replace(/\\\\/g, '/')\n  const segments = normalised.split('/')\n  for (const seg of segments) {\n    if (seg === '__tests__' || seg === '__fixtures__' || seg === 'integration-tests') {\n      return true\n    }\n  }\n  const base = segments[segments.length - 1] ?? ''\n  return /\\.(spec|test)\\.(?:tsx?|jsx?|mjs|cjs|py)$/i.test(base)\n}\n\n// ADR-065 #4 — `.env.template` exclusion. Matches:\n//   .env.template / .env.example / .env.sample\n//   .env.*.template / .env.*.example / .env.*.sample\n// These are docs/onboarding artifacts, not runtime config. ConfigNodes are\n// bound to runtime existence (ADR-016); templates fail that test.\nexport function isEnvTemplateFile(name: string): boolean {\n  if (\n    name === '.env.template' ||\n    name === '.env.example' ||\n    name === '.env.sample'\n  ) {\n    return true\n  }\n  // `.env.*.template` / `.env.*.example` / `.env.*.sample`\n  return /^\\.env\\.[^.]+\\.(?:template|example|sample)$/i.test(name)\n}\n\n// ADR-065 #2 — comment-body exclusion. Replaces every JS/TS comment span in\n// the source with an equal-length run of spaces, preserving line/column for\n// downstream line-mapping. Strings that contain `//` sequences (URLs) are\n// preserved by tracking the string context as we scan.\n//\n// Not a full parser — good enough for the medusa-shape failures. The HTTP\n// extractor's AST walk already gets comment-awareness for free; this helper\n// is for the regex-based extractors (redis, kafka, aws, grpc).\nexport function maskCommentsInSource(src: string): string {\n  const len = src.length\n  const out: string[] = new Array(len)\n  let i = 0\n  // String context: ' \" ` (template) — open-quote char, 0 when not in a string.\n  let inString: string | 0 = 0\n  let escaped = false\n  while (i < len) {\n    const c = src[i]!\n    if (inString !== 0) {\n      out[i] = c\n      if (escaped) {\n        escaped = false\n      } else if (c === '\\\\') {\n        escaped = true\n      } else if (c === inString) {\n        inString = 0\n      }\n      i++\n      continue\n    }\n    if (c === '/' && i + 1 < len) {\n      const next = src[i + 1]!\n      if (next === '/') {\n        out[i] = ' '\n        out[i + 1] = ' '\n        let j = i + 2\n        while (j < len && src[j] !== '\\n') {\n          out[j] = ' '\n          j++\n        }\n        i = j\n        continue\n      }\n      if (next === '*') {\n        out[i] = ' '\n        out[i + 1] = ' '\n        let j = i + 2\n        while (j < len) {\n          if (src[j] === '\\n') {\n            out[j] = '\\n'\n            j++\n            continue\n          }\n          if (src[j] === '*' && j + 1 < len && src[j + 1] === '/') {\n            out[j] = ' '\n            out[j + 1] = ' '\n            j += 2\n            break\n          }\n          out[j] = ' '\n          j++\n        }\n        i = j\n        continue\n      }\n    }\n    out[i] = c\n    if (c === \"'\" || c === '\"' || c === '`') inString = c\n    i++\n  }\n  return out.join('')\n}\n\n// ADR-065 #5 — exact hostname match for cross-service URL inference. Returns\n// true if `urlString` looks like an actual URL — has an explicit `scheme://`\n// or starts with a scheme-relative `//` — and its hostname matches `host`\n// exactly (case-insensitive). No `.includes()` containment, and no bare-string\n// matching: a literal like `'admin-bundler'` would otherwise parse as\n// `http://admin-bundler` and match the basename of every service directory,\n// which is how the v0.3.3 medusa pre-check produced 279 false positives.\n//\n// Accepts a `host` that may include a port (`api.example.com:8080`); in that\n// case the URL's hostname AND port must both match.\nconst URL_LIKE = /^(?:[a-z][a-z0-9+.-]*:)?\\/\\//i\n\nexport function urlMatchesHost(urlString: string, host: string): boolean {\n  if (typeof urlString !== 'string' || urlString.length === 0) return false\n  // Require the literal to look like a URL — scheme + `://` or scheme-relative\n  // `//host`. Bare hostnames are rejected; they're the load-bearing source of\n  // false positives.\n  if (!URL_LIKE.test(urlString)) return false\n  const [wantedHost, wantedPort] = host.split(':')\n  let parsed: URL\n  try {\n    // For scheme-relative `//host/path`, prepend `http:` so URL accepts it.\n    const candidate = urlString.startsWith('//') ? `http:${urlString}` : urlString\n    parsed = new URL(candidate)\n  } catch {\n    return false\n  }\n  if (parsed.hostname.toLowerCase() !== (wantedHost ?? '').toLowerCase()) return false\n  if (wantedPort && parsed.port !== wantedPort) return false\n  return true\n}\n\n// Strip semver range prefixes (^, ~, >=, etc.) and bare \"v\" so the extracted\n// version is usable for compat checks. We don't try to resolve ranges to actual\n// installed versions — that's a published-lockfile concern, not extraction's job.\nexport function cleanVersion(raw: string | undefined): string | undefined {\n  if (!raw) return undefined\n  return raw.replace(/^[\\^~><=v\\s]+/, '').trim() || undefined\n}\n\nexport async function readJson<T>(filePath: string): Promise<T> {\n  const raw = await fs.readFile(filePath, 'utf8')\n  return JSON.parse(raw) as T\n}\n\nexport async function readYaml<T>(filePath: string): Promise<T> {\n  const raw = await fs.readFile(filePath, 'utf8')\n  return parseYaml(raw) as T\n}\n\nexport async function exists(p: string): Promise<boolean> {\n  try {\n    await fs.access(p)\n    return true\n  } catch {\n    return false\n  }\n}\n\n// Thin re-export so existing callers (calls/, configs.ts, databases/, infra/)\n// keep their import path. Wire format lives in @neat.is/types/identity.ts per\n// ADR-029.\nexport { extractedEdgeId as makeEdgeId } from '@neat.is/types'\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport { parse as parseToml } from 'smol-toml'\nimport { exists, type PackageJson } from './shared.js'\n\n// Lines like `psycopg2==2.7.0`, `psycopg2 == 2.7.0`, `psycopg2[extras]==2.7`,\n// or `psycopg2~=2.7,<3`. We capture the package name and the first version\n// that follows an `==` operator. Anything else (range, no pin, no version) is\n// recorded with an empty version — the compat matrix's semver coercer treats\n// those as \"can't reason\" and under-flags rather than over-flags.\nconst REQUIREMENT_LINE = /^\\s*([A-Za-z0-9_.-]+)(?:\\[[^\\]]*\\])?\\s*(?:(==)\\s*([A-Za-z0-9_.+-]+))?/\n\nfunction parseRequirementsTxt(content: string): Record<string, string> {\n  const out: Record<string, string> = {}\n  for (const rawLine of content.split('\\n')) {\n    const line = rawLine.split('#')[0]?.trim()\n    if (!line) continue\n    if (line.startsWith('-')) continue // -r requirements-dev.txt etc.\n    const match = REQUIREMENT_LINE.exec(line)\n    if (!match) continue\n    const name = match[1]!.toLowerCase()\n    const version = match[3] ?? ''\n    out[name] = version\n  }\n  return out\n}\n\ninterface PyProjectFile {\n  project?: {\n    name?: string\n    version?: string\n    dependencies?: string[]\n  }\n  tool?: {\n    poetry?: {\n      name?: string\n      version?: string\n      dependencies?: Record<string, string | { version?: string }>\n    }\n  }\n}\n\nfunction depsFromPyProject(pyproject: PyProjectFile): Record<string, string> {\n  const out: Record<string, string> = {}\n\n  // PEP 621 — [project] dependencies = [\"psycopg2==2.7.0\", \"requests\"]\n  for (const entry of pyproject.project?.dependencies ?? []) {\n    const match = REQUIREMENT_LINE.exec(entry)\n    if (!match) continue\n    out[match[1]!.toLowerCase()] = match[3] ?? ''\n  }\n\n  // Poetry — [tool.poetry.dependencies] psycopg2 = \"2.7.0\"\n  const poetryDeps = pyproject.tool?.poetry?.dependencies ?? {}\n  for (const [name, value] of Object.entries(poetryDeps)) {\n    if (name.toLowerCase() === 'python') continue\n    const raw = typeof value === 'string' ? value : (value?.version ?? '')\n    out[name.toLowerCase()] = raw.replace(/^[\\^~><=v\\s]+/, '')\n  }\n  return out\n}\n\nexport interface PythonService {\n  name: string\n  version?: string\n  dependencies: Record<string, string>\n}\n\n// Detect a Python service by the conventional manifest files. We try\n// pyproject.toml first because it can name the package; fallback to the\n// directory name when only requirements.txt or setup.py is present.\nexport async function discoverPythonService(serviceDir: string): Promise<PythonService | null> {\n  const pyprojectPath = path.join(serviceDir, 'pyproject.toml')\n  const requirementsPath = path.join(serviceDir, 'requirements.txt')\n  const setupPath = path.join(serviceDir, 'setup.py')\n\n  const hasPyproject = await exists(pyprojectPath)\n  const hasRequirements = await exists(requirementsPath)\n  const hasSetup = await exists(setupPath)\n  if (!hasPyproject && !hasRequirements && !hasSetup) return null\n\n  let name = path.basename(serviceDir)\n  let version: string | undefined\n  const dependencies: Record<string, string> = {}\n\n  if (hasPyproject) {\n    const raw = await fs.readFile(pyprojectPath, 'utf8')\n    const pyproject = parseToml(raw) as PyProjectFile\n    name = pyproject.project?.name ?? pyproject.tool?.poetry?.name ?? name\n    version = pyproject.project?.version ?? pyproject.tool?.poetry?.version ?? undefined\n    Object.assign(dependencies, depsFromPyProject(pyproject))\n  }\n\n  if (hasRequirements) {\n    const raw = await fs.readFile(requirementsPath, 'utf8')\n    Object.assign(dependencies, parseRequirementsTxt(raw))\n  }\n\n  return { name, version, dependencies }\n}\n\n// Build the same `pkg`-shaped shim the JS path uses so downstream phases\n// (databases, calls, etc.) can keep reading service.pkg.dependencies and\n// service.pkg.name without caring which language produced the service.\nexport function pythonToPackage(service: PythonService): PackageJson {\n  return {\n    name: service.name,\n    version: service.version,\n    dependencies: service.dependencies,\n  }\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport { minimatch } from 'minimatch'\nimport { exists, readJson } from './shared.js'\n\nexport interface CodeownersRule {\n  pattern: string\n  owners: string\n}\n\nexport interface CodeownersFile {\n  rules: CodeownersRule[]\n}\n\ninterface PackageJsonAuthor {\n  author?: string | { name?: string }\n}\n\n// Read CODEOWNERS at <scanPath>/CODEOWNERS first, then <scanPath>/.github/CODEOWNERS.\n// Returns null when neither exists. ADR-054 #2.1.\nexport async function loadCodeowners(scanPath: string): Promise<CodeownersFile | null> {\n  const candidates = [\n    path.join(scanPath, 'CODEOWNERS'),\n    path.join(scanPath, '.github', 'CODEOWNERS'),\n  ]\n  for (const file of candidates) {\n    if (await exists(file)) {\n      const raw = await fs.readFile(file, 'utf8')\n      return parseCodeowners(raw)\n    }\n  }\n  return null\n}\n\nfunction parseCodeowners(raw: string): CodeownersFile {\n  const rules: CodeownersRule[] = []\n  for (const line of raw.split('\\n')) {\n    const trimmed = line.trim()\n    if (!trimmed || trimmed.startsWith('#')) continue\n    const match = /^(\\S+)\\s+(.+)$/.exec(trimmed)\n    if (!match) continue\n    rules.push({ pattern: match[1]!, owners: match[2]!.trim() })\n  }\n  return { rules }\n}\n\n// First matching pattern wins; returns the literal RHS or null. ADR-054 #2.1.\n// Pattern matcher is minimal per ADR-054 #6 — handles `*`, `**`, and exact\n// paths; not a full gitignore-style parser.\nexport function matchOwner(file: CodeownersFile, repoPath: string): string | null {\n  const normalized = repoPath.split(path.sep).join('/')\n  for (const rule of file.rules) {\n    if (matchesPattern(rule.pattern, normalized)) return rule.owners\n  }\n  return null\n}\n\nfunction matchesPattern(rawPattern: string, repoPath: string): boolean {\n  let pattern = rawPattern.startsWith('/') ? rawPattern.slice(1) : rawPattern\n  if (pattern === '*') return !repoPath.includes('/')\n  if (pattern === '**' || pattern === '') return true\n  // Trailing slash means \"everything in this directory\".\n  if (pattern.endsWith('/')) pattern = pattern + '**'\n  if (minimatch(repoPath, pattern, { dot: true })) return true\n  // A pattern that names a directory should match files beneath it too.\n  if (!pattern.includes('*') && minimatch(repoPath, pattern + '/**', { dot: true })) return true\n  return false\n}\n\n// Read <serviceDir>/package.json and return the `author` field as a literal\n// string. Accepts either string form (\"Cem D <cem@example.com>\") or object\n// form ({ name: 'Cem D' }). Returns null when missing or unparseable.\n// ADR-054 #2.2.\nexport async function readPackageJsonAuthor(serviceDir: string): Promise<string | null> {\n  const pkgPath = path.join(serviceDir, 'package.json')\n  if (!(await exists(pkgPath))) return null\n  try {\n    const pkg = await readJson<PackageJsonAuthor>(pkgPath)\n    if (!pkg.author) return null\n    if (typeof pkg.author === 'string') return pkg.author\n    if (typeof pkg.author === 'object' && typeof pkg.author.name === 'string') return pkg.author.name\n    return null\n  } catch {\n    return null\n  }\n}\n\n// Compute owner per ADR-054 priority: CODEOWNERS first, package.json `author`\n// fallback, undefined otherwise. Literal source value, no normalization (#3).\nexport async function computeServiceOwner(\n  codeowners: CodeownersFile | null,\n  repoPath: string | undefined,\n  serviceDir: string,\n): Promise<string | undefined> {\n  if (codeowners && repoPath !== undefined) {\n    const owner = matchOwner(codeowners, repoPath)\n    if (owner) return owner\n  }\n  const author = await readPackageJsonAuthor(serviceDir)\n  return author ?? undefined\n}\n","import path from 'node:path'\nimport { promises as fs } from 'node:fs'\nimport { parseAllDocuments } from 'yaml'\nimport type { ServiceNode } from '@neat.is/types'\nimport { NodeType } from '@neat.is/types'\nimport type { NeatGraph } from '../graph.js'\nimport { recordExtractionError } from './errors.js'\nimport {\n  CONFIG_FILE_EXTENSIONS,\n  IGNORED_DIRS,\n  exists,\n  readYaml,\n  type DiscoveredService,\n} from './shared.js'\n\n// Populate ServiceNode.aliases from sources that the OTel layer is likely to\n// see in span attributes:\n//\n//   - docker-compose service names (compose-DNS).\n//   - Dockerfile LABEL values that name the service.\n//   - k8s metadata.name (and the cluster-DNS variants) for Service /\n//     Deployment / StatefulSet whose name matches a known service.\n//\n// resolveServiceId in ingest.ts checks aliases before falling back to a\n// FRONTIER placeholder; promoteFrontierNodes uses them to retire stale\n// placeholders once they map to a real service.\n\ninterface ComposeService {\n  container_name?: string\n  hostname?: string\n  networks?: string[] | Record<string, unknown>\n}\n\ninterface ComposeFile {\n  services?: Record<string, ComposeService>\n}\n\ninterface K8sDoc {\n  kind?: string\n  metadata?: {\n    name?: string\n    namespace?: string\n    labels?: Record<string, string>\n  }\n  spec?: {\n    selector?: {\n      app?: string\n      matchLabels?: Record<string, string>\n    }\n  }\n}\n\nconst K8S_KINDS_WITH_HOSTNAMES = new Set([\n  'Service',\n  'Deployment',\n  'StatefulSet',\n  'DaemonSet',\n])\n\nfunction addAliases(graph: NeatGraph, serviceId: string, candidates: Iterable<string>): void {\n  if (!graph.hasNode(serviceId)) return\n  const node = graph.getNodeAttributes(serviceId) as ServiceNode & { type?: string }\n  if (node.type !== NodeType.ServiceNode) return\n  const set = new Set(node.aliases ?? [])\n  for (const c of candidates) {\n    if (!c) continue\n    if (c === node.name) continue\n    set.add(c)\n  }\n  if (set.size === 0) return\n  const updated: ServiceNode = { ...node, aliases: [...set].sort() }\n  graph.replaceNodeAttributes(serviceId, updated)\n}\n\nfunction indexServicesByName(services: DiscoveredService[]): Map<string, string> {\n  const map = new Map<string, string>()\n  for (const s of services) {\n    map.set(s.node.name, s.node.id)\n    map.set(path.basename(s.dir), s.node.id)\n  }\n  return map\n}\n\nasync function collectComposeAliases(\n  graph: NeatGraph,\n  scanPath: string,\n  serviceIndex: Map<string, string>,\n): Promise<void> {\n  let composePath: string | null = null\n  for (const name of ['docker-compose.yml', 'docker-compose.yaml']) {\n    const abs = path.join(scanPath, name)\n    if (await exists(abs)) {\n      composePath = abs\n      break\n    }\n  }\n  if (!composePath) return\n\n  let compose: ComposeFile\n  try {\n    compose = await readYaml<ComposeFile>(composePath)\n  } catch (err) {\n    recordExtractionError(\n      'aliases compose',\n      path.relative(scanPath, composePath),\n      err,\n    )\n    return\n  }\n  if (!compose?.services) return\n\n  for (const [composeName, svc] of Object.entries(compose.services)) {\n    const serviceId = serviceIndex.get(composeName)\n    if (!serviceId) continue\n    const aliases = new Set<string>([composeName])\n    if (svc.container_name) aliases.add(svc.container_name)\n    if (svc.hostname) aliases.add(svc.hostname)\n    addAliases(graph, serviceId, aliases)\n  }\n}\n\nconst LABEL_KEYS = new Set([\n  'service',\n  'service.name',\n  'app',\n  'app.name',\n  'com.docker.compose.service',\n  'org.opencontainers.image.title',\n])\n\nfunction parseDockerfileLabels(content: string): string[] {\n  const out: string[] = []\n  // Support `LABEL key=value`, `LABEL key=\"value with spaces\"`, and the\n  // multi-pair form `LABEL k1=v1 k2=v2`. We don't try to honour line\n  // continuations — the common single-line form is enough.\n  const lineRegex = /^\\s*label\\s+(.+)$/i\n  for (const raw of content.split('\\n')) {\n    const m = lineRegex.exec(raw)\n    if (!m) continue\n    const rest = m[1]!\n    const pairRegex = /([\\w.-]+)\\s*=\\s*(\"([^\"]*)\"|'([^']*)'|([^\\s]+))/g\n    let pair: RegExpExecArray | null\n    while ((pair = pairRegex.exec(rest)) !== null) {\n      const key = pair[1]!.toLowerCase()\n      if (!LABEL_KEYS.has(key)) continue\n      const value = pair[3] ?? pair[4] ?? pair[5] ?? ''\n      if (value) out.push(value)\n    }\n  }\n  return out\n}\n\nasync function collectDockerfileAliases(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n): Promise<void> {\n  for (const service of services) {\n    const dockerfilePath = path.join(service.dir, 'Dockerfile')\n    if (!(await exists(dockerfilePath))) continue\n    let content: string\n    try {\n      content = await fs.readFile(dockerfilePath, 'utf8')\n    } catch (err) {\n      recordExtractionError('aliases dockerfile', dockerfilePath, err)\n      continue\n    }\n    const aliases = parseDockerfileLabels(content)\n    if (aliases.length > 0) addAliases(graph, service.node.id, aliases)\n  }\n}\n\nasync function walkYamlFiles(start: string, depth = 0, max = 5): Promise<string[]> {\n  if (depth > max) return []\n  const out: string[] = []\n  const entries = await fs.readdir(start, { withFileTypes: true }).catch(() => [])\n  for (const entry of entries) {\n    if (entry.isDirectory()) {\n      if (IGNORED_DIRS.has(entry.name)) continue\n      out.push(...(await walkYamlFiles(path.join(start, entry.name), depth + 1, max)))\n    } else if (entry.isFile() && CONFIG_FILE_EXTENSIONS.has(path.extname(entry.name))) {\n      out.push(path.join(start, entry.name))\n    }\n  }\n  return out\n}\n\nfunction k8sHostnames(name: string, namespace: string | undefined): string[] {\n  const ns = namespace ?? 'default'\n  return [\n    name,\n    `${name}.${ns}`,\n    `${name}.${ns}.svc`,\n    `${name}.${ns}.svc.cluster.local`,\n  ]\n}\n\nfunction k8sServiceTarget(\n  doc: K8sDoc,\n  byName: Map<string, string>,\n): string | null {\n  // For `Service` resources, the target is whatever app the spec selects, not\n  // necessarily the Service's own metadata.name. We prefer that mapping; if no\n  // selector, fall back to the metadata.name match.\n  const selector = doc.spec?.selector\n  const selectorApp = selector?.app ?? selector?.matchLabels?.app\n  if (selectorApp && byName.has(selectorApp)) return byName.get(selectorApp)!\n\n  const labelApp = doc.metadata?.labels?.app\n  if (labelApp && byName.has(labelApp)) return byName.get(labelApp)!\n\n  const metaName = doc.metadata?.name\n  if (metaName && byName.has(metaName)) return byName.get(metaName)!\n\n  return null\n}\n\nasync function collectK8sAliases(\n  graph: NeatGraph,\n  scanPath: string,\n  serviceIndex: Map<string, string>,\n): Promise<void> {\n  const files = await walkYamlFiles(scanPath)\n  for (const file of files) {\n    const content = await fs.readFile(file, 'utf8')\n    let docs: K8sDoc[]\n    try {\n      docs = parseAllDocuments(content).map((d) => d.toJSON() as K8sDoc)\n    } catch {\n      continue\n    }\n    for (const doc of docs) {\n      if (!doc?.kind || !doc.metadata?.name) continue\n      if (!K8S_KINDS_WITH_HOSTNAMES.has(doc.kind)) continue\n      const target = k8sServiceTarget(doc, serviceIndex)\n      if (!target) continue\n      addAliases(graph, target, k8sHostnames(doc.metadata.name, doc.metadata.namespace))\n    }\n  }\n}\n\nexport async function addServiceAliases(\n  graph: NeatGraph,\n  scanPath: string,\n  services: DiscoveredService[],\n): Promise<void> {\n  const byName = indexServicesByName(services)\n  await collectComposeAliases(graph, scanPath, byName)\n  await collectDockerfileAliases(graph, services)\n  await collectK8sAliases(graph, scanPath, byName)\n}\n","import path from 'node:path'\nimport type {\n  CompatibleDriver,\n  DatabaseNode,\n  GraphEdge,\n  GraphNode,\n  ServiceNode,\n} from '@neat.is/types'\nimport {\n  EdgeType,\n  NodeType,\n  Provenance,\n  databaseId,\n  confidenceForExtracted,\n} from '@neat.is/types'\nimport type { NeatGraph } from '../../graph.js'\nimport {\n  checkCompatibility,\n  checkDeprecatedApi,\n  checkNodeEngineConstraint,\n  checkPackageConflict,\n  compatPairs,\n  deprecatedApis,\n  nodeEngineConstraints,\n  packageConflicts,\n} from '../../compat.js'\nimport { cleanVersion, makeEdgeId, type DiscoveredService } from '../shared.js'\nimport { dbConfigYamlParser } from './db-config-yaml.js'\nimport { dotenvParser } from './dotenv.js'\nimport { prismaParser } from './prisma.js'\nimport { drizzleParser } from './drizzle.js'\nimport { knexParser } from './knex.js'\nimport { ormconfigParser } from './ormconfig.js'\nimport { typeormParser } from './typeorm.js'\nimport { sequelizeParser } from './sequelize.js'\nimport { dockerComposeParser } from './docker-compose.js'\nimport type { DbConfig } from './shared.js'\n\nexport type { DbConfig } from './shared.js'\n\nexport interface DbParser {\n  name: string\n  parse(serviceDir: string): Promise<DbConfig[]>\n}\n\n// Registry — order is for tie-breaking only (first wins on identical host).\n// db-config.yaml stays first so the canonical demo behaviour matches today's\n// extraction byte-for-byte.\nexport const DB_PARSERS: DbParser[] = [\n  dbConfigYamlParser,\n  dotenvParser,\n  prismaParser,\n  drizzleParser,\n  knexParser,\n  ormconfigParser,\n  typeormParser,\n  sequelizeParser,\n  dockerComposeParser,\n]\n\nfunction compatibleDriversFor(engine: string): CompatibleDriver[] {\n  return compatPairs()\n    .filter((p) => p.engine === engine)\n    .map((p) => ({ name: p.driver, minVersion: p.minDriverVersion }))\n}\n\nfunction toDatabaseNode(config: DbConfig): DatabaseNode {\n  return {\n    id: databaseId(config.host),\n    type: NodeType.DatabaseNode,\n    name: config.database || config.host,\n    engine: config.engine,\n    engineVersion: config.engineVersion,\n    compatibleDrivers: compatibleDriversFor(config.engine),\n    host: config.host,\n    port: config.port,\n  }\n}\n\nexport function attachIncompatibilities(\n  service: DiscoveredService,\n  configs: DbConfig[],\n): void {\n  const deps = { ...(service.pkg.dependencies ?? {}), ...(service.pkg.devDependencies ?? {}) }\n  const incompatibilities: NonNullable<ServiceNode['incompatibilities']> = []\n  const seen = new Set<string>()\n\n  // 1. driver-engine — original behaviour. Per (db config, configured driver\n  // pair) check that the declared driver version meets the engine threshold.\n  for (const config of configs) {\n    for (const pair of compatPairs()) {\n      if (pair.engine !== config.engine) continue\n      const declaredVersion = cleanVersion(deps[pair.driver])\n      if (!declaredVersion) continue\n      const result = checkCompatibility(\n        pair.driver,\n        declaredVersion,\n        config.engine,\n        config.engineVersion,\n      )\n      if (!result.compatible && result.reason) {\n        const key = `driver-engine|${pair.driver}@${declaredVersion}|${config.engine}@${config.engineVersion}`\n        if (seen.has(key)) continue\n        seen.add(key)\n        incompatibilities.push({\n          kind: 'driver-engine',\n          driver: pair.driver,\n          driverVersion: declaredVersion,\n          engine: config.engine,\n          engineVersion: config.engineVersion,\n          reason: result.reason,\n        })\n      }\n    }\n  }\n\n  // 2. node-engine — service's `engines.node` vs each declared dep that has a\n  // matrix-recorded minimum.\n  const serviceNodeEngine = service.node.nodeEngine ?? service.pkg.engines?.node\n  for (const constraint of nodeEngineConstraints()) {\n    const declared = cleanVersion(deps[constraint.package])\n    if (!declared) continue\n    const result = checkNodeEngineConstraint(constraint, declared, serviceNodeEngine)\n    if (!result.compatible && result.reason) {\n      const key = `node-engine|${constraint.package}@${declared}|${serviceNodeEngine ?? ''}`\n      if (seen.has(key)) continue\n      seen.add(key)\n      incompatibilities.push({\n        kind: 'node-engine',\n        package: constraint.package,\n        packageVersion: declared,\n        requiredNodeVersion: result.requiredNodeVersion ?? constraint.minNodeVersion,\n        ...(serviceNodeEngine ? { declaredNodeEngine: serviceNodeEngine } : {}),\n        reason: result.reason,\n      })\n    }\n  }\n\n  // 3. package-conflict — pair like react-query 5+ requiring react 18+.\n  for (const conflict of packageConflicts()) {\n    const declared = cleanVersion(deps[conflict.package])\n    if (!declared) continue\n    const requiredVersion = cleanVersion(deps[conflict.requires.name])\n    const result = checkPackageConflict(conflict, declared, requiredVersion)\n    if (!result.compatible && result.reason) {\n      const key = `package-conflict|${conflict.package}@${declared}|${conflict.requires.name}@${requiredVersion ?? 'missing'}`\n      if (seen.has(key)) continue\n      seen.add(key)\n      incompatibilities.push({\n        kind: 'package-conflict',\n        package: conflict.package,\n        packageVersion: declared,\n        requires: conflict.requires,\n        ...(requiredVersion ? { foundVersion: requiredVersion } : {}),\n        reason: result.reason,\n      })\n    }\n  }\n\n  // 4. deprecated-api — flag presence of a known-deprecated package.\n  for (const rule of deprecatedApis()) {\n    const declared = cleanVersion(deps[rule.package])\n    if (declared === undefined) continue\n    const result = checkDeprecatedApi(rule, declared)\n    if (!result.compatible && result.reason) {\n      const key = `deprecated-api|${rule.package}@${declared}`\n      if (seen.has(key)) continue\n      seen.add(key)\n      incompatibilities.push({\n        kind: 'deprecated-api',\n        package: rule.package,\n        packageVersion: declared,\n        reason: result.reason,\n      })\n    }\n  }\n\n  if (incompatibilities.length > 0) service.node.incompatibilities = incompatibilities\n}\n\n// Phase 2 — for each service, run every parser and merge their DbConfigs by\n// host. Each unique host produces one DatabaseNode + CONNECTS_TO edge from the\n// service. The parser registry decides priority on tie; the demo's\n// db-config.yaml stays first so its `engineVersion: 15` continues to win.\nexport async function addDatabasesAndCompat(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n  scanPath: string,\n): Promise<{ nodesAdded: number; edgesAdded: number }> {\n  let nodesAdded = 0\n  let edgesAdded = 0\n\n  for (const service of services) {\n    const merged = new Map<string, DbConfig>()\n    for (const parser of DB_PARSERS) {\n      let configs: DbConfig[]\n      try {\n        configs = await parser.parse(service.dir)\n      } catch (err) {\n        console.warn(\n          `[neat] ${parser.name} parser failed on ${service.node.name}: ${(err as Error).message}`,\n        )\n        continue\n      }\n      for (const config of configs) {\n        if (!config.host) continue\n        if (!merged.has(config.host)) merged.set(config.host, config)\n      }\n    }\n\n    const allConfigs = [...merged.values()]\n    for (const config of allConfigs) {\n      const dbNode = toDatabaseNode(config)\n      if (!graph.hasNode(dbNode.id)) {\n        graph.addNode(dbNode.id, { ...dbNode, discoveredVia: 'static' })\n        nodesAdded++\n      } else {\n        // OTel ingest may have auto-created a minimal node at this id. Merge\n        // per ADR-033: static fields override OTel-derived fields, discoveredVia\n        // flips to 'merged' when both layers contributed.\n        const existing = graph.getNodeAttributes(dbNode.id) as DatabaseNode\n        const mergedDiscoveredVia: 'static' | 'otel' | 'merged' =\n          existing.discoveredVia === 'otel' ? 'merged' : 'static'\n        graph.replaceNodeAttributes(dbNode.id, {\n          ...existing,\n          ...dbNode,\n          discoveredVia: mergedDiscoveredVia,\n        })\n      }\n      // DB connection from a parsed config file is a direct AST/file fact —\n      // structural tier per ADR-066.\n      const edge: GraphEdge = {\n        id: makeEdgeId(service.node.id, dbNode.id, EdgeType.CONNECTS_TO),\n        source: service.node.id,\n        target: dbNode.id,\n        type: EdgeType.CONNECTS_TO,\n        provenance: Provenance.EXTRACTED,\n        confidence: confidenceForExtracted('structural'),\n        // ADR-032 / #140 — every EXTRACTED edge carries evidence.file.\n        // Ghost-edge cleanup keys retirement on this; the conditional\n        // sourceFile spread that used to live here was a v0.1.x leftover.\n        evidence: {\n          file: path.relative(scanPath, config.sourceFile).split(path.sep).join('/'),\n        },\n      }\n      if (!graph.hasEdge(edge.id)) {\n        graph.addEdgeWithKey(edge.id, edge.source, edge.target, edge)\n        edgesAdded++\n      }\n    }\n\n    // Run all kinds of incompat checks even for services with no db connection\n    // — node-engine / package-conflict / deprecated-api don't depend on db.\n    attachIncompatibilities(service, allConfigs)\n    if (graph.hasNode(service.node.id)) {\n      // Merge with whatever's on the node already (aliases from γ #75 land\n      // before this phase), so the writeback doesn't drop fields populated by\n      // earlier passes.\n      const current = graph.getNodeAttributes(service.node.id) as ServiceNode\n      const updated: ServiceNode = {\n        ...current,\n        ...(service.node as ServiceNode),\n        ...(current.aliases ? { aliases: current.aliases } : {}),\n      }\n      // attachIncompatibilities only sets the field when there's something to\n      // flag. On a re-extract (`neat watch`, `POST /graph/scan`), a stale\n      // entry on `current` would otherwise survive the spread and leave the\n      // graph reporting a problem the new manifest no longer has.\n      if (!service.node.incompatibilities || service.node.incompatibilities.length === 0) {\n        delete (updated as { incompatibilities?: unknown }).incompatibilities\n      }\n      graph.replaceNodeAttributes(service.node.id, updated as unknown as GraphNode)\n    }\n  }\n\n  return { nodesAdded, edgesAdded }\n}\n","import path from 'node:path'\nimport { exists, readYaml } from '../shared.js'\nimport type { DbConfig } from './shared.js'\n\ninterface DbConfigYaml {\n  host: string\n  port?: number\n  database: string\n  engine: string\n  engineVersion?: string | number\n}\n\n// The original db-config.yaml format, kept as a parser so the demo continues\n// to work. Engine + version are explicit here, so this is the one source that\n// can produce a real engineVersion without inference.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const yamlPath = path.join(serviceDir, 'db-config.yaml')\n  if (!(await exists(yamlPath))) return []\n  const raw = await readYaml<DbConfigYaml>(yamlPath)\n  return [\n    {\n      host: raw.host,\n      port: raw.port,\n      database: raw.database,\n      engine: raw.engine,\n      engineVersion: raw.engineVersion !== undefined ? String(raw.engineVersion) : 'unknown',\n      sourceFile: yamlPath,\n    },\n  ]\n}\n\nexport const dbConfigYamlParser = { name: 'db-config.yaml', parse }\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport { isConfigFile } from '../shared.js'\nimport { parseConnectionString, type DbConfig } from './shared.js'\n\nconst CONNECTION_KEYS = new Set([\n  'DATABASE_URL',\n  'DB_URL',\n  'POSTGRES_URL',\n  'POSTGRESQL_URL',\n  'MYSQL_URL',\n  'MONGODB_URI',\n  'MONGO_URL',\n  'MONGO_URI',\n  'REDIS_URL',\n])\n\n// Per ADR-016, .env contents do not land in any snapshot. We read them here\n// only to derive a transient DbConfig — the value never reaches a ConfigNode.\nfunction parseDotenvLine(line: string): { key: string; value: string } | null {\n  const trimmed = line.trim()\n  if (!trimmed || trimmed.startsWith('#')) return null\n  const eq = trimmed.indexOf('=')\n  if (eq < 0) return null\n  const key = trimmed.slice(0, eq).trim()\n  let value = trimmed.slice(eq + 1).trim()\n  if (\n    (value.startsWith('\"') && value.endsWith('\"')) ||\n    (value.startsWith(\"'\") && value.endsWith(\"'\"))\n  ) {\n    value = value.slice(1, -1)\n  }\n  return { key, value }\n}\n\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const entries = await fs.readdir(serviceDir, { withFileTypes: true }).catch(() => [])\n  const configs: DbConfig[] = []\n  const seen = new Set<string>()\n\n  for (const entry of entries) {\n    if (!entry.isFile()) continue\n    const match = isConfigFile(entry.name)\n    if (!match.match || match.fileType !== 'env') continue\n\n    const filePath = path.join(serviceDir, entry.name)\n    const content = await fs.readFile(filePath, 'utf8')\n    for (const line of content.split('\\n')) {\n      const parsed = parseDotenvLine(line)\n      if (!parsed) continue\n      if (!CONNECTION_KEYS.has(parsed.key.toUpperCase())) continue\n      const config = parseConnectionString(parsed.value)\n      if (!config) continue\n      const key = `${config.engine}://${config.host}:${config.port ?? ''}/${config.database}`\n      if (seen.has(key)) continue\n      seen.add(key)\n      configs.push({ ...config, sourceFile: filePath })\n    }\n  }\n  return configs\n}\n\nexport const dotenvParser = { name: '.env', parse }\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\n\nexport interface DbConfig {\n  host: string\n  port?: number\n  database: string\n  engine: string\n  engineVersion: string // \"unknown\" when not statically determinable\n  // Absolute path to the file the parser read this config from. Required —\n  // ghost-edge cleanup keys CONNECTS_TO retirement on `evidence.file` per\n  // ADR-032 / #140. Parsers that synthesize a DbConfig from a partial\n  // source still set this to the file the partial came from.\n  sourceFile: string\n}\n\n// Map a connection-string scheme to the engine name our compat matrix uses.\n// Schemes like \"postgres+asyncpg\" are normalised by stripping the dialect\n// suffix; anything we don't recognise returns null so the parser can decline.\nexport function schemeToEngine(scheme: string): string | null {\n  const s = scheme.toLowerCase().split('+')[0]\n  switch (s) {\n    case 'postgres':\n    case 'postgresql':\n      return 'postgresql'\n    case 'mysql':\n    case 'mariadb':\n      return 'mysql'\n    case 'mongodb':\n    case 'mongodb+srv':\n      return 'mongodb'\n    case 'redis':\n    case 'rediss':\n      return 'redis'\n    case 'sqlite':\n      return 'sqlite'\n    default:\n      return null\n  }\n}\n\n// Returns the inner DbConfig fields without sourceFile — every caller spreads\n// the parser's own file path on top. Type makes that contract explicit.\nexport type ParsedConnectionConfig = Omit<DbConfig, 'sourceFile'>\n\nexport function parseConnectionString(url: string): ParsedConnectionConfig | null {\n  const m = url.match(\n    /^(?<scheme>[a-z][a-z+]*):\\/\\/(?:[^@/]+(?::[^@]*)?@)?(?<host>[^:/?]+)(?::(?<port>\\d+))?(?:\\/(?<db>[^?#]*))?/i,\n  )\n  if (!m || !m.groups) return null\n  const engine = schemeToEngine(m.groups.scheme!)\n  if (!engine) return null\n  return {\n    host: m.groups.host!,\n    port: m.groups.port ? Number(m.groups.port) : undefined,\n    database: m.groups.db ?? '',\n    engine,\n    engineVersion: 'unknown',\n  }\n}\n\nexport async function readIfExists(filePath: string): Promise<string | null> {\n  try {\n    return await fs.readFile(filePath, 'utf8')\n  } catch {\n    return null\n  }\n}\n\nexport async function findFirst(\n  serviceDir: string,\n  candidates: string[],\n): Promise<string | null> {\n  for (const rel of candidates) {\n    const abs = path.join(serviceDir, rel)\n    const content = await readIfExists(abs)\n    if (content !== null) return abs\n  }\n  return null\n}\n\n// Engine name from a docker-compose `image:` value like \"postgres:15-alpine\"\n// or \"mysql/mysql-server:8.0\". Returns the engine + version when both are\n// resolvable, or null if the image isn't one we recognise.\nexport function engineFromImage(\n  image: string,\n): { engine: string; engineVersion: string } | null {\n  const lower = image.toLowerCase()\n  const colon = lower.lastIndexOf(':')\n  const repo = colon >= 0 ? lower.slice(0, colon) : lower\n  const tag = colon >= 0 ? lower.slice(colon + 1) : 'latest'\n  const last = repo.split('/').pop() ?? repo\n  let engine: string | null = null\n  if (last.startsWith('postgres')) engine = 'postgresql'\n  else if (last.startsWith('mysql') || last.startsWith('mariadb')) engine = 'mysql'\n  else if (last.startsWith('mongo')) engine = 'mongodb'\n  else if (last.startsWith('redis')) engine = 'redis'\n  else if (last.startsWith('sqlite')) engine = 'sqlite'\n  if (!engine) return null\n  // Strip everything after the major version digit run; \"15-alpine\" -> \"15\".\n  const versionMatch = tag.match(/^(\\d+(?:\\.\\d+){0,2})/)\n  return {\n    engine,\n    engineVersion: versionMatch ? versionMatch[1]! : 'unknown',\n  }\n}\n","import path from 'node:path'\nimport { readIfExists, parseConnectionString, schemeToEngine, type DbConfig } from './shared.js'\n\n// Prisma's schema file declares datasources of the form:\n//\n//   datasource db {\n//     provider = \"postgresql\"\n//     url      = env(\"DATABASE_URL\")\n//   }\n//\n// We match the provider directly. URLs come in via env() so we can't resolve\n// them statically; host/database fall back to placeholders so the DatabaseNode\n// id remains deterministic per service.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const schemaPath = path.join(serviceDir, 'prisma', 'schema.prisma')\n  const content = await readIfExists(schemaPath)\n  if (!content) return []\n\n  const block = content.match(/datasource\\s+\\w+\\s*\\{([^}]*)\\}/s)\n  if (!block) return []\n  const body = block[1] ?? ''\n\n  const providerMatch = body.match(/provider\\s*=\\s*\"([^\"]+)\"/)\n  if (!providerMatch) return []\n  const engine = schemeToEngine(providerMatch[1]!)\n  if (!engine) return []\n\n  const urlMatch = body.match(/url\\s*=\\s*\"([^\"]+)\"/)\n  if (urlMatch) {\n    const config = parseConnectionString(urlMatch[1]!)\n    if (config) return [{ ...config, sourceFile: schemaPath }]\n  }\n\n  return [\n    {\n      host: `${engine}-prisma`,\n      database: '',\n      engine,\n      engineVersion: 'unknown',\n      sourceFile: schemaPath,\n    },\n  ]\n}\n\nexport const prismaParser = { name: 'prisma', parse }\n","import { findFirst, readIfExists, parseConnectionString, schemeToEngine, type DbConfig } from './shared.js'\n\nconst DIALECT_TO_ENGINE: Record<string, string> = {\n  postgresql: 'postgresql',\n  postgres: 'postgresql',\n  pg: 'postgresql',\n  mysql: 'mysql',\n  mysql2: 'mysql',\n  sqlite: 'sqlite',\n  'better-sqlite': 'sqlite',\n}\n\n// Drizzle's drizzle.config.{ts,js,mjs} declares a `dialect` plus credentials.\n// We can't safely eval the file, but the relevant bits are simple key/value\n// expressions — regex-extracted to stay sandbox-clean and dep-free.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const filePath = await findFirst(serviceDir, [\n    'drizzle.config.ts',\n    'drizzle.config.js',\n    'drizzle.config.mjs',\n  ])\n  if (!filePath) return []\n  const content = await readIfExists(filePath)\n  if (!content) return []\n\n  const dialectMatch = content.match(/dialect\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)\n  if (!dialectMatch) return []\n  const engine =\n    DIALECT_TO_ENGINE[dialectMatch[1]!.toLowerCase()] ?? schemeToEngine(dialectMatch[1]!)\n  if (!engine) return []\n\n  const urlMatch = content.match(\n    /(?:url|connectionString)\\s*:\\s*['\"`]([a-z][a-z+]*:\\/\\/[^'\"`]+)['\"`]/i,\n  )\n  if (urlMatch) {\n    const config = parseConnectionString(urlMatch[1]!)\n    if (config) return [{ ...config, sourceFile: filePath }]\n  }\n  const hostMatch = content.match(/host\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)\n  if (hostMatch) {\n    const portMatch = content.match(/port\\s*:\\s*(\\d+)/)\n    const dbMatch = content.match(/database\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)\n    return [\n      {\n        host: hostMatch[1]!,\n        port: portMatch ? Number(portMatch[1]) : undefined,\n        database: dbMatch?.[1] ?? '',\n        engine,\n        engineVersion: 'unknown',\n        sourceFile: filePath,\n      },\n    ]\n  }\n  return [\n    { host: `${engine}-drizzle`, database: '', engine, engineVersion: 'unknown', sourceFile: filePath },\n  ]\n}\n\nexport const drizzleParser = { name: 'drizzle', parse }\n","import { findFirst, readIfExists, parseConnectionString, type DbConfig } from './shared.js'\n\nconst CLIENT_TO_ENGINE: Record<string, string> = {\n  pg: 'postgresql',\n  postgres: 'postgresql',\n  postgresql: 'postgresql',\n  mysql: 'mysql',\n  mysql2: 'mysql',\n  sqlite3: 'sqlite',\n  'better-sqlite3': 'sqlite',\n}\n\n// knexfile.{js,ts} declares a client (one of pg/mysql/sqlite/...) plus a\n// connection string or host/port object. We pick whichever shape is in the\n// file and ignore environment-driven values we can't resolve statically.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const filePath = await findFirst(serviceDir, [\n    'knexfile.js',\n    'knexfile.ts',\n    'knexfile.cjs',\n    'knexfile.mjs',\n  ])\n  if (!filePath) return []\n  const content = await readIfExists(filePath)\n  if (!content) return []\n\n  const clientMatch = content.match(/client\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)\n  if (!clientMatch) return []\n  const engine = CLIENT_TO_ENGINE[clientMatch[1]!.toLowerCase()]\n  if (!engine) return []\n\n  const urlMatch = content.match(\n    /connection\\s*:\\s*['\"`]([a-z][a-z+]*:\\/\\/[^'\"`]+)['\"`]/i,\n  )\n  if (urlMatch) {\n    const config = parseConnectionString(urlMatch[1]!)\n    if (config) return [{ ...config, sourceFile: filePath }]\n  }\n\n  const host = content.match(/host\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)?.[1]\n  if (host) {\n    const port = content.match(/port\\s*:\\s*(\\d+)/)?.[1]\n    const database = content.match(/database\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)?.[1] ?? ''\n    return [\n      {\n        host,\n        port: port ? Number(port) : undefined,\n        database,\n        engine,\n        engineVersion: 'unknown',\n        sourceFile: filePath,\n      },\n    ]\n  }\n\n  return [{ host: `${engine}-knex`, database: '', engine, engineVersion: 'unknown', sourceFile: filePath }]\n}\n\nexport const knexParser = { name: 'knex', parse }\n","import path from 'node:path'\nimport { exists, readJson, readYaml } from '../shared.js'\nimport { schemeToEngine, type DbConfig } from './shared.js'\n\ninterface OrmConfigEntry {\n  type?: string\n  host?: string\n  port?: number\n  database?: string\n}\n\n// ormconfig.{json,yaml,yml} — TypeORM's legacy config file. Single object or\n// an array of named connections; we walk both.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  for (const candidate of ['ormconfig.json', 'ormconfig.yaml', 'ormconfig.yml']) {\n    const abs = path.join(serviceDir, candidate)\n    if (!(await exists(abs))) continue\n    const raw = candidate.endsWith('.json')\n      ? await readJson<OrmConfigEntry | OrmConfigEntry[]>(abs)\n      : await readYaml<OrmConfigEntry | OrmConfigEntry[]>(abs)\n    const entries = Array.isArray(raw) ? raw : [raw]\n\n    const out: DbConfig[] = []\n    for (const entry of entries) {\n      if (!entry?.type || !entry.host) continue\n      const engine = schemeToEngine(entry.type)\n      if (!engine) continue\n      out.push({\n        host: entry.host,\n        port: entry.port,\n        database: entry.database ?? '',\n        engine,\n        engineVersion: 'unknown',\n        sourceFile: abs,\n      })\n    }\n    if (out.length > 0) return out\n  }\n  return []\n}\n\nexport const ormconfigParser = { name: 'ormconfig', parse }\n","import { findFirst, readIfExists, schemeToEngine, type DbConfig } from './shared.js'\n\n// TypeORM's modern shape: `new DataSource({ type: 'postgres', host, port, ... })`\n// in a data-source.ts (or .js). We regex for the type/host/port/database keys\n// in the first DataSource literal we find.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const filePath = await findFirst(serviceDir, [\n    'data-source.ts',\n    'data-source.js',\n    'src/data-source.ts',\n    'src/data-source.js',\n  ])\n  if (!filePath) return []\n  const content = await readIfExists(filePath)\n  if (!content) return []\n\n  const block = content.match(/new\\s+DataSource\\s*\\(\\s*\\{([\\s\\S]*?)\\}\\s*\\)/)\n  const body = block ? block[1]! : content\n\n  const typeMatch = body.match(/type\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)\n  const host = body.match(/host\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)?.[1]\n  if (!typeMatch || !host) return []\n\n  const engine = schemeToEngine(typeMatch[1]!)\n  if (!engine) return []\n\n  const port = body.match(/port\\s*:\\s*(\\d+)/)?.[1]\n  const database = body.match(/database\\s*:\\s*['\"`]([^'\"`]+)['\"`]/)?.[1] ?? ''\n\n  return [\n    {\n      host,\n      port: port ? Number(port) : undefined,\n      database,\n      engine,\n      engineVersion: 'unknown',\n      sourceFile: filePath,\n    },\n  ]\n}\n\nexport const typeormParser = { name: 'typeorm', parse }\n","import path from 'node:path'\nimport { exists, readJson } from '../shared.js'\nimport { schemeToEngine, type DbConfig } from './shared.js'\n\ninterface SequelizeConfigEntry {\n  dialect?: string\n  host?: string\n  port?: number\n  database?: string\n}\n\ntype SequelizeConfig = Record<string, SequelizeConfigEntry>\n\n// Sequelize stores per-environment configs under config/config.json. We read\n// every named environment so a service that declares production + staging\n// surfaces both DB targets.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  const configPath = path.join(serviceDir, 'config', 'config.json')\n  if (!(await exists(configPath))) return []\n  const raw = await readJson<SequelizeConfig>(configPath)\n\n  const out: DbConfig[] = []\n  const seen = new Set<string>()\n  for (const entry of Object.values(raw)) {\n    if (!entry?.dialect || !entry.host) continue\n    const engine = schemeToEngine(entry.dialect)\n    if (!engine) continue\n    const key = `${engine}://${entry.host}:${entry.port ?? ''}/${entry.database ?? ''}`\n    if (seen.has(key)) continue\n    seen.add(key)\n    out.push({\n      host: entry.host,\n      port: entry.port,\n      database: entry.database ?? '',\n      engine,\n      engineVersion: 'unknown',\n      sourceFile: configPath,\n    })\n  }\n  return out\n}\n\nexport const sequelizeParser = { name: 'sequelize', parse }\n","import path from 'node:path'\nimport { exists, readYaml } from '../shared.js'\nimport { engineFromImage, type DbConfig } from './shared.js'\n\ninterface ComposeService {\n  image?: string\n  ports?: (string | number)[]\n  environment?: Record<string, string> | string[]\n}\n\ninterface ComposeFile {\n  services?: Record<string, ComposeService>\n}\n\nfunction portFromService(svc: ComposeService): number | undefined {\n  for (const raw of svc.ports ?? []) {\n    const str = String(raw)\n    // \"5432:5432\", \"5432\", or \"host:5432\" → take the trailing port.\n    const last = str.split(':').pop()\n    const n = Number(last)\n    if (Number.isFinite(n) && n > 0) return n\n  }\n  return undefined\n}\n\nfunction databaseFromEnv(svc: ComposeService): string {\n  const env = svc.environment\n  const get = (key: string): string | undefined => {\n    if (!env) return undefined\n    if (Array.isArray(env)) {\n      for (const line of env) {\n        const [k, v] = line.split('=')\n        if (k === key) return v\n      }\n      return undefined\n    }\n    return env[key]\n  }\n  return get('POSTGRES_DB') ?? get('MYSQL_DATABASE') ?? get('MONGO_INITDB_DATABASE') ?? ''\n}\n\n// Service-local docker-compose.yml — every service whose image we recognise\n// becomes a candidate DB. The compose service name doubles as the host since\n// that's how peer services on the same compose network reach it.\nexport async function parse(serviceDir: string): Promise<DbConfig[]> {\n  for (const name of ['docker-compose.yml', 'docker-compose.yaml']) {\n    const abs = path.join(serviceDir, name)\n    if (!(await exists(abs))) continue\n    const raw = await readYaml<ComposeFile>(abs)\n    if (!raw?.services) return []\n\n    const out: DbConfig[] = []\n    for (const [serviceName, svc] of Object.entries(raw.services)) {\n      if (!svc.image) continue\n      const meta = engineFromImage(svc.image)\n      if (!meta) continue\n      out.push({\n        host: serviceName,\n        port: portFromService(svc),\n        database: databaseFromEnv(svc),\n        engine: meta.engine,\n        engineVersion: meta.engineVersion,\n        sourceFile: abs,\n      })\n    }\n    return out\n  }\n  return []\n}\n\nexport const dockerComposeParser = { name: 'docker-compose', parse }\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport type { ConfigNode, GraphEdge } from '@neat.is/types'\nimport {\n  EdgeType,\n  NodeType,\n  Provenance,\n  configId,\n  confidenceForExtracted,\n} from '@neat.is/types'\nimport type { NeatGraph } from '../graph.js'\nimport { IGNORED_DIRS, isConfigFile, makeEdgeId, type DiscoveredService } from './shared.js'\n\n// Walk a service directory and collect every config file path\n// (yaml/yml + .env-shaped). We deliberately stop at file paths here so nothing\n// in this module reads file contents — .env files routinely carry secrets\n// (ADR-016).\nexport async function walkConfigFiles(dir: string): Promise<string[]> {\n  const out: string[] = []\n  async function walk(current: string): Promise<void> {\n    const entries = await fs.readdir(current, { withFileTypes: true })\n    for (const entry of entries) {\n      const full = path.join(current, entry.name)\n      if (entry.isDirectory()) {\n        if (!IGNORED_DIRS.has(entry.name)) await walk(full)\n      } else if (entry.isFile() && isConfigFile(entry.name).match) {\n        out.push(full)\n      }\n    }\n  }\n  await walk(dir)\n  return out\n}\n\n// Phase 3 — turn each config file into a ConfigNode with a CONFIGURED_BY edge\n// from its owning service.\nexport async function addConfigNodes(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n  scanPath: string,\n): Promise<{ nodesAdded: number; edgesAdded: number }> {\n  let nodesAdded = 0\n  let edgesAdded = 0\n  for (const service of services) {\n    const configFiles = await walkConfigFiles(service.dir)\n    for (const file of configFiles) {\n      const relPath = path.relative(scanPath, file)\n      const node: ConfigNode = {\n        id: configId(relPath),\n        type: NodeType.ConfigNode,\n        name: path.basename(file),\n        path: relPath,\n        fileType: isConfigFile(path.basename(file)).fileType,\n      }\n      if (!graph.hasNode(node.id)) {\n        graph.addNode(node.id, node)\n        nodesAdded++\n      }\n      // ConfigNode existence is a direct file fact (ADR-016) — graded at the\n      // structural tier per ADR-066.\n      const edge: GraphEdge = {\n        id: makeEdgeId(service.node.id, node.id, EdgeType.CONFIGURED_BY),\n        source: service.node.id,\n        target: node.id,\n        type: EdgeType.CONFIGURED_BY,\n        provenance: Provenance.EXTRACTED,\n        confidence: confidenceForExtracted('structural'),\n        evidence: { file: relPath.split(path.sep).join('/') },\n      }\n      if (!graph.hasEdge(edge.id)) {\n        graph.addEdgeWithKey(edge.id, edge.source, edge.target, edge)\n        edgesAdded++\n      }\n    }\n  }\n  return { nodesAdded, edgesAdded }\n}\n","import type { GraphEdge, InfraNode } from '@neat.is/types'\nimport {\n  EdgeType,\n  NodeType,\n  Provenance,\n  confidenceForExtracted,\n  passesExtractedFloor,\n} from '@neat.is/types'\nimport { noteExtractedDropped } from '../errors.js'\nimport type { NeatGraph } from '../../graph.js'\nimport {\n  isTestPath,\n  makeEdgeId,\n  maskCommentsInSource,\n  type DiscoveredService,\n} from '../shared.js'\nimport { addHttpCallEdges } from './http.js'\nimport { loadSourceFiles, type ExternalEndpoint } from './shared.js'\nimport { kafkaEndpointsFromFile } from './kafka.js'\nimport { redisEndpointsFromFile } from './redis.js'\nimport { awsEndpointsFromFile } from './aws.js'\nimport { grpcEndpointsFromFile } from './grpc.js'\n\nexport interface CallExtractResult {\n  nodesAdded: number\n  edgesAdded: number\n}\n\nfunction edgeTypeFromEndpoint(ep: ExternalEndpoint): (typeof EdgeType)[keyof typeof EdgeType] {\n  switch (ep.edgeType) {\n    case 'PUBLISHES_TO':\n      return EdgeType.PUBLISHES_TO\n    case 'CONSUMES_FROM':\n      return EdgeType.CONSUMES_FROM\n    default:\n      return EdgeType.CALLS\n  }\n}\n\nfunction isAwsKind(kind: string): boolean {\n  return (\n    kind.startsWith('aws-') ||\n    kind.startsWith('s3') ||\n    kind.startsWith('dynamodb')\n  )\n}\n\nasync function addExternalEndpointEdges(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n): Promise<CallExtractResult> {\n  let nodesAdded = 0\n  let edgesAdded = 0\n\n  for (const service of services) {\n    const files = await loadSourceFiles(service.dir)\n    const endpoints: ExternalEndpoint[] = []\n    for (const file of files) {\n      // ADR-065 #1 — test-scope exclusion. Tests stay registered as\n      // service-internal (via the file walk earlier); only outbound\n      // endpoint inference from them is filtered.\n      if (isTestPath(file.path)) continue\n      // ADR-065 #2 — comment-body exclusion. The regex-based extractors\n      // (redis / kafka / aws / grpc) scan raw file.content; URLs inside\n      // JSDoc / line / block comments leaked through to the graph in the\n      // v0.3.0 medusa run. Mask comments while preserving line/column for\n      // evidence line-mapping.\n      const masked = maskCommentsInSource(file.content)\n      const maskedFile = { path: file.path, content: masked }\n      endpoints.push(...kafkaEndpointsFromFile(maskedFile, service.dir))\n      endpoints.push(...redisEndpointsFromFile(maskedFile, service.dir))\n      endpoints.push(...awsEndpointsFromFile(maskedFile, service.dir))\n      endpoints.push(...grpcEndpointsFromFile(maskedFile, service.dir))\n    }\n    if (endpoints.length === 0) continue\n\n    const seenEdges = new Set<string>()\n    for (const ep of endpoints) {\n      if (!graph.hasNode(ep.infraId)) {\n        const node: InfraNode = {\n          id: ep.infraId,\n          type: NodeType.InfraNode,\n          name: ep.name,\n          // #238 — `aws-*` covers AWS-SDK client kinds (aws-s3, aws-dynamodb,\n          // aws-cognito-identity-provider, …); `s3-` / `dynamodb-` cover the\n          // bucket / table kinds from aws.ts.\n          provider: isAwsKind(ep.kind) ? 'aws' : 'self',\n          kind: ep.kind,\n        }\n        graph.addNode(node.id, node)\n        nodesAdded++\n      }\n\n      const edgeType = edgeTypeFromEndpoint(ep)\n      const edgeId = makeEdgeId(service.node.id, ep.infraId, edgeType)\n      if (seenEdges.has(edgeId)) continue\n      seenEdges.add(edgeId)\n      const confidence = confidenceForExtracted(ep.confidenceKind)\n      // Precision floor (ADR-066 §3). Sub-threshold candidates are computed\n      // but never added to the graph; the banner reports the drop count.\n      if (!passesExtractedFloor(confidence)) {\n        noteExtractedDropped({\n          source: service.node.id,\n          target: ep.infraId,\n          type: edgeType,\n          confidence,\n          confidenceKind: ep.confidenceKind,\n          evidence: ep.evidence,\n        })\n        continue\n      }\n      if (!graph.hasEdge(edgeId)) {\n        const edge: GraphEdge = {\n          id: edgeId,\n          source: service.node.id,\n          target: ep.infraId,\n          type: edgeType,\n          provenance: Provenance.EXTRACTED,\n          confidence,\n          evidence: ep.evidence,\n        }\n        graph.addEdgeWithKey(edgeId, edge.source, edge.target, edge)\n        edgesAdded++\n      }\n    }\n  }\n  return { nodesAdded, edgesAdded }\n}\n\nexport async function addCallEdges(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n): Promise<CallExtractResult> {\n  const httpEdges = await addHttpCallEdges(graph, services)\n  const ext = await addExternalEndpointEdges(graph, services)\n  return {\n    nodesAdded: ext.nodesAdded,\n    edgesAdded: httpEdges + ext.edgesAdded,\n  }\n}\n","import path from 'node:path'\nimport Parser from 'tree-sitter'\nimport JavaScript from 'tree-sitter-javascript'\nimport Python from 'tree-sitter-python'\nimport type { GraphEdge } from '@neat.is/types'\nimport {\n  EdgeType,\n  Provenance,\n  confidenceForExtracted,\n  passesExtractedFloor,\n} from '@neat.is/types'\nimport type { NeatGraph } from '../../graph.js'\nimport {\n  isTestPath,\n  makeEdgeId,\n  urlMatchesHost,\n  type DiscoveredService,\n} from '../shared.js'\nimport { recordExtractionError, noteExtractedDropped } from '../errors.js'\nimport { loadSourceFiles, lineOf, snippet } from './shared.js'\n\n// JS uses `string_fragment` for the textual interior of a template/string;\n// Python uses `string_content` inside a `string` node. Either way we want the\n// raw textual content (no quotes), so we accept both.\nconst STRING_LITERAL_NODE_TYPES = new Set(['string_fragment', 'string_content'])\n\n// ADR-065 #3 — JSX external-link exclusion. Tags whose URL-attr strings are\n// user-clickable hyperlinks, not service-to-service calls.\nconst JSX_EXTERNAL_LINK_TAGS = new Set(['a', 'Link', 'NavLink', 'ExternalLink', 'Anchor'])\n\n// Walk upward from a string-literal node to detect whether it sits inside a\n// JSX attribute on an external-link element. Returns true if the literal\n// should be filtered.\nfunction isInsideJsxExternalLink(node: Parser.SyntaxNode): boolean {\n  let cursor: Parser.SyntaxNode | null = node.parent\n  // Step out of the string wrapper if needed (parent is `string` /\n  // `template_string`).\n  while (cursor) {\n    if (cursor.type === 'jsx_attribute') {\n      // The element that owns this attribute. jsx_attribute lives inside\n      // jsx_opening_element / jsx_self_closing_element.\n      let owner: Parser.SyntaxNode | null = cursor.parent\n      while (owner && owner.type !== 'jsx_opening_element' && owner.type !== 'jsx_self_closing_element') {\n        owner = owner.parent\n      }\n      if (!owner) return false\n      // First named child of an opening/self-closing element is the tag name\n      // (`identifier` or `member_expression`).\n      const tagNode = owner.namedChild(0)\n      const tagName = tagNode?.text ?? ''\n      // For `<Foo.Bar>` we just want the rightmost ident; pick after the\n      // last dot.\n      const right = tagName.includes('.') ? tagName.split('.').pop()! : tagName\n      return JSX_EXTERNAL_LINK_TAGS.has(right)\n    }\n    cursor = cursor.parent\n  }\n  return false\n}\n\n// Collect (literal text, ast-node) pairs so the JSX-context check has the\n// node available. Comment tokens have no string_fragment / string_content\n// children in tree-sitter — JSDoc text lives inside `comment` nodes — so\n// comment-body exclusion comes for free with this AST walk (ADR-065 #2).\nfunction collectStringLiterals(\n  node: Parser.SyntaxNode,\n  out: { text: string; node: Parser.SyntaxNode }[],\n): void {\n  if (STRING_LITERAL_NODE_TYPES.has(node.type)) out.push({ text: node.text, node })\n  for (let i = 0; i < node.namedChildCount; i++) {\n    const child = node.namedChild(i)\n    if (child) collectStringLiterals(child, out)\n  }\n}\n\nexport function callsFromSource(\n  source: string,\n  parser: Parser,\n  knownHosts: Set<string>,\n): Set<string> {\n  const tree = parser.parse(source)\n  const literals: { text: string; node: Parser.SyntaxNode }[] = []\n  collectStringLiterals(tree.rootNode, literals)\n  const targets = new Set<string>()\n  for (const lit of literals) {\n    // ADR-065 #3 — JSX external-link exclusion. URL strings on <a>, <Link>,\n    // <NavLink>, <ExternalLink>, <Anchor> are user-clickable hyperlinks, not\n    // service calls.\n    if (isInsideJsxExternalLink(lit.node)) continue\n    for (const host of knownHosts) {\n      // ADR-065 #5 — exact hostname match (not substring containment).\n      // `medusa.cloud` no longer matches `@medusajs/medusa`.\n      if (urlMatchesHost(lit.text, host)) {\n        targets.add(host)\n      }\n    }\n  }\n  return targets\n}\n\nfunction makeJsParser(): Parser {\n  const p = new Parser()\n  p.setLanguage(JavaScript)\n  return p\n}\n\nfunction makePyParser(): Parser {\n  const p = new Parser()\n  p.setLanguage(Python)\n  return p\n}\n\n// HTTP CALLS via URL substring match. Parser is picked per file extension:\n// .py uses tree-sitter-python; everything else uses tree-sitter-javascript.\n// The demo's CALLS edges stay byte-for-byte identical to the M1 baseline.\nexport async function addHttpCallEdges(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n): Promise<number> {\n  const jsParser = makeJsParser()\n  const pyParser = makePyParser()\n\n  const knownHosts = new Set<string>()\n  const hostToNodeId = new Map<string, string>()\n  for (const service of services) {\n    knownHosts.add(path.basename(service.dir))\n    knownHosts.add(service.pkg.name)\n    hostToNodeId.set(path.basename(service.dir), service.node.id)\n    hostToNodeId.set(service.pkg.name, service.node.id)\n  }\n\n  let edgesAdded = 0\n  for (const service of services) {\n    const files = await loadSourceFiles(service.dir)\n    const seenTargets = new Map<string, { file: string; host: string }>()\n    for (const file of files) {\n      // ADR-065 #1 — test-scope exclusion.\n      if (isTestPath(file.path)) continue\n      const parser = path.extname(file.path) === '.py' ? pyParser : jsParser\n      let targets: Set<string>\n      try {\n        targets = callsFromSource(file.content, parser, knownHosts)\n      } catch (err) {\n        recordExtractionError('http call extraction', file.path, err)\n        continue\n      }\n      for (const t of targets) {\n        const targetId = hostToNodeId.get(t)\n        if (!targetId || targetId === service.node.id) continue\n        if (!seenTargets.has(targetId)) {\n          seenTargets.set(targetId, { file: file.path, host: t })\n        }\n      }\n    }\n    for (const [targetId, evidenceFile] of seenTargets) {\n      const fileContent = files.find((f) => f.path === evidenceFile.file)?.content ?? ''\n      const line = lineOf(fileContent, `//${evidenceFile.host}`)\n      // URL-string match against a registered service hostname is the\n      // hostname-shape tier per ADR-066 — structurally tight (urlMatchesHost\n      // requires scheme + exact hostname) but no framework-aware recognizer\n      // confirms the call. Drops below the default precision floor (0.7) and\n      // never enters the graph unless the floor is lowered for diagnostics.\n      const confidence = confidenceForExtracted('hostname-shape-match')\n      const ev = {\n        file: path.relative(service.dir, evidenceFile.file),\n        line,\n        snippet: snippet(fileContent, line),\n      }\n      const edgeId = makeEdgeId(service.node.id, targetId, EdgeType.CALLS)\n      if (!passesExtractedFloor(confidence)) {\n        noteExtractedDropped({\n          source: service.node.id,\n          target: targetId,\n          type: EdgeType.CALLS,\n          confidence,\n          confidenceKind: 'hostname-shape-match',\n          evidence: ev,\n        })\n        continue\n      }\n      const edge: GraphEdge = {\n        id: edgeId,\n        source: service.node.id,\n        target: targetId,\n        type: EdgeType.CALLS,\n        provenance: Provenance.EXTRACTED,\n        confidence,\n        evidence: ev,\n      }\n      if (!graph.hasEdge(edge.id)) {\n        graph.addEdgeWithKey(edge.id, edge.source, edge.target, edge)\n        edgesAdded++\n      }\n    }\n  }\n  return edgesAdded\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport type { EdgeEvidence, ExtractedConfidenceKind } from '@neat.is/types'\nimport { IGNORED_DIRS, SERVICE_FILE_EXTENSIONS } from '../shared.js'\n\nexport interface SourceFile {\n  path: string\n  content: string\n}\n\nexport interface ExternalEndpoint {\n  // Stable id of the InfraNode this evidence implies. Format\n  // `infra:<kind>:<name>` so the orchestrator can dedupe across services.\n  infraId: string\n  // Display name on the InfraNode (e.g., \"orders\" for kafka-topic:orders).\n  name: string\n  kind: string\n  edgeType: 'CALLS' | 'PUBLISHES_TO' | 'CONSUMES_FROM'\n  evidence: EdgeEvidence\n  // Confidence grade per ADR-066 — set by the per-shape detector. The\n  // orchestrator (calls/index.ts) writes this onto the EXTRACTED edge and\n  // applies the precision floor before adding the edge to the graph.\n  confidenceKind: ExtractedConfidenceKind\n}\n\nexport async function walkSourceFiles(dir: string): Promise<string[]> {\n  const out: string[] = []\n  async function walk(current: string): Promise<void> {\n    const entries = await fs.readdir(current, { withFileTypes: true }).catch(() => [])\n    for (const entry of entries) {\n      const full = path.join(current, entry.name)\n      if (entry.isDirectory()) {\n        if (!IGNORED_DIRS.has(entry.name)) await walk(full)\n      } else if (entry.isFile() && SERVICE_FILE_EXTENSIONS.has(path.extname(entry.name))) {\n        out.push(full)\n      }\n    }\n  }\n  await walk(dir)\n  return out\n}\n\nexport async function loadSourceFiles(dir: string): Promise<SourceFile[]> {\n  const paths = await walkSourceFiles(dir)\n  const out: SourceFile[] = []\n  for (const p of paths) {\n    try {\n      const content = await fs.readFile(p, 'utf8')\n      out.push({ path: p, content })\n    } catch {\n      // unreadable, skip\n    }\n  }\n  return out\n}\n\n// Locate the line of the first occurrence of `needle` in `text`, 1-indexed.\n// Falls back to line 1 if the needle isn't found verbatim — better to point at\n// the file than to drop the evidence entirely.\nexport function lineOf(text: string, needle: string): number {\n  const idx = text.indexOf(needle)\n  if (idx < 0) return 1\n  return text.slice(0, idx).split('\\n').length\n}\n\nexport function snippet(text: string, line: number): string {\n  const lines = text.split('\\n')\n  return (lines[line - 1] ?? '').trim()\n}\n","import path from 'node:path'\nimport { infraId } from '@neat.is/types'\nimport { lineOf, snippet, type ExternalEndpoint, type SourceFile } from './shared.js'\n\n// Match `producer.send({ topic: \"orders\" ... })` and `producer.send({\n// topic: 'orders' })` plus the two-arg form `producer.send(\"orders\", ...)`.\n// Kafka client libraries vary; these two forms cover kafkajs + node-rdkafka\n// well enough for static extraction. Same shape covers consumer.subscribe.\nconst PRODUCER_TOPIC_RE =\n  /(?:producer|kafkaProducer)[\\s\\S]{0,40}?\\.send\\s*\\(\\s*\\{[\\s\\S]{0,200}?topic\\s*:\\s*['\"`]([^'\"`]+)['\"`]/g\nconst CONSUMER_TOPIC_RE =\n  /(?:consumer|kafkaConsumer)[\\s\\S]{0,40}?\\.(?:subscribe|run)\\s*\\(\\s*\\{[\\s\\S]{0,200}?topic[s]?\\s*:\\s*(?:\\[\\s*)?['\"`]([^'\"`]+)['\"`]/g\n\nfunction findAll(re: RegExp, text: string): { topic: string; index: number }[] {\n  re.lastIndex = 0\n  const out: { topic: string; index: number }[] = []\n  let m: RegExpExecArray | null\n  while ((m = re.exec(text)) !== null) {\n    out.push({ topic: m[1]!, index: m.index })\n  }\n  return out\n}\n\nexport function kafkaEndpointsFromFile(\n  file: SourceFile,\n  serviceDir: string,\n): ExternalEndpoint[] {\n  const out: ExternalEndpoint[] = []\n  const seen = new Set<string>()\n  const make = (topic: string, edgeType: 'PUBLISHES_TO' | 'CONSUMES_FROM'): void => {\n    const key = `${edgeType}|${topic}`\n    if (seen.has(key)) return\n    seen.add(key)\n    const line = lineOf(file.content, topic)\n    out.push({\n      infraId: infraId('kafka-topic', topic),\n      name: topic,\n      kind: 'kafka-topic',\n      edgeType,\n      // `producer.send({topic: 'x'})` / `consumer.subscribe({topic: 'x'})` —\n      // framework-aware (kafkajs / node-rdkafka shape). Verified-call-site\n      // tier (ADR-066).\n      confidenceKind: 'verified-call-site',\n      evidence: {\n        file: path.relative(serviceDir, file.path),\n        line,\n        snippet: snippet(file.content, line),\n      },\n    })\n  }\n\n  for (const { topic } of findAll(PRODUCER_TOPIC_RE, file.content)) make(topic, 'PUBLISHES_TO')\n  for (const { topic } of findAll(CONSUMER_TOPIC_RE, file.content)) make(topic, 'CONSUMES_FROM')\n  return out\n}\n","import path from 'node:path'\nimport { infraId } from '@neat.is/types'\nimport { lineOf, snippet, type ExternalEndpoint, type SourceFile } from './shared.js'\n\n// Redis URLs in source — `redis://host[:port]` or `rediss://...`. We only\n// catch literal strings; env-driven URLs go through the database parsers\n// (.env, ormconfig, etc.) and don't need a CALLS edge.\nconst REDIS_URL_RE = /redis(?:s)?:\\/\\/(?:[^@'\"`\\s]+@)?([^:/'\"`\\s]+)(?::(\\d+))?/g\n\nexport function redisEndpointsFromFile(\n  file: SourceFile,\n  serviceDir: string,\n): ExternalEndpoint[] {\n  const out: ExternalEndpoint[] = []\n  const seen = new Set<string>()\n  REDIS_URL_RE.lastIndex = 0\n  let m: RegExpExecArray | null\n  while ((m = REDIS_URL_RE.exec(file.content)) !== null) {\n    const host = m[1]!\n    if (seen.has(host)) continue\n    seen.add(host)\n    const line = lineOf(file.content, host)\n    out.push({\n      infraId: infraId('redis', host),\n      name: host,\n      kind: 'redis',\n      edgeType: 'CALLS',\n      // `redis://host` URL literal — the scheme is structural support, but no\n      // call expression is verified to wire it through. URL-with-structural-\n      // support tier (ADR-066).\n      confidenceKind: 'url-with-structural-support',\n      evidence: {\n        file: path.relative(serviceDir, file.path),\n        line,\n        snippet: snippet(file.content, line),\n      },\n    })\n  }\n  return out\n}\n","import path from 'node:path'\nimport { infraId } from '@neat.is/types'\nimport { lineOf, snippet, type ExternalEndpoint, type SourceFile } from './shared.js'\n\n// AWS SDK v3 calls. We catch S3 (`Bucket: \"x\"` near a `S3Client`-using\n// PutObjectCommand / GetObjectCommand / DeleteObjectCommand) and DynamoDB\n// (`TableName: \"x\"` near GetCommand / PutCommand / DynamoDBClient). The\n// pattern is intentionally permissive: a literal Bucket/TableName near an\n// SDK constant is good enough evidence; misses are fine because non-static\n// resources can't be catalogued anyway.\nconst S3_BUCKET_RE = /Bucket\\s*:\\s*['\"`]([^'\"`]+)['\"`]/g\nconst DYNAMO_TABLE_RE = /TableName\\s*:\\s*['\"`]([^'\"`]+)['\"`]/g\n\nfunction hasMarker(text: string, markers: string[]): boolean {\n  return markers.some((m) => text.includes(m))\n}\n\nfunction findAll(re: RegExp, text: string): { name: string; index: number }[] {\n  re.lastIndex = 0\n  const out: { name: string; index: number }[] = []\n  let m: RegExpExecArray | null\n  while ((m = re.exec(text)) !== null) {\n    out.push({ name: m[1]!, index: m.index })\n  }\n  return out\n}\n\nexport function awsEndpointsFromFile(\n  file: SourceFile,\n  serviceDir: string,\n): ExternalEndpoint[] {\n  const out: ExternalEndpoint[] = []\n  const seen = new Set<string>()\n  const make = (kind: string, name: string): void => {\n    const key = `${kind}|${name}`\n    if (seen.has(key)) return\n    seen.add(key)\n    const line = lineOf(file.content, name)\n    out.push({\n      infraId: infraId(kind, name),\n      name,\n      kind,\n      edgeType: 'CALLS',\n      // SDK marker (S3Client, GetCommand, etc.) plus a Bucket/TableName\n      // literal — framework-aware recognizer, verified-call-site tier\n      // (ADR-066).\n      confidenceKind: 'verified-call-site',\n      evidence: {\n        file: path.relative(serviceDir, file.path),\n        line,\n        snippet: snippet(file.content, line),\n      },\n    })\n  }\n\n  if (hasMarker(file.content, ['S3Client', 'PutObjectCommand', 'GetObjectCommand', 'DeleteObjectCommand'])) {\n    for (const { name } of findAll(S3_BUCKET_RE, file.content)) make('s3-bucket', name)\n  }\n  if (\n    hasMarker(file.content, [\n      'DynamoDBClient',\n      'DynamoDBDocumentClient',\n      'GetCommand',\n      'PutCommand',\n      'QueryCommand',\n      'UpdateCommand',\n      'DeleteCommand',\n    ])\n  ) {\n    for (const { name } of findAll(DYNAMO_TABLE_RE, file.content)) make('dynamodb-table', name)\n  }\n  return out\n}\n","import path from 'node:path'\nimport { infraId } from '@neat.is/types'\nimport { lineOf, snippet, type ExternalEndpoint, type SourceFile } from './shared.js'\n\n// Client-construction in JS/TS:\n//\n//   const client = new orders_proto.OrderService(...)\n//   const client = new OrdersClient('orders.internal:50051', ...)\n//   const client = new S3Client({ region: 'us-east-1' })\n//\n// The same `new <Name>Client(...)` shape is used by gRPC client stubs, AWS\n// SDK v3 service clients, and a long tail of other SDKs. v0.3.0 mapped every\n// `*Client(...)` to `infra:grpc-service:*`, which was true for the demo and\n// false for every AWS service medusa imported.\n//\n// Per ADR-065 / #238, classification is import-aware:\n//   1. file imports `@aws-sdk/client-<suffix>` and `<Name>` lowercases to the\n//      same alphanumeric tail (`S3Client` ↔ `client-s3`,\n//      `CognitoIdentityProviderClient` ↔ `client-cognito-identity-provider`)\n//      → kind `aws-<suffix>` (e.g. `infra:aws-s3:S3`).\n//   2. file imports `@grpc/grpc-js` or any `*_grpc_pb` generated stub\n//      → kind `grpc-service` (the legitimate gRPC path; demo unchanged).\n//   3. otherwise → kind `service` (the safe default — accurate but\n//      uninformative, the v0.3.0 grpc lie is removed).\nconst GRPC_CLIENT_RE = /new\\s+([A-Z][A-Za-z0-9_]*)Client\\s*\\(\\s*['\"`]?([^,'\"`)]+)?/g\nconst AWS_SDK_IMPORT_RE =\n  /(?:from\\s+['\"`]|require\\(\\s*['\"`])@aws-sdk\\/client-([a-z0-9-]+)['\"`]/g\nconst GRPC_IMPORT_RE =\n  /(?:from\\s+['\"`]|require\\(\\s*['\"`])@grpc\\/grpc-js['\"`]|_grpc_pb['\"`]/\n\nfunction isLikelyAddress(value: string | undefined): boolean {\n  if (!value) return false\n  return /:\\d{2,5}$/.test(value) || value.includes('.')\n}\n\nfunction normaliseForMatch(s: string): string {\n  return s.toLowerCase().replace(/[^a-z0-9]/g, '')\n}\n\ninterface ImportContext {\n  awsSdkSuffixes: Map<string, string>  // normalised → raw suffix (e.g. 's3' → 's3')\n  hasGrpcImport: boolean\n}\n\nfunction readImports(content: string): ImportContext {\n  const awsSdkSuffixes = new Map<string, string>()\n  AWS_SDK_IMPORT_RE.lastIndex = 0\n  let m: RegExpExecArray | null\n  while ((m = AWS_SDK_IMPORT_RE.exec(content)) !== null) {\n    const raw = m[1]!\n    awsSdkSuffixes.set(normaliseForMatch(raw), raw)\n  }\n  return {\n    awsSdkSuffixes,\n    hasGrpcImport: GRPC_IMPORT_RE.test(content),\n  }\n}\n\nfunction classifyClient(\n  symbol: string,\n  ctx: ImportContext,\n): { kind: string } | null {\n  const key = normaliseForMatch(symbol)\n  const awsRaw = ctx.awsSdkSuffixes.get(key)\n  if (awsRaw) return { kind: `aws-${awsRaw}` }\n  if (ctx.hasGrpcImport) return { kind: 'grpc-service' }\n  // ADR-065 #5-adjacent — a bare `new <Name>Client()` with no AWS or gRPC\n  // import context is ambiguous; could be an in-process client object\n  // (`new QueryClient()` from @tanstack/react-query, `new PrismaClient()`,\n  // a domain Client class, etc.). Refuse to emit an edge rather than guess\n  // a `service` kind that produces false positives. v0.3.3 medusa run had\n  // a QueryClient false positive before this guard.\n  return null\n}\n\nexport function grpcEndpointsFromFile(\n  file: SourceFile,\n  serviceDir: string,\n): ExternalEndpoint[] {\n  const out: ExternalEndpoint[] = []\n  const seen = new Set<string>()\n  const ctx = readImports(file.content)\n  GRPC_CLIENT_RE.lastIndex = 0\n  let m: RegExpExecArray | null\n  while ((m = GRPC_CLIENT_RE.exec(file.content)) !== null) {\n    const symbol = m[1]!\n    const addr = m[2]?.trim()\n    const name = isLikelyAddress(addr) ? addr! : symbol\n    if (seen.has(name)) continue\n    const classified = classifyClient(symbol, ctx)\n    if (!classified) continue\n    seen.add(name)\n    const { kind } = classified\n    const line = lineOf(file.content, m[0])\n    out.push({\n      infraId: infraId(kind, name),\n      name,\n      kind,\n      edgeType: 'CALLS',\n      // `new <Name>Client(...)` with @aws-sdk/* or @grpc/grpc-js import\n      // context — import-aware classification per #238. Verified-call-site\n      // tier (ADR-066).\n      confidenceKind: 'verified-call-site',\n      evidence: {\n        file: path.relative(serviceDir, file.path),\n        line,\n        snippet: snippet(file.content, line),\n      },\n    })\n  }\n  return out\n}\n","import path from 'node:path'\nimport type { GraphEdge } from '@neat.is/types'\nimport { EdgeType, Provenance, confidenceForExtracted } from '@neat.is/types'\nimport type { NeatGraph } from '../../graph.js'\nimport { exists, makeEdgeId, readYaml, type DiscoveredService } from '../shared.js'\nimport { recordExtractionError } from '../errors.js'\nimport { classifyImage, makeInfraNode } from './shared.js'\n\ninterface ComposeService {\n  image?: string\n  build?: string | { context?: string }\n  depends_on?: string[] | Record<string, unknown>\n}\n\ninterface ComposeFile {\n  services?: Record<string, ComposeService>\n}\n\nfunction dependsOnList(value: ComposeService['depends_on']): string[] {\n  if (!value) return []\n  if (Array.isArray(value)) return value\n  return Object.keys(value)\n}\n\nfunction serviceNameToServiceNode(\n  name: string,\n  services: DiscoveredService[],\n): string | null {\n  for (const s of services) {\n    if (s.node.name === name || path.basename(s.dir) === name) return s.node.id\n  }\n  return null\n}\n\n// Project-level docker-compose.yml describes deployment topology. Each compose\n// service that is *not* one of the discovered ServiceNodes becomes an\n// InfraNode (databases, brokers, caches). depends_on lists become DEPENDS_ON\n// edges from the dependent to its dependency, regardless of whether the\n// endpoint is a ServiceNode or InfraNode — the edge itself is the deployment\n// fact, not the role.\nexport async function addComposeInfra(\n  graph: NeatGraph,\n  scanPath: string,\n  services: DiscoveredService[],\n): Promise<{ nodesAdded: number; edgesAdded: number }> {\n  let nodesAdded = 0\n  let edgesAdded = 0\n\n  let composePath: string | null = null\n  for (const name of ['docker-compose.yml', 'docker-compose.yaml']) {\n    const abs = path.join(scanPath, name)\n    if (await exists(abs)) {\n      composePath = abs\n      break\n    }\n  }\n  if (!composePath) return { nodesAdded, edgesAdded }\n\n  let compose: ComposeFile\n  try {\n    compose = await readYaml<ComposeFile>(composePath)\n  } catch (err) {\n    recordExtractionError(\n      'infra docker-compose',\n      path.relative(scanPath, composePath),\n      err,\n    )\n    return { nodesAdded, edgesAdded }\n  }\n  if (!compose?.services) return { nodesAdded, edgesAdded }\n  const evidenceFile = path.relative(scanPath, composePath).split(path.sep).join('/')\n\n  const composeNameToNodeId = new Map<string, string>()\n  for (const [composeName, svc] of Object.entries(compose.services)) {\n    const matchedServiceId = serviceNameToServiceNode(composeName, services)\n    if (matchedServiceId) {\n      composeNameToNodeId.set(composeName, matchedServiceId)\n      continue\n    }\n    const kind = svc.image ? classifyImage(svc.image) : 'container'\n    const node = makeInfraNode(kind, composeName)\n    if (!graph.hasNode(node.id)) {\n      graph.addNode(node.id, node)\n      nodesAdded++\n    }\n    composeNameToNodeId.set(composeName, node.id)\n  }\n\n  for (const [composeName, svc] of Object.entries(compose.services)) {\n    const sourceId = composeNameToNodeId.get(composeName)\n    if (!sourceId) continue\n    for (const dep of dependsOnList(svc.depends_on)) {\n      const targetId = composeNameToNodeId.get(dep)\n      if (!targetId) continue\n      const edgeId = makeEdgeId(sourceId, targetId, EdgeType.DEPENDS_ON)\n      if (graph.hasEdge(edgeId)) continue\n      // depends_on declaration from docker-compose.yml — structural deployment\n      // fact, structural tier per ADR-066.\n      const edge: GraphEdge = {\n        id: edgeId,\n        source: sourceId,\n        target: targetId,\n        type: EdgeType.DEPENDS_ON,\n        provenance: Provenance.EXTRACTED,\n        confidence: confidenceForExtracted('structural'),\n        evidence: { file: evidenceFile },\n      }\n      graph.addEdgeWithKey(edgeId, edge.source, edge.target, edge)\n      edgesAdded++\n    }\n  }\n\n  return { nodesAdded, edgesAdded }\n}\n","import type { InfraNode } from '@neat.is/types'\nimport { NodeType, infraId } from '@neat.is/types'\n\n// ADR-010 reserves the `infra:` prefix; the kind segment lets traversal and\n// MCP tools sub-type without inventing a new top-level NodeType per source.\nexport function makeInfraNode(\n  kind: string,\n  name: string,\n  provider = 'self',\n  extras?: { region?: string },\n): InfraNode {\n  return {\n    id: infraId(kind, name),\n    type: NodeType.InfraNode,\n    name,\n    provider,\n    kind,\n    ...(extras?.region ? { region: extras.region } : {}),\n  }\n}\n\n// Stable kind for an image string like \"postgres:15-alpine\" or \"mysql:8\".\n// The image name itself ends up in the InfraNode `name` field; this function\n// only classifies what the image *is*, so callers can group similar runtimes.\nexport function classifyImage(image: string): string {\n  const lower = image.toLowerCase()\n  const repo = lower.split(':')[0]!\n  const last = repo.split('/').pop() ?? repo\n  if (last.startsWith('postgres')) return 'postgres'\n  if (last.startsWith('mysql') || last.startsWith('mariadb')) return 'mysql'\n  if (last.startsWith('mongo')) return 'mongodb'\n  if (last.startsWith('redis')) return 'redis'\n  if (last.startsWith('rabbitmq')) return 'rabbitmq'\n  if (last.startsWith('kafka') || last.includes('kafka')) return 'kafka'\n  if (last.startsWith('memcached')) return 'memcached'\n  return 'container'\n}\n","import path from 'node:path'\nimport { promises as fs } from 'node:fs'\nimport type { GraphEdge } from '@neat.is/types'\nimport { EdgeType, Provenance, confidenceForExtracted } from '@neat.is/types'\nimport type { NeatGraph } from '../../graph.js'\nimport { exists, makeEdgeId, type DiscoveredService } from '../shared.js'\nimport { recordExtractionError } from '../errors.js'\nimport { makeInfraNode } from './shared.js'\n\n// Pull the first non-`scratch` `FROM` line out of a Dockerfile, ignoring\n// multi-stage `as` aliases. Returns the image including tag (e.g. `node:20`,\n// `python:3.11-slim`). Multi-stage builds report the *runtime* image — the\n// last FROM that isn't aliasing a previous stage.\nfunction runtimeImage(content: string): string | null {\n  const lines = content.split('\\n')\n  let last: string | null = null\n  for (const raw of lines) {\n    const line = raw.trim()\n    if (!line || line.startsWith('#')) continue\n    if (!/^from\\s+/i.test(line)) continue\n    const tokens = line.split(/\\s+/)\n    const image = tokens[1]\n    if (!image || image.toLowerCase() === 'scratch') continue\n    last = image\n  }\n  return last\n}\n\n// For each ServiceNode that has a Dockerfile in its dir, emit a\n// `infra:container-image:<image>` InfraNode and a RUNS_ON edge from the\n// service to the image.\nexport async function addDockerfileRuntimes(\n  graph: NeatGraph,\n  services: DiscoveredService[],\n  scanPath: string,\n): Promise<{ nodesAdded: number; edgesAdded: number }> {\n  let nodesAdded = 0\n  let edgesAdded = 0\n\n  for (const service of services) {\n    const dockerfilePath = path.join(service.dir, 'Dockerfile')\n    if (!(await exists(dockerfilePath))) continue\n    let content: string\n    try {\n      content = await fs.readFile(dockerfilePath, 'utf8')\n    } catch (err) {\n      recordExtractionError(\n        'infra dockerfile',\n        path.relative(scanPath, dockerfilePath),\n        err,\n      )\n      continue\n    }\n    const image = runtimeImage(content)\n    if (!image) continue\n\n    const node = makeInfraNode('container-image', image)\n    if (!graph.hasNode(node.id)) {\n      graph.addNode(node.id, node)\n      nodesAdded++\n    }\n\n    const edgeId = makeEdgeId(service.node.id, node.id, EdgeType.RUNS_ON)\n    if (!graph.hasEdge(edgeId)) {\n      // Dockerfile FROM line — direct file fact, structural tier per ADR-066.\n      const edge: GraphEdge = {\n        id: edgeId,\n        source: service.node.id,\n        target: node.id,\n        type: EdgeType.RUNS_ON,\n        provenance: Provenance.EXTRACTED,\n        confidence: confidenceForExtracted('structural'),\n        evidence: {\n          file: path.relative(scanPath, dockerfilePath).split(path.sep).join('/'),\n        },\n      }\n      graph.addEdgeWithKey(edgeId, edge.source, edge.target, edge)\n      edgesAdded++\n    }\n  }\n\n  return { nodesAdded, edgesAdded }\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport type { NeatGraph } from '../../graph.js'\nimport { IGNORED_DIRS } from '../shared.js'\nimport { makeInfraNode } from './shared.js'\n\n// Light pass: catalogue `resource \"aws_*\" \"name\"` blocks in any *.tf file.\n// We don't interpret references — a real Terraform backend would resolve\n// those — but the resource-type/name pair is enough to register the node so\n// later cross-references can hang off it.\nconst RESOURCE_RE = /resource\\s+\"(aws_[A-Za-z0-9_]+)\"\\s+\"([A-Za-z0-9_-]+)\"/g\n\nasync function walkTfFiles(start: string, depth = 0, max = 5): Promise<string[]> {\n  if (depth > max) return []\n  const out: string[] = []\n  const entries = await fs.readdir(start, { withFileTypes: true }).catch(() => [])\n  for (const entry of entries) {\n    if (entry.isDirectory()) {\n      if (IGNORED_DIRS.has(entry.name) || entry.name === '.terraform') continue\n      out.push(...(await walkTfFiles(path.join(start, entry.name), depth + 1, max)))\n    } else if (entry.isFile() && entry.name.endsWith('.tf')) {\n      out.push(path.join(start, entry.name))\n    }\n  }\n  return out\n}\n\nexport async function addTerraformResources(\n  graph: NeatGraph,\n  scanPath: string,\n): Promise<{ nodesAdded: number; edgesAdded: number }> {\n  let nodesAdded = 0\n  const files = await walkTfFiles(scanPath)\n  for (const file of files) {\n    const content = await fs.readFile(file, 'utf8')\n    RESOURCE_RE.lastIndex = 0\n    let m: RegExpExecArray | null\n    while ((m = RESOURCE_RE.exec(content)) !== null) {\n      const kind = m[1]!\n      const name = m[2]!\n      const node = makeInfraNode(kind, name, 'aws')\n      if (!graph.hasNode(node.id)) {\n        graph.addNode(node.id, node)\n        nodesAdded++\n      }\n    }\n  }\n  return { nodesAdded, edgesAdded: 0 }\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport { parseAllDocuments } from 'yaml'\nimport type { NeatGraph } from '../../graph.js'\nimport { CONFIG_FILE_EXTENSIONS, IGNORED_DIRS } from '../shared.js'\nimport { makeInfraNode } from './shared.js'\n\ninterface K8sDoc {\n  kind?: string\n  metadata?: { name?: string; namespace?: string }\n}\n\nconst K8S_KIND_TO_INFRA_KIND: Record<string, string> = {\n  Service: 'k8s-service',\n  Deployment: 'k8s-deployment',\n  StatefulSet: 'k8s-statefulset',\n  DaemonSet: 'k8s-daemonset',\n  CronJob: 'k8s-cronjob',\n  Job: 'k8s-job',\n  Ingress: 'k8s-ingress',\n}\n\nasync function walkYamlFiles(start: string, depth = 0, max = 5): Promise<string[]> {\n  if (depth > max) return []\n  const out: string[] = []\n  const entries = await fs.readdir(start, { withFileTypes: true }).catch(() => [])\n  for (const entry of entries) {\n    if (entry.isDirectory()) {\n      if (IGNORED_DIRS.has(entry.name)) continue\n      out.push(...(await walkYamlFiles(path.join(start, entry.name), depth + 1, max)))\n    } else if (entry.isFile() && CONFIG_FILE_EXTENSIONS.has(path.extname(entry.name))) {\n      out.push(path.join(start, entry.name))\n    }\n  }\n  return out\n}\n\n// Multi-document YAML with kind/metadata.name. We keep the matching simple:\n// any file whose first doc looks k8s-shaped. The match is on `kind` only —\n// random YAML configs (db-config.yaml, etc.) are usually flat objects with no\n// `kind` field, so they're ignored without false positives.\nexport async function addK8sResources(\n  graph: NeatGraph,\n  scanPath: string,\n): Promise<{ nodesAdded: number; edgesAdded: number }> {\n  let nodesAdded = 0\n  const files = await walkYamlFiles(scanPath)\n  for (const file of files) {\n    const content = await fs.readFile(file, 'utf8')\n    let docs: K8sDoc[]\n    try {\n      docs = parseAllDocuments(content).map((d) => d.toJSON() as K8sDoc)\n    } catch {\n      continue\n    }\n    for (const doc of docs) {\n      if (!doc?.kind || !doc.metadata?.name) continue\n      const infraKind = K8S_KIND_TO_INFRA_KIND[doc.kind]\n      if (!infraKind) continue\n      const namespaced = doc.metadata.namespace\n        ? `${doc.metadata.namespace}/${doc.metadata.name}`\n        : doc.metadata.name\n      const node = makeInfraNode(infraKind, namespaced, 'kubernetes')\n      if (!graph.hasNode(node.id)) {\n        graph.addNode(node.id, node)\n        nodesAdded++\n      }\n    }\n  }\n  return { nodesAdded, edgesAdded: 0 }\n}\n","import type { NeatGraph } from '../../graph.js'\nimport { type DiscoveredService } from '../shared.js'\nimport { addComposeInfra } from './docker-compose.js'\nimport { addDockerfileRuntimes } from './dockerfile.js'\nimport { addTerraformResources } from './terraform.js'\nimport { addK8sResources } from './k8s.js'\n\nexport interface InfraExtractResult {\n  nodesAdded: number\n  edgesAdded: number\n}\n\n// Phase 5 — infrastructure. Runs after services so RUNS_ON edges have a\n// ServiceNode to anchor on. Each sub-source contributes its own nodes/edges\n// independently; nothing here mutates ServiceNodes themselves.\nexport async function addInfra(\n  graph: NeatGraph,\n  scanPath: string,\n  services: DiscoveredService[],\n): Promise<InfraExtractResult> {\n  const compose = await addComposeInfra(graph, scanPath, services)\n  const dockerfile = await addDockerfileRuntimes(graph, services, scanPath)\n  const terraform = await addTerraformResources(graph, scanPath)\n  const k8s = await addK8sResources(graph, scanPath)\n\n  return {\n    nodesAdded:\n      compose.nodesAdded + dockerfile.nodesAdded + terraform.nodesAdded + k8s.nodesAdded,\n    edgesAdded:\n      compose.edgesAdded + dockerfile.edgesAdded + terraform.edgesAdded + k8s.edgesAdded,\n  }\n}\n","// Static-extraction pipeline. Phase order is load-bearing:\n//   services → aliases → databases (+ compat) → configs → calls → infra → frontier promotion.\n//\n// Contract anchors (see /docs/contracts.md):\n//   * Rule 1 — Every emitted edge carries Provenance.EXTRACTED from @neat.is/types.\n//   * Rule 2 — EXTRACTED edges use the plain `${type}:src->tgt` id pattern.\n//     Never write under the OBSERVED id pattern; that's ingest.ts's territory.\n//   * Rule 5 — Nodes/edges constructed against schemas in @neat.is/types; no\n//     local interface redefinitions in this tree.\n//   * Rule 8 — No demo-name hardcoding. Driver names come from package.json\n//     dependencies; engine names from compat.json via compatPairs().\n//   * Rule 14 — ConfigNodes record file existence only; never the contents.\nimport type { NeatGraph } from '../graph.js'\nimport { DEFAULT_PROJECT } from '../graph.js'\nimport { promoteFrontierNodes } from '../ingest.js'\nimport { ensureCompatLoaded } from '../compat.js'\nimport { emitNeatEvent } from '../events.js'\nimport { addServiceNodes, discoverServices } from './services.js'\nimport { addServiceAliases } from './aliases.js'\nimport { addDatabasesAndCompat } from './databases/index.js'\nimport { addConfigNodes } from './configs.js'\nimport { addCallEdges } from './calls/index.js'\nimport { addInfra } from './infra/index.js'\nimport {\n  drainExtractionErrors,\n  writeExtractionErrors,\n  drainDroppedExtracted,\n  isRejectedLogEnabled,\n  writeRejectedExtracted,\n  type ExtractionError,\n  type DroppedExtractedEdge,\n} from './errors.js'\nimport path from 'node:path'\nimport { retireExtractedEdgesByMissingFile } from './retire.js'\n\nexport interface ExtractResult {\n  nodesAdded: number\n  edgesAdded: number\n  frontiersPromoted: number\n  // ADR-065 — per-file extraction failures collected during the pass.\n  // `extractionErrors` is the count; `errorEntries` is the drained list,\n  // available for callers that want to surface per-file context. Both are\n  // present on every pass (zero is observable as a positive signal).\n  extractionErrors: number\n  errorEntries: ExtractionError[]\n  // #140 — count of EXTRACTED edges retired this pass because their\n  // evidence.file no longer exists on disk. Zero on a clean pass; non-zero\n  // means the snapshot was carrying ghosts from deleted source.\n  ghostsRetired: number\n  // ADR-066 — count of EXTRACTED candidates dropped at emit time because\n  // their graded confidence fell below NEAT_EXTRACTED_PRECISION_FLOOR.\n  // Always reported (zero is observable). Detail entries surface in\n  // `droppedEntries` and route to rejected.ndjson when\n  // NEAT_EXTRACTED_REJECTED_LOG=1.\n  extractedDropped: number\n  droppedEntries: DroppedExtractedEdge[]\n}\n\nexport interface ExtractOptions {\n  // Post-extract policy trigger (ADR-043). Awaited after frontier promotion\n  // so policies see the final post-pass graph state. Daemons wire this to\n  // evaluateAllPolicies + PolicyViolationsLog.append.\n  onPolicyTrigger?: (graph: NeatGraph) => Promise<void> | void\n  // Project tag for the extraction-complete event (ADR-051). Defaults to\n  // DEFAULT_PROJECT when omitted.\n  project?: string\n  // ADR-065 — when set, drained extraction errors are appended to this\n  // path as ndjson with `source: 'extract'`. Daemons / `neat init` /\n  // `neat watch` wire this to `<projectDir>/neat-out/errors.ndjson`. When\n  // omitted, errors are still drained and returned in the result, just\n  // not persisted.\n  errorsPath?: string\n}\n\nexport async function extractFromDirectory(\n  graph: NeatGraph,\n  scanPath: string,\n  opts: ExtractOptions = {},\n): Promise<ExtractResult> {\n  await ensureCompatLoaded()\n  // Clear any stale entries from a prior pass (the producer-side sink is\n  // process-local). Per ADR-065, every pass collects its own errors; we drain\n  // again at the end to capture this pass's failures.\n  drainExtractionErrors()\n\n  const services = await discoverServices(scanPath)\n\n  const phase1Nodes = addServiceNodes(graph, services)\n  await addServiceAliases(graph, scanPath, services)\n  const phase2 = await addDatabasesAndCompat(graph, services, scanPath)\n  const phase3 = await addConfigNodes(graph, services, scanPath)\n  const phase4 = await addCallEdges(graph, services)\n  const phase5 = await addInfra(graph, scanPath, services)\n  // #140 — drop EXTRACTED edges whose evidence.file no longer exists on disk.\n  // Catches the deleted-file ghost case for the full-pass entry point\n  // (init / daemon bootstrap). The edited-file case is handled per-mtime by\n  // watch.ts's `retireEdgesByFile`. Service dirs are passed alongside scanPath\n  // because CALLS-family producers store service-dir-relative paths while\n  // configs / databases / infra store scanPath-relative.\n  const ghostsRetired = retireExtractedEdgesByMissingFile(\n    graph,\n    scanPath,\n    services.map((s) => s.dir),\n  )\n  const frontiersPromoted = promoteFrontierNodes(graph)\n\n  // Post-extract policy trigger (ADR-043). Fires after frontier promotion so\n  // policies see the post-pass graph (including any FRONTIER → OBSERVED edge\n  // upgrades that just landed).\n  if (opts.onPolicyTrigger) await opts.onPolicyTrigger(graph)\n\n  // ADR-065 — drain the per-file extraction errors collected during the pass.\n  // If a sidecar path was supplied, append the entries; otherwise return them\n  // for the caller to surface.\n  const errorEntries = drainExtractionErrors()\n  if (opts.errorsPath && errorEntries.length > 0) {\n    try {\n      await writeExtractionErrors(errorEntries, opts.errorsPath)\n    } catch (err) {\n      console.warn(\n        `[neat] failed to write extraction errors to ${opts.errorsPath}: ${(err as Error).message}`,\n      )\n    }\n  }\n\n  // ADR-066 — drain the precision-floor drops. Always returned; only\n  // persisted when NEAT_EXTRACTED_REJECTED_LOG=1 (opt-in to keep the\n  // default sidecar surface quiet).\n  const droppedEntries = drainDroppedExtracted()\n  if (\n    isRejectedLogEnabled() &&\n    opts.errorsPath &&\n    droppedEntries.length > 0\n  ) {\n    // rejected.ndjson lives alongside errors.ndjson under neat-out/. Derive\n    // from errorsPath rather than re-plumbing a new option.\n    const rejectedPath = path.join(path.dirname(opts.errorsPath), 'rejected.ndjson')\n    try {\n      await writeRejectedExtracted(droppedEntries, rejectedPath)\n    } catch (err) {\n      console.warn(\n        `[neat] failed to write rejected extracted edges to ${rejectedPath}: ${(err as Error).message}`,\n      )\n    }\n  }\n\n  const result: ExtractResult = {\n    nodesAdded:\n      phase1Nodes +\n      phase2.nodesAdded +\n      phase3.nodesAdded +\n      phase4.nodesAdded +\n      phase5.nodesAdded,\n    edgesAdded:\n      phase2.edgesAdded + phase3.edgesAdded + phase4.edgesAdded + phase5.edgesAdded,\n    frontiersPromoted,\n    extractionErrors: errorEntries.length,\n    errorEntries,\n    ghostsRetired,\n    extractedDropped: droppedEntries.length,\n    droppedEntries,\n  }\n\n  // extraction-complete (ADR-051). fileCount is the number of services\n  // discovered — the closest proxy we have for \"how much source did this\n  // pass touch\" without a per-phase file accountant.\n  emitNeatEvent({\n    type: 'extraction-complete',\n    project: opts.project ?? DEFAULT_PROJECT,\n    payload: {\n      project: opts.project ?? DEFAULT_PROJECT,\n      fileCount: services.length,\n      nodesAdded: result.nodesAdded,\n      edgesAdded: result.edgesAdded,\n    },\n  })\n\n  return result\n}\n","import { existsSync } from 'node:fs'\nimport path from 'node:path'\nimport type { GraphEdge } from '@neat.is/types'\nimport { Provenance } from '@neat.is/types'\nimport type { NeatGraph } from '../graph.js'\n\n// Drop every EXTRACTED edge whose evidence.file matches the given path.\n// Called from watch.ts before re-running an extract phase, so the producer's\n// idempotent re-write recreates only the edges that still apply. Edges from\n// the deleted code stay deleted. See docs/contracts/static-extraction.md\n// §Ghost-edge cleanup. Mutation authority lives under extract/* per\n// ADR-030, so the dropEdge call must happen here, not in watch.ts.\nexport function retireEdgesByFile(graph: NeatGraph, file: string): number {\n  const normalized = file.split('\\\\').join('/')\n  const toDrop: string[] = []\n  graph.forEachEdge((id, attrs) => {\n    const edge = attrs as GraphEdge\n    if (edge.provenance !== Provenance.EXTRACTED) return\n    if (!edge.evidence?.file) return\n    if (edge.evidence.file === normalized) toDrop.push(id)\n  })\n  for (const id of toDrop) graph.dropEdge(id)\n  return toDrop.length\n}\n\n// #140 — full-pass cleanup. Walk every EXTRACTED edge in the graph; if its\n// `evidence.file` cannot be resolved on disk against the scan root or any\n// discovered service directory, drop it. extractFromDirectory calls this at\n// the end of every pass so a daemon bootstrap (or a re-init after the\n// operator deleted some source) gets a snapshot consistent with what's\n// actually on disk.\n//\n// Handles the deleted-file half of the ghost-edge bug. The edited-file half\n// (file still exists, producer no longer emits the edge) is handled by\n// watch.ts's per-file `retireEdgesByFile` on the mtime trigger.\n//\n// Path resolution is tolerant: producers in this tree are inconsistent about\n// whether `evidence.file` is scanPath-relative (configs, databases, infra)\n// or service-dir-relative (calls/*). We try every candidate base before\n// concluding the file is gone — the cost is one extra `existsSync` per\n// service dir per ghost candidate, which is cheap.\nexport function retireExtractedEdgesByMissingFile(\n  graph: NeatGraph,\n  scanPath: string,\n  serviceDirs: readonly string[] = [],\n): number {\n  const toDrop: string[] = []\n  const bases = [scanPath, ...serviceDirs]\n  graph.forEachEdge((id, attrs) => {\n    const edge = attrs as GraphEdge\n    if (edge.provenance !== Provenance.EXTRACTED) return\n    const evidenceFile = edge.evidence?.file\n    if (!evidenceFile) return\n    if (path.isAbsolute(evidenceFile)) {\n      if (!existsSync(evidenceFile)) toDrop.push(id)\n      return\n    }\n    // Tolerant: the file is \"present\" if any base resolves it.\n    const found = bases.some((base) => existsSync(path.join(base, evidenceFile)))\n    if (!found) toDrop.push(id)\n  })\n  for (const id of toDrop) graph.dropEdge(id)\n  return toDrop.length\n}\n","import { promises as fs } from 'node:fs'\nimport path from 'node:path'\nimport type { NeatGraph } from './graph.js'\n\nconst SCHEMA_VERSION = 2\n\ninterface PersistedGraph {\n  schemaVersion: number\n  exportedAt: string\n  graph: ReturnType<NeatGraph['export']>\n}\n\n// v1 → v2: ServiceNode shed `pgDriverVersion` (ADR-019). Compat traversal reads\n// `dependencies[driver]` instead. Strip the field from any v1 snapshot rather\n// than hard-failing — a stale snapshot on disk shouldn't cost a re-extract.\nfunction migrateV1ToV2(payload: PersistedGraph): PersistedGraph {\n  const nodes = (payload.graph as { nodes?: Array<{ attributes?: Record<string, unknown> }> })\n    .nodes\n  if (Array.isArray(nodes)) {\n    for (const node of nodes) {\n      if (node.attributes && 'pgDriverVersion' in node.attributes) {\n        delete node.attributes.pgDriverVersion\n      }\n    }\n  }\n  return { ...payload, schemaVersion: 2 }\n}\n\nasync function ensureDir(filePath: string): Promise<void> {\n  await fs.mkdir(path.dirname(filePath), { recursive: true })\n}\n\nexport async function saveGraphToDisk(graph: NeatGraph, outPath: string): Promise<void> {\n  await ensureDir(outPath)\n  const payload: PersistedGraph = {\n    schemaVersion: SCHEMA_VERSION,\n    exportedAt: new Date().toISOString(),\n    graph: graph.export(),\n  }\n  // Atomic write: drop into <name>.tmp first, then rename. A crash mid-write\n  // leaves the previous snapshot intact instead of a half-truncated file.\n  const tmp = `${outPath}.tmp`\n  await fs.writeFile(tmp, JSON.stringify(payload), 'utf8')\n  await fs.rename(tmp, outPath)\n}\n\nexport async function loadGraphFromDisk(graph: NeatGraph, outPath: string): Promise<void> {\n  let raw: string\n  try {\n    raw = await fs.readFile(outPath, 'utf8')\n  } catch (err) {\n    if ((err as NodeJS.ErrnoException).code === 'ENOENT') return\n    throw err\n  }\n  let payload = JSON.parse(raw) as PersistedGraph\n  if (payload.schemaVersion === 1) {\n    payload = migrateV1ToV2(payload)\n  }\n  if (payload.schemaVersion !== SCHEMA_VERSION) {\n    throw new Error(\n      `persist: unsupported snapshot schemaVersion ${payload.schemaVersion} (expected ${SCHEMA_VERSION})`,\n    )\n  }\n  graph.clear()\n  graph.import(payload.graph)\n}\n\n// Periodic save + best-effort save on SIGTERM/SIGINT. Returns a cleanup that\n// clears the interval and unhooks the signal handlers — important for tests so\n// they don't keep the process alive.\nexport function startPersistLoop(\n  graph: NeatGraph,\n  outPath: string,\n  intervalMs = 60_000,\n): () => void {\n  let stopped = false\n\n  const tick = async (): Promise<void> => {\n    if (stopped) return\n    try {\n      await saveGraphToDisk(graph, outPath)\n    } catch (err) {\n      console.error('persist: periodic save failed', err)\n    }\n  }\n\n  const interval = setInterval(() => {\n    void tick()\n  }, intervalMs)\n\n  const onSignal = (signal: NodeJS.Signals): void => {\n    void (async () => {\n      try {\n        await saveGraphToDisk(graph, outPath)\n      } catch (err) {\n        console.error(`persist: ${signal} save failed`, err)\n      } finally {\n        process.exit(0)\n      }\n    })()\n  }\n\n  process.on('SIGTERM', onSignal)\n  process.on('SIGINT', onSignal)\n\n  return () => {\n    stopped = true\n    clearInterval(interval)\n    process.off('SIGTERM', onSignal)\n    process.off('SIGINT', onSignal)\n  }\n}\n","import { promises as fs } from 'node:fs'\nimport type { GraphEdge, GraphNode } from '@neat.is/types'\nimport type { NeatGraph } from './graph.js'\n\n// Diff a snapshot on disk (or fetched over HTTP) against the live in-memory\n// graph. The \"base\" is the snapshot you supplied; the \"current\" is whatever\n// the server has loaded right now. Symmetric in shape, but consumers usually\n// want to read it as \"what changed since base.\"\n//\n// The shape mirrors the issue's spec (#77):\n//   { added: { nodes, edges }, removed: { nodes, edges },\n//     changed: { nodes: [{id, before, after}], edges: [{id, before, after}] } }\n//\n// Both timestamps are echoed back so the caller doesn't have to track them\n// separately.\n\ninterface PersistedNodeEntry {\n  key?: string\n  attributes?: Record<string, unknown>\n}\n\ninterface PersistedEdgeEntry {\n  key?: string\n  source?: string\n  target?: string\n  attributes?: Record<string, unknown>\n}\n\nexport interface PersistedSnapshot {\n  schemaVersion?: number\n  exportedAt?: string\n  graph?: {\n    nodes?: PersistedNodeEntry[]\n    edges?: PersistedEdgeEntry[]\n  }\n}\n\nexport interface GraphDiff {\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 loadSnapshotForDiff(target: string): Promise<PersistedSnapshot> {\n  if (/^https?:\\/\\//i.test(target)) {\n    const res = await fetch(target)\n    if (!res.ok) {\n      throw new Error(`fetch ${target} failed: ${res.status} ${res.statusText}`)\n    }\n    return (await res.json()) as PersistedSnapshot\n  }\n  const raw = await fs.readFile(target, 'utf8')\n  return JSON.parse(raw) as PersistedSnapshot\n}\n\nfunction indexEntries<T>(\n  entries: { key?: string; attributes?: Record<string, unknown> }[] | undefined,\n): Map<string, T> {\n  const m = new Map<string, T>()\n  if (!entries) return m\n  for (const entry of entries) {\n    const id = (entry.attributes?.id as string | undefined) ?? entry.key\n    if (!id) continue\n    m.set(id, entry.attributes as T)\n  }\n  return m\n}\n\nexport function computeGraphDiff(\n  liveGraph: NeatGraph,\n  baseSnapshot: PersistedSnapshot,\n  currentExportedAt: string = new Date().toISOString(),\n): GraphDiff {\n  const baseNodes = indexEntries<GraphNode>(baseSnapshot.graph?.nodes)\n  const baseEdges = indexEntries<GraphEdge>(baseSnapshot.graph?.edges)\n\n  const liveNodes = new Map<string, GraphNode>()\n  liveGraph.forEachNode((id, attrs) => liveNodes.set(id, attrs as GraphNode))\n  const liveEdges = new Map<string, GraphEdge>()\n  liveGraph.forEachEdge((id, attrs) => liveEdges.set(id, attrs as GraphEdge))\n\n  const result: GraphDiff = {\n    base: { exportedAt: baseSnapshot.exportedAt },\n    current: { exportedAt: currentExportedAt },\n    added: { nodes: [], edges: [] },\n    removed: { nodes: [], edges: [] },\n    changed: { nodes: [], edges: [] },\n  }\n\n  for (const [id, after] of liveNodes) {\n    const before = baseNodes.get(id)\n    if (!before) {\n      result.added.nodes.push(after)\n    } else if (!shallowEqual(before, after)) {\n      result.changed.nodes.push({ id, before, after })\n    }\n  }\n  for (const [id, before] of baseNodes) {\n    if (!liveNodes.has(id)) result.removed.nodes.push(before)\n  }\n  for (const [id, after] of liveEdges) {\n    const before = baseEdges.get(id)\n    if (!before) {\n      result.added.edges.push(after)\n    } else if (!shallowEqual(before, after)) {\n      result.changed.edges.push({ id, before, after })\n    }\n  }\n  for (const [id, before] of baseEdges) {\n    if (!liveEdges.has(id)) result.removed.edges.push(before)\n  }\n\n  return result\n}\n\n// Stable JSON comparison. Snapshot order isn't guaranteed, so canonicalising\n// keys before stringify keeps the comparison robust against re-ordered fields.\nfunction shallowEqual(a: unknown, b: unknown): boolean {\n  return canonicalJson(a) === canonicalJson(b)\n}\n\nfunction canonicalJson(value: unknown): string {\n  return JSON.stringify(value, (_key, v) => {\n    if (v && typeof v === 'object' && !Array.isArray(v)) {\n      return Object.keys(v as Record<string, unknown>)\n        .sort()\n        .reduce<Record<string, unknown>>((acc, k) => {\n          acc[k] = (v as Record<string, unknown>)[k]\n          return acc\n        }, {})\n    }\n    return v\n  })\n}\n","// Project registry — owns the per-project state that lives alongside the\n// graph map: snapshot/error/stale paths, scan path, optional search index.\n//\n// Routes use it via `resolve(project)`. Server / watch construct it once at\n// boot and pass it to buildApi. Tests can mock it with a small literal.\n\nimport path from 'node:path'\nimport type { NeatGraph } from './graph.js'\nimport { DEFAULT_PROJECT, getGraph } from './graph.js'\nimport type { SearchIndex } from './search.js'\n\nexport interface ProjectPaths {\n  snapshotPath: string\n  errorsPath: string\n  staleEventsPath: string\n  embeddingsCachePath: string\n  // Policy-violations log per ADR-041 § Append-only ndjson sidecars. Lives\n  // in the same neat-out directory as the other ndjson sidecars; daemons\n  // wire PolicyViolationsLog to it.\n  policyViolationsPath: string\n}\n\n// Default project keeps the legacy filenames so existing M5 / β / γ users\n// see no behaviour change. Named projects fan out by name (ADR-026).\nexport function pathsForProject(project: string, baseDir: string): ProjectPaths {\n  if (project === DEFAULT_PROJECT) {\n    return {\n      snapshotPath: path.join(baseDir, 'graph.json'),\n      errorsPath: path.join(baseDir, 'errors.ndjson'),\n      staleEventsPath: path.join(baseDir, 'stale-events.ndjson'),\n      embeddingsCachePath: path.join(baseDir, 'embeddings.json'),\n      policyViolationsPath: path.join(baseDir, 'policy-violations.ndjson'),\n    }\n  }\n  return {\n    snapshotPath: path.join(baseDir, `${project}.json`),\n    errorsPath: path.join(baseDir, `errors.${project}.ndjson`),\n    staleEventsPath: path.join(baseDir, `stale-events.${project}.ndjson`),\n    embeddingsCachePath: path.join(baseDir, `embeddings.${project}.json`),\n    policyViolationsPath: path.join(baseDir, `policy-violations.${project}.ndjson`),\n  }\n}\n\nexport interface ProjectContext {\n  name: string\n  graph: NeatGraph\n  scanPath?: string\n  paths: ProjectPaths\n  searchIndex?: SearchIndex\n}\n\nexport class Projects {\n  private contexts = new Map<string, ProjectContext>()\n\n  upsert(ctx: ProjectContext): void {\n    this.contexts.set(ctx.name, ctx)\n  }\n\n  set(\n    name: string,\n    init: Omit<ProjectContext, 'name' | 'graph'> & { graph?: NeatGraph },\n  ): ProjectContext {\n    const ctx: ProjectContext = {\n      name,\n      graph: init.graph ?? getGraph(name),\n      scanPath: init.scanPath,\n      paths: init.paths,\n      searchIndex: init.searchIndex,\n    }\n    this.contexts.set(name, ctx)\n    return ctx\n  }\n\n  get(name: string): ProjectContext | undefined {\n    return this.contexts.get(name)\n  }\n\n  has(name: string): boolean {\n    return this.contexts.has(name)\n  }\n\n  list(): string[] {\n    return [...this.contexts.keys()].sort()\n  }\n\n  attachSearchIndex(name: string, index: SearchIndex | undefined): void {\n    const ctx = this.contexts.get(name)\n    if (ctx) ctx.searchIndex = index\n  }\n}\n\n// Parses NEAT_PROJECTS=a,b,c; trims whitespace, drops empty entries.\n// `default` is implicit (always loaded), so callers usually filter it out\n// before iterating extra projects.\nexport function parseExtraProjects(raw: string | undefined): string[] {\n  if (!raw) return []\n  return raw\n    .split(',')\n    .map((p) => p.trim())\n    .filter((p) => p.length > 0 && p !== DEFAULT_PROJECT)\n}\n","/**\n * Machine-level project registry (ADR-048).\n *\n * One file: `~/.neat/projects.json`. Per-user, machine-local. Not synced.\n * `registry.ts` is the only module that opens it. Everything else — `init`,\n * `daemon`, `cli` — calls into the helpers below.\n *\n * Two safety properties matter:\n *  1. Atomic writes. We tmp + fsync + rename so the daemon never sees a torn\n *     file when init races against it.\n *  2. Cross-process exclusion. We hold an exclusive lock on\n *     `~/.neat/projects.json.lock` for the read-modify-write window. Two\n *     concurrent `neat init` runs cannot both win and overwrite each other.\n *\n * The lock is a file we exclusively-create (`O_EXCL`), hold while we mutate,\n * and unlink on the way out. Crude but cross-platform; matches what\n * `proper-lockfile` does internally without pulling the dep in.\n */\n\nimport { promises as fs } from 'node:fs'\nimport os from 'node:os'\nimport path from 'node:path'\nimport {\n  RegistryFileSchema,\n  type RegistryEntry,\n  type RegistryFile,\n  type RegistryStatus,\n} from '@neat.is/types'\n\nconst LOCK_TIMEOUT_MS = 5_000\nconst LOCK_RETRY_MS = 50\n\n// Resolve `~/.neat/` per call so tests can override `HOME` / `NEAT_HOME`\n// before each run without module-load order mattering.\nfunction neatHome(): string {\n  const override = process.env.NEAT_HOME\n  if (override && override.length > 0) return path.resolve(override)\n  return path.join(os.homedir(), '.neat')\n}\n\nexport function registryPath(): string {\n  return path.join(neatHome(), 'projects.json')\n}\n\nexport function registryLockPath(): string {\n  return path.join(neatHome(), 'projects.json.lock')\n}\n\n/**\n * Path normalisation per ADR-048 #7. Two `init` calls from different relative\n * paths to the same dir must collapse to one entry. `path.resolve` handles\n * relative-to-cwd; we pass it through `fs.realpath` when the dir exists so\n * symlinked paths land on the same canonical entry too.\n */\nexport async function normalizeProjectPath(input: string): Promise<string> {\n  const resolved = path.resolve(input)\n  try {\n    return await fs.realpath(resolved)\n  } catch {\n    return resolved\n  }\n}\n\n/**\n * tmp + fsync + rename. The fsync on the data fd guarantees the bytes are on\n * disk before rename swaps the inode; rename itself is atomic on POSIX.\n *\n * Exported so the init flow and test harnesses can use the same helper.\n */\nexport async function writeAtomically(target: string, contents: string): Promise<void> {\n  await fs.mkdir(path.dirname(target), { recursive: true })\n  const tmp = `${target}.${process.pid}.${Date.now()}.${Math.random().toString(36).slice(2, 8)}.tmp`\n  const fd = await fs.open(tmp, 'w')\n  try {\n    await fd.writeFile(contents, 'utf8')\n    await fd.sync()\n  } finally {\n    await fd.close()\n  }\n  await fs.rename(tmp, target)\n}\n\nasync function acquireLock(lockPath: string, timeoutMs: number = LOCK_TIMEOUT_MS): Promise<void> {\n  const deadline = Date.now() + timeoutMs\n  await fs.mkdir(path.dirname(lockPath), { recursive: true })\n  while (true) {\n    try {\n      const fd = await fs.open(lockPath, 'wx')\n      await fd.close()\n      return\n    } catch (err) {\n      const code = (err as NodeJS.ErrnoException).code\n      if (code !== 'EEXIST') throw err\n      if (Date.now() >= deadline) {\n        throw new Error(\n          `neat registry: timed out after ${timeoutMs}ms waiting for ${lockPath}. ` +\n            `Another neat process is holding the lock; if no such process exists, remove the file by hand.`,\n        )\n      }\n      await new Promise((r) => setTimeout(r, LOCK_RETRY_MS))\n    }\n  }\n}\n\nasync function releaseLock(lockPath: string): Promise<void> {\n  await fs.unlink(lockPath).catch(() => {})\n}\n\nasync function withLock<T>(fn: () => Promise<T>): Promise<T> {\n  const lock = registryLockPath()\n  await acquireLock(lock)\n  try {\n    return await fn()\n  } finally {\n    await releaseLock(lock)\n  }\n}\n\n/**\n * Read the registry from disk. Returns an empty registry if the file does\n * not exist yet — first run, never registered anything.\n *\n * Throws on parse / schema errors. The contract is single-source-of-truth;\n * a corrupt file is louder than a silent reset.\n */\nexport async function readRegistry(): Promise<RegistryFile> {\n  const file = registryPath()\n  let raw: string\n  try {\n    raw = await fs.readFile(file, 'utf8')\n  } catch (err) {\n    if ((err as NodeJS.ErrnoException).code === 'ENOENT') {\n      return { version: 1, projects: [] }\n    }\n    throw err\n  }\n  const parsed = JSON.parse(raw)\n  return RegistryFileSchema.parse(parsed)\n}\n\nasync function writeRegistry(reg: RegistryFile): Promise<void> {\n  // Re-parse before writing to surface schema drift introduced by callers\n  // mutating the in-memory object directly.\n  const validated = RegistryFileSchema.parse(reg)\n  await writeAtomically(registryPath(), JSON.stringify(validated, null, 2) + '\\n')\n}\n\nexport interface AddProjectOptions {\n  name: string\n  path: string\n  languages?: string[]\n  status?: RegistryStatus\n}\n\nexport class ProjectNameCollisionError extends Error {\n  readonly projectName: string\n  constructor(name: string) {\n    super(`neat registry: a project named \"${name}\" is already registered`)\n    this.name = 'ProjectNameCollisionError'\n    this.projectName = name\n  }\n}\n\n/**\n * Register a project, or update its `lastSeenAt` if the same path is already\n * registered under the same name (idempotent re-init).\n *\n * Hard error on name collision against a different path — ADR-046 #7. The\n * caller can recover by passing `--project <new-name>`.\n */\nexport async function addProject(opts: AddProjectOptions): Promise<RegistryEntry> {\n  const resolvedPath = await normalizeProjectPath(opts.path)\n  return withLock(async () => {\n    const reg = await readRegistry()\n    const byName = reg.projects.find((p) => p.name === opts.name)\n    const byPath = reg.projects.find((p) => p.path === resolvedPath)\n\n    if (byName && byName.path !== resolvedPath) {\n      throw new ProjectNameCollisionError(opts.name)\n    }\n\n    const now = new Date().toISOString()\n\n    if (byName && byName.path === resolvedPath) {\n      // Idempotent re-register: same name, same path. Refresh languages /\n      // status if the caller passed new ones.\n      byName.lastSeenAt = now\n      if (opts.languages) byName.languages = opts.languages\n      if (opts.status) byName.status = opts.status\n      await writeRegistry(reg)\n      return byName\n    }\n\n    if (byPath && byPath.name !== opts.name) {\n      // Same dir already registered under a different name. Treat as a\n      // collision so the user is forced to decide which name wins.\n      throw new ProjectNameCollisionError(byPath.name)\n    }\n\n    const entry: RegistryEntry = {\n      name: opts.name,\n      path: resolvedPath,\n      registeredAt: now,\n      languages: opts.languages ?? [],\n      status: opts.status ?? 'active',\n    }\n    reg.projects.push(entry)\n    await writeRegistry(reg)\n    return entry\n  })\n}\n\nexport async function getProject(name: string): Promise<RegistryEntry | undefined> {\n  const reg = await readRegistry()\n  return reg.projects.find((p) => p.name === name)\n}\n\nexport async function listProjects(): Promise<RegistryEntry[]> {\n  const reg = await readRegistry()\n  return reg.projects\n}\n\nexport async function setStatus(name: string, status: RegistryStatus): Promise<RegistryEntry> {\n  return withLock(async () => {\n    const reg = await readRegistry()\n    const entry = reg.projects.find((p) => p.name === name)\n    if (!entry) throw new Error(`neat registry: no project named \"${name}\"`)\n    entry.status = status\n    await writeRegistry(reg)\n    return entry\n  })\n}\n\nexport async function touchLastSeen(name: string, at: string = new Date().toISOString()): Promise<void> {\n  await withLock(async () => {\n    const reg = await readRegistry()\n    const entry = reg.projects.find((p) => p.name === name)\n    if (!entry) return\n    entry.lastSeenAt = at\n    await writeRegistry(reg)\n  })\n}\n\n/**\n * Remove the registry entry for `name`. Per ADR-048 #6: this only removes the\n * registry row. It does **not** touch `neat-out/`, `policy.json`, or any user\n * file in the project directory. SDK-install rollback is a separate flow\n * (`neat-rollback.patch`) that the caller opts in to.\n */\nexport async function removeProject(name: string): Promise<RegistryEntry | undefined> {\n  return withLock(async () => {\n    const reg = await readRegistry()\n    const idx = reg.projects.findIndex((p) => p.name === name)\n    if (idx < 0) return undefined\n    const [removed] = reg.projects.splice(idx, 1)\n    await writeRegistry(reg)\n    return removed\n  })\n}\n\n","import Fastify, {\n  type FastifyInstance,\n  type FastifyReply,\n  type FastifyRequest,\n} from 'fastify'\nimport cors from '@fastify/cors'\nimport type {\n  ErrorEvent,\n  GraphEdge,\n  GraphNode,\n  Policy,\n  PolicyViolation,\n} from '@neat.is/types'\nimport { DivergenceTypeSchema, PoliciesCheckBodySchema, PolicySeveritySchema } from '@neat.is/types'\nimport type { DivergenceType } from '@neat.is/types'\nimport { computeDivergences } from './divergences.js'\nimport {\n  evaluateAllPolicies,\n  loadPolicyFile,\n  PolicyViolationsLog,\n} from './policy.js'\nimport type { NeatGraph } from './graph.js'\nimport { DEFAULT_PROJECT } from './graph.js'\nimport { extractFromDirectory } from './extract.js'\nimport { readErrorEvents, readStaleEvents } from './ingest.js'\nimport {\n  getBlastRadius,\n  getRootCause,\n  getTransitiveDependencies,\n  TRANSITIVE_DEPENDENCIES_DEFAULT_DEPTH,\n  TRANSITIVE_DEPENDENCIES_MAX_DEPTH,\n} from './traverse.js'\nimport { computeGraphDiff, loadSnapshotForDiff } from './diff.js'\nimport type { SearchIndex } from './search.js'\nimport type { Projects, ProjectContext } from './projects.js'\nimport { Projects as ProjectsClass, pathsForProject } from './projects.js'\nimport { getProject as getRegistryProject, listProjects as listRegistryProjects } from './registry.js'\nimport { handleSse } from './streaming.js'\n\nexport interface BuildApiOptions {\n  // Multi-project shape. Optional — when absent we synthesise a single-\n  // project registry from the legacy fields below so existing callers\n  // (mainly tests) keep working unchanged.\n  projects?: Projects\n  startedAt?: number\n\n  // Legacy single-project shape. Mapped to project=`default` if `projects`\n  // isn't provided.\n  graph?: NeatGraph\n  scanPath?: string\n  errorsPath?: string\n  staleEventsPath?: string\n  searchIndex?: SearchIndex\n}\n\ninterface SerializedGraph {\n  nodes: GraphNode[]\n  edges: GraphEdge[]\n}\n\nfunction serializeGraph(graph: NeatGraph): SerializedGraph {\n  const nodes: GraphNode[] = []\n  graph.forEachNode((_id, attrs) => {\n    nodes.push(attrs)\n  })\n  const edges: GraphEdge[] = []\n  graph.forEachEdge((_id, attrs) => {\n    edges.push(attrs)\n  })\n  return { nodes, edges }\n}\n\nfunction projectFromReq(req: FastifyRequest): string {\n  // `:project` is optional in the URL — the request hits either\n  // /projects/:project/X or /X (which means default). Coerce the missing\n  // param to DEFAULT_PROJECT here so handlers don't repeat the fallback.\n  const params = req.params as { project?: string }\n  return params.project ?? DEFAULT_PROJECT\n}\n\nfunction resolveProject(\n  registry: Projects,\n  req: FastifyRequest,\n  reply: FastifyReply,\n): ProjectContext | null {\n  const name = projectFromReq(req)\n  const ctx = registry.get(name)\n  if (!ctx) {\n    void reply.code(404).send({ error: 'project not found', project: name })\n    return null\n  }\n  return ctx\n}\n\nfunction buildLegacyRegistry(opts: BuildApiOptions): Projects {\n  if (opts.projects) return opts.projects\n  if (!opts.graph) {\n    throw new Error('buildApi: either `projects` or `graph` must be provided')\n  }\n  const registry = new ProjectsClass()\n  // pathsForProject only matters here for the snapshot/embeddings paths\n  // routes never read; the ingest paths come from explicit options below.\n  const paths = pathsForProject(DEFAULT_PROJECT, '')\n  registry.set(DEFAULT_PROJECT, {\n    graph: opts.graph,\n    scanPath: opts.scanPath,\n    paths: {\n      snapshotPath: paths.snapshotPath,\n      errorsPath: opts.errorsPath ?? paths.errorsPath,\n      staleEventsPath: opts.staleEventsPath ?? paths.staleEventsPath,\n      embeddingsCachePath: paths.embeddingsCachePath,\n      policyViolationsPath: paths.policyViolationsPath,\n    },\n    searchIndex: opts.searchIndex,\n  })\n  return registry\n}\n\ninterface RouteContext {\n  registry: Projects\n  startedAt: number\n  // Legacy callers passed `errorsPath`/`staleEventsPath` explicitly and\n  // expected absent values to disable the read. Track that intent so the\n  // /incidents handlers don't accidentally read a phantom file.\n  errorsPathFor: (ctx: ProjectContext) => string | undefined\n  staleEventsPathFor: (ctx: ProjectContext) => string | undefined\n  // policy.json lives at the project root (per ADR-042 §File location), not\n  // under neat-out/. Routes that read it map a project context to the path.\n  policyFilePathFor: (ctx: ProjectContext) => string | undefined\n}\n\n// Registers every project-scoped route on `scope`. Called twice from\n// buildApi: once on the root app (so /graph etc. land at default), once\n// inside a `register(_, { prefix: '/projects/:project' })` plugin so the\n// same handlers run when the URL names a project explicitly.\nfunction registerRoutes(scope: FastifyInstance, ctx: RouteContext): void {\n  const { registry, startedAt, errorsPathFor, staleEventsPathFor } = ctx\n\n  // SSE event stream (ADR-051 #1). Dual-mounted: hits /events for default\n  // project and /projects/:project/events when scoped. The handler keeps\n  // the connection open and writes one frame per bus envelope whose\n  // `project` matches.\n  scope.get<{ Params: { project?: string } }>('/events', (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    handleSse(req, reply, { project: proj.name })\n  })\n\n  scope.get<{ Params: { project?: string } }>('/health', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const uptimeMs = Date.now() - startedAt\n    return {\n      ok: true,\n      project: proj.name,\n      uptimeMs,\n      // Legacy fields kept additively. The web shell's StatusBar reads\n      // nodeCount / edgeCount; ADR-061's HealthResponseSchema validates\n      // the canonical triple and lets the extras pass through.\n      uptime: Math.floor(uptimeMs / 1000),\n      nodeCount: proj.graph.order,\n      edgeCount: proj.graph.size,\n      lastUpdated: new Date().toISOString(),\n    }\n  })\n\n  scope.get<{ Params: { project?: string } }>('/graph', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    return serializeGraph(proj.graph)\n  })\n\n  scope.get<{ Params: { project?: string; id: string } }>(\n    '/graph/node/:id',\n    async (req, reply) => {\n      const proj = resolveProject(registry, req, reply)\n      if (!proj) return\n      const { id } = req.params\n      if (!proj.graph.hasNode(id)) {\n        return reply.code(404).send({ error: 'node not found', id })\n      }\n      return { node: proj.graph.getNodeAttributes(id) as GraphNode }\n    },\n  )\n\n  scope.get<{ Params: { project?: string; id: string } }>(\n    '/graph/edges/:id',\n    async (req, reply) => {\n      const proj = resolveProject(registry, req, reply)\n      if (!proj) return\n      const { id } = req.params\n      if (!proj.graph.hasNode(id)) {\n        return reply.code(404).send({ error: 'node not found', id })\n      }\n      const inbound = proj.graph\n        .inboundEdges(id)\n        .map((e) => proj.graph.getEdgeAttributes(e) as GraphEdge)\n      const outbound = proj.graph\n        .outboundEdges(id)\n        .map((e) => proj.graph.getEdgeAttributes(e) as GraphEdge)\n      return { inbound, outbound }\n    },\n  )\n\n  // Transitive dependencies (issue #144). BFS outbound to depth N, returning\n  // a flat list with distance + edgeType + provenance per dependency.\n  // Default depth 3, max 10. The MCP get_dependencies tool calls this.\n  scope.get<{\n    Params: { project?: string; nodeId: string }\n    Querystring: { depth?: string }\n  }>('/graph/dependencies/:nodeId', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const { nodeId } = req.params\n    if (!proj.graph.hasNode(nodeId)) {\n      return reply.code(404).send({ error: 'node not found', id: nodeId })\n    }\n    const depth = req.query.depth ? Number(req.query.depth) : TRANSITIVE_DEPENDENCIES_DEFAULT_DEPTH\n    if (!Number.isFinite(depth) || depth < 1 || depth > TRANSITIVE_DEPENDENCIES_MAX_DEPTH) {\n      return reply.code(400).send({\n        error: `depth must be an integer in [1, ${TRANSITIVE_DEPENDENCIES_MAX_DEPTH}]`,\n      })\n    }\n    return getTransitiveDependencies(proj.graph, nodeId, depth)\n  })\n\n  // Divergence query — the thesis surface (ADR-060). Read-only, derived,\n  // dual-mounted via registerRoutes. Query params filter the result set;\n  // body shape is DivergenceResult.\n  scope.get<{\n    Params: { project?: string }\n    Querystring: { type?: string; minConfidence?: string; node?: string }\n  }>('/graph/divergences', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    let typeFilter: Set<DivergenceType> | undefined\n    if (req.query.type) {\n      const candidates = req.query.type\n        .split(',')\n        .map((s) => s.trim())\n        .filter((s) => s.length > 0)\n      const parsed: DivergenceType[] = []\n      for (const c of candidates) {\n        const r = DivergenceTypeSchema.safeParse(c)\n        if (!r.success) {\n          return reply.code(400).send({\n            error: `unknown divergence type \"${c}\"`,\n            allowed: DivergenceTypeSchema.options,\n          })\n        }\n        parsed.push(r.data)\n      }\n      typeFilter = new Set(parsed)\n    }\n    let minConfidence: number | undefined\n    if (req.query.minConfidence !== undefined) {\n      const n = Number(req.query.minConfidence)\n      if (!Number.isFinite(n) || n < 0 || n > 1) {\n        return reply.code(400).send({\n          error: 'minConfidence must be a number in [0, 1]',\n        })\n      }\n      minConfidence = n\n    }\n    return computeDivergences(proj.graph, {\n      ...(typeFilter ? { type: typeFilter } : {}),\n      ...(minConfidence !== undefined ? { minConfidence } : {}),\n      ...(req.query.node ? { node: req.query.node } : {}),\n    })\n  })\n\n  // ADR-061 envelope rule: list endpoints return { count, total, events }.\n  // `total` is the size of the underlying collection; `count` is the size of\n  // the slice we're handing back. The web shell counts on both.\n  scope.get<{\n    Params: { project?: string }\n    Querystring: { limit?: string }\n  }>('/incidents', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const epath = errorsPathFor(proj)\n    if (!epath) return { count: 0, total: 0, events: [] }\n    const events = await readErrorEvents(epath)\n    const total = events.length\n    const limit = req.query.limit ? Number(req.query.limit) : 50\n    const safeLimit =\n      Number.isFinite(limit) && limit > 0 ? Math.min(limit, 200) : 50\n    const sliced = events.slice(0, safeLimit)\n    return { count: sliced.length, total, events: sliced }\n  })\n\n  scope.get<{\n    Params: { project?: string }\n    Querystring: { limit?: string; edgeType?: string }\n  }>('/stale-events', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const spath = staleEventsPathFor(proj)\n    if (!spath) return { count: 0, total: 0, events: [] }\n    const events = await readStaleEvents(spath)\n    const filtered = req.query.edgeType\n      ? events.filter((e) => e.edgeType === req.query.edgeType)\n      : events\n    const ordered = [...filtered].reverse()\n    const total = ordered.length\n    const limit = req.query.limit ? Number(req.query.limit) : 50\n    const sliced = ordered.slice(0, Number.isFinite(limit) && limit > 0 ? limit : 50)\n    return { count: sliced.length, total, events: sliced }\n  })\n\n  scope.get<{ Params: { project?: string; nodeId: string } }>(\n    '/incidents/:nodeId',\n    async (req, reply) => {\n      const proj = resolveProject(registry, req, reply)\n      if (!proj) return\n      const { nodeId } = req.params\n      if (!proj.graph.hasNode(nodeId)) {\n        return reply.code(404).send({ error: 'node not found', id: nodeId })\n      }\n      const epath = errorsPathFor(proj)\n      if (!epath) return { count: 0, total: 0, events: [] }\n      const events = await readErrorEvents(epath)\n      const filtered = events.filter(\n        (e) =>\n          e.affectedNode === nodeId || e.service === nodeId.replace(/^service:/, ''),\n      )\n      return { count: filtered.length, total: filtered.length, events: filtered }\n    },\n  )\n\n  scope.get<{\n    Params: { project?: string; nodeId: string }\n    Querystring: { errorId?: string }\n  }>('/graph/root-cause/:nodeId', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const { nodeId } = req.params\n    if (!proj.graph.hasNode(nodeId)) {\n      return reply.code(404).send({ error: 'node not found', id: nodeId })\n    }\n    let errorEvent: ErrorEvent | undefined\n    const epath = errorsPathFor(proj)\n    if (req.query.errorId && epath) {\n      const events = await readErrorEvents(epath)\n      errorEvent = events.find((e) => e.id === req.query.errorId)\n      if (!errorEvent) {\n        return reply\n          .code(404)\n          .send({ error: 'error event not found', id: req.query.errorId })\n      }\n    }\n    const result = getRootCause(proj.graph, nodeId, errorEvent)\n    if (!result) return reply.code(404).send({ error: 'no root cause found', id: nodeId })\n    return result\n  })\n\n  scope.get<{\n    Params: { project?: string; nodeId: string }\n    Querystring: { depth?: string }\n  }>('/graph/blast-radius/:nodeId', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const { nodeId } = req.params\n    if (!proj.graph.hasNode(nodeId)) {\n      return reply.code(404).send({ error: 'node not found', id: nodeId })\n    }\n    const depth = req.query.depth ? Number(req.query.depth) : undefined\n    if (depth !== undefined && (!Number.isFinite(depth) || depth < 0)) {\n      return reply.code(400).send({ error: 'depth must be a non-negative number' })\n    }\n    return getBlastRadius(proj.graph, nodeId, depth)\n  })\n\n  scope.get<{\n    Params: { project?: string }\n    Querystring: { q?: string; limit?: string }\n  }>('/search', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const raw = (req.query.q ?? '').trim()\n    if (!raw) return reply.code(400).send({ error: 'query parameter `q` is required' })\n    const limit = req.query.limit ? Number(req.query.limit) : undefined\n    const safeLimit =\n      limit !== undefined && Number.isFinite(limit) && limit > 0 ? limit : undefined\n    if (proj.searchIndex) {\n      const result = await proj.searchIndex.search(raw, safeLimit)\n      return {\n        query: result.query,\n        provider: result.provider,\n        matches: result.matches.map((m) => ({ ...m.node, score: m.score })),\n      }\n    }\n    const q = raw.toLowerCase()\n    const matches: (GraphNode & { score: number })[] = []\n    proj.graph.forEachNode((id, attrs) => {\n      const name = (attrs as { name?: string }).name ?? ''\n      if (id.toLowerCase().includes(q) || name.toLowerCase().includes(q)) {\n        matches.push({ ...(attrs as GraphNode), score: 1 })\n      }\n    })\n    return {\n      query: q,\n      provider: 'substring' as const,\n      matches: matches.slice(0, safeLimit),\n    }\n  })\n\n  scope.get<{ Params: { project?: string }; Querystring: { against?: string } }>(\n    '/graph/diff',\n    async (req, reply) => {\n      const proj = resolveProject(registry, req, reply)\n      if (!proj) return\n      const against = req.query.against\n      if (!against) {\n        return reply.code(400).send({ error: 'query parameter `against` is required' })\n      }\n      try {\n        const snapshot = await loadSnapshotForDiff(against)\n        return computeGraphDiff(proj.graph, snapshot)\n      } catch (err) {\n        return reply\n          .code(400)\n          .send({ error: 'failed to load snapshot', against, detail: (err as Error).message })\n      }\n    },\n  )\n\n  scope.post<{ Params: { project?: string } }>('/graph/scan', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    if (!proj.scanPath) {\n      return reply\n        .code(409)\n        .send({ error: 'scan path not configured for this project', project: proj.name })\n    }\n    const result = await extractFromDirectory(proj.graph, proj.scanPath)\n    return {\n      project: proj.name,\n      scanned: proj.scanPath,\n      nodesAdded: result.nodesAdded,\n      edgesAdded: result.edgesAdded,\n      nodeCount: proj.graph.order,\n      edgeCount: proj.graph.size,\n    }\n  })\n\n  // Policy surface (ADR-045 / contract #18). /policies returns the parsed\n  // policy.json; /policies/violations is the persistent log; /policies/check\n  // is dry-run evaluation. All dual-mounted via registerRoutes.\n  scope.get<{ Params: { project?: string } }>('/policies', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const policyPath = ctx.policyFilePathFor(proj)\n    if (!policyPath) {\n      // No policy file configured for this project — return the empty file\n      // shape so consumers don't have to special-case \"no policies yet.\"\n      return { version: 1, policies: [] }\n    }\n    try {\n      const policies = await loadPolicyFile(policyPath)\n      return { version: 1, policies }\n    } catch (err) {\n      return reply.code(400).send({\n        error: 'policy.json failed to parse',\n        details: (err as Error).message,\n      })\n    }\n  })\n\n  scope.get<{\n    Params: { project?: string }\n    Querystring: { severity?: string; policyId?: string }\n  }>('/policies/violations', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const log = new PolicyViolationsLog(proj.paths.policyViolationsPath)\n    let violations = await log.readAll()\n    if (req.query.severity) {\n      const sev = PolicySeveritySchema.safeParse(req.query.severity)\n      if (!sev.success) {\n        return reply.code(400).send({\n          error: 'invalid severity',\n          details: sev.error.format(),\n        })\n      }\n      violations = violations.filter((v) => v.severity === sev.data)\n    }\n    if (req.query.policyId) {\n      violations = violations.filter((v) => v.policyId === req.query.policyId)\n    }\n    return { violations }\n  })\n\n  scope.post<{\n    Params: { project?: string }\n    Body: { hypotheticalAction?: unknown }\n  }>('/policies/check', async (req, reply) => {\n    const proj = resolveProject(registry, req, reply)\n    if (!proj) return\n    const parsed = PoliciesCheckBodySchema.safeParse(req.body ?? {})\n    if (!parsed.success) {\n      return reply.code(400).send({\n        error: 'invalid /policies/check body',\n        details: parsed.error.format(),\n      })\n    }\n\n    const policyPath = ctx.policyFilePathFor(proj)\n    let policies: Policy[] = []\n    if (policyPath) {\n      try {\n        policies = await loadPolicyFile(policyPath)\n      } catch (err) {\n        return reply.code(400).send({\n          error: 'policy.json failed to parse',\n          details: (err as Error).message,\n        })\n      }\n    }\n\n    // No hypothetical → return current violations against the live graph.\n    // With a hypothetical → simulate the action against a deep-copy graph\n    // (avoids mutation authority concerns), evaluate, return the delta.\n    const evalCtx = { now: () => Date.now() }\n    if (!parsed.data.hypotheticalAction) {\n      const violations = evaluateAllPolicies(proj.graph, policies, evalCtx)\n      const blocking = violations.filter((v) => v.onViolation === 'block')\n      return { allowed: blocking.length === 0, violations }\n    }\n\n    // For now the dry-run simulation re-uses evaluateAllPolicies on the\n    // current graph. Full hypothetical simulation (e.g. \"what if I added\n    // this OBSERVED edge?\") is the v0.2.4-δ scope; #117 ships the surface,\n    // #118 fills in the action shapes' simulation logic.\n    const violations = evaluateAllPolicies(proj.graph, policies, evalCtx)\n    const blocking = violations.filter((v) => v.onViolation === 'block')\n    return {\n      allowed: blocking.length === 0,\n      hypotheticalAction: parsed.data.hypotheticalAction,\n      violations,\n    } as { allowed: boolean; hypotheticalAction: unknown; violations: PolicyViolation[] }\n  })\n}\n\nexport async function buildApi(opts: BuildApiOptions): Promise<FastifyInstance> {\n  const app = Fastify({ logger: false })\n  await app.register(cors, { origin: true })\n\n  const startedAt = opts.startedAt ?? Date.now()\n  const registry = buildLegacyRegistry(opts)\n\n  const legacyErrorsExplicit = !opts.projects && opts.errorsPath !== undefined\n  const legacyStaleExplicit = !opts.projects && opts.staleEventsPath !== undefined\n\n  const errorsPathFor = (proj: ProjectContext): string | undefined => {\n    if (proj.name === DEFAULT_PROJECT && !opts.projects) {\n      return legacyErrorsExplicit ? opts.errorsPath : undefined\n    }\n    return proj.paths.errorsPath\n  }\n  const staleEventsPathFor = (proj: ProjectContext): string | undefined => {\n    if (proj.name === DEFAULT_PROJECT && !opts.projects) {\n      return legacyStaleExplicit ? opts.staleEventsPath : undefined\n    }\n    return proj.paths.staleEventsPath\n  }\n\n  // policy.json lives at the project's scanPath root per ADR-042. Without a\n  // scanPath we have nowhere to read it from — those projects show as\n  // \"no policies configured\" via the empty-file response.\n  const policyFilePathFor = (proj: ProjectContext): string | undefined => {\n    if (!proj.scanPath) return undefined\n    return `${proj.scanPath}/policy.json`\n  }\n\n  const routeCtx: RouteContext = {\n    registry,\n    startedAt,\n    errorsPathFor,\n    staleEventsPathFor,\n    policyFilePathFor,\n  }\n\n  // Multi-project switcher (ADR-051 #4). Direct passthrough of the\n  // machine-level registry from registry.ts (ADR-048) — distinct from the\n  // dual-mount routing in ADR-026, which exposes per-project endpoints.\n  // Returns Array<{ name, path, status, registeredAt, lastSeenAt?, languages }>.\n  app.get('/projects', async (_req, reply) => {\n    try {\n      return await listRegistryProjects()\n    } catch (err) {\n      return reply.code(500).send({\n        error: 'failed to read project registry',\n        details: (err as Error).message,\n      })\n    }\n  })\n\n  // Singular project lookup (ADR-061 #7). Distinct route from the\n  // `/projects/:project/...` dual-mount prefix because Fastify matches on\n  // the full path; the trailing-segment-less request lands here.\n  app.get<{ Params: { project: string } }>('/projects/:project', async (req, reply) => {\n    try {\n      const entry = await getRegistryProject(req.params.project)\n      if (!entry) {\n        return reply\n          .code(404)\n          .send({ error: 'project not found', project: req.params.project })\n      }\n      return { project: entry }\n    } catch (err) {\n      return reply.code(500).send({\n        error: 'failed to read project registry',\n        details: (err as Error).message,\n      })\n    }\n  })\n\n  // Default mount: /health, /graph, /incidents, etc. all hit project=default.\n  registerRoutes(app, routeCtx)\n\n  // Project-scoped mount: same handlers, URL params include `:project`.\n  await app.register(\n    async (scope) => {\n      registerRoutes(scope, routeCtx)\n    },\n    { prefix: '/projects/:project' },\n  )\n\n  return app\n}\n","// computeDivergences — the thesis surface, derived (ADR-060).\n//\n// Walks the live graph and surfaces the five locked divergence shapes:\n// missing-observed, missing-extracted, version-mismatch, host-mismatch,\n// and compat-violation. Pure: no I/O, no mutation, no async. The function\n// operates on a NeatGraph reference and returns a fresh DivergenceResult\n// each call — there is no persistence (binding rule 2).\n//\n// Mutation authority (ADR-030 / contract #3) is locked to ingest.ts and\n// extract/*; this module reads only. The contract test\n// `packages/core/test/audits/contracts.test.ts` enforces it.\n\nimport type {\n  CompatRuleRef,\n  Divergence,\n  DivergenceResult,\n  DivergenceType,\n  GraphEdge,\n  GraphNode,\n  ServiceNode,\n} from '@neat.is/types'\nimport {\n  DivergenceResultSchema,\n  EdgeType,\n  NodeType,\n  parseEdgeId,\n  Provenance,\n} from '@neat.is/types'\nimport type { NeatGraph } from './graph.js'\nimport {\n  checkCompatibility,\n  checkDeprecatedApi,\n  compatPairs,\n  deprecatedApis,\n} from './compat.js'\nimport { confidenceForEdge } from './traverse.js'\n\nexport interface DivergenceQueryOpts {\n  // Filter the result to a subset of divergence types. Undefined keeps all\n  // five. Empty set returns nothing.\n  type?: ReadonlySet<DivergenceType>\n  // Drop divergences below this confidence threshold. Undefined keeps all.\n  minConfidence?: number\n  // Scope to divergences that involve this node (as source or target).\n  node?: string\n}\n\n// (source, target, type) → which provenance variants are present. Each\n// bucket is the unit the missing-observed / missing-extracted detectors\n// operate over.\ninterface EdgeBucket {\n  source: string\n  target: string\n  type: GraphEdge['type']\n  extracted?: GraphEdge\n  observed?: GraphEdge\n  inferred?: GraphEdge\n  stale?: GraphEdge\n  frontier?: GraphEdge\n}\n\nfunction bucketKey(source: string, target: string, type: string): string {\n  return `${type}|${source}|${target}`\n}\n\nfunction bucketEdges(graph: NeatGraph): Map<string, EdgeBucket> {\n  const buckets = new Map<string, EdgeBucket>()\n  graph.forEachEdge((id, attrs) => {\n    const e = attrs as GraphEdge\n    const parsed = parseEdgeId(id)\n    // parseEdgeId can fall through to EXTRACTED for unknown shapes — fall\n    // back to the edge's own provenance when the id doesn't parse cleanly.\n    const provenance = parsed?.provenance ?? e.provenance\n    const key = bucketKey(e.source, e.target, e.type)\n    const cur =\n      buckets.get(key) ?? { source: e.source, target: e.target, type: e.type }\n    switch (provenance) {\n      case Provenance.EXTRACTED:\n        cur.extracted = e\n        break\n      case Provenance.OBSERVED:\n        cur.observed = e\n        break\n      case Provenance.INFERRED:\n        cur.inferred = e\n        break\n      case Provenance.FRONTIER:\n        cur.frontier = e\n        break\n      default:\n        // STALE rides on what used to be an OBSERVED edge — the id format\n        // stays OBSERVED per identity.ts, so this branch is mostly defensive.\n        if (e.provenance === Provenance.STALE) cur.stale = e\n    }\n    buckets.set(key, cur)\n  })\n  return buckets\n}\n\nfunction nodeIsFrontier(graph: NeatGraph, nodeId: string): boolean {\n  if (!graph.hasNode(nodeId)) return false\n  const attrs = graph.getNodeAttributes(nodeId) as GraphNode\n  return attrs.type === NodeType.FrontierNode\n}\n\nfunction clampConfidence(n: number): number {\n  if (!Number.isFinite(n)) return 0\n  return Math.max(0, Math.min(1, n))\n}\n\nfunction reasonForMissingObserved(source: string, target: string, type: string): string {\n  return `Code declares ${source} → ${target} (${type}) but no production traffic has been observed for this edge.`\n}\n\nfunction reasonForMissingExtracted(source: string, target: string, type: string): string {\n  return `Production observed ${source} → ${target} (${type}) but static analysis did not surface this edge.`\n}\n\nconst RECOMMENDATION_MISSING_OBSERVED =\n  'Verify the code path is exercised in production; check feature flags or conditional branches that might gate the call.'\nconst RECOMMENDATION_MISSING_EXTRACTED =\n  'Likely dynamic dispatch, reflection, or a coverage gap in tree-sitter extraction. Consider an `aliases` entry on the source service or file an extractor issue.'\nconst RECOMMENDATION_HOST_MISMATCH =\n  'Check environment-specific config overrides — the runtime host differs from what static configuration declares.'\n\n// ADR-066 §4 — reweight against graded confidence.\n//\n// `missing-extracted` (OBSERVED-led) cascades from the OBSERVED edge's\n// graded confidence (signal-block grade per ADR-066 §2). `missing-observed`\n// weights by the EXTRACTED edge's graded confidence (per-extractor grade\n// per ADR-066 §1). Sub-floor EXTRACTED candidates never enter the graph\n// (precision floor, §3) so what surfaces here is backed by structural or\n// verified-call-site evidence.\n//\n// Falls back to confidenceForEdge for legacy edges loaded from a pre-v0.3.4\n// snapshot that don't carry a stored `confidence` field.\nfunction gradedConfidence(edge: GraphEdge): number {\n  if (typeof edge.confidence === 'number') return clampConfidence(edge.confidence)\n  return clampConfidence(confidenceForEdge(edge))\n}\n\nfunction detectMissingDivergences(\n  graph: NeatGraph,\n  bucket: EdgeBucket,\n): Divergence[] {\n  const out: Divergence[] = []\n\n  if (bucket.extracted && !bucket.observed) {\n    // Skip when the would-be target is a FrontierNode — those represent\n    // unresolved span peers, not real entities we expect OBSERVED traffic\n    // to. The coexistence contract is between EXTRACTED and OBSERVED on\n    // real nodes; FRONTIER is unknown territory.\n    if (!nodeIsFrontier(graph, bucket.target)) {\n      // ADR-066 §4 — weight by the EXTRACTED edge's graded confidence.\n      // Substring/hostname-shape candidates already dropped at the precision\n      // floor; what remains is structural or verified-call-site evidence.\n      out.push({\n        type: 'missing-observed',\n        source: bucket.source,\n        target: bucket.target,\n        edgeType: bucket.type,\n        extracted: bucket.extracted,\n        confidence: gradedConfidence(bucket.extracted),\n        reason: reasonForMissingObserved(bucket.source, bucket.target, bucket.type),\n        recommendation: RECOMMENDATION_MISSING_OBSERVED,\n      })\n    }\n  }\n\n  if (bucket.observed && !bucket.extracted) {\n    // ADR-066 §4 — cascade from the OBSERVED edge's graded confidence.\n    // OBSERVED-led finding; the headline divergence type.\n    out.push({\n      type: 'missing-extracted',\n      source: bucket.source,\n      target: bucket.target,\n      edgeType: bucket.type,\n      observed: bucket.observed,\n      confidence: gradedConfidence(bucket.observed),\n      reason: reasonForMissingExtracted(bucket.source, bucket.target, bucket.type),\n      recommendation: RECOMMENDATION_MISSING_EXTRACTED,\n    })\n  }\n\n  return out\n}\n\n// Returns the declared host of the service's static DB target, when\n// recoverable. ServiceNode.dbConnectionTarget is the static-extraction\n// surface for \"this service connects to X\" — `X` is host[:port] or a\n// docker-compose-style service name. Empty / undefined means we have no\n// EXTRACTED host to compare against and host-mismatch can't fire.\nfunction declaredHostFor(svc: ServiceNode): string | null {\n  const raw = svc.dbConnectionTarget?.trim()\n  if (!raw) return null\n  // Strip a trailing port if present so it lines up with DatabaseNode.host\n  // (ADR-028 §6 — DatabaseNode id excludes port).\n  const colon = raw.lastIndexOf(':')\n  if (colon === -1) return raw\n  const port = raw.slice(colon + 1)\n  if (/^\\d+$/.test(port)) return raw.slice(0, colon)\n  return raw\n}\n\nfunction hasExtractedConfiguredBy(graph: NeatGraph, svcId: string): boolean {\n  for (const edgeId of graph.outboundEdges(svcId)) {\n    const e = graph.getEdgeAttributes(edgeId) as GraphEdge\n    if (e.type === EdgeType.CONFIGURED_BY && e.provenance === Provenance.EXTRACTED) {\n      return true\n    }\n  }\n  return false\n}\n\nfunction detectHostMismatch(\n  graph: NeatGraph,\n  svcId: string,\n  svc: ServiceNode,\n): Divergence[] {\n  const declaredHost = declaredHostFor(svc)\n  if (!declaredHost) return []\n  if (!hasExtractedConfiguredBy(graph, svcId)) return []\n\n  const out: Divergence[] = []\n  for (const edgeId of graph.outboundEdges(svcId)) {\n    const edge = graph.getEdgeAttributes(edgeId) as GraphEdge\n    if (edge.type !== EdgeType.CONNECTS_TO) continue\n    if (edge.provenance !== Provenance.OBSERVED) continue\n    const target = graph.getNodeAttributes(edge.target) as GraphNode\n    if (target.type !== NodeType.DatabaseNode) continue\n    const observedHost = target.host?.trim()\n    if (!observedHost) continue\n    if (observedHost === declaredHost) continue\n\n    out.push({\n      type: 'host-mismatch',\n      source: svcId,\n      target: edge.target,\n      extractedHost: declaredHost,\n      observedHost,\n      confidence: clampConfidence(confidenceForEdge(edge)),\n      reason: `Config declares ${svcId} connects to ${declaredHost}; production connects to ${observedHost}.`,\n      recommendation: RECOMMENDATION_HOST_MISMATCH,\n    })\n  }\n  return out\n}\n\nfunction detectCompatDivergences(\n  graph: NeatGraph,\n  svcId: string,\n  svc: ServiceNode,\n): Divergence[] {\n  const out: Divergence[] = []\n  const deps = svc.dependencies ?? {}\n\n  for (const edgeId of graph.outboundEdges(svcId)) {\n    const edge = graph.getEdgeAttributes(edgeId) as GraphEdge\n    if (edge.type !== EdgeType.CONNECTS_TO) continue\n    if (edge.provenance !== Provenance.OBSERVED) continue\n    const target = graph.getNodeAttributes(edge.target) as GraphNode\n    if (target.type !== NodeType.DatabaseNode) continue\n\n    // Driver-engine compat. Definitive — when a rule fires it's a\n    // version-mismatch with confidence 1.0.\n    for (const pair of compatPairs()) {\n      if (pair.engine !== target.engine) continue\n      const declared = deps[pair.driver]\n      if (!declared) continue\n      const result = checkCompatibility(\n        pair.driver,\n        declared,\n        target.engine,\n        target.engineVersion,\n      )\n      if (!result.compatible && result.reason) {\n        out.push({\n          type: 'version-mismatch',\n          source: svcId,\n          target: edge.target,\n          extractedVersion: declared,\n          observedVersion: target.engineVersion,\n          compatibility: 'incompatible',\n          confidence: 1.0,\n          reason: result.reason,\n          recommendation: result.minDriverVersion\n            ? `Upgrade ${pair.driver} to >= ${result.minDriverVersion}.`\n            : `Update the ${pair.driver} driver to a version compatible with ${target.engine} ${target.engineVersion}.`,\n        })\n      }\n    }\n\n    // Deprecated-api compat. Broader than version-mismatch — surfaces as\n    // compat-violation. Driver-engine rules above already covered the\n    // \"version is too low\" shape; deprecated covers \"version is too high\n    // / no longer supported.\"\n    for (const rule of deprecatedApis()) {\n      const declared = deps[rule.package]\n      if (!declared) continue\n      const result = checkDeprecatedApi(rule, declared)\n      if (!result.compatible && result.reason) {\n        const ruleRef: CompatRuleRef = {\n          kind: rule.kind ?? 'deprecated-api',\n          reason: result.reason,\n          package: rule.package,\n        }\n        out.push({\n          type: 'compat-violation',\n          source: svcId,\n          target: edge.target,\n          rule: ruleRef,\n          observed: edge,\n          confidence: 1.0,\n          reason: result.reason,\n          recommendation: `Replace deprecated ${rule.package}@${declared} with a supported version.`,\n        })\n      }\n    }\n  }\n  return out\n}\n\nfunction involvesNode(d: Divergence, nodeId: string): boolean {\n  return d.source === nodeId || d.target === nodeId\n}\n\nexport function computeDivergences(\n  graph: NeatGraph,\n  opts: DivergenceQueryOpts = {},\n): DivergenceResult {\n  const all: Divergence[] = []\n\n  // Pass 1 — bucket every edge and emit missing-observed / missing-extracted.\n  const buckets = bucketEdges(graph)\n  for (const bucket of buckets.values()) {\n    for (const d of detectMissingDivergences(graph, bucket)) all.push(d)\n  }\n\n  // Pass 2 — per-service host + compat rules.\n  graph.forEachNode((nodeId, attrs) => {\n    const n = attrs as GraphNode\n    if (n.type !== NodeType.ServiceNode) return\n    const svc = n as ServiceNode\n    for (const d of detectHostMismatch(graph, nodeId, svc)) all.push(d)\n    for (const d of detectCompatDivergences(graph, nodeId, svc)) all.push(d)\n  })\n\n  // Filter + sort. Higher confidence first; within the same confidence,\n  // stable on (type, source, target) so callers see deterministic output.\n  let filtered = all\n  if (opts.type) {\n    const allowed = opts.type\n    filtered = filtered.filter((d) => allowed.has(d.type))\n  }\n  if (opts.minConfidence !== undefined) {\n    const threshold = opts.minConfidence\n    filtered = filtered.filter((d) => d.confidence >= threshold)\n  }\n  if (opts.node) {\n    const target = opts.node\n    filtered = filtered.filter((d) => involvesNode(d, target))\n  }\n\n  // ADR-066 §4 / §5 — confidence desc; missing-extracted leads\n  // missing-observed at equal confidence (OBSERVED-led tiebreaker); then\n  // stable on (type, source, target).\n  const TYPE_LEADERSHIP: Record<DivergenceType, number> = {\n    'missing-extracted': 0,\n    'missing-observed': 1,\n    'version-mismatch': 2,\n    'host-mismatch': 3,\n    'compat-violation': 4,\n  }\n  filtered.sort((a, b) => {\n    if (b.confidence !== a.confidence) return b.confidence - a.confidence\n    const lead = TYPE_LEADERSHIP[a.type] - TYPE_LEADERSHIP[b.type]\n    if (lead !== 0) return lead\n    if (a.type !== b.type) return a.type.localeCompare(b.type)\n    if (a.source !== b.source) return a.source.localeCompare(b.source)\n    return a.target.localeCompare(b.target)\n  })\n\n  return DivergenceResultSchema.parse({\n    divergences: filtered,\n    totalAffected: filtered.length,\n    computedAt: new Date().toISOString(),\n  })\n}\n","// SSE handler for the frontend-facing event stream (ADR-051 #1).\n// Subscribes to the bus in events.ts, filters by project, writes\n// `event: <type>\\ndata: <json>\\n\\n` frames to the client.\n//\n// Backpressure: per-connection queue cap of 1000 outstanding writes; once\n// hit, the connection is dropped with `event: error data: { reason:\n// 'backpressure' }` per ADR-051 #8. Heartbeat: comment line every 30s\n// keeps proxies from idle-timing out (ADR-051 #3).\n\nimport type { FastifyReply, FastifyRequest } from 'fastify'\nimport {\n  EVENT_BUS_CHANNEL,\n  eventBus,\n  type NeatEventEnvelope,\n} from './events.js'\n\nexport const SSE_HEARTBEAT_MS = 30_000\nexport const SSE_BACKPRESSURE_CAP = 1000\n\nexport interface HandleSseOptions {\n  project: string\n  heartbeatMs?: number\n  backpressureCap?: number\n}\n\nexport function handleSse(\n  req: FastifyRequest,\n  reply: FastifyReply,\n  opts: HandleSseOptions,\n): void {\n  const heartbeatMs = opts.heartbeatMs ?? SSE_HEARTBEAT_MS\n  const backpressureCap = opts.backpressureCap ?? SSE_BACKPRESSURE_CAP\n\n  reply.raw.setHeader('Content-Type', 'text/event-stream')\n  reply.raw.setHeader('Cache-Control', 'no-cache, no-transform')\n  reply.raw.setHeader('Connection', 'keep-alive')\n  reply.raw.setHeader('X-Accel-Buffering', 'no')\n  reply.raw.flushHeaders?.()\n\n  let pending = 0\n  let dropped = false\n\n  const closeConnection = (): void => {\n    if (dropped) return\n    dropped = true\n    eventBus.off(EVENT_BUS_CHANNEL, listener)\n    clearInterval(heartbeat)\n    if (!reply.raw.writableEnded) reply.raw.end()\n  }\n\n  const writeFrame = (frame: string): void => {\n    if (dropped) return\n    if (pending >= backpressureCap) {\n      // Past the cap — emit one final error frame and drop. Don't try to\n      // gracefully drain; a slow consumer that's already 1000 frames behind\n      // is not going to catch up.\n      const errFrame = `event: error\\ndata: ${JSON.stringify({ reason: 'backpressure' })}\\n\\n`\n      reply.raw.write(errFrame)\n      closeConnection()\n      return\n    }\n    pending++\n    reply.raw.write(frame, () => {\n      pending = Math.max(0, pending - 1)\n    })\n  }\n\n  const listener = (envelope: NeatEventEnvelope): void => {\n    if (envelope.project !== opts.project) return\n    writeFrame(`event: ${envelope.type}\\ndata: ${JSON.stringify(envelope.payload)}\\n\\n`)\n  }\n\n  eventBus.on(EVENT_BUS_CHANNEL, listener)\n\n  const heartbeat = setInterval(() => {\n    if (dropped) return\n    reply.raw.write(':heartbeat\\n\\n')\n  }, heartbeatMs)\n  if (typeof heartbeat.unref === 'function') heartbeat.unref()\n\n  req.raw.on('close', closeConnection)\n  reply.raw.on('close', closeConnection)\n  reply.raw.on('error', closeConnection)\n}\n"],"mappings":";AAAA,OAAO,kBAAkB;AAWzB,IAAM,qBACJ,aACA;AAMK,IAAM,kBAAkB;AAK/B,IAAM,SAAS,oBAAI,IAAuB;AAE1C,SAAS,YAAuB;AAC9B,SAAO,IAAI,mBAAyC,EAAE,gBAAgB,MAAM,CAAC;AAC/E;AAEO,SAAS,SAAS,UAAkB,iBAA4B;AACrE,MAAI,IAAI,OAAO,IAAI,OAAO;AAC1B,MAAI,CAAC,GAAG;AACN,QAAI,UAAU;AACd,WAAO,IAAI,SAAS,CAAC;AAAA,EACvB;AACA,SAAO;AACT;AAYO,SAAS,WAAW,SAAwB;AACjD,MAAI,YAAY,QAAW;AACzB,WAAO,MAAM;AACb;AAAA,EACF;AACA,SAAO,OAAO,OAAO;AACvB;;;ACvDA,SAAS,YAAY,UAAU;AAC/B,OAAO,QAAQ;AACf,OAAO,UAAU;AACjB,OAAO,YAAY;;;ACHnB;AAAA,EACE,OAAS;AAAA,IACP;AAAA,MACE,MAAQ;AAAA,MACR,QAAU;AAAA,MACV,QAAU;AAAA,MACV,kBAAoB;AAAA,MACpB,kBAAoB;AAAA,MACpB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,QAAU;AAAA,MACV,QAAU;AAAA,MACV,kBAAoB;AAAA,MACpB,kBAAoB;AAAA,MACpB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,QAAU;AAAA,MACV,QAAU;AAAA,MACV,kBAAoB;AAAA,MACpB,kBAAoB;AAAA,MACpB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,QAAU;AAAA,MACV,QAAU;AAAA,MACV,kBAAoB;AAAA,MACpB,kBAAoB;AAAA,MACpB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,QAAU;AAAA,MACV,QAAU;AAAA,MACV,kBAAoB;AAAA,MACpB,kBAAoB;AAAA,MACpB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,QAAU;AAAA,MACV,QAAU;AAAA,MACV,kBAAoB;AAAA,MACpB,kBAAoB;AAAA,MACpB,QAAU;AAAA,IACZ;AAAA,EACF;AAAA,EACA,uBAAyB;AAAA,IACvB;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,gBAAkB;AAAA,MAClB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,gBAAkB;AAAA,MAClB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,gBAAkB;AAAA,MAClB,QAAU;AAAA,IACZ;AAAA,EACF;AAAA,EACA,kBAAoB;AAAA,IAClB;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,UAAY;AAAA,QACV,MAAQ;AAAA,QACR,YAAc;AAAA,MAChB;AAAA,MACA,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,UAAY;AAAA,QACV,MAAQ;AAAA,QACR,YAAc;AAAA,MAChB;AAAA,MACA,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,UAAY;AAAA,QACV,MAAQ;AAAA,QACR,YAAc;AAAA,MAChB;AAAA,MACA,QAAU;AAAA,IACZ;AAAA,EACF;AAAA,EACA,gBAAkB;AAAA,IAChB;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,mBAAqB;AAAA,MACrB,QAAU;AAAA,IACZ;AAAA,IACA;AAAA,MACE,MAAQ;AAAA,MACR,SAAW;AAAA,MACX,QAAU;AAAA,IACZ;AAAA,EACF;AACF;;;ADlEA,IAAM,gBAAgB;AACtB,IAAI,eAAoC;AACxC,IAAI,sBAAsB;AAE1B,IAAM,mBAAmB,KAAK,KAAK,GAAG,QAAQ,GAAG,OAAO;AACxD,IAAM,oBAAoB,KAAK,KAAK,kBAAkB,mBAAmB;AACzE,IAAM,gBAAgB,KAAK,KAAK,KAAK;AAWrC,SAAS,qBAAqB,eAAuB,WAA4B;AAC/E,QAAM,IAAI,SAAS,eAAe,EAAE;AACpC,QAAM,IAAI,SAAS,WAAW,EAAE;AAChC,MAAI,OAAO,SAAS,CAAC,KAAK,OAAO,SAAS,CAAC,EAAG,QAAO,KAAK;AAE1D,QAAM,KAAK,OAAO,OAAO,aAAa;AACtC,QAAM,KAAK,OAAO,OAAO,SAAS;AAClC,MAAI,MAAM,GAAI,QAAO,OAAO,IAAI,IAAI,EAAE;AAEtC,SAAO;AACT;AAEO,SAAS,mBACd,QACA,eACA,QACA,eACqB;AACrB,QAAM,SAAS,cAAc;AAC7B,QAAM,OAAO,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,UAAU,EAAE,WAAW,MAAM;AAChF,MAAI,CAAC,KAAM,QAAO,EAAE,YAAY,KAAK;AAErC,MAAI,KAAK,oBAAoB,CAAC,qBAAqB,eAAe,KAAK,gBAAgB,GAAG;AACxF,WAAO,EAAE,YAAY,KAAK;AAAA,EAC5B;AAEA,QAAM,gBAAgB,OAAO,OAAO,aAAa;AACjD,MAAI,CAAC,cAAe,QAAO,EAAE,YAAY,KAAK;AAE9C,MAAI,OAAO,GAAG,eAAe,KAAK,gBAAgB,GAAG;AACnD,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ,KAAK;AAAA,MACb,kBAAkB,KAAK;AAAA,IACzB;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,KAAK;AAC5B;AAaA,SAAS,mBAAmB,kBAA0B,qBAAsC;AAC1F,MAAI;AACF,UAAM,WAAW,OAAO,OAAO,mBAAmB;AAClD,QAAI,CAAC,SAAU,QAAO;AAKtB,WAAO,OAAO,OAAO,kBAAkB,KAAK,SAAS,OAAO,IAAI;AAAA,MAC9D,mBAAmB;AAAA,IACrB,CAAC;AAAA,EACH,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,0BACd,YACA,wBACA,kBACiB;AACjB,MAAI,WAAW,qBAAqB,wBAAwB;AAC1D,UAAM,IAAI,OAAO,OAAO,sBAAsB;AAC9C,QAAI,KAAK,OAAO,GAAG,GAAG,WAAW,iBAAiB,GAAG;AACnD,aAAO,EAAE,YAAY,KAAK;AAAA,IAC5B;AAAA,EACF;AACA,MAAI,CAAC,kBAAkB;AACrB,WAAO,EAAE,YAAY,KAAK;AAAA,EAC5B;AACA,MAAI,mBAAmB,kBAAkB,WAAW,cAAc,GAAG;AACnE,WAAO,EAAE,YAAY,KAAK;AAAA,EAC5B;AACA,SAAO;AAAA,IACL,YAAY;AAAA,IACZ,QAAQ,WAAW;AAAA,IACnB,qBAAqB,WAAW;AAAA,EAClC;AACF;AASO,SAAS,qBACd,UACA,wBACA,yBACsB;AACtB,MAAI,CAAC,uBAAwB,QAAO,EAAE,YAAY,KAAK;AACvD,MAAI,SAAS,mBAAmB;AAC9B,UAAM,IAAI,OAAO,OAAO,sBAAsB;AAC9C,QAAI,KAAK,OAAO,GAAG,GAAG,SAAS,iBAAiB,GAAG;AACjD,aAAO,EAAE,YAAY,KAAK;AAAA,IAC5B;AAAA,EACF;AACA,MAAI,CAAC,yBAAyB;AAC5B,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ,SAAS;AAAA,MACjB,UAAU,SAAS;AAAA,IACrB;AAAA,EACF;AACA,QAAM,kBAAkB,OAAO,OAAO,uBAAuB;AAC7D,MAAI,CAAC,gBAAiB,QAAO,EAAE,YAAY,KAAK;AAChD,MAAI,OAAO,GAAG,iBAAiB,SAAS,SAAS,UAAU,GAAG;AAC5D,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ,SAAS;AAAA,MACjB,UAAU,SAAS;AAAA,MACnB,cAAc;AAAA,IAChB;AAAA,EACF;AACA,SAAO,EAAE,YAAY,KAAK;AAC5B;AAEO,SAAS,mBACd,MACA,iBAC0C;AAC1C,MAAI,oBAAoB,OAAW,QAAO,EAAE,YAAY,KAAK;AAC7D,MAAI,KAAK,mBAAmB;AAC1B,UAAM,IAAI,OAAO,OAAO,eAAe;AACvC,UAAM,MAAM,OAAO,OAAO,KAAK,iBAAiB;AAChD,QAAI,KAAK,OAAO,OAAO,GAAG,GAAG,GAAG,EAAG,QAAO,EAAE,YAAY,KAAK;AAAA,EAC/D;AACA,SAAO,EAAE,YAAY,OAAO,QAAQ,KAAK,OAAO;AAClD;AAEA,SAAS,gBAA8B;AACrC,SAAO,gBAAgB;AACzB;AAEA,SAAS,cAAc,GAAiB,GAA+B;AACrE,SAAO;AAAA,IACL,OAAO,CAAC,GAAG,EAAE,OAAO,GAAI,EAAE,SAAS,CAAC,CAAE;AAAA,IACtC,uBAAuB;AAAA,MACrB,GAAI,EAAE,yBAAyB,CAAC;AAAA,MAChC,GAAI,EAAE,yBAAyB,CAAC;AAAA,IAClC;AAAA,IACA,kBAAkB,CAAC,GAAI,EAAE,oBAAoB,CAAC,GAAI,GAAI,EAAE,oBAAoB,CAAC,CAAE;AAAA,IAC/E,gBAAgB,CAAC,GAAI,EAAE,kBAAkB,CAAC,GAAI,GAAI,EAAE,kBAAkB,CAAC,CAAE;AAAA,EAC3E;AACF;AAEA,eAAe,gBAAgB,KAA2C;AACxE,MAAI;AACF,UAAM,MAAM,MAAM,GAAG,SAAS,mBAAmB,MAAM;AACvD,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,QAAQ,IAAK,QAAO;AAC/B,UAAM,MAAM,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,SAAS,EAAE,QAAQ;AAC5D,QAAI,MAAM,cAAe,QAAO;AAChC,WAAO,OAAO;AAAA,EAChB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,iBAAiB,KAAa,QAAqC;AAChF,QAAM,OAAwB;AAAA,IAC5B,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,IAClC;AAAA,IACA;AAAA,EACF;AACA,MAAI;AACF,UAAM,GAAG,MAAM,kBAAkB,EAAE,WAAW,KAAK,CAAC;AACpD,UAAM,GAAG,UAAU,mBAAmB,KAAK,UAAU,IAAI,GAAG,MAAM;AAAA,EACpE,SAAS,KAAK;AACZ,YAAQ,KAAK,yCAA0C,IAAc,OAAO,EAAE;AAAA,EAChF;AACF;AAWA,eAAsB,qBAA4C;AAChE,MAAI,aAAc,QAAO;AACzB,MAAI,qBAAqB;AACvB,mBAAe;AACf,WAAO;AAAA,EACT;AACA,wBAAsB;AAEtB,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,CAAC,KAAK;AACR,mBAAe;AACf,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,MAAM,gBAAgB,GAAG;AACxC,MAAI,QAAQ;AACV,mBAAe,cAAc,eAAe,MAAM;AAClD,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,QAAI,CAAC,IAAI,GAAI,OAAM,IAAI,MAAM,GAAG,IAAI,MAAM,IAAI,IAAI,UAAU,EAAE;AAC9D,UAAM,SAAU,MAAM,IAAI,KAAK;AAC/B,UAAM,iBAAiB,KAAK,MAAM;AAClC,mBAAe,cAAc,eAAe,MAAM;AAClD,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,YAAQ;AAAA,MACN,wCAAyC,IAAc,OAAO;AAAA,IAChE;AACA,mBAAe;AACf,WAAO;AAAA,EACT;AACF;AASO,SAAS,cAAqC;AACnD,SAAO,cAAc,EAAE;AACzB;AAEO,SAAS,wBAAyD;AACvE,SAAO,cAAc,EAAE,yBAAyB,CAAC;AACnD;AAEO,SAAS,mBAA+C;AAC7D,SAAO,cAAc,EAAE,oBAAoB,CAAC;AAC9C;AAEO,SAAS,iBAA2C;AACzD,SAAO,cAAc,EAAE,kBAAkB,CAAC;AAC5C;;;AEtTA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAsBP,IAAM,uBAAuB;AAC7B,IAAM,6BAA6B;AAQnC,SAAS,iBAAiB,OAAkB,SAA2C;AACrF,QAAM,OAAO,oBAAI,IAAuB;AACxC,aAAW,MAAM,SAAS;AACxB,UAAM,IAAI,MAAM,kBAAkB,EAAE;AACpC,QAAI,EAAE,eAAe,WAAW,SAAU;AAC1C,UAAM,MAAM,KAAK,IAAI,EAAE,MAAM;AAC7B,QAAI,CAAC,OAAO,UAAU,EAAE,UAAU,IAAI,UAAU,IAAI,UAAU,GAAG;AAC/D,WAAK,IAAI,EAAE,QAAQ,CAAC;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAkB,SAA2C;AACrF,QAAM,OAAO,oBAAI,IAAuB;AACxC,aAAW,MAAM,SAAS;AACxB,UAAM,IAAI,MAAM,kBAAkB,EAAE;AACpC,QAAI,EAAE,eAAe,WAAW,SAAU;AAC1C,UAAM,MAAM,KAAK,IAAI,EAAE,MAAM;AAC7B,QAAI,CAAC,OAAO,UAAU,EAAE,UAAU,IAAI,UAAU,IAAI,UAAU,GAAG;AAC/D,WAAK,IAAI,EAAE,QAAQ,CAAC;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAWA,IAAM,qBAA6C;AAAA,EACjD,UAAU;AAAA,EACV,UAAU;AAAA,EACV,WAAW;AAAA,EACX,OAAO;AAAA,EACP,UAAU;AACZ;AAEA,SAAS,aAAa,WAAuC;AAC3D,MAAI,CAAC,aAAa,aAAa,EAAG,QAAO;AAEzC,QAAM,IAAI,MAAM,KAAK,MAAM,YAAY,CAAC,IAAI;AAC5C,SAAO,KAAK,IAAI,GAAG,CAAC;AACtB;AAEA,SAAS,cAAc,OAAmC;AACxD,MAAI,UAAU,OAAW,QAAO;AAChC,QAAM,OAAO,KAAK,KAAK;AACvB,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,SAAS,KAAK,MAAM;AACtB,UAAM,KAAK,QAAQ,SAAS,KAAK;AACjC,WAAO,IAAM,MAAM;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,WAA+B,YAAwC;AAChG,MAAI,CAAC,aAAa,aAAa,EAAG,QAAO;AACzC,QAAM,QAAQ,cAAc,KAAK;AACjC,MAAI,QAAQ,KAAM,QAAO;AACzB,MAAI,QAAQ,IAAK,QAAO;AACxB,SAAO,IAAI,OAAO;AACpB;AAEO,SAAS,kBAAkB,MAAiB,MAAM,KAAK,IAAI,GAAW;AAC3E,QAAM,UAAU,mBAAmB,KAAK,UAAU,KAAK;AAMvD,QAAM,YAAY,KAAK,QAAQ,aAAa,KAAK;AACjD,QAAM,QAAQ,KAAK,QAAQ,qBAAqB,gBAAgB,MAAM,GAAG;AACzE,MAAI,cAAc,UAAa,UAAU,UAAa,KAAK,WAAW,QAAW;AAC/E,WAAO;AAAA,EACT;AAEA,QAAM,IAAI,aAAa,SAAS;AAChC,QAAM,IAAI,cAAc,KAAK;AAC7B,QAAM,IAAI,kBAAkB,WAAW,KAAK,QAAQ,UAAU;AAC9D,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,IAAI,IAAI,CAAC,CAAC;AACrD;AAEA,SAAS,gBAAgB,MAAiB,KAAiC;AACzE,MAAI,CAAC,KAAK,aAAc,QAAO;AAC/B,QAAM,IAAI,KAAK,MAAM,KAAK,YAAY;AACtC,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,SAAO,KAAK,IAAI,GAAG,MAAM,CAAC;AAC5B;AAQA,SAAS,kBAAkB,OAAoB,MAAM,KAAK,IAAI,GAAW;AACvE,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,MAAI,UAAU;AACd,aAAW,KAAK,OAAO;AACrB,eAAW,kBAAkB,GAAG,GAAG;AAAA,EACrC;AACA,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,CAAC;AACzC;AAUA,SAAS,oBAAoB,OAAkB,OAAe,UAAwB;AACpF,MAAI,OAAa,EAAE,MAAM,CAAC,KAAK,GAAG,OAAO,CAAC,EAAE;AAC5C,QAAM,UAAU,oBAAI,IAAY,CAAC,KAAK,CAAC;AAEvC,WAAS,KAAK,MAAcA,QAAgB,OAA0B;AACpE,QAAIA,OAAK,SAAS,KAAK,KAAK,QAAQ;AAClC,aAAO,EAAE,MAAM,CAAC,GAAGA,MAAI,GAAG,OAAO,CAAC,GAAG,KAAK,EAAE;AAAA,IAC9C;AACA,QAAIA,OAAK,SAAS,KAAK,SAAU;AAEjC,UAAM,WAAW,iBAAiB,OAAO,MAAM,aAAa,IAAI,CAAC;AACjE,eAAW,CAAC,OAAO,IAAI,KAAK,UAAU;AACpC,UAAI,QAAQ,IAAI,KAAK,EAAG;AACxB,cAAQ,IAAI,KAAK;AACjB,MAAAA,OAAK,KAAK,KAAK;AACf,YAAM,KAAK,IAAI;AACf,WAAK,OAAOA,QAAM,KAAK;AACvB,MAAAA,OAAK,IAAI;AACT,YAAM,IAAI;AACV,cAAQ,OAAO,KAAK;AAAA,IACtB;AAAA,EACF;AAEA,OAAK,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;AACvB,SAAO;AACT;AAsBA,SAAS,uBACP,OACA,QACA,MACuB;AACvB,QAAM,WAAW;AAGjB,QAAM,iBAAiB,YAAY,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,SAAS,MAAM;AAC/E,MAAI,eAAe,WAAW,EAAG,QAAO;AAExC,aAAW,MAAM,KAAK,MAAM;AAC1B,UAAM,QAAQ,MAAM,kBAAkB,EAAE;AACxC,QAAI,MAAM,SAAS,SAAS,YAAa;AACzC,UAAM,MAAM;AACZ,UAAM,OAAO,IAAI,gBAAgB,CAAC;AAClC,eAAW,QAAQ,gBAAgB;AACjC,YAAM,WAAW,KAAK,KAAK,MAAM;AACjC,UAAI,CAAC,SAAU;AACf,YAAM,SAAS;AAAA,QACb,KAAK;AAAA,QACL;AAAA,QACA,SAAS;AAAA,QACT,SAAS;AAAA,MACX;AACA,UAAI,CAAC,OAAO,YAAY;AACtB,eAAO;AAAA,UACL,eAAe;AAAA,UACf,iBAAiB,OAAO,UAAU;AAAA,UAClC,GAAI,OAAO,mBACP;AAAA,YACE,mBAAmB,WAAW,IAAI,IAAI,IAAI,KAAK,MAAM,iBAAiB,OAAO,gBAAgB;AAAA,UAC/F,IACA,CAAC;AAAA,QACP;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,sBACP,OACA,SACA,MACuB;AACvB,aAAW,MAAM,KAAK,MAAM;AAC1B,UAAM,QAAQ,MAAM,kBAAkB,EAAE;AACxC,QAAI,MAAM,SAAS,SAAS,YAAa;AACzC,UAAM,MAAM;AACZ,UAAM,OAAO,IAAI,gBAAgB,CAAC;AAClC,UAAM,oBAAoB,IAAI;AAE9B,eAAW,cAAc,sBAAsB,GAAG;AAChD,YAAM,WAAW,KAAK,WAAW,OAAO;AACxC,UAAI,CAAC,SAAU;AACf,YAAM,SAAS,0BAA0B,YAAY,UAAU,iBAAiB;AAChF,UAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,eAAO;AAAA,UACL,eAAe;AAAA,UACf,iBAAiB,OAAO;AAAA,UACxB,GAAI,OAAO,sBACP;AAAA,YACE,mBAAmB,QAAQ,IAAI,IAAI,yBAAyB,OAAO,mBAAmB;AAAA,UACxF,IACA,CAAC;AAAA,QACP;AAAA,MACF;AAAA,IACF;AAEA,eAAW,YAAY,iBAAiB,GAAG;AACzC,YAAM,WAAW,KAAK,SAAS,OAAO;AACtC,UAAI,CAAC,SAAU;AACf,YAAM,mBAAmB,KAAK,SAAS,SAAS,IAAI;AACpD,YAAM,SAAS,qBAAqB,UAAU,UAAU,gBAAgB;AACxE,UAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,eAAO;AAAA,UACL,eAAe;AAAA,UACf,iBAAiB,OAAO;AAAA,UACxB,mBAAmB,WAAW,IAAI,IAAI,MAAM,SAAS,SAAS,IAAI,UAAU,SAAS,SAAS,UAAU;AAAA,QAC1G;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAMA,IAAM,kBAAsE;AAAA,EAC1E,CAAC,SAAS,YAAY,GAAG;AAAA,EACzB,CAAC,SAAS,WAAW,GAAG;AAC1B;AAEO,SAAS,aACd,OACA,aACA,YACwB;AACxB,MAAI,CAAC,MAAM,QAAQ,WAAW,EAAG,QAAO;AACxC,QAAM,SAAS,MAAM,kBAAkB,WAAW;AAClD,QAAM,QAAQ,gBAAgB,OAAO,IAAI;AACzC,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,OAAO,oBAAoB,OAAO,aAAa,oBAAoB;AACzE,QAAM,QAAQ,MAAM,OAAO,QAAQ,IAAI;AACvC,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,SAAS,aACX,GAAG,MAAM,eAAe,qBAAqB,WAAW,YAAY,MACpE,MAAM;AAKV,SAAO,sBAAsB,MAAM;AAAA,IACjC,eAAe,MAAM;AAAA,IACrB,iBAAiB;AAAA,IACjB,eAAe,KAAK;AAAA,IACpB,iBAAiB,KAAK,MAAM,IAAI,CAAC,MAAM,EAAE,UAAU;AAAA,IACnD,YAAY,kBAAkB,KAAK,KAAK;AAAA,IACxC,mBAAmB,MAAM;AAAA,EAC3B,CAAC;AACH;AAKO,SAAS,eACd,OACA,QACA,WAAW,4BACQ;AACnB,MAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,WAAO,wBAAwB,MAAM,EAAE,QAAQ,QAAQ,eAAe,CAAC,GAAG,eAAe,EAAE,CAAC;AAAA,EAC9F;AAaA,QAAM,OAAO,oBAAI,IAAqC;AACtD,QAAM,QAAiB,CAAC,EAAE,QAAQ,UAAU,GAAG,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,EAAE,CAAC;AAC9E,QAAM,WAAW,oBAAI,IAAY,CAAC,MAAM,CAAC;AAEzC,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,QAAQ,MAAM,MAAM;AAC1B,QAAI,MAAM,WAAW,KAAK,MAAM,UAAU,SAAS,GAAG;AACpD,YAAM,WAAW,MAAM,UAAU,MAAM,UAAU,SAAS,CAAC;AAC3D,WAAK,IAAI,MAAM,QAAQ;AAAA,QACrB,QAAQ,MAAM;AAAA,QACd,UAAU,MAAM;AAAA,QAChB,gBAAgB,SAAS;AAAA,QACzB,MAAM,MAAM;AAAA,QACZ,YAAY,kBAAkB,MAAM,SAAS;AAAA,MAC/C,CAAC;AAAA,IACH;AACA,QAAI,MAAM,YAAY,SAAU;AAEhC,UAAM,WAAW,iBAAiB,OAAO,MAAM,cAAc,MAAM,MAAM,CAAC;AAC1E,eAAW,CAAC,OAAO,IAAI,KAAK,UAAU;AACpC,UAAI,SAAS,IAAI,KAAK,EAAG;AACzB,eAAS,IAAI,KAAK;AAClB,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QACR,UAAU,MAAM,WAAW;AAAA,QAC3B,MAAM,CAAC,GAAG,MAAM,MAAM,KAAK;AAAA,QAC3B,WAAW,CAAC,GAAG,MAAM,WAAW,IAAI;AAAA,MACtC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,gBAAgB,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE;AAAA,IACvC,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,EACtE;AACA,SAAO,wBAAwB,MAAM;AAAA,IACnC,QAAQ;AAAA,IACR;AAAA,IACA,eAAe,cAAc;AAAA,EAC/B,CAAC;AACH;AAKO,IAAM,wCAAwC;AAC9C,IAAM,oCAAoC;AAU1C,SAAS,0BACd,OACA,QACA,QAAgB,uCACc;AAC9B,MAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,WAAO,mCAAmC,MAAM;AAAA,MAC9C,QAAQ;AAAA,MACR;AAAA,MACA,cAAc,CAAC;AAAA,MACf,OAAO;AAAA,IACT,CAAC;AAAA,EACH;AAQA,QAAM,OAAO,oBAAI,IAAkC;AACnD,QAAM,QAAiB,CAAC,EAAE,QAAQ,UAAU,GAAG,MAAM,KAAK,CAAC;AAC3D,QAAM,WAAW,oBAAI,IAAY,CAAC,MAAM,CAAC;AAEzC,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,QAAQ,MAAM,MAAM;AAC1B,QAAI,MAAM,WAAW,KAAK,MAAM,MAAM;AACpC,WAAK,IAAI,MAAM,QAAQ;AAAA,QACrB,QAAQ,MAAM;AAAA,QACd,UAAU,MAAM;AAAA,QAChB,UAAU,MAAM,KAAK;AAAA,QACrB,YAAY,MAAM,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AACA,QAAI,MAAM,YAAY,MAAO;AAE7B,UAAM,WAAW,iBAAiB,OAAO,MAAM,cAAc,MAAM,MAAM,CAAC;AAC1E,eAAW,CAAC,OAAO,IAAI,KAAK,UAAU;AACpC,UAAI,SAAS,IAAI,KAAK,EAAG;AACzB,eAAS,IAAI,KAAK;AAClB,YAAM,KAAK,EAAE,QAAQ,OAAO,UAAU,MAAM,WAAW,GAAG,KAAK,CAAC;AAAA,IAClE;AAAA,EACF;AAEA,QAAM,eAAe,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE;AAAA,IACtC,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,EACtE;AACA,SAAO,mCAAmC,MAAM;AAAA,IAC9C,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA,OAAO,aAAa;AAAA,EACtB,CAAC;AACH;;;AC9dA,SAAS,YAAYC,WAAU;AAC/B,OAAOC,WAAU;;;ACDjB,SAAS,YAAYC,WAAU;AAC/B,OAAOC,WAAU;AAYjB;AAAA,EACE;AAAA,EACA,YAAAC;AAAA,EACA;AAAA,EACA,cAAAC;AAAA,OACK;;;ACPP,SAAS,oBAAoB;AA2EtB,IAAM,oBAAoB;AAEjC,IAAM,eAAN,cAA2B,aAAa;AAAC;AAIlC,IAAM,WAAyB,IAAI,aAAa;AAIvD,SAAS,gBAAgB,CAAC;AAEnB,SAAS,cAAuC,UAAsC;AAC3F,WAAS,KAAK,mBAAmB,QAAQ;AAC3C;AAkBO,SAAS,sBAAsB,OAAkB,MAAiC;AACvF,QAAM,EAAE,QAAQ,IAAI;AAEpB,QAAM,cAAc,CAAC,YAA0D;AAC7E,kBAAc;AAAA,MACZ,MAAM;AAAA,MACN;AAAA,MACA,SAAS,EAAE,MAAM,QAAQ,WAAW;AAAA,IACtC,CAAC;AAAA,EACH;AACA,QAAM,gBAAgB,CAAC,YAAmC;AACxD,kBAAc;AAAA,MACZ,MAAM;AAAA,MACN;AAAA,MACA,SAAS,EAAE,IAAI,QAAQ,IAAI;AAAA,IAC7B,CAAC;AAAA,EACH;AACA,QAAM,cAAc,CAAC,YAA0D;AAC7E,kBAAc;AAAA,MACZ,MAAM;AAAA,MACN;AAAA,MACA,SAAS,EAAE,MAAM,QAAQ,WAAW;AAAA,IACtC,CAAC;AAAA,EACH;AACA,QAAM,gBAAgB,CAAC,YAAmC;AACxD,kBAAc;AAAA,MACZ,MAAM;AAAA,MACN;AAAA,MACA,SAAS,EAAE,IAAI,QAAQ,IAAI;AAAA,IAC7B,CAAC;AAAA,EACH;AACA,QAAM,qBAAqB,CAAC,YAA0D;AACpF,kBAAc;AAAA,MACZ,MAAM;AAAA,MACN;AAAA,MACA,SAAS,EAAE,IAAI,QAAQ,KAAK,SAAS,QAAQ,WAAW;AAAA,IAC1D,CAAC;AAAA,EACH;AAEA,QAAM,GAAG,aAAa,WAAW;AACjC,QAAM,GAAG,eAAe,aAAa;AACrC,QAAM,GAAG,aAAa,WAAW;AACjC,QAAM,GAAG,eAAe,aAAa;AACrC,QAAM,GAAG,yBAAyB,kBAAkB;AAEpD,SAAO,MAAM;AACX,UAAM,IAAI,aAAa,WAAW;AAClC,UAAM,IAAI,eAAe,aAAa;AACtC,UAAM,IAAI,aAAa,WAAW;AAClC,UAAM,IAAI,eAAe,aAAa;AACtC,UAAM,IAAI,yBAAyB,kBAAkB;AAAA,EACvD;AACF;;;AD9GA,IAAM,6BAAmE;AAAA,EACvE,MAAM;AAAA,EACN,SAAS;AAAA,EACT,OAAO;AAAA,EACP,UAAU;AACZ;AAEO,SAAS,mBAAmB,QAA8B;AAC/D,SAAO,OAAO,eAAe,2BAA2B,OAAO,QAAQ;AACzE;AAEA,SAAS,cACP,QACA,MACA,eACA,SACA,SACA,KACiB;AACjB,SAAO;AAAA,IACL,IAAI,GAAG,OAAO,EAAE,IAAI,aAAa;AAAA,IACjC,UAAU,OAAO;AAAA,IACjB,YAAY,OAAO;AAAA,IACnB,UAAU,OAAO;AAAA,IACjB,aAAa,mBAAmB,MAAM;AAAA,IACtC,UAAU,KAAK;AAAA,IACf;AAAA,IACA;AAAA,IACA,YAAY,IAAI,KAAK,IAAI,IAAI,CAAC,EAAE,YAAY;AAAA,EAC9C;AACF;AAMA,IAAM,qBAAiF,CAAC;AAAA,EACtF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MAAM;AACJ,QAAM,aAAgC,CAAC;AACvC,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,QAAI,EAAE,SAAS,KAAK,aAAc;AAClC,QAAI,YAAY;AAChB,eAAW,UAAU,MAAM,cAAc,EAAE,GAAG;AAC5C,YAAM,IAAI,MAAM,kBAAkB,MAAM;AACxC,UAAI,EAAE,SAAS,KAAK,SAAU;AAC9B,UAAI,EAAE,eAAeC,YAAW,SAAU;AAC1C,YAAM,SAAS,MAAM,kBAAkB,EAAE,MAAM;AAC/C,UAAI,OAAO,SAAS,KAAK,YAAY;AACnC,oBAAY;AACZ;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,WAAW;AACd,iBAAW;AAAA,QACT;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA,GAAG,KAAK,YAAY,IAAI,EAAE,WAAW,KAAK,QAAQ,cAAc,KAAK,UAAU;AAAA,UAC/E,EAAE,QAAQ,GAAG;AAAA,UACb;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,IAAM,oBAA+E,CAAC;AAAA,EACpF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MAAM;AACJ,QAAM,aAAgC,CAAC;AACvC,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,QAAI,EAAE,SAAS,KAAK,SAAU;AAC9B,UAAM,QAAQ,EAAE,KAAK,KAAK;AAC1B,QAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;AACnD,iBAAW;AAAA,QACT;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA,GAAG,KAAK,QAAQ,IAAI,EAAE,+BAA+B,KAAK,KAAK;AAAA,UAC/D,EAAE,QAAQ,GAAG;AAAA,UACb;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,IAAM,qBAAiF,CAAC;AAAA,EACtF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MAAM;AACJ,QAAM,WAAW,MAAM,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,KAAK,QAAQ,IAAI,oBAAI,IAAI,CAAC,KAAK,QAAQ,CAAC;AAChG,QAAM,aAAgC,CAAC;AACvC,QAAM,YAAY,CAAC,QAAQ,UAAU;AACnC,UAAM,IAAI;AACV,QAAI,EAAE,SAAS,KAAK,SAAU;AAC9B,QAAI,KAAK,gBAAgB,EAAE,WAAW,KAAK,aAAc;AACzD,QAAI,CAAC,SAAS,IAAI,EAAE,UAAU,GAAG;AAC/B,YAAM,eAAe,CAAC,GAAG,QAAQ,EAAE,KAAK,KAAK;AAC7C,iBAAW;AAAA,QACT;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA,GAAG,KAAK,QAAQ,SAAS,MAAM,mBAAmB,EAAE,UAAU,cAAc,YAAY;AAAA,UACxF,EAAE,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,IAAM,sBAAoF,CAAC;AAAA,EACzF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MAAM;AACJ,QAAM,aAAgC,CAAC;AACvC,QAAM,QAAQ,KAAK;AACnB,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,QAAI,EAAE,SAAS,KAAK,SAAU;AAC9B,UAAM,SAAS,UAAU,SAAY,eAAe,OAAO,IAAI,KAAK,IAAI,eAAe,OAAO,EAAE;AAChG,QAAI,OAAO,gBAAgB,KAAK,aAAa;AAC3C,iBAAW;AAAA,QACT;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA,GAAG,KAAK,QAAQ,IAAI,EAAE,qBAAqB,OAAO,aAAa,MAAM,KAAK,WAAW;AAAA,UACrF,EAAE,QAAQ,IAAI,MAAM,CAAC,EAAE,EAAE;AAAA,UACzB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,IAAM,wBAAuF,CAAC;AAAA,EAC5F;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MAAM;AACJ,QAAM,aAAgC,CAAC;AAKvC,QAAM,YAAY,CAAC,SACjB,KAAK,SAAS,UAAa,KAAK,SAAS;AAE3C,QAAM,YAAY,CAAC,OAAO,UAAU;AAClC,UAAM,IAAI;AACV,QAAI,EAAE,SAASC,UAAS,YAAa;AACrC,UAAM,MAAM;AACZ,UAAM,OAAO,IAAI,gBAAgB,CAAC;AAElC,QAAI,UAAU,eAAe,GAAG;AAI9B,iBAAW,UAAU,MAAM,cAAc,KAAK,GAAG;AAC/C,cAAM,IAAI,MAAM,kBAAkB,MAAM;AACxC,YAAI,EAAE,SAAS,SAAS,YAAa;AACrC,YAAI,EAAE,eAAeD,YAAW,SAAU;AAC1C,cAAM,UAAU,MAAM,kBAAkB,EAAE,MAAM;AAChD,YAAI,QAAQ,SAASC,UAAS,aAAc;AAC5C,cAAM,KAAK;AACX,mBAAW,QAAQ,YAAY,GAAG;AAChC,cAAI,KAAK,WAAW,GAAG,OAAQ;AAC/B,gBAAM,WAAW,KAAK,KAAK,MAAM;AACjC,cAAI,CAAC,SAAU;AACf,gBAAM,SAAS,mBAAmB,KAAK,QAAQ,UAAU,GAAG,QAAQ,GAAG,aAAa;AACpF,cAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,uBAAW;AAAA,cACT;AAAA,gBACE;AAAA,gBACA;AAAA,gBACA,GAAG,KAAK,kBAAkB,KAAK,MAAM,IAAI,QAAQ,IAAI,GAAG,MAAM,IAAI,GAAG,aAAa;AAAA,gBAClF,OAAO;AAAA,gBACP,EAAE,QAAQ,OAAO,OAAO;AAAA,gBACxB;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,UAAU,aAAa,GAAG;AAC5B,YAAM,mBAAmB,IAAI;AAC7B,iBAAW,cAAc,sBAAsB,GAAG;AAChD,cAAM,WAAW,KAAK,WAAW,OAAO;AACxC,YAAI,CAAC,SAAU;AACf,cAAM,SAAS,0BAA0B,YAAY,UAAU,gBAAgB;AAC/E,YAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,qBAAW;AAAA,YACT;AAAA,cACE;AAAA,cACA;AAAA,cACA,GAAG,KAAK,gBAAgB,WAAW,OAAO,IAAI,QAAQ;AAAA,cACtD,OAAO;AAAA,cACP,EAAE,QAAQ,MAAM;AAAA,cAChB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,UAAU,kBAAkB,GAAG;AACjC,iBAAW,YAAY,iBAAiB,GAAG;AACzC,cAAM,WAAW,KAAK,SAAS,OAAO;AACtC,YAAI,CAAC,SAAU;AACf,cAAM,mBAAmB,KAAK,SAAS,SAAS,IAAI;AACpD,cAAM,SAAS,qBAAqB,UAAU,UAAU,gBAAgB;AACxE,YAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,qBAAW;AAAA,YACT;AAAA,cACE;AAAA,cACA;AAAA,cACA,GAAG,KAAK,qBAAqB,SAAS,OAAO,IAAI,QAAQ;AAAA,cACzD,OAAO;AAAA,cACP,EAAE,QAAQ,MAAM;AAAA,cAChB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,UAAU,gBAAgB,GAAG;AAC/B,iBAAW,OAAO,eAAe,GAAG;AAClC,cAAM,WAAW,KAAK,IAAI,OAAO;AACjC,YAAI,CAAC,SAAU;AACf,cAAM,SAAS,mBAAmB,KAAK,QAAQ;AAC/C,YAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,qBAAW;AAAA,YACT;AAAA,cACE;AAAA,cACA;AAAA,cACA,GAAG,KAAK,mBAAmB,IAAI,OAAO,IAAI,QAAQ;AAAA,cAClD,OAAO;AAAA,cACP,EAAE,QAAQ,MAAM;AAAA,cAChB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO;AACT;AAEA,IAAM,mBAAmG;AAAA,EACvG,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,gBAAgB;AAAA,EAChB,eAAe;AACjB;AAgBO,SAAS,mBACd,OACAC,aACA,UACA,KACqD;AACrD,MAAI,SAAS,WAAW,EAAG,QAAO,EAAE,SAAS,MAAM,YAAY,CAAC,EAAE;AAClE,QAAM,MAAM,oBAAoB,OAAO,UAAU,GAAG;AACpD,QAAM,WAAW,IAAI,OAAO,CAAC,MAAM;AACjC,QAAI,EAAE,gBAAgB,QAAS,QAAO;AACtC,WACE,EAAE,QAAQ,WAAWA,eACrB,EAAE,QAAQ,MAAM,SAASA,WAAU,MAAM;AAAA,EAE7C,CAAC;AACD,SAAO,EAAE,SAAS,SAAS,WAAW,GAAG,YAAY,SAAS;AAChE;AAEO,SAAS,oBACd,OACA,UACA,KACmB;AACnB,QAAM,MAAyB,CAAC;AAChC,aAAW,UAAU,UAAU;AAC7B,UAAM,YAAY,iBAAiB,OAAO,KAAK,IAAI;AACnD,UAAM,aAAa,UAAU,EAAE,OAAO,QAAQ,MAAM,OAAO,MAAM,IAAI,CAAC;AACtE,eAAW,KAAK,WAAY,KAAI,KAAK,CAAC;AAAA,EACxC;AACA,SAAO;AACT;AAUA,eAAsB,eAAe,YAAuC;AAC1E,MAAI;AACJ,MAAI;AACF,UAAM,MAAMC,IAAG,SAAS,YAAY,MAAM;AAAA,EAC5C,SAAS,KAAK;AACZ,QAAK,IAA8B,SAAS,SAAU,QAAO,CAAC;AAC9D,UAAM;AAAA,EACR;AACA,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,QAAM,OAAmB,iBAAiB,MAAM,IAAI;AACpD,SAAO,KAAK;AACd;AASO,IAAM,sBAAN,MAA0B;AAAA,EACd;AAAA,EACA;AAAA,EACT,OAA2B;AAAA,EAEnC,YAAY,SAAiB,UAAkB,iBAAiB;AAC9D,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,MAAM,OAAO,GAAsC;AACjD,QAAI,CAAC,KAAK,KAAM,OAAM,KAAK,QAAQ;AACnC,QAAI,KAAK,KAAM,IAAI,EAAE,EAAE,EAAG,QAAO;AACjC,SAAK,KAAM,IAAI,EAAE,EAAE;AACnB,UAAMA,IAAG,MAAMC,MAAK,QAAQ,KAAK,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAMD,IAAG,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC,IAAI,MAAM,MAAM;AAI/D,kBAAc;AAAA,MACZ,MAAM;AAAA,MACN,SAAS,KAAK;AAAA,MACd,SAAS,EAAE,WAAW,EAAE;AAAA,IAC1B,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAsC;AAC1C,QAAI;AACF,YAAM,MAAM,MAAMA,IAAG,SAAS,KAAK,MAAM,MAAM;AAC/C,aAAO,IACJ,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,CAAoB;AAAA,IACtD,SAAS,KAAK;AACZ,UAAK,IAA8B,SAAS,SAAU,QAAO,CAAC;AAC9D,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAc,UAAyB;AACrC,SAAK,OAAO,oBAAI,IAAI;AACpB,UAAM,WAAW,MAAM,KAAK,QAAQ;AACpC,eAAW,KAAK,SAAU,MAAK,KAAK,IAAI,EAAE,EAAE;AAAA,EAC9C;AACF;;;ADjcA;AAAA,EACE,YAAAE;AAAA,EACA,YAAAC;AAAA,EACA,cAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AAyCP,IAAM,UAAU,KAAK,KAAK;AAC1B,IAAM,SAAS,KAAK;AAMpB,IAAM,2BAAmD;AAAA,EACvD,OAAO;AAAA,EACP,aAAa,IAAI;AAAA,EACjB,cAAc,IAAI;AAAA,EAClB,eAAe,IAAI;AAAA,EACnB,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,SAAS;AACX;AAGA,IAAM,8BAA8B;AAEpC,SAAS,6BAAqD;AAC5D,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACF,UAAM,YAAY,KAAK,MAAM,GAAG;AAChC,UAAM,SAAS,EAAE,GAAG,yBAAyB;AAC7C,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,SAAS,GAAG;AAC9C,UAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,KAAK,KAAK,EAAG,QAAO,CAAC,IAAI;AAAA,IACzE;AACA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,YAAQ;AAAA,MACN,qDAAsD,IAAc,OAAO;AAAA,IAC7E;AACA,WAAO;AAAA,EACT;AACF;AAEO,SAAS,qBACd,UACA,WACQ;AACR,QAAM,MAAM,aAAa,2BAA2B;AACpD,SAAO,IAAI,QAAQ,KAAK;AAC1B;AAEA,SAAS,OAAO,KAA4B;AAC1C,SAAO,IAAI,KAAK,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,EAAE,YAAY;AAChE;AAEA,SAAS,SAAS,SAAqB,MAAoC;AACzE,aAAW,KAAK,MAAM;AACpB,UAAM,IAAI,KAAK,WAAW,CAAC;AAC3B,QAAI,OAAO,MAAM,YAAY,EAAE,SAAS,EAAG,QAAO;AAAA,EACpD;AACA,SAAO;AACT;AAEA,SAAS,YAAY,GAA2C;AAC9D,MAAI,CAAC,EAAG,QAAO;AACf,MAAI;AACF,WAAO,IAAI,IAAI,CAAC,EAAE;AAAA,EACpB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAKA,SAAS,YAAY,MAAsC;AACzD,SACE,SAAS,MAAM,kBAAkB,iBAAiB,eAAe,KACjE,YAAY,SAAS,MAAM,YAAY,UAAU,CAAC;AAEtD;AAKA,SAAS,mBAAmB,MAAqB,QAAgB,QAAwB;AACvF,SAAO,eAAe,QAAQ,QAAQ,IAAI;AAC5C;AAEA,SAAS,mBAAmB,MAAqB,QAAgB,QAAwB;AACvF,SAAO,eAAe,QAAQ,QAAQ,IAAI;AAC5C;AAEA,IAAM,sBAAsB;AAC5B,IAAM,mBAAmB;AAazB,IAAM,yBAAyB;AAC/B,IAAM,2BAA2B,IAAI,KAAK;AAO1C,IAAM,kBAAkB,oBAAI,IAAkC;AAE9D,SAAS,cAAc,SAAiB,QAAwB;AAC9D,SAAO,GAAG,OAAO,IAAI,MAAM;AAC7B;AAEA,SAAS,iBAAiB,MAAkB,KAAmB;AAC7D,MAAI,CAAC,KAAK,WAAW,CAAC,KAAK,OAAQ;AACnC,QAAM,MAAM,cAAc,KAAK,SAAS,KAAK,MAAM;AAGnD,kBAAgB,OAAO,GAAG;AAC1B,kBAAgB,IAAI,KAAK,EAAE,SAAS,KAAK,SAAS,WAAW,MAAM,yBAAyB,CAAC;AAC7F,SAAO,gBAAgB,OAAO,wBAAwB;AACpD,UAAM,SAAS,gBAAgB,KAAK,EAAE,KAAK,EAAE;AAC7C,QAAI,CAAC,OAAQ;AACb,oBAAgB,OAAO,MAAM;AAAA,EAC/B;AACF;AAEA,SAAS,wBACP,SACA,cACA,KACe;AACf,QAAM,QAAQ,gBAAgB,IAAI,cAAc,SAAS,YAAY,CAAC;AACtE,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,aAAa,KAAK;AAC1B,oBAAgB,OAAO,cAAc,SAAS,YAAY,CAAC;AAC3D,WAAO;AAAA,EACT;AACA,SAAO,MAAM;AACf;AAOA,SAAS,iBAAiB,OAAkB,MAA6B;AACvE,QAAM,SAAS,UAAU,IAAI;AAC7B,MAAI,MAAM,QAAQ,MAAM,EAAG,QAAO;AAQlC,MAAI,QAAuB;AAC3B,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,QAAI,MAAO;AACX,UAAM,IAAI;AACV,QAAI,EAAE,SAASC,UAAS,YAAa;AACrC,QAAI,EAAE,SAAS,MAAM;AACnB,cAAQ;AACR;AAAA,IACF;AACA,QAAI,EAAE,WAAW,EAAE,QAAQ,SAAS,IAAI,GAAG;AACzC,cAAQ;AAAA,IACV;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEO,SAAS,cAAc,MAAsB;AAClD,SAAO,WAAW,IAAI;AACxB;AASA,SAAS,kBAAkB,OAAkB,aAA6B;AACxE,QAAM,KAAK,UAAU,WAAW;AAChC,MAAI,MAAM,QAAQ,EAAE,EAAG,QAAO;AAC9B,QAAM,OAAoB;AAAA,IACxB;AAAA,IACA,MAAMA,UAAS;AAAA,IACf,MAAM;AAAA,IACN,UAAU;AAAA,IACV,eAAe;AAAA,EACjB;AACA,QAAM,QAAQ,IAAI,IAAI;AACtB,SAAO;AACT;AAKA,SAAS,mBAAmB,OAAkB,MAAc,QAAwB;AAClF,QAAM,KAAK,WAAW,IAAI;AAC1B,MAAI,MAAM,QAAQ,EAAE,EAAG,QAAO;AAC9B,QAAM,OAAqB;AAAA,IACzB;AAAA,IACA,MAAMA,UAAS;AAAA,IACf,MAAM;AAAA,IACN;AAAA,IACA,eAAe;AAAA,IACf,mBAAmB,CAAC;AAAA,IACpB;AAAA,IACA,eAAe;AAAA,EACjB;AACA,QAAM,QAAQ,IAAI,IAAI;AACtB,SAAO;AACT;AAEA,SAAS,mBAAmB,OAAkB,MAAc,IAAoB;AAC9E,QAAM,KAAK,cAAc,IAAI;AAC7B,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,UAAM,WAAW,MAAM,kBAAkB,EAAE;AAC3C,UAAM,sBAAsB,IAAI,EAAE,GAAG,UAAU,cAAc,GAAG,CAAC;AACjE,WAAO;AAAA,EACT;AACA,QAAM,OAAqB;AAAA,IACzB;AAAA,IACA,MAAMA,UAAS;AAAA,IACf,MAAM;AAAA,IACN;AAAA,IACA,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,QAAM,QAAQ,IAAI,IAAI;AACtB,SAAO;AACT;AAEA,SAAS,mBACP,OACA,MACA,QACA,QACA,IACM;AACN,QAAM,KAAK,eAAe,QAAQ,QAAQ,IAAI;AAC9C,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,UAAM,WAAW,MAAM,kBAAkB,EAAE;AAC3C,UAAM,UAAqB;AAAA,MACzB,GAAG;AAAA,MACH,YAAYC,YAAW;AAAA,MACvB,cAAc;AAAA,MACd,YAAY,SAAS,aAAa,KAAK;AAAA,IACzC;AACA,UAAM,sBAAsB,IAAI,OAAO;AACvC;AAAA,EACF;AACA,QAAM,OAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAYA,YAAW;AAAA,IACvB,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,WAAW;AAAA,EACb;AACA,QAAM,eAAe,IAAI,QAAQ,QAAQ,IAAI;AAC/C;AAOA,SAAS,mBACP,OACA,MACA,QACA,QACA,IACA,UAAU,OACW;AACrB,MAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO;AAE7D,QAAM,KAAK,mBAAmB,MAAM,QAAQ,MAAM;AAClD,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,UAAM,WAAW,MAAM,kBAAkB,EAAE;AAC3C,UAAM,gBAAgB,SAAS,QAAQ,aAAa,SAAS,aAAa,KAAK;AAC/E,UAAM,iBAAiB,SAAS,QAAQ,cAAc,MAAM,UAAU,IAAI;AAC1E,UAAM,YAAY;AAAA,MAChB,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,mBAAmB;AAAA,IACrB;AAIA,UAAM,UAAqB;AAAA,MACzB,GAAG;AAAA,MACH,YAAYA,YAAW;AAAA,MACvB,cAAc;AAAA,MACd,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,YAAY,4BAA4B,SAAS;AAAA,IACnD;AACA,UAAM,sBAAsB,IAAI,OAAO;AACvC,WAAO,EAAE,MAAM,SAAS,SAAS,MAAM;AAAA,EACzC;AAEA,QAAM,SAAS;AAAA,IACb,WAAW;AAAA,IACX,YAAY,UAAU,IAAI;AAAA,IAC1B,mBAAmB;AAAA,EACrB;AACA,QAAM,OAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAYA,YAAW;AAAA,IACvB,YAAY,4BAA4B,MAAM;AAAA,IAC9C,cAAc;AAAA,IACd,WAAW;AAAA,IACX;AAAA,EACF;AACA,QAAM,eAAe,IAAI,QAAQ,QAAQ,IAAI;AAC7C,SAAO,EAAE,MAAM,SAAS,KAAK;AAC/B;AAOA,SAAS,YAAY,OAAkB,iBAAyB,IAAkB;AAChF,MAAI,CAAC,MAAM,QAAQ,eAAe,EAAG;AAErC,QAAM,UAAU,oBAAI,IAAY,CAAC,eAAe,CAAC;AACjD,QAAM,QAA6C,CAAC,EAAE,QAAQ,iBAAiB,OAAO,EAAE,CAAC;AAEzF,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,EAAE,QAAQ,MAAM,IAAI,MAAM,MAAM;AACtC,QAAI,SAAS,iBAAkB;AAE/B,UAAM,WAAW,MAAM,cAAc,MAAM;AAC3C,eAAW,UAAU,UAAU;AAC7B,YAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,UAAI,KAAK,eAAeA,YAAW,UAAW;AAM9C,UAAI,MAAM,QAAQ,eAAe,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI,CAAC,EAAG;AAExE,yBAAmB,OAAO,KAAK,MAAM,KAAK,QAAQ,KAAK,QAAQ,EAAE;AAEjE,UAAI,CAAC,QAAQ,IAAI,KAAK,MAAM,GAAG;AAC7B,gBAAQ,IAAI,KAAK,MAAM;AACvB,cAAM,KAAK,EAAE,QAAQ,KAAK,QAAQ,OAAO,QAAQ,EAAE,CAAC;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,mBACP,OACA,MACA,QACA,QACA,IACM;AACN,QAAM,KAAK,mBAAmB,MAAM,QAAQ,MAAM;AAClD,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,UAAM,WAAW,MAAM,kBAAkB,EAAE;AAC3C,UAAM,UAAqB,EAAE,GAAG,UAAU,cAAc,GAAG;AAC3D,UAAM,sBAAsB,IAAI,OAAO;AACvC;AAAA,EACF;AAEA,QAAM,OAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAYA,YAAW;AAAA,IACvB,YAAY;AAAA,IACZ,cAAc;AAAA,EAChB;AACA,QAAM,eAAe,IAAI,QAAQ,QAAQ,IAAI;AAC/C;AAEA,eAAe,iBAAiB,KAAoB,IAA+B;AACjF,QAAMC,IAAG,MAAMC,MAAK,QAAQ,IAAI,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAChE,QAAMD,IAAG,WAAW,IAAI,YAAY,KAAK,UAAU,EAAE,IAAI,MAAM,MAAM;AACvE;AAOO,SAAS,2BAA2B,MAAqC;AAC9E,MAAI,KAAK,eAAe,EAAG,QAAO;AAClC,QAAM,KAAK,KAAK,iBAAgB,oBAAI,KAAK,GAAE,YAAY;AACvD,SAAO;AAAA,IACL,IAAI,GAAG,KAAK,OAAO,IAAI,KAAK,MAAM;AAAA,IAClC,WAAW;AAAA,IACX,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,QAAQ,KAAK;AAAA,IACb,cACE,KAAK,WAAW,WAAW,KAAK,gBAAgB,KAAK,QAAQ;AAAA,IAC/D,GAAI,KAAK,WAAW,OAAO,EAAE,eAAe,KAAK,UAAU,KAAK,IAAI,CAAC;AAAA,IACrE,GAAI,KAAK,WAAW,aAChB,EAAE,qBAAqB,KAAK,UAAU,WAAW,IACjD,CAAC;AAAA,IACL,cAAc,UAAU,KAAK,OAAO;AAAA,EACtC;AACF;AAIO,SAAS,oBACd,YACqC;AACrC,SAAO,OAAO,SAAS;AACrB,UAAM,KAAK,2BAA2B,IAAI;AAC1C,QAAI,CAAC,GAAI;AACT,UAAMA,IAAG,MAAMC,MAAK,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,UAAMD,IAAG,WAAW,YAAY,KAAK,UAAU,EAAE,IAAI,MAAM,MAAM;AAAA,EACnE;AACF;AAEA,eAAsB,WAAW,KAAoB,MAAiC;AAKpF,QAAM,KAAK,KAAK,gBAAgB,OAAO,GAAG;AAC1C,QAAM,QAAQ,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK,IAAI;AAI7C,QAAM,WAAW,kBAAkB,IAAI,OAAO,KAAK,OAAO;AAC1D,QAAM,UAAU,KAAK,eAAe;AAGpC,mBAAiB,MAAM,KAAK;AAE5B,MAAI,eAAe;AAEnB,MAAI,KAAK,UAAU;AAEjB,UAAM,OAAO,YAAY,IAAI;AAC7B,QAAI,MAAM;AAGR,yBAAmB,IAAI,OAAO,MAAM,KAAK,QAAQ;AACjD,YAAM,WAAW,WAAW,IAAI;AAChC,YAAM,SAAS;AAAA,QACb,IAAI;AAAA,QACJE,UAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,OAAQ,gBAAe;AAAA,IAC7B;AAAA,EACF,OAAO;AAOL,UAAM,OAAO,YAAY,IAAI;AAC7B,QAAI,qBAAqB;AACzB,QAAI,QAAQ,SAAS,KAAK,SAAS;AACjC,YAAM,WAAW,iBAAiB,IAAI,OAAO,IAAI;AACjD,UAAI,YAAY,aAAa,UAAU;AACrC;AAAA,UACE,IAAI;AAAA,UACJA,UAAS;AAAA,UACT;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,uBAAe;AACf,6BAAqB;AAAA,MACvB,WAAW,CAAC,UAAU;AACpB,cAAMC,cAAa,mBAAmB,IAAI,OAAO,MAAM,EAAE;AACzD,YAAI,IAAI,MAAM,QAAQ,QAAQ,GAAG;AAC/B,6BAAmB,IAAI,OAAOD,UAAS,OAAO,UAAUC,aAAY,EAAE;AAAA,QACxE;AACA,uBAAeA;AACf,6BAAqB;AAAA,MACvB;AAAA,IACF;AAMA,QAAI,CAAC,sBAAsB,KAAK,cAAc;AAC5C,YAAM,gBAAgB,wBAAwB,KAAK,SAAS,KAAK,cAAc,KAAK;AACpF,UAAI,iBAAiB,kBAAkB,KAAK,SAAS;AACnD,cAAM,WAAW,kBAAkB,IAAI,OAAO,aAAa;AAC3D;AAAA,UACE,IAAI;AAAA,UACJD,UAAS;AAAA,UACT;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,eAAe,GAAG;AACzB,gBAAY,IAAI,OAAO,UAAU,EAAE;AAQnC,QAAI,IAAI,0BAA0B,OAAO;AACvC,YAAM,KAAiB;AAAA,QACrB,IAAI,GAAG,KAAK,OAAO,IAAI,KAAK,MAAM;AAAA,QAClC,WAAW;AAAA,QACX,SAAS,KAAK;AAAA,QACd,SAAS,KAAK;AAAA,QACd,QAAQ,KAAK;AAAA,QACb,cACE,KAAK,WAAW,WAAW,KAAK,gBAAgB,KAAK,QAAQ;AAAA,QAC/D,GAAI,KAAK,WAAW,OAAO,EAAE,eAAe,KAAK,UAAU,KAAK,IAAI,CAAC;AAAA,QACrE,GAAI,KAAK,WAAW,aAChB,EAAE,qBAAqB,KAAK,UAAU,WAAW,IACjD,CAAC;AAAA,QACL;AAAA,MACF;AACA,YAAM,iBAAiB,KAAK,EAAE;AAAA,IAChC;AAAA,EACF;AACA,OAAK;AAIL,MAAI,IAAI,gBAAiB,OAAM,IAAI,gBAAgB,IAAI,KAAK;AAC9D;AAuBO,SAAS,qBACd,OACA,OAA+B,CAAC,GACxB;AACR,QAAM,aAAa,oBAAI,IAAoB;AAC3C,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,QAAI,EAAE,SAASE,UAAS,YAAa;AACrC,eAAW,IAAI,EAAE,MAAM,EAAE;AACzB,QAAI,EAAE,SAAS;AACb,iBAAW,SAAS,EAAE,QAAS,YAAW,IAAI,OAAO,EAAE;AAAA,IACzD;AAAA,EACF,CAAC;AAED,QAAM,YAAyD,CAAC;AAChE,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,QAAI,EAAE,SAASA,UAAS,aAAc;AACtC,UAAM,SAAS,WAAW,IAAI,EAAE,IAAI;AACpC,QAAI,CAAC,OAAQ;AACb,QAAI,WAAW,GAAI;AACnB,cAAU,KAAK,EAAE,YAAY,IAAI,WAAW,OAAO,CAAC;AAAA,EACtD,CAAC;AAED,MAAI,WAAW;AACf,aAAW,EAAE,YAAAC,aAAY,WAAAC,WAAU,KAAK,WAAW;AACjD,QAAI,KAAK,YAAY,KAAK,SAAS,SAAS,KAAK,KAAK,WAAW;AAC/D,YAAM,OAAO,mBAAmB,OAAOD,aAAY,KAAK,UAAU,KAAK,SAAS;AAChF,UAAI,CAAC,KAAK,SAAS;AAIjB;AAAA,MACF;AAAA,IACF;AACA,wBAAoB,OAAOA,aAAYC,UAAS;AAChD,UAAM,SAASD,WAAU;AACzB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAkBA,aAAoBC,YAAyB;AAC1F,QAAM,UAAU,CAAC,GAAG,MAAM,aAAaD,WAAU,CAAC;AAClD,QAAM,WAAW,CAAC,GAAG,MAAM,cAAcA,WAAU,CAAC;AAEpD,aAAW,UAAU,SAAS;AAC5B,UAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,gBAAY,OAAO,MAAM,KAAK,QAAQC,YAAW,MAAM;AAAA,EACzD;AACA,aAAW,UAAU,UAAU;AAC7B,UAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,gBAAY,OAAO,MAAMA,YAAW,KAAK,QAAQ,MAAM;AAAA,EACzD;AACF;AAEA,SAAS,YACP,OACA,MACA,WACA,WACA,WACM;AACN,QAAM,SAAS,SAAS;AAIxB,QAAM,qBACJ,KAAK,eAAeC,YAAW,WAAWA,YAAW,WAAW,KAAK;AACvE,QAAM,QACJ,uBAAuBA,YAAW,WAC9B,eAAe,WAAW,WAAW,KAAK,IAAI,IAC9C,uBAAuBA,YAAW,WAChC,eAAe,WAAW,WAAW,KAAK,IAAI,IAC9C,uBAAuBA,YAAW,YAChC,gBAAgB,WAAW,WAAW,KAAK,IAAI,IAC/C,eAAe,WAAW,WAAW,KAAK,IAAI;AAExD,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,WAAW,MAAM,kBAAkB,KAAK;AAC9C,UAAM,SAAoB;AAAA,MACxB,GAAG;AAAA,MACH,YAAY,SAAS,aAAa,MAAM,KAAK,aAAa;AAAA,MAC1D,cAAc,UAAU,SAAS,cAAc,KAAK,YAAY;AAAA,IAClE;AACA,UAAM,sBAAsB,OAAO,MAAM;AACzC;AAAA,EACF;AAEA,QAAM,UAAqB;AAAA,IACzB,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,YAAY;AAAA,EACd;AACA,QAAM,eAAe,OAAO,WAAW,WAAW,OAAO;AAC3D;AAEA,SAAS,UAAU,GAAuB,GAA2C;AACnF,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,CAAC,EAAG,QAAO;AACf,SAAO,IAAI,KAAK,CAAC,EAAE,QAAQ,KAAK,IAAI,KAAK,CAAC,EAAE,QAAQ,IAAI,IAAI;AAC9D;AAEO,SAAS,gBAAgB,KAAyD;AACvF,SAAO,CAAC,SAAS,WAAW,KAAK,IAAI;AACvC;AAoBA,eAAsB,eACpB,OACA,UAA4B,CAAC,GACqB;AAClD,QAAM,aAAa,QAAQ,cAAc,2BAA2B;AACpE,QAAM,MAAM,QAAQ,OAAO,KAAK,IAAI;AACpC,QAAM,SAAuB,CAAC;AAE9B,QAAM,UAAU,QAAQ,WAAW;AACnC,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,QAAI,EAAE,eAAeA,YAAW,SAAU;AAC1C,QAAI,CAAC,EAAE,aAAc;AACrB,UAAM,YAAY,qBAAqB,EAAE,MAAM,UAAU;AACzD,UAAM,MAAM,MAAM,IAAI,KAAK,EAAE,YAAY,EAAE,QAAQ;AACnD,QAAI,MAAM,WAAW;AACnB,YAAM,UAAqB,EAAE,GAAG,GAAG,YAAYA,YAAW,OAAO,YAAY,IAAI;AACjF,YAAM,sBAAsB,IAAI,OAAO;AACvC,aAAO,KAAK;AAAA,QACV,QAAQ;AAAA,QACR,QAAQ,EAAE;AAAA,QACV,QAAQ,EAAE;AAAA,QACV,UAAU,EAAE;AAAA,QACZ,aAAa;AAAA,QACb,OAAO;AAAA,QACP,cAAc,EAAE;AAAA,QAChB,gBAAgB,IAAI,KAAK,GAAG,EAAE,YAAY;AAAA,MAC5C,CAAC;AAKD,oBAAc;AAAA,QACZ,MAAM;AAAA,QACN;AAAA,QACA,SAAS;AAAA,UACP,QAAQ;AAAA,UACR,MAAMA,YAAW;AAAA,UACjB,IAAIA,YAAW;AAAA,QACjB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAED,MAAI,QAAQ,mBAAmB,OAAO,SAAS,GAAG;AAChD,UAAM,kBAAkB,QAAQ,iBAAiB,MAAM;AAAA,EACzD;AAEA,SAAO,EAAE,OAAO,OAAO,QAAQ,OAAO;AACxC;AAEA,eAAe,kBAAkB,iBAAyB,QAAqC;AAC7F,QAAMC,IAAG,MAAMC,MAAK,QAAQ,eAAe,GAAG,EAAE,WAAW,KAAK,CAAC;AACjE,QAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI;AAChE,QAAMD,IAAG,WAAW,iBAAiB,OAAO,MAAM;AACpD;AAEA,eAAsB,gBAAgB,iBAAgD;AACpF,MAAI;AACF,UAAM,MAAM,MAAMA,IAAG,SAAS,iBAAiB,MAAM;AACrD,WAAO,IACJ,MAAM,IAAI,EACV,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAChC,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,CAAe;AAAA,EACjD,SAAS,KAAK;AACZ,QAAK,IAA8B,SAAS,SAAU,QAAO,CAAC;AAC9D,UAAM;AAAA,EACR;AACF;AAcO,SAAS,mBACd,OACA,UAAgC,CAAC,GACrB;AACZ,MAAI,UAAU;AACd,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,OAAO,MAAY;AACvB,QAAI,QAAS;AACb,UAAM,YAAY;AAChB,UAAI;AACF,cAAM,eAAe,OAAO;AAAA,UAC1B,YAAY,QAAQ;AAAA,UACpB,iBAAiB,QAAQ;AAAA,UACzB,SAAS,QAAQ;AAAA,QACnB,CAAC;AACD,YAAI,QAAQ,gBAAiB,OAAM,QAAQ,gBAAgB,KAAK;AAAA,MAClE,SAAS,KAAK;AACZ,gBAAQ,MAAM,yBAAyB,GAAG;AAAA,MAC5C;AAAA,IACF,GAAG;AAAA,EACL;AACA,QAAM,WAAW,YAAY,MAAM,UAAU;AAC7C,MAAI,OAAO,SAAS,UAAU,WAAY,UAAS,MAAM;AACzD,SAAO,MAAM;AACX,cAAU;AACV,kBAAc,QAAQ;AAAA,EACxB;AACF;AAEA,eAAsB,gBAAgB,YAA2C;AAC/E,MAAI;AACF,UAAM,MAAM,MAAMA,IAAG,SAAS,YAAY,MAAM;AAChD,WAAO,IACJ,MAAM,IAAI,EACV,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAChC,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,CAAe;AAAA,EACjD,SAAS,KAAK;AACZ,QAAK,IAA8B,SAAS,SAAU,QAAO,CAAC;AAC9D,UAAM;AAAA,EACR;AACF;;;AGj3BA,SAAS,YAAYE,WAAU;AAC/B,OAAOC,WAAU;AAqBjB,IAAM,OAA0B,CAAC;AAK1B,SAAS,sBACd,UACA,MACA,KACM;AACN,QAAM,IAAI,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC;AAC5D,OAAK,KAAK;AAAA,IACR;AAAA,IACA;AAAA,IACA,OAAO,EAAE;AAAA,IACT,OAAO,EAAE;AAAA,IACT,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,IAC3B,QAAQ;AAAA,EACV,CAAC;AAGD,UAAQ,KAAK,UAAU,QAAQ,YAAY,IAAI,KAAK,EAAE,OAAO,EAAE;AACjE;AAMO,SAAS,wBAA2C;AACzD,SAAO,KAAK,OAAO,GAAG,KAAK,MAAM;AACnC;AAaA,eAAsB,sBACpB,QACA,YACe;AACf,MAAI,OAAO,WAAW,EAAG;AACzB,QAAMC,IAAG,MAAMC,MAAK,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,QAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI;AAChE,QAAMD,IAAG,WAAW,YAAY,OAAO,MAAM;AAC/C;AAMO,SAAS,4BAAqC;AACnD,QAAM,MAAM,QAAQ,IAAI;AACxB,SAAO,QAAQ,OAAO,QAAQ;AAChC;AAIO,SAAS,uBAAuB,OAAuB;AAC5D,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,UAAU,KAAK;AACxB;AAsBA,IAAM,cAAsC,CAAC;AAEtC,SAAS,qBAAqB,MAAkC;AACrE,cAAY,KAAK,IAAI;AACvB;AAEO,SAAS,wBAAgD;AAC9D,SAAO,YAAY,OAAO,GAAG,YAAY,MAAM;AACjD;AAMO,SAAS,uBAAgC;AAC9C,QAAM,MAAM,QAAQ,IAAI;AACxB,SAAO,QAAQ,OAAO,QAAQ;AAChC;AAEA,eAAsB,uBACpB,OACA,cACe;AACf,MAAI,MAAM,WAAW,EAAG;AACxB,QAAME,IAAG,MAAMC,MAAK,QAAQ,YAAY,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9D,QAAM,QAAQ,MAAM,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,GAAG,GAAG,KAAI,oBAAI,KAAK,GAAE,YAAY,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI;AACpG,QAAMD,IAAG,WAAW,cAAc,OAAO,MAAM;AACjD;AAEO,SAAS,2BAA2B,OAAuB;AAChE,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,UAAU,KAAK;AACxB;;;AC7JA,SAAS,YAAYE,WAAU;AAC/B,OAAOC,WAAU;AACjB,OAAO,YAA6B;AACpC,SAAS,aAAAC,kBAAiB;AAE1B,SAAS,YAAAC,WAAU,aAAAC,kBAAiB;;;ACLpC,SAAS,YAAYC,WAAU;AAC/B,OAAOC,WAAU;AACjB,SAAS,SAAS,iBAAiB;AA2NnC,SAA4B,mBAAnBC,wBAAqC;AA1MvC,IAAM,0BAA0B,oBAAI,IAAI,CAAC,OAAO,QAAQ,QAAQ,OAAO,QAAQ,KAAK,CAAC;AACrF,IAAM,yBAAyB,oBAAI,IAAI,CAAC,SAAS,MAAM,CAAC;AACxD,IAAM,eAAe,oBAAI,IAAI;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,SAAS,aAAa,MAAoD;AAC/E,QAAM,MAAMD,MAAK,QAAQ,IAAI;AAC7B,MAAI,uBAAuB,IAAI,GAAG,EAAG,QAAO,EAAE,OAAO,MAAM,UAAU,IAAI,MAAM,CAAC,EAAE;AAMlF,MAAI,SAAS,UAAU,KAAK,WAAW,OAAO,GAAG;AAC/C,QAAI,kBAAkB,IAAI,EAAG,QAAO,EAAE,OAAO,OAAO,UAAU,GAAG;AACjE,WAAO,EAAE,OAAO,MAAM,UAAU,MAAM;AAAA,EACxC;AACA,SAAO,EAAE,OAAO,OAAO,UAAU,GAAG;AACtC;AAeO,SAAS,WAAW,UAA2B;AACpD,QAAM,aAAa,SAAS,QAAQ,OAAO,GAAG;AAC9C,QAAM,WAAW,WAAW,MAAM,GAAG;AACrC,aAAW,OAAO,UAAU;AAC1B,QAAI,QAAQ,eAAe,QAAQ,kBAAkB,QAAQ,qBAAqB;AAChF,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,OAAO,SAAS,SAAS,SAAS,CAAC,KAAK;AAC9C,SAAO,4CAA4C,KAAK,IAAI;AAC9D;AAOO,SAAS,kBAAkB,MAAuB;AACvD,MACE,SAAS,mBACT,SAAS,kBACT,SAAS,eACT;AACA,WAAO;AAAA,EACT;AAEA,SAAO,+CAA+C,KAAK,IAAI;AACjE;AAUO,SAAS,qBAAqB,KAAqB;AACxD,QAAM,MAAM,IAAI;AAChB,QAAM,MAAgB,IAAI,MAAM,GAAG;AACnC,MAAI,IAAI;AAER,MAAI,WAAuB;AAC3B,MAAI,UAAU;AACd,SAAO,IAAI,KAAK;AACd,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,aAAa,GAAG;AAClB,UAAI,CAAC,IAAI;AACT,UAAI,SAAS;AACX,kBAAU;AAAA,MACZ,WAAW,MAAM,MAAM;AACrB,kBAAU;AAAA,MACZ,WAAW,MAAM,UAAU;AACzB,mBAAW;AAAA,MACb;AACA;AACA;AAAA,IACF;AACA,QAAI,MAAM,OAAO,IAAI,IAAI,KAAK;AAC5B,YAAM,OAAO,IAAI,IAAI,CAAC;AACtB,UAAI,SAAS,KAAK;AAChB,YAAI,CAAC,IAAI;AACT,YAAI,IAAI,CAAC,IAAI;AACb,YAAI,IAAI,IAAI;AACZ,eAAO,IAAI,OAAO,IAAI,CAAC,MAAM,MAAM;AACjC,cAAI,CAAC,IAAI;AACT;AAAA,QACF;AACA,YAAI;AACJ;AAAA,MACF;AACA,UAAI,SAAS,KAAK;AAChB,YAAI,CAAC,IAAI;AACT,YAAI,IAAI,CAAC,IAAI;AACb,YAAI,IAAI,IAAI;AACZ,eAAO,IAAI,KAAK;AACd,cAAI,IAAI,CAAC,MAAM,MAAM;AACnB,gBAAI,CAAC,IAAI;AACT;AACA;AAAA,UACF;AACA,cAAI,IAAI,CAAC,MAAM,OAAO,IAAI,IAAI,OAAO,IAAI,IAAI,CAAC,MAAM,KAAK;AACvD,gBAAI,CAAC,IAAI;AACT,gBAAI,IAAI,CAAC,IAAI;AACb,iBAAK;AACL;AAAA,UACF;AACA,cAAI,CAAC,IAAI;AACT;AAAA,QACF;AACA,YAAI;AACJ;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,IAAI;AACT,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,IAAK,YAAW;AACpD;AAAA,EACF;AACA,SAAO,IAAI,KAAK,EAAE;AACpB;AAYA,IAAM,WAAW;AAEV,SAAS,eAAe,WAAmB,MAAuB;AACvE,MAAI,OAAO,cAAc,YAAY,UAAU,WAAW,EAAG,QAAO;AAIpE,MAAI,CAAC,SAAS,KAAK,SAAS,EAAG,QAAO;AACtC,QAAM,CAAC,YAAY,UAAU,IAAI,KAAK,MAAM,GAAG;AAC/C,MAAI;AACJ,MAAI;AAEF,UAAM,YAAY,UAAU,WAAW,IAAI,IAAI,QAAQ,SAAS,KAAK;AACrE,aAAS,IAAI,IAAI,SAAS;AAAA,EAC5B,QAAQ;AACN,WAAO;AAAA,EACT;AACA,MAAI,OAAO,SAAS,YAAY,OAAO,cAAc,IAAI,YAAY,EAAG,QAAO;AAC/E,MAAI,cAAc,OAAO,SAAS,WAAY,QAAO;AACrD,SAAO;AACT;AAKO,SAAS,aAAa,KAA6C;AACxE,MAAI,CAAC,IAAK,QAAO;AACjB,SAAO,IAAI,QAAQ,iBAAiB,EAAE,EAAE,KAAK,KAAK;AACpD;AAEA,eAAsB,SAAY,UAA8B;AAC9D,QAAM,MAAM,MAAMD,IAAG,SAAS,UAAU,MAAM;AAC9C,SAAO,KAAK,MAAM,GAAG;AACvB;AAEA,eAAsB,SAAY,UAA8B;AAC9D,QAAM,MAAM,MAAMA,IAAG,SAAS,UAAU,MAAM;AAC9C,SAAO,UAAU,GAAG;AACtB;AAEA,eAAsB,OAAO,GAA6B;AACxD,MAAI;AACF,UAAMA,IAAG,OAAO,CAAC;AACjB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ACxNA,SAAS,YAAYG,WAAU;AAC/B,OAAOC,WAAU;AACjB,SAAS,SAAS,iBAAiB;AAQnC,IAAM,mBAAmB;AAEzB,SAAS,qBAAqB,SAAyC;AACrE,QAAM,MAA8B,CAAC;AACrC,aAAW,WAAW,QAAQ,MAAM,IAAI,GAAG;AACzC,UAAM,OAAO,QAAQ,MAAM,GAAG,EAAE,CAAC,GAAG,KAAK;AACzC,QAAI,CAAC,KAAM;AACX,QAAI,KAAK,WAAW,GAAG,EAAG;AAC1B,UAAM,QAAQ,iBAAiB,KAAK,IAAI;AACxC,QAAI,CAAC,MAAO;AACZ,UAAM,OAAO,MAAM,CAAC,EAAG,YAAY;AACnC,UAAM,UAAU,MAAM,CAAC,KAAK;AAC5B,QAAI,IAAI,IAAI;AAAA,EACd;AACA,SAAO;AACT;AAiBA,SAAS,kBAAkB,WAAkD;AAC3E,QAAM,MAA8B,CAAC;AAGrC,aAAW,SAAS,UAAU,SAAS,gBAAgB,CAAC,GAAG;AACzD,UAAM,QAAQ,iBAAiB,KAAK,KAAK;AACzC,QAAI,CAAC,MAAO;AACZ,QAAI,MAAM,CAAC,EAAG,YAAY,CAAC,IAAI,MAAM,CAAC,KAAK;AAAA,EAC7C;AAGA,QAAM,aAAa,UAAU,MAAM,QAAQ,gBAAgB,CAAC;AAC5D,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,UAAU,GAAG;AACtD,QAAI,KAAK,YAAY,MAAM,SAAU;AACrC,UAAM,MAAM,OAAO,UAAU,WAAW,QAAS,OAAO,WAAW;AACnE,QAAI,KAAK,YAAY,CAAC,IAAI,IAAI,QAAQ,iBAAiB,EAAE;AAAA,EAC3D;AACA,SAAO;AACT;AAWA,eAAsB,sBAAsB,YAAmD;AAC7F,QAAM,gBAAgBC,MAAK,KAAK,YAAY,gBAAgB;AAC5D,QAAM,mBAAmBA,MAAK,KAAK,YAAY,kBAAkB;AACjE,QAAM,YAAYA,MAAK,KAAK,YAAY,UAAU;AAElD,QAAM,eAAe,MAAM,OAAO,aAAa;AAC/C,QAAM,kBAAkB,MAAM,OAAO,gBAAgB;AACrD,QAAM,WAAW,MAAM,OAAO,SAAS;AACvC,MAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,SAAU,QAAO;AAE3D,MAAI,OAAOA,MAAK,SAAS,UAAU;AACnC,MAAI;AACJ,QAAM,eAAuC,CAAC;AAE9C,MAAI,cAAc;AAChB,UAAM,MAAM,MAAMC,IAAG,SAAS,eAAe,MAAM;AACnD,UAAM,YAAY,UAAU,GAAG;AAC/B,WAAO,UAAU,SAAS,QAAQ,UAAU,MAAM,QAAQ,QAAQ;AAClE,cAAU,UAAU,SAAS,WAAW,UAAU,MAAM,QAAQ,WAAW;AAC3E,WAAO,OAAO,cAAc,kBAAkB,SAAS,CAAC;AAAA,EAC1D;AAEA,MAAI,iBAAiB;AACnB,UAAM,MAAM,MAAMA,IAAG,SAAS,kBAAkB,MAAM;AACtD,WAAO,OAAO,cAAc,qBAAqB,GAAG,CAAC;AAAA,EACvD;AAEA,SAAO,EAAE,MAAM,SAAS,aAAa;AACvC;AAKO,SAAS,gBAAgB,SAAqC;AACnE,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,SAAS,QAAQ;AAAA,IACjB,cAAc,QAAQ;AAAA,EACxB;AACF;;;AC9GA,SAAS,YAAYC,WAAU;AAC/B,OAAOC,WAAU;AACjB,SAAS,iBAAiB;AAkB1B,eAAsB,eAAe,UAAkD;AACrF,QAAM,aAAa;AAAA,IACjBC,MAAK,KAAK,UAAU,YAAY;AAAA,IAChCA,MAAK,KAAK,UAAU,WAAW,YAAY;AAAA,EAC7C;AACA,aAAW,QAAQ,YAAY;AAC7B,QAAI,MAAM,OAAO,IAAI,GAAG;AACtB,YAAM,MAAM,MAAMC,IAAG,SAAS,MAAM,MAAM;AAC1C,aAAO,gBAAgB,GAAG;AAAA,IAC5B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,KAA6B;AACpD,QAAM,QAA0B,CAAC;AACjC,aAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,CAAC,WAAW,QAAQ,WAAW,GAAG,EAAG;AACzC,UAAM,QAAQ,iBAAiB,KAAK,OAAO;AAC3C,QAAI,CAAC,MAAO;AACZ,UAAM,KAAK,EAAE,SAAS,MAAM,CAAC,GAAI,QAAQ,MAAM,CAAC,EAAG,KAAK,EAAE,CAAC;AAAA,EAC7D;AACA,SAAO,EAAE,MAAM;AACjB;AAKO,SAAS,WAAW,MAAsB,UAAiC;AAChF,QAAM,aAAa,SAAS,MAAMD,MAAK,GAAG,EAAE,KAAK,GAAG;AACpD,aAAW,QAAQ,KAAK,OAAO;AAC7B,QAAI,eAAe,KAAK,SAAS,UAAU,EAAG,QAAO,KAAK;AAAA,EAC5D;AACA,SAAO;AACT;AAEA,SAAS,eAAe,YAAoB,UAA2B;AACrE,MAAI,UAAU,WAAW,WAAW,GAAG,IAAI,WAAW,MAAM,CAAC,IAAI;AACjE,MAAI,YAAY,IAAK,QAAO,CAAC,SAAS,SAAS,GAAG;AAClD,MAAI,YAAY,QAAQ,YAAY,GAAI,QAAO;AAE/C,MAAI,QAAQ,SAAS,GAAG,EAAG,WAAU,UAAU;AAC/C,MAAI,UAAU,UAAU,SAAS,EAAE,KAAK,KAAK,CAAC,EAAG,QAAO;AAExD,MAAI,CAAC,QAAQ,SAAS,GAAG,KAAK,UAAU,UAAU,UAAU,OAAO,EAAE,KAAK,KAAK,CAAC,EAAG,QAAO;AAC1F,SAAO;AACT;AAMA,eAAsB,sBAAsB,YAA4C;AACtF,QAAM,UAAUA,MAAK,KAAK,YAAY,cAAc;AACpD,MAAI,CAAE,MAAM,OAAO,OAAO,EAAI,QAAO;AACrC,MAAI;AACF,UAAM,MAAM,MAAM,SAA4B,OAAO;AACrD,QAAI,CAAC,IAAI,OAAQ,QAAO;AACxB,QAAI,OAAO,IAAI,WAAW,SAAU,QAAO,IAAI;AAC/C,QAAI,OAAO,IAAI,WAAW,YAAY,OAAO,IAAI,OAAO,SAAS,SAAU,QAAO,IAAI,OAAO;AAC7F,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAIA,eAAsB,oBACpB,YACA,UACA,YAC6B;AAC7B,MAAI,cAAc,aAAa,QAAW;AACxC,UAAM,QAAQ,WAAW,YAAY,QAAQ;AAC7C,QAAI,MAAO,QAAO;AAAA,EACpB;AACA,QAAM,SAAS,MAAM,sBAAsB,UAAU;AACrD,SAAO,UAAU;AACnB;;;AHlFA,IAAM,qBAAqB;AAM3B,SAAS,iBAAyB;AAChC,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,IAAI,OAAO,SAAS,KAAK,EAAE;AACjC,SAAO,OAAO,SAAS,CAAC,KAAK,KAAK,IAAI,IAAI;AAC5C;AAEA,SAAS,eAAe,KAAuC;AAC7D,QAAM,KAAK,IAAI;AACf,MAAI,CAAC,GAAI,QAAO;AAChB,MAAI,MAAM,QAAQ,EAAE,EAAG,QAAO,GAAG,SAAS,IAAI,KAAK;AACnD,MAAI,MAAM,QAAQ,GAAG,QAAQ,EAAG,QAAO,GAAG,SAAS,SAAS,IAAI,GAAG,WAAW;AAC9E,SAAO;AACT;AAEA,eAAe,cAAc,UAA0C;AACrE,QAAM,gBAAgBE,MAAK,KAAK,UAAU,YAAY;AACtD,MAAI,CAAE,MAAM,OAAO,aAAa,EAAI,QAAO;AAC3C,QAAM,MAAM,MAAMC,IAAG,SAAS,eAAe,MAAM;AACnD,SAAO,OAAO,EAAE,IAAI,GAAG;AACzB;AAOA,eAAe,SACb,OACA,UACA,SACA,OACe;AACf,iBAAe,QAAQ,SAAiB,OAA8B;AACpE,QAAI,QAAQ,QAAQ,SAAU;AAC9B,UAAM,UAAU,MAAMA,IAAG,QAAQ,SAAS,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AACjF,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,UAAI,aAAa,IAAI,MAAM,IAAI,EAAG;AAClC,YAAM,QAAQD,MAAK,KAAK,SAAS,MAAM,IAAI;AAC3C,UAAI,QAAQ,IAAI;AACd,cAAM,MAAMA,MAAK,SAAS,UAAU,KAAK,EAAE,MAAMA,MAAK,GAAG,EAAE,KAAK,GAAG;AAInE,YAAI,OAAO,QAAQ,GAAG,QAAQ,MAAM,GAAG,EAAG;AAAA,MAC5C;AACA,YAAM,MAAM,KAAK;AACjB,YAAM,QAAQ,OAAO,QAAQ,CAAC;AAAA,IAChC;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,CAAC;AACxB;AAEA,eAAe,qBACb,UACA,OACmB;AACnB,QAAM,QAAQ,oBAAI,IAAY;AAC9B,QAAM,YAAY,eAAe;AAEjC,aAAW,OAAO,OAAO;AACvB,UAAM,UAAU,IAAI,QAAQ,SAAS,EAAE;AAEvC,QAAI,CAAC,QAAQ,SAAS,GAAG,GAAG;AAC1B,YAAM,YAAYA,MAAK,KAAK,UAAU,OAAO;AAC7C,UAAI,MAAM,OAAOA,MAAK,KAAK,WAAW,cAAc,CAAC,EAAG,OAAM,IAAI,SAAS;AAC3E;AAAA,IACF;AAEA,UAAM,WAAW,QAAQ,MAAM,GAAG;AAClC,UAAM,iBAA2B,CAAC;AAClC,eAAW,OAAO,UAAU;AAC1B,UAAI,IAAI,SAAS,GAAG,EAAG;AACvB,qBAAe,KAAK,GAAG;AAAA,IACzB;AACA,UAAM,QAAQA,MAAK,KAAK,UAAU,GAAG,cAAc;AACnD,QAAI,CAAE,MAAM,OAAO,KAAK,EAAI;AAE5B,UAAM,gBAAgB,QAAQ,SAAS,IAAI;AAC3C,UAAM,YAAY,gBACd,YACA,KAAK,IAAI,GAAG,SAAS,SAAS,eAAe,SAAS,CAAC;AAE3D,UAAM,SAAS,OAAO,UAAU,EAAE,UAAU,WAAW,IAAI,KAAK,GAAG,OAAO,QAAQ;AAChF,YAAM,MAAMA,MAAK,SAAS,UAAU,GAAG,EAAE,MAAMA,MAAK,GAAG,EAAE,KAAK,GAAG;AACjE,UAAIE,WAAU,KAAK,OAAO,KAAM,MAAM,OAAOF,MAAK,KAAK,KAAK,cAAc,CAAC,GAAI;AAC7E,cAAM,IAAI,GAAG;AAAA,MACf;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO,CAAC,GAAG,KAAK;AAClB;AAEA,eAAe,oBACb,UACA,KACmC;AACnC,QAAM,UAAUA,MAAK,KAAK,KAAK,cAAc;AAC7C,MAAI,CAAE,MAAM,OAAO,OAAO,EAAI,QAAO;AACrC,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,SAAsB,OAAO;AAAA,EAC3C,SAAS,KAAK;AACZ,0BAAsB,YAAYA,MAAK,SAAS,UAAU,OAAO,GAAG,GAAG;AACvE,WAAO;AAAA,EACT;AACA,MAAI,CAAC,IAAI,KAAM,QAAO;AACtB,QAAM,OAAoB;AAAA,IACxB,IAAIG,WAAU,IAAI,IAAI;AAAA,IACtB,MAAMC,UAAS;AAAA,IACf,MAAM,IAAI;AAAA,IACV,UAAU;AAAA,IACV,SAAS,IAAI;AAAA,IACb,cAAc,IAAI,gBAAgB,CAAC;AAAA,IACnC,UAAUJ,MAAK,SAAS,UAAU,GAAG;AAAA,IACrC,GAAI,IAAI,SAAS,OAAO,EAAE,YAAY,IAAI,QAAQ,KAAK,IAAI,CAAC;AAAA,EAC9D;AACA,SAAO,EAAE,KAAK,KAAK,KAAK;AAC1B;AAEA,eAAe,kBACb,UACA,KACmC;AACnC,QAAM,KAAK,MAAM,sBAAsB,GAAG;AAC1C,MAAI,CAAC,GAAI,QAAO;AAChB,QAAM,MAAM,gBAAgB,EAAE;AAC9B,QAAM,OAAoB;AAAA,IACxB,IAAIG,WAAU,GAAG,IAAI;AAAA,IACrB,MAAMC,UAAS;AAAA,IACf,MAAM,GAAG;AAAA,IACT,UAAU;AAAA,IACV,SAAS,GAAG;AAAA,IACZ,cAAc,GAAG;AAAA,IACjB,UAAUJ,MAAK,SAAS,UAAU,GAAG;AAAA,EACvC;AACA,SAAO,EAAE,KAAK,KAAK,KAAK;AAC1B;AAaA,eAAsB,iBAAiB,UAAgD;AACrF,QAAM,cAAcA,MAAK,KAAK,UAAU,cAAc;AACtD,MAAI,UAAkC;AACtC,MAAI,MAAM,OAAO,WAAW,GAAG;AAC7B,QAAI;AACF,gBAAU,MAAM,SAA0B,WAAW;AAAA,IACvD,SAAS,KAAK;AACZ;AAAA,QACE;AAAA,QACAA,MAAK,SAAS,UAAU,WAAW;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,UAAU,UAAU,eAAe,OAAO,IAAI;AAEpD,QAAM,gBAA0B,CAAC;AACjC,MAAI,SAAS;AACX,kBAAc,KAAK,GAAI,MAAM,qBAAqB,UAAU,OAAO,CAAE;AAAA,EACvE,OAAO;AACL,QAAI,WAAW,QAAQ,KAAM,eAAc,KAAK,QAAQ;AACxD,UAAM,KAAK,MAAM,cAAc,QAAQ;AACvC,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA,EAAE,UAAU,eAAe,GAAG,GAAG;AAAA,MACjC,OAAO,QAAQ;AACb,YAAI,MAAM,OAAOA,MAAK,KAAK,KAAK,cAAc,CAAC,GAAG;AAChD,wBAAc,KAAK,GAAG;AAAA,QACxB,WACG,MAAM,OAAOA,MAAK,KAAK,KAAK,gBAAgB,CAAC,KAC7C,MAAM,OAAOA,MAAK,KAAK,KAAK,kBAAkB,CAAC,KAC/C,MAAM,OAAOA,MAAK,KAAK,KAAK,UAAU,CAAC,GACxC;AACA,wBAAc,KAAK,GAAG;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,gBAAc,KAAK;AAEnB,QAAM,OAAO,oBAAI,IAAoB;AACrC,QAAM,MAA2B,CAAC;AAClC,aAAW,OAAO,eAAe;AAC/B,UAAM,UACH,MAAM,oBAAoB,UAAU,GAAG,KACvC,MAAM,kBAAkB,UAAU,GAAG;AACxC,QAAI,CAAC,QAAS;AAEd,UAAM,cAAc,KAAK,IAAI,QAAQ,KAAK,IAAI;AAC9C,QAAI,gBAAgB,QAAW;AAC7B,YAAM,IAAIA,MAAK,SAAS,UAAU,WAAW,KAAK;AAClD,YAAM,IAAIA,MAAK,SAAS,UAAU,GAAG,KAAK;AAC1C,cAAQ;AAAA,QACN,kCAAkC,QAAQ,KAAK,IAAI,oBAAe,CAAC,cAAc,CAAC;AAAA,MACpF;AACA;AAAA,IACF;AACA,SAAK,IAAI,QAAQ,KAAK,MAAM,GAAG;AAC/B,QAAI,KAAK,OAAO;AAAA,EAClB;AAKA,QAAM,aAAa,MAAM,eAAe,QAAQ;AAChD,aAAW,WAAW,KAAK;AACzB,UAAM,QAAQ,MAAM,oBAAoB,YAAY,QAAQ,KAAK,UAAU,QAAQ,GAAG;AACtF,QAAI,UAAU,OAAW,SAAQ,KAAK,QAAQ;AAAA,EAChD;AAEA,SAAO;AACT;AAEO,SAAS,gBAAgB,OAAkB,UAAuC;AACvF,MAAI,aAAa;AACjB,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,MAAM,QAAQ,QAAQ,KAAK,EAAE,GAAG;AACnC,YAAM,QAAQ,QAAQ,KAAK,IAAI,EAAE,GAAG,QAAQ,MAAM,eAAe,SAAS,CAAC;AAC3E;AACA;AAAA,IACF;AAIA,UAAM,WAAW,MAAM,kBAAkB,QAAQ,KAAK,EAAE;AACxD,UAAM,sBACJ,SAAS,kBAAkB,SAAS,WAAW;AACjD,UAAM,sBAAsB,QAAQ,KAAK,IAAI;AAAA,MAC3C,GAAG;AAAA,MACH,GAAG,QAAQ;AAAA,MACX,eAAe;AAAA,IACjB,CAAC;AAAA,EACH;AACA,SAAO;AACT;;;AIhRA,OAAOK,WAAU;AACjB,SAAS,YAAYC,WAAU;AAC/B,SAAS,yBAAyB;AAElC,SAAS,YAAAC,iBAAgB;AAgDzB,IAAM,2BAA2B,oBAAI,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,WAAW,OAAkBC,YAAmB,YAAoC;AAC3F,MAAI,CAAC,MAAM,QAAQA,UAAS,EAAG;AAC/B,QAAM,OAAO,MAAM,kBAAkBA,UAAS;AAC9C,MAAI,KAAK,SAASC,UAAS,YAAa;AACxC,QAAM,MAAM,IAAI,IAAI,KAAK,WAAW,CAAC,CAAC;AACtC,aAAW,KAAK,YAAY;AAC1B,QAAI,CAAC,EAAG;AACR,QAAI,MAAM,KAAK,KAAM;AACrB,QAAI,IAAI,CAAC;AAAA,EACX;AACA,MAAI,IAAI,SAAS,EAAG;AACpB,QAAM,UAAuB,EAAE,GAAG,MAAM,SAAS,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE;AACjE,QAAM,sBAAsBD,YAAW,OAAO;AAChD;AAEA,SAAS,oBAAoB,UAAoD;AAC/E,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,KAAK,UAAU;AACxB,QAAI,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,EAAE;AAC9B,QAAI,IAAIE,MAAK,SAAS,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE;AAAA,EACzC;AACA,SAAO;AACT;AAEA,eAAe,sBACb,OACA,UACA,cACe;AACf,MAAI,cAA6B;AACjC,aAAW,QAAQ,CAAC,sBAAsB,qBAAqB,GAAG;AAChE,UAAM,MAAMA,MAAK,KAAK,UAAU,IAAI;AACpC,QAAI,MAAM,OAAO,GAAG,GAAG;AACrB,oBAAc;AACd;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,YAAa;AAElB,MAAI;AACJ,MAAI;AACF,cAAU,MAAM,SAAsB,WAAW;AAAA,EACnD,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACAA,MAAK,SAAS,UAAU,WAAW;AAAA,MACnC;AAAA,IACF;AACA;AAAA,EACF;AACA,MAAI,CAAC,SAAS,SAAU;AAExB,aAAW,CAAC,aAAa,GAAG,KAAK,OAAO,QAAQ,QAAQ,QAAQ,GAAG;AACjE,UAAMF,aAAY,aAAa,IAAI,WAAW;AAC9C,QAAI,CAACA,WAAW;AAChB,UAAM,UAAU,oBAAI,IAAY,CAAC,WAAW,CAAC;AAC7C,QAAI,IAAI,eAAgB,SAAQ,IAAI,IAAI,cAAc;AACtD,QAAI,IAAI,SAAU,SAAQ,IAAI,IAAI,QAAQ;AAC1C,eAAW,OAAOA,YAAW,OAAO;AAAA,EACtC;AACF;AAEA,IAAM,aAAa,oBAAI,IAAI;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,sBAAsB,SAA2B;AACxD,QAAM,MAAgB,CAAC;AAIvB,QAAM,YAAY;AAClB,aAAW,OAAO,QAAQ,MAAM,IAAI,GAAG;AACrC,UAAM,IAAI,UAAU,KAAK,GAAG;AAC5B,QAAI,CAAC,EAAG;AACR,UAAM,OAAO,EAAE,CAAC;AAChB,UAAM,YAAY;AAClB,QAAI;AACJ,YAAQ,OAAO,UAAU,KAAK,IAAI,OAAO,MAAM;AAC7C,YAAM,MAAM,KAAK,CAAC,EAAG,YAAY;AACjC,UAAI,CAAC,WAAW,IAAI,GAAG,EAAG;AAC1B,YAAM,QAAQ,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK;AAC/C,UAAI,MAAO,KAAI,KAAK,KAAK;AAAA,IAC3B;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAe,yBACb,OACA,UACe;AACf,aAAW,WAAW,UAAU;AAC9B,UAAM,iBAAiBE,MAAK,KAAK,QAAQ,KAAK,YAAY;AAC1D,QAAI,CAAE,MAAM,OAAO,cAAc,EAAI;AACrC,QAAI;AACJ,QAAI;AACF,gBAAU,MAAMC,IAAG,SAAS,gBAAgB,MAAM;AAAA,IACpD,SAAS,KAAK;AACZ,4BAAsB,sBAAsB,gBAAgB,GAAG;AAC/D;AAAA,IACF;AACA,UAAM,UAAU,sBAAsB,OAAO;AAC7C,QAAI,QAAQ,SAAS,EAAG,YAAW,OAAO,QAAQ,KAAK,IAAI,OAAO;AAAA,EACpE;AACF;AAEA,eAAe,cAAc,OAAe,QAAQ,GAAG,MAAM,GAAsB;AACjF,MAAI,QAAQ,IAAK,QAAO,CAAC;AACzB,QAAM,MAAgB,CAAC;AACvB,QAAM,UAAU,MAAMA,IAAG,QAAQ,OAAO,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AAC/E,aAAW,SAAS,SAAS;AAC3B,QAAI,MAAM,YAAY,GAAG;AACvB,UAAI,aAAa,IAAI,MAAM,IAAI,EAAG;AAClC,UAAI,KAAK,GAAI,MAAM,cAAcD,MAAK,KAAK,OAAO,MAAM,IAAI,GAAG,QAAQ,GAAG,GAAG,CAAE;AAAA,IACjF,WAAW,MAAM,OAAO,KAAK,uBAAuB,IAAIA,MAAK,QAAQ,MAAM,IAAI,CAAC,GAAG;AACjF,UAAI,KAAKA,MAAK,KAAK,OAAO,MAAM,IAAI,CAAC;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,aAAa,MAAc,WAAyC;AAC3E,QAAM,KAAK,aAAa;AACxB,SAAO;AAAA,IACL;AAAA,IACA,GAAG,IAAI,IAAI,EAAE;AAAA,IACb,GAAG,IAAI,IAAI,EAAE;AAAA,IACb,GAAG,IAAI,IAAI,EAAE;AAAA,EACf;AACF;AAEA,SAAS,iBACP,KACA,QACe;AAIf,QAAM,WAAW,IAAI,MAAM;AAC3B,QAAM,cAAc,UAAU,OAAO,UAAU,aAAa;AAC5D,MAAI,eAAe,OAAO,IAAI,WAAW,EAAG,QAAO,OAAO,IAAI,WAAW;AAEzE,QAAM,WAAW,IAAI,UAAU,QAAQ;AACvC,MAAI,YAAY,OAAO,IAAI,QAAQ,EAAG,QAAO,OAAO,IAAI,QAAQ;AAEhE,QAAM,WAAW,IAAI,UAAU;AAC/B,MAAI,YAAY,OAAO,IAAI,QAAQ,EAAG,QAAO,OAAO,IAAI,QAAQ;AAEhE,SAAO;AACT;AAEA,eAAe,kBACb,OACA,UACA,cACe;AACf,QAAM,QAAQ,MAAM,cAAc,QAAQ;AAC1C,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,MAAMC,IAAG,SAAS,MAAM,MAAM;AAC9C,QAAI;AACJ,QAAI;AACF,aAAO,kBAAkB,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAW;AAAA,IACnE,QAAQ;AACN;AAAA,IACF;AACA,eAAW,OAAO,MAAM;AACtB,UAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,UAAU,KAAM;AACvC,UAAI,CAAC,yBAAyB,IAAI,IAAI,IAAI,EAAG;AAC7C,YAAM,SAAS,iBAAiB,KAAK,YAAY;AACjD,UAAI,CAAC,OAAQ;AACb,iBAAW,OAAO,QAAQ,aAAa,IAAI,SAAS,MAAM,IAAI,SAAS,SAAS,CAAC;AAAA,IACnF;AAAA,EACF;AACF;AAEA,eAAsB,kBACpB,OACA,UACA,UACe;AACf,QAAM,SAAS,oBAAoB,QAAQ;AAC3C,QAAM,sBAAsB,OAAO,UAAU,MAAM;AACnD,QAAM,yBAAyB,OAAO,QAAQ;AAC9C,QAAM,kBAAkB,OAAO,UAAU,MAAM;AACjD;;;ACzPA,OAAOC,YAAU;AAQjB;AAAA,EACE,YAAAC;AAAA,EACA,YAAAC;AAAA,EACA,cAAAC;AAAA,EACA,cAAAC;AAAA,EACA;AAAA,OACK;;;ACdP,OAAOC,YAAU;AAejB,eAAsB,MAAM,YAAyC;AACnE,QAAM,WAAWC,OAAK,KAAK,YAAY,gBAAgB;AACvD,MAAI,CAAE,MAAM,OAAO,QAAQ,EAAI,QAAO,CAAC;AACvC,QAAM,MAAM,MAAM,SAAuB,QAAQ;AACjD,SAAO;AAAA,IACL;AAAA,MACE,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,UAAU,IAAI;AAAA,MACd,QAAQ,IAAI;AAAA,MACZ,eAAe,IAAI,kBAAkB,SAAY,OAAO,IAAI,aAAa,IAAI;AAAA,MAC7E,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAEO,IAAM,qBAAqB,EAAE,MAAM,kBAAkB,MAAM;;;AC/BlE,SAAS,YAAYC,YAAU;AAC/B,OAAOC,YAAU;;;ACDjB,SAAS,YAAYC,YAAU;AAC/B,OAAOC,YAAU;AAkBV,SAAS,eAAe,QAA+B;AAC5D,QAAM,IAAI,OAAO,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAC3C,UAAQ,GAAG;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAMO,SAAS,sBAAsB,KAA4C;AAChF,QAAM,IAAI,IAAI;AAAA,IACZ;AAAA,EACF;AACA,MAAI,CAAC,KAAK,CAAC,EAAE,OAAQ,QAAO;AAC5B,QAAM,SAAS,eAAe,EAAE,OAAO,MAAO;AAC9C,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO;AAAA,IACL,MAAM,EAAE,OAAO;AAAA,IACf,MAAM,EAAE,OAAO,OAAO,OAAO,EAAE,OAAO,IAAI,IAAI;AAAA,IAC9C,UAAU,EAAE,OAAO,MAAM;AAAA,IACzB;AAAA,IACA,eAAe;AAAA,EACjB;AACF;AAEA,eAAsB,aAAa,UAA0C;AAC3E,MAAI;AACF,WAAO,MAAMD,KAAG,SAAS,UAAU,MAAM;AAAA,EAC3C,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,UACpB,YACA,YACwB;AACxB,aAAW,OAAO,YAAY;AAC5B,UAAM,MAAMC,OAAK,KAAK,YAAY,GAAG;AACrC,UAAM,UAAU,MAAM,aAAa,GAAG;AACtC,QAAI,YAAY,KAAM,QAAO;AAAA,EAC/B;AACA,SAAO;AACT;AAKO,SAAS,gBACd,OACkD;AAClD,QAAM,QAAQ,MAAM,YAAY;AAChC,QAAM,QAAQ,MAAM,YAAY,GAAG;AACnC,QAAM,OAAO,SAAS,IAAI,MAAM,MAAM,GAAG,KAAK,IAAI;AAClD,QAAM,MAAM,SAAS,IAAI,MAAM,MAAM,QAAQ,CAAC,IAAI;AAClD,QAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI,KAAK;AACtC,MAAI,SAAwB;AAC5B,MAAI,KAAK,WAAW,UAAU,EAAG,UAAS;AAAA,WACjC,KAAK,WAAW,OAAO,KAAK,KAAK,WAAW,SAAS,EAAG,UAAS;AAAA,WACjE,KAAK,WAAW,OAAO,EAAG,UAAS;AAAA,WACnC,KAAK,WAAW,OAAO,EAAG,UAAS;AAAA,WACnC,KAAK,WAAW,QAAQ,EAAG,UAAS;AAC7C,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,eAAe,IAAI,MAAM,sBAAsB;AACrD,SAAO;AAAA,IACL;AAAA,IACA,eAAe,eAAe,aAAa,CAAC,IAAK;AAAA,EACnD;AACF;;;ADpGA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAID,SAAS,gBAAgB,MAAqD;AAC5E,QAAM,UAAU,KAAK,KAAK;AAC1B,MAAI,CAAC,WAAW,QAAQ,WAAW,GAAG,EAAG,QAAO;AAChD,QAAM,KAAK,QAAQ,QAAQ,GAAG;AAC9B,MAAI,KAAK,EAAG,QAAO;AACnB,QAAM,MAAM,QAAQ,MAAM,GAAG,EAAE,EAAE,KAAK;AACtC,MAAI,QAAQ,QAAQ,MAAM,KAAK,CAAC,EAAE,KAAK;AACvC,MACG,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAC5C;AACA,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC3B;AACA,SAAO,EAAE,KAAK,MAAM;AACtB;AAEA,eAAsBC,OAAM,YAAyC;AACnE,QAAM,UAAU,MAAMC,KAAG,QAAQ,YAAY,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AACpF,QAAM,UAAsB,CAAC;AAC7B,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,SAAS,SAAS;AAC3B,QAAI,CAAC,MAAM,OAAO,EAAG;AACrB,UAAM,QAAQ,aAAa,MAAM,IAAI;AACrC,QAAI,CAAC,MAAM,SAAS,MAAM,aAAa,MAAO;AAE9C,UAAM,WAAWC,OAAK,KAAK,YAAY,MAAM,IAAI;AACjD,UAAM,UAAU,MAAMD,KAAG,SAAS,UAAU,MAAM;AAClD,eAAW,QAAQ,QAAQ,MAAM,IAAI,GAAG;AACtC,YAAM,SAAS,gBAAgB,IAAI;AACnC,UAAI,CAAC,OAAQ;AACb,UAAI,CAAC,gBAAgB,IAAI,OAAO,IAAI,YAAY,CAAC,EAAG;AACpD,YAAM,SAAS,sBAAsB,OAAO,KAAK;AACjD,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,GAAG,OAAO,MAAM,MAAM,OAAO,IAAI,IAAI,OAAO,QAAQ,EAAE,IAAI,OAAO,QAAQ;AACrF,UAAI,KAAK,IAAI,GAAG,EAAG;AACnB,WAAK,IAAI,GAAG;AACZ,cAAQ,KAAK,EAAE,GAAG,QAAQ,YAAY,SAAS,CAAC;AAAA,IAClD;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,eAAe,EAAE,MAAM,QAAQ,OAAAD,OAAM;;;AE9DlD,OAAOG,YAAU;AAajB,eAAsBC,OAAM,YAAyC;AACnE,QAAM,aAAaC,OAAK,KAAK,YAAY,UAAU,eAAe;AAClE,QAAM,UAAU,MAAM,aAAa,UAAU;AAC7C,MAAI,CAAC,QAAS,QAAO,CAAC;AAEtB,QAAM,QAAQ,QAAQ,MAAM,iCAAiC;AAC7D,MAAI,CAAC,MAAO,QAAO,CAAC;AACpB,QAAM,OAAO,MAAM,CAAC,KAAK;AAEzB,QAAM,gBAAgB,KAAK,MAAM,0BAA0B;AAC3D,MAAI,CAAC,cAAe,QAAO,CAAC;AAC5B,QAAM,SAAS,eAAe,cAAc,CAAC,CAAE;AAC/C,MAAI,CAAC,OAAQ,QAAO,CAAC;AAErB,QAAM,WAAW,KAAK,MAAM,qBAAqB;AACjD,MAAI,UAAU;AACZ,UAAM,SAAS,sBAAsB,SAAS,CAAC,CAAE;AACjD,QAAI,OAAQ,QAAO,CAAC,EAAE,GAAG,QAAQ,YAAY,WAAW,CAAC;AAAA,EAC3D;AAEA,SAAO;AAAA,IACL;AAAA,MACE,MAAM,GAAG,MAAM;AAAA,MACf,UAAU;AAAA,MACV;AAAA,MACA,eAAe;AAAA,MACf,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAEO,IAAM,eAAe,EAAE,MAAM,UAAU,OAAAD,OAAM;;;AC1CpD,IAAM,oBAA4C;AAAA,EAChD,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,iBAAiB;AACnB;AAKA,eAAsBE,OAAM,YAAyC;AACnE,QAAM,WAAW,MAAM,UAAU,YAAY;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,MAAI,CAAC,SAAU,QAAO,CAAC;AACvB,QAAM,UAAU,MAAM,aAAa,QAAQ;AAC3C,MAAI,CAAC,QAAS,QAAO,CAAC;AAEtB,QAAM,eAAe,QAAQ,MAAM,mCAAmC;AACtE,MAAI,CAAC,aAAc,QAAO,CAAC;AAC3B,QAAM,SACJ,kBAAkB,aAAa,CAAC,EAAG,YAAY,CAAC,KAAK,eAAe,aAAa,CAAC,CAAE;AACtF,MAAI,CAAC,OAAQ,QAAO,CAAC;AAErB,QAAM,WAAW,QAAQ;AAAA,IACvB;AAAA,EACF;AACA,MAAI,UAAU;AACZ,UAAM,SAAS,sBAAsB,SAAS,CAAC,CAAE;AACjD,QAAI,OAAQ,QAAO,CAAC,EAAE,GAAG,QAAQ,YAAY,SAAS,CAAC;AAAA,EACzD;AACA,QAAM,YAAY,QAAQ,MAAM,gCAAgC;AAChE,MAAI,WAAW;AACb,UAAM,YAAY,QAAQ,MAAM,kBAAkB;AAClD,UAAM,UAAU,QAAQ,MAAM,oCAAoC;AAClE,WAAO;AAAA,MACL;AAAA,QACE,MAAM,UAAU,CAAC;AAAA,QACjB,MAAM,YAAY,OAAO,UAAU,CAAC,CAAC,IAAI;AAAA,QACzC,UAAU,UAAU,CAAC,KAAK;AAAA,QAC1B;AAAA,QACA,eAAe;AAAA,QACf,YAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL,EAAE,MAAM,GAAG,MAAM,YAAY,UAAU,IAAI,QAAQ,eAAe,WAAW,YAAY,SAAS;AAAA,EACpG;AACF;AAEO,IAAM,gBAAgB,EAAE,MAAM,WAAW,OAAAA,OAAM;;;ACxDtD,IAAM,mBAA2C;AAAA,EAC/C,IAAI;AAAA,EACJ,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,kBAAkB;AACpB;AAKA,eAAsBC,OAAM,YAAyC;AACnE,QAAM,WAAW,MAAM,UAAU,YAAY;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,MAAI,CAAC,SAAU,QAAO,CAAC;AACvB,QAAM,UAAU,MAAM,aAAa,QAAQ;AAC3C,MAAI,CAAC,QAAS,QAAO,CAAC;AAEtB,QAAM,cAAc,QAAQ,MAAM,kCAAkC;AACpE,MAAI,CAAC,YAAa,QAAO,CAAC;AAC1B,QAAM,SAAS,iBAAiB,YAAY,CAAC,EAAG,YAAY,CAAC;AAC7D,MAAI,CAAC,OAAQ,QAAO,CAAC;AAErB,QAAM,WAAW,QAAQ;AAAA,IACvB;AAAA,EACF;AACA,MAAI,UAAU;AACZ,UAAM,SAAS,sBAAsB,SAAS,CAAC,CAAE;AACjD,QAAI,OAAQ,QAAO,CAAC,EAAE,GAAG,QAAQ,YAAY,SAAS,CAAC;AAAA,EACzD;AAEA,QAAM,OAAO,QAAQ,MAAM,gCAAgC,IAAI,CAAC;AAChE,MAAI,MAAM;AACR,UAAM,OAAO,QAAQ,MAAM,kBAAkB,IAAI,CAAC;AAClD,UAAM,WAAW,QAAQ,MAAM,oCAAoC,IAAI,CAAC,KAAK;AAC7E,WAAO;AAAA,MACL;AAAA,QACE;AAAA,QACA,MAAM,OAAO,OAAO,IAAI,IAAI;AAAA,QAC5B;AAAA,QACA;AAAA,QACA,eAAe;AAAA,QACf,YAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,EAAE,MAAM,GAAG,MAAM,SAAS,UAAU,IAAI,QAAQ,eAAe,WAAW,YAAY,SAAS,CAAC;AAC1G;AAEO,IAAM,aAAa,EAAE,MAAM,QAAQ,OAAAA,OAAM;;;AC1DhD,OAAOC,YAAU;AAajB,eAAsBC,OAAM,YAAyC;AACnE,aAAW,aAAa,CAAC,kBAAkB,kBAAkB,eAAe,GAAG;AAC7E,UAAM,MAAMC,OAAK,KAAK,YAAY,SAAS;AAC3C,QAAI,CAAE,MAAM,OAAO,GAAG,EAAI;AAC1B,UAAM,MAAM,UAAU,SAAS,OAAO,IAClC,MAAM,SAA4C,GAAG,IACrD,MAAM,SAA4C,GAAG;AACzD,UAAM,UAAU,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,GAAG;AAE/C,UAAM,MAAkB,CAAC;AACzB,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,OAAO,QAAQ,CAAC,MAAM,KAAM;AACjC,YAAM,SAAS,eAAe,MAAM,IAAI;AACxC,UAAI,CAAC,OAAQ;AACb,UAAI,KAAK;AAAA,QACP,MAAM,MAAM;AAAA,QACZ,MAAM,MAAM;AAAA,QACZ,UAAU,MAAM,YAAY;AAAA,QAC5B;AAAA,QACA,eAAe;AAAA,QACf,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AACA,QAAI,IAAI,SAAS,EAAG,QAAO;AAAA,EAC7B;AACA,SAAO,CAAC;AACV;AAEO,IAAM,kBAAkB,EAAE,MAAM,aAAa,OAAAD,OAAM;;;ACpC1D,eAAsBE,OAAM,YAAyC;AACnE,QAAM,WAAW,MAAM,UAAU,YAAY;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,MAAI,CAAC,SAAU,QAAO,CAAC;AACvB,QAAM,UAAU,MAAM,aAAa,QAAQ;AAC3C,MAAI,CAAC,QAAS,QAAO,CAAC;AAEtB,QAAM,QAAQ,QAAQ,MAAM,6CAA6C;AACzE,QAAM,OAAO,QAAQ,MAAM,CAAC,IAAK;AAEjC,QAAM,YAAY,KAAK,MAAM,gCAAgC;AAC7D,QAAM,OAAO,KAAK,MAAM,gCAAgC,IAAI,CAAC;AAC7D,MAAI,CAAC,aAAa,CAAC,KAAM,QAAO,CAAC;AAEjC,QAAM,SAAS,eAAe,UAAU,CAAC,CAAE;AAC3C,MAAI,CAAC,OAAQ,QAAO,CAAC;AAErB,QAAM,OAAO,KAAK,MAAM,kBAAkB,IAAI,CAAC;AAC/C,QAAM,WAAW,KAAK,MAAM,oCAAoC,IAAI,CAAC,KAAK;AAE1E,SAAO;AAAA,IACL;AAAA,MACE;AAAA,MACA,MAAM,OAAO,OAAO,IAAI,IAAI;AAAA,MAC5B;AAAA,MACA;AAAA,MACA,eAAe;AAAA,MACf,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAEO,IAAM,gBAAgB,EAAE,MAAM,WAAW,OAAAA,OAAM;;;ACzCtD,OAAOC,YAAU;AAgBjB,eAAsBC,OAAM,YAAyC;AACnE,QAAM,aAAaC,OAAK,KAAK,YAAY,UAAU,aAAa;AAChE,MAAI,CAAE,MAAM,OAAO,UAAU,EAAI,QAAO,CAAC;AACzC,QAAM,MAAM,MAAM,SAA0B,UAAU;AAEtD,QAAM,MAAkB,CAAC;AACzB,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,SAAS,OAAO,OAAO,GAAG,GAAG;AACtC,QAAI,CAAC,OAAO,WAAW,CAAC,MAAM,KAAM;AACpC,UAAM,SAAS,eAAe,MAAM,OAAO;AAC3C,QAAI,CAAC,OAAQ;AACb,UAAM,MAAM,GAAG,MAAM,MAAM,MAAM,IAAI,IAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,YAAY,EAAE;AACjF,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,QAAI,KAAK;AAAA,MACP,MAAM,MAAM;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,UAAU,MAAM,YAAY;AAAA,MAC5B;AAAA,MACA,eAAe;AAAA,MACf,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEO,IAAM,kBAAkB,EAAE,MAAM,aAAa,OAAAD,OAAM;;;AC1C1D,OAAOE,YAAU;AAcjB,SAAS,gBAAgB,KAAyC;AAChE,aAAW,OAAO,IAAI,SAAS,CAAC,GAAG;AACjC,UAAM,MAAM,OAAO,GAAG;AAEtB,UAAM,OAAO,IAAI,MAAM,GAAG,EAAE,IAAI;AAChC,UAAM,IAAI,OAAO,IAAI;AACrB,QAAI,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,KAA6B;AACpD,QAAM,MAAM,IAAI;AAChB,QAAM,MAAM,CAAC,QAAoC;AAC/C,QAAI,CAAC,IAAK,QAAO;AACjB,QAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,iBAAW,QAAQ,KAAK;AACtB,cAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,GAAG;AAC7B,YAAI,MAAM,IAAK,QAAO;AAAA,MACxB;AACA,aAAO;AAAA,IACT;AACA,WAAO,IAAI,GAAG;AAAA,EAChB;AACA,SAAO,IAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,uBAAuB,KAAK;AACxF;AAKA,eAAsBC,OAAM,YAAyC;AACnE,aAAW,QAAQ,CAAC,sBAAsB,qBAAqB,GAAG;AAChE,UAAM,MAAMC,OAAK,KAAK,YAAY,IAAI;AACtC,QAAI,CAAE,MAAM,OAAO,GAAG,EAAI;AAC1B,UAAM,MAAM,MAAM,SAAsB,GAAG;AAC3C,QAAI,CAAC,KAAK,SAAU,QAAO,CAAC;AAE5B,UAAM,MAAkB,CAAC;AACzB,eAAW,CAAC,aAAa,GAAG,KAAK,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAC7D,UAAI,CAAC,IAAI,MAAO;AAChB,YAAM,OAAO,gBAAgB,IAAI,KAAK;AACtC,UAAI,CAAC,KAAM;AACX,UAAI,KAAK;AAAA,QACP,MAAM;AAAA,QACN,MAAM,gBAAgB,GAAG;AAAA,QACzB,UAAU,gBAAgB,GAAG;AAAA,QAC7B,QAAQ,KAAK;AAAA,QACb,eAAe,KAAK;AAAA,QACpB,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AACA,SAAO,CAAC;AACV;AAEO,IAAM,sBAAsB,EAAE,MAAM,kBAAkB,OAAAD,OAAM;;;AVtB5D,IAAM,aAAyB;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,qBAAqB,QAAoC;AAChE,SAAO,YAAY,EAChB,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM,EACjC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,YAAY,EAAE,iBAAiB,EAAE;AACpE;AAEA,SAAS,eAAe,QAAgC;AACtD,SAAO;AAAA,IACL,IAAIE,YAAW,OAAO,IAAI;AAAA,IAC1B,MAAMC,UAAS;AAAA,IACf,MAAM,OAAO,YAAY,OAAO;AAAA,IAChC,QAAQ,OAAO;AAAA,IACf,eAAe,OAAO;AAAA,IACtB,mBAAmB,qBAAqB,OAAO,MAAM;AAAA,IACrD,MAAM,OAAO;AAAA,IACb,MAAM,OAAO;AAAA,EACf;AACF;AAEO,SAAS,wBACd,SACA,SACM;AACN,QAAM,OAAO,EAAE,GAAI,QAAQ,IAAI,gBAAgB,CAAC,GAAI,GAAI,QAAQ,IAAI,mBAAmB,CAAC,EAAG;AAC3F,QAAM,oBAAmE,CAAC;AAC1E,QAAM,OAAO,oBAAI,IAAY;AAI7B,aAAW,UAAU,SAAS;AAC5B,eAAW,QAAQ,YAAY,GAAG;AAChC,UAAI,KAAK,WAAW,OAAO,OAAQ;AACnC,YAAM,kBAAkB,aAAa,KAAK,KAAK,MAAM,CAAC;AACtD,UAAI,CAAC,gBAAiB;AACtB,YAAM,SAAS;AAAA,QACb,KAAK;AAAA,QACL;AAAA,QACA,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,UAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,cAAM,MAAM,iBAAiB,KAAK,MAAM,IAAI,eAAe,IAAI,OAAO,MAAM,IAAI,OAAO,aAAa;AACpG,YAAI,KAAK,IAAI,GAAG,EAAG;AACnB,aAAK,IAAI,GAAG;AACZ,0BAAkB,KAAK;AAAA,UACrB,MAAM;AAAA,UACN,QAAQ,KAAK;AAAA,UACb,eAAe;AAAA,UACf,QAAQ,OAAO;AAAA,UACf,eAAe,OAAO;AAAA,UACtB,QAAQ,OAAO;AAAA,QACjB,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAIA,QAAM,oBAAoB,QAAQ,KAAK,cAAc,QAAQ,IAAI,SAAS;AAC1E,aAAW,cAAc,sBAAsB,GAAG;AAChD,UAAM,WAAW,aAAa,KAAK,WAAW,OAAO,CAAC;AACtD,QAAI,CAAC,SAAU;AACf,UAAM,SAAS,0BAA0B,YAAY,UAAU,iBAAiB;AAChF,QAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,YAAM,MAAM,eAAe,WAAW,OAAO,IAAI,QAAQ,IAAI,qBAAqB,EAAE;AACpF,UAAI,KAAK,IAAI,GAAG,EAAG;AACnB,WAAK,IAAI,GAAG;AACZ,wBAAkB,KAAK;AAAA,QACrB,MAAM;AAAA,QACN,SAAS,WAAW;AAAA,QACpB,gBAAgB;AAAA,QAChB,qBAAqB,OAAO,uBAAuB,WAAW;AAAA,QAC9D,GAAI,oBAAoB,EAAE,oBAAoB,kBAAkB,IAAI,CAAC;AAAA,QACrE,QAAQ,OAAO;AAAA,MACjB,CAAC;AAAA,IACH;AAAA,EACF;AAGA,aAAW,YAAY,iBAAiB,GAAG;AACzC,UAAM,WAAW,aAAa,KAAK,SAAS,OAAO,CAAC;AACpD,QAAI,CAAC,SAAU;AACf,UAAM,kBAAkB,aAAa,KAAK,SAAS,SAAS,IAAI,CAAC;AACjE,UAAM,SAAS,qBAAqB,UAAU,UAAU,eAAe;AACvE,QAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,YAAM,MAAM,oBAAoB,SAAS,OAAO,IAAI,QAAQ,IAAI,SAAS,SAAS,IAAI,IAAI,mBAAmB,SAAS;AACtH,UAAI,KAAK,IAAI,GAAG,EAAG;AACnB,WAAK,IAAI,GAAG;AACZ,wBAAkB,KAAK;AAAA,QACrB,MAAM;AAAA,QACN,SAAS,SAAS;AAAA,QAClB,gBAAgB;AAAA,QAChB,UAAU,SAAS;AAAA,QACnB,GAAI,kBAAkB,EAAE,cAAc,gBAAgB,IAAI,CAAC;AAAA,QAC3D,QAAQ,OAAO;AAAA,MACjB,CAAC;AAAA,IACH;AAAA,EACF;AAGA,aAAW,QAAQ,eAAe,GAAG;AACnC,UAAM,WAAW,aAAa,KAAK,KAAK,OAAO,CAAC;AAChD,QAAI,aAAa,OAAW;AAC5B,UAAM,SAAS,mBAAmB,MAAM,QAAQ;AAChD,QAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,YAAM,MAAM,kBAAkB,KAAK,OAAO,IAAI,QAAQ;AACtD,UAAI,KAAK,IAAI,GAAG,EAAG;AACnB,WAAK,IAAI,GAAG;AACZ,wBAAkB,KAAK;AAAA,QACrB,MAAM;AAAA,QACN,SAAS,KAAK;AAAA,QACd,gBAAgB;AAAA,QAChB,QAAQ,OAAO;AAAA,MACjB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,kBAAkB,SAAS,EAAG,SAAQ,KAAK,oBAAoB;AACrE;AAMA,eAAsB,sBACpB,OACA,UACA,UACqD;AACrD,MAAI,aAAa;AACjB,MAAI,aAAa;AAEjB,aAAW,WAAW,UAAU;AAC9B,UAAM,SAAS,oBAAI,IAAsB;AACzC,eAAW,UAAU,YAAY;AAC/B,UAAI;AACJ,UAAI;AACF,kBAAU,MAAM,OAAO,MAAM,QAAQ,GAAG;AAAA,MAC1C,SAAS,KAAK;AACZ,gBAAQ;AAAA,UACN,UAAU,OAAO,IAAI,qBAAqB,QAAQ,KAAK,IAAI,KAAM,IAAc,OAAO;AAAA,QACxF;AACA;AAAA,MACF;AACA,iBAAW,UAAU,SAAS;AAC5B,YAAI,CAAC,OAAO,KAAM;AAClB,YAAI,CAAC,OAAO,IAAI,OAAO,IAAI,EAAG,QAAO,IAAI,OAAO,MAAM,MAAM;AAAA,MAC9D;AAAA,IACF;AAEA,UAAM,aAAa,CAAC,GAAG,OAAO,OAAO,CAAC;AACtC,eAAW,UAAU,YAAY;AAC/B,YAAM,SAAS,eAAe,MAAM;AACpC,UAAI,CAAC,MAAM,QAAQ,OAAO,EAAE,GAAG;AAC7B,cAAM,QAAQ,OAAO,IAAI,EAAE,GAAG,QAAQ,eAAe,SAAS,CAAC;AAC/D;AAAA,MACF,OAAO;AAIL,cAAM,WAAW,MAAM,kBAAkB,OAAO,EAAE;AAClD,cAAM,sBACJ,SAAS,kBAAkB,SAAS,WAAW;AACjD,cAAM,sBAAsB,OAAO,IAAI;AAAA,UACrC,GAAG;AAAA,UACH,GAAG;AAAA,UACH,eAAe;AAAA,QACjB,CAAC;AAAA,MACH;AAGA,YAAM,OAAkB;AAAA,QACtB,IAAIC,iBAAW,QAAQ,KAAK,IAAI,OAAO,IAAIC,UAAS,WAAW;AAAA,QAC/D,QAAQ,QAAQ,KAAK;AAAA,QACrB,QAAQ,OAAO;AAAA,QACf,MAAMA,UAAS;AAAA,QACf,YAAYC,YAAW;AAAA,QACvB,YAAY,uBAAuB,YAAY;AAAA;AAAA;AAAA;AAAA,QAI/C,UAAU;AAAA,UACR,MAAMC,OAAK,SAAS,UAAU,OAAO,UAAU,EAAE,MAAMA,OAAK,GAAG,EAAE,KAAK,GAAG;AAAA,QAC3E;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,cAAM,eAAe,KAAK,IAAI,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAC5D;AAAA,MACF;AAAA,IACF;AAIA,4BAAwB,SAAS,UAAU;AAC3C,QAAI,MAAM,QAAQ,QAAQ,KAAK,EAAE,GAAG;AAIlC,YAAM,UAAU,MAAM,kBAAkB,QAAQ,KAAK,EAAE;AACvD,YAAM,UAAuB;AAAA,QAC3B,GAAG;AAAA,QACH,GAAI,QAAQ;AAAA,QACZ,GAAI,QAAQ,UAAU,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;AAAA,MACxD;AAKA,UAAI,CAAC,QAAQ,KAAK,qBAAqB,QAAQ,KAAK,kBAAkB,WAAW,GAAG;AAClF,eAAQ,QAA4C;AAAA,MACtD;AACA,YAAM,sBAAsB,QAAQ,KAAK,IAAI,OAA+B;AAAA,IAC9E;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,WAAW;AAClC;;;AWpRA,SAAS,YAAYC,YAAU;AAC/B,OAAOC,YAAU;AAEjB;AAAA,EACE,YAAAC;AAAA,EACA,YAAAC;AAAA,EACA,cAAAC;AAAA,EACA;AAAA,EACA,0BAAAC;AAAA,OACK;AAQP,eAAsB,gBAAgB,KAAgC;AACpE,QAAM,MAAgB,CAAC;AACvB,iBAAe,KAAK,SAAgC;AAClD,UAAM,UAAU,MAAMC,KAAG,QAAQ,SAAS,EAAE,eAAe,KAAK,CAAC;AACjE,eAAW,SAAS,SAAS;AAC3B,YAAM,OAAOC,OAAK,KAAK,SAAS,MAAM,IAAI;AAC1C,UAAI,MAAM,YAAY,GAAG;AACvB,YAAI,CAAC,aAAa,IAAI,MAAM,IAAI,EAAG,OAAM,KAAK,IAAI;AAAA,MACpD,WAAW,MAAM,OAAO,KAAK,aAAa,MAAM,IAAI,EAAE,OAAO;AAC3D,YAAI,KAAK,IAAI;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACA,QAAM,KAAK,GAAG;AACd,SAAO;AACT;AAIA,eAAsB,eACpB,OACA,UACA,UACqD;AACrD,MAAI,aAAa;AACjB,MAAI,aAAa;AACjB,aAAW,WAAW,UAAU;AAC9B,UAAM,cAAc,MAAM,gBAAgB,QAAQ,GAAG;AACrD,eAAW,QAAQ,aAAa;AAC9B,YAAM,UAAUA,OAAK,SAAS,UAAU,IAAI;AAC5C,YAAM,OAAmB;AAAA,QACvB,IAAI,SAAS,OAAO;AAAA,QACpB,MAAMC,UAAS;AAAA,QACf,MAAMD,OAAK,SAAS,IAAI;AAAA,QACxB,MAAM;AAAA,QACN,UAAU,aAAaA,OAAK,SAAS,IAAI,CAAC,EAAE;AAAA,MAC9C;AACA,UAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,cAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B;AAAA,MACF;AAGA,YAAM,OAAkB;AAAA,QACtB,IAAIE,iBAAW,QAAQ,KAAK,IAAI,KAAK,IAAIC,UAAS,aAAa;AAAA,QAC/D,QAAQ,QAAQ,KAAK;AAAA,QACrB,QAAQ,KAAK;AAAA,QACb,MAAMA,UAAS;AAAA,QACf,YAAYC,YAAW;AAAA,QACvB,YAAYC,wBAAuB,YAAY;AAAA,QAC/C,UAAU,EAAE,MAAM,QAAQ,MAAML,OAAK,GAAG,EAAE,KAAK,GAAG,EAAE;AAAA,MACtD;AACA,UAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,cAAM,eAAe,KAAK,IAAI,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAC5D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,YAAY,WAAW;AAClC;;;AC3EA;AAAA,EACE,YAAAM;AAAA,EACA,YAAAC;AAAA,EACA,cAAAC;AAAA,EACA,0BAAAC;AAAA,EACA,wBAAAC;AAAA,OACK;;;ACPP,OAAOC,YAAU;AACjB,OAAO,YAAY;AACnB,OAAO,gBAAgB;AACvB,OAAO,YAAY;AAEnB;AAAA,EACE,YAAAC;AAAA,EACA,cAAAC;AAAA,EACA,0BAAAC;AAAA,EACA;AAAA,OACK;;;ACVP,SAAS,YAAYC,YAAU;AAC/B,OAAOC,YAAU;AAwBjB,eAAsB,gBAAgB,KAAgC;AACpE,QAAM,MAAgB,CAAC;AACvB,iBAAe,KAAK,SAAgC;AAClD,UAAM,UAAU,MAAMC,KAAG,QAAQ,SAAS,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AACjF,eAAW,SAAS,SAAS;AAC3B,YAAM,OAAOC,OAAK,KAAK,SAAS,MAAM,IAAI;AAC1C,UAAI,MAAM,YAAY,GAAG;AACvB,YAAI,CAAC,aAAa,IAAI,MAAM,IAAI,EAAG,OAAM,KAAK,IAAI;AAAA,MACpD,WAAW,MAAM,OAAO,KAAK,wBAAwB,IAAIA,OAAK,QAAQ,MAAM,IAAI,CAAC,GAAG;AAClF,YAAI,KAAK,IAAI;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACA,QAAM,KAAK,GAAG;AACd,SAAO;AACT;AAEA,eAAsB,gBAAgB,KAAoC;AACxE,QAAM,QAAQ,MAAM,gBAAgB,GAAG;AACvC,QAAM,MAAoB,CAAC;AAC3B,aAAW,KAAK,OAAO;AACrB,QAAI;AACF,YAAM,UAAU,MAAMD,KAAG,SAAS,GAAG,MAAM;AAC3C,UAAI,KAAK,EAAE,MAAM,GAAG,QAAQ,CAAC;AAAA,IAC/B,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,OAAO,MAAc,QAAwB;AAC3D,QAAM,MAAM,KAAK,QAAQ,MAAM;AAC/B,MAAI,MAAM,EAAG,QAAO;AACpB,SAAO,KAAK,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,EAAE;AACxC;AAEO,SAAS,QAAQ,MAAc,MAAsB;AAC1D,QAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,UAAQ,MAAM,OAAO,CAAC,KAAK,IAAI,KAAK;AACtC;;;AD5CA,IAAM,4BAA4B,oBAAI,IAAI,CAAC,mBAAmB,gBAAgB,CAAC;AAI/E,IAAM,yBAAyB,oBAAI,IAAI,CAAC,KAAK,QAAQ,WAAW,gBAAgB,QAAQ,CAAC;AAKzF,SAAS,wBAAwB,MAAkC;AACjE,MAAI,SAAmC,KAAK;AAG5C,SAAO,QAAQ;AACb,QAAI,OAAO,SAAS,iBAAiB;AAGnC,UAAI,QAAkC,OAAO;AAC7C,aAAO,SAAS,MAAM,SAAS,yBAAyB,MAAM,SAAS,4BAA4B;AACjG,gBAAQ,MAAM;AAAA,MAChB;AACA,UAAI,CAAC,MAAO,QAAO;AAGnB,YAAM,UAAU,MAAM,WAAW,CAAC;AAClC,YAAM,UAAU,SAAS,QAAQ;AAGjC,YAAM,QAAQ,QAAQ,SAAS,GAAG,IAAI,QAAQ,MAAM,GAAG,EAAE,IAAI,IAAK;AAClE,aAAO,uBAAuB,IAAI,KAAK;AAAA,IACzC;AACA,aAAS,OAAO;AAAA,EAClB;AACA,SAAO;AACT;AAMA,SAAS,sBACP,MACA,KACM;AACN,MAAI,0BAA0B,IAAI,KAAK,IAAI,EAAG,KAAI,KAAK,EAAE,MAAM,KAAK,MAAM,KAAK,CAAC;AAChF,WAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC7C,UAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,QAAI,MAAO,uBAAsB,OAAO,GAAG;AAAA,EAC7C;AACF;AAEO,SAAS,gBACd,QACA,QACA,YACa;AACb,QAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAM,WAAwD,CAAC;AAC/D,wBAAsB,KAAK,UAAU,QAAQ;AAC7C,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,OAAO,UAAU;AAI1B,QAAI,wBAAwB,IAAI,IAAI,EAAG;AACvC,eAAW,QAAQ,YAAY;AAG7B,UAAI,eAAe,IAAI,MAAM,IAAI,GAAG;AAClC,gBAAQ,IAAI,IAAI;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAuB;AAC9B,QAAM,IAAI,IAAI,OAAO;AACrB,IAAE,YAAY,UAAU;AACxB,SAAO;AACT;AAEA,SAAS,eAAuB;AAC9B,QAAM,IAAI,IAAI,OAAO;AACrB,IAAE,YAAY,MAAM;AACpB,SAAO;AACT;AAKA,eAAsB,iBACpB,OACA,UACiB;AACjB,QAAM,WAAW,aAAa;AAC9B,QAAM,WAAW,aAAa;AAE9B,QAAM,aAAa,oBAAI,IAAY;AACnC,QAAM,eAAe,oBAAI,IAAoB;AAC7C,aAAW,WAAW,UAAU;AAC9B,eAAW,IAAIE,OAAK,SAAS,QAAQ,GAAG,CAAC;AACzC,eAAW,IAAI,QAAQ,IAAI,IAAI;AAC/B,iBAAa,IAAIA,OAAK,SAAS,QAAQ,GAAG,GAAG,QAAQ,KAAK,EAAE;AAC5D,iBAAa,IAAI,QAAQ,IAAI,MAAM,QAAQ,KAAK,EAAE;AAAA,EACpD;AAEA,MAAI,aAAa;AACjB,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,MAAM,gBAAgB,QAAQ,GAAG;AAC/C,UAAM,cAAc,oBAAI,IAA4C;AACpE,eAAW,QAAQ,OAAO;AAExB,UAAI,WAAW,KAAK,IAAI,EAAG;AAC3B,YAAM,SAASA,OAAK,QAAQ,KAAK,IAAI,MAAM,QAAQ,WAAW;AAC9D,UAAI;AACJ,UAAI;AACF,kBAAU,gBAAgB,KAAK,SAAS,QAAQ,UAAU;AAAA,MAC5D,SAAS,KAAK;AACZ,8BAAsB,wBAAwB,KAAK,MAAM,GAAG;AAC5D;AAAA,MACF;AACA,iBAAW,KAAK,SAAS;AACvB,cAAM,WAAW,aAAa,IAAI,CAAC;AACnC,YAAI,CAAC,YAAY,aAAa,QAAQ,KAAK,GAAI;AAC/C,YAAI,CAAC,YAAY,IAAI,QAAQ,GAAG;AAC9B,sBAAY,IAAI,UAAU,EAAE,MAAM,KAAK,MAAM,MAAM,EAAE,CAAC;AAAA,QACxD;AAAA,MACF;AAAA,IACF;AACA,eAAW,CAAC,UAAU,YAAY,KAAK,aAAa;AAClD,YAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,aAAa,IAAI,GAAG,WAAW;AAChF,YAAM,OAAO,OAAO,aAAa,KAAK,aAAa,IAAI,EAAE;AAMzD,YAAM,aAAaC,wBAAuB,sBAAsB;AAChE,YAAM,KAAK;AAAA,QACT,MAAMD,OAAK,SAAS,QAAQ,KAAK,aAAa,IAAI;AAAA,QAClD;AAAA,QACA,SAAS,QAAQ,aAAa,IAAI;AAAA,MACpC;AACA,YAAM,SAASE,iBAAW,QAAQ,KAAK,IAAI,UAAUC,UAAS,KAAK;AACnE,UAAI,CAAC,qBAAqB,UAAU,GAAG;AACrC,6BAAqB;AAAA,UACnB,QAAQ,QAAQ,KAAK;AAAA,UACrB,QAAQ;AAAA,UACR,MAAMA,UAAS;AAAA,UACf;AAAA,UACA,gBAAgB;AAAA,UAChB,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AACA,YAAM,OAAkB;AAAA,QACtB,IAAI;AAAA,QACJ,QAAQ,QAAQ,KAAK;AAAA,QACrB,QAAQ;AAAA,QACR,MAAMA,UAAS;AAAA,QACf,YAAYC,YAAW;AAAA,QACvB;AAAA,QACA,UAAU;AAAA,MACZ;AACA,UAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,cAAM,eAAe,KAAK,IAAI,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAC5D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;AEpMA,OAAOC,YAAU;AACjB,SAAS,eAAe;AAOxB,IAAM,oBACJ;AACF,IAAM,oBACJ;AAEF,SAAS,QAAQ,IAAY,MAAkD;AAC7E,KAAG,YAAY;AACf,QAAM,MAA0C,CAAC;AACjD,MAAI;AACJ,UAAQ,IAAI,GAAG,KAAK,IAAI,OAAO,MAAM;AACnC,QAAI,KAAK,EAAE,OAAO,EAAE,CAAC,GAAI,OAAO,EAAE,MAAM,CAAC;AAAA,EAC3C;AACA,SAAO;AACT;AAEO,SAAS,uBACd,MACA,YACoB;AACpB,QAAM,MAA0B,CAAC;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,OAAO,CAAC,OAAe,aAAqD;AAChF,UAAM,MAAM,GAAG,QAAQ,IAAI,KAAK;AAChC,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,UAAM,OAAO,OAAO,KAAK,SAAS,KAAK;AACvC,QAAI,KAAK;AAAA,MACP,SAAS,QAAQ,eAAe,KAAK;AAAA,MACrC,MAAM;AAAA,MACN,MAAM;AAAA,MACN;AAAA;AAAA;AAAA;AAAA,MAIA,gBAAgB;AAAA,MAChB,UAAU;AAAA,QACR,MAAMC,OAAK,SAAS,YAAY,KAAK,IAAI;AAAA,QACzC;AAAA,QACA,SAAS,QAAQ,KAAK,SAAS,IAAI;AAAA,MACrC;AAAA,IACF,CAAC;AAAA,EACH;AAEA,aAAW,EAAE,MAAM,KAAK,QAAQ,mBAAmB,KAAK,OAAO,EAAG,MAAK,OAAO,cAAc;AAC5F,aAAW,EAAE,MAAM,KAAK,QAAQ,mBAAmB,KAAK,OAAO,EAAG,MAAK,OAAO,eAAe;AAC7F,SAAO;AACT;;;ACtDA,OAAOC,YAAU;AACjB,SAAS,WAAAC,gBAAe;AAMxB,IAAM,eAAe;AAEd,SAAS,uBACd,MACA,YACoB;AACpB,QAAM,MAA0B,CAAC;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,eAAa,YAAY;AACzB,MAAI;AACJ,UAAQ,IAAI,aAAa,KAAK,KAAK,OAAO,OAAO,MAAM;AACrD,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,KAAK,IAAI,IAAI,EAAG;AACpB,SAAK,IAAI,IAAI;AACb,UAAM,OAAO,OAAO,KAAK,SAAS,IAAI;AACtC,QAAI,KAAK;AAAA,MACP,SAASC,SAAQ,SAAS,IAAI;AAAA,MAC9B,MAAM;AAAA,MACN,MAAM;AAAA,MACN,UAAU;AAAA;AAAA;AAAA;AAAA,MAIV,gBAAgB;AAAA,MAChB,UAAU;AAAA,QACR,MAAMC,OAAK,SAAS,YAAY,KAAK,IAAI;AAAA,QACzC;AAAA,QACA,SAAS,QAAQ,KAAK,SAAS,IAAI;AAAA,MACrC;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACT;;;ACvCA,OAAOC,YAAU;AACjB,SAAS,WAAAC,gBAAe;AASxB,IAAM,eAAe;AACrB,IAAM,kBAAkB;AAExB,SAAS,UAAU,MAAc,SAA4B;AAC3D,SAAO,QAAQ,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;AAC7C;AAEA,SAASC,SAAQ,IAAY,MAAiD;AAC5E,KAAG,YAAY;AACf,QAAM,MAAyC,CAAC;AAChD,MAAI;AACJ,UAAQ,IAAI,GAAG,KAAK,IAAI,OAAO,MAAM;AACnC,QAAI,KAAK,EAAE,MAAM,EAAE,CAAC,GAAI,OAAO,EAAE,MAAM,CAAC;AAAA,EAC1C;AACA,SAAO;AACT;AAEO,SAAS,qBACd,MACA,YACoB;AACpB,QAAM,MAA0B,CAAC;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,OAAO,CAAC,MAAc,SAAuB;AACjD,UAAM,MAAM,GAAG,IAAI,IAAI,IAAI;AAC3B,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,UAAM,OAAO,OAAO,KAAK,SAAS,IAAI;AACtC,QAAI,KAAK;AAAA,MACP,SAASC,SAAQ,MAAM,IAAI;AAAA,MAC3B;AAAA,MACA;AAAA,MACA,UAAU;AAAA;AAAA;AAAA;AAAA,MAIV,gBAAgB;AAAA,MAChB,UAAU;AAAA,QACR,MAAMC,OAAK,SAAS,YAAY,KAAK,IAAI;AAAA,QACzC;AAAA,QACA,SAAS,QAAQ,KAAK,SAAS,IAAI;AAAA,MACrC;AAAA,IACF,CAAC;AAAA,EACH;AAEA,MAAI,UAAU,KAAK,SAAS,CAAC,YAAY,oBAAoB,oBAAoB,qBAAqB,CAAC,GAAG;AACxG,eAAW,EAAE,KAAK,KAAKF,SAAQ,cAAc,KAAK,OAAO,EAAG,MAAK,aAAa,IAAI;AAAA,EACpF;AACA,MACE,UAAU,KAAK,SAAS;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC,GACD;AACA,eAAW,EAAE,KAAK,KAAKA,SAAQ,iBAAiB,KAAK,OAAO,EAAG,MAAK,kBAAkB,IAAI;AAAA,EAC5F;AACA,SAAO;AACT;;;ACxEA,OAAOG,YAAU;AACjB,SAAS,WAAAC,gBAAe;AAuBxB,IAAM,iBAAiB;AACvB,IAAM,oBACJ;AACF,IAAM,iBACJ;AAEF,SAAS,gBAAgB,OAAoC;AAC3D,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO,YAAY,KAAK,KAAK,KAAK,MAAM,SAAS,GAAG;AACtD;AAEA,SAAS,kBAAkB,GAAmB;AAC5C,SAAO,EAAE,YAAY,EAAE,QAAQ,cAAc,EAAE;AACjD;AAOA,SAAS,YAAY,SAAgC;AACnD,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,oBAAkB,YAAY;AAC9B,MAAI;AACJ,UAAQ,IAAI,kBAAkB,KAAK,OAAO,OAAO,MAAM;AACrD,UAAM,MAAM,EAAE,CAAC;AACf,mBAAe,IAAI,kBAAkB,GAAG,GAAG,GAAG;AAAA,EAChD;AACA,SAAO;AAAA,IACL;AAAA,IACA,eAAe,eAAe,KAAK,OAAO;AAAA,EAC5C;AACF;AAEA,SAAS,eACP,QACA,KACyB;AACzB,QAAM,MAAM,kBAAkB,MAAM;AACpC,QAAM,SAAS,IAAI,eAAe,IAAI,GAAG;AACzC,MAAI,OAAQ,QAAO,EAAE,MAAM,OAAO,MAAM,GAAG;AAC3C,MAAI,IAAI,cAAe,QAAO,EAAE,MAAM,eAAe;AAOrD,SAAO;AACT;AAEO,SAAS,sBACd,MACA,YACoB;AACpB,QAAM,MAA0B,CAAC;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAAM,YAAY,KAAK,OAAO;AACpC,iBAAe,YAAY;AAC3B,MAAI;AACJ,UAAQ,IAAI,eAAe,KAAK,KAAK,OAAO,OAAO,MAAM;AACvD,UAAM,SAAS,EAAE,CAAC;AAClB,UAAM,OAAO,EAAE,CAAC,GAAG,KAAK;AACxB,UAAM,OAAO,gBAAgB,IAAI,IAAI,OAAQ;AAC7C,QAAI,KAAK,IAAI,IAAI,EAAG;AACpB,UAAM,aAAa,eAAe,QAAQ,GAAG;AAC7C,QAAI,CAAC,WAAY;AACjB,SAAK,IAAI,IAAI;AACb,UAAM,EAAE,KAAK,IAAI;AACjB,UAAM,OAAO,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC;AACtC,QAAI,KAAK;AAAA,MACP,SAASC,SAAQ,MAAM,IAAI;AAAA,MAC3B;AAAA,MACA;AAAA,MACA,UAAU;AAAA;AAAA;AAAA;AAAA,MAIV,gBAAgB;AAAA,MAChB,UAAU;AAAA,QACR,MAAMC,OAAK,SAAS,YAAY,KAAK,IAAI;AAAA,QACzC;AAAA,QACA,SAAS,QAAQ,KAAK,SAAS,IAAI;AAAA,MACrC;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACT;;;ANnFA,SAAS,qBAAqB,IAAgE;AAC5F,UAAQ,GAAG,UAAU;AAAA,IACnB,KAAK;AACH,aAAOC,UAAS;AAAA,IAClB,KAAK;AACH,aAAOA,UAAS;AAAA,IAClB;AACE,aAAOA,UAAS;AAAA,EACpB;AACF;AAEA,SAAS,UAAU,MAAuB;AACxC,SACE,KAAK,WAAW,MAAM,KACtB,KAAK,WAAW,IAAI,KACpB,KAAK,WAAW,UAAU;AAE9B;AAEA,eAAe,yBACb,OACA,UAC4B;AAC5B,MAAI,aAAa;AACjB,MAAI,aAAa;AAEjB,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,MAAM,gBAAgB,QAAQ,GAAG;AAC/C,UAAM,YAAgC,CAAC;AACvC,eAAW,QAAQ,OAAO;AAIxB,UAAI,WAAW,KAAK,IAAI,EAAG;AAM3B,YAAM,SAAS,qBAAqB,KAAK,OAAO;AAChD,YAAM,aAAa,EAAE,MAAM,KAAK,MAAM,SAAS,OAAO;AACtD,gBAAU,KAAK,GAAG,uBAAuB,YAAY,QAAQ,GAAG,CAAC;AACjE,gBAAU,KAAK,GAAG,uBAAuB,YAAY,QAAQ,GAAG,CAAC;AACjE,gBAAU,KAAK,GAAG,qBAAqB,YAAY,QAAQ,GAAG,CAAC;AAC/D,gBAAU,KAAK,GAAG,sBAAsB,YAAY,QAAQ,GAAG,CAAC;AAAA,IAClE;AACA,QAAI,UAAU,WAAW,EAAG;AAE5B,UAAM,YAAY,oBAAI,IAAY;AAClC,eAAW,MAAM,WAAW;AAC1B,UAAI,CAAC,MAAM,QAAQ,GAAG,OAAO,GAAG;AAC9B,cAAM,OAAkB;AAAA,UACtB,IAAI,GAAG;AAAA,UACP,MAAMC,UAAS;AAAA,UACf,MAAM,GAAG;AAAA;AAAA;AAAA;AAAA,UAIT,UAAU,UAAU,GAAG,IAAI,IAAI,QAAQ;AAAA,UACvC,MAAM,GAAG;AAAA,QACX;AACA,cAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B;AAAA,MACF;AAEA,YAAM,WAAW,qBAAqB,EAAE;AACxC,YAAM,SAASC,iBAAW,QAAQ,KAAK,IAAI,GAAG,SAAS,QAAQ;AAC/D,UAAI,UAAU,IAAI,MAAM,EAAG;AAC3B,gBAAU,IAAI,MAAM;AACpB,YAAM,aAAaC,wBAAuB,GAAG,cAAc;AAG3D,UAAI,CAACC,sBAAqB,UAAU,GAAG;AACrC,6BAAqB;AAAA,UACnB,QAAQ,QAAQ,KAAK;AAAA,UACrB,QAAQ,GAAG;AAAA,UACX,MAAM;AAAA,UACN;AAAA,UACA,gBAAgB,GAAG;AAAA,UACnB,UAAU,GAAG;AAAA,QACf,CAAC;AACD;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,cAAM,OAAkB;AAAA,UACtB,IAAI;AAAA,UACJ,QAAQ,QAAQ,KAAK;AAAA,UACrB,QAAQ,GAAG;AAAA,UACX,MAAM;AAAA,UACN,YAAYC,YAAW;AAAA,UACvB;AAAA,UACA,UAAU,GAAG;AAAA,QACf;AACA,cAAM,eAAe,QAAQ,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAC3D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,YAAY,WAAW;AAClC;AAEA,eAAsB,aACpB,OACA,UAC4B;AAC5B,QAAM,YAAY,MAAM,iBAAiB,OAAO,QAAQ;AACxD,QAAM,MAAM,MAAM,yBAAyB,OAAO,QAAQ;AAC1D,SAAO;AAAA,IACL,YAAY,IAAI;AAAA,IAChB,YAAY,YAAY,IAAI;AAAA,EAC9B;AACF;;;AO3IA,OAAOC,YAAU;AAEjB,SAAS,YAAAC,WAAU,cAAAC,aAAY,0BAAAC,+BAA8B;;;ACD7D,SAAS,YAAAC,WAAU,WAAAC,gBAAe;AAI3B,SAAS,cACd,MACA,MACA,WAAW,QACX,QACW;AACX,SAAO;AAAA,IACL,IAAIA,SAAQ,MAAM,IAAI;AAAA,IACtB,MAAMD,UAAS;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,QAAQ,SAAS,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC;AAAA,EACpD;AACF;AAKO,SAAS,cAAc,OAAuB;AACnD,QAAM,QAAQ,MAAM,YAAY;AAChC,QAAM,OAAO,MAAM,MAAM,GAAG,EAAE,CAAC;AAC/B,QAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI,KAAK;AACtC,MAAI,KAAK,WAAW,UAAU,EAAG,QAAO;AACxC,MAAI,KAAK,WAAW,OAAO,KAAK,KAAK,WAAW,SAAS,EAAG,QAAO;AACnE,MAAI,KAAK,WAAW,OAAO,EAAG,QAAO;AACrC,MAAI,KAAK,WAAW,OAAO,EAAG,QAAO;AACrC,MAAI,KAAK,WAAW,UAAU,EAAG,QAAO;AACxC,MAAI,KAAK,WAAW,OAAO,KAAK,KAAK,SAAS,OAAO,EAAG,QAAO;AAC/D,MAAI,KAAK,WAAW,WAAW,EAAG,QAAO;AACzC,SAAO;AACT;;;ADlBA,SAAS,cAAc,OAA+C;AACpE,MAAI,CAAC,MAAO,QAAO,CAAC;AACpB,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,OAAO,KAAK,KAAK;AAC1B;AAEA,SAAS,yBACP,MACA,UACe;AACf,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,KAAK,SAAS,QAAQE,OAAK,SAAS,EAAE,GAAG,MAAM,KAAM,QAAO,EAAE,KAAK;AAAA,EAC3E;AACA,SAAO;AACT;AAQA,eAAsB,gBACpB,OACA,UACA,UACqD;AACrD,MAAI,aAAa;AACjB,MAAI,aAAa;AAEjB,MAAI,cAA6B;AACjC,aAAW,QAAQ,CAAC,sBAAsB,qBAAqB,GAAG;AAChE,UAAM,MAAMA,OAAK,KAAK,UAAU,IAAI;AACpC,QAAI,MAAM,OAAO,GAAG,GAAG;AACrB,oBAAc;AACd;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,YAAa,QAAO,EAAE,YAAY,WAAW;AAElD,MAAI;AACJ,MAAI;AACF,cAAU,MAAM,SAAsB,WAAW;AAAA,EACnD,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACAA,OAAK,SAAS,UAAU,WAAW;AAAA,MACnC;AAAA,IACF;AACA,WAAO,EAAE,YAAY,WAAW;AAAA,EAClC;AACA,MAAI,CAAC,SAAS,SAAU,QAAO,EAAE,YAAY,WAAW;AACxD,QAAM,eAAeA,OAAK,SAAS,UAAU,WAAW,EAAE,MAAMA,OAAK,GAAG,EAAE,KAAK,GAAG;AAElF,QAAM,sBAAsB,oBAAI,IAAoB;AACpD,aAAW,CAAC,aAAa,GAAG,KAAK,OAAO,QAAQ,QAAQ,QAAQ,GAAG;AACjE,UAAM,mBAAmB,yBAAyB,aAAa,QAAQ;AACvE,QAAI,kBAAkB;AACpB,0BAAoB,IAAI,aAAa,gBAAgB;AACrD;AAAA,IACF;AACA,UAAM,OAAO,IAAI,QAAQ,cAAc,IAAI,KAAK,IAAI;AACpD,UAAM,OAAO,cAAc,MAAM,WAAW;AAC5C,QAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,YAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B;AAAA,IACF;AACA,wBAAoB,IAAI,aAAa,KAAK,EAAE;AAAA,EAC9C;AAEA,aAAW,CAAC,aAAa,GAAG,KAAK,OAAO,QAAQ,QAAQ,QAAQ,GAAG;AACjE,UAAM,WAAW,oBAAoB,IAAI,WAAW;AACpD,QAAI,CAAC,SAAU;AACf,eAAW,OAAO,cAAc,IAAI,UAAU,GAAG;AAC/C,YAAM,WAAW,oBAAoB,IAAI,GAAG;AAC5C,UAAI,CAAC,SAAU;AACf,YAAM,SAASC,iBAAW,UAAU,UAAUC,UAAS,UAAU;AACjE,UAAI,MAAM,QAAQ,MAAM,EAAG;AAG3B,YAAM,OAAkB;AAAA,QACtB,IAAI;AAAA,QACJ,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,MAAMA,UAAS;AAAA,QACf,YAAYC,YAAW;AAAA,QACvB,YAAYC,wBAAuB,YAAY;AAAA,QAC/C,UAAU,EAAE,MAAM,aAAa;AAAA,MACjC;AACA,YAAM,eAAe,QAAQ,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAC3D;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,WAAW;AAClC;;;AEjHA,OAAOC,YAAU;AACjB,SAAS,YAAYC,YAAU;AAE/B,SAAS,YAAAC,WAAU,cAAAC,aAAY,0BAAAC,+BAA8B;AAU7D,SAAS,aAAa,SAAgC;AACpD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,OAAsB;AAC1B,aAAW,OAAO,OAAO;AACvB,UAAM,OAAO,IAAI,KAAK;AACtB,QAAI,CAAC,QAAQ,KAAK,WAAW,GAAG,EAAG;AACnC,QAAI,CAAC,YAAY,KAAK,IAAI,EAAG;AAC7B,UAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,CAAC,SAAS,MAAM,YAAY,MAAM,UAAW;AACjD,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,eAAsB,sBACpB,OACA,UACA,UACqD;AACrD,MAAI,aAAa;AACjB,MAAI,aAAa;AAEjB,aAAW,WAAW,UAAU;AAC9B,UAAM,iBAAiBC,OAAK,KAAK,QAAQ,KAAK,YAAY;AAC1D,QAAI,CAAE,MAAM,OAAO,cAAc,EAAI;AACrC,QAAI;AACJ,QAAI;AACF,gBAAU,MAAMC,KAAG,SAAS,gBAAgB,MAAM;AAAA,IACpD,SAAS,KAAK;AACZ;AAAA,QACE;AAAA,QACAD,OAAK,SAAS,UAAU,cAAc;AAAA,QACtC;AAAA,MACF;AACA;AAAA,IACF;AACA,UAAM,QAAQ,aAAa,OAAO;AAClC,QAAI,CAAC,MAAO;AAEZ,UAAM,OAAO,cAAc,mBAAmB,KAAK;AACnD,QAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,YAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B;AAAA,IACF;AAEA,UAAM,SAASE,iBAAW,QAAQ,KAAK,IAAI,KAAK,IAAIC,UAAS,OAAO;AACpE,QAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAE1B,YAAM,OAAkB;AAAA,QACtB,IAAI;AAAA,QACJ,QAAQ,QAAQ,KAAK;AAAA,QACrB,QAAQ,KAAK;AAAA,QACb,MAAMA,UAAS;AAAA,QACf,YAAYC,YAAW;AAAA,QACvB,YAAYC,wBAAuB,YAAY;AAAA,QAC/C,UAAU;AAAA,UACR,MAAML,OAAK,SAAS,UAAU,cAAc,EAAE,MAAMA,OAAK,GAAG,EAAE,KAAK,GAAG;AAAA,QACxE;AAAA,MACF;AACA,YAAM,eAAe,QAAQ,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAC3D;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,WAAW;AAClC;;;AClFA,SAAS,YAAYM,YAAU;AAC/B,OAAOC,YAAU;AASjB,IAAM,cAAc;AAEpB,eAAe,YAAY,OAAe,QAAQ,GAAG,MAAM,GAAsB;AAC/E,MAAI,QAAQ,IAAK,QAAO,CAAC;AACzB,QAAM,MAAgB,CAAC;AACvB,QAAM,UAAU,MAAMC,KAAG,QAAQ,OAAO,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AAC/E,aAAW,SAAS,SAAS;AAC3B,QAAI,MAAM,YAAY,GAAG;AACvB,UAAI,aAAa,IAAI,MAAM,IAAI,KAAK,MAAM,SAAS,aAAc;AACjE,UAAI,KAAK,GAAI,MAAM,YAAYC,OAAK,KAAK,OAAO,MAAM,IAAI,GAAG,QAAQ,GAAG,GAAG,CAAE;AAAA,IAC/E,WAAW,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,KAAK,GAAG;AACvD,UAAI,KAAKA,OAAK,KAAK,OAAO,MAAM,IAAI,CAAC;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,sBACpB,OACA,UACqD;AACrD,MAAI,aAAa;AACjB,QAAM,QAAQ,MAAM,YAAY,QAAQ;AACxC,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,MAAMD,KAAG,SAAS,MAAM,MAAM;AAC9C,gBAAY,YAAY;AACxB,QAAI;AACJ,YAAQ,IAAI,YAAY,KAAK,OAAO,OAAO,MAAM;AAC/C,YAAM,OAAO,EAAE,CAAC;AAChB,YAAM,OAAO,EAAE,CAAC;AAChB,YAAM,OAAO,cAAc,MAAM,MAAM,KAAK;AAC5C,UAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,cAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,YAAY,YAAY,EAAE;AACrC;;;AChDA,SAAS,YAAYE,YAAU;AAC/B,OAAOC,YAAU;AACjB,SAAS,qBAAAC,0BAAyB;AAUlC,IAAM,yBAAiD;AAAA,EACrD,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,WAAW;AAAA,EACX,SAAS;AAAA,EACT,KAAK;AAAA,EACL,SAAS;AACX;AAEA,eAAeC,eAAc,OAAe,QAAQ,GAAG,MAAM,GAAsB;AACjF,MAAI,QAAQ,IAAK,QAAO,CAAC;AACzB,QAAM,MAAgB,CAAC;AACvB,QAAM,UAAU,MAAMC,KAAG,QAAQ,OAAO,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AAC/E,aAAW,SAAS,SAAS;AAC3B,QAAI,MAAM,YAAY,GAAG;AACvB,UAAI,aAAa,IAAI,MAAM,IAAI,EAAG;AAClC,UAAI,KAAK,GAAI,MAAMD,eAAcE,OAAK,KAAK,OAAO,MAAM,IAAI,GAAG,QAAQ,GAAG,GAAG,CAAE;AAAA,IACjF,WAAW,MAAM,OAAO,KAAK,uBAAuB,IAAIA,OAAK,QAAQ,MAAM,IAAI,CAAC,GAAG;AACjF,UAAI,KAAKA,OAAK,KAAK,OAAO,MAAM,IAAI,CAAC;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;AAMA,eAAsB,gBACpB,OACA,UACqD;AACrD,MAAI,aAAa;AACjB,QAAM,QAAQ,MAAMF,eAAc,QAAQ;AAC1C,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,MAAMC,KAAG,SAAS,MAAM,MAAM;AAC9C,QAAI;AACJ,QAAI;AACF,aAAOE,mBAAkB,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAW;AAAA,IACnE,QAAQ;AACN;AAAA,IACF;AACA,eAAW,OAAO,MAAM;AACtB,UAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,UAAU,KAAM;AACvC,YAAM,YAAY,uBAAuB,IAAI,IAAI;AACjD,UAAI,CAAC,UAAW;AAChB,YAAM,aAAa,IAAI,SAAS,YAC5B,GAAG,IAAI,SAAS,SAAS,IAAI,IAAI,SAAS,IAAI,KAC9C,IAAI,SAAS;AACjB,YAAM,OAAO,cAAc,WAAW,YAAY,YAAY;AAC9D,UAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,GAAG;AAC3B,cAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,YAAY,YAAY,EAAE;AACrC;;;ACvDA,eAAsB,SACpB,OACA,UACA,UAC6B;AAC7B,QAAM,UAAU,MAAM,gBAAgB,OAAO,UAAU,QAAQ;AAC/D,QAAM,aAAa,MAAM,sBAAsB,OAAO,UAAU,QAAQ;AACxE,QAAM,YAAY,MAAM,sBAAsB,OAAO,QAAQ;AAC7D,QAAM,MAAM,MAAM,gBAAgB,OAAO,QAAQ;AAEjD,SAAO;AAAA,IACL,YACE,QAAQ,aAAa,WAAW,aAAa,UAAU,aAAa,IAAI;AAAA,IAC1E,YACE,QAAQ,aAAa,WAAW,aAAa,UAAU,aAAa,IAAI;AAAA,EAC5E;AACF;;;ACCA,OAAOC,YAAU;;;AChCjB,SAAS,kBAAkB;AAC3B,OAAOC,YAAU;AAEjB,SAAS,cAAAC,oBAAkB;AASpB,SAAS,kBAAkB,OAAkB,MAAsB;AACxE,QAAM,aAAa,KAAK,MAAM,IAAI,EAAE,KAAK,GAAG;AAC5C,QAAM,SAAmB,CAAC;AAC1B,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,OAAO;AACb,QAAI,KAAK,eAAeA,aAAW,UAAW;AAC9C,QAAI,CAAC,KAAK,UAAU,KAAM;AAC1B,QAAI,KAAK,SAAS,SAAS,WAAY,QAAO,KAAK,EAAE;AAAA,EACvD,CAAC;AACD,aAAW,MAAM,OAAQ,OAAM,SAAS,EAAE;AAC1C,SAAO,OAAO;AAChB;AAkBO,SAAS,kCACd,OACA,UACA,cAAiC,CAAC,GAC1B;AACR,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAQ,CAAC,UAAU,GAAG,WAAW;AACvC,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,OAAO;AACb,QAAI,KAAK,eAAeA,aAAW,UAAW;AAC9C,UAAM,eAAe,KAAK,UAAU;AACpC,QAAI,CAAC,aAAc;AACnB,QAAID,OAAK,WAAW,YAAY,GAAG;AACjC,UAAI,CAAC,WAAW,YAAY,EAAG,QAAO,KAAK,EAAE;AAC7C;AAAA,IACF;AAEA,UAAM,QAAQ,MAAM,KAAK,CAAC,SAAS,WAAWA,OAAK,KAAK,MAAM,YAAY,CAAC,CAAC;AAC5E,QAAI,CAAC,MAAO,QAAO,KAAK,EAAE;AAAA,EAC5B,CAAC;AACD,aAAW,MAAM,OAAQ,OAAM,SAAS,EAAE;AAC1C,SAAO,OAAO;AAChB;;;ADWA,eAAsB,qBACpB,OACA,UACA,OAAuB,CAAC,GACA;AACxB,QAAM,mBAAmB;AAIzB,wBAAsB;AAEtB,QAAM,WAAW,MAAM,iBAAiB,QAAQ;AAEhD,QAAM,cAAc,gBAAgB,OAAO,QAAQ;AACnD,QAAM,kBAAkB,OAAO,UAAU,QAAQ;AACjD,QAAM,SAAS,MAAM,sBAAsB,OAAO,UAAU,QAAQ;AACpE,QAAM,SAAS,MAAM,eAAe,OAAO,UAAU,QAAQ;AAC7D,QAAM,SAAS,MAAM,aAAa,OAAO,QAAQ;AACjD,QAAM,SAAS,MAAM,SAAS,OAAO,UAAU,QAAQ;AAOvD,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA;AAAA,IACA,SAAS,IAAI,CAAC,MAAM,EAAE,GAAG;AAAA,EAC3B;AACA,QAAM,oBAAoB,qBAAqB,KAAK;AAKpD,MAAI,KAAK,gBAAiB,OAAM,KAAK,gBAAgB,KAAK;AAK1D,QAAM,eAAe,sBAAsB;AAC3C,MAAI,KAAK,cAAc,aAAa,SAAS,GAAG;AAC9C,QAAI;AACF,YAAM,sBAAsB,cAAc,KAAK,UAAU;AAAA,IAC3D,SAAS,KAAK;AACZ,cAAQ;AAAA,QACN,+CAA+C,KAAK,UAAU,KAAM,IAAc,OAAO;AAAA,MAC3F;AAAA,IACF;AAAA,EACF;AAKA,QAAM,iBAAiB,sBAAsB;AAC7C,MACE,qBAAqB,KACrB,KAAK,cACL,eAAe,SAAS,GACxB;AAGA,UAAM,eAAeE,OAAK,KAAKA,OAAK,QAAQ,KAAK,UAAU,GAAG,iBAAiB;AAC/E,QAAI;AACF,YAAM,uBAAuB,gBAAgB,YAAY;AAAA,IAC3D,SAAS,KAAK;AACZ,cAAQ;AAAA,QACN,sDAAsD,YAAY,KAAM,IAAc,OAAO;AAAA,MAC/F;AAAA,IACF;AAAA,EACF;AAEA,QAAM,SAAwB;AAAA,IAC5B,YACE,cACA,OAAO,aACP,OAAO,aACP,OAAO,aACP,OAAO;AAAA,IACT,YACE,OAAO,aAAa,OAAO,aAAa,OAAO,aAAa,OAAO;AAAA,IACrE;AAAA,IACA,kBAAkB,aAAa;AAAA,IAC/B;AAAA,IACA;AAAA,IACA,kBAAkB,eAAe;AAAA,IACjC;AAAA,EACF;AAKA,gBAAc;AAAA,IACZ,MAAM;AAAA,IACN,SAAS,KAAK,WAAW;AAAA,IACzB,SAAS;AAAA,MACP,SAAS,KAAK,WAAW;AAAA,MACzB,WAAW,SAAS;AAAA,MACpB,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO;AAAA,IACrB;AAAA,EACF,CAAC;AAED,SAAO;AACT;;;AElLA,SAAS,YAAYC,YAAU;AAC/B,OAAOC,YAAU;AAGjB,IAAM,iBAAiB;AAWvB,SAAS,cAAc,SAAyC;AAC9D,QAAM,QAAS,QAAQ,MACpB;AACH,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,eAAW,QAAQ,OAAO;AACxB,UAAI,KAAK,cAAc,qBAAqB,KAAK,YAAY;AAC3D,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,GAAG,SAAS,eAAe,EAAE;AACxC;AAEA,eAAe,UAAU,UAAiC;AACxD,QAAMD,KAAG,MAAMC,OAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D;AAEA,eAAsB,gBAAgB,OAAkB,SAAgC;AACtF,QAAM,UAAU,OAAO;AACvB,QAAM,UAA0B;AAAA,IAC9B,eAAe;AAAA,IACf,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACnC,OAAO,MAAM,OAAO;AAAA,EACtB;AAGA,QAAM,MAAM,GAAG,OAAO;AACtB,QAAMD,KAAG,UAAU,KAAK,KAAK,UAAU,OAAO,GAAG,MAAM;AACvD,QAAMA,KAAG,OAAO,KAAK,OAAO;AAC9B;AAEA,eAAsB,kBAAkB,OAAkB,SAAgC;AACxF,MAAI;AACJ,MAAI;AACF,UAAM,MAAMA,KAAG,SAAS,SAAS,MAAM;AAAA,EACzC,SAAS,KAAK;AACZ,QAAK,IAA8B,SAAS,SAAU;AACtD,UAAM;AAAA,EACR;AACA,MAAI,UAAU,KAAK,MAAM,GAAG;AAC5B,MAAI,QAAQ,kBAAkB,GAAG;AAC/B,cAAU,cAAc,OAAO;AAAA,EACjC;AACA,MAAI,QAAQ,kBAAkB,gBAAgB;AAC5C,UAAM,IAAI;AAAA,MACR,+CAA+C,QAAQ,aAAa,cAAc,cAAc;AAAA,IAClG;AAAA,EACF;AACA,QAAM,MAAM;AACZ,QAAM,OAAO,QAAQ,KAAK;AAC5B;AAKO,SAAS,iBACd,OACA,SACA,aAAa,KACD;AACZ,MAAI,UAAU;AAEd,QAAM,OAAO,YAA2B;AACtC,QAAI,QAAS;AACb,QAAI;AACF,YAAM,gBAAgB,OAAO,OAAO;AAAA,IACtC,SAAS,KAAK;AACZ,cAAQ,MAAM,iCAAiC,GAAG;AAAA,IACpD;AAAA,EACF;AAEA,QAAM,WAAW,YAAY,MAAM;AACjC,SAAK,KAAK;AAAA,EACZ,GAAG,UAAU;AAEb,QAAM,WAAW,CAAC,WAAiC;AACjD,UAAM,YAAY;AAChB,UAAI;AACF,cAAM,gBAAgB,OAAO,OAAO;AAAA,MACtC,SAAS,KAAK;AACZ,gBAAQ,MAAM,YAAY,MAAM,gBAAgB,GAAG;AAAA,MACrD,UAAE;AACA,gBAAQ,KAAK,CAAC;AAAA,MAChB;AAAA,IACF,GAAG;AAAA,EACL;AAEA,UAAQ,GAAG,WAAW,QAAQ;AAC9B,UAAQ,GAAG,UAAU,QAAQ;AAE7B,SAAO,MAAM;AACX,cAAU;AACV,kBAAc,QAAQ;AACtB,YAAQ,IAAI,WAAW,QAAQ;AAC/B,YAAQ,IAAI,UAAU,QAAQ;AAAA,EAChC;AACF;;;AC/GA,SAAS,YAAYE,YAAU;AAgD/B,eAAsB,oBAAoB,QAA4C;AACpF,MAAI,gBAAgB,KAAK,MAAM,GAAG;AAChC,UAAM,MAAM,MAAM,MAAM,MAAM;AAC9B,QAAI,CAAC,IAAI,IAAI;AACX,YAAM,IAAI,MAAM,SAAS,MAAM,YAAY,IAAI,MAAM,IAAI,IAAI,UAAU,EAAE;AAAA,IAC3E;AACA,WAAQ,MAAM,IAAI,KAAK;AAAA,EACzB;AACA,QAAM,MAAM,MAAMA,KAAG,SAAS,QAAQ,MAAM;AAC5C,SAAO,KAAK,MAAM,GAAG;AACvB;AAEA,SAAS,aACP,SACgB;AAChB,QAAM,IAAI,oBAAI,IAAe;AAC7B,MAAI,CAAC,QAAS,QAAO;AACrB,aAAW,SAAS,SAAS;AAC3B,UAAM,KAAM,MAAM,YAAY,MAA6B,MAAM;AACjE,QAAI,CAAC,GAAI;AACT,MAAE,IAAI,IAAI,MAAM,UAAe;AAAA,EACjC;AACA,SAAO;AACT;AAEO,SAAS,iBACd,WACA,cACA,qBAA4B,oBAAI,KAAK,GAAE,YAAY,GACxC;AACX,QAAM,YAAY,aAAwB,aAAa,OAAO,KAAK;AACnE,QAAM,YAAY,aAAwB,aAAa,OAAO,KAAK;AAEnE,QAAM,YAAY,oBAAI,IAAuB;AAC7C,YAAU,YAAY,CAAC,IAAI,UAAU,UAAU,IAAI,IAAI,KAAkB,CAAC;AAC1E,QAAM,YAAY,oBAAI,IAAuB;AAC7C,YAAU,YAAY,CAAC,IAAI,UAAU,UAAU,IAAI,IAAI,KAAkB,CAAC;AAE1E,QAAM,SAAoB;AAAA,IACxB,MAAM,EAAE,YAAY,aAAa,WAAW;AAAA,IAC5C,SAAS,EAAE,YAAY,kBAAkB;AAAA,IACzC,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,IAC9B,SAAS,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,IAChC,SAAS,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAClC;AAEA,aAAW,CAAC,IAAI,KAAK,KAAK,WAAW;AACnC,UAAM,SAAS,UAAU,IAAI,EAAE;AAC/B,QAAI,CAAC,QAAQ;AACX,aAAO,MAAM,MAAM,KAAK,KAAK;AAAA,IAC/B,WAAW,CAAC,aAAa,QAAQ,KAAK,GAAG;AACvC,aAAO,QAAQ,MAAM,KAAK,EAAE,IAAI,QAAQ,MAAM,CAAC;AAAA,IACjD;AAAA,EACF;AACA,aAAW,CAAC,IAAI,MAAM,KAAK,WAAW;AACpC,QAAI,CAAC,UAAU,IAAI,EAAE,EAAG,QAAO,QAAQ,MAAM,KAAK,MAAM;AAAA,EAC1D;AACA,aAAW,CAAC,IAAI,KAAK,KAAK,WAAW;AACnC,UAAM,SAAS,UAAU,IAAI,EAAE;AAC/B,QAAI,CAAC,QAAQ;AACX,aAAO,MAAM,MAAM,KAAK,KAAK;AAAA,IAC/B,WAAW,CAAC,aAAa,QAAQ,KAAK,GAAG;AACvC,aAAO,QAAQ,MAAM,KAAK,EAAE,IAAI,QAAQ,MAAM,CAAC;AAAA,IACjD;AAAA,EACF;AACA,aAAW,CAAC,IAAI,MAAM,KAAK,WAAW;AACpC,QAAI,CAAC,UAAU,IAAI,EAAE,EAAG,QAAO,QAAQ,MAAM,KAAK,MAAM;AAAA,EAC1D;AAEA,SAAO;AACT;AAIA,SAAS,aAAa,GAAY,GAAqB;AACrD,SAAO,cAAc,CAAC,MAAM,cAAc,CAAC;AAC7C;AAEA,SAAS,cAAc,OAAwB;AAC7C,SAAO,KAAK,UAAU,OAAO,CAAC,MAAM,MAAM;AACxC,QAAI,KAAK,OAAO,MAAM,YAAY,CAAC,MAAM,QAAQ,CAAC,GAAG;AACnD,aAAO,OAAO,KAAK,CAA4B,EAC5C,KAAK,EACL,OAAgC,CAAC,KAAK,MAAM;AAC3C,YAAI,CAAC,IAAK,EAA8B,CAAC;AACzC,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACT;AACA,WAAO;AAAA,EACT,CAAC;AACH;;;ACpIA,OAAOC,YAAU;AAkBV,SAAS,gBAAgB,SAAiB,SAA+B;AAC9E,MAAI,YAAY,iBAAiB;AAC/B,WAAO;AAAA,MACL,cAAcC,OAAK,KAAK,SAAS,YAAY;AAAA,MAC7C,YAAYA,OAAK,KAAK,SAAS,eAAe;AAAA,MAC9C,iBAAiBA,OAAK,KAAK,SAAS,qBAAqB;AAAA,MACzD,qBAAqBA,OAAK,KAAK,SAAS,iBAAiB;AAAA,MACzD,sBAAsBA,OAAK,KAAK,SAAS,0BAA0B;AAAA,IACrE;AAAA,EACF;AACA,SAAO;AAAA,IACL,cAAcA,OAAK,KAAK,SAAS,GAAG,OAAO,OAAO;AAAA,IAClD,YAAYA,OAAK,KAAK,SAAS,UAAU,OAAO,SAAS;AAAA,IACzD,iBAAiBA,OAAK,KAAK,SAAS,gBAAgB,OAAO,SAAS;AAAA,IACpE,qBAAqBA,OAAK,KAAK,SAAS,cAAc,OAAO,OAAO;AAAA,IACpE,sBAAsBA,OAAK,KAAK,SAAS,qBAAqB,OAAO,SAAS;AAAA,EAChF;AACF;AAUO,IAAM,WAAN,MAAe;AAAA,EACZ,WAAW,oBAAI,IAA4B;AAAA,EAEnD,OAAO,KAA2B;AAChC,SAAK,SAAS,IAAI,IAAI,MAAM,GAAG;AAAA,EACjC;AAAA,EAEA,IACE,MACA,MACgB;AAChB,UAAM,MAAsB;AAAA,MAC1B;AAAA,MACA,OAAO,KAAK,SAAS,SAAS,IAAI;AAAA,MAClC,UAAU,KAAK;AAAA,MACf,OAAO,KAAK;AAAA,MACZ,aAAa,KAAK;AAAA,IACpB;AACA,SAAK,SAAS,IAAI,MAAM,GAAG;AAC3B,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,MAA0C;AAC5C,WAAO,KAAK,SAAS,IAAI,IAAI;AAAA,EAC/B;AAAA,EAEA,IAAI,MAAuB;AACzB,WAAO,KAAK,SAAS,IAAI,IAAI;AAAA,EAC/B;AAAA,EAEA,OAAiB;AACf,WAAO,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC,EAAE,KAAK;AAAA,EACxC;AAAA,EAEA,kBAAkB,MAAc,OAAsC;AACpE,UAAM,MAAM,KAAK,SAAS,IAAI,IAAI;AAClC,QAAI,IAAK,KAAI,cAAc;AAAA,EAC7B;AACF;AAKO,SAAS,mBAAmB,KAAmC;AACpE,MAAI,CAAC,IAAK,QAAO,CAAC;AAClB,SAAO,IACJ,MAAM,GAAG,EACT,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,MAAM,eAAe;AACxD;;;ACjFA,SAAS,YAAYC,YAAU;AAC/B,OAAOC,SAAQ;AACf,OAAOC,YAAU;AACjB;AAAA,EACE;AAAA,OAIK;AAEP,IAAM,kBAAkB;AACxB,IAAM,gBAAgB;AAItB,SAAS,WAAmB;AAC1B,QAAM,WAAW,QAAQ,IAAI;AAC7B,MAAI,YAAY,SAAS,SAAS,EAAG,QAAOA,OAAK,QAAQ,QAAQ;AACjE,SAAOA,OAAK,KAAKD,IAAG,QAAQ,GAAG,OAAO;AACxC;AAEO,SAAS,eAAuB;AACrC,SAAOC,OAAK,KAAK,SAAS,GAAG,eAAe;AAC9C;AAEO,SAAS,mBAA2B;AACzC,SAAOA,OAAK,KAAK,SAAS,GAAG,oBAAoB;AACnD;AAQA,eAAsB,qBAAqB,OAAgC;AACzE,QAAM,WAAWA,OAAK,QAAQ,KAAK;AACnC,MAAI;AACF,WAAO,MAAMF,KAAG,SAAS,QAAQ;AAAA,EACnC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQA,eAAsB,gBAAgB,QAAgB,UAAiC;AACrF,QAAMA,KAAG,MAAME,OAAK,QAAQ,MAAM,GAAG,EAAE,WAAW,KAAK,CAAC;AACxD,QAAM,MAAM,GAAG,MAAM,IAAI,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC;AAC5F,QAAM,KAAK,MAAMF,KAAG,KAAK,KAAK,GAAG;AACjC,MAAI;AACF,UAAM,GAAG,UAAU,UAAU,MAAM;AACnC,UAAM,GAAG,KAAK;AAAA,EAChB,UAAE;AACA,UAAM,GAAG,MAAM;AAAA,EACjB;AACA,QAAMA,KAAG,OAAO,KAAK,MAAM;AAC7B;AAEA,eAAe,YAAY,UAAkB,YAAoB,iBAAgC;AAC/F,QAAM,WAAW,KAAK,IAAI,IAAI;AAC9B,QAAMA,KAAG,MAAME,OAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC1D,SAAO,MAAM;AACX,QAAI;AACF,YAAM,KAAK,MAAMF,KAAG,KAAK,UAAU,IAAI;AACvC,YAAM,GAAG,MAAM;AACf;AAAA,IACF,SAAS,KAAK;AACZ,YAAM,OAAQ,IAA8B;AAC5C,UAAI,SAAS,SAAU,OAAM;AAC7B,UAAI,KAAK,IAAI,KAAK,UAAU;AAC1B,cAAM,IAAI;AAAA,UACR,kCAAkC,SAAS,kBAAkB,QAAQ;AAAA,QAEvE;AAAA,MACF;AACA,YAAM,IAAI,QAAQ,CAAC,MAAM,WAAW,GAAG,aAAa,CAAC;AAAA,IACvD;AAAA,EACF;AACF;AAEA,eAAe,YAAY,UAAiC;AAC1D,QAAMA,KAAG,OAAO,QAAQ,EAAE,MAAM,MAAM;AAAA,EAAC,CAAC;AAC1C;AAEA,eAAe,SAAY,IAAkC;AAC3D,QAAM,OAAO,iBAAiB;AAC9B,QAAM,YAAY,IAAI;AACtB,MAAI;AACF,WAAO,MAAM,GAAG;AAAA,EAClB,UAAE;AACA,UAAM,YAAY,IAAI;AAAA,EACxB;AACF;AASA,eAAsB,eAAsC;AAC1D,QAAM,OAAO,aAAa;AAC1B,MAAI;AACJ,MAAI;AACF,UAAM,MAAMA,KAAG,SAAS,MAAM,MAAM;AAAA,EACtC,SAAS,KAAK;AACZ,QAAK,IAA8B,SAAS,UAAU;AACpD,aAAO,EAAE,SAAS,GAAG,UAAU,CAAC,EAAE;AAAA,IACpC;AACA,UAAM;AAAA,EACR;AACA,QAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,SAAO,mBAAmB,MAAM,MAAM;AACxC;AAEA,eAAe,cAAc,KAAkC;AAG7D,QAAM,YAAY,mBAAmB,MAAM,GAAG;AAC9C,QAAM,gBAAgB,aAAa,GAAG,KAAK,UAAU,WAAW,MAAM,CAAC,IAAI,IAAI;AACjF;AASO,IAAM,4BAAN,cAAwC,MAAM;AAAA,EAC1C;AAAA,EACT,YAAY,MAAc;AACxB,UAAM,mCAAmC,IAAI,yBAAyB;AACtE,SAAK,OAAO;AACZ,SAAK,cAAc;AAAA,EACrB;AACF;AASA,eAAsB,WAAW,MAAiD;AAChF,QAAM,eAAe,MAAM,qBAAqB,KAAK,IAAI;AACzD,SAAO,SAAS,YAAY;AAC1B,UAAM,MAAM,MAAM,aAAa;AAC/B,UAAM,SAAS,IAAI,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,IAAI;AAC5D,UAAM,SAAS,IAAI,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY;AAE/D,QAAI,UAAU,OAAO,SAAS,cAAc;AAC1C,YAAM,IAAI,0BAA0B,KAAK,IAAI;AAAA,IAC/C;AAEA,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AAEnC,QAAI,UAAU,OAAO,SAAS,cAAc;AAG1C,aAAO,aAAa;AACpB,UAAI,KAAK,UAAW,QAAO,YAAY,KAAK;AAC5C,UAAI,KAAK,OAAQ,QAAO,SAAS,KAAK;AACtC,YAAM,cAAc,GAAG;AACvB,aAAO;AAAA,IACT;AAEA,QAAI,UAAU,OAAO,SAAS,KAAK,MAAM;AAGvC,YAAM,IAAI,0BAA0B,OAAO,IAAI;AAAA,IACjD;AAEA,UAAM,QAAuB;AAAA,MAC3B,MAAM,KAAK;AAAA,MACX,MAAM;AAAA,MACN,cAAc;AAAA,MACd,WAAW,KAAK,aAAa,CAAC;AAAA,MAC9B,QAAQ,KAAK,UAAU;AAAA,IACzB;AACA,QAAI,SAAS,KAAK,KAAK;AACvB,UAAM,cAAc,GAAG;AACvB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAsB,WAAW,MAAkD;AACjF,QAAM,MAAM,MAAM,aAAa;AAC/B,SAAO,IAAI,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AACjD;AAEA,eAAsB,eAAyC;AAC7D,QAAM,MAAM,MAAM,aAAa;AAC/B,SAAO,IAAI;AACb;AAEA,eAAsB,UAAU,MAAc,QAAgD;AAC5F,SAAO,SAAS,YAAY;AAC1B,UAAM,MAAM,MAAM,aAAa;AAC/B,UAAM,QAAQ,IAAI,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AACtD,QAAI,CAAC,MAAO,OAAM,IAAI,MAAM,oCAAoC,IAAI,GAAG;AACvE,UAAM,SAAS;AACf,UAAM,cAAc,GAAG;AACvB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAsB,cAAc,MAAc,MAAa,oBAAI,KAAK,GAAE,YAAY,GAAkB;AACtG,QAAM,SAAS,YAAY;AACzB,UAAM,MAAM,MAAM,aAAa;AAC/B,UAAM,QAAQ,IAAI,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AACtD,QAAI,CAAC,MAAO;AACZ,UAAM,aAAa;AACnB,UAAM,cAAc,GAAG;AAAA,EACzB,CAAC;AACH;AAQA,eAAsB,cAAc,MAAkD;AACpF,SAAO,SAAS,YAAY;AAC1B,UAAM,MAAM,MAAM,aAAa;AAC/B,UAAM,MAAM,IAAI,SAAS,UAAU,CAAC,MAAM,EAAE,SAAS,IAAI;AACzD,QAAI,MAAM,EAAG,QAAO;AACpB,UAAM,CAAC,OAAO,IAAI,IAAI,SAAS,OAAO,KAAK,CAAC;AAC5C,UAAM,cAAc,GAAG;AACvB,WAAO;AAAA,EACT,CAAC;AACH;;;AClQA,OAAO,aAIA;AACP,OAAO,UAAU;AAQjB,SAAS,sBAAsB,yBAAyB,4BAA4B;;;ACQpF;AAAA,EACE;AAAA,EACA,YAAAG;AAAA,EACA,YAAAC;AAAA,EACA;AAAA,EACA,cAAAC;AAAA,OACK;AAkCP,SAAS,UAAU,QAAgB,QAAgB,MAAsB;AACvE,SAAO,GAAG,IAAI,IAAI,MAAM,IAAI,MAAM;AACpC;AAEA,SAAS,YAAY,OAA2C;AAC9D,QAAM,UAAU,oBAAI,IAAwB;AAC5C,QAAM,YAAY,CAAC,IAAI,UAAU;AAC/B,UAAM,IAAI;AACV,UAAM,SAAS,YAAY,EAAE;AAG7B,UAAM,aAAa,QAAQ,cAAc,EAAE;AAC3C,UAAM,MAAM,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI;AAChD,UAAM,MACJ,QAAQ,IAAI,GAAG,KAAK,EAAE,QAAQ,EAAE,QAAQ,QAAQ,EAAE,QAAQ,MAAM,EAAE,KAAK;AACzE,YAAQ,YAAY;AAAA,MAClB,KAAKC,aAAW;AACd,YAAI,YAAY;AAChB;AAAA,MACF,KAAKA,aAAW;AACd,YAAI,WAAW;AACf;AAAA,MACF,KAAKA,aAAW;AACd,YAAI,WAAW;AACf;AAAA,MACF,KAAKA,aAAW;AACd,YAAI,WAAW;AACf;AAAA,MACF;AAGE,YAAI,EAAE,eAAeA,aAAW,MAAO,KAAI,QAAQ;AAAA,IACvD;AACA,YAAQ,IAAI,KAAK,GAAG;AAAA,EACtB,CAAC;AACD,SAAO;AACT;AAEA,SAAS,eAAe,OAAkB,QAAyB;AACjE,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO;AACnC,QAAM,QAAQ,MAAM,kBAAkB,MAAM;AAC5C,SAAO,MAAM,SAASC,WAAS;AACjC;AAEA,SAAS,gBAAgB,GAAmB;AAC1C,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AACnC;AAEA,SAAS,yBAAyB,QAAgB,QAAgB,MAAsB;AACtF,SAAO,iBAAiB,MAAM,WAAM,MAAM,KAAK,IAAI;AACrD;AAEA,SAAS,0BAA0B,QAAgB,QAAgB,MAAsB;AACvF,SAAO,uBAAuB,MAAM,WAAM,MAAM,KAAK,IAAI;AAC3D;AAEA,IAAM,kCACJ;AACF,IAAM,mCACJ;AACF,IAAM,+BACJ;AAaF,SAAS,iBAAiB,MAAyB;AACjD,MAAI,OAAO,KAAK,eAAe,SAAU,QAAO,gBAAgB,KAAK,UAAU;AAC/E,SAAO,gBAAgB,kBAAkB,IAAI,CAAC;AAChD;AAEA,SAAS,yBACP,OACA,QACc;AACd,QAAM,MAAoB,CAAC;AAE3B,MAAI,OAAO,aAAa,CAAC,OAAO,UAAU;AAKxC,QAAI,CAAC,eAAe,OAAO,OAAO,MAAM,GAAG;AAIzC,UAAI,KAAK;AAAA,QACP,MAAM;AAAA,QACN,QAAQ,OAAO;AAAA,QACf,QAAQ,OAAO;AAAA,QACf,UAAU,OAAO;AAAA,QACjB,WAAW,OAAO;AAAA,QAClB,YAAY,iBAAiB,OAAO,SAAS;AAAA,QAC7C,QAAQ,yBAAyB,OAAO,QAAQ,OAAO,QAAQ,OAAO,IAAI;AAAA,QAC1E,gBAAgB;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,OAAO,YAAY,CAAC,OAAO,WAAW;AAGxC,QAAI,KAAK;AAAA,MACP,MAAM;AAAA,MACN,QAAQ,OAAO;AAAA,MACf,QAAQ,OAAO;AAAA,MACf,UAAU,OAAO;AAAA,MACjB,UAAU,OAAO;AAAA,MACjB,YAAY,iBAAiB,OAAO,QAAQ;AAAA,MAC5C,QAAQ,0BAA0B,OAAO,QAAQ,OAAO,QAAQ,OAAO,IAAI;AAAA,MAC3E,gBAAgB;AAAA,IAClB,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAOA,SAAS,gBAAgB,KAAiC;AACxD,QAAM,MAAM,IAAI,oBAAoB,KAAK;AACzC,MAAI,CAAC,IAAK,QAAO;AAGjB,QAAM,QAAQ,IAAI,YAAY,GAAG;AACjC,MAAI,UAAU,GAAI,QAAO;AACzB,QAAM,OAAO,IAAI,MAAM,QAAQ,CAAC;AAChC,MAAI,QAAQ,KAAK,IAAI,EAAG,QAAO,IAAI,MAAM,GAAG,KAAK;AACjD,SAAO;AACT;AAEA,SAAS,yBAAyB,OAAkB,OAAwB;AAC1E,aAAW,UAAU,MAAM,cAAc,KAAK,GAAG;AAC/C,UAAM,IAAI,MAAM,kBAAkB,MAAM;AACxC,QAAI,EAAE,SAASC,UAAS,iBAAiB,EAAE,eAAeF,aAAW,WAAW;AAC9E,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBACP,OACA,OACA,KACc;AACd,QAAM,eAAe,gBAAgB,GAAG;AACxC,MAAI,CAAC,aAAc,QAAO,CAAC;AAC3B,MAAI,CAAC,yBAAyB,OAAO,KAAK,EAAG,QAAO,CAAC;AAErD,QAAM,MAAoB,CAAC;AAC3B,aAAW,UAAU,MAAM,cAAc,KAAK,GAAG;AAC/C,UAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,QAAI,KAAK,SAASE,UAAS,YAAa;AACxC,QAAI,KAAK,eAAeF,aAAW,SAAU;AAC7C,UAAM,SAAS,MAAM,kBAAkB,KAAK,MAAM;AAClD,QAAI,OAAO,SAASC,WAAS,aAAc;AAC3C,UAAM,eAAe,OAAO,MAAM,KAAK;AACvC,QAAI,CAAC,aAAc;AACnB,QAAI,iBAAiB,aAAc;AAEnC,QAAI,KAAK;AAAA,MACP,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ,KAAK;AAAA,MACb,eAAe;AAAA,MACf;AAAA,MACA,YAAY,gBAAgB,kBAAkB,IAAI,CAAC;AAAA,MACnD,QAAQ,mBAAmB,KAAK,gBAAgB,YAAY,4BAA4B,YAAY;AAAA,MACpG,gBAAgB;AAAA,IAClB,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,wBACP,OACA,OACA,KACc;AACd,QAAM,MAAoB,CAAC;AAC3B,QAAM,OAAO,IAAI,gBAAgB,CAAC;AAElC,aAAW,UAAU,MAAM,cAAc,KAAK,GAAG;AAC/C,UAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,QAAI,KAAK,SAASC,UAAS,YAAa;AACxC,QAAI,KAAK,eAAeF,aAAW,SAAU;AAC7C,UAAM,SAAS,MAAM,kBAAkB,KAAK,MAAM;AAClD,QAAI,OAAO,SAASC,WAAS,aAAc;AAI3C,eAAW,QAAQ,YAAY,GAAG;AAChC,UAAI,KAAK,WAAW,OAAO,OAAQ;AACnC,YAAM,WAAW,KAAK,KAAK,MAAM;AACjC,UAAI,CAAC,SAAU;AACf,YAAM,SAAS;AAAA,QACb,KAAK;AAAA,QACL;AAAA,QACA,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,UAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,YAAI,KAAK;AAAA,UACP,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,kBAAkB;AAAA,UAClB,iBAAiB,OAAO;AAAA,UACxB,eAAe;AAAA,UACf,YAAY;AAAA,UACZ,QAAQ,OAAO;AAAA,UACf,gBAAgB,OAAO,mBACnB,WAAW,KAAK,MAAM,UAAU,OAAO,gBAAgB,MACvD,cAAc,KAAK,MAAM,wCAAwC,OAAO,MAAM,IAAI,OAAO,aAAa;AAAA,QAC5G,CAAC;AAAA,MACH;AAAA,IACF;AAMA,eAAW,QAAQ,eAAe,GAAG;AACnC,YAAM,WAAW,KAAK,KAAK,OAAO;AAClC,UAAI,CAAC,SAAU;AACf,YAAM,SAAS,mBAAmB,MAAM,QAAQ;AAChD,UAAI,CAAC,OAAO,cAAc,OAAO,QAAQ;AACvC,cAAM,UAAyB;AAAA,UAC7B,MAAM,KAAK,QAAQ;AAAA,UACnB,QAAQ,OAAO;AAAA,UACf,SAAS,KAAK;AAAA,QAChB;AACA,YAAI,KAAK;AAAA,UACP,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,MAAM;AAAA,UACN,UAAU;AAAA,UACV,YAAY;AAAA,UACZ,QAAQ,OAAO;AAAA,UACf,gBAAgB,sBAAsB,KAAK,OAAO,IAAI,QAAQ;AAAA,QAChE,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,aAAa,GAAe,QAAyB;AAC5D,SAAO,EAAE,WAAW,UAAU,EAAE,WAAW;AAC7C;AAEO,SAAS,mBACd,OACA,OAA4B,CAAC,GACX;AAClB,QAAM,MAAoB,CAAC;AAG3B,QAAM,UAAU,YAAY,KAAK;AACjC,aAAW,UAAU,QAAQ,OAAO,GAAG;AACrC,eAAW,KAAK,yBAAyB,OAAO,MAAM,EAAG,KAAI,KAAK,CAAC;AAAA,EACrE;AAGA,QAAM,YAAY,CAAC,QAAQ,UAAU;AACnC,UAAM,IAAI;AACV,QAAI,EAAE,SAASA,WAAS,YAAa;AACrC,UAAM,MAAM;AACZ,eAAW,KAAK,mBAAmB,OAAO,QAAQ,GAAG,EAAG,KAAI,KAAK,CAAC;AAClE,eAAW,KAAK,wBAAwB,OAAO,QAAQ,GAAG,EAAG,KAAI,KAAK,CAAC;AAAA,EACzE,CAAC;AAID,MAAI,WAAW;AACf,MAAI,KAAK,MAAM;AACb,UAAM,UAAU,KAAK;AACrB,eAAW,SAAS,OAAO,CAAC,MAAM,QAAQ,IAAI,EAAE,IAAI,CAAC;AAAA,EACvD;AACA,MAAI,KAAK,kBAAkB,QAAW;AACpC,UAAM,YAAY,KAAK;AACvB,eAAW,SAAS,OAAO,CAAC,MAAM,EAAE,cAAc,SAAS;AAAA,EAC7D;AACA,MAAI,KAAK,MAAM;AACb,UAAM,SAAS,KAAK;AACpB,eAAW,SAAS,OAAO,CAAC,MAAM,aAAa,GAAG,MAAM,CAAC;AAAA,EAC3D;AAKA,QAAM,kBAAkD;AAAA,IACtD,qBAAqB;AAAA,IACrB,oBAAoB;AAAA,IACpB,oBAAoB;AAAA,IACpB,iBAAiB;AAAA,IACjB,oBAAoB;AAAA,EACtB;AACA,WAAS,KAAK,CAAC,GAAG,MAAM;AACtB,QAAI,EAAE,eAAe,EAAE,WAAY,QAAO,EAAE,aAAa,EAAE;AAC3D,UAAM,OAAO,gBAAgB,EAAE,IAAI,IAAI,gBAAgB,EAAE,IAAI;AAC7D,QAAI,SAAS,EAAG,QAAO;AACvB,QAAI,EAAE,SAAS,EAAE,KAAM,QAAO,EAAE,KAAK,cAAc,EAAE,IAAI;AACzD,QAAI,EAAE,WAAW,EAAE,OAAQ,QAAO,EAAE,OAAO,cAAc,EAAE,MAAM;AACjE,WAAO,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,EACxC,CAAC;AAED,SAAO,uBAAuB,MAAM;AAAA,IAClC,aAAa;AAAA,IACb,eAAe,SAAS;AAAA,IACxB,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,EACrC,CAAC;AACH;;;ACnXO,IAAM,mBAAmB;AACzB,IAAM,uBAAuB;AAQ7B,SAAS,UACd,KACA,OACA,MACM;AACN,QAAM,cAAc,KAAK,eAAe;AACxC,QAAM,kBAAkB,KAAK,mBAAmB;AAEhD,QAAM,IAAI,UAAU,gBAAgB,mBAAmB;AACvD,QAAM,IAAI,UAAU,iBAAiB,wBAAwB;AAC7D,QAAM,IAAI,UAAU,cAAc,YAAY;AAC9C,QAAM,IAAI,UAAU,qBAAqB,IAAI;AAC7C,QAAM,IAAI,eAAe;AAEzB,MAAI,UAAU;AACd,MAAI,UAAU;AAEd,QAAM,kBAAkB,MAAY;AAClC,QAAI,QAAS;AACb,cAAU;AACV,aAAS,IAAI,mBAAmB,QAAQ;AACxC,kBAAc,SAAS;AACvB,QAAI,CAAC,MAAM,IAAI,cAAe,OAAM,IAAI,IAAI;AAAA,EAC9C;AAEA,QAAM,aAAa,CAAC,UAAwB;AAC1C,QAAI,QAAS;AACb,QAAI,WAAW,iBAAiB;AAI9B,YAAM,WAAW;AAAA,QAAuB,KAAK,UAAU,EAAE,QAAQ,eAAe,CAAC,CAAC;AAAA;AAAA;AAClF,YAAM,IAAI,MAAM,QAAQ;AACxB,sBAAgB;AAChB;AAAA,IACF;AACA;AACA,UAAM,IAAI,MAAM,OAAO,MAAM;AAC3B,gBAAU,KAAK,IAAI,GAAG,UAAU,CAAC;AAAA,IACnC,CAAC;AAAA,EACH;AAEA,QAAM,WAAW,CAAC,aAAsC;AACtD,QAAI,SAAS,YAAY,KAAK,QAAS;AACvC,eAAW,UAAU,SAAS,IAAI;AAAA,QAAW,KAAK,UAAU,SAAS,OAAO,CAAC;AAAA;AAAA,CAAM;AAAA,EACrF;AAEA,WAAS,GAAG,mBAAmB,QAAQ;AAEvC,QAAM,YAAY,YAAY,MAAM;AAClC,QAAI,QAAS;AACb,UAAM,IAAI,MAAM,gBAAgB;AAAA,EAClC,GAAG,WAAW;AACd,MAAI,OAAO,UAAU,UAAU,WAAY,WAAU,MAAM;AAE3D,MAAI,IAAI,GAAG,SAAS,eAAe;AACnC,QAAM,IAAI,GAAG,SAAS,eAAe;AACrC,QAAM,IAAI,GAAG,SAAS,eAAe;AACvC;;;AFvBA,SAAS,eAAe,OAAmC;AACzD,QAAM,QAAqB,CAAC;AAC5B,QAAM,YAAY,CAAC,KAAK,UAAU;AAChC,UAAM,KAAK,KAAK;AAAA,EAClB,CAAC;AACD,QAAM,QAAqB,CAAC;AAC5B,QAAM,YAAY,CAAC,KAAK,UAAU;AAChC,UAAM,KAAK,KAAK;AAAA,EAClB,CAAC;AACD,SAAO,EAAE,OAAO,MAAM;AACxB;AAEA,SAAS,eAAe,KAA6B;AAInD,QAAM,SAAS,IAAI;AACnB,SAAO,OAAO,WAAW;AAC3B;AAEA,SAAS,eACP,UACA,KACA,OACuB;AACvB,QAAM,OAAO,eAAe,GAAG;AAC/B,QAAM,MAAM,SAAS,IAAI,IAAI;AAC7B,MAAI,CAAC,KAAK;AACR,SAAK,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,qBAAqB,SAAS,KAAK,CAAC;AACvE,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,MAAiC;AAC5D,MAAI,KAAK,SAAU,QAAO,KAAK;AAC/B,MAAI,CAAC,KAAK,OAAO;AACf,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,QAAM,WAAW,IAAI,SAAc;AAGnC,QAAM,QAAQ,gBAAgB,iBAAiB,EAAE;AACjD,WAAS,IAAI,iBAAiB;AAAA,IAC5B,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,OAAO;AAAA,MACL,cAAc,MAAM;AAAA,MACpB,YAAY,KAAK,cAAc,MAAM;AAAA,MACrC,iBAAiB,KAAK,mBAAmB,MAAM;AAAA,MAC/C,qBAAqB,MAAM;AAAA,MAC3B,sBAAsB,MAAM;AAAA,IAC9B;AAAA,IACA,aAAa,KAAK;AAAA,EACpB,CAAC;AACD,SAAO;AACT;AAmBA,SAAS,eAAe,OAAwB,KAAyB;AACvE,QAAM,EAAE,UAAU,WAAW,eAAe,mBAAmB,IAAI;AAMnE,QAAM,IAAsC,WAAW,CAAC,KAAK,UAAU;AACrE,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,cAAU,KAAK,OAAO,EAAE,SAAS,KAAK,KAAK,CAAC;AAAA,EAC9C,CAAC;AAED,QAAM,IAAsC,WAAW,OAAO,KAAK,UAAU;AAC3E,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,WAAW,KAAK,IAAI,IAAI;AAC9B,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,SAAS,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAIA,QAAQ,KAAK,MAAM,WAAW,GAAI;AAAA,MAClC,WAAW,KAAK,MAAM;AAAA,MACtB,WAAW,KAAK,MAAM;AAAA,MACtB,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACtC;AAAA,EACF,CAAC;AAED,QAAM,IAAsC,UAAU,OAAO,KAAK,UAAU;AAC1E,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,WAAO,eAAe,KAAK,KAAK;AAAA,EAClC,CAAC;AAED,QAAM;AAAA,IACJ;AAAA,IACA,OAAO,KAAK,UAAU;AACpB,YAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,UAAI,CAAC,KAAM;AACX,YAAM,EAAE,GAAG,IAAI,IAAI;AACnB,UAAI,CAAC,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC3B,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kBAAkB,GAAG,CAAC;AAAA,MAC7D;AACA,aAAO,EAAE,MAAM,KAAK,MAAM,kBAAkB,EAAE,EAAe;AAAA,IAC/D;AAAA,EACF;AAEA,QAAM;AAAA,IACJ;AAAA,IACA,OAAO,KAAK,UAAU;AACpB,YAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,UAAI,CAAC,KAAM;AACX,YAAM,EAAE,GAAG,IAAI,IAAI;AACnB,UAAI,CAAC,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC3B,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kBAAkB,GAAG,CAAC;AAAA,MAC7D;AACA,YAAM,UAAU,KAAK,MAClB,aAAa,EAAE,EACf,IAAI,CAAC,MAAM,KAAK,MAAM,kBAAkB,CAAC,CAAc;AAC1D,YAAM,WAAW,KAAK,MACnB,cAAc,EAAE,EAChB,IAAI,CAAC,MAAM,KAAK,MAAM,kBAAkB,CAAC,CAAc;AAC1D,aAAO,EAAE,SAAS,SAAS;AAAA,IAC7B;AAAA,EACF;AAKA,QAAM,IAGH,+BAA+B,OAAO,KAAK,UAAU;AACtD,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,EAAE,OAAO,IAAI,IAAI;AACvB,QAAI,CAAC,KAAK,MAAM,QAAQ,MAAM,GAAG;AAC/B,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kBAAkB,IAAI,OAAO,CAAC;AAAA,IACrE;AACA,UAAM,QAAQ,IAAI,MAAM,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAC1D,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,KAAK,QAAQ,mCAAmC;AACrF,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,QAC1B,OAAO,mCAAmC,iCAAiC;AAAA,MAC7E,CAAC;AAAA,IACH;AACA,WAAO,0BAA0B,KAAK,OAAO,QAAQ,KAAK;AAAA,EAC5D,CAAC;AAKD,QAAM,IAGH,sBAAsB,OAAO,KAAK,UAAU;AAC7C,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,QAAI;AACJ,QAAI,IAAI,MAAM,MAAM;AAClB,YAAM,aAAa,IAAI,MAAM,KAC1B,MAAM,GAAG,EACT,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC7B,YAAM,SAA2B,CAAC;AAClC,iBAAW,KAAK,YAAY;AAC1B,cAAM,IAAI,qBAAqB,UAAU,CAAC;AAC1C,YAAI,CAAC,EAAE,SAAS;AACd,iBAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,YAC1B,OAAO,4BAA4B,CAAC;AAAA,YACpC,SAAS,qBAAqB;AAAA,UAChC,CAAC;AAAA,QACH;AACA,eAAO,KAAK,EAAE,IAAI;AAAA,MACpB;AACA,mBAAa,IAAI,IAAI,MAAM;AAAA,IAC7B;AACA,QAAI;AACJ,QAAI,IAAI,MAAM,kBAAkB,QAAW;AACzC,YAAM,IAAI,OAAO,IAAI,MAAM,aAAa;AACxC,UAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG;AACzC,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,UAC1B,OAAO;AAAA,QACT,CAAC;AAAA,MACH;AACA,sBAAgB;AAAA,IAClB;AACA,WAAO,mBAAmB,KAAK,OAAO;AAAA,MACpC,GAAI,aAAa,EAAE,MAAM,WAAW,IAAI,CAAC;AAAA,MACzC,GAAI,kBAAkB,SAAY,EAAE,cAAc,IAAI,CAAC;AAAA,MACvD,GAAI,IAAI,MAAM,OAAO,EAAE,MAAM,IAAI,MAAM,KAAK,IAAI,CAAC;AAAA,IACnD,CAAC;AAAA,EACH,CAAC;AAKD,QAAM,IAGH,cAAc,OAAO,KAAK,UAAU;AACrC,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,cAAc,IAAI;AAChC,QAAI,CAAC,MAAO,QAAO,EAAE,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAC,EAAE;AACpD,UAAM,SAAS,MAAM,gBAAgB,KAAK;AAC1C,UAAM,QAAQ,OAAO;AACrB,UAAM,QAAQ,IAAI,MAAM,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAC1D,UAAM,YACJ,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,OAAO,GAAG,IAAI;AAC/D,UAAM,SAAS,OAAO,MAAM,GAAG,SAAS;AACxC,WAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,QAAQ,OAAO;AAAA,EACvD,CAAC;AAED,QAAM,IAGH,iBAAiB,OAAO,KAAK,UAAU;AACxC,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,mBAAmB,IAAI;AACrC,QAAI,CAAC,MAAO,QAAO,EAAE,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAC,EAAE;AACpD,UAAM,SAAS,MAAM,gBAAgB,KAAK;AAC1C,UAAM,WAAW,IAAI,MAAM,WACvB,OAAO,OAAO,CAAC,MAAM,EAAE,aAAa,IAAI,MAAM,QAAQ,IACtD;AACJ,UAAM,UAAU,CAAC,GAAG,QAAQ,EAAE,QAAQ;AACtC,UAAM,QAAQ,QAAQ;AACtB,UAAM,QAAQ,IAAI,MAAM,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAC1D,UAAM,SAAS,QAAQ,MAAM,GAAG,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,QAAQ,EAAE;AAChF,WAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,QAAQ,OAAO;AAAA,EACvD,CAAC;AAED,QAAM;AAAA,IACJ;AAAA,IACA,OAAO,KAAK,UAAU;AACpB,YAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,UAAI,CAAC,KAAM;AACX,YAAM,EAAE,OAAO,IAAI,IAAI;AACvB,UAAI,CAAC,KAAK,MAAM,QAAQ,MAAM,GAAG;AAC/B,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kBAAkB,IAAI,OAAO,CAAC;AAAA,MACrE;AACA,YAAM,QAAQ,cAAc,IAAI;AAChC,UAAI,CAAC,MAAO,QAAO,EAAE,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAC,EAAE;AACpD,YAAM,SAAS,MAAM,gBAAgB,KAAK;AAC1C,YAAM,WAAW,OAAO;AAAA,QACtB,CAAC,MACC,EAAE,iBAAiB,UAAU,EAAE,YAAY,OAAO,QAAQ,aAAa,EAAE;AAAA,MAC7E;AACA,aAAO,EAAE,OAAO,SAAS,QAAQ,OAAO,SAAS,QAAQ,QAAQ,SAAS;AAAA,IAC5E;AAAA,EACF;AAEA,QAAM,IAGH,6BAA6B,OAAO,KAAK,UAAU;AACpD,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,EAAE,OAAO,IAAI,IAAI;AACvB,QAAI,CAAC,KAAK,MAAM,QAAQ,MAAM,GAAG;AAC/B,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kBAAkB,IAAI,OAAO,CAAC;AAAA,IACrE;AACA,QAAI;AACJ,UAAM,QAAQ,cAAc,IAAI;AAChC,QAAI,IAAI,MAAM,WAAW,OAAO;AAC9B,YAAM,SAAS,MAAM,gBAAgB,KAAK;AAC1C,mBAAa,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,IAAI,MAAM,OAAO;AAC1D,UAAI,CAAC,YAAY;AACf,eAAO,MACJ,KAAK,GAAG,EACR,KAAK,EAAE,OAAO,yBAAyB,IAAI,IAAI,MAAM,QAAQ,CAAC;AAAA,MACnE;AAAA,IACF;AACA,UAAM,SAAS,aAAa,KAAK,OAAO,QAAQ,UAAU;AAC1D,QAAI,CAAC,OAAQ,QAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,uBAAuB,IAAI,OAAO,CAAC;AACrF,WAAO;AAAA,EACT,CAAC;AAED,QAAM,IAGH,+BAA+B,OAAO,KAAK,UAAU;AACtD,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,EAAE,OAAO,IAAI,IAAI;AACvB,QAAI,CAAC,KAAK,MAAM,QAAQ,MAAM,GAAG;AAC/B,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kBAAkB,IAAI,OAAO,CAAC;AAAA,IACrE;AACA,UAAM,QAAQ,IAAI,MAAM,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAC1D,QAAI,UAAU,WAAc,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI;AACjE,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,sCAAsC,CAAC;AAAA,IAC9E;AACA,WAAO,eAAe,KAAK,OAAO,QAAQ,KAAK;AAAA,EACjD,CAAC;AAED,QAAM,IAGH,WAAW,OAAO,KAAK,UAAU;AAClC,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,OAAO,IAAI,MAAM,KAAK,IAAI,KAAK;AACrC,QAAI,CAAC,IAAK,QAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,kCAAkC,CAAC;AAClF,UAAM,QAAQ,IAAI,MAAM,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAC1D,UAAM,YACJ,UAAU,UAAa,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,QAAQ;AACvE,QAAI,KAAK,aAAa;AACpB,YAAM,SAAS,MAAM,KAAK,YAAY,OAAO,KAAK,SAAS;AAC3D,aAAO;AAAA,QACL,OAAO,OAAO;AAAA,QACd,UAAU,OAAO;AAAA,QACjB,SAAS,OAAO,QAAQ,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,MACpE;AAAA,IACF;AACA,UAAM,IAAI,IAAI,YAAY;AAC1B,UAAM,UAA6C,CAAC;AACpD,SAAK,MAAM,YAAY,CAAC,IAAI,UAAU;AACpC,YAAM,OAAQ,MAA4B,QAAQ;AAClD,UAAI,GAAG,YAAY,EAAE,SAAS,CAAC,KAAK,KAAK,YAAY,EAAE,SAAS,CAAC,GAAG;AAClE,gBAAQ,KAAK,EAAE,GAAI,OAAqB,OAAO,EAAE,CAAC;AAAA,MACpD;AAAA,IACF,CAAC;AACD,WAAO;AAAA,MACL,OAAO;AAAA,MACP,UAAU;AAAA,MACV,SAAS,QAAQ,MAAM,GAAG,SAAS;AAAA,IACrC;AAAA,EACF,CAAC;AAED,QAAM;AAAA,IACJ;AAAA,IACA,OAAO,KAAK,UAAU;AACpB,YAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,UAAI,CAAC,KAAM;AACX,YAAM,UAAU,IAAI,MAAM;AAC1B,UAAI,CAAC,SAAS;AACZ,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,wCAAwC,CAAC;AAAA,MAChF;AACA,UAAI;AACF,cAAM,WAAW,MAAM,oBAAoB,OAAO;AAClD,eAAO,iBAAiB,KAAK,OAAO,QAAQ;AAAA,MAC9C,SAAS,KAAK;AACZ,eAAO,MACJ,KAAK,GAAG,EACR,KAAK,EAAE,OAAO,2BAA2B,SAAS,QAAS,IAAc,QAAQ,CAAC;AAAA,MACvF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,KAAuC,eAAe,OAAO,KAAK,UAAU;AAChF,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,QAAI,CAAC,KAAK,UAAU;AAClB,aAAO,MACJ,KAAK,GAAG,EACR,KAAK,EAAE,OAAO,6CAA6C,SAAS,KAAK,KAAK,CAAC;AAAA,IACpF;AACA,UAAM,SAAS,MAAM,qBAAqB,KAAK,OAAO,KAAK,QAAQ;AACnE,WAAO;AAAA,MACL,SAAS,KAAK;AAAA,MACd,SAAS,KAAK;AAAA,MACd,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO;AAAA,MACnB,WAAW,KAAK,MAAM;AAAA,MACtB,WAAW,KAAK,MAAM;AAAA,IACxB;AAAA,EACF,CAAC;AAKD,QAAM,IAAsC,aAAa,OAAO,KAAK,UAAU;AAC7E,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,aAAa,IAAI,kBAAkB,IAAI;AAC7C,QAAI,CAAC,YAAY;AAGf,aAAO,EAAE,SAAS,GAAG,UAAU,CAAC,EAAE;AAAA,IACpC;AACA,QAAI;AACF,YAAM,WAAW,MAAM,eAAe,UAAU;AAChD,aAAO,EAAE,SAAS,GAAG,SAAS;AAAA,IAChC,SAAS,KAAK;AACZ,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,QAC1B,OAAO;AAAA,QACP,SAAU,IAAc;AAAA,MAC1B,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAED,QAAM,IAGH,wBAAwB,OAAO,KAAK,UAAU;AAC/C,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,MAAM,IAAI,oBAAoB,KAAK,MAAM,oBAAoB;AACnE,QAAI,aAAa,MAAM,IAAI,QAAQ;AACnC,QAAI,IAAI,MAAM,UAAU;AACtB,YAAM,MAAM,qBAAqB,UAAU,IAAI,MAAM,QAAQ;AAC7D,UAAI,CAAC,IAAI,SAAS;AAChB,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,UAC1B,OAAO;AAAA,UACP,SAAS,IAAI,MAAM,OAAO;AAAA,QAC5B,CAAC;AAAA,MACH;AACA,mBAAa,WAAW,OAAO,CAAC,MAAM,EAAE,aAAa,IAAI,IAAI;AAAA,IAC/D;AACA,QAAI,IAAI,MAAM,UAAU;AACtB,mBAAa,WAAW,OAAO,CAAC,MAAM,EAAE,aAAa,IAAI,MAAM,QAAQ;AAAA,IACzE;AACA,WAAO,EAAE,WAAW;AAAA,EACtB,CAAC;AAED,QAAM,KAGH,mBAAmB,OAAO,KAAK,UAAU;AAC1C,UAAM,OAAO,eAAe,UAAU,KAAK,KAAK;AAChD,QAAI,CAAC,KAAM;AACX,UAAM,SAAS,wBAAwB,UAAU,IAAI,QAAQ,CAAC,CAAC;AAC/D,QAAI,CAAC,OAAO,SAAS;AACnB,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,QAC1B,OAAO;AAAA,QACP,SAAS,OAAO,MAAM,OAAO;AAAA,MAC/B,CAAC;AAAA,IACH;AAEA,UAAM,aAAa,IAAI,kBAAkB,IAAI;AAC7C,QAAI,WAAqB,CAAC;AAC1B,QAAI,YAAY;AACd,UAAI;AACF,mBAAW,MAAM,eAAe,UAAU;AAAA,MAC5C,SAAS,KAAK;AACZ,eAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,UAC1B,OAAO;AAAA,UACP,SAAU,IAAc;AAAA,QAC1B,CAAC;AAAA,MACH;AAAA,IACF;AAKA,UAAM,UAAU,EAAE,KAAK,MAAM,KAAK,IAAI,EAAE;AACxC,QAAI,CAAC,OAAO,KAAK,oBAAoB;AACnC,YAAME,cAAa,oBAAoB,KAAK,OAAO,UAAU,OAAO;AACpE,YAAMC,YAAWD,YAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,OAAO;AACnE,aAAO,EAAE,SAASC,UAAS,WAAW,GAAG,YAAAD,YAAW;AAAA,IACtD;AAMA,UAAM,aAAa,oBAAoB,KAAK,OAAO,UAAU,OAAO;AACpE,UAAM,WAAW,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,OAAO;AACnE,WAAO;AAAA,MACL,SAAS,SAAS,WAAW;AAAA,MAC7B,oBAAoB,OAAO,KAAK;AAAA,MAChC;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,SAAS,MAAiD;AAC9E,QAAM,MAAM,QAAQ,EAAE,QAAQ,MAAM,CAAC;AACrC,QAAM,IAAI,SAAS,MAAM,EAAE,QAAQ,KAAK,CAAC;AAEzC,QAAM,YAAY,KAAK,aAAa,KAAK,IAAI;AAC7C,QAAM,WAAW,oBAAoB,IAAI;AAEzC,QAAM,uBAAuB,CAAC,KAAK,YAAY,KAAK,eAAe;AACnE,QAAM,sBAAsB,CAAC,KAAK,YAAY,KAAK,oBAAoB;AAEvE,QAAM,gBAAgB,CAAC,SAA6C;AAClE,QAAI,KAAK,SAAS,mBAAmB,CAAC,KAAK,UAAU;AACnD,aAAO,uBAAuB,KAAK,aAAa;AAAA,IAClD;AACA,WAAO,KAAK,MAAM;AAAA,EACpB;AACA,QAAM,qBAAqB,CAAC,SAA6C;AACvE,QAAI,KAAK,SAAS,mBAAmB,CAAC,KAAK,UAAU;AACnD,aAAO,sBAAsB,KAAK,kBAAkB;AAAA,IACtD;AACA,WAAO,KAAK,MAAM;AAAA,EACpB;AAKA,QAAM,oBAAoB,CAAC,SAA6C;AACtE,QAAI,CAAC,KAAK,SAAU,QAAO;AAC3B,WAAO,GAAG,KAAK,QAAQ;AAAA,EACzB;AAEA,QAAM,WAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAMA,MAAI,IAAI,aAAa,OAAO,MAAM,UAAU;AAC1C,QAAI;AACF,aAAO,MAAM,aAAqB;AAAA,IACpC,SAAS,KAAK;AACZ,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,QAC1B,OAAO;AAAA,QACP,SAAU,IAAc;AAAA,MAC1B,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAKD,MAAI,IAAqC,sBAAsB,OAAO,KAAK,UAAU;AACnF,QAAI;AACF,YAAM,QAAQ,MAAM,WAAmB,IAAI,OAAO,OAAO;AACzD,UAAI,CAAC,OAAO;AACV,eAAO,MACJ,KAAK,GAAG,EACR,KAAK,EAAE,OAAO,qBAAqB,SAAS,IAAI,OAAO,QAAQ,CAAC;AAAA,MACrE;AACA,aAAO,EAAE,SAAS,MAAM;AAAA,IAC1B,SAAS,KAAK;AACZ,aAAO,MAAM,KAAK,GAAG,EAAE,KAAK;AAAA,QAC1B,OAAO;AAAA,QACP,SAAU,IAAc;AAAA,MAC1B,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AAGD,iBAAe,KAAK,QAAQ;AAG5B,QAAM,IAAI;AAAA,IACR,OAAO,UAAU;AACf,qBAAe,OAAO,QAAQ;AAAA,IAChC;AAAA,IACA,EAAE,QAAQ,qBAAqB;AAAA,EACjC;AAEA,SAAO;AACT;","names":["path","fs","path","fs","path","NodeType","Provenance","Provenance","NodeType","frontierId","fs","path","EdgeType","NodeType","Provenance","NodeType","Provenance","fs","path","EdgeType","frontierId","NodeType","frontierId","serviceId","Provenance","fs","path","fs","path","fs","path","fs","path","fs","path","minimatch","NodeType","serviceId","fs","path","extractedEdgeId","fs","path","path","fs","fs","path","path","fs","path","fs","minimatch","serviceId","NodeType","path","fs","NodeType","serviceId","NodeType","path","fs","path","EdgeType","NodeType","Provenance","databaseId","path","path","fs","path","fs","path","parse","fs","path","path","parse","path","parse","parse","path","parse","path","parse","path","parse","path","path","parse","path","databaseId","NodeType","extractedEdgeId","EdgeType","Provenance","path","fs","path","EdgeType","NodeType","Provenance","confidenceForExtracted","fs","path","NodeType","extractedEdgeId","EdgeType","Provenance","confidenceForExtracted","EdgeType","NodeType","Provenance","confidenceForExtracted","passesExtractedFloor","path","EdgeType","Provenance","confidenceForExtracted","fs","path","fs","path","path","confidenceForExtracted","extractedEdgeId","EdgeType","Provenance","path","path","path","infraId","infraId","path","path","infraId","findAll","infraId","path","path","infraId","infraId","path","EdgeType","NodeType","extractedEdgeId","confidenceForExtracted","passesExtractedFloor","Provenance","path","EdgeType","Provenance","confidenceForExtracted","NodeType","infraId","path","extractedEdgeId","EdgeType","Provenance","confidenceForExtracted","path","fs","EdgeType","Provenance","confidenceForExtracted","path","fs","extractedEdgeId","EdgeType","Provenance","confidenceForExtracted","fs","path","fs","path","fs","path","parseAllDocuments","walkYamlFiles","fs","path","parseAllDocuments","path","path","Provenance","path","fs","path","fs","path","path","fs","os","path","EdgeType","NodeType","Provenance","Provenance","NodeType","EdgeType","violations","blocking"]}