@tekmidian/pai 0.66.6 → 0.66.8

package/dist/worktree-CwMRTa0H.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"worktree-CwMRTa0H.mjs","names":[],"sources":["../src/workers/paths.ts","../src/workers/args.ts","../src/workers/status.ts","../src/workers/ledger.ts","../src/workers/pending.ts","../src/workers/worktree.ts"],"sourcesContent":["/**\n * paths.ts — where worker run artefacts live.\n *\n * Everything a run writes (event mirror, status file, pane registry, routing\n * state, the empty MCP config) sits under one logDir so the whole tree is\n * disposable and configurable: `workers.logDir`, default ~/.claude/logs/workers.\n */\n\nimport { existsSync, mkdirSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { expandHome, DEFAULT_LOG_DIR, type WorkersConfig } from \"./config.js\";\nimport { paiHomePath, resolvePaiFile } from \"../config/pai-home.js\";\n\n/**\n * Absolute logDir for the given config. An explicit `logDir` in workers.yaml\n * is honored verbatim (the user chose it). Otherwise this resolves like every\n * other PAI_HOME file: PAI_HOME/logs/workers if it exists, else the old\n * ~/.claude/logs/workers (with a one-time notice), else the new path.\n */\nexport function workersLogDir(config: WorkersConfig): string {\n  const expanded = expandHome(config.logDir);\n  if (config.logDir !== DEFAULT_LOG_DIR) return expanded;\n  return resolvePaiFile(paiHomePath(\"logs\", \"workers\"), [expanded], \"pai config migrate --logs\");\n}\n\n/** The strict empty MCP config for headless runs, written on demand. */\nexport function ensureNoMcpConfig(logDir: string): string {\n  const path = noMcpConfigPath(logDir);\n  if (!existsSync(path)) {\n    mkdirSync(logDir, { recursive: true });\n    writeFileSync(path, '{ \"mcpServers\": {} }\\n', \"utf8\");\n  }\n  return path;\n}\n\nexport function statusPath(logDir: string, id: string): string {\n  return join(logDir, `${id}.status`);\n}\n\nexport function eventsPath(logDir: string, id: string): string {\n  return join(logDir, `${id}.jsonl`);\n}\n\nexport function ledgerPath(logDir: string): string {\n  return join(logDir, \"ledger.log\");\n}\n\nexport function routingStatePath(logDir: string): string {\n  return join(logDir, \"routing-state.json\");\n}\n\nexport function panesDir(logDir: string): string {\n  return join(logDir, \"panes\");\n}\n\n/**\n * The strict empty MCP config handed to headless workers. Written into the\n * logDir on demand (never into the user's vendor config directory — this is\n * PAI state, not vendor state).\n */\nexport function noMcpConfigPath(logDir: string): string {\n  return join(logDir, \"no-mcp.json\");\n}\n","/**\n * args.ts — parse the claude-args tail that `pai worker run` receives.\n *\n * The runner needs a few things out of the caller's argument vector: the\n * prompt (for the default label), the requested --output-format (so the final\n * print matches what plain `claude -p` would have produced), whether the\n * caller already chose a --model or an --mcp-config (both suppress the\n * defaults the runner would otherwise force), any --mcp allowlist names, any\n * --allowedTools grants (their mcp__server__… entries decide which servers\n * load), and whether they appended their own system prompt (the worker\n * contract is then added alongside, not instead). Everything is passed\n * through untouched — the runner never rewrites the caller's task.\n */\n\nexport interface ParsedRunnerArgs {\n  /** Prompt string after -p/--print, when the run is headless. */\n  prompt: string | null;\n  /** Caller's --output-format: text (default), json, or stream-json. */\n  outputFormat: \"text\" | \"json\" | \"stream-json\";\n  /** Args to hand to claude (minus --output-format/--verbose, which we add). */\n  rest: string[];\n  /** Headless: a -p/--print flag is present. */\n  headless: boolean;\n  /** Caller passed --model (or --model=…): do not force the provider model. */\n  callerModel: boolean;\n  /** Caller passed --mcp-config (or --mcp-config=…): keep their MCP setup. */\n  callerMcpConfig: boolean;\n  /** Caller passed --append-system-prompt: the contract is added alongside. */\n  callerSystemPrompt: boolean;\n  /** The caller's --append-system-prompt texts, pulled out of `rest` (claude keeps only the last flag). */\n  callerSystemPrompts: string[];\n  /** Caller passed --tools (or --tools=…): a project's `pai project tools` pin does not apply. */\n  callerTools: boolean;\n  /** --mcp values (repeatable, comma-separated inside one flag). */\n  mcp: string[];\n  /** --allowedTools values (repeatable, comma-separated inside one flag). */\n  allowedTools: string[];\n}\n\nexport function parseRunnerArgs(argv: string[]): ParsedRunnerArgs {\n  let prompt: string | null = null;\n  let outputFormat: ParsedRunnerArgs[\"outputFormat\"] = \"text\";\n  const rest: string[] = [];\n  let headless = false;\n  let callerModel = false;\n  let callerMcpConfig = false;\n  let callerSystemPrompt = false;\n  const callerSystemPrompts: string[] = [];\n  let callerTools = false;\n  const mcp: string[] = [];\n  const allowedTools: string[] = [];\n\n  let i = 0;\n  while (i < argv.length) {\n    const a = argv[i];\n    if (a === \"-p\" || a === \"--print\") {\n      headless = true;\n      rest.push(a);\n      if (i + 1 < argv.length && !argv[i + 1].startsWith(\"-\")) {\n        prompt = argv[i + 1];\n        rest.push(prompt);\n        i += 1;\n      }\n    } else if (a === \"--output-format\") {\n      const v = argv[i + 1];\n      if (v === \"json\" || v === \"stream-json\") outputFormat = v;\n      i += 1; // dropped; the runner prints the result in this format itself\n    } else if (a.startsWith(\"--output-format=\")) {\n      const v = a.slice(\"--output-format=\".length);\n      if (v === \"json\" || v === \"stream-json\") outputFormat = v;\n    } else if (a === \"--verbose\") {\n      // dropped; re-added by the runner\n    } else if (a === \"--append-system-prompt\") {\n      callerSystemPrompt = true;\n      if (i + 1 < argv.length) callerSystemPrompts.push(argv[++i]);\n    } else if (a.startsWith(\"--append-system-prompt=\")) {\n      callerSystemPrompt = true;\n      callerSystemPrompts.push(a.slice(\"--append-system-prompt=\".length));\n    } else if (a === \"--mcp\") {\n      const v = argv[i + 1];\n      if (v !== undefined && !v.startsWith(\"-\")) {\n        mcp.push(v);\n        i += 1;\n      }\n    } else if (a.startsWith(\"--mcp=\")) {\n      mcp.push(a.slice(\"--mcp=\".length));\n    } else if (a === \"--allowedTools\") {\n      // captured for the MCP derivation, but still claude's flag: it passes through\n      rest.push(a);\n      const v = argv[i + 1];\n      if (v !== undefined && !v.startsWith(\"-\")) {\n        allowedTools.push(v);\n        rest.push(v);\n        i += 1;\n      }\n    } else if (a.startsWith(\"--allowedTools=\")) {\n      allowedTools.push(a.slice(\"--allowedTools=\".length));\n      rest.push(a);\n    } else {\n      if (a === \"--model\") callerModel = true;\n      if (a.startsWith(\"--model=\")) callerModel = true;\n      if (a === \"--mcp-config\") callerMcpConfig = true;\n      if (a.startsWith(\"--mcp-config=\")) callerMcpConfig = true;\n      if (a === \"--tools\") callerTools = true;\n      if (a.startsWith(\"--tools=\")) callerTools = true;\n      if (\n        prompt === null && !a.startsWith(\"-\") && rest.length > 0 &&\n        (rest[rest.length - 1] === \"-p\" || rest[rest.length - 1] === \"--print\")\n      ) {\n        prompt = a;\n      }\n      rest.push(a);\n    }\n    i += 1;\n  }\n\n  return {\n    prompt,\n    outputFormat,\n    rest,\n    headless,\n    callerModel,\n    callerMcpConfig,\n    callerSystemPrompt,\n    callerSystemPrompts,\n    callerTools,\n    mcp,\n    allowedTools,\n  };\n}\n\n/**\n * The one --append-system-prompt flag for a spawn: claude keeps only the LAST\n * occurrence, so every piece is joined (blank line between) into a single flag.\n * Empty parts are dropped; no parts, no flag.\n */\nexport function appendSystemPromptArgs(parts: string[]): string[] {\n  const text = parts.filter((p) => p.trim()).join(\"\\n\\n\");\n  return text ? [\"--append-system-prompt\", text] : [];\n}\n\n/**\n * Turn `-p \"<prompt>\"` into bare `-p` (same for --print): for stream-json\n * stdin runs the prompt moves to the first user message on stdin, so the\n * value must not stay on the command line. Only prompt values directly\n * following the flag are touched; everything else passes through.\n */\nexport function stripPromptValues(argv: string[]): string[] {\n  const out: string[] = [];\n  for (let i = 0; i < argv.length; i++) {\n    const a = argv[i];\n    const isPrint = a === \"-p\" || a === \"--print\";\n    out.push(a);\n    if (isPrint && i + 1 < argv.length && !argv[i + 1].startsWith(\"-\")) {\n      i += 1; // drop the prompt value; the flag itself stays\n    }\n  }\n  return out;\n}\n\n/**\n * A one-line stderr hint (never blocking) for an inline -p prompt long or\n * multi-line enough to be a shell-quoting risk — write it to a file and pass\n * --spec instead. null when the prompt is short/simple enough to be fine.\n */\nexport function longInlinePromptHint(prompt: string | null): string | null {\n  if (!prompt) return null;\n  const newlines = (prompt.match(/\\n/g) ?? []).length;\n  if (prompt.length > 600 || newlines > 3) {\n    return \"hint: long inline prompts break on shell quoting — write the spec to a file and use --spec <file>\";\n  }\n  return null;\n}\n\n/** Collapse whitespace and cut to n chars with an ellipsis (label rendering). */\nexport function shortText(s: unknown, n: number): string {\n  const t = String(s ?? \"\").split(/\\s+/).filter(Boolean).join(\" \");\n  return t.length <= n ? t : t.slice(0, n - 1) + \"…\";\n}\n","/**\n * status.ts — the live per-worker status file.\n *\n * One JSON file per run, rewritten atomically on every turn, read by `ps`,\n * `follow`, the status line and the pane logic. Same field set the Python\n * runner wrote, plus `provider` (routing is multi-provider now) and `session`\n * (the AIBroker identity of the launching session, see scope.ts).\n */\n\nimport { execFileSync } from \"node:child_process\";\nimport {\n  existsSync,\n  mkdirSync,\n  readFileSync,\n  readdirSync,\n  renameSync,\n  rmSync,\n  writeFileSync,\n} from \"node:fs\";\nimport { join } from \"node:path\";\nimport { shortText } from \"./args.js\";\nimport { statusPath } from \"./paths.js\";\n\nexport interface WorkerSessionRef {\n  /** AIBroker/iTerm session id (the iTerm UUID). */\n  id: string;\n  /** AIBroker name of that session, when it has one. */\n  name: string;\n}\n\nexport interface WorkerStatus {\n  id: string;\n  pid: number;\n  label: string;\n  cwd: string;\n  /** iTerm session id of the launching terminal (\"\" outside iTerm). */\n  term: string;\n  provider: string;\n  model: string;\n  state: \"running\" | \"done\" | \"failed\" | \"killed\" | \"lost\";\n  started: string;\n  updated: string;\n  turns: number;\n  tools: number;\n  last: string;\n  rc: number | null;\n  secs: number | null;\n  /** Launching session resolved through AIBroker, when it was. */\n  session?: WorkerSessionRef | null;\n  /** Claude Code session id (system/init) — what `resume` continues. */\n  claudeSession?: string | null;\n  /**\n   * Claude Code session id of the orchestrator whose Bash launched this run,\n   * when the status line's session map knew it (see scope.ts). Distinct from\n   * claudeSession, which is the run's own session.\n   */\n  spawnerSession?: string | null;\n  /** Context meter: tokens of the last assistant turn (input+cache+output). */\n  contextTokens?: number | null;\n  /** Context meter: window size (init model info or provider default). */\n  contextWindow?: number | null;\n  /** Path the prompt was read from via --spec (\"-\" for stdin), when it was. */\n  spec?: string | null;\n  /**\n   * Caller's --output-format, when the run was headless. A json/stream-json\n   * caller reads its own result and is notified on process exit by the\n   * harness — supervision.ts uses this to skip the duplicate relay send.\n   */\n  outputFormat?: \"text\" | \"json\" | \"stream-json\";\n  /** Chain this stage belongs to (the chain id), when it is a chain stage. */\n  parent?: string;\n  /** Class name of the chain stage (\"draft\", \"implement\", …). */\n  stage?: string;\n  /** Worktree this run executed in, when it got one (see worktree.ts). */\n  worktreeDir?: string | null;\n  /** Branch the worker committed on (worker/<id>), set on worktree runs. */\n  branch?: string | null;\n  /** Commit the branch started from (worktree base) for the commits count. */\n  worktreeBase?: string | null;\n  /** Whether `worktreeBase` is a snapshot of uncommitted checkout state, not HEAD. */\n  worktreeSnapshot?: boolean | null;\n  /** Commits the worker made on its branch; set with `branch` on success. */\n  commits?: number | null;\n  /** Set by `pai worker merge` once the branch landed in the original checkout. */\n  merged?: boolean;\n  /** Set by `pai worker gc`: the hidden ref (refs/pai-archive/<id>) holding the leftover worktree's state. */\n  archived?: string | null;\n  /**\n   * How the run came to be: \"spawn\" (a `pai worker run` subagent) or \"chat\"\n   * (the terminal's interactive pane itself, tracked like a worker). Absent\n   * on statuses written before the flag existed — read as a spawn.\n   */\n  origin?: \"spawn\" | \"chat\";\n  /** Which contract/parser this run used for its final report (see report.ts). */\n  reportFormat?: \"json\" | \"ag2\";\n  /** Whether the final AG2 report passed `aibroker agentish check`; unset for json reports or when no validator ran. */\n  reportValid?: boolean;\n  /** Validation error messages, when reportValid is false. */\n  reportErrors?: string[];\n  /** Whether the headless prompt got the end-of-turn \"final message must be…\" trailer line. */\n  promptTrailer?: boolean;\n  /** Whether an invalid AG2 final message triggered the one bounded re-ask (see run.ts). */\n  reportRetried?: boolean;\n  /**\n   * Consecutive failed tool executions in this run, maintained by the runner's\n   * stream loop (0 after any success). Absent on old status files — every\n   * reader must treat that as \"no signal\".\n   */\n  consecFails?: number | null;\n  /**\n   * Seconds of the most recent single long sleep observed in a Bash tool_use\n   * (see parseSleepSecs), cleared when the command completes. Absent on old\n   * status files.\n   */\n  sleepSec?: number | null;\n  /** Epoch ms the run is stopped at (deadline.ts); absent = no limit. */\n  deadlineAt?: number | null;\n  /** Limit in minutes the deadline was derived from. */\n  maxMinutes?: number | null;\n  /** The deadline stopped this run (state failed, `last` says why). */\n  timedOut?: boolean;\n  /** Launching process (the parent of `pai worker run`) at start, and its command name. */\n  parentPid?: number;\n  parentComm?: string;\n  parentBackground?: boolean;\n  /** Why the run ended (endreason.ts): exit, deadline, pai-worker-kill, parent-gone, external-signal. */\n  endReason?: string;\n  /** Who asked for the stop, when known (kill caller, daemon:<reason>). */\n  endBy?: string;\n  /** Detail for the reason (signal, sender note). */\n  endNote?: string;\n  /** Ever granted clickr desktop controls (see controls.ts) — the runner returns them best-effort on exit. */\n  controlsHeld?: boolean;\n}\n\n/** Label a worker gets when launched with neither --label nor a prompt. */\nexport const UNLABELED = \"unlabeled\";\n\n/**\n * Whether a status is the terminal's interactive chat pane, not a spawned\n * task worker. `origin` is the real discriminator; the fallback catches\n * running entries from before the flag existed (unlabeled, no turns yet).\n * Removable once every pane runs code that writes `origin`.\n */\nexport function isChatPane(s: Pick<WorkerStatus, \"origin\" | \"label\" | \"turns\">): boolean {\n  return (\n    s.origin === \"chat\" ||\n    (!s.origin && (s.label === UNLABELED || s.label === \"(no prompt)\") && s.turns === 0)\n  );\n}\n\n/** Context-meter percentage 0–100, null when the numbers are missing. */\nexport function contextPercent(s: Pick<WorkerStatus, \"contextTokens\" | \"contextWindow\">): number | null {\n  if (!s.contextTokens || !s.contextWindow) return null;\n  return Math.round((s.contextTokens / s.contextWindow) * 100);\n}\n\n/** Compact token count: 84k, 200k, 900. */\nexport function fmtContextK(n: number): string {\n  return n >= 1000 ? `${Math.round(n / 1000)}k` : String(n);\n}\n\n/**\n * The one context-meter label, shared by every renderer so identical\n * numbers always render identically: `ctx 84k/200k (42%)` — used-style\n * percent. Empty when the numbers are missing (callers drop the part).\n */\nexport function contextLabel(\n  s: Pick<WorkerStatus, \"contextTokens\" | \"contextWindow\">\n): string {\n  const pct = contextPercent(s);\n  if (pct === null) return \"\";\n  return `ctx ${fmtContextK(s.contextTokens ?? 0)}/${fmtContextK(s.contextWindow ?? 0)} (${pct}%)`;\n}\n\n/** Timestamp format shared by status files and the ledger. */\nexport function nowStamp(d: Date = new Date()): string {\n  const p = (n: number) => String(n).padStart(2, \"0\");\n  return (\n    `${d.getFullYear()}-${p(d.getMonth() + 1)}-${p(d.getDate())} ` +\n    `${p(d.getHours())}:${p(d.getMinutes())}:${p(d.getSeconds())}`\n  );\n}\n\n// second-resolution ids repeat when two workers/chains start together in one\n// process; a repeat gets a monotonic suffix so files never collide\nlet lastId = \"\";\nlet idSeq = 0;\n\nexport function newWorkerId(d: Date = new Date(), pid = process.pid): string {\n  const p = (n: number) => String(n).padStart(2, \"0\");\n  const base = `${d.getFullYear()}${p(d.getMonth() + 1)}${p(d.getDate())}-${p(d.getHours())}${p(d.getMinutes())}${p(d.getSeconds())}-${pid}`;\n  if (base === lastId) {\n    idSeq += 1;\n    return `${base}-${String(idSeq).padStart(2, \"0\")}`;\n  }\n  lastId = base;\n  idSeq = 0;\n  return base;\n}\n\n// Temp names must be unique per writer, not just per worker: two processes\n// legitimately write the same id at the same moment (`pai worker kill` marking\n// a run killed while the run's own SIGTERM handler writes its terminal state).\n// With one shared `<id>.status.tmp` they clobber each other's temp file and the\n// loser's rename fails with ENOENT — observed live on 2026-09-19.\nlet tmpSeq = 0;\n\n/** A temp path only this call owns — never the same string twice. */\nexport function statusTmpPath(logDir: string, id: string): string {\n  return `${statusPath(logDir, id)}.${process.pid}.${tmpSeq++}.tmp`;\n}\n\n// The label this process first wrote for a given worker id: run.ts holds one\n// unchanging label in memory for the whole run and passes it to every\n// periodic saveStatus call, so a later call whose label still equals this\n// baseline is that unmodified write, never an intentional change — on-disk\n// then wins, so an external `pai worker goal` relabel between two of a\n// worker's own writes survives instead of being reverted by the next one. A\n// call whose label differs from the baseline (or the first call for an id in\n// this process, which has no baseline yet) IS the intentional change and\n// always wins — exactly the one-shot `pai worker goal` process itself.\nconst firstWrittenLabel = new Map<string, string>();\n\n/** Write status atomically (temp + rename) and stamp `updated`. */\nexport function saveStatus(logDir: string, status: WorkerStatus, d: Date = new Date()): void {\n  status.updated = nowStamp(d);\n  const path = statusPath(logDir, status.id);\n  const baseline = firstWrittenLabel.get(status.id);\n  if (baseline === undefined) {\n    firstWrittenLabel.set(status.id, status.label);\n  }\n  const onDisk = baseline === undefined ? undefined : loadStatus(logDir, status.id);\n  if (onDisk) {\n    if (status.label === baseline && onDisk.label !== status.label) status.label = onDisk.label;\n    // Set by another process (`pai worker controls`); a true flag is never dropped by a stale in-memory copy.\n    if (onDisk.controlsHeld) status.controlsHeld = true;\n  }\n  const tmp = statusTmpPath(logDir, status.id);\n  if (!existsSync(logDir)) mkdirSync(logDir, { recursive: true });\n  try {\n    writeFileSync(tmp, JSON.stringify(status), \"utf8\");\n    renameSync(tmp, path);\n  } catch (e) {\n    try {\n      rmSync(tmp, { force: true });\n    } catch {\n      // nothing to clean up\n    }\n    throw e;\n  }\n}\n\n/**\n * Set a worker's goal (the operator's `--label`), atomically, through the\n * same saveStatus path everything else writes with. Used by `pai worker\n * goal` and the `--goal` option of `say`: a fresh call in a fresh process, so\n * it always carries no baseline yet and always wins over the worker's own\n * next periodic write (see saveStatus above).\n */\nexport function setWorkerLabel(logDir: string, id: string, label: string): WorkerStatus {\n  const status = loadStatus(logDir, id);\n  if (!status) throw new Error(`no worker named \"${id}\"`);\n  status.label = label;\n  saveStatus(logDir, status);\n  return status;\n}\n\n/** Load every status file in the logDir, oldest id first, skipping damage. */\nexport function loadStatuses(logDir: string): WorkerStatus[] {\n  if (!existsSync(logDir)) return [];\n  const out: WorkerStatus[] = [];\n  for (const name of readdirSync(logDir).sort()) {\n    if (!name.endsWith(\".status\")) continue;\n    try {\n      out.push(JSON.parse(readFileSync(join(logDir, name), \"utf8\")) as WorkerStatus);\n    } catch {\n      // a half-written or damaged status file is not worth a crash\n    }\n  }\n  return out;\n}\n\nexport function loadStatus(logDir: string, id: string): WorkerStatus | null {\n  const path = statusPath(logDir, id);\n  if (!existsSync(path)) return null;\n  try {\n    return JSON.parse(readFileSync(path, \"utf8\")) as WorkerStatus;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Wait for a worker to record its own terminal state (the run's signal\n * handler writes killed/rc/secs). Returns that status, or null when it is\n * still \"running\" after `timeoutMs` — the caller then writes the state itself.\n */\nexport async function waitForTerminalStatus(\n  logDir: string,\n  id: string,\n  timeoutMs = 2000,\n  stepMs = 50\n): Promise<WorkerStatus | null> {\n  const deadline = Date.now() + timeoutMs;\n  for (;;) {\n    const s = loadStatus(logDir, id);\n    if (s && s.state !== \"running\") return s;\n    if (Date.now() >= deadline) return null;\n    await new Promise((r) => setTimeout(r, stepMs));\n  }\n}\n\nexport function alive(pid: number | null | undefined): boolean {\n  if (!pid || pid <= 0) return false;\n  try {\n    process.kill(pid, 0);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Whether `status.pid` still names the process that was started as this\n * worker, not a later, unrelated process the OS handed the same pid to after\n * the worker exited. `alive()` alone can't tell these apart — a pid observed\n * live on 2026-09-19 (worker 20260919-083549-90913) had been reused, and\n * `pai worker kill` signalled the wrong, unrelated process. `ps -o lstart=`\n * reads the running process's actual start time and compares it against the\n * status file's own `started` stamp; a reused pid almost never starts within\n * 120s of the original, so a wider drift means \"different process\".\n */\nexport function ownsPid(status: Pick<WorkerStatus, \"pid\" | \"started\">): boolean {\n  if (status.pid <= 0 || !alive(status.pid)) return false;\n  try {\n    const out = execFileSync(\"ps\", [\"-o\", \"lstart=\", \"-p\", String(status.pid)], {\n      encoding: \"utf8\",\n      env: { ...process.env, LC_ALL: \"C\" },\n    }).trim();\n    const psStart = Date.parse(out);\n    const started = Date.parse(status.started.replace(\" \", \"T\"));\n    if (Number.isNaN(psStart) || Number.isNaN(started)) return alive(status.pid);\n    return Math.abs(psStart - started) <= 120_000;\n  } catch {\n    // pid exited between the alive() check and the ps call, or ps failed for\n    // another reason — the pid-existence check is still better than nothing.\n    return alive(status.pid);\n  }\n}\n\n/** Whether a status is both marked \"running\" and still owns its recorded pid. */\nexport function isLive(status: Pick<WorkerStatus, \"pid\" | \"started\" | \"state\">): boolean {\n  return status.state === \"running\" && ownsPid(status);\n}\n\n/** \"42s\" under 90s, \"7m\" above — the coarse age the table and bar show. */\nexport function ageOf(ts: string, now: Date = new Date()): string {\n  const t = Date.parse(ts.replace(\" \", \"T\"));\n  if (Number.isNaN(t)) return \"?\";\n  const s = Math.max(0, Math.floor((now.getTime() - t) / 1000));\n  return s < 90 ? `${s}s` : `${Math.floor(s / 60)}m`;\n}\n\n/** Precise elapsed time: \"45s\", \"1m 23s\", \"12m 05s\", \"1h 02m 05s\" — seconds zero-padded after a larger unit. */\nexport function elapsedOf(ts: string, now: Date = new Date()): string {\n  const t = Date.parse(ts.replace(\" \", \"T\"));\n  if (Number.isNaN(t)) return \"?\";\n  const secs = Math.max(0, Math.floor((now.getTime() - t) / 1000));\n  const hours = Math.floor(secs / 3600);\n  const mins = Math.floor((secs % 3600) / 60);\n  const sec = secs % 60;\n  if (hours > 0) return `${hours}h ${String(mins).padStart(2, \"0\")}m ${String(sec).padStart(2, \"0\")}s`;\n  if (mins > 0) return `${mins}m ${String(sec).padStart(2, \"0\")}s`;\n  return `${sec}s`;\n}\n\n/** Shorter sleeps are legitimate polling — not worth a supervision event. */\nexport const SLEEP_FLOOR_SECS = 60;\n\nconst SLEEP_RE = /^\\s*sleep\\s+([0-9]+(?:\\.[0-9]+)?)([smhd]?)\\s*(?:$|[;&|])/;\n\n/** s/m/h/d suffix to seconds multiplier, shared by every `sleep N<unit>` parse below. */\nfunction sleepUnitMultiplier(unit: string): number {\n  return unit === \"m\" ? 60 : unit === \"h\" ? 3600 : unit === \"d\" ? 86_400 : 1;\n}\n\n/**\n * Seconds of a `sleep N` (N plain or with an s/m/h/d suffix) that stands alone\n * or leads a compound command (`sleep 150; cat f`, `sleep 2m && tail f`,\n * `sleep 90 || true`, `sleep 60 &`), or null when no long sleep leads: anchored\n * to the start of the command, so a filename containing \"sleep\" or an\n * `echo sleep 500` never trips it, and floored at SLEEP_FLOOR_SECS so ordinary\n * polling stays invisible.\n */\nexport function parseSleepSecs(command: string): number | null {\n  const m = command.match(SLEEP_RE);\n  if (!m) return null;\n  const secs = Number(m[1]) * sleepUnitMultiplier(m[2]);\n  return Number.isFinite(secs) && secs >= SLEEP_FLOOR_SECS ? secs : null;\n}\n\n/**\n * Every command-segment boundary a shell recognises before a new simple\n * command can start: the very start of the string, `;`, `&`/`&&`, `|`/`||`,\n * a newline, an opening `(` or `{` (also covers `$(...)`, which ends in `(`),\n * or the keywords `do`/`then`. Segment end is the mirror image plus a closing\n * `)`, so `sleep 90` inside `$(sleep 90)` or `(sleep 90)` still counts.\n */\n// The terminator is a lookahead, not a consumed match: two sleeps sharing one\n// separator (`sleep 65; sleep 590`) both need that `;` available as their own\n// boundary — matchAll never revisits a character a previous match consumed.\nconst SLEEP_SEGMENT_RE =\n  /(?:^|[;&|\\n(){]|\\bdo\\b|\\bthen\\b)\\s*sleep\\s+([0-9]+(?:\\.[0-9]+)?)([smhd]?)(?=\\s*(?:$|[;&|)\\n]))/g;\n\n/**\n * The longest `sleep N` found as its OWN command segment anywhere in\n * `command` — not just leading it, unlike {@link parseSleepSecs} — or null\n * when none reaches SLEEP_FLOOR_SECS. Used by the PreToolUse Bash gate\n * (block-sleep-poll.ts), which must catch a sleep buried after `&&`, inside a\n * `do ... done` loop, or in a subshell, not only one that leads the command.\n */\nexport function longestSleepSecs(command: string): number | null {\n  let longest: number | null = null;\n  for (const m of command.matchAll(SLEEP_SEGMENT_RE)) {\n    const secs = Number(m[1]) * sleepUnitMultiplier(m[2]);\n    if (!Number.isFinite(secs) || secs < SLEEP_FLOOR_SECS) continue;\n    if (longest === null || secs > longest) longest = secs;\n  }\n  return longest;\n}\n\nconst LOOP_RE = /\\b(for|while|until)\\b([^;\\n]*)[;\\n]\\s*do\\b([\\s\\S]*?)\\bdone\\b/g;\n\nfunction sleepSum(text: string): number {\n  let sum = 0;\n  for (const m of text.matchAll(SLEEP_SEGMENT_RE)) {\n    const secs = Number(m[1]) * sleepUnitMultiplier(m[2]);\n    if (Number.isFinite(secs)) sum += secs;\n  }\n  return sum;\n}\n\n/** Iterations of a `for x in <words>` header, or null when not provably small. */\nfunction forIterations(header: string): number | null {\n  const words = header.replace(/^\\s*\\w+\\s+in\\s+/, \"\").trim();\n  if (words === header.trim() || /[$`*?]/.test(words)) return null;\n  const range = /^\\{(-?\\d+)\\.\\.(-?\\d+)\\}$/.exec(words);\n  if (range) return Math.abs(Number(range[2]) - Number(range[1])) + 1;\n  return words ? words.split(/\\s+/).length : 0;\n}\n\n/**\n * Total sleep of one Bash command: every `sleep N` segment counted once, plus\n * loop repetition — `for x in a b c` multiplies its body by the word count;\n * `while`/`until` and any unbounded `for` count as at least SLEEP_FLOOR_SECS,\n * except a `kill -0` job-wait (the sanctioned wait-for-a-job loop). Used by\n * the PreToolUse gate so `sleep 58; sleep 58` is caught as the 116 s it is.\n */\n// ponytail: loops are not nested-aware (body ends at the first `done`); upgrade to a real shell parse if that bites.\nexport function totalSleepSecs(command: string): number {\n  let total = sleepSum(command);\n  for (const m of command.matchAll(LOOP_RE)) {\n    const body = sleepSum(m[3]);\n    if (body === 0) continue;\n    if (m[1] === \"for\") {\n      const n = forIterations(m[2]);\n      total += n === null ? Math.max(SLEEP_FLOOR_SECS, body) : body * (n - 1);\n    } else if (!/\\bkill\\s+-0\\b/.test(m[2])) {\n      total += SLEEP_FLOOR_SECS;\n    }\n  }\n  return total;\n}\n\n/** One-line description of a tool call, e.g. \"Bash: npm test\". */\nexport function describeTool(name: string, inp: unknown): string {\n  if (typeof inp !== \"object\" || inp === null) return name;\n  const i = inp as Record<string, unknown>;\n  const get = (k: string) => (typeof i[k] === \"string\" ? (i[k] as string) : \"\");\n  if (name === \"Bash\") return `Bash: ${shortText(get(\"command\"), 70)}`;\n  if (name === \"Read\" || name === \"Edit\" || name === \"Write\" || name === \"MultiEdit\") {\n    const file = get(\"file_path\").split(\"/\").pop() ?? \"\";\n    return `${name}: ${file}`;\n  }\n  if (name === \"Grep\" || name === \"Glob\") return `${name}: ${shortText(get(\"pattern\"), 50)}`;\n  if (name === \"WebSearch\") return `${name}: ${shortText(get(\"query\"), 50)}`;\n  if (name === \"WebFetch\") return `${name}: ${shortText(get(\"url\"), 60)}`;\n  return name;\n}\n","/**\n * ledger.ts — the routing ledger, one append-only log for every worker event.\n *\n * Line shapes (whitespace-aligned so `tail` reads as a table):\n *\n *   2026-09-17 12:00:00 WORKER-START id=<id> provider=<p> mode=headless model=<m> cwd=<cwd> label=<label>\n *   2026-09-17 12:01:00 WORKER-END   id=<id> provider=<p> mode=headless model=<m> rc=0 secs=60 turns=3 tools=8 label=<label>\n *   2026-09-17 12:00:20 WORKER-REROUTE from=<a> to=<b> reason=quota\n *   2026-09-17 12:00:00 DENIED-ANTHROPIC-AGENT cwd=<cwd> desc=<desc>\n *   2026-09-17 12:00:00 ALLOWED-ANTHROPIC-AGENT cwd=<cwd> desc=<desc>\n *\n * `pai worker log` (and glm-log before it) counts these; keep the tags stable.\n */\n\nimport { appendFileSync, existsSync, mkdirSync, readFileSync } from \"node:fs\";\nimport { dirname } from \"node:path\";\n\nexport function ledgerStamp(d: Date = new Date()): string {\n  const p = (n: number) => String(n).padStart(2, \"0\");\n  return (\n    `${d.getFullYear()}-${p(d.getMonth() + 1)}-${p(d.getDate())} ` +\n    `${p(d.getHours())}:${p(d.getMinutes())}:${p(d.getSeconds())}`\n  );\n}\n\nexport interface LedgerLine {\n  stamp: string;\n  event: string;\n  fields: Record<string, string>;\n}\n\n/** Parse `2026-09-17 12:00:00 TAG key=value …` into its parts. */\nexport function parseLedgerLine(line: string): LedgerLine | null {\n  const m = line.match(/^(\\d{4}-\\d{2}-\\d{2} \\d{2}:\\d{2}:\\d{2}) (\\S+)(?: (.*))?$/);\n  if (!m) return null;\n  const fields: Record<string, string> = {};\n  // values are whitespace-collapsed by the writers, so spaces safely delimit\n  for (const part of (m[3] ?? \"\").split(\" \")) {\n    if (!part) continue;\n    const eq = part.indexOf(\"=\");\n    if (eq <= 0) continue;\n    fields[part.slice(0, eq)] = part.slice(eq + 1);\n  }\n  return { stamp: m[1], event: m[2], fields };\n}\n\nexport function parseLedger(text: string): LedgerLine[] {\n  const out: LedgerLine[] = [];\n  for (const line of text.split(\"\\n\")) {\n    if (!line.trim()) continue;\n    const parsed = parseLedgerLine(line);\n    if (parsed) out.push(parsed);\n  }\n  return out;\n}\n\n/** Append one ledger line. `kv` order is the caller's; values are flattened. */\nexport function appendLedger(\n  path: string,\n  event: string,\n  kv: Record<string, string | number | null | undefined>,\n  now: Date = new Date()\n): void {\n  const parts: string[] = [];\n  for (const [k, v] of Object.entries(kv)) {\n    if (v === undefined || v === null) continue;\n    parts.push(`${k}=${String(v).replace(/\\s+/g, \" \")}`);\n  }\n  const dir = dirname(path);\n  if (!existsSync(dir)) mkdirSync(dir, { recursive: true });\n  const tail = parts.length ? \" \" + parts.join(\" \") : \"\";\n  appendFileSync(path, `${ledgerStamp(now)} ${event}${tail}\\n`, \"utf8\");\n}\n\nexport interface LedgerSummary {\n  scope: string;\n  started: number;\n  endedOk: number;\n  endedFailed: number;\n  denied: number;\n  allowed: number;\n  reroutes: number;\n  lastLines: string[];\n}\n\n/** The counts `pai worker log` prints, over today's lines or the whole file. */\nexport function ledgerSummary(\n  path: string,\n  scope: \"today\" | \"all\",\n  lastN = 15,\n  now: Date = new Date()\n): LedgerSummary | null {\n  if (!existsSync(path)) return null;\n  const text = readFileSync(path, \"utf8\");\n  const today = ledgerStamp(now).slice(0, 10);\n  const lines = text.split(\"\\n\").filter((l) => l.trim());\n  const scoped =\n    scope === \"all\" ? lines : lines.filter((l) => l.startsWith(today));\n  const parsed = scoped.map(parseLedgerLine).filter((x): x is LedgerLine => x !== null);\n  const count = (ev: string) => parsed.filter((p) => p.event === ev).length;\n  const ends = parsed.filter((p) => p.event === \"WORKER-END\");\n  const ok = ends.filter((p) => p.fields.rc === \"0\").length;\n  return {\n    scope: scope === \"all\" ? \"all time\" : `today ${today}`,\n    started: count(\"WORKER-START\"),\n    endedOk: ok,\n    endedFailed: ends.length - ok,\n    denied: count(\"DENIED-ANTHROPIC-AGENT\"),\n    allowed: count(\"ALLOWED-ANTHROPIC-AGENT\"),\n    reroutes: count(\"WORKER-REROUTE\"),\n    lastLines: lines.slice(-lastN),\n  };\n}\n","/**\n * Pending worker results: finished workers whose worktree branch still holds\n * work that never reached the repo (commits not in HEAD, or uncommitted\n * files). Surfaced by `pai worker ps/pending`, the SessionStart hook, the\n * status line and the prepublish gate so an unmerged fix cannot be forgotten.\n */\n\nimport { existsSync, readFileSync, statSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { isLive, loadStatuses } from \"./status.js\";\nimport { statusPath } from \"./paths.js\";\nimport { git, uncommittedPaths } from \"./worktree.js\";\n\nexport interface PendingResult {\n  id: string;\n  label: string;\n  repo: string;\n  /** ms since the worker's status file last changed (its end). */\n  ageMs: number;\n  age: string;\n  /** commits on the branch not in the repo's HEAD (patch-id aware). */\n  commits: number;\n  /** uncommitted paths in the worktree, node_modules excluded. */\n  dirty: number;\n}\n\n/** Stale after this long: `pai worker gc` (archive) instead of merge. */\nexport const STALE_HOURS = 24;\n\nfunction toplevel(dir: string): string | null {\n  try {\n    return git(dir, [\"rev-parse\", \"--show-toplevel\"]);\n  } catch {\n    return null;\n  }\n}\n\nfunction fmtAge(ms: number): string {\n  const h = Math.floor(ms / 3_600_000);\n  return h >= 48 ? `${Math.floor(h / 24)}d` : h >= 1 ? `${h}h` : `${Math.floor(ms / 60_000)}m`;\n}\n\n/** Finished workers with unmerged work; `repoRoot` limits to one repo, else every repo. */\nexport function pendingResults(logDir: string, repoRoot?: string, now = Date.now()): PendingResult[] {\n  const want = repoRoot ? toplevel(repoRoot) : null;\n  if (repoRoot && !want) return [];\n  const out: PendingResult[] = [];\n  for (const st of loadStatuses(logDir)) {\n    if (st.archived || st.merged || isLive(st)) continue;\n    if (!st.worktreeDir || !existsSync(st.worktreeDir)) continue;\n    const repo = toplevel(st.cwd);\n    if (!repo || (want && repo !== want)) continue;\n    let commits = 0;\n    let dirty = 0;\n    try {\n      if (st.branch) {\n        commits = git(repo, [\"cherry\", \"HEAD\", `refs/heads/${st.branch}`])\n          .split(\"\\n\")\n          .filter((l) => l.startsWith(\"+\")).length;\n      }\n      dirty = uncommittedPaths(st.worktreeDir).filter((p) => !/(^|\\/)node_modules(\\/|$)/.test(p)).length;\n    } catch {\n      continue; // branch or worktree unreadable: nothing verifiable to report\n    }\n    if (!commits && !dirty) continue;\n    let ageMs = 0;\n    try {\n      ageMs = Math.max(0, now - statSync(statusPath(logDir, st.id)).mtimeMs);\n    } catch {\n      // status vanished mid-scan: age unknown, keep the entry\n    }\n    out.push({ id: st.id, label: st.label, repo, ageMs, age: fmtAge(ageMs), commits, dirty });\n  }\n  return out;\n}\n\n/** One human line per result, with the exact next command. */\nexport function formatPending(results: PendingResult[], showRepo = false): string {\n  return results\n    .map((r) => {\n      const next = r.ageMs > STALE_HOURS * 3_600_000 ? \"pai worker gc\" : `pai worker merge ${r.id}`;\n      const repo = showRepo ? `  ${r.repo}` : \"\";\n      return `${r.id}  ${r.age}  ${r.commits} commit(s), ${r.dirty} dirty  ${r.label}${repo}  -> ${next}`;\n    })\n    .join(\"\\n\");\n}\n\n/**\n * Release gate: exit code and message for `pai worker pending --gate`.\n * PAI_ALLOW_PENDING=1 overrides.\n */\nexport function pendingGate(\n  results: PendingResult[],\n  env: NodeJS.ProcessEnv = process.env\n): { code: number; message: string } {\n  if (!results.length || env.PAI_ALLOW_PENDING === \"1\") return { code: 0, message: \"\" };\n  return {\n    code: 1,\n    message:\n      `${results.length} unmerged worker result(s) in this repo — merge or discard before publishing:\\n` +\n      `${formatPending(results)}\\n` +\n      \"Override deliberately with PAI_ALLOW_PENDING=1.\",\n  };\n}\n\n/** Cached count of pending results for `cwd`'s repo (statusline/hook: cheap on repeat). */\nexport function pendingCountCached(logDir: string, cwd: string, ttlMs = 60_000, now = Date.now()): number {\n  const file = join(logDir, \"pending-cache.json\");\n  let cache: Record<string, { at: number; n: number }> = {};\n  try {\n    cache = JSON.parse(readFileSync(file, \"utf8\"));\n  } catch {\n    // no cache yet\n  }\n  const hit = cache[cwd];\n  if (hit && now - hit.at < ttlMs) return hit.n;\n  const n = pendingResults(logDir, cwd, now).length;\n  try {\n    writeFileSync(file, JSON.stringify({ ...cache, [cwd]: { at: now, n } }));\n  } catch {\n    // read-only log dir: recompute next time\n  }\n  return n;\n}\n\n/** Invalidate pending cache entries for a repo and its subdirectories. */\nexport function invalidatePendingCache(logDir: string, repoRoot: string): void {\n  const file = join(logDir, \"pending-cache.json\");\n  let cache: Record<string, { at: number; n: number }> = {};\n  try {\n    cache = JSON.parse(readFileSync(file, \"utf8\"));\n  } catch {\n    // no cache yet\n    return;\n  }\n  const resolved = repoRoot.endsWith(\"/\") ? repoRoot : `${repoRoot}/`;\n  let changed = false;\n  for (const key of Object.keys(cache)) {\n    if (key === repoRoot || key.startsWith(resolved)) {\n      delete cache[key];\n      changed = true;\n    }\n  }\n  if (!changed) return;\n  try {\n    writeFileSync(file, JSON.stringify(cache));\n  } catch {\n    // read-only log dir: best effort\n  }\n}\n","/**\n * worktree.ts — one git worktree per writing worker.\n *\n * A run whose class edits files (implement, complex, plan) and whose cwd is a\n * git repository gets its own worktree by default: `git worktree add\n * <logDir>/worktrees/<id> -b worker/<id>` from the current HEAD. The worker\n * commits its own work on that branch — the no-commit rule applies to the\n * main branch only — and the parent (or the operator) merges the result back:\n *\n *   pai worker merge <id>     git merge --no-ff worker/<id> + remove worktree + delete branch\n *   pai worker discard <id>   remove worktree and branch, keep nothing\n *\n * `ps` marks a worker with an unmerged branch `⎇`. Draft and review run in\n * place; `--no-worktree` opts out, `--worktree` forces one on.\n */\n\nimport { execFileSync } from \"node:child_process\";\nimport { existsSync, lstatSync, mkdirSync, readFileSync, mkdtempSync, writeFileSync, readdirSync, readlinkSync, realpathSync, rmSync, statSync } from \"node:fs\";\nimport { dirname, isAbsolute, join, resolve, sep } from \"node:path\";\nimport { tmpdir, platform } from \"node:os\";\nimport { isLive, loadStatus, loadStatuses, saveStatus, UNLABELED, type WorkerStatus } from \"./status.js\";\nimport { appendLedger } from \"./ledger.js\";\nimport { ledgerPath, statusPath } from \"./paths.js\";\nimport { invalidatePendingCache } from \"./pending.js\";\n\nexport function worktreesDir(logDir: string): string {\n  return join(logDir, \"worktrees\");\n}\n\nexport function worktreeBranch(id: string): string {\n  return `worker/${id}`;\n}\n\nexport function worktreePath(logDir: string, id: string): string {\n  return join(worktreesDir(logDir), id);\n}\n\n/** Run git in `cwd` with an optional env override, trimmed stdout, stderr on failure. */\nfunction runGit(cwd: string, args: string[], env?: NodeJS.ProcessEnv, timeout = 30_000): string {\n  try {\n    return execFileSync(\"git\", [\"-C\", cwd, ...args], {\n      encoding: \"utf8\",\n      timeout,\n      stdio: [\"ignore\", \"pipe\", \"pipe\"],\n      ...(env ? { env } : {}),\n    }).trim();\n  } catch (e) {\n    const err = e as { stderr?: Buffer | string; message?: string };\n    const why =\n      (typeof err.stderr === \"string\" ? err.stderr : err.stderr?.toString(\"utf8\")) ||\n      err.message ||\n      String(e);\n    throw new Error(`git ${args.join(\" \")} in ${cwd}: ${why.trim()}`);\n  }\n}\n\n/** Run git in `cwd`, returning trimmed stdout; throws with stderr on failure. */\nexport function git(cwd: string, args: string[], timeoutMs?: number): string {\n  return runGit(cwd, args, undefined, timeoutMs);\n}\n\n/** Is `cwd` inside a git repository (a .git dir — worktrees: a .git file)? */\nexport function isGitRepo(cwd: string): boolean {\n  try {\n    return git(cwd, [\"rev-parse\", \"--git-dir\"]) !== \"\";\n  } catch {\n    return false;\n  }\n}\n\n/** Tools that can write to the checkout (Bash can, via the shell). */\nconst WRITING_TOOLS = [\"Edit\", \"Write\", \"MultiEdit\", \"NotebookEdit\", \"Bash\"];\n\n/** Can a run with these --allowedTools write? No restriction at all means yes. */\nexport function toolsCanWrite(allowedTools: string[]): boolean {\n  const names = allowedTools.flatMap((e) => e.split(\",\")).map((s) => s.trim().replace(/\\(.*$/, \"\")).filter(Boolean);\n  return !names.length || names.some((n) => WRITING_TOOLS.includes(n));\n}\n\n/** How the run flags decide the worktree question; undefined = decide by default. */\nexport type WorktreeFlag = boolean | undefined;\n\n/** Should this run get a worktree? Explicit flag first, then: can it write? */\nexport function worktreeWanted(flag: WorktreeFlag, opts: { cwd: string; allowedTools: string[] }): boolean {\n  if (flag !== undefined) return flag;\n  return toolsCanWrite(opts.allowedTools) && isGitRepo(opts.cwd);\n}\n\nexport interface WorktreeInfo {\n  dir: string;\n  branch: string;\n  base: string;\n  /** `base` is a snapshot commit of uncommitted checkout state, not HEAD itself. */\n  snapshot: boolean;\n}\n\n/**\n * Commit `cwd`'s current index + working tree (including untracked files) as\n * a floating commit on top of HEAD, without touching the real index, working\n * tree or HEAD: a temporary `GIT_INDEX_FILE` collects the snapshot, `git\n * commit-tree` writes the commit object directly (it updates no ref). The\n * caller then branches a worktree from that commit, so the worktree sees\n * exactly what was on disk, uncommitted or not.\n */\nfunction snapshotUncommitted(cwd: string, id: string, head: string): string {\n  const idxDir = mkdtempSync(join(tmpdir(), \"pai-worktree-idx-\"));\n  const idx = join(idxDir, \"index\");\n  try {\n    const env = { ...process.env, GIT_INDEX_FILE: idx };\n    runGit(cwd, [\"read-tree\", head], env);\n    runGit(cwd, [\"add\", \"-A\"], env);\n    const tree = runGit(cwd, [\"write-tree\"], env);\n    return runGit(cwd, [\n      \"commit-tree\",\n      tree,\n      \"-p\",\n      head,\n      \"-m\",\n      `worker ${id}: snapshot of uncommitted checkout`,\n    ]);\n  } finally {\n    rmSync(idxDir, { recursive: true, force: true });\n  }\n}\n\n/**\n * Create the worktree and branch for `id` from `cwd`'s HEAD — or, when the\n * checkout has uncommitted changes, from a snapshot commit of that dirty\n * state (see `snapshotUncommitted`), so a worktree worker sees the same\n * files the operator sees, not just what was last committed. Throws when git\n * refuses (no commits yet, branch exists, …) — the caller decides whether to\n * degrade to an in-place run.\n */\nexport function addWorktree(logDir: string, id: string, cwd: string): WorktreeInfo {\n  const dir = worktreePath(logDir, id);\n  const branch = worktreeBranch(id);\n  const head = git(cwd, [\"rev-parse\", \"HEAD\"]);\n  const dirty = dirtyPaths(cwd).length > 0;\n  const base = dirty ? snapshotUncommitted(cwd, id, head) : head;\n  git(cwd, [\"worktree\", \"add\", dir, \"-b\", branch, base]);\n  provisionDeps(logDir, id, cwd, dir);\n  return { dir, branch, base, snapshot: dirty };\n}\n\n/**\n * Give the worktree its own dependencies so the worker never has to improvise\n * (symlinking node_modules to the main checkout, building in a /tmp copy).\n * A real node_modules directory in the main checkout is APFS-cloned\n * (`cp -c`, copy-on-write, near instant); elsewhere the lockfile installs it.\n * Never a symlink. Time-boxed and best effort: a failure is logged, the run\n * goes on.\n */\nexport function provisionDeps(logDir: string, id: string, cwd: string, wtDir: string): void {\n  const note = (n: string) => appendLedger(ledgerPath(logDir), \"WORKER-NOTE\", { id, note: n });\n  try {\n    const root = git(cwd, [\"rev-parse\", \"--show-toplevel\"]);\n    const main = join(root, \"node_modules\");\n    const dest = join(wtDir, \"node_modules\");\n    if (!existsSync(main) || lstatSync(main).isSymbolicLink() || existsSync(dest)) return;\n    try {\n      // an unignored node_modules would be committed by salvage\n      git(wtDir, [\"check-ignore\", \"-q\", \"node_modules\"]);\n    } catch {\n      return;\n    }\n    const t0 = Date.now();\n    const opts = { cwd: wtDir, stdio: \"ignore\" as const, timeout: 180_000 };\n    if (platform() === \"darwin\") {\n      try {\n        execFileSync(\"cp\", [\"-cR\", main, dest], opts);\n        note(`node_modules cloned (apfs) in ${Date.now() - t0}ms`);\n        return;\n      } catch {\n        rmSync(dest, { recursive: true, force: true }); // half-copied\n      }\n    }\n    if (existsSync(join(wtDir, \"bun.lock\"))) execFileSync(\"bun\", [\"install\", \"--frozen-lockfile\"], opts);\n    else if (existsSync(join(wtDir, \"package-lock.json\"))) execFileSync(\"npm\", [\"ci\"], opts);\n    else return;\n    note(`node_modules installed from lockfile in ${Date.now() - t0}ms`);\n  } catch (e) {\n    try {\n      note(`node_modules provisioning failed: ${(e as Error).message}`);\n    } catch {\n      /* ledger is best effort too */\n    }\n  }\n}\n\n/** Commits the branch collected on top of its base. */\nexport function commitsSince(dir: string, base: string): number {\n  try {\n    return parseInt(git(dir, [\"rev-list\", \"--count\", `${base}..HEAD`]), 10) || 0;\n  } catch {\n    return 0;\n  }\n}\n\n/**\n * Record the worktree result in the status file: branch and commit count on\n * success, the worktree cleaned up on failure. Returns the updated status.\n */\nexport function recordWorktree(\n  logDir: string,\n  status: WorkerStatus,\n  info: WorktreeInfo,\n  ok: boolean\n): WorkerStatus {\n  const s = { ...status };\n  if (ok) {\n    s.branch = info.branch;\n    s.commits = commitsSince(info.dir, info.base);\n    s.worktreeDir = info.dir;\n    s.worktreeBase = info.base;\n    s.worktreeSnapshot = info.snapshot;\n  } else if (safeCommitsSince(info.dir, info.base) > 0) {\n    // a failed or killed run that committed (or was salvaged) keeps its work:\n    // branch and worktree stay for `pai worker merge` / `discard`\n    s.branch = info.branch;\n    s.commits = commitsSince(info.dir, info.base);\n    s.worktreeDir = info.dir;\n    s.worktreeBase = info.base;\n    s.worktreeSnapshot = info.snapshot;\n  } else {\n    // a failed run with no commits leaves nothing to merge; the branch dies with the worktree\n    removeWorktree(s.cwd, info.dir, true);\n    try {\n      git(s.cwd, [\"branch\", \"-D\", info.branch]);\n    } catch {\n      // already gone or never created\n    }\n    s.branch = null;\n    s.worktreeDir = null;\n    s.worktreeBase = null;\n    s.commits = null;\n    s.worktreeSnapshot = null;\n  }\n  saveStatus(logDir, s);\n  invalidatePendingCache(logDir, s.cwd);\n  return s;\n}\n\nfunction safeCommitsSince(dir: string, base: string): number {\n  try {\n    return commitsSince(dir, base);\n  } catch {\n    return 0;\n  }\n}\n\n/**\n * Salvage for an exit path (run finaliser, kill signal): commit whatever the\n * worker left uncommitted, log WORKER-SALVAGE, never throw. Bounded by\n * `timeoutMs` per git call. Returns the committed paths.\n */\nexport function salvageOnExit(\n  ledger: string,\n  id: string,\n  label: string,\n  wtDir: string,\n  timeoutMs?: number\n): string[] {\n  try {\n    const { committed, skipped } = salvageUncommitted(wtDir, label, timeoutMs);\n    if (committed.length) appendLedger(ledger, \"WORKER-SALVAGE\", { id, paths: committed.join(\",\"), skipped: skipped.length });\n    if (skipped.length) appendLedger(ledger, \"WORKER-NOTE\", { id, note: `salvage skipped: ${skipped.join(\"; \")}` });\n    return committed;\n  } catch (e) {\n    try {\n      appendLedger(ledger, \"WORKER-NOTE\", { id, note: `salvage failed: ${(e as Error).message}` });\n    } catch {\n      /* best effort */\n    }\n    return [];\n  }\n}\n\n/** Remove a worktree directory from git's books and the filesystem. */\nfunction removeWorktree(cwd: string, dir: string, force: boolean): void {\n  try {\n    git(cwd, [\"worktree\", \"remove\", ...(force ? [\"--force\"] : []), dir]);\n    return;\n  } catch {\n    // fall through to the manual cleanup\n  }\n  if (existsSync(dir)) {\n    try {\n      rmSync(dir, { recursive: true, force: true });\n      git(cwd, [\"worktree\", \"prune\"]);\n    } catch {\n      // best effort: a leftover directory is visible in the logDir\n    }\n  }\n}\n\n/**\n * Tracked changes (staged or not) plus untracked files — everything a\n * `git add -A` in `wtDir` would commit. The same two calls the old patch\n * carry used; name-only, not porcelain: a worktree-only change renders as\n * \" M path\" and the shared git() helper trims that leading space away.\n */\nexport function uncommittedPaths(wtDir: string, timeoutMs?: number): string[] {\n  const tracked = git(wtDir, [\"diff\", \"--name-only\", \"HEAD\"], timeoutMs).split(\"\\n\").filter(Boolean);\n  const untracked = git(wtDir, [\"ls-files\", \"--others\", \"--exclude-standard\"], timeoutMs)\n    .split(\"\\n\")\n    .filter(Boolean);\n  return [...tracked, ...untracked];\n}\n\n/**\n * True when `wtDir`/`relPath` is a symlink whose target resolves outside\n * `wtDir` — e.g. a worker's `node_modules -> <main checkout>/node_modules`\n * convenience link. A `.gitignore` using `dir/` (directories only) does not\n * ignore such a link, so it turns up as untracked; staging and merging it\n * lets git replace the real directory on the other side with a symlink to\n * itself. Never a candidate for salvage.\n */\nfunction symlinkEscapesWorktree(wtDir: string, relPath: string): boolean {\n  const full = join(wtDir, relPath);\n  let stat;\n  try {\n    stat = lstatSync(full);\n  } catch {\n    return false; // vanished; nothing to skip\n  }\n  if (!stat.isSymbolicLink()) return false;\n  const target = readlinkSync(full);\n  const resolvedTarget = isAbsolute(target) ? target : resolve(dirname(full), target);\n  const realTarget = existsSync(resolvedTarget) ? realpathSync(resolvedTarget) : resolvedTarget;\n  const realWtDir = realpathSync(wtDir);\n  return realTarget !== realWtDir && !realTarget.startsWith(realWtDir + sep);\n}\n\nexport interface SalvageResult {\n  /** Paths committed onto the branch. */\n  committed: string[];\n  /** Human-readable notes for paths left on disk, uncommitted, and why. */\n  skipped: string[];\n}\n\n/**\n * Commit a worktree's uncommitted changes to its branch so the merge carries\n * them. `git merge` only moves committed work, so a worker that stopped\n * without committing would lose its edits to `worktree remove` — exactly\n * what happened live on 2026-09-17. Returns the salvaged paths, empty when\n * the worktree is clean. A symlink pointing outside the worktree (see\n * `symlinkEscapesWorktree`) is never staged; it is left on disk and reported\n * as skipped instead. A failed commit throws with the worktree untouched:\n * its edits are still on disk, so nothing is lost.\n */\nexport function salvageUncommitted(wtDir: string, label: string, timeoutMs?: number): SalvageResult {\n  const paths = uncommittedPaths(wtDir, timeoutMs);\n  if (!paths.length) return { committed: [], skipped: [] };\n  const skipped: string[] = [];\n  // tracked files gone from disk but not staged for removal: the worker never\n  // ran `git rm`, so the absence is not its decision (see MAX_SALVAGE_DELETES)\n  const missing = new Set(git(wtDir, [\"ls-files\", \"--deleted\"], timeoutMs).split(\"\\n\").filter(Boolean));\n  const toStage: string[] = [];\n  for (const p of paths) {\n    if (missing.has(p)) {\n      skipped.push(`${p} (missing, not committed)`);\n    } else if (symlinkEscapesWorktree(wtDir, p)) {\n      skipped.push(`symlink ${p} -> ${readlinkSync(join(wtDir, p))} (points outside the worktree)`);\n    } else {\n      toStage.push(p);\n    }\n  }\n  if (!toStage.length) return { committed: [], skipped };\n  try {\n    // --ignore-removal: additions and modifications only. Deletions the worker\n    // staged itself (git rm) are already in the index and ride along.\n    const excludes = paths.filter((p) => !toStage.includes(p)).map((p) => `:(exclude,literal)${p}`);\n    git(wtDir, [\"add\", \"--ignore-removal\", \"--\", \".\", ...excludes], timeoutMs);\n    const deleted = git(wtDir, [\"diff\", \"--cached\", \"--diff-filter=D\", \"--name-only\"], timeoutMs).split(\"\\n\").filter(Boolean);\n    if (deleted.length > MAX_SALVAGE_DELETES) {\n      git(wtDir, [\"reset\", \"-q\"], timeoutMs);\n      throw new Error(`salvage would delete ${deleted.length} tracked files (${deleted.slice(0, 5).join(\", \")}, ...), refused`);\n    }\n    git(wtDir, [\"commit\", \"-m\", `salvaged: ${label}`], timeoutMs);\n  } catch (e) {\n    throw new Error(\n      `cannot salvage the uncommitted changes in ${wtDir} — ${(e as Error).message}; ` +\n        `nothing was lost: commit them there by hand, then re-run merge`\n    );\n  }\n  return { committed: toStage, skipped };\n}\n\n/** A salvage commit that deletes more tracked files than this is refused. */\nconst MAX_SALVAGE_DELETES = 5;\n\n/**\n * The dirty paths of a checkout, parsed from `git status --porcelain -z`:\n * NUL-separated (a path with a newline in it cannot corrupt the parse),\n * rename entries contribute both sides, and any quoting is stripped.\n */\nfunction dirtyPaths(cwd: string): string[] {\n  // raw execFileSync, not the shared git(): it trims stdout, which eats the\n  // leading space of a worktree-only \" M path\" record and breaks the parse\n  const raw = execFileSync(\"git\", [\"-C\", cwd, \"status\", \"--porcelain\", \"-z\"], {\n    encoding: \"utf8\",\n    timeout: 30_000,\n    stdio: [\"ignore\", \"pipe\", \"pipe\"],\n  });\n  const fields = raw.split(\"\\0\");\n  const strip = (p: string) => (p.startsWith('\"') && p.endsWith('\"') ? p.slice(1, -1) : p);\n  const out: string[] = [];\n  for (let i = 0; i < fields.length; i++) {\n    const f = fields[i];\n    if (!f || f.length < 4 || f.charAt(2) !== \" \") continue; // not an \"XY path\" record\n    out.push(strip(f.slice(3)));\n    const xy = f.slice(0, 2);\n    if (xy.includes(\"R\") || xy.includes(\"C\")) {\n      const orig = fields[i + 1]; // rename/copy records carry the source path next\n      if (orig && orig.charAt(2) !== \" \") {\n        out.push(strip(orig));\n        i += 1;\n      }\n    }\n  }\n  return out;\n}\n\n/**\n * Refuse the merge when the original checkout is dirty in paths the branch\n * touches: the merge would overwrite those edits or fail on them, either way\n * leaving a half-state. No merge is made, the worktree stays.\n */\nfunction assertNoDirtyOverlap(\n  cwd: string,\n  incoming: string[],\n  id: string,\n  branch: string\n): void {\n  const dirty = new Set(dirtyPaths(cwd));\n  const overlap = [...new Set(incoming)].filter((p) => dirty.has(p)).sort();\n  if (!overlap.length) return;\n  throw new Error(\n    `worker ${id}: the checkout ${cwd} has uncommitted changes in paths ${branch} touches: ` +\n      `${overlap.join(\", \")}. Commit or stash them in the checkout, then re-run: pai worker merge ${id}. ` +\n      `No merge was made; the worktree was kept.`\n  );\n}\n\n/**\n * Never remove a worktree that still holds uncommitted changes — except a\n * symlink escaping the worktree (see `symlinkEscapesWorktree`): it was\n * deliberately left uncommitted by `salvageUncommitted`, and deleting the\n * link itself touches nothing outside the worktree.\n */\nexport function assertWorktreeClean(wtDir: string, id: string): void {\n  const leftover = uncommittedPaths(wtDir).filter((p) => !symlinkEscapesWorktree(wtDir, p));\n  if (leftover.length) {\n    throw new Error(\n      `worker ${id}: the worktree ${wtDir} still holds uncommitted changes ` +\n        `(${leftover.join(\", \")}) — it was NOT removed; commit or copy them by hand, then re-run merge`\n    );\n  }\n}\n\n/** Blob sha of `path` at `rev` in `cwd`, or null when it does not exist there. */\nfunction blobAt(cwd: string, rev: string, path: string): string | null {\n  try {\n    return git(cwd, [\"rev-parse\", \"--verify\", \"-q\", `${rev}:${path}`]);\n  } catch {\n    return null;\n  }\n}\n\n/** Blob sha of `path` as it sits on disk in `cwd`, or null when it is absent. */\nfunction workingBlob(cwd: string, path: string): string | null {\n  if (!existsSync(join(cwd, path))) return null;\n  try {\n    return git(cwd, [\"hash-object\", \"--\", path]);\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Refuse a snapshot merge when the checkout differs from the snapshot the\n * worker branched from, for any path the branch touched: the operator edited\n * it, or it was created/deleted since — applying the branch's diff on top\n * would silently discard that. Absent-in-both counts as equal.\n */\nfunction assertNoSnapshotDrift(cwd: string, snapshot: string, paths: string[], id: string): void {\n  const drifted = paths\n    .filter((p) => blobAt(cwd, snapshot, p) !== workingBlob(cwd, p))\n    .sort();\n  if (!drifted.length) return;\n  throw new Error(\n    `worker ${id}: the checkout ${cwd} has changed since the worktree's snapshot in paths the branch touches: ` +\n      `${drifted.join(\", \")}. Resolve by hand, then re-run: pai worker merge ${id}. ` +\n      `No merge was made; the worktree was kept.`\n  );\n}\n\n/**\n * `pai worker merge <id>` for a snapshot-based worktree (see `addWorktree`):\n * git's own merge only moves committed history, and the snapshot commit was\n * never on any branch reachable from `cwd`'s HEAD, so there is nothing to\n * `git merge` here. Instead the worker's own changes — `git diff --binary\n * <snapshot> <branch>` — are applied straight onto the checkout's working\n * tree as uncommitted edits, exactly like the uncommitted state the worker\n * started from. Works even if `cwd`'s HEAD moved since the snapshot: the\n * diff is applied to files, not merged into a tree.\n */\nfunction mergeSnapshotWorker(\n  logDir: string,\n  id: string,\n  st: WorkerStatus & Required<Pick<WorkerStatus, \"branch\" | \"worktreeDir\">>,\n  noCommit = false\n): string {\n  const snapshot = st.worktreeBase!;\n  const branch = st.branch!;\n  const worktreeDir = st.worktreeDir!;\n  const salvage = existsSync(worktreeDir)\n    ? salvageUncommitted(worktreeDir, st.label || UNLABELED)\n    : { committed: [], skipped: [] };\n  const incoming = parseInt(git(st.cwd, [\"rev-list\", \"--count\", `${snapshot}..${branch}`]), 10) || 0;\n  if (incoming <= 0) {\n    throw new Error(\n      `worker ${id}: branch ${branch} has no commits beyond its snapshot to merge. ` +\n        `The worktree ${worktreeDir} was NOT removed — uncommitted work there would be destroyed. ` +\n        `Commit it yourself, or drop everything with: pai worker discard ${id}`\n    );\n  }\n  const changedPaths = git(st.cwd, [\"diff\", \"--name-only\", snapshot, branch]).split(\"\\n\").filter(Boolean);\n  assertNoSnapshotDrift(st.cwd, snapshot, changedPaths, id);\n  const diff = execFileSync(\"git\", [\"-C\", st.cwd, \"diff\", \"--binary\", snapshot, branch], {\n    encoding: \"utf8\",\n    timeout: 30_000,\n    maxBuffer: 64 * 1024 * 1024,\n  });\n  if (diff.trim()) {\n    try {\n      execFileSync(\"git\", [\"-C\", st.cwd, \"apply\", \"--binary\"], {\n        input: diff,\n        encoding: \"utf8\",\n        timeout: 30_000,\n        stdio: [\"pipe\", \"pipe\", \"pipe\"],\n      });\n    } catch (e) {\n      const err = e as { stderr?: Buffer | string; message?: string };\n      const why =\n        (typeof err.stderr === \"string\" ? err.stderr : err.stderr?.toString(\"utf8\")) ||\n        err.message ||\n        String(e);\n      throw new Error(\n        `worker ${id}: git refused to apply ${branch}'s changes to ${st.cwd} — ${why.trim()}. ` +\n          `The worktree ${worktreeDir} was kept: resolve by hand, then re-run merge`\n      );\n    }\n  }\n  if (noCommit) return noCommitNextSteps(id, branch, worktreeDir, changedPaths);\n  removeWorktree(st.cwd, worktreeDir, true);\n  try {\n    git(st.cwd, [\"branch\", \"-D\", branch]); // never merged by git — nothing for -d to see\n  } catch {\n    // already gone\n  }\n  const s = { ...st, merged: true };\n  saveStatus(logDir, s);\n  const base =\n    `applied worker ${id}'s changes (branch ${branch}) to ${st.cwd} as uncommitted changes: ` +\n    `${changedPaths.join(\", \")} (worktree removed, branch deleted)`;\n  const notes: string[] = [];\n  if (salvage.committed.length) {\n    notes.push(\n      `salvaged ${salvage.committed.length} uncommitted change(s) onto the branch first: ${salvage.committed.join(\", \")}`\n    );\n  }\n  if (salvage.skipped.length) {\n    notes.push(`skipped ${salvage.skipped.join(\", \")}`);\n  }\n  return notes.length ? `${base}; ${notes.join(\"; \")}` : base;\n}\n\nfunction noCommitNextSteps(id: string, branch: string, worktreeDir: string, paths: string[]): string {\n  return (\n    `applied worker ${id}'s changes (branch ${branch}) to the checkout as uncommitted changes: ${paths.join(\", \")}. ` +\n    `Branch and worktree ${worktreeDir} were kept. Next: review (git diff), commit, then run: pai worker gc`\n  );\n}\n\n/**\n * `merge --no-commit`: apply base..branch to the checkout with a 3-way\n * `git apply`, leaving the result uncommitted. On conflict the tree is left\n * as is (markers + unmerged index entries) and the conflicted paths are listed.\n */\nfunction applyNoCommit(cwd: string, id: string, branch: string, worktreeDir: string, base: string, paths: string[]): string {\n  const diff = execFileSync(\"git\", [\"-C\", cwd, \"diff\", \"--binary\", `${base}..${branch}`], {\n    encoding: \"buffer\",\n    timeout: 30_000,\n    maxBuffer: 64 * 1024 * 1024,\n    env: { ...process.env, LC_ALL: \"C\" },\n  });\n  try {\n    execFileSync(\"git\", [\"-C\", cwd, \"apply\", \"--3way\", \"--binary\"], {\n      input: diff,\n      timeout: 30_000,\n      stdio: [\"pipe\", \"pipe\", \"pipe\"],\n      env: { ...process.env, LC_ALL: \"C\" },\n    });\n  } catch (e) {\n    const conflicted = git(cwd, [\"diff\", \"--name-only\", \"--diff-filter=U\"]).split(\"\\n\").filter(Boolean);\n    const err = e as { stderr?: Buffer | string; message?: string };\n    const why = ((typeof err.stderr === \"string\" ? err.stderr : err.stderr?.toString(\"utf8\")) || err.message || \"\").trim();\n    throw new Error(\n      conflicted.length\n        ? `worker ${id}: applying ${branch} conflicted in ${conflicted.join(\", \")}. The tree was left for you: ` +\n            `resolve those paths, review, commit; branch and worktree ${worktreeDir} were kept`\n        : `worker ${id}: git refused to apply ${branch} to ${cwd} — ${why}. Nothing was changed; branch and worktree were kept`\n    );\n  }\n  return noCommitNextSteps(id, branch, worktreeDir, paths);\n}\n\nexport type VerifyState = \"identical\" | \"differs\" | \"missing\" | \"deleted\";\nexport interface VerifyResult {\n  id: string;\n  ref: string;\n  base: string;\n  against: string;\n  files: { path: string; state: VerifyState }[];\n  ok: boolean;\n}\n\n/**\n * `pai worker verify <id>`: for every file the worker's branch (or its\n * refs/pai-archive/<id> archive once the branch is gone) changed since its\n * base, compare bytes with the working tree or `--against <ref>`.\n * identical = the target already holds the worker's version (a worker delete\n * counts as identical when the target lacks the file too); differs = other\n * bytes; missing = the worker's file is absent in the target; deleted = the\n * worker deleted it but the target still has it. ok = every file identical.\n */\nexport function verifyWorker(logDir: string, id: string, opts: { against?: string } = {}): VerifyResult {\n  const st = loadStatus(logDir, id);\n  if (!st) throw new Error(`no worker named \"${id}\"`);\n  const env = { ...process.env, LC_ALL: \"C\" };\n  const bytes = (args: string[]): Buffer | null => {\n    try {\n      return execFileSync(\"git\", [\"-C\", st.cwd, ...args], {\n        env,\n        timeout: 30_000,\n        maxBuffer: 256 * 1024 * 1024,\n        stdio: [\"ignore\", \"pipe\", \"pipe\"],\n      });\n    } catch {\n      return null;\n    }\n  };\n  const has = (ref: string): boolean => bytes([\"rev-parse\", \"--verify\", \"-q\", `${ref}^{commit}`]) !== null;\n  const ref = [`refs/heads/${worktreeBranch(id)}`, `refs/pai-archive/${id}`].find(has);\n  if (!ref) throw new Error(`worker ${id}: neither ${worktreeBranch(id)} nor refs/pai-archive/${id} exists in ${st.cwd}`);\n  const base = st.worktreeSnapshot && st.worktreeBase ? st.worktreeBase : git(st.cwd, [\"merge-base\", \"HEAD\", ref]);\n  const list = (bytes([\"diff\", \"--name-status\", \"--no-renames\", \"-z\", `${base}..${ref}`]) ?? Buffer.alloc(0))\n    .toString(\"utf8\")\n    .split(\"\\0\")\n    .filter(Boolean);\n  const files: VerifyResult[\"files\"] = [];\n  for (let i = 0; i + 1 < list.length; i += 2) {\n    const path = list[i + 1];\n    const deleted = list[i] === \"D\";\n    const target = opts.against\n      ? bytes([\"show\", `${opts.against}:${path}`])\n      : existsSync(join(st.cwd, path))\n        ? readFileSync(join(st.cwd, path))\n        : null;\n    let state: VerifyState;\n    if (deleted) state = target ? \"deleted\" : \"identical\";\n    else {\n      const mine = bytes([\"show\", `${ref}:${path}`]);\n      state = !target ? \"missing\" : mine && mine.equals(target) ? \"identical\" : \"differs\";\n    }\n    files.push({ path, state });\n  }\n  return { id, ref, base, against: opts.against ?? \"working tree\", files, ok: files.every((f) => f.state === \"identical\") };\n}\n\n/**\n * `pai worker merge <id>`: salvage whatever the worker left uncommitted onto\n * its branch, refuse when the original checkout is dirty in paths the branch\n * touches, merge with --no-ff (the merge commit names the worker), then\n * remove the worktree and delete the branch; the status gains `merged: true`.\n * A branch with nothing to merge is refused loudly — after salvage that\n * genuinely means it holds nothing, and reporting success there would\n * destroy the worktree for no gain.\n */\nexport function mergeWorker(logDir: string, id: string, opts: { noCommit?: boolean } = {}): string {\n  const st = mustHaveBranch(logDir, id);\n  if (st.merged) return `worker ${id}: branch ${st.branch} already merged`;\n  if (st.worktreeSnapshot) return mergeSnapshotWorker(logDir, id, st, opts.noCommit);\n  // salvage first: only a commit can carry uncommitted work through the merge\n  const salvage = existsSync(st.worktreeDir!)\n    ? salvageUncommitted(st.worktreeDir!, st.label || UNLABELED)\n    : { committed: [], skipped: [] };\n  const incoming = parseInt(git(st.cwd, [\"rev-list\", \"--count\", `HEAD..${st.branch}`]), 10) || 0;\n  if (incoming <= 0) {\n    throw new Error(\n      `worker ${id}: branch ${st.branch} has no commits to merge. ` +\n        `The worktree ${st.worktreeDir} was NOT removed — uncommitted work there would be destroyed. ` +\n        `Commit it yourself, or drop everything with: pai worker discard ${id}`\n    );\n  }\n  const mergeBase = git(st.cwd, [\"merge-base\", \"HEAD\", st.branch!]);\n  const incomingPaths = git(st.cwd, [\"diff\", \"--name-only\", mergeBase, st.branch!])\n    .split(\"\\n\")\n    .filter(Boolean);\n  assertNoDirtyOverlap(st.cwd, incomingPaths, id, st.branch!);\n  if (opts.noCommit) return applyNoCommit(st.cwd, id, st.branch!, st.worktreeDir!, mergeBase, incomingPaths);\n  try {\n    git(st.cwd, [\"merge\", \"--no-ff\", st.branch!, \"-m\", `merge worker ${id} (${st.label})`]);\n  } catch (e) {\n    throw new Error(\n      `worker ${id}: git refused the merge of ${st.branch} — ${(e as Error).message}. ` +\n        `The worktree ${st.worktreeDir} was kept: resolve the conflict, then re-run merge`\n    );\n  }\n  if (existsSync(st.worktreeDir!)) assertWorktreeClean(st.worktreeDir!, id);\n  // force: assertWorktreeClean already confirmed nothing but a skipped\n  // outside-pointing symlink (if anything) remains uncommitted\n  removeWorktree(st.cwd, st.worktreeDir!, true);\n  let branchGone = true;\n  try {\n    git(st.cwd, [\"branch\", \"-d\", st.branch!]);\n  } catch {\n    branchGone = false; // -d refuses anything not fully merged; keep the branch, say so\n  }\n  const s = { ...st, merged: true };\n  saveStatus(logDir, s);\n  invalidatePendingCache(logDir, st.cwd);\n  const base = `merged ${st.branch} into ${st.cwd} (worktree removed${branchGone ? \", branch deleted\" : \"; branch kept: git refused -d\"})`;\n  const notes: string[] = [];\n  if (salvage.committed.length) {\n    notes.push(`salvaged ${salvage.committed.length} uncommitted change(s): ${salvage.committed.join(\", \")}`);\n  }\n  if (salvage.skipped.length) {\n    notes.push(`skipped ${salvage.skipped.join(\", \")}`);\n  }\n  return notes.length ? `${base}; ${notes.join(\"; \")}` : base;\n}\n\n/** `pai worker discard <id>`: drop worktree and branch, keep nothing. */\nexport function discardWorker(logDir: string, id: string): string {\n  const st = mustHaveBranch(logDir, id);\n  removeWorktree(st.cwd, st.worktreeDir!, true);\n  let branchGone = false;\n  try {\n    git(st.cwd, [\"branch\", \"-D\", st.branch!]);\n    branchGone = true;\n  } catch {\n    branchGone = false;\n  }\n  const s = {\n    ...st,\n    branch: null,\n    worktreeDir: null,\n    worktreeBase: null,\n    worktreeSnapshot: null,\n    commits: null,\n    merged: false,\n  };\n  saveStatus(logDir, s);\n  invalidatePendingCache(logDir, st.cwd);\n  return `discarded worker ${id}: worktree removed${branchGone ? `, branch ${st.branch} deleted` : \"\"}`;\n}\n\nfunction mustHaveBranch(logDir: string, id: string): WorkerStatus & Required<Pick<WorkerStatus, \"branch\" | \"worktreeDir\">> {\n  const st = loadStatus(logDir, id);\n  if (!st) throw new Error(`no worker named \"${id}\"`);\n  if (!st.branch || !st.worktreeDir) {\n    throw new Error(\n      `worker ${id} has no worktree branch to ${st.branch ? \"clean up\" : \"merge\"} — ` +\n        `it ran in place or its branch was already handled`\n    );\n  }\n  return st as WorkerStatus & Required<Pick<WorkerStatus, \"branch\" | \"worktreeDir\">>;\n}\n\n/**\n * The paragraph a worktree run's system prompt gains: it may commit on its\n * own branch (the no-commit rule holds for the main branch only), it must not\n * merge or push itself, and the parent or operator merges.\n */\nexport function worktreeSystemPrompt(id: string, branch: string, dir: string, snapshot = false): string {\n  return [\n    \"You are running in your own git worktree:\",\n    `  ${dir} on branch ${branch} (worker id ${id}).`,\n    \"Commit your work on that branch as you go (git add / git commit) — committing here is expected;\",\n    \"the no-commit rule applies to the main branch only, and this is not it.\",\n    \"Do not merge, rebase or push; the operator merges your branch back with `pai worker merge`.\",\n    \"Use ONLY relative paths inside the worktree, never absolute worktree paths — absolute paths break after merge and leak machine layout.\",\n    ...(snapshot\n      ? [\n          \"This worktree was branched from a snapshot that includes files the parent checkout had uncommitted at spawn time — not just its last commit.\",\n        ]\n      : []),\n  ].join(\"\\n\");\n}\n\n/**\n * For headless runs WITHOUT a worktree: the worker shares the operator's\n * checkout with other in-flight workers, so a hook blocks git stash (except\n * list/show), reset, clean, checkout/restore of paths, switch, rebase and\n * merge — take baselines from measurements before editing, not from stash.\n */\nexport function inPlaceSystemPrompt(): string {\n  return [\n    \"You are running in the operator's shared git checkout, alongside other workers editing it at the same time.\",\n    \"A hook blocks git stash (except list/show), reset, clean, checkout/restore of files, switch, rebase and merge — take baselines from measurements taken before you edit, not from stashing.\",\n    \"Read-only git (status, diff, log, show, stash list) is fine.\",\n  ].join(\"\\n\");\n}\n\nexport interface GcEntry {\n  id: string;\n  /** archive ref, or the reason the worktree was skipped. */\n  archive?: string;\n  skipped?: string;\n}\n\nconst GC_STAMP = \"gc-last\";\n\n/**\n * Archive worktrees of finished workers older than `olderThanHours` and\n * status-less orphan directories: uncommitted state is salvaged onto the\n * branch, the branch is x, the worktree is\n * removed. Nothing is deleted without a salvage first; a failed salvage skips\n * that worktree. Running workers are never touched. `dryRun` reports only.\n */\nexport function gcWorktrees(\n  logDir: string,\n  olderThanHours = 24,\n  dryRun = false,\n  now = Date.now()\n): GcEntry[] {\n  const cutoff = now - olderThanHours * 3_600_000;\n  const out: GcEntry[] = [];\n  const root = worktreesDir(logDir);\n  const known = new Set<string>();\n  const archive = (id: string, dir: string, st: WorkerStatus | null): void => {\n    const target = `refs/pai-archive/${id}`;\n    if (dryRun) return void out.push({ id, archive: target });\n    try {\n      // The shared object store and refs live in the main repo; the recorded cwd\n      // may be another worker's worktree that gc already removed.\n      let repo: string;\n      try {\n        const raw = git(dir, [\"rev-parse\", \"--git-common-dir\"]);\n        repo = isAbsolute(raw) ? raw : resolve(dir, raw);\n      } catch {\n        throw new Error(\"not a git worktree\");\n      }\n      const label = `archive: leftover state of worker ${id}`;\n      if (uncommittedPaths(dir).length) {\n        // salvageUncommitted labels \"salvaged: <label>\"; keep the requested subject\n        const res = salvageUncommitted(dir, label);\n        if (res.committed.length) git(dir, [\"commit\", \"--amend\", \"-q\", \"-m\", label]);\n        if (res.skipped.length && uncommittedPaths(dir).some((p) => !symlinkEscapesWorktree(dir, p))) {\n          throw new Error(\"uncommitted paths remain\");\n        }\n      }\n      const src = worktreeBranch(id);\n      let hasBranch = true;\n      try {\n        git(repo, [\"rev-parse\", \"--verify\", \"-q\", `refs/heads/${src}`]);\n      } catch {\n        hasBranch = false;\n      }\n      const tip = git(dir, [\"rev-parse\", \"HEAD\"]);\n      // never drop a branch whose tip the archive ref would not keep reachable\n      if (hasBranch) git(repo, [\"merge-base\", \"--is-ancestor\", `refs/heads/${src}`, tip]);\n      git(repo, [\"update-ref\", target, tip]);\n      git(repo, [\"worktree\", \"remove\", \"--force\", dir]);\n      if (hasBranch) git(repo, [\"branch\", \"-D\", src]);\n      if (st) saveStatus(logDir, { ...st, branch: null, worktreeDir: null, archived: target });\n      appendLedger(ledgerPath(logDir), \"WORKER-GC\", { id, archive: target });\n      out.push({ id, archive: target });\n    } catch (e) {\n      out.push({ id, skipped: (e as Error).message.split(\"\\n\")[0] });\n    }\n  };\n\n  for (const st of loadStatuses(logDir)) {\n    known.add(st.id);\n    if (!st.worktreeDir || !existsSync(st.worktreeDir) || isLive(st)) continue;\n    let end = 0;\n    try {\n      end = statSync(statusPath(logDir, st.id)).mtimeMs;\n    } catch {\n      continue;\n    }\n    if (end > cutoff) continue;\n    archive(st.id, st.worktreeDir, st);\n  }\n\n  if (existsSync(root)) {\n    for (const ent of readdirSync(root, { withFileTypes: true })) {\n      if (!ent.isDirectory() || known.has(ent.name) || existsSync(statusPath(logDir, ent.name))) continue;\n      const dir = join(root, ent.name);\n      try {\n        if (statSync(dir).mtimeMs > cutoff) continue;\n      } catch {\n        continue;\n      }\n      archive(ent.name, dir, null);\n    }\n  }\n  if (!dryRun) {\n    for (const repo of new Set(loadStatuses(logDir).map((s) => s.cwd))) {\n      try {\n        git(repo, [\"worktree\", \"prune\"]);\n      } catch {\n        // repo gone\n      }\n      invalidatePendingCache(logDir, repo);\n    }\n  }\n  return out;\n}\n\n/** Run `gcWorktrees` at most once per `everyMin` minutes (stamp file in the logDir). */\nexport function gcWorktreesThrottled(logDir: string, everyMin = 60, now = Date.now()): GcEntry[] | null {\n  const stamp = join(logDir, GC_STAMP);\n  try {\n    if (now - statSync(stamp).mtimeMs < everyMin * 60_000) return null;\n  } catch {\n    // never ran\n  }\n  mkdirSync(logDir, { recursive: true });\n  writeFileSync(stamp, String(now), \"utf8\");\n  return gcWorktrees(logDir, 24, false, now);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,cAAc,QAA+B;CAC3D,MAAM,WAAW,WAAW,OAAO,OAAO;AAC1C,KAAI,OAAO,WAAW,gBAAiB,QAAO;AAC9C,QAAO,eAAe,YAAY,QAAQ,UAAU,EAAE,CAAC,SAAS,EAAE,4BAA4B;;;AAIhG,SAAgB,kBAAkB,QAAwB;CACxD,MAAM,OAAO,gBAAgB,OAAO;AACpC,KAAI,CAAC,WAAW,KAAK,EAAE;AACrB,YAAU,QAAQ,EAAE,WAAW,MAAM,CAAC;AACtC,gBAAc,MAAM,4BAA0B,OAAO;;AAEvD,QAAO;;AAGT,SAAgB,WAAW,QAAgB,IAAoB;AAC7D,QAAO,KAAK,QAAQ,GAAG,GAAG,SAAS;;AAGrC,SAAgB,WAAW,QAAgB,IAAoB;AAC7D,QAAO,KAAK,QAAQ,GAAG,GAAG,QAAQ;;AAGpC,SAAgB,WAAW,QAAwB;AACjD,QAAO,KAAK,QAAQ,aAAa;;AAGnC,SAAgB,iBAAiB,QAAwB;AACvD,QAAO,KAAK,QAAQ,qBAAqB;;AAG3C,SAAgB,SAAS,QAAwB;AAC/C,QAAO,KAAK,QAAQ,QAAQ;;;;;;;AAQ9B,SAAgB,gBAAgB,QAAwB;AACtD,QAAO,KAAK,QAAQ,cAAc;;;;;ACtBpC,SAAgB,gBAAgB,MAAkC;CAChE,IAAI,SAAwB;CAC5B,IAAI,eAAiD;CACrD,MAAM,OAAiB,EAAE;CACzB,IAAI,WAAW;CACf,IAAI,cAAc;CAClB,IAAI,kBAAkB;CACtB,IAAI,qBAAqB;CACzB,MAAM,sBAAgC,EAAE;CACxC,IAAI,cAAc;CAClB,MAAM,MAAgB,EAAE;CACxB,MAAM,eAAyB,EAAE;CAEjC,IAAI,IAAI;AACR,QAAO,IAAI,KAAK,QAAQ;EACtB,MAAM,IAAI,KAAK;AACf,MAAI,MAAM,QAAQ,MAAM,WAAW;AACjC,cAAW;AACX,QAAK,KAAK,EAAE;AACZ,OAAI,IAAI,IAAI,KAAK,UAAU,CAAC,KAAK,IAAI,GAAG,WAAW,IAAI,EAAE;AACvD,aAAS,KAAK,IAAI;AAClB,SAAK,KAAK,OAAO;AACjB,SAAK;;aAEE,MAAM,mBAAmB;GAClC,MAAM,IAAI,KAAK,IAAI;AACnB,OAAI,MAAM,UAAU,MAAM,cAAe,gBAAe;AACxD,QAAK;aACI,EAAE,WAAW,mBAAmB,EAAE;GAC3C,MAAM,IAAI,EAAE,MAAM,GAA0B;AAC5C,OAAI,MAAM,UAAU,MAAM,cAAe,gBAAe;aAC/C,MAAM,aAAa,YAEnB,MAAM,0BAA0B;AACzC,wBAAqB;AACrB,OAAI,IAAI,IAAI,KAAK,OAAQ,qBAAoB,KAAK,KAAK,EAAE,GAAG;aACnD,EAAE,WAAW,0BAA0B,EAAE;AAClD,wBAAqB;AACrB,uBAAoB,KAAK,EAAE,MAAM,GAAiC,CAAC;aAC1D,MAAM,SAAS;GACxB,MAAM,IAAI,KAAK,IAAI;AACnB,OAAI,MAAM,UAAa,CAAC,EAAE,WAAW,IAAI,EAAE;AACzC,QAAI,KAAK,EAAE;AACX,SAAK;;aAEE,EAAE,WAAW,SAAS,CAC/B,KAAI,KAAK,EAAE,MAAM,EAAgB,CAAC;WACzB,MAAM,kBAAkB;AAEjC,QAAK,KAAK,EAAE;GACZ,MAAM,IAAI,KAAK,IAAI;AACnB,OAAI,MAAM,UAAa,CAAC,EAAE,WAAW,IAAI,EAAE;AACzC,iBAAa,KAAK,EAAE;AACpB,SAAK,KAAK,EAAE;AACZ,SAAK;;aAEE,EAAE,WAAW,kBAAkB,EAAE;AAC1C,gBAAa,KAAK,EAAE,MAAM,GAAyB,CAAC;AACpD,QAAK,KAAK,EAAE;SACP;AACL,OAAI,MAAM,UAAW,eAAc;AACnC,OAAI,EAAE,WAAW,WAAW,CAAE,eAAc;AAC5C,OAAI,MAAM,eAAgB,mBAAkB;AAC5C,OAAI,EAAE,WAAW,gBAAgB,CAAE,mBAAkB;AACrD,OAAI,MAAM,UAAW,eAAc;AACnC,OAAI,EAAE,WAAW,WAAW,CAAE,eAAc;AAC5C,OACE,WAAW,QAAQ,CAAC,EAAE,WAAW,IAAI,IAAI,KAAK,SAAS,MACtD,KAAK,KAAK,SAAS,OAAO,QAAQ,KAAK,KAAK,SAAS,OAAO,WAE7D,UAAS;AAEX,QAAK,KAAK,EAAE;;AAEd,OAAK;;AAGP,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD;;;;;;;AAQH,SAAgB,uBAAuB,OAA2B;CAChE,MAAM,OAAO,MAAM,QAAQ,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,OAAO;AACvD,QAAO,OAAO,CAAC,0BAA0B,KAAK,GAAG,EAAE;;;;;;;;AASrD,SAAgB,kBAAkB,MAA0B;CAC1D,MAAM,MAAgB,EAAE;AACxB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,IAAI,KAAK;EACf,MAAM,UAAU,MAAM,QAAQ,MAAM;AACpC,MAAI,KAAK,EAAE;AACX,MAAI,WAAW,IAAI,IAAI,KAAK,UAAU,CAAC,KAAK,IAAI,GAAG,WAAW,IAAI,CAChE,MAAK;;AAGT,QAAO;;;;;;;AAQT,SAAgB,qBAAqB,QAAsC;AACzE,KAAI,CAAC,OAAQ,QAAO;CACpB,MAAM,YAAY,OAAO,MAAM,MAAM,IAAI,EAAE,EAAE;AAC7C,KAAI,OAAO,SAAS,OAAO,WAAW,EACpC,QAAO;AAET,QAAO;;;AAIT,SAAgB,UAAU,GAAY,GAAmB;CACvD,MAAM,IAAI,OAAO,KAAK,GAAG,CAAC,MAAM,MAAM,CAAC,OAAO,QAAQ,CAAC,KAAK,IAAI;AAChE,QAAO,EAAE,UAAU,IAAI,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG;;;;;;;;;;;;;;ACzCjD,MAAa,YAAY;;;;;;;AAQzB,SAAgB,WAAW,GAA8D;AACvF,QACE,EAAE,WAAW,UACZ,CAAC,EAAE,WAAW,EAAE,UAAU,aAAa,EAAE,UAAU,kBAAkB,EAAE,UAAU;;;AAKtF,SAAgB,eAAe,GAAyE;AACtG,KAAI,CAAC,EAAE,iBAAiB,CAAC,EAAE,cAAe,QAAO;AACjD,QAAO,KAAK,MAAO,EAAE,gBAAgB,EAAE,gBAAiB,IAAI;;;AAI9D,SAAgB,YAAY,GAAmB;AAC7C,QAAO,KAAK,MAAO,GAAG,KAAK,MAAM,IAAI,IAAK,CAAC,KAAK,OAAO,EAAE;;;;;;;AAQ3D,SAAgB,aACd,GACQ;CACR,MAAM,MAAM,eAAe,EAAE;AAC7B,KAAI,QAAQ,KAAM,QAAO;AACzB,QAAO,OAAO,YAAY,EAAE,iBAAiB,EAAE,CAAC,GAAG,YAAY,EAAE,iBAAiB,EAAE,CAAC,IAAI,IAAI;;;AAI/F,SAAgB,SAAS,oBAAU,IAAI,MAAM,EAAU;CACrD,MAAM,KAAK,MAAc,OAAO,EAAE,CAAC,SAAS,GAAG,IAAI;AACnD,QACE,GAAG,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,UAAU,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,GACzD,EAAE,EAAE,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE,YAAY,CAAC,CAAC,GAAG,EAAE,EAAE,YAAY,CAAC;;AAMhE,IAAI,SAAS;AACb,IAAI,QAAQ;AAEZ,SAAgB,YAAY,oBAAU,IAAI,MAAM,EAAE,MAAM,QAAQ,KAAa;CAC3E,MAAM,KAAK,MAAc,OAAO,EAAE,CAAC,SAAS,GAAG,IAAI;CACnD,MAAM,OAAO,GAAG,EAAE,aAAa,GAAG,EAAE,EAAE,UAAU,GAAG,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,EAAE,YAAY,CAAC,GAAG,EAAE,EAAE,YAAY,CAAC,CAAC,GAAG;AACrI,KAAI,SAAS,QAAQ;AACnB,WAAS;AACT,SAAO,GAAG,KAAK,GAAG,OAAO,MAAM,CAAC,SAAS,GAAG,IAAI;;AAElD,UAAS;AACT,SAAQ;AACR,QAAO;;AAQT,IAAI,SAAS;;AAGb,SAAgB,cAAc,QAAgB,IAAoB;AAChE,QAAO,GAAG,WAAW,QAAQ,GAAG,CAAC,GAAG,QAAQ,IAAI,GAAG,SAAS;;AAY9D,MAAM,oCAAoB,IAAI,KAAqB;;AAGnD,SAAgB,WAAW,QAAgB,QAAsB,oBAAU,IAAI,MAAM,EAAQ;AAC3F,QAAO,UAAU,SAAS,EAAE;CAC5B,MAAM,OAAO,WAAW,QAAQ,OAAO,GAAG;CAC1C,MAAM,WAAW,kBAAkB,IAAI,OAAO,GAAG;AACjD,KAAI,aAAa,OACf,mBAAkB,IAAI,OAAO,IAAI,OAAO,MAAM;CAEhD,MAAM,SAAS,aAAa,SAAY,SAAY,WAAW,QAAQ,OAAO,GAAG;AACjF,KAAI,QAAQ;AACV,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,OAAO,MAAO,QAAO,QAAQ,OAAO;AAEtF,MAAI,OAAO,aAAc,QAAO,eAAe;;CAEjD,MAAM,MAAM,cAAc,QAAQ,OAAO,GAAG;AAC5C,KAAI,CAAC,WAAW,OAAO,CAAE,WAAU,QAAQ,EAAE,WAAW,MAAM,CAAC;AAC/D,KAAI;AACF,gBAAc,KAAK,KAAK,UAAU,OAAO,EAAE,OAAO;AAClD,aAAW,KAAK,KAAK;UACd,GAAG;AACV,MAAI;AACF,UAAO,KAAK,EAAE,OAAO,MAAM,CAAC;UACtB;AAGR,QAAM;;;;;;;;;;AAWV,SAAgB,eAAe,QAAgB,IAAY,OAA6B;CACtF,MAAM,SAAS,WAAW,QAAQ,GAAG;AACrC,KAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,oBAAoB,GAAG,GAAG;AACvD,QAAO,QAAQ;AACf,YAAW,QAAQ,OAAO;AAC1B,QAAO;;;AAIT,SAAgB,aAAa,QAAgC;AAC3D,KAAI,CAAC,WAAW,OAAO,CAAE,QAAO,EAAE;CAClC,MAAM,MAAsB,EAAE;AAC9B,MAAK,MAAM,QAAQ,YAAY,OAAO,CAAC,MAAM,EAAE;AAC7C,MAAI,CAAC,KAAK,SAAS,UAAU,CAAE;AAC/B,MAAI;AACF,OAAI,KAAK,KAAK,MAAM,aAAa,KAAK,QAAQ,KAAK,EAAE,OAAO,CAAC,CAAiB;UACxE;;AAIV,QAAO;;AAGT,SAAgB,WAAW,QAAgB,IAAiC;CAC1E,MAAM,OAAO,WAAW,QAAQ,GAAG;AACnC,KAAI,CAAC,WAAW,KAAK,CAAE,QAAO;AAC9B,KAAI;AACF,SAAO,KAAK,MAAM,aAAa,MAAM,OAAO,CAAC;SACvC;AACN,SAAO;;;;;;;;AASX,eAAsB,sBACpB,QACA,IACA,YAAY,KACZ,SAAS,IACqB;CAC9B,MAAM,WAAW,KAAK,KAAK,GAAG;AAC9B,UAAS;EACP,MAAM,IAAI,WAAW,QAAQ,GAAG;AAChC,MAAI,KAAK,EAAE,UAAU,UAAW,QAAO;AACvC,MAAI,KAAK,KAAK,IAAI,SAAU,QAAO;AACnC,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,OAAO,CAAC;;;AAInD,SAAgB,MAAM,KAAyC;AAC7D,KAAI,CAAC,OAAO,OAAO,EAAG,QAAO;AAC7B,KAAI;AACF,UAAQ,KAAK,KAAK,EAAE;AACpB,SAAO;SACD;AACN,SAAO;;;;;;;;;;;;;AAcX,SAAgB,QAAQ,QAAwD;AAC9E,KAAI,OAAO,OAAO,KAAK,CAAC,MAAM,OAAO,IAAI,CAAE,QAAO;AAClD,KAAI;EACF,MAAM,MAAM,aAAa,MAAM;GAAC;GAAM;GAAW;GAAM,OAAO,OAAO,IAAI;GAAC,EAAE;GAC1E,UAAU;GACV,KAAK;IAAE,GAAG,QAAQ;IAAK,QAAQ;IAAK;GACrC,CAAC,CAAC,MAAM;EACT,MAAM,UAAU,KAAK,MAAM,IAAI;EAC/B,MAAM,UAAU,KAAK,MAAM,OAAO,QAAQ,QAAQ,KAAK,IAAI,CAAC;AAC5D,MAAI,OAAO,MAAM,QAAQ,IAAI,OAAO,MAAM,QAAQ,CAAE,QAAO,MAAM,OAAO,IAAI;AAC5E,SAAO,KAAK,IAAI,UAAU,QAAQ,IAAI;SAChC;AAGN,SAAO,MAAM,OAAO,IAAI;;;;AAK5B,SAAgB,OAAO,QAAkE;AACvF,QAAO,OAAO,UAAU,aAAa,QAAQ,OAAO;;;AAItD,SAAgB,MAAM,IAAY,sBAAY,IAAI,MAAM,EAAU;CAChE,MAAM,IAAI,KAAK,MAAM,GAAG,QAAQ,KAAK,IAAI,CAAC;AAC1C,KAAI,OAAO,MAAM,EAAE,CAAE,QAAO;CAC5B,MAAM,IAAI,KAAK,IAAI,GAAG,KAAK,OAAO,IAAI,SAAS,GAAG,KAAK,IAAK,CAAC;AAC7D,QAAO,IAAI,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,IAAI,GAAG,CAAC;;;AAIlD,SAAgB,UAAU,IAAY,sBAAY,IAAI,MAAM,EAAU;CACpE,MAAM,IAAI,KAAK,MAAM,GAAG,QAAQ,KAAK,IAAI,CAAC;AAC1C,KAAI,OAAO,MAAM,EAAE,CAAE,QAAO;CAC5B,MAAM,OAAO,KAAK,IAAI,GAAG,KAAK,OAAO,IAAI,SAAS,GAAG,KAAK,IAAK,CAAC;CAChE,MAAM,QAAQ,KAAK,MAAM,OAAO,KAAK;CACrC,MAAM,OAAO,KAAK,MAAO,OAAO,OAAQ,GAAG;CAC3C,MAAM,MAAM,OAAO;AACnB,KAAI,QAAQ,EAAG,QAAO,GAAG,MAAM,IAAI,OAAO,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;AAClG,KAAI,OAAO,EAAG,QAAO,GAAG,KAAK,IAAI,OAAO,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;AAC9D,QAAO,GAAG,IAAI;;;AAIhB,MAAa,mBAAmB;AAEhC,MAAM,WAAW;;AAGjB,SAAS,oBAAoB,MAAsB;AACjD,QAAO,SAAS,MAAM,KAAK,SAAS,MAAM,OAAO,SAAS,MAAM,QAAS;;;;;;;;;;AAW3E,SAAgB,eAAe,SAAgC;CAC7D,MAAM,IAAI,QAAQ,MAAM,SAAS;AACjC,KAAI,CAAC,EAAG,QAAO;CACf,MAAM,OAAO,OAAO,EAAE,GAAG,GAAG,oBAAoB,EAAE,GAAG;AACrD,QAAO,OAAO,SAAS,KAAK,IAAI,QAAQ,mBAAmB,OAAO;;;AA6EpE,SAAgB,aAAa,MAAc,KAAsB;AAC/D,KAAI,OAAO,QAAQ,YAAY,QAAQ,KAAM,QAAO;CACpD,MAAM,IAAI;CACV,MAAM,OAAO,MAAe,OAAO,EAAE,OAAO,WAAY,EAAE,KAAgB;AAC1E,KAAI,SAAS,OAAQ,QAAO,SAAS,UAAU,IAAI,UAAU,EAAE,GAAG;AAClE,KAAI,SAAS,UAAU,SAAS,UAAU,SAAS,WAAW,SAAS,YAErE,QAAO,GAAG,KAAK,IADF,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI;AAGpD,KAAI,SAAS,UAAU,SAAS,OAAQ,QAAO,GAAG,KAAK,IAAI,UAAU,IAAI,UAAU,EAAE,GAAG;AACxF,KAAI,SAAS,YAAa,QAAO,GAAG,KAAK,IAAI,UAAU,IAAI,QAAQ,EAAE,GAAG;AACxE,KAAI,SAAS,WAAY,QAAO,GAAG,KAAK,IAAI,UAAU,IAAI,MAAM,EAAE,GAAG;AACrE,QAAO;;;;;;;;;;;;;;;;;;ACvdT,SAAgB,YAAY,oBAAU,IAAI,MAAM,EAAU;CACxD,MAAM,KAAK,MAAc,OAAO,EAAE,CAAC,SAAS,GAAG,IAAI;AACnD,QACE,GAAG,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,UAAU,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,GACzD,EAAE,EAAE,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE,YAAY,CAAC,CAAC,GAAG,EAAE,EAAE,YAAY,CAAC;;;AAWhE,SAAgB,gBAAgB,MAAiC;CAC/D,MAAM,IAAI,KAAK,MAAM,0DAA0D;AAC/E,KAAI,CAAC,EAAG,QAAO;CACf,MAAM,SAAiC,EAAE;AAEzC,MAAK,MAAM,SAAS,EAAE,MAAM,IAAI,MAAM,IAAI,EAAE;AAC1C,MAAI,CAAC,KAAM;EACX,MAAM,KAAK,KAAK,QAAQ,IAAI;AAC5B,MAAI,MAAM,EAAG;AACb,SAAO,KAAK,MAAM,GAAG,GAAG,IAAI,KAAK,MAAM,KAAK,EAAE;;AAEhD,QAAO;EAAE,OAAO,EAAE;EAAI,OAAO,EAAE;EAAI;EAAQ;;;AAc7C,SAAgB,aACd,MACA,OACA,IACA,sBAAY,IAAI,MAAM,EAChB;CACN,MAAM,QAAkB,EAAE;AAC1B,MAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,GAAG,EAAE;AACvC,MAAI,MAAM,UAAa,MAAM,KAAM;AACnC,QAAM,KAAK,GAAG,EAAE,GAAG,OAAO,EAAE,CAAC,QAAQ,QAAQ,IAAI,GAAG;;CAEtD,MAAM,MAAM,QAAQ,KAAK;AACzB,KAAI,CAAC,WAAW,IAAI,CAAE,WAAU,KAAK,EAAE,WAAW,MAAM,CAAC;CACzD,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM,KAAK,IAAI,GAAG;AACpD,gBAAe,MAAM,GAAG,YAAY,IAAI,CAAC,GAAG,QAAQ,KAAK,KAAK,OAAO;;;AAevE,SAAgB,cACd,MACA,OACA,QAAQ,IACR,sBAAY,IAAI,MAAM,EACA;AACtB,KAAI,CAAC,WAAW,KAAK,CAAE,QAAO;CAC9B,MAAM,OAAO,aAAa,MAAM,OAAO;CACvC,MAAM,QAAQ,YAAY,IAAI,CAAC,MAAM,GAAG,GAAG;CAC3C,MAAM,QAAQ,KAAK,MAAM,KAAK,CAAC,QAAQ,MAAM,EAAE,MAAM,CAAC;CAGtD,MAAM,UADJ,UAAU,QAAQ,QAAQ,MAAM,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,EAC9C,IAAI,gBAAgB,CAAC,QAAQ,MAAuB,MAAM,KAAK;CACrF,MAAM,SAAS,OAAe,OAAO,QAAQ,MAAM,EAAE,UAAU,GAAG,CAAC;CACnE,MAAM,OAAO,OAAO,QAAQ,MAAM,EAAE,UAAU,aAAa;CAC3D,MAAM,KAAK,KAAK,QAAQ,MAAM,EAAE,OAAO,OAAO,IAAI,CAAC;AACnD,QAAO;EACL,OAAO,UAAU,QAAQ,aAAa,SAAS;EAC/C,SAAS,MAAM,eAAe;EAC9B,SAAS;EACT,aAAa,KAAK,SAAS;EAC3B,QAAQ,MAAM,yBAAyB;EACvC,SAAS,MAAM,0BAA0B;EACzC,UAAU,MAAM,iBAAiB;EACjC,WAAW,MAAM,MAAM,CAAC,MAAM;EAC/B;;;;;;;;;;;;ACpFH,MAAa,cAAc;AAE3B,SAAS,SAAS,KAA4B;AAC5C,KAAI;AACF,SAAO,IAAI,KAAK,CAAC,aAAa,kBAAkB,CAAC;SAC3C;AACN,SAAO;;;AAIX,SAAS,OAAO,IAAoB;CAClC,MAAM,IAAI,KAAK,MAAM,KAAK,KAAU;AACpC,QAAO,KAAK,KAAK,GAAG,KAAK,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,KAAK,IAAO,CAAC;;;AAI5F,SAAgB,eAAe,QAAgB,UAAmB,MAAM,KAAK,KAAK,EAAmB;CACnG,MAAM,OAAO,WAAW,SAAS,SAAS,GAAG;AAC7C,KAAI,YAAY,CAAC,KAAM,QAAO,EAAE;CAChC,MAAM,MAAuB,EAAE;AAC/B,MAAK,MAAM,MAAM,aAAa,OAAO,EAAE;AACrC,MAAI,GAAG,YAAY,GAAG,UAAU,OAAO,GAAG,CAAE;AAC5C,MAAI,CAAC,GAAG,eAAe,CAAC,WAAW,GAAG,YAAY,CAAE;EACpD,MAAM,OAAO,SAAS,GAAG,IAAI;AAC7B,MAAI,CAAC,QAAS,QAAQ,SAAS,KAAO;EACtC,IAAI,UAAU;EACd,IAAI,QAAQ;AACZ,MAAI;AACF,OAAI,GAAG,OACL,WAAU,IAAI,MAAM;IAAC;IAAU;IAAQ,cAAc,GAAG;IAAS,CAAC,CAC/D,MAAM,KAAK,CACX,QAAQ,MAAM,EAAE,WAAW,IAAI,CAAC,CAAC;AAEtC,WAAQ,iBAAiB,GAAG,YAAY,CAAC,QAAQ,MAAM,CAAC,2BAA2B,KAAK,EAAE,CAAC,CAAC;UACtF;AACN;;AAEF,MAAI,CAAC,WAAW,CAAC,MAAO;EACxB,IAAI,QAAQ;AACZ,MAAI;AACF,WAAQ,KAAK,IAAI,GAAG,MAAM,SAAS,WAAW,QAAQ,GAAG,GAAG,CAAC,CAAC,QAAQ;UAChE;AAGR,MAAI,KAAK;GAAE,IAAI,GAAG;GAAI,OAAO,GAAG;GAAO;GAAM;GAAO,KAAK,OAAO,MAAM;GAAE;GAAS;GAAO,CAAC;;AAE3F,QAAO;;;AAIT,SAAgB,cAAc,SAA0B,WAAW,OAAe;AAChF,QAAO,QACJ,KAAK,MAAM;EACV,MAAM,OAAO,EAAE,QAAQ,cAAc,OAAY,kBAAkB,oBAAoB,EAAE;EACzF,MAAM,OAAO,WAAW,KAAK,EAAE,SAAS;AACxC,SAAO,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE,QAAQ,cAAc,EAAE,MAAM,UAAU,EAAE,QAAQ,KAAK,OAAO;GAC7F,CACD,KAAK,KAAK;;;;;;AAOf,SAAgB,YACd,SACA,MAAyB,QAAQ,KACE;AACnC,KAAI,CAAC,QAAQ,UAAU,IAAI,sBAAsB,IAAK,QAAO;EAAE,MAAM;EAAG,SAAS;EAAI;AACrF,QAAO;EACL,MAAM;EACN,SACE,GAAG,QAAQ,OAAO,iFACf,cAAc,QAAQ,CAAC;EAE7B;;;AAwBH,SAAgB,uBAAuB,QAAgB,UAAwB;CAC7E,MAAM,OAAO,KAAK,QAAQ,qBAAqB;CAC/C,IAAI,QAAmD,EAAE;AACzD,KAAI;AACF,UAAQ,KAAK,MAAM,aAAa,MAAM,OAAO,CAAC;SACxC;AAEN;;CAEF,MAAM,WAAW,SAAS,SAAS,IAAI,GAAG,WAAW,GAAG,SAAS;CACjE,IAAI,UAAU;AACd,MAAK,MAAM,OAAO,OAAO,KAAK,MAAM,CAClC,KAAI,QAAQ,YAAY,IAAI,WAAW,SAAS,EAAE;AAChD,SAAO,MAAM;AACb,YAAU;;AAGd,KAAI,CAAC,QAAS;AACd,KAAI;AACF,gBAAc,MAAM,KAAK,UAAU,MAAM,CAAC;SACpC;;;;;;;;;;;;;;;;;;;;ACzHV,SAAgB,aAAa,QAAwB;AACnD,QAAO,KAAK,QAAQ,YAAY;;AAGlC,SAAgB,eAAe,IAAoB;AACjD,QAAO,UAAU;;AAGnB,SAAgB,aAAa,QAAgB,IAAoB;AAC/D,QAAO,KAAK,aAAa,OAAO,EAAE,GAAG;;;AAIvC,SAAS,OAAO,KAAa,MAAgB,KAAyB,UAAU,KAAgB;AAC9F,KAAI;AACF,SAAO,aAAa,OAAO;GAAC;GAAM;GAAK,GAAG;GAAK,EAAE;GAC/C,UAAU;GACV;GACA,OAAO;IAAC;IAAU;IAAQ;IAAO;GACjC,GAAI,MAAM,EAAE,KAAK,GAAG,EAAE;GACvB,CAAC,CAAC,MAAM;UACF,GAAG;EACV,MAAM,MAAM;EACZ,MAAM,OACH,OAAO,IAAI,WAAW,WAAW,IAAI,SAAS,IAAI,QAAQ,SAAS,OAAO,KAC3E,IAAI,WACJ,OAAO,EAAE;AACX,QAAM,IAAI,MAAM,OAAO,KAAK,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,GAAG;;;;AAKrE,SAAgB,IAAI,KAAa,MAAgB,WAA4B;AAC3E,QAAO,OAAO,KAAK,MAAM,QAAW,UAAU;;;AAIhD,SAAgB,UAAU,KAAsB;AAC9C,KAAI;AACF,SAAO,IAAI,KAAK,CAAC,aAAa,YAAY,CAAC,KAAK;SAC1C;AACN,SAAO;;;;AAKX,MAAM,gBAAgB;CAAC;CAAQ;CAAS;CAAa;CAAgB;CAAO;;AAG5E,SAAgB,cAAc,cAAiC;CAC7D,MAAM,QAAQ,aAAa,SAAS,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,QAAQ,SAAS,GAAG,CAAC,CAAC,OAAO,QAAQ;AACjH,QAAO,CAAC,MAAM,UAAU,MAAM,MAAM,MAAM,cAAc,SAAS,EAAE,CAAC;;;AAOtE,SAAgB,eAAe,MAAoB,MAAwD;AACzG,KAAI,SAAS,OAAW,QAAO;AAC/B,QAAO,cAAc,KAAK,aAAa,IAAI,UAAU,KAAK,IAAI;;;;;;;;;;AAmBhE,SAAS,oBAAoB,KAAa,IAAY,MAAsB;CAC1E,MAAM,SAAS,YAAY,KAAK,QAAQ,EAAE,oBAAoB,CAAC;CAC/D,MAAM,MAAM,KAAK,QAAQ,QAAQ;AACjC,KAAI;EACF,MAAM,MAAM;GAAE,GAAG,QAAQ;GAAK,gBAAgB;GAAK;AACnD,SAAO,KAAK,CAAC,aAAa,KAAK,EAAE,IAAI;AACrC,SAAO,KAAK,CAAC,OAAO,KAAK,EAAE,IAAI;AAE/B,SAAO,OAAO,KAAK;GACjB;GAFW,OAAO,KAAK,CAAC,aAAa,EAAE,IAAI;GAI3C;GACA;GACA;GACA,UAAU,GAAG;GACd,CAAC;WACM;AACR,SAAO,QAAQ;GAAE,WAAW;GAAM,OAAO;GAAM,CAAC;;;;;;;;;;;AAYpD,SAAgB,YAAY,QAAgB,IAAY,KAA2B;CACjF,MAAM,MAAM,aAAa,QAAQ,GAAG;CACpC,MAAM,SAAS,eAAe,GAAG;CACjC,MAAM,OAAO,IAAI,KAAK,CAAC,aAAa,OAAO,CAAC;CAC5C,MAAM,QAAQ,WAAW,IAAI,CAAC,SAAS;CACvC,MAAM,OAAO,QAAQ,oBAAoB,KAAK,IAAI,KAAK,GAAG;AAC1D,KAAI,KAAK;EAAC;EAAY;EAAO;EAAK;EAAM;EAAQ;EAAK,CAAC;AACtD,eAAc,QAAQ,IAAI,KAAK,IAAI;AACnC,QAAO;EAAE;EAAK;EAAQ;EAAM,UAAU;EAAO;;;;;;;;;;AAW/C,SAAgB,cAAc,QAAgB,IAAY,KAAa,OAAqB;CAC1F,MAAM,QAAQ,MAAc,aAAa,WAAW,OAAO,EAAE,eAAe;EAAE;EAAI,MAAM;EAAG,CAAC;AAC5F,KAAI;EAEF,MAAM,OAAO,KADA,IAAI,KAAK,CAAC,aAAa,kBAAkB,CAAC,EAC/B,eAAe;EACvC,MAAM,OAAO,KAAK,OAAO,eAAe;AACxC,MAAI,CAAC,WAAW,KAAK,IAAI,UAAU,KAAK,CAAC,gBAAgB,IAAI,WAAW,KAAK,CAAE;AAC/E,MAAI;AAEF,OAAI,OAAO;IAAC;IAAgB;IAAM;IAAe,CAAC;UAC5C;AACN;;EAEF,MAAM,KAAK,KAAK,KAAK;EACrB,MAAM,OAAO;GAAE,KAAK;GAAO,OAAO;GAAmB,SAAS;GAAS;AACvE,MAAI,UAAU,KAAK,SACjB,KAAI;AACF,gBAAa,MAAM;IAAC;IAAO;IAAM;IAAK,EAAE,KAAK;AAC7C,QAAK,iCAAiC,KAAK,KAAK,GAAG,GAAG,IAAI;AAC1D;UACM;AACN,UAAO,MAAM;IAAE,WAAW;IAAM,OAAO;IAAM,CAAC;;AAGlD,MAAI,WAAW,KAAK,OAAO,WAAW,CAAC,CAAE,cAAa,OAAO,CAAC,WAAW,oBAAoB,EAAE,KAAK;WAC3F,WAAW,KAAK,OAAO,oBAAoB,CAAC,CAAE,cAAa,OAAO,CAAC,KAAK,EAAE,KAAK;MACnF;AACL,OAAK,2CAA2C,KAAK,KAAK,GAAG,GAAG,IAAI;UAC7D,GAAG;AACV,MAAI;AACF,QAAK,qCAAsC,EAAY,UAAU;UAC3D;;;;AAOZ,SAAgB,aAAa,KAAa,MAAsB;AAC9D,KAAI;AACF,SAAO,SAAS,IAAI,KAAK;GAAC;GAAY;GAAW,GAAG,KAAK;GAAQ,CAAC,EAAE,GAAG,IAAI;SACrE;AACN,SAAO;;;;;;;AAQX,SAAgB,eACd,QACA,QACA,MACA,IACc;CACd,MAAM,IAAI,EAAE,GAAG,QAAQ;AACvB,KAAI,IAAI;AACN,IAAE,SAAS,KAAK;AAChB,IAAE,UAAU,aAAa,KAAK,KAAK,KAAK,KAAK;AAC7C,IAAE,cAAc,KAAK;AACrB,IAAE,eAAe,KAAK;AACtB,IAAE,mBAAmB,KAAK;YACjB,iBAAiB,KAAK,KAAK,KAAK,KAAK,GAAG,GAAG;AAGpD,IAAE,SAAS,KAAK;AAChB,IAAE,UAAU,aAAa,KAAK,KAAK,KAAK,KAAK;AAC7C,IAAE,cAAc,KAAK;AACrB,IAAE,eAAe,KAAK;AACtB,IAAE,mBAAmB,KAAK;QACrB;AAEL,iBAAe,EAAE,KAAK,KAAK,KAAK,KAAK;AACrC,MAAI;AACF,OAAI,EAAE,KAAK;IAAC;IAAU;IAAM,KAAK;IAAO,CAAC;UACnC;AAGR,IAAE,SAAS;AACX,IAAE,cAAc;AAChB,IAAE,eAAe;AACjB,IAAE,UAAU;AACZ,IAAE,mBAAmB;;AAEvB,YAAW,QAAQ,EAAE;AACrB,wBAAuB,QAAQ,EAAE,IAAI;AACrC,QAAO;;AAGT,SAAS,iBAAiB,KAAa,MAAsB;AAC3D,KAAI;AACF,SAAO,aAAa,KAAK,KAAK;SACxB;AACN,SAAO;;;;;;;;AASX,SAAgB,cACd,QACA,IACA,OACA,OACA,WACU;AACV,KAAI;EACF,MAAM,EAAE,WAAW,YAAY,mBAAmB,OAAO,OAAO,UAAU;AAC1E,MAAI,UAAU,OAAQ,cAAa,QAAQ,kBAAkB;GAAE;GAAI,OAAO,UAAU,KAAK,IAAI;GAAE,SAAS,QAAQ;GAAQ,CAAC;AACzH,MAAI,QAAQ,OAAQ,cAAa,QAAQ,eAAe;GAAE;GAAI,MAAM,oBAAoB,QAAQ,KAAK,KAAK;GAAI,CAAC;AAC/G,SAAO;UACA,GAAG;AACV,MAAI;AACF,gBAAa,QAAQ,eAAe;IAAE;IAAI,MAAM,mBAAoB,EAAY;IAAW,CAAC;UACtF;AAGR,SAAO,EAAE;;;;AAKb,SAAS,eAAe,KAAa,KAAa,OAAsB;AACtE,KAAI;AACF,MAAI,KAAK;GAAC;GAAY;GAAU,GAAI,QAAQ,CAAC,UAAU,GAAG,EAAE;GAAG;GAAI,CAAC;AACpE;SACM;AAGR,KAAI,WAAW,IAAI,CACjB,KAAI;AACF,SAAO,KAAK;GAAE,WAAW;GAAM,OAAO;GAAM,CAAC;AAC7C,MAAI,KAAK,CAAC,YAAY,QAAQ,CAAC;SACzB;;;;;;;;AAYZ,SAAgB,iBAAiB,OAAe,WAA8B;CAC5E,MAAM,UAAU,IAAI,OAAO;EAAC;EAAQ;EAAe;EAAO,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ;CAClG,MAAM,YAAY,IAAI,OAAO;EAAC;EAAY;EAAY;EAAqB,EAAE,UAAU,CACpF,MAAM,KAAK,CACX,OAAO,QAAQ;AAClB,QAAO,CAAC,GAAG,SAAS,GAAG,UAAU;;;;;;;;;;AAWnC,SAAS,uBAAuB,OAAe,SAA0B;CACvE,MAAM,OAAO,KAAK,OAAO,QAAQ;CACjC,IAAI;AACJ,KAAI;AACF,SAAO,UAAU,KAAK;SAChB;AACN,SAAO;;AAET,KAAI,CAAC,KAAK,gBAAgB,CAAE,QAAO;CACnC,MAAM,SAAS,aAAa,KAAK;CACjC,MAAM,iBAAiB,WAAW,OAAO,GAAG,SAAS,QAAQ,QAAQ,KAAK,EAAE,OAAO;CACnF,MAAM,aAAa,WAAW,eAAe,GAAG,aAAa,eAAe,GAAG;CAC/E,MAAM,YAAY,aAAa,MAAM;AACrC,QAAO,eAAe,aAAa,CAAC,WAAW,WAAW,YAAY,IAAI;;;;;;;;;;;;AAoB5E,SAAgB,mBAAmB,OAAe,OAAe,WAAmC;CAClG,MAAM,QAAQ,iBAAiB,OAAO,UAAU;AAChD,KAAI,CAAC,MAAM,OAAQ,QAAO;EAAE,WAAW,EAAE;EAAE,SAAS,EAAE;EAAE;CACxD,MAAM,UAAoB,EAAE;CAG5B,MAAM,UAAU,IAAI,IAAI,IAAI,OAAO,CAAC,YAAY,YAAY,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ,CAAC;CACrG,MAAM,UAAoB,EAAE;AAC5B,MAAK,MAAM,KAAK,MACd,KAAI,QAAQ,IAAI,EAAE,CAChB,SAAQ,KAAK,GAAG,EAAE,2BAA2B;UACpC,uBAAuB,OAAO,EAAE,CACzC,SAAQ,KAAK,WAAW,EAAE,MAAM,aAAa,KAAK,OAAO,EAAE,CAAC,CAAC,gCAAgC;KAE7F,SAAQ,KAAK,EAAE;AAGnB,KAAI,CAAC,QAAQ,OAAQ,QAAO;EAAE,WAAW,EAAE;EAAE;EAAS;AACtD,KAAI;AAIF,MAAI,OAAO;GAAC;GAAO;GAAoB;GAAM;GAAK,GADjC,MAAM,QAAQ,MAAM,CAAC,QAAQ,SAAS,EAAE,CAAC,CAAC,KAAK,MAAM,qBAAqB,IAAI;GACjC,EAAE,UAAU;EAC1E,MAAM,UAAU,IAAI,OAAO;GAAC;GAAQ;GAAY;GAAmB;GAAc,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ;AACzH,MAAI,QAAQ,SAAS,qBAAqB;AACxC,OAAI,OAAO,CAAC,SAAS,KAAK,EAAE,UAAU;AACtC,SAAM,IAAI,MAAM,wBAAwB,QAAQ,OAAO,kBAAkB,QAAQ,MAAM,GAAG,EAAE,CAAC,KAAK,KAAK,CAAC,iBAAiB;;AAE3H,MAAI,OAAO;GAAC;GAAU;GAAM,aAAa;GAAQ,EAAE,UAAU;UACtD,GAAG;AACV,QAAM,IAAI,MACR,6CAA6C,MAAM,KAAM,EAAY,QAAQ,kEAE9E;;AAEH,QAAO;EAAE,WAAW;EAAS;EAAS;;;AAIxC,MAAM,sBAAsB;;;;;;AAO5B,SAAS,WAAW,KAAuB;CAQzC,MAAM,SALM,aAAa,OAAO;EAAC;EAAM;EAAK;EAAU;EAAe;EAAK,EAAE;EAC1E,UAAU;EACV,SAAS;EACT,OAAO;GAAC;GAAU;GAAQ;GAAO;EAClC,CAAC,CACiB,MAAM,KAAK;CAC9B,MAAM,SAAS,MAAe,EAAE,WAAW,KAAI,IAAI,EAAE,SAAS,KAAI,GAAG,EAAE,MAAM,GAAG,GAAG,GAAG;CACtF,MAAM,MAAgB,EAAE;AACxB,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,IAAI,OAAO;AACjB,MAAI,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,OAAO,EAAE,KAAK,IAAK;AAC/C,MAAI,KAAK,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;EAC3B,MAAM,KAAK,EAAE,MAAM,GAAG,EAAE;AACxB,MAAI,GAAG,SAAS,IAAI,IAAI,GAAG,SAAS,IAAI,EAAE;GACxC,MAAM,OAAO,OAAO,IAAI;AACxB,OAAI,QAAQ,KAAK,OAAO,EAAE,KAAK,KAAK;AAClC,QAAI,KAAK,MAAM,KAAK,CAAC;AACrB,SAAK;;;;AAIX,QAAO;;;;;;;AAQT,SAAS,qBACP,KACA,UACA,IACA,QACM;CACN,MAAM,QAAQ,IAAI,IAAI,WAAW,IAAI,CAAC;CACtC,MAAM,UAAU,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC,CAAC,QAAQ,MAAM,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM;AACzE,KAAI,CAAC,QAAQ,OAAQ;AACrB,OAAM,IAAI,MACR,UAAU,GAAG,iBAAiB,IAAI,oCAAoC,OAAO,YACxE,QAAQ,KAAK,KAAK,CAAC,wEAAwE,GAAG,6CAEpG;;;;;;;;AASH,SAAgB,oBAAoB,OAAe,IAAkB;CACnE,MAAM,WAAW,iBAAiB,MAAM,CAAC,QAAQ,MAAM,CAAC,uBAAuB,OAAO,EAAE,CAAC;AACzF,KAAI,SAAS,OACX,OAAM,IAAI,MACR,UAAU,GAAG,iBAAiB,MAAM,oCAC9B,SAAS,KAAK,KAAK,CAAC,wEAC3B;;;AAKL,SAAS,OAAO,KAAa,KAAa,MAA6B;AACrE,KAAI;AACF,SAAO,IAAI,KAAK;GAAC;GAAa;GAAY;GAAM,GAAG,IAAI,GAAG;GAAO,CAAC;SAC5D;AACN,SAAO;;;;AAKX,SAAS,YAAY,KAAa,MAA6B;AAC7D,KAAI,CAAC,WAAW,KAAK,KAAK,KAAK,CAAC,CAAE,QAAO;AACzC,KAAI;AACF,SAAO,IAAI,KAAK;GAAC;GAAe;GAAM;GAAK,CAAC;SACtC;AACN,SAAO;;;;;;;;;AAUX,SAAS,sBAAsB,KAAa,UAAkB,OAAiB,IAAkB;CAC/F,MAAM,UAAU,MACb,QAAQ,MAAM,OAAO,KAAK,UAAU,EAAE,KAAK,YAAY,KAAK,EAAE,CAAC,CAC/D,MAAM;AACT,KAAI,CAAC,QAAQ,OAAQ;AACrB,OAAM,IAAI,MACR,UAAU,GAAG,iBAAiB,IAAI,0EAC7B,QAAQ,KAAK,KAAK,CAAC,mDAAmD,GAAG,6CAE/E;;;;;;;;;;;;AAaH,SAAS,oBACP,QACA,IACA,IACA,WAAW,OACH;CACR,MAAM,WAAW,GAAG;CACpB,MAAM,SAAS,GAAG;CAClB,MAAM,cAAc,GAAG;CACvB,MAAM,UAAU,WAAW,YAAY,GACnC,mBAAmB,aAAa,GAAG,SAAS,UAAU,GACtD;EAAE,WAAW,EAAE;EAAE,SAAS,EAAE;EAAE;AAElC,MADiB,SAAS,IAAI,GAAG,KAAK;EAAC;EAAY;EAAW,GAAG,SAAS,IAAI;EAAS,CAAC,EAAE,GAAG,IAAI,MACjF,EACd,OAAM,IAAI,MACR,UAAU,GAAG,WAAW,OAAO,6DACb,YAAY,gIACuC,KACtE;CAEH,MAAM,eAAe,IAAI,GAAG,KAAK;EAAC;EAAQ;EAAe;EAAU;EAAO,CAAC,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ;AACvG,uBAAsB,GAAG,KAAK,UAAU,cAAc,GAAG;CACzD,MAAM,OAAO,aAAa,OAAO;EAAC;EAAM,GAAG;EAAK;EAAQ;EAAY;EAAU;EAAO,EAAE;EACrF,UAAU;EACV,SAAS;EACT,WAAW,KAAK,OAAO;EACxB,CAAC;AACF,KAAI,KAAK,MAAM,CACb,KAAI;AACF,eAAa,OAAO;GAAC;GAAM,GAAG;GAAK;GAAS;GAAW,EAAE;GACvD,OAAO;GACP,UAAU;GACV,SAAS;GACT,OAAO;IAAC;IAAQ;IAAQ;IAAO;GAChC,CAAC;UACK,GAAG;EACV,MAAM,MAAM;EACZ,MAAM,OACH,OAAO,IAAI,WAAW,WAAW,IAAI,SAAS,IAAI,QAAQ,SAAS,OAAO,KAC3E,IAAI,WACJ,OAAO,EAAE;AACX,QAAM,IAAI,MACR,UAAU,GAAG,yBAAyB,OAAO,gBAAgB,GAAG,IAAI,KAAK,IAAI,MAAM,CAAC,iBAClE,YAAY,+CAC/B;;AAGL,KAAI,SAAU,QAAO,kBAAkB,IAAI,QAAQ,aAAa,aAAa;AAC7E,gBAAe,GAAG,KAAK,aAAa,KAAK;AACzC,KAAI;AACF,MAAI,GAAG,KAAK;GAAC;GAAU;GAAM;GAAO,CAAC;SAC/B;AAIR,YAAW,QADD;EAAE,GAAG;EAAI,QAAQ;EAAM,CACZ;CACrB,MAAM,OACJ,kBAAkB,GAAG,qBAAqB,OAAO,OAAO,GAAG,IAAI,2BAC5D,aAAa,KAAK,KAAK,CAAC;CAC7B,MAAM,QAAkB,EAAE;AAC1B,KAAI,QAAQ,UAAU,OACpB,OAAM,KACJ,YAAY,QAAQ,UAAU,OAAO,gDAAgD,QAAQ,UAAU,KAAK,KAAK,GAClH;AAEH,KAAI,QAAQ,QAAQ,OAClB,OAAM,KAAK,WAAW,QAAQ,QAAQ,KAAK,KAAK,GAAG;AAErD,QAAO,MAAM,SAAS,GAAG,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK;;AAGzD,SAAS,kBAAkB,IAAY,QAAgB,aAAqB,OAAyB;AACnG,QACE,kBAAkB,GAAG,qBAAqB,OAAO,4CAA4C,MAAM,KAAK,KAAK,CAAC,wBACvF,YAAY;;;;;;;AASvC,SAAS,cAAc,KAAa,IAAY,QAAgB,aAAqB,MAAc,OAAyB;CAC1H,MAAM,OAAO,aAAa,OAAO;EAAC;EAAM;EAAK;EAAQ;EAAY,GAAG,KAAK,IAAI;EAAS,EAAE;EACtF,UAAU;EACV,SAAS;EACT,WAAW,KAAK,OAAO;EACvB,KAAK;GAAE,GAAG,QAAQ;GAAK,QAAQ;GAAK;EACrC,CAAC;AACF,KAAI;AACF,eAAa,OAAO;GAAC;GAAM;GAAK;GAAS;GAAU;GAAW,EAAE;GAC9D,OAAO;GACP,SAAS;GACT,OAAO;IAAC;IAAQ;IAAQ;IAAO;GAC/B,KAAK;IAAE,GAAG,QAAQ;IAAK,QAAQ;IAAK;GACrC,CAAC;UACK,GAAG;EACV,MAAM,aAAa,IAAI,KAAK;GAAC;GAAQ;GAAe;GAAkB,CAAC,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ;EACnG,MAAM,MAAM;EACZ,MAAM,QAAQ,OAAO,IAAI,WAAW,WAAW,IAAI,SAAS,IAAI,QAAQ,SAAS,OAAO,KAAK,IAAI,WAAW,IAAI,MAAM;AACtH,QAAM,IAAI,MACR,WAAW,SACP,UAAU,GAAG,aAAa,OAAO,iBAAiB,WAAW,KAAK,KAAK,CAAC,wFACV,YAAY,cAC1E,UAAU,GAAG,yBAAyB,OAAO,MAAM,IAAI,KAAK,IAAI,sDACrE;;AAEH,QAAO,kBAAkB,IAAI,QAAQ,aAAa,MAAM;;;;;;;;;;;AAsB1D,SAAgB,aAAa,QAAgB,IAAY,OAA6B,EAAE,EAAgB;CACtG,MAAM,KAAK,WAAW,QAAQ,GAAG;AACjC,KAAI,CAAC,GAAI,OAAM,IAAI,MAAM,oBAAoB,GAAG,GAAG;CACnD,MAAM,MAAM;EAAE,GAAG,QAAQ;EAAK,QAAQ;EAAK;CAC3C,MAAM,SAAS,SAAkC;AAC/C,MAAI;AACF,UAAO,aAAa,OAAO;IAAC;IAAM,GAAG;IAAK,GAAG;IAAK,EAAE;IAClD;IACA,SAAS;IACT,WAAW,MAAM,OAAO;IACxB,OAAO;KAAC;KAAU;KAAQ;KAAO;IAClC,CAAC;UACI;AACN,UAAO;;;CAGX,MAAM,OAAO,QAAyB,MAAM;EAAC;EAAa;EAAY;EAAM,GAAG,IAAI;EAAW,CAAC,KAAK;CACpG,MAAM,MAAM,CAAC,cAAc,eAAe,GAAG,IAAI,oBAAoB,KAAK,CAAC,KAAK,IAAI;AACpF,KAAI,CAAC,IAAK,OAAM,IAAI,MAAM,UAAU,GAAG,YAAY,eAAe,GAAG,CAAC,wBAAwB,GAAG,aAAa,GAAG,MAAM;CACvH,MAAM,OAAO,GAAG,oBAAoB,GAAG,eAAe,GAAG,eAAe,IAAI,GAAG,KAAK;EAAC;EAAc;EAAQ;EAAI,CAAC;CAChH,MAAM,QAAQ,MAAM;EAAC;EAAQ;EAAiB;EAAgB;EAAM,GAAG,KAAK,IAAI;EAAM,CAAC,IAAI,OAAO,MAAM,EAAE,EACvG,SAAS,OAAO,CAChB,MAAM,KAAK,CACX,OAAO,QAAQ;CAClB,MAAM,QAA+B,EAAE;AACvC,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,QAAQ,KAAK,GAAG;EAC3C,MAAM,OAAO,KAAK,IAAI;EACtB,MAAM,UAAU,KAAK,OAAO;EAC5B,MAAM,SAAS,KAAK,UAChB,MAAM,CAAC,QAAQ,GAAG,KAAK,QAAQ,GAAG,OAAO,CAAC,GAC1C,WAAW,KAAK,GAAG,KAAK,KAAK,CAAC,GAC5B,aAAa,KAAK,GAAG,KAAK,KAAK,CAAC,GAChC;EACN,IAAI;AACJ,MAAI,QAAS,SAAQ,SAAS,YAAY;OACrC;GACH,MAAM,OAAO,MAAM,CAAC,QAAQ,GAAG,IAAI,GAAG,OAAO,CAAC;AAC9C,WAAQ,CAAC,SAAS,YAAY,QAAQ,KAAK,OAAO,OAAO,GAAG,cAAc;;AAE5E,QAAM,KAAK;GAAE;GAAM;GAAO,CAAC;;AAE7B,QAAO;EAAE;EAAI;EAAK;EAAM,SAAS,KAAK,WAAW;EAAgB;EAAO,IAAI,MAAM,OAAO,MAAM,EAAE,UAAU,YAAY;EAAE;;;;;;;;;;;AAY3H,SAAgB,YAAY,QAAgB,IAAY,OAA+B,EAAE,EAAU;CACjG,MAAM,KAAK,eAAe,QAAQ,GAAG;AACrC,KAAI,GAAG,OAAQ,QAAO,UAAU,GAAG,WAAW,GAAG,OAAO;AACxD,KAAI,GAAG,iBAAkB,QAAO,oBAAoB,QAAQ,IAAI,IAAI,KAAK,SAAS;CAElF,MAAM,UAAU,WAAW,GAAG,YAAa,GACvC,mBAAmB,GAAG,aAAc,GAAG,SAAS,UAAU,GAC1D;EAAE,WAAW,EAAE;EAAE,SAAS,EAAE;EAAE;AAElC,MADiB,SAAS,IAAI,GAAG,KAAK;EAAC;EAAY;EAAW,SAAS,GAAG;EAAS,CAAC,EAAE,GAAG,IAAI,MAC7E,EACd,OAAM,IAAI,MACR,UAAU,GAAG,WAAW,GAAG,OAAO,yCAChB,GAAG,YAAY,gIACoC,KACtE;CAEH,MAAM,YAAY,IAAI,GAAG,KAAK;EAAC;EAAc;EAAQ,GAAG;EAAQ,CAAC;CACjE,MAAM,gBAAgB,IAAI,GAAG,KAAK;EAAC;EAAQ;EAAe;EAAW,GAAG;EAAQ,CAAC,CAC9E,MAAM,KAAK,CACX,OAAO,QAAQ;AAClB,sBAAqB,GAAG,KAAK,eAAe,IAAI,GAAG,OAAQ;AAC3D,KAAI,KAAK,SAAU,QAAO,cAAc,GAAG,KAAK,IAAI,GAAG,QAAS,GAAG,aAAc,WAAW,cAAc;AAC1G,KAAI;AACF,MAAI,GAAG,KAAK;GAAC;GAAS;GAAW,GAAG;GAAS;GAAM,gBAAgB,GAAG,IAAI,GAAG,MAAM;GAAG,CAAC;UAChF,GAAG;AACV,QAAM,IAAI,MACR,UAAU,GAAG,6BAA6B,GAAG,OAAO,KAAM,EAAY,QAAQ,iBAC5D,GAAG,YAAY,oDAClC;;AAEH,KAAI,WAAW,GAAG,YAAa,CAAE,qBAAoB,GAAG,aAAc,GAAG;AAGzE,gBAAe,GAAG,KAAK,GAAG,aAAc,KAAK;CAC7C,IAAI,aAAa;AACjB,KAAI;AACF,MAAI,GAAG,KAAK;GAAC;GAAU;GAAM,GAAG;GAAQ,CAAC;SACnC;AACN,eAAa;;AAGf,YAAW,QADD;EAAE,GAAG;EAAI,QAAQ;EAAM,CACZ;AACrB,wBAAuB,QAAQ,GAAG,IAAI;CACtC,MAAM,OAAO,UAAU,GAAG,OAAO,QAAQ,GAAG,IAAI,oBAAoB,aAAa,qBAAqB,gCAAgC;CACtI,MAAM,QAAkB,EAAE;AAC1B,KAAI,QAAQ,UAAU,OACpB,OAAM,KAAK,YAAY,QAAQ,UAAU,OAAO,0BAA0B,QAAQ,UAAU,KAAK,KAAK,GAAG;AAE3G,KAAI,QAAQ,QAAQ,OAClB,OAAM,KAAK,WAAW,QAAQ,QAAQ,KAAK,KAAK,GAAG;AAErD,QAAO,MAAM,SAAS,GAAG,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK;;;AAIzD,SAAgB,cAAc,QAAgB,IAAoB;CAChE,MAAM,KAAK,eAAe,QAAQ,GAAG;AACrC,gBAAe,GAAG,KAAK,GAAG,aAAc,KAAK;CAC7C,IAAI,aAAa;AACjB,KAAI;AACF,MAAI,GAAG,KAAK;GAAC;GAAU;GAAM,GAAG;GAAQ,CAAC;AACzC,eAAa;SACP;AACN,eAAa;;AAWf,YAAW,QATD;EACR,GAAG;EACH,QAAQ;EACR,aAAa;EACb,cAAc;EACd,kBAAkB;EAClB,SAAS;EACT,QAAQ;EACT,CACoB;AACrB,wBAAuB,QAAQ,GAAG,IAAI;AACtC,QAAO,oBAAoB,GAAG,oBAAoB,aAAa,YAAY,GAAG,OAAO,YAAY;;AAGnG,SAAS,eAAe,QAAgB,IAAmF;CACzH,MAAM,KAAK,WAAW,QAAQ,GAAG;AACjC,KAAI,CAAC,GAAI,OAAM,IAAI,MAAM,oBAAoB,GAAG,GAAG;AACnD,KAAI,CAAC,GAAG,UAAU,CAAC,GAAG,YACpB,OAAM,IAAI,MACR,UAAU,GAAG,6BAA6B,GAAG,SAAS,aAAa,QAAQ,sDAE5E;AAEH,QAAO;;;;;;;AAQT,SAAgB,qBAAqB,IAAY,QAAgB,KAAa,WAAW,OAAe;AACtG,QAAO;EACL;EACA,KAAK,IAAI,aAAa,OAAO,cAAc,GAAG;EAC9C;EACA;EACA;EACA;EACA,GAAI,WACA,CACE,+IACD,GACD,EAAE;EACP,CAAC,KAAK,KAAK;;;;;;;;AASd,SAAgB,sBAA8B;AAC5C,QAAO;EACL;EACA;EACA;EACD,CAAC,KAAK,KAAK;;AAUd,MAAM,WAAW;;;;;;;;AASjB,SAAgB,YACd,QACA,iBAAiB,IACjB,SAAS,OACT,MAAM,KAAK,KAAK,EACL;CACX,MAAM,SAAS,MAAM,iBAAiB;CACtC,MAAM,MAAiB,EAAE;CACzB,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,wBAAQ,IAAI,KAAa;CAC/B,MAAM,WAAW,IAAY,KAAa,OAAkC;EAC1E,MAAM,SAAS,oBAAoB;AACnC,MAAI,OAAQ,QAAO,KAAK,IAAI,KAAK;GAAE;GAAI,SAAS;GAAQ,CAAC;AACzD,MAAI;GAGF,IAAI;AACJ,OAAI;IACF,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,mBAAmB,CAAC;AACvD,WAAO,WAAW,IAAI,GAAG,MAAM,QAAQ,KAAK,IAAI;WAC1C;AACN,UAAM,IAAI,MAAM,qBAAqB;;GAEvC,MAAM,QAAQ,qCAAqC;AACnD,OAAI,iBAAiB,IAAI,CAAC,QAAQ;IAEhC,MAAM,MAAM,mBAAmB,KAAK,MAAM;AAC1C,QAAI,IAAI,UAAU,OAAQ,KAAI,KAAK;KAAC;KAAU;KAAW;KAAM;KAAM;KAAM,CAAC;AAC5E,QAAI,IAAI,QAAQ,UAAU,iBAAiB,IAAI,CAAC,MAAM,MAAM,CAAC,uBAAuB,KAAK,EAAE,CAAC,CAC1F,OAAM,IAAI,MAAM,2BAA2B;;GAG/C,MAAM,MAAM,eAAe,GAAG;GAC9B,IAAI,YAAY;AAChB,OAAI;AACF,QAAI,MAAM;KAAC;KAAa;KAAY;KAAM,cAAc;KAAM,CAAC;WACzD;AACN,gBAAY;;GAEd,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,OAAO,CAAC;AAE3C,OAAI,UAAW,KAAI,MAAM;IAAC;IAAc;IAAiB,cAAc;IAAO;IAAI,CAAC;AACnF,OAAI,MAAM;IAAC;IAAc;IAAQ;IAAI,CAAC;AACtC,OAAI,MAAM;IAAC;IAAY;IAAU;IAAW;IAAI,CAAC;AACjD,OAAI,UAAW,KAAI,MAAM;IAAC;IAAU;IAAM;IAAI,CAAC;AAC/C,OAAI,GAAI,YAAW,QAAQ;IAAE,GAAG;IAAI,QAAQ;IAAM,aAAa;IAAM,UAAU;IAAQ,CAAC;AACxF,gBAAa,WAAW,OAAO,EAAE,aAAa;IAAE;IAAI,SAAS;IAAQ,CAAC;AACtE,OAAI,KAAK;IAAE;IAAI,SAAS;IAAQ,CAAC;WAC1B,GAAG;AACV,OAAI,KAAK;IAAE;IAAI,SAAU,EAAY,QAAQ,MAAM,KAAK,CAAC;IAAI,CAAC;;;AAIlE,MAAK,MAAM,MAAM,aAAa,OAAO,EAAE;AACrC,QAAM,IAAI,GAAG,GAAG;AAChB,MAAI,CAAC,GAAG,eAAe,CAAC,WAAW,GAAG,YAAY,IAAI,OAAO,GAAG,CAAE;EAClE,IAAI,MAAM;AACV,MAAI;AACF,SAAM,SAAS,WAAW,QAAQ,GAAG,GAAG,CAAC,CAAC;UACpC;AACN;;AAEF,MAAI,MAAM,OAAQ;AAClB,UAAQ,GAAG,IAAI,GAAG,aAAa,GAAG;;AAGpC,KAAI,WAAW,KAAK,CAClB,MAAK,MAAM,OAAO,YAAY,MAAM,EAAE,eAAe,MAAM,CAAC,EAAE;AAC5D,MAAI,CAAC,IAAI,aAAa,IAAI,MAAM,IAAI,IAAI,KAAK,IAAI,WAAW,WAAW,QAAQ,IAAI,KAAK,CAAC,CAAE;EAC3F,MAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAChC,MAAI;AACF,OAAI,SAAS,IAAI,CAAC,UAAU,OAAQ;UAC9B;AACN;;AAEF,UAAQ,IAAI,MAAM,KAAK,KAAK;;AAGhC,KAAI,CAAC,OACH,MAAK,MAAM,QAAQ,IAAI,IAAI,aAAa,OAAO,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE;AAClE,MAAI;AACF,OAAI,MAAM,CAAC,YAAY,QAAQ,CAAC;UAC1B;AAGR,yBAAuB,QAAQ,KAAK;;AAGxC,QAAO;;;AAIT,SAAgB,qBAAqB,QAAgB,WAAW,IAAI,MAAM,KAAK,KAAK,EAAoB;CACtG,MAAM,QAAQ,KAAK,QAAQ,SAAS;AACpC,KAAI;AACF,MAAI,MAAM,SAAS,MAAM,CAAC,UAAU,WAAW,IAAQ,QAAO;SACxD;AAGR,WAAU,QAAQ,EAAE,WAAW,MAAM,CAAC;AACtC,eAAc,OAAO,OAAO,IAAI,EAAE,OAAO;AACzC,QAAO,YAAY,QAAQ,IAAI,OAAO,IAAI"}

