@jefuriiij/synthra 0.11.0 → 0.12.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (8) hide show
  1. package/CHANGELOG.md +20 -0
  2. package/dist/cli/index.js +133 -3
  3. package/dist/cli/index.js.map +1 -1
  4. package/dist/dashboard/index.js +1 -1
  5. package/dist/dashboard/index.js.map +1 -1
  6. package/dist/server/index.js +132 -2
  7. package/dist/server/index.js.map +1 -1
  8. package/package.json +1 -1
package/dist/server/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../../src/server/http.ts","../../src/activity/activity-log.ts","../../src/activity/file-watcher.ts","../../src/shared/logger.ts","../../src/activity/git-watcher.ts","../../src/cli/scan-command.ts","../../src/scanner/extract.ts","../../src/graph/types.ts","../../src/scanner/hash.ts","../../src/scanner/keywords.ts","../../src/scanner/parse-cache.ts","../../src/scanner/parser.ts","../../src/scanner/parsers/_generic.ts","../../src/scanner/parsers/c.ts","../../src/scanner/parsers/cpp.ts","../../src/scanner/parsers/csharp.ts","../../src/scanner/parsers/dart.ts","../../src/scanner/parsers/go.ts","../../src/scanner/parsers/hubl.ts","../../src/scanner/parsers/java.ts","../../src/scanner/parsers/kotlin.ts","../../src/scanner/parsers/php.ts","../../src/scanner/parsers/python.ts","../../src/scanner/parsers/ruby.ts","../../src/scanner/parsers/rust.ts","../../src/scanner/parsers/typescript.ts","../../src/scanner/parsers/svelte.ts","../../src/scanner/parsers/vue.ts","../../src/scanner/walker.ts","../../src/graph/store.ts","../../src/shared/paths.ts","../../src/cli/bootstrap.ts","../../src/hooks/claude-md.ts","../../src/learn/store.ts","../../src/learn/usage.ts","../../src/learn/runtime.ts","../../src/shared/config.ts","../../src/server/mcp.ts","../../src/graph/rank.ts","../../src/graph/retrieve.ts","../../src/memory/branches.ts","../../src/memory/context-md.ts","../../src/memory/context-store.ts","../../src/memory/index.ts","../../src/packer/format.ts","../../src/packer/inline.ts","../../src/packer/signatures.ts","../../src/packer/tests.ts","../../src/packer/index.ts","../../src/server/port.ts","../../src/server/reindex.ts","../../src/server/routes/activity.ts","../../src/memory/git-snapshot.ts","../../src/memory/session.ts","../../src/server/routes/context-update.ts","../../src/server/routes/gate.ts","../../src/server/routes/bash-observe.ts","../../src/server/routes/query-heuristics.ts","../../src/server/routes/log.ts","../../src/server/routes/pack.ts","../../src/server/routes/prime.ts"],"sourcesContent":["// HTTP server (Hono). Hosts the routes hooks need (/prime, /pack, /log,\n// /gate, /activity) and serves the loaded graph from memory. The MCP-protocol\n// envelope (/mcp endpoint, JSON-RPC) is wired in M3.\n\nimport { serve } from \"@hono/node-server\";\nimport { Hono } from \"hono\";\nimport { writeFile } from \"node:fs/promises\";\n\nimport { ActivityStore } from \"../activity/activity-log.js\";\nimport { createFileWatcher, type FileWatcher } from \"../activity/file-watcher.js\";\nimport { createGitWatcher, type GitWatcher } from \"../activity/git-watcher.js\";\nimport { scanProject } from \"../cli/scan-command.js\";\nimport { readGraph, readSymbolIndex } from \"../graph/store.js\";\nimport { SCHEMA_VERSION } from \"../graph/types.js\";\nimport { LearnRuntime } from \"../learn/runtime.js\";\nimport { loadConfig } from \"../shared/config.js\";\nimport { log } from \"../shared/logger.js\";\nimport type { SynthraPaths } from \"../shared/paths.js\";\nimport type { ServerContext } from \"./context.js\";\nimport { handleMcpRequest } from \"./mcp.js\";\nimport { findFreePort } from \"./port.js\";\nimport { type Reindexer, createReindexer, rescanAndSwap } from \"./reindex.js\";\nimport { handleActivity } from \"./routes/activity.js\";\nimport { handleContextUpdate } from \"./routes/context-update.js\";\nimport { handleGate } from \"./routes/gate.js\";\nimport { handleLog } from \"./routes/log.js\";\nimport { handlePack } from \"./routes/pack.js\";\nimport { handlePrime } from \"./routes/prime.js\";\n\nexport interface ServerHandle {\n port: number;\n url: string;\n stop(): Promise<void>;\n}\n\nexport interface StartOptions {\n /** Override the port range search. */\n port?: number;\n}\n\nasync function loadContext(paths: SynthraPaths): Promise<ServerContext> {\n try {\n let [graph, symbolIndex] = await Promise.all([\n readGraph(paths.infoGraph),\n readSymbolIndex(paths.symbolIndex),\n ]);\n // Schema-migration check (#8): a graph written by an older Synthra may have\n // an incompatible on-disk shape. On a version mismatch, auto-rescan once and\n // reload, rather than serving a stale/incompatible graph.\n if (graph.schema_version !== SCHEMA_VERSION) {\n log.info(`graph schema v${graph.schema_version} ≠ current v${SCHEMA_VERSION} — rescanning…`);\n await scanProject(paths.projectRoot, { silent: true });\n [graph, symbolIndex] = await Promise.all([\n readGraph(paths.infoGraph),\n readSymbolIndex(paths.symbolIndex),\n ]);\n }\n const activity = new ActivityStore(paths.activityLog);\n // Usage-learning runtime: loads the decayed aggregate (replaying the raw\n // access log if the aggregate is cold). Best-effort — never blocks startup.\n const learn = await LearnRuntime.load(paths.accessLog, paths.learnStore);\n return { paths, graph, symbolIndex, activity, learn };\n } catch (err) {\n throw new Error(\n `failed to load graph from ${paths.infoGraph}: ${(err as Error).message}. ` +\n `Run \\`syn scan\\` first.`,\n );\n }\n}\n\nfunction buildApp(ctx: ServerContext, port: number): Hono {\n const app = new Hono();\n\n app.get(\"/\", (c) =>\n c.json({\n service: \"synthra\",\n version: \"0.0.1\",\n port,\n file_count: ctx.graph.file_count,\n symbol_count: ctx.graph.symbol_count,\n generated_at: ctx.graph.generated_at,\n }),\n );\n\n app.get(\"/health\", (c) => c.json({ ok: true }));\n\n app.get(\"/prime\", async (c) => c.json(await handlePrime(ctx, port)));\n\n app.post(\"/pack\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handlePack(body, ctx));\n });\n\n app.post(\"/log\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handleLog(body, ctx));\n });\n\n app.post(\"/gate\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handleGate(body, ctx));\n });\n\n app.get(\"/activity\", async (c) => {\n const sinceParam = c.req.query(\"since\");\n const sinceMs = sinceParam ? Number(sinceParam) : undefined;\n return c.json(await handleActivity(Number.isFinite(sinceMs) ? sinceMs : undefined, ctx));\n });\n\n app.post(\"/context-update\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handleContextUpdate(body, ctx));\n });\n\n app.post(\"/mcp\", async (c) => {\n const body = await c.req.json().catch(() => null);\n return c.json(await handleMcpRequest(body, ctx));\n });\n\n app.onError((err, c) => {\n log.error(\"route error:\", err.message);\n return c.json({ error: err.message }, 400);\n });\n\n return app;\n}\n\nexport async function startServer(\n paths: SynthraPaths,\n options: StartOptions = {},\n): Promise<ServerHandle> {\n const ctx = await loadContext(paths);\n const port = options.port ?? (await findFreePort());\n\n const app = buildApp(ctx, port);\n const nodeServer = serve({ fetch: app.fetch, port, hostname: \"127.0.0.1\" });\n\n await writeFile(paths.mcpPort, String(port), \"utf8\");\n\n // Auto-reindex: a source edit re-runs the incremental scan + swaps the\n // in-memory graph so reads never go stale mid-session (debounced; opt out with\n // SYN_NO_AUTOREINDEX). The watcher already ignores .synthra-graph/, so a scan's\n // own writes can't loop back.\n const cfg = loadConfig();\n const reindexer: Reindexer | null = cfg.autoReindex\n ? createReindexer(ctx, paths, { debounceMs: cfg.reindexDebounceMs })\n : null;\n\n // Spin up the human-activity watchers. Both are best-effort — if chokidar\n // can't watch (e.g. unsupported FS) or .git is missing, they no-op silently.\n const fileWatcher: FileWatcher = createFileWatcher(paths.projectRoot, (e) => {\n void ctx.activity.add(e);\n reindexer?.schedule();\n });\n const gitWatcher: GitWatcher = createGitWatcher(paths.projectRoot, async (e) => {\n await ctx.activity.add(e);\n // Per-branch graph: rebuild on branch switch so the in-memory graph\n // matches whichever branch is currently checked out.\n if (e.kind === \"branch-switch\") {\n const to = (e.details as { to?: string } | undefined)?.to ?? \"unknown\";\n await rescanAndSwap(ctx, paths, `branch ${to}`);\n }\n });\n try {\n await fileWatcher.start();\n } catch (err) {\n log.warn(`file watcher failed to start: ${(err as Error).message}`);\n }\n try {\n await gitWatcher.start();\n } catch (err) {\n log.warn(`git watcher failed to start: ${(err as Error).message}`);\n }\n\n const url = `http://127.0.0.1:${port}`;\n\n return {\n port,\n url,\n async stop() {\n reindexer?.stop();\n await fileWatcher.stop().catch(() => undefined);\n await gitWatcher.stop().catch(() => undefined);\n // Persist any pending usage signal before we go down.\n await ctx.learn?.flush().catch(() => undefined);\n await new Promise<void>((resolve, reject) => {\n nodeServer.close((err) => (err ? reject(err) : resolve()));\n });\n },\n };\n}\n","// Rolling JSONL log of human activity, written to .synthra-graph/activity.jsonl.\n// In-memory ring buffer for fast queries; disk append for durability.\n//\n// The buffer is bounded (defaults to 100 events) so we don't unbounded-grow\n// memory in long sessions. Disk gets every event so the dashboard / future\n// audit tooling can replay history.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nexport interface FileEvent {\n kind: \"save\" | \"create\" | \"delete\";\n path: string;\n ts: string;\n}\n\nexport interface GitEvent {\n kind: \"branch-switch\" | \"stage\" | \"unstage\" | \"diff-change\";\n details: Record<string, unknown>;\n ts: string;\n}\n\nexport type ActivityEvent = FileEvent | GitEvent;\n\nconst DEFAULT_RING_SIZE = 100;\n\nexport class ActivityStore {\n private ring: ActivityEvent[] = [];\n private readonly maxRingSize: number;\n private readonly persistPath: string;\n\n constructor(persistPath: string, maxRingSize = DEFAULT_RING_SIZE) {\n this.persistPath = persistPath;\n this.maxRingSize = maxRingSize;\n }\n\n async add(event: ActivityEvent): Promise<void> {\n this.ring.push(event);\n while (this.ring.length > this.maxRingSize) this.ring.shift();\n await this.persist(event);\n }\n\n /** Get events newer than `sinceMs` (epoch ms). If omitted, returns the full ring. */\n getEvents(sinceMs?: number): ActivityEvent[] {\n if (!sinceMs || !Number.isFinite(sinceMs)) return this.ring.slice();\n const cutoff = new Date(sinceMs).toISOString();\n return this.ring.filter((e) => e.ts >= cutoff);\n }\n\n /** Project-relative file paths that have a save/create event newer than `maxAgeMs` ms ago. */\n recentFilePaths(maxAgeMs: number): string[] {\n const cutoff = new Date(Date.now() - maxAgeMs).toISOString();\n const out = new Set<string>();\n for (const e of this.ring) {\n if (\"path\" in e && (e.kind === \"save\" || e.kind === \"create\") && e.ts >= cutoff) {\n out.add(e.path);\n }\n }\n return Array.from(out);\n }\n\n size(): number {\n return this.ring.length;\n }\n\n private async persist(event: ActivityEvent): Promise<void> {\n try {\n await mkdir(dirname(this.persistPath), { recursive: true });\n await appendFile(this.persistPath, JSON.stringify(event) + \"\\n\", \"utf8\");\n } catch {\n // Durability is best-effort; an unwritable disk shouldn't crash the server.\n }\n }\n}\n","// chokidar-based file watcher. Emits save/create/delete events for human\n// edits inside the project. Respects .gitignore + .synthraignore plus a\n// hard-coded list of always-ignored directories (.git, .synthra*, .claude,\n// node_modules, dist, build, coverage).\n\nimport chokidar, { type FSWatcher } from \"chokidar\";\nimport { readFile } from \"node:fs/promises\";\nimport { join, relative, sep } from \"node:path\";\nimport ignore, { type Ignore } from \"ignore\";\n\nimport { log } from \"../shared/logger.js\";\nimport type { FileEvent } from \"./activity-log.js\";\n\nconst ALWAYS_IGNORE = [\n \".git\",\n \".synthra\",\n \".synthra-graph\",\n \".claude\",\n \"node_modules\",\n \"dist\",\n \"build\",\n \"out\",\n \"coverage\",\n \".next\",\n \".nuxt\",\n \".svelte-kit\",\n \".turbo\",\n \".cache\",\n \".vscode\",\n \".idea\",\n];\n\nexport interface FileWatcher {\n start(): Promise<void>;\n stop(): Promise<void>;\n}\n\nexport type FileEventHandler = (e: FileEvent) => void | Promise<void>;\n\nasync function readIgnoreFile(path: string): Promise<string[]> {\n try {\n const text = await readFile(path, \"utf8\");\n return text\n .split(/\\r?\\n/)\n .map((l) => l.trim())\n .filter((l) => l.length > 0 && !l.startsWith(\"#\"));\n } catch {\n return [];\n }\n}\n\nasync function buildMatcher(root: string): Promise<Ignore> {\n const ig = ignore();\n ig.add(ALWAYS_IGNORE.map((d) => `${d}/`));\n ig.add(await readIgnoreFile(join(root, \".gitignore\")));\n ig.add(await readIgnoreFile(join(root, \".synthraignore\")));\n return ig;\n}\n\nfunction toPosixRel(root: string, abs: string): string {\n const rel = relative(root, abs);\n return sep === \"/\" ? rel : rel.split(sep).join(\"/\");\n}\n\nexport function createFileWatcher(root: string, onEvent: FileEventHandler): FileWatcher {\n let watcher: FSWatcher | null = null;\n let ig: Ignore | null = null;\n\n const emit = async (kind: FileEvent[\"kind\"], abs: string) => {\n if (!ig) return;\n const rel = toPosixRel(root, abs);\n if (!rel || rel.startsWith(\"..\")) return;\n if (ig.ignores(rel)) return;\n try {\n await onEvent({ kind, path: rel, ts: new Date().toISOString() });\n } catch {\n // swallow handler errors — watcher must keep going\n }\n };\n\n return {\n async start() {\n ig = await buildMatcher(root);\n watcher = chokidar.watch(root, {\n // Cross-platform glob ignore. We match both the directory itself and\n // anything inside it. picomatch (chokidar's matcher) normalizes path\n // separators so a single set of forward-slash globs handles\n // Windows + POSIX. Function-based ignore was unreliable on Windows\n // and let chokidar descend into .git/, which crashed on transient\n // index.lock files held exclusively by git.\n ignored: ALWAYS_IGNORE.flatMap((d) => [`**/${d}`, `**/${d}/**`]),\n ignoreInitial: true,\n persistent: true,\n awaitWriteFinish: { stabilityThreshold: 150, pollInterval: 50 },\n });\n\n // Chokidar emits \"error\" for transient OS-level issues — most commonly\n // EPERM/ENOENT on rapidly created+deleted files. We never want one of\n // these to crash the syn process. Log + swallow.\n watcher.on(\"error\", (err) => {\n const e = err as NodeJS.ErrnoException;\n log.debug(`file watcher error (swallowed): ${e?.code ?? \"\"} ${e?.message ?? String(err)}`);\n });\n\n watcher.on(\"add\", (path) => emit(\"create\", path));\n watcher.on(\"change\", (path) => emit(\"save\", path));\n watcher.on(\"unlink\", (path) => emit(\"delete\", path));\n },\n\n async stop() {\n if (watcher) {\n await watcher.close();\n watcher = null;\n }\n },\n };\n}\n","// Minimal logger. Prefixes Synthra output with [syn].\n\ntype Level = \"debug\" | \"info\" | \"warn\" | \"error\";\n\nconst LEVEL_PRIORITY: Record<Level, number> = {\n debug: 10,\n info: 20,\n warn: 30,\n error: 40,\n};\n\nlet activeLevel: Level = (process.env.SYN_LOG_LEVEL as Level) ?? \"info\";\n\nexport function setLevel(level: Level): void {\n activeLevel = level;\n}\n\nfunction shouldLog(level: Level): boolean {\n return LEVEL_PRIORITY[level] >= LEVEL_PRIORITY[activeLevel];\n}\n\nfunction emit(level: Level, msg: string, ...args: unknown[]): void {\n if (!shouldLog(level)) return;\n const stream = level === \"error\" || level === \"warn\" ? process.stderr : process.stdout;\n stream.write(`[syn] ${msg}${args.length ? \" \" + args.map(String).join(\" \") : \"\"}\\n`);\n}\n\nexport const log = {\n debug: (m: string, ...a: unknown[]) => emit(\"debug\", m, ...a),\n info: (m: string, ...a: unknown[]) => emit(\"info\", m, ...a),\n warn: (m: string, ...a: unknown[]) => emit(\"warn\", m, ...a),\n error: (m: string, ...a: unknown[]) => emit(\"error\", m, ...a),\n};\n","// Watches `.git/HEAD` for branch switches (via fs.watch) and polls\n// `git status --porcelain` every ~2s to surface uncommitted-diff changes.\n// Always best-effort: in a non-git directory or when git is missing, the\n// watcher simply emits nothing.\n\nimport { execFile } from \"node:child_process\";\nimport { watch, type FSWatcher } from \"node:fs\";\nimport { readFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { promisify } from \"node:util\";\n\nimport type { GitEvent } from \"./activity-log.js\";\n\nconst execFileAsync = promisify(execFile);\n\nconst POLL_MS = 2000;\n\nexport interface GitWatcher {\n start(): Promise<void>;\n stop(): Promise<void>;\n}\n\nexport type GitEventHandler = (e: GitEvent) => void | Promise<void>;\n\nasync function readHeadBranch(projectRoot: string): Promise<string | null> {\n try {\n const head = await readFile(join(projectRoot, \".git\", \"HEAD\"), \"utf8\");\n const m = head.trim().match(/^ref:\\s+refs\\/heads\\/(.+)$/);\n return m?.[1] ?? null;\n } catch {\n return null;\n }\n}\n\nasync function readStatusPorcelain(projectRoot: string): Promise<string | null> {\n try {\n const { stdout } = await execFileAsync(\"git\", [\"status\", \"--porcelain\"], {\n cwd: projectRoot,\n });\n return stdout;\n } catch {\n return null;\n }\n}\n\nexport function createGitWatcher(root: string, onEvent: GitEventHandler): GitWatcher {\n let headWatcher: FSWatcher | null = null;\n let pollTimer: NodeJS.Timeout | null = null;\n let lastBranch: string | null = null;\n let lastStatus: string | null = null;\n\n const emitSafe = async (event: GitEvent) => {\n try {\n await onEvent(event);\n } catch {\n // swallow\n }\n };\n\n const checkHead = async () => {\n const branch = await readHeadBranch(root);\n if (branch && branch !== lastBranch) {\n const prev = lastBranch;\n lastBranch = branch;\n if (prev !== null) {\n await emitSafe({\n kind: \"branch-switch\",\n details: { from: prev, to: branch },\n ts: new Date().toISOString(),\n });\n }\n }\n };\n\n const pollStatus = async () => {\n const status = await readStatusPorcelain(root);\n if (status === null) return;\n if (lastStatus !== null && status !== lastStatus) {\n const prevFiles = parseStatusFiles(lastStatus);\n const nowFiles = parseStatusFiles(status);\n const added = nowFiles.filter((f) => !prevFiles.includes(f));\n const removed = prevFiles.filter((f) => !nowFiles.includes(f));\n await emitSafe({\n kind: \"diff-change\",\n details: {\n changed_count: nowFiles.length,\n newly_dirty: added,\n newly_clean: removed,\n },\n ts: new Date().toISOString(),\n });\n }\n lastStatus = status;\n };\n\n return {\n async start() {\n // Seed initial branch + status so the first real change emits an event\n // rather than a stale \"from null\".\n lastBranch = await readHeadBranch(root);\n lastStatus = await readStatusPorcelain(root);\n\n try {\n headWatcher = watch(join(root, \".git\", \"HEAD\"), () => {\n void checkHead();\n });\n // fs.watch emits \"error\" for transient OS issues (EPERM on lock\n // files, ENOENT when refs get rewritten). Swallow them — we never\n // want a transient FS event to crash the syn process.\n headWatcher.on(\"error\", () => {\n // silent — branch-switch detection is best-effort\n });\n } catch {\n // .git/HEAD not present — silently no-op\n }\n\n pollTimer = setInterval(() => {\n void pollStatus();\n }, POLL_MS);\n pollTimer.unref?.();\n },\n\n async stop() {\n if (headWatcher) {\n headWatcher.close();\n headWatcher = null;\n }\n if (pollTimer) {\n clearInterval(pollTimer);\n pollTimer = null;\n }\n },\n };\n}\n\nfunction parseStatusFiles(porcelain: string): string[] {\n return porcelain\n .split(/\\r?\\n/)\n .map((l) => l.slice(3).trim())\n .filter((l) => l.length > 0);\n}\n","// `syn scan [path]` — bootstrap then walk + parse + write graph.\n// Also invoked by the default `syn .` flow (M3 will chain start-claude after).\n\nimport { resolve } from \"node:path\";\n\nimport { buildGraph, buildSymbolIndex } from \"../scanner/extract.js\";\nimport { incrementalParse, readParseCache, writeParseCache } from \"../scanner/parse-cache.js\";\nimport { walk, type WalkedFile } from \"../scanner/walker.js\";\nimport { writeGraph, writeSymbolIndex } from \"../graph/store.js\";\nimport { log } from \"../shared/logger.js\";\nimport { resolvePaths } from \"../shared/paths.js\";\nimport { type BootstrapResult, bootstrap } from \"./bootstrap.js\";\n\nconst PARSABLE_EXTS = new Set([\n \".ts\",\n \".tsx\",\n \".cts\",\n \".mts\",\n \".js\",\n \".jsx\",\n \".cjs\",\n \".mjs\",\n \".py\",\n \".pyi\",\n \".svelte\",\n \".vue\",\n \".go\",\n \".rs\",\n \".java\",\n \".kt\",\n \".kts\",\n \".php\",\n \".rb\",\n \".c\",\n \".h\",\n \".cpp\",\n \".cc\",\n \".cxx\",\n \".hpp\",\n \".hh\",\n \".hxx\",\n \".dart\",\n \".cs\",\n]);\n\nexport interface ScanResult {\n walked: number;\n parsed: number;\n symbolCount: number;\n edgeCount: number;\n durationMs: number;\n}\n\nexport interface ScanOptions {\n /** Suppress per-step log output (used for branch-switch rescans). */\n silent?: boolean;\n /** Ignore the parse cache and re-parse every file from scratch. */\n full?: boolean;\n /**\n * Skip the bootstrap step (directories, .gitignore, CLAUDE.md policy patch).\n * Used by in-session reindexes: the project is already bootstrapped, and\n * rewriting watched root files (CLAUDE.md/.gitignore) from a file-change\n * handler would feed the watcher its own edits — an endless rescan loop.\n */\n skipBootstrap?: boolean;\n}\n\n/**\n * Core scan pipeline — bootstrap + walk + parse + write graph. Importable\n * from anywhere (server, CLI, tests). `scanCommand` is just a logging wrapper\n * around this. Pass `silent: true` to skip the chatty progress output.\n */\nexport async function scanProject(\n projectRootRaw: string,\n opts: ScanOptions = {},\n): Promise<ScanResult> {\n const projectRoot = resolve(projectRootRaw);\n const paths = resolvePaths(projectRoot);\n const start = Date.now();\n const verbose = !opts.silent;\n\n if (verbose) log.info(`scanning ${projectRoot}`);\n\n const boot: BootstrapResult | null = opts.skipBootstrap ? null : await bootstrap(paths);\n if (verbose && boot) {\n if (boot.graphCreated) log.info(\" created .synthra-graph/\");\n if (boot.contextCreated) log.info(\" created .synthra/\");\n if (boot.gitignoreUpdated) log.info(\" updated .gitignore\");\n if (boot.claudeMdCreated) {\n log.info(\" created CLAUDE.md — onboarding skeleton for the agent\");\n log.info(\n \" ↳ fill in Build / Conventions / Decisions (or run /init in Claude to auto-draft)\",\n );\n } else if (boot.claudeMdUpdated) {\n log.info(\" updated CLAUDE.md\");\n }\n }\n\n const walked: WalkedFile[] = [];\n for await (const file of walk(projectRoot)) walked.push(file);\n if (verbose) log.info(` walked ${walked.length} files`);\n\n const parsable = walked.filter((f) => PARSABLE_EXTS.has(f.ext));\n const prevCache = await readParseCache(paths.parseCache);\n const { parsed, cache, reused, reparsed, parseErrors } = await incrementalParse(\n parsable,\n prevCache,\n { full: opts.full },\n );\n if (verbose) {\n log.info(\n ` parsed ${parsed.length} files (${reused} reused · ${reparsed} reparsed` +\n (parseErrors ? `, ${parseErrors} errored` : \"\") +\n `; ${walked.length - parsable.length} non-code skipped)`,\n );\n }\n\n const graph = await buildGraph(projectRoot, parsed);\n const symbolIndex = buildSymbolIndex(graph);\n\n await writeGraph(paths.infoGraph, graph);\n await writeSymbolIndex(paths.symbolIndex, symbolIndex);\n await writeParseCache(paths.parseCache, cache);\n\n if (verbose) {\n log.info(\n ` wrote ${paths.infoGraph} — ${graph.symbol_count} symbols, ${graph.edge_count} edges`,\n );\n log.info(` wrote ${paths.symbolIndex} — ${Object.keys(symbolIndex).length} names`);\n }\n\n const durationMs = Date.now() - start;\n if (verbose) log.info(`done in ${(durationMs / 1000).toFixed(2)}s`);\n\n return {\n walked: walked.length,\n parsed: parsed.length,\n symbolCount: graph.symbol_count,\n edgeCount: graph.edge_count,\n durationMs,\n };\n}\n\n// Thin alias so the CLI command keeps its current name. Drop in v0.2 if we\n// settle on a single public function.\nexport async function scanCommand(rawPath: string, opts: ScanOptions = {}): Promise<ScanResult> {\n return scanProject(rawPath, opts);\n}\n","// Turns ParsedFile[] into a GraphSchema (nodes + edges).\n//\n// Edges produced in M1:\n// defines : file → symbol\n// imports : file → file (when the import target resolves inside the project)\n// tests : test-file → source-file (for foo.test.ts ↔ foo.ts)\n\nimport { dirname, join, posix } from \"node:path\";\n\nimport type { Edge, FileNode, GraphSchema, SymbolIndex, SymbolNode } from \"../graph/types.js\";\nimport { SCHEMA_VERSION } from \"../graph/types.js\";\nimport { fileHash } from \"./hash.js\";\nimport { extractKeywords } from \"./keywords.js\";\nimport type { CallSite, ParsedFile, ParsedSymbol } from \"./parser.js\";\n\nconst RESOLVE_EXTS = [\n \".ts\",\n \".tsx\",\n \".js\",\n \".jsx\",\n \".mjs\",\n \".cjs\",\n \".py\",\n \".svelte\",\n \".vue\",\n \".dart\",\n \".html\",\n \".hubl\",\n];\nconst INDEX_FILES = [\"index.ts\", \"index.tsx\", \"index.js\", \"index.jsx\", \"__init__.py\"];\n\nfunction fileId(relPath: string): string {\n return `file:${relPath}`;\n}\n\nfunction symbolId(relPath: string, sym: ParsedSymbol): string {\n return `symbol:${relPath}::${sym.name}:${sym.startLine}`;\n}\n\nfunction toFileNode(parsed: ParsedFile): FileNode {\n const content = parsed.source;\n return {\n id: fileId(parsed.file.relPath),\n kind: \"file\",\n path: parsed.file.relPath,\n ext: parsed.file.ext,\n size: parsed.file.size,\n keywords: extractKeywords(content, parsed.file.ext),\n content,\n summary: extractSummary(content),\n file_hash: fileHash(content),\n };\n}\n\nfunction extractSummary(content: string): string {\n // First leading comment block (// ... or /** ... */ or # ...), trimmed to ~200 chars.\n const trimmed = content.replace(/^\\s+/, \"\");\n const slashMatch = trimmed.match(/^\\/\\/\\s?(.*(?:\\r?\\n\\/\\/\\s?.*)*)/);\n if (slashMatch?.[1]) return slashMatch[1].split(/\\r?\\n/).join(\" \").trim().slice(0, 200);\n const blockMatch = trimmed.match(/^\\/\\*\\*?([\\s\\S]*?)\\*\\//);\n if (blockMatch?.[1]) {\n return blockMatch[1]\n .split(/\\r?\\n/)\n .map((l) => l.replace(/^\\s*\\*\\s?/, \"\"))\n .join(\" \")\n .trim()\n .slice(0, 200);\n }\n const hashMatch = trimmed.match(/^#\\s?(.*(?:\\r?\\n#\\s?.*)*)/);\n if (hashMatch?.[1]) return hashMatch[1].split(/\\r?\\n/).join(\" \").trim().slice(0, 200);\n return \"\";\n}\n\nfunction toSymbolNode(parsed: ParsedFile, sym: ParsedSymbol): SymbolNode {\n return {\n id: symbolId(parsed.file.relPath, sym),\n kind: \"symbol\",\n symbol_kind: sym.kind,\n name: sym.name,\n file: parsed.file.relPath,\n start_line: sym.startLine,\n end_line: sym.endLine,\n signature: sym.signature,\n };\n}\n\n/**\n * Resolve an import specifier to a project-relative path if it refers to a\n * file inside the project. Returns `null` for external packages (no leading\n * dot) or specifiers that don't match any known file.\n */\n// Strip a trailing JS-family extension so a spec like \"./crypto.js\" can\n// resolve to \"crypto.ts\". TypeScript-style `.js` imports are common.\nconst REWRITE_EXT_RE = /\\.(js|jsx|mjs|cjs)$/;\n\nfunction resolveImport(\n fromRelPath: string,\n spec: string,\n filesByPath: Map<string, true>,\n): string | null {\n if (!spec.startsWith(\".\")) return null;\n const fromDir = posix.dirname(toPosix(fromRelPath));\n const base = posix.normalize(posix.join(fromDir, toPosix(spec)));\n\n const candidates = [base];\n const rewritten = base.replace(REWRITE_EXT_RE, \"\");\n if (rewritten !== base) candidates.push(rewritten);\n\n for (const c of candidates) {\n if (filesByPath.has(c)) return c;\n for (const ext of RESOLVE_EXTS) {\n if (filesByPath.has(c + ext)) return c + ext;\n }\n for (const idx of INDEX_FILES) {\n const candidate = posix.join(c, idx);\n if (filesByPath.has(candidate)) return candidate;\n }\n }\n return null;\n}\n\nfunction toPosix(p: string): string {\n return p.split(/[\\\\/]/).join(\"/\");\n}\n\nconst TEST_RE = /^(?<base>.+?)\\.(test|spec)\\.(?<ext>[tj]sx?|py)$/;\n\nfunction testTarget(relPath: string, filesByPath: Map<string, true>): string | null {\n const fileName = relPath.split(\"/\").pop() ?? relPath;\n const match = TEST_RE.exec(fileName);\n if (!match) return null;\n const dir = relPath.includes(\"/\") ? relPath.slice(0, relPath.lastIndexOf(\"/\") + 1) : \"\";\n const base = match.groups?.base ?? \"\";\n const ext = match.groups?.ext ?? \"\";\n if (!base || !ext) return null;\n const candidate = `${dir}${base}.${ext}`;\n if (filesByPath.has(candidate)) return candidate;\n // Try sibling extensions (e.g. foo.test.ts → foo.tsx)\n for (const e of RESOLVE_EXTS) {\n const alt = `${dir}${base}${e}`;\n if (filesByPath.has(alt)) return alt;\n }\n return null;\n}\n\nexport async function buildGraph(root: string, parsed: ParsedFile[]): Promise<GraphSchema> {\n const filesByPath = new Map<string, true>();\n for (const p of parsed) filesByPath.set(p.file.relPath, true);\n\n const nodes: (FileNode | SymbolNode)[] = [];\n const edges: Edge[] = [];\n\n // Collected during the file loop, then resolved into `calls` edges in one pass\n // (callee resolution needs the full symbol set).\n const symbolsByFile = new Map<string, SymbolNode[]>();\n const callsByFile = new Map<string, CallSite[]>();\n\n for (const p of parsed) {\n const fileNode = toFileNode(p);\n nodes.push(fileNode);\n\n const fileSymNodes: SymbolNode[] = [];\n for (const sym of p.symbols) {\n const symNode = toSymbolNode(p, sym);\n nodes.push(symNode);\n fileSymNodes.push(symNode);\n edges.push({ from: fileNode.id, to: symNode.id, kind: \"defines\" });\n }\n symbolsByFile.set(p.file.relPath, fileSymNodes);\n callsByFile.set(p.file.relPath, p.calls);\n\n const importEdges = new Set<string>();\n for (const spec of p.imports) {\n const target = resolveImport(p.file.relPath, spec, filesByPath);\n if (!target) continue;\n const key = `${fileNode.id}->${fileId(target)}`;\n if (importEdges.has(key)) continue;\n importEdges.add(key);\n edges.push({ from: fileNode.id, to: fileId(target), kind: \"imports\" });\n }\n\n const testTargetPath = testTarget(p.file.relPath, filesByPath);\n if (testTargetPath && testTargetPath !== p.file.relPath) {\n edges.push({ from: fileNode.id, to: fileId(testTargetPath), kind: \"tests\" });\n }\n }\n\n edges.push(...buildCallEdges(symbolsByFile, callsByFile));\n\n const symbolCount = nodes.filter((n) => n.kind === \"symbol\").length;\n const fileCount = nodes.length - symbolCount;\n\n return {\n root,\n node_count: nodes.length,\n edge_count: edges.length,\n file_count: fileCount,\n symbol_count: symbolCount,\n nodes,\n edges,\n generated_at: new Date().toISOString(),\n schema_version: SCHEMA_VERSION,\n };\n}\n\nexport function buildSymbolIndex(graph: GraphSchema): SymbolIndex {\n // Null-prototype map: symbol names like \"toString\" or \"constructor\" (common\n // in Dart, where every class overrides toString) would otherwise resolve to\n // an inherited Object.prototype member and crash on the .push below.\n const out: SymbolIndex = Object.create(null);\n for (const node of graph.nodes) {\n if (node.kind !== \"symbol\") continue;\n const list = out[node.name] ?? (out[node.name] = []);\n list.push({ file: node.file, line: node.start_line, kind: node.symbol_kind });\n }\n return out;\n}\n\n/** The same-file symbol whose [start_line, end_line] tightest-contains `line`\n * (smallest span wins, so an inner method beats its enclosing class). null if\n * the line is outside every symbol (e.g. a module-level call). */\nexport function tightestContainer(syms: SymbolNode[], line: number): SymbolNode | null {\n let best: SymbolNode | null = null;\n for (const s of syms) {\n if (line < s.start_line || line > s.end_line) continue;\n if (!best || s.end_line - s.start_line < best.end_line - best.start_line) best = s;\n }\n return best;\n}\n\n/**\n * Resolve raw call sites into symbol→symbol `calls` edges. Name-based (no type\n * info), precision-first:\n * - caller = the call site's tightest-containing symbol in the SAME file\n * (no container, e.g. a top-level call → skipped)\n * - callee = a same-file symbol of that name, else the UNIQUE repo-wide symbol\n * of that name; 0 matches (external/builtin) or >1 (ambiguous) → skipped\n * Recursion self-edges and duplicates are dropped.\n */\nexport function buildCallEdges(\n symbolsByFile: Map<string, SymbolNode[]>,\n callsByFile: Map<string, CallSite[]>,\n): Edge[] {\n // Repo-wide name → symbols index, for the cross-file fallback.\n const byName = new Map<string, SymbolNode[]>();\n for (const syms of symbolsByFile.values()) {\n for (const s of syms) {\n const list = byName.get(s.name);\n if (list) list.push(s);\n else byName.set(s.name, [s]);\n }\n }\n\n const edges: Edge[] = [];\n const seen = new Set<string>();\n\n for (const [relPath, sites] of callsByFile) {\n const fileSyms = symbolsByFile.get(relPath) ?? [];\n for (const site of sites) {\n const caller = tightestContainer(fileSyms, site.line);\n if (!caller) continue;\n\n let callee = fileSyms.find((s) => s.name === site.callee);\n if (!callee) {\n const cands = byName.get(site.callee) ?? [];\n if (cands.length !== 1) continue; // 0 = external/builtin, >1 = ambiguous\n callee = cands[0];\n }\n if (!callee || callee.id === caller.id) continue; // skip recursion self-edges\n\n const key = `${caller.id}->${callee.id}`;\n if (seen.has(key)) continue;\n seen.add(key);\n edges.push({ from: caller.id, to: callee.id, kind: \"calls\" });\n }\n }\n return edges;\n}\n\n// Re-export node path helpers in case downstream wants the canonical id format\nexport { fileId, symbolId };\n// Suppress unused-import lint for dirname/join from node:path — kept reserved for incremental updates.\nvoid dirname;\nvoid join;\n","// Shared graph schema. Other modules read/write these shapes.\n\nexport type NodeKind = \"file\" | \"symbol\";\n\nexport type SymbolKind =\n | \"function\"\n | \"method\"\n | \"class\"\n | \"interface\"\n | \"type\"\n | \"const\"\n | \"enum\"\n | \"component\";\n\nexport interface FileNode {\n id: string;\n kind: \"file\";\n path: string;\n ext: string;\n size: number;\n keywords: string[];\n content: string;\n summary: string;\n file_hash: string;\n}\n\nexport interface SymbolNode {\n id: string;\n kind: \"symbol\";\n symbol_kind: SymbolKind;\n name: string;\n file: string;\n start_line: number;\n end_line: number;\n signature: string;\n}\n\nexport type GraphNode = FileNode | SymbolNode;\n\nexport type EdgeKind = \"imports\" | \"calls\" | \"defines\" | \"tests\";\n\nexport interface Edge {\n from: string;\n to: string;\n kind: EdgeKind;\n}\n\n// Bump when the on-disk info_graph.json shape changes incompatibly. The server\n// auto-rescans on load when a stored graph's schema_version differs (#8).\n// v2: `calls` edges are now populated.\nexport const SCHEMA_VERSION = 2;\n\nexport interface GraphSchema {\n root: string;\n node_count: number;\n edge_count: number;\n file_count: number;\n symbol_count: number;\n nodes: GraphNode[];\n edges: Edge[];\n generated_at: string;\n schema_version: number;\n}\n\nexport interface SymbolIndex {\n [name: string]: Array<{ file: string; line: number; kind: SymbolKind }>;\n}\n","// Stable, short content hash for files. Used to detect changed files\n// during incremental rescans (post-v0.1; M1 does full re-parse).\n// TODO: M1 (minimal); post-v0.1 (incremental)\n\nimport { createHash } from \"node:crypto\";\n\nexport function fileHash(content: string): string {\n return createHash(\"sha1\").update(content).digest(\"hex\").slice(0, 8);\n}\n","// Per-file keyword extraction. Used for query-time relevance ranking.\n// Tokenizes identifiers + comment words, splits camelCase/snake_case, filters\n// stopwords, and returns the top-N rare tokens scored by inverse frequency\n// against a small built-in english/code corpus.\n\nconst STOPWORDS = new Set([\n \"a\",\n \"an\",\n \"and\",\n \"are\",\n \"as\",\n \"at\",\n \"be\",\n \"but\",\n \"by\",\n \"do\",\n \"for\",\n \"from\",\n \"has\",\n \"have\",\n \"he\",\n \"if\",\n \"in\",\n \"is\",\n \"it\",\n \"its\",\n \"not\",\n \"of\",\n \"on\",\n \"or\",\n \"she\",\n \"that\",\n \"the\",\n \"they\",\n \"this\",\n \"to\",\n \"was\",\n \"we\",\n \"were\",\n \"will\",\n \"with\",\n \"you\",\n \"your\",\n \"i\",\n \"me\",\n \"my\",\n \"our\",\n \"us\",\n \"their\",\n \"them\",\n \"his\",\n \"her\",\n // common code words that add no signal\n \"function\",\n \"const\",\n \"let\",\n \"var\",\n \"class\",\n \"interface\",\n \"type\",\n \"enum\",\n \"import\",\n \"export\",\n \"from\",\n \"default\",\n \"return\",\n \"if\",\n \"else\",\n \"for\",\n \"while\",\n \"do\",\n \"switch\",\n \"case\",\n \"break\",\n \"continue\",\n \"new\",\n \"this\",\n \"super\",\n \"throw\",\n \"try\",\n \"catch\",\n \"finally\",\n \"async\",\n \"await\",\n \"yield\",\n \"true\",\n \"false\",\n \"null\",\n \"undefined\",\n \"void\",\n \"any\",\n \"string\",\n \"number\",\n \"boolean\",\n \"object\",\n \"array\",\n \"self\",\n \"cls\",\n \"def\",\n \"lambda\",\n \"pass\",\n \"raise\",\n \"with\",\n \"as\",\n \"in\",\n \"todo\",\n \"fixme\",\n \"note\",\n]);\n\nconst COMMON_CODE = new Set([\n \"value\",\n \"data\",\n \"result\",\n \"args\",\n \"kwargs\",\n \"options\",\n \"config\",\n \"params\",\n \"name\",\n \"id\",\n \"key\",\n \"index\",\n \"item\",\n \"items\",\n \"list\",\n \"map\",\n \"set\",\n \"get\",\n \"set\",\n \"add\",\n \"remove\",\n \"delete\",\n \"create\",\n \"update\",\n \"find\",\n \"fetch\",\n \"load\",\n \"save\",\n \"init\",\n \"main\",\n \"run\",\n \"start\",\n \"stop\",\n \"test\",\n \"check\",\n \"validate\",\n \"error\",\n \"err\",\n \"warn\",\n \"info\",\n \"debug\",\n \"log\",\n \"trace\",\n \"msg\",\n \"message\",\n \"path\",\n \"file\",\n \"dir\",\n \"url\",\n \"host\",\n \"port\",\n \"size\",\n \"length\",\n \"count\",\n \"input\",\n \"output\",\n \"source\",\n \"target\",\n \"callback\",\n \"handler\",\n \"listener\",\n \"props\",\n \"state\",\n \"context\",\n \"render\",\n \"component\",\n \"node\",\n \"tree\",\n \"root\",\n]);\n\n// Frequency weight — common-code words count for less than rare identifiers\nfunction score(token: string): number {\n if (STOPWORDS.has(token)) return 0;\n if (COMMON_CODE.has(token)) return 0.2;\n if (token.length <= 2) return 0.1;\n return 1;\n}\n\nfunction splitIdentifier(id: string): string[] {\n // snake_case + kebab-case → words\n const partsRaw = id.split(/[_\\-./]+/).filter(Boolean);\n const out: string[] = [];\n for (const part of partsRaw) {\n // camelCase / PascalCase → words. Handles \"XMLHttp\" → [\"XML\", \"Http\"]\n const camelParts = part.match(/[A-Z]+(?=[A-Z][a-z])|[A-Z]?[a-z]+|[A-Z]+|[0-9]+/g);\n if (camelParts) out.push(...camelParts);\n else out.push(part);\n }\n return out.map((w) => w.toLowerCase()).filter((w) => /[a-z]/.test(w));\n}\n\nexport function extractKeywords(content: string, _ext: string): string[] {\n // Identifiers + alphanumeric words. Picks up both code and comment text.\n const tokens = content.match(/[A-Za-z_][A-Za-z0-9_]{1,40}/g) ?? [];\n const counts = new Map<string, number>();\n for (const tok of tokens) {\n for (const word of splitIdentifier(tok)) {\n const w = score(word);\n if (w === 0) continue;\n counts.set(word, (counts.get(word) ?? 0) + w);\n }\n }\n return Array.from(counts.entries())\n .sort((a, b) => b[1] - a[1])\n .slice(0, 32)\n .map(([w]) => w);\n}\n","// Incremental-scan parse cache. Stores per-file parse results keyed by content\n// hash so a rescan can reuse unchanged files' symbols/imports and only re-run\n// the expensive tree-sitter parse on files that actually changed.\n//\n// Source is NOT stored here — it's re-read at scan time to compute the hash and\n// reused as ParsedFile.source, keeping the cache small (the graph holds content\n// separately). Lives in .synthra-graph/ (gitignored, machine-local).\n//\n// BUMP PARSE_CACHE_VERSION whenever parser/extract output shape or a tree-sitter\n// grammar changes — readParseCache returns an empty cache on a version mismatch,\n// forcing a full re-parse so stale symbols can never leak into the graph.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { fileHash } from \"./hash.js\";\nimport { parseSource, type CallSite, type ParsedFile, type ParsedSymbol } from \"./parser.js\";\nimport type { WalkedFile } from \"./walker.js\";\n\n// Bumped to 2 when call sites were added to the parse output (the calls shape\n// changed) — old caches invalidate and re-parse cleanly.\nexport const PARSE_CACHE_VERSION = 2;\n\nexport interface CachedParse {\n hash: string;\n symbols: ParsedSymbol[];\n imports: string[];\n calls: CallSite[];\n}\n\nexport interface ParseCache {\n schema_version: number;\n files: Record<string, CachedParse>;\n}\n\nexport function emptyParseCache(): ParseCache {\n return { schema_version: PARSE_CACHE_VERSION, files: {} };\n}\n\nexport async function readParseCache(path: string): Promise<ParseCache> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<ParseCache>;\n if (\n parsed.schema_version !== PARSE_CACHE_VERSION ||\n typeof parsed.files !== \"object\" ||\n parsed.files === null\n ) {\n return emptyParseCache();\n }\n return { schema_version: PARSE_CACHE_VERSION, files: parsed.files as ParseCache[\"files\"] };\n } catch {\n return emptyParseCache();\n }\n}\n\nexport async function writeParseCache(path: string, cache: ParseCache): Promise<void> {\n try {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, `${JSON.stringify(cache)}\\n`, \"utf8\");\n } catch {\n // Best-effort: a missing/unwritable cache just means the next scan is full.\n }\n}\n\nexport interface IncrementalParseResult {\n parsed: ParsedFile[];\n cache: ParseCache;\n reused: number;\n reparsed: number;\n parseErrors: number;\n}\n\n/**\n * Parse `parsable` files, reusing prior results for files whose content hash is\n * unchanged. Returns the FULL ParsedFile[] (reused + freshly parsed) — so\n * `buildGraph` re-resolves every cross-file edge exactly as in a full scan —\n * plus a rebuilt cache containing only the currently-present files (deletions\n * and renames drop out naturally). Pass `full: true` to ignore the cache and\n * re-parse everything.\n */\nexport async function incrementalParse(\n parsable: WalkedFile[],\n prev: ParseCache,\n opts: { full?: boolean } = {},\n): Promise<IncrementalParseResult> {\n const cache = emptyParseCache();\n const parsed: ParsedFile[] = [];\n let reused = 0;\n let reparsed = 0;\n let parseErrors = 0;\n\n for (const f of parsable) {\n let source: string;\n try {\n source = await readFile(f.absPath, \"utf8\");\n } catch {\n continue; // unreadable → skip, same as a failed read in parseFile\n }\n const hash = fileHash(source);\n\n const cached = opts.full ? undefined : prev.files[f.relPath];\n if (cached && cached.hash === hash) {\n parsed.push({\n file: f,\n source,\n symbols: cached.symbols,\n imports: cached.imports,\n calls: cached.calls,\n });\n cache.files[f.relPath] = cached;\n reused += 1;\n continue;\n }\n\n try {\n const p = await parseSource(f, source);\n parsed.push(p);\n cache.files[f.relPath] = { hash, symbols: p.symbols, imports: p.imports, calls: p.calls };\n reparsed += 1;\n } catch {\n // Mirror scanProject's prior behavior: a parse failure drops the file\n // from the graph (and the cache) rather than failing the whole scan.\n parseErrors += 1;\n }\n }\n\n return { parsed, cache, reused, reparsed, parseErrors };\n}\n","// Dispatches a file to its language-specific parser based on extension.\n// Tree-sitter WASM grammars are loaded lazily via tree-sitter-wasms and\n// cached per language for the lifetime of the process.\n\nimport { readFile } from \"node:fs/promises\";\nimport { createRequire } from \"node:module\";\nimport { Language, Parser } from \"web-tree-sitter\";\n\nimport type { SymbolKind } from \"../graph/types.js\";\nimport { parseC } from \"./parsers/c.js\";\nimport { parseCpp } from \"./parsers/cpp.js\";\nimport { parseCSharp } from \"./parsers/csharp.js\";\nimport { parseDart } from \"./parsers/dart.js\";\nimport { parseGo } from \"./parsers/go.js\";\nimport { parseHubL } from \"./parsers/hubl.js\";\nimport { parseJava } from \"./parsers/java.js\";\nimport { parseKotlin } from \"./parsers/kotlin.js\";\nimport { parsePhp } from \"./parsers/php.js\";\nimport { parsePython } from \"./parsers/python.js\";\nimport { parseRuby } from \"./parsers/ruby.js\";\nimport { parseRust } from \"./parsers/rust.js\";\nimport { parseSvelte } from \"./parsers/svelte.js\";\nimport { parseTypeScript } from \"./parsers/typescript.js\";\nimport { parseVue } from \"./parsers/vue.js\";\nimport type { WalkedFile } from \"./walker.js\";\n\nexport interface ParsedSymbol {\n name: string;\n kind: SymbolKind;\n startLine: number;\n endLine: number;\n signature: string;\n}\n\n/** A raw call site: the bare callee name as written (e.g. \"login\", not\n * \"auth.login\") + its 1-based line. Caller attribution + callee resolution\n * happen centrally in buildGraph (which has the full file set). */\nexport interface CallSite {\n callee: string;\n line: number;\n}\n\nexport interface ParsedFile {\n file: WalkedFile;\n source: string;\n symbols: ParsedSymbol[];\n imports: string[];\n calls: CallSite[];\n}\n\nconst require = createRequire(import.meta.url);\n\nexport type GrammarName =\n | \"typescript\"\n | \"tsx\"\n | \"javascript\"\n | \"python\"\n | \"go\"\n | \"rust\"\n | \"java\"\n | \"kotlin\"\n | \"php\"\n | \"ruby\"\n | \"c\"\n | \"cpp\"\n | \"dart\"\n | \"csharp\";\n\nconst GRAMMAR_FILES: Record<GrammarName, string> = {\n typescript: \"tree-sitter-wasms/out/tree-sitter-typescript.wasm\",\n tsx: \"tree-sitter-wasms/out/tree-sitter-tsx.wasm\",\n javascript: \"tree-sitter-wasms/out/tree-sitter-javascript.wasm\",\n python: \"tree-sitter-wasms/out/tree-sitter-python.wasm\",\n go: \"tree-sitter-wasms/out/tree-sitter-go.wasm\",\n rust: \"tree-sitter-wasms/out/tree-sitter-rust.wasm\",\n java: \"tree-sitter-wasms/out/tree-sitter-java.wasm\",\n kotlin: \"tree-sitter-wasms/out/tree-sitter-kotlin.wasm\",\n php: \"tree-sitter-wasms/out/tree-sitter-php.wasm\",\n ruby: \"tree-sitter-wasms/out/tree-sitter-ruby.wasm\",\n c: \"tree-sitter-wasms/out/tree-sitter-c.wasm\",\n cpp: \"tree-sitter-wasms/out/tree-sitter-cpp.wasm\",\n dart: \"tree-sitter-wasms/out/tree-sitter-dart.wasm\",\n csharp: \"tree-sitter-wasms/out/tree-sitter-c_sharp.wasm\",\n};\n\nlet parserInit: Promise<void> | null = null;\nconst languageCache = new Map<GrammarName, Language>();\n\nasync function ensureParserInit(): Promise<void> {\n if (!parserInit) {\n parserInit = Parser.init();\n }\n return parserInit;\n}\n\nexport async function loadGrammar(name: GrammarName): Promise<Language> {\n await ensureParserInit();\n const cached = languageCache.get(name);\n if (cached) return cached;\n const wasmPath = require.resolve(GRAMMAR_FILES[name]);\n const lang = await Language.load(wasmPath);\n languageCache.set(name, lang);\n return lang;\n}\n\nexport interface LoadedParser {\n parser: Parser;\n language: Language;\n}\n\nexport async function createParser(name: GrammarName): Promise<LoadedParser> {\n const language = await loadGrammar(name);\n const parser = new Parser();\n parser.setLanguage(language);\n return { parser, language };\n}\n\nfunction emptyParsed(file: WalkedFile, source: string): ParsedFile {\n return { file, source, symbols: [], imports: [], calls: [] };\n}\n\nexport async function parseFile(f: WalkedFile): Promise<ParsedFile> {\n let source: string;\n try {\n source = await readFile(f.absPath, \"utf8\");\n } catch {\n return emptyParsed(f, \"\");\n }\n return parseSource(f, source);\n}\n\n/** Parse already-read source. Split from parseFile so the incremental scanner\n * can read a file's content once (to hash it) and parse from that same string\n * on a cache miss — avoiding a second read. */\nexport async function parseSource(f: WalkedFile, source: string): Promise<ParsedFile> {\n switch (f.ext) {\n case \".ts\":\n case \".tsx\":\n case \".cts\":\n case \".mts\":\n case \".js\":\n case \".jsx\":\n case \".cjs\":\n case \".mjs\":\n return parseTypeScript(f, source);\n case \".py\":\n case \".pyi\":\n return parsePython(f, source);\n case \".svelte\":\n return parseSvelte(f, source);\n case \".vue\":\n return parseVue(f, source);\n case \".html\":\n case \".hubl\":\n return parseHubL(f, source);\n case \".go\":\n return parseGo(f, source);\n case \".rs\":\n return parseRust(f, source);\n case \".java\":\n return parseJava(f, source);\n case \".kt\":\n case \".kts\":\n return parseKotlin(f, source);\n case \".php\":\n return parsePhp(f, source);\n case \".rb\":\n return parseRuby(f, source);\n case \".c\":\n case \".h\":\n return parseC(f, source);\n case \".cpp\":\n case \".cc\":\n case \".cxx\":\n case \".hpp\":\n case \".hh\":\n case \".hxx\":\n return parseCpp(f, source);\n case \".dart\":\n return parseDart(f, source);\n case \".cs\":\n return parseCSharp(f, source);\n default:\n return emptyParsed(f, source);\n }\n}\n","// Generic tree-sitter parser used by the simpler-grammar languages\n// (Go, Rust, Java, Kotlin, PHP, Ruby, C, C++, Dart, C#).\n//\n// Each language file defines:\n// - which tree-sitter grammar to load\n// - a query string with capture names like `@function`, `@function.name`\n// - a `decls` table mapping declaration-capture pairs to SymbolKind\n// - optional `importCapture` for collecting import edges\n// Everything else (parser init, error handling, dedupe) lives here.\n\nimport { Query, type Node } from \"web-tree-sitter\";\n\nimport type { SymbolKind } from \"../../graph/types.js\";\nimport {\n createParser,\n type CallSite,\n type GrammarName,\n type ParsedFile,\n type ParsedSymbol,\n} from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nexport interface DeclCapture {\n /** Capture name for the declaration node, e.g. \"function\". */\n declCapture: string;\n /** Capture name for the symbol's name node, e.g. \"function.name\". */\n nameCapture: string;\n /** SymbolKind to assign. */\n kind: SymbolKind;\n}\n\nexport interface GenericParserConfig {\n grammar: GrammarName;\n query: string;\n decls: DeclCapture[];\n /** Capture name for import-source nodes. Skipped when omitted. */\n importCapture?: string;\n /** Capture name for the whole call-site node (for its line). */\n callCapture?: string;\n /** Capture name for the callee-name node. Both call captures must be set. */\n callCalleeCapture?: string;\n}\n\nexport function firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\nfunction cleanImport(s: string): string {\n // Strip surrounding string-literal quotes (used by Go, Dart, C/C++).\n // Strip angle brackets used by C/C++ system includes.\n return s.replace(/^[\"'`<]+|[\"'`>]+$/g, \"\").trim();\n}\n\nexport async function runGenericParser(\n config: GenericParserConfig,\n f: WalkedFile,\n source: string,\n): Promise<ParsedFile> {\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n const calls: CallSite[] = [];\n\n try {\n const { parser, language } = await createParser(config.grammar);\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls };\n\n const query = new Query(language, config.query);\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n let matched: DeclCapture | null = null;\n for (const d of config.decls) {\n if (byName.has(d.declCapture) && byName.has(d.nameCapture)) {\n matched = d;\n break;\n }\n }\n\n if (matched) {\n const declNode = byName.get(matched.declCapture)!;\n const nameNode = byName.get(matched.nameCapture)!;\n symbols.push({\n name: nameNode.text,\n kind: matched.kind,\n startLine: declNode.startPosition.row + 1,\n endLine: declNode.endPosition.row + 1,\n signature: firstLine(declNode.text),\n });\n continue;\n }\n\n if (config.callCapture && config.callCalleeCapture) {\n const callNode = byName.get(config.callCapture);\n const calleeNode = byName.get(config.callCalleeCapture);\n if (callNode && calleeNode) {\n calls.push({ callee: calleeNode.text, line: callNode.startPosition.row + 1 });\n continue;\n }\n }\n\n if (config.importCapture) {\n const imp = byName.get(config.importCapture);\n if (imp) imports.push(cleanImport(imp.text));\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const k = `${s.name}:${s.startLine}`;\n if (seen.has(k)) return false;\n seen.add(k);\n return true;\n });\n imports = Array.from(new Set(imports)).filter((s) => s.length > 0);\n } catch {\n // Query compile or parse failure — return what we have. Silent so a single\n // bad file doesn't abort the whole scan.\n }\n\n return { file: f, source, symbols, imports, calls };\n}\n","// C parser. Function definitions, structs, enums, typedefs, #include directives.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_definition declarator: (function_declarator declarator: (identifier) @function.name)) @function\n(struct_specifier name: (type_identifier) @struct.name) @struct\n(enum_specifier name: (type_identifier) @enum.name) @enum\n(type_definition declarator: (type_identifier) @type.name) @type\n(preproc_include path: (string_literal) @import)\n(preproc_include path: (system_lib_string) @import)\n(call_expression function: (identifier) @call.name) @call\n`;\n\nexport async function parseC(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"c\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"type\", nameCapture: \"type.name\", kind: \"type\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// C++ parser. Functions, classes, structs, enums, namespaces, #includes.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_definition declarator: (function_declarator declarator: (identifier) @function.name)) @function\n(function_definition declarator: (function_declarator declarator: (qualified_identifier) @method.name)) @method\n(class_specifier name: (type_identifier) @class.name) @class\n(struct_specifier name: (type_identifier) @struct.name) @struct\n(enum_specifier name: (type_identifier) @enum.name) @enum\n(namespace_definition name: (namespace_identifier) @namespace.name) @namespace\n(preproc_include path: (string_literal) @import)\n(preproc_include path: (system_lib_string) @import)\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (field_expression field: (field_identifier) @call.name)) @call\n(call_expression function: (qualified_identifier name: (identifier) @call.name)) @call\n`;\n\nexport async function parseCpp(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"cpp\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"namespace\", nameCapture: \"namespace.name\", kind: \"class\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// C# (.NET) parser. Classes, interfaces, structs, methods, namespaces.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(class_declaration name: (identifier) @class.name) @class\n(interface_declaration name: (identifier) @interface.name) @interface\n(struct_declaration name: (identifier) @struct.name) @struct\n(enum_declaration name: (identifier) @enum.name) @enum\n(method_declaration name: (identifier) @method.name) @method\n(namespace_declaration name: (_) @namespace.name) @namespace\n(using_directive (_) @import)\n(invocation_expression function: (identifier) @call.name) @call\n(invocation_expression function: (member_access_expression name: (identifier) @call.name)) @call\n`;\n\nexport async function parseCSharp(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"csharp\",\n query: QUERY,\n decls: [\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"interface\", nameCapture: \"interface.name\", kind: \"interface\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"namespace\", nameCapture: \"namespace.name\", kind: \"class\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Dart parser. v0.1.11 — real symbol extraction + import parsing on top of the\n// ABI-v15 grammar that ships in tree-sitter-wasms.\n//\n// Distinguishes top-level function_signature (kind: function) from\n// function_signature nested under method_signature (kind: method) by\n// anchoring the top-level pattern under `program`.\n//\n// Imports: `package:foo/bar.dart` and `dart:async` are stripped — they cross\n// the project boundary. Bare `foo.dart` is normalized to `./foo.dart` so the\n// shared resolveImport() (which requires a leading `.`) treats it as a\n// same-directory relative import.\n\nimport { Query, type Node } from \"web-tree-sitter\";\nimport type { SymbolKind } from \"../../graph/types.js\";\nimport { createParser, type ParsedFile, type ParsedSymbol } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst QUERY = `\n(class_definition name: (identifier) @class.name) @class\n(mixin_declaration (identifier) @mixin.name) @mixin\n(extension_declaration name: (identifier) @ext.name) @ext\n(enum_declaration name: (identifier) @enum.name) @enum\n(type_alias (type_identifier) @typedef.name) @typedef\n\n(program (function_signature name: (identifier) @function.name) @function)\n\n(method_signature (function_signature name: (identifier) @method.name)) @method\n(method_signature (getter_signature name: (identifier) @getter.name)) @getter\n(method_signature (setter_signature name: (identifier) @setter.name)) @setter\n(constructor_signature name: (identifier) @ctor.name) @ctor\n\n(import_or_export (library_import (import_specification (configurable_uri (uri (string_literal) @import)))))\n`;\n\ninterface DeclShape {\n declCap: string;\n nameCap: string;\n kind: SymbolKind;\n}\n\nconst DECLS: DeclShape[] = [\n { declCap: \"class\", nameCap: \"class.name\", kind: \"class\" },\n { declCap: \"mixin\", nameCap: \"mixin.name\", kind: \"class\" },\n { declCap: \"ext\", nameCap: \"ext.name\", kind: \"class\" },\n { declCap: \"enum\", nameCap: \"enum.name\", kind: \"enum\" },\n { declCap: \"typedef\", nameCap: \"typedef.name\", kind: \"type\" },\n { declCap: \"function\", nameCap: \"function.name\", kind: \"function\" },\n { declCap: \"method\", nameCap: \"method.name\", kind: \"method\" },\n { declCap: \"getter\", nameCap: \"getter.name\", kind: \"method\" },\n { declCap: \"setter\", nameCap: \"setter.name\", kind: \"method\" },\n { declCap: \"ctor\", nameCap: \"ctor.name\", kind: \"method\" },\n];\n\nfunction firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\n// Strip surrounding string-literal quotes and normalize bare same-directory\n// imports (Dart allows `import 'foo.dart';` without a leading `./`) so\n// resolveImport() — which keys off a leading dot — can match them.\nfunction normalizeDartImport(raw: string): string | null {\n const stripped = raw.replace(/^['\"]|['\"]$/g, \"\");\n if (!stripped) return null;\n if (stripped.startsWith(\"package:\")) return null;\n if (stripped.startsWith(\"dart:\")) return null;\n if (stripped.startsWith(\".\") || stripped.startsWith(\"/\")) return stripped;\n return `./${stripped}`;\n}\n\nexport async function parseDart(f: WalkedFile, source: string): Promise<ParsedFile> {\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n\n try {\n const { parser, language } = await createParser(\"dart\");\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls: [] };\n\n const query = new Query(language, QUERY);\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n let matched: DeclShape | null = null;\n for (const d of DECLS) {\n if (byName.has(d.declCap) && byName.has(d.nameCap)) {\n matched = d;\n break;\n }\n }\n\n if (matched) {\n const declNode = byName.get(matched.declCap)!;\n const nameNode = byName.get(matched.nameCap)!;\n symbols.push({\n name: nameNode.text,\n kind: matched.kind,\n startLine: declNode.startPosition.row + 1,\n endLine: declNode.endPosition.row + 1,\n signature: firstLine(declNode.text),\n });\n continue;\n }\n\n const importNode = byName.get(\"import\");\n if (importNode) {\n const norm = normalizeDartImport(importNode.text);\n if (norm) imports.push(norm);\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const k = `${s.name}:${s.startLine}`;\n if (seen.has(k)) return false;\n seen.add(k);\n return true;\n });\n imports = Array.from(new Set(imports));\n } catch {\n // swallow — see _generic.ts for the rationale (single bad file shouldn't\n // abort the whole scan).\n }\n\n return { file: f, source, symbols, imports, calls: [] };\n}\n","// Go parser. Functions, methods, type declarations, imports.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_declaration name: (identifier) @function.name) @function\n(method_declaration name: (field_identifier) @method.name) @method\n(type_spec name: (type_identifier) @type.name) @type\n(import_spec path: (interpreted_string_literal) @import)\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (selector_expression field: (field_identifier) @call.name)) @call\n`;\n\nexport async function parseGo(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"go\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"type\", nameCapture: \"type.name\", kind: \"type\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// HubL (HubSpot CMS templating) parser. HubL lives in .html / .hubl files and\n// has no tree-sitter grammar, so we extract its symbol-like constructs with\n// regex: `{% macro %}` and `{% block %}` become symbols, and\n// `{% include / extends / import / from \"path\" %}` become import edges.\n// Plain HTML with no HubL tags simply yields no symbols (same as before).\n\nimport type { ParsedFile, ParsedSymbol } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\n// `{%-` / `-%}` are HubL/Jinja whitespace-control variants — tolerate them.\nconst MACRO_RE = /\\{%-?\\s*macro\\s+([A-Za-z_]\\w*)\\s*\\(([^)]*)\\)/g;\nconst ENDMACRO_RE = /\\{%-?\\s*endmacro\\b/g;\nconst BLOCK_RE = /\\{%-?\\s*block\\s+([A-Za-z_]\\w*)/g;\nconst ENDBLOCK_RE = /\\{%-?\\s*endblock\\b/g;\n// include / extends / import / from — all take a quoted template path first.\nconst IMPORT_RE = /\\{%-?\\s*(?:include|extends|import|from)\\s+[\"']([^\"']+)[\"']/g;\n\nfunction lineAt(source: string, index: number): number {\n return source.slice(0, index).split(/\\r?\\n/).length;\n}\n\n// Line of the next matching close tag after `fromIndex`; falls back to the\n// start line if the template is unbalanced (no close found).\nfunction endLineAfter(source: string, fromIndex: number, endRe: RegExp, startLine: number): number {\n endRe.lastIndex = fromIndex;\n const m = endRe.exec(source);\n return m ? lineAt(source, m.index) : startLine;\n}\n\nexport function parseHubL(f: WalkedFile, source: string): ParsedFile {\n const symbols: ParsedSymbol[] = [];\n const imports: string[] = [];\n\n for (const m of source.matchAll(MACRO_RE)) {\n const name = m[1];\n if (!name) continue;\n const args = (m[2] ?? \"\").trim();\n const start = m.index ?? 0;\n const startLine = lineAt(source, start);\n symbols.push({\n name,\n kind: \"function\",\n startLine,\n endLine: endLineAfter(source, start + m[0].length, ENDMACRO_RE, startLine),\n signature: `macro ${name}(${args})`,\n });\n }\n\n for (const m of source.matchAll(BLOCK_RE)) {\n const name = m[1];\n if (!name) continue;\n const start = m.index ?? 0;\n const startLine = lineAt(source, start);\n symbols.push({\n name,\n kind: \"component\",\n startLine,\n endLine: endLineAfter(source, start + m[0].length, ENDBLOCK_RE, startLine),\n signature: `block ${name}`,\n });\n }\n\n for (const m of source.matchAll(IMPORT_RE)) {\n const spec = m[1];\n if (spec) imports.push(spec);\n }\n\n return { file: f, source, symbols, imports: Array.from(new Set(imports)), calls: [] };\n}\n","// Java parser. Classes, interfaces, methods, imports.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(class_declaration name: (identifier) @class.name) @class\n(interface_declaration name: (identifier) @interface.name) @interface\n(method_declaration name: (identifier) @method.name) @method\n(enum_declaration name: (identifier) @enum.name) @enum\n(import_declaration (scoped_identifier) @import)\n(method_invocation name: (identifier) @call.name) @call\n`;\n\nexport async function parseJava(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"java\",\n query: QUERY,\n decls: [\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"interface\", nameCapture: \"interface.name\", kind: \"interface\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Kotlin parser. Functions, classes, objects, interfaces, imports.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_declaration (simple_identifier) @function.name) @function\n(class_declaration (type_identifier) @class.name) @class\n(object_declaration (type_identifier) @object.name) @object\n(import_header (identifier) @import)\n(call_expression (simple_identifier) @call.name) @call\n`;\n\nexport async function parseKotlin(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"kotlin\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"object\", nameCapture: \"object.name\", kind: \"class\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// PHP parser. Functions, classes, interfaces, methods, traits.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_definition name: (name) @function.name) @function\n(class_declaration name: (name) @class.name) @class\n(interface_declaration name: (name) @interface.name) @interface\n(trait_declaration name: (name) @trait.name) @trait\n(method_declaration name: (name) @method.name) @method\n(function_call_expression function: (name) @call.name) @call\n(member_call_expression name: (name) @call.name) @call\n(scoped_call_expression name: (name) @call.name) @call\n`;\n\nexport async function parsePhp(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"php\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"interface\", nameCapture: \"interface.name\", kind: \"interface\" },\n { declCapture: \"trait\", nameCapture: \"trait.name\", kind: \"class\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n ],\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Python parser using tree-sitter-python WASM.\n// Extracts: function/class definitions, methods, and import statements.\n\nimport { Query, type Node } from \"web-tree-sitter\";\nimport { createParser, type CallSite, type ParsedFile, type ParsedSymbol } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst QUERY = `\n(function_definition name: (identifier) @function.name) @function\n(class_definition name: (identifier) @class.name) @class\n(import_statement name: (dotted_name) @import.module)\n(import_from_statement module_name: (dotted_name) @import.from)\n(import_from_statement module_name: (relative_import) @import.from)\n(call function: (identifier) @call.name) @call\n(call function: (attribute attribute: (identifier) @call.name)) @call\n`;\n\nfunction firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\nexport async function parsePython(f: WalkedFile, source: string): Promise<ParsedFile> {\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n const calls: CallSite[] = [];\n\n try {\n const { parser, language } = await createParser(\"python\");\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls };\n\n const query = new Query(language, QUERY);\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n const funcDecl = byName.get(\"function\");\n const funcName = byName.get(\"function.name\");\n if (funcDecl && funcName) {\n const parentType = funcDecl.parent?.parent?.type;\n const isMethod = parentType === \"class_definition\";\n symbols.push({\n name: funcName.text,\n kind: isMethod ? \"method\" : \"function\",\n startLine: funcDecl.startPosition.row + 1,\n endLine: funcDecl.endPosition.row + 1,\n signature: firstLine(funcDecl.text),\n });\n continue;\n }\n\n const classDecl = byName.get(\"class\");\n const className = byName.get(\"class.name\");\n if (classDecl && className) {\n symbols.push({\n name: className.text,\n kind: \"class\",\n startLine: classDecl.startPosition.row + 1,\n endLine: classDecl.endPosition.row + 1,\n signature: firstLine(classDecl.text),\n });\n continue;\n }\n\n const importNode = byName.get(\"import.module\") ?? byName.get(\"import.from\");\n if (importNode) {\n imports.push(importNode.text);\n continue;\n }\n\n const callName = byName.get(\"call.name\");\n const callNode = byName.get(\"call\");\n if (callName && callNode) {\n calls.push({ callee: callName.text, line: callNode.startPosition.row + 1 });\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const key = `${s.name}:${s.startLine}`;\n if (seen.has(key)) return false;\n seen.add(key);\n return true;\n });\n imports = Array.from(new Set(imports));\n } catch {\n // swallow parse errors\n }\n\n return { file: f, source, symbols, imports, calls };\n}\n","// Ruby parser. Methods, classes, modules.\n// Imports omitted — Ruby's `require` is dynamic and hard to capture cleanly;\n// keyword indexing still surfaces dependencies.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(method name: (identifier) @function.name) @function\n(singleton_method name: (identifier) @method.name) @method\n(class name: (constant) @class.name) @class\n(module name: (constant) @module.name) @module\n(call method: (identifier) @call.name) @call\n`;\n\nexport async function parseRuby(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"ruby\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"module\", nameCapture: \"module.name\", kind: \"class\" },\n ],\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Rust parser. Functions, structs, enums, traits, impls.\n// Import capture is omitted — `use` paths are nested and complex; the file\n// will still be walked + keyword-indexed.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_item name: (identifier) @function.name) @function\n(struct_item name: (type_identifier) @struct.name) @struct\n(enum_item name: (type_identifier) @enum.name) @enum\n(trait_item name: (type_identifier) @trait.name) @trait\n(impl_item type: (type_identifier) @impl.name) @impl\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (scoped_identifier name: (identifier) @call.name)) @call\n(call_expression function: (field_expression field: (field_identifier) @call.name)) @call\n`;\n\nexport async function parseRust(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"rust\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"trait\", nameCapture: \"trait.name\", kind: \"interface\" },\n { declCapture: \"impl\", nameCapture: \"impl.name\", kind: \"class\" },\n ],\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// TS/JS parser using tree-sitter-typescript / -tsx WASM grammars.\n// Extracts: function/class/interface/type/enum declarations, exported consts,\n// arrow functions assigned to const, and import sources.\n\nimport { Query, type Node } from \"web-tree-sitter\";\nimport type { SymbolKind } from \"../../graph/types.js\";\nimport {\n createParser,\n type CallSite,\n type GrammarName,\n type ParsedFile,\n type ParsedSymbol,\n} from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\n// TS / TSX query — uses the type-identifier node type for class names, includes\n// interface / type-alias / enum declarations that don't exist in plain JS.\nconst TS_QUERY = `\n(function_declaration name: (identifier) @function.name) @function\n(class_declaration name: (type_identifier) @class.name) @class\n(interface_declaration name: (type_identifier) @interface.name) @interface\n(type_alias_declaration name: (type_identifier) @type.name) @type\n(enum_declaration name: (identifier) @enum.name) @enum\n(method_definition name: (property_identifier) @method.name) @method\n(lexical_declaration (variable_declarator name: (identifier) @const-fn.name value: [(arrow_function) (function_expression)])) @const-fn\n(assignment_expression left: (member_expression property: (property_identifier) @member-fn.name) right: [(arrow_function) (function_expression)]) @member-fn\n(import_statement source: (string) @import)\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (member_expression property: (property_identifier) @call.name)) @call\n`;\n\n// JS query — class names are plain identifiers (JS grammar has no\n// type_identifier node). No interface / type_alias / enum since JS lacks them.\n// Adds a call_expression capture for CommonJS require('x'); filtered in the\n// matching loop by checking the function identifier text equals \"require\".\nconst JS_QUERY = `\n(function_declaration name: (identifier) @function.name) @function\n(class_declaration name: (identifier) @class.name) @class\n(method_definition name: (property_identifier) @method.name) @method\n(lexical_declaration (variable_declarator name: (identifier) @const-fn.name value: [(arrow_function) (function_expression)])) @const-fn\n(assignment_expression left: (member_expression property: (property_identifier) @member-fn.name) right: [(arrow_function) (function_expression)]) @member-fn\n(import_statement source: (string) @import)\n(call_expression function: (identifier) @_require_fn arguments: (arguments . (string) @require_source))\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (member_expression property: (property_identifier) @call.name)) @call\n`;\n\nfunction grammarFor(ext: string): GrammarName {\n if (ext === \".tsx\" || ext === \".jsx\") return \"tsx\";\n if (ext === \".js\" || ext === \".cjs\" || ext === \".mjs\") return \"javascript\";\n return \"typescript\";\n}\n\nfunction queryFor(grammar: GrammarName): string {\n return grammar === \"javascript\" ? JS_QUERY : TS_QUERY;\n}\n\nfunction unquote(s: string): string {\n return s.replace(/^[\"'`]|[\"'`]$/g, \"\");\n}\n\nfunction firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\ninterface DeclShape {\n decl: Node;\n name: Node;\n kind: SymbolKind;\n}\n\nfunction shapeFromCaptures(captures: Map<string, Node>): DeclShape | null {\n const findDecl = (k: string, sk: SymbolKind): DeclShape | null => {\n const decl = captures.get(k);\n const name = captures.get(`${k}.name`);\n return decl && name ? { decl, name, kind: sk } : null;\n };\n\n return (\n findDecl(\"function\", \"function\") ??\n findDecl(\"class\", \"class\") ??\n findDecl(\"interface\", \"interface\") ??\n findDecl(\"type\", \"type\") ??\n findDecl(\"enum\", \"enum\") ??\n findDecl(\"method\", \"method\") ??\n findDecl(\"const-fn\", \"function\") ??\n findDecl(\"member-fn\", \"function\")\n );\n}\n\nexport async function parseTypeScript(f: WalkedFile, source: string): Promise<ParsedFile> {\n const grammar = grammarFor(f.ext);\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n const calls: CallSite[] = [];\n\n try {\n const { parser, language } = await createParser(grammar);\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls };\n\n const query = new Query(language, queryFor(grammar));\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n const shape = shapeFromCaptures(byName);\n if (shape) {\n symbols.push({\n name: shape.name.text,\n kind: shape.kind,\n startLine: shape.decl.startPosition.row + 1,\n endLine: shape.decl.endPosition.row + 1,\n signature: firstLine(shape.decl.text),\n });\n continue;\n }\n const importNode = byName.get(\"import\");\n if (importNode) {\n imports.push(unquote(importNode.text));\n continue;\n }\n // CommonJS require('x') — only captured by JS_QUERY. The identifier\n // must literally be \"require\" (not setTimeout, console, etc).\n const requireFn = byName.get(\"_require_fn\");\n const requireSource = byName.get(\"require_source\");\n if (requireFn && requireSource && requireFn.text === \"require\") {\n imports.push(unquote(requireSource.text));\n continue;\n }\n // Call site (bare or member call). `require(...)` also matches here — it\n // resolves to no project symbol and is dropped, so no special-casing.\n const callName = byName.get(\"call.name\");\n const callNode = byName.get(\"call\");\n if (callName && callNode) {\n calls.push({ callee: callName.text, line: callNode.startPosition.row + 1 });\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const key = `${s.name}:${s.startLine}`;\n if (seen.has(key)) return false;\n seen.add(key);\n return true;\n });\n imports = Array.from(new Set(imports));\n } catch {\n // Parse failure shouldn't abort the whole scan — return what we have.\n }\n\n return { file: f, source, symbols, imports, calls };\n}\n","// Svelte parser. Extracts <script> and <script lang=\"ts\"> blocks and parses\n// their contents with the TypeScript parser. Tracks the original line offset\n// so reported symbol positions match the .svelte source.\n\nimport { parseTypeScript } from \"./typescript.js\";\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst SCRIPT_RE = /<script\\b[^>]*>([\\s\\S]*?)<\\/script>/gi;\n\ninterface ScriptBlock {\n source: string;\n startLine: number; // 1-based line number where the script content begins\n isTsx: boolean;\n}\n\nfunction extractScripts(source: string): ScriptBlock[] {\n const out: ScriptBlock[] = [];\n for (const match of source.matchAll(SCRIPT_RE)) {\n const full = match[0];\n const inner = match[1] ?? \"\";\n const openTag = full.slice(0, full.indexOf(\">\") + 1);\n const tagStart = match.index ?? 0;\n const contentStart = tagStart + openTag.length;\n const startLine = source.slice(0, contentStart).split(/\\r?\\n/).length;\n const isTsx = /\\blang\\s*=\\s*[\"']?(ts|tsx|typescript)[\"']?/i.test(openTag);\n out.push({ source: inner, startLine, isTsx });\n }\n return out;\n}\n\nexport async function parseSvelte(f: WalkedFile, source: string): Promise<ParsedFile> {\n const blocks = extractScripts(source);\n const out: ParsedFile = { file: f, source, symbols: [], imports: [], calls: [] };\n\n for (const block of blocks) {\n const virtual: WalkedFile = { ...f, ext: block.isTsx ? \".ts\" : \".js\" };\n const parsed = await parseTypeScript(virtual, block.source);\n const offset = block.startLine - 1;\n for (const sym of parsed.symbols) {\n out.symbols.push({\n ...sym,\n startLine: sym.startLine + offset,\n endLine: sym.endLine + offset,\n });\n }\n for (const imp of parsed.imports) out.imports.push(imp);\n for (const call of parsed.calls) out.calls.push({ ...call, line: call.line + offset });\n }\n\n // The .svelte file itself is treated as a component.\n out.symbols.push({\n name:\n f.relPath\n .split(\"/\")\n .pop()\n ?.replace(/\\.svelte$/i, \"\") ?? f.relPath,\n kind: \"component\",\n startLine: 1,\n endLine: source.split(/\\r?\\n/).length,\n signature: f.relPath,\n });\n out.imports = Array.from(new Set(out.imports));\n return out;\n}\n","// Vue SFC parser. Extracts <script> / <script setup> / <script lang=\"ts\">\n// blocks and parses them with the TypeScript parser, preserving line offsets.\n\nimport { parseTypeScript } from \"./typescript.js\";\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst SCRIPT_RE = /<script\\b[^>]*>([\\s\\S]*?)<\\/script>/gi;\n\ninterface ScriptBlock {\n source: string;\n startLine: number;\n isTs: boolean;\n}\n\nfunction extractScripts(source: string): ScriptBlock[] {\n const out: ScriptBlock[] = [];\n for (const match of source.matchAll(SCRIPT_RE)) {\n const full = match[0];\n const inner = match[1] ?? \"\";\n const openTag = full.slice(0, full.indexOf(\">\") + 1);\n const tagStart = match.index ?? 0;\n const contentStart = tagStart + openTag.length;\n const startLine = source.slice(0, contentStart).split(/\\r?\\n/).length;\n const isTs = /\\blang\\s*=\\s*[\"']?(ts|tsx|typescript)[\"']?/i.test(openTag);\n out.push({ source: inner, startLine, isTs });\n }\n return out;\n}\n\nexport async function parseVue(f: WalkedFile, source: string): Promise<ParsedFile> {\n const blocks = extractScripts(source);\n const out: ParsedFile = { file: f, source, symbols: [], imports: [], calls: [] };\n\n for (const block of blocks) {\n const virtual: WalkedFile = { ...f, ext: block.isTs ? \".ts\" : \".js\" };\n const parsed = await parseTypeScript(virtual, block.source);\n const offset = block.startLine - 1;\n for (const sym of parsed.symbols) {\n out.symbols.push({\n ...sym,\n startLine: sym.startLine + offset,\n endLine: sym.endLine + offset,\n });\n }\n for (const imp of parsed.imports) out.imports.push(imp);\n for (const call of parsed.calls) out.calls.push({ ...call, line: call.line + offset });\n }\n\n out.symbols.push({\n name:\n f.relPath\n .split(\"/\")\n .pop()\n ?.replace(/\\.vue$/i, \"\") ?? f.relPath,\n kind: \"component\",\n startLine: 1,\n endLine: source.split(/\\r?\\n/).length,\n signature: f.relPath,\n });\n out.imports = Array.from(new Set(out.imports));\n return out;\n}\n","// Walks project root, yields files to parse.\n// Honors .gitignore + .synthraignore (additive — entries in either are ignored).\n// Defensive defaults skip VCS, build, and dependency directories even if absent\n// from .gitignore.\n\nimport type { Dirent } from \"node:fs\";\nimport { readFile, readdir, stat } from \"node:fs/promises\";\nimport { extname, join, relative, sep } from \"node:path\";\nimport ignore, { type Ignore } from \"ignore\";\n\nexport interface WalkedFile {\n absPath: string;\n relPath: string;\n ext: string;\n size: number;\n}\n\nexport interface WalkOptions {\n /** Maximum file size to yield (bytes). Defaults to 2 MB. */\n maxFileSize?: number;\n /** Additional ignore patterns layered on top of .gitignore + .synthraignore. */\n extraIgnore?: string[];\n}\n\nconst DEFAULT_IGNORE = [\n \".git/\",\n \".synthra/\",\n \".synthra-graph/\",\n \".claude/\",\n \"node_modules/\",\n \"dist/\",\n \"build/\",\n \"out/\",\n \"coverage/\",\n \".next/\",\n \".nuxt/\",\n \".svelte-kit/\",\n \".turbo/\",\n \".cache/\",\n \".vscode/\",\n \".idea/\",\n \".vs/\",\n // Flutter / Dart build caches — IDE-rehydrated, contain third-party\n // type stubs (typescript.d.ts, babylon.js etc.) that contaminate the graph.\n \".dart_tool/\",\n \".flutter-plugins\",\n \".flutter-plugins-dependencies\",\n // Android / Java / Kotlin / Rust\n \".gradle/\",\n \"target/\",\n // iOS / Xcode\n \"Pods/\",\n \"DerivedData/\",\n // Python\n \"__pycache__/\",\n \".venv/\",\n \"venv/\",\n \".tox/\",\n \".pytest_cache/\",\n \".mypy_cache/\",\n \".ruff_cache/\",\n // .NET\n \"obj/\",\n];\n\nconst BINARY_EXTS = new Set([\n \".png\",\n \".jpg\",\n \".jpeg\",\n \".gif\",\n \".webp\",\n \".svg\",\n \".ico\",\n \".bmp\",\n \".pdf\",\n \".zip\",\n \".tar\",\n \".gz\",\n \".7z\",\n \".rar\",\n \".mp3\",\n \".mp4\",\n \".mov\",\n \".avi\",\n \".webm\",\n \".wav\",\n \".ogg\",\n \".ttf\",\n \".otf\",\n \".woff\",\n \".woff2\",\n \".eot\",\n \".exe\",\n \".dll\",\n \".so\",\n \".dylib\",\n \".bin\",\n \".wasm\",\n \".lock\",\n \".lockb\",\n]);\n\nasync function readIgnoreFile(path: string): Promise<string[]> {\n try {\n const text = await readFile(path, \"utf8\");\n return text\n .split(/\\r?\\n/)\n .map((l) => l.trim())\n .filter((l) => l.length > 0 && !l.startsWith(\"#\"));\n } catch {\n return [];\n }\n}\n\nasync function buildMatcher(root: string, extra: string[]): Promise<Ignore> {\n const ig = ignore();\n ig.add(DEFAULT_IGNORE);\n ig.add(await readIgnoreFile(join(root, \".gitignore\")));\n ig.add(await readIgnoreFile(join(root, \".synthraignore\")));\n if (extra.length) ig.add(extra);\n return ig;\n}\n\nfunction toPosix(p: string): string {\n return sep === \"/\" ? p : p.split(sep).join(\"/\");\n}\n\nexport async function* walk(root: string, options: WalkOptions = {}): AsyncGenerator<WalkedFile> {\n const maxFileSize = options.maxFileSize ?? 2_000_000;\n const ig = await buildMatcher(root, options.extraIgnore ?? []);\n\n async function* recurse(dir: string): AsyncGenerator<WalkedFile> {\n let entries: Dirent[];\n try {\n entries = await readdir(dir, { withFileTypes: true });\n } catch {\n return;\n }\n for (const entry of entries) {\n const abs = join(dir, entry.name);\n const rel = relative(root, abs);\n if (!rel) continue;\n const relPosix = toPosix(rel);\n const matchPath = entry.isDirectory() ? `${relPosix}/` : relPosix;\n if (ig.ignores(matchPath)) continue;\n\n if (entry.isDirectory()) {\n yield* recurse(abs);\n } else if (entry.isFile()) {\n const ext = extname(entry.name).toLowerCase();\n if (BINARY_EXTS.has(ext)) continue;\n let size: number;\n try {\n const s = await stat(abs);\n size = s.size;\n } catch {\n continue;\n }\n if (size > maxFileSize) continue;\n yield { absPath: abs, relPath: relPosix, ext, size };\n }\n }\n }\n\n yield* recurse(root);\n}\n","// Reads/writes info_graph.json and symbol_index.json.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport type { GraphSchema, SymbolIndex } from \"./types.js\";\n\nasync function writeJson(path: string, data: unknown, pretty: boolean): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n const text = pretty ? JSON.stringify(data, null, 2) : JSON.stringify(data);\n await writeFile(path, text + \"\\n\", \"utf8\");\n}\n\nasync function readJson<T>(path: string): Promise<T> {\n const text = await readFile(path, \"utf8\");\n return JSON.parse(text) as T;\n}\n\nexport async function writeGraph(path: string, graph: GraphSchema): Promise<void> {\n // Pretty-printing a graph with full file contents balloons disk size and\n // the JSON is only ever read by machines; keep it compact.\n await writeJson(path, graph, false);\n}\n\nexport async function readGraph(path: string): Promise<GraphSchema> {\n return readJson<GraphSchema>(path);\n}\n\nexport async function writeSymbolIndex(path: string, index: SymbolIndex): Promise<void> {\n await writeJson(path, index, true);\n}\n\nexport async function readSymbolIndex(path: string): Promise<SymbolIndex> {\n // Re-home onto a null prototype so name lookups (e.g. index[\"toString\"])\n // never resolve to an inherited Object.prototype member. Mirrors\n // buildSymbolIndex, which builds the index the same way.\n const parsed = await readJson<SymbolIndex>(path);\n return Object.assign(Object.create(null), parsed);\n}\n","// Resolves Synthra's storage locations inside a project root.\n\nimport { join } from \"node:path\";\n\nexport interface SynthraPaths {\n projectRoot: string;\n graphDir: string;\n contextDir: string;\n infoGraph: string;\n symbolIndex: string;\n sessionState: string;\n activityLog: string;\n tokenLog: string;\n gateLog: string;\n bashLog: string;\n toolLog: string;\n accessLog: string;\n learnStore: string;\n parseCache: string;\n mcpPort: string;\n mcpServerLog: string;\n mcpServerErrLog: string;\n contextStore: string;\n contextMd: string;\n branchesDir: string;\n claudeDir: string;\n claudeSettings: string;\n claudeHooksDir: string;\n claudeMd: string;\n gitignore: string;\n}\n\nexport function resolvePaths(projectRoot: string): SynthraPaths {\n const graphDir = join(projectRoot, \".synthra-graph\");\n const contextDir = join(projectRoot, \".synthra\");\n const claudeDir = join(projectRoot, \".claude\");\n\n return {\n projectRoot,\n graphDir,\n contextDir,\n infoGraph: join(graphDir, \"info_graph.json\"),\n symbolIndex: join(graphDir, \"symbol_index.json\"),\n sessionState: join(graphDir, \"session.json\"),\n activityLog: join(graphDir, \"activity.jsonl\"),\n tokenLog: join(graphDir, \"token_log.jsonl\"),\n gateLog: join(graphDir, \"gate_log.jsonl\"),\n bashLog: join(graphDir, \"bash_log.jsonl\"),\n toolLog: join(graphDir, \"tool_log.jsonl\"),\n accessLog: join(graphDir, \"access_log.jsonl\"),\n learnStore: join(graphDir, \"learn_store.json\"),\n parseCache: join(graphDir, \"parse_cache.json\"),\n mcpPort: join(graphDir, \"mcp_port\"),\n mcpServerLog: join(graphDir, \"mcp_server.log\"),\n mcpServerErrLog: join(graphDir, \"mcp_server.err.log\"),\n contextStore: join(contextDir, \"context-store.json\"),\n contextMd: join(contextDir, \"CONTEXT.md\"),\n branchesDir: join(contextDir, \"branches\"),\n claudeDir,\n claudeSettings: join(claudeDir, \"settings.local.json\"),\n claudeHooksDir: join(claudeDir, \"hooks\"),\n claudeMd: join(projectRoot, \"CLAUDE.md\"),\n gitignore: join(projectRoot, \".gitignore\"),\n };\n}\n","// Project bootstrap: creates .synthra-graph/, .synthra/, updates .gitignore,\n// patches CLAUDE.md with the versioned policy block.\n\nimport { mkdir, readFile, stat, writeFile } from \"node:fs/promises\";\nimport { basename } from \"node:path\";\n\nimport { patchClaudeMd } from \"../hooks/claude-md.js\";\nimport type { SynthraPaths } from \"../shared/paths.js\";\n\nexport interface BootstrapResult {\n graphCreated: boolean;\n contextCreated: boolean;\n gitignoreUpdated: boolean;\n claudeMdUpdated: boolean;\n claudeMdCreated: boolean;\n}\n\n// Entries Synthra appends to the project .gitignore on bootstrap.\n// Each is gated by a check: if the entry is already present (any\n// indentation, trimmed match), it's skipped. Comments are per-entry so\n// users understand why each line is there and can remove what they don't\n// want without breaking the rest.\nconst GITIGNORE_ENTRIES: { comment: string; entry: string }[] = [\n {\n comment: \"added by synthra (heavy generated state — gitignored by design)\",\n entry: \".synthra-graph/\",\n },\n {\n comment:\n \"added by synthra — MCP registration. Remove this line if you want \" +\n \"to share the synthra MCP entry with teammates via committed .mcp.json\",\n entry: \".mcp.json\",\n },\n];\n\nasync function exists(path: string): Promise<boolean> {\n try {\n await stat(path);\n return true;\n } catch {\n return false;\n }\n}\n\nasync function ensureDir(path: string): Promise<boolean> {\n const had = await exists(path);\n await mkdir(path, { recursive: true });\n return !had;\n}\n\nasync function patchGitignore(path: string): Promise<boolean> {\n let existing = \"\";\n try {\n existing = await readFile(path, \"utf8\");\n } catch {\n /* file may not exist */\n }\n const trimmed = new Set(existing.split(/\\r?\\n/).map((l) => l.trim()));\n const missing = GITIGNORE_ENTRIES.filter((e) => !trimmed.has(e.entry));\n if (missing.length === 0) return false;\n\n const block = missing.map((m) => `# ${m.comment}\\n${m.entry}`).join(\"\\n\") + \"\\n\";\n const appendix =\n (existing.length === 0 || existing.endsWith(\"\\n\") ? \"\" : \"\\n\") +\n (existing.length ? \"\\n\" : \"\") +\n block;\n await writeFile(path, existing + appendix, \"utf8\");\n return true;\n}\n\nexport async function bootstrap(paths: SynthraPaths): Promise<BootstrapResult> {\n const graphCreated = await ensureDir(paths.graphDir);\n const contextCreated = await ensureDir(paths.contextDir);\n const gitignoreUpdated = await patchGitignore(paths.gitignore);\n\n const claudeMdExistedBefore = await exists(paths.claudeMd);\n const patch = await patchClaudeMd(paths.claudeMd, basename(paths.projectRoot));\n\n return {\n graphCreated,\n contextCreated,\n gitignoreUpdated,\n claudeMdUpdated: patch.updated,\n claudeMdCreated: patch.created && !claudeMdExistedBefore,\n };\n}\n","// Idempotent patcher for the project's CLAUDE.md. Manages a single block\n// bounded by <!-- synthra-policy v<N> BEGIN --> ... <!-- synthra-policy v<N> END -->.\n// On each run, any prior synthra-policy block (any version) is removed and the\n// current-version block is appended at the end.\n\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport { basename, dirname } from \"node:path\";\n\nexport const POLICY_VERSION = 7;\nexport const POLICY_BEGIN = `<!-- synthra-policy v${POLICY_VERSION} BEGIN -->`;\nexport const POLICY_END = `<!-- synthra-policy v${POLICY_VERSION} END -->`;\n\n// Matches a synthra-policy block of any version, e.g. v1, v2 …\nconst ANY_BLOCK_RE =\n /<!--\\s*synthra-policy\\s+v\\d+\\s+BEGIN\\s*-->[\\s\\S]*?<!--\\s*synthra-policy\\s+v\\d+\\s+END\\s*-->\\s*/g;\n\nexport interface PatchResult {\n created: boolean;\n updated: boolean;\n skipped: boolean;\n}\n\nexport function policyBlock(): string {\n return [\n POLICY_BEGIN,\n \"## Synthra context policy\",\n \"\",\n \"Synthra has pre-loaded structured context into this session and exposes\",\n \"the project's code graph through MCP tools. **Prefer these tools over\",\n \"Grep / Glob / Read** — they are faster, cheaper, and already filtered\",\n \"to relevant files.\",\n \"\",\n \"> **Tool namespace.** Synthra's MCP tools are exposed as\",\n \"> `mcp__synthra__graph_continue`, `mcp__synthra__graph_read`, and\",\n \"> `mcp__synthra__graph_register_edit`. **Short names will NOT resolve**\",\n \"> in ToolSearch or invocation — always use the full namespaced form.\",\n \"> If the tools are deferred, load their schemas with ToolSearch:\",\n \"> `select:mcp__synthra__graph_continue,mcp__synthra__graph_read,mcp__synthra__graph_register_edit`.\",\n \"> Below, short names (`graph_continue` etc.) appear in prose for\",\n \"> readability only.\",\n \"\",\n \"### Tools\",\n \"\",\n \"- **`graph_continue(query)`** — returns a `Confidence` label, the list\",\n \" of relevant `Files`, and signatures + top function bodies for those\",\n \" files. Your default first move when you need project context.\",\n \"- **`graph_read(target)`** — fetch source. Prefer the\",\n ' `\"file/path.ts::SymbolName\"` form over a bare file path — reading one',\n \" symbol is ~50 tokens, reading a whole file is thousands.\",\n \"- **`graph_register_edit(files)`** — after you edit files, call this so\",\n \" subsequent turns weight your changes and avoid stale snapshots.\",\n \"\",\n \"### When to call `graph_continue` — and when to skip\",\n \"\",\n \"**Call `graph_continue` only when you do NOT already know the relevant\",\n \"files.**\",\n \"\",\n \"Call it when:\",\n \"- This is the first message of a new task or conversation\",\n \"- The task shifts to a different area of the codebase\",\n \"- You need files you haven't seen yet in this session\",\n \"\",\n \"**Skip `graph_continue` when:**\",\n \"- You already identified the relevant files earlier in this conversation\",\n \"- You are doing follow-up work on files already read (verify, refactor,\",\n \" test, docs, cleanup, commit)\",\n \"- The task is pure text (commit message, explanation, summary)\",\n \"\",\n \"If skipping, go directly to\",\n '`mcp__synthra__graph_read(\"file.ts::symbol\")` on what you already know.',\n \"\",\n \"### Confidence caps\",\n \"\",\n \"When `graph_continue` returns:\",\n \"\",\n \"- **`Confidence: high`** → Stop. Do NOT Grep, Glob, or further explore\",\n \" for this query. The graph already has it.\",\n \"- **`Confidence: medium`** → Read the listed `Files` directly via\",\n ' `mcp__synthra__graph_read(\"file::symbol\")` *before* trying Grep. The',\n \" graph has narrowed the search space — use it, don't bypass it.\",\n \"- **`Confidence: low`** → You may use Grep / Glob, but the PreToolUse\",\n \" hook may still block redundant calls.\",\n \"\",\n \"### Reading code\",\n \"\",\n \"- **Always use `file::symbol` notation** with `graph_read`. Whole-file\",\n \" reads should be rare — only when you genuinely need the full file.\",\n \"- If `graph_continue`'s `Files` list contains a `::` entry, pass it\",\n \" verbatim to `graph_read`.\",\n \"- **Large file?** Don't read it in successive line-range chunks — call\",\n \" `mcp__synthra__graph_continue` or\",\n ' `mcp__synthra__graph_read(\"file::symbol\")` to pull the one symbol you',\n \" need. Chunked whole-file Reads are exactly the cost `graph_read`\",\n \" exists to avoid.\",\n \"\",\n \"### Editing a file\",\n \"\",\n \"Claude Code's `Edit` tool (and `Write` when overwriting) only accepts a\",\n \"file that was opened with the **`Read` tool** — a `graph_read` slice does\",\n 'not count, and editing such a file fails with *\"File has not been read',\n 'yet.\"* So before editing a file you only know through `graph_read`: take',\n \"the line range from its header (e.g. `…::handler (L120-168)`), `Read` that\",\n \"file with a matching `offset`/`limit`, then `Edit`. That satisfies the\",\n \"gate while keeping the read small — don't whole-file `Read` unless the\",\n \"edit spans most of the file.\",\n \"\",\n \"### Don'ts\",\n \"\",\n \"- Don't Grep / Glob before calling `graph_continue` when required — the\",\n \" PreToolUse hook may block it.\",\n \"- Don't call `graph_continue` more than once per turn.\",\n \"- Don't read whole files when a symbol-level read would suffice.\",\n \"\",\n \"### Resuming a session\",\n \"\",\n 'At session start the primer may begin with a **\"Since you were last here\"**',\n \"digest — recent commits, files touched, open next-steps, and recent\",\n \"decisions carried over from the previous session. **Trust it.** It is the\",\n \"cheapest possible orientation: do NOT re-run `graph_continue` or Grep just\",\n 'to rediscover \"what were we doing / what changed\" — that work is already',\n \"done. For the concrete next steps,\",\n '`mcp__synthra__context_recall({kind:\"next\"})` returns them verbatim. Only',\n \"reach for fresh retrieval when the task moves beyond what the digest\",\n \"covers.\",\n \"\",\n \"### Session-end resume note\",\n \"\",\n 'When the user signals they\\'re done (e.g. \"bye\", \"wrap up\", \"done\"),',\n \"persist the resume state by calling `context_remember` once per bullet.\",\n \"Synthra re-renders `.synthra/CONTEXT.md` from those entries at session\",\n \"end — do **NOT** write to `CONTEXT.md` directly, it is a derived view\",\n \"and direct edits are overwritten by the Stop hook.\",\n \"\",\n \"Use these `kind` values:\",\n \"\",\n '- **`kind: \"task\"`** — what is being worked on right now (1 entry)',\n '- **`kind: \"decision\"`** — non-obvious choices made this session (max 3)',\n '- **`kind: \"next\"`** — concrete next steps (max 3)',\n \"\",\n 'Tag entries with the relevant area (`tags: [\"auth\"]`) and the files',\n 'they touch (`files: [\"src/auth.ts\"]`) so later `context_recall` queries',\n \"can filter. Keep each `text` to 1–2 sentences.\",\n \"\",\n \"_This block is managed by Synthra. Edits inside the BEGIN/END markers\",\n \"are overwritten on every `syn .` run._\",\n \"\",\n POLICY_END,\n ].join(\"\\n\");\n}\n\n// A lean, agent-facing onboarding skeleton written ONLY when a project has no\n// CLAUDE.md yet. It captures the durable \"why/how\" the graph can't infer\n// (build/test, conventions, decisions, gotchas). It lives OUTSIDE the\n// synthra-policy markers, so later `syn .` runs — which strip and re-add the\n// policy block — never touch what the user fills in here.\nexport function onboardingSkeleton(projectName: string): string {\n return [\n `# ${projectName}`,\n \"\",\n \"> Onboarding notes for AI coding agents. Synthra's graph already knows the\",\n \"> code's *structure* (files, symbols, imports) — this file is for what the\",\n \"> graph can't infer: how to run the project, its conventions, and the\",\n \"> decisions behind them. Keep it lean and current; delete prompts you don't need.\",\n \"\",\n \"## Build & test\",\n \"\",\n \"- TODO: install deps / build\",\n \"- TODO: run tests / lint / typecheck\",\n \"- TODO: run the app locally\",\n \"\",\n \"## Conventions\",\n \"\",\n \"- TODO: code style, naming, file layout the agent should follow\",\n \"\",\n \"## Key decisions\",\n \"\",\n '- TODO: non-obvious choices and *why* (\"we use X not Y because …\")',\n \"\",\n \"## Gotchas\",\n \"\",\n '- TODO: traps, footguns, \"don\\'t touch X without Y\"',\n \"\",\n \"_Tip: run `/init` in Claude Code to auto-draft the sections above, then trim\",\n \"to the durable bits. Synthra manages its own block below — leave it._\",\n \"\",\n ].join(\"\\n\");\n}\n\nexport async function patchClaudeMd(path: string, projectName?: string): Promise<PatchResult> {\n let existing: string | null;\n try {\n existing = await readFile(path, \"utf8\");\n } catch {\n existing = null;\n }\n\n const block = policyBlock();\n\n if (existing === null) {\n // First creation: scaffold the onboarding skeleton (user-owned, written\n // once) followed by Synthra's managed policy block.\n const name = projectName || basename(dirname(path)) || \"this project\";\n await writeFile(path, onboardingSkeleton(name) + \"\\n\" + block + \"\\n\", \"utf8\");\n return { created: true, updated: false, skipped: false };\n }\n\n // Strip any prior policy block (any version), then re-append the current one.\n // The block is always separated from the preceding content by exactly one\n // blank line. We must normalize here: ANY_BLOCK_RE's trailing `\\s*` consumes\n // the block's own newline, so naively re-joining `stripped + \"\\n\" + block`\n // would add a blank line on every run — invisible per `syn .`, but with\n // auto-reindex it rewrites the watched CLAUDE.md endlessly. Trimming trailing\n // whitespace and re-joining with a fixed gap makes the patch idempotent.\n const stripped = existing.replace(ANY_BLOCK_RE, \"\");\n const base = stripped.replace(/\\s+$/, \"\");\n const desired = base.length ? `${base}\\n\\n${block}\\n` : `${block}\\n`;\n\n if (desired === existing) {\n return { created: false, updated: false, skipped: true };\n }\n\n await writeFile(path, desired, \"utf8\");\n return { created: false, updated: true, skipped: false };\n}\n","// I/O for the usage-learning layer. Two files, both in .synthra-graph/\n// (gitignored, machine-local — usage is per-developer):\n// - access_log.jsonl : append-only raw events (source of truth, replayable)\n// - learn_store.json : derived decayed aggregate (a cache of the log)\n//\n// Every read is best-effort: a missing / corrupt / schema-mismatched file yields\n// an empty store, so the ranker degrades to its deterministic behavior.\n\nimport { appendFile, mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { emptyStore, LEARN_SCHEMA_VERSION, type AccessEvent, type LearnStore } from \"./usage.js\";\n\nexport async function readLearnStore(path: string): Promise<LearnStore> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<LearnStore>;\n if (\n parsed.schema_version !== LEARN_SCHEMA_VERSION ||\n typeof parsed.files !== \"object\" ||\n parsed.files === null\n ) {\n return emptyStore();\n }\n return {\n schema_version: LEARN_SCHEMA_VERSION,\n asOf: typeof parsed.asOf === \"string\" ? parsed.asOf : emptyStore().asOf,\n files: parsed.files as LearnStore[\"files\"],\n };\n } catch {\n return emptyStore();\n }\n}\n\nexport async function writeLearnStore(path: string, store: LearnStore): Promise<void> {\n try {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, JSON.stringify(store, null, 2) + \"\\n\", \"utf8\");\n } catch {\n // Persistence is best-effort; the log remains the source of truth.\n }\n}\n\nexport async function readAccessLog(path: string): Promise<AccessEvent[]> {\n try {\n const raw = await readFile(path, \"utf8\");\n const out: AccessEvent[] = [];\n for (const line of raw.split(\"\\n\")) {\n const t = line.trim();\n if (!t) continue;\n try {\n const ev = JSON.parse(t) as AccessEvent;\n if (\n ev &&\n typeof ev.ts === \"string\" &&\n typeof ev.path === \"string\" &&\n typeof ev.source === \"string\"\n ) {\n out.push(ev);\n }\n } catch {\n // Skip a malformed line rather than failing the whole replay.\n }\n }\n return out;\n } catch {\n return [];\n }\n}\n\nexport async function appendAccess(path: string, ev: AccessEvent): Promise<void> {\n try {\n await mkdir(dirname(path), { recursive: true });\n await appendFile(path, JSON.stringify(ev) + \"\\n\", \"utf8\");\n } catch {\n // Best-effort; never fail a tool call over telemetry.\n }\n}\n","// Pure decay/aggregate core for the usage-learning signal (\"the more it's used,\n// the smarter it gets\"). No I/O here — persistence + the raw access log live in\n// store.ts, and the stateful wrapper in runtime.ts.\n//\n// Files the AI actually pulls (graph_read) or edits (graph_register_edit) accrue\n// a time-decayed weight. retrieve() applies a bounded, capped boost so genuinely\n// \"hot\" files surface first — never dominating the deterministic ranker.\n\nexport type AccessSource = \"read\" | \"register_edit\" | \"continue\";\n\nexport interface AccessEvent {\n ts: string; // ISO timestamp\n path: string; // canonical FileNode.path (\"\" for source === \"continue\")\n source: AccessSource;\n query?: string; // only set for source === \"continue\" — reserved fuel for v2/v3\n}\n\nexport interface FileStat {\n /** Raw access count (never decayed) — diagnostic only. */\n count: number;\n /** Decayed weight as of `lastTs`. */\n decayed: number;\n /** ISO timestamp of the most recent folded event. */\n lastTs: string;\n}\n\nexport interface LearnStore {\n schema_version: number;\n asOf: string;\n files: Record<string, FileStat>;\n}\n\nexport const LEARN_SCHEMA_VERSION = 1;\n\nconst DAY_MS = 24 * 60 * 60 * 1000;\n\n/** Usage-decay half-life. Env-overridable for dogfood tuning. */\nexport function halfLifeMs(): number {\n const env = Number(process.env.SYN_LEARN_HALFLIFE_DAYS);\n const days = Number.isFinite(env) && env > 0 ? env : 7;\n return days * DAY_MS;\n}\n\n/** Per-source accrual weight. `continue` never contributes to frequency — it's\n * logged only as query→outcome fuel for a future mechanism. */\nexport function weightFor(source: AccessSource): number {\n switch (source) {\n case \"register_edit\":\n return 2;\n case \"read\":\n return 1;\n default:\n return 0;\n }\n}\n\nexport function emptyStore(): LearnStore {\n return {\n schema_version: LEARN_SCHEMA_VERSION,\n asOf: new Date(0).toISOString(),\n files: {},\n };\n}\n\n/** exp(-λ·Δt) decay multiplier from `fromTs` forward to `toMs` epoch ms. */\nfunction decayFactor(fromTs: string, toMs: number, hl: number): number {\n const fromMs = Date.parse(fromTs);\n if (!Number.isFinite(fromMs)) return 1;\n const dt = toMs - fromMs;\n if (dt <= 0) return 1;\n return Math.exp(-(Math.LN2 / hl) * dt);\n}\n\n/** Fold one access event into the store: decay the file's prior weight up to the\n * event's timestamp, then add the event weight. Mutates and returns `store`.\n * Zero-weight (`continue`) and path-less events are ignored. Malformed\n * timestamps are dropped so the function stays deterministic. */\nexport function foldEvent(store: LearnStore, ev: AccessEvent): LearnStore {\n const w = weightFor(ev.source);\n if (w <= 0 || !ev.path) return store;\n const tMs = Date.parse(ev.ts);\n if (!Number.isFinite(tMs)) return store;\n\n const hl = halfLifeMs();\n const prev = store.files[ev.path];\n if (prev) {\n const decayed = prev.decayed * decayFactor(prev.lastTs, tMs, hl) + w;\n store.files[ev.path] = { count: prev.count + 1, decayed, lastTs: ev.ts };\n } else {\n store.files[ev.path] = { count: 1, decayed: w, lastTs: ev.ts };\n }\n return store;\n}\n\n/** Decayed weights as of `nowMs`, keyed by path. Effectively-zero entries are\n * omitted so an old/cold store contributes nothing. */\nexport function effectiveScores(store: LearnStore, nowMs: number): Map<string, number> {\n const hl = halfLifeMs();\n const out = new Map<string, number>();\n for (const [path, stat] of Object.entries(store.files)) {\n const eff = stat.decayed * decayFactor(stat.lastTs, nowMs, hl);\n if (eff > 0.01) out.set(path, eff);\n }\n return out;\n}\n\n/** Rebuild a store by replaying a raw access-log stream (the source of truth). */\nexport function recomputeFromLog(events: AccessEvent[]): LearnStore {\n const store = emptyStore();\n for (const ev of events) foldEvent(store, ev);\n return store;\n}\n","// Stateful wrapper around the usage-learning store. Keeps the decayed aggregate\n// in memory, folds each access as it happens, persists on a trailing debounce,\n// and exposes the live scores for the ranker. Constructed once per server, like\n// ActivityStore.\n\nimport { appendAccess, readAccessLog, readLearnStore, writeLearnStore } from \"./store.js\";\nimport {\n effectiveScores,\n foldEvent,\n recomputeFromLog,\n type AccessEvent,\n type LearnStore,\n} from \"./usage.js\";\n\nconst PERSIST_DEBOUNCE_MS = 2000;\n\nexport class LearnRuntime {\n private store: LearnStore;\n private dirty = false;\n private timer: ReturnType<typeof setTimeout> | null = null;\n\n private constructor(\n private readonly accessLogPath: string,\n private readonly storePath: string,\n store: LearnStore,\n ) {\n this.store = store;\n }\n\n /** Load the aggregate from disk; if it's empty but a raw log exists, replay it\n * (the log is the source of truth). Always succeeds — falls back to empty. */\n static async load(accessLogPath: string, storePath: string): Promise<LearnRuntime> {\n let store = await readLearnStore(storePath);\n if (Object.keys(store.files).length === 0) {\n const events = await readAccessLog(accessLogPath);\n if (events.length > 0) store = recomputeFromLog(events);\n }\n return new LearnRuntime(accessLogPath, storePath, store);\n }\n\n /** Record an access: append to the durable log + fold into the in-memory\n * aggregate. Best-effort — never throws into a tool call. */\n async record(ev: AccessEvent): Promise<void> {\n await appendAccess(this.accessLogPath, ev);\n foldEvent(this.store, ev);\n this.schedulePersist();\n }\n\n /** Decayed path→weight map for the ranker, as of now. */\n effectiveScores(nowMs: number = Date.now()): Map<string, number> {\n return effectiveScores(this.store, nowMs);\n }\n\n private schedulePersist(): void {\n this.dirty = true;\n if (this.timer) return;\n this.timer = setTimeout(() => {\n this.timer = null;\n void this.flush();\n }, PERSIST_DEBOUNCE_MS);\n // Don't keep the event loop alive just for the persist timer.\n this.timer.unref?.();\n }\n\n /** Persist the aggregate if it changed since the last write. Called on the\n * debounce and on server shutdown. */\n async flush(): Promise<void> {\n if (this.timer) {\n clearTimeout(this.timer);\n this.timer = null;\n }\n if (!this.dirty) return;\n this.dirty = false;\n this.store.asOf = new Date().toISOString();\n await writeLearnStore(this.storePath, this.store);\n }\n}\n","// Environment-variable-driven configuration.\n// All knobs are prefixed SYN_.\n\nexport interface SynthraConfig {\n hardMaxReadChars: number;\n gateHintMaxChars: number;\n readDepsMaxChars: number;\n turnReadBudgetChars: number;\n fallbackMaxCallsPerTurn: number;\n retrieveCacheTtlSec: number;\n reindexDebounceMs: number;\n autoReindex: boolean;\n bashObserve: boolean;\n mcpPort: number | null;\n dashboardPort: number;\n logLevel: \"debug\" | \"info\" | \"warn\" | \"error\";\n claudeBin: string;\n}\n\nfunction num(name: string, fallback: number): number {\n const v = process.env[name];\n if (!v) return fallback;\n const n = Number(v);\n return Number.isFinite(n) ? n : fallback;\n}\n\nfunction str<T extends string>(name: string, fallback: T): T {\n return (process.env[name] as T) ?? fallback;\n}\n\nexport function loadConfig(): SynthraConfig {\n return {\n hardMaxReadChars: num(\"SYN_HARD_MAX_READ_CHARS\", 4000),\n gateHintMaxChars: num(\"SYN_GATE_HINT_CHARS\", 1200),\n readDepsMaxChars: num(\"SYN_READ_DEPS_CHARS\", 900),\n turnReadBudgetChars: num(\"SYN_TURN_READ_BUDGET_CHARS\", 18000),\n fallbackMaxCallsPerTurn: num(\"SYN_FALLBACK_MAX_CALLS_PER_TURN\", 1),\n retrieveCacheTtlSec: num(\"SYN_RETRIEVE_CACHE_TTL_SEC\", 900),\n // Auto-reindex: re-run the incremental scan + swap the in-memory graph this\n // many ms after the last source-file change, so graph reads never go stale\n // mid-session. Set SYN_NO_AUTOREINDEX to disable entirely.\n reindexDebounceMs: num(\"SYN_REINDEX_DEBOUNCE_MS\", 1000),\n autoReindex: !process.env.SYN_NO_AUTOREINDEX,\n // Observe-only: log codebase-exploration Bash commands (grep/cat/find …) so\n // the terminal bypass of the Moat can be measured. Never blocks. Opt out\n // with SYN_NO_BASH_OBSERVE.\n bashObserve: !process.env.SYN_NO_BASH_OBSERVE,\n mcpPort: process.env.SYN_MCP_PORT ? num(\"SYN_MCP_PORT\", 0) : null,\n dashboardPort: num(\"SYN_DASHBOARD_PORT\", 8901),\n logLevel: str(\"SYN_LOG_LEVEL\", \"info\" as const),\n claudeBin: str(\"SYN_CLAUDE_BIN\", \"claude\" as const),\n };\n}\n","// MCP-over-HTTP (streamable) protocol handler. Exposes Synthra's graph tools\n// to Claude Code via JSON-RPC 2.0 messages POSTed to /mcp.\n//\n// Tools:\n// graph_continue(query) — retrieve + pack a context bundle\n// graph_read(target) — return source for \"file\" or \"file::symbol\"\n// graph_register_edit(files) — Claude tells Synthra it edited files\n//\n// Spec: https://modelcontextprotocol.io/specification\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { retrieve } from \"../graph/retrieve.js\";\nimport type { FileNode, GraphSchema, SymbolNode } from \"../graph/types.js\";\nimport { appendAccess } from \"../learn/store.js\";\nimport type { AccessEvent } from \"../learn/usage.js\";\nimport { recallEntries, rememberEntry } from \"../memory/index.js\";\nimport type { EntryKind } from \"../memory/context-store.js\";\nimport { pack } from \"../packer/index.js\";\nimport { findTestsForFile } from \"../packer/tests.js\";\nimport { loadConfig } from \"../shared/config.js\";\nimport type { ServerContext } from \"./context.js\";\n\nconst PROTOCOL_VERSION = \"2024-11-05\";\nconst SERVER_INFO = { name: \"synthra\", version: \"0.0.1\" } as const;\n\ntype JsonRpcId = string | number | null;\n\nexport interface JsonRpcRequest {\n jsonrpc: \"2.0\";\n id?: JsonRpcId;\n method: string;\n params?: Record<string, unknown>;\n}\n\nexport interface JsonRpcResponse {\n jsonrpc: \"2.0\";\n id: JsonRpcId;\n result?: unknown;\n error?: { code: number; message: string; data?: unknown };\n}\n\nconst ERR = {\n parse: -32700,\n invalidRequest: -32600,\n methodNotFound: -32601,\n invalidParams: -32602,\n internal: -32603,\n} as const;\n\nfunction ok(id: JsonRpcId, result: unknown): JsonRpcResponse {\n return { jsonrpc: \"2.0\", id, result };\n}\n\nfunction err(id: JsonRpcId, code: number, message: string, data?: unknown): JsonRpcResponse {\n return { jsonrpc: \"2.0\", id, error: { code, message, data } };\n}\n\nfunction textContent(text: string) {\n return { content: [{ type: \"text\", text }], isError: false };\n}\n\nfunction errorContent(message: string) {\n return { content: [{ type: \"text\", text: message }], isError: true };\n}\n\nconst TOOLS = [\n {\n name: \"graph_continue\",\n description:\n \"Returns the project context most relevant to a query — function signatures, top function bodies, and linked test files. Use this BEFORE Grep/Glob. If `confidence` is 'high', do not call Grep/Glob for the same query.\",\n inputSchema: {\n type: \"object\",\n properties: {\n query: {\n type: \"string\",\n description: \"Natural-language description of what you're looking for.\",\n },\n },\n required: [\"query\"],\n },\n },\n {\n name: \"graph_read\",\n description:\n \"Return the source code for a specific file or symbol. Target is either a project-relative file path (e.g. 'src/auth.ts') or 'file::symbol' (e.g. 'src/auth.ts::AuthService'). A symbol read also returns its dependency surface — the signatures of the symbols it calls (edit against these instead of guessing or re-reading their files) and the names of the symbols that call it.\",\n inputSchema: {\n type: \"object\",\n properties: {\n target: { type: \"string\", description: \"File path or file::symbol notation.\" },\n },\n required: [\"target\"],\n },\n },\n {\n name: \"graph_register_edit\",\n description:\n \"Tell Synthra that you (the AI) have edited these files. Lets Synthra rank them higher in subsequent retrieval and avoid surfacing stale context.\",\n inputSchema: {\n type: \"object\",\n properties: {\n files: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Project-relative file paths that were edited.\",\n },\n },\n required: [\"files\"],\n },\n },\n {\n name: \"context_remember\",\n description:\n \"Persist a decision/task/next-step/fact/blocker into the project's branch-aware context store. Use when the user makes a decision worth keeping, identifies a TODO, or surfaces a key fact. Entries land in `.synthra/context-store.json` on the default branch, or `.synthra/branches/<sanitized>/context-store.json` on a feature branch — git-tracked, so teammates inherit them and they merge naturally.\",\n inputSchema: {\n type: \"object\",\n properties: {\n text: { type: \"string\", description: \"The thing to remember (1–3 sentences).\" },\n kind: {\n type: \"string\",\n enum: [\"decision\", \"task\", \"next\", \"fact\", \"blocker\"],\n description: \"What kind of entry. Required.\",\n },\n tags: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Optional tags for grouping (e.g. 'auth', 'perf').\",\n },\n files: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Optional project-relative file paths this entry relates to.\",\n },\n },\n required: [\"text\", \"kind\"],\n },\n },\n {\n name: \"context_recall\",\n description:\n \"Read previously-stored decisions/tasks/facts from the project's branch-aware context store. Defaults to the current branch.\",\n inputSchema: {\n type: \"object\",\n properties: {\n kind: {\n type: \"string\",\n enum: [\"decision\", \"task\", \"next\", \"fact\", \"blocker\"],\n description: \"Filter to a single kind.\",\n },\n branch: { type: \"string\", description: \"Override which branch to read from.\" },\n limit: { type: \"number\", description: \"Return only the most recent N entries.\" },\n },\n },\n },\n {\n name: \"recent_activity\",\n description:\n \"What has the human been doing in the editor recently — file saves, branch switches, and uncommitted-diff changes. Use this to check whether the static context pack may be stale (e.g. before answering a question about a file that was just edited).\",\n inputSchema: {\n type: \"object\",\n properties: {\n since_ms: {\n type: \"number\",\n description:\n \"Epoch milliseconds. Only return events newer than this. Defaults to the last 60 minutes.\",\n },\n limit: { type: \"number\", description: \"Cap on returned events.\" },\n },\n },\n },\n {\n name: \"count_tokens\",\n description:\n \"Estimate token count for a piece of text using a char/4 approximation. Accurate within ~10% for English + code. Useful for budgeting prompt content before sending.\",\n inputSchema: {\n type: \"object\",\n properties: {\n text: { type: \"string\", description: \"The text to estimate tokens for.\" },\n },\n required: [\"text\"],\n },\n },\n {\n name: \"blast_radius\",\n description:\n \"See what could break before an edit. A bare file target returns all files that depend on it transitively via imports, tests, and call edges. A 'file::symbol' target returns the exact caller SYMBOLS that transitively call it (name → file:line) plus the test files guarding the impact — the precise rename-safety view. Call edges are name-resolved (precise within a file, unique-name across files).\",\n inputSchema: {\n type: \"object\",\n properties: {\n target: {\n type: \"string\",\n description: \"File path (file-level dependents) or 'file::symbol' (caller symbols).\",\n },\n depth: { type: \"number\", description: \"Max hops to traverse. Default 3.\" },\n },\n required: [\"target\"],\n },\n },\n {\n name: \"dead_code\",\n description:\n \"Return files in the project that no other file imports and no test file references — strong candidates for unused/orphaned code. File-level granularity; symbol-level dead code (unused exports, on top of the call graph) is a planned follow-up. Common entry-point patterns (main, index, app, CLI, bin/) are excluded heuristically.\",\n inputSchema: {\n type: \"object\",\n properties: {\n limit: { type: \"number\", description: \"Cap on returned files. Default 50.\" },\n },\n },\n },\n] as const;\n\nasync function callTool(\n name: string,\n args: Record<string, unknown> | undefined,\n ctx: ServerContext,\n) {\n switch (name) {\n case \"graph_continue\":\n return graphContinue(args, ctx);\n case \"graph_read\":\n return graphRead(args, ctx);\n case \"graph_register_edit\":\n return graphRegisterEdit(args, ctx);\n case \"context_remember\":\n return contextRemember(args, ctx);\n case \"context_recall\":\n return contextRecall(args, ctx);\n case \"recent_activity\":\n return recentActivity(args, ctx);\n case \"count_tokens\":\n return countTokens(args);\n case \"blast_radius\":\n return blastRadius(args, ctx);\n case \"dead_code\":\n return deadCode(args, ctx);\n default:\n return errorContent(`Unknown tool: ${name}`);\n }\n}\n\nfunction countTokens(args: Record<string, unknown> | undefined) {\n const text = typeof args?.text === \"string\" ? args.text : \"\";\n if (!text) return errorContent(\"count_tokens: 'text' (string) is required\");\n const tokens = Math.ceil(text.length / 4);\n return textContent(JSON.stringify({ tokens, method: \"chars/4 estimate\", chars: text.length }));\n}\n\nfunction blastRadius(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const targetRaw = typeof args?.target === \"string\" ? args.target.trim() : \"\";\n const maxDepth = typeof args?.depth === \"number\" && args.depth > 0 ? Math.floor(args.depth) : 3;\n if (!targetRaw) return errorContent(\"blast_radius: 'target' (string) is required\");\n\n // A `file::symbol` target → precise caller-symbol impact (for renames). A bare\n // file → the file-level dependent view below (unchanged).\n if (targetRaw.includes(\"::\")) return blastRadiusSymbol(targetRaw, maxDepth, ctx);\n\n const filePath = targetRaw;\n const root = ctx.graph.nodes.find((n): n is FileNode => n.kind === \"file\" && n.path === filePath);\n if (!root) return errorContent(`blast_radius: file not in graph: ${filePath}`);\n\n // Index reverse edges (to → [{from, kind}]) once per call. `calls` edges are\n // symbol→symbol, so project them to file level (a caller's file depends on the\n // callee's file), skipping intra-file calls.\n const fileIdBySymbol = new Map<string, string>();\n for (const n of ctx.graph.nodes) {\n if (n.kind === \"symbol\") fileIdBySymbol.set(n.id, `file:${n.file}`);\n }\n const incoming = new Map<string, Array<{ from: string; kind: string }>>();\n const addIncoming = (to: string, from: string, kind: string): void => {\n const list = incoming.get(to) ?? [];\n list.push({ from, kind });\n incoming.set(to, list);\n };\n for (const e of ctx.graph.edges) {\n if (e.kind === \"imports\" || e.kind === \"tests\") {\n addIncoming(e.to, e.from, e.kind);\n } else if (e.kind === \"calls\") {\n const fromFile = fileIdBySymbol.get(e.from);\n const toFile = fileIdBySymbol.get(e.to);\n if (fromFile && toFile && fromFile !== toFile) addIncoming(toFile, fromFile, \"calls\");\n }\n }\n\n interface Hit {\n path: string;\n depth: number;\n via: string;\n }\n\n const visited = new Set<string>([root.id]);\n const hits: Hit[] = [];\n const pathById = new Map<string, string>();\n for (const n of ctx.graph.nodes) if (n.kind === \"file\") pathById.set(n.id, n.path);\n\n let frontier = [root.id];\n for (let d = 1; d <= maxDepth; d++) {\n const next: string[] = [];\n for (const cur of frontier) {\n const callers = incoming.get(cur) ?? [];\n for (const c of callers) {\n if (visited.has(c.from)) continue;\n visited.add(c.from);\n next.push(c.from);\n const path = pathById.get(c.from) ?? c.from;\n hits.push({ path, depth: d, via: c.kind });\n }\n }\n frontier = next;\n if (next.length === 0) break;\n }\n\n if (hits.length === 0) {\n return textContent(`# Blast radius for ${filePath}\\n\\n_(no dependents — file is isolated)_`);\n }\n\n hits.sort((a, b) => a.depth - b.depth || a.path.localeCompare(b.path));\n const lines = [`# Blast radius for ${filePath} (depth ≤ ${maxDepth})`, \"\"];\n lines.push(`${hits.length} dependent file(s):`);\n for (const h of hits) {\n lines.push(`- **depth ${h.depth}** \\`${h.path}\\` _(via ${h.via})_`);\n }\n return textContent(lines.join(\"\\n\"));\n}\n\n// Symbol-level blast radius: which symbols transitively CALL the target symbol.\n// This is the rename-safety view — exact caller symbols + locations, not the\n// file-level rollup. (`graph_read`'s \"Used by (N)\" footer covers the cheap\n// always-on direct-caller case; this is the complete, transitive, on-demand one.)\nfunction blastRadiusSymbol(targetRaw: string, maxDepth: number, ctx: ServerContext) {\n const [rawFile, rawSym] = targetRaw.split(\"::\", 2);\n const filePath = (rawFile ?? \"\").trim();\n const symName = (rawSym ?? \"\").trim();\n if (!symName) return errorContent(\"blast_radius: 'file::symbol' target needs a symbol name\");\n\n const resolved = resolveFileTarget(ctx.graph, filePath);\n if (\"ambiguous\" in resolved) {\n const shown = resolved.ambiguous.slice(0, 5).join(\", \");\n return errorContent(\n `blast_radius: '${filePath}' matches multiple files (${shown}). Pass a longer path.`,\n );\n }\n if (\"none\" in resolved) return errorContent(`blast_radius: file not in graph: ${filePath}`);\n const fileNode = resolved.node;\n\n const symbol = ctx.graph.nodes.find(\n (n): n is SymbolNode => n.kind === \"symbol\" && n.file === fileNode.path && n.name === symName,\n );\n if (!symbol)\n return errorContent(`blast_radius: symbol '${symName}' not found in ${fileNode.path}`);\n\n // Reverse call map (callee-id → caller-ids) + symbol lookup, built once.\n const callersBySym = new Map<string, string[]>();\n for (const e of ctx.graph.edges) {\n if (e.kind !== \"calls\" || e.from === e.to) continue;\n const list = callersBySym.get(e.to) ?? [];\n list.push(e.from);\n callersBySym.set(e.to, list);\n }\n const symById = new Map<string, SymbolNode>();\n for (const n of ctx.graph.nodes) if (n.kind === \"symbol\") symById.set(n.id, n);\n\n interface Hit {\n name: string;\n file: string;\n line: number;\n depth: number;\n }\n const visited = new Set<string>([symbol.id]);\n const hits: Hit[] = [];\n let frontier = [symbol.id];\n for (let d = 1; d <= maxDepth; d++) {\n const next: string[] = [];\n for (const cur of frontier) {\n for (const fromId of callersBySym.get(cur) ?? []) {\n if (visited.has(fromId)) continue;\n visited.add(fromId);\n next.push(fromId);\n const s = symById.get(fromId);\n if (s) hits.push({ name: s.name, file: s.file, line: s.start_line, depth: d });\n }\n }\n frontier = next;\n if (next.length === 0) break;\n }\n\n const header = `# Blast radius for ${fileNode.path}::${symbol.name} (callers, depth ≤ ${maxDepth})`;\n if (hits.length === 0) {\n const tline = testsCoveringLine(ctx.graph, [fileNode.path]);\n return textContent(\n `${header}\\n\\n_(no callers — safe to rename)_${tline ? `\\n\\n${tline}` : \"\"}`,\n );\n }\n hits.sort((a, b) => a.depth - b.depth || a.file.localeCompare(b.file) || a.line - b.line);\n const lines = [header, \"\", `${hits.length} caller symbol(s):`];\n for (const h of hits) lines.push(`- **depth ${h.depth}** \\`${h.name}\\` → ${h.file}:${h.line}`);\n const tline = testsCoveringLine(ctx.graph, [fileNode.path, ...hits.map((h) => h.file)]);\n if (tline) {\n lines.push(\"\");\n lines.push(tline);\n }\n return textContent(lines.join(\"\\n\"));\n}\n\n// One-line summary of the test files covering a set of source files (deduped).\n// Reused by the symbol-level blast radius to show which tests guard a rename.\nfunction testsCoveringLine(graph: GraphSchema, filePaths: string[]): string {\n const fileByPath = new Map<string, FileNode>();\n for (const n of graph.nodes) if (n.kind === \"file\") fileByPath.set(n.path, n);\n const seen = new Set<string>();\n const tests: string[] = [];\n for (const p of new Set(filePaths)) {\n const fn = fileByPath.get(p);\n if (!fn) continue;\n for (const t of findTestsForFile(graph, fn)) {\n if (!seen.has(t.path)) {\n seen.add(t.path);\n tests.push(t.path);\n }\n }\n }\n if (tests.length === 0) return \"\";\n const shown = tests.slice(0, TESTS_MAX_FILES);\n const omitted = tests.length - shown.length;\n return `Tests covering the impact: ${shown.join(\" · \")}${omitted > 0 ? ` …+${omitted} more` : \"\"}`;\n}\n\nconst LIKELY_ENTRY_PATTERNS = [\n /(?:^|\\/)main\\.[a-z0-9_]+$/i,\n /(?:^|\\/)index\\.[a-z0-9_]+$/i,\n /(?:^|\\/)app\\.[a-z0-9_]+$/i,\n /(?:^|\\/)entry\\.[a-z0-9_]+$/i,\n /(?:^|\\/)cli[/.]/i,\n /(?:^|\\/)bin[/.]/i,\n /(?:^|\\/)server\\.[a-z0-9_]+$/i,\n /\\.test\\.[a-z0-9_]+$/i,\n /\\.spec\\.[a-z0-9_]+$/i,\n /(?:^|\\/)tests?\\//i,\n /(?:^|\\/)__tests__\\//i,\n /(?:^|\\/)__init__\\.py$/i,\n];\n\nfunction isLikelyEntry(path: string): boolean {\n return LIKELY_ENTRY_PATTERNS.some((re) => re.test(path));\n}\n\nfunction deadCode(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const limit = typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : 50;\n\n const hasIncoming = new Set<string>();\n for (const e of ctx.graph.edges) {\n if (e.kind === \"imports\" || e.kind === \"tests\") hasIncoming.add(e.to);\n }\n\n const candidates = ctx.graph.nodes\n .filter((n): n is FileNode => n.kind === \"file\")\n .filter((f) => !hasIncoming.has(f.id))\n .filter((f) => !isLikelyEntry(f.path));\n\n if (candidates.length === 0) {\n return textContent(\n `# Dead code\\n\\n_(no file is unreferenced — every file is either imported by another, has a linked test, or matches an entry-point pattern)_`,\n );\n }\n\n candidates.sort((a, b) => a.path.localeCompare(b.path));\n const shown = candidates.slice(0, limit);\n const lines = [`# Dead code candidates (file-level, v0.1)`, \"\"];\n lines.push(\n `${shown.length} of ${candidates.length} unreferenced file(s) — no other file imports them and no test links them:`,\n );\n lines.push(\"\");\n for (const f of shown) {\n lines.push(`- \\`${f.path}\\``);\n }\n lines.push(\"\");\n lines.push(\n `_caveat:_ this is file-level only. Symbol-level dead code (unused exports), built on the now-populated call graph, is a planned follow-up.`,\n );\n return textContent(lines.join(\"\\n\"));\n}\n\nasync function graphContinue(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const query = typeof args?.query === \"string\" ? args.query : \"\";\n if (!query) return errorContent(\"graph_continue: 'query' (string) is required\");\n\n // Session-aware routing (#14): seed retrieval with files the session has\n // touched — the human's recent saves + edits the AI registered via\n // graph_register_edit — so the ranker boosts them. Mirrors the /pack route.\n const retrieval = await retrieve(ctx.graph, query, {\n recentlyEditedPaths: ctx.activity.recentFilePaths(15 * 60 * 1000),\n sessionKnownPaths: getRegisteredEdits(),\n usageScores: ctx.learn?.effectiveScores(),\n });\n const packed = await pack(retrieval.files, { query, graph: ctx.graph });\n\n // Log the query (no file, weight 0) as query→outcome fuel for a future\n // mechanism — never count retrieval.files, which would feed ranking its own\n // output and cause popularity runaway.\n await logAccess(ctx, { ts: nowIso(), path: \"\", source: \"continue\", query });\n\n const header =\n `Confidence: ${retrieval.confidence}\\n` +\n `Files: ${retrieval.files.map((f) => f.path).join(\", \") || \"(none)\"}\\n` +\n `Reason: ${retrieval.reason}\\n`;\n\n // The pack body already starts with a header — keep them concatenated.\n return textContent(`${header}\\n${packed.text}`);\n}\n\n// Resolve a graph_read target's file part to a FileNode. Exact path wins; on a\n// miss, fall back to a unique path-suffix match so a shortened target like\n// \"appsettings.json\" finds \"api/.../appsettings.json\". Only serves the fallback\n// when EXACTLY one file matches — multiple matches are reported as ambiguous\n// rather than guessing. (#11)\nexport type FileTargetResult = { node: FileNode } | { ambiguous: string[] } | { none: true };\n\nexport function resolveFileTarget(graph: GraphSchema, filePath: string): FileTargetResult {\n const files = graph.nodes.filter((n): n is FileNode => n.kind === \"file\");\n const exact = files.find((n) => n.path === filePath);\n if (exact) return { node: exact };\n\n const suffix = \"/\" + filePath;\n const matches = files.filter((n) => n.path.endsWith(suffix));\n if (matches.length === 1) return { node: matches[0]! };\n if (matches.length > 1) return { ambiguous: matches.map((n) => n.path) };\n return { none: true };\n}\n\nconst DEPS_SIG_MAX = 140;\nconst DEPS_MAX_CALLEES = 10;\nconst DEPS_MAX_CALLERS = 12;\nconst TESTS_MAX_FILES = 6;\n\n/**\n * Dependency surface for a symbol, rendered as a point-of-use footer for\n * graph_read: the symbols it CALLS (with full signatures + graph_read targets —\n * so the agent edits against real signatures instead of guessing or re-reading\n * the callee files) and the symbols that CALL it (names only — cheap \"a change\n * here affects these\" awareness). Built from the v0.3.0 symbol→symbol `calls`\n * edges. Returns \"\" when the symbol has no call edges (leaf — keep reads lean).\n */\nexport function buildDepsFooter(\n symbol: SymbolNode,\n graph: GraphSchema,\n maxChars = loadConfig().readDepsMaxChars,\n): string {\n const symById = new Map<string, SymbolNode>();\n for (const n of graph.nodes) if (n.kind === \"symbol\") symById.set(n.id, n);\n\n const calleeIds: string[] = [];\n const callerIds: string[] = [];\n const seenCallee = new Set<string>();\n const seenCaller = new Set<string>();\n for (const e of graph.edges) {\n if (e.kind !== \"calls\") continue;\n if (e.from === symbol.id && e.to !== symbol.id && !seenCallee.has(e.to)) {\n seenCallee.add(e.to);\n calleeIds.push(e.to);\n } else if (e.to === symbol.id && e.from !== symbol.id && !seenCaller.has(e.from)) {\n seenCaller.add(e.from);\n callerIds.push(e.from);\n }\n }\n\n const resolve = (ids: string[]): SymbolNode[] =>\n ids.map((id) => symById.get(id)).filter((n): n is SymbolNode => !!n);\n const callees = resolve(calleeIds).sort((a, b) =>\n a.file === b.file ? a.start_line - b.start_line : a.file < b.file ? -1 : 1,\n );\n const callers = resolve(callerIds);\n\n if (callees.length === 0 && callers.length === 0) return \"\";\n\n const lines: string[] = [];\n let used = 0;\n\n if (callees.length > 0) {\n const head = \"Depends on (signatures — don't guess these):\";\n lines.push(head);\n used += head.length + 1;\n let shown = 0;\n for (const c of callees.slice(0, DEPS_MAX_CALLEES)) {\n const sig = c.signature.trim().slice(0, DEPS_SIG_MAX);\n const entry = `• ${sig} → mcp__synthra__graph_read(\"${c.file}::${c.name}\")`;\n if (used + entry.length + 1 > maxChars) break;\n lines.push(entry);\n used += entry.length + 1;\n shown += 1;\n }\n const omitted = callees.length - shown;\n if (omitted > 0) lines.push(`…+${omitted} more`);\n }\n\n if (callers.length > 0) {\n const sep = lines.length > 0 ? 1 : 0;\n const head = `Used by (${callers.length}): `;\n const shown: string[] = [];\n let cUsed = used + sep + head.length;\n for (const c of callers.slice(0, DEPS_MAX_CALLERS)) {\n const part = `${c.name} → ${c.file}`;\n const join = shown.length > 0 ? 3 : 0; // \" · \"\n if (cUsed + join + part.length > maxChars) break;\n shown.push(part);\n cUsed += join + part.length;\n }\n if (lines.length > 0) lines.push(\"\");\n if (shown.length > 0) {\n const omitted = callers.length - shown.length;\n lines.push(head + shown.join(\" · \") + (omitted > 0 ? ` …+${omitted} more` : \"\"));\n } else {\n lines.push(`Used by (${callers.length} callers)`);\n }\n }\n\n return lines.join(\"\\n\");\n}\n\n/**\n * Test-coverage footer for graph_read: which test files cover this symbol's file\n * (file-level `tests` edges — foo.test.ts → foo.ts). Lets the agent run the\n * right test after an edit instead of guessing or running the whole suite.\n * Returns a one-line \"none linked\" nudge for ordinary source files, and \"\" for\n * symbols that live in a test/entry file (no nudge there).\n */\nexport function buildTestsFooter(symbol: SymbolNode, graph: GraphSchema): string {\n const fileNode = graph.nodes.find(\n (n): n is FileNode => n.kind === \"file\" && n.path === symbol.file,\n );\n if (!fileNode) return \"\";\n const tests = findTestsForFile(graph, fileNode);\n if (tests.length > 0) {\n const shown = tests.slice(0, TESTS_MAX_FILES).map((t) => t.path);\n const omitted = tests.length - shown.length;\n const more = omitted > 0 ? ` …+${omitted} more` : \"\";\n return `Tests (file-level): ${shown.join(\" · \")}${more} — run after editing`;\n }\n // No linked tests — nudge only for ordinary source files (entry/test files excluded).\n if (isLikelyEntry(symbol.file)) return \"\";\n return \"Tests: none linked to this file.\";\n}\n\nasync function graphRead(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const target = typeof args?.target === \"string\" ? args.target : \"\";\n if (!target) return errorContent(\"graph_read: 'target' (string) is required\");\n\n const [rawFile, symbolName] = target.includes(\"::\") ? target.split(\"::\", 2) : [target, undefined];\n const filePath = (rawFile ?? \"\").trim();\n\n const resolved = resolveFileTarget(ctx.graph, filePath);\n if (\"ambiguous\" in resolved) {\n const shown = resolved.ambiguous.slice(0, 5).join(\", \");\n const more = resolved.ambiguous.length > 5 ? \", …\" : \"\";\n return errorContent(\n `graph_read: '${filePath}' matches multiple files (${shown}${more}). Pass a longer path.`,\n );\n }\n if (\"none\" in resolved) {\n return errorContent(`graph_read: file not found in graph: ${filePath}`);\n }\n const fileNode = resolved.node;\n\n // The AI deliberately pulled this file — the strongest \"this matters\" signal\n // short of an edit. Feed it to the learning layer.\n await logAccess(ctx, { ts: nowIso(), path: fileNode.path, source: \"read\" });\n\n if (!symbolName) {\n return textContent(`# ${fileNode.path}\\n\\n${fileNode.content}`);\n }\n\n const cleanSym = symbolName.trim();\n const symbol = ctx.graph.nodes.find(\n (n): n is SymbolNode => n.kind === \"symbol\" && n.file === fileNode.path && n.name === cleanSym,\n );\n if (!symbol) {\n return errorContent(`graph_read: symbol '${cleanSym}' not found in ${fileNode.path}`);\n }\n\n const lines = fileNode.content.split(/\\r?\\n/);\n const body = lines.slice(symbol.start_line - 1, symbol.end_line).join(\"\\n\");\n\n // Point-of-use edit recipe. Claude Code's Edit tool only accepts a file\n // opened with its own Read tool — this slice doesn't satisfy that gate — so\n // without this nudge agents re-Read the whole file before editing (the\n // dogfood log's biggest token leak: the same large file Read 15-19× a\n // session). Hand them the exact targeted Read that satisfies the gate cheaply,\n // with 2 lines of headroom each side for off-by-one safety + unique Edit context.\n const offset = Math.max(1, symbol.start_line - 2);\n const limit = symbol.end_line - symbol.start_line + 1 + 4;\n const editHint =\n `\\n\\n---\\n✎ To edit this symbol: Read(\"${fileNode.path}\", offset=${offset}, limit=${limit}) ` +\n `then Edit — that satisfies Claude Code's read-gate at ~${limit} lines; do NOT re-read the whole file.`;\n\n const deps = buildDepsFooter(symbol, ctx.graph);\n const depsBlock = deps ? `\\n\\n---\\n${deps}` : \"\";\n\n const tests = buildTestsFooter(symbol, ctx.graph);\n const testsBlock = tests ? `\\n\\n---\\n${tests}` : \"\";\n\n return textContent(\n `# ${fileNode.path}::${symbol.name} (L${symbol.start_line}-${symbol.end_line})\\n\\n${body}${depsBlock}${testsBlock}${editHint}`,\n );\n}\n\nconst editedFiles = new Set<string>();\n\nasync function graphRegisterEdit(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const files = Array.isArray(args?.files)\n ? (args.files as unknown[]).filter((f) => typeof f === \"string\")\n : [];\n for (const f of files) {\n const file = f as string;\n editedFiles.add(file);\n // An edit is the strongest relevance signal — record it (weight 2). Resolve\n // to the canonical graph path so it keys to the same node the ranker scores;\n // a new/renamed file simply logs its raw path and decays out if unmatched.\n const resolved = resolveFileTarget(ctx.graph, file);\n await logAccess(ctx, {\n ts: nowIso(),\n path: \"node\" in resolved ? resolved.node.path : file,\n source: \"register_edit\",\n });\n }\n return textContent(\n `Registered ${files.length} edited file(s). Total tracked this session: ${editedFiles.size}.`,\n );\n}\n\nexport function getRegisteredEdits(): string[] {\n return Array.from(editedFiles);\n}\n\nconst VALID_KINDS = new Set<EntryKind>([\"decision\", \"task\", \"next\", \"fact\", \"blocker\"]);\n\nasync function contextRemember(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const text = typeof args?.text === \"string\" ? args.text.trim() : \"\";\n const kindRaw = typeof args?.kind === \"string\" ? args.kind : \"\";\n if (!text) return errorContent(\"context_remember: 'text' (string) is required\");\n if (!VALID_KINDS.has(kindRaw as EntryKind)) {\n return errorContent(\n `context_remember: 'kind' must be one of ${Array.from(VALID_KINDS).join(\", \")}`,\n );\n }\n const tags = Array.isArray(args?.tags)\n ? (args.tags as unknown[]).filter((t): t is string => typeof t === \"string\")\n : [];\n const files = Array.isArray(args?.files)\n ? (args.files as unknown[]).filter((f): f is string => typeof f === \"string\")\n : [];\n\n const result = await rememberEntry(ctx.paths, {\n text,\n kind: kindRaw as EntryKind,\n tags,\n files,\n });\n\n return textContent(\n `Remembered ${result.entry.type} on branch '${result.branch}'.\\n` +\n `Stored: ${result.storePath}\\n` +\n `CONTEXT.md refreshed: ${result.contextMdPath}`,\n );\n}\n\nconst DEFAULT_RECENT_WINDOW_MS = 60 * 60 * 1000;\n\nfunction recentActivity(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const sinceMs =\n typeof args?.since_ms === \"number\" && Number.isFinite(args.since_ms)\n ? args.since_ms\n : Date.now() - DEFAULT_RECENT_WINDOW_MS;\n const limit =\n typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : undefined;\n\n let events = ctx.activity.getEvents(sinceMs);\n if (limit) events = events.slice(-limit);\n\n if (events.length === 0) {\n return textContent(`No human-activity events since ${new Date(sinceMs).toISOString()}.`);\n }\n\n const lines = [`# Recent human activity (${events.length} events)`, \"\"];\n for (const e of events) {\n if (\"path\" in e) {\n lines.push(`- **${e.kind}** ${e.path} _(${e.ts})_`);\n } else {\n const summary = JSON.stringify(e.details);\n lines.push(`- **${e.kind}** ${summary} _(${e.ts})_`);\n }\n }\n return textContent(lines.join(\"\\n\"));\n}\n\nasync function contextRecall(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const kind =\n typeof args?.kind === \"string\" && VALID_KINDS.has(args.kind as EntryKind)\n ? (args.kind as EntryKind)\n : undefined;\n const branch = typeof args?.branch === \"string\" ? args.branch : undefined;\n const limit =\n typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : undefined;\n\n const result = await recallEntries(ctx.paths, { kind, branch, limit });\n\n if (result.entries.length === 0) {\n const filter = kind ? ` of kind '${kind}'` : \"\";\n return textContent(`No context entries${filter} on branch '${result.branch}'.`);\n }\n\n const lines = [`# Context entries — branch: ${result.branch}`, \"\"];\n for (const e of result.entries) {\n const tags = e.tags.length ? ` [${e.tags.join(\", \")}]` : \"\";\n lines.push(`- **${e.type}**${tags} (${e.date}): ${e.content}`);\n if (e.files.length) lines.push(` files: ${e.files.join(\", \")}`);\n }\n return textContent(lines.join(\"\\n\"));\n}\n\n// Best-effort per-call log of Synthra MCP tool usage — powers the dashboard's\n// graph-tool-usage metric (#2). A positive signal (how often the graph was\n// actually used) vs the blocked-Grep proxy, which misses well-behaved pivots.\nasync function logToolCall(ctx: ServerContext, tool: string): Promise<void> {\n try {\n await mkdir(dirname(ctx.paths.toolLog), { recursive: true });\n await appendFile(\n ctx.paths.toolLog,\n JSON.stringify({ ts: new Date().toISOString(), tool }) + \"\\n\",\n \"utf8\",\n );\n } catch {\n // Logging is best-effort; never fail a tool call over it.\n }\n}\n\n// Best-effort per-file usage capture (learning layer). Routes through the learn\n// runtime when present (folds the decayed aggregate in memory + appends the raw\n// log); otherwise appends the raw log directly so a runtime-less context (tests,\n// CLI) still records signal. Never throws — callers await it but its own errors\n// are swallowed, so telemetry can never fail a tool call.\nasync function logAccess(ctx: ServerContext, ev: AccessEvent): Promise<void> {\n try {\n if (ctx.learn) await ctx.learn.record(ev);\n else await appendAccess(ctx.paths.accessLog, ev);\n } catch {\n // best-effort\n }\n}\n\nfunction nowIso(): string {\n return new Date().toISOString();\n}\n\nexport async function handleMcpRequest(\n body: unknown,\n ctx: ServerContext,\n): Promise<JsonRpcResponse> {\n if (!body || typeof body !== \"object\") {\n return err(null, ERR.invalidRequest, \"Request body must be a JSON-RPC 2.0 object.\");\n }\n\n const req = body as JsonRpcRequest;\n if (req.jsonrpc !== \"2.0\" || typeof req.method !== \"string\") {\n return err(req.id ?? null, ERR.invalidRequest, \"Invalid JSON-RPC envelope.\");\n }\n\n const id = req.id ?? null;\n\n try {\n switch (req.method) {\n case \"initialize\":\n return ok(id, {\n protocolVersion:\n typeof req.params?.protocolVersion === \"string\"\n ? req.params.protocolVersion\n : PROTOCOL_VERSION,\n capabilities: { tools: {} },\n serverInfo: SERVER_INFO,\n });\n\n case \"notifications/initialized\":\n // Client confirms initialization. No response required for notifications (id===undefined).\n return ok(id, {});\n\n case \"tools/list\":\n return ok(id, { tools: TOOLS });\n\n case \"tools/call\": {\n const params = req.params ?? {};\n const toolName = typeof params.name === \"string\" ? params.name : \"\";\n if (!toolName) return err(id, ERR.invalidParams, \"'name' is required for tools/call.\");\n const args =\n params.arguments && typeof params.arguments === \"object\"\n ? (params.arguments as Record<string, unknown>)\n : {};\n void logToolCall(ctx, toolName);\n const result = await callTool(toolName, args, ctx);\n return ok(id, result);\n }\n\n case \"ping\":\n return ok(id, {});\n\n default:\n return err(id, ERR.methodNotFound, `Method not found: ${req.method}`);\n }\n } catch (e) {\n return err(id, ERR.internal, (e as Error).message);\n }\n}\n\n// Exposed for code that wants to enumerate the tool catalogue without going\n// through JSON-RPC (e.g. CLI introspection in M3).\nexport function listTools(): Array<{ name: string; description: string; inputSchema: unknown }> {\n return TOOLS.map((t) => ({\n name: t.name,\n description: t.description,\n inputSchema: t.inputSchema,\n }));\n}\n","// Scoring for retrieved files. Combines:\n// - keyword overlap with the (already-tokenized) query\n// - symbol-name overlap (boosted: hits in a file's defined symbols matter more)\n// - import-graph proximity from session-known + recent paths (boost adjacent files)\n// - recency boost from activity log (placeholder — wired in M5)\n\nimport type { Edge, FileNode, GraphSchema, SymbolNode } from \"./types.js\";\n\nexport interface RankInputs {\n candidates: FileNode[];\n query: string;\n graph?: GraphSchema;\n recentlyEditedPaths?: string[];\n sessionKnownPaths?: string[];\n /** Decayed per-file usage weights (path → weight) from the learning layer.\n * Applied as a bounded boost to files that ALREADY match the query. Omit to\n * disable (the ranker is then byte-identical to its deterministic form). */\n usageScores?: ReadonlyMap<string, number>;\n}\n\n// Base weight for a keyword match. The IDF reweighting is normalized to the\n// query's mean IDF, so a \"typical\"-rarity match contributes exactly this — which\n// preserves today's score magnitude (and the confidence/Moat calibration that\n// depends on it) while letting rarer terms score above and common terms below.\nconst KW_BASE_WEIGHT = 2;\n\n// Max additive usage boost. Strictly below the +5 seed boost so a maxed-out\n// usage signal can reorder within a relevance band but never leapfrog a freshly\n// seeded file or two exact symbol matches (+6). Env-overridable for tuning.\nconst USAGE_BOOST_CAP_DEFAULT = 4;\n\nfunction usageBoostCap(): number {\n const env = Number(process.env.SYN_LEARN_BOOST_CAP);\n return Number.isFinite(env) && env >= 0 ? env : USAGE_BOOST_CAP_DEFAULT;\n}\n\nexport interface ScoredFile {\n file: FileNode;\n score: number;\n reasons: string[];\n /** Total symbol-match weight (exact name = 3, partial substring = 1). */\n symHits: number;\n /** Count of symbols whose name a query token matched *exactly*. The gate\n * uses this — a partial substring match is too noisy (\"id\" ⊂ \"width\"). */\n exactSym: number;\n}\n\nconst STOPWORDS = new Set([\n \"a\",\n \"an\",\n \"and\",\n \"are\",\n \"as\",\n \"at\",\n \"be\",\n \"by\",\n \"for\",\n \"from\",\n \"has\",\n \"have\",\n \"in\",\n \"is\",\n \"it\",\n \"of\",\n \"on\",\n \"or\",\n \"that\",\n \"the\",\n \"this\",\n \"to\",\n \"was\",\n \"we\",\n \"with\",\n \"what\",\n \"where\",\n \"when\",\n \"why\",\n \"how\",\n \"do\",\n \"does\",\n \"i\",\n \"me\",\n \"my\",\n \"you\",\n \"your\",\n \"code\",\n \"file\",\n]);\n\nexport function tokenizeQuery(query: string): string[] {\n const tokens = query\n .toLowerCase()\n .split(/[^a-z0-9_]+/g)\n .filter((t) => t.length > 1 && !STOPWORDS.has(t));\n // Also split camelCase/snake_case for queries like \"AuthService\"\n const expanded = new Set<string>();\n for (const t of tokens) {\n expanded.add(t);\n const parts = t.match(/[a-z]+|[0-9]+/g) ?? [];\n for (const p of parts) if (p.length > 1) expanded.add(p);\n }\n return Array.from(expanded);\n}\n\nfunction indexSymbolsByFile(graph: GraphSchema | undefined): Map<string, SymbolNode[]> {\n const out = new Map<string, SymbolNode[]>();\n if (!graph) return out;\n for (const n of graph.nodes) {\n if (n.kind !== \"symbol\") continue;\n const list = out.get(n.file) ?? [];\n list.push(n);\n out.set(n.file, list);\n }\n return out;\n}\n\nfunction indexImportEdges(graph: GraphSchema | undefined): Map<string, Set<string>> {\n // file path → set of file paths it imports (1-hop)\n const out = new Map<string, Set<string>>();\n if (!graph) return out;\n const idToPath = new Map<string, string>();\n for (const n of graph.nodes) if (n.kind === \"file\") idToPath.set(n.id, n.path);\n for (const e of graph.edges as Edge[]) {\n if (e.kind !== \"imports\") continue;\n const from = idToPath.get(e.from);\n const to = idToPath.get(e.to);\n if (!from || !to) continue;\n const s = out.get(from) ?? new Set<string>();\n s.add(to);\n out.set(from, s);\n }\n return out;\n}\n\nexport function scoreFiles(inputs: RankInputs): ScoredFile[] {\n const qTokens = new Set(tokenizeQuery(inputs.query));\n const symbolsByFile = indexSymbolsByFile(inputs.graph);\n const importsFrom = indexImportEdges(inputs.graph);\n\n const seeds = new Set<string>(inputs.sessionKnownPaths ?? []);\n for (const p of inputs.recentlyEditedPaths ?? []) seeds.add(p);\n\n // IDF weighting for keyword matches — the part of BM25 that fits our deduped\n // top-N keyword representation (TF saturation / length-norm collapse here). A\n // query token that's rare across the repo counts for more than a common one.\n // Document frequency is computed over the candidate corpus for the query's\n // tokens only; `refIdf` (the query's mean IDF) normalizes the weighting so a\n // typical match still scores KW_BASE_WEIGHT — preserving the overall magnitude\n // and the confidence/Moat calibration, while reordering within the band.\n const corpusSize = inputs.candidates.length;\n const queryDf = new Map<string, number>();\n for (const f of inputs.candidates) {\n for (const kw of f.keywords) {\n if (qTokens.has(kw)) queryDf.set(kw, (queryDf.get(kw) ?? 0) + 1);\n }\n }\n const idf = (token: string): number => {\n const n = queryDf.get(token) ?? 0;\n if (n <= 0) return 0;\n return Math.log(1 + (corpusSize - n + 0.5) / (n + 0.5));\n };\n let idfSum = 0;\n let idfCount = 0;\n for (const t of qTokens) {\n const v = idf(t);\n if (v > 0) {\n idfSum += v;\n idfCount += 1;\n }\n }\n const refIdf = idfCount > 0 ? idfSum / idfCount : 1;\n\n // First pass: keyword + symbol score\n const scored: ScoredFile[] = [];\n for (const file of inputs.candidates) {\n const reasons: string[] = [];\n let score = 0;\n\n // Keyword overlap, IDF-weighted so a match on a rare query term outranks a\n // match on a common one (normalized to refIdf → magnitude-preserving).\n let kwHits = 0;\n let kwScore = 0;\n for (const kw of file.keywords) {\n if (!qTokens.has(kw)) continue;\n kwHits += 1;\n kwScore += KW_BASE_WEIGHT * (idf(kw) / refIdf);\n }\n if (kwHits) {\n score += kwScore;\n reasons.push(`kw=${kwHits}`);\n }\n\n // Symbol-name overlap (higher signal than file-level keywords)\n const symbols = symbolsByFile.get(file.path) ?? [];\n let symHits = 0;\n let exactSym = 0;\n for (const sym of symbols) {\n const name = sym.name.toLowerCase();\n if (qTokens.has(name)) {\n symHits += 3;\n exactSym += 1;\n } else {\n // partial match: any query token is a substring of, or contained by, the symbol name\n for (const t of qTokens) {\n if (name.includes(t) || t.includes(name)) {\n symHits += 1;\n break;\n }\n }\n }\n }\n if (symHits) {\n score += symHits;\n reasons.push(`sym=${symHits}`);\n }\n\n // Path match: file path contains a query token\n const pathLower = file.path.toLowerCase();\n let pathHits = 0;\n for (const t of qTokens) if (pathLower.includes(t)) pathHits += 1;\n if (pathHits) {\n score += pathHits;\n reasons.push(`path=${pathHits}`);\n }\n\n if (seeds.has(file.path)) {\n score += 5;\n reasons.push(\"seed\");\n }\n\n scored.push({ file, score, reasons, symHits, exactSym });\n }\n\n // Second pass: 1-hop import-graph boost from any file already scored > 0\n const positivePaths = new Set(scored.filter((s) => s.score > 0).map((s) => s.file.path));\n if (positivePaths.size > 0) {\n for (const s of scored) {\n if (s.score > 0) continue;\n // Does any file that imports this one have a positive score?\n let importBoost = 0;\n for (const [from, tos] of importsFrom) {\n if (!positivePaths.has(from)) continue;\n if (tos.has(s.file.path)) {\n importBoost += 1;\n break;\n }\n }\n if (importBoost) {\n s.score += importBoost * 0.5;\n s.reasons.push(\"imp-adj\");\n }\n }\n }\n\n // Usage-learning boost (learning v1): files the session has actually pulled or\n // edited get a small, decayed, capped bump so genuinely-hot files surface\n // first. Anchored to files that already match the query (score > 0) so a\n // popular-but-irrelevant file is never promoted; relatively normalized (u/maxU)\n // and capped below the +5 seed so it reorders within a band, never dominates.\n const usage = inputs.usageScores;\n if (usage && usage.size > 0) {\n let maxU = 0;\n for (const v of usage.values()) if (v > maxU) maxU = v;\n if (maxU > 0) {\n const cap = usageBoostCap();\n for (const s of scored) {\n if (s.score <= 0) continue;\n const u = usage.get(s.file.path) ?? 0;\n if (u <= 0) continue;\n s.score += cap * (u / maxU);\n s.reasons.push(`used×${Math.round(u)}`);\n }\n }\n }\n\n scored.sort((a, b) => b.score - a.score);\n return scored;\n}\n\nexport function rank(inputs: RankInputs): FileNode[] {\n return scoreFiles(inputs).map((s) => s.file);\n}\n","// Query-time retrieval. Given a natural-language query (or a symbol name),\n// returns a ranked list of FileNodes plus a confidence label.\n\nimport { scoreFiles, tokenizeQuery, type RankInputs } from \"./rank.js\";\nimport type { FileNode, GraphSchema } from \"./types.js\";\n\nexport interface RetrievalResult {\n files: FileNode[];\n confidence: \"high\" | \"medium\" | \"low\";\n reason: string;\n /** True if any returned file has a symbol whose name a query token matched\n * exactly — i.e. graph_read can serve a real `file::symbol` slice for this\n * query. When false, a Grep/Glob block would only force a fallback Read. */\n symbolMatched: boolean;\n}\n\nexport interface RetrieveOptions {\n topK?: number;\n recentlyEditedPaths?: string[];\n sessionKnownPaths?: string[];\n /** Decayed per-file usage weights from the learning layer. Passed straight\n * through to the ranker as a bounded boost on already-matching files. */\n usageScores?: ReadonlyMap<string, number>;\n}\n\nexport async function retrieve(\n graph: GraphSchema,\n query: string,\n options: RetrieveOptions = {},\n): Promise<RetrievalResult> {\n const topK = options.topK ?? 12;\n const qTokens = tokenizeQuery(query);\n\n const allFiles: FileNode[] = graph.nodes.filter((n): n is FileNode => n.kind === \"file\");\n\n if (allFiles.length === 0 || qTokens.length === 0) {\n return {\n files: [],\n confidence: \"low\",\n reason: qTokens.length === 0 ? \"empty query\" : \"empty graph\",\n symbolMatched: false,\n };\n }\n\n const rankInputs: RankInputs = {\n candidates: allFiles,\n query,\n graph,\n recentlyEditedPaths: options.recentlyEditedPaths,\n sessionKnownPaths: options.sessionKnownPaths,\n usageScores: options.usageScores,\n };\n const scored = scoreFiles(rankInputs);\n const positive = scored.filter((s) => s.score > 0);\n\n if (positive.length === 0) {\n return {\n files: [],\n confidence: \"low\",\n reason: `no matches for ${JSON.stringify(qTokens)}`,\n symbolMatched: false,\n };\n }\n\n const topScored = positive.slice(0, topK);\n const top = topScored.map((s) => s.file);\n const symbolMatched = topScored.some((s) => s.exactSym > 0);\n const topScore = positive[0]?.score ?? 0;\n const secondScore = positive[1]?.score ?? 0;\n\n // confidence: high = clear top match (2x next or only one hit)\n // medium = several hits but no dominant one\n // low = a few weak hits\n let confidence: \"high\" | \"medium\" | \"low\";\n if (positive.length === 1) confidence = \"high\";\n else if (topScore >= 6 && topScore >= secondScore * 2) confidence = \"high\";\n else if (topScore >= 3) confidence = \"medium\";\n else confidence = \"low\";\n\n const reasons = positive\n .slice(0, Math.min(3, top.length))\n .map((s) => `${s.file.path} (${s.reasons.join(\",\")})`)\n .join(\"; \");\n\n return {\n files: top,\n confidence,\n reason: `top: ${reasons}`,\n symbolMatched,\n };\n}\n","// Branch-aware routing for the context store.\n// On the default branch, reads/writes go to .synthra/context-store.json.\n// On a feature branch, they go to .synthra/branches/<sanitized-branch>/context-store.json.\n\nimport { execFile } from \"node:child_process\";\nimport { readFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { promisify } from \"node:util\";\n\nconst execFileAsync = promisify(execFile);\n\nexport async function currentBranch(projectRoot: string): Promise<string> {\n // Try .git/HEAD first — avoids the subprocess cost and works for detached\n // worktrees too (.git is a file there).\n try {\n const headPath = join(projectRoot, \".git\", \"HEAD\");\n const head = await readFile(headPath, \"utf8\");\n const trimmed = head.trim();\n const match = trimmed.match(/^ref:\\s+refs\\/heads\\/(.+)$/);\n if (match?.[1]) return match[1];\n // Detached HEAD — fall through\n } catch {\n // .git/HEAD unreadable (worktree file, submodule, or not a git repo)\n }\n\n try {\n const { stdout } = await execFileAsync(\"git\", [\"branch\", \"--show-current\"], {\n cwd: projectRoot,\n });\n const name = stdout.trim();\n if (name) return name;\n } catch {\n // git not on PATH or not a repo\n }\n\n return \"main\";\n}\n\nexport async function defaultBranch(projectRoot: string): Promise<string> {\n try {\n const { stdout } = await execFileAsync(\n \"git\",\n [\"symbolic-ref\", \"refs/remotes/origin/HEAD\", \"--short\"],\n { cwd: projectRoot },\n );\n const trimmed = stdout.trim();\n const match = trimmed.match(/^origin\\/(.+)$/);\n if (match?.[1]) return match[1];\n } catch {\n // No origin/HEAD set — fall back to heuristic\n }\n return \"main\";\n}\n\nexport function sanitizeBranchName(name: string): string {\n return name.replaceAll(\"/\", \"-\").replaceAll(\"\\\\\", \"-\");\n}\n\nexport interface BranchScopedPaths {\n contextStore: string;\n contextMd: string;\n branchDir: string | null;\n}\n\nexport function resolveBranchPaths(\n contextDir: string,\n branch: string,\n isDefault: boolean,\n): BranchScopedPaths {\n if (isDefault) {\n return {\n contextStore: join(contextDir, \"context-store.json\"),\n contextMd: join(contextDir, \"CONTEXT.md\"),\n branchDir: null,\n };\n }\n const branchDir = join(contextDir, \"branches\", sanitizeBranchName(branch));\n return {\n contextStore: join(branchDir, \"context-store.json\"),\n contextMd: join(branchDir, \"CONTEXT.md\"),\n branchDir,\n };\n}\n","// Free-form CONTEXT.md narrative. Updated by Stop hook at session end with:\n// - Current Task (1 sentence)\n// - Key Decisions (max 3 bullets)\n// - Next Steps (max 3 bullets)\n// Capped at ~20 visible content lines.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport type { ContextEntry } from \"./context-store.js\";\n\nexport interface ContextMd {\n branch: string;\n currentTask: string;\n keyDecisions: string[];\n nextSteps: string[];\n date: string;\n}\n\nconst MAX_BULLETS = 3;\n\nexport function deriveContextMd(entries: ContextEntry[], branch: string): ContextMd {\n // Latest pending task drives \"current task\".\n const tasks = entries.filter((e) => e.type === \"task\").reverse();\n const currentTask = tasks[0]?.content ?? \"\";\n\n const keyDecisions = entries\n .filter((e) => e.type === \"decision\")\n .slice(-MAX_BULLETS)\n .map((e) => e.content);\n\n const nextSteps = entries\n .filter((e) => e.type === \"next\")\n .slice(-MAX_BULLETS)\n .map((e) => e.content);\n\n return {\n branch,\n currentTask,\n keyDecisions,\n nextSteps,\n date: new Date().toISOString(),\n };\n}\n\nexport function formatContextMd(ctx: ContextMd): string {\n const lines: string[] = [];\n lines.push(`# Context — ${ctx.branch}`);\n lines.push(\"\");\n lines.push(`_Updated: ${ctx.date}_`);\n lines.push(\"\");\n\n if (ctx.currentTask) {\n lines.push(`## Current task`);\n lines.push(ctx.currentTask);\n lines.push(\"\");\n }\n\n if (ctx.keyDecisions.length) {\n lines.push(`## Key decisions`);\n for (const d of ctx.keyDecisions) lines.push(`- ${d}`);\n lines.push(\"\");\n }\n\n if (ctx.nextSteps.length) {\n lines.push(`## Next steps`);\n for (const n of ctx.nextSteps) lines.push(`- ${n}`);\n lines.push(\"\");\n }\n\n if (!ctx.currentTask && !ctx.keyDecisions.length && !ctx.nextSteps.length) {\n lines.push(\"_(no context entries yet — use `context_remember` to add one)_\");\n lines.push(\"\");\n }\n\n return lines.join(\"\\n\");\n}\n\nexport async function writeContextMd(path: string, ctx: ContextMd): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, formatContextMd(ctx), \"utf8\");\n}\n\nexport async function readContextMd(path: string): Promise<string | null> {\n try {\n return await readFile(path, \"utf8\");\n } catch {\n return null;\n }\n}\n","// Structured decisions/tasks/facts that persist across sessions.\n// Stored in .synthra/ (GIT-TRACKED) so teammates inherit them.\n// Branch-partitioned via branches.ts.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nexport type EntryKind = \"decision\" | \"task\" | \"next\" | \"fact\" | \"blocker\";\n\nexport interface ContextEntry {\n type: EntryKind;\n content: string;\n tags: string[];\n files: string[];\n date: string;\n /** Provenance. Reserved for v2 auto-capture; v1 only writes manual entries, so\n * the field is omitted today and read back as undefined (treated as manual). */\n source?: \"manual\" | \"auto\";\n}\n\ninterface Store {\n schema_version: number;\n entries: ContextEntry[];\n}\n\nconst SCHEMA_VERSION = 1;\n\nexport async function readEntries(path: string): Promise<ContextEntry[]> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<Store>;\n return Array.isArray(parsed.entries) ? parsed.entries : [];\n } catch {\n return [];\n }\n}\n\nexport async function writeEntries(path: string, entries: ContextEntry[]): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n const store: Store = { schema_version: SCHEMA_VERSION, entries };\n await writeFile(path, JSON.stringify(store, null, 2) + \"\\n\", \"utf8\");\n}\n\nexport async function appendEntry(path: string, entry: ContextEntry): Promise<void> {\n const entries = await readEntries(path);\n entries.push(entry);\n await writeEntries(path, entries);\n}\n","// High-level orchestration: branch detection + store routing + CONTEXT.md\n// refresh in one call. Used by the MCP tools and the /context-update route.\n\nimport type { SynthraPaths } from \"../shared/paths.js\";\nimport {\n currentBranch,\n defaultBranch,\n resolveBranchPaths,\n type BranchScopedPaths,\n} from \"./branches.js\";\nimport { deriveContextMd, writeContextMd } from \"./context-md.js\";\nimport { appendEntry, readEntries, type ContextEntry, type EntryKind } from \"./context-store.js\";\n\nexport interface ActiveBranch {\n branch: string;\n isDefault: boolean;\n paths: BranchScopedPaths;\n}\n\nexport async function resolveActiveBranch(\n paths: SynthraPaths,\n override?: string,\n): Promise<ActiveBranch> {\n const branch = override ?? (await currentBranch(paths.projectRoot));\n const def = await defaultBranch(paths.projectRoot);\n const isDefault = branch === def;\n return {\n branch,\n isDefault,\n paths: resolveBranchPaths(paths.contextDir, branch, isDefault),\n };\n}\n\nexport interface RememberInput {\n text: string;\n kind: EntryKind;\n tags?: string[];\n files?: string[];\n}\n\nexport interface RememberResult {\n entry: ContextEntry;\n branch: string;\n storePath: string;\n contextMdPath: string;\n}\n\nexport async function rememberEntry(\n paths: SynthraPaths,\n input: RememberInput,\n): Promise<RememberResult> {\n const active = await resolveActiveBranch(paths);\n const entry: ContextEntry = {\n type: input.kind,\n content: input.text,\n tags: input.tags ?? [],\n files: input.files ?? [],\n date: new Date().toISOString(),\n };\n await appendEntry(active.paths.contextStore, entry);\n\n // Refresh CONTEXT.md so the narrative stays in sync with the structured store.\n const entries = await readEntries(active.paths.contextStore);\n const md = deriveContextMd(entries, active.branch);\n await writeContextMd(active.paths.contextMd, md);\n\n return {\n entry,\n branch: active.branch,\n storePath: active.paths.contextStore,\n contextMdPath: active.paths.contextMd,\n };\n}\n\nexport interface RecallInput {\n kind?: EntryKind;\n branch?: string;\n limit?: number;\n}\n\nexport interface RecallResult {\n branch: string;\n entries: ContextEntry[];\n storePath: string;\n}\n\nexport async function recallEntries(\n paths: SynthraPaths,\n input: RecallInput = {},\n): Promise<RecallResult> {\n const active = await resolveActiveBranch(paths, input.branch);\n let entries = await readEntries(active.paths.contextStore);\n if (input.kind) entries = entries.filter((e) => e.type === input.kind);\n if (input.limit && input.limit > 0) entries = entries.slice(-input.limit);\n return {\n branch: active.branch,\n entries,\n storePath: active.paths.contextStore,\n };\n}\n\nexport async function refreshContextMd(paths: SynthraPaths, branchOverride?: string) {\n const active = await resolveActiveBranch(paths, branchOverride);\n const entries = await readEntries(active.paths.contextStore);\n const md = deriveContextMd(entries, active.branch);\n await writeContextMd(active.paths.contextMd, md);\n return {\n branch: active.branch,\n path: active.paths.contextMd,\n entriesSeen: entries.length,\n };\n}\n","// Renders the final context pack as a single Markdown blob for Claude.\n\nexport interface FormatFileSection {\n path: string;\n reason?: string;\n signatures: string[];\n inlineBodies: string;\n associatedTests?: string[];\n}\n\nexport interface FormatInputs {\n query: string;\n files: FormatFileSection[];\n recentActivity?: string;\n truncated?: boolean;\n}\n\nexport function formatPack(inputs: FormatInputs): string {\n const parts: string[] = [];\n parts.push(`# Synthra context — query: ${JSON.stringify(inputs.query)}\\n`);\n\n if (inputs.files.length === 0) {\n parts.push(\"> No matching files found in the graph.\\n\");\n }\n\n for (const f of inputs.files) {\n const heading = f.reason ? `## ${f.path} _(${f.reason})_` : `## ${f.path}`;\n parts.push(heading);\n\n if (f.signatures.length === 0) {\n parts.push(\"_(no symbols extracted)_\");\n } else {\n parts.push(\"**Signatures:**\");\n for (const s of f.signatures) parts.push(`- ${s}`);\n }\n\n if (f.inlineBodies.trim().length > 0) {\n parts.push(\"\");\n parts.push(\"**Bodies:**\");\n parts.push(\"```\");\n parts.push(f.inlineBodies.trimEnd());\n parts.push(\"```\");\n }\n\n if (f.associatedTests?.length) {\n parts.push(\"\");\n parts.push(`**Tests:** ${f.associatedTests.join(\", \")}`);\n }\n\n parts.push(\"\");\n }\n\n if (inputs.recentActivity?.trim()) {\n parts.push(\"---\");\n parts.push(\"## Recent human activity\");\n parts.push(inputs.recentActivity.trim());\n parts.push(\"\");\n }\n\n if (inputs.truncated) {\n parts.push(\"> _(pack truncated to fit budget)_\");\n }\n\n return parts.join(\"\\n\");\n}\n","// Picks the top function bodies from a file (by relevance to the query) and\n// inlines them, respecting a char-based budget. Truncates oversized bodies.\n\nimport { tokenizeQuery } from \"../graph/rank.js\";\nimport type { FileNode, SymbolKind, SymbolNode } from \"../graph/types.js\";\n\nexport interface InlineSelection {\n text: string;\n charsUsed: number;\n functionsInlined: string[];\n}\n\nconst INLINABLE_KINDS = new Set<SymbolKind>([\"function\", \"method\", \"class\"]);\nconst MAX_BODY_CHARS = 1500;\n\nfunction sliceLines(content: string, startLine: number, endLine: number): string {\n const lines = content.split(/\\r?\\n/);\n return lines.slice(Math.max(0, startLine - 1), endLine).join(\"\\n\");\n}\n\nfunction scoreSymbol(name: string, qTokens: Set<string>): number {\n const lower = name.toLowerCase();\n if (qTokens.has(lower)) return 3;\n for (const t of qTokens) {\n if (lower.includes(t) || t.includes(lower)) return 1;\n }\n return 0;\n}\n\nfunction truncate(body: string): string {\n if (body.length <= MAX_BODY_CHARS) return body;\n return body.slice(0, MAX_BODY_CHARS).trimEnd() + \"\\n // … truncated\";\n}\n\nexport function selectInlineBodies(\n file: FileNode,\n symbols: SymbolNode[],\n query: string,\n budgetChars: number,\n): InlineSelection {\n if (budgetChars <= 0) {\n return { text: \"\", charsUsed: 0, functionsInlined: [] };\n }\n\n const qTokens = new Set(tokenizeQuery(query));\n const mine = symbols.filter((s) => s.file === file.path && INLINABLE_KINDS.has(s.symbol_kind));\n\n const scored = mine\n .map((s) => ({ sym: s, score: scoreSymbol(s.name, qTokens) }))\n .sort((a, b) => {\n if (b.score !== a.score) return b.score - a.score;\n // Tie-break: smaller bodies first (so we fit more)\n const aSpan = a.sym.end_line - a.sym.start_line || 1;\n const bSpan = b.sym.end_line - b.sym.start_line || 1;\n return aSpan - bSpan;\n });\n\n const parts: string[] = [];\n const inlined: string[] = [];\n let used = 0;\n\n for (const { sym, score } of scored) {\n // Skip irrelevant symbols entirely when we have positive hits available;\n // fall back to top-by-size if no query match landed.\n if (score === 0 && inlined.length > 0) break;\n\n const body = truncate(sliceLines(file.content, sym.start_line, sym.end_line));\n const header = `${file.path}::${sym.name} (L${sym.start_line}-${sym.end_line})`;\n const block = `${header}\\n${body}\\n`;\n if (used + block.length > budgetChars) {\n if (inlined.length > 0) break;\n // No room and nothing yet — take a head-only slice.\n const remaining = Math.max(0, budgetChars - used - header.length - 16);\n if (remaining <= 0) break;\n const partial = body.slice(0, remaining).trimEnd() + \"\\n // … truncated\";\n const finalBlock = `${header}\\n${partial}\\n`;\n parts.push(finalBlock);\n inlined.push(sym.name);\n used += finalBlock.length;\n break;\n }\n parts.push(block);\n inlined.push(sym.name);\n used += block.length;\n }\n\n return { text: parts.join(\"\\n\"), charsUsed: used, functionsInlined: inlined };\n}\n","// Extracts function/class signatures from a FileNode (no bodies).\n// Signatures are the first line of each symbol in the file, sorted by line.\n\nimport type { FileNode, SymbolNode } from \"../graph/types.js\";\n\nexport function extractSignatures(file: FileNode, symbols: SymbolNode[]): string[] {\n const mine = symbols\n .filter((s) => s.file === file.path)\n .slice()\n .sort((a, b) => a.start_line - b.start_line);\n\n return mine.map((s) => `L${s.start_line}: ${s.signature.trim()}`);\n}\n","// Test ↔ source co-retrieval. Given a source file, returns the test files\n// linked to it via `tests` edges in the graph (foo.test.ts → foo.ts).\n\nimport type { FileNode, GraphSchema } from \"../graph/types.js\";\n\nexport function findTestsForFile(graph: GraphSchema, file: FileNode): FileNode[] {\n // tests edges run from test file → source file\n const fileNodesById = new Map<string, FileNode>();\n for (const n of graph.nodes) {\n if (n.kind === \"file\") fileNodesById.set(n.id, n);\n }\n\n const out: FileNode[] = [];\n for (const e of graph.edges) {\n if (e.kind !== \"tests\" || e.to !== file.id) continue;\n const testFile = fileNodesById.get(e.from);\n if (testFile && !out.includes(testFile)) out.push(testFile);\n }\n return out;\n}\n","// Compresses a list of retrieved files into a structured context pack:\n// signatures + top function bodies + tests co-retrieved + dependency edges.\n// Budget is enforced in characters (~ tokens × 4) — see SYN_HARD_MAX_READ_CHARS.\n\nimport type { FileNode, GraphSchema, SymbolNode } from \"../graph/types.js\";\nimport { formatPack, type FormatFileSection } from \"./format.js\";\nimport { selectInlineBodies } from \"./inline.js\";\nimport { extractSignatures } from \"./signatures.js\";\nimport { findTestsForFile } from \"./tests.js\";\n\nexport interface PackOptions {\n query: string;\n graph: GraphSchema;\n /** Soft target for total tokens (≈ chars/4). Default: 4000. */\n budgetTokens?: number;\n /** Fraction of remaining budget to spend on a single file's inline bodies. Default: 0.5. */\n inlineBodyRatio?: number;\n /** Co-retrieve linked test files when packing source files. Default: true. */\n includeTests?: boolean;\n /** Optional: file path → reason string from the ranker, surfaced in the pack heading. */\n reasons?: Map<string, string>;\n}\n\nexport interface ContextPack {\n text: string;\n tokenEstimate: number;\n filesUsed: string[];\n testsCoRetrieved: string[];\n truncated: boolean;\n}\n\nconst STATIC_OVERHEAD_PER_FILE = 200; // headers + bullet markdown + spacing\nconst MAX_INLINE_CHARS_PER_FILE = 2500;\n\nfunction indexSymbolsByFile(graph: GraphSchema): SymbolNode[] {\n return graph.nodes.filter((n): n is SymbolNode => n.kind === \"symbol\");\n}\n\nexport async function pack(files: FileNode[], opts: PackOptions): Promise<ContextPack> {\n const budgetTokens = opts.budgetTokens ?? 4000;\n const budgetChars = budgetTokens * 4;\n const inlineRatio = opts.inlineBodyRatio ?? 0.5;\n const includeTests = opts.includeTests ?? true;\n const reasons = opts.reasons ?? new Map<string, string>();\n\n const symbols = indexSymbolsByFile(opts.graph);\n\n const sections: FormatFileSection[] = [];\n const testsCoRetrieved: string[] = [];\n let used = 0;\n let truncated = false;\n\n for (const file of files) {\n const sig = extractSignatures(file, symbols);\n const testFiles = includeTests ? findTestsForFile(opts.graph, file) : [];\n const testPaths = testFiles.map((t) => t.path);\n\n const staticCost =\n file.path.length +\n sig.join(\"\\n\").length +\n testPaths.join(\",\").length +\n STATIC_OVERHEAD_PER_FILE;\n\n if (used + staticCost > budgetChars) {\n truncated = true;\n break;\n }\n\n const remaining = budgetChars - used - staticCost;\n const inlineBudget = Math.min(Math.floor(remaining * inlineRatio), MAX_INLINE_CHARS_PER_FILE);\n\n const inline = selectInlineBodies(file, symbols, opts.query, inlineBudget);\n\n sections.push({\n path: file.path,\n reason: reasons.get(file.path),\n signatures: sig,\n inlineBodies: inline.text,\n associatedTests: testPaths,\n });\n\n used += staticCost + inline.charsUsed;\n for (const t of testPaths) if (!testsCoRetrieved.includes(t)) testsCoRetrieved.push(t);\n\n if (used >= budgetChars) {\n truncated = true;\n break;\n }\n }\n\n if (sections.length < files.length) truncated = true;\n\n const text = formatPack({\n query: opts.query,\n files: sections,\n truncated,\n });\n const tokenEstimate = Math.ceil(text.length / 4);\n\n return {\n text,\n tokenEstimate,\n filesUsed: sections.map((s) => s.path),\n testsCoRetrieved,\n truncated,\n };\n}\n","// Finds a free port in the 8080–8099 range. Writes the chosen port to\n// .synthra-graph/mcp_port so PowerShell/Bash hook scripts can read it.\n// TODO: M2\n\nimport { createServer } from \"node:net\";\n\nexport const PORT_RANGE_START = 8080;\nexport const PORT_RANGE_END = 8099;\n\nexport async function findFreePort(\n start = PORT_RANGE_START,\n end = PORT_RANGE_END,\n): Promise<number> {\n for (let port = start; port <= end; port++) {\n if (await isFree(port)) return port;\n }\n throw new Error(`Synthra: no free port in ${start}-${end}`);\n}\n\nfunction isFree(port: number): Promise<boolean> {\n return new Promise((resolve) => {\n const s = createServer();\n s.once(\"error\", () => resolve(false));\n s.once(\"listening\", () => s.close(() => resolve(true)));\n s.listen(port, \"127.0.0.1\");\n });\n}\n","// Auto-reindex: keep the in-memory graph fresh while the server runs. When a\n// source file changes, re-run the incremental scan (only the changed file hits\n// tree-sitter; the rest reuse the content-hash parse cache) and atomically swap\n// the graph + symbolIndex the MCP tools read — so graph_read / blast_radius /\n// the dependency footer never serve stale bodies or signatures mid-session.\n\nimport { scanProject } from \"../cli/scan-command.js\";\nimport { readGraph, readSymbolIndex } from \"../graph/store.js\";\nimport { log } from \"../shared/logger.js\";\nimport type { SynthraPaths } from \"../shared/paths.js\";\nimport type { ServerContext } from \"./context.js\";\n\n/**\n * Re-run the incremental scan and atomically swap `ctx.graph` / `ctx.symbolIndex`.\n * Best-effort: a transient scan failure is logged and swallowed, never thrown,\n * so a bad rescan can't take the server down. Shared by the file-change\n * reindexer and the git branch-switch handler.\n */\nexport async function rescanAndSwap(\n ctx: ServerContext,\n paths: SynthraPaths,\n label: string,\n): Promise<void> {\n try {\n // skipBootstrap: a re-parse must not rewrite watched root files\n // (CLAUDE.md/.gitignore) — doing so from a file-change handler would feed\n // the watcher its own edits and loop forever. The project is already\n // bootstrapped at startup.\n await scanProject(paths.projectRoot, { silent: true, skipBootstrap: true });\n const [graph, symbolIndex] = await Promise.all([\n readGraph(paths.infoGraph),\n readSymbolIndex(paths.symbolIndex),\n ]);\n ctx.graph = graph;\n ctx.symbolIndex = symbolIndex;\n log.info(`reindexed (${label}) — ${graph.symbol_count} symbols, ${graph.edge_count} edges.`);\n } catch (err) {\n log.warn(`reindex failed (${label}): ${(err as Error).message}`);\n }\n}\n\nexport interface Reindexer {\n /** Note a change; runs a single rescan once changes settle (debounced). */\n schedule(): void;\n /** Cancel any pending rescan (call on server shutdown). */\n stop(): void;\n}\n\ntype RescanFn = (ctx: ServerContext, paths: SynthraPaths, label: string) => Promise<void>;\n\n/**\n * Debounced, non-overlapping reindex scheduler. A burst of file-change events\n * coalesces into one rescan; if more changes arrive while a rescan is in\n * flight, exactly one trailing rescan runs after it finishes. `rescan` is\n * injectable for tests.\n */\nexport function createReindexer(\n ctx: ServerContext,\n paths: SynthraPaths,\n opts: { debounceMs?: number; rescan?: RescanFn } = {},\n): Reindexer {\n const debounceMs = opts.debounceMs ?? 1000;\n const rescan = opts.rescan ?? rescanAndSwap;\n let timer: ReturnType<typeof setTimeout> | null = null;\n let running = false;\n let pending = false;\n\n async function run(): Promise<void> {\n if (running) {\n pending = true; // changes arrived mid-scan — run once more when done\n return;\n }\n running = true;\n try {\n await rescan(ctx, paths, \"edit\");\n } finally {\n running = false;\n if (pending) {\n pending = false;\n void run();\n }\n }\n }\n\n return {\n schedule() {\n if (timer) clearTimeout(timer);\n timer = setTimeout(() => {\n timer = null;\n void run();\n }, debounceMs);\n // Don't keep the process alive just for a pending reindex.\n timer.unref?.();\n },\n stop() {\n if (timer) {\n clearTimeout(timer);\n timer = null;\n }\n },\n };\n}\n","// GET /activity?since=<ms> — returns recent human-activity events.\n// Backed by the in-memory ActivityStore (file-watcher + git-watcher feed it).\n// MCP tool `recent_activity` is a thin wrapper.\n\nimport type { ActivityEvent } from \"../../activity/activity-log.js\";\nimport type { ServerContext } from \"../context.js\";\n\nexport interface ActivityResponse {\n events: ActivityEvent[];\n since: string;\n ring_size: number;\n}\n\nexport async function handleActivity(\n sinceMs: number | undefined,\n ctx: ServerContext,\n): Promise<ActivityResponse> {\n const events = ctx.activity.getEvents(sinceMs);\n return {\n events,\n since: new Date(sinceMs ?? Date.now()).toISOString(),\n ring_size: ctx.activity.size(),\n };\n}\n","// Thin git helpers for the session snapshot: commits since a timestamp and the\n// files changed in the latest commit. Best-effort — returns empty on no git /\n// not a repo, so the snapshot (and the resume digest built from it) degrades\n// gracefully. Mirrors the execFileAsync pattern in branches.ts / git-watcher.ts.\n\nimport { execFile } from \"node:child_process\";\nimport { promisify } from \"node:util\";\n\nimport type { SessionCommit } from \"./session.js\";\n\nconst execFileAsync = promisify(execFile);\n\nconst MAX_COMMITS = 5;\nconst FIELD = \"\\x1f\"; // unit separator — safe delimiter inside commit subjects\n\n/** Commits since `sinceIso`, newest first, capped at MAX_COMMITS. When `sinceIso`\n * is empty/invalid (first run), returns the most recent MAX_COMMITS as\n * orientation rather than dumping the entire history. */\nexport async function getCommitsSince(\n projectRoot: string,\n sinceIso: string,\n): Promise<SessionCommit[]> {\n const args = [\n \"log\",\n `--max-count=${MAX_COMMITS}`,\n \"--no-merges\",\n `--pretty=format:%h${FIELD}%s${FIELD}%aI`,\n ];\n if (Number.isFinite(Date.parse(sinceIso))) args.push(`--since=${sinceIso}`);\n\n try {\n const { stdout } = await execFileAsync(\"git\", args, { cwd: projectRoot });\n const out: SessionCommit[] = [];\n for (const line of stdout.split(\"\\n\")) {\n const t = line.trim();\n if (!t) continue;\n const [hash, message, date] = t.split(FIELD);\n if (hash && message) out.push({ hash, message, date: date ?? \"\" });\n }\n return out;\n } catch {\n return [];\n }\n}\n\n/** Files changed in the latest commit (name-only). Empty on no git / shallow. */\nexport async function getDiffFiles(projectRoot: string): Promise<string[]> {\n try {\n const { stdout } = await execFileAsync(\"git\", [\"diff\", \"--name-only\", \"HEAD~1..HEAD\"], {\n cwd: projectRoot,\n });\n return stdout\n .split(\"\\n\")\n .map((s) => s.trim())\n .filter(Boolean);\n } catch {\n return [];\n }\n}\n","// Per-session snapshot, captured at session end (Stop hook → /context-update)\n// and read by the SessionStart primer to build the \"Since you were last here\"\n// resume digest. Persisted to .synthra-graph/session.json (machine-local,\n// gitignored): it describes THIS machine's last session and is regenerated every\n// Stop, so there is no migration — a schema mismatch is simply treated as\n// \"no snapshot\" and the primer degrades to its legacy output.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nexport const SESSION_SCHEMA_VERSION = 1;\n\nexport interface SessionCommit {\n hash: string;\n message: string;\n date: string;\n}\n\nexport interface SessionSummary {\n tasks: string[];\n decisions: string[];\n next: string[];\n}\n\nexport interface SessionState {\n schema_version: number;\n endedAt: string;\n branch: string;\n filesTouched: string[];\n recentCommits: SessionCommit[];\n summary: SessionSummary;\n}\n\nexport async function readSession(path: string): Promise<SessionState | null> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<SessionState>;\n if (parsed.schema_version !== SESSION_SCHEMA_VERSION) return null;\n return parsed as SessionState;\n } catch {\n return null;\n }\n}\n\nexport async function writeSession(path: string, state: SessionState): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, JSON.stringify(state, null, 2) + \"\\n\", \"utf8\");\n}\n","// POST /context-update — Stop hook calls this at session end.\n// 1. Re-renders CONTEXT.md from the branch-scoped store so the narrative stays\n// in sync with the structured entries that landed during the session.\n// 2. Captures a session snapshot (git diff since last session + files touched +\n// open decisions/next-steps) to .synthra-graph/session.json, which the next\n// SessionStart primer reads to build a \"Since you were last here\" digest.\n// Transcript-mining for new entries (auto \"we decided X\" → store) is deferred.\n\nimport { getCommitsSince } from \"../../memory/git-snapshot.js\";\nimport { recallEntries, refreshContextMd, resolveActiveBranch } from \"../../memory/index.js\";\nimport {\n readSession,\n writeSession,\n SESSION_SCHEMA_VERSION,\n type SessionState,\n} from \"../../memory/session.js\";\nimport type { ServerContext } from \"../context.js\";\nimport { getRegisteredEdits } from \"../mcp.js\";\n\nexport interface ContextUpdateRequest {\n transcript_path?: string;\n branch?: string;\n}\n\nexport interface ContextUpdateResponse {\n updated: boolean;\n branch: string;\n path: string;\n entries: number;\n}\n\n// Window for \"files the human touched this session\" harvested from the activity\n// ring at Stop. Generous — a session can be long, and the ring is bounded anyway.\nconst TOUCHED_WINDOW_MS = 24 * 60 * 60 * 1000;\n\nasync function captureSnapshot(ctx: ServerContext, branchOverride?: string): Promise<void> {\n const active = await resolveActiveBranch(ctx.paths, branchOverride);\n\n const [tasks, decisions, next] = await Promise.all([\n recallEntries(ctx.paths, { kind: \"task\", branch: active.branch, limit: 1 }),\n recallEntries(ctx.paths, { kind: \"decision\", branch: active.branch, limit: 3 }),\n recallEntries(ctx.paths, { kind: \"next\", branch: active.branch, limit: 3 }),\n ]);\n\n // Files touched this session: AI-registered edits ∪ recent human saves.\n const touched = new Set<string>(getRegisteredEdits());\n for (const p of ctx.activity.recentFilePaths(TOUCHED_WINDOW_MS)) touched.add(p);\n\n // Commits since the previous snapshot (or the most recent few on first run).\n const prev = await readSession(ctx.paths.sessionState);\n const recentCommits = await getCommitsSince(ctx.paths.projectRoot, prev?.endedAt ?? \"\");\n\n const snapshot: SessionState = {\n schema_version: SESSION_SCHEMA_VERSION,\n endedAt: new Date().toISOString(),\n branch: active.branch,\n filesTouched: Array.from(touched),\n recentCommits,\n summary: {\n tasks: tasks.entries.map((e) => e.content),\n decisions: decisions.entries.map((e) => e.content),\n next: next.entries.map((e) => e.content),\n },\n };\n await writeSession(ctx.paths.sessionState, snapshot);\n}\n\nexport async function handleContextUpdate(\n req: ContextUpdateRequest,\n ctx: ServerContext,\n): Promise<ContextUpdateResponse> {\n const r = await refreshContextMd(ctx.paths, req?.branch);\n\n // Best-effort: a snapshot failure (no git, unwritable disk) must never break\n // the CONTEXT.md refresh that downstream tooling relies on.\n try {\n await captureSnapshot(ctx, req?.branch);\n } catch {\n // ignore — the resume digest just falls back to the legacy primer next time.\n }\n\n return {\n updated: true,\n branch: r.branch,\n path: r.path,\n entries: r.entriesSeen,\n };\n}\n","// POST /gate — PreToolUse hook calls this with the tool name + arguments.\n// THE MOAT — improvement #1. Strategy:\n// - For Grep/Glob: extract the search pattern, run retrieve().\n// - If recent human activity touches a file matching the query → ALLOW\n// even at high confidence (the user's head is in that file; static\n// context may be stale).\n// - If confidence === \"high\" and no recent overlap → BLOCK. The deny reason\n// carries the answer: exact file::symbol graph_read targets + one-line\n// signatures, so the agent never needs the whole-file Read fallback.\n// - Otherwise → ALLOW.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { retrieve } from \"../../graph/retrieve.js\";\nimport type { RetrievalResult } from \"../../graph/retrieve.js\";\nimport { tokenizeQuery } from \"../../graph/rank.js\";\nimport type { GraphSchema, SymbolNode } from \"../../graph/types.js\";\nimport { loadConfig } from \"../../shared/config.js\";\nimport type { ServerContext } from \"../context.js\";\nimport { observeBash } from \"./bash-observe.js\";\nimport { looksLikeNonSymbolQuery } from \"./query-heuristics.js\";\n\n// Re-exported for callers that imported it from here before it moved.\nexport { looksLikeNonSymbolQuery };\n\nexport interface GateRequest {\n tool_name: string;\n tool_input: Record<string, unknown>;\n}\n\nexport interface GateResponse {\n decision: \"allow\" | \"block\";\n reason?: string;\n}\n\nconst BLOCKABLE_TOOLS = new Set([\"Grep\", \"Glob\"]);\nconst RECENT_ACTIVITY_WINDOW_MS = 5 * 60 * 1000;\n\nfunction extractQuery(toolName: string, input: Record<string, unknown>): string | null {\n if (toolName === \"Grep\") {\n const pattern = typeof input.pattern === \"string\" ? input.pattern : \"\";\n const query = typeof input.query === \"string\" ? input.query : \"\";\n return (pattern || query).trim() || null;\n }\n if (toolName === \"Glob\") {\n const pattern = typeof input.pattern === \"string\" ? input.pattern : \"\";\n return pattern.replace(/[*?/\\\\.]+/g, \" \").trim() || null;\n }\n return null;\n}\n\n// A recently-touched file \"matches\" the query if a query token appears in its\n// PATH or in its graph-node KEYWORDS (file contents). The content-keyword check\n// (#3) means a recent save of e.g. auth.ts relaxes `Grep \"login\"` when auth.ts\n// contains login — not only when the path itself contains the token.\nfunction recentlyTouchedMatchesQuery(\n recentPaths: string[],\n queryTokens: Set<string>,\n graph: GraphSchema,\n): string[] {\n if (recentPaths.length === 0) return [];\n\n // Pull keywords for the recently-touched files in a single graph pass.\n const recent = new Set(recentPaths);\n const keywordsByPath = new Map<string, string[]>();\n for (const n of graph.nodes) {\n if (n.kind === \"file\" && recent.has(n.path)) keywordsByPath.set(n.path, n.keywords);\n }\n\n const matches: string[] = [];\n for (const path of recentPaths) {\n const lower = path.toLowerCase();\n let matched = false;\n for (const t of queryTokens) {\n if (lower.includes(t)) {\n matched = true;\n break;\n }\n }\n if (!matched) {\n for (const kw of keywordsByPath.get(path) ?? []) {\n if (queryTokens.has(kw)) {\n matched = true;\n break;\n }\n }\n }\n if (matched) matches.push(path);\n }\n return matches;\n}\n\n// Block hints can run to ~1200 chars; the log (and the dashboard /data payload\n// built from it) only needs enough to identify the decision, so the stored\n// reason is truncated and the full hint size is kept as a separate count.\nconst LOG_REASON_MAX_CHARS = 240;\n\nasync function logDecision(\n ctx: ServerContext,\n toolName: string,\n query: string | null,\n decision: \"allow\" | \"block\",\n reason: string | undefined,\n hintChars?: number,\n): Promise<void> {\n try {\n await mkdir(dirname(ctx.paths.gateLog), { recursive: true });\n const entry = {\n ts: new Date().toISOString(),\n tool: toolName,\n decision,\n query,\n reason:\n reason && reason.length > LOG_REASON_MAX_CHARS\n ? `${reason.slice(0, LOG_REASON_MAX_CHARS)}…`\n : reason,\n ...(hintChars === undefined ? {} : { hint_chars: hintChars }),\n };\n await appendFile(ctx.paths.gateLog, JSON.stringify(entry) + \"\\n\", \"utf8\");\n } catch {\n // Durability is best-effort; an unwritable disk shouldn't fail the gate.\n }\n}\n\nconst SIG_LINE_MAX_CHARS = 140;\n\n// How relevant is a symbol name to the query? Mirrors the packer's inline\n// scoring: exact token match dominates, substring containment is a weak hit.\nfunction scoreSymbolName(name: string, qTokens: string[]): number {\n const lower = name.toLowerCase();\n let score = 0;\n for (const t of qTokens) {\n if (t === lower) score += 3;\n else if (t.length >= 3 && lower.includes(t)) score += 1;\n }\n return score;\n}\n\n/**\n * Render the deny reason for a block. Instead of bare file paths (which sent\n * agents into whole-file Read fallbacks — see the dogfood log), the hint\n * delivers copy-pasteable namespaced graph_read targets plus one-line\n * signatures for the query's best symbols. Signatures only, no bodies: the\n * hint lands in the transcript on every block, so its own size is a cost.\n */\nexport function buildBlockHint(\n query: string,\n retrieval: RetrievalResult,\n graph: GraphSchema,\n toolName: string,\n maxChars = loadConfig().gateHintMaxChars,\n): string {\n const topFiles = retrieval.files.slice(0, 3);\n const topPaths = new Set(topFiles.map((f) => f.path));\n\n const symsByFile = new Map<string, SymbolNode[]>();\n for (const n of graph.nodes) {\n if (n.kind !== \"symbol\" || !topPaths.has(n.file)) continue;\n const list = symsByFile.get(n.file);\n if (list) list.push(n);\n else symsByFile.set(n.file, [n]);\n }\n\n const qTokens = tokenizeQuery(query);\n const entries: string[] = [];\n for (const f of topFiles) {\n const syms = (symsByFile.get(f.path) ?? []).slice().sort((a, b) => a.start_line - b.start_line);\n if (syms.length === 0) {\n // Content-indexed only (no symbols) — still point at the slice tool.\n entries.push(`• mcp__synthra__graph_read(\"${f.path}\")`);\n continue;\n }\n const scored = syms\n .map((s) => ({ s, score: scoreSymbolName(s.name, qTokens) }))\n .filter((x) => x.score > 0)\n .sort((a, b) => b.score - a.score);\n // Best 1–2 query-relevant symbols; when nothing scores, the file's first\n // symbol still gives the agent a foothold into the file.\n const picks = scored.length > 0 ? scored.slice(0, 2).map((x) => x.s) : syms.slice(0, 1);\n for (const s of picks) {\n const sig = `L${s.start_line}: ${s.signature.trim()}`;\n const sigLine =\n sig.length > SIG_LINE_MAX_CHARS ? `${sig.slice(0, SIG_LINE_MAX_CHARS - 1)}…` : sig;\n entries.push(`• mcp__synthra__graph_read(\"${f.path}::${s.name}\")\\n ${sigLine}`);\n }\n }\n\n const header =\n `Synthra blocked this ${toolName} — ${retrieval.confidence}-confidence context for \"${query}\" already exists.\\n` +\n `Read symbols directly (~50 tokens each) instead of whole files:\\n`;\n const footer = `\\nFull pack: mcp__synthra__graph_continue(\"${query}\")`;\n\n const parts: string[] = [];\n let used = header.length + footer.length + 1;\n for (const e of entries) {\n if (used + e.length + 1 > maxChars) break; // drop whole entries, never mid-entry\n parts.push(e);\n used += e.length + 1;\n }\n\n if (parts.length === 0) {\n // Degenerate budget — fall back to the legacy path list, namespaced.\n const top = topFiles.map((f) => f.path).join(\", \");\n return (\n `Synthra has ${retrieval.confidence}-confidence context for \"${query}\" (top files: ${top}). ` +\n `Use mcp__synthra__graph_continue(\"${query}\") instead of ${toolName}, ` +\n `or read a specific file/symbol with mcp__synthra__graph_read.`\n );\n }\n\n return `${header}\\n${parts.join(\"\\n\")}\\n${footer}`;\n}\n\nexport async function handleGate(req: GateRequest, ctx: ServerContext): Promise<GateResponse> {\n if (!req?.tool_name || typeof req.tool_name !== \"string\") {\n return { decision: \"allow\", reason: \"no tool_name\" };\n }\n\n // Bash is OBSERVE-ONLY: record codebase-exploration commands (rg/cat/find …)\n // so the terminal bypass of the Moat can be measured, but never block them.\n if (req.tool_name === \"Bash\") {\n const input = (\n req.tool_input && typeof req.tool_input === \"object\" ? req.tool_input : {}\n ) as Record<string, unknown>;\n await observeBash(input, ctx);\n return { decision: \"allow\" };\n }\n\n if (!BLOCKABLE_TOOLS.has(req.tool_name)) {\n return { decision: \"allow\" };\n }\n\n const input = (\n req.tool_input && typeof req.tool_input === \"object\" ? req.tool_input : {}\n ) as Record<string, unknown>;\n const query = extractQuery(req.tool_name, input);\n if (!query) {\n const res: GateResponse = { decision: \"allow\", reason: \"no extractable query\" };\n await logDecision(ctx, req.tool_name, null, res.decision, res.reason);\n return res;\n }\n\n // Guard 1 — the query targets markup/CSS/attributes/literals, which the graph\n // does not index. Blocking would only force a fallback, so let Grep through.\n if (req.tool_name === \"Grep\" && looksLikeNonSymbolQuery(query)) {\n const res: GateResponse = {\n decision: \"allow\",\n reason: `\"${query}\" targets markup/CSS/attributes, not code symbols — letting Grep through (the graph indexes symbols).`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n const retrieval = await retrieve(ctx.graph, query);\n // \"low\" = no real matches → let Grep through; Synthra has nothing useful.\n // \"medium\" + \"high\" = Synthra has structured context for this query →\n // bias toward blocking. The pitch (\"use graph_continue instead of Grep\")\n // holds at medium too — on real codebases of any size, \"high\" is rare\n // because almost every query matches multiple files.\n if (retrieval.confidence === \"low\") {\n const res: GateResponse = {\n decision: \"allow\",\n reason: `confidence=low — no graph context for \"${query}\", letting ${req.tool_name} through`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n // Medium / high — but check if recent activity overlaps the query first.\n // If the user just touched a file matching the query, static context may\n // be stale and they probably want a fresh search.\n const qTokens = new Set(tokenizeQuery(query));\n const recentPaths = ctx.activity.recentFilePaths(RECENT_ACTIVITY_WINDOW_MS);\n const overlap = recentlyTouchedMatchesQuery(recentPaths, qTokens, ctx.graph);\n\n if (overlap.length > 0) {\n const res: GateResponse = {\n decision: \"allow\",\n reason:\n `confidence=${retrieval.confidence} but human just touched ${overlap.slice(0, 3).join(\", \")} — ` +\n `static context may be stale, letting ${req.tool_name} through.`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n // Guard 2 — the graph matched files only by keyword/path, not by a symbol the\n // query names, so graph_read can't return a real slice. A block would just\n // force a fallback Read; let the search through instead.\n if (!retrieval.symbolMatched) {\n const res: GateResponse = {\n decision: \"allow\",\n reason:\n `confidence=${retrieval.confidence} but only keyword/path matched (no symbol the query names) — ` +\n `graph_read can't slice it, letting ${req.tool_name} through.`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n const hint = buildBlockHint(query, retrieval, ctx.graph, req.tool_name);\n const res: GateResponse = { decision: \"block\", reason: hint };\n await logDecision(ctx, req.tool_name, query, res.decision, hint, hint.length);\n return res;\n}\n","// Bash exploration observer — OBSERVE-ONLY. The Moat blocks Grep/Glob, but the\n// agent can still walk the codebase through the terminal (`rg foo src/`,\n// `cat src/x.ts`, `find . -name …`), and every such call is a read the graph\n// could have served in ~50 tokens. This module classifies those commands and\n// logs them (with whether the graph COULD have answered) so the leak can be\n// measured before deciding whether to block it. It NEVER blocks anything.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { retrieve } from \"../../graph/retrieve.js\";\nimport { loadConfig } from \"../../shared/config.js\";\nimport type { ServerContext } from \"../context.js\";\nimport { looksLikeNonSymbolQuery } from \"./query-heuristics.js\";\n\nexport type BashExploreKind = \"search\" | \"read\" | \"list\";\n\nexport interface BashExploration {\n /** search = grep/rg over the tree · read = cat/head of a source file · list = find/tree */\n kind: BashExploreKind;\n /** the underlying tool, e.g. \"rg\", \"grep\", \"cat\", \"find\" */\n tool: string;\n /** the search pattern (search) or the file/dir target (read/list) */\n query: string | null;\n}\n\ntype Confidence = \"low\" | \"medium\" | \"high\";\n\n// Read-only exploration tools. Allowlist, not denylist — anything not here\n// (npm/git/node/tsc/make/docker/mkdir/rm/echo/curl…) is left alone.\nconst SEARCH_TOOLS = new Set([\"grep\", \"egrep\", \"fgrep\", \"rg\", \"ripgrep\", \"ag\", \"ack\"]);\nconst READ_TOOLS = new Set([\"cat\", \"head\", \"tail\", \"less\", \"more\", \"bat\", \"tac\"]);\nconst LIST_TOOLS = new Set([\"find\", \"tree\"]);\n\n// File extensions Synthra parses or content-indexes — a `cat` of one of these is\n// a whole-file read the graph could slice.\nconst SOURCE_EXT =\n /\\.(ts|tsx|js|jsx|cts|mts|cjs|mjs|py|pyi|svelte|vue|go|rs|java|kt|kts|php|rb|c|h|cpp|cc|cxx|hpp|cs|dart|json|md|css|html|hubl|sh|yml|yaml|toml)$/i;\n\n/**\n * Quote-aware shell tokenizer. Splits on whitespace and the operators\n * `| || && ;`, but treats quoted runs as a single token so an operator inside a\n * pattern (`rg \"foo|bar\"`) is preserved rather than split. Quote characters are\n * dropped; their contents are kept.\n */\nexport function tokenizeCommand(cmd: string): string[] {\n const tokens: string[] = [];\n let cur = \"\";\n let quote: '\"' | \"'\" | null = null;\n let hasContent = false;\n const flush = () => {\n if (hasContent) tokens.push(cur);\n cur = \"\";\n hasContent = false;\n };\n for (let i = 0; i < cmd.length; i++) {\n const ch = cmd[i] as string;\n if (quote) {\n if (ch === quote) quote = null;\n else cur += ch;\n hasContent = true;\n continue;\n }\n if (ch === '\"' || ch === \"'\") {\n quote = ch;\n hasContent = true; // an empty quoted string is still a token\n continue;\n }\n if (ch === \"|\" || ch === \"&\" || ch === \";\") {\n flush();\n let op = ch;\n if ((ch === \"|\" || ch === \"&\") && cmd[i + 1] === ch) {\n op += ch;\n i++;\n }\n tokens.push(op);\n continue;\n }\n if (/\\s/.test(ch)) {\n flush();\n continue;\n }\n cur += ch;\n hasContent = true;\n }\n flush();\n return tokens;\n}\n\nfunction isOperator(t: string): boolean {\n return t === \"|\" || t === \"||\" || t === \"&&\" || t === \";\";\n}\n\nfunction splitSegments(tokens: string[]): string[][] {\n const segs: string[][] = [];\n let cur: string[] = [];\n for (const t of tokens) {\n if (isOperator(t)) {\n if (cur.length) segs.push(cur);\n cur = [];\n } else {\n cur.push(t);\n }\n }\n if (cur.length) segs.push(cur);\n return segs;\n}\n\n// Drop a leading `env` and any `VAR=value` assignment prefixes so the real\n// command surfaces.\nfunction commandTokens(seg: string[]): string[] {\n let i = 0;\n while (i < seg.length) {\n const t = seg[i] as string;\n if (t === \"env\") {\n i++;\n continue;\n }\n if (/^[A-Za-z_][A-Za-z0-9_]*=/.test(t)) {\n i++;\n continue;\n }\n break;\n }\n return seg.slice(i);\n}\n\nfunction baseCmd(tok: string): string {\n return (tok.split(/[\\\\/]/).pop() ?? tok).toLowerCase();\n}\n\nfunction classifySegment(seg: string[]): BashExploration | null {\n const toks = commandTokens(seg);\n if (toks.length === 0) return null;\n const cmd = baseCmd(toks[0] as string);\n const rest = toks.slice(1);\n const flags = rest.filter((a) => a.startsWith(\"-\"));\n const nonFlags = rest.filter((a) => !a.startsWith(\"-\"));\n\n if (SEARCH_TOOLS.has(cmd)) {\n const pattern = nonFlags[0];\n if (!pattern) return null; // no pattern → not a meaningful search\n const recursive = flags.some(\n (f) => f === \"-r\" || f === \"-R\" || f === \"--recursive\" || /^-[a-zA-Z]*[rR]$/.test(f),\n );\n const rgLike = cmd === \"rg\" || cmd === \"ripgrep\" || cmd === \"ag\" || cmd === \"ack\";\n const hasPathArg = nonFlags.length > 1;\n // grep/egrep/fgrep with no path reads stdin — that's filtering another\n // command's output, not searching the codebase. rg/ag default to a recursive\n // cwd search, so they count even without an explicit path.\n if (!rgLike && !recursive && !hasPathArg) return null;\n return { kind: \"search\", tool: cmd, query: pattern };\n }\n\n if (READ_TOOLS.has(cmd)) {\n const file = nonFlags.find((a) => SOURCE_EXT.test(a));\n if (!file) return null; // reading stdin or a non-source file\n return { kind: \"read\", tool: cmd, query: file };\n }\n\n if (LIST_TOOLS.has(cmd)) {\n const nameIdx = rest.findIndex((a) => a === \"-name\" || a === \"-iname\" || a === \"-path\");\n const target = nameIdx >= 0 ? (rest[nameIdx + 1] ?? null) : (nonFlags[0] ?? \".\");\n return { kind: \"list\", tool: cmd, query: target };\n }\n\n return null;\n}\n\n/**\n * Classify a Bash command as codebase exploration, or null if it isn't one we\n * recognize. Conservative: a write/redirect anywhere voids the whole command\n * (it's no longer a pure read), and only the allowlisted tools match.\n */\nexport function classifyBashCommand(command: string): BashExploration | null {\n if (!command || typeof command !== \"string\") return null;\n const tokens = tokenizeCommand(command);\n if (tokens.length === 0) return null;\n // Any redirect → there's a side effect; not pure read-only exploration.\n if (tokens.some((t) => !isOperator(t) && t.includes(\">\"))) return null;\n\n const found = splitSegments(tokens)\n .map(classifySegment)\n .filter((x): x is BashExploration => x !== null);\n if (found.length === 0) return null;\n\n // Prefer a real symbol search over a file read over a directory listing.\n const prio: Record<BashExploreKind, number> = { search: 0, read: 1, list: 2 };\n found.sort((a, b) => prio[a.kind] - prio[b.kind]);\n return found[0] as BashExploration;\n}\n\nfunction graphHasFile(ctx: ServerContext, target: string): boolean {\n const base = target.split(/[\\\\/]/).pop() ?? target;\n for (const n of ctx.graph.nodes) {\n if (n.kind !== \"file\") continue;\n if (n.path === target || n.path.endsWith(`/${target}`) || n.path.split(\"/\").pop() === base) {\n return true;\n }\n }\n return false;\n}\n\nconst Q_MAX = 200;\nconst CMD_MAX = 300;\nconst trunc = (s: string, max: number) => (s.length > max ? `${s.slice(0, max)}…` : s);\n\nasync function logObservation(\n ctx: ServerContext,\n exp: BashExploration,\n confidence: Confidence | null,\n avoidable: boolean,\n command: string,\n): Promise<void> {\n try {\n await mkdir(dirname(ctx.paths.bashLog), { recursive: true });\n const entry = {\n ts: new Date().toISOString(),\n kind: exp.kind,\n tool: exp.tool,\n query: exp.query ? trunc(exp.query, Q_MAX) : null,\n confidence,\n avoidable,\n command: trunc(command, CMD_MAX),\n };\n await appendFile(ctx.paths.bashLog, JSON.stringify(entry) + \"\\n\", \"utf8\");\n } catch {\n // Best-effort — an unwritable disk must never affect the Bash call.\n }\n}\n\n/**\n * Observe a Bash tool call: if it's codebase exploration, record it (and whether\n * the graph could have answered) to bash_log.jsonl. NEVER returns a decision —\n * the caller always allows the command through. Opt out with SYN_NO_BASH_OBSERVE.\n */\nexport async function observeBash(\n input: Record<string, unknown>,\n ctx: ServerContext,\n): Promise<void> {\n if (!loadConfig().bashObserve) return;\n const command = typeof input.command === \"string\" ? input.command : \"\";\n const exp = classifyBashCommand(command);\n if (!exp) return;\n\n let confidence: Confidence | null = null;\n let avoidable = false;\n\n if (exp.kind === \"search\" && exp.query) {\n // Mirror the Moat's would-block test so \"avoidable\" predicts a real block:\n // the graph is confident AND a symbol the query names actually matched.\n if (!looksLikeNonSymbolQuery(exp.query)) {\n const r = await retrieve(ctx.graph, exp.query);\n confidence = r.confidence;\n avoidable = r.confidence !== \"low\" && r.symbolMatched;\n }\n } else if (exp.kind === \"read\" && exp.query) {\n // A cat/head of a file the graph knows → graph_read could have sliced it.\n avoidable = graphHasFile(ctx, exp.query);\n }\n\n await logObservation(ctx, exp, confidence, avoidable, command);\n}\n","// Shared query heuristics for the PreToolUse decision point. Used by both the\n// Moat gate (Grep/Glob blocking) and the Bash observer — kept in its own module\n// so neither has to import the other.\n\n// Heuristic: does this search pattern target markup / CSS / attributes / literals\n// rather than a code symbol? The graph only indexes symbols, so blocking these\n// and redirecting to graph_read just forces a fallback Read. Conservative — only\n// fires on syntax that never appears in a bare identifier search.\nexport function looksLikeNonSymbolQuery(pattern: string): boolean {\n // HTML / JSX tag: \"<div\", \"</\", \"<svg\"\n if (/<\\/?[a-zA-Z]/.test(pattern)) return true;\n // Hyphenated attribute assignment: \"data-tour=\", \"aria-label=\" ('-' is not a\n // valid identifier char, so this is markup, not a symbol).\n if (/[a-zA-Z][\\w-]*-[\\w-]*\\s*=/.test(pattern)) return true;\n // CSS rule / object brace: \".content{\", \"{ color\"\n if (/\\{/.test(pattern)) return true;\n // Escaped-dot class / member selector: \"\\.filter-bar\", \"\\.gs\"\n if (/\\\\\\.[a-zA-Z]/.test(pattern)) return true;\n // CSS property value or units: \": 100%\", \"12px\", \"1.5rem\", \"50%\"\n if (/:\\s*\\d/.test(pattern) || /\\d(?:px|rem|em|vh|vw)\\b/.test(pattern) || /\\d%/.test(pattern)) {\n return true;\n }\n // CSS custom property: \"var(--brand)\", \"--sidebar\" — a \"--\" prefix is never a\n // valid code identifier, so this is styling the graph doesn't index.\n if (/--[a-zA-Z]/.test(pattern)) return true;\n // Hex color literal: \"#fff\", \"#0a0a0a\".\n if (/#[0-9a-fA-F]{3,8}\\b/.test(pattern)) return true;\n // Kebab-case search (\"cw-code-chip\", \"data-tour\") — hyphens aren't valid in\n // JS/TS/Python identifiers, so it's a CSS class / HTML attribute / custom\n // element. Only treat it as non-symbol when EVERY alternation branch is kebab,\n // so a mixed query like \"fetchWith429Retry|Retry-After\" (real symbol + a\n // hyphenated header) still blocks. Strip regex char-classes first so a range\n // like \"[a-z]\" isn't mistaken for a kebab token.\n const branches = pattern\n .replace(/\\[[^\\]]*\\]/g, \"\")\n .split(\"|\")\n .map((b) => b.trim())\n .filter(Boolean);\n const isKebab = (b: string) => /^[a-z][a-z0-9]*(?:-[a-z0-9]+)+$/i.test(b);\n if (branches.length > 0 && branches.every(isKebab)) return true;\n return false;\n}\n","// POST /log — Stop hook posts per-turn token usage parsed from Claude's\n// transcript JSONL. Synthra appends each entry as one line to token_log.jsonl.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport type { ServerContext } from \"../context.js\";\n\nexport interface LogEntry {\n input_tokens: number;\n output_tokens: number;\n cache_creation_input_tokens?: number;\n cache_read_input_tokens?: number;\n model: string;\n description?: string;\n project: string;\n}\n\nexport interface LogResponse {\n ok: true;\n written_at: string;\n}\n\nexport async function handleLog(entry: LogEntry, ctx: ServerContext): Promise<LogResponse> {\n if (!entry || typeof entry.input_tokens !== \"number\" || typeof entry.output_tokens !== \"number\") {\n throw new Error(\"log: input_tokens and output_tokens (number) are required\");\n }\n\n const written_at = new Date().toISOString();\n const record = { ...entry, written_at };\n await mkdir(dirname(ctx.paths.tokenLog), { recursive: true });\n await appendFile(ctx.paths.tokenLog, JSON.stringify(record) + \"\\n\", \"utf8\");\n\n return { ok: true, written_at };\n}\n","// POST /pack { query, maxTokens? } → ContextPack JSON.\n// Runs retrieve → pack against the in-memory graph.\n\nimport { retrieve } from \"../../graph/retrieve.js\";\nimport { scoreFiles } from \"../../graph/rank.js\";\nimport { pack, type ContextPack } from \"../../packer/index.js\";\nimport type { ServerContext } from \"../context.js\";\n\nexport interface PackRequest {\n query: string;\n maxTokens?: number;\n includeTests?: boolean;\n}\n\nexport interface PackResponse extends ContextPack {\n query: string;\n confidence: \"high\" | \"medium\" | \"low\";\n retrievalReason: string;\n}\n\nexport async function handlePack(req: PackRequest, ctx: ServerContext): Promise<PackResponse> {\n if (!req?.query || typeof req.query !== \"string\") {\n throw new Error(\"pack: 'query' (string) is required\");\n }\n\n const recentlyEditedPaths = ctx.activity.recentFilePaths(15 * 60 * 1000);\n const usageScores = ctx.learn?.effectiveScores();\n const retrieval = await retrieve(ctx.graph, req.query, { recentlyEditedPaths, usageScores });\n\n // Surface per-file scoring rationale in the rendered pack.\n const allFiles = ctx.graph.nodes.filter((n) => n.kind === \"file\");\n const scored = scoreFiles({\n candidates: allFiles as Parameters<typeof scoreFiles>[0][\"candidates\"],\n query: req.query,\n graph: ctx.graph,\n recentlyEditedPaths,\n usageScores,\n });\n const reasons = new Map<string, string>();\n for (const s of scored) {\n if (s.reasons.length) reasons.set(s.file.path, s.reasons.join(\",\"));\n }\n\n const result = await pack(retrieval.files, {\n query: req.query,\n graph: ctx.graph,\n budgetTokens: req.maxTokens,\n includeTests: req.includeTests,\n reasons,\n });\n\n return {\n ...result,\n query: req.query,\n confidence: retrieval.confidence,\n retrievalReason: retrieval.reason,\n };\n}\n","// GET /prime — SessionStart and PreCompact hooks call this. Returns the priming\n// text Claude sees at session start.\n//\n// When the previous session left a snapshot (.synthra-graph/session.json), the\n// primer leads with a budget-bounded \"Since you were last here\" digest — recent\n// commits, files touched, open next-steps, recent decisions — so a fresh session\n// arrives oriented instead of re-paying tokens to rediscover recent work. With\n// no snapshot (first session, or none survived), it falls back to the legacy\n// graph-counts primer verbatim.\n\nimport { currentBranch } from \"../../memory/branches.js\";\nimport { readSession, type SessionState } from \"../../memory/session.js\";\nimport type { ServerContext } from \"../context.js\";\n\nexport interface PrimeResponse {\n primer: string;\n port: number;\n}\n\n// ~680 tokens. The digest rides the SessionStart primer channel, separate from\n// the graph pack's own ~4000-token budget — they don't compete.\nconst RESUME_PRIMER_MAX_CHARS = 2720;\n\nconst MAX_FILES = 15;\nconst MAX_COMMITS = 5;\nconst MAX_BULLETS = 3;\n\nfunction legacyPrimer(ctx: ServerContext): string {\n const g = ctx.graph;\n return (\n `Synthra context loaded for ${g.root}.\\n` +\n `${g.file_count} files indexed, ${g.symbol_count} symbols. ` +\n `Prefer the graph_* MCP tools over Grep/Glob for navigation.`\n );\n}\n\nfunction hasContent(snap: SessionState): boolean {\n return Boolean(\n snap.recentCommits.length ||\n snap.filesTouched.length ||\n snap.summary.tasks.length ||\n snap.summary.next.length ||\n snap.summary.decisions.length,\n );\n}\n\nfunction buildResumeDigest(snap: SessionState, branchNow: string): string {\n const plural = (n: number) => (n === 1 ? \"\" : \"s\");\n const head =\n `## Since you were last here — ${snap.branch} ` +\n `(${snap.recentCommits.length} commit${plural(snap.recentCommits.length)}, ` +\n `${snap.filesTouched.length} file${plural(snap.filesTouched.length)} touched)`;\n\n // Essential, high-signal block — never dropped under the budget.\n const essential: string[] = [head];\n if (snap.branch !== branchNow) {\n essential.push(\"\");\n essential.push(\n `_(snapshot was for branch '${snap.branch}'; you're now on '${branchNow}' — may be stale)_`,\n );\n }\n if (snap.summary.tasks[0]) {\n essential.push(\"\", \"### In progress\", `- ${snap.summary.tasks[0]}`);\n }\n if (snap.summary.next.length) {\n essential.push(\"\", \"### Open next steps\");\n for (const n of snap.summary.next.slice(0, MAX_BULLETS)) essential.push(`- ${n}`);\n }\n if (snap.summary.decisions.length) {\n essential.push(\"\", \"### Recent decisions\");\n for (const d of snap.summary.decisions.slice(0, MAX_BULLETS)) essential.push(`- ${d}`);\n }\n\n // Supporting context — appended only while budget remains, so commits/files\n // are what get dropped first if we're over the cap.\n const extra: string[] = [];\n if (snap.recentCommits.length) {\n extra.push(\"\", \"### Recent commits\");\n for (const c of snap.recentCommits.slice(0, MAX_COMMITS)) {\n const date = c.date ? ` (${c.date.slice(0, 10)})` : \"\";\n extra.push(`- \\`${c.hash}\\` ${c.message}${date}`);\n }\n }\n if (snap.filesTouched.length) {\n const shown = snap.filesTouched.slice(0, MAX_FILES);\n const more = snap.filesTouched.length - shown.length;\n extra.push(\"\", \"### Files touched\", shown.join(\", \") + (more > 0 ? `, +${more} more` : \"\"));\n }\n\n let out = essential.join(\"\\n\");\n for (const line of extra) {\n if ((out + \"\\n\" + line).length > RESUME_PRIMER_MAX_CHARS) break;\n out += \"\\n\" + line;\n }\n return (\n out.length > RESUME_PRIMER_MAX_CHARS ? out.slice(0, RESUME_PRIMER_MAX_CHARS) : out\n ).trimEnd();\n}\n\nexport async function handlePrime(ctx: ServerContext, port: number): Promise<PrimeResponse> {\n const legacy = legacyPrimer(ctx);\n\n const snap = await readSession(ctx.paths.sessionState);\n if (!snap || !hasContent(snap)) {\n return { primer: legacy, port };\n }\n\n const branchNow = await currentBranch(ctx.paths.projectRoot);\n const digest = buildResumeDigest(snap, branchNow);\n return { primer: `${digest}\\n\\n---\\n\\n${legacy}`, port };\n}\n"],"mappings":";AAIA,SAAS,aAAa;AACtB,SAAS,YAAY;AACrB,SAAS,aAAAA,kBAAiB;;;ACC1B,SAAS,YAAY,aAAa;AAClC,SAAS,eAAe;AAgBxB,IAAM,oBAAoB;AAEnB,IAAM,gBAAN,MAAoB;AAAA,EACjB,OAAwB,CAAC;AAAA,EAChB;AAAA,EACA;AAAA,EAEjB,YAAY,aAAqB,cAAc,mBAAmB;AAChE,SAAK,cAAc;AACnB,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,MAAM,IAAI,OAAqC;AAC7C,SAAK,KAAK,KAAK,KAAK;AACpB,WAAO,KAAK,KAAK,SAAS,KAAK,YAAa,MAAK,KAAK,MAAM;AAC5D,UAAM,KAAK,QAAQ,KAAK;AAAA,EAC1B;AAAA;AAAA,EAGA,UAAU,SAAmC;AAC3C,QAAI,CAAC,WAAW,CAAC,OAAO,SAAS,OAAO,EAAG,QAAO,KAAK,KAAK,MAAM;AAClE,UAAM,SAAS,IAAI,KAAK,OAAO,EAAE,YAAY;AAC7C,WAAO,KAAK,KAAK,OAAO,CAAC,MAAM,EAAE,MAAM,MAAM;AAAA,EAC/C;AAAA;AAAA,EAGA,gBAAgB,UAA4B;AAC1C,UAAM,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,EAAE,YAAY;AAC3D,UAAM,MAAM,oBAAI,IAAY;AAC5B,eAAW,KAAK,KAAK,MAAM;AACzB,UAAI,UAAU,MAAM,EAAE,SAAS,UAAU,EAAE,SAAS,aAAa,EAAE,MAAM,QAAQ;AAC/E,YAAI,IAAI,EAAE,IAAI;AAAA,MAChB;AAAA,IACF;AACA,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AAAA,EAEA,OAAe;AACb,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,MAAc,QAAQ,OAAqC;AACzD,QAAI;AACF,YAAM,MAAM,QAAQ,KAAK,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAC1D,YAAM,WAAW,KAAK,aAAa,KAAK,UAAU,KAAK,IAAI,MAAM,MAAM;AAAA,IACzE,QAAQ;AAAA,IAER;AAAA,EACF;AACF;;;ACpEA,OAAO,cAAkC;AACzC,SAAS,gBAAgB;AACzB,SAAS,MAAM,UAAU,WAAW;AACpC,OAAO,YAA6B;;;ACJpC,IAAM,iBAAwC;AAAA,EAC5C,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AACT;AAEA,IAAI,cAAsB,QAAQ,IAAI,iBAA2B;AAMjE,SAAS,UAAU,OAAuB;AACxC,SAAO,eAAe,KAAK,KAAK,eAAe,WAAW;AAC5D;AAEA,SAAS,KAAK,OAAc,QAAgB,MAAuB;AACjE,MAAI,CAAC,UAAU,KAAK,EAAG;AACvB,QAAM,SAAS,UAAU,WAAW,UAAU,SAAS,QAAQ,SAAS,QAAQ;AAChF,SAAO,MAAM,SAAS,GAAG,GAAG,KAAK,SAAS,MAAM,KAAK,IAAI,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE;AAAA,CAAI;AACrF;AAEO,IAAM,MAAM;AAAA,EACjB,OAAO,CAAC,MAAc,MAAiB,KAAK,SAAS,GAAG,GAAG,CAAC;AAAA,EAC5D,MAAM,CAAC,MAAc,MAAiB,KAAK,QAAQ,GAAG,GAAG,CAAC;AAAA,EAC1D,MAAM,CAAC,MAAc,MAAiB,KAAK,QAAQ,GAAG,GAAG,CAAC;AAAA,EAC1D,OAAO,CAAC,MAAc,MAAiB,KAAK,SAAS,GAAG,GAAG,CAAC;AAC9D;;;ADnBA,IAAM,gBAAgB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AASA,eAAe,eAAe,MAAiC;AAC7D,MAAI;AACF,UAAM,OAAO,MAAM,SAAS,MAAM,MAAM;AACxC,WAAO,KACJ,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAAE,WAAW,GAAG,CAAC;AAAA,EACrD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAe,aAAa,MAA+B;AACzD,QAAM,KAAK,OAAO;AAClB,KAAG,IAAI,cAAc,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AACxC,KAAG,IAAI,MAAM,eAAe,KAAK,MAAM,YAAY,CAAC,CAAC;AACrD,KAAG,IAAI,MAAM,eAAe,KAAK,MAAM,gBAAgB,CAAC,CAAC;AACzD,SAAO;AACT;AAEA,SAAS,WAAW,MAAc,KAAqB;AACrD,QAAM,MAAM,SAAS,MAAM,GAAG;AAC9B,SAAO,QAAQ,MAAM,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AACpD;AAEO,SAAS,kBAAkB,MAAc,SAAwC;AACtF,MAAI,UAA4B;AAChC,MAAI,KAAoB;AAExB,QAAMC,QAAO,OAAO,MAAyB,QAAgB;AAC3D,QAAI,CAAC,GAAI;AACT,UAAM,MAAM,WAAW,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO,IAAI,WAAW,IAAI,EAAG;AAClC,QAAI,GAAG,QAAQ,GAAG,EAAG;AACrB,QAAI;AACF,YAAM,QAAQ,EAAE,MAAM,MAAM,KAAK,KAAI,oBAAI,KAAK,GAAE,YAAY,EAAE,CAAC;AAAA,IACjE,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AACZ,WAAK,MAAM,aAAa,IAAI;AAC5B,gBAAU,SAAS,MAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAO7B,SAAS,cAAc,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC;AAAA,QAC/D,eAAe;AAAA,QACf,YAAY;AAAA,QACZ,kBAAkB,EAAE,oBAAoB,KAAK,cAAc,GAAG;AAAA,MAChE,CAAC;AAKD,cAAQ,GAAG,SAAS,CAACC,SAAQ;AAC3B,cAAM,IAAIA;AACV,YAAI,MAAM,mCAAmC,GAAG,QAAQ,EAAE,IAAI,GAAG,WAAW,OAAOA,IAAG,CAAC,EAAE;AAAA,MAC3F,CAAC;AAED,cAAQ,GAAG,OAAO,CAAC,SAASD,MAAK,UAAU,IAAI,CAAC;AAChD,cAAQ,GAAG,UAAU,CAAC,SAASA,MAAK,QAAQ,IAAI,CAAC;AACjD,cAAQ,GAAG,UAAU,CAAC,SAASA,MAAK,UAAU,IAAI,CAAC;AAAA,IACrD;AAAA,IAEA,MAAM,OAAO;AACX,UAAI,SAAS;AACX,cAAM,QAAQ,MAAM;AACpB,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACF;;;AE/GA,SAAS,gBAAgB;AACzB,SAAS,aAA6B;AACtC,SAAS,YAAAE,iBAAgB;AACzB,SAAS,QAAAC,aAAY;AACrB,SAAS,iBAAiB;AAI1B,IAAM,gBAAgB,UAAU,QAAQ;AAExC,IAAM,UAAU;AAShB,eAAe,eAAe,aAA6C;AACzE,MAAI;AACF,UAAM,OAAO,MAAMD,UAASC,MAAK,aAAa,QAAQ,MAAM,GAAG,MAAM;AACrE,UAAM,IAAI,KAAK,KAAK,EAAE,MAAM,4BAA4B;AACxD,WAAO,IAAI,CAAC,KAAK;AAAA,EACnB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,oBAAoB,aAA6C;AAC9E,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM,cAAc,OAAO,CAAC,UAAU,aAAa,GAAG;AAAA,MACvE,KAAK;AAAA,IACP,CAAC;AACD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,iBAAiB,MAAc,SAAsC;AACnF,MAAI,cAAgC;AACpC,MAAI,YAAmC;AACvC,MAAI,aAA4B;AAChC,MAAI,aAA4B;AAEhC,QAAM,WAAW,OAAO,UAAoB;AAC1C,QAAI;AACF,YAAM,QAAQ,KAAK;AAAA,IACrB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,YAAY,YAAY;AAC5B,UAAM,SAAS,MAAM,eAAe,IAAI;AACxC,QAAI,UAAU,WAAW,YAAY;AACnC,YAAM,OAAO;AACb,mBAAa;AACb,UAAI,SAAS,MAAM;AACjB,cAAM,SAAS;AAAA,UACb,MAAM;AAAA,UACN,SAAS,EAAE,MAAM,MAAM,IAAI,OAAO;AAAA,UAClC,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,QAC7B,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAa,YAAY;AAC7B,UAAM,SAAS,MAAM,oBAAoB,IAAI;AAC7C,QAAI,WAAW,KAAM;AACrB,QAAI,eAAe,QAAQ,WAAW,YAAY;AAChD,YAAM,YAAY,iBAAiB,UAAU;AAC7C,YAAM,WAAW,iBAAiB,MAAM;AACxC,YAAM,QAAQ,SAAS,OAAO,CAAC,MAAM,CAAC,UAAU,SAAS,CAAC,CAAC;AAC3D,YAAM,UAAU,UAAU,OAAO,CAAC,MAAM,CAAC,SAAS,SAAS,CAAC,CAAC;AAC7D,YAAM,SAAS;AAAA,QACb,MAAM;AAAA,QACN,SAAS;AAAA,UACP,eAAe,SAAS;AAAA,UACxB,aAAa;AAAA,UACb,aAAa;AAAA,QACf;AAAA,QACA,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC7B,CAAC;AAAA,IACH;AACA,iBAAa;AAAA,EACf;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAGZ,mBAAa,MAAM,eAAe,IAAI;AACtC,mBAAa,MAAM,oBAAoB,IAAI;AAE3C,UAAI;AACF,sBAAc,MAAMA,MAAK,MAAM,QAAQ,MAAM,GAAG,MAAM;AACpD,eAAK,UAAU;AAAA,QACjB,CAAC;AAID,oBAAY,GAAG,SAAS,MAAM;AAAA,QAE9B,CAAC;AAAA,MACH,QAAQ;AAAA,MAER;AAEA,kBAAY,YAAY,MAAM;AAC5B,aAAK,WAAW;AAAA,MAClB,GAAG,OAAO;AACV,gBAAU,QAAQ;AAAA,IACpB;AAAA,IAEA,MAAM,OAAO;AACX,UAAI,aAAa;AACf,oBAAY,MAAM;AAClB,sBAAc;AAAA,MAChB;AACA,UAAI,WAAW;AACb,sBAAc,SAAS;AACvB,oBAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,WAA6B;AACrD,SAAO,UACJ,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAC5B,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC/B;;;ACzIA,SAAS,eAAe;;;ACIxB,SAAS,WAAAC,UAAS,QAAAC,OAAM,aAAa;;;AC2C9B,IAAM,iBAAiB;;;AC9C9B,SAAS,kBAAkB;AAEpB,SAAS,SAAS,SAAyB;AAChD,SAAO,WAAW,MAAM,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,CAAC;AACpE;;;ACHA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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,IAAM,cAAc,oBAAI,IAAI;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AAGD,SAAS,MAAM,OAAuB;AACpC,MAAI,UAAU,IAAI,KAAK,EAAG,QAAO;AACjC,MAAI,YAAY,IAAI,KAAK,EAAG,QAAO;AACnC,MAAI,MAAM,UAAU,EAAG,QAAO;AAC9B,SAAO;AACT;AAEA,SAAS,gBAAgB,IAAsB;AAE7C,QAAM,WAAW,GAAG,MAAM,UAAU,EAAE,OAAO,OAAO;AACpD,QAAM,MAAgB,CAAC;AACvB,aAAW,QAAQ,UAAU;AAE3B,UAAM,aAAa,KAAK,MAAM,kDAAkD;AAChF,QAAI,WAAY,KAAI,KAAK,GAAG,UAAU;AAAA,QACjC,KAAI,KAAK,IAAI;AAAA,EACpB;AACA,SAAO,IAAI,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,EAAE,OAAO,CAAC,MAAM,QAAQ,KAAK,CAAC,CAAC;AACtE;AAEO,SAAS,gBAAgB,SAAiB,MAAwB;AAEvE,QAAM,SAAS,QAAQ,MAAM,8BAA8B,KAAK,CAAC;AACjE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,OAAO,QAAQ;AACxB,eAAW,QAAQ,gBAAgB,GAAG,GAAG;AACvC,YAAM,IAAI,MAAM,IAAI;AACpB,UAAI,MAAM,EAAG;AACb,aAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAC9C;AAAA,EACF;AACA,SAAO,MAAM,KAAK,OAAO,QAAQ,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AACnB;;;AH3MA,IAAM,eAAe;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,cAAc,CAAC,YAAY,aAAa,YAAY,aAAa,aAAa;AAEpF,SAAS,OAAO,SAAyB;AACvC,SAAO,QAAQ,OAAO;AACxB;AAEA,SAAS,SAAS,SAAiB,KAA2B;AAC5D,SAAO,UAAU,OAAO,KAAK,IAAI,IAAI,IAAI,IAAI,SAAS;AACxD;AAEA,SAAS,WAAW,QAA8B;AAChD,QAAM,UAAU,OAAO;AACvB,SAAO;AAAA,IACL,IAAI,OAAO,OAAO,KAAK,OAAO;AAAA,IAC9B,MAAM;AAAA,IACN,MAAM,OAAO,KAAK;AAAA,IAClB,KAAK,OAAO,KAAK;AAAA,IACjB,MAAM,OAAO,KAAK;AAAA,IAClB,UAAU,gBAAgB,SAAS,OAAO,KAAK,GAAG;AAAA,IAClD;AAAA,IACA,SAAS,eAAe,OAAO;AAAA,IAC/B,WAAW,SAAS,OAAO;AAAA,EAC7B;AACF;AAEA,SAAS,eAAe,SAAyB;AAE/C,QAAM,UAAU,QAAQ,QAAQ,QAAQ,EAAE;AAC1C,QAAM,aAAa,QAAQ,MAAM,iCAAiC;AAClE,MAAI,aAAa,CAAC,EAAG,QAAO,WAAW,CAAC,EAAE,MAAM,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG;AACtF,QAAM,aAAa,QAAQ,MAAM,wBAAwB;AACzD,MAAI,aAAa,CAAC,GAAG;AACnB,WAAO,WAAW,CAAC,EAChB,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,QAAQ,aAAa,EAAE,CAAC,EACrC,KAAK,GAAG,EACR,KAAK,EACL,MAAM,GAAG,GAAG;AAAA,EACjB;AACA,QAAM,YAAY,QAAQ,MAAM,2BAA2B;AAC3D,MAAI,YAAY,CAAC,EAAG,QAAO,UAAU,CAAC,EAAE,MAAM,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG;AACpF,SAAO;AACT;AAEA,SAAS,aAAa,QAAoB,KAA+B;AACvE,SAAO;AAAA,IACL,IAAI,SAAS,OAAO,KAAK,SAAS,GAAG;AAAA,IACrC,MAAM;AAAA,IACN,aAAa,IAAI;AAAA,IACjB,MAAM,IAAI;AAAA,IACV,MAAM,OAAO,KAAK;AAAA,IAClB,YAAY,IAAI;AAAA,IAChB,UAAU,IAAI;AAAA,IACd,WAAW,IAAI;AAAA,EACjB;AACF;AASA,IAAM,iBAAiB;AAEvB,SAAS,cACP,aACA,MACA,aACe;AACf,MAAI,CAAC,KAAK,WAAW,GAAG,EAAG,QAAO;AAClC,QAAM,UAAU,MAAM,QAAQ,QAAQ,WAAW,CAAC;AAClD,QAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS,QAAQ,IAAI,CAAC,CAAC;AAE/D,QAAM,aAAa,CAAC,IAAI;AACxB,QAAM,YAAY,KAAK,QAAQ,gBAAgB,EAAE;AACjD,MAAI,cAAc,KAAM,YAAW,KAAK,SAAS;AAEjD,aAAW,KAAK,YAAY;AAC1B,QAAI,YAAY,IAAI,CAAC,EAAG,QAAO;AAC/B,eAAW,OAAO,cAAc;AAC9B,UAAI,YAAY,IAAI,IAAI,GAAG,EAAG,QAAO,IAAI;AAAA,IAC3C;AACA,eAAW,OAAO,aAAa;AAC7B,YAAM,YAAY,MAAM,KAAK,GAAG,GAAG;AACnC,UAAI,YAAY,IAAI,SAAS,EAAG,QAAO;AAAA,IACzC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,GAAmB;AAClC,SAAO,EAAE,MAAM,OAAO,EAAE,KAAK,GAAG;AAClC;AAEA,IAAM,UAAU;AAEhB,SAAS,WAAW,SAAiB,aAA+C;AAClF,QAAM,WAAW,QAAQ,MAAM,GAAG,EAAE,IAAI,KAAK;AAC7C,QAAM,QAAQ,QAAQ,KAAK,QAAQ;AACnC,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,MAAM,QAAQ,SAAS,GAAG,IAAI,QAAQ,MAAM,GAAG,QAAQ,YAAY,GAAG,IAAI,CAAC,IAAI;AACrF,QAAM,OAAO,MAAM,QAAQ,QAAQ;AACnC,QAAM,MAAM,MAAM,QAAQ,OAAO;AACjC,MAAI,CAAC,QAAQ,CAAC,IAAK,QAAO;AAC1B,QAAM,YAAY,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG;AACtC,MAAI,YAAY,IAAI,SAAS,EAAG,QAAO;AAEvC,aAAW,KAAK,cAAc;AAC5B,UAAM,MAAM,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC;AAC7B,QAAI,YAAY,IAAI,GAAG,EAAG,QAAO;AAAA,EACnC;AACA,SAAO;AACT;AAEA,eAAsB,WAAW,MAAc,QAA4C;AACzF,QAAM,cAAc,oBAAI,IAAkB;AAC1C,aAAW,KAAK,OAAQ,aAAY,IAAI,EAAE,KAAK,SAAS,IAAI;AAE5D,QAAM,QAAmC,CAAC;AAC1C,QAAM,QAAgB,CAAC;AAIvB,QAAM,gBAAgB,oBAAI,IAA0B;AACpD,QAAM,cAAc,oBAAI,IAAwB;AAEhD,aAAW,KAAK,QAAQ;AACtB,UAAM,WAAW,WAAW,CAAC;AAC7B,UAAM,KAAK,QAAQ;AAEnB,UAAM,eAA6B,CAAC;AACpC,eAAW,OAAO,EAAE,SAAS;AAC3B,YAAM,UAAU,aAAa,GAAG,GAAG;AACnC,YAAM,KAAK,OAAO;AAClB,mBAAa,KAAK,OAAO;AACzB,YAAM,KAAK,EAAE,MAAM,SAAS,IAAI,IAAI,QAAQ,IAAI,MAAM,UAAU,CAAC;AAAA,IACnE;AACA,kBAAc,IAAI,EAAE,KAAK,SAAS,YAAY;AAC9C,gBAAY,IAAI,EAAE,KAAK,SAAS,EAAE,KAAK;AAEvC,UAAM,cAAc,oBAAI,IAAY;AACpC,eAAW,QAAQ,EAAE,SAAS;AAC5B,YAAM,SAAS,cAAc,EAAE,KAAK,SAAS,MAAM,WAAW;AAC9D,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,GAAG,SAAS,EAAE,KAAK,OAAO,MAAM,CAAC;AAC7C,UAAI,YAAY,IAAI,GAAG,EAAG;AAC1B,kBAAY,IAAI,GAAG;AACnB,YAAM,KAAK,EAAE,MAAM,SAAS,IAAI,IAAI,OAAO,MAAM,GAAG,MAAM,UAAU,CAAC;AAAA,IACvE;AAEA,UAAM,iBAAiB,WAAW,EAAE,KAAK,SAAS,WAAW;AAC7D,QAAI,kBAAkB,mBAAmB,EAAE,KAAK,SAAS;AACvD,YAAM,KAAK,EAAE,MAAM,SAAS,IAAI,IAAI,OAAO,cAAc,GAAG,MAAM,QAAQ,CAAC;AAAA,IAC7E;AAAA,EACF;AAEA,QAAM,KAAK,GAAG,eAAe,eAAe,WAAW,CAAC;AAExD,QAAM,cAAc,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE;AAC7D,QAAM,YAAY,MAAM,SAAS;AAEjC,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM;AAAA,IAClB,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,IACZ,cAAc;AAAA,IACd;AAAA,IACA;AAAA,IACA,eAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrC,gBAAgB;AAAA,EAClB;AACF;AAEO,SAAS,iBAAiB,OAAiC;AAIhE,QAAM,MAAmB,uBAAO,OAAO,IAAI;AAC3C,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI,KAAK,SAAS,SAAU;AAC5B,UAAM,OAAO,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC;AAClD,SAAK,KAAK,EAAE,MAAM,KAAK,MAAM,MAAM,KAAK,YAAY,MAAM,KAAK,YAAY,CAAC;AAAA,EAC9E;AACA,SAAO;AACT;AAKO,SAAS,kBAAkB,MAAoB,MAAiC;AACrF,MAAI,OAA0B;AAC9B,aAAW,KAAK,MAAM;AACpB,QAAI,OAAO,EAAE,cAAc,OAAO,EAAE,SAAU;AAC9C,QAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,aAAa,KAAK,WAAW,KAAK,WAAY,QAAO;AAAA,EACnF;AACA,SAAO;AACT;AAWO,SAAS,eACd,eACA,aACQ;AAER,QAAM,SAAS,oBAAI,IAA0B;AAC7C,aAAW,QAAQ,cAAc,OAAO,GAAG;AACzC,eAAW,KAAK,MAAM;AACpB,YAAM,OAAO,OAAO,IAAI,EAAE,IAAI;AAC9B,UAAI,KAAM,MAAK,KAAK,CAAC;AAAA,UAChB,QAAO,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,QAAgB,CAAC;AACvB,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,CAAC,SAAS,KAAK,KAAK,aAAa;AAC1C,UAAM,WAAW,cAAc,IAAI,OAAO,KAAK,CAAC;AAChD,eAAW,QAAQ,OAAO;AACxB,YAAM,SAAS,kBAAkB,UAAU,KAAK,IAAI;AACpD,UAAI,CAAC,OAAQ;AAEb,UAAI,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,MAAM;AACxD,UAAI,CAAC,QAAQ;AACX,cAAM,QAAQ,OAAO,IAAI,KAAK,MAAM,KAAK,CAAC;AAC1C,YAAI,MAAM,WAAW,EAAG;AACxB,iBAAS,MAAM,CAAC;AAAA,MAClB;AACA,UAAI,CAAC,UAAU,OAAO,OAAO,OAAO,GAAI;AAExC,YAAM,MAAM,GAAG,OAAO,EAAE,KAAK,OAAO,EAAE;AACtC,UAAI,KAAK,IAAI,GAAG,EAAG;AACnB,WAAK,IAAI,GAAG;AACZ,YAAM,KAAK,EAAE,MAAM,OAAO,IAAI,IAAI,OAAO,IAAI,MAAM,QAAQ,CAAC;AAAA,IAC9D;AAAA,EACF;AACA,SAAO;AACT;;;AIzQA,SAAS,SAAAC,QAAO,YAAAC,WAAU,iBAAiB;AAC3C,SAAS,WAAAC,gBAAe;;;ACTxB,SAAS,YAAAC,iBAAgB;AACzB,SAAS,qBAAqB;AAC9B,SAAS,UAAU,cAAc;;;ACIjC,SAAS,aAAwB;AAiC1B,SAAS,UAAU,MAAc,MAAM,KAAa;AACzD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAEA,SAAS,YAAY,GAAmB;AAGtC,SAAO,EAAE,QAAQ,sBAAsB,EAAE,EAAE,KAAK;AAClD;AAEA,eAAsB,iBACpB,QACA,GACA,QACqB;AACrB,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,QAAM,QAAoB,CAAC;AAE3B,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,OAAO,OAAO;AAC9D,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AAE7D,UAAM,QAAQ,IAAI,MAAM,UAAU,OAAO,KAAK;AAC9C,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,UAAI,UAA8B;AAClC,iBAAW,KAAK,OAAO,OAAO;AAC5B,YAAI,OAAO,IAAI,EAAE,WAAW,KAAK,OAAO,IAAI,EAAE,WAAW,GAAG;AAC1D,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAEA,UAAI,SAAS;AACX,cAAM,WAAW,OAAO,IAAI,QAAQ,WAAW;AAC/C,cAAM,WAAW,OAAO,IAAI,QAAQ,WAAW;AAC/C,gBAAQ,KAAK;AAAA,UACX,MAAM,SAAS;AAAA,UACf,MAAM,QAAQ;AAAA,UACd,WAAW,SAAS,cAAc,MAAM;AAAA,UACxC,SAAS,SAAS,YAAY,MAAM;AAAA,UACpC,WAAW,UAAU,SAAS,IAAI;AAAA,QACpC,CAAC;AACD;AAAA,MACF;AAEA,UAAI,OAAO,eAAe,OAAO,mBAAmB;AAClD,cAAM,WAAW,OAAO,IAAI,OAAO,WAAW;AAC9C,cAAM,aAAa,OAAO,IAAI,OAAO,iBAAiB;AACtD,YAAI,YAAY,YAAY;AAC1B,gBAAM,KAAK,EAAE,QAAQ,WAAW,MAAM,MAAM,SAAS,cAAc,MAAM,EAAE,CAAC;AAC5E;AAAA,QACF;AAAA,MACF;AAEA,UAAI,OAAO,eAAe;AACxB,cAAM,MAAM,OAAO,IAAI,OAAO,aAAa;AAC3C,YAAI,IAAK,SAAQ,KAAK,YAAY,IAAI,IAAI,CAAC;AAAA,MAC7C;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,IAAI,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AAClC,UAAI,KAAK,IAAI,CAAC,EAAG,QAAO;AACxB,WAAK,IAAI,CAAC;AACV,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAAA,EACnE,QAAQ;AAAA,EAGR;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AACpD;;;ACvHA,IAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAUd,eAAsB,OAAO,GAAe,QAAqC;AAC/E,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAO;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,MAChE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC5BA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcd,eAAsB,SAAS,GAAe,QAAqC;AACjF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,QAAQ;AAAA,MAC3E;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AClCA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYd,eAAsB,YAAY,GAAe,QAAqC;AACpF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,YAAY;AAAA,QAC7E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,QAAQ;AAAA,MAC3E;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC1BA,SAAS,SAAAC,cAAwB;AAKjC,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAuBd,IAAM,QAAqB;AAAA,EACzB,EAAE,SAAS,SAAS,SAAS,cAAc,MAAM,QAAQ;AAAA,EACzD,EAAE,SAAS,SAAS,SAAS,cAAc,MAAM,QAAQ;AAAA,EACzD,EAAE,SAAS,OAAO,SAAS,YAAY,MAAM,QAAQ;AAAA,EACrD,EAAE,SAAS,QAAQ,SAAS,aAAa,MAAM,OAAO;AAAA,EACtD,EAAE,SAAS,WAAW,SAAS,gBAAgB,MAAM,OAAO;AAAA,EAC5D,EAAE,SAAS,YAAY,SAAS,iBAAiB,MAAM,WAAW;AAAA,EAClE,EAAE,SAAS,UAAU,SAAS,eAAe,MAAM,SAAS;AAAA,EAC5D,EAAE,SAAS,UAAU,SAAS,eAAe,MAAM,SAAS;AAAA,EAC5D,EAAE,SAAS,UAAU,SAAS,eAAe,MAAM,SAAS;AAAA,EAC5D,EAAE,SAAS,QAAQ,SAAS,aAAa,MAAM,SAAS;AAC1D;AAEA,SAASC,WAAU,MAAc,MAAM,KAAa;AAClD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAKA,SAAS,oBAAoB,KAA4B;AACvD,QAAM,WAAW,IAAI,QAAQ,gBAAgB,EAAE;AAC/C,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI,SAAS,WAAW,UAAU,EAAG,QAAO;AAC5C,MAAI,SAAS,WAAW,OAAO,EAAG,QAAO;AACzC,MAAI,SAAS,WAAW,GAAG,KAAK,SAAS,WAAW,GAAG,EAAG,QAAO;AACjE,SAAO,KAAK,QAAQ;AACtB;AAEA,eAAsB,UAAU,GAAe,QAAqC;AAClF,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AAEzB,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,MAAM;AACtD,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,OAAO,CAAC,EAAE;AAEjE,UAAM,QAAQ,IAAIC,OAAM,UAAUF,MAAK;AACvC,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,UAAI,UAA4B;AAChC,iBAAW,KAAK,OAAO;AACrB,YAAI,OAAO,IAAI,EAAE,OAAO,KAAK,OAAO,IAAI,EAAE,OAAO,GAAG;AAClD,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAEA,UAAI,SAAS;AACX,cAAM,WAAW,OAAO,IAAI,QAAQ,OAAO;AAC3C,cAAM,WAAW,OAAO,IAAI,QAAQ,OAAO;AAC3C,gBAAQ,KAAK;AAAA,UACX,MAAM,SAAS;AAAA,UACf,MAAM,QAAQ;AAAA,UACd,WAAW,SAAS,cAAc,MAAM;AAAA,UACxC,SAAS,SAAS,YAAY,MAAM;AAAA,UACpC,WAAWC,WAAU,SAAS,IAAI;AAAA,QACpC,CAAC;AACD;AAAA,MACF;AAEA,YAAM,aAAa,OAAO,IAAI,QAAQ;AACtC,UAAI,YAAY;AACd,cAAM,OAAO,oBAAoB,WAAW,IAAI;AAChD,YAAI,KAAM,SAAQ,KAAK,IAAI;AAAA,MAC7B;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,IAAI,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AAClC,UAAI,KAAK,IAAI,CAAC,EAAG,QAAO;AACxB,WAAK,IAAI,CAAC;AACV,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAGR;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,OAAO,CAAC,EAAE;AACxD;;;AC1HA,IAAME,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASd,eAAsB,QAAQ,GAAe,QAAqC;AAChF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,MAChE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACtBA,IAAM,WAAW;AACjB,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,cAAc;AAEpB,IAAM,YAAY;AAElB,SAAS,OAAO,QAAgB,OAAuB;AACrD,SAAO,OAAO,MAAM,GAAG,KAAK,EAAE,MAAM,OAAO,EAAE;AAC/C;AAIA,SAAS,aAAa,QAAgB,WAAmB,OAAe,WAA2B;AACjG,QAAM,YAAY;AAClB,QAAM,IAAI,MAAM,KAAK,MAAM;AAC3B,SAAO,IAAI,OAAO,QAAQ,EAAE,KAAK,IAAI;AACvC;AAEO,SAAS,UAAU,GAAe,QAA4B;AACnE,QAAM,UAA0B,CAAC;AACjC,QAAM,UAAoB,CAAC;AAE3B,aAAW,KAAK,OAAO,SAAS,QAAQ,GAAG;AACzC,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,EAAE,CAAC,KAAK,IAAI,KAAK;AAC/B,UAAM,QAAQ,EAAE,SAAS;AACzB,UAAM,YAAY,OAAO,QAAQ,KAAK;AACtC,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA,SAAS,aAAa,QAAQ,QAAQ,EAAE,CAAC,EAAE,QAAQ,aAAa,SAAS;AAAA,MACzE,WAAW,SAAS,IAAI,IAAI,IAAI;AAAA,IAClC,CAAC;AAAA,EACH;AAEA,aAAW,KAAK,OAAO,SAAS,QAAQ,GAAG;AACzC,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,EAAE,SAAS;AACzB,UAAM,YAAY,OAAO,QAAQ,KAAK;AACtC,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA,SAAS,aAAa,QAAQ,QAAQ,EAAE,CAAC,EAAE,QAAQ,aAAa,SAAS;AAAA,MACzE,WAAW,SAAS,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,aAAW,KAAK,OAAO,SAAS,SAAS,GAAG;AAC1C,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,KAAM,SAAQ,KAAK,IAAI;AAAA,EAC7B;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AACtF;;;AC9DA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASd,eAAsB,UAAU,GAAe,QAAqC;AAClF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,YAAY;AAAA,QAC7E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,MAChE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC3BA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQd,eAAsB,YAAY,GAAe,QAAqC;AACpF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,MACrE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACzBA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWd,eAAsB,SAAS,GAAe,QAAqC;AACjF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,YAAY;AAAA,QAC7E,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,MACtE;AAAA,MACA,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AChCA,SAAS,SAAAC,cAAwB;AAIjC,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAUd,SAASC,WAAU,MAAc,MAAM,KAAa;AAClD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAEA,eAAsB,YAAY,GAAe,QAAqC;AACpF,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,QAAM,QAAoB,CAAC;AAE3B,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,QAAQ;AACxD,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AAE7D,UAAM,QAAQ,IAAIC,OAAM,UAAUF,MAAK;AACvC,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,YAAM,WAAW,OAAO,IAAI,UAAU;AACtC,YAAM,WAAW,OAAO,IAAI,eAAe;AAC3C,UAAI,YAAY,UAAU;AACxB,cAAM,aAAa,SAAS,QAAQ,QAAQ;AAC5C,cAAM,WAAW,eAAe;AAChC,gBAAQ,KAAK;AAAA,UACX,MAAM,SAAS;AAAA,UACf,MAAM,WAAW,WAAW;AAAA,UAC5B,WAAW,SAAS,cAAc,MAAM;AAAA,UACxC,SAAS,SAAS,YAAY,MAAM;AAAA,UACpC,WAAWC,WAAU,SAAS,IAAI;AAAA,QACpC,CAAC;AACD;AAAA,MACF;AAEA,YAAM,YAAY,OAAO,IAAI,OAAO;AACpC,YAAM,YAAY,OAAO,IAAI,YAAY;AACzC,UAAI,aAAa,WAAW;AAC1B,gBAAQ,KAAK;AAAA,UACX,MAAM,UAAU;AAAA,UAChB,MAAM;AAAA,UACN,WAAW,UAAU,cAAc,MAAM;AAAA,UACzC,SAAS,UAAU,YAAY,MAAM;AAAA,UACrC,WAAWA,WAAU,UAAU,IAAI;AAAA,QACrC,CAAC;AACD;AAAA,MACF;AAEA,YAAM,aAAa,OAAO,IAAI,eAAe,KAAK,OAAO,IAAI,aAAa;AAC1E,UAAI,YAAY;AACd,gBAAQ,KAAK,WAAW,IAAI;AAC5B;AAAA,MACF;AAEA,YAAM,WAAW,OAAO,IAAI,WAAW;AACvC,YAAM,WAAW,OAAO,IAAI,MAAM;AAClC,UAAI,YAAY,UAAU;AACxB,cAAM,KAAK,EAAE,QAAQ,SAAS,MAAM,MAAM,SAAS,cAAc,MAAM,EAAE,CAAC;AAAA,MAC5E;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AACpC,UAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,WAAK,IAAI,GAAG;AACZ,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAER;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AACpD;;;ACrFA,IAAME,UAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQd,eAAsB,UAAU,GAAe,QAAqC;AAClF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,MACrE;AAAA,MACA,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACzBA,IAAMC,UAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWd,eAAsB,UAAU,GAAe,QAAqC;AAClF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,YAAY;AAAA,QACrE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,QAAQ;AAAA,MACjE;AAAA,MACA,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACjCA,SAAS,SAAAC,cAAwB;AAajC,IAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkBjB,IAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYjB,SAAS,WAAW,KAA0B;AAC5C,MAAI,QAAQ,UAAU,QAAQ,OAAQ,QAAO;AAC7C,MAAI,QAAQ,SAAS,QAAQ,UAAU,QAAQ,OAAQ,QAAO;AAC9D,SAAO;AACT;AAEA,SAAS,SAAS,SAA8B;AAC9C,SAAO,YAAY,eAAe,WAAW;AAC/C;AAEA,SAAS,QAAQ,GAAmB;AAClC,SAAO,EAAE,QAAQ,kBAAkB,EAAE;AACvC;AAEA,SAASC,WAAU,MAAc,MAAM,KAAa;AAClD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAQA,SAAS,kBAAkB,UAA+C;AACxE,QAAM,WAAW,CAAC,GAAW,OAAqC;AAChE,UAAM,OAAO,SAAS,IAAI,CAAC;AAC3B,UAAM,OAAO,SAAS,IAAI,GAAG,CAAC,OAAO;AACrC,WAAO,QAAQ,OAAO,EAAE,MAAM,MAAM,MAAM,GAAG,IAAI;AAAA,EACnD;AAEA,SACE,SAAS,YAAY,UAAU,KAC/B,SAAS,SAAS,OAAO,KACzB,SAAS,aAAa,WAAW,KACjC,SAAS,QAAQ,MAAM,KACvB,SAAS,QAAQ,MAAM,KACvB,SAAS,UAAU,QAAQ,KAC3B,SAAS,YAAY,UAAU,KAC/B,SAAS,aAAa,UAAU;AAEpC;AAEA,eAAsB,gBAAgB,GAAe,QAAqC;AACxF,QAAM,UAAU,WAAW,EAAE,GAAG;AAChC,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,QAAM,QAAoB,CAAC;AAE3B,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,OAAO;AACvD,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AAE7D,UAAM,QAAQ,IAAIC,OAAM,UAAU,SAAS,OAAO,CAAC;AACnD,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,YAAM,QAAQ,kBAAkB,MAAM;AACtC,UAAI,OAAO;AACT,gBAAQ,KAAK;AAAA,UACX,MAAM,MAAM,KAAK;AAAA,UACjB,MAAM,MAAM;AAAA,UACZ,WAAW,MAAM,KAAK,cAAc,MAAM;AAAA,UAC1C,SAAS,MAAM,KAAK,YAAY,MAAM;AAAA,UACtC,WAAWD,WAAU,MAAM,KAAK,IAAI;AAAA,QACtC,CAAC;AACD;AAAA,MACF;AACA,YAAM,aAAa,OAAO,IAAI,QAAQ;AACtC,UAAI,YAAY;AACd,gBAAQ,KAAK,QAAQ,WAAW,IAAI,CAAC;AACrC;AAAA,MACF;AAGA,YAAM,YAAY,OAAO,IAAI,aAAa;AAC1C,YAAM,gBAAgB,OAAO,IAAI,gBAAgB;AACjD,UAAI,aAAa,iBAAiB,UAAU,SAAS,WAAW;AAC9D,gBAAQ,KAAK,QAAQ,cAAc,IAAI,CAAC;AACxC;AAAA,MACF;AAGA,YAAM,WAAW,OAAO,IAAI,WAAW;AACvC,YAAM,WAAW,OAAO,IAAI,MAAM;AAClC,UAAI,YAAY,UAAU;AACxB,cAAM,KAAK,EAAE,QAAQ,SAAS,MAAM,MAAM,SAAS,cAAc,MAAM,EAAE,CAAC;AAAA,MAC5E;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AACpC,UAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,WAAK,IAAI,GAAG;AACZ,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAER;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AACpD;;;ACnJA,IAAM,YAAY;AAQlB,SAAS,eAAe,QAA+B;AACrD,QAAM,MAAqB,CAAC;AAC5B,aAAW,SAAS,OAAO,SAAS,SAAS,GAAG;AAC9C,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,UAAM,UAAU,KAAK,MAAM,GAAG,KAAK,QAAQ,GAAG,IAAI,CAAC;AACnD,UAAM,WAAW,MAAM,SAAS;AAChC,UAAM,eAAe,WAAW,QAAQ;AACxC,UAAM,YAAY,OAAO,MAAM,GAAG,YAAY,EAAE,MAAM,OAAO,EAAE;AAC/D,UAAM,QAAQ,8CAA8C,KAAK,OAAO;AACxE,QAAI,KAAK,EAAE,QAAQ,OAAO,WAAW,MAAM,CAAC;AAAA,EAC9C;AACA,SAAO;AACT;AAEA,eAAsB,YAAY,GAAe,QAAqC;AACpF,QAAM,SAAS,eAAe,MAAM;AACpC,QAAM,MAAkB,EAAE,MAAM,GAAG,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAE/E,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAsB,EAAE,GAAG,GAAG,KAAK,MAAM,QAAQ,QAAQ,MAAM;AACrE,UAAM,SAAS,MAAM,gBAAgB,SAAS,MAAM,MAAM;AAC1D,UAAM,SAAS,MAAM,YAAY;AACjC,eAAW,OAAO,OAAO,SAAS;AAChC,UAAI,QAAQ,KAAK;AAAA,QACf,GAAG;AAAA,QACH,WAAW,IAAI,YAAY;AAAA,QAC3B,SAAS,IAAI,UAAU;AAAA,MACzB,CAAC;AAAA,IACH;AACA,eAAW,OAAO,OAAO,QAAS,KAAI,QAAQ,KAAK,GAAG;AACtD,eAAW,QAAQ,OAAO,MAAO,KAAI,MAAM,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC;AAAA,EACvF;AAGA,MAAI,QAAQ,KAAK;AAAA,IACf,MACE,EAAE,QACC,MAAM,GAAG,EACT,IAAI,GACH,QAAQ,cAAc,EAAE,KAAK,EAAE;AAAA,IACrC,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS,OAAO,MAAM,OAAO,EAAE;AAAA,IAC/B,WAAW,EAAE;AAAA,EACf,CAAC;AACD,MAAI,UAAU,MAAM,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC;AAC7C,SAAO;AACT;;;ACzDA,IAAME,aAAY;AAQlB,SAASC,gBAAe,QAA+B;AACrD,QAAM,MAAqB,CAAC;AAC5B,aAAW,SAAS,OAAO,SAASD,UAAS,GAAG;AAC9C,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,UAAM,UAAU,KAAK,MAAM,GAAG,KAAK,QAAQ,GAAG,IAAI,CAAC;AACnD,UAAM,WAAW,MAAM,SAAS;AAChC,UAAM,eAAe,WAAW,QAAQ;AACxC,UAAM,YAAY,OAAO,MAAM,GAAG,YAAY,EAAE,MAAM,OAAO,EAAE;AAC/D,UAAM,OAAO,8CAA8C,KAAK,OAAO;AACvE,QAAI,KAAK,EAAE,QAAQ,OAAO,WAAW,KAAK,CAAC;AAAA,EAC7C;AACA,SAAO;AACT;AAEA,eAAsB,SAAS,GAAe,QAAqC;AACjF,QAAM,SAASC,gBAAe,MAAM;AACpC,QAAM,MAAkB,EAAE,MAAM,GAAG,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAE/E,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAsB,EAAE,GAAG,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM;AACpE,UAAM,SAAS,MAAM,gBAAgB,SAAS,MAAM,MAAM;AAC1D,UAAM,SAAS,MAAM,YAAY;AACjC,eAAW,OAAO,OAAO,SAAS;AAChC,UAAI,QAAQ,KAAK;AAAA,QACf,GAAG;AAAA,QACH,WAAW,IAAI,YAAY;AAAA,QAC3B,SAAS,IAAI,UAAU;AAAA,MACzB,CAAC;AAAA,IACH;AACA,eAAW,OAAO,OAAO,QAAS,KAAI,QAAQ,KAAK,GAAG;AACtD,eAAW,QAAQ,OAAO,MAAO,KAAI,MAAM,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC;AAAA,EACvF;AAEA,MAAI,QAAQ,KAAK;AAAA,IACf,MACE,EAAE,QACC,MAAM,GAAG,EACT,IAAI,GACH,QAAQ,WAAW,EAAE,KAAK,EAAE;AAAA,IAClC,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS,OAAO,MAAM,OAAO,EAAE;AAAA,IAC/B,WAAW,EAAE;AAAA,EACf,CAAC;AACD,MAAI,UAAU,MAAM,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC;AAC7C,SAAO;AACT;;;AhBZA,IAAMC,WAAU,cAAc,YAAY,GAAG;AAkB7C,IAAM,gBAA6C;AAAA,EACjD,YAAY;AAAA,EACZ,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,QAAQ;AAAA,EACR,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AAAA,EACL,MAAM;AAAA,EACN,GAAG;AAAA,EACH,KAAK;AAAA,EACL,MAAM;AAAA,EACN,QAAQ;AACV;AAEA,IAAI,aAAmC;AACvC,IAAM,gBAAgB,oBAAI,IAA2B;AAErD,eAAe,mBAAkC;AAC/C,MAAI,CAAC,YAAY;AACf,iBAAa,OAAO,KAAK;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,eAAsB,YAAY,MAAsC;AACtE,QAAM,iBAAiB;AACvB,QAAM,SAAS,cAAc,IAAI,IAAI;AACrC,MAAI,OAAQ,QAAO;AACnB,QAAM,WAAWA,SAAQ,QAAQ,cAAc,IAAI,CAAC;AACpD,QAAM,OAAO,MAAM,SAAS,KAAK,QAAQ;AACzC,gBAAc,IAAI,MAAM,IAAI;AAC5B,SAAO;AACT;AAOA,eAAsB,aAAa,MAA0C;AAC3E,QAAM,WAAW,MAAM,YAAY,IAAI;AACvC,QAAM,SAAS,IAAI,OAAO;AAC1B,SAAO,YAAY,QAAQ;AAC3B,SAAO,EAAE,QAAQ,SAAS;AAC5B;AAEA,SAAS,YAAY,MAAkB,QAA4B;AACjE,SAAO,EAAE,MAAM,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAC7D;AAeA,eAAsB,YAAY,GAAe,QAAqC;AACpF,UAAQ,EAAE,KAAK;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,gBAAgB,GAAG,MAAM;AAAA,IAClC,KAAK;AAAA,IACL,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B,KAAK;AACH,aAAO,SAAS,GAAG,MAAM;AAAA,IAC3B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AACH,aAAO,QAAQ,GAAG,MAAM;AAAA,IAC1B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B,KAAK;AACH,aAAO,SAAS,GAAG,MAAM;AAAA,IAC3B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,OAAO,GAAG,MAAM;AAAA,IACzB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,SAAS,GAAG,MAAM;AAAA,IAC3B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B;AACE,aAAO,YAAY,GAAG,MAAM;AAAA,EAChC;AACF;;;ADpKO,IAAM,sBAAsB;AAc5B,SAAS,kBAA8B;AAC5C,SAAO,EAAE,gBAAgB,qBAAqB,OAAO,CAAC,EAAE;AAC1D;AAEA,eAAsB,eAAe,MAAmC;AACtE,MAAI;AACF,UAAM,MAAM,MAAMC,UAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QACE,OAAO,mBAAmB,uBAC1B,OAAO,OAAO,UAAU,YACxB,OAAO,UAAU,MACjB;AACA,aAAO,gBAAgB;AAAA,IACzB;AACA,WAAO,EAAE,gBAAgB,qBAAqB,OAAO,OAAO,MAA6B;AAAA,EAC3F,QAAQ;AACN,WAAO,gBAAgB;AAAA,EACzB;AACF;AAEA,eAAsB,gBAAgB,MAAc,OAAkC;AACpF,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAM,UAAU,MAAM,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA,GAAM,MAAM;AAAA,EAC5D,QAAQ;AAAA,EAER;AACF;AAkBA,eAAsB,iBACpB,UACA,MACA,OAA2B,CAAC,GACK;AACjC,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,SAAuB,CAAC;AAC9B,MAAI,SAAS;AACb,MAAI,WAAW;AACf,MAAI,cAAc;AAElB,aAAW,KAAK,UAAU;AACxB,QAAI;AACJ,QAAI;AACF,eAAS,MAAMF,UAAS,EAAE,SAAS,MAAM;AAAA,IAC3C,QAAQ;AACN;AAAA,IACF;AACA,UAAM,OAAO,SAAS,MAAM;AAE5B,UAAM,SAAS,KAAK,OAAO,SAAY,KAAK,MAAM,EAAE,OAAO;AAC3D,QAAI,UAAU,OAAO,SAAS,MAAM;AAClC,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,SAAS,OAAO;AAAA,QAChB,OAAO,OAAO;AAAA,MAChB,CAAC;AACD,YAAM,MAAM,EAAE,OAAO,IAAI;AACzB,gBAAU;AACV;AAAA,IACF;AAEA,QAAI;AACF,YAAM,IAAI,MAAM,YAAY,GAAG,MAAM;AACrC,aAAO,KAAK,CAAC;AACb,YAAM,MAAM,EAAE,OAAO,IAAI,EAAE,MAAM,SAAS,EAAE,SAAS,SAAS,EAAE,SAAS,OAAO,EAAE,MAAM;AACxF,kBAAY;AAAA,IACd,QAAQ;AAGN,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,SAAO,EAAE,QAAQ,OAAO,QAAQ,UAAU,YAAY;AACxD;;;AkB1HA,SAAS,YAAAG,WAAU,SAAS,YAAY;AACxC,SAAS,SAAS,QAAAC,OAAM,YAAAC,WAAU,OAAAC,YAAW;AAC7C,OAAOC,aAA6B;AAgBpC,IAAM,iBAAiB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AACF;AAEA,IAAM,cAAc,oBAAI,IAAI;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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,eAAeC,gBAAe,MAAiC;AAC7D,MAAI;AACF,UAAM,OAAO,MAAML,UAAS,MAAM,MAAM;AACxC,WAAO,KACJ,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAAE,WAAW,GAAG,CAAC;AAAA,EACrD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAeM,cAAa,MAAc,OAAkC;AAC1E,QAAM,KAAKF,QAAO;AAClB,KAAG,IAAI,cAAc;AACrB,KAAG,IAAI,MAAMC,gBAAeJ,MAAK,MAAM,YAAY,CAAC,CAAC;AACrD,KAAG,IAAI,MAAMI,gBAAeJ,MAAK,MAAM,gBAAgB,CAAC,CAAC;AACzD,MAAI,MAAM,OAAQ,IAAG,IAAI,KAAK;AAC9B,SAAO;AACT;AAEA,SAASM,SAAQ,GAAmB;AAClC,SAAOJ,SAAQ,MAAM,IAAI,EAAE,MAAMA,IAAG,EAAE,KAAK,GAAG;AAChD;AAEA,gBAAuB,KAAK,MAAc,UAAuB,CAAC,GAA+B;AAC/F,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,KAAK,MAAMG,cAAa,MAAM,QAAQ,eAAe,CAAC,CAAC;AAE7D,kBAAgB,QAAQ,KAAyC;AAC/D,QAAI;AACJ,QAAI;AACF,gBAAU,MAAM,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,IACtD,QAAQ;AACN;AAAA,IACF;AACA,eAAW,SAAS,SAAS;AAC3B,YAAM,MAAML,MAAK,KAAK,MAAM,IAAI;AAChC,YAAM,MAAMC,UAAS,MAAM,GAAG;AAC9B,UAAI,CAAC,IAAK;AACV,YAAM,WAAWK,SAAQ,GAAG;AAC5B,YAAM,YAAY,MAAM,YAAY,IAAI,GAAG,QAAQ,MAAM;AACzD,UAAI,GAAG,QAAQ,SAAS,EAAG;AAE3B,UAAI,MAAM,YAAY,GAAG;AACvB,eAAO,QAAQ,GAAG;AAAA,MACpB,WAAW,MAAM,OAAO,GAAG;AACzB,cAAM,MAAM,QAAQ,MAAM,IAAI,EAAE,YAAY;AAC5C,YAAI,YAAY,IAAI,GAAG,EAAG;AAC1B,YAAI;AACJ,YAAI;AACF,gBAAM,IAAI,MAAM,KAAK,GAAG;AACxB,iBAAO,EAAE;AAAA,QACX,QAAQ;AACN;AAAA,QACF;AACA,YAAI,OAAO,YAAa;AACxB,cAAM,EAAE,SAAS,KAAK,SAAS,UAAU,KAAK,KAAK;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AAEA,SAAO,QAAQ,IAAI;AACrB;;;ACnKA,SAAS,SAAAC,QAAO,YAAAC,WAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,gBAAe;AAIxB,eAAe,UAAU,MAAc,MAAe,QAAgC;AACpF,QAAMH,OAAMG,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,OAAO,SAAS,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI;AACzE,QAAMD,WAAU,MAAM,OAAO,MAAM,MAAM;AAC3C;AAEA,eAAe,SAAY,MAA0B;AACnD,QAAM,OAAO,MAAMD,UAAS,MAAM,MAAM;AACxC,SAAO,KAAK,MAAM,IAAI;AACxB;AAEA,eAAsB,WAAW,MAAc,OAAmC;AAGhF,QAAM,UAAU,MAAM,OAAO,KAAK;AACpC;AAEA,eAAsB,UAAU,MAAoC;AAClE,SAAO,SAAsB,IAAI;AACnC;AAEA,eAAsB,iBAAiB,MAAc,OAAmC;AACtF,QAAM,UAAU,MAAM,OAAO,IAAI;AACnC;AAEA,eAAsB,gBAAgB,MAAoC;AAIxE,QAAM,SAAS,MAAM,SAAsB,IAAI;AAC/C,SAAO,OAAO,OAAO,uBAAO,OAAO,IAAI,GAAG,MAAM;AAClD;;;ACpCA,SAAS,QAAAG,aAAY;AA8Bd,SAAS,aAAa,aAAmC;AAC9D,QAAM,WAAWA,MAAK,aAAa,gBAAgB;AACnD,QAAM,aAAaA,MAAK,aAAa,UAAU;AAC/C,QAAM,YAAYA,MAAK,aAAa,SAAS;AAE7C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAWA,MAAK,UAAU,iBAAiB;AAAA,IAC3C,aAAaA,MAAK,UAAU,mBAAmB;AAAA,IAC/C,cAAcA,MAAK,UAAU,cAAc;AAAA,IAC3C,aAAaA,MAAK,UAAU,gBAAgB;AAAA,IAC5C,UAAUA,MAAK,UAAU,iBAAiB;AAAA,IAC1C,SAASA,MAAK,UAAU,gBAAgB;AAAA,IACxC,SAASA,MAAK,UAAU,gBAAgB;AAAA,IACxC,SAASA,MAAK,UAAU,gBAAgB;AAAA,IACxC,WAAWA,MAAK,UAAU,kBAAkB;AAAA,IAC5C,YAAYA,MAAK,UAAU,kBAAkB;AAAA,IAC7C,YAAYA,MAAK,UAAU,kBAAkB;AAAA,IAC7C,SAASA,MAAK,UAAU,UAAU;AAAA,IAClC,cAAcA,MAAK,UAAU,gBAAgB;AAAA,IAC7C,iBAAiBA,MAAK,UAAU,oBAAoB;AAAA,IACpD,cAAcA,MAAK,YAAY,oBAAoB;AAAA,IACnD,WAAWA,MAAK,YAAY,YAAY;AAAA,IACxC,aAAaA,MAAK,YAAY,UAAU;AAAA,IACxC;AAAA,IACA,gBAAgBA,MAAK,WAAW,qBAAqB;AAAA,IACrD,gBAAgBA,MAAK,WAAW,OAAO;AAAA,IACvC,UAAUA,MAAK,aAAa,WAAW;AAAA,IACvC,WAAWA,MAAK,aAAa,YAAY;AAAA,EAC3C;AACF;;;AC7DA,SAAS,SAAAC,QAAO,YAAAC,WAAU,QAAAC,OAAM,aAAAC,kBAAiB;AACjD,SAAS,YAAAC,iBAAgB;;;ACCzB,SAAS,YAAAC,WAAU,aAAAC,kBAAiB;AACpC,SAAS,UAAU,WAAAC,gBAAe;AAE3B,IAAM,iBAAiB;AACvB,IAAM,eAAe,wBAAwB,cAAc;AAC3D,IAAM,aAAa,wBAAwB,cAAc;AAGhE,IAAM,eACJ;AAQK,SAAS,cAAsB;AACpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAOO,SAAS,mBAAmB,aAA6B;AAC9D,SAAO;AAAA,IACL,KAAK,WAAW;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,eAAsB,cAAc,MAAc,aAA4C;AAC5F,MAAI;AACJ,MAAI;AACF,eAAW,MAAMF,UAAS,MAAM,MAAM;AAAA,EACxC,QAAQ;AACN,eAAW;AAAA,EACb;AAEA,QAAM,QAAQ,YAAY;AAE1B,MAAI,aAAa,MAAM;AAGrB,UAAM,OAAO,eAAe,SAASE,SAAQ,IAAI,CAAC,KAAK;AACvD,UAAMD,WAAU,MAAM,mBAAmB,IAAI,IAAI,OAAO,QAAQ,MAAM,MAAM;AAC5E,WAAO,EAAE,SAAS,MAAM,SAAS,OAAO,SAAS,MAAM;AAAA,EACzD;AASA,QAAM,WAAW,SAAS,QAAQ,cAAc,EAAE;AAClD,QAAM,OAAO,SAAS,QAAQ,QAAQ,EAAE;AACxC,QAAM,UAAU,KAAK,SAAS,GAAG,IAAI;AAAA;AAAA,EAAO,KAAK;AAAA,IAAO,GAAG,KAAK;AAAA;AAEhE,MAAI,YAAY,UAAU;AACxB,WAAO,EAAE,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;AAAA,EACzD;AAEA,QAAMA,WAAU,MAAM,SAAS,MAAM;AACrC,SAAO,EAAE,SAAS,OAAO,SAAS,MAAM,SAAS,MAAM;AACzD;;;ADzMA,IAAM,oBAA0D;AAAA,EAC9D;AAAA,IACE,SAAS;AAAA,IACT,OAAO;AAAA,EACT;AAAA,EACA;AAAA,IACE,SACE;AAAA,IAEF,OAAO;AAAA,EACT;AACF;AAEA,eAAe,OAAO,MAAgC;AACpD,MAAI;AACF,UAAME,MAAK,IAAI;AACf,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,UAAU,MAAgC;AACvD,QAAM,MAAM,MAAM,OAAO,IAAI;AAC7B,QAAMC,OAAM,MAAM,EAAE,WAAW,KAAK,CAAC;AACrC,SAAO,CAAC;AACV;AAEA,eAAe,eAAe,MAAgC;AAC5D,MAAI,WAAW;AACf,MAAI;AACF,eAAW,MAAMC,UAAS,MAAM,MAAM;AAAA,EACxC,QAAQ;AAAA,EAER;AACA,QAAM,UAAU,IAAI,IAAI,SAAS,MAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACpE,QAAM,UAAU,kBAAkB,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,KAAK,CAAC;AACrE,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM,KAAK,EAAE,OAAO;AAAA,EAAK,EAAE,KAAK,EAAE,EAAE,KAAK,IAAI,IAAI;AAC5E,QAAM,YACH,SAAS,WAAW,KAAK,SAAS,SAAS,IAAI,IAAI,KAAK,SACxD,SAAS,SAAS,OAAO,MAC1B;AACF,QAAMC,WAAU,MAAM,WAAW,UAAU,MAAM;AACjD,SAAO;AACT;AAEA,eAAsB,UAAU,OAA+C;AAC7E,QAAM,eAAe,MAAM,UAAU,MAAM,QAAQ;AACnD,QAAM,iBAAiB,MAAM,UAAU,MAAM,UAAU;AACvD,QAAM,mBAAmB,MAAM,eAAe,MAAM,SAAS;AAE7D,QAAM,wBAAwB,MAAM,OAAO,MAAM,QAAQ;AACzD,QAAM,QAAQ,MAAM,cAAc,MAAM,UAAUC,UAAS,MAAM,WAAW,CAAC;AAE7E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,MAAM;AAAA,IACvB,iBAAiB,MAAM,WAAW,CAAC;AAAA,EACrC;AACF;;;A1BxEA,IAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AA6BD,eAAsB,YACpB,gBACA,OAAoB,CAAC,GACA;AACrB,QAAM,cAAc,QAAQ,cAAc;AAC1C,QAAM,QAAQ,aAAa,WAAW;AACtC,QAAM,QAAQ,KAAK,IAAI;AACvB,QAAM,UAAU,CAAC,KAAK;AAEtB,MAAI,QAAS,KAAI,KAAK,YAAY,WAAW,EAAE;AAE/C,QAAM,OAA+B,KAAK,gBAAgB,OAAO,MAAM,UAAU,KAAK;AACtF,MAAI,WAAW,MAAM;AACnB,QAAI,KAAK,aAAc,KAAI,KAAK,2BAA2B;AAC3D,QAAI,KAAK,eAAgB,KAAI,KAAK,qBAAqB;AACvD,QAAI,KAAK,iBAAkB,KAAI,KAAK,sBAAsB;AAC1D,QAAI,KAAK,iBAAiB;AACxB,UAAI,KAAK,8DAAyD;AAClE,UAAI;AAAA,QACF;AAAA,MACF;AAAA,IACF,WAAW,KAAK,iBAAiB;AAC/B,UAAI,KAAK,qBAAqB;AAAA,IAChC;AAAA,EACF;AAEA,QAAM,SAAuB,CAAC;AAC9B,mBAAiB,QAAQ,KAAK,WAAW,EAAG,QAAO,KAAK,IAAI;AAC5D,MAAI,QAAS,KAAI,KAAK,YAAY,OAAO,MAAM,QAAQ;AAEvD,QAAM,WAAW,OAAO,OAAO,CAAC,MAAM,cAAc,IAAI,EAAE,GAAG,CAAC;AAC9D,QAAM,YAAY,MAAM,eAAe,MAAM,UAAU;AACvD,QAAM,EAAE,QAAQ,OAAO,QAAQ,UAAU,YAAY,IAAI,MAAM;AAAA,IAC7D;AAAA,IACA;AAAA,IACA,EAAE,MAAM,KAAK,KAAK;AAAA,EACpB;AACA,MAAI,SAAS;AACX,QAAI;AAAA,MACF,YAAY,OAAO,MAAM,WAAW,MAAM,gBAAa,QAAQ,eAC5D,cAAc,KAAK,WAAW,aAAa,MAC5C,KAAK,OAAO,SAAS,SAAS,MAAM;AAAA,IACxC;AAAA,EACF;AAEA,QAAM,QAAQ,MAAM,WAAW,aAAa,MAAM;AAClD,QAAM,cAAc,iBAAiB,KAAK;AAE1C,QAAM,WAAW,MAAM,WAAW,KAAK;AACvC,QAAM,iBAAiB,MAAM,aAAa,WAAW;AACrD,QAAM,gBAAgB,MAAM,YAAY,KAAK;AAE7C,MAAI,SAAS;AACX,QAAI;AAAA,MACF,WAAW,MAAM,SAAS,WAAM,MAAM,YAAY,aAAa,MAAM,UAAU;AAAA,IACjF;AACA,QAAI,KAAK,WAAW,MAAM,WAAW,WAAM,OAAO,KAAK,WAAW,EAAE,MAAM,QAAQ;AAAA,EACpF;AAEA,QAAM,aAAa,KAAK,IAAI,IAAI;AAChC,MAAI,QAAS,KAAI,KAAK,YAAY,aAAa,KAAM,QAAQ,CAAC,CAAC,GAAG;AAElE,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,QAAQ,OAAO;AAAA,IACf,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM;AAAA,IACjB;AAAA,EACF;AACF;;;A4BrIA,SAAS,cAAAC,aAAY,SAAAC,QAAO,YAAAC,WAAU,aAAAC,kBAAiB;AACvD,SAAS,WAAAC,gBAAe;;;ACuBjB,IAAM,uBAAuB;AAEpC,IAAM,SAAS,KAAK,KAAK,KAAK;AAGvB,SAAS,aAAqB;AACnC,QAAM,MAAM,OAAO,QAAQ,IAAI,uBAAuB;AACtD,QAAM,OAAO,OAAO,SAAS,GAAG,KAAK,MAAM,IAAI,MAAM;AACrD,SAAO,OAAO;AAChB;AAIO,SAAS,UAAU,QAA8B;AACtD,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAEO,SAAS,aAAyB;AACvC,SAAO;AAAA,IACL,gBAAgB;AAAA,IAChB,OAAM,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,IAC9B,OAAO,CAAC;AAAA,EACV;AACF;AAGA,SAAS,YAAY,QAAgB,MAAc,IAAoB;AACrE,QAAM,SAAS,KAAK,MAAM,MAAM;AAChC,MAAI,CAAC,OAAO,SAAS,MAAM,EAAG,QAAO;AACrC,QAAM,KAAK,OAAO;AAClB,MAAI,MAAM,EAAG,QAAO;AACpB,SAAO,KAAK,IAAI,EAAE,KAAK,MAAM,MAAM,EAAE;AACvC;AAMO,SAAS,UAAU,OAAmB,IAA6B;AACxE,QAAM,IAAI,UAAU,GAAG,MAAM;AAC7B,MAAI,KAAK,KAAK,CAAC,GAAG,KAAM,QAAO;AAC/B,QAAM,MAAM,KAAK,MAAM,GAAG,EAAE;AAC5B,MAAI,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAElC,QAAM,KAAK,WAAW;AACtB,QAAM,OAAO,MAAM,MAAM,GAAG,IAAI;AAChC,MAAI,MAAM;AACR,UAAM,UAAU,KAAK,UAAU,YAAY,KAAK,QAAQ,KAAK,EAAE,IAAI;AACnE,UAAM,MAAM,GAAG,IAAI,IAAI,EAAE,OAAO,KAAK,QAAQ,GAAG,SAAS,QAAQ,GAAG,GAAG;AAAA,EACzE,OAAO;AACL,UAAM,MAAM,GAAG,IAAI,IAAI,EAAE,OAAO,GAAG,SAAS,GAAG,QAAQ,GAAG,GAAG;AAAA,EAC/D;AACA,SAAO;AACT;AAIO,SAAS,gBAAgB,OAAmB,OAAoC;AACrF,QAAM,KAAK,WAAW;AACtB,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,CAAC,MAAMC,KAAI,KAAK,OAAO,QAAQ,MAAM,KAAK,GAAG;AACtD,UAAM,MAAMA,MAAK,UAAU,YAAYA,MAAK,QAAQ,OAAO,EAAE;AAC7D,QAAI,MAAM,KAAM,KAAI,IAAI,MAAM,GAAG;AAAA,EACnC;AACA,SAAO;AACT;AAGO,SAAS,iBAAiB,QAAmC;AAClE,QAAM,QAAQ,WAAW;AACzB,aAAW,MAAM,OAAQ,WAAU,OAAO,EAAE;AAC5C,SAAO;AACT;;;ADlGA,eAAsB,eAAe,MAAmC;AACtE,MAAI;AACF,UAAM,MAAM,MAAMC,UAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QACE,OAAO,mBAAmB,wBAC1B,OAAO,OAAO,UAAU,YACxB,OAAO,UAAU,MACjB;AACA,aAAO,WAAW;AAAA,IACpB;AACA,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,MAAM,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO,WAAW,EAAE;AAAA,MACnE,OAAO,OAAO;AAAA,IAChB;AAAA,EACF,QAAQ;AACN,WAAO,WAAW;AAAA,EACpB;AACF;AAEA,eAAsB,gBAAgB,MAAc,OAAkC;AACpF,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAMC,WAAU,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM;AAAA,EACrE,QAAQ;AAAA,EAER;AACF;AAEA,eAAsB,cAAc,MAAsC;AACxE,MAAI;AACF,UAAM,MAAM,MAAMH,UAAS,MAAM,MAAM;AACvC,UAAM,MAAqB,CAAC;AAC5B,eAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,YAAM,IAAI,KAAK,KAAK;AACpB,UAAI,CAAC,EAAG;AACR,UAAI;AACF,cAAM,KAAK,KAAK,MAAM,CAAC;AACvB,YACE,MACA,OAAO,GAAG,OAAO,YACjB,OAAO,GAAG,SAAS,YACnB,OAAO,GAAG,WAAW,UACrB;AACA,cAAI,KAAK,EAAE;AAAA,QACb;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAsB,aAAa,MAAc,IAAgC;AAC/E,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAME,YAAW,MAAM,KAAK,UAAU,EAAE,IAAI,MAAM,MAAM;AAAA,EAC1D,QAAQ;AAAA,EAER;AACF;;;AE/DA,IAAM,sBAAsB;AAErB,IAAM,eAAN,MAAM,cAAa;AAAA,EAKhB,YACW,eACA,WACjB,OACA;AAHiB;AACA;AAGjB,SAAK,QAAQ;AAAA,EACf;AAAA,EALmB;AAAA,EACA;AAAA,EANX;AAAA,EACA,QAAQ;AAAA,EACR,QAA8C;AAAA;AAAA;AAAA,EAYtD,aAAa,KAAK,eAAuB,WAA0C;AACjF,QAAI,QAAQ,MAAM,eAAe,SAAS;AAC1C,QAAI,OAAO,KAAK,MAAM,KAAK,EAAE,WAAW,GAAG;AACzC,YAAM,SAAS,MAAM,cAAc,aAAa;AAChD,UAAI,OAAO,SAAS,EAAG,SAAQ,iBAAiB,MAAM;AAAA,IACxD;AACA,WAAO,IAAI,cAAa,eAAe,WAAW,KAAK;AAAA,EACzD;AAAA;AAAA;AAAA,EAIA,MAAM,OAAO,IAAgC;AAC3C,UAAM,aAAa,KAAK,eAAe,EAAE;AACzC,cAAU,KAAK,OAAO,EAAE;AACxB,SAAK,gBAAgB;AAAA,EACvB;AAAA;AAAA,EAGA,gBAAgB,QAAgB,KAAK,IAAI,GAAwB;AAC/D,WAAO,gBAAgB,KAAK,OAAO,KAAK;AAAA,EAC1C;AAAA,EAEQ,kBAAwB;AAC9B,SAAK,QAAQ;AACb,QAAI,KAAK,MAAO;AAChB,SAAK,QAAQ,WAAW,MAAM;AAC5B,WAAK,QAAQ;AACb,WAAK,KAAK,MAAM;AAAA,IAClB,GAAG,mBAAmB;AAEtB,SAAK,MAAM,QAAQ;AAAA,EACrB;AAAA;AAAA;AAAA,EAIA,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAO;AACd,mBAAa,KAAK,KAAK;AACvB,WAAK,QAAQ;AAAA,IACf;AACA,QAAI,CAAC,KAAK,MAAO;AACjB,SAAK,QAAQ;AACb,SAAK,MAAM,QAAO,oBAAI,KAAK,GAAE,YAAY;AACzC,UAAM,gBAAgB,KAAK,WAAW,KAAK,KAAK;AAAA,EAClD;AACF;;;ACzDA,SAAS,IAAI,MAAc,UAA0B;AACnD,QAAM,IAAI,QAAQ,IAAI,IAAI;AAC1B,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,IAAI,OAAO,CAAC;AAClB,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAEA,SAAS,IAAsB,MAAc,UAAgB;AAC3D,SAAQ,QAAQ,IAAI,IAAI,KAAW;AACrC;AAEO,SAAS,aAA4B;AAC1C,SAAO;AAAA,IACL,kBAAkB,IAAI,2BAA2B,GAAI;AAAA,IACrD,kBAAkB,IAAI,uBAAuB,IAAI;AAAA,IACjD,kBAAkB,IAAI,uBAAuB,GAAG;AAAA,IAChD,qBAAqB,IAAI,8BAA8B,IAAK;AAAA,IAC5D,yBAAyB,IAAI,mCAAmC,CAAC;AAAA,IACjE,qBAAqB,IAAI,8BAA8B,GAAG;AAAA;AAAA;AAAA;AAAA,IAI1D,mBAAmB,IAAI,2BAA2B,GAAI;AAAA,IACtD,aAAa,CAAC,QAAQ,IAAI;AAAA;AAAA;AAAA;AAAA,IAI1B,aAAa,CAAC,QAAQ,IAAI;AAAA,IAC1B,SAAS,QAAQ,IAAI,eAAe,IAAI,gBAAgB,CAAC,IAAI;AAAA,IAC7D,eAAe,IAAI,sBAAsB,IAAI;AAAA,IAC7C,UAAU,IAAI,iBAAiB,MAAe;AAAA,IAC9C,WAAW,IAAI,kBAAkB,QAAiB;AAAA,EACpD;AACF;;;AC1CA,SAAS,cAAAC,aAAY,SAAAC,cAAa;AAClC,SAAS,WAAAC,gBAAe;;;ACaxB,IAAM,iBAAiB;AAKvB,IAAM,0BAA0B;AAEhC,SAAS,gBAAwB;AAC/B,QAAM,MAAM,OAAO,QAAQ,IAAI,mBAAmB;AAClD,SAAO,OAAO,SAAS,GAAG,KAAK,OAAO,IAAI,MAAM;AAClD;AAaA,IAAMC,aAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AAEM,SAAS,cAAc,OAAyB;AACrD,QAAM,SAAS,MACZ,YAAY,EACZ,MAAM,cAAc,EACpB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAACA,WAAU,IAAI,CAAC,CAAC;AAElD,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,KAAK,QAAQ;AACtB,aAAS,IAAI,CAAC;AACd,UAAM,QAAQ,EAAE,MAAM,gBAAgB,KAAK,CAAC;AAC5C,eAAW,KAAK,MAAO,KAAI,EAAE,SAAS,EAAG,UAAS,IAAI,CAAC;AAAA,EACzD;AACA,SAAO,MAAM,KAAK,QAAQ;AAC5B;AAEA,SAAS,mBAAmB,OAA2D;AACrF,QAAM,MAAM,oBAAI,IAA0B;AAC1C,MAAI,CAAC,MAAO,QAAO;AACnB,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,SAAU;AACzB,UAAM,OAAO,IAAI,IAAI,EAAE,IAAI,KAAK,CAAC;AACjC,SAAK,KAAK,CAAC;AACX,QAAI,IAAI,EAAE,MAAM,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAA0D;AAElF,QAAM,MAAM,oBAAI,IAAyB;AACzC,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,KAAK,MAAM,MAAO,KAAI,EAAE,SAAS,OAAQ,UAAS,IAAI,EAAE,IAAI,EAAE,IAAI;AAC7E,aAAW,KAAK,MAAM,OAAiB;AACrC,QAAI,EAAE,SAAS,UAAW;AAC1B,UAAM,OAAO,SAAS,IAAI,EAAE,IAAI;AAChC,UAAM,KAAK,SAAS,IAAI,EAAE,EAAE;AAC5B,QAAI,CAAC,QAAQ,CAAC,GAAI;AAClB,UAAM,IAAI,IAAI,IAAI,IAAI,KAAK,oBAAI,IAAY;AAC3C,MAAE,IAAI,EAAE;AACR,QAAI,IAAI,MAAM,CAAC;AAAA,EACjB;AACA,SAAO;AACT;AAEO,SAAS,WAAW,QAAkC;AAC3D,QAAM,UAAU,IAAI,IAAI,cAAc,OAAO,KAAK,CAAC;AACnD,QAAM,gBAAgB,mBAAmB,OAAO,KAAK;AACrD,QAAM,cAAc,iBAAiB,OAAO,KAAK;AAEjD,QAAM,QAAQ,IAAI,IAAY,OAAO,qBAAqB,CAAC,CAAC;AAC5D,aAAW,KAAK,OAAO,uBAAuB,CAAC,EAAG,OAAM,IAAI,CAAC;AAS7D,QAAM,aAAa,OAAO,WAAW;AACrC,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,OAAO,YAAY;AACjC,eAAW,MAAM,EAAE,UAAU;AAC3B,UAAI,QAAQ,IAAI,EAAE,EAAG,SAAQ,IAAI,KAAK,QAAQ,IAAI,EAAE,KAAK,KAAK,CAAC;AAAA,IACjE;AAAA,EACF;AACA,QAAM,MAAM,CAAC,UAA0B;AACrC,UAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAChC,QAAI,KAAK,EAAG,QAAO;AACnB,WAAO,KAAK,IAAI,KAAK,aAAa,IAAI,QAAQ,IAAI,IAAI;AAAA,EACxD;AACA,MAAI,SAAS;AACb,MAAI,WAAW;AACf,aAAW,KAAK,SAAS;AACvB,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,IAAI,GAAG;AACT,gBAAU;AACV,kBAAY;AAAA,IACd;AAAA,EACF;AACA,QAAM,SAAS,WAAW,IAAI,SAAS,WAAW;AAGlD,QAAM,SAAuB,CAAC;AAC9B,aAAW,QAAQ,OAAO,YAAY;AACpC,UAAM,UAAoB,CAAC;AAC3B,QAAIC,SAAQ;AAIZ,QAAI,SAAS;AACb,QAAI,UAAU;AACd,eAAW,MAAM,KAAK,UAAU;AAC9B,UAAI,CAAC,QAAQ,IAAI,EAAE,EAAG;AACtB,gBAAU;AACV,iBAAW,kBAAkB,IAAI,EAAE,IAAI;AAAA,IACzC;AACA,QAAI,QAAQ;AACV,MAAAA,UAAS;AACT,cAAQ,KAAK,MAAM,MAAM,EAAE;AAAA,IAC7B;AAGA,UAAM,UAAU,cAAc,IAAI,KAAK,IAAI,KAAK,CAAC;AACjD,QAAI,UAAU;AACd,QAAI,WAAW;AACf,eAAW,OAAO,SAAS;AACzB,YAAM,OAAO,IAAI,KAAK,YAAY;AAClC,UAAI,QAAQ,IAAI,IAAI,GAAG;AACrB,mBAAW;AACX,oBAAY;AAAA,MACd,OAAO;AAEL,mBAAW,KAAK,SAAS;AACvB,cAAI,KAAK,SAAS,CAAC,KAAK,EAAE,SAAS,IAAI,GAAG;AACxC,uBAAW;AACX;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS;AACX,MAAAA,UAAS;AACT,cAAQ,KAAK,OAAO,OAAO,EAAE;AAAA,IAC/B;AAGA,UAAM,YAAY,KAAK,KAAK,YAAY;AACxC,QAAI,WAAW;AACf,eAAW,KAAK,QAAS,KAAI,UAAU,SAAS,CAAC,EAAG,aAAY;AAChE,QAAI,UAAU;AACZ,MAAAA,UAAS;AACT,cAAQ,KAAK,QAAQ,QAAQ,EAAE;AAAA,IACjC;AAEA,QAAI,MAAM,IAAI,KAAK,IAAI,GAAG;AACxB,MAAAA,UAAS;AACT,cAAQ,KAAK,MAAM;AAAA,IACrB;AAEA,WAAO,KAAK,EAAE,MAAM,OAAAA,QAAO,SAAS,SAAS,SAAS,CAAC;AAAA,EACzD;AAGA,QAAM,gBAAgB,IAAI,IAAI,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC;AACvF,MAAI,cAAc,OAAO,GAAG;AAC1B,eAAW,KAAK,QAAQ;AACtB,UAAI,EAAE,QAAQ,EAAG;AAEjB,UAAI,cAAc;AAClB,iBAAW,CAAC,MAAM,GAAG,KAAK,aAAa;AACrC,YAAI,CAAC,cAAc,IAAI,IAAI,EAAG;AAC9B,YAAI,IAAI,IAAI,EAAE,KAAK,IAAI,GAAG;AACxB,yBAAe;AACf;AAAA,QACF;AAAA,MACF;AACA,UAAI,aAAa;AACf,UAAE,SAAS,cAAc;AACzB,UAAE,QAAQ,KAAK,SAAS;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAOA,QAAM,QAAQ,OAAO;AACrB,MAAI,SAAS,MAAM,OAAO,GAAG;AAC3B,QAAI,OAAO;AACX,eAAW,KAAK,MAAM,OAAO,EAAG,KAAI,IAAI,KAAM,QAAO;AACrD,QAAI,OAAO,GAAG;AACZ,YAAM,MAAM,cAAc;AAC1B,iBAAW,KAAK,QAAQ;AACtB,YAAI,EAAE,SAAS,EAAG;AAClB,cAAM,IAAI,MAAM,IAAI,EAAE,KAAK,IAAI,KAAK;AACpC,YAAI,KAAK,EAAG;AACZ,UAAE,SAAS,OAAO,IAAI;AACtB,UAAE,QAAQ,KAAK,WAAQ,KAAK,MAAM,CAAC,CAAC,EAAE;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,SAAO;AACT;;;AC5PA,eAAsB,SACpB,OACA,OACA,UAA2B,CAAC,GACF;AAC1B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,UAAU,cAAc,KAAK;AAEnC,QAAM,WAAuB,MAAM,MAAM,OAAO,CAAC,MAAqB,EAAE,SAAS,MAAM;AAEvF,MAAI,SAAS,WAAW,KAAK,QAAQ,WAAW,GAAG;AACjD,WAAO;AAAA,MACL,OAAO,CAAC;AAAA,MACR,YAAY;AAAA,MACZ,QAAQ,QAAQ,WAAW,IAAI,gBAAgB;AAAA,MAC/C,eAAe;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,aAAyB;AAAA,IAC7B,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,qBAAqB,QAAQ;AAAA,IAC7B,mBAAmB,QAAQ;AAAA,IAC3B,aAAa,QAAQ;AAAA,EACvB;AACA,QAAM,SAAS,WAAW,UAAU;AACpC,QAAM,WAAW,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;AAEjD,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,MACL,OAAO,CAAC;AAAA,MACR,YAAY;AAAA,MACZ,QAAQ,kBAAkB,KAAK,UAAU,OAAO,CAAC;AAAA,MACjD,eAAe;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,YAAY,SAAS,MAAM,GAAG,IAAI;AACxC,QAAM,MAAM,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI;AACvC,QAAM,gBAAgB,UAAU,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC;AAC1D,QAAM,WAAW,SAAS,CAAC,GAAG,SAAS;AACvC,QAAM,cAAc,SAAS,CAAC,GAAG,SAAS;AAK1C,MAAI;AACJ,MAAI,SAAS,WAAW,EAAG,cAAa;AAAA,WAC/B,YAAY,KAAK,YAAY,cAAc,EAAG,cAAa;AAAA,WAC3D,YAAY,EAAG,cAAa;AAAA,MAChC,cAAa;AAElB,QAAM,UAAU,SACb,MAAM,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,CAAC,EAChC,IAAI,CAAC,MAAM,GAAG,EAAE,KAAK,IAAI,KAAK,EAAE,QAAQ,KAAK,GAAG,CAAC,GAAG,EACpD,KAAK,IAAI;AAEZ,SAAO;AAAA,IACL,OAAO;AAAA,IACP;AAAA,IACA,QAAQ,QAAQ,OAAO;AAAA,IACvB;AAAA,EACF;AACF;;;ACtFA,SAAS,YAAAC,iBAAgB;AACzB,SAAS,YAAAC,kBAAgB;AACzB,SAAS,QAAAC,aAAY;AACrB,SAAS,aAAAC,kBAAiB;AAE1B,IAAMC,iBAAgBD,WAAUH,SAAQ;AAExC,eAAsB,cAAc,aAAsC;AAGxE,MAAI;AACF,UAAM,WAAWE,MAAK,aAAa,QAAQ,MAAM;AACjD,UAAM,OAAO,MAAMD,WAAS,UAAU,MAAM;AAC5C,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,QAAQ,QAAQ,MAAM,4BAA4B;AACxD,QAAI,QAAQ,CAAC,EAAG,QAAO,MAAM,CAAC;AAAA,EAEhC,QAAQ;AAAA,EAER;AAEA,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAMG,eAAc,OAAO,CAAC,UAAU,gBAAgB,GAAG;AAAA,MAC1E,KAAK;AAAA,IACP,CAAC;AACD,UAAM,OAAO,OAAO,KAAK;AACzB,QAAI,KAAM,QAAO;AAAA,EACnB,QAAQ;AAAA,EAER;AAEA,SAAO;AACT;AAEA,eAAsB,cAAc,aAAsC;AACxE,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAMA;AAAA,MACvB;AAAA,MACA,CAAC,gBAAgB,4BAA4B,SAAS;AAAA,MACtD,EAAE,KAAK,YAAY;AAAA,IACrB;AACA,UAAM,UAAU,OAAO,KAAK;AAC5B,UAAM,QAAQ,QAAQ,MAAM,gBAAgB;AAC5C,QAAI,QAAQ,CAAC,EAAG,QAAO,MAAM,CAAC;AAAA,EAChC,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB,MAAsB;AACvD,SAAO,KAAK,WAAW,KAAK,GAAG,EAAE,WAAW,MAAM,GAAG;AACvD;AAQO,SAAS,mBACd,YACA,QACA,WACmB;AACnB,MAAI,WAAW;AACb,WAAO;AAAA,MACL,cAAcF,MAAK,YAAY,oBAAoB;AAAA,MACnD,WAAWA,MAAK,YAAY,YAAY;AAAA,MACxC,WAAW;AAAA,IACb;AAAA,EACF;AACA,QAAM,YAAYA,MAAK,YAAY,YAAY,mBAAmB,MAAM,CAAC;AACzE,SAAO;AAAA,IACL,cAAcA,MAAK,WAAW,oBAAoB;AAAA,IAClD,WAAWA,MAAK,WAAW,YAAY;AAAA,IACvC;AAAA,EACF;AACF;;;AC5EA,SAAS,SAAAG,QAAO,YAAAC,YAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,gBAAe;AAYxB,IAAM,cAAc;AAEb,SAAS,gBAAgB,SAAyB,QAA2B;AAElF,QAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,QAAQ;AAC/D,QAAM,cAAc,MAAM,CAAC,GAAG,WAAW;AAEzC,QAAM,eAAe,QAClB,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EACnC,MAAM,CAAC,WAAW,EAClB,IAAI,CAAC,MAAM,EAAE,OAAO;AAEvB,QAAM,YAAY,QACf,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAC/B,MAAM,CAAC,WAAW,EAClB,IAAI,CAAC,MAAM,EAAE,OAAO;AAEvB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAM,oBAAI,KAAK,GAAE,YAAY;AAAA,EAC/B;AACF;AAEO,SAAS,gBAAgB,KAAwB;AACtD,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,oBAAe,IAAI,MAAM,EAAE;AACtC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,aAAa,IAAI,IAAI,GAAG;AACnC,QAAM,KAAK,EAAE;AAEb,MAAI,IAAI,aAAa;AACnB,UAAM,KAAK,iBAAiB;AAC5B,UAAM,KAAK,IAAI,WAAW;AAC1B,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,IAAI,aAAa,QAAQ;AAC3B,UAAM,KAAK,kBAAkB;AAC7B,eAAW,KAAK,IAAI,aAAc,OAAM,KAAK,KAAK,CAAC,EAAE;AACrD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,IAAI,UAAU,QAAQ;AACxB,UAAM,KAAK,eAAe;AAC1B,eAAW,KAAK,IAAI,UAAW,OAAM,KAAK,KAAK,CAAC,EAAE;AAClD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,CAAC,IAAI,eAAe,CAAC,IAAI,aAAa,UAAU,CAAC,IAAI,UAAU,QAAQ;AACzE,UAAM,KAAK,qEAAgE;AAC3E,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,eAAsB,eAAe,MAAc,KAA+B;AAChF,QAAMH,OAAMG,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAMD,WAAU,MAAM,gBAAgB,GAAG,GAAG,MAAM;AACpD;;;AC7EA,SAAS,SAAAE,QAAO,YAAAC,YAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,gBAAe;AAoBxB,IAAMC,kBAAiB;AAEvB,eAAsB,YAAY,MAAuC;AACvE,MAAI;AACF,UAAM,MAAM,MAAMH,WAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,WAAO,MAAM,QAAQ,OAAO,OAAO,IAAI,OAAO,UAAU,CAAC;AAAA,EAC3D,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAsB,aAAa,MAAc,SAAwC;AACvF,QAAMD,OAAMG,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,QAAe,EAAE,gBAAgBC,iBAAgB,QAAQ;AAC/D,QAAMF,WAAU,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM;AACrE;AAEA,eAAsB,YAAY,MAAc,OAAoC;AAClF,QAAM,UAAU,MAAM,YAAY,IAAI;AACtC,UAAQ,KAAK,KAAK;AAClB,QAAM,aAAa,MAAM,OAAO;AAClC;;;AC5BA,eAAsB,oBACpB,OACA,UACuB;AACvB,QAAM,SAAS,YAAa,MAAM,cAAc,MAAM,WAAW;AACjE,QAAM,MAAM,MAAM,cAAc,MAAM,WAAW;AACjD,QAAM,YAAY,WAAW;AAC7B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,OAAO,mBAAmB,MAAM,YAAY,QAAQ,SAAS;AAAA,EAC/D;AACF;AAgBA,eAAsB,cACpB,OACA,OACyB;AACzB,QAAM,SAAS,MAAM,oBAAoB,KAAK;AAC9C,QAAM,QAAsB;AAAA,IAC1B,MAAM,MAAM;AAAA,IACZ,SAAS,MAAM;AAAA,IACf,MAAM,MAAM,QAAQ,CAAC;AAAA,IACrB,OAAO,MAAM,SAAS,CAAC;AAAA,IACvB,OAAM,oBAAI,KAAK,GAAE,YAAY;AAAA,EAC/B;AACA,QAAM,YAAY,OAAO,MAAM,cAAc,KAAK;AAGlD,QAAM,UAAU,MAAM,YAAY,OAAO,MAAM,YAAY;AAC3D,QAAM,KAAK,gBAAgB,SAAS,OAAO,MAAM;AACjD,QAAM,eAAe,OAAO,MAAM,WAAW,EAAE;AAE/C,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,OAAO;AAAA,IACf,WAAW,OAAO,MAAM;AAAA,IACxB,eAAe,OAAO,MAAM;AAAA,EAC9B;AACF;AAcA,eAAsB,cACpB,OACA,QAAqB,CAAC,GACC;AACvB,QAAM,SAAS,MAAM,oBAAoB,OAAO,MAAM,MAAM;AAC5D,MAAI,UAAU,MAAM,YAAY,OAAO,MAAM,YAAY;AACzD,MAAI,MAAM,KAAM,WAAU,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,IAAI;AACrE,MAAI,MAAM,SAAS,MAAM,QAAQ,EAAG,WAAU,QAAQ,MAAM,CAAC,MAAM,KAAK;AACxE,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf;AAAA,IACA,WAAW,OAAO,MAAM;AAAA,EAC1B;AACF;AAEA,eAAsB,iBAAiB,OAAqB,gBAAyB;AACnF,QAAM,SAAS,MAAM,oBAAoB,OAAO,cAAc;AAC9D,QAAM,UAAU,MAAM,YAAY,OAAO,MAAM,YAAY;AAC3D,QAAM,KAAK,gBAAgB,SAAS,OAAO,MAAM;AACjD,QAAM,eAAe,OAAO,MAAM,WAAW,EAAE;AAC/C,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,MAAM,OAAO,MAAM;AAAA,IACnB,aAAa,QAAQ;AAAA,EACvB;AACF;;;AC9FO,SAAS,WAAW,QAA8B;AACvD,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,mCAA8B,KAAK,UAAU,OAAO,KAAK,CAAC;AAAA,CAAI;AAEzE,MAAI,OAAO,MAAM,WAAW,GAAG;AAC7B,UAAM,KAAK,2CAA2C;AAAA,EACxD;AAEA,aAAW,KAAK,OAAO,OAAO;AAC5B,UAAM,UAAU,EAAE,SAAS,MAAM,EAAE,IAAI,OAAO,EAAE,MAAM,OAAO,MAAM,EAAE,IAAI;AACzE,UAAM,KAAK,OAAO;AAElB,QAAI,EAAE,WAAW,WAAW,GAAG;AAC7B,YAAM,KAAK,0BAA0B;AAAA,IACvC,OAAO;AACL,YAAM,KAAK,iBAAiB;AAC5B,iBAAW,KAAK,EAAE,WAAY,OAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACnD;AAEA,QAAI,EAAE,aAAa,KAAK,EAAE,SAAS,GAAG;AACpC,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,aAAa;AACxB,YAAM,KAAK,KAAK;AAChB,YAAM,KAAK,EAAE,aAAa,QAAQ,CAAC;AACnC,YAAM,KAAK,KAAK;AAAA,IAClB;AAEA,QAAI,EAAE,iBAAiB,QAAQ;AAC7B,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,cAAc,EAAE,gBAAgB,KAAK,IAAI,CAAC,EAAE;AAAA,IACzD;AAEA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,OAAO,gBAAgB,KAAK,GAAG;AACjC,UAAM,KAAK,KAAK;AAChB,UAAM,KAAK,0BAA0B;AACrC,UAAM,KAAK,OAAO,eAAe,KAAK,CAAC;AACvC,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,OAAO,WAAW;AACpB,UAAM,KAAK,oCAAoC;AAAA,EACjD;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;;;ACpDA,IAAM,kBAAkB,oBAAI,IAAgB,CAAC,YAAY,UAAU,OAAO,CAAC;AAC3E,IAAM,iBAAiB;AAEvB,SAAS,WAAW,SAAiB,WAAmB,SAAyB;AAC/E,QAAM,QAAQ,QAAQ,MAAM,OAAO;AACnC,SAAO,MAAM,MAAM,KAAK,IAAI,GAAG,YAAY,CAAC,GAAG,OAAO,EAAE,KAAK,IAAI;AACnE;AAEA,SAAS,YAAY,MAAc,SAA8B;AAC/D,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,QAAQ,IAAI,KAAK,EAAG,QAAO;AAC/B,aAAW,KAAK,SAAS;AACvB,QAAI,MAAM,SAAS,CAAC,KAAK,EAAE,SAAS,KAAK,EAAG,QAAO;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,SAAS,MAAsB;AACtC,MAAI,KAAK,UAAU,eAAgB,QAAO;AAC1C,SAAO,KAAK,MAAM,GAAG,cAAc,EAAE,QAAQ,IAAI;AACnD;AAEO,SAAS,mBACd,MACA,SACA,OACA,aACiB;AACjB,MAAI,eAAe,GAAG;AACpB,WAAO,EAAE,MAAM,IAAI,WAAW,GAAG,kBAAkB,CAAC,EAAE;AAAA,EACxD;AAEA,QAAM,UAAU,IAAI,IAAI,cAAc,KAAK,CAAC;AAC5C,QAAM,OAAO,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,QAAQ,gBAAgB,IAAI,EAAE,WAAW,CAAC;AAE7F,QAAM,SAAS,KACZ,IAAI,CAAC,OAAO,EAAE,KAAK,GAAG,OAAO,YAAY,EAAE,MAAM,OAAO,EAAE,EAAE,EAC5D,KAAK,CAAC,GAAG,MAAM;AACd,QAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAE5C,UAAM,QAAQ,EAAE,IAAI,WAAW,EAAE,IAAI,cAAc;AACnD,UAAM,QAAQ,EAAE,IAAI,WAAW,EAAE,IAAI,cAAc;AACnD,WAAO,QAAQ;AAAA,EACjB,CAAC;AAEH,QAAM,QAAkB,CAAC;AACzB,QAAM,UAAoB,CAAC;AAC3B,MAAI,OAAO;AAEX,aAAW,EAAE,KAAK,OAAAG,OAAM,KAAK,QAAQ;AAGnC,QAAIA,WAAU,KAAK,QAAQ,SAAS,EAAG;AAEvC,UAAM,OAAO,SAAS,WAAW,KAAK,SAAS,IAAI,YAAY,IAAI,QAAQ,CAAC;AAC5E,UAAM,SAAS,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,IAAI,IAAI,QAAQ;AAC5E,UAAM,QAAQ,GAAG,MAAM;AAAA,EAAK,IAAI;AAAA;AAChC,QAAI,OAAO,MAAM,SAAS,aAAa;AACrC,UAAI,QAAQ,SAAS,EAAG;AAExB,YAAM,YAAY,KAAK,IAAI,GAAG,cAAc,OAAO,OAAO,SAAS,EAAE;AACrE,UAAI,aAAa,EAAG;AACpB,YAAM,UAAU,KAAK,MAAM,GAAG,SAAS,EAAE,QAAQ,IAAI;AACrD,YAAM,aAAa,GAAG,MAAM;AAAA,EAAK,OAAO;AAAA;AACxC,YAAM,KAAK,UAAU;AACrB,cAAQ,KAAK,IAAI,IAAI;AACrB,cAAQ,WAAW;AACnB;AAAA,IACF;AACA,UAAM,KAAK,KAAK;AAChB,YAAQ,KAAK,IAAI,IAAI;AACrB,YAAQ,MAAM;AAAA,EAChB;AAEA,SAAO,EAAE,MAAM,MAAM,KAAK,IAAI,GAAG,WAAW,MAAM,kBAAkB,QAAQ;AAC9E;;;AClFO,SAAS,kBAAkB,MAAgB,SAAiC;AACjF,QAAM,OAAO,QACV,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,IAAI,EAClC,MAAM,EACN,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAE7C,SAAO,KAAK,IAAI,CAAC,MAAM,IAAI,EAAE,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC,EAAE;AAClE;;;ACPO,SAAS,iBAAiB,OAAoB,MAA4B;AAE/E,QAAM,gBAAgB,oBAAI,IAAsB;AAChD,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,OAAQ,eAAc,IAAI,EAAE,IAAI,CAAC;AAAA,EAClD;AAEA,QAAM,MAAkB,CAAC;AACzB,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,WAAW,EAAE,OAAO,KAAK,GAAI;AAC5C,UAAM,WAAW,cAAc,IAAI,EAAE,IAAI;AACzC,QAAI,YAAY,CAAC,IAAI,SAAS,QAAQ,EAAG,KAAI,KAAK,QAAQ;AAAA,EAC5D;AACA,SAAO;AACT;;;ACYA,IAAM,2BAA2B;AACjC,IAAM,4BAA4B;AAElC,SAASC,oBAAmB,OAAkC;AAC5D,SAAO,MAAM,MAAM,OAAO,CAAC,MAAuB,EAAE,SAAS,QAAQ;AACvE;AAEA,eAAsB,KAAK,OAAmB,MAAyC;AACrF,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,cAAc,eAAe;AACnC,QAAM,cAAc,KAAK,mBAAmB;AAC5C,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,UAAU,KAAK,WAAW,oBAAI,IAAoB;AAExD,QAAM,UAAUA,oBAAmB,KAAK,KAAK;AAE7C,QAAM,WAAgC,CAAC;AACvC,QAAM,mBAA6B,CAAC;AACpC,MAAI,OAAO;AACX,MAAI,YAAY;AAEhB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,kBAAkB,MAAM,OAAO;AAC3C,UAAM,YAAY,eAAe,iBAAiB,KAAK,OAAO,IAAI,IAAI,CAAC;AACvE,UAAM,YAAY,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI;AAE7C,UAAM,aACJ,KAAK,KAAK,SACV,IAAI,KAAK,IAAI,EAAE,SACf,UAAU,KAAK,GAAG,EAAE,SACpB;AAEF,QAAI,OAAO,aAAa,aAAa;AACnC,kBAAY;AACZ;AAAA,IACF;AAEA,UAAM,YAAY,cAAc,OAAO;AACvC,UAAM,eAAe,KAAK,IAAI,KAAK,MAAM,YAAY,WAAW,GAAG,yBAAyB;AAE5F,UAAM,SAAS,mBAAmB,MAAM,SAAS,KAAK,OAAO,YAAY;AAEzE,aAAS,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,QAAQ,QAAQ,IAAI,KAAK,IAAI;AAAA,MAC7B,YAAY;AAAA,MACZ,cAAc,OAAO;AAAA,MACrB,iBAAiB;AAAA,IACnB,CAAC;AAED,YAAQ,aAAa,OAAO;AAC5B,eAAW,KAAK,UAAW,KAAI,CAAC,iBAAiB,SAAS,CAAC,EAAG,kBAAiB,KAAK,CAAC;AAErF,QAAI,QAAQ,aAAa;AACvB,kBAAY;AACZ;AAAA,IACF;AAAA,EACF;AAEA,MAAI,SAAS,SAAS,MAAM,OAAQ,aAAY;AAEhD,QAAM,OAAO,WAAW;AAAA,IACtB,OAAO,KAAK;AAAA,IACZ,OAAO;AAAA,IACP;AAAA,EACF,CAAC;AACD,QAAM,gBAAgB,KAAK,KAAK,KAAK,SAAS,CAAC;AAE/C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,WAAW,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IACrC;AAAA,IACA;AAAA,EACF;AACF;;;AXlFA,IAAM,mBAAmB;AACzB,IAAM,cAAc,EAAE,MAAM,WAAW,SAAS,QAAQ;AAkBxD,IAAM,MAAM;AAAA,EACV,OAAO;AAAA,EACP,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,SAAS,GAAG,IAAe,QAAkC;AAC3D,SAAO,EAAE,SAAS,OAAO,IAAI,OAAO;AACtC;AAEA,SAAS,IAAI,IAAe,MAAc,SAAiB,MAAiC;AAC1F,SAAO,EAAE,SAAS,OAAO,IAAI,OAAO,EAAE,MAAM,SAAS,KAAK,EAAE;AAC9D;AAEA,SAAS,YAAY,MAAc;AACjC,SAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,KAAK,CAAC,GAAG,SAAS,MAAM;AAC7D;AAEA,SAAS,aAAa,SAAiB;AACrC,SAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,QAAQ,CAAC,GAAG,SAAS,KAAK;AACrE;AAEA,IAAM,QAAQ;AAAA,EACZ;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,OAAO;AAAA,IACpB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,QAAQ,EAAE,MAAM,UAAU,aAAa,sCAAsC;AAAA,MAC/E;AAAA,MACA,UAAU,CAAC,QAAQ;AAAA,IACrB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,OAAO;AAAA,IACpB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM,EAAE,MAAM,UAAU,aAAa,8CAAyC;AAAA,QAC9E,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,MAAM,CAAC,YAAY,QAAQ,QAAQ,QAAQ,SAAS;AAAA,UACpD,aAAa;AAAA,QACf;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,aAAa;AAAA,QACf;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,QAAQ,MAAM;AAAA,IAC3B;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,MAAM,CAAC,YAAY,QAAQ,QAAQ,QAAQ,SAAS;AAAA,UACpD,aAAa;AAAA,QACf;AAAA,QACA,QAAQ,EAAE,MAAM,UAAU,aAAa,sCAAsC;AAAA,QAC7E,OAAO,EAAE,MAAM,UAAU,aAAa,yCAAyC;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,UAAU;AAAA,UACR,MAAM;AAAA,UACN,aACE;AAAA,QACJ;AAAA,QACA,OAAO,EAAE,MAAM,UAAU,aAAa,0BAA0B;AAAA,MAClE;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM,EAAE,MAAM,UAAU,aAAa,mCAAmC;AAAA,MAC1E;AAAA,MACA,UAAU,CAAC,MAAM;AAAA,IACnB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,QACA,OAAO,EAAE,MAAM,UAAU,aAAa,mCAAmC;AAAA,MAC3E;AAAA,MACA,UAAU,CAAC,QAAQ;AAAA,IACrB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO,EAAE,MAAM,UAAU,aAAa,qCAAqC;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAe,SACb,MACA,MACA,KACA;AACA,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,cAAc,MAAM,GAAG;AAAA,IAChC,KAAK;AACH,aAAO,UAAU,MAAM,GAAG;AAAA,IAC5B,KAAK;AACH,aAAO,kBAAkB,MAAM,GAAG;AAAA,IACpC,KAAK;AACH,aAAO,gBAAgB,MAAM,GAAG;AAAA,IAClC,KAAK;AACH,aAAO,cAAc,MAAM,GAAG;AAAA,IAChC,KAAK;AACH,aAAO,eAAe,MAAM,GAAG;AAAA,IACjC,KAAK;AACH,aAAO,YAAY,IAAI;AAAA,IACzB,KAAK;AACH,aAAO,YAAY,MAAM,GAAG;AAAA,IAC9B,KAAK;AACH,aAAO,SAAS,MAAM,GAAG;AAAA,IAC3B;AACE,aAAO,aAAa,iBAAiB,IAAI,EAAE;AAAA,EAC/C;AACF;AAEA,SAAS,YAAY,MAA2C;AAC9D,QAAM,OAAO,OAAO,MAAM,SAAS,WAAW,KAAK,OAAO;AAC1D,MAAI,CAAC,KAAM,QAAO,aAAa,2CAA2C;AAC1E,QAAM,SAAS,KAAK,KAAK,KAAK,SAAS,CAAC;AACxC,SAAO,YAAY,KAAK,UAAU,EAAE,QAAQ,QAAQ,oBAAoB,OAAO,KAAK,OAAO,CAAC,CAAC;AAC/F;AAEA,SAAS,YAAY,MAA2C,KAAoB;AAClF,QAAM,YAAY,OAAO,MAAM,WAAW,WAAW,KAAK,OAAO,KAAK,IAAI;AAC1E,QAAM,WAAW,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAC9F,MAAI,CAAC,UAAW,QAAO,aAAa,6CAA6C;AAIjF,MAAI,UAAU,SAAS,IAAI,EAAG,QAAO,kBAAkB,WAAW,UAAU,GAAG;AAE/E,QAAM,WAAW;AACjB,QAAM,OAAO,IAAI,MAAM,MAAM,KAAK,CAAC,MAAqB,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ;AAChG,MAAI,CAAC,KAAM,QAAO,aAAa,oCAAoC,QAAQ,EAAE;AAK7E,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,SAAU,gBAAe,IAAI,EAAE,IAAI,QAAQ,EAAE,IAAI,EAAE;AAAA,EACpE;AACA,QAAM,WAAW,oBAAI,IAAmD;AACxE,QAAM,cAAc,CAAC,IAAY,MAAc,SAAuB;AACpE,UAAM,OAAO,SAAS,IAAI,EAAE,KAAK,CAAC;AAClC,SAAK,KAAK,EAAE,MAAM,KAAK,CAAC;AACxB,aAAS,IAAI,IAAI,IAAI;AAAA,EACvB;AACA,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,aAAa,EAAE,SAAS,SAAS;AAC9C,kBAAY,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI;AAAA,IAClC,WAAW,EAAE,SAAS,SAAS;AAC7B,YAAM,WAAW,eAAe,IAAI,EAAE,IAAI;AAC1C,YAAM,SAAS,eAAe,IAAI,EAAE,EAAE;AACtC,UAAI,YAAY,UAAU,aAAa,OAAQ,aAAY,QAAQ,UAAU,OAAO;AAAA,IACtF;AAAA,EACF;AAQA,QAAM,UAAU,oBAAI,IAAY,CAAC,KAAK,EAAE,CAAC;AACzC,QAAM,OAAc,CAAC;AACrB,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,KAAK,IAAI,MAAM,MAAO,KAAI,EAAE,SAAS,OAAQ,UAAS,IAAI,EAAE,IAAI,EAAE,IAAI;AAEjF,MAAI,WAAW,CAAC,KAAK,EAAE;AACvB,WAAS,IAAI,GAAG,KAAK,UAAU,KAAK;AAClC,UAAM,OAAiB,CAAC;AACxB,eAAW,OAAO,UAAU;AAC1B,YAAM,UAAU,SAAS,IAAI,GAAG,KAAK,CAAC;AACtC,iBAAW,KAAK,SAAS;AACvB,YAAI,QAAQ,IAAI,EAAE,IAAI,EAAG;AACzB,gBAAQ,IAAI,EAAE,IAAI;AAClB,aAAK,KAAK,EAAE,IAAI;AAChB,cAAM,OAAO,SAAS,IAAI,EAAE,IAAI,KAAK,EAAE;AACvC,aAAK,KAAK,EAAE,MAAM,OAAO,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,MAC3C;AAAA,IACF;AACA,eAAW;AACX,QAAI,KAAK,WAAW,EAAG;AAAA,EACzB;AAEA,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO,YAAY,sBAAsB,QAAQ;AAAA;AAAA,0CAA0C;AAAA,EAC7F;AAEA,OAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACrE,QAAM,QAAQ,CAAC,sBAAsB,QAAQ,mBAAc,QAAQ,KAAK,EAAE;AAC1E,QAAM,KAAK,GAAG,KAAK,MAAM,qBAAqB;AAC9C,aAAW,KAAK,MAAM;AACpB,UAAM,KAAK,aAAa,EAAE,KAAK,QAAQ,EAAE,IAAI,YAAY,EAAE,GAAG,IAAI;AAAA,EACpE;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAMA,SAAS,kBAAkB,WAAmB,UAAkB,KAAoB;AAClF,QAAM,CAAC,SAAS,MAAM,IAAI,UAAU,MAAM,MAAM,CAAC;AACjD,QAAM,YAAY,WAAW,IAAI,KAAK;AACtC,QAAM,WAAW,UAAU,IAAI,KAAK;AACpC,MAAI,CAAC,QAAS,QAAO,aAAa,yDAAyD;AAE3F,QAAM,WAAW,kBAAkB,IAAI,OAAO,QAAQ;AACtD,MAAI,eAAe,UAAU;AAC3B,UAAM,QAAQ,SAAS,UAAU,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI;AACtD,WAAO;AAAA,MACL,kBAAkB,QAAQ,6BAA6B,KAAK;AAAA,IAC9D;AAAA,EACF;AACA,MAAI,UAAU,SAAU,QAAO,aAAa,oCAAoC,QAAQ,EAAE;AAC1F,QAAM,WAAW,SAAS;AAE1B,QAAM,SAAS,IAAI,MAAM,MAAM;AAAA,IAC7B,CAAC,MAAuB,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS,QAAQ,EAAE,SAAS;AAAA,EACxF;AACA,MAAI,CAAC;AACH,WAAO,aAAa,yBAAyB,OAAO,kBAAkB,SAAS,IAAI,EAAE;AAGvF,QAAM,eAAe,oBAAI,IAAsB;AAC/C,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,WAAW,EAAE,SAAS,EAAE,GAAI;AAC3C,UAAM,OAAO,aAAa,IAAI,EAAE,EAAE,KAAK,CAAC;AACxC,SAAK,KAAK,EAAE,IAAI;AAChB,iBAAa,IAAI,EAAE,IAAI,IAAI;AAAA,EAC7B;AACA,QAAM,UAAU,oBAAI,IAAwB;AAC5C,aAAW,KAAK,IAAI,MAAM,MAAO,KAAI,EAAE,SAAS,SAAU,SAAQ,IAAI,EAAE,IAAI,CAAC;AAQ7E,QAAM,UAAU,oBAAI,IAAY,CAAC,OAAO,EAAE,CAAC;AAC3C,QAAM,OAAc,CAAC;AACrB,MAAI,WAAW,CAAC,OAAO,EAAE;AACzB,WAAS,IAAI,GAAG,KAAK,UAAU,KAAK;AAClC,UAAM,OAAiB,CAAC;AACxB,eAAW,OAAO,UAAU;AAC1B,iBAAW,UAAU,aAAa,IAAI,GAAG,KAAK,CAAC,GAAG;AAChD,YAAI,QAAQ,IAAI,MAAM,EAAG;AACzB,gBAAQ,IAAI,MAAM;AAClB,aAAK,KAAK,MAAM;AAChB,cAAM,IAAI,QAAQ,IAAI,MAAM;AAC5B,YAAI,EAAG,MAAK,KAAK,EAAE,MAAM,EAAE,MAAM,MAAM,EAAE,MAAM,MAAM,EAAE,YAAY,OAAO,EAAE,CAAC;AAAA,MAC/E;AAAA,IACF;AACA,eAAW;AACX,QAAI,KAAK,WAAW,EAAG;AAAA,EACzB;AAEA,QAAM,SAAS,sBAAsB,SAAS,IAAI,KAAK,OAAO,IAAI,4BAAuB,QAAQ;AACjG,MAAI,KAAK,WAAW,GAAG;AACrB,UAAMC,SAAQ,kBAAkB,IAAI,OAAO,CAAC,SAAS,IAAI,CAAC;AAC1D,WAAO;AAAA,MACL,GAAG,MAAM;AAAA;AAAA,sCAAsCA,SAAQ;AAAA;AAAA,EAAOA,MAAK,KAAK,EAAE;AAAA,IAC5E;AAAA,EACF;AACA,OAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,OAAO,EAAE,IAAI;AACxF,QAAM,QAAQ,CAAC,QAAQ,IAAI,GAAG,KAAK,MAAM,oBAAoB;AAC7D,aAAW,KAAK,KAAM,OAAM,KAAK,aAAa,EAAE,KAAK,QAAQ,EAAE,IAAI,aAAQ,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE;AAC7F,QAAM,QAAQ,kBAAkB,IAAI,OAAO,CAAC,SAAS,MAAM,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACtF,MAAI,OAAO;AACT,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,KAAK;AAAA,EAClB;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAIA,SAAS,kBAAkB,OAAoB,WAA6B;AAC1E,QAAM,aAAa,oBAAI,IAAsB;AAC7C,aAAW,KAAK,MAAM,MAAO,KAAI,EAAE,SAAS,OAAQ,YAAW,IAAI,EAAE,MAAM,CAAC;AAC5E,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,QAAkB,CAAC;AACzB,aAAW,KAAK,IAAI,IAAI,SAAS,GAAG;AAClC,UAAM,KAAK,WAAW,IAAI,CAAC;AAC3B,QAAI,CAAC,GAAI;AACT,eAAW,KAAK,iBAAiB,OAAO,EAAE,GAAG;AAC3C,UAAI,CAAC,KAAK,IAAI,EAAE,IAAI,GAAG;AACrB,aAAK,IAAI,EAAE,IAAI;AACf,cAAM,KAAK,EAAE,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,QAAQ,MAAM,MAAM,GAAG,eAAe;AAC5C,QAAM,UAAU,MAAM,SAAS,MAAM;AACrC,SAAO,8BAA8B,MAAM,KAAK,QAAK,CAAC,GAAG,UAAU,IAAI,WAAM,OAAO,UAAU,EAAE;AAClG;AAEA,IAAM,wBAAwB;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,cAAc,MAAuB;AAC5C,SAAO,sBAAsB,KAAK,CAAC,OAAO,GAAG,KAAK,IAAI,CAAC;AACzD;AAEA,SAAS,SAAS,MAA2C,KAAoB;AAC/E,QAAM,QAAQ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE3F,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,aAAa,EAAE,SAAS,QAAS,aAAY,IAAI,EAAE,EAAE;AAAA,EACtE;AAEA,QAAM,aAAa,IAAI,MAAM,MAC1B,OAAO,CAAC,MAAqB,EAAE,SAAS,MAAM,EAC9C,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC,EACpC,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC;AAEvC,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL;AAAA;AAAA;AAAA,IACF;AAAA,EACF;AAEA,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACtD,QAAM,QAAQ,WAAW,MAAM,GAAG,KAAK;AACvC,QAAM,QAAQ,CAAC,8CAA8C,EAAE;AAC/D,QAAM;AAAA,IACJ,GAAG,MAAM,MAAM,OAAO,WAAW,MAAM;AAAA,EACzC;AACA,QAAM,KAAK,EAAE;AACb,aAAW,KAAK,OAAO;AACrB,UAAM,KAAK,OAAO,EAAE,IAAI,IAAI;AAAA,EAC9B;AACA,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAEA,eAAe,cAAc,MAA2C,KAAoB;AAC1F,QAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,KAAK,QAAQ;AAC7D,MAAI,CAAC,MAAO,QAAO,aAAa,8CAA8C;AAK9E,QAAM,YAAY,MAAM,SAAS,IAAI,OAAO,OAAO;AAAA,IACjD,qBAAqB,IAAI,SAAS,gBAAgB,KAAK,KAAK,GAAI;AAAA,IAChE,mBAAmB,mBAAmB;AAAA,IACtC,aAAa,IAAI,OAAO,gBAAgB;AAAA,EAC1C,CAAC;AACD,QAAM,SAAS,MAAM,KAAK,UAAU,OAAO,EAAE,OAAO,OAAO,IAAI,MAAM,CAAC;AAKtE,QAAM,UAAU,KAAK,EAAE,IAAI,OAAO,GAAG,MAAM,IAAI,QAAQ,YAAY,MAAM,CAAC;AAE1E,QAAM,SACJ,eAAe,UAAU,UAAU;AAAA,SACzB,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,IAAI,KAAK,QAAQ;AAAA,UACxD,UAAU,MAAM;AAAA;AAG7B,SAAO,YAAY,GAAG,MAAM;AAAA,EAAK,OAAO,IAAI,EAAE;AAChD;AASO,SAAS,kBAAkB,OAAoB,UAAoC;AACxF,QAAM,QAAQ,MAAM,MAAM,OAAO,CAAC,MAAqB,EAAE,SAAS,MAAM;AACxE,QAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ;AACnD,MAAI,MAAO,QAAO,EAAE,MAAM,MAAM;AAEhC,QAAM,SAAS,MAAM;AACrB,QAAM,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,KAAK,SAAS,MAAM,CAAC;AAC3D,MAAI,QAAQ,WAAW,EAAG,QAAO,EAAE,MAAM,QAAQ,CAAC,EAAG;AACrD,MAAI,QAAQ,SAAS,EAAG,QAAO,EAAE,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE;AACvE,SAAO,EAAE,MAAM,KAAK;AACtB;AAEA,IAAM,eAAe;AACrB,IAAM,mBAAmB;AACzB,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AAUjB,SAAS,gBACd,QACA,OACA,WAAW,WAAW,EAAE,kBAChB;AACR,QAAM,UAAU,oBAAI,IAAwB;AAC5C,aAAW,KAAK,MAAM,MAAO,KAAI,EAAE,SAAS,SAAU,SAAQ,IAAI,EAAE,IAAI,CAAC;AAEzE,QAAM,YAAsB,CAAC;AAC7B,QAAM,YAAsB,CAAC;AAC7B,QAAM,aAAa,oBAAI,IAAY;AACnC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,QAAS;AACxB,QAAI,EAAE,SAAS,OAAO,MAAM,EAAE,OAAO,OAAO,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,GAAG;AACvE,iBAAW,IAAI,EAAE,EAAE;AACnB,gBAAU,KAAK,EAAE,EAAE;AAAA,IACrB,WAAW,EAAE,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO,MAAM,CAAC,WAAW,IAAI,EAAE,IAAI,GAAG;AAChF,iBAAW,IAAI,EAAE,IAAI;AACrB,gBAAU,KAAK,EAAE,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,QAAMC,WAAU,CAAC,QACf,IAAI,IAAI,CAAC,OAAO,QAAQ,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,MAAuB,CAAC,CAAC,CAAC;AACrE,QAAM,UAAUA,SAAQ,SAAS,EAAE;AAAA,IAAK,CAAC,GAAG,MAC1C,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,KAAK;AAAA,EAC3E;AACA,QAAM,UAAUA,SAAQ,SAAS;AAEjC,MAAI,QAAQ,WAAW,KAAK,QAAQ,WAAW,EAAG,QAAO;AAEzD,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO;AAEX,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,OAAO;AACb,UAAM,KAAK,IAAI;AACf,YAAQ,KAAK,SAAS;AACtB,QAAI,QAAQ;AACZ,eAAW,KAAK,QAAQ,MAAM,GAAG,gBAAgB,GAAG;AAClD,YAAM,MAAM,EAAE,UAAU,KAAK,EAAE,MAAM,GAAG,YAAY;AACpD,YAAM,QAAQ,UAAK,GAAG,uCAAkC,EAAE,IAAI,KAAK,EAAE,IAAI;AACzE,UAAI,OAAO,MAAM,SAAS,IAAI,SAAU;AACxC,YAAM,KAAK,KAAK;AAChB,cAAQ,MAAM,SAAS;AACvB,eAAS;AAAA,IACX;AACA,UAAM,UAAU,QAAQ,SAAS;AACjC,QAAI,UAAU,EAAG,OAAM,KAAK,UAAK,OAAO,OAAO;AAAA,EACjD;AAEA,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAMC,OAAM,MAAM,SAAS,IAAI,IAAI;AACnC,UAAM,OAAO,YAAY,QAAQ,MAAM;AACvC,UAAM,QAAkB,CAAC;AACzB,QAAI,QAAQ,OAAOA,OAAM,KAAK;AAC9B,eAAW,KAAK,QAAQ,MAAM,GAAG,gBAAgB,GAAG;AAClD,YAAM,OAAO,GAAG,EAAE,IAAI,WAAM,EAAE,IAAI;AAClC,YAAMC,QAAO,MAAM,SAAS,IAAI,IAAI;AACpC,UAAI,QAAQA,QAAO,KAAK,SAAS,SAAU;AAC3C,YAAM,KAAK,IAAI;AACf,eAASA,QAAO,KAAK;AAAA,IACvB;AACA,QAAI,MAAM,SAAS,EAAG,OAAM,KAAK,EAAE;AACnC,QAAI,MAAM,SAAS,GAAG;AACpB,YAAM,UAAU,QAAQ,SAAS,MAAM;AACvC,YAAM,KAAK,OAAO,MAAM,KAAK,QAAK,KAAK,UAAU,IAAI,WAAM,OAAO,UAAU,GAAG;AAAA,IACjF,OAAO;AACL,YAAM,KAAK,YAAY,QAAQ,MAAM,WAAW;AAAA,IAClD;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AASO,SAAS,iBAAiB,QAAoB,OAA4B;AAC/E,QAAM,WAAW,MAAM,MAAM;AAAA,IAC3B,CAAC,MAAqB,EAAE,SAAS,UAAU,EAAE,SAAS,OAAO;AAAA,EAC/D;AACA,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,QAAQ,iBAAiB,OAAO,QAAQ;AAC9C,MAAI,MAAM,SAAS,GAAG;AACpB,UAAM,QAAQ,MAAM,MAAM,GAAG,eAAe,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAC/D,UAAM,UAAU,MAAM,SAAS,MAAM;AACrC,UAAM,OAAO,UAAU,IAAI,WAAM,OAAO,UAAU;AAClD,WAAO,uBAAuB,MAAM,KAAK,QAAK,CAAC,GAAG,IAAI;AAAA,EACxD;AAEA,MAAI,cAAc,OAAO,IAAI,EAAG,QAAO;AACvC,SAAO;AACT;AAEA,eAAe,UAAU,MAA2C,KAAoB;AACtF,QAAM,SAAS,OAAO,MAAM,WAAW,WAAW,KAAK,SAAS;AAChE,MAAI,CAAC,OAAQ,QAAO,aAAa,2CAA2C;AAE5E,QAAM,CAAC,SAAS,UAAU,IAAI,OAAO,SAAS,IAAI,IAAI,OAAO,MAAM,MAAM,CAAC,IAAI,CAAC,QAAQ,MAAS;AAChG,QAAM,YAAY,WAAW,IAAI,KAAK;AAEtC,QAAM,WAAW,kBAAkB,IAAI,OAAO,QAAQ;AACtD,MAAI,eAAe,UAAU;AAC3B,UAAM,QAAQ,SAAS,UAAU,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI;AACtD,UAAM,OAAO,SAAS,UAAU,SAAS,IAAI,aAAQ;AACrD,WAAO;AAAA,MACL,gBAAgB,QAAQ,6BAA6B,KAAK,GAAG,IAAI;AAAA,IACnE;AAAA,EACF;AACA,MAAI,UAAU,UAAU;AACtB,WAAO,aAAa,wCAAwC,QAAQ,EAAE;AAAA,EACxE;AACA,QAAM,WAAW,SAAS;AAI1B,QAAM,UAAU,KAAK,EAAE,IAAI,OAAO,GAAG,MAAM,SAAS,MAAM,QAAQ,OAAO,CAAC;AAE1E,MAAI,CAAC,YAAY;AACf,WAAO,YAAY,KAAK,SAAS,IAAI;AAAA;AAAA,EAAO,SAAS,OAAO,EAAE;AAAA,EAChE;AAEA,QAAM,WAAW,WAAW,KAAK;AACjC,QAAM,SAAS,IAAI,MAAM,MAAM;AAAA,IAC7B,CAAC,MAAuB,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS,QAAQ,EAAE,SAAS;AAAA,EACxF;AACA,MAAI,CAAC,QAAQ;AACX,WAAO,aAAa,uBAAuB,QAAQ,kBAAkB,SAAS,IAAI,EAAE;AAAA,EACtF;AAEA,QAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO;AAC5C,QAAM,OAAO,MAAM,MAAM,OAAO,aAAa,GAAG,OAAO,QAAQ,EAAE,KAAK,IAAI;AAQ1E,QAAM,SAAS,KAAK,IAAI,GAAG,OAAO,aAAa,CAAC;AAChD,QAAM,QAAQ,OAAO,WAAW,OAAO,aAAa,IAAI;AACxD,QAAM,WACJ;AAAA;AAAA;AAAA,oCAAyC,SAAS,IAAI,aAAa,MAAM,WAAW,KAAK,iEAC/B,KAAK;AAEjE,QAAM,OAAO,gBAAgB,QAAQ,IAAI,KAAK;AAC9C,QAAM,YAAY,OAAO;AAAA;AAAA;AAAA,EAAY,IAAI,KAAK;AAE9C,QAAM,QAAQ,iBAAiB,QAAQ,IAAI,KAAK;AAChD,QAAM,aAAa,QAAQ;AAAA;AAAA;AAAA,EAAY,KAAK,KAAK;AAEjD,SAAO;AAAA,IACL,KAAK,SAAS,IAAI,KAAK,OAAO,IAAI,OAAO,OAAO,UAAU,IAAI,OAAO,QAAQ;AAAA;AAAA,EAAQ,IAAI,GAAG,SAAS,GAAG,UAAU,GAAG,QAAQ;AAAA,EAC/H;AACF;AAEA,IAAM,cAAc,oBAAI,IAAY;AAEpC,eAAe,kBAAkB,MAA2C,KAAoB;AAC9F,QAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,IAClC,KAAK,MAAoB,OAAO,CAAC,MAAM,OAAO,MAAM,QAAQ,IAC7D,CAAC;AACL,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO;AACb,gBAAY,IAAI,IAAI;AAIpB,UAAM,WAAW,kBAAkB,IAAI,OAAO,IAAI;AAClD,UAAM,UAAU,KAAK;AAAA,MACnB,IAAI,OAAO;AAAA,MACX,MAAM,UAAU,WAAW,SAAS,KAAK,OAAO;AAAA,MAChD,QAAQ;AAAA,IACV,CAAC;AAAA,EACH;AACA,SAAO;AAAA,IACL,cAAc,MAAM,MAAM,gDAAgD,YAAY,IAAI;AAAA,EAC5F;AACF;AAEO,SAAS,qBAA+B;AAC7C,SAAO,MAAM,KAAK,WAAW;AAC/B;AAEA,IAAM,cAAc,oBAAI,IAAe,CAAC,YAAY,QAAQ,QAAQ,QAAQ,SAAS,CAAC;AAEtF,eAAe,gBAAgB,MAA2C,KAAoB;AAC5F,QAAM,OAAO,OAAO,MAAM,SAAS,WAAW,KAAK,KAAK,KAAK,IAAI;AACjE,QAAM,UAAU,OAAO,MAAM,SAAS,WAAW,KAAK,OAAO;AAC7D,MAAI,CAAC,KAAM,QAAO,aAAa,+CAA+C;AAC9E,MAAI,CAAC,YAAY,IAAI,OAAoB,GAAG;AAC1C,WAAO;AAAA,MACL,2CAA2C,MAAM,KAAK,WAAW,EAAE,KAAK,IAAI,CAAC;AAAA,IAC/E;AAAA,EACF;AACA,QAAM,OAAO,MAAM,QAAQ,MAAM,IAAI,IAChC,KAAK,KAAmB,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,IACzE,CAAC;AACL,QAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,IAClC,KAAK,MAAoB,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,IAC1E,CAAC;AAEL,QAAM,SAAS,MAAM,cAAc,IAAI,OAAO;AAAA,IAC5C;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,cAAc,OAAO,MAAM,IAAI,eAAe,OAAO,MAAM;AAAA,UAC9C,OAAO,SAAS;AAAA,wBACF,OAAO,aAAa;AAAA,EACjD;AACF;AAEA,IAAM,2BAA2B,KAAK,KAAK;AAE3C,SAAS,eAAe,MAA2C,KAAoB;AACrF,QAAM,UACJ,OAAO,MAAM,aAAa,YAAY,OAAO,SAAS,KAAK,QAAQ,IAC/D,KAAK,WACL,KAAK,IAAI,IAAI;AACnB,QAAM,QACJ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE/E,MAAI,SAAS,IAAI,SAAS,UAAU,OAAO;AAC3C,MAAI,MAAO,UAAS,OAAO,MAAM,CAAC,KAAK;AAEvC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,YAAY,kCAAkC,IAAI,KAAK,OAAO,EAAE,YAAY,CAAC,GAAG;AAAA,EACzF;AAEA,QAAM,QAAQ,CAAC,4BAA4B,OAAO,MAAM,YAAY,EAAE;AACtE,aAAW,KAAK,QAAQ;AACtB,QAAI,UAAU,GAAG;AACf,YAAM,KAAK,OAAO,EAAE,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,EAAE,IAAI;AAAA,IACrD,OAAO;AACL,YAAM,UAAU,KAAK,UAAU,EAAE,OAAO;AACxC,YAAM,KAAK,OAAO,EAAE,IAAI,MAAM,OAAO,OAAO,EAAE,EAAE,IAAI;AAAA,IACtD;AAAA,EACF;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAEA,eAAe,cAAc,MAA2C,KAAoB;AAC1F,QAAM,OACJ,OAAO,MAAM,SAAS,YAAY,YAAY,IAAI,KAAK,IAAiB,IACnE,KAAK,OACN;AACN,QAAM,SAAS,OAAO,MAAM,WAAW,WAAW,KAAK,SAAS;AAChE,QAAM,QACJ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE/E,QAAM,SAAS,MAAM,cAAc,IAAI,OAAO,EAAE,MAAM,QAAQ,MAAM,CAAC;AAErE,MAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,UAAM,SAAS,OAAO,aAAa,IAAI,MAAM;AAC7C,WAAO,YAAY,qBAAqB,MAAM,eAAe,OAAO,MAAM,IAAI;AAAA,EAChF;AAEA,QAAM,QAAQ,CAAC,oCAA+B,OAAO,MAAM,IAAI,EAAE;AACjE,aAAW,KAAK,OAAO,SAAS;AAC9B,UAAM,OAAO,EAAE,KAAK,SAAS,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,MAAM;AACzD,UAAM,KAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,MAAM,EAAE,OAAO,EAAE;AAC7D,QAAI,EAAE,MAAM,OAAQ,OAAM,KAAK,YAAY,EAAE,MAAM,KAAK,IAAI,CAAC,EAAE;AAAA,EACjE;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAKA,eAAe,YAAY,KAAoB,MAA6B;AAC1E,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,MAAM,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAMC;AAAA,MACJ,IAAI,MAAM;AAAA,MACV,KAAK,UAAU,EAAE,KAAI,oBAAI,KAAK,GAAE,YAAY,GAAG,KAAK,CAAC,IAAI;AAAA,MACzD;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACF;AAOA,eAAe,UAAU,KAAoB,IAAgC;AAC3E,MAAI;AACF,QAAI,IAAI,MAAO,OAAM,IAAI,MAAM,OAAO,EAAE;AAAA,QACnC,OAAM,aAAa,IAAI,MAAM,WAAW,EAAE;AAAA,EACjD,QAAQ;AAAA,EAER;AACF;AAEA,SAAS,SAAiB;AACxB,UAAO,oBAAI,KAAK,GAAE,YAAY;AAChC;AAEA,eAAsB,iBACpB,MACA,KAC0B;AAC1B,MAAI,CAAC,QAAQ,OAAO,SAAS,UAAU;AACrC,WAAO,IAAI,MAAM,IAAI,gBAAgB,6CAA6C;AAAA,EACpF;AAEA,QAAM,MAAM;AACZ,MAAI,IAAI,YAAY,SAAS,OAAO,IAAI,WAAW,UAAU;AAC3D,WAAO,IAAI,IAAI,MAAM,MAAM,IAAI,gBAAgB,4BAA4B;AAAA,EAC7E;AAEA,QAAM,KAAK,IAAI,MAAM;AAErB,MAAI;AACF,YAAQ,IAAI,QAAQ;AAAA,MAClB,KAAK;AACH,eAAO,GAAG,IAAI;AAAA,UACZ,iBACE,OAAO,IAAI,QAAQ,oBAAoB,WACnC,IAAI,OAAO,kBACX;AAAA,UACN,cAAc,EAAE,OAAO,CAAC,EAAE;AAAA,UAC1B,YAAY;AAAA,QACd,CAAC;AAAA,MAEH,KAAK;AAEH,eAAO,GAAG,IAAI,CAAC,CAAC;AAAA,MAElB,KAAK;AACH,eAAO,GAAG,IAAI,EAAE,OAAO,MAAM,CAAC;AAAA,MAEhC,KAAK,cAAc;AACjB,cAAM,SAAS,IAAI,UAAU,CAAC;AAC9B,cAAM,WAAW,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AACjE,YAAI,CAAC,SAAU,QAAO,IAAI,IAAI,IAAI,eAAe,oCAAoC;AACrF,cAAM,OACJ,OAAO,aAAa,OAAO,OAAO,cAAc,WAC3C,OAAO,YACR,CAAC;AACP,aAAK,YAAY,KAAK,QAAQ;AAC9B,cAAM,SAAS,MAAM,SAAS,UAAU,MAAM,GAAG;AACjD,eAAO,GAAG,IAAI,MAAM;AAAA,MACtB;AAAA,MAEA,KAAK;AACH,eAAO,GAAG,IAAI,CAAC,CAAC;AAAA,MAElB;AACE,eAAO,IAAI,IAAI,IAAI,gBAAgB,qBAAqB,IAAI,MAAM,EAAE;AAAA,IACxE;AAAA,EACF,SAAS,GAAG;AACV,WAAO,IAAI,IAAI,IAAI,UAAW,EAAY,OAAO;AAAA,EACnD;AACF;;;AYx4BA,SAAS,oBAAoB;AAEtB,IAAM,mBAAmB;AACzB,IAAM,iBAAiB;AAE9B,eAAsB,aACpB,QAAQ,kBACR,MAAM,gBACW;AACjB,WAAS,OAAO,OAAO,QAAQ,KAAK,QAAQ;AAC1C,QAAI,MAAM,OAAO,IAAI,EAAG,QAAO;AAAA,EACjC;AACA,QAAM,IAAI,MAAM,4BAA4B,KAAK,IAAI,GAAG,EAAE;AAC5D;AAEA,SAAS,OAAO,MAAgC;AAC9C,SAAO,IAAI,QAAQ,CAACC,aAAY;AAC9B,UAAM,IAAI,aAAa;AACvB,MAAE,KAAK,SAAS,MAAMA,SAAQ,KAAK,CAAC;AACpC,MAAE,KAAK,aAAa,MAAM,EAAE,MAAM,MAAMA,SAAQ,IAAI,CAAC,CAAC;AACtD,MAAE,OAAO,MAAM,WAAW;AAAA,EAC5B,CAAC;AACH;;;ACRA,eAAsB,cACpB,KACA,OACA,OACe;AACf,MAAI;AAKF,UAAM,YAAY,MAAM,aAAa,EAAE,QAAQ,MAAM,eAAe,KAAK,CAAC;AAC1E,UAAM,CAAC,OAAO,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC7C,UAAU,MAAM,SAAS;AAAA,MACzB,gBAAgB,MAAM,WAAW;AAAA,IACnC,CAAC;AACD,QAAI,QAAQ;AACZ,QAAI,cAAc;AAClB,QAAI,KAAK,cAAc,KAAK,YAAO,MAAM,YAAY,aAAa,MAAM,UAAU,SAAS;AAAA,EAC7F,SAASC,MAAK;AACZ,QAAI,KAAK,mBAAmB,KAAK,MAAOA,KAAc,OAAO,EAAE;AAAA,EACjE;AACF;AAiBO,SAAS,gBACd,KACA,OACA,OAAmD,CAAC,GACzC;AACX,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,SAAS,KAAK,UAAU;AAC9B,MAAI,QAA8C;AAClD,MAAI,UAAU;AACd,MAAI,UAAU;AAEd,iBAAe,MAAqB;AAClC,QAAI,SAAS;AACX,gBAAU;AACV;AAAA,IACF;AACA,cAAU;AACV,QAAI;AACF,YAAM,OAAO,KAAK,OAAO,MAAM;AAAA,IACjC,UAAE;AACA,gBAAU;AACV,UAAI,SAAS;AACX,kBAAU;AACV,aAAK,IAAI;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,WAAW;AACT,UAAI,MAAO,cAAa,KAAK;AAC7B,cAAQ,WAAW,MAAM;AACvB,gBAAQ;AACR,aAAK,IAAI;AAAA,MACX,GAAG,UAAU;AAEb,YAAM,QAAQ;AAAA,IAChB;AAAA,IACA,OAAO;AACL,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACF;;;ACxFA,eAAsB,eACpB,SACA,KAC2B;AAC3B,QAAM,SAAS,IAAI,SAAS,UAAU,OAAO;AAC7C,SAAO;AAAA,IACL;AAAA,IACA,OAAO,IAAI,KAAK,WAAW,KAAK,IAAI,CAAC,EAAE,YAAY;AAAA,IACnD,WAAW,IAAI,SAAS,KAAK;AAAA,EAC/B;AACF;;;AClBA,SAAS,YAAAC,iBAAgB;AACzB,SAAS,aAAAC,kBAAiB;AAI1B,IAAMC,iBAAgBD,WAAUD,SAAQ;AAExC,IAAM,cAAc;AACpB,IAAM,QAAQ;AAKd,eAAsB,gBACpB,aACA,UAC0B;AAC1B,QAAM,OAAO;AAAA,IACX;AAAA,IACA,eAAe,WAAW;AAAA,IAC1B;AAAA,IACA,qBAAqB,KAAK,KAAK,KAAK;AAAA,EACtC;AACA,MAAI,OAAO,SAAS,KAAK,MAAM,QAAQ,CAAC,EAAG,MAAK,KAAK,WAAW,QAAQ,EAAE;AAE1E,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAME,eAAc,OAAO,MAAM,EAAE,KAAK,YAAY,CAAC;AACxE,UAAM,MAAuB,CAAC;AAC9B,eAAW,QAAQ,OAAO,MAAM,IAAI,GAAG;AACrC,YAAM,IAAI,KAAK,KAAK;AACpB,UAAI,CAAC,EAAG;AACR,YAAM,CAAC,MAAM,SAAS,IAAI,IAAI,EAAE,MAAM,KAAK;AAC3C,UAAI,QAAQ,QAAS,KAAI,KAAK,EAAE,MAAM,SAAS,MAAM,QAAQ,GAAG,CAAC;AAAA,IACnE;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;;;ACpCA,SAAS,SAAAC,QAAO,YAAAC,YAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,iBAAe;AAEjB,IAAM,yBAAyB;AAuBtC,eAAsB,YAAY,MAA4C;AAC5E,MAAI;AACF,UAAM,MAAM,MAAMF,WAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,mBAAmB,uBAAwB,QAAO;AAC7D,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,aAAa,MAAc,OAAoC;AACnF,QAAMD,OAAMG,UAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAMD,WAAU,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM;AACrE;;;ACdA,IAAM,oBAAoB,KAAK,KAAK,KAAK;AAEzC,eAAe,gBAAgB,KAAoB,gBAAwC;AACzF,QAAM,SAAS,MAAM,oBAAoB,IAAI,OAAO,cAAc;AAElE,QAAM,CAAC,OAAO,WAAW,IAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,IACjD,cAAc,IAAI,OAAO,EAAE,MAAM,QAAQ,QAAQ,OAAO,QAAQ,OAAO,EAAE,CAAC;AAAA,IAC1E,cAAc,IAAI,OAAO,EAAE,MAAM,YAAY,QAAQ,OAAO,QAAQ,OAAO,EAAE,CAAC;AAAA,IAC9E,cAAc,IAAI,OAAO,EAAE,MAAM,QAAQ,QAAQ,OAAO,QAAQ,OAAO,EAAE,CAAC;AAAA,EAC5E,CAAC;AAGD,QAAM,UAAU,IAAI,IAAY,mBAAmB,CAAC;AACpD,aAAW,KAAK,IAAI,SAAS,gBAAgB,iBAAiB,EAAG,SAAQ,IAAI,CAAC;AAG9E,QAAM,OAAO,MAAM,YAAY,IAAI,MAAM,YAAY;AACrD,QAAM,gBAAgB,MAAM,gBAAgB,IAAI,MAAM,aAAa,MAAM,WAAW,EAAE;AAEtF,QAAM,WAAyB;AAAA,IAC7B,gBAAgB;AAAA,IAChB,UAAS,oBAAI,KAAK,GAAE,YAAY;AAAA,IAChC,QAAQ,OAAO;AAAA,IACf,cAAc,MAAM,KAAK,OAAO;AAAA,IAChC;AAAA,IACA,SAAS;AAAA,MACP,OAAO,MAAM,QAAQ,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,MACzC,WAAW,UAAU,QAAQ,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,MACjD,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,IACzC;AAAA,EACF;AACA,QAAM,aAAa,IAAI,MAAM,cAAc,QAAQ;AACrD;AAEA,eAAsB,oBACpB,KACA,KACgC;AAChC,QAAM,IAAI,MAAM,iBAAiB,IAAI,OAAO,KAAK,MAAM;AAIvD,MAAI;AACF,UAAM,gBAAgB,KAAK,KAAK,MAAM;AAAA,EACxC,QAAQ;AAAA,EAER;AAEA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,QAAQ,EAAE;AAAA,IACV,MAAM,EAAE;AAAA,IACR,SAAS,EAAE;AAAA,EACb;AACF;;;AC5EA,SAAS,cAAAE,aAAY,SAAAC,eAAa;AAClC,SAAS,WAAAC,iBAAe;;;ACLxB,SAAS,cAAAC,aAAY,SAAAC,eAAa;AAClC,SAAS,WAAAC,iBAAe;;;ACAjB,SAAS,wBAAwB,SAA0B;AAEhE,MAAI,eAAe,KAAK,OAAO,EAAG,QAAO;AAGzC,MAAI,4BAA4B,KAAK,OAAO,EAAG,QAAO;AAEtD,MAAI,KAAK,KAAK,OAAO,EAAG,QAAO;AAE/B,MAAI,eAAe,KAAK,OAAO,EAAG,QAAO;AAEzC,MAAI,SAAS,KAAK,OAAO,KAAK,0BAA0B,KAAK,OAAO,KAAK,MAAM,KAAK,OAAO,GAAG;AAC5F,WAAO;AAAA,EACT;AAGA,MAAI,aAAa,KAAK,OAAO,EAAG,QAAO;AAEvC,MAAI,sBAAsB,KAAK,OAAO,EAAG,QAAO;AAOhD,QAAM,WAAW,QACd,QAAQ,eAAe,EAAE,EACzB,MAAM,GAAG,EACT,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,OAAO;AACjB,QAAM,UAAU,CAAC,MAAc,mCAAmC,KAAK,CAAC;AACxE,MAAI,SAAS,SAAS,KAAK,SAAS,MAAM,OAAO,EAAG,QAAO;AAC3D,SAAO;AACT;;;ADXA,IAAM,eAAe,oBAAI,IAAI,CAAC,QAAQ,SAAS,SAAS,MAAM,WAAW,MAAM,KAAK,CAAC;AACrF,IAAM,aAAa,oBAAI,IAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,KAAK,CAAC;AAChF,IAAM,aAAa,oBAAI,IAAI,CAAC,QAAQ,MAAM,CAAC;AAI3C,IAAM,aACJ;AAQK,SAAS,gBAAgB,KAAuB;AACrD,QAAM,SAAmB,CAAC;AAC1B,MAAI,MAAM;AACV,MAAI,QAA0B;AAC9B,MAAIC,cAAa;AACjB,QAAM,QAAQ,MAAM;AAClB,QAAIA,YAAY,QAAO,KAAK,GAAG;AAC/B,UAAM;AACN,IAAAA,cAAa;AAAA,EACf;AACA,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,KAAK,IAAI,CAAC;AAChB,QAAI,OAAO;AACT,UAAI,OAAO,MAAO,SAAQ;AAAA,UACrB,QAAO;AACZ,MAAAA,cAAa;AACb;AAAA,IACF;AACA,QAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,cAAQ;AACR,MAAAA,cAAa;AACb;AAAA,IACF;AACA,QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC1C,YAAM;AACN,UAAI,KAAK;AACT,WAAK,OAAO,OAAO,OAAO,QAAQ,IAAI,IAAI,CAAC,MAAM,IAAI;AACnD,cAAM;AACN;AAAA,MACF;AACA,aAAO,KAAK,EAAE;AACd;AAAA,IACF;AACA,QAAI,KAAK,KAAK,EAAE,GAAG;AACjB,YAAM;AACN;AAAA,IACF;AACA,WAAO;AACP,IAAAA,cAAa;AAAA,EACf;AACA,QAAM;AACN,SAAO;AACT;AAEA,SAAS,WAAW,GAAoB;AACtC,SAAO,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACxD;AAEA,SAAS,cAAc,QAA8B;AACnD,QAAM,OAAmB,CAAC;AAC1B,MAAI,MAAgB,CAAC;AACrB,aAAW,KAAK,QAAQ;AACtB,QAAI,WAAW,CAAC,GAAG;AACjB,UAAI,IAAI,OAAQ,MAAK,KAAK,GAAG;AAC7B,YAAM,CAAC;AAAA,IACT,OAAO;AACL,UAAI,KAAK,CAAC;AAAA,IACZ;AAAA,EACF;AACA,MAAI,IAAI,OAAQ,MAAK,KAAK,GAAG;AAC7B,SAAO;AACT;AAIA,SAAS,cAAc,KAAyB;AAC9C,MAAI,IAAI;AACR,SAAO,IAAI,IAAI,QAAQ;AACrB,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,MAAM,OAAO;AACf;AACA;AAAA,IACF;AACA,QAAI,2BAA2B,KAAK,CAAC,GAAG;AACtC;AACA;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAO,IAAI,MAAM,CAAC;AACpB;AAEA,SAAS,QAAQ,KAAqB;AACpC,UAAQ,IAAI,MAAM,OAAO,EAAE,IAAI,KAAK,KAAK,YAAY;AACvD;AAEA,SAAS,gBAAgB,KAAuC;AAC9D,QAAM,OAAO,cAAc,GAAG;AAC9B,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,MAAM,QAAQ,KAAK,CAAC,CAAW;AACrC,QAAM,OAAO,KAAK,MAAM,CAAC;AACzB,QAAM,QAAQ,KAAK,OAAO,CAAC,MAAM,EAAE,WAAW,GAAG,CAAC;AAClD,QAAM,WAAW,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,CAAC;AAEtD,MAAI,aAAa,IAAI,GAAG,GAAG;AACzB,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,YAAY,MAAM;AAAA,MACtB,CAAC,MAAM,MAAM,QAAQ,MAAM,QAAQ,MAAM,iBAAiB,mBAAmB,KAAK,CAAC;AAAA,IACrF;AACA,UAAM,SAAS,QAAQ,QAAQ,QAAQ,aAAa,QAAQ,QAAQ,QAAQ;AAC5E,UAAM,aAAa,SAAS,SAAS;AAIrC,QAAI,CAAC,UAAU,CAAC,aAAa,CAAC,WAAY,QAAO;AACjD,WAAO,EAAE,MAAM,UAAU,MAAM,KAAK,OAAO,QAAQ;AAAA,EACrD;AAEA,MAAI,WAAW,IAAI,GAAG,GAAG;AACvB,UAAM,OAAO,SAAS,KAAK,CAAC,MAAM,WAAW,KAAK,CAAC,CAAC;AACpD,QAAI,CAAC,KAAM,QAAO;AAClB,WAAO,EAAE,MAAM,QAAQ,MAAM,KAAK,OAAO,KAAK;AAAA,EAChD;AAEA,MAAI,WAAW,IAAI,GAAG,GAAG;AACvB,UAAM,UAAU,KAAK,UAAU,CAAC,MAAM,MAAM,WAAW,MAAM,YAAY,MAAM,OAAO;AACtF,UAAM,SAAS,WAAW,IAAK,KAAK,UAAU,CAAC,KAAK,OAAS,SAAS,CAAC,KAAK;AAC5E,WAAO,EAAE,MAAM,QAAQ,MAAM,KAAK,OAAO,OAAO;AAAA,EAClD;AAEA,SAAO;AACT;AAOO,SAAS,oBAAoB,SAAyC;AAC3E,MAAI,CAAC,WAAW,OAAO,YAAY,SAAU,QAAO;AACpD,QAAM,SAAS,gBAAgB,OAAO;AACtC,MAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,MAAI,OAAO,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,GAAG,CAAC,EAAG,QAAO;AAElE,QAAM,QAAQ,cAAc,MAAM,EAC/B,IAAI,eAAe,EACnB,OAAO,CAAC,MAA4B,MAAM,IAAI;AACjD,MAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,QAAM,OAAwC,EAAE,QAAQ,GAAG,MAAM,GAAG,MAAM,EAAE;AAC5E,QAAM,KAAK,CAAC,GAAG,MAAM,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC;AAChD,SAAO,MAAM,CAAC;AAChB;AAEA,SAAS,aAAa,KAAoB,QAAyB;AACjE,QAAM,OAAO,OAAO,MAAM,OAAO,EAAE,IAAI,KAAK;AAC5C,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,OAAQ;AACvB,QAAI,EAAE,SAAS,UAAU,EAAE,KAAK,SAAS,IAAI,MAAM,EAAE,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,IAAI,MAAM,MAAM;AAC1F,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,QAAQ;AACd,IAAM,UAAU;AAChB,IAAM,QAAQ,CAAC,GAAW,QAAiB,EAAE,SAAS,MAAM,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,WAAM;AAEpF,eAAe,eACb,KACA,KACA,YACA,WACA,SACe;AACf,MAAI;AACF,UAAMC,QAAMC,UAAQ,IAAI,MAAM,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAM,QAAQ;AAAA,MACZ,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC3B,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,OAAO,IAAI,QAAQ,MAAM,IAAI,OAAO,KAAK,IAAI;AAAA,MAC7C;AAAA,MACA;AAAA,MACA,SAAS,MAAM,SAAS,OAAO;AAAA,IACjC;AACA,UAAMC,YAAW,IAAI,MAAM,SAAS,KAAK,UAAU,KAAK,IAAI,MAAM,MAAM;AAAA,EAC1E,QAAQ;AAAA,EAER;AACF;AAOA,eAAsB,YACpB,OACA,KACe;AACf,MAAI,CAAC,WAAW,EAAE,YAAa;AAC/B,QAAM,UAAU,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AACpE,QAAM,MAAM,oBAAoB,OAAO;AACvC,MAAI,CAAC,IAAK;AAEV,MAAI,aAAgC;AACpC,MAAI,YAAY;AAEhB,MAAI,IAAI,SAAS,YAAY,IAAI,OAAO;AAGtC,QAAI,CAAC,wBAAwB,IAAI,KAAK,GAAG;AACvC,YAAM,IAAI,MAAM,SAAS,IAAI,OAAO,IAAI,KAAK;AAC7C,mBAAa,EAAE;AACf,kBAAY,EAAE,eAAe,SAAS,EAAE;AAAA,IAC1C;AAAA,EACF,WAAW,IAAI,SAAS,UAAU,IAAI,OAAO;AAE3C,gBAAY,aAAa,KAAK,IAAI,KAAK;AAAA,EACzC;AAEA,QAAM,eAAe,KAAK,KAAK,YAAY,WAAW,OAAO;AAC/D;;;ADlOA,IAAM,kBAAkB,oBAAI,IAAI,CAAC,QAAQ,MAAM,CAAC;AAChD,IAAM,4BAA4B,IAAI,KAAK;AAE3C,SAAS,aAAa,UAAkB,OAA+C;AACrF,MAAI,aAAa,QAAQ;AACvB,UAAM,UAAU,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AACpE,UAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ;AAC9D,YAAQ,WAAW,OAAO,KAAK,KAAK;AAAA,EACtC;AACA,MAAI,aAAa,QAAQ;AACvB,UAAM,UAAU,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AACpE,WAAO,QAAQ,QAAQ,cAAc,GAAG,EAAE,KAAK,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAMA,SAAS,4BACP,aACA,aACA,OACU;AACV,MAAI,YAAY,WAAW,EAAG,QAAO,CAAC;AAGtC,QAAM,SAAS,IAAI,IAAI,WAAW;AAClC,QAAM,iBAAiB,oBAAI,IAAsB;AACjD,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,UAAU,OAAO,IAAI,EAAE,IAAI,EAAG,gBAAe,IAAI,EAAE,MAAM,EAAE,QAAQ;AAAA,EACpF;AAEA,QAAM,UAAoB,CAAC;AAC3B,aAAW,QAAQ,aAAa;AAC9B,UAAM,QAAQ,KAAK,YAAY;AAC/B,QAAI,UAAU;AACd,eAAW,KAAK,aAAa;AAC3B,UAAI,MAAM,SAAS,CAAC,GAAG;AACrB,kBAAU;AACV;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,SAAS;AACZ,iBAAW,MAAM,eAAe,IAAI,IAAI,KAAK,CAAC,GAAG;AAC/C,YAAI,YAAY,IAAI,EAAE,GAAG;AACvB,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,QAAS,SAAQ,KAAK,IAAI;AAAA,EAChC;AACA,SAAO;AACT;AAKA,IAAM,uBAAuB;AAE7B,eAAe,YACb,KACA,UACA,OACA,UACA,QACA,WACe;AACf,MAAI;AACF,UAAMC,QAAMC,UAAQ,IAAI,MAAM,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAM,QAAQ;AAAA,MACZ,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC3B,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,QACE,UAAU,OAAO,SAAS,uBACtB,GAAG,OAAO,MAAM,GAAG,oBAAoB,CAAC,WACxC;AAAA,MACN,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,YAAY,UAAU;AAAA,IAC7D;AACA,UAAMC,YAAW,IAAI,MAAM,SAAS,KAAK,UAAU,KAAK,IAAI,MAAM,MAAM;AAAA,EAC1E,QAAQ;AAAA,EAER;AACF;AAEA,IAAM,qBAAqB;AAI3B,SAAS,gBAAgB,MAAc,SAA2B;AAChE,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAIC,SAAQ;AACZ,aAAW,KAAK,SAAS;AACvB,QAAI,MAAM,MAAO,CAAAA,UAAS;AAAA,aACjB,EAAE,UAAU,KAAK,MAAM,SAAS,CAAC,EAAG,CAAAA,UAAS;AAAA,EACxD;AACA,SAAOA;AACT;AASO,SAAS,eACd,OACA,WACA,OACA,UACA,WAAW,WAAW,EAAE,kBAChB;AACR,QAAM,WAAW,UAAU,MAAM,MAAM,GAAG,CAAC;AAC3C,QAAM,WAAW,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AAEpD,QAAM,aAAa,oBAAI,IAA0B;AACjD,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,YAAY,CAAC,SAAS,IAAI,EAAE,IAAI,EAAG;AAClD,UAAM,OAAO,WAAW,IAAI,EAAE,IAAI;AAClC,QAAI,KAAM,MAAK,KAAK,CAAC;AAAA,QAChB,YAAW,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,EACjC;AAEA,QAAM,UAAU,cAAc,KAAK;AACnC,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,UAAU;AACxB,UAAM,QAAQ,WAAW,IAAI,EAAE,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAC9F,QAAI,KAAK,WAAW,GAAG;AAErB,cAAQ,KAAK,oCAA+B,EAAE,IAAI,IAAI;AACtD;AAAA,IACF;AACA,UAAM,SAAS,KACZ,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,gBAAgB,EAAE,MAAM,OAAO,EAAE,EAAE,EAC3D,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EACzB,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGnC,UAAM,QAAQ,OAAO,SAAS,IAAI,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK,MAAM,GAAG,CAAC;AACtF,eAAW,KAAK,OAAO;AACrB,YAAM,MAAM,IAAI,EAAE,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC;AACnD,YAAM,UACJ,IAAI,SAAS,qBAAqB,GAAG,IAAI,MAAM,GAAG,qBAAqB,CAAC,CAAC,WAAM;AACjF,cAAQ,KAAK,oCAA+B,EAAE,IAAI,KAAK,EAAE,IAAI;AAAA,IAAS,OAAO,EAAE;AAAA,IACjF;AAAA,EACF;AAEA,QAAM,SACJ,wBAAwB,QAAQ,WAAM,UAAU,UAAU,4BAA4B,KAAK;AAAA;AAAA;AAE7F,QAAM,SAAS;AAAA,2CAA8C,KAAK;AAElE,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO,OAAO,SAAS,OAAO,SAAS;AAC3C,aAAW,KAAK,SAAS;AACvB,QAAI,OAAO,EAAE,SAAS,IAAI,SAAU;AACpC,UAAM,KAAK,CAAC;AACZ,YAAQ,EAAE,SAAS;AAAA,EACrB;AAEA,MAAI,MAAM,WAAW,GAAG;AAEtB,UAAM,MAAM,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,IAAI;AACjD,WACE,eAAe,UAAU,UAAU,4BAA4B,KAAK,iBAAiB,GAAG,wCACnD,KAAK,iBAAiB,QAAQ;AAAA,EAGvE;AAEA,SAAO,GAAG,MAAM;AAAA,EAAK,MAAM,KAAK,IAAI,CAAC;AAAA,EAAK,MAAM;AAClD;AAEA,eAAsB,WAAW,KAAkB,KAA2C;AAC5F,MAAI,CAAC,KAAK,aAAa,OAAO,IAAI,cAAc,UAAU;AACxD,WAAO,EAAE,UAAU,SAAS,QAAQ,eAAe;AAAA,EACrD;AAIA,MAAI,IAAI,cAAc,QAAQ;AAC5B,UAAMC,SACJ,IAAI,cAAc,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa,CAAC;AAE3E,UAAM,YAAYA,QAAO,GAAG;AAC5B,WAAO,EAAE,UAAU,QAAQ;AAAA,EAC7B;AAEA,MAAI,CAAC,gBAAgB,IAAI,IAAI,SAAS,GAAG;AACvC,WAAO,EAAE,UAAU,QAAQ;AAAA,EAC7B;AAEA,QAAM,QACJ,IAAI,cAAc,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa,CAAC;AAE3E,QAAM,QAAQ,aAAa,IAAI,WAAW,KAAK;AAC/C,MAAI,CAAC,OAAO;AACV,UAAMC,OAAoB,EAAE,UAAU,SAAS,QAAQ,uBAAuB;AAC9E,UAAM,YAAY,KAAK,IAAI,WAAW,MAAMA,KAAI,UAAUA,KAAI,MAAM;AACpE,WAAOA;AAAA,EACT;AAIA,MAAI,IAAI,cAAc,UAAU,wBAAwB,KAAK,GAAG;AAC9D,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ,IAAI,KAAK;AAAA,IACnB;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAEA,QAAM,YAAY,MAAM,SAAS,IAAI,OAAO,KAAK;AAMjD,MAAI,UAAU,eAAe,OAAO;AAClC,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ,+CAA0C,KAAK,cAAc,IAAI,SAAS;AAAA,IACpF;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAKA,QAAM,UAAU,IAAI,IAAI,cAAc,KAAK,CAAC;AAC5C,QAAM,cAAc,IAAI,SAAS,gBAAgB,yBAAyB;AAC1E,QAAM,UAAU,4BAA4B,aAAa,SAAS,IAAI,KAAK;AAE3E,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QACE,cAAc,UAAU,UAAU,2BAA2B,QAAQ,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,gDACnD,IAAI,SAAS;AAAA,IACzD;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAKA,MAAI,CAAC,UAAU,eAAe;AAC5B,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QACE,cAAc,UAAU,UAAU,wGACI,IAAI,SAAS;AAAA,IACvD;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAEA,QAAM,OAAO,eAAe,OAAO,WAAW,IAAI,OAAO,IAAI,SAAS;AACtE,QAAM,MAAoB,EAAE,UAAU,SAAS,QAAQ,KAAK;AAC5D,QAAM,YAAY,KAAK,IAAI,WAAW,OAAO,IAAI,UAAU,MAAM,KAAK,MAAM;AAC5E,SAAO;AACT;;;AG9SA,SAAS,cAAAC,aAAY,SAAAC,eAAa;AAClC,SAAS,WAAAC,iBAAe;AAmBxB,eAAsB,UAAU,OAAiB,KAA0C;AACzF,MAAI,CAAC,SAAS,OAAO,MAAM,iBAAiB,YAAY,OAAO,MAAM,kBAAkB,UAAU;AAC/F,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAEA,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1C,QAAM,SAAS,EAAE,GAAG,OAAO,WAAW;AACtC,QAAMD,QAAMC,UAAQ,IAAI,MAAM,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,QAAMF,YAAW,IAAI,MAAM,UAAU,KAAK,UAAU,MAAM,IAAI,MAAM,MAAM;AAE1E,SAAO,EAAE,IAAI,MAAM,WAAW;AAChC;;;ACdA,eAAsB,WAAW,KAAkB,KAA2C;AAC5F,MAAI,CAAC,KAAK,SAAS,OAAO,IAAI,UAAU,UAAU;AAChD,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AAEA,QAAM,sBAAsB,IAAI,SAAS,gBAAgB,KAAK,KAAK,GAAI;AACvE,QAAM,cAAc,IAAI,OAAO,gBAAgB;AAC/C,QAAM,YAAY,MAAM,SAAS,IAAI,OAAO,IAAI,OAAO,EAAE,qBAAqB,YAAY,CAAC;AAG3F,QAAM,WAAW,IAAI,MAAM,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM;AAChE,QAAM,SAAS,WAAW;AAAA,IACxB,YAAY;AAAA,IACZ,OAAO,IAAI;AAAA,IACX,OAAO,IAAI;AAAA,IACX;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,QAAQ;AACtB,QAAI,EAAE,QAAQ,OAAQ,SAAQ,IAAI,EAAE,KAAK,MAAM,EAAE,QAAQ,KAAK,GAAG,CAAC;AAAA,EACpE;AAEA,QAAM,SAAS,MAAM,KAAK,UAAU,OAAO;AAAA,IACzC,OAAO,IAAI;AAAA,IACX,OAAO,IAAI;AAAA,IACX,cAAc,IAAI;AAAA,IAClB,cAAc,IAAI;AAAA,IAClB;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,OAAO,IAAI;AAAA,IACX,YAAY,UAAU;AAAA,IACtB,iBAAiB,UAAU;AAAA,EAC7B;AACF;;;ACpCA,IAAM,0BAA0B;AAEhC,IAAM,YAAY;AAClB,IAAMG,eAAc;AACpB,IAAMC,eAAc;AAEpB,SAAS,aAAa,KAA4B;AAChD,QAAM,IAAI,IAAI;AACd,SACE,8BAA8B,EAAE,IAAI;AAAA,EACjC,EAAE,UAAU,mBAAmB,EAAE,YAAY;AAGpD;AAEA,SAAS,WAAW,MAA6B;AAC/C,SAAO;AAAA,IACL,KAAK,cAAc,UACjB,KAAK,aAAa,UAClB,KAAK,QAAQ,MAAM,UACnB,KAAK,QAAQ,KAAK,UAClB,KAAK,QAAQ,UAAU;AAAA,EAC3B;AACF;AAEA,SAAS,kBAAkB,MAAoB,WAA2B;AACxE,QAAM,SAAS,CAAC,MAAe,MAAM,IAAI,KAAK;AAC9C,QAAM,OACJ,sCAAiC,KAAK,MAAM,MACxC,KAAK,cAAc,MAAM,UAAU,OAAO,KAAK,cAAc,MAAM,CAAC,KACrE,KAAK,aAAa,MAAM,QAAQ,OAAO,KAAK,aAAa,MAAM,CAAC;AAGrE,QAAM,YAAsB,CAAC,IAAI;AACjC,MAAI,KAAK,WAAW,WAAW;AAC7B,cAAU,KAAK,EAAE;AACjB,cAAU;AAAA,MACR,8BAA8B,KAAK,MAAM,qBAAqB,SAAS;AAAA,IACzE;AAAA,EACF;AACA,MAAI,KAAK,QAAQ,MAAM,CAAC,GAAG;AACzB,cAAU,KAAK,IAAI,mBAAmB,KAAK,KAAK,QAAQ,MAAM,CAAC,CAAC,EAAE;AAAA,EACpE;AACA,MAAI,KAAK,QAAQ,KAAK,QAAQ;AAC5B,cAAU,KAAK,IAAI,qBAAqB;AACxC,eAAW,KAAK,KAAK,QAAQ,KAAK,MAAM,GAAGA,YAAW,EAAG,WAAU,KAAK,KAAK,CAAC,EAAE;AAAA,EAClF;AACA,MAAI,KAAK,QAAQ,UAAU,QAAQ;AACjC,cAAU,KAAK,IAAI,sBAAsB;AACzC,eAAW,KAAK,KAAK,QAAQ,UAAU,MAAM,GAAGA,YAAW,EAAG,WAAU,KAAK,KAAK,CAAC,EAAE;AAAA,EACvF;AAIA,QAAM,QAAkB,CAAC;AACzB,MAAI,KAAK,cAAc,QAAQ;AAC7B,UAAM,KAAK,IAAI,oBAAoB;AACnC,eAAW,KAAK,KAAK,cAAc,MAAM,GAAGD,YAAW,GAAG;AACxD,YAAM,OAAO,EAAE,OAAO,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC,MAAM;AACpD,YAAM,KAAK,OAAO,EAAE,IAAI,MAAM,EAAE,OAAO,GAAG,IAAI,EAAE;AAAA,IAClD;AAAA,EACF;AACA,MAAI,KAAK,aAAa,QAAQ;AAC5B,UAAM,QAAQ,KAAK,aAAa,MAAM,GAAG,SAAS;AAClD,UAAM,OAAO,KAAK,aAAa,SAAS,MAAM;AAC9C,UAAM,KAAK,IAAI,qBAAqB,MAAM,KAAK,IAAI,KAAK,OAAO,IAAI,MAAM,IAAI,UAAU,GAAG;AAAA,EAC5F;AAEA,MAAI,MAAM,UAAU,KAAK,IAAI;AAC7B,aAAW,QAAQ,OAAO;AACxB,SAAK,MAAM,OAAO,MAAM,SAAS,wBAAyB;AAC1D,WAAO,OAAO;AAAA,EAChB;AACA,UACE,IAAI,SAAS,0BAA0B,IAAI,MAAM,GAAG,uBAAuB,IAAI,KAC/E,QAAQ;AACZ;AAEA,eAAsB,YAAY,KAAoB,MAAsC;AAC1F,QAAM,SAAS,aAAa,GAAG;AAE/B,QAAM,OAAO,MAAM,YAAY,IAAI,MAAM,YAAY;AACrD,MAAI,CAAC,QAAQ,CAAC,WAAW,IAAI,GAAG;AAC9B,WAAO,EAAE,QAAQ,QAAQ,KAAK;AAAA,EAChC;AAEA,QAAM,YAAY,MAAM,cAAc,IAAI,MAAM,WAAW;AAC3D,QAAM,SAAS,kBAAkB,MAAM,SAAS;AAChD,SAAO,EAAE,QAAQ,GAAG,MAAM;AAAA;AAAA;AAAA;AAAA,EAAc,MAAM,IAAI,KAAK;AACzD;;;A5DtEA,eAAe,YAAY,OAA6C;AACtE,MAAI;AACF,QAAI,CAAC,OAAO,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC3C,UAAU,MAAM,SAAS;AAAA,MACzB,gBAAgB,MAAM,WAAW;AAAA,IACnC,CAAC;AAID,QAAI,MAAM,mBAAmB,gBAAgB;AAC3C,UAAI,KAAK,iBAAiB,MAAM,cAAc,oBAAe,cAAc,0BAAgB;AAC3F,YAAM,YAAY,MAAM,aAAa,EAAE,QAAQ,KAAK,CAAC;AACrD,OAAC,OAAO,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,QACvC,UAAU,MAAM,SAAS;AAAA,QACzB,gBAAgB,MAAM,WAAW;AAAA,MACnC,CAAC;AAAA,IACH;AACA,UAAM,WAAW,IAAI,cAAc,MAAM,WAAW;AAGpD,UAAM,QAAQ,MAAM,aAAa,KAAK,MAAM,WAAW,MAAM,UAAU;AACvE,WAAO,EAAE,OAAO,OAAO,aAAa,UAAU,MAAM;AAAA,EACtD,SAASE,MAAK;AACZ,UAAM,IAAI;AAAA,MACR,6BAA6B,MAAM,SAAS,KAAMA,KAAc,OAAO;AAAA,IAEzE;AAAA,EACF;AACF;AAEA,SAAS,SAAS,KAAoB,MAAoB;AACxD,QAAM,MAAM,IAAI,KAAK;AAErB,MAAI;AAAA,IAAI;AAAA,IAAK,CAAC,MACZ,EAAE,KAAK;AAAA,MACL,SAAS;AAAA,MACT,SAAS;AAAA,MACT;AAAA,MACA,YAAY,IAAI,MAAM;AAAA,MACtB,cAAc,IAAI,MAAM;AAAA,MACxB,cAAc,IAAI,MAAM;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,IAAI,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,CAAC;AAE9C,MAAI,IAAI,UAAU,OAAO,MAAM,EAAE,KAAK,MAAM,YAAY,KAAK,IAAI,CAAC,CAAC;AAEnE,MAAI,KAAK,SAAS,OAAO,MAAM;AAC7B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,WAAW,MAAM,GAAG,CAAC;AAAA,EAC3C,CAAC;AAED,MAAI,KAAK,QAAQ,OAAO,MAAM;AAC5B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,UAAU,MAAM,GAAG,CAAC;AAAA,EAC1C,CAAC;AAED,MAAI,KAAK,SAAS,OAAO,MAAM;AAC7B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,WAAW,MAAM,GAAG,CAAC;AAAA,EAC3C,CAAC;AAED,MAAI,IAAI,aAAa,OAAO,MAAM;AAChC,UAAM,aAAa,EAAE,IAAI,MAAM,OAAO;AACtC,UAAM,UAAU,aAAa,OAAO,UAAU,IAAI;AAClD,WAAO,EAAE,KAAK,MAAM,eAAe,OAAO,SAAS,OAAO,IAAI,UAAU,QAAW,GAAG,CAAC;AAAA,EACzF,CAAC;AAED,MAAI,KAAK,mBAAmB,OAAO,MAAM;AACvC,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,oBAAoB,MAAM,GAAG,CAAC;AAAA,EACpD,CAAC;AAED,MAAI,KAAK,QAAQ,OAAO,MAAM;AAC5B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI;AAChD,WAAO,EAAE,KAAK,MAAM,iBAAiB,MAAM,GAAG,CAAC;AAAA,EACjD,CAAC;AAED,MAAI,QAAQ,CAACA,MAAK,MAAM;AACtB,QAAI,MAAM,gBAAgBA,KAAI,OAAO;AACrC,WAAO,EAAE,KAAK,EAAE,OAAOA,KAAI,QAAQ,GAAG,GAAG;AAAA,EAC3C,CAAC;AAED,SAAO;AACT;AAEA,eAAsB,YACpB,OACA,UAAwB,CAAC,GACF;AACvB,QAAM,MAAM,MAAM,YAAY,KAAK;AACnC,QAAM,OAAO,QAAQ,QAAS,MAAM,aAAa;AAEjD,QAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,QAAM,aAAa,MAAM,EAAE,OAAO,IAAI,OAAO,MAAM,UAAU,YAAY,CAAC;AAE1E,QAAMC,WAAU,MAAM,SAAS,OAAO,IAAI,GAAG,MAAM;AAMnD,QAAM,MAAM,WAAW;AACvB,QAAM,YAA8B,IAAI,cACpC,gBAAgB,KAAK,OAAO,EAAE,YAAY,IAAI,kBAAkB,CAAC,IACjE;AAIJ,QAAM,cAA2B,kBAAkB,MAAM,aAAa,CAAC,MAAM;AAC3E,SAAK,IAAI,SAAS,IAAI,CAAC;AACvB,eAAW,SAAS;AAAA,EACtB,CAAC;AACD,QAAM,aAAyB,iBAAiB,MAAM,aAAa,OAAO,MAAM;AAC9E,UAAM,IAAI,SAAS,IAAI,CAAC;AAGxB,QAAI,EAAE,SAAS,iBAAiB;AAC9B,YAAM,KAAM,EAAE,SAAyC,MAAM;AAC7D,YAAM,cAAc,KAAK,OAAO,UAAU,EAAE,EAAE;AAAA,IAChD;AAAA,EACF,CAAC;AACD,MAAI;AACF,UAAM,YAAY,MAAM;AAAA,EAC1B,SAASD,MAAK;AACZ,QAAI,KAAK,iCAAkCA,KAAc,OAAO,EAAE;AAAA,EACpE;AACA,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,EACzB,SAASA,MAAK;AACZ,QAAI,KAAK,gCAAiCA,KAAc,OAAO,EAAE;AAAA,EACnE;AAEA,QAAM,MAAM,oBAAoB,IAAI;AAEpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,MAAM,OAAO;AACX,iBAAW,KAAK;AAChB,YAAM,YAAY,KAAK,EAAE,MAAM,MAAM,MAAS;AAC9C,YAAM,WAAW,KAAK,EAAE,MAAM,MAAM,MAAS;AAE7C,YAAM,IAAI,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AAC9C,YAAM,IAAI,QAAc,CAACE,UAAS,WAAW;AAC3C,mBAAW,MAAM,CAACF,SAASA,OAAM,OAAOA,IAAG,IAAIE,SAAQ,CAAE;AAAA,MAC3D,CAAC;AAAA,IACH;AAAA,EACF;AACF;","names":["writeFile","emit","err","readFile","join","dirname","join","mkdir","readFile","dirname","readFile","QUERY","QUERY","Query","QUERY","firstLine","Query","QUERY","QUERY","QUERY","QUERY","Query","QUERY","firstLine","Query","QUERY","QUERY","Query","firstLine","Query","SCRIPT_RE","extractScripts","require","readFile","mkdir","dirname","readFile","join","relative","sep","ignore","readIgnoreFile","buildMatcher","toPosix","mkdir","readFile","writeFile","dirname","join","mkdir","readFile","stat","writeFile","basename","readFile","writeFile","dirname","stat","mkdir","readFile","writeFile","basename","appendFile","mkdir","readFile","writeFile","dirname","stat","readFile","mkdir","dirname","writeFile","appendFile","appendFile","mkdir","dirname","STOPWORDS","score","execFile","readFile","join","promisify","execFileAsync","mkdir","readFile","writeFile","dirname","mkdir","readFile","writeFile","dirname","SCHEMA_VERSION","score","indexSymbolsByFile","tline","resolve","sep","join","mkdir","dirname","appendFile","resolve","err","execFile","promisify","execFileAsync","mkdir","readFile","writeFile","dirname","appendFile","mkdir","dirname","appendFile","mkdir","dirname","hasContent","mkdir","dirname","appendFile","mkdir","dirname","appendFile","score","input","res","appendFile","mkdir","dirname","MAX_COMMITS","MAX_BULLETS","err","writeFile","resolve"]}
1
+ {"version":3,"sources":["../../src/server/http.ts","../../src/activity/activity-log.ts","../../src/activity/file-watcher.ts","../../src/shared/logger.ts","../../src/activity/git-watcher.ts","../../src/cli/scan-command.ts","../../src/scanner/extract.ts","../../src/graph/types.ts","../../src/scanner/hash.ts","../../src/scanner/keywords.ts","../../src/scanner/parse-cache.ts","../../src/scanner/parser.ts","../../src/scanner/parsers/_generic.ts","../../src/scanner/parsers/c.ts","../../src/scanner/parsers/cpp.ts","../../src/scanner/parsers/csharp.ts","../../src/scanner/parsers/dart.ts","../../src/scanner/parsers/go.ts","../../src/scanner/parsers/hubl.ts","../../src/scanner/parsers/java.ts","../../src/scanner/parsers/kotlin.ts","../../src/scanner/parsers/php.ts","../../src/scanner/parsers/python.ts","../../src/scanner/parsers/ruby.ts","../../src/scanner/parsers/rust.ts","../../src/scanner/parsers/typescript.ts","../../src/scanner/parsers/svelte.ts","../../src/scanner/parsers/vue.ts","../../src/scanner/walker.ts","../../src/graph/store.ts","../../src/shared/paths.ts","../../src/cli/bootstrap.ts","../../src/hooks/claude-md.ts","../../src/learn/store.ts","../../src/learn/usage.ts","../../src/learn/runtime.ts","../../src/shared/config.ts","../../src/server/mcp.ts","../../src/graph/rank.ts","../../src/graph/retrieve.ts","../../src/memory/branches.ts","../../src/memory/context-md.ts","../../src/memory/context-store.ts","../../src/memory/index.ts","../../src/packer/format.ts","../../src/packer/inline.ts","../../src/packer/signatures.ts","../../src/packer/tests.ts","../../src/packer/index.ts","../../src/server/port.ts","../../src/server/reindex.ts","../../src/server/routes/activity.ts","../../src/memory/git-snapshot.ts","../../src/memory/session.ts","../../src/server/routes/context-update.ts","../../src/server/routes/gate.ts","../../src/server/routes/bash-observe.ts","../../src/server/routes/query-heuristics.ts","../../src/server/routes/log.ts","../../src/server/routes/pack.ts","../../src/server/routes/prime.ts"],"sourcesContent":["// HTTP server (Hono). Hosts the routes hooks need (/prime, /pack, /log,\n// /gate, /activity) and serves the loaded graph from memory. The MCP-protocol\n// envelope (/mcp endpoint, JSON-RPC) is wired in M3.\n\nimport { serve } from \"@hono/node-server\";\nimport { Hono } from \"hono\";\nimport { writeFile } from \"node:fs/promises\";\n\nimport { ActivityStore } from \"../activity/activity-log.js\";\nimport { createFileWatcher, type FileWatcher } from \"../activity/file-watcher.js\";\nimport { createGitWatcher, type GitWatcher } from \"../activity/git-watcher.js\";\nimport { scanProject } from \"../cli/scan-command.js\";\nimport { readGraph, readSymbolIndex } from \"../graph/store.js\";\nimport { SCHEMA_VERSION } from \"../graph/types.js\";\nimport { LearnRuntime } from \"../learn/runtime.js\";\nimport { loadConfig } from \"../shared/config.js\";\nimport { log } from \"../shared/logger.js\";\nimport type { SynthraPaths } from \"../shared/paths.js\";\nimport type { ServerContext } from \"./context.js\";\nimport { handleMcpRequest } from \"./mcp.js\";\nimport { findFreePort } from \"./port.js\";\nimport { type Reindexer, createReindexer, rescanAndSwap } from \"./reindex.js\";\nimport { handleActivity } from \"./routes/activity.js\";\nimport { handleContextUpdate } from \"./routes/context-update.js\";\nimport { handleGate } from \"./routes/gate.js\";\nimport { handleLog } from \"./routes/log.js\";\nimport { handlePack } from \"./routes/pack.js\";\nimport { handlePrime } from \"./routes/prime.js\";\n\nexport interface ServerHandle {\n port: number;\n url: string;\n stop(): Promise<void>;\n}\n\nexport interface StartOptions {\n /** Override the port range search. */\n port?: number;\n}\n\nasync function loadContext(paths: SynthraPaths): Promise<ServerContext> {\n try {\n let [graph, symbolIndex] = await Promise.all([\n readGraph(paths.infoGraph),\n readSymbolIndex(paths.symbolIndex),\n ]);\n // Schema-migration check (#8): a graph written by an older Synthra may have\n // an incompatible on-disk shape. On a version mismatch, auto-rescan once and\n // reload, rather than serving a stale/incompatible graph.\n if (graph.schema_version !== SCHEMA_VERSION) {\n log.info(`graph schema v${graph.schema_version} ≠ current v${SCHEMA_VERSION} — rescanning…`);\n await scanProject(paths.projectRoot, { silent: true });\n [graph, symbolIndex] = await Promise.all([\n readGraph(paths.infoGraph),\n readSymbolIndex(paths.symbolIndex),\n ]);\n }\n const activity = new ActivityStore(paths.activityLog);\n // Usage-learning runtime: loads the decayed aggregate (replaying the raw\n // access log if the aggregate is cold). Best-effort — never blocks startup.\n const learn = await LearnRuntime.load(paths.accessLog, paths.learnStore);\n return { paths, graph, symbolIndex, activity, learn };\n } catch (err) {\n throw new Error(\n `failed to load graph from ${paths.infoGraph}: ${(err as Error).message}. ` +\n `Run \\`syn scan\\` first.`,\n );\n }\n}\n\nfunction buildApp(ctx: ServerContext, port: number): Hono {\n const app = new Hono();\n\n app.get(\"/\", (c) =>\n c.json({\n service: \"synthra\",\n version: \"0.0.1\",\n port,\n file_count: ctx.graph.file_count,\n symbol_count: ctx.graph.symbol_count,\n generated_at: ctx.graph.generated_at,\n }),\n );\n\n app.get(\"/health\", (c) => c.json({ ok: true }));\n\n app.get(\"/prime\", async (c) => c.json(await handlePrime(ctx, port)));\n\n app.post(\"/pack\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handlePack(body, ctx));\n });\n\n app.post(\"/log\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handleLog(body, ctx));\n });\n\n app.post(\"/gate\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handleGate(body, ctx));\n });\n\n app.get(\"/activity\", async (c) => {\n const sinceParam = c.req.query(\"since\");\n const sinceMs = sinceParam ? Number(sinceParam) : undefined;\n return c.json(await handleActivity(Number.isFinite(sinceMs) ? sinceMs : undefined, ctx));\n });\n\n app.post(\"/context-update\", async (c) => {\n const body = await c.req.json().catch(() => ({}));\n return c.json(await handleContextUpdate(body, ctx));\n });\n\n app.post(\"/mcp\", async (c) => {\n const body = await c.req.json().catch(() => null);\n return c.json(await handleMcpRequest(body, ctx));\n });\n\n app.onError((err, c) => {\n log.error(\"route error:\", err.message);\n return c.json({ error: err.message }, 400);\n });\n\n return app;\n}\n\nexport async function startServer(\n paths: SynthraPaths,\n options: StartOptions = {},\n): Promise<ServerHandle> {\n const ctx = await loadContext(paths);\n const port = options.port ?? (await findFreePort());\n\n const app = buildApp(ctx, port);\n const nodeServer = serve({ fetch: app.fetch, port, hostname: \"127.0.0.1\" });\n\n await writeFile(paths.mcpPort, String(port), \"utf8\");\n\n // Auto-reindex: a source edit re-runs the incremental scan + swaps the\n // in-memory graph so reads never go stale mid-session (debounced; opt out with\n // SYN_NO_AUTOREINDEX). The watcher already ignores .synthra-graph/, so a scan's\n // own writes can't loop back.\n const cfg = loadConfig();\n const reindexer: Reindexer | null = cfg.autoReindex\n ? createReindexer(ctx, paths, { debounceMs: cfg.reindexDebounceMs })\n : null;\n\n // Spin up the human-activity watchers. Both are best-effort — if chokidar\n // can't watch (e.g. unsupported FS) or .git is missing, they no-op silently.\n const fileWatcher: FileWatcher = createFileWatcher(paths.projectRoot, (e) => {\n void ctx.activity.add(e);\n reindexer?.schedule();\n });\n const gitWatcher: GitWatcher = createGitWatcher(paths.projectRoot, async (e) => {\n await ctx.activity.add(e);\n // Per-branch graph: rebuild on branch switch so the in-memory graph\n // matches whichever branch is currently checked out.\n if (e.kind === \"branch-switch\") {\n const to = (e.details as { to?: string } | undefined)?.to ?? \"unknown\";\n await rescanAndSwap(ctx, paths, `branch ${to}`);\n }\n });\n try {\n await fileWatcher.start();\n } catch (err) {\n log.warn(`file watcher failed to start: ${(err as Error).message}`);\n }\n try {\n await gitWatcher.start();\n } catch (err) {\n log.warn(`git watcher failed to start: ${(err as Error).message}`);\n }\n\n const url = `http://127.0.0.1:${port}`;\n\n return {\n port,\n url,\n async stop() {\n reindexer?.stop();\n await fileWatcher.stop().catch(() => undefined);\n await gitWatcher.stop().catch(() => undefined);\n // Persist any pending usage signal before we go down.\n await ctx.learn?.flush().catch(() => undefined);\n await new Promise<void>((resolve, reject) => {\n nodeServer.close((err) => (err ? reject(err) : resolve()));\n });\n },\n };\n}\n","// Rolling JSONL log of human activity, written to .synthra-graph/activity.jsonl.\n// In-memory ring buffer for fast queries; disk append for durability.\n//\n// The buffer is bounded (defaults to 100 events) so we don't unbounded-grow\n// memory in long sessions. Disk gets every event so the dashboard / future\n// audit tooling can replay history.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nexport interface FileEvent {\n kind: \"save\" | \"create\" | \"delete\";\n path: string;\n ts: string;\n}\n\nexport interface GitEvent {\n kind: \"branch-switch\" | \"stage\" | \"unstage\" | \"diff-change\";\n details: Record<string, unknown>;\n ts: string;\n}\n\nexport type ActivityEvent = FileEvent | GitEvent;\n\nconst DEFAULT_RING_SIZE = 100;\n\nexport class ActivityStore {\n private ring: ActivityEvent[] = [];\n private readonly maxRingSize: number;\n private readonly persistPath: string;\n\n constructor(persistPath: string, maxRingSize = DEFAULT_RING_SIZE) {\n this.persistPath = persistPath;\n this.maxRingSize = maxRingSize;\n }\n\n async add(event: ActivityEvent): Promise<void> {\n this.ring.push(event);\n while (this.ring.length > this.maxRingSize) this.ring.shift();\n await this.persist(event);\n }\n\n /** Get events newer than `sinceMs` (epoch ms). If omitted, returns the full ring. */\n getEvents(sinceMs?: number): ActivityEvent[] {\n if (!sinceMs || !Number.isFinite(sinceMs)) return this.ring.slice();\n const cutoff = new Date(sinceMs).toISOString();\n return this.ring.filter((e) => e.ts >= cutoff);\n }\n\n /** Project-relative file paths that have a save/create event newer than `maxAgeMs` ms ago. */\n recentFilePaths(maxAgeMs: number): string[] {\n const cutoff = new Date(Date.now() - maxAgeMs).toISOString();\n const out = new Set<string>();\n for (const e of this.ring) {\n if (\"path\" in e && (e.kind === \"save\" || e.kind === \"create\") && e.ts >= cutoff) {\n out.add(e.path);\n }\n }\n return Array.from(out);\n }\n\n size(): number {\n return this.ring.length;\n }\n\n private async persist(event: ActivityEvent): Promise<void> {\n try {\n await mkdir(dirname(this.persistPath), { recursive: true });\n await appendFile(this.persistPath, JSON.stringify(event) + \"\\n\", \"utf8\");\n } catch {\n // Durability is best-effort; an unwritable disk shouldn't crash the server.\n }\n }\n}\n","// chokidar-based file watcher. Emits save/create/delete events for human\n// edits inside the project. Respects .gitignore + .synthraignore plus a\n// hard-coded list of always-ignored directories (.git, .synthra*, .claude,\n// node_modules, dist, build, coverage).\n\nimport chokidar, { type FSWatcher } from \"chokidar\";\nimport { readFile } from \"node:fs/promises\";\nimport { join, relative, sep } from \"node:path\";\nimport ignore, { type Ignore } from \"ignore\";\n\nimport { log } from \"../shared/logger.js\";\nimport type { FileEvent } from \"./activity-log.js\";\n\nconst ALWAYS_IGNORE = [\n \".git\",\n \".synthra\",\n \".synthra-graph\",\n \".claude\",\n \"node_modules\",\n \"dist\",\n \"build\",\n \"out\",\n \"coverage\",\n \".next\",\n \".nuxt\",\n \".svelte-kit\",\n \".turbo\",\n \".cache\",\n \".vscode\",\n \".idea\",\n];\n\nexport interface FileWatcher {\n start(): Promise<void>;\n stop(): Promise<void>;\n}\n\nexport type FileEventHandler = (e: FileEvent) => void | Promise<void>;\n\nasync function readIgnoreFile(path: string): Promise<string[]> {\n try {\n const text = await readFile(path, \"utf8\");\n return text\n .split(/\\r?\\n/)\n .map((l) => l.trim())\n .filter((l) => l.length > 0 && !l.startsWith(\"#\"));\n } catch {\n return [];\n }\n}\n\nasync function buildMatcher(root: string): Promise<Ignore> {\n const ig = ignore();\n ig.add(ALWAYS_IGNORE.map((d) => `${d}/`));\n ig.add(await readIgnoreFile(join(root, \".gitignore\")));\n ig.add(await readIgnoreFile(join(root, \".synthraignore\")));\n return ig;\n}\n\nfunction toPosixRel(root: string, abs: string): string {\n const rel = relative(root, abs);\n return sep === \"/\" ? rel : rel.split(sep).join(\"/\");\n}\n\nexport function createFileWatcher(root: string, onEvent: FileEventHandler): FileWatcher {\n let watcher: FSWatcher | null = null;\n let ig: Ignore | null = null;\n\n const emit = async (kind: FileEvent[\"kind\"], abs: string) => {\n if (!ig) return;\n const rel = toPosixRel(root, abs);\n if (!rel || rel.startsWith(\"..\")) return;\n if (ig.ignores(rel)) return;\n try {\n await onEvent({ kind, path: rel, ts: new Date().toISOString() });\n } catch {\n // swallow handler errors — watcher must keep going\n }\n };\n\n return {\n async start() {\n ig = await buildMatcher(root);\n watcher = chokidar.watch(root, {\n // Cross-platform glob ignore. We match both the directory itself and\n // anything inside it. picomatch (chokidar's matcher) normalizes path\n // separators so a single set of forward-slash globs handles\n // Windows + POSIX. Function-based ignore was unreliable on Windows\n // and let chokidar descend into .git/, which crashed on transient\n // index.lock files held exclusively by git.\n ignored: ALWAYS_IGNORE.flatMap((d) => [`**/${d}`, `**/${d}/**`]),\n ignoreInitial: true,\n persistent: true,\n awaitWriteFinish: { stabilityThreshold: 150, pollInterval: 50 },\n });\n\n // Chokidar emits \"error\" for transient OS-level issues — most commonly\n // EPERM/ENOENT on rapidly created+deleted files. We never want one of\n // these to crash the syn process. Log + swallow.\n watcher.on(\"error\", (err) => {\n const e = err as NodeJS.ErrnoException;\n log.debug(`file watcher error (swallowed): ${e?.code ?? \"\"} ${e?.message ?? String(err)}`);\n });\n\n watcher.on(\"add\", (path) => emit(\"create\", path));\n watcher.on(\"change\", (path) => emit(\"save\", path));\n watcher.on(\"unlink\", (path) => emit(\"delete\", path));\n },\n\n async stop() {\n if (watcher) {\n await watcher.close();\n watcher = null;\n }\n },\n };\n}\n","// Minimal logger. Prefixes Synthra output with [syn].\n\ntype Level = \"debug\" | \"info\" | \"warn\" | \"error\";\n\nconst LEVEL_PRIORITY: Record<Level, number> = {\n debug: 10,\n info: 20,\n warn: 30,\n error: 40,\n};\n\nlet activeLevel: Level = (process.env.SYN_LOG_LEVEL as Level) ?? \"info\";\n\nexport function setLevel(level: Level): void {\n activeLevel = level;\n}\n\nfunction shouldLog(level: Level): boolean {\n return LEVEL_PRIORITY[level] >= LEVEL_PRIORITY[activeLevel];\n}\n\nfunction emit(level: Level, msg: string, ...args: unknown[]): void {\n if (!shouldLog(level)) return;\n const stream = level === \"error\" || level === \"warn\" ? process.stderr : process.stdout;\n stream.write(`[syn] ${msg}${args.length ? \" \" + args.map(String).join(\" \") : \"\"}\\n`);\n}\n\nexport const log = {\n debug: (m: string, ...a: unknown[]) => emit(\"debug\", m, ...a),\n info: (m: string, ...a: unknown[]) => emit(\"info\", m, ...a),\n warn: (m: string, ...a: unknown[]) => emit(\"warn\", m, ...a),\n error: (m: string, ...a: unknown[]) => emit(\"error\", m, ...a),\n};\n","// Watches `.git/HEAD` for branch switches (via fs.watch) and polls\n// `git status --porcelain` every ~2s to surface uncommitted-diff changes.\n// Always best-effort: in a non-git directory or when git is missing, the\n// watcher simply emits nothing.\n\nimport { execFile } from \"node:child_process\";\nimport { watch, type FSWatcher } from \"node:fs\";\nimport { readFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { promisify } from \"node:util\";\n\nimport type { GitEvent } from \"./activity-log.js\";\n\nconst execFileAsync = promisify(execFile);\n\nconst POLL_MS = 2000;\n\nexport interface GitWatcher {\n start(): Promise<void>;\n stop(): Promise<void>;\n}\n\nexport type GitEventHandler = (e: GitEvent) => void | Promise<void>;\n\nasync function readHeadBranch(projectRoot: string): Promise<string | null> {\n try {\n const head = await readFile(join(projectRoot, \".git\", \"HEAD\"), \"utf8\");\n const m = head.trim().match(/^ref:\\s+refs\\/heads\\/(.+)$/);\n return m?.[1] ?? null;\n } catch {\n return null;\n }\n}\n\nasync function readStatusPorcelain(projectRoot: string): Promise<string | null> {\n try {\n const { stdout } = await execFileAsync(\"git\", [\"status\", \"--porcelain\"], {\n cwd: projectRoot,\n });\n return stdout;\n } catch {\n return null;\n }\n}\n\nexport function createGitWatcher(root: string, onEvent: GitEventHandler): GitWatcher {\n let headWatcher: FSWatcher | null = null;\n let pollTimer: NodeJS.Timeout | null = null;\n let lastBranch: string | null = null;\n let lastStatus: string | null = null;\n\n const emitSafe = async (event: GitEvent) => {\n try {\n await onEvent(event);\n } catch {\n // swallow\n }\n };\n\n const checkHead = async () => {\n const branch = await readHeadBranch(root);\n if (branch && branch !== lastBranch) {\n const prev = lastBranch;\n lastBranch = branch;\n if (prev !== null) {\n await emitSafe({\n kind: \"branch-switch\",\n details: { from: prev, to: branch },\n ts: new Date().toISOString(),\n });\n }\n }\n };\n\n const pollStatus = async () => {\n const status = await readStatusPorcelain(root);\n if (status === null) return;\n if (lastStatus !== null && status !== lastStatus) {\n const prevFiles = parseStatusFiles(lastStatus);\n const nowFiles = parseStatusFiles(status);\n const added = nowFiles.filter((f) => !prevFiles.includes(f));\n const removed = prevFiles.filter((f) => !nowFiles.includes(f));\n await emitSafe({\n kind: \"diff-change\",\n details: {\n changed_count: nowFiles.length,\n newly_dirty: added,\n newly_clean: removed,\n },\n ts: new Date().toISOString(),\n });\n }\n lastStatus = status;\n };\n\n return {\n async start() {\n // Seed initial branch + status so the first real change emits an event\n // rather than a stale \"from null\".\n lastBranch = await readHeadBranch(root);\n lastStatus = await readStatusPorcelain(root);\n\n try {\n headWatcher = watch(join(root, \".git\", \"HEAD\"), () => {\n void checkHead();\n });\n // fs.watch emits \"error\" for transient OS issues (EPERM on lock\n // files, ENOENT when refs get rewritten). Swallow them — we never\n // want a transient FS event to crash the syn process.\n headWatcher.on(\"error\", () => {\n // silent — branch-switch detection is best-effort\n });\n } catch {\n // .git/HEAD not present — silently no-op\n }\n\n pollTimer = setInterval(() => {\n void pollStatus();\n }, POLL_MS);\n pollTimer.unref?.();\n },\n\n async stop() {\n if (headWatcher) {\n headWatcher.close();\n headWatcher = null;\n }\n if (pollTimer) {\n clearInterval(pollTimer);\n pollTimer = null;\n }\n },\n };\n}\n\nfunction parseStatusFiles(porcelain: string): string[] {\n return porcelain\n .split(/\\r?\\n/)\n .map((l) => l.slice(3).trim())\n .filter((l) => l.length > 0);\n}\n","// `syn scan [path]` — bootstrap then walk + parse + write graph.\n// Also invoked by the default `syn .` flow (M3 will chain start-claude after).\n\nimport { resolve } from \"node:path\";\n\nimport { buildGraph, buildSymbolIndex } from \"../scanner/extract.js\";\nimport { incrementalParse, readParseCache, writeParseCache } from \"../scanner/parse-cache.js\";\nimport { walk, type WalkedFile } from \"../scanner/walker.js\";\nimport { writeGraph, writeSymbolIndex } from \"../graph/store.js\";\nimport { log } from \"../shared/logger.js\";\nimport { resolvePaths } from \"../shared/paths.js\";\nimport { type BootstrapResult, bootstrap } from \"./bootstrap.js\";\n\nconst PARSABLE_EXTS = new Set([\n \".ts\",\n \".tsx\",\n \".cts\",\n \".mts\",\n \".js\",\n \".jsx\",\n \".cjs\",\n \".mjs\",\n \".py\",\n \".pyi\",\n \".svelte\",\n \".vue\",\n \".go\",\n \".rs\",\n \".java\",\n \".kt\",\n \".kts\",\n \".php\",\n \".rb\",\n \".c\",\n \".h\",\n \".cpp\",\n \".cc\",\n \".cxx\",\n \".hpp\",\n \".hh\",\n \".hxx\",\n \".dart\",\n \".cs\",\n]);\n\nexport interface ScanResult {\n walked: number;\n parsed: number;\n symbolCount: number;\n edgeCount: number;\n durationMs: number;\n}\n\nexport interface ScanOptions {\n /** Suppress per-step log output (used for branch-switch rescans). */\n silent?: boolean;\n /** Ignore the parse cache and re-parse every file from scratch. */\n full?: boolean;\n /**\n * Skip the bootstrap step (directories, .gitignore, CLAUDE.md policy patch).\n * Used by in-session reindexes: the project is already bootstrapped, and\n * rewriting watched root files (CLAUDE.md/.gitignore) from a file-change\n * handler would feed the watcher its own edits — an endless rescan loop.\n */\n skipBootstrap?: boolean;\n}\n\n/**\n * Core scan pipeline — bootstrap + walk + parse + write graph. Importable\n * from anywhere (server, CLI, tests). `scanCommand` is just a logging wrapper\n * around this. Pass `silent: true` to skip the chatty progress output.\n */\nexport async function scanProject(\n projectRootRaw: string,\n opts: ScanOptions = {},\n): Promise<ScanResult> {\n const projectRoot = resolve(projectRootRaw);\n const paths = resolvePaths(projectRoot);\n const start = Date.now();\n const verbose = !opts.silent;\n\n if (verbose) log.info(`scanning ${projectRoot}`);\n\n const boot: BootstrapResult | null = opts.skipBootstrap ? null : await bootstrap(paths);\n if (verbose && boot) {\n if (boot.graphCreated) log.info(\" created .synthra-graph/\");\n if (boot.contextCreated) log.info(\" created .synthra/\");\n if (boot.gitignoreUpdated) log.info(\" updated .gitignore\");\n if (boot.claudeMdCreated) {\n log.info(\" created CLAUDE.md — onboarding skeleton for the agent\");\n log.info(\n \" ↳ fill in Build / Conventions / Decisions (or run /init in Claude to auto-draft)\",\n );\n } else if (boot.claudeMdUpdated) {\n log.info(\" updated CLAUDE.md\");\n }\n }\n\n const walked: WalkedFile[] = [];\n for await (const file of walk(projectRoot)) walked.push(file);\n if (verbose) log.info(` walked ${walked.length} files`);\n\n const parsable = walked.filter((f) => PARSABLE_EXTS.has(f.ext));\n const prevCache = await readParseCache(paths.parseCache);\n const { parsed, cache, reused, reparsed, parseErrors } = await incrementalParse(\n parsable,\n prevCache,\n { full: opts.full },\n );\n if (verbose) {\n log.info(\n ` parsed ${parsed.length} files (${reused} reused · ${reparsed} reparsed` +\n (parseErrors ? `, ${parseErrors} errored` : \"\") +\n `; ${walked.length - parsable.length} non-code skipped)`,\n );\n }\n\n const graph = await buildGraph(projectRoot, parsed);\n const symbolIndex = buildSymbolIndex(graph);\n\n await writeGraph(paths.infoGraph, graph);\n await writeSymbolIndex(paths.symbolIndex, symbolIndex);\n await writeParseCache(paths.parseCache, cache);\n\n if (verbose) {\n log.info(\n ` wrote ${paths.infoGraph} — ${graph.symbol_count} symbols, ${graph.edge_count} edges`,\n );\n log.info(` wrote ${paths.symbolIndex} — ${Object.keys(symbolIndex).length} names`);\n }\n\n const durationMs = Date.now() - start;\n if (verbose) log.info(`done in ${(durationMs / 1000).toFixed(2)}s`);\n\n return {\n walked: walked.length,\n parsed: parsed.length,\n symbolCount: graph.symbol_count,\n edgeCount: graph.edge_count,\n durationMs,\n };\n}\n\n// Thin alias so the CLI command keeps its current name. Drop in v0.2 if we\n// settle on a single public function.\nexport async function scanCommand(rawPath: string, opts: ScanOptions = {}): Promise<ScanResult> {\n return scanProject(rawPath, opts);\n}\n","// Turns ParsedFile[] into a GraphSchema (nodes + edges).\n//\n// Edges produced in M1:\n// defines : file → symbol\n// imports : file → file (when the import target resolves inside the project)\n// tests : test-file → source-file (for foo.test.ts ↔ foo.ts)\n\nimport { dirname, join, posix } from \"node:path\";\n\nimport type { Edge, FileNode, GraphSchema, SymbolIndex, SymbolNode } from \"../graph/types.js\";\nimport { SCHEMA_VERSION } from \"../graph/types.js\";\nimport { fileHash } from \"./hash.js\";\nimport { extractKeywords } from \"./keywords.js\";\nimport type { CallSite, ParsedFile, ParsedSymbol } from \"./parser.js\";\n\nconst RESOLVE_EXTS = [\n \".ts\",\n \".tsx\",\n \".js\",\n \".jsx\",\n \".mjs\",\n \".cjs\",\n \".py\",\n \".svelte\",\n \".vue\",\n \".dart\",\n \".html\",\n \".hubl\",\n];\nconst INDEX_FILES = [\"index.ts\", \"index.tsx\", \"index.js\", \"index.jsx\", \"__init__.py\"];\n\nfunction fileId(relPath: string): string {\n return `file:${relPath}`;\n}\n\nfunction symbolId(relPath: string, sym: ParsedSymbol): string {\n return `symbol:${relPath}::${sym.name}:${sym.startLine}`;\n}\n\nfunction toFileNode(parsed: ParsedFile): FileNode {\n const content = parsed.source;\n return {\n id: fileId(parsed.file.relPath),\n kind: \"file\",\n path: parsed.file.relPath,\n ext: parsed.file.ext,\n size: parsed.file.size,\n keywords: extractKeywords(content, parsed.file.ext),\n content,\n summary: extractSummary(content),\n file_hash: fileHash(content),\n };\n}\n\nfunction extractSummary(content: string): string {\n // First leading comment block (// ... or /** ... */ or # ...), trimmed to ~200 chars.\n const trimmed = content.replace(/^\\s+/, \"\");\n const slashMatch = trimmed.match(/^\\/\\/\\s?(.*(?:\\r?\\n\\/\\/\\s?.*)*)/);\n if (slashMatch?.[1]) return slashMatch[1].split(/\\r?\\n/).join(\" \").trim().slice(0, 200);\n const blockMatch = trimmed.match(/^\\/\\*\\*?([\\s\\S]*?)\\*\\//);\n if (blockMatch?.[1]) {\n return blockMatch[1]\n .split(/\\r?\\n/)\n .map((l) => l.replace(/^\\s*\\*\\s?/, \"\"))\n .join(\" \")\n .trim()\n .slice(0, 200);\n }\n const hashMatch = trimmed.match(/^#\\s?(.*(?:\\r?\\n#\\s?.*)*)/);\n if (hashMatch?.[1]) return hashMatch[1].split(/\\r?\\n/).join(\" \").trim().slice(0, 200);\n return \"\";\n}\n\nfunction toSymbolNode(parsed: ParsedFile, sym: ParsedSymbol): SymbolNode {\n return {\n id: symbolId(parsed.file.relPath, sym),\n kind: \"symbol\",\n symbol_kind: sym.kind,\n name: sym.name,\n file: parsed.file.relPath,\n start_line: sym.startLine,\n end_line: sym.endLine,\n signature: sym.signature,\n };\n}\n\n/**\n * Resolve an import specifier to a project-relative path if it refers to a\n * file inside the project. Returns `null` for external packages (no leading\n * dot) or specifiers that don't match any known file.\n */\n// Strip a trailing JS-family extension so a spec like \"./crypto.js\" can\n// resolve to \"crypto.ts\". TypeScript-style `.js` imports are common.\nconst REWRITE_EXT_RE = /\\.(js|jsx|mjs|cjs)$/;\n\nfunction resolveImport(\n fromRelPath: string,\n spec: string,\n filesByPath: Map<string, true>,\n): string | null {\n if (!spec.startsWith(\".\")) return null;\n const fromDir = posix.dirname(toPosix(fromRelPath));\n const base = posix.normalize(posix.join(fromDir, toPosix(spec)));\n\n const candidates = [base];\n const rewritten = base.replace(REWRITE_EXT_RE, \"\");\n if (rewritten !== base) candidates.push(rewritten);\n\n for (const c of candidates) {\n if (filesByPath.has(c)) return c;\n for (const ext of RESOLVE_EXTS) {\n if (filesByPath.has(c + ext)) return c + ext;\n }\n for (const idx of INDEX_FILES) {\n const candidate = posix.join(c, idx);\n if (filesByPath.has(candidate)) return candidate;\n }\n }\n return null;\n}\n\nfunction toPosix(p: string): string {\n return p.split(/[\\\\/]/).join(\"/\");\n}\n\nconst TEST_RE = /^(?<base>.+?)\\.(test|spec)\\.(?<ext>[tj]sx?|py)$/;\n\nfunction testTarget(relPath: string, filesByPath: Map<string, true>): string | null {\n const fileName = relPath.split(\"/\").pop() ?? relPath;\n const match = TEST_RE.exec(fileName);\n if (!match) return null;\n const dir = relPath.includes(\"/\") ? relPath.slice(0, relPath.lastIndexOf(\"/\") + 1) : \"\";\n const base = match.groups?.base ?? \"\";\n const ext = match.groups?.ext ?? \"\";\n if (!base || !ext) return null;\n const candidate = `${dir}${base}.${ext}`;\n if (filesByPath.has(candidate)) return candidate;\n // Try sibling extensions (e.g. foo.test.ts → foo.tsx)\n for (const e of RESOLVE_EXTS) {\n const alt = `${dir}${base}${e}`;\n if (filesByPath.has(alt)) return alt;\n }\n return null;\n}\n\nexport async function buildGraph(root: string, parsed: ParsedFile[]): Promise<GraphSchema> {\n const filesByPath = new Map<string, true>();\n for (const p of parsed) filesByPath.set(p.file.relPath, true);\n\n const nodes: (FileNode | SymbolNode)[] = [];\n const edges: Edge[] = [];\n\n // Collected during the file loop, then resolved into `calls` edges in one pass\n // (callee resolution needs the full symbol set).\n const symbolsByFile = new Map<string, SymbolNode[]>();\n const callsByFile = new Map<string, CallSite[]>();\n\n for (const p of parsed) {\n const fileNode = toFileNode(p);\n nodes.push(fileNode);\n\n const fileSymNodes: SymbolNode[] = [];\n for (const sym of p.symbols) {\n const symNode = toSymbolNode(p, sym);\n nodes.push(symNode);\n fileSymNodes.push(symNode);\n edges.push({ from: fileNode.id, to: symNode.id, kind: \"defines\" });\n }\n symbolsByFile.set(p.file.relPath, fileSymNodes);\n callsByFile.set(p.file.relPath, p.calls);\n\n const importEdges = new Set<string>();\n for (const spec of p.imports) {\n const target = resolveImport(p.file.relPath, spec, filesByPath);\n if (!target) continue;\n const key = `${fileNode.id}->${fileId(target)}`;\n if (importEdges.has(key)) continue;\n importEdges.add(key);\n edges.push({ from: fileNode.id, to: fileId(target), kind: \"imports\" });\n }\n\n const testTargetPath = testTarget(p.file.relPath, filesByPath);\n if (testTargetPath && testTargetPath !== p.file.relPath) {\n edges.push({ from: fileNode.id, to: fileId(testTargetPath), kind: \"tests\" });\n }\n }\n\n edges.push(...buildCallEdges(symbolsByFile, callsByFile));\n\n const symbolCount = nodes.filter((n) => n.kind === \"symbol\").length;\n const fileCount = nodes.length - symbolCount;\n\n return {\n root,\n node_count: nodes.length,\n edge_count: edges.length,\n file_count: fileCount,\n symbol_count: symbolCount,\n nodes,\n edges,\n generated_at: new Date().toISOString(),\n schema_version: SCHEMA_VERSION,\n };\n}\n\nexport function buildSymbolIndex(graph: GraphSchema): SymbolIndex {\n // Null-prototype map: symbol names like \"toString\" or \"constructor\" (common\n // in Dart, where every class overrides toString) would otherwise resolve to\n // an inherited Object.prototype member and crash on the .push below.\n const out: SymbolIndex = Object.create(null);\n for (const node of graph.nodes) {\n if (node.kind !== \"symbol\") continue;\n const list = out[node.name] ?? (out[node.name] = []);\n list.push({ file: node.file, line: node.start_line, kind: node.symbol_kind });\n }\n return out;\n}\n\n/** The same-file symbol whose [start_line, end_line] tightest-contains `line`\n * (smallest span wins, so an inner method beats its enclosing class). null if\n * the line is outside every symbol (e.g. a module-level call). */\nexport function tightestContainer(syms: SymbolNode[], line: number): SymbolNode | null {\n let best: SymbolNode | null = null;\n for (const s of syms) {\n if (line < s.start_line || line > s.end_line) continue;\n if (!best || s.end_line - s.start_line < best.end_line - best.start_line) best = s;\n }\n return best;\n}\n\n/**\n * Resolve raw call sites into symbol→symbol `calls` edges. Name-based (no type\n * info), precision-first:\n * - caller = the call site's tightest-containing symbol in the SAME file\n * (no container, e.g. a top-level call → skipped)\n * - callee = a same-file symbol of that name, else the UNIQUE repo-wide symbol\n * of that name; 0 matches (external/builtin) or >1 (ambiguous) → skipped\n * Recursion self-edges and duplicates are dropped.\n */\nexport function buildCallEdges(\n symbolsByFile: Map<string, SymbolNode[]>,\n callsByFile: Map<string, CallSite[]>,\n): Edge[] {\n // Repo-wide name → symbols index, for the cross-file fallback.\n const byName = new Map<string, SymbolNode[]>();\n for (const syms of symbolsByFile.values()) {\n for (const s of syms) {\n const list = byName.get(s.name);\n if (list) list.push(s);\n else byName.set(s.name, [s]);\n }\n }\n\n const edges: Edge[] = [];\n const seen = new Set<string>();\n\n for (const [relPath, sites] of callsByFile) {\n const fileSyms = symbolsByFile.get(relPath) ?? [];\n for (const site of sites) {\n const caller = tightestContainer(fileSyms, site.line);\n if (!caller) continue;\n\n let callee = fileSyms.find((s) => s.name === site.callee);\n if (!callee) {\n const cands = byName.get(site.callee) ?? [];\n if (cands.length !== 1) continue; // 0 = external/builtin, >1 = ambiguous\n callee = cands[0];\n }\n if (!callee || callee.id === caller.id) continue; // skip recursion self-edges\n\n const key = `${caller.id}->${callee.id}`;\n if (seen.has(key)) continue;\n seen.add(key);\n edges.push({ from: caller.id, to: callee.id, kind: \"calls\" });\n }\n }\n return edges;\n}\n\n// Re-export node path helpers in case downstream wants the canonical id format\nexport { fileId, symbolId };\n// Suppress unused-import lint for dirname/join from node:path — kept reserved for incremental updates.\nvoid dirname;\nvoid join;\n","// Shared graph schema. Other modules read/write these shapes.\n\nexport type NodeKind = \"file\" | \"symbol\";\n\nexport type SymbolKind =\n | \"function\"\n | \"method\"\n | \"class\"\n | \"interface\"\n | \"type\"\n | \"const\"\n | \"enum\"\n | \"component\";\n\nexport interface FileNode {\n id: string;\n kind: \"file\";\n path: string;\n ext: string;\n size: number;\n keywords: string[];\n content: string;\n summary: string;\n file_hash: string;\n}\n\nexport interface SymbolNode {\n id: string;\n kind: \"symbol\";\n symbol_kind: SymbolKind;\n name: string;\n file: string;\n start_line: number;\n end_line: number;\n signature: string;\n}\n\nexport type GraphNode = FileNode | SymbolNode;\n\nexport type EdgeKind = \"imports\" | \"calls\" | \"defines\" | \"tests\";\n\nexport interface Edge {\n from: string;\n to: string;\n kind: EdgeKind;\n}\n\n// Bump when the on-disk info_graph.json shape changes incompatibly. The server\n// auto-rescans on load when a stored graph's schema_version differs (#8).\n// v2: `calls` edges are now populated.\nexport const SCHEMA_VERSION = 2;\n\nexport interface GraphSchema {\n root: string;\n node_count: number;\n edge_count: number;\n file_count: number;\n symbol_count: number;\n nodes: GraphNode[];\n edges: Edge[];\n generated_at: string;\n schema_version: number;\n}\n\nexport interface SymbolIndex {\n [name: string]: Array<{ file: string; line: number; kind: SymbolKind }>;\n}\n","// Stable, short content hash for files. Used to detect changed files\n// during incremental rescans (post-v0.1; M1 does full re-parse).\n// TODO: M1 (minimal); post-v0.1 (incremental)\n\nimport { createHash } from \"node:crypto\";\n\nexport function fileHash(content: string): string {\n return createHash(\"sha1\").update(content).digest(\"hex\").slice(0, 8);\n}\n","// Per-file keyword extraction. Used for query-time relevance ranking.\n// Tokenizes identifiers + comment words, splits camelCase/snake_case, filters\n// stopwords, and returns the top-N rare tokens scored by inverse frequency\n// against a small built-in english/code corpus.\n\nconst STOPWORDS = new Set([\n \"a\",\n \"an\",\n \"and\",\n \"are\",\n \"as\",\n \"at\",\n \"be\",\n \"but\",\n \"by\",\n \"do\",\n \"for\",\n \"from\",\n \"has\",\n \"have\",\n \"he\",\n \"if\",\n \"in\",\n \"is\",\n \"it\",\n \"its\",\n \"not\",\n \"of\",\n \"on\",\n \"or\",\n \"she\",\n \"that\",\n \"the\",\n \"they\",\n \"this\",\n \"to\",\n \"was\",\n \"we\",\n \"were\",\n \"will\",\n \"with\",\n \"you\",\n \"your\",\n \"i\",\n \"me\",\n \"my\",\n \"our\",\n \"us\",\n \"their\",\n \"them\",\n \"his\",\n \"her\",\n // common code words that add no signal\n \"function\",\n \"const\",\n \"let\",\n \"var\",\n \"class\",\n \"interface\",\n \"type\",\n \"enum\",\n \"import\",\n \"export\",\n \"from\",\n \"default\",\n \"return\",\n \"if\",\n \"else\",\n \"for\",\n \"while\",\n \"do\",\n \"switch\",\n \"case\",\n \"break\",\n \"continue\",\n \"new\",\n \"this\",\n \"super\",\n \"throw\",\n \"try\",\n \"catch\",\n \"finally\",\n \"async\",\n \"await\",\n \"yield\",\n \"true\",\n \"false\",\n \"null\",\n \"undefined\",\n \"void\",\n \"any\",\n \"string\",\n \"number\",\n \"boolean\",\n \"object\",\n \"array\",\n \"self\",\n \"cls\",\n \"def\",\n \"lambda\",\n \"pass\",\n \"raise\",\n \"with\",\n \"as\",\n \"in\",\n \"todo\",\n \"fixme\",\n \"note\",\n]);\n\nconst COMMON_CODE = new Set([\n \"value\",\n \"data\",\n \"result\",\n \"args\",\n \"kwargs\",\n \"options\",\n \"config\",\n \"params\",\n \"name\",\n \"id\",\n \"key\",\n \"index\",\n \"item\",\n \"items\",\n \"list\",\n \"map\",\n \"set\",\n \"get\",\n \"set\",\n \"add\",\n \"remove\",\n \"delete\",\n \"create\",\n \"update\",\n \"find\",\n \"fetch\",\n \"load\",\n \"save\",\n \"init\",\n \"main\",\n \"run\",\n \"start\",\n \"stop\",\n \"test\",\n \"check\",\n \"validate\",\n \"error\",\n \"err\",\n \"warn\",\n \"info\",\n \"debug\",\n \"log\",\n \"trace\",\n \"msg\",\n \"message\",\n \"path\",\n \"file\",\n \"dir\",\n \"url\",\n \"host\",\n \"port\",\n \"size\",\n \"length\",\n \"count\",\n \"input\",\n \"output\",\n \"source\",\n \"target\",\n \"callback\",\n \"handler\",\n \"listener\",\n \"props\",\n \"state\",\n \"context\",\n \"render\",\n \"component\",\n \"node\",\n \"tree\",\n \"root\",\n]);\n\n// Frequency weight — common-code words count for less than rare identifiers\nfunction score(token: string): number {\n if (STOPWORDS.has(token)) return 0;\n if (COMMON_CODE.has(token)) return 0.2;\n if (token.length <= 2) return 0.1;\n return 1;\n}\n\nfunction splitIdentifier(id: string): string[] {\n // snake_case + kebab-case → words\n const partsRaw = id.split(/[_\\-./]+/).filter(Boolean);\n const out: string[] = [];\n for (const part of partsRaw) {\n // camelCase / PascalCase → words. Handles \"XMLHttp\" → [\"XML\", \"Http\"]\n const camelParts = part.match(/[A-Z]+(?=[A-Z][a-z])|[A-Z]?[a-z]+|[A-Z]+|[0-9]+/g);\n if (camelParts) out.push(...camelParts);\n else out.push(part);\n }\n return out.map((w) => w.toLowerCase()).filter((w) => /[a-z]/.test(w));\n}\n\nexport function extractKeywords(content: string, _ext: string): string[] {\n // Identifiers + alphanumeric words. Picks up both code and comment text.\n const tokens = content.match(/[A-Za-z_][A-Za-z0-9_]{1,40}/g) ?? [];\n const counts = new Map<string, number>();\n for (const tok of tokens) {\n for (const word of splitIdentifier(tok)) {\n const w = score(word);\n if (w === 0) continue;\n counts.set(word, (counts.get(word) ?? 0) + w);\n }\n }\n return Array.from(counts.entries())\n .sort((a, b) => b[1] - a[1])\n .slice(0, 32)\n .map(([w]) => w);\n}\n","// Incremental-scan parse cache. Stores per-file parse results keyed by content\n// hash so a rescan can reuse unchanged files' symbols/imports and only re-run\n// the expensive tree-sitter parse on files that actually changed.\n//\n// Source is NOT stored here — it's re-read at scan time to compute the hash and\n// reused as ParsedFile.source, keeping the cache small (the graph holds content\n// separately). Lives in .synthra-graph/ (gitignored, machine-local).\n//\n// BUMP PARSE_CACHE_VERSION whenever parser/extract output shape or a tree-sitter\n// grammar changes — readParseCache returns an empty cache on a version mismatch,\n// forcing a full re-parse so stale symbols can never leak into the graph.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { fileHash } from \"./hash.js\";\nimport { parseSource, type CallSite, type ParsedFile, type ParsedSymbol } from \"./parser.js\";\nimport type { WalkedFile } from \"./walker.js\";\n\n// Bumped to 2 when call sites were added to the parse output (the calls shape\n// changed) — old caches invalidate and re-parse cleanly.\nexport const PARSE_CACHE_VERSION = 2;\n\nexport interface CachedParse {\n hash: string;\n symbols: ParsedSymbol[];\n imports: string[];\n calls: CallSite[];\n}\n\nexport interface ParseCache {\n schema_version: number;\n files: Record<string, CachedParse>;\n}\n\nexport function emptyParseCache(): ParseCache {\n return { schema_version: PARSE_CACHE_VERSION, files: {} };\n}\n\nexport async function readParseCache(path: string): Promise<ParseCache> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<ParseCache>;\n if (\n parsed.schema_version !== PARSE_CACHE_VERSION ||\n typeof parsed.files !== \"object\" ||\n parsed.files === null\n ) {\n return emptyParseCache();\n }\n return { schema_version: PARSE_CACHE_VERSION, files: parsed.files as ParseCache[\"files\"] };\n } catch {\n return emptyParseCache();\n }\n}\n\nexport async function writeParseCache(path: string, cache: ParseCache): Promise<void> {\n try {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, `${JSON.stringify(cache)}\\n`, \"utf8\");\n } catch {\n // Best-effort: a missing/unwritable cache just means the next scan is full.\n }\n}\n\nexport interface IncrementalParseResult {\n parsed: ParsedFile[];\n cache: ParseCache;\n reused: number;\n reparsed: number;\n parseErrors: number;\n}\n\n/**\n * Parse `parsable` files, reusing prior results for files whose content hash is\n * unchanged. Returns the FULL ParsedFile[] (reused + freshly parsed) — so\n * `buildGraph` re-resolves every cross-file edge exactly as in a full scan —\n * plus a rebuilt cache containing only the currently-present files (deletions\n * and renames drop out naturally). Pass `full: true` to ignore the cache and\n * re-parse everything.\n */\nexport async function incrementalParse(\n parsable: WalkedFile[],\n prev: ParseCache,\n opts: { full?: boolean } = {},\n): Promise<IncrementalParseResult> {\n const cache = emptyParseCache();\n const parsed: ParsedFile[] = [];\n let reused = 0;\n let reparsed = 0;\n let parseErrors = 0;\n\n for (const f of parsable) {\n let source: string;\n try {\n source = await readFile(f.absPath, \"utf8\");\n } catch {\n continue; // unreadable → skip, same as a failed read in parseFile\n }\n const hash = fileHash(source);\n\n const cached = opts.full ? undefined : prev.files[f.relPath];\n if (cached && cached.hash === hash) {\n parsed.push({\n file: f,\n source,\n symbols: cached.symbols,\n imports: cached.imports,\n calls: cached.calls,\n });\n cache.files[f.relPath] = cached;\n reused += 1;\n continue;\n }\n\n try {\n const p = await parseSource(f, source);\n parsed.push(p);\n cache.files[f.relPath] = { hash, symbols: p.symbols, imports: p.imports, calls: p.calls };\n reparsed += 1;\n } catch {\n // Mirror scanProject's prior behavior: a parse failure drops the file\n // from the graph (and the cache) rather than failing the whole scan.\n parseErrors += 1;\n }\n }\n\n return { parsed, cache, reused, reparsed, parseErrors };\n}\n","// Dispatches a file to its language-specific parser based on extension.\n// Tree-sitter WASM grammars are loaded lazily via tree-sitter-wasms and\n// cached per language for the lifetime of the process.\n\nimport { readFile } from \"node:fs/promises\";\nimport { createRequire } from \"node:module\";\nimport { Language, Parser } from \"web-tree-sitter\";\n\nimport type { SymbolKind } from \"../graph/types.js\";\nimport { parseC } from \"./parsers/c.js\";\nimport { parseCpp } from \"./parsers/cpp.js\";\nimport { parseCSharp } from \"./parsers/csharp.js\";\nimport { parseDart } from \"./parsers/dart.js\";\nimport { parseGo } from \"./parsers/go.js\";\nimport { parseHubL } from \"./parsers/hubl.js\";\nimport { parseJava } from \"./parsers/java.js\";\nimport { parseKotlin } from \"./parsers/kotlin.js\";\nimport { parsePhp } from \"./parsers/php.js\";\nimport { parsePython } from \"./parsers/python.js\";\nimport { parseRuby } from \"./parsers/ruby.js\";\nimport { parseRust } from \"./parsers/rust.js\";\nimport { parseSvelte } from \"./parsers/svelte.js\";\nimport { parseTypeScript } from \"./parsers/typescript.js\";\nimport { parseVue } from \"./parsers/vue.js\";\nimport type { WalkedFile } from \"./walker.js\";\n\nexport interface ParsedSymbol {\n name: string;\n kind: SymbolKind;\n startLine: number;\n endLine: number;\n signature: string;\n}\n\n/** A raw call site: the bare callee name as written (e.g. \"login\", not\n * \"auth.login\") + its 1-based line. Caller attribution + callee resolution\n * happen centrally in buildGraph (which has the full file set). */\nexport interface CallSite {\n callee: string;\n line: number;\n}\n\nexport interface ParsedFile {\n file: WalkedFile;\n source: string;\n symbols: ParsedSymbol[];\n imports: string[];\n calls: CallSite[];\n}\n\nconst require = createRequire(import.meta.url);\n\nexport type GrammarName =\n | \"typescript\"\n | \"tsx\"\n | \"javascript\"\n | \"python\"\n | \"go\"\n | \"rust\"\n | \"java\"\n | \"kotlin\"\n | \"php\"\n | \"ruby\"\n | \"c\"\n | \"cpp\"\n | \"dart\"\n | \"csharp\";\n\nconst GRAMMAR_FILES: Record<GrammarName, string> = {\n typescript: \"tree-sitter-wasms/out/tree-sitter-typescript.wasm\",\n tsx: \"tree-sitter-wasms/out/tree-sitter-tsx.wasm\",\n javascript: \"tree-sitter-wasms/out/tree-sitter-javascript.wasm\",\n python: \"tree-sitter-wasms/out/tree-sitter-python.wasm\",\n go: \"tree-sitter-wasms/out/tree-sitter-go.wasm\",\n rust: \"tree-sitter-wasms/out/tree-sitter-rust.wasm\",\n java: \"tree-sitter-wasms/out/tree-sitter-java.wasm\",\n kotlin: \"tree-sitter-wasms/out/tree-sitter-kotlin.wasm\",\n php: \"tree-sitter-wasms/out/tree-sitter-php.wasm\",\n ruby: \"tree-sitter-wasms/out/tree-sitter-ruby.wasm\",\n c: \"tree-sitter-wasms/out/tree-sitter-c.wasm\",\n cpp: \"tree-sitter-wasms/out/tree-sitter-cpp.wasm\",\n dart: \"tree-sitter-wasms/out/tree-sitter-dart.wasm\",\n csharp: \"tree-sitter-wasms/out/tree-sitter-c_sharp.wasm\",\n};\n\nlet parserInit: Promise<void> | null = null;\nconst languageCache = new Map<GrammarName, Language>();\n\nasync function ensureParserInit(): Promise<void> {\n if (!parserInit) {\n parserInit = Parser.init();\n }\n return parserInit;\n}\n\nexport async function loadGrammar(name: GrammarName): Promise<Language> {\n await ensureParserInit();\n const cached = languageCache.get(name);\n if (cached) return cached;\n const wasmPath = require.resolve(GRAMMAR_FILES[name]);\n const lang = await Language.load(wasmPath);\n languageCache.set(name, lang);\n return lang;\n}\n\nexport interface LoadedParser {\n parser: Parser;\n language: Language;\n}\n\nexport async function createParser(name: GrammarName): Promise<LoadedParser> {\n const language = await loadGrammar(name);\n const parser = new Parser();\n parser.setLanguage(language);\n return { parser, language };\n}\n\nfunction emptyParsed(file: WalkedFile, source: string): ParsedFile {\n return { file, source, symbols: [], imports: [], calls: [] };\n}\n\nexport async function parseFile(f: WalkedFile): Promise<ParsedFile> {\n let source: string;\n try {\n source = await readFile(f.absPath, \"utf8\");\n } catch {\n return emptyParsed(f, \"\");\n }\n return parseSource(f, source);\n}\n\n/** Parse already-read source. Split from parseFile so the incremental scanner\n * can read a file's content once (to hash it) and parse from that same string\n * on a cache miss — avoiding a second read. */\nexport async function parseSource(f: WalkedFile, source: string): Promise<ParsedFile> {\n switch (f.ext) {\n case \".ts\":\n case \".tsx\":\n case \".cts\":\n case \".mts\":\n case \".js\":\n case \".jsx\":\n case \".cjs\":\n case \".mjs\":\n return parseTypeScript(f, source);\n case \".py\":\n case \".pyi\":\n return parsePython(f, source);\n case \".svelte\":\n return parseSvelte(f, source);\n case \".vue\":\n return parseVue(f, source);\n case \".html\":\n case \".hubl\":\n return parseHubL(f, source);\n case \".go\":\n return parseGo(f, source);\n case \".rs\":\n return parseRust(f, source);\n case \".java\":\n return parseJava(f, source);\n case \".kt\":\n case \".kts\":\n return parseKotlin(f, source);\n case \".php\":\n return parsePhp(f, source);\n case \".rb\":\n return parseRuby(f, source);\n case \".c\":\n case \".h\":\n return parseC(f, source);\n case \".cpp\":\n case \".cc\":\n case \".cxx\":\n case \".hpp\":\n case \".hh\":\n case \".hxx\":\n return parseCpp(f, source);\n case \".dart\":\n return parseDart(f, source);\n case \".cs\":\n return parseCSharp(f, source);\n default:\n return emptyParsed(f, source);\n }\n}\n","// Generic tree-sitter parser used by the simpler-grammar languages\n// (Go, Rust, Java, Kotlin, PHP, Ruby, C, C++, Dart, C#).\n//\n// Each language file defines:\n// - which tree-sitter grammar to load\n// - a query string with capture names like `@function`, `@function.name`\n// - a `decls` table mapping declaration-capture pairs to SymbolKind\n// - optional `importCapture` for collecting import edges\n// Everything else (parser init, error handling, dedupe) lives here.\n\nimport { Query, type Node } from \"web-tree-sitter\";\n\nimport type { SymbolKind } from \"../../graph/types.js\";\nimport {\n createParser,\n type CallSite,\n type GrammarName,\n type ParsedFile,\n type ParsedSymbol,\n} from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nexport interface DeclCapture {\n /** Capture name for the declaration node, e.g. \"function\". */\n declCapture: string;\n /** Capture name for the symbol's name node, e.g. \"function.name\". */\n nameCapture: string;\n /** SymbolKind to assign. */\n kind: SymbolKind;\n}\n\nexport interface GenericParserConfig {\n grammar: GrammarName;\n query: string;\n decls: DeclCapture[];\n /** Capture name for import-source nodes. Skipped when omitted. */\n importCapture?: string;\n /** Capture name for the whole call-site node (for its line). */\n callCapture?: string;\n /** Capture name for the callee-name node. Both call captures must be set. */\n callCalleeCapture?: string;\n}\n\nexport function firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\nfunction cleanImport(s: string): string {\n // Strip surrounding string-literal quotes (used by Go, Dart, C/C++).\n // Strip angle brackets used by C/C++ system includes.\n return s.replace(/^[\"'`<]+|[\"'`>]+$/g, \"\").trim();\n}\n\nexport async function runGenericParser(\n config: GenericParserConfig,\n f: WalkedFile,\n source: string,\n): Promise<ParsedFile> {\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n const calls: CallSite[] = [];\n\n try {\n const { parser, language } = await createParser(config.grammar);\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls };\n\n const query = new Query(language, config.query);\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n let matched: DeclCapture | null = null;\n for (const d of config.decls) {\n if (byName.has(d.declCapture) && byName.has(d.nameCapture)) {\n matched = d;\n break;\n }\n }\n\n if (matched) {\n const declNode = byName.get(matched.declCapture)!;\n const nameNode = byName.get(matched.nameCapture)!;\n symbols.push({\n name: nameNode.text,\n kind: matched.kind,\n startLine: declNode.startPosition.row + 1,\n endLine: declNode.endPosition.row + 1,\n signature: firstLine(declNode.text),\n });\n continue;\n }\n\n if (config.callCapture && config.callCalleeCapture) {\n const callNode = byName.get(config.callCapture);\n const calleeNode = byName.get(config.callCalleeCapture);\n if (callNode && calleeNode) {\n calls.push({ callee: calleeNode.text, line: callNode.startPosition.row + 1 });\n continue;\n }\n }\n\n if (config.importCapture) {\n const imp = byName.get(config.importCapture);\n if (imp) imports.push(cleanImport(imp.text));\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const k = `${s.name}:${s.startLine}`;\n if (seen.has(k)) return false;\n seen.add(k);\n return true;\n });\n imports = Array.from(new Set(imports)).filter((s) => s.length > 0);\n } catch {\n // Query compile or parse failure — return what we have. Silent so a single\n // bad file doesn't abort the whole scan.\n }\n\n return { file: f, source, symbols, imports, calls };\n}\n","// C parser. Function definitions, structs, enums, typedefs, #include directives.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_definition declarator: (function_declarator declarator: (identifier) @function.name)) @function\n(struct_specifier name: (type_identifier) @struct.name) @struct\n(enum_specifier name: (type_identifier) @enum.name) @enum\n(type_definition declarator: (type_identifier) @type.name) @type\n(preproc_include path: (string_literal) @import)\n(preproc_include path: (system_lib_string) @import)\n(call_expression function: (identifier) @call.name) @call\n`;\n\nexport async function parseC(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"c\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"type\", nameCapture: \"type.name\", kind: \"type\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// C++ parser. Functions, classes, structs, enums, namespaces, #includes.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_definition declarator: (function_declarator declarator: (identifier) @function.name)) @function\n(function_definition declarator: (function_declarator declarator: (qualified_identifier) @method.name)) @method\n(class_specifier name: (type_identifier) @class.name) @class\n(struct_specifier name: (type_identifier) @struct.name) @struct\n(enum_specifier name: (type_identifier) @enum.name) @enum\n(namespace_definition name: (namespace_identifier) @namespace.name) @namespace\n(preproc_include path: (string_literal) @import)\n(preproc_include path: (system_lib_string) @import)\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (field_expression field: (field_identifier) @call.name)) @call\n(call_expression function: (qualified_identifier name: (identifier) @call.name)) @call\n`;\n\nexport async function parseCpp(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"cpp\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"namespace\", nameCapture: \"namespace.name\", kind: \"class\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// C# (.NET) parser. Classes, interfaces, structs, methods, namespaces.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(class_declaration name: (identifier) @class.name) @class\n(interface_declaration name: (identifier) @interface.name) @interface\n(struct_declaration name: (identifier) @struct.name) @struct\n(enum_declaration name: (identifier) @enum.name) @enum\n(method_declaration name: (identifier) @method.name) @method\n(namespace_declaration name: (_) @namespace.name) @namespace\n(using_directive (_) @import)\n(invocation_expression function: (identifier) @call.name) @call\n(invocation_expression function: (member_access_expression name: (identifier) @call.name)) @call\n`;\n\nexport async function parseCSharp(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"csharp\",\n query: QUERY,\n decls: [\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"interface\", nameCapture: \"interface.name\", kind: \"interface\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"namespace\", nameCapture: \"namespace.name\", kind: \"class\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Dart parser. v0.1.11 — real symbol extraction + import parsing on top of the\n// ABI-v15 grammar that ships in tree-sitter-wasms.\n//\n// Distinguishes top-level function_signature (kind: function) from\n// function_signature nested under method_signature (kind: method) by\n// anchoring the top-level pattern under `program`.\n//\n// Imports: `package:foo/bar.dart` and `dart:async` are stripped — they cross\n// the project boundary. Bare `foo.dart` is normalized to `./foo.dart` so the\n// shared resolveImport() (which requires a leading `.`) treats it as a\n// same-directory relative import.\n\nimport { Query, type Node } from \"web-tree-sitter\";\nimport type { SymbolKind } from \"../../graph/types.js\";\nimport { createParser, type ParsedFile, type ParsedSymbol } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst QUERY = `\n(class_definition name: (identifier) @class.name) @class\n(mixin_declaration (identifier) @mixin.name) @mixin\n(extension_declaration name: (identifier) @ext.name) @ext\n(enum_declaration name: (identifier) @enum.name) @enum\n(type_alias (type_identifier) @typedef.name) @typedef\n\n(program (function_signature name: (identifier) @function.name) @function)\n\n(method_signature (function_signature name: (identifier) @method.name)) @method\n(method_signature (getter_signature name: (identifier) @getter.name)) @getter\n(method_signature (setter_signature name: (identifier) @setter.name)) @setter\n(constructor_signature name: (identifier) @ctor.name) @ctor\n\n(import_or_export (library_import (import_specification (configurable_uri (uri (string_literal) @import)))))\n`;\n\ninterface DeclShape {\n declCap: string;\n nameCap: string;\n kind: SymbolKind;\n}\n\nconst DECLS: DeclShape[] = [\n { declCap: \"class\", nameCap: \"class.name\", kind: \"class\" },\n { declCap: \"mixin\", nameCap: \"mixin.name\", kind: \"class\" },\n { declCap: \"ext\", nameCap: \"ext.name\", kind: \"class\" },\n { declCap: \"enum\", nameCap: \"enum.name\", kind: \"enum\" },\n { declCap: \"typedef\", nameCap: \"typedef.name\", kind: \"type\" },\n { declCap: \"function\", nameCap: \"function.name\", kind: \"function\" },\n { declCap: \"method\", nameCap: \"method.name\", kind: \"method\" },\n { declCap: \"getter\", nameCap: \"getter.name\", kind: \"method\" },\n { declCap: \"setter\", nameCap: \"setter.name\", kind: \"method\" },\n { declCap: \"ctor\", nameCap: \"ctor.name\", kind: \"method\" },\n];\n\nfunction firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\n// Strip surrounding string-literal quotes and normalize bare same-directory\n// imports (Dart allows `import 'foo.dart';` without a leading `./`) so\n// resolveImport() — which keys off a leading dot — can match them.\nfunction normalizeDartImport(raw: string): string | null {\n const stripped = raw.replace(/^['\"]|['\"]$/g, \"\");\n if (!stripped) return null;\n if (stripped.startsWith(\"package:\")) return null;\n if (stripped.startsWith(\"dart:\")) return null;\n if (stripped.startsWith(\".\") || stripped.startsWith(\"/\")) return stripped;\n return `./${stripped}`;\n}\n\nexport async function parseDart(f: WalkedFile, source: string): Promise<ParsedFile> {\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n\n try {\n const { parser, language } = await createParser(\"dart\");\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls: [] };\n\n const query = new Query(language, QUERY);\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n let matched: DeclShape | null = null;\n for (const d of DECLS) {\n if (byName.has(d.declCap) && byName.has(d.nameCap)) {\n matched = d;\n break;\n }\n }\n\n if (matched) {\n const declNode = byName.get(matched.declCap)!;\n const nameNode = byName.get(matched.nameCap)!;\n symbols.push({\n name: nameNode.text,\n kind: matched.kind,\n startLine: declNode.startPosition.row + 1,\n endLine: declNode.endPosition.row + 1,\n signature: firstLine(declNode.text),\n });\n continue;\n }\n\n const importNode = byName.get(\"import\");\n if (importNode) {\n const norm = normalizeDartImport(importNode.text);\n if (norm) imports.push(norm);\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const k = `${s.name}:${s.startLine}`;\n if (seen.has(k)) return false;\n seen.add(k);\n return true;\n });\n imports = Array.from(new Set(imports));\n } catch {\n // swallow — see _generic.ts for the rationale (single bad file shouldn't\n // abort the whole scan).\n }\n\n return { file: f, source, symbols, imports, calls: [] };\n}\n","// Go parser. Functions, methods, type declarations, imports.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_declaration name: (identifier) @function.name) @function\n(method_declaration name: (field_identifier) @method.name) @method\n(type_spec name: (type_identifier) @type.name) @type\n(import_spec path: (interpreted_string_literal) @import)\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (selector_expression field: (field_identifier) @call.name)) @call\n`;\n\nexport async function parseGo(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"go\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"type\", nameCapture: \"type.name\", kind: \"type\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// HubL (HubSpot CMS templating) parser. HubL lives in .html / .hubl files and\n// has no tree-sitter grammar, so we extract its symbol-like constructs with\n// regex: `{% macro %}` and `{% block %}` become symbols, and\n// `{% include / extends / import / from \"path\" %}` become import edges.\n// Plain HTML with no HubL tags simply yields no symbols (same as before).\n\nimport type { ParsedFile, ParsedSymbol } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\n// `{%-` / `-%}` are HubL/Jinja whitespace-control variants — tolerate them.\nconst MACRO_RE = /\\{%-?\\s*macro\\s+([A-Za-z_]\\w*)\\s*\\(([^)]*)\\)/g;\nconst ENDMACRO_RE = /\\{%-?\\s*endmacro\\b/g;\nconst BLOCK_RE = /\\{%-?\\s*block\\s+([A-Za-z_]\\w*)/g;\nconst ENDBLOCK_RE = /\\{%-?\\s*endblock\\b/g;\n// include / extends / import / from — all take a quoted template path first.\nconst IMPORT_RE = /\\{%-?\\s*(?:include|extends|import|from)\\s+[\"']([^\"']+)[\"']/g;\n\nfunction lineAt(source: string, index: number): number {\n return source.slice(0, index).split(/\\r?\\n/).length;\n}\n\n// Line of the next matching close tag after `fromIndex`; falls back to the\n// start line if the template is unbalanced (no close found).\nfunction endLineAfter(source: string, fromIndex: number, endRe: RegExp, startLine: number): number {\n endRe.lastIndex = fromIndex;\n const m = endRe.exec(source);\n return m ? lineAt(source, m.index) : startLine;\n}\n\nexport function parseHubL(f: WalkedFile, source: string): ParsedFile {\n const symbols: ParsedSymbol[] = [];\n const imports: string[] = [];\n\n for (const m of source.matchAll(MACRO_RE)) {\n const name = m[1];\n if (!name) continue;\n const args = (m[2] ?? \"\").trim();\n const start = m.index ?? 0;\n const startLine = lineAt(source, start);\n symbols.push({\n name,\n kind: \"function\",\n startLine,\n endLine: endLineAfter(source, start + m[0].length, ENDMACRO_RE, startLine),\n signature: `macro ${name}(${args})`,\n });\n }\n\n for (const m of source.matchAll(BLOCK_RE)) {\n const name = m[1];\n if (!name) continue;\n const start = m.index ?? 0;\n const startLine = lineAt(source, start);\n symbols.push({\n name,\n kind: \"component\",\n startLine,\n endLine: endLineAfter(source, start + m[0].length, ENDBLOCK_RE, startLine),\n signature: `block ${name}`,\n });\n }\n\n for (const m of source.matchAll(IMPORT_RE)) {\n const spec = m[1];\n if (spec) imports.push(spec);\n }\n\n return { file: f, source, symbols, imports: Array.from(new Set(imports)), calls: [] };\n}\n","// Java parser. Classes, interfaces, methods, imports.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(class_declaration name: (identifier) @class.name) @class\n(interface_declaration name: (identifier) @interface.name) @interface\n(method_declaration name: (identifier) @method.name) @method\n(enum_declaration name: (identifier) @enum.name) @enum\n(import_declaration (scoped_identifier) @import)\n(method_invocation name: (identifier) @call.name) @call\n`;\n\nexport async function parseJava(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"java\",\n query: QUERY,\n decls: [\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"interface\", nameCapture: \"interface.name\", kind: \"interface\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Kotlin parser. Functions, classes, objects, interfaces, imports.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_declaration (simple_identifier) @function.name) @function\n(class_declaration (type_identifier) @class.name) @class\n(object_declaration (type_identifier) @object.name) @object\n(import_header (identifier) @import)\n(call_expression (simple_identifier) @call.name) @call\n`;\n\nexport async function parseKotlin(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"kotlin\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"object\", nameCapture: \"object.name\", kind: \"class\" },\n ],\n importCapture: \"import\",\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// PHP parser. Functions, classes, interfaces, methods, traits.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_definition name: (name) @function.name) @function\n(class_declaration name: (name) @class.name) @class\n(interface_declaration name: (name) @interface.name) @interface\n(trait_declaration name: (name) @trait.name) @trait\n(method_declaration name: (name) @method.name) @method\n(function_call_expression function: (name) @call.name) @call\n(member_call_expression name: (name) @call.name) @call\n(scoped_call_expression name: (name) @call.name) @call\n`;\n\nexport async function parsePhp(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"php\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"interface\", nameCapture: \"interface.name\", kind: \"interface\" },\n { declCapture: \"trait\", nameCapture: \"trait.name\", kind: \"class\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n ],\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Python parser using tree-sitter-python WASM.\n// Extracts: function/class definitions, methods, and import statements.\n\nimport { Query, type Node } from \"web-tree-sitter\";\nimport { createParser, type CallSite, type ParsedFile, type ParsedSymbol } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst QUERY = `\n(function_definition name: (identifier) @function.name) @function\n(class_definition name: (identifier) @class.name) @class\n(import_statement name: (dotted_name) @import.module)\n(import_from_statement module_name: (dotted_name) @import.from)\n(import_from_statement module_name: (relative_import) @import.from)\n(call function: (identifier) @call.name) @call\n(call function: (attribute attribute: (identifier) @call.name)) @call\n`;\n\nfunction firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\nexport async function parsePython(f: WalkedFile, source: string): Promise<ParsedFile> {\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n const calls: CallSite[] = [];\n\n try {\n const { parser, language } = await createParser(\"python\");\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls };\n\n const query = new Query(language, QUERY);\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n const funcDecl = byName.get(\"function\");\n const funcName = byName.get(\"function.name\");\n if (funcDecl && funcName) {\n const parentType = funcDecl.parent?.parent?.type;\n const isMethod = parentType === \"class_definition\";\n symbols.push({\n name: funcName.text,\n kind: isMethod ? \"method\" : \"function\",\n startLine: funcDecl.startPosition.row + 1,\n endLine: funcDecl.endPosition.row + 1,\n signature: firstLine(funcDecl.text),\n });\n continue;\n }\n\n const classDecl = byName.get(\"class\");\n const className = byName.get(\"class.name\");\n if (classDecl && className) {\n symbols.push({\n name: className.text,\n kind: \"class\",\n startLine: classDecl.startPosition.row + 1,\n endLine: classDecl.endPosition.row + 1,\n signature: firstLine(classDecl.text),\n });\n continue;\n }\n\n const importNode = byName.get(\"import.module\") ?? byName.get(\"import.from\");\n if (importNode) {\n imports.push(importNode.text);\n continue;\n }\n\n const callName = byName.get(\"call.name\");\n const callNode = byName.get(\"call\");\n if (callName && callNode) {\n calls.push({ callee: callName.text, line: callNode.startPosition.row + 1 });\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const key = `${s.name}:${s.startLine}`;\n if (seen.has(key)) return false;\n seen.add(key);\n return true;\n });\n imports = Array.from(new Set(imports));\n } catch {\n // swallow parse errors\n }\n\n return { file: f, source, symbols, imports, calls };\n}\n","// Ruby parser. Methods, classes, modules.\n// Imports omitted — Ruby's `require` is dynamic and hard to capture cleanly;\n// keyword indexing still surfaces dependencies.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(method name: (identifier) @function.name) @function\n(singleton_method name: (identifier) @method.name) @method\n(class name: (constant) @class.name) @class\n(module name: (constant) @module.name) @module\n(call method: (identifier) @call.name) @call\n`;\n\nexport async function parseRuby(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"ruby\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"method\", nameCapture: \"method.name\", kind: \"method\" },\n { declCapture: \"class\", nameCapture: \"class.name\", kind: \"class\" },\n { declCapture: \"module\", nameCapture: \"module.name\", kind: \"class\" },\n ],\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// Rust parser. Functions, structs, enums, traits, impls.\n// Import capture is omitted — `use` paths are nested and complex; the file\n// will still be walked + keyword-indexed.\n\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\nimport { runGenericParser } from \"./_generic.js\";\n\nconst QUERY = `\n(function_item name: (identifier) @function.name) @function\n(struct_item name: (type_identifier) @struct.name) @struct\n(enum_item name: (type_identifier) @enum.name) @enum\n(trait_item name: (type_identifier) @trait.name) @trait\n(impl_item type: (type_identifier) @impl.name) @impl\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (scoped_identifier name: (identifier) @call.name)) @call\n(call_expression function: (field_expression field: (field_identifier) @call.name)) @call\n`;\n\nexport async function parseRust(f: WalkedFile, source: string): Promise<ParsedFile> {\n return runGenericParser(\n {\n grammar: \"rust\",\n query: QUERY,\n decls: [\n { declCapture: \"function\", nameCapture: \"function.name\", kind: \"function\" },\n { declCapture: \"struct\", nameCapture: \"struct.name\", kind: \"class\" },\n { declCapture: \"enum\", nameCapture: \"enum.name\", kind: \"enum\" },\n { declCapture: \"trait\", nameCapture: \"trait.name\", kind: \"interface\" },\n { declCapture: \"impl\", nameCapture: \"impl.name\", kind: \"class\" },\n ],\n callCapture: \"call\",\n callCalleeCapture: \"call.name\",\n },\n f,\n source,\n );\n}\n","// TS/JS parser using tree-sitter-typescript / -tsx WASM grammars.\n// Extracts: function/class/interface/type/enum declarations, exported consts,\n// arrow functions assigned to const, and import sources.\n\nimport { Query, type Node } from \"web-tree-sitter\";\nimport type { SymbolKind } from \"../../graph/types.js\";\nimport {\n createParser,\n type CallSite,\n type GrammarName,\n type ParsedFile,\n type ParsedSymbol,\n} from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\n// TS / TSX query — uses the type-identifier node type for class names, includes\n// interface / type-alias / enum declarations that don't exist in plain JS.\nconst TS_QUERY = `\n(function_declaration name: (identifier) @function.name) @function\n(class_declaration name: (type_identifier) @class.name) @class\n(interface_declaration name: (type_identifier) @interface.name) @interface\n(type_alias_declaration name: (type_identifier) @type.name) @type\n(enum_declaration name: (identifier) @enum.name) @enum\n(method_definition name: (property_identifier) @method.name) @method\n(lexical_declaration (variable_declarator name: (identifier) @const-fn.name value: [(arrow_function) (function_expression)])) @const-fn\n(assignment_expression left: (member_expression property: (property_identifier) @member-fn.name) right: [(arrow_function) (function_expression)]) @member-fn\n(import_statement source: (string) @import)\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (member_expression property: (property_identifier) @call.name)) @call\n`;\n\n// JS query — class names are plain identifiers (JS grammar has no\n// type_identifier node). No interface / type_alias / enum since JS lacks them.\n// Adds a call_expression capture for CommonJS require('x'); filtered in the\n// matching loop by checking the function identifier text equals \"require\".\nconst JS_QUERY = `\n(function_declaration name: (identifier) @function.name) @function\n(class_declaration name: (identifier) @class.name) @class\n(method_definition name: (property_identifier) @method.name) @method\n(lexical_declaration (variable_declarator name: (identifier) @const-fn.name value: [(arrow_function) (function_expression)])) @const-fn\n(assignment_expression left: (member_expression property: (property_identifier) @member-fn.name) right: [(arrow_function) (function_expression)]) @member-fn\n(import_statement source: (string) @import)\n(call_expression function: (identifier) @_require_fn arguments: (arguments . (string) @require_source))\n(call_expression function: (identifier) @call.name) @call\n(call_expression function: (member_expression property: (property_identifier) @call.name)) @call\n`;\n\nfunction grammarFor(ext: string): GrammarName {\n if (ext === \".tsx\" || ext === \".jsx\") return \"tsx\";\n if (ext === \".js\" || ext === \".cjs\" || ext === \".mjs\") return \"javascript\";\n return \"typescript\";\n}\n\nfunction queryFor(grammar: GrammarName): string {\n return grammar === \"javascript\" ? JS_QUERY : TS_QUERY;\n}\n\nfunction unquote(s: string): string {\n return s.replace(/^[\"'`]|[\"'`]$/g, \"\");\n}\n\nfunction firstLine(text: string, max = 200): string {\n const line = text.split(/\\r?\\n/, 1)[0] ?? \"\";\n return line.length > max ? line.slice(0, max) + \"…\" : line;\n}\n\ninterface DeclShape {\n decl: Node;\n name: Node;\n kind: SymbolKind;\n}\n\nfunction shapeFromCaptures(captures: Map<string, Node>): DeclShape | null {\n const findDecl = (k: string, sk: SymbolKind): DeclShape | null => {\n const decl = captures.get(k);\n const name = captures.get(`${k}.name`);\n return decl && name ? { decl, name, kind: sk } : null;\n };\n\n return (\n findDecl(\"function\", \"function\") ??\n findDecl(\"class\", \"class\") ??\n findDecl(\"interface\", \"interface\") ??\n findDecl(\"type\", \"type\") ??\n findDecl(\"enum\", \"enum\") ??\n findDecl(\"method\", \"method\") ??\n findDecl(\"const-fn\", \"function\") ??\n findDecl(\"member-fn\", \"function\")\n );\n}\n\nexport async function parseTypeScript(f: WalkedFile, source: string): Promise<ParsedFile> {\n const grammar = grammarFor(f.ext);\n let symbols: ParsedSymbol[] = [];\n let imports: string[] = [];\n const calls: CallSite[] = [];\n\n try {\n const { parser, language } = await createParser(grammar);\n const tree = parser.parse(source);\n if (!tree) return { file: f, source, symbols, imports, calls };\n\n const query = new Query(language, queryFor(grammar));\n const matches = query.matches(tree.rootNode);\n\n for (const match of matches) {\n const byName = new Map<string, Node>();\n for (const cap of match.captures) byName.set(cap.name, cap.node);\n\n const shape = shapeFromCaptures(byName);\n if (shape) {\n symbols.push({\n name: shape.name.text,\n kind: shape.kind,\n startLine: shape.decl.startPosition.row + 1,\n endLine: shape.decl.endPosition.row + 1,\n signature: firstLine(shape.decl.text),\n });\n continue;\n }\n const importNode = byName.get(\"import\");\n if (importNode) {\n imports.push(unquote(importNode.text));\n continue;\n }\n // CommonJS require('x') — only captured by JS_QUERY. The identifier\n // must literally be \"require\" (not setTimeout, console, etc).\n const requireFn = byName.get(\"_require_fn\");\n const requireSource = byName.get(\"require_source\");\n if (requireFn && requireSource && requireFn.text === \"require\") {\n imports.push(unquote(requireSource.text));\n continue;\n }\n // Call site (bare or member call). `require(...)` also matches here — it\n // resolves to no project symbol and is dropped, so no special-casing.\n const callName = byName.get(\"call.name\");\n const callNode = byName.get(\"call\");\n if (callName && callNode) {\n calls.push({ callee: callName.text, line: callNode.startPosition.row + 1 });\n }\n }\n\n const seen = new Set<string>();\n symbols = symbols.filter((s) => {\n const key = `${s.name}:${s.startLine}`;\n if (seen.has(key)) return false;\n seen.add(key);\n return true;\n });\n imports = Array.from(new Set(imports));\n } catch {\n // Parse failure shouldn't abort the whole scan — return what we have.\n }\n\n return { file: f, source, symbols, imports, calls };\n}\n","// Svelte parser. Extracts <script> and <script lang=\"ts\"> blocks and parses\n// their contents with the TypeScript parser. Tracks the original line offset\n// so reported symbol positions match the .svelte source.\n\nimport { parseTypeScript } from \"./typescript.js\";\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst SCRIPT_RE = /<script\\b[^>]*>([\\s\\S]*?)<\\/script>/gi;\n\ninterface ScriptBlock {\n source: string;\n startLine: number; // 1-based line number where the script content begins\n isTsx: boolean;\n}\n\nfunction extractScripts(source: string): ScriptBlock[] {\n const out: ScriptBlock[] = [];\n for (const match of source.matchAll(SCRIPT_RE)) {\n const full = match[0];\n const inner = match[1] ?? \"\";\n const openTag = full.slice(0, full.indexOf(\">\") + 1);\n const tagStart = match.index ?? 0;\n const contentStart = tagStart + openTag.length;\n const startLine = source.slice(0, contentStart).split(/\\r?\\n/).length;\n const isTsx = /\\blang\\s*=\\s*[\"']?(ts|tsx|typescript)[\"']?/i.test(openTag);\n out.push({ source: inner, startLine, isTsx });\n }\n return out;\n}\n\nexport async function parseSvelte(f: WalkedFile, source: string): Promise<ParsedFile> {\n const blocks = extractScripts(source);\n const out: ParsedFile = { file: f, source, symbols: [], imports: [], calls: [] };\n\n for (const block of blocks) {\n const virtual: WalkedFile = { ...f, ext: block.isTsx ? \".ts\" : \".js\" };\n const parsed = await parseTypeScript(virtual, block.source);\n const offset = block.startLine - 1;\n for (const sym of parsed.symbols) {\n out.symbols.push({\n ...sym,\n startLine: sym.startLine + offset,\n endLine: sym.endLine + offset,\n });\n }\n for (const imp of parsed.imports) out.imports.push(imp);\n for (const call of parsed.calls) out.calls.push({ ...call, line: call.line + offset });\n }\n\n // The .svelte file itself is treated as a component.\n out.symbols.push({\n name:\n f.relPath\n .split(\"/\")\n .pop()\n ?.replace(/\\.svelte$/i, \"\") ?? f.relPath,\n kind: \"component\",\n startLine: 1,\n endLine: source.split(/\\r?\\n/).length,\n signature: f.relPath,\n });\n out.imports = Array.from(new Set(out.imports));\n return out;\n}\n","// Vue SFC parser. Extracts <script> / <script setup> / <script lang=\"ts\">\n// blocks and parses them with the TypeScript parser, preserving line offsets.\n\nimport { parseTypeScript } from \"./typescript.js\";\nimport type { ParsedFile } from \"../parser.js\";\nimport type { WalkedFile } from \"../walker.js\";\n\nconst SCRIPT_RE = /<script\\b[^>]*>([\\s\\S]*?)<\\/script>/gi;\n\ninterface ScriptBlock {\n source: string;\n startLine: number;\n isTs: boolean;\n}\n\nfunction extractScripts(source: string): ScriptBlock[] {\n const out: ScriptBlock[] = [];\n for (const match of source.matchAll(SCRIPT_RE)) {\n const full = match[0];\n const inner = match[1] ?? \"\";\n const openTag = full.slice(0, full.indexOf(\">\") + 1);\n const tagStart = match.index ?? 0;\n const contentStart = tagStart + openTag.length;\n const startLine = source.slice(0, contentStart).split(/\\r?\\n/).length;\n const isTs = /\\blang\\s*=\\s*[\"']?(ts|tsx|typescript)[\"']?/i.test(openTag);\n out.push({ source: inner, startLine, isTs });\n }\n return out;\n}\n\nexport async function parseVue(f: WalkedFile, source: string): Promise<ParsedFile> {\n const blocks = extractScripts(source);\n const out: ParsedFile = { file: f, source, symbols: [], imports: [], calls: [] };\n\n for (const block of blocks) {\n const virtual: WalkedFile = { ...f, ext: block.isTs ? \".ts\" : \".js\" };\n const parsed = await parseTypeScript(virtual, block.source);\n const offset = block.startLine - 1;\n for (const sym of parsed.symbols) {\n out.symbols.push({\n ...sym,\n startLine: sym.startLine + offset,\n endLine: sym.endLine + offset,\n });\n }\n for (const imp of parsed.imports) out.imports.push(imp);\n for (const call of parsed.calls) out.calls.push({ ...call, line: call.line + offset });\n }\n\n out.symbols.push({\n name:\n f.relPath\n .split(\"/\")\n .pop()\n ?.replace(/\\.vue$/i, \"\") ?? f.relPath,\n kind: \"component\",\n startLine: 1,\n endLine: source.split(/\\r?\\n/).length,\n signature: f.relPath,\n });\n out.imports = Array.from(new Set(out.imports));\n return out;\n}\n","// Walks project root, yields files to parse.\n// Honors .gitignore + .synthraignore (additive — entries in either are ignored).\n// Defensive defaults skip VCS, build, and dependency directories even if absent\n// from .gitignore.\n\nimport type { Dirent } from \"node:fs\";\nimport { readFile, readdir, stat } from \"node:fs/promises\";\nimport { extname, join, relative, sep } from \"node:path\";\nimport ignore, { type Ignore } from \"ignore\";\n\nexport interface WalkedFile {\n absPath: string;\n relPath: string;\n ext: string;\n size: number;\n}\n\nexport interface WalkOptions {\n /** Maximum file size to yield (bytes). Defaults to 2 MB. */\n maxFileSize?: number;\n /** Additional ignore patterns layered on top of .gitignore + .synthraignore. */\n extraIgnore?: string[];\n}\n\nconst DEFAULT_IGNORE = [\n \".git/\",\n \".synthra/\",\n \".synthra-graph/\",\n \".claude/\",\n \"node_modules/\",\n \"dist/\",\n \"build/\",\n \"out/\",\n \"coverage/\",\n \".next/\",\n \".nuxt/\",\n \".svelte-kit/\",\n \".turbo/\",\n \".cache/\",\n \".vscode/\",\n \".idea/\",\n \".vs/\",\n // Flutter / Dart build caches — IDE-rehydrated, contain third-party\n // type stubs (typescript.d.ts, babylon.js etc.) that contaminate the graph.\n \".dart_tool/\",\n \".flutter-plugins\",\n \".flutter-plugins-dependencies\",\n // Android / Java / Kotlin / Rust\n \".gradle/\",\n \"target/\",\n // iOS / Xcode\n \"Pods/\",\n \"DerivedData/\",\n // Python\n \"__pycache__/\",\n \".venv/\",\n \"venv/\",\n \".tox/\",\n \".pytest_cache/\",\n \".mypy_cache/\",\n \".ruff_cache/\",\n // .NET\n \"obj/\",\n];\n\nconst BINARY_EXTS = new Set([\n \".png\",\n \".jpg\",\n \".jpeg\",\n \".gif\",\n \".webp\",\n \".svg\",\n \".ico\",\n \".bmp\",\n \".pdf\",\n \".zip\",\n \".tar\",\n \".gz\",\n \".7z\",\n \".rar\",\n \".mp3\",\n \".mp4\",\n \".mov\",\n \".avi\",\n \".webm\",\n \".wav\",\n \".ogg\",\n \".ttf\",\n \".otf\",\n \".woff\",\n \".woff2\",\n \".eot\",\n \".exe\",\n \".dll\",\n \".so\",\n \".dylib\",\n \".bin\",\n \".wasm\",\n \".lock\",\n \".lockb\",\n]);\n\nasync function readIgnoreFile(path: string): Promise<string[]> {\n try {\n const text = await readFile(path, \"utf8\");\n return text\n .split(/\\r?\\n/)\n .map((l) => l.trim())\n .filter((l) => l.length > 0 && !l.startsWith(\"#\"));\n } catch {\n return [];\n }\n}\n\nasync function buildMatcher(root: string, extra: string[]): Promise<Ignore> {\n const ig = ignore();\n ig.add(DEFAULT_IGNORE);\n ig.add(await readIgnoreFile(join(root, \".gitignore\")));\n ig.add(await readIgnoreFile(join(root, \".synthraignore\")));\n if (extra.length) ig.add(extra);\n return ig;\n}\n\nfunction toPosix(p: string): string {\n return sep === \"/\" ? p : p.split(sep).join(\"/\");\n}\n\nexport async function* walk(root: string, options: WalkOptions = {}): AsyncGenerator<WalkedFile> {\n const maxFileSize = options.maxFileSize ?? 2_000_000;\n const ig = await buildMatcher(root, options.extraIgnore ?? []);\n\n async function* recurse(dir: string): AsyncGenerator<WalkedFile> {\n let entries: Dirent[];\n try {\n entries = await readdir(dir, { withFileTypes: true });\n } catch {\n return;\n }\n for (const entry of entries) {\n const abs = join(dir, entry.name);\n const rel = relative(root, abs);\n if (!rel) continue;\n const relPosix = toPosix(rel);\n const matchPath = entry.isDirectory() ? `${relPosix}/` : relPosix;\n if (ig.ignores(matchPath)) continue;\n\n if (entry.isDirectory()) {\n yield* recurse(abs);\n } else if (entry.isFile()) {\n const ext = extname(entry.name).toLowerCase();\n if (BINARY_EXTS.has(ext)) continue;\n let size: number;\n try {\n const s = await stat(abs);\n size = s.size;\n } catch {\n continue;\n }\n if (size > maxFileSize) continue;\n yield { absPath: abs, relPath: relPosix, ext, size };\n }\n }\n }\n\n yield* recurse(root);\n}\n","// Reads/writes info_graph.json and symbol_index.json.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport type { GraphSchema, SymbolIndex } from \"./types.js\";\n\nasync function writeJson(path: string, data: unknown, pretty: boolean): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n const text = pretty ? JSON.stringify(data, null, 2) : JSON.stringify(data);\n await writeFile(path, text + \"\\n\", \"utf8\");\n}\n\nasync function readJson<T>(path: string): Promise<T> {\n const text = await readFile(path, \"utf8\");\n return JSON.parse(text) as T;\n}\n\nexport async function writeGraph(path: string, graph: GraphSchema): Promise<void> {\n // Pretty-printing a graph with full file contents balloons disk size and\n // the JSON is only ever read by machines; keep it compact.\n await writeJson(path, graph, false);\n}\n\nexport async function readGraph(path: string): Promise<GraphSchema> {\n return readJson<GraphSchema>(path);\n}\n\nexport async function writeSymbolIndex(path: string, index: SymbolIndex): Promise<void> {\n await writeJson(path, index, true);\n}\n\nexport async function readSymbolIndex(path: string): Promise<SymbolIndex> {\n // Re-home onto a null prototype so name lookups (e.g. index[\"toString\"])\n // never resolve to an inherited Object.prototype member. Mirrors\n // buildSymbolIndex, which builds the index the same way.\n const parsed = await readJson<SymbolIndex>(path);\n return Object.assign(Object.create(null), parsed);\n}\n","// Resolves Synthra's storage locations inside a project root.\n\nimport { join } from \"node:path\";\n\nexport interface SynthraPaths {\n projectRoot: string;\n graphDir: string;\n contextDir: string;\n infoGraph: string;\n symbolIndex: string;\n sessionState: string;\n activityLog: string;\n tokenLog: string;\n gateLog: string;\n bashLog: string;\n toolLog: string;\n accessLog: string;\n learnStore: string;\n parseCache: string;\n mcpPort: string;\n mcpServerLog: string;\n mcpServerErrLog: string;\n contextStore: string;\n contextMd: string;\n branchesDir: string;\n claudeDir: string;\n claudeSettings: string;\n claudeHooksDir: string;\n claudeMd: string;\n gitignore: string;\n}\n\nexport function resolvePaths(projectRoot: string): SynthraPaths {\n const graphDir = join(projectRoot, \".synthra-graph\");\n const contextDir = join(projectRoot, \".synthra\");\n const claudeDir = join(projectRoot, \".claude\");\n\n return {\n projectRoot,\n graphDir,\n contextDir,\n infoGraph: join(graphDir, \"info_graph.json\"),\n symbolIndex: join(graphDir, \"symbol_index.json\"),\n sessionState: join(graphDir, \"session.json\"),\n activityLog: join(graphDir, \"activity.jsonl\"),\n tokenLog: join(graphDir, \"token_log.jsonl\"),\n gateLog: join(graphDir, \"gate_log.jsonl\"),\n bashLog: join(graphDir, \"bash_log.jsonl\"),\n toolLog: join(graphDir, \"tool_log.jsonl\"),\n accessLog: join(graphDir, \"access_log.jsonl\"),\n learnStore: join(graphDir, \"learn_store.json\"),\n parseCache: join(graphDir, \"parse_cache.json\"),\n mcpPort: join(graphDir, \"mcp_port\"),\n mcpServerLog: join(graphDir, \"mcp_server.log\"),\n mcpServerErrLog: join(graphDir, \"mcp_server.err.log\"),\n contextStore: join(contextDir, \"context-store.json\"),\n contextMd: join(contextDir, \"CONTEXT.md\"),\n branchesDir: join(contextDir, \"branches\"),\n claudeDir,\n claudeSettings: join(claudeDir, \"settings.local.json\"),\n claudeHooksDir: join(claudeDir, \"hooks\"),\n claudeMd: join(projectRoot, \"CLAUDE.md\"),\n gitignore: join(projectRoot, \".gitignore\"),\n };\n}\n","// Project bootstrap: creates .synthra-graph/, .synthra/, updates .gitignore,\n// patches CLAUDE.md with the versioned policy block.\n\nimport { mkdir, readFile, stat, writeFile } from \"node:fs/promises\";\nimport { basename } from \"node:path\";\n\nimport { patchClaudeMd } from \"../hooks/claude-md.js\";\nimport type { SynthraPaths } from \"../shared/paths.js\";\n\nexport interface BootstrapResult {\n graphCreated: boolean;\n contextCreated: boolean;\n gitignoreUpdated: boolean;\n claudeMdUpdated: boolean;\n claudeMdCreated: boolean;\n}\n\n// Entries Synthra appends to the project .gitignore on bootstrap.\n// Each is gated by a check: if the entry is already present (any\n// indentation, trimmed match), it's skipped. Comments are per-entry so\n// users understand why each line is there and can remove what they don't\n// want without breaking the rest.\nconst GITIGNORE_ENTRIES: { comment: string; entry: string }[] = [\n {\n comment: \"added by synthra (heavy generated state — gitignored by design)\",\n entry: \".synthra-graph/\",\n },\n {\n comment:\n \"added by synthra — MCP registration. Remove this line if you want \" +\n \"to share the synthra MCP entry with teammates via committed .mcp.json\",\n entry: \".mcp.json\",\n },\n];\n\nasync function exists(path: string): Promise<boolean> {\n try {\n await stat(path);\n return true;\n } catch {\n return false;\n }\n}\n\nasync function ensureDir(path: string): Promise<boolean> {\n const had = await exists(path);\n await mkdir(path, { recursive: true });\n return !had;\n}\n\nasync function patchGitignore(path: string): Promise<boolean> {\n let existing = \"\";\n try {\n existing = await readFile(path, \"utf8\");\n } catch {\n /* file may not exist */\n }\n const trimmed = new Set(existing.split(/\\r?\\n/).map((l) => l.trim()));\n const missing = GITIGNORE_ENTRIES.filter((e) => !trimmed.has(e.entry));\n if (missing.length === 0) return false;\n\n const block = missing.map((m) => `# ${m.comment}\\n${m.entry}`).join(\"\\n\") + \"\\n\";\n const appendix =\n (existing.length === 0 || existing.endsWith(\"\\n\") ? \"\" : \"\\n\") +\n (existing.length ? \"\\n\" : \"\") +\n block;\n await writeFile(path, existing + appendix, \"utf8\");\n return true;\n}\n\nexport async function bootstrap(paths: SynthraPaths): Promise<BootstrapResult> {\n const graphCreated = await ensureDir(paths.graphDir);\n const contextCreated = await ensureDir(paths.contextDir);\n const gitignoreUpdated = await patchGitignore(paths.gitignore);\n\n const claudeMdExistedBefore = await exists(paths.claudeMd);\n const patch = await patchClaudeMd(paths.claudeMd, basename(paths.projectRoot));\n\n return {\n graphCreated,\n contextCreated,\n gitignoreUpdated,\n claudeMdUpdated: patch.updated,\n claudeMdCreated: patch.created && !claudeMdExistedBefore,\n };\n}\n","// Idempotent patcher for the project's CLAUDE.md. Manages a single block\n// bounded by <!-- synthra-policy v<N> BEGIN --> ... <!-- synthra-policy v<N> END -->.\n// On each run, any prior synthra-policy block (any version) is removed and the\n// current-version block is appended at the end.\n\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport { basename, dirname } from \"node:path\";\n\nexport const POLICY_VERSION = 8;\nexport const POLICY_BEGIN = `<!-- synthra-policy v${POLICY_VERSION} BEGIN -->`;\nexport const POLICY_END = `<!-- synthra-policy v${POLICY_VERSION} END -->`;\n\n// Matches a synthra-policy block of any version, e.g. v1, v2 …\nconst ANY_BLOCK_RE =\n /<!--\\s*synthra-policy\\s+v\\d+\\s+BEGIN\\s*-->[\\s\\S]*?<!--\\s*synthra-policy\\s+v\\d+\\s+END\\s*-->\\s*/g;\n\nexport interface PatchResult {\n created: boolean;\n updated: boolean;\n skipped: boolean;\n}\n\nexport function policyBlock(): string {\n return [\n POLICY_BEGIN,\n \"## Synthra context policy\",\n \"\",\n \"Synthra has pre-loaded structured context into this session and exposes\",\n \"the project's code graph through MCP tools. **Prefer these tools over\",\n \"Grep / Glob / Read** — they are faster, cheaper, and already filtered\",\n \"to relevant files.\",\n \"\",\n \"> **Tool namespace.** Synthra's MCP tools are exposed as\",\n \"> `mcp__synthra__graph_continue`, `mcp__synthra__graph_read`, and\",\n \"> `mcp__synthra__graph_register_edit`. **Short names will NOT resolve**\",\n \"> in ToolSearch or invocation — always use the full namespaced form.\",\n \"> If the tools are deferred, load their schemas with ToolSearch:\",\n \"> `select:mcp__synthra__graph_continue,mcp__synthra__graph_read,mcp__synthra__graph_register_edit,mcp__synthra__find_symbol`.\",\n \"> Below, short names (`graph_continue` etc.) appear in prose for\",\n \"> readability only.\",\n \"\",\n \"### Tools\",\n \"\",\n \"- **`graph_continue(query)`** — returns a `Confidence` label, the list\",\n \" of relevant `Files`, and signatures + top function bodies for those\",\n \" files. Your default first move when you need project context.\",\n \"- **`graph_read(target)`** — fetch source. Prefer the\",\n ' `\"file/path.ts::SymbolName\"` form over a bare file path — reading one',\n \" symbol is ~50 tokens, reading a whole file is thousands.\",\n \"- **`graph_register_edit(files)`** — after you edit files, call this so\",\n \" subsequent turns weight your changes and avoid stale snapshots.\",\n \"- **`find_symbol(name)`** — **reuse-first**: before writing a new helper,\",\n \" util, or function, call this to check whether one already exists. If it\",\n \" returns matches, reuse or extend them instead of re-implementing; only\",\n ' \"no match — safe to create\" means it is genuinely new.',\n \"\",\n \"### When to call `graph_continue` — and when to skip\",\n \"\",\n \"**Call `graph_continue` only when you do NOT already know the relevant\",\n \"files.**\",\n \"\",\n \"Call it when:\",\n \"- This is the first message of a new task or conversation\",\n \"- The task shifts to a different area of the codebase\",\n \"- You need files you haven't seen yet in this session\",\n \"\",\n \"**Skip `graph_continue` when:**\",\n \"- You already identified the relevant files earlier in this conversation\",\n \"- You are doing follow-up work on files already read (verify, refactor,\",\n \" test, docs, cleanup, commit)\",\n \"- The task is pure text (commit message, explanation, summary)\",\n \"\",\n \"If skipping, go directly to\",\n '`mcp__synthra__graph_read(\"file.ts::symbol\")` on what you already know.',\n \"\",\n \"### Confidence caps\",\n \"\",\n \"When `graph_continue` returns:\",\n \"\",\n \"- **`Confidence: high`** → Stop. Do NOT Grep, Glob, or further explore\",\n \" for this query. The graph already has it.\",\n \"- **`Confidence: medium`** → Read the listed `Files` directly via\",\n ' `mcp__synthra__graph_read(\"file::symbol\")` *before* trying Grep. The',\n \" graph has narrowed the search space — use it, don't bypass it.\",\n \"- **`Confidence: low`** → You may use Grep / Glob, but the PreToolUse\",\n \" hook may still block redundant calls.\",\n \"\",\n \"### Reading code\",\n \"\",\n \"- **Always use `file::symbol` notation** with `graph_read`. Whole-file\",\n \" reads should be rare — only when you genuinely need the full file.\",\n \"- If `graph_continue`'s `Files` list contains a `::` entry, pass it\",\n \" verbatim to `graph_read`.\",\n \"- **Large file?** Don't read it in successive line-range chunks — call\",\n \" `mcp__synthra__graph_continue` or\",\n ' `mcp__synthra__graph_read(\"file::symbol\")` to pull the one symbol you',\n \" need. Chunked whole-file Reads are exactly the cost `graph_read`\",\n \" exists to avoid.\",\n \"\",\n \"### Editing a file\",\n \"\",\n \"Claude Code's `Edit` tool (and `Write` when overwriting) only accepts a\",\n \"file that was opened with the **`Read` tool** — a `graph_read` slice does\",\n 'not count, and editing such a file fails with *\"File has not been read',\n 'yet.\"* So before editing a file you only know through `graph_read`: take',\n \"the line range from its header (e.g. `…::handler (L120-168)`), `Read` that\",\n \"file with a matching `offset`/`limit`, then `Edit`. That satisfies the\",\n \"gate while keeping the read small — don't whole-file `Read` unless the\",\n \"edit spans most of the file.\",\n \"\",\n \"### Don'ts\",\n \"\",\n \"- Don't Grep / Glob before calling `graph_continue` when required — the\",\n \" PreToolUse hook may block it.\",\n \"- Don't call `graph_continue` more than once per turn.\",\n \"- Don't read whole files when a symbol-level read would suffice.\",\n \"\",\n \"### Resuming a session\",\n \"\",\n 'At session start the primer may begin with a **\"Since you were last here\"**',\n \"digest — recent commits, files touched, open next-steps, and recent\",\n \"decisions carried over from the previous session. **Trust it.** It is the\",\n \"cheapest possible orientation: do NOT re-run `graph_continue` or Grep just\",\n 'to rediscover \"what were we doing / what changed\" — that work is already',\n \"done. For the concrete next steps,\",\n '`mcp__synthra__context_recall({kind:\"next\"})` returns them verbatim. Only',\n \"reach for fresh retrieval when the task moves beyond what the digest\",\n \"covers.\",\n \"\",\n \"### Session-end resume note\",\n \"\",\n 'When the user signals they\\'re done (e.g. \"bye\", \"wrap up\", \"done\"),',\n \"persist the resume state by calling `context_remember` once per bullet.\",\n \"Synthra re-renders `.synthra/CONTEXT.md` from those entries at session\",\n \"end — do **NOT** write to `CONTEXT.md` directly, it is a derived view\",\n \"and direct edits are overwritten by the Stop hook.\",\n \"\",\n \"Use these `kind` values:\",\n \"\",\n '- **`kind: \"task\"`** — what is being worked on right now (1 entry)',\n '- **`kind: \"decision\"`** — non-obvious choices made this session (max 3)',\n '- **`kind: \"next\"`** — concrete next steps (max 3)',\n \"\",\n 'Tag entries with the relevant area (`tags: [\"auth\"]`) and the files',\n 'they touch (`files: [\"src/auth.ts\"]`) so later `context_recall` queries',\n \"can filter. Keep each `text` to 1–2 sentences.\",\n \"\",\n \"_This block is managed by Synthra. Edits inside the BEGIN/END markers\",\n \"are overwritten on every `syn .` run._\",\n \"\",\n POLICY_END,\n ].join(\"\\n\");\n}\n\n// A lean, agent-facing onboarding skeleton written ONLY when a project has no\n// CLAUDE.md yet. It captures the durable \"why/how\" the graph can't infer\n// (build/test, conventions, decisions, gotchas). It lives OUTSIDE the\n// synthra-policy markers, so later `syn .` runs — which strip and re-add the\n// policy block — never touch what the user fills in here.\nexport function onboardingSkeleton(projectName: string): string {\n return [\n `# ${projectName}`,\n \"\",\n \"> Onboarding notes for AI coding agents. Synthra's graph already knows the\",\n \"> code's *structure* (files, symbols, imports) — this file is for what the\",\n \"> graph can't infer: how to run the project, its conventions, and the\",\n \"> decisions behind them. Keep it lean and current; delete prompts you don't need.\",\n \"\",\n \"## Build & test\",\n \"\",\n \"- TODO: install deps / build\",\n \"- TODO: run tests / lint / typecheck\",\n \"- TODO: run the app locally\",\n \"\",\n \"## Conventions\",\n \"\",\n \"- TODO: code style, naming, file layout the agent should follow\",\n \"\",\n \"## Key decisions\",\n \"\",\n '- TODO: non-obvious choices and *why* (\"we use X not Y because …\")',\n \"\",\n \"## Gotchas\",\n \"\",\n '- TODO: traps, footguns, \"don\\'t touch X without Y\"',\n \"\",\n \"_Tip: run `/init` in Claude Code to auto-draft the sections above, then trim\",\n \"to the durable bits. Synthra manages its own block below — leave it._\",\n \"\",\n ].join(\"\\n\");\n}\n\nexport async function patchClaudeMd(path: string, projectName?: string): Promise<PatchResult> {\n let existing: string | null;\n try {\n existing = await readFile(path, \"utf8\");\n } catch {\n existing = null;\n }\n\n const block = policyBlock();\n\n if (existing === null) {\n // First creation: scaffold the onboarding skeleton (user-owned, written\n // once) followed by Synthra's managed policy block.\n const name = projectName || basename(dirname(path)) || \"this project\";\n await writeFile(path, onboardingSkeleton(name) + \"\\n\" + block + \"\\n\", \"utf8\");\n return { created: true, updated: false, skipped: false };\n }\n\n // Strip any prior policy block (any version), then re-append the current one.\n // The block is always separated from the preceding content by exactly one\n // blank line. We must normalize here: ANY_BLOCK_RE's trailing `\\s*` consumes\n // the block's own newline, so naively re-joining `stripped + \"\\n\" + block`\n // would add a blank line on every run — invisible per `syn .`, but with\n // auto-reindex it rewrites the watched CLAUDE.md endlessly. Trimming trailing\n // whitespace and re-joining with a fixed gap makes the patch idempotent.\n const stripped = existing.replace(ANY_BLOCK_RE, \"\");\n const base = stripped.replace(/\\s+$/, \"\");\n const desired = base.length ? `${base}\\n\\n${block}\\n` : `${block}\\n`;\n\n if (desired === existing) {\n return { created: false, updated: false, skipped: true };\n }\n\n await writeFile(path, desired, \"utf8\");\n return { created: false, updated: true, skipped: false };\n}\n","// I/O for the usage-learning layer. Two files, both in .synthra-graph/\n// (gitignored, machine-local — usage is per-developer):\n// - access_log.jsonl : append-only raw events (source of truth, replayable)\n// - learn_store.json : derived decayed aggregate (a cache of the log)\n//\n// Every read is best-effort: a missing / corrupt / schema-mismatched file yields\n// an empty store, so the ranker degrades to its deterministic behavior.\n\nimport { appendFile, mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { emptyStore, LEARN_SCHEMA_VERSION, type AccessEvent, type LearnStore } from \"./usage.js\";\n\nexport async function readLearnStore(path: string): Promise<LearnStore> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<LearnStore>;\n if (\n parsed.schema_version !== LEARN_SCHEMA_VERSION ||\n typeof parsed.files !== \"object\" ||\n parsed.files === null\n ) {\n return emptyStore();\n }\n return {\n schema_version: LEARN_SCHEMA_VERSION,\n asOf: typeof parsed.asOf === \"string\" ? parsed.asOf : emptyStore().asOf,\n files: parsed.files as LearnStore[\"files\"],\n };\n } catch {\n return emptyStore();\n }\n}\n\nexport async function writeLearnStore(path: string, store: LearnStore): Promise<void> {\n try {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, JSON.stringify(store, null, 2) + \"\\n\", \"utf8\");\n } catch {\n // Persistence is best-effort; the log remains the source of truth.\n }\n}\n\nexport async function readAccessLog(path: string): Promise<AccessEvent[]> {\n try {\n const raw = await readFile(path, \"utf8\");\n const out: AccessEvent[] = [];\n for (const line of raw.split(\"\\n\")) {\n const t = line.trim();\n if (!t) continue;\n try {\n const ev = JSON.parse(t) as AccessEvent;\n if (\n ev &&\n typeof ev.ts === \"string\" &&\n typeof ev.path === \"string\" &&\n typeof ev.source === \"string\"\n ) {\n out.push(ev);\n }\n } catch {\n // Skip a malformed line rather than failing the whole replay.\n }\n }\n return out;\n } catch {\n return [];\n }\n}\n\nexport async function appendAccess(path: string, ev: AccessEvent): Promise<void> {\n try {\n await mkdir(dirname(path), { recursive: true });\n await appendFile(path, JSON.stringify(ev) + \"\\n\", \"utf8\");\n } catch {\n // Best-effort; never fail a tool call over telemetry.\n }\n}\n","// Pure decay/aggregate core for the usage-learning signal (\"the more it's used,\n// the smarter it gets\"). No I/O here — persistence + the raw access log live in\n// store.ts, and the stateful wrapper in runtime.ts.\n//\n// Files the AI actually pulls (graph_read) or edits (graph_register_edit) accrue\n// a time-decayed weight. retrieve() applies a bounded, capped boost so genuinely\n// \"hot\" files surface first — never dominating the deterministic ranker.\n\nexport type AccessSource = \"read\" | \"register_edit\" | \"continue\";\n\nexport interface AccessEvent {\n ts: string; // ISO timestamp\n path: string; // canonical FileNode.path (\"\" for source === \"continue\")\n source: AccessSource;\n query?: string; // only set for source === \"continue\" — reserved fuel for v2/v3\n}\n\nexport interface FileStat {\n /** Raw access count (never decayed) — diagnostic only. */\n count: number;\n /** Decayed weight as of `lastTs`. */\n decayed: number;\n /** ISO timestamp of the most recent folded event. */\n lastTs: string;\n}\n\nexport interface LearnStore {\n schema_version: number;\n asOf: string;\n files: Record<string, FileStat>;\n}\n\nexport const LEARN_SCHEMA_VERSION = 1;\n\nconst DAY_MS = 24 * 60 * 60 * 1000;\n\n/** Usage-decay half-life. Env-overridable for dogfood tuning. */\nexport function halfLifeMs(): number {\n const env = Number(process.env.SYN_LEARN_HALFLIFE_DAYS);\n const days = Number.isFinite(env) && env > 0 ? env : 7;\n return days * DAY_MS;\n}\n\n/** Per-source accrual weight. `continue` never contributes to frequency — it's\n * logged only as query→outcome fuel for a future mechanism. */\nexport function weightFor(source: AccessSource): number {\n switch (source) {\n case \"register_edit\":\n return 2;\n case \"read\":\n return 1;\n default:\n return 0;\n }\n}\n\nexport function emptyStore(): LearnStore {\n return {\n schema_version: LEARN_SCHEMA_VERSION,\n asOf: new Date(0).toISOString(),\n files: {},\n };\n}\n\n/** exp(-λ·Δt) decay multiplier from `fromTs` forward to `toMs` epoch ms. */\nfunction decayFactor(fromTs: string, toMs: number, hl: number): number {\n const fromMs = Date.parse(fromTs);\n if (!Number.isFinite(fromMs)) return 1;\n const dt = toMs - fromMs;\n if (dt <= 0) return 1;\n return Math.exp(-(Math.LN2 / hl) * dt);\n}\n\n/** Fold one access event into the store: decay the file's prior weight up to the\n * event's timestamp, then add the event weight. Mutates and returns `store`.\n * Zero-weight (`continue`) and path-less events are ignored. Malformed\n * timestamps are dropped so the function stays deterministic. */\nexport function foldEvent(store: LearnStore, ev: AccessEvent): LearnStore {\n const w = weightFor(ev.source);\n if (w <= 0 || !ev.path) return store;\n const tMs = Date.parse(ev.ts);\n if (!Number.isFinite(tMs)) return store;\n\n const hl = halfLifeMs();\n const prev = store.files[ev.path];\n if (prev) {\n const decayed = prev.decayed * decayFactor(prev.lastTs, tMs, hl) + w;\n store.files[ev.path] = { count: prev.count + 1, decayed, lastTs: ev.ts };\n } else {\n store.files[ev.path] = { count: 1, decayed: w, lastTs: ev.ts };\n }\n return store;\n}\n\n/** Decayed weights as of `nowMs`, keyed by path. Effectively-zero entries are\n * omitted so an old/cold store contributes nothing. */\nexport function effectiveScores(store: LearnStore, nowMs: number): Map<string, number> {\n const hl = halfLifeMs();\n const out = new Map<string, number>();\n for (const [path, stat] of Object.entries(store.files)) {\n const eff = stat.decayed * decayFactor(stat.lastTs, nowMs, hl);\n if (eff > 0.01) out.set(path, eff);\n }\n return out;\n}\n\n/** Rebuild a store by replaying a raw access-log stream (the source of truth). */\nexport function recomputeFromLog(events: AccessEvent[]): LearnStore {\n const store = emptyStore();\n for (const ev of events) foldEvent(store, ev);\n return store;\n}\n","// Stateful wrapper around the usage-learning store. Keeps the decayed aggregate\n// in memory, folds each access as it happens, persists on a trailing debounce,\n// and exposes the live scores for the ranker. Constructed once per server, like\n// ActivityStore.\n\nimport { appendAccess, readAccessLog, readLearnStore, writeLearnStore } from \"./store.js\";\nimport {\n effectiveScores,\n foldEvent,\n recomputeFromLog,\n type AccessEvent,\n type LearnStore,\n} from \"./usage.js\";\n\nconst PERSIST_DEBOUNCE_MS = 2000;\n\nexport class LearnRuntime {\n private store: LearnStore;\n private dirty = false;\n private timer: ReturnType<typeof setTimeout> | null = null;\n\n private constructor(\n private readonly accessLogPath: string,\n private readonly storePath: string,\n store: LearnStore,\n ) {\n this.store = store;\n }\n\n /** Load the aggregate from disk; if it's empty but a raw log exists, replay it\n * (the log is the source of truth). Always succeeds — falls back to empty. */\n static async load(accessLogPath: string, storePath: string): Promise<LearnRuntime> {\n let store = await readLearnStore(storePath);\n if (Object.keys(store.files).length === 0) {\n const events = await readAccessLog(accessLogPath);\n if (events.length > 0) store = recomputeFromLog(events);\n }\n return new LearnRuntime(accessLogPath, storePath, store);\n }\n\n /** Record an access: append to the durable log + fold into the in-memory\n * aggregate. Best-effort — never throws into a tool call. */\n async record(ev: AccessEvent): Promise<void> {\n await appendAccess(this.accessLogPath, ev);\n foldEvent(this.store, ev);\n this.schedulePersist();\n }\n\n /** Decayed path→weight map for the ranker, as of now. */\n effectiveScores(nowMs: number = Date.now()): Map<string, number> {\n return effectiveScores(this.store, nowMs);\n }\n\n private schedulePersist(): void {\n this.dirty = true;\n if (this.timer) return;\n this.timer = setTimeout(() => {\n this.timer = null;\n void this.flush();\n }, PERSIST_DEBOUNCE_MS);\n // Don't keep the event loop alive just for the persist timer.\n this.timer.unref?.();\n }\n\n /** Persist the aggregate if it changed since the last write. Called on the\n * debounce and on server shutdown. */\n async flush(): Promise<void> {\n if (this.timer) {\n clearTimeout(this.timer);\n this.timer = null;\n }\n if (!this.dirty) return;\n this.dirty = false;\n this.store.asOf = new Date().toISOString();\n await writeLearnStore(this.storePath, this.store);\n }\n}\n","// Environment-variable-driven configuration.\n// All knobs are prefixed SYN_.\n\nexport interface SynthraConfig {\n hardMaxReadChars: number;\n gateHintMaxChars: number;\n readDepsMaxChars: number;\n turnReadBudgetChars: number;\n fallbackMaxCallsPerTurn: number;\n retrieveCacheTtlSec: number;\n reindexDebounceMs: number;\n autoReindex: boolean;\n bashObserve: boolean;\n mcpPort: number | null;\n dashboardPort: number;\n logLevel: \"debug\" | \"info\" | \"warn\" | \"error\";\n claudeBin: string;\n}\n\nfunction num(name: string, fallback: number): number {\n const v = process.env[name];\n if (!v) return fallback;\n const n = Number(v);\n return Number.isFinite(n) ? n : fallback;\n}\n\nfunction str<T extends string>(name: string, fallback: T): T {\n return (process.env[name] as T) ?? fallback;\n}\n\nexport function loadConfig(): SynthraConfig {\n return {\n hardMaxReadChars: num(\"SYN_HARD_MAX_READ_CHARS\", 4000),\n gateHintMaxChars: num(\"SYN_GATE_HINT_CHARS\", 1200),\n readDepsMaxChars: num(\"SYN_READ_DEPS_CHARS\", 900),\n turnReadBudgetChars: num(\"SYN_TURN_READ_BUDGET_CHARS\", 18000),\n fallbackMaxCallsPerTurn: num(\"SYN_FALLBACK_MAX_CALLS_PER_TURN\", 1),\n retrieveCacheTtlSec: num(\"SYN_RETRIEVE_CACHE_TTL_SEC\", 900),\n // Auto-reindex: re-run the incremental scan + swap the in-memory graph this\n // many ms after the last source-file change, so graph reads never go stale\n // mid-session. Set SYN_NO_AUTOREINDEX to disable entirely.\n reindexDebounceMs: num(\"SYN_REINDEX_DEBOUNCE_MS\", 1000),\n autoReindex: !process.env.SYN_NO_AUTOREINDEX,\n // Observe-only: log codebase-exploration Bash commands (grep/cat/find …) so\n // the terminal bypass of the Moat can be measured. Never blocks. Opt out\n // with SYN_NO_BASH_OBSERVE.\n bashObserve: !process.env.SYN_NO_BASH_OBSERVE,\n mcpPort: process.env.SYN_MCP_PORT ? num(\"SYN_MCP_PORT\", 0) : null,\n dashboardPort: num(\"SYN_DASHBOARD_PORT\", 8901),\n logLevel: str(\"SYN_LOG_LEVEL\", \"info\" as const),\n claudeBin: str(\"SYN_CLAUDE_BIN\", \"claude\" as const),\n };\n}\n","// MCP-over-HTTP (streamable) protocol handler. Exposes Synthra's graph tools\n// to Claude Code via JSON-RPC 2.0 messages POSTed to /mcp.\n//\n// Tools:\n// graph_continue(query) — retrieve + pack a context bundle\n// graph_read(target) — return source for \"file\" or \"file::symbol\"\n// graph_register_edit(files) — Claude tells Synthra it edited files\n//\n// Spec: https://modelcontextprotocol.io/specification\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { tokenizeQuery } from \"../graph/rank.js\";\nimport { retrieve } from \"../graph/retrieve.js\";\nimport type { FileNode, GraphSchema, SymbolNode } from \"../graph/types.js\";\nimport { appendAccess } from \"../learn/store.js\";\nimport type { AccessEvent } from \"../learn/usage.js\";\nimport { recallEntries, rememberEntry } from \"../memory/index.js\";\nimport type { EntryKind } from \"../memory/context-store.js\";\nimport { pack } from \"../packer/index.js\";\nimport { findTestsForFile } from \"../packer/tests.js\";\nimport { loadConfig } from \"../shared/config.js\";\nimport type { ServerContext } from \"./context.js\";\n\nconst PROTOCOL_VERSION = \"2024-11-05\";\nconst SERVER_INFO = { name: \"synthra\", version: \"0.0.1\" } as const;\n\ntype JsonRpcId = string | number | null;\n\nexport interface JsonRpcRequest {\n jsonrpc: \"2.0\";\n id?: JsonRpcId;\n method: string;\n params?: Record<string, unknown>;\n}\n\nexport interface JsonRpcResponse {\n jsonrpc: \"2.0\";\n id: JsonRpcId;\n result?: unknown;\n error?: { code: number; message: string; data?: unknown };\n}\n\nconst ERR = {\n parse: -32700,\n invalidRequest: -32600,\n methodNotFound: -32601,\n invalidParams: -32602,\n internal: -32603,\n} as const;\n\nfunction ok(id: JsonRpcId, result: unknown): JsonRpcResponse {\n return { jsonrpc: \"2.0\", id, result };\n}\n\nfunction err(id: JsonRpcId, code: number, message: string, data?: unknown): JsonRpcResponse {\n return { jsonrpc: \"2.0\", id, error: { code, message, data } };\n}\n\nfunction textContent(text: string) {\n return { content: [{ type: \"text\", text }], isError: false };\n}\n\nfunction errorContent(message: string) {\n return { content: [{ type: \"text\", text: message }], isError: true };\n}\n\nconst TOOLS = [\n {\n name: \"graph_continue\",\n description:\n \"Returns the project context most relevant to a query — function signatures, top function bodies, and linked test files. Use this BEFORE Grep/Glob. If `confidence` is 'high', do not call Grep/Glob for the same query.\",\n inputSchema: {\n type: \"object\",\n properties: {\n query: {\n type: \"string\",\n description: \"Natural-language description of what you're looking for.\",\n },\n },\n required: [\"query\"],\n },\n },\n {\n name: \"graph_read\",\n description:\n \"Return the source code for a specific file or symbol. Target is either a project-relative file path (e.g. 'src/auth.ts') or 'file::symbol' (e.g. 'src/auth.ts::AuthService'). A symbol read also returns its dependency surface — the signatures of the symbols it calls (edit against these instead of guessing or re-reading their files) and the names of the symbols that call it.\",\n inputSchema: {\n type: \"object\",\n properties: {\n target: { type: \"string\", description: \"File path or file::symbol notation.\" },\n },\n required: [\"target\"],\n },\n },\n {\n name: \"graph_register_edit\",\n description:\n \"Tell Synthra that you (the AI) have edited these files. Lets Synthra rank them higher in subsequent retrieval and avoid surfacing stale context.\",\n inputSchema: {\n type: \"object\",\n properties: {\n files: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Project-relative file paths that were edited.\",\n },\n },\n required: [\"files\"],\n },\n },\n {\n name: \"context_remember\",\n description:\n \"Persist a decision/task/next-step/fact/blocker into the project's branch-aware context store. Use when the user makes a decision worth keeping, identifies a TODO, or surfaces a key fact. Entries land in `.synthra/context-store.json` on the default branch, or `.synthra/branches/<sanitized>/context-store.json` on a feature branch — git-tracked, so teammates inherit them and they merge naturally.\",\n inputSchema: {\n type: \"object\",\n properties: {\n text: { type: \"string\", description: \"The thing to remember (1–3 sentences).\" },\n kind: {\n type: \"string\",\n enum: [\"decision\", \"task\", \"next\", \"fact\", \"blocker\"],\n description: \"What kind of entry. Required.\",\n },\n tags: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Optional tags for grouping (e.g. 'auth', 'perf').\",\n },\n files: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Optional project-relative file paths this entry relates to.\",\n },\n },\n required: [\"text\", \"kind\"],\n },\n },\n {\n name: \"context_recall\",\n description:\n \"Read previously-stored decisions/tasks/facts from the project's branch-aware context store. Defaults to the current branch.\",\n inputSchema: {\n type: \"object\",\n properties: {\n kind: {\n type: \"string\",\n enum: [\"decision\", \"task\", \"next\", \"fact\", \"blocker\"],\n description: \"Filter to a single kind.\",\n },\n branch: { type: \"string\", description: \"Override which branch to read from.\" },\n limit: { type: \"number\", description: \"Return only the most recent N entries.\" },\n },\n },\n },\n {\n name: \"recent_activity\",\n description:\n \"What has the human been doing in the editor recently — file saves, branch switches, and uncommitted-diff changes. Use this to check whether the static context pack may be stale (e.g. before answering a question about a file that was just edited).\",\n inputSchema: {\n type: \"object\",\n properties: {\n since_ms: {\n type: \"number\",\n description:\n \"Epoch milliseconds. Only return events newer than this. Defaults to the last 60 minutes.\",\n },\n limit: { type: \"number\", description: \"Cap on returned events.\" },\n },\n },\n },\n {\n name: \"count_tokens\",\n description:\n \"Estimate token count for a piece of text using a char/4 approximation. Accurate within ~10% for English + code. Useful for budgeting prompt content before sending.\",\n inputSchema: {\n type: \"object\",\n properties: {\n text: { type: \"string\", description: \"The text to estimate tokens for.\" },\n },\n required: [\"text\"],\n },\n },\n {\n name: \"blast_radius\",\n description:\n \"See what could break before an edit. A bare file target returns all files that depend on it transitively via imports, tests, and call edges. A 'file::symbol' target returns the exact caller SYMBOLS that transitively call it (name → file:line) plus the test files guarding the impact — the precise rename-safety view. Call edges are name-resolved (precise within a file, unique-name across files).\",\n inputSchema: {\n type: \"object\",\n properties: {\n target: {\n type: \"string\",\n description: \"File path (file-level dependents) or 'file::symbol' (caller symbols).\",\n },\n depth: { type: \"number\", description: \"Max hops to traverse. Default 3.\" },\n },\n required: [\"target\"],\n },\n },\n {\n name: \"dead_code\",\n description:\n \"Return files in the project that no other file imports and no test file references — strong candidates for unused/orphaned code. File-level granularity; symbol-level dead code (unused exports, on top of the call graph) is a planned follow-up. Common entry-point patterns (main, index, app, CLI, bin/) are excluded heuristically.\",\n inputSchema: {\n type: \"object\",\n properties: {\n limit: { type: \"number\", description: \"Cap on returned files. Default 50.\" },\n },\n },\n },\n {\n name: \"find_symbol\",\n description:\n \"Find existing symbols by name BEFORE writing a new one — reuse beats re-implementing. Returns exact-name definitions (signatures + graph_read targets) or, if none, similarly-named symbols. 'No symbol matching … — safe to create' means it's genuinely new.\",\n inputSchema: {\n type: \"object\",\n properties: {\n name: { type: \"string\", description: \"Symbol name (or near-name) to look for.\" },\n },\n required: [\"name\"],\n },\n },\n {\n name: \"duplicate_symbols\",\n description:\n \"List symbol names defined in more than one file (functions/classes/types; methods excluded) — consolidation candidates for review. Advisory: duplicates may be intentional.\",\n inputSchema: {\n type: \"object\",\n properties: {\n limit: { type: \"number\", description: \"Cap on returned names. Default 30.\" },\n },\n },\n },\n] as const;\n\nasync function callTool(\n name: string,\n args: Record<string, unknown> | undefined,\n ctx: ServerContext,\n) {\n switch (name) {\n case \"graph_continue\":\n return graphContinue(args, ctx);\n case \"graph_read\":\n return graphRead(args, ctx);\n case \"graph_register_edit\":\n return graphRegisterEdit(args, ctx);\n case \"context_remember\":\n return contextRemember(args, ctx);\n case \"context_recall\":\n return contextRecall(args, ctx);\n case \"recent_activity\":\n return recentActivity(args, ctx);\n case \"count_tokens\":\n return countTokens(args);\n case \"blast_radius\":\n return blastRadius(args, ctx);\n case \"dead_code\":\n return deadCode(args, ctx);\n case \"find_symbol\":\n return findSymbol(args, ctx);\n case \"duplicate_symbols\":\n return duplicateSymbols(args, ctx);\n default:\n return errorContent(`Unknown tool: ${name}`);\n }\n}\n\nfunction countTokens(args: Record<string, unknown> | undefined) {\n const text = typeof args?.text === \"string\" ? args.text : \"\";\n if (!text) return errorContent(\"count_tokens: 'text' (string) is required\");\n const tokens = Math.ceil(text.length / 4);\n return textContent(JSON.stringify({ tokens, method: \"chars/4 estimate\", chars: text.length }));\n}\n\nfunction blastRadius(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const targetRaw = typeof args?.target === \"string\" ? args.target.trim() : \"\";\n const maxDepth = typeof args?.depth === \"number\" && args.depth > 0 ? Math.floor(args.depth) : 3;\n if (!targetRaw) return errorContent(\"blast_radius: 'target' (string) is required\");\n\n // A `file::symbol` target → precise caller-symbol impact (for renames). A bare\n // file → the file-level dependent view below (unchanged).\n if (targetRaw.includes(\"::\")) return blastRadiusSymbol(targetRaw, maxDepth, ctx);\n\n const filePath = targetRaw;\n const root = ctx.graph.nodes.find((n): n is FileNode => n.kind === \"file\" && n.path === filePath);\n if (!root) return errorContent(`blast_radius: file not in graph: ${filePath}`);\n\n // Index reverse edges (to → [{from, kind}]) once per call. `calls` edges are\n // symbol→symbol, so project them to file level (a caller's file depends on the\n // callee's file), skipping intra-file calls.\n const fileIdBySymbol = new Map<string, string>();\n for (const n of ctx.graph.nodes) {\n if (n.kind === \"symbol\") fileIdBySymbol.set(n.id, `file:${n.file}`);\n }\n const incoming = new Map<string, Array<{ from: string; kind: string }>>();\n const addIncoming = (to: string, from: string, kind: string): void => {\n const list = incoming.get(to) ?? [];\n list.push({ from, kind });\n incoming.set(to, list);\n };\n for (const e of ctx.graph.edges) {\n if (e.kind === \"imports\" || e.kind === \"tests\") {\n addIncoming(e.to, e.from, e.kind);\n } else if (e.kind === \"calls\") {\n const fromFile = fileIdBySymbol.get(e.from);\n const toFile = fileIdBySymbol.get(e.to);\n if (fromFile && toFile && fromFile !== toFile) addIncoming(toFile, fromFile, \"calls\");\n }\n }\n\n interface Hit {\n path: string;\n depth: number;\n via: string;\n }\n\n const visited = new Set<string>([root.id]);\n const hits: Hit[] = [];\n const pathById = new Map<string, string>();\n for (const n of ctx.graph.nodes) if (n.kind === \"file\") pathById.set(n.id, n.path);\n\n let frontier = [root.id];\n for (let d = 1; d <= maxDepth; d++) {\n const next: string[] = [];\n for (const cur of frontier) {\n const callers = incoming.get(cur) ?? [];\n for (const c of callers) {\n if (visited.has(c.from)) continue;\n visited.add(c.from);\n next.push(c.from);\n const path = pathById.get(c.from) ?? c.from;\n hits.push({ path, depth: d, via: c.kind });\n }\n }\n frontier = next;\n if (next.length === 0) break;\n }\n\n if (hits.length === 0) {\n return textContent(`# Blast radius for ${filePath}\\n\\n_(no dependents — file is isolated)_`);\n }\n\n hits.sort((a, b) => a.depth - b.depth || a.path.localeCompare(b.path));\n const lines = [`# Blast radius for ${filePath} (depth ≤ ${maxDepth})`, \"\"];\n lines.push(`${hits.length} dependent file(s):`);\n for (const h of hits) {\n lines.push(`- **depth ${h.depth}** \\`${h.path}\\` _(via ${h.via})_`);\n }\n return textContent(lines.join(\"\\n\"));\n}\n\n// Symbol-level blast radius: which symbols transitively CALL the target symbol.\n// This is the rename-safety view — exact caller symbols + locations, not the\n// file-level rollup. (`graph_read`'s \"Used by (N)\" footer covers the cheap\n// always-on direct-caller case; this is the complete, transitive, on-demand one.)\nfunction blastRadiusSymbol(targetRaw: string, maxDepth: number, ctx: ServerContext) {\n const [rawFile, rawSym] = targetRaw.split(\"::\", 2);\n const filePath = (rawFile ?? \"\").trim();\n const symName = (rawSym ?? \"\").trim();\n if (!symName) return errorContent(\"blast_radius: 'file::symbol' target needs a symbol name\");\n\n const resolved = resolveFileTarget(ctx.graph, filePath);\n if (\"ambiguous\" in resolved) {\n const shown = resolved.ambiguous.slice(0, 5).join(\", \");\n return errorContent(\n `blast_radius: '${filePath}' matches multiple files (${shown}). Pass a longer path.`,\n );\n }\n if (\"none\" in resolved) return errorContent(`blast_radius: file not in graph: ${filePath}`);\n const fileNode = resolved.node;\n\n const symbol = ctx.graph.nodes.find(\n (n): n is SymbolNode => n.kind === \"symbol\" && n.file === fileNode.path && n.name === symName,\n );\n if (!symbol)\n return errorContent(`blast_radius: symbol '${symName}' not found in ${fileNode.path}`);\n\n // Reverse call map (callee-id → caller-ids) + symbol lookup, built once.\n const callersBySym = new Map<string, string[]>();\n for (const e of ctx.graph.edges) {\n if (e.kind !== \"calls\" || e.from === e.to) continue;\n const list = callersBySym.get(e.to) ?? [];\n list.push(e.from);\n callersBySym.set(e.to, list);\n }\n const symById = new Map<string, SymbolNode>();\n for (const n of ctx.graph.nodes) if (n.kind === \"symbol\") symById.set(n.id, n);\n\n interface Hit {\n name: string;\n file: string;\n line: number;\n depth: number;\n }\n const visited = new Set<string>([symbol.id]);\n const hits: Hit[] = [];\n let frontier = [symbol.id];\n for (let d = 1; d <= maxDepth; d++) {\n const next: string[] = [];\n for (const cur of frontier) {\n for (const fromId of callersBySym.get(cur) ?? []) {\n if (visited.has(fromId)) continue;\n visited.add(fromId);\n next.push(fromId);\n const s = symById.get(fromId);\n if (s) hits.push({ name: s.name, file: s.file, line: s.start_line, depth: d });\n }\n }\n frontier = next;\n if (next.length === 0) break;\n }\n\n const header = `# Blast radius for ${fileNode.path}::${symbol.name} (callers, depth ≤ ${maxDepth})`;\n if (hits.length === 0) {\n const tline = testsCoveringLine(ctx.graph, [fileNode.path]);\n return textContent(\n `${header}\\n\\n_(no callers — safe to rename)_${tline ? `\\n\\n${tline}` : \"\"}`,\n );\n }\n hits.sort((a, b) => a.depth - b.depth || a.file.localeCompare(b.file) || a.line - b.line);\n const lines = [header, \"\", `${hits.length} caller symbol(s):`];\n for (const h of hits) lines.push(`- **depth ${h.depth}** \\`${h.name}\\` → ${h.file}:${h.line}`);\n const tline = testsCoveringLine(ctx.graph, [fileNode.path, ...hits.map((h) => h.file)]);\n if (tline) {\n lines.push(\"\");\n lines.push(tline);\n }\n return textContent(lines.join(\"\\n\"));\n}\n\n// One-line summary of the test files covering a set of source files (deduped).\n// Reused by the symbol-level blast radius to show which tests guard a rename.\nfunction testsCoveringLine(graph: GraphSchema, filePaths: string[]): string {\n const fileByPath = new Map<string, FileNode>();\n for (const n of graph.nodes) if (n.kind === \"file\") fileByPath.set(n.path, n);\n const seen = new Set<string>();\n const tests: string[] = [];\n for (const p of new Set(filePaths)) {\n const fn = fileByPath.get(p);\n if (!fn) continue;\n for (const t of findTestsForFile(graph, fn)) {\n if (!seen.has(t.path)) {\n seen.add(t.path);\n tests.push(t.path);\n }\n }\n }\n if (tests.length === 0) return \"\";\n const shown = tests.slice(0, TESTS_MAX_FILES);\n const omitted = tests.length - shown.length;\n return `Tests covering the impact: ${shown.join(\" · \")}${omitted > 0 ? ` …+${omitted} more` : \"\"}`;\n}\n\nconst LIKELY_ENTRY_PATTERNS = [\n /(?:^|\\/)main\\.[a-z0-9_]+$/i,\n /(?:^|\\/)index\\.[a-z0-9_]+$/i,\n /(?:^|\\/)app\\.[a-z0-9_]+$/i,\n /(?:^|\\/)entry\\.[a-z0-9_]+$/i,\n /(?:^|\\/)cli[/.]/i,\n /(?:^|\\/)bin[/.]/i,\n /(?:^|\\/)server\\.[a-z0-9_]+$/i,\n /\\.test\\.[a-z0-9_]+$/i,\n /\\.spec\\.[a-z0-9_]+$/i,\n /(?:^|\\/)tests?\\//i,\n /(?:^|\\/)__tests__\\//i,\n /(?:^|\\/)__init__\\.py$/i,\n];\n\nfunction isLikelyEntry(path: string): boolean {\n return LIKELY_ENTRY_PATTERNS.some((re) => re.test(path));\n}\n\nfunction deadCode(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const limit = typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : 50;\n\n const hasIncoming = new Set<string>();\n for (const e of ctx.graph.edges) {\n if (e.kind === \"imports\" || e.kind === \"tests\") hasIncoming.add(e.to);\n }\n\n const candidates = ctx.graph.nodes\n .filter((n): n is FileNode => n.kind === \"file\")\n .filter((f) => !hasIncoming.has(f.id))\n .filter((f) => !isLikelyEntry(f.path));\n\n if (candidates.length === 0) {\n return textContent(\n `# Dead code\\n\\n_(no file is unreferenced — every file is either imported by another, has a linked test, or matches an entry-point pattern)_`,\n );\n }\n\n candidates.sort((a, b) => a.path.localeCompare(b.path));\n const shown = candidates.slice(0, limit);\n const lines = [`# Dead code candidates (file-level, v0.1)`, \"\"];\n lines.push(\n `${shown.length} of ${candidates.length} unreferenced file(s) — no other file imports them and no test links them:`,\n );\n lines.push(\"\");\n for (const f of shown) {\n lines.push(`- \\`${f.path}\\``);\n }\n lines.push(\"\");\n lines.push(\n `_caveat:_ this is file-level only. Symbol-level dead code (unused exports), built on the now-populated call graph, is a planned follow-up.`,\n );\n return textContent(lines.join(\"\\n\"));\n}\n\nconst FIND_MAX = 12;\nconst FIND_SIG_MAX = 140;\n\nfunction symbolEntry(s: SymbolNode): string {\n const sig = s.signature.trim().slice(0, FIND_SIG_MAX);\n return `• ${sig} → mcp__synthra__graph_read(\"${s.file}::${s.name}\") [${s.symbol_kind}, L${s.start_line}]`;\n}\n\nconst byFileLine = (a: SymbolNode, b: SymbolNode): number =>\n a.file === b.file ? a.start_line - b.start_line : a.file < b.file ? -1 : 1;\n\n// find_symbol — reuse-first discovery. Exact name matches win; otherwise fall\n// back to substring/token-overlap so a near-name still surfaces an existing impl\n// to reuse instead of writing a duplicate. \"No match\" is the green light to create.\nfunction findSymbol(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const name = typeof args?.name === \"string\" ? args.name.trim() : \"\";\n if (!name) return errorContent(\"find_symbol: 'name' (string) is required\");\n\n const symbols = ctx.graph.nodes.filter((n): n is SymbolNode => n.kind === \"symbol\");\n const lower = name.toLowerCase();\n\n const exact = symbols.filter((s) => s.name === name);\n const exactHits =\n exact.length > 0 ? exact : symbols.filter((s) => s.name.toLowerCase() === lower);\n\n if (exactHits.length > 0) {\n const sorted = exactHits.slice().sort(byFileLine);\n const shown = sorted.slice(0, FIND_MAX);\n const omitted = sorted.length - shown.length;\n const lines = [\n `# find_symbol: \"${name}\"`,\n \"\",\n `Exact matches (${sorted.length}) — reuse one of these instead of writing a new one:`,\n ...shown.map(symbolEntry),\n ];\n if (omitted > 0) lines.push(`…+${omitted} more`);\n return textContent(lines.join(\"\\n\"));\n }\n\n const tokens = new Set(tokenizeQuery(name));\n const scored = symbols\n .map((s) => {\n const n = s.name.toLowerCase();\n let score = 0;\n if (n.includes(lower) || lower.includes(n)) score += 2;\n for (const t of tokens) if (n.includes(t)) score += 1;\n return { s, score };\n })\n .filter((x) => x.score > 0)\n .sort((a, b) => b.score - a.score || byFileLine(a.s, b.s));\n\n if (scored.length === 0) {\n return textContent(\n `# find_symbol: \"${name}\"\\n\\nNo symbol matching \"${name}\" — safe to create.`,\n );\n }\n const shown = scored.slice(0, FIND_MAX);\n const omitted = scored.length - shown.length;\n const lines = [\n `# find_symbol: \"${name}\"`,\n \"\",\n `No exact match. Similar names (${scored.length}) — reuse or extend one before writing new:`,\n ...shown.map((x) => symbolEntry(x.s)),\n ];\n if (omitted > 0) lines.push(`…+${omitted} more`);\n return textContent(lines.join(\"\\n\"));\n}\n\n// Symbol kinds worth flagging as cross-file duplicates. Methods are excluded —\n// the same method name across different classes is normal, not redundancy.\nconst DUP_INCLUDE = new Set([\n \"function\",\n \"class\",\n \"interface\",\n \"type\",\n \"enum\",\n \"const\",\n \"component\",\n]);\n\n// duplicate_symbols — advisory consolidation candidates: names defined in ≥2\n// distinct files. The only over-engineering check the current graph supports\n// cleanly (name lookup); never a \"delete this\" verdict.\nfunction duplicateSymbols(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const limit = typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : 30;\n\n const defsByName = new Map<string, Array<{ file: string; line: number }>>();\n const filesByName = new Map<string, Set<string>>();\n for (const n of ctx.graph.nodes) {\n if (n.kind !== \"symbol\" || !DUP_INCLUDE.has(n.symbol_kind)) continue;\n (defsByName.get(n.name) ?? defsByName.set(n.name, []).get(n.name)!).push({\n file: n.file,\n line: n.start_line,\n });\n (filesByName.get(n.name) ?? filesByName.set(n.name, new Set()).get(n.name)!).add(n.file);\n }\n\n const dups = [...defsByName.entries()]\n .filter(([name]) => (filesByName.get(name)?.size ?? 0) >= 2)\n .map(([name, defs]) => ({\n name,\n defs: defs\n .slice()\n .sort((a, b) => (a.file === b.file ? a.line - b.line : a.file < b.file ? -1 : 1)),\n }))\n .sort((a, b) => b.defs.length - a.defs.length || a.name.localeCompare(b.name));\n\n if (dups.length === 0) {\n return textContent(\n \"# Duplicate symbols\\n\\n_(no top-level symbol name is defined in more than one file)_\",\n );\n }\n\n const shown = dups.slice(0, limit);\n const lines = [\n \"# Duplicate symbols (consolidation candidates)\",\n \"\",\n `${shown.length} of ${dups.length} name(s) defined in multiple files (functions/classes/types; methods excluded):`,\n \"\",\n ];\n for (const d of shown) {\n lines.push(\n `- \\`${d.name}\\` (${d.defs.length}): ${d.defs.map((x) => `${x.file}:${x.line}`).join(\" · \")}`,\n );\n }\n lines.push(\"\");\n lines.push(\n \"_advisory: the same name in multiple files may be intentional — verify before consolidating._\",\n );\n return textContent(lines.join(\"\\n\"));\n}\n\nasync function graphContinue(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const query = typeof args?.query === \"string\" ? args.query : \"\";\n if (!query) return errorContent(\"graph_continue: 'query' (string) is required\");\n\n // Session-aware routing (#14): seed retrieval with files the session has\n // touched — the human's recent saves + edits the AI registered via\n // graph_register_edit — so the ranker boosts them. Mirrors the /pack route.\n const retrieval = await retrieve(ctx.graph, query, {\n recentlyEditedPaths: ctx.activity.recentFilePaths(15 * 60 * 1000),\n sessionKnownPaths: getRegisteredEdits(),\n usageScores: ctx.learn?.effectiveScores(),\n });\n const packed = await pack(retrieval.files, { query, graph: ctx.graph });\n\n // Log the query (no file, weight 0) as query→outcome fuel for a future\n // mechanism — never count retrieval.files, which would feed ranking its own\n // output and cause popularity runaway.\n await logAccess(ctx, { ts: nowIso(), path: \"\", source: \"continue\", query });\n\n const header =\n `Confidence: ${retrieval.confidence}\\n` +\n `Files: ${retrieval.files.map((f) => f.path).join(\", \") || \"(none)\"}\\n` +\n `Reason: ${retrieval.reason}\\n`;\n\n // The pack body already starts with a header — keep them concatenated.\n return textContent(`${header}\\n${packed.text}`);\n}\n\n// Resolve a graph_read target's file part to a FileNode. Exact path wins; on a\n// miss, fall back to a unique path-suffix match so a shortened target like\n// \"appsettings.json\" finds \"api/.../appsettings.json\". Only serves the fallback\n// when EXACTLY one file matches — multiple matches are reported as ambiguous\n// rather than guessing. (#11)\nexport type FileTargetResult = { node: FileNode } | { ambiguous: string[] } | { none: true };\n\nexport function resolveFileTarget(graph: GraphSchema, filePath: string): FileTargetResult {\n const files = graph.nodes.filter((n): n is FileNode => n.kind === \"file\");\n const exact = files.find((n) => n.path === filePath);\n if (exact) return { node: exact };\n\n const suffix = \"/\" + filePath;\n const matches = files.filter((n) => n.path.endsWith(suffix));\n if (matches.length === 1) return { node: matches[0]! };\n if (matches.length > 1) return { ambiguous: matches.map((n) => n.path) };\n return { none: true };\n}\n\nconst DEPS_SIG_MAX = 140;\nconst DEPS_MAX_CALLEES = 10;\nconst DEPS_MAX_CALLERS = 12;\nconst TESTS_MAX_FILES = 6;\n\n/**\n * Dependency surface for a symbol, rendered as a point-of-use footer for\n * graph_read: the symbols it CALLS (with full signatures + graph_read targets —\n * so the agent edits against real signatures instead of guessing or re-reading\n * the callee files) and the symbols that CALL it (names only — cheap \"a change\n * here affects these\" awareness). Built from the v0.3.0 symbol→symbol `calls`\n * edges. Returns \"\" when the symbol has no call edges (leaf — keep reads lean).\n */\nexport function buildDepsFooter(\n symbol: SymbolNode,\n graph: GraphSchema,\n maxChars = loadConfig().readDepsMaxChars,\n): string {\n const symById = new Map<string, SymbolNode>();\n for (const n of graph.nodes) if (n.kind === \"symbol\") symById.set(n.id, n);\n\n const calleeIds: string[] = [];\n const callerIds: string[] = [];\n const seenCallee = new Set<string>();\n const seenCaller = new Set<string>();\n for (const e of graph.edges) {\n if (e.kind !== \"calls\") continue;\n if (e.from === symbol.id && e.to !== symbol.id && !seenCallee.has(e.to)) {\n seenCallee.add(e.to);\n calleeIds.push(e.to);\n } else if (e.to === symbol.id && e.from !== symbol.id && !seenCaller.has(e.from)) {\n seenCaller.add(e.from);\n callerIds.push(e.from);\n }\n }\n\n const resolve = (ids: string[]): SymbolNode[] =>\n ids.map((id) => symById.get(id)).filter((n): n is SymbolNode => !!n);\n const callees = resolve(calleeIds).sort((a, b) =>\n a.file === b.file ? a.start_line - b.start_line : a.file < b.file ? -1 : 1,\n );\n const callers = resolve(callerIds);\n\n if (callees.length === 0 && callers.length === 0) return \"\";\n\n const lines: string[] = [];\n let used = 0;\n\n if (callees.length > 0) {\n const head = \"Depends on (signatures — don't guess these):\";\n lines.push(head);\n used += head.length + 1;\n let shown = 0;\n for (const c of callees.slice(0, DEPS_MAX_CALLEES)) {\n const sig = c.signature.trim().slice(0, DEPS_SIG_MAX);\n const entry = `• ${sig} → mcp__synthra__graph_read(\"${c.file}::${c.name}\")`;\n if (used + entry.length + 1 > maxChars) break;\n lines.push(entry);\n used += entry.length + 1;\n shown += 1;\n }\n const omitted = callees.length - shown;\n if (omitted > 0) lines.push(`…+${omitted} more`);\n }\n\n if (callers.length > 0) {\n const sep = lines.length > 0 ? 1 : 0;\n const head = `Used by (${callers.length}): `;\n const shown: string[] = [];\n let cUsed = used + sep + head.length;\n for (const c of callers.slice(0, DEPS_MAX_CALLERS)) {\n const part = `${c.name} → ${c.file}`;\n const join = shown.length > 0 ? 3 : 0; // \" · \"\n if (cUsed + join + part.length > maxChars) break;\n shown.push(part);\n cUsed += join + part.length;\n }\n if (lines.length > 0) lines.push(\"\");\n if (shown.length > 0) {\n const omitted = callers.length - shown.length;\n lines.push(head + shown.join(\" · \") + (omitted > 0 ? ` …+${omitted} more` : \"\"));\n } else {\n lines.push(`Used by (${callers.length} callers)`);\n }\n }\n\n return lines.join(\"\\n\");\n}\n\n/**\n * Test-coverage footer for graph_read: which test files cover this symbol's file\n * (file-level `tests` edges — foo.test.ts → foo.ts). Lets the agent run the\n * right test after an edit instead of guessing or running the whole suite.\n * Returns a one-line \"none linked\" nudge for ordinary source files, and \"\" for\n * symbols that live in a test/entry file (no nudge there).\n */\nexport function buildTestsFooter(symbol: SymbolNode, graph: GraphSchema): string {\n const fileNode = graph.nodes.find(\n (n): n is FileNode => n.kind === \"file\" && n.path === symbol.file,\n );\n if (!fileNode) return \"\";\n const tests = findTestsForFile(graph, fileNode);\n if (tests.length > 0) {\n const shown = tests.slice(0, TESTS_MAX_FILES).map((t) => t.path);\n const omitted = tests.length - shown.length;\n const more = omitted > 0 ? ` …+${omitted} more` : \"\";\n return `Tests (file-level): ${shown.join(\" · \")}${more} — run after editing`;\n }\n // No linked tests — nudge only for ordinary source files (entry/test files excluded).\n if (isLikelyEntry(symbol.file)) return \"\";\n return \"Tests: none linked to this file.\";\n}\n\nasync function graphRead(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const target = typeof args?.target === \"string\" ? args.target : \"\";\n if (!target) return errorContent(\"graph_read: 'target' (string) is required\");\n\n const [rawFile, symbolName] = target.includes(\"::\") ? target.split(\"::\", 2) : [target, undefined];\n const filePath = (rawFile ?? \"\").trim();\n\n const resolved = resolveFileTarget(ctx.graph, filePath);\n if (\"ambiguous\" in resolved) {\n const shown = resolved.ambiguous.slice(0, 5).join(\", \");\n const more = resolved.ambiguous.length > 5 ? \", …\" : \"\";\n return errorContent(\n `graph_read: '${filePath}' matches multiple files (${shown}${more}). Pass a longer path.`,\n );\n }\n if (\"none\" in resolved) {\n return errorContent(`graph_read: file not found in graph: ${filePath}`);\n }\n const fileNode = resolved.node;\n\n // The AI deliberately pulled this file — the strongest \"this matters\" signal\n // short of an edit. Feed it to the learning layer.\n await logAccess(ctx, { ts: nowIso(), path: fileNode.path, source: \"read\" });\n\n if (!symbolName) {\n return textContent(`# ${fileNode.path}\\n\\n${fileNode.content}`);\n }\n\n const cleanSym = symbolName.trim();\n const symbol = ctx.graph.nodes.find(\n (n): n is SymbolNode => n.kind === \"symbol\" && n.file === fileNode.path && n.name === cleanSym,\n );\n if (!symbol) {\n return errorContent(`graph_read: symbol '${cleanSym}' not found in ${fileNode.path}`);\n }\n\n const lines = fileNode.content.split(/\\r?\\n/);\n const body = lines.slice(symbol.start_line - 1, symbol.end_line).join(\"\\n\");\n\n // Point-of-use edit recipe. Claude Code's Edit tool only accepts a file\n // opened with its own Read tool — this slice doesn't satisfy that gate — so\n // without this nudge agents re-Read the whole file before editing (the\n // dogfood log's biggest token leak: the same large file Read 15-19× a\n // session). Hand them the exact targeted Read that satisfies the gate cheaply,\n // with 2 lines of headroom each side for off-by-one safety + unique Edit context.\n const offset = Math.max(1, symbol.start_line - 2);\n const limit = symbol.end_line - symbol.start_line + 1 + 4;\n const editHint =\n `\\n\\n---\\n✎ To edit this symbol: Read(\"${fileNode.path}\", offset=${offset}, limit=${limit}) ` +\n `then Edit — that satisfies Claude Code's read-gate at ~${limit} lines; do NOT re-read the whole file.`;\n\n const deps = buildDepsFooter(symbol, ctx.graph);\n const depsBlock = deps ? `\\n\\n---\\n${deps}` : \"\";\n\n const tests = buildTestsFooter(symbol, ctx.graph);\n const testsBlock = tests ? `\\n\\n---\\n${tests}` : \"\";\n\n return textContent(\n `# ${fileNode.path}::${symbol.name} (L${symbol.start_line}-${symbol.end_line})\\n\\n${body}${depsBlock}${testsBlock}${editHint}`,\n );\n}\n\nconst editedFiles = new Set<string>();\n\nasync function graphRegisterEdit(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const files = Array.isArray(args?.files)\n ? (args.files as unknown[]).filter((f) => typeof f === \"string\")\n : [];\n for (const f of files) {\n const file = f as string;\n editedFiles.add(file);\n // An edit is the strongest relevance signal — record it (weight 2). Resolve\n // to the canonical graph path so it keys to the same node the ranker scores;\n // a new/renamed file simply logs its raw path and decays out if unmatched.\n const resolved = resolveFileTarget(ctx.graph, file);\n await logAccess(ctx, {\n ts: nowIso(),\n path: \"node\" in resolved ? resolved.node.path : file,\n source: \"register_edit\",\n });\n }\n return textContent(\n `Registered ${files.length} edited file(s). Total tracked this session: ${editedFiles.size}.`,\n );\n}\n\nexport function getRegisteredEdits(): string[] {\n return Array.from(editedFiles);\n}\n\nconst VALID_KINDS = new Set<EntryKind>([\"decision\", \"task\", \"next\", \"fact\", \"blocker\"]);\n\nasync function contextRemember(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const text = typeof args?.text === \"string\" ? args.text.trim() : \"\";\n const kindRaw = typeof args?.kind === \"string\" ? args.kind : \"\";\n if (!text) return errorContent(\"context_remember: 'text' (string) is required\");\n if (!VALID_KINDS.has(kindRaw as EntryKind)) {\n return errorContent(\n `context_remember: 'kind' must be one of ${Array.from(VALID_KINDS).join(\", \")}`,\n );\n }\n const tags = Array.isArray(args?.tags)\n ? (args.tags as unknown[]).filter((t): t is string => typeof t === \"string\")\n : [];\n const files = Array.isArray(args?.files)\n ? (args.files as unknown[]).filter((f): f is string => typeof f === \"string\")\n : [];\n\n const result = await rememberEntry(ctx.paths, {\n text,\n kind: kindRaw as EntryKind,\n tags,\n files,\n });\n\n return textContent(\n `Remembered ${result.entry.type} on branch '${result.branch}'.\\n` +\n `Stored: ${result.storePath}\\n` +\n `CONTEXT.md refreshed: ${result.contextMdPath}`,\n );\n}\n\nconst DEFAULT_RECENT_WINDOW_MS = 60 * 60 * 1000;\n\nfunction recentActivity(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const sinceMs =\n typeof args?.since_ms === \"number\" && Number.isFinite(args.since_ms)\n ? args.since_ms\n : Date.now() - DEFAULT_RECENT_WINDOW_MS;\n const limit =\n typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : undefined;\n\n let events = ctx.activity.getEvents(sinceMs);\n if (limit) events = events.slice(-limit);\n\n if (events.length === 0) {\n return textContent(`No human-activity events since ${new Date(sinceMs).toISOString()}.`);\n }\n\n const lines = [`# Recent human activity (${events.length} events)`, \"\"];\n for (const e of events) {\n if (\"path\" in e) {\n lines.push(`- **${e.kind}** ${e.path} _(${e.ts})_`);\n } else {\n const summary = JSON.stringify(e.details);\n lines.push(`- **${e.kind}** ${summary} _(${e.ts})_`);\n }\n }\n return textContent(lines.join(\"\\n\"));\n}\n\nasync function contextRecall(args: Record<string, unknown> | undefined, ctx: ServerContext) {\n const kind =\n typeof args?.kind === \"string\" && VALID_KINDS.has(args.kind as EntryKind)\n ? (args.kind as EntryKind)\n : undefined;\n const branch = typeof args?.branch === \"string\" ? args.branch : undefined;\n const limit =\n typeof args?.limit === \"number\" && args.limit > 0 ? Math.floor(args.limit) : undefined;\n\n const result = await recallEntries(ctx.paths, { kind, branch, limit });\n\n if (result.entries.length === 0) {\n const filter = kind ? ` of kind '${kind}'` : \"\";\n return textContent(`No context entries${filter} on branch '${result.branch}'.`);\n }\n\n const lines = [`# Context entries — branch: ${result.branch}`, \"\"];\n for (const e of result.entries) {\n const tags = e.tags.length ? ` [${e.tags.join(\", \")}]` : \"\";\n lines.push(`- **${e.type}**${tags} (${e.date}): ${e.content}`);\n if (e.files.length) lines.push(` files: ${e.files.join(\", \")}`);\n }\n return textContent(lines.join(\"\\n\"));\n}\n\n// Best-effort per-call log of Synthra MCP tool usage — powers the dashboard's\n// graph-tool-usage metric (#2). A positive signal (how often the graph was\n// actually used) vs the blocked-Grep proxy, which misses well-behaved pivots.\nasync function logToolCall(ctx: ServerContext, tool: string): Promise<void> {\n try {\n await mkdir(dirname(ctx.paths.toolLog), { recursive: true });\n await appendFile(\n ctx.paths.toolLog,\n JSON.stringify({ ts: new Date().toISOString(), tool }) + \"\\n\",\n \"utf8\",\n );\n } catch {\n // Logging is best-effort; never fail a tool call over it.\n }\n}\n\n// Best-effort per-file usage capture (learning layer). Routes through the learn\n// runtime when present (folds the decayed aggregate in memory + appends the raw\n// log); otherwise appends the raw log directly so a runtime-less context (tests,\n// CLI) still records signal. Never throws — callers await it but its own errors\n// are swallowed, so telemetry can never fail a tool call.\nasync function logAccess(ctx: ServerContext, ev: AccessEvent): Promise<void> {\n try {\n if (ctx.learn) await ctx.learn.record(ev);\n else await appendAccess(ctx.paths.accessLog, ev);\n } catch {\n // best-effort\n }\n}\n\nfunction nowIso(): string {\n return new Date().toISOString();\n}\n\nexport async function handleMcpRequest(\n body: unknown,\n ctx: ServerContext,\n): Promise<JsonRpcResponse> {\n if (!body || typeof body !== \"object\") {\n return err(null, ERR.invalidRequest, \"Request body must be a JSON-RPC 2.0 object.\");\n }\n\n const req = body as JsonRpcRequest;\n if (req.jsonrpc !== \"2.0\" || typeof req.method !== \"string\") {\n return err(req.id ?? null, ERR.invalidRequest, \"Invalid JSON-RPC envelope.\");\n }\n\n const id = req.id ?? null;\n\n try {\n switch (req.method) {\n case \"initialize\":\n return ok(id, {\n protocolVersion:\n typeof req.params?.protocolVersion === \"string\"\n ? req.params.protocolVersion\n : PROTOCOL_VERSION,\n capabilities: { tools: {} },\n serverInfo: SERVER_INFO,\n });\n\n case \"notifications/initialized\":\n // Client confirms initialization. No response required for notifications (id===undefined).\n return ok(id, {});\n\n case \"tools/list\":\n return ok(id, { tools: TOOLS });\n\n case \"tools/call\": {\n const params = req.params ?? {};\n const toolName = typeof params.name === \"string\" ? params.name : \"\";\n if (!toolName) return err(id, ERR.invalidParams, \"'name' is required for tools/call.\");\n const args =\n params.arguments && typeof params.arguments === \"object\"\n ? (params.arguments as Record<string, unknown>)\n : {};\n void logToolCall(ctx, toolName);\n const result = await callTool(toolName, args, ctx);\n return ok(id, result);\n }\n\n case \"ping\":\n return ok(id, {});\n\n default:\n return err(id, ERR.methodNotFound, `Method not found: ${req.method}`);\n }\n } catch (e) {\n return err(id, ERR.internal, (e as Error).message);\n }\n}\n\n// Exposed for code that wants to enumerate the tool catalogue without going\n// through JSON-RPC (e.g. CLI introspection in M3).\nexport function listTools(): Array<{ name: string; description: string; inputSchema: unknown }> {\n return TOOLS.map((t) => ({\n name: t.name,\n description: t.description,\n inputSchema: t.inputSchema,\n }));\n}\n","// Scoring for retrieved files. Combines:\n// - keyword overlap with the (already-tokenized) query\n// - symbol-name overlap (boosted: hits in a file's defined symbols matter more)\n// - import-graph proximity from session-known + recent paths (boost adjacent files)\n// - recency boost from activity log (placeholder — wired in M5)\n\nimport type { Edge, FileNode, GraphSchema, SymbolNode } from \"./types.js\";\n\nexport interface RankInputs {\n candidates: FileNode[];\n query: string;\n graph?: GraphSchema;\n recentlyEditedPaths?: string[];\n sessionKnownPaths?: string[];\n /** Decayed per-file usage weights (path → weight) from the learning layer.\n * Applied as a bounded boost to files that ALREADY match the query. Omit to\n * disable (the ranker is then byte-identical to its deterministic form). */\n usageScores?: ReadonlyMap<string, number>;\n}\n\n// Base weight for a keyword match. The IDF reweighting is normalized to the\n// query's mean IDF, so a \"typical\"-rarity match contributes exactly this — which\n// preserves today's score magnitude (and the confidence/Moat calibration that\n// depends on it) while letting rarer terms score above and common terms below.\nconst KW_BASE_WEIGHT = 2;\n\n// Max additive usage boost. Strictly below the +5 seed boost so a maxed-out\n// usage signal can reorder within a relevance band but never leapfrog a freshly\n// seeded file or two exact symbol matches (+6). Env-overridable for tuning.\nconst USAGE_BOOST_CAP_DEFAULT = 4;\n\nfunction usageBoostCap(): number {\n const env = Number(process.env.SYN_LEARN_BOOST_CAP);\n return Number.isFinite(env) && env >= 0 ? env : USAGE_BOOST_CAP_DEFAULT;\n}\n\nexport interface ScoredFile {\n file: FileNode;\n score: number;\n reasons: string[];\n /** Total symbol-match weight (exact name = 3, partial substring = 1). */\n symHits: number;\n /** Count of symbols whose name a query token matched *exactly*. The gate\n * uses this — a partial substring match is too noisy (\"id\" ⊂ \"width\"). */\n exactSym: number;\n}\n\nconst STOPWORDS = new Set([\n \"a\",\n \"an\",\n \"and\",\n \"are\",\n \"as\",\n \"at\",\n \"be\",\n \"by\",\n \"for\",\n \"from\",\n \"has\",\n \"have\",\n \"in\",\n \"is\",\n \"it\",\n \"of\",\n \"on\",\n \"or\",\n \"that\",\n \"the\",\n \"this\",\n \"to\",\n \"was\",\n \"we\",\n \"with\",\n \"what\",\n \"where\",\n \"when\",\n \"why\",\n \"how\",\n \"do\",\n \"does\",\n \"i\",\n \"me\",\n \"my\",\n \"you\",\n \"your\",\n \"code\",\n \"file\",\n]);\n\nexport function tokenizeQuery(query: string): string[] {\n const tokens = query\n .toLowerCase()\n .split(/[^a-z0-9_]+/g)\n .filter((t) => t.length > 1 && !STOPWORDS.has(t));\n // Also split camelCase/snake_case for queries like \"AuthService\"\n const expanded = new Set<string>();\n for (const t of tokens) {\n expanded.add(t);\n const parts = t.match(/[a-z]+|[0-9]+/g) ?? [];\n for (const p of parts) if (p.length > 1) expanded.add(p);\n }\n return Array.from(expanded);\n}\n\nfunction indexSymbolsByFile(graph: GraphSchema | undefined): Map<string, SymbolNode[]> {\n const out = new Map<string, SymbolNode[]>();\n if (!graph) return out;\n for (const n of graph.nodes) {\n if (n.kind !== \"symbol\") continue;\n const list = out.get(n.file) ?? [];\n list.push(n);\n out.set(n.file, list);\n }\n return out;\n}\n\nfunction indexImportEdges(graph: GraphSchema | undefined): Map<string, Set<string>> {\n // file path → set of file paths it imports (1-hop)\n const out = new Map<string, Set<string>>();\n if (!graph) return out;\n const idToPath = new Map<string, string>();\n for (const n of graph.nodes) if (n.kind === \"file\") idToPath.set(n.id, n.path);\n for (const e of graph.edges as Edge[]) {\n if (e.kind !== \"imports\") continue;\n const from = idToPath.get(e.from);\n const to = idToPath.get(e.to);\n if (!from || !to) continue;\n const s = out.get(from) ?? new Set<string>();\n s.add(to);\n out.set(from, s);\n }\n return out;\n}\n\nexport function scoreFiles(inputs: RankInputs): ScoredFile[] {\n const qTokens = new Set(tokenizeQuery(inputs.query));\n const symbolsByFile = indexSymbolsByFile(inputs.graph);\n const importsFrom = indexImportEdges(inputs.graph);\n\n const seeds = new Set<string>(inputs.sessionKnownPaths ?? []);\n for (const p of inputs.recentlyEditedPaths ?? []) seeds.add(p);\n\n // IDF weighting for keyword matches — the part of BM25 that fits our deduped\n // top-N keyword representation (TF saturation / length-norm collapse here). A\n // query token that's rare across the repo counts for more than a common one.\n // Document frequency is computed over the candidate corpus for the query's\n // tokens only; `refIdf` (the query's mean IDF) normalizes the weighting so a\n // typical match still scores KW_BASE_WEIGHT — preserving the overall magnitude\n // and the confidence/Moat calibration, while reordering within the band.\n const corpusSize = inputs.candidates.length;\n const queryDf = new Map<string, number>();\n for (const f of inputs.candidates) {\n for (const kw of f.keywords) {\n if (qTokens.has(kw)) queryDf.set(kw, (queryDf.get(kw) ?? 0) + 1);\n }\n }\n const idf = (token: string): number => {\n const n = queryDf.get(token) ?? 0;\n if (n <= 0) return 0;\n return Math.log(1 + (corpusSize - n + 0.5) / (n + 0.5));\n };\n let idfSum = 0;\n let idfCount = 0;\n for (const t of qTokens) {\n const v = idf(t);\n if (v > 0) {\n idfSum += v;\n idfCount += 1;\n }\n }\n const refIdf = idfCount > 0 ? idfSum / idfCount : 1;\n\n // First pass: keyword + symbol score\n const scored: ScoredFile[] = [];\n for (const file of inputs.candidates) {\n const reasons: string[] = [];\n let score = 0;\n\n // Keyword overlap, IDF-weighted so a match on a rare query term outranks a\n // match on a common one (normalized to refIdf → magnitude-preserving).\n let kwHits = 0;\n let kwScore = 0;\n for (const kw of file.keywords) {\n if (!qTokens.has(kw)) continue;\n kwHits += 1;\n kwScore += KW_BASE_WEIGHT * (idf(kw) / refIdf);\n }\n if (kwHits) {\n score += kwScore;\n reasons.push(`kw=${kwHits}`);\n }\n\n // Symbol-name overlap (higher signal than file-level keywords)\n const symbols = symbolsByFile.get(file.path) ?? [];\n let symHits = 0;\n let exactSym = 0;\n for (const sym of symbols) {\n const name = sym.name.toLowerCase();\n if (qTokens.has(name)) {\n symHits += 3;\n exactSym += 1;\n } else {\n // partial match: any query token is a substring of, or contained by, the symbol name\n for (const t of qTokens) {\n if (name.includes(t) || t.includes(name)) {\n symHits += 1;\n break;\n }\n }\n }\n }\n if (symHits) {\n score += symHits;\n reasons.push(`sym=${symHits}`);\n }\n\n // Path match: file path contains a query token\n const pathLower = file.path.toLowerCase();\n let pathHits = 0;\n for (const t of qTokens) if (pathLower.includes(t)) pathHits += 1;\n if (pathHits) {\n score += pathHits;\n reasons.push(`path=${pathHits}`);\n }\n\n if (seeds.has(file.path)) {\n score += 5;\n reasons.push(\"seed\");\n }\n\n scored.push({ file, score, reasons, symHits, exactSym });\n }\n\n // Second pass: 1-hop import-graph boost from any file already scored > 0\n const positivePaths = new Set(scored.filter((s) => s.score > 0).map((s) => s.file.path));\n if (positivePaths.size > 0) {\n for (const s of scored) {\n if (s.score > 0) continue;\n // Does any file that imports this one have a positive score?\n let importBoost = 0;\n for (const [from, tos] of importsFrom) {\n if (!positivePaths.has(from)) continue;\n if (tos.has(s.file.path)) {\n importBoost += 1;\n break;\n }\n }\n if (importBoost) {\n s.score += importBoost * 0.5;\n s.reasons.push(\"imp-adj\");\n }\n }\n }\n\n // Usage-learning boost (learning v1): files the session has actually pulled or\n // edited get a small, decayed, capped bump so genuinely-hot files surface\n // first. Anchored to files that already match the query (score > 0) so a\n // popular-but-irrelevant file is never promoted; relatively normalized (u/maxU)\n // and capped below the +5 seed so it reorders within a band, never dominates.\n const usage = inputs.usageScores;\n if (usage && usage.size > 0) {\n let maxU = 0;\n for (const v of usage.values()) if (v > maxU) maxU = v;\n if (maxU > 0) {\n const cap = usageBoostCap();\n for (const s of scored) {\n if (s.score <= 0) continue;\n const u = usage.get(s.file.path) ?? 0;\n if (u <= 0) continue;\n s.score += cap * (u / maxU);\n s.reasons.push(`used×${Math.round(u)}`);\n }\n }\n }\n\n scored.sort((a, b) => b.score - a.score);\n return scored;\n}\n\nexport function rank(inputs: RankInputs): FileNode[] {\n return scoreFiles(inputs).map((s) => s.file);\n}\n","// Query-time retrieval. Given a natural-language query (or a symbol name),\n// returns a ranked list of FileNodes plus a confidence label.\n\nimport { scoreFiles, tokenizeQuery, type RankInputs } from \"./rank.js\";\nimport type { FileNode, GraphSchema } from \"./types.js\";\n\nexport interface RetrievalResult {\n files: FileNode[];\n confidence: \"high\" | \"medium\" | \"low\";\n reason: string;\n /** True if any returned file has a symbol whose name a query token matched\n * exactly — i.e. graph_read can serve a real `file::symbol` slice for this\n * query. When false, a Grep/Glob block would only force a fallback Read. */\n symbolMatched: boolean;\n}\n\nexport interface RetrieveOptions {\n topK?: number;\n recentlyEditedPaths?: string[];\n sessionKnownPaths?: string[];\n /** Decayed per-file usage weights from the learning layer. Passed straight\n * through to the ranker as a bounded boost on already-matching files. */\n usageScores?: ReadonlyMap<string, number>;\n}\n\nexport async function retrieve(\n graph: GraphSchema,\n query: string,\n options: RetrieveOptions = {},\n): Promise<RetrievalResult> {\n const topK = options.topK ?? 12;\n const qTokens = tokenizeQuery(query);\n\n const allFiles: FileNode[] = graph.nodes.filter((n): n is FileNode => n.kind === \"file\");\n\n if (allFiles.length === 0 || qTokens.length === 0) {\n return {\n files: [],\n confidence: \"low\",\n reason: qTokens.length === 0 ? \"empty query\" : \"empty graph\",\n symbolMatched: false,\n };\n }\n\n const rankInputs: RankInputs = {\n candidates: allFiles,\n query,\n graph,\n recentlyEditedPaths: options.recentlyEditedPaths,\n sessionKnownPaths: options.sessionKnownPaths,\n usageScores: options.usageScores,\n };\n const scored = scoreFiles(rankInputs);\n const positive = scored.filter((s) => s.score > 0);\n\n if (positive.length === 0) {\n return {\n files: [],\n confidence: \"low\",\n reason: `no matches for ${JSON.stringify(qTokens)}`,\n symbolMatched: false,\n };\n }\n\n const topScored = positive.slice(0, topK);\n const top = topScored.map((s) => s.file);\n const symbolMatched = topScored.some((s) => s.exactSym > 0);\n const topScore = positive[0]?.score ?? 0;\n const secondScore = positive[1]?.score ?? 0;\n\n // confidence: high = clear top match (2x next or only one hit)\n // medium = several hits but no dominant one\n // low = a few weak hits\n let confidence: \"high\" | \"medium\" | \"low\";\n if (positive.length === 1) confidence = \"high\";\n else if (topScore >= 6 && topScore >= secondScore * 2) confidence = \"high\";\n else if (topScore >= 3) confidence = \"medium\";\n else confidence = \"low\";\n\n const reasons = positive\n .slice(0, Math.min(3, top.length))\n .map((s) => `${s.file.path} (${s.reasons.join(\",\")})`)\n .join(\"; \");\n\n return {\n files: top,\n confidence,\n reason: `top: ${reasons}`,\n symbolMatched,\n };\n}\n","// Branch-aware routing for the context store.\n// On the default branch, reads/writes go to .synthra/context-store.json.\n// On a feature branch, they go to .synthra/branches/<sanitized-branch>/context-store.json.\n\nimport { execFile } from \"node:child_process\";\nimport { readFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { promisify } from \"node:util\";\n\nconst execFileAsync = promisify(execFile);\n\nexport async function currentBranch(projectRoot: string): Promise<string> {\n // Try .git/HEAD first — avoids the subprocess cost and works for detached\n // worktrees too (.git is a file there).\n try {\n const headPath = join(projectRoot, \".git\", \"HEAD\");\n const head = await readFile(headPath, \"utf8\");\n const trimmed = head.trim();\n const match = trimmed.match(/^ref:\\s+refs\\/heads\\/(.+)$/);\n if (match?.[1]) return match[1];\n // Detached HEAD — fall through\n } catch {\n // .git/HEAD unreadable (worktree file, submodule, or not a git repo)\n }\n\n try {\n const { stdout } = await execFileAsync(\"git\", [\"branch\", \"--show-current\"], {\n cwd: projectRoot,\n });\n const name = stdout.trim();\n if (name) return name;\n } catch {\n // git not on PATH or not a repo\n }\n\n return \"main\";\n}\n\nexport async function defaultBranch(projectRoot: string): Promise<string> {\n try {\n const { stdout } = await execFileAsync(\n \"git\",\n [\"symbolic-ref\", \"refs/remotes/origin/HEAD\", \"--short\"],\n { cwd: projectRoot },\n );\n const trimmed = stdout.trim();\n const match = trimmed.match(/^origin\\/(.+)$/);\n if (match?.[1]) return match[1];\n } catch {\n // No origin/HEAD set — fall back to heuristic\n }\n return \"main\";\n}\n\nexport function sanitizeBranchName(name: string): string {\n return name.replaceAll(\"/\", \"-\").replaceAll(\"\\\\\", \"-\");\n}\n\nexport interface BranchScopedPaths {\n contextStore: string;\n contextMd: string;\n branchDir: string | null;\n}\n\nexport function resolveBranchPaths(\n contextDir: string,\n branch: string,\n isDefault: boolean,\n): BranchScopedPaths {\n if (isDefault) {\n return {\n contextStore: join(contextDir, \"context-store.json\"),\n contextMd: join(contextDir, \"CONTEXT.md\"),\n branchDir: null,\n };\n }\n const branchDir = join(contextDir, \"branches\", sanitizeBranchName(branch));\n return {\n contextStore: join(branchDir, \"context-store.json\"),\n contextMd: join(branchDir, \"CONTEXT.md\"),\n branchDir,\n };\n}\n","// Free-form CONTEXT.md narrative. Updated by Stop hook at session end with:\n// - Current Task (1 sentence)\n// - Key Decisions (max 3 bullets)\n// - Next Steps (max 3 bullets)\n// Capped at ~20 visible content lines.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport type { ContextEntry } from \"./context-store.js\";\n\nexport interface ContextMd {\n branch: string;\n currentTask: string;\n keyDecisions: string[];\n nextSteps: string[];\n date: string;\n}\n\nconst MAX_BULLETS = 3;\n\nexport function deriveContextMd(entries: ContextEntry[], branch: string): ContextMd {\n // Latest pending task drives \"current task\".\n const tasks = entries.filter((e) => e.type === \"task\").reverse();\n const currentTask = tasks[0]?.content ?? \"\";\n\n const keyDecisions = entries\n .filter((e) => e.type === \"decision\")\n .slice(-MAX_BULLETS)\n .map((e) => e.content);\n\n const nextSteps = entries\n .filter((e) => e.type === \"next\")\n .slice(-MAX_BULLETS)\n .map((e) => e.content);\n\n return {\n branch,\n currentTask,\n keyDecisions,\n nextSteps,\n date: new Date().toISOString(),\n };\n}\n\nexport function formatContextMd(ctx: ContextMd): string {\n const lines: string[] = [];\n lines.push(`# Context — ${ctx.branch}`);\n lines.push(\"\");\n lines.push(`_Updated: ${ctx.date}_`);\n lines.push(\"\");\n\n if (ctx.currentTask) {\n lines.push(`## Current task`);\n lines.push(ctx.currentTask);\n lines.push(\"\");\n }\n\n if (ctx.keyDecisions.length) {\n lines.push(`## Key decisions`);\n for (const d of ctx.keyDecisions) lines.push(`- ${d}`);\n lines.push(\"\");\n }\n\n if (ctx.nextSteps.length) {\n lines.push(`## Next steps`);\n for (const n of ctx.nextSteps) lines.push(`- ${n}`);\n lines.push(\"\");\n }\n\n if (!ctx.currentTask && !ctx.keyDecisions.length && !ctx.nextSteps.length) {\n lines.push(\"_(no context entries yet — use `context_remember` to add one)_\");\n lines.push(\"\");\n }\n\n return lines.join(\"\\n\");\n}\n\nexport async function writeContextMd(path: string, ctx: ContextMd): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, formatContextMd(ctx), \"utf8\");\n}\n\nexport async function readContextMd(path: string): Promise<string | null> {\n try {\n return await readFile(path, \"utf8\");\n } catch {\n return null;\n }\n}\n","// Structured decisions/tasks/facts that persist across sessions.\n// Stored in .synthra/ (GIT-TRACKED) so teammates inherit them.\n// Branch-partitioned via branches.ts.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nexport type EntryKind = \"decision\" | \"task\" | \"next\" | \"fact\" | \"blocker\";\n\nexport interface ContextEntry {\n type: EntryKind;\n content: string;\n tags: string[];\n files: string[];\n date: string;\n /** Provenance. Reserved for v2 auto-capture; v1 only writes manual entries, so\n * the field is omitted today and read back as undefined (treated as manual). */\n source?: \"manual\" | \"auto\";\n}\n\ninterface Store {\n schema_version: number;\n entries: ContextEntry[];\n}\n\nconst SCHEMA_VERSION = 1;\n\nexport async function readEntries(path: string): Promise<ContextEntry[]> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<Store>;\n return Array.isArray(parsed.entries) ? parsed.entries : [];\n } catch {\n return [];\n }\n}\n\nexport async function writeEntries(path: string, entries: ContextEntry[]): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n const store: Store = { schema_version: SCHEMA_VERSION, entries };\n await writeFile(path, JSON.stringify(store, null, 2) + \"\\n\", \"utf8\");\n}\n\nexport async function appendEntry(path: string, entry: ContextEntry): Promise<void> {\n const entries = await readEntries(path);\n entries.push(entry);\n await writeEntries(path, entries);\n}\n","// High-level orchestration: branch detection + store routing + CONTEXT.md\n// refresh in one call. Used by the MCP tools and the /context-update route.\n\nimport type { SynthraPaths } from \"../shared/paths.js\";\nimport {\n currentBranch,\n defaultBranch,\n resolveBranchPaths,\n type BranchScopedPaths,\n} from \"./branches.js\";\nimport { deriveContextMd, writeContextMd } from \"./context-md.js\";\nimport { appendEntry, readEntries, type ContextEntry, type EntryKind } from \"./context-store.js\";\n\nexport interface ActiveBranch {\n branch: string;\n isDefault: boolean;\n paths: BranchScopedPaths;\n}\n\nexport async function resolveActiveBranch(\n paths: SynthraPaths,\n override?: string,\n): Promise<ActiveBranch> {\n const branch = override ?? (await currentBranch(paths.projectRoot));\n const def = await defaultBranch(paths.projectRoot);\n const isDefault = branch === def;\n return {\n branch,\n isDefault,\n paths: resolveBranchPaths(paths.contextDir, branch, isDefault),\n };\n}\n\nexport interface RememberInput {\n text: string;\n kind: EntryKind;\n tags?: string[];\n files?: string[];\n}\n\nexport interface RememberResult {\n entry: ContextEntry;\n branch: string;\n storePath: string;\n contextMdPath: string;\n}\n\nexport async function rememberEntry(\n paths: SynthraPaths,\n input: RememberInput,\n): Promise<RememberResult> {\n const active = await resolveActiveBranch(paths);\n const entry: ContextEntry = {\n type: input.kind,\n content: input.text,\n tags: input.tags ?? [],\n files: input.files ?? [],\n date: new Date().toISOString(),\n };\n await appendEntry(active.paths.contextStore, entry);\n\n // Refresh CONTEXT.md so the narrative stays in sync with the structured store.\n const entries = await readEntries(active.paths.contextStore);\n const md = deriveContextMd(entries, active.branch);\n await writeContextMd(active.paths.contextMd, md);\n\n return {\n entry,\n branch: active.branch,\n storePath: active.paths.contextStore,\n contextMdPath: active.paths.contextMd,\n };\n}\n\nexport interface RecallInput {\n kind?: EntryKind;\n branch?: string;\n limit?: number;\n}\n\nexport interface RecallResult {\n branch: string;\n entries: ContextEntry[];\n storePath: string;\n}\n\nexport async function recallEntries(\n paths: SynthraPaths,\n input: RecallInput = {},\n): Promise<RecallResult> {\n const active = await resolveActiveBranch(paths, input.branch);\n let entries = await readEntries(active.paths.contextStore);\n if (input.kind) entries = entries.filter((e) => e.type === input.kind);\n if (input.limit && input.limit > 0) entries = entries.slice(-input.limit);\n return {\n branch: active.branch,\n entries,\n storePath: active.paths.contextStore,\n };\n}\n\nexport async function refreshContextMd(paths: SynthraPaths, branchOverride?: string) {\n const active = await resolveActiveBranch(paths, branchOverride);\n const entries = await readEntries(active.paths.contextStore);\n const md = deriveContextMd(entries, active.branch);\n await writeContextMd(active.paths.contextMd, md);\n return {\n branch: active.branch,\n path: active.paths.contextMd,\n entriesSeen: entries.length,\n };\n}\n","// Renders the final context pack as a single Markdown blob for Claude.\n\nexport interface FormatFileSection {\n path: string;\n reason?: string;\n signatures: string[];\n inlineBodies: string;\n associatedTests?: string[];\n}\n\nexport interface FormatInputs {\n query: string;\n files: FormatFileSection[];\n recentActivity?: string;\n truncated?: boolean;\n}\n\nexport function formatPack(inputs: FormatInputs): string {\n const parts: string[] = [];\n parts.push(`# Synthra context — query: ${JSON.stringify(inputs.query)}\\n`);\n\n if (inputs.files.length === 0) {\n parts.push(\"> No matching files found in the graph.\\n\");\n }\n\n for (const f of inputs.files) {\n const heading = f.reason ? `## ${f.path} _(${f.reason})_` : `## ${f.path}`;\n parts.push(heading);\n\n if (f.signatures.length === 0) {\n parts.push(\"_(no symbols extracted)_\");\n } else {\n parts.push(\"**Signatures:**\");\n for (const s of f.signatures) parts.push(`- ${s}`);\n }\n\n if (f.inlineBodies.trim().length > 0) {\n parts.push(\"\");\n parts.push(\"**Bodies:**\");\n parts.push(\"```\");\n parts.push(f.inlineBodies.trimEnd());\n parts.push(\"```\");\n }\n\n if (f.associatedTests?.length) {\n parts.push(\"\");\n parts.push(`**Tests:** ${f.associatedTests.join(\", \")}`);\n }\n\n parts.push(\"\");\n }\n\n if (inputs.recentActivity?.trim()) {\n parts.push(\"---\");\n parts.push(\"## Recent human activity\");\n parts.push(inputs.recentActivity.trim());\n parts.push(\"\");\n }\n\n if (inputs.truncated) {\n parts.push(\"> _(pack truncated to fit budget)_\");\n }\n\n return parts.join(\"\\n\");\n}\n","// Picks the top function bodies from a file (by relevance to the query) and\n// inlines them, respecting a char-based budget. Truncates oversized bodies.\n\nimport { tokenizeQuery } from \"../graph/rank.js\";\nimport type { FileNode, SymbolKind, SymbolNode } from \"../graph/types.js\";\n\nexport interface InlineSelection {\n text: string;\n charsUsed: number;\n functionsInlined: string[];\n}\n\nconst INLINABLE_KINDS = new Set<SymbolKind>([\"function\", \"method\", \"class\"]);\nconst MAX_BODY_CHARS = 1500;\n\nfunction sliceLines(content: string, startLine: number, endLine: number): string {\n const lines = content.split(/\\r?\\n/);\n return lines.slice(Math.max(0, startLine - 1), endLine).join(\"\\n\");\n}\n\nfunction scoreSymbol(name: string, qTokens: Set<string>): number {\n const lower = name.toLowerCase();\n if (qTokens.has(lower)) return 3;\n for (const t of qTokens) {\n if (lower.includes(t) || t.includes(lower)) return 1;\n }\n return 0;\n}\n\nfunction truncate(body: string): string {\n if (body.length <= MAX_BODY_CHARS) return body;\n return body.slice(0, MAX_BODY_CHARS).trimEnd() + \"\\n // … truncated\";\n}\n\nexport function selectInlineBodies(\n file: FileNode,\n symbols: SymbolNode[],\n query: string,\n budgetChars: number,\n): InlineSelection {\n if (budgetChars <= 0) {\n return { text: \"\", charsUsed: 0, functionsInlined: [] };\n }\n\n const qTokens = new Set(tokenizeQuery(query));\n const mine = symbols.filter((s) => s.file === file.path && INLINABLE_KINDS.has(s.symbol_kind));\n\n const scored = mine\n .map((s) => ({ sym: s, score: scoreSymbol(s.name, qTokens) }))\n .sort((a, b) => {\n if (b.score !== a.score) return b.score - a.score;\n // Tie-break: smaller bodies first (so we fit more)\n const aSpan = a.sym.end_line - a.sym.start_line || 1;\n const bSpan = b.sym.end_line - b.sym.start_line || 1;\n return aSpan - bSpan;\n });\n\n const parts: string[] = [];\n const inlined: string[] = [];\n let used = 0;\n\n for (const { sym, score } of scored) {\n // Skip irrelevant symbols entirely when we have positive hits available;\n // fall back to top-by-size if no query match landed.\n if (score === 0 && inlined.length > 0) break;\n\n const body = truncate(sliceLines(file.content, sym.start_line, sym.end_line));\n const header = `${file.path}::${sym.name} (L${sym.start_line}-${sym.end_line})`;\n const block = `${header}\\n${body}\\n`;\n if (used + block.length > budgetChars) {\n if (inlined.length > 0) break;\n // No room and nothing yet — take a head-only slice.\n const remaining = Math.max(0, budgetChars - used - header.length - 16);\n if (remaining <= 0) break;\n const partial = body.slice(0, remaining).trimEnd() + \"\\n // … truncated\";\n const finalBlock = `${header}\\n${partial}\\n`;\n parts.push(finalBlock);\n inlined.push(sym.name);\n used += finalBlock.length;\n break;\n }\n parts.push(block);\n inlined.push(sym.name);\n used += block.length;\n }\n\n return { text: parts.join(\"\\n\"), charsUsed: used, functionsInlined: inlined };\n}\n","// Extracts function/class signatures from a FileNode (no bodies).\n// Signatures are the first line of each symbol in the file, sorted by line.\n\nimport type { FileNode, SymbolNode } from \"../graph/types.js\";\n\nexport function extractSignatures(file: FileNode, symbols: SymbolNode[]): string[] {\n const mine = symbols\n .filter((s) => s.file === file.path)\n .slice()\n .sort((a, b) => a.start_line - b.start_line);\n\n return mine.map((s) => `L${s.start_line}: ${s.signature.trim()}`);\n}\n","// Test ↔ source co-retrieval. Given a source file, returns the test files\n// linked to it via `tests` edges in the graph (foo.test.ts → foo.ts).\n\nimport type { FileNode, GraphSchema } from \"../graph/types.js\";\n\nexport function findTestsForFile(graph: GraphSchema, file: FileNode): FileNode[] {\n // tests edges run from test file → source file\n const fileNodesById = new Map<string, FileNode>();\n for (const n of graph.nodes) {\n if (n.kind === \"file\") fileNodesById.set(n.id, n);\n }\n\n const out: FileNode[] = [];\n for (const e of graph.edges) {\n if (e.kind !== \"tests\" || e.to !== file.id) continue;\n const testFile = fileNodesById.get(e.from);\n if (testFile && !out.includes(testFile)) out.push(testFile);\n }\n return out;\n}\n","// Compresses a list of retrieved files into a structured context pack:\n// signatures + top function bodies + tests co-retrieved + dependency edges.\n// Budget is enforced in characters (~ tokens × 4) — see SYN_HARD_MAX_READ_CHARS.\n\nimport type { FileNode, GraphSchema, SymbolNode } from \"../graph/types.js\";\nimport { formatPack, type FormatFileSection } from \"./format.js\";\nimport { selectInlineBodies } from \"./inline.js\";\nimport { extractSignatures } from \"./signatures.js\";\nimport { findTestsForFile } from \"./tests.js\";\n\nexport interface PackOptions {\n query: string;\n graph: GraphSchema;\n /** Soft target for total tokens (≈ chars/4). Default: 4000. */\n budgetTokens?: number;\n /** Fraction of remaining budget to spend on a single file's inline bodies. Default: 0.5. */\n inlineBodyRatio?: number;\n /** Co-retrieve linked test files when packing source files. Default: true. */\n includeTests?: boolean;\n /** Optional: file path → reason string from the ranker, surfaced in the pack heading. */\n reasons?: Map<string, string>;\n}\n\nexport interface ContextPack {\n text: string;\n tokenEstimate: number;\n filesUsed: string[];\n testsCoRetrieved: string[];\n truncated: boolean;\n}\n\nconst STATIC_OVERHEAD_PER_FILE = 200; // headers + bullet markdown + spacing\nconst MAX_INLINE_CHARS_PER_FILE = 2500;\n\nfunction indexSymbolsByFile(graph: GraphSchema): SymbolNode[] {\n return graph.nodes.filter((n): n is SymbolNode => n.kind === \"symbol\");\n}\n\nexport async function pack(files: FileNode[], opts: PackOptions): Promise<ContextPack> {\n const budgetTokens = opts.budgetTokens ?? 4000;\n const budgetChars = budgetTokens * 4;\n const inlineRatio = opts.inlineBodyRatio ?? 0.5;\n const includeTests = opts.includeTests ?? true;\n const reasons = opts.reasons ?? new Map<string, string>();\n\n const symbols = indexSymbolsByFile(opts.graph);\n\n const sections: FormatFileSection[] = [];\n const testsCoRetrieved: string[] = [];\n let used = 0;\n let truncated = false;\n\n for (const file of files) {\n const sig = extractSignatures(file, symbols);\n const testFiles = includeTests ? findTestsForFile(opts.graph, file) : [];\n const testPaths = testFiles.map((t) => t.path);\n\n const staticCost =\n file.path.length +\n sig.join(\"\\n\").length +\n testPaths.join(\",\").length +\n STATIC_OVERHEAD_PER_FILE;\n\n if (used + staticCost > budgetChars) {\n truncated = true;\n break;\n }\n\n const remaining = budgetChars - used - staticCost;\n const inlineBudget = Math.min(Math.floor(remaining * inlineRatio), MAX_INLINE_CHARS_PER_FILE);\n\n const inline = selectInlineBodies(file, symbols, opts.query, inlineBudget);\n\n sections.push({\n path: file.path,\n reason: reasons.get(file.path),\n signatures: sig,\n inlineBodies: inline.text,\n associatedTests: testPaths,\n });\n\n used += staticCost + inline.charsUsed;\n for (const t of testPaths) if (!testsCoRetrieved.includes(t)) testsCoRetrieved.push(t);\n\n if (used >= budgetChars) {\n truncated = true;\n break;\n }\n }\n\n if (sections.length < files.length) truncated = true;\n\n const text = formatPack({\n query: opts.query,\n files: sections,\n truncated,\n });\n const tokenEstimate = Math.ceil(text.length / 4);\n\n return {\n text,\n tokenEstimate,\n filesUsed: sections.map((s) => s.path),\n testsCoRetrieved,\n truncated,\n };\n}\n","// Finds a free port in the 8080–8099 range. Writes the chosen port to\n// .synthra-graph/mcp_port so PowerShell/Bash hook scripts can read it.\n// TODO: M2\n\nimport { createServer } from \"node:net\";\n\nexport const PORT_RANGE_START = 8080;\nexport const PORT_RANGE_END = 8099;\n\nexport async function findFreePort(\n start = PORT_RANGE_START,\n end = PORT_RANGE_END,\n): Promise<number> {\n for (let port = start; port <= end; port++) {\n if (await isFree(port)) return port;\n }\n throw new Error(`Synthra: no free port in ${start}-${end}`);\n}\n\nfunction isFree(port: number): Promise<boolean> {\n return new Promise((resolve) => {\n const s = createServer();\n s.once(\"error\", () => resolve(false));\n s.once(\"listening\", () => s.close(() => resolve(true)));\n s.listen(port, \"127.0.0.1\");\n });\n}\n","// Auto-reindex: keep the in-memory graph fresh while the server runs. When a\n// source file changes, re-run the incremental scan (only the changed file hits\n// tree-sitter; the rest reuse the content-hash parse cache) and atomically swap\n// the graph + symbolIndex the MCP tools read — so graph_read / blast_radius /\n// the dependency footer never serve stale bodies or signatures mid-session.\n\nimport { scanProject } from \"../cli/scan-command.js\";\nimport { readGraph, readSymbolIndex } from \"../graph/store.js\";\nimport { log } from \"../shared/logger.js\";\nimport type { SynthraPaths } from \"../shared/paths.js\";\nimport type { ServerContext } from \"./context.js\";\n\n/**\n * Re-run the incremental scan and atomically swap `ctx.graph` / `ctx.symbolIndex`.\n * Best-effort: a transient scan failure is logged and swallowed, never thrown,\n * so a bad rescan can't take the server down. Shared by the file-change\n * reindexer and the git branch-switch handler.\n */\nexport async function rescanAndSwap(\n ctx: ServerContext,\n paths: SynthraPaths,\n label: string,\n): Promise<void> {\n try {\n // skipBootstrap: a re-parse must not rewrite watched root files\n // (CLAUDE.md/.gitignore) — doing so from a file-change handler would feed\n // the watcher its own edits and loop forever. The project is already\n // bootstrapped at startup.\n await scanProject(paths.projectRoot, { silent: true, skipBootstrap: true });\n const [graph, symbolIndex] = await Promise.all([\n readGraph(paths.infoGraph),\n readSymbolIndex(paths.symbolIndex),\n ]);\n ctx.graph = graph;\n ctx.symbolIndex = symbolIndex;\n log.info(`reindexed (${label}) — ${graph.symbol_count} symbols, ${graph.edge_count} edges.`);\n } catch (err) {\n log.warn(`reindex failed (${label}): ${(err as Error).message}`);\n }\n}\n\nexport interface Reindexer {\n /** Note a change; runs a single rescan once changes settle (debounced). */\n schedule(): void;\n /** Cancel any pending rescan (call on server shutdown). */\n stop(): void;\n}\n\ntype RescanFn = (ctx: ServerContext, paths: SynthraPaths, label: string) => Promise<void>;\n\n/**\n * Debounced, non-overlapping reindex scheduler. A burst of file-change events\n * coalesces into one rescan; if more changes arrive while a rescan is in\n * flight, exactly one trailing rescan runs after it finishes. `rescan` is\n * injectable for tests.\n */\nexport function createReindexer(\n ctx: ServerContext,\n paths: SynthraPaths,\n opts: { debounceMs?: number; rescan?: RescanFn } = {},\n): Reindexer {\n const debounceMs = opts.debounceMs ?? 1000;\n const rescan = opts.rescan ?? rescanAndSwap;\n let timer: ReturnType<typeof setTimeout> | null = null;\n let running = false;\n let pending = false;\n\n async function run(): Promise<void> {\n if (running) {\n pending = true; // changes arrived mid-scan — run once more when done\n return;\n }\n running = true;\n try {\n await rescan(ctx, paths, \"edit\");\n } finally {\n running = false;\n if (pending) {\n pending = false;\n void run();\n }\n }\n }\n\n return {\n schedule() {\n if (timer) clearTimeout(timer);\n timer = setTimeout(() => {\n timer = null;\n void run();\n }, debounceMs);\n // Don't keep the process alive just for a pending reindex.\n timer.unref?.();\n },\n stop() {\n if (timer) {\n clearTimeout(timer);\n timer = null;\n }\n },\n };\n}\n","// GET /activity?since=<ms> — returns recent human-activity events.\n// Backed by the in-memory ActivityStore (file-watcher + git-watcher feed it).\n// MCP tool `recent_activity` is a thin wrapper.\n\nimport type { ActivityEvent } from \"../../activity/activity-log.js\";\nimport type { ServerContext } from \"../context.js\";\n\nexport interface ActivityResponse {\n events: ActivityEvent[];\n since: string;\n ring_size: number;\n}\n\nexport async function handleActivity(\n sinceMs: number | undefined,\n ctx: ServerContext,\n): Promise<ActivityResponse> {\n const events = ctx.activity.getEvents(sinceMs);\n return {\n events,\n since: new Date(sinceMs ?? Date.now()).toISOString(),\n ring_size: ctx.activity.size(),\n };\n}\n","// Thin git helpers for the session snapshot: commits since a timestamp and the\n// files changed in the latest commit. Best-effort — returns empty on no git /\n// not a repo, so the snapshot (and the resume digest built from it) degrades\n// gracefully. Mirrors the execFileAsync pattern in branches.ts / git-watcher.ts.\n\nimport { execFile } from \"node:child_process\";\nimport { promisify } from \"node:util\";\n\nimport type { SessionCommit } from \"./session.js\";\n\nconst execFileAsync = promisify(execFile);\n\nconst MAX_COMMITS = 5;\nconst FIELD = \"\\x1f\"; // unit separator — safe delimiter inside commit subjects\n\n/** Commits since `sinceIso`, newest first, capped at MAX_COMMITS. When `sinceIso`\n * is empty/invalid (first run), returns the most recent MAX_COMMITS as\n * orientation rather than dumping the entire history. */\nexport async function getCommitsSince(\n projectRoot: string,\n sinceIso: string,\n): Promise<SessionCommit[]> {\n const args = [\n \"log\",\n `--max-count=${MAX_COMMITS}`,\n \"--no-merges\",\n `--pretty=format:%h${FIELD}%s${FIELD}%aI`,\n ];\n if (Number.isFinite(Date.parse(sinceIso))) args.push(`--since=${sinceIso}`);\n\n try {\n const { stdout } = await execFileAsync(\"git\", args, { cwd: projectRoot });\n const out: SessionCommit[] = [];\n for (const line of stdout.split(\"\\n\")) {\n const t = line.trim();\n if (!t) continue;\n const [hash, message, date] = t.split(FIELD);\n if (hash && message) out.push({ hash, message, date: date ?? \"\" });\n }\n return out;\n } catch {\n return [];\n }\n}\n\n/** Files changed in the latest commit (name-only). Empty on no git / shallow. */\nexport async function getDiffFiles(projectRoot: string): Promise<string[]> {\n try {\n const { stdout } = await execFileAsync(\"git\", [\"diff\", \"--name-only\", \"HEAD~1..HEAD\"], {\n cwd: projectRoot,\n });\n return stdout\n .split(\"\\n\")\n .map((s) => s.trim())\n .filter(Boolean);\n } catch {\n return [];\n }\n}\n","// Per-session snapshot, captured at session end (Stop hook → /context-update)\n// and read by the SessionStart primer to build the \"Since you were last here\"\n// resume digest. Persisted to .synthra-graph/session.json (machine-local,\n// gitignored): it describes THIS machine's last session and is regenerated every\n// Stop, so there is no migration — a schema mismatch is simply treated as\n// \"no snapshot\" and the primer degrades to its legacy output.\n\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nexport const SESSION_SCHEMA_VERSION = 1;\n\nexport interface SessionCommit {\n hash: string;\n message: string;\n date: string;\n}\n\nexport interface SessionSummary {\n tasks: string[];\n decisions: string[];\n next: string[];\n}\n\nexport interface SessionState {\n schema_version: number;\n endedAt: string;\n branch: string;\n filesTouched: string[];\n recentCommits: SessionCommit[];\n summary: SessionSummary;\n}\n\nexport async function readSession(path: string): Promise<SessionState | null> {\n try {\n const raw = await readFile(path, \"utf8\");\n const parsed = JSON.parse(raw) as Partial<SessionState>;\n if (parsed.schema_version !== SESSION_SCHEMA_VERSION) return null;\n return parsed as SessionState;\n } catch {\n return null;\n }\n}\n\nexport async function writeSession(path: string, state: SessionState): Promise<void> {\n await mkdir(dirname(path), { recursive: true });\n await writeFile(path, JSON.stringify(state, null, 2) + \"\\n\", \"utf8\");\n}\n","// POST /context-update — Stop hook calls this at session end.\n// 1. Re-renders CONTEXT.md from the branch-scoped store so the narrative stays\n// in sync with the structured entries that landed during the session.\n// 2. Captures a session snapshot (git diff since last session + files touched +\n// open decisions/next-steps) to .synthra-graph/session.json, which the next\n// SessionStart primer reads to build a \"Since you were last here\" digest.\n// Transcript-mining for new entries (auto \"we decided X\" → store) is deferred.\n\nimport { getCommitsSince } from \"../../memory/git-snapshot.js\";\nimport { recallEntries, refreshContextMd, resolveActiveBranch } from \"../../memory/index.js\";\nimport {\n readSession,\n writeSession,\n SESSION_SCHEMA_VERSION,\n type SessionState,\n} from \"../../memory/session.js\";\nimport type { ServerContext } from \"../context.js\";\nimport { getRegisteredEdits } from \"../mcp.js\";\n\nexport interface ContextUpdateRequest {\n transcript_path?: string;\n branch?: string;\n}\n\nexport interface ContextUpdateResponse {\n updated: boolean;\n branch: string;\n path: string;\n entries: number;\n}\n\n// Window for \"files the human touched this session\" harvested from the activity\n// ring at Stop. Generous — a session can be long, and the ring is bounded anyway.\nconst TOUCHED_WINDOW_MS = 24 * 60 * 60 * 1000;\n\nasync function captureSnapshot(ctx: ServerContext, branchOverride?: string): Promise<void> {\n const active = await resolveActiveBranch(ctx.paths, branchOverride);\n\n const [tasks, decisions, next] = await Promise.all([\n recallEntries(ctx.paths, { kind: \"task\", branch: active.branch, limit: 1 }),\n recallEntries(ctx.paths, { kind: \"decision\", branch: active.branch, limit: 3 }),\n recallEntries(ctx.paths, { kind: \"next\", branch: active.branch, limit: 3 }),\n ]);\n\n // Files touched this session: AI-registered edits ∪ recent human saves.\n const touched = new Set<string>(getRegisteredEdits());\n for (const p of ctx.activity.recentFilePaths(TOUCHED_WINDOW_MS)) touched.add(p);\n\n // Commits since the previous snapshot (or the most recent few on first run).\n const prev = await readSession(ctx.paths.sessionState);\n const recentCommits = await getCommitsSince(ctx.paths.projectRoot, prev?.endedAt ?? \"\");\n\n const snapshot: SessionState = {\n schema_version: SESSION_SCHEMA_VERSION,\n endedAt: new Date().toISOString(),\n branch: active.branch,\n filesTouched: Array.from(touched),\n recentCommits,\n summary: {\n tasks: tasks.entries.map((e) => e.content),\n decisions: decisions.entries.map((e) => e.content),\n next: next.entries.map((e) => e.content),\n },\n };\n await writeSession(ctx.paths.sessionState, snapshot);\n}\n\nexport async function handleContextUpdate(\n req: ContextUpdateRequest,\n ctx: ServerContext,\n): Promise<ContextUpdateResponse> {\n const r = await refreshContextMd(ctx.paths, req?.branch);\n\n // Best-effort: a snapshot failure (no git, unwritable disk) must never break\n // the CONTEXT.md refresh that downstream tooling relies on.\n try {\n await captureSnapshot(ctx, req?.branch);\n } catch {\n // ignore — the resume digest just falls back to the legacy primer next time.\n }\n\n return {\n updated: true,\n branch: r.branch,\n path: r.path,\n entries: r.entriesSeen,\n };\n}\n","// POST /gate — PreToolUse hook calls this with the tool name + arguments.\n// THE MOAT — improvement #1. Strategy:\n// - For Grep/Glob: extract the search pattern, run retrieve().\n// - If recent human activity touches a file matching the query → ALLOW\n// even at high confidence (the user's head is in that file; static\n// context may be stale).\n// - If confidence === \"high\" and no recent overlap → BLOCK. The deny reason\n// carries the answer: exact file::symbol graph_read targets + one-line\n// signatures, so the agent never needs the whole-file Read fallback.\n// - Otherwise → ALLOW.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { retrieve } from \"../../graph/retrieve.js\";\nimport type { RetrievalResult } from \"../../graph/retrieve.js\";\nimport { tokenizeQuery } from \"../../graph/rank.js\";\nimport type { GraphSchema, SymbolNode } from \"../../graph/types.js\";\nimport { loadConfig } from \"../../shared/config.js\";\nimport type { ServerContext } from \"../context.js\";\nimport { observeBash } from \"./bash-observe.js\";\nimport { looksLikeNonSymbolQuery } from \"./query-heuristics.js\";\n\n// Re-exported for callers that imported it from here before it moved.\nexport { looksLikeNonSymbolQuery };\n\nexport interface GateRequest {\n tool_name: string;\n tool_input: Record<string, unknown>;\n}\n\nexport interface GateResponse {\n decision: \"allow\" | \"block\";\n reason?: string;\n}\n\nconst BLOCKABLE_TOOLS = new Set([\"Grep\", \"Glob\"]);\nconst RECENT_ACTIVITY_WINDOW_MS = 5 * 60 * 1000;\n\nfunction extractQuery(toolName: string, input: Record<string, unknown>): string | null {\n if (toolName === \"Grep\") {\n const pattern = typeof input.pattern === \"string\" ? input.pattern : \"\";\n const query = typeof input.query === \"string\" ? input.query : \"\";\n return (pattern || query).trim() || null;\n }\n if (toolName === \"Glob\") {\n const pattern = typeof input.pattern === \"string\" ? input.pattern : \"\";\n return pattern.replace(/[*?/\\\\.]+/g, \" \").trim() || null;\n }\n return null;\n}\n\n// A recently-touched file \"matches\" the query if a query token appears in its\n// PATH or in its graph-node KEYWORDS (file contents). The content-keyword check\n// (#3) means a recent save of e.g. auth.ts relaxes `Grep \"login\"` when auth.ts\n// contains login — not only when the path itself contains the token.\nfunction recentlyTouchedMatchesQuery(\n recentPaths: string[],\n queryTokens: Set<string>,\n graph: GraphSchema,\n): string[] {\n if (recentPaths.length === 0) return [];\n\n // Pull keywords for the recently-touched files in a single graph pass.\n const recent = new Set(recentPaths);\n const keywordsByPath = new Map<string, string[]>();\n for (const n of graph.nodes) {\n if (n.kind === \"file\" && recent.has(n.path)) keywordsByPath.set(n.path, n.keywords);\n }\n\n const matches: string[] = [];\n for (const path of recentPaths) {\n const lower = path.toLowerCase();\n let matched = false;\n for (const t of queryTokens) {\n if (lower.includes(t)) {\n matched = true;\n break;\n }\n }\n if (!matched) {\n for (const kw of keywordsByPath.get(path) ?? []) {\n if (queryTokens.has(kw)) {\n matched = true;\n break;\n }\n }\n }\n if (matched) matches.push(path);\n }\n return matches;\n}\n\n// Block hints can run to ~1200 chars; the log (and the dashboard /data payload\n// built from it) only needs enough to identify the decision, so the stored\n// reason is truncated and the full hint size is kept as a separate count.\nconst LOG_REASON_MAX_CHARS = 240;\n\nasync function logDecision(\n ctx: ServerContext,\n toolName: string,\n query: string | null,\n decision: \"allow\" | \"block\",\n reason: string | undefined,\n hintChars?: number,\n): Promise<void> {\n try {\n await mkdir(dirname(ctx.paths.gateLog), { recursive: true });\n const entry = {\n ts: new Date().toISOString(),\n tool: toolName,\n decision,\n query,\n reason:\n reason && reason.length > LOG_REASON_MAX_CHARS\n ? `${reason.slice(0, LOG_REASON_MAX_CHARS)}…`\n : reason,\n ...(hintChars === undefined ? {} : { hint_chars: hintChars }),\n };\n await appendFile(ctx.paths.gateLog, JSON.stringify(entry) + \"\\n\", \"utf8\");\n } catch {\n // Durability is best-effort; an unwritable disk shouldn't fail the gate.\n }\n}\n\nconst SIG_LINE_MAX_CHARS = 140;\n\n// How relevant is a symbol name to the query? Mirrors the packer's inline\n// scoring: exact token match dominates, substring containment is a weak hit.\nfunction scoreSymbolName(name: string, qTokens: string[]): number {\n const lower = name.toLowerCase();\n let score = 0;\n for (const t of qTokens) {\n if (t === lower) score += 3;\n else if (t.length >= 3 && lower.includes(t)) score += 1;\n }\n return score;\n}\n\n/**\n * Render the deny reason for a block. Instead of bare file paths (which sent\n * agents into whole-file Read fallbacks — see the dogfood log), the hint\n * delivers copy-pasteable namespaced graph_read targets plus one-line\n * signatures for the query's best symbols. Signatures only, no bodies: the\n * hint lands in the transcript on every block, so its own size is a cost.\n */\nexport function buildBlockHint(\n query: string,\n retrieval: RetrievalResult,\n graph: GraphSchema,\n toolName: string,\n maxChars = loadConfig().gateHintMaxChars,\n): string {\n const topFiles = retrieval.files.slice(0, 3);\n const topPaths = new Set(topFiles.map((f) => f.path));\n\n const symsByFile = new Map<string, SymbolNode[]>();\n for (const n of graph.nodes) {\n if (n.kind !== \"symbol\" || !topPaths.has(n.file)) continue;\n const list = symsByFile.get(n.file);\n if (list) list.push(n);\n else symsByFile.set(n.file, [n]);\n }\n\n const qTokens = tokenizeQuery(query);\n const entries: string[] = [];\n for (const f of topFiles) {\n const syms = (symsByFile.get(f.path) ?? []).slice().sort((a, b) => a.start_line - b.start_line);\n if (syms.length === 0) {\n // Content-indexed only (no symbols) — still point at the slice tool.\n entries.push(`• mcp__synthra__graph_read(\"${f.path}\")`);\n continue;\n }\n const scored = syms\n .map((s) => ({ s, score: scoreSymbolName(s.name, qTokens) }))\n .filter((x) => x.score > 0)\n .sort((a, b) => b.score - a.score);\n // Best 1–2 query-relevant symbols; when nothing scores, the file's first\n // symbol still gives the agent a foothold into the file.\n const picks = scored.length > 0 ? scored.slice(0, 2).map((x) => x.s) : syms.slice(0, 1);\n for (const s of picks) {\n const sig = `L${s.start_line}: ${s.signature.trim()}`;\n const sigLine =\n sig.length > SIG_LINE_MAX_CHARS ? `${sig.slice(0, SIG_LINE_MAX_CHARS - 1)}…` : sig;\n entries.push(`• mcp__synthra__graph_read(\"${f.path}::${s.name}\")\\n ${sigLine}`);\n }\n }\n\n const header =\n `Synthra blocked this ${toolName} — ${retrieval.confidence}-confidence context for \"${query}\" already exists.\\n` +\n `Read symbols directly (~50 tokens each) instead of whole files:\\n`;\n const footer = `\\nFull pack: mcp__synthra__graph_continue(\"${query}\")`;\n\n const parts: string[] = [];\n let used = header.length + footer.length + 1;\n for (const e of entries) {\n if (used + e.length + 1 > maxChars) break; // drop whole entries, never mid-entry\n parts.push(e);\n used += e.length + 1;\n }\n\n if (parts.length === 0) {\n // Degenerate budget — fall back to the legacy path list, namespaced.\n const top = topFiles.map((f) => f.path).join(\", \");\n return (\n `Synthra has ${retrieval.confidence}-confidence context for \"${query}\" (top files: ${top}). ` +\n `Use mcp__synthra__graph_continue(\"${query}\") instead of ${toolName}, ` +\n `or read a specific file/symbol with mcp__synthra__graph_read.`\n );\n }\n\n return `${header}\\n${parts.join(\"\\n\")}\\n${footer}`;\n}\n\nexport async function handleGate(req: GateRequest, ctx: ServerContext): Promise<GateResponse> {\n if (!req?.tool_name || typeof req.tool_name !== \"string\") {\n return { decision: \"allow\", reason: \"no tool_name\" };\n }\n\n // Bash is OBSERVE-ONLY: record codebase-exploration commands (rg/cat/find …)\n // so the terminal bypass of the Moat can be measured, but never block them.\n if (req.tool_name === \"Bash\") {\n const input = (\n req.tool_input && typeof req.tool_input === \"object\" ? req.tool_input : {}\n ) as Record<string, unknown>;\n await observeBash(input, ctx);\n return { decision: \"allow\" };\n }\n\n if (!BLOCKABLE_TOOLS.has(req.tool_name)) {\n return { decision: \"allow\" };\n }\n\n const input = (\n req.tool_input && typeof req.tool_input === \"object\" ? req.tool_input : {}\n ) as Record<string, unknown>;\n const query = extractQuery(req.tool_name, input);\n if (!query) {\n const res: GateResponse = { decision: \"allow\", reason: \"no extractable query\" };\n await logDecision(ctx, req.tool_name, null, res.decision, res.reason);\n return res;\n }\n\n // Guard 1 — the query targets markup/CSS/attributes/literals, which the graph\n // does not index. Blocking would only force a fallback, so let Grep through.\n if (req.tool_name === \"Grep\" && looksLikeNonSymbolQuery(query)) {\n const res: GateResponse = {\n decision: \"allow\",\n reason: `\"${query}\" targets markup/CSS/attributes, not code symbols — letting Grep through (the graph indexes symbols).`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n const retrieval = await retrieve(ctx.graph, query);\n // \"low\" = no real matches → let Grep through; Synthra has nothing useful.\n // \"medium\" + \"high\" = Synthra has structured context for this query →\n // bias toward blocking. The pitch (\"use graph_continue instead of Grep\")\n // holds at medium too — on real codebases of any size, \"high\" is rare\n // because almost every query matches multiple files.\n if (retrieval.confidence === \"low\") {\n const res: GateResponse = {\n decision: \"allow\",\n reason: `confidence=low — no graph context for \"${query}\", letting ${req.tool_name} through`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n // Medium / high — but check if recent activity overlaps the query first.\n // If the user just touched a file matching the query, static context may\n // be stale and they probably want a fresh search.\n const qTokens = new Set(tokenizeQuery(query));\n const recentPaths = ctx.activity.recentFilePaths(RECENT_ACTIVITY_WINDOW_MS);\n const overlap = recentlyTouchedMatchesQuery(recentPaths, qTokens, ctx.graph);\n\n if (overlap.length > 0) {\n const res: GateResponse = {\n decision: \"allow\",\n reason:\n `confidence=${retrieval.confidence} but human just touched ${overlap.slice(0, 3).join(\", \")} — ` +\n `static context may be stale, letting ${req.tool_name} through.`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n // Guard 2 — the graph matched files only by keyword/path, not by a symbol the\n // query names, so graph_read can't return a real slice. A block would just\n // force a fallback Read; let the search through instead.\n if (!retrieval.symbolMatched) {\n const res: GateResponse = {\n decision: \"allow\",\n reason:\n `confidence=${retrieval.confidence} but only keyword/path matched (no symbol the query names) — ` +\n `graph_read can't slice it, letting ${req.tool_name} through.`,\n };\n await logDecision(ctx, req.tool_name, query, res.decision, res.reason);\n return res;\n }\n\n const hint = buildBlockHint(query, retrieval, ctx.graph, req.tool_name);\n const res: GateResponse = { decision: \"block\", reason: hint };\n await logDecision(ctx, req.tool_name, query, res.decision, hint, hint.length);\n return res;\n}\n","// Bash exploration observer — OBSERVE-ONLY. The Moat blocks Grep/Glob, but the\n// agent can still walk the codebase through the terminal (`rg foo src/`,\n// `cat src/x.ts`, `find . -name …`), and every such call is a read the graph\n// could have served in ~50 tokens. This module classifies those commands and\n// logs them (with whether the graph COULD have answered) so the leak can be\n// measured before deciding whether to block it. It NEVER blocks anything.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport { retrieve } from \"../../graph/retrieve.js\";\nimport { loadConfig } from \"../../shared/config.js\";\nimport type { ServerContext } from \"../context.js\";\nimport { looksLikeNonSymbolQuery } from \"./query-heuristics.js\";\n\nexport type BashExploreKind = \"search\" | \"read\" | \"list\";\n\nexport interface BashExploration {\n /** search = grep/rg over the tree · read = cat/head of a source file · list = find/tree */\n kind: BashExploreKind;\n /** the underlying tool, e.g. \"rg\", \"grep\", \"cat\", \"find\" */\n tool: string;\n /** the search pattern (search) or the file/dir target (read/list) */\n query: string | null;\n}\n\ntype Confidence = \"low\" | \"medium\" | \"high\";\n\n// Read-only exploration tools. Allowlist, not denylist — anything not here\n// (npm/git/node/tsc/make/docker/mkdir/rm/echo/curl…) is left alone.\nconst SEARCH_TOOLS = new Set([\"grep\", \"egrep\", \"fgrep\", \"rg\", \"ripgrep\", \"ag\", \"ack\"]);\nconst READ_TOOLS = new Set([\"cat\", \"head\", \"tail\", \"less\", \"more\", \"bat\", \"tac\"]);\nconst LIST_TOOLS = new Set([\"find\", \"tree\"]);\n\n// File extensions Synthra parses or content-indexes — a `cat` of one of these is\n// a whole-file read the graph could slice.\nconst SOURCE_EXT =\n /\\.(ts|tsx|js|jsx|cts|mts|cjs|mjs|py|pyi|svelte|vue|go|rs|java|kt|kts|php|rb|c|h|cpp|cc|cxx|hpp|cs|dart|json|md|css|html|hubl|sh|yml|yaml|toml)$/i;\n\n/**\n * Quote-aware shell tokenizer. Splits on whitespace and the operators\n * `| || && ;`, but treats quoted runs as a single token so an operator inside a\n * pattern (`rg \"foo|bar\"`) is preserved rather than split. Quote characters are\n * dropped; their contents are kept.\n */\nexport function tokenizeCommand(cmd: string): string[] {\n const tokens: string[] = [];\n let cur = \"\";\n let quote: '\"' | \"'\" | null = null;\n let hasContent = false;\n const flush = () => {\n if (hasContent) tokens.push(cur);\n cur = \"\";\n hasContent = false;\n };\n for (let i = 0; i < cmd.length; i++) {\n const ch = cmd[i] as string;\n if (quote) {\n if (ch === quote) quote = null;\n else cur += ch;\n hasContent = true;\n continue;\n }\n if (ch === '\"' || ch === \"'\") {\n quote = ch;\n hasContent = true; // an empty quoted string is still a token\n continue;\n }\n if (ch === \"|\" || ch === \"&\" || ch === \";\") {\n flush();\n let op = ch;\n if ((ch === \"|\" || ch === \"&\") && cmd[i + 1] === ch) {\n op += ch;\n i++;\n }\n tokens.push(op);\n continue;\n }\n if (/\\s/.test(ch)) {\n flush();\n continue;\n }\n cur += ch;\n hasContent = true;\n }\n flush();\n return tokens;\n}\n\nfunction isOperator(t: string): boolean {\n return t === \"|\" || t === \"||\" || t === \"&&\" || t === \";\";\n}\n\nfunction splitSegments(tokens: string[]): string[][] {\n const segs: string[][] = [];\n let cur: string[] = [];\n for (const t of tokens) {\n if (isOperator(t)) {\n if (cur.length) segs.push(cur);\n cur = [];\n } else {\n cur.push(t);\n }\n }\n if (cur.length) segs.push(cur);\n return segs;\n}\n\n// Drop a leading `env` and any `VAR=value` assignment prefixes so the real\n// command surfaces.\nfunction commandTokens(seg: string[]): string[] {\n let i = 0;\n while (i < seg.length) {\n const t = seg[i] as string;\n if (t === \"env\") {\n i++;\n continue;\n }\n if (/^[A-Za-z_][A-Za-z0-9_]*=/.test(t)) {\n i++;\n continue;\n }\n break;\n }\n return seg.slice(i);\n}\n\nfunction baseCmd(tok: string): string {\n return (tok.split(/[\\\\/]/).pop() ?? tok).toLowerCase();\n}\n\nfunction classifySegment(seg: string[]): BashExploration | null {\n const toks = commandTokens(seg);\n if (toks.length === 0) return null;\n const cmd = baseCmd(toks[0] as string);\n const rest = toks.slice(1);\n const flags = rest.filter((a) => a.startsWith(\"-\"));\n const nonFlags = rest.filter((a) => !a.startsWith(\"-\"));\n\n if (SEARCH_TOOLS.has(cmd)) {\n const pattern = nonFlags[0];\n if (!pattern) return null; // no pattern → not a meaningful search\n const recursive = flags.some(\n (f) => f === \"-r\" || f === \"-R\" || f === \"--recursive\" || /^-[a-zA-Z]*[rR]$/.test(f),\n );\n const rgLike = cmd === \"rg\" || cmd === \"ripgrep\" || cmd === \"ag\" || cmd === \"ack\";\n const hasPathArg = nonFlags.length > 1;\n // grep/egrep/fgrep with no path reads stdin — that's filtering another\n // command's output, not searching the codebase. rg/ag default to a recursive\n // cwd search, so they count even without an explicit path.\n if (!rgLike && !recursive && !hasPathArg) return null;\n return { kind: \"search\", tool: cmd, query: pattern };\n }\n\n if (READ_TOOLS.has(cmd)) {\n const file = nonFlags.find((a) => SOURCE_EXT.test(a));\n if (!file) return null; // reading stdin or a non-source file\n return { kind: \"read\", tool: cmd, query: file };\n }\n\n if (LIST_TOOLS.has(cmd)) {\n const nameIdx = rest.findIndex((a) => a === \"-name\" || a === \"-iname\" || a === \"-path\");\n const target = nameIdx >= 0 ? (rest[nameIdx + 1] ?? null) : (nonFlags[0] ?? \".\");\n return { kind: \"list\", tool: cmd, query: target };\n }\n\n return null;\n}\n\n/**\n * Classify a Bash command as codebase exploration, or null if it isn't one we\n * recognize. Conservative: a write/redirect anywhere voids the whole command\n * (it's no longer a pure read), and only the allowlisted tools match.\n */\nexport function classifyBashCommand(command: string): BashExploration | null {\n if (!command || typeof command !== \"string\") return null;\n const tokens = tokenizeCommand(command);\n if (tokens.length === 0) return null;\n // Any redirect → there's a side effect; not pure read-only exploration.\n if (tokens.some((t) => !isOperator(t) && t.includes(\">\"))) return null;\n\n const found = splitSegments(tokens)\n .map(classifySegment)\n .filter((x): x is BashExploration => x !== null);\n if (found.length === 0) return null;\n\n // Prefer a real symbol search over a file read over a directory listing.\n const prio: Record<BashExploreKind, number> = { search: 0, read: 1, list: 2 };\n found.sort((a, b) => prio[a.kind] - prio[b.kind]);\n return found[0] as BashExploration;\n}\n\nfunction graphHasFile(ctx: ServerContext, target: string): boolean {\n const base = target.split(/[\\\\/]/).pop() ?? target;\n for (const n of ctx.graph.nodes) {\n if (n.kind !== \"file\") continue;\n if (n.path === target || n.path.endsWith(`/${target}`) || n.path.split(\"/\").pop() === base) {\n return true;\n }\n }\n return false;\n}\n\nconst Q_MAX = 200;\nconst CMD_MAX = 300;\nconst trunc = (s: string, max: number) => (s.length > max ? `${s.slice(0, max)}…` : s);\n\nasync function logObservation(\n ctx: ServerContext,\n exp: BashExploration,\n confidence: Confidence | null,\n avoidable: boolean,\n command: string,\n): Promise<void> {\n try {\n await mkdir(dirname(ctx.paths.bashLog), { recursive: true });\n const entry = {\n ts: new Date().toISOString(),\n kind: exp.kind,\n tool: exp.tool,\n query: exp.query ? trunc(exp.query, Q_MAX) : null,\n confidence,\n avoidable,\n command: trunc(command, CMD_MAX),\n };\n await appendFile(ctx.paths.bashLog, JSON.stringify(entry) + \"\\n\", \"utf8\");\n } catch {\n // Best-effort — an unwritable disk must never affect the Bash call.\n }\n}\n\n/**\n * Observe a Bash tool call: if it's codebase exploration, record it (and whether\n * the graph could have answered) to bash_log.jsonl. NEVER returns a decision —\n * the caller always allows the command through. Opt out with SYN_NO_BASH_OBSERVE.\n */\nexport async function observeBash(\n input: Record<string, unknown>,\n ctx: ServerContext,\n): Promise<void> {\n if (!loadConfig().bashObserve) return;\n const command = typeof input.command === \"string\" ? input.command : \"\";\n const exp = classifyBashCommand(command);\n if (!exp) return;\n\n let confidence: Confidence | null = null;\n let avoidable = false;\n\n if (exp.kind === \"search\" && exp.query) {\n // Mirror the Moat's would-block test so \"avoidable\" predicts a real block:\n // the graph is confident AND a symbol the query names actually matched.\n if (!looksLikeNonSymbolQuery(exp.query)) {\n const r = await retrieve(ctx.graph, exp.query);\n confidence = r.confidence;\n avoidable = r.confidence !== \"low\" && r.symbolMatched;\n }\n } else if (exp.kind === \"read\" && exp.query) {\n // A cat/head of a file the graph knows → graph_read could have sliced it.\n avoidable = graphHasFile(ctx, exp.query);\n }\n\n await logObservation(ctx, exp, confidence, avoidable, command);\n}\n","// Shared query heuristics for the PreToolUse decision point. Used by both the\n// Moat gate (Grep/Glob blocking) and the Bash observer — kept in its own module\n// so neither has to import the other.\n\n// Heuristic: does this search pattern target markup / CSS / attributes / literals\n// rather than a code symbol? The graph only indexes symbols, so blocking these\n// and redirecting to graph_read just forces a fallback Read. Conservative — only\n// fires on syntax that never appears in a bare identifier search.\nexport function looksLikeNonSymbolQuery(pattern: string): boolean {\n // HTML / JSX tag: \"<div\", \"</\", \"<svg\"\n if (/<\\/?[a-zA-Z]/.test(pattern)) return true;\n // Hyphenated attribute assignment: \"data-tour=\", \"aria-label=\" ('-' is not a\n // valid identifier char, so this is markup, not a symbol).\n if (/[a-zA-Z][\\w-]*-[\\w-]*\\s*=/.test(pattern)) return true;\n // CSS rule / object brace: \".content{\", \"{ color\"\n if (/\\{/.test(pattern)) return true;\n // Escaped-dot class / member selector: \"\\.filter-bar\", \"\\.gs\"\n if (/\\\\\\.[a-zA-Z]/.test(pattern)) return true;\n // CSS property value or units: \": 100%\", \"12px\", \"1.5rem\", \"50%\"\n if (/:\\s*\\d/.test(pattern) || /\\d(?:px|rem|em|vh|vw)\\b/.test(pattern) || /\\d%/.test(pattern)) {\n return true;\n }\n // CSS custom property: \"var(--brand)\", \"--sidebar\" — a \"--\" prefix is never a\n // valid code identifier, so this is styling the graph doesn't index.\n if (/--[a-zA-Z]/.test(pattern)) return true;\n // Hex color literal: \"#fff\", \"#0a0a0a\".\n if (/#[0-9a-fA-F]{3,8}\\b/.test(pattern)) return true;\n // Kebab-case search (\"cw-code-chip\", \"data-tour\") — hyphens aren't valid in\n // JS/TS/Python identifiers, so it's a CSS class / HTML attribute / custom\n // element. Only treat it as non-symbol when EVERY alternation branch is kebab,\n // so a mixed query like \"fetchWith429Retry|Retry-After\" (real symbol + a\n // hyphenated header) still blocks. Strip regex char-classes first so a range\n // like \"[a-z]\" isn't mistaken for a kebab token.\n const branches = pattern\n .replace(/\\[[^\\]]*\\]/g, \"\")\n .split(\"|\")\n .map((b) => b.trim())\n .filter(Boolean);\n const isKebab = (b: string) => /^[a-z][a-z0-9]*(?:-[a-z0-9]+)+$/i.test(b);\n if (branches.length > 0 && branches.every(isKebab)) return true;\n return false;\n}\n","// POST /log — Stop hook posts per-turn token usage parsed from Claude's\n// transcript JSONL. Synthra appends each entry as one line to token_log.jsonl.\n\nimport { appendFile, mkdir } from \"node:fs/promises\";\nimport { dirname } from \"node:path\";\n\nimport type { ServerContext } from \"../context.js\";\n\nexport interface LogEntry {\n input_tokens: number;\n output_tokens: number;\n cache_creation_input_tokens?: number;\n cache_read_input_tokens?: number;\n model: string;\n description?: string;\n project: string;\n}\n\nexport interface LogResponse {\n ok: true;\n written_at: string;\n}\n\nexport async function handleLog(entry: LogEntry, ctx: ServerContext): Promise<LogResponse> {\n if (!entry || typeof entry.input_tokens !== \"number\" || typeof entry.output_tokens !== \"number\") {\n throw new Error(\"log: input_tokens and output_tokens (number) are required\");\n }\n\n const written_at = new Date().toISOString();\n const record = { ...entry, written_at };\n await mkdir(dirname(ctx.paths.tokenLog), { recursive: true });\n await appendFile(ctx.paths.tokenLog, JSON.stringify(record) + \"\\n\", \"utf8\");\n\n return { ok: true, written_at };\n}\n","// POST /pack { query, maxTokens? } → ContextPack JSON.\n// Runs retrieve → pack against the in-memory graph.\n\nimport { retrieve } from \"../../graph/retrieve.js\";\nimport { scoreFiles } from \"../../graph/rank.js\";\nimport { pack, type ContextPack } from \"../../packer/index.js\";\nimport type { ServerContext } from \"../context.js\";\n\nexport interface PackRequest {\n query: string;\n maxTokens?: number;\n includeTests?: boolean;\n}\n\nexport interface PackResponse extends ContextPack {\n query: string;\n confidence: \"high\" | \"medium\" | \"low\";\n retrievalReason: string;\n}\n\nexport async function handlePack(req: PackRequest, ctx: ServerContext): Promise<PackResponse> {\n if (!req?.query || typeof req.query !== \"string\") {\n throw new Error(\"pack: 'query' (string) is required\");\n }\n\n const recentlyEditedPaths = ctx.activity.recentFilePaths(15 * 60 * 1000);\n const usageScores = ctx.learn?.effectiveScores();\n const retrieval = await retrieve(ctx.graph, req.query, { recentlyEditedPaths, usageScores });\n\n // Surface per-file scoring rationale in the rendered pack.\n const allFiles = ctx.graph.nodes.filter((n) => n.kind === \"file\");\n const scored = scoreFiles({\n candidates: allFiles as Parameters<typeof scoreFiles>[0][\"candidates\"],\n query: req.query,\n graph: ctx.graph,\n recentlyEditedPaths,\n usageScores,\n });\n const reasons = new Map<string, string>();\n for (const s of scored) {\n if (s.reasons.length) reasons.set(s.file.path, s.reasons.join(\",\"));\n }\n\n const result = await pack(retrieval.files, {\n query: req.query,\n graph: ctx.graph,\n budgetTokens: req.maxTokens,\n includeTests: req.includeTests,\n reasons,\n });\n\n return {\n ...result,\n query: req.query,\n confidence: retrieval.confidence,\n retrievalReason: retrieval.reason,\n };\n}\n","// GET /prime — SessionStart and PreCompact hooks call this. Returns the priming\n// text Claude sees at session start.\n//\n// When the previous session left a snapshot (.synthra-graph/session.json), the\n// primer leads with a budget-bounded \"Since you were last here\" digest — recent\n// commits, files touched, open next-steps, recent decisions — so a fresh session\n// arrives oriented instead of re-paying tokens to rediscover recent work. With\n// no snapshot (first session, or none survived), it falls back to the legacy\n// graph-counts primer verbatim.\n\nimport { currentBranch } from \"../../memory/branches.js\";\nimport { readSession, type SessionState } from \"../../memory/session.js\";\nimport type { ServerContext } from \"../context.js\";\n\nexport interface PrimeResponse {\n primer: string;\n port: number;\n}\n\n// ~680 tokens. The digest rides the SessionStart primer channel, separate from\n// the graph pack's own ~4000-token budget — they don't compete.\nconst RESUME_PRIMER_MAX_CHARS = 2720;\n\nconst MAX_FILES = 15;\nconst MAX_COMMITS = 5;\nconst MAX_BULLETS = 3;\n\nfunction legacyPrimer(ctx: ServerContext): string {\n const g = ctx.graph;\n return (\n `Synthra context loaded for ${g.root}.\\n` +\n `${g.file_count} files indexed, ${g.symbol_count} symbols. ` +\n `Prefer the graph_* MCP tools over Grep/Glob for navigation.`\n );\n}\n\nfunction hasContent(snap: SessionState): boolean {\n return Boolean(\n snap.recentCommits.length ||\n snap.filesTouched.length ||\n snap.summary.tasks.length ||\n snap.summary.next.length ||\n snap.summary.decisions.length,\n );\n}\n\nfunction buildResumeDigest(snap: SessionState, branchNow: string): string {\n const plural = (n: number) => (n === 1 ? \"\" : \"s\");\n const head =\n `## Since you were last here — ${snap.branch} ` +\n `(${snap.recentCommits.length} commit${plural(snap.recentCommits.length)}, ` +\n `${snap.filesTouched.length} file${plural(snap.filesTouched.length)} touched)`;\n\n // Essential, high-signal block — never dropped under the budget.\n const essential: string[] = [head];\n if (snap.branch !== branchNow) {\n essential.push(\"\");\n essential.push(\n `_(snapshot was for branch '${snap.branch}'; you're now on '${branchNow}' — may be stale)_`,\n );\n }\n if (snap.summary.tasks[0]) {\n essential.push(\"\", \"### In progress\", `- ${snap.summary.tasks[0]}`);\n }\n if (snap.summary.next.length) {\n essential.push(\"\", \"### Open next steps\");\n for (const n of snap.summary.next.slice(0, MAX_BULLETS)) essential.push(`- ${n}`);\n }\n if (snap.summary.decisions.length) {\n essential.push(\"\", \"### Recent decisions\");\n for (const d of snap.summary.decisions.slice(0, MAX_BULLETS)) essential.push(`- ${d}`);\n }\n\n // Supporting context — appended only while budget remains, so commits/files\n // are what get dropped first if we're over the cap.\n const extra: string[] = [];\n if (snap.recentCommits.length) {\n extra.push(\"\", \"### Recent commits\");\n for (const c of snap.recentCommits.slice(0, MAX_COMMITS)) {\n const date = c.date ? ` (${c.date.slice(0, 10)})` : \"\";\n extra.push(`- \\`${c.hash}\\` ${c.message}${date}`);\n }\n }\n if (snap.filesTouched.length) {\n const shown = snap.filesTouched.slice(0, MAX_FILES);\n const more = snap.filesTouched.length - shown.length;\n extra.push(\"\", \"### Files touched\", shown.join(\", \") + (more > 0 ? `, +${more} more` : \"\"));\n }\n\n let out = essential.join(\"\\n\");\n for (const line of extra) {\n if ((out + \"\\n\" + line).length > RESUME_PRIMER_MAX_CHARS) break;\n out += \"\\n\" + line;\n }\n return (\n out.length > RESUME_PRIMER_MAX_CHARS ? out.slice(0, RESUME_PRIMER_MAX_CHARS) : out\n ).trimEnd();\n}\n\nexport async function handlePrime(ctx: ServerContext, port: number): Promise<PrimeResponse> {\n const legacy = legacyPrimer(ctx);\n\n const snap = await readSession(ctx.paths.sessionState);\n if (!snap || !hasContent(snap)) {\n return { primer: legacy, port };\n }\n\n const branchNow = await currentBranch(ctx.paths.projectRoot);\n const digest = buildResumeDigest(snap, branchNow);\n return { primer: `${digest}\\n\\n---\\n\\n${legacy}`, port };\n}\n"],"mappings":";AAIA,SAAS,aAAa;AACtB,SAAS,YAAY;AACrB,SAAS,aAAAA,kBAAiB;;;ACC1B,SAAS,YAAY,aAAa;AAClC,SAAS,eAAe;AAgBxB,IAAM,oBAAoB;AAEnB,IAAM,gBAAN,MAAoB;AAAA,EACjB,OAAwB,CAAC;AAAA,EAChB;AAAA,EACA;AAAA,EAEjB,YAAY,aAAqB,cAAc,mBAAmB;AAChE,SAAK,cAAc;AACnB,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,MAAM,IAAI,OAAqC;AAC7C,SAAK,KAAK,KAAK,KAAK;AACpB,WAAO,KAAK,KAAK,SAAS,KAAK,YAAa,MAAK,KAAK,MAAM;AAC5D,UAAM,KAAK,QAAQ,KAAK;AAAA,EAC1B;AAAA;AAAA,EAGA,UAAU,SAAmC;AAC3C,QAAI,CAAC,WAAW,CAAC,OAAO,SAAS,OAAO,EAAG,QAAO,KAAK,KAAK,MAAM;AAClE,UAAM,SAAS,IAAI,KAAK,OAAO,EAAE,YAAY;AAC7C,WAAO,KAAK,KAAK,OAAO,CAAC,MAAM,EAAE,MAAM,MAAM;AAAA,EAC/C;AAAA;AAAA,EAGA,gBAAgB,UAA4B;AAC1C,UAAM,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,EAAE,YAAY;AAC3D,UAAM,MAAM,oBAAI,IAAY;AAC5B,eAAW,KAAK,KAAK,MAAM;AACzB,UAAI,UAAU,MAAM,EAAE,SAAS,UAAU,EAAE,SAAS,aAAa,EAAE,MAAM,QAAQ;AAC/E,YAAI,IAAI,EAAE,IAAI;AAAA,MAChB;AAAA,IACF;AACA,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AAAA,EAEA,OAAe;AACb,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,MAAc,QAAQ,OAAqC;AACzD,QAAI;AACF,YAAM,MAAM,QAAQ,KAAK,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAC1D,YAAM,WAAW,KAAK,aAAa,KAAK,UAAU,KAAK,IAAI,MAAM,MAAM;AAAA,IACzE,QAAQ;AAAA,IAER;AAAA,EACF;AACF;;;ACpEA,OAAO,cAAkC;AACzC,SAAS,gBAAgB;AACzB,SAAS,MAAM,UAAU,WAAW;AACpC,OAAO,YAA6B;;;ACJpC,IAAM,iBAAwC;AAAA,EAC5C,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AACT;AAEA,IAAI,cAAsB,QAAQ,IAAI,iBAA2B;AAMjE,SAAS,UAAU,OAAuB;AACxC,SAAO,eAAe,KAAK,KAAK,eAAe,WAAW;AAC5D;AAEA,SAAS,KAAK,OAAc,QAAgB,MAAuB;AACjE,MAAI,CAAC,UAAU,KAAK,EAAG;AACvB,QAAM,SAAS,UAAU,WAAW,UAAU,SAAS,QAAQ,SAAS,QAAQ;AAChF,SAAO,MAAM,SAAS,GAAG,GAAG,KAAK,SAAS,MAAM,KAAK,IAAI,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE;AAAA,CAAI;AACrF;AAEO,IAAM,MAAM;AAAA,EACjB,OAAO,CAAC,MAAc,MAAiB,KAAK,SAAS,GAAG,GAAG,CAAC;AAAA,EAC5D,MAAM,CAAC,MAAc,MAAiB,KAAK,QAAQ,GAAG,GAAG,CAAC;AAAA,EAC1D,MAAM,CAAC,MAAc,MAAiB,KAAK,QAAQ,GAAG,GAAG,CAAC;AAAA,EAC1D,OAAO,CAAC,MAAc,MAAiB,KAAK,SAAS,GAAG,GAAG,CAAC;AAC9D;;;ADnBA,IAAM,gBAAgB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AASA,eAAe,eAAe,MAAiC;AAC7D,MAAI;AACF,UAAM,OAAO,MAAM,SAAS,MAAM,MAAM;AACxC,WAAO,KACJ,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAAE,WAAW,GAAG,CAAC;AAAA,EACrD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAe,aAAa,MAA+B;AACzD,QAAM,KAAK,OAAO;AAClB,KAAG,IAAI,cAAc,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AACxC,KAAG,IAAI,MAAM,eAAe,KAAK,MAAM,YAAY,CAAC,CAAC;AACrD,KAAG,IAAI,MAAM,eAAe,KAAK,MAAM,gBAAgB,CAAC,CAAC;AACzD,SAAO;AACT;AAEA,SAAS,WAAW,MAAc,KAAqB;AACrD,QAAM,MAAM,SAAS,MAAM,GAAG;AAC9B,SAAO,QAAQ,MAAM,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AACpD;AAEO,SAAS,kBAAkB,MAAc,SAAwC;AACtF,MAAI,UAA4B;AAChC,MAAI,KAAoB;AAExB,QAAMC,QAAO,OAAO,MAAyB,QAAgB;AAC3D,QAAI,CAAC,GAAI;AACT,UAAM,MAAM,WAAW,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO,IAAI,WAAW,IAAI,EAAG;AAClC,QAAI,GAAG,QAAQ,GAAG,EAAG;AACrB,QAAI;AACF,YAAM,QAAQ,EAAE,MAAM,MAAM,KAAK,KAAI,oBAAI,KAAK,GAAE,YAAY,EAAE,CAAC;AAAA,IACjE,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AACZ,WAAK,MAAM,aAAa,IAAI;AAC5B,gBAAU,SAAS,MAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAO7B,SAAS,cAAc,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC;AAAA,QAC/D,eAAe;AAAA,QACf,YAAY;AAAA,QACZ,kBAAkB,EAAE,oBAAoB,KAAK,cAAc,GAAG;AAAA,MAChE,CAAC;AAKD,cAAQ,GAAG,SAAS,CAACC,SAAQ;AAC3B,cAAM,IAAIA;AACV,YAAI,MAAM,mCAAmC,GAAG,QAAQ,EAAE,IAAI,GAAG,WAAW,OAAOA,IAAG,CAAC,EAAE;AAAA,MAC3F,CAAC;AAED,cAAQ,GAAG,OAAO,CAAC,SAASD,MAAK,UAAU,IAAI,CAAC;AAChD,cAAQ,GAAG,UAAU,CAAC,SAASA,MAAK,QAAQ,IAAI,CAAC;AACjD,cAAQ,GAAG,UAAU,CAAC,SAASA,MAAK,UAAU,IAAI,CAAC;AAAA,IACrD;AAAA,IAEA,MAAM,OAAO;AACX,UAAI,SAAS;AACX,cAAM,QAAQ,MAAM;AACpB,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACF;;;AE/GA,SAAS,gBAAgB;AACzB,SAAS,aAA6B;AACtC,SAAS,YAAAE,iBAAgB;AACzB,SAAS,QAAAC,aAAY;AACrB,SAAS,iBAAiB;AAI1B,IAAM,gBAAgB,UAAU,QAAQ;AAExC,IAAM,UAAU;AAShB,eAAe,eAAe,aAA6C;AACzE,MAAI;AACF,UAAM,OAAO,MAAMD,UAASC,MAAK,aAAa,QAAQ,MAAM,GAAG,MAAM;AACrE,UAAM,IAAI,KAAK,KAAK,EAAE,MAAM,4BAA4B;AACxD,WAAO,IAAI,CAAC,KAAK;AAAA,EACnB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,oBAAoB,aAA6C;AAC9E,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM,cAAc,OAAO,CAAC,UAAU,aAAa,GAAG;AAAA,MACvE,KAAK;AAAA,IACP,CAAC;AACD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,iBAAiB,MAAc,SAAsC;AACnF,MAAI,cAAgC;AACpC,MAAI,YAAmC;AACvC,MAAI,aAA4B;AAChC,MAAI,aAA4B;AAEhC,QAAM,WAAW,OAAO,UAAoB;AAC1C,QAAI;AACF,YAAM,QAAQ,KAAK;AAAA,IACrB,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM,YAAY,YAAY;AAC5B,UAAM,SAAS,MAAM,eAAe,IAAI;AACxC,QAAI,UAAU,WAAW,YAAY;AACnC,YAAM,OAAO;AACb,mBAAa;AACb,UAAI,SAAS,MAAM;AACjB,cAAM,SAAS;AAAA,UACb,MAAM;AAAA,UACN,SAAS,EAAE,MAAM,MAAM,IAAI,OAAO;AAAA,UAClC,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,QAC7B,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAa,YAAY;AAC7B,UAAM,SAAS,MAAM,oBAAoB,IAAI;AAC7C,QAAI,WAAW,KAAM;AACrB,QAAI,eAAe,QAAQ,WAAW,YAAY;AAChD,YAAM,YAAY,iBAAiB,UAAU;AAC7C,YAAM,WAAW,iBAAiB,MAAM;AACxC,YAAM,QAAQ,SAAS,OAAO,CAAC,MAAM,CAAC,UAAU,SAAS,CAAC,CAAC;AAC3D,YAAM,UAAU,UAAU,OAAO,CAAC,MAAM,CAAC,SAAS,SAAS,CAAC,CAAC;AAC7D,YAAM,SAAS;AAAA,QACb,MAAM;AAAA,QACN,SAAS;AAAA,UACP,eAAe,SAAS;AAAA,UACxB,aAAa;AAAA,UACb,aAAa;AAAA,QACf;AAAA,QACA,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC7B,CAAC;AAAA,IACH;AACA,iBAAa;AAAA,EACf;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAGZ,mBAAa,MAAM,eAAe,IAAI;AACtC,mBAAa,MAAM,oBAAoB,IAAI;AAE3C,UAAI;AACF,sBAAc,MAAMA,MAAK,MAAM,QAAQ,MAAM,GAAG,MAAM;AACpD,eAAK,UAAU;AAAA,QACjB,CAAC;AAID,oBAAY,GAAG,SAAS,MAAM;AAAA,QAE9B,CAAC;AAAA,MACH,QAAQ;AAAA,MAER;AAEA,kBAAY,YAAY,MAAM;AAC5B,aAAK,WAAW;AAAA,MAClB,GAAG,OAAO;AACV,gBAAU,QAAQ;AAAA,IACpB;AAAA,IAEA,MAAM,OAAO;AACX,UAAI,aAAa;AACf,oBAAY,MAAM;AAClB,sBAAc;AAAA,MAChB;AACA,UAAI,WAAW;AACb,sBAAc,SAAS;AACvB,oBAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,WAA6B;AACrD,SAAO,UACJ,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAC5B,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC/B;;;ACzIA,SAAS,eAAe;;;ACIxB,SAAS,WAAAC,UAAS,QAAAC,OAAM,aAAa;;;AC2C9B,IAAM,iBAAiB;;;AC9C9B,SAAS,kBAAkB;AAEpB,SAAS,SAAS,SAAyB;AAChD,SAAO,WAAW,MAAM,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,CAAC;AACpE;;;ACHA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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,IAAM,cAAc,oBAAI,IAAI;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AAGD,SAAS,MAAM,OAAuB;AACpC,MAAI,UAAU,IAAI,KAAK,EAAG,QAAO;AACjC,MAAI,YAAY,IAAI,KAAK,EAAG,QAAO;AACnC,MAAI,MAAM,UAAU,EAAG,QAAO;AAC9B,SAAO;AACT;AAEA,SAAS,gBAAgB,IAAsB;AAE7C,QAAM,WAAW,GAAG,MAAM,UAAU,EAAE,OAAO,OAAO;AACpD,QAAM,MAAgB,CAAC;AACvB,aAAW,QAAQ,UAAU;AAE3B,UAAM,aAAa,KAAK,MAAM,kDAAkD;AAChF,QAAI,WAAY,KAAI,KAAK,GAAG,UAAU;AAAA,QACjC,KAAI,KAAK,IAAI;AAAA,EACpB;AACA,SAAO,IAAI,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,EAAE,OAAO,CAAC,MAAM,QAAQ,KAAK,CAAC,CAAC;AACtE;AAEO,SAAS,gBAAgB,SAAiB,MAAwB;AAEvE,QAAM,SAAS,QAAQ,MAAM,8BAA8B,KAAK,CAAC;AACjE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,OAAO,QAAQ;AACxB,eAAW,QAAQ,gBAAgB,GAAG,GAAG;AACvC,YAAM,IAAI,MAAM,IAAI;AACpB,UAAI,MAAM,EAAG;AACb,aAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAC9C;AAAA,EACF;AACA,SAAO,MAAM,KAAK,OAAO,QAAQ,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AACnB;;;AH3MA,IAAM,eAAe;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,cAAc,CAAC,YAAY,aAAa,YAAY,aAAa,aAAa;AAEpF,SAAS,OAAO,SAAyB;AACvC,SAAO,QAAQ,OAAO;AACxB;AAEA,SAAS,SAAS,SAAiB,KAA2B;AAC5D,SAAO,UAAU,OAAO,KAAK,IAAI,IAAI,IAAI,IAAI,SAAS;AACxD;AAEA,SAAS,WAAW,QAA8B;AAChD,QAAM,UAAU,OAAO;AACvB,SAAO;AAAA,IACL,IAAI,OAAO,OAAO,KAAK,OAAO;AAAA,IAC9B,MAAM;AAAA,IACN,MAAM,OAAO,KAAK;AAAA,IAClB,KAAK,OAAO,KAAK;AAAA,IACjB,MAAM,OAAO,KAAK;AAAA,IAClB,UAAU,gBAAgB,SAAS,OAAO,KAAK,GAAG;AAAA,IAClD;AAAA,IACA,SAAS,eAAe,OAAO;AAAA,IAC/B,WAAW,SAAS,OAAO;AAAA,EAC7B;AACF;AAEA,SAAS,eAAe,SAAyB;AAE/C,QAAM,UAAU,QAAQ,QAAQ,QAAQ,EAAE;AAC1C,QAAM,aAAa,QAAQ,MAAM,iCAAiC;AAClE,MAAI,aAAa,CAAC,EAAG,QAAO,WAAW,CAAC,EAAE,MAAM,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG;AACtF,QAAM,aAAa,QAAQ,MAAM,wBAAwB;AACzD,MAAI,aAAa,CAAC,GAAG;AACnB,WAAO,WAAW,CAAC,EAChB,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,QAAQ,aAAa,EAAE,CAAC,EACrC,KAAK,GAAG,EACR,KAAK,EACL,MAAM,GAAG,GAAG;AAAA,EACjB;AACA,QAAM,YAAY,QAAQ,MAAM,2BAA2B;AAC3D,MAAI,YAAY,CAAC,EAAG,QAAO,UAAU,CAAC,EAAE,MAAM,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG;AACpF,SAAO;AACT;AAEA,SAAS,aAAa,QAAoB,KAA+B;AACvE,SAAO;AAAA,IACL,IAAI,SAAS,OAAO,KAAK,SAAS,GAAG;AAAA,IACrC,MAAM;AAAA,IACN,aAAa,IAAI;AAAA,IACjB,MAAM,IAAI;AAAA,IACV,MAAM,OAAO,KAAK;AAAA,IAClB,YAAY,IAAI;AAAA,IAChB,UAAU,IAAI;AAAA,IACd,WAAW,IAAI;AAAA,EACjB;AACF;AASA,IAAM,iBAAiB;AAEvB,SAAS,cACP,aACA,MACA,aACe;AACf,MAAI,CAAC,KAAK,WAAW,GAAG,EAAG,QAAO;AAClC,QAAM,UAAU,MAAM,QAAQ,QAAQ,WAAW,CAAC;AAClD,QAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS,QAAQ,IAAI,CAAC,CAAC;AAE/D,QAAM,aAAa,CAAC,IAAI;AACxB,QAAM,YAAY,KAAK,QAAQ,gBAAgB,EAAE;AACjD,MAAI,cAAc,KAAM,YAAW,KAAK,SAAS;AAEjD,aAAW,KAAK,YAAY;AAC1B,QAAI,YAAY,IAAI,CAAC,EAAG,QAAO;AAC/B,eAAW,OAAO,cAAc;AAC9B,UAAI,YAAY,IAAI,IAAI,GAAG,EAAG,QAAO,IAAI;AAAA,IAC3C;AACA,eAAW,OAAO,aAAa;AAC7B,YAAM,YAAY,MAAM,KAAK,GAAG,GAAG;AACnC,UAAI,YAAY,IAAI,SAAS,EAAG,QAAO;AAAA,IACzC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,GAAmB;AAClC,SAAO,EAAE,MAAM,OAAO,EAAE,KAAK,GAAG;AAClC;AAEA,IAAM,UAAU;AAEhB,SAAS,WAAW,SAAiB,aAA+C;AAClF,QAAM,WAAW,QAAQ,MAAM,GAAG,EAAE,IAAI,KAAK;AAC7C,QAAM,QAAQ,QAAQ,KAAK,QAAQ;AACnC,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,MAAM,QAAQ,SAAS,GAAG,IAAI,QAAQ,MAAM,GAAG,QAAQ,YAAY,GAAG,IAAI,CAAC,IAAI;AACrF,QAAM,OAAO,MAAM,QAAQ,QAAQ;AACnC,QAAM,MAAM,MAAM,QAAQ,OAAO;AACjC,MAAI,CAAC,QAAQ,CAAC,IAAK,QAAO;AAC1B,QAAM,YAAY,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG;AACtC,MAAI,YAAY,IAAI,SAAS,EAAG,QAAO;AAEvC,aAAW,KAAK,cAAc;AAC5B,UAAM,MAAM,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC;AAC7B,QAAI,YAAY,IAAI,GAAG,EAAG,QAAO;AAAA,EACnC;AACA,SAAO;AACT;AAEA,eAAsB,WAAW,MAAc,QAA4C;AACzF,QAAM,cAAc,oBAAI,IAAkB;AAC1C,aAAW,KAAK,OAAQ,aAAY,IAAI,EAAE,KAAK,SAAS,IAAI;AAE5D,QAAM,QAAmC,CAAC;AAC1C,QAAM,QAAgB,CAAC;AAIvB,QAAM,gBAAgB,oBAAI,IAA0B;AACpD,QAAM,cAAc,oBAAI,IAAwB;AAEhD,aAAW,KAAK,QAAQ;AACtB,UAAM,WAAW,WAAW,CAAC;AAC7B,UAAM,KAAK,QAAQ;AAEnB,UAAM,eAA6B,CAAC;AACpC,eAAW,OAAO,EAAE,SAAS;AAC3B,YAAM,UAAU,aAAa,GAAG,GAAG;AACnC,YAAM,KAAK,OAAO;AAClB,mBAAa,KAAK,OAAO;AACzB,YAAM,KAAK,EAAE,MAAM,SAAS,IAAI,IAAI,QAAQ,IAAI,MAAM,UAAU,CAAC;AAAA,IACnE;AACA,kBAAc,IAAI,EAAE,KAAK,SAAS,YAAY;AAC9C,gBAAY,IAAI,EAAE,KAAK,SAAS,EAAE,KAAK;AAEvC,UAAM,cAAc,oBAAI,IAAY;AACpC,eAAW,QAAQ,EAAE,SAAS;AAC5B,YAAM,SAAS,cAAc,EAAE,KAAK,SAAS,MAAM,WAAW;AAC9D,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,GAAG,SAAS,EAAE,KAAK,OAAO,MAAM,CAAC;AAC7C,UAAI,YAAY,IAAI,GAAG,EAAG;AAC1B,kBAAY,IAAI,GAAG;AACnB,YAAM,KAAK,EAAE,MAAM,SAAS,IAAI,IAAI,OAAO,MAAM,GAAG,MAAM,UAAU,CAAC;AAAA,IACvE;AAEA,UAAM,iBAAiB,WAAW,EAAE,KAAK,SAAS,WAAW;AAC7D,QAAI,kBAAkB,mBAAmB,EAAE,KAAK,SAAS;AACvD,YAAM,KAAK,EAAE,MAAM,SAAS,IAAI,IAAI,OAAO,cAAc,GAAG,MAAM,QAAQ,CAAC;AAAA,IAC7E;AAAA,EACF;AAEA,QAAM,KAAK,GAAG,eAAe,eAAe,WAAW,CAAC;AAExD,QAAM,cAAc,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE;AAC7D,QAAM,YAAY,MAAM,SAAS;AAEjC,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM;AAAA,IAClB,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,IACZ,cAAc;AAAA,IACd;AAAA,IACA;AAAA,IACA,eAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrC,gBAAgB;AAAA,EAClB;AACF;AAEO,SAAS,iBAAiB,OAAiC;AAIhE,QAAM,MAAmB,uBAAO,OAAO,IAAI;AAC3C,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI,KAAK,SAAS,SAAU;AAC5B,UAAM,OAAO,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC;AAClD,SAAK,KAAK,EAAE,MAAM,KAAK,MAAM,MAAM,KAAK,YAAY,MAAM,KAAK,YAAY,CAAC;AAAA,EAC9E;AACA,SAAO;AACT;AAKO,SAAS,kBAAkB,MAAoB,MAAiC;AACrF,MAAI,OAA0B;AAC9B,aAAW,KAAK,MAAM;AACpB,QAAI,OAAO,EAAE,cAAc,OAAO,EAAE,SAAU;AAC9C,QAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,aAAa,KAAK,WAAW,KAAK,WAAY,QAAO;AAAA,EACnF;AACA,SAAO;AACT;AAWO,SAAS,eACd,eACA,aACQ;AAER,QAAM,SAAS,oBAAI,IAA0B;AAC7C,aAAW,QAAQ,cAAc,OAAO,GAAG;AACzC,eAAW,KAAK,MAAM;AACpB,YAAM,OAAO,OAAO,IAAI,EAAE,IAAI;AAC9B,UAAI,KAAM,MAAK,KAAK,CAAC;AAAA,UAChB,QAAO,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,QAAgB,CAAC;AACvB,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,CAAC,SAAS,KAAK,KAAK,aAAa;AAC1C,UAAM,WAAW,cAAc,IAAI,OAAO,KAAK,CAAC;AAChD,eAAW,QAAQ,OAAO;AACxB,YAAM,SAAS,kBAAkB,UAAU,KAAK,IAAI;AACpD,UAAI,CAAC,OAAQ;AAEb,UAAI,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,MAAM;AACxD,UAAI,CAAC,QAAQ;AACX,cAAM,QAAQ,OAAO,IAAI,KAAK,MAAM,KAAK,CAAC;AAC1C,YAAI,MAAM,WAAW,EAAG;AACxB,iBAAS,MAAM,CAAC;AAAA,MAClB;AACA,UAAI,CAAC,UAAU,OAAO,OAAO,OAAO,GAAI;AAExC,YAAM,MAAM,GAAG,OAAO,EAAE,KAAK,OAAO,EAAE;AACtC,UAAI,KAAK,IAAI,GAAG,EAAG;AACnB,WAAK,IAAI,GAAG;AACZ,YAAM,KAAK,EAAE,MAAM,OAAO,IAAI,IAAI,OAAO,IAAI,MAAM,QAAQ,CAAC;AAAA,IAC9D;AAAA,EACF;AACA,SAAO;AACT;;;AIzQA,SAAS,SAAAC,QAAO,YAAAC,WAAU,iBAAiB;AAC3C,SAAS,WAAAC,gBAAe;;;ACTxB,SAAS,YAAAC,iBAAgB;AACzB,SAAS,qBAAqB;AAC9B,SAAS,UAAU,cAAc;;;ACIjC,SAAS,aAAwB;AAiC1B,SAAS,UAAU,MAAc,MAAM,KAAa;AACzD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAEA,SAAS,YAAY,GAAmB;AAGtC,SAAO,EAAE,QAAQ,sBAAsB,EAAE,EAAE,KAAK;AAClD;AAEA,eAAsB,iBACpB,QACA,GACA,QACqB;AACrB,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,QAAM,QAAoB,CAAC;AAE3B,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,OAAO,OAAO;AAC9D,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AAE7D,UAAM,QAAQ,IAAI,MAAM,UAAU,OAAO,KAAK;AAC9C,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,UAAI,UAA8B;AAClC,iBAAW,KAAK,OAAO,OAAO;AAC5B,YAAI,OAAO,IAAI,EAAE,WAAW,KAAK,OAAO,IAAI,EAAE,WAAW,GAAG;AAC1D,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAEA,UAAI,SAAS;AACX,cAAM,WAAW,OAAO,IAAI,QAAQ,WAAW;AAC/C,cAAM,WAAW,OAAO,IAAI,QAAQ,WAAW;AAC/C,gBAAQ,KAAK;AAAA,UACX,MAAM,SAAS;AAAA,UACf,MAAM,QAAQ;AAAA,UACd,WAAW,SAAS,cAAc,MAAM;AAAA,UACxC,SAAS,SAAS,YAAY,MAAM;AAAA,UACpC,WAAW,UAAU,SAAS,IAAI;AAAA,QACpC,CAAC;AACD;AAAA,MACF;AAEA,UAAI,OAAO,eAAe,OAAO,mBAAmB;AAClD,cAAM,WAAW,OAAO,IAAI,OAAO,WAAW;AAC9C,cAAM,aAAa,OAAO,IAAI,OAAO,iBAAiB;AACtD,YAAI,YAAY,YAAY;AAC1B,gBAAM,KAAK,EAAE,QAAQ,WAAW,MAAM,MAAM,SAAS,cAAc,MAAM,EAAE,CAAC;AAC5E;AAAA,QACF;AAAA,MACF;AAEA,UAAI,OAAO,eAAe;AACxB,cAAM,MAAM,OAAO,IAAI,OAAO,aAAa;AAC3C,YAAI,IAAK,SAAQ,KAAK,YAAY,IAAI,IAAI,CAAC;AAAA,MAC7C;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,IAAI,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AAClC,UAAI,KAAK,IAAI,CAAC,EAAG,QAAO;AACxB,WAAK,IAAI,CAAC;AACV,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAAA,EACnE,QAAQ;AAAA,EAGR;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AACpD;;;ACvHA,IAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAUd,eAAsB,OAAO,GAAe,QAAqC;AAC/E,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAO;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,MAChE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC5BA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcd,eAAsB,SAAS,GAAe,QAAqC;AACjF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,QAAQ;AAAA,MAC3E;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AClCA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYd,eAAsB,YAAY,GAAe,QAAqC;AACpF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,YAAY;AAAA,QAC7E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,QAAQ;AAAA,MAC3E;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC1BA,SAAS,SAAAC,cAAwB;AAKjC,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAuBd,IAAM,QAAqB;AAAA,EACzB,EAAE,SAAS,SAAS,SAAS,cAAc,MAAM,QAAQ;AAAA,EACzD,EAAE,SAAS,SAAS,SAAS,cAAc,MAAM,QAAQ;AAAA,EACzD,EAAE,SAAS,OAAO,SAAS,YAAY,MAAM,QAAQ;AAAA,EACrD,EAAE,SAAS,QAAQ,SAAS,aAAa,MAAM,OAAO;AAAA,EACtD,EAAE,SAAS,WAAW,SAAS,gBAAgB,MAAM,OAAO;AAAA,EAC5D,EAAE,SAAS,YAAY,SAAS,iBAAiB,MAAM,WAAW;AAAA,EAClE,EAAE,SAAS,UAAU,SAAS,eAAe,MAAM,SAAS;AAAA,EAC5D,EAAE,SAAS,UAAU,SAAS,eAAe,MAAM,SAAS;AAAA,EAC5D,EAAE,SAAS,UAAU,SAAS,eAAe,MAAM,SAAS;AAAA,EAC5D,EAAE,SAAS,QAAQ,SAAS,aAAa,MAAM,SAAS;AAC1D;AAEA,SAASC,WAAU,MAAc,MAAM,KAAa;AAClD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAKA,SAAS,oBAAoB,KAA4B;AACvD,QAAM,WAAW,IAAI,QAAQ,gBAAgB,EAAE;AAC/C,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI,SAAS,WAAW,UAAU,EAAG,QAAO;AAC5C,MAAI,SAAS,WAAW,OAAO,EAAG,QAAO;AACzC,MAAI,SAAS,WAAW,GAAG,KAAK,SAAS,WAAW,GAAG,EAAG,QAAO;AACjE,SAAO,KAAK,QAAQ;AACtB;AAEA,eAAsB,UAAU,GAAe,QAAqC;AAClF,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AAEzB,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,MAAM;AACtD,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,OAAO,CAAC,EAAE;AAEjE,UAAM,QAAQ,IAAIC,OAAM,UAAUF,MAAK;AACvC,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,UAAI,UAA4B;AAChC,iBAAW,KAAK,OAAO;AACrB,YAAI,OAAO,IAAI,EAAE,OAAO,KAAK,OAAO,IAAI,EAAE,OAAO,GAAG;AAClD,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAEA,UAAI,SAAS;AACX,cAAM,WAAW,OAAO,IAAI,QAAQ,OAAO;AAC3C,cAAM,WAAW,OAAO,IAAI,QAAQ,OAAO;AAC3C,gBAAQ,KAAK;AAAA,UACX,MAAM,SAAS;AAAA,UACf,MAAM,QAAQ;AAAA,UACd,WAAW,SAAS,cAAc,MAAM;AAAA,UACxC,SAAS,SAAS,YAAY,MAAM;AAAA,UACpC,WAAWC,WAAU,SAAS,IAAI;AAAA,QACpC,CAAC;AACD;AAAA,MACF;AAEA,YAAM,aAAa,OAAO,IAAI,QAAQ;AACtC,UAAI,YAAY;AACd,cAAM,OAAO,oBAAoB,WAAW,IAAI;AAChD,YAAI,KAAM,SAAQ,KAAK,IAAI;AAAA,MAC7B;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,IAAI,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AAClC,UAAI,KAAK,IAAI,CAAC,EAAG,QAAO;AACxB,WAAK,IAAI,CAAC;AACV,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAGR;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,OAAO,CAAC,EAAE;AACxD;;;AC1HA,IAAME,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASd,eAAsB,QAAQ,GAAe,QAAqC;AAChF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,MAChE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACtBA,IAAM,WAAW;AACjB,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,cAAc;AAEpB,IAAM,YAAY;AAElB,SAAS,OAAO,QAAgB,OAAuB;AACrD,SAAO,OAAO,MAAM,GAAG,KAAK,EAAE,MAAM,OAAO,EAAE;AAC/C;AAIA,SAAS,aAAa,QAAgB,WAAmB,OAAe,WAA2B;AACjG,QAAM,YAAY;AAClB,QAAM,IAAI,MAAM,KAAK,MAAM;AAC3B,SAAO,IAAI,OAAO,QAAQ,EAAE,KAAK,IAAI;AACvC;AAEO,SAAS,UAAU,GAAe,QAA4B;AACnE,QAAM,UAA0B,CAAC;AACjC,QAAM,UAAoB,CAAC;AAE3B,aAAW,KAAK,OAAO,SAAS,QAAQ,GAAG;AACzC,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,EAAE,CAAC,KAAK,IAAI,KAAK;AAC/B,UAAM,QAAQ,EAAE,SAAS;AACzB,UAAM,YAAY,OAAO,QAAQ,KAAK;AACtC,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA,SAAS,aAAa,QAAQ,QAAQ,EAAE,CAAC,EAAE,QAAQ,aAAa,SAAS;AAAA,MACzE,WAAW,SAAS,IAAI,IAAI,IAAI;AAAA,IAClC,CAAC;AAAA,EACH;AAEA,aAAW,KAAK,OAAO,SAAS,QAAQ,GAAG;AACzC,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,EAAE,SAAS;AACzB,UAAM,YAAY,OAAO,QAAQ,KAAK;AACtC,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA,SAAS,aAAa,QAAQ,QAAQ,EAAE,CAAC,EAAE,QAAQ,aAAa,SAAS;AAAA,MACzE,WAAW,SAAS,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,aAAW,KAAK,OAAO,SAAS,SAAS,GAAG;AAC1C,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,KAAM,SAAQ,KAAK,IAAI;AAAA,EAC7B;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AACtF;;;AC9DA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASd,eAAsB,UAAU,GAAe,QAAqC;AAClF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,YAAY;AAAA,QAC7E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,MAChE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC3BA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQd,eAAsB,YAAY,GAAe,QAAqC;AACpF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,MACrE;AAAA,MACA,eAAe;AAAA,MACf,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACzBA,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWd,eAAsB,SAAS,GAAe,QAAqC;AACjF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,aAAa,aAAa,kBAAkB,MAAM,YAAY;AAAA,QAC7E,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,MACtE;AAAA,MACA,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AChCA,SAAS,SAAAC,cAAwB;AAIjC,IAAMC,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAUd,SAASC,WAAU,MAAc,MAAM,KAAa;AAClD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAEA,eAAsB,YAAY,GAAe,QAAqC;AACpF,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,QAAM,QAAoB,CAAC;AAE3B,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,QAAQ;AACxD,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AAE7D,UAAM,QAAQ,IAAIC,OAAM,UAAUF,MAAK;AACvC,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,YAAM,WAAW,OAAO,IAAI,UAAU;AACtC,YAAM,WAAW,OAAO,IAAI,eAAe;AAC3C,UAAI,YAAY,UAAU;AACxB,cAAM,aAAa,SAAS,QAAQ,QAAQ;AAC5C,cAAM,WAAW,eAAe;AAChC,gBAAQ,KAAK;AAAA,UACX,MAAM,SAAS;AAAA,UACf,MAAM,WAAW,WAAW;AAAA,UAC5B,WAAW,SAAS,cAAc,MAAM;AAAA,UACxC,SAAS,SAAS,YAAY,MAAM;AAAA,UACpC,WAAWC,WAAU,SAAS,IAAI;AAAA,QACpC,CAAC;AACD;AAAA,MACF;AAEA,YAAM,YAAY,OAAO,IAAI,OAAO;AACpC,YAAM,YAAY,OAAO,IAAI,YAAY;AACzC,UAAI,aAAa,WAAW;AAC1B,gBAAQ,KAAK;AAAA,UACX,MAAM,UAAU;AAAA,UAChB,MAAM;AAAA,UACN,WAAW,UAAU,cAAc,MAAM;AAAA,UACzC,SAAS,UAAU,YAAY,MAAM;AAAA,UACrC,WAAWA,WAAU,UAAU,IAAI;AAAA,QACrC,CAAC;AACD;AAAA,MACF;AAEA,YAAM,aAAa,OAAO,IAAI,eAAe,KAAK,OAAO,IAAI,aAAa;AAC1E,UAAI,YAAY;AACd,gBAAQ,KAAK,WAAW,IAAI;AAC5B;AAAA,MACF;AAEA,YAAM,WAAW,OAAO,IAAI,WAAW;AACvC,YAAM,WAAW,OAAO,IAAI,MAAM;AAClC,UAAI,YAAY,UAAU;AACxB,cAAM,KAAK,EAAE,QAAQ,SAAS,MAAM,MAAM,SAAS,cAAc,MAAM,EAAE,CAAC;AAAA,MAC5E;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AACpC,UAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,WAAK,IAAI,GAAG;AACZ,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAER;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AACpD;;;ACrFA,IAAME,UAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQd,eAAsB,UAAU,GAAe,QAAqC;AAClF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,SAAS;AAAA,QACpE,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,QAAQ;AAAA,QACjE,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,MACrE;AAAA,MACA,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACzBA,IAAMC,UAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWd,eAAsB,UAAU,GAAe,QAAqC;AAClF,SAAO;AAAA,IACL;AAAA,MACE,SAAS;AAAA,MACT,OAAOA;AAAA,MACP,OAAO;AAAA,QACL,EAAE,aAAa,YAAY,aAAa,iBAAiB,MAAM,WAAW;AAAA,QAC1E,EAAE,aAAa,UAAU,aAAa,eAAe,MAAM,QAAQ;AAAA,QACnE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,OAAO;AAAA,QAC9D,EAAE,aAAa,SAAS,aAAa,cAAc,MAAM,YAAY;AAAA,QACrE,EAAE,aAAa,QAAQ,aAAa,aAAa,MAAM,QAAQ;AAAA,MACjE;AAAA,MACA,aAAa;AAAA,MACb,mBAAmB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACjCA,SAAS,SAAAC,cAAwB;AAajC,IAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkBjB,IAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYjB,SAAS,WAAW,KAA0B;AAC5C,MAAI,QAAQ,UAAU,QAAQ,OAAQ,QAAO;AAC7C,MAAI,QAAQ,SAAS,QAAQ,UAAU,QAAQ,OAAQ,QAAO;AAC9D,SAAO;AACT;AAEA,SAAS,SAAS,SAA8B;AAC9C,SAAO,YAAY,eAAe,WAAW;AAC/C;AAEA,SAAS,QAAQ,GAAmB;AAClC,SAAO,EAAE,QAAQ,kBAAkB,EAAE;AACvC;AAEA,SAASC,WAAU,MAAc,MAAM,KAAa;AAClD,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC,EAAE,CAAC,KAAK;AAC1C,SAAO,KAAK,SAAS,MAAM,KAAK,MAAM,GAAG,GAAG,IAAI,WAAM;AACxD;AAQA,SAAS,kBAAkB,UAA+C;AACxE,QAAM,WAAW,CAAC,GAAW,OAAqC;AAChE,UAAM,OAAO,SAAS,IAAI,CAAC;AAC3B,UAAM,OAAO,SAAS,IAAI,GAAG,CAAC,OAAO;AACrC,WAAO,QAAQ,OAAO,EAAE,MAAM,MAAM,MAAM,GAAG,IAAI;AAAA,EACnD;AAEA,SACE,SAAS,YAAY,UAAU,KAC/B,SAAS,SAAS,OAAO,KACzB,SAAS,aAAa,WAAW,KACjC,SAAS,QAAQ,MAAM,KACvB,SAAS,QAAQ,MAAM,KACvB,SAAS,UAAU,QAAQ,KAC3B,SAAS,YAAY,UAAU,KAC/B,SAAS,aAAa,UAAU;AAEpC;AAEA,eAAsB,gBAAgB,GAAe,QAAqC;AACxF,QAAM,UAAU,WAAW,EAAE,GAAG;AAChC,MAAI,UAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,QAAM,QAAoB,CAAC;AAE3B,MAAI;AACF,UAAM,EAAE,QAAQ,SAAS,IAAI,MAAM,aAAa,OAAO;AACvD,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AAE7D,UAAM,QAAQ,IAAIC,OAAM,UAAU,SAAS,OAAO,CAAC;AACnD,UAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ;AAE3C,eAAW,SAAS,SAAS;AAC3B,YAAM,SAAS,oBAAI,IAAkB;AACrC,iBAAW,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,YAAM,QAAQ,kBAAkB,MAAM;AACtC,UAAI,OAAO;AACT,gBAAQ,KAAK;AAAA,UACX,MAAM,MAAM,KAAK;AAAA,UACjB,MAAM,MAAM;AAAA,UACZ,WAAW,MAAM,KAAK,cAAc,MAAM;AAAA,UAC1C,SAAS,MAAM,KAAK,YAAY,MAAM;AAAA,UACtC,WAAWD,WAAU,MAAM,KAAK,IAAI;AAAA,QACtC,CAAC;AACD;AAAA,MACF;AACA,YAAM,aAAa,OAAO,IAAI,QAAQ;AACtC,UAAI,YAAY;AACd,gBAAQ,KAAK,QAAQ,WAAW,IAAI,CAAC;AACrC;AAAA,MACF;AAGA,YAAM,YAAY,OAAO,IAAI,aAAa;AAC1C,YAAM,gBAAgB,OAAO,IAAI,gBAAgB;AACjD,UAAI,aAAa,iBAAiB,UAAU,SAAS,WAAW;AAC9D,gBAAQ,KAAK,QAAQ,cAAc,IAAI,CAAC;AACxC;AAAA,MACF;AAGA,YAAM,WAAW,OAAO,IAAI,WAAW;AACvC,YAAM,WAAW,OAAO,IAAI,MAAM;AAClC,UAAI,YAAY,UAAU;AACxB,cAAM,KAAK,EAAE,QAAQ,SAAS,MAAM,MAAM,SAAS,cAAc,MAAM,EAAE,CAAC;AAAA,MAC5E;AAAA,IACF;AAEA,UAAM,OAAO,oBAAI,IAAY;AAC7B,cAAU,QAAQ,OAAO,CAAC,MAAM;AAC9B,YAAM,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS;AACpC,UAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,WAAK,IAAI,GAAG;AACZ,aAAO;AAAA,IACT,CAAC;AACD,cAAU,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAER;AAEA,SAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,SAAS,MAAM;AACpD;;;ACnJA,IAAM,YAAY;AAQlB,SAAS,eAAe,QAA+B;AACrD,QAAM,MAAqB,CAAC;AAC5B,aAAW,SAAS,OAAO,SAAS,SAAS,GAAG;AAC9C,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,UAAM,UAAU,KAAK,MAAM,GAAG,KAAK,QAAQ,GAAG,IAAI,CAAC;AACnD,UAAM,WAAW,MAAM,SAAS;AAChC,UAAM,eAAe,WAAW,QAAQ;AACxC,UAAM,YAAY,OAAO,MAAM,GAAG,YAAY,EAAE,MAAM,OAAO,EAAE;AAC/D,UAAM,QAAQ,8CAA8C,KAAK,OAAO;AACxE,QAAI,KAAK,EAAE,QAAQ,OAAO,WAAW,MAAM,CAAC;AAAA,EAC9C;AACA,SAAO;AACT;AAEA,eAAsB,YAAY,GAAe,QAAqC;AACpF,QAAM,SAAS,eAAe,MAAM;AACpC,QAAM,MAAkB,EAAE,MAAM,GAAG,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAE/E,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAsB,EAAE,GAAG,GAAG,KAAK,MAAM,QAAQ,QAAQ,MAAM;AACrE,UAAM,SAAS,MAAM,gBAAgB,SAAS,MAAM,MAAM;AAC1D,UAAM,SAAS,MAAM,YAAY;AACjC,eAAW,OAAO,OAAO,SAAS;AAChC,UAAI,QAAQ,KAAK;AAAA,QACf,GAAG;AAAA,QACH,WAAW,IAAI,YAAY;AAAA,QAC3B,SAAS,IAAI,UAAU;AAAA,MACzB,CAAC;AAAA,IACH;AACA,eAAW,OAAO,OAAO,QAAS,KAAI,QAAQ,KAAK,GAAG;AACtD,eAAW,QAAQ,OAAO,MAAO,KAAI,MAAM,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC;AAAA,EACvF;AAGA,MAAI,QAAQ,KAAK;AAAA,IACf,MACE,EAAE,QACC,MAAM,GAAG,EACT,IAAI,GACH,QAAQ,cAAc,EAAE,KAAK,EAAE;AAAA,IACrC,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS,OAAO,MAAM,OAAO,EAAE;AAAA,IAC/B,WAAW,EAAE;AAAA,EACf,CAAC;AACD,MAAI,UAAU,MAAM,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC;AAC7C,SAAO;AACT;;;ACzDA,IAAME,aAAY;AAQlB,SAASC,gBAAe,QAA+B;AACrD,QAAM,MAAqB,CAAC;AAC5B,aAAW,SAAS,OAAO,SAASD,UAAS,GAAG;AAC9C,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,UAAM,UAAU,KAAK,MAAM,GAAG,KAAK,QAAQ,GAAG,IAAI,CAAC;AACnD,UAAM,WAAW,MAAM,SAAS;AAChC,UAAM,eAAe,WAAW,QAAQ;AACxC,UAAM,YAAY,OAAO,MAAM,GAAG,YAAY,EAAE,MAAM,OAAO,EAAE;AAC/D,UAAM,OAAO,8CAA8C,KAAK,OAAO;AACvE,QAAI,KAAK,EAAE,QAAQ,OAAO,WAAW,KAAK,CAAC;AAAA,EAC7C;AACA,SAAO;AACT;AAEA,eAAsB,SAAS,GAAe,QAAqC;AACjF,QAAM,SAASC,gBAAe,MAAM;AACpC,QAAM,MAAkB,EAAE,MAAM,GAAG,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAE/E,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAsB,EAAE,GAAG,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM;AACpE,UAAM,SAAS,MAAM,gBAAgB,SAAS,MAAM,MAAM;AAC1D,UAAM,SAAS,MAAM,YAAY;AACjC,eAAW,OAAO,OAAO,SAAS;AAChC,UAAI,QAAQ,KAAK;AAAA,QACf,GAAG;AAAA,QACH,WAAW,IAAI,YAAY;AAAA,QAC3B,SAAS,IAAI,UAAU;AAAA,MACzB,CAAC;AAAA,IACH;AACA,eAAW,OAAO,OAAO,QAAS,KAAI,QAAQ,KAAK,GAAG;AACtD,eAAW,QAAQ,OAAO,MAAO,KAAI,MAAM,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC;AAAA,EACvF;AAEA,MAAI,QAAQ,KAAK;AAAA,IACf,MACE,EAAE,QACC,MAAM,GAAG,EACT,IAAI,GACH,QAAQ,WAAW,EAAE,KAAK,EAAE;AAAA,IAClC,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS,OAAO,MAAM,OAAO,EAAE;AAAA,IAC/B,WAAW,EAAE;AAAA,EACf,CAAC;AACD,MAAI,UAAU,MAAM,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC;AAC7C,SAAO;AACT;;;AhBZA,IAAMC,WAAU,cAAc,YAAY,GAAG;AAkB7C,IAAM,gBAA6C;AAAA,EACjD,YAAY;AAAA,EACZ,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,QAAQ;AAAA,EACR,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AAAA,EACL,MAAM;AAAA,EACN,GAAG;AAAA,EACH,KAAK;AAAA,EACL,MAAM;AAAA,EACN,QAAQ;AACV;AAEA,IAAI,aAAmC;AACvC,IAAM,gBAAgB,oBAAI,IAA2B;AAErD,eAAe,mBAAkC;AAC/C,MAAI,CAAC,YAAY;AACf,iBAAa,OAAO,KAAK;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,eAAsB,YAAY,MAAsC;AACtE,QAAM,iBAAiB;AACvB,QAAM,SAAS,cAAc,IAAI,IAAI;AACrC,MAAI,OAAQ,QAAO;AACnB,QAAM,WAAWA,SAAQ,QAAQ,cAAc,IAAI,CAAC;AACpD,QAAM,OAAO,MAAM,SAAS,KAAK,QAAQ;AACzC,gBAAc,IAAI,MAAM,IAAI;AAC5B,SAAO;AACT;AAOA,eAAsB,aAAa,MAA0C;AAC3E,QAAM,WAAW,MAAM,YAAY,IAAI;AACvC,QAAM,SAAS,IAAI,OAAO;AAC1B,SAAO,YAAY,QAAQ;AAC3B,SAAO,EAAE,QAAQ,SAAS;AAC5B;AAEA,SAAS,YAAY,MAAkB,QAA4B;AACjE,SAAO,EAAE,MAAM,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAC7D;AAeA,eAAsB,YAAY,GAAe,QAAqC;AACpF,UAAQ,EAAE,KAAK;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,gBAAgB,GAAG,MAAM;AAAA,IAClC,KAAK;AAAA,IACL,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B,KAAK;AACH,aAAO,SAAS,GAAG,MAAM;AAAA,IAC3B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AACH,aAAO,QAAQ,GAAG,MAAM;AAAA,IAC1B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B,KAAK;AACH,aAAO,SAAS,GAAG,MAAM;AAAA,IAC3B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AAAA,IACL,KAAK;AACH,aAAO,OAAO,GAAG,MAAM;AAAA,IACzB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,SAAS,GAAG,MAAM;AAAA,IAC3B,KAAK;AACH,aAAO,UAAU,GAAG,MAAM;AAAA,IAC5B,KAAK;AACH,aAAO,YAAY,GAAG,MAAM;AAAA,IAC9B;AACE,aAAO,YAAY,GAAG,MAAM;AAAA,EAChC;AACF;;;ADpKO,IAAM,sBAAsB;AAc5B,SAAS,kBAA8B;AAC5C,SAAO,EAAE,gBAAgB,qBAAqB,OAAO,CAAC,EAAE;AAC1D;AAEA,eAAsB,eAAe,MAAmC;AACtE,MAAI;AACF,UAAM,MAAM,MAAMC,UAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QACE,OAAO,mBAAmB,uBAC1B,OAAO,OAAO,UAAU,YACxB,OAAO,UAAU,MACjB;AACA,aAAO,gBAAgB;AAAA,IACzB;AACA,WAAO,EAAE,gBAAgB,qBAAqB,OAAO,OAAO,MAA6B;AAAA,EAC3F,QAAQ;AACN,WAAO,gBAAgB;AAAA,EACzB;AACF;AAEA,eAAsB,gBAAgB,MAAc,OAAkC;AACpF,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAM,UAAU,MAAM,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA,GAAM,MAAM;AAAA,EAC5D,QAAQ;AAAA,EAER;AACF;AAkBA,eAAsB,iBACpB,UACA,MACA,OAA2B,CAAC,GACK;AACjC,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,SAAuB,CAAC;AAC9B,MAAI,SAAS;AACb,MAAI,WAAW;AACf,MAAI,cAAc;AAElB,aAAW,KAAK,UAAU;AACxB,QAAI;AACJ,QAAI;AACF,eAAS,MAAMF,UAAS,EAAE,SAAS,MAAM;AAAA,IAC3C,QAAQ;AACN;AAAA,IACF;AACA,UAAM,OAAO,SAAS,MAAM;AAE5B,UAAM,SAAS,KAAK,OAAO,SAAY,KAAK,MAAM,EAAE,OAAO;AAC3D,QAAI,UAAU,OAAO,SAAS,MAAM;AAClC,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,SAAS,OAAO;AAAA,QAChB,OAAO,OAAO;AAAA,MAChB,CAAC;AACD,YAAM,MAAM,EAAE,OAAO,IAAI;AACzB,gBAAU;AACV;AAAA,IACF;AAEA,QAAI;AACF,YAAM,IAAI,MAAM,YAAY,GAAG,MAAM;AACrC,aAAO,KAAK,CAAC;AACb,YAAM,MAAM,EAAE,OAAO,IAAI,EAAE,MAAM,SAAS,EAAE,SAAS,SAAS,EAAE,SAAS,OAAO,EAAE,MAAM;AACxF,kBAAY;AAAA,IACd,QAAQ;AAGN,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,SAAO,EAAE,QAAQ,OAAO,QAAQ,UAAU,YAAY;AACxD;;;AkB1HA,SAAS,YAAAG,WAAU,SAAS,YAAY;AACxC,SAAS,SAAS,QAAAC,OAAM,YAAAC,WAAU,OAAAC,YAAW;AAC7C,OAAOC,aAA6B;AAgBpC,IAAM,iBAAiB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AACF;AAEA,IAAM,cAAc,oBAAI,IAAI;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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,eAAeC,gBAAe,MAAiC;AAC7D,MAAI;AACF,UAAM,OAAO,MAAML,UAAS,MAAM,MAAM;AACxC,WAAO,KACJ,MAAM,OAAO,EACb,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAAE,WAAW,GAAG,CAAC;AAAA,EACrD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAeM,cAAa,MAAc,OAAkC;AAC1E,QAAM,KAAKF,QAAO;AAClB,KAAG,IAAI,cAAc;AACrB,KAAG,IAAI,MAAMC,gBAAeJ,MAAK,MAAM,YAAY,CAAC,CAAC;AACrD,KAAG,IAAI,MAAMI,gBAAeJ,MAAK,MAAM,gBAAgB,CAAC,CAAC;AACzD,MAAI,MAAM,OAAQ,IAAG,IAAI,KAAK;AAC9B,SAAO;AACT;AAEA,SAASM,SAAQ,GAAmB;AAClC,SAAOJ,SAAQ,MAAM,IAAI,EAAE,MAAMA,IAAG,EAAE,KAAK,GAAG;AAChD;AAEA,gBAAuB,KAAK,MAAc,UAAuB,CAAC,GAA+B;AAC/F,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,KAAK,MAAMG,cAAa,MAAM,QAAQ,eAAe,CAAC,CAAC;AAE7D,kBAAgB,QAAQ,KAAyC;AAC/D,QAAI;AACJ,QAAI;AACF,gBAAU,MAAM,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,IACtD,QAAQ;AACN;AAAA,IACF;AACA,eAAW,SAAS,SAAS;AAC3B,YAAM,MAAML,MAAK,KAAK,MAAM,IAAI;AAChC,YAAM,MAAMC,UAAS,MAAM,GAAG;AAC9B,UAAI,CAAC,IAAK;AACV,YAAM,WAAWK,SAAQ,GAAG;AAC5B,YAAM,YAAY,MAAM,YAAY,IAAI,GAAG,QAAQ,MAAM;AACzD,UAAI,GAAG,QAAQ,SAAS,EAAG;AAE3B,UAAI,MAAM,YAAY,GAAG;AACvB,eAAO,QAAQ,GAAG;AAAA,MACpB,WAAW,MAAM,OAAO,GAAG;AACzB,cAAM,MAAM,QAAQ,MAAM,IAAI,EAAE,YAAY;AAC5C,YAAI,YAAY,IAAI,GAAG,EAAG;AAC1B,YAAI;AACJ,YAAI;AACF,gBAAM,IAAI,MAAM,KAAK,GAAG;AACxB,iBAAO,EAAE;AAAA,QACX,QAAQ;AACN;AAAA,QACF;AACA,YAAI,OAAO,YAAa;AACxB,cAAM,EAAE,SAAS,KAAK,SAAS,UAAU,KAAK,KAAK;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AAEA,SAAO,QAAQ,IAAI;AACrB;;;ACnKA,SAAS,SAAAC,QAAO,YAAAC,WAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,gBAAe;AAIxB,eAAe,UAAU,MAAc,MAAe,QAAgC;AACpF,QAAMH,OAAMG,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,OAAO,SAAS,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI;AACzE,QAAMD,WAAU,MAAM,OAAO,MAAM,MAAM;AAC3C;AAEA,eAAe,SAAY,MAA0B;AACnD,QAAM,OAAO,MAAMD,UAAS,MAAM,MAAM;AACxC,SAAO,KAAK,MAAM,IAAI;AACxB;AAEA,eAAsB,WAAW,MAAc,OAAmC;AAGhF,QAAM,UAAU,MAAM,OAAO,KAAK;AACpC;AAEA,eAAsB,UAAU,MAAoC;AAClE,SAAO,SAAsB,IAAI;AACnC;AAEA,eAAsB,iBAAiB,MAAc,OAAmC;AACtF,QAAM,UAAU,MAAM,OAAO,IAAI;AACnC;AAEA,eAAsB,gBAAgB,MAAoC;AAIxE,QAAM,SAAS,MAAM,SAAsB,IAAI;AAC/C,SAAO,OAAO,OAAO,uBAAO,OAAO,IAAI,GAAG,MAAM;AAClD;;;ACpCA,SAAS,QAAAG,aAAY;AA8Bd,SAAS,aAAa,aAAmC;AAC9D,QAAM,WAAWA,MAAK,aAAa,gBAAgB;AACnD,QAAM,aAAaA,MAAK,aAAa,UAAU;AAC/C,QAAM,YAAYA,MAAK,aAAa,SAAS;AAE7C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAWA,MAAK,UAAU,iBAAiB;AAAA,IAC3C,aAAaA,MAAK,UAAU,mBAAmB;AAAA,IAC/C,cAAcA,MAAK,UAAU,cAAc;AAAA,IAC3C,aAAaA,MAAK,UAAU,gBAAgB;AAAA,IAC5C,UAAUA,MAAK,UAAU,iBAAiB;AAAA,IAC1C,SAASA,MAAK,UAAU,gBAAgB;AAAA,IACxC,SAASA,MAAK,UAAU,gBAAgB;AAAA,IACxC,SAASA,MAAK,UAAU,gBAAgB;AAAA,IACxC,WAAWA,MAAK,UAAU,kBAAkB;AAAA,IAC5C,YAAYA,MAAK,UAAU,kBAAkB;AAAA,IAC7C,YAAYA,MAAK,UAAU,kBAAkB;AAAA,IAC7C,SAASA,MAAK,UAAU,UAAU;AAAA,IAClC,cAAcA,MAAK,UAAU,gBAAgB;AAAA,IAC7C,iBAAiBA,MAAK,UAAU,oBAAoB;AAAA,IACpD,cAAcA,MAAK,YAAY,oBAAoB;AAAA,IACnD,WAAWA,MAAK,YAAY,YAAY;AAAA,IACxC,aAAaA,MAAK,YAAY,UAAU;AAAA,IACxC;AAAA,IACA,gBAAgBA,MAAK,WAAW,qBAAqB;AAAA,IACrD,gBAAgBA,MAAK,WAAW,OAAO;AAAA,IACvC,UAAUA,MAAK,aAAa,WAAW;AAAA,IACvC,WAAWA,MAAK,aAAa,YAAY;AAAA,EAC3C;AACF;;;AC7DA,SAAS,SAAAC,QAAO,YAAAC,WAAU,QAAAC,OAAM,aAAAC,kBAAiB;AACjD,SAAS,YAAAC,iBAAgB;;;ACCzB,SAAS,YAAAC,WAAU,aAAAC,kBAAiB;AACpC,SAAS,UAAU,WAAAC,gBAAe;AAE3B,IAAM,iBAAiB;AACvB,IAAM,eAAe,wBAAwB,cAAc;AAC3D,IAAM,aAAa,wBAAwB,cAAc;AAGhE,IAAM,eACJ;AAQK,SAAS,cAAsB;AACpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAOO,SAAS,mBAAmB,aAA6B;AAC9D,SAAO;AAAA,IACL,KAAK,WAAW;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,eAAsB,cAAc,MAAc,aAA4C;AAC5F,MAAI;AACJ,MAAI;AACF,eAAW,MAAMF,UAAS,MAAM,MAAM;AAAA,EACxC,QAAQ;AACN,eAAW;AAAA,EACb;AAEA,QAAM,QAAQ,YAAY;AAE1B,MAAI,aAAa,MAAM;AAGrB,UAAM,OAAO,eAAe,SAASE,SAAQ,IAAI,CAAC,KAAK;AACvD,UAAMD,WAAU,MAAM,mBAAmB,IAAI,IAAI,OAAO,QAAQ,MAAM,MAAM;AAC5E,WAAO,EAAE,SAAS,MAAM,SAAS,OAAO,SAAS,MAAM;AAAA,EACzD;AASA,QAAM,WAAW,SAAS,QAAQ,cAAc,EAAE;AAClD,QAAM,OAAO,SAAS,QAAQ,QAAQ,EAAE;AACxC,QAAM,UAAU,KAAK,SAAS,GAAG,IAAI;AAAA;AAAA,EAAO,KAAK;AAAA,IAAO,GAAG,KAAK;AAAA;AAEhE,MAAI,YAAY,UAAU;AACxB,WAAO,EAAE,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;AAAA,EACzD;AAEA,QAAMA,WAAU,MAAM,SAAS,MAAM;AACrC,SAAO,EAAE,SAAS,OAAO,SAAS,MAAM,SAAS,MAAM;AACzD;;;AD7MA,IAAM,oBAA0D;AAAA,EAC9D;AAAA,IACE,SAAS;AAAA,IACT,OAAO;AAAA,EACT;AAAA,EACA;AAAA,IACE,SACE;AAAA,IAEF,OAAO;AAAA,EACT;AACF;AAEA,eAAe,OAAO,MAAgC;AACpD,MAAI;AACF,UAAME,MAAK,IAAI;AACf,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,UAAU,MAAgC;AACvD,QAAM,MAAM,MAAM,OAAO,IAAI;AAC7B,QAAMC,OAAM,MAAM,EAAE,WAAW,KAAK,CAAC;AACrC,SAAO,CAAC;AACV;AAEA,eAAe,eAAe,MAAgC;AAC5D,MAAI,WAAW;AACf,MAAI;AACF,eAAW,MAAMC,UAAS,MAAM,MAAM;AAAA,EACxC,QAAQ;AAAA,EAER;AACA,QAAM,UAAU,IAAI,IAAI,SAAS,MAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACpE,QAAM,UAAU,kBAAkB,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,KAAK,CAAC;AACrE,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM,KAAK,EAAE,OAAO;AAAA,EAAK,EAAE,KAAK,EAAE,EAAE,KAAK,IAAI,IAAI;AAC5E,QAAM,YACH,SAAS,WAAW,KAAK,SAAS,SAAS,IAAI,IAAI,KAAK,SACxD,SAAS,SAAS,OAAO,MAC1B;AACF,QAAMC,WAAU,MAAM,WAAW,UAAU,MAAM;AACjD,SAAO;AACT;AAEA,eAAsB,UAAU,OAA+C;AAC7E,QAAM,eAAe,MAAM,UAAU,MAAM,QAAQ;AACnD,QAAM,iBAAiB,MAAM,UAAU,MAAM,UAAU;AACvD,QAAM,mBAAmB,MAAM,eAAe,MAAM,SAAS;AAE7D,QAAM,wBAAwB,MAAM,OAAO,MAAM,QAAQ;AACzD,QAAM,QAAQ,MAAM,cAAc,MAAM,UAAUC,UAAS,MAAM,WAAW,CAAC;AAE7E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,MAAM;AAAA,IACvB,iBAAiB,MAAM,WAAW,CAAC;AAAA,EACrC;AACF;;;A1BxEA,IAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AA6BD,eAAsB,YACpB,gBACA,OAAoB,CAAC,GACA;AACrB,QAAM,cAAc,QAAQ,cAAc;AAC1C,QAAM,QAAQ,aAAa,WAAW;AACtC,QAAM,QAAQ,KAAK,IAAI;AACvB,QAAM,UAAU,CAAC,KAAK;AAEtB,MAAI,QAAS,KAAI,KAAK,YAAY,WAAW,EAAE;AAE/C,QAAM,OAA+B,KAAK,gBAAgB,OAAO,MAAM,UAAU,KAAK;AACtF,MAAI,WAAW,MAAM;AACnB,QAAI,KAAK,aAAc,KAAI,KAAK,2BAA2B;AAC3D,QAAI,KAAK,eAAgB,KAAI,KAAK,qBAAqB;AACvD,QAAI,KAAK,iBAAkB,KAAI,KAAK,sBAAsB;AAC1D,QAAI,KAAK,iBAAiB;AACxB,UAAI,KAAK,8DAAyD;AAClE,UAAI;AAAA,QACF;AAAA,MACF;AAAA,IACF,WAAW,KAAK,iBAAiB;AAC/B,UAAI,KAAK,qBAAqB;AAAA,IAChC;AAAA,EACF;AAEA,QAAM,SAAuB,CAAC;AAC9B,mBAAiB,QAAQ,KAAK,WAAW,EAAG,QAAO,KAAK,IAAI;AAC5D,MAAI,QAAS,KAAI,KAAK,YAAY,OAAO,MAAM,QAAQ;AAEvD,QAAM,WAAW,OAAO,OAAO,CAAC,MAAM,cAAc,IAAI,EAAE,GAAG,CAAC;AAC9D,QAAM,YAAY,MAAM,eAAe,MAAM,UAAU;AACvD,QAAM,EAAE,QAAQ,OAAO,QAAQ,UAAU,YAAY,IAAI,MAAM;AAAA,IAC7D;AAAA,IACA;AAAA,IACA,EAAE,MAAM,KAAK,KAAK;AAAA,EACpB;AACA,MAAI,SAAS;AACX,QAAI;AAAA,MACF,YAAY,OAAO,MAAM,WAAW,MAAM,gBAAa,QAAQ,eAC5D,cAAc,KAAK,WAAW,aAAa,MAC5C,KAAK,OAAO,SAAS,SAAS,MAAM;AAAA,IACxC;AAAA,EACF;AAEA,QAAM,QAAQ,MAAM,WAAW,aAAa,MAAM;AAClD,QAAM,cAAc,iBAAiB,KAAK;AAE1C,QAAM,WAAW,MAAM,WAAW,KAAK;AACvC,QAAM,iBAAiB,MAAM,aAAa,WAAW;AACrD,QAAM,gBAAgB,MAAM,YAAY,KAAK;AAE7C,MAAI,SAAS;AACX,QAAI;AAAA,MACF,WAAW,MAAM,SAAS,WAAM,MAAM,YAAY,aAAa,MAAM,UAAU;AAAA,IACjF;AACA,QAAI,KAAK,WAAW,MAAM,WAAW,WAAM,OAAO,KAAK,WAAW,EAAE,MAAM,QAAQ;AAAA,EACpF;AAEA,QAAM,aAAa,KAAK,IAAI,IAAI;AAChC,MAAI,QAAS,KAAI,KAAK,YAAY,aAAa,KAAM,QAAQ,CAAC,CAAC,GAAG;AAElE,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,QAAQ,OAAO;AAAA,IACf,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM;AAAA,IACjB;AAAA,EACF;AACF;;;A4BrIA,SAAS,cAAAC,aAAY,SAAAC,QAAO,YAAAC,WAAU,aAAAC,kBAAiB;AACvD,SAAS,WAAAC,gBAAe;;;ACuBjB,IAAM,uBAAuB;AAEpC,IAAM,SAAS,KAAK,KAAK,KAAK;AAGvB,SAAS,aAAqB;AACnC,QAAM,MAAM,OAAO,QAAQ,IAAI,uBAAuB;AACtD,QAAM,OAAO,OAAO,SAAS,GAAG,KAAK,MAAM,IAAI,MAAM;AACrD,SAAO,OAAO;AAChB;AAIO,SAAS,UAAU,QAA8B;AACtD,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAEO,SAAS,aAAyB;AACvC,SAAO;AAAA,IACL,gBAAgB;AAAA,IAChB,OAAM,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,IAC9B,OAAO,CAAC;AAAA,EACV;AACF;AAGA,SAAS,YAAY,QAAgB,MAAc,IAAoB;AACrE,QAAM,SAAS,KAAK,MAAM,MAAM;AAChC,MAAI,CAAC,OAAO,SAAS,MAAM,EAAG,QAAO;AACrC,QAAM,KAAK,OAAO;AAClB,MAAI,MAAM,EAAG,QAAO;AACpB,SAAO,KAAK,IAAI,EAAE,KAAK,MAAM,MAAM,EAAE;AACvC;AAMO,SAAS,UAAU,OAAmB,IAA6B;AACxE,QAAM,IAAI,UAAU,GAAG,MAAM;AAC7B,MAAI,KAAK,KAAK,CAAC,GAAG,KAAM,QAAO;AAC/B,QAAM,MAAM,KAAK,MAAM,GAAG,EAAE;AAC5B,MAAI,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAElC,QAAM,KAAK,WAAW;AACtB,QAAM,OAAO,MAAM,MAAM,GAAG,IAAI;AAChC,MAAI,MAAM;AACR,UAAM,UAAU,KAAK,UAAU,YAAY,KAAK,QAAQ,KAAK,EAAE,IAAI;AACnE,UAAM,MAAM,GAAG,IAAI,IAAI,EAAE,OAAO,KAAK,QAAQ,GAAG,SAAS,QAAQ,GAAG,GAAG;AAAA,EACzE,OAAO;AACL,UAAM,MAAM,GAAG,IAAI,IAAI,EAAE,OAAO,GAAG,SAAS,GAAG,QAAQ,GAAG,GAAG;AAAA,EAC/D;AACA,SAAO;AACT;AAIO,SAAS,gBAAgB,OAAmB,OAAoC;AACrF,QAAM,KAAK,WAAW;AACtB,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,CAAC,MAAMC,KAAI,KAAK,OAAO,QAAQ,MAAM,KAAK,GAAG;AACtD,UAAM,MAAMA,MAAK,UAAU,YAAYA,MAAK,QAAQ,OAAO,EAAE;AAC7D,QAAI,MAAM,KAAM,KAAI,IAAI,MAAM,GAAG;AAAA,EACnC;AACA,SAAO;AACT;AAGO,SAAS,iBAAiB,QAAmC;AAClE,QAAM,QAAQ,WAAW;AACzB,aAAW,MAAM,OAAQ,WAAU,OAAO,EAAE;AAC5C,SAAO;AACT;;;ADlGA,eAAsB,eAAe,MAAmC;AACtE,MAAI;AACF,UAAM,MAAM,MAAMC,UAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QACE,OAAO,mBAAmB,wBAC1B,OAAO,OAAO,UAAU,YACxB,OAAO,UAAU,MACjB;AACA,aAAO,WAAW;AAAA,IACpB;AACA,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,MAAM,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO,WAAW,EAAE;AAAA,MACnE,OAAO,OAAO;AAAA,IAChB;AAAA,EACF,QAAQ;AACN,WAAO,WAAW;AAAA,EACpB;AACF;AAEA,eAAsB,gBAAgB,MAAc,OAAkC;AACpF,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAMC,WAAU,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM;AAAA,EACrE,QAAQ;AAAA,EAER;AACF;AAEA,eAAsB,cAAc,MAAsC;AACxE,MAAI;AACF,UAAM,MAAM,MAAMH,UAAS,MAAM,MAAM;AACvC,UAAM,MAAqB,CAAC;AAC5B,eAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,YAAM,IAAI,KAAK,KAAK;AACpB,UAAI,CAAC,EAAG;AACR,UAAI;AACF,cAAM,KAAK,KAAK,MAAM,CAAC;AACvB,YACE,MACA,OAAO,GAAG,OAAO,YACjB,OAAO,GAAG,SAAS,YACnB,OAAO,GAAG,WAAW,UACrB;AACA,cAAI,KAAK,EAAE;AAAA,QACb;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAsB,aAAa,MAAc,IAAgC;AAC/E,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,UAAME,YAAW,MAAM,KAAK,UAAU,EAAE,IAAI,MAAM,MAAM;AAAA,EAC1D,QAAQ;AAAA,EAER;AACF;;;AE/DA,IAAM,sBAAsB;AAErB,IAAM,eAAN,MAAM,cAAa;AAAA,EAKhB,YACW,eACA,WACjB,OACA;AAHiB;AACA;AAGjB,SAAK,QAAQ;AAAA,EACf;AAAA,EALmB;AAAA,EACA;AAAA,EANX;AAAA,EACA,QAAQ;AAAA,EACR,QAA8C;AAAA;AAAA;AAAA,EAYtD,aAAa,KAAK,eAAuB,WAA0C;AACjF,QAAI,QAAQ,MAAM,eAAe,SAAS;AAC1C,QAAI,OAAO,KAAK,MAAM,KAAK,EAAE,WAAW,GAAG;AACzC,YAAM,SAAS,MAAM,cAAc,aAAa;AAChD,UAAI,OAAO,SAAS,EAAG,SAAQ,iBAAiB,MAAM;AAAA,IACxD;AACA,WAAO,IAAI,cAAa,eAAe,WAAW,KAAK;AAAA,EACzD;AAAA;AAAA;AAAA,EAIA,MAAM,OAAO,IAAgC;AAC3C,UAAM,aAAa,KAAK,eAAe,EAAE;AACzC,cAAU,KAAK,OAAO,EAAE;AACxB,SAAK,gBAAgB;AAAA,EACvB;AAAA;AAAA,EAGA,gBAAgB,QAAgB,KAAK,IAAI,GAAwB;AAC/D,WAAO,gBAAgB,KAAK,OAAO,KAAK;AAAA,EAC1C;AAAA,EAEQ,kBAAwB;AAC9B,SAAK,QAAQ;AACb,QAAI,KAAK,MAAO;AAChB,SAAK,QAAQ,WAAW,MAAM;AAC5B,WAAK,QAAQ;AACb,WAAK,KAAK,MAAM;AAAA,IAClB,GAAG,mBAAmB;AAEtB,SAAK,MAAM,QAAQ;AAAA,EACrB;AAAA;AAAA;AAAA,EAIA,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAO;AACd,mBAAa,KAAK,KAAK;AACvB,WAAK,QAAQ;AAAA,IACf;AACA,QAAI,CAAC,KAAK,MAAO;AACjB,SAAK,QAAQ;AACb,SAAK,MAAM,QAAO,oBAAI,KAAK,GAAE,YAAY;AACzC,UAAM,gBAAgB,KAAK,WAAW,KAAK,KAAK;AAAA,EAClD;AACF;;;ACzDA,SAAS,IAAI,MAAc,UAA0B;AACnD,QAAM,IAAI,QAAQ,IAAI,IAAI;AAC1B,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,IAAI,OAAO,CAAC;AAClB,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAEA,SAAS,IAAsB,MAAc,UAAgB;AAC3D,SAAQ,QAAQ,IAAI,IAAI,KAAW;AACrC;AAEO,SAAS,aAA4B;AAC1C,SAAO;AAAA,IACL,kBAAkB,IAAI,2BAA2B,GAAI;AAAA,IACrD,kBAAkB,IAAI,uBAAuB,IAAI;AAAA,IACjD,kBAAkB,IAAI,uBAAuB,GAAG;AAAA,IAChD,qBAAqB,IAAI,8BAA8B,IAAK;AAAA,IAC5D,yBAAyB,IAAI,mCAAmC,CAAC;AAAA,IACjE,qBAAqB,IAAI,8BAA8B,GAAG;AAAA;AAAA;AAAA;AAAA,IAI1D,mBAAmB,IAAI,2BAA2B,GAAI;AAAA,IACtD,aAAa,CAAC,QAAQ,IAAI;AAAA;AAAA;AAAA;AAAA,IAI1B,aAAa,CAAC,QAAQ,IAAI;AAAA,IAC1B,SAAS,QAAQ,IAAI,eAAe,IAAI,gBAAgB,CAAC,IAAI;AAAA,IAC7D,eAAe,IAAI,sBAAsB,IAAI;AAAA,IAC7C,UAAU,IAAI,iBAAiB,MAAe;AAAA,IAC9C,WAAW,IAAI,kBAAkB,QAAiB;AAAA,EACpD;AACF;;;AC1CA,SAAS,cAAAC,aAAY,SAAAC,cAAa;AAClC,SAAS,WAAAC,gBAAe;;;ACaxB,IAAM,iBAAiB;AAKvB,IAAM,0BAA0B;AAEhC,SAAS,gBAAwB;AAC/B,QAAM,MAAM,OAAO,QAAQ,IAAI,mBAAmB;AAClD,SAAO,OAAO,SAAS,GAAG,KAAK,OAAO,IAAI,MAAM;AAClD;AAaA,IAAMC,aAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AAEM,SAAS,cAAc,OAAyB;AACrD,QAAM,SAAS,MACZ,YAAY,EACZ,MAAM,cAAc,EACpB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAACA,WAAU,IAAI,CAAC,CAAC;AAElD,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,KAAK,QAAQ;AACtB,aAAS,IAAI,CAAC;AACd,UAAM,QAAQ,EAAE,MAAM,gBAAgB,KAAK,CAAC;AAC5C,eAAW,KAAK,MAAO,KAAI,EAAE,SAAS,EAAG,UAAS,IAAI,CAAC;AAAA,EACzD;AACA,SAAO,MAAM,KAAK,QAAQ;AAC5B;AAEA,SAAS,mBAAmB,OAA2D;AACrF,QAAM,MAAM,oBAAI,IAA0B;AAC1C,MAAI,CAAC,MAAO,QAAO;AACnB,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,SAAU;AACzB,UAAM,OAAO,IAAI,IAAI,EAAE,IAAI,KAAK,CAAC;AACjC,SAAK,KAAK,CAAC;AACX,QAAI,IAAI,EAAE,MAAM,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAA0D;AAElF,QAAM,MAAM,oBAAI,IAAyB;AACzC,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,KAAK,MAAM,MAAO,KAAI,EAAE,SAAS,OAAQ,UAAS,IAAI,EAAE,IAAI,EAAE,IAAI;AAC7E,aAAW,KAAK,MAAM,OAAiB;AACrC,QAAI,EAAE,SAAS,UAAW;AAC1B,UAAM,OAAO,SAAS,IAAI,EAAE,IAAI;AAChC,UAAM,KAAK,SAAS,IAAI,EAAE,EAAE;AAC5B,QAAI,CAAC,QAAQ,CAAC,GAAI;AAClB,UAAM,IAAI,IAAI,IAAI,IAAI,KAAK,oBAAI,IAAY;AAC3C,MAAE,IAAI,EAAE;AACR,QAAI,IAAI,MAAM,CAAC;AAAA,EACjB;AACA,SAAO;AACT;AAEO,SAAS,WAAW,QAAkC;AAC3D,QAAM,UAAU,IAAI,IAAI,cAAc,OAAO,KAAK,CAAC;AACnD,QAAM,gBAAgB,mBAAmB,OAAO,KAAK;AACrD,QAAM,cAAc,iBAAiB,OAAO,KAAK;AAEjD,QAAM,QAAQ,IAAI,IAAY,OAAO,qBAAqB,CAAC,CAAC;AAC5D,aAAW,KAAK,OAAO,uBAAuB,CAAC,EAAG,OAAM,IAAI,CAAC;AAS7D,QAAM,aAAa,OAAO,WAAW;AACrC,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,OAAO,YAAY;AACjC,eAAW,MAAM,EAAE,UAAU;AAC3B,UAAI,QAAQ,IAAI,EAAE,EAAG,SAAQ,IAAI,KAAK,QAAQ,IAAI,EAAE,KAAK,KAAK,CAAC;AAAA,IACjE;AAAA,EACF;AACA,QAAM,MAAM,CAAC,UAA0B;AACrC,UAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAChC,QAAI,KAAK,EAAG,QAAO;AACnB,WAAO,KAAK,IAAI,KAAK,aAAa,IAAI,QAAQ,IAAI,IAAI;AAAA,EACxD;AACA,MAAI,SAAS;AACb,MAAI,WAAW;AACf,aAAW,KAAK,SAAS;AACvB,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,IAAI,GAAG;AACT,gBAAU;AACV,kBAAY;AAAA,IACd;AAAA,EACF;AACA,QAAM,SAAS,WAAW,IAAI,SAAS,WAAW;AAGlD,QAAM,SAAuB,CAAC;AAC9B,aAAW,QAAQ,OAAO,YAAY;AACpC,UAAM,UAAoB,CAAC;AAC3B,QAAIC,SAAQ;AAIZ,QAAI,SAAS;AACb,QAAI,UAAU;AACd,eAAW,MAAM,KAAK,UAAU;AAC9B,UAAI,CAAC,QAAQ,IAAI,EAAE,EAAG;AACtB,gBAAU;AACV,iBAAW,kBAAkB,IAAI,EAAE,IAAI;AAAA,IACzC;AACA,QAAI,QAAQ;AACV,MAAAA,UAAS;AACT,cAAQ,KAAK,MAAM,MAAM,EAAE;AAAA,IAC7B;AAGA,UAAM,UAAU,cAAc,IAAI,KAAK,IAAI,KAAK,CAAC;AACjD,QAAI,UAAU;AACd,QAAI,WAAW;AACf,eAAW,OAAO,SAAS;AACzB,YAAM,OAAO,IAAI,KAAK,YAAY;AAClC,UAAI,QAAQ,IAAI,IAAI,GAAG;AACrB,mBAAW;AACX,oBAAY;AAAA,MACd,OAAO;AAEL,mBAAW,KAAK,SAAS;AACvB,cAAI,KAAK,SAAS,CAAC,KAAK,EAAE,SAAS,IAAI,GAAG;AACxC,uBAAW;AACX;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS;AACX,MAAAA,UAAS;AACT,cAAQ,KAAK,OAAO,OAAO,EAAE;AAAA,IAC/B;AAGA,UAAM,YAAY,KAAK,KAAK,YAAY;AACxC,QAAI,WAAW;AACf,eAAW,KAAK,QAAS,KAAI,UAAU,SAAS,CAAC,EAAG,aAAY;AAChE,QAAI,UAAU;AACZ,MAAAA,UAAS;AACT,cAAQ,KAAK,QAAQ,QAAQ,EAAE;AAAA,IACjC;AAEA,QAAI,MAAM,IAAI,KAAK,IAAI,GAAG;AACxB,MAAAA,UAAS;AACT,cAAQ,KAAK,MAAM;AAAA,IACrB;AAEA,WAAO,KAAK,EAAE,MAAM,OAAAA,QAAO,SAAS,SAAS,SAAS,CAAC;AAAA,EACzD;AAGA,QAAM,gBAAgB,IAAI,IAAI,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC;AACvF,MAAI,cAAc,OAAO,GAAG;AAC1B,eAAW,KAAK,QAAQ;AACtB,UAAI,EAAE,QAAQ,EAAG;AAEjB,UAAI,cAAc;AAClB,iBAAW,CAAC,MAAM,GAAG,KAAK,aAAa;AACrC,YAAI,CAAC,cAAc,IAAI,IAAI,EAAG;AAC9B,YAAI,IAAI,IAAI,EAAE,KAAK,IAAI,GAAG;AACxB,yBAAe;AACf;AAAA,QACF;AAAA,MACF;AACA,UAAI,aAAa;AACf,UAAE,SAAS,cAAc;AACzB,UAAE,QAAQ,KAAK,SAAS;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAOA,QAAM,QAAQ,OAAO;AACrB,MAAI,SAAS,MAAM,OAAO,GAAG;AAC3B,QAAI,OAAO;AACX,eAAW,KAAK,MAAM,OAAO,EAAG,KAAI,IAAI,KAAM,QAAO;AACrD,QAAI,OAAO,GAAG;AACZ,YAAM,MAAM,cAAc;AAC1B,iBAAW,KAAK,QAAQ;AACtB,YAAI,EAAE,SAAS,EAAG;AAClB,cAAM,IAAI,MAAM,IAAI,EAAE,KAAK,IAAI,KAAK;AACpC,YAAI,KAAK,EAAG;AACZ,UAAE,SAAS,OAAO,IAAI;AACtB,UAAE,QAAQ,KAAK,WAAQ,KAAK,MAAM,CAAC,CAAC,EAAE;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,SAAO;AACT;;;AC5PA,eAAsB,SACpB,OACA,OACA,UAA2B,CAAC,GACF;AAC1B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,UAAU,cAAc,KAAK;AAEnC,QAAM,WAAuB,MAAM,MAAM,OAAO,CAAC,MAAqB,EAAE,SAAS,MAAM;AAEvF,MAAI,SAAS,WAAW,KAAK,QAAQ,WAAW,GAAG;AACjD,WAAO;AAAA,MACL,OAAO,CAAC;AAAA,MACR,YAAY;AAAA,MACZ,QAAQ,QAAQ,WAAW,IAAI,gBAAgB;AAAA,MAC/C,eAAe;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,aAAyB;AAAA,IAC7B,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,qBAAqB,QAAQ;AAAA,IAC7B,mBAAmB,QAAQ;AAAA,IAC3B,aAAa,QAAQ;AAAA,EACvB;AACA,QAAM,SAAS,WAAW,UAAU;AACpC,QAAM,WAAW,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;AAEjD,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,MACL,OAAO,CAAC;AAAA,MACR,YAAY;AAAA,MACZ,QAAQ,kBAAkB,KAAK,UAAU,OAAO,CAAC;AAAA,MACjD,eAAe;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,YAAY,SAAS,MAAM,GAAG,IAAI;AACxC,QAAM,MAAM,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI;AACvC,QAAM,gBAAgB,UAAU,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC;AAC1D,QAAM,WAAW,SAAS,CAAC,GAAG,SAAS;AACvC,QAAM,cAAc,SAAS,CAAC,GAAG,SAAS;AAK1C,MAAI;AACJ,MAAI,SAAS,WAAW,EAAG,cAAa;AAAA,WAC/B,YAAY,KAAK,YAAY,cAAc,EAAG,cAAa;AAAA,WAC3D,YAAY,EAAG,cAAa;AAAA,MAChC,cAAa;AAElB,QAAM,UAAU,SACb,MAAM,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,CAAC,EAChC,IAAI,CAAC,MAAM,GAAG,EAAE,KAAK,IAAI,KAAK,EAAE,QAAQ,KAAK,GAAG,CAAC,GAAG,EACpD,KAAK,IAAI;AAEZ,SAAO;AAAA,IACL,OAAO;AAAA,IACP;AAAA,IACA,QAAQ,QAAQ,OAAO;AAAA,IACvB;AAAA,EACF;AACF;;;ACtFA,SAAS,YAAAC,iBAAgB;AACzB,SAAS,YAAAC,kBAAgB;AACzB,SAAS,QAAAC,aAAY;AACrB,SAAS,aAAAC,kBAAiB;AAE1B,IAAMC,iBAAgBD,WAAUH,SAAQ;AAExC,eAAsB,cAAc,aAAsC;AAGxE,MAAI;AACF,UAAM,WAAWE,MAAK,aAAa,QAAQ,MAAM;AACjD,UAAM,OAAO,MAAMD,WAAS,UAAU,MAAM;AAC5C,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,QAAQ,QAAQ,MAAM,4BAA4B;AACxD,QAAI,QAAQ,CAAC,EAAG,QAAO,MAAM,CAAC;AAAA,EAEhC,QAAQ;AAAA,EAER;AAEA,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAMG,eAAc,OAAO,CAAC,UAAU,gBAAgB,GAAG;AAAA,MAC1E,KAAK;AAAA,IACP,CAAC;AACD,UAAM,OAAO,OAAO,KAAK;AACzB,QAAI,KAAM,QAAO;AAAA,EACnB,QAAQ;AAAA,EAER;AAEA,SAAO;AACT;AAEA,eAAsB,cAAc,aAAsC;AACxE,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAMA;AAAA,MACvB;AAAA,MACA,CAAC,gBAAgB,4BAA4B,SAAS;AAAA,MACtD,EAAE,KAAK,YAAY;AAAA,IACrB;AACA,UAAM,UAAU,OAAO,KAAK;AAC5B,UAAM,QAAQ,QAAQ,MAAM,gBAAgB;AAC5C,QAAI,QAAQ,CAAC,EAAG,QAAO,MAAM,CAAC;AAAA,EAChC,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB,MAAsB;AACvD,SAAO,KAAK,WAAW,KAAK,GAAG,EAAE,WAAW,MAAM,GAAG;AACvD;AAQO,SAAS,mBACd,YACA,QACA,WACmB;AACnB,MAAI,WAAW;AACb,WAAO;AAAA,MACL,cAAcF,MAAK,YAAY,oBAAoB;AAAA,MACnD,WAAWA,MAAK,YAAY,YAAY;AAAA,MACxC,WAAW;AAAA,IACb;AAAA,EACF;AACA,QAAM,YAAYA,MAAK,YAAY,YAAY,mBAAmB,MAAM,CAAC;AACzE,SAAO;AAAA,IACL,cAAcA,MAAK,WAAW,oBAAoB;AAAA,IAClD,WAAWA,MAAK,WAAW,YAAY;AAAA,IACvC;AAAA,EACF;AACF;;;AC5EA,SAAS,SAAAG,QAAO,YAAAC,YAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,gBAAe;AAYxB,IAAM,cAAc;AAEb,SAAS,gBAAgB,SAAyB,QAA2B;AAElF,QAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,QAAQ;AAC/D,QAAM,cAAc,MAAM,CAAC,GAAG,WAAW;AAEzC,QAAM,eAAe,QAClB,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EACnC,MAAM,CAAC,WAAW,EAClB,IAAI,CAAC,MAAM,EAAE,OAAO;AAEvB,QAAM,YAAY,QACf,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAC/B,MAAM,CAAC,WAAW,EAClB,IAAI,CAAC,MAAM,EAAE,OAAO;AAEvB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAM,oBAAI,KAAK,GAAE,YAAY;AAAA,EAC/B;AACF;AAEO,SAAS,gBAAgB,KAAwB;AACtD,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,oBAAe,IAAI,MAAM,EAAE;AACtC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,aAAa,IAAI,IAAI,GAAG;AACnC,QAAM,KAAK,EAAE;AAEb,MAAI,IAAI,aAAa;AACnB,UAAM,KAAK,iBAAiB;AAC5B,UAAM,KAAK,IAAI,WAAW;AAC1B,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,IAAI,aAAa,QAAQ;AAC3B,UAAM,KAAK,kBAAkB;AAC7B,eAAW,KAAK,IAAI,aAAc,OAAM,KAAK,KAAK,CAAC,EAAE;AACrD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,IAAI,UAAU,QAAQ;AACxB,UAAM,KAAK,eAAe;AAC1B,eAAW,KAAK,IAAI,UAAW,OAAM,KAAK,KAAK,CAAC,EAAE;AAClD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,CAAC,IAAI,eAAe,CAAC,IAAI,aAAa,UAAU,CAAC,IAAI,UAAU,QAAQ;AACzE,UAAM,KAAK,qEAAgE;AAC3E,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,eAAsB,eAAe,MAAc,KAA+B;AAChF,QAAMH,OAAMG,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAMD,WAAU,MAAM,gBAAgB,GAAG,GAAG,MAAM;AACpD;;;AC7EA,SAAS,SAAAE,QAAO,YAAAC,YAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,gBAAe;AAoBxB,IAAMC,kBAAiB;AAEvB,eAAsB,YAAY,MAAuC;AACvE,MAAI;AACF,UAAM,MAAM,MAAMH,WAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,WAAO,MAAM,QAAQ,OAAO,OAAO,IAAI,OAAO,UAAU,CAAC;AAAA,EAC3D,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAsB,aAAa,MAAc,SAAwC;AACvF,QAAMD,OAAMG,SAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,QAAe,EAAE,gBAAgBC,iBAAgB,QAAQ;AAC/D,QAAMF,WAAU,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM;AACrE;AAEA,eAAsB,YAAY,MAAc,OAAoC;AAClF,QAAM,UAAU,MAAM,YAAY,IAAI;AACtC,UAAQ,KAAK,KAAK;AAClB,QAAM,aAAa,MAAM,OAAO;AAClC;;;AC5BA,eAAsB,oBACpB,OACA,UACuB;AACvB,QAAM,SAAS,YAAa,MAAM,cAAc,MAAM,WAAW;AACjE,QAAM,MAAM,MAAM,cAAc,MAAM,WAAW;AACjD,QAAM,YAAY,WAAW;AAC7B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,OAAO,mBAAmB,MAAM,YAAY,QAAQ,SAAS;AAAA,EAC/D;AACF;AAgBA,eAAsB,cACpB,OACA,OACyB;AACzB,QAAM,SAAS,MAAM,oBAAoB,KAAK;AAC9C,QAAM,QAAsB;AAAA,IAC1B,MAAM,MAAM;AAAA,IACZ,SAAS,MAAM;AAAA,IACf,MAAM,MAAM,QAAQ,CAAC;AAAA,IACrB,OAAO,MAAM,SAAS,CAAC;AAAA,IACvB,OAAM,oBAAI,KAAK,GAAE,YAAY;AAAA,EAC/B;AACA,QAAM,YAAY,OAAO,MAAM,cAAc,KAAK;AAGlD,QAAM,UAAU,MAAM,YAAY,OAAO,MAAM,YAAY;AAC3D,QAAM,KAAK,gBAAgB,SAAS,OAAO,MAAM;AACjD,QAAM,eAAe,OAAO,MAAM,WAAW,EAAE;AAE/C,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,OAAO;AAAA,IACf,WAAW,OAAO,MAAM;AAAA,IACxB,eAAe,OAAO,MAAM;AAAA,EAC9B;AACF;AAcA,eAAsB,cACpB,OACA,QAAqB,CAAC,GACC;AACvB,QAAM,SAAS,MAAM,oBAAoB,OAAO,MAAM,MAAM;AAC5D,MAAI,UAAU,MAAM,YAAY,OAAO,MAAM,YAAY;AACzD,MAAI,MAAM,KAAM,WAAU,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,IAAI;AACrE,MAAI,MAAM,SAAS,MAAM,QAAQ,EAAG,WAAU,QAAQ,MAAM,CAAC,MAAM,KAAK;AACxE,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf;AAAA,IACA,WAAW,OAAO,MAAM;AAAA,EAC1B;AACF;AAEA,eAAsB,iBAAiB,OAAqB,gBAAyB;AACnF,QAAM,SAAS,MAAM,oBAAoB,OAAO,cAAc;AAC9D,QAAM,UAAU,MAAM,YAAY,OAAO,MAAM,YAAY;AAC3D,QAAM,KAAK,gBAAgB,SAAS,OAAO,MAAM;AACjD,QAAM,eAAe,OAAO,MAAM,WAAW,EAAE;AAC/C,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,MAAM,OAAO,MAAM;AAAA,IACnB,aAAa,QAAQ;AAAA,EACvB;AACF;;;AC9FO,SAAS,WAAW,QAA8B;AACvD,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,mCAA8B,KAAK,UAAU,OAAO,KAAK,CAAC;AAAA,CAAI;AAEzE,MAAI,OAAO,MAAM,WAAW,GAAG;AAC7B,UAAM,KAAK,2CAA2C;AAAA,EACxD;AAEA,aAAW,KAAK,OAAO,OAAO;AAC5B,UAAM,UAAU,EAAE,SAAS,MAAM,EAAE,IAAI,OAAO,EAAE,MAAM,OAAO,MAAM,EAAE,IAAI;AACzE,UAAM,KAAK,OAAO;AAElB,QAAI,EAAE,WAAW,WAAW,GAAG;AAC7B,YAAM,KAAK,0BAA0B;AAAA,IACvC,OAAO;AACL,YAAM,KAAK,iBAAiB;AAC5B,iBAAW,KAAK,EAAE,WAAY,OAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACnD;AAEA,QAAI,EAAE,aAAa,KAAK,EAAE,SAAS,GAAG;AACpC,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,aAAa;AACxB,YAAM,KAAK,KAAK;AAChB,YAAM,KAAK,EAAE,aAAa,QAAQ,CAAC;AACnC,YAAM,KAAK,KAAK;AAAA,IAClB;AAEA,QAAI,EAAE,iBAAiB,QAAQ;AAC7B,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,cAAc,EAAE,gBAAgB,KAAK,IAAI,CAAC,EAAE;AAAA,IACzD;AAEA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,OAAO,gBAAgB,KAAK,GAAG;AACjC,UAAM,KAAK,KAAK;AAChB,UAAM,KAAK,0BAA0B;AACrC,UAAM,KAAK,OAAO,eAAe,KAAK,CAAC;AACvC,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,OAAO,WAAW;AACpB,UAAM,KAAK,oCAAoC;AAAA,EACjD;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;;;ACpDA,IAAM,kBAAkB,oBAAI,IAAgB,CAAC,YAAY,UAAU,OAAO,CAAC;AAC3E,IAAM,iBAAiB;AAEvB,SAAS,WAAW,SAAiB,WAAmB,SAAyB;AAC/E,QAAM,QAAQ,QAAQ,MAAM,OAAO;AACnC,SAAO,MAAM,MAAM,KAAK,IAAI,GAAG,YAAY,CAAC,GAAG,OAAO,EAAE,KAAK,IAAI;AACnE;AAEA,SAAS,YAAY,MAAc,SAA8B;AAC/D,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,QAAQ,IAAI,KAAK,EAAG,QAAO;AAC/B,aAAW,KAAK,SAAS;AACvB,QAAI,MAAM,SAAS,CAAC,KAAK,EAAE,SAAS,KAAK,EAAG,QAAO;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,SAAS,MAAsB;AACtC,MAAI,KAAK,UAAU,eAAgB,QAAO;AAC1C,SAAO,KAAK,MAAM,GAAG,cAAc,EAAE,QAAQ,IAAI;AACnD;AAEO,SAAS,mBACd,MACA,SACA,OACA,aACiB;AACjB,MAAI,eAAe,GAAG;AACpB,WAAO,EAAE,MAAM,IAAI,WAAW,GAAG,kBAAkB,CAAC,EAAE;AAAA,EACxD;AAEA,QAAM,UAAU,IAAI,IAAI,cAAc,KAAK,CAAC;AAC5C,QAAM,OAAO,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,QAAQ,gBAAgB,IAAI,EAAE,WAAW,CAAC;AAE7F,QAAM,SAAS,KACZ,IAAI,CAAC,OAAO,EAAE,KAAK,GAAG,OAAO,YAAY,EAAE,MAAM,OAAO,EAAE,EAAE,EAC5D,KAAK,CAAC,GAAG,MAAM;AACd,QAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAE5C,UAAM,QAAQ,EAAE,IAAI,WAAW,EAAE,IAAI,cAAc;AACnD,UAAM,QAAQ,EAAE,IAAI,WAAW,EAAE,IAAI,cAAc;AACnD,WAAO,QAAQ;AAAA,EACjB,CAAC;AAEH,QAAM,QAAkB,CAAC;AACzB,QAAM,UAAoB,CAAC;AAC3B,MAAI,OAAO;AAEX,aAAW,EAAE,KAAK,OAAAG,OAAM,KAAK,QAAQ;AAGnC,QAAIA,WAAU,KAAK,QAAQ,SAAS,EAAG;AAEvC,UAAM,OAAO,SAAS,WAAW,KAAK,SAAS,IAAI,YAAY,IAAI,QAAQ,CAAC;AAC5E,UAAM,SAAS,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,IAAI,IAAI,QAAQ;AAC5E,UAAM,QAAQ,GAAG,MAAM;AAAA,EAAK,IAAI;AAAA;AAChC,QAAI,OAAO,MAAM,SAAS,aAAa;AACrC,UAAI,QAAQ,SAAS,EAAG;AAExB,YAAM,YAAY,KAAK,IAAI,GAAG,cAAc,OAAO,OAAO,SAAS,EAAE;AACrE,UAAI,aAAa,EAAG;AACpB,YAAM,UAAU,KAAK,MAAM,GAAG,SAAS,EAAE,QAAQ,IAAI;AACrD,YAAM,aAAa,GAAG,MAAM;AAAA,EAAK,OAAO;AAAA;AACxC,YAAM,KAAK,UAAU;AACrB,cAAQ,KAAK,IAAI,IAAI;AACrB,cAAQ,WAAW;AACnB;AAAA,IACF;AACA,UAAM,KAAK,KAAK;AAChB,YAAQ,KAAK,IAAI,IAAI;AACrB,YAAQ,MAAM;AAAA,EAChB;AAEA,SAAO,EAAE,MAAM,MAAM,KAAK,IAAI,GAAG,WAAW,MAAM,kBAAkB,QAAQ;AAC9E;;;AClFO,SAAS,kBAAkB,MAAgB,SAAiC;AACjF,QAAM,OAAO,QACV,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,IAAI,EAClC,MAAM,EACN,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAE7C,SAAO,KAAK,IAAI,CAAC,MAAM,IAAI,EAAE,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC,EAAE;AAClE;;;ACPO,SAAS,iBAAiB,OAAoB,MAA4B;AAE/E,QAAM,gBAAgB,oBAAI,IAAsB;AAChD,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,OAAQ,eAAc,IAAI,EAAE,IAAI,CAAC;AAAA,EAClD;AAEA,QAAM,MAAkB,CAAC;AACzB,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,WAAW,EAAE,OAAO,KAAK,GAAI;AAC5C,UAAM,WAAW,cAAc,IAAI,EAAE,IAAI;AACzC,QAAI,YAAY,CAAC,IAAI,SAAS,QAAQ,EAAG,KAAI,KAAK,QAAQ;AAAA,EAC5D;AACA,SAAO;AACT;;;ACYA,IAAM,2BAA2B;AACjC,IAAM,4BAA4B;AAElC,SAASC,oBAAmB,OAAkC;AAC5D,SAAO,MAAM,MAAM,OAAO,CAAC,MAAuB,EAAE,SAAS,QAAQ;AACvE;AAEA,eAAsB,KAAK,OAAmB,MAAyC;AACrF,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,cAAc,eAAe;AACnC,QAAM,cAAc,KAAK,mBAAmB;AAC5C,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,UAAU,KAAK,WAAW,oBAAI,IAAoB;AAExD,QAAM,UAAUA,oBAAmB,KAAK,KAAK;AAE7C,QAAM,WAAgC,CAAC;AACvC,QAAM,mBAA6B,CAAC;AACpC,MAAI,OAAO;AACX,MAAI,YAAY;AAEhB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,kBAAkB,MAAM,OAAO;AAC3C,UAAM,YAAY,eAAe,iBAAiB,KAAK,OAAO,IAAI,IAAI,CAAC;AACvE,UAAM,YAAY,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI;AAE7C,UAAM,aACJ,KAAK,KAAK,SACV,IAAI,KAAK,IAAI,EAAE,SACf,UAAU,KAAK,GAAG,EAAE,SACpB;AAEF,QAAI,OAAO,aAAa,aAAa;AACnC,kBAAY;AACZ;AAAA,IACF;AAEA,UAAM,YAAY,cAAc,OAAO;AACvC,UAAM,eAAe,KAAK,IAAI,KAAK,MAAM,YAAY,WAAW,GAAG,yBAAyB;AAE5F,UAAM,SAAS,mBAAmB,MAAM,SAAS,KAAK,OAAO,YAAY;AAEzE,aAAS,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,QAAQ,QAAQ,IAAI,KAAK,IAAI;AAAA,MAC7B,YAAY;AAAA,MACZ,cAAc,OAAO;AAAA,MACrB,iBAAiB;AAAA,IACnB,CAAC;AAED,YAAQ,aAAa,OAAO;AAC5B,eAAW,KAAK,UAAW,KAAI,CAAC,iBAAiB,SAAS,CAAC,EAAG,kBAAiB,KAAK,CAAC;AAErF,QAAI,QAAQ,aAAa;AACvB,kBAAY;AACZ;AAAA,IACF;AAAA,EACF;AAEA,MAAI,SAAS,SAAS,MAAM,OAAQ,aAAY;AAEhD,QAAM,OAAO,WAAW;AAAA,IACtB,OAAO,KAAK;AAAA,IACZ,OAAO;AAAA,IACP;AAAA,EACF,CAAC;AACD,QAAM,gBAAgB,KAAK,KAAK,KAAK,SAAS,CAAC;AAE/C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,WAAW,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IACrC;AAAA,IACA;AAAA,EACF;AACF;;;AXjFA,IAAM,mBAAmB;AACzB,IAAM,cAAc,EAAE,MAAM,WAAW,SAAS,QAAQ;AAkBxD,IAAM,MAAM;AAAA,EACV,OAAO;AAAA,EACP,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,SAAS,GAAG,IAAe,QAAkC;AAC3D,SAAO,EAAE,SAAS,OAAO,IAAI,OAAO;AACtC;AAEA,SAAS,IAAI,IAAe,MAAc,SAAiB,MAAiC;AAC1F,SAAO,EAAE,SAAS,OAAO,IAAI,OAAO,EAAE,MAAM,SAAS,KAAK,EAAE;AAC9D;AAEA,SAAS,YAAY,MAAc;AACjC,SAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,KAAK,CAAC,GAAG,SAAS,MAAM;AAC7D;AAEA,SAAS,aAAa,SAAiB;AACrC,SAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,QAAQ,CAAC,GAAG,SAAS,KAAK;AACrE;AAEA,IAAM,QAAQ;AAAA,EACZ;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,OAAO;AAAA,IACpB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,QAAQ,EAAE,MAAM,UAAU,aAAa,sCAAsC;AAAA,MAC/E;AAAA,MACA,UAAU,CAAC,QAAQ;AAAA,IACrB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,OAAO;AAAA,IACpB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM,EAAE,MAAM,UAAU,aAAa,8CAAyC;AAAA,QAC9E,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,MAAM,CAAC,YAAY,QAAQ,QAAQ,QAAQ,SAAS;AAAA,UACpD,aAAa;AAAA,QACf;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,aAAa;AAAA,QACf;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,SAAS;AAAA,UACxB,aAAa;AAAA,QACf;AAAA,MACF;AAAA,MACA,UAAU,CAAC,QAAQ,MAAM;AAAA,IAC3B;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,MAAM,CAAC,YAAY,QAAQ,QAAQ,QAAQ,SAAS;AAAA,UACpD,aAAa;AAAA,QACf;AAAA,QACA,QAAQ,EAAE,MAAM,UAAU,aAAa,sCAAsC;AAAA,QAC7E,OAAO,EAAE,MAAM,UAAU,aAAa,yCAAyC;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,UAAU;AAAA,UACR,MAAM;AAAA,UACN,aACE;AAAA,QACJ;AAAA,QACA,OAAO,EAAE,MAAM,UAAU,aAAa,0BAA0B;AAAA,MAClE;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM,EAAE,MAAM,UAAU,aAAa,mCAAmC;AAAA,MAC1E;AAAA,MACA,UAAU,CAAC,MAAM;AAAA,IACnB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,aAAa;AAAA,QACf;AAAA,QACA,OAAO,EAAE,MAAM,UAAU,aAAa,mCAAmC;AAAA,MAC3E;AAAA,MACA,UAAU,CAAC,QAAQ;AAAA,IACrB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO,EAAE,MAAM,UAAU,aAAa,qCAAqC;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM,EAAE,MAAM,UAAU,aAAa,0CAA0C;AAAA,MACjF;AAAA,MACA,UAAU,CAAC,MAAM;AAAA,IACnB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aACE;AAAA,IACF,aAAa;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO,EAAE,MAAM,UAAU,aAAa,qCAAqC;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAe,SACb,MACA,MACA,KACA;AACA,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,cAAc,MAAM,GAAG;AAAA,IAChC,KAAK;AACH,aAAO,UAAU,MAAM,GAAG;AAAA,IAC5B,KAAK;AACH,aAAO,kBAAkB,MAAM,GAAG;AAAA,IACpC,KAAK;AACH,aAAO,gBAAgB,MAAM,GAAG;AAAA,IAClC,KAAK;AACH,aAAO,cAAc,MAAM,GAAG;AAAA,IAChC,KAAK;AACH,aAAO,eAAe,MAAM,GAAG;AAAA,IACjC,KAAK;AACH,aAAO,YAAY,IAAI;AAAA,IACzB,KAAK;AACH,aAAO,YAAY,MAAM,GAAG;AAAA,IAC9B,KAAK;AACH,aAAO,SAAS,MAAM,GAAG;AAAA,IAC3B,KAAK;AACH,aAAO,WAAW,MAAM,GAAG;AAAA,IAC7B,KAAK;AACH,aAAO,iBAAiB,MAAM,GAAG;AAAA,IACnC;AACE,aAAO,aAAa,iBAAiB,IAAI,EAAE;AAAA,EAC/C;AACF;AAEA,SAAS,YAAY,MAA2C;AAC9D,QAAM,OAAO,OAAO,MAAM,SAAS,WAAW,KAAK,OAAO;AAC1D,MAAI,CAAC,KAAM,QAAO,aAAa,2CAA2C;AAC1E,QAAM,SAAS,KAAK,KAAK,KAAK,SAAS,CAAC;AACxC,SAAO,YAAY,KAAK,UAAU,EAAE,QAAQ,QAAQ,oBAAoB,OAAO,KAAK,OAAO,CAAC,CAAC;AAC/F;AAEA,SAAS,YAAY,MAA2C,KAAoB;AAClF,QAAM,YAAY,OAAO,MAAM,WAAW,WAAW,KAAK,OAAO,KAAK,IAAI;AAC1E,QAAM,WAAW,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAC9F,MAAI,CAAC,UAAW,QAAO,aAAa,6CAA6C;AAIjF,MAAI,UAAU,SAAS,IAAI,EAAG,QAAO,kBAAkB,WAAW,UAAU,GAAG;AAE/E,QAAM,WAAW;AACjB,QAAM,OAAO,IAAI,MAAM,MAAM,KAAK,CAAC,MAAqB,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ;AAChG,MAAI,CAAC,KAAM,QAAO,aAAa,oCAAoC,QAAQ,EAAE;AAK7E,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,SAAU,gBAAe,IAAI,EAAE,IAAI,QAAQ,EAAE,IAAI,EAAE;AAAA,EACpE;AACA,QAAM,WAAW,oBAAI,IAAmD;AACxE,QAAM,cAAc,CAAC,IAAY,MAAc,SAAuB;AACpE,UAAM,OAAO,SAAS,IAAI,EAAE,KAAK,CAAC;AAClC,SAAK,KAAK,EAAE,MAAM,KAAK,CAAC;AACxB,aAAS,IAAI,IAAI,IAAI;AAAA,EACvB;AACA,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,aAAa,EAAE,SAAS,SAAS;AAC9C,kBAAY,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI;AAAA,IAClC,WAAW,EAAE,SAAS,SAAS;AAC7B,YAAM,WAAW,eAAe,IAAI,EAAE,IAAI;AAC1C,YAAM,SAAS,eAAe,IAAI,EAAE,EAAE;AACtC,UAAI,YAAY,UAAU,aAAa,OAAQ,aAAY,QAAQ,UAAU,OAAO;AAAA,IACtF;AAAA,EACF;AAQA,QAAM,UAAU,oBAAI,IAAY,CAAC,KAAK,EAAE,CAAC;AACzC,QAAM,OAAc,CAAC;AACrB,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,KAAK,IAAI,MAAM,MAAO,KAAI,EAAE,SAAS,OAAQ,UAAS,IAAI,EAAE,IAAI,EAAE,IAAI;AAEjF,MAAI,WAAW,CAAC,KAAK,EAAE;AACvB,WAAS,IAAI,GAAG,KAAK,UAAU,KAAK;AAClC,UAAM,OAAiB,CAAC;AACxB,eAAW,OAAO,UAAU;AAC1B,YAAM,UAAU,SAAS,IAAI,GAAG,KAAK,CAAC;AACtC,iBAAW,KAAK,SAAS;AACvB,YAAI,QAAQ,IAAI,EAAE,IAAI,EAAG;AACzB,gBAAQ,IAAI,EAAE,IAAI;AAClB,aAAK,KAAK,EAAE,IAAI;AAChB,cAAM,OAAO,SAAS,IAAI,EAAE,IAAI,KAAK,EAAE;AACvC,aAAK,KAAK,EAAE,MAAM,OAAO,GAAG,KAAK,EAAE,KAAK,CAAC;AAAA,MAC3C;AAAA,IACF;AACA,eAAW;AACX,QAAI,KAAK,WAAW,EAAG;AAAA,EACzB;AAEA,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO,YAAY,sBAAsB,QAAQ;AAAA;AAAA,0CAA0C;AAAA,EAC7F;AAEA,OAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACrE,QAAM,QAAQ,CAAC,sBAAsB,QAAQ,mBAAc,QAAQ,KAAK,EAAE;AAC1E,QAAM,KAAK,GAAG,KAAK,MAAM,qBAAqB;AAC9C,aAAW,KAAK,MAAM;AACpB,UAAM,KAAK,aAAa,EAAE,KAAK,QAAQ,EAAE,IAAI,YAAY,EAAE,GAAG,IAAI;AAAA,EACpE;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAMA,SAAS,kBAAkB,WAAmB,UAAkB,KAAoB;AAClF,QAAM,CAAC,SAAS,MAAM,IAAI,UAAU,MAAM,MAAM,CAAC;AACjD,QAAM,YAAY,WAAW,IAAI,KAAK;AACtC,QAAM,WAAW,UAAU,IAAI,KAAK;AACpC,MAAI,CAAC,QAAS,QAAO,aAAa,yDAAyD;AAE3F,QAAM,WAAW,kBAAkB,IAAI,OAAO,QAAQ;AACtD,MAAI,eAAe,UAAU;AAC3B,UAAM,QAAQ,SAAS,UAAU,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI;AACtD,WAAO;AAAA,MACL,kBAAkB,QAAQ,6BAA6B,KAAK;AAAA,IAC9D;AAAA,EACF;AACA,MAAI,UAAU,SAAU,QAAO,aAAa,oCAAoC,QAAQ,EAAE;AAC1F,QAAM,WAAW,SAAS;AAE1B,QAAM,SAAS,IAAI,MAAM,MAAM;AAAA,IAC7B,CAAC,MAAuB,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS,QAAQ,EAAE,SAAS;AAAA,EACxF;AACA,MAAI,CAAC;AACH,WAAO,aAAa,yBAAyB,OAAO,kBAAkB,SAAS,IAAI,EAAE;AAGvF,QAAM,eAAe,oBAAI,IAAsB;AAC/C,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,WAAW,EAAE,SAAS,EAAE,GAAI;AAC3C,UAAM,OAAO,aAAa,IAAI,EAAE,EAAE,KAAK,CAAC;AACxC,SAAK,KAAK,EAAE,IAAI;AAChB,iBAAa,IAAI,EAAE,IAAI,IAAI;AAAA,EAC7B;AACA,QAAM,UAAU,oBAAI,IAAwB;AAC5C,aAAW,KAAK,IAAI,MAAM,MAAO,KAAI,EAAE,SAAS,SAAU,SAAQ,IAAI,EAAE,IAAI,CAAC;AAQ7E,QAAM,UAAU,oBAAI,IAAY,CAAC,OAAO,EAAE,CAAC;AAC3C,QAAM,OAAc,CAAC;AACrB,MAAI,WAAW,CAAC,OAAO,EAAE;AACzB,WAAS,IAAI,GAAG,KAAK,UAAU,KAAK;AAClC,UAAM,OAAiB,CAAC;AACxB,eAAW,OAAO,UAAU;AAC1B,iBAAW,UAAU,aAAa,IAAI,GAAG,KAAK,CAAC,GAAG;AAChD,YAAI,QAAQ,IAAI,MAAM,EAAG;AACzB,gBAAQ,IAAI,MAAM;AAClB,aAAK,KAAK,MAAM;AAChB,cAAM,IAAI,QAAQ,IAAI,MAAM;AAC5B,YAAI,EAAG,MAAK,KAAK,EAAE,MAAM,EAAE,MAAM,MAAM,EAAE,MAAM,MAAM,EAAE,YAAY,OAAO,EAAE,CAAC;AAAA,MAC/E;AAAA,IACF;AACA,eAAW;AACX,QAAI,KAAK,WAAW,EAAG;AAAA,EACzB;AAEA,QAAM,SAAS,sBAAsB,SAAS,IAAI,KAAK,OAAO,IAAI,4BAAuB,QAAQ;AACjG,MAAI,KAAK,WAAW,GAAG;AACrB,UAAMC,SAAQ,kBAAkB,IAAI,OAAO,CAAC,SAAS,IAAI,CAAC;AAC1D,WAAO;AAAA,MACL,GAAG,MAAM;AAAA;AAAA,sCAAsCA,SAAQ;AAAA;AAAA,EAAOA,MAAK,KAAK,EAAE;AAAA,IAC5E;AAAA,EACF;AACA,OAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,OAAO,EAAE,IAAI;AACxF,QAAM,QAAQ,CAAC,QAAQ,IAAI,GAAG,KAAK,MAAM,oBAAoB;AAC7D,aAAW,KAAK,KAAM,OAAM,KAAK,aAAa,EAAE,KAAK,QAAQ,EAAE,IAAI,aAAQ,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE;AAC7F,QAAM,QAAQ,kBAAkB,IAAI,OAAO,CAAC,SAAS,MAAM,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACtF,MAAI,OAAO;AACT,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,KAAK;AAAA,EAClB;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAIA,SAAS,kBAAkB,OAAoB,WAA6B;AAC1E,QAAM,aAAa,oBAAI,IAAsB;AAC7C,aAAW,KAAK,MAAM,MAAO,KAAI,EAAE,SAAS,OAAQ,YAAW,IAAI,EAAE,MAAM,CAAC;AAC5E,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,QAAkB,CAAC;AACzB,aAAW,KAAK,IAAI,IAAI,SAAS,GAAG;AAClC,UAAM,KAAK,WAAW,IAAI,CAAC;AAC3B,QAAI,CAAC,GAAI;AACT,eAAW,KAAK,iBAAiB,OAAO,EAAE,GAAG;AAC3C,UAAI,CAAC,KAAK,IAAI,EAAE,IAAI,GAAG;AACrB,aAAK,IAAI,EAAE,IAAI;AACf,cAAM,KAAK,EAAE,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,QAAQ,MAAM,MAAM,GAAG,eAAe;AAC5C,QAAM,UAAU,MAAM,SAAS,MAAM;AACrC,SAAO,8BAA8B,MAAM,KAAK,QAAK,CAAC,GAAG,UAAU,IAAI,WAAM,OAAO,UAAU,EAAE;AAClG;AAEA,IAAM,wBAAwB;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,cAAc,MAAuB;AAC5C,SAAO,sBAAsB,KAAK,CAAC,OAAO,GAAG,KAAK,IAAI,CAAC;AACzD;AAEA,SAAS,SAAS,MAA2C,KAAoB;AAC/E,QAAM,QAAQ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE3F,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,aAAa,EAAE,SAAS,QAAS,aAAY,IAAI,EAAE,EAAE;AAAA,EACtE;AAEA,QAAM,aAAa,IAAI,MAAM,MAC1B,OAAO,CAAC,MAAqB,EAAE,SAAS,MAAM,EAC9C,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC,EACpC,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC;AAEvC,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL;AAAA;AAAA;AAAA,IACF;AAAA,EACF;AAEA,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACtD,QAAM,QAAQ,WAAW,MAAM,GAAG,KAAK;AACvC,QAAM,QAAQ,CAAC,8CAA8C,EAAE;AAC/D,QAAM;AAAA,IACJ,GAAG,MAAM,MAAM,OAAO,WAAW,MAAM;AAAA,EACzC;AACA,QAAM,KAAK,EAAE;AACb,aAAW,KAAK,OAAO;AACrB,UAAM,KAAK,OAAO,EAAE,IAAI,IAAI;AAAA,EAC9B;AACA,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAEA,IAAM,WAAW;AACjB,IAAM,eAAe;AAErB,SAAS,YAAY,GAAuB;AAC1C,QAAM,MAAM,EAAE,UAAU,KAAK,EAAE,MAAM,GAAG,YAAY;AACpD,SAAO,UAAK,GAAG,uCAAkC,EAAE,IAAI,KAAK,EAAE,IAAI,QAAQ,EAAE,WAAW,MAAM,EAAE,UAAU;AAC3G;AAEA,IAAM,aAAa,CAAC,GAAe,MACjC,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,KAAK;AAK3E,SAAS,WAAW,MAA2C,KAAoB;AACjF,QAAM,OAAO,OAAO,MAAM,SAAS,WAAW,KAAK,KAAK,KAAK,IAAI;AACjE,MAAI,CAAC,KAAM,QAAO,aAAa,0CAA0C;AAEzE,QAAM,UAAU,IAAI,MAAM,MAAM,OAAO,CAAC,MAAuB,EAAE,SAAS,QAAQ;AAClF,QAAM,QAAQ,KAAK,YAAY;AAE/B,QAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,IAAI;AACnD,QAAM,YACJ,MAAM,SAAS,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,KAAK,YAAY,MAAM,KAAK;AAEjF,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,SAAS,UAAU,MAAM,EAAE,KAAK,UAAU;AAChD,UAAMC,SAAQ,OAAO,MAAM,GAAG,QAAQ;AACtC,UAAMC,WAAU,OAAO,SAASD,OAAM;AACtC,UAAME,SAAQ;AAAA,MACZ,mBAAmB,IAAI;AAAA,MACvB;AAAA,MACA,kBAAkB,OAAO,MAAM;AAAA,MAC/B,GAAGF,OAAM,IAAI,WAAW;AAAA,IAC1B;AACA,QAAIC,WAAU,EAAG,CAAAC,OAAM,KAAK,UAAKD,QAAO,OAAO;AAC/C,WAAO,YAAYC,OAAM,KAAK,IAAI,CAAC;AAAA,EACrC;AAEA,QAAM,SAAS,IAAI,IAAI,cAAc,IAAI,CAAC;AAC1C,QAAM,SAAS,QACZ,IAAI,CAAC,MAAM;AACV,UAAM,IAAI,EAAE,KAAK,YAAY;AAC7B,QAAIC,SAAQ;AACZ,QAAI,EAAE,SAAS,KAAK,KAAK,MAAM,SAAS,CAAC,EAAG,CAAAA,UAAS;AACrD,eAAW,KAAK,OAAQ,KAAI,EAAE,SAAS,CAAC,EAAG,CAAAA,UAAS;AACpD,WAAO,EAAE,GAAG,OAAAA,OAAM;AAAA,EACpB,CAAC,EACA,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EACzB,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;AAE3D,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,MACL,mBAAmB,IAAI;AAAA;AAAA,sBAA4B,IAAI;AAAA,IACzD;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,MAAM,GAAG,QAAQ;AACtC,QAAM,UAAU,OAAO,SAAS,MAAM;AACtC,QAAM,QAAQ;AAAA,IACZ,mBAAmB,IAAI;AAAA,IACvB;AAAA,IACA,kCAAkC,OAAO,MAAM;AAAA,IAC/C,GAAG,MAAM,IAAI,CAAC,MAAM,YAAY,EAAE,CAAC,CAAC;AAAA,EACtC;AACA,MAAI,UAAU,EAAG,OAAM,KAAK,UAAK,OAAO,OAAO;AAC/C,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAIA,IAAM,cAAc,oBAAI,IAAI;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKD,SAAS,iBAAiB,MAA2C,KAAoB;AACvF,QAAM,QAAQ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE3F,QAAM,aAAa,oBAAI,IAAmD;AAC1E,QAAM,cAAc,oBAAI,IAAyB;AACjD,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,YAAY,CAAC,YAAY,IAAI,EAAE,WAAW,EAAG;AAC5D,KAAC,WAAW,IAAI,EAAE,IAAI,KAAK,WAAW,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,GAAI,KAAK;AAAA,MACvE,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,IACV,CAAC;AACD,KAAC,YAAY,IAAI,EAAE,IAAI,KAAK,YAAY,IAAI,EAAE,MAAM,oBAAI,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,GAAI,IAAI,EAAE,IAAI;AAAA,EACzF;AAEA,QAAM,OAAO,CAAC,GAAG,WAAW,QAAQ,CAAC,EAClC,OAAO,CAAC,CAAC,IAAI,OAAO,YAAY,IAAI,IAAI,GAAG,QAAQ,MAAM,CAAC,EAC1D,IAAI,CAAC,CAAC,MAAM,IAAI,OAAO;AAAA,IACtB;AAAA,IACA,MAAM,KACH,MAAM,EACN,KAAK,CAAC,GAAG,MAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,KAAK,CAAE;AAAA,EACpF,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAE/E,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA,MACL;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,KAAK,MAAM,GAAG,KAAK;AACjC,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA,GAAG,MAAM,MAAM,OAAO,KAAK,MAAM;AAAA,IACjC;AAAA,EACF;AACA,aAAW,KAAK,OAAO;AACrB,UAAM;AAAA,MACJ,OAAO,EAAE,IAAI,OAAO,EAAE,KAAK,MAAM,MAAM,EAAE,KAAK,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,QAAK,CAAC;AAAA,IAC7F;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAEA,eAAe,cAAc,MAA2C,KAAoB;AAC1F,QAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,KAAK,QAAQ;AAC7D,MAAI,CAAC,MAAO,QAAO,aAAa,8CAA8C;AAK9E,QAAM,YAAY,MAAM,SAAS,IAAI,OAAO,OAAO;AAAA,IACjD,qBAAqB,IAAI,SAAS,gBAAgB,KAAK,KAAK,GAAI;AAAA,IAChE,mBAAmB,mBAAmB;AAAA,IACtC,aAAa,IAAI,OAAO,gBAAgB;AAAA,EAC1C,CAAC;AACD,QAAM,SAAS,MAAM,KAAK,UAAU,OAAO,EAAE,OAAO,OAAO,IAAI,MAAM,CAAC;AAKtE,QAAM,UAAU,KAAK,EAAE,IAAI,OAAO,GAAG,MAAM,IAAI,QAAQ,YAAY,MAAM,CAAC;AAE1E,QAAM,SACJ,eAAe,UAAU,UAAU;AAAA,SACzB,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,IAAI,KAAK,QAAQ;AAAA,UACxD,UAAU,MAAM;AAAA;AAG7B,SAAO,YAAY,GAAG,MAAM;AAAA,EAAK,OAAO,IAAI,EAAE;AAChD;AASO,SAAS,kBAAkB,OAAoB,UAAoC;AACxF,QAAM,QAAQ,MAAM,MAAM,OAAO,CAAC,MAAqB,EAAE,SAAS,MAAM;AACxE,QAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ;AACnD,MAAI,MAAO,QAAO,EAAE,MAAM,MAAM;AAEhC,QAAM,SAAS,MAAM;AACrB,QAAM,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,KAAK,SAAS,MAAM,CAAC;AAC3D,MAAI,QAAQ,WAAW,EAAG,QAAO,EAAE,MAAM,QAAQ,CAAC,EAAG;AACrD,MAAI,QAAQ,SAAS,EAAG,QAAO,EAAE,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE;AACvE,SAAO,EAAE,MAAM,KAAK;AACtB;AAEA,IAAM,eAAe;AACrB,IAAM,mBAAmB;AACzB,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AAUjB,SAAS,gBACd,QACA,OACA,WAAW,WAAW,EAAE,kBAChB;AACR,QAAM,UAAU,oBAAI,IAAwB;AAC5C,aAAW,KAAK,MAAM,MAAO,KAAI,EAAE,SAAS,SAAU,SAAQ,IAAI,EAAE,IAAI,CAAC;AAEzE,QAAM,YAAsB,CAAC;AAC7B,QAAM,YAAsB,CAAC;AAC7B,QAAM,aAAa,oBAAI,IAAY;AACnC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,QAAS;AACxB,QAAI,EAAE,SAAS,OAAO,MAAM,EAAE,OAAO,OAAO,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,GAAG;AACvE,iBAAW,IAAI,EAAE,EAAE;AACnB,gBAAU,KAAK,EAAE,EAAE;AAAA,IACrB,WAAW,EAAE,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO,MAAM,CAAC,WAAW,IAAI,EAAE,IAAI,GAAG;AAChF,iBAAW,IAAI,EAAE,IAAI;AACrB,gBAAU,KAAK,EAAE,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,QAAMC,WAAU,CAAC,QACf,IAAI,IAAI,CAAC,OAAO,QAAQ,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,MAAuB,CAAC,CAAC,CAAC;AACrE,QAAM,UAAUA,SAAQ,SAAS,EAAE;AAAA,IAAK,CAAC,GAAG,MAC1C,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,KAAK;AAAA,EAC3E;AACA,QAAM,UAAUA,SAAQ,SAAS;AAEjC,MAAI,QAAQ,WAAW,KAAK,QAAQ,WAAW,EAAG,QAAO;AAEzD,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO;AAEX,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,OAAO;AACb,UAAM,KAAK,IAAI;AACf,YAAQ,KAAK,SAAS;AACtB,QAAI,QAAQ;AACZ,eAAW,KAAK,QAAQ,MAAM,GAAG,gBAAgB,GAAG;AAClD,YAAM,MAAM,EAAE,UAAU,KAAK,EAAE,MAAM,GAAG,YAAY;AACpD,YAAM,QAAQ,UAAK,GAAG,uCAAkC,EAAE,IAAI,KAAK,EAAE,IAAI;AACzE,UAAI,OAAO,MAAM,SAAS,IAAI,SAAU;AACxC,YAAM,KAAK,KAAK;AAChB,cAAQ,MAAM,SAAS;AACvB,eAAS;AAAA,IACX;AACA,UAAM,UAAU,QAAQ,SAAS;AACjC,QAAI,UAAU,EAAG,OAAM,KAAK,UAAK,OAAO,OAAO;AAAA,EACjD;AAEA,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAMC,OAAM,MAAM,SAAS,IAAI,IAAI;AACnC,UAAM,OAAO,YAAY,QAAQ,MAAM;AACvC,UAAM,QAAkB,CAAC;AACzB,QAAI,QAAQ,OAAOA,OAAM,KAAK;AAC9B,eAAW,KAAK,QAAQ,MAAM,GAAG,gBAAgB,GAAG;AAClD,YAAM,OAAO,GAAG,EAAE,IAAI,WAAM,EAAE,IAAI;AAClC,YAAMC,QAAO,MAAM,SAAS,IAAI,IAAI;AACpC,UAAI,QAAQA,QAAO,KAAK,SAAS,SAAU;AAC3C,YAAM,KAAK,IAAI;AACf,eAASA,QAAO,KAAK;AAAA,IACvB;AACA,QAAI,MAAM,SAAS,EAAG,OAAM,KAAK,EAAE;AACnC,QAAI,MAAM,SAAS,GAAG;AACpB,YAAM,UAAU,QAAQ,SAAS,MAAM;AACvC,YAAM,KAAK,OAAO,MAAM,KAAK,QAAK,KAAK,UAAU,IAAI,WAAM,OAAO,UAAU,GAAG;AAAA,IACjF,OAAO;AACL,YAAM,KAAK,YAAY,QAAQ,MAAM,WAAW;AAAA,IAClD;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AASO,SAAS,iBAAiB,QAAoB,OAA4B;AAC/E,QAAM,WAAW,MAAM,MAAM;AAAA,IAC3B,CAAC,MAAqB,EAAE,SAAS,UAAU,EAAE,SAAS,OAAO;AAAA,EAC/D;AACA,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,QAAQ,iBAAiB,OAAO,QAAQ;AAC9C,MAAI,MAAM,SAAS,GAAG;AACpB,UAAM,QAAQ,MAAM,MAAM,GAAG,eAAe,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAC/D,UAAM,UAAU,MAAM,SAAS,MAAM;AACrC,UAAM,OAAO,UAAU,IAAI,WAAM,OAAO,UAAU;AAClD,WAAO,uBAAuB,MAAM,KAAK,QAAK,CAAC,GAAG,IAAI;AAAA,EACxD;AAEA,MAAI,cAAc,OAAO,IAAI,EAAG,QAAO;AACvC,SAAO;AACT;AAEA,eAAe,UAAU,MAA2C,KAAoB;AACtF,QAAM,SAAS,OAAO,MAAM,WAAW,WAAW,KAAK,SAAS;AAChE,MAAI,CAAC,OAAQ,QAAO,aAAa,2CAA2C;AAE5E,QAAM,CAAC,SAAS,UAAU,IAAI,OAAO,SAAS,IAAI,IAAI,OAAO,MAAM,MAAM,CAAC,IAAI,CAAC,QAAQ,MAAS;AAChG,QAAM,YAAY,WAAW,IAAI,KAAK;AAEtC,QAAM,WAAW,kBAAkB,IAAI,OAAO,QAAQ;AACtD,MAAI,eAAe,UAAU;AAC3B,UAAM,QAAQ,SAAS,UAAU,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI;AACtD,UAAM,OAAO,SAAS,UAAU,SAAS,IAAI,aAAQ;AACrD,WAAO;AAAA,MACL,gBAAgB,QAAQ,6BAA6B,KAAK,GAAG,IAAI;AAAA,IACnE;AAAA,EACF;AACA,MAAI,UAAU,UAAU;AACtB,WAAO,aAAa,wCAAwC,QAAQ,EAAE;AAAA,EACxE;AACA,QAAM,WAAW,SAAS;AAI1B,QAAM,UAAU,KAAK,EAAE,IAAI,OAAO,GAAG,MAAM,SAAS,MAAM,QAAQ,OAAO,CAAC;AAE1E,MAAI,CAAC,YAAY;AACf,WAAO,YAAY,KAAK,SAAS,IAAI;AAAA;AAAA,EAAO,SAAS,OAAO,EAAE;AAAA,EAChE;AAEA,QAAM,WAAW,WAAW,KAAK;AACjC,QAAM,SAAS,IAAI,MAAM,MAAM;AAAA,IAC7B,CAAC,MAAuB,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS,QAAQ,EAAE,SAAS;AAAA,EACxF;AACA,MAAI,CAAC,QAAQ;AACX,WAAO,aAAa,uBAAuB,QAAQ,kBAAkB,SAAS,IAAI,EAAE;AAAA,EACtF;AAEA,QAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO;AAC5C,QAAM,OAAO,MAAM,MAAM,OAAO,aAAa,GAAG,OAAO,QAAQ,EAAE,KAAK,IAAI;AAQ1E,QAAM,SAAS,KAAK,IAAI,GAAG,OAAO,aAAa,CAAC;AAChD,QAAM,QAAQ,OAAO,WAAW,OAAO,aAAa,IAAI;AACxD,QAAM,WACJ;AAAA;AAAA;AAAA,oCAAyC,SAAS,IAAI,aAAa,MAAM,WAAW,KAAK,iEAC/B,KAAK;AAEjE,QAAM,OAAO,gBAAgB,QAAQ,IAAI,KAAK;AAC9C,QAAM,YAAY,OAAO;AAAA;AAAA;AAAA,EAAY,IAAI,KAAK;AAE9C,QAAM,QAAQ,iBAAiB,QAAQ,IAAI,KAAK;AAChD,QAAM,aAAa,QAAQ;AAAA;AAAA;AAAA,EAAY,KAAK,KAAK;AAEjD,SAAO;AAAA,IACL,KAAK,SAAS,IAAI,KAAK,OAAO,IAAI,OAAO,OAAO,UAAU,IAAI,OAAO,QAAQ;AAAA;AAAA,EAAQ,IAAI,GAAG,SAAS,GAAG,UAAU,GAAG,QAAQ;AAAA,EAC/H;AACF;AAEA,IAAM,cAAc,oBAAI,IAAY;AAEpC,eAAe,kBAAkB,MAA2C,KAAoB;AAC9F,QAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,IAClC,KAAK,MAAoB,OAAO,CAAC,MAAM,OAAO,MAAM,QAAQ,IAC7D,CAAC;AACL,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO;AACb,gBAAY,IAAI,IAAI;AAIpB,UAAM,WAAW,kBAAkB,IAAI,OAAO,IAAI;AAClD,UAAM,UAAU,KAAK;AAAA,MACnB,IAAI,OAAO;AAAA,MACX,MAAM,UAAU,WAAW,SAAS,KAAK,OAAO;AAAA,MAChD,QAAQ;AAAA,IACV,CAAC;AAAA,EACH;AACA,SAAO;AAAA,IACL,cAAc,MAAM,MAAM,gDAAgD,YAAY,IAAI;AAAA,EAC5F;AACF;AAEO,SAAS,qBAA+B;AAC7C,SAAO,MAAM,KAAK,WAAW;AAC/B;AAEA,IAAM,cAAc,oBAAI,IAAe,CAAC,YAAY,QAAQ,QAAQ,QAAQ,SAAS,CAAC;AAEtF,eAAe,gBAAgB,MAA2C,KAAoB;AAC5F,QAAM,OAAO,OAAO,MAAM,SAAS,WAAW,KAAK,KAAK,KAAK,IAAI;AACjE,QAAM,UAAU,OAAO,MAAM,SAAS,WAAW,KAAK,OAAO;AAC7D,MAAI,CAAC,KAAM,QAAO,aAAa,+CAA+C;AAC9E,MAAI,CAAC,YAAY,IAAI,OAAoB,GAAG;AAC1C,WAAO;AAAA,MACL,2CAA2C,MAAM,KAAK,WAAW,EAAE,KAAK,IAAI,CAAC;AAAA,IAC/E;AAAA,EACF;AACA,QAAM,OAAO,MAAM,QAAQ,MAAM,IAAI,IAChC,KAAK,KAAmB,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,IACzE,CAAC;AACL,QAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,IAClC,KAAK,MAAoB,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,IAC1E,CAAC;AAEL,QAAM,SAAS,MAAM,cAAc,IAAI,OAAO;AAAA,IAC5C;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,cAAc,OAAO,MAAM,IAAI,eAAe,OAAO,MAAM;AAAA,UAC9C,OAAO,SAAS;AAAA,wBACF,OAAO,aAAa;AAAA,EACjD;AACF;AAEA,IAAM,2BAA2B,KAAK,KAAK;AAE3C,SAAS,eAAe,MAA2C,KAAoB;AACrF,QAAM,UACJ,OAAO,MAAM,aAAa,YAAY,OAAO,SAAS,KAAK,QAAQ,IAC/D,KAAK,WACL,KAAK,IAAI,IAAI;AACnB,QAAM,QACJ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE/E,MAAI,SAAS,IAAI,SAAS,UAAU,OAAO;AAC3C,MAAI,MAAO,UAAS,OAAO,MAAM,CAAC,KAAK;AAEvC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,YAAY,kCAAkC,IAAI,KAAK,OAAO,EAAE,YAAY,CAAC,GAAG;AAAA,EACzF;AAEA,QAAM,QAAQ,CAAC,4BAA4B,OAAO,MAAM,YAAY,EAAE;AACtE,aAAW,KAAK,QAAQ;AACtB,QAAI,UAAU,GAAG;AACf,YAAM,KAAK,OAAO,EAAE,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,EAAE,IAAI;AAAA,IACrD,OAAO;AACL,YAAM,UAAU,KAAK,UAAU,EAAE,OAAO;AACxC,YAAM,KAAK,OAAO,EAAE,IAAI,MAAM,OAAO,OAAO,EAAE,EAAE,IAAI;AAAA,IACtD;AAAA,EACF;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAEA,eAAe,cAAc,MAA2C,KAAoB;AAC1F,QAAM,OACJ,OAAO,MAAM,SAAS,YAAY,YAAY,IAAI,KAAK,IAAiB,IACnE,KAAK,OACN;AACN,QAAM,SAAS,OAAO,MAAM,WAAW,WAAW,KAAK,SAAS;AAChE,QAAM,QACJ,OAAO,MAAM,UAAU,YAAY,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI;AAE/E,QAAM,SAAS,MAAM,cAAc,IAAI,OAAO,EAAE,MAAM,QAAQ,MAAM,CAAC;AAErE,MAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,UAAM,SAAS,OAAO,aAAa,IAAI,MAAM;AAC7C,WAAO,YAAY,qBAAqB,MAAM,eAAe,OAAO,MAAM,IAAI;AAAA,EAChF;AAEA,QAAM,QAAQ,CAAC,oCAA+B,OAAO,MAAM,IAAI,EAAE;AACjE,aAAW,KAAK,OAAO,SAAS;AAC9B,UAAM,OAAO,EAAE,KAAK,SAAS,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,MAAM;AACzD,UAAM,KAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,MAAM,EAAE,OAAO,EAAE;AAC7D,QAAI,EAAE,MAAM,OAAQ,OAAM,KAAK,YAAY,EAAE,MAAM,KAAK,IAAI,CAAC,EAAE;AAAA,EACjE;AACA,SAAO,YAAY,MAAM,KAAK,IAAI,CAAC;AACrC;AAKA,eAAe,YAAY,KAAoB,MAA6B;AAC1E,MAAI;AACF,UAAMC,OAAMC,SAAQ,IAAI,MAAM,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAMC;AAAA,MACJ,IAAI,MAAM;AAAA,MACV,KAAK,UAAU,EAAE,KAAI,oBAAI,KAAK,GAAE,YAAY,GAAG,KAAK,CAAC,IAAI;AAAA,MACzD;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACF;AAOA,eAAe,UAAU,KAAoB,IAAgC;AAC3E,MAAI;AACF,QAAI,IAAI,MAAO,OAAM,IAAI,MAAM,OAAO,EAAE;AAAA,QACnC,OAAM,aAAa,IAAI,MAAM,WAAW,EAAE;AAAA,EACjD,QAAQ;AAAA,EAER;AACF;AAEA,SAAS,SAAiB;AACxB,UAAO,oBAAI,KAAK,GAAE,YAAY;AAChC;AAEA,eAAsB,iBACpB,MACA,KAC0B;AAC1B,MAAI,CAAC,QAAQ,OAAO,SAAS,UAAU;AACrC,WAAO,IAAI,MAAM,IAAI,gBAAgB,6CAA6C;AAAA,EACpF;AAEA,QAAM,MAAM;AACZ,MAAI,IAAI,YAAY,SAAS,OAAO,IAAI,WAAW,UAAU;AAC3D,WAAO,IAAI,IAAI,MAAM,MAAM,IAAI,gBAAgB,4BAA4B;AAAA,EAC7E;AAEA,QAAM,KAAK,IAAI,MAAM;AAErB,MAAI;AACF,YAAQ,IAAI,QAAQ;AAAA,MAClB,KAAK;AACH,eAAO,GAAG,IAAI;AAAA,UACZ,iBACE,OAAO,IAAI,QAAQ,oBAAoB,WACnC,IAAI,OAAO,kBACX;AAAA,UACN,cAAc,EAAE,OAAO,CAAC,EAAE;AAAA,UAC1B,YAAY;AAAA,QACd,CAAC;AAAA,MAEH,KAAK;AAEH,eAAO,GAAG,IAAI,CAAC,CAAC;AAAA,MAElB,KAAK;AACH,eAAO,GAAG,IAAI,EAAE,OAAO,MAAM,CAAC;AAAA,MAEhC,KAAK,cAAc;AACjB,cAAM,SAAS,IAAI,UAAU,CAAC;AAC9B,cAAM,WAAW,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AACjE,YAAI,CAAC,SAAU,QAAO,IAAI,IAAI,IAAI,eAAe,oCAAoC;AACrF,cAAM,OACJ,OAAO,aAAa,OAAO,OAAO,cAAc,WAC3C,OAAO,YACR,CAAC;AACP,aAAK,YAAY,KAAK,QAAQ;AAC9B,cAAM,SAAS,MAAM,SAAS,UAAU,MAAM,GAAG;AACjD,eAAO,GAAG,IAAI,MAAM;AAAA,MACtB;AAAA,MAEA,KAAK;AACH,eAAO,GAAG,IAAI,CAAC,CAAC;AAAA,MAElB;AACE,eAAO,IAAI,IAAI,IAAI,gBAAgB,qBAAqB,IAAI,MAAM,EAAE;AAAA,IACxE;AAAA,EACF,SAAS,GAAG;AACV,WAAO,IAAI,IAAI,IAAI,UAAW,EAAY,OAAO;AAAA,EACnD;AACF;;;AYxiCA,SAAS,oBAAoB;AAEtB,IAAM,mBAAmB;AACzB,IAAM,iBAAiB;AAE9B,eAAsB,aACpB,QAAQ,kBACR,MAAM,gBACW;AACjB,WAAS,OAAO,OAAO,QAAQ,KAAK,QAAQ;AAC1C,QAAI,MAAM,OAAO,IAAI,EAAG,QAAO;AAAA,EACjC;AACA,QAAM,IAAI,MAAM,4BAA4B,KAAK,IAAI,GAAG,EAAE;AAC5D;AAEA,SAAS,OAAO,MAAgC;AAC9C,SAAO,IAAI,QAAQ,CAACC,aAAY;AAC9B,UAAM,IAAI,aAAa;AACvB,MAAE,KAAK,SAAS,MAAMA,SAAQ,KAAK,CAAC;AACpC,MAAE,KAAK,aAAa,MAAM,EAAE,MAAM,MAAMA,SAAQ,IAAI,CAAC,CAAC;AACtD,MAAE,OAAO,MAAM,WAAW;AAAA,EAC5B,CAAC;AACH;;;ACRA,eAAsB,cACpB,KACA,OACA,OACe;AACf,MAAI;AAKF,UAAM,YAAY,MAAM,aAAa,EAAE,QAAQ,MAAM,eAAe,KAAK,CAAC;AAC1E,UAAM,CAAC,OAAO,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC7C,UAAU,MAAM,SAAS;AAAA,MACzB,gBAAgB,MAAM,WAAW;AAAA,IACnC,CAAC;AACD,QAAI,QAAQ;AACZ,QAAI,cAAc;AAClB,QAAI,KAAK,cAAc,KAAK,YAAO,MAAM,YAAY,aAAa,MAAM,UAAU,SAAS;AAAA,EAC7F,SAASC,MAAK;AACZ,QAAI,KAAK,mBAAmB,KAAK,MAAOA,KAAc,OAAO,EAAE;AAAA,EACjE;AACF;AAiBO,SAAS,gBACd,KACA,OACA,OAAmD,CAAC,GACzC;AACX,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,SAAS,KAAK,UAAU;AAC9B,MAAI,QAA8C;AAClD,MAAI,UAAU;AACd,MAAI,UAAU;AAEd,iBAAe,MAAqB;AAClC,QAAI,SAAS;AACX,gBAAU;AACV;AAAA,IACF;AACA,cAAU;AACV,QAAI;AACF,YAAM,OAAO,KAAK,OAAO,MAAM;AAAA,IACjC,UAAE;AACA,gBAAU;AACV,UAAI,SAAS;AACX,kBAAU;AACV,aAAK,IAAI;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,WAAW;AACT,UAAI,MAAO,cAAa,KAAK;AAC7B,cAAQ,WAAW,MAAM;AACvB,gBAAQ;AACR,aAAK,IAAI;AAAA,MACX,GAAG,UAAU;AAEb,YAAM,QAAQ;AAAA,IAChB;AAAA,IACA,OAAO;AACL,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACF;;;ACxFA,eAAsB,eACpB,SACA,KAC2B;AAC3B,QAAM,SAAS,IAAI,SAAS,UAAU,OAAO;AAC7C,SAAO;AAAA,IACL;AAAA,IACA,OAAO,IAAI,KAAK,WAAW,KAAK,IAAI,CAAC,EAAE,YAAY;AAAA,IACnD,WAAW,IAAI,SAAS,KAAK;AAAA,EAC/B;AACF;;;AClBA,SAAS,YAAAC,iBAAgB;AACzB,SAAS,aAAAC,kBAAiB;AAI1B,IAAMC,iBAAgBD,WAAUD,SAAQ;AAExC,IAAM,cAAc;AACpB,IAAM,QAAQ;AAKd,eAAsB,gBACpB,aACA,UAC0B;AAC1B,QAAM,OAAO;AAAA,IACX;AAAA,IACA,eAAe,WAAW;AAAA,IAC1B;AAAA,IACA,qBAAqB,KAAK,KAAK,KAAK;AAAA,EACtC;AACA,MAAI,OAAO,SAAS,KAAK,MAAM,QAAQ,CAAC,EAAG,MAAK,KAAK,WAAW,QAAQ,EAAE;AAE1E,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAME,eAAc,OAAO,MAAM,EAAE,KAAK,YAAY,CAAC;AACxE,UAAM,MAAuB,CAAC;AAC9B,eAAW,QAAQ,OAAO,MAAM,IAAI,GAAG;AACrC,YAAM,IAAI,KAAK,KAAK;AACpB,UAAI,CAAC,EAAG;AACR,YAAM,CAAC,MAAM,SAAS,IAAI,IAAI,EAAE,MAAM,KAAK;AAC3C,UAAI,QAAQ,QAAS,KAAI,KAAK,EAAE,MAAM,SAAS,MAAM,QAAQ,GAAG,CAAC;AAAA,IACnE;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;;;ACpCA,SAAS,SAAAC,QAAO,YAAAC,YAAU,aAAAC,kBAAiB;AAC3C,SAAS,WAAAC,iBAAe;AAEjB,IAAM,yBAAyB;AAuBtC,eAAsB,YAAY,MAA4C;AAC5E,MAAI;AACF,UAAM,MAAM,MAAMF,WAAS,MAAM,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,mBAAmB,uBAAwB,QAAO;AAC7D,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,aAAa,MAAc,OAAoC;AACnF,QAAMD,OAAMG,UAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAMD,WAAU,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM;AACrE;;;ACdA,IAAM,oBAAoB,KAAK,KAAK,KAAK;AAEzC,eAAe,gBAAgB,KAAoB,gBAAwC;AACzF,QAAM,SAAS,MAAM,oBAAoB,IAAI,OAAO,cAAc;AAElE,QAAM,CAAC,OAAO,WAAW,IAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,IACjD,cAAc,IAAI,OAAO,EAAE,MAAM,QAAQ,QAAQ,OAAO,QAAQ,OAAO,EAAE,CAAC;AAAA,IAC1E,cAAc,IAAI,OAAO,EAAE,MAAM,YAAY,QAAQ,OAAO,QAAQ,OAAO,EAAE,CAAC;AAAA,IAC9E,cAAc,IAAI,OAAO,EAAE,MAAM,QAAQ,QAAQ,OAAO,QAAQ,OAAO,EAAE,CAAC;AAAA,EAC5E,CAAC;AAGD,QAAM,UAAU,IAAI,IAAY,mBAAmB,CAAC;AACpD,aAAW,KAAK,IAAI,SAAS,gBAAgB,iBAAiB,EAAG,SAAQ,IAAI,CAAC;AAG9E,QAAM,OAAO,MAAM,YAAY,IAAI,MAAM,YAAY;AACrD,QAAM,gBAAgB,MAAM,gBAAgB,IAAI,MAAM,aAAa,MAAM,WAAW,EAAE;AAEtF,QAAM,WAAyB;AAAA,IAC7B,gBAAgB;AAAA,IAChB,UAAS,oBAAI,KAAK,GAAE,YAAY;AAAA,IAChC,QAAQ,OAAO;AAAA,IACf,cAAc,MAAM,KAAK,OAAO;AAAA,IAChC;AAAA,IACA,SAAS;AAAA,MACP,OAAO,MAAM,QAAQ,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,MACzC,WAAW,UAAU,QAAQ,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,MACjD,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,IACzC;AAAA,EACF;AACA,QAAM,aAAa,IAAI,MAAM,cAAc,QAAQ;AACrD;AAEA,eAAsB,oBACpB,KACA,KACgC;AAChC,QAAM,IAAI,MAAM,iBAAiB,IAAI,OAAO,KAAK,MAAM;AAIvD,MAAI;AACF,UAAM,gBAAgB,KAAK,KAAK,MAAM;AAAA,EACxC,QAAQ;AAAA,EAER;AAEA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,QAAQ,EAAE;AAAA,IACV,MAAM,EAAE;AAAA,IACR,SAAS,EAAE;AAAA,EACb;AACF;;;AC5EA,SAAS,cAAAE,aAAY,SAAAC,eAAa;AAClC,SAAS,WAAAC,iBAAe;;;ACLxB,SAAS,cAAAC,aAAY,SAAAC,eAAa;AAClC,SAAS,WAAAC,iBAAe;;;ACAjB,SAAS,wBAAwB,SAA0B;AAEhE,MAAI,eAAe,KAAK,OAAO,EAAG,QAAO;AAGzC,MAAI,4BAA4B,KAAK,OAAO,EAAG,QAAO;AAEtD,MAAI,KAAK,KAAK,OAAO,EAAG,QAAO;AAE/B,MAAI,eAAe,KAAK,OAAO,EAAG,QAAO;AAEzC,MAAI,SAAS,KAAK,OAAO,KAAK,0BAA0B,KAAK,OAAO,KAAK,MAAM,KAAK,OAAO,GAAG;AAC5F,WAAO;AAAA,EACT;AAGA,MAAI,aAAa,KAAK,OAAO,EAAG,QAAO;AAEvC,MAAI,sBAAsB,KAAK,OAAO,EAAG,QAAO;AAOhD,QAAM,WAAW,QACd,QAAQ,eAAe,EAAE,EACzB,MAAM,GAAG,EACT,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,OAAO;AACjB,QAAM,UAAU,CAAC,MAAc,mCAAmC,KAAK,CAAC;AACxE,MAAI,SAAS,SAAS,KAAK,SAAS,MAAM,OAAO,EAAG,QAAO;AAC3D,SAAO;AACT;;;ADXA,IAAM,eAAe,oBAAI,IAAI,CAAC,QAAQ,SAAS,SAAS,MAAM,WAAW,MAAM,KAAK,CAAC;AACrF,IAAM,aAAa,oBAAI,IAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,KAAK,CAAC;AAChF,IAAM,aAAa,oBAAI,IAAI,CAAC,QAAQ,MAAM,CAAC;AAI3C,IAAM,aACJ;AAQK,SAAS,gBAAgB,KAAuB;AACrD,QAAM,SAAmB,CAAC;AAC1B,MAAI,MAAM;AACV,MAAI,QAA0B;AAC9B,MAAIC,cAAa;AACjB,QAAM,QAAQ,MAAM;AAClB,QAAIA,YAAY,QAAO,KAAK,GAAG;AAC/B,UAAM;AACN,IAAAA,cAAa;AAAA,EACf;AACA,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,KAAK,IAAI,CAAC;AAChB,QAAI,OAAO;AACT,UAAI,OAAO,MAAO,SAAQ;AAAA,UACrB,QAAO;AACZ,MAAAA,cAAa;AACb;AAAA,IACF;AACA,QAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,cAAQ;AACR,MAAAA,cAAa;AACb;AAAA,IACF;AACA,QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC1C,YAAM;AACN,UAAI,KAAK;AACT,WAAK,OAAO,OAAO,OAAO,QAAQ,IAAI,IAAI,CAAC,MAAM,IAAI;AACnD,cAAM;AACN;AAAA,MACF;AACA,aAAO,KAAK,EAAE;AACd;AAAA,IACF;AACA,QAAI,KAAK,KAAK,EAAE,GAAG;AACjB,YAAM;AACN;AAAA,IACF;AACA,WAAO;AACP,IAAAA,cAAa;AAAA,EACf;AACA,QAAM;AACN,SAAO;AACT;AAEA,SAAS,WAAW,GAAoB;AACtC,SAAO,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACxD;AAEA,SAAS,cAAc,QAA8B;AACnD,QAAM,OAAmB,CAAC;AAC1B,MAAI,MAAgB,CAAC;AACrB,aAAW,KAAK,QAAQ;AACtB,QAAI,WAAW,CAAC,GAAG;AACjB,UAAI,IAAI,OAAQ,MAAK,KAAK,GAAG;AAC7B,YAAM,CAAC;AAAA,IACT,OAAO;AACL,UAAI,KAAK,CAAC;AAAA,IACZ;AAAA,EACF;AACA,MAAI,IAAI,OAAQ,MAAK,KAAK,GAAG;AAC7B,SAAO;AACT;AAIA,SAAS,cAAc,KAAyB;AAC9C,MAAI,IAAI;AACR,SAAO,IAAI,IAAI,QAAQ;AACrB,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,MAAM,OAAO;AACf;AACA;AAAA,IACF;AACA,QAAI,2BAA2B,KAAK,CAAC,GAAG;AACtC;AACA;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAO,IAAI,MAAM,CAAC;AACpB;AAEA,SAAS,QAAQ,KAAqB;AACpC,UAAQ,IAAI,MAAM,OAAO,EAAE,IAAI,KAAK,KAAK,YAAY;AACvD;AAEA,SAAS,gBAAgB,KAAuC;AAC9D,QAAM,OAAO,cAAc,GAAG;AAC9B,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,MAAM,QAAQ,KAAK,CAAC,CAAW;AACrC,QAAM,OAAO,KAAK,MAAM,CAAC;AACzB,QAAM,QAAQ,KAAK,OAAO,CAAC,MAAM,EAAE,WAAW,GAAG,CAAC;AAClD,QAAM,WAAW,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,CAAC;AAEtD,MAAI,aAAa,IAAI,GAAG,GAAG;AACzB,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,YAAY,MAAM;AAAA,MACtB,CAAC,MAAM,MAAM,QAAQ,MAAM,QAAQ,MAAM,iBAAiB,mBAAmB,KAAK,CAAC;AAAA,IACrF;AACA,UAAM,SAAS,QAAQ,QAAQ,QAAQ,aAAa,QAAQ,QAAQ,QAAQ;AAC5E,UAAM,aAAa,SAAS,SAAS;AAIrC,QAAI,CAAC,UAAU,CAAC,aAAa,CAAC,WAAY,QAAO;AACjD,WAAO,EAAE,MAAM,UAAU,MAAM,KAAK,OAAO,QAAQ;AAAA,EACrD;AAEA,MAAI,WAAW,IAAI,GAAG,GAAG;AACvB,UAAM,OAAO,SAAS,KAAK,CAAC,MAAM,WAAW,KAAK,CAAC,CAAC;AACpD,QAAI,CAAC,KAAM,QAAO;AAClB,WAAO,EAAE,MAAM,QAAQ,MAAM,KAAK,OAAO,KAAK;AAAA,EAChD;AAEA,MAAI,WAAW,IAAI,GAAG,GAAG;AACvB,UAAM,UAAU,KAAK,UAAU,CAAC,MAAM,MAAM,WAAW,MAAM,YAAY,MAAM,OAAO;AACtF,UAAM,SAAS,WAAW,IAAK,KAAK,UAAU,CAAC,KAAK,OAAS,SAAS,CAAC,KAAK;AAC5E,WAAO,EAAE,MAAM,QAAQ,MAAM,KAAK,OAAO,OAAO;AAAA,EAClD;AAEA,SAAO;AACT;AAOO,SAAS,oBAAoB,SAAyC;AAC3E,MAAI,CAAC,WAAW,OAAO,YAAY,SAAU,QAAO;AACpD,QAAM,SAAS,gBAAgB,OAAO;AACtC,MAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,MAAI,OAAO,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,GAAG,CAAC,EAAG,QAAO;AAElE,QAAM,QAAQ,cAAc,MAAM,EAC/B,IAAI,eAAe,EACnB,OAAO,CAAC,MAA4B,MAAM,IAAI;AACjD,MAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,QAAM,OAAwC,EAAE,QAAQ,GAAG,MAAM,GAAG,MAAM,EAAE;AAC5E,QAAM,KAAK,CAAC,GAAG,MAAM,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC;AAChD,SAAO,MAAM,CAAC;AAChB;AAEA,SAAS,aAAa,KAAoB,QAAyB;AACjE,QAAM,OAAO,OAAO,MAAM,OAAO,EAAE,IAAI,KAAK;AAC5C,aAAW,KAAK,IAAI,MAAM,OAAO;AAC/B,QAAI,EAAE,SAAS,OAAQ;AACvB,QAAI,EAAE,SAAS,UAAU,EAAE,KAAK,SAAS,IAAI,MAAM,EAAE,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,IAAI,MAAM,MAAM;AAC1F,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,QAAQ;AACd,IAAM,UAAU;AAChB,IAAM,QAAQ,CAAC,GAAW,QAAiB,EAAE,SAAS,MAAM,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,WAAM;AAEpF,eAAe,eACb,KACA,KACA,YACA,WACA,SACe;AACf,MAAI;AACF,UAAMC,QAAMC,UAAQ,IAAI,MAAM,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAM,QAAQ;AAAA,MACZ,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC3B,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,OAAO,IAAI,QAAQ,MAAM,IAAI,OAAO,KAAK,IAAI;AAAA,MAC7C;AAAA,MACA;AAAA,MACA,SAAS,MAAM,SAAS,OAAO;AAAA,IACjC;AACA,UAAMC,YAAW,IAAI,MAAM,SAAS,KAAK,UAAU,KAAK,IAAI,MAAM,MAAM;AAAA,EAC1E,QAAQ;AAAA,EAER;AACF;AAOA,eAAsB,YACpB,OACA,KACe;AACf,MAAI,CAAC,WAAW,EAAE,YAAa;AAC/B,QAAM,UAAU,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AACpE,QAAM,MAAM,oBAAoB,OAAO;AACvC,MAAI,CAAC,IAAK;AAEV,MAAI,aAAgC;AACpC,MAAI,YAAY;AAEhB,MAAI,IAAI,SAAS,YAAY,IAAI,OAAO;AAGtC,QAAI,CAAC,wBAAwB,IAAI,KAAK,GAAG;AACvC,YAAM,IAAI,MAAM,SAAS,IAAI,OAAO,IAAI,KAAK;AAC7C,mBAAa,EAAE;AACf,kBAAY,EAAE,eAAe,SAAS,EAAE;AAAA,IAC1C;AAAA,EACF,WAAW,IAAI,SAAS,UAAU,IAAI,OAAO;AAE3C,gBAAY,aAAa,KAAK,IAAI,KAAK;AAAA,EACzC;AAEA,QAAM,eAAe,KAAK,KAAK,YAAY,WAAW,OAAO;AAC/D;;;ADlOA,IAAM,kBAAkB,oBAAI,IAAI,CAAC,QAAQ,MAAM,CAAC;AAChD,IAAM,4BAA4B,IAAI,KAAK;AAE3C,SAAS,aAAa,UAAkB,OAA+C;AACrF,MAAI,aAAa,QAAQ;AACvB,UAAM,UAAU,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AACpE,UAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ;AAC9D,YAAQ,WAAW,OAAO,KAAK,KAAK;AAAA,EACtC;AACA,MAAI,aAAa,QAAQ;AACvB,UAAM,UAAU,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AACpE,WAAO,QAAQ,QAAQ,cAAc,GAAG,EAAE,KAAK,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAMA,SAAS,4BACP,aACA,aACA,OACU;AACV,MAAI,YAAY,WAAW,EAAG,QAAO,CAAC;AAGtC,QAAM,SAAS,IAAI,IAAI,WAAW;AAClC,QAAM,iBAAiB,oBAAI,IAAsB;AACjD,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,UAAU,OAAO,IAAI,EAAE,IAAI,EAAG,gBAAe,IAAI,EAAE,MAAM,EAAE,QAAQ;AAAA,EACpF;AAEA,QAAM,UAAoB,CAAC;AAC3B,aAAW,QAAQ,aAAa;AAC9B,UAAM,QAAQ,KAAK,YAAY;AAC/B,QAAI,UAAU;AACd,eAAW,KAAK,aAAa;AAC3B,UAAI,MAAM,SAAS,CAAC,GAAG;AACrB,kBAAU;AACV;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,SAAS;AACZ,iBAAW,MAAM,eAAe,IAAI,IAAI,KAAK,CAAC,GAAG;AAC/C,YAAI,YAAY,IAAI,EAAE,GAAG;AACvB,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,QAAS,SAAQ,KAAK,IAAI;AAAA,EAChC;AACA,SAAO;AACT;AAKA,IAAM,uBAAuB;AAE7B,eAAe,YACb,KACA,UACA,OACA,UACA,QACA,WACe;AACf,MAAI;AACF,UAAMC,QAAMC,UAAQ,IAAI,MAAM,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AAC3D,UAAM,QAAQ;AAAA,MACZ,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,MAC3B,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,QACE,UAAU,OAAO,SAAS,uBACtB,GAAG,OAAO,MAAM,GAAG,oBAAoB,CAAC,WACxC;AAAA,MACN,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,YAAY,UAAU;AAAA,IAC7D;AACA,UAAMC,YAAW,IAAI,MAAM,SAAS,KAAK,UAAU,KAAK,IAAI,MAAM,MAAM;AAAA,EAC1E,QAAQ;AAAA,EAER;AACF;AAEA,IAAM,qBAAqB;AAI3B,SAAS,gBAAgB,MAAc,SAA2B;AAChE,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAIC,SAAQ;AACZ,aAAW,KAAK,SAAS;AACvB,QAAI,MAAM,MAAO,CAAAA,UAAS;AAAA,aACjB,EAAE,UAAU,KAAK,MAAM,SAAS,CAAC,EAAG,CAAAA,UAAS;AAAA,EACxD;AACA,SAAOA;AACT;AASO,SAAS,eACd,OACA,WACA,OACA,UACA,WAAW,WAAW,EAAE,kBAChB;AACR,QAAM,WAAW,UAAU,MAAM,MAAM,GAAG,CAAC;AAC3C,QAAM,WAAW,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AAEpD,QAAM,aAAa,oBAAI,IAA0B;AACjD,aAAW,KAAK,MAAM,OAAO;AAC3B,QAAI,EAAE,SAAS,YAAY,CAAC,SAAS,IAAI,EAAE,IAAI,EAAG;AAClD,UAAM,OAAO,WAAW,IAAI,EAAE,IAAI;AAClC,QAAI,KAAM,MAAK,KAAK,CAAC;AAAA,QAChB,YAAW,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,EACjC;AAEA,QAAM,UAAU,cAAc,KAAK;AACnC,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,UAAU;AACxB,UAAM,QAAQ,WAAW,IAAI,EAAE,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAC9F,QAAI,KAAK,WAAW,GAAG;AAErB,cAAQ,KAAK,oCAA+B,EAAE,IAAI,IAAI;AACtD;AAAA,IACF;AACA,UAAM,SAAS,KACZ,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,gBAAgB,EAAE,MAAM,OAAO,EAAE,EAAE,EAC3D,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EACzB,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGnC,UAAM,QAAQ,OAAO,SAAS,IAAI,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK,MAAM,GAAG,CAAC;AACtF,eAAW,KAAK,OAAO;AACrB,YAAM,MAAM,IAAI,EAAE,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC;AACnD,YAAM,UACJ,IAAI,SAAS,qBAAqB,GAAG,IAAI,MAAM,GAAG,qBAAqB,CAAC,CAAC,WAAM;AACjF,cAAQ,KAAK,oCAA+B,EAAE,IAAI,KAAK,EAAE,IAAI;AAAA,IAAS,OAAO,EAAE;AAAA,IACjF;AAAA,EACF;AAEA,QAAM,SACJ,wBAAwB,QAAQ,WAAM,UAAU,UAAU,4BAA4B,KAAK;AAAA;AAAA;AAE7F,QAAM,SAAS;AAAA,2CAA8C,KAAK;AAElE,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO,OAAO,SAAS,OAAO,SAAS;AAC3C,aAAW,KAAK,SAAS;AACvB,QAAI,OAAO,EAAE,SAAS,IAAI,SAAU;AACpC,UAAM,KAAK,CAAC;AACZ,YAAQ,EAAE,SAAS;AAAA,EACrB;AAEA,MAAI,MAAM,WAAW,GAAG;AAEtB,UAAM,MAAM,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,IAAI;AACjD,WACE,eAAe,UAAU,UAAU,4BAA4B,KAAK,iBAAiB,GAAG,wCACnD,KAAK,iBAAiB,QAAQ;AAAA,EAGvE;AAEA,SAAO,GAAG,MAAM;AAAA,EAAK,MAAM,KAAK,IAAI,CAAC;AAAA,EAAK,MAAM;AAClD;AAEA,eAAsB,WAAW,KAAkB,KAA2C;AAC5F,MAAI,CAAC,KAAK,aAAa,OAAO,IAAI,cAAc,UAAU;AACxD,WAAO,EAAE,UAAU,SAAS,QAAQ,eAAe;AAAA,EACrD;AAIA,MAAI,IAAI,cAAc,QAAQ;AAC5B,UAAMC,SACJ,IAAI,cAAc,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa,CAAC;AAE3E,UAAM,YAAYA,QAAO,GAAG;AAC5B,WAAO,EAAE,UAAU,QAAQ;AAAA,EAC7B;AAEA,MAAI,CAAC,gBAAgB,IAAI,IAAI,SAAS,GAAG;AACvC,WAAO,EAAE,UAAU,QAAQ;AAAA,EAC7B;AAEA,QAAM,QACJ,IAAI,cAAc,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa,CAAC;AAE3E,QAAM,QAAQ,aAAa,IAAI,WAAW,KAAK;AAC/C,MAAI,CAAC,OAAO;AACV,UAAMC,OAAoB,EAAE,UAAU,SAAS,QAAQ,uBAAuB;AAC9E,UAAM,YAAY,KAAK,IAAI,WAAW,MAAMA,KAAI,UAAUA,KAAI,MAAM;AACpE,WAAOA;AAAA,EACT;AAIA,MAAI,IAAI,cAAc,UAAU,wBAAwB,KAAK,GAAG;AAC9D,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ,IAAI,KAAK;AAAA,IACnB;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAEA,QAAM,YAAY,MAAM,SAAS,IAAI,OAAO,KAAK;AAMjD,MAAI,UAAU,eAAe,OAAO;AAClC,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ,+CAA0C,KAAK,cAAc,IAAI,SAAS;AAAA,IACpF;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAKA,QAAM,UAAU,IAAI,IAAI,cAAc,KAAK,CAAC;AAC5C,QAAM,cAAc,IAAI,SAAS,gBAAgB,yBAAyB;AAC1E,QAAM,UAAU,4BAA4B,aAAa,SAAS,IAAI,KAAK;AAE3E,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QACE,cAAc,UAAU,UAAU,2BAA2B,QAAQ,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,gDACnD,IAAI,SAAS;AAAA,IACzD;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAKA,MAAI,CAAC,UAAU,eAAe;AAC5B,UAAMA,OAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QACE,cAAc,UAAU,UAAU,wGACI,IAAI,SAAS;AAAA,IACvD;AACA,UAAM,YAAY,KAAK,IAAI,WAAW,OAAOA,KAAI,UAAUA,KAAI,MAAM;AACrE,WAAOA;AAAA,EACT;AAEA,QAAM,OAAO,eAAe,OAAO,WAAW,IAAI,OAAO,IAAI,SAAS;AACtE,QAAM,MAAoB,EAAE,UAAU,SAAS,QAAQ,KAAK;AAC5D,QAAM,YAAY,KAAK,IAAI,WAAW,OAAO,IAAI,UAAU,MAAM,KAAK,MAAM;AAC5E,SAAO;AACT;;;AG9SA,SAAS,cAAAC,aAAY,SAAAC,eAAa;AAClC,SAAS,WAAAC,iBAAe;AAmBxB,eAAsB,UAAU,OAAiB,KAA0C;AACzF,MAAI,CAAC,SAAS,OAAO,MAAM,iBAAiB,YAAY,OAAO,MAAM,kBAAkB,UAAU;AAC/F,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAEA,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1C,QAAM,SAAS,EAAE,GAAG,OAAO,WAAW;AACtC,QAAMD,QAAMC,UAAQ,IAAI,MAAM,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,QAAMF,YAAW,IAAI,MAAM,UAAU,KAAK,UAAU,MAAM,IAAI,MAAM,MAAM;AAE1E,SAAO,EAAE,IAAI,MAAM,WAAW;AAChC;;;ACdA,eAAsB,WAAW,KAAkB,KAA2C;AAC5F,MAAI,CAAC,KAAK,SAAS,OAAO,IAAI,UAAU,UAAU;AAChD,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AAEA,QAAM,sBAAsB,IAAI,SAAS,gBAAgB,KAAK,KAAK,GAAI;AACvE,QAAM,cAAc,IAAI,OAAO,gBAAgB;AAC/C,QAAM,YAAY,MAAM,SAAS,IAAI,OAAO,IAAI,OAAO,EAAE,qBAAqB,YAAY,CAAC;AAG3F,QAAM,WAAW,IAAI,MAAM,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM;AAChE,QAAM,SAAS,WAAW;AAAA,IACxB,YAAY;AAAA,IACZ,OAAO,IAAI;AAAA,IACX,OAAO,IAAI;AAAA,IACX;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,QAAQ;AACtB,QAAI,EAAE,QAAQ,OAAQ,SAAQ,IAAI,EAAE,KAAK,MAAM,EAAE,QAAQ,KAAK,GAAG,CAAC;AAAA,EACpE;AAEA,QAAM,SAAS,MAAM,KAAK,UAAU,OAAO;AAAA,IACzC,OAAO,IAAI;AAAA,IACX,OAAO,IAAI;AAAA,IACX,cAAc,IAAI;AAAA,IAClB,cAAc,IAAI;AAAA,IAClB;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,OAAO,IAAI;AAAA,IACX,YAAY,UAAU;AAAA,IACtB,iBAAiB,UAAU;AAAA,EAC7B;AACF;;;ACpCA,IAAM,0BAA0B;AAEhC,IAAM,YAAY;AAClB,IAAMG,eAAc;AACpB,IAAMC,eAAc;AAEpB,SAAS,aAAa,KAA4B;AAChD,QAAM,IAAI,IAAI;AACd,SACE,8BAA8B,EAAE,IAAI;AAAA,EACjC,EAAE,UAAU,mBAAmB,EAAE,YAAY;AAGpD;AAEA,SAAS,WAAW,MAA6B;AAC/C,SAAO;AAAA,IACL,KAAK,cAAc,UACjB,KAAK,aAAa,UAClB,KAAK,QAAQ,MAAM,UACnB,KAAK,QAAQ,KAAK,UAClB,KAAK,QAAQ,UAAU;AAAA,EAC3B;AACF;AAEA,SAAS,kBAAkB,MAAoB,WAA2B;AACxE,QAAM,SAAS,CAAC,MAAe,MAAM,IAAI,KAAK;AAC9C,QAAM,OACJ,sCAAiC,KAAK,MAAM,MACxC,KAAK,cAAc,MAAM,UAAU,OAAO,KAAK,cAAc,MAAM,CAAC,KACrE,KAAK,aAAa,MAAM,QAAQ,OAAO,KAAK,aAAa,MAAM,CAAC;AAGrE,QAAM,YAAsB,CAAC,IAAI;AACjC,MAAI,KAAK,WAAW,WAAW;AAC7B,cAAU,KAAK,EAAE;AACjB,cAAU;AAAA,MACR,8BAA8B,KAAK,MAAM,qBAAqB,SAAS;AAAA,IACzE;AAAA,EACF;AACA,MAAI,KAAK,QAAQ,MAAM,CAAC,GAAG;AACzB,cAAU,KAAK,IAAI,mBAAmB,KAAK,KAAK,QAAQ,MAAM,CAAC,CAAC,EAAE;AAAA,EACpE;AACA,MAAI,KAAK,QAAQ,KAAK,QAAQ;AAC5B,cAAU,KAAK,IAAI,qBAAqB;AACxC,eAAW,KAAK,KAAK,QAAQ,KAAK,MAAM,GAAGA,YAAW,EAAG,WAAU,KAAK,KAAK,CAAC,EAAE;AAAA,EAClF;AACA,MAAI,KAAK,QAAQ,UAAU,QAAQ;AACjC,cAAU,KAAK,IAAI,sBAAsB;AACzC,eAAW,KAAK,KAAK,QAAQ,UAAU,MAAM,GAAGA,YAAW,EAAG,WAAU,KAAK,KAAK,CAAC,EAAE;AAAA,EACvF;AAIA,QAAM,QAAkB,CAAC;AACzB,MAAI,KAAK,cAAc,QAAQ;AAC7B,UAAM,KAAK,IAAI,oBAAoB;AACnC,eAAW,KAAK,KAAK,cAAc,MAAM,GAAGD,YAAW,GAAG;AACxD,YAAM,OAAO,EAAE,OAAO,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC,MAAM;AACpD,YAAM,KAAK,OAAO,EAAE,IAAI,MAAM,EAAE,OAAO,GAAG,IAAI,EAAE;AAAA,IAClD;AAAA,EACF;AACA,MAAI,KAAK,aAAa,QAAQ;AAC5B,UAAM,QAAQ,KAAK,aAAa,MAAM,GAAG,SAAS;AAClD,UAAM,OAAO,KAAK,aAAa,SAAS,MAAM;AAC9C,UAAM,KAAK,IAAI,qBAAqB,MAAM,KAAK,IAAI,KAAK,OAAO,IAAI,MAAM,IAAI,UAAU,GAAG;AAAA,EAC5F;AAEA,MAAI,MAAM,UAAU,KAAK,IAAI;AAC7B,aAAW,QAAQ,OAAO;AACxB,SAAK,MAAM,OAAO,MAAM,SAAS,wBAAyB;AAC1D,WAAO,OAAO;AAAA,EAChB;AACA,UACE,IAAI,SAAS,0BAA0B,IAAI,MAAM,GAAG,uBAAuB,IAAI,KAC/E,QAAQ;AACZ;AAEA,eAAsB,YAAY,KAAoB,MAAsC;AAC1F,QAAM,SAAS,aAAa,GAAG;AAE/B,QAAM,OAAO,MAAM,YAAY,IAAI,MAAM,YAAY;AACrD,MAAI,CAAC,QAAQ,CAAC,WAAW,IAAI,GAAG;AAC9B,WAAO,EAAE,QAAQ,QAAQ,KAAK;AAAA,EAChC;AAEA,QAAM,YAAY,MAAM,cAAc,IAAI,MAAM,WAAW;AAC3D,QAAM,SAAS,kBAAkB,MAAM,SAAS;AAChD,SAAO,EAAE,QAAQ,GAAG,MAAM;AAAA;AAAA;AAAA;AAAA,EAAc,MAAM,IAAI,KAAK;AACzD;;;A5DtEA,eAAe,YAAY,OAA6C;AACtE,MAAI;AACF,QAAI,CAAC,OAAO,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC3C,UAAU,MAAM,SAAS;AAAA,MACzB,gBAAgB,MAAM,WAAW;AAAA,IACnC,CAAC;AAID,QAAI,MAAM,mBAAmB,gBAAgB;AAC3C,UAAI,KAAK,iBAAiB,MAAM,cAAc,oBAAe,cAAc,0BAAgB;AAC3F,YAAM,YAAY,MAAM,aAAa,EAAE,QAAQ,KAAK,CAAC;AACrD,OAAC,OAAO,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,QACvC,UAAU,MAAM,SAAS;AAAA,QACzB,gBAAgB,MAAM,WAAW;AAAA,MACnC,CAAC;AAAA,IACH;AACA,UAAM,WAAW,IAAI,cAAc,MAAM,WAAW;AAGpD,UAAM,QAAQ,MAAM,aAAa,KAAK,MAAM,WAAW,MAAM,UAAU;AACvE,WAAO,EAAE,OAAO,OAAO,aAAa,UAAU,MAAM;AAAA,EACtD,SAASE,MAAK;AACZ,UAAM,IAAI;AAAA,MACR,6BAA6B,MAAM,SAAS,KAAMA,KAAc,OAAO;AAAA,IAEzE;AAAA,EACF;AACF;AAEA,SAAS,SAAS,KAAoB,MAAoB;AACxD,QAAM,MAAM,IAAI,KAAK;AAErB,MAAI;AAAA,IAAI;AAAA,IAAK,CAAC,MACZ,EAAE,KAAK;AAAA,MACL,SAAS;AAAA,MACT,SAAS;AAAA,MACT;AAAA,MACA,YAAY,IAAI,MAAM;AAAA,MACtB,cAAc,IAAI,MAAM;AAAA,MACxB,cAAc,IAAI,MAAM;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,IAAI,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,CAAC;AAE9C,MAAI,IAAI,UAAU,OAAO,MAAM,EAAE,KAAK,MAAM,YAAY,KAAK,IAAI,CAAC,CAAC;AAEnE,MAAI,KAAK,SAAS,OAAO,MAAM;AAC7B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,WAAW,MAAM,GAAG,CAAC;AAAA,EAC3C,CAAC;AAED,MAAI,KAAK,QAAQ,OAAO,MAAM;AAC5B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,UAAU,MAAM,GAAG,CAAC;AAAA,EAC1C,CAAC;AAED,MAAI,KAAK,SAAS,OAAO,MAAM;AAC7B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,WAAW,MAAM,GAAG,CAAC;AAAA,EAC3C,CAAC;AAED,MAAI,IAAI,aAAa,OAAO,MAAM;AAChC,UAAM,aAAa,EAAE,IAAI,MAAM,OAAO;AACtC,UAAM,UAAU,aAAa,OAAO,UAAU,IAAI;AAClD,WAAO,EAAE,KAAK,MAAM,eAAe,OAAO,SAAS,OAAO,IAAI,UAAU,QAAW,GAAG,CAAC;AAAA,EACzF,CAAC;AAED,MAAI,KAAK,mBAAmB,OAAO,MAAM;AACvC,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AAChD,WAAO,EAAE,KAAK,MAAM,oBAAoB,MAAM,GAAG,CAAC;AAAA,EACpD,CAAC;AAED,MAAI,KAAK,QAAQ,OAAO,MAAM;AAC5B,UAAM,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI;AAChD,WAAO,EAAE,KAAK,MAAM,iBAAiB,MAAM,GAAG,CAAC;AAAA,EACjD,CAAC;AAED,MAAI,QAAQ,CAACA,MAAK,MAAM;AACtB,QAAI,MAAM,gBAAgBA,KAAI,OAAO;AACrC,WAAO,EAAE,KAAK,EAAE,OAAOA,KAAI,QAAQ,GAAG,GAAG;AAAA,EAC3C,CAAC;AAED,SAAO;AACT;AAEA,eAAsB,YACpB,OACA,UAAwB,CAAC,GACF;AACvB,QAAM,MAAM,MAAM,YAAY,KAAK;AACnC,QAAM,OAAO,QAAQ,QAAS,MAAM,aAAa;AAEjD,QAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,QAAM,aAAa,MAAM,EAAE,OAAO,IAAI,OAAO,MAAM,UAAU,YAAY,CAAC;AAE1E,QAAMC,WAAU,MAAM,SAAS,OAAO,IAAI,GAAG,MAAM;AAMnD,QAAM,MAAM,WAAW;AACvB,QAAM,YAA8B,IAAI,cACpC,gBAAgB,KAAK,OAAO,EAAE,YAAY,IAAI,kBAAkB,CAAC,IACjE;AAIJ,QAAM,cAA2B,kBAAkB,MAAM,aAAa,CAAC,MAAM;AAC3E,SAAK,IAAI,SAAS,IAAI,CAAC;AACvB,eAAW,SAAS;AAAA,EACtB,CAAC;AACD,QAAM,aAAyB,iBAAiB,MAAM,aAAa,OAAO,MAAM;AAC9E,UAAM,IAAI,SAAS,IAAI,CAAC;AAGxB,QAAI,EAAE,SAAS,iBAAiB;AAC9B,YAAM,KAAM,EAAE,SAAyC,MAAM;AAC7D,YAAM,cAAc,KAAK,OAAO,UAAU,EAAE,EAAE;AAAA,IAChD;AAAA,EACF,CAAC;AACD,MAAI;AACF,UAAM,YAAY,MAAM;AAAA,EAC1B,SAASD,MAAK;AACZ,QAAI,KAAK,iCAAkCA,KAAc,OAAO,EAAE;AAAA,EACpE;AACA,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,EACzB,SAASA,MAAK;AACZ,QAAI,KAAK,gCAAiCA,KAAc,OAAO,EAAE;AAAA,EACnE;AAEA,QAAM,MAAM,oBAAoB,IAAI;AAEpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,MAAM,OAAO;AACX,iBAAW,KAAK;AAChB,YAAM,YAAY,KAAK,EAAE,MAAM,MAAM,MAAS;AAC9C,YAAM,WAAW,KAAK,EAAE,MAAM,MAAM,MAAS;AAE7C,YAAM,IAAI,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AAC9C,YAAM,IAAI,QAAc,CAACE,UAAS,WAAW;AAC3C,mBAAW,MAAM,CAACF,SAASA,OAAM,OAAOA,IAAG,IAAIE,SAAQ,CAAE;AAAA,MAC3D,CAAC;AAAA,IACH;AAAA,EACF;AACF;","names":["writeFile","emit","err","readFile","join","dirname","join","mkdir","readFile","dirname","readFile","QUERY","QUERY","Query","QUERY","firstLine","Query","QUERY","QUERY","QUERY","QUERY","Query","QUERY","firstLine","Query","QUERY","QUERY","Query","firstLine","Query","SCRIPT_RE","extractScripts","require","readFile","mkdir","dirname","readFile","join","relative","sep","ignore","readIgnoreFile","buildMatcher","toPosix","mkdir","readFile","writeFile","dirname","join","mkdir","readFile","stat","writeFile","basename","readFile","writeFile","dirname","stat","mkdir","readFile","writeFile","basename","appendFile","mkdir","readFile","writeFile","dirname","stat","readFile","mkdir","dirname","writeFile","appendFile","appendFile","mkdir","dirname","STOPWORDS","score","execFile","readFile","join","promisify","execFileAsync","mkdir","readFile","writeFile","dirname","mkdir","readFile","writeFile","dirname","SCHEMA_VERSION","score","indexSymbolsByFile","tline","shown","omitted","lines","score","resolve","sep","join","mkdir","dirname","appendFile","resolve","err","execFile","promisify","execFileAsync","mkdir","readFile","writeFile","dirname","appendFile","mkdir","dirname","appendFile","mkdir","dirname","hasContent","mkdir","dirname","appendFile","mkdir","dirname","appendFile","score","input","res","appendFile","mkdir","dirname","MAX_COMMITS","MAX_BULLETS","err","writeFile","resolve"]}