@orquentra/codebuddy 2.14.0 → 2.15.1

package/dist/chunk-YNSTIMCF.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/map/indexer.ts","../src/indexer/engine.ts","../src/map/cache.ts","../src/indexer/store.ts","../src/indexer/types.ts","../src/indexer/scan.ts","../src/indexer/summary.ts","../src/integrations/graphify.ts","../src/map/graph-freshness.ts","../src/context/file-vectors.ts","../src/context/discovery.ts","../src/map/graphify.ts","../src/context/anchors.ts","../src/context/content-index.ts"],"sourcesContent":["import { readdir, readFile, stat } from \"node:fs/promises\";\nimport { dirname, extname, join, relative, resolve } from \"node:path\";\nimport { extractPythonImports } from \"../indexer/python.js\";\nimport type { ArchitectureMap, MapQuery, ModuleEdge, ModuleNode } from \"./types.js\";\n\nconst SUPPORTED_EXTENSIONS = new Set([\".ts\", \".tsx\", \".js\", \".jsx\", \".mjs\", \".cjs\", \".py\"]);\nconst IGNORED_DIRECTORIES = new Set([\n  \".git\",\n  \"node_modules\",\n  \"dist\",\n  \"build\",\n  \"coverage\",\n  \".codebuddy\",\n  // Python virtualenvs and caches would otherwise map site-packages.\n  \".venv\",\n  \"venv\",\n  \".tox\",\n  \"__pycache__\",\n]);\n\nexport async function buildArchitectureMap(\n  repositoryRoot = process.cwd(),\n): Promise<ArchitectureMap> {\n  const root = resolve(repositoryRoot);\n  const files = await listSourceFiles(root);\n  const fileSet = new Set(files.map((file) => normalize(relative(root, file))));\n  const modules: ModuleNode[] = [];\n  const edges: ModuleEdge[] = [];\n\n  for (const absolutePath of files) {\n    const source = await readFile(absolutePath, \"utf8\");\n    const from = normalize(relative(root, absolutePath));\n    const resolvedImports = moduleImports(root, from, source, fileSet);\n    edges.push(...resolvedImports.map(({ to, kind }) => ({ from, to, kind })));\n    modules.push({\n      path: from,\n      language: moduleLanguage(from),\n      imports: [...new Set(resolvedImports.map(({ to }) => to))].sort(),\n    });\n  }\n\n  return {\n    modules: modules.sort((left, right) => left.path.localeCompare(right.path)),\n    edges: edges.sort((left, right) =>\n      `${left.from}:${left.to}`.localeCompare(`${right.from}:${right.to}`),\n    ),\n  };\n}\n\nexport type IncrementalMapStats = { readFiles: number; reusedFiles: number; rebuilt: boolean };\n\n/** Build or update a map from an already-known source file set. */\nexport async function updateArchitectureMap(\n  repositoryRoot: string,\n  sourcePaths: string[],\n  previous: ArchitectureMap | null,\n  changedPaths: string[],\n): Promise<{ map: ArchitectureMap; stats: IncrementalMapStats }> {\n  const root = resolve(repositoryRoot);\n  const normalizedPaths = sourcePaths.map(normalize).sort();\n  const fileSet = new Set(normalizedPaths);\n  const changed = new Set(changedPaths.map(normalize));\n  const retainedModules = (previous?.modules ?? []).filter(\n    (module) => fileSet.has(module.path) && !changed.has(module.path),\n  );\n  const retainedEdges = (previous?.edges ?? []).filter(\n    (edge) => fileSet.has(edge.from) && fileSet.has(edge.to) && !changed.has(edge.from),\n  );\n  const modules = [...retainedModules];\n  const edges = [...retainedEdges];\n\n  for (const path of normalizedPaths) {\n    if (!changed.has(path)) continue;\n    const source = await readFile(join(root, path), \"utf8\");\n    const resolvedImports = moduleImports(root, path, source, fileSet);\n    edges.push(...resolvedImports.map(({ to, kind }) => ({ from: path, to, kind })));\n    modules.push({\n      path,\n      language: moduleLanguage(path),\n      imports: [...new Set(resolvedImports.map(({ to }) => to))].sort(),\n    });\n  }\n\n  return {\n    map: {\n      modules: modules.sort((left, right) => left.path.localeCompare(right.path)),\n      edges: edges.sort((left, right) =>\n        `${left.from}:${left.to}`.localeCompare(`${right.from}:${right.to}`),\n      ),\n    },\n    stats: {\n      readFiles: changed.size,\n      reusedFiles: retainedModules.length,\n      rebuilt: previous === null || changed.size === normalizedPaths.length,\n    },\n  };\n}\n\nexport function queryMap(map: ArchitectureMap, query: MapQuery): ModuleEdge[] {\n  const limit = query.limit ?? 50;\n  return map.edges\n    .filter((edge) => (query.from ? edge.from === normalize(query.from) : true))\n    .filter((edge) => (query.to ? edge.to === normalize(query.to) : true))\n    .slice(0, limit);\n}\n\nexport function neighbours(\n  map: ArchitectureMap,\n  modulePath: string,\n  direction: \"in\" | \"out\" | \"both\" = \"both\",\n): { modules: ModuleNode[]; edges: ModuleEdge[] } {\n  const target = normalize(modulePath);\n  const edges = map.edges.filter((edge) => {\n    if (direction === \"in\") return edge.to === target;\n    if (direction === \"out\") return edge.from === target;\n    return edge.from === target || edge.to === target;\n  });\n  const paths = new Set<string>([target]);\n  for (const edge of edges) {\n    paths.add(edge.from);\n    paths.add(edge.to);\n  }\n  return {\n    modules: map.modules.filter((module) => paths.has(module.path)),\n    edges,\n  };\n}\n\nasync function listSourceFiles(root: string): Promise<string[]> {\n  const files: string[] = [];\n  await walk(root, files);\n  return files.sort();\n}\n\nasync function walk(directory: string, files: string[]): Promise<void> {\n  const entries = await readdir(directory, { withFileTypes: true });\n  for (const entry of entries) {\n    const absolute = join(directory, entry.name);\n    if (entry.isDirectory()) {\n      if (IGNORED_DIRECTORIES.has(entry.name)) continue;\n      await walk(absolute, files);\n      continue;\n    }\n    if (!entry.isFile()) continue;\n    if (!SUPPORTED_EXTENSIONS.has(extname(entry.name))) continue;\n    const info = await stat(absolute);\n    if (info.size > 500_000) continue;\n    files.push(absolute);\n  }\n}\n\nfunction moduleLanguage(path: string): ModuleNode[\"language\"] {\n  const extension = extname(path);\n  if (extension === \".py\") return \"py\";\n  return extension.includes(\"ts\") ? \"ts\" : \"js\";\n}\n\n/** Resolved in-repo imports of one module; external specifiers yield nothing. */\nfunction moduleImports(\n  root: string,\n  from: string,\n  source: string,\n  fileSet: Set<string>,\n): Array<{ to: string; kind: ModuleEdge[\"kind\"] }> {\n  if (extname(from) === \".py\") {\n    return pythonImports(from, source, fileSet).map((to) => ({ to, kind: \"import\" as const }));\n  }\n  return extractImports(source).flatMap((specifier) => {\n    const to = resolveImport(root, from, specifier.value, fileSet);\n    return to ? [{ to, kind: specifier.kind }] : [];\n  });\n}\n\n/** Where absolute Python imports are looked up: the repo root, then a `src/` layout. */\nconst PYTHON_ROOTS = [\"\", \"src/\"];\n\n/**\n * Python imports resolved to repo files. Absolute modules are looked up under\n * `PYTHON_ROOTS` (first root that has them wins), relative ones from the\n * importing file's package. In `from pkg import name`, a `name` that is a\n * submodule gets its own edge; other names point at the package. Anything not\n * found (stdlib, third-party) is external and yields no edge.\n */\nfunction pythonImports(from: string, source: string, fileSet: Set<string>): string[] {\n  const pick = (...candidates: string[]) =>\n    candidates.find((candidate) => fileSet.has(candidate)) ?? null;\n  const moduleFile = (base: string) => pick(`${base}.py`, `${base}/__init__.py`);\n  const packageDir = from.split(\"/\").slice(0, -1);\n  const targets: string[] = [];\n  for (const statement of extractPythonImports(source)) {\n    const parts = statement.module ? statement.module.split(\".\") : [];\n    let bases: string[];\n    if (statement.level > 0) {\n      const up = statement.level - 1;\n      if (up > packageDir.length) continue;\n      bases = [[...packageDir.slice(0, packageDir.length - up), ...parts].join(\"/\")];\n    } else {\n      bases = PYTHON_ROOTS.map((prefix) => `${prefix}${parts.join(\"/\")}`);\n    }\n    for (const base of bases) {\n      const prefix = base ? `${base}/` : \"\";\n      // `from . import x` names the package itself, which only an __init__ can be.\n      const module = parts.length > 0 ? moduleFile(base) : pick(`${prefix}__init__.py`);\n      const submodules = statement.names.flatMap((name) => moduleFile(`${prefix}${name}`) ?? []);\n      if (!module && submodules.length === 0) continue;\n      targets.push(...submodules);\n      if (module && submodules.length < Math.max(1, statement.names.length)) targets.push(module);\n      break;\n    }\n  }\n  return [...new Set(targets)].filter((target) => target !== from);\n}\n\nfunction extractImports(source: string): Array<{ value: string; kind: ModuleEdge[\"kind\"] }> {\n  const imports: Array<{ value: string; kind: ModuleEdge[\"kind\"] }> = [];\n  // Strip line/block comments first so quoted specifiers inside comments can't\n  // fabricate phantom edges in the architecture map.\n  const stripped = source.replace(/\\/\\*[\\s\\S]*?\\*\\//g, \" \").replace(/(^|[^:])\\/\\/[^\\n]*/g, \"$1 \");\n  const staticImport = /\\bimport\\s+(?:type\\s+)?(?:[^'\"()+]+?\\s+from\\s+)?[\"']([^\"']+)[\"']/g;\n  const exportFrom = /\\bexport\\s+[^'\"()+]+?\\s+from\\s+[\"']([^\"']+)[\"']/g;\n  const dynamicImport = /\\bimport\\s*\\(\\s*[\"']([^\"']+)[\"']\\s*\\)/g;\n\n  for (const match of stripped.matchAll(staticImport)) {\n    if (match[1]) imports.push({ value: match[1], kind: \"import\" });\n  }\n  for (const match of stripped.matchAll(exportFrom)) {\n    if (match[1]) imports.push({ value: match[1], kind: \"import\" });\n  }\n  for (const match of stripped.matchAll(dynamicImport)) {\n    if (match[1]) imports.push({ value: match[1], kind: \"dynamic_import\" });\n  }\n  return imports;\n}\n\nfunction resolveImport(\n  root: string,\n  from: string,\n  specifier: string,\n  fileSet: Set<string>,\n): string | null {\n  if (!specifier.startsWith(\".\")) return null;\n  const base = normalize(relative(root, resolve(root, dirname(from), specifier)));\n  // ESM specifiers point at emitted JS (`./x.js`), but the source on disk is\n  // often `./x.ts`. Try the specifier EXACTLY as written first (so a real\n  // `x.js` file wins when both `x.ts` and `x.js` exist), then fall back to the\n  // extension-stripped stem for the TS-source case.\n  const stem = base.replace(/\\.(js|jsx|mjs|cjs)$/, \"\");\n  const bases = stem === base ? [base] : [base, stem];\n  const candidates = bases.flatMap((b) => [\n    b,\n    `${b}.ts`,\n    `${b}.tsx`,\n    `${b}.js`,\n    `${b}.jsx`,\n    `${b}.mjs`,\n    `${b}.cjs`,\n    `${b}/index.ts`,\n    `${b}/index.tsx`,\n    `${b}/index.js`,\n    `${b}/index.jsx`,\n  ]);\n  return candidates.find((candidate) => fileSet.has(candidate)) ?? null;\n}\n\nfunction normalize(path: string): string {\n  return path.replace(/\\\\/g, \"/\").replace(/^\\.\\//, \"\");\n}\n","import { createHash } from \"node:crypto\";\nimport type { Stats } from \"node:fs\";\nimport { readFile, stat } from \"node:fs/promises\";\nimport { join, resolve } from \"node:path\";\nimport { refreshArchitectureCache } from \"../map/cache.js\";\nimport { listIndexableFiles } from \"./scan.js\";\nimport { emptyManifest, IndexStore } from \"./store.js\";\nimport { summarizeSource } from \"./summary.js\";\nimport { extractSymbolTable, supportsSymbols } from \"./symbols.js\";\nimport {\n  INDEX_MANIFEST_VERSION,\n  type IndexEntry,\n  type IndexError,\n  type IndexManifest,\n  type IndexResult,\n} from \"./types.js\";\n\n/**\n * Incremental repository indexing. A file is re-summarized only when its\n * content hash differs from the manifest, so repeated runs over an unchanged\n * tree are cheap and deterministic. A file whose size, mtime and ctime still\n * match the entry is not even re-read. Per-file failures (unreadable, too\n * large) are isolated and reported; they never abort the pass. `full` ignores\n * existing hashes and rebuilds every entry.\n *\n * The same pass doubles as use-time validation (`loadFreshIndex`): context\n * tools run it before trusting indexed symbols, summaries or imports, so a CLI\n * or hook process with no watcher still sees current source.\n */\n\n/** Skip files larger than this — summarizing them is neither cheap nor useful. */\nconst MAX_FILE_BYTES = 512_000;\n/**\n * Files changed this recently are always re-hashed: a second edit inside a\n * coarse mtime tick could otherwise keep the same size and timestamps.\n */\nconst RACY_WINDOW_MS = 3_000;\n\nexport type IndexOptions = {\n  repositoryRoot?: string;\n  full?: boolean;\n  /** Injectable clock for deterministic tests. */\n  now?: () => Date;\n};\n\nexport async function indexRepository(options: IndexOptions = {}): Promise<IndexResult> {\n  return (await refreshIndex(options)).result;\n}\n\nexport type FreshIndex = {\n  manifest: IndexManifest;\n  /** One `index:` explain line: how the manifest compared with current source. */\n  explain: string;\n};\n\n/**\n * The manifest, validated against current source right now. Changed files are\n * re-summarized (symbols, imports), deleted ones dropped, new ones added, and\n * the result is persisted so the next call takes the metadata fast path. Never\n * throws: if validation fails the stored manifest is returned with a reason.\n */\nexport async function loadFreshIndex(repositoryRoot: string): Promise<FreshIndex> {\n  try {\n    const { result, manifest } = await refreshIndex({ repositoryRoot });\n    const delta = result.added + result.changed + result.removed;\n    const failures =\n      result.errors.length > 0\n        ? `; ${result.errors.length} file(s) could not be validated and were omitted`\n        : \"\";\n    return {\n      manifest,\n      explain:\n        delta === 0\n          ? `index: ${result.totalIndexed} indexed file(s) match current source${failures}`\n          : `index: refreshed against current source (${result.changed} changed, ${result.added} added, ${result.removed} removed; ${result.totalIndexed} indexed)${failures}`,\n    };\n  } catch (error) {\n    return {\n      manifest: emptyManifest(),\n      explain: `index: freshness check failed (${(error as Error).message}); indexed evidence omitted`,\n    };\n  }\n}\n\n// ponytail: in-process serialization only; separate processes (hook + MCP\n// server) can still race, which the metadata check heals on the next pass.\nconst passes = new Map<string, Promise<unknown>>();\n\n/** One pass at a time per repository, so overlapping callers never interleave writes. */\nfunction refreshIndex(\n  options: IndexOptions,\n): Promise<{ result: IndexResult; manifest: IndexManifest }> {\n  const key = resolve(options.repositoryRoot ?? process.cwd());\n  const next = (passes.get(key) ?? Promise.resolve())\n    .catch(() => undefined)\n    .then(() => runIndexPass(options));\n  passes.set(key, next);\n  void next\n    .finally(() => {\n      if (passes.get(key) === next) passes.delete(key);\n    })\n    .catch(() => undefined);\n  return next;\n}\n\nasync function runIndexPass(\n  options: IndexOptions,\n): Promise<{ result: IndexResult; manifest: IndexManifest }> {\n  const start = Date.now();\n  const now = options.now ?? (() => new Date());\n  const repositoryRoot = resolve(options.repositoryRoot ?? process.cwd());\n  const store = new IndexStore(repositoryRoot);\n\n  const [files, previous] = await Promise.all([listIndexableFiles(repositoryRoot), store.read()]);\n\n  const entries: Record<string, IndexEntry> = {};\n  const errors: IndexError[] = [];\n  let added = 0;\n  let changed = 0;\n  let unchanged = 0;\n  let skipped = 0;\n  // A never-written manifest is persisted even when the tree is empty.\n  let dirty = previous.generatedAt === emptyManifest().generatedAt;\n\n  for (const path of files) {\n    try {\n      const info = await stat(join(repositoryRoot, path));\n      if (!info.isFile()) continue;\n      if (info.size > MAX_FILE_BYTES) {\n        skipped++;\n        continue;\n      }\n\n      const existing = previous.entries[path];\n      if (!options.full && existing && statUnchanged(existing, info)) {\n        entries[path] = existing;\n        unchanged++;\n        continue;\n      }\n\n      const content = await readFile(join(repositoryRoot, path), \"utf8\");\n      const hash = hashContent(content);\n      const metadata = trustedMetadata(info);\n      dirty = true;\n\n      if (!options.full && existing && existing.hash === hash) {\n        const { mtimeMs: _mtime, ctimeMs: _ctime, ...rest } = existing;\n        entries[path] = { ...rest, size: info.size, ...metadata };\n        unchanged++;\n        continue;\n      }\n\n      const { language, lines, symbols, summary } = summarizeSource(path, content);\n      const symbolTable = supportsSymbols(path) ? extractSymbolTable(content, path) : [];\n      entries[path] = {\n        path,\n        hash,\n        size: info.size,\n        ...metadata,\n        language,\n        lines,\n        symbols,\n        ...(symbolTable.length > 0 ? { symbolTable } : {}),\n        summary,\n        indexedAt: now().toISOString(),\n      };\n      if (existing) changed++;\n      else added++;\n    } catch (error) {\n      errors.push({ path, error: (error as Error).message });\n      skipped++;\n    }\n  }\n\n  const removed = Object.keys(previous.entries).filter((path) => !(path in entries)).length;\n\n  const manifest: IndexManifest = {\n    version: INDEX_MANIFEST_VERSION,\n    generatedAt: now().toISOString(),\n    entries: sortEntries(entries),\n  };\n  if (dirty || removed > 0) await store.write(manifest);\n  const architecture = await refreshArchitectureCache(repositoryRoot, manifest);\n\n  const result: IndexResult = {\n    scanned: files.length,\n    added,\n    changed,\n    unchanged,\n    removed,\n    skipped,\n    errors,\n    durationMs: Date.now() - start,\n    totalIndexed: Object.keys(entries).length,\n    architecture: {\n      source: architecture.source,\n      readFiles: architecture.stats.readFiles,\n      reusedFiles: architecture.stats.reusedFiles,\n    },\n  };\n  return { result, manifest };\n}\n\nfunction statUnchanged(entry: IndexEntry, info: Stats): boolean {\n  return (\n    entry.mtimeMs !== undefined &&\n    entry.size === info.size &&\n    entry.mtimeMs === info.mtimeMs &&\n    entry.ctimeMs === info.ctimeMs\n  );\n}\n\n/** Stat metadata worth trusting later, or nothing while the file is still racy. */\nfunction trustedMetadata(info: Stats): { mtimeMs?: number; ctimeMs?: number } {\n  if (Date.now() - Math.max(info.mtimeMs, info.ctimeMs) < RACY_WINDOW_MS) return {};\n  return { mtimeMs: info.mtimeMs, ctimeMs: info.ctimeMs };\n}\n\nexport function hashContent(content: string): string {\n  return createHash(\"sha256\").update(content, \"utf8\").digest(\"hex\");\n}\n\nfunction sortEntries(entries: Record<string, IndexEntry>): Record<string, IndexEntry> {\n  return Object.fromEntries(\n    Object.keys(entries)\n      .sort()\n      .map((key) => [key, entries[key] as IndexEntry]),\n  );\n}\n","import { mkdir, readFile } from \"node:fs/promises\";\nimport { dirname, extname, join, resolve } from \"node:path\";\nimport { assertNoSymlinkBetween, writeAtomic } from \"../core/markdown-store-fs.js\";\nimport { IndexStore } from \"../indexer/store.js\";\nimport type { IndexManifest } from \"../indexer/types.js\";\nimport {\n  buildArchitectureMap,\n  type IncrementalMapStats,\n  updateArchitectureMap,\n} from \"./indexer.js\";\nimport type { ArchitectureMap } from \"./types.js\";\n\nconst CACHE_VERSION = 1;\nconst SOURCE_EXTENSIONS = new Set([\".ts\", \".tsx\", \".js\", \".jsx\", \".mjs\", \".cjs\", \".py\"]);\n\ntype ArchitectureCache = {\n  version: 1;\n  generatedAt: string;\n  sourceHashes: Record<string, string>;\n  map: ArchitectureMap;\n};\n\nexport type CachedArchitectureResult = {\n  map: ArchitectureMap;\n  stats: IncrementalMapStats;\n  source: \"cache\" | \"incremental\" | \"rebuild\" | \"fallback\";\n};\n\nexport async function loadArchitectureMap(\n  repositoryRoot = process.cwd(),\n  suppliedManifest?: IndexManifest,\n): Promise<CachedArchitectureResult> {\n  const root = resolve(repositoryRoot);\n  const manifest = suppliedManifest ?? (await new IndexStore(root).read());\n  if (Object.keys(manifest.entries).length === 0) {\n    const map = await buildArchitectureMap(root);\n    return {\n      map,\n      stats: { readFiles: map.modules.length, reusedFiles: 0, rebuilt: true },\n      source: \"fallback\",\n    };\n  }\n  return refreshArchitectureCache(root, manifest);\n}\n\nexport async function refreshArchitectureCache(\n  repositoryRoot: string,\n  manifest: IndexManifest,\n): Promise<CachedArchitectureResult> {\n  const root = resolve(repositoryRoot);\n  const path = join(root, \".codebuddy\", \"cache\", \"architecture.json\");\n  const currentHashes = sourceHashes(manifest);\n  const currentPaths = Object.keys(currentHashes).sort();\n  const cached = await readCache(path);\n  const cachedPaths = cached ? Object.keys(cached.sourceHashes).sort() : [];\n  const fileSetChanged = cachedPaths.join(\"\\n\") !== currentPaths.join(\"\\n\");\n  const changedPaths =\n    !cached || fileSetChanged\n      ? currentPaths\n      : currentPaths.filter(\n          (sourcePath) => cached.sourceHashes[sourcePath] !== currentHashes[sourcePath],\n        );\n\n  if (cached && changedPaths.length === 0) {\n    return {\n      map: cached.map,\n      stats: { readFiles: 0, reusedFiles: cached.map.modules.length, rebuilt: false },\n      source: \"cache\",\n    };\n  }\n\n  const updated = await updateArchitectureMap(\n    root,\n    currentPaths,\n    fileSetChanged ? null : (cached?.map ?? null),\n    changedPaths,\n  );\n  const next: ArchitectureCache = {\n    version: CACHE_VERSION,\n    generatedAt: manifest.generatedAt,\n    sourceHashes: currentHashes,\n    map: updated.map,\n  };\n  await assertNoSymlinkBetween(root, dirname(path));\n  await mkdir(dirname(path), { recursive: true, mode: 0o700 });\n  await writeAtomic(path, `${JSON.stringify(next, null, 2)}\\n`);\n  return { ...updated, source: fileSetChanged || !cached ? \"rebuild\" : \"incremental\" };\n}\n\nasync function readCache(path: string): Promise<ArchitectureCache | null> {\n  try {\n    const parsed = JSON.parse(await readFile(path, \"utf8\")) as ArchitectureCache;\n    if (parsed.version !== CACHE_VERSION || !parsed.map || !parsed.sourceHashes) return null;\n    if (!Array.isArray(parsed.map.modules) || !Array.isArray(parsed.map.edges)) return null;\n    if (\n      !parsed.map.modules.every(\n        (module) =>\n          module &&\n          typeof module.path === \"string\" &&\n          typeof module.language === \"string\" &&\n          Array.isArray(module.imports),\n      ) ||\n      !parsed.map.edges.every(\n        (edge) => edge && typeof edge.from === \"string\" && typeof edge.to === \"string\",\n      )\n    ) {\n      return null;\n    }\n    return parsed;\n  } catch {\n    return null;\n  }\n}\n\nfunction sourceHashes(manifest: IndexManifest): Record<string, string> {\n  return Object.fromEntries(\n    Object.values(manifest.entries)\n      .filter((entry) => SOURCE_EXTENSIONS.has(extname(entry.path).toLowerCase()))\n      .map((entry) => [entry.path, entry.hash]),\n  );\n}\n","import { mkdir, readFile } from \"node:fs/promises\";\nimport { dirname, join, resolve } from \"node:path\";\nimport { z } from \"zod\";\nimport { assertNoSymlinkBetween, writeAtomic } from \"../core/markdown-store-fs.js\";\nimport { INDEX_MANIFEST_VERSION, type IndexManifest } from \"./types.js\";\n\n/**\n * Persists the index manifest as a single JSON file under\n * `.codebuddy/cache/index.json`. `cache/` is gitignored by the project\n * scaffold, so the manifest is treated as a rebuildable derived artifact —\n * corrupt or version-mismatched manifests degrade to \"empty\" rather than\n * throwing, and a full `codebuddy index` regenerates them.\n */\n\nconst symbolSpanSchema = z.object({\n  name: z.string(),\n  kind: z.enum([\"function\", \"method\", \"class\", \"interface\", \"type\", \"enum\", \"const\", \"heading\"]),\n  startLine: z.number().int().nonnegative(),\n  endLine: z.number().int().nonnegative(),\n  signature: z.string(),\n  exported: z.boolean(),\n});\n\nconst entrySchema = z.object({\n  path: z.string(),\n  hash: z.string(),\n  size: z.number().int().nonnegative(),\n  mtimeMs: z.number().optional(),\n  ctimeMs: z.number().optional(),\n  language: z.string(),\n  lines: z.number().int().nonnegative(),\n  symbols: z.array(z.string()),\n  symbolTable: z.array(symbolSpanSchema).optional(),\n  summary: z.string(),\n  indexedAt: z.string(),\n});\n\nconst manifestSchema = z.object({\n  version: z.literal(INDEX_MANIFEST_VERSION),\n  generatedAt: z.string(),\n  entries: z.record(z.string(), entrySchema),\n});\n\nexport class IndexStore {\n  readonly repositoryRoot: string;\n  readonly cacheDirectory: string;\n  readonly manifestPath: string;\n\n  constructor(repositoryRoot = process.cwd()) {\n    this.repositoryRoot = resolve(repositoryRoot);\n    this.cacheDirectory = join(this.repositoryRoot, \".codebuddy\", \"cache\");\n    this.manifestPath = join(this.cacheDirectory, \"index.json\");\n  }\n\n  /** Read the manifest, or an empty one if absent/corrupt/version-mismatched. */\n  async read(): Promise<IndexManifest> {\n    try {\n      const raw = await readFile(this.manifestPath, \"utf8\");\n      const parsed = manifestSchema.safeParse(JSON.parse(raw));\n      if (!parsed.success) return emptyManifest();\n      // Zod's optional() widens to `| undefined`; the parse guarantees the shape.\n      return parsed.data as IndexManifest;\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === \"ENOENT\") return emptyManifest();\n      // Unreadable cache is non-fatal: rebuild from scratch.\n      return emptyManifest();\n    }\n  }\n\n  async write(manifest: IndexManifest): Promise<void> {\n    await assertNoSymlinkBetween(this.repositoryRoot, dirname(this.manifestPath));\n    await mkdir(this.cacheDirectory, { recursive: true, mode: 0o700 });\n    await writeAtomic(this.manifestPath, `${JSON.stringify(manifest, null, 2)}\\n`);\n  }\n}\n\nexport function emptyManifest(): IndexManifest {\n  return { version: INDEX_MANIFEST_VERSION, generatedAt: new Date(0).toISOString(), entries: {} };\n}\n","/**\n * Background index model (Proposal 04 Phase 04.3). The indexer builds a\n * deterministic, local-first picture of the repository — one content hash and\n * one lightweight summary per indexable file — so CodeBuddy knows something\n * useful before any memory is manually written. It is a derived *cache* under\n * `.codebuddy/cache/`, never a source of truth: deleting it and re-running\n * `codebuddy index` reproduces it exactly. No LLM is involved; summaries are\n * extracted with simple, stable heuristics.\n */\n\nimport type { SymbolSpan } from \"./symbols.js\";\n\n/** Bumped when symbol tables change shape (2: class methods; 3: Python, doc headings) so old caches rebuild. */\nexport const INDEX_MANIFEST_VERSION = 3 as const;\n\n/** One indexed file. Everything here is reproducible from the file contents. */\nexport type IndexEntry = {\n  /** Repo-relative POSIX path. */\n  path: string;\n  /** SHA-256 of the file contents; the authoritative change-detection signal. */\n  hash: string;\n  /** Byte size at index time. */\n  size: number;\n  /**\n   * File mtime/ctime observed when `hash` was taken. Recorded only once the file\n   * is older than the racy window, so a matching size+mtime+ctime is a reliable\n   * \"unchanged\" shortcut; when absent the file is re-hashed.\n   */\n  mtimeMs?: number;\n  ctimeMs?: number;\n  /** Coarse language tag derived from the extension (ts, js, md, py, …). */\n  language: string;\n  /** Line count (excluding a single trailing newline). */\n  lines: number;\n  /** Best-effort top-level/exported symbol names. Empty for non-code files. */\n  symbols: string[];\n  /**\n   * Optional richer symbol table (name/kind/range/signature) for code files —\n   * the basis for symbol-level context (Roadmap N.3). Absent for non-code files\n   * and older manifests, so consumers must treat it as optional.\n   */\n  symbolTable?: SymbolSpan[];\n  /** Deterministic one-line summary. */\n  summary: string;\n  /** ISO timestamp of when this entry was (re)computed. */\n  indexedAt: string;\n};\n\nexport type IndexManifest = {\n  version: typeof INDEX_MANIFEST_VERSION;\n  generatedAt: string;\n  /** Keyed by repo-relative POSIX path. */\n  entries: Record<string, IndexEntry>;\n};\n\nexport type IndexError = {\n  path: string;\n  error: string;\n};\n\n/** Outcome of one indexing pass. Counts are disjoint where noted. */\nexport type IndexResult = {\n  scanned: number;\n  added: number;\n  changed: number;\n  /** Unchanged files whose summary was reused (the incremental fast path). */\n  unchanged: number;\n  /** Entries dropped because the file no longer exists or is now ignored. */\n  removed: number;\n  /** Files skipped as too large or unreadable (isolated, non-fatal). */\n  skipped: number;\n  errors: IndexError[];\n  durationMs: number;\n  totalIndexed: number;\n  architecture: {\n    source: \"cache\" | \"incremental\" | \"rebuild\" | \"fallback\";\n    readFiles: number;\n    reusedFiles: number;\n  };\n};\n","import { spawn } from \"node:child_process\";\nimport { readdir } from \"node:fs/promises\";\nimport { extname, join, relative, sep } from \"node:path\";\nimport { SUPPORTED_EXTENSIONS } from \"./summary.js\";\n\n/**\n * Enumerate the repo-relative POSIX paths the indexer should consider.\n *\n * `.gitignore` respect is delegated to git itself: `git ls-files` lists tracked\n * plus untracked-but-not-ignored files, which is exactly the set a developer\n * expects to be \"in the project\". When the directory is not a git repository we\n * fall back to a plain walk with a conservative ignore list so indexing still\n * works on partially configured repos.\n *\n * CodeBuddy's own generated artifacts (`.codebuddy/`, `graphify-out/`) are\n * always excluded — the index does not index itself.\n */\n\nconst FALLBACK_IGNORED_DIRECTORIES = new Set([\n  \".git\",\n  \"node_modules\",\n  \"dist\",\n  \"build\",\n  \"coverage\",\n  \".codebuddy\",\n  \"graphify-out\",\n  \".next\",\n  \".turbo\",\n  \"out\",\n  \".venv\",\n  \"venv\",\n  \"__pycache__\",\n]);\n\nexport async function listIndexableFiles(repositoryRoot: string): Promise<string[]> {\n  const tracked = await gitListFiles(repositoryRoot);\n  const paths = tracked ?? (await walkFiles(repositoryRoot));\n  return paths\n    .map(normalize)\n    .filter((path) => !path.startsWith(\".codebuddy/\") && !path.startsWith(\"graphify-out/\"))\n    .filter((path) => SUPPORTED_EXTENSIONS.has(extname(path).toLowerCase()))\n    .sort();\n}\n\n/** Returns null when the directory is not a git repository. */\nasync function gitListFiles(repositoryRoot: string): Promise<string[] | null> {\n  // `-z`: NUL-separated and unquoted, so names with non-ASCII, quotes, tabs\n  // or newlines arrive verbatim instead of C-quoted.\n  const result = await runGit(repositoryRoot, [\n    \"ls-files\",\n    \"-z\",\n    \"--cached\",\n    \"--others\",\n    \"--exclude-standard\",\n  ]);\n  if (result.code !== 0) return null;\n  return result.stdout.split(\"\\0\").filter(Boolean);\n}\n\nasync function walkFiles(root: string): Promise<string[]> {\n  const files: string[] = [];\n  const walk = async (directory: string): Promise<void> => {\n    const entries = await readdir(directory, { withFileTypes: true });\n    for (const entry of entries) {\n      const absolute = join(directory, entry.name);\n      if (entry.isDirectory()) {\n        if (FALLBACK_IGNORED_DIRECTORIES.has(entry.name)) continue;\n        await walk(absolute);\n        continue;\n      }\n      if (entry.isFile()) files.push(relative(root, absolute));\n    }\n  };\n  await walk(root);\n  return files;\n}\n\nfunction runGit(\n  cwd: string,\n  args: string[],\n): Promise<{ code: number; stdout: string; stderr: string }> {\n  return new Promise((resolveResult) => {\n    const child = spawn(\"git\", args, { cwd, stdio: [\"ignore\", \"pipe\", \"pipe\"] });\n    let stdout = \"\";\n    let stderr = \"\";\n    // Decode as one stream so a multi-byte character split across chunks survives.\n    child.stdout.setEncoding(\"utf8\");\n    child.stdout.on(\"data\", (chunk) => {\n      stdout += String(chunk);\n    });\n    child.stderr.on(\"data\", (chunk) => {\n      stderr += String(chunk);\n    });\n    // A missing git binary should degrade to the walk fallback, not crash.\n    child.on(\"error\", () => resolveResult({ code: -1, stdout: \"\", stderr: \"git unavailable\" }));\n    child.on(\"close\", (code) => resolveResult({ code: code ?? 0, stdout, stderr }));\n  });\n}\n\n/** POSIX form; a backslash is a separator only on Windows, elsewhere part of the name. */\nfunction normalize(path: string): string {\n  return (sep === \"\\\\\" ? path.replace(/\\\\/g, \"/\") : path).replace(/^\\.\\//, \"\");\n}\n","import { extname } from \"node:path\";\nimport { extractSymbolTable } from \"./symbols.js\";\n\n/**\n * Deterministic file summarization. No LLM, no network — the same file always\n * produces the same summary, which keeps the index stable across runs and easy\n * to diff. Symbol extraction is intentionally best-effort regex over source\n * text: good enough to orient an agent, cheap enough to run on every save.\n */\n\nconst LANGUAGE_BY_EXTENSION: Record<string, string> = {\n  \".ts\": \"ts\",\n  \".tsx\": \"tsx\",\n  \".js\": \"js\",\n  \".jsx\": \"jsx\",\n  \".mjs\": \"js\",\n  \".cjs\": \"js\",\n  \".json\": \"json\",\n  \".md\": \"md\",\n  \".mdx\": \"md\",\n  \".rst\": \"rst\",\n  \".yaml\": \"yaml\",\n  \".yml\": \"yaml\",\n  \".toml\": \"toml\",\n  \".css\": \"css\",\n  \".scss\": \"scss\",\n  \".html\": \"html\",\n  \".py\": \"py\",\n  \".go\": \"go\",\n  \".rs\": \"rust\",\n  \".java\": \"java\",\n  \".rb\": \"ruby\",\n  \".php\": \"php\",\n  \".sh\": \"shell\",\n  \".sql\": \"sql\",\n  \".txt\": \"text\",\n};\n\n/** Extensions the indexer will read and summarize. */\nexport const SUPPORTED_EXTENSIONS = new Set(Object.keys(LANGUAGE_BY_EXTENSION));\n\nconst CODE_LANGUAGES = new Set([\"ts\", \"tsx\", \"js\", \"jsx\"]);\nconst SYMBOL_LIMIT = 8;\nconst SUMMARY_COMMENT_MAX = 80;\n\nexport function languageFor(path: string): string {\n  return LANGUAGE_BY_EXTENSION[extname(path).toLowerCase()] ?? \"text\";\n}\n\nexport type FileSummary = {\n  language: string;\n  lines: number;\n  symbols: string[];\n  summary: string;\n};\n\nexport function summarizeSource(path: string, content: string): FileSummary {\n  const language = languageFor(path);\n  const lines = countLines(content);\n  const symbols = CODE_LANGUAGES.has(language)\n    ? extractSymbols(content)\n    : language === \"py\"\n      ? pythonPublicNames(content)\n      : [];\n  const summary = composeSummary(language, lines, symbols, content);\n  return { language, lines, symbols, summary };\n}\n\nfunction countLines(content: string): number {\n  if (content.length === 0) return 0;\n  return content.replace(/\\r/g, \"\").replace(/\\n$/, \"\").split(\"\\n\").length;\n}\n\n/**\n * Pull exported/top-level symbol names from JS/TS source. Covers the common\n * `export <kind> Name` forms, `export default function Name`, and named\n * re-export braces. Order-preserving and de-duplicated.\n */\nexport function extractSymbols(content: string): string[] {\n  const names: string[] = [];\n  const push = (name: string | undefined) => {\n    const trimmed = name?.trim();\n    if (trimmed && /^[A-Za-z_$][\\w$]*$/.test(trimmed) && !names.includes(trimmed)) {\n      names.push(trimmed);\n    }\n  };\n\n  const declaration =\n    /^export\\s+(?:default\\s+)?(?:async\\s+)?(?:abstract\\s+)?(?:const|let|var|function|class|interface|type|enum)\\s+([A-Za-z_$][\\w$]*)/gm;\n  for (const match of content.matchAll(declaration)) push(match[1]);\n\n  const namedExports = /^export\\s*\\{([^}]*)\\}/gm;\n  for (const match of content.matchAll(namedExports)) {\n    for (const part of (match[1] ?? \"\").split(\",\")) {\n      // Handle `foo as bar` — record the exported name (`bar`).\n      const alias = part.includes(\" as \") ? part.split(\" as \").pop() : part;\n      push(alias);\n    }\n  }\n\n  return names.slice(0, SYMBOL_LIMIT);\n}\n\n/** Public (no leading underscore) top-level Python names, in file order. */\nfunction pythonPublicNames(content: string): string[] {\n  return extractSymbolTable(content, \"x.py\")\n    .filter((symbol) => symbol.exported && symbol.kind !== \"method\")\n    .map((symbol) => symbol.name)\n    .slice(0, SYMBOL_LIMIT);\n}\n\nfunction composeSummary(\n  language: string,\n  lines: number,\n  symbols: string[],\n  content: string,\n): string {\n  const head = `${language} • ${lines} line${lines === 1 ? \"\" : \"s\"}`;\n  if (symbols.length > 0) return `${head} • exports ${symbols.join(\", \")}`;\n  const comment = leadingComment(content);\n  if (comment) return `${head} • ${comment}`;\n  return head;\n}\n\n/** First meaningful line of a leading comment block, if any. */\nfunction leadingComment(content: string): string | null {\n  for (const raw of content.split(/\\r?\\n/)) {\n    const line = raw.trim();\n    if (line === \"\") continue;\n    const stripped = line\n      .replace(/^\\/\\/+/, \"\")\n      .replace(/^\\/\\*+/, \"\")\n      .replace(/\\*+\\/$/, \"\")\n      .replace(/^[#*]+/, \"\")\n      .trim();\n    if (\n      line.startsWith(\"//\") ||\n      line.startsWith(\"/*\") ||\n      line.startsWith(\"#\") ||\n      line.startsWith(\"*\")\n    ) {\n      if (stripped) return truncate(stripped, SUMMARY_COMMENT_MAX);\n      continue;\n    }\n    // First non-blank line is not a comment: nothing to summarize.\n    return null;\n  }\n  return null;\n}\n\nfunction truncate(value: string, max: number): string {\n  return value.length <= max ? value : `${value.slice(0, max - 1)}…`;\n}\n","import { execFile } from \"node:child_process\";\nimport { mkdir, mkdtemp, readFile, rm, stat, utimes } from \"node:fs/promises\";\nimport { tmpdir } from \"node:os\";\nimport { dirname, join, relative, resolve, sep } from \"node:path\";\nimport { promisify } from \"node:util\";\nimport { writeAtomic } from \"../core/markdown-store-fs.js\";\nimport { loadFreshIndex } from \"../indexer/engine.js\";\nimport { writeGraphSourceSnapshot } from \"../map/graph-freshness.js\";\n\nconst execFileAsync = promisify(execFile);\n\nexport type GraphifyCommandRunner = (\n  command: string,\n  args: string[],\n  cwd: string,\n) => Promise<{ stdout: string; stderr: string }>;\n\nexport type GraphifySetupOptions = {\n  repositoryRoot: string;\n  run?: GraphifyCommandRunner;\n};\n\nexport type GraphifySetupResult = {\n  available: boolean;\n  installed: boolean;\n  generated: boolean;\n  graphPath: string;\n  message: string;\n};\n\nexport type GenerateGraphifyOptions = {\n  repositoryRoot: string;\n  graphPath?: string;\n  run?: GraphifyCommandRunner;\n};\n\nexport type GenerateGraphifyResult = {\n  graphPath: string;\n  generated: boolean;\n  nodes: number;\n  edges: number;\n};\n\nconst DEFAULT_GRAPH_PATH = \"graphify-out/graph.json\";\n\n/** Detect, install, and register Graphify without making it a CodeBuddy dependency. */\nexport async function setupGraphify(options: GraphifySetupOptions): Promise<GraphifySetupResult> {\n  const run = options.run ?? runCommand;\n  let available = await commandWorks(run, \"graphify\", [\"--version\"], options.repositoryRoot);\n  let installed = false;\n\n  if (!available) {\n    const installers = [\n      [\"uv\", [\"tool\", \"install\", \"graphifyy\"]],\n      [\"pipx\", [\"install\", \"graphifyy\"]],\n      [\"python\", [\"-m\", \"pip\", \"install\", \"--user\", \"graphifyy\"]],\n    ] as const;\n    for (const [command, args] of installers) {\n      try {\n        await run(command, [...args], options.repositoryRoot);\n        available = await commandWorks(run, \"graphify\", [\"--version\"], options.repositoryRoot);\n        if (available) {\n          installed = true;\n          break;\n        }\n      } catch {\n        // Try the next supported local installer.\n      }\n    }\n  }\n\n  if (!available) {\n    return {\n      available: false,\n      installed,\n      generated: false,\n      graphPath: DEFAULT_GRAPH_PATH,\n      message:\n        \"Graphify was selected but is not available. Install graphifyy with uv/pipx, then run `codebuddy graphify index`.\",\n    };\n  }\n\n  try {\n    await run(\"graphify\", [\"install\"], options.repositoryRoot).catch(() => undefined);\n    const graph = await generateGraphifyGraph({ repositoryRoot: options.repositoryRoot, run });\n    return {\n      available: true,\n      installed,\n      generated: true,\n      graphPath: graph.graphPath,\n      message: `Graphify graph generated (${graph.nodes} nodes, ${graph.edges} edges).`,\n    };\n  } catch (error) {\n    return {\n      available: true,\n      installed,\n      generated: false,\n      graphPath: DEFAULT_GRAPH_PATH,\n      message: `Graphify is installed but its graph could not be generated: ${(error as Error).message}`,\n    };\n  }\n}\n\nasync function commandWorks(\n  run: GraphifyCommandRunner,\n  command: string,\n  args: string[],\n  cwd: string,\n): Promise<boolean> {\n  try {\n    await run(command, args, cwd);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nasync function runCommand(\n  command: string,\n  args: string[],\n  cwd: string,\n): Promise<{ stdout: string; stderr: string }> {\n  return execFileAsync(command, args, { cwd });\n}\n\nexport async function graphifyGraphExists(\n  repositoryRoot: string,\n  graphPath = DEFAULT_GRAPH_PATH,\n): Promise<boolean> {\n  try {\n    const parsed = await readGraphFile(resolveGraphPath(repositoryRoot, graphPath));\n    return parsed.nodes > 0;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Build a graph with Graphify itself. Staging is used for first builds and\n * invalid graphs so a failed extractor can never replace a usable graph.\n */\nexport async function generateGraphifyGraph(\n  options: GenerateGraphifyOptions,\n): Promise<GenerateGraphifyResult> {\n  const run = options.run ?? runCommand;\n  const repositoryRoot = resolve(options.repositoryRoot);\n  const graphPath = options.graphPath ?? DEFAULT_GRAPH_PATH;\n  const destination = resolveGraphPath(repositoryRoot, graphPath);\n  await mkdir(dirname(destination), { recursive: true });\n  await ignoreGeneratedGraphDirectory(dirname(destination));\n\n  const { manifest: sourceSnapshot } = await loadFreshIndex(repositoryRoot);\n  const current = await readGraphFileIfPresent(destination);\n  const isDefaultPath = graphPath === DEFAULT_GRAPH_PATH;\n  if (current && isDefaultPath) {\n    const backup = await readFile(destination, \"utf8\");\n    const backupStat = await stat(destination);\n    try {\n      await run(\"graphify\", [\"update\", repositoryRoot, \"--force\", \"--no-cluster\"], repositoryRoot);\n      const updated = await readGraphFile(destination);\n      await writeGraphSourceSnapshot(destination, sourceSnapshot);\n      return { graphPath, generated: true, ...updated };\n    } catch (error) {\n      await writeAtomic(destination, backup);\n      await utimes(destination, backupStat.atime, backupStat.mtime);\n      throw new Error(\n        `Graphify update failed; the previous graph was preserved: ${(error as Error).message}`,\n      );\n    }\n  }\n\n  const stagingRoot = await mkdtemp(join(tmpdir(), \"codebuddy-graphify-\"));\n  try {\n    await run(\n      \"graphify\",\n      [\"extract\", repositoryRoot, \"--out\", stagingRoot, \"--code-only\", \"--no-cluster\"],\n      repositoryRoot,\n    );\n    const stagedPath = join(stagingRoot, DEFAULT_GRAPH_PATH);\n    const staged = await readGraphFile(stagedPath);\n    await writeAtomic(destination, await readFile(stagedPath, \"utf8\"));\n    await writeGraphSourceSnapshot(destination, sourceSnapshot);\n    return { graphPath, generated: true, ...staged };\n  } finally {\n    await rm(stagingRoot, { recursive: true, force: true });\n  }\n}\n\n/**\n * The graph directory is derived output CodeBuddy writes itself, so it is\n * self-ignoring like `.codebuddy/`. An existing .gitignore is never rewritten:\n * a project that deliberately commits its graph keeps doing so.\n */\nasync function ignoreGeneratedGraphDirectory(directory: string): Promise<void> {\n  const path = join(directory, \".gitignore\");\n  try {\n    await stat(path);\n  } catch {\n    await writeAtomic(path, \"# CodeBuddy-generated Graphify output (derived, rebuildable)\\n*\\n\");\n  }\n}\n\nfunction resolveGraphPath(repositoryRoot: string, graphPath: string): string {\n  const absolute = resolve(repositoryRoot, graphPath);\n  const relativePath = relative(repositoryRoot, absolute);\n  if (relativePath === \"\" || relativePath === \"..\" || relativePath.startsWith(`..${sep}`)) {\n    throw new Error(`Graph path must be inside the project root: ${graphPath}`);\n  }\n  return absolute;\n}\n\nasync function readGraphFileIfPresent(\n  path: string,\n): Promise<{ nodes: number; edges: number } | null> {\n  try {\n    return await readGraphFile(path);\n  } catch {\n    return null;\n  }\n}\n\nasync function readGraphFile(path: string): Promise<{ nodes: number; edges: number }> {\n  const info = await stat(path);\n  if (!info.isFile() || info.size === 0)\n    throw new Error(`Graphify graph is missing or empty: ${path}`);\n  const raw = JSON.parse(await readFile(path, \"utf8\")) as Record<string, unknown>;\n  const nodes = arrayLength(raw.nodes ?? raw.entities);\n  const edges = arrayLength(raw.edges ?? raw.links ?? raw.relationships);\n  if (nodes === 0) throw new Error(`Graphify graph contains no nodes: ${path}`);\n  return { nodes, edges };\n}\n\nfunction arrayLength(value: unknown): number {\n  return Array.isArray(value) ? value.length : 0;\n}\n","import { createHash } from \"node:crypto\";\nimport { readFile } from \"node:fs/promises\";\nimport { writeAtomic } from \"../core/markdown-store-fs.js\";\nimport type { IndexManifest } from \"../indexer/types.js\";\n\nconst digest = (value: string) => createHash(\"sha256\").update(value).digest(\"hex\");\n\n/** Record the source snapshot from BEFORE extraction, so edits during extraction fail closed. */\nexport async function writeGraphSourceSnapshot(\n  path: string,\n  manifest: IndexManifest,\n): Promise<void> {\n  await writeAtomic(\n    `${path}.sources.json`,\n    JSON.stringify({\n      version: 1,\n      graphHash: digest(await readFile(path, \"utf8\")),\n      sources: Object.fromEntries(\n        Object.values(manifest.entries).map((entry) => [entry.path, entry.hash]),\n      ),\n    }),\n  );\n}\n\n/** Missing = legacy graph. Invalid/mismatched = trust no endpoints until rebuilt. */\nexport async function readGraphSourceSnapshot(\n  path: string,\n): Promise<Record<string, string> | null> {\n  let raw: string;\n  try {\n    raw = await readFile(`${path}.sources.json`, \"utf8\");\n  } catch (error) {\n    return (error as NodeJS.ErrnoException).code === \"ENOENT\" ? null : {};\n  }\n  try {\n    const snapshot = JSON.parse(raw);\n    if (\n      snapshot.version !== 1 ||\n      snapshot.graphHash !== digest(await readFile(path, \"utf8\")) ||\n      !snapshot.sources ||\n      typeof snapshot.sources !== \"object\" ||\n      Array.isArray(snapshot.sources)\n    )\n      return {};\n    return Object.fromEntries(\n      Object.entries(snapshot.sources).filter(\n        (entry): entry is [string, string] => typeof entry[1] === \"string\",\n      ),\n    );\n  } catch {\n    return {};\n  }\n}\n","import { mkdir, readFile } from \"node:fs/promises\";\nimport { dirname, join } from \"node:path\";\nimport { writeAtomic } from \"../core/markdown-store-fs.js\";\nimport { loadFreshIndex } from \"../indexer/engine.js\";\nimport type { IndexManifest } from \"../indexer/types.js\";\nimport { LOCAL_EMBEDDING_MODEL } from \"../providers/models.js\";\nimport { NON_SOURCE_PATH, readBoundedSource, TEST_PATH } from \"./discovery.js\";\n\n/**\n * Dense file vectors for task → file ordering: the local embedder (granite)\n * over 40-line chunks of each source file, cached by content hash in\n * `.codebuddy/cache/file-vectors.json` (gitignored, rebuildable).\n *\n * Built only in the background (`hooks sync`, `codebuddy index`), never while\n * a prompt waits; a prompt only embeds its own text. Keyword evidence decides\n * whether a task concerns this repository at all, vectors then pick the\n * files: on their own they cannot tell an unrelated task (best chunk ≤ 0.81\n * on the labelled sets) from a reworded related one (as low as 0.79), but for\n * admitted tasks they find the right files more often than keywords. Measured with granite: on dsicord-bot's 40\n * labelled tasks top-1 went from 45% to 55% and top-3 from 60% to 71%; on\n * evals/task-savings.json retrieval recall from 0.741 to 0.815, with every\n * unrelated task still silent. A prompt pays ~170 ms to load the model when\n * nothing else in the hook loaded it (a project with no stored facts).\n */\n\ntype FileVectors = { hash: string; vectors: string[] };\ntype Store = { version: 1; model: string; files: Record<string, FileVectors> };\n\nconst CHUNK_LINES = 40;\nconst CHUNK_STEP = 30;\nconst CHUNK_CHARS = 2_000;\nconst BATCH = 16;\nconst MODEL = `${LOCAL_EMBEDDING_MODEL.id}@${LOCAL_EMBEDDING_MODEL.revision}`;\n\nexport type FileVectorRefresh = { embedded: number; files: number; pending: number };\n/** Texts in, L2-normalized vectors out (tests pass a stub; default: the local model). */\nexport type Embed = (texts: string[]) => Promise<number[][]>;\n\nasync function localEmbed(texts: string[]): Promise<number[][]> {\n  const { LocalModelProvider } = await import(\"../providers/local.js\");\n  return (await new LocalModelProvider().embed({ input: texts })).vectors;\n}\n\n/**\n * Embed the chunks of every source file whose hash changed since the last\n * run, until `deadlineAt`; what is left waits for the next run. Saves after\n * each batch group so an interrupted run keeps its work.\n */\nexport async function refreshFileVectors(\n  repositoryRoot: string,\n  manifest: IndexManifest,\n  deadlineAt: number,\n  embed: Embed = localEmbed,\n): Promise<FileVectorRefresh> {\n  const store = await loadStore(repositoryRoot);\n  const eligible = eligiblePaths(manifest);\n  const files: Record<string, FileVectors> = {};\n  const todo: string[] = [];\n  for (const path of eligible) {\n    const cached = store.files[path];\n    if (cached && cached.hash === manifest.entries[path]?.hash) files[path] = cached;\n    else todo.push(path);\n  }\n  let embedded = 0;\n  let lastSave = Date.now();\n  for (const path of todo) {\n    if (Date.now() >= deadlineAt) break;\n    const source = await readBoundedSource(repositoryRoot, path);\n    if (source === null) continue;\n    const vectors: string[] = [];\n    const chunks = chunk(path, source);\n    for (let start = 0; start < chunks.length; start += BATCH) {\n      for (const vector of await embed(chunks.slice(start, start + BATCH))) {\n        vectors.push(encode(vector));\n      }\n    }\n    files[path] = { hash: manifest.entries[path]?.hash ?? \"\", vectors };\n    embedded += 1;\n    if (Date.now() - lastSave > 30_000) {\n      await saveStore(repositoryRoot, { version: 1, model: MODEL, files });\n      lastSave = Date.now();\n    }\n  }\n  await saveStore(repositoryRoot, { version: 1, model: MODEL, files });\n  return {\n    embedded,\n    files: Object.keys(files).length,\n    pending: eligible.length - Object.keys(files).length,\n  };\n}\n\n/** Refresh the index, then the vectors of what changed. Null when the embedder cannot load. */\nexport async function syncFileVectors(\n  repositoryRoot: string,\n  budgetMs: number,\n): Promise<FileVectorRefresh | null> {\n  const started = Date.now();\n  try {\n    const { manifest } = await loadFreshIndex(repositoryRoot);\n    return await refreshFileVectors(repositoryRoot, manifest, started + budgetMs);\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Indexed source files by their best chunk's cosine to the task, best first.\n * Null when there are no vectors (never built, another model, semantic off)\n * or the embedder cannot load: callers keep the keyword order.\n */\nexport async function rankFilesByVector(\n  repositoryRoot: string,\n  manifest: IndexManifest,\n  task: string,\n  embed: Embed = localEmbed,\n): Promise<Array<{ path: string; score: number }> | null> {\n  if (process.env.CODEBUDDY_SEMANTIC === \"0\") return null;\n  const store = await loadStore(repositoryRoot);\n  const current = eligiblePaths(manifest).filter(\n    (path) => store.files[path]?.hash === manifest.entries[path]?.hash,\n  );\n  if (current.length === 0) return null;\n  let query: number[];\n  try {\n    const [vector] = await embed([task]);\n    if (!vector) return null;\n    query = vector;\n  } catch {\n    return null;\n  }\n  return current\n    .map((path) => ({\n      path,\n      score: Math.max(...(store.files[path]?.vectors ?? []).map((v) => dot(decode(v), query))),\n    }))\n    .sort((left, right) => right.score - left.score || left.path.localeCompare(right.path));\n}\n\nfunction eligiblePaths(manifest: IndexManifest): string[] {\n  return Object.keys(manifest.entries).filter(\n    (path) => !NON_SOURCE_PATH.test(path) && !TEST_PATH.test(path),\n  );\n}\n\n/** The path heads every chunk, so a file's name counts toward each of its passages. */\nfunction chunk(path: string, source: string): string[] {\n  const lines = source.split(\"\\n\");\n  const chunks: string[] = [];\n  for (let start = 0; start === 0 || start + 10 < lines.length; start += CHUNK_STEP) {\n    // Capped: one minified or data line would otherwise make the whole batch's\n    // attention tensor too large for ONNX Runtime.\n    chunks.push(\n      `${path}\\n${lines.slice(start, start + CHUNK_LINES).join(\"\\n\")}`.slice(0, CHUNK_CHARS),\n    );\n  }\n  return chunks;\n}\n\nfunction encode(vector: number[]): string {\n  return Buffer.from(Float32Array.from(vector).buffer).toString(\"base64\");\n}\n\nfunction decode(text: string): Float32Array {\n  const bytes = Buffer.from(text, \"base64\");\n  return new Float32Array(bytes.buffer, bytes.byteOffset, bytes.byteLength / 4);\n}\n\nfunction dot(left: Float32Array, right: number[]): number {\n  let sum = 0;\n  for (let index = 0; index < right.length; index++)\n    sum += (left[index] ?? 0) * (right[index] ?? 0);\n  return sum;\n}\n\nfunction storePath(repositoryRoot: string): string {\n  return join(repositoryRoot, \".codebuddy\", \"cache\", \"file-vectors.json\");\n}\n\nasync function loadStore(repositoryRoot: string): Promise<Store> {\n  try {\n    const parsed = JSON.parse(await readFile(storePath(repositoryRoot), \"utf8\")) as Store;\n    if (parsed.version === 1 && parsed.model === MODEL && parsed.files) return parsed;\n  } catch {\n    // Missing or corrupt: nothing to rank by until the next refresh.\n  }\n  return { version: 1, model: MODEL, files: {} };\n}\n\nasync function saveStore(repositoryRoot: string, store: Store): Promise<void> {\n  const path = storePath(repositoryRoot);\n  await mkdir(dirname(path), { recursive: true });\n  await writeAtomic(path, JSON.stringify(store));\n}\n","import { readFile, realpath, stat } from \"node:fs/promises\";\nimport { isAbsolute, join, relative } from \"node:path\";\nimport { readConfigFile } from \"../core/config-file.js\";\nimport { isCredentialPath } from \"../core/sensitive.js\";\nimport type { IndexManifest } from \"../indexer/types.js\";\nimport { graphifyGraphExists } from \"../integrations/graphify.js\";\nimport { loadArchitectureMap } from \"../map/cache.js\";\nimport { readGraphSourceSnapshot } from \"../map/graph-freshness.js\";\nimport { loadGraphifyMap } from \"../map/graphify.js\";\nimport type { ArchitectureMap } from \"../map/types.js\";\nimport type { RetrievalHit, ZvecCandidates } from \"../retrieval/zvec.js\";\nimport { extractTaskAnchors } from \"./anchors.js\";\nimport { idfCoverage, rankContent } from \"./content-index.js\";\nimport { rankFilesByVector } from \"./file-vectors.js\";\n\n/**\n * Task-path discovery: rank indexed files against a natural-language task,\n * with calibrated abstention. Kept apart from the context engine so the lean\n * hook can use it without loading plan, risk, worklog or memory code.\n */\n\n/** Most files the engine describes (symbols, excerpts) for one request. */\nexport const TASK_PATH_LIMIT = 10;\n/** Task-discovered targets: a wrong file costs the agent a read, a missing one costs nothing. */\nconst TASK_FILES = 3;\n/** Multi-file expansion: neighbours of the top `seeds` targets, at most `files`. */\nconst EXPANSION = { seeds: 2, files: 1 } as const;\n\nconst MAX_EVIDENCE_BYTES = 512_000;\n\n/** Current file text, or null when it is missing, oversized, or binary. */\nexport async function readBoundedSource(\n  repositoryRoot: string,\n  path: string,\n): Promise<string | null> {\n  // Credential files are never read as evidence: not ranked, indexed or shown.\n  if (isCredentialPath(path)) return null;\n  try {\n    const absolute = join(repositoryRoot, path);\n    if ((await stat(absolute)).size > MAX_EVIDENCE_BYTES) return null;\n    const source = await readFile(absolute, \"utf8\");\n    return source.includes(\"\\0\") ? null : source;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Rank cached file summaries for a task when the agent has not named files.\n * Explicit anchors in the task (paths, `path:line`, stack frames, quoted\n * error strings) come first; ranking fills the remaining slots.\n */\nexport async function discoverTaskPaths(\n  repositoryRoot: string,\n  task: string,\n  manifest: IndexManifest,\n  mapSource: Promise<ArchitectureMap>,\n  options: DiscoveryOptions = {},\n): Promise<DiscoveredPaths> {\n  task = stripIssueTemplate(task);\n  const anchors = await extractTaskAnchors(\n    repositoryRoot,\n    task,\n    new Set(Object.keys(manifest.entries)),\n  );\n  if (anchors.length === 0)\n    return rankTaskFiles(repositoryRoot, task, manifest, mapSource, options);\n  const anchored = anchors.map((anchor) => anchor.path);\n  const hits: RetrievalHit[] = anchors.flatMap((anchor) =>\n    anchor.line === null\n      ? []\n      : [\n          {\n            path: anchor.path,\n            startLine: anchor.line,\n            endLine: anchor.line,\n            rank: 0,\n            source: \"anchor\" as const,\n            freshness: \"unverified\" as const,\n          },\n        ],\n  );\n  const explain = `retrieval: anchors (${anchors\n    .map(\n      (anchor) => `${anchor.kind} ${anchor.path}${anchor.line === null ? \"\" : `:${anchor.line}`}`,\n    )\n    .join(\", \")})`;\n  if (anchored.length >= TASK_FILES) return { paths: anchored, hits, explain: [explain] };\n  const ranked = await rankTaskFiles(repositoryRoot, task, manifest, mapSource, options);\n  return {\n    ...(ranked.symbols ? { symbols: ranked.symbols } : {}),\n    paths: [...anchored, ...ranked.paths.filter((path) => !anchored.includes(path))].slice(\n      0,\n      TASK_FILES,\n    ),\n    hits: [...hits, ...ranked.hits.filter((hit) => !anchored.includes(hit.path))],\n    explain: [explain, ...ranked.explain],\n  };\n}\n\n/**\n * Index entries with their BYOK model summaries attached as `llmText` (when\n * the layer and its summaries feature are on). Loaded on demand so a repo\n * without the layer never imports it.\n */\nasync function withLlmSummaries(\n  repositoryRoot: string,\n  manifest: IndexManifest,\n): Promise<Array<IndexManifest[\"entries\"][string] & { llmText?: string }>> {\n  const entries = Object.values(manifest.entries);\n  try {\n    const { resolveLlmConfig } = await import(\"../llm/config.js\");\n    const config = await resolveLlmConfig(repositoryRoot);\n    if (!config.enabled || !config.features.summaries) return entries;\n    const { loadLlmSummaries } = await import(\"../llm/summaries.js\");\n    const summaries = await loadLlmSummaries(repositoryRoot, manifest);\n    if (summaries.size === 0) return entries;\n    return entries.map((entry) => {\n      const summary = summaries.get(entry.path);\n      return summary\n        ? { ...entry, llmText: `${summary.summary} ${Object.values(summary.symbols).join(\" \")}` }\n        : entry;\n    });\n  } catch {\n    return entries;\n  }\n}\n\nexport type DiscoveryOptions = {\n  semantic?: boolean;\n  /**\n   * Epoch ms by which the BYOK rerank must have answered (the caller's hook\n   * budget). The call gets min(configured timeout, time left) measured right\n   * before it is made; under 200 ms left it is skipped. Default: no deadline\n   * beyond the configured timeout.\n   */\n  llmDeadlineAt?: number;\n  /**\n   * With `semantic: false`, still ask zvec-grep (when enabled) but only while a\n   * `zg server` is running, every zg call killed at this epoch ms. Lets the lean\n   * hook use zvec without the local embedding model or an unbounded probe.\n   */\n  zvecDeadlineAt?: number;\n};\n\nexport type DiscoveredPaths = {\n  paths: string[];\n  hits: RetrievalHit[];\n  explain: string[];\n  /** Symbols the BYOK rerank named per file, validated against the symbol table. */\n  symbols?: Record<string, string[]>;\n};\n\nasync function rankTaskFiles(\n  repositoryRoot: string,\n  task: string,\n  manifest: IndexManifest,\n  mapSource: Promise<ArchitectureMap>,\n  options: DiscoveryOptions,\n): Promise<DiscoveredPaths> {\n  // Changelogs restate every feature's wording; they are never a task's target\n  // unless the task is about the changelog itself.\n  const wantsChangelog = asksForChangelog(task);\n  const entries = (await withLlmSummaries(repositoryRoot, manifest)).filter(\n    (entry) => wantsChangelog || !CHANGELOG_PATH.test(entry.path),\n  );\n  const wantsTests = /\\b(tests?|spec)\\b/i.test(task);\n  // An exact code identifier names its file better than any embedding: route\n  // it lexically to the declaring files and skip vector noise.\n  const identifiers = identifierTokens(task).filter(\n    (token) => CODE_IDENTIFIER.test(token) && !ABBREVIATION.test(token),\n  );\n  if (identifiers.length > 0) {\n    // Files declaring more of the named identifiers first. Docs/examples only\n    // for a docs task; exception modules never: a report names the error it\n    // hit, and the fix is where it is raised, not where it is declared.\n    const exact = entries\n      .filter(\n        (entry) =>\n          (wantsTests || !TEST_PATH.test(entry.path)) &&\n          countsAsSource(entry.path, task) &&\n          !EXCEPTION_MODULE.test(entry.path),\n      )\n      .map((entry) => ({\n        path: entry.path,\n        named: new Set(\n          (entry.symbolTable ?? []).flatMap((symbol) =>\n            // A doc heading naming an identifier is not its declaration.\n            symbol.kind === \"heading\"\n              ? []\n              : symbol.name.split(\".\").filter((segment) => identifiers.includes(segment)),\n          ),\n        ).size,\n      }))\n      .filter((entry) => entry.named > 0)\n      .sort((left, right) => right.named - left.named || left.path.localeCompare(right.path))\n      .map((entry) => entry.path);\n    if (exact.length > 0) {\n      const evidence = new Map(\n        scoreTaskPaths(entries, task)\n          .filter((entry) => entry.score > 0)\n          .map((entry) => [entry.path, entry.score]),\n      );\n      const expansion = expandAlongImports(exact, await mapSource, evidence, task, {\n        allowGraphOnly: true,\n      });\n      return {\n        paths: expansion.paths.slice(0, TASK_FILES),\n        hits: [],\n        explain: [\n          `retrieval: exact-symbol routing (${identifiers.slice(0, 5).join(\", \")})`,\n          ...(expansion.explain ? [expansion.explain] : []),\n        ],\n      };\n    }\n  }\n  // A named CLI command (`<bin> <command>`) routes to its command module,\n  // ahead of keyword ranking; the logic it calls still comes from keywords.\n  const commands = await commandFiles(repositoryRoot, task, entries);\n  const scored = scoreTaskPaths(entries, task);\n  const summaryKeyword = scored\n    .filter((entry) => entry.score >= EVIDENCE_FLOOR.keywordScore)\n    .map((entry) => entry.path);\n  // Full-text evidence (words inside function bodies): already gated, so it\n  // admits files the summary floor misses and votes in the order of both.\n  const { matches: content, idf } = await rankContent(\n    repositoryRoot,\n    manifest,\n    taskTerms(task),\n    wantsTests,\n    DOCS_TASK.test(task),\n    wantsChangelog,\n  );\n  const keyword =\n    content.length > 0\n      ? fuseRankings([summaryKeyword, content.map((match) => match.path)])\n      : summaryKeyword;\n  const weakKeyword = scored.length - keyword.length;\n  // Loaded on demand so callers that opt out (the lean hook) never import it.\n  const semantic: ZvecCandidates =\n    options.semantic === false && options.zvecDeadlineAt === undefined\n      ? {\n          status: \"disabled\",\n          paths: [],\n          hits: [],\n          reason: \"semantic retrieval off\",\n          stale: 0,\n          changed: 0,\n        }\n      : await import(\"../retrieval/zvec.js\")\n          .then(({ zvecCandidates }) =>\n            zvecCandidates(\n              repositoryRoot,\n              task,\n              options.semantic === false && options.zvecDeadlineAt !== undefined\n                ? { deadlineAt: options.zvecDeadlineAt, requireServer: true }\n                : {},\n            ),\n          )\n          .catch(\n            (): ZvecCandidates => ({\n              status: \"failed\",\n              paths: [],\n              hits: [],\n              reason: \"zvec-grep failed\",\n              stale: 0,\n              changed: 0,\n            }),\n          );\n  // Lexical evidence for expansion: any task term, even below the floor.\n  const evidence = new Map(\n    scored.filter((entry) => entry.score > 0).map((entry) => [entry.path, entry.score]),\n  );\n  let ranked = keyword;\n  let hits: RetrievalHit[] = [];\n  const explain: string[] = [];\n  if (semantic.status !== \"disabled\" && semantic.paths.length === 0) {\n    explain.push(`retrieval: keyword ranking only (${semantic.reason})`);\n  } else if (semantic.status !== \"disabled\") {\n    // Keep zvec hits consistent with keyword rules: no tests unless asked for.\n    // zg 0.2.x reports a rank, not a calibrated score, so a vector hit below the\n    // keyword floor must share enough task terms with its current source.\n    const terms = taskTerms(task);\n    const vector: string[] = [];\n    const partial: string[] = [];\n    let uncorroborated = 0;\n    let belowFloor = 0;\n    // zg's own score is rank-derived (RRF), not a similarity, so the floor is on\n    // the hit's current source: the content gate's task IDF coverage.\n    const minScore = semantic.minScore ?? 0;\n    for (const path of semantic.paths) {\n      if (!wantsTests && TEST_PATH.test(path)) continue;\n      if (!wantsChangelog && CHANGELOG_PATH.test(path)) continue;\n      if (keyword.includes(path)) vector.push(path);\n      else if (\n        await hasMatchedPassageEvidence(\n          repositoryRoot,\n          path,\n          semantic.hits,\n          terms,\n          manifest.entries[path]?.symbolTable ?? [],\n        )\n      ) {\n        const source = (await readBoundedSource(repositoryRoot, path)) ?? \"\";\n        // The path counts too, as it does in the BM25 counts the IDF table comes from.\n        if (idfCoverage(`${path} ${source}`, terms, idf) < minScore) {\n          belowFloor++;\n          continue;\n        }\n        if (countTerms(source, terms) >= EVIDENCE_FLOOR.vectorTerms) vector.push(path);\n        else partial.push(path);\n        if (!evidence.has(path)) evidence.set(path, 0);\n      } else uncorroborated++;\n    }\n    // The floor admits files; it does not reorder them. A weak keyword match\n    // still votes in fusion when its vector hit was corroborated.\n    ranked = rankEvidenceCandidates(\n      scored.map((entry) => entry.path),\n      keyword,\n      vector,\n      partial,\n    );\n    hits = semantic.hits.filter((hit) => vector.includes(hit.path) || partial.includes(hit.path));\n    explain.push(\n      `retrieval: keyword ranking fused with ${semantic.reason}` +\n        (uncorroborated > 0 ? `; ${uncorroborated} uncorroborated vector file(s) dropped` : \"\"),\n    );\n    if (belowFloor > 0) {\n      explain.push(\n        `abstention: ${belowFloor} vector-only file(s) below zvec.minScore ${minScore} (task IDF coverage of current source) dropped`,\n      );\n    }\n  }\n\n  let symbols: Record<string, string[]> | undefined;\n  const reranked = await llmRerank({\n    repositoryRoot,\n    task,\n    manifest,\n    entries,\n    scored,\n    semantic: semantic.paths,\n    ranked,\n    wantsTests,\n    deadlineAt: options.llmDeadlineAt,\n  });\n  if (reranked) {\n    explain.push(reranked.explain);\n    ranked = reranked.ranked;\n    symbols = reranked.symbols;\n  }\n\n  // Calibrated abstention (#45): return nothing rather than code when no\n  // *source* file reaches the evidence floor; docs and config alone (an eval\n  // dataset quoting the prompt, say) never justify sending code.\n  const wantsDocs = DOCS_TASK.test(task);\n  if (!ranked.some((path) => countsAsSource(path, task))) {\n    explain.push(\n      \"abstention: no source file reached the evidence floor (\" +\n        (ranked.length > 0\n          ? \"only docs/config did\"\n          : `best keyword score ${scored[0]?.score ?? 0} < ${EVIDENCE_FLOOR.keywordScore}`) +\n        (commands.length > 0\n          ? \"); only the named CLI command returned\"\n          : \"); no task targets returned\"),\n    );\n    return { paths: commands, hits: [], explain };\n  }\n  if (weakKeyword > 0) {\n    explain.push(\n      `abstention: ${weakKeyword} weak keyword candidate(s) below the evidence floor (score < ${EVIDENCE_FLOOR.keywordScore}) dropped`,\n    );\n  }\n  // Keyword evidence decided the task is about this repository; built file\n  // vectors pick which files (see file-vectors.ts for the measurements).\n  const vectors =\n    options.semantic === false || reranked\n      ? null\n      : await rankFilesByVector(repositoryRoot, manifest, task);\n  if (vectors && vectors.length > 0) {\n    // Vectors cover source only; a docs task keeps its best-ranked doc first.\n    const doc = wantsDocs ? ranked.filter((path) => DOC_PATH.test(path)).slice(0, 1) : [];\n    ranked = [...doc, ...vectors.map((match) => match.path)].slice(0, TASK_FILES);\n    explain.push(\n      `retrieval: file vectors ordered the files (best ${vectors[0]?.score.toFixed(2)})`,\n    );\n  }\n  const expansion = expandAlongImports(ranked, await mapSource, evidence, task);\n  if (expansion.explain) explain.push(expansion.explain);\n  if (commands.length > 0) {\n    explain.push(`retrieval: CLI command routing (${commands.join(\", \")})`);\n  }\n  const paths = [...new Set([...commands, ...expansion.paths])];\n  if (paths.length > TASK_FILES) {\n    explain.push(\n      `abstention: ${paths.length - TASK_FILES} lower-ranked candidate(s) beyond the top ${TASK_FILES} dropped`,\n    );\n  }\n  return {\n    paths: paths.slice(0, TASK_FILES),\n    hits,\n    explain,\n    ...(symbols && Object.keys(symbols).length > 0 ? { symbols } : {}),\n  };\n}\n\n/**\n * BYOK rerank of the keyword/fused path. Returns null when the layer is off.\n * The model may reorder admitted files, abstain, or promote a below-floor\n * candidate that has at least two task terms in its model summary or current\n * source (the vector corroboration rule); anything else it names is dropped.\n */\n/** A rerank call shorter than this cannot answer in time; skip it. */\nconst MIN_RERANK_MS = 200;\n\nasync function llmRerank(input: {\n  repositoryRoot: string;\n  task: string;\n  manifest: IndexManifest;\n  entries: Array<{ path: string; summary: string; llmText?: string }>;\n  scored: Array<{ path: string; score: number; order: number }>;\n  semantic: string[];\n  ranked: string[];\n  wantsTests: boolean;\n  deadlineAt: number | undefined;\n}): Promise<{ ranked: string[]; explain: string; symbols: Record<string, string[]> } | null> {\n  let config: Awaited<ReturnType<typeof import(\"../llm/config.js\").resolveLlmConfig>>;\n  try {\n    config = await (await import(\"../llm/config.js\")).resolveLlmConfig(input.repositoryRoot);\n  } catch {\n    return null;\n  }\n  if (!config.enabled || !config.features.rerank) return null;\n  const skipped = (reason: string) => ({\n    ranked: input.ranked,\n    explain: `retrieval: llm rerank skipped (${reason})`,\n    symbols: {},\n  });\n  const usable = (path: string) => input.wantsTests || !TEST_PATH.test(path);\n  const candidatePaths = [\n    ...new Set([\n      ...input.ranked,\n      ...input.scored\n        .map((entry) => entry.path)\n        .filter(usable)\n        .slice(0, 12),\n      ...input.semantic.filter(usable).slice(0, 8),\n    ]),\n  ].slice(0, 15);\n  if (candidatePaths.length === 0) return null;\n  const byPath = new Map(input.entries.map((entry) => [entry.path, entry]));\n  const deadlineMs = Math.min(\n    config.timeoutMs,\n    input.deadlineAt === undefined ? config.timeoutMs : input.deadlineAt - Date.now(),\n  );\n  if (deadlineMs < MIN_RERANK_MS) return skipped(\"no time left in the hook budget\");\n  const { rerankCandidates } = await import(\"../llm/rerank.js\");\n  const result = await rerankCandidates(\n    input.repositoryRoot,\n    config,\n    input.task,\n    candidatePaths.map((path) => ({\n      path,\n      summary: byPath.get(path)?.llmText || byPath.get(path)?.summary || \"\",\n      signatures: (input.manifest.entries[path]?.symbolTable ?? []).map((s) => s.signature),\n    })),\n    deadlineMs,\n  ).catch(() => ({ ok: false as const, reason: \"invalid\" as const }));\n  if (!result.ok) return skipped(result.reason);\n  const label = `${config.provider} ${config.model}, ${result.cached ? \"cached\" : `${result.latencyMs} ms`}`;\n  if (result.value.abstain) {\n    return {\n      ranked: [],\n      explain: `retrieval: llm rerank (${label}, model abstained over ${candidatePaths.length} candidates)`,\n      symbols: {},\n    };\n  }\n  const terms = taskTerms(input.task);\n  const picks: string[] = [];\n  const symbols: Record<string, string[]> = {};\n  let promoted = 0;\n  for (const file of result.value.files) {\n    if (!input.ranked.includes(file.path)) {\n      const source = (await readBoundedSource(input.repositoryRoot, file.path)) ?? \"\";\n      const llmText = byPath.get(file.path)?.llmText ?? \"\";\n      if (\n        Math.max(countTerms(llmText, terms), countTerms(source, terms)) < EVIDENCE_FLOOR.vectorTerms\n      )\n        continue;\n      promoted++;\n    }\n    picks.push(file.path);\n    const known = new Set(\n      (input.manifest.entries[file.path]?.symbolTable ?? []).map((s) => s.name),\n    );\n    const named = file.symbols.filter((name) => known.has(name));\n    if (named.length > 0) symbols[file.path] = named;\n  }\n  return {\n    ranked: [...picks, ...input.ranked.filter((path) => !picks.includes(path))],\n    explain:\n      `retrieval: llm rerank (${label}, ${picks.length} of ${candidatePaths.length} candidates` +\n      (promoted > 0 ? `, ${promoted} promoted` : \"\") +\n      \")\",\n    symbols,\n  };\n}\n\n/**\n * Source files for CLI commands the task names as `<bin> <command> [sub]`,\n * where `<bin>` is a `bin` entry of the repository's package.json: a file in a\n * `cli`/`cmd`/`commands` directory whose stem is `command` or `command-sub`.\n */\nasync function commandFiles(\n  repositoryRoot: string,\n  task: string,\n  entries: Array<{ path: string }>,\n): Promise<string[]> {\n  const bins = await packageBins(repositoryRoot);\n  if (bins.length === 0) return [];\n  const stems = new Set<string>();\n  const pattern = new RegExp(\n    `\\\\b(?:${bins.map(escapeRegExp).join(\"|\")})\\\\s+([a-z][\\\\w-]*)(?:\\\\s+([a-z][\\\\w-]*))?`,\n    \"gi\",\n  );\n  for (const [, command, sub] of task.matchAll(pattern)) {\n    if (!command) continue;\n    stems.add(command.toLowerCase());\n    if (sub) stems.add(`${command}-${sub}`.toLowerCase());\n  }\n  if (stems.size === 0) return [];\n  const matches = entries\n    .map((entry) => entry.path)\n    .filter((path) => {\n      if (TEST_PATH.test(path) || NON_SOURCE_PATH.test(path) || !COMMAND_DIR.test(path)) {\n        return false;\n      }\n      const name = path.slice(path.lastIndexOf(\"/\") + 1);\n      return stems.has(name.slice(0, name.lastIndexOf(\".\")).toLowerCase());\n    });\n  // `command-sub` names the command more precisely than `command`.\n  return matches\n    .sort((left, right) => right.length - left.length || left.localeCompare(right))\n    .slice(0, TASK_FILES);\n}\n\nconst COMMAND_DIR = /(^|\\/)(cli|cmd|commands?)\\//;\n\nasync function packageBins(repositoryRoot: string): Promise<string[]> {\n  try {\n    const manifest = JSON.parse(await readFile(join(repositoryRoot, \"package.json\"), \"utf8\")) as {\n      name?: unknown;\n      bin?: unknown;\n    };\n    if (typeof manifest.bin === \"string\" && typeof manifest.name === \"string\") {\n      return [manifest.name.slice(manifest.name.lastIndexOf(\"/\") + 1)];\n    }\n    if (manifest.bin && typeof manifest.bin === \"object\") return Object.keys(manifest.bin);\n  } catch {\n    // No (readable) package.json: no CLI routing.\n  }\n  return [];\n}\n\nfunction escapeRegExp(value: string): string {\n  return value.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/** Task wording that asks for a path through several files. */\nconst MULTI_FILE_TASK =\n  /\\b(trace|follow|flows?|through|across|between|end[- ]to[- ]end|pipeline)\\b|\\bfrom\\b.+\\bto\\b/i;\n\n/**\n * Bounded multi-file expansion (#45). Only when the task asks for a path\n * through several files: import neighbours of the top targets that carry\n * lexical evidence (at least one task term, even below the floor) get the\n * import edge credited as one more term, up to `expansionFiles` of them, most\n * linked first. Each is placed before the first lower-scoring non-seed target,\n * so it never displaces a file with stronger evidence.\n */\nfunction expandAlongImports(\n  ranked: string[],\n  map: ArchitectureMap,\n  evidence: Map<string, number>,\n  task: string,\n  options: { allowGraphOnly?: boolean } = {},\n): { paths: string[]; explain: string | null } {\n  if (!MULTI_FILE_TASK.test(task)) return { paths: ranked, explain: null };\n  const seeds = ranked.slice(0, EXPANSION.seeds);\n  const links = new Map<string, Set<string>>();\n  const graphOnly = new Map<string, number>();\n  for (const edge of map.edges) {\n    for (const [seed, other] of [\n      [edge.from, edge.to],\n      [edge.to, edge.from],\n    ] as const) {\n      if (!seeds.includes(seed) || seeds.includes(other)) continue;\n      if (!evidence.has(other)) {\n        if (\n          !options.allowGraphOnly ||\n          edge.from !== seed ||\n          TEST_PATH.test(other) ||\n          NON_SOURCE_PATH.test(other)\n        )\n          continue;\n        graphOnly.set(\n          other,\n          Math.max(\n            graphOnly.get(other) ?? 0,\n            edge.symbols?.length ? 2 : edge.kind === \"import\" ? 1 : 0,\n          ),\n        );\n      }\n      links.set(other, (links.get(other) ?? new Set()).add(seed));\n    }\n  }\n  const scoreOf = (path: string) => evidence.get(path) ?? 0;\n  const added = [...links]\n    .sort(\n      ([left, a], [right, b]) =>\n        b.size - a.size ||\n        scoreOf(right) - scoreOf(left) ||\n        (graphOnly.get(right) ?? 0) - (graphOnly.get(left) ?? 0) ||\n        left.localeCompare(right),\n    )\n    .slice(0, EXPANSION.files)\n    .map(([path]) => path);\n  if (added.length === 0) return { paths: ranked, explain: null };\n  const paths = ranked.filter((path) => !added.includes(path));\n  for (const path of added) {\n    const credited = scoreOf(path) + 1;\n    const at = paths.findIndex(\n      (other, index) => index >= seeds.length && scoreOf(other) < credited,\n    );\n    paths.splice(at < 0 ? paths.length : at, 0, path);\n  }\n  return {\n    paths,\n    explain:\n      `expansion: ${added.length} import neighbour(s) of the top ${seeds.length} target(s) ranked with the import edge credited as a task term (${added.join(\", \")}; multi-file task wording)` +\n      (added.some((path) => graphOnly.has(path)) ? \"; graph-only import bridge\" : \"\"),\n  };\n}\n\n/** Partial semantic matches fill available slots after established evidence. */\nexport function rankEvidenceCandidates(\n  lexical: string[],\n  admittedKeywords: string[],\n  vector: string[],\n  partial: string[],\n): string[] {\n  const admitted = new Set([...admittedKeywords, ...vector]);\n  const established = fuseRankings([lexical, vector]).filter((path) => admitted.has(path));\n  return [...new Set([...established, ...partial])];\n}\n\n/** Reciprocal rank fusion: robust to the two lists using unrelated score scales. */\nfunction fuseRankings(lists: string[][], k = 60): string[] {\n  const scores = new Map<string, number>();\n  for (const list of lists) {\n    list.forEach((path, index) => {\n      scores.set(path, (scores.get(path) ?? 0) + 1 / (k + index + 1));\n    });\n  }\n  return [...scores]\n    .sort((left, right) => right[1] - left[1] || left[0].localeCompare(right[0]))\n    .map(([path]) => path);\n}\n\nconst TASK_STOPWORDS = new Set(\n  \"the and for are was were how does did which where when what why who with without from into onto that this these those there their them then than have has had not but can could should would will its it's our your you all any each some such only also just like make makes made use uses used get gets set sets new old way\".split(\n    \" \",\n  ),\n);\n/**\n * Minimum evidence for a task-discovered file (#45). `keywordScore` is the\n * `scoreTaskPaths` score: two distinct task terms, or one in the file name. A\n * vector hit below it needs `vectorTerms` distinct task terms in current source.\n * Calibrated on the `tune` split of evals/task-savings.json only: every expected\n * file retrieved there scored ≥ 2 (one 0.5 step of margin kept; no tune file\n * scoring 1 was expected) and expected vector-only files matched 2 and 3 terms.\n */\nexport const EVIDENCE_FLOOR = { keywordScore: 1.5, vectorTerms: 2 } as const;\n/** A zg chunk is evidence for its matched passage, not unrelated terms elsewhere in the file. */\nasync function hasMatchedPassageEvidence(\n  repositoryRoot: string,\n  path: string,\n  hits: RetrievalHit[],\n  terms: string[],\n  symbols: Array<{ startLine: number; endLine: number }>,\n): Promise<boolean> {\n  const source = await readBoundedSource(repositoryRoot, path);\n  if (source === null) return false;\n  // Keep the established file-evidence route: passage-only filtering lost\n  // required files on the fused evaluation. Passages additionally admit narrow paraphrases.\n  if (countTerms(source, terms) >= EVIDENCE_FLOOR.vectorTerms) return true;\n  const lines = source.split(/\\r?\\n/);\n  return hits.some((hit) => {\n    if (hit.path !== path || hit.endLine > lines.length) return false;\n    const passage = lines.slice(hit.startLine - 1, hit.endLine);\n    const matched = countTerms(passage.join(\" \"), terms);\n    return (\n      matched >= EVIDENCE_FLOOR.vectorTerms ||\n      (matched >= 1 &&\n        terms.length === 2 &&\n        hit.rank <= 3 &&\n        symbols.some(\n          (symbol) => hit.startLine <= symbol.endLine && hit.endLine >= symbol.startLine,\n        ))\n    );\n  });\n}\nexport const TEST_PATH =\n  /(^|\\/)(__tests__|__fixtures__|fixtures?|test|tests)\\/|\\.(test|spec)\\.[a-z]+$|(^|\\/)(test_[^/]*|[^/]*_test|conftest)\\.py$/;\n/**\n * Changelogs and release notes: upper-case names (NEWS, CHANGES.rst, HISTORY.md)\n * with any extension, \"changelog\"/\"release notes\" in any case, and lower-case\n * changes/history/news/releases only as prose files (so `src/history.ts` is code).\n */\nexport const CHANGELOG_PATH = new RegExp(\n  [\n    \"(?:CHANGES|CHANGELOG|HISTORY|NEWS|RELEASES?|RELEASE[-_]?NOTES)(?:[._-][^/]*)?\",\n    \"[Cc]hange[-_]?[Ll]og[^/]*\",\n    \"[Rr]elease[-_]?[Nn]otes[^/]*\",\n    \"(?:[Cc]hanges|[Hh]istory|[Nn]ews|[Rr]eleases?)\\\\.(?:md|mdx|rst|txt|adoc|markdown)\",\n  ]\n    .map((name) => `(?:^|/)${name}$`)\n    .join(\"|\"),\n);\n/**\n * The task is about the changelog: \"changelog\", \"release notes\", \"version\n * history\", or a changelog file named in capitals or with its extension. The\n * plain words \"changes\" and \"history\" are too common in coding tasks to count.\n */\nexport function asksForChangelog(task: string): boolean {\n  return (\n    /\\b(?:change[-_ ]?logs?|release[-_ ]?notes?|(?:release|version) history)\\b/i.test(task) ||\n    /\\b(?:CHANGES|HISTORY|NEWS|RELEASES?)\\b/.test(task) ||\n    /\\b(?:changes|history|news|releases?)\\.(?:md|mdx|rst|txt|adoc)\\b/i.test(task)\n  );\n}\nconst NON_SOURCE_BASE =\n  /(^|\\/)(docs?|\\.github)\\/|\\.(md|mdx|rst|adoc|txt|ya?ml|json|lock)$|(^|\\/)CHANGELOG/i;\n/** Docs, config and changelogs: never enough on their own to send code. */\nexport const NON_SOURCE_PATH = {\n  test: (path: string): boolean => NON_SOURCE_BASE.test(path) || CHANGELOG_PATH.test(path),\n};\nconst PROSE_PATH = /(^|\\/)docs?\\/|\\.(md|mdx|rst|txt)$/i;\n/**\n * Prose documentation (a subset of NON_SOURCE_PATH; config files are not\n * docs). Changelogs are not docs: a docs task never makes them targets.\n */\nexport const DOC_PATH = {\n  test: (path: string): boolean => PROSE_PATH.test(path) && !CHANGELOG_PATH.test(path),\n};\n/** A task about documentation lets docs compete with (and stand in for) source. */\nconst DOCS_TASK = /\\b(docs?|documentation|documented|guides?|tutorials?|readme|manual)\\b/i;\n\n/**\n * Source, or a non-source file the task is about: a doc for a docs task, a\n * changelog for a changelog task. Only these can stop abstention.\n */\nexport function countsAsSource(path: string, task: string): boolean {\n  return (\n    !NON_SOURCE_PATH.test(path) ||\n    (DOCS_TASK.test(task) && DOC_PATH.test(path)) ||\n    (asksForChangelog(task) && CHANGELOG_PATH.test(path))\n  );\n}\n\n/**\n * Rank indexed files against a natural-language task. Terms match whole words\n * (camelCase and snake_case split, simple plurals folded) in the path, summary\n * and symbols; a term in the file name counts extra. Tests and fixtures are\n * skipped unless the task is about tests, and docs/config files are\n * down-weighted so source files win ties.\n */\nexport function rankTaskPaths(entries: TaskPathEntry[], task: string): string[] {\n  return scoreTaskPaths(entries, task).map((entry) => entry.path);\n}\n\ntype TaskPathEntry = {\n  path: string;\n  summary: string;\n  symbols: string[];\n  symbolTable?: Array<{ name: string }>;\n  /** Model-written description (BYOK summaries): affects `order`, never `score`. */\n  llmText?: string;\n};\n\n/** `rankTaskPaths` with each file's score, best first. */\nexport function scoreTaskPaths(\n  entries: TaskPathEntry[],\n  task: string,\n): Array<{ path: string; score: number; order: number }> {\n  const terms = taskTerms(task);\n  if (terms.length === 0) return [];\n  const wantsTests = terms.some((term) => term === \"test\" || term === \"spec\");\n  const candidates = entries.flatMap((entry) => {\n    if (TEST_PATH.test(entry.path) && !wantsTests) return [];\n    const words = new Set(\n      splitWords(\n        `${entry.path} ${entry.summary} ${entry.symbols.join(\" \")} ${entry.symbolTable?.map((symbol) => symbol.name).join(\" \") ?? \"\"}`,\n      ),\n    );\n    const llmWords = new Set(entry.llmText ? splitWords(entry.llmText) : []);\n    const fileWords = new Set(splitWords(entry.path.slice(entry.path.lastIndexOf(\"/\") + 1)));\n    return [{ path: entry.path, words, llmWords, fileWords }];\n  });\n  // Rare task terms identify a file better than common ones, so ordering\n  // weighs each matched term by inverse document frequency. The returned\n  // `score` stays unweighted and ignores model-written text: the evidence\n  // floor is calibrated on it.\n  const idf = new Map(\n    terms.map((term) => {\n      const df = candidates.filter(\n        (candidate) => candidate.words.has(term) || candidate.llmWords.has(term),\n      ).length;\n      return [term, Math.log((candidates.length + 1) / (df + 1)) + 1];\n    }),\n  );\n  return candidates\n    .flatMap(({ path, words, llmWords, fileWords }) => {\n      let score = 0;\n      let weighted = 0;\n      for (const term of terms) {\n        if (words.has(term)) {\n          const points = fileWords.has(term) ? 1.5 : 1;\n          score += points;\n          weighted += points * (idf.get(term) ?? 1);\n        } else if (llmWords.has(term)) {\n          weighted += 0.5 * (idf.get(term) ?? 1);\n        }\n      }\n      if (weighted === 0) return [];\n      if (!countsAsSource(path, task)) {\n        score *= 0.5;\n        weighted *= 0.5;\n      }\n      return [{ path, score, order: weighted }];\n    })\n    .sort(\n      (left, right) =>\n        right.order - left.order || right.score - left.score || left.path.localeCompare(right.path),\n    );\n}\n\n/** Lowercase words with camelCase/snake_case split and a trailing plural \"s\" folded. */\nexport function splitWords(text: string): string[] {\n  return rawWords(text).map(foldPlural);\n}\n\nfunction rawWords(text: string): string[] {\n  return text\n    .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n    .toLowerCase()\n    .split(/[^a-z0-9]+/)\n    .filter((word) => word.length > 2);\n}\n\n/** `crashes` → `crash`, `users` → `user`, `cookies` → `cookie`; `class`, `status`, `this` stay. */\nfunction foldPlural(word: string): string {\n  if (word.length <= 3 || !word.endsWith(\"s\") || /(ss|us|is)$/.test(word)) return word;\n  if (/(ss|sh|ch|x|z)es$/.test(word)) return word.slice(0, -2);\n  return word.slice(0, -1);\n}\n\n/**\n * GitHub issue-form scaffolding that a pasted issue carries into a task: section\n * headings, `_No response_`, checkbox options, placeholder steps and the version\n * field. Its words (\"response\", \"code\", \"error\", \"version\") match unrelated files.\n */\nconst ISSUE_TEMPLATE = [\n  /_No response_/gi,\n  /\\(Please specify[^)]*\\)/gi,\n  /-\\s*\\[[ xX]\\]\\s*[\\w.+-]+/g,\n  /\\d+\\.\\s*(?:Go to|Click on|Scroll down to)\\s*'\\.+'|\\bSee error\\b/gi,\n  /#{1,6}\\s*[\\w-]+ Version\\b(?:\\s*v?\\d+(?:\\.\\d+)+[\\w.-]*,?)*/gi,\n  /#{1,6}\\s*(?:Description|Summary|URL to code causing the issue|MCVE|Minimal reproducible example|Steps to reproduce|Expected behaviou?r|Actual behaviou?r|Screenshots|Logs|Environment|Platform|Additional context)\\b/gi,\n];\n\n/** The task without issue-form scaffolding; plain prose is returned unchanged. */\nexport function stripIssueTemplate(task: string): string {\n  return ISSUE_TEMPLATE.reduce((text, pattern) => text.replace(pattern, \" \"), task);\n}\n\n/** Task words that carry meaning (stopwords removed), as used for path ranking. */\nexport function taskTerms(task: string): string[] {\n  return [\n    ...new Set(\n      rawWords(task)\n        .filter((word) => !TASK_STOPWORDS.has(word))\n        .map(foldPlural)\n        .filter((term) => !TASK_STOPWORDS.has(term)),\n    ),\n  ];\n}\n\n/** How many distinct task terms appear in `text`. */\nexport function countTerms(text: string, terms: string[]): number {\n  if (terms.length === 0) return 0;\n  const words = new Set(splitWords(text));\n  return terms.filter((term) => words.has(term)).length;\n}\n\n/** `e.g`, `i.e`: dotted single letters are prose, not `Class.method`. */\nconst ABBREVIATION = /^[a-z](?:\\.[a-z])+$/i;\n/**\n * Modules that only declare errors (`exceptions.py`, `errors/`). ponytail: a task\n * that changes an exception class itself still reaches it through keyword ranking only.\n */\nconst EXCEPTION_MODULE = /(^|\\/)(exceptions?|errors?)(\\/|\\.[a-z]+$)/i;\n\n/** Looks like code, not prose: camelCase humps, snake_case, `$`, or dotted `Class.method`. */\nconst CODE_IDENTIFIER = /[a-z0-9][A-Z]|[_$.]/;\n\n/** Identifier-shaped task tokens; dotted ones also split (`Vault.lock` → `Vault`, `lock`). */\nexport function identifierTokens(task: string): string[] {\n  const tokens = task.match(/[A-Za-z_$][\\w$]*(?:\\.[A-Za-z_$][\\w$]*)*/g) ?? [];\n  return [...new Set(tokens.flatMap((token) => [token, ...token.split(\".\")]))];\n}\n\n/** How many segments of a (`Class.method`) symbol name the tokens name. */\nexport function namedSegments(name: string, tokens: string[]): number {\n  return name.split(\".\").filter((segment) => tokens.includes(segment)).length;\n}\n\nexport async function loadProjectArchitectureMap(\n  repositoryRoot: string,\n  manifestSource: IndexManifest | Promise<IndexManifest>,\n): Promise<ArchitectureMap> {\n  const [config, manifest] = await Promise.all([readConfigFile(repositoryRoot), manifestSource]);\n  const builtIn = (await loadArchitectureMap(repositoryRoot, manifest)).map;\n  if (\n    config.graphify?.enabled &&\n    (await graphifyGraphExists(repositoryRoot, config.graphify.graphPath))\n  ) {\n    try {\n      const graphPath = join(\n        repositoryRoot,\n        config.graphify.graphPath ?? \"graphify-out/graph.json\",\n      );\n      const [graph, graphFile, sourceHashes] = await Promise.all([\n        loadGraphifyMap(graphPath, repositoryRoot),\n        stat(graphPath),\n        readGraphSourceSnapshot(graphPath),\n      ]);\n      // A graph can be valid JSON yet lag the current source, or cover only a\n      // subset of files. Keep fresh Graphify-only relations and symbol labels,\n      // while retaining the current import scan for the rest of the project.\n      const livePaths = new Set(\n        (\n          await Promise.all(\n            graph.modules.map(async (module) => {\n              try {\n                const absolute = await realpath(join(repositoryRoot, module.path));\n                const inside = relative(await realpath(repositoryRoot), absolute);\n                if (inside.startsWith(\"..\") || isAbsolute(inside)) return null;\n                const source = await stat(absolute);\n                const fresh =\n                  sourceHashes === null\n                    ? source.mtimeMs <= graphFile.mtimeMs\n                    : sourceHashes[module.path] !== undefined &&\n                      sourceHashes[module.path] === manifest.entries[module.path]?.hash;\n                return source.isFile() && fresh ? module.path : null;\n              } catch {\n                // Deleted files must not contribute graph relationships.\n                return null;\n              }\n            }),\n          )\n        ).filter((path): path is string => path !== null),\n      );\n      const modules = new Map(builtIn.modules.map((module) => [module.path, module]));\n      for (const module of graph.modules) {\n        if (livePaths.has(module.path) && !modules.has(module.path))\n          modules.set(module.path, module);\n      }\n      const edges = new Map(builtIn.edges.map((edge) => [`${edge.from}\\0${edge.to}`, edge]));\n      let freshGraphEdges = 0;\n      for (const edge of graph.edges) {\n        if (!livePaths.has(edge.from) || !livePaths.has(edge.to)) continue;\n        freshGraphEdges++;\n        const key = `${edge.from}\\0${edge.to}`;\n        const scanned = edges.get(key);\n        edges.set(\n          key,\n          scanned ? { ...scanned, ...(edge.symbols ? { symbols: edge.symbols } : {}) } : edge,\n        );\n      }\n      const mergedEdges = [...edges.values()].sort((left, right) =>\n        `${left.from}:${left.to}`.localeCompare(`${right.from}:${right.to}`),\n      );\n      const importsByPath = new Map<string, string[]>();\n      for (const edge of mergedEdges) {\n        const imports = importsByPath.get(edge.from) ?? [];\n        imports.push(edge.to);\n        importsByPath.set(edge.from, imports);\n      }\n      return {\n        modules: [...modules.values()]\n          .map((module) => ({ ...module, imports: importsByPath.get(module.path) ?? [] }))\n          .sort((left, right) => left.path.localeCompare(right.path)),\n        edges: mergedEdges,\n        source: freshGraphEdges > 0 ? \"graphify+imports\" : \"imports\",\n      };\n    } catch {\n      // An unusable or malformed graph degrades to the built-in import map\n      // instead of failing the whole context request.\n    }\n  }\n  return { ...builtIn, source: \"imports\" };\n}\n","import { readFile } from \"node:fs/promises\";\nimport { isAbsolute, relative, resolve } from \"node:path\";\nimport type { ArchitectureMap, ModuleEdge, ModuleNode } from \"./types.js\";\n\ntype GraphifyRecord = Record<string, unknown>;\n\n/**\n * Graphify emits containment and documentation relations alongside real\n * dependencies. Keeping them would make a README or an MCP config look like an\n * importer of the code it mentions, so they are dropped. Edges with no relation\n * field (older graph.json exports) are still treated as imports.\n */\nconst NON_DEPENDENCY_RELATIONS = new Set([\n  \"contains\",\n  \"part_of\",\n  \"defines\",\n  \"declares\",\n  \"references\",\n  \"requires_env\",\n  \"rationale_for\",\n]);\n\n/**\n * Graphify's graph is undirected, so a relation phrased from the dependency's\n * point of view (\"b is imported by a\") arrives with its endpoints the wrong way\n * round for a dependency edge. These are swapped rather than dropped.\n */\nconst INVERSE_RELATIONS = new Set([\n  \"imported_by\",\n  \"called_by\",\n  \"used_by\",\n  \"referenced_by\",\n  \"extended_by\",\n  \"implemented_by\",\n  \"dependency_of\",\n  \"depended_on_by\",\n]);\n\n// Only known code dependencies may become file-level import neighbours. A new\n// Graphify relation must be reviewed before it can influence retrieval.\nconst DIRECT_DEPENDENCY_RELATIONS = new Set([\n  \"import\",\n  \"imports\",\n  \"imports_from\",\n  \"dynamic_import\",\n  \"dynamic_imports\",\n  \"calls\",\n  \"uses\",\n  \"extends\",\n  \"implements\",\n  \"depends_on\",\n]);\n\n/** How many symbol names an edge carries, so a large fan-in stays bounded. */\nconst MAX_EDGE_SYMBOLS = 8;\n\n/** Import the common graph.json node/edge shape without depending on Graphify. */\nexport async function loadGraphifyMap(\n  graphPath: string,\n  repositoryRoot = process.cwd(),\n): Promise<ArchitectureMap> {\n  const raw = JSON.parse(await readFile(graphPath, \"utf8\")) as GraphifyRecord;\n  const nodes = arrayRecord(raw.nodes ?? raw.entities);\n  const edges = arrayRecord(raw.edges ?? raw.links ?? raw.relationships);\n  const nodePaths = new Map<string, string>();\n  const nodeLabels = new Map<string, string>();\n  const modules: ModuleNode[] = [];\n\n  for (const node of nodes) {\n    const id = stringValue(node.id ?? node.key ?? node.name);\n    const path = graphifyPath(node, repositoryRoot);\n    if (!id || !path) continue;\n    nodePaths.set(id, path);\n    const label = stringValue(node.label ?? node.name);\n    // The node standing for the file itself carries no useful symbol name.\n    if (label && label !== path && !path.endsWith(`/${label}`)) nodeLabels.set(id, label);\n    modules.push({ path, language: languageFor(path), imports: [] });\n  }\n\n  const modulePaths = new Set(modules.map((module) => module.path));\n  const importedEdges: ModuleEdge[] = [];\n  for (const edge of edges) {\n    const relation = stringValue(edge.relation ?? edge.type ?? edge.kind)?.toLowerCase() ?? null;\n    if (relation && NON_DEPENDENCY_RELATIONS.has(relation)) continue;\n    if (relation && !DIRECT_DEPENDENCY_RELATIONS.has(relation) && !INVERSE_RELATIONS.has(relation))\n      continue;\n    const inverse = relation !== null && INVERSE_RELATIONS.has(relation);\n    const sourceEndpoint = edge.from ?? edge.source;\n    const targetEndpoint = edge.to ?? edge.target;\n    const [tail, head] = inverse\n      ? [targetEndpoint, sourceEndpoint]\n      : [sourceEndpoint, targetEndpoint];\n    const from = endpointPath(tail, nodePaths, repositoryRoot);\n    const to = endpointPath(head, nodePaths, repositoryRoot);\n    if (!from || !to || !modulePaths.has(from) || !modulePaths.has(to) || from === to) continue;\n    // The endpoint inside the dependency names the symbol the dependant uses.\n    const symbol = endpointLabel(head, nodeLabels);\n    importedEdges.push({\n      from,\n      to,\n      kind: relation?.includes(\"dynamic\") ? \"dynamic_import\" : \"import\",\n      ...(symbol ? { symbols: [symbol] } : {}),\n    });\n  }\n\n  const uniqueModules = [...new Map(modules.map((module) => [module.path, module])).values()].sort(\n    (left, right) => left.path.localeCompare(right.path),\n  );\n  const byEndpoints = new Map<string, ModuleEdge>();\n  for (const edge of importedEdges) {\n    const key = `${edge.from}:${edge.to}`;\n    const existing = byEndpoints.get(key);\n    if (!existing) {\n      byEndpoints.set(key, edge);\n      continue;\n    }\n    // Several symbol-level links collapse into one file edge: keep every symbol\n    // name, and let a static import win over a dynamic one.\n    const symbols = mergeSymbols(existing.symbols, edge.symbols);\n    byEndpoints.set(key, {\n      ...(existing.kind === \"dynamic_import\" && edge.kind === \"import\" ? edge : existing),\n      ...(symbols ? { symbols } : {}),\n    });\n  }\n  const uniqueEdges = [...byEndpoints.values()].sort((left, right) =>\n    `${left.from}:${left.to}`.localeCompare(`${right.from}:${right.to}`),\n  );\n  if (uniqueModules.length === 0 || uniqueEdges.length === 0) {\n    throw new Error(`Graphify graph contains no usable file relationships: ${graphPath}`);\n  }\n  for (const module of uniqueModules) {\n    module.imports = uniqueEdges\n      .filter((edge) => edge.from === module.path)\n      .map((edge) => edge.to)\n      .sort();\n  }\n  return { modules: uniqueModules, edges: uniqueEdges };\n}\n\nfunction arrayRecord(value: unknown): GraphifyRecord[] {\n  return Array.isArray(value)\n    ? value.filter((item): item is GraphifyRecord => Boolean(item && typeof item === \"object\"))\n    : [];\n}\n\nfunction endpointPath(\n  endpoint: unknown,\n  nodePaths: Map<string, string>,\n  repositoryRoot: string,\n): string | null {\n  if (typeof endpoint === \"string\")\n    return nodePaths.get(endpoint) ?? normalizeGraphPath(endpoint, repositoryRoot);\n  if (!endpoint || typeof endpoint !== \"object\") return null;\n  const record = endpoint as GraphifyRecord;\n  const id = stringValue(record.id ?? record.key ?? record.name);\n  return nodePaths.get(id ?? \"\") ?? graphifyPath(record, repositoryRoot);\n}\n\nfunction endpointLabel(endpoint: unknown, nodeLabels: Map<string, string>): string | null {\n  if (typeof endpoint === \"string\") return nodeLabels.get(endpoint) ?? null;\n  if (!endpoint || typeof endpoint !== \"object\") return null;\n  const id = stringValue((endpoint as GraphifyRecord).id);\n  return id ? (nodeLabels.get(id) ?? null) : null;\n}\n\nfunction mergeSymbols(left?: string[], right?: string[]): string[] | undefined {\n  if (!left && !right) return undefined;\n  return [...new Set([...(left ?? []), ...(right ?? [])])].sort().slice(0, MAX_EDGE_SYMBOLS);\n}\n\nfunction graphifyPath(node: GraphifyRecord, repositoryRoot: string): string | null {\n  const source = node.source;\n  const location = node.location;\n  const candidate =\n    stringValue(node.path ?? node.file ?? node.file_path ?? node.source_file) ??\n    (source && typeof source === \"object\" ? stringValue((source as GraphifyRecord).path) : null) ??\n    (location && typeof location === \"object\"\n      ? stringValue((location as GraphifyRecord).file ?? (location as GraphifyRecord).path)\n      : null);\n  return candidate ? normalizeGraphPath(candidate, repositoryRoot) : null;\n}\n\nfunction normalizeGraphPath(path: string, repositoryRoot: string): string | null {\n  const absolute = isAbsolute(path) ? resolve(path) : resolve(repositoryRoot, path);\n  const relativePath = relative(resolve(repositoryRoot), absolute).replace(/\\\\/g, \"/\");\n  if (relativePath === \"\" || relativePath === \"..\" || relativePath.startsWith(\"../\")) return null;\n  return relativePath.replace(/^\\.\\//, \"\");\n}\n\nfunction stringValue(value: unknown): string | null {\n  return typeof value === \"string\" && value.length > 0 ? value : null;\n}\n\nfunction languageFor(path: string): ModuleNode[\"language\"] {\n  if (/\\.py$/.test(path)) return \"py\";\n  return /\\.tsx?$/.test(path) ? \"ts\" : \"js\";\n}\n","import { isAbsolute, relative, resolve, sep } from \"node:path\";\nimport { NON_SOURCE_PATH, readBoundedSource, TEST_PATH } from \"./discovery.js\";\n\n/**\n * Explicit anchors in a task: repo paths, `path:line`, stack frames and quoted\n * error strings found verbatim in current source. They name the code better\n * than any ranking, so discovery puts them first. Only files in the index count;\n * a typo or a deleted file yields no anchor.\n */\nexport type TaskAnchor = {\n  path: string;\n  line: number | null;\n  kind: \"path\" | \"line\" | \"stack\" | \"error\";\n};\n\nconst MAX_ANCHORS = 3;\n/** Source files searched for a quoted error string (bounded for the prompt hook). */\nconst MAX_ERROR_SEARCH_FILES = 2000;\n\nconst JS_FRAME = /\\bat\\s+(?:[^\\s()]+\\s+\\()?([^\\s()]+?):(\\d+):\\d+\\)?/g;\nconst PY_FRAME = /\\bFile\\s+\"([^\"]+)\",\\s+line\\s+(\\d+)/g;\nconst PATH_TOKEN =\n  /(?:^|[\\s(`'\"[])((?:\\.{0,2}\\/)?[\\w@.-]+(?:\\/[\\w@.-]+)*\\.[A-Za-z0-9]+)(?::(\\d+))?/g;\nconst QUOTED = /\"([^\"\\n]{8,200})\"|'([^'\\n]{8,200})'|`([^`\\n]{8,200})`/g;\n\nexport async function extractTaskAnchors(\n  repositoryRoot: string,\n  task: string,\n  paths: ReadonlySet<string>,\n): Promise<TaskAnchor[]> {\n  const root = resolve(repositoryRoot);\n  const found: Array<TaskAnchor & { at: number }> = [];\n  const add = (raw: string, line: string | undefined, kind: TaskAnchor[\"kind\"], at: number) => {\n    const path = toIndexedPath(root, raw, paths);\n    if (path) found.push({ path, line: line ? Number(line) : null, kind, at });\n  };\n  for (const match of task.matchAll(JS_FRAME)) add(match[1] ?? \"\", match[2], \"stack\", match.index);\n  for (const match of task.matchAll(PY_FRAME)) add(match[1] ?? \"\", match[2], \"stack\", match.index);\n  for (const match of task.matchAll(PATH_TOKEN)) {\n    add(match[1] ?? \"\", match[2], match[2] ? \"line\" : \"path\", match.index);\n  }\n\n  const anchors: TaskAnchor[] = [];\n  const seen = new Set<string>();\n  // A stack frame and a plain path token can match the same text; the first\n  // (stack frames are collected first) wins for that path.\n  for (const { at: _at, ...anchor } of found.sort((left, right) => left.at - right.at)) {\n    if (seen.has(anchor.path)) continue;\n    seen.add(anchor.path);\n    anchors.push(anchor);\n  }\n  if (anchors.length < MAX_ANCHORS) {\n    for (const error of await errorAnchors(root, task, paths)) {\n      if (seen.has(error.path)) continue;\n      seen.add(error.path);\n      anchors.push(error);\n    }\n  }\n  return anchors.slice(0, MAX_ANCHORS);\n}\n\nfunction toIndexedPath(root: string, raw: string, paths: ReadonlySet<string>): string | null {\n  const absolute = isAbsolute(raw) ? raw : resolve(root, raw);\n  const rel = relative(root, absolute);\n  if (rel === \"\" || rel.startsWith(`..${sep}`) || rel === \"..\" || isAbsolute(rel)) return null;\n  const normalized = rel.replace(/\\\\/g, \"/\");\n  return paths.has(normalized) ? normalized : null;\n}\n\n/**\n * Quoted strings (not paths) found verbatim in exactly one source file. A\n * string in several files (\"use client\", a shared label) names none of them.\n */\nasync function errorAnchors(\n  root: string,\n  task: string,\n  paths: ReadonlySet<string>,\n): Promise<TaskAnchor[]> {\n  const quotes = [...task.matchAll(QUOTED)]\n    .map((match) => match[1] ?? match[2] ?? match[3] ?? \"\")\n    .filter((text) => text.trim().length >= 8 && !toIndexedPath(root, text, paths));\n  if (quotes.length === 0) return [];\n  const sources = [...paths]\n    .filter((path) => !TEST_PATH.test(path) && !NON_SOURCE_PATH.test(path))\n    .sort()\n    .slice(0, MAX_ERROR_SEARCH_FILES);\n  // ponytail: one pass per quote over bounded sources; an index of string literals if repos outgrow it.\n  const matches = quotes.map(() => [] as TaskAnchor[]);\n  for (const path of sources) {\n    if (matches.every((found) => found.length > 1)) break;\n    const source = await readBoundedSource(root, path);\n    if (!source) continue;\n    quotes.forEach((quote, i) => {\n      const found = matches[i] as TaskAnchor[];\n      if (found.length > 1) return;\n      const index = source.indexOf(quote);\n      if (index >= 0) {\n        found.push({ path, line: source.slice(0, index).split(\"\\n\").length, kind: \"error\" });\n      }\n    });\n  }\n  return matches.flatMap((found) => (found.length === 1 ? found : []));\n}\n","import { mkdir, readFile } from \"node:fs/promises\";\nimport { dirname, join } from \"node:path\";\nimport { writeAtomic } from \"../core/markdown-store-fs.js\";\nimport type { IndexManifest } from \"../indexer/types.js\";\nimport {\n  CHANGELOG_PATH,\n  DOC_PATH,\n  NON_SOURCE_PATH,\n  readBoundedSource,\n  splitWords,\n  TEST_PATH,\n} from \"./discovery.js\";\n\n/**\n * Full-text relevance for task → file discovery: BM25 over each indexed\n * source file's words, not just its path, summary and symbol names (which\n * miss every word inside a function body). On the dsicord-bot labelled set it\n * took exact-wording tasks from 46.7% to 66.7% top-1 and reworded ones from\n * 0% to 30%.\n *\n * Word counts are cached per file by content hash in\n * `.codebuddy/cache/content-terms.json` (gitignored, rebuildable), so a prompt\n * re-reads only files that changed since the last one.\n */\n\n/** `passages`: the distinct words of each 40-line window (stepping 20 lines). */\ntype FileTerms = {\n  hash: string;\n  length: number;\n  counts: Record<string, number>;\n  passages: string[][];\n};\ntype Cache = { version: 2; files: Record<string, FileTerms> };\n\nconst PASSAGE_LINES = 40;\n\nconst K1 = 1.2;\nconst B = 0.75;\n/**\n * A match must hold at least this many distinct task terms in one passage\n * (fewer if the task has fewer). Terms scattered across a large file are how\n * unrelated tasks matched: one task word in a git helper, another in an\n * unrelated function further down.\n */\nconst MIN_TERMS = 2;\n/** …and score at least this share of the best file, so a weak tail never rides along. */\nconst MIN_SHARE = 0.5;\n/**\n * …and cover at least this share of the task's rarity (IDF) mass. A task whose\n * most specific words appear nowhere in the repository (an email feature asked\n * of a repo with no mail code) is about something else, however well two\n * common words match. 0.3 is the lowest value that kept every unrelated task in\n * evals/task-savings.json silent (0.2 let two through); higher values cost recall.\n */\nconst MIN_IDF_COVERAGE = 0.3;\n\nexport type ContentMatch = { path: string; score: number; terms: number };\n\n/**\n * Source files ranked by BM25 for the task, already gated: each one contains\n * at least two task terms and scores at least half of the best file. Empty\n * when nothing clears that bar, so callers can stay silent instead of\n * guessing.\n */\nexport async function rankByContent(\n  repositoryRoot: string,\n  manifest: IndexManifest,\n  terms: string[],\n  wantsTests: boolean,\n  /** A docs task also ranks prose docs (never config). */\n  wantsDocs = false,\n  wantsChangelog = false,\n): Promise<ContentMatch[]> {\n  return (await rankContent(repositoryRoot, manifest, terms, wantsTests, wantsDocs, wantsChangelog))\n    .matches;\n}\n\n/** `rankByContent` plus each task term's IDF over the indexed source files. */\nexport async function rankContent(\n  repositoryRoot: string,\n  manifest: IndexManifest,\n  terms: string[],\n  wantsTests: boolean,\n  wantsDocs = false,\n  wantsChangelog = false,\n): Promise<{ matches: ContentMatch[]; idf: Map<string, number> }> {\n  const none = { matches: [], idf: new Map<string, number>() };\n  if (terms.length === 0) return none;\n  const paths = Object.keys(manifest.entries).filter(\n    (path) =>\n      (!NON_SOURCE_PATH.test(path) ||\n        (wantsDocs && DOC_PATH.test(path)) ||\n        (wantsChangelog && CHANGELOG_PATH.test(path))) &&\n      (wantsTests || !TEST_PATH.test(path)),\n  );\n  const cache = await loadCache(repositoryRoot);\n  let changed = false;\n  const files: Record<string, FileTerms> = {};\n  await Promise.all(\n    paths.map(async (path) => {\n      const hash = manifest.entries[path]?.hash ?? \"\";\n      const cached = cache.files[path];\n      if (cached && cached.hash === hash) {\n        files[path] = cached;\n        return;\n      }\n      const source = await readBoundedSource(repositoryRoot, path);\n      if (source === null) return;\n      const counts: Record<string, number> = {};\n      const words = splitWords(`${path} ${source}`);\n      for (const word of words) counts[word] = (counts[word] ?? 0) + 1;\n      const lines = source.split(\"\\n\");\n      const passages: string[][] = [];\n      for (\n        let start = 0;\n        start === 0 || start + PASSAGE_LINES / 2 < lines.length;\n        start += PASSAGE_LINES / 2\n      ) {\n        passages.push([\n          ...new Set(splitWords(lines.slice(start, start + PASSAGE_LINES).join(\"\\n\"))),\n        ]);\n      }\n      files[path] = { hash, length: words.length, counts, passages };\n      changed = true;\n    }),\n  );\n  // Entries this task did not rank (docs on a code task) stay while current.\n  const retained = Object.fromEntries(\n    Object.entries(cache.files).filter(\n      ([path, file]) => !(path in files) && manifest.entries[path]?.hash === file.hash,\n    ),\n  );\n  const kept = Object.keys(retained).length + Object.keys(files).length;\n  if (changed || kept !== Object.keys(cache.files).length) {\n    await saveCache(repositoryRoot, { version: 2, files: { ...retained, ...files } });\n  }\n\n  const documents = Object.entries(files);\n  if (documents.length === 0) return none;\n  const averageLength =\n    documents.reduce((sum, [, file]) => sum + file.length, 0) / documents.length;\n  const idf = new Map(\n    terms.map((term) => {\n      const df = documents.filter(([, file]) => (file.counts[term] ?? 0) > 0).length;\n      return [term, Math.log(1 + (documents.length - df + 0.5) / (df + 0.5))];\n    }),\n  );\n  const totalIdf = [...idf.values()].reduce((sum, value) => sum + value, 0);\n  const scored = documents\n    .map(([path, file]) => {\n      const fileName = new Set(splitWords(path.slice(path.lastIndexOf(\"/\") + 1)));\n      let score = 0;\n      let covered = 0;\n      for (const term of terms) {\n        const tf = file.counts[term] ?? 0;\n        if (tf === 0) continue;\n        covered += idf.get(term) ?? 0;\n        const saturation =\n          (tf * (K1 + 1)) / (tf + K1 * (1 - B + (B * file.length) / averageLength));\n        score += (idf.get(term) ?? 0) * saturation * (fileName.has(term) ? 1.5 : 1);\n      }\n      // The file name counts as part of every passage.\n      const named = terms.filter((term) => fileName.has(term));\n      const matched = Math.max(\n        named.length,\n        ...file.passages.map(\n          (words) => new Set([...named, ...terms.filter((term) => words.includes(term))]).size,\n        ),\n      );\n      return { path, score, terms: matched, coverage: totalIdf > 0 ? covered / totalIdf : 0 };\n    })\n    .filter((match) => match.score > 0)\n    .sort((left, right) => right.score - left.score || left.path.localeCompare(right.path));\n  const best = scored[0]?.score ?? 0;\n  const needed = Math.min(MIN_TERMS, terms.length);\n  const matches = scored\n    .filter(\n      (match) =>\n        match.terms >= needed &&\n        match.score >= MIN_SHARE * best &&\n        match.coverage >= MIN_IDF_COVERAGE,\n    )\n    .map(({ path, score, terms: matched }) => ({ path, score, terms: matched }));\n  return { matches, idf };\n}\n\n/**\n * Share of the task's IDF mass whose terms occur in `text` (0..1): the\n * `MIN_IDF_COVERAGE` measure, applied to any text. Terms absent from every\n * indexed file carry the most weight, so a task about something the repository\n * does not contain covers little however many common words a file shares.\n */\nexport function idfCoverage(text: string, terms: string[], idf: Map<string, number>): number {\n  const total = terms.reduce((sum, term) => sum + (idf.get(term) ?? 0), 0);\n  if (total === 0) return 0;\n  const words = new Set(splitWords(text));\n  return terms.reduce((sum, term) => sum + (words.has(term) ? (idf.get(term) ?? 0) : 0), 0) / total;\n}\n\nfunction cachePath(repositoryRoot: string): string {\n  return join(repositoryRoot, \".codebuddy\", \"cache\", \"content-terms.json\");\n}\n\nasync function loadCache(repositoryRoot: string): Promise<Cache> {\n  try {\n    const parsed = JSON.parse(await readFile(cachePath(repositoryRoot), \"utf8\")) as Cache;\n    if (parsed.version === 2 && parsed.files && typeof parsed.files === \"object\") return parsed;\n  } catch {\n    // Missing or corrupt: rebuild from the files.\n  }\n  return { version: 2, files: {} };\n}\n\nasync function saveCache(repositoryRoot: string, cache: Cache): Promise<void> {\n  try {\n    const path = cachePath(repositoryRoot);\n    await mkdir(dirname(path), { recursive: true });\n    await writeAtomic(path, JSON.stringify(cache));\n  } catch {\n    // A cache that cannot be written only costs a re-read next prompt.\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,SAAS,SAAS,UAAU,YAAY;AACxC,SAAS,SAAS,SAAS,MAAM,UAAU,eAAe;AAI1D,IAAM,uBAAuB,oBAAI,IAAI,CAAC,OAAO,QAAQ,OAAO,QAAQ,QAAQ,QAAQ,KAAK,CAAC;AAC1F,IAAM,sBAAsB,oBAAI,IAAI;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,eAAsB,qBACpB,iBAAiB,QAAQ,IAAI,GACH;AAC1B,QAAM,OAAO,QAAQ,cAAc;AACnC,QAAM,QAAQ,MAAM,gBAAgB,IAAI;AACxC,QAAM,UAAU,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,UAAU,SAAS,MAAM,IAAI,CAAC,CAAC,CAAC;AAC5E,QAAM,UAAwB,CAAC;AAC/B,QAAM,QAAsB,CAAC;AAE7B,aAAW,gBAAgB,OAAO;AAChC,UAAM,SAAS,MAAM,SAAS,cAAc,MAAM;AAClD,UAAM,OAAO,UAAU,SAAS,MAAM,YAAY,CAAC;AACnD,UAAM,kBAAkB,cAAc,MAAM,MAAM,QAAQ,OAAO;AACjE,UAAM,KAAK,GAAG,gBAAgB,IAAI,CAAC,EAAE,IAAI,KAAK,OAAO,EAAE,MAAM,IAAI,KAAK,EAAE,CAAC;AACzE,YAAQ,KAAK;AAAA,MACX,MAAM;AAAA,MACN,UAAU,eAAe,IAAI;AAAA,MAC7B,SAAS,CAAC,GAAG,IAAI,IAAI,gBAAgB,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK;AAAA,IAClE,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,SAAS,QAAQ,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAAA,IAC1E,OAAO,MAAM;AAAA,MAAK,CAAC,MAAM,UACvB,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG,cAAc,GAAG,MAAM,IAAI,IAAI,MAAM,EAAE,EAAE;AAAA,IACrE;AAAA,EACF;AACF;AAKA,eAAsB,sBACpB,gBACA,aACA,UACA,cAC+D;AAC/D,QAAM,OAAO,QAAQ,cAAc;AACnC,QAAM,kBAAkB,YAAY,IAAI,SAAS,EAAE,KAAK;AACxD,QAAM,UAAU,IAAI,IAAI,eAAe;AACvC,QAAM,UAAU,IAAI,IAAI,aAAa,IAAI,SAAS,CAAC;AACnD,QAAM,mBAAmB,UAAU,WAAW,CAAC,GAAG;AAAA,IAChD,CAAC,WAAW,QAAQ,IAAI,OAAO,IAAI,KAAK,CAAC,QAAQ,IAAI,OAAO,IAAI;AAAA,EAClE;AACA,QAAM,iBAAiB,UAAU,SAAS,CAAC,GAAG;AAAA,IAC5C,CAAC,SAAS,QAAQ,IAAI,KAAK,IAAI,KAAK,QAAQ,IAAI,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,IAAI;AAAA,EACpF;AACA,QAAM,UAAU,CAAC,GAAG,eAAe;AACnC,QAAM,QAAQ,CAAC,GAAG,aAAa;AAE/B,aAAW,QAAQ,iBAAiB;AAClC,QAAI,CAAC,QAAQ,IAAI,IAAI,EAAG;AACxB,UAAM,SAAS,MAAM,SAAS,KAAK,MAAM,IAAI,GAAG,MAAM;AACtD,UAAM,kBAAkB,cAAc,MAAM,MAAM,QAAQ,OAAO;AACjE,UAAM,KAAK,GAAG,gBAAgB,IAAI,CAAC,EAAE,IAAI,KAAK,OAAO,EAAE,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;AAC/E,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,UAAU,eAAe,IAAI;AAAA,MAC7B,SAAS,CAAC,GAAG,IAAI,IAAI,gBAAgB,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK;AAAA,IAClE,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,KAAK;AAAA,MACH,SAAS,QAAQ,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAAA,MAC1E,OAAO,MAAM;AAAA,QAAK,CAAC,MAAM,UACvB,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG,cAAc,GAAG,MAAM,IAAI,IAAI,MAAM,EAAE,EAAE;AAAA,MACrE;AAAA,IACF;AAAA,IACA,OAAO;AAAA,MACL,WAAW,QAAQ;AAAA,MACnB,aAAa,gBAAgB;AAAA,MAC7B,SAAS,aAAa,QAAQ,QAAQ,SAAS,gBAAgB;AAAA,IACjE;AAAA,EACF;AACF;AAEO,SAAS,SAAS,KAAsB,OAA+B;AAC5E,QAAM,QAAQ,MAAM,SAAS;AAC7B,SAAO,IAAI,MACR,OAAO,CAAC,SAAU,MAAM,OAAO,KAAK,SAAS,UAAU,MAAM,IAAI,IAAI,IAAK,EAC1E,OAAO,CAAC,SAAU,MAAM,KAAK,KAAK,OAAO,UAAU,MAAM,EAAE,IAAI,IAAK,EACpE,MAAM,GAAG,KAAK;AACnB;AAEO,SAAS,WACd,KACA,YACA,YAAmC,QACa;AAChD,QAAM,SAAS,UAAU,UAAU;AACnC,QAAM,QAAQ,IAAI,MAAM,OAAO,CAAC,SAAS;AACvC,QAAI,cAAc,KAAM,QAAO,KAAK,OAAO;AAC3C,QAAI,cAAc,MAAO,QAAO,KAAK,SAAS;AAC9C,WAAO,KAAK,SAAS,UAAU,KAAK,OAAO;AAAA,EAC7C,CAAC;AACD,QAAM,QAAQ,oBAAI,IAAY,CAAC,MAAM,CAAC;AACtC,aAAW,QAAQ,OAAO;AACxB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,IAAI,KAAK,EAAE;AAAA,EACnB;AACA,SAAO;AAAA,IACL,SAAS,IAAI,QAAQ,OAAO,CAAC,WAAW,MAAM,IAAI,OAAO,IAAI,CAAC;AAAA,IAC9D;AAAA,EACF;AACF;AAEA,eAAe,gBAAgB,MAAiC;AAC9D,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,MAAM,KAAK;AACtB,SAAO,MAAM,KAAK;AACpB;AAEA,eAAe,KAAK,WAAmB,OAAgC;AACrE,QAAM,UAAU,MAAM,QAAQ,WAAW,EAAE,eAAe,KAAK,CAAC;AAChE,aAAW,SAAS,SAAS;AAC3B,UAAM,WAAW,KAAK,WAAW,MAAM,IAAI;AAC3C,QAAI,MAAM,YAAY,GAAG;AACvB,UAAI,oBAAoB,IAAI,MAAM,IAAI,EAAG;AACzC,YAAM,KAAK,UAAU,KAAK;AAC1B;AAAA,IACF;AACA,QAAI,CAAC,MAAM,OAAO,EAAG;AACrB,QAAI,CAAC,qBAAqB,IAAI,QAAQ,MAAM,IAAI,CAAC,EAAG;AACpD,UAAM,OAAO,MAAM,KAAK,QAAQ;AAChC,QAAI,KAAK,OAAO,IAAS;AACzB,UAAM,KAAK,QAAQ;AAAA,EACrB;AACF;AAEA,SAAS,eAAe,MAAsC;AAC5D,QAAM,YAAY,QAAQ,IAAI;AAC9B,MAAI,cAAc,MAAO,QAAO;AAChC,SAAO,UAAU,SAAS,IAAI,IAAI,OAAO;AAC3C;AAGA,SAAS,cACP,MACA,MACA,QACA,SACiD;AACjD,MAAI,QAAQ,IAAI,MAAM,OAAO;AAC3B,WAAO,cAAc,MAAM,QAAQ,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,MAAM,SAAkB,EAAE;AAAA,EAC3F;AACA,SAAO,eAAe,MAAM,EAAE,QAAQ,CAAC,cAAc;AACnD,UAAM,KAAK,cAAc,MAAM,MAAM,UAAU,OAAO,OAAO;AAC7D,WAAO,KAAK,CAAC,EAAE,IAAI,MAAM,UAAU,KAAK,CAAC,IAAI,CAAC;AAAA,EAChD,CAAC;AACH;AAGA,IAAM,eAAe,CAAC,IAAI,MAAM;AAShC,SAAS,cAAc,MAAc,QAAgB,SAAgC;AACnF,QAAM,OAAO,IAAI,eACf,WAAW,KAAK,CAAC,cAAc,QAAQ,IAAI,SAAS,CAAC,KAAK;AAC5D,QAAM,aAAa,CAAC,SAAiB,KAAK,GAAG,IAAI,OAAO,GAAG,IAAI,cAAc;AAC7E,QAAM,aAAa,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE;AAC9C,QAAM,UAAoB,CAAC;AAC3B,aAAW,aAAa,qBAAqB,MAAM,GAAG;AACpD,UAAM,QAAQ,UAAU,SAAS,UAAU,OAAO,MAAM,GAAG,IAAI,CAAC;AAChE,QAAI;AACJ,QAAI,UAAU,QAAQ,GAAG;AACvB,YAAM,KAAK,UAAU,QAAQ;AAC7B,UAAI,KAAK,WAAW,OAAQ;AAC5B,cAAQ,CAAC,CAAC,GAAG,WAAW,MAAM,GAAG,WAAW,SAAS,EAAE,GAAG,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,IAC/E,OAAO;AACL,cAAQ,aAAa,IAAI,CAAC,WAAW,GAAG,MAAM,GAAG,MAAM,KAAK,GAAG,CAAC,EAAE;AAAA,IACpE;AACA,eAAW,QAAQ,OAAO;AACxB,YAAM,SAAS,OAAO,GAAG,IAAI,MAAM;AAEnC,YAAM,SAAS,MAAM,SAAS,IAAI,WAAW,IAAI,IAAI,KAAK,GAAG,MAAM,aAAa;AAChF,YAAM,aAAa,UAAU,MAAM,QAAQ,CAAC,SAAS,WAAW,GAAG,MAAM,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC;AACzF,UAAI,CAAC,UAAU,WAAW,WAAW,EAAG;AACxC,cAAQ,KAAK,GAAG,UAAU;AAC1B,UAAI,UAAU,WAAW,SAAS,KAAK,IAAI,GAAG,UAAU,MAAM,MAAM,EAAG,SAAQ,KAAK,MAAM;AAC1F;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,OAAO,CAAC,WAAW,WAAW,IAAI;AACjE;AAEA,SAAS,eAAe,QAAoE;AAC1F,QAAM,UAA8D,CAAC;AAGrE,QAAM,WAAW,OAAO,QAAQ,qBAAqB,GAAG,EAAE,QAAQ,uBAAuB,KAAK;AAC9F,QAAM,eAAe;AACrB,QAAM,aAAa;AACnB,QAAM,gBAAgB;AAEtB,aAAW,SAAS,SAAS,SAAS,YAAY,GAAG;AACnD,QAAI,MAAM,CAAC,EAAG,SAAQ,KAAK,EAAE,OAAO,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC;AAAA,EAChE;AACA,aAAW,SAAS,SAAS,SAAS,UAAU,GAAG;AACjD,QAAI,MAAM,CAAC,EAAG,SAAQ,KAAK,EAAE,OAAO,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC;AAAA,EAChE;AACA,aAAW,SAAS,SAAS,SAAS,aAAa,GAAG;AACpD,QAAI,MAAM,CAAC,EAAG,SAAQ,KAAK,EAAE,OAAO,MAAM,CAAC,GAAG,MAAM,iBAAiB,CAAC;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,cACP,MACA,MACA,WACA,SACe;AACf,MAAI,CAAC,UAAU,WAAW,GAAG,EAAG,QAAO;AACvC,QAAM,OAAO,UAAU,SAAS,MAAM,QAAQ,MAAM,QAAQ,IAAI,GAAG,SAAS,CAAC,CAAC;AAK9E,QAAM,OAAO,KAAK,QAAQ,uBAAuB,EAAE;AACnD,QAAM,QAAQ,SAAS,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI;AAClD,QAAM,aAAa,MAAM,QAAQ,CAAC,MAAM;AAAA,IACtC;AAAA,IACA,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,IACJ,GAAG,CAAC;AAAA,EACN,CAAC;AACD,SAAO,WAAW,KAAK,CAAC,cAAc,QAAQ,IAAI,SAAS,CAAC,KAAK;AACnE;AAEA,SAAS,UAAU,MAAsB;AACvC,SAAO,KAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,SAAS,EAAE;AACrD;;;AC1QA,SAAS,kBAAkB;AAE3B,SAAS,YAAAA,WAAU,QAAAC,aAAY;AAC/B,SAAS,QAAAC,OAAM,WAAAC,gBAAe;;;ACH9B,SAAS,SAAAC,QAAO,YAAAC,iBAAgB;AAChC,SAAS,WAAAC,UAAS,WAAAC,UAAS,QAAAC,OAAM,WAAAC,gBAAe;;;ACDhD,SAAS,OAAO,YAAAC,iBAAgB;AAChC,SAAS,WAAAC,UAAS,QAAAC,OAAM,WAAAC,gBAAe;AACvC,SAAS,SAAS;;;ACWX,IAAM,yBAAyB;;;ADCtC,IAAM,mBAAmB,EAAE,OAAO;AAAA,EAChC,MAAM,EAAE,OAAO;AAAA,EACf,MAAM,EAAE,KAAK,CAAC,YAAY,UAAU,SAAS,aAAa,QAAQ,QAAQ,SAAS,SAAS,CAAC;AAAA,EAC7F,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACxC,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACtC,WAAW,EAAE,OAAO;AAAA,EACpB,UAAU,EAAE,QAAQ;AACtB,CAAC;AAED,IAAM,cAAc,EAAE,OAAO;AAAA,EAC3B,MAAM,EAAE,OAAO;AAAA,EACf,MAAM,EAAE,OAAO;AAAA,EACf,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACnC,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,EAC7B,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,EAC7B,UAAU,EAAE,OAAO;AAAA,EACnB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACpC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,EAC3B,aAAa,EAAE,MAAM,gBAAgB,EAAE,SAAS;AAAA,EAChD,SAAS,EAAE,OAAO;AAAA,EAClB,WAAW,EAAE,OAAO;AACtB,CAAC;AAED,IAAM,iBAAiB,EAAE,OAAO;AAAA,EAC9B,SAAS,EAAE,QAAQ,sBAAsB;AAAA,EACzC,aAAa,EAAE,OAAO;AAAA,EACtB,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,WAAW;AAC3C,CAAC;AAEM,IAAM,aAAN,MAAiB;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,iBAAiB,QAAQ,IAAI,GAAG;AAC1C,SAAK,iBAAiBC,SAAQ,cAAc;AAC5C,SAAK,iBAAiBC,MAAK,KAAK,gBAAgB,cAAc,OAAO;AACrE,SAAK,eAAeA,MAAK,KAAK,gBAAgB,YAAY;AAAA,EAC5D;AAAA;AAAA,EAGA,MAAM,OAA+B;AACnC,QAAI;AACF,YAAM,MAAM,MAAMC,UAAS,KAAK,cAAc,MAAM;AACpD,YAAM,SAAS,eAAe,UAAU,KAAK,MAAM,GAAG,CAAC;AACvD,UAAI,CAAC,OAAO,QAAS,QAAO,cAAc;AAE1C,aAAO,OAAO;AAAA,IAChB,SAAS,OAAO;AACd,UAAK,MAAgC,SAAS,SAAU,QAAO,cAAc;AAE7E,aAAO,cAAc;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,MAAM,MAAM,UAAwC;AAClD,UAAM,uBAAuB,KAAK,gBAAgBC,SAAQ,KAAK,YAAY,CAAC;AAC5E,UAAM,MAAM,KAAK,gBAAgB,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AACjE,UAAM,YAAY,KAAK,cAAc,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAAA,CAAI;AAAA,EAC/E;AACF;AAEO,SAAS,gBAA+B;AAC7C,SAAO,EAAE,SAAS,wBAAwB,cAAa,oBAAI,KAAK,CAAC,GAAE,YAAY,GAAG,SAAS,CAAC,EAAE;AAChG;;;ADlEA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB,oBAAI,IAAI,CAAC,OAAO,QAAQ,OAAO,QAAQ,QAAQ,QAAQ,KAAK,CAAC;AAevF,eAAsB,oBACpB,iBAAiB,QAAQ,IAAI,GAC7B,kBACmC;AACnC,QAAM,OAAOC,SAAQ,cAAc;AACnC,QAAM,WAAW,oBAAqB,MAAM,IAAI,WAAW,IAAI,EAAE,KAAK;AACtE,MAAI,OAAO,KAAK,SAAS,OAAO,EAAE,WAAW,GAAG;AAC9C,UAAM,MAAM,MAAM,qBAAqB,IAAI;AAC3C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,EAAE,WAAW,IAAI,QAAQ,QAAQ,aAAa,GAAG,SAAS,KAAK;AAAA,MACtE,QAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO,yBAAyB,MAAM,QAAQ;AAChD;AAEA,eAAsB,yBACpB,gBACA,UACmC;AACnC,QAAM,OAAOA,SAAQ,cAAc;AACnC,QAAM,OAAOC,MAAK,MAAM,cAAc,SAAS,mBAAmB;AAClE,QAAM,gBAAgB,aAAa,QAAQ;AAC3C,QAAM,eAAe,OAAO,KAAK,aAAa,EAAE,KAAK;AACrD,QAAM,SAAS,MAAM,UAAU,IAAI;AACnC,QAAM,cAAc,SAAS,OAAO,KAAK,OAAO,YAAY,EAAE,KAAK,IAAI,CAAC;AACxE,QAAM,iBAAiB,YAAY,KAAK,IAAI,MAAM,aAAa,KAAK,IAAI;AACxE,QAAM,eACJ,CAAC,UAAU,iBACP,eACA,aAAa;AAAA,IACX,CAAC,eAAe,OAAO,aAAa,UAAU,MAAM,cAAc,UAAU;AAAA,EAC9E;AAEN,MAAI,UAAU,aAAa,WAAW,GAAG;AACvC,WAAO;AAAA,MACL,KAAK,OAAO;AAAA,MACZ,OAAO,EAAE,WAAW,GAAG,aAAa,OAAO,IAAI,QAAQ,QAAQ,SAAS,MAAM;AAAA,MAC9E,QAAQ;AAAA,IACV;AAAA,EACF;AAEA,QAAM,UAAU,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA,iBAAiB,OAAQ,QAAQ,OAAO;AAAA,IACxC;AAAA,EACF;AACA,QAAM,OAA0B;AAAA,IAC9B,SAAS;AAAA,IACT,aAAa,SAAS;AAAA,IACtB,cAAc;AAAA,IACd,KAAK,QAAQ;AAAA,EACf;AACA,QAAM,uBAAuB,MAAMC,SAAQ,IAAI,CAAC;AAChD,QAAMC,OAAMD,SAAQ,IAAI,GAAG,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AAC3D,QAAM,YAAY,MAAM,GAAG,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC;AAAA,CAAI;AAC5D,SAAO,EAAE,GAAG,SAAS,QAAQ,kBAAkB,CAAC,SAAS,YAAY,cAAc;AACrF;AAEA,eAAe,UAAU,MAAiD;AACxE,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,MAAME,UAAS,MAAM,MAAM,CAAC;AACtD,QAAI,OAAO,YAAY,iBAAiB,CAAC,OAAO,OAAO,CAAC,OAAO,aAAc,QAAO;AACpF,QAAI,CAAC,MAAM,QAAQ,OAAO,IAAI,OAAO,KAAK,CAAC,MAAM,QAAQ,OAAO,IAAI,KAAK,EAAG,QAAO;AACnF,QACE,CAAC,OAAO,IAAI,QAAQ;AAAA,MAClB,CAAC,WACC,UACA,OAAO,OAAO,SAAS,YACvB,OAAO,OAAO,aAAa,YAC3B,MAAM,QAAQ,OAAO,OAAO;AAAA,IAChC,KACA,CAAC,OAAO,IAAI,MAAM;AAAA,MAChB,CAAC,SAAS,QAAQ,OAAO,KAAK,SAAS,YAAY,OAAO,KAAK,OAAO;AAAA,IACxE,GACA;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,aAAa,UAAiD;AACrE,SAAO,OAAO;AAAA,IACZ,OAAO,OAAO,SAAS,OAAO,EAC3B,OAAO,CAAC,UAAU,kBAAkB,IAAIC,SAAQ,MAAM,IAAI,EAAE,YAAY,CAAC,CAAC,EAC1E,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,IAAI,CAAC;AAAA,EAC5C;AACF;;;AGxHA,SAAS,aAAa;AACtB,SAAS,WAAAC,gBAAe;AACxB,SAAS,WAAAC,UAAS,QAAAC,OAAM,YAAAC,WAAU,WAAW;;;ACF7C,SAAS,WAAAC,gBAAe;AAUxB,IAAM,wBAAgD;AAAA,EACpD,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,SAAS;AAAA,EACT,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AACV;AAGO,IAAMC,wBAAuB,IAAI,IAAI,OAAO,KAAK,qBAAqB,CAAC;AAE9E,IAAM,iBAAiB,oBAAI,IAAI,CAAC,MAAM,OAAO,MAAM,KAAK,CAAC;AACzD,IAAM,eAAe;AACrB,IAAM,sBAAsB;AAErB,SAAS,YAAY,MAAsB;AAChD,SAAO,sBAAsBC,SAAQ,IAAI,EAAE,YAAY,CAAC,KAAK;AAC/D;AASO,SAAS,gBAAgB,MAAc,SAA8B;AAC1E,QAAM,WAAW,YAAY,IAAI;AACjC,QAAM,QAAQ,WAAW,OAAO;AAChC,QAAM,UAAU,eAAe,IAAI,QAAQ,IACvC,eAAe,OAAO,IACtB,aAAa,OACX,kBAAkB,OAAO,IACzB,CAAC;AACP,QAAM,UAAU,eAAe,UAAU,OAAO,SAAS,OAAO;AAChE,SAAO,EAAE,UAAU,OAAO,SAAS,QAAQ;AAC7C;AAEA,SAAS,WAAW,SAAyB;AAC3C,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,SAAO,QAAQ,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,MAAM,IAAI,EAAE;AACnE;AAOO,SAAS,eAAe,SAA2B;AACxD,QAAM,QAAkB,CAAC;AACzB,QAAM,OAAO,CAAC,SAA6B;AACzC,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,WAAW,qBAAqB,KAAK,OAAO,KAAK,CAAC,MAAM,SAAS,OAAO,GAAG;AAC7E,YAAM,KAAK,OAAO;AAAA,IACpB;AAAA,EACF;AAEA,QAAM,cACJ;AACF,aAAW,SAAS,QAAQ,SAAS,WAAW,EAAG,MAAK,MAAM,CAAC,CAAC;AAEhE,QAAM,eAAe;AACrB,aAAW,SAAS,QAAQ,SAAS,YAAY,GAAG;AAClD,eAAW,SAAS,MAAM,CAAC,KAAK,IAAI,MAAM,GAAG,GAAG;AAE9C,YAAM,QAAQ,KAAK,SAAS,MAAM,IAAI,KAAK,MAAM,MAAM,EAAE,IAAI,IAAI;AACjE,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,SAAO,MAAM,MAAM,GAAG,YAAY;AACpC;AAGA,SAAS,kBAAkB,SAA2B;AACpD,SAAO,mBAAmB,SAAS,MAAM,EACtC,OAAO,CAAC,WAAW,OAAO,YAAY,OAAO,SAAS,QAAQ,EAC9D,IAAI,CAAC,WAAW,OAAO,IAAI,EAC3B,MAAM,GAAG,YAAY;AAC1B;AAEA,SAAS,eACP,UACA,OACA,SACA,SACQ;AACR,QAAM,OAAO,GAAG,QAAQ,WAAM,KAAK,QAAQ,UAAU,IAAI,KAAK,GAAG;AACjE,MAAI,QAAQ,SAAS,EAAG,QAAO,GAAG,IAAI,mBAAc,QAAQ,KAAK,IAAI,CAAC;AACtE,QAAM,UAAU,eAAe,OAAO;AACtC,MAAI,QAAS,QAAO,GAAG,IAAI,WAAM,OAAO;AACxC,SAAO;AACT;AAGA,SAAS,eAAe,SAAgC;AACtD,aAAW,OAAO,QAAQ,MAAM,OAAO,GAAG;AACxC,UAAM,OAAO,IAAI,KAAK;AACtB,QAAI,SAAS,GAAI;AACjB,UAAM,WAAW,KACd,QAAQ,UAAU,EAAE,EACpB,QAAQ,UAAU,EAAE,EACpB,QAAQ,UAAU,EAAE,EACpB,QAAQ,UAAU,EAAE,EACpB,KAAK;AACR,QACE,KAAK,WAAW,IAAI,KACpB,KAAK,WAAW,IAAI,KACpB,KAAK,WAAW,GAAG,KACnB,KAAK,WAAW,GAAG,GACnB;AACA,UAAI,SAAU,QAAO,SAAS,UAAU,mBAAmB;AAC3D;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,SAAS,OAAe,KAAqB;AACpD,SAAO,MAAM,UAAU,MAAM,QAAQ,GAAG,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC;AACjE;;;ADtIA,IAAM,+BAA+B,oBAAI,IAAI;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,eAAsB,mBAAmB,gBAA2C;AAClF,QAAM,UAAU,MAAM,aAAa,cAAc;AACjD,QAAM,QAAQ,WAAY,MAAM,UAAU,cAAc;AACxD,SAAO,MACJ,IAAIC,UAAS,EACb,OAAO,CAAC,SAAS,CAAC,KAAK,WAAW,aAAa,KAAK,CAAC,KAAK,WAAW,eAAe,CAAC,EACrF,OAAO,CAAC,SAASC,sBAAqB,IAAIC,SAAQ,IAAI,EAAE,YAAY,CAAC,CAAC,EACtE,KAAK;AACV;AAGA,eAAe,aAAa,gBAAkD;AAG5E,QAAM,SAAS,MAAM,OAAO,gBAAgB;AAAA,IAC1C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,SAAO,OAAO,OAAO,MAAM,IAAI,EAAE,OAAO,OAAO;AACjD;AAEA,eAAe,UAAU,MAAiC;AACxD,QAAM,QAAkB,CAAC;AACzB,QAAMC,QAAO,OAAO,cAAqC;AACvD,UAAM,UAAU,MAAMC,SAAQ,WAAW,EAAE,eAAe,KAAK,CAAC;AAChE,eAAW,SAAS,SAAS;AAC3B,YAAM,WAAWC,MAAK,WAAW,MAAM,IAAI;AAC3C,UAAI,MAAM,YAAY,GAAG;AACvB,YAAI,6BAA6B,IAAI,MAAM,IAAI,EAAG;AAClD,cAAMF,MAAK,QAAQ;AACnB;AAAA,MACF;AACA,UAAI,MAAM,OAAO,EAAG,OAAM,KAAKG,UAAS,MAAM,QAAQ,CAAC;AAAA,IACzD;AAAA,EACF;AACA,QAAMH,MAAK,IAAI;AACf,SAAO;AACT;AAEA,SAAS,OACP,KACA,MAC2D;AAC3D,SAAO,IAAI,QAAQ,CAAC,kBAAkB;AACpC,UAAM,QAAQ,MAAM,OAAO,MAAM,EAAE,KAAK,OAAO,CAAC,UAAU,QAAQ,MAAM,EAAE,CAAC;AAC3E,QAAI,SAAS;AACb,QAAI,SAAS;AAEb,UAAM,OAAO,YAAY,MAAM;AAC/B,UAAM,OAAO,GAAG,QAAQ,CAACI,WAAU;AACjC,gBAAU,OAAOA,MAAK;AAAA,IACxB,CAAC;AACD,UAAM,OAAO,GAAG,QAAQ,CAACA,WAAU;AACjC,gBAAU,OAAOA,MAAK;AAAA,IACxB,CAAC;AAED,UAAM,GAAG,SAAS,MAAM,cAAc,EAAE,MAAM,IAAI,QAAQ,IAAI,QAAQ,kBAAkB,CAAC,CAAC;AAC1F,UAAM,GAAG,SAAS,CAAC,SAAS,cAAc,EAAE,MAAM,QAAQ,GAAG,QAAQ,OAAO,CAAC,CAAC;AAAA,EAChF,CAAC;AACH;AAGA,SAASP,WAAU,MAAsB;AACvC,UAAQ,QAAQ,OAAO,KAAK,QAAQ,OAAO,GAAG,IAAI,MAAM,QAAQ,SAAS,EAAE;AAC7E;;;AJvEA,IAAM,iBAAiB;AAKvB,IAAM,iBAAiB;AASvB,eAAsB,gBAAgB,UAAwB,CAAC,GAAyB;AACtF,UAAQ,MAAM,aAAa,OAAO,GAAG;AACvC;AAcA,eAAsB,eAAe,gBAA6C;AAChF,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,EAAE,eAAe,CAAC;AAClE,UAAM,QAAQ,OAAO,QAAQ,OAAO,UAAU,OAAO;AACrD,UAAM,WACJ,OAAO,OAAO,SAAS,IACnB,KAAK,OAAO,OAAO,MAAM,qDACzB;AACN,WAAO;AAAA,MACL;AAAA,MACA,SACE,UAAU,IACN,UAAU,OAAO,YAAY,wCAAwC,QAAQ,KAC7E,4CAA4C,OAAO,OAAO,aAAa,OAAO,KAAK,WAAW,OAAO,OAAO,aAAa,OAAO,YAAY,YAAY,QAAQ;AAAA,IACxK;AAAA,EACF,SAAS,OAAO;AACd,WAAO;AAAA,MACL,UAAU,cAAc;AAAA,MACxB,SAAS,kCAAmC,MAAgB,OAAO;AAAA,IACrE;AAAA,EACF;AACF;AAIA,IAAM,SAAS,oBAAI,IAA8B;AAGjD,SAAS,aACP,SAC2D;AAC3D,QAAM,MAAMQ,SAAQ,QAAQ,kBAAkB,QAAQ,IAAI,CAAC;AAC3D,QAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,QAAQ,QAAQ,GAC9C,MAAM,MAAM,MAAS,EACrB,KAAK,MAAM,aAAa,OAAO,CAAC;AACnC,SAAO,IAAI,KAAK,IAAI;AACpB,OAAK,KACF,QAAQ,MAAM;AACb,QAAI,OAAO,IAAI,GAAG,MAAM,KAAM,QAAO,OAAO,GAAG;AAAA,EACjD,CAAC,EACA,MAAM,MAAM,MAAS;AACxB,SAAO;AACT;AAEA,eAAe,aACb,SAC2D;AAC3D,QAAM,QAAQ,KAAK,IAAI;AACvB,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,QAAM,iBAAiBA,SAAQ,QAAQ,kBAAkB,QAAQ,IAAI,CAAC;AACtE,QAAM,QAAQ,IAAI,WAAW,cAAc;AAE3C,QAAM,CAAC,OAAO,QAAQ,IAAI,MAAM,QAAQ,IAAI,CAAC,mBAAmB,cAAc,GAAG,MAAM,KAAK,CAAC,CAAC;AAE9F,QAAM,UAAsC,CAAC;AAC7C,QAAM,SAAuB,CAAC;AAC9B,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,YAAY;AAChB,MAAI,UAAU;AAEd,MAAI,QAAQ,SAAS,gBAAgB,cAAc,EAAE;AAErD,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,YAAM,OAAO,MAAMC,MAAKC,MAAK,gBAAgB,IAAI,CAAC;AAClD,UAAI,CAAC,KAAK,OAAO,EAAG;AACpB,UAAI,KAAK,OAAO,gBAAgB;AAC9B;AACA;AAAA,MACF;AAEA,YAAM,WAAW,SAAS,QAAQ,IAAI;AACtC,UAAI,CAAC,QAAQ,QAAQ,YAAY,cAAc,UAAU,IAAI,GAAG;AAC9D,gBAAQ,IAAI,IAAI;AAChB;AACA;AAAA,MACF;AAEA,YAAM,UAAU,MAAMC,UAASD,MAAK,gBAAgB,IAAI,GAAG,MAAM;AACjE,YAAM,OAAO,YAAY,OAAO;AAChC,YAAM,WAAW,gBAAgB,IAAI;AACrC,cAAQ;AAER,UAAI,CAAC,QAAQ,QAAQ,YAAY,SAAS,SAAS,MAAM;AACvD,cAAM,EAAE,SAAS,QAAQ,SAAS,QAAQ,GAAG,KAAK,IAAI;AACtD,gBAAQ,IAAI,IAAI,EAAE,GAAG,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS;AACxD;AACA;AAAA,MACF;AAEA,YAAM,EAAE,UAAU,OAAO,SAAS,QAAQ,IAAI,gBAAgB,MAAM,OAAO;AAC3E,YAAM,cAAc,gBAAgB,IAAI,IAAI,mBAAmB,SAAS,IAAI,IAAI,CAAC;AACjF,cAAQ,IAAI,IAAI;AAAA,QACd;AAAA,QACA;AAAA,QACA,MAAM,KAAK;AAAA,QACX,GAAG;AAAA,QACH;AAAA,QACA;AAAA,QACA;AAAA,QACA,GAAI,YAAY,SAAS,IAAI,EAAE,YAAY,IAAI,CAAC;AAAA,QAChD;AAAA,QACA,WAAW,IAAI,EAAE,YAAY;AAAA,MAC/B;AACA,UAAI,SAAU;AAAA,UACT;AAAA,IACP,SAAS,OAAO;AACd,aAAO,KAAK,EAAE,MAAM,OAAQ,MAAgB,QAAQ,CAAC;AACrD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,OAAO,KAAK,SAAS,OAAO,EAAE,OAAO,CAAC,SAAS,EAAE,QAAQ,QAAQ,EAAE;AAEnF,QAAM,WAA0B;AAAA,IAC9B,SAAS;AAAA,IACT,aAAa,IAAI,EAAE,YAAY;AAAA,IAC/B,SAAS,YAAY,OAAO;AAAA,EAC9B;AACA,MAAI,SAAS,UAAU,EAAG,OAAM,MAAM,MAAM,QAAQ;AACpD,QAAM,eAAe,MAAM,yBAAyB,gBAAgB,QAAQ;AAE5E,QAAM,SAAsB;AAAA,IAC1B,SAAS,MAAM;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,KAAK,IAAI,IAAI;AAAA,IACzB,cAAc,OAAO,KAAK,OAAO,EAAE;AAAA,IACnC,cAAc;AAAA,MACZ,QAAQ,aAAa;AAAA,MACrB,WAAW,aAAa,MAAM;AAAA,MAC9B,aAAa,aAAa,MAAM;AAAA,IAClC;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,SAAS;AAC5B;AAEA,SAAS,cAAc,OAAmB,MAAsB;AAC9D,SACE,MAAM,YAAY,UAClB,MAAM,SAAS,KAAK,QACpB,MAAM,YAAY,KAAK,WACvB,MAAM,YAAY,KAAK;AAE3B;AAGA,SAAS,gBAAgB,MAAqD;AAC5E,MAAI,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,SAAS,KAAK,OAAO,IAAI,eAAgB,QAAO,CAAC;AAChF,SAAO,EAAE,SAAS,KAAK,SAAS,SAAS,KAAK,QAAQ;AACxD;AAEO,SAAS,YAAY,SAAyB;AACnD,SAAO,WAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;AAEA,SAAS,YAAY,SAAiE;AACpF,SAAO,OAAO;AAAA,IACZ,OAAO,KAAK,OAAO,EAChB,KAAK,EACL,IAAI,CAAC,QAAQ,CAAC,KAAK,QAAQ,GAAG,CAAe,CAAC;AAAA,EACnD;AACF;;;AMpOA,SAAS,gBAAgB;AACzB,SAAS,SAAAE,QAAO,SAAS,YAAAC,WAAU,IAAI,QAAAC,OAAM,cAAc;AAC3D,SAAS,cAAc;AACvB,SAAS,WAAAC,UAAS,QAAAC,OAAM,YAAAC,WAAU,WAAAC,UAAS,OAAAC,YAAW;AACtD,SAAS,iBAAiB;;;ACJ1B,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,YAAAC,iBAAgB;AAIzB,IAAM,SAAS,CAAC,UAAkBC,YAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAGjF,eAAsB,yBACpB,MACA,UACe;AACf,QAAM;AAAA,IACJ,GAAG,IAAI;AAAA,IACP,KAAK,UAAU;AAAA,MACb,SAAS;AAAA,MACT,WAAW,OAAO,MAAMC,UAAS,MAAM,MAAM,CAAC;AAAA,MAC9C,SAAS,OAAO;AAAA,QACd,OAAO,OAAO,SAAS,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,IAAI,CAAC;AAAA,MACzE;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAGA,eAAsB,wBACpB,MACwC;AACxC,MAAI;AACJ,MAAI;AACF,UAAM,MAAMA,UAAS,GAAG,IAAI,iBAAiB,MAAM;AAAA,EACrD,SAAS,OAAO;AACd,WAAQ,MAAgC,SAAS,WAAW,OAAO,CAAC;AAAA,EACtE;AACA,MAAI;AACF,UAAM,WAAW,KAAK,MAAM,GAAG;AAC/B,QACE,SAAS,YAAY,KACrB,SAAS,cAAc,OAAO,MAAMA,UAAS,MAAM,MAAM,CAAC,KAC1D,CAAC,SAAS,WACV,OAAO,SAAS,YAAY,YAC5B,MAAM,QAAQ,SAAS,OAAO;AAE9B,aAAO,CAAC;AACV,WAAO,OAAO;AAAA,MACZ,OAAO,QAAQ,SAAS,OAAO,EAAE;AAAA,QAC/B,CAAC,UAAqC,OAAO,MAAM,CAAC,MAAM;AAAA,MAC5D;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;;;AD3CA,IAAM,gBAAgB,UAAU,QAAQ;AAkCxC,IAAM,qBAAqB;AAG3B,eAAsB,cAAc,SAA6D;AAC/F,QAAM,MAAM,QAAQ,OAAO;AAC3B,MAAI,YAAY,MAAM,aAAa,KAAK,YAAY,CAAC,WAAW,GAAG,QAAQ,cAAc;AACzF,MAAI,YAAY;AAEhB,MAAI,CAAC,WAAW;AACd,UAAM,aAAa;AAAA,MACjB,CAAC,MAAM,CAAC,QAAQ,WAAW,WAAW,CAAC;AAAA,MACvC,CAAC,QAAQ,CAAC,WAAW,WAAW,CAAC;AAAA,MACjC,CAAC,UAAU,CAAC,MAAM,OAAO,WAAW,UAAU,WAAW,CAAC;AAAA,IAC5D;AACA,eAAW,CAAC,SAAS,IAAI,KAAK,YAAY;AACxC,UAAI;AACF,cAAM,IAAI,SAAS,CAAC,GAAG,IAAI,GAAG,QAAQ,cAAc;AACpD,oBAAY,MAAM,aAAa,KAAK,YAAY,CAAC,WAAW,GAAG,QAAQ,cAAc;AACrF,YAAI,WAAW;AACb,sBAAY;AACZ;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,MACL,WAAW;AAAA,MACX;AAAA,MACA,WAAW;AAAA,MACX,WAAW;AAAA,MACX,SACE;AAAA,IACJ;AAAA,EACF;AAEA,MAAI;AACF,UAAM,IAAI,YAAY,CAAC,SAAS,GAAG,QAAQ,cAAc,EAAE,MAAM,MAAM,MAAS;AAChF,UAAM,QAAQ,MAAM,sBAAsB,EAAE,gBAAgB,QAAQ,gBAAgB,IAAI,CAAC;AACzF,WAAO;AAAA,MACL,WAAW;AAAA,MACX;AAAA,MACA,WAAW;AAAA,MACX,WAAW,MAAM;AAAA,MACjB,SAAS,6BAA6B,MAAM,KAAK,WAAW,MAAM,KAAK;AAAA,IACzE;AAAA,EACF,SAAS,OAAO;AACd,WAAO;AAAA,MACL,WAAW;AAAA,MACX;AAAA,MACA,WAAW;AAAA,MACX,WAAW;AAAA,MACX,SAAS,+DAAgE,MAAgB,OAAO;AAAA,IAClG;AAAA,EACF;AACF;AAEA,eAAe,aACb,KACA,SACA,MACA,KACkB;AAClB,MAAI;AACF,UAAM,IAAI,SAAS,MAAM,GAAG;AAC5B,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,WACb,SACA,MACA,KAC6C;AAC7C,SAAO,cAAc,SAAS,MAAM,EAAE,IAAI,CAAC;AAC7C;AAEA,eAAsB,oBACpB,gBACA,YAAY,oBACM;AAClB,MAAI;AACF,UAAM,SAAS,MAAM,cAAc,iBAAiB,gBAAgB,SAAS,CAAC;AAC9E,WAAO,OAAO,QAAQ;AAAA,EACxB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAMA,eAAsB,sBACpB,SACiC;AACjC,QAAM,MAAM,QAAQ,OAAO;AAC3B,QAAM,iBAAiBC,SAAQ,QAAQ,cAAc;AACrD,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,cAAc,iBAAiB,gBAAgB,SAAS;AAC9D,QAAMC,OAAMC,SAAQ,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AACrD,QAAM,8BAA8BA,SAAQ,WAAW,CAAC;AAExD,QAAM,EAAE,UAAU,eAAe,IAAI,MAAM,eAAe,cAAc;AACxE,QAAM,UAAU,MAAM,uBAAuB,WAAW;AACxD,QAAM,gBAAgB,cAAc;AACpC,MAAI,WAAW,eAAe;AAC5B,UAAM,SAAS,MAAMC,UAAS,aAAa,MAAM;AACjD,UAAM,aAAa,MAAMC,MAAK,WAAW;AACzC,QAAI;AACF,YAAM,IAAI,YAAY,CAAC,UAAU,gBAAgB,WAAW,cAAc,GAAG,cAAc;AAC3F,YAAM,UAAU,MAAM,cAAc,WAAW;AAC/C,YAAM,yBAAyB,aAAa,cAAc;AAC1D,aAAO,EAAE,WAAW,WAAW,MAAM,GAAG,QAAQ;AAAA,IAClD,SAAS,OAAO;AACd,YAAM,YAAY,aAAa,MAAM;AACrC,YAAM,OAAO,aAAa,WAAW,OAAO,WAAW,KAAK;AAC5D,YAAM,IAAI;AAAA,QACR,6DAA8D,MAAgB,OAAO;AAAA,MACvF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAAc,MAAM,QAAQC,MAAK,OAAO,GAAG,qBAAqB,CAAC;AACvE,MAAI;AACF,UAAM;AAAA,MACJ;AAAA,MACA,CAAC,WAAW,gBAAgB,SAAS,aAAa,eAAe,cAAc;AAAA,MAC/E;AAAA,IACF;AACA,UAAM,aAAaA,MAAK,aAAa,kBAAkB;AACvD,UAAM,SAAS,MAAM,cAAc,UAAU;AAC7C,UAAM,YAAY,aAAa,MAAMF,UAAS,YAAY,MAAM,CAAC;AACjE,UAAM,yBAAyB,aAAa,cAAc;AAC1D,WAAO,EAAE,WAAW,WAAW,MAAM,GAAG,OAAO;AAAA,EACjD,UAAE;AACA,UAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EACxD;AACF;AAOA,eAAe,8BAA8B,WAAkC;AAC7E,QAAM,OAAOE,MAAK,WAAW,YAAY;AACzC,MAAI;AACF,UAAMD,MAAK,IAAI;AAAA,EACjB,QAAQ;AACN,UAAM,YAAY,MAAM,mEAAmE;AAAA,EAC7F;AACF;AAEA,SAAS,iBAAiB,gBAAwB,WAA2B;AAC3E,QAAM,WAAWJ,SAAQ,gBAAgB,SAAS;AAClD,QAAM,eAAeM,UAAS,gBAAgB,QAAQ;AACtD,MAAI,iBAAiB,MAAM,iBAAiB,QAAQ,aAAa,WAAW,KAAKC,IAAG,EAAE,GAAG;AACvF,UAAM,IAAI,MAAM,+CAA+C,SAAS,EAAE;AAAA,EAC5E;AACA,SAAO;AACT;AAEA,eAAe,uBACb,MACkD;AAClD,MAAI;AACF,WAAO,MAAM,cAAc,IAAI;AAAA,EACjC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,cAAc,MAAyD;AACpF,QAAM,OAAO,MAAMH,MAAK,IAAI;AAC5B,MAAI,CAAC,KAAK,OAAO,KAAK,KAAK,SAAS;AAClC,UAAM,IAAI,MAAM,uCAAuC,IAAI,EAAE;AAC/D,QAAM,MAAM,KAAK,MAAM,MAAMD,UAAS,MAAM,MAAM,CAAC;AACnD,QAAM,QAAQ,YAAY,IAAI,SAAS,IAAI,QAAQ;AACnD,QAAM,QAAQ,YAAY,IAAI,SAAS,IAAI,SAAS,IAAI,aAAa;AACrE,MAAI,UAAU,EAAG,OAAM,IAAI,MAAM,qCAAqC,IAAI,EAAE;AAC5E,SAAO,EAAE,OAAO,MAAM;AACxB;AAEA,SAAS,YAAY,OAAwB;AAC3C,SAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,SAAS;AAC/C;;;AE1OA,SAAS,SAAAK,QAAO,YAAAC,kBAAgB;AAChC,SAAS,WAAAC,UAAS,QAAAC,aAAY;;;ACD9B,SAAS,YAAAC,WAAU,UAAU,QAAAC,aAAY;AACzC,SAAS,cAAAC,aAAY,QAAAC,OAAM,YAAAC,iBAAgB;;;ACD3C,SAAS,YAAAC,iBAAgB;AACzB,SAAS,YAAY,YAAAC,WAAU,WAAAC,gBAAe;AAW9C,IAAM,2BAA2B,oBAAI,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAOD,IAAM,oBAAoB,oBAAI,IAAI;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAID,IAAM,8BAA8B,oBAAI,IAAI;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,mBAAmB;AAGzB,eAAsB,gBACpB,WACA,iBAAiB,QAAQ,IAAI,GACH;AAC1B,QAAM,MAAM,KAAK,MAAM,MAAMF,UAAS,WAAW,MAAM,CAAC;AACxD,QAAM,QAAQ,YAAY,IAAI,SAAS,IAAI,QAAQ;AACnD,QAAM,QAAQ,YAAY,IAAI,SAAS,IAAI,SAAS,IAAI,aAAa;AACrE,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,aAAa,oBAAI,IAAoB;AAC3C,QAAM,UAAwB,CAAC;AAE/B,aAAW,QAAQ,OAAO;AACxB,UAAM,KAAK,YAAY,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI;AACvD,UAAM,OAAO,aAAa,MAAM,cAAc;AAC9C,QAAI,CAAC,MAAM,CAAC,KAAM;AAClB,cAAU,IAAI,IAAI,IAAI;AACtB,UAAM,QAAQ,YAAY,KAAK,SAAS,KAAK,IAAI;AAEjD,QAAI,SAAS,UAAU,QAAQ,CAAC,KAAK,SAAS,IAAI,KAAK,EAAE,EAAG,YAAW,IAAI,IAAI,KAAK;AACpF,YAAQ,KAAK,EAAE,MAAM,UAAUG,aAAY,IAAI,GAAG,SAAS,CAAC,EAAE,CAAC;AAAA,EACjE;AAEA,QAAM,cAAc,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,OAAO,IAAI,CAAC;AAChE,QAAM,gBAA8B,CAAC;AACrC,aAAW,QAAQ,OAAO;AACxB,UAAM,WAAW,YAAY,KAAK,YAAY,KAAK,QAAQ,KAAK,IAAI,GAAG,YAAY,KAAK;AACxF,QAAI,YAAY,yBAAyB,IAAI,QAAQ,EAAG;AACxD,QAAI,YAAY,CAAC,4BAA4B,IAAI,QAAQ,KAAK,CAAC,kBAAkB,IAAI,QAAQ;AAC3F;AACF,UAAM,UAAU,aAAa,QAAQ,kBAAkB,IAAI,QAAQ;AACnE,UAAM,iBAAiB,KAAK,QAAQ,KAAK;AACzC,UAAM,iBAAiB,KAAK,MAAM,KAAK;AACvC,UAAM,CAAC,MAAM,IAAI,IAAI,UACjB,CAAC,gBAAgB,cAAc,IAC/B,CAAC,gBAAgB,cAAc;AACnC,UAAM,OAAO,aAAa,MAAM,WAAW,cAAc;AACzD,UAAM,KAAK,aAAa,MAAM,WAAW,cAAc;AACvD,QAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,IAAI,IAAI,KAAK,CAAC,YAAY,IAAI,EAAE,KAAK,SAAS,GAAI;AAEnF,UAAM,SAAS,cAAc,MAAM,UAAU;AAC7C,kBAAc,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,MACA,MAAM,UAAU,SAAS,SAAS,IAAI,mBAAmB;AAAA,MACzD,GAAI,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC;AAAA,IACxC,CAAC;AAAA,EACH;AAEA,QAAM,gBAAgB,CAAC,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,MAAM,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE;AAAA,IAC1F,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI;AAAA,EACrD;AACA,QAAM,cAAc,oBAAI,IAAwB;AAChD,aAAW,QAAQ,eAAe;AAChC,UAAM,MAAM,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE;AACnC,UAAM,WAAW,YAAY,IAAI,GAAG;AACpC,QAAI,CAAC,UAAU;AACb,kBAAY,IAAI,KAAK,IAAI;AACzB;AAAA,IACF;AAGA,UAAM,UAAU,aAAa,SAAS,SAAS,KAAK,OAAO;AAC3D,gBAAY,IAAI,KAAK;AAAA,MACnB,GAAI,SAAS,SAAS,oBAAoB,KAAK,SAAS,WAAW,OAAO;AAAA,MAC1E,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,IAC/B,CAAC;AAAA,EACH;AACA,QAAM,cAAc,CAAC,GAAG,YAAY,OAAO,CAAC,EAAE;AAAA,IAAK,CAAC,MAAM,UACxD,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG,cAAc,GAAG,MAAM,IAAI,IAAI,MAAM,EAAE,EAAE;AAAA,EACrE;AACA,MAAI,cAAc,WAAW,KAAK,YAAY,WAAW,GAAG;AAC1D,UAAM,IAAI,MAAM,yDAAyD,SAAS,EAAE;AAAA,EACtF;AACA,aAAW,UAAU,eAAe;AAClC,WAAO,UAAU,YACd,OAAO,CAAC,SAAS,KAAK,SAAS,OAAO,IAAI,EAC1C,IAAI,CAAC,SAAS,KAAK,EAAE,EACrB,KAAK;AAAA,EACV;AACA,SAAO,EAAE,SAAS,eAAe,OAAO,YAAY;AACtD;AAEA,SAAS,YAAY,OAAkC;AACrD,SAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,OAAO,CAAC,SAAiC,QAAQ,QAAQ,OAAO,SAAS,QAAQ,CAAC,IACxF,CAAC;AACP;AAEA,SAAS,aACP,UACA,WACA,gBACe;AACf,MAAI,OAAO,aAAa;AACtB,WAAO,UAAU,IAAI,QAAQ,KAAK,mBAAmB,UAAU,cAAc;AAC/E,MAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,QAAM,SAAS;AACf,QAAM,KAAK,YAAY,OAAO,MAAM,OAAO,OAAO,OAAO,IAAI;AAC7D,SAAO,UAAU,IAAI,MAAM,EAAE,KAAK,aAAa,QAAQ,cAAc;AACvE;AAEA,SAAS,cAAc,UAAmB,YAAgD;AACxF,MAAI,OAAO,aAAa,SAAU,QAAO,WAAW,IAAI,QAAQ,KAAK;AACrE,MAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,QAAM,KAAK,YAAa,SAA4B,EAAE;AACtD,SAAO,KAAM,WAAW,IAAI,EAAE,KAAK,OAAQ;AAC7C;AAEA,SAAS,aAAa,MAAiB,OAAwC;AAC7E,MAAI,CAAC,QAAQ,CAAC,MAAO,QAAO;AAC5B,SAAO,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAI,QAAQ,CAAC,GAAI,GAAI,SAAS,CAAC,CAAE,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,gBAAgB;AAC3F;AAEA,SAAS,aAAa,MAAsB,gBAAuC;AACjF,QAAM,SAAS,KAAK;AACpB,QAAM,WAAW,KAAK;AACtB,QAAM,YACJ,YAAY,KAAK,QAAQ,KAAK,QAAQ,KAAK,aAAa,KAAK,WAAW,MACvE,UAAU,OAAO,WAAW,WAAW,YAAa,OAA0B,IAAI,IAAI,UACtF,YAAY,OAAO,aAAa,WAC7B,YAAa,SAA4B,QAAS,SAA4B,IAAI,IAClF;AACN,SAAO,YAAY,mBAAmB,WAAW,cAAc,IAAI;AACrE;AAEA,SAAS,mBAAmB,MAAc,gBAAuC;AAC/E,QAAM,WAAW,WAAW,IAAI,IAAID,SAAQ,IAAI,IAAIA,SAAQ,gBAAgB,IAAI;AAChF,QAAM,eAAeD,UAASC,SAAQ,cAAc,GAAG,QAAQ,EAAE,QAAQ,OAAO,GAAG;AACnF,MAAI,iBAAiB,MAAM,iBAAiB,QAAQ,aAAa,WAAW,KAAK,EAAG,QAAO;AAC3F,SAAO,aAAa,QAAQ,SAAS,EAAE;AACzC;AAEA,SAAS,YAAY,OAA+B;AAClD,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ;AACjE;AAEA,SAASC,aAAY,MAAsC;AACzD,MAAI,QAAQ,KAAK,IAAI,EAAG,QAAO;AAC/B,SAAO,UAAU,KAAK,IAAI,IAAI,OAAO;AACvC;;;ACpMA,SAAS,cAAAC,aAAY,YAAAC,WAAU,WAAAC,UAAS,OAAAC,YAAW;AAenD,IAAM,cAAc;AAEpB,IAAM,yBAAyB;AAE/B,IAAM,WAAW;AACjB,IAAM,WAAW;AACjB,IAAM,aACJ;AACF,IAAM,SAAS;AAEf,eAAsB,mBACpB,gBACA,MACA,OACuB;AACvB,QAAM,OAAOC,SAAQ,cAAc;AACnC,QAAM,QAA4C,CAAC;AACnD,QAAM,MAAM,CAAC,KAAa,MAA0B,MAA0B,OAAe;AAC3F,UAAM,OAAO,cAAc,MAAM,KAAK,KAAK;AAC3C,QAAI,KAAM,OAAM,KAAK,EAAE,MAAM,MAAM,OAAO,OAAO,IAAI,IAAI,MAAM,MAAM,GAAG,CAAC;AAAA,EAC3E;AACA,aAAW,SAAS,KAAK,SAAS,QAAQ,EAAG,KAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,SAAS,MAAM,KAAK;AAC/F,aAAW,SAAS,KAAK,SAAS,QAAQ,EAAG,KAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,SAAS,MAAM,KAAK;AAC/F,aAAW,SAAS,KAAK,SAAS,UAAU,GAAG;AAC7C,QAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,SAAS,QAAQ,MAAM,KAAK;AAAA,EACvE;AAEA,QAAM,UAAwB,CAAC;AAC/B,QAAM,OAAO,oBAAI,IAAY;AAG7B,aAAW,EAAE,IAAI,KAAK,GAAG,OAAO,KAAK,MAAM,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,MAAM,EAAE,GAAG;AACpF,QAAI,KAAK,IAAI,OAAO,IAAI,EAAG;AAC3B,SAAK,IAAI,OAAO,IAAI;AACpB,YAAQ,KAAK,MAAM;AAAA,EACrB;AACA,MAAI,QAAQ,SAAS,aAAa;AAChC,eAAW,SAAS,MAAM,aAAa,MAAM,MAAM,KAAK,GAAG;AACzD,UAAI,KAAK,IAAI,MAAM,IAAI,EAAG;AAC1B,WAAK,IAAI,MAAM,IAAI;AACnB,cAAQ,KAAK,KAAK;AAAA,IACpB;AAAA,EACF;AACA,SAAO,QAAQ,MAAM,GAAG,WAAW;AACrC;AAEA,SAAS,cAAc,MAAc,KAAa,OAA2C;AAC3F,QAAM,WAAWC,YAAW,GAAG,IAAI,MAAMD,SAAQ,MAAM,GAAG;AAC1D,QAAM,MAAME,UAAS,MAAM,QAAQ;AACnC,MAAI,QAAQ,MAAM,IAAI,WAAW,KAAKC,IAAG,EAAE,KAAK,QAAQ,QAAQF,YAAW,GAAG,EAAG,QAAO;AACxF,QAAM,aAAa,IAAI,QAAQ,OAAO,GAAG;AACzC,SAAO,MAAM,IAAI,UAAU,IAAI,aAAa;AAC9C;AAMA,eAAe,aACb,MACA,MACA,OACuB;AACvB,QAAM,SAAS,CAAC,GAAG,KAAK,SAAS,MAAM,CAAC,EACrC,IAAI,CAAC,UAAU,MAAM,CAAC,KAAK,MAAM,CAAC,KAAK,MAAM,CAAC,KAAK,EAAE,EACrD,OAAO,CAAC,SAAS,KAAK,KAAK,EAAE,UAAU,KAAK,CAAC,cAAc,MAAM,MAAM,KAAK,CAAC;AAChF,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,QAAM,UAAU,CAAC,GAAG,KAAK,EACtB,OAAO,CAAC,SAAS,CAAC,UAAU,KAAK,IAAI,KAAK,CAAC,gBAAgB,KAAK,IAAI,CAAC,EACrE,KAAK,EACL,MAAM,GAAG,sBAAsB;AAElC,QAAM,UAAU,OAAO,IAAI,MAAM,CAAC,CAAiB;AACnD,aAAW,QAAQ,SAAS;AAC1B,QAAI,QAAQ,MAAM,CAAC,UAAU,MAAM,SAAS,CAAC,EAAG;AAChD,UAAM,SAAS,MAAM,kBAAkB,MAAM,IAAI;AACjD,QAAI,CAAC,OAAQ;AACb,WAAO,QAAQ,CAAC,OAAO,MAAM;AAC3B,YAAM,QAAQ,QAAQ,CAAC;AACvB,UAAI,MAAM,SAAS,EAAG;AACtB,YAAM,QAAQ,OAAO,QAAQ,KAAK;AAClC,UAAI,SAAS,GAAG;AACd,cAAM,KAAK,EAAE,MAAM,MAAM,OAAO,MAAM,GAAG,KAAK,EAAE,MAAM,IAAI,EAAE,QAAQ,MAAM,QAAQ,CAAC;AAAA,MACrF;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,QAAQ,QAAQ,CAAC,UAAW,MAAM,WAAW,IAAI,QAAQ,CAAC,CAAE;AACrE;;;ACtGA,SAAS,SAAAG,QAAO,YAAAC,iBAAgB;AAChC,SAAS,WAAAC,UAAS,QAAAC,aAAY;AAiC9B,IAAM,gBAAgB;AAEtB,IAAM,KAAK;AACX,IAAM,IAAI;AAOV,IAAM,YAAY;AAElB,IAAM,YAAY;AAQlB,IAAM,mBAAmB;AAwBzB,eAAsB,YACpB,gBACA,UACA,OACA,YACA,YAAY,OACZ,iBAAiB,OAC+C;AAChE,QAAM,OAAO,EAAE,SAAS,CAAC,GAAG,KAAK,oBAAI,IAAoB,EAAE;AAC3D,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,QAAQ,OAAO,KAAK,SAAS,OAAO,EAAE;AAAA,IAC1C,CAAC,UACE,CAAC,gBAAgB,KAAK,IAAI,KACxB,aAAa,SAAS,KAAK,IAAI,KAC/B,kBAAkB,eAAe,KAAK,IAAI,OAC5C,cAAc,CAAC,UAAU,KAAK,IAAI;AAAA,EACvC;AACA,QAAM,QAAQ,MAAM,UAAU,cAAc;AAC5C,MAAI,UAAU;AACd,QAAM,QAAmC,CAAC;AAC1C,QAAM,QAAQ;AAAA,IACZ,MAAM,IAAI,OAAO,SAAS;AACxB,YAAM,OAAO,SAAS,QAAQ,IAAI,GAAG,QAAQ;AAC7C,YAAM,SAAS,MAAM,MAAM,IAAI;AAC/B,UAAI,UAAU,OAAO,SAAS,MAAM;AAClC,cAAM,IAAI,IAAI;AACd;AAAA,MACF;AACA,YAAM,SAAS,MAAM,kBAAkB,gBAAgB,IAAI;AAC3D,UAAI,WAAW,KAAM;AACrB,YAAM,SAAiC,CAAC;AACxC,YAAM,QAAQ,WAAW,GAAG,IAAI,IAAI,MAAM,EAAE;AAC5C,iBAAW,QAAQ,MAAO,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK;AAC/D,YAAM,QAAQ,OAAO,MAAM,IAAI;AAC/B,YAAM,WAAuB,CAAC;AAC9B,eACM,QAAQ,GACZ,UAAU,KAAK,QAAQ,gBAAgB,IAAI,MAAM,QACjD,SAAS,gBAAgB,GACzB;AACA,iBAAS,KAAK;AAAA,UACZ,GAAG,IAAI,IAAI,WAAW,MAAM,MAAM,OAAO,QAAQ,aAAa,EAAE,KAAK,IAAI,CAAC,CAAC;AAAA,QAC7E,CAAC;AAAA,MACH;AACA,YAAM,IAAI,IAAI,EAAE,MAAM,QAAQ,MAAM,QAAQ,QAAQ,SAAS;AAC7D,gBAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,QAAM,WAAW,OAAO;AAAA,IACtB,OAAO,QAAQ,MAAM,KAAK,EAAE;AAAA,MAC1B,CAAC,CAAC,MAAM,IAAI,MAAM,EAAE,QAAQ,UAAU,SAAS,QAAQ,IAAI,GAAG,SAAS,KAAK;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,OAAO,OAAO,KAAK,QAAQ,EAAE,SAAS,OAAO,KAAK,KAAK,EAAE;AAC/D,MAAI,WAAW,SAAS,OAAO,KAAK,MAAM,KAAK,EAAE,QAAQ;AACvD,UAAM,UAAU,gBAAgB,EAAE,SAAS,GAAG,OAAO,EAAE,GAAG,UAAU,GAAG,MAAM,EAAE,CAAC;AAAA,EAClF;AAEA,QAAM,YAAY,OAAO,QAAQ,KAAK;AACtC,MAAI,UAAU,WAAW,EAAG,QAAO;AACnC,QAAM,gBACJ,UAAU,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,MAAM,MAAM,KAAK,QAAQ,CAAC,IAAI,UAAU;AACxE,QAAM,MAAM,IAAI;AAAA,IACd,MAAM,IAAI,CAAC,SAAS;AAClB,YAAM,KAAK,UAAU,OAAO,CAAC,CAAC,EAAE,IAAI,OAAO,KAAK,OAAO,IAAI,KAAK,KAAK,CAAC,EAAE;AACxE,aAAO,CAAC,MAAM,KAAK,IAAI,KAAK,UAAU,SAAS,KAAK,QAAQ,KAAK,IAAI,CAAC;AAAA,IACxE,CAAC;AAAA,EACH;AACA,QAAM,WAAW,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC;AACxE,QAAM,SAAS,UACZ,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM;AACrB,UAAM,WAAW,IAAI,IAAI,WAAW,KAAK,MAAM,KAAK,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC;AAC1E,QAAI,QAAQ;AACZ,QAAI,UAAU;AACd,eAAW,QAAQ,OAAO;AACxB,YAAM,KAAK,KAAK,OAAO,IAAI,KAAK;AAChC,UAAI,OAAO,EAAG;AACd,iBAAW,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,aACH,MAAM,KAAK,MAAO,KAAK,MAAM,IAAI,IAAK,IAAI,KAAK,SAAU;AAC5D,gBAAU,IAAI,IAAI,IAAI,KAAK,KAAK,cAAc,SAAS,IAAI,IAAI,IAAI,MAAM;AAAA,IAC3E;AAEA,UAAM,QAAQ,MAAM,OAAO,CAAC,SAAS,SAAS,IAAI,IAAI,CAAC;AACvD,UAAM,UAAU,KAAK;AAAA,MACnB,MAAM;AAAA,MACN,GAAG,KAAK,SAAS;AAAA,QACf,CAAC,WAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,CAAC,GAAE;AAAA,MAClF;AAAA,IACF;AACA,WAAO,EAAE,MAAM,OAAO,OAAO,SAAS,UAAU,WAAW,IAAI,UAAU,WAAW,EAAE;AAAA,EACxF,CAAC,EACA,OAAO,CAAC,UAAU,MAAM,QAAQ,CAAC,EACjC,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AACxF,QAAM,OAAO,OAAO,CAAC,GAAG,SAAS;AACjC,QAAM,SAAS,KAAK,IAAI,WAAW,MAAM,MAAM;AAC/C,QAAM,UAAU,OACb;AAAA,IACC,CAAC,UACC,MAAM,SAAS,UACf,MAAM,SAAS,YAAY,QAC3B,MAAM,YAAY;AAAA,EACtB,EACC,IAAI,CAAC,EAAE,MAAM,OAAO,OAAO,QAAQ,OAAO,EAAE,MAAM,OAAO,OAAO,QAAQ,EAAE;AAC7E,SAAO,EAAE,SAAS,IAAI;AACxB;AAQO,SAAS,YAAY,MAAc,OAAiB,KAAkC;AAC3F,QAAM,QAAQ,MAAM,OAAO,CAAC,KAAK,SAAS,OAAO,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC;AACvE,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,QAAQ,IAAI,IAAI,WAAW,IAAI,CAAC;AACtC,SAAO,MAAM,OAAO,CAAC,KAAK,SAAS,OAAO,MAAM,IAAI,IAAI,IAAK,IAAI,IAAI,IAAI,KAAK,IAAK,IAAI,CAAC,IAAI;AAC9F;AAEA,SAAS,UAAU,gBAAgC;AACjD,SAAOC,MAAK,gBAAgB,cAAc,SAAS,oBAAoB;AACzE;AAEA,eAAe,UAAU,gBAAwC;AAC/D,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,MAAMC,UAAS,UAAU,cAAc,GAAG,MAAM,CAAC;AAC3E,QAAI,OAAO,YAAY,KAAK,OAAO,SAAS,OAAO,OAAO,UAAU,SAAU,QAAO;AAAA,EACvF,QAAQ;AAAA,EAER;AACA,SAAO,EAAE,SAAS,GAAG,OAAO,CAAC,EAAE;AACjC;AAEA,eAAe,UAAU,gBAAwB,OAA6B;AAC5E,MAAI;AACF,UAAM,OAAO,UAAU,cAAc;AACrC,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAM,YAAY,MAAM,KAAK,UAAU,KAAK,CAAC;AAAA,EAC/C,QAAQ;AAAA,EAER;AACF;;;AHvMO,IAAM,kBAAkB;AAE/B,IAAM,aAAa;AAEnB,IAAM,YAAY,EAAE,OAAO,GAAG,OAAO,EAAE;AAEvC,IAAM,qBAAqB;AAG3B,eAAsB,kBACpB,gBACA,MACwB;AAExB,MAAI,iBAAiB,IAAI,EAAG,QAAO;AACnC,MAAI;AACF,UAAM,WAAWC,MAAK,gBAAgB,IAAI;AAC1C,SAAK,MAAMC,MAAK,QAAQ,GAAG,OAAO,mBAAoB,QAAO;AAC7D,UAAM,SAAS,MAAMC,UAAS,UAAU,MAAM;AAC9C,WAAO,OAAO,SAAS,IAAI,IAAI,OAAO;AAAA,EACxC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,eAAsB,kBACpB,gBACA,MACA,UACA,WACA,UAA4B,CAAC,GACH;AAC1B,SAAO,mBAAmB,IAAI;AAC9B,QAAM,UAAU,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA,IAAI,IAAI,OAAO,KAAK,SAAS,OAAO,CAAC;AAAA,EACvC;AACA,MAAI,QAAQ,WAAW;AACrB,WAAO,cAAc,gBAAgB,MAAM,UAAU,WAAW,OAAO;AACzE,QAAM,WAAW,QAAQ,IAAI,CAAC,WAAW,OAAO,IAAI;AACpD,QAAM,OAAuB,QAAQ;AAAA,IAAQ,CAAC,WAC5C,OAAO,SAAS,OACZ,CAAC,IACD;AAAA,MACE;AAAA,QACE,MAAM,OAAO;AAAA,QACb,WAAW,OAAO;AAAA,QAClB,SAAS,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAW;AAAA,MACb;AAAA,IACF;AAAA,EACN;AACA,QAAM,UAAU,uBAAuB,QACpC;AAAA,IACC,CAAC,WAAW,GAAG,OAAO,IAAI,IAAI,OAAO,IAAI,GAAG,OAAO,SAAS,OAAO,KAAK,IAAI,OAAO,IAAI,EAAE;AAAA,EAC3F,EACC,KAAK,IAAI,CAAC;AACb,MAAI,SAAS,UAAU,WAAY,QAAO,EAAE,OAAO,UAAU,MAAM,SAAS,CAAC,OAAO,EAAE;AACtF,QAAM,SAAS,MAAM,cAAc,gBAAgB,MAAM,UAAU,WAAW,OAAO;AACrF,SAAO;AAAA,IACL,GAAI,OAAO,UAAU,EAAE,SAAS,OAAO,QAAQ,IAAI,CAAC;AAAA,IACpD,OAAO,CAAC,GAAG,UAAU,GAAG,OAAO,MAAM,OAAO,CAAC,SAAS,CAAC,SAAS,SAAS,IAAI,CAAC,CAAC,EAAE;AAAA,MAC/E;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM,CAAC,GAAG,MAAM,GAAG,OAAO,KAAK,OAAO,CAAC,QAAQ,CAAC,SAAS,SAAS,IAAI,IAAI,CAAC,CAAC;AAAA,IAC5E,SAAS,CAAC,SAAS,GAAG,OAAO,OAAO;AAAA,EACtC;AACF;AAOA,eAAe,iBACb,gBACA,UACyE;AACzE,QAAM,UAAU,OAAO,OAAO,SAAS,OAAO;AAC9C,MAAI;AACF,UAAM,EAAE,iBAAiB,IAAI,MAAM,OAAO,sBAAkB;AAC5D,UAAM,SAAS,MAAM,iBAAiB,cAAc;AACpD,QAAI,CAAC,OAAO,WAAW,CAAC,OAAO,SAAS,UAAW,QAAO;AAC1D,UAAM,EAAE,iBAAiB,IAAI,MAAM,OAAO,yBAAqB;AAC/D,UAAM,YAAY,MAAM,iBAAiB,gBAAgB,QAAQ;AACjE,QAAI,UAAU,SAAS,EAAG,QAAO;AACjC,WAAO,QAAQ,IAAI,CAAC,UAAU;AAC5B,YAAM,UAAU,UAAU,IAAI,MAAM,IAAI;AACxC,aAAO,UACH,EAAE,GAAG,OAAO,SAAS,GAAG,QAAQ,OAAO,IAAI,OAAO,OAAO,QAAQ,OAAO,EAAE,KAAK,GAAG,CAAC,GAAG,IACtF;AAAA,IACN,CAAC;AAAA,EACH,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AA2BA,eAAe,cACb,gBACA,MACA,UACA,WACA,SAC0B;AAG1B,QAAM,iBAAiB,iBAAiB,IAAI;AAC5C,QAAM,WAAW,MAAM,iBAAiB,gBAAgB,QAAQ,GAAG;AAAA,IACjE,CAAC,UAAU,kBAAkB,CAAC,eAAe,KAAK,MAAM,IAAI;AAAA,EAC9D;AACA,QAAM,aAAa,qBAAqB,KAAK,IAAI;AAGjD,QAAM,cAAc,iBAAiB,IAAI,EAAE;AAAA,IACzC,CAAC,UAAU,gBAAgB,KAAK,KAAK,KAAK,CAAC,aAAa,KAAK,KAAK;AAAA,EACpE;AACA,MAAI,YAAY,SAAS,GAAG;AAI1B,UAAM,QAAQ,QACX;AAAA,MACC,CAAC,WACE,cAAc,CAAC,UAAU,KAAK,MAAM,IAAI,MACzC,eAAe,MAAM,MAAM,IAAI,KAC/B,CAAC,iBAAiB,KAAK,MAAM,IAAI;AAAA,IACrC,EACC,IAAI,CAAC,WAAW;AAAA,MACf,MAAM,MAAM;AAAA,MACZ,OAAO,IAAI;AAAA,SACR,MAAM,eAAe,CAAC,GAAG;AAAA,UAAQ,CAAC;AAAA;AAAA,YAEjC,OAAO,SAAS,YACZ,CAAC,IACD,OAAO,KAAK,MAAM,GAAG,EAAE,OAAO,CAAC,YAAY,YAAY,SAAS,OAAO,CAAC;AAAA;AAAA,QAC9E;AAAA,MACF,EAAE;AAAA,IACJ,EAAE,EACD,OAAO,CAAC,UAAU,MAAM,QAAQ,CAAC,EACjC,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC,EACrF,IAAI,CAAC,UAAU,MAAM,IAAI;AAC5B,QAAI,MAAM,SAAS,GAAG;AACpB,YAAMC,YAAW,IAAI;AAAA,QACnB,eAAe,SAAS,IAAI,EACzB,OAAO,CAAC,UAAU,MAAM,QAAQ,CAAC,EACjC,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,KAAK,CAAC;AAAA,MAC7C;AACA,YAAMC,aAAY,mBAAmB,OAAO,MAAM,WAAWD,WAAU,MAAM;AAAA,QAC3E,gBAAgB;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,QACL,OAAOC,WAAU,MAAM,MAAM,GAAG,UAAU;AAAA,QAC1C,MAAM,CAAC;AAAA,QACP,SAAS;AAAA,UACP,oCAAoC,YAAY,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,UACtE,GAAIA,WAAU,UAAU,CAACA,WAAU,OAAO,IAAI,CAAC;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAW,MAAM,aAAa,gBAAgB,MAAM,OAAO;AACjE,QAAM,SAAS,eAAe,SAAS,IAAI;AAC3C,QAAM,iBAAiB,OACpB,OAAO,CAAC,UAAU,MAAM,SAAS,eAAe,YAAY,EAC5D,IAAI,CAAC,UAAU,MAAM,IAAI;AAG5B,QAAM,EAAE,SAAS,SAAS,IAAI,IAAI,MAAM;AAAA,IACtC;AAAA,IACA;AAAA,IACA,UAAU,IAAI;AAAA,IACd;AAAA,IACA,UAAU,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AACA,QAAM,UACJ,QAAQ,SAAS,IACb,aAAa,CAAC,gBAAgB,QAAQ,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,CAAC,IACjE;AACN,QAAM,cAAc,OAAO,SAAS,QAAQ;AAE5C,QAAM,WACJ,QAAQ,aAAa,SAAS,QAAQ,mBAAmB,SACrD;AAAA,IACE,QAAQ;AAAA,IACR,OAAO,CAAC;AAAA,IACR,MAAM,CAAC;AAAA,IACP,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,SAAS;AAAA,EACX,IACA,MAAM,OAAO,oBAAsB,EAChC;AAAA,IAAK,CAAC,EAAE,eAAe,MACtB;AAAA,MACE;AAAA,MACA;AAAA,MACA,QAAQ,aAAa,SAAS,QAAQ,mBAAmB,SACrD,EAAE,YAAY,QAAQ,gBAAgB,eAAe,KAAK,IAC1D,CAAC;AAAA,IACP;AAAA,EACF,EACC;AAAA,IACC,OAAuB;AAAA,MACrB,QAAQ;AAAA,MACR,OAAO,CAAC;AAAA,MACR,MAAM,CAAC;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,SAAS;AAAA,IACX;AAAA,EACF;AAER,QAAM,WAAW,IAAI;AAAA,IACnB,OAAO,OAAO,CAAC,UAAU,MAAM,QAAQ,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,KAAK,CAAC;AAAA,EACpF;AACA,MAAI,SAAS;AACb,MAAI,OAAuB,CAAC;AAC5B,QAAM,UAAoB,CAAC;AAC3B,MAAI,SAAS,WAAW,cAAc,SAAS,MAAM,WAAW,GAAG;AACjE,YAAQ,KAAK,oCAAoC,SAAS,MAAM,GAAG;AAAA,EACrE,WAAW,SAAS,WAAW,YAAY;AAIzC,UAAM,QAAQ,UAAU,IAAI;AAC5B,UAAM,SAAmB,CAAC;AAC1B,UAAM,UAAoB,CAAC;AAC3B,QAAI,iBAAiB;AACrB,QAAI,aAAa;AAGjB,UAAM,WAAW,SAAS,YAAY;AACtC,eAAW,QAAQ,SAAS,OAAO;AACjC,UAAI,CAAC,cAAc,UAAU,KAAK,IAAI,EAAG;AACzC,UAAI,CAAC,kBAAkB,eAAe,KAAK,IAAI,EAAG;AAClD,UAAI,QAAQ,SAAS,IAAI,EAAG,QAAO,KAAK,IAAI;AAAA,eAE1C,MAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,SAAS,QAAQ,IAAI,GAAG,eAAe,CAAC;AAAA,MAC1C,GACA;AACA,cAAM,SAAU,MAAM,kBAAkB,gBAAgB,IAAI,KAAM;AAElE,YAAI,YAAY,GAAG,IAAI,IAAI,MAAM,IAAI,OAAO,GAAG,IAAI,UAAU;AAC3D;AACA;AAAA,QACF;AACA,YAAI,WAAW,QAAQ,KAAK,KAAK,eAAe,YAAa,QAAO,KAAK,IAAI;AAAA,YACxE,SAAQ,KAAK,IAAI;AACtB,YAAI,CAAC,SAAS,IAAI,IAAI,EAAG,UAAS,IAAI,MAAM,CAAC;AAAA,MAC/C,MAAO;AAAA,IACT;AAGA,aAAS;AAAA,MACP,OAAO,IAAI,CAAC,UAAU,MAAM,IAAI;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO,SAAS,KAAK,OAAO,CAAC,QAAQ,OAAO,SAAS,IAAI,IAAI,KAAK,QAAQ,SAAS,IAAI,IAAI,CAAC;AAC5F,YAAQ;AAAA,MACN,yCAAyC,SAAS,MAAM,MACrD,iBAAiB,IAAI,KAAK,cAAc,2CAA2C;AAAA,IACxF;AACA,QAAI,aAAa,GAAG;AAClB,cAAQ;AAAA,QACN,eAAe,UAAU,4CAA4C,QAAQ;AAAA,MAC/E;AAAA,IACF;AAAA,EACF;AAEA,MAAI;AACJ,QAAM,WAAW,MAAM,UAAU;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,SAAS;AAAA,IACnB;AAAA,IACA;AAAA,IACA,YAAY,QAAQ;AAAA,EACtB,CAAC;AACD,MAAI,UAAU;AACZ,YAAQ,KAAK,SAAS,OAAO;AAC7B,aAAS,SAAS;AAClB,cAAU,SAAS;AAAA,EACrB;AAKA,QAAM,YAAY,UAAU,KAAK,IAAI;AACrC,MAAI,CAAC,OAAO,KAAK,CAAC,SAAS,eAAe,MAAM,IAAI,CAAC,GAAG;AACtD,YAAQ;AAAA,MACN,6DACG,OAAO,SAAS,IACb,yBACA,sBAAsB,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,eAAe,YAAY,OAC/E,SAAS,SAAS,IACf,2CACA;AAAA,IACR;AACA,WAAO,EAAE,OAAO,UAAU,MAAM,CAAC,GAAG,QAAQ;AAAA,EAC9C;AACA,MAAI,cAAc,GAAG;AACnB,YAAQ;AAAA,MACN,eAAe,WAAW,gEAAgE,eAAe,YAAY;AAAA,IACvH;AAAA,EACF;AAGA,QAAM,UACJ,QAAQ,aAAa,SAAS,WAC1B,OACA,MAAM,kBAAkB,gBAAgB,UAAU,IAAI;AAC5D,MAAI,WAAW,QAAQ,SAAS,GAAG;AAEjC,UAAM,MAAM,YAAY,OAAO,OAAO,CAAC,SAAS,SAAS,KAAK,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,CAAC;AACpF,aAAS,CAAC,GAAG,KAAK,GAAG,QAAQ,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU;AAC5E,YAAQ;AAAA,MACN,mDAAmD,QAAQ,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC;AAAA,IACjF;AAAA,EACF;AACA,QAAM,YAAY,mBAAmB,QAAQ,MAAM,WAAW,UAAU,IAAI;AAC5E,MAAI,UAAU,QAAS,SAAQ,KAAK,UAAU,OAAO;AACrD,MAAI,SAAS,SAAS,GAAG;AACvB,YAAQ,KAAK,mCAAmC,SAAS,KAAK,IAAI,CAAC,GAAG;AAAA,EACxE;AACA,QAAM,QAAQ,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,UAAU,GAAG,UAAU,KAAK,CAAC,CAAC;AAC5D,MAAI,MAAM,SAAS,YAAY;AAC7B,YAAQ;AAAA,MACN,eAAe,MAAM,SAAS,UAAU,6CAA6C,UAAU;AAAA,IACjG;AAAA,EACF;AACA,SAAO;AAAA,IACL,OAAO,MAAM,MAAM,GAAG,UAAU;AAAA,IAChC;AAAA,IACA;AAAA,IACA,GAAI,WAAW,OAAO,KAAK,OAAO,EAAE,SAAS,IAAI,EAAE,QAAQ,IAAI,CAAC;AAAA,EAClE;AACF;AASA,IAAM,gBAAgB;AAEtB,eAAe,UAAU,OAUoE;AAC3F,MAAI;AACJ,MAAI;AACF,aAAS,OAAO,MAAM,OAAO,sBAAkB,GAAG,iBAAiB,MAAM,cAAc;AAAA,EACzF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,MAAI,CAAC,OAAO,WAAW,CAAC,OAAO,SAAS,OAAQ,QAAO;AACvD,QAAM,UAAU,CAAC,YAAoB;AAAA,IACnC,QAAQ,MAAM;AAAA,IACd,SAAS,kCAAkC,MAAM;AAAA,IACjD,SAAS,CAAC;AAAA,EACZ;AACA,QAAM,SAAS,CAAC,SAAiB,MAAM,cAAc,CAAC,UAAU,KAAK,IAAI;AACzE,QAAM,iBAAiB;AAAA,IACrB,GAAG,oBAAI,IAAI;AAAA,MACT,GAAG,MAAM;AAAA,MACT,GAAG,MAAM,OACN,IAAI,CAAC,UAAU,MAAM,IAAI,EACzB,OAAO,MAAM,EACb,MAAM,GAAG,EAAE;AAAA,MACd,GAAG,MAAM,SAAS,OAAO,MAAM,EAAE,MAAM,GAAG,CAAC;AAAA,IAC7C,CAAC;AAAA,EACH,EAAE,MAAM,GAAG,EAAE;AACb,MAAI,eAAe,WAAW,EAAG,QAAO;AACxC,QAAM,SAAS,IAAI,IAAI,MAAM,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CAAC;AACxE,QAAM,aAAa,KAAK;AAAA,IACtB,OAAO;AAAA,IACP,MAAM,eAAe,SAAY,OAAO,YAAY,MAAM,aAAa,KAAK,IAAI;AAAA,EAClF;AACA,MAAI,aAAa,cAAe,QAAO,QAAQ,iCAAiC;AAChF,QAAM,EAAE,iBAAiB,IAAI,MAAM,OAAO,sBAAkB;AAC5D,QAAM,SAAS,MAAM;AAAA,IACnB,MAAM;AAAA,IACN;AAAA,IACA,MAAM;AAAA,IACN,eAAe,IAAI,CAAC,UAAU;AAAA,MAC5B;AAAA,MACA,SAAS,OAAO,IAAI,IAAI,GAAG,WAAW,OAAO,IAAI,IAAI,GAAG,WAAW;AAAA,MACnE,aAAa,MAAM,SAAS,QAAQ,IAAI,GAAG,eAAe,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS;AAAA,IACtF,EAAE;AAAA,IACF;AAAA,EACF,EAAE,MAAM,OAAO,EAAE,IAAI,OAAgB,QAAQ,UAAmB,EAAE;AAClE,MAAI,CAAC,OAAO,GAAI,QAAO,QAAQ,OAAO,MAAM;AAC5C,QAAM,QAAQ,GAAG,OAAO,QAAQ,IAAI,OAAO,KAAK,KAAK,OAAO,SAAS,WAAW,GAAG,OAAO,SAAS,KAAK;AACxG,MAAI,OAAO,MAAM,SAAS;AACxB,WAAO;AAAA,MACL,QAAQ,CAAC;AAAA,MACT,SAAS,0BAA0B,KAAK,0BAA0B,eAAe,MAAM;AAAA,MACvF,SAAS,CAAC;AAAA,IACZ;AAAA,EACF;AACA,QAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,QAAM,QAAkB,CAAC;AACzB,QAAM,UAAoC,CAAC;AAC3C,MAAI,WAAW;AACf,aAAW,QAAQ,OAAO,MAAM,OAAO;AACrC,QAAI,CAAC,MAAM,OAAO,SAAS,KAAK,IAAI,GAAG;AACrC,YAAM,SAAU,MAAM,kBAAkB,MAAM,gBAAgB,KAAK,IAAI,KAAM;AAC7E,YAAM,UAAU,OAAO,IAAI,KAAK,IAAI,GAAG,WAAW;AAClD,UACE,KAAK,IAAI,WAAW,SAAS,KAAK,GAAG,WAAW,QAAQ,KAAK,CAAC,IAAI,eAAe;AAEjF;AACF;AAAA,IACF;AACA,UAAM,KAAK,KAAK,IAAI;AACpB,UAAM,QAAQ,IAAI;AAAA,OACf,MAAM,SAAS,QAAQ,KAAK,IAAI,GAAG,eAAe,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IAC1E;AACA,UAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC,SAAS,MAAM,IAAI,IAAI,CAAC;AAC3D,QAAI,MAAM,SAAS,EAAG,SAAQ,KAAK,IAAI,IAAI;AAAA,EAC7C;AACA,SAAO;AAAA,IACL,QAAQ,CAAC,GAAG,OAAO,GAAG,MAAM,OAAO,OAAO,CAAC,SAAS,CAAC,MAAM,SAAS,IAAI,CAAC,CAAC;AAAA,IAC1E,SACE,0BAA0B,KAAK,KAAK,MAAM,MAAM,OAAO,eAAe,MAAM,iBAC3E,WAAW,IAAI,KAAK,QAAQ,cAAc,MAC3C;AAAA,IACF;AAAA,EACF;AACF;AAOA,eAAe,aACb,gBACA,MACA,SACmB;AACnB,QAAM,OAAO,MAAM,YAAY,cAAc;AAC7C,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAC/B,QAAM,QAAQ,oBAAI,IAAY;AAC9B,QAAM,UAAU,IAAI;AAAA,IAClB,SAAS,KAAK,IAAI,YAAY,EAAE,KAAK,GAAG,CAAC;AAAA,IACzC;AAAA,EACF;AACA,aAAW,CAAC,EAAE,SAAS,GAAG,KAAK,KAAK,SAAS,OAAO,GAAG;AACrD,QAAI,CAAC,QAAS;AACd,UAAM,IAAI,QAAQ,YAAY,CAAC;AAC/B,QAAI,IAAK,OAAM,IAAI,GAAG,OAAO,IAAI,GAAG,GAAG,YAAY,CAAC;AAAA,EACtD;AACA,MAAI,MAAM,SAAS,EAAG,QAAO,CAAC;AAC9B,QAAM,UAAU,QACb,IAAI,CAAC,UAAU,MAAM,IAAI,EACzB,OAAO,CAAC,SAAS;AAChB,QAAI,UAAU,KAAK,IAAI,KAAK,gBAAgB,KAAK,IAAI,KAAK,CAAC,YAAY,KAAK,IAAI,GAAG;AACjF,aAAO;AAAA,IACT;AACA,UAAM,OAAO,KAAK,MAAM,KAAK,YAAY,GAAG,IAAI,CAAC;AACjD,WAAO,MAAM,IAAI,KAAK,MAAM,GAAG,KAAK,YAAY,GAAG,CAAC,EAAE,YAAY,CAAC;AAAA,EACrE,CAAC;AAEH,SAAO,QACJ,KAAK,CAAC,MAAM,UAAU,MAAM,SAAS,KAAK,UAAU,KAAK,cAAc,KAAK,CAAC,EAC7E,MAAM,GAAG,UAAU;AACxB;AAEA,IAAM,cAAc;AAEpB,eAAe,YAAY,gBAA2C;AACpE,MAAI;AACF,UAAM,WAAW,KAAK,MAAM,MAAMF,UAASF,MAAK,gBAAgB,cAAc,GAAG,MAAM,CAAC;AAIxF,QAAI,OAAO,SAAS,QAAQ,YAAY,OAAO,SAAS,SAAS,UAAU;AACzE,aAAO,CAAC,SAAS,KAAK,MAAM,SAAS,KAAK,YAAY,GAAG,IAAI,CAAC,CAAC;AAAA,IACjE;AACA,QAAI,SAAS,OAAO,OAAO,SAAS,QAAQ,SAAU,QAAO,OAAO,KAAK,SAAS,GAAG;AAAA,EACvF,QAAQ;AAAA,EAER;AACA,SAAO,CAAC;AACV;AAEA,SAAS,aAAa,OAAuB;AAC3C,SAAO,MAAM,QAAQ,uBAAuB,MAAM;AACpD;AAGA,IAAM,kBACJ;AAUF,SAAS,mBACP,QACA,KACA,UACA,MACA,UAAwC,CAAC,GACI;AAC7C,MAAI,CAAC,gBAAgB,KAAK,IAAI,EAAG,QAAO,EAAE,OAAO,QAAQ,SAAS,KAAK;AACvE,QAAM,QAAQ,OAAO,MAAM,GAAG,UAAU,KAAK;AAC7C,QAAM,QAAQ,oBAAI,IAAyB;AAC3C,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,QAAQ,IAAI,OAAO;AAC5B,eAAW,CAAC,MAAM,KAAK,KAAK;AAAA,MAC1B,CAAC,KAAK,MAAM,KAAK,EAAE;AAAA,MACnB,CAAC,KAAK,IAAI,KAAK,IAAI;AAAA,IACrB,GAAY;AACV,UAAI,CAAC,MAAM,SAAS,IAAI,KAAK,MAAM,SAAS,KAAK,EAAG;AACpD,UAAI,CAAC,SAAS,IAAI,KAAK,GAAG;AACxB,YACE,CAAC,QAAQ,kBACT,KAAK,SAAS,QACd,UAAU,KAAK,KAAK,KACpB,gBAAgB,KAAK,KAAK;AAE1B;AACF,kBAAU;AAAA,UACR;AAAA,UACA,KAAK;AAAA,YACH,UAAU,IAAI,KAAK,KAAK;AAAA,YACxB,KAAK,SAAS,SAAS,IAAI,KAAK,SAAS,WAAW,IAAI;AAAA,UAC1D;AAAA,QACF;AAAA,MACF;AACA,YAAM,IAAI,QAAQ,MAAM,IAAI,KAAK,KAAK,oBAAI,IAAI,GAAG,IAAI,IAAI,CAAC;AAAA,IAC5D;AAAA,EACF;AACA,QAAM,UAAU,CAAC,SAAiB,SAAS,IAAI,IAAI,KAAK;AACxD,QAAM,QAAQ,CAAC,GAAG,KAAK,EACpB;AAAA,IACC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,MACnB,EAAE,OAAO,EAAE,QACX,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAC5B,UAAU,IAAI,KAAK,KAAK,MAAM,UAAU,IAAI,IAAI,KAAK,MACtD,KAAK,cAAc,KAAK;AAAA,EAC5B,EACC,MAAM,GAAG,UAAU,KAAK,EACxB,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI;AACvB,MAAI,MAAM,WAAW,EAAG,QAAO,EAAE,OAAO,QAAQ,SAAS,KAAK;AAC9D,QAAM,QAAQ,OAAO,OAAO,CAAC,SAAS,CAAC,MAAM,SAAS,IAAI,CAAC;AAC3D,aAAW,QAAQ,OAAO;AACxB,UAAM,WAAW,QAAQ,IAAI,IAAI;AACjC,UAAM,KAAK,MAAM;AAAA,MACf,CAAC,OAAO,UAAU,SAAS,MAAM,UAAU,QAAQ,KAAK,IAAI;AAAA,IAC9D;AACA,UAAM,OAAO,KAAK,IAAI,MAAM,SAAS,IAAI,GAAG,IAAI;AAAA,EAClD;AACA,SAAO;AAAA,IACL;AAAA,IACA,SACE,cAAc,MAAM,MAAM,mCAAmC,MAAM,MAAM,mEAAmE,MAAM,KAAK,IAAI,CAAC,gCAC3J,MAAM,KAAK,CAAC,SAAS,UAAU,IAAI,IAAI,CAAC,IAAI,+BAA+B;AAAA,EAChF;AACF;AAGO,SAAS,uBACd,SACA,kBACA,QACA,SACU;AACV,QAAM,WAAW,oBAAI,IAAI,CAAC,GAAG,kBAAkB,GAAG,MAAM,CAAC;AACzD,QAAM,cAAc,aAAa,CAAC,SAAS,MAAM,CAAC,EAAE,OAAO,CAAC,SAAS,SAAS,IAAI,IAAI,CAAC;AACvF,SAAO,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,aAAa,GAAG,OAAO,CAAC,CAAC;AAClD;AAGA,SAAS,aAAa,OAAmB,IAAI,IAAc;AACzD,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,QAAQ,OAAO;AACxB,SAAK,QAAQ,CAAC,MAAM,UAAU;AAC5B,aAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,QAAQ,EAAE;AAAA,IAChE,CAAC;AAAA,EACH;AACA,SAAO,CAAC,GAAG,MAAM,EACd,KAAK,CAAC,MAAM,UAAU,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EAAE,cAAc,MAAM,CAAC,CAAC,CAAC,EAC3E,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI;AACzB;AAEA,IAAM,iBAAiB,IAAI;AAAA,EACzB,iUAAiU;AAAA,IAC/T;AAAA,EACF;AACF;AASO,IAAM,iBAAiB,EAAE,cAAc,KAAK,aAAa,EAAE;AAElE,eAAe,0BACb,gBACA,MACA,MACA,OACA,SACkB;AAClB,QAAM,SAAS,MAAM,kBAAkB,gBAAgB,IAAI;AAC3D,MAAI,WAAW,KAAM,QAAO;AAG5B,MAAI,WAAW,QAAQ,KAAK,KAAK,eAAe,YAAa,QAAO;AACpE,QAAM,QAAQ,OAAO,MAAM,OAAO;AAClC,SAAO,KAAK,KAAK,CAAC,QAAQ;AACxB,QAAI,IAAI,SAAS,QAAQ,IAAI,UAAU,MAAM,OAAQ,QAAO;AAC5D,UAAM,UAAU,MAAM,MAAM,IAAI,YAAY,GAAG,IAAI,OAAO;AAC1D,UAAM,UAAU,WAAW,QAAQ,KAAK,GAAG,GAAG,KAAK;AACnD,WACE,WAAW,eAAe,eACzB,WAAW,KACV,MAAM,WAAW,KACjB,IAAI,QAAQ,KACZ,QAAQ;AAAA,MACN,CAAC,WAAW,IAAI,aAAa,OAAO,WAAW,IAAI,WAAW,OAAO;AAAA,IACvE;AAAA,EAEN,CAAC;AACH;AACO,IAAM,YACX;AAMK,IAAM,iBAAiB,IAAI;AAAA,EAChC;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EACG,IAAI,CAAC,SAAS,UAAU,IAAI,GAAG,EAC/B,KAAK,GAAG;AACb;AAMO,SAAS,iBAAiB,MAAuB;AACtD,SACE,6EAA6E,KAAK,IAAI,KACtF,yCAAyC,KAAK,IAAI,KAClD,mEAAmE,KAAK,IAAI;AAEhF;AACA,IAAM,kBACJ;AAEK,IAAM,kBAAkB;AAAA,EAC7B,MAAM,CAAC,SAA0B,gBAAgB,KAAK,IAAI,KAAK,eAAe,KAAK,IAAI;AACzF;AACA,IAAM,aAAa;AAKZ,IAAM,WAAW;AAAA,EACtB,MAAM,CAAC,SAA0B,WAAW,KAAK,IAAI,KAAK,CAAC,eAAe,KAAK,IAAI;AACrF;AAEA,IAAM,YAAY;AAMX,SAAS,eAAe,MAAc,MAAuB;AAClE,SACE,CAAC,gBAAgB,KAAK,IAAI,KACzB,UAAU,KAAK,IAAI,KAAK,SAAS,KAAK,IAAI,KAC1C,iBAAiB,IAAI,KAAK,eAAe,KAAK,IAAI;AAEvD;AAuBO,SAAS,eACd,SACA,MACuD;AACvD,QAAM,QAAQ,UAAU,IAAI;AAC5B,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,QAAM,aAAa,MAAM,KAAK,CAAC,SAAS,SAAS,UAAU,SAAS,MAAM;AAC1E,QAAM,aAAa,QAAQ,QAAQ,CAAC,UAAU;AAC5C,QAAI,UAAU,KAAK,MAAM,IAAI,KAAK,CAAC,WAAY,QAAO,CAAC;AACvD,UAAM,QAAQ,IAAI;AAAA,MAChB;AAAA,QACE,GAAG,MAAM,IAAI,IAAI,MAAM,OAAO,IAAI,MAAM,QAAQ,KAAK,GAAG,CAAC,IAAI,MAAM,aAAa,IAAI,CAAC,WAAW,OAAO,IAAI,EAAE,KAAK,GAAG,KAAK,EAAE;AAAA,MAC9H;AAAA,IACF;AACA,UAAM,WAAW,IAAI,IAAI,MAAM,UAAU,WAAW,MAAM,OAAO,IAAI,CAAC,CAAC;AACvE,UAAM,YAAY,IAAI,IAAI,WAAW,MAAM,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC;AACvF,WAAO,CAAC,EAAE,MAAM,MAAM,MAAM,OAAO,UAAU,UAAU,CAAC;AAAA,EAC1D,CAAC;AAKD,QAAM,MAAM,IAAI;AAAA,IACd,MAAM,IAAI,CAAC,SAAS;AAClB,YAAM,KAAK,WAAW;AAAA,QACpB,CAAC,cAAc,UAAU,MAAM,IAAI,IAAI,KAAK,UAAU,SAAS,IAAI,IAAI;AAAA,MACzE,EAAE;AACF,aAAO,CAAC,MAAM,KAAK,KAAK,WAAW,SAAS,MAAM,KAAK,EAAE,IAAI,CAAC;AAAA,IAChE,CAAC;AAAA,EACH;AACA,SAAO,WACJ,QAAQ,CAAC,EAAE,MAAM,OAAO,UAAU,UAAU,MAAM;AACjD,QAAI,QAAQ;AACZ,QAAI,WAAW;AACf,eAAW,QAAQ,OAAO;AACxB,UAAI,MAAM,IAAI,IAAI,GAAG;AACnB,cAAM,SAAS,UAAU,IAAI,IAAI,IAAI,MAAM;AAC3C,iBAAS;AACT,oBAAY,UAAU,IAAI,IAAI,IAAI,KAAK;AAAA,MACzC,WAAW,SAAS,IAAI,IAAI,GAAG;AAC7B,oBAAY,OAAO,IAAI,IAAI,IAAI,KAAK;AAAA,MACtC;AAAA,IACF;AACA,QAAI,aAAa,EAAG,QAAO,CAAC;AAC5B,QAAI,CAAC,eAAe,MAAM,IAAI,GAAG;AAC/B,eAAS;AACT,kBAAY;AAAA,IACd;AACA,WAAO,CAAC,EAAE,MAAM,OAAO,OAAO,SAAS,CAAC;AAAA,EAC1C,CAAC,EACA;AAAA,IACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SAAS,MAAM,QAAQ,KAAK,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AAAA,EAC9F;AACJ;AAGO,SAAS,WAAW,MAAwB;AACjD,SAAO,SAAS,IAAI,EAAE,IAAI,UAAU;AACtC;AAEA,SAAS,SAAS,MAAwB;AACxC,SAAO,KACJ,QAAQ,sBAAsB,OAAO,EACrC,YAAY,EACZ,MAAM,YAAY,EAClB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACrC;AAGA,SAAS,WAAW,MAAsB;AACxC,MAAI,KAAK,UAAU,KAAK,CAAC,KAAK,SAAS,GAAG,KAAK,cAAc,KAAK,IAAI,EAAG,QAAO;AAChF,MAAI,oBAAoB,KAAK,IAAI,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AAC3D,SAAO,KAAK,MAAM,GAAG,EAAE;AACzB;AAOA,IAAM,iBAAiB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGO,SAAS,mBAAmB,MAAsB;AACvD,SAAO,eAAe,OAAO,CAAC,MAAM,YAAY,KAAK,QAAQ,SAAS,GAAG,GAAG,IAAI;AAClF;AAGO,SAAS,UAAU,MAAwB;AAChD,SAAO;AAAA,IACL,GAAG,IAAI;AAAA,MACL,SAAS,IAAI,EACV,OAAO,CAAC,SAAS,CAAC,eAAe,IAAI,IAAI,CAAC,EAC1C,IAAI,UAAU,EACd,OAAO,CAAC,SAAS,CAAC,eAAe,IAAI,IAAI,CAAC;AAAA,IAC/C;AAAA,EACF;AACF;AAGO,SAAS,WAAW,MAAc,OAAyB;AAChE,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,QAAQ,IAAI,IAAI,WAAW,IAAI,CAAC;AACtC,SAAO,MAAM,OAAO,CAAC,SAAS,MAAM,IAAI,IAAI,CAAC,EAAE;AACjD;AAGA,IAAM,eAAe;AAKrB,IAAM,mBAAmB;AAGzB,IAAM,kBAAkB;AAGjB,SAAS,iBAAiB,MAAwB;AACvD,QAAM,SAAS,KAAK,MAAM,0CAA0C,KAAK,CAAC;AAC1E,SAAO,CAAC,GAAG,IAAI,IAAI,OAAO,QAAQ,CAAC,UAAU,CAAC,OAAO,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7E;AAGO,SAAS,cAAc,MAAc,QAA0B;AACpE,SAAO,KAAK,MAAM,GAAG,EAAE,OAAO,CAAC,YAAY,OAAO,SAAS,OAAO,CAAC,EAAE;AACvE;AAEA,eAAsB,2BACpB,gBACA,gBAC0B;AAC1B,QAAM,CAAC,QAAQ,QAAQ,IAAI,MAAM,QAAQ,IAAI,CAAC,eAAe,cAAc,GAAG,cAAc,CAAC;AAC7F,QAAM,WAAW,MAAM,oBAAoB,gBAAgB,QAAQ,GAAG;AACtE,MACE,OAAO,UAAU,WAChB,MAAM,oBAAoB,gBAAgB,OAAO,SAAS,SAAS,GACpE;AACA,QAAI;AACF,YAAM,YAAYK;AAAA,QAChB;AAAA,QACA,OAAO,SAAS,aAAa;AAAA,MAC/B;AACA,YAAM,CAAC,OAAO,WAAWC,aAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,QACzD,gBAAgB,WAAW,cAAc;AAAA,QACzCC,MAAK,SAAS;AAAA,QACd,wBAAwB,SAAS;AAAA,MACnC,CAAC;AAID,YAAM,YAAY,IAAI;AAAA,SAElB,MAAM,QAAQ;AAAA,UACZ,MAAM,QAAQ,IAAI,OAAO,WAAW;AAClC,gBAAI;AACF,oBAAM,WAAW,MAAM,SAASF,MAAK,gBAAgB,OAAO,IAAI,CAAC;AACjE,oBAAM,SAASG,UAAS,MAAM,SAAS,cAAc,GAAG,QAAQ;AAChE,kBAAI,OAAO,WAAW,IAAI,KAAKC,YAAW,MAAM,EAAG,QAAO;AAC1D,oBAAM,SAAS,MAAMF,MAAK,QAAQ;AAClC,oBAAM,QACJD,kBAAiB,OACb,OAAO,WAAW,UAAU,UAC5BA,cAAa,OAAO,IAAI,MAAM,UAC9BA,cAAa,OAAO,IAAI,MAAM,SAAS,QAAQ,OAAO,IAAI,GAAG;AACnE,qBAAO,OAAO,OAAO,KAAK,QAAQ,OAAO,OAAO;AAAA,YAClD,QAAQ;AAEN,qBAAO;AAAA,YACT;AAAA,UACF,CAAC;AAAA,QACH,GACA,OAAO,CAAC,SAAyB,SAAS,IAAI;AAAA,MAClD;AACA,YAAM,UAAU,IAAI,IAAI,QAAQ,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,MAAM,MAAM,CAAC,CAAC;AAC9E,iBAAW,UAAU,MAAM,SAAS;AAClC,YAAI,UAAU,IAAI,OAAO,IAAI,KAAK,CAAC,QAAQ,IAAI,OAAO,IAAI;AACxD,kBAAQ,IAAI,OAAO,MAAM,MAAM;AAAA,MACnC;AACA,YAAM,QAAQ,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,KAAK,IAAI,KAAK,KAAK,EAAE,IAAI,IAAI,CAAC,CAAC;AACrF,UAAI,kBAAkB;AACtB,iBAAW,QAAQ,MAAM,OAAO;AAC9B,YAAI,CAAC,UAAU,IAAI,KAAK,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,EAAE,EAAG;AAC1D;AACA,cAAM,MAAM,GAAG,KAAK,IAAI,KAAK,KAAK,EAAE;AACpC,cAAM,UAAU,MAAM,IAAI,GAAG;AAC7B,cAAM;AAAA,UACJ;AAAA,UACA,UAAU,EAAE,GAAG,SAAS,GAAI,KAAK,UAAU,EAAE,SAAS,KAAK,QAAQ,IAAI,CAAC,EAAG,IAAI;AAAA,QACjF;AAAA,MACF;AACA,YAAM,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,EAAE;AAAA,QAAK,CAAC,MAAM,UAClD,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG,cAAc,GAAG,MAAM,IAAI,IAAI,MAAM,EAAE,EAAE;AAAA,MACrE;AACA,YAAM,gBAAgB,oBAAI,IAAsB;AAChD,iBAAW,QAAQ,aAAa;AAC9B,cAAM,UAAU,cAAc,IAAI,KAAK,IAAI,KAAK,CAAC;AACjD,gBAAQ,KAAK,KAAK,EAAE;AACpB,sBAAc,IAAI,KAAK,MAAM,OAAO;AAAA,MACtC;AACA,aAAO;AAAA,QACL,SAAS,CAAC,GAAG,QAAQ,OAAO,CAAC,EAC1B,IAAI,CAAC,YAAY,EAAE,GAAG,QAAQ,SAAS,cAAc,IAAI,OAAO,IAAI,KAAK,CAAC,EAAE,EAAE,EAC9E,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAAA,QAC5D,OAAO;AAAA,QACP,QAAQ,kBAAkB,IAAI,qBAAqB;AAAA,MACrD;AAAA,IACF,QAAQ;AAAA,IAGR;AAAA,EACF;AACA,SAAO,EAAE,GAAG,SAAS,QAAQ,UAAU;AACzC;;;ADx9BA,IAAM,cAAc;AACpB,IAAM,aAAa;AACnB,IAAM,cAAc;AACpB,IAAM,QAAQ;AACd,IAAM,QAAQ,GAAG,sBAAsB,EAAE,IAAI,sBAAsB,QAAQ;AAM3E,eAAe,WAAW,OAAsC;AAC9D,QAAM,EAAE,mBAAmB,IAAI,MAAM,OAAO,qBAAuB;AACnE,UAAQ,MAAM,IAAI,mBAAmB,EAAE,MAAM,EAAE,OAAO,MAAM,CAAC,GAAG;AAClE;AAOA,eAAsB,mBACpB,gBACA,UACA,YACA,QAAe,YACa;AAC5B,QAAM,QAAQ,MAAM,UAAU,cAAc;AAC5C,QAAM,WAAW,cAAc,QAAQ;AACvC,QAAM,QAAqC,CAAC;AAC5C,QAAM,OAAiB,CAAC;AACxB,aAAW,QAAQ,UAAU;AAC3B,UAAM,SAAS,MAAM,MAAM,IAAI;AAC/B,QAAI,UAAU,OAAO,SAAS,SAAS,QAAQ,IAAI,GAAG,KAAM,OAAM,IAAI,IAAI;AAAA,QACrE,MAAK,KAAK,IAAI;AAAA,EACrB;AACA,MAAI,WAAW;AACf,MAAI,WAAW,KAAK,IAAI;AACxB,aAAW,QAAQ,MAAM;AACvB,QAAI,KAAK,IAAI,KAAK,WAAY;AAC9B,UAAM,SAAS,MAAM,kBAAkB,gBAAgB,IAAI;AAC3D,QAAI,WAAW,KAAM;AACrB,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAS,MAAM,MAAM,MAAM;AACjC,aAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,OAAO;AACzD,iBAAW,UAAU,MAAM,MAAM,OAAO,MAAM,OAAO,QAAQ,KAAK,CAAC,GAAG;AACpE,gBAAQ,KAAK,OAAO,MAAM,CAAC;AAAA,MAC7B;AAAA,IACF;AACA,UAAM,IAAI,IAAI,EAAE,MAAM,SAAS,QAAQ,IAAI,GAAG,QAAQ,IAAI,QAAQ;AAClE,gBAAY;AACZ,QAAI,KAAK,IAAI,IAAI,WAAW,KAAQ;AAClC,YAAM,UAAU,gBAAgB,EAAE,SAAS,GAAG,OAAO,OAAO,MAAM,CAAC;AACnE,iBAAW,KAAK,IAAI;AAAA,IACtB;AAAA,EACF;AACA,QAAM,UAAU,gBAAgB,EAAE,SAAS,GAAG,OAAO,OAAO,MAAM,CAAC;AACnE,SAAO;AAAA,IACL;AAAA,IACA,OAAO,OAAO,KAAK,KAAK,EAAE;AAAA,IAC1B,SAAS,SAAS,SAAS,OAAO,KAAK,KAAK,EAAE;AAAA,EAChD;AACF;AAGA,eAAsB,gBACpB,gBACA,UACmC;AACnC,QAAM,UAAU,KAAK,IAAI;AACzB,MAAI;AACF,UAAM,EAAE,SAAS,IAAI,MAAM,eAAe,cAAc;AACxD,WAAO,MAAM,mBAAmB,gBAAgB,UAAU,UAAU,QAAQ;AAAA,EAC9E,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,eAAsB,kBACpB,gBACA,UACA,MACA,QAAe,YACyC;AACxD,MAAI,QAAQ,IAAI,uBAAuB,IAAK,QAAO;AACnD,QAAM,QAAQ,MAAM,UAAU,cAAc;AAC5C,QAAM,UAAU,cAAc,QAAQ,EAAE;AAAA,IACtC,CAAC,SAAS,MAAM,MAAM,IAAI,GAAG,SAAS,SAAS,QAAQ,IAAI,GAAG;AAAA,EAChE;AACA,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,MAAI;AACJ,MAAI;AACF,UAAM,CAAC,MAAM,IAAI,MAAM,MAAM,CAAC,IAAI,CAAC;AACnC,QAAI,CAAC,OAAQ,QAAO;AACpB,YAAQ;AAAA,EACV,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO,QACJ,IAAI,CAAC,UAAU;AAAA,IACd;AAAA,IACA,OAAO,KAAK,IAAI,IAAI,MAAM,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,EACzF,EAAE,EACD,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAC1F;AAEA,SAAS,cAAc,UAAmC;AACxD,SAAO,OAAO,KAAK,SAAS,OAAO,EAAE;AAAA,IACnC,CAAC,SAAS,CAAC,gBAAgB,KAAK,IAAI,KAAK,CAAC,UAAU,KAAK,IAAI;AAAA,EAC/D;AACF;AAGA,SAAS,MAAM,MAAc,QAA0B;AACrD,QAAM,QAAQ,OAAO,MAAM,IAAI;AAC/B,QAAM,SAAmB,CAAC;AAC1B,WAAS,QAAQ,GAAG,UAAU,KAAK,QAAQ,KAAK,MAAM,QAAQ,SAAS,YAAY;AAGjF,WAAO;AAAA,MACL,GAAG,IAAI;AAAA,EAAK,MAAM,MAAM,OAAO,QAAQ,WAAW,EAAE,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,WAAW;AAAA,IACvF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,OAAO,QAA0B;AACxC,SAAO,OAAO,KAAK,aAAa,KAAK,MAAM,EAAE,MAAM,EAAE,SAAS,QAAQ;AACxE;AAEA,SAAS,OAAO,MAA4B;AAC1C,QAAM,QAAQ,OAAO,KAAK,MAAM,QAAQ;AACxC,SAAO,IAAI,aAAa,MAAM,QAAQ,MAAM,YAAY,MAAM,aAAa,CAAC;AAC9E;AAEA,SAAS,IAAI,MAAoB,OAAyB;AACxD,MAAI,MAAM;AACV,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ;AACxC,YAAQ,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK;AAC/C,SAAO;AACT;AAEA,SAAS,UAAU,gBAAgC;AACjD,SAAOI,MAAK,gBAAgB,cAAc,SAAS,mBAAmB;AACxE;AAEA,eAAe,UAAU,gBAAwC;AAC/D,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,MAAMC,WAAS,UAAU,cAAc,GAAG,MAAM,CAAC;AAC3E,QAAI,OAAO,YAAY,KAAK,OAAO,UAAU,SAAS,OAAO,MAAO,QAAO;AAAA,EAC7E,QAAQ;AAAA,EAER;AACA,SAAO,EAAE,SAAS,GAAG,OAAO,OAAO,OAAO,CAAC,EAAE;AAC/C;AAEA,eAAe,UAAU,gBAAwB,OAA6B;AAC5E,QAAM,OAAO,UAAU,cAAc;AACrC,QAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,YAAY,MAAM,KAAK,UAAU,KAAK,CAAC;AAC/C;","names":["readFile","stat","join","resolve","mkdir","readFile","dirname","extname","join","resolve","readFile","dirname","join","resolve","resolve","join","readFile","dirname","resolve","join","dirname","mkdir","readFile","extname","readdir","extname","join","relative","extname","SUPPORTED_EXTENSIONS","extname","normalize","SUPPORTED_EXTENSIONS","extname","walk","readdir","join","relative","chunk","resolve","stat","join","readFile","mkdir","readFile","stat","dirname","join","relative","resolve","sep","createHash","readFile","createHash","readFile","resolve","mkdir","dirname","readFile","stat","join","relative","sep","mkdir","readFile","dirname","join","readFile","stat","isAbsolute","join","relative","readFile","relative","resolve","languageFor","isAbsolute","relative","resolve","sep","resolve","isAbsolute","relative","sep","mkdir","readFile","dirname","join","join","readFile","mkdir","dirname","join","stat","readFile","evidence","expansion","join","sourceHashes","stat","relative","isAbsolute","join","readFile","mkdir","dirname"]}

package/dist/config-GEZFLXK6.js

@@ -1,12 +0,0 @@
-import {
-  redactLlmKeys,
-  resolveLlmConfig
-} from "./chunk-SFMIMLXR.js";
-import "./chunk-KNR2P2UY.js";
-import "./chunk-CG5B3LYG.js";
-import "./chunk-PZ5AY32C.js";
-export {
-  redactLlmKeys,
-  resolveLlmConfig
-};
-//# sourceMappingURL=config-GEZFLXK6.js.map