package/dist/{zettelkasten-BRIaHzFm.mjs → zettelkasten-DSIe6wpF.mjs}

@@ -1,5 +1,6 @@
-import { t as STOP_WORDS$1 } from "./stop-words-DtxaTWU_.mjs";
-import { i as generateEmbedding, n as cosineSimilarity, r as deserializeEmbedding } from "./embeddings-DMVzpvRZ.mjs";
+import { t as STOP_WORDS$1 } from "./stop-words-LtkS-Pej.mjs";
+import { a as requireQueryEmbedding } from "./embedding-gate-DqbKvn56.mjs";
+import { i as deserializeEmbedding, r as cosineSimilarity } from "./embeddings-BUjZMD9F.mjs";
 import { basename, dirname } from "node:path";
 
 //#region src/zettelkasten/explore.ts
@@ -209,7 +210,7 @@ async function zettelSurprise(backend, opts) {
 	const minSimilarity = opts.minSimilarity ?? .3;
 	const minGraphDistance = opts.minGraphDistance ?? 3;
 	let { embedding: refEmbedding, found } = await getReferenceEmbedding(backend, opts.vaultProjectId, opts.referencePath);
-	if (!found) refEmbedding = await generateEmbedding((await backend.getVaultFilesByPaths([opts.referencePath]))[0]?.title ?? opts.referencePath, true);
+	if (!found) refEmbedding = await requireQueryEmbedding(backend, (await backend.getVaultFilesByPaths([opts.referencePath]))[0]?.title ?? opts.referencePath);
 	const allFileEmbeddings = await getFileEmbeddings(backend, opts.vaultProjectId);
 	allFileEmbeddings.delete(opts.referencePath);
 	const semanticCandidates = [];
@@ -319,7 +320,7 @@ async function zettelConverse(backend, opts) {
 	const depth = Math.max(opts.depth ?? 2, 0);
 	const limit = Math.max(opts.limit ?? 15, 1);
 	const candidateLimit = 20;
-	const queryEmbedding = await generateEmbedding(opts.question, true);
+	const queryEmbedding = await requireQueryEmbedding(backend, opts.question);
 	const searchResults = await hybridSearch(backend, opts.question, queryEmbedding, {
 		projectIds: [opts.vaultProjectId],
 		maxResults: candidateLimit
@@ -1202,4 +1203,4 @@ async function zettelCommunities(backend, opts) {
 
 //#endregion
 export { zettelThemes as a, zettelExplore as c, zettelHealth as i, zettelGodNotes as n, zettelConverse as o, zettelSuggest as r, zettelSurprise as s, zettelCommunities as t };
-//# sourceMappingURL=zettelkasten-BRIaHzFm.mjs.map
+//# sourceMappingURL=zettelkasten-DSIe6wpF.mjs.map

package/dist/zettelkasten-DSIe6wpF.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"zettelkasten-DSIe6wpF.mjs","names":["MAX_CHUNKS","MAX_CHUNKS","getTopFolder","STOP_WORDS"],"sources":["../src/zettelkasten/explore.ts","../src/zettelkasten/surprise.ts","../src/zettelkasten/converse.ts","../src/zettelkasten/themes.ts","../src/zettelkasten/health.ts","../src/zettelkasten/suggest.ts","../src/zettelkasten/god-notes.ts","../src/zettelkasten/communities.ts"],"sourcesContent":["import type { StorageBackend } from \"../storage/interface.js\";\nimport { dirname } from \"node:path\";\n\nexport interface ExploreOptions {\n  startNote: string;\n  depth?: number;\n  direction?: \"forward\" | \"backward\" | \"both\";\n  mode?: \"sequential\" | \"associative\" | \"all\";\n}\n\nexport interface ExploreNode {\n  path: string;\n  title: string | null;\n  depth: number;\n  linkType: \"sequential\" | \"associative\";\n  inbound: number;\n  outbound: number;\n}\n\nexport interface ExploreResult {\n  root: string;\n  nodes: ExploreNode[];\n  edges: Array<{ from: string; to: string; type: \"sequential\" | \"associative\" }>;\n  branchingPoints: string[];\n  maxDepthReached: boolean;\n}\n\nfunction classifyEdge(source: string, target: string): \"sequential\" | \"associative\" {\n  return dirname(source) === dirname(target) ? \"sequential\" : \"associative\";\n}\n\nasync function resolveStart(backend: StorageBackend, startNote: string): Promise<string | null> {\n  // Try direct lookup first\n  const files = await backend.getVaultFilesByPaths([startNote]);\n  if (files.length > 0) return files[0].vaultPath;\n\n  // Try alias lookup\n  const alias = await backend.getVaultAlias(startNote);\n  if (!alias) return null;\n\n  const canonical = await backend.getVaultFilesByPaths([alias.canonicalPath]);\n  return canonical.length > 0 ? canonical[0].vaultPath : null;\n}\n\nasync function getForwardNeighbors(backend: StorageBackend, path: string): Promise<string[]> {\n  const links = await backend.getLinksFromSource(path);\n  return links.filter(l => l.targetPath !== null).map(l => l.targetPath as string);\n}\n\nasync function getBackwardNeighbors(backend: StorageBackend, path: string): Promise<string[]> {\n  const links = await backend.getLinksToTarget(path);\n  return links.map(l => l.sourcePath);\n}\n\nasync function getFileInfo(\n  backend: StorageBackend,\n  path: string,\n): Promise<{ title: string | null; inbound: number; outbound: number }> {\n  const [files, health] = await Promise.all([\n    backend.getVaultFilesByPaths([path]),\n    backend.getVaultHealth(path),\n  ]);\n\n  return {\n    title: files[0]?.title ?? null,\n    inbound: health?.inboundCount ?? 0,\n    outbound: health?.outboundCount ?? 0,\n  };\n}\n\n/**\n * Traverse the Zettelkasten link graph using BFS, following chains of thought\n * from a starting note up to a configurable depth.\n */\nexport async function zettelExplore(backend: StorageBackend, opts: ExploreOptions): Promise<ExploreResult> {\n  const depth = Math.min(Math.max(opts.depth ?? 3, 1), 10);\n  const direction = opts.direction ?? \"both\";\n  const mode = opts.mode ?? \"all\";\n\n  const root = await resolveStart(backend, opts.startNote);\n  if (!root) {\n    return {\n      root: opts.startNote,\n      nodes: [],\n      edges: [],\n      branchingPoints: [],\n      maxDepthReached: false,\n    };\n  }\n\n  const visited = new Set<string>([root]);\n  const nodes: ExploreNode[] = [];\n  const edges: Array<{ from: string; to: string; type: \"sequential\" | \"associative\" }> = [];\n  let maxDepthReached = false;\n\n  const queue: Array<{ path: string; depth: number }> = [{ path: root, depth: 0 }];\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n\n    if (current.depth >= depth) {\n      maxDepthReached = true;\n      continue;\n    }\n\n    const neighbors: Array<{ neighbor: string; from: string; to: string }> = [];\n\n    if (direction === \"forward\" || direction === \"both\") {\n      for (const n of await getForwardNeighbors(backend, current.path)) {\n        neighbors.push({ neighbor: n, from: current.path, to: n });\n      }\n    }\n\n    if (direction === \"backward\" || direction === \"both\") {\n      for (const n of await getBackwardNeighbors(backend, current.path)) {\n        neighbors.push({ neighbor: n, from: n, to: current.path });\n      }\n    }\n\n    for (const { neighbor, from, to } of neighbors) {\n      const edgeType = classifyEdge(from, to);\n\n      if (mode !== \"all\" && edgeType !== mode) {\n        continue;\n      }\n\n      const alreadyHasEdge = edges.some((e) => e.from === from && e.to === to);\n      if (!alreadyHasEdge) {\n        edges.push({ from, to, type: edgeType });\n      }\n\n      if (!visited.has(neighbor)) {\n        visited.add(neighbor);\n\n        const info = await getFileInfo(backend, neighbor);\n        nodes.push({\n          path: neighbor,\n          title: info.title,\n          depth: current.depth + 1,\n          linkType: edgeType,\n          inbound: info.inbound,\n          outbound: info.outbound,\n        });\n\n        queue.push({ path: neighbor, depth: current.depth + 1 });\n      }\n    }\n  }\n\n  const branchingPoints = nodes\n    .filter((n) => n.outbound > 2)\n    .map((n) => n.path);\n\n  const rootInfo = await getFileInfo(backend, root);\n  if (rootInfo.outbound > 2) {\n    branchingPoints.unshift(root);\n  }\n\n  return { root, nodes, edges, branchingPoints, maxDepthReached };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport {\n  deserializeEmbedding,\n  cosineSimilarity,\n} from \"../memory/embeddings.js\";\nimport { requireQueryEmbedding } from \"../memory/embedding-gate.js\";\n\nexport interface SurpriseOptions {\n  referencePath: string;\n  vaultProjectId: number;\n  limit?: number;\n  minSimilarity?: number;\n  minGraphDistance?: number;\n}\n\nexport interface SurpriseResult {\n  path: string;\n  title: string | null;\n  cosineSimilarity: number;\n  graphDistance: number;\n  surpriseScore: number;\n  sharedSnippet: string;\n}\n\nconst MAX_CHUNKS = 5000;\nconst BFS_HOP_CAP = 20;\n\nasync function getFileEmbeddings(\n  backend: StorageBackend,\n  projectId: number,\n): Promise<Map<string, { embedding: Float32Array; text: string }>> {\n  const rows = await backend.getChunksWithEmbeddings(projectId, MAX_CHUNKS);\n\n  const byPath = new Map<string, { sum: Float32Array; count: number; text: string }>();\n  for (const row of rows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const entry = byPath.get(row.path);\n    if (!entry) {\n      byPath.set(row.path, { sum: new Float32Array(vec), count: 1, text: row.text });\n    } else {\n      for (let i = 0; i < vec.length; i++) {\n        entry.sum[i] += vec[i];\n      }\n      entry.count++;\n    }\n  }\n\n  const result = new Map<string, { embedding: Float32Array; text: string }>();\n  for (const [path, { sum, count, text }] of byPath) {\n    const avg = new Float32Array(sum.length);\n    for (let i = 0; i < sum.length; i++) {\n      avg[i] = sum[i] / count;\n    }\n    result.set(path, { embedding: avg, text });\n  }\n  return result;\n}\n\nasync function getReferenceEmbedding(\n  backend: StorageBackend,\n  projectId: number,\n  path: string,\n): Promise<{ embedding: Float32Array; found: boolean }> {\n  const rows = await backend.getChunksForPath(projectId, path);\n\n  if (rows.length === 0) {\n    return { embedding: new Float32Array(0), found: false };\n  }\n\n  const embRows = rows.filter(r => r.embedding !== null) as Array<{ text: string; embedding: Buffer }>;\n  if (embRows.length === 0) {\n    return { embedding: new Float32Array(0), found: false };\n  }\n\n  const dim = deserializeEmbedding(embRows[0].embedding).length;\n  const sum = new Float32Array(dim);\n  for (const row of embRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    for (let i = 0; i < dim; i++) {\n      sum[i] += vec[i];\n    }\n  }\n  const avg = new Float32Array(dim);\n  for (let i = 0; i < dim; i++) {\n    avg[i] = sum[i] / embRows.length;\n  }\n  return { embedding: avg, found: true };\n}\n\nasync function bfsGraphDistance(backend: StorageBackend, source: string, target: string): Promise<number> {\n  if (source === target) return 0;\n\n  const visited = new Set<string>([source]);\n  const queue: Array<{ path: string; hops: number }> = [{ path: source, hops: 0 }];\n\n  while (queue.length > 0) {\n    const { path, hops } = queue.shift()!;\n    if (hops >= BFS_HOP_CAP) continue;\n\n    const [forwardLinks, backwardLinks] = await Promise.all([\n      backend.getLinksFromSource(path),\n      backend.getLinksToTarget(path),\n    ]);\n\n    const neighbors: string[] = [\n      ...forwardLinks.filter(l => l.targetPath !== null).map(l => l.targetPath as string),\n      ...backwardLinks.map(l => l.sourcePath),\n    ];\n\n    for (const neighbor of neighbors) {\n      if (neighbor === target) return hops + 1;\n      if (!visited.has(neighbor)) {\n        visited.add(neighbor);\n        queue.push({ path: neighbor, hops: hops + 1 });\n      }\n    }\n  }\n\n  return Infinity;\n}\n\nfunction getBestChunkText(\n  chunkRows: Array<{ text: string; embedding: Buffer | null }>,\n  refEmbedding: Float32Array,\n): string {\n  const rows = chunkRows.filter(r => r.embedding !== null) as Array<{ text: string; embedding: Buffer }>;\n  if (rows.length === 0) return \"\";\n\n  let bestText = rows[0].text;\n  let bestSim = -Infinity;\n\n  for (const row of rows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const sim = cosineSimilarity(refEmbedding, vec);\n    if (sim > bestSim) {\n      bestSim = sim;\n      bestText = row.text;\n    }\n  }\n\n  return bestText.trim().slice(0, 200);\n}\n\n/**\n * Find notes that are semantically similar to a reference note but graph-distant —\n * revealing surprising conceptual connections across unrelated areas of the Zettelkasten.\n */\nexport async function zettelSurprise(\n  backend: StorageBackend,\n  opts: SurpriseOptions,\n): Promise<SurpriseResult[]> {\n  const limit = opts.limit ?? 10;\n  const minSimilarity = opts.minSimilarity ?? 0.3;\n  const minGraphDistance = opts.minGraphDistance ?? 3;\n\n  let { embedding: refEmbedding, found } = await getReferenceEmbedding(\n    backend,\n    opts.vaultProjectId,\n    opts.referencePath,\n  );\n\n  // Fall back to generating an embedding from the file title if no chunks exist\n  if (!found) {\n    const files = await backend.getVaultFilesByPaths([opts.referencePath]);\n    const text = files[0]?.title ?? opts.referencePath;\n    refEmbedding = await requireQueryEmbedding(backend, text);\n  }\n\n  const allFileEmbeddings = await getFileEmbeddings(backend, opts.vaultProjectId);\n\n  // Remove the reference note itself from candidates\n  allFileEmbeddings.delete(opts.referencePath);\n\n  // First pass: filter by semantic similarity to avoid BFS on all nodes\n  const semanticCandidates: Array<{ path: string; sim: number }> = [];\n  for (const [path, { embedding }] of allFileEmbeddings) {\n    const sim = cosineSimilarity(refEmbedding, embedding);\n    if (sim >= minSimilarity) {\n      semanticCandidates.push({ path, sim });\n    }\n  }\n\n  // Compute graph distances for semantic candidates\n  const results: SurpriseResult[] = [];\n\n  for (const { path, sim } of semanticCandidates) {\n    const graphDistance = await bfsGraphDistance(backend, opts.referencePath, path);\n\n    const effectiveDistance = isFinite(graphDistance) ? graphDistance : BFS_HOP_CAP;\n    if (effectiveDistance < minGraphDistance) continue;\n\n    const files = await backend.getVaultFilesByPaths([path]);\n    const chunkRows = await backend.getChunksForPath(opts.vaultProjectId, path, 20);\n\n    const surpriseScore = sim * Math.log2(effectiveDistance + 1);\n    const sharedSnippet = getBestChunkText(chunkRows, refEmbedding);\n\n    results.push({\n      path,\n      title: files[0]?.title ?? null,\n      cosineSimilarity: sim,\n      graphDistance: isFinite(graphDistance) ? graphDistance : Infinity,\n      surpriseScore,\n      sharedSnippet,\n    });\n  }\n\n  results.sort((a, b) => b.surpriseScore - a.surpriseScore);\n  return results.slice(0, limit);\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport type { SearchResult } from \"../memory/search.js\";\nimport { requireQueryEmbedding } from \"../memory/embedding-gate.js\";\n\nexport interface ConverseOptions {\n  /** The user's question or topic to explore. */\n  question: string;\n  /** project_id for vault chunks in memory_chunks. */\n  vaultProjectId: number;\n  /** Graph expansion depth. Default 2. */\n  depth?: number;\n  /** Maximum number of relevant notes to return. Default 15. */\n  limit?: number;\n}\n\nexport interface ConverseConnection {\n  fromPath: string;\n  toPath: string;\n  /** Top-level folder of fromPath. */\n  fromDomain: string;\n  /** Top-level folder of toPath. */\n  toDomain: string;\n  /** Link count between these two notes (can be > 1). */\n  strength: number;\n}\n\nexport interface ConverseResult {\n  relevantNotes: Array<{\n    path: string;\n    title: string | null;\n    snippet: string;\n    score: number;\n    domain: string;\n  }>;\n  /** Cross-domain connections found among the selected notes. */\n  connections: ConverseConnection[];\n  /** Unique domains involved across all selected notes. */\n  domains: string[];\n  /** AI-ready prompt combining notes + connections for insight generation. */\n  synthesisPrompt: string;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\n/** Extract the top-level folder from a vault path (first path segment). */\nfunction extractDomain(vaultPath: string): string {\n  const slash = vaultPath.indexOf(\"/\");\n  return slash === -1 ? vaultPath : vaultPath.slice(0, slash);\n}\n\n/**\n * Expand one level of graph neighbors for a set of paths.\n * Returns all outbound and inbound neighbor paths (excluding already-visited).\n */\nasync function expandNeighbors(backend: StorageBackend, paths: Set<string>): Promise<string[]> {\n  if (paths.size === 0) return [];\n  const pathList = Array.from(paths);\n\n  const [forwardLinks, backwardLinks] = await Promise.all([\n    backend.getVaultLinksFromPaths(pathList),\n    Promise.all(pathList.map(p => backend.getLinksToTarget(p))),\n  ]);\n\n  const neighbors: string[] = [];\n  for (const link of forwardLinks) {\n    if (link.targetPath) neighbors.push(link.targetPath);\n  }\n  for (const linkList of backwardLinks) {\n    for (const link of linkList) {\n      neighbors.push(link.sourcePath);\n    }\n  }\n  return neighbors;\n}\n\n/**\n * Hybrid search combining keyword + semantic results using the StorageBackend.\n */\nasync function hybridSearch(\n  backend: StorageBackend,\n  query: string,\n  queryEmbedding: Float32Array,\n  opts: { projectIds?: number[]; maxResults?: number },\n): Promise<SearchResult[]> {\n  const maxResults = opts.maxResults ?? 10;\n  const kw = 0.5;\n  const sw = 0.5;\n\n  const [keywordResults, semanticResults] = await Promise.all([\n    backend.searchKeyword(query, { ...opts, maxResults: 50 }),\n    backend.searchSemantic(queryEmbedding, { ...opts, maxResults: 50 }),\n  ]);\n\n  if (keywordResults.length === 0 && semanticResults.length === 0) return [];\n\n  const keyFor = (r: SearchResult) =>\n    `${r.projectId}:${r.path}:${r.startLine}:${r.endLine}`;\n\n  function minMaxNormalize(scores: number[]): number[] {\n    const min = Math.min(...scores);\n    const max = Math.max(...scores);\n    const range = max - min;\n    if (range === 0) return scores.map(() => 1.0);\n    return scores.map(s => (s - min) / range);\n  }\n\n  const kwNorm = minMaxNormalize(keywordResults.map(r => r.score));\n  const semNorm = minMaxNormalize(semanticResults.map(r => r.score));\n\n  const combined = new Map<string, SearchResult & { combinedScore: number }>();\n\n  for (let i = 0; i < keywordResults.length; i++) {\n    const r = keywordResults[i];\n    const k = keyFor(r);\n    combined.set(k, { ...r, combinedScore: kw * kwNorm[i] });\n  }\n\n  for (let i = 0; i < semanticResults.length; i++) {\n    const r = semanticResults[i];\n    const k = keyFor(r);\n    const existing = combined.get(k);\n    if (existing) {\n      existing.combinedScore += sw * semNorm[i];\n    } else {\n      combined.set(k, { ...r, combinedScore: sw * semNorm[i] });\n    }\n  }\n\n  const sorted = Array.from(combined.values())\n    .sort((a, b) => b.combinedScore - a.combinedScore)\n    .slice(0, maxResults);\n\n  return sorted.map(r => ({ ...r, score: r.combinedScore }));\n}\n\n// ---------------------------------------------------------------------------\n// Main export\n// ---------------------------------------------------------------------------\n\n/**\n * Let the vault \"talk back\" — find notes relevant to a question, expand\n * through the link graph, identify cross-domain connections, and return a\n * structured result including a synthesis prompt for an AI to generate insights.\n */\nexport async function zettelConverse(\n  backend: StorageBackend,\n  opts: ConverseOptions,\n): Promise<ConverseResult> {\n  const depth = Math.max(opts.depth ?? 2, 0);\n  const limit = Math.max(opts.limit ?? 15, 1);\n  const candidateLimit = 20;\n\n  // ------------------------------------------------------------------\n  // 1. Hybrid search: find top candidates via BM25 + semantic similarity\n  // ------------------------------------------------------------------\n  const queryEmbedding = await requireQueryEmbedding(backend, opts.question);\n\n  const searchResults = await hybridSearch(\n    backend,\n    opts.question,\n    queryEmbedding,\n    {\n      projectIds: [opts.vaultProjectId],\n      maxResults: candidateLimit,\n    },\n  );\n\n  // Map of path -> best score + snippet from search results\n  const searchHits = new Map<string, { score: number; snippet: string }>();\n  for (const r of searchResults) {\n    const existing = searchHits.get(r.path);\n    if (!existing || r.score > existing.score) {\n      searchHits.set(r.path, { score: r.score, snippet: r.snippet });\n    }\n  }\n\n  // ------------------------------------------------------------------\n  // 2. Graph expansion: BFS from each search result up to `depth` levels\n  // ------------------------------------------------------------------\n  const allPaths = new Set<string>(searchHits.keys());\n  let frontier = new Set<string>(searchHits.keys());\n\n  for (let d = 0; d < depth; d++) {\n    const neighbors = await expandNeighbors(backend, frontier);\n    const newFrontier = new Set<string>();\n    for (const n of neighbors) {\n      if (!allPaths.has(n)) {\n        allPaths.add(n);\n        newFrontier.add(n);\n      }\n    }\n    if (newFrontier.size === 0) break;\n    frontier = newFrontier;\n  }\n\n  // ------------------------------------------------------------------\n  // 3. Deduplicate + trim to limit\n  // ------------------------------------------------------------------\n  const searchRanked = Array.from(searchHits.entries())\n    .sort((a, b) => b[1].score - a[1].score)\n    .map(([path, info]) => ({ path, ...info, isSearchResult: true }));\n\n  const neighborPaths = Array.from(allPaths).filter((p) => !searchHits.has(p));\n\n  // Fetch health data for neighbor ranking\n  const neighborHealthRows = await Promise.all(\n    neighborPaths.map(p => backend.getVaultHealth(p))\n  );\n  const neighborRanked = neighborPaths\n    .map((path, idx) => ({\n      path,\n      score: 0,\n      snippet: \"\",\n      inbound: neighborHealthRows[idx]?.inboundCount ?? 0,\n      isSearchResult: false,\n    }))\n    .sort((a, b) => b.inbound - a.inbound);\n\n  const budgetForNeighbors = Math.max(limit - searchRanked.length, 0);\n  const selectedNeighbors = neighborRanked.slice(0, budgetForNeighbors);\n\n  const selectedSearchPaths = searchRanked.slice(0, limit);\n  const selectedPaths = new Set<string>([\n    ...selectedSearchPaths.map((r) => r.path),\n    ...selectedNeighbors.map((r) => r.path),\n  ]);\n\n  // ------------------------------------------------------------------\n  // 4. Build relevantNotes with titles + domains\n  // ------------------------------------------------------------------\n\n  // Fetch titles in bulk\n  const allSelectedPaths = Array.from(selectedPaths);\n  const fileRows = await backend.getVaultFilesByPaths(allSelectedPaths);\n  const titleMap = new Map<string, string | null>(fileRows.map(f => [f.vaultPath, f.title]));\n\n  const relevantNotes: ConverseResult[\"relevantNotes\"] = [];\n\n  for (const r of selectedSearchPaths) {\n    if (!selectedPaths.has(r.path)) continue;\n    relevantNotes.push({\n      path: r.path,\n      title: titleMap.get(r.path) ?? null,\n      snippet: r.snippet,\n      score: r.score,\n      domain: extractDomain(r.path),\n    });\n  }\n\n  for (const r of selectedNeighbors) {\n    relevantNotes.push({\n      path: r.path,\n      title: titleMap.get(r.path) ?? null,\n      snippet: r.snippet,\n      score: 0,\n      domain: extractDomain(r.path),\n    });\n  }\n\n  // ------------------------------------------------------------------\n  // 5. Find connections between the selected notes\n  // ------------------------------------------------------------------\n  let connections: ConverseConnection[] = [];\n\n  if (selectedPaths.size > 0) {\n    const pathList = Array.from(selectedPaths);\n    const pathSet = new Set(pathList);\n\n    // Get all outbound links from the selected paths\n    const linkRows = await backend.getVaultLinksFromPaths(pathList);\n\n    // Count links between selected paths\n    const edgeCounts = new Map<string, number>();\n    for (const link of linkRows) {\n      if (link.targetPath && pathSet.has(link.targetPath)) {\n        const key = `${link.sourcePath}|||${link.targetPath}`;\n        edgeCounts.set(key, (edgeCounts.get(key) ?? 0) + 1);\n      }\n    }\n\n    for (const [key, cnt] of edgeCounts) {\n      const [sourcePath, targetPath] = key.split(\"|||\");\n      connections.push({\n        fromPath: sourcePath,\n        toPath: targetPath,\n        fromDomain: extractDomain(sourcePath),\n        toDomain: extractDomain(targetPath),\n        strength: cnt,\n      });\n    }\n  }\n\n  // ------------------------------------------------------------------\n  // 6. Domains + cross-domain filter\n  // ------------------------------------------------------------------\n  const domainSet = new Set<string>(relevantNotes.map((n) => n.domain));\n  const domains = Array.from(domainSet).sort();\n\n  const crossDomainConnections = connections.filter(\n    (c) => c.fromDomain !== c.toDomain,\n  );\n\n  // ------------------------------------------------------------------\n  // 7. Build synthesis prompt\n  // ------------------------------------------------------------------\n  const notesSummary = relevantNotes\n    .map((n, i) => {\n      const title = n.title ? `\"${n.title}\"` : \"(untitled)\";\n      const domain = n.domain;\n      const scoreLabel = n.score > 0 ? ` [relevance: ${n.score.toFixed(3)}]` : \" [context]\";\n      const snippet = n.snippet.trim().slice(0, 300);\n      return `${i + 1}. [${domain}] ${title}${scoreLabel}\\n   Path: ${n.path}\\n   \"${snippet}\"`;\n    })\n    .join(\"\\n\\n\");\n\n  const connectionSummary =\n    crossDomainConnections.length > 0\n      ? crossDomainConnections\n          .map(\n            (c) =>\n              `- \"${c.fromPath}\" (${c.fromDomain}) → \"${c.toPath}\" (${c.toDomain}) [strength: ${c.strength}]`,\n          )\n          .join(\"\\n\")\n      : \"(no cross-domain connections found)\";\n\n  const domainList = domains.join(\", \");\n\n  const synthesisPrompt = `You are a Zettelkasten research assistant. The vault has surfaced the following notes in response to this question:\n\nQUESTION: ${opts.question}\n\n---\n\nRELEVANT NOTES (${relevantNotes.length} notes across ${domains.length} domain(s): ${domainList}):\n\n${notesSummary}\n\n---\n\nCROSS-DOMAIN CONNECTIONS (links bridging different knowledge areas):\n\n${connectionSummary}\n\n---\n\nSYNTHESIS TASK:\n\nBased on these notes and the connections between them, please:\n\n1. Identify the key insights that emerge in direct response to the question.\n2. Highlight any unexpected connections between notes from different domains (${domainList}).\n3. Point out tensions, contradictions, or open questions the vault raises but does not resolve.\n4. Suggest what is notably absent — what the vault does NOT yet contain that would strengthen the understanding of this topic.\n5. Propose 2-3 new notes that would meaningfully extend this knowledge cluster.\n\nThink like a scholar who has deeply internalized these ideas and is now synthesizing them for the first time.`;\n\n  return {\n    relevantNotes,\n    connections: crossDomainConnections,\n    domains,\n    synthesisPrompt,\n  };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport { deserializeEmbedding, cosineSimilarity } from \"../memory/embeddings.js\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\nexport interface ThemeOptions {\n  vaultProjectId: number;\n  lookbackDays?: number;\n  minClusterSize?: number;\n  maxThemes?: number;\n  similarityThreshold?: number;\n}\n\nexport interface ThemeCluster {\n  id: number;\n  label: string;\n  notes: Array<{\n    path: string;\n    title: string | null;\n  }>;\n  size: number;\n  folderDiversity: number;\n  avgRecency: number;\n  linkedRatio: number;\n  suggestIndexNote: boolean;\n}\n\nexport interface ThemeResult {\n  themes: ThemeCluster[];\n  totalNotesAnalyzed: number;\n  timeWindow: { from: number; to: number };\n}\n\nconst MAX_CHUNKS = 5000;\n\n// STOP_WORDS imported from utils/stop-words.ts\n\nfunction getTopFolder(vaultPath: string): string {\n  const parts = vaultPath.split(\"/\");\n  return parts.length > 1 ? parts[0] : \"\";\n}\n\nfunction generateLabel(titles: Array<string | null>): string {\n  const wordCounts = new Map<string, number>();\n  for (const title of titles) {\n    if (!title) continue;\n    const words = title\n      .toLowerCase()\n      .replace(/[^a-z0-9\\s]/g, \" \")\n      .split(/\\s+/)\n      .filter((w) => w.length > 2 && !STOP_WORDS.has(w));\n    for (const word of words) {\n      wordCounts.set(word, (wordCounts.get(word) ?? 0) + 1);\n    }\n  }\n  const sorted = [...wordCounts.entries()].sort((a, b) => b[1] - a[1]);\n  return sorted\n    .slice(0, 3)\n    .map(([w]) => w)\n    .join(\" / \");\n}\n\nasync function computeLinkedRatio(backend: StorageBackend, paths: string[]): Promise<number> {\n  if (paths.length < 2) return 0;\n  const totalPairs = (paths.length * (paths.length - 1)) / 2;\n  const pathSet = new Set(paths);\n  let linkedPairs = 0;\n\n  for (const path of paths) {\n    const links = await backend.getLinksFromSource(path);\n    for (const link of links) {\n      if (link.targetPath && pathSet.has(link.targetPath)) {\n        linkedPairs++;\n      }\n    }\n  }\n\n  // Each bidirectional pair might be counted once per direction; divide by 2 to normalize\n  const uniquePairs = linkedPairs / 2;\n  return Math.min(1, uniquePairs / totalPairs);\n}\n\ntype ClusterNode = {\n  paths: string[];\n  titles: Array<string | null>;\n  indexedAts: number[];\n  centroid: Float32Array;\n};\n\nfunction averageEmbeddings(embeddings: Float32Array[]): Float32Array {\n  if (embeddings.length === 0) return new Float32Array(0);\n  const dim = embeddings[0].length;\n  const sum = new Float32Array(dim);\n  for (const vec of embeddings) {\n    for (let i = 0; i < dim; i++) {\n      sum[i] += vec[i];\n    }\n  }\n  const avg = new Float32Array(dim);\n  for (let i = 0; i < dim; i++) {\n    avg[i] = sum[i] / embeddings.length;\n  }\n  return avg;\n}\n\n/**\n * Detect emerging themes in recently-modified notes using agglomerative single-linkage\n * clustering of note-level embeddings.\n */\nexport async function zettelThemes(\n  backend: StorageBackend,\n  opts: ThemeOptions,\n): Promise<ThemeResult> {\n  const lookbackDays = opts.lookbackDays ?? 30;\n  const minClusterSize = opts.minClusterSize ?? 3;\n  const maxThemes = opts.maxThemes ?? 10;\n  const similarityThreshold = opts.similarityThreshold ?? 0.65;\n\n  const now = Date.now();\n  const from = now - lookbackDays * 86400000;\n\n  // Step 1: get recent notes\n  const recentFiles = await backend.getRecentVaultFiles(from);\n  const recentNotes = recentFiles.map(f => ({ vault_path: f.vaultPath, title: f.title, indexed_at: f.indexedAt }));\n\n  // Step 2: get file-level embeddings from memory_chunks\n  const chunkRows = await backend.getChunksWithEmbeddings(opts.vaultProjectId, MAX_CHUNKS);\n\n  const embeddingsByPath = new Map<string, Float32Array[]>();\n  for (const row of chunkRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const arr = embeddingsByPath.get(row.path);\n    if (!arr) {\n      embeddingsByPath.set(row.path, [vec]);\n    } else {\n      arr.push(vec);\n    }\n  }\n\n  const fileEmbeddings = new Map<string, Float32Array>();\n  for (const [path, vecs] of embeddingsByPath) {\n    fileEmbeddings.set(path, averageEmbeddings(vecs));\n  }\n\n  // Step 3: build initial clusters — only include notes that have embeddings\n  const clusters: ClusterNode[] = [];\n  for (const note of recentNotes) {\n    const embedding = fileEmbeddings.get(note.vault_path);\n    if (!embedding) continue;\n    clusters.push({\n      paths: [note.vault_path],\n      titles: [note.title],\n      indexedAts: [note.indexed_at],\n      centroid: embedding,\n    });\n  }\n\n  const totalNotesAnalyzed = clusters.length;\n\n  // Step 4: agglomerative single-linkage clustering\n  // Stop when no two clusters have similarity >= threshold\n  let merged = true;\n  while (merged && clusters.length > 1) {\n    merged = false;\n    let bestSim = similarityThreshold;\n    let bestI = -1;\n    let bestJ = -1;\n\n    for (let i = 0; i < clusters.length; i++) {\n      for (let j = i + 1; j < clusters.length; j++) {\n        const sim = cosineSimilarity(clusters[i].centroid, clusters[j].centroid);\n        if (sim > bestSim) {\n          bestSim = sim;\n          bestI = i;\n          bestJ = j;\n        }\n      }\n    }\n\n    if (bestI === -1) break;\n\n    // Merge cluster j into cluster i\n    const ci = clusters[bestI];\n    const cj = clusters[bestJ];\n    const mergedPaths = [...ci.paths, ...cj.paths];\n    const mergedTitles = [...ci.titles, ...cj.titles];\n    const mergedIndexedAts = [...ci.indexedAts, ...cj.indexedAts];\n\n    // Recompute centroid from averaged embeddings of all member paths\n    const memberEmbeddings: Float32Array[] = [];\n    for (const p of mergedPaths) {\n      const emb = fileEmbeddings.get(p);\n      if (emb) memberEmbeddings.push(emb);\n    }\n\n    clusters[bestI] = {\n      paths: mergedPaths,\n      titles: mergedTitles,\n      indexedAts: mergedIndexedAts,\n      centroid: averageEmbeddings(memberEmbeddings),\n    };\n\n    clusters.splice(bestJ, 1);\n    merged = true;\n  }\n\n  // Step 5: filter and annotate clusters\n  const themes: ThemeCluster[] = [];\n  let clusterIndex = 0;\n\n  for (const cluster of clusters) {\n    if (cluster.paths.length < minClusterSize) continue;\n\n    const label = generateLabel(cluster.titles) || `Theme ${clusterIndex + 1}`;\n    const avgRecency =\n      cluster.indexedAts.reduce((sum, t) => sum + t, 0) / cluster.indexedAts.length;\n\n    const uniqueFolders = new Set(cluster.paths.map(getTopFolder));\n    const folderDiversity = uniqueFolders.size / cluster.paths.length;\n\n    const linkedRatio = await computeLinkedRatio(backend, cluster.paths);\n    const suggestIndexNote = linkedRatio < 0.3 && cluster.paths.length >= 5;\n\n    themes.push({\n      id: clusterIndex++,\n      label,\n      notes: cluster.paths.map((path, idx) => ({\n        path,\n        title: cluster.titles[idx],\n      })),\n      size: cluster.paths.length,\n      folderDiversity,\n      avgRecency,\n      linkedRatio,\n      suggestIndexNote,\n    });\n  }\n\n  // Step 6: rank by size * folderDiversity * recency_ratio\n  themes.sort(\n    (a, b) =>\n      b.size * b.folderDiversity * (b.avgRecency / now) -\n      a.size * a.folderDiversity * (a.avgRecency / now),\n  );\n\n  return {\n    themes: themes.slice(0, maxThemes),\n    totalNotesAnalyzed,\n    timeWindow: { from, to: now },\n  };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\n\nexport interface HealthOptions {\n  scope?: \"full\" | \"recent\" | \"project\";\n  projectPath?: string;\n  recentDays?: number;\n  include?: Array<\"dead_links\" | \"orphans\" | \"disconnected\" | \"low_connectivity\">;\n}\n\nexport interface DeadLink {\n  sourcePath: string;\n  targetRaw: string;\n  lineNumber: number;\n}\n\nexport interface HealthResult {\n  totalFiles: number;\n  totalLinks: number;\n  deadLinks: DeadLink[];\n  orphans: string[];\n  disconnectedClusters: number;\n  lowConnectivity: string[];\n  healthScore: number;\n  computedAt: number;\n  /** Breakdown of links by confidence level (if confidence tagging is active). */\n  linkConfidence?: {\n    extracted: number;\n    inferred: number;\n    ambiguous: number;\n  };\n}\n\nfunction countComponents(nodes: string[], edges: Array<{ source: string; target: string }>): number {\n  if (nodes.length === 0) return 0;\n\n  const parent = new Map<string, string>();\n  const rank = new Map<string, number>();\n\n  for (const n of nodes) {\n    parent.set(n, n);\n    rank.set(n, 0);\n  }\n\n  function find(x: string): string {\n    let root = x;\n    while (parent.get(root) !== root) {\n      root = parent.get(root)!;\n    }\n    let current = x;\n    while (current !== root) {\n      const next = parent.get(current)!;\n      parent.set(current, root);\n      current = next;\n    }\n    return root;\n  }\n\n  function union(a: string, b: string): void {\n    const ra = find(a);\n    const rb = find(b);\n    if (ra === rb) return;\n    const rankA = rank.get(ra) ?? 0;\n    const rankB = rank.get(rb) ?? 0;\n    if (rankA < rankB) {\n      parent.set(ra, rb);\n    } else if (rankA > rankB) {\n      parent.set(rb, ra);\n    } else {\n      parent.set(rb, ra);\n      rank.set(ra, rankA + 1);\n    }\n  }\n\n  for (const { source, target } of edges) {\n    if (parent.has(source) && parent.has(target)) {\n      union(source, target);\n    }\n  }\n\n  const roots = new Set<string>();\n  for (const n of nodes) {\n    roots.add(find(n));\n  }\n  return roots.size;\n}\n\n/**\n * Audit the structural health of the Zettelkasten vault using graph metrics.\n */\nexport async function zettelHealth(backend: StorageBackend, opts?: HealthOptions): Promise<HealthResult> {\n  const options = opts ?? {};\n  const scope = options.scope ?? \"full\";\n  const include = options.include ?? [\"dead_links\", \"orphans\", \"disconnected\", \"low_connectivity\"];\n\n  const computedAt = Date.now();\n\n  // --- totalFiles ---\n  let totalFiles = 0;\n  if (scope === \"full\") {\n    totalFiles = await backend.countVaultFiles();\n  } else if (scope === \"project\") {\n    const prefix = options.projectPath ?? \"\";\n    totalFiles = await backend.countVaultFilesWithPrefix(prefix);\n  } else {\n    const days = options.recentDays ?? 30;\n    const cutoff = computedAt - days * 86400000;\n    totalFiles = await backend.countVaultFilesAfter(cutoff);\n  }\n\n  // --- totalLinks ---\n  let totalLinks = 0;\n  if (scope === \"full\") {\n    // Count total links via link graph length\n    const graph = await backend.getVaultLinkGraph();\n    totalLinks = graph.length;\n  } else if (scope === \"project\") {\n    const prefix = options.projectPath ?? \"\";\n    totalLinks = await backend.countVaultLinksWithPrefix(prefix);\n  } else {\n    const days = options.recentDays ?? 30;\n    const cutoff = computedAt - days * 86400000;\n    totalLinks = await backend.countVaultLinksAfter(cutoff);\n  }\n\n  // --- deadLinks ---\n  let deadLinks: DeadLink[] = [];\n  if (include.includes(\"dead_links\")) {\n    if (scope === \"full\") {\n      deadLinks = await backend.getDeadLinksWithLineNumbers();\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      deadLinks = await backend.getDeadLinksWithPrefix(prefix);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      deadLinks = await backend.getDeadLinksAfter(cutoff);\n    }\n  }\n\n  // --- orphans ---\n  let orphans: string[] = [];\n  if (include.includes(\"orphans\")) {\n    if (scope === \"full\") {\n      const orphanRows = await backend.getOrphans();\n      orphans = orphanRows.map(r => r.vaultPath);\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      orphans = await backend.getOrphansWithPrefix(prefix);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      orphans = await backend.getOrphansAfter(cutoff);\n    }\n  }\n\n  // --- disconnectedClusters (union-find) ---\n  let disconnectedClusters = 1;\n  if (include.includes(\"disconnected\")) {\n    let allNodes: string[];\n    let allEdges: Array<{ source: string; target: string }>;\n\n    if (scope === \"full\") {\n      [allNodes, allEdges] = await Promise.all([\n        backend.getAllVaultFilePaths(),\n        backend.getVaultLinkEdges(),\n      ]);\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      [allNodes, allEdges] = await Promise.all([\n        backend.getVaultFilePathsWithPrefix(prefix),\n        backend.getVaultLinkEdgesWithPrefix(prefix),\n      ]);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      [allNodes, allEdges] = await Promise.all([\n        backend.getVaultFilePathsAfter(cutoff),\n        backend.getVaultLinkEdgesAfter(cutoff),\n      ]);\n    }\n\n    disconnectedClusters = countComponents(allNodes, allEdges);\n  }\n\n  // --- lowConnectivity ---\n  let lowConnectivity: string[] = [];\n  if (include.includes(\"low_connectivity\")) {\n    if (scope === \"full\") {\n      lowConnectivity = await backend.getLowConnectivity();\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      lowConnectivity = await backend.getLowConnectivityWithPrefix(prefix);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      lowConnectivity = await backend.getLowConnectivityAfter(cutoff);\n    }\n  }\n\n  // --- linkConfidence ---\n  // Count links by confidence level using a sampling of all vault file paths.\n  // We reuse the link graph data we already fetched for totalLinks when scope=full.\n  let linkConfidence: HealthResult[\"linkConfidence\"] | undefined;\n  if (scope === \"full\") {\n    try {\n      // Get all file paths to iterate their outbound links with confidence\n      const samplePaths = await backend.getAllVaultFilePaths();\n      const sampleSize = Math.min(samplePaths.length, 200); // limit for performance\n      const sampled = samplePaths.slice(0, sampleSize);\n      let extracted = 0;\n      let inferred = 0;\n      let ambiguous = 0;\n      for (const path of sampled) {\n        const links = await backend.getLinksFromSource(path);\n        for (const link of links) {\n          const c = link.confidence ?? \"EXTRACTED\";\n          if (c === \"EXTRACTED\") extracted++;\n          else if (c === \"INFERRED\") inferred++;\n          else ambiguous++;\n        }\n      }\n      // Extrapolate if we sampled\n      const factor = samplePaths.length > 0 ? samplePaths.length / sampleSize : 1;\n      linkConfidence = {\n        extracted: Math.round(extracted * factor),\n        inferred: Math.round(inferred * factor),\n        ambiguous: Math.round(ambiguous * factor),\n      };\n    } catch {\n      // Backend may not support confidence field yet — ignore\n    }\n  }\n\n  // --- healthScore ---\n  const deadRatio = totalLinks > 0 ? deadLinks.length / totalLinks : 0;\n  const orphanRatio = totalFiles > 0 ? orphans.length / totalFiles : 0;\n  const lowConnRatio = totalFiles > 0 ? lowConnectivity.length / totalFiles : 0;\n  const healthScore = Math.round(\n    100 * (1 - deadRatio) * (1 - orphanRatio * 0.5) * (1 - lowConnRatio * 0.3),\n  );\n\n  return {\n    totalFiles,\n    totalLinks,\n    deadLinks,\n    orphans,\n    disconnectedClusters,\n    lowConnectivity,\n    healthScore,\n    computedAt,\n    linkConfidence,\n  };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport { deserializeEmbedding, cosineSimilarity } from \"../memory/embeddings.js\";\nimport { basename } from \"node:path\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\nexport interface SuggestOptions {\n  notePath: string;\n  vaultProjectId: number;\n  limit?: number;\n  excludeLinked?: boolean;\n}\n\nexport interface Suggestion {\n  path: string;\n  title: string | null;\n  score: number;\n  semanticScore: number;\n  tagScore: number;\n  neighborScore: number;\n  reason: string;\n  suggestedWikilink: string;\n}\n\nconst MAX_CHUNKS = 5000;\nconst SEMANTIC_WEIGHT = 0.5;\nconst TAG_WEIGHT = 0.2;\nconst NEIGHBOR_WEIGHT = 0.3;\n\n// STOP_WORDS imported from utils/stop-words.ts\n\nfunction extractTagsFromChunkTexts(texts: string[]): Set<string> {\n  const tags = new Set<string>();\n  for (const text of texts) {\n    // Match YAML frontmatter tags block: \"tags:\\n  - tag1\\n  - tag2\"\n    const match = text.match(/^tags:\\s*\\n((?:[ \\t]*-[ \\t]*.+\\n?)*)/m);\n    if (!match) continue;\n    const block = match[1];\n    const lines = block.split(\"\\n\");\n    for (const line of lines) {\n      const tagMatch = line.match(/^[ \\t]*-[ \\t]*(.+)/);\n      if (tagMatch) {\n        const tag = tagMatch[1].trim().toLowerCase();\n        if (tag) tags.add(tag);\n      }\n    }\n  }\n  return tags;\n}\n\nfunction jaccardSimilarity(a: Set<string>, b: Set<string>): number {\n  if (a.size === 0 && b.size === 0) return 0;\n  let intersection = 0;\n  for (const tag of a) {\n    if (b.has(tag)) intersection++;\n  }\n  const union = a.size + b.size - intersection;\n  return union === 0 ? 0 : intersection / union;\n}\n\nfunction buildReason(\n  semanticScore: number,\n  tagScore: number,\n  neighborScore: number,\n  neighborCount: number,\n): string {\n  const signals: Array<{ label: string; value: number }> = [\n    { label: `Semantically similar (${semanticScore.toFixed(2)})`, value: semanticScore * SEMANTIC_WEIGHT },\n    { label: `Shared tags (${tagScore.toFixed(2)} Jaccard)`, value: tagScore * TAG_WEIGHT },\n    { label: `Linked by ${neighborCount} mutual connection${neighborCount !== 1 ? \"s\" : \"\"}`, value: neighborScore * NEIGHBOR_WEIGHT },\n  ];\n  signals.sort((a, b) => b.value - a.value);\n  return signals[0].label;\n}\n\nfunction suggestedWikilink(vaultPath: string): string {\n  const base = basename(vaultPath);\n  const name = base.endsWith(\".md\") ? base.slice(0, -3) : base;\n  return `[[${name}]]`;\n}\n\n/**\n * Proactively find notes worth linking to a given note, combining semantic similarity,\n * shared tags, and graph-neighborhood signals into a ranked list of suggestions.\n */\nexport async function zettelSuggest(\n  backend: StorageBackend,\n  opts: SuggestOptions,\n): Promise<Suggestion[]> {\n  const limit = opts.limit ?? 5;\n  const excludeLinked = opts.excludeLinked ?? true;\n\n  // Step 1: get current outbound links\n  const outboundLinks = await backend.getLinksFromSource(opts.notePath);\n  const linkedPaths = new Set(outboundLinks.filter(l => l.targetPath !== null).map(l => l.targetPath as string));\n\n  // Step 2a: get all file-level embeddings for semantic scoring\n  const chunkRows = await backend.getChunksWithEmbeddings(opts.vaultProjectId, MAX_CHUNKS);\n\n  const byPath = new Map<string, { sum: Float32Array; count: number }>();\n  for (const row of chunkRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const entry = byPath.get(row.path);\n    if (!entry) {\n      byPath.set(row.path, { sum: new Float32Array(vec), count: 1 });\n    } else {\n      for (let i = 0; i < vec.length; i++) {\n        entry.sum[i] += vec[i];\n      }\n      entry.count++;\n    }\n  }\n\n  const allEmbeddings = new Map<string, Float32Array>();\n  for (const [path, { sum, count }] of byPath) {\n    const avg = new Float32Array(sum.length);\n    for (let i = 0; i < sum.length; i++) {\n      avg[i] = sum[i] / count;\n    }\n    allEmbeddings.set(path, avg);\n  }\n  allEmbeddings.delete(opts.notePath);\n\n  // Step 2b: get source embedding\n  const sourceEmbedding = allEmbeddings.get(opts.notePath) ?? null;\n\n  // Step 2c: get source tags\n  const sourceChunkTexts = await backend.getChunksForPath(opts.vaultProjectId, opts.notePath, 5);\n  const sourceTags = extractTagsFromChunkTexts(sourceChunkTexts.map(r => r.text));\n\n  // Step 2d: compute graph neighborhood (friends-of-friends)\n  const directLinks = await backend.getLinksFromSource(opts.notePath);\n  const directTargets = directLinks.filter(l => l.targetPath !== null).map(l => l.targetPath as string);\n\n  const friendLinkCounts = new Map<string, number>();\n  for (const target of directTargets) {\n    const friendLinks = await backend.getLinksFromSource(target);\n    for (const link of friendLinks) {\n      if (link.targetPath && link.targetPath !== opts.notePath) {\n        friendLinkCounts.set(link.targetPath, (friendLinkCounts.get(link.targetPath) ?? 0) + 1);\n      }\n    }\n  }\n  const maxFriendLinks = Math.max(1, ...friendLinkCounts.values());\n\n  // Get all vault files to enumerate candidates\n  const allFiles = await backend.getAllVaultFiles();\n\n  const suggestions: Suggestion[] = [];\n\n  for (const fileRow of allFiles) {\n    const vault_path = fileRow.vaultPath;\n    const title = fileRow.title;\n\n    if (vault_path === opts.notePath) continue;\n    if (excludeLinked && linkedPaths.has(vault_path)) continue;\n\n    // Semantic score\n    let semanticScore = 0;\n    if (sourceEmbedding) {\n      const candidateEmbedding = allEmbeddings.get(vault_path);\n      if (candidateEmbedding) {\n        semanticScore = Math.max(0, cosineSimilarity(sourceEmbedding, candidateEmbedding));\n      }\n    }\n\n    // Tag score (only compute if candidate might have chunks)\n    let tagScore = 0;\n    if (allEmbeddings.has(vault_path)) {\n      const candidateChunkTexts = await backend.getChunksForPath(opts.vaultProjectId, vault_path, 5);\n      const candidateTags = extractTagsFromChunkTexts(candidateChunkTexts.map(r => r.text));\n      tagScore = jaccardSimilarity(sourceTags, candidateTags);\n    }\n\n    // Neighbor score\n    const friendCount = friendLinkCounts.get(vault_path) ?? 0;\n    const neighborScore = friendCount / maxFriendLinks;\n\n    const score =\n      SEMANTIC_WEIGHT * semanticScore +\n      TAG_WEIGHT * tagScore +\n      NEIGHBOR_WEIGHT * neighborScore;\n\n    // Only include if there is at least some signal\n    if (score <= 0) continue;\n\n    const reason = buildReason(semanticScore, tagScore, neighborScore, friendCount);\n\n    suggestions.push({\n      path: vault_path,\n      title,\n      score,\n      semanticScore,\n      tagScore,\n      neighborScore,\n      reason,\n      suggestedWikilink: suggestedWikilink(vault_path),\n    });\n  }\n\n  suggestions.sort((a, b) => b.score - a.score);\n  return suggestions.slice(0, limit);\n}\n","/**\n * God-note detection — find hub notes via degree centrality on the vault link graph.\n *\n * Hub notes (or \"god notes\") are notes with unusually high inbound link counts.\n * They represent core concepts that the rest of the vault frequently references.\n * Structural pages (index, MOC, master notes, tag pages) are filtered out.\n */\n\nimport type { StorageBackend } from \"../storage/interface.js\";\n\nexport interface GodNoteOptions {\n  /** Maximum number of hub notes to return. Default: 20. */\n  limit?: number;\n  /** Minimum inbound link count to qualify as a hub. Default: 3. */\n  minInbound?: number;\n  /** Include outbound counts in the result. Default: true. */\n  includeOutbound?: boolean;\n}\n\nexport interface GodNote {\n  path: string;\n  title: string | null;\n  inboundCount: number;\n  outboundCount: number;\n  /** Ratio of inbound to total degree — higher means more \"sink\"-like. */\n  inboundRatio: number;\n}\n\nexport interface GodNoteResult {\n  godNotes: GodNote[];\n  totalVaultFiles: number;\n  /** Median inbound count across all vault files (for context). */\n  medianInbound: number;\n}\n\n/** Patterns that identify structural/meta pages rather than concept notes. */\nconst STRUCTURAL_PATTERNS = [\n  /\\bindex\\b/i,\n  /\\bMOC\\b/,\n  /\\bmaster\\b/i,\n  /\\btag\\s*page/i,\n  /\\bhome\\b/i,\n  /\\bdashboard\\b/i,\n  /\\btemplate/i,\n  /^_/,\n];\n\nfunction isStructuralNote(title: string | null, path: string): boolean {\n  const text = title ?? path;\n  return STRUCTURAL_PATTERNS.some((pattern) => pattern.test(text));\n}\n\n/**\n * Find hub/\"god\" notes in the vault — notes with the highest inbound link counts,\n * excluding structural pages.\n */\nexport async function zettelGodNotes(\n  backend: StorageBackend,\n  opts?: GodNoteOptions,\n): Promise<GodNoteResult> {\n  const limit = opts?.limit ?? 20;\n  const minInbound = opts?.minInbound ?? 3;\n\n  // Get the full link graph\n  const linkGraph = await backend.getVaultLinkGraph();\n\n  // Count inbound and outbound per path\n  const inboundCounts = new Map<string, number>();\n  const outboundCounts = new Map<string, number>();\n\n  for (const { source_path, target_path } of linkGraph) {\n    inboundCounts.set(target_path, (inboundCounts.get(target_path) ?? 0) + 1);\n    outboundCounts.set(source_path, (outboundCounts.get(source_path) ?? 0) + 1);\n  }\n\n  // Get all vault files for title lookup and total count\n  const allFiles = await backend.getAllVaultFiles();\n  const titleMap = new Map<string, string | null>();\n  for (const f of allFiles) {\n    titleMap.set(f.vaultPath, f.title);\n  }\n\n  const totalVaultFiles = allFiles.length;\n\n  // Compute median inbound for context\n  const allInbounds = allFiles.map((f) => inboundCounts.get(f.vaultPath) ?? 0);\n  allInbounds.sort((a, b) => a - b);\n  const medianInbound =\n    allInbounds.length > 0\n      ? allInbounds[Math.floor(allInbounds.length / 2)]\n      : 0;\n\n  // Build candidate list: all paths with inbound >= minInbound, excluding structural\n  const candidates: GodNote[] = [];\n\n  for (const [path, inbound] of inboundCounts) {\n    if (inbound < minInbound) continue;\n\n    const title = titleMap.get(path) ?? null;\n    if (isStructuralNote(title, path)) continue;\n\n    const outbound = outboundCounts.get(path) ?? 0;\n    const totalDegree = inbound + outbound;\n    const inboundRatio = totalDegree > 0 ? inbound / totalDegree : 0;\n\n    candidates.push({\n      path,\n      title,\n      inboundCount: inbound,\n      outboundCount: outbound,\n      inboundRatio: Math.round(inboundRatio * 1000) / 1000,\n    });\n  }\n\n  // Sort by inbound count descending\n  candidates.sort((a, b) => b.inboundCount - a.inboundCount);\n\n  return {\n    godNotes: candidates.slice(0, limit),\n    totalVaultFiles,\n    medianInbound,\n  };\n}\n","/**\n * Community detection for the Zettelkasten vault link graph.\n *\n * Implements the Louvain algorithm in pure TypeScript for discovering\n * densely connected clusters of notes. This reveals emergent knowledge\n * communities that may not be obvious from folder structure alone.\n *\n * The Louvain method optimizes modularity in two phases:\n *  1. Local: each node greedily moves to the community that maximizes modularity gain.\n *  2. Aggregation: communities are collapsed into super-nodes, forming a new graph.\n * Repeat until no further improvement.\n */\n\nimport type { StorageBackend } from \"../storage/interface.js\";\n\nexport interface CommunityOptions {\n  /** Minimum community size to include in results. Default: 3. */\n  minSize?: number;\n  /** Maximum number of communities to return. Default: 20. */\n  maxCommunities?: number;\n  /** Resolution parameter for Louvain (higher = more communities). Default: 1.0. */\n  resolution?: number;\n}\n\nexport interface CommunityNode {\n  path: string;\n  title: string | null;\n  /** Degree (inbound + outbound) within the community. */\n  internalDegree: number;\n}\n\nexport interface Community {\n  id: number;\n  /** Label derived from most common words in note titles. */\n  label: string;\n  nodes: CommunityNode[];\n  size: number;\n  /** Cohesion: ratio of internal edges to total possible internal edges. */\n  cohesion: number;\n  /** Top folders represented in this community. */\n  topFolders: string[];\n}\n\nexport interface CommunityResult {\n  communities: Community[];\n  totalNodes: number;\n  totalEdges: number;\n  /** Global modularity score of the partition. */\n  modularity: number;\n}\n\n// ---------------------------------------------------------------------------\n// Louvain algorithm implementation\n// ---------------------------------------------------------------------------\n\ninterface Graph {\n  /** All node IDs */\n  nodes: string[];\n  /** Adjacency list: node -> Map<neighbor, weight> */\n  adj: Map<string, Map<string, number>>;\n  /** Total edge weight (sum of all edge weights, counting undirected edges once) */\n  totalWeight: number;\n  /** Weighted degree per node */\n  degree: Map<string, number>;\n}\n\nfunction buildUndirectedGraph(\n  edges: Array<{ source_path: string; target_path: string }>\n): Graph {\n  const adj = new Map<string, Map<string, number>>();\n  const nodeSet = new Set<string>();\n\n  function getOrCreate(node: string): Map<string, number> {\n    let m = adj.get(node);\n    if (!m) {\n      m = new Map();\n      adj.set(node, m);\n    }\n    nodeSet.add(node);\n    return m;\n  }\n\n  let totalWeight = 0;\n\n  for (const { source_path, target_path } of edges) {\n    if (source_path === target_path) continue; // skip self-loops\n\n    const aMap = getOrCreate(source_path);\n    const bMap = getOrCreate(target_path);\n\n    // Undirected: add weight in both directions\n    aMap.set(target_path, (aMap.get(target_path) ?? 0) + 1);\n    bMap.set(source_path, (bMap.get(source_path) ?? 0) + 1);\n    totalWeight += 1; // each undirected edge counted once\n  }\n\n  // Compute weighted degree\n  const degree = new Map<string, number>();\n  for (const [node, neighbors] of adj) {\n    let d = 0;\n    for (const w of neighbors.values()) d += w;\n    degree.set(node, d);\n  }\n\n  return {\n    nodes: Array.from(nodeSet),\n    adj,\n    totalWeight,\n    degree,\n  };\n}\n\n/**\n * Run one pass of Phase 1: local node movement.\n * Returns true if any node changed community.\n */\nfunction louvainPhase1(\n  graph: Graph,\n  community: Map<string, number>,\n  resolution: number,\n): boolean {\n  const m2 = 2 * graph.totalWeight;\n  if (m2 === 0) return false;\n\n  // Community -> sum of degrees of nodes in community\n  const communityDegreeSum = new Map<number, number>();\n  // Community -> sum of internal edge weights\n  const communityInternalWeight = new Map<number, number>();\n\n  for (const node of graph.nodes) {\n    const c = community.get(node)!;\n    communityDegreeSum.set(c, (communityDegreeSum.get(c) ?? 0) + (graph.degree.get(node) ?? 0));\n  }\n\n  // Compute internal weights\n  for (const [node, neighbors] of graph.adj) {\n    const nc = community.get(node)!;\n    for (const [neighbor, weight] of neighbors) {\n      if (community.get(neighbor) === nc) {\n        communityInternalWeight.set(nc, (communityInternalWeight.get(nc) ?? 0) + weight);\n      }\n    }\n  }\n  // Each internal edge is counted twice (both endpoints), so divide\n  for (const [c, w] of communityInternalWeight) {\n    communityInternalWeight.set(c, w / 2);\n  }\n\n  let improved = false;\n  // Shuffle node order for better convergence\n  const shuffled = [...graph.nodes];\n  for (let i = shuffled.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];\n  }\n\n  for (const node of shuffled) {\n    const currentComm = community.get(node)!;\n    const ki = graph.degree.get(node) ?? 0;\n    const neighbors = graph.adj.get(node) ?? new Map();\n\n    // Compute weight to each neighboring community\n    const weightToComm = new Map<number, number>();\n    for (const [neighbor, weight] of neighbors) {\n      const nc = community.get(neighbor)!;\n      weightToComm.set(nc, (weightToComm.get(nc) ?? 0) + weight);\n    }\n\n    // Remove node from its current community\n    communityDegreeSum.set(currentComm, (communityDegreeSum.get(currentComm) ?? 0) - ki);\n    const weightToCurrent = weightToComm.get(currentComm) ?? 0;\n    communityInternalWeight.set(\n      currentComm,\n      (communityInternalWeight.get(currentComm) ?? 0) - weightToCurrent,\n    );\n\n    // Find best community\n    let bestComm = currentComm;\n    let bestDelta = 0;\n\n    for (const [candidateComm, weightToCandidate] of weightToComm) {\n      const sigmaTot = communityDegreeSum.get(candidateComm) ?? 0;\n      // Modularity gain of moving node to candidateComm\n      const delta = weightToCandidate - resolution * (ki * sigmaTot) / m2;\n      if (delta > bestDelta) {\n        bestDelta = delta;\n        bestComm = candidateComm;\n      }\n    }\n\n    // Also consider staying (delta = 0, but need to re-add)\n    // Move node to best community\n    community.set(node, bestComm);\n    communityDegreeSum.set(bestComm, (communityDegreeSum.get(bestComm) ?? 0) + ki);\n    const weightToBest = weightToComm.get(bestComm) ?? 0;\n    communityInternalWeight.set(\n      bestComm,\n      (communityInternalWeight.get(bestComm) ?? 0) + weightToBest,\n    );\n\n    if (bestComm !== currentComm) {\n      improved = true;\n    }\n  }\n\n  return improved;\n}\n\n/**\n * Compute modularity for a given partition.\n */\nfunction computeModularity(\n  graph: Graph,\n  community: Map<string, number>,\n  resolution: number,\n): number {\n  const m2 = 2 * graph.totalWeight;\n  if (m2 === 0) return 0;\n\n  let q = 0;\n  for (const [node, neighbors] of graph.adj) {\n    const ci = community.get(node)!;\n    const ki = graph.degree.get(node) ?? 0;\n\n    for (const [neighbor, weight] of neighbors) {\n      if (community.get(neighbor) === ci) {\n        q += weight - resolution * (ki * (graph.degree.get(neighbor) ?? 0)) / m2;\n      }\n    }\n  }\n  return q / m2;\n}\n\n/**\n * Run Louvain community detection on the vault link graph.\n */\nfunction runLouvain(\n  graph: Graph,\n  resolution: number,\n): Map<string, number> {\n  // Initialize: each node in its own community\n  const community = new Map<string, number>();\n  let nextComm = 0;\n  for (const node of graph.nodes) {\n    community.set(node, nextComm++);\n  }\n\n  // Phase 1: iteratively move nodes until no improvement\n  const MAX_ITERATIONS = 20;\n  for (let iter = 0; iter < MAX_ITERATIONS; iter++) {\n    const improved = louvainPhase1(graph, community, resolution);\n    if (!improved) break;\n  }\n\n  // Compact community IDs\n  const commRemap = new Map<number, number>();\n  let remapIdx = 0;\n  for (const [, c] of community) {\n    if (!commRemap.has(c)) {\n      commRemap.set(c, remapIdx++);\n    }\n  }\n  for (const [node, c] of community) {\n    community.set(node, commRemap.get(c)!);\n  }\n\n  return community;\n}\n\n// ---------------------------------------------------------------------------\n// Label generation\n// ---------------------------------------------------------------------------\n\nconst STOP_WORDS = new Set([\n  \"the\", \"and\", \"for\", \"are\", \"but\", \"not\", \"you\", \"all\", \"can\", \"her\",\n  \"was\", \"one\", \"our\", \"out\", \"has\", \"had\", \"how\", \"its\", \"may\", \"new\",\n  \"now\", \"old\", \"see\", \"way\", \"who\", \"did\", \"get\", \"let\", \"say\", \"she\",\n  \"too\", \"use\", \"from\", \"with\", \"this\", \"that\", \"will\", \"been\", \"have\",\n  \"each\", \"make\", \"like\", \"long\", \"look\", \"many\", \"them\", \"then\", \"what\",\n  \"when\", \"some\", \"time\", \"very\", \"your\", \"about\", \"could\", \"into\", \"just\",\n  \"more\", \"note\", \"notes\", \"than\", \"over\",\n]);\n\nfunction generateCommunityLabel(titles: Array<string | null>): string {\n  const wordCounts = new Map<string, number>();\n  for (const title of titles) {\n    if (!title) continue;\n    const words = title\n      .toLowerCase()\n      .replace(/[^a-z0-9\\s]/g, \" \")\n      .split(/\\s+/)\n      .filter((w) => w.length > 2 && !STOP_WORDS.has(w));\n    for (const word of words) {\n      wordCounts.set(word, (wordCounts.get(word) ?? 0) + 1);\n    }\n  }\n  const sorted = [...wordCounts.entries()].sort((a, b) => b[1] - a[1]);\n  return sorted\n    .slice(0, 3)\n    .map(([w]) => w)\n    .join(\" / \") || \"unnamed\";\n}\n\nfunction getTopFolder(path: string): string {\n  const slash = path.indexOf(\"/\");\n  return slash === -1 ? path : path.slice(0, slash);\n}\n\n// ---------------------------------------------------------------------------\n// Main export\n// ---------------------------------------------------------------------------\n\n/**\n * Detect communities in the vault link graph using the Louvain algorithm.\n * Returns clusters of densely connected notes with labels and cohesion scores.\n */\nexport async function zettelCommunities(\n  backend: StorageBackend,\n  opts?: CommunityOptions,\n): Promise<CommunityResult> {\n  const minSize = opts?.minSize ?? 3;\n  const maxCommunities = opts?.maxCommunities ?? 20;\n  const resolution = opts?.resolution ?? 1.0;\n\n  // Get the full link graph\n  const linkGraph = await backend.getVaultLinkGraph();\n  const graph = buildUndirectedGraph(linkGraph);\n\n  if (graph.nodes.length === 0) {\n    return {\n      communities: [],\n      totalNodes: 0,\n      totalEdges: 0,\n      modularity: 0,\n    };\n  }\n\n  // Run Louvain\n  const communityMap = runLouvain(graph, resolution);\n\n  // Compute modularity\n  const modularity = computeModularity(graph, communityMap, resolution);\n\n  // Group nodes by community\n  const groups = new Map<number, string[]>();\n  for (const [node, comm] of communityMap) {\n    const arr = groups.get(comm);\n    if (arr) arr.push(node);\n    else groups.set(comm, [node]);\n  }\n\n  // Get all vault files for title lookup\n  const allFiles = await backend.getAllVaultFiles();\n  const titleMap = new Map<string, string | null>();\n  for (const f of allFiles) {\n    titleMap.set(f.vaultPath, f.title);\n  }\n\n  // Build community results\n  const communities: Community[] = [];\n  let commId = 0;\n\n  for (const [, members] of groups) {\n    if (members.length < minSize) continue;\n\n    const memberSet = new Set(members);\n    const titles = members.map((p) => titleMap.get(p) ?? null);\n    const label = generateCommunityLabel(titles);\n\n    // Compute internal degree per node\n    const nodes: CommunityNode[] = members.map((path) => {\n      const neighbors = graph.adj.get(path) ?? new Map();\n      let internalDeg = 0;\n      for (const [neighbor, weight] of neighbors) {\n        if (memberSet.has(neighbor)) internalDeg += weight;\n      }\n      return {\n        path,\n        title: titleMap.get(path) ?? null,\n        internalDegree: internalDeg,\n      };\n    });\n\n    // Sort nodes by internal degree descending\n    nodes.sort((a, b) => b.internalDegree - a.internalDegree);\n\n    // Compute cohesion: ratio of actual internal edges to possible\n    let internalEdges = 0;\n    for (const node of nodes) {\n      internalEdges += node.internalDegree;\n    }\n    internalEdges /= 2; // each edge counted twice\n    const possibleEdges = (members.length * (members.length - 1)) / 2;\n    const cohesion = possibleEdges > 0 ? Math.round((internalEdges / possibleEdges) * 1000) / 1000 : 0;\n\n    // Top folders\n    const folderCounts = new Map<string, number>();\n    for (const path of members) {\n      const folder = getTopFolder(path);\n      folderCounts.set(folder, (folderCounts.get(folder) ?? 0) + 1);\n    }\n    const topFolders = [...folderCounts.entries()]\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, 5)\n      .map(([f]) => f);\n\n    communities.push({\n      id: commId++,\n      label,\n      nodes,\n      size: members.length,\n      cohesion,\n      topFolders,\n    });\n  }\n\n  // Sort by size descending\n  communities.sort((a, b) => b.size - a.size);\n\n  return {\n    communities: communities.slice(0, maxCommunities),\n    totalNodes: graph.nodes.length,\n    totalEdges: graph.totalWeight,\n    modularity: Math.round(modularity * 10000) / 10000,\n  };\n}\n"],"mappings":";;;;;;AA2BA,SAAS,aAAa,QAAgB,QAA8C;AAClF,QAAO,QAAQ,OAAO,KAAK,QAAQ,OAAO,GAAG,eAAe;;AAG9D,eAAe,aAAa,SAAyB,WAA2C;CAE9F,MAAM,QAAQ,MAAM,QAAQ,qBAAqB,CAAC,UAAU,CAAC;AAC7D,KAAI,MAAM,SAAS,EAAG,QAAO,MAAM,GAAG;CAGtC,MAAM,QAAQ,MAAM,QAAQ,cAAc,UAAU;AACpD,KAAI,CAAC,MAAO,QAAO;CAEnB,MAAM,YAAY,MAAM,QAAQ,qBAAqB,CAAC,MAAM,cAAc,CAAC;AAC3E,QAAO,UAAU,SAAS,IAAI,UAAU,GAAG,YAAY;;AAGzD,eAAe,oBAAoB,SAAyB,MAAiC;AAE3F,SADc,MAAM,QAAQ,mBAAmB,KAAK,EACvC,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB;;AAGlF,eAAe,qBAAqB,SAAyB,MAAiC;AAE5F,SADc,MAAM,QAAQ,iBAAiB,KAAK,EACrC,KAAI,MAAK,EAAE,WAAW;;AAGrC,eAAe,YACb,SACA,MACsE;CACtE,MAAM,CAAC,OAAO,UAAU,MAAM,QAAQ,IAAI,CACxC,QAAQ,qBAAqB,CAAC,KAAK,CAAC,EACpC,QAAQ,eAAe,KAAK,CAC7B,CAAC;AAEF,QAAO;EACL,OAAO,MAAM,IAAI,SAAS;EAC1B,SAAS,QAAQ,gBAAgB;EACjC,UAAU,QAAQ,iBAAiB;EACpC;;;;;;AAOH,eAAsB,cAAc,SAAyB,MAA8C;CACzG,MAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,KAAK,SAAS,GAAG,EAAE,EAAE,GAAG;CACxD,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,OAAO,KAAK,QAAQ;CAE1B,MAAM,OAAO,MAAM,aAAa,SAAS,KAAK,UAAU;AACxD,KAAI,CAAC,KACH,QAAO;EACL,MAAM,KAAK;EACX,OAAO,EAAE;EACT,OAAO,EAAE;EACT,iBAAiB,EAAE;EACnB,iBAAiB;EAClB;CAGH,MAAM,UAAU,IAAI,IAAY,CAAC,KAAK,CAAC;CACvC,MAAM,QAAuB,EAAE;CAC/B,MAAM,QAAiF,EAAE;CACzF,IAAI,kBAAkB;CAEtB,MAAM,QAAgD,CAAC;EAAE,MAAM;EAAM,OAAO;EAAG,CAAC;AAEhF,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,OAAO;AAE7B,MAAI,QAAQ,SAAS,OAAO;AAC1B,qBAAkB;AAClB;;EAGF,MAAM,YAAmE,EAAE;AAE3E,MAAI,cAAc,aAAa,cAAc,OAC3C,MAAK,MAAM,KAAK,MAAM,oBAAoB,SAAS,QAAQ,KAAK,CAC9D,WAAU,KAAK;GAAE,UAAU;GAAG,MAAM,QAAQ;GAAM,IAAI;GAAG,CAAC;AAI9D,MAAI,cAAc,cAAc,cAAc,OAC5C,MAAK,MAAM,KAAK,MAAM,qBAAqB,SAAS,QAAQ,KAAK,CAC/D,WAAU,KAAK;GAAE,UAAU;GAAG,MAAM;GAAG,IAAI,QAAQ;GAAM,CAAC;AAI9D,OAAK,MAAM,EAAE,UAAU,MAAM,QAAQ,WAAW;GAC9C,MAAM,WAAW,aAAa,MAAM,GAAG;AAEvC,OAAI,SAAS,SAAS,aAAa,KACjC;AAIF,OAAI,CADmB,MAAM,MAAM,MAAM,EAAE,SAAS,QAAQ,EAAE,OAAO,GAAG,CAEtE,OAAM,KAAK;IAAE;IAAM;IAAI,MAAM;IAAU,CAAC;AAG1C,OAAI,CAAC,QAAQ,IAAI,SAAS,EAAE;AAC1B,YAAQ,IAAI,SAAS;IAErB,MAAM,OAAO,MAAM,YAAY,SAAS,SAAS;AACjD,UAAM,KAAK;KACT,MAAM;KACN,OAAO,KAAK;KACZ,OAAO,QAAQ,QAAQ;KACvB,UAAU;KACV,SAAS,KAAK;KACd,UAAU,KAAK;KAChB,CAAC;AAEF,UAAM,KAAK;KAAE,MAAM;KAAU,OAAO,QAAQ,QAAQ;KAAG,CAAC;;;;CAK9D,MAAM,kBAAkB,MACrB,QAAQ,MAAM,EAAE,WAAW,EAAE,CAC7B,KAAK,MAAM,EAAE,KAAK;AAGrB,MADiB,MAAM,YAAY,SAAS,KAAK,EACpC,WAAW,EACtB,iBAAgB,QAAQ,KAAK;AAG/B,QAAO;EAAE;EAAM;EAAO;EAAO;EAAiB;EAAiB;;;;;ACtIjE,MAAMA,eAAa;AACnB,MAAM,cAAc;AAEpB,eAAe,kBACb,SACA,WACiE;CACjE,MAAM,OAAO,MAAM,QAAQ,wBAAwB,WAAWA,aAAW;CAEzE,MAAM,yBAAS,IAAI,KAAiE;AACpF,MAAK,MAAM,OAAO,MAAM;EACtB,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,QAAQ,OAAO,IAAI,IAAI,KAAK;AAClC,MAAI,CAAC,MACH,QAAO,IAAI,IAAI,MAAM;GAAE,KAAK,IAAI,aAAa,IAAI;GAAE,OAAO;GAAG,MAAM,IAAI;GAAM,CAAC;OACzE;AACL,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,OAAM,IAAI,MAAM,IAAI;AAEtB,SAAM;;;CAIV,MAAM,yBAAS,IAAI,KAAwD;AAC3E,MAAK,MAAM,CAAC,MAAM,EAAE,KAAK,OAAO,WAAW,QAAQ;EACjD,MAAM,MAAM,IAAI,aAAa,IAAI,OAAO;AACxC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,KAAK,IAAI,KAAK;AAEpB,SAAO,IAAI,MAAM;GAAE,WAAW;GAAK;GAAM,CAAC;;AAE5C,QAAO;;AAGT,eAAe,sBACb,SACA,WACA,MACsD;CACtD,MAAM,OAAO,MAAM,QAAQ,iBAAiB,WAAW,KAAK;AAE5D,KAAI,KAAK,WAAW,EAClB,QAAO;EAAE,WAAW,IAAI,aAAa,EAAE;EAAE,OAAO;EAAO;CAGzD,MAAM,UAAU,KAAK,QAAO,MAAK,EAAE,cAAc,KAAK;AACtD,KAAI,QAAQ,WAAW,EACrB,QAAO;EAAE,WAAW,IAAI,aAAa,EAAE;EAAE,OAAO;EAAO;CAGzD,MAAM,MAAM,qBAAqB,QAAQ,GAAG,UAAU,CAAC;CACvD,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,MAAM,OAAO,SAAS;EACzB,MAAM,MAAM,qBAAqB,IAAI,UAAU;AAC/C,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,MAAM,IAAI;;CAGlB,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,KAAK,IAAI,KAAK,QAAQ;AAE5B,QAAO;EAAE,WAAW;EAAK,OAAO;EAAM;;AAGxC,eAAe,iBAAiB,SAAyB,QAAgB,QAAiC;AACxG,KAAI,WAAW,OAAQ,QAAO;CAE9B,MAAM,UAAU,IAAI,IAAY,CAAC,OAAO,CAAC;CACzC,MAAM,QAA+C,CAAC;EAAE,MAAM;EAAQ,MAAM;EAAG,CAAC;AAEhF,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,EAAE,MAAM,SAAS,MAAM,OAAO;AACpC,MAAI,QAAQ,YAAa;EAEzB,MAAM,CAAC,cAAc,iBAAiB,MAAM,QAAQ,IAAI,CACtD,QAAQ,mBAAmB,KAAK,EAChC,QAAQ,iBAAiB,KAAK,CAC/B,CAAC;EAEF,MAAM,YAAsB,CAC1B,GAAG,aAAa,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB,EACnF,GAAG,cAAc,KAAI,MAAK,EAAE,WAAW,CACxC;AAED,OAAK,MAAM,YAAY,WAAW;AAChC,OAAI,aAAa,OAAQ,QAAO,OAAO;AACvC,OAAI,CAAC,QAAQ,IAAI,SAAS,EAAE;AAC1B,YAAQ,IAAI,SAAS;AACrB,UAAM,KAAK;KAAE,MAAM;KAAU,MAAM,OAAO;KAAG,CAAC;;;;AAKpD,QAAO;;AAGT,SAAS,iBACP,WACA,cACQ;CACR,MAAM,OAAO,UAAU,QAAO,MAAK,EAAE,cAAc,KAAK;AACxD,KAAI,KAAK,WAAW,EAAG,QAAO;CAE9B,IAAI,WAAW,KAAK,GAAG;CACvB,IAAI,UAAU;AAEd,MAAK,MAAM,OAAO,MAAM;EAEtB,MAAM,MAAM,iBAAiB,cADjB,qBAAqB,IAAI,UAAU,CACA;AAC/C,MAAI,MAAM,SAAS;AACjB,aAAU;AACV,cAAW,IAAI;;;AAInB,QAAO,SAAS,MAAM,CAAC,MAAM,GAAG,IAAI;;;;;;AAOtC,eAAsB,eACpB,SACA,MAC2B;CAC3B,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,gBAAgB,KAAK,iBAAiB;CAC5C,MAAM,mBAAmB,KAAK,oBAAoB;CAElD,IAAI,EAAE,WAAW,cAAc,UAAU,MAAM,sBAC7C,SACA,KAAK,gBACL,KAAK,cACN;AAGD,KAAI,CAAC,MAGH,gBAAe,MAAM,sBAAsB,UAF7B,MAAM,QAAQ,qBAAqB,CAAC,KAAK,cAAc,CAAC,EACnD,IAAI,SAAS,KAAK,cACoB;CAG3D,MAAM,oBAAoB,MAAM,kBAAkB,SAAS,KAAK,eAAe;AAG/E,mBAAkB,OAAO,KAAK,cAAc;CAG5C,MAAM,qBAA2D,EAAE;AACnE,MAAK,MAAM,CAAC,MAAM,EAAE,gBAAgB,mBAAmB;EACrD,MAAM,MAAM,iBAAiB,cAAc,UAAU;AACrD,MAAI,OAAO,cACT,oBAAmB,KAAK;GAAE;GAAM;GAAK,CAAC;;CAK1C,MAAM,UAA4B,EAAE;AAEpC,MAAK,MAAM,EAAE,MAAM,SAAS,oBAAoB;EAC9C,MAAM,gBAAgB,MAAM,iBAAiB,SAAS,KAAK,eAAe,KAAK;EAE/E,MAAM,oBAAoB,SAAS,cAAc,GAAG,gBAAgB;AACpE,MAAI,oBAAoB,iBAAkB;EAE1C,MAAM,QAAQ,MAAM,QAAQ,qBAAqB,CAAC,KAAK,CAAC;EACxD,MAAM,YAAY,MAAM,QAAQ,iBAAiB,KAAK,gBAAgB,MAAM,GAAG;EAE/E,MAAM,gBAAgB,MAAM,KAAK,KAAK,oBAAoB,EAAE;EAC5D,MAAM,gBAAgB,iBAAiB,WAAW,aAAa;AAE/D,UAAQ,KAAK;GACX;GACA,OAAO,MAAM,IAAI,SAAS;GAC1B,kBAAkB;GAClB,eAAe,SAAS,cAAc,GAAG,gBAAgB;GACzD;GACA;GACD,CAAC;;AAGJ,SAAQ,MAAM,GAAG,MAAM,EAAE,gBAAgB,EAAE,cAAc;AACzD,QAAO,QAAQ,MAAM,GAAG,MAAM;;;;;;ACjKhC,SAAS,cAAc,WAA2B;CAChD,MAAM,QAAQ,UAAU,QAAQ,IAAI;AACpC,QAAO,UAAU,KAAK,YAAY,UAAU,MAAM,GAAG,MAAM;;;;;;AAO7D,eAAe,gBAAgB,SAAyB,OAAuC;AAC7F,KAAI,MAAM,SAAS,EAAG,QAAO,EAAE;CAC/B,MAAM,WAAW,MAAM,KAAK,MAAM;CAElC,MAAM,CAAC,cAAc,iBAAiB,MAAM,QAAQ,IAAI,CACtD,QAAQ,uBAAuB,SAAS,EACxC,QAAQ,IAAI,SAAS,KAAI,MAAK,QAAQ,iBAAiB,EAAE,CAAC,CAAC,CAC5D,CAAC;CAEF,MAAM,YAAsB,EAAE;AAC9B,MAAK,MAAM,QAAQ,aACjB,KAAI,KAAK,WAAY,WAAU,KAAK,KAAK,WAAW;AAEtD,MAAK,MAAM,YAAY,cACrB,MAAK,MAAM,QAAQ,SACjB,WAAU,KAAK,KAAK,WAAW;AAGnC,QAAO;;;;;AAMT,eAAe,aACb,SACA,OACA,gBACA,MACyB;CACzB,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,KAAK;CACX,MAAM,KAAK;CAEX,MAAM,CAAC,gBAAgB,mBAAmB,MAAM,QAAQ,IAAI,CAC1D,QAAQ,cAAc,OAAO;EAAE,GAAG;EAAM,YAAY;EAAI,CAAC,EACzD,QAAQ,eAAe,gBAAgB;EAAE,GAAG;EAAM,YAAY;EAAI,CAAC,CACpE,CAAC;AAEF,KAAI,eAAe,WAAW,KAAK,gBAAgB,WAAW,EAAG,QAAO,EAAE;CAE1E,MAAM,UAAU,MACd,GAAG,EAAE,UAAU,GAAG,EAAE,KAAK,GAAG,EAAE,UAAU,GAAG,EAAE;CAE/C,SAAS,gBAAgB,QAA4B;EACnD,MAAM,MAAM,KAAK,IAAI,GAAG,OAAO;EAE/B,MAAM,QADM,KAAK,IAAI,GAAG,OAAO,GACX;AACpB,MAAI,UAAU,EAAG,QAAO,OAAO,UAAU,EAAI;AAC7C,SAAO,OAAO,KAAI,OAAM,IAAI,OAAO,MAAM;;CAG3C,MAAM,SAAS,gBAAgB,eAAe,KAAI,MAAK,EAAE,MAAM,CAAC;CAChE,MAAM,UAAU,gBAAgB,gBAAgB,KAAI,MAAK,EAAE,MAAM,CAAC;CAElE,MAAM,2BAAW,IAAI,KAAuD;AAE5E,MAAK,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;EAC9C,MAAM,IAAI,eAAe;EACzB,MAAM,IAAI,OAAO,EAAE;AACnB,WAAS,IAAI,GAAG;GAAE,GAAG;GAAG,eAAe,KAAK,OAAO;GAAI,CAAC;;AAG1D,MAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;EAC/C,MAAM,IAAI,gBAAgB;EAC1B,MAAM,IAAI,OAAO,EAAE;EACnB,MAAM,WAAW,SAAS,IAAI,EAAE;AAChC,MAAI,SACF,UAAS,iBAAiB,KAAK,QAAQ;MAEvC,UAAS,IAAI,GAAG;GAAE,GAAG;GAAG,eAAe,KAAK,QAAQ;GAAI,CAAC;;AAQ7D,QAJe,MAAM,KAAK,SAAS,QAAQ,CAAC,CACzC,MAAM,GAAG,MAAM,EAAE,gBAAgB,EAAE,cAAc,CACjD,MAAM,GAAG,WAAW,CAET,KAAI,OAAM;EAAE,GAAG;EAAG,OAAO,EAAE;EAAe,EAAE;;;;;;;AAY5D,eAAsB,eACpB,SACA,MACyB;CACzB,MAAM,QAAQ,KAAK,IAAI,KAAK,SAAS,GAAG,EAAE;CAC1C,MAAM,QAAQ,KAAK,IAAI,KAAK,SAAS,IAAI,EAAE;CAC3C,MAAM,iBAAiB;CAKvB,MAAM,iBAAiB,MAAM,sBAAsB,SAAS,KAAK,SAAS;CAE1E,MAAM,gBAAgB,MAAM,aAC1B,SACA,KAAK,UACL,gBACA;EACE,YAAY,CAAC,KAAK,eAAe;EACjC,YAAY;EACb,CACF;CAGD,MAAM,6BAAa,IAAI,KAAiD;AACxE,MAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,WAAW,WAAW,IAAI,EAAE,KAAK;AACvC,MAAI,CAAC,YAAY,EAAE,QAAQ,SAAS,MAClC,YAAW,IAAI,EAAE,MAAM;GAAE,OAAO,EAAE;GAAO,SAAS,EAAE;GAAS,CAAC;;CAOlE,MAAM,WAAW,IAAI,IAAY,WAAW,MAAM,CAAC;CACnD,IAAI,WAAW,IAAI,IAAY,WAAW,MAAM,CAAC;AAEjD,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC9B,MAAM,YAAY,MAAM,gBAAgB,SAAS,SAAS;EAC1D,MAAM,8BAAc,IAAI,KAAa;AACrC,OAAK,MAAM,KAAK,UACd,KAAI,CAAC,SAAS,IAAI,EAAE,EAAE;AACpB,YAAS,IAAI,EAAE;AACf,eAAY,IAAI,EAAE;;AAGtB,MAAI,YAAY,SAAS,EAAG;AAC5B,aAAW;;CAMb,MAAM,eAAe,MAAM,KAAK,WAAW,SAAS,CAAC,CAClD,MAAM,GAAG,MAAM,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CACvC,KAAK,CAAC,MAAM,WAAW;EAAE;EAAM,GAAG;EAAM,gBAAgB;EAAM,EAAE;CAEnE,MAAM,gBAAgB,MAAM,KAAK,SAAS,CAAC,QAAQ,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC;CAG5E,MAAM,qBAAqB,MAAM,QAAQ,IACvC,cAAc,KAAI,MAAK,QAAQ,eAAe,EAAE,CAAC,CAClD;CACD,MAAM,iBAAiB,cACpB,KAAK,MAAM,SAAS;EACnB;EACA,OAAO;EACP,SAAS;EACT,SAAS,mBAAmB,MAAM,gBAAgB;EAClD,gBAAgB;EACjB,EAAE,CACF,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,QAAQ;CAExC,MAAM,qBAAqB,KAAK,IAAI,QAAQ,aAAa,QAAQ,EAAE;CACnE,MAAM,oBAAoB,eAAe,MAAM,GAAG,mBAAmB;CAErE,MAAM,sBAAsB,aAAa,MAAM,GAAG,MAAM;CACxD,MAAM,gBAAgB,IAAI,IAAY,CACpC,GAAG,oBAAoB,KAAK,MAAM,EAAE,KAAK,EACzC,GAAG,kBAAkB,KAAK,MAAM,EAAE,KAAK,CACxC,CAAC;CAOF,MAAM,mBAAmB,MAAM,KAAK,cAAc;CAClD,MAAM,WAAW,MAAM,QAAQ,qBAAqB,iBAAiB;CACrE,MAAM,WAAW,IAAI,IAA2B,SAAS,KAAI,MAAK,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;CAE1F,MAAM,gBAAiD,EAAE;AAEzD,MAAK,MAAM,KAAK,qBAAqB;AACnC,MAAI,CAAC,cAAc,IAAI,EAAE,KAAK,CAAE;AAChC,gBAAc,KAAK;GACjB,MAAM,EAAE;GACR,OAAO,SAAS,IAAI,EAAE,KAAK,IAAI;GAC/B,SAAS,EAAE;GACX,OAAO,EAAE;GACT,QAAQ,cAAc,EAAE,KAAK;GAC9B,CAAC;;AAGJ,MAAK,MAAM,KAAK,kBACd,eAAc,KAAK;EACjB,MAAM,EAAE;EACR,OAAO,SAAS,IAAI,EAAE,KAAK,IAAI;EAC/B,SAAS,EAAE;EACX,OAAO;EACP,QAAQ,cAAc,EAAE,KAAK;EAC9B,CAAC;CAMJ,IAAI,cAAoC,EAAE;AAE1C,KAAI,cAAc,OAAO,GAAG;EAC1B,MAAM,WAAW,MAAM,KAAK,cAAc;EAC1C,MAAM,UAAU,IAAI,IAAI,SAAS;EAGjC,MAAM,WAAW,MAAM,QAAQ,uBAAuB,SAAS;EAG/D,MAAM,6BAAa,IAAI,KAAqB;AAC5C,OAAK,MAAM,QAAQ,SACjB,KAAI,KAAK,cAAc,QAAQ,IAAI,KAAK,WAAW,EAAE;GACnD,MAAM,MAAM,GAAG,KAAK,WAAW,KAAK,KAAK;AACzC,cAAW,IAAI,MAAM,WAAW,IAAI,IAAI,IAAI,KAAK,EAAE;;AAIvD,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY;GACnC,MAAM,CAAC,YAAY,cAAc,IAAI,MAAM,MAAM;AACjD,eAAY,KAAK;IACf,UAAU;IACV,QAAQ;IACR,YAAY,cAAc,WAAW;IACrC,UAAU,cAAc,WAAW;IACnC,UAAU;IACX,CAAC;;;CAON,MAAM,YAAY,IAAI,IAAY,cAAc,KAAK,MAAM,EAAE,OAAO,CAAC;CACrE,MAAM,UAAU,MAAM,KAAK,UAAU,CAAC,MAAM;CAE5C,MAAM,yBAAyB,YAAY,QACxC,MAAM,EAAE,eAAe,EAAE,SAC3B;CAKD,MAAM,eAAe,cAClB,KAAK,GAAG,MAAM;EACb,MAAM,QAAQ,EAAE,QAAQ,IAAI,EAAE,MAAM,KAAK;EACzC,MAAM,SAAS,EAAE;EACjB,MAAM,aAAa,EAAE,QAAQ,IAAI,gBAAgB,EAAE,MAAM,QAAQ,EAAE,CAAC,KAAK;EACzE,MAAM,UAAU,EAAE,QAAQ,MAAM,CAAC,MAAM,GAAG,IAAI;AAC9C,SAAO,GAAG,IAAI,EAAE,KAAK,OAAO,IAAI,QAAQ,WAAW,aAAa,EAAE,KAAK,QAAQ,QAAQ;GACvF,CACD,KAAK,OAAO;CAEf,MAAM,oBACJ,uBAAuB,SAAS,IAC5B,uBACG,KACE,MACC,MAAM,EAAE,SAAS,KAAK,EAAE,WAAW,OAAO,EAAE,OAAO,KAAK,EAAE,SAAS,eAAe,EAAE,SAAS,GAChG,CACA,KAAK,KAAK,GACb;CAEN,MAAM,aAAa,QAAQ,KAAK,KAAK;AAgCrC,QAAO;EACL;EACA,aAAa;EACb;EACA,iBAlCsB;;YAEd,KAAK,SAAS;;;;kBAIR,cAAc,OAAO,gBAAgB,QAAQ,OAAO,cAAc,WAAW;;EAE7F,aAAa;;;;;;EAMb,kBAAkB;;;;;;;;;gFAS4D,WAAW;;;;;;EAYxF;;;;;AC5UH,MAAMC,eAAa;AAInB,SAASC,eAAa,WAA2B;CAC/C,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,QAAO,MAAM,SAAS,IAAI,MAAM,KAAK;;AAGvC,SAAS,cAAc,QAAsC;CAC3D,MAAM,6BAAa,IAAI,KAAqB;AAC5C,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,CAAC,MAAO;EACZ,MAAM,QAAQ,MACX,aAAa,CACb,QAAQ,gBAAgB,IAAI,CAC5B,MAAM,MAAM,CACZ,QAAQ,MAAM,EAAE,SAAS,KAAK,CAACC,aAAW,IAAI,EAAE,CAAC;AACpD,OAAK,MAAM,QAAQ,MACjB,YAAW,IAAI,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,EAAE;;AAIzD,QADe,CAAC,GAAG,WAAW,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAEjE,MAAM,GAAG,EAAE,CACX,KAAK,CAAC,OAAO,EAAE,CACf,KAAK,MAAM;;AAGhB,eAAe,mBAAmB,SAAyB,OAAkC;AAC3F,KAAI,MAAM,SAAS,EAAG,QAAO;CAC7B,MAAM,aAAc,MAAM,UAAU,MAAM,SAAS,KAAM;CACzD,MAAM,UAAU,IAAI,IAAI,MAAM;CAC9B,IAAI,cAAc;AAElB,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,MAAM,QAAQ,mBAAmB,KAAK;AACpD,OAAK,MAAM,QAAQ,MACjB,KAAI,KAAK,cAAc,QAAQ,IAAI,KAAK,WAAW,CACjD;;CAMN,MAAM,cAAc,cAAc;AAClC,QAAO,KAAK,IAAI,GAAG,cAAc,WAAW;;AAU9C,SAAS,kBAAkB,YAA0C;AACnE,KAAI,WAAW,WAAW,EAAG,QAAO,IAAI,aAAa,EAAE;CACvD,MAAM,MAAM,WAAW,GAAG;CAC1B,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,MAAM,OAAO,WAChB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,MAAM,IAAI;CAGlB,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,KAAK,IAAI,KAAK,WAAW;AAE/B,QAAO;;;;;;AAOT,eAAsB,aACpB,SACA,MACsB;CACtB,MAAM,eAAe,KAAK,gBAAgB;CAC1C,MAAM,iBAAiB,KAAK,kBAAkB;CAC9C,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,sBAAsB,KAAK,uBAAuB;CAExD,MAAM,MAAM,KAAK,KAAK;CACtB,MAAM,OAAO,MAAM,eAAe;CAIlC,MAAM,eADc,MAAM,QAAQ,oBAAoB,KAAK,EAC3B,KAAI,OAAM;EAAE,YAAY,EAAE;EAAW,OAAO,EAAE;EAAO,YAAY,EAAE;EAAW,EAAE;CAGhH,MAAM,YAAY,MAAM,QAAQ,wBAAwB,KAAK,gBAAgBF,aAAW;CAExF,MAAM,mCAAmB,IAAI,KAA6B;AAC1D,MAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,MAAM,iBAAiB,IAAI,IAAI,KAAK;AAC1C,MAAI,CAAC,IACH,kBAAiB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC;MAErC,KAAI,KAAK,IAAI;;CAIjB,MAAM,iCAAiB,IAAI,KAA2B;AACtD,MAAK,MAAM,CAAC,MAAM,SAAS,iBACzB,gBAAe,IAAI,MAAM,kBAAkB,KAAK,CAAC;CAInD,MAAM,WAA0B,EAAE;AAClC,MAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,YAAY,eAAe,IAAI,KAAK,WAAW;AACrD,MAAI,CAAC,UAAW;AAChB,WAAS,KAAK;GACZ,OAAO,CAAC,KAAK,WAAW;GACxB,QAAQ,CAAC,KAAK,MAAM;GACpB,YAAY,CAAC,KAAK,WAAW;GAC7B,UAAU;GACX,CAAC;;CAGJ,MAAM,qBAAqB,SAAS;CAIpC,IAAI,SAAS;AACb,QAAO,UAAU,SAAS,SAAS,GAAG;AACpC,WAAS;EACT,IAAI,UAAU;EACd,IAAI,QAAQ;EACZ,IAAI,QAAQ;AAEZ,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,MAAK,IAAI,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GAC5C,MAAM,MAAM,iBAAiB,SAAS,GAAG,UAAU,SAAS,GAAG,SAAS;AACxE,OAAI,MAAM,SAAS;AACjB,cAAU;AACV,YAAQ;AACR,YAAQ;;;AAKd,MAAI,UAAU,GAAI;EAGlB,MAAM,KAAK,SAAS;EACpB,MAAM,KAAK,SAAS;EACpB,MAAM,cAAc,CAAC,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM;EAC9C,MAAM,eAAe,CAAC,GAAG,GAAG,QAAQ,GAAG,GAAG,OAAO;EACjD,MAAM,mBAAmB,CAAC,GAAG,GAAG,YAAY,GAAG,GAAG,WAAW;EAG7D,MAAM,mBAAmC,EAAE;AAC3C,OAAK,MAAM,KAAK,aAAa;GAC3B,MAAM,MAAM,eAAe,IAAI,EAAE;AACjC,OAAI,IAAK,kBAAiB,KAAK,IAAI;;AAGrC,WAAS,SAAS;GAChB,OAAO;GACP,QAAQ;GACR,YAAY;GACZ,UAAU,kBAAkB,iBAAiB;GAC9C;AAED,WAAS,OAAO,OAAO,EAAE;AACzB,WAAS;;CAIX,MAAM,SAAyB,EAAE;CACjC,IAAI,eAAe;AAEnB,MAAK,MAAM,WAAW,UAAU;AAC9B,MAAI,QAAQ,MAAM,SAAS,eAAgB;EAE3C,MAAM,QAAQ,cAAc,QAAQ,OAAO,IAAI,SAAS,eAAe;EACvE,MAAM,aACJ,QAAQ,WAAW,QAAQ,KAAK,MAAM,MAAM,GAAG,EAAE,GAAG,QAAQ,WAAW;EAGzE,MAAM,kBADgB,IAAI,IAAI,QAAQ,MAAM,IAAIC,eAAa,CAAC,CACxB,OAAO,QAAQ,MAAM;EAE3D,MAAM,cAAc,MAAM,mBAAmB,SAAS,QAAQ,MAAM;EACpE,MAAM,mBAAmB,cAAc,MAAO,QAAQ,MAAM,UAAU;AAEtE,SAAO,KAAK;GACV,IAAI;GACJ;GACA,OAAO,QAAQ,MAAM,KAAK,MAAM,SAAS;IACvC;IACA,OAAO,QAAQ,OAAO;IACvB,EAAE;GACH,MAAM,QAAQ,MAAM;GACpB;GACA;GACA;GACA;GACD,CAAC;;AAIJ,QAAO,MACJ,GAAG,MACF,EAAE,OAAO,EAAE,mBAAmB,EAAE,aAAa,OAC7C,EAAE,OAAO,EAAE,mBAAmB,EAAE,aAAa,KAChD;AAED,QAAO;EACL,QAAQ,OAAO,MAAM,GAAG,UAAU;EAClC;EACA,YAAY;GAAE;GAAM,IAAI;GAAK;EAC9B;;;;;ACxNH,SAAS,gBAAgB,OAAiB,OAA0D;AAClG,KAAI,MAAM,WAAW,EAAG,QAAO;CAE/B,MAAM,yBAAS,IAAI,KAAqB;CACxC,MAAM,uBAAO,IAAI,KAAqB;AAEtC,MAAK,MAAM,KAAK,OAAO;AACrB,SAAO,IAAI,GAAG,EAAE;AAChB,OAAK,IAAI,GAAG,EAAE;;CAGhB,SAAS,KAAK,GAAmB;EAC/B,IAAI,OAAO;AACX,SAAO,OAAO,IAAI,KAAK,KAAK,KAC1B,QAAO,OAAO,IAAI,KAAK;EAEzB,IAAI,UAAU;AACd,SAAO,YAAY,MAAM;GACvB,MAAM,OAAO,OAAO,IAAI,QAAQ;AAChC,UAAO,IAAI,SAAS,KAAK;AACzB,aAAU;;AAEZ,SAAO;;CAGT,SAAS,MAAM,GAAW,GAAiB;EACzC,MAAM,KAAK,KAAK,EAAE;EAClB,MAAM,KAAK,KAAK,EAAE;AAClB,MAAI,OAAO,GAAI;EACf,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;EAC9B,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;AAC9B,MAAI,QAAQ,MACV,QAAO,IAAI,IAAI,GAAG;WACT,QAAQ,MACjB,QAAO,IAAI,IAAI,GAAG;OACb;AACL,UAAO,IAAI,IAAI,GAAG;AAClB,QAAK,IAAI,IAAI,QAAQ,EAAE;;;AAI3B,MAAK,MAAM,EAAE,QAAQ,YAAY,MAC/B,KAAI,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,CAC1C,OAAM,QAAQ,OAAO;CAIzB,MAAM,wBAAQ,IAAI,KAAa;AAC/B,MAAK,MAAM,KAAK,MACd,OAAM,IAAI,KAAK,EAAE,CAAC;AAEpB,QAAO,MAAM;;;;;AAMf,eAAsB,aAAa,SAAyB,MAA6C;CACvG,MAAM,UAAU,QAAQ,EAAE;CAC1B,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,UAAU,QAAQ,WAAW;EAAC;EAAc;EAAW;EAAgB;EAAmB;CAEhG,MAAM,aAAa,KAAK,KAAK;CAG7B,IAAI,aAAa;AACjB,KAAI,UAAU,OACZ,cAAa,MAAM,QAAQ,iBAAiB;UACnC,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,eAAa,MAAM,QAAQ,0BAA0B,OAAO;QACvD;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,eAAa,MAAM,QAAQ,qBAAqB,OAAO;;CAIzD,IAAI,aAAa;AACjB,KAAI,UAAU,OAGZ,eADc,MAAM,QAAQ,mBAAmB,EAC5B;UACV,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,eAAa,MAAM,QAAQ,0BAA0B,OAAO;QACvD;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,eAAa,MAAM,QAAQ,qBAAqB,OAAO;;CAIzD,IAAI,YAAwB,EAAE;AAC9B,KAAI,QAAQ,SAAS,aAAa,CAChC,KAAI,UAAU,OACZ,aAAY,MAAM,QAAQ,6BAA6B;UAC9C,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,cAAY,MAAM,QAAQ,uBAAuB,OAAO;QACnD;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,cAAY,MAAM,QAAQ,kBAAkB,OAAO;;CAKvD,IAAI,UAAoB,EAAE;AAC1B,KAAI,QAAQ,SAAS,UAAU,CAC7B,KAAI,UAAU,OAEZ,YADmB,MAAM,QAAQ,YAAY,EACxB,KAAI,MAAK,EAAE,UAAU;UACjC,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,YAAU,MAAM,QAAQ,qBAAqB,OAAO;QAC/C;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,YAAU,MAAM,QAAQ,gBAAgB,OAAO;;CAKnD,IAAI,uBAAuB;AAC3B,KAAI,QAAQ,SAAS,eAAe,EAAE;EACpC,IAAI;EACJ,IAAI;AAEJ,MAAI,UAAU,OACZ,EAAC,UAAU,YAAY,MAAM,QAAQ,IAAI,CACvC,QAAQ,sBAAsB,EAC9B,QAAQ,mBAAmB,CAC5B,CAAC;WACO,UAAU,WAAW;GAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,IAAC,UAAU,YAAY,MAAM,QAAQ,IAAI,CACvC,QAAQ,4BAA4B,OAAO,EAC3C,QAAQ,4BAA4B,OAAO,CAC5C,CAAC;SACG;GAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,IAAC,UAAU,YAAY,MAAM,QAAQ,IAAI,CACvC,QAAQ,uBAAuB,OAAO,EACtC,QAAQ,uBAAuB,OAAO,CACvC,CAAC;;AAGJ,yBAAuB,gBAAgB,UAAU,SAAS;;CAI5D,IAAI,kBAA4B,EAAE;AAClC,KAAI,QAAQ,SAAS,mBAAmB,CACtC,KAAI,UAAU,OACZ,mBAAkB,MAAM,QAAQ,oBAAoB;UAC3C,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,oBAAkB,MAAM,QAAQ,6BAA6B,OAAO;QAC/D;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,oBAAkB,MAAM,QAAQ,wBAAwB,OAAO;;CAOnE,IAAI;AACJ,KAAI,UAAU,OACZ,KAAI;EAEF,MAAM,cAAc,MAAM,QAAQ,sBAAsB;EACxD,MAAM,aAAa,KAAK,IAAI,YAAY,QAAQ,IAAI;EACpD,MAAM,UAAU,YAAY,MAAM,GAAG,WAAW;EAChD,IAAI,YAAY;EAChB,IAAI,WAAW;EACf,IAAI,YAAY;AAChB,OAAK,MAAM,QAAQ,SAAS;GAC1B,MAAM,QAAQ,MAAM,QAAQ,mBAAmB,KAAK;AACpD,QAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,IAAI,KAAK,cAAc;AAC7B,QAAI,MAAM,YAAa;aACd,MAAM,WAAY;QACtB;;;EAIT,MAAM,SAAS,YAAY,SAAS,IAAI,YAAY,SAAS,aAAa;AAC1E,mBAAiB;GACf,WAAW,KAAK,MAAM,YAAY,OAAO;GACzC,UAAU,KAAK,MAAM,WAAW,OAAO;GACvC,WAAW,KAAK,MAAM,YAAY,OAAO;GAC1C;SACK;CAMV,MAAM,YAAY,aAAa,IAAI,UAAU,SAAS,aAAa;CACnE,MAAM,cAAc,aAAa,IAAI,QAAQ,SAAS,aAAa;CACnE,MAAM,eAAe,aAAa,IAAI,gBAAgB,SAAS,aAAa;CAC5E,MAAM,cAAc,KAAK,MACvB,OAAO,IAAI,cAAc,IAAI,cAAc,OAAQ,IAAI,eAAe,IACvE;AAED,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD;;;;;ACpOH,MAAM,aAAa;AACnB,MAAM,kBAAkB;AACxB,MAAM,aAAa;AACnB,MAAM,kBAAkB;AAIxB,SAAS,0BAA0B,OAA8B;CAC/D,MAAM,uBAAO,IAAI,KAAa;AAC9B,MAAK,MAAM,QAAQ,OAAO;EAExB,MAAM,QAAQ,KAAK,MAAM,wCAAwC;AACjE,MAAI,CAAC,MAAO;EAEZ,MAAM,QADQ,MAAM,GACA,MAAM,KAAK;AAC/B,OAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,WAAW,KAAK,MAAM,qBAAqB;AACjD,OAAI,UAAU;IACZ,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa;AAC5C,QAAI,IAAK,MAAK,IAAI,IAAI;;;;AAI5B,QAAO;;AAGT,SAAS,kBAAkB,GAAgB,GAAwB;AACjE,KAAI,EAAE,SAAS,KAAK,EAAE,SAAS,EAAG,QAAO;CACzC,IAAI,eAAe;AACnB,MAAK,MAAM,OAAO,EAChB,KAAI,EAAE,IAAI,IAAI,CAAE;CAElB,MAAM,QAAQ,EAAE,OAAO,EAAE,OAAO;AAChC,QAAO,UAAU,IAAI,IAAI,eAAe;;AAG1C,SAAS,YACP,eACA,UACA,eACA,eACQ;CACR,MAAM,UAAmD;EACvD;GAAE,OAAO,yBAAyB,cAAc,QAAQ,EAAE,CAAC;GAAI,OAAO,gBAAgB;GAAiB;EACvG;GAAE,OAAO,gBAAgB,SAAS,QAAQ,EAAE,CAAC;GAAY,OAAO,WAAW;GAAY;EACvF;GAAE,OAAO,aAAa,cAAc,oBAAoB,kBAAkB,IAAI,MAAM;GAAM,OAAO,gBAAgB;GAAiB;EACnI;AACD,SAAQ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AACzC,QAAO,QAAQ,GAAG;;AAGpB,SAAS,kBAAkB,WAA2B;CACpD,MAAM,OAAO,SAAS,UAAU;AAEhC,QAAO,KADM,KAAK,SAAS,MAAM,GAAG,KAAK,MAAM,GAAG,GAAG,GAAG,KACvC;;;;;;AAOnB,eAAsB,cACpB,SACA,MACuB;CACvB,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,gBAAgB,KAAK,iBAAiB;CAG5C,MAAM,gBAAgB,MAAM,QAAQ,mBAAmB,KAAK,SAAS;CACrE,MAAM,cAAc,IAAI,IAAI,cAAc,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB,CAAC;CAG9G,MAAM,YAAY,MAAM,QAAQ,wBAAwB,KAAK,gBAAgB,WAAW;CAExF,MAAM,yBAAS,IAAI,KAAmD;AACtE,MAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,QAAQ,OAAO,IAAI,IAAI,KAAK;AAClC,MAAI,CAAC,MACH,QAAO,IAAI,IAAI,MAAM;GAAE,KAAK,IAAI,aAAa,IAAI;GAAE,OAAO;GAAG,CAAC;OACzD;AACL,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,OAAM,IAAI,MAAM,IAAI;AAEtB,SAAM;;;CAIV,MAAM,gCAAgB,IAAI,KAA2B;AACrD,MAAK,MAAM,CAAC,MAAM,EAAE,KAAK,YAAY,QAAQ;EAC3C,MAAM,MAAM,IAAI,aAAa,IAAI,OAAO;AACxC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,KAAK,IAAI,KAAK;AAEpB,gBAAc,IAAI,MAAM,IAAI;;AAE9B,eAAc,OAAO,KAAK,SAAS;CAGnC,MAAM,kBAAkB,cAAc,IAAI,KAAK,SAAS,IAAI;CAI5D,MAAM,aAAa,2BADM,MAAM,QAAQ,iBAAiB,KAAK,gBAAgB,KAAK,UAAU,EAAE,EAChC,KAAI,MAAK,EAAE,KAAK,CAAC;CAI/E,MAAM,iBADc,MAAM,QAAQ,mBAAmB,KAAK,SAAS,EACjC,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB;CAErG,MAAM,mCAAmB,IAAI,KAAqB;AAClD,MAAK,MAAM,UAAU,eAAe;EAClC,MAAM,cAAc,MAAM,QAAQ,mBAAmB,OAAO;AAC5D,OAAK,MAAM,QAAQ,YACjB,KAAI,KAAK,cAAc,KAAK,eAAe,KAAK,SAC9C,kBAAiB,IAAI,KAAK,aAAa,iBAAiB,IAAI,KAAK,WAAW,IAAI,KAAK,EAAE;;CAI7F,MAAM,iBAAiB,KAAK,IAAI,GAAG,GAAG,iBAAiB,QAAQ,CAAC;CAGhE,MAAM,WAAW,MAAM,QAAQ,kBAAkB;CAEjD,MAAM,cAA4B,EAAE;AAEpC,MAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,aAAa,QAAQ;EAC3B,MAAM,QAAQ,QAAQ;AAEtB,MAAI,eAAe,KAAK,SAAU;AAClC,MAAI,iBAAiB,YAAY,IAAI,WAAW,CAAE;EAGlD,IAAI,gBAAgB;AACpB,MAAI,iBAAiB;GACnB,MAAM,qBAAqB,cAAc,IAAI,WAAW;AACxD,OAAI,mBACF,iBAAgB,KAAK,IAAI,GAAG,iBAAiB,iBAAiB,mBAAmB,CAAC;;EAKtF,IAAI,WAAW;AACf,MAAI,cAAc,IAAI,WAAW,CAG/B,YAAW,kBAAkB,YADP,2BADM,MAAM,QAAQ,iBAAiB,KAAK,gBAAgB,YAAY,EAAE,EAC1B,KAAI,MAAK,EAAE,KAAK,CAAC,CAC9B;EAIzD,MAAM,cAAc,iBAAiB,IAAI,WAAW,IAAI;EACxD,MAAM,gBAAgB,cAAc;EAEpC,MAAM,QACJ,kBAAkB,gBAClB,aAAa,WACb,kBAAkB;AAGpB,MAAI,SAAS,EAAG;EAEhB,MAAM,SAAS,YAAY,eAAe,UAAU,eAAe,YAAY;AAE/E,cAAY,KAAK;GACf,MAAM;GACN;GACA;GACA;GACA;GACA;GACA;GACA,mBAAmB,kBAAkB,WAAW;GACjD,CAAC;;AAGJ,aAAY,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AAC7C,QAAO,YAAY,MAAM,GAAG,MAAM;;;;;;ACpKpC,MAAM,sBAAsB;CAC1B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD;AAED,SAAS,iBAAiB,OAAsB,MAAuB;CACrE,MAAM,OAAO,SAAS;AACtB,QAAO,oBAAoB,MAAM,YAAY,QAAQ,KAAK,KAAK,CAAC;;;;;;AAOlE,eAAsB,eACpB,SACA,MACwB;CACxB,MAAM,QAAQ,MAAM,SAAS;CAC7B,MAAM,aAAa,MAAM,cAAc;CAGvC,MAAM,YAAY,MAAM,QAAQ,mBAAmB;CAGnD,MAAM,gCAAgB,IAAI,KAAqB;CAC/C,MAAM,iCAAiB,IAAI,KAAqB;AAEhD,MAAK,MAAM,EAAE,aAAa,iBAAiB,WAAW;AACpD,gBAAc,IAAI,cAAc,cAAc,IAAI,YAAY,IAAI,KAAK,EAAE;AACzE,iBAAe,IAAI,cAAc,eAAe,IAAI,YAAY,IAAI,KAAK,EAAE;;CAI7E,MAAM,WAAW,MAAM,QAAQ,kBAAkB;CACjD,MAAM,2BAAW,IAAI,KAA4B;AACjD,MAAK,MAAM,KAAK,SACd,UAAS,IAAI,EAAE,WAAW,EAAE,MAAM;CAGpC,MAAM,kBAAkB,SAAS;CAGjC,MAAM,cAAc,SAAS,KAAK,MAAM,cAAc,IAAI,EAAE,UAAU,IAAI,EAAE;AAC5E,aAAY,MAAM,GAAG,MAAM,IAAI,EAAE;CACjC,MAAM,gBACJ,YAAY,SAAS,IACjB,YAAY,KAAK,MAAM,YAAY,SAAS,EAAE,IAC9C;CAGN,MAAM,aAAwB,EAAE;AAEhC,MAAK,MAAM,CAAC,MAAM,YAAY,eAAe;AAC3C,MAAI,UAAU,WAAY;EAE1B,MAAM,QAAQ,SAAS,IAAI,KAAK,IAAI;AACpC,MAAI,iBAAiB,OAAO,KAAK,CAAE;EAEnC,MAAM,WAAW,eAAe,IAAI,KAAK,IAAI;EAC7C,MAAM,cAAc,UAAU;EAC9B,MAAM,eAAe,cAAc,IAAI,UAAU,cAAc;AAE/D,aAAW,KAAK;GACd;GACA;GACA,cAAc;GACd,eAAe;GACf,cAAc,KAAK,MAAM,eAAe,IAAK,GAAG;GACjD,CAAC;;AAIJ,YAAW,MAAM,GAAG,MAAM,EAAE,eAAe,EAAE,aAAa;AAE1D,QAAO;EACL,UAAU,WAAW,MAAM,GAAG,MAAM;EACpC;EACA;EACD;;;;;ACvDH,SAAS,qBACP,OACO;CACP,MAAM,sBAAM,IAAI,KAAkC;CAClD,MAAM,0BAAU,IAAI,KAAa;CAEjC,SAAS,YAAY,MAAmC;EACtD,IAAI,IAAI,IAAI,IAAI,KAAK;AACrB,MAAI,CAAC,GAAG;AACN,uBAAI,IAAI,KAAK;AACb,OAAI,IAAI,MAAM,EAAE;;AAElB,UAAQ,IAAI,KAAK;AACjB,SAAO;;CAGT,IAAI,cAAc;AAElB,MAAK,MAAM,EAAE,aAAa,iBAAiB,OAAO;AAChD,MAAI,gBAAgB,YAAa;EAEjC,MAAM,OAAO,YAAY,YAAY;EACrC,MAAM,OAAO,YAAY,YAAY;AAGrC,OAAK,IAAI,cAAc,KAAK,IAAI,YAAY,IAAI,KAAK,EAAE;AACvD,OAAK,IAAI,cAAc,KAAK,IAAI,YAAY,IAAI,KAAK,EAAE;AACvD,iBAAe;;CAIjB,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAK,MAAM,CAAC,MAAM,cAAc,KAAK;EACnC,IAAI,IAAI;AACR,OAAK,MAAM,KAAK,UAAU,QAAQ,CAAE,MAAK;AACzC,SAAO,IAAI,MAAM,EAAE;;AAGrB,QAAO;EACL,OAAO,MAAM,KAAK,QAAQ;EAC1B;EACA;EACA;EACD;;;;;;AAOH,SAAS,cACP,OACA,WACA,YACS;CACT,MAAM,KAAK,IAAI,MAAM;AACrB,KAAI,OAAO,EAAG,QAAO;CAGrB,MAAM,qCAAqB,IAAI,KAAqB;CAEpD,MAAM,0CAA0B,IAAI,KAAqB;AAEzD,MAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,MAAM,IAAI,UAAU,IAAI,KAAK;AAC7B,qBAAmB,IAAI,IAAI,mBAAmB,IAAI,EAAE,IAAI,MAAM,MAAM,OAAO,IAAI,KAAK,IAAI,GAAG;;AAI7F,MAAK,MAAM,CAAC,MAAM,cAAc,MAAM,KAAK;EACzC,MAAM,KAAK,UAAU,IAAI,KAAK;AAC9B,OAAK,MAAM,CAAC,UAAU,WAAW,UAC/B,KAAI,UAAU,IAAI,SAAS,KAAK,GAC9B,yBAAwB,IAAI,KAAK,wBAAwB,IAAI,GAAG,IAAI,KAAK,OAAO;;AAKtF,MAAK,MAAM,CAAC,GAAG,MAAM,wBACnB,yBAAwB,IAAI,GAAG,IAAI,EAAE;CAGvC,IAAI,WAAW;CAEf,MAAM,WAAW,CAAC,GAAG,MAAM,MAAM;AACjC,MAAK,IAAI,IAAI,SAAS,SAAS,GAAG,IAAI,GAAG,KAAK;EAC5C,MAAM,IAAI,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,GAAG;AAC7C,GAAC,SAAS,IAAI,SAAS,MAAM,CAAC,SAAS,IAAI,SAAS,GAAG;;AAGzD,MAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,cAAc,UAAU,IAAI,KAAK;EACvC,MAAM,KAAK,MAAM,OAAO,IAAI,KAAK,IAAI;EACrC,MAAM,YAAY,MAAM,IAAI,IAAI,KAAK,oBAAI,IAAI,KAAK;EAGlD,MAAM,+BAAe,IAAI,KAAqB;AAC9C,OAAK,MAAM,CAAC,UAAU,WAAW,WAAW;GAC1C,MAAM,KAAK,UAAU,IAAI,SAAS;AAClC,gBAAa,IAAI,KAAK,aAAa,IAAI,GAAG,IAAI,KAAK,OAAO;;AAI5D,qBAAmB,IAAI,cAAc,mBAAmB,IAAI,YAAY,IAAI,KAAK,GAAG;EACpF,MAAM,kBAAkB,aAAa,IAAI,YAAY,IAAI;AACzD,0BAAwB,IACtB,cACC,wBAAwB,IAAI,YAAY,IAAI,KAAK,gBACnD;EAGD,IAAI,WAAW;EACf,IAAI,YAAY;AAEhB,OAAK,MAAM,CAAC,eAAe,sBAAsB,cAAc;GAG7D,MAAM,QAAQ,oBAAoB,cAAc,MAF/B,mBAAmB,IAAI,cAAc,IAAI,MAEO;AACjE,OAAI,QAAQ,WAAW;AACrB,gBAAY;AACZ,eAAW;;;AAMf,YAAU,IAAI,MAAM,SAAS;AAC7B,qBAAmB,IAAI,WAAW,mBAAmB,IAAI,SAAS,IAAI,KAAK,GAAG;EAC9E,MAAM,eAAe,aAAa,IAAI,SAAS,IAAI;AACnD,0BAAwB,IACtB,WACC,wBAAwB,IAAI,SAAS,IAAI,KAAK,aAChD;AAED,MAAI,aAAa,YACf,YAAW;;AAIf,QAAO;;;;;AAMT,SAAS,kBACP,OACA,WACA,YACQ;CACR,MAAM,KAAK,IAAI,MAAM;AACrB,KAAI,OAAO,EAAG,QAAO;CAErB,IAAI,IAAI;AACR,MAAK,MAAM,CAAC,MAAM,cAAc,MAAM,KAAK;EACzC,MAAM,KAAK,UAAU,IAAI,KAAK;EAC9B,MAAM,KAAK,MAAM,OAAO,IAAI,KAAK,IAAI;AAErC,OAAK,MAAM,CAAC,UAAU,WAAW,UAC/B,KAAI,UAAU,IAAI,SAAS,KAAK,GAC9B,MAAK,SAAS,cAAc,MAAM,MAAM,OAAO,IAAI,SAAS,IAAI,MAAM;;AAI5E,QAAO,IAAI;;;;;AAMb,SAAS,WACP,OACA,YACqB;CAErB,MAAM,4BAAY,IAAI,KAAqB;CAC3C,IAAI,WAAW;AACf,MAAK,MAAM,QAAQ,MAAM,MACvB,WAAU,IAAI,MAAM,WAAW;CAIjC,MAAM,iBAAiB;AACvB,MAAK,IAAI,OAAO,GAAG,OAAO,gBAAgB,OAExC,KAAI,CADa,cAAc,OAAO,WAAW,WAAW,CAC7C;CAIjB,MAAM,4BAAY,IAAI,KAAqB;CAC3C,IAAI,WAAW;AACf,MAAK,MAAM,GAAG,MAAM,UAClB,KAAI,CAAC,UAAU,IAAI,EAAE,CACnB,WAAU,IAAI,GAAG,WAAW;AAGhC,MAAK,MAAM,CAAC,MAAM,MAAM,UACtB,WAAU,IAAI,MAAM,UAAU,IAAI,EAAE,CAAE;AAGxC,QAAO;;AAOT,MAAM,aAAa,IAAI,IAAI;CACzB;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAC/D;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAC/D;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAAO;CAC/D;CAAO;CAAO;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAC9D;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAChE;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAS;CAAS;CAAQ;CAClE;CAAQ;CAAQ;CAAS;CAAQ;CAClC,CAAC;AAEF,SAAS,uBAAuB,QAAsC;CACpE,MAAM,6BAAa,IAAI,KAAqB;AAC5C,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,CAAC,MAAO;EACZ,MAAM,QAAQ,MACX,aAAa,CACb,QAAQ,gBAAgB,IAAI,CAC5B,MAAM,MAAM,CACZ,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC;AACpD,OAAK,MAAM,QAAQ,MACjB,YAAW,IAAI,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,EAAE;;AAIzD,QADe,CAAC,GAAG,WAAW,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAEjE,MAAM,GAAG,EAAE,CACX,KAAK,CAAC,OAAO,EAAE,CACf,KAAK,MAAM,IAAI;;AAGpB,SAAS,aAAa,MAAsB;CAC1C,MAAM,QAAQ,KAAK,QAAQ,IAAI;AAC/B,QAAO,UAAU,KAAK,OAAO,KAAK,MAAM,GAAG,MAAM;;;;;;AAWnD,eAAsB,kBACpB,SACA,MAC0B;CAC1B,MAAM,UAAU,MAAM,WAAW;CACjC,MAAM,iBAAiB,MAAM,kBAAkB;CAC/C,MAAM,aAAa,MAAM,cAAc;CAIvC,MAAM,QAAQ,qBADI,MAAM,QAAQ,mBAAmB,CACN;AAE7C,KAAI,MAAM,MAAM,WAAW,EACzB,QAAO;EACL,aAAa,EAAE;EACf,YAAY;EACZ,YAAY;EACZ,YAAY;EACb;CAIH,MAAM,eAAe,WAAW,OAAO,WAAW;CAGlD,MAAM,aAAa,kBAAkB,OAAO,cAAc,WAAW;CAGrE,MAAM,yBAAS,IAAI,KAAuB;AAC1C,MAAK,MAAM,CAAC,MAAM,SAAS,cAAc;EACvC,MAAM,MAAM,OAAO,IAAI,KAAK;AAC5B,MAAI,IAAK,KAAI,KAAK,KAAK;MAClB,QAAO,IAAI,MAAM,CAAC,KAAK,CAAC;;CAI/B,MAAM,WAAW,MAAM,QAAQ,kBAAkB;CACjD,MAAM,2BAAW,IAAI,KAA4B;AACjD,MAAK,MAAM,KAAK,SACd,UAAS,IAAI,EAAE,WAAW,EAAE,MAAM;CAIpC,MAAM,cAA2B,EAAE;CACnC,IAAI,SAAS;AAEb,MAAK,MAAM,GAAG,YAAY,QAAQ;AAChC,MAAI,QAAQ,SAAS,QAAS;EAE9B,MAAM,YAAY,IAAI,IAAI,QAAQ;EAElC,MAAM,QAAQ,uBADC,QAAQ,KAAK,MAAM,SAAS,IAAI,EAAE,IAAI,KAAK,CACd;EAG5C,MAAM,QAAyB,QAAQ,KAAK,SAAS;GACnD,MAAM,YAAY,MAAM,IAAI,IAAI,KAAK,oBAAI,IAAI,KAAK;GAClD,IAAI,cAAc;AAClB,QAAK,MAAM,CAAC,UAAU,WAAW,UAC/B,KAAI,UAAU,IAAI,SAAS,CAAE,gBAAe;AAE9C,UAAO;IACL;IACA,OAAO,SAAS,IAAI,KAAK,IAAI;IAC7B,gBAAgB;IACjB;IACD;AAGF,QAAM,MAAM,GAAG,MAAM,EAAE,iBAAiB,EAAE,eAAe;EAGzD,IAAI,gBAAgB;AACpB,OAAK,MAAM,QAAQ,MACjB,kBAAiB,KAAK;AAExB,mBAAiB;EACjB,MAAM,gBAAiB,QAAQ,UAAU,QAAQ,SAAS,KAAM;EAChE,MAAM,WAAW,gBAAgB,IAAI,KAAK,MAAO,gBAAgB,gBAAiB,IAAK,GAAG,MAAO;EAGjG,MAAM,+BAAe,IAAI,KAAqB;AAC9C,OAAK,MAAM,QAAQ,SAAS;GAC1B,MAAM,SAAS,aAAa,KAAK;AACjC,gBAAa,IAAI,SAAS,aAAa,IAAI,OAAO,IAAI,KAAK,EAAE;;EAE/D,MAAM,aAAa,CAAC,GAAG,aAAa,SAAS,CAAC,CAC3C,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAC3B,MAAM,GAAG,EAAE,CACX,KAAK,CAAC,OAAO,EAAE;AAElB,cAAY,KAAK;GACf,IAAI;GACJ;GACA;GACA,MAAM,QAAQ;GACd;GACA;GACD,CAAC;;AAIJ,aAAY,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,KAAK;AAE3C,QAAO;EACL,aAAa,YAAY,MAAM,GAAG,eAAe;EACjD,YAAY,MAAM,MAAM;EACxB,YAAY,MAAM;EAClB,YAAY,KAAK,MAAM,aAAa,IAAM,GAAG;EAC9C"}

package/dist/{zettelkasten-G0-ZTybr.mjs → zettelkasten-DtkAvA18.mjs}

@@ -1,5 +1,7 @@
-import "./embeddings-DMVzpvRZ.mjs";
-import { r as saveQueryResult } from "./query-feedback-BPdapXKd.mjs";
-import { a as zettelThemes, c as zettelExplore, i as zettelHealth, n as zettelGodNotes, o as zettelConverse, r as zettelSuggest, s as zettelSurprise, t as zettelCommunities } from "./zettelkasten-BRIaHzFm.mjs";
+import "./config-DjZELvoA.mjs";
+import "./embedding-gate-DqbKvn56.mjs";
+import "./embeddings-BUjZMD9F.mjs";
+import { r as saveQueryResult } from "./query-feedback-GPeVGvIa.mjs";
+import { a as zettelThemes, c as zettelExplore, i as zettelHealth, n as zettelGodNotes, o as zettelConverse, r as zettelSuggest, s as zettelSurprise, t as zettelCommunities } from "./zettelkasten-DSIe6wpF.mjs";
 
 export { zettelConverse, zettelExplore, zettelHealth, zettelSuggest, zettelSurprise, zettelThemes };

package/docker/docker-compose.yml

@@ -5,6 +5,10 @@ services:
     image: pgvector/pgvector:pg17
     container_name: pai-pgvector
     restart: unless-stopped
+    # A parallel vector index build keeps its graph in shared memory sized by
+    # maintenance_work_mem; Docker's default 64MB /dev/shm makes it fail with
+    # "No space left on device".
+    shm_size: ${PAI_PG_SHM_SIZE:-3g}
     # Postgres ships with shared_buffers=128MB, which is far too small once the
     # vector index runs to a gigabyte or more — the index can never stay cached
     # and every similarity search hits disk. 25% of available RAM is the usual

package/docs/commands/README.md

@@ -102,8 +102,13 @@ Generated man pages for every `pai` command area. Read any page in the terminal
 | `pai mcp install` | Register the PAI MCP server (pai) in ~/.claude.json (restart Claude Code to activate) |
 | `pai mcp status` | Show whether the PAI MCP server (pai) is registered and the binary exists |
 | `pai memory` | Memory engine: index, search, and status |
+| `pai memory backend` | Embedding backends: detect, use, provision (an index is bound to the backend that embedded it) |
+| `pai memory backend detect` | Probe the available embedding backends (ollama, then transformers-cpu) and recommend the fastest |
+| `pai memory backend provision <backend>` | Provision a backend's model. ollama: download the F16 GGUF of arctic-embed-m-v1.5 and `ollama create` it |
+| `pai memory backend use <id>` | Write the embedding backend to config (ollama-f16 \| transformers-cpu-q8); does not touch the index |
 | `pai memory embed [project-slug]` | Generate embeddings for un-embedded chunks (Phase 2.5) |
 | `pai memory index [project-slug]` | Index memory files for one project or all projects |
+| `pai memory reembed` | Switch the index to an embedding backend: clears all vectors (batched, resumable); `pai memory embed` refills |
 | `pai memory search <query>` | Search indexed memory (BM25 keyword, semantic, or hybrid) |
 | `pai memory settings [key] [value]` | View or modify search settings in the PAI config file (`pai config path`) |
 | `pai memory sources` | Show what the indexer has taken in: composition by source, which roots |
@@ -272,6 +277,7 @@ Generated man pages for every `pai` command area. Read any page in the terminal
 | `pai worker status-line [term] [cwd] [session]` | One-line worker summary for a status bar (empty when none in scope). |
 | `pai worker verify <id>` | Compare a worker's committed changes with the working tree (or --against <ref>); exit 0 when every file is identical, so discarding is safe. Also reads an archived worker (refs/pai-archive/<id>) |
 | `pai worker wait <ids...>` | Poll workers until they finish; prints each result as one JSON line, exit 1 on failure or timeout |
+| `pai worker wait-on <pid>` | Wait at most --max seconds (default 110, cap 115) for a detached job's pid; exit 0 gone, 3 still running, 2 never existed. |
 | `pai worker watch` | ps refreshed every 2 seconds (plain `watch`, colors kept) |
 | `pai zettel` | Zettelkasten intelligence: explore, surprise, converse, themes, health, suggest |
 | `pai zettel converse <question>` | Ask the vault a question and get a synthesis prompt with relevant notes |