@wrongstack/core 0.296.4 → 0.298.0

package/dist/chronicle/project-server.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/chronicle/project-server.ts", "../../src/utils/perf-profile.ts", "../../src/chronicle/context.ts", "../../src/chronicle/file-observer.ts", "../../src/storage/storage-concurrency.ts", "../../src/utils/project-watch.ts", "../../src/utils/walk-ignore.ts", "../../src/chronicle/identity.ts", "../../src/chronicle/journal.ts", "../../src/utils/atomic-write.ts", "../../src/types/errors.ts", "../../src/chronicle/event-hash.ts", "../../src/chronicle/partition-filename.ts", "../../src/chronicle/types.ts", "../../src/chronicle/legacy-journal-import.ts", "../../src/chronicle/metrics-store.ts", "../../src/utils/sqlite-warning.ts", "../../src/chronicle/query.ts", "../../src/chronicle/partition-range-cache.ts", "../../src/chronicle/project-server-endpoint.ts", "../../src/utils/socket-path.ts", "../../src/chronicle/project-server-protocol.ts", "../../src/chronicle/sqlite-journal.ts", "../../src/chronicle/sqlite-query.ts"],
-  "sourcesContent": ["#!/usr/bin/env node\n/**\n * One detached Chronicle owner per local project.\n *\n * Event mapping and secret scrubbing remain in the originating process. This\n * server owns ordering/hash chaining, partition rotation, retention, the\n * project file watcher, derived metrics, and journal queries.\n */\n\nimport * as fs from 'node:fs';\nimport * as fsp from 'node:fs/promises';\nimport * as net from 'node:net';\nimport * as path from 'node:path';\nimport { useDaemonPerfDefaults } from '../utils/perf-profile.js';\nimport { type ChronicleContext, createChronicleContext } from './context.js';\nimport { type ChronicleFileObserver, startChronicleFileObserver } from './file-observer.js';\nimport { resolveChronicleRuntimeLocation } from './identity.js';\nimport { ChronicleJournal, type ChronicleJournalStats } from './journal.js';\nimport { importLegacyChronicleJournal } from './legacy-journal-import.js';\nimport { ChronicleMetricsStore } from './metrics-store.js';\nimport { ChroniclePartitionRangeCache } from './partition-range-cache.js';\nimport {\n  chronicleProjectServerEndpoint,\n  chronicleProjectServerMetadataPath,\n  ensureChronicleProjectServerSocketDirectory,\n} from './project-server-endpoint.js';\nimport {\n  CHRONICLE_PROJECT_SERVER_MAX_FRAME_CHARS,\n  CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION,\n  type ChronicleProjectServerClientMessage,\n  type ChronicleProjectServerHealth,\n  type ChronicleProjectServerInfo,\n  type ChronicleProjectServerMessage,\n  type ChronicleServerOperationName,\n  type ChronicleServerOperations,\n  encodeChronicleProjectServerMessage,\n} from './project-server-protocol.js';\nimport { type ChronicleQuery, ChronicleQueryEngine } from './query.js';\nimport type { ChronicleEventSink } from './sink.js';\nimport { type ChronicleQuarantinedFamily, ChronicleSqliteJournal } from './sqlite-journal.js';\nimport type { ChronicleSqliteQueryEngine } from './sqlite-query.js';\nimport type { ChronicleEvent, ChronicleEventInput } from './types.js';\n\nconst DEFAULT_IDLE_MS = 5 * 60_000;\nconst MAX_APPEND_BATCH = 10_000;\n/** Outbound bytes queued for one client before it is dropped as unresponsive. */\nconst MAX_CLIENT_WRITE_BUFFER_BYTES = 8 * 1024 * 1024;\n\ninterface ParsedArgs {\n  projectRoot: string;\n  globalRoot: string;\n  projectId: string;\n  projectDir: string;\n  workspaceId: string;\n  retentionDays: number;\n}\n\ninterface ClientState {\n  socket: net.Socket;\n  buffer: string;\n}\n\nfunction parseArgs(argv: string[]): ParsedArgs {\n  const values = new Map<string, string>();\n  for (let index = 0; index < argv.length; index++) {\n    const key = argv[index];\n    if (key?.startsWith('--') && argv[index + 1] !== undefined) {\n      values.set(key, argv[++index]!);\n    }\n  }\n  const required = [\n    '--project-root',\n    '--global-root',\n    '--project-id',\n    '--project-dir',\n    '--workspace-id',\n  ] as const;\n  for (const key of required) {\n    if (!values.get(key)) throw new Error(`Chronicle project server requires ${key}`);\n  }\n  const retentionInput = Number(values.get('--retention-days'));\n  return {\n    projectRoot: path.resolve(values.get('--project-root')!),\n    globalRoot: path.resolve(values.get('--global-root')!),\n    projectId: values.get('--project-id')!,\n    projectDir: path.resolve(values.get('--project-dir')!),\n    workspaceId: values.get('--workspace-id')!,\n    retentionDays: Number.isFinite(retentionInput) && retentionInput >= 0 ? retentionInput : 30,\n  };\n}\n\n// Long-lived daemon: lean SQLite residency unless the operator says\n// otherwise. Must run before any store opens.\nuseDaemonPerfDefaults();\n\nconst parsed = parseArgs(process.argv.slice(2));\nconst chronicleDirectory = path.join(parsed.projectDir, 'chronicle');\nconst endpoint = chronicleProjectServerEndpoint(parsed.projectDir);\nconst metadataPath = chronicleProjectServerMetadataPath(parsed.projectDir);\nconst idleInput = Number(process.env['WRONGSTACK_CHRONICLE_SERVER_IDLE_MS']);\nconst idleMs = Number.isFinite(idleInput) && idleInput >= 100 ? idleInput : DEFAULT_IDLE_MS;\nconst startedAt = new Date().toISOString();\nconst serverInfo: ChronicleProjectServerInfo = {\n  protocolVersion: CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION,\n  pid: process.pid,\n  projectRoot: parsed.projectRoot,\n  projectDir: parsed.projectDir,\n  chronicleDirectory,\n  endpoint,\n  startedAt,\n};\n\nprocess.title = `wrongstack-chronicle:${path.basename(parsed.projectRoot)}`;\n\nconst clients = new Set<ClientState>();\nconst journals = new Map<string, ChronicleJournal>();\nlet activeRequests = 0;\nlet idleTimer: ReturnType<typeof setTimeout> | undefined;\nlet stopping = false;\nlet watcher: ChronicleFileObserver | undefined;\nlet watcherLastError: string | undefined;\nlet queryGeneration = 0;\nlet cachedQuery: { generation: number; engine: ChronicleQueryEngine } | undefined;\nlet metricsStore: ChronicleMetricsStore | undefined;\nlet partitionRangeCache: ChroniclePartitionRangeCache | undefined;\nlet metricsRefresh:\n  | Promise<ChronicleServerOperations['metrics']['result']['refreshed']>\n  | undefined;\nconst pendingMutationHints: Parameters<ChronicleFileObserver['noteToolMutation']>[0][] = [];\n\n/**\n * Days of journal to keep open. Yesterday stays available because events can\n * still arrive for it right after midnight; anything older can only accumulate.\n */\nconst MAX_OPEN_JOURNAL_DAYS = 2;\n\n/**\n * Drop journals for days we will not write to again.\n *\n * `journals` was only ever `get`/`set`/iterated \u2014 there was no `delete` and no\n * cap \u2014 so a daemon that lived across midnight kept one open `ChronicleJournal`\n * (with its write buffer and file handle) per day, forever. These daemons\n * routinely stay up for many hours.\n */\nfunction pruneJournals(currentDay: string): void {\n  if (journals.size <= MAX_OPEN_JOURNAL_DAYS) return;\n  const keep = new Set([...journals.keys()].sort().reverse().slice(0, MAX_OPEN_JOURNAL_DAYS));\n  keep.add(currentDay);\n  for (const [day, journal] of journals) {\n    if (keep.has(day)) continue;\n    journals.delete(day);\n    // Flush what is still buffered before letting it go. Detached, so a slow\n    // disk cannot stall an append \u2014 but never unhandled.\n    void journal.flush().catch(() => {\n      /* best-effort: the daemon is dropping this day either way */\n    });\n  }\n}\n\n/** Compose the legacy partition path a `ChronicleJournal` writes to. */\nfunction legacyPartitionPath(location: { chronicleDirectory: string; day: string }): string {\n  return path.join(location.chronicleDirectory, `${location.day}.events.jsonl`);\n}\n\n/**\n * SQLite is the daemon's store; `WRONGSTACK_CHRONICLE_STORE=jsonl` restores the\n * partition writer. This is the production write path \u2014 the inline one only\n * runs in explicit recovery mode \u2014 so the cut-over lives here.\n */\nfunction useSqliteStore(): boolean {\n  return process.env['WRONGSTACK_CHRONICLE_STORE'] !== 'jsonl';\n}\n\nlet sqliteStore: Promise<ChronicleSqliteJournal> | undefined;\n\n/** Day families the legacy import refused; surfaced by `ping` so health degrades. */\nlet quarantinedFamilies: ChronicleQuarantinedFamily[] = [];\n\n/**\n * Open the store, importing the legacy partitions the first time.\n *\n * The import is folded into opening so no request can observe a half-migrated\n * journal: everything queues behind this one promise.\n */\nfunction store(): Promise<ChronicleSqliteJournal> {\n  sqliteStore ??= (async () => {\n    await fsp.mkdir(chronicleDirectory, { recursive: true });\n    const journal = new ChronicleSqliteJournal({ directory: chronicleDirectory });\n    try {\n      const result = await importLegacyChronicleJournal(journal, chronicleDirectory);\n      quarantinedFamilies = result.quarantined;\n    } catch (error) {\n      // Caching a rejected promise poisons the daemon for its whole lifetime:\n      // every later request awaits the same rejection, and the handle above\n      // keeps the database \u2014 and its write-ahead log \u2014 open the entire time.\n      // Drop both so the next request gets a real retry.\n      sqliteStore = undefined;\n      journal.close();\n      throw error;\n    }\n    return journal;\n  })();\n  return sqliteStore;\n}\n\nfunction journalForToday(): ChronicleJournal {\n  const now = new Date();\n  const day = now.toISOString().slice(0, 10);\n  let journal = journals.get(day);\n  if (!journal) {\n    const location = resolveChronicleRuntimeLocation({\n      globalRoot: parsed.globalRoot,\n      projectId: parsed.projectId,\n      projectDir: parsed.projectDir,\n      now,\n    });\n    journal = new ChronicleJournal({\n      filePath: legacyPartitionPath(location),\n      retentionDays: parsed.retentionDays,\n    });\n    journals.set(day, journal);\n    pruneJournals(day);\n  }\n  return journal;\n}\n\nconst runtimeLocation = resolveChronicleRuntimeLocation({\n  globalRoot: parsed.globalRoot,\n  projectId: parsed.projectId,\n  projectDir: parsed.projectDir,\n});\nconst serverContext: ChronicleContext = createChronicleContext({\n  installationId: runtimeLocation.installationId,\n  machineId: runtimeLocation.machineId,\n  projectId: parsed.projectId,\n  workspaceId: parsed.workspaceId,\n});\n\nfunction noteMutation(input: ChronicleEventInput): void {\n  if (\n    input.eventType !== 'file.mutation.observed' ||\n    input.resource?.kind !== 'file' ||\n    !input.resource.path ||\n    !input.correlation.toolCallId\n  ) {\n    return;\n  }\n  const toolName = input.attributes?.['toolName'];\n  if (typeof toolName !== 'string' || !toolName) return;\n  const at = input.occurredAt ? Date.parse(input.occurredAt) : Number.NaN;\n  const hint = {\n    path: input.resource.path,\n    toolUseId: input.correlation.toolCallId,\n    toolName,\n    agentId: input.scope.agentId,\n    sessionId: input.scope.sessionId,\n    ...(Number.isFinite(at) ? { at } : {}),\n  };\n  if (watcher) watcher.noteToolMutation(hint);\n  else {\n    if (pendingMutationHints.length >= 1_000) pendingMutationHints.shift();\n    pendingMutationHints.push(hint);\n  }\n}\n\nasync function appendInputs(inputs: ChronicleEventInput[]): Promise<ChronicleEvent[]> {\n  if (!Array.isArray(inputs) || inputs.length === 0 || inputs.length > MAX_APPEND_BATCH) {\n    throw new TypeError(`Chronicle append requires 1..${MAX_APPEND_BATCH} inputs`);\n  }\n  for (const input of inputs) {\n    if (!input || typeof input !== 'object' || typeof input.eventType !== 'string') {\n      throw new TypeError('Chronicle append received an invalid event input');\n    }\n    noteMutation(input);\n  }\n  const events = useSqliteStore()\n    ? await (await store()).appendBatch(inputs)\n    : await Promise.all(inputs.map((input) => journalForToday().append(input)));\n  queryGeneration += events.length;\n  return events;\n}\n\nconst watcherSink: ChronicleEventSink = {\n  append: async (input) => (await appendInputs([input]))[0]!,\n  flush: async () => flushJournals(),\n  stats: () => journalForToday().stats(),\n};\n\nasync function flushJournals(): Promise<void> {\n  if (useSqliteStore()) {\n    // Transactional writes leave nothing buffered; this only waits for an\n    // in-flight open (and its legacy import).\n    if (sqliteStore) await sqliteStore;\n    return;\n  }\n  await Promise.all([...journals.values()].map((journal) => journal.flush()));\n}\n\nfunction rangeCache(): ChroniclePartitionRangeCache {\n  partitionRangeCache ??= new ChroniclePartitionRangeCache(chronicleDirectory);\n  return partitionRangeCache;\n}\n\nasync function queryEngine(): Promise<ChronicleQueryEngine | ChronicleSqliteQueryEngine> {\n  // The SQLite engine reads through the journal's own connection, so it always\n  // sees the latest commit \u2014 the generation cache exists only to avoid\n  // re-scanning partition files and is meaningless here.\n  if (useSqliteStore()) return (await store()).queryEngine();\n  if (cachedQuery?.generation === queryGeneration) return cachedQuery.engine;\n  const engine = await ChronicleQueryEngine.fromDirectory(chronicleDirectory, {\n    rangeCache: rangeCache(),\n  });\n  cachedQuery = { generation: queryGeneration, engine };\n  return engine;\n}\n\nfunction metrics(): ChronicleMetricsStore {\n  metricsStore ??= ChronicleMetricsStore.open(chronicleDirectory);\n  return metricsStore;\n}\n\nasync function refreshMetrics(): Promise<\n  ChronicleServerOperations['metrics']['result']['refreshed']\n> {\n  if (metricsRefresh) return metricsRefresh;\n  const run = metrics().refresh();\n  metricsRefresh = run;\n  try {\n    return await run;\n  } finally {\n    metricsRefresh = undefined;\n  }\n}\n\nasync function serverHealth(): Promise<ChronicleProjectServerHealth> {\n  const memory = process.memoryUsage();\n  await flushJournals();\n  // `ping` is the one call a health probe makes, so it has to open the store:\n  // a daemon that answers \"healthy\" without ever touching its own journal is\n  // exactly what let a broken import go unnoticed while nothing was recorded.\n  if (useSqliteStore()) {\n    quarantinedFamilies = (await store()).quarantinedFamilies();\n  }\n  const journalStats: ChronicleJournalStats = journalForToday().stats();\n  return {\n    ...serverInfo,\n    checkedAt: Date.now(),\n    uptimeMs: Math.round(process.uptime() * 1_000),\n    clients: clients.size,\n    activeRequests,\n    journal: journalStats,\n    ...(quarantinedFamilies.length > 0 ? { quarantinedFamilies } : {}),\n    watcher: {\n      active: watcher !== undefined,\n      watchedFiles: watcher?.watchedFiles ?? 0,\n      ...(watcherLastError ? { lastError: watcherLastError } : {}),\n    },\n    memory: {\n      rss: memory.rss,\n      heapUsed: memory.heapUsed,\n      heapTotal: memory.heapTotal,\n      external: memory.external,\n    },\n  };\n}\n\n/** True when the only narrowing is a time window/page \u2014 no genuinely ad hoc\n *  filter (text/path/provider/model/session/etc.) that fixed-dimension\n *  aggregation in ChronicleMetricsStore can't answer. */\nfunction isDefaultView(query: ChronicleQuery): boolean {\n  const { from, to, limit, order, cursor, ...rest } = query;\n  return Object.values(rest).every((value) => value === undefined);\n}\n\nasync function dispatch<O extends ChronicleServerOperationName>(\n  op: O,\n  rawArgs: unknown,\n): Promise<ChronicleServerOperations[O]['result']> {\n  switch (op) {\n    case 'ping':\n      return (await serverHealth()) as ChronicleServerOperations[O]['result'];\n    case 'append': {\n      const args = rawArgs as ChronicleServerOperations['append']['args'];\n      return (await appendInputs(args.inputs)) as ChronicleServerOperations[O]['result'];\n    }\n    case 'flush':\n      await flushJournals();\n      return undefined as ChronicleServerOperations[O]['result'];\n    case 'purge': {\n      const args = rawArgs as ChronicleServerOperations['purge']['args'];\n      return useSqliteStore()\n        ? ((await (await store()).purge(args)) as ChronicleServerOperations[O]['result'])\n        : ((await journalForToday().purge(args)) as ChronicleServerOperations[O]['result']);\n    }\n    case 'query': {\n      const args = rawArgs as ChronicleServerOperations['query']['args'];\n      const result = await (await queryEngine()).query(args.query);\n      // The default/unfiltered view (only from/to/limit/order/cursor set) is\n      // servable from the incrementally-refreshed metrics store instead of\n      // the summary the query engine just computed by scanning matched\n      // events \u2014 any other filter (text/path/provider/model/session/etc.)\n      // keeps the raw-scan summary, since fixed-dimension aggregation can't\n      // answer genuinely ad hoc filters.\n      if (isDefaultView(args.query)) {\n        await refreshMetrics();\n        result.summary = metrics().defaultSummary({\n          ...(args.query.from ? { from: args.query.from } : {}),\n          ...(args.query.to ? { to: args.query.to } : {}),\n        });\n      }\n      return result as ChronicleServerOperations[O]['result'];\n    }\n    case 'facet': {\n      const args = rawArgs as ChronicleServerOperations['facet']['args'];\n      const engine = await queryEngine();\n      return {\n        values: await engine.facet(args.field, args.query, args.limit),\n        diagnostics: engine.diagnostics,\n      } as ChronicleServerOperations[O]['result'];\n    }\n    case 'facets': {\n      const args = rawArgs as ChronicleServerOperations['facets']['args'];\n      const engine = await queryEngine();\n      return {\n        values: await engine.facets(args.fields, args.query, args.limit),\n        diagnostics: engine.diagnostics,\n      } as ChronicleServerOperations[O]['result'];\n    }\n    case 'graph': {\n      const args = rawArgs as ChronicleServerOperations['graph']['args'];\n      return (await (\n        await queryEngine()\n      ).graph(args.seed, args.hops, args.maxNodes)) as ChronicleServerOperations[O]['result'];\n    }\n    case 'metrics': {\n      const args = rawArgs as ChronicleServerOperations['metrics']['args'];\n      const refreshed =\n        args.refresh === false\n          ? { ingestedEvents: 0, ingestedBytes: 0, sourceFiles: 0, invalidLines: 0 }\n          : await refreshMetrics();\n      if (args.refresh === false) {\n        // Keep the projection converging without putting historical indexing\n        // latency on the caller's critical path.\n        void refreshMetrics().catch(() => {});\n      }\n      const store = metrics();\n      const data =\n        args.view === 'providers'\n          ? store.providerDaily(args.providers)\n          : args.view === 'tasks'\n            ? store.taskOutcomes(args.tasks)\n            : args.view === 'files'\n              ? store.fileLineage(args.files)\n              : store.summary();\n      return { refreshed, data } as ChronicleServerOperations[O]['result'];\n    }\n  }\n}\n\nfunction send(state: ClientState, message: ChronicleProjectServerMessage): void {\n  if (state.socket.destroyed) return;\n  const encoded = encodeChronicleProjectServerMessage(message);\n  if (encoded.length > CHRONICLE_PROJECT_SERVER_MAX_FRAME_CHARS) {\n    state.socket.destroy(new Error('Chronicle project server response exceeded frame limit'));\n    return;\n  }\n  // The frame cap above bounds one message; this bounds the queue. Ignoring\n  // `socket.write()`'s `false` return lets a client that stopped reading grow\n  // the owner's heap without limit \u2014 see the identical guard in the mailbox,\n  // kanban, SAGE and index owners.\n  if (state.socket.writableLength > MAX_CLIENT_WRITE_BUFFER_BYTES) {\n    state.socket.destroy(new Error('Chronicle client fell too far behind on reads'));\n    return;\n  }\n  state.socket.write(encoded);\n}\n\nasync function handleMessage(\n  state: ClientState,\n  message: ChronicleProjectServerClientMessage,\n): Promise<void> {\n  if (message.type === 'shutdown') {\n    send(state, { type: 'response', id: message.id, ok: true, result: { stopped: true } });\n    await stop(message.reason ?? 'client request');\n    return;\n  }\n  activeRequests++;\n  try {\n    const result = await dispatch(message.op, message.args);\n    send(state, { type: 'response', id: message.id, ok: true, result });\n  } catch (error) {\n    send(state, {\n      type: 'response',\n      id: message.id,\n      ok: false,\n      error: error instanceof Error ? error.message : String(error),\n      errorName: error instanceof Error ? error.name : undefined,\n    });\n  } finally {\n    activeRequests--;\n    // The client may have hung up while this ran \u2014 the socket 'close' handler\n    // already tried to arm the idle stop and was refused because work was in\n    // flight. Re-arm here or the daemon would linger with nobody attached.\n    scheduleIdleStop();\n  }\n}\n\nfunction onData(state: ClientState, chunk: string): void {\n  state.buffer += chunk;\n  if (state.buffer.length > CHRONICLE_PROJECT_SERVER_MAX_FRAME_CHARS) {\n    state.socket.destroy(new Error('Chronicle project server request exceeded frame limit'));\n    return;\n  }\n  while (true) {\n    const newline = state.buffer.indexOf('\\n');\n    if (newline < 0) return;\n    const line = state.buffer.slice(0, newline);\n    state.buffer = state.buffer.slice(newline + 1);\n    if (!line) continue;\n    let message: ChronicleProjectServerClientMessage;\n    try {\n      message = JSON.parse(line) as ChronicleProjectServerClientMessage;\n    } catch {\n      state.socket.destroy(new Error('Invalid Chronicle project server request'));\n      return;\n    }\n    void handleMessage(state, message);\n  }\n}\n\n/**\n * Arm the idle stop, but never while a request is still running.\n *\n * \"Idle\" has to mean no clients *and* no work \u2014 a long operation outlives the\n * connection that asked for it. The legacy import is the extreme case: it runs\n * for minutes inside the first `ping`, so a client that disconnects meanwhile\n * left the daemon counting down and exiting mid-import. Each restart then\n * redid the scan from the top, and because the completion marker is only\n * written at the end, it could never finish. `activeRequests` is decremented\n * in a `finally` that re-arms this, so a hung-up client still gets collected.\n */\nfunction scheduleIdleStop(): void {\n  if (stopping || clients.size > 0 || activeRequests > 0 || idleTimer) return;\n  idleTimer = setTimeout(() => {\n    idleTimer = undefined;\n    void stop('idle timeout');\n  }, idleMs);\n  idleTimer.unref?.();\n}\n\nasync function writeMetadata(): Promise<void> {\n  await fsp.mkdir(path.dirname(metadataPath), { recursive: true });\n  const temporary = `${metadataPath}.${process.pid}.tmp`;\n  await fsp.writeFile(temporary, `${JSON.stringify(serverInfo, null, 2)}\\n`, {\n    encoding: 'utf8',\n    mode: 0o600,\n  });\n  try {\n    await fsp.rename(temporary, metadataPath);\n  } catch {\n    await fsp.rm(metadataPath, { force: true });\n    await fsp.rename(temporary, metadataPath);\n  }\n}\n\nasync function removeOwnedMetadata(): Promise<void> {\n  try {\n    const current = JSON.parse(await fsp.readFile(metadataPath, 'utf8')) as { pid?: number };\n    if (current.pid === process.pid) await fsp.rm(metadataPath, { force: true });\n  } catch {\n    // Missing or replaced metadata is not ours to remove.\n  }\n}\n\nasync function stop(_reason: string): Promise<void> {\n  if (stopping) return;\n  stopping = true;\n  if (idleTimer) clearTimeout(idleTimer);\n  idleTimer = undefined;\n  await new Promise<void>((resolve) => server.close(() => resolve()));\n  for (const state of clients) state.socket.destroy();\n  clients.clear();\n  await watcher?.close().catch(() => {});\n  watcher = undefined;\n  await flushJournals().catch(() => {});\n  metricsStore?.close();\n  metricsStore = undefined;\n  await removeOwnedMetadata();\n  if (process.platform !== 'win32') await fsp.rm(endpoint, { force: true }).catch(() => {});\n}\n\nensureChronicleProjectServerSocketDirectory(endpoint);\nconst server = net.createServer((socket) => {\n  if (stopping) {\n    socket.destroy();\n    return;\n  }\n  if (idleTimer) clearTimeout(idleTimer);\n  idleTimer = undefined;\n  socket.setEncoding('utf8');\n  const state: ClientState = { socket, buffer: '' };\n  clients.add(state);\n  send(state, { type: 'hello', ...serverInfo });\n  socket.on('data', (chunk: string) => onData(state, chunk));\n  socket.on('close', () => {\n    clients.delete(state);\n    scheduleIdleStop();\n  });\n});\n\nlet probingExistingEndpoint = false;\n\nfunction listenForOwnership(): void {\n  server.listen(endpoint);\n}\n\nserver.on('error', (error: NodeJS.ErrnoException) => {\n  if (error.code === 'EADDRINUSE' && process.platform === 'win32') {\n    process.exitCode = 0;\n    return;\n  }\n  if (error.code === 'EADDRINUSE' && !probingExistingEndpoint) {\n    probingExistingEndpoint = true;\n    const probe = net.createConnection(endpoint);\n    probe.once('connect', () => {\n      probe.destroy();\n      process.exitCode = 0;\n    });\n    probe.once('error', () => {\n      probe.destroy();\n      try {\n        fs.rmSync(endpoint, { force: true });\n      } catch {\n        // A competing candidate may already have repaired the endpoint.\n      }\n      probingExistingEndpoint = false;\n      listenForOwnership();\n    });\n    return;\n  }\n  process.exitCode = 1;\n});\n\nserver.on('listening', () => {\n  if (process.platform !== 'win32') {\n    try {\n      fs.chmodSync(endpoint, 0o600);\n    } catch {\n      // The containing 0700 directory still limits access to this user.\n    }\n  }\n  void writeMetadata();\n  void startChronicleFileObserver({\n    projectRoot: parsed.projectRoot,\n    journal: watcherSink,\n    context: serverContext,\n    excludedPaths: [chronicleDirectory],\n    onError: (error) => {\n      watcherLastError = error instanceof Error ? error.message : String(error);\n    },\n  })\n    .then((value) => {\n      watcher = value;\n      for (const hint of pendingMutationHints.splice(0)) value.noteToolMutation(hint);\n      watcherLastError = undefined;\n    })\n    .catch((error) => {\n      watcherLastError = error instanceof Error ? error.message : String(error);\n    });\n  scheduleIdleStop();\n});\n\nprocess.once('SIGINT', () => void stop('SIGINT'));\nprocess.once('SIGTERM', () => void stop('SIGTERM'));\nlistenForOwnership();\n", "/**\n * Process-wide performance profile.\n *\n * `WRONGSTACK_PERF_PROFILE` (alias `WSTACK_PERF_PROFILE`):\n *   - `balanced` (default) \u2014 current throughput-oriented defaults\n *   - `frugal` / `cimri` \u2014 lower CPU concurrency, leaner SQLite caches,\n *     coarser UI stream paint. Correctness and APIs unchanged.\n */\n\nexport type PerfProfile = 'balanced' | 'frugal';\n\n/**\n * Long-lived IPC daemons default to `frugal`.\n *\n * The SQLite pragmas below are per *connection*, and a daemon holds its\n * connections for its whole lifetime \u2014 the codebase-index daemon measured\n * 336MB RSS, essentially all of it the 128MiB page cache plus 512MiB mmap\n * reservation, while sitting idle. A foreground host pays that cost briefly;\n * a daemon pays it for hours. An explicit `WRONGSTACK_PERF_PROFILE` from the\n * operator still wins in both directions.\n */\nlet daemonDefaults = false;\n\n/** Call once from a daemon entry point, before opening any store. */\nexport function useDaemonPerfDefaults(): void {\n  daemonDefaults = true;\n}\n\n/** Resolve the active profile from the environment (evaluated each call). */\nexport function getPerfProfile(): PerfProfile {\n  const explicit = process.env.WRONGSTACK_PERF_PROFILE ?? process.env.WSTACK_PERF_PROFILE;\n  if (explicit === undefined || explicit.trim() === '') {\n    return daemonDefaults ? 'frugal' : 'balanced';\n  }\n  const raw = explicit.trim().toLowerCase();\n  if (raw === 'frugal' || raw === 'cimri' || raw === 'low' || raw === 'eco') {\n    return 'frugal';\n  }\n  return 'balanced';\n}\n\nexport function isFrugalPerf(): boolean {\n  return getPerfProfile() === 'frugal';\n}\n\n/** Parallel file-parse batch size for the codebase indexer. */\nexport function indexParallelBatchSize(availableCores: number): number {\n  const cores = Math.max(1, Math.floor(availableCores) || 1);\n  if (isFrugalPerf()) {\n    // Serial-ish: at most 4 files concurrent, never more than core count.\n    return Math.min(4, cores);\n  }\n  // Historical default: cores\u00D74, hard-capped at 40.\n  return Math.min(cores * 4, 40);\n}\n\n/**\n * SQLite page-cache / mmap sizes in KiB (negative PRAGMA = KiB units for cache).\n * Frugal keeps correctness; just spends less RSS.\n */\nexport function sqliteCachePragmas(): { cacheSizeKiB: number; mmapBytes: number } {\n  if (isFrugalPerf()) {\n    return { cacheSizeKiB: 16_384, mmapBytes: 64 * 1024 * 1024 }; // 16 MiB / 64 MiB\n  }\n  return { cacheSizeKiB: 131_072, mmapBytes: 512 * 1024 * 1024 }; // 128 MiB / 512 MiB\n}\n\n/** sage store defaults (slightly smaller than index). */\nexport function SageCachePragmas(): { cacheSizeKiB: number; mmapBytes: number } {\n  if (isFrugalPerf()) {\n    return { cacheSizeKiB: 8_192, mmapBytes: 32 * 1024 * 1024 }; // 8 MiB / 32 MiB\n  }\n  return { cacheSizeKiB: 65_536, mmapBytes: 256 * 1024 * 1024 }; // 64 MiB / 256 MiB\n}\n\n/**\n * TUI stream paint interval. Higher = fewer React dispatches (less CPU/heap\n * churn). Balanced keeps the historical ~10fps; frugal ~6\u20137fps.\n */\nexport function tuiStreamFlushMs(): number {\n  return isFrugalPerf() ? 150 : 100;\n}\n", "import { randomUUID } from 'node:crypto';\nimport type { ChronicleCorrelation, ChronicleScope } from './types.js';\n\nexport interface ChronicleContext {\n  scope: ChronicleScope;\n  correlation: ChronicleCorrelation;\n}\n\n/** Create a root correlation context for a session, run, or background worker. */\nexport function createChronicleContext(\n  scope: ChronicleScope,\n  traceId: string = randomUUID(),\n): ChronicleContext {\n  return {\n    scope: { ...scope },\n    correlation: { traceId, spanId: randomUUID() },\n  };\n}\n\n/** Derive a child span without losing project/session/task attribution. */\nexport function childChronicleContext(\n  parent: ChronicleContext,\n  overrides: {\n    scope?: Partial<ChronicleScope> | undefined;\n    correlation?: Partial<Omit<ChronicleCorrelation, 'traceId'>> | undefined;\n  } = {},\n): ChronicleContext {\n  return {\n    scope: { ...parent.scope, ...overrides.scope },\n    correlation: {\n      ...parent.correlation,\n      ...overrides.correlation,\n      traceId: parent.correlation.traceId,\n      parentSpanId: parent.correlation.spanId,\n      spanId: overrides.correlation?.spanId ?? randomUUID(),\n    },\n  };\n}\n", "import { createHash } from 'node:crypto';\nimport * as fsp from 'node:fs/promises';\nimport * as path from 'node:path';\nimport type { EventBus } from '../kernel/events.js';\nimport { mapWithConcurrency } from '../storage/storage-concurrency.js';\nimport { type ProjectWatchSubscription, watchProjectTree } from '../utils/project-watch.js';\nimport { DEFAULT_WALK_IGNORE_DIRS } from '../utils/walk-ignore.js';\nimport type { ChronicleContext } from './context.js';\nimport type { ChronicleEventSink } from './sink.js';\nimport type { ChronicleEventInput } from './types.js';\n\ninterface FileFingerprint {\n  size: number;\n  mtimeMs: number;\n  hash?: string | undefined;\n}\n\ninterface RecentToolMutation {\n  at: number;\n  toolUseId: string;\n  toolName: string;\n  agentId?: string | undefined;\n  sessionId?: string | undefined;\n}\n\nexport interface ChronicleToolMutationHint {\n  path: string;\n  toolUseId: string;\n  toolName: string;\n  agentId?: string | undefined;\n  sessionId?: string | undefined;\n  at?: number | undefined;\n}\n\nexport interface ChronicleFileObserverOptions {\n  projectRoot: string;\n  journal: ChronicleEventSink;\n  context: ChronicleContext | (() => ChronicleContext);\n  events?: EventBus | undefined;\n  debounceMs?: number | undefined;\n  maxHashBytes?: number | undefined;\n  excludedDirectories?: readonly string[] | undefined;\n  /** Absolute or project-relative path prefixes that must never be observed. */\n  excludedPaths?: readonly string[] | undefined;\n  /** Min gap between full-project rescans triggered by null-filename events. */\n  minFullRescanIntervalMs?: number | undefined;\n  onError?: ((error: unknown) => void) | undefined;\n}\n\nexport interface ChronicleFileObserver {\n  close(): Promise<void>;\n  readonly watchedFiles: number;\n  noteToolMutation(hint: ChronicleToolMutationHint): void;\n}\n\n/**\n * Directories this observer must never descend into.\n *\n * `.claude` earns its place the same way `.wrongstack` did: it is the tool's own\n * workspace, not the user's project, so nothing inside it is an \"external\n * mutation\" worth an audit event. It matters far more than it looks \u2014 git\n * worktrees live under `.claude/worktrees`, and a worktree is a full copy of the\n * repository. Creating one made the watcher report every tracked file as\n * `file.external.created`, and removing it reported every file again as\n * `deleted`. Measured on this repo: 85,619 of 85,813 file events in a single\n * day came from `.claude/worktrees`, ~95 MB of a 106 MB journal \u2014 90% of the\n * day's telemetry describing the tool watching itself.\n */\nconst DEFAULT_EXCLUDED = [\n  ...DEFAULT_WALK_IGNORE_DIRS,\n  '.wrongstack',\n  '.claude',\n  '.temp_files',\n];\nconst SCAN_HASH_CONCURRENCY = 32;\n// Platforms that omit the filename (common on Windows recursive watch) can\n// emit null-filename events in bursts. Each one used to trigger a full\n// project walk \u2014 bound rescans to this floor; a queued rescan is deferred,\n// never dropped, so no external mutation is lost.\nconst DEFAULT_FULL_RESCAN_MIN_INTERVAL_MS = 30_000;\n/** Max entries in recentToolMutations before oldest are evicted. */\nconst MAX_RECENT_TOOL_MUTATIONS = 500;\n\n/** Observe editor/user/external process mutations that bypass WrongStack tools. */\nexport async function startChronicleFileObserver(\n  options: ChronicleFileObserverOptions,\n): Promise<ChronicleFileObserver> {\n  const root = path.resolve(options.projectRoot);\n  const excluded = new Set(options.excludedDirectories ?? DEFAULT_EXCLUDED);\n  const excludedPaths = normalizeExcludedPaths(root, options.excludedPaths ?? []);\n  const debounceMs = options.debounceMs ?? 120;\n  const maxHashBytes = options.maxHashBytes ?? 8 * 1024 * 1024;\n  const known = (await scanProject(root, excluded, excludedPaths, maxHashBytes, options.onError))\n    .files;\n  const recentToolMutations = new Map<string, RecentToolMutation>();\n  const noteToolMutation = (hint: ChronicleToolMutationHint): void => {\n    const absolute = path.isAbsolute(hint.path)\n      ? path.normalize(hint.path)\n      : path.resolve(root, hint.path);\n    const relative = normalizeRelative(path.relative(root, absolute));\n    if (relative.startsWith('../') || isExcluded(relative, excluded, excludedPaths)) return;\n    recentToolMutations.set(relative, {\n      at: hint.at ?? Date.now(),\n      toolUseId: hint.toolUseId,\n      toolName: hint.toolName,\n      agentId: hint.agentId,\n      sessionId: hint.sessionId,\n    });\n    // Evict oldest entries past the cap to prevent unbounded growth when\n    // tool mutations accumulate faster than reconciliation drains them.\n    if (recentToolMutations.size > MAX_RECENT_TOOL_MUTATIONS) {\n      const overflow = recentToolMutations.size - MAX_RECENT_TOOL_MUTATIONS;\n      const keys = [...recentToolMutations.keys()];\n      for (let i = 0; i < overflow && i < keys.length; i++) {\n        recentToolMutations.delete(keys[i]!);\n      }\n    }\n  };\n  const offToolProgress = options.events?.on('tool.progress', (event) => {\n    if (event.event.type !== 'file_changed' || !event.event.path) return;\n    noteToolMutation({\n      path: event.event.path,\n      toolUseId: event.id,\n      toolName: event.name,\n      agentId: event.agentId,\n      sessionId: event.sessionId,\n    });\n  });\n  const pending = new Set<string>();\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  let closed = false;\n  let flushTail: Promise<void> | null = null;\n  const minFullRescanIntervalMs =\n    options.minFullRescanIntervalMs ?? DEFAULT_FULL_RESCAN_MIN_INTERVAL_MS;\n  // The startup scan just ran \u2014 the first watcher-triggered full rescan also\n  // waits out the interval instead of immediately repeating that work.\n  let lastFullScanAt = Date.now();\n  let fullRescanTimer: ReturnType<typeof setTimeout> | undefined;\n\n  const bumpDebounce = (): void => {\n    if (timer) clearTimeout(timer);\n    timer = setTimeout(() => {\n      timer = undefined;\n      drainPending();\n    }, debounceMs);\n  };\n\n  // Some platforms omit the filename. A bounded full rescan recovers the\n  // facts instead of silently losing an external mutation \u2014 but rescans walk\n  // (and stat) the whole tree, so they are rate-limited: within the interval\n  // the request is queued for the earliest allowed time, not dropped.\n  const requestFullRescan = (): void => {\n    if (closed) return;\n    const since = Date.now() - lastFullScanAt;\n    if (since >= minFullRescanIntervalMs) {\n      pending.add('*');\n      bumpDebounce();\n      return;\n    }\n    if (fullRescanTimer) return;\n    fullRescanTimer = setTimeout(() => {\n      fullRescanTimer = undefined;\n      if (closed) return;\n      pending.add('*');\n      bumpDebounce();\n    }, minFullRescanIntervalMs - since);\n    if (typeof fullRescanTimer.unref === 'function') fullRescanTimer.unref();\n  };\n\n  const schedule = (filename: string | Buffer | null): void => {\n    if (closed) return;\n    if (filename === null) {\n      requestFullRescan();\n      return;\n    }\n    const relative = normalizeRelative(String(filename));\n    if (!relative || isExcluded(relative, excluded, excludedPaths)) return;\n    pending.add(relative);\n    bumpDebounce();\n  };\n\n  const reconcile = async (changedPaths: string[]): Promise<void> => {\n    const wantsFullScan = changedPaths.includes('*');\n    if (wantsFullScan) lastFullScanAt = Date.now();\n    const fullScan = wantsFullScan\n      ? await scanProject(root, excluded, excludedPaths, maxHashBytes, options.onError, known)\n      : undefined;\n    // Re-apply the exclusion boundary at reconciliation time. OS watchers can\n    // report paths using a different recursive-root shape than the scheduling\n    // callback (notably on Windows), and pending paths may outlive a directory\n    // rename. Excluded tool workspaces must never become Chronicle events even\n    // if an upstream watcher notification slips through the first filter.\n    const candidates = (fullScan ? unionKeys(known, fullScan.files) : changedPaths).filter(\n      (relative) => !isExcluded(relative, excluded, excludedPaths),\n    );\n    const changes: Array<{\n      relative: string;\n      before?: FileFingerprint | undefined;\n      after?: FileFingerprint | undefined;\n    }> = [];\n    for (const relative of candidates) {\n      const before = known.get(relative);\n      // A successful full scan already paid the stat/read/hash cost. Reuse\n      // those fingerprints instead of reading every file a second time.\n      // When the scan is incomplete (a directory read or individual hash\n      // threw), reuse whatever was hashed successfully and only re-probe\n      // the files the scan did not reach \u2014 never treat a scan gap as a\n      // deletion.\n      const cached = fullScan?.files.get(relative);\n      const after =\n        cached ??\n        (fullScan?.complete\n          ? undefined\n          : await fingerprint(path.join(root, relative), maxHashBytes));\n      if (sameFingerprint(before, after)) continue;\n      changes.push({ relative, before, after });\n    }\n\n    // Atomic saves and renames commonly arrive as delete+create. Matching the\n    // last-known content hash preserves resource lineage when the OS provides\n    // only generic \"rename\" notifications.\n    const deleted = changes.filter((change) => change.before && !change.after);\n    const created = changes.filter((change) => !change.before && change.after);\n    const consumed = new Set<string>();\n    const journalWrites: Promise<void>[] = [];\n    for (const from of deleted) {\n      const match = created.find(\n        (to) =>\n          !consumed.has(to.relative) &&\n          from.before?.hash !== undefined &&\n          from.before.hash === to.after?.hash,\n      );\n      if (!match) continue;\n      consumed.add(from.relative);\n      consumed.add(match.relative);\n      known.delete(from.relative);\n      known.set(match.relative, match.after!);\n      journalWrites.push(\n        recordMutation(\n          options,\n          'file.external.renamed',\n          match.relative,\n          match.after,\n          {\n            operation: 'rename',\n            previousPath: from.relative,\n            previousResourceId: resourceId(from.relative),\n            actor: 'external',\n          },\n          mutationAttribution(match.relative, recentToolMutations),\n        ),\n      );\n    }\n\n    for (const change of changes) {\n      if (consumed.has(change.relative)) continue;\n      if (!change.after) {\n        known.delete(change.relative);\n        journalWrites.push(\n          recordMutation(\n            options,\n            'file.external.deleted',\n            change.relative,\n            change.before,\n            {\n              operation: 'delete',\n              actor: 'external',\n              previousHash: change.before?.hash,\n              previousSize: change.before?.size,\n            },\n            mutationAttribution(change.relative, recentToolMutations),\n          ),\n        );\n      } else if (!change.before) {\n        known.set(change.relative, change.after);\n        journalWrites.push(\n          recordMutation(\n            options,\n            'file.external.created',\n            change.relative,\n            change.after,\n            {\n              operation: 'write',\n              actor: 'external',\n            },\n            mutationAttribution(change.relative, recentToolMutations),\n          ),\n        );\n      } else {\n        known.set(change.relative, change.after);\n        journalWrites.push(\n          recordMutation(\n            options,\n            'file.external.modified',\n            change.relative,\n            change.after,\n            {\n              operation: 'edit',\n              actor: 'external',\n              previousHash: change.before.hash,\n              previousSize: change.before.size,\n            },\n            mutationAttribution(change.relative, recentToolMutations),\n          ),\n        );\n      }\n    }\n    await Promise.all(journalWrites);\n  };\n\n  const drainPending = (): Promise<void> => {\n    if (flushTail) return flushTail;\n    const drain = (async () => {\n      while (pending.size > 0) {\n        const paths = [...pending];\n        pending.clear();\n        await reconcile(paths).catch((error) => options.onError?.(error));\n      }\n    })().finally(() => {\n      if (flushTail === drain) flushTail = null;\n      if (!closed && pending.size > 0) drainPending();\n    });\n    flushTail = drain;\n    return drain;\n  };\n\n  let watcher: ProjectWatchSubscription;\n  try {\n    watcher = watchProjectTree(root, (event) => schedule(event.filename), {\n      onError: (error) => options.onError?.(error),\n    });\n  } catch (error) {\n    options.onError?.(error);\n    throw error;\n  }\n\n  return {\n    get watchedFiles() {\n      return known.size;\n    },\n    noteToolMutation,\n    async close() {\n      if (closed) return;\n      closed = true;\n      offToolProgress?.();\n      watcher.close();\n      if (timer) {\n        clearTimeout(timer);\n        timer = undefined;\n      }\n      if (fullRescanTimer) {\n        clearTimeout(fullRescanTimer);\n        fullRescanTimer = undefined;\n      }\n      if (pending.size > 0) drainPending();\n      await flushTail;\n      recentToolMutations.clear();\n    },\n  };\n}\n\nasync function recordMutation(\n  options: ChronicleFileObserverOptions,\n  eventType: string,\n  relativePath: string,\n  state: FileFingerprint | undefined,\n  attributes: Record<string, unknown>,\n  attribution?: RecentToolMutation | undefined,\n): Promise<void> {\n  const context = typeof options.context === 'function' ? options.context() : options.context;\n  const operation = attributes['operation'] as 'write' | 'edit' | 'delete' | 'rename';\n  options.events?.emit('file.activity', {\n    filePath: path.join(options.projectRoot, relativePath),\n    operation,\n    phase: 'changed',\n    source: attribution ? 'tool' : 'external',\n    at: Date.now(),\n    sessionId: context.scope.sessionId,\n    traceId: context.correlation.traceId,\n    agentId: attribution?.agentId ?? context.scope.agentId,\n    ...(attribution ? { toolUseId: attribution.toolUseId, toolName: attribution.toolName } : {}),\n  });\n  const input: ChronicleEventInput = {\n    eventType: attribution ? eventType.replace('.external.', '.tool.') : eventType,\n    scope: {\n      ...context.scope,\n      ...(attribution?.sessionId ? { sessionId: attribution.sessionId } : {}),\n      ...(attribution?.agentId ? { agentId: attribution.agentId } : {}),\n    },\n    correlation: {\n      ...context.correlation,\n      ...(attribution ? { toolCallId: attribution.toolUseId } : {}),\n    },\n    outcome: 'success',\n    resource: {\n      kind: 'file',\n      id: resourceId(relativePath),\n      path: normalizeRelative(relativePath),\n      ...(state?.hash ? { contentHashAfter: state.hash } : {}),\n    },\n    attributes: {\n      ...attributes,\n      actor: attribution ? 'agent' : attributes['actor'],\n      source: attribution ? 'tool' : 'external',\n      toolName: attribution?.toolName,\n      size: state?.size,\n      mtimeMs: state?.mtimeMs,\n      observedBy: 'fs.watch',\n    },\n  };\n  await options.journal.append(input);\n}\n\nfunction mutationAttribution(\n  relativePath: string,\n  recent: Map<string, RecentToolMutation>,\n): RecentToolMutation | undefined {\n  const value = recent.get(relativePath);\n  if (!value) return undefined;\n  recent.delete(relativePath);\n  return Date.now() - value.at <= 2_000 ? value : undefined;\n}\n\nasync function scanProject(\n  root: string,\n  excluded: ReadonlySet<string>,\n  excludedPaths: ReadonlySet<string>,\n  maxHashBytes: number,\n  onError?: ((error: unknown) => void) | undefined,\n  previous?: ReadonlyMap<string, FileFingerprint> | undefined,\n): Promise<{ files: Map<string, FileFingerprint>; complete: boolean }> {\n  const result = new Map<string, FileFingerprint>();\n  const dirs = [''];\n  let complete = true;\n  while (dirs.length > 0) {\n    const relativeDir = dirs.pop()!;\n    try {\n      const entries = await fsp.readdir(path.join(root, relativeDir), { withFileTypes: true });\n      const filePaths: string[] = [];\n      for (const entry of entries) {\n        const relative = normalizeRelative(path.join(relativeDir, entry.name));\n        if (isExcluded(relative, excluded, excludedPaths)) continue;\n        if (entry.isDirectory()) {\n          dirs.push(relative);\n        } else if (entry.isFile()) {\n          filePaths.push(relative);\n        }\n      }\n      const fingerprints = await mapWithConcurrency(\n        filePaths,\n        SCAN_HASH_CONCURRENCY,\n        async (relative): Promise<[string, FileFingerprint] | null> => {\n          try {\n            const value = await fingerprint(\n              path.join(root, relative),\n              maxHashBytes,\n              previous?.get(relative),\n            );\n            return value ? [relative, value] : null;\n          } catch (error) {\n            complete = false;\n            onError?.(error);\n            return null;\n          }\n        },\n      );\n      for (const entry of fingerprints) {\n        if (entry) result.set(entry[0], entry[1]);\n      }\n    } catch (error) {\n      complete = false;\n      onError?.(error);\n    }\n  }\n  return { files: result, complete };\n}\n\nasync function fingerprint(\n  filePath: string,\n  maxHashBytes: number,\n  previous?: FileFingerprint | undefined,\n): Promise<FileFingerprint | undefined> {\n  try {\n    const stat = await fsp.stat(filePath);\n    if (!stat.isFile()) return undefined;\n    const base: FileFingerprint = { size: stat.size, mtimeMs: stat.mtimeMs };\n    // Unchanged size+mtime \u2192 reuse the known content hash instead of\n    // re-reading the file. Full rescans over a quiet tree become stat-only.\n    if (\n      previous?.hash !== undefined &&\n      previous.size === stat.size &&\n      previous.mtimeMs === stat.mtimeMs\n    ) {\n      base.hash = previous.hash;\n      return base;\n    }\n    if (stat.size <= maxHashBytes) {\n      base.hash = createHash('sha256')\n        .update(await fsp.readFile(filePath))\n        .digest('hex');\n    }\n    return base;\n  } catch (error) {\n    if (typeof error === 'object' && error !== null && 'code' in error && error.code === 'ENOENT')\n      return undefined;\n    throw error;\n  }\n}\n\nfunction sameFingerprint(a: FileFingerprint | undefined, b: FileFingerprint | undefined): boolean {\n  if (!a || !b) return a === b;\n  if (a.hash !== undefined && b.hash !== undefined) return a.hash === b.hash;\n  return a.size === b.size && a.mtimeMs === b.mtimeMs;\n}\n\nfunction isExcluded(\n  relative: string,\n  excluded: ReadonlySet<string>,\n  excludedPaths: ReadonlySet<string>,\n): boolean {\n  const normalized = normalizeRelative(relative);\n  if (normalized.split('/').some((segment) => excluded.has(segment))) return true;\n  for (const prefix of excludedPaths) {\n    if (normalized === prefix || normalized.startsWith(`${prefix}/`)) return true;\n  }\n  return false;\n}\n\nfunction normalizeExcludedPaths(root: string, values: readonly string[]): Set<string> {\n  const result = new Set<string>();\n  for (const value of values) {\n    const relative = path.isAbsolute(value) ? path.relative(root, path.resolve(value)) : value;\n    const normalized = normalizeRelative(relative).replace(/\\/+$/u, '');\n    if (!normalized || normalized === '.' || normalized.startsWith('../')) continue;\n    result.add(normalized);\n  }\n  return result;\n}\n\nfunction normalizeRelative(value: string): string {\n  return value.replaceAll('\\\\', '/').replace(/^\\.\\//, '');\n}\n\nfunction resourceId(relativePath: string): string {\n  return `file_${createHash('sha256').update(normalizeRelative(relativePath)).digest('hex').slice(0, 24)}`;\n}\n\nfunction unionKeys(a: ReadonlyMap<string, unknown>, b: ReadonlyMap<string, unknown>): string[] {\n  return [...new Set([...a.keys(), ...b.keys()])];\n}\n", "export async function mapWithConcurrency<T, R>(\n  items: readonly T[],\n  concurrency: number,\n  mapper: (item: T, index: number) => Promise<R>,\n): Promise<R[]> {\n  if (items.length === 0) return [];\n  const limit = Math.max(1, Math.floor(concurrency));\n  const results = new Array<R>(items.length);\n  let next = 0;\n\n  async function worker(): Promise<void> {\n    while (true) {\n      const index = next;\n      next++;\n      if (index >= items.length) return;\n      results[index] = await mapper(items[index] as T, index);\n    }\n  }\n\n  const workers = Array.from({ length: Math.min(limit, items.length) }, () => worker());\n  await Promise.all(workers);\n  return results;\n}\n", "/**\n * Shared recursive project-tree watcher.\n *\n * Several subsystems each used to open their own `fs.watch(projectRoot,\n * {recursive:true})` \u2014 the codebase indexer, the chronicle file observer, and\n * the WebUI indexing mirror. Every recursive watch makes the OS track the\n * whole tree independently, so a single runtime paid that cost 2\u20133\u00D7. This\n * registry keeps ONE watcher per resolved root per process and fans events\n * out to all subscribers; the watcher closes when the last subscriber leaves.\n *\n * The registry lives behind a `Symbol.for` global so it stays a singleton\n * even if core is loaded twice (Windows path-casing double-load).\n *\n * @module utils/project-watch\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\n\nexport interface ProjectWatchEvent {\n  eventType: 'rename' | 'change';\n  /** Path relative to the watched root as delivered by the OS, or null when omitted. */\n  filename: string | null;\n}\n\nexport interface ProjectWatchSubscription {\n  close(): void;\n}\n\ninterface Subscriber {\n  listener: (event: ProjectWatchEvent) => void;\n  onError?: ((error: unknown) => void) | undefined;\n}\n\ninterface WatchEntry {\n  watcher: fs.FSWatcher;\n  subscribers: Set<Subscriber>;\n  /** Set once the underlying watcher errored or closed \u2014 dead entries are never reused. */\n  dead: boolean;\n}\n\nconst REGISTRY_KEY = Symbol.for('wrongstack.projectWatchRegistry');\nconst globalScope = globalThis as { [REGISTRY_KEY]?: Map<string, WatchEntry> };\nif (!globalScope[REGISTRY_KEY]) globalScope[REGISTRY_KEY] = new Map();\nconst registry: Map<string, WatchEntry> = globalScope[REGISTRY_KEY];\n\nfunction registryKey(root: string): string {\n  const resolved = path.resolve(root);\n  return process.platform === 'win32' ? resolved.toLowerCase() : resolved;\n}\n\n/**\n * Subscribe to recursive change events under `root`, sharing one OS watcher\n * per root per process. Throws when the platform cannot create the watcher\n * (no recursive support, permission) and no live shared watcher exists \u2014\n * callers that can degrade should try/catch exactly as they would `fs.watch`.\n *\n * The watcher is non-persistent: it never keeps the process alive.\n */\nexport function watchProjectTree(\n  root: string,\n  listener: (event: ProjectWatchEvent) => void,\n  opts?: { onError?: ((error: unknown) => void) | undefined },\n): ProjectWatchSubscription {\n  const key = registryKey(root);\n  let entry = registry.get(key);\n  if (!entry || entry.dead) {\n    const subscribers = new Set<Subscriber>();\n    const watcher = fs.watch(\n      path.resolve(root),\n      { recursive: true, persistent: false },\n      (eventType, filename) => {\n        const event: ProjectWatchEvent = {\n          eventType: eventType === 'rename' ? 'rename' : 'change',\n          filename: filename === null ? null : String(filename),\n        };\n        for (const sub of subscribers) {\n          try {\n            sub.listener(event);\n          } catch (error) {\n            sub.onError?.(error);\n          }\n        }\n      },\n    );\n    const created: WatchEntry = { watcher, subscribers, dead: false };\n    const retire = (): void => {\n      created.dead = true;\n      if (registry.get(key) === created) registry.delete(key);\n    };\n    watcher.on('error', (error) => {\n      // A watcher that errored is closed by Node \u2014 mark the entry dead so the\n      // next acquire creates a fresh one instead of reusing a corpse.\n      retire();\n      for (const sub of subscribers) sub.onError?.(error);\n    });\n    // Watchers can also close without first emitting `error` (for example when\n    // the watched tree disappears). Never leave that closed handle reusable.\n    watcher.on('close', retire);\n    registry.set(key, created);\n    entry = created;\n  }\n\n  const active = entry;\n  const subscriber: Subscriber = { listener, onError: opts?.onError };\n  active.subscribers.add(subscriber);\n\n  let closed = false;\n  return {\n    close() {\n      if (closed) return;\n      closed = true;\n      active.subscribers.delete(subscriber);\n      if (active.subscribers.size === 0 && !active.dead) {\n        active.dead = true;\n        if (registry.get(key) === active) registry.delete(key);\n        try {\n          active.watcher.close();\n        } catch {\n          /* already closed */\n        }\n      }\n    },\n  };\n}\n", "/**\n * Canonical directory-name ignore list for recursive tree walkers.\n *\n * Every walker that enumerates the project tree (glob, grep's native\n * fallback, tree, the codebase indexer, the chronicle file observer, the\n * semantic-search indexer, project fingerprinting, security scans) should\n * start from this list instead of hand-rolling its own \u2014 the hand-rolled\n * copies drifted, and a walker missing `.turbo` or `__pycache__` pays for\n * it by walking thousands of artifact files.\n *\n * The list is intentionally conservative: only dependency stores, VCS\n * internals, and build/cache artifacts that are never the subject of a\n * search. Directories a user may legitimately target (`.wrongstack`,\n * `vendor`, `out`) are NOT here \u2014 walkers with stricter needs append their\n * own entries.\n *\n * @module utils/walk-ignore\n */\n\n/** Directory basenames every recursive walker skips (matched per path segment). */\nexport const DEFAULT_WALK_IGNORE_DIRS: readonly string[] = Object.freeze([\n  'node_modules',\n  '.git',\n  'dist',\n  'build',\n  '.next',\n  '.nuxt',\n  '.turbo',\n  'coverage',\n  '.nyc_output',\n  '__snapshots__',\n  '__pycache__',\n  '.venv',\n  'venv',\n  'target',\n  '.cache',\n  '.parcel-cache',\n  '.pnpm-store',\n  '.gradle',\n]);\n\n/** Set form of {@link DEFAULT_WALK_IGNORE_DIRS} for per-segment membership checks. */\nexport const DEFAULT_WALK_IGNORE_SET: ReadonlySet<string> = new Set(DEFAULT_WALK_IGNORE_DIRS);\n", "import { createHash } from 'node:crypto';\nimport * as os from 'node:os';\nimport * as path from 'node:path';\n\nexport interface ChronicleRuntimeIdentityInput {\n  globalRoot: string;\n  projectId: string;\n  projectDir: string;\n  now?: Date | undefined;\n}\n\nexport interface ChronicleRuntimeLocation {\n  installationId: string;\n  machineId: string;\n  projectId: string;\n  /** Directory holding this project's Chronicle storage, whatever its format. */\n  chronicleDirectory: string;\n  /**\n   * Day this location was resolved for, `YYYY-MM-DD` UTC.\n   *\n   * It is also the chain scope: the legacy writer used it to name a partition\n   * file, and SQLite uses it as the `day` column. Exposing the day rather than\n   * a `.jsonl` path keeps identity resolution independent of storage format.\n   */\n  day: string;\n}\n\n/**\n * Resolve privacy-preserving stable IDs and the UTC day that scopes a chain.\n * Raw host names and global paths never enter the journal envelope.\n */\nexport function resolveChronicleRuntimeLocation(\n  input: ChronicleRuntimeIdentityInput,\n): ChronicleRuntimeLocation {\n  const day = (input.now ?? new Date()).toISOString().slice(0, 10);\n  return {\n    installationId: stableId('installation', path.resolve(input.globalRoot)),\n    machineId: stableId('machine', `${os.hostname()}\\0${os.platform()}\\0${os.arch()}`),\n    projectId: input.projectId,\n    chronicleDirectory: path.join(input.projectDir, 'chronicle'),\n    day,\n  };\n}\n\nfunction stableId(prefix: string, value: string): string {\n  return `${prefix}_${createHash('sha256').update(value).digest('hex').slice(0, 24)}`;\n}\n", "import { randomUUID } from 'node:crypto';\nimport { createReadStream } from 'node:fs';\nimport * as fs from 'node:fs/promises';\nimport * as path from 'node:path';\nimport { createInterface } from 'node:readline';\nimport { atomicWrite, withFileLock } from '../utils/atomic-write.js';\nimport { GENESIS_HASH, hashValue } from './event-hash.js';\nimport { comparePartitionPaths } from './partition-filename.js';\nimport {\n  CHRONICLE_SCHEMA_VERSION,\n  type ChronicleEvent,\n  type ChronicleEventInput,\n  type ChronicleVerifyResult,\n} from './types.js';\n\nconst DEFAULT_MAX_PARTITION_BYTES = 100 * 1024 * 1024;\nconst DEFAULT_ROTATION_WINDOW_MS = 60 * 60 * 1000;\nconst RETENTION_CHECKPOINT_VERSION = 1;\n\nexport interface ChronicleRetentionCheckpoint {\n  version: typeof RETENTION_CHECKPOINT_VERSION;\n  sequence: number;\n  hash: string;\n}\n\nexport interface ChronicleJournalOptions {\n  filePath: string;\n  now?: (() => Date) | undefined;\n  monotonicNow?: (() => bigint) | undefined;\n  idFactory?: (() => string) | undefined;\n  maxPending?: number | undefined;\n  batchWindowMs?: number | undefined;\n  maxPartitionSizeBytes?: number | undefined;\n  rotationWindowMs?: number | undefined;\n  retentionDays?: number | undefined;\n  autoPurgeIntervalMs?: number | undefined;\n}\nexport interface ChronicleJournalStats {\n  acceptedEvents: number; persistedEvents: number; rejectedEvents: number; failedEvents: number;\n  batches: number; pendingEvents: number; maxObservedPending: number; largestBatch: number;\n  lastBatchDurationMs?: number | undefined;\n  partitionRolls: number;\n}\nexport interface ChroniclePurgeOptions {\n  retentionDays: number;\n  dryRun?: boolean | undefined;\n  files?: string[] | undefined;\n}\nexport interface ChroniclePurgeResult {\n  deletedCount: number;\n  deletedBytes: number;\n  skippedCount: number;\n  errors: Array<{ file: string; reason: string }>;\n  candidates?: string[] | undefined;\n}\n\nexport class ChronicleJournal {\n  private readonly basePath: string;\n  private readonly now: () => Date;\n  private readonly monotonicNow: () => bigint;\n  private readonly idFactory: () => string;\n  private readonly maxPending: number;\n  private readonly batchWindowMs: number;\n  private readonly maxPartitionSizeBytes: number;\n  private readonly rotationWindowMs: number;\n  private readonly retentionDays: number;\n  private readonly autoPurgeIntervalMs: number;\n  private pending: Array<{ input: ChronicleEventInput; resolve: (event: ChronicleEvent) => void; reject: (error: unknown) => void; }> = [];\n  private drainPromise: Promise<void> | undefined;\n  private drainScheduled = false;\n  private drainTimer: ReturnType<typeof setTimeout> | undefined;\n  private readonly counters = { acceptedEvents: 0, persistedEvents: 0, rejectedEvents: 0, failedEvents: 0, batches: 0, maxObservedPending: 0, largestBatch: 0, partitionRolls: 0 };\n  private lastBatchDurationMs: number | undefined;\n  private partitionIndex = 0;\n  private partitionStartedAt: number;\n  private partitionSizeBytes = 0;\n  private stateInitialized = false;\n  private lastSequence = 0;\n  private lastHash: string = GENESIS_HASH;\n  private lastAutoPurgeAt = 0;\n\n  constructor(options: ChronicleJournalOptions) {\n    this.basePath = path.resolve(options.filePath);\n    this.now = options.now ?? (() => new Date());\n    this.monotonicNow = options.monotonicNow ?? (() => process.hrtime.bigint());\n    this.idFactory = options.idFactory ?? randomUUID;\n    this.maxPending = Math.max(1, options.maxPending ?? 100_000);\n    this.batchWindowMs = Math.max(0, options.batchWindowMs ?? 5);\n    this.maxPartitionSizeBytes = options.maxPartitionSizeBytes ?? DEFAULT_MAX_PARTITION_BYTES;\n    this.rotationWindowMs = options.rotationWindowMs ?? DEFAULT_ROTATION_WINDOW_MS;\n    this.retentionDays = options.retentionDays && Number.isFinite(options.retentionDays) && options.retentionDays > 0 ? options.retentionDays : 0;\n    this.autoPurgeIntervalMs = Math.max(0, options.autoPurgeIntervalMs ?? 3_600_000);\n    this.partitionStartedAt = Date.now();\n  }\n\n  get path(): string { return this.partitionIndex === 0 ? this.basePath : rotatedPath(this.basePath, this.partitionIndex); }\n\n  stats(): ChronicleJournalStats {\n    return { ...this.counters, pendingEvents: this.pending.length, ...(this.lastBatchDurationMs !== undefined ? { lastBatchDurationMs: this.lastBatchDurationMs } : {}) };\n  }\n\n  append(input: ChronicleEventInput): Promise<ChronicleEvent> {\n    if (this.pending.length >= this.maxPending) { this.counters.rejectedEvents++; return Promise.reject(new Error(`Chronicle backpressure limit reached (${this.maxPending} pending events)`)); }\n    const promise = new Promise<ChronicleEvent>((resolve, reject) => { this.pending.push({ input, resolve, reject }); });\n    this.counters.acceptedEvents++;\n    this.counters.maxObservedPending = Math.max(this.counters.maxObservedPending, this.pending.length);\n    this.scheduleDrain();\n    return promise;\n  }\n\n  async readAll(): Promise<ChronicleEvent[]> {\n    await this.flush();\n    const files = await collectPartitions(this.basePath);\n    const entries: ChronicleEvent[] = [];\n    for (const file of files) entries.push(...(await readEntriesStrict(file)));\n    return entries;\n  }\n\n  async flush(): Promise<void> {\n    if (this.drainTimer) { clearTimeout(this.drainTimer); this.drainTimer = undefined; this.drainScheduled = false; }\n    while (this.pending.length > 0 || this.drainPromise) {\n      if (this.pending.length > 0 && !this.drainPromise) this.startDrain();\n      await this.drainPromise;\n    }\n  }\n\n  async verify(): Promise<ChronicleVerifyResult> {\n    await this.flush();\n    const files = await collectPartitions(this.basePath);\n    const checkpointResult = await readRetentionCheckpoint(this.basePath);\n    if (checkpointResult.error) return { ok: false, entries: 0, brokenAt: 0, reason: checkpointResult.error };\n    return verifyPartitionFiles(files, checkpointResult.checkpoint);\n  }\n\n  async purge(options: ChroniclePurgeOptions): Promise<ChroniclePurgeResult> {\n    await this.flush();\n    if (!Number.isFinite(options.retentionDays) || options.retentionDays <= 0) {\n      throw new TypeError('Chronicle retentionDays must be a positive finite number');\n    }\n    await this.refreshStateFromDisk();\n    const cutoff = Date.now() - options.retentionDays * 86400000;\n    const activePath = path.resolve(this.path);\n    const errors: ChroniclePurgeResult['errors'] = [];\n    let dc = 0, db = 0, sc = 0;\n    const suppliedFiles = options.files === undefined\n      ? await collectJournalPartitions(this.basePath)\n      : [...options.files];\n    const eligible = new Set<string>();\n    for (const suppliedPath of new Set(suppliedFiles)) {\n      const file = path.resolve(suppliedPath);\n      if (!isJournalPartition(file, path.dirname(this.basePath), this.basePath)) {\n        errors.push({ file: suppliedPath, reason: 'not a Chronicle journal partition in this journal directory' });\n        sc++;\n        continue;\n      }\n      if (file === activePath) { sc++; continue; }\n      let mtimeMs: number;\n      try {\n        const fileStat = await fs.lstat(file);\n        if (!fileStat.isFile()) { sc++; continue; }\n        mtimeMs = fileStat.mtimeMs;\n      } catch (error) { if (isNotFound(error)) continue; errors.push({ file, reason: errorMessage(error) }); sc++; continue; }\n      if (mtimeMs > cutoff) { sc++; continue; }\n      eligible.add(file);\n    }\n\n    const candidates: string[] = [];\n    const allPartitions = await collectJournalPartitions(this.basePath);\n    for (const family of groupPartitionsByFamily(allPartitions).values()) {\n      for (const file of family) {\n        if (file === activePath || !eligible.has(file)) break;\n        candidates.push(file);\n        eligible.delete(file);\n      }\n    }\n    sc += eligible.size;\n\n    if (!options.dryRun) {\n      for (const file of candidates) {\n        try {\n          const familyBase = partitionFamilyBase(file);\n          let deletedBytes: number | undefined;\n          await withFileLock(familyBase, async () => {\n            const fileStat = await fs.lstat(file);\n            if (!fileStat.isFile() || fileStat.mtimeMs > cutoff) return;\n            const checkpointResult = await readRetentionCheckpoint(familyBase);\n            if (checkpointResult.error) throw new Error(checkpointResult.error);\n            const checkpoint = checkpointResult.checkpoint;\n            const nextCheckpoint = await verifyRetainedPrefix(streamEntriesStrict(file), checkpoint);\n            if (!nextCheckpoint) throw new Error('partition does not extend the trusted Chronicle chain');\n            if (nextCheckpoint.sequence > (checkpoint?.sequence ?? 0)) {\n              await writeRetentionCheckpoint(familyBase, nextCheckpoint);\n            }\n            deletedBytes = fileStat.size;\n            await fs.unlink(file);\n          });\n          if (deletedBytes === undefined) { sc++; break; }\n          db += deletedBytes;\n          dc++;\n        } catch (error) {\n          errors.push({ file, reason: errorMessage(error) });\n          sc++;\n          // Candidates form an oldest-first prefix. Do not advance the\n          // checkpoint beyond a partition that could not be removed: if its\n          // checkpoint-covered bytes remain on disk, verify() must still be\n          // able to anchor and validate them against that checkpoint.\n          break;\n        }\n      }\n    }\n    return { deletedCount: dc, deletedBytes: db, skippedCount: sc, errors, ...(options.dryRun ? { candidates } : {}) };\n  }\n\n  private async maybeAutoPurge(): Promise<void> {\n    if (this.retentionDays <= 0) return;\n    const n = Date.now();\n    if (n - this.lastAutoPurgeAt < this.autoPurgeIntervalMs) return;\n    this.lastAutoPurgeAt = n;\n    try { await this.purge({ retentionDays: this.retentionDays }); } catch { /* best-effort */ }\n  }\n\n  private scheduleDrain(): void {\n    if (this.drainScheduled || this.drainPromise) return;\n    this.drainScheduled = true;\n    if (this.batchWindowMs === 0) {\n      queueMicrotask(() => {\n        this.drainScheduled = false;\n        this.startDrain();\n      });\n      return;\n    }\n    this.drainTimer = setTimeout(() => { this.drainTimer = undefined; this.drainScheduled = false; this.startDrain(); }, this.batchWindowMs);\n  }\n\n  private startDrain(): void {\n    if (this.drainPromise || this.pending.length === 0) return;\n    const batch = this.pending.splice(0);\n    const drain = this.persistBatch(batch);\n    this.drainPromise = drain.finally(() => { this.drainPromise = undefined; if (this.pending.length > 0) this.scheduleDrain(); });\n  }\n\n  private async refreshStateFromDisk(): Promise<void> {\n    const files = await collectPartitions(this.basePath);\n    const latest = files[files.length - 1] ?? this.basePath;\n    this.partitionIndex = partitionIndex(latest, this.basePath);\n    const state = await readLastEntryState(latest);\n    const entry = state.entry;\n    // A non-empty active partition already carries the latest sequence and\n    // hash-chain anchor. The retention checkpoint is only needed when no\n    // retained event exists, so avoid opening (or probing for) the sidecar on\n    // every normal append batch.\n    const checkpointResult = entry ? {} : await readRetentionCheckpoint(this.basePath);\n    if (checkpointResult.error) throw new Error(checkpointResult.error);\n    const checkpoint = checkpointResult.checkpoint;\n    this.lastSequence = entry?.sequence ?? checkpoint?.sequence ?? 0;\n    this.lastHash = entry?.hash ?? checkpoint?.hash ?? GENESIS_HASH;\n    this.partitionSizeBytes = state.size;\n    this.partitionStartedAt = state.birthtimeMs ?? Date.now();\n    this.stateInitialized = true;\n  }\n\n  private async canReuseDiskState(): Promise<boolean> {\n    if (!this.stateInitialized) return false;\n    const nextPartition = rotatedPath(this.basePath, this.partitionIndex + 1);\n    const [currentStat, nextExists] = await Promise.all([\n      fs.stat(this.path).catch((error: unknown) => {\n        if (isNotFound(error)) return undefined;\n        throw error;\n      }),\n      fs.access(nextPartition).then(\n        () => true,\n        (error: unknown) => {\n          if (isNotFound(error)) return false;\n          throw error;\n        },\n      ),\n    ]);\n    // Appends change the active partition size; rotations create the next\n    // numbered partition. If neither happened since our last successful\n    // batch, the cached sequence/hash anchor is still current and there is no\n    // need to rescan the directory or read the JSONL tail again.\n    return currentStat?.isFile() === true && currentStat.size === this.partitionSizeBytes && !nextExists;\n  }\n\n  private async checkRotation(): Promise<void> {\n    if (this.partitionIndex === 0 && this.lastSequence === 0) return;\n    if (Number.isFinite(this.rotationWindowMs) && Date.now() - this.partitionStartedAt >= this.rotationWindowMs) { this.rotate(); return; }\n    if (Number.isFinite(this.maxPartitionSizeBytes) && this.partitionSizeBytes >= this.maxPartitionSizeBytes) this.rotate();\n  }\n\n  private rotate(): void { this.partitionIndex++; this.partitionStartedAt = Date.now(); this.partitionSizeBytes = 0; this.counters.partitionRolls++; }\n\n  private async persistBatch(batch: typeof this.pending): Promise<void> {\n    const started = performance.now();\n    this.counters.batches++;\n    this.counters.largestBatch = Math.max(this.counters.largestBatch, batch.length);\n    try {\n      let recorded: ChronicleEvent[] = [];\n      await withFileLock(this.basePath, async () => {\n        if (!(await this.canReuseDiskState())) await this.refreshStateFromDisk();\n        await this.checkRotation();\n        const cp = this.path;\n        let prev: { sequence: number; hash: string } | undefined = this.lastSequence > 0 ? { sequence: this.lastSequence, hash: this.lastHash } : undefined;\n        recorded = batch.map(({ input }) => {\n          const instant = this.now().toISOString();\n          const uh = { ...input, occurredAt: input.occurredAt ?? instant, monotonicNs: input.monotonicNs ?? this.monotonicNow().toString(), schemaVersion: CHRONICLE_SCHEMA_VERSION, eventId: this.idFactory(), observedAt: instant, persistedAt: instant, sequence: (prev?.sequence ?? 0) + 1, previousHash: prev?.hash ?? GENESIS_HASH };\n          const event: ChronicleEvent = { ...uh, hash: hashValue(uh) };\n          prev = event;\n          return event;\n        });\n        const serialized = recorded.map((e) => JSON.stringify(e)).join('\\n') + '\\n';\n        await fs.appendFile(cp, serialized, 'utf8');\n        this.partitionSizeBytes += Buffer.byteLength(serialized);\n      });\n      const last = recorded[recorded.length - 1]!;\n      this.lastSequence = last.sequence;\n      this.lastHash = last.hash;\n      batch.forEach((item, i) => { item.resolve(recorded[i]!); });\n      this.counters.persistedEvents += batch.length;\n      void this.maybeAutoPurge();\n    } catch (error) {\n      // appendFile can fail after a partial write. Force the next batch to\n      // rebuild its chain anchor from disk instead of trusting local counters.\n      this.stateInitialized = false;\n      this.counters.failedEvents += batch.length;\n      batch.forEach((item) => { item.reject(error); });\n    } finally { this.lastBatchDurationMs = performance.now() - started; }\n  }\n}\n\nfunction rotatedPath(basePath: string, index: number): string {\n  const dir = path.dirname(basePath);\n  const ext = path.extname(basePath);\n  const base = path.basename(basePath, ext);\n  return path.join(dir, `${base}.${String(index).padStart(5, '0')}${ext}`);\n}\n\n/**\n * Exported for the SQLite migration only (`legacy-journal-import.ts`).\n *\n * The importer has to walk partitions in exactly the order the writer produced\n * them and parse them with exactly the same strictness, so it reuses these\n * rather than growing a second implementation that could disagree about\n * rotation order or malformed lines. All three go away with the legacy reader\n * in phase 4 of `chronicle-sqlite-journal-v1`.\n */\nexport async function collectPartitions(basePath: string): Promise<string[]> {\n  const dir = path.dirname(basePath);\n  const ext = path.extname(basePath);\n  const base = path.basename(basePath, ext);\n  const pattern = new RegExp(`^${escapeRegex(base)}(?:\\\\.\\\\d{5})?${escapeRegex(ext)}$`);\n  const result: string[] = [];\n  try {\n    const entries = await fs.readdir(dir, { withFileTypes: true });\n    for (const entry of entries) if (entry.isFile() && pattern.test(entry.name)) result.push(path.join(dir, entry.name));\n  } catch { /* ok */ }\n  const baseFile = path.join(dir, base + ext);\n  const rotated = result.filter((file) => file !== baseFile).sort((left, right) => parseIndex(left, base, ext) - parseIndex(right, base, ext));\n  return [baseFile, ...rotated];\n}\n\nasync function collectJournalPartitions(basePath: string): Promise<string[]> {\n  const directory = path.dirname(basePath);\n  const result: string[] = [];\n  try {\n    const entries = await fs.readdir(directory, { withFileTypes: true });\n    for (const entry of entries) {\n      const file = path.join(directory, entry.name);\n      if (entry.isFile() && isJournalPartition(file, directory, basePath)) result.push(file);\n    }\n  } catch { /* ok */ }\n  return result.sort(comparePartitionPaths);\n}\n\nfunction isJournalPartition(filePath: string, directory: string, basePath?: string): boolean {\n  if (path.dirname(path.resolve(filePath)) !== path.resolve(directory)) return false;\n  const fileName = path.basename(filePath);\n  if (!basePath) return false;\n  const baseName = path.basename(basePath);\n  const dailyFamily = /^\\d{4}-\\d{2}-\\d{2}\\.events(?:\\.\\d{5})?\\.jsonl$/;\n  if (/^\\d{4}-\\d{2}-\\d{2}\\.events\\.jsonl$/.test(baseName)) return dailyFamily.test(fileName);\n  return partitionFamilyBase(path.resolve(filePath)) === partitionFamilyBase(path.resolve(basePath));\n}\n\nfunction groupPartitionsByFamily(files: string[]): Map<string, string[]> {\n  const groups = new Map<string, string[]>();\n  for (const file of files) {\n    const family = partitionFamilyBase(file);\n    const group = groups.get(family) ?? [];\n    group.push(file);\n    groups.set(family, group);\n  }\n  return groups;\n}\n\nfunction partitionFamilyBase(filePath: string): string {\n  return filePath.replace(/\\.\\d{5}(?=\\.jsonl$)/, '');\n}\n\nfunction retentionCheckpointPath(basePath: string): string {\n  return `${partitionFamilyBase(basePath)}.retention.json`;\n}\n\nasync function verifyRetainedPrefix(\n  entries: AsyncIterable<ChronicleEvent>,\n  checkpoint: ChronicleRetentionCheckpoint | undefined,\n): Promise<ChronicleRetentionCheckpoint | undefined> {\n  let sequence = checkpoint?.sequence ?? 0;\n  let hash = checkpoint?.hash ?? GENESIS_HASH;\n  let advanced = false;\n  let sawEntry = false;\n  for await (const entry of entries) {\n    sawEntry = true;\n    if (entry.sequence <= sequence) continue;\n    if (entry.sequence !== sequence + 1 || entry.previousHash !== hash) return undefined;\n    const { hash: recordedHash, ...content } = entry;\n    if (hashValue(content) !== recordedHash) return undefined;\n    sequence = entry.sequence;\n    hash = recordedHash;\n    advanced = true;\n  }\n  if (!sawEntry) return undefined;\n  if (!advanced) return checkpoint;\n  return { version: RETENTION_CHECKPOINT_VERSION, sequence, hash };\n}\n\nasync function verifyPartitionFiles(\n  files: string[],\n  checkpoint: ChronicleRetentionCheckpoint | undefined,\n): Promise<ChronicleVerifyResult> {\n  const checkpointSequence = checkpoint?.sequence ?? 0;\n  let previousHash = checkpoint?.hash ?? GENESIS_HASH;\n  let entries = 0;\n  let lastSequence = checkpointSequence;\n  let coveredPrevious: ChronicleEvent | undefined;\n  for (const file of files) {\n    try {\n      for await (const entry of streamEntriesStrict(file)) {\n        const { hash: recordedHash, ...content } = entry;\n        if (entry.sequence <= checkpointSequence) {\n          // A checkpoint can be durably renamed just before its source\n          // partition fails to unlink. Such retained bytes are still evidence:\n          // validate them rather than treating every covered sequence as absent.\n          if (hashValue(content) !== recordedHash) return { ok: false, entries, brokenAt: entries, reason: 'entry hash mismatch' };\n          if (coveredPrevious && entry.sequence !== coveredPrevious.sequence + 1) {\n            return { ok: false, entries, brokenAt: entries, reason: `sequence ${entry.sequence} is not ${coveredPrevious.sequence + 1}` };\n          }\n          if (coveredPrevious && entry.previousHash !== coveredPrevious.hash) {\n            return { ok: false, entries, brokenAt: entries, reason: 'previous hash mismatch' };\n          }\n          if (entry.sequence === checkpointSequence && recordedHash !== checkpoint?.hash) {\n            return { ok: false, entries, brokenAt: entries, reason: 'retention checkpoint hash mismatch' };\n          }\n          coveredPrevious = entry;\n          continue;\n        }\n        const index = entries++;\n        if (entry.sequence !== lastSequence + 1) return { ok: false, entries, brokenAt: index, reason: `sequence ${entry.sequence} is not ${lastSequence + 1}` };\n        if (entry.previousHash !== previousHash) return { ok: false, entries, brokenAt: index, reason: 'previous hash mismatch' };\n        if (hashValue(content) !== recordedHash) return { ok: false, entries, brokenAt: index, reason: 'entry hash mismatch' };\n        previousHash = recordedHash;\n        lastSequence = entry.sequence;\n      }\n    } catch (error) { return { ok: false, entries, brokenAt: entries, reason: errorMessage(error) }; }\n  }\n  if (\n    coveredPrevious &&\n    (coveredPrevious.sequence !== checkpointSequence || coveredPrevious.hash !== checkpoint?.hash)\n  ) {\n    return { ok: false, entries, brokenAt: entries, reason: 'retention checkpoint hash mismatch' };\n  }\n  return { ok: true, entries, lastSequence, lastHash: previousHash };\n}\n\nexport async function readRetentionCheckpoint(basePath: string): Promise<{\n  checkpoint?: ChronicleRetentionCheckpoint | undefined;\n  error?: string | undefined;\n}> {\n  const checkpointPath = retentionCheckpointPath(basePath);\n  let raw: string;\n  try { raw = await fs.readFile(checkpointPath, 'utf8'); } catch (error) {\n    return isNotFound(error) ? {} : { error: `cannot read retention checkpoint: ${errorMessage(error)}` };\n  }\n  try {\n    const parsed = JSON.parse(raw) as Partial<ChronicleRetentionCheckpoint>;\n    if (parsed.version !== RETENTION_CHECKPOINT_VERSION || !Number.isSafeInteger(parsed.sequence) || (parsed.sequence ?? -1) < 0 || !isHash(parsed.hash)) {\n      return { error: 'invalid Chronicle retention checkpoint' };\n    }\n    return { checkpoint: parsed as ChronicleRetentionCheckpoint };\n  } catch { return { error: 'invalid Chronicle retention checkpoint JSON' }; }\n}\n\nasync function writeRetentionCheckpoint(basePath: string, checkpoint: ChronicleRetentionCheckpoint): Promise<void> {\n  await atomicWrite(retentionCheckpointPath(basePath), `${JSON.stringify(checkpoint)}\\n`, { mode: 0o600 });\n}\n\nfunction isHash(value: unknown): value is string {\n  return typeof value === 'string' && /^[a-f0-9]{64}$/.test(value);\n}\n\nfunction parseIndex(filePath: string, base: string, ext: string): number {\n  const suffix = path.basename(filePath).slice(base.length + 1, -ext.length);\n  return suffix ? parseInt(suffix, 10) : 0;\n}\n\nfunction partitionIndex(filePath: string, basePath: string): number {\n  const ext = path.extname(basePath);\n  return parseIndex(filePath, path.basename(basePath, ext), ext);\n}\n\nfunction escapeRegex(text: string): string { return text.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&'); }\n\nasync function readLastEntryState(filePath: string): Promise<{\n  entry?: ChronicleEvent | undefined;\n  size: number;\n  birthtimeMs?: number | undefined;\n}> {\n  let handle: fs.FileHandle;\n  try { handle = await fs.open(filePath, 'r'); } catch (error) { if (isNotFound(error)) return { size: 0 }; throw error; }\n  try {\n    const stat = await handle.stat();\n    const size = stat.size;\n    let position = size, suffix = '';\n    while (position > 0) {\n      const length = Math.min(65536, position);\n      position -= length;\n      const buf = Buffer.allocUnsafe(length);\n      await handle.read(buf, 0, length, position);\n      suffix = buf.toString('utf8') + suffix;\n      const lines = suffix.split('\\n');\n      const start = position === 0 ? 0 : 1;\n      for (let i = lines.length - 1; i >= start; i--) {\n        const trimmed = lines[i]!.trim();\n        if (!trimmed) continue;\n        try { return { entry: JSON.parse(trimmed) as ChronicleEvent, size, birthtimeMs: stat.birthtimeMs }; } catch { /* scan earlier */ }\n      }\n      suffix = lines[0] ?? '';\n    }\n    return { size, birthtimeMs: stat.birthtimeMs };\n  } finally { await handle.close(); }\n}\n\n/** Stream entries line by line. Reading a whole partition into one string\n *  breaks past V8's max string length (~512MB) \u2014 purge and verify must work\n *  on partitions of any size, so only individual lines are materialized. */\nexport async function* streamEntriesStrict(filePath: string): AsyncGenerator<ChronicleEvent> {\n  let lineNumber = 0;\n  try {\n    const input = createReadStream(filePath, { encoding: 'utf8', highWaterMark: 256 * 1024 });\n    const lines = createInterface({ input, crlfDelay: Infinity });\n    for await (const line of lines) {\n      lineNumber++;\n      const trimmed = line.trim();\n      if (!trimmed) continue;\n      let entry: ChronicleEvent;\n      try { entry = JSON.parse(trimmed) as ChronicleEvent; } catch { throw new Error(`invalid JSON at line ${lineNumber} in ${path.basename(filePath)}`); }\n      yield entry;\n    }\n  } catch (error) {\n    if (isNotFound(error)) return;\n    throw error;\n  }\n}\n\nasync function readEntriesStrict(filePath: string): Promise<ChronicleEvent[]> {\n  const entries: ChronicleEvent[] = [];\n  for await (const entry of streamEntriesStrict(filePath)) entries.push(entry);\n  return entries;\n}\n\nfunction isNotFound(error: unknown): boolean { return typeof error === 'object' && error !== null && 'code' in error && error.code === 'ENOENT'; }\nfunction errorMessage(error: unknown): string { return error instanceof Error ? error.message : String(error); }\n\nexport { GENESIS_HASH };\n", "import type { FileHandle } from 'node:fs/promises';\nimport {\n  type AtomicWriteOptions,\n  createPersistencePrimitives,\n  type FileLockOptions,\n} from '@wrongstack/persistence';\nimport { FsError } from '../types/errors.js';\n\nexport type { AtomicWriteOptions, FileLockOptions } from '@wrongstack/persistence';\n\nconst primitives = createPersistencePrimitives({\n  createLockTimeoutError: ({ targetPath, timeoutMs }) =>\n    new FsError({\n      message: `Timed out waiting for file lock: ${targetPath}`,\n      code: 'FS_ATOMIC_WRITE_FAILED',\n      path: targetPath,\n      context: { timeoutMs },\n    }),\n});\n\nexport const atomicWrite: (\n  targetPath: string,\n  content: string | Uint8Array,\n  opts?: AtomicWriteOptions,\n) => Promise<void> = primitives.atomicWrite;\n/**\n * Atomic replace that streams its new contents instead of taking them as one\n * buffer. Use when the replacement is large enough that materializing it would\n * itself be the memory problem (log rotation, tail compaction).\n */\nexport const atomicReplaceWithWriter: <T>(\n  targetPath: string,\n  write: (handle: FileHandle) => Promise<T>,\n  opts?: AtomicWriteOptions,\n) => Promise<T> = primitives.atomicReplaceWithWriter;\nexport const ensureDir: (dir: string) => Promise<void> = primitives.ensureDir;\nexport const withFileLock: <T>(\n  targetPath: string,\n  fn: () => Promise<T>,\n  opts?: FileLockOptions,\n) => Promise<T> = primitives.withFileLock;\n", "import { toErrorMessage } from '../utils/error.js';\n\n/**\n * WrongStack error hierarchy.\n *\n * Every error thrown by the framework is a `WrongStackError` with a\n * machine-readable `code`, a `subsystem` tag, and a `severity` level.\n * This lets consumers (CLI, TUI, plugins, tests) branch on structured\n * data instead of parsing error messages.\n */\n\n// \u2500\u2500 Error codes \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Machine-readable error codes as frozen constants.\n *\n * Use `ERROR_CODES.X` instead of raw string literals for:\n * - IDE autocomplete and compile-time validation\n * - Safe refactoring (rename updates all usages)\n * - Plugin extensibility (extend the object to add custom codes)\n *\n * The `ErrorCode` type is derived from this object, so adding a new\n * code here automatically updates the type without extra changes.\n */\nexport const ERROR_CODES = {\n  // Provider\n  PROVIDER_RATE_LIMITED: 'PROVIDER_RATE_LIMITED',\n  PROVIDER_AUTH_FAILED: 'PROVIDER_AUTH_FAILED',\n  PROVIDER_OVERLOADED: 'PROVIDER_OVERLOADED',\n  PROVIDER_INVALID_REQUEST: 'PROVIDER_INVALID_REQUEST',\n  PROVIDER_SERVER_ERROR: 'PROVIDER_SERVER_ERROR',\n  PROVIDER_NETWORK_ERROR: 'PROVIDER_NETWORK_ERROR',\n  PROVIDER_CONTEXT_OVERFLOW: 'PROVIDER_CONTEXT_OVERFLOW',\n  // Tool\n  TOOL_NOT_FOUND: 'TOOL_NOT_FOUND',\n  TOOL_PERMISSION_DENIED: 'TOOL_PERMISSION_DENIED',\n  TOOL_EXECUTION_FAILED: 'TOOL_EXECUTION_FAILED',\n  TOOL_TIMEOUT: 'TOOL_TIMEOUT',\n  TOOL_INPUT_INVALID: 'TOOL_INPUT_INVALID',\n  // Config\n  CONFIG_INVALID: 'CONFIG_INVALID',\n  CONFIG_NOT_FOUND: 'CONFIG_NOT_FOUND',\n  CONFIG_PARSE_FAILED: 'CONFIG_PARSE_FAILED',\n  CONFIG_MIGRATION_NEEDED: 'CONFIG_MIGRATION_NEEDED',\n  // Plugin\n  PLUGIN_LOAD_FAILED: 'PLUGIN_LOAD_FAILED',\n  PLUGIN_API_MISMATCH: 'PLUGIN_API_MISMATCH',\n  PLUGIN_MISSING_DEPENDENCY: 'PLUGIN_MISSING_DEPENDENCY',\n  // Agent\n  AGENT_ITERATION_LIMIT: 'AGENT_ITERATION_LIMIT',\n  AGENT_CONTEXT_OVERFLOW: 'AGENT_CONTEXT_OVERFLOW',\n  AGENT_ABORTED: 'AGENT_ABORTED',\n  AGENT_RUN_FAILED: 'AGENT_RUN_FAILED',\n  // Session\n  SESSION_NOT_FOUND: 'SESSION_NOT_FOUND',\n  SESSION_CORRUPTED: 'SESSION_CORRUPTED',\n  SESSION_WRITE_FAILED: 'SESSION_WRITE_FAILED',\n  // Container / Registry\n  CONTAINER_TOKEN_ALREADY_BOUND: 'CONTAINER_TOKEN_ALREADY_BOUND',\n  CONTAINER_TOKEN_NOT_BOUND: 'CONTAINER_TOKEN_NOT_BOUND',\n  CONTAINER_CIRCULAR_DEPENDENCY: 'CONTAINER_CIRCULAR_DEPENDENCY',\n  REGISTRY_DUPLICATE: 'REGISTRY_DUPLICATE',\n  REGISTRY_NOT_FOUND: 'REGISTRY_NOT_FOUND',\n  REGISTRY_INVALID: 'REGISTRY_INVALID',\n  // File system\n  FS_READ_FAILED: 'FS_READ_FAILED',\n  FS_WRITE_FAILED: 'FS_WRITE_FAILED',\n  FS_MKDIR_FAILED: 'FS_MKDIR_FAILED',\n  FS_DELETE_FAILED: 'FS_DELETE_FAILED',\n  FS_ATOMIC_WRITE_FAILED: 'FS_ATOMIC_WRITE_FAILED',\n  // SDD (Spec-Driven Development)\n  SDD_VALIDATION_FAILED: 'SDD_VALIDATION_FAILED',\n  SDD_PARSE_FAILED: 'SDD_PARSE_FAILED',\n  SDD_INVALID_STATE: 'SDD_INVALID_STATE',\n  SDD_NOT_READY: 'SDD_NOT_READY',\n  // General\n  VALIDATION_ERROR: 'VALIDATION_ERROR',\n  PARSE_FAILED: 'PARSE_FAILED',\n  UNKNOWN: 'UNKNOWN',\n} as const;\n\n/**\n * Union type derived from `ERROR_CODES`. Using `typeof ERROR_CODES[keyof typeof ERROR_CODES]`\n * instead of a string literal union means TypeScript auto-updates the type whenever\n * a new code is added to `ERROR_CODES` \u2014 no need to keep two lists in sync.\n */\nexport type ErrorCode = (typeof ERROR_CODES)[keyof typeof ERROR_CODES];\n\nexport type ErrorSubsystem =\n  | 'provider'\n  | 'tool'\n  | 'config'\n  | 'plugin'\n  | 'agent'\n  | 'session'\n  | 'sdd'\n  | 'container'\n  | 'fs'\n  | 'general';\nexport type ErrorSeverity = 'fatal' | 'error' | 'warning';\n\n// \u2500\u2500 Base error class \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport class WrongStackError extends Error {\n  readonly code: ErrorCode;\n  readonly subsystem: ErrorSubsystem;\n  readonly severity: ErrorSeverity;\n  readonly recoverable: boolean;\n  readonly context?: Record<string, unknown> | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: ErrorCode;\n    subsystem: ErrorSubsystem;\n    severity?: ErrorSeverity | undefined;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super(opts.message, { cause: opts.cause });\n    this.name = 'WrongStackError';\n    this.code = opts.code;\n    this.subsystem = opts.subsystem;\n    this.severity = opts.severity ?? 'error';\n    this.recoverable = opts.recoverable ?? false;\n    this.context = opts.context;\n  }\n\n  /**\n   * Render a one-line user-facing description.\n   * Subclasses should override for domain-specific formatting.\n   */\n  describe(): string {\n    const ctx = this.context ? ` ${formatContext(this.context)}` : '';\n    return `${this.code}: ${this.message}${ctx}`;\n  }\n}\n\nfunction formatContext(ctx: Record<string, unknown>): string {\n  const parts = Object.entries(ctx)\n    .filter(([, v]) => v !== undefined)\n    .slice(0, 3)\n    .map(([k, v]) => `${k}=${String(v)}`);\n  return parts.length > 0 ? `[${parts.join(' ')}]` : '';\n}\n\n// \u2500\u2500 Specific error classes \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Tool execution errors \u2014 thrown by ToolExecutor and individual tools.\n */\nexport class ToolError extends WrongStackError {\n  readonly toolName: string;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      | 'TOOL_NOT_FOUND'\n      | 'TOOL_PERMISSION_DENIED'\n      | 'TOOL_EXECUTION_FAILED'\n      | 'TOOL_TIMEOUT'\n      | 'TOOL_INPUT_INVALID'\n    >;\n    toolName: string;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'tool',\n      recoverable: opts.recoverable,\n      context: { tool: opts.toolName, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ToolError';\n    this.toolName = opts.toolName;\n  }\n}\n\n/**\n * Config loading / validation errors.\n */\nexport class ConfigError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'CONFIG_INVALID' | 'CONFIG_NOT_FOUND' | 'CONFIG_PARSE_FAILED' | 'CONFIG_MIGRATION_NEEDED'\n    >;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'config',\n      severity: 'fatal',\n      recoverable: false,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'ConfigError';\n  }\n}\n\n/**\n * Plugin loading / lifecycle errors.\n */\nexport class PluginError extends WrongStackError {\n  readonly pluginName: string;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'PLUGIN_LOAD_FAILED' | 'PLUGIN_API_MISMATCH' | 'PLUGIN_MISSING_DEPENDENCY'\n    >;\n    pluginName: string;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'plugin',\n      severity: 'error',\n      recoverable: opts.code === ERROR_CODES.PLUGIN_MISSING_DEPENDENCY,\n      context: { plugin: opts.pluginName, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'PluginError';\n    this.pluginName = opts.pluginName;\n  }\n}\n\n/**\n * Agent runtime errors \u2014 thrown by Agent.run when a non-WrongStackError\n * escapes the inner loop, so callers always see a structured error.\n */\nexport class AgentError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'AGENT_ITERATION_LIMIT' | 'AGENT_CONTEXT_OVERFLOW' | 'AGENT_ABORTED' | 'AGENT_RUN_FAILED'\n    >;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'agent',\n      severity: opts.code === ERROR_CODES.AGENT_ABORTED ? 'warning' : 'error',\n      recoverable: opts.recoverable ?? opts.code === ERROR_CODES.AGENT_ITERATION_LIMIT,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'AgentError';\n  }\n}\n\n/**\n * Wrap an arbitrary thrown value into a `WrongStackError` so the caller\n * always gets a structured error. Pass-throughs WrongStackError instances\n * unchanged; raw `Error`s and primitives get an `AGENT_RUN_FAILED` wrapper\n * with the original preserved as `cause`.\n */\nexport function toWrongStackError(\n  err: unknown,\n  code: Extract<ErrorCode, 'AGENT_RUN_FAILED' | 'AGENT_ABORTED' | 'UNKNOWN'> = ERROR_CODES.AGENT_RUN_FAILED,\n): WrongStackError {\n  if (err instanceof WrongStackError) return err;\n  const message = toErrorMessage(err);\n  return new AgentError({\n    message,\n    code: code === 'UNKNOWN' ? ERROR_CODES.AGENT_RUN_FAILED : code,\n    cause: err,\n  });\n}\n\n/**\n * Session storage errors.\n */\nexport class SessionError extends WrongStackError {\n  readonly sessionId?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<ErrorCode, 'SESSION_NOT_FOUND' | 'SESSION_CORRUPTED' | 'SESSION_WRITE_FAILED'>;\n    sessionId?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'session',\n      severity: opts.code === ERROR_CODES.SESSION_WRITE_FAILED ? 'error' : 'warning',\n      recoverable: opts.code !== ERROR_CODES.SESSION_CORRUPTED,\n      context: { sessionId: opts.sessionId, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'SessionError';\n    this.sessionId = opts.sessionId;\n  }\n}\n\n/**\n * SDD (Spec-Driven Development) errors \u2014 spec validation, parsing, and\n * state machine violations in the AISpecBuilder, TaskFlow, and TaskTracker.\n */\nexport class SddError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'SDD_VALIDATION_FAILED' | 'SDD_PARSE_FAILED' | 'SDD_INVALID_STATE' | 'SDD_NOT_READY'\n    >;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'sdd',\n      severity: opts.code === ERROR_CODES.SDD_PARSE_FAILED ? 'warning' : 'error',\n      recoverable: opts.code === ERROR_CODES.SDD_NOT_READY,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'SddError';\n  }\n}\n\n/**\n * File system operation errors.\n */\nexport class FsError extends WrongStackError {\n  readonly path?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'FS_READ_FAILED' | 'FS_WRITE_FAILED' | 'FS_MKDIR_FAILED' | 'FS_DELETE_FAILED' | 'FS_ATOMIC_WRITE_FAILED'\n    >;\n    path?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'fs',\n      severity: 'error',\n      recoverable: opts.code !== ERROR_CODES.FS_READ_FAILED,\n      context: { path: opts.path, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'FsError';\n    this.path = opts.path;\n  }\n}\n\n/**\n * HTTP fetch error \u2014 thrown when a network request returns a non-OK status.\n * Carries the response status so {@link classifyToolError} can branch on it\n * (429 \u2192 transient, 404 \u2192 not_found, 401 \u2192 permission) without duck-typing\n * the error via `'response' in err`.\n *\n * P3 #18 (before-release.md): the previous `'response' in err` check caught\n * any Error with a `response` property, including custom errors, proxy\n * objects, or mocked errors in tests. `instanceof FetchError` is reliable.\n *\n * Tools and providers that make HTTP requests and need the executor to\n * classify their failures should throw `new FetchError({ status, message })`\n * instead of a bare `Error` with an ad-hoc `response` field.\n */\nexport class FetchError extends WrongStackError {\n  readonly status: number;\n\n  constructor(opts: {\n    message: string;\n    status: number;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.VALIDATION_ERROR,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: opts.status === 429 || opts.status >= 500,\n      context: { status: opts.status, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'FetchError';\n    this.status = opts.status;\n  }\n}\n\n/**\n * Tool input validation error \u2014 thrown when a tool's input fails a validation\n * check that the JSON Schema cannot express (e.g. `old_string === new_string`\n * in edit, or a cross-field invariant). Use this instead of a bare\n * `throw new Error('...validation...')` so {@link classifyToolError} can\n * match on `instanceof` rather than a locale-dependent message substring.\n *\n * P2 #6 (before-release.md): the previous `err.message.includes('validation')`\n * check misclassified any error whose message happened to contain \"validation\"\n * (e.g. a third-party \"input validation timeout\") as a VALIDATION error.\n *\n * Named `ToolValidationError` (not `ValidationError`) to avoid colliding with\n * the existing `ValidationError` interface exported by json-schema-validate.ts\n * (a validation-result shape, not an Error subclass).\n */\nexport class ToolValidationError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    /** Field path or tool name that failed validation, for diagnostics. */\n    field?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.VALIDATION_ERROR,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: false,\n      context: { field: opts.field, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ToolValidationError';\n  }\n}\n\n/**\n * Response / payload parse error \u2014 thrown when an upstream HTTP response,\n * file, or data structure is well-formed at the transport layer (HTTP 200,\n * valid JSON) but is missing required fields or has an unexpected shape.\n *\n * Distinct from `ConfigError(CONFIG_PARSE_FAILED)` (which is specifically\n * for config-file parsing) and `FetchError` (which covers HTTP non-OK\n * responses). `ParseError` fills the gap: the request succeeded but the\n * response body couldn't be interpreted.\n *\n * Common sites: OAuth token responses missing `access_token`, device-code\n * responses missing `device_code`, registry responses with unexpected\n * schemas.\n */\nexport class ParseError extends WrongStackError {\n  readonly source?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    /**\n     * What was being parsed \u2014 e.g. `'oauth-token-response'`,\n     * `'device-code-response'`. Lets consumers distinguish parse failures\n     * from different upstream APIs without parsing the message.\n     */\n    source?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.PARSE_FAILED,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: false,\n      context: { source: opts.source, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ParseError';\n    this.source = opts.source;\n  }\n}\n\n// \u2500\u2500 Type guards \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport function isWrongStackError(err: unknown): err is WrongStackError {\n  return err instanceof WrongStackError;\n}\n\nexport function isToolError(err: unknown): err is ToolError {\n  return err instanceof ToolError;\n}\n\nexport function isConfigError(err: unknown): err is ConfigError {\n  return err instanceof ConfigError;\n}\n\nexport function isPluginError(err: unknown): err is PluginError {\n  return err instanceof PluginError;\n}\n\nexport function isSessionError(err: unknown): err is SessionError {\n  return err instanceof SessionError;\n}\n\nexport function isAgentError(err: unknown): err is AgentError {\n  return err instanceof AgentError;\n}\n\nexport function isFsError(err: unknown): err is FsError {\n  return err instanceof FsError;\n}\n\nexport function isToolValidationError(err: unknown): err is ToolValidationError {\n  return err instanceof ToolValidationError;\n}\n\nexport function isFetchError(err: unknown): err is FetchError {\n  return err instanceof FetchError;\n}\n\nexport function isParseError(err: unknown): err is ParseError {\n  return err instanceof ParseError;\n}\n\nexport function isSddError(err: unknown): err is SddError {\n  return err instanceof SddError;\n}\n", "/**\n * The one implementation of Chronicle's tamper-evident hash.\n *\n * Chronicle events form a chain: each carries the `hash` of its predecessor in\n * `previousHash`, anchored at {@link GENESIS_HASH}. Verification recomputes\n * every `hash` from the stored event, so the canonicalization below is part of\n * the durable format \u2014 two subtly different implementations would produce two\n * incompatible chains, and the divergence would only surface later as a\n * \"corrupt journal\" report on data that was never actually tampered with.\n *\n * It therefore lives here rather than beside any one store, and both the JSONL\n * journal and the SQLite journal import it.\n */\nimport { createHash } from 'node:crypto';\nimport type { ChronicleEvent } from './types.js';\n\n/** `previousHash` of the first event in a chain. */\nexport const GENESIS_HASH = '0'.repeat(64);\n\n/**\n * Deterministic JSON encoding: object keys sorted, `undefined` members dropped,\n * `undefined` array elements encoded as `null`.\n *\n * Note this is NOT what gets written to disk \u2014 the JSONL journal stores\n * `JSON.stringify(event)` in V8 property order. The stored bytes are a record;\n * the preimage is always re-derived from the parsed event.\n */\nexport function stableStringify(value: unknown): string {\n  if (value === null || typeof value !== 'object') return JSON.stringify(value);\n  if (Array.isArray(value)) {\n    return `[${value.map((item) => (item === undefined ? 'null' : stableStringify(item))).join(',')}]`;\n  }\n  const obj = value as Record<string, unknown>;\n  return `{${Object.keys(obj)\n    .sort()\n    .filter((key) => obj[key] !== undefined)\n    .map((key) => `${JSON.stringify(key)}:${stableStringify(obj[key])}`)\n    .join(',')}}`;\n}\n\nexport function hashValue(value: unknown): string {\n  return createHash('sha256').update(stableStringify(value), 'utf8').digest('hex');\n}\n\n/**\n * Recompute the hash a stored event should carry.\n *\n * The `hash` field is excluded from its own preimage, so verification of an\n * event read back from any store is `chronicleEventHash(event) === event.hash`.\n */\nexport function chronicleEventHash(event: ChronicleEvent): string {\n  const { hash: _hash, ...unhashed } = event;\n  return hashValue(unhashed);\n}\n", "import * as path from 'node:path';\n\n/** Matches both rotated (`*.events.NNNNN.jsonl`) and unrotated (`*.events.jsonl`) partition files. */\nexport const PARTITION_FILE_PATTERN = /^(.*\\.events)(?:\\.(\\d{5}))?\\.jsonl$/;\n\nfunction partitionFamily(filePath: string): string {\n  const match = PARTITION_FILE_PATTERN.exec(path.basename(filePath));\n  return path.join(path.dirname(filePath), match?.[1] ?? path.basename(filePath));\n}\n\nfunction partitionSequence(filePath: string): number {\n  const match = PARTITION_FILE_PATTERN.exec(path.basename(filePath));\n  return Number(match?.[2] ?? 0);\n}\n\n/** Orders partitions by family, then by rotation sequence \u2014 the unrotated file (no sequence) sorts first. */\nexport function comparePartitionPaths(left: string, right: string): number {\n  const familyOrder = partitionFamily(left).localeCompare(partitionFamily(right));\n  return familyOrder || partitionSequence(left) - partitionSequence(right);\n}\n", "/** Schema version for the first durable WrongStack Chronicle event envelope. */\nexport const CHRONICLE_SCHEMA_VERSION = 1 as const;\n\nexport type ChronicleOutcome =\n  | 'started'\n  | 'success'\n  | 'failure'\n  | 'cancelled'\n  | 'denied'\n  | 'abandoned'\n  | 'unknown';\n\n/** Stable identities used to project one event into global and project views. */\nexport interface ChronicleScope {\n  installationId: string;\n  machineId: string;\n  projectId?: string | undefined;\n  repositoryId?: string | undefined;\n  workspaceId?: string | undefined;\n  worktreeId?: string | undefined;\n  sessionId?: string | undefined;\n  turnId?: string | undefined;\n  iterationId?: string | undefined;\n  agentId?: string | undefined;\n  goalId?: string | undefined;\n  planId?: string | undefined;\n  taskId?: string | undefined;\n  kanbanBoardId?: string | undefined;\n}\n\nexport interface ChronicleCorrelation {\n  traceId: string;\n  spanId: string;\n  parentSpanId?: string | undefined;\n  logicalRequestId?: string | undefined;\n  attemptId?: string | undefined;\n  toolCallId?: string | undefined;\n}\n\nexport interface ChronicleRuntimeIdentity {\n  providerId?: string | undefined;\n  modelId?: string | undefined;\n  modelRevision?: string | undefined;\n  processId?: number | undefined;\n  parentProcessId?: number | undefined;\n}\n\nexport interface ChronicleResourceRef {\n  kind: 'file' | 'symbol' | 'memory' | 'task' | 'kanban' | 'process' | 'network' | 'artifact' | 'other';\n  id: string;\n  path?: string | undefined;\n  lineStart?: number | undefined;\n  lineEnd?: number | undefined;\n  contentHashBefore?: string | undefined;\n  contentHashAfter?: string | undefined;\n}\n\nexport interface ChronicleEventInput {\n  eventType: string;\n  scope: ChronicleScope;\n  correlation: ChronicleCorrelation;\n  runtime?: ChronicleRuntimeIdentity | undefined;\n  resource?: ChronicleResourceRef | undefined;\n  outcome?: ChronicleOutcome | undefined;\n  durationNs?: string | undefined;\n  occurredAt?: string | undefined;\n  monotonicNs?: string | undefined;\n  attributes?: Record<string, unknown> | undefined;\n  tags?: Record<string, string> | undefined;\n}\n\n/**\n * Lossless durable envelope. All wall-clock timestamps are UTC ISO-8601;\n * monotonicNs is used for elapsed-time ordering inside one process.\n */\nexport interface ChronicleEvent extends ChronicleEventInput {\n  schemaVersion: typeof CHRONICLE_SCHEMA_VERSION;\n  eventId: string;\n  observedAt: string;\n  persistedAt: string;\n  sequence: number;\n  previousHash: string;\n  hash: string;\n}\n\nexport type ChronicleVerifyResult =\n  | { ok: true; entries: number; lastSequence: number; lastHash: string }\n  | { ok: false; entries: number; brokenAt: number; reason: string };\n", "/**\n * One-shot import of the legacy JSONL journal into SQLite\n * (phase 2 of `chronicle-sqlite-journal-v1`).\n *\n * The events being moved are an audit record, so this is deliberately strict:\n * every event is verified against the running chain *before* it is inserted,\n * and a single break aborts that day inside a rolled-back transaction.\n * Repairing a broken chain silently would defeat the purpose of having one \u2014\n * the operator is told exactly where it broke and decides.\n *\n * Chains are scoped to a day family (`<day>.events.jsonl` plus its `.NNNNN`\n * rotations), not to the journal as a whole: `sequence` restarts at 1 each day.\n * Each family is therefore imported as its own chain and its own transaction,\n * seeded from that family's `*.retention.json` checkpoint when its prefix was\n * already purged.\n *\n * A family that fails verification is quarantined \u2014 never imported, never\n * repaired, recorded by day so health can report it \u2014 and the remaining days\n * still move. Scoping the abort to the journal instead made every future day\n * hostage to the worst day on disk: one multi-writer partition from before the\n * single-daemon invariant, and the store could never finish opening, so\n * Chronicle recorded nothing at all from then on.\n */\nimport * as fs from 'node:fs/promises';\nimport * as path from 'node:path';\nimport { chronicleEventHash, GENESIS_HASH } from './event-hash.js';\nimport { collectPartitions, readRetentionCheckpoint, streamEntriesStrict } from './journal.js';\nimport { PARTITION_FILE_PATTERN } from './partition-filename.js';\nimport type {\n  ChronicleQuarantinedFamily,\n  ChronicleSqliteJournal,\n} from './sqlite-journal.js';\n\nexport interface ChronicleLegacyImportResult {\n  /** True when the marker was already set and nothing was read. */\n  alreadyImported: boolean;\n  /** Day families imported. */\n  families: number;\n  /** Events imported across all families. */\n  events: number;\n  /** Day families refused for a broken chain; none of their events landed. */\n  quarantined: ChronicleQuarantinedFamily[];\n}\n\n/** A chain break found while importing; carries enough context to act on. */\nexport class ChronicleImportError extends Error {\n  constructor(\n    message: string,\n    readonly day: string,\n    readonly sequence: number,\n  ) {\n    super(message);\n    this.name = 'ChronicleImportError';\n  }\n}\n\n/**\n * Discover the day families in a chronicle directory.\n *\n * `PARTITION_FILE_PATTERN` captures the family base (`<day>.events`) separately\n * from the rotation index, so rotations collapse onto the family they belong\n * to instead of being mistaken for separate days.\n */\nasync function discoverFamilies(directory: string): Promise<string[]> {\n  let entries: string[];\n  try {\n    entries = await fs.readdir(directory);\n  } catch {\n    return [];\n  }\n  const bases = new Set<string>();\n  for (const entry of entries) {\n    const match = PARTITION_FILE_PATTERN.exec(entry);\n    if (match?.[1]) bases.add(match[1]);\n  }\n  return [...bases].sort();\n}\n\n/** `2026-07-28.events` \u2192 `2026-07-28`. */\nfunction dayOfFamily(familyBase: string): string {\n  return familyBase.replace(/\\.events$/u, '');\n}\n\nexport async function importLegacyChronicleJournal(\n  journal: ChronicleSqliteJournal,\n  directory: string,\n): Promise<ChronicleLegacyImportResult> {\n  if (journal.hasImportedLegacyJournal()) {\n    return {\n      alreadyImported: true,\n      families: 0,\n      events: 0,\n      quarantined: journal.quarantinedFamilies(),\n    };\n  }\n\n  const families = await discoverFamilies(directory);\n  const quarantined: ChronicleQuarantinedFamily[] = [];\n  let importedEvents = 0;\n  let importedFamilies = 0;\n\n  for (const familyBase of families) {\n    const day = dayOfFamily(familyBase);\n    const basePath = path.join(directory, `${familyBase}.jsonl`);\n    let familyEvents = 0;\n\n    // Resume rather than restart. Families commit one at a time, so a run cut\n    // short \u2014 the daemon restarted, the machine rebooted \u2014 leaves whole days\n    // already stored. Re-reading them would abort on the `(day, sequence)`\n    // primary key and put the import back to square one every time.\n    if (journal.hasImportedDay(day)) continue;\n\n    try {\n      // One transaction per family: a break below rolls back this day only,\n      // leaving the days already committed \u2014 and every future day \u2014 intact.\n      await journal.runFamilyImport(async (sink) => {\n        familyEvents = 0;\n\n        const checkpointResult = await readRetentionCheckpoint(basePath);\n        if (checkpointResult.error) {\n          throw new ChronicleImportError(checkpointResult.error, day, 0);\n        }\n        const checkpoint = checkpointResult.checkpoint;\n        if (checkpoint) sink.checkpoint(day, checkpoint.sequence, checkpoint.hash);\n\n        let expectedSequence = (checkpoint?.sequence ?? 0) + 1;\n        let previousHash = checkpoint?.hash ?? GENESIS_HASH;\n\n        for (const partition of await collectPartitions(basePath)) {\n          for await (const event of streamEntriesStrict(partition)) {\n            if (event.sequence !== expectedSequence) {\n              throw new ChronicleImportError(\n                `sequence gap in ${day}: expected ${expectedSequence}, found ${event.sequence}`,\n                day,\n                event.sequence,\n              );\n            }\n            if (event.previousHash !== previousHash) {\n              throw new ChronicleImportError(\n                `previous hash mismatch in ${day} at sequence ${event.sequence}`,\n                day,\n                event.sequence,\n              );\n            }\n            if (chronicleEventHash(event) !== event.hash) {\n              throw new ChronicleImportError(\n                `entry hash mismatch in ${day} at sequence ${event.sequence}`,\n                day,\n                event.sequence,\n              );\n            }\n            sink.insert(day, event);\n            familyEvents += 1;\n            expectedSequence = event.sequence + 1;\n            previousHash = event.hash;\n          }\n        }\n      });\n    } catch (error) {\n      // A broken chain is data the operator has to decide about, so it is\n      // quarantined and reported. Anything else \u2014 an unreadable file, a full\n      // disk, SQLite refusing to write \u2014 is an infrastructure failure that\n      // would corrupt the import if treated as \"just skip that day\".\n      if (!(error instanceof ChronicleImportError)) throw error;\n      quarantined.push({ day, sequence: error.sequence, reason: error.message });\n      continue;\n    }\n\n    if (familyEvents > 0) importedFamilies += 1;\n    importedEvents += familyEvents;\n  }\n\n  journal.recordQuarantinedFamilies(quarantined);\n  journal.markLegacyJournalImported();\n\n  return {\n    alreadyImported: false,\n    families: importedFamilies,\n    events: importedEvents,\n    quarantined,\n  };\n}\n", "/**\n * ChronicleMetricsStore \u2014 derived, queryable aggregates over the raw\n * Chronicle journal (\"process, don't hoard\").\n *\n * The journal is the durable evidence log; this store is a disposable\n * projection kept in `<chronicleDir>/metrics.db` (node:sqlite, WAL). Each\n * `refresh()` incrementally consumes only the journal bytes appended since\n * the previous run (per-partition byte offsets in `ingest_state`), so the\n * raw JSONL partitions can be purged by retention without losing metrics:\n *\n * - `provider_daily`  \u2014 provider\u00D7model\u00D7day attempt/success/failure/retry/\n *                       fallback counts, token totals, duration stats.\n * - `task_outcomes`   \u2014 one row per task (kanban/SDD/subagent) with status,\n *                       timing, retry counts, and board/run/session lineage.\n * - `file_lineage`    \u2014 one row per observed file mutation with full\n *                       session/agent/task/board/tool/model attribution.\n * - `token_cost`      \u2014 latest cumulative token.accounted cost snapshot per\n *                       scope (same latest-wins semantics as the query\n *                       engine's summary).\n * - `daily_counters`, `family_daily`, `agent_daily`, `logical_request_daily`,\n *   `file_seen_daily` \u2014 per-day scalar counters and dedup sets backing\n *   `defaultSummary()`, a `ChronicleSummary` for the common unfiltered/\n *   time-bounded dashboard view. Any genuinely ad hoc filter (free text,\n *   path, session, provider, model) falls back to the raw-scan summary in\n *   query.ts \u2014 fixed-dimension aggregation fundamentally can't answer those.\n *\n * The schema is a cache: on version mismatch it is dropped and re-ingested\n * from whatever journal partitions still exist.\n */\n\nimport * as fs from 'node:fs/promises';\nimport { createRequire } from 'node:module';\nimport * as path from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport { withFileLock } from '../utils/atomic-write.js';\nimport { withSqliteExperimentalWarningSuppressed } from '../utils/sqlite-warning.js';\nimport { findChroniclePartitions, isTerminalFailure, signalFamily } from './query.js';\nimport type { ChronicleEvent } from './types.js';\nimport type { ChronicleSignalFamily, ChronicleSummary } from './query.js';\n\nconst SCHEMA_VERSION = 3;\nconst READ_CHUNK_BYTES = 1024 * 1024;\nconst EMPTY_FAMILIES: Record<ChronicleSignalFamily, number> = {\n  llm: 0, agent: 0, tool: 0, file: 0, memory: 0, task: 0, decision: 0, runtime: 0, finding: 0,\n};\n\nexport interface ChronicleMetricsRefreshResult {\n  ingestedEvents: number;\n  ingestedBytes: number;\n  sourceFiles: number;\n  invalidLines: number;\n}\n\nexport interface ChronicleProviderDailyRow {\n  day: string;\n  providerId: string;\n  modelId: string;\n  attempts: number;\n  completed: number;\n  failed: number;\n  retries: number;\n  fallbacks: number;\n  inputTokens: number;\n  outputTokens: number;\n  cacheReadTokens: number;\n  cacheWriteTokens: number;\n  avgDurationMs: number;\n  maxDurationMs: number;\n}\n\nexport interface ChronicleTaskOutcomeRow {\n  taskId: string;\n  runId: string;\n  boardId: string;\n  sessionId: string;\n  agentId: string;\n  status: string;\n  startedAt: string | null;\n  endedAt: string | null;\n  durationMs: number | null;\n  retries: number;\n  verificationFailures: number;\n  filesTouched: number;\n}\n\nexport interface ChronicleFileLineageRow {\n  path: string;\n  operation: string;\n  occurredAt: string;\n  sessionId: string;\n  agentId: string;\n  taskId: string;\n  boardId: string;\n  runId: string;\n  toolName: string;\n  providerId: string;\n  modelId: string;\n  source: string;\n}\n\nexport interface ChronicleMetricsSummary {\n  providers: { attempts: number; completed: number; failed: number; successRate: number };\n  tasks: Record<string, number>;\n  files: { mutations: number; uniquePaths: number };\n  estimatedCostUsd: number;\n}\n\n// \u2500\u2500\u2500 node:sqlite lazy loader (mirrors SAGE's pattern, compacted) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nlet Ctor: typeof DatabaseSync | null | undefined;\n\nfunction loadDatabaseSync(): typeof DatabaseSync {\n  if (Ctor) return Ctor;\n  if (Ctor === null) throw new Error('node:sqlite is unavailable in this runtime');\n  try {\n    Ctor = withSqliteExperimentalWarningSuppressed(\n      () => (createRequire(import.meta.url)('node:sqlite') as typeof import('node:sqlite')).DatabaseSync,\n    );\n    return Ctor;\n  } catch (error) {\n    Ctor = null;\n    throw new Error(\n      \"Chronicle metrics need Node's built-in SQLite (node:sqlite, Node >= 22.5): \" +\n        (error instanceof Error ? error.message : String(error)),\n    );\n  }\n}\n\n/** Non-throwing availability probe for callers that degrade gracefully. */\nexport function isChronicleMetricsAvailable(): boolean {\n  try {\n    loadDatabaseSync();\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n// \u2500\u2500\u2500 Store \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport class ChronicleMetricsStore {\n  private readonly db: DatabaseSync;\n  private readonly directory: string;\n  private readonly dbPath: string;\n\n  private constructor(directory: string) {\n    this.directory = path.resolve(directory);\n    this.dbPath = path.join(this.directory, 'metrics.db');\n    const Database = loadDatabaseSync();\n    this.db = new Database(this.dbPath);\n    this.db.exec('PRAGMA journal_mode = WAL');\n    this.ensureSchema();\n  }\n\n  static open(chronicleDirectory: string): ChronicleMetricsStore {\n    return new ChronicleMetricsStore(chronicleDirectory);\n  }\n\n  close(): void {\n    this.db.close();\n  }\n\n  /** Incrementally ingest journal bytes appended since the last refresh.\n   *  Safe across processes: guarded by a file lock on the database path. */\n  async refresh(): Promise<ChronicleMetricsRefreshResult> {\n    const result: ChronicleMetricsRefreshResult = {\n      ingestedEvents: 0,\n      ingestedBytes: 0,\n      sourceFiles: 0,\n      invalidLines: 0,\n    };\n    await withFileLock(this.dbPath, async () => {\n      const files = await findChroniclePartitions(this.directory);\n      const offsets = this.loadOffsets();\n      for (const file of files) {\n        const key = normalizeKey(path.relative(this.directory, file));\n        const consumed = offsets.get(key) ?? 0;\n        const ingested = await this.ingestFile(file, key, consumed, result);\n        if (ingested) result.sourceFiles++;\n      }\n      this.pruneOffsets(files);\n    });\n    return result;\n  }\n\n  providerDaily(options: { from?: string; to?: string } = {}): ChronicleProviderDailyRow[] {\n    const clauses: string[] = [];\n    const params: string[] = [];\n    if (options.from) {\n      clauses.push('day >= ?');\n      params.push(options.from.slice(0, 10));\n    }\n    if (options.to) {\n      clauses.push('day <= ?');\n      params.push(options.to.slice(0, 10));\n    }\n    const where = clauses.length > 0 ? ` WHERE ${clauses.join(' AND ')}` : '';\n    const rows = this.db\n      .prepare(\n        `SELECT day, provider_id, model_id, attempts, completed, failed, retries, fallbacks,\n        input_tokens, output_tokens, cache_read_tokens, cache_write_tokens,\n        duration_ms_total, duration_ms_max, duration_count\n       FROM provider_daily${where} ORDER BY day DESC, provider_id, model_id`,\n      )\n      .all(...params) as Array<Record<string, string | number>>;\n    return rows.map((row) => ({\n      day: String(row.day),\n      providerId: String(row.provider_id),\n      modelId: String(row.model_id),\n      attempts: Number(row.attempts),\n      completed: Number(row.completed),\n      failed: Number(row.failed),\n      retries: Number(row.retries),\n      fallbacks: Number(row.fallbacks),\n      inputTokens: Number(row.input_tokens),\n      outputTokens: Number(row.output_tokens),\n      cacheReadTokens: Number(row.cache_read_tokens),\n      cacheWriteTokens: Number(row.cache_write_tokens),\n      avgDurationMs:\n        Number(row.duration_count) > 0\n          ? Number(row.duration_ms_total) / Number(row.duration_count)\n          : 0,\n      maxDurationMs: Number(row.duration_ms_max),\n    }));\n  }\n\n  taskOutcomes(\n    options: {\n      runId?: string;\n      boardId?: string;\n      sessionId?: string;\n      status?: string;\n      limit?: number;\n    } = {},\n  ): ChronicleTaskOutcomeRow[] {\n    const clauses: string[] = [];\n    const params: Array<string | number> = [];\n    if (options.runId) {\n      clauses.push('t.run_id = ?');\n      params.push(options.runId);\n    }\n    if (options.boardId) {\n      clauses.push('t.board_id = ?');\n      params.push(options.boardId);\n    }\n    if (options.sessionId) {\n      clauses.push('t.session_id = ?');\n      params.push(options.sessionId);\n    }\n    if (options.status) {\n      clauses.push('t.status = ?');\n      params.push(options.status);\n    }\n    const where = clauses.length > 0 ? ` WHERE ${clauses.join(' AND ')}` : '';\n    params.push(clampLimit(options.limit, 100));\n    const rows = this.db\n      .prepare(\n        `SELECT t.*, (SELECT COUNT(*) FROM file_lineage f WHERE f.task_id = t.task_id) AS files_touched\n       FROM task_outcomes t${where}\n       ORDER BY COALESCE(t.started_at, '') DESC LIMIT ?`,\n      )\n      .all(...params) as Array<Record<string, string | number | null>>;\n    return rows.map((row) => ({\n      taskId: String(row.task_id),\n      runId: String(row.run_id),\n      boardId: String(row.board_id),\n      sessionId: String(row.session_id),\n      agentId: String(row.agent_id),\n      status: String(row.status),\n      startedAt: row.started_at === null ? null : String(row.started_at),\n      endedAt: row.ended_at === null ? null : String(row.ended_at),\n      durationMs: row.duration_ms === null ? null : Number(row.duration_ms),\n      retries: Number(row.retries),\n      verificationFailures: Number(row.verification_failures),\n      filesTouched: Number(row.files_touched),\n    }));\n  }\n\n  fileLineage(\n    options: {\n      path?: string;\n      paths?: string[];\n      latestPerPath?: boolean;\n      taskId?: string;\n      boardId?: string;\n      sessionId?: string;\n      limit?: number;\n    } = {},\n  ): ChronicleFileLineageRow[] {\n    const clauses: string[] = [];\n    const params: Array<string | number> = [];\n    if (options.path) {\n      clauses.push('path_key = ?');\n      params.push(normalizePathKey(options.path));\n    }\n    if (options.paths) {\n      const pathKeys = [...new Set(options.paths.map(normalizePathKey))];\n      if (pathKeys.length === 0) return [];\n      clauses.push(`path_key IN (${pathKeys.map(() => '?').join(',')})`);\n      params.push(...pathKeys);\n    }\n    if (options.taskId) {\n      clauses.push('task_id = ?');\n      params.push(options.taskId);\n    }\n    if (options.boardId) {\n      clauses.push('board_id = ?');\n      params.push(options.boardId);\n    }\n    if (options.sessionId) {\n      clauses.push('session_id = ?');\n      params.push(options.sessionId);\n    }\n    const where = clauses.length > 0 ? ` WHERE ${clauses.join(' AND ')}` : '';\n    params.push(clampLimit(options.limit, 200));\n    const projection =\n      `path, operation, occurred_at, session_id, agent_id, task_id, board_id, run_id,\n       tool_name, provider_id, model_id, source`;\n    const sql = options.latestPerPath\n      ? `SELECT ${projection} FROM (\n           SELECT ${projection}, ROW_NUMBER() OVER (\n             PARTITION BY path_key ORDER BY occurred_at DESC, event_id DESC\n           ) AS path_rank\n           FROM file_lineage${where}\n         ) WHERE path_rank = 1 ORDER BY occurred_at DESC LIMIT ?`\n      : `SELECT ${projection}\n         FROM file_lineage${where} ORDER BY occurred_at DESC LIMIT ?`;\n    const rows = this.db\n      .prepare(sql)\n      .all(...params) as Array<Record<string, string>>;\n    return rows.map((row) => ({\n      path: row.path!,\n      operation: row.operation!,\n      occurredAt: row.occurred_at!,\n      sessionId: row.session_id!,\n      agentId: row.agent_id!,\n      taskId: row.task_id!,\n      boardId: row.board_id!,\n      runId: row.run_id!,\n      toolName: row.tool_name!,\n      providerId: row.provider_id!,\n      modelId: row.model_id!,\n      source: row.source!,\n    }));\n  }\n\n  summary(): ChronicleMetricsSummary {\n    const provider = this.db\n      .prepare(\n        'SELECT COALESCE(SUM(attempts),0) a, COALESCE(SUM(completed),0) c, COALESCE(SUM(failed),0) f FROM provider_daily',\n      )\n      .get() as { a: number; c: number; f: number };\n    const tasks: Record<string, number> = {};\n    for (const row of this.db\n      .prepare('SELECT status, COUNT(*) n FROM task_outcomes GROUP BY status')\n      .all() as Array<{ status: string; n: number }>) {\n      tasks[row.status] = Number(row.n);\n    }\n    const files = this.db\n      .prepare('SELECT COUNT(*) n, COUNT(DISTINCT path) p FROM file_lineage')\n      .get() as { n: number; p: number };\n    const cost = this.db.prepare('SELECT COALESCE(SUM(cost),0) c FROM token_cost').get() as {\n      c: number;\n    };\n    const terminal = Number(provider.c) + Number(provider.f);\n    return {\n      providers: {\n        attempts: Number(provider.a),\n        completed: Number(provider.c),\n        failed: Number(provider.f),\n        successRate: terminal > 0 ? Number(provider.c) / terminal : 0,\n      },\n      tasks,\n      files: { mutations: Number(files.n), uniquePaths: Number(files.p) },\n      estimatedCostUsd: Number(cost.c),\n    };\n  }\n\n  /**\n   * A `ChronicleSummary` for the default/unfiltered dashboard view \u2014 only\n   * `from`/`to` (day-precision) narrow it. Any other ad hoc filter (text,\n   * path, provider, model, session) can't be answered from these\n   * fixed-dimension aggregates; callers must fall back to query.ts's\n   * raw-scan summary for those.\n   */\n  defaultSummary(options: { from?: string; to?: string } = {}): ChronicleSummary {\n    const fromDay = options.from?.slice(0, 10);\n    const toDay = options.to?.slice(0, 10);\n    const dayFilter = (column: string): { where: string; params: string[] } => {\n      const clauses: string[] = [];\n      const params: string[] = [];\n      if (fromDay) { clauses.push(`${column} >= ?`); params.push(fromDay); }\n      if (toDay) { clauses.push(`${column} <= ?`); params.push(toDay); }\n      return { where: clauses.length > 0 ? ` WHERE ${clauses.join(' AND ')}` : '', params };\n    };\n\n    const providerRange = dayFilter('day');\n    const provider = this.db\n      .prepare(\n        `SELECT COALESCE(SUM(attempts),0) attempts, COALESCE(SUM(completed),0) completed, COALESCE(SUM(failed),0) failed,\n        COALESCE(SUM(retries),0) retries, COALESCE(SUM(fallbacks),0) fallbacks,\n        COUNT(DISTINCT provider_id) providers, COUNT(DISTINCT model_id) models,\n        COALESCE(SUM(input_tokens),0) inputTokens, COALESCE(SUM(output_tokens),0) outputTokens,\n        COALESCE(SUM(cache_read_tokens),0) cacheReadTokens, COALESCE(SUM(cache_write_tokens),0) cacheWriteTokens,\n        COALESCE(SUM(duration_ms_total),0) durationTotal, COALESCE(MAX(duration_ms_max),0) durationMax,\n        COALESCE(SUM(duration_count),0) durationCount\n       FROM provider_daily${providerRange.where}`,\n      )\n      .get(...providerRange.params) as Record<string, number>;\n\n    const counterRange = dayFilter('day');\n    const counters = this.db\n      .prepare(\n        `SELECT COALESCE(SUM(tool_calls),0) toolCalls, COALESCE(SUM(completed_tools),0) completedTools,\n        COALESCE(SUM(failed_tools),0) failedTools, COALESCE(SUM(tool_duration_ms_total),0) toolDurationTotal,\n        COALESCE(SUM(tool_duration_count),0) toolDurationCount, COALESCE(SUM(processes),0) processes,\n        COALESCE(SUM(failed_processes),0) failedProcesses, COALESCE(SUM(file_events_all),0) fileEvents,\n        COALESCE(SUM(decisions),0) decisions, COALESCE(SUM(escalations),0) escalations,\n        COALESCE(SUM(agent_events),0) agentEvents, COALESCE(SUM(failures),0) failures,\n        COALESCE(SUM(cancellations),0) cancellations\n       FROM daily_counters${counterRange.where}`,\n      )\n      .get(...counterRange.params) as Record<string, number>;\n\n    const familyRange = dayFilter('day');\n    const familyRows = this.db\n      .prepare(`SELECT family, count, failure_count FROM family_daily${familyRange.where}`)\n      .all(...familyRange.params) as Array<{ family: string; count: number; failure_count: number }>;\n    const families = { ...EMPTY_FAMILIES };\n    const failuresByFamily = { ...EMPTY_FAMILIES };\n    for (const row of familyRows) {\n      const family = row.family as ChronicleSignalFamily;\n      families[family] = Number(row.count);\n      failuresByFamily[family] = Number(row.failure_count);\n    }\n\n    const agentRange = dayFilter('day');\n    const uniqueAgents = (\n      this.db.prepare(`SELECT COUNT(DISTINCT agent_id) n FROM agent_daily${agentRange.where}`).get(...agentRange.params) as { n: number }\n    ).n;\n    const requestRange = dayFilter('day');\n    const logicalRequests = (\n      this.db.prepare(`SELECT COUNT(DISTINCT logical_request_id) n FROM logical_request_daily${requestRange.where}`).get(...requestRange.params) as { n: number }\n    ).n;\n    const fileRange = dayFilter('day');\n    const uniqueFiles = (\n      this.db.prepare(`SELECT COUNT(DISTINCT path_key) n FROM file_seen_daily${fileRange.where}`).get(...fileRange.params) as { n: number }\n    ).n;\n    const costRange = dayFilter('day');\n    const cost = (\n      this.db.prepare(`SELECT COALESCE(SUM(cost),0) c FROM token_cost${costRange.where}`).get(...costRange.params) as { c: number }\n    ).c;\n\n    return {\n      logicalRequests: Number(logicalRequests),\n      modelAttempts: Number(provider.attempts),\n      completedAttempts: Number(provider.completed),\n      failedAttempts: Number(provider.failed),\n      scheduledRetries: Number(provider.retries),\n      fallbacks: Number(provider.fallbacks),\n      providers: Number(provider.providers),\n      models: Number(provider.models),\n      inputTokens: Number(provider.inputTokens),\n      outputTokens: Number(provider.outputTokens),\n      cacheReadTokens: Number(provider.cacheReadTokens),\n      cacheWriteTokens: Number(provider.cacheWriteTokens),\n      estimatedCostUsd: Number(cost),\n      providerAvgDurationMs: Number(provider.durationCount) > 0 ? Number(provider.durationTotal) / Number(provider.durationCount) : 0,\n      // True p95 needs a retained distribution; this per-day aggregate only\n      // keeps sum/max/count, so approximate with the observed max rather\n      // than adding a per-attempt histogram write (would add the same kind\n      // of per-event overhead this whole effort is trying to remove).\n      providerP95DurationMs: Number(provider.durationMax),\n      toolCalls: Number(counters.toolCalls),\n      completedTools: Number(counters.completedTools),\n      failedTools: Number(counters.failedTools),\n      toolAvgDurationMs: Number(counters.toolDurationCount) > 0 ? Number(counters.toolDurationTotal) / Number(counters.toolDurationCount) : 0,\n      processes: Number(counters.processes),\n      failedProcesses: Number(counters.failedProcesses),\n      fileEvents: Number(counters.fileEvents),\n      uniqueFiles: Number(uniqueFiles),\n      agentEvents: Number(counters.agentEvents),\n      uniqueAgents: Number(uniqueAgents),\n      decisions: Number(counters.decisions),\n      escalations: Number(counters.escalations),\n      failures: Number(counters.failures),\n      cancellations: Number(counters.cancellations),\n      families,\n      failuresByFamily,\n    };\n  }\n\n  // \u2500\u2500\u2500 Ingest internals \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n  private ensureSchema(): void {\n    const version = (this.db.prepare('PRAGMA user_version').get() as { user_version: number })\n      .user_version;\n    if (version !== 0 && version !== SCHEMA_VERSION) {\n      // Derived cache \u2014 drop and re-ingest from whatever journal remains.\n      this.db.exec(\n        'DROP TABLE IF EXISTS ingest_state; DROP TABLE IF EXISTS provider_daily;' +\n          'DROP TABLE IF EXISTS task_outcomes; DROP TABLE IF EXISTS file_lineage;' +\n          'DROP TABLE IF EXISTS token_cost; DROP TABLE IF EXISTS daily_counters;' +\n          'DROP TABLE IF EXISTS family_daily; DROP TABLE IF EXISTS agent_daily;' +\n          'DROP TABLE IF EXISTS logical_request_daily; DROP TABLE IF EXISTS file_seen_daily;',\n      );\n    }\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS ingest_state (\n        file TEXT PRIMARY KEY,\n        bytes INTEGER NOT NULL\n      );\n      CREATE TABLE IF NOT EXISTS provider_daily (\n        day TEXT NOT NULL,\n        provider_id TEXT NOT NULL,\n        model_id TEXT NOT NULL,\n        attempts INTEGER NOT NULL DEFAULT 0,\n        completed INTEGER NOT NULL DEFAULT 0,\n        failed INTEGER NOT NULL DEFAULT 0,\n        retries INTEGER NOT NULL DEFAULT 0,\n        fallbacks INTEGER NOT NULL DEFAULT 0,\n        input_tokens INTEGER NOT NULL DEFAULT 0,\n        output_tokens INTEGER NOT NULL DEFAULT 0,\n        cache_read_tokens INTEGER NOT NULL DEFAULT 0,\n        cache_write_tokens INTEGER NOT NULL DEFAULT 0,\n        duration_ms_total REAL NOT NULL DEFAULT 0,\n        duration_ms_max REAL NOT NULL DEFAULT 0,\n        duration_count INTEGER NOT NULL DEFAULT 0,\n        PRIMARY KEY (day, provider_id, model_id)\n      );\n      CREATE TABLE IF NOT EXISTS task_outcomes (\n        task_id TEXT PRIMARY KEY,\n        run_id TEXT NOT NULL DEFAULT '',\n        board_id TEXT NOT NULL DEFAULT '',\n        session_id TEXT NOT NULL DEFAULT '',\n        agent_id TEXT NOT NULL DEFAULT '',\n        status TEXT NOT NULL DEFAULT 'started',\n        started_at TEXT,\n        ended_at TEXT,\n        duration_ms REAL,\n        retries INTEGER NOT NULL DEFAULT 0,\n        verification_failures INTEGER NOT NULL DEFAULT 0\n      );\n      CREATE TABLE IF NOT EXISTS file_lineage (\n        event_id TEXT PRIMARY KEY,\n        path TEXT NOT NULL,\n        path_key TEXT NOT NULL,\n        operation TEXT NOT NULL,\n        occurred_at TEXT NOT NULL,\n        session_id TEXT NOT NULL DEFAULT '',\n        agent_id TEXT NOT NULL DEFAULT '',\n        task_id TEXT NOT NULL DEFAULT '',\n        board_id TEXT NOT NULL DEFAULT '',\n        run_id TEXT NOT NULL DEFAULT '',\n        tool_name TEXT NOT NULL DEFAULT '',\n        provider_id TEXT NOT NULL DEFAULT '',\n        model_id TEXT NOT NULL DEFAULT '',\n        source TEXT NOT NULL DEFAULT ''\n      );\n      -- Lookups filter on the case-normalized path_key (matching the query\n      -- engine); the path column retains original casing for display.\n      CREATE INDEX IF NOT EXISTS idx_file_lineage_path ON file_lineage(path_key, occurred_at);\n      CREATE INDEX IF NOT EXISTS idx_file_lineage_task ON file_lineage(task_id);\n      CREATE TABLE IF NOT EXISTS token_cost (\n        scope_key TEXT PRIMARY KEY,\n        day TEXT NOT NULL,\n        occurred_at TEXT NOT NULL,\n        sequence INTEGER NOT NULL,\n        cost REAL NOT NULL\n      );\n      -- Backing store for defaultSummary(): per-day scalar counters plus\n      -- dedup sets, populated for every ingested event (not just the\n      -- provider/task/file families above).\n      CREATE TABLE IF NOT EXISTS daily_counters (\n        day TEXT PRIMARY KEY,\n        tool_calls INTEGER NOT NULL DEFAULT 0,\n        completed_tools INTEGER NOT NULL DEFAULT 0,\n        failed_tools INTEGER NOT NULL DEFAULT 0,\n        tool_duration_ms_total REAL NOT NULL DEFAULT 0,\n        tool_duration_ms_max REAL NOT NULL DEFAULT 0,\n        tool_duration_count INTEGER NOT NULL DEFAULT 0,\n        processes INTEGER NOT NULL DEFAULT 0,\n        failed_processes INTEGER NOT NULL DEFAULT 0,\n        file_events_all INTEGER NOT NULL DEFAULT 0,\n        decisions INTEGER NOT NULL DEFAULT 0,\n        escalations INTEGER NOT NULL DEFAULT 0,\n        agent_events INTEGER NOT NULL DEFAULT 0,\n        failures INTEGER NOT NULL DEFAULT 0,\n        cancellations INTEGER NOT NULL DEFAULT 0\n      );\n      CREATE TABLE IF NOT EXISTS family_daily (\n        day TEXT NOT NULL,\n        family TEXT NOT NULL,\n        count INTEGER NOT NULL DEFAULT 0,\n        failure_count INTEGER NOT NULL DEFAULT 0,\n        PRIMARY KEY (day, family)\n      );\n      CREATE TABLE IF NOT EXISTS agent_daily (day TEXT NOT NULL, agent_id TEXT NOT NULL, PRIMARY KEY (day, agent_id));\n      CREATE TABLE IF NOT EXISTS logical_request_daily (day TEXT NOT NULL, logical_request_id TEXT NOT NULL, PRIMARY KEY (day, logical_request_id));\n      CREATE TABLE IF NOT EXISTS file_seen_daily (day TEXT NOT NULL, path_key TEXT NOT NULL, PRIMARY KEY (day, path_key));\n      PRAGMA user_version = ${SCHEMA_VERSION};\n    `);\n  }\n\n  private loadOffsets(): Map<string, number> {\n    const rows = this.db.prepare('SELECT file, bytes FROM ingest_state').all() as Array<{\n      file: string;\n      bytes: number;\n    }>;\n    return new Map(rows.map((row) => [row.file, Number(row.bytes)]));\n  }\n\n  private pruneOffsets(existingFiles: string[]): void {\n    const keep = new Set(\n      existingFiles.map((file) => normalizeKey(path.relative(this.directory, file))),\n    );\n    for (const row of this.db.prepare('SELECT file FROM ingest_state').all() as Array<{\n      file: string;\n    }>) {\n      if (!keep.has(row.file))\n        this.db.prepare('DELETE FROM ingest_state WHERE file = ?').run(row.file);\n    }\n  }\n\n  /** Read complete lines appended after `consumed` bytes. The trailing\n   *  partial line of an actively-written partition is left for the next\n   *  refresh \u2014 `ingest_state.bytes` only ever advances past full lines. */\n  private async ingestFile(\n    file: string,\n    key: string,\n    consumed: number,\n    result: ChronicleMetricsRefreshResult,\n  ): Promise<boolean> {\n    let handle: fs.FileHandle;\n    try {\n      handle = await fs.open(file, 'r');\n    } catch {\n      return false;\n    }\n    try {\n      const size = (await handle.stat()).size;\n      if (size <= consumed) return false;\n      let position = consumed;\n      let remainder = Buffer.alloc(0);\n      let advanced = consumed;\n      this.db.exec('BEGIN');\n      try {\n        while (position < size) {\n          const length = Math.min(READ_CHUNK_BYTES, size - position);\n          const buffer = Buffer.allocUnsafe(length);\n          const { bytesRead } = await handle.read(buffer, 0, length, position);\n          if (bytesRead <= 0) break;\n          position += bytesRead;\n          const data =\n            remainder.length > 0\n              ? Buffer.concat([remainder, buffer.subarray(0, bytesRead)])\n              : buffer.subarray(0, bytesRead);\n          const lastNewline = data.lastIndexOf(0x0a);\n          if (lastNewline < 0) {\n            remainder = Buffer.from(data);\n            continue;\n          }\n          // '\\n' is a single byte in UTF-8, so complete-line slices always\n          // fall on character boundaries.\n          for (const line of data.subarray(0, lastNewline).toString('utf8').split('\\n')) {\n            const trimmed = line.trim();\n            if (!trimmed) continue;\n            try {\n              this.ingestEvent(JSON.parse(trimmed) as ChronicleEvent);\n              result.ingestedEvents++;\n            } catch {\n              result.invalidLines++;\n            }\n          }\n          // `data` always begins at absolute offset `advanced` (remainder is\n          // exactly the unconsumed bytes), so the newline index maps directly.\n          advanced += lastNewline + 1;\n          remainder = Buffer.from(data.subarray(lastNewline + 1));\n        }\n        this.db\n          .prepare(\n            'INSERT INTO ingest_state (file, bytes) VALUES (?, ?) ' +\n              'ON CONFLICT(file) DO UPDATE SET bytes = excluded.bytes',\n          )\n          .run(key, advanced);\n        this.db.exec('COMMIT');\n      } catch (error) {\n        this.db.exec('ROLLBACK');\n        throw error;\n      }\n      result.ingestedBytes += advanced - consumed;\n      return advanced > consumed;\n    } finally {\n      await handle.close();\n    }\n  }\n\n  private ingestEvent(event: ChronicleEvent): void {\n    if (typeof event?.eventType !== 'string' || !event.scope) return;\n    this.ingestDailyCounters(event);\n    const type = event.eventType;\n    if (type.startsWith('provider.attempt.') || type === 'provider.fallback') {\n      this.ingestProvider(event);\n    } else if (type === 'token.accounted') {\n      this.ingestTokenCost(event);\n    } else if (/^(?:sdd|subagent|kanban)\\.task[._]/.test(type)) {\n      this.ingestTask(event);\n    } else if (type === 'file.event' || /^file\\.(?:tool|external)\\./.test(type)) {\n      this.ingestFileEvent(event);\n    }\n  }\n\n  /** Runs for every ingested event (not just the type-specific branches\n   *  below) \u2014 mirrors query.ts's updateSummary() closely enough that\n   *  defaultSummary() matches what a raw scan of the same window would say. */\n  private ingestDailyCounters(event: ChronicleEvent): void {\n    const day = eventDay(event);\n    this.db.prepare('INSERT OR IGNORE INTO daily_counters (day) VALUES (?)').run(day);\n    const bump = (sql: string, ...params: Array<string | number>) =>\n      this.db.prepare(`UPDATE daily_counters SET ${sql} WHERE day = ?`).run(...params, day);\n\n    const family = signalFamily(event);\n    const failed = isTerminalFailure(event) ? 1 : 0;\n    this.db\n      .prepare(\n        `INSERT INTO family_daily (day, family, count, failure_count) VALUES (?, ?, 1, ?)\n       ON CONFLICT(day, family) DO UPDATE SET count = count + 1, failure_count = failure_count + excluded.failure_count`,\n      )\n      .run(day, family, failed);\n    if (failed) bump('failures = failures + 1');\n    if (event.outcome === 'cancelled' || event.outcome === 'abandoned') bump('cancellations = cancellations + 1');\n    if (family === 'agent') bump('agent_events = agent_events + 1');\n\n    if (event.correlation.logicalRequestId) {\n      this.db\n        .prepare('INSERT OR IGNORE INTO logical_request_daily (day, logical_request_id) VALUES (?, ?)')\n        .run(day, event.correlation.logicalRequestId);\n    }\n    if (event.scope.agentId) {\n      this.db.prepare('INSERT OR IGNORE INTO agent_daily (day, agent_id) VALUES (?, ?)').run(day, event.scope.agentId);\n    }\n\n    const type = event.eventType;\n    if (type === 'decision.requested') bump('decisions = decisions + 1');\n    else if (type === 'decision.escalated') bump('escalations = escalations + 1');\n    else if (type === 'tool.started') bump('tool_calls = tool_calls + 1');\n    else if (type === 'tool.executed' || type === 'tool.failed') {\n      const dur = durationMs(event);\n      const durationCount = dur > 0 ? 1 : 0;\n      bump(\n        `${type === 'tool.executed' ? 'completed_tools' : 'failed_tools'} = ${type === 'tool.executed' ? 'completed_tools' : 'failed_tools'} + 1,\n         tool_duration_ms_total = tool_duration_ms_total + ?, tool_duration_ms_max = MAX(tool_duration_ms_max, ?), tool_duration_count = tool_duration_count + ?`,\n        dur, dur, durationCount,\n      );\n    } else if (type === 'process.started') bump('processes = processes + 1');\n    else if (type === 'process.completed' && event.outcome === 'failure') bump('failed_processes = failed_processes + 1');\n\n    if (event.resource?.kind === 'file' || type.startsWith('file.')) {\n      bump('file_events_all = file_events_all + 1');\n      if (event.resource?.path) {\n        this.db\n          .prepare('INSERT OR IGNORE INTO file_seen_daily (day, path_key) VALUES (?, ?)')\n          .run(day, normalizePathKey(event.resource.path));\n      }\n    }\n  }\n\n  private ingestProvider(event: ChronicleEvent): void {\n    const day = eventDay(event);\n    // provider.fallback carries no top-level runtime identity \u2014 it belongs to\n    // the provider being fallen back FROM, held in attributes.from. Attribute\n    // it there rather than letting it manufacture a phantom ('', '') row.\n    const providerId =\n      event.runtime?.providerId ?? asString(readPath(event.attributes ?? {}, 'from.providerId')) ?? '';\n    const modelId =\n      event.runtime?.modelId ?? asString(readPath(event.attributes ?? {}, 'from.model')) ?? '';\n    // No identity at all \u2192 not attributable to any provider row; skip.\n    if (!providerId && !modelId) return;\n    this.db\n      .prepare('INSERT OR IGNORE INTO provider_daily (day, provider_id, model_id) VALUES (?, ?, ?)')\n      .run(day, providerId, modelId);\n    const update = (sql: string, ...params: Array<string | number>) =>\n      this.db\n        .prepare(\n          `UPDATE provider_daily SET ${sql} WHERE day = ? AND provider_id = ? AND model_id = ?`,\n        )\n        .run(...params, day, providerId, modelId);\n    const duration = durationMs(event);\n    switch (event.eventType) {\n      case 'provider.attempt.started':\n        update('attempts = attempts + 1');\n        break;\n      case 'provider.attempt.completed':\n        update(\n          'completed = completed + 1, input_tokens = input_tokens + ?, output_tokens = output_tokens + ?, ' +\n            'cache_read_tokens = cache_read_tokens + ?, cache_write_tokens = cache_write_tokens + ?, ' +\n            'duration_ms_total = duration_ms_total + ?, duration_ms_max = MAX(duration_ms_max, ?), ' +\n            'duration_count = duration_count + ?',\n          numberAt(event, 'usage.input'),\n          numberAt(event, 'usage.output'),\n          numberAt(event, 'usage.cacheRead'),\n          numberAt(event, 'usage.cacheWrite'),\n          duration,\n          duration,\n          duration > 0 ? 1 : 0,\n        );\n        break;\n      case 'provider.attempt.failed':\n        update(\n          'failed = failed + 1, retries = retries + ?, duration_ms_total = duration_ms_total + ?, ' +\n            'duration_ms_max = MAX(duration_ms_max, ?), duration_count = duration_count + ?',\n          event.attributes?.retryScheduled === true ? 1 : 0,\n          duration,\n          duration,\n          duration > 0 ? 1 : 0,\n        );\n        break;\n      case 'provider.fallback':\n        update('fallbacks = fallbacks + 1');\n        break;\n      default:\n        break;\n    }\n  }\n\n  private ingestTokenCost(event: ChronicleEvent): void {\n    const cost = readPath(event.attributes ?? {}, 'cost.total');\n    if (typeof cost !== 'number' || !Number.isFinite(cost)) return;\n    const scopeKey = `${event.scope.projectId ?? ''}\\0${event.scope.sessionId ?? ''}\\0${event.scope.agentId ?? ''}`;\n    const occurredAt = event.occurredAt ?? event.observedAt;\n    // Latest-wins per scope: token.accounted carries a cumulative snapshot.\n    this.db\n      .prepare(\n        `INSERT INTO token_cost (scope_key, day, occurred_at, sequence, cost) VALUES (?, ?, ?, ?, ?)\n       ON CONFLICT(scope_key) DO UPDATE SET\n         day = excluded.day, occurred_at = excluded.occurred_at,\n         sequence = excluded.sequence, cost = excluded.cost\n       WHERE excluded.occurred_at > token_cost.occurred_at\n          OR (excluded.occurred_at = token_cost.occurred_at AND excluded.sequence > token_cost.sequence)`,\n      )\n      .run(scopeKey, eventDay(event), occurredAt, event.sequence, cost);\n  }\n\n  private ingestTask(event: ChronicleEvent): void {\n    const attributes = event.attributes ?? {};\n    const taskId = event.scope.taskId ?? stringAt(attributes, 'taskId');\n    if (!taskId) return;\n    const occurredAt = event.occurredAt ?? event.observedAt;\n    this.db.prepare('INSERT OR IGNORE INTO task_outcomes (task_id) VALUES (?)').run(taskId);\n    const set = (sql: string, ...params: Array<string | number>) =>\n      this.db.prepare(`UPDATE task_outcomes SET ${sql} WHERE task_id = ?`).run(...params, taskId);\n    // Lineage columns: last non-empty observation wins.\n    const lineage: Array<[string, string | undefined]> = [\n      ['run_id', stringAt(attributes, 'runId')],\n      ['board_id', event.scope.kanbanBoardId ?? stringAt(attributes, 'boardId')],\n      ['session_id', event.scope.sessionId],\n      ['agent_id', event.scope.agentId ?? stringAt(attributes, 'subagentId')],\n    ];\n    for (const [column, value] of lineage) {\n      if (value) set(`${column} = ?`, value);\n    }\n    const base = event.eventType.replace(/^(?:sdd|subagent|kanban)\\.task[._]/, '');\n    switch (base) {\n      case 'started':\n        set(\"status = 'started', started_at = COALESCE(started_at, ?)\", occurredAt);\n        break;\n      case 'completed':\n        set(\n          \"status = 'completed', ended_at = ?, duration_ms = ?\",\n          occurredAt,\n          numberOrDuration(event, attributes),\n        );\n        break;\n      case 'failed':\n        set(\"status = 'failed', ended_at = ?\", occurredAt);\n        break;\n      case 'retrying':\n        set('retries = retries + 1');\n        break;\n      case 'verification_failed':\n        set('verification_failures = verification_failures + 1');\n        break;\n      case 'merged':\n        set(\"status = 'merged'\");\n        break;\n      case 'conflict':\n        set(\"status = 'conflict'\");\n        break;\n      default:\n        break;\n    }\n  }\n\n  private ingestFileEvent(event: ChronicleEvent): void {\n    const attributes = event.attributes ?? {};\n    const operation = stringAt(attributes, 'operation') ?? '';\n    if (!operation || operation === 'read') return;\n    const filePath = event.resource?.path ?? stringAt(attributes, 'filePath');\n    if (!filePath) return;\n    this.db\n      .prepare(\n        `INSERT OR IGNORE INTO file_lineage\n        (event_id, path, path_key, operation, occurred_at, session_id, agent_id, task_id, board_id, run_id,\n         tool_name, provider_id, model_id, source)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`,\n      )\n      .run(\n        event.eventId,\n        normalizeKey(filePath),\n        normalizePathKey(filePath),\n        operation,\n        event.occurredAt ?? event.observedAt,\n        event.scope.sessionId ?? '',\n        event.scope.agentId ?? '',\n        event.scope.taskId ?? stringAt(attributes, 'taskId') ?? '',\n        event.scope.kanbanBoardId ?? stringAt(attributes, 'boardId') ?? '',\n        stringAt(attributes, 'runId') ?? '',\n        stringAt(attributes, 'toolName') ?? '',\n        event.runtime?.providerId ?? stringAt(attributes, 'provider') ?? '',\n        event.runtime?.modelId ?? stringAt(attributes, 'model') ?? '',\n        stringAt(attributes, 'source') ?? (event.eventType === 'file.event' ? 'tool' : 'external'),\n      );\n  }\n}\n\n// \u2500\u2500\u2500 Helpers \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nfunction eventDay(event: ChronicleEvent): string {\n  return (event.occurredAt ?? event.observedAt).slice(0, 10);\n}\n\nfunction durationMs(event: ChronicleEvent): number {\n  const value = Number(event.durationNs ?? 0) / 1_000_000;\n  return Number.isFinite(value) && value > 0 ? value : 0;\n}\n\nfunction numberOrDuration(event: ChronicleEvent, attributes: Record<string, unknown>): number {\n  const explicit = attributes.durationMs;\n  if (typeof explicit === 'number' && Number.isFinite(explicit)) return explicit;\n  return durationMs(event);\n}\n\nfunction numberAt(event: ChronicleEvent, dotPath: string): number {\n  const value = readPath(event.attributes ?? {}, dotPath);\n  return typeof value === 'number' && Number.isFinite(value) ? value : 0;\n}\n\nfunction readPath(value: Record<string, unknown>, key: string): unknown {\n  return key\n    .split('.')\n    .reduce<unknown>(\n      (current, part) =>\n        current && typeof current === 'object'\n          ? (current as Record<string, unknown>)[part]\n          : undefined,\n      value,\n    );\n}\n\nfunction stringAt(record: Record<string, unknown>, key: string): string | undefined {\n  const value = record[key];\n  return typeof value === 'string' && value.length > 0 ? value : undefined;\n}\n\nfunction asString(value: unknown): string | undefined {\n  return typeof value === 'string' && value.length > 0 ? value : undefined;\n}\n\nfunction clampLimit(limit: number | undefined, fallback: number): number {\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit <= 0) return fallback;\n  return Math.min(Math.floor(limit), 10_000);\n}\n\nfunction normalizeKey(value: string): string {\n  return value.replaceAll('\\\\', '/');\n}\n\n/** Case-normalized path key for lineage lookups. Mirrors the query engine's\n *  path comparison (lowercase + forward-slash) and additionally strips a\n *  leading `./` so a repo-relative path matches however the tool reported it \u2014\n *  case differences on Windows are the common mismatch. */\nfunction normalizePathKey(value: string): string {\n  return value.replaceAll('\\\\', '/').replace(/^\\.\\//, '').toLowerCase();\n}\n", "const SQLITE_EXPERIMENTAL_WARNING_RE = /sqlite is an experimental feature/i;\n\nfunction isSqliteExperimentalWarning(warning: unknown, rest: readonly unknown[]): boolean {\n  const message = typeof warning === 'string' ? warning : warning instanceof Error ? warning.message : '';\n  const typeOrOptions = rest[0];\n  const warningType =\n    typeof warning === 'string'\n      ? typeof typeOrOptions === 'string'\n        ? typeOrOptions\n        : typeof typeOrOptions === 'object' &&\n            typeOrOptions !== null &&\n            'type' in typeOrOptions &&\n            typeof typeOrOptions.type === 'string'\n          ? typeOrOptions.type\n          : ''\n      : warning instanceof Error\n        ? warning.name\n        : '';\n  const warningCode =\n    typeof warning === 'string'\n      ? typeof typeOrOptions === 'object' &&\n        typeOrOptions !== null &&\n        'code' in typeOrOptions &&\n        typeof typeOrOptions.code === 'string'\n        ? typeOrOptions.code\n        : typeof rest[1] === 'string'\n          ? rest[1]\n          : ''\n      : warning instanceof Error && 'code' in warning && typeof warning.code === 'string'\n        ? warning.code\n        : '';\n\n  return (\n    SQLITE_EXPERIMENTAL_WARNING_RE.test(message) &&\n    (warningType === 'ExperimentalWarning' || warningCode === 'ExperimentalWarning')\n  );\n}\n\n/**\n * Run a synchronous `node:sqlite` load while filtering only Node's built-in\n * SQLite ExperimentalWarning. All other warnings still go through the original\n * process warning path, and the patch is removed before returning.\n */\nexport function withSqliteExperimentalWarningSuppressed<T>(run: () => T): T {\n  const originalEmitWarning = process.emitWarning;\n  const forwardWarning = originalEmitWarning.bind(process) as (\n    warning: unknown,\n    ...rest: unknown[]\n  ) => void;\n\n  process.emitWarning = ((warning: unknown, ...rest: unknown[]): void => {\n    if (isSqliteExperimentalWarning(warning, rest)) return;\n    forwardWarning(warning, ...rest);\n  }) as typeof process.emitWarning;\n\n  try {\n    return run();\n  } finally {\n    process.emitWarning = originalEmitWarning;\n  }\n}\n", "import { createHash } from 'node:crypto';\nimport { createReadStream } from 'node:fs';\nimport * as fs from 'node:fs/promises';\nimport * as path from 'node:path';\nimport { createInterface } from 'node:readline';\nimport { comparePartitionPaths, PARTITION_FILE_PATTERN } from './partition-filename.js';\nimport { type ChroniclePartitionRange, ChroniclePartitionRangeCache } from './partition-range-cache.js';\nimport type { ChronicleEvent, ChronicleOutcome, ChronicleResourceRef } from './types.js';\n\nexport interface ChronicleQuery {\n  eventId?: string;\n  eventTypes?: string[]; outcomes?: ChronicleOutcome[]; from?: string; to?: string;\n  projectId?: string; sessionId?: string; agentId?: string; taskId?: string;\n  providerId?: string; modelId?: string; traceId?: string; logicalRequestId?: string;\n  attemptId?: string; toolCallId?: string; resourceKind?: ChronicleResourceRef['kind'];\n  resourceId?: string; path?: string; line?: number; tags?: Record<string, string>;\n  attributes?: Record<string, unknown>; text?: string; order?: 'asc' | 'desc';\n  limit?: number; cursor?: string;\n}\n\nexport interface ChronicleQueryResult {\n  events: ChronicleEvent[]; total: number; nextCursor?: string;\n  scannedEvents: number; sourceFiles: number; invalidLines: number;\n  summary: ChronicleSummary;\n}\n\n/** Derived once from all matching events; never from the paginated UI sample. */\nexport interface ChronicleSummary {\n  logicalRequests: number; modelAttempts: number; completedAttempts: number; failedAttempts: number;\n  scheduledRetries: number; fallbacks: number; providers: number; models: number;\n  inputTokens: number; outputTokens: number; cacheReadTokens: number; cacheWriteTokens: number;\n  estimatedCostUsd: number;\n  providerAvgDurationMs: number; providerP95DurationMs: number;\n  toolCalls: number; completedTools: number; failedTools: number; toolAvgDurationMs: number;\n  processes: number; failedProcesses: number; fileEvents: number; uniqueFiles: number;\n  agentEvents: number; uniqueAgents: number; decisions: number; escalations: number;\n  failures: number; cancellations: number;\n  families: Record<ChronicleSignalFamily, number>;\n  failuresByFamily: Record<ChronicleSignalFamily, number>;\n}\nexport type ChronicleSignalFamily = 'llm'|'agent'|'tool'|'file'|'memory'|'task'|'decision'|'runtime'|'finding';\n\nexport type ChronicleFacet = 'eventType' | 'outcome' | 'projectId' | 'sessionId' |\n  'agentId' | 'taskId' | 'providerId' | 'modelId' | 'resourceKind' | 'resourcePath' | 'toolCallId';\nexport interface ChronicleFacetValue { value: string; count: number }\nexport type ChronicleFacetResults = Partial<Record<ChronicleFacet, ChronicleFacetValue[]>>;\n\n/**\n * The complete set of valid {@link ChronicleFacet} values. Shared by both\n * the CLI-embedded and standalone WebUI message routers so they can validate\n * `chronicle.facet` / `chronicle.facets` payloads against a single source of\n * truth \u2014 if `ChronicleFacet` grows a member, this set is the only place\n * that needs updating.\n */\nexport const CHRONICLE_FACET_FIELDS: ReadonlySet<ChronicleFacet> = new Set<ChronicleFacet>([\n  'eventType',\n  'outcome',\n  'projectId',\n  'sessionId',\n  'agentId',\n  'taskId',\n  'providerId',\n  'modelId',\n  'resourceKind',\n  'resourcePath',\n  'toolCallId',\n]);\nexport type ChronicleRelationKind = 'parent_span' | 'trace' | 'tool_call' | 'logical_request' |\n  'attempt' | 'decision' | 'network_request' | 'prompt_manifest' | 'resource_lineage';\nexport interface ChronicleGraphEdge { from: string; to: string; kind: ChronicleRelationKind; confidence: 'explicit' | 'correlated' | 'inferred' }\nexport interface ChronicleGraphResult { nodes: ChronicleEvent[]; edges: ChronicleGraphEdge[]; truncated: boolean }\n\ninterface ChronicleOrderKey {\n  occurredAt: string;\n  persistedAt: string;\n  sequence: number;\n  eventId: string;\n}\n\ninterface ChronicleSnapshotEntry {\n  id: string;\n  size: number;\n}\n\ninterface ChronicleCursor {\n  version: 1;\n  order: 'asc' | 'desc';\n  queryHash: string;\n  after: ChronicleOrderKey;\n  snapshot: ChronicleSnapshotEntry[];\n}\n\ninterface SnapshotFile extends ChronicleSnapshotEntry {\n  file: string;\n}\n\nconst MAX_CURSOR_SNAPSHOT_ENTRIES = 10_000;\n\n// \u2500\u2500 Streaming line-by-line reader \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nfunction streamLines(filePath: string, maxBytes?: number): AsyncIterableIterator<string> {\n  const stream = createReadStream(filePath, {\n    encoding: 'utf8',\n    highWaterMark: 256 * 1024,\n    ...(maxBytes !== undefined ? { end: maxBytes - 1 } : {}),\n  });\n  const rl = createInterface({ input: stream, crlfDelay: Infinity });\n  return rl[Symbol.asyncIterator]() as AsyncIterableIterator<string>;\n}\n\n/** One dedicated full pass over a closed file to learn its true occurredAt bounds. */\nasync function computeOccurredAtRange(\n  file: string,\n  size: number,\n): Promise<{ min: string; max: string } | undefined> {\n  let min: string | undefined;\n  let max: string | undefined;\n  for await (const line of streamLines(file, size)) {\n    if (!line.trim()) continue;\n    let event: ChronicleEvent;\n    try {\n      event = JSON.parse(line) as ChronicleEvent;\n      if (!isChronicleEvent(event)) continue;\n    } catch { continue; }\n    const occurredAt = event.occurredAt ?? event.observedAt;\n    if (min === undefined || occurredAt < min) min = occurredAt;\n    if (max === undefined || occurredAt > max) max = occurredAt;\n  }\n  return min === undefined ? undefined : { min, max: max! };\n}\n\nfunction rangeOverlaps(range: ChroniclePartitionRange, query: ChronicleQuery): boolean {\n  if (range.empty) return false;\n  if (query.from && range.maxOccurredAt! < query.from) return false;\n  if (query.to && range.minOccurredAt! > query.to) return false;\n  return true;\n}\n\n// \u2500\u2500 Streaming query engine (no pre-loaded events) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/** Queryable projection over immutable Chronicle JSONL partitions.\n *  Events are streamed on demand \u2014 no full-file load into memory. */\nexport interface ChronicleQueryEngineOptions {\n  /** Shared, longer-lived cache of closed partitions' observed occurredAt ranges. */\n  rangeCache?: ChroniclePartitionRangeCache;\n}\n\nexport class ChronicleQueryEngine {\n  private readonly partitionFiles: string[];\n  private readonly rangeCache: ChroniclePartitionRangeCache | undefined;\n  /** The one file (if any) that could still be actively appended to \u2014 never cache-checked or skipped. */\n  private readonly activeFile: string | undefined;\n\n  private constructor(\n    files: string[],\n    readonly diagnostics: { sourceFiles: number; invalidLines: number },\n    rangeCache?: ChroniclePartitionRangeCache,\n    activeFile?: string,\n  ) {\n    this.partitionFiles = files;\n    this.rangeCache = rangeCache;\n    this.activeFile = activeFile;\n  }\n\n  static async fromDirectory(\n    directory: string,\n    options?: ChronicleQueryEngineOptions,\n  ): Promise<ChronicleQueryEngine> {\n    const resolved = path.resolve(directory);\n    const files = await findPartitions(resolved);\n    const rangeCache = options?.rangeCache ?? new ChroniclePartitionRangeCache(resolved);\n    return new ChronicleQueryEngine(\n      files,\n      { sourceFiles: files.length, invalidLines: 0 },\n      rangeCache,\n      files.at(-1),\n    );\n  }\n\n  static async fromFiles(files: string[]): Promise<ChronicleQueryEngine> {\n    return new ChronicleQueryEngine(files, { sourceFiles: files.length, invalidLines: 0 });\n  }\n\n  /**\n   * Returns the file's observed (min, max) `occurredAt` range, computing and\n   * caching it on first use. Only ever called for closed/immutable files\n   * (never `this.activeFile`) \u2014 see the skip-check call sites.\n   */\n  private async getOrComputeRange(file: string, size: number): Promise<ChroniclePartitionRange> {\n    const cached = await this.rangeCache!.get(file, size);\n    if (cached) return cached;\n    const computed = await computeOccurredAtRange(file, size);\n    const range: ChroniclePartitionRange = computed\n      ? { size, minOccurredAt: computed.min, maxOccurredAt: computed.max }\n      : { size, empty: true };\n    this.rangeCache!.set(file, range);\n    return range;\n  }\n\n  /** True when a closed file's cached range provably cannot contain a match for `query`. */\n  private async canSkip(file: string, size: number, query: ChronicleQuery): Promise<boolean> {\n    if (!this.rangeCache || (!query.from && !query.to) || file === this.activeFile) return false;\n    const range = await this.getOrComputeRange(file, size);\n    return !rangeOverlaps(range, query);\n  }\n\n  /** Stream all partitions, filter, and return the requested page + summary. */\n  async query(query: ChronicleQuery = {}): Promise<ChronicleQueryResult> {\n    const order = query.order ?? 'desc';\n    const limit = Math.max(1, Math.min(query.limit ?? 100, 10_000));\n    const queryHash = hashQuery(query);\n    const cursor = decodeCursor(query.cursor, order, queryHash);\n    const snapshotFiles = cursor\n      ? await resolveSnapshotFiles(this.partitionFiles, cursor.snapshot)\n      : await captureSnapshot(this.partitionFiles);\n    const files = order === 'asc' ? snapshotFiles : snapshotFiles.slice().reverse();\n    const summaryAcc = createSummaryAccumulator();\n    const orderedCandidates: ChronicleEvent[] = [];\n    const pageOrder = (left: ChronicleEvent, right: ChronicleEvent) =>\n      compareEvents(left, right) * (order === 'asc' ? 1 : -1);\n    let totalCount = 0;\n    let remainingCount = 0;\n    let scannedEvents = 0;\n    let invalidLines = 0;\n\n    for (const snapshotFile of files) {\n      try {\n        if (snapshotFile.size === 0) continue;\n        // A closed file whose observed occurredAt range can't overlap [from, to]\n        // is skipped with zero I/O. scannedEvents/invalidLines below reflect\n        // only lines actually read this call, so a skip legitimately lowers\n        // them \u2014 that's the optimization working, not a regression.\n        if (await this.canSkip(snapshotFile.file, snapshotFile.size, query)) continue;\n        const lines = order === 'asc'\n          ? streamLines(snapshotFile.file, snapshotFile.size)\n          : reverseLines(snapshotFile.file, snapshotFile.size);\n\n        for await (const line of lines) {\n          if (!line.trim()) continue;\n          let event: ChronicleEvent;\n          try {\n            event = JSON.parse(line) as ChronicleEvent;\n            if (!isChronicleEvent(event)) { invalidLines++; continue; }\n          } catch { invalidLines++; continue; }\n          scannedEvents++;\n\n          if (!matches(event, query)) continue;\n          totalCount++;\n          updateSummary(summaryAcc, event);\n\n          if (cursor && compareEventToKey(event, cursor.after) * (order === 'asc' ? 1 : -1) <= 0) {\n            continue;\n          }\n          remainingCount++;\n\n          // Keyset pagination retains only this page's best `limit` matches.\n          // Cursor depth and journal size therefore cannot grow page memory.\n          const insertionIndex = findInsertionIndex(orderedCandidates, event, pageOrder);\n          if (insertionIndex < limit) {\n            orderedCandidates.splice(insertionIndex, 0, event);\n            if (orderedCandidates.length > limit) orderedCandidates.pop();\n          }\n        }\n      } catch {\n        // Skip unreadable partitions\n      }\n    }\n\n    const pageEvents = orderedCandidates;\n    const lastEvent = pageEvents.at(-1);\n\n    if (this.rangeCache) {\n      this.rangeCache.prune(this.partitionFiles);\n      await this.rangeCache.flush();\n    }\n\n    return {\n      events: pageEvents,\n      total: totalCount,\n      summary: finalizeSummary(summaryAcc),\n      ...(lastEvent && pageEvents.length < remainingCount\n        ? { nextCursor: encodeCursor({\n          version: 1,\n          order,\n          queryHash,\n          after: orderKey(lastEvent),\n          snapshot: snapshotFiles.map(({ id, size }) => ({ id, size })),\n        }) } : {}),\n      scannedEvents,\n      sourceFiles: snapshotFiles.length,\n      invalidLines,\n    };\n  }\n\n  /** Stream all partitions once and compute value counts for every requested facet. */\n  async facets(\n    fields: readonly ChronicleFacet[],\n    query: ChronicleQuery = {},\n    limit = 100,\n  ): Promise<ChronicleFacetResults> {\n    const uniqueFields = [...new Set(fields)];\n    if (uniqueFields.length === 0) return {};\n    const counts = new Map(uniqueFields.map((field) => [field, new Map<string, number>()]));\n    const snapshotFiles = await captureSnapshot(this.partitionFiles);\n    let invalidLines = 0;\n    for (const snapshotFile of snapshotFiles) {\n      try {\n        if (snapshotFile.size === 0) continue;\n        if (await this.canSkip(snapshotFile.file, snapshotFile.size, query)) continue;\n        for await (const line of streamLines(snapshotFile.file, snapshotFile.size)) {\n          if (!line.trim()) continue;\n          let event: ChronicleEvent;\n          try {\n            event = JSON.parse(line) as ChronicleEvent;\n            if (!isChronicleEvent(event)) { invalidLines++; continue; }\n          } catch { invalidLines++; continue; }\n          if (!matches(event, query)) continue;\n          for (const field of uniqueFields) {\n            const value = facetValue(event, field);\n            const fieldCounts = counts.get(field)!;\n            if (value !== undefined) fieldCounts.set(value, (fieldCounts.get(value) ?? 0) + 1);\n          }\n        }\n      } catch { /* skip unreadable */ }\n    }\n    this.diagnostics.invalidLines = invalidLines;\n    if (this.rangeCache) {\n      this.rangeCache.prune(this.partitionFiles);\n      await this.rangeCache.flush();\n    }\n    const result: ChronicleFacetResults = {};\n    for (const field of uniqueFields) {\n      result[field] = [...counts.get(field)!]\n        .map(([value, count]) => ({ value, count }))\n        .sort((a, b) => b.count - a.count || a.value.localeCompare(b.value))\n        .slice(0, Math.max(0, limit));\n    }\n    return result;\n  }\n\n  /** Stream all partitions and compute one facet's value counts. */\n  async facet(field: ChronicleFacet, query: ChronicleQuery = {}, limit = 100): Promise<ChronicleFacetValue[]> {\n    return (await this.facets([field], query, limit))[field] ?? [];\n  }\n\n  /** Expand explicit and typed correlation edges; temporal proximity alone never creates causality. */\n  async graph(seed: ChronicleQuery = {}, hops = 2, maxNodes = 1_000): Promise<ChronicleGraphResult> {\n    const nodeLimit = Math.max(0, Math.floor(maxNodes));\n    const selected = new Map<string, ChronicleEvent>();\n    let seedCount = 0;\n\n    // Pass 1 retains only the bounded seed set.\n    for await (const event of streamEvents(this.partitionFiles)) {\n      if (!matches(event, seed)) continue;\n      seedCount++;\n      if (selected.size < nodeLimit) selected.set(event.eventId, event);\n    }\n\n    let frontier = [...selected.values()];\n    const depthLimit = Math.max(0, Math.min(hops, 10));\n    for (let depth = 0; depth < depthLimit && frontier.length > 0 && selected.size < nodeLimit; depth++) {\n      const frontierKeys = new Set(frontier.flatMap((event) => relationKeys(event).map((relation) => relation.key)));\n      const next: ChronicleEvent[] = [];\n\n      // Each hop is another streaming pass. Only related nodes up to maxNodes\n      // are retained, so journal size cannot determine graph memory usage.\n      for await (const event of streamEvents(this.partitionFiles)) {\n        if (selected.has(event.eventId)) continue;\n        if (!relationKeys(event).some((relation) => frontierKeys.has(relation.key))) continue;\n        selected.set(event.eventId, event);\n        next.push(event);\n        if (selected.size >= nodeLimit) break;\n      }\n      frontier = next;\n    }\n\n    const nodes = [...selected.values()].sort(compareEvents);\n    const byKey = new Map<string, ChronicleEvent[]>();\n    for (const node of nodes) for (const relation of relationKeys(node)) {\n      const related = byKey.get(relation.key) ?? [];\n      related.push(node);\n      byKey.set(relation.key, related);\n    }\n\n    const edges: ChronicleGraphEdge[] = [];\n    const seen = new Set<string>();\n    for (const node of nodes) for (const relation of relationKeys(node)) for (const candidate of byKey.get(relation.key) ?? []) {\n      if (candidate.eventId === node.eventId) continue;\n      const [from, to] = compareEvents(node, candidate) <= 0 ? [node, candidate] : [candidate, node];\n      const id = `${from.eventId}:${to.eventId}:${relation.kind}`;\n      if (!seen.has(id)) { seen.add(id); edges.push({ from: from.eventId, to: to.eventId, kind: relation.kind, confidence: relation.confidence }); }\n    }\n    return { nodes, edges, truncated: seedCount > nodeLimit || selected.size >= nodeLimit };\n  }\n}\n\nasync function* streamEvents(files: readonly string[]): AsyncGenerator<ChronicleEvent> {\n  for (const file of files) {\n    try {\n      for await (const line of streamLines(file)) {\n        if (!line.trim()) continue;\n        try {\n          const event = JSON.parse(line) as ChronicleEvent;\n          if (isChronicleEvent(event)) yield event;\n        } catch { /* skip invalid lines */ }\n      }\n    } catch { /* skip unreadable partitions */ }\n  }\n}\n\n// \u2500\u2500 Reverse line reader (reads a file from end to start) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nasync function* reverseLines(filePath: string, maxBytes?: number): AsyncGenerator<string> {\n  const CHUNK = 64 * 1024;\n  const NEWLINE = 0x0a;\n  let handle: fs.FileHandle;\n  try { handle = await fs.open(filePath, 'r'); } catch { return; }\n  try {\n    const fileSize = (await handle.stat()).size;\n    const size = Math.min(fileSize, maxBytes ?? fileSize);\n    let position = size;\n    let suffix = Buffer.alloc(0);\n    while (position > 0) {\n      const length = Math.min(CHUNK, position);\n      position -= length;\n      const buffer = Buffer.allocUnsafe(length);\n      await handle.read(buffer, 0, length, position);\n      const data = suffix.length === 0 ? buffer : Buffer.concat([buffer, suffix]);\n      let lineEnd = data.length;\n      let firstNewline = -1;\n      for (let index = data.length - 1; index >= 0; index--) {\n        if (data[index] !== NEWLINE) continue;\n        const trimmed = data.subarray(index + 1, lineEnd).toString('utf8').trim();\n        if (trimmed) yield trimmed;\n        lineEnd = index;\n        firstNewline = index;\n      }\n      suffix = firstNewline >= 0 ? Buffer.from(data.subarray(0, firstNewline)) : data;\n    }\n    const trimmed = suffix.toString('utf8').trim();\n    if (trimmed) yield trimmed;\n  } finally { await handle.close(); }\n}\n\n// \u2500\u2500 Running summary accumulator (replaces scan-then-summarize) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport interface SummaryAcc {\n  logicalRequestIds: Set<string>;\n  modelAttempts: number; completedAttempts: number; failedAttempts: number;\n  scheduledRetries: number; fallbacks: number;\n  providers: Set<string>; models: Set<string>;\n  inputTokens: number; outputTokens: number;\n  cacheReadTokens: number; cacheWriteTokens: number;\n  costByScope: Map<string, { cost: number; event: ChronicleEvent }>;\n  providerDurations: number[];\n  toolCalls: number; completedTools: number; failedTools: number;\n  toolDurations: number[];\n  processes: number; failedProcesses: number;\n  fileEvents: number; uniqueFiles: Set<string>;\n  agentEvents: number; uniqueAgents: Set<string>;\n  decisions: number; escalations: number;\n  failures: number; cancellations: number;\n  families: Record<ChronicleSignalFamily, number>;\n  failuresByFamily: Record<ChronicleSignalFamily, number>;\n  /** One-per-scope token.accounted cost snapshot. Updated when a later\n   *  token.accounted event has a later timestamp for the same scope. */\n}\n\n/**\n * Exported for the SQLite query engine (`sqlite-query.ts`).\n *\n * Filtering and summarisation are the parts of `ChronicleQuery` with real\n * semantics \u2014 family classification, nested `usage.*` attribute paths, cost\n * de-duplication by scope, a p95 over every matching duration. Re-expressing\n * those in SQL would create a second definition that drifts from this one, and\n * the drift would show up as quietly different numbers rather than an error.\n * The SQLite engine therefore uses SQL only to narrow candidates, then runs\n * these exact functions over the parsed events.\n */\nexport function createSummaryAccumulator(): SummaryAcc {\n  return {\n    logicalRequestIds: new Set(), modelAttempts: 0, completedAttempts: 0, failedAttempts: 0,\n    scheduledRetries: 0, fallbacks: 0, providers: new Set(), models: new Set(),\n    inputTokens: 0, outputTokens: 0, cacheReadTokens: 0, cacheWriteTokens: 0,\n    costByScope: new Map(), providerDurations: [],\n    toolCalls: 0, completedTools: 0, failedTools: 0, toolDurations: [],\n    processes: 0, failedProcesses: 0,\n    fileEvents: 0, uniqueFiles: new Set(), agentEvents: 0, uniqueAgents: new Set(),\n    decisions: 0, escalations: 0, failures: 0, cancellations: 0,\n    families: { llm: 0, agent: 0, tool: 0, file: 0, memory: 0, task: 0, decision: 0, runtime: 0, finding: 0 },\n    failuresByFamily: { llm: 0, agent: 0, tool: 0, file: 0, memory: 0, task: 0, decision: 0, runtime: 0, finding: 0 },\n  };\n}\n\nexport function updateSummary(acc: SummaryAcc, event: ChronicleEvent): void {\n  // Families\n  const family = signalFamily(event);\n  acc.families[family]++;\n  if (isTerminalFailure(event)) acc.failuresByFamily[family]++;\n\n  // Running counts per event type\n  if (event.correlation.logicalRequestId) acc.logicalRequestIds.add(event.correlation.logicalRequestId);\n  if (event.runtime?.providerId) acc.providers.add(event.runtime.providerId);\n  if (event.runtime?.modelId) acc.models.add(event.runtime.modelId);\n\n  if (event.eventType === 'provider.attempt.started') acc.modelAttempts++;\n  else if (event.eventType === 'provider.attempt.completed') {\n    acc.completedAttempts++;\n    acc.inputTokens += numberAt(event, 'usage.input');\n    acc.outputTokens += numberAt(event, 'usage.output');\n    acc.cacheReadTokens += numberAt(event, 'usage.cacheRead');\n    acc.cacheWriteTokens += numberAt(event, 'usage.cacheWrite');\n    const dur = durationMs(event);\n    if (dur > 0) acc.providerDurations.push(dur);\n  } else if (event.eventType === 'provider.attempt.failed') {\n    acc.failedAttempts++;\n    if (event.attributes?.retryScheduled === true) acc.scheduledRetries++;\n    const dur = durationMs(event);\n    if (dur > 0) acc.providerDurations.push(dur);\n  } else if (event.eventType === 'provider.fallback') acc.fallbacks++;\n  else if (event.eventType === 'tool.started') acc.toolCalls++;\n  else if (event.eventType === 'tool.executed') {\n    acc.completedTools++;\n    const dur = durationMs(event);\n    if (dur > 0) acc.toolDurations.push(dur);\n  } else if (event.eventType === 'tool.failed') {\n    acc.failedTools++;\n    const dur = durationMs(event);\n    if (dur > 0) acc.toolDurations.push(dur);\n  } else if (event.eventType === 'process.started') acc.processes++;\n  else if (event.eventType === 'process.completed' && event.outcome === 'failure') acc.failedProcesses++;\n  else if (event.eventType === 'decision.requested') acc.decisions++;\n  else if (event.eventType === 'decision.escalated') acc.escalations++;\n\n  // Token accounted \u2014 keep the latest finite snapshot per scope. Zero is a\n  // meaningful reset, and compareEvents makes ties independent of scan order.\n  if (event.eventType === 'token.accounted') {\n    const cost = readPath(event.attributes ?? {}, 'cost.total');\n    if (typeof cost === 'number' && Number.isFinite(cost)) {\n      const key = scopeKey(event);\n      const existing = acc.costByScope.get(key);\n      if (!existing || compareEvents(event, existing.event) > 0) {\n        acc.costByScope.set(key, { cost, event });\n      }\n    }\n  }\n\n  // File evidence\n  if (event.resource?.kind === 'file' || event.eventType.startsWith('file.')) {\n    acc.fileEvents++;\n    if (event.resource?.path) acc.uniqueFiles.add(event.resource.path);\n  }\n\n  // Agent events\n  if (family === 'agent') acc.agentEvents++;\n  if (event.scope.agentId) acc.uniqueAgents.add(event.scope.agentId);\n\n  // Terminal failures and cancellations\n  if (isTerminalFailure(event)) acc.failures++;\n  if (event.outcome === 'cancelled' || event.outcome === 'abandoned') acc.cancellations++;\n}\n\nexport function finalizeSummary(acc: SummaryAcc): ChronicleSummary {\n  const sortedProviderDurations = acc.providerDurations.slice().sort((a, b) => a - b);\n  const sortedToolDurations = acc.toolDurations.slice().sort((a, b) => a - b);\n  const totalCost = [...acc.costByScope.values()].reduce((sum, entry) => sum + entry.cost, 0);\n  return {\n    logicalRequests: acc.logicalRequestIds.size,\n    modelAttempts: acc.modelAttempts,\n    completedAttempts: acc.completedAttempts,\n    failedAttempts: acc.failedAttempts,\n    scheduledRetries: acc.scheduledRetries,\n    fallbacks: acc.fallbacks,\n    providers: acc.providers.size,\n    models: acc.models.size,\n    inputTokens: acc.inputTokens,\n    outputTokens: acc.outputTokens,\n    cacheReadTokens: acc.cacheReadTokens,\n    cacheWriteTokens: acc.cacheWriteTokens,\n    estimatedCostUsd: totalCost,\n    providerAvgDurationMs: average(sortedProviderDurations),\n    providerP95DurationMs: percentile(sortedProviderDurations, 0.95),\n    toolCalls: acc.toolCalls,\n    completedTools: acc.completedTools,\n    failedTools: acc.failedTools,\n    toolAvgDurationMs: average(sortedToolDurations),\n    processes: acc.processes,\n    failedProcesses: acc.failedProcesses,\n    fileEvents: acc.fileEvents,\n    uniqueFiles: acc.uniqueFiles.size,\n    agentEvents: acc.agentEvents,\n    uniqueAgents: acc.uniqueAgents.size,\n    decisions: acc.decisions,\n    escalations: acc.escalations,\n    failures: acc.failures,\n    cancellations: acc.cancellations,\n    families: acc.families,\n    failuresByFamily: acc.failuresByFamily,\n  };\n}\n\n// \u2500\u2500 Partition discovery (no pre-loading) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/** The partition files list is stored on the prototype for legacy callers\n *  that reference engine.partitionFiles directly. */\nObject.defineProperty(ChronicleQueryEngine.prototype, 'partitionFiles', {\n  get() { throw new Error('ChronicleQueryEngine no longer loads events on construction. Use async query().'); },\n  set(this: ChronicleQueryEngine, _val: string[]) {\n    // Allow fromFiles/fromDirectory to attach the list for graph()\n    Object.defineProperty(this, 'partitionFiles', { value: _val, writable: false, configurable: false });\n  },\n});\n\n/** Recursively locate journal partition files under a Chronicle directory,\n *  ordered family-first then rotation index. Shared with the metrics store. */\nexport async function findChroniclePartitions(root: string): Promise<string[]> {\n  return findPartitions(root);\n}\n\nasync function findPartitions(root: string): Promise<string[]> {\n  const result: string[] = [];\n  const visit = async (directory: string): Promise<void> => {\n    let entries: import('node:fs').Dirent[];\n    try { entries = await fs.readdir(directory, { withFileTypes: true }); } catch { return; }\n    for (const entry of entries) {\n      const full = path.join(directory, entry.name);\n      if (entry.isDirectory()) await visit(full);\n      else if (entry.isFile() && PARTITION_FILE_PATTERN.test(entry.name)) result.push(full);\n    }\n  };\n  await visit(root);\n  return result.sort(comparePartitionPaths);\n}\n\n// \u2500\u2500 Helper functions \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nfunction numberAt(event: ChronicleEvent, dotPath: string): number {\n  const value = readPath(event.attributes ?? {}, dotPath);\n  return typeof value === 'number' && Number.isFinite(value) ? value : 0;\n}\n\nfunction durationMs(event: ChronicleEvent): number {\n  const value = Number(event.durationNs ?? 0) / 1_000_000;\n  return Number.isFinite(value) ? value : 0;\n}\n\nfunction average(values: number[]): number {\n  return values.length ? values.reduce((sum, v) => sum + v, 0) / values.length : 0;\n}\n\nfunction percentile(sorted: number[], quantile: number): number {\n  return sorted.length ? sorted[Math.min(sorted.length - 1, Math.max(0, Math.ceil(sorted.length * quantile) - 1))]! : 0;\n}\n\nfunction scopeKey(event: ChronicleEvent): string {\n  return `${event.scope.projectId ?? ''}\\0${event.scope.sessionId ?? ''}\\0${event.scope.agentId ?? ''}`;\n}\n\n/** Shared with ChronicleMetricsStore so its default-view summary classifies\n *  events identically to the raw-scan summary it stands in for. */\nexport function signalFamily(event: ChronicleEvent): ChronicleSignalFamily {\n  if (/^(?:decision|brain|permission)\\./.test(event.eventType)) return 'decision';\n  if (event.resource?.kind === 'file' || event.resource?.kind === 'symbol' || /^(?:file|worktree)\\./.test(event.eventType)) return 'file';\n  if (/^(?:provider|token|context|ctx|compaction)\\./.test(event.eventType)) return 'llm';\n  if (/^(?:agent|subagent|delegate|fleet|concurrency)\\./.test(event.eventType)) return 'agent';\n  if (/^(?:tool|process|mcp|network)\\./.test(event.eventType)) return 'tool';\n  if (/^(?:memory|storage|trust)\\./.test(event.eventType)) return 'memory';\n  if (/^(?:sdd|task|kanban|checkpoint|session|iteration|in_flight)\\./.test(event.eventType)) return 'task';\n  if (/^(?:finding|review)\\./.test(event.eventType)) return 'finding';\n  return 'runtime';\n}\n\n/** Shared with ChronicleMetricsStore \u2014 see signalFamily(). */\nexport function isTerminalFailure(event: ChronicleEvent): boolean {\n  if (event.eventType === 'provider.attempt.failed') return event.attributes?.retryScheduled !== true;\n  return event.eventType === 'tool.failed' ||\n    (event.eventType === 'process.completed' && event.outcome === 'failure') ||\n    /^(?:agent\\.run\\.error|sdd\\.task\\.failed|compaction\\.failed|network\\.request\\.failed)$/.test(event.eventType);\n}\n\n/**\n * Exported for the SQLite engine. Which correlation keys an event carries \u2014 and\n * with what confidence \u2014 is the definition of a Chronicle edge; a second copy\n * would let the two engines draw different graphs from the same data.\n */\nexport function relationKeys(event: ChronicleEvent): Array<{ key: string; kind: ChronicleRelationKind; confidence: ChronicleGraphEdge['confidence'] }> {\n  const result: Array<{ key: string; kind: ChronicleRelationKind; confidence: ChronicleGraphEdge['confidence'] }> = [];\n  const add = (kind: ChronicleRelationKind, value: unknown, confidence: ChronicleGraphEdge['confidence']) => {\n    if (typeof value === 'string' && value) result.push({ key: `${kind}:${value}`, kind, confidence });\n  };\n  add('trace', event.correlation.traceId, 'correlated');\n  add('tool_call', event.correlation.toolCallId, 'explicit');\n  add('logical_request', event.correlation.logicalRequestId, 'explicit');\n  add('attempt', event.correlation.attemptId, 'explicit');\n  add('decision', event.attributes?.decisionId, 'explicit');\n  add('network_request', event.attributes?.requestId, 'explicit');\n  add('prompt_manifest', (event.attributes?.promptManifest as Record<string, unknown> | undefined)?.manifestId, 'explicit');\n  add('resource_lineage', event.resource?.id, 'inferred');\n  // tool.resource.observed is windowed into one metrics.rollup event per\n  // tool call (rollup-adapter.ts) carrying a bounded `resources` list rather\n  // than a single top-level `resource` \u2014 surface each as its own edge so a\n  // rolled-up \"observed\" touch still participates in the same resource\n  // lineage group as a mutation event for the same resource id.\n  if (event.eventType === 'metrics.rollup' && event.attributes?.signal === 'tool.resource.observed') {\n    const resources = event.attributes.resources as Array<{ id?: unknown }> | undefined;\n    for (const resource of resources ?? []) {\n      if (typeof resource?.id === 'string') add('resource_lineage', resource.id, 'inferred');\n    }\n  }\n  if (event.correlation.parentSpanId) add('parent_span', event.correlation.parentSpanId, 'explicit');\n  add('parent_span', event.correlation.spanId, 'explicit');\n  return result;\n}\n\nexport function matches(event: ChronicleEvent, query: ChronicleQuery): boolean {\n  if (query.eventId && event.eventId !== query.eventId) return false;\n  if (query.eventTypes && !query.eventTypes.includes(event.eventType)) return false;\n  if (query.outcomes && (!event.outcome || !query.outcomes.includes(event.outcome))) return false;\n  const occurredAt = event.occurredAt ?? event.observedAt;\n  if (query.from && occurredAt < query.from || query.to && occurredAt > query.to) return false;\n  if (!equal(query.projectId, event.scope.projectId) || !equal(query.sessionId, event.scope.sessionId)) return false;\n  if (!equal(query.agentId, event.scope.agentId) || !equal(query.taskId, event.scope.taskId)) return false;\n  if (!equal(query.providerId, event.runtime?.providerId) || !equal(query.modelId, event.runtime?.modelId)) return false;\n  if (!equal(query.traceId, event.correlation.traceId) || !equal(query.logicalRequestId, event.correlation.logicalRequestId)) return false;\n  if (!equal(query.attemptId, event.correlation.attemptId) || !equal(query.toolCallId, event.correlation.toolCallId)) return false;\n  if (!equal(query.resourceKind, event.resource?.kind) || !equal(query.resourceId, event.resource?.id)) return false;\n  if (query.path && normalize(event.resource?.path) !== normalize(query.path)) return false;\n  if (query.line !== undefined && !lineContains(event, query.line)) return false;\n  if (query.tags && !objectContains(event.tags, query.tags)) return false;\n  if (query.attributes && !objectContains(event.attributes, query.attributes)) return false;\n  if (query.text && !JSON.stringify(event).toLocaleLowerCase().includes(query.text.toLocaleLowerCase())) return false;\n  return true;\n}\n\nfunction equal<T>(expected: T | undefined, actual: T | undefined): boolean { return expected === undefined || expected === actual; }\nfunction normalize(value: string | undefined): string | undefined { return value?.replaceAll('\\\\', '/').toLocaleLowerCase(); }\nfunction lineContains(event: ChronicleEvent, line: number): boolean {\n  const start = event.resource?.lineStart; const end = event.resource?.lineEnd ?? start;\n  return start !== undefined && end !== undefined && line >= start && line <= end;\n}\nfunction objectContains(actual: Record<string, unknown> | undefined, expected: Record<string, unknown>): boolean {\n  return Boolean(actual && Object.entries(expected).every(([key, value]) => deepEqual(readPath(actual, key), value)));\n}\nfunction readPath(value: Record<string, unknown>, key: string): unknown {\n  return key.split('.').reduce<unknown>((current, part) => current && typeof current === 'object'\n    ? (current as Record<string, unknown>)[part] : undefined, value);\n}\nfunction deepEqual(left: unknown, right: unknown): boolean { return JSON.stringify(left) === JSON.stringify(right); }\nfunction findInsertionIndex(\n  events: readonly ChronicleEvent[],\n  event: ChronicleEvent,\n  compare: (left: ChronicleEvent, right: ChronicleEvent) => number,\n): number {\n  let low = 0;\n  let high = events.length;\n  while (low < high) {\n    const middle = (low + high) >>> 1;\n    if (compare(events[middle]!, event) <= 0) low = middle + 1;\n    else high = middle;\n  }\n  return low;\n}\nexport function compareEvents(a: ChronicleEvent, b: ChronicleEvent): number {\n  return compareEventToKey(a, orderKey(b));\n}\nfunction compareEventToKey(event: ChronicleEvent, key: ChronicleOrderKey): number {\n  return (event.occurredAt ?? event.observedAt).localeCompare(key.occurredAt) ||\n    event.persistedAt.localeCompare(key.persistedAt) || event.sequence - key.sequence ||\n    event.eventId.localeCompare(key.eventId);\n}\nfunction orderKey(event: ChronicleEvent): ChronicleOrderKey {\n  return {\n    occurredAt: event.occurredAt ?? event.observedAt,\n    persistedAt: event.persistedAt,\n    sequence: event.sequence,\n    eventId: event.eventId,\n  };\n}\nfunction hashQuery(query: ChronicleQuery): string {\n  const { cursor: _cursor, limit: _limit, order: _order, ...filters } = query;\n  return createHash('sha256').update(stableStringify(filters), 'utf8').digest('base64url');\n}\nfunction encodeCursor(cursor: ChronicleCursor): string {\n  return Buffer.from(JSON.stringify(cursor), 'utf8').toString('base64url');\n}\nfunction decodeCursor(\n  encoded: string | undefined,\n  order: 'asc' | 'desc',\n  queryHash: string,\n): ChronicleCursor | undefined {\n  if (!encoded) return undefined;\n  if (encoded.length > 1_000_000) throw new Error('Invalid Chronicle cursor');\n  try {\n    const parsed = JSON.parse(Buffer.from(encoded, 'base64url').toString('utf8')) as unknown;\n    if (!isCursor(parsed) || parsed.order !== order || parsed.queryHash !== queryHash) {\n      throw new Error('cursor does not match the query');\n    }\n    return parsed;\n  } catch (error) {\n    throw new Error(`Invalid Chronicle cursor: ${error instanceof Error ? error.message : String(error)}`);\n  }\n}\nfunction isCursor(value: unknown): value is ChronicleCursor {\n  if (!value || typeof value !== 'object') return false;\n  const cursor = value as Partial<ChronicleCursor>;\n  const after = cursor.after as Partial<ChronicleOrderKey> | undefined;\n  if (cursor.version !== 1 || (cursor.order !== 'asc' && cursor.order !== 'desc') ||\n    typeof cursor.queryHash !== 'string' || !after ||\n    typeof after.occurredAt !== 'string' || typeof after.persistedAt !== 'string' ||\n    !Number.isSafeInteger(after.sequence) || typeof after.eventId !== 'string' ||\n    !Array.isArray(cursor.snapshot) || cursor.snapshot.length > MAX_CURSOR_SNAPSHOT_ENTRIES) return false;\n\n  const snapshotIds = new Set<string>();\n  for (const entry of cursor.snapshot) {\n    if (!entry || typeof entry.id !== 'string' || !entry.id ||\n      !Number.isSafeInteger(entry.size) || entry.size < 0 || snapshotIds.has(entry.id)) return false;\n    snapshotIds.add(entry.id);\n  }\n  return true;\n}\nasync function captureSnapshot(files: readonly string[]): Promise<SnapshotFile[]> {\n  if (files.length > MAX_CURSOR_SNAPSHOT_ENTRIES) {\n    throw new Error('Chronicle snapshot contains too many partitions');\n  }\n  return Promise.all(files.map(async (file) => {\n    let size = 0;\n    try { size = (await fs.stat(file)).size; } catch { /* preserve missing source as empty */ }\n    return { file, id: fileId(file), size };\n  }));\n}\nasync function resolveSnapshotFiles(\n  files: readonly string[],\n  snapshot: readonly ChronicleSnapshotEntry[],\n): Promise<SnapshotFile[]> {\n  const currentFiles = new Map(files.map((file) => [fileId(file), file]));\n  return Promise.all(snapshot.map(async (entry) => {\n    const file = currentFiles.get(entry.id);\n    if (!file) throw new Error('Chronicle cursor snapshot has expired');\n    let currentSize: number;\n    try { currentSize = (await fs.stat(file)).size; } catch { throw new Error('Chronicle cursor snapshot has expired'); }\n    if (currentSize < entry.size) throw new Error('Chronicle cursor snapshot has expired');\n    return { file, ...entry };\n  }));\n}\nfunction fileId(file: string): string {\n  return createHash('sha256').update(path.resolve(file), 'utf8').digest('base64url');\n}\nfunction stableStringify(value: unknown): string {\n  if (value === null || typeof value !== 'object') return JSON.stringify(value);\n  if (Array.isArray(value)) return `[${value.map(stableStringify).join(',')}]`;\n  const object = value as Record<string, unknown>;\n  return `{${Object.keys(object).sort().map((key) => `${JSON.stringify(key)}:${stableStringify(object[key])}`).join(',')}}`;\n}\nfunction isChronicleEvent(value: unknown): value is ChronicleEvent {\n  if (!isRecord(value) || !isRecord(value.scope) || !isRecord(value.correlation)) return false;\n  return value.schemaVersion === 1 &&\n    typeof value.eventId === 'string' && typeof value.eventType === 'string' &&\n    typeof value.occurredAt === 'string' && typeof value.observedAt === 'string' &&\n    typeof value.persistedAt === 'string' && Number.isSafeInteger(value.sequence) &&\n    (value.sequence as number) >= 0 && typeof value.previousHash === 'string' &&\n    typeof value.hash === 'string' && typeof value.scope.installationId === 'string' &&\n    typeof value.scope.machineId === 'string' && optionalStrings(value.scope, [\n      'projectId', 'repositoryId', 'workspaceId', 'worktreeId', 'sessionId', 'turnId',\n      'iterationId', 'agentId', 'goalId', 'planId', 'taskId', 'kanbanBoardId',\n    ]) && typeof value.correlation.traceId === 'string' &&\n    typeof value.correlation.spanId === 'string' && optionalStrings(value.correlation, [\n      'parentSpanId', 'logicalRequestId', 'attemptId', 'toolCallId',\n    ]) && isRuntime(value.runtime) && isResource(value.resource) &&\n    (value.attributes === undefined || isRecord(value.attributes)) &&\n    (value.tags === undefined || isStringRecord(value.tags));\n}\nfunction isRuntime(value: unknown): boolean {\n  return value === undefined || isRecord(value) &&\n    optionalStrings(value, ['providerId', 'modelId', 'modelRevision']) &&\n    optionalFiniteNumbers(value, ['processId', 'parentProcessId']);\n}\nfunction isResource(value: unknown): boolean {\n  if (value === undefined) return true;\n  if (!isRecord(value) || !['file', 'symbol', 'memory', 'task', 'kanban', 'process',\n    'network', 'artifact', 'other'].includes(String(value.kind)) || typeof value.id !== 'string') return false;\n  return optionalStrings(value, ['path', 'contentHashBefore', 'contentHashAfter']) &&\n    optionalFiniteNumbers(value, ['lineStart', 'lineEnd']);\n}\nfunction optionalStrings(value: Record<string, unknown>, keys: readonly string[]): boolean {\n  return keys.every((key) => value[key] === undefined || typeof value[key] === 'string');\n}\nfunction optionalFiniteNumbers(value: Record<string, unknown>, keys: readonly string[]): boolean {\n  return keys.every((key) => value[key] === undefined || typeof value[key] === 'number' && Number.isFinite(value[key]));\n}\nfunction isStringRecord(value: unknown): value is Record<string, string> {\n  return isRecord(value) && Object.values(value).every((entry) => typeof entry === 'string');\n}\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return Boolean(value && typeof value === 'object' && !Array.isArray(value));\n}\nexport function facetValue(event: ChronicleEvent, field: ChronicleFacet): string | undefined {\n  const values: Record<ChronicleFacet, string | undefined> = {\n    eventType: event.eventType, outcome: event.outcome, projectId: event.scope.projectId,\n    sessionId: event.scope.sessionId, agentId: event.scope.agentId, taskId: event.scope.taskId,\n    providerId: event.runtime?.providerId, modelId: event.runtime?.modelId,\n    resourceKind: event.resource?.kind, resourcePath: event.resource?.path,\n    toolCallId: event.correlation.toolCallId,\n  };\n  return values[field];\n}\n", "import * as fs from 'node:fs/promises';\nimport * as path from 'node:path';\nimport { atomicWrite, withFileLock } from '../utils/atomic-write.js';\n\nconst CACHE_VERSION = 1;\n\nexport interface ChroniclePartitionRange {\n  size: number;\n  minOccurredAt?: string;\n  maxOccurredAt?: string;\n  /** No valid events were found in the file. */\n  empty?: boolean;\n}\n\ninterface CacheFile {\n  version: number;\n  entries: Record<string, ChroniclePartitionRange>;\n}\n\nfunction isRange(value: unknown): value is ChroniclePartitionRange {\n  if (!value || typeof value !== 'object') return false;\n  const range = value as Partial<ChroniclePartitionRange>;\n  return (\n    typeof range.size === 'number' &&\n    (range.minOccurredAt === undefined || typeof range.minOccurredAt === 'string') &&\n    (range.maxOccurredAt === undefined || typeof range.maxOccurredAt === 'string') &&\n    (range.empty === undefined || typeof range.empty === 'boolean')\n  );\n}\n\n/**\n * Persisted cache of each closed (immutable) Chronicle partition file's\n * observed min/max `occurredAt`, so query()/facets() can skip a file\n * entirely instead of re-streaming its contents when it can't overlap a\n * time-bounded query. Keyed by (path, size) so a file whose size ever\n * unexpectedly changes just misses and gets recomputed.\n */\nexport class ChroniclePartitionRangeCache {\n  private readonly cachePath: string;\n  private entries: Map<string, ChroniclePartitionRange> | undefined;\n  private dirty = false;\n\n  constructor(private readonly directory: string) {\n    this.cachePath = path.join(directory, 'range-cache.json');\n  }\n\n  private toKey(filePath: string): string {\n    return path.relative(this.directory, filePath).split(path.sep).join('/');\n  }\n\n  private async load(): Promise<Map<string, ChroniclePartitionRange>> {\n    if (this.entries) return this.entries;\n    const entries = new Map<string, ChroniclePartitionRange>();\n    try {\n      const raw = await fs.readFile(this.cachePath, 'utf8');\n      const parsed = JSON.parse(raw) as Partial<CacheFile>;\n      if (parsed.version === CACHE_VERSION && parsed.entries && typeof parsed.entries === 'object') {\n        for (const [key, range] of Object.entries(parsed.entries)) {\n          if (isRange(range)) entries.set(key, range);\n        }\n      }\n    } catch {\n      // Missing, corrupt, or unreadable sidecar: self-heal by starting\n      // empty rather than failing the query it's meant to speed up.\n    }\n    this.entries = entries;\n    return entries;\n  }\n\n  async get(filePath: string, currentSize: number): Promise<ChroniclePartitionRange | undefined> {\n    const entries = await this.load();\n    const range = entries.get(this.toKey(filePath));\n    return range && range.size === currentSize ? range : undefined;\n  }\n\n  set(filePath: string, range: ChroniclePartitionRange): void {\n    this.entries ??= new Map();\n    this.entries.set(this.toKey(filePath), range);\n    this.dirty = true;\n  }\n\n  /** Drop entries for files no longer present (e.g. removed by retention purge). */\n  prune(existingFiles: readonly string[]): void {\n    if (!this.entries) return;\n    const keep = new Set(existingFiles.map((file) => this.toKey(file)));\n    for (const key of this.entries.keys()) {\n      if (!keep.has(key)) {\n        this.entries.delete(key);\n        this.dirty = true;\n      }\n    }\n  }\n\n  async flush(): Promise<void> {\n    if (!this.dirty || !this.entries) return;\n    const payload: CacheFile = { version: CACHE_VERSION, entries: Object.fromEntries(this.entries) };\n    try {\n      await withFileLock(this.cachePath, async () => {\n        await atomicWrite(this.cachePath, `${JSON.stringify(payload)}\\n`, { mode: 0o600 });\n      });\n      this.dirty = false;\n    } catch {\n      // Best-effort persistence: the cache still works in-memory for this\n      // process even if the sidecar couldn't be written this time.\n    }\n  }\n}\n", "import { createHash } from 'node:crypto';\nimport * as fs from 'node:fs';\nimport * as os from 'node:os';\nimport * as path from 'node:path';\nimport { assertUnixSocketPathWithinLimit } from '../utils/socket-path.js';\nimport { CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION } from './project-server-protocol.js';\n\nexport const CHRONICLE_PROJECT_SERVER_METADATA_FILE = 'server.json';\n\nfunction normalizedPath(value: string): string {\n  const resolved = path.resolve(value);\n  return process.platform === 'win32' ? resolved.toLowerCase() : resolved;\n}\n\nexport function chronicleProjectServerKey(projectDir: string): string {\n  return createHash('sha256')\n    .update(normalizedPath(path.join(projectDir, 'chronicle')))\n    .digest('hex')\n    .slice(0, 24);\n}\n\n/**\n * Deterministic per-project chronicle IPC endpoint.\n *\n * The Unix subdirectory is the short `wsch-v<V>/` (was\n * `wrongstack-chronicle-v<V>/`, which left a single byte of macOS `sun_path`\n * headroom under the ~48-byte per-user TMPDIR \u2014 see the codebase-index macOS\n * incident and `@wrongstack/persistence` socket-path helpers). ~86 bytes\n * worst-case macOS now.\n *\n * Migration: the protocol version stays embedded in the path, so this rename\n * behaves exactly like a protocol bump \u2014 old daemons keep listening on the old\n * `wrongstack-chronicle-v<V>/` path, are never contacted again, and exit on\n * their idle timeout. No coexistence window: a client build always talks only\n * to the endpoint scheme it derives. Bump\n * `CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION` for wire changes as before; the\n * prefix itself must not grow without re-checking the byte budget.\n * The Windows pipe name keeps the long prefix \u2014 named pipes have no\n * `sun_path` limit.\n */\nexport function chronicleProjectServerEndpoint(projectDir: string): string {\n  const key = chronicleProjectServerKey(projectDir);\n  if (process.platform === 'win32') {\n    return `\\\\\\\\.\\\\pipe\\\\wrongstack-chronicle-v${CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION}-${key}`;\n  }\n  return path.join(\n    os.tmpdir(),\n    `wsch-v${CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION}`,\n    `${key}.sock`,\n  );\n}\n\nexport function chronicleProjectServerMetadataPath(projectDir: string): string {\n  return path.join(projectDir, 'chronicle', CHRONICLE_PROJECT_SERVER_METADATA_FILE);\n}\n\nexport function ensureChronicleProjectServerSocketDirectory(endpoint: string): void {\n  if (process.platform !== 'win32') {\n    // ~86 bytes under a canonical macOS TMPDIR since the wsch-v1/ rename.\n    // Assert so growth fails loudly instead of as a silent bind error in the\n    // detached daemon (see the codebase-index macOS incident).\n    assertUnixSocketPathWithinLimit(endpoint, 'chronicle');\n    fs.mkdirSync(path.dirname(endpoint), { recursive: true, mode: 0o700 });\n  }\n}\n", "/**\n * Re-export of the Unix socket path-length helpers from\n * `@wrongstack/persistence` so packages that depend on core (tools, sage)\n * share one implementation with packages that depend on persistence directly\n * (kanban). See `packages/persistence/src/socket-path.ts` for rationale.\n */\nexport {\n  assertUnixSocketPathWithinLimit,\n  checkUnixSocketPath,\n  type UnixSocketPathCheck,\n  unixSocketPathLimit,\n} from '@wrongstack/persistence';\n", "import type { ChronicleJournalStats, ChroniclePurgeResult } from './journal.js';\nimport type { ChronicleMetricsRefreshResult } from './metrics-store.js';\nimport type {\n  ChronicleFacet,\n  ChronicleFacetResults,\n  ChronicleFacetValue,\n  ChronicleGraphResult,\n  ChronicleQuery,\n  ChronicleQueryResult,\n} from './query.js';\nimport type { ChronicleEvent, ChronicleEventInput } from './types.js';\n\nexport const CHRONICLE_PROJECT_SERVER_PROTOCOL_VERSION = 2;\nexport const CHRONICLE_PROJECT_SERVER_MAX_FRAME_CHARS = 64 * 1024 * 1024;\n\nexport interface ChronicleProjectServerInfo {\n  protocolVersion: number;\n  pid: number;\n  projectRoot: string;\n  projectDir: string;\n  chronicleDirectory: string;\n  endpoint: string;\n  startedAt: string;\n}\n\nexport interface ChronicleProjectServerHealth extends ChronicleProjectServerInfo {\n  checkedAt: number;\n  uptimeMs: number;\n  clients: number;\n  activeRequests: number;\n  journal: ChronicleJournalStats;\n  watcher: {\n    active: boolean;\n    watchedFiles: number;\n    lastError?: string | undefined;\n  };\n  /**\n   * Day families the legacy JSONL import refused to move for a broken chain.\n   *\n   * Present and non-empty means the journal has a known hole: those days were\n   * never imported and never will be. Health surfaces it as degraded rather\n   * than healthy \u2014 a store that silently serves an incomplete audit record is\n   * worse than one that says which day is missing.\n   */\n  quarantinedFamilies?: Array<{ day: string; sequence: number; reason: string }> | undefined;\n  memory: {\n    rss: number;\n    heapUsed: number;\n    heapTotal: number;\n    external: number;\n  };\n}\n\nexport type ChronicleMetricsView = 'summary' | 'providers' | 'tasks' | 'files';\n\nexport interface ChronicleMetricsRequest {\n  view: ChronicleMetricsView;\n  /**\n   * When false, serve the current derived projection immediately and refresh\n   * it in the background. Latency-sensitive enrichment must not wait for a\n   * multi-GB historical backlog to be indexed.\n   */\n  refresh?: boolean;\n  providers?: { from?: string; to?: string };\n  tasks?: {\n    runId?: string;\n    boardId?: string;\n    sessionId?: string;\n    status?: string;\n    limit?: number;\n  };\n  files?: {\n    path?: string;\n    paths?: string[];\n    latestPerPath?: boolean;\n    taskId?: string;\n    boardId?: string;\n    sessionId?: string;\n    limit?: number;\n  };\n}\n\nexport interface ChronicleMetricsResponse {\n  refreshed: ChronicleMetricsRefreshResult;\n  data: unknown;\n}\n\nexport interface ChronicleServerOperations {\n  ping: { args: Record<string, never>; result: ChronicleProjectServerHealth };\n  append: { args: { inputs: ChronicleEventInput[] }; result: ChronicleEvent[] };\n  flush: { args: Record<string, never>; result: void };\n  purge: {\n    args: { retentionDays: number; dryRun?: boolean };\n    result: ChroniclePurgeResult;\n  };\n  query: { args: { query: ChronicleQuery }; result: ChronicleQueryResult };\n  facet: {\n    args: { field: ChronicleFacet; query: ChronicleQuery; limit?: number | undefined };\n    result: {\n      values: ChronicleFacetValue[];\n      diagnostics: { sourceFiles: number; invalidLines: number };\n    };\n  };\n  facets: {\n    args: { fields: ChronicleFacet[]; query: ChronicleQuery; limit?: number | undefined };\n    result: {\n      values: ChronicleFacetResults;\n      diagnostics: { sourceFiles: number; invalidLines: number };\n    };\n  };\n  graph: {\n    args: { seed: ChronicleQuery; hops?: number | undefined; maxNodes?: number | undefined };\n    result: ChronicleGraphResult;\n  };\n  metrics: { args: ChronicleMetricsRequest; result: ChronicleMetricsResponse };\n}\n\nexport type ChronicleServerOperationName = keyof ChronicleServerOperations;\n\nexport type ChronicleProjectServerClientMessage =\n  | {\n      type: 'request';\n      id: number;\n      op: ChronicleServerOperationName;\n      args: unknown;\n    }\n  | { type: 'shutdown'; id: number; reason?: string | undefined };\n\nexport type ChronicleProjectServerMessage =\n  | ({ type: 'hello' } & ChronicleProjectServerInfo)\n  | { type: 'response'; id: number; ok: true; result: unknown }\n  | {\n      type: 'response';\n      id: number;\n      ok: false;\n      error: string;\n      errorName?: string | undefined;\n    };\n\nexport function encodeChronicleProjectServerMessage(message: object): string {\n  return `${JSON.stringify(message)}\\n`;\n}\n", "/**\n * SQLite-backed Chronicle journal (phase 1 of `chronicle-sqlite-journal-v1`).\n *\n * Same durable contract as `ChronicleJournal`, different storage: events become\n * rows instead of lines in `<day>.events.jsonl` partitions. The tamper-evident\n * chain is unchanged and deliberately so \u2014 `sequence`, `previousHash` and\n * `hash` mean exactly what they mean in the JSONL journal, and the hash is\n * computed by the shared `event-hash.ts` so the two stores can never drift.\n *\n * Why the payload is stored verbatim: the `hash` preimage is the canonical\n * encoding of the event *minus* its own `hash`. Reconstructing an event from\n * projected columns and re-hashing it would silently depend on the column set\n * staying lossless forever. Storing `JSON.stringify(event)` and re-deriving the\n * preimage from the parsed payload keeps verification independent of the\n * projection \u2014 the columns are a read-path index, never the source of truth.\n *\n * Only the project daemon opens this database, after it has won the endpoint\n * election, so the writer is single by construction and `BEGIN IMMEDIATE` is\n * enough. See `packages/core/tests/architecture/project-daemon-boundary.test.ts`.\n */\nimport { randomUUID } from 'node:crypto';\nimport { createRequire } from 'node:module';\nimport * as path from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport { withSqliteExperimentalWarningSuppressed } from '../utils/index.js';\nimport { chronicleEventHash, GENESIS_HASH, hashValue } from './event-hash.js';\nimport type { ChronicleJournalStats, ChroniclePurgeResult } from './journal.js';\nimport {\n  ChronicleSqliteQueryEngine,\n  type ChronicleSqliteQueryEngineOptions,\n} from './sqlite-query.js';\nimport {\n  CHRONICLE_SCHEMA_VERSION,\n  type ChronicleEvent,\n  type ChronicleEventInput,\n  type ChronicleVerifyResult,\n} from './types.js';\n\nexport const CHRONICLE_SQLITE_FILE = 'chronicle.sqlite';\n\n/** Marker written once the legacy JSONL partitions have been imported. */\nexport const LEGACY_JSONL_MIGRATION_KEY = 'legacy-jsonl-v1';\n\n/** Day families the import refused to move, recorded so they are never retried silently. */\nexport const LEGACY_JSONL_QUARANTINE_KEY = 'legacy-jsonl-v1:quarantine';\n\nconst SCHEMA_VERSION = 1;\n\nexport interface ChronicleSqliteJournalOptions {\n  /** Directory holding the journal, i.e. `<projectDir>/chronicle`. */\n  directory: string;\n  now?: (() => Date) | undefined;\n  monotonicNow?: (() => bigint) | undefined;\n  idFactory?: (() => string) | undefined;\n}\n\nexport interface ChronicleSqlitePurgeOptions {\n  retentionDays: number;\n  dryRun?: boolean | undefined;\n}\n\ninterface ChainAnchor {\n  sequence: number;\n  hash: string;\n}\n\n/** A day family the import refused to move, and why. */\nexport interface ChronicleQuarantinedFamily {\n  day: string;\n  sequence: number;\n  reason: string;\n}\n\n/** Write surface handed to a legacy import; see {@link ChronicleSqliteJournal.runFamilyImport}. */\nexport interface ChronicleImportSink {\n  /**\n   * Store an event with its recorded `sequence`, `previousHash` and `hash`.\n   *\n   * The payload is re-serialized rather than copied byte-for-byte from the\n   * JSONL line, which is safe because the hash preimage is the *canonical*\n   * encoding derived from the parsed event (\u00A73.1 of the spec) \u2014 not the stored\n   * bytes. `JSON.parse` round-trips it exactly, so verification is unaffected.\n   */\n  insert(day: string, event: ChronicleEvent): void;\n  /** Carry a legacy day-family retention checkpoint over. */\n  checkpoint(day: string, sequence: number, hash: string): void;\n}\n\n// \u2500\u2500\u2500 node:sqlite lazy loader (mirrors metrics-store.ts) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nlet Ctor: typeof DatabaseSync | null | undefined;\n\nfunction loadDatabaseSync(): typeof DatabaseSync {\n  if (Ctor) return Ctor;\n  if (Ctor === null) throw new Error('node:sqlite is unavailable in this runtime');\n  try {\n    Ctor = withSqliteExperimentalWarningSuppressed(\n      () =>\n        (createRequire(import.meta.url)('node:sqlite') as typeof import('node:sqlite')).DatabaseSync,\n    );\n    return Ctor;\n  } catch (error) {\n    Ctor = null;\n    throw new Error(\n      \"The Chronicle journal needs Node's built-in SQLite (node:sqlite, Node >= 22.5): \" +\n        (error instanceof Error ? error.message : String(error)),\n    );\n  }\n}\n\n// \u2500\u2500\u2500 Store \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport class ChronicleSqliteJournal {\n  private readonly db: DatabaseSync;\n  private readonly dbPath: string;\n  private readonly now: () => Date;\n  private readonly monotonicNow: () => bigint;\n  private readonly idFactory: () => string;\n\n  /**\n   * Cached chain head per day. Cleared wholesale on any write failure so the\n   * next append rebuilds from the database rather than trusting a counter that\n   * may have advanced past what actually committed.\n   */\n  private readonly anchors = new Map<string, ChainAnchor>();\n\n  private readonly counters = {\n    acceptedEvents: 0,\n    persistedEvents: 0,\n    rejectedEvents: 0,\n    failedEvents: 0,\n    batches: 0,\n    maxObservedPending: 0,\n    largestBatch: 0,\n  };\n  private lastBatchDurationMs: number | undefined;\n\n  constructor(options: ChronicleSqliteJournalOptions) {\n    this.dbPath = path.join(path.resolve(options.directory), CHRONICLE_SQLITE_FILE);\n    this.now = options.now ?? (() => new Date());\n    this.monotonicNow = options.monotonicNow ?? (() => process.hrtime.bigint());\n    this.idFactory = options.idFactory ?? (() => randomUUID());\n    const Database = loadDatabaseSync();\n    this.db = new Database(this.dbPath);\n    this.db.exec('PRAGMA journal_mode = WAL');\n    this.ensureSchema();\n  }\n\n  close(): void {\n    this.db.close();\n  }\n\n  stats(): ChronicleJournalStats {\n    return {\n      ...this.counters,\n      pendingEvents: 0,\n      // Retained at zero for wire compatibility: partitions do not exist here,\n      // but `ChronicleJournalStats` is part of the IPC health payload.\n      partitionRolls: 0,\n      ...(this.lastBatchDurationMs !== undefined\n        ? { lastBatchDurationMs: this.lastBatchDurationMs }\n        : {}),\n    };\n  }\n\n  /**\n   * Writes are synchronous and transactional, so there is nothing buffered to\n   * flush. Kept to satisfy `ChronicleEventSink`.\n   */\n  async flush(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  async append(input: ChronicleEventInput): Promise<ChronicleEvent> {\n    const [event] = await this.appendBatch([input]);\n    // appendBatch either returns one event per input or throws.\n    return event as ChronicleEvent;\n  }\n\n  /**\n   * Append a batch as one transaction.\n   *\n   * The chain is computed in memory from a single anchor, so a partially\n   * applied batch would leave a hole in `sequence` that verification can never\n   * reconcile. Rollback plus anchor invalidation is what prevents that.\n   */\n  async appendBatch(inputs: readonly ChronicleEventInput[]): Promise<ChronicleEvent[]> {\n    if (inputs.length === 0) return [];\n    const started = performance.now();\n    this.counters.acceptedEvents += inputs.length;\n    this.counters.batches += 1;\n    this.counters.largestBatch = Math.max(this.counters.largestBatch, inputs.length);\n\n    const instant = this.now().toISOString();\n    // The chain scope is the wall-clock day of the append, matching the file\n    // `journalForToday()` would have opened \u2014 not the event's `occurredAt`,\n    // which a caller may back-date.\n    const day = instant.slice(0, 10);\n    const events: ChronicleEvent[] = [];\n    let previous = this.readAnchor(day);\n\n    for (const input of inputs) {\n      const unhashed = {\n        ...input,\n        occurredAt: input.occurredAt ?? instant,\n        monotonicNs: input.monotonicNs ?? this.monotonicNow().toString(),\n        schemaVersion: CHRONICLE_SCHEMA_VERSION,\n        eventId: this.idFactory(),\n        observedAt: instant,\n        persistedAt: instant,\n        sequence: previous.sequence + 1,\n        previousHash: previous.hash,\n      };\n      const event: ChronicleEvent = { ...unhashed, hash: hashValue(unhashed) };\n      events.push(event);\n      previous = { sequence: event.sequence, hash: event.hash };\n    }\n\n    try {\n      this.db.exec('BEGIN IMMEDIATE');\n      const insert = this.db.prepare(\n        `INSERT INTO events (\n           day, sequence, event_id, hash, previous_hash, occurred_at, event_type, outcome,\n           project_id, session_id, agent_id, task_id, trace_id, logical_request_id,\n           resource_kind, resource_id, resource_path, duration_ns, payload\n         ) VALUES (?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?)`,\n      );\n      for (const event of events) {\n        const row = projectEvent(event);\n        insert.run(\n          day,\n          event.sequence,\n          event.eventId,\n          event.hash,\n          event.previousHash,\n          row.occurredAt,\n          event.eventType,\n          row.outcome,\n          row.projectId,\n          row.sessionId,\n          row.agentId,\n          row.taskId,\n          row.traceId,\n          row.logicalRequestId,\n          row.resourceKind,\n          row.resourceId,\n          row.resourcePath,\n          row.durationNs,\n          JSON.stringify(event),\n        );\n      }\n      this.db.exec('COMMIT');\n    } catch (error) {\n      try {\n        this.db.exec('ROLLBACK');\n      } catch {\n        // A failed BEGIN leaves no transaction to roll back.\n      }\n      this.anchors.clear();\n      this.counters.failedEvents += inputs.length;\n      this.lastBatchDurationMs = performance.now() - started;\n      throw error;\n    }\n\n    this.anchors.set(day, previous);\n    this.counters.persistedEvents += events.length;\n    this.lastBatchDurationMs = performance.now() - started;\n    return events;\n  }\n\n  async readAll(): Promise<ChronicleEvent[]> {\n    const rows = this.db\n      .prepare('SELECT payload FROM events ORDER BY day, sequence')\n      .all() as Array<{ payload: string }>;\n    return rows.map((row) => JSON.parse(row.payload) as ChronicleEvent);\n  }\n\n  /**\n   * Walk every chain and prove none has been edited.\n   *\n   * Chronicle chains are scoped to a day, not to the journal: the JSONL writer\n   * anchors each `<day>.events.jsonl` family at `GENESIS_HASH` independently,\n   * so `sequence` restarts at 1 every day. Verification mirrors that \u2014 each day\n   * is validated on its own, and a break in one does not implicate the others.\n   *\n   * Three independent properties per day, because each catches a different\n   * failure: a dense `sequence` catches deletions from the middle, the\n   * `previousHash` link catches reordering, and re-hashing the payload catches\n   * an in-place edit that left the links intact.\n   */\n  async verify(): Promise<ChronicleVerifyResult> {\n    let entries = 0;\n    let lastSequence = 0;\n    let lastHash = GENESIS_HASH;\n\n    for (const day of this.days()) {\n      const checkpoint = this.readCheckpoint(day);\n      let expectedSequence = (checkpoint?.sequence ?? 0) + 1;\n      let previousHash = checkpoint?.hash ?? GENESIS_HASH;\n\n      const rows = this.db\n        .prepare(\n          'SELECT sequence, hash, previous_hash, payload FROM events WHERE day = ? ORDER BY sequence',\n        )\n        .all(day) as Array<{\n        sequence: number;\n        hash: string;\n        previous_hash: string;\n        payload: string;\n      }>;\n\n      for (const row of rows) {\n        if (row.sequence !== expectedSequence) {\n          return {\n            ok: false,\n            entries,\n            brokenAt: entries,\n            reason: `sequence gap in ${day}: expected ${expectedSequence}, found ${row.sequence}`,\n          };\n        }\n        if (row.previous_hash !== previousHash) {\n          return { ok: false, entries, brokenAt: entries, reason: 'previous hash mismatch' };\n        }\n        let event: ChronicleEvent;\n        try {\n          event = JSON.parse(row.payload) as ChronicleEvent;\n        } catch {\n          return { ok: false, entries, brokenAt: entries, reason: 'invalid payload JSON' };\n        }\n        if (chronicleEventHash(event) !== row.hash) {\n          return { ok: false, entries, brokenAt: entries, reason: 'entry hash mismatch' };\n        }\n        entries += 1;\n        expectedSequence = row.sequence + 1;\n        previousHash = row.hash;\n      }\n\n      lastSequence = expectedSequence - 1;\n      lastHash = previousHash;\n    }\n\n    return { ok: true, entries, lastSequence, lastHash };\n  }\n\n  /**\n   * Drop events older than the retention window.\n   *\n   * Retention is day-granular and chains are day-scoped, so a purge removes\n   * whole chains rather than truncating one. That is why nothing needs to be\n   * checkpointed here: there is no surviving suffix left dangling without an\n   * anchor. Any checkpoint imported from a partially-purged legacy day family\n   * is dropped alongside its events.\n   */\n  async purge(options: ChronicleSqlitePurgeOptions): Promise<ChroniclePurgeResult> {\n    const empty: ChroniclePurgeResult = {\n      deletedCount: 0,\n      deletedBytes: 0,\n      skippedCount: 0,\n      errors: [],\n    };\n    if (!Number.isFinite(options.retentionDays) || options.retentionDays <= 0) return empty;\n\n    const cutoff = new Date(this.now().getTime() - options.retentionDays * 86_400_000)\n      .toISOString()\n      .slice(0, 10);\n\n    const count = (\n      this.db.prepare('SELECT COUNT(*) AS n FROM events WHERE day < ?').get(cutoff) as {\n        n: number;\n      }\n    ).n;\n    if (count === 0) return empty;\n\n    if (options.dryRun) {\n      const days = this.db\n        .prepare('SELECT DISTINCT day FROM events WHERE day < ? ORDER BY day')\n        .all(cutoff) as Array<{ day: string }>;\n      return { ...empty, deletedCount: count, candidates: days.map((row) => row.day) };\n    }\n\n    try {\n      this.db.exec('BEGIN IMMEDIATE');\n      this.db.prepare('DELETE FROM events WHERE day < ?').run(cutoff);\n      this.db.prepare('DELETE FROM chain_checkpoint WHERE day < ?').run(cutoff);\n      this.db.exec('COMMIT');\n    } catch (error) {\n      try {\n        this.db.exec('ROLLBACK');\n      } catch {\n        // Nothing to unwind.\n      }\n      return {\n        ...empty,\n        errors: [\n          {\n            file: this.dbPath,\n            reason: error instanceof Error ? error.message : String(error),\n          },\n        ],\n      };\n    }\n\n    this.anchors.clear();\n    return { ...empty, deletedCount: count };\n  }\n\n  /**\n   * Run one day family's legacy import inside its own transaction.\n   *\n   * Deliberately separate from `appendBatch`: the append path *computes*\n   * `sequence`, `previousHash` and `hash`, while an import must carry them over\n   * untouched. Fusing the two would put a code path one refactor away from\n   * re-hashing historical events, which is the one change that silently\n   * destroys their tamper evidence.\n   *\n   * The transaction is scoped to a single family because chains are: `sequence`\n   * restarts at 1 each day, so one day's break says nothing about the next\n   * day's integrity. A whole-journal transaction made every future day hostage\n   * to the worst day on disk \u2014 one corrupt family and the daemon could never\n   * open its store again. The family is still all-or-nothing: a break rolls\n   * back that day entirely, so no partial chain is ever visible.\n   */\n  async runFamilyImport(load: (sink: ChronicleImportSink) => Promise<void>): Promise<void> {\n    const insert = this.db.prepare(\n      `INSERT INTO events (\n         day, sequence, event_id, hash, previous_hash, occurred_at, event_type, outcome,\n         project_id, session_id, agent_id, task_id, trace_id, logical_request_id,\n         resource_kind, resource_id, resource_path, duration_ns, payload\n       ) VALUES (?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?)`,\n    );\n    const checkpoint = this.db.prepare(\n      `INSERT INTO chain_checkpoint (day, sequence, hash) VALUES (?, ?, ?)\n         ON CONFLICT(day) DO UPDATE SET sequence = excluded.sequence, hash = excluded.hash`,\n    );\n\n    this.db.exec('BEGIN IMMEDIATE');\n    try {\n      await load({\n        insert: (day, event) => {\n          const row = projectEvent(event);\n          insert.run(\n            day,\n            event.sequence,\n            event.eventId,\n            event.hash,\n            event.previousHash,\n            row.occurredAt,\n            event.eventType,\n            row.outcome,\n            row.projectId,\n            row.sessionId,\n            row.agentId,\n            row.taskId,\n            row.traceId,\n            row.logicalRequestId,\n            row.resourceKind,\n            row.resourceId,\n            row.resourcePath,\n            row.durationNs,\n            JSON.stringify(event),\n          );\n        },\n        checkpoint: (day, sequence, hash) => {\n          checkpoint.run(day, sequence, hash);\n        },\n      });\n      this.db.exec('COMMIT');\n    } catch (error) {\n      try {\n        this.db.exec('ROLLBACK');\n      } catch {\n        // Nothing to unwind.\n      }\n      throw error;\n    } finally {\n      this.anchors.clear();\n    }\n  }\n\n  /**\n   * A read engine over this journal's own connection.\n   *\n   * Sharing the connection rather than opening a second one keeps the\n   * single-writer guarantee intact and means a reader can never observe a\n   * half-applied batch: SQLite serialises statements on one handle.\n   */\n  queryEngine(options?: ChronicleSqliteQueryEngineOptions): ChronicleSqliteQueryEngine {\n    return new ChronicleSqliteQueryEngine(this.db, options);\n  }\n\n  /** Has the legacy JSONL import already run? */\n  hasImportedLegacyJournal(): boolean {\n    return this.readMeta(LEGACY_JSONL_MIGRATION_KEY) !== undefined;\n  }\n\n  markLegacyJournalImported(): void {\n    this.db\n      .prepare(\n        `INSERT INTO chronicle_meta (key, value) VALUES (?, 'done')\n           ON CONFLICT(key) DO UPDATE SET value = 'done'`,\n      )\n      .run(LEGACY_JSONL_MIGRATION_KEY);\n  }\n\n  /**\n   * Record the day families the import refused to move.\n   *\n   * Persisted rather than merely logged because the import runs once: after the\n   * marker is set nothing re-reads the JSONL, so this row is the only surviving\n   * evidence that a day was dropped. Health reports read it back to say\n   * \"degraded, and here is exactly what is missing\" instead of quietly serving\n   * a journal with a hole in it.\n   */\n  recordQuarantinedFamilies(families: readonly ChronicleQuarantinedFamily[]): void {\n    if (families.length === 0) return;\n    this.db\n      .prepare(\n        `INSERT INTO chronicle_meta (key, value) VALUES (?, ?)\n           ON CONFLICT(key) DO UPDATE SET value = excluded.value`,\n      )\n      .run(LEGACY_JSONL_QUARANTINE_KEY, JSON.stringify(families));\n  }\n\n  /**\n   * Does this day already hold rows?\n   *\n   * Each family commits on its own, so an import interrupted between families\n   * leaves a database that is complete for the days it reached. `(day,\n   * sequence)` is the primary key, so re-inserting one of those days would\n   * abort on a constraint violation rather than start over \u2014 this is what lets\n   * the next run resume at the first day it never got to.\n   */\n  hasImportedDay(day: string): boolean {\n    const row = this.db.prepare('SELECT 1 AS present FROM events WHERE day = ? LIMIT 1').get(day) as\n      | { present: number }\n      | undefined;\n    return row !== undefined;\n  }\n\n  /** Day families the legacy import refused to move, oldest first. */\n  quarantinedFamilies(): ChronicleQuarantinedFamily[] {\n    const raw = this.readMeta(LEGACY_JSONL_QUARANTINE_KEY);\n    if (!raw) return [];\n    try {\n      const parsed: unknown = JSON.parse(raw);\n      return Array.isArray(parsed) ? (parsed as ChronicleQuarantinedFamily[]) : [];\n    } catch {\n      return [];\n    }\n  }\n\n  // \u2500\u2500\u2500 internals \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n  private readMeta(key: string): string | undefined {\n    const row = this.db.prepare('SELECT value FROM chronicle_meta WHERE key = ?').get(key) as\n      | { value: string }\n      | undefined;\n    return row?.value;\n  }\n\n  private readCheckpoint(day: string): ChainAnchor | undefined {\n    return this.db.prepare('SELECT sequence, hash FROM chain_checkpoint WHERE day = ?').get(day) as\n      | ChainAnchor\n      | undefined;\n  }\n\n  /** Days that currently hold at least one event, oldest first. */\n  private days(): string[] {\n    const rows = this.db.prepare('SELECT DISTINCT day FROM events ORDER BY day').all() as Array<{\n      day: string;\n    }>;\n    return rows.map((row) => row.day);\n  }\n\n  /**\n   * Resolve the chain head, in the same precedence the JSONL journal uses: the\n   * newest event, else the retention checkpoint (every event before it was\n   * purged), else genesis.\n   */\n  private readAnchor(day: string): ChainAnchor {\n    const cached = this.anchors.get(day);\n    if (cached) return cached;\n    const last = this.db\n      .prepare('SELECT sequence, hash FROM events WHERE day = ? ORDER BY sequence DESC LIMIT 1')\n      .get(day) as ChainAnchor | undefined;\n    const anchor = last ?? this.readCheckpoint(day) ?? { sequence: 0, hash: GENESIS_HASH };\n    this.anchors.set(day, anchor);\n    return anchor;\n  }\n\n  private ensureSchema(): void {\n    const version = (this.db.prepare('PRAGMA user_version').get() as { user_version: number })\n      .user_version;\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS events (\n        day                TEXT NOT NULL,\n        sequence           INTEGER NOT NULL,\n        event_id           TEXT NOT NULL UNIQUE,\n        hash               TEXT NOT NULL,\n        previous_hash      TEXT NOT NULL,\n        occurred_at        TEXT NOT NULL,\n        event_type         TEXT NOT NULL,\n        outcome            TEXT,\n        project_id         TEXT,\n        session_id         TEXT,\n        agent_id           TEXT,\n        task_id            TEXT,\n        trace_id           TEXT,\n        logical_request_id TEXT,\n        resource_kind      TEXT,\n        resource_id        TEXT,\n        resource_path      TEXT,\n        duration_ns        TEXT,\n        payload            TEXT NOT NULL,\n        PRIMARY KEY (day, sequence)\n      );\n      CREATE INDEX IF NOT EXISTS events_occurred_at ON events(occurred_at);\n      CREATE INDEX IF NOT EXISTS events_type_outcome ON events(event_type, outcome);\n      CREATE INDEX IF NOT EXISTS events_session ON events(session_id, day, sequence);\n      CREATE INDEX IF NOT EXISTS events_trace ON events(trace_id);\n      CREATE INDEX IF NOT EXISTS events_logical_request ON events(logical_request_id);\n      CREATE INDEX IF NOT EXISTS events_resource_path ON events(resource_path);\n\n      CREATE TABLE IF NOT EXISTS chain_checkpoint (\n        day      TEXT PRIMARY KEY,\n        sequence INTEGER NOT NULL,\n        hash     TEXT NOT NULL\n      );\n\n      CREATE TABLE IF NOT EXISTS chronicle_meta (\n        key   TEXT PRIMARY KEY,\n        value TEXT NOT NULL\n      );\n    `);\n    if (version !== SCHEMA_VERSION) {\n      this.db.exec(`PRAGMA user_version = ${SCHEMA_VERSION}`);\n    }\n  }\n}\n\ninterface ProjectedRow {\n  occurredAt: string;\n  outcome: string | null;\n  projectId: string | null;\n  sessionId: string | null;\n  agentId: string | null;\n  taskId: string | null;\n  traceId: string | null;\n  logicalRequestId: string | null;\n  resourceKind: string | null;\n  resourceId: string | null;\n  resourcePath: string | null;\n  durationNs: string | null;\n}\n\n/**\n * Derive the indexed columns from an event.\n *\n * Every value here is recoverable from `payload`; nothing is stored only in a\n * column. That is what lets the projection change in a later release without\n * touching a single stored hash.\n *\n * `day` is deliberately absent: it is the chain scope, not a projection. The\n * legacy writer picks it from the wall clock when the batch is appended (see\n * `journalForToday`), so an event carrying a back-dated `occurredAt` still\n * belongs to the chain of the day it was written on.\n */\nfunction projectEvent(event: ChronicleEvent): ProjectedRow {\n  const occurredAt = event.occurredAt ?? event.observedAt;\n  return {\n    occurredAt,\n    outcome: event.outcome ?? null,\n    projectId: event.scope.projectId ?? null,\n    sessionId: event.scope.sessionId ?? null,\n    agentId: event.scope.agentId ?? null,\n    taskId: event.scope.taskId ?? null,\n    traceId: event.correlation?.traceId ?? null,\n    logicalRequestId: event.correlation?.logicalRequestId ?? null,\n    resourceKind: event.resource?.kind ?? null,\n    resourceId: event.resource?.id ?? null,\n    resourcePath: event.resource?.path ?? null,\n    durationNs: event.durationNs ?? null,\n  };\n}\n", "/**\n * SQLite read path for Chronicle (phase 3 of `chronicle-sqlite-journal-v1`).\n *\n * The division of labour is the whole point of this file:\n *\n * - **SQL narrows.** Indexed columns turn \"parse every line of every partition\n *   that overlaps the range\" into an index seek. Only predicates that map\n *   cleanly onto a column are pushed down.\n * - **JavaScript decides.** The pushed-down predicate is a deliberate\n *   *superset*: every candidate row is parsed and then passed through the same\n *   `matches()` the JSONL engine uses. Nothing is filtered out by SQL that\n *   `matches()` would have kept.\n *\n * That split is what makes parity provable rather than hoped for. A SQL\n * re-expression of `ChronicleQuery` would have to restate tag/attribute\n * lookups, path normalisation and line-range containment, and each restatement\n * is a place where the two engines could silently disagree. Here they cannot\n * disagree about *which* events match \u2014 only about how fast the candidates are\n * found.\n *\n * The summary is built with the JSONL engine's own accumulator for the same\n * reason: family classification, `usage.*` paths, cost de-duplication and the\n * p95 are semantics, not arithmetic.\n */\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { ChronicleEvent } from './types.js';\nimport {\n  type ChronicleFacet,\n  type ChronicleFacetResults,\n  type ChronicleFacetValue,\n  type ChronicleGraphEdge,\n  type ChronicleGraphResult,\n  type ChronicleQuery,\n  type ChronicleQueryResult,\n  compareEvents,\n  createSummaryAccumulator,\n  facetValue,\n  finalizeSummary,\n  matches,\n  relationKeys,\n  updateSummary,\n} from './query.js';\n\n/** Hard ceiling mirroring `ChronicleQueryEngine.query`. */\nconst MAX_LIMIT = 10_000;\n\n/**\n * Keyset position in the `(day, sequence)` total order.\n *\n * Deliberately not interchangeable with the JSONL engine's cursor, which\n * encodes a snapshot of partition files. A cursor is opaque and belongs to the\n * engine that issued it; carrying one across would be meaningless.\n */\ninterface SqliteCursor {\n  day: string;\n  sequence: number;\n}\n\nfunction encodeCursor(cursor: SqliteCursor): string {\n  return Buffer.from(`${cursor.day}:${cursor.sequence}`, 'utf8').toString('base64url');\n}\n\nfunction decodeCursor(raw: string | undefined): SqliteCursor | undefined {\n  if (!raw) return undefined;\n  try {\n    const [day, sequence] = Buffer.from(raw, 'base64url').toString('utf8').split(':');\n    if (!day || sequence === undefined) return undefined;\n    const parsed = Number(sequence);\n    return Number.isSafeInteger(parsed) ? { day, sequence: parsed } : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\ninterface PushedDown {\n  clause: string;\n  params: (string | number)[];\n}\n\n/**\n * Translate the parts of a query that map onto indexed columns.\n *\n * Anything absent here is simply not narrowed \u2014 `matches()` still applies it.\n * Adding a predicate to this list is an optimization; forgetting one is not a\n * correctness bug. That asymmetry is intentional.\n */\nfunction pushDown(query: ChronicleQuery): PushedDown {\n  const clauses: string[] = [];\n  const params: (string | number)[] = [];\n\n  const eq = (column: string, value: string | undefined): void => {\n    if (value === undefined) return;\n    clauses.push(`${column} = ?`);\n    params.push(value);\n  };\n\n  eq('event_id', query.eventId);\n  eq('project_id', query.projectId);\n  eq('session_id', query.sessionId);\n  eq('agent_id', query.agentId);\n  eq('task_id', query.taskId);\n  eq('trace_id', query.traceId);\n  eq('logical_request_id', query.logicalRequestId);\n  eq('resource_kind', query.resourceKind);\n  eq('resource_id', query.resourceId);\n\n  if (query.eventTypes?.length) {\n    clauses.push(`event_type IN (${query.eventTypes.map(() => '?').join(',')})`);\n    params.push(...query.eventTypes);\n  }\n  if (query.outcomes?.length) {\n    clauses.push(`outcome IN (${query.outcomes.map(() => '?').join(',')})`);\n    params.push(...query.outcomes);\n  }\n  // `occurred_at` is an ISO-8601 UTC string, so lexicographic comparison is\n  // chronological \u2014 the same assumption `matches()` makes.\n  if (query.from) {\n    clauses.push('occurred_at >= ?');\n    params.push(query.from);\n  }\n  if (query.to) {\n    clauses.push('occurred_at <= ?');\n    params.push(query.to);\n  }\n\n  return { clause: clauses.length ? clauses.join(' AND ') : '1=1', params };\n}\n\nexport interface ChronicleSqliteQueryEngineOptions {\n  /** Rows pulled from SQLite per batch while streaming candidates. */\n  batchSize?: number | undefined;\n}\n\nexport class ChronicleSqliteQueryEngine {\n  readonly diagnostics = { sourceFiles: 1, invalidLines: 0 };\n  private readonly batchSize: number;\n\n  constructor(\n    private readonly db: DatabaseSync,\n    options: ChronicleSqliteQueryEngineOptions = {},\n  ) {\n    this.batchSize = Math.max(1, options.batchSize ?? 1_000);\n  }\n\n  async query(query: ChronicleQuery = {}): Promise<ChronicleQueryResult> {\n    const order = query.order ?? 'desc';\n    const limit = Math.max(1, Math.min(query.limit ?? 100, MAX_LIMIT));\n    const cursor = decodeCursor(query.cursor);\n    const pushed = pushDown(query);\n\n    const direction = order === 'asc' ? 'ASC' : 'DESC';\n    const comparison = order === 'asc' ? '>' : '<';\n    const keyset = cursor ? ` AND (day, sequence) ${comparison} (?, ?)` : '';\n    const sql =\n      `SELECT day, sequence, payload FROM events WHERE ${pushed.clause}${keyset}` +\n      ` ORDER BY day ${direction}, sequence ${direction} LIMIT ? OFFSET ?`;\n\n    const summary = createSummaryAccumulator();\n    const page: ChronicleEvent[] = [];\n    let total = 0;\n    let scannedEvents = 0;\n    let last: SqliteCursor | undefined;\n    let offset = 0;\n\n    // Every matching event feeds the summary, which is defined over the whole\n    // result set rather than the page (see `ChronicleSummary`). Candidates are\n    // streamed in batches so a wide query does not materialise the table.\n    for (;;) {\n      const params = [...pushed.params];\n      if (cursor) params.push(cursor.day, cursor.sequence);\n      params.push(this.batchSize, offset);\n      const rows = this.db.prepare(sql).all(...params) as Array<{\n        day: string;\n        sequence: number;\n        payload: string;\n      }>;\n      if (rows.length === 0) break;\n      offset += rows.length;\n\n      for (const row of rows) {\n        scannedEvents++;\n        let event: ChronicleEvent;\n        try {\n          event = JSON.parse(row.payload) as ChronicleEvent;\n        } catch {\n          this.diagnostics.invalidLines++;\n          continue;\n        }\n        if (!matches(event, query)) continue;\n        total++;\n        updateSummary(summary, event);\n        if (page.length < limit) {\n          page.push(event);\n          last = { day: row.day, sequence: row.sequence };\n        }\n      }\n      if (rows.length < this.batchSize) break;\n    }\n\n    // The JSONL engine returns the page in `compareEvents` order; keyset order\n    // is `(day, sequence)`, which can differ when events share a timestamp.\n    // Sorting here keeps both engines' pages identical.\n    page.sort((left, right) => compareEvents(left, right) * (order === 'asc' ? 1 : -1));\n\n    const result: ChronicleQueryResult = {\n      events: page,\n      total,\n      scannedEvents,\n      sourceFiles: this.diagnostics.sourceFiles,\n      invalidLines: this.diagnostics.invalidLines,\n      summary: finalizeSummary(summary),\n    };\n    if (total > page.length && last) {\n      return { ...result, nextCursor: encodeCursor(last) };\n    }\n    return result;\n  }\n\n  /**\n   * Value counts per facet field.\n   *\n   * Not a SQL `GROUP BY`: `facetValue()` reads fields that live inside the\n   * payload \u2014 provider, model, tool call, tag \u2014 so grouping in SQL would only\n   * work for the handful that happen to be columns and would need a second,\n   * divergent definition for the rest. The narrowing is still done by SQL; the\n   * counting uses the JSONL engine's own projection.\n   */\n  async facets(\n    fields: readonly ChronicleFacet[],\n    query: ChronicleQuery = {},\n    limit = 100,\n  ): Promise<ChronicleFacetResults> {\n    const uniqueFields = [...new Set(fields)];\n    if (uniqueFields.length === 0) return {};\n    const counts = new Map(uniqueFields.map((field) => [field, new Map<string, number>()]));\n\n    for (const event of this.eachMatch(query)) {\n      for (const field of uniqueFields) {\n        const value = facetValue(event, field);\n        if (value === undefined) continue;\n        const fieldCounts = counts.get(field);\n        fieldCounts?.set(value, (fieldCounts.get(value) ?? 0) + 1);\n      }\n    }\n\n    const result: ChronicleFacetResults = {};\n    for (const field of uniqueFields) {\n      result[field] = [...(counts.get(field) ?? new Map<string, number>())]\n        .map(([value, count]) => ({ value, count }))\n        // Ties broken by value so both engines agree on an otherwise arbitrary\n        // order \u2014 the same comparator `ChronicleQueryEngine.facets` uses.\n        .sort((left, right) => right.count - left.count || left.value.localeCompare(right.value))\n        .slice(0, Math.max(0, limit));\n    }\n    return result;\n  }\n\n  async facet(\n    field: ChronicleFacet,\n    query: ChronicleQuery = {},\n    limit = 100,\n  ): Promise<ChronicleFacetValue[]> {\n    return (await this.facets([field], query, limit))[field] ?? [];\n  }\n\n  /**\n   * Expand explicit and typed correlation edges around a seed set.\n   *\n   * The traversal is the JSONL engine's, moved onto rows: `relationKeys()`\n   * defines the edges, `compareEvents` orders the nodes, and each hop is\n   * another ordered pass. Order is load-bearing rather than cosmetic \u2014 both\n   * `maxNodes` truncations stop at whatever they reach first, so a differently\n   * ordered scan would return a different subgraph rather than the same one\n   * shuffled. `ORDER BY day, sequence` reproduces `comparePartitionPaths`\n   * (family, then rotation index) followed by line order within a partition.\n   */\n  async graph(\n    seed: ChronicleQuery = {},\n    hops = 2,\n    maxNodes = 1_000,\n  ): Promise<ChronicleGraphResult> {\n    const nodeLimit = Math.max(0, Math.floor(maxNodes));\n    const selected = new Map<string, ChronicleEvent>();\n    let seedCount = 0;\n\n    for (const event of this.eachMatch(seed)) {\n      seedCount++;\n      if (selected.size < nodeLimit) selected.set(event.eventId, event);\n    }\n\n    let frontier = [...selected.values()];\n    const depthLimit = Math.max(0, Math.min(hops, 10));\n    for (\n      let depth = 0;\n      depth < depthLimit && frontier.length > 0 && selected.size < nodeLimit;\n      depth++\n    ) {\n      const frontierKeys = new Set(\n        frontier.flatMap((event) => relationKeys(event).map((relation) => relation.key)),\n      );\n      const next: ChronicleEvent[] = [];\n      for (const event of this.eachMatch({})) {\n        if (selected.has(event.eventId)) continue;\n        if (!relationKeys(event).some((relation) => frontierKeys.has(relation.key))) continue;\n        selected.set(event.eventId, event);\n        next.push(event);\n        if (selected.size >= nodeLimit) break;\n      }\n      frontier = next;\n    }\n\n    const nodes = [...selected.values()].sort(compareEvents);\n    const byKey = new Map<string, ChronicleEvent[]>();\n    for (const node of nodes) {\n      for (const relation of relationKeys(node)) {\n        const related = byKey.get(relation.key) ?? [];\n        related.push(node);\n        byKey.set(relation.key, related);\n      }\n    }\n\n    const edges: ChronicleGraphEdge[] = [];\n    const seen = new Set<string>();\n    for (const node of nodes) {\n      for (const relation of relationKeys(node)) {\n        for (const candidate of byKey.get(relation.key) ?? []) {\n          if (candidate.eventId === node.eventId) continue;\n          const [from, to] =\n            compareEvents(node, candidate) <= 0 ? [node, candidate] : [candidate, node];\n          const id = `${from.eventId}:${to.eventId}:${relation.kind}`;\n          if (seen.has(id)) continue;\n          seen.add(id);\n          edges.push({\n            from: from.eventId,\n            to: to.eventId,\n            kind: relation.kind,\n            confidence: relation.confidence,\n          });\n        }\n      }\n    }\n\n    return {\n      nodes,\n      edges,\n      truncated: seedCount > nodeLimit || selected.size >= nodeLimit,\n    };\n  }\n\n  /** Every event satisfying `query`, pulled in batches so a wide scan stays bounded. */\n  private *eachMatch(query: ChronicleQuery): Generator<ChronicleEvent> {\n    const pushed = pushDown(query);\n    const sql =\n      `SELECT payload FROM events WHERE ${pushed.clause}` +\n      ' ORDER BY day, sequence LIMIT ? OFFSET ?';\n    let offset = 0;\n    for (;;) {\n      const rows = this.db.prepare(sql).all(...pushed.params, this.batchSize, offset) as Array<{\n        payload: string;\n      }>;\n      if (rows.length === 0) return;\n      offset += rows.length;\n      for (const row of rows) {\n        let event: ChronicleEvent;\n        try {\n          event = JSON.parse(row.payload) as ChronicleEvent;\n        } catch {\n          this.diagnostics.invalidLines++;\n          continue;\n        }\n        if (matches(event, query)) yield event;\n      }\n      if (rows.length < this.batchSize) return;\n    }\n  }\n}\n"],
-  "mappings": ";;;AASA,YAAYA,SAAQ;AACpB,YAAYC,UAAS;AACrB,YAAY,SAAS;AACrB,YAAYC,YAAU;;;ACStB,IAAI,iBAAiB;AAGd,SAAS,wBAA8B;AAC5C,mBAAiB;AACnB;;;AC1BA,SAAS,kBAAkB;AASpB,SAAS,uBACd,OACA,UAAkB,WAAW,GACX;AAClB,SAAO;AAAA,IACL,OAAO,EAAE,GAAG,MAAM;AAAA,IAClB,aAAa,EAAE,SAAS,QAAQ,WAAW,EAAE;AAAA,EAC/C;AACF;;;ACjBA,SAAS,kBAAkB;AAC3B,YAAY,SAAS;AACrB,YAAYC,WAAU;;;ACFtB,eAAsB,mBACpB,OACA,aACA,QACc;AACd,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,WAAW,CAAC;AACjD,QAAM,UAAU,IAAI,MAAS,MAAM,MAAM;AACzC,MAAI,OAAO;AAEX,iBAAe,SAAwB;AACrC,WAAO,MAAM;AACX,YAAM,QAAQ;AACd;AACA,UAAI,SAAS,MAAM,OAAQ;AAC3B,cAAQ,KAAK,IAAI,MAAM,OAAO,MAAM,KAAK,GAAQ,KAAK;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC;AACpF,QAAM,QAAQ,IAAI,OAAO;AACzB,SAAO;AACT;;;ACNA,YAAY,QAAQ;AACpB,YAAY,UAAU;AAwBtB,IAAM,eAAe,uBAAO,IAAI,iCAAiC;AACjE,IAAM,cAAc;AACpB,IAAI,CAAC,YAAY,YAAY,EAAG,aAAY,YAAY,IAAI,oBAAI,IAAI;AACpE,IAAM,WAAoC,YAAY,YAAY;AAElE,SAAS,YAAY,MAAsB;AACzC,QAAM,WAAgB,aAAQ,IAAI;AAClC,SAAO,QAAQ,aAAa,UAAU,SAAS,YAAY,IAAI;AACjE;AAUO,SAAS,iBACd,MACA,UACA,MAC0B;AAC1B,QAAM,MAAM,YAAY,IAAI;AAC5B,MAAI,QAAQ,SAAS,IAAI,GAAG;AAC5B,MAAI,CAAC,SAAS,MAAM,MAAM;AACxB,UAAM,cAAc,oBAAI,IAAgB;AACxC,UAAMC,WAAa;AAAA,MACZ,aAAQ,IAAI;AAAA,MACjB,EAAE,WAAW,MAAM,YAAY,MAAM;AAAA,MACrC,CAAC,WAAW,aAAa;AACvB,cAAM,QAA2B;AAAA,UAC/B,WAAW,cAAc,WAAW,WAAW;AAAA,UAC/C,UAAU,aAAa,OAAO,OAAO,OAAO,QAAQ;AAAA,QACtD;AACA,mBAAW,OAAO,aAAa;AAC7B,cAAI;AACF,gBAAI,SAAS,KAAK;AAAA,UACpB,SAAS,OAAO;AACd,gBAAI,UAAU,KAAK;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM,UAAsB,EAAE,SAAAA,UAAS,aAAa,MAAM,MAAM;AAChE,UAAM,SAAS,MAAY;AACzB,cAAQ,OAAO;AACf,UAAI,SAAS,IAAI,GAAG,MAAM,QAAS,UAAS,OAAO,GAAG;AAAA,IACxD;AACA,IAAAA,SAAQ,GAAG,SAAS,CAAC,UAAU;AAG7B,aAAO;AACP,iBAAW,OAAO,YAAa,KAAI,UAAU,KAAK;AAAA,IACpD,CAAC;AAGD,IAAAA,SAAQ,GAAG,SAAS,MAAM;AAC1B,aAAS,IAAI,KAAK,OAAO;AACzB,YAAQ;AAAA,EACV;AAEA,QAAM,SAAS;AACf,QAAM,aAAyB,EAAE,UAAU,SAAS,MAAM,QAAQ;AAClE,SAAO,YAAY,IAAI,UAAU;AAEjC,MAAI,SAAS;AACb,SAAO;AAAA,IACL,QAAQ;AACN,UAAI,OAAQ;AACZ,eAAS;AACT,aAAO,YAAY,OAAO,UAAU;AACpC,UAAI,OAAO,YAAY,SAAS,KAAK,CAAC,OAAO,MAAM;AACjD,eAAO,OAAO;AACd,YAAI,SAAS,IAAI,GAAG,MAAM,OAAQ,UAAS,OAAO,GAAG;AACrD,YAAI;AACF,iBAAO,QAAQ,MAAM;AAAA,QACvB,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;;;ACxGO,IAAM,2BAA8C,OAAO,OAAO;AAAA,EACvE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGM,IAAM,0BAA+C,IAAI,IAAI,wBAAwB;;;AH0B5F,IAAM,mBAAmB;AAAA,EACvB,GAAG;AAAA,EACH;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,wBAAwB;AAK9B,IAAM,sCAAsC;AAE5C,IAAM,4BAA4B;AAGlC,eAAsB,2BACpB,SACgC;AAChC,QAAM,OAAY,cAAQ,QAAQ,WAAW;AAC7C,QAAM,WAAW,IAAI,IAAI,QAAQ,uBAAuB,gBAAgB;AACxE,QAAM,gBAAgB,uBAAuB,MAAM,QAAQ,iBAAiB,CAAC,CAAC;AAC9E,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,eAAe,QAAQ,gBAAgB,IAAI,OAAO;AACxD,QAAM,SAAS,MAAM,YAAY,MAAM,UAAU,eAAe,cAAc,QAAQ,OAAO,GAC1F;AACH,QAAM,sBAAsB,oBAAI,IAAgC;AAChE,QAAM,mBAAmB,CAAC,SAA0C;AAClE,UAAM,WAAgB,iBAAW,KAAK,IAAI,IACjC,gBAAU,KAAK,IAAI,IACnB,cAAQ,MAAM,KAAK,IAAI;AAChC,UAAMC,YAAW,kBAAuB,eAAS,MAAM,QAAQ,CAAC;AAChE,QAAIA,UAAS,WAAW,KAAK,KAAK,WAAWA,WAAU,UAAU,aAAa,EAAG;AACjF,wBAAoB,IAAIA,WAAU;AAAA,MAChC,IAAI,KAAK,MAAM,KAAK,IAAI;AAAA,MACxB,WAAW,KAAK;AAAA,MAChB,UAAU,KAAK;AAAA,MACf,SAAS,KAAK;AAAA,MACd,WAAW,KAAK;AAAA,IAClB,CAAC;AAGD,QAAI,oBAAoB,OAAO,2BAA2B;AACxD,YAAM,WAAW,oBAAoB,OAAO;AAC5C,YAAM,OAAO,CAAC,GAAG,oBAAoB,KAAK,CAAC;AAC3C,eAAS,IAAI,GAAG,IAAI,YAAY,IAAI,KAAK,QAAQ,KAAK;AACpD,4BAAoB,OAAO,KAAK,CAAC,CAAE;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AACA,QAAM,kBAAkB,QAAQ,QAAQ,GAAG,iBAAiB,CAAC,UAAU;AACrE,QAAI,MAAM,MAAM,SAAS,kBAAkB,CAAC,MAAM,MAAM,KAAM;AAC9D,qBAAiB;AAAA,MACf,MAAM,MAAM,MAAM;AAAA,MAClB,WAAW,MAAM;AAAA,MACjB,UAAU,MAAM;AAAA,MAChB,SAAS,MAAM;AAAA,MACf,WAAW,MAAM;AAAA,IACnB,CAAC;AAAA,EACH,CAAC;AACD,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI;AACJ,MAAI,SAAS;AACb,MAAI,YAAkC;AACtC,QAAM,0BACJ,QAAQ,2BAA2B;AAGrC,MAAI,iBAAiB,KAAK,IAAI;AAC9B,MAAI;AAEJ,QAAM,eAAe,MAAY;AAC/B,QAAI,MAAO,cAAa,KAAK;AAC7B,YAAQ,WAAW,MAAM;AACvB,cAAQ;AACR,mBAAa;AAAA,IACf,GAAG,UAAU;AAAA,EACf;AAMA,QAAM,oBAAoB,MAAY;AACpC,QAAI,OAAQ;AACZ,UAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B,QAAI,SAAS,yBAAyB;AACpC,cAAQ,IAAI,GAAG;AACf,mBAAa;AACb;AAAA,IACF;AACA,QAAI,gBAAiB;AACrB,sBAAkB,WAAW,MAAM;AACjC,wBAAkB;AAClB,UAAI,OAAQ;AACZ,cAAQ,IAAI,GAAG;AACf,mBAAa;AAAA,IACf,GAAG,0BAA0B,KAAK;AAClC,QAAI,OAAO,gBAAgB,UAAU,WAAY,iBAAgB,MAAM;AAAA,EACzE;AAEA,QAAM,WAAW,CAAC,aAA2C;AAC3D,QAAI,OAAQ;AACZ,QAAI,aAAa,MAAM;AACrB,wBAAkB;AAClB;AAAA,IACF;AACA,UAAMA,YAAW,kBAAkB,OAAO,QAAQ,CAAC;AACnD,QAAI,CAACA,aAAY,WAAWA,WAAU,UAAU,aAAa,EAAG;AAChE,YAAQ,IAAIA,SAAQ;AACpB,iBAAa;AAAA,EACf;AAEA,QAAM,YAAY,OAAO,iBAA0C;AACjE,UAAM,gBAAgB,aAAa,SAAS,GAAG;AAC/C,QAAI,cAAe,kBAAiB,KAAK,IAAI;AAC7C,UAAM,WAAW,gBACb,MAAM,YAAY,MAAM,UAAU,eAAe,cAAc,QAAQ,SAAS,KAAK,IACrF;AAMJ,UAAM,cAAc,WAAW,UAAU,OAAO,SAAS,KAAK,IAAI,cAAc;AAAA,MAC9E,CAACA,cAAa,CAAC,WAAWA,WAAU,UAAU,aAAa;AAAA,IAC7D;AACA,UAAM,UAID,CAAC;AACN,eAAWA,aAAY,YAAY;AACjC,YAAM,SAAS,MAAM,IAAIA,SAAQ;AAOjC,YAAM,SAAS,UAAU,MAAM,IAAIA,SAAQ;AAC3C,YAAM,QACJ,WACC,UAAU,WACP,SACA,MAAM,YAAiB,WAAK,MAAMA,SAAQ,GAAG,YAAY;AAC/D,UAAI,gBAAgB,QAAQ,KAAK,EAAG;AACpC,cAAQ,KAAK,EAAE,UAAAA,WAAU,QAAQ,MAAM,CAAC;AAAA,IAC1C;AAKA,UAAM,UAAU,QAAQ,OAAO,CAAC,WAAW,OAAO,UAAU,CAAC,OAAO,KAAK;AACzE,UAAM,UAAU,QAAQ,OAAO,CAAC,WAAW,CAAC,OAAO,UAAU,OAAO,KAAK;AACzE,UAAM,WAAW,oBAAI,IAAY;AACjC,UAAM,gBAAiC,CAAC;AACxC,eAAW,QAAQ,SAAS;AAC1B,YAAM,QAAQ,QAAQ;AAAA,QACpB,CAAC,OACC,CAAC,SAAS,IAAI,GAAG,QAAQ,KACzB,KAAK,QAAQ,SAAS,UACtB,KAAK,OAAO,SAAS,GAAG,OAAO;AAAA,MACnC;AACA,UAAI,CAAC,MAAO;AACZ,eAAS,IAAI,KAAK,QAAQ;AAC1B,eAAS,IAAI,MAAM,QAAQ;AAC3B,YAAM,OAAO,KAAK,QAAQ;AAC1B,YAAM,IAAI,MAAM,UAAU,MAAM,KAAM;AACtC,oBAAc;AAAA,QACZ;AAAA,UACE;AAAA,UACA;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,UACN;AAAA,YACE,WAAW;AAAA,YACX,cAAc,KAAK;AAAA,YACnB,oBAAoB,WAAW,KAAK,QAAQ;AAAA,YAC5C,OAAO;AAAA,UACT;AAAA,UACA,oBAAoB,MAAM,UAAU,mBAAmB;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAEA,eAAW,UAAU,SAAS;AAC5B,UAAI,SAAS,IAAI,OAAO,QAAQ,EAAG;AACnC,UAAI,CAAC,OAAO,OAAO;AACjB,cAAM,OAAO,OAAO,QAAQ;AAC5B,sBAAc;AAAA,UACZ;AAAA,YACE;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP,OAAO;AAAA,YACP;AAAA,cACE,WAAW;AAAA,cACX,OAAO;AAAA,cACP,cAAc,OAAO,QAAQ;AAAA,cAC7B,cAAc,OAAO,QAAQ;AAAA,YAC/B;AAAA,YACA,oBAAoB,OAAO,UAAU,mBAAmB;AAAA,UAC1D;AAAA,QACF;AAAA,MACF,WAAW,CAAC,OAAO,QAAQ;AACzB,cAAM,IAAI,OAAO,UAAU,OAAO,KAAK;AACvC,sBAAc;AAAA,UACZ;AAAA,YACE;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP,OAAO;AAAA,YACP;AAAA,cACE,WAAW;AAAA,cACX,OAAO;AAAA,YACT;AAAA,YACA,oBAAoB,OAAO,UAAU,mBAAmB;AAAA,UAC1D;AAAA,QACF;AAAA,MACF,OAAO;AACL,cAAM,IAAI,OAAO,UAAU,OAAO,KAAK;AACvC,sBAAc;AAAA,UACZ;AAAA,YACE;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP,OAAO;AAAA,YACP;AAAA,cACE,WAAW;AAAA,cACX,OAAO;AAAA,cACP,cAAc,OAAO,OAAO;AAAA,cAC5B,cAAc,OAAO,OAAO;AAAA,YAC9B;AAAA,YACA,oBAAoB,OAAO,UAAU,mBAAmB;AAAA,UAC1D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM,QAAQ,IAAI,aAAa;AAAA,EACjC;AAEA,QAAM,eAAe,MAAqB;AACxC,QAAI,UAAW,QAAO;AACtB,UAAM,SAAS,YAAY;AACzB,aAAO,QAAQ,OAAO,GAAG;AACvB,cAAM,QAAQ,CAAC,GAAG,OAAO;AACzB,gBAAQ,MAAM;AACd,cAAM,UAAU,KAAK,EAAE,MAAM,CAAC,UAAU,QAAQ,UAAU,KAAK,CAAC;AAAA,MAClE;AAAA,IACF,GAAG,EAAE,QAAQ,MAAM;AACjB,UAAI,cAAc,MAAO,aAAY;AACrC,UAAI,CAAC,UAAU,QAAQ,OAAO,EAAG,cAAa;AAAA,IAChD,CAAC;AACD,gBAAY;AACZ,WAAO;AAAA,EACT;AAEA,MAAIC;AACJ,MAAI;AACF,IAAAA,WAAU,iBAAiB,MAAM,CAAC,UAAU,SAAS,MAAM,QAAQ,GAAG;AAAA,MACpE,SAAS,CAAC,UAAU,QAAQ,UAAU,KAAK;AAAA,IAC7C,CAAC;AAAA,EACH,SAAS,OAAO;AACd,YAAQ,UAAU,KAAK;AACvB,UAAM;AAAA,EACR;AAEA,SAAO;AAAA,IACL,IAAI,eAAe;AACjB,aAAO,MAAM;AAAA,IACf;AAAA,IACA;AAAA,IACA,MAAM,QAAQ;AACZ,UAAI,OAAQ;AACZ,eAAS;AACT,wBAAkB;AAClB,MAAAA,SAAQ,MAAM;AACd,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AACA,UAAI,iBAAiB;AACnB,qBAAa,eAAe;AAC5B,0BAAkB;AAAA,MACpB;AACA,UAAI,QAAQ,OAAO,EAAG,cAAa;AACnC,YAAM;AACN,0BAAoB,MAAM;AAAA,IAC5B;AAAA,EACF;AACF;AAEA,eAAe,eACb,SACA,WACA,cACA,OACA,YACA,aACe;AACf,QAAM,UAAU,OAAO,QAAQ,YAAY,aAAa,QAAQ,QAAQ,IAAI,QAAQ;AACpF,QAAM,YAAY,WAAW,WAAW;AACxC,UAAQ,QAAQ,KAAK,iBAAiB;AAAA,IACpC,UAAe,WAAK,QAAQ,aAAa,YAAY;AAAA,IACrD;AAAA,IACA,OAAO;AAAA,IACP,QAAQ,cAAc,SAAS;AAAA,IAC/B,IAAI,KAAK,IAAI;AAAA,IACb,WAAW,QAAQ,MAAM;AAAA,IACzB,SAAS,QAAQ,YAAY;AAAA,IAC7B,SAAS,aAAa,WAAW,QAAQ,MAAM;AAAA,IAC/C,GAAI,cAAc,EAAE,WAAW,YAAY,WAAW,UAAU,YAAY,SAAS,IAAI,CAAC;AAAA,EAC5F,CAAC;AACD,QAAM,QAA6B;AAAA,IACjC,WAAW,cAAc,UAAU,QAAQ,cAAc,QAAQ,IAAI;AAAA,IACrE,OAAO;AAAA,MACL,GAAG,QAAQ;AAAA,MACX,GAAI,aAAa,YAAY,EAAE,WAAW,YAAY,UAAU,IAAI,CAAC;AAAA,MACrE,GAAI,aAAa,UAAU,EAAE,SAAS,YAAY,QAAQ,IAAI,CAAC;AAAA,IACjE;AAAA,IACA,aAAa;AAAA,MACX,GAAG,QAAQ;AAAA,MACX,GAAI,cAAc,EAAE,YAAY,YAAY,UAAU,IAAI,CAAC;AAAA,IAC7D;AAAA,IACA,SAAS;AAAA,IACT,UAAU;AAAA,MACR,MAAM;AAAA,MACN,IAAI,WAAW,YAAY;AAAA,MAC3B,MAAM,kBAAkB,YAAY;AAAA,MACpC,GAAI,OAAO,OAAO,EAAE,kBAAkB,MAAM,KAAK,IAAI,CAAC;AAAA,IACxD;AAAA,IACA,YAAY;AAAA,MACV,GAAG;AAAA,MACH,OAAO,cAAc,UAAU,WAAW,OAAO;AAAA,MACjD,QAAQ,cAAc,SAAS;AAAA,MAC/B,UAAU,aAAa;AAAA,MACvB,MAAM,OAAO;AAAA,MACb,SAAS,OAAO;AAAA,MAChB,YAAY;AAAA,IACd;AAAA,EACF;AACA,QAAM,QAAQ,QAAQ,OAAO,KAAK;AACpC;AAEA,SAAS,oBACP,cACA,QACgC;AAChC,QAAM,QAAQ,OAAO,IAAI,YAAY;AACrC,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO,OAAO,YAAY;AAC1B,SAAO,KAAK,IAAI,IAAI,MAAM,MAAM,MAAQ,QAAQ;AAClD;AAEA,eAAe,YACb,MACA,UACA,eACA,cACA,SACA,UACqE;AACrE,QAAM,SAAS,oBAAI,IAA6B;AAChD,QAAM,OAAO,CAAC,EAAE;AAChB,MAAI,WAAW;AACf,SAAO,KAAK,SAAS,GAAG;AACtB,UAAM,cAAc,KAAK,IAAI;AAC7B,QAAI;AACF,YAAM,UAAU,MAAU,YAAa,WAAK,MAAM,WAAW,GAAG,EAAE,eAAe,KAAK,CAAC;AACvF,YAAM,YAAsB,CAAC;AAC7B,iBAAW,SAAS,SAAS;AAC3B,cAAMD,YAAW,kBAAuB,WAAK,aAAa,MAAM,IAAI,CAAC;AACrE,YAAI,WAAWA,WAAU,UAAU,aAAa,EAAG;AACnD,YAAI,MAAM,YAAY,GAAG;AACvB,eAAK,KAAKA,SAAQ;AAAA,QACpB,WAAW,MAAM,OAAO,GAAG;AACzB,oBAAU,KAAKA,SAAQ;AAAA,QACzB;AAAA,MACF;AACA,YAAM,eAAe,MAAM;AAAA,QACzB;AAAA,QACA;AAAA,QACA,OAAOA,cAAwD;AAC7D,cAAI;AACF,kBAAM,QAAQ,MAAM;AAAA,cACb,WAAK,MAAMA,SAAQ;AAAA,cACxB;AAAA,cACA,UAAU,IAAIA,SAAQ;AAAA,YACxB;AACA,mBAAO,QAAQ,CAACA,WAAU,KAAK,IAAI;AAAA,UACrC,SAAS,OAAO;AACd,uBAAW;AACX,sBAAU,KAAK;AACf,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,iBAAW,SAAS,cAAc;AAChC,YAAI,MAAO,QAAO,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,MAC1C;AAAA,IACF,SAAS,OAAO;AACd,iBAAW;AACX,gBAAU,KAAK;AAAA,IACjB;AAAA,EACF;AACA,SAAO,EAAE,OAAO,QAAQ,SAAS;AACnC;AAEA,eAAe,YACb,UACA,cACA,UACsC;AACtC,MAAI;AACF,UAAME,QAAO,MAAU,SAAK,QAAQ;AACpC,QAAI,CAACA,MAAK,OAAO,EAAG,QAAO;AAC3B,UAAM,OAAwB,EAAE,MAAMA,MAAK,MAAM,SAASA,MAAK,QAAQ;AAGvE,QACE,UAAU,SAAS,UACnB,SAAS,SAASA,MAAK,QACvB,SAAS,YAAYA,MAAK,SAC1B;AACA,WAAK,OAAO,SAAS;AACrB,aAAO;AAAA,IACT;AACA,QAAIA,MAAK,QAAQ,cAAc;AAC7B,WAAK,OAAO,WAAW,QAAQ,EAC5B,OAAO,MAAU,aAAS,QAAQ,CAAC,EACnC,OAAO,KAAK;AAAA,IACjB;AACA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,QAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,SAAS,MAAM,SAAS;AACnF,aAAO;AACT,UAAM;AAAA,EACR;AACF;AAEA,SAAS,gBAAgB,GAAgC,GAAyC;AAChG,MAAI,CAAC,KAAK,CAAC,EAAG,QAAO,MAAM;AAC3B,MAAI,EAAE,SAAS,UAAa,EAAE,SAAS,OAAW,QAAO,EAAE,SAAS,EAAE;AACtE,SAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE;AAC9C;AAEA,SAAS,WACPF,WACA,UACA,eACS;AACT,QAAM,aAAa,kBAAkBA,SAAQ;AAC7C,MAAI,WAAW,MAAM,GAAG,EAAE,KAAK,CAAC,YAAY,SAAS,IAAI,OAAO,CAAC,EAAG,QAAO;AAC3E,aAAW,UAAU,eAAe;AAClC,QAAI,eAAe,UAAU,WAAW,WAAW,GAAG,MAAM,GAAG,EAAG,QAAO;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,MAAc,QAAwC;AACpF,QAAM,SAAS,oBAAI,IAAY;AAC/B,aAAW,SAAS,QAAQ;AAC1B,UAAMA,YAAgB,iBAAW,KAAK,IAAS,eAAS,MAAW,cAAQ,KAAK,CAAC,IAAI;AACrF,UAAM,aAAa,kBAAkBA,SAAQ,EAAE,QAAQ,SAAS,EAAE;AAClE,QAAI,CAAC,cAAc,eAAe,OAAO,WAAW,WAAW,KAAK,EAAG;AACvE,WAAO,IAAI,UAAU;AAAA,EACvB;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAuB;AAChD,SAAO,MAAM,WAAW,MAAM,GAAG,EAAE,QAAQ,SAAS,EAAE;AACxD;AAEA,SAAS,WAAW,cAA8B;AAChD,SAAO,QAAQ,WAAW,QAAQ,EAAE,OAAO,kBAAkB,YAAY,CAAC,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,CAAC;AACxG;AAEA,SAAS,UAAU,GAAiC,GAA2C;AAC7F,SAAO,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAChD;;;AIriBA,SAAS,cAAAG,mBAAkB;AAC3B,YAAY,QAAQ;AACpB,YAAYC,WAAU;AA6Bf,SAAS,gCACd,OAC0B;AAC1B,QAAM,OAAO,MAAM,OAAO,oBAAI,KAAK,GAAG,YAAY,EAAE,MAAM,GAAG,EAAE;AAC/D,SAAO;AAAA,IACL,gBAAgB,SAAS,gBAAqB,cAAQ,MAAM,UAAU,CAAC;AAAA,IACvE,WAAW,SAAS,WAAW,GAAM,YAAS,CAAC,KAAQ,YAAS,CAAC,KAAQ,QAAK,CAAC,EAAE;AAAA,IACjF,WAAW,MAAM;AAAA,IACjB,oBAAyB,WAAK,MAAM,YAAY,WAAW;AAAA,IAC3D;AAAA,EACF;AACF;AAEA,SAAS,SAAS,QAAgB,OAAuB;AACvD,SAAO,GAAG,MAAM,IAAID,YAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,CAAC;AACnF;;;AC9CA,SAAS,cAAAE,mBAAkB;AAC3B,SAAS,wBAAwB;AACjC,YAAYC,SAAQ;AACpB,YAAYC,WAAU;AACtB,SAAS,uBAAuB;;;ACHhC;AAAA,EAEE;AAAA,OAEK;;;ACmBA,IAAM,cAAc;AAAA;AAAA,EAEzB,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,0BAA0B;AAAA,EAC1B,uBAAuB;AAAA,EACvB,wBAAwB;AAAA,EACxB,2BAA2B;AAAA;AAAA,EAE3B,gBAAgB;AAAA,EAChB,wBAAwB;AAAA,EACxB,uBAAuB;AAAA,EACvB,cAAc;AAAA,EACd,oBAAoB;AAAA;AAAA,EAEpB,gBAAgB;AAAA,EAChB,kBAAkB;AAAA,EAClB,qBAAqB;AAAA,EACrB,yBAAyB;AAAA;AAAA,EAEzB,oBAAoB;AAAA,EACpB,qBAAqB;AAAA,EACrB,2BAA2B;AAAA;AAAA,EAE3B,uBAAuB;AAAA,EACvB,wBAAwB;AAAA,EACxB,eAAe;AAAA,EACf,kBAAkB;AAAA;AAAA,EAElB,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,sBAAsB;AAAA;AAAA,EAEtB,+BAA+B;AAAA,EAC/B,2BAA2B;AAAA,EAC3B,+BAA+B;AAAA,EAC/B,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,kBAAkB;AAAA;AAAA,EAElB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,kBAAkB;AAAA,EAClB,wBAAwB;AAAA;AAAA,EAExB,uBAAuB;AAAA,EACvB,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,eAAe;AAAA;AAAA,EAEf,kBAAkB;AAAA,EAClB,cAAc;AAAA,EACd,SAAS;AACX;AAwBO,IAAM,kBAAN,cAA8B,MAAM;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,MAQT;AACD,UAAM,KAAK,SAAS,EAAE,OAAO,KAAK,MAAM,CAAC;AACzC,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK;AACjB,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW,KAAK,YAAY;AACjC,SAAK,cAAc,KAAK,eAAe;AACvC,SAAK,UAAU,KAAK;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAmB;AACjB,UAAM,MAAM,KAAK,UAAU,IAAI,cAAc,KAAK,OAAO,CAAC,KAAK;AAC/D,WAAO,GAAG,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG,GAAG;AAAA,EAC5C;AACF;AAEA,SAAS,cAAc,KAAsC;AAC3D,QAAM,QAAQ,OAAO,QAAQ,GAAG,EAC7B,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,MAAS,EACjC,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE;AACtC,SAAO,MAAM,SAAS,IAAI,IAAI,MAAM,KAAK,GAAG,CAAC,MAAM;AACrD;AAsMO,IAAM,UAAN,cAAsB,gBAAgB;AAAA,EAClC;AAAA,EAET,YAAY,MAST;AACD,UAAM;AAAA,MACJ,SAAS,KAAK;AAAA,MACd,MAAM,KAAK;AAAA,MACX,WAAW;AAAA,MACX,UAAU;AAAA,MACV,aAAa,KAAK,SAAS,YAAY;AAAA,MACvC,SAAS,EAAE,MAAM,KAAK,MAAM,GAAG,KAAK,QAAQ;AAAA,MAC5C,OAAO,KAAK;AAAA,IACd,CAAC;AACD,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK;AAAA,EACnB;AACF;;;ADrWA,IAAM,aAAa,4BAA4B;AAAA,EAC7C,wBAAwB,CAAC,EAAE,YAAY,UAAU,MAC/C,IAAI,QAAQ;AAAA,IACV,SAAS,oCAAoC,UAAU;AAAA,IACvD,MAAM;AAAA,IACN,MAAM;AAAA,IACN,SAAS,EAAE,UAAU;AAAA,EACvB,CAAC;AACL,CAAC;AAEM,IAAM,cAIQ,WAAW;AAMzB,IAAM,0BAIK,WAAW;AACtB,IAAM,YAA4C,WAAW;AAC7D,IAAM,eAIK,WAAW;;;AE3B7B,SAAS,cAAAC,mBAAkB;AAIpB,IAAM,eAAe,IAAI,OAAO,EAAE;AAUlC,SAAS,gBAAgB,OAAwB;AACtD,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,KAAK;AAC5E,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,IAAI,MAAM,IAAI,CAAC,SAAU,SAAS,SAAY,SAAS,gBAAgB,IAAI,CAAE,EAAE,KAAK,GAAG,CAAC;AAAA,EACjG;AACA,QAAM,MAAM;AACZ,SAAO,IAAI,OAAO,KAAK,GAAG,EACvB,KAAK,EACL,OAAO,CAAC,QAAQ,IAAI,GAAG,MAAM,MAAS,EACtC,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,CAAC,IAAI,gBAAgB,IAAI,GAAG,CAAC,CAAC,EAAE,EAClE,KAAK,GAAG,CAAC;AACd;AAEO,SAAS,UAAU,OAAwB;AAChD,SAAOA,YAAW,QAAQ,EAAE,OAAO,gBAAgB,KAAK,GAAG,MAAM,EAAE,OAAO,KAAK;AACjF;AAQO,SAAS,mBAAmB,OAA+B;AAChE,QAAM,EAAE,MAAM,OAAO,GAAG,SAAS,IAAI;AACrC,SAAO,UAAU,QAAQ;AAC3B;;;ACrDA,YAAYC,WAAU;AAGf,IAAM,yBAAyB;AAEtC,SAAS,gBAAgB,UAA0B;AACjD,QAAM,QAAQ,uBAAuB,KAAU,eAAS,QAAQ,CAAC;AACjE,SAAY,WAAU,cAAQ,QAAQ,GAAG,QAAQ,CAAC,KAAU,eAAS,QAAQ,CAAC;AAChF;AAEA,SAAS,kBAAkB,UAA0B;AACnD,QAAM,QAAQ,uBAAuB,KAAU,eAAS,QAAQ,CAAC;AACjE,SAAO,OAAO,QAAQ,CAAC,KAAK,CAAC;AAC/B;AAGO,SAAS,sBAAsB,MAAc,OAAuB;AACzE,QAAM,cAAc,gBAAgB,IAAI,EAAE,cAAc,gBAAgB,KAAK,CAAC;AAC9E,SAAO,eAAe,kBAAkB,IAAI,IAAI,kBAAkB,KAAK;AACzE;;;AClBO,IAAM,2BAA2B;;;ALcxC,IAAM,8BAA8B,MAAM,OAAO;AACjD,IAAM,6BAA6B,KAAK,KAAK;AAC7C,IAAM,+BAA+B;AAuC9B,IAAM,mBAAN,MAAuB;AAAA,EACX;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,UAA8H,CAAC;AAAA,EAC/H;AAAA,EACA,iBAAiB;AAAA,EACjB;AAAA,EACS,WAAW,EAAE,gBAAgB,GAAG,iBAAiB,GAAG,gBAAgB,GAAG,cAAc,GAAG,SAAS,GAAG,oBAAoB,GAAG,cAAc,GAAG,gBAAgB,EAAE;AAAA,EACvK;AAAA,EACA,iBAAiB;AAAA,EACjB;AAAA,EACA,qBAAqB;AAAA,EACrB,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,WAAmB;AAAA,EACnB,kBAAkB;AAAA,EAE1B,YAAY,SAAkC;AAC5C,SAAK,WAAgB,cAAQ,QAAQ,QAAQ;AAC7C,SAAK,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC1C,SAAK,eAAe,QAAQ,iBAAiB,MAAM,QAAQ,OAAO,OAAO;AACzE,SAAK,YAAY,QAAQ,aAAaC;AACtC,SAAK,aAAa,KAAK,IAAI,GAAG,QAAQ,cAAc,GAAO;AAC3D,SAAK,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC3D,SAAK,wBAAwB,QAAQ,yBAAyB;AAC9D,SAAK,mBAAmB,QAAQ,oBAAoB;AACpD,SAAK,gBAAgB,QAAQ,iBAAiB,OAAO,SAAS,QAAQ,aAAa,KAAK,QAAQ,gBAAgB,IAAI,QAAQ,gBAAgB;AAC5I,SAAK,sBAAsB,KAAK,IAAI,GAAG,QAAQ,uBAAuB,IAAS;AAC/E,SAAK,qBAAqB,KAAK,IAAI;AAAA,EACrC;AAAA,EAEA,IAAI,OAAe;AAAE,WAAO,KAAK,mBAAmB,IAAI,KAAK,WAAW,YAAY,KAAK,UAAU,KAAK,cAAc;AAAA,EAAG;AAAA,EAEzH,QAA+B;AAC7B,WAAO,EAAE,GAAG,KAAK,UAAU,eAAe,KAAK,QAAQ,QAAQ,GAAI,KAAK,wBAAwB,SAAY,EAAE,qBAAqB,KAAK,oBAAoB,IAAI,CAAC,EAAG;AAAA,EACtK;AAAA,EAEA,OAAO,OAAqD;AAC1D,QAAI,KAAK,QAAQ,UAAU,KAAK,YAAY;AAAE,WAAK,SAAS;AAAkB,aAAO,QAAQ,OAAO,IAAI,MAAM,yCAAyC,KAAK,UAAU,kBAAkB,CAAC;AAAA,IAAG;AAC5L,UAAM,UAAU,IAAI,QAAwB,CAACC,WAAS,WAAW;AAAE,WAAK,QAAQ,KAAK,EAAE,OAAO,SAAAA,WAAS,OAAO,CAAC;AAAA,IAAG,CAAC;AACnH,SAAK,SAAS;AACd,SAAK,SAAS,qBAAqB,KAAK,IAAI,KAAK,SAAS,oBAAoB,KAAK,QAAQ,MAAM;AACjG,SAAK,cAAc;AACnB,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAqC;AACzC,UAAM,KAAK,MAAM;AACjB,UAAM,QAAQ,MAAM,kBAAkB,KAAK,QAAQ;AACnD,UAAM,UAA4B,CAAC;AACnC,eAAW,QAAQ,MAAO,SAAQ,KAAK,GAAI,MAAM,kBAAkB,IAAI,CAAE;AACzE,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,QAAuB;AAC3B,QAAI,KAAK,YAAY;AAAE,mBAAa,KAAK,UAAU;AAAG,WAAK,aAAa;AAAW,WAAK,iBAAiB;AAAA,IAAO;AAChH,WAAO,KAAK,QAAQ,SAAS,KAAK,KAAK,cAAc;AACnD,UAAI,KAAK,QAAQ,SAAS,KAAK,CAAC,KAAK,aAAc,MAAK,WAAW;AACnE,YAAM,KAAK;AAAA,IACb;AAAA,EACF;AAAA,EAEA,MAAM,SAAyC;AAC7C,UAAM,KAAK,MAAM;AACjB,UAAM,QAAQ,MAAM,kBAAkB,KAAK,QAAQ;AACnD,UAAM,mBAAmB,MAAM,wBAAwB,KAAK,QAAQ;AACpE,QAAI,iBAAiB,MAAO,QAAO,EAAE,IAAI,OAAO,SAAS,GAAG,UAAU,GAAG,QAAQ,iBAAiB,MAAM;AACxG,WAAO,qBAAqB,OAAO,iBAAiB,UAAU;AAAA,EAChE;AAAA,EAEA,MAAM,MAAM,SAA+D;AACzE,UAAM,KAAK,MAAM;AACjB,QAAI,CAAC,OAAO,SAAS,QAAQ,aAAa,KAAK,QAAQ,iBAAiB,GAAG;AACzE,YAAM,IAAI,UAAU,0DAA0D;AAAA,IAChF;AACA,UAAM,KAAK,qBAAqB;AAChC,UAAM,SAAS,KAAK,IAAI,IAAI,QAAQ,gBAAgB;AACpD,UAAM,aAAkB,cAAQ,KAAK,IAAI;AACzC,UAAM,SAAyC,CAAC;AAChD,QAAI,KAAK,GAAG,KAAK,GAAG,KAAK;AACzB,UAAM,gBAAgB,QAAQ,UAAU,SACpC,MAAM,yBAAyB,KAAK,QAAQ,IAC5C,CAAC,GAAG,QAAQ,KAAK;AACrB,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,gBAAgB,IAAI,IAAI,aAAa,GAAG;AACjD,YAAM,OAAY,cAAQ,YAAY;AACtC,UAAI,CAAC,mBAAmB,MAAW,cAAQ,KAAK,QAAQ,GAAG,KAAK,QAAQ,GAAG;AACzE,eAAO,KAAK,EAAE,MAAM,cAAc,QAAQ,8DAA8D,CAAC;AACzG;AACA;AAAA,MACF;AACA,UAAI,SAAS,YAAY;AAAE;AAAM;AAAA,MAAU;AAC3C,UAAI;AACJ,UAAI;AACF,cAAM,WAAW,MAAS,UAAM,IAAI;AACpC,YAAI,CAAC,SAAS,OAAO,GAAG;AAAE;AAAM;AAAA,QAAU;AAC1C,kBAAU,SAAS;AAAA,MACrB,SAAS,OAAO;AAAE,YAAI,WAAW,KAAK,EAAG;AAAU,eAAO,KAAK,EAAE,MAAM,QAAQ,aAAa,KAAK,EAAE,CAAC;AAAG;AAAM;AAAA,MAAU;AACvH,UAAI,UAAU,QAAQ;AAAE;AAAM;AAAA,MAAU;AACxC,eAAS,IAAI,IAAI;AAAA,IACnB;AAEA,UAAM,aAAuB,CAAC;AAC9B,UAAM,gBAAgB,MAAM,yBAAyB,KAAK,QAAQ;AAClE,eAAW,UAAU,wBAAwB,aAAa,EAAE,OAAO,GAAG;AACpE,iBAAW,QAAQ,QAAQ;AACzB,YAAI,SAAS,cAAc,CAAC,SAAS,IAAI,IAAI,EAAG;AAChD,mBAAW,KAAK,IAAI;AACpB,iBAAS,OAAO,IAAI;AAAA,MACtB;AAAA,IACF;AACA,UAAM,SAAS;AAEf,QAAI,CAAC,QAAQ,QAAQ;AACnB,iBAAW,QAAQ,YAAY;AAC7B,YAAI;AACF,gBAAM,aAAa,oBAAoB,IAAI;AAC3C,cAAI;AACJ,gBAAM,aAAa,YAAY,YAAY;AACzC,kBAAM,WAAW,MAAS,UAAM,IAAI;AACpC,gBAAI,CAAC,SAAS,OAAO,KAAK,SAAS,UAAU,OAAQ;AACrD,kBAAM,mBAAmB,MAAM,wBAAwB,UAAU;AACjE,gBAAI,iBAAiB,MAAO,OAAM,IAAI,MAAM,iBAAiB,KAAK;AAClE,kBAAM,aAAa,iBAAiB;AACpC,kBAAM,iBAAiB,MAAM,qBAAqB,oBAAoB,IAAI,GAAG,UAAU;AACvF,gBAAI,CAAC,eAAgB,OAAM,IAAI,MAAM,uDAAuD;AAC5F,gBAAI,eAAe,YAAY,YAAY,YAAY,IAAI;AACzD,oBAAM,yBAAyB,YAAY,cAAc;AAAA,YAC3D;AACA,2BAAe,SAAS;AACxB,kBAAS,WAAO,IAAI;AAAA,UACtB,CAAC;AACD,cAAI,iBAAiB,QAAW;AAAE;AAAM;AAAA,UAAO;AAC/C,gBAAM;AACN;AAAA,QACF,SAAS,OAAO;AACd,iBAAO,KAAK,EAAE,MAAM,QAAQ,aAAa,KAAK,EAAE,CAAC;AACjD;AAKA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,cAAc,IAAI,cAAc,IAAI,cAAc,IAAI,QAAQ,GAAI,QAAQ,SAAS,EAAE,WAAW,IAAI,CAAC,EAAG;AAAA,EACnH;AAAA,EAEA,MAAc,iBAAgC;AAC5C,QAAI,KAAK,iBAAiB,EAAG;AAC7B,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,IAAI,KAAK,kBAAkB,KAAK,oBAAqB;AACzD,SAAK,kBAAkB;AACvB,QAAI;AAAE,YAAM,KAAK,MAAM,EAAE,eAAe,KAAK,cAAc,CAAC;AAAA,IAAG,QAAQ;AAAA,IAAoB;AAAA,EAC7F;AAAA,EAEQ,gBAAsB;AAC5B,QAAI,KAAK,kBAAkB,KAAK,aAAc;AAC9C,SAAK,iBAAiB;AACtB,QAAI,KAAK,kBAAkB,GAAG;AAC5B,qBAAe,MAAM;AACnB,aAAK,iBAAiB;AACtB,aAAK,WAAW;AAAA,MAClB,CAAC;AACD;AAAA,IACF;AACA,SAAK,aAAa,WAAW,MAAM;AAAE,WAAK,aAAa;AAAW,WAAK,iBAAiB;AAAO,WAAK,WAAW;AAAA,IAAG,GAAG,KAAK,aAAa;AAAA,EACzI;AAAA,EAEQ,aAAmB;AACzB,QAAI,KAAK,gBAAgB,KAAK,QAAQ,WAAW,EAAG;AACpD,UAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC;AACnC,UAAM,QAAQ,KAAK,aAAa,KAAK;AACrC,SAAK,eAAe,MAAM,QAAQ,MAAM;AAAE,WAAK,eAAe;AAAW,UAAI,KAAK,QAAQ,SAAS,EAAG,MAAK,cAAc;AAAA,IAAG,CAAC;AAAA,EAC/H;AAAA,EAEA,MAAc,uBAAsC;AAClD,UAAM,QAAQ,MAAM,kBAAkB,KAAK,QAAQ;AACnD,UAAM,SAAS,MAAM,MAAM,SAAS,CAAC,KAAK,KAAK;AAC/C,SAAK,iBAAiB,eAAe,QAAQ,KAAK,QAAQ;AAC1D,UAAM,QAAQ,MAAM,mBAAmB,MAAM;AAC7C,UAAM,QAAQ,MAAM;AAKpB,UAAM,mBAAmB,QAAQ,CAAC,IAAI,MAAM,wBAAwB,KAAK,QAAQ;AACjF,QAAI,iBAAiB,MAAO,OAAM,IAAI,MAAM,iBAAiB,KAAK;AAClE,UAAM,aAAa,iBAAiB;AACpC,SAAK,eAAe,OAAO,YAAY,YAAY,YAAY;AAC/D,SAAK,WAAW,OAAO,QAAQ,YAAY,QAAQ;AACnD,SAAK,qBAAqB,MAAM;AAChC,SAAK,qBAAqB,MAAM,eAAe,KAAK,IAAI;AACxD,SAAK,mBAAmB;AAAA,EAC1B;AAAA,EAEA,MAAc,oBAAsC;AAClD,QAAI,CAAC,KAAK,iBAAkB,QAAO;AACnC,UAAM,gBAAgB,YAAY,KAAK,UAAU,KAAK,iBAAiB,CAAC;AACxE,UAAM,CAAC,aAAa,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC/C,SAAK,KAAK,IAAI,EAAE,MAAM,CAAC,UAAmB;AAC3C,YAAI,WAAW,KAAK,EAAG,QAAO;AAC9B,cAAM;AAAA,MACR,CAAC;AAAA,MACE,WAAO,aAAa,EAAE;AAAA,QACvB,MAAM;AAAA,QACN,CAAC,UAAmB;AAClB,cAAI,WAAW,KAAK,EAAG,QAAO;AAC9B,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF,CAAC;AAKD,WAAO,aAAa,OAAO,MAAM,QAAQ,YAAY,SAAS,KAAK,sBAAsB,CAAC;AAAA,EAC5F;AAAA,EAEA,MAAc,gBAA+B;AAC3C,QAAI,KAAK,mBAAmB,KAAK,KAAK,iBAAiB,EAAG;AAC1D,QAAI,OAAO,SAAS,KAAK,gBAAgB,KAAK,KAAK,IAAI,IAAI,KAAK,sBAAsB,KAAK,kBAAkB;AAAE,WAAK,OAAO;AAAG;AAAA,IAAQ;AACtI,QAAI,OAAO,SAAS,KAAK,qBAAqB,KAAK,KAAK,sBAAsB,KAAK,sBAAuB,MAAK,OAAO;AAAA,EACxH;AAAA,EAEQ,SAAe;AAAE,SAAK;AAAkB,SAAK,qBAAqB,KAAK,IAAI;AAAG,SAAK,qBAAqB;AAAG,SAAK,SAAS;AAAA,EAAkB;AAAA,EAEnJ,MAAc,aAAa,OAA2C;AACpE,UAAM,UAAU,YAAY,IAAI;AAChC,SAAK,SAAS;AACd,SAAK,SAAS,eAAe,KAAK,IAAI,KAAK,SAAS,cAAc,MAAM,MAAM;AAC9E,QAAI;AACF,UAAI,WAA6B,CAAC;AAClC,YAAM,aAAa,KAAK,UAAU,YAAY;AAC5C,YAAI,CAAE,MAAM,KAAK,kBAAkB,EAAI,OAAM,KAAK,qBAAqB;AACvE,cAAM,KAAK,cAAc;AACzB,cAAM,KAAK,KAAK;AAChB,YAAI,OAAuD,KAAK,eAAe,IAAI,EAAE,UAAU,KAAK,cAAc,MAAM,KAAK,SAAS,IAAI;AAC1I,mBAAW,MAAM,IAAI,CAAC,EAAE,MAAM,MAAM;AAClC,gBAAM,UAAU,KAAK,IAAI,EAAE,YAAY;AACvC,gBAAM,KAAK,EAAE,GAAG,OAAO,YAAY,MAAM,cAAc,SAAS,aAAa,MAAM,eAAe,KAAK,aAAa,EAAE,SAAS,GAAG,eAAe,0BAA0B,SAAS,KAAK,UAAU,GAAG,YAAY,SAAS,aAAa,SAAS,WAAW,MAAM,YAAY,KAAK,GAAG,cAAc,MAAM,QAAQ,aAAa;AAC/T,gBAAM,QAAwB,EAAE,GAAG,IAAI,MAAM,UAAU,EAAE,EAAE;AAC3D,iBAAO;AACP,iBAAO;AAAA,QACT,CAAC;AACD,cAAM,aAAa,SAAS,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI;AACvE,cAAS,eAAW,IAAI,YAAY,MAAM;AAC1C,aAAK,sBAAsB,OAAO,WAAW,UAAU;AAAA,MACzD,CAAC;AACD,YAAM,OAAO,SAAS,SAAS,SAAS,CAAC;AACzC,WAAK,eAAe,KAAK;AACzB,WAAK,WAAW,KAAK;AACrB,YAAM,QAAQ,CAAC,MAAM,MAAM;AAAE,aAAK,QAAQ,SAAS,CAAC,CAAE;AAAA,MAAG,CAAC;AAC1D,WAAK,SAAS,mBAAmB,MAAM;AACvC,WAAK,KAAK,eAAe;AAAA,IAC3B,SAAS,OAAO;AAGd,WAAK,mBAAmB;AACxB,WAAK,SAAS,gBAAgB,MAAM;AACpC,YAAM,QAAQ,CAAC,SAAS;AAAE,aAAK,OAAO,KAAK;AAAA,MAAG,CAAC;AAAA,IACjD,UAAE;AAAU,WAAK,sBAAsB,YAAY,IAAI,IAAI;AAAA,IAAS;AAAA,EACtE;AACF;AAEA,SAAS,YAAY,UAAkB,OAAuB;AAC5D,QAAM,MAAW,cAAQ,QAAQ;AACjC,QAAM,MAAW,cAAQ,QAAQ;AACjC,QAAM,OAAY,eAAS,UAAU,GAAG;AACxC,SAAY,WAAK,KAAK,GAAG,IAAI,IAAI,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE;AACzE;AAWA,eAAsB,kBAAkB,UAAqC;AAC3E,QAAM,MAAW,cAAQ,QAAQ;AACjC,QAAM,MAAW,cAAQ,QAAQ;AACjC,QAAM,OAAY,eAAS,UAAU,GAAG;AACxC,QAAM,UAAU,IAAI,OAAO,IAAI,YAAY,IAAI,CAAC,iBAAiB,YAAY,GAAG,CAAC,GAAG;AACpF,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACF,UAAM,UAAU,MAAS,YAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;AAC7D,eAAW,SAAS,QAAS,KAAI,MAAM,OAAO,KAAK,QAAQ,KAAK,MAAM,IAAI,EAAG,QAAO,KAAU,WAAK,KAAK,MAAM,IAAI,CAAC;AAAA,EACrH,QAAQ;AAAA,EAAW;AACnB,QAAM,WAAgB,WAAK,KAAK,OAAO,GAAG;AAC1C,QAAM,UAAU,OAAO,OAAO,CAAC,SAAS,SAAS,QAAQ,EAAE,KAAK,CAAC,MAAM,UAAU,WAAW,MAAM,MAAM,GAAG,IAAI,WAAW,OAAO,MAAM,GAAG,CAAC;AAC3I,SAAO,CAAC,UAAU,GAAG,OAAO;AAC9B;AAEA,eAAe,yBAAyB,UAAqC;AAC3E,QAAM,YAAiB,cAAQ,QAAQ;AACvC,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACF,UAAM,UAAU,MAAS,YAAQ,WAAW,EAAE,eAAe,KAAK,CAAC;AACnE,eAAW,SAAS,SAAS;AAC3B,YAAM,OAAY,WAAK,WAAW,MAAM,IAAI;AAC5C,UAAI,MAAM,OAAO,KAAK,mBAAmB,MAAM,WAAW,QAAQ,EAAG,QAAO,KAAK,IAAI;AAAA,IACvF;AAAA,EACF,QAAQ;AAAA,EAAW;AACnB,SAAO,OAAO,KAAK,qBAAqB;AAC1C;AAEA,SAAS,mBAAmB,UAAkB,WAAmB,UAA4B;AAC3F,MAAS,cAAa,cAAQ,QAAQ,CAAC,MAAW,cAAQ,SAAS,EAAG,QAAO;AAC7E,QAAM,WAAgB,eAAS,QAAQ;AACvC,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,WAAgB,eAAS,QAAQ;AACvC,QAAM,cAAc;AACpB,MAAI,qCAAqC,KAAK,QAAQ,EAAG,QAAO,YAAY,KAAK,QAAQ;AACzF,SAAO,oBAAyB,cAAQ,QAAQ,CAAC,MAAM,oBAAyB,cAAQ,QAAQ,CAAC;AACnG;AAEA,SAAS,wBAAwB,OAAwC;AACvE,QAAM,SAAS,oBAAI,IAAsB;AACzC,aAAW,QAAQ,OAAO;AACxB,UAAM,SAAS,oBAAoB,IAAI;AACvC,UAAM,QAAQ,OAAO,IAAI,MAAM,KAAK,CAAC;AACrC,UAAM,KAAK,IAAI;AACf,WAAO,IAAI,QAAQ,KAAK;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,UAA0B;AACrD,SAAO,SAAS,QAAQ,uBAAuB,EAAE;AACnD;AAEA,SAAS,wBAAwB,UAA0B;AACzD,SAAO,GAAG,oBAAoB,QAAQ,CAAC;AACzC;AAEA,eAAe,qBACb,SACA,YACmD;AACnD,MAAI,WAAW,YAAY,YAAY;AACvC,MAAI,OAAO,YAAY,QAAQ;AAC/B,MAAI,WAAW;AACf,MAAI,WAAW;AACf,mBAAiB,SAAS,SAAS;AACjC,eAAW;AACX,QAAI,MAAM,YAAY,SAAU;AAChC,QAAI,MAAM,aAAa,WAAW,KAAK,MAAM,iBAAiB,KAAM,QAAO;AAC3E,UAAM,EAAE,MAAM,cAAc,GAAG,QAAQ,IAAI;AAC3C,QAAI,UAAU,OAAO,MAAM,aAAc,QAAO;AAChD,eAAW,MAAM;AACjB,WAAO;AACP,eAAW;AAAA,EACb;AACA,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI,CAAC,SAAU,QAAO;AACtB,SAAO,EAAE,SAAS,8BAA8B,UAAU,KAAK;AACjE;AAEA,eAAe,qBACb,OACA,YACgC;AAChC,QAAM,qBAAqB,YAAY,YAAY;AACnD,MAAI,eAAe,YAAY,QAAQ;AACvC,MAAI,UAAU;AACd,MAAI,eAAe;AACnB,MAAI;AACJ,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,uBAAiB,SAAS,oBAAoB,IAAI,GAAG;AACnD,cAAM,EAAE,MAAM,cAAc,GAAG,QAAQ,IAAI;AAC3C,YAAI,MAAM,YAAY,oBAAoB;AAIxC,cAAI,UAAU,OAAO,MAAM,aAAc,QAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,sBAAsB;AACvH,cAAI,mBAAmB,MAAM,aAAa,gBAAgB,WAAW,GAAG;AACtE,mBAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,YAAY,MAAM,QAAQ,WAAW,gBAAgB,WAAW,CAAC,GAAG;AAAA,UAC9H;AACA,cAAI,mBAAmB,MAAM,iBAAiB,gBAAgB,MAAM;AAClE,mBAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,yBAAyB;AAAA,UACnF;AACA,cAAI,MAAM,aAAa,sBAAsB,iBAAiB,YAAY,MAAM;AAC9E,mBAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,qCAAqC;AAAA,UAC/F;AACA,4BAAkB;AAClB;AAAA,QACF;AACA,cAAM,QAAQ;AACd,YAAI,MAAM,aAAa,eAAe,EAAG,QAAO,EAAE,IAAI,OAAO,SAAS,UAAU,OAAO,QAAQ,YAAY,MAAM,QAAQ,WAAW,eAAe,CAAC,GAAG;AACvJ,YAAI,MAAM,iBAAiB,aAAc,QAAO,EAAE,IAAI,OAAO,SAAS,UAAU,OAAO,QAAQ,yBAAyB;AACxH,YAAI,UAAU,OAAO,MAAM,aAAc,QAAO,EAAE,IAAI,OAAO,SAAS,UAAU,OAAO,QAAQ,sBAAsB;AACrH,uBAAe;AACf,uBAAe,MAAM;AAAA,MACvB;AAAA,IACF,SAAS,OAAO;AAAE,aAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,aAAa,KAAK,EAAE;AAAA,IAAG;AAAA,EACnG;AACA,MACE,oBACC,gBAAgB,aAAa,sBAAsB,gBAAgB,SAAS,YAAY,OACzF;AACA,WAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,qCAAqC;AAAA,EAC/F;AACA,SAAO,EAAE,IAAI,MAAM,SAAS,cAAc,UAAU,aAAa;AACnE;AAEA,eAAsB,wBAAwB,UAG3C;AACD,QAAM,iBAAiB,wBAAwB,QAAQ;AACvD,MAAI;AACJ,MAAI;AAAE,UAAM,MAAS,aAAS,gBAAgB,MAAM;AAAA,EAAG,SAAS,OAAO;AACrE,WAAO,WAAW,KAAK,IAAI,CAAC,IAAI,EAAE,OAAO,qCAAqC,aAAa,KAAK,CAAC,GAAG;AAAA,EACtG;AACA,MAAI;AACF,UAAMC,UAAS,KAAK,MAAM,GAAG;AAC7B,QAAIA,QAAO,YAAY,gCAAgC,CAAC,OAAO,cAAcA,QAAO,QAAQ,MAAMA,QAAO,YAAY,MAAM,KAAK,CAAC,OAAOA,QAAO,IAAI,GAAG;AACpJ,aAAO,EAAE,OAAO,yCAAyC;AAAA,IAC3D;AACA,WAAO,EAAE,YAAYA,QAAuC;AAAA,EAC9D,QAAQ;AAAE,WAAO,EAAE,OAAO,8CAA8C;AAAA,EAAG;AAC7E;AAEA,eAAe,yBAAyB,UAAkB,YAAyD;AACjH,QAAM,YAAY,wBAAwB,QAAQ,GAAG,GAAG,KAAK,UAAU,UAAU,CAAC;AAAA,GAAM,EAAE,MAAM,IAAM,CAAC;AACzG;AAEA,SAAS,OAAO,OAAiC;AAC/C,SAAO,OAAO,UAAU,YAAY,iBAAiB,KAAK,KAAK;AACjE;AAEA,SAAS,WAAW,UAAkB,MAAc,KAAqB;AACvE,QAAM,SAAc,eAAS,QAAQ,EAAE,MAAM,KAAK,SAAS,GAAG,CAAC,IAAI,MAAM;AACzE,SAAO,SAAS,SAAS,QAAQ,EAAE,IAAI;AACzC;AAEA,SAAS,eAAe,UAAkB,UAA0B;AAClE,QAAM,MAAW,cAAQ,QAAQ;AACjC,SAAO,WAAW,UAAe,eAAS,UAAU,GAAG,GAAG,GAAG;AAC/D;AAEA,SAAS,YAAY,MAAsB;AAAE,SAAO,KAAK,QAAQ,uBAAuB,MAAM;AAAG;AAEjG,eAAe,mBAAmB,UAI/B;AACD,MAAI;AACJ,MAAI;AAAE,aAAS,MAAS,SAAK,UAAU,GAAG;AAAA,EAAG,SAAS,OAAO;AAAE,QAAI,WAAW,KAAK,EAAG,QAAO,EAAE,MAAM,EAAE;AAAG,UAAM;AAAA,EAAO;AACvH,MAAI;AACF,UAAMC,QAAO,MAAM,OAAO,KAAK;AAC/B,UAAM,OAAOA,MAAK;AAClB,QAAI,WAAW,MAAM,SAAS;AAC9B,WAAO,WAAW,GAAG;AACnB,YAAM,SAAS,KAAK,IAAI,OAAO,QAAQ;AACvC,kBAAY;AACZ,YAAM,MAAM,OAAO,YAAY,MAAM;AACrC,YAAM,OAAO,KAAK,KAAK,GAAG,QAAQ,QAAQ;AAC1C,eAAS,IAAI,SAAS,MAAM,IAAI;AAChC,YAAM,QAAQ,OAAO,MAAM,IAAI;AAC/B,YAAM,QAAQ,aAAa,IAAI,IAAI;AACnC,eAAS,IAAI,MAAM,SAAS,GAAG,KAAK,OAAO,KAAK;AAC9C,cAAM,UAAU,MAAM,CAAC,EAAG,KAAK;AAC/B,YAAI,CAAC,QAAS;AACd,YAAI;AAAE,iBAAO,EAAE,OAAO,KAAK,MAAM,OAAO,GAAqB,MAAM,aAAaA,MAAK,YAAY;AAAA,QAAG,QAAQ;AAAA,QAAqB;AAAA,MACnI;AACA,eAAS,MAAM,CAAC,KAAK;AAAA,IACvB;AACA,WAAO,EAAE,MAAM,aAAaA,MAAK,YAAY;AAAA,EAC/C,UAAE;AAAU,UAAM,OAAO,MAAM;AAAA,EAAG;AACpC;AAKA,gBAAuB,oBAAoB,UAAkD;AAC3F,MAAI,aAAa;AACjB,MAAI;AACF,UAAM,QAAQ,iBAAiB,UAAU,EAAE,UAAU,QAAQ,eAAe,MAAM,KAAK,CAAC;AACxF,UAAM,QAAQ,gBAAgB,EAAE,OAAO,WAAW,SAAS,CAAC;AAC5D,qBAAiB,QAAQ,OAAO;AAC9B;AACA,YAAM,UAAU,KAAK,KAAK;AAC1B,UAAI,CAAC,QAAS;AACd,UAAI;AACJ,UAAI;AAAE,gBAAQ,KAAK,MAAM,OAAO;AAAA,MAAqB,QAAQ;AAAE,cAAM,IAAI,MAAM,wBAAwB,UAAU,OAAY,eAAS,QAAQ,CAAC,EAAE;AAAA,MAAG;AACpJ,YAAM;AAAA,IACR;AAAA,EACF,SAAS,OAAO;AACd,QAAI,WAAW,KAAK,EAAG;AACvB,UAAM;AAAA,EACR;AACF;AAEA,eAAe,kBAAkB,UAA6C;AAC5E,QAAM,UAA4B,CAAC;AACnC,mBAAiB,SAAS,oBAAoB,QAAQ,EAAG,SAAQ,KAAK,KAAK;AAC3E,SAAO;AACT;AAEA,SAAS,WAAW,OAAyB;AAAE,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,SAAS,MAAM,SAAS;AAAU;AACjJ,SAAS,aAAa,OAAwB;AAAE,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAG;;;AMpiB/G,YAAYC,SAAQ;AACpB,YAAYC,WAAU;AAqBf,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAC9C,YACE,SACS,KACA,UACT;AACA,UAAM,OAAO;AAHJ;AACA;AAGT,SAAK,OAAO;AAAA,EACd;AAAA,EALW;AAAA,EACA;AAKb;AASA,eAAe,iBAAiB,WAAsC;AACpE,MAAI;AACJ,MAAI;AACF,cAAU,MAAS,YAAQ,SAAS;AAAA,EACtC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,SAAS,SAAS;AAC3B,UAAM,QAAQ,uBAAuB,KAAK,KAAK;AAC/C,QAAI,QAAQ,CAAC,EAAG,OAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpC;AACA,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK;AACzB;AAGA,SAAS,YAAY,YAA4B;AAC/C,SAAO,WAAW,QAAQ,cAAc,EAAE;AAC5C;AAEA,eAAsB,6BACpB,SACA,WACsC;AACtC,MAAI,QAAQ,yBAAyB,GAAG;AACtC,WAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,aAAa,QAAQ,oBAAoB;AAAA,IAC3C;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,iBAAiB,SAAS;AACjD,QAAM,cAA4C,CAAC;AACnD,MAAI,iBAAiB;AACrB,MAAI,mBAAmB;AAEvB,aAAW,cAAc,UAAU;AACjC,UAAM,MAAM,YAAY,UAAU;AAClC,UAAM,WAAgB,WAAK,WAAW,GAAG,UAAU,QAAQ;AAC3D,QAAI,eAAe;AAMnB,QAAI,QAAQ,eAAe,GAAG,EAAG;AAEjC,QAAI;AAGF,YAAM,QAAQ,gBAAgB,OAAO,SAAS;AAC5C,uBAAe;AAEf,cAAM,mBAAmB,MAAM,wBAAwB,QAAQ;AAC/D,YAAI,iBAAiB,OAAO;AAC1B,gBAAM,IAAI,qBAAqB,iBAAiB,OAAO,KAAK,CAAC;AAAA,QAC/D;AACA,cAAM,aAAa,iBAAiB;AACpC,YAAI,WAAY,MAAK,WAAW,KAAK,WAAW,UAAU,WAAW,IAAI;AAEzE,YAAI,oBAAoB,YAAY,YAAY,KAAK;AACrD,YAAI,eAAe,YAAY,QAAQ;AAEvC,mBAAW,aAAa,MAAM,kBAAkB,QAAQ,GAAG;AACzD,2BAAiB,SAAS,oBAAoB,SAAS,GAAG;AACxD,gBAAI,MAAM,aAAa,kBAAkB;AACvC,oBAAM,IAAI;AAAA,gBACR,mBAAmB,GAAG,cAAc,gBAAgB,WAAW,MAAM,QAAQ;AAAA,gBAC7E;AAAA,gBACA,MAAM;AAAA,cACR;AAAA,YACF;AACA,gBAAI,MAAM,iBAAiB,cAAc;AACvC,oBAAM,IAAI;AAAA,gBACR,6BAA6B,GAAG,gBAAgB,MAAM,QAAQ;AAAA,gBAC9D;AAAA,gBACA,MAAM;AAAA,cACR;AAAA,YACF;AACA,gBAAI,mBAAmB,KAAK,MAAM,MAAM,MAAM;AAC5C,oBAAM,IAAI;AAAA,gBACR,0BAA0B,GAAG,gBAAgB,MAAM,QAAQ;AAAA,gBAC3D;AAAA,gBACA,MAAM;AAAA,cACR;AAAA,YACF;AACA,iBAAK,OAAO,KAAK,KAAK;AACtB,4BAAgB;AAChB,+BAAmB,MAAM,WAAW;AACpC,2BAAe,MAAM;AAAA,UACvB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH,SAAS,OAAO;AAKd,UAAI,EAAE,iBAAiB,sBAAuB,OAAM;AACpD,kBAAY,KAAK,EAAE,KAAK,UAAU,MAAM,UAAU,QAAQ,MAAM,QAAQ,CAAC;AACzE;AAAA,IACF;AAEA,QAAI,eAAe,EAAG,qBAAoB;AAC1C,sBAAkB;AAAA,EACpB;AAEA,UAAQ,0BAA0B,WAAW;AAC7C,UAAQ,0BAA0B;AAElC,SAAO;AAAA,IACL,iBAAiB;AAAA,IACjB,UAAU;AAAA,IACV,QAAQ;AAAA,IACR;AAAA,EACF;AACF;;;ACvJA,YAAYC,SAAQ;AACpB,SAAS,qBAAqB;AAC9B,YAAYC,WAAU;;;AChCtB,IAAM,iCAAiC;AAEvC,SAAS,4BAA4B,SAAkB,MAAmC;AACxF,QAAM,UAAU,OAAO,YAAY,WAAW,UAAU,mBAAmB,QAAQ,QAAQ,UAAU;AACrG,QAAM,gBAAgB,KAAK,CAAC;AAC5B,QAAM,cACJ,OAAO,YAAY,WACf,OAAO,kBAAkB,WACvB,gBACA,OAAO,kBAAkB,YACvB,kBAAkB,QAClB,UAAU,iBACV,OAAO,cAAc,SAAS,WAC9B,cAAc,OACd,KACJ,mBAAmB,QACjB,QAAQ,OACR;AACR,QAAM,cACJ,OAAO,YAAY,WACf,OAAO,kBAAkB,YACzB,kBAAkB,QAClB,UAAU,iBACV,OAAO,cAAc,SAAS,WAC5B,cAAc,OACd,OAAO,KAAK,CAAC,MAAM,WACjB,KAAK,CAAC,IACN,KACJ,mBAAmB,SAAS,UAAU,WAAW,OAAO,QAAQ,SAAS,WACvE,QAAQ,OACR;AAER,SACE,+BAA+B,KAAK,OAAO,MAC1C,gBAAgB,yBAAyB,gBAAgB;AAE9D;AAOO,SAAS,wCAA2C,KAAiB;AAC1E,QAAM,sBAAsB,QAAQ;AACpC,QAAM,iBAAiB,oBAAoB,KAAK,OAAO;AAKvD,UAAQ,eAAe,CAAC,YAAqB,SAA0B;AACrE,QAAI,4BAA4B,SAAS,IAAI,EAAG;AAChD,mBAAe,SAAS,GAAG,IAAI;AAAA,EACjC;AAEA,MAAI;AACF,WAAO,IAAI;AAAA,EACb,UAAE;AACA,YAAQ,cAAc;AAAA,EACxB;AACF;;;AC5DA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,oBAAAC,yBAAwB;AACjC,YAAYC,SAAQ;AACpB,YAAYC,WAAU;AACtB,SAAS,mBAAAC,wBAAuB;;;ACJhC,YAAYC,SAAQ;AACpB,YAAYC,WAAU;AAGtB,IAAM,gBAAgB;AAetB,SAAS,QAAQ,OAAkD;AACjE,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,QAAQ;AACd,SACE,OAAO,MAAM,SAAS,aACrB,MAAM,kBAAkB,UAAa,OAAO,MAAM,kBAAkB,cACpE,MAAM,kBAAkB,UAAa,OAAO,MAAM,kBAAkB,cACpE,MAAM,UAAU,UAAa,OAAO,MAAM,UAAU;AAEzD;AASO,IAAM,+BAAN,MAAmC;AAAA,EAKxC,YAA6B,WAAmB;AAAnB;AAC3B,SAAK,YAAiB,WAAK,WAAW,kBAAkB;AAAA,EAC1D;AAAA,EAF6B;AAAA,EAJZ;AAAA,EACT;AAAA,EACA,QAAQ;AAAA,EAMR,MAAM,UAA0B;AACtC,WAAY,eAAS,KAAK,WAAW,QAAQ,EAAE,MAAW,SAAG,EAAE,KAAK,GAAG;AAAA,EACzE;AAAA,EAEA,MAAc,OAAsD;AAClE,QAAI,KAAK,QAAS,QAAO,KAAK;AAC9B,UAAM,UAAU,oBAAI,IAAqC;AACzD,QAAI;AACF,YAAM,MAAM,MAAS,aAAS,KAAK,WAAW,MAAM;AACpD,YAAMC,UAAS,KAAK,MAAM,GAAG;AAC7B,UAAIA,QAAO,YAAY,iBAAiBA,QAAO,WAAW,OAAOA,QAAO,YAAY,UAAU;AAC5F,mBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQA,QAAO,OAAO,GAAG;AACzD,cAAI,QAAQ,KAAK,EAAG,SAAQ,IAAI,KAAK,KAAK;AAAA,QAC5C;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAGR;AACA,SAAK,UAAU;AACf,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,UAAkB,aAAmE;AAC7F,UAAM,UAAU,MAAM,KAAK,KAAK;AAChC,UAAM,QAAQ,QAAQ,IAAI,KAAK,MAAM,QAAQ,CAAC;AAC9C,WAAO,SAAS,MAAM,SAAS,cAAc,QAAQ;AAAA,EACvD;AAAA,EAEA,IAAI,UAAkB,OAAsC;AAC1D,SAAK,YAAY,oBAAI,IAAI;AACzB,SAAK,QAAQ,IAAI,KAAK,MAAM,QAAQ,GAAG,KAAK;AAC5C,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA,EAGA,MAAM,eAAwC;AAC5C,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,OAAO,IAAI,IAAI,cAAc,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,CAAC,CAAC;AAClE,eAAW,OAAO,KAAK,QAAQ,KAAK,GAAG;AACrC,UAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,aAAK,QAAQ,OAAO,GAAG;AACvB,aAAK,QAAQ;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,QAAuB;AAC3B,QAAI,CAAC,KAAK,SAAS,CAAC,KAAK,QAAS;AAClC,UAAM,UAAqB,EAAE,SAAS,eAAe,SAAS,OAAO,YAAY,KAAK,OAAO,EAAE;AAC/F,QAAI;AACF,YAAM,aAAa,KAAK,WAAW,YAAY;AAC7C,cAAM,YAAY,KAAK,WAAW,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA,GAAM,EAAE,MAAM,IAAM,CAAC;AAAA,MACnF,CAAC;AACD,WAAK,QAAQ;AAAA,IACf,QAAQ;AAAA,IAGR;AAAA,EACF;AACF;;;ADVA,IAAM,8BAA8B;AAIpC,SAAS,YAAY,UAAkB,UAAkD;AACvF,QAAM,SAASC,kBAAiB,UAAU;AAAA,IACxC,UAAU;AAAA,IACV,eAAe,MAAM;AAAA,IACrB,GAAI,aAAa,SAAY,EAAE,KAAK,WAAW,EAAE,IAAI,CAAC;AAAA,EACxD,CAAC;AACD,QAAM,KAAKC,iBAAgB,EAAE,OAAO,QAAQ,WAAW,SAAS,CAAC;AACjE,SAAO,GAAG,OAAO,aAAa,EAAE;AAClC;AAGA,eAAe,uBACb,MACA,MACmD;AACnD,MAAI;AACJ,MAAI;AACJ,mBAAiB,QAAQ,YAAY,MAAM,IAAI,GAAG;AAChD,QAAI,CAAC,KAAK,KAAK,EAAG;AAClB,QAAI;AACJ,QAAI;AACF,cAAQ,KAAK,MAAM,IAAI;AACvB,UAAI,CAAC,iBAAiB,KAAK,EAAG;AAAA,IAChC,QAAQ;AAAE;AAAA,IAAU;AACpB,UAAM,aAAa,MAAM,cAAc,MAAM;AAC7C,QAAI,QAAQ,UAAa,aAAa,IAAK,OAAM;AACjD,QAAI,QAAQ,UAAa,aAAa,IAAK,OAAM;AAAA,EACnD;AACA,SAAO,QAAQ,SAAY,SAAY,EAAE,KAAK,IAAU;AAC1D;AAEA,SAAS,cAAc,OAAgC,OAAgC;AACrF,MAAI,MAAM,MAAO,QAAO;AACxB,MAAI,MAAM,QAAQ,MAAM,gBAAiB,MAAM,KAAM,QAAO;AAC5D,MAAI,MAAM,MAAM,MAAM,gBAAiB,MAAM,GAAI,QAAO;AACxD,SAAO;AACT;AAWO,IAAM,uBAAN,MAAM,sBAAqB;AAAA,EAMxB,YACN,OACS,aACTC,aACA,YACA;AAHS;AAIT,SAAK,iBAAiB;AACtB,SAAK,aAAaA;AAClB,SAAK,aAAa;AAAA,EACpB;AAAA,EAPW;AAAA,EAPM;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EAajB,aAAa,cACX,WACA,SAC+B;AAC/B,UAAM,WAAgB,cAAQ,SAAS;AACvC,UAAM,QAAQ,MAAM,eAAe,QAAQ;AAC3C,UAAMA,cAAa,SAAS,cAAc,IAAI,6BAA6B,QAAQ;AACnF,WAAO,IAAI;AAAA,MACT;AAAA,MACA,EAAE,aAAa,MAAM,QAAQ,cAAc,EAAE;AAAA,MAC7CA;AAAA,MACA,MAAM,GAAG,EAAE;AAAA,IACb;AAAA,EACF;AAAA,EAEA,aAAa,UAAU,OAAgD;AACrE,WAAO,IAAI,sBAAqB,OAAO,EAAE,aAAa,MAAM,QAAQ,cAAc,EAAE,CAAC;AAAA,EACvF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAc,kBAAkB,MAAc,MAAgD;AAC5F,UAAM,SAAS,MAAM,KAAK,WAAY,IAAI,MAAM,IAAI;AACpD,QAAI,OAAQ,QAAO;AACnB,UAAM,WAAW,MAAM,uBAAuB,MAAM,IAAI;AACxD,UAAM,QAAiC,WACnC,EAAE,MAAM,eAAe,SAAS,KAAK,eAAe,SAAS,IAAI,IACjE,EAAE,MAAM,OAAO,KAAK;AACxB,SAAK,WAAY,IAAI,MAAM,KAAK;AAChC,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAc,QAAQ,MAAc,MAAc,OAAyC;AACzF,QAAI,CAAC,KAAK,cAAe,CAAC,MAAM,QAAQ,CAAC,MAAM,MAAO,SAAS,KAAK,WAAY,QAAO;AACvF,UAAM,QAAQ,MAAM,KAAK,kBAAkB,MAAM,IAAI;AACrD,WAAO,CAAC,cAAc,OAAO,KAAK;AAAA,EACpC;AAAA;AAAA,EAGA,MAAM,MAAM,QAAwB,CAAC,GAAkC;AACrE,UAAM,QAAQ,MAAM,SAAS;AAC7B,UAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,SAAS,KAAK,GAAM,CAAC;AAC9D,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,SAAS,aAAa,MAAM,QAAQ,OAAO,SAAS;AAC1D,UAAM,gBAAgB,SAClB,MAAM,qBAAqB,KAAK,gBAAgB,OAAO,QAAQ,IAC/D,MAAM,gBAAgB,KAAK,cAAc;AAC7C,UAAM,QAAQ,UAAU,QAAQ,gBAAgB,cAAc,MAAM,EAAE,QAAQ;AAC9E,UAAM,aAAa,yBAAyB;AAC5C,UAAM,oBAAsC,CAAC;AAC7C,UAAM,YAAY,CAAC,MAAsB,UACvC,cAAc,MAAM,KAAK,KAAK,UAAU,QAAQ,IAAI;AACtD,QAAI,aAAa;AACjB,QAAI,iBAAiB;AACrB,QAAI,gBAAgB;AACpB,QAAI,eAAe;AAEnB,eAAW,gBAAgB,OAAO;AAChC,UAAI;AACF,YAAI,aAAa,SAAS,EAAG;AAK7B,YAAI,MAAM,KAAK,QAAQ,aAAa,MAAM,aAAa,MAAM,KAAK,EAAG;AACrE,cAAM,QAAQ,UAAU,QACpB,YAAY,aAAa,MAAM,aAAa,IAAI,IAChD,aAAa,aAAa,MAAM,aAAa,IAAI;AAErD,yBAAiB,QAAQ,OAAO;AAC9B,cAAI,CAAC,KAAK,KAAK,EAAG;AAClB,cAAI;AACJ,cAAI;AACF,oBAAQ,KAAK,MAAM,IAAI;AACvB,gBAAI,CAAC,iBAAiB,KAAK,GAAG;AAAE;AAAgB;AAAA,YAAU;AAAA,UAC5D,QAAQ;AAAE;AAAgB;AAAA,UAAU;AACpC;AAEA,cAAI,CAAC,QAAQ,OAAO,KAAK,EAAG;AAC5B;AACA,wBAAc,YAAY,KAAK;AAE/B,cAAI,UAAU,kBAAkB,OAAO,OAAO,KAAK,KAAK,UAAU,QAAQ,IAAI,OAAO,GAAG;AACtF;AAAA,UACF;AACA;AAIA,gBAAM,iBAAiB,mBAAmB,mBAAmB,OAAO,SAAS;AAC7E,cAAI,iBAAiB,OAAO;AAC1B,8BAAkB,OAAO,gBAAgB,GAAG,KAAK;AACjD,gBAAI,kBAAkB,SAAS,MAAO,mBAAkB,IAAI;AAAA,UAC9D;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,UAAM,aAAa;AACnB,UAAM,YAAY,WAAW,GAAG,EAAE;AAElC,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,MAAM,KAAK,cAAc;AACzC,YAAM,KAAK,WAAW,MAAM;AAAA,IAC9B;AAEA,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,SAAS,gBAAgB,UAAU;AAAA,MACnC,GAAI,aAAa,WAAW,SAAS,iBACjC,EAAE,YAAY,aAAa;AAAA,QAC3B,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA,OAAO,SAAS,SAAS;AAAA,QACzB,UAAU,cAAc,IAAI,CAAC,EAAE,IAAI,KAAK,OAAO,EAAE,IAAI,KAAK,EAAE;AAAA,MAC9D,CAAC,EAAE,IAAI,CAAC;AAAA,MACV;AAAA,MACA,aAAa,cAAc;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,OACJ,QACA,QAAwB,CAAC,GACzB,QAAQ,KACwB;AAChC,UAAM,eAAe,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AACxC,QAAI,aAAa,WAAW,EAAG,QAAO,CAAC;AACvC,UAAM,SAAS,IAAI,IAAI,aAAa,IAAI,CAAC,UAAU,CAAC,OAAO,oBAAI,IAAoB,CAAC,CAAC,CAAC;AACtF,UAAM,gBAAgB,MAAM,gBAAgB,KAAK,cAAc;AAC/D,QAAI,eAAe;AACnB,eAAW,gBAAgB,eAAe;AACxC,UAAI;AACF,YAAI,aAAa,SAAS,EAAG;AAC7B,YAAI,MAAM,KAAK,QAAQ,aAAa,MAAM,aAAa,MAAM,KAAK,EAAG;AACrE,yBAAiB,QAAQ,YAAY,aAAa,MAAM,aAAa,IAAI,GAAG;AAC1E,cAAI,CAAC,KAAK,KAAK,EAAG;AAClB,cAAI;AACJ,cAAI;AACF,oBAAQ,KAAK,MAAM,IAAI;AACvB,gBAAI,CAAC,iBAAiB,KAAK,GAAG;AAAE;AAAgB;AAAA,YAAU;AAAA,UAC5D,QAAQ;AAAE;AAAgB;AAAA,UAAU;AACpC,cAAI,CAAC,QAAQ,OAAO,KAAK,EAAG;AAC5B,qBAAW,SAAS,cAAc;AAChC,kBAAM,QAAQ,WAAW,OAAO,KAAK;AACrC,kBAAM,cAAc,OAAO,IAAI,KAAK;AACpC,gBAAI,UAAU,OAAW,aAAY,IAAI,QAAQ,YAAY,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,UACnF;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAAwB;AAAA,IAClC;AACA,SAAK,YAAY,eAAe;AAChC,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,MAAM,KAAK,cAAc;AACzC,YAAM,KAAK,WAAW,MAAM;AAAA,IAC9B;AACA,UAAM,SAAgC,CAAC;AACvC,eAAW,SAAS,cAAc;AAChC,aAAO,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI,KAAK,CAAE,EACnC,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,OAAO,MAAM,EAAE,EAC1C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC,EAClE,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,MAAM,OAAuB,QAAwB,CAAC,GAAG,QAAQ,KAAqC;AAC1G,YAAQ,MAAM,KAAK,OAAO,CAAC,KAAK,GAAG,OAAO,KAAK,GAAG,KAAK,KAAK,CAAC;AAAA,EAC/D;AAAA;AAAA,EAGA,MAAM,MAAM,OAAuB,CAAC,GAAG,OAAO,GAAG,WAAW,KAAsC;AAChG,UAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC;AAClD,UAAM,WAAW,oBAAI,IAA4B;AACjD,QAAI,YAAY;AAGhB,qBAAiB,SAAS,aAAa,KAAK,cAAc,GAAG;AAC3D,UAAI,CAAC,QAAQ,OAAO,IAAI,EAAG;AAC3B;AACA,UAAI,SAAS,OAAO,UAAW,UAAS,IAAI,MAAM,SAAS,KAAK;AAAA,IAClE;AAEA,QAAI,WAAW,CAAC,GAAG,SAAS,OAAO,CAAC;AACpC,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;AACjD,aAAS,QAAQ,GAAG,QAAQ,cAAc,SAAS,SAAS,KAAK,SAAS,OAAO,WAAW,SAAS;AACnG,YAAM,eAAe,IAAI,IAAI,SAAS,QAAQ,CAAC,UAAU,aAAa,KAAK,EAAE,IAAI,CAAC,aAAa,SAAS,GAAG,CAAC,CAAC;AAC7G,YAAM,OAAyB,CAAC;AAIhC,uBAAiB,SAAS,aAAa,KAAK,cAAc,GAAG;AAC3D,YAAI,SAAS,IAAI,MAAM,OAAO,EAAG;AACjC,YAAI,CAAC,aAAa,KAAK,EAAE,KAAK,CAAC,aAAa,aAAa,IAAI,SAAS,GAAG,CAAC,EAAG;AAC7E,iBAAS,IAAI,MAAM,SAAS,KAAK;AACjC,aAAK,KAAK,KAAK;AACf,YAAI,SAAS,QAAQ,UAAW;AAAA,MAClC;AACA,iBAAW;AAAA,IACb;AAEA,UAAM,QAAQ,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,KAAK,aAAa;AACvD,UAAM,QAAQ,oBAAI,IAA8B;AAChD,eAAW,QAAQ,MAAO,YAAW,YAAY,aAAa,IAAI,GAAG;AACnE,YAAM,UAAU,MAAM,IAAI,SAAS,GAAG,KAAK,CAAC;AAC5C,cAAQ,KAAK,IAAI;AACjB,YAAM,IAAI,SAAS,KAAK,OAAO;AAAA,IACjC;AAEA,UAAM,QAA8B,CAAC;AACrC,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,QAAQ,MAAO,YAAW,YAAY,aAAa,IAAI,EAAG,YAAW,aAAa,MAAM,IAAI,SAAS,GAAG,KAAK,CAAC,GAAG;AAC1H,UAAI,UAAU,YAAY,KAAK,QAAS;AACxC,YAAM,CAAC,MAAM,EAAE,IAAI,cAAc,MAAM,SAAS,KAAK,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,WAAW,IAAI;AAC7F,YAAM,KAAK,GAAG,KAAK,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,IAAI;AACzD,UAAI,CAAC,KAAK,IAAI,EAAE,GAAG;AAAE,aAAK,IAAI,EAAE;AAAG,cAAM,KAAK,EAAE,MAAM,KAAK,SAAS,IAAI,GAAG,SAAS,MAAM,SAAS,MAAM,YAAY,SAAS,WAAW,CAAC;AAAA,MAAG;AAAA,IAC/I;AACA,WAAO,EAAE,OAAO,OAAO,WAAW,YAAY,aAAa,SAAS,QAAQ,UAAU;AAAA,EACxF;AACF;AAEA,gBAAgB,aAAa,OAA0D;AACrF,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,uBAAiB,QAAQ,YAAY,IAAI,GAAG;AAC1C,YAAI,CAAC,KAAK,KAAK,EAAG;AAClB,YAAI;AACF,gBAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,cAAI,iBAAiB,KAAK,EAAG,OAAM;AAAA,QACrC,QAAQ;AAAA,QAA2B;AAAA,MACrC;AAAA,IACF,QAAQ;AAAA,IAAmC;AAAA,EAC7C;AACF;AAIA,gBAAgB,aAAa,UAAkB,UAA2C;AACxF,QAAM,QAAQ,KAAK;AACnB,QAAM,UAAU;AAChB,MAAI;AACJ,MAAI;AAAE,aAAS,MAAS,SAAK,UAAU,GAAG;AAAA,EAAG,QAAQ;AAAE;AAAA,EAAQ;AAC/D,MAAI;AACF,UAAM,YAAY,MAAM,OAAO,KAAK,GAAG;AACvC,UAAM,OAAO,KAAK,IAAI,UAAU,YAAY,QAAQ;AACpD,QAAI,WAAW;AACf,QAAI,SAAS,OAAO,MAAM,CAAC;AAC3B,WAAO,WAAW,GAAG;AACnB,YAAM,SAAS,KAAK,IAAI,OAAO,QAAQ;AACvC,kBAAY;AACZ,YAAM,SAAS,OAAO,YAAY,MAAM;AACxC,YAAM,OAAO,KAAK,QAAQ,GAAG,QAAQ,QAAQ;AAC7C,YAAM,OAAO,OAAO,WAAW,IAAI,SAAS,OAAO,OAAO,CAAC,QAAQ,MAAM,CAAC;AAC1E,UAAI,UAAU,KAAK;AACnB,UAAI,eAAe;AACnB,eAAS,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG,SAAS;AACrD,YAAI,KAAK,KAAK,MAAM,QAAS;AAC7B,cAAMC,WAAU,KAAK,SAAS,QAAQ,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,KAAK;AACxE,YAAIA,SAAS,OAAMA;AACnB,kBAAU;AACV,uBAAe;AAAA,MACjB;AACA,eAAS,gBAAgB,IAAI,OAAO,KAAK,KAAK,SAAS,GAAG,YAAY,CAAC,IAAI;AAAA,IAC7E;AACA,UAAM,UAAU,OAAO,SAAS,MAAM,EAAE,KAAK;AAC7C,QAAI,QAAS,OAAM;AAAA,EACrB,UAAE;AAAU,UAAM,OAAO,MAAM;AAAA,EAAG;AACpC;AAqCO,SAAS,2BAAuC;AACrD,SAAO;AAAA,IACL,mBAAmB,oBAAI,IAAI;AAAA,IAAG,eAAe;AAAA,IAAG,mBAAmB;AAAA,IAAG,gBAAgB;AAAA,IACtF,kBAAkB;AAAA,IAAG,WAAW;AAAA,IAAG,WAAW,oBAAI,IAAI;AAAA,IAAG,QAAQ,oBAAI,IAAI;AAAA,IACzE,aAAa;AAAA,IAAG,cAAc;AAAA,IAAG,iBAAiB;AAAA,IAAG,kBAAkB;AAAA,IACvE,aAAa,oBAAI,IAAI;AAAA,IAAG,mBAAmB,CAAC;AAAA,IAC5C,WAAW;AAAA,IAAG,gBAAgB;AAAA,IAAG,aAAa;AAAA,IAAG,eAAe,CAAC;AAAA,IACjE,WAAW;AAAA,IAAG,iBAAiB;AAAA,IAC/B,YAAY;AAAA,IAAG,aAAa,oBAAI,IAAI;AAAA,IAAG,aAAa;AAAA,IAAG,cAAc,oBAAI,IAAI;AAAA,IAC7E,WAAW;AAAA,IAAG,aAAa;AAAA,IAAG,UAAU;AAAA,IAAG,eAAe;AAAA,IAC1D,UAAU,EAAE,KAAK,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,EAAE;AAAA,IACxG,kBAAkB,EAAE,KAAK,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,EAAE;AAAA,EAClH;AACF;AAEO,SAAS,cAAc,KAAiB,OAA6B;AAE1E,QAAM,SAAS,aAAa,KAAK;AACjC,MAAI,SAAS,MAAM;AACnB,MAAI,kBAAkB,KAAK,EAAG,KAAI,iBAAiB,MAAM;AAGzD,MAAI,MAAM,YAAY,iBAAkB,KAAI,kBAAkB,IAAI,MAAM,YAAY,gBAAgB;AACpG,MAAI,MAAM,SAAS,WAAY,KAAI,UAAU,IAAI,MAAM,QAAQ,UAAU;AACzE,MAAI,MAAM,SAAS,QAAS,KAAI,OAAO,IAAI,MAAM,QAAQ,OAAO;AAEhE,MAAI,MAAM,cAAc,2BAA4B,KAAI;AAAA,WAC/C,MAAM,cAAc,8BAA8B;AACzD,QAAI;AACJ,QAAI,eAAe,SAAS,OAAO,aAAa;AAChD,QAAI,gBAAgB,SAAS,OAAO,cAAc;AAClD,QAAI,mBAAmB,SAAS,OAAO,iBAAiB;AACxD,QAAI,oBAAoB,SAAS,OAAO,kBAAkB;AAC1D,UAAM,MAAM,WAAW,KAAK;AAC5B,QAAI,MAAM,EAAG,KAAI,kBAAkB,KAAK,GAAG;AAAA,EAC7C,WAAW,MAAM,cAAc,2BAA2B;AACxD,QAAI;AACJ,QAAI,MAAM,YAAY,mBAAmB,KAAM,KAAI;AACnD,UAAM,MAAM,WAAW,KAAK;AAC5B,QAAI,MAAM,EAAG,KAAI,kBAAkB,KAAK,GAAG;AAAA,EAC7C,WAAW,MAAM,cAAc,oBAAqB,KAAI;AAAA,WAC/C,MAAM,cAAc,eAAgB,KAAI;AAAA,WACxC,MAAM,cAAc,iBAAiB;AAC5C,QAAI;AACJ,UAAM,MAAM,WAAW,KAAK;AAC5B,QAAI,MAAM,EAAG,KAAI,cAAc,KAAK,GAAG;AAAA,EACzC,WAAW,MAAM,cAAc,eAAe;AAC5C,QAAI;AACJ,UAAM,MAAM,WAAW,KAAK;AAC5B,QAAI,MAAM,EAAG,KAAI,cAAc,KAAK,GAAG;AAAA,EACzC,WAAW,MAAM,cAAc,kBAAmB,KAAI;AAAA,WAC7C,MAAM,cAAc,uBAAuB,MAAM,YAAY,UAAW,KAAI;AAAA,WAC5E,MAAM,cAAc,qBAAsB,KAAI;AAAA,WAC9C,MAAM,cAAc,qBAAsB,KAAI;AAIvD,MAAI,MAAM,cAAc,mBAAmB;AACzC,UAAM,OAAO,SAAS,MAAM,cAAc,CAAC,GAAG,YAAY;AAC1D,QAAI,OAAO,SAAS,YAAY,OAAO,SAAS,IAAI,GAAG;AACrD,YAAM,MAAM,SAAS,KAAK;AAC1B,YAAM,WAAW,IAAI,YAAY,IAAI,GAAG;AACxC,UAAI,CAAC,YAAY,cAAc,OAAO,SAAS,KAAK,IAAI,GAAG;AACzD,YAAI,YAAY,IAAI,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAGA,MAAI,MAAM,UAAU,SAAS,UAAU,MAAM,UAAU,WAAW,OAAO,GAAG;AAC1E,QAAI;AACJ,QAAI,MAAM,UAAU,KAAM,KAAI,YAAY,IAAI,MAAM,SAAS,IAAI;AAAA,EACnE;AAGA,MAAI,WAAW,QAAS,KAAI;AAC5B,MAAI,MAAM,MAAM,QAAS,KAAI,aAAa,IAAI,MAAM,MAAM,OAAO;AAGjE,MAAI,kBAAkB,KAAK,EAAG,KAAI;AAClC,MAAI,MAAM,YAAY,eAAe,MAAM,YAAY,YAAa,KAAI;AAC1E;AAEO,SAAS,gBAAgB,KAAmC;AACjE,QAAM,0BAA0B,IAAI,kBAAkB,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAClF,QAAM,sBAAsB,IAAI,cAAc,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC1E,QAAM,YAAY,CAAC,GAAG,IAAI,YAAY,OAAO,CAAC,EAAE,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,MAAM,CAAC;AAC1F,SAAO;AAAA,IACL,iBAAiB,IAAI,kBAAkB;AAAA,IACvC,eAAe,IAAI;AAAA,IACnB,mBAAmB,IAAI;AAAA,IACvB,gBAAgB,IAAI;AAAA,IACpB,kBAAkB,IAAI;AAAA,IACtB,WAAW,IAAI;AAAA,IACf,WAAW,IAAI,UAAU;AAAA,IACzB,QAAQ,IAAI,OAAO;AAAA,IACnB,aAAa,IAAI;AAAA,IACjB,cAAc,IAAI;AAAA,IAClB,iBAAiB,IAAI;AAAA,IACrB,kBAAkB,IAAI;AAAA,IACtB,kBAAkB;AAAA,IAClB,uBAAuB,QAAQ,uBAAuB;AAAA,IACtD,uBAAuB,WAAW,yBAAyB,IAAI;AAAA,IAC/D,WAAW,IAAI;AAAA,IACf,gBAAgB,IAAI;AAAA,IACpB,aAAa,IAAI;AAAA,IACjB,mBAAmB,QAAQ,mBAAmB;AAAA,IAC9C,WAAW,IAAI;AAAA,IACf,iBAAiB,IAAI;AAAA,IACrB,YAAY,IAAI;AAAA,IAChB,aAAa,IAAI,YAAY;AAAA,IAC7B,aAAa,IAAI;AAAA,IACjB,cAAc,IAAI,aAAa;AAAA,IAC/B,WAAW,IAAI;AAAA,IACf,aAAa,IAAI;AAAA,IACjB,UAAU,IAAI;AAAA,IACd,eAAe,IAAI;AAAA,IACnB,UAAU,IAAI;AAAA,IACd,kBAAkB,IAAI;AAAA,EACxB;AACF;AAMA,OAAO,eAAe,qBAAqB,WAAW,kBAAkB;AAAA,EACtE,MAAM;AAAE,UAAM,IAAI,MAAM,iFAAiF;AAAA,EAAG;AAAA,EAC5G,IAAgC,MAAgB;AAE9C,WAAO,eAAe,MAAM,kBAAkB,EAAE,OAAO,MAAM,UAAU,OAAO,cAAc,MAAM,CAAC;AAAA,EACrG;AACF,CAAC;AAID,eAAsB,wBAAwB,MAAiC;AAC7E,SAAO,eAAe,IAAI;AAC5B;AAEA,eAAe,eAAe,MAAiC;AAC7D,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAQ,OAAO,cAAqC;AACxD,QAAI;AACJ,QAAI;AAAE,gBAAU,MAAS,YAAQ,WAAW,EAAE,eAAe,KAAK,CAAC;AAAA,IAAG,QAAQ;AAAE;AAAA,IAAQ;AACxF,eAAW,SAAS,SAAS;AAC3B,YAAM,OAAY,WAAK,WAAW,MAAM,IAAI;AAC5C,UAAI,MAAM,YAAY,EAAG,OAAM,MAAM,IAAI;AAAA,eAChC,MAAM,OAAO,KAAK,uBAAuB,KAAK,MAAM,IAAI,EAAG,QAAO,KAAK,IAAI;AAAA,IACtF;AAAA,EACF;AACA,QAAM,MAAM,IAAI;AAChB,SAAO,OAAO,KAAK,qBAAqB;AAC1C;AAIA,SAAS,SAAS,OAAuB,SAAyB;AAChE,QAAM,QAAQ,SAAS,MAAM,cAAc,CAAC,GAAG,OAAO;AACtD,SAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ;AACvE;AAEA,SAAS,WAAW,OAA+B;AACjD,QAAM,QAAQ,OAAO,MAAM,cAAc,CAAC,IAAI;AAC9C,SAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAC1C;AAEA,SAAS,QAAQ,QAA0B;AACzC,SAAO,OAAO,SAAS,OAAO,OAAO,CAAC,KAAK,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,SAAS;AACjF;AAEA,SAAS,WAAW,QAAkB,UAA0B;AAC9D,SAAO,OAAO,SAAS,OAAO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,OAAO,SAAS,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAK;AACtH;AAEA,SAAS,SAAS,OAA+B;AAC/C,SAAO,GAAG,MAAM,MAAM,aAAa,EAAE,KAAK,MAAM,MAAM,aAAa,EAAE,KAAK,MAAM,MAAM,WAAW,EAAE;AACrG;AAIO,SAAS,aAAa,OAA8C;AACzE,MAAI,mCAAmC,KAAK,MAAM,SAAS,EAAG,QAAO;AACrE,MAAI,MAAM,UAAU,SAAS,UAAU,MAAM,UAAU,SAAS,YAAY,uBAAuB,KAAK,MAAM,SAAS,EAAG,QAAO;AACjI,MAAI,+CAA+C,KAAK,MAAM,SAAS,EAAG,QAAO;AACjF,MAAI,mDAAmD,KAAK,MAAM,SAAS,EAAG,QAAO;AACrF,MAAI,kCAAkC,KAAK,MAAM,SAAS,EAAG,QAAO;AACpE,MAAI,8BAA8B,KAAK,MAAM,SAAS,EAAG,QAAO;AAChE,MAAI,gEAAgE,KAAK,MAAM,SAAS,EAAG,QAAO;AAClG,MAAI,wBAAwB,KAAK,MAAM,SAAS,EAAG,QAAO;AAC1D,SAAO;AACT;AAGO,SAAS,kBAAkB,OAAgC;AAChE,MAAI,MAAM,cAAc,0BAA2B,QAAO,MAAM,YAAY,mBAAmB;AAC/F,SAAO,MAAM,cAAc,iBACxB,MAAM,cAAc,uBAAuB,MAAM,YAAY,aAC9D,wFAAwF,KAAK,MAAM,SAAS;AAChH;AAOO,SAAS,aAAa,OAA0H;AACrJ,QAAM,SAA4G,CAAC;AACnH,QAAM,MAAM,CAAC,MAA6B,OAAgB,eAAiD;AACzG,QAAI,OAAO,UAAU,YAAY,MAAO,QAAO,KAAK,EAAE,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,MAAM,WAAW,CAAC;AAAA,EACnG;AACA,MAAI,SAAS,MAAM,YAAY,SAAS,YAAY;AACpD,MAAI,aAAa,MAAM,YAAY,YAAY,UAAU;AACzD,MAAI,mBAAmB,MAAM,YAAY,kBAAkB,UAAU;AACrE,MAAI,WAAW,MAAM,YAAY,WAAW,UAAU;AACtD,MAAI,YAAY,MAAM,YAAY,YAAY,UAAU;AACxD,MAAI,mBAAmB,MAAM,YAAY,WAAW,UAAU;AAC9D,MAAI,mBAAoB,MAAM,YAAY,gBAAwD,YAAY,UAAU;AACxH,MAAI,oBAAoB,MAAM,UAAU,IAAI,UAAU;AAMtD,MAAI,MAAM,cAAc,oBAAoB,MAAM,YAAY,WAAW,0BAA0B;AACjG,UAAM,YAAY,MAAM,WAAW;AACnC,eAAW,YAAY,aAAa,CAAC,GAAG;AACtC,UAAI,OAAO,UAAU,OAAO,SAAU,KAAI,oBAAoB,SAAS,IAAI,UAAU;AAAA,IACvF;AAAA,EACF;AACA,MAAI,MAAM,YAAY,aAAc,KAAI,eAAe,MAAM,YAAY,cAAc,UAAU;AACjG,MAAI,eAAe,MAAM,YAAY,QAAQ,UAAU;AACvD,SAAO;AACT;AAEO,SAAS,QAAQ,OAAuB,OAAgC;AAC7E,MAAI,MAAM,WAAW,MAAM,YAAY,MAAM,QAAS,QAAO;AAC7D,MAAI,MAAM,cAAc,CAAC,MAAM,WAAW,SAAS,MAAM,SAAS,EAAG,QAAO;AAC5E,MAAI,MAAM,aAAa,CAAC,MAAM,WAAW,CAAC,MAAM,SAAS,SAAS,MAAM,OAAO,GAAI,QAAO;AAC1F,QAAM,aAAa,MAAM,cAAc,MAAM;AAC7C,MAAI,MAAM,QAAQ,aAAa,MAAM,QAAQ,MAAM,MAAM,aAAa,MAAM,GAAI,QAAO;AACvF,MAAI,CAAC,MAAM,MAAM,WAAW,MAAM,MAAM,SAAS,KAAK,CAAC,MAAM,MAAM,WAAW,MAAM,MAAM,SAAS,EAAG,QAAO;AAC7G,MAAI,CAAC,MAAM,MAAM,SAAS,MAAM,MAAM,OAAO,KAAK,CAAC,MAAM,MAAM,QAAQ,MAAM,MAAM,MAAM,EAAG,QAAO;AACnG,MAAI,CAAC,MAAM,MAAM,YAAY,MAAM,SAAS,UAAU,KAAK,CAAC,MAAM,MAAM,SAAS,MAAM,SAAS,OAAO,EAAG,QAAO;AACjH,MAAI,CAAC,MAAM,MAAM,SAAS,MAAM,YAAY,OAAO,KAAK,CAAC,MAAM,MAAM,kBAAkB,MAAM,YAAY,gBAAgB,EAAG,QAAO;AACnI,MAAI,CAAC,MAAM,MAAM,WAAW,MAAM,YAAY,SAAS,KAAK,CAAC,MAAM,MAAM,YAAY,MAAM,YAAY,UAAU,EAAG,QAAO;AAC3H,MAAI,CAAC,MAAM,MAAM,cAAc,MAAM,UAAU,IAAI,KAAK,CAAC,MAAM,MAAM,YAAY,MAAM,UAAU,EAAE,EAAG,QAAO;AAC7G,MAAI,MAAM,QAAQC,WAAU,MAAM,UAAU,IAAI,MAAMA,WAAU,MAAM,IAAI,EAAG,QAAO;AACpF,MAAI,MAAM,SAAS,UAAa,CAAC,aAAa,OAAO,MAAM,IAAI,EAAG,QAAO;AACzE,MAAI,MAAM,QAAQ,CAAC,eAAe,MAAM,MAAM,MAAM,IAAI,EAAG,QAAO;AAClE,MAAI,MAAM,cAAc,CAAC,eAAe,MAAM,YAAY,MAAM,UAAU,EAAG,QAAO;AACpF,MAAI,MAAM,QAAQ,CAAC,KAAK,UAAU,KAAK,EAAE,kBAAkB,EAAE,SAAS,MAAM,KAAK,kBAAkB,CAAC,EAAG,QAAO;AAC9G,SAAO;AACT;AAEA,SAAS,MAAS,UAAyB,QAAgC;AAAE,SAAO,aAAa,UAAa,aAAa;AAAQ;AACnI,SAASA,WAAU,OAA+C;AAAE,SAAO,OAAO,WAAW,MAAM,GAAG,EAAE,kBAAkB;AAAG;AAC7H,SAAS,aAAa,OAAuB,MAAuB;AAClE,QAAM,QAAQ,MAAM,UAAU;AAAW,QAAM,MAAM,MAAM,UAAU,WAAW;AAChF,SAAO,UAAU,UAAa,QAAQ,UAAa,QAAQ,SAAS,QAAQ;AAC9E;AACA,SAAS,eAAe,QAA6C,UAA4C;AAC/G,SAAO,QAAQ,UAAU,OAAO,QAAQ,QAAQ,EAAE,MAAM,CAAC,CAAC,KAAK,KAAK,MAAM,UAAU,SAAS,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AACpH;AACA,SAAS,SAAS,OAAgC,KAAsB;AACtE,SAAO,IAAI,MAAM,GAAG,EAAE,OAAgB,CAAC,SAAS,SAAS,WAAW,OAAO,YAAY,WAClF,QAAoC,IAAI,IAAI,QAAW,KAAK;AACnE;AACA,SAAS,UAAU,MAAe,OAAyB;AAAE,SAAO,KAAK,UAAU,IAAI,MAAM,KAAK,UAAU,KAAK;AAAG;AACpH,SAAS,mBACP,QACA,OACA,SACQ;AACR,MAAI,MAAM;AACV,MAAI,OAAO,OAAO;AAClB,SAAO,MAAM,MAAM;AACjB,UAAM,SAAU,MAAM,SAAU;AAChC,QAAI,QAAQ,OAAO,MAAM,GAAI,KAAK,KAAK,EAAG,OAAM,SAAS;AAAA,QACpD,QAAO;AAAA,EACd;AACA,SAAO;AACT;AACO,SAAS,cAAc,GAAmB,GAA2B;AAC1E,SAAO,kBAAkB,GAAG,SAAS,CAAC,CAAC;AACzC;AACA,SAAS,kBAAkB,OAAuB,KAAgC;AAChF,UAAQ,MAAM,cAAc,MAAM,YAAY,cAAc,IAAI,UAAU,KACxE,MAAM,YAAY,cAAc,IAAI,WAAW,KAAK,MAAM,WAAW,IAAI,YACzE,MAAM,QAAQ,cAAc,IAAI,OAAO;AAC3C;AACA,SAAS,SAAS,OAA0C;AAC1D,SAAO;AAAA,IACL,YAAY,MAAM,cAAc,MAAM;AAAA,IACtC,aAAa,MAAM;AAAA,IACnB,UAAU,MAAM;AAAA,IAChB,SAAS,MAAM;AAAA,EACjB;AACF;AACA,SAAS,UAAU,OAA+B;AAChD,QAAM,EAAE,QAAQ,SAAS,OAAO,QAAQ,OAAO,QAAQ,GAAG,QAAQ,IAAI;AACtE,SAAOC,YAAW,QAAQ,EAAE,OAAOC,iBAAgB,OAAO,GAAG,MAAM,EAAE,OAAO,WAAW;AACzF;AACA,SAAS,aAAa,QAAiC;AACrD,SAAO,OAAO,KAAK,KAAK,UAAU,MAAM,GAAG,MAAM,EAAE,SAAS,WAAW;AACzE;AACA,SAAS,aACP,SACA,OACA,WAC6B;AAC7B,MAAI,CAAC,QAAS,QAAO;AACrB,MAAI,QAAQ,SAAS,IAAW,OAAM,IAAI,MAAM,0BAA0B;AAC1E,MAAI;AACF,UAAMC,UAAS,KAAK,MAAM,OAAO,KAAK,SAAS,WAAW,EAAE,SAAS,MAAM,CAAC;AAC5E,QAAI,CAAC,SAASA,OAAM,KAAKA,QAAO,UAAU,SAASA,QAAO,cAAc,WAAW;AACjF,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,WAAOA;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,EACvG;AACF;AACA,SAAS,SAAS,OAA0C;AAC1D,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,SAAS;AACf,QAAM,QAAQ,OAAO;AACrB,MAAI,OAAO,YAAY,KAAM,OAAO,UAAU,SAAS,OAAO,UAAU,UACtE,OAAO,OAAO,cAAc,YAAY,CAAC,SACzC,OAAO,MAAM,eAAe,YAAY,OAAO,MAAM,gBAAgB,YACrE,CAAC,OAAO,cAAc,MAAM,QAAQ,KAAK,OAAO,MAAM,YAAY,YAClE,CAAC,MAAM,QAAQ,OAAO,QAAQ,KAAK,OAAO,SAAS,SAAS,4BAA6B,QAAO;AAElG,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,SAAS,OAAO,UAAU;AACnC,QAAI,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,CAAC,MAAM,MACnD,CAAC,OAAO,cAAc,MAAM,IAAI,KAAK,MAAM,OAAO,KAAK,YAAY,IAAI,MAAM,EAAE,EAAG,QAAO;AAC3F,gBAAY,IAAI,MAAM,EAAE;AAAA,EAC1B;AACA,SAAO;AACT;AACA,eAAe,gBAAgB,OAAmD;AAChF,MAAI,MAAM,SAAS,6BAA6B;AAC9C,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AACA,SAAO,QAAQ,IAAI,MAAM,IAAI,OAAO,SAAS;AAC3C,QAAI,OAAO;AACX,QAAI;AAAE,cAAQ,MAAS,SAAK,IAAI,GAAG;AAAA,IAAM,QAAQ;AAAA,IAAyC;AAC1F,WAAO,EAAE,MAAM,IAAI,OAAO,IAAI,GAAG,KAAK;AAAA,EACxC,CAAC,CAAC;AACJ;AACA,eAAe,qBACb,OACA,UACyB;AACzB,QAAM,eAAe,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC;AACtE,SAAO,QAAQ,IAAI,SAAS,IAAI,OAAO,UAAU;AAC/C,UAAM,OAAO,aAAa,IAAI,MAAM,EAAE;AACtC,QAAI,CAAC,KAAM,OAAM,IAAI,MAAM,uCAAuC;AAClE,QAAI;AACJ,QAAI;AAAE,qBAAe,MAAS,SAAK,IAAI,GAAG;AAAA,IAAM,QAAQ;AAAE,YAAM,IAAI,MAAM,uCAAuC;AAAA,IAAG;AACpH,QAAI,cAAc,MAAM,KAAM,OAAM,IAAI,MAAM,uCAAuC;AACrF,WAAO,EAAE,MAAM,GAAG,MAAM;AAAA,EAC1B,CAAC,CAAC;AACJ;AACA,SAAS,OAAO,MAAsB;AACpC,SAAOF,YAAW,QAAQ,EAAE,OAAY,cAAQ,IAAI,GAAG,MAAM,EAAE,OAAO,WAAW;AACnF;AACA,SAASC,iBAAgB,OAAwB;AAC/C,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,KAAK;AAC5E,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,IAAI,MAAM,IAAIA,gBAAe,EAAE,KAAK,GAAG,CAAC;AACzE,QAAM,SAAS;AACf,SAAO,IAAI,OAAO,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,CAAC,IAAIA,iBAAgB,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC;AACxH;AACA,SAAS,iBAAiB,OAAyC;AACjE,MAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS,MAAM,KAAK,KAAK,CAAC,SAAS,MAAM,WAAW,EAAG,QAAO;AACvF,SAAO,MAAM,kBAAkB,KAC7B,OAAO,MAAM,YAAY,YAAY,OAAO,MAAM,cAAc,YAChE,OAAO,MAAM,eAAe,YAAY,OAAO,MAAM,eAAe,YACpE,OAAO,MAAM,gBAAgB,YAAY,OAAO,cAAc,MAAM,QAAQ,KAC3E,MAAM,YAAuB,KAAK,OAAO,MAAM,iBAAiB,YACjE,OAAO,MAAM,SAAS,YAAY,OAAO,MAAM,MAAM,mBAAmB,YACxE,OAAO,MAAM,MAAM,cAAc,YAAY,gBAAgB,MAAM,OAAO;AAAA,IACxE;AAAA,IAAa;AAAA,IAAgB;AAAA,IAAe;AAAA,IAAc;AAAA,IAAa;AAAA,IACvE;AAAA,IAAe;AAAA,IAAW;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,EAC1D,CAAC,KAAK,OAAO,MAAM,YAAY,YAAY,YAC3C,OAAO,MAAM,YAAY,WAAW,YAAY,gBAAgB,MAAM,aAAa;AAAA,IACjF;AAAA,IAAgB;AAAA,IAAoB;AAAA,IAAa;AAAA,EACnD,CAAC,KAAK,UAAU,MAAM,OAAO,KAAK,WAAW,MAAM,QAAQ,MAC1D,MAAM,eAAe,UAAa,SAAS,MAAM,UAAU,OAC3D,MAAM,SAAS,UAAa,eAAe,MAAM,IAAI;AAC1D;AACA,SAAS,UAAU,OAAyB;AAC1C,SAAO,UAAU,UAAa,SAAS,KAAK,KAC1C,gBAAgB,OAAO,CAAC,cAAc,WAAW,eAAe,CAAC,KACjE,sBAAsB,OAAO,CAAC,aAAa,iBAAiB,CAAC;AACjE;AACA,SAAS,WAAW,OAAyB;AAC3C,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,SAAS,KAAK,KAAK,CAAC;AAAA,IAAC;AAAA,IAAQ;AAAA,IAAU;AAAA,IAAU;AAAA,IAAQ;AAAA,IAAU;AAAA,IACtE;AAAA,IAAW;AAAA,IAAY;AAAA,EAAO,EAAE,SAAS,OAAO,MAAM,IAAI,CAAC,KAAK,OAAO,MAAM,OAAO,SAAU,QAAO;AACvG,SAAO,gBAAgB,OAAO,CAAC,QAAQ,qBAAqB,kBAAkB,CAAC,KAC7E,sBAAsB,OAAO,CAAC,aAAa,SAAS,CAAC;AACzD;AACA,SAAS,gBAAgB,OAAgC,MAAkC;AACzF,SAAO,KAAK,MAAM,CAAC,QAAQ,MAAM,GAAG,MAAM,UAAa,OAAO,MAAM,GAAG,MAAM,QAAQ;AACvF;AACA,SAAS,sBAAsB,OAAgC,MAAkC;AAC/F,SAAO,KAAK,MAAM,CAAC,QAAQ,MAAM,GAAG,MAAM,UAAa,OAAO,MAAM,GAAG,MAAM,YAAY,OAAO,SAAS,MAAM,GAAG,CAAC,CAAC;AACtH;AACA,SAAS,eAAe,OAAiD;AACvE,SAAO,SAAS,KAAK,KAAK,OAAO,OAAO,KAAK,EAAE,MAAM,CAAC,UAAU,OAAO,UAAU,QAAQ;AAC3F;AACA,SAAS,SAAS,OAAkD;AAClE,SAAO,QAAQ,SAAS,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK,CAAC;AAC5E;AACO,SAAS,WAAW,OAAuB,OAA2C;AAC3F,QAAM,SAAqD;AAAA,IACzD,WAAW,MAAM;AAAA,IAAW,SAAS,MAAM;AAAA,IAAS,WAAW,MAAM,MAAM;AAAA,IAC3E,WAAW,MAAM,MAAM;AAAA,IAAW,SAAS,MAAM,MAAM;AAAA,IAAS,QAAQ,MAAM,MAAM;AAAA,IACpF,YAAY,MAAM,SAAS;AAAA,IAAY,SAAS,MAAM,SAAS;AAAA,IAC/D,cAAc,MAAM,UAAU;AAAA,IAAM,cAAc,MAAM,UAAU;AAAA,IAClE,YAAY,MAAM,YAAY;AAAA,EAChC;AACA,SAAO,OAAO,KAAK;AACrB;;;AFh2BA,IAAM,iBAAiB;AACvB,IAAM,mBAAmB,OAAO;AAChC,IAAM,iBAAwD;AAAA,EAC5D,KAAK;AAAA,EAAG,OAAO;AAAA,EAAG,MAAM;AAAA,EAAG,MAAM;AAAA,EAAG,QAAQ;AAAA,EAAG,MAAM;AAAA,EAAG,UAAU;AAAA,EAAG,SAAS;AAAA,EAAG,SAAS;AAC5F;AAiEA,IAAI;AAEJ,SAAS,mBAAwC;AAC/C,MAAI,KAAM,QAAO;AACjB,MAAI,SAAS,KAAM,OAAM,IAAI,MAAM,4CAA4C;AAC/E,MAAI;AACF,WAAO;AAAA,MACL,MAAO,cAAc,YAAY,GAAG,EAAE,aAAa,EAAmC;AAAA,IACxF;AACA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,WAAO;AACP,UAAM,IAAI;AAAA,MACR,iFACG,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,IAC1D;AAAA,EACF;AACF;AAcO,IAAM,wBAAN,MAAM,uBAAsB;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,WAAmB;AACrC,SAAK,YAAiB,cAAQ,SAAS;AACvC,SAAK,SAAc,WAAK,KAAK,WAAW,YAAY;AACpD,UAAM,WAAW,iBAAiB;AAClC,SAAK,KAAK,IAAI,SAAS,KAAK,MAAM;AAClC,SAAK,GAAG,KAAK,2BAA2B;AACxC,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,OAAO,KAAKE,qBAAmD;AAC7D,WAAO,IAAI,uBAAsBA,mBAAkB;AAAA,EACrD;AAAA,EAEA,QAAc;AACZ,SAAK,GAAG,MAAM;AAAA,EAChB;AAAA;AAAA;AAAA,EAIA,MAAM,UAAkD;AACtD,UAAM,SAAwC;AAAA,MAC5C,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,aAAa;AAAA,MACb,cAAc;AAAA,IAChB;AACA,UAAM,aAAa,KAAK,QAAQ,YAAY;AAC1C,YAAM,QAAQ,MAAM,wBAAwB,KAAK,SAAS;AAC1D,YAAM,UAAU,KAAK,YAAY;AACjC,iBAAW,QAAQ,OAAO;AACxB,cAAM,MAAM,aAAkB,eAAS,KAAK,WAAW,IAAI,CAAC;AAC5D,cAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AACrC,cAAM,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK,UAAU,MAAM;AAClE,YAAI,SAAU,QAAO;AAAA,MACvB;AACA,WAAK,aAAa,KAAK;AAAA,IACzB,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,cAAc,UAA0C,CAAC,GAAgC;AACvF,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAmB,CAAC;AAC1B,QAAI,QAAQ,MAAM;AAChB,cAAQ,KAAK,UAAU;AACvB,aAAO,KAAK,QAAQ,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,IACvC;AACA,QAAI,QAAQ,IAAI;AACd,cAAQ,KAAK,UAAU;AACvB,aAAO,KAAK,QAAQ,GAAG,MAAM,GAAG,EAAE,CAAC;AAAA,IACrC;AACA,UAAM,QAAQ,QAAQ,SAAS,IAAI,UAAU,QAAQ,KAAK,OAAO,CAAC,KAAK;AACvE,UAAM,OAAO,KAAK,GACf;AAAA,MACC;AAAA;AAAA;AAAA,4BAGoB,KAAK;AAAA,IAC3B,EACC,IAAI,GAAG,MAAM;AAChB,WAAO,KAAK,IAAI,CAAC,SAAS;AAAA,MACxB,KAAK,OAAO,IAAI,GAAG;AAAA,MACnB,YAAY,OAAO,IAAI,WAAW;AAAA,MAClC,SAAS,OAAO,IAAI,QAAQ;AAAA,MAC5B,UAAU,OAAO,IAAI,QAAQ;AAAA,MAC7B,WAAW,OAAO,IAAI,SAAS;AAAA,MAC/B,QAAQ,OAAO,IAAI,MAAM;AAAA,MACzB,SAAS,OAAO,IAAI,OAAO;AAAA,MAC3B,WAAW,OAAO,IAAI,SAAS;AAAA,MAC/B,aAAa,OAAO,IAAI,YAAY;AAAA,MACpC,cAAc,OAAO,IAAI,aAAa;AAAA,MACtC,iBAAiB,OAAO,IAAI,iBAAiB;AAAA,MAC7C,kBAAkB,OAAO,IAAI,kBAAkB;AAAA,MAC/C,eACE,OAAO,IAAI,cAAc,IAAI,IACzB,OAAO,IAAI,iBAAiB,IAAI,OAAO,IAAI,cAAc,IACzD;AAAA,MACN,eAAe,OAAO,IAAI,eAAe;AAAA,IAC3C,EAAE;AAAA,EACJ;AAAA,EAEA,aACE,UAMI,CAAC,GACsB;AAC3B,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAiC,CAAC;AACxC,QAAI,QAAQ,OAAO;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,KAAK,QAAQ,KAAK;AAAA,IAC3B;AACA,QAAI,QAAQ,SAAS;AACnB,cAAQ,KAAK,gBAAgB;AAC7B,aAAO,KAAK,QAAQ,OAAO;AAAA,IAC7B;AACA,QAAI,QAAQ,WAAW;AACrB,cAAQ,KAAK,kBAAkB;AAC/B,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,cAAc;AAC3B,aAAO,KAAK,QAAQ,MAAM;AAAA,IAC5B;AACA,UAAM,QAAQ,QAAQ,SAAS,IAAI,UAAU,QAAQ,KAAK,OAAO,CAAC,KAAK;AACvE,WAAO,KAAK,WAAW,QAAQ,OAAO,GAAG,CAAC;AAC1C,UAAM,OAAO,KAAK,GACf;AAAA,MACC;AAAA,6BACqB,KAAK;AAAA;AAAA,IAE5B,EACC,IAAI,GAAG,MAAM;AAChB,WAAO,KAAK,IAAI,CAAC,SAAS;AAAA,MACxB,QAAQ,OAAO,IAAI,OAAO;AAAA,MAC1B,OAAO,OAAO,IAAI,MAAM;AAAA,MACxB,SAAS,OAAO,IAAI,QAAQ;AAAA,MAC5B,WAAW,OAAO,IAAI,UAAU;AAAA,MAChC,SAAS,OAAO,IAAI,QAAQ;AAAA,MAC5B,QAAQ,OAAO,IAAI,MAAM;AAAA,MACzB,WAAW,IAAI,eAAe,OAAO,OAAO,OAAO,IAAI,UAAU;AAAA,MACjE,SAAS,IAAI,aAAa,OAAO,OAAO,OAAO,IAAI,QAAQ;AAAA,MAC3D,YAAY,IAAI,gBAAgB,OAAO,OAAO,OAAO,IAAI,WAAW;AAAA,MACpE,SAAS,OAAO,IAAI,OAAO;AAAA,MAC3B,sBAAsB,OAAO,IAAI,qBAAqB;AAAA,MACtD,cAAc,OAAO,IAAI,aAAa;AAAA,IACxC,EAAE;AAAA,EACJ;AAAA,EAEA,YACE,UAQI,CAAC,GACsB;AAC3B,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAiC,CAAC;AACxC,QAAI,QAAQ,MAAM;AAChB,cAAQ,KAAK,cAAc;AAC3B,aAAO,KAAK,iBAAiB,QAAQ,IAAI,CAAC;AAAA,IAC5C;AACA,QAAI,QAAQ,OAAO;AACjB,YAAM,WAAW,CAAC,GAAG,IAAI,IAAI,QAAQ,MAAM,IAAI,gBAAgB,CAAC,CAAC;AACjE,UAAI,SAAS,WAAW,EAAG,QAAO,CAAC;AACnC,cAAQ,KAAK,gBAAgB,SAAS,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AACjE,aAAO,KAAK,GAAG,QAAQ;AAAA,IACzB;AACA,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,aAAa;AAC1B,aAAO,KAAK,QAAQ,MAAM;AAAA,IAC5B;AACA,QAAI,QAAQ,SAAS;AACnB,cAAQ,KAAK,cAAc;AAC3B,aAAO,KAAK,QAAQ,OAAO;AAAA,IAC7B;AACA,QAAI,QAAQ,WAAW;AACrB,cAAQ,KAAK,gBAAgB;AAC7B,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,UAAM,QAAQ,QAAQ,SAAS,IAAI,UAAU,QAAQ,KAAK,OAAO,CAAC,KAAK;AACvE,WAAO,KAAK,WAAW,QAAQ,OAAO,GAAG,CAAC;AAC1C,UAAM,aACJ;AAAA;AAEF,UAAM,MAAM,QAAQ,gBAChB,UAAU,UAAU;AAAA,oBACR,UAAU;AAAA;AAAA;AAAA,8BAGA,KAAK;AAAA,oEAE3B,UAAU,UAAU;AAAA,4BACA,KAAK;AAC7B,UAAM,OAAO,KAAK,GACf,QAAQ,GAAG,EACX,IAAI,GAAG,MAAM;AAChB,WAAO,KAAK,IAAI,CAAC,SAAS;AAAA,MACxB,MAAM,IAAI;AAAA,MACV,WAAW,IAAI;AAAA,MACf,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,QAAQ,IAAI;AAAA,MACZ,SAAS,IAAI;AAAA,MACb,OAAO,IAAI;AAAA,MACX,UAAU,IAAI;AAAA,MACd,YAAY,IAAI;AAAA,MAChB,SAAS,IAAI;AAAA,MACb,QAAQ,IAAI;AAAA,IACd,EAAE;AAAA,EACJ;AAAA,EAEA,UAAmC;AACjC,UAAM,WAAW,KAAK,GACnB;AAAA,MACC;AAAA,IACF,EACC,IAAI;AACP,UAAM,QAAgC,CAAC;AACvC,eAAW,OAAO,KAAK,GACpB,QAAQ,8DAA8D,EACtE,IAAI,GAA2C;AAChD,YAAM,IAAI,MAAM,IAAI,OAAO,IAAI,CAAC;AAAA,IAClC;AACA,UAAM,QAAQ,KAAK,GAChB,QAAQ,6DAA6D,EACrE,IAAI;AACP,UAAM,OAAO,KAAK,GAAG,QAAQ,gDAAgD,EAAE,IAAI;AAGnF,UAAM,WAAW,OAAO,SAAS,CAAC,IAAI,OAAO,SAAS,CAAC;AACvD,WAAO;AAAA,MACL,WAAW;AAAA,QACT,UAAU,OAAO,SAAS,CAAC;AAAA,QAC3B,WAAW,OAAO,SAAS,CAAC;AAAA,QAC5B,QAAQ,OAAO,SAAS,CAAC;AAAA,QACzB,aAAa,WAAW,IAAI,OAAO,SAAS,CAAC,IAAI,WAAW;AAAA,MAC9D;AAAA,MACA;AAAA,MACA,OAAO,EAAE,WAAW,OAAO,MAAM,CAAC,GAAG,aAAa,OAAO,MAAM,CAAC,EAAE;AAAA,MAClE,kBAAkB,OAAO,KAAK,CAAC;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAe,UAA0C,CAAC,GAAqB;AAC7E,UAAM,UAAU,QAAQ,MAAM,MAAM,GAAG,EAAE;AACzC,UAAM,QAAQ,QAAQ,IAAI,MAAM,GAAG,EAAE;AACrC,UAAM,YAAY,CAAC,WAAwD;AACzE,YAAM,UAAoB,CAAC;AAC3B,YAAM,SAAmB,CAAC;AAC1B,UAAI,SAAS;AAAE,gBAAQ,KAAK,GAAG,MAAM,OAAO;AAAG,eAAO,KAAK,OAAO;AAAA,MAAG;AACrE,UAAI,OAAO;AAAE,gBAAQ,KAAK,GAAG,MAAM,OAAO;AAAG,eAAO,KAAK,KAAK;AAAA,MAAG;AACjE,aAAO,EAAE,OAAO,QAAQ,SAAS,IAAI,UAAU,QAAQ,KAAK,OAAO,CAAC,KAAK,IAAI,OAAO;AAAA,IACtF;AAEA,UAAM,gBAAgB,UAAU,KAAK;AACrC,UAAM,WAAW,KAAK,GACnB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAOoB,cAAc,KAAK;AAAA,IACzC,EACC,IAAI,GAAG,cAAc,MAAM;AAE9B,UAAM,eAAe,UAAU,KAAK;AACpC,UAAM,WAAW,KAAK,GACnB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAOoB,aAAa,KAAK;AAAA,IACxC,EACC,IAAI,GAAG,aAAa,MAAM;AAE7B,UAAM,cAAc,UAAU,KAAK;AACnC,UAAM,aAAa,KAAK,GACrB,QAAQ,wDAAwD,YAAY,KAAK,EAAE,EACnF,IAAI,GAAG,YAAY,MAAM;AAC5B,UAAM,WAAW,EAAE,GAAG,eAAe;AACrC,UAAM,mBAAmB,EAAE,GAAG,eAAe;AAC7C,eAAW,OAAO,YAAY;AAC5B,YAAM,SAAS,IAAI;AACnB,eAAS,MAAM,IAAI,OAAO,IAAI,KAAK;AACnC,uBAAiB,MAAM,IAAI,OAAO,IAAI,aAAa;AAAA,IACrD;AAEA,UAAM,aAAa,UAAU,KAAK;AAClC,UAAM,eACJ,KAAK,GAAG,QAAQ,qDAAqD,WAAW,KAAK,EAAE,EAAE,IAAI,GAAG,WAAW,MAAM,EACjH;AACF,UAAM,eAAe,UAAU,KAAK;AACpC,UAAM,kBACJ,KAAK,GAAG,QAAQ,yEAAyE,aAAa,KAAK,EAAE,EAAE,IAAI,GAAG,aAAa,MAAM,EACzI;AACF,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,cACJ,KAAK,GAAG,QAAQ,yDAAyD,UAAU,KAAK,EAAE,EAAE,IAAI,GAAG,UAAU,MAAM,EACnH;AACF,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,OACJ,KAAK,GAAG,QAAQ,iDAAiD,UAAU,KAAK,EAAE,EAAE,IAAI,GAAG,UAAU,MAAM,EAC3G;AAEF,WAAO;AAAA,MACL,iBAAiB,OAAO,eAAe;AAAA,MACvC,eAAe,OAAO,SAAS,QAAQ;AAAA,MACvC,mBAAmB,OAAO,SAAS,SAAS;AAAA,MAC5C,gBAAgB,OAAO,SAAS,MAAM;AAAA,MACtC,kBAAkB,OAAO,SAAS,OAAO;AAAA,MACzC,WAAW,OAAO,SAAS,SAAS;AAAA,MACpC,WAAW,OAAO,SAAS,SAAS;AAAA,MACpC,QAAQ,OAAO,SAAS,MAAM;AAAA,MAC9B,aAAa,OAAO,SAAS,WAAW;AAAA,MACxC,cAAc,OAAO,SAAS,YAAY;AAAA,MAC1C,iBAAiB,OAAO,SAAS,eAAe;AAAA,MAChD,kBAAkB,OAAO,SAAS,gBAAgB;AAAA,MAClD,kBAAkB,OAAO,IAAI;AAAA,MAC7B,uBAAuB,OAAO,SAAS,aAAa,IAAI,IAAI,OAAO,SAAS,aAAa,IAAI,OAAO,SAAS,aAAa,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,MAK9H,uBAAuB,OAAO,SAAS,WAAW;AAAA,MAClD,WAAW,OAAO,SAAS,SAAS;AAAA,MACpC,gBAAgB,OAAO,SAAS,cAAc;AAAA,MAC9C,aAAa,OAAO,SAAS,WAAW;AAAA,MACxC,mBAAmB,OAAO,SAAS,iBAAiB,IAAI,IAAI,OAAO,SAAS,iBAAiB,IAAI,OAAO,SAAS,iBAAiB,IAAI;AAAA,MACtI,WAAW,OAAO,SAAS,SAAS;AAAA,MACpC,iBAAiB,OAAO,SAAS,eAAe;AAAA,MAChD,YAAY,OAAO,SAAS,UAAU;AAAA,MACtC,aAAa,OAAO,WAAW;AAAA,MAC/B,aAAa,OAAO,SAAS,WAAW;AAAA,MACxC,cAAc,OAAO,YAAY;AAAA,MACjC,WAAW,OAAO,SAAS,SAAS;AAAA,MACpC,aAAa,OAAO,SAAS,WAAW;AAAA,MACxC,UAAU,OAAO,SAAS,QAAQ;AAAA,MAClC,eAAe,OAAO,SAAS,aAAa;AAAA,MAC5C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIQ,eAAqB;AAC3B,UAAM,UAAW,KAAK,GAAG,QAAQ,qBAAqB,EAAE,IAAI,EACzD;AACH,QAAI,YAAY,KAAK,YAAY,gBAAgB;AAE/C,WAAK,GAAG;AAAA,QACN;AAAA,MAKF;AAAA,IACF;AACA,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8BA6Fa,cAAc;AAAA,KACvC;AAAA,EACH;AAAA,EAEQ,cAAmC;AACzC,UAAM,OAAO,KAAK,GAAG,QAAQ,sCAAsC,EAAE,IAAI;AAIzE,WAAO,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC;AAAA,EACjE;AAAA,EAEQ,aAAa,eAA+B;AAClD,UAAM,OAAO,IAAI;AAAA,MACf,cAAc,IAAI,CAAC,SAAS,aAAkB,eAAS,KAAK,WAAW,IAAI,CAAC,CAAC;AAAA,IAC/E;AACA,eAAW,OAAO,KAAK,GAAG,QAAQ,+BAA+B,EAAE,IAAI,GAEnE;AACF,UAAI,CAAC,KAAK,IAAI,IAAI,IAAI;AACpB,aAAK,GAAG,QAAQ,yCAAyC,EAAE,IAAI,IAAI,IAAI;AAAA,IAC3E;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WACZ,MACA,KACA,UACA,QACkB;AAClB,QAAI;AACJ,QAAI;AACF,eAAS,MAAS,SAAK,MAAM,GAAG;AAAA,IAClC,QAAQ;AACN,aAAO;AAAA,IACT;AACA,QAAI;AACF,YAAM,QAAQ,MAAM,OAAO,KAAK,GAAG;AACnC,UAAI,QAAQ,SAAU,QAAO;AAC7B,UAAI,WAAW;AACf,UAAI,YAAY,OAAO,MAAM,CAAC;AAC9B,UAAI,WAAW;AACf,WAAK,GAAG,KAAK,OAAO;AACpB,UAAI;AACF,eAAO,WAAW,MAAM;AACtB,gBAAM,SAAS,KAAK,IAAI,kBAAkB,OAAO,QAAQ;AACzD,gBAAM,SAAS,OAAO,YAAY,MAAM;AACxC,gBAAM,EAAE,UAAU,IAAI,MAAM,OAAO,KAAK,QAAQ,GAAG,QAAQ,QAAQ;AACnE,cAAI,aAAa,EAAG;AACpB,sBAAY;AACZ,gBAAM,OACJ,UAAU,SAAS,IACf,OAAO,OAAO,CAAC,WAAW,OAAO,SAAS,GAAG,SAAS,CAAC,CAAC,IACxD,OAAO,SAAS,GAAG,SAAS;AAClC,gBAAM,cAAc,KAAK,YAAY,EAAI;AACzC,cAAI,cAAc,GAAG;AACnB,wBAAY,OAAO,KAAK,IAAI;AAC5B;AAAA,UACF;AAGA,qBAAW,QAAQ,KAAK,SAAS,GAAG,WAAW,EAAE,SAAS,MAAM,EAAE,MAAM,IAAI,GAAG;AAC7E,kBAAM,UAAU,KAAK,KAAK;AAC1B,gBAAI,CAAC,QAAS;AACd,gBAAI;AACF,mBAAK,YAAY,KAAK,MAAM,OAAO,CAAmB;AACtD,qBAAO;AAAA,YACT,QAAQ;AACN,qBAAO;AAAA,YACT;AAAA,UACF;AAGA,sBAAY,cAAc;AAC1B,sBAAY,OAAO,KAAK,KAAK,SAAS,cAAc,CAAC,CAAC;AAAA,QACxD;AACA,aAAK,GACF;AAAA,UACC;AAAA,QAEF,EACC,IAAI,KAAK,QAAQ;AACpB,aAAK,GAAG,KAAK,QAAQ;AAAA,MACvB,SAAS,OAAO;AACd,aAAK,GAAG,KAAK,UAAU;AACvB,cAAM;AAAA,MACR;AACA,aAAO,iBAAiB,WAAW;AACnC,aAAO,WAAW;AAAA,IACpB,UAAE;AACA,YAAM,OAAO,MAAM;AAAA,IACrB;AAAA,EACF;AAAA,EAEQ,YAAY,OAA6B;AAC/C,QAAI,OAAO,OAAO,cAAc,YAAY,CAAC,MAAM,MAAO;AAC1D,SAAK,oBAAoB,KAAK;AAC9B,UAAM,OAAO,MAAM;AACnB,QAAI,KAAK,WAAW,mBAAmB,KAAK,SAAS,qBAAqB;AACxE,WAAK,eAAe,KAAK;AAAA,IAC3B,WAAW,SAAS,mBAAmB;AACrC,WAAK,gBAAgB,KAAK;AAAA,IAC5B,WAAW,qCAAqC,KAAK,IAAI,GAAG;AAC1D,WAAK,WAAW,KAAK;AAAA,IACvB,WAAW,SAAS,gBAAgB,6BAA6B,KAAK,IAAI,GAAG;AAC3E,WAAK,gBAAgB,KAAK;AAAA,IAC5B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,OAA6B;AACvD,UAAM,MAAM,SAAS,KAAK;AAC1B,SAAK,GAAG,QAAQ,uDAAuD,EAAE,IAAI,GAAG;AAChF,UAAM,OAAO,CAAC,QAAgB,WAC5B,KAAK,GAAG,QAAQ,6BAA6B,GAAG,gBAAgB,EAAE,IAAI,GAAG,QAAQ,GAAG;AAEtF,UAAM,SAAS,aAAa,KAAK;AACjC,UAAM,SAAS,kBAAkB,KAAK,IAAI,IAAI;AAC9C,SAAK,GACF;AAAA,MACC;AAAA;AAAA,IAEF,EACC,IAAI,KAAK,QAAQ,MAAM;AAC1B,QAAI,OAAQ,MAAK,yBAAyB;AAC1C,QAAI,MAAM,YAAY,eAAe,MAAM,YAAY,YAAa,MAAK,mCAAmC;AAC5G,QAAI,WAAW,QAAS,MAAK,iCAAiC;AAE9D,QAAI,MAAM,YAAY,kBAAkB;AACtC,WAAK,GACF,QAAQ,qFAAqF,EAC7F,IAAI,KAAK,MAAM,YAAY,gBAAgB;AAAA,IAChD;AACA,QAAI,MAAM,MAAM,SAAS;AACvB,WAAK,GAAG,QAAQ,iEAAiE,EAAE,IAAI,KAAK,MAAM,MAAM,OAAO;AAAA,IACjH;AAEA,UAAM,OAAO,MAAM;AACnB,QAAI,SAAS,qBAAsB,MAAK,2BAA2B;AAAA,aAC1D,SAAS,qBAAsB,MAAK,+BAA+B;AAAA,aACnE,SAAS,eAAgB,MAAK,6BAA6B;AAAA,aAC3D,SAAS,mBAAmB,SAAS,eAAe;AAC3D,YAAM,MAAMC,YAAW,KAAK;AAC5B,YAAM,gBAAgB,MAAM,IAAI,IAAI;AACpC;AAAA,QACE,GAAG,SAAS,kBAAkB,oBAAoB,cAAc,MAAM,SAAS,kBAAkB,oBAAoB,cAAc;AAAA;AAAA,QAEnI;AAAA,QAAK;AAAA,QAAK;AAAA,MACZ;AAAA,IACF,WAAW,SAAS,kBAAmB,MAAK,2BAA2B;AAAA,aAC9D,SAAS,uBAAuB,MAAM,YAAY,UAAW,MAAK,yCAAyC;AAEpH,QAAI,MAAM,UAAU,SAAS,UAAU,KAAK,WAAW,OAAO,GAAG;AAC/D,WAAK,uCAAuC;AAC5C,UAAI,MAAM,UAAU,MAAM;AACxB,aAAK,GACF,QAAQ,qEAAqE,EAC7E,IAAI,KAAK,iBAAiB,MAAM,SAAS,IAAI,CAAC;AAAA,MACnD;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,eAAe,OAA6B;AAClD,UAAM,MAAM,SAAS,KAAK;AAI1B,UAAM,aACJ,MAAM,SAAS,cAAc,SAASC,UAAS,MAAM,cAAc,CAAC,GAAG,iBAAiB,CAAC,KAAK;AAChG,UAAM,UACJ,MAAM,SAAS,WAAW,SAASA,UAAS,MAAM,cAAc,CAAC,GAAG,YAAY,CAAC,KAAK;AAExF,QAAI,CAAC,cAAc,CAAC,QAAS;AAC7B,SAAK,GACF,QAAQ,oFAAoF,EAC5F,IAAI,KAAK,YAAY,OAAO;AAC/B,UAAM,SAAS,CAAC,QAAgB,WAC9B,KAAK,GACF;AAAA,MACC,6BAA6B,GAAG;AAAA,IAClC,EACC,IAAI,GAAG,QAAQ,KAAK,YAAY,OAAO;AAC5C,UAAM,WAAWD,YAAW,KAAK;AACjC,YAAQ,MAAM,WAAW;AAAA,MACvB,KAAK;AACH,eAAO,yBAAyB;AAChC;AAAA,MACF,KAAK;AACH;AAAA,UACE;AAAA,UAIAE,UAAS,OAAO,aAAa;AAAA,UAC7BA,UAAS,OAAO,cAAc;AAAA,UAC9BA,UAAS,OAAO,iBAAiB;AAAA,UACjCA,UAAS,OAAO,kBAAkB;AAAA,UAClC;AAAA,UACA;AAAA,UACA,WAAW,IAAI,IAAI;AAAA,QACrB;AACA;AAAA,MACF,KAAK;AACH;AAAA,UACE;AAAA,UAEA,MAAM,YAAY,mBAAmB,OAAO,IAAI;AAAA,UAChD;AAAA,UACA;AAAA,UACA,WAAW,IAAI,IAAI;AAAA,QACrB;AACA;AAAA,MACF,KAAK;AACH,eAAO,2BAA2B;AAClC;AAAA,MACF;AACE;AAAA,IACJ;AAAA,EACF;AAAA,EAEQ,gBAAgB,OAA6B;AACnD,UAAM,OAAOD,UAAS,MAAM,cAAc,CAAC,GAAG,YAAY;AAC1D,QAAI,OAAO,SAAS,YAAY,CAAC,OAAO,SAAS,IAAI,EAAG;AACxD,UAAME,YAAW,GAAG,MAAM,MAAM,aAAa,EAAE,KAAK,MAAM,MAAM,aAAa,EAAE,KAAK,MAAM,MAAM,WAAW,EAAE;AAC7G,UAAM,aAAa,MAAM,cAAc,MAAM;AAE7C,SAAK,GACF;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMF,EACC,IAAIA,WAAU,SAAS,KAAK,GAAG,YAAY,MAAM,UAAU,IAAI;AAAA,EACpE;AAAA,EAEQ,WAAW,OAA6B;AAC9C,UAAM,aAAa,MAAM,cAAc,CAAC;AACxC,UAAM,SAAS,MAAM,MAAM,UAAU,SAAS,YAAY,QAAQ;AAClE,QAAI,CAAC,OAAQ;AACb,UAAM,aAAa,MAAM,cAAc,MAAM;AAC7C,SAAK,GAAG,QAAQ,0DAA0D,EAAE,IAAI,MAAM;AACtF,UAAM,MAAM,CAAC,QAAgB,WAC3B,KAAK,GAAG,QAAQ,4BAA4B,GAAG,oBAAoB,EAAE,IAAI,GAAG,QAAQ,MAAM;AAE5F,UAAM,UAA+C;AAAA,MACnD,CAAC,UAAU,SAAS,YAAY,OAAO,CAAC;AAAA,MACxC,CAAC,YAAY,MAAM,MAAM,iBAAiB,SAAS,YAAY,SAAS,CAAC;AAAA,MACzE,CAAC,cAAc,MAAM,MAAM,SAAS;AAAA,MACpC,CAAC,YAAY,MAAM,MAAM,WAAW,SAAS,YAAY,YAAY,CAAC;AAAA,IACxE;AACA,eAAW,CAAC,QAAQ,KAAK,KAAK,SAAS;AACrC,UAAI,MAAO,KAAI,GAAG,MAAM,QAAQ,KAAK;AAAA,IACvC;AACA,UAAM,OAAO,MAAM,UAAU,QAAQ,sCAAsC,EAAE;AAC7E,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,YAAI,4DAA4D,UAAU;AAC1E;AAAA,MACF,KAAK;AACH;AAAA,UACE;AAAA,UACA;AAAA,UACA,iBAAiB,OAAO,UAAU;AAAA,QACpC;AACA;AAAA,MACF,KAAK;AACH,YAAI,mCAAmC,UAAU;AACjD;AAAA,MACF,KAAK;AACH,YAAI,uBAAuB;AAC3B;AAAA,MACF,KAAK;AACH,YAAI,mDAAmD;AACvD;AAAA,MACF,KAAK;AACH,YAAI,mBAAmB;AACvB;AAAA,MACF,KAAK;AACH,YAAI,qBAAqB;AACzB;AAAA,MACF;AACE;AAAA,IACJ;AAAA,EACF;AAAA,EAEQ,gBAAgB,OAA6B;AACnD,UAAM,aAAa,MAAM,cAAc,CAAC;AACxC,UAAM,YAAY,SAAS,YAAY,WAAW,KAAK;AACvD,QAAI,CAAC,aAAa,cAAc,OAAQ;AACxC,UAAM,WAAW,MAAM,UAAU,QAAQ,SAAS,YAAY,UAAU;AACxE,QAAI,CAAC,SAAU;AACf,SAAK,GACF;AAAA,MACC;AAAA;AAAA;AAAA;AAAA,IAIF,EACC;AAAA,MACC,MAAM;AAAA,MACN,aAAa,QAAQ;AAAA,MACrB,iBAAiB,QAAQ;AAAA,MACzB;AAAA,MACA,MAAM,cAAc,MAAM;AAAA,MAC1B,MAAM,MAAM,aAAa;AAAA,MACzB,MAAM,MAAM,WAAW;AAAA,MACvB,MAAM,MAAM,UAAU,SAAS,YAAY,QAAQ,KAAK;AAAA,MACxD,MAAM,MAAM,iBAAiB,SAAS,YAAY,SAAS,KAAK;AAAA,MAChE,SAAS,YAAY,OAAO,KAAK;AAAA,MACjC,SAAS,YAAY,UAAU,KAAK;AAAA,MACpC,MAAM,SAAS,cAAc,SAAS,YAAY,UAAU,KAAK;AAAA,MACjE,MAAM,SAAS,WAAW,SAAS,YAAY,OAAO,KAAK;AAAA,MAC3D,SAAS,YAAY,QAAQ,MAAM,MAAM,cAAc,eAAe,SAAS;AAAA,IACjF;AAAA,EACJ;AACF;AAIA,SAAS,SAAS,OAA+B;AAC/C,UAAQ,MAAM,cAAc,MAAM,YAAY,MAAM,GAAG,EAAE;AAC3D;AAEA,SAASH,YAAW,OAA+B;AACjD,QAAM,QAAQ,OAAO,MAAM,cAAc,CAAC,IAAI;AAC9C,SAAO,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,QAAQ;AACvD;AAEA,SAAS,iBAAiB,OAAuB,YAA6C;AAC5F,QAAM,WAAW,WAAW;AAC5B,MAAI,OAAO,aAAa,YAAY,OAAO,SAAS,QAAQ,EAAG,QAAO;AACtE,SAAOA,YAAW,KAAK;AACzB;AAEA,SAASE,UAAS,OAAuB,SAAyB;AAChE,QAAM,QAAQD,UAAS,MAAM,cAAc,CAAC,GAAG,OAAO;AACtD,SAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ;AACvE;AAEA,SAASA,UAAS,OAAgC,KAAsB;AACtE,SAAO,IACJ,MAAM,GAAG,EACT;AAAA,IACC,CAAC,SAAS,SACR,WAAW,OAAO,YAAY,WACzB,QAAoC,IAAI,IACzC;AAAA,IACN;AAAA,EACF;AACJ;AAEA,SAAS,SAAS,QAAiC,KAAiC;AAClF,QAAM,QAAQ,OAAO,GAAG;AACxB,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ;AACjE;AAEA,SAAS,SAAS,OAAoC;AACpD,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ;AACjE;AAEA,SAAS,WAAW,OAA2B,UAA0B;AACvE,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;AAC/E,SAAO,KAAK,IAAI,KAAK,MAAM,KAAK,GAAG,GAAM;AAC3C;AAEA,SAAS,aAAa,OAAuB;AAC3C,SAAO,MAAM,WAAW,MAAM,GAAG;AACnC;AAMA,SAAS,iBAAiB,OAAuB;AAC/C,SAAO,MAAM,WAAW,MAAM,GAAG,EAAE,QAAQ,SAAS,EAAE,EAAE,YAAY;AACtE;;;AIv9BA,SAAS,cAAAG,mBAAkB;AAC3B,YAAYC,SAAQ;AACpB,YAAYC,SAAQ;AACpB,YAAYC,YAAU;;;ACGtB;AAAA,EACE;AAAA,EACA;AAAA,EAEA;AAAA,OACK;;;ACCA,IAAM,4CAA4C;AAClD,IAAM,2CAA2C,KAAK,OAAO;AA8H7D,SAAS,oCAAoC,SAAyB;AAC3E,SAAO,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA;AACnC;;;AFtIO,IAAM,yCAAyC;AAEtD,SAAS,eAAe,OAAuB;AAC7C,QAAM,WAAgB,eAAQ,KAAK;AACnC,SAAO,QAAQ,aAAa,UAAU,SAAS,YAAY,IAAI;AACjE;AAEO,SAAS,0BAA0B,YAA4B;AACpE,SAAOC,YAAW,QAAQ,EACvB,OAAO,eAAoB,YAAK,YAAY,WAAW,CAAC,CAAC,EACzD,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AAChB;AAqBO,SAAS,+BAA+B,YAA4B;AACzE,QAAM,MAAM,0BAA0B,UAAU;AAChD,MAAI,QAAQ,aAAa,SAAS;AAChC,WAAO,sCAAsC,yCAAyC,IAAI,GAAG;AAAA,EAC/F;AACA,SAAY;AAAA,IACP,WAAO;AAAA,IACV,SAAS,yCAAyC;AAAA,IAClD,GAAG,GAAG;AAAA,EACR;AACF;AAEO,SAAS,mCAAmC,YAA4B;AAC7E,SAAY,YAAK,YAAY,aAAa,sCAAsC;AAClF;AAEO,SAAS,4CAA4CC,WAAwB;AAClF,MAAI,QAAQ,aAAa,SAAS;AAIhC,oCAAgCA,WAAU,WAAW;AACrD,IAAG,cAAe,eAAQA,SAAQ,GAAG,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AAAA,EACvE;AACF;;;AG5CA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,iBAAAC,sBAAqB;AAC9B,YAAYC,YAAU;;;ACsBtB,IAAM,YAAY;AAclB,SAASC,cAAa,QAA8B;AAClD,SAAO,OAAO,KAAK,GAAG,OAAO,GAAG,IAAI,OAAO,QAAQ,IAAI,MAAM,EAAE,SAAS,WAAW;AACrF;AAEA,SAASC,cAAa,KAAmD;AACvE,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACF,UAAM,CAAC,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,WAAW,EAAE,SAAS,MAAM,EAAE,MAAM,GAAG;AAChF,QAAI,CAAC,OAAO,aAAa,OAAW,QAAO;AAC3C,UAAMC,UAAS,OAAO,QAAQ;AAC9B,WAAO,OAAO,cAAcA,OAAM,IAAI,EAAE,KAAK,UAAUA,QAAO,IAAI;AAAA,EACpE,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAcA,SAAS,SAAS,OAAmC;AACnD,QAAM,UAAoB,CAAC;AAC3B,QAAM,SAA8B,CAAC;AAErC,QAAM,KAAK,CAAC,QAAgB,UAAoC;AAC9D,QAAI,UAAU,OAAW;AACzB,YAAQ,KAAK,GAAG,MAAM,MAAM;AAC5B,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,KAAG,YAAY,MAAM,OAAO;AAC5B,KAAG,cAAc,MAAM,SAAS;AAChC,KAAG,cAAc,MAAM,SAAS;AAChC,KAAG,YAAY,MAAM,OAAO;AAC5B,KAAG,WAAW,MAAM,MAAM;AAC1B,KAAG,YAAY,MAAM,OAAO;AAC5B,KAAG,sBAAsB,MAAM,gBAAgB;AAC/C,KAAG,iBAAiB,MAAM,YAAY;AACtC,KAAG,eAAe,MAAM,UAAU;AAElC,MAAI,MAAM,YAAY,QAAQ;AAC5B,YAAQ,KAAK,kBAAkB,MAAM,WAAW,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AAC3E,WAAO,KAAK,GAAG,MAAM,UAAU;AAAA,EACjC;AACA,MAAI,MAAM,UAAU,QAAQ;AAC1B,YAAQ,KAAK,eAAe,MAAM,SAAS,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AACtE,WAAO,KAAK,GAAG,MAAM,QAAQ;AAAA,EAC/B;AAGA,MAAI,MAAM,MAAM;AACd,YAAQ,KAAK,kBAAkB;AAC/B,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB;AACA,MAAI,MAAM,IAAI;AACZ,YAAQ,KAAK,kBAAkB;AAC/B,WAAO,KAAK,MAAM,EAAE;AAAA,EACtB;AAEA,SAAO,EAAE,QAAQ,QAAQ,SAAS,QAAQ,KAAK,OAAO,IAAI,OAAO,OAAO;AAC1E;AAOO,IAAM,6BAAN,MAAiC;AAAA,EAItC,YACmB,IACjB,UAA6C,CAAC,GAC9C;AAFiB;AAGjB,SAAK,YAAY,KAAK,IAAI,GAAG,QAAQ,aAAa,GAAK;AAAA,EACzD;AAAA,EAJmB;AAAA,EAJV,cAAc,EAAE,aAAa,GAAG,cAAc,EAAE;AAAA,EACxC;AAAA,EASjB,MAAM,MAAM,QAAwB,CAAC,GAAkC;AACrE,UAAM,QAAQ,MAAM,SAAS;AAC7B,UAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,SAAS,KAAK,SAAS,CAAC;AACjE,UAAM,SAASD,cAAa,MAAM,MAAM;AACxC,UAAM,SAAS,SAAS,KAAK;AAE7B,UAAM,YAAY,UAAU,QAAQ,QAAQ;AAC5C,UAAM,aAAa,UAAU,QAAQ,MAAM;AAC3C,UAAM,SAAS,SAAS,wBAAwB,UAAU,YAAY;AACtE,UAAM,MACJ,mDAAmD,OAAO,MAAM,GAAG,MAAM,iBACxD,SAAS,cAAc,SAAS;AAEnD,UAAM,UAAU,yBAAyB;AACzC,UAAM,OAAyB,CAAC;AAChC,QAAI,QAAQ;AACZ,QAAI,gBAAgB;AACpB,QAAI;AACJ,QAAI,SAAS;AAKb,eAAS;AACP,YAAM,SAAS,CAAC,GAAG,OAAO,MAAM;AAChC,UAAI,OAAQ,QAAO,KAAK,OAAO,KAAK,OAAO,QAAQ;AACnD,aAAO,KAAK,KAAK,WAAW,MAAM;AAClC,YAAM,OAAO,KAAK,GAAG,QAAQ,GAAG,EAAE,IAAI,GAAG,MAAM;AAK/C,UAAI,KAAK,WAAW,EAAG;AACvB,gBAAU,KAAK;AAEf,iBAAW,OAAO,MAAM;AACtB;AACA,YAAI;AACJ,YAAI;AACF,kBAAQ,KAAK,MAAM,IAAI,OAAO;AAAA,QAChC,QAAQ;AACN,eAAK,YAAY;AACjB;AAAA,QACF;AACA,YAAI,CAAC,QAAQ,OAAO,KAAK,EAAG;AAC5B;AACA,sBAAc,SAAS,KAAK;AAC5B,YAAI,KAAK,SAAS,OAAO;AACvB,eAAK,KAAK,KAAK;AACf,iBAAO,EAAE,KAAK,IAAI,KAAK,UAAU,IAAI,SAAS;AAAA,QAChD;AAAA,MACF;AACA,UAAI,KAAK,SAAS,KAAK,UAAW;AAAA,IACpC;AAKA,SAAK,KAAK,CAAC,MAAM,UAAU,cAAc,MAAM,KAAK,KAAK,UAAU,QAAQ,IAAI,GAAG;AAElF,UAAM,SAA+B;AAAA,MACnC,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,aAAa,KAAK,YAAY;AAAA,MAC9B,cAAc,KAAK,YAAY;AAAA,MAC/B,SAAS,gBAAgB,OAAO;AAAA,IAClC;AACA,QAAI,QAAQ,KAAK,UAAU,MAAM;AAC/B,aAAO,EAAE,GAAG,QAAQ,YAAYD,cAAa,IAAI,EAAE;AAAA,IACrD;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,OACJ,QACA,QAAwB,CAAC,GACzB,QAAQ,KACwB;AAChC,UAAM,eAAe,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AACxC,QAAI,aAAa,WAAW,EAAG,QAAO,CAAC;AACvC,UAAM,SAAS,IAAI,IAAI,aAAa,IAAI,CAAC,UAAU,CAAC,OAAO,oBAAI,IAAoB,CAAC,CAAC,CAAC;AAEtF,eAAW,SAAS,KAAK,UAAU,KAAK,GAAG;AACzC,iBAAW,SAAS,cAAc;AAChC,cAAM,QAAQ,WAAW,OAAO,KAAK;AACrC,YAAI,UAAU,OAAW;AACzB,cAAM,cAAc,OAAO,IAAI,KAAK;AACpC,qBAAa,IAAI,QAAQ,YAAY,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,MAC3D;AAAA,IACF;AAEA,UAAM,SAAgC,CAAC;AACvC,eAAW,SAAS,cAAc;AAChC,aAAO,KAAK,IAAI,CAAC,GAAI,OAAO,IAAI,KAAK,KAAK,oBAAI,IAAoB,CAAE,EACjE,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,OAAO,MAAM,EAAE,EAG1C,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,KAAK,MAAM,cAAc,MAAM,KAAK,CAAC,EACvF,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,MACJ,OACA,QAAwB,CAAC,GACzB,QAAQ,KACwB;AAChC,YAAQ,MAAM,KAAK,OAAO,CAAC,KAAK,GAAG,OAAO,KAAK,GAAG,KAAK,KAAK,CAAC;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,MACJ,OAAuB,CAAC,GACxB,OAAO,GACP,WAAW,KACoB;AAC/B,UAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC;AAClD,UAAM,WAAW,oBAAI,IAA4B;AACjD,QAAI,YAAY;AAEhB,eAAW,SAAS,KAAK,UAAU,IAAI,GAAG;AACxC;AACA,UAAI,SAAS,OAAO,UAAW,UAAS,IAAI,MAAM,SAAS,KAAK;AAAA,IAClE;AAEA,QAAI,WAAW,CAAC,GAAG,SAAS,OAAO,CAAC;AACpC,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;AACjD,aACM,QAAQ,GACZ,QAAQ,cAAc,SAAS,SAAS,KAAK,SAAS,OAAO,WAC7D,SACA;AACA,YAAM,eAAe,IAAI;AAAA,QACvB,SAAS,QAAQ,CAAC,UAAU,aAAa,KAAK,EAAE,IAAI,CAAC,aAAa,SAAS,GAAG,CAAC;AAAA,MACjF;AACA,YAAM,OAAyB,CAAC;AAChC,iBAAW,SAAS,KAAK,UAAU,CAAC,CAAC,GAAG;AACtC,YAAI,SAAS,IAAI,MAAM,OAAO,EAAG;AACjC,YAAI,CAAC,aAAa,KAAK,EAAE,KAAK,CAAC,aAAa,aAAa,IAAI,SAAS,GAAG,CAAC,EAAG;AAC7E,iBAAS,IAAI,MAAM,SAAS,KAAK;AACjC,aAAK,KAAK,KAAK;AACf,YAAI,SAAS,QAAQ,UAAW;AAAA,MAClC;AACA,iBAAW;AAAA,IACb;AAEA,UAAM,QAAQ,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,KAAK,aAAa;AACvD,UAAM,QAAQ,oBAAI,IAA8B;AAChD,eAAW,QAAQ,OAAO;AACxB,iBAAW,YAAY,aAAa,IAAI,GAAG;AACzC,cAAM,UAAU,MAAM,IAAI,SAAS,GAAG,KAAK,CAAC;AAC5C,gBAAQ,KAAK,IAAI;AACjB,cAAM,IAAI,SAAS,KAAK,OAAO;AAAA,MACjC;AAAA,IACF;AAEA,UAAM,QAA8B,CAAC;AACrC,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,QAAQ,OAAO;AACxB,iBAAW,YAAY,aAAa,IAAI,GAAG;AACzC,mBAAW,aAAa,MAAM,IAAI,SAAS,GAAG,KAAK,CAAC,GAAG;AACrD,cAAI,UAAU,YAAY,KAAK,QAAS;AACxC,gBAAM,CAAC,MAAM,EAAE,IACb,cAAc,MAAM,SAAS,KAAK,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,WAAW,IAAI;AAC5E,gBAAM,KAAK,GAAG,KAAK,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,IAAI;AACzD,cAAI,KAAK,IAAI,EAAE,EAAG;AAClB,eAAK,IAAI,EAAE;AACX,gBAAM,KAAK;AAAA,YACT,MAAM,KAAK;AAAA,YACX,IAAI,GAAG;AAAA,YACP,MAAM,SAAS;AAAA,YACf,YAAY,SAAS;AAAA,UACvB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,WAAW,YAAY,aAAa,SAAS,QAAQ;AAAA,IACvD;AAAA,EACF;AAAA;AAAA,EAGA,CAAS,UAAU,OAAkD;AACnE,UAAM,SAAS,SAAS,KAAK;AAC7B,UAAM,MACJ,oCAAoC,OAAO,MAAM;AAEnD,QAAI,SAAS;AACb,eAAS;AACP,YAAM,OAAO,KAAK,GAAG,QAAQ,GAAG,EAAE,IAAI,GAAG,OAAO,QAAQ,KAAK,WAAW,MAAM;AAG9E,UAAI,KAAK,WAAW,EAAG;AACvB,gBAAU,KAAK;AACf,iBAAW,OAAO,MAAM;AACtB,YAAI;AACJ,YAAI;AACF,kBAAQ,KAAK,MAAM,IAAI,OAAO;AAAA,QAChC,QAAQ;AACN,eAAK,YAAY;AACjB;AAAA,QACF;AACA,YAAI,QAAQ,OAAO,KAAK,EAAG,OAAM;AAAA,MACnC;AACA,UAAI,KAAK,SAAS,KAAK,UAAW;AAAA,IACpC;AAAA,EACF;AACF;;;ADjVO,IAAM,wBAAwB;AAG9B,IAAM,6BAA6B;AAGnC,IAAM,8BAA8B;AAE3C,IAAMG,kBAAiB;AA4CvB,IAAIC;AAEJ,SAASC,oBAAwC;AAC/C,MAAID,MAAM,QAAOA;AACjB,MAAIA,UAAS,KAAM,OAAM,IAAI,MAAM,4CAA4C;AAC/E,MAAI;AACF,IAAAA,QAAO;AAAA,MACL,MACGE,eAAc,YAAY,GAAG,EAAE,aAAa,EAAmC;AAAA,IACpF;AACA,WAAOF;AAAA,EACT,SAAS,OAAO;AACd,IAAAA,QAAO;AACP,UAAM,IAAI;AAAA,MACR,sFACG,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,IAC1D;AAAA,EACF;AACF;AAIO,IAAM,yBAAN,MAA6B;AAAA,EACjB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,oBAAI,IAAyB;AAAA,EAEvC,WAAW;AAAA,IAC1B,gBAAgB;AAAA,IAChB,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,IAChB,cAAc;AAAA,IACd,SAAS;AAAA,IACT,oBAAoB;AAAA,IACpB,cAAc;AAAA,EAChB;AAAA,EACQ;AAAA,EAER,YAAY,SAAwC;AAClD,SAAK,SAAc,YAAU,eAAQ,QAAQ,SAAS,GAAG,qBAAqB;AAC9E,SAAK,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC1C,SAAK,eAAe,QAAQ,iBAAiB,MAAM,QAAQ,OAAO,OAAO;AACzE,SAAK,YAAY,QAAQ,cAAc,MAAMG,YAAW;AACxD,UAAM,WAAWF,kBAAiB;AAClC,SAAK,KAAK,IAAI,SAAS,KAAK,MAAM;AAClC,SAAK,GAAG,KAAK,2BAA2B;AACxC,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,QAAc;AACZ,SAAK,GAAG,MAAM;AAAA,EAChB;AAAA,EAEA,QAA+B;AAC7B,WAAO;AAAA,MACL,GAAG,KAAK;AAAA,MACR,eAAe;AAAA;AAAA;AAAA,MAGf,gBAAgB;AAAA,MAChB,GAAI,KAAK,wBAAwB,SAC7B,EAAE,qBAAqB,KAAK,oBAAoB,IAChD,CAAC;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,QAAuB;AAC3B,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,MAAM,OAAO,OAAqD;AAChE,UAAM,CAAC,KAAK,IAAI,MAAM,KAAK,YAAY,CAAC,KAAK,CAAC;AAE9C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,YAAY,QAAmE;AACnF,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,UAAM,UAAU,YAAY,IAAI;AAChC,SAAK,SAAS,kBAAkB,OAAO;AACvC,SAAK,SAAS,WAAW;AACzB,SAAK,SAAS,eAAe,KAAK,IAAI,KAAK,SAAS,cAAc,OAAO,MAAM;AAE/E,UAAM,UAAU,KAAK,IAAI,EAAE,YAAY;AAIvC,UAAM,MAAM,QAAQ,MAAM,GAAG,EAAE;AAC/B,UAAM,SAA2B,CAAC;AAClC,QAAI,WAAW,KAAK,WAAW,GAAG;AAElC,eAAW,SAAS,QAAQ;AAC1B,YAAM,WAAW;AAAA,QACf,GAAG;AAAA,QACH,YAAY,MAAM,cAAc;AAAA,QAChC,aAAa,MAAM,eAAe,KAAK,aAAa,EAAE,SAAS;AAAA,QAC/D,eAAe;AAAA,QACf,SAAS,KAAK,UAAU;AAAA,QACxB,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,UAAU,SAAS,WAAW;AAAA,QAC9B,cAAc,SAAS;AAAA,MACzB;AACA,YAAM,QAAwB,EAAE,GAAG,UAAU,MAAM,UAAU,QAAQ,EAAE;AACvE,aAAO,KAAK,KAAK;AACjB,iBAAW,EAAE,UAAU,MAAM,UAAU,MAAM,MAAM,KAAK;AAAA,IAC1D;AAEA,QAAI;AACF,WAAK,GAAG,KAAK,iBAAiB;AAC9B,YAAM,SAAS,KAAK,GAAG;AAAA,QACrB;AAAA;AAAA;AAAA;AAAA;AAAA,MAKF;AACA,iBAAW,SAAS,QAAQ;AAC1B,cAAM,MAAM,aAAa,KAAK;AAC9B,eAAO;AAAA,UACL;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,KAAK,UAAU,KAAK;AAAA,QACtB;AAAA,MACF;AACA,WAAK,GAAG,KAAK,QAAQ;AAAA,IACvB,SAAS,OAAO;AACd,UAAI;AACF,aAAK,GAAG,KAAK,UAAU;AAAA,MACzB,QAAQ;AAAA,MAER;AACA,WAAK,QAAQ,MAAM;AACnB,WAAK,SAAS,gBAAgB,OAAO;AACrC,WAAK,sBAAsB,YAAY,IAAI,IAAI;AAC/C,YAAM;AAAA,IACR;AAEA,SAAK,QAAQ,IAAI,KAAK,QAAQ;AAC9B,SAAK,SAAS,mBAAmB,OAAO;AACxC,SAAK,sBAAsB,YAAY,IAAI,IAAI;AAC/C,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAqC;AACzC,UAAM,OAAO,KAAK,GACf,QAAQ,mDAAmD,EAC3D,IAAI;AACP,WAAO,KAAK,IAAI,CAAC,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAmB;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,SAAyC;AAC7C,QAAI,UAAU;AACd,QAAI,eAAe;AACnB,QAAI,WAAW;AAEf,eAAW,OAAO,KAAK,KAAK,GAAG;AAC7B,YAAM,aAAa,KAAK,eAAe,GAAG;AAC1C,UAAI,oBAAoB,YAAY,YAAY,KAAK;AACrD,UAAI,eAAe,YAAY,QAAQ;AAEvC,YAAM,OAAO,KAAK,GACf;AAAA,QACC;AAAA,MACF,EACC,IAAI,GAAG;AAOV,iBAAW,OAAO,MAAM;AACtB,YAAI,IAAI,aAAa,kBAAkB;AACrC,iBAAO;AAAA,YACL,IAAI;AAAA,YACJ;AAAA,YACA,UAAU;AAAA,YACV,QAAQ,mBAAmB,GAAG,cAAc,gBAAgB,WAAW,IAAI,QAAQ;AAAA,UACrF;AAAA,QACF;AACA,YAAI,IAAI,kBAAkB,cAAc;AACtC,iBAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,yBAAyB;AAAA,QACnF;AACA,YAAI;AACJ,YAAI;AACF,kBAAQ,KAAK,MAAM,IAAI,OAAO;AAAA,QAChC,QAAQ;AACN,iBAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,uBAAuB;AAAA,QACjF;AACA,YAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM;AAC1C,iBAAO,EAAE,IAAI,OAAO,SAAS,UAAU,SAAS,QAAQ,sBAAsB;AAAA,QAChF;AACA,mBAAW;AACX,2BAAmB,IAAI,WAAW;AAClC,uBAAe,IAAI;AAAA,MACrB;AAEA,qBAAe,mBAAmB;AAClC,iBAAW;AAAA,IACb;AAEA,WAAO,EAAE,IAAI,MAAM,SAAS,cAAc,SAAS;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,MAAM,SAAqE;AAC/E,UAAM,QAA8B;AAAA,MAClC,cAAc;AAAA,MACd,cAAc;AAAA,MACd,cAAc;AAAA,MACd,QAAQ,CAAC;AAAA,IACX;AACA,QAAI,CAAC,OAAO,SAAS,QAAQ,aAAa,KAAK,QAAQ,iBAAiB,EAAG,QAAO;AAElF,UAAM,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE,QAAQ,IAAI,QAAQ,gBAAgB,KAAU,EAC9E,YAAY,EACZ,MAAM,GAAG,EAAE;AAEd,UAAM,QACJ,KAAK,GAAG,QAAQ,gDAAgD,EAAE,IAAI,MAAM,EAG5E;AACF,QAAI,UAAU,EAAG,QAAO;AAExB,QAAI,QAAQ,QAAQ;AAClB,YAAM,OAAO,KAAK,GACf,QAAQ,4DAA4D,EACpE,IAAI,MAAM;AACb,aAAO,EAAE,GAAG,OAAO,cAAc,OAAO,YAAY,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG,EAAE;AAAA,IACjF;AAEA,QAAI;AACF,WAAK,GAAG,KAAK,iBAAiB;AAC9B,WAAK,GAAG,QAAQ,kCAAkC,EAAE,IAAI,MAAM;AAC9D,WAAK,GAAG,QAAQ,4CAA4C,EAAE,IAAI,MAAM;AACxE,WAAK,GAAG,KAAK,QAAQ;AAAA,IACvB,SAAS,OAAO;AACd,UAAI;AACF,aAAK,GAAG,KAAK,UAAU;AAAA,MACzB,QAAQ;AAAA,MAER;AACA,aAAO;AAAA,QACL,GAAG;AAAA,QACH,QAAQ;AAAA,UACN;AAAA,YACE,MAAM,KAAK;AAAA,YACX,QAAQ,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,SAAK,QAAQ,MAAM;AACnB,WAAO,EAAE,GAAG,OAAO,cAAc,MAAM;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAM,gBAAgB,MAAmE;AACvF,UAAM,SAAS,KAAK,GAAG;AAAA,MACrB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKF;AACA,UAAM,aAAa,KAAK,GAAG;AAAA,MACzB;AAAA;AAAA,IAEF;AAEA,SAAK,GAAG,KAAK,iBAAiB;AAC9B,QAAI;AACF,YAAM,KAAK;AAAA,QACT,QAAQ,CAAC,KAAK,UAAU;AACtB,gBAAM,MAAM,aAAa,KAAK;AAC9B,iBAAO;AAAA,YACL;AAAA,YACA,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM;AAAA,YACN,IAAI;AAAA,YACJ,MAAM;AAAA,YACN,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,IAAI;AAAA,YACJ,KAAK,UAAU,KAAK;AAAA,UACtB;AAAA,QACF;AAAA,QACA,YAAY,CAAC,KAAK,UAAU,SAAS;AACnC,qBAAW,IAAI,KAAK,UAAU,IAAI;AAAA,QACpC;AAAA,MACF,CAAC;AACD,WAAK,GAAG,KAAK,QAAQ;AAAA,IACvB,SAAS,OAAO;AACd,UAAI;AACF,aAAK,GAAG,KAAK,UAAU;AAAA,MACzB,QAAQ;AAAA,MAER;AACA,YAAM;AAAA,IACR,UAAE;AACA,WAAK,QAAQ,MAAM;AAAA,IACrB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,SAAyE;AACnF,WAAO,IAAI,2BAA2B,KAAK,IAAI,OAAO;AAAA,EACxD;AAAA;AAAA,EAGA,2BAAoC;AAClC,WAAO,KAAK,SAAS,0BAA0B,MAAM;AAAA,EACvD;AAAA,EAEA,4BAAkC;AAChC,SAAK,GACF;AAAA,MACC;AAAA;AAAA,IAEF,EACC,IAAI,0BAA0B;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,0BAA0B,UAAuD;AAC/E,QAAI,SAAS,WAAW,EAAG;AAC3B,SAAK,GACF;AAAA,MACC;AAAA;AAAA,IAEF,EACC,IAAI,6BAA6B,KAAK,UAAU,QAAQ,CAAC;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,eAAe,KAAsB;AACnC,UAAM,MAAM,KAAK,GAAG,QAAQ,uDAAuD,EAAE,IAAI,GAAG;AAG5F,WAAO,QAAQ;AAAA,EACjB;AAAA;AAAA,EAGA,sBAAoD;AAClD,UAAM,MAAM,KAAK,SAAS,2BAA2B;AACrD,QAAI,CAAC,IAAK,QAAO,CAAC;AAClB,QAAI;AACF,YAAMG,UAAkB,KAAK,MAAM,GAAG;AACtC,aAAO,MAAM,QAAQA,OAAM,IAAKA,UAA0C,CAAC;AAAA,IAC7E,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA;AAAA,EAIQ,SAAS,KAAiC;AAChD,UAAM,MAAM,KAAK,GAAG,QAAQ,gDAAgD,EAAE,IAAI,GAAG;AAGrF,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,eAAe,KAAsC;AAC3D,WAAO,KAAK,GAAG,QAAQ,2DAA2D,EAAE,IAAI,GAAG;AAAA,EAG7F;AAAA;AAAA,EAGQ,OAAiB;AACvB,UAAM,OAAO,KAAK,GAAG,QAAQ,8CAA8C,EAAE,IAAI;AAGjF,WAAO,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,WAAW,KAA0B;AAC3C,UAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;AACnC,QAAI,OAAQ,QAAO;AACnB,UAAM,OAAO,KAAK,GACf,QAAQ,gFAAgF,EACxF,IAAI,GAAG;AACV,UAAM,SAAS,QAAQ,KAAK,eAAe,GAAG,KAAK,EAAE,UAAU,GAAG,MAAM,aAAa;AACrF,SAAK,QAAQ,IAAI,KAAK,MAAM;AAC5B,WAAO;AAAA,EACT;AAAA,EAEQ,eAAqB;AAC3B,UAAM,UAAW,KAAK,GAAG,QAAQ,qBAAqB,EAAE,IAAI,EACzD;AACH,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAwCZ;AACD,QAAI,YAAYL,iBAAgB;AAC9B,WAAK,GAAG,KAAK,yBAAyBA,eAAc,EAAE;AAAA,IACxD;AAAA,EACF;AACF;AA6BA,SAAS,aAAa,OAAqC;AACzD,QAAM,aAAa,MAAM,cAAc,MAAM;AAC7C,SAAO;AAAA,IACL;AAAA,IACA,SAAS,MAAM,WAAW;AAAA,IAC1B,WAAW,MAAM,MAAM,aAAa;AAAA,IACpC,WAAW,MAAM,MAAM,aAAa;AAAA,IACpC,SAAS,MAAM,MAAM,WAAW;AAAA,IAChC,QAAQ,MAAM,MAAM,UAAU;AAAA,IAC9B,SAAS,MAAM,aAAa,WAAW;AAAA,IACvC,kBAAkB,MAAM,aAAa,oBAAoB;AAAA,IACzD,cAAc,MAAM,UAAU,QAAQ;AAAA,IACtC,YAAY,MAAM,UAAU,MAAM;AAAA,IAClC,cAAc,MAAM,UAAU,QAAQ;AAAA,IACtC,YAAY,MAAM,cAAc;AAAA,EAClC;AACF;;;AtBhoBA,IAAM,kBAAkB,IAAI;AAC5B,IAAM,mBAAmB;AAEzB,IAAM,gCAAgC,IAAI,OAAO;AAgBjD,SAAS,UAAU,MAA4B;AAC7C,QAAM,SAAS,oBAAI,IAAoB;AACvC,WAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;AAChD,UAAM,MAAM,KAAK,KAAK;AACtB,QAAI,KAAK,WAAW,IAAI,KAAK,KAAK,QAAQ,CAAC,MAAM,QAAW;AAC1D,aAAO,IAAI,KAAK,KAAK,EAAE,KAAK,CAAE;AAAA,IAChC;AAAA,EACF;AACA,QAAM,WAAW;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,aAAW,OAAO,UAAU;AAC1B,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,OAAM,IAAI,MAAM,qCAAqC,GAAG,EAAE;AAAA,EAClF;AACA,QAAM,iBAAiB,OAAO,OAAO,IAAI,kBAAkB,CAAC;AAC5D,SAAO;AAAA,IACL,aAAkB,eAAQ,OAAO,IAAI,gBAAgB,CAAE;AAAA,IACvD,YAAiB,eAAQ,OAAO,IAAI,eAAe,CAAE;AAAA,IACrD,WAAW,OAAO,IAAI,cAAc;AAAA,IACpC,YAAiB,eAAQ,OAAO,IAAI,eAAe,CAAE;AAAA,IACrD,aAAa,OAAO,IAAI,gBAAgB;AAAA,IACxC,eAAe,OAAO,SAAS,cAAc,KAAK,kBAAkB,IAAI,iBAAiB;AAAA,EAC3F;AACF;AAIA,sBAAsB;AAEtB,IAAM,SAAS,UAAU,QAAQ,KAAK,MAAM,CAAC,CAAC;AAC9C,IAAM,qBAA0B,YAAK,OAAO,YAAY,WAAW;AACnE,IAAM,WAAW,+BAA+B,OAAO,UAAU;AACjE,IAAM,eAAe,mCAAmC,OAAO,UAAU;AACzE,IAAM,YAAY,OAAO,QAAQ,IAAI,qCAAqC,CAAC;AAC3E,IAAM,SAAS,OAAO,SAAS,SAAS,KAAK,aAAa,MAAM,YAAY;AAC5E,IAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,IAAM,aAAyC;AAAA,EAC7C,iBAAiB;AAAA,EACjB,KAAK,QAAQ;AAAA,EACb,aAAa,OAAO;AAAA,EACpB,YAAY,OAAO;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AACF;AAEA,QAAQ,QAAQ,wBAA6B,gBAAS,OAAO,WAAW,CAAC;AAEzE,IAAM,UAAU,oBAAI,IAAiB;AACrC,IAAM,WAAW,oBAAI,IAA8B;AACnD,IAAI,iBAAiB;AACrB,IAAI;AACJ,IAAI,WAAW;AACf,IAAI;AACJ,IAAI;AACJ,IAAI,kBAAkB;AACtB,IAAI;AACJ,IAAI;AACJ,IAAI;AACJ,IAAI;AAGJ,IAAM,uBAAmF,CAAC;AAM1F,IAAM,wBAAwB;AAU9B,SAAS,cAAc,YAA0B;AAC/C,MAAI,SAAS,QAAQ,sBAAuB;AAC5C,QAAM,OAAO,IAAI,IAAI,CAAC,GAAG,SAAS,KAAK,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,qBAAqB,CAAC;AAC1F,OAAK,IAAI,UAAU;AACnB,aAAW,CAAC,KAAK,OAAO,KAAK,UAAU;AACrC,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,aAAS,OAAO,GAAG;AAGnB,SAAK,QAAQ,MAAM,EAAE,MAAM,MAAM;AAAA,IAEjC,CAAC;AAAA,EACH;AACF;AAGA,SAAS,oBAAoB,UAA+D;AAC1F,SAAY,YAAK,SAAS,oBAAoB,GAAG,SAAS,GAAG,eAAe;AAC9E;AAOA,SAAS,iBAA0B;AACjC,SAAO,QAAQ,IAAI,4BAA4B,MAAM;AACvD;AAEA,IAAI;AAGJ,IAAI,sBAAoD,CAAC;AAQzD,SAAS,QAAyC;AAChD,mBAAiB,YAAY;AAC3B,UAAU,WAAM,oBAAoB,EAAE,WAAW,KAAK,CAAC;AACvD,UAAM,UAAU,IAAI,uBAAuB,EAAE,WAAW,mBAAmB,CAAC;AAC5E,QAAI;AACF,YAAM,SAAS,MAAM,6BAA6B,SAAS,kBAAkB;AAC7E,4BAAsB,OAAO;AAAA,IAC/B,SAAS,OAAO;AAKd,oBAAc;AACd,cAAQ,MAAM;AACd,YAAM;AAAA,IACR;AACA,WAAO;AAAA,EACT,GAAG;AACH,SAAO;AACT;AAEA,SAAS,kBAAoC;AAC3C,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,MAAM,IAAI,YAAY,EAAE,MAAM,GAAG,EAAE;AACzC,MAAI,UAAU,SAAS,IAAI,GAAG;AAC9B,MAAI,CAAC,SAAS;AACZ,UAAM,WAAW,gCAAgC;AAAA,MAC/C,YAAY,OAAO;AAAA,MACnB,WAAW,OAAO;AAAA,MAClB,YAAY,OAAO;AAAA,MACnB;AAAA,IACF,CAAC;AACD,cAAU,IAAI,iBAAiB;AAAA,MAC7B,UAAU,oBAAoB,QAAQ;AAAA,MACtC,eAAe,OAAO;AAAA,IACxB,CAAC;AACD,aAAS,IAAI,KAAK,OAAO;AACzB,kBAAc,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAEA,IAAM,kBAAkB,gCAAgC;AAAA,EACtD,YAAY,OAAO;AAAA,EACnB,WAAW,OAAO;AAAA,EAClB,YAAY,OAAO;AACrB,CAAC;AACD,IAAM,gBAAkC,uBAAuB;AAAA,EAC7D,gBAAgB,gBAAgB;AAAA,EAChC,WAAW,gBAAgB;AAAA,EAC3B,WAAW,OAAO;AAAA,EAClB,aAAa,OAAO;AACtB,CAAC;AAED,SAAS,aAAa,OAAkC;AACtD,MACE,MAAM,cAAc,4BACpB,MAAM,UAAU,SAAS,UACzB,CAAC,MAAM,SAAS,QAChB,CAAC,MAAM,YAAY,YACnB;AACA;AAAA,EACF;AACA,QAAM,WAAW,MAAM,aAAa,UAAU;AAC9C,MAAI,OAAO,aAAa,YAAY,CAAC,SAAU;AAC/C,QAAM,KAAK,MAAM,aAAa,KAAK,MAAM,MAAM,UAAU,IAAI,OAAO;AACpE,QAAM,OAAO;AAAA,IACX,MAAM,MAAM,SAAS;AAAA,IACrB,WAAW,MAAM,YAAY;AAAA,IAC7B;AAAA,IACA,SAAS,MAAM,MAAM;AAAA,IACrB,WAAW,MAAM,MAAM;AAAA,IACvB,GAAI,OAAO,SAAS,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAAA,EACtC;AACA,MAAI,QAAS,SAAQ,iBAAiB,IAAI;AAAA,OACrC;AACH,QAAI,qBAAqB,UAAU,IAAO,sBAAqB,MAAM;AACrE,yBAAqB,KAAK,IAAI;AAAA,EAChC;AACF;AAEA,eAAe,aAAa,QAA0D;AACpF,MAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,KAAK,OAAO,SAAS,kBAAkB;AACrF,UAAM,IAAI,UAAU,gCAAgC,gBAAgB,SAAS;AAAA,EAC/E;AACA,aAAW,SAAS,QAAQ;AAC1B,QAAI,CAAC,SAAS,OAAO,UAAU,YAAY,OAAO,MAAM,cAAc,UAAU;AAC9E,YAAM,IAAI,UAAU,kDAAkD;AAAA,IACxE;AACA,iBAAa,KAAK;AAAA,EACpB;AACA,QAAM,SAAS,eAAe,IAC1B,OAAO,MAAM,MAAM,GAAG,YAAY,MAAM,IACxC,MAAM,QAAQ,IAAI,OAAO,IAAI,CAAC,UAAU,gBAAgB,EAAE,OAAO,KAAK,CAAC,CAAC;AAC5E,qBAAmB,OAAO;AAC1B,SAAO;AACT;AAEA,IAAM,cAAkC;AAAA,EACtC,QAAQ,OAAO,WAAW,MAAM,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC;AAAA,EACxD,OAAO,YAAY,cAAc;AAAA,EACjC,OAAO,MAAM,gBAAgB,EAAE,MAAM;AACvC;AAEA,eAAe,gBAA+B;AAC5C,MAAI,eAAe,GAAG;AAGpB,QAAI,YAAa,OAAM;AACvB;AAAA,EACF;AACA,QAAM,QAAQ,IAAI,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,YAAY,QAAQ,MAAM,CAAC,CAAC;AAC5E;AAEA,SAAS,aAA2C;AAClD,0BAAwB,IAAI,6BAA6B,kBAAkB;AAC3E,SAAO;AACT;AAEA,eAAe,cAA0E;AAIvF,MAAI,eAAe,EAAG,SAAQ,MAAM,MAAM,GAAG,YAAY;AACzD,MAAI,aAAa,eAAe,gBAAiB,QAAO,YAAY;AACpE,QAAM,SAAS,MAAM,qBAAqB,cAAc,oBAAoB;AAAA,IAC1E,YAAY,WAAW;AAAA,EACzB,CAAC;AACD,gBAAc,EAAE,YAAY,iBAAiB,OAAO;AACpD,SAAO;AACT;AAEA,SAAS,UAAiC;AACxC,mBAAiB,sBAAsB,KAAK,kBAAkB;AAC9D,SAAO;AACT;AAEA,eAAe,iBAEb;AACA,MAAI,eAAgB,QAAO;AAC3B,QAAM,MAAM,QAAQ,EAAE,QAAQ;AAC9B,mBAAiB;AACjB,MAAI;AACF,WAAO,MAAM;AAAA,EACf,UAAE;AACA,qBAAiB;AAAA,EACnB;AACF;AAEA,eAAe,eAAsD;AACnE,QAAM,SAAS,QAAQ,YAAY;AACnC,QAAM,cAAc;AAIpB,MAAI,eAAe,GAAG;AACpB,2BAAuB,MAAM,MAAM,GAAG,oBAAoB;AAAA,EAC5D;AACA,QAAM,eAAsC,gBAAgB,EAAE,MAAM;AACpE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,WAAW,KAAK,IAAI;AAAA,IACpB,UAAU,KAAK,MAAM,QAAQ,OAAO,IAAI,GAAK;AAAA,IAC7C,SAAS,QAAQ;AAAA,IACjB;AAAA,IACA,SAAS;AAAA,IACT,GAAI,oBAAoB,SAAS,IAAI,EAAE,oBAAoB,IAAI,CAAC;AAAA,IAChE,SAAS;AAAA,MACP,QAAQ,YAAY;AAAA,MACpB,cAAc,SAAS,gBAAgB;AAAA,MACvC,GAAI,mBAAmB,EAAE,WAAW,iBAAiB,IAAI,CAAC;AAAA,IAC5D;AAAA,IACA,QAAQ;AAAA,MACN,KAAK,OAAO;AAAA,MACZ,UAAU,OAAO;AAAA,MACjB,WAAW,OAAO;AAAA,MAClB,UAAU,OAAO;AAAA,IACnB;AAAA,EACF;AACF;AAKA,SAAS,cAAc,OAAgC;AACrD,QAAM,EAAE,MAAM,IAAI,OAAO,OAAO,QAAQ,GAAG,KAAK,IAAI;AACpD,SAAO,OAAO,OAAO,IAAI,EAAE,MAAM,CAAC,UAAU,UAAU,MAAS;AACjE;AAEA,eAAe,SACb,IACA,SACiD;AACjD,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,aAAQ,MAAM,aAAa;AAAA,IAC7B,KAAK,UAAU;AACb,YAAM,OAAO;AACb,aAAQ,MAAM,aAAa,KAAK,MAAM;AAAA,IACxC;AAAA,IACA,KAAK;AACH,YAAM,cAAc;AACpB,aAAO;AAAA,IACT,KAAK,SAAS;AACZ,YAAM,OAAO;AACb,aAAO,eAAe,IAChB,OAAO,MAAM,MAAM,GAAG,MAAM,IAAI,IAChC,MAAM,gBAAgB,EAAE,MAAM,IAAI;AAAA,IAC1C;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,OAAO;AACb,YAAM,SAAS,OAAO,MAAM,YAAY,GAAG,MAAM,KAAK,KAAK;AAO3D,UAAI,cAAc,KAAK,KAAK,GAAG;AAC7B,cAAM,eAAe;AACrB,eAAO,UAAU,QAAQ,EAAE,eAAe;AAAA,UACxC,GAAI,KAAK,MAAM,OAAO,EAAE,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;AAAA,UACnD,GAAI,KAAK,MAAM,KAAK,EAAE,IAAI,KAAK,MAAM,GAAG,IAAI,CAAC;AAAA,QAC/C,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,OAAO;AACb,YAAM,SAAS,MAAM,YAAY;AACjC,aAAO;AAAA,QACL,QAAQ,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,KAAK;AAAA,QAC7D,aAAa,OAAO;AAAA,MACtB;AAAA,IACF;AAAA,IACA,KAAK,UAAU;AACb,YAAM,OAAO;AACb,YAAM,SAAS,MAAM,YAAY;AACjC,aAAO;AAAA,QACL,QAAQ,MAAM,OAAO,OAAO,KAAK,QAAQ,KAAK,OAAO,KAAK,KAAK;AAAA,QAC/D,aAAa,OAAO;AAAA,MACtB;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,OAAO;AACb,aAAQ,OACN,MAAM,YAAY,GAClB,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ;AAAA,IAC7C;AAAA,IACA,KAAK,WAAW;AACd,YAAM,OAAO;AACb,YAAM,YACJ,KAAK,YAAY,QACb,EAAE,gBAAgB,GAAG,eAAe,GAAG,aAAa,GAAG,cAAc,EAAE,IACvE,MAAM,eAAe;AAC3B,UAAI,KAAK,YAAY,OAAO;AAG1B,aAAK,eAAe,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACtC;AACA,YAAMM,SAAQ,QAAQ;AACtB,YAAM,OACJ,KAAK,SAAS,cACVA,OAAM,cAAc,KAAK,SAAS,IAClC,KAAK,SAAS,UACZA,OAAM,aAAa,KAAK,KAAK,IAC7B,KAAK,SAAS,UACZA,OAAM,YAAY,KAAK,KAAK,IAC5BA,OAAM,QAAQ;AACxB,aAAO,EAAE,WAAW,KAAK;AAAA,IAC3B;AAAA,EACF;AACF;AAEA,SAAS,KAAK,OAAoB,SAA8C;AAC9E,MAAI,MAAM,OAAO,UAAW;AAC5B,QAAM,UAAU,oCAAoC,OAAO;AAC3D,MAAI,QAAQ,SAAS,0CAA0C;AAC7D,UAAM,OAAO,QAAQ,IAAI,MAAM,wDAAwD,CAAC;AACxF;AAAA,EACF;AAKA,MAAI,MAAM,OAAO,iBAAiB,+BAA+B;AAC/D,UAAM,OAAO,QAAQ,IAAI,MAAM,+CAA+C,CAAC;AAC/E;AAAA,EACF;AACA,QAAM,OAAO,MAAM,OAAO;AAC5B;AAEA,eAAe,cACb,OACA,SACe;AACf,MAAI,QAAQ,SAAS,YAAY;AAC/B,SAAK,OAAO,EAAE,MAAM,YAAY,IAAI,QAAQ,IAAI,IAAI,MAAM,QAAQ,EAAE,SAAS,KAAK,EAAE,CAAC;AACrF,UAAM,KAAK,QAAQ,UAAU,gBAAgB;AAC7C;AAAA,EACF;AACA;AACA,MAAI;AACF,UAAM,SAAS,MAAM,SAAS,QAAQ,IAAI,QAAQ,IAAI;AACtD,SAAK,OAAO,EAAE,MAAM,YAAY,IAAI,QAAQ,IAAI,IAAI,MAAM,OAAO,CAAC;AAAA,EACpE,SAAS,OAAO;AACd,SAAK,OAAO;AAAA,MACV,MAAM;AAAA,MACN,IAAI,QAAQ;AAAA,MACZ,IAAI;AAAA,MACJ,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MAC5D,WAAW,iBAAiB,QAAQ,MAAM,OAAO;AAAA,IACnD,CAAC;AAAA,EACH,UAAE;AACA;AAIA,qBAAiB;AAAA,EACnB;AACF;AAEA,SAAS,OAAO,OAAoB,OAAqB;AACvD,QAAM,UAAU;AAChB,MAAI,MAAM,OAAO,SAAS,0CAA0C;AAClE,UAAM,OAAO,QAAQ,IAAI,MAAM,uDAAuD,CAAC;AACvF;AAAA,EACF;AACA,SAAO,MAAM;AACX,UAAM,UAAU,MAAM,OAAO,QAAQ,IAAI;AACzC,QAAI,UAAU,EAAG;AACjB,UAAM,OAAO,MAAM,OAAO,MAAM,GAAG,OAAO;AAC1C,UAAM,SAAS,MAAM,OAAO,MAAM,UAAU,CAAC;AAC7C,QAAI,CAAC,KAAM;AACX,QAAI;AACJ,QAAI;AACF,gBAAU,KAAK,MAAM,IAAI;AAAA,IAC3B,QAAQ;AACN,YAAM,OAAO,QAAQ,IAAI,MAAM,0CAA0C,CAAC;AAC1E;AAAA,IACF;AACA,SAAK,cAAc,OAAO,OAAO;AAAA,EACnC;AACF;AAaA,SAAS,mBAAyB;AAChC,MAAI,YAAY,QAAQ,OAAO,KAAK,iBAAiB,KAAK,UAAW;AACrE,cAAY,WAAW,MAAM;AAC3B,gBAAY;AACZ,SAAK,KAAK,cAAc;AAAA,EAC1B,GAAG,MAAM;AACT,YAAU,QAAQ;AACpB;AAEA,eAAe,gBAA+B;AAC5C,QAAU,WAAW,eAAQ,YAAY,GAAG,EAAE,WAAW,KAAK,CAAC;AAC/D,QAAM,YAAY,GAAG,YAAY,IAAI,QAAQ,GAAG;AAChD,QAAU,eAAU,WAAW,GAAG,KAAK,UAAU,YAAY,MAAM,CAAC,CAAC;AAAA,GAAM;AAAA,IACzE,UAAU;AAAA,IACV,MAAM;AAAA,EACR,CAAC;AACD,MAAI;AACF,UAAU,YAAO,WAAW,YAAY;AAAA,EAC1C,QAAQ;AACN,UAAU,QAAG,cAAc,EAAE,OAAO,KAAK,CAAC;AAC1C,UAAU,YAAO,WAAW,YAAY;AAAA,EAC1C;AACF;AAEA,eAAe,sBAAqC;AAClD,MAAI;AACF,UAAM,UAAU,KAAK,MAAM,MAAU,cAAS,cAAc,MAAM,CAAC;AACnE,QAAI,QAAQ,QAAQ,QAAQ,IAAK,OAAU,QAAG,cAAc,EAAE,OAAO,KAAK,CAAC;AAAA,EAC7E,QAAQ;AAAA,EAER;AACF;AAEA,eAAe,KAAK,SAAgC;AAClD,MAAI,SAAU;AACd,aAAW;AACX,MAAI,UAAW,cAAa,SAAS;AACrC,cAAY;AACZ,QAAM,IAAI,QAAc,CAACC,cAAY,OAAO,MAAM,MAAMA,UAAQ,CAAC,CAAC;AAClE,aAAW,SAAS,QAAS,OAAM,OAAO,QAAQ;AAClD,UAAQ,MAAM;AACd,QAAM,SAAS,MAAM,EAAE,MAAM,MAAM;AAAA,EAAC,CAAC;AACrC,YAAU;AACV,QAAM,cAAc,EAAE,MAAM,MAAM;AAAA,EAAC,CAAC;AACpC,gBAAc,MAAM;AACpB,iBAAe;AACf,QAAM,oBAAoB;AAC1B,MAAI,QAAQ,aAAa,QAAS,OAAU,QAAG,UAAU,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM,MAAM;AAAA,EAAC,CAAC;AAC1F;AAEA,4CAA4C,QAAQ;AACpD,IAAM,SAAa,iBAAa,CAAC,WAAW;AAC1C,MAAI,UAAU;AACZ,WAAO,QAAQ;AACf;AAAA,EACF;AACA,MAAI,UAAW,cAAa,SAAS;AACrC,cAAY;AACZ,SAAO,YAAY,MAAM;AACzB,QAAM,QAAqB,EAAE,QAAQ,QAAQ,GAAG;AAChD,UAAQ,IAAI,KAAK;AACjB,OAAK,OAAO,EAAE,MAAM,SAAS,GAAG,WAAW,CAAC;AAC5C,SAAO,GAAG,QAAQ,CAAC,UAAkB,OAAO,OAAO,KAAK,CAAC;AACzD,SAAO,GAAG,SAAS,MAAM;AACvB,YAAQ,OAAO,KAAK;AACpB,qBAAiB;AAAA,EACnB,CAAC;AACH,CAAC;AAED,IAAI,0BAA0B;AAE9B,SAAS,qBAA2B;AAClC,SAAO,OAAO,QAAQ;AACxB;AAEA,OAAO,GAAG,SAAS,CAAC,UAAiC;AACnD,MAAI,MAAM,SAAS,gBAAgB,QAAQ,aAAa,SAAS;AAC/D,YAAQ,WAAW;AACnB;AAAA,EACF;AACA,MAAI,MAAM,SAAS,gBAAgB,CAAC,yBAAyB;AAC3D,8BAA0B;AAC1B,UAAM,QAAY,qBAAiB,QAAQ;AAC3C,UAAM,KAAK,WAAW,MAAM;AAC1B,YAAM,QAAQ;AACd,cAAQ,WAAW;AAAA,IACrB,CAAC;AACD,UAAM,KAAK,SAAS,MAAM;AACxB,YAAM,QAAQ;AACd,UAAI;AACF,QAAG,WAAO,UAAU,EAAE,OAAO,KAAK,CAAC;AAAA,MACrC,QAAQ;AAAA,MAER;AACA,gCAA0B;AAC1B,yBAAmB;AAAA,IACrB,CAAC;AACD;AAAA,EACF;AACA,UAAQ,WAAW;AACrB,CAAC;AAED,OAAO,GAAG,aAAa,MAAM;AAC3B,MAAI,QAAQ,aAAa,SAAS;AAChC,QAAI;AACF,MAAG,cAAU,UAAU,GAAK;AAAA,IAC9B,QAAQ;AAAA,IAER;AAAA,EACF;AACA,OAAK,cAAc;AACnB,OAAK,2BAA2B;AAAA,IAC9B,aAAa,OAAO;AAAA,IACpB,SAAS;AAAA,IACT,SAAS;AAAA,IACT,eAAe,CAAC,kBAAkB;AAAA,IAClC,SAAS,CAAC,UAAU;AAClB,yBAAmB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,IAC1E;AAAA,EACF,CAAC,EACE,KAAK,CAAC,UAAU;AACf,cAAU;AACV,eAAW,QAAQ,qBAAqB,OAAO,CAAC,EAAG,OAAM,iBAAiB,IAAI;AAC9E,uBAAmB;AAAA,EACrB,CAAC,EACA,MAAM,CAAC,UAAU;AAChB,uBAAmB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,EAC1E,CAAC;AACH,mBAAiB;AACnB,CAAC;AAED,QAAQ,KAAK,UAAU,MAAM,KAAK,KAAK,QAAQ,CAAC;AAChD,QAAQ,KAAK,WAAW,MAAM,KAAK,KAAK,SAAS,CAAC;AAClD,mBAAmB;",
-  "names": ["fs", "fsp", "path", "path", "watcher", "relative", "watcher", "stat", "createHash", "path", "randomUUID", "fs", "path", "createHash", "path", "randomUUID", "resolve", "parsed", "stat", "fs", "path", "fs", "path", "createHash", "createReadStream", "fs", "path", "createInterface", "fs", "path", "parsed", "createReadStream", "createInterface", "rangeCache", "trimmed", "normalize", "createHash", "stableStringify", "parsed", "chronicleDirectory", "durationMs", "readPath", "numberAt", "scopeKey", "createHash", "fs", "os", "path", "createHash", "endpoint", "randomUUID", "createRequire", "path", "encodeCursor", "decodeCursor", "parsed", "SCHEMA_VERSION", "Ctor", "loadDatabaseSync", "createRequire", "randomUUID", "parsed", "store", "resolve"]
-}