@wrongstack/core 0.297.0 → 0.298.1

package/dist/goal/index.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/tasking/task-store.ts", "../../src/utils/error.ts", "../../src/types/errors.ts", "../../src/types/task-graph.ts", "../../src/tasking/task-tracker.ts", "../../src/goal/phase-graph-builder.ts", "../../src/infrastructure/logger.ts", "../../src/utils/term.ts", "../../src/utils/color.ts", "../../src/goal/phase-board-mutations.ts", "../../src/goal/phase-orchestrator-queries.ts", "../../src/goal/phase-orchestrator-integration.ts", "../../src/goal/phase-orchestrator-runtime.ts", "../../src/goal/phase-orchestrator.ts", "../../src/goal/goal-runner.ts", "../../src/utils/instruction-file.ts", "../../src/goal/goal-planner.ts", "../../src/goal/goal-assessor.ts", "../../src/goal/types.ts", "../../src/goal/phase-store.ts", "../../src/utils/atomic-write.ts", "../../src/storage/goal-store.ts", "../../src/utils/wstack-paths.ts", "../../src/goal/checkpoint.ts"],
-  "sourcesContent": ["import type { TaskGraph } from '../types/task-graph.js';\nimport type { TaskStore } from './task-tracker.js';\n\n/**\n * In-memory task-graph store used by Goal and tests.\n *\n * The store clones the graph container on read/write so callers cannot replace\n * its Maps/arrays behind the store's back. Task nodes themselves intentionally\n * remain shared: TaskTracker owns node mutation and persists after each change.\n */\nexport class DefaultTaskStore implements TaskStore {\n  private readonly graphs = new Map<string, TaskGraph>();\n\n  async saveGraph(graph: TaskGraph): Promise<void> {\n    this.graphs.set(graph.id, this.cloneGraph(graph));\n  }\n\n  async loadGraph(id: string): Promise<TaskGraph | null> {\n    const graph = this.graphs.get(id);\n    return graph ? this.cloneGraph(graph) : null;\n  }\n\n  async listGraphs(): Promise<Array<{ id: string; title: string; updatedAt: number }>> {\n    return Array.from(this.graphs.values()).map((graph) => ({\n      id: graph.id,\n      title: graph.title,\n      updatedAt: graph.updatedAt,\n    }));\n  }\n\n  async deleteGraph(id: string): Promise<void> {\n    this.graphs.delete(id);\n  }\n\n  private cloneGraph(graph: TaskGraph): TaskGraph {\n    return {\n      ...graph,\n      nodes: new Map(graph.nodes),\n      edges: [...graph.edges],\n      rootNodes: [...graph.rootNodes],\n    };\n  }\n}\n", "/**\n * Converts an unknown error value to a human-readable string.\n * Used in 40+ files across the codebase to normalize error messaging.\n */\nexport function toErrorMessage(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\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", "export type TaskStatus = 'pending' | 'in_progress' | 'blocked' | 'failed' | 'review' | 'completed';\nexport type TaskPriority = 'critical' | 'high' | 'medium' | 'low';\nexport type TaskType = 'feature' | 'bugfix' | 'refactor' | 'docs' | 'test' | 'chore';\n\nexport interface TaskNode {\n  id: string;\n  title: string;\n  description: string;\n  type: TaskType;\n  priority: TaskPriority;\n  status: TaskStatus;\n  assignee?: string | undefined;\n  estimateHours?: number | undefined;\n  actualHours?: number | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n  parentId?: string | undefined;\n  children?: string[] | undefined;\n  createdAt: number;\n  updatedAt: number;\n  startedAt?: number | undefined; // set when status \u2192 in_progress\n  completedAt?: number | undefined;\n  metadata?: Record<string, unknown>;\n}\n\nexport interface TaskEdge {\n  id: string;\n  from: string;\n  to: string;\n  type: 'blocks' | 'depends_on' | 'relates_to' | 'implements';\n  weight?: number | undefined;\n}\n\nexport interface TaskGraph {\n  id: string;\n  specId: string;\n  title: string;\n  nodes: Map<string, TaskNode>;\n  edges: TaskEdge[];\n  rootNodes: string[];\n  createdAt: number;\n  updatedAt: number;\n}\n\nexport interface TaskDependency {\n  taskId: string;\n  blockedBy: string[];\n  blocking: string[];\n}\n\nexport interface TaskAssignment {\n  taskId: string;\n  assignee: string;\n  assignedAt: number;\n}\n\nexport interface TaskProgress {\n  total: number;\n  pending: number;\n  inProgress: number;\n  blocked: number;\n  failed: number;\n  review: number;\n  completed: number;\n  percentComplete: number;\n  estimatedHours: number;\n  actualHours: number;\n}\n\nexport interface TaskFilter {\n  status?: TaskStatus[] | undefined;\n  priority?: TaskPriority[] | undefined;\n  type?: TaskType[] | undefined;\n  assignee?: string[] | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n}\n\nexport interface TaskSort {\n  field: 'priority' | 'createdAt' | 'updatedAt' | 'status';\n  direction: 'asc' | 'desc';\n}\n\nexport interface CriticalPathResult {\n  taskIds: string[];\n  totalEstimateHours: number;\n  bottleneckTasks: string[];\n}\n\nexport function computeTaskProgress(graph: TaskGraph): TaskProgress {\n  let completed = 0;\n  let pending = 0;\n  let inProgress = 0;\n  let blocked = 0;\n  let failed = 0;\n  let review = 0;\n  let estimatedHours = 0;\n  let actualHours = 0;\n  for (const n of graph.nodes.values()) {\n    switch (n.status) {\n      case 'completed':\n        completed++;\n        break;\n      case 'pending':\n        pending++;\n        break;\n      case 'in_progress':\n        inProgress++;\n        break;\n      case 'blocked':\n        blocked++;\n        break;\n      case 'failed':\n        failed++;\n        break;\n      case 'review':\n        review++;\n        break;\n    }\n    estimatedHours += n.estimateHours ?? 0;\n    actualHours += n.actualHours ?? 0;\n  }\n  const total = graph.nodes.size;\n\n  return {\n    total,\n    pending,\n    inProgress,\n    blocked,\n    failed,\n    review,\n    completed,\n    percentComplete: total > 0 ? Math.round((completed / total) * 100) : 0,\n    estimatedHours,\n    actualHours,\n  };\n}\n\nexport function findCriticalPath(graph: TaskGraph): CriticalPathResult {\n  const nodes = Array.from(graph.nodes.values());\n  const criticalNodes = nodes.filter((n) => n.priority === 'critical');\n  const bottleneckTasks = criticalNodes\n    .filter((n) => graph.edges.some((e) => e.to === n.id && e.type === 'depends_on'))\n    .map((n) => n.id);\n\n  const totalEstimateHours = criticalNodes.reduce((sum, n) => sum + (n.estimateHours ?? 0), 0);\n\n  return {\n    taskIds: criticalNodes.map((n) => n.id),\n    totalEstimateHours,\n    bottleneckTasks,\n  };\n}\n\nexport function topologicalSort(graph: TaskGraph): string[] {\n  const visited = new Set<string>();\n  const inStack = new Set<string>();\n  const result: string[] = [];\n\n  function visit(id: string): void {\n    // Cycle: callers must detect cycles up-front if they care; we just stop recursing.\n    if (inStack.has(id)) return;\n    if (visited.has(id)) return;\n    if (!graph.nodes.has(id)) return;\n\n    visited.add(id);\n    inStack.add(id);\n\n    for (const edge of graph.edges) {\n      if (edge.from === id) visit(edge.to);\n    }\n\n    inStack.delete(id);\n    result.push(id);\n  }\n\n  for (const rootId of graph.rootNodes) {\n    visit(rootId);\n  }\n\n  return result;\n}\n\nexport type SerializableTaskGraphNodes =\n  | TaskNode[]\n  | Array<[string, TaskNode]>\n  | Record<string, TaskNode>;\n\nexport type SerializableTaskGraph = Omit<TaskGraph, 'nodes'> & {\n  nodes: SerializableTaskGraphNodes;\n};\n\nexport type SerializedTaskGraph = Omit<TaskGraph, 'nodes'> & {\n  nodes: TaskNode[];\n};\n\nexport function serializeTaskGraph(graph: TaskGraph): SerializedTaskGraph {\n  return {\n    ...graph,\n    nodes: Array.from(graph.nodes.values()),\n  };\n}\n\nexport function deserializeTaskGraph(input: SerializableTaskGraph): TaskGraph {\n  const nodes = new Map<string, TaskNode>();\n  if (Array.isArray(input.nodes)) {\n    for (const entry of input.nodes) {\n      if (Array.isArray(entry)) nodes.set(entry[0], { ...entry[1], id: entry[1].id || entry[0] });\n      else nodes.set(entry.id, entry);\n    }\n  } else {\n    for (const [id, node] of Object.entries(input.nodes)) {\n      nodes.set(id, { ...node, id: node.id || id });\n    }\n  }\n  return { ...input, nodes };\n}\n", "import { ERROR_CODES, SddError } from '../types/errors.js';\nimport type {\n  TaskFilter,\n  TaskGraph,\n  TaskNode,\n  TaskProgress,\n  TaskSort,\n} from '../types/task-graph.js';\nimport { computeTaskProgress } from '../types/task-graph.js';\nimport { toErrorMessage } from '../utils/error.js';\n\nexport interface TaskStore {\n  saveGraph(graph: TaskGraph): Promise<void>;\n  loadGraph(id: string): Promise<TaskGraph | null>;\n  listGraphs(): Promise<{ id: string; title: string; updatedAt: number }[]>;\n  deleteGraph(id: string): Promise<void>;\n}\n\nexport interface TaskTrackerOptions {\n  store: TaskStore;\n  /**\n   * Called when an in-the-background persistence (`saveGraph`) rejects.\n   * The synchronous TaskTracker methods (addNode/addEdge/updateNodeStatus)\n   * fire-and-forget their writes; without this, a failing store silently\n   * loses graph mutations. Defaults to a console.warn.\n   */\n  onPersistError?: ((err: unknown) => void) | undefined;\n}\n\nexport interface TaskTransition {\n  from: TaskNode['status'];\n  to: TaskNode['status'];\n  timestamp: number;\n  reason?: string | undefined;\n}\n\n/** A change notification emitted to `TaskTracker.subscribe` listeners. */\nexport interface TaskTrackerChange {\n  type: 'node_added' | 'node_updated' | 'status_changed' | 'node_removed';\n  nodeId: string;\n  /** For `node_removed` this is the node as it was just before deletion. */\n  node: TaskNode;\n  transition?: TaskTransition | undefined;\n}\n\nexport type TaskTrackerListener = (change: TaskTrackerChange) => void;\n\nexport class TaskTracker {\n  private graph: TaskGraph | null = null;\n  private transitions: TaskTransition[] = [];\n  private listeners: TaskTrackerListener[] = [];\n  private static readonly MAX_TRANSITIONS = 10_000;\n\n  constructor(private readonly opts: TaskTrackerOptions) {}\n\n  /**\n   * Subscribe to live task mutations (add / update / status change). Returns an\n   * unsubscribe fn. This is the hook the board projector uses to stream a live\n   * snapshot \u2014 the tracker was previously fire-and-forget with no observability.\n   */\n  subscribe(listener: TaskTrackerListener): () => void {\n    this.listeners.push(listener);\n    return () => {\n      const i = this.listeners.indexOf(listener);\n      if (i >= 0) this.listeners.splice(i, 1);\n    };\n  }\n\n  private notifyChange(change: TaskTrackerChange): void {\n    for (const l of this.listeners) {\n      try {\n        l(change);\n      } catch {\n        // A faulty listener must never break a tracker mutation.\n      }\n    }\n  }\n\n  /**\n   * Attach an existing graph (used by PhaseOrchestrator to associate a tracker\n   * with a phase's pre-built task graph without re-creating it).\n   */\n  setGraph(graph: TaskGraph): void {\n    this.graph = graph;\n  }\n\n  async createGraph(specId: string, title: string): Promise<TaskGraph> {\n    this.graph = {\n      id: crypto.randomUUID(),\n      specId,\n      title,\n      nodes: new Map(),\n      edges: [],\n      rootNodes: [],\n      createdAt: Date.now(),\n      updatedAt: Date.now(),\n    };\n    await this.opts.store.saveGraph(this.graph);\n    return this.graph;\n  }\n\n  async loadGraph(id: string): Promise<TaskGraph | null> {\n    this.graph = await this.opts.store.loadGraph(id);\n    return this.graph;\n  }\n\n  addNode(node: Omit<TaskNode, 'id' | 'createdAt' | 'updatedAt'>): TaskNode {\n    if (!this.graph)\n      throw new SddError({\n        message: 'No graph loaded',\n        code: ERROR_CODES.SDD_INVALID_STATE,\n      });\n\n    const now = Date.now();\n    const newNode: TaskNode = {\n      ...node,\n      id: crypto.randomUUID(),\n      status: node.status ?? 'pending',\n      createdAt: now,\n      updatedAt: now,\n    };\n\n    this.graph.nodes.set(newNode.id, newNode);\n\n    if (!node.parentId) {\n      this.graph.rootNodes.push(newNode.id);\n    }\n\n    this.graph.updatedAt = now;\n    this.persist();\n    this.notifyChange({ type: 'node_added', nodeId: newNode.id, node: newNode });\n\n    return newNode;\n  }\n\n  addEdge(from: string, to: string, type: TaskGraph['edges'][0]['type'] = 'depends_on'): void {\n    if (!this.graph)\n      throw new SddError({\n        message: 'No graph loaded',\n        code: ERROR_CODES.SDD_INVALID_STATE,\n      });\n\n    this.graph.edges.push({\n      id: crypto.randomUUID(),\n      from,\n      to,\n      type,\n    });\n    this.graph.updatedAt = Date.now();\n    this.persist();\n  }\n\n  /**\n   * Declare that `taskId` depends on `depId` (a `depends_on` edge `depId \u2192 taskId`),\n   * guarding against self-loops, duplicates, missing nodes, and cycles. Returns\n   * true if the dependency now holds (added or already present), false if it was\n   * rejected (would create a cycle / unknown node). This is the safe entry point\n   * for wiring agent-declared `dependsOn` references into the graph.\n   */\n  addDependency(depId: string, taskId: string): boolean {\n    if (!this.graph) return false;\n    if (depId === taskId) return false;\n    if (!this.graph.nodes.has(depId) || !this.graph.nodes.has(taskId)) return false;\n    // Already a blocker \u2014 idempotent success.\n    if (this.getBlockers(taskId).includes(depId)) return true;\n    // Cycle guard: if `depId` already (transitively) depends on `taskId`, adding\n    // `taskId \u2192 depId` would close a loop. Reject rather than deadlock the run.\n    if (this.dependsOnTransitively(depId, taskId, new Set())) return false;\n    this.addEdge(depId, taskId, 'depends_on');\n    return true;\n  }\n\n  /** True when `taskId` transitively depends on `targetId` (follows depends_on blockers). */\n  private dependsOnTransitively(taskId: string, targetId: string, seen: Set<string>): boolean {\n    if (taskId === targetId) return true;\n    if (seen.has(taskId)) return false;\n    seen.add(taskId);\n    for (const blocker of this.getBlockers(taskId)) {\n      if (this.dependsOnTransitively(blocker, targetId, seen)) return true;\n    }\n    return false;\n  }\n\n  /**\n   * Merge `patch` into a node's `metadata` (used for per-task model/provider/\n   * fallback assignment and the cancel marker). Persists + notifies as a node\n   * update. No-op if the node is missing.\n   */\n  patchMetadata(id: string, patch: Record<string, unknown>): void {\n    if (!this.graph) return;\n    const node = this.graph.nodes.get(id);\n    if (!node) return;\n    node.metadata = { ...node.metadata, ...patch };\n    node.updatedAt = Date.now();\n    this.graph.updatedAt = node.updatedAt;\n    this.persist();\n    this.notifyChange({ type: 'node_updated', nodeId: id, node });\n  }\n\n  /**\n   * Remove a node and every edge touching it. Intended for deleting a task that\n   * has not started yet \u2014 callers must gate on status (do not remove a running\n   * task). Dependents simply lose this blocker (re-evaluated by `canStart`).\n   * Returns true if a node was removed.\n   */\n  removeNode(id: string): boolean {\n    if (!this.graph) return false;\n    const node = this.graph.nodes.get(id);\n    if (!node) return false;\n    this.graph.nodes.delete(id);\n    this.graph.edges = this.graph.edges.filter((e) => e.from !== id && e.to !== id);\n    this.graph.rootNodes = this.graph.rootNodes.filter((r) => r !== id);\n    // Detach from any parent's children list.\n    for (const n of this.graph.nodes.values()) {\n      if (n.children?.includes(id)) n.children = n.children.filter((c) => c !== id);\n    }\n    this.graph.updatedAt = Date.now();\n    this.persist();\n    this.notifyChange({ type: 'node_removed', nodeId: id, node });\n    return true;\n  }\n\n  updateNodeStatus(id: string, status: TaskNode['status'], reason?: string): void {\n    if (!this.graph)\n      throw new SddError({\n        message: 'No graph loaded',\n        code: ERROR_CODES.SDD_INVALID_STATE,\n      });\n\n    const node = this.graph.nodes.get(id);\n    if (!node)\n      throw new SddError({\n        message: `Node ${id} not found`,\n        code: ERROR_CODES.SDD_NOT_READY,\n        context: { nodeId: id },\n      });\n\n    const from = node.status;\n    const now = Date.now();\n    node.status = status;\n    node.updatedAt = now;\n\n    if (status === 'completed') {\n      node.completedAt = now;\n      node.startedAt = node.startedAt ?? now; // ensure startedAt is set\n    }\n    if (status === 'in_progress') {\n      node.startedAt = now;\n    }\n\n    this.transitions.push({ from, to: status, timestamp: now, reason });\n    if (this.transitions.length > TaskTracker.MAX_TRANSITIONS) {\n      this.transitions.splice(0, this.transitions.length - TaskTracker.MAX_TRANSITIONS);\n    }\n\n    // Auto-unblock dependents\n    if (status === 'completed') {\n      this.unblockDependents(id);\n    }\n\n    // Auto-block blockers\n    if (status === 'in_progress') {\n      this.checkAndBlockIfNeeded(id);\n    }\n\n    this.graph.updatedAt = now;\n    this.persist();\n    this.notifyChange({\n      type: 'status_changed',\n      nodeId: id,\n      node,\n      transition: { from, to: status, timestamp: now, reason },\n    });\n  }\n\n  updateNode(\n    id: string,\n    patch: Partial<\n      Pick<TaskNode, 'title' | 'description' | 'priority' | 'estimateHours' | 'tags' | 'assignee'>\n    >,\n  ): void {\n    if (!this.graph)\n      throw new SddError({\n        message: 'No graph loaded',\n        code: ERROR_CODES.SDD_INVALID_STATE,\n      });\n\n    const node = this.graph.nodes.get(id);\n    if (!node)\n      throw new SddError({\n        message: `Node ${id} not found`,\n        code: ERROR_CODES.SDD_NOT_READY,\n        context: { nodeId: id },\n      });\n\n    if (patch.title !== undefined) node.title = patch.title;\n    if (patch.description !== undefined) node.description = patch.description;\n    if (patch.priority !== undefined) node.priority = patch.priority;\n    if (patch.estimateHours !== undefined) node.estimateHours = patch.estimateHours;\n    if (patch.tags !== undefined) node.tags = patch.tags;\n    if (patch.assignee !== undefined) node.assignee = patch.assignee;\n    node.updatedAt = Date.now();\n    this.graph.updatedAt = node.updatedAt;\n    this.persist();\n    this.notifyChange({ type: 'node_updated', nodeId: id, node });\n  }\n\n  getNode(id: string): TaskNode | undefined {\n    return this.graph?.nodes.get(id);\n  }\n\n  getAllNodes(filter?: TaskFilter, sort?: TaskSort): TaskNode[] {\n    if (!this.graph) return [];\n\n    let nodes = Array.from(this.graph.nodes.values());\n\n    if (filter) {\n      nodes = nodes.filter((n) => {\n        if (filter.status?.length && !filter.status.includes(n.status)) return false;\n        if (filter.priority?.length && !filter.priority.includes(n.priority)) return false;\n        if (filter.type?.length && !filter.type.includes(n.type)) return false;\n        if (filter.assignee?.length && n.assignee && !filter.assignee.includes(n.assignee))\n          return false;\n        if (filter.tags?.length && n.tags && !n.tags.some((t) => filter.tags?.includes(t)))\n          return false;\n        if (filter.specRequirementId && n.specRequirementId !== filter.specRequirementId)\n          return false;\n        return true;\n      });\n    }\n\n    if (sort) {\n      nodes.sort((a, b) => {\n        const cmp = compareByField(a, b, sort.field);\n        return sort.direction === 'asc' ? cmp : -cmp;\n      });\n    }\n\n    return nodes;\n  }\n\n  getChildren(parentId: string): TaskNode[] {\n    if (!this.graph) return [];\n    return Array.from(this.graph.nodes.values()).filter((n) => n.parentId === parentId);\n  }\n\n  getDependents(taskId: string): string[] {\n    if (!this.graph) return [];\n    return this.graph.edges\n      .filter((e) => e.from === taskId && e.type === 'depends_on')\n      .map((e) => e.to);\n  }\n\n  getBlockers(taskId: string): string[] {\n    if (!this.graph) return [];\n    return this.graph.edges\n      .filter((e) => e.to === taskId && e.type === 'depends_on')\n      .map((e) => e.from);\n  }\n\n  canStart(taskId: string): boolean {\n    const blockers = this.getBlockers(taskId);\n    return blockers.every((id) => {\n      const node = this.graph?.nodes.get(id);\n      // A task can start when all blockers are either completed or failed.\n      // Failed blockers should not permanently deadlock dependent tasks.\n      return node?.status === 'completed' || node?.status === 'failed';\n    });\n  }\n\n  getProgress(): TaskProgress {\n    if (!this.graph) {\n      return {\n        total: 0,\n        pending: 0,\n        inProgress: 0,\n        blocked: 0,\n        failed: 0,\n        review: 0,\n        completed: 0,\n        percentComplete: 0,\n        estimatedHours: 0,\n        actualHours: 0,\n      };\n    }\n    return computeTaskProgress(this.graph);\n  }\n\n  getTransitions(_taskId?: string): TaskTransition[] {\n    return [...this.transitions];\n  }\n\n  private unblockDependents(completedId: string): void {\n    if (!this.graph) return;\n    const dependents = this.getDependents(completedId);\n    for (const depId of dependents) {\n      const dep = this.graph.nodes.get(depId);\n      if (dep?.status === 'blocked') {\n        // Check if all blockers are now completed\n        const remainingBlockers = this.getBlockers(depId);\n        const allUnblocked = remainingBlockers.every((id) => {\n          const blocker = this.graph?.nodes.get(id);\n          return blocker?.status === 'completed' || blocker?.status === 'failed';\n        });\n        if (allUnblocked) {\n          dep.status = 'pending';\n          dep.updatedAt = Date.now();\n        }\n      }\n    }\n  }\n\n  private checkAndBlockIfNeeded(taskId: string): void {\n    if (!this.graph) return;\n    const blockers = this.getBlockers(taskId);\n    const someBlocked = blockers.some((id) => {\n      const blocker = this.graph?.nodes.get(id);\n      // A task is only blocked by incomplete blockers that haven't failed.\n      // Failed tasks should not block their dependents.\n      return blocker?.status !== 'completed' && blocker?.status !== 'failed';\n    });\n    if (someBlocked) {\n      const node = this.graph.nodes.get(taskId);\n      if (node) {\n        node.status = 'blocked';\n        node.updatedAt = Date.now();\n      }\n    }\n  }\n\n  /**\n   * Fire-and-forget persistence with attached error handler.\n   * Synchronous mutators (addNode/addEdge/updateNodeStatus) use this to\n   * avoid forcing an async cascade through every caller; if the store\n   * is missing or throwing, the error is surfaced via onPersistError.\n   */\n  private persist(): void {\n    if (!this.graph) return;\n    this.opts.store.saveGraph(this.graph).catch((err) => {\n      this.opts.onPersistError\n        ? this.opts.onPersistError(err)\n        : console.warn(\n            JSON.stringify({\n              level: 'warn',\n              event: 'task_tracker.save_graph_failed',\n              message: toErrorMessage(err),\n              timestamp: new Date().toISOString(),\n            }),\n          );\n    });\n  }\n}\n\n// Sort comparison helpers\nconst PRIORITY_RANK: Record<TaskNode['priority'], number> = {\n  critical: 0,\n  high: 1,\n  medium: 2,\n  low: 3,\n};\nconst STATUS_RANK: Record<TaskNode['status'], number> = {\n  in_progress: 0,\n  pending: 1,\n  review: 2,\n  blocked: 3,\n  failed: 4,\n  completed: 5,\n};\n\nfunction compareByField(a: TaskNode, b: TaskNode, field: TaskSort['field']): number {\n  switch (field) {\n    case 'priority':\n      return PRIORITY_RANK[a.priority] - PRIORITY_RANK[b.priority];\n    case 'status':\n      return STATUS_RANK[a.status] - STATUS_RANK[b.status];\n    case 'createdAt':\n      return a.createdAt - b.createdAt;\n    case 'updatedAt':\n      return a.updatedAt - b.updatedAt;\n  }\n}\n", "import { DefaultTaskStore, TaskTracker, type TaskStore } from '../tasking/index.js';\nimport type { TaskGraph, TaskPriority } from '../types/task-graph.js';\nimport type { PhaseGraph, PhaseNode, PhaseTemplate } from './types.js';\n\nexport interface PhaseGraphBuilderOptions {\n  title: string;\n  description?: string | undefined;\n  /** Ordered phase templates. */\n  phases: PhaseTemplate[];\n  /** Autonomous mode. */\n  autonomous?: boolean | undefined;\n  /** Stop on failure. */\n  stopOnFailure?: boolean | undefined;\n  /** Optional external TaskStore. */\n  externalTaskStore?: TaskStore | undefined;\n  /** Split into separate kanban boards per phase. */\n  multiBoard?: boolean | undefined;\n  /** Run typecheck/lint verification after each task. */\n  verifyTasks?: boolean | undefined;\n  /** Enable chimera auto-review for this run. */\n  chimeraReview?: boolean | undefined;\n}\n\n/**\n * PhaseGraphBuilder - builds project phases and a task graph for each phase.\n *\n * Usage:\n *   const builder = new PhaseGraphBuilder({\n *     title: 'Auth System Refactor',\n *     phases: [\n *       { name: 'Discovery', description: '...', priority: 'high', estimateHours: 2, parallelizable: false },\n *       { name: 'Design', description: '...', priority: 'critical', estimateHours: 4, parallelizable: false },\n *       { name: 'Implementation', description: '...', priority: 'critical', estimateHours: 12, parallelizable: false },\n *       { name: 'Testing', description: '...', priority: 'high', estimateHours: 6, parallelizable: true },\n *       { name: 'Deployment', description: '...', priority: 'medium', estimateHours: 2, parallelizable: false },\n *     ]\n *   });\n *   const graph = await builder.build();\n */\nexport class PhaseGraphBuilder {\n  constructor(private readonly opts: PhaseGraphBuilderOptions) {}\n\n  async build(): Promise<PhaseGraph> {\n    const graphId = crypto.randomUUID();\n    const phases = new Map<string, PhaseNode>();\n    const phaseIds: string[] = [];\n\n    // Create a PhaseNode from each phase template.\n    for (let i = 0; i < this.opts.phases.length; i++) {\n      const tmpl = this.opts.phases[i] ?? { name: '', description: '', tasks: [], taskTemplates: [], parallelizable: false, priority: 'medium' as const, estimateHours: 0 };\n      const phaseId = crypto.randomUUID();\n      phaseIds.push(phaseId);\n\n      // Use the external store or create a new in-memory task store.\n      const store = this.opts.externalTaskStore ?? new DefaultTaskStore();\n      const tracker = new TaskTracker({ store });\n      const taskGraph = await tracker.createGraph(phaseId, `${tmpl.name} Tasks`);\n\n      // Add task templates when present.\n      if (tmpl.taskTemplates && tmpl.taskTemplates.length > 0) {\n        for (const tt of tmpl.taskTemplates) {\n          tracker.addNode({\n            title: tt.title,\n            description: tt.description,\n            type: tt.type,\n            priority: tt.priority,\n            status: 'pending',\n            estimateHours: tt.estimateHours,\n            tags: tt.tags ?? [],\n          });\n        }\n      }\n\n      const phase: PhaseNode = {\n        id: phaseId,\n        name: tmpl.name,\n        description: tmpl.description,\n        status: 'pending',\n        taskGraph,\n        dependsOn: i > 0 ? [phaseIds[i - 1] ?? ''] : [],\n        nextPhases: i < this.opts.phases.length - 1 ? [phaseIds[i + 1] ?? ''] : [],\n        parallelizable: tmpl.parallelizable,\n        priority: tmpl.priority,\n        estimateHours: tmpl.estimateHours,\n        assignedAgents: [],\n        createdAt: Date.now(),\n        updatedAt: Date.now(),\n      };\n\n      phases.set(phaseId, phase);\n    }\n\n    // Second pass: fill in the forward `nextPhases` links \u2014 the next phase id was\n    // not yet known while each phase was created. `dependsOn` (the backward link)\n    // is already correct from the first pass (the previous id always exists), so\n    // it is intentionally NOT recomputed here.\n    const phaseArray = Array.from(phases.values());\n    for (let i = 0; i < phaseArray.length; i++) {\n      const phase = phaseArray[i];\n      if (!phase) continue;\n      phase.nextPhases = i < phaseArray.length - 1 ? [phaseArray[i + 1]?.id ?? ''] : [];\n    }\n\n    const graph: PhaseGraph = {\n      id: graphId,\n      title: this.opts.title,\n      description: this.opts.description ?? '',\n      phases,\n      rootPhaseIds: phaseIds.length > 0 ? [phaseIds[0] ?? ''] : [],\n      activePhaseIds: [],\n      completedPhaseIds: [],\n      failedPhaseIds: [],\n      autonomous: this.opts.autonomous ?? true,\n      stopOnComplete: true,\n      multiBoard: this.opts.multiBoard,\n      verifyTasks: this.opts.verifyTasks,\n      chimeraReview: this.opts.chimeraReview,\n      createdAt: Date.now(),\n      updatedAt: Date.now(),\n    };\n\n    return graph;\n  }\n\n  /**\n   * Create phases from an existing TaskGraph.\n   * Groups tasks into phases using topological sort so dependencies\n   * stay in the same phase wherever possible.\n   */\n  static fromTaskGraph(\n    taskGraph: TaskGraph,\n    options: Omit<PhaseGraphBuilderOptions, 'phases'> & {\n      /** Number of tasks per phase. Defaults to 5. */\n      tasksPerPhase?: number | undefined;\n    },\n  ): Promise<PhaseGraph> {\n    const tasksPerPhase = options.tasksPerPhase ?? 5;\n    const nodes = Array.from(taskGraph.nodes.values());\n\n    // Build adjacency: for each node, which nodes depend on it.\n    const dependents = new Map<string, string[]>();\n    for (const edge of taskGraph.edges) {\n      const list = dependents.get(edge.from) ?? [];\n      list.push(edge.to);\n      dependents.set(edge.from, list);\n    }\n\n    // Topological sort (Kahn's algorithm) \u2014 tasks that are depended-on come first.\n    const inDegree = new Map<string, number>();\n    for (const node of nodes) inDegree.set(node.id, 0);\n    for (const edge of taskGraph.edges) {\n      inDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);\n    }\n\n    const queue: string[] = [];\n    for (const [id, degree] of inDegree) {\n      if (degree === 0) queue.push(id);\n    }\n\n    const prioOrder: Record<TaskPriority, number> = {\n      critical: 0,\n      high: 1,\n      medium: 2,\n      low: 3,\n    };\n\n    const topoSorted: string[] = [];\n    while (queue.length > 0) {\n      // Prioritize by critical \u2192 high \u2192 medium \u2192 low within the same level.\n      queue.sort((a, b) => {\n        const na = taskGraph.nodes.get(a);\n        const nb = taskGraph.nodes.get(b);\n        const naPrio = na ? prioOrder[na.priority] : 4;\n        const nbPrio = nb ? prioOrder[nb.priority] : 4;\n        return naPrio - nbPrio;\n      });\n      const id = queue.shift()!;\n      topoSorted.push(id);\n      for (const depId of dependents.get(id) ?? []) {\n        const deg = (inDegree.get(depId) ?? 1) - 1;\n        inDegree.set(depId, deg);\n        if (deg === 0) queue.push(depId);\n      }\n    }\n\n    // Group topologically-sorted nodes into phases, keeping dependent\n    // tasks close together.\n    const groups: string[][] = [];\n    let currentGroup: string[] = [];\n    const assigned = new Set<string>();\n\n    for (const id of topoSorted) {\n      if (assigned.has(id)) continue;\n      assigned.add(id);\n      currentGroup.push(id);\n\n      // Collect any direct dependents of this task into the same phase\n      // as long as we haven't exceeded the size limit.\n      const deps = dependents.get(id) ?? [];\n      for (const depId of deps) {\n        if (!assigned.has(depId) && currentGroup.length < tasksPerPhase) {\n          assigned.add(depId);\n          currentGroup.push(depId);\n        }\n      }\n\n      if (currentGroup.length >= tasksPerPhase) {\n        groups.push(currentGroup);\n        currentGroup = [];\n      }\n    }\n    if (currentGroup.length > 0) groups.push(currentGroup);\n\n    const phaseTemplates: PhaseTemplate[] = groups.map((groupIds, idx) => {\n      const group = groupIds\n        .map((id) => taskGraph.nodes.get(id))\n        .filter((n): n is NonNullable<typeof n> => n != null);\n      const hasCritical = group.some((t) => t.priority === 'critical');\n      const totalHours = group.reduce((sum, t) => sum + (t.estimateHours ?? 2), 0);\n\n      return {\n        name: `Phase ${idx + 1}: ${group[0]?.title.slice(0, 30) ?? 'Tasks'}`,\n        description: group.map((t) => t.title).join(', '),\n        priority: hasCritical ? 'critical' : 'high',\n        estimateHours: totalHours,\n        parallelizable: false,\n        taskTemplates: group.map((t) => ({\n          title: t.title,\n          description: t.description,\n          type: t.type,\n          priority: t.priority,\n          estimateHours: t.estimateHours ?? 2,\n          tags: t.tags ?? [],\n        })),\n      };\n    });\n\n    const builder = new PhaseGraphBuilder({\n      ...options,\n      phases: phaseTemplates,\n    });\n\n    return builder.build();\n  }\n}\n", "import * as fsp from 'node:fs/promises';\nimport * as path from 'node:path';\nimport type { Logger, LogLevel } from '../types/logger.js';\nimport { color } from '../utils/color.js';\nimport { writeErr } from '../utils/term.js';\n\nconst LEVEL_RANK: Record<LogLevel, number> = {\n  error: 0,\n  warn: 1,\n  info: 2,\n  debug: 3,\n  trace: 4,\n};\n\nconst COLORS: Record<LogLevel, (s: string) => string> = {\n  error: color.red,\n  warn: color.yellow,\n  info: color.cyan,\n  debug: color.gray,\n  trace: color.dim,\n};\n\nconst LOG_LEVELS = new Set<LogLevel>(['error', 'warn', 'info', 'debug', 'trace']);\nconst LOG_FORMATS = new Set<string>(['pretty', 'json']);\n\nexport type LogFormat = 'pretty' | 'json';\n\nexport interface DefaultLoggerOptions {\n  level?: LogLevel | undefined;\n  file?: string | undefined;\n  /**\n   * @deprecated Use `format: 'json'` instead. Kept for backward compat\n   * with existing callers but has no effect on output \u2014 the `format`\n   * option controls whether stderr receives pretty-printed or JSON lines.\n   */\n  pretty?: boolean | undefined;\n  /** Output format for stderr. `pretty` (colored, human-readable) or `json` (machine-parseable). Defaults to `WRONGSTACK_LOG_FORMAT` env var, falling back to `pretty`. */\n  format?: LogFormat | undefined;\n  bindings?: Record<string, unknown>;\n  /**\n   * When false, suppress stderr output entirely \u2014 only write to the log\n   * file (if configured). Use this in TUI mode so plugin/library log\n   * messages don't interleave with Ink's terminal rendering.\n   * Default: true (stderr output is enabled).\n   */\n  stderr?: boolean | undefined;\n  /**\n   * Rotate the log file once it exceeds this many bytes: the current file is\n   * renamed to `<file>.1` (replacing any previous one) and a fresh file\n   * starts. Bounds total disk to ~2\u00D7 this value. Default 10 MB.\n   */\n  maxFileBytes?: number | undefined;\n}\n\nexport class DefaultLogger implements Logger {\n  /** How many file writes between rotation size checks (statSync is not free). */\n  private static readonly ROTATE_CHECK_EVERY = 100;\n  private static readonly MAX_PENDING_FILE_WRITES = 2_000;\n  private static readonly MAX_PENDING_FILE_BYTES = 8 * 1024 * 1024;\n\n  level: LogLevel;\n  private file?: string | undefined;\n  private bindings: Record<string, unknown>;\n  private format: LogFormat;\n  private stderr: boolean;\n  private maxFileBytes: number;\n  private writesSinceRotateCheck = 0;\n  /**\n   * Serialized async tail for file writes. Every appendFile (and any\n   * chained rotation) is awaited through this promise so file I/O\n   * never overlaps itself \u2014 preserving the per-line ordering the\n   * sync version had, but without blocking the caller thread. Any\n   * rejection is swallowed (`catch(() => {})`) because logging must\n   * never crash the host.\n   *\n   * Children share the parent's tail: `child.tail === parent.tail`\n   * for the lifetime of the chain. Read/write access goes through\n   * `_tail` so that, when a child has been wired to a parent, both\n   * `enqueueRotate` and `log` always observe the parent's current tail\n   * rather than a stale snapshot taken at `child()` time.\n   */\n  private tail: Promise<void> = Promise.resolve();\n  private parent: DefaultLogger | null = null;\n  private pendingFileWrites = 0;\n  private pendingFileBytes = 0;\n\n  private get root(): DefaultLogger {\n    return this.parent ? this.parent.root : this;\n  }\n\n  /**\n   * Resolve the current tail. For the root logger this is the field;\n   * for a child logger we always read through the parent so that a\n   * child's appends land on the parent's most recent tail, and a\n   * parent's `flush()` waits for everything the child chained.\n   */\n  private get _tail(): Promise<void> {\n    return this.parent ? this.parent._tail : this.tail;\n  }\n  private set _tail(next: Promise<void>) {\n    if (this.parent) this.parent.tail = next;\n    else this.tail = next;\n  }\n\n  constructor(opts: DefaultLoggerOptions = {}) {\n    this.level = opts.level ?? parseLogLevel(process.env.WRONGSTACK_LOG_LEVEL);\n    this.file = opts.file;\n    this.bindings = opts.bindings ?? {};\n    this.format = opts.format ?? parseLogFormat(process.env.WRONGSTACK_LOG_FORMAT);\n    this.stderr = opts.stderr !== false; // default true\n    this.maxFileBytes = opts.maxFileBytes ?? 10 * 1024 * 1024;\n    if (this.file) {\n      // Chain mkdir onto the file-write tail so the first append can't\n      // race a still-pending mkdir (especially under tests that call\n      // `flush()` immediately after `info()`). mkdir is best-effort;\n      // a rejection only blocks subsequent appends in the chain that\n      // observed it via the rejected promise, which would skip the\n      // append \u2014 that is acceptable because ENOENT/EEXIST/EPERM all\n      // either are no-ops or indicate an unrecoverable environment.\n      const dir = path.dirname(this.file);\n      this._tail = this._tail\n        .then(async () => {\n          await fsp.mkdir(dir, { recursive: true });\n        })\n        .catch(() => undefined);\n    }\n  }\n\n  error(msg: string, ctx?: unknown): void {\n    this.log('error', msg, ctx);\n  }\n  warn(msg: string, ctx?: unknown): void {\n    this.log('warn', msg, ctx);\n  }\n  info(msg: string, ctx?: unknown): void {\n    this.log('info', msg, ctx);\n  }\n  debug(msg: string, ctx?: unknown): void {\n    this.log('debug', msg, ctx);\n  }\n  trace(msg: string, ctx?: unknown): void {\n    this.log('trace', msg, ctx);\n  }\n\n  child(bindings: Record<string, unknown>): Logger {\n    // Construct without invoking the class constructor (which would mkdir\n    // again and create a separate file-write tail). The parent and child\n    // must share the same tail so `parent.flush()` waits for child\n    // appends too \u2014 otherwise a test that flushes the parent after\n    // `child.info(...)` would race the child append and observe an empty\n    // file. Sharing the tail preserves the order the parent originally\n    // had via its serialised file-write queue.\n    const child = Object.create(DefaultLogger.prototype) as DefaultLogger;\n    child.level = this.level;\n    child.file = this.file;\n    child.bindings = { ...this.bindings, ...bindings };\n    child.format = this.format;\n    child.stderr = this.stderr;\n    child.maxFileBytes = this.maxFileBytes;\n    child.parent = this;\n    child.writesSinceRotateCheck = this.writesSinceRotateCheck;\n    return child;\n  }\n\n  /**\n   * Wait until all queued file writes (and any pending rotation) have\n   * completed. `log()` is fire-and-forget by design \u2014 the caller never\n   * blocks on disk \u2014 so tests, shutdown handlers, and processes that\n   * need a deterministic \"everything is on disk now\" guarantee should\n   * `await logger.flush()` before reading the file or exiting.\n   */\n  flush(): Promise<void> {\n    return this._tail;\n  }\n\n  /**\n   * Size-based rotation: when the file outgrows `maxFileBytes`, rename it to\n   * `<file>.1` (dropping the previous `.1`) so the live file restarts empty.\n   * Checked on the first write and every ROTATE_CHECK_EVERY writes after.\n   * Best-effort: a rename can fail on Windows while another process holds\n   * the file \u2014 the next check retries. Multiple processes appending to the\n   * same log all run this check; whoever crosses the threshold first wins.\n   *\n   * Async: the rotation runs on the file-write tail (so its writes don't\n   * interleave with the next append), and the caller never blocks on a\n   * statSync / renameSync syscall on the hot log path.\n   */\n  private enqueueRotate(file: string): void {\n    if (this.writesSinceRotateCheck++ % DefaultLogger.ROTATE_CHECK_EVERY !== 0) return;\n    this._tail = this._tail\n      .then(async () => {\n        let st;\n        try {\n          st = await fsp.stat(file);\n        } catch {\n          return; // file missing \u2014 nothing to rotate\n        }\n        if (st.size < this.maxFileBytes) return;\n        try {\n          await fsp.rm(`${file}.1`, { force: true });\n          await fsp.rename(file, `${file}.1`);\n        } catch {\n          // file locked, or raced by another process \u2014 ignore\n        }\n      })\n      .catch(() => undefined);\n  }\n\n  private log(level: LogLevel, msg: string, ctx?: unknown): void {\n    const r = LEVEL_RANK[level];\n    const allowed = LEVEL_RANK[this.level];\n    if (r > allowed) return;\n    const ts = new Date().toISOString();\n    const entry: Record<string, unknown> = { ts, level, msg, ...this.bindings };\n    if (ctx !== undefined) {\n      entry.ctx = ctx instanceof Error ? { message: ctx.message, stack: ctx.stack } : ctx;\n    }\n    // Disk: JSON line. Serialized through `_tail` so concurrent log\n    // calls preserve per-line order without blocking the caller on\n    // sync file I/O. Children route through their parent's tail, so\n    // a parent's `flush()` waits for every chained child append.\n    if (this.file) {\n      const line = `${JSON.stringify(entry)}\\n`;\n      const bytes = Buffer.byteLength(line, 'utf8');\n      const root = this.root;\n      if (\n        root.pendingFileWrites < DefaultLogger.MAX_PENDING_FILE_WRITES &&\n        bytes <= DefaultLogger.MAX_PENDING_FILE_BYTES &&\n        root.pendingFileBytes + bytes <= DefaultLogger.MAX_PENDING_FILE_BYTES\n      ) {\n        root.pendingFileWrites += 1;\n        root.pendingFileBytes += bytes;\n        this.enqueueRotate(this.file);\n        this._tail = this._tail\n          .then(() => fsp.appendFile(this.file!, line))\n          .catch(() => undefined)\n          .finally(() => {\n            root.pendingFileWrites = Math.max(0, root.pendingFileWrites - 1);\n            root.pendingFileBytes = Math.max(0, root.pendingFileBytes - bytes);\n          });\n      }\n    }\n    // Stderr: pretty or json. Suppressed when this.stderr is false (TUI mode)\n    // so plugin/library log messages don't interleave with Ink's rendering.\n    if (!this.stderr) return;\n    if (this.format === 'json') {\n      writeErr(`${JSON.stringify(entry)}\\n`);\n    } else {\n      const head = `${color.dim(ts)} ${COLORS[level](level.toUpperCase().padEnd(5))} ${msg}`;\n      if (ctx !== undefined) {\n        writeErr(`${head} ${formatCtx(ctx)}\\n`);\n      } else {\n        writeErr(`${head}\\n`);\n      }\n    }\n  }\n}\n\nfunction parseLogLevel(raw: string | undefined): LogLevel {\n  return raw && LOG_LEVELS.has(raw as LogLevel) ? (raw as LogLevel) : 'info';\n}\n\nfunction parseLogFormat(raw: string | undefined): LogFormat {\n  return raw && LOG_FORMATS.has(raw) ? (raw as LogFormat) : 'pretty';\n}\n\nfunction formatCtx(ctx: unknown): string {\n  if (ctx instanceof Error) return color.dim(ctx.message);\n  if (typeof ctx === 'string') return color.dim(ctx);\n  try {\n    return color.dim(JSON.stringify(ctx));\n  } catch {\n    return color.dim(String(ctx));\n  }\n}\n\n/**\n * A logger that silently discards all messages. Used during boot before\n * the real logger is configured, and in test contexts where logging\n * would be noise.\n */\nexport const noOpLogger: Logger = {\n  // 'error' is the quietest level the Logger contract offers; the methods\n  // discard everything regardless, this only matters to level checks.\n  level: 'error',\n  error: () => {},\n  warn: () => {},\n  info: () => {},\n  debug: () => {},\n  trace: () => {},\n  child: () => noOpLogger,\n};\n", "/**\n * TTY detection helpers \u2014 the single source of truth for \"is this process\n * running against a real terminal?\". Replaces ad-hoc `process.stdin.isTTY`\n * / `process.stdout.isTTY` checks scattered across the codebase so that:\n *\n *   1. test code can mock a single module instead of stubbing `isTTY` on\n *      every ReadStream/WriteStream the test happens to touch;\n *   2. a future TTY-detection source (an env var override, a Windows\n *      ConPTY workaround, \u2026) lands in one place;\n *   3. `isInteractive()` encodes the rule the project already used inline\n *      (\"both streams are TTYs AND we're not running under CI\") in one\n *      testable helper instead of the same 3-condition check in two\n *      different files.\n *\n * Scope: detection only. Raw-mode control (`setRawMode`), resize\n * subscriptions, and write-injection belong to a future, larger TTY\n * abstraction; this module is the smallest pull that gives us a\n * testable seam and dedups 20+ call sites.\n */\n\nconst hasStdout = (): boolean => typeof process !== 'undefined' && !!process.stdout;\nconst hasStdin = (): boolean => typeof process !== 'undefined' && !!process.stdin;\n\n/** True when `process.stdout` is attached to a terminal (not a pipe/file). */\nexport function isStdoutTTY(): boolean {\n  return hasStdout() && Boolean(process.stdout.isTTY);\n}\n\n/** True when `process.stdin` is attached to a terminal (not a pipe/file). */\nexport function isStdinTTY(): boolean {\n  return hasStdin() && Boolean(process.stdin.isTTY);\n}\n\n/**\n * True when the current process is an interactive session: both stdin and\n * stdout are TTYs. Callers that also need a \"not a single-shot invocation\"\n * or \"not under CI\" check should layer that on top \u2014 keeping this helper\n * minimal preserves the original inline checks it replaces.\n */\nexport function isInteractive(): boolean {\n  return isStdinTTY() && isStdoutTTY();\n}\n\n/** Current terminal size in characters, with a 24\u00D780 fallback for non-TTYs. */\nexport function getTermSize(): { rows: number; cols: number } {\n  if (!hasStdout()) return { rows: 24, cols: 80 };\n  return {\n    rows: process.stdout.rows ?? 24,\n    cols: process.stdout.columns ?? 80,\n  };\n}\n\n/**\n * Subscribe to terminal resize events. `cb` is called with the new size each\n * time the underlying stream emits `resize`. Returns a cleanup function the\n * caller MUST call on dispose to remove the listener \u2014 leaving a stale\n * `resize` listener on a disposed component leaks the closure (and the\n * component itself, transitively) until the process exits.\n *\n * The stream argument defaults to `process.stdout`. Pass an explicit\n * `NodeJS.WriteStream` when the caller already owns one (e.g. a status line\n * that targets an injected `out` for testability). For non-TTY streams no\n * listener is registered and the returned cleanup is a no-op.\n */\nexport function onResize(\n  cb: (size: { rows: number; cols: number }) => void,\n  stream: NodeJS.WriteStream = process.stdout,\n): () => void {\n  if (!stream || typeof stream.on !== 'function') return () => {};\n  const handler = (): void => {\n    cb({\n      rows: stream.rows ?? 24,\n      cols: stream.columns ?? 80,\n    });\n  };\n  stream.on('resize', handler);\n  return () => {\n    stream.off('resize', handler);\n  };\n}\n\n/**\n * Toggle raw mode on a TTY stdin stream. Returns `true` when the toggle was\n * applied, `false` when the stream is null, not a TTY, or doesn't expose\n * `setRawMode` (pipes, file descriptors, Windows ConPTY edge cases). Callers\n * that need to restore the previous mode should snapshot `input.isRaw`\n * BEFORE the call and pass the value to a second call to flip back.\n *\n * Use this helper to drop the now-redundant\n * `if (input.isTTY) input.setRawMode(...)` ceremony at every call site.\n */\nexport function setRawMode(input: NodeJS.ReadStream, mode: boolean): boolean {\n  if (input?.isTTY !== true) return false;\n  if (typeof input.setRawMode !== 'function') return false;\n  input.setRawMode(mode);\n  return true;\n}\n\n/**\n * Bracket installed by the interactive input reader while a `readline`\n * prompt is on screen. Out-of-band terminal writes \u2014 logger WARN/INFO\n * lines, async activity from the Telegram bridge, etc. \u2014 go to the same\n * physical terminal as the half-typed prompt but readline has no idea they\n * happened, so it never repaints. The result is the classic corruption the\n * user sees: every async line strands the in-progress draft as a fresh\n * scrollback row (sometimes with its cursor underline).\n *\n * The guard closes that gap. `suspend()` wipes the draft row so the message\n * prints clean; `resume()` repaints the prompt + draft (cursor preserved).\n * When no prompt is active the guard is `null` and writes pass straight\n * through \u2014 so agent-turn output (spinner, renderer) is untouched.\n */\nexport interface OutputLineGuard {\n  /** Clear the current input row right before an out-of-band write. */\n  suspend(): void;\n  /** Repaint the prompt + in-progress draft right after the write. */\n  resume(): void;\n}\n\nlet activeOutputGuard: OutputLineGuard | null = null;\n\n/**\n * Register (or clear, with `null`) the guard that brackets out-of-band\n * writes. Installed by {@link writeOut}/{@link writeErr} consumers \u2014 in\n * practice the CLI's readline input reader \u2014 only while a prompt is live.\n * Idempotent; the most recent caller wins.\n */\nexport function setOutputLineGuard(guard: OutputLineGuard | null): void {\n  activeOutputGuard = guard;\n}\n\n/**\n * Stream-agnostic write primitive. Returns `false` when the stream is\n * missing or doesn't expose `write` so callers can degrade silently under\n * hostile host environments (closed pipe, mock injects `null`, test\n * replaces the stream with a stub).\n *\n * When an {@link OutputLineGuard} is installed (a readline prompt is on\n * screen) the write is bracketed by `suspend()`/`resume()` so the user's\n * half-typed input survives the interruption instead of being stranded in\n * scrollback. The guard's own redraw uses raw stream writes \u2014 never\n * `writeOut`/`writeErr` \u2014 so there is no re-entrancy here.\n *\n * **Not exported in the public API.** Exposed only inside `term.ts` for\n * `writeOut` / `writeErr` to share a single implementation. If a caller\n * needs to write to an arbitrary stream, they should call `writeOut` (or\n * `writeErr`) with an explicit `stream` argument \u2014 the named functions\n * are the public surface so the \"this is the standard error stream\"\n * intent stays visible at every call site.\n */\nfunction writeTo(\n  s: string,\n  stream: NodeJS.WriteStream | undefined,\n): boolean {\n  if (!stream || typeof stream.write !== 'function') return false;\n  const guard = activeOutputGuard;\n  if (!guard) {\n    stream.write(s);\n    return true;\n  }\n  // A prompt is live \u2014 wipe the draft row, emit the message, repaint.\n  guard.suspend();\n  stream.write(s);\n  guard.resume();\n  return true;\n}\n\n/**\n * Write `s` to `stream` (defaults to `process.stdout`). Returns `false`\n * when the stream is missing or doesn't expose `write` so callers can\n * degrade silently under hostile host environments (closed pipe, mock\n * injects `null`, test replaces the stream with a stub).\n *\n * Why a helper:\n *   1. **Single seam for output capture in tests** \u2014 stub `writeOut` once\n *      and assert on what the rest of the codebase intended to print,\n *      without spying on `process.stdout.write` (which is brittle and\n *      leaks across parallel test files).\n *   2. **Stream swap without grep** \u2014 routing the CLI's output to a\n *      logger or `out.log` becomes a one-line change at process boot.\n *   3. **Defensive default** \u2014 closes the \"what if `process.stdout` is\n *      `null`\" gap that currently exists at ~50 call sites that just\n *      call `process.stdout.write(s)` and crash on certain Windows\n *      redirect invocations.\n *\n * Call-site migration is staged: this commit introduces the helper, a\n * follow-up commit replaces the 50+ `process.stdout.write(...)` sites\n * with `writeOut(...)`. Until that migration lands, both forms coexist\n * and `writeOut` is the preferred form for new code.\n */\nexport function writeOut(\n  s: string,\n  stream: NodeJS.WriteStream = process.stdout,\n): boolean {\n  return writeTo(s, stream);\n}\n\n/**\n * Symmetric partner of `writeOut` for the standard error stream. Same shape,\n * same defensive contract, same single-seam-for-tests story \u2014 just defaults to\n * `process.stderr` instead of `process.stdout`.\n *\n * Use this in code paths that emit error/diagnostic/warning text. Keeping\n * these two helpers split (rather than a single `writeTo(s, stream)`) means\n * the call site reads as a clear intent signal: \"I am writing an error\" vs.\n * \"I am writing a result\" \u2014 which matters for callers that decide between\n * stdout/stderr routing (e.g. `--quiet` flags, log-level filtering,\n * structured-log rewriters that fork on stream).\n *\n * Stderr writes from the core logger (see `infrastructure/logger.ts`) and from\n * the TUI guard (see `tui/run-tui.ts`) used to call `process.stderr.write`\n * directly. Routing them through this helper lets tests stub the stream at\n * one boundary and lets future logging middleware (e.g. a JSON-line rewriter)\n * swap the destination for the entire process in one place.\n */\nexport function writeErr(\n  s: string,\n  stream: NodeJS.WriteStream = process.stderr,\n): boolean {\n  return writeTo(s, stream);\n}\n\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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// TerminalCapability \u2014 startup capability profile\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 * Color depth the terminal can render.\n *\n *   0 = no color (dumb, redirected, `TERM=dumb`)\n *   1 = 16 colors  (basic ANSI)\n *   2 = 256 colors (ANSI 256 + bright variants)\n *   3 = 16.7M / 24-bit truecolor\n */\nexport type ColorDepth = 0 | 1 | 2 | 3;\n\n/**\n * Mouse tracking protocol the terminal speaks.\n *\n *   'none' \u2014 no mouse reporting\n *   'x10'  \u2014 basic button press/release, capped at 223 columns\n *   'urxvt'\u2014 URXVT extension, supports >223 cols\n *   'sgr'  \u2014 SGR extended mode, modern standard, no column cap\n */\nexport type MouseProtocol = 'none' | 'x10' | 'urxvt' | 'sgr';\n\n/**\n * A snapshot of the terminal's capabilities and identity, computed once at\n * startup. Call {@link detectTerminal} once and pass the result through your\n * app \u2014 never re-detect mid-session.\n *\n * Query once \u2192 adapt once. Re-querying on every render is wrong because\n * `$TERM` is static for the process lifetime and stdout.isTTY can only go\n * from true\u2192false (never the reverse), so a mid-session change means the\n * process was started in a terminal and then something went wrong.\n */\nexport interface TerminalCapability {\n  /** True when both stdin and stdout are attached to a terminal. */\n  isRealTTY: boolean;\n  /**\n   * Whether the terminal speaks color.\n   *\n   * Uses the industry-standard precedence:\n   *   `FORCE_COLOR=0`  \u2192 0 (disabled)\n   *   `FORCE_COLOR`    \u2192 3 (force truecolor)\n   *   `NO_COLOR=\u2026`     \u2192 0 (opted out)\n   *   `COLORTERM=truecolor|24bit` \u2192 3\n   *   `TERM=\u2026truecolor|24bit`    \u2192 3 (some emulators advertise it)\n   *   `TERM=\u2026256color`           \u2192 2\n   *   fallback                      \u2192 1\n   *\n   * Note: `TERM=dumb` always produces 0 even if `COLORTERM=truecolor` is set \u2014\n   * `dumb` terminals are non-interactive by definition.\n   */\n  colorDepth: ColorDepth;\n  /**\n   * Whether `stdout` can be written to. Determined once at startup from\n   * `stdout?.isTTY ?? false`. Even when `isRealTTY` is true, `stdout` may be\n   * writable=false (e.g. the terminal was closed mid-session).\n   */\n  stdoutWritable: boolean;\n  /**\n   * Best mouse protocol the terminal speaks. Progressive enhancement:\n   * attempt SGR first, fall back to URXVT, then X10, then 'none'.\n   *\n   * The caller (typically the App component) decides whether to enable\n   * tracking at all \u2014 this only reports what the terminal CAN understand.\n   */\n  mouseProtocol: MouseProtocol;\n  /**\n   * Whether the terminal title can be set via OSC 0 / OSC 2.\n   * True when stdout is a TTY and `$TERM` is not `dumb`.\n   */\n  canSetTitle: boolean;\n  /**\n   * Whether the terminal understands the tmux DCS passthrough prefix.\n   * Detected by seeing `$TERM=tmux*`. When true, escape sequences should be\n   * wrapped: `\\x1bPtmux;\\x1b${seq}\\x1b\\\\`.\n   */\n  isTmux: boolean;\n  /**\n   * Whether the terminal is on Windows using the legacy conhost backend\n   * (cmd.exe, PowerShell non-ConPTY) rather than ConPTY (Windows Terminal,\n   * VS Code Integrated Terminal). Used to apply Windows-specific raw-mode\n   * handoff logic.\n   *\n   * Detected by: platform === 'win32' AND `!process.stdout.getColorDepth?.()`\n   * (ConPTY exposes color depth; conhost does not). Also false on non-Windows.\n   */\n  isWindowsConhost: boolean;\n}\n\n/**\n * Parse `process.env.TERM` into a color-depth guess.\n *\n * We intentionally do NOT use the `supports-color` npm package here because\n * (a) it adds a dependency, (b) it resolves at module-import time, and (c) we\n * need to factor in `FORCE_COLOR` / `NO_COLOR` which may be set after import.\n * This pure function is trivial to test and predictable regardless of import\n * order.\n */\nfunction parseColorDepth(env: { FORCE_COLOR?: string; NO_COLOR?: string; COLORTERM?: string; TERM?: string; }): ColorDepth {\n  // `FORCE_COLOR=0` is an explicit opt-out, even when `COLORTERM=truecolor`.\n  if (env.FORCE_COLOR === '0') return 0;\n  // `FORCE_COLOR` with no value or any truthy value forces truecolor.\n  if (env.FORCE_COLOR !== undefined) return 3;\n  // Explicit user opt-out.\n  if (typeof env.NO_COLOR === 'string' && env.NO_COLOR !== '') return 0;\n  // Explicit terminal advertisement.\n  const colorterm = (env.COLORTERM ?? '').toLowerCase();\n  if (colorterm === 'truecolor' || colorterm === '24bit') return 3;\n  // TERM strings that advertise rich color.\n  const term = (env.TERM ?? '').toLowerCase();\n  if (term.includes('truecolor') || term.includes('24bit')) return 3;\n  if (term.includes('256color')) return 2;\n  // TERM=dumb = no interactive capability at all.\n  if (term === 'dumb') return 0;\n  // Default to 16-color \u2014 the safest floor. Modern terminals all override this.\n  return 1;\n}\n\n/**\n * Detect the best mouse protocol the terminal speaks.\n *\n * Uses the `$TERM` string as a proxy since Node.js has no runtime query for\n * mouse capability (DECSET 1000/1002/1003 responses are not standardized for\n * programmatic use). The approximation is:\n *   - `tmux` + `screen` = SGR (they proxy it)\n *   - `xterm*`, `rxvt*`, `konsole`, `gnome*` = SGR (post-2013)\n *   - `linux`, `vt100`, `dumb` = none\n *   - Everything else = URXVT / X10 (try SGR, fall back gracefully in mouse.ts)\n *\n * This is advisory only. The App component gates mouse tracking behind an\n * explicit user/setting opt-in; false positives just mean the tracking enable\n * sequence is ignored harmlessly.\n */\nfunction parseMouseProtocol(term: string): MouseProtocol {\n  const t = term.toLowerCase();\n  // Terminals that reliably support SGR (1006) mode.\n  if (\n    t.startsWith('xterm') ||\n    t.startsWith('tmux') ||\n    t.startsWith('screen') ||\n    t.includes('rxvt-unicode') ||\n    t.includes('urxvt') ||\n    t.includes('konsole') ||\n    t.includes('gnome') ||\n    t.includes('foot') ||\n    t.includes('alacritty') ||\n    t.includes('wezterm') ||\n    t.includes('kitty') ||\n    t.includes('vscode') ||\n    t.includes('Apple_Terminal')\n  ) {\n    return 'sgr';\n  }\n  // Known mouse-capable but older terminals.\n  if (t.startsWith('rxvt') || t.startsWith('linux') || t.includes('Eterm')) {\n    return 'urxvt';\n  }\n  // vt100 / dumb \u2014 no mouse.\n  if (t === 'vt100' || t === 'dumb') return 'none';\n  // Default: assume SGR is safe to try; mouse.ts falls back silently.\n  return 'sgr';\n}\n\n/**\n * Detect the terminal's capabilities and identity at startup.\n *\n * Call once, early in process boot, before any event-loop async has had a\n * chance to corrupt the read of `process.stdout.isTTY`. Store the result and\n * pass it through the app \u2014 do NOT call this on every render.\n *\n * All `env` lookups default gracefully to safe values when the env var is\n * absent or empty, so the return value is deterministic regardless of what\n * the host's environment looks like.\n */\nexport function detectTerminal(\n  opts: {\n    stdin?: NodeJS.ReadStream | null;\n    stdout?: NodeJS.WriteStream | null;\n    env?: typeof process.env;\n  } = {},\n): TerminalCapability {\n  const stdin  = opts.stdin  ?? process.stdin;\n  const stdout = opts.stdout ?? process.stdout;\n  const env    = opts.env    ?? process.env;\n\n  const isRealTTY        = (stdin?.isTTY ?? false) && (stdout?.isTTY ?? false);\n  const stdoutWritable   = isRealTTY && typeof stdout?.write === 'function';\n  const term             = env.TERM ?? '';\n  const isTmux          = term.toLowerCase().startsWith('tmux');\n  const isWindowsConhost = isRealTTY\n    && process.platform === 'win32'\n    && typeof (stdout as NodeJS.WriteStream & { getColorDepth?: unknown }).getColorDepth !== 'function';\n\n  return {\n    isRealTTY,\n    colorDepth:         isRealTTY ? parseColorDepth(env) : 0,\n    stdoutWritable,\n    mouseProtocol:      parseMouseProtocol(term),\n    canSetTitle:        isRealTTY && term !== 'dumb',\n    isTmux,\n    isWindowsConhost,\n  };\n}\n\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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// TerminalLifecycle \u2014 raw-mode lifecycle manager\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 * Lifecycle owner for the TTY stdin raw-mode state machine.\n *\n * Raw mode is the most dangerous primitive in TUI code. Getting it wrong leaves\n * the user's terminal in a broken state (line-buffered, no echo) that requires\n * closing and reopening the terminal to recover. This class enforces a strict\n * acquire \u2192 hold \u2192 release lifecycle:\n *\n *   - `acquire()` may be called only once (idempotent \u2014 subsequent calls no-op).\n *   - `release()` restores the previous mode exactly once.\n *   - `release()` is called automatically on process `exit` and `beforeExit`.\n *   - Any signal handler (SIGINT, SIGTERM, SIGHUP) that calls `release()` clears\n *     its own registration so double-signals don't double-restore.\n *\n * Use this instead of calling `setRawMode()` directly at every call site. The\n * single instance lives at module scope in `run-tui.ts`; components that need\n * to signal \"TUI is shutting down\" call `terminalLifecycle.requestExit()` rather\n * than calling `release()` directly.\n */\nexport class TerminalLifecycle {\n  private _active = false;\n\n  /**\n   * The stdin stream we took raw mode on. Set by `acquire()`; undefined before\n   * first call. Used by `release()` and by the ConPTY race-closer in\n   * `acquire()`.\n   */\n  private _stdin: NodeJS.ReadStream | undefined;\n\n  /**\n   * The `isRaw` snapshot captured before the first `acquire()` call, so\n   * `release()` restores to the pre-TUI state rather than blindly disabling\n   * raw mode. Null when `acquire()` has never been called.\n   */\n  private _wasRaw: boolean | null = null;\n\n  /**\n   * Whether stdin was paused before the TUI took ownership. Readline closes\n   * its interface by pausing the shared process stream, so raw mode alone is\n   * not enough to make Ink receive bytes during the boot-prompt -> TUI handoff.\n   */\n  private _wasPaused: boolean | null = null;\n\n  /**\n   * Request the process to exit. Set the flag, trigger any registered\n   * `onRequestExit` callback (typically Ink's `unmount()`), and arm a\n   * deadline timer.  When the timer fires the process is hard-exited.\n   *\n   * Safe to call multiple times: subsequent calls no-op after the first.\n   */\n  requestExit: (exitCode?: number) => void;\n\n  /**\n   * Callback invoked when `requestExit` is called. Registered by the Ink\n   * mount point so unmount() runs before the deadline timer fires.\n   */\n  onRequestExit: (() => void | Promise<void>) | null = null;\n\n  constructor() {\n    // Build the requestExit closure here so subclasses / tests can override\n    // `requestExit` before calling `acquire()`.\n    let exitCode = 0;\n    let requested = false;\n    this.requestExit = (code = 0) => {\n      exitCode = code;\n      if (requested) return;\n      requested = true;\n      // Let the Ink unmount handler run (if registered).\n      try {\n        this.onRequestExit?.();\n      } catch {\n        // unmount handler threw \u2014 proceed to hard exit.\n      }\n      // Hard-exit deadline. `unref()` so the timer doesn't keep the event\n      // loop alive if everything else has settled.\n      setTimeout(() => process.exit(exitCode), 5_000).unref();\n    };\n  }\n\n  /** True while raw mode is held. */\n  get active(): boolean {\n    return this._active;\n  }\n\n  /**\n   * Acquire raw mode on `stdin`. Idempotent \u2014 calling twice is safe; only the\n   * first call has any effect.\n   *\n   * On Windows ConPTY, calls `setRawMode` twice: once immediately, then again\n   * after the next event-loop tick. This closes the ConPTY race where\n   * `readline`'s cleanup (registered before this class is constructed) can\n   * restore the original cooked mode after we set raw mode but before Ink's\n   * render loop takes over the stdin fd. The double-call ensures the last\n   * writer wins.\n   *\n   * @param stdin - The stdin stream (defaults to `process.stdin`).\n   * @returns `true` if raw mode was acquired; `false` if stdin is not a TTY\n   *          or already shut down.\n   */\n  acquire(stdin: NodeJS.ReadStream = process.stdin): boolean {\n    if (this._active) return false;\n\n    // Guard: must be a real TTY, must have setRawMode.\n    if (stdin?.isTTY !== true) return false;\n    if (typeof stdin.setRawMode !== 'function') return false;\n\n    // Snapshot the pre-TUI raw state so release() restores correctly.\n    this._wasRaw = stdin.isRaw ?? false;\n    this._wasPaused = stdin.isPaused();\n    this._stdin  = stdin;\n\n    stdin.setRawMode(true);\n    // A preceding readline prompt normally leaves process.stdin paused.\n    // Explicitly start the stream before Ink installs its input listener;\n    // otherwise the UI can render perfectly while every key appears dead.\n    stdin.resume();\n    this._active = true;\n\n    // Windows ConPTY double-acquire: schedule a second setRawMode on the next\n    // tick so we win the race against readline's \"restore original mode\".\n    // Safe on non-Windows (no-op: process.platform !== 'win32').\n    if (process.platform === 'win32') {\n      setImmediate(() => {\n        if (this._active && this._stdin?.isTTY) {\n          this._stdin.setRawMode?.(true);\n        }\n      });\n    }\n\n    return true;\n  }\n\n  /**\n   * Release raw mode and restore the terminal to the state it was in before\n   * `acquire()` was called. Idempotent \u2014 subsequent calls are no-ops.\n   *\n   * Call this on: SIGINT, SIGTERM, SIGHUP, SIGBREAK, and `process.exit`.\n   *\n   * \u26A0 **Windows caveat**: `setRawMode(false)` on ConPTY restores the original\n   * console mode captured when the process started \u2014 not the mode captured by\n   * `acquire()`. On ConPTY, the original mode was already raw (ConPTY starts\n   * raw), so this call is typically a no-op on Windows Terminal. On conhost.exe\n   * it may restore cooked mode, which is correct for that backend.\n   */\n  release(): void {\n    if (!this._active) return;\n    this._active = false;\n\n    const stdin = this._stdin;\n    if (stdin?.isTTY === true) {\n      // Restore to pre-TUI state rather than blindly disabling raw mode.\n      stdin.setRawMode?.(this._wasRaw ?? false);\n      if (this._wasPaused) stdin.pause();\n    }\n    this._stdin  = undefined;\n    this._wasRaw = null;\n    this._wasPaused = null;\n  }\n\n  /**\n   * Synchronously reset all terminal state written by the TUI layer:\n   * raw mode, SGR attributes, cursor visibility, and mouse tracking.\n   *\n   * Intended for the final `process.on('exit')` handler where async is\n   * impossible. Uses `\\x1b[0m` (SGR reset), `\\x1b[?25h` (cursor show),\n   * and `\\x1b[?9l` (mouse off) \u2014 all safe to emit even if the terminal does\n   * not understand them (unknown CSI sequences are silently ignored).\n   *\n   * Safe to call multiple times from multiple exit paths because each write\n   * is a constant-time synchronous stream write.\n   *\n   * @param stdout - Stream to reset (defaults to `process.stdout`).\n   */\n  reset(stdout: NodeJS.WriteStream = process.stdout): void {\n    if (typeof stdout?.write !== 'function') return;\n    // SGR reset \u2014 clears bold, color, underline, etc.\n    stdout.write('\\x1b[0m');\n    // Cursor show (in case Ink's unmount left it hidden).\n    stdout.write('\\x1b[?25h');\n    // Mouse tracking off (all three DECRST sequences \u2014 safe no-ops if never set).\n    stdout.write('\\x1b[?1003l\\x1b[?1002l\\x1b[?1000l');\n  }\n}\n\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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// safeEscape \u2014 guarded escape-sequence emitter\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 * Result of emitting an escape sequence. Distinguishes the three distinct\n * failure modes so callers can degrade gracefully.\n */\nexport interface EscapeEmitResult {\n  /** `true` when the sequence was written to the stream. */\n  ok: boolean;\n  /**\n   * Human-readable reason when `ok` is `false`. One of:\n   *   `'not_a_tty'`   \u2014 stdout is not a terminal (pipe / redirect / CI)\n   *   `'unwritable'`  \u2014 stdout.write is missing or threw\n   *   `'empty'`       \u2014 `sequence` was the empty string\n   */\n  reason: 'not_a_tty' | 'unwritable' | 'empty';\n}\n\n/**\n * A terminal escape sequence with its optional string terminator.\n *\n * OSC (title, color palette) sequences MUST be terminated with `BEL (\\x07)`\n * or `ST (\\x1b\\\\)` or the terminal stays in command mode and corrupts\n * subsequent output. CSI sequences (colors, cursor movement) are\n * self-terminating and do not need a terminator byte.\n */\nexport interface EscapeSequence {\n  /** The raw sequence, e.g. `\\x1b[38;2;255;0;0m`. */\n  raw: string;\n  /**\n   * Optional terminator byte required by OSC/DCS families.\n   * `undefined` for CSI sequences; `\\x07` (BEL) for OSC; `\\x1b\\\\` (ST) for DCS.\n   */\n  terminator?: string;\n}\n\n/**\n * Shared OSC/DCS terminator bytes.\n *\n * BEL (`\\x07`) is understood by iTerm2, Konsole, mintty, foot, and\n * Windows Terminal. ST (`\\x1b\\\\`) is the strict DEC standard equivalent.\n * Prefer BEL for compatibility; fall back to ST if the terminal's response\n * to BEL is observed to be garbled.\n */\nexport const ESCAPE_TERMINATOR = Object.freeze({\n  BEL: '\\x07',   // OSC 0 / OSC 2 (title)\n  ST:  '\\x1b\\\\', // DCS / strict OSC\n});\n\n/**\n * Emit a terminal escape sequence safely.\n *\n * Rules enforced:\n *   1. Empty string \u2192 returns `ok: false, reason: 'empty'`, no write.\n *   2. Not a TTY    \u2192 returns `ok: false, reason: 'not_a_tty'`, no write.\n *   3. Stream write throws \u2192 returns `ok: false, reason: 'unwritable'`.\n *   4. OSC/DCS sequences MUST have a terminator byte (guarded assertion).\n *      A missing terminator on an OSC sequence corrupts output on terminals\n *      that don't understand the sequence \u2014 this function refuses to emit it.\n *\n * @param sequence - The sequence to emit. CSI sequences need no terminator.\n *                   OSC/DCS sequences must carry `terminator: '\\x07'` or `'\\x1b\\\\'`.\n * @param stdout   - Stream to write to (defaults to `process.stdout`).\n * @returns Result indicating success or the specific failure mode.\n */\nexport function safeEmit(\n  sequence: EscapeSequence | string,\n  stdout: NodeJS.WriteStream = process.stdout,\n): EscapeEmitResult {\n  const raw = typeof sequence === 'string' ? sequence : sequence.raw;\n  const term = typeof sequence === 'string' ? undefined : sequence.terminator;\n\n  if (!raw) {\n    return { ok: false, reason: 'empty' };\n  }\n  if (stdout?.isTTY !== true) {\n    return { ok: false, reason: 'not_a_tty' };\n  }\n\n  // For OSC/DCS sequences (which include `[` or `]` in the body), verify a\n  // terminator is present.  CSI sequences start with `\\x1b[` and are\n  // self-terminating; we treat any sequence that is not a known OSC/DCS\n  // as CSI and allow through.  OSC starts with `\\x1b]`; DCS with `\\x1bP`.\n  if (raw.startsWith('\\x1b]') || raw.startsWith('\\x1bP')) {\n    // Assertion: terminator must be provided. Belt-and-suspenders against\n    // callers that forget to append `\\x07` \u2014 this prevents corrupted output.\n    if (!term) {\n      // Defensive: append BEL rather than crashing.  This is the only case\n      // where we mutate the sequence.  The assert-then-fallback pattern is\n      // intentional: we catch programmer error in development but degrade\n      // safely in production rather than throwing.\n      void term; // suppress unused-variable warning\n      const safe = `${raw}\\x07`;\n      try {\n        stdout.write(safe);\n      } catch {\n        return { ok: false, reason: 'unwritable' };\n      }\n      return { ok: true, reason: 'empty' }; // reason field is ignored when ok=true\n    }\n    try {\n      stdout.write(`${raw}${term}`);\n    } catch {\n      return { ok: false, reason: 'unwritable' };\n    }\n    return { ok: true, reason: 'empty' };\n  }\n\n  // CSI sequence \u2014 self-terminating.\n  try {\n    stdout.write(raw);\n  } catch {\n    return { ok: false, reason: 'unwritable' };\n  }\n  return { ok: true, reason: 'empty' };\n}\n\n/**\n * Build an OSC 0 / OSC 2 (window/tab title) sequence with a safe terminator.\n *\n * The terminator defaults to `BEL (\\x07)` for broad terminal compatibility.\n * Use `terminator: ESCAPE_TERMINATOR.ST` for stricter terminals that interpret\n * BEL as a beep.\n *\n * @param title   - The title string. Embedded BEL bytes are stripped.\n * @param terminator - Defaults to `ESCAPE_TERMINATOR.BEL`.\n */\nexport function buildTitleSequence(\n  title: string,\n  terminator: string = ESCAPE_TERMINATOR.BEL,\n): EscapeSequence {\n  return {\n    raw: `\\x1b]0;${title.replace(/\\x07/g, '')}`,\n    terminator,\n  };\n}\n\n/**\n * Build an SGR (Select Graphic Rendition) color/style sequence.\n *\n * @param codes - SGR parameter list, e.g. `[31]` (red foreground),\n *                `[1;32]` (bold green), `[38;2;255;128;0]` (truecolor orange).\n */\nexport function buildSgrSequence(...codes: number[]): EscapeSequence {\n  return { raw: `\\x1b[${codes.join(';')}m` };\n}\n\n/**\n * Emit a title sequence.  Convenience wrapper around `safeEmit` + `buildTitleSequence`.\n *\n * @param title - The title string.\n * @param stdout - Target stream.\n */\nexport function setTitle(\n  title: string,\n  stdout: NodeJS.WriteStream = process.stdout,\n): boolean {\n  return safeEmit(buildTitleSequence(title), stdout).ok;\n}\n", "import { isStdoutTTY } from './term.js';\n\nconst isColorTty = (): boolean => {\n  if (envFlag(process.env.NO_COLOR)) return false;\n  if (envFlag(process.env.FORCE_COLOR)) return true;\n  return isStdoutTTY();\n};\n\nfunction envFlag(value: string | undefined): boolean {\n  if (value === undefined) return false;\n  if (value.trim() === '') return false;\n  return !/^(0|false|no|off)$/i.test(value.trim());\n}\n\nconst COLOR = isColorTty();\n\nconst wrap =\n  (open: string, close: string) =>\n  (s: string): string =>\n    COLOR ? `\\x1b[${open}m${s}\\x1b[${close}m` : s;\n\nexport const color = {\n  reset: wrap('0', '0'),\n  bold: wrap('1', '22'),\n  dim: wrap('2', '22'),\n  italic: wrap('3', '23'),\n  underline: wrap('4', '24'),\n  red: wrap('31', '39'),\n  green: wrap('32', '39'),\n  yellow: wrap('33', '39'),\n  blue: wrap('34', '39'),\n  magenta: wrap('35', '39'),\n  cyan: wrap('36', '39'),\n  gray: wrap('90', '39'),\n  amber: wrap('38;5;214', '39'),\n  pink: wrap('38;5;205', '39'),\n  bgRed: wrap('41', '49'),\n  bgGreen: wrap('42', '49'),\n};\n\nexport function stripAnsi(s: string): string {\n  return s.replace(/\\x1b\\[[0-9;]*[A-Za-z]/g, '');\n}\n", "import type { TaskTracker } from '../tasking/index.js';\nimport type { TaskNode } from '../types/task-graph.js';\nimport type { PhaseGraph, PhaseNode, PhaseStatus } from './types.js';\n\ntype PhaseBoardEmit =\n  | {\n      event: 'phase.taskMoved';\n      payload: { taskId: string; fromPhaseId: string; toPhaseId: string };\n    }\n  | {\n      event: 'phase.taskAssigned';\n      payload: { phaseId: string; taskId: string; agentId?: string; agentName?: string };\n    }\n  | {\n      event: 'phase.taskAdded';\n      payload: { phaseId: string; taskId: string; taskTitle: string };\n    };\n\nexport interface PhaseBoardMutationContext {\n  graph: PhaseGraph;\n  trackerCache: Map<string, TaskTracker>;\n  taskRetryCounts: Map<string, number>;\n  phaseWorktrees: Map<string, unknown>;\n  getTrackerForPhase: (phase: PhaseNode) => TaskTracker;\n  updatePhaseStatus: (phase: PhaseNode, status: PhaseStatus) => void;\n  emit: (event: PhaseBoardEmit['event'], payload: PhaseBoardEmit['payload']) => void;\n}\n\nexport function findPhaseOfTaskInGraph(\n  graph: PhaseGraph,\n  taskId: string,\n): PhaseNode | undefined {\n  for (const phase of graph.phases.values()) {\n    if (phase.taskGraph.nodes.has(taskId)) return phase;\n  }\n  return undefined;\n}\n\nexport function movePhaseTask(\n  ctx: PhaseBoardMutationContext,\n  taskId: string,\n  toPhaseId: string,\n): boolean {\n  const from = findPhaseOfTaskInGraph(ctx.graph, taskId);\n  const to = ctx.graph.phases.get(toPhaseId);\n  if (!from || !to || from.id === toPhaseId) return false;\n\n  const node = from.taskGraph.nodes.get(taskId);\n  if (!node) return false;\n\n  const dependents = from.taskGraph.edges.filter((e) => e.from === taskId).map((e) => e.to);\n  for (const depId of dependents) {\n    const depNode = from.taskGraph.nodes.get(depId);\n    if (depNode) {\n      depNode.parentId = undefined;\n      depNode.children = undefined;\n    }\n    from.taskGraph.edges = from.taskGraph.edges.filter(\n      (e) => !(e.from === taskId && e.to === depId),\n    );\n    if (!from.taskGraph.rootNodes.includes(depId)) {\n      from.taskGraph.rootNodes.push(depId);\n    }\n  }\n\n  from.taskGraph.nodes.delete(taskId);\n  from.taskGraph.rootNodes = from.taskGraph.rootNodes.filter((id) => id !== taskId);\n  from.taskGraph.edges = from.taskGraph.edges.filter((e) => e.from !== taskId && e.to !== taskId);\n  from.taskGraph.updatedAt = Date.now();\n\n  node.parentId = undefined;\n  node.children = undefined;\n  node.updatedAt = Date.now();\n  to.taskGraph.nodes.set(taskId, node);\n  to.taskGraph.rootNodes.push(taskId);\n  to.taskGraph.updatedAt = Date.now();\n\n  ctx.trackerCache.delete(from.id);\n  ctx.trackerCache.delete(to.id);\n  ctx.graph.updatedAt = Date.now();\n  ctx.emit('phase.taskMoved', { taskId, fromPhaseId: from.id, toPhaseId });\n  return true;\n}\n\nexport function setPhaseTaskAssignee(\n  ctx: PhaseBoardMutationContext,\n  taskId: string,\n  agentId?: string,\n  agentName?: string,\n): boolean {\n  const phase = findPhaseOfTaskInGraph(ctx.graph, taskId);\n  if (!phase) return false;\n  const tracker = ctx.getTrackerForPhase(phase);\n  tracker.updateNode(taskId, { assignee: agentName ?? agentId ?? '' });\n  ctx.graph.updatedAt = Date.now();\n  ctx.emit('phase.taskAssigned', {\n    phaseId: phase.id,\n    taskId,\n    ...(agentId !== undefined ? { agentId } : {}),\n    ...(agentName !== undefined ? { agentName } : {}),\n  });\n  return true;\n}\n\nexport function addPhaseTask(\n  ctx: PhaseBoardMutationContext,\n  phaseId: string,\n  spec: {\n    title: string;\n    description?: string | undefined;\n    type?: TaskNode['type'] | undefined;\n    priority?: TaskNode['priority'] | undefined;\n  },\n): string | null {\n  const phase = ctx.graph.phases.get(phaseId);\n  if (!phase) return null;\n  const tracker = ctx.getTrackerForPhase(phase);\n  const node = tracker.addNode({\n    title: spec.title,\n    description: spec.description ?? '',\n    type: spec.type ?? 'feature',\n    priority: spec.priority ?? 'medium',\n    status: 'pending',\n  });\n  ctx.graph.updatedAt = Date.now();\n  ctx.emit('phase.taskAdded', { phaseId, taskId: node.id, taskTitle: node.title });\n  return node.id;\n}\n\nexport function requeuePhaseTask(ctx: PhaseBoardMutationContext, taskId: string): boolean {\n  const phase = findPhaseOfTaskInGraph(ctx.graph, taskId);\n  if (!phase) return false;\n  const tracker = ctx.getTrackerForPhase(phase);\n  tracker.updateNodeStatus(taskId, 'pending');\n  ctx.taskRetryCounts.delete(`${phase.id}:${taskId}`);\n  if (phase.status === 'completed' || phase.status === 'failed' || phase.status === 'paused') {\n    ctx.graph.failedPhaseIds = ctx.graph.failedPhaseIds.filter((id) => id !== phase.id);\n    ctx.graph.completedPhaseIds = ctx.graph.completedPhaseIds.filter((id) => id !== phase.id);\n    ctx.graph.activePhaseIds = ctx.graph.activePhaseIds.filter((id) => id !== phase.id);\n    ctx.phaseWorktrees.delete(phase.id);\n    ctx.updatePhaseStatus(phase, 'pending');\n  }\n  ctx.graph.updatedAt = Date.now();\n  return true;\n}\n", "/**\n * Read-only queries over a phase graph, plus the two leaf helpers that only\n * touch a phase's own record.\n *\n * Split out of `phase-orchestrator.ts`. Nothing here schedules, emits, or\n * mutates orchestrator state \u2014 each function derives its answer from the graph\n * (and, where task counts are involved, the orchestrator's tracker lookup).\n *\n * @module goal/phase-orchestrator-queries\n */\nimport type { TaskTracker } from '../tasking/index.js';\nimport type { TaskNode } from '../types/task-graph.js';\nimport type { PhaseGraph, PhaseNode, PhaseProgress } from './types.js';\n\n/** Resolves (and memoizes) the TaskTracker backing a phase's task graph. */\nexport type TrackerLookup = (phase: PhaseNode) => TaskTracker;\n\nexport function getReadyPhases(graph: PhaseGraph): PhaseNode[] {\n  const ready: PhaseNode[] = [];\n\n  for (const phase of graph.phases.values()) {\n    if (phase.status !== 'pending') continue;\n\n    const depsDone = phase.dependsOn.every((depId) => {\n      const dep = graph.phases.get(depId);\n      return dep?.status === 'completed' || dep?.status === 'skipped' || dep?.status === 'failed';\n    });\n\n    // A phase is ready ONLY when its dependencies are resolved. `parallelizable`\n    // governs whether ready phases may run CONCURRENTLY (the `maxConcurrentPhases`\n    // batch in start()/tick() already enforces that) \u2014 it must NOT let a phase\n    // start before its dependencies finish. (Previously this read\n    // `depsDone || phase.parallelizable`, which let a dependent-but-parallelizable\n    // phase, e.g. a Testing phase depending on Implementation, jump the gun.)\n    if (depsDone) {\n      ready.push(phase);\n    }\n  }\n\n  const prioOrder = { critical: 0, high: 1, medium: 2, low: 3 };\n  ready.sort((a, b) => (prioOrder[a.priority] ?? 4) - (prioOrder[b.priority] ?? 4));\n\n  return ready;\n}\n\nexport function getActivePhases(graph: PhaseGraph): PhaseNode[] {\n  return Array.from(graph.phases.values()).filter((p) => p.status === 'running');\n}\n\nexport function getExecutableTasks(trackerFor: TrackerLookup, phase: PhaseNode): TaskNode[] {\n  const tracker = trackerFor(phase);\n  return tracker\n    .getAllNodes({ status: ['pending', 'blocked'] })\n    .filter(\n      (n: { id: string; status: string; priority: string }) =>\n        n.status === 'pending' && tracker.canStart(n.id),\n    )\n    .sort((a: { priority: TaskNode['priority'] }, b: { priority: TaskNode['priority'] }) => {\n      const priorityOrder = { critical: 0, high: 1, medium: 2, low: 3 };\n      return (priorityOrder[a.priority] ?? 4) - (priorityOrder[b.priority] ?? 4);\n    });\n}\n\nexport function getFailedTaskCount(trackerFor: TrackerLookup, phase: PhaseNode): number {\n  return trackerFor(phase).getAllNodes({ status: ['failed'] }).length;\n}\n\nexport function getCompletedTaskCount(trackerFor: TrackerLookup, phase: PhaseNode): number {\n  return trackerFor(phase).getAllNodes({ status: ['completed'] }).length;\n}\n\nexport function isGraphComplete(graph: PhaseGraph): boolean {\n  const allPhases = Array.from(graph.phases.values());\n  return allPhases.every(\n    (p) => p.status === 'completed' || p.status === 'skipped' || p.status === 'failed',\n  );\n}\n\nexport function getProgress(graph: PhaseGraph, trackerFor: TrackerLookup): PhaseProgress {\n  const phases = Array.from(graph.phases.values());\n  let pending = 0;\n  let ready = 0;\n  let running = 0;\n  let paused = 0;\n  let completed = 0;\n  let failed = 0;\n  let skipped = 0;\n  let totalTasks = 0;\n  let completedTasks = 0;\n  let failedTasks = 0;\n  let estimatedHours = 0;\n  let actualHours = 0;\n\n  for (const p of phases) {\n    switch (p.status) {\n      case 'pending':\n        pending++;\n        break;\n      case 'ready':\n        ready++;\n        break;\n      case 'running':\n        running++;\n        break;\n      case 'paused':\n        paused++;\n        break;\n      case 'completed':\n        completed++;\n        break;\n      case 'failed':\n        failed++;\n        break;\n      case 'skipped':\n        skipped++;\n        break;\n      default:\n        // Unknown phase status \u2014 log and skip in counter\n        break;\n    }\n    estimatedHours += p.estimateHours;\n    if (p.actualDurationMs) actualHours += p.actualDurationMs / 3600000;\n\n    const tracker = trackerFor(p);\n    const progress = tracker.getProgress();\n    totalTasks += progress.total;\n    completedTasks += progress.completed;\n    failedTasks += progress.failed;\n  }\n\n  const totalPhases = phases.length;\n  const done = completed + skipped;\n\n  return {\n    totalPhases,\n    pending,\n    ready,\n    running,\n    paused,\n    completed,\n    failed,\n    skipped,\n    percentComplete: totalPhases > 0 ? Math.min(100, Math.round((done / totalPhases) * 100)) : 0,\n    totalTasks,\n    completedTasks,\n    failedTasks,\n    estimatedHours,\n    actualHours,\n  };\n}\n\nexport function setIntegrationMetadata(\n  graph: PhaseGraph,\n  phase: PhaseNode,\n  status: 'merged' | 'needs_review' | 'merge_failed' | 'not_merged_failed_phase',\n  details: {\n    branch?: string | undefined;\n    worktreeDir?: string | undefined;\n    conflictFiles?: string[] | undefined;\n    error?: string | undefined;\n  } = {},\n): void {\n  phase.metadata = {\n    ...phase.metadata,\n    integrationStatus: status,\n    integrationBranch: details.branch,\n    integrationWorktreeDir: details.worktreeDir,\n    integrationConflictFiles: details.conflictFiles,\n    integrationError: details.error,\n    integrationUpdatedAt: Date.now(),\n  };\n  phase.updatedAt = Date.now();\n  graph.updatedAt = Date.now();\n}\n\nexport function truncate(text: string, max = 500): string {\n  const t = text.trim();\n  return t.length <= max ? t : `${t.slice(0, max)}\u2026 (+${t.length - max} chars)`;\n}\n", "/**\n * Worktree integration for phases: commit, dependency-ordered squash-merge back\n * into the base branch, conflict arbitration, and the failure bookkeeping that\n * keeps the graph honest when a merge does not land.\n *\n * Split out of `phase-orchestrator.ts`. The orchestrator passes an\n * {@link IntegrationContext} holding the state these steps read and mutate \u2014\n * the same fields the private methods reached through `this`.\n *\n * @module goal/phase-orchestrator-integration\n */\nimport type { Logger } from '../types/logger.js';\nimport { toErrorMessage } from '../utils/error.js';\nimport type { WorktreeHandle, WorktreeManager } from '../worktree/worktree-manager.js';\nimport { setIntegrationMetadata } from './phase-orchestrator-queries.js';\nimport type { PhaseEventMap, PhaseEventName, PhaseExecutionContext, PhaseGraph, PhaseNode, PhaseStatus } from './types.js';\n\n/** Orchestrator state the integration steps operate on. */\nexport interface IntegrationContext {\n  graph: PhaseGraph;\n  ctx: PhaseExecutionContext;\n  logger: Logger;\n  worktrees: WorktreeManager | undefined;\n  /** phaseId \u2192 allocated worktree handle. */\n  phaseWorktrees: Map<string, WorktreeHandle>;\n  /** phaseId \u2192 promise settling when that phase's merge finished. */\n  phaseMergePromise: Map<string, Promise<void>>;\n  runningPhases: Set<string>;\n  /** Global serialization chain \u2014 read and replaced by `commitAndEnqueueMerge`. */\n  getMergeQueue: () => Promise<void>;\n  setMergeQueue: (queue: Promise<void>) => void;\n  emit: <E extends PhaseEventName>(event: E, payload: PhaseEventMap[E]) => void;\n  updatePhaseStatus: (phase: PhaseNode, status: PhaseStatus) => void;\n}\n\nexport function worktreeEnv(\n  int: IntegrationContext,\n  phase: PhaseNode,\n): { cwd?: string | undefined; branch?: string | undefined } | undefined {\n  const handle = int.phaseWorktrees.get(phase.id);\n  return handle ? { cwd: handle.dir, branch: handle.branch } : undefined;\n}\n\n/** Shared failure bookkeeping for a phase whose tasks ran but the phase failed. */\nexport async function failPhaseAfterTasks(\n  int: IntegrationContext,\n  phase: PhaseNode,\n  error: string,\n): Promise<void> {\n  int.updatePhaseStatus(phase, 'failed');\n  phase.completedAt = Date.now();\n  phase.actualDurationMs = Date.now() - (phase.startedAt ?? Date.now());\n  int.runningPhases.delete(phase.id);\n  int.graph.activePhaseIds = int.graph.activePhaseIds.filter((id) => id !== phase.id);\n  int.emit('phase.failed', { phaseId: phase.id, name: phase.name, error });\n  int.ctx.onPhaseFail?.(phase, new Error(error));\n  await keepWorktreeForReview(int, phase);\n}\n\n/**\n * A phase whose tasks all succeeded was marked `completed` and queued for\n * merge, but the merge back into the base branch failed. Its work is NOT\n * integrated, so correct the graph: move the phase out of `completedPhaseIds`\n * into `failedPhaseIds` and flip its status to `failed`. Without this the\n * persisted graph (and the board) would claim the phase succeeded while a\n * `phase.failed` event fired \u2014 an inconsistency that hides un-merged work.\n * Idempotent: safe to call more than once for the same phase.\n */\nexport function markPhaseMergeFailed(\n  int: IntegrationContext,\n  phase: PhaseNode,\n  error: string,\n): void {\n  if (phase.status !== 'failed') {\n    int.graph.completedPhaseIds = int.graph.completedPhaseIds.filter((id) => id !== phase.id);\n    int.updatePhaseStatus(phase, 'failed');\n  }\n  if (!int.graph.failedPhaseIds.includes(phase.id)) int.graph.failedPhaseIds.push(phase.id);\n  int.emit('phase.failed', { phaseId: phase.id, name: phase.name, error });\n  int.ctx.onPhaseFail?.(phase, new Error(error));\n}\n\n/**\n * Commit the phase's worktree changes, then enqueue the merge back into the\n * base branch. Merges run dependency-ordered (a phase merges only after its\n * `dependsOn` phases) and globally serialized (one at a time) to avoid\n * concurrent writes to the base tree.\n */\nexport async function commitAndEnqueueMerge(\n  int: IntegrationContext,\n  phase: PhaseNode,\n): Promise<void> {\n  const handle = int.phaseWorktrees.get(phase.id);\n  if (!int.worktrees || !handle) return;\n\n  try {\n    await int.worktrees.commitAll(handle, `goal(${phase.name}): ${phase.id}`);\n  } catch {\n    // commit failure is non-fatal; the merge step will report a clean tree.\n  }\n\n  const depPromises = phase.dependsOn\n    .map((d) => int.phaseMergePromise.get(d))\n    .filter((p): p is Promise<void> => Boolean(p));\n\n  const merged = (async () => {\n    await Promise.allSettled(depPromises); // dependency-ordered\n    // Chain onto the global queue so only one merge touches base at a time.\n    int.setMergeQueue(\n      int\n        .getMergeQueue()\n        .then(() => mergeOne(int, phase, handle))\n        .catch((err) => {\n          // Defensive backstop: mergeOne handles its own errors, so this only\n          // fires if it throws unexpectedly. Keep the queue alive (a failed\n          // merge must not poison the chain) and correct the graph state.\n          const msg = toErrorMessage(err);\n          int.logger.error(msg, { event: 'orchestrator.merge_failed', phaseId: phase.id });\n          markPhaseMergeFailed(int, phase, msg);\n        }),\n    );\n    await int.getMergeQueue();\n  })();\n  int.phaseMergePromise.set(phase.id, merged);\n}\n\n/**\n * Squash-merge one phase. When a `resolveConflict` callback is wired, a merge\n * conflict is handed to it (a resolver subagent) before giving up; only if\n * that fails does the worktree fall to needs-review and the run continues.\n */\nasync function mergeOne(\n  int: IntegrationContext,\n  phase: PhaseNode,\n  handle: WorktreeHandle,\n): Promise<void> {\n  if (!int.worktrees) return;\n  try {\n    const resolve = int.ctx.resolveConflict\n      ? async (info: { conflictFiles: string[]; cwd: string }) => {\n          const shouldResolve = await shouldAttemptConflictResolution(int, phase, info);\n          if (!shouldResolve) return false;\n          int.emit('phase.conflictResolving', {\n            phaseId: phase.id,\n            name: phase.name,\n            files: info.conflictFiles,\n          });\n          const resolved = await int.ctx.resolveConflict?.(phase, info);\n          return resolved ?? false;\n        }\n      : undefined;\n    const mergeOpts: {\n      squash: true;\n      resolve?: (info: { conflictFiles: string[]; cwd: string }) => Promise<boolean>;\n    } = {\n      squash: true,\n    };\n    if (resolve !== undefined) mergeOpts.resolve = resolve;\n    const result = await int.worktrees.merge(handle, mergeOpts);\n    if (result.resolved) {\n      int.emit('phase.conflictResolved', { phaseId: phase.id, name: phase.name });\n    }\n    setIntegrationMetadata(int.graph, phase, result.ok ? 'merged' : 'needs_review', {\n      branch: handle.branch,\n      worktreeDir: handle.dir,\n      conflictFiles: result.conflictFiles,\n    });\n    // merge() already emitted worktree.merged / worktree.conflict and set status.\n    // Clean (or resolved) merge \u2192 remove the worktree; conflict \u2192 release(keep).\n    await int.worktrees.release(handle, { keep: !result.ok });\n  } catch (err) {\n    setIntegrationMetadata(int.graph, phase, 'merge_failed', {\n      branch: handle.branch,\n      worktreeDir: handle.dir,\n      error: toErrorMessage(err),\n    });\n    // The merge failed \u2192 the phase's work never reached base. Reflect that in\n    // the graph, not just in metadata + a stray event (see markPhaseMergeFailed).\n    markPhaseMergeFailed(int, phase, `worktree merge failed: ${toErrorMessage(err)}`);\n  }\n}\n\nasync function shouldAttemptConflictResolution(\n  int: IntegrationContext,\n  phase: PhaseNode,\n  info: { conflictFiles: string[]; cwd: string },\n): Promise<boolean> {\n  if (!int.ctx.brain) return true;\n\n  const decision = await int.ctx.brain.decide({\n    id: `goal-conflict-${phase.id}`,\n    source: 'goal',\n    question: `Should Goal try to resolve merge conflicts for phase \"${phase.name}\" automatically?`,\n    context: [\n      `Phase id: ${phase.id}`,\n      `Conflicted files: ${info.conflictFiles.join(', ') || '(unknown)'}`,\n      `Base working tree: ${info.cwd}`,\n    ].join('\\n'),\n    // 'critical', not 'high': choosing `resolve` lets a resolver agent EDIT\n    // FILES IN THE BASE WORKING TREE. That is the one Brain decision in the\n    // system whose wrong answer is not recoverable by simply continuing \u2014\n    // unlike a budget grant (bounded, capped) or a goal-done verdict (the\n    // run can be restarted).\n    //\n    // Consequences of the level, both intended:\n    //   - it is at or above the council floor, so a multi-LLM panel decides\n    //     it whenever one can convene;\n    //   - with no council (a single-model install resolves the autonomy\n    //     ceiling to 'high'), it exceeds the ceiling and never reaches an\n    //     unchecked single model. The policy tier's `ask_human` then routes\n    //     to the terminal policy, which refuses a recommended option at\n    //     critical risk and denies \u2014 i.e. the worktree is kept for human\n    //     review, which is exactly the safe outcome.\n    risk: 'critical',\n    fallback: 'ask_human',\n    options: [\n      {\n        id: 'resolve',\n        label: 'Try the configured conflict resolver',\n        consequence: 'A resolver agent may edit conflicted files in the base working tree.',\n        risk: 'critical',\n      },\n      {\n        id: 'review',\n        label: 'Keep the worktree for human review',\n        consequence: 'No automatic conflict resolution is attempted.',\n        risk: 'low',\n        recommended: true,\n      },\n    ],\n  });\n\n  phase.metadata = {\n    ...phase.metadata,\n    brainConflictDecision: decision.type,\n    brainConflictDecisionAt: Date.now(),\n  };\n\n  if (decision.type !== 'answer') return false;\n  // Control-plane check: automatic conflict resolution runs ONLY on the\n  // exact option id. Prose mentioning \"resolve\" is not authorization.\n  return decision.optionId === 'resolve';\n}\n\n/** A failed phase keeps its worktree on disk for inspection (no merge). */\nexport async function keepWorktreeForReview(\n  int: IntegrationContext,\n  phase: PhaseNode,\n): Promise<void> {\n  const handle = int.phaseWorktrees.get(phase.id);\n  if (!int.worktrees || !handle) return;\n  try {\n    await int.worktrees.commitAll(handle, `goal(${phase.name}) [failed]: ${phase.id}`);\n  } catch {\n    // best effort\n  }\n  setIntegrationMetadata(int.graph, phase, 'not_merged_failed_phase', {\n    branch: handle.branch,\n    worktreeDir: handle.dir,\n  });\n  await int.worktrees.release(handle, { keep: true }).catch(() => {});\n}\n", "import type { EventBus } from '../kernel/events.js';\nimport type { PhaseGraph } from './types.js';\n\nexport function normalizePhaseGraphForResume(graph: PhaseGraph): void {\n  graph.activePhaseIds = [];\n  for (const phase of graph.phases.values()) {\n    if (phase.status === 'running') {\n      phase.status = 'pending';\n      phase.updatedAt = Date.now();\n    }\n    if (phase.status === 'pending') {\n      for (const task of phase.taskGraph.nodes.values()) {\n        if (task.status === 'in_progress') task.status = 'pending';\n      }\n    }\n  }\n}\n\nexport function createNoopEventBus(): EventBus {\n  return {\n    emit: () => {},\n    on: () => () => {},\n    off: () => {},\n    once: () => () => {},\n    listeners: new Map(),\n    wildcards: [],\n    setLogger: () => {},\n    onAny: () => () => {},\n    offAny: () => {},\n    emitAsync: async () => [],\n    waitFor: async () => {},\n  } as never as EventBus;\n}\n", "import type { EventBus } from '../kernel/events.js';\nimport type { Logger } from '../types/logger.js';\nimport { noOpLogger } from '../infrastructure/logger.js';\nimport { DefaultTaskStore, TaskTracker } from '../tasking/index.js';\nimport type { TaskNode } from '../types/task-graph.js';\nimport { toErrorMessage } from '../utils/error.js';\nimport type { WorktreeHandle, WorktreeManager } from '../worktree/worktree-manager.js';\nimport {\n  addPhaseTask,\n  findPhaseOfTaskInGraph,\n  movePhaseTask,\n  requeuePhaseTask,\n  setPhaseTaskAssignee,\n} from './phase-board-mutations.js';\nimport {\n  commitAndEnqueueMerge,\n  failPhaseAfterTasks,\n  type IntegrationContext,\n  keepWorktreeForReview,\n  worktreeEnv,\n} from './phase-orchestrator-integration.js';\nimport {\n  getActivePhases,\n  getCompletedTaskCount,\n  getExecutableTasks,\n  getFailedTaskCount,\n  getProgress,\n  getReadyPhases,\n  isGraphComplete,\n  truncate,\n} from './phase-orchestrator-queries.js';\nimport { createNoopEventBus, normalizePhaseGraphForResume } from './phase-orchestrator-runtime.js';\nimport type {\n  NormalizedGoalOptions,\n  PhaseOrchestratorOptions,\n} from './phase-orchestrator-types.js';\nimport type {\n  PhaseEventMap,\n  PhaseEventName,\n  PhaseExecutionContext,\n  PhaseGraph,\n  PhaseNode,\n  PhaseProgress,\n  PhaseStatus,\n} from './types.js';\nexport type { PhaseOrchestratorOptions } from './phase-orchestrator-types.js';\n\n/**\n * PhaseOrchestrator - dependency-aware engine for running phases autonomously.\n *\n * Features:\n * - Automatically starts the next phase as each phase completes in autonomous mode\n * - Supports parallel phases with parallelizable=true\n * - Assigns and releases agents\n * - Integrates with the event bus\n * - Supports pause and resume\n */\nexport class PhaseOrchestrator {\n  private graph: PhaseGraph;\n  private ctx: PhaseExecutionContext;\n  private opts: NormalizedGoalOptions;\n  private events: EventBus;\n  private stopped = false;\n  private paused = false;\n  private runningPhases = new Set<string>();\n  private tickInterval: ReturnType<typeof setInterval> | null = null;\n  private trackerCache = new Map<string, TaskTracker>();\n  private taskRetryCounts = new Map<string, number>();\n\n  // \u2500\u2500 Git-worktree isolation (optional) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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  private readonly worktrees?: WorktreeManager | undefined;\n  private readonly logger: Logger;\n  /** Per-phase worktree handles, keyed by phase id. */\n  private readonly phaseWorktrees = new Map<string, WorktreeHandle>();\n  /** Serializes all merges back to the base branch (one at a time). */\n  private mergeQueue: Promise<void> = Promise.resolve();\n  /** Per-phase merge promise, so a phase merges only after its deps do. */\n  private readonly phaseMergePromise = new Map<string, Promise<void>>();\n\n  constructor(opts: PhaseOrchestratorOptions) {\n    this.graph = opts.graph;\n    this.ctx = opts.ctx;\n    this.events = opts.events ?? createNoopEventBus();\n    this.worktrees = opts.worktrees;\n    this.logger = opts.logger ?? noOpLogger;\n    this.opts = {\n      maxConcurrentPhases: opts.maxConcurrentPhases ?? 1,\n      maxConcurrentTasks: opts.maxConcurrentTasks ?? 2,\n      maxRetries: opts.maxRetries ?? 2,\n      maxVerifyAttempts: opts.maxVerifyAttempts ?? 2,\n      autonomous: opts.autonomous ?? true,\n      phaseDelayMs: opts.phaseDelayMs ?? 0,\n      stopOnFailure: opts.stopOnFailure ?? false,\n      taskTimeoutMs: opts.taskTimeoutMs ?? 600_000,\n      events: this.events,\n    };\n  }\n\n  // \u2500\u2500\u2500 Lifecycle \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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   * Start the full phase flow.\n   * In autonomous mode, starts root phases and automatically starts the next phase when they finish.\n   */\n  async start(): Promise<void> {\n    this.stopped = false;\n    this.paused = false;\n    this.normalizeForResume();\n    this.graph.startedAt = Date.now();\n    this.graph.updatedAt = Date.now();\n\n    // Run phases in order; later phases still start when autonomous=false.\n    let readyPhases = this.getReadyPhases();\n    while (readyPhases.length > 0 && !this.stopped) {\n      await this.waitWhilePaused();\n      if (this.stopped) break;\n\n      const batch = readyPhases.slice(0, this.opts.maxConcurrentPhases);\n      await Promise.all(batch.map((p) => this.startPhase(p)));\n\n      // Apply phase delay.\n      if (this.opts.phaseDelayMs > 0) {\n        await this.delay(this.opts.phaseDelayMs);\n      }\n\n      await this.waitWhilePaused();\n      if (this.stopped) break;\n\n      // Check for newly ready phases after a phase completes.\n      readyPhases = this.getReadyPhases().filter(\n        (p) => !this.runningPhases.has(p.id) && p.status !== 'completed' && p.status !== 'failed',\n      );\n    }\n\n    // Wait for all queued worktree merges to finish in the background so\n    // changes reach the base branch before the graph is declared completed.\n    await this.drainMerges();\n\n    // Autonomous tick loop for real-time monitoring.\n    if (this.opts.autonomous) {\n      this.tickInterval = setInterval(() => this.tick(), 1000);\n    }\n  }\n\n  /**\n   * Make a (possibly resumed) graph runnable. A graph loaded from disk after an\n   * interrupted run can carry transient state from the dead process: phases left\n   * `running` and tasks left `in_progress`. The scheduler only starts `pending`\n   * phases (getReadyPhases) and only runs `pending` tasks (getExecutableTasks),\n   * so without this a resumed phase/task would stall forever. Reset that\n   * transient state to `pending`; terminal phases (completed/failed/skipped) and\n   * already-completed tasks are untouched, so completed work is never re-run.\n   * For a freshly built graph this is a no-op.\n   */\n  private normalizeForResume(): void {\n    normalizePhaseGraphForResume(this.graph);\n  }\n\n  /** Wait for all pending phase merges, dependency-ordered and globally serialized. */\n  private async drainMerges(): Promise<void> {\n    await Promise.allSettled([...this.phaseMergePromise.values()]);\n    await this.mergeQueue.catch((err) => {\n      const msg = toErrorMessage(err);\n      this.logger.warn(msg, { event: 'orchestrator.merge_queue_failed' });\n    });\n  }\n\n  /** Pause: active phases continue, but no new phase starts. */\n  pause(): void {\n    this.paused = true;\n  }\n\n  /** Resume: new phases may start again. */\n  resume(): void {\n    this.paused = false;\n    this.tick().catch((err) => {\n      const msg = toErrorMessage(err);\n      this.logger.error(msg, { event: 'orchestrator.tick_failed' });\n    });\n  }\n\n  /** Stop completely, including active phases. */\n  stop(): void {\n    this.stopped = true;\n    if (this.tickInterval) {\n      clearInterval(this.tickInterval);\n      this.tickInterval = null;\n    }\n    for (const phaseId of this.runningPhases) {\n      const phase = this.graph.phases.get(phaseId);\n      if (phase) {\n        this.updatePhaseStatus(phase, 'paused');\n      }\n    }\n    // Preserve any live worktrees for inspection rather than discarding work.\n    if (this.worktrees) {\n      for (const handle of this.worktrees.list()) {\n        void this.worktrees.release(handle, { keep: true }).catch(() => {});\n      }\n    }\n  }\n\n  // \u2500\u2500\u2500 Tick Loop (Autonomous) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 async tick(): Promise<void> {\n    if (this.stopped || this.paused) return;\n\n    const active = this.getActivePhases();\n    const queued = this.getReadyPhases();\n\n    this.emit('autonomous.tick', {\n      activePhases: active.map((p) => p.id),\n      queuedPhases: queued.map((p) => p.id),\n    });\n\n    this.ctx.onTick?.({ activePhases: active, readyPhases: queued });\n\n    // Is there a slot to start a new phase?\n    const availableSlots = this.opts.maxConcurrentPhases - active.length;\n    if (availableSlots > 0 && queued.length > 0) {\n      for (const phase of queued.slice(0, availableSlots)) {\n        if (phase.status === 'pending') {\n          await this.startPhase(phase);\n        }\n      }\n    }\n\n    // Are all phases complete?\n    if (this.isComplete()) {\n      this.onGraphComplete();\n      return;\n    }\n\n    // Did a phase fail while stopOnFailure is enabled?\n    if (this.opts.stopOnFailure && this.graph.failedPhaseIds.length > 0) {\n      const failedPhase = this.graph.phases.get(this.graph.failedPhaseIds[0] ?? '');\n      if (failedPhase) {\n        this.onGraphFailed(failedPhase);\n      }\n      return;\n    }\n  }\n\n  // \u2500\u2500\u2500 Phase Execution \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 async startPhase(phase: PhaseNode): Promise<void> {\n    if (phase.status !== 'pending' && phase.status !== 'ready') return;\n\n    this.updatePhaseStatus(phase, 'running');\n    phase.startedAt = Date.now();\n    this.runningPhases.add(phase.id);\n    this.graph.activePhaseIds.push(phase.id);\n\n    // Allocate an isolated git worktree for this phase, if a manager is wired.\n    // Allocation failure degrades gracefully to the shared working tree.\n    if (this.worktrees && !this.phaseWorktrees.has(phase.id)) {\n      try {\n        const handle = await this.worktrees.allocate(phase.id, {\n          slugHint: phase.name,\n          ownerLabel: phase.name,\n        });\n        if (handle.status === 'active') this.phaseWorktrees.set(phase.id, handle);\n      } catch {\n        // Manager already emitted worktree.failed; run on the shared tree.\n      }\n    }\n\n    this.emit('phase.started', { phaseId: phase.id, name: phase.name });\n\n    try {\n      await this.executePhaseTasks(phase);\n\n      const failedTasks = this.getFailedTaskCount(phase);\n      const completedTasks = this.getCompletedTaskCount(phase);\n\n      this.emit('phase.allTasksDone', {\n        phaseId: phase.id,\n        completed: completedTasks,\n        failed: failedTasks,\n      });\n\n      if (failedTasks > 0 && this.opts.stopOnFailure) {\n        await this.failPhaseAfterTasks(phase, `${failedTasks} task(s) failed`);\n        return;\n      }\n\n      // Verification gate: all tasks succeeded, but the produced code must still\n      // pass (typecheck/test/\u2026) before we mark the phase done and merge it back.\n      // Skipped entirely when no verifyPhase callback is wired (back-compat).\n      const verdict = await this.runVerifyGate(phase);\n      if (!verdict.ok) {\n        await this.failPhaseAfterTasks(\n          phase,\n          `verification failed${verdict.output ? `: ${this.truncate(verdict.output)}` : ''}`,\n        );\n        return;\n      }\n\n      this.updatePhaseStatus(phase, 'completed');\n      phase.completedAt = Date.now();\n      phase.actualDurationMs = Date.now() - (phase.startedAt ?? Date.now());\n      this.runningPhases.delete(phase.id);\n      this.graph.activePhaseIds = this.graph.activePhaseIds.filter((id) => id !== phase.id);\n      this.graph.completedPhaseIds.push(phase.id);\n      this.emit('phase.completed', {\n        phaseId: phase.id,\n        name: phase.name,\n        durationMs: phase.actualDurationMs,\n      });\n      this.ctx.onPhaseComplete?.(phase);\n      // Commit the phase's work in its worktree and queue the merge back into\n      // the base branch (dependency-ordered + globally serialized).\n      await this.commitAndEnqueueMerge(phase);\n    } catch (error) {\n      this.updatePhaseStatus(phase, 'failed');\n      phase.completedAt = Date.now();\n      phase.actualDurationMs = Date.now() - (phase.startedAt ?? Date.now());\n      this.runningPhases.delete(phase.id);\n      this.graph.activePhaseIds = this.graph.activePhaseIds.filter((id) => id !== phase.id);\n      this.graph.failedPhaseIds.push(phase.id);\n      this.emit('phase.failed', {\n        phaseId: phase.id,\n        name: phase.name,\n        error: error instanceof Error ? error.message : String(error),\n      });\n      this.ctx.onPhaseFail?.(phase, error instanceof Error ? error : new Error(String(error)));\n      await this.keepWorktreeForReview(phase);\n    }\n  }\n\n  // \u2500\u2500\u2500 Verification gate \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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   * Run the verification gate for a phase whose tasks all succeeded. Verifies in\n   * the phase's worktree; on failure, runs the repair pass and re-verifies, up to\n   * `maxVerifyAttempts` repairs. Returns the final verdict. When no `verifyPhase`\n   * callback is wired the gate is a no-op and always passes.\n   */\n  private async runVerifyGate(phase: PhaseNode): Promise<{ ok: boolean; output?: string | undefined }> {\n    if (!this.ctx.verifyPhase) return { ok: true };\n    const env = this.worktreeEnv(phase);\n\n    for (let attempt = 0; attempt <= this.opts.maxVerifyAttempts; attempt++) {\n      if (this.stopped) return { ok: false, output: 'stopped before verification completed' };\n\n      this.emit('phase.verifying', { phaseId: phase.id, name: phase.name, attempt });\n      let verdict: { ok: boolean; output?: string | undefined };\n      try {\n        verdict = await this.ctx.verifyPhase(phase, env);\n      } catch (err) {\n        verdict = { ok: false, output: toErrorMessage(err) };\n      }\n      if (verdict.ok) return { ok: true };\n\n      this.emit('phase.verifyFailed', {\n        phaseId: phase.id,\n        name: phase.name,\n        attempt,\n        error: verdict.output,\n      });\n\n      // Out of attempts, no repair pass available, or aborted \u2192 give up.\n      if (attempt >= this.opts.maxVerifyAttempts || !this.ctx.repairPhase || this.stopped) {\n        return { ok: false, output: verdict.output };\n      }\n\n      this.emit('phase.repairing', { phaseId: phase.id, name: phase.name, attempt: attempt + 1 });\n      try {\n        await this.ctx.repairPhase(\n          phase,\n          verdict.output ?? 'verification failed',\n          attempt + 1,\n          env,\n        );\n      } catch {\n        // A failed repair is non-fatal: the next verifyPhase run will observe the\n        // still-broken tree and the loop will exit with ok:false.\n      }\n    }\n    return { ok: false };\n  }\n\n  /** Worktree env (cwd/branch) for a phase, or undefined if it runs on the shared tree. */\n  /** Bundle of orchestrator state the worktree-integration steps drive. */\n  private integrationCtx(): IntegrationContext {\n    return {\n      graph: this.graph,\n      ctx: this.ctx,\n      logger: this.logger,\n      worktrees: this.worktrees,\n      phaseWorktrees: this.phaseWorktrees,\n      phaseMergePromise: this.phaseMergePromise,\n      runningPhases: this.runningPhases,\n      getMergeQueue: () => this.mergeQueue,\n      setMergeQueue: (queue) => {\n        this.mergeQueue = queue;\n      },\n      emit: (event, payload) => this.emit(event, payload),\n      updatePhaseStatus: (phase, status) => this.updatePhaseStatus(phase, status),\n    };\n  }\n\n  private worktreeEnv(phase: PhaseNode): { cwd?: string | undefined; branch?: string | undefined } | undefined {\n    return worktreeEnv(this.integrationCtx(), phase);\n  }\n\n  private async failPhaseAfterTasks(phase: PhaseNode, error: string): Promise<void> {\n    await failPhaseAfterTasks(this.integrationCtx(), phase, error);\n  }\n\n  /** Trim long verifier output so it fits cleanly in an event/error message. */\n  private truncate(text: string, max = 500): string {\n    return truncate(text, max);\n  }\n\n  // \u2500\u2500\u2500 Worktree integration \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 async commitAndEnqueueMerge(phase: PhaseNode): Promise<void> {\n    await commitAndEnqueueMerge(this.integrationCtx(), phase);\n  }\n  /** A failed phase keeps its worktree on disk for inspection (no merge). */\n  private async keepWorktreeForReview(phase: PhaseNode): Promise<void> {\n    await keepWorktreeForReview(this.integrationCtx(), phase);\n  }\n\n  private async executePhaseTasks(phase: PhaseNode): Promise<void> {\n    const pendingTasks = this.getExecutableTasks(phase);\n\n    while (pendingTasks.length > 0 && !this.stopped) {\n      const batch = pendingTasks.splice(0, this.opts.maxConcurrentTasks);\n\n      const results = await Promise.allSettled(\n        batch.map((task) => this.executeSingleTask(task, phase)),\n      );\n\n      for (let i = 0; i < results.length; i++) {\n        const result = results[i];\n        const task = batch[i];\n        if (!result || !task) continue;\n\n        if (result.status === 'fulfilled') {\n          this.markTaskCompleted(phase, task);\n        } else {\n          this.markTaskFailed(phase, task, result.reason);\n        }\n      }\n\n      const newReady = this.getExecutableTasks(phase);\n      pendingTasks.length = 0;\n      pendingTasks.push(...newReady);\n    }\n  }\n\n  private async executeSingleTask(task: TaskNode, phase: PhaseNode): Promise<unknown> {\n    const tracker = this.getTrackerForPhase(phase);\n    tracker.updateNodeStatus(task.id, 'in_progress');\n    // Signal the start so boards can move the card to \"in progress\" and show the\n    // worker. `executeTask` may assign/refine the agent right after (taskAssigned).\n    this.emit('phase.taskStarted', {\n      phaseId: phase.id,\n      taskId: task.id,\n      taskTitle: task.title,\n      agentName: task.assignee,\n    });\n    const handle = this.phaseWorktrees.get(phase.id);\n    const taskPromise = this.ctx.executeTask(task, phase.id, {\n      cwd: handle?.dir,\n      branch: handle?.branch,\n    });\n    // Apply per-task timeout when configured (taskTimeoutMs > 0).\n    if (this.opts.taskTimeoutMs > 0) {\n      const timeoutMs = this.opts.taskTimeoutMs;\n      const timedOut = Symbol('timed_out');\n      const result = await Promise.race([\n        taskPromise,\n        new Promise<typeof timedOut>((resolve) => {\n          const timer = setTimeout(() => resolve(timedOut), timeoutMs);\n          // Let the timer be freed if the task finishes first.\n          taskPromise.then(() => clearTimeout(timer)).catch(() => clearTimeout(timer));\n        }),\n      ]);\n      if (result === timedOut) {\n        this.emit('phase.taskTimedOut', {\n          phaseId: phase.id,\n          taskId: task.id,\n          taskTitle: task.title,\n          timeoutMs,\n        });\n        throw new Error(\n          `Task \"${task.title}\" (${task.id}) exceeded timeout of ${timeoutMs} ms`,\n        );\n      }\n      return result;\n    }\n    return taskPromise;\n  }\n\n  private markTaskCompleted(phase: PhaseNode, task: TaskNode): void {\n    const tracker = this.getTrackerForPhase(phase);\n    tracker.updateNodeStatus(task.id, 'completed');\n    this.emit('phase.taskCompleted', {\n      phaseId: phase.id,\n      taskId: task.id,\n      taskTitle: task.title,\n    });\n  }\n\n  private markTaskFailed(phase: PhaseNode, task: TaskNode, error: unknown): void {\n    const tracker = this.getTrackerForPhase(phase);\n    const taskKey = `${phase.id}:${task.id}`;\n    const currentRetries = this.taskRetryCounts.get(taskKey) ?? 0;\n\n    if (currentRetries < this.opts.maxRetries) {\n      this.taskRetryCounts.set(taskKey, currentRetries + 1);\n      tracker.updateNodeStatus(\n        task.id,\n        'pending',\n        `Retry ${currentRetries + 1}/${this.opts.maxRetries}`,\n      );\n      this.emit('phase.taskRetrying', {\n        phaseId: phase.id,\n        taskId: task.id,\n        taskTitle: task.title,\n        attempt: currentRetries + 1,\n        maxRetries: this.opts.maxRetries,\n      });\n    } else {\n      tracker.updateNodeStatus(\n        task.id,\n        'failed',\n        error instanceof Error ? error.message : String(error),\n      );\n      this.emit('phase.taskFailed', {\n        phaseId: phase.id,\n        taskId: task.id,\n        taskTitle: task.title,\n        error: error instanceof Error ? error.message : String(error),\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\n\n  private getReadyPhases(): PhaseNode[] {\n    return getReadyPhases(this.graph);\n  }\n\n  private getActivePhases(): PhaseNode[] {\n    return getActivePhases(this.graph);\n  }\n\n  private getExecutableTasks(phase: PhaseNode): TaskNode[] {\n    return getExecutableTasks((p) => this.getTrackerForPhase(p), phase);\n  }\n\n  private getTrackerForPhase(phase: PhaseNode): TaskTracker {\n    const cached = this.trackerCache.get(phase.id);\n    if (cached) return cached;\n\n    const tracker = new TaskTracker({ store: new DefaultTaskStore() });\n    tracker.setGraph(phase.taskGraph);\n    this.trackerCache.set(phase.id, tracker);\n    return tracker;\n  }\n\n  private getFailedTaskCount(phase: PhaseNode): number {\n    return getFailedTaskCount((p) => this.getTrackerForPhase(p), phase);\n  }\n\n  private getCompletedTaskCount(phase: PhaseNode): number {\n    return getCompletedTaskCount((p) => this.getTrackerForPhase(p), phase);\n  }\n\n  private updatePhaseStatus(phase: PhaseNode, status: PhaseStatus): void {\n    const from = phase.status;\n    phase.status = status;\n    phase.updatedAt = Date.now();\n    this.graph.updatedAt = Date.now();\n    this.emit('phase.statusChange', { phaseId: phase.id, from, to: status });\n  }\n\n  private isComplete(): boolean {\n    return isGraphComplete(this.graph);\n  }\n\n  private onGraphComplete(): void {\n    this.graph.completedAt = Date.now();\n    const durationMs = this.graph.completedAt - (this.graph.startedAt ?? this.graph.completedAt);\n    this.emit('graph.completed', { graphId: this.graph.id, durationMs });\n    this.stop();\n  }\n\n  private onGraphFailed(failedPhase: PhaseNode): void {\n    this.emit('graph.failed', {\n      graphId: this.graph.id,\n      failedPhaseId: failedPhase.id,\n      error: `Phase \"${failedPhase.name}\" failed`,\n    });\n    this.stop();\n  }\n\n  // \u2500\u2500\u2500 Progress \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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  getProgress(): PhaseProgress {\n    return getProgress(this.graph, (p) => this.getTrackerForPhase(p));\n  }\n\n  getGraph(): PhaseGraph {\n    return this.graph;\n  }\n\n  isRunning(): boolean {\n    return !this.stopped && this.runningPhases.size > 0;\n  }\n\n  isPaused(): boolean {\n    return this.paused;\n  }\n\n  // \u2500\u2500\u2500 Agent Assignment \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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  assignAgent(phaseId: string, agentId: string): void {\n    const phase = this.graph.phases.get(phaseId);\n    if (!phase) return;\n    if (!phase.assignedAgents.includes(agentId)) {\n      phase.assignedAgents.push(agentId);\n      this.emit('agent.assigned', { phaseId, agentId });\n    }\n  }\n\n  releaseAgent(phaseId: string, agentId: string): void {\n    const phase = this.graph.phases.get(phaseId);\n    if (!phase) return;\n    phase.assignedAgents = phase.assignedAgents.filter((id) => id !== agentId);\n    this.emit('agent.released', { phaseId, agentId });\n  }\n\n  // \u2500\u2500\u2500 Interactive board mutations \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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  // These are driven by an interactive board (WebUI/TUI), not the autonomous\n  // loop. Each mutates the live graph, emits a typed event so every surface\n  // stays in sync, and bumps updatedAt so the host re-persists.\n\n  /** Find the phase whose task graph currently holds `taskId`. */\n  findPhaseOfTask(taskId: string): PhaseNode | undefined {\n    return findPhaseOfTaskInGraph(this.graph, taskId);\n  }\n\n  /**\n   * Move a task to another phase's task graph. Edges that referenced the task\n   * are dropped (cross-phase dependencies are not modeled). No-op when the task\n   * or target phase is missing, or it is already in the target phase.\n   */\n  moveTask(taskId: string, toPhaseId: string): boolean {\n    return movePhaseTask(this.boardMutationContext(), taskId, toPhaseId);\n  }\n\n  /** (Re)assign a task to a specific agent (or clear with agentName/agentId omitted). */\n  setTaskAssignee(taskId: string, agentId?: string, agentName?: string): boolean {\n    return setPhaseTaskAssignee(this.boardMutationContext(), taskId, agentId, agentName);\n  }\n\n  /** Add a new task to a phase. Returns the created task id, or null if the phase is missing. */\n  addTask(\n    phaseId: string,\n    spec: {\n      title: string;\n      description?: string | undefined;\n      type?: TaskNode['type'] | undefined;\n      priority?: TaskNode['priority'] | undefined;\n    },\n  ): string | null {\n    return addPhaseTask(this.boardMutationContext(), phaseId, spec);\n  }\n\n  /**\n   * Requeue a task to `pending` (clearing its retry counter) and nudge a\n   * terminal/paused phase back to `ready` so the loop re-runs it. Backs both the\n   * board's \"retry\" and \"start\" affordances.\n   */\n  requeueTask(taskId: string): boolean {\n    return requeuePhaseTask(this.boardMutationContext(), taskId);\n  }\n\n  private boardMutationContext() {\n    return {\n      graph: this.graph,\n      trackerCache: this.trackerCache,\n      taskRetryCounts: this.taskRetryCounts,\n      phaseWorktrees: this.phaseWorktrees,\n      getTrackerForPhase: (phase: PhaseNode) => this.getTrackerForPhase(phase),\n      updatePhaseStatus: (phase: PhaseNode, status: PhaseStatus) =>\n        this.updatePhaseStatus(phase, status),\n      emit: (event: string, payload: unknown) =>\n        this.emit(event as PhaseEventName, payload as PhaseEventMap[PhaseEventName]),\n    };\n  }\n\n  // \u2500\u2500\u2500 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\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 emit<K extends PhaseEventName>(event: K, payload: PhaseEventMap[K]): void {\n    (this.events.emit as (event: string, payload: unknown) => void)(event, payload);\n  }\n\n  private async waitWhilePaused(): Promise<void> {\n    while (this.paused && !this.stopped) {\n      await this.delay(100);\n    }\n  }\n\n  private delay(ms: number): Promise<void> {\n    return new Promise((resolve) => setTimeout(resolve, ms));\n  }\n}\n", "import { PhaseGraphBuilder } from './phase-graph-builder.js';\nimport { PhaseOrchestrator } from './phase-orchestrator.js';\nimport type {\n  GoalOptions,\n  PhaseExecutionContext,\n  PhaseGraph,\n  PhaseNode,\n  PhaseProgress,\n  PhaseTemplate,\n} from './types.js';\n\nexport interface GoalRunnerOptions extends GoalOptions {\n  /** Project title. */\n  title: string;\n  description?: string | undefined;\n  /** Phase templates. */\n  phases: PhaseTemplate[];\n  /** Function that executes a task. */\n  executeTask: PhaseExecutionContext['executeTask'];\n  /** Optional verification gate. */\n  verifyPhase?: PhaseExecutionContext['verifyPhase'] | undefined;\n  /** Optional repair pass after verification failure. */\n  repairPhase?: PhaseExecutionContext['repairPhase'] | undefined;\n  /** Optional resolver for worktree merge conflicts. */\n  resolveConflict?: PhaseExecutionContext['resolveConflict'] | undefined;\n  /** Optional Brain arbiter. */\n  brain?: PhaseExecutionContext['brain'] | undefined;\n  /** Called when a phase completes. */\n  onPhaseComplete?: ((phase: PhaseNode) => void) | undefined;\n  /** Called when a phase fails. */\n  onPhaseFail?: (phase: PhaseNode, error: Error) => void;\n  /** Called on every orchestrator tick. */\n  onTick?: (ctx: { activePhases: PhaseNode[]; readyPhases: PhaseNode[] }) => void;\n  /** Called when progress changes. */\n  onProgress?: ((progress: PhaseProgress) => void) | undefined;\n  /** Safety net that stops a phase graph if cleanup is bypassed. Default: 24h. */\n  maxRunDurationMs?: number | undefined;\n  /** Called when the graph completes. */\n  onComplete?: ((graph: PhaseGraph) => void) | undefined;\n  /** Called when the graph fails. */\n  onFail?: (graph: PhaseGraph, failedPhase: PhaseNode, error: Error) => void;\n}\n\n/**\n * GoalRunner - high-level API for managing the whole autonomous phase flow from one entry point.\n *\n * Usage:\n *   const runner = new GoalRunner({\n *     title: 'Auth Refactor',\n *     phases: [...],\n *     executeTask: async (task, phaseId) => { ... },\n *     onProgress: (p) => console.log(`${p.percentComplete}% done`),\n *   });\n *   await runner.start();\n */\nexport class GoalRunner {\n  private graph: PhaseGraph | null = null;\n  private orchestrator: PhaseOrchestrator | null = null;\n  private opts: GoalRunnerOptions;\n  private progressInterval: ReturnType<typeof setInterval> | null = null;\n  private maxRunTimer: ReturnType<typeof setTimeout> | null = null;\n\n  private readonly graphCompletedHandler = (payload: unknown) => {\n    const p = payload as { graphId: string; durationMs: number };\n    if (this.graph && p.graphId === this.graph.id) {\n      this.opts.onComplete?.(this.graph);\n      this.cleanup();\n    }\n  };\n\n  private readonly graphFailedHandler = (payload: unknown) => {\n    const p = payload as { graphId: string; failedPhaseId: string; error: string };\n    if (this.graph && p.graphId === this.graph.id) {\n      const failedPhase = this.graph.phases.get(p.failedPhaseId);\n      if (failedPhase) {\n        this.opts.onFail?.(this.graph, failedPhase, new Error(p.error));\n      }\n      // Only cleanup on failure when stopOnFailure is explicitly true.\n      // When false (default), the orchestrator continues with remaining phases.\n      if (this.opts.stopOnFailure) {\n        this.cleanup();\n      }\n    }\n  };\n\n  /** Stores the unsubscribe function returned by EventBus.on() */\n  private unsubscribeCompleted: (() => void) | null = null;\n  private unsubscribeFailed: (() => void) | null = null;\n\n  constructor(opts: GoalRunnerOptions) {\n    this.opts = opts;\n  }\n\n  async start(): Promise<PhaseGraph> {\n    // Create the phase graph.\n    const builder = new PhaseGraphBuilder({\n      title: this.opts.title,\n      description: this.opts.description,\n      phases: this.opts.phases,\n      autonomous: this.opts.autonomous,\n      stopOnFailure: this.opts.stopOnFailure,\n    });\n\n    this.graph = await builder.build();\n\n    // Execution context\n    const ctx: PhaseExecutionContext = {\n      executeTask: this.opts.executeTask,\n      brain: this.opts.brain,\n      onPhaseComplete: (phase) => {\n        this.opts.onPhaseComplete?.(phase);\n      },\n      onPhaseFail: (phase, error) => {\n        this.opts.onPhaseFail?.(phase, error);\n      },\n      onTick: (tickCtx) => {\n        this.opts.onTick?.(tickCtx);\n      },\n    };\n    if (this.opts.verifyPhase !== undefined) ctx.verifyPhase = this.opts.verifyPhase;\n    if (this.opts.repairPhase !== undefined) ctx.repairPhase = this.opts.repairPhase;\n    if (this.opts.resolveConflict !== undefined) ctx.resolveConflict = this.opts.resolveConflict;\n\n    // Create and start the orchestrator.\n    this.orchestrator = new PhaseOrchestrator({\n      graph: this.graph,\n      ctx,\n      maxConcurrentPhases: this.opts.maxConcurrentPhases,\n      maxConcurrentTasks: this.opts.maxConcurrentTasks,\n      maxRetries: this.opts.maxRetries,\n      maxVerifyAttempts: this.opts.maxVerifyAttempts,\n      autonomous: this.opts.autonomous,\n      phaseDelayMs: this.opts.phaseDelayMs,\n      stopOnFailure: this.opts.stopOnFailure,\n      events: this.opts.events,\n      worktrees: this.opts.worktrees,\n    });\n\n    // Register event listeners using the untyped surface to handle custom events.\n    // Call through the bus as the receiver \u2014 detaching the method (`const f =\n    // events.on`) loses `this`, and EventBus.on is a plain prototype method, so\n    // the detached call throws on `this.listeners`. The arrow wrapper keeps it\n    // bound to the bus.\n    if (this.opts.events) {\n      const bus = this.opts.events as unknown as {\n        on(event: string, handler: (payload: unknown) => void): () => void;\n      };\n      const onUntyped = (event: string, handler: (payload: unknown) => void): (() => void) =>\n        bus.on(event, handler);\n      // Store the unsubscribe functions for proper cleanup\n      this.unsubscribeCompleted = onUntyped('graph.completed', this.graphCompletedHandler);\n      this.unsubscribeFailed = onUntyped('graph.failed', this.graphFailedHandler);\n    }\n\n    await this.orchestrator.start();\n\n    // Arm the max-run-duration timeout only AFTER orchestrator.start() settles,\n    // so the timer cannot fire mid-start and race with this.orchestrator.stop().\n    this.maxRunTimer = setTimeout(\n      () => {\n        this.opts.onProgress?.({\n          totalPhases: 0, pending: 0, ready: 0, running: 0, paused: 0,\n          completed: 0, failed: 0, skipped: 0, percentComplete: 0,\n          totalTasks: 0, completedTasks: 0, failedTasks: 0,\n          estimatedHours: 0, actualHours: 0,\n        });\n        this.stop();\n      },\n      this.opts.maxRunDurationMs ?? 7 * 24 * 60 * 60_000,\n    );\n    if (this.opts.maxRunDurationMs !== undefined && this.opts.maxRunDurationMs <= 0) {\n      clearTimeout(this.maxRunTimer);\n      this.maxRunTimer = null;\n    }\n    this.maxRunTimer?.unref?.();\n\n    // Progress reporting \u2014 start after orchestrator is running.\n    if (this.opts.onProgress) {\n      this.progressInterval = setInterval(() => {\n        const progress = this.orchestrator?.getProgress();\n        if (progress) this.opts.onProgress?.(progress);\n      }, 2000);\n    }\n\n    return this.graph;\n  }\n\n  pause(): void {\n    this.orchestrator?.pause();\n  }\n\n  resume(): void {\n    this.orchestrator?.resume();\n  }\n\n  stop(): void {\n    this.orchestrator?.stop();\n    this.cleanup();\n  }\n\n  getProgress(): PhaseProgress | null {\n    return this.orchestrator?.getProgress() ?? null;\n  }\n\n  getGraph(): PhaseGraph | null {\n    return this.graph;\n  }\n\n  isRunning(): boolean {\n    return this.orchestrator?.isRunning() ?? false;\n  }\n\n  isPaused(): boolean {\n    return this.orchestrator?.isPaused() ?? false;\n  }\n\n  assignAgent(phaseId: string, agentId: string): void {\n    this.orchestrator?.assignAgent(phaseId, agentId);\n  }\n\n  releaseAgent(phaseId: string, agentId: string): void {\n    this.orchestrator?.releaseAgent(phaseId, agentId);\n  }\n\n  private cleanup(): void {\n    if (this.progressInterval) {\n      clearInterval(this.progressInterval);\n      this.progressInterval = null;\n    }\n    if (this.maxRunTimer) {\n      clearTimeout(this.maxRunTimer);\n      this.maxRunTimer = null;\n    }\n    // Use the unsubscribe functions returned by EventBus.on() instead of .off()\n    this.unsubscribeCompleted?.();\n    this.unsubscribeCompleted = null;\n    this.unsubscribeFailed?.();\n    this.unsubscribeFailed = null;\n  }\n}\n\n/**\n * Quick-start helper: create an GoalRunner from an existing TaskGraph.\n */\nexport async function createGoalRunnerFromTaskGraph(\n  taskGraph: import('../types/task-graph.js').TaskGraph,\n  options: Omit<GoalRunnerOptions, 'phases' | 'title'> & {\n    title?: string | undefined;\n    tasksPerPhase?: number | undefined;\n  },\n): Promise<GoalRunner> {\n  const graph = await PhaseGraphBuilder.fromTaskGraph(taskGraph, {\n    title: options.title ?? taskGraph.title,\n    tasksPerPhase: options.tasksPerPhase,\n  });\n\n  // Extract phase templates from the PhaseGraph.\n  const phases: PhaseTemplate[] = Array.from(graph.phases.values()).map((p) => ({\n    name: p.name,\n    description: p.description,\n    priority: p.priority,\n    estimateHours: p.estimateHours,\n    parallelizable: p.parallelizable,\n  }));\n\n  return new GoalRunner({\n    ...options,\n    title: options.title ?? taskGraph.title,\n    phases,\n  });\n}\n", "import { readFileSync, statSync } from 'node:fs';\nimport * as path from 'node:path';\nimport { fileURLToPath } from 'node:url';\n\n/**\n * Cache of resolved instruction text, keyed by the relative path. Bundled\n * instruction files are immutable for the process lifetime, so re-reading them\n * on every call (some callers do so per LLM request) is wasted disk I/O.\n */\nconst textCache = new Map<string, string>();\n\n/** Resolved once \u2014 the candidate roots only depend on this module's location. */\nlet rootCandidates: string[] | undefined;\n\nexport function readBundledInstructionText(relativePath: string): string {\n  const cached = textCache.get(relativePath);\n  if (cached !== undefined) return cached;\n\n  let resolved = '';\n  for (const root of instructionRootCandidates()) {\n    try {\n      resolved = readFileSync(path.join(root, relativePath), 'utf8').trimEnd();\n      break;\n    } catch {\n      // try next candidate\n    }\n  }\n  textCache.set(relativePath, resolved);\n  return resolved;\n}\n\nexport function renderInstructionTemplate(\n  template: string,\n  values: Record<string, string>,\n): string {\n  return template.replace(/\\{\\{\\s*([a-zA-Z0-9_.-]+)\\s*\\}\\}/g, (match, key: string) =>\n    Object.hasOwn(values, key) ? (values[key] ?? '') : match,\n  );\n}\n\nfunction instructionRootCandidates(): string[] {\n  if (rootCandidates !== undefined) return rootCandidates;\n  const here = path.dirname(fileURLToPath(import.meta.url));\n  const candidates = [\n    path.resolve(here, '../../instructions'),\n    path.resolve(here, '../instructions'),\n    path.resolve(here, 'instructions'),\n  ];\n  rootCandidates = candidates.sort((a, b) => Number(!isDirectory(a)) - Number(!isDirectory(b)));\n  return rootCandidates;\n}\n\nfunction isDirectory(candidate: string): boolean {\n  try {\n    return statSync(candidate).isDirectory();\n  } catch {\n    return false;\n  }\n}\n", "/**\n * GoalPlanner - converts a goal into phases using a real LLM call,\n * producing a large task list with todos under each phase.\n *\n * Similar to SDD's spec-to-task flow, but different: the output is directly\n * `PhaseTemplate[]`; each phase carries `taskTemplates`, so\n * `PhaseGraphBuilder` produces a populated `PhaseGraph` and `PhaseOrchestrator`\n * runs each task through a real agent execution.\n *\n * The planner is not tied to a specific LLM: callers provide a `runOnce(prompt)` function\n * (a subagent run in the CLI, or a deterministic stub in tests).\n */\n\nimport type { TaskPriority, TaskType } from '../types/task-graph.js';\nimport {\n  readBundledInstructionText,\n  renderInstructionTemplate,\n} from '../utils/instruction-file.js';\nimport type { PhaseNode, PhaseTemplate } from './types.js';\n\n/** Single todo template, the element type of PhaseTemplate.taskTemplates. */\ntype PhaseTaskTemplate = NonNullable<PhaseTemplate['taskTemplates']>[number];\n\nexport interface GoalPlannerOptions {\n  /**\n   * One-shot LLM call: receives a prompt and returns the model text output.\n   * In the CLI this wraps subagent.run; in tests it can be a deterministic stub.\n   */\n  runOnce: (prompt: string) => Promise<string>;\n  /** Goal or project title. */\n  goal: string;\n  /** Optional project context such as package.json or directory structure. */\n  projectContext?: string | undefined;\n  /** Requested minimum phase count. Defaults to 3. */\n  minPhases?: number | undefined;\n  /** Requested maximum phase count. Defaults to 8. */\n  maxPhases?: number | undefined;\n  /** Target todo count per phase. Defaults to 6. */\n  todosPerPhase?: number | undefined;\n  /**\n   * Maximum total tasks across all phases. When set, plans exceeding\n   * this limit will have `budgetExceeded: true` and `warnings` will\n   * describe the overage. Defaults to 0 (no limit).\n   */\n  maxTotalTasks?: number | undefined;\n}\n\nexport interface GoalPlanResult {\n  /** Phase templates passed to PhaseGraphBuilder. */\n  phases: PhaseTemplate[];\n  /** Raw model output for debugging and logs. */\n  raw: string;\n  /** True when JSON could not be parsed; `phases` is empty in that case. */\n  parseFailed: boolean;\n  /** Validation warnings collected during coercion (e.g. invalid priority defaults). */\n  warnings: string[];\n  /**\n   * Rough cost estimate (in tokens) for executing this plan.\n   * Based on estimated task count \u00D7 average per-task LLM round-trip.\n   */\n  estimatedCostTokens?: number | undefined;\n  /** True when the plan exceeds `maxTotalTasks` budget. */\n  budgetExceeded?: boolean | undefined;\n}\n\nconst VALID_TASK_TYPES: ReadonlySet<TaskType> = new Set([\n  'feature',\n  'bugfix',\n  'refactor',\n  'docs',\n  'test',\n  'chore',\n]);\nconst VALID_PRIORITIES: ReadonlySet<TaskPriority> = new Set([\n  'critical',\n  'high',\n  'medium',\n  'low',\n]);\n\n/**\n * GoalPlanner drives the model through `plan()` and produces `PhaseTemplate[]`.\n */\nexport class GoalPlanner {\n  constructor(private readonly opts: GoalPlannerOptions) {}\n\n  /** Convert the goal into a phase-and-todo plan. */\n  async plan(): Promise<GoalPlanResult> {\n    const prompt = this.buildPrompt();\n    const raw = await this.opts.runOnce(prompt);\n    const { phases, warnings } = this.parse(raw);\n    // Rough cost estimate: each task runs ~5 LLM round-trips at ~2k tokens each.\n    const totalTasks = phases.reduce((s, p) => s + (p.taskTemplates?.length ?? 0), 0);\n    const estimatedCostTokens = totalTasks > 0 ? totalTasks * 5 * 2000 : undefined;\n    // Budget check: reject plans that exceed maxTotalTasks.\n    const maxTotal = this.opts.maxTotalTasks ?? 0;\n    let budgetExceeded = false;\n    if (maxTotal > 0 && totalTasks > maxTotal) {\n      warnings.push(\n        `Plan has ${totalTasks} total tasks, exceeding the limit of ${maxTotal}. ` +\n        `Consider narrowing the scope or increasing the limit.`,\n      );\n      budgetExceeded = true;\n    }\n    return { phases, raw, parseFailed: phases.length === 0, warnings, estimatedCostTokens, budgetExceeded };\n  }\n\n  /** Instruction prompt for the plan the model should produce. */\n  buildPrompt(): string {\n    const minP = this.opts.minPhases ?? 3;\n    const maxP = this.opts.maxPhases ?? 8;\n    const todos = this.opts.todosPerPhase ?? 6;\n    const ctx = this.opts.projectContext?.trim();\n\n    return renderInstructionTemplate(readBundledInstructionText('goal/phase-planner.md'), {\n      minPhases: String(minP),\n      maxPhases: String(maxP),\n      todosPerPhase: String(todos),\n      goal: this.opts.goal,\n      projectContext: ctx ? `\\nPROJECT CONTEXT:\\n${ctx}\\n` : '',\n    });\n  }\n\n  /** Extract JSON from raw output, validate it, and convert it to PhaseTemplate[].\n   *  Returns `{ phases, warnings }` where warnings describe coerced defaults. */\n  parse(raw: string): { phases: PhaseTemplate[]; warnings: string[] } {\n    const json = extractJSONArray(raw);\n    if (!json) return { phases: [], warnings: ['No JSON array found in model output'] };\n    let data: unknown;\n    try {\n      data = JSON.parse(json);\n    } catch {\n      return { phases: [], warnings: ['Failed to parse JSON from model output'] };\n    }\n    if (!Array.isArray(data)) return { phases: [], warnings: ['Model output is not a JSON array'] };\n    const warnings: string[] = [];\n    const phases: PhaseTemplate[] = [];\n    for (const entry of data) {\n      const result = this.coercePhase(entry);\n      if (result) {\n        phases.push(result.phase);\n        warnings.push(...result.warnings);\n      }\n    }\n    return { phases, warnings };\n  }\n\n  private coercePhase(entry: unknown): { phase: PhaseTemplate; warnings: string[] } | null {\n    if (!entry || typeof entry !== 'object') return null;\n    const e = entry as Record<string, unknown>;\n    const name = typeof e.name === 'string' ? e.name.trim() : '';\n    if (!name) return null;\n    const w: string[] = [];\n    const rawTasks = Array.isArray(e.tasks)\n      ? e.tasks\n      : Array.isArray(e.taskTemplates)\n        ? e.taskTemplates\n        : [];\n\n    const taskTemplates: PhaseTaskTemplate[] = [];\n    for (const t of rawTasks) {\n      const result = this.coerceTask(t);\n      if (result) {\n        taskTemplates.push(result.task);\n        w.push(...result.warnings);\n      }\n    }\n\n    const coercedPriority = coercePriority(e.priority);\n    if (typeof e.priority === 'string' && coercedPriority !== e.priority) {\n      w.push('Phase \"' + name + '\": invalid priority \"' + String(e.priority) + '\", defaulting to \"' + coercedPriority + '\"');\n    }\n    return {\n      phase: {\n        name,\n        description: typeof e.description === 'string' ? e.description : '',\n        priority: coercedPriority as PhaseNode['priority'],\n      estimateHours: coerceHours(e.estimateHours, 4),\n      parallelizable: e.parallelizable === true,\n      taskTemplates,\n      },\n      warnings: w,\n    };\n  }\n\n  private coerceTask(t: unknown): { task: PhaseTaskTemplate; warnings: string[] } | null {\n    if (!t || typeof t !== 'object') return null;\n    const o = t as Record<string, unknown>;\n    const title = typeof o.title === 'string' ? o.title.trim() : '';\n    if (!title) return null;\n\n    const w: string[] = [];\n    let type: TaskType = 'feature';\n    if (typeof o.type === 'string') {\n      if (VALID_TASK_TYPES.has(o.type as TaskType)) {\n        type = o.type as TaskType;\n      } else {\n        w.push('Task \"' + title + '\": invalid type \"' + o.type + '\", defaulting to \"feature\"');\n      }\n    }\n    const coercedPriority = coercePriority(o.priority);\n    if (typeof o.priority === 'string' && coercedPriority !== o.priority) {\n      w.push('Task \"' + title + '\": invalid priority \"' + String(o.priority) + '\", defaulting to \"' + coercedPriority + '\"');\n    }\n\n    return {\n      task: {\n        title,\n        description: typeof o.description === 'string' ? o.description : '',\n        type,\n        priority: coercedPriority,\n      estimateHours: coerceHours(o.estimateHours, 2),\n      tags: Array.isArray(o.tags) ? o.tags.map(String) : [],\n      },\n      warnings: w,\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 coercePriority(value: unknown): TaskPriority {\n  return VALID_PRIORITIES.has(value as TaskPriority) ? (value as TaskPriority) : 'medium';\n}\n\nfunction coerceHours(value: unknown, fallback: number): number {\n  const n = Number(value);\n  return Number.isFinite(n) && n > 0 ? n : fallback;\n}\n\n/**\n * Extract the first JSON array from text. Tries, in order:\n *  1. The first [ ... ] inside a ```json ... ``` or bare ``` code block\n *  2. The first balanced [ ... ] block in the text, aware of strings and escapes\n */\nexport function extractJSONArray(text: string): string | null {\n  // 1) Fenced code block\n  const fence = text.match(/```(?:json)?\\s*([\\s\\S]*?)```/i);\n  const candidates: string[] = [];\n  if (fence?.[1]) candidates.push(fence[1]);\n  candidates.push(text);\n\n  for (const candidate of candidates) {\n    const balanced = firstBalancedArray(candidate);\n    if (balanced) return balanced;\n  }\n  return null;\n}\n\n/** Return the first balanced `[ ... ]` block, aware of strings and escapes. */\nfunction firstBalancedArray(text: string): string | null {\n  const start = text.indexOf('[');\n  if (start === -1) return null;\n\n  let depth = 0;\n  let inString = false;\n  let escaped = false;\n  for (let i = start; i < text.length; i++) {\n    const ch = text[i] ?? '';\n    if (inString) {\n      if (escaped) {\n        escaped = false;\n      } else if (ch === '\\\\') {\n        escaped = true;\n      } else if (ch === '\"') {\n        inString = false;\n      }\n      continue;\n    }\n    if (ch === '\"') {\n      inString = true;\n    } else if (ch === '[') {\n      depth++;\n    } else if (ch === ']') {\n      depth--;\n      if (depth === 0) {\n        return text.slice(start, i + 1);\n      }\n    }\n  }\n  return null;\n}\n", "/**\n * GoalAssessor \u2014 analyzes a goal prompt for duration realism.\n *\n * Takes a goal description, runs it through an LLM with a structured\n * prompt, and returns an assessment: whether any claimed duration is\n * realistic, what concerns exist, and a suggested alternate duration.\n *\n * Uses the same `runOnce(prompt)` pattern as GoalPlanner so it works\n * with any LLM provider (subagent in CLI, deterministic stub in tests).\n */\n\nimport {\n  readBundledInstructionText,\n  renderInstructionTemplate,\n} from '../utils/instruction-file.js';\n\n// \u2500\u2500 Types \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface GoalAssessResult {\n  /** True when the goal's duration claim is realistic, or when none is claimed. */\n  realistic: boolean;\n  /** The exact duration text extracted from the goal, or null. */\n  durationClaimed: string | null;\n  /** Human-readable explanation of the realism assessment. */\n  explanation: string;\n  /** Suggested more-reasonable duration when the claim is unrealistic, else null. */\n  recommendedDuration: string | null;\n  /** 1\u20133 concrete risk/concern items. */\n  concerns: string[];\n  /** Raw model output for debugging. */\n  raw: string;\n  /** True when the JSON response could not be parsed. */\n  parseFailed: boolean;\n  /** Parser warning, if any. */\n  parseError?: string | undefined;\n}\n\nexport interface GoalAssessorOptions {\n  /** One-shot LLM call: receives a prompt and returns model text. */\n  runOnce: (prompt: string) => Promise<string>;\n  /** Goal or project description to assess. */\n  goal: string;\n}\n\n// \u2500\u2500 Assessor \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 GoalAssessor {\n  constructor(private readonly opts: GoalAssessorOptions) {}\n\n  /** Analyze the goal and return a structured realism assessment. */\n  async assess(): Promise<GoalAssessResult> {\n    const prompt = this.buildPrompt();\n    const raw = await this.opts.runOnce(prompt);\n    return this.parse(raw);\n  }\n\n  /** Build the instruction prompt for the LLM. */\n  buildPrompt(): string {\n    return renderInstructionTemplate(\n      readBundledInstructionText('goal/goal-assessor.md'),\n      { goal: this.opts.goal },\n    );\n  }\n\n  /** Extract and validate the JSON object from the raw LLM output. */\n  parse(raw: string): GoalAssessResult {\n    const json = extractJSONObject(raw);\n    if (!json) {\n      return {\n        realistic: true,\n        durationClaimed: null,\n        explanation: '',\n        recommendedDuration: null,\n        concerns: [],\n        raw,\n        parseFailed: true,\n        parseError: 'No JSON object found in model output',\n      };\n    }\n    let data: Record<string, unknown>;\n    try {\n      data = JSON.parse(json) as Record<string, unknown>;\n    } catch {\n      return {\n        realistic: true,\n        durationClaimed: null,\n        explanation: '',\n        recommendedDuration: null,\n        concerns: [],\n        raw,\n        parseFailed: true,\n        parseError: 'Failed to parse JSON from model output',\n      };\n    }\n\n    return {\n      realistic: data.realistic === true,\n      durationClaimed: typeof data.durationClaimed === 'string' ? data.durationClaimed : null,\n      explanation: typeof data.explanation === 'string' ? data.explanation : '',\n      recommendedDuration:\n        typeof data.recommendedDuration === 'string' ? data.recommendedDuration : null,\n      concerns: Array.isArray(data.concerns)\n        ? data.concerns.filter((c: unknown): c is string => typeof c === 'string')\n        : [],\n      raw,\n      parseFailed: false,\n    };\n  }\n}\n\n// \u2500\u2500 Helper \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 * Extract the first JSON object `{ ... }` from text, aware of strings and\n * escape characters. Tries fenced code blocks first, then balanced-brace\n * extraction on the raw text.\n */\nfunction extractJSONObject(text: string): string | null {\n  // 1) Fenced code block\n  const fence = text.match(/```(?:json)?\\s*([\\s\\S]*?)```/i);\n  const candidates: string[] = [];\n  if (fence?.[1]) candidates.push(fence[1]);\n  candidates.push(text);\n\n  for (const candidate of candidates) {\n    const balanced = firstBalancedObject(candidate);\n    if (balanced) return balanced;\n  }\n  return null;\n}\n\n/** Return the first balanced `{ ... }` block, aware of strings and escapes. */\nfunction firstBalancedObject(text: string): string | null {\n  const start = text.indexOf('{');\n  if (start === -1) return null;\n\n  let depth = 0;\n  let inString = false;\n  let escaped = false;\n  for (let i = start; i < text.length; i++) {\n    const ch = text[i] ?? '';\n    if (inString) {\n      if (escaped) {\n        escaped = false;\n      } else if (ch === '\\\\') {\n        escaped = true;\n      } else if (ch === '\"') {\n        inString = false;\n      }\n      continue;\n    }\n    if (ch === '\"') {\n      inString = true;\n    } else if (ch === '{') {\n      depth++;\n    } else if (ch === '}') {\n      depth--;\n      if (depth === 0) {\n        return text.slice(start, i + 1);\n      }\n    }\n  }\n  return null;\n}\n", "/**\n * Goal - types for autonomous phase-based workflows.\n *\n * A project is split into phases; each phase contains tasks.\n * Phases are dependency-aware: the next phase cannot start until all tasks\n * in the current phase complete. Parallel phases are optionally supported.\n */\n\nimport type { BrainArbiter } from '../coordination/brain.js';\nimport type { TaskGraph, TaskNode } from '../types/task-graph.js';\n\n// \u2500\u2500\u2500 Phase Status \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 type PhaseStatus =\n  | 'pending' // Not started yet; waiting for a previous phase\n  | 'ready' // Ready to start because previous phases completed\n  | 'running' // Actively running\n  | 'paused' // Paused by the user\n  | 'completed' // All tasks finished\n  | 'failed' // At least one task failed and retries are exhausted\n  | 'skipped'; // Skipped\n\n// \u2500\u2500\u2500 Phase Node \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseNode {\n  id: string;\n  /** Phase name, e.g. \"Discovery\", \"Design\", \"Implementation\", \"Testing\". */\n  name: string;\n  description: string;\n  status: PhaseStatus;\n  /** Task graph for this phase. */\n  taskGraph: TaskGraph;\n  /** Previous phase IDs; this phase cannot start until they complete. */\n  dependsOn: string[];\n  /** Next phase IDs. */\n  nextPhases: string[];\n  /** Whether this phase can run in parallel before the previous phase finishes. */\n  parallelizable: boolean;\n  /** Phase priority. */\n  priority: 'critical' | 'high' | 'medium' | 'low';\n  /** Estimated duration in hours. */\n  estimateHours: number;\n  /** Actual duration in milliseconds. */\n  actualDurationMs?: number | undefined;\n  /** Start time. */\n  startedAt?: number | undefined;\n  /** Completion time. */\n  completedAt?: number | undefined;\n  /** Agents assigned to this phase. */\n  assignedAgents: string[];\n  /** Phase metadata. */\n  metadata?: Record<string, unknown> | undefined;\n  createdAt: number;\n  updatedAt: number;\n}\n\n// \u2500\u2500\u2500 Phase Graph \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseGraph {\n  id: string;\n  /** Project title. */\n  title: string;\n  description: string;\n  phases: Map<string, PhaseNode>;\n  /** Starting phase IDs. */\n  rootPhaseIds: string[];\n  /** Active phase IDs with running status. */\n  activePhaseIds: string[];\n  /** Completed phase IDs. */\n  completedPhaseIds: string[];\n  /** Failed phase IDs. */\n  failedPhaseIds: string[];\n  /** Whether autonomous mode is active. */\n  autonomous: boolean;\n  /** Stop when all phases complete. */\n  stopOnComplete: boolean;\n  /** Split into separate kanban boards per phase. */\n  multiBoard?: boolean | undefined;\n  /** Run typecheck/lint verification after each task. */\n  verifyTasks?: boolean | undefined;\n  /** Enable chimera auto-review for this run. */\n  chimeraReview?: boolean | undefined;\n  createdAt: number;\n  updatedAt: number;\n  startedAt?: number | undefined;\n  completedAt?: number | undefined;\n}\n\n// \u2500\u2500\u2500 Phase Progress \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseProgress {\n  totalPhases: number;\n  pending: number;\n  ready: number;\n  running: number;\n  paused: number;\n  completed: number;\n  failed: number;\n  skipped: number;\n  percentComplete: number;\n  totalTasks: number;\n  completedTasks: number;\n  failedTasks: number;\n  estimatedHours: number;\n  actualHours: number;\n}\n\n// \u2500\u2500\u2500 Phase Event Map \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseEventMap {\n  'phase.statusChange': { phaseId: string; from: PhaseStatus; to: PhaseStatus };\n  'phase.started': { phaseId: string; name: string };\n  'phase.completed': { phaseId: string; name: string; durationMs: number };\n  'phase.failed': { phaseId: string; name: string; error?: string | undefined };\n  /** A task began executing \u2014 carries the worker agent so boards can show who is on it. */\n  'phase.taskStarted': {\n    phaseId: string;\n    taskId: string;\n    taskTitle: string;\n    agentId?: string | undefined;\n    agentName?: string | undefined;\n  };\n  'phase.taskCompleted': { phaseId: string; taskId: string; taskTitle: string };\n  'phase.taskFailed': { phaseId: string; taskId: string; taskTitle: string; error: string };\n  'phase.taskRetrying': {\n    phaseId: string;\n    taskId: string;\n    taskTitle: string;\n    attempt: number;\n    maxRetries: number;\n  };\n  /** A task timed out \u2014 exceeded `taskTimeoutMs`. */\n  'phase.taskTimedOut': {\n    phaseId: string;\n    taskId: string;\n    taskTitle: string;\n    timeoutMs: number;\n  };\n  'phase.allTasksDone': { phaseId: string; completed: number; failed: number };\n  'phase.verifying': { phaseId: string; name: string; attempt: number };\n  'phase.verifyFailed': { phaseId: string; name: string; attempt: number; error?: string | undefined };\n  'phase.repairing': { phaseId: string; name: string; attempt: number };\n  'phase.conflictResolving': { phaseId: string; name: string; files: string[] };\n  'phase.conflictResolved': { phaseId: string; name: string };\n  'graph.completed': { graphId: string; durationMs: number };\n  'graph.failed': { graphId: string; failedPhaseId: string; error: string };\n  'autonomous.tick': { activePhases: string[]; queuedPhases: string[] };\n  'agent.assigned': { phaseId: string; agentId: string };\n  'agent.released': { phaseId: string; agentId: string };\n  /** A task was moved between phases from an interactive board. */\n  'phase.taskMoved': { taskId: string; fromPhaseId: string; toPhaseId: string };\n  /** A task was (re)assigned to a specific agent from an interactive board. */\n  'phase.taskAssigned': {\n    phaseId: string;\n    taskId: string;\n    agentId?: string | undefined;\n    agentName?: string | undefined;\n  };\n  /** A task was added to a phase from an interactive board. */\n  'phase.taskAdded': { phaseId: string; taskId: string; taskTitle: string };\n}\n\nexport type PhaseEventName = keyof PhaseEventMap;\n\n/**\n * All phase event names as a const array. Consumers (TUI, WebUI) should\n * import this rather than hardcoding string literals, so the compiler\n * catches drift when events are added or renamed.\n */\nexport const PHASE_EVENT_NAMES: readonly PhaseEventName[] = [\n  'phase.statusChange',\n  'phase.started',\n  'phase.completed',\n  'phase.failed',\n  'phase.taskStarted',\n  'phase.taskCompleted',\n  'phase.taskFailed',\n  'phase.taskRetrying',\n  'phase.taskTimedOut',\n  'phase.allTasksDone',\n  'phase.verifying',\n  'phase.verifyFailed',\n  'phase.repairing',\n  'phase.conflictResolving',\n  'phase.conflictResolved',\n  'phase.taskMoved',\n  'phase.taskAssigned',\n  'phase.taskAdded',\n  'graph.completed',\n  'graph.failed',\n  'autonomous.tick',\n  'agent.assigned',\n  'agent.released',\n];\n\n// \u2500\u2500\u2500 Phase Execution Context \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseExecutionContext {\n  /**\n   * Execute a task through an AI agent. `env` points to the phase git\n   * worktree when available, so the agent runs in an isolated working directory.\n   */\n  executeTask: (\n    task: TaskNode,\n    phaseId: string,\n    env?: { cwd?: string | undefined; branch?: string | undefined },\n  ) => Promise<unknown>;\n  /**\n   * Optional verification gate. Called after all tasks in a phase finish,\n   * but before the phase is marked \"completed\" and its worktree is merged\n   * back to the base branch. `env` points to the phase worktree when available;\n   * verification should run in that isolated directory, such as typecheck/test.\n   * If `ok:false` is returned, merge is blocked and `repairPhase` is attempted when available.\n   *\n   * If undefined, the gate is skipped for backward compatibility.\n   */\n  verifyPhase?:\n    | ((\n        phase: PhaseNode,\n        env?: { cwd?: string | undefined; branch?: string | undefined },\n      ) => Promise<{ ok: boolean; output?: string | undefined }>)\n    | undefined;\n  /**\n   * Optional repair pass. When `verifyPhase` fails, it is called with the\n   * captured error output. It should try to fix the code in the worktree\n   * for example, through a repair subagent. Its return value is ignored;\n   * the orchestrator reruns `verifyPhase` afterward. It is never called when `verifyPhase` is undefined.\n   */\n  repairPhase?:\n    | ((\n        phase: PhaseNode,\n        failure: string,\n        attempt: number,\n        env?: { cwd?: string | undefined; branch?: string | undefined },\n      ) => Promise<void>)\n    | undefined;\n  /**\n   * Optional merge-conflict resolver. Called when a phase worktree conflicts\n   * during squash-merge into the base branch. `info.cwd` points to the base\n   * working tree where conflict markers exist; the resolver should clean those\n   * markers and return `true`. On success the merge is committed; otherwise\n   * the merge is aborted and the worktree is kept in `needs-review`.\n   * If undefined, conflicts keep the old parked-for-review behavior.\n   */\n  resolveConflict?:\n    | ((\n        phase: PhaseNode,\n        info: { conflictFiles: string[]; cwd: string },\n      ) => Promise<boolean>)\n    | undefined;\n  /** Optional global Brain arbiter for the policy, decision, and escalation layer. */\n  brain?: BrainArbiter | undefined;\n  /** Called when a phase completes. */\n  onPhaseComplete?: ((phase: PhaseNode) => void) | undefined;\n  /** Called when a phase fails. */\n  onPhaseFail?: ((phase: PhaseNode, error: Error) => void) | undefined;\n  /** Called on every tick in autonomous mode. */\n  onTick?: ((ctx: { activePhases: PhaseNode[]; readyPhases: PhaseNode[] }) => void) | undefined;\n}\n\n// \u2500\u2500\u2500 Goal Options \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface GoalOptions {\n  /** Maximum number of parallel phases. */\n  maxConcurrentPhases?: number | undefined;\n  /** Maximum number of parallel tasks within a phase. */\n  maxConcurrentTasks?: number | undefined;\n  /** Retry count for failed tasks. */\n  maxRetries?: number | undefined;\n  /**\n   * Maximum number of repair attempts after the verification gate fails.\n   * Total verification runs = maxVerifyAttempts + 1: the first run plus one\n   * rerun after each repair. Defaults to 2. Has no effect without `verifyPhase`.\n   */\n  maxVerifyAttempts?: number | undefined;\n  /** Autonomous mode: automatically advance as phases complete. */\n  autonomous?: boolean | undefined;\n  /** Delay between phases in milliseconds. */\n  phaseDelayMs?: number | undefined;\n  /** Stop when a phase fails. */\n  stopOnFailure?: boolean | undefined;\n  /**\n   * Per-task timeout in milliseconds. A single task exceeding this\n   * is marked failed and `phase.taskTimedOut` is emitted.\n   * Defaults to 600_000 (10 min). Set to 0 to disable.\n   */\n  taskTimeoutMs?: number | undefined;\n  /** Event bus */\n  events?: import('../kernel/events.js').EventBus | undefined;\n  /**\n   * Optional git-worktree manager. When provided, each phase runs in its own\n   * isolated worktree and branch, then is squash-merged back into the base\n   * branch in order. Without it, behavior is unchanged and uses the shared working tree.\n   */\n  worktrees?: import('../worktree/worktree-manager.js').WorktreeManager | undefined;\n}\n\n// \u2500\u2500\u2500 Phase Filter / Sort \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseFilter {\n  status?: PhaseStatus[] | undefined;\n  priority?: PhaseNode['priority'][] | undefined;\n}\n\nexport interface PhaseSort {\n  field: 'priority' | 'createdAt' | 'startedAt' | 'completedAt';\n  direction: 'asc' | 'desc';\n}\n\n// \u2500\u2500\u2500 Phase Template \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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 interface PhaseTemplate {\n  name: string;\n  description: string;\n  priority: PhaseNode['priority'];\n  estimateHours: number;\n  parallelizable: boolean;\n  /** Task templates to create automatically. */\n  taskTemplates?: Array<{\n    title: string;\n    description: string;\n    type: import('../types/task-graph.js').TaskType;\n    priority: import('../types/task-graph.js').TaskPriority;\n    estimateHours: number;\n    tags?: string[] | undefined;\n  }>;\n}\n", "import * as fsp from 'node:fs/promises';\nimport * as path from 'node:path';\nimport type { TaskEdge, TaskGraph, TaskNode } from '../types/task-graph.js';\nimport { atomicWrite, withFileLock } from '../utils/atomic-write.js';\nimport type { PhaseGraph, PhaseNode } from './types.js';\n\nexport interface PhaseStoreOptions {\n  baseDir: string;\n  /** Previous directories read and migrated into baseDir on load/list. */\n  legacyBaseDirs?: string[] | undefined;\n}\n\n/** Current schema version for SerializedPhaseGraph. Increment on breaking changes. */\nconst PHASE_STORE_VERSION = 1;\n\ninterface SerializedPhaseGraph {\n  /** Schema version for forward-compatibility. Missing/0 means pre-v1. */\n  version: number;\n  id: string;\n  title: string;\n  description: string;\n  phases: SerializedPhaseNode[];\n  rootPhaseIds: string[];\n  activePhaseIds: string[];\n  completedPhaseIds: string[];\n  failedPhaseIds: string[];\n  autonomous: boolean;\n  stopOnComplete: boolean;\n  createdAt: number;\n  updatedAt: number;\n  startedAt?: number | undefined;\n  completedAt?: number | undefined;\n}\n\ninterface SerializedPhaseNode {\n  id: string;\n  name: string;\n  description: string;\n  status: PhaseNode['status'];\n  taskGraph: SerializedTaskGraph;\n  dependsOn: string[];\n  nextPhases: string[];\n  parallelizable: boolean;\n  priority: PhaseNode['priority'];\n  estimateHours: number;\n  actualDurationMs?: number | undefined;\n  startedAt?: number | undefined;\n  completedAt?: number | undefined;\n  assignedAgents: string[];\n  metadata?: Record<string, unknown> | undefined;\n  createdAt: number;\n  updatedAt: number;\n}\n\ninterface SerializedTaskGraph {\n  id: string;\n  specId: string;\n  title: string;\n  nodes: SerializedTaskNode[];\n  edges: TaskEdge[];\n  rootNodes: string[];\n  createdAt: number;\n  updatedAt: number;\n}\n\ninterface SerializedTaskNode {\n  id: string;\n  title: string;\n  description: string;\n  type: TaskNode['type'];\n  priority: TaskNode['priority'];\n  status: TaskNode['status'];\n  assignee?: string | undefined;\n  estimateHours?: number | undefined;\n  actualHours?: number | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n  parentId?: string | undefined;\n  children?: string[] | undefined;\n  createdAt: number;\n  updatedAt: number;\n  startedAt?: number | undefined;\n  completedAt?: number | undefined;\n  metadata?: Record<string, unknown> | undefined;\n}\n\n/**\n * PhaseStore - persistence layer for saving and loading PhaseGraph objects on disk.\n */\nexport class PhaseStore {\n  readonly baseDir: string;\n  private readonly legacyBaseDirs: string[];\n\n  constructor(opts: PhaseStoreOptions) {\n    this.baseDir = opts.baseDir;\n    this.legacyBaseDirs = (opts.legacyBaseDirs ?? []).filter(\n      (dir) => path.resolve(dir) !== path.resolve(this.baseDir),\n    );\n  }\n\n  async save(graph: PhaseGraph): Promise<void> {\n    const filePath = this.getFilePath(graph.id);\n    const serialized = this.serializeGraph(graph);\n\n    await withFileLock(filePath, async () => {\n      await atomicWrite(filePath, JSON.stringify(serialized, null, 2), { mode: 0o600 });\n    });\n  }\n\n  async load(graphId: string): Promise<PhaseGraph | null> {\n    const filePath = this.getFilePath(graphId);\n    const current = await this.loadFromPath(filePath);\n    if (current) return current;\n    for (const legacyDir of this.legacyBaseDirs) {\n      const legacyPath = path.join(legacyDir, `${graphId}.json`);\n      const legacy = await this.loadFromPath(legacyPath);\n      if (!legacy) continue;\n      try {\n        await this.save(legacy);\n        await this.removeMigratedLegacyFile(legacyDir, legacyPath);\n      } catch {\n        return null;\n      }\n      return legacy;\n    }\n    return null;\n  }\n\n  async delete(graphId: string): Promise<void> {\n    const paths = [\n      this.getFilePath(graphId),\n      ...this.legacyBaseDirs.map((dir) => path.join(dir, `${graphId}.json`)),\n    ];\n    await Promise.all(paths.map((filePath) => fsp.unlink(filePath).catch(() => undefined)));\n  }\n\n  async list(): Promise<Array<{ id: string; title: string; updatedAt: number; status: string }>> {\n    try {\n      await this.migrateLegacyGraphs();\n      const entries = await fsp.readdir(this.baseDir, { withFileTypes: true });\n      const graphs: Array<{ id: string; title: string; updatedAt: number; status: string }> = [];\n\n      for (const entry of entries) {\n        if (!entry.isFile() || !entry.name.endsWith('.json')) continue;\n        try {\n          const raw = await fsp.readFile(path.join(this.baseDir, entry.name), 'utf8');\n          const serialized = JSON.parse(raw) as SerializedPhaseGraph;\n          const done = serialized.completedPhaseIds.length;\n          const total = serialized.phases.length;\n          graphs.push({\n            id: serialized.id,\n            title: serialized.title,\n            updatedAt: serialized.updatedAt,\n            status: done === total ? 'completed' : done > 0 ? 'in_progress' : 'pending',\n          });\n        } catch {\n          // Skip invalid files\n        }\n      }\n\n      return graphs.sort((a, b) => b.updatedAt - a.updatedAt);\n    } catch {\n      return [];\n    }\n  }\n\n  private getFilePath(graphId: string): string {\n    return path.join(this.baseDir, `${graphId}.json`);\n  }\n\n  private async loadFromPath(filePath: string): Promise<PhaseGraph | null> {\n    try {\n      const raw = await fsp.readFile(filePath, 'utf8');\n      const serialized = JSON.parse(raw) as SerializedPhaseGraph;\n      return this.deserializeGraph(serialized);\n    } catch {\n      return null;\n    }\n  }\n\n  private async migrateLegacyGraphs(): Promise<void> {\n    for (const legacyDir of this.legacyBaseDirs) {\n      const entries = await fsp.readdir(legacyDir, { withFileTypes: true }).catch(() => []);\n      for (const entry of entries) {\n        if (!entry.isFile() || !entry.name.endsWith('.json')) continue;\n        const legacyPath = path.join(legacyDir, entry.name);\n        const currentPath = this.getFilePath(path.basename(entry.name, '.json'));\n        if (await this.pathExists(currentPath)) {\n          await this.removeMigratedLegacyFile(legacyDir, legacyPath);\n          continue;\n        }\n        const graph = await this.loadFromPath(legacyPath);\n        if (!graph) continue;\n        await this.save(graph);\n        await this.removeMigratedLegacyFile(legacyDir, legacyPath);\n      }\n    }\n  }\n\n  private async pathExists(filePath: string): Promise<boolean> {\n    try {\n      await fsp.access(filePath);\n      return true;\n    } catch {\n      return false;\n    }\n  }\n\n  private async removeMigratedLegacyFile(legacyDir: string, legacyPath: string): Promise<void> {\n    await fsp.unlink(legacyPath).catch(() => undefined);\n    await fsp.rmdir(legacyDir).catch(() => undefined);\n  }\n\n  private serializeGraph(graph: PhaseGraph): SerializedPhaseGraph {\n    return {\n      version: PHASE_STORE_VERSION,\n      id: graph.id,\n      title: graph.title,\n      description: graph.description,\n      phases: Array.from(graph.phases.values()).map((p) => this.serializePhase(p)),\n      rootPhaseIds: graph.rootPhaseIds,\n      activePhaseIds: graph.activePhaseIds,\n      completedPhaseIds: graph.completedPhaseIds,\n      failedPhaseIds: graph.failedPhaseIds,\n      autonomous: graph.autonomous,\n      stopOnComplete: graph.stopOnComplete,\n      createdAt: graph.createdAt,\n      updatedAt: graph.updatedAt,\n      startedAt: graph.startedAt,\n      completedAt: graph.completedAt,\n    };\n  }\n\n  private serializePhase(phase: PhaseNode): SerializedPhaseNode {\n    return {\n      id: phase.id,\n      name: phase.name,\n      description: phase.description,\n      status: phase.status,\n      taskGraph: this.serializeTaskGraph(phase.taskGraph),\n      dependsOn: phase.dependsOn,\n      nextPhases: phase.nextPhases,\n      parallelizable: phase.parallelizable,\n      priority: phase.priority,\n      estimateHours: phase.estimateHours,\n      actualDurationMs: phase.actualDurationMs,\n      startedAt: phase.startedAt,\n      completedAt: phase.completedAt,\n      assignedAgents: phase.assignedAgents,\n      metadata: phase.metadata,\n      createdAt: phase.createdAt,\n      updatedAt: phase.updatedAt,\n    };\n  }\n\n  private serializeTaskGraph(graph: TaskGraph): SerializedTaskGraph {\n    return {\n      id: graph.id,\n      specId: graph.specId,\n      title: graph.title,\n      nodes: Array.from(graph.nodes.values()).map((n) => this.serializeTaskNode(n)),\n      edges: graph.edges,\n      rootNodes: graph.rootNodes,\n      createdAt: graph.createdAt,\n      updatedAt: graph.updatedAt,\n    };\n  }\n\n  private serializeTaskNode(node: TaskNode): SerializedTaskNode {\n    return { ...node };\n  }\n\n  private deserializeGraph(serialized: SerializedPhaseGraph): PhaseGraph {\n    // Validate schema version for forward-compatibility.\n    const fileVersion = serialized.version ?? 0;\n    if (fileVersion > PHASE_STORE_VERSION) {\n      throw new Error(\n        `Cannot load phase graph: file version ${fileVersion} is newer than ` +\n          `supported version ${PHASE_STORE_VERSION}. Upgrade WrongStack to load this file.`,\n      );\n    }\n    // Future: add per-version migration logic here when fileVersion < PHASE_STORE_VERSION.\n    const phases = new Map<string, PhaseNode>();\n    for (const sp of serialized.phases) {\n      phases.set(sp.id, this.deserializePhase(sp));\n    }\n\n    return {\n      id: serialized.id,\n      title: serialized.title,\n      description: serialized.description,\n      phases,\n      rootPhaseIds: serialized.rootPhaseIds,\n      activePhaseIds: serialized.activePhaseIds,\n      completedPhaseIds: serialized.completedPhaseIds,\n      failedPhaseIds: serialized.failedPhaseIds,\n      autonomous: serialized.autonomous,\n      stopOnComplete: serialized.stopOnComplete,\n      createdAt: serialized.createdAt,\n      updatedAt: serialized.updatedAt,\n      startedAt: serialized.startedAt,\n      completedAt: serialized.completedAt,\n    };\n  }\n\n  private deserializePhase(serialized: SerializedPhaseNode): PhaseNode {\n    return {\n      id: serialized.id,\n      name: serialized.name,\n      description: serialized.description,\n      status: serialized.status,\n      taskGraph: this.deserializeTaskGraph(serialized.taskGraph),\n      dependsOn: serialized.dependsOn,\n      nextPhases: serialized.nextPhases,\n      parallelizable: serialized.parallelizable,\n      priority: serialized.priority,\n      estimateHours: serialized.estimateHours,\n      actualDurationMs: serialized.actualDurationMs,\n      startedAt: serialized.startedAt,\n      completedAt: serialized.completedAt,\n      assignedAgents: serialized.assignedAgents,\n      metadata: serialized.metadata,\n      createdAt: serialized.createdAt,\n      updatedAt: serialized.updatedAt,\n    };\n  }\n\n  private deserializeTaskGraph(serialized: SerializedTaskGraph): TaskGraph {\n    const nodes = new Map<string, TaskNode>();\n    for (const sn of serialized.nodes) {\n      nodes.set(sn.id, sn as TaskNode);\n    }\n\n    return {\n      id: serialized.id,\n      specId: serialized.specId,\n      title: serialized.title,\n      nodes,\n      edges: serialized.edges ?? [],\n      rootNodes: serialized.rootNodes ?? [],\n      createdAt: serialized.createdAt,\n      updatedAt: serialized.updatedAt,\n    };\n  }\n}\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 * as fsp from 'node:fs/promises';\nimport type { EventBus } from '../kernel/events.js';\nimport { atomicWrite, withFileLock } from '../utils/atomic-write.js';\nimport { toErrorMessage } from '../utils/error.js';\nimport { color } from '../utils/color.js';\nimport { resolveWstackPaths } from '../utils/wstack-paths.js';\nimport { FsError, ERROR_CODES } from '../types/errors.js';\n\n/**\n * Long-running autonomous mission. A goal survives across sessions and\n * drives the EternalAutonomyEngine \u2014 every iteration of the engine\n * consults the goal to choose what to do next.\n *\n * Storage: `~/.wrongstack/projects/<hash>/goal.json`. Persistent and\n * project-scoped on purpose: the goal belongs to the codebase, not the\n * REPL session.\n */\n\nexport interface JournalEntry {\n  /** ISO timestamp of the iteration. */\n  at: string;\n  /** Sequential iteration counter (1-based, monotonically increasing). */\n  iteration: number;\n  /** Source that produced the action ('todo' | 'git' | 'brainstorm' | 'resume' | 'manual' | 'parallel' | 'deliverable'). */\n  source: 'todo' | 'git' | 'brainstorm' | 'resume' | 'manual' | 'parallel' | 'deliverable';\n  /** Short one-line description of what the iteration set out to do. */\n  task: string;\n  /** Outcome status. */\n  status: 'success' | 'failure' | 'aborted' | 'skipped';\n  /** Optional free-form note (error message, summary, etc.). */\n  note?: string | undefined;\n  /** Optional token usage delta for this iteration. */\n  tokens?: { input: number; output: number } | undefined;\n  /** Optional USD cost delta for this iteration (provider-estimated). */\n  costUsd?: number | undefined;\n}\n\nexport interface GoalFile {\n  version: 1;\n  /** The raw mission statement as entered by the user. */\n  goal: string;\n  /**\n   * LLM-refined version of the goal \u2014 unambiguous, with concrete\n   * deliverables and acceptance criteria.\n   */\n  refinedGoal?: string | undefined;\n  /**\n   * Concrete, verifiable deliverables extracted from the refined goal.\n   */\n  deliverables?: string[] | undefined;\n  /**\n   * Estimated completion 0-100. Updated by the engine after each\n   * iteration. Null means \"not yet assessed\".\n   */\n  progress?: number | undefined;\n  /** Human-readable note explaining the current progress estimate. */\n  progressNote?: string | undefined;\n  /**\n   * Time-series of progress measurements for trend analysis.\n   * Last 200 entries retained. Use `recordProgress()` to append.\n   */\n  progressHistory?: ProgressSnapshot[] | undefined;\n  /**\n   * Computed trend from recent progress measurements.\n   * 'accelerating' | 'steady' | 'stalling' | undefined.\n   */\n  progressTrend?: 'accelerating' | 'steady' | 'stalling' | undefined;\n  /** When the goal was first set or last replaced. */\n  setAt: string;\n  /** Updated on every iteration completion. */\n  lastActivityAt: string;\n  /** Total iterations the engine has run against this goal (cumulative). */\n  iterations: number;\n  /** Engine lifecycle state \u2014 'running' means another process owns this goal. */\n  engineState: 'idle' | 'running' | 'stopped';\n  /** Mission-level lifecycle. */\n  goalState?: 'active' | 'paused' | 'completed' | 'abandoned' | undefined;\n  /** Goal-linked Kanban board id. Optional for pre-Kanban goal files. */\n  kanbanBoardId?: string | undefined;\n  /** ISO timestamp recorded after Brain verifies that every deliverable is reached. */\n  reachedAt?: string | undefined;\n  /** Durable human-readable reach verdict; currently the literal `goal reached`. */\n  reachedNote?: string | undefined;\n  /**\n   * Per-todo attempt counter.\n   */\n  todoAttempts?: Record<string, number>;\n  /** Bounded ring buffer of recent iterations (newest last). */\n  journal: JournalEntry[];\n}\n\n/** Cap on persisted journal entries \u2014 older entries are evicted FIFO. */\nexport const MAX_JOURNAL_ENTRIES = 500;\n\n/**\n * Resolve the goal file path for a given project root.\n *\n * SINGLE canonical location: the per-project directory that\n * `resolveWstackPaths()` uses for everything else (sessions, memory, specs) \u2014\n * `~/.wrongstack/projects/<slug>/goal.json`. This is the same path the `/goal`\n * slash command writes via `opts.paths.projectGoal`, so every reader/writer\n * (the eternal/parallel autonomy engines, the CLI autonomy commands, the TUI\n * F9 panel, and `/goal` itself) now agree on one file.\n *\n * Previously this returned a SEPARATE hash-based dir (`projects/<hash>/`), which\n * disagreed with `/goal` and littered the home dir with thousands of stray\n * `<hash>/goal.json` directories that held nothing else.\n */\nexport function goalFilePath(projectRoot: string): string {\n  return resolveWstackPaths({ projectRoot }).projectGoal;\n}\n\nexport async function loadGoal(\n  filePath: string,\n  events?: EventBus,\n  warn?: (msg: string) => void,\n): Promise<GoalFile | null> {\n  const t0 = Date.now();\n  let raw: string;\n  try {\n    raw = await fsp.readFile(filePath, 'utf8');\n  } catch (err) {\n    const code = (err as NodeJS.ErrnoException).code;\n    if (code === 'ENOENT') {\n      events?.emit('storage.read', {\n        sessionId: '~boot~',\n        store: 'goal',\n        filePath,\n        operation: 'load',\n        outcome: 'success',\n        durationMs: Date.now() - t0,\n      });\n      return null; // file doesn't exist \u2014 not an error\n    }\n    events?.emit('storage.error', {\n      sessionId: '~boot~',\n      store: 'goal',\n      filePath,\n      operation: 'load',\n      error: toErrorMessage(err),\n      recoverable: false,\n    });\n    throw err; // permission errors etc. should surface\n  }\n  try {\n    const parsed = JSON.parse(raw) as GoalFile;\n    if (parsed?.version !== 1 || typeof parsed.goal !== 'string' || !Array.isArray(parsed.journal)) {\n      (warn ?? ((msg) => console.warn(JSON.stringify({ level: 'warn', event: 'goal_store.invalid_schema', path: filePath, message: msg, timestamp: new Date().toISOString() }))))(\n        'invalid schema \u2014 consider deleting and re-creating',\n      );\n      events?.emit('storage.read', {\n        sessionId: '~boot~',\n        store: 'goal',\n        filePath,\n        operation: 'load',\n        outcome: 'failure',\n        durationMs: Date.now() - t0,\n        error: 'invalid_schema',\n      });\n      return null;\n    }\n    events?.emit('storage.read', {\n      sessionId: '~boot~',\n      store: 'goal',\n      filePath,\n      operation: 'load',\n      outcome: 'success',\n      durationMs: Date.now() - t0,\n    });\n    return parsed;\n  } catch {\n    (warn ?? ((msg) => console.warn(JSON.stringify({ level: 'warn', event: 'goal_store.parse_failed', path: filePath, message: msg, timestamp: new Date().toISOString() }))))(\n      'JSON parse failed \u2014 consider deleting and re-creating',\n    );\n    events?.emit('storage.read', {\n      sessionId: '~boot~',\n      store: 'goal',\n      filePath,\n      operation: 'load',\n      outcome: 'failure',\n      durationMs: Date.now() - t0,\n      error: 'parse_failed',\n    });\n    return null;\n  }\n}\n\nexport async function saveGoal(filePath: string, goal: GoalFile, events?: EventBus): Promise<void> {\n  const t0 = Date.now();\n  try {\n    await atomicWrite(filePath, JSON.stringify(goal, null, 2), { mode: 0o600 });\n    events?.emit('storage.write', {\n      sessionId: '~boot~',\n      store: 'goal',\n      filePath,\n      operation: 'save',\n      outcome: 'success',\n      durationMs: Date.now() - t0,\n    });\n  } catch (err) {\n    events?.emit('storage.error', {\n      sessionId: '~boot~',\n      store: 'goal',\n      filePath,\n      operation: 'save',\n      error: toErrorMessage(err),\n      recoverable: false,\n    });\n    throw new FsError({\n      message: toErrorMessage(err),\n      code: ERROR_CODES.FS_ATOMIC_WRITE_FAILED,\n      path: filePath,\n      cause: err,\n    });\n  }\n}\n\n/**\n * Atomically load, modify, and save a goal file under a file lock.\n * Prevents lost-update races when the autonomy engine and CLI /goal commands\n * write concurrently (both eternal and parallel engines may run simultaneously).\n *\n * `fn` receives the current GoalFile (or `null` if no goal exists yet)\n * and must return the updated GoalFile (or `null` to delete).\n */\nexport async function updateGoal(\n  filePath: string,\n  fn: (current: GoalFile | null) => GoalFile | null,\n  events?: EventBus,\n): Promise<void> {\n  const t0 = Date.now();\n  await withFileLock(filePath, async () => {\n    const current = await loadGoal(filePath, events);\n    const next = fn(current);\n    if (next) {\n      await saveGoal(filePath, next, events);\n    } else {\n      try {\n        await fsp.unlink(filePath);\n        events?.emit('storage.write', {\n          sessionId: '~boot~',\n          store: 'goal',\n          filePath,\n          operation: 'delete',\n          outcome: 'success',\n          durationMs: Date.now() - t0,\n        });\n      } catch (err) {\n        events?.emit('storage.error', {\n          sessionId: '~boot~',\n          store: 'goal',\n          filePath,\n          operation: 'delete',\n          error: toErrorMessage(err),\n          recoverable: true,\n        });\n        // best-effort \u2014 file may not exist\n      }\n    }\n    events?.emit('storage.write', {\n      sessionId: '~boot~',\n      store: 'goal',\n      filePath,\n      operation: 'update',\n      outcome: 'success',\n      durationMs: Date.now() - t0,\n    });\n  });\n}\n\nexport function emptyGoal(goal: string): GoalFile {\n  const now = new Date().toISOString();\n  return {\n    version: 1,\n    goal,\n    setAt: now,\n    lastActivityAt: now,\n    iterations: 0,\n    engineState: 'idle',\n    goalState: 'active',\n    todoAttempts: {},\n    journal: [],\n  };\n}\n\n/**\n * Set progress estimate on a goal. Returns a new GoalFile.\n * Clamps progress to 0-100.\n */\nexport function setProgress(\n  goal: GoalFile,\n  progress: number,\n  note?: string,\n): GoalFile {\n  const clamped = Math.min(100, Math.max(0, progress));\n  return {\n    ...goal,\n    progress: clamped,\n    progressNote: note ?? clamped + '% complete',\n  };\n}\n\n/**\n * Append a journal entry, bumping iteration counters and trimming the\n * ring buffer. Returns a new GoalFile \u2014 does not mutate the argument.\n */\nexport function appendJournal(goal: GoalFile, entry: Omit<JournalEntry, 'iteration' | 'at'>): GoalFile {\n  const iteration = goal.iterations + 1;\n  const at = new Date().toISOString();\n  const full: JournalEntry = { ...entry, iteration, at };\n  const journal = [...goal.journal, full];\n  const trimmed = journal.length > MAX_JOURNAL_ENTRIES\n    ? journal.slice(journal.length - MAX_JOURNAL_ENTRIES)\n    : journal;\n  return {\n    ...goal,\n    iterations: iteration,\n    lastActivityAt: at,\n    journal: trimmed,\n  };\n}\n\n/**\n * Aggregate cumulative cost + tokens across all journal entries.\n */\nexport function summarizeUsage(goal: GoalFile): {\n  totalCostUsd: number;\n  totalInputTokens: number;\n  totalOutputTokens: number;\n  iterationsWithUsage: number;\n} {\n  let totalCostUsd = 0;\n  let totalInputTokens = 0;\n  let totalOutputTokens = 0;\n  let iterationsWithUsage = 0;\n  for (const e of goal.journal) {\n    if (typeof e.costUsd === 'number') totalCostUsd += e.costUsd;\n    if (e.tokens) {\n      totalInputTokens += e.tokens.input;\n      totalOutputTokens += e.tokens.output;\n    }\n    if (typeof e.costUsd === 'number' || e.tokens) iterationsWithUsage++;\n  }\n  return { totalCostUsd, totalInputTokens, totalOutputTokens, iterationsWithUsage };\n}\n\nconst DOLLAR = '\\u0024';\n\n/** Format the goal + recent journal as a human-readable status block. */\nexport function formatGoal(goal: GoalFile, journalLimit = 10): string {\n  const lines: string[] = [];\n\n  // Header \u2014 show refined goal, with original as annotation if different\n  const displayGoal = goal.refinedGoal || goal.goal;\n  lines.push(color.bold('Goal') + ': ' + displayGoal);\n  if (goal.refinedGoal && goal.refinedGoal !== goal.goal) {\n    const snippet = goal.goal.length > 60 ? goal.goal.slice(0, 60) + '\u2026' : goal.goal;\n    lines.push(color.dim('  (original: \"' + snippet + '\")'));\n  }\n\n  // Progress bar (20-segment)\n  if (typeof goal.progress === 'number') {\n    const pct = Math.min(100, Math.max(0, Math.round(goal.progress)));\n    const filled = Math.round(pct / 5);\n    const empty = 20 - filled;\n    const bar = color.green('\u2588'.repeat(filled)) + color.dim('\u2591'.repeat(empty));\n    lines.push('Progress: ' + bar + ' ' + color.bold(pct + '%'));\n    if (goal.progressNote) {\n      lines.push('  ' + color.dim(goal.progressNote));\n    }\n    // Trend indicator\n    if (goal.progressTrend) {\n      const trendIcon = goal.progressTrend === 'accelerating' ? '\uD83D\uDE80'\n        : goal.progressTrend === 'stalling' ? '\u26A0\uFE0F'\n        : '\u27A1\uFE0F';\n      lines.push('  Trend: ' + trendIcon + ' ' + goal.progressTrend);\n    }\n  }\n\n  // Deliverables checklist\n  if (goal.deliverables && goal.deliverables.length > 0) {\n    lines.push('');\n    lines.push(color.bold('Deliverables:'));\n    for (const d of goal.deliverables) {\n      const done = /^\\[[x\u2713]\\]|\u2705|\\(done\\)/i.test(d);\n      const marker = done ? color.green('\u2713') : color.dim('\u25CB');\n      lines.push('  ' + marker + ' ' + d);\n    }\n  }\n\n  lines.push('');\n  lines.push('Set: ' + goal.setAt);\n  lines.push('Last activity: ' + goal.lastActivityAt);\n  lines.push('Iterations: ' + goal.iterations);\n  const stateLabel = goal.goalState ?? 'active';\n  lines.push('State: ' + stateLabel + (goal.iterations > 0 ? ' (iteration #' + goal.iterations + ')' : ''));\n  lines.push('Engine: ' + goal.engineState);\n  const usage = summarizeUsage(goal);\n  if (usage.iterationsWithUsage > 0) {\n    const spent = 'Spent: ' + DOLLAR + usage.totalCostUsd.toFixed(4)\n      + '  (in ' + usage.totalInputTokens + ' / out ' + usage.totalOutputTokens\n      + ' tokens across ' + usage.iterationsWithUsage + ' iterations)';\n    lines.push(spent);\n  }\n  if (goal.journal.length > 0) {\n    lines.push('');\n    lines.push('Recent journal (last ' + Math.min(journalLimit, goal.journal.length) + '):');\n    const tail = goal.journal.slice(-journalLimit);\n    for (const e of tail) {\n      const mark = e.status === 'success' ? '\u2713' : e.status === 'failure' ? '\u2717' : e.status === 'aborted' ? '\u2298' : '\u00B7';\n      const note = e.note ? ' \u2014 ' + e.note : '';\n      const cost = typeof e.costUsd === 'number' ? ' (' + DOLLAR + e.costUsd.toFixed(4) + ')' : '';\n      lines.push('  #' + e.iteration + ' ' + mark + ' [' + e.source + '] ' + e.task + cost + note);\n    }\n  }\n  return lines.join('\\n');\n}\n\n/** A single progress measurement at a point in time. */\nexport interface ProgressSnapshot {\n  at: string;\n  progress: number;\n  note?: string | undefined;\n}\n\n/**\n * Parse [PROGRESS: N%] from agent final text.\n * Supports formats:\n *   [PROGRESS: 45%]\n *   [PROGRESS: 45%] \u2014 3/5 deliverables done\n *   [progress: 100%]\n * Returns null if no match.\n */\nexport function parseProgressFromText(text: string): { progress: number; note?: string } | null {\n  const re = /\\[progress:\\s*(\\d{1,3})%\\]\\s*(?:[\u2014-]\\s*(.+))?/i;\n  const m = text.match(re);\n  if (!m) return null;\n  // Regex match guarantees capture group 1 exists, but use ?? fallback to\n  // satisfy noUncheckedIndexedAccess without a non-null assertion.\n  const progress = Math.min(100, Math.max(0, Number.parseInt(m[1] ?? '0', 10)));\n  const note = m[2]?.trim() || undefined;\n  return note === undefined ? { progress } : { progress, note };\n}\n\n/**\n * Record a progress measurement. Returns a new GoalFile with:\n * - progress + progressNote updated\n * - progressHistory appended (last 200 entries kept)\n * - progress trend computed (accelerating/steady/stalling)\n */\nexport function recordProgress(\n  goal: GoalFile,\n  progress: number,\n  note?: string,\n): GoalFile {\n  const clamped = Math.min(100, Math.max(0, progress));\n  const history = [...(goal.progressHistory ?? []), { at: new Date().toISOString(), progress: clamped, note }];\n  // Keep last 200 snapshots\n  const trimmed = history.length > 200 ? history.slice(-200) : history;\n\n  return {\n    ...goal,\n    progress: clamped,\n    progressNote: note ?? `${clamped}% complete`,\n    progressHistory: trimmed,\n    progressTrend: computeTrend(trimmed),\n  };\n}\n\n/** Max progress history entries to retain. */\nexport const MAX_PROGRESS_HISTORY = 200;\n\nfunction computeTrend(history: ProgressSnapshot[]): 'accelerating' | 'steady' | 'stalling' | undefined {\n  if (history.length < 3) return undefined;\n  const recent = history.slice(-5);\n  const deltas: number[] = [];\n  for (let i = 1; i < recent.length; i++) {\n    deltas.push((recent[i]?.progress ?? 0) - (recent[i - 1]?.progress ?? 0));\n  }\n  /* v8 ignore next -- unreachable: history.length>=3 guard above guarantees >=2 deltas */\n  if (deltas.length < 2) return undefined;\n  const avgDelta = deltas.reduce((a, b) => a + b, 0) / deltas.length;\n  if (avgDelta > 2) return 'accelerating';\n  if (avgDelta < -1) return 'stalling';\n  return 'steady';\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';\n\n/**\n * Path layout. All developer-level state lives in ~/.wrongstack/.\n * Per-project state is keyed by the canonical project root under\n * ~/.wrongstack/projects/<slug>/. Linked Git worktrees resolve to their main\n * checkout so coordination and durable state are shared across worktrees.\n *\n * The ONLY thing inside the project tree is the optional\n * .wrongstack/AGENTS.md (committed) and .wrongstack/skills/ (committed).\n */\n\nexport interface WstackPaths {\n  /** ~/.wrongstack \u2014 global root. */\n  globalRoot: string;\n  /** Active profile name resolved from the bootstrap config. */\n  profileName: string;\n  /** ~/.wrongstack/profiles/<activeProfile> \u2014 active user-profile root. */\n  profileDir: string;\n  /** Absolute project root. */\n  projectRoot: string;\n  /** Home directory (~) \u2014 base for foreign tool state (~/.codex, ~/.agents, \u2026). */\n  homeDir: string;\n  /**\n   * ~/.wrongstack/profiles/<activeProfile> \u2014 directory for profile-scoped\n   * user state (mode.json, statusline.json, custom-context-modes.json, \u2026).\n   */\n  configDir: string;\n  /** ~/.wrongstack/config.json \u2014 bootstrap config (activeProfile + version). */\n  globalConfig: string;\n  /**\n   * ~/.wrongstack/profiles \u2014 directory containing per-profile configs.\n   * Each profile has its own subdirectory with a config.json.\n   */\n  profilesDir: string;\n  /**\n   * Resolve the config path for a named profile.\n   * Returns ~/.wrongstack/profiles/<name>/config.json.\n   */\n  profileConfig: (name: string) => string;\n  /** Resolve ~/.wrongstack/profiles/<name>/statusline.json */\n  profileStatuslineConfig: (name: string) => string;\n  /** Resolve ~/.wrongstack/profiles/<name>/mode.json */\n  profileModeConfig: (name: string) => string;\n  /** Resolve ~/.wrongstack/profiles/<name>/provider-status.json */\n  profileProviderStatus: (name: string) => string;\n  /** Resolve ~/.wrongstack/profiles/<name>/update-cache.json */\n  profileUpdateCache: (name: string) => string;\n  /** ~/.wrongstack/.key \u2014 32 random bytes, mode 0600, AES-GCM key for the secret vault. */\n  secretsKey: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/memory.md \u2014 profile memory. */\n  globalMemory: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/skills \u2014 profile skills. */\n  globalSkills: string;\n  /** ~/.claude/skills \u2014 user-global skills from foreign coding agents (Claude Code, Codex, \u2026). Read-only. */\n  globalClaudeSkills: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/design-kits \u2014 profile Design Studio kits. */\n  globalDesignKits: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/prompts \u2014 profile prompt library. */\n  globalPrompts: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/instructions \u2014 profile instruction overrides. */\n  globalInstructions: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/prompt-usage.json \u2014 prompt usage. */\n  promptUsage: string;\n  /** ~/.wrongstack/cache \u2014 fetched data (models.dev, etc.). */\n  cacheDir: string;\n  /** ~/.wrongstack/cache/models.dev.json */\n  modelsCache: string;\n  /** ~/.wrongstack/cache/models-overlay.json \u2014 cached curated overlay. */\n  modelsOverlayCache: string;\n  /**\n   * Per-project codebase symbol index (SQLite). Lives under the global project\n   * dir \u2014 NOT inside the repo \u2014 so it never clutters the working tree or needs\n   * gitignoring. `~/.wrongstack/projects/<hash>/codebase-index`.\n   */\n  projectCodebaseIndex: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/history \u2014 REPL line history. */\n  historyFile: string;\n  /** ~/.wrongstack/logs/wrongstack.log */\n  logFile: string;\n  /** ~/.wrongstack/projects/<hash> */\n  projectDir: string;\n  /** ~/.wrongstack/projects/<hash>/memory.md */\n  projectMemory: string;\n  /** ~/.wrongstack/projects/<hash>/sessions */\n  projectSessions: string;\n  /** ~/.wrongstack/projects/<hash>/trust.json */\n  projectTrust: string;\n  /** ~/.wrongstack/projects/<hash>/meta.json */\n  projectMeta: string;\n  /** ~/.wrongstack/projects/<hash>/config.local.json \u2014 optional override */\n  projectLocalConfig: string;\n  /** <project>/.wrongstack/config.json \u2014 per-project settings (safe fields only).\n   *  This lives inside the project root so it can be gitignored or shared. */\n  inProjectConfig: string;\n  /** <project>/.wrongstack/AGENTS.md \u2014 committed project memory. */\n  inProjectAgentsFile: string;\n  /** <project>/.wrongstack/skills \u2014 committed project skills. */\n  inProjectSkills: string;\n  /** <project>/.claude/skills \u2014 project skills authored for foreign coding agents (Claude Code, \u2026). Read-only. */\n  inProjectClaudeSkills: string;\n  /** <project>/.wrongstack/prompts \u2014 committed project prompt library. */\n  inProjectPrompts: string;\n  /** <project>/.wrongstack/instructions \u2014 committed project instruction overrides. */\n  inProjectInstructions: string;\n  /** <project>/.wrongstack/design-kits \u2014 committed project Design Studio kits. */\n  inProjectDesignKits: string;\n  /** <project>/.wrongstack/worktrees \u2014 git worktrees for per-phase isolation (gitignored). */\n  inProjectWorktrees: string;\n  /** Stable hash for the canonical project root (shared by linked Git worktrees). */\n  projectHash: string;\n  /** Human-readable canonical project slug, shared by linked Git worktrees. */\n  projectSlug: string;\n  /** ~/.wrongstack/projects/<hash>/goal.json \u2014 goal persistence */\n  projectGoal: string;\n  /** ~/.wrongstack/projects/<hash>/input-history.json \u2014 TUI prompt input history */\n  projectInputHistory: string;\n  /** ~/.wrongstack/projects/<hash>/specs \u2014 SDD spec files */\n  projectSpecs: string;\n  /** ~/.wrongstack/projects/<hash>/task-graphs \u2014 SDD task graphs */\n  projectTaskGraphs: string;\n  /** ~/.wrongstack/projects/<hash>/sdd-session.json \u2014 SDD session state */\n  projectSddSession: string;\n  /** ~/.wrongstack/projects/<hash>/plan.json \u2014 plan persistence */\n  projectPlan: string;\n  /** ~/.wrongstack/projects/<hash>/autophase \u2014 Goal phase-graph JSON files (dir name kept for backward compat) */\n  projectAutophase: string;\n  /** ~/.wrongstack/projects/<hash>/sdd-boards \u2014 live SDD board snapshots + JSONL event logs */\n  projectSddBoards: string;\n  /** ~/.wrongstack/profiles/<activeProfile>/sync.json \u2014 CloudSync configuration */\n  syncConfig: string;\n  /** ~/.wrongstack/config-history \u2014 timestamped backups on every config write */\n  configHistoryDir: string;\n  /** Function to get the status.json path for a project given its hash. */\n  projectStatus: (projectHash: string) => string;\n}\n\n/**\n * Resolve the stable project identity root used by global WrongStack state.\n *\n * A linked Git worktree has its own checkout path and a `.git` *file* that\n * points into `<main>/.git/worktrees/<name>`. Its `commondir` points back to\n * the main checkout's `.git` directory. Treating the linked checkout path as\n * the project identity would split one repository into multiple session,\n * registry, and mailbox directories \u2014 agents in different worktrees would be\n * unable to see or message each other.\n *\n * Project-local paths still use the caller's actual checkout. Only global\n * state identity is canonicalized. Non-Git projects, normal checkouts, Git\n * submodules, and separate-git-dir layouts keep their existing identity.\n */\nexport function canonicalProjectRoot(absRoot: string): string {\n  const checkoutRoot = path.resolve(absRoot);\n  const dotGit = path.join(checkoutRoot, '.git');\n\n  try {\n    if (!fs.statSync(dotGit).isFile()) return checkoutRoot;\n\n    const gitDirLine = fs.readFileSync(dotGit, 'utf8').trim();\n    const match = /^gitdir:\\s*(.+)$/i.exec(gitDirLine);\n    if (!match?.[1]) return checkoutRoot;\n\n    const gitDir = path.resolve(checkoutRoot, match[1].trim());\n    const commonDirFile = path.join(gitDir, 'commondir');\n    if (!fs.statSync(commonDirFile).isFile()) return checkoutRoot;\n\n    const commonDir = path.resolve(gitDir, fs.readFileSync(commonDirFile, 'utf8').trim());\n    // Linked worktrees created by Git share the main checkout's `.git` dir.\n    // A submodule or --separate-git-dir layout may point elsewhere; do not\n    // guess a working-tree root for those shapes.\n    if (path.basename(commonDir).toLowerCase() !== '.git') return checkoutRoot;\n    return path.dirname(commonDir);\n  } catch {\n    // Missing/malformed administrative files must never make path resolution\n    // fail. Falling back preserves the pre-canonicalization behavior.\n    return checkoutRoot;\n  }\n}\n\nexport function projectHash(absRoot: string): string {\n  return createHash('sha256').update(canonicalProjectRoot(absRoot)).digest('hex').slice(0, 12);\n}\n\n/**\n * Human-readable project directory name: slugified folder name + short hash\n * suffix for uniqueness.  e.g. `wrongstack-a1b2c3` instead of `3024e5e6fa58`.\n */\nexport function projectSlug(absRoot: string): string {\n  const identityRoot = canonicalProjectRoot(absRoot);\n  const base = slugify(path.basename(identityRoot));\n  const hash = createHash('sha256').update(identityRoot).digest('hex').slice(0, 6);\n  return `${base}-${hash}`;\n}\n\n/** Turn a folder name into a filesystem-safe lowercase slug. */\nfunction slugify(name: string): string {\n  return (\n    name\n      .toLowerCase()\n      // Collapse any run of non-alphanumeric chars into a single hyphen.\n      .replace(/[^a-z0-9]+/g, '-')\n      .replace(/^-+|-+$/g, '')\n      .slice(0, 40) || 'project'\n  );\n}\n\nexport interface WstackPathOptions {\n  userHome?: string | undefined;\n  projectRoot: string;\n  /** Override the global root (e.g. for tests). Default: `${userHome}/.wrongstack`. */\n  globalRoot?: string | undefined;\n  /** Explicit profile override. Otherwise read from the root bootstrap config. */\n  profileName?: string | undefined;\n}\n\n/** Make an untrusted profile name safe for use as one path segment. */\nexport function safeProfileName(name: string | undefined): string {\n  const safe = (name ?? '').replace(/[/\\\\:]/g, '_').replace(/\\.\\./g, '_').trim();\n  return safe || 'default';\n}\n\n/**\n * Resolve the selected profile from ~/.wrongstack/config.json. The root file\n * is bootstrap metadata only; a missing/corrupt bootstrap selects `default`.\n */\nexport function activeProfileName(globalRoot: string): string {\n  try {\n    const parsed = JSON.parse(fs.readFileSync(path.join(globalRoot, 'config.json'), 'utf8')) as {\n      activeProfile?: unknown;\n    };\n    return safeProfileName(typeof parsed.activeProfile === 'string' ? parsed.activeProfile : undefined);\n  } catch {\n    return 'default';\n  }\n}\n\n/**\n * The global `~/.wrongstack` root, honoring the `WRONGSTACK_HOME` env\n * override. The override exists so tests (and sandboxed runs) can redirect\n * ALL global state \u2014 config, secrets, logs, projects/, mailboxes \u2014 away from\n * the real user home. Before it existed, `pnpm test` booted runtimes against\n * the real `~/.wrongstack`: it read the user's real config.json (starting a\n * second live Telegram poller), appended to the real wrongstack.log, and left\n * ~20k orphaned fixture dirs under projects/.\n *\n * Every code path that wants the global dir must come through here (or\n * through `resolveWstackPaths`) instead of `path.join(os.homedir(), '.wrongstack')`.\n */\nexport function wstackGlobalRoot(): string {\n  const fromEnv = process.env['WRONGSTACK_HOME'];\n  if (fromEnv && fromEnv.trim().length > 0) return path.resolve(fromEnv);\n  return path.join(os.homedir(), '.wrongstack');\n}\n\nexport function resolveWstackPaths(opts: WstackPathOptions): WstackPaths {\n  // Precedence: explicit globalRoot > explicit userHome (callers/tests that\n  // pass one expect paths under it) > WRONGSTACK_HOME env > real home dir.\n  const globalRoot =\n    opts.globalRoot ?? (opts.userHome ? path.join(opts.userHome, '.wrongstack') : wstackGlobalRoot());\n  // Home dir for FOREIGN tool state (Claude Code's ~/.claude). Independent of\n  // WRONGSTACK_HOME, which redirects only WrongStack state: a real user's\n  // Claude skills live in their real home, but tests pass `userHome` to keep\n  // both `.wrongstack` and `.claude` under a temp dir.\n  const homeDir = opts.userHome ?? os.homedir();\n  const profileName = safeProfileName(opts.profileName ?? activeProfileName(globalRoot));\n  const profileDir = path.join(globalRoot, 'profiles', profileName);\n  const hash = projectHash(opts.projectRoot);\n  const slug = projectSlug(opts.projectRoot);\n  const projectDir = path.join(globalRoot, 'projects', slug);\n  return {\n    globalRoot,\n    profileName,\n    profileDir,\n    projectRoot: opts.projectRoot,\n    homeDir,\n    configDir: profileDir,\n    globalConfig: path.join(globalRoot, 'config.json'),\n    profilesDir: path.join(globalRoot, 'profiles'),\n    profileConfig: (name: string) => {\n      return path.join(globalRoot, 'profiles', safeProfileName(name), 'config.json');\n    },\n    profileStatuslineConfig: (name: string) => {\n      return path.join(globalRoot, 'profiles', safeProfileName(name), 'statusline.json');\n    },\n    profileModeConfig: (name: string) => {\n      return path.join(globalRoot, 'profiles', safeProfileName(name), 'mode.json');\n    },\n    profileProviderStatus: (name: string) => {\n      return path.join(globalRoot, 'profiles', safeProfileName(name), 'provider-status.json');\n    },\n    profileUpdateCache: (name: string) => {\n      return path.join(globalRoot, 'profiles', safeProfileName(name), 'update-cache.json');\n    },\n    secretsKey: path.join(globalRoot, '.key'),\n    globalMemory: path.join(profileDir, 'memory.md'),\n    globalSkills: path.join(profileDir, 'skills'),\n    globalClaudeSkills: path.join(homeDir, '.claude', 'skills'),\n    globalDesignKits: path.join(profileDir, 'design-kits'),\n    globalPrompts: path.join(profileDir, 'prompts'),\n    globalInstructions: path.join(profileDir, 'instructions'),\n    promptUsage: path.join(profileDir, 'prompt-usage.json'),\n    cacheDir: path.join(globalRoot, 'cache'),\n    modelsCache: path.join(globalRoot, 'cache', 'models.dev.json'),\n    modelsOverlayCache: path.join(globalRoot, 'cache', 'models-overlay.json'),\n    historyFile: path.join(profileDir, 'history'),\n    logFile: path.join(globalRoot, 'logs', 'wrongstack.log'),\n    projectDir,\n    projectCodebaseIndex: path.join(projectDir, 'codebase-index'),\n    projectMemory: path.join(projectDir, 'memory.md'),\n    projectSessions: path.join(projectDir, 'sessions'),\n    projectTrust: path.join(projectDir, 'trust.json'),\n    projectMeta: path.join(projectDir, 'meta.json'),\n    projectLocalConfig: path.join(projectDir, 'config.local.json'),\n    inProjectConfig: path.join(opts.projectRoot, '.wrongstack', 'config.json'),\n    inProjectAgentsFile: path.join(opts.projectRoot, '.wrongstack', 'AGENTS.md'),\n    inProjectSkills: path.join(opts.projectRoot, '.wrongstack', 'skills'),\n    inProjectClaudeSkills: path.join(opts.projectRoot, '.claude', 'skills'),\n    inProjectPrompts: path.join(opts.projectRoot, '.wrongstack', 'prompts'),\n    inProjectInstructions: path.join(opts.projectRoot, '.wrongstack', 'instructions'),\n    inProjectDesignKits: path.join(opts.projectRoot, '.wrongstack', 'design-kits'),\n    inProjectWorktrees: path.join(opts.projectRoot, '.wrongstack', 'worktrees'),\n    projectHash: hash,\n    projectSlug: slug,\n    projectGoal: path.join(projectDir, 'goal.json'),\n    projectInputHistory: path.join(projectDir, 'input-history.json'),\n    projectSpecs: path.join(projectDir, 'specs'),\n    projectTaskGraphs: path.join(projectDir, 'task-graphs'),\n    projectSddSession: path.join(projectDir, 'sdd-session.json'),\n    projectPlan: path.join(projectDir, 'plan.json'),\n    projectAutophase: path.join(projectDir, 'autophase'),\n    projectSddBoards: path.join(projectDir, 'sdd-boards'),\n    syncConfig: path.join(profileDir, 'sync.json'),\n    configHistoryDir: path.join(globalRoot, 'config-history'),\n    projectStatus: (projectHash: string) => path.join(globalRoot, 'projects', projectHash, 'status.json'),\n  };\n}\n", "import * as fsp from 'node:fs/promises';\nimport * as path from 'node:path';\nimport { atomicWrite, withFileLock } from '../utils/atomic-write.js';\nimport type { PhaseStore } from './phase-store.js';\nimport type { PhaseGraph, PhaseNode } from './types.js';\n\nexport interface Checkpoint {\n  id: string;\n  graphId: string;\n  phaseId: string;\n  phaseStatus: PhaseNode['status'];\n  taskStatuses: Array<{ taskId: string; status: string; title: string }>;\n  timestamp: number;\n  label?: string | undefined;\n}\n\nexport interface CheckpointManagerOptions {\n  store: PhaseStore;\n  maxCheckpoints?: number | undefined;\n  /** Max age in ms before a checkpoint is eligible for TTL-based pruning. Default: 7 days. */\n  maxCheckpointAgeMs?: number | undefined;\n  baseDir?: string | undefined;\n}\n\ninterface SerializedCheckpoint {\n  id: string;\n  graphId: string;\n  phaseId: string;\n  phaseStatus: PhaseNode['status'];\n  taskStatuses: Array<{ taskId: string; status: string; title: string }>;\n  timestamp: number;\n  label?: string | undefined;\n}\n\n/**\n * CheckpointManager - saves and restores snapshots of the phase graph.\n *\n * Usage:\n *   const cm = new CheckpointManager({ store });\n *   await cm.saveCheckpoint(graph, 'Before risky refactor');\n *   // ... if something goes wrong ...\n *   const restored = await cm.restoreCheckpoint(checkpointId);\n */\nexport class CheckpointManager {\n  private store: PhaseStore;\n  private maxCheckpoints: number;\n  private maxCheckpointAgeMs: number;\n  private checkpoints = new Map<string, Checkpoint>();\n  private baseDir: string;\n\n  constructor(opts: CheckpointManagerOptions) {\n    this.store = opts.store;\n    this.maxCheckpoints = opts.maxCheckpoints ?? 10;\n    this.maxCheckpointAgeMs = opts.maxCheckpointAgeMs ?? 7 * 24 * 60 * 60 * 1000; // 7 days\n    this.baseDir = opts.baseDir ?? path.join(opts.store.baseDir, '.checkpoints');\n    // Directory creation is lazy \u2014 happens on first save\n  }\n\n  async initialize(): Promise<void> {\n    await fsp.mkdir(this.baseDir, { recursive: true });\n    await this.loadFromDisk();\n  }\n\n  async saveCheckpoint(graph: PhaseGraph, label?: string): Promise<Checkpoint> {\n    // Save the graph first.\n    await this.store.save(graph);\n\n    // Extract checkpoint information from the active phase.\n    const activePhase = Array.from(graph.phases.values()).find(\n      (p) => p.status === 'running' || p.status === 'paused',\n    );\n\n    const checkpoint: Checkpoint = {\n      id: crypto.randomUUID(),\n      graphId: graph.id,\n      phaseId: activePhase?.id ?? graph.rootPhaseIds[0] ?? '',\n      phaseStatus: activePhase?.status ?? 'pending',\n      taskStatuses: activePhase\n        ? Array.from(activePhase.taskGraph.nodes.values()).map((t) => ({\n            taskId: t.id,\n            status: t.status,\n            title: t.title,\n          }))\n        : [],\n      timestamp: Date.now(),\n      label,\n    };\n\n    this.checkpoints.set(checkpoint.id, checkpoint);\n\n    // Save to disk.\n    await this.saveToDisk(checkpoint);\n\n    // Clean up old checkpoints for this graph only.\n    await this.pruneCheckpoints(graph.id);\n\n    return checkpoint;\n  }\n\n  async restoreCheckpoint(checkpointId: string): Promise<PhaseGraph | null> {\n    let checkpoint = this.checkpoints.get(checkpointId);\n\n    // Load from disk if the checkpoint is not in memory.\n    if (!checkpoint) {\n      await this.loadFromDisk();\n      checkpoint = this.checkpoints.get(checkpointId);\n    }\n\n    if (!checkpoint) return null;\n\n    const graph = await this.store.load(checkpoint.graphId);\n    if (!graph) return null;\n\n    // Restore the phase status from the checkpoint.\n    const phase = graph.phases.get(checkpoint.phaseId);\n    if (phase) {\n      phase.status = checkpoint.phaseStatus;\n      phase.updatedAt = Date.now();\n\n      // Restore task statuses.\n      for (const ts of checkpoint.taskStatuses) {\n        const task = phase.taskGraph.nodes.get(ts.taskId);\n        if (task) {\n          task.status = ts.status as import('../types/task-graph.js').TaskStatus;\n          task.updatedAt = Date.now();\n        }\n      }\n    }\n\n    graph.updatedAt = Date.now();\n    return graph;\n  }\n\n  listCheckpoints(graphId?: string): Checkpoint[] {\n    const all = Array.from(this.checkpoints.values());\n    const filtered = graphId ? all.filter((c) => c.graphId === graphId) : all;\n    return filtered.sort((a, b) => b.timestamp - a.timestamp);\n  }\n\n  async deleteCheckpoint(checkpointId: string): Promise<boolean> {\n    const checkpoint = this.checkpoints.get(checkpointId);\n    if (!checkpoint) return false;\n\n    this.checkpoints.delete(checkpointId);\n    // Await disk deletion to avoid split-brain between memory and disk\n    await this.deleteFromDisk(checkpointId);\n    return true;\n  }\n\n  private async saveToDisk(checkpoint: Checkpoint): Promise<void> {\n    const filePath = path.join(this.baseDir, `${checkpoint.graphId}.json`);\n    const serialized: SerializedCheckpoint = {\n      ...checkpoint,\n    };\n\n    await withFileLock(filePath, async () => {\n      // Read current on-disk state first\n      let existing: SerializedCheckpoint[] = [];\n      try {\n        const raw = await fsp.readFile(filePath, 'utf8');\n        const parsed = JSON.parse(raw);\n        if (Array.isArray(parsed)) {\n          existing = parsed as SerializedCheckpoint[];\n        }\n      } catch {\n        // File doesn't exist or is invalid \u2014 start fresh\n      }\n\n      // Write to disk BEFORE updating in-memory state \u2014 ensures consistency\n      existing.push(serialized);\n      await atomicWrite(filePath, JSON.stringify(existing, null, 2), { mode: 0o600 });\n    });\n  }\n\n  private async deleteFromDisk(checkpointId: string): Promise<void> {\n    let entries: string[];\n    try {\n      entries = await fsp.readdir(this.baseDir);\n    } catch {\n      return; // Directory doesn't exist \u2014 nothing to delete\n    }\n\n    for (const filename of entries) {\n      if (!filename.endsWith('.json')) continue;\n\n      const filePath = path.join(this.baseDir, filename);\n      try {\n        await withFileLock(filePath, async () => {\n          const raw = await fsp.readFile(filePath, 'utf8');\n          const parsed = JSON.parse(raw);\n          if (!Array.isArray(parsed)) return;\n          const existing = parsed as SerializedCheckpoint[];\n          const filtered = existing.filter((c) => c.id !== checkpointId);\n\n          if (filtered.length !== existing.length) {\n            if (filtered.length === 0) {\n              await fsp.unlink(filePath);\n            } else {\n              await atomicWrite(filePath, JSON.stringify(filtered, null, 2), { mode: 0o600 });\n            }\n          }\n        });\n      } catch {\n        // Skip invalid files\n      }\n    }\n  }\n\n  private async loadFromDisk(): Promise<void> {\n    let entries: string[];\n    try {\n      entries = await fsp.readdir(this.baseDir);\n    } catch {\n      // Directory doesn't exist yet \u2014 nothing to load\n      return;\n    }\n\n    for (const filename of entries) {\n      if (!filename.endsWith('.json')) continue;\n\n      const filePath = path.join(this.baseDir, filename);\n      try {\n        const raw = await fsp.readFile(filePath, 'utf8');\n        const parsed = JSON.parse(raw);\n        if (!Array.isArray(parsed)) continue;\n        const checkpoints = parsed as SerializedCheckpoint[];\n\n        for (const sc of checkpoints) {\n          const checkpoint: Checkpoint = {\n            id: sc.id,\n            graphId: sc.graphId,\n            phaseId: sc.phaseId,\n            phaseStatus: sc.phaseStatus,\n            taskStatuses: sc.taskStatuses,\n            timestamp: sc.timestamp,\n            label: sc.label,\n          };\n          this.checkpoints.set(checkpoint.id, checkpoint);\n        }\n      } catch {\n        // Skip invalid files\n      }\n    }\n  }\n\n  private async pruneCheckpoints(graphId: string): Promise<void> {\n    const now = Date.now();\n    const graphCheckpoints = Array.from(this.checkpoints.values())\n      .filter((checkpoint) => checkpoint.graphId === graphId)\n      .sort((a, b) => a.timestamp - b.timestamp);\n\n    // TTL-based pruning: evict checkpoints older than maxCheckpointAgeMs.\n    for (const cp of graphCheckpoints) {\n      if (now - cp.timestamp > this.maxCheckpointAgeMs) {\n        this.checkpoints.delete(cp.id);\n        await this.deleteFromDisk(cp.id);\n      }\n    }\n\n    // Count-based pruning: keep only the newest maxCheckpoints.\n    const remaining = Array.from(this.checkpoints.values())\n      .filter((checkpoint) => checkpoint.graphId === graphId)\n      .sort((a, b) => a.timestamp - b.timestamp);\n    while (remaining.length > this.maxCheckpoints) {\n      const oldest = remaining.shift();\n      if (oldest) {\n        this.checkpoints.delete(oldest.id);\n        await this.deleteFromDisk(oldest.id);\n      }\n    }\n  }\n}\n"],
-  "mappings": ";AAUO,IAAM,mBAAN,MAA4C;AAAA,EAChC,SAAS,oBAAI,IAAuB;AAAA,EAErD,MAAM,UAAU,OAAiC;AAC/C,SAAK,OAAO,IAAI,MAAM,IAAI,KAAK,WAAW,KAAK,CAAC;AAAA,EAClD;AAAA,EAEA,MAAM,UAAU,IAAuC;AACrD,UAAM,QAAQ,KAAK,OAAO,IAAI,EAAE;AAChC,WAAO,QAAQ,KAAK,WAAW,KAAK,IAAI;AAAA,EAC1C;AAAA,EAEA,MAAM,aAA+E;AACnF,WAAO,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,CAAC,WAAW;AAAA,MACtD,IAAI,MAAM;AAAA,MACV,OAAO,MAAM;AAAA,MACb,WAAW,MAAM;AAAA,IACnB,EAAE;AAAA,EACJ;AAAA,EAEA,MAAM,YAAY,IAA2B;AAC3C,SAAK,OAAO,OAAO,EAAE;AAAA,EACvB;AAAA,EAEQ,WAAW,OAA6B;AAC9C,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,IAAI,IAAI,MAAM,KAAK;AAAA,MAC1B,OAAO,CAAC,GAAG,MAAM,KAAK;AAAA,MACtB,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,IAChC;AAAA,EACF;AACF;;;ACtCO,SAAS,eAAe,KAAsB;AACnD,SAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD;;;ACkBO,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;AA4KO,IAAM,WAAN,cAAuB,gBAAgB;AAAA,EAC5C,YAAY,MAQT;AACD,UAAM;AAAA,MACJ,SAAS,KAAK;AAAA,MACd,MAAM,KAAK;AAAA,MACX,WAAW;AAAA,MACX,UAAU,KAAK,SAAS,YAAY,mBAAmB,YAAY;AAAA,MACnE,aAAa,KAAK,SAAS,YAAY;AAAA,MACvC,SAAS,KAAK;AAAA,MACd,OAAO,KAAK;AAAA,IACd,CAAC;AACD,SAAK,OAAO;AAAA,EACd;AACF;AAKO,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;;;ACtRO,SAAS,oBAAoB,OAAgC;AAClE,MAAI,YAAY;AAChB,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,MAAI,UAAU;AACd,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,iBAAiB;AACrB,MAAI,cAAc;AAClB,aAAW,KAAK,MAAM,MAAM,OAAO,GAAG;AACpC,YAAQ,EAAE,QAAQ;AAAA,MAChB,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,IACJ;AACA,sBAAkB,EAAE,iBAAiB;AACrC,mBAAe,EAAE,eAAe;AAAA,EAClC;AACA,QAAM,QAAQ,MAAM,MAAM;AAE1B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,QAAQ,IAAI,KAAK,MAAO,YAAY,QAAS,GAAG,IAAI;AAAA,IACrE;AAAA,IACA;AAAA,EACF;AACF;;;ACzFO,IAAM,cAAN,MAAM,aAAY;AAAA,EAMvB,YAA6B,MAA0B;AAA1B;AAAA,EAA2B;AAAA,EAA3B;AAAA,EALrB,QAA0B;AAAA,EAC1B,cAAgC,CAAC;AAAA,EACjC,YAAmC,CAAC;AAAA,EAC5C,OAAwB,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS1C,UAAU,UAA2C;AACnD,SAAK,UAAU,KAAK,QAAQ;AAC5B,WAAO,MAAM;AACX,YAAM,IAAI,KAAK,UAAU,QAAQ,QAAQ;AACzC,UAAI,KAAK,EAAG,MAAK,UAAU,OAAO,GAAG,CAAC;AAAA,IACxC;AAAA,EACF;AAAA,EAEQ,aAAa,QAAiC;AACpD,eAAW,KAAK,KAAK,WAAW;AAC9B,UAAI;AACF,UAAE,MAAM;AAAA,MACV,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,OAAwB;AAC/B,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,MAAM,YAAY,QAAgB,OAAmC;AACnE,SAAK,QAAQ;AAAA,MACX,IAAI,OAAO,WAAW;AAAA,MACtB;AAAA,MACA;AAAA,MACA,OAAO,oBAAI,IAAI;AAAA,MACf,OAAO,CAAC;AAAA,MACR,WAAW,CAAC;AAAA,MACZ,WAAW,KAAK,IAAI;AAAA,MACpB,WAAW,KAAK,IAAI;AAAA,IACtB;AACA,UAAM,KAAK,KAAK,MAAM,UAAU,KAAK,KAAK;AAC1C,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAM,UAAU,IAAuC;AACrD,SAAK,QAAQ,MAAM,KAAK,KAAK,MAAM,UAAU,EAAE;AAC/C,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,QAAQ,MAAkE;AACxE,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,SAAS;AAAA,QACjB,SAAS;AAAA,QACT,MAAM,YAAY;AAAA,MACpB,CAAC;AAEH,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,UAAoB;AAAA,MACxB,GAAG;AAAA,MACH,IAAI,OAAO,WAAW;AAAA,MACtB,QAAQ,KAAK,UAAU;AAAA,MACvB,WAAW;AAAA,MACX,WAAW;AAAA,IACb;AAEA,SAAK,MAAM,MAAM,IAAI,QAAQ,IAAI,OAAO;AAExC,QAAI,CAAC,KAAK,UAAU;AAClB,WAAK,MAAM,UAAU,KAAK,QAAQ,EAAE;AAAA,IACtC;AAEA,SAAK,MAAM,YAAY;AACvB,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,cAAc,QAAQ,QAAQ,IAAI,MAAM,QAAQ,CAAC;AAE3E,WAAO;AAAA,EACT;AAAA,EAEA,QAAQ,MAAc,IAAY,OAAsC,cAAoB;AAC1F,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,SAAS;AAAA,QACjB,SAAS;AAAA,QACT,MAAM,YAAY;AAAA,MACpB,CAAC;AAEH,SAAK,MAAM,MAAM,KAAK;AAAA,MACpB,IAAI,OAAO,WAAW;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AACD,SAAK,MAAM,YAAY,KAAK,IAAI;AAChC,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,cAAc,OAAe,QAAyB;AACpD,QAAI,CAAC,KAAK,MAAO,QAAO;AACxB,QAAI,UAAU,OAAQ,QAAO;AAC7B,QAAI,CAAC,KAAK,MAAM,MAAM,IAAI,KAAK,KAAK,CAAC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAG,QAAO;AAE1E,QAAI,KAAK,YAAY,MAAM,EAAE,SAAS,KAAK,EAAG,QAAO;AAGrD,QAAI,KAAK,sBAAsB,OAAO,QAAQ,oBAAI,IAAI,CAAC,EAAG,QAAO;AACjE,SAAK,QAAQ,OAAO,QAAQ,YAAY;AACxC,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,sBAAsB,QAAgB,UAAkB,MAA4B;AAC1F,QAAI,WAAW,SAAU,QAAO;AAChC,QAAI,KAAK,IAAI,MAAM,EAAG,QAAO;AAC7B,SAAK,IAAI,MAAM;AACf,eAAW,WAAW,KAAK,YAAY,MAAM,GAAG;AAC9C,UAAI,KAAK,sBAAsB,SAAS,UAAU,IAAI,EAAG,QAAO;AAAA,IAClE;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,IAAY,OAAsC;AAC9D,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC,KAAM;AACX,SAAK,WAAW,EAAE,GAAG,KAAK,UAAU,GAAG,MAAM;AAC7C,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,MAAM,YAAY,KAAK;AAC5B,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,gBAAgB,QAAQ,IAAI,KAAK,CAAC;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,WAAW,IAAqB;AAC9B,QAAI,CAAC,KAAK,MAAO,QAAO;AACxB,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC,KAAM,QAAO;AAClB,SAAK,MAAM,MAAM,OAAO,EAAE;AAC1B,SAAK,MAAM,QAAQ,KAAK,MAAM,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,OAAO,EAAE;AAC9E,SAAK,MAAM,YAAY,KAAK,MAAM,UAAU,OAAO,CAAC,MAAM,MAAM,EAAE;AAElE,eAAW,KAAK,KAAK,MAAM,MAAM,OAAO,GAAG;AACzC,UAAI,EAAE,UAAU,SAAS,EAAE,EAAG,GAAE,WAAW,EAAE,SAAS,OAAO,CAAC,MAAM,MAAM,EAAE;AAAA,IAC9E;AACA,SAAK,MAAM,YAAY,KAAK,IAAI;AAChC,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,gBAAgB,QAAQ,IAAI,KAAK,CAAC;AAC5D,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,IAAY,QAA4B,QAAuB;AAC9E,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,SAAS;AAAA,QACjB,SAAS;AAAA,QACT,MAAM,YAAY;AAAA,MACpB,CAAC;AAEH,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC;AACH,YAAM,IAAI,SAAS;AAAA,QACjB,SAAS,QAAQ,EAAE;AAAA,QACnB,MAAM,YAAY;AAAA,QAClB,SAAS,EAAE,QAAQ,GAAG;AAAA,MACxB,CAAC;AAEH,UAAM,OAAO,KAAK;AAClB,UAAM,MAAM,KAAK,IAAI;AACrB,SAAK,SAAS;AACd,SAAK,YAAY;AAEjB,QAAI,WAAW,aAAa;AAC1B,WAAK,cAAc;AACnB,WAAK,YAAY,KAAK,aAAa;AAAA,IACrC;AACA,QAAI,WAAW,eAAe;AAC5B,WAAK,YAAY;AAAA,IACnB;AAEA,SAAK,YAAY,KAAK,EAAE,MAAM,IAAI,QAAQ,WAAW,KAAK,OAAO,CAAC;AAClE,QAAI,KAAK,YAAY,SAAS,aAAY,iBAAiB;AACzD,WAAK,YAAY,OAAO,GAAG,KAAK,YAAY,SAAS,aAAY,eAAe;AAAA,IAClF;AAGA,QAAI,WAAW,aAAa;AAC1B,WAAK,kBAAkB,EAAE;AAAA,IAC3B;AAGA,QAAI,WAAW,eAAe;AAC5B,WAAK,sBAAsB,EAAE;AAAA,IAC/B;AAEA,SAAK,MAAM,YAAY;AACvB,SAAK,QAAQ;AACb,SAAK,aAAa;AAAA,MAChB,MAAM;AAAA,MACN,QAAQ;AAAA,MACR;AAAA,MACA,YAAY,EAAE,MAAM,IAAI,QAAQ,WAAW,KAAK,OAAO;AAAA,IACzD,CAAC;AAAA,EACH;AAAA,EAEA,WACE,IACA,OAGM;AACN,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,SAAS;AAAA,QACjB,SAAS;AAAA,QACT,MAAM,YAAY;AAAA,MACpB,CAAC;AAEH,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC;AACH,YAAM,IAAI,SAAS;AAAA,QACjB,SAAS,QAAQ,EAAE;AAAA,QACnB,MAAM,YAAY;AAAA,QAClB,SAAS,EAAE,QAAQ,GAAG;AAAA,MACxB,CAAC;AAEH,QAAI,MAAM,UAAU,OAAW,MAAK,QAAQ,MAAM;AAClD,QAAI,MAAM,gBAAgB,OAAW,MAAK,cAAc,MAAM;AAC9D,QAAI,MAAM,aAAa,OAAW,MAAK,WAAW,MAAM;AACxD,QAAI,MAAM,kBAAkB,OAAW,MAAK,gBAAgB,MAAM;AAClE,QAAI,MAAM,SAAS,OAAW,MAAK,OAAO,MAAM;AAChD,QAAI,MAAM,aAAa,OAAW,MAAK,WAAW,MAAM;AACxD,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,MAAM,YAAY,KAAK;AAC5B,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,gBAAgB,QAAQ,IAAI,KAAK,CAAC;AAAA,EAC9D;AAAA,EAEA,QAAQ,IAAkC;AACxC,WAAO,KAAK,OAAO,MAAM,IAAI,EAAE;AAAA,EACjC;AAAA,EAEA,YAAY,QAAqB,MAA6B;AAC5D,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AAEzB,QAAI,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,OAAO,CAAC;AAEhD,QAAI,QAAQ;AACV,cAAQ,MAAM,OAAO,CAAC,MAAM;AAC1B,YAAI,OAAO,QAAQ,UAAU,CAAC,OAAO,OAAO,SAAS,EAAE,MAAM,EAAG,QAAO;AACvE,YAAI,OAAO,UAAU,UAAU,CAAC,OAAO,SAAS,SAAS,EAAE,QAAQ,EAAG,QAAO;AAC7E,YAAI,OAAO,MAAM,UAAU,CAAC,OAAO,KAAK,SAAS,EAAE,IAAI,EAAG,QAAO;AACjE,YAAI,OAAO,UAAU,UAAU,EAAE,YAAY,CAAC,OAAO,SAAS,SAAS,EAAE,QAAQ;AAC/E,iBAAO;AACT,YAAI,OAAO,MAAM,UAAU,EAAE,QAAQ,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,OAAO,MAAM,SAAS,CAAC,CAAC;AAC/E,iBAAO;AACT,YAAI,OAAO,qBAAqB,EAAE,sBAAsB,OAAO;AAC7D,iBAAO;AACT,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,QAAI,MAAM;AACR,YAAM,KAAK,CAAC,GAAG,MAAM;AACnB,cAAM,MAAM,eAAe,GAAG,GAAG,KAAK,KAAK;AAC3C,eAAO,KAAK,cAAc,QAAQ,MAAM,CAAC;AAAA,MAC3C,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,UAA8B;AACxC,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,MAAM,KAAK,KAAK,MAAM,MAAM,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ;AAAA,EACpF;AAAA,EAEA,cAAc,QAA0B;AACtC,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,KAAK,MAAM,MACf,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,SAAS,YAAY,EAC1D,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EACpB;AAAA,EAEA,YAAY,QAA0B;AACpC,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,KAAK,MAAM,MACf,OAAO,CAAC,MAAM,EAAE,OAAO,UAAU,EAAE,SAAS,YAAY,EACxD,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,EACtB;AAAA,EAEA,SAAS,QAAyB;AAChC,UAAM,WAAW,KAAK,YAAY,MAAM;AACxC,WAAO,SAAS,MAAM,CAAC,OAAO;AAC5B,YAAM,OAAO,KAAK,OAAO,MAAM,IAAI,EAAE;AAGrC,aAAO,MAAM,WAAW,eAAe,MAAM,WAAW;AAAA,IAC1D,CAAC;AAAA,EACH;AAAA,EAEA,cAA4B;AAC1B,QAAI,CAAC,KAAK,OAAO;AACf,aAAO;AAAA,QACL,OAAO;AAAA,QACP,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,QAChB,aAAa;AAAA,MACf;AAAA,IACF;AACA,WAAO,oBAAoB,KAAK,KAAK;AAAA,EACvC;AAAA,EAEA,eAAe,SAAoC;AACjD,WAAO,CAAC,GAAG,KAAK,WAAW;AAAA,EAC7B;AAAA,EAEQ,kBAAkB,aAA2B;AACnD,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,aAAa,KAAK,cAAc,WAAW;AACjD,eAAW,SAAS,YAAY;AAC9B,YAAM,MAAM,KAAK,MAAM,MAAM,IAAI,KAAK;AACtC,UAAI,KAAK,WAAW,WAAW;AAE7B,cAAM,oBAAoB,KAAK,YAAY,KAAK;AAChD,cAAM,eAAe,kBAAkB,MAAM,CAAC,OAAO;AACnD,gBAAM,UAAU,KAAK,OAAO,MAAM,IAAI,EAAE;AACxC,iBAAO,SAAS,WAAW,eAAe,SAAS,WAAW;AAAA,QAChE,CAAC;AACD,YAAI,cAAc;AAChB,cAAI,SAAS;AACb,cAAI,YAAY,KAAK,IAAI;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,sBAAsB,QAAsB;AAClD,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,WAAW,KAAK,YAAY,MAAM;AACxC,UAAM,cAAc,SAAS,KAAK,CAAC,OAAO;AACxC,YAAM,UAAU,KAAK,OAAO,MAAM,IAAI,EAAE;AAGxC,aAAO,SAAS,WAAW,eAAe,SAAS,WAAW;AAAA,IAChE,CAAC;AACD,QAAI,aAAa;AACf,YAAM,OAAO,KAAK,MAAM,MAAM,IAAI,MAAM;AACxC,UAAI,MAAM;AACR,aAAK,SAAS;AACd,aAAK,YAAY,KAAK,IAAI;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,UAAgB;AACtB,QAAI,CAAC,KAAK,MAAO;AACjB,SAAK,KAAK,MAAM,UAAU,KAAK,KAAK,EAAE,MAAM,CAAC,QAAQ;AACnD,WAAK,KAAK,iBACN,KAAK,KAAK,eAAe,GAAG,IAC5B,QAAQ;AAAA,QACN,KAAK,UAAU;AAAA,UACb,OAAO;AAAA,UACP,OAAO;AAAA,UACP,SAAS,eAAe,GAAG;AAAA,UAC3B,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACN,CAAC;AAAA,EACH;AACF;AAGA,IAAM,gBAAsD;AAAA,EAC1D,UAAU;AAAA,EACV,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AACP;AACA,IAAM,cAAkD;AAAA,EACtD,aAAa;AAAA,EACb,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,WAAW;AACb;AAEA,SAAS,eAAe,GAAa,GAAa,OAAkC;AAClF,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,aAAO,cAAc,EAAE,QAAQ,IAAI,cAAc,EAAE,QAAQ;AAAA,IAC7D,KAAK;AACH,aAAO,YAAY,EAAE,MAAM,IAAI,YAAY,EAAE,MAAM;AAAA,IACrD,KAAK;AACH,aAAO,EAAE,YAAY,EAAE;AAAA,IACzB,KAAK;AACH,aAAO,EAAE,YAAY,EAAE;AAAA,EAC3B;AACF;;;ACzbO,IAAM,oBAAN,MAAM,mBAAkB;AAAA,EAC7B,YAA6B,MAAgC;AAAhC;AAAA,EAAiC;AAAA,EAAjC;AAAA,EAE7B,MAAM,QAA6B;AACjC,UAAM,UAAU,OAAO,WAAW;AAClC,UAAM,SAAS,oBAAI,IAAuB;AAC1C,UAAM,WAAqB,CAAC;AAG5B,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,OAAO,QAAQ,KAAK;AAChD,YAAM,OAAO,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,MAAM,IAAI,aAAa,IAAI,OAAO,CAAC,GAAG,eAAe,CAAC,GAAG,gBAAgB,OAAO,UAAU,UAAmB,eAAe,EAAE;AACpK,YAAM,UAAU,OAAO,WAAW;AAClC,eAAS,KAAK,OAAO;AAGrB,YAAM,QAAQ,KAAK,KAAK,qBAAqB,IAAI,iBAAiB;AAClE,YAAM,UAAU,IAAI,YAAY,EAAE,MAAM,CAAC;AACzC,YAAM,YAAY,MAAM,QAAQ,YAAY,SAAS,GAAG,KAAK,IAAI,QAAQ;AAGzE,UAAI,KAAK,iBAAiB,KAAK,cAAc,SAAS,GAAG;AACvD,mBAAW,MAAM,KAAK,eAAe;AACnC,kBAAQ,QAAQ;AAAA,YACd,OAAO,GAAG;AAAA,YACV,aAAa,GAAG;AAAA,YAChB,MAAM,GAAG;AAAA,YACT,UAAU,GAAG;AAAA,YACb,QAAQ;AAAA,YACR,eAAe,GAAG;AAAA,YAClB,MAAM,GAAG,QAAQ,CAAC;AAAA,UACpB,CAAC;AAAA,QACH;AAAA,MACF;AAEA,YAAM,QAAmB;AAAA,QACvB,IAAI;AAAA,QACJ,MAAM,KAAK;AAAA,QACX,aAAa,KAAK;AAAA,QAClB,QAAQ;AAAA,QACR;AAAA,QACA,WAAW,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;AAAA,QAC9C,YAAY,IAAI,KAAK,KAAK,OAAO,SAAS,IAAI,CAAC,SAAS,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;AAAA,QACzE,gBAAgB,KAAK;AAAA,QACrB,UAAU,KAAK;AAAA,QACf,eAAe,KAAK;AAAA,QACpB,gBAAgB,CAAC;AAAA,QACjB,WAAW,KAAK,IAAI;AAAA,QACpB,WAAW,KAAK,IAAI;AAAA,MACtB;AAEA,aAAO,IAAI,SAAS,KAAK;AAAA,IAC3B;AAMA,UAAM,aAAa,MAAM,KAAK,OAAO,OAAO,CAAC;AAC7C,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,QAAQ,WAAW,CAAC;AAC1B,UAAI,CAAC,MAAO;AACZ,YAAM,aAAa,IAAI,WAAW,SAAS,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC;AAAA,IAClF;AAEA,UAAM,QAAoB;AAAA,MACxB,IAAI;AAAA,MACJ,OAAO,KAAK,KAAK;AAAA,MACjB,aAAa,KAAK,KAAK,eAAe;AAAA,MACtC;AAAA,MACA,cAAc,SAAS,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC;AAAA,MAC3D,gBAAgB,CAAC;AAAA,MACjB,mBAAmB,CAAC;AAAA,MACpB,gBAAgB,CAAC;AAAA,MACjB,YAAY,KAAK,KAAK,cAAc;AAAA,MACpC,gBAAgB;AAAA,MAChB,YAAY,KAAK,KAAK;AAAA,MACtB,aAAa,KAAK,KAAK;AAAA,MACvB,eAAe,KAAK,KAAK;AAAA,MACzB,WAAW,KAAK,IAAI;AAAA,MACpB,WAAW,KAAK,IAAI;AAAA,IACtB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,cACL,WACA,SAIqB;AACrB,UAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,UAAM,QAAQ,MAAM,KAAK,UAAU,MAAM,OAAO,CAAC;AAGjD,UAAM,aAAa,oBAAI,IAAsB;AAC7C,eAAW,QAAQ,UAAU,OAAO;AAClC,YAAM,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,CAAC;AAC3C,WAAK,KAAK,KAAK,EAAE;AACjB,iBAAW,IAAI,KAAK,MAAM,IAAI;AAAA,IAChC;AAGA,UAAM,WAAW,oBAAI,IAAoB;AACzC,eAAW,QAAQ,MAAO,UAAS,IAAI,KAAK,IAAI,CAAC;AACjD,eAAW,QAAQ,UAAU,OAAO;AAClC,eAAS,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,IACxD;AAEA,UAAM,QAAkB,CAAC;AACzB,eAAW,CAAC,IAAI,MAAM,KAAK,UAAU;AACnC,UAAI,WAAW,EAAG,OAAM,KAAK,EAAE;AAAA,IACjC;AAEA,UAAM,YAA0C;AAAA,MAC9C,UAAU;AAAA,MACV,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,KAAK;AAAA,IACP;AAEA,UAAM,aAAuB,CAAC;AAC9B,WAAO,MAAM,SAAS,GAAG;AAEvB,YAAM,KAAK,CAAC,GAAG,MAAM;AACnB,cAAM,KAAK,UAAU,MAAM,IAAI,CAAC;AAChC,cAAM,KAAK,UAAU,MAAM,IAAI,CAAC;AAChC,cAAM,SAAS,KAAK,UAAU,GAAG,QAAQ,IAAI;AAC7C,cAAM,SAAS,KAAK,UAAU,GAAG,QAAQ,IAAI;AAC7C,eAAO,SAAS;AAAA,MAClB,CAAC;AACD,YAAM,KAAK,MAAM,MAAM;AACvB,iBAAW,KAAK,EAAE;AAClB,iBAAW,SAAS,WAAW,IAAI,EAAE,KAAK,CAAC,GAAG;AAC5C,cAAM,OAAO,SAAS,IAAI,KAAK,KAAK,KAAK;AACzC,iBAAS,IAAI,OAAO,GAAG;AACvB,YAAI,QAAQ,EAAG,OAAM,KAAK,KAAK;AAAA,MACjC;AAAA,IACF;AAIA,UAAM,SAAqB,CAAC;AAC5B,QAAI,eAAyB,CAAC;AAC9B,UAAM,WAAW,oBAAI,IAAY;AAEjC,eAAW,MAAM,YAAY;AAC3B,UAAI,SAAS,IAAI,EAAE,EAAG;AACtB,eAAS,IAAI,EAAE;AACf,mBAAa,KAAK,EAAE;AAIpB,YAAM,OAAO,WAAW,IAAI,EAAE,KAAK,CAAC;AACpC,iBAAW,SAAS,MAAM;AACxB,YAAI,CAAC,SAAS,IAAI,KAAK,KAAK,aAAa,SAAS,eAAe;AAC/D,mBAAS,IAAI,KAAK;AAClB,uBAAa,KAAK,KAAK;AAAA,QACzB;AAAA,MACF;AAEA,UAAI,aAAa,UAAU,eAAe;AACxC,eAAO,KAAK,YAAY;AACxB,uBAAe,CAAC;AAAA,MAClB;AAAA,IACF;AACA,QAAI,aAAa,SAAS,EAAG,QAAO,KAAK,YAAY;AAErD,UAAM,iBAAkC,OAAO,IAAI,CAAC,UAAU,QAAQ;AACpE,YAAM,QAAQ,SACX,IAAI,CAAC,OAAO,UAAU,MAAM,IAAI,EAAE,CAAC,EACnC,OAAO,CAAC,MAAkC,KAAK,IAAI;AACtD,YAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,aAAa,UAAU;AAC/D,YAAM,aAAa,MAAM,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,iBAAiB,IAAI,CAAC;AAE3E,aAAO;AAAA,QACL,MAAM,SAAS,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG,MAAM,MAAM,GAAG,EAAE,KAAK,OAAO;AAAA,QAClE,aAAa,MAAM,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,IAAI;AAAA,QAChD,UAAU,cAAc,aAAa;AAAA,QACrC,eAAe;AAAA,QACf,gBAAgB;AAAA,QAChB,eAAe,MAAM,IAAI,CAAC,OAAO;AAAA,UAC/B,OAAO,EAAE;AAAA,UACT,aAAa,EAAE;AAAA,UACf,MAAM,EAAE;AAAA,UACR,UAAU,EAAE;AAAA,UACZ,eAAe,EAAE,iBAAiB;AAAA,UAClC,MAAM,EAAE,QAAQ,CAAC;AAAA,QACnB,EAAE;AAAA,MACJ;AAAA,IACF,CAAC;AAED,UAAM,UAAU,IAAI,mBAAkB;AAAA,MACpC,GAAG;AAAA,MACH,QAAQ;AAAA,IACV,CAAC;AAED,WAAO,QAAQ,MAAM;AAAA,EACvB;AACF;;;ACpPA,YAAY,SAAS;AACrB,YAAY,UAAU;;;ACmBtB,IAAM,YAAY,MAAe,OAAO,YAAY,eAAe,CAAC,CAAC,QAAQ;AAItE,SAAS,cAAuB;AACrC,SAAO,UAAU,KAAK,QAAQ,QAAQ,OAAO,KAAK;AACpD;AA6FA,IAAI,oBAA4C;AA+BhD,SAAS,QACP,GACA,QACS;AACT,MAAI,CAAC,UAAU,OAAO,OAAO,UAAU,WAAY,QAAO;AAC1D,QAAM,QAAQ;AACd,MAAI,CAAC,OAAO;AACV,WAAO,MAAM,CAAC;AACd,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ;AACd,SAAO,MAAM,CAAC;AACd,QAAM,OAAO;AACb,SAAO;AACT;AAkDO,SAAS,SACd,GACA,SAA6B,QAAQ,QAC5B;AACT,SAAO,QAAQ,GAAG,MAAM;AAC1B;AAybO,IAAM,oBAAoB,OAAO,OAAO;AAAA,EAC7C,KAAK;AAAA;AAAA,EACL,IAAK;AAAA;AACP,CAAC;;;ACtpBD,IAAM,aAAa,MAAe;AAChC,MAAI,QAAQ,QAAQ,IAAI,QAAQ,EAAG,QAAO;AAC1C,MAAI,QAAQ,QAAQ,IAAI,WAAW,EAAG,QAAO;AAC7C,SAAO,YAAY;AACrB;AAEA,SAAS,QAAQ,OAAoC;AACnD,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,MAAM,KAAK,MAAM,GAAI,QAAO;AAChC,SAAO,CAAC,sBAAsB,KAAK,MAAM,KAAK,CAAC;AACjD;AAEA,IAAM,QAAQ,WAAW;AAEzB,IAAM,OACJ,CAAC,MAAc,UACf,CAAC,MACC,QAAQ,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM;AAEzC,IAAM,QAAQ;AAAA,EACnB,OAAO,KAAK,KAAK,GAAG;AAAA,EACpB,MAAM,KAAK,KAAK,IAAI;AAAA,EACpB,KAAK,KAAK,KAAK,IAAI;AAAA,EACnB,QAAQ,KAAK,KAAK,IAAI;AAAA,EACtB,WAAW,KAAK,KAAK,IAAI;AAAA,EACzB,KAAK,KAAK,MAAM,IAAI;AAAA,EACpB,OAAO,KAAK,MAAM,IAAI;AAAA,EACtB,QAAQ,KAAK,MAAM,IAAI;AAAA,EACvB,MAAM,KAAK,MAAM,IAAI;AAAA,EACrB,SAAS,KAAK,MAAM,IAAI;AAAA,EACxB,MAAM,KAAK,MAAM,IAAI;AAAA,EACrB,MAAM,KAAK,MAAM,IAAI;AAAA,EACrB,OAAO,KAAK,YAAY,IAAI;AAAA,EAC5B,MAAM,KAAK,YAAY,IAAI;AAAA,EAC3B,OAAO,KAAK,MAAM,IAAI;AAAA,EACtB,SAAS,KAAK,MAAM,IAAI;AAC1B;;;AFhCA,IAAM,aAAuC;AAAA,EAC3C,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AACT;AAEA,IAAM,SAAkD;AAAA,EACtD,OAAO,MAAM;AAAA,EACb,MAAM,MAAM;AAAA,EACZ,MAAM,MAAM;AAAA,EACZ,OAAO,MAAM;AAAA,EACb,OAAO,MAAM;AACf;AAEA,IAAM,aAAa,oBAAI,IAAc,CAAC,SAAS,QAAQ,QAAQ,SAAS,OAAO,CAAC;AAChF,IAAM,cAAc,oBAAI,IAAY,CAAC,UAAU,MAAM,CAAC;AA+B/C,IAAM,gBAAN,MAAM,eAAgC;AAAA;AAAA,EAE3C,OAAwB,qBAAqB;AAAA,EAC7C,OAAwB,0BAA0B;AAAA,EAClD,OAAwB,yBAAyB,IAAI,OAAO;AAAA,EAE5D;AAAA,EACQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,yBAAyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAezB,OAAsB,QAAQ,QAAQ;AAAA,EACtC,SAA+B;AAAA,EAC/B,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EAE3B,IAAY,OAAsB;AAChC,WAAO,KAAK,SAAS,KAAK,OAAO,OAAO;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAY,QAAuB;AACjC,WAAO,KAAK,SAAS,KAAK,OAAO,QAAQ,KAAK;AAAA,EAChD;AAAA,EACA,IAAY,MAAM,MAAqB;AACrC,QAAI,KAAK,OAAQ,MAAK,OAAO,OAAO;AAAA,QAC/B,MAAK,OAAO;AAAA,EACnB;AAAA,EAEA,YAAY,OAA6B,CAAC,GAAG;AAC3C,SAAK,QAAQ,KAAK,SAAS,cAAc,QAAQ,IAAI,oBAAoB;AACzE,SAAK,OAAO,KAAK;AACjB,SAAK,WAAW,KAAK,YAAY,CAAC;AAClC,SAAK,SAAS,KAAK,UAAU,eAAe,QAAQ,IAAI,qBAAqB;AAC7E,SAAK,SAAS,KAAK,WAAW;AAC9B,SAAK,eAAe,KAAK,gBAAgB,KAAK,OAAO;AACrD,QAAI,KAAK,MAAM;AAQb,YAAM,MAAW,aAAQ,KAAK,IAAI;AAClC,WAAK,QAAQ,KAAK,MACf,KAAK,YAAY;AAChB,cAAU,UAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AAAA,MAC1C,CAAC,EACA,MAAM,MAAM,MAAS;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,MAAM,KAAa,KAAqB;AACtC,SAAK,IAAI,SAAS,KAAK,GAAG;AAAA,EAC5B;AAAA,EACA,KAAK,KAAa,KAAqB;AACrC,SAAK,IAAI,QAAQ,KAAK,GAAG;AAAA,EAC3B;AAAA,EACA,KAAK,KAAa,KAAqB;AACrC,SAAK,IAAI,QAAQ,KAAK,GAAG;AAAA,EAC3B;AAAA,EACA,MAAM,KAAa,KAAqB;AACtC,SAAK,IAAI,SAAS,KAAK,GAAG;AAAA,EAC5B;AAAA,EACA,MAAM,KAAa,KAAqB;AACtC,SAAK,IAAI,SAAS,KAAK,GAAG;AAAA,EAC5B;AAAA,EAEA,MAAM,UAA2C;AAQ/C,UAAM,QAAQ,OAAO,OAAO,eAAc,SAAS;AACnD,UAAM,QAAQ,KAAK;AACnB,UAAM,OAAO,KAAK;AAClB,UAAM,WAAW,EAAE,GAAG,KAAK,UAAU,GAAG,SAAS;AACjD,UAAM,SAAS,KAAK;AACpB,UAAM,SAAS,KAAK;AACpB,UAAM,eAAe,KAAK;AAC1B,UAAM,SAAS;AACf,UAAM,yBAAyB,KAAK;AACpC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAuB;AACrB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcQ,cAAc,MAAoB;AACxC,QAAI,KAAK,2BAA2B,eAAc,uBAAuB,EAAG;AAC5E,SAAK,QAAQ,KAAK,MACf,KAAK,YAAY;AAChB,UAAI;AACJ,UAAI;AACF,aAAK,MAAU,SAAK,IAAI;AAAA,MAC1B,QAAQ;AACN;AAAA,MACF;AACA,UAAI,GAAG,OAAO,KAAK,aAAc;AACjC,UAAI;AACF,cAAU,OAAG,GAAG,IAAI,MAAM,EAAE,OAAO,KAAK,CAAC;AACzC,cAAU,WAAO,MAAM,GAAG,IAAI,IAAI;AAAA,MACpC,QAAQ;AAAA,MAER;AAAA,IACF,CAAC,EACA,MAAM,MAAM,MAAS;AAAA,EAC1B;AAAA,EAEQ,IAAI,OAAiB,KAAa,KAAqB;AAC7D,UAAM,IAAI,WAAW,KAAK;AAC1B,UAAM,UAAU,WAAW,KAAK,KAAK;AACrC,QAAI,IAAI,QAAS;AACjB,UAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAClC,UAAM,QAAiC,EAAE,IAAI,OAAO,KAAK,GAAG,KAAK,SAAS;AAC1E,QAAI,QAAQ,QAAW;AACrB,YAAM,MAAM,eAAe,QAAQ,EAAE,SAAS,IAAI,SAAS,OAAO,IAAI,MAAM,IAAI;AAAA,IAClF;AAKA,QAAI,KAAK,MAAM;AACb,YAAM,OAAO,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA;AACrC,YAAM,QAAQ,OAAO,WAAW,MAAM,MAAM;AAC5C,YAAM,OAAO,KAAK;AAClB,UACE,KAAK,oBAAoB,eAAc,2BACvC,SAAS,eAAc,0BACvB,KAAK,mBAAmB,SAAS,eAAc,wBAC/C;AACA,aAAK,qBAAqB;AAC1B,aAAK,oBAAoB;AACzB,aAAK,cAAc,KAAK,IAAI;AAC5B,aAAK,QAAQ,KAAK,MACf,KAAK,MAAU,eAAW,KAAK,MAAO,IAAI,CAAC,EAC3C,MAAM,MAAM,MAAS,EACrB,QAAQ,MAAM;AACb,eAAK,oBAAoB,KAAK,IAAI,GAAG,KAAK,oBAAoB,CAAC;AAC/D,eAAK,mBAAmB,KAAK,IAAI,GAAG,KAAK,mBAAmB,KAAK;AAAA,QACnE,CAAC;AAAA,MACL;AAAA,IACF;AAGA,QAAI,CAAC,KAAK,OAAQ;AAClB,QAAI,KAAK,WAAW,QAAQ;AAC1B,eAAS,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA,CAAI;AAAA,IACvC,OAAO;AACL,YAAM,OAAO,GAAG,MAAM,IAAI,EAAE,CAAC,IAAI,OAAO,KAAK,EAAE,MAAM,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG;AACpF,UAAI,QAAQ,QAAW;AACrB,iBAAS,GAAG,IAAI,IAAI,UAAU,GAAG,CAAC;AAAA,CAAI;AAAA,MACxC,OAAO;AACL,iBAAS,GAAG,IAAI;AAAA,CAAI;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,cAAc,KAAmC;AACxD,SAAO,OAAO,WAAW,IAAI,GAAe,IAAK,MAAmB;AACtE;AAEA,SAAS,eAAe,KAAoC;AAC1D,SAAO,OAAO,YAAY,IAAI,GAAG,IAAK,MAAoB;AAC5D;AAEA,SAAS,UAAU,KAAsB;AACvC,MAAI,eAAe,MAAO,QAAO,MAAM,IAAI,IAAI,OAAO;AACtD,MAAI,OAAO,QAAQ,SAAU,QAAO,MAAM,IAAI,GAAG;AACjD,MAAI;AACF,WAAO,MAAM,IAAI,KAAK,UAAU,GAAG,CAAC;AAAA,EACtC,QAAQ;AACN,WAAO,MAAM,IAAI,OAAO,GAAG,CAAC;AAAA,EAC9B;AACF;AAOO,IAAM,aAAqB;AAAA;AAAA;AAAA,EAGhC,OAAO;AAAA,EACP,OAAO,MAAM;AAAA,EAAC;AAAA,EACd,MAAM,MAAM;AAAA,EAAC;AAAA,EACb,MAAM,MAAM;AAAA,EAAC;AAAA,EACb,OAAO,MAAM;AAAA,EAAC;AAAA,EACd,OAAO,MAAM;AAAA,EAAC;AAAA,EACd,OAAO,MAAM;AACf;;;AGvQO,SAAS,uBACd,OACA,QACuB;AACvB,aAAW,SAAS,MAAM,OAAO,OAAO,GAAG;AACzC,QAAI,MAAM,UAAU,MAAM,IAAI,MAAM,EAAG,QAAO;AAAA,EAChD;AACA,SAAO;AACT;AAEO,SAAS,cACd,KACA,QACA,WACS;AACT,QAAM,OAAO,uBAAuB,IAAI,OAAO,MAAM;AACrD,QAAM,KAAK,IAAI,MAAM,OAAO,IAAI,SAAS;AACzC,MAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,OAAO,UAAW,QAAO;AAElD,QAAM,OAAO,KAAK,UAAU,MAAM,IAAI,MAAM;AAC5C,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,aAAa,KAAK,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AACxF,aAAW,SAAS,YAAY;AAC9B,UAAM,UAAU,KAAK,UAAU,MAAM,IAAI,KAAK;AAC9C,QAAI,SAAS;AACX,cAAQ,WAAW;AACnB,cAAQ,WAAW;AAAA,IACrB;AACA,SAAK,UAAU,QAAQ,KAAK,UAAU,MAAM;AAAA,MAC1C,CAAC,MAAM,EAAE,EAAE,SAAS,UAAU,EAAE,OAAO;AAAA,IACzC;AACA,QAAI,CAAC,KAAK,UAAU,UAAU,SAAS,KAAK,GAAG;AAC7C,WAAK,UAAU,UAAU,KAAK,KAAK;AAAA,IACrC;AAAA,EACF;AAEA,OAAK,UAAU,MAAM,OAAO,MAAM;AAClC,OAAK,UAAU,YAAY,KAAK,UAAU,UAAU,OAAO,CAAC,OAAO,OAAO,MAAM;AAChF,OAAK,UAAU,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,OAAO,MAAM;AAC9F,OAAK,UAAU,YAAY,KAAK,IAAI;AAEpC,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,YAAY,KAAK,IAAI;AAC1B,KAAG,UAAU,MAAM,IAAI,QAAQ,IAAI;AACnC,KAAG,UAAU,UAAU,KAAK,MAAM;AAClC,KAAG,UAAU,YAAY,KAAK,IAAI;AAElC,MAAI,aAAa,OAAO,KAAK,EAAE;AAC/B,MAAI,aAAa,OAAO,GAAG,EAAE;AAC7B,MAAI,MAAM,YAAY,KAAK,IAAI;AAC/B,MAAI,KAAK,mBAAmB,EAAE,QAAQ,aAAa,KAAK,IAAI,UAAU,CAAC;AACvE,SAAO;AACT;AAEO,SAAS,qBACd,KACA,QACA,SACA,WACS;AACT,QAAM,QAAQ,uBAAuB,IAAI,OAAO,MAAM;AACtD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,IAAI,mBAAmB,KAAK;AAC5C,UAAQ,WAAW,QAAQ,EAAE,UAAU,aAAa,WAAW,GAAG,CAAC;AACnE,MAAI,MAAM,YAAY,KAAK,IAAI;AAC/B,MAAI,KAAK,sBAAsB;AAAA,IAC7B,SAAS,MAAM;AAAA,IACf;AAAA,IACA,GAAI,YAAY,SAAY,EAAE,QAAQ,IAAI,CAAC;AAAA,IAC3C,GAAI,cAAc,SAAY,EAAE,UAAU,IAAI,CAAC;AAAA,EACjD,CAAC;AACD,SAAO;AACT;AAEO,SAAS,aACd,KACA,SACA,MAMe;AACf,QAAM,QAAQ,IAAI,MAAM,OAAO,IAAI,OAAO;AAC1C,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,IAAI,mBAAmB,KAAK;AAC5C,QAAM,OAAO,QAAQ,QAAQ;AAAA,IAC3B,OAAO,KAAK;AAAA,IACZ,aAAa,KAAK,eAAe;AAAA,IACjC,MAAM,KAAK,QAAQ;AAAA,IACnB,UAAU,KAAK,YAAY;AAAA,IAC3B,QAAQ;AAAA,EACV,CAAC;AACD,MAAI,MAAM,YAAY,KAAK,IAAI;AAC/B,MAAI,KAAK,mBAAmB,EAAE,SAAS,QAAQ,KAAK,IAAI,WAAW,KAAK,MAAM,CAAC;AAC/E,SAAO,KAAK;AACd;AAEO,SAAS,iBAAiB,KAAgC,QAAyB;AACxF,QAAM,QAAQ,uBAAuB,IAAI,OAAO,MAAM;AACtD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,IAAI,mBAAmB,KAAK;AAC5C,UAAQ,iBAAiB,QAAQ,SAAS;AAC1C,MAAI,gBAAgB,OAAO,GAAG,MAAM,EAAE,IAAI,MAAM,EAAE;AAClD,MAAI,MAAM,WAAW,eAAe,MAAM,WAAW,YAAY,MAAM,WAAW,UAAU;AAC1F,QAAI,MAAM,iBAAiB,IAAI,MAAM,eAAe,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AAClF,QAAI,MAAM,oBAAoB,IAAI,MAAM,kBAAkB,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AACxF,QAAI,MAAM,iBAAiB,IAAI,MAAM,eAAe,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AAClF,QAAI,eAAe,OAAO,MAAM,EAAE;AAClC,QAAI,kBAAkB,OAAO,SAAS;AAAA,EACxC;AACA,MAAI,MAAM,YAAY,KAAK,IAAI;AAC/B,SAAO;AACT;;;AC/HO,SAAS,eAAe,OAAgC;AAC7D,QAAM,QAAqB,CAAC;AAE5B,aAAW,SAAS,MAAM,OAAO,OAAO,GAAG;AACzC,QAAI,MAAM,WAAW,UAAW;AAEhC,UAAM,WAAW,MAAM,UAAU,MAAM,CAAC,UAAU;AAChD,YAAM,MAAM,MAAM,OAAO,IAAI,KAAK;AAClC,aAAO,KAAK,WAAW,eAAe,KAAK,WAAW,aAAa,KAAK,WAAW;AAAA,IACrF,CAAC;AAQD,QAAI,UAAU;AACZ,YAAM,KAAK,KAAK;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,YAAY,EAAE,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,EAAE;AAC5D,QAAM,KAAK,CAAC,GAAG,OAAO,UAAU,EAAE,QAAQ,KAAK,MAAM,UAAU,EAAE,QAAQ,KAAK,EAAE;AAEhF,SAAO;AACT;AAEO,SAAS,gBAAgB,OAAgC;AAC9D,SAAO,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,SAAS;AAC/E;AAEO,SAAS,mBAAmB,YAA2B,OAA8B;AAC1F,QAAM,UAAU,WAAW,KAAK;AAChC,SAAO,QACJ,YAAY,EAAE,QAAQ,CAAC,WAAW,SAAS,EAAE,CAAC,EAC9C;AAAA,IACC,CAAC,MACC,EAAE,WAAW,aAAa,QAAQ,SAAS,EAAE,EAAE;AAAA,EACnD,EACC,KAAK,CAAC,GAAuC,MAA0C;AACtF,UAAM,gBAAgB,EAAE,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,EAAE;AAChE,YAAQ,cAAc,EAAE,QAAQ,KAAK,MAAM,cAAc,EAAE,QAAQ,KAAK;AAAA,EAC1E,CAAC;AACL;AAEO,SAAS,mBAAmB,YAA2B,OAA0B;AACtF,SAAO,WAAW,KAAK,EAAE,YAAY,EAAE,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE;AAC/D;AAEO,SAAS,sBAAsB,YAA2B,OAA0B;AACzF,SAAO,WAAW,KAAK,EAAE,YAAY,EAAE,QAAQ,CAAC,WAAW,EAAE,CAAC,EAAE;AAClE;AAEO,SAAS,gBAAgB,OAA4B;AAC1D,QAAM,YAAY,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;AAClD,SAAO,UAAU;AAAA,IACf,CAAC,MAAM,EAAE,WAAW,eAAe,EAAE,WAAW,aAAa,EAAE,WAAW;AAAA,EAC5E;AACF;AAEO,SAAS,YAAY,OAAmB,YAA0C;AACvF,QAAM,SAAS,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;AAC/C,MAAI,UAAU;AACd,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,SAAS;AACb,MAAI,YAAY;AAChB,MAAI,SAAS;AACb,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,MAAI,iBAAiB;AACrB,MAAI,cAAc;AAClB,MAAI,iBAAiB;AACrB,MAAI,cAAc;AAElB,aAAW,KAAK,QAAQ;AACtB,YAAQ,EAAE,QAAQ;AAAA,MAChB,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF;AAEE;AAAA,IACJ;AACA,sBAAkB,EAAE;AACpB,QAAI,EAAE,iBAAkB,gBAAe,EAAE,mBAAmB;AAE5D,UAAM,UAAU,WAAW,CAAC;AAC5B,UAAM,WAAW,QAAQ,YAAY;AACrC,kBAAc,SAAS;AACvB,sBAAkB,SAAS;AAC3B,mBAAe,SAAS;AAAA,EAC1B;AAEA,QAAM,cAAc,OAAO;AAC3B,QAAM,OAAO,YAAY;AAEzB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,cAAc,IAAI,KAAK,IAAI,KAAK,KAAK,MAAO,OAAO,cAAe,GAAG,CAAC,IAAI;AAAA,IAC3F;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,uBACd,OACA,OACA,QACA,UAKI,CAAC,GACC;AACN,QAAM,WAAW;AAAA,IACf,GAAG,MAAM;AAAA,IACT,mBAAmB;AAAA,IACnB,mBAAmB,QAAQ;AAAA,IAC3B,wBAAwB,QAAQ;AAAA,IAChC,0BAA0B,QAAQ;AAAA,IAClC,kBAAkB,QAAQ;AAAA,IAC1B,sBAAsB,KAAK,IAAI;AAAA,EACjC;AACA,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,YAAY,KAAK,IAAI;AAC7B;AAEO,SAAS,SAAS,MAAc,MAAM,KAAa;AACxD,QAAM,IAAI,KAAK,KAAK;AACpB,SAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,YAAO,EAAE,SAAS,GAAG;AACtE;;;AC/IO,SAAS,YACd,KACA,OACuE;AACvE,QAAM,SAAS,IAAI,eAAe,IAAI,MAAM,EAAE;AAC9C,SAAO,SAAS,EAAE,KAAK,OAAO,KAAK,QAAQ,OAAO,OAAO,IAAI;AAC/D;AAGA,eAAsB,oBACpB,KACA,OACA,OACe;AACf,MAAI,kBAAkB,OAAO,QAAQ;AACrC,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,mBAAmB,KAAK,IAAI,KAAK,MAAM,aAAa,KAAK,IAAI;AACnE,MAAI,cAAc,OAAO,MAAM,EAAE;AACjC,MAAI,MAAM,iBAAiB,IAAI,MAAM,eAAe,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AAClF,MAAI,KAAK,gBAAgB,EAAE,SAAS,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,CAAC;AACvE,MAAI,IAAI,cAAc,OAAO,IAAI,MAAM,KAAK,CAAC;AAC7C,QAAM,sBAAsB,KAAK,KAAK;AACxC;AAWO,SAAS,qBACd,KACA,OACA,OACM;AACN,MAAI,MAAM,WAAW,UAAU;AAC7B,QAAI,MAAM,oBAAoB,IAAI,MAAM,kBAAkB,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AACxF,QAAI,kBAAkB,OAAO,QAAQ;AAAA,EACvC;AACA,MAAI,CAAC,IAAI,MAAM,eAAe,SAAS,MAAM,EAAE,EAAG,KAAI,MAAM,eAAe,KAAK,MAAM,EAAE;AACxF,MAAI,KAAK,gBAAgB,EAAE,SAAS,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,CAAC;AACvE,MAAI,IAAI,cAAc,OAAO,IAAI,MAAM,KAAK,CAAC;AAC/C;AAQA,eAAsB,sBACpB,KACA,OACe;AACf,QAAM,SAAS,IAAI,eAAe,IAAI,MAAM,EAAE;AAC9C,MAAI,CAAC,IAAI,aAAa,CAAC,OAAQ;AAE/B,MAAI;AACF,UAAM,IAAI,UAAU,UAAU,QAAQ,QAAQ,MAAM,IAAI,MAAM,MAAM,EAAE,EAAE;AAAA,EAC1E,QAAQ;AAAA,EAER;AAEA,QAAM,cAAc,MAAM,UACvB,IAAI,CAAC,MAAM,IAAI,kBAAkB,IAAI,CAAC,CAAC,EACvC,OAAO,CAAC,MAA0B,QAAQ,CAAC,CAAC;AAE/C,QAAM,UAAU,YAAY;AAC1B,UAAM,QAAQ,WAAW,WAAW;AAEpC,QAAI;AAAA,MACF,IACG,cAAc,EACd,KAAK,MAAM,SAAS,KAAK,OAAO,MAAM,CAAC,EACvC,MAAM,CAAC,QAAQ;AAId,cAAM,MAAM,eAAe,GAAG;AAC9B,YAAI,OAAO,MAAM,KAAK,EAAE,OAAO,6BAA6B,SAAS,MAAM,GAAG,CAAC;AAC/E,6BAAqB,KAAK,OAAO,GAAG;AAAA,MACtC,CAAC;AAAA,IACL;AACA,UAAM,IAAI,cAAc;AAAA,EAC1B,GAAG;AACH,MAAI,kBAAkB,IAAI,MAAM,IAAI,MAAM;AAC5C;AAOA,eAAe,SACb,KACA,OACA,QACe;AACf,MAAI,CAAC,IAAI,UAAW;AACpB,MAAI;AACF,UAAMA,WAAU,IAAI,IAAI,kBACpB,OAAO,SAAmD;AACxD,YAAM,gBAAgB,MAAM,gCAAgC,KAAK,OAAO,IAAI;AAC5E,UAAI,CAAC,cAAe,QAAO;AAC3B,UAAI,KAAK,2BAA2B;AAAA,QAClC,SAAS,MAAM;AAAA,QACf,MAAM,MAAM;AAAA,QACZ,OAAO,KAAK;AAAA,MACd,CAAC;AACD,YAAM,WAAW,MAAM,IAAI,IAAI,kBAAkB,OAAO,IAAI;AAC5D,aAAO,YAAY;AAAA,IACrB,IACA;AACJ,UAAM,YAGF;AAAA,MACF,QAAQ;AAAA,IACV;AACA,QAAIA,aAAY,OAAW,WAAU,UAAUA;AAC/C,UAAM,SAAS,MAAM,IAAI,UAAU,MAAM,QAAQ,SAAS;AAC1D,QAAI,OAAO,UAAU;AACnB,UAAI,KAAK,0BAA0B,EAAE,SAAS,MAAM,IAAI,MAAM,MAAM,KAAK,CAAC;AAAA,IAC5E;AACA,2BAAuB,IAAI,OAAO,OAAO,OAAO,KAAK,WAAW,gBAAgB;AAAA,MAC9E,QAAQ,OAAO;AAAA,MACf,aAAa,OAAO;AAAA,MACpB,eAAe,OAAO;AAAA,IACxB,CAAC;AAGD,UAAM,IAAI,UAAU,QAAQ,QAAQ,EAAE,MAAM,CAAC,OAAO,GAAG,CAAC;AAAA,EAC1D,SAAS,KAAK;AACZ,2BAAuB,IAAI,OAAO,OAAO,gBAAgB;AAAA,MACvD,QAAQ,OAAO;AAAA,MACf,aAAa,OAAO;AAAA,MACpB,OAAO,eAAe,GAAG;AAAA,IAC3B,CAAC;AAGD,yBAAqB,KAAK,OAAO,0BAA0B,eAAe,GAAG,CAAC,EAAE;AAAA,EAClF;AACF;AAEA,eAAe,gCACb,KACA,OACA,MACkB;AAClB,MAAI,CAAC,IAAI,IAAI,MAAO,QAAO;AAE3B,QAAM,WAAW,MAAM,IAAI,IAAI,MAAM,OAAO;AAAA,IAC1C,IAAI,iBAAiB,MAAM,EAAE;AAAA,IAC7B,QAAQ;AAAA,IACR,UAAU,yDAAyD,MAAM,IAAI;AAAA,IAC7E,SAAS;AAAA,MACP,aAAa,MAAM,EAAE;AAAA,MACrB,qBAAqB,KAAK,cAAc,KAAK,IAAI,KAAK,WAAW;AAAA,MACjE,sBAAsB,KAAK,GAAG;AAAA,IAChC,EAAE,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAgBX,MAAM;AAAA,IACN,UAAU;AAAA,IACV,SAAS;AAAA,MACP;AAAA,QACE,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,aAAa;AAAA,QACb,MAAM;AAAA,MACR;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,aAAa;AAAA,QACb,MAAM;AAAA,QACN,aAAa;AAAA,MACf;AAAA,IACF;AAAA,EACF,CAAC;AAED,QAAM,WAAW;AAAA,IACf,GAAG,MAAM;AAAA,IACT,uBAAuB,SAAS;AAAA,IAChC,yBAAyB,KAAK,IAAI;AAAA,EACpC;AAEA,MAAI,SAAS,SAAS,SAAU,QAAO;AAGvC,SAAO,SAAS,aAAa;AAC/B;AAGA,eAAsB,sBACpB,KACA,OACe;AACf,QAAM,SAAS,IAAI,eAAe,IAAI,MAAM,EAAE;AAC9C,MAAI,CAAC,IAAI,aAAa,CAAC,OAAQ;AAC/B,MAAI;AACF,UAAM,IAAI,UAAU,UAAU,QAAQ,QAAQ,MAAM,IAAI,eAAe,MAAM,EAAE,EAAE;AAAA,EACnF,QAAQ;AAAA,EAER;AACA,yBAAuB,IAAI,OAAO,OAAO,2BAA2B;AAAA,IAClE,QAAQ,OAAO;AAAA,IACf,aAAa,OAAO;AAAA,EACtB,CAAC;AACD,QAAM,IAAI,UAAU,QAAQ,QAAQ,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM,MAAM;AAAA,EAAC,CAAC;AACpE;;;AClQO,SAAS,6BAA6B,OAAyB;AACpE,QAAM,iBAAiB,CAAC;AACxB,aAAW,SAAS,MAAM,OAAO,OAAO,GAAG;AACzC,QAAI,MAAM,WAAW,WAAW;AAC9B,YAAM,SAAS;AACf,YAAM,YAAY,KAAK,IAAI;AAAA,IAC7B;AACA,QAAI,MAAM,WAAW,WAAW;AAC9B,iBAAW,QAAQ,MAAM,UAAU,MAAM,OAAO,GAAG;AACjD,YAAI,KAAK,WAAW,cAAe,MAAK,SAAS;AAAA,MACnD;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,qBAA+B;AAC7C,SAAO;AAAA,IACL,MAAM,MAAM;AAAA,IAAC;AAAA,IACb,IAAI,MAAM,MAAM;AAAA,IAAC;AAAA,IACjB,KAAK,MAAM;AAAA,IAAC;AAAA,IACZ,MAAM,MAAM,MAAM;AAAA,IAAC;AAAA,IACnB,WAAW,oBAAI,IAAI;AAAA,IACnB,WAAW,CAAC;AAAA,IACZ,WAAW,MAAM;AAAA,IAAC;AAAA,IAClB,OAAO,MAAM,MAAM;AAAA,IAAC;AAAA,IACpB,QAAQ,MAAM;AAAA,IAAC;AAAA,IACf,WAAW,YAAY,CAAC;AAAA,IACxB,SAAS,YAAY;AAAA,IAAC;AAAA,EACxB;AACF;;;ACyBO,IAAM,oBAAN,MAAwB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,SAAS;AAAA,EACT,gBAAgB,oBAAI,IAAY;AAAA,EAChC,eAAsD;AAAA,EACtD,eAAe,oBAAI,IAAyB;AAAA,EAC5C,kBAAkB,oBAAI,IAAoB;AAAA;AAAA,EAGjC;AAAA,EACA;AAAA;AAAA,EAEA,iBAAiB,oBAAI,IAA4B;AAAA;AAAA,EAE1D,aAA4B,QAAQ,QAAQ;AAAA;AAAA,EAEnC,oBAAoB,oBAAI,IAA2B;AAAA,EAEpE,YAAY,MAAgC;AAC1C,SAAK,QAAQ,KAAK;AAClB,SAAK,MAAM,KAAK;AAChB,SAAK,SAAS,KAAK,UAAU,mBAAmB;AAChD,SAAK,YAAY,KAAK;AACtB,SAAK,SAAS,KAAK,UAAU;AAC7B,SAAK,OAAO;AAAA,MACV,qBAAqB,KAAK,uBAAuB;AAAA,MACjD,oBAAoB,KAAK,sBAAsB;AAAA,MAC/C,YAAY,KAAK,cAAc;AAAA,MAC/B,mBAAmB,KAAK,qBAAqB;AAAA,MAC7C,YAAY,KAAK,cAAc;AAAA,MAC/B,cAAc,KAAK,gBAAgB;AAAA,MACnC,eAAe,KAAK,iBAAiB;AAAA,MACrC,eAAe,KAAK,iBAAiB;AAAA,MACrC,QAAQ,KAAK;AAAA,IACf;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,QAAuB;AAC3B,SAAK,UAAU;AACf,SAAK,SAAS;AACd,SAAK,mBAAmB;AACxB,SAAK,MAAM,YAAY,KAAK,IAAI;AAChC,SAAK,MAAM,YAAY,KAAK,IAAI;AAGhC,QAAI,cAAc,KAAK,eAAe;AACtC,WAAO,YAAY,SAAS,KAAK,CAAC,KAAK,SAAS;AAC9C,YAAM,KAAK,gBAAgB;AAC3B,UAAI,KAAK,QAAS;AAElB,YAAM,QAAQ,YAAY,MAAM,GAAG,KAAK,KAAK,mBAAmB;AAChE,YAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC;AAGtD,UAAI,KAAK,KAAK,eAAe,GAAG;AAC9B,cAAM,KAAK,MAAM,KAAK,KAAK,YAAY;AAAA,MACzC;AAEA,YAAM,KAAK,gBAAgB;AAC3B,UAAI,KAAK,QAAS;AAGlB,oBAAc,KAAK,eAAe,EAAE;AAAA,QAClC,CAAC,MAAM,CAAC,KAAK,cAAc,IAAI,EAAE,EAAE,KAAK,EAAE,WAAW,eAAe,EAAE,WAAW;AAAA,MACnF;AAAA,IACF;AAIA,UAAM,KAAK,YAAY;AAGvB,QAAI,KAAK,KAAK,YAAY;AACxB,WAAK,eAAe,YAAY,MAAM,KAAK,KAAK,GAAG,GAAI;AAAA,IACzD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,qBAA2B;AACjC,iCAA6B,KAAK,KAAK;AAAA,EACzC;AAAA;AAAA,EAGA,MAAc,cAA6B;AACzC,UAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,kBAAkB,OAAO,CAAC,CAAC;AAC7D,UAAM,KAAK,WAAW,MAAM,CAAC,QAAQ;AACnC,YAAM,MAAM,eAAe,GAAG;AAC9B,WAAK,OAAO,KAAK,KAAK,EAAE,OAAO,kCAAkC,CAAC;AAAA,IACpE,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,QAAc;AACZ,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA,EAGA,SAAe;AACb,SAAK,SAAS;AACd,SAAK,KAAK,EAAE,MAAM,CAAC,QAAQ;AACzB,YAAM,MAAM,eAAe,GAAG;AAC9B,WAAK,OAAO,MAAM,KAAK,EAAE,OAAO,2BAA2B,CAAC;AAAA,IAC9D,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,OAAa;AACX,SAAK,UAAU;AACf,QAAI,KAAK,cAAc;AACrB,oBAAc,KAAK,YAAY;AAC/B,WAAK,eAAe;AAAA,IACtB;AACA,eAAW,WAAW,KAAK,eAAe;AACxC,YAAM,QAAQ,KAAK,MAAM,OAAO,IAAI,OAAO;AAC3C,UAAI,OAAO;AACT,aAAK,kBAAkB,OAAO,QAAQ;AAAA,MACxC;AAAA,IACF;AAEA,QAAI,KAAK,WAAW;AAClB,iBAAW,UAAU,KAAK,UAAU,KAAK,GAAG;AAC1C,aAAK,KAAK,UAAU,QAAQ,QAAQ,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIA,MAAc,OAAsB;AAClC,QAAI,KAAK,WAAW,KAAK,OAAQ;AAEjC,UAAM,SAAS,KAAK,gBAAgB;AACpC,UAAM,SAAS,KAAK,eAAe;AAEnC,SAAK,KAAK,mBAAmB;AAAA,MAC3B,cAAc,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,MACpC,cAAc,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,IACtC,CAAC;AAED,SAAK,IAAI,SAAS,EAAE,cAAc,QAAQ,aAAa,OAAO,CAAC;AAG/D,UAAM,iBAAiB,KAAK,KAAK,sBAAsB,OAAO;AAC9D,QAAI,iBAAiB,KAAK,OAAO,SAAS,GAAG;AAC3C,iBAAW,SAAS,OAAO,MAAM,GAAG,cAAc,GAAG;AACnD,YAAI,MAAM,WAAW,WAAW;AAC9B,gBAAM,KAAK,WAAW,KAAK;AAAA,QAC7B;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,WAAW,GAAG;AACrB,WAAK,gBAAgB;AACrB;AAAA,IACF;AAGA,QAAI,KAAK,KAAK,iBAAiB,KAAK,MAAM,eAAe,SAAS,GAAG;AACnE,YAAM,cAAc,KAAK,MAAM,OAAO,IAAI,KAAK,MAAM,eAAe,CAAC,KAAK,EAAE;AAC5E,UAAI,aAAa;AACf,aAAK,cAAc,WAAW;AAAA,MAChC;AACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIA,MAAc,WAAW,OAAiC;AACxD,QAAI,MAAM,WAAW,aAAa,MAAM,WAAW,QAAS;AAE5D,SAAK,kBAAkB,OAAO,SAAS;AACvC,UAAM,YAAY,KAAK,IAAI;AAC3B,SAAK,cAAc,IAAI,MAAM,EAAE;AAC/B,SAAK,MAAM,eAAe,KAAK,MAAM,EAAE;AAIvC,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,IAAI,MAAM,EAAE,GAAG;AACxD,UAAI;AACF,cAAM,SAAS,MAAM,KAAK,UAAU,SAAS,MAAM,IAAI;AAAA,UACrD,UAAU,MAAM;AAAA,UAChB,YAAY,MAAM;AAAA,QACpB,CAAC;AACD,YAAI,OAAO,WAAW,SAAU,MAAK,eAAe,IAAI,MAAM,IAAI,MAAM;AAAA,MAC1E,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,SAAK,KAAK,iBAAiB,EAAE,SAAS,MAAM,IAAI,MAAM,MAAM,KAAK,CAAC;AAElE,QAAI;AACF,YAAM,KAAK,kBAAkB,KAAK;AAElC,YAAM,cAAc,KAAK,mBAAmB,KAAK;AACjD,YAAM,iBAAiB,KAAK,sBAAsB,KAAK;AAEvD,WAAK,KAAK,sBAAsB;AAAA,QAC9B,SAAS,MAAM;AAAA,QACf,WAAW;AAAA,QACX,QAAQ;AAAA,MACV,CAAC;AAED,UAAI,cAAc,KAAK,KAAK,KAAK,eAAe;AAC9C,cAAM,KAAK,oBAAoB,OAAO,GAAG,WAAW,iBAAiB;AACrE;AAAA,MACF;AAKA,YAAM,UAAU,MAAM,KAAK,cAAc,KAAK;AAC9C,UAAI,CAAC,QAAQ,IAAI;AACf,cAAM,KAAK;AAAA,UACT;AAAA,UACA,sBAAsB,QAAQ,SAAS,KAAK,KAAK,SAAS,QAAQ,MAAM,CAAC,KAAK,EAAE;AAAA,QAClF;AACA;AAAA,MACF;AAEA,WAAK,kBAAkB,OAAO,WAAW;AACzC,YAAM,cAAc,KAAK,IAAI;AAC7B,YAAM,mBAAmB,KAAK,IAAI,KAAK,MAAM,aAAa,KAAK,IAAI;AACnE,WAAK,cAAc,OAAO,MAAM,EAAE;AAClC,WAAK,MAAM,iBAAiB,KAAK,MAAM,eAAe,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AACpF,WAAK,MAAM,kBAAkB,KAAK,MAAM,EAAE;AAC1C,WAAK,KAAK,mBAAmB;AAAA,QAC3B,SAAS,MAAM;AAAA,QACf,MAAM,MAAM;AAAA,QACZ,YAAY,MAAM;AAAA,MACpB,CAAC;AACD,WAAK,IAAI,kBAAkB,KAAK;AAGhC,YAAM,KAAK,sBAAsB,KAAK;AAAA,IACxC,SAAS,OAAO;AACd,WAAK,kBAAkB,OAAO,QAAQ;AACtC,YAAM,cAAc,KAAK,IAAI;AAC7B,YAAM,mBAAmB,KAAK,IAAI,KAAK,MAAM,aAAa,KAAK,IAAI;AACnE,WAAK,cAAc,OAAO,MAAM,EAAE;AAClC,WAAK,MAAM,iBAAiB,KAAK,MAAM,eAAe,OAAO,CAAC,OAAO,OAAO,MAAM,EAAE;AACpF,WAAK,MAAM,eAAe,KAAK,MAAM,EAAE;AACvC,WAAK,KAAK,gBAAgB;AAAA,QACxB,SAAS,MAAM;AAAA,QACf,MAAM,MAAM;AAAA,QACZ,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MAC9D,CAAC;AACD,WAAK,IAAI,cAAc,OAAO,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,CAAC;AACvF,YAAM,KAAK,sBAAsB,KAAK;AAAA,IACxC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAc,cAAc,OAAyE;AACnG,QAAI,CAAC,KAAK,IAAI,YAAa,QAAO,EAAE,IAAI,KAAK;AAC7C,UAAM,MAAM,KAAK,YAAY,KAAK;AAElC,aAAS,UAAU,GAAG,WAAW,KAAK,KAAK,mBAAmB,WAAW;AACvE,UAAI,KAAK,QAAS,QAAO,EAAE,IAAI,OAAO,QAAQ,wCAAwC;AAEtF,WAAK,KAAK,mBAAmB,EAAE,SAAS,MAAM,IAAI,MAAM,MAAM,MAAM,QAAQ,CAAC;AAC7E,UAAI;AACJ,UAAI;AACF,kBAAU,MAAM,KAAK,IAAI,YAAY,OAAO,GAAG;AAAA,MACjD,SAAS,KAAK;AACZ,kBAAU,EAAE,IAAI,OAAO,QAAQ,eAAe,GAAG,EAAE;AAAA,MACrD;AACA,UAAI,QAAQ,GAAI,QAAO,EAAE,IAAI,KAAK;AAElC,WAAK,KAAK,sBAAsB;AAAA,QAC9B,SAAS,MAAM;AAAA,QACf,MAAM,MAAM;AAAA,QACZ;AAAA,QACA,OAAO,QAAQ;AAAA,MACjB,CAAC;AAGD,UAAI,WAAW,KAAK,KAAK,qBAAqB,CAAC,KAAK,IAAI,eAAe,KAAK,SAAS;AACnF,eAAO,EAAE,IAAI,OAAO,QAAQ,QAAQ,OAAO;AAAA,MAC7C;AAEA,WAAK,KAAK,mBAAmB,EAAE,SAAS,MAAM,IAAI,MAAM,MAAM,MAAM,SAAS,UAAU,EAAE,CAAC;AAC1F,UAAI;AACF,cAAM,KAAK,IAAI;AAAA,UACb;AAAA,UACA,QAAQ,UAAU;AAAA,UAClB,UAAU;AAAA,UACV;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAGR;AAAA,IACF;AACA,WAAO,EAAE,IAAI,MAAM;AAAA,EACrB;AAAA;AAAA;AAAA,EAIQ,iBAAqC;AAC3C,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,KAAK,KAAK;AAAA,MACV,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,gBAAgB,KAAK;AAAA,MACrB,mBAAmB,KAAK;AAAA,MACxB,eAAe,KAAK;AAAA,MACpB,eAAe,MAAM,KAAK;AAAA,MAC1B,eAAe,CAAC,UAAU;AACxB,aAAK,aAAa;AAAA,MACpB;AAAA,MACA,MAAM,CAAC,OAAO,YAAY,KAAK,KAAK,OAAO,OAAO;AAAA,MAClD,mBAAmB,CAAC,OAAO,WAAW,KAAK,kBAAkB,OAAO,MAAM;AAAA,IAC5E;AAAA,EACF;AAAA,EAEQ,YAAY,OAAyF;AAC3G,WAAO,YAAY,KAAK,eAAe,GAAG,KAAK;AAAA,EACjD;AAAA,EAEA,MAAc,oBAAoB,OAAkB,OAA8B;AAChF,UAAM,oBAAoB,KAAK,eAAe,GAAG,OAAO,KAAK;AAAA,EAC/D;AAAA;AAAA,EAGQ,SAAS,MAAc,MAAM,KAAa;AAChD,WAAO,SAAS,MAAM,GAAG;AAAA,EAC3B;AAAA;AAAA,EAIA,MAAc,sBAAsB,OAAiC;AACnE,UAAM,sBAAsB,KAAK,eAAe,GAAG,KAAK;AAAA,EAC1D;AAAA;AAAA,EAEA,MAAc,sBAAsB,OAAiC;AACnE,UAAM,sBAAsB,KAAK,eAAe,GAAG,KAAK;AAAA,EAC1D;AAAA,EAEA,MAAc,kBAAkB,OAAiC;AAC/D,UAAM,eAAe,KAAK,mBAAmB,KAAK;AAElD,WAAO,aAAa,SAAS,KAAK,CAAC,KAAK,SAAS;AAC/C,YAAM,QAAQ,aAAa,OAAO,GAAG,KAAK,KAAK,kBAAkB;AAEjE,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,MAAM,IAAI,CAAC,SAAS,KAAK,kBAAkB,MAAM,KAAK,CAAC;AAAA,MACzD;AAEA,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,cAAM,SAAS,QAAQ,CAAC;AACxB,cAAM,OAAO,MAAM,CAAC;AACpB,YAAI,CAAC,UAAU,CAAC,KAAM;AAEtB,YAAI,OAAO,WAAW,aAAa;AACjC,eAAK,kBAAkB,OAAO,IAAI;AAAA,QACpC,OAAO;AACL,eAAK,eAAe,OAAO,MAAM,OAAO,MAAM;AAAA,QAChD;AAAA,MACF;AAEA,YAAM,WAAW,KAAK,mBAAmB,KAAK;AAC9C,mBAAa,SAAS;AACtB,mBAAa,KAAK,GAAG,QAAQ;AAAA,IAC/B;AAAA,EACF;AAAA,EAEA,MAAc,kBAAkB,MAAgB,OAAoC;AAClF,UAAM,UAAU,KAAK,mBAAmB,KAAK;AAC7C,YAAQ,iBAAiB,KAAK,IAAI,aAAa;AAG/C,SAAK,KAAK,qBAAqB;AAAA,MAC7B,SAAS,MAAM;AAAA,MACf,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,WAAW,KAAK;AAAA,IAClB,CAAC;AACD,UAAM,SAAS,KAAK,eAAe,IAAI,MAAM,EAAE;AAC/C,UAAM,cAAc,KAAK,IAAI,YAAY,MAAM,MAAM,IAAI;AAAA,MACvD,KAAK,QAAQ;AAAA,MACb,QAAQ,QAAQ;AAAA,IAClB,CAAC;AAED,QAAI,KAAK,KAAK,gBAAgB,GAAG;AAC/B,YAAM,YAAY,KAAK,KAAK;AAC5B,YAAM,WAAW,uBAAO,WAAW;AACnC,YAAM,SAAS,MAAM,QAAQ,KAAK;AAAA,QAChC;AAAA,QACA,IAAI,QAAyB,CAACC,aAAY;AACxC,gBAAM,QAAQ,WAAW,MAAMA,SAAQ,QAAQ,GAAG,SAAS;AAE3D,sBAAY,KAAK,MAAM,aAAa,KAAK,CAAC,EAAE,MAAM,MAAM,aAAa,KAAK,CAAC;AAAA,QAC7E,CAAC;AAAA,MACH,CAAC;AACD,UAAI,WAAW,UAAU;AACvB,aAAK,KAAK,sBAAsB;AAAA,UAC9B,SAAS,MAAM;AAAA,UACf,QAAQ,KAAK;AAAA,UACb,WAAW,KAAK;AAAA,UAChB;AAAA,QACF,CAAC;AACD,cAAM,IAAI;AAAA,UACR,SAAS,KAAK,KAAK,MAAM,KAAK,EAAE,yBAAyB,SAAS;AAAA,QACpE;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,kBAAkB,OAAkB,MAAsB;AAChE,UAAM,UAAU,KAAK,mBAAmB,KAAK;AAC7C,YAAQ,iBAAiB,KAAK,IAAI,WAAW;AAC7C,SAAK,KAAK,uBAAuB;AAAA,MAC/B,SAAS,MAAM;AAAA,MACf,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB,CAAC;AAAA,EACH;AAAA,EAEQ,eAAe,OAAkB,MAAgB,OAAsB;AAC7E,UAAM,UAAU,KAAK,mBAAmB,KAAK;AAC7C,UAAM,UAAU,GAAG,MAAM,EAAE,IAAI,KAAK,EAAE;AACtC,UAAM,iBAAiB,KAAK,gBAAgB,IAAI,OAAO,KAAK;AAE5D,QAAI,iBAAiB,KAAK,KAAK,YAAY;AACzC,WAAK,gBAAgB,IAAI,SAAS,iBAAiB,CAAC;AACpD,cAAQ;AAAA,QACN,KAAK;AAAA,QACL;AAAA,QACA,SAAS,iBAAiB,CAAC,IAAI,KAAK,KAAK,UAAU;AAAA,MACrD;AACA,WAAK,KAAK,sBAAsB;AAAA,QAC9B,SAAS,MAAM;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,SAAS,iBAAiB;AAAA,QAC1B,YAAY,KAAK,KAAK;AAAA,MACxB,CAAC;AAAA,IACH,OAAO;AACL,cAAQ;AAAA,QACN,KAAK;AAAA,QACL;AAAA,QACA,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MACvD;AACA,WAAK,KAAK,oBAAoB;AAAA,QAC5B,SAAS,MAAM;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF;AAAA;AAAA,EAIQ,iBAA8B;AACpC,WAAO,eAAe,KAAK,KAAK;AAAA,EAClC;AAAA,EAEQ,kBAA+B;AACrC,WAAO,gBAAgB,KAAK,KAAK;AAAA,EACnC;AAAA,EAEQ,mBAAmB,OAA8B;AACvD,WAAO,mBAAmB,CAAC,MAAM,KAAK,mBAAmB,CAAC,GAAG,KAAK;AAAA,EACpE;AAAA,EAEQ,mBAAmB,OAA+B;AACxD,UAAM,SAAS,KAAK,aAAa,IAAI,MAAM,EAAE;AAC7C,QAAI,OAAQ,QAAO;AAEnB,UAAM,UAAU,IAAI,YAAY,EAAE,OAAO,IAAI,iBAAiB,EAAE,CAAC;AACjE,YAAQ,SAAS,MAAM,SAAS;AAChC,SAAK,aAAa,IAAI,MAAM,IAAI,OAAO;AACvC,WAAO;AAAA,EACT;AAAA,EAEQ,mBAAmB,OAA0B;AACnD,WAAO,mBAAmB,CAAC,MAAM,KAAK,mBAAmB,CAAC,GAAG,KAAK;AAAA,EACpE;AAAA,EAEQ,sBAAsB,OAA0B;AACtD,WAAO,sBAAsB,CAAC,MAAM,KAAK,mBAAmB,CAAC,GAAG,KAAK;AAAA,EACvE;AAAA,EAEQ,kBAAkB,OAAkB,QAA2B;AACrE,UAAM,OAAO,MAAM;AACnB,UAAM,SAAS;AACf,UAAM,YAAY,KAAK,IAAI;AAC3B,SAAK,MAAM,YAAY,KAAK,IAAI;AAChC,SAAK,KAAK,sBAAsB,EAAE,SAAS,MAAM,IAAI,MAAM,IAAI,OAAO,CAAC;AAAA,EACzE;AAAA,EAEQ,aAAsB;AAC5B,WAAO,gBAAgB,KAAK,KAAK;AAAA,EACnC;AAAA,EAEQ,kBAAwB;AAC9B,SAAK,MAAM,cAAc,KAAK,IAAI;AAClC,UAAM,aAAa,KAAK,MAAM,eAAe,KAAK,MAAM,aAAa,KAAK,MAAM;AAChF,SAAK,KAAK,mBAAmB,EAAE,SAAS,KAAK,MAAM,IAAI,WAAW,CAAC;AACnE,SAAK,KAAK;AAAA,EACZ;AAAA,EAEQ,cAAc,aAA8B;AAClD,SAAK,KAAK,gBAAgB;AAAA,MACxB,SAAS,KAAK,MAAM;AAAA,MACpB,eAAe,YAAY;AAAA,MAC3B,OAAO,UAAU,YAAY,IAAI;AAAA,IACnC,CAAC;AACD,SAAK,KAAK;AAAA,EACZ;AAAA;AAAA,EAIA,cAA6B;AAC3B,WAAO,YAAY,KAAK,OAAO,CAAC,MAAM,KAAK,mBAAmB,CAAC,CAAC;AAAA,EAClE;AAAA,EAEA,WAAuB;AACrB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,YAAqB;AACnB,WAAO,CAAC,KAAK,WAAW,KAAK,cAAc,OAAO;AAAA,EACpD;AAAA,EAEA,WAAoB;AAClB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAIA,YAAY,SAAiB,SAAuB;AAClD,UAAM,QAAQ,KAAK,MAAM,OAAO,IAAI,OAAO;AAC3C,QAAI,CAAC,MAAO;AACZ,QAAI,CAAC,MAAM,eAAe,SAAS,OAAO,GAAG;AAC3C,YAAM,eAAe,KAAK,OAAO;AACjC,WAAK,KAAK,kBAAkB,EAAE,SAAS,QAAQ,CAAC;AAAA,IAClD;AAAA,EACF;AAAA,EAEA,aAAa,SAAiB,SAAuB;AACnD,UAAM,QAAQ,KAAK,MAAM,OAAO,IAAI,OAAO;AAC3C,QAAI,CAAC,MAAO;AACZ,UAAM,iBAAiB,MAAM,eAAe,OAAO,CAAC,OAAO,OAAO,OAAO;AACzE,SAAK,KAAK,kBAAkB,EAAE,SAAS,QAAQ,CAAC;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAgB,QAAuC;AACrD,WAAO,uBAAuB,KAAK,OAAO,MAAM;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,QAAgB,WAA4B;AACnD,WAAO,cAAc,KAAK,qBAAqB,GAAG,QAAQ,SAAS;AAAA,EACrE;AAAA;AAAA,EAGA,gBAAgB,QAAgB,SAAkB,WAA6B;AAC7E,WAAO,qBAAqB,KAAK,qBAAqB,GAAG,QAAQ,SAAS,SAAS;AAAA,EACrF;AAAA;AAAA,EAGA,QACE,SACA,MAMe;AACf,WAAO,aAAa,KAAK,qBAAqB,GAAG,SAAS,IAAI;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,QAAyB;AACnC,WAAO,iBAAiB,KAAK,qBAAqB,GAAG,MAAM;AAAA,EAC7D;AAAA,EAEQ,uBAAuB;AAC7B,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,cAAc,KAAK;AAAA,MACnB,iBAAiB,KAAK;AAAA,MACtB,gBAAgB,KAAK;AAAA,MACrB,oBAAoB,CAAC,UAAqB,KAAK,mBAAmB,KAAK;AAAA,MACvE,mBAAmB,CAAC,OAAkB,WACpC,KAAK,kBAAkB,OAAO,MAAM;AAAA,MACtC,MAAM,CAAC,OAAe,YACpB,KAAK,KAAK,OAAyB,OAAwC;AAAA,IAC/E;AAAA,EACF;AAAA;AAAA,EAIQ,KAA+B,OAAU,SAAiC;AAChF,IAAC,KAAK,OAAO,KAAmD,OAAO,OAAO;AAAA,EAChF;AAAA,EAEA,MAAc,kBAAiC;AAC7C,WAAO,KAAK,UAAU,CAAC,KAAK,SAAS;AACnC,YAAM,KAAK,MAAM,GAAG;AAAA,IACtB;AAAA,EACF;AAAA,EAEQ,MAAM,IAA2B;AACvC,WAAO,IAAI,QAAQ,CAACA,aAAY,WAAWA,UAAS,EAAE,CAAC;AAAA,EACzD;AACF;;;AClpBO,IAAM,aAAN,MAAiB;AAAA,EACd,QAA2B;AAAA,EAC3B,eAAyC;AAAA,EACzC;AAAA,EACA,mBAA0D;AAAA,EAC1D,cAAoD;AAAA,EAE3C,wBAAwB,CAAC,YAAqB;AAC7D,UAAM,IAAI;AACV,QAAI,KAAK,SAAS,EAAE,YAAY,KAAK,MAAM,IAAI;AAC7C,WAAK,KAAK,aAAa,KAAK,KAAK;AACjC,WAAK,QAAQ;AAAA,IACf;AAAA,EACF;AAAA,EAEiB,qBAAqB,CAAC,YAAqB;AAC1D,UAAM,IAAI;AACV,QAAI,KAAK,SAAS,EAAE,YAAY,KAAK,MAAM,IAAI;AAC7C,YAAM,cAAc,KAAK,MAAM,OAAO,IAAI,EAAE,aAAa;AACzD,UAAI,aAAa;AACf,aAAK,KAAK,SAAS,KAAK,OAAO,aAAa,IAAI,MAAM,EAAE,KAAK,CAAC;AAAA,MAChE;AAGA,UAAI,KAAK,KAAK,eAAe;AAC3B,aAAK,QAAQ;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGQ,uBAA4C;AAAA,EAC5C,oBAAyC;AAAA,EAEjD,YAAY,MAAyB;AACnC,SAAK,OAAO;AAAA,EACd;AAAA,EAEA,MAAM,QAA6B;AAEjC,UAAM,UAAU,IAAI,kBAAkB;AAAA,MACpC,OAAO,KAAK,KAAK;AAAA,MACjB,aAAa,KAAK,KAAK;AAAA,MACvB,QAAQ,KAAK,KAAK;AAAA,MAClB,YAAY,KAAK,KAAK;AAAA,MACtB,eAAe,KAAK,KAAK;AAAA,IAC3B,CAAC;AAED,SAAK,QAAQ,MAAM,QAAQ,MAAM;AAGjC,UAAM,MAA6B;AAAA,MACjC,aAAa,KAAK,KAAK;AAAA,MACvB,OAAO,KAAK,KAAK;AAAA,MACjB,iBAAiB,CAAC,UAAU;AAC1B,aAAK,KAAK,kBAAkB,KAAK;AAAA,MACnC;AAAA,MACA,aAAa,CAAC,OAAO,UAAU;AAC7B,aAAK,KAAK,cAAc,OAAO,KAAK;AAAA,MACtC;AAAA,MACA,QAAQ,CAAC,YAAY;AACnB,aAAK,KAAK,SAAS,OAAO;AAAA,MAC5B;AAAA,IACF;AACA,QAAI,KAAK,KAAK,gBAAgB,OAAW,KAAI,cAAc,KAAK,KAAK;AACrE,QAAI,KAAK,KAAK,gBAAgB,OAAW,KAAI,cAAc,KAAK,KAAK;AACrE,QAAI,KAAK,KAAK,oBAAoB,OAAW,KAAI,kBAAkB,KAAK,KAAK;AAG7E,SAAK,eAAe,IAAI,kBAAkB;AAAA,MACxC,OAAO,KAAK;AAAA,MACZ;AAAA,MACA,qBAAqB,KAAK,KAAK;AAAA,MAC/B,oBAAoB,KAAK,KAAK;AAAA,MAC9B,YAAY,KAAK,KAAK;AAAA,MACtB,mBAAmB,KAAK,KAAK;AAAA,MAC7B,YAAY,KAAK,KAAK;AAAA,MACtB,cAAc,KAAK,KAAK;AAAA,MACxB,eAAe,KAAK,KAAK;AAAA,MACzB,QAAQ,KAAK,KAAK;AAAA,MAClB,WAAW,KAAK,KAAK;AAAA,IACvB,CAAC;AAOD,QAAI,KAAK,KAAK,QAAQ;AACpB,YAAM,MAAM,KAAK,KAAK;AAGtB,YAAM,YAAY,CAAC,OAAe,YAChC,IAAI,GAAG,OAAO,OAAO;AAEvB,WAAK,uBAAuB,UAAU,mBAAmB,KAAK,qBAAqB;AACnF,WAAK,oBAAoB,UAAU,gBAAgB,KAAK,kBAAkB;AAAA,IAC5E;AAEA,UAAM,KAAK,aAAa,MAAM;AAI9B,SAAK,cAAc;AAAA,MACjB,MAAM;AACJ,aAAK,KAAK,aAAa;AAAA,UACrB,aAAa;AAAA,UAAG,SAAS;AAAA,UAAG,OAAO;AAAA,UAAG,SAAS;AAAA,UAAG,QAAQ;AAAA,UAC1D,WAAW;AAAA,UAAG,QAAQ;AAAA,UAAG,SAAS;AAAA,UAAG,iBAAiB;AAAA,UACtD,YAAY;AAAA,UAAG,gBAAgB;AAAA,UAAG,aAAa;AAAA,UAC/C,gBAAgB;AAAA,UAAG,aAAa;AAAA,QAClC,CAAC;AACD,aAAK,KAAK;AAAA,MACZ;AAAA,MACA,KAAK,KAAK,oBAAoB,IAAI,KAAK,KAAK;AAAA,IAC9C;AACA,QAAI,KAAK,KAAK,qBAAqB,UAAa,KAAK,KAAK,oBAAoB,GAAG;AAC/E,mBAAa,KAAK,WAAW;AAC7B,WAAK,cAAc;AAAA,IACrB;AACA,SAAK,aAAa,QAAQ;AAG1B,QAAI,KAAK,KAAK,YAAY;AACxB,WAAK,mBAAmB,YAAY,MAAM;AACxC,cAAM,WAAW,KAAK,cAAc,YAAY;AAChD,YAAI,SAAU,MAAK,KAAK,aAAa,QAAQ;AAAA,MAC/C,GAAG,GAAI;AAAA,IACT;AAEA,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,QAAc;AACZ,SAAK,cAAc,MAAM;AAAA,EAC3B;AAAA,EAEA,SAAe;AACb,SAAK,cAAc,OAAO;AAAA,EAC5B;AAAA,EAEA,OAAa;AACX,SAAK,cAAc,KAAK;AACxB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,cAAoC;AAClC,WAAO,KAAK,cAAc,YAAY,KAAK;AAAA,EAC7C;AAAA,EAEA,WAA8B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,YAAqB;AACnB,WAAO,KAAK,cAAc,UAAU,KAAK;AAAA,EAC3C;AAAA,EAEA,WAAoB;AAClB,WAAO,KAAK,cAAc,SAAS,KAAK;AAAA,EAC1C;AAAA,EAEA,YAAY,SAAiB,SAAuB;AAClD,SAAK,cAAc,YAAY,SAAS,OAAO;AAAA,EACjD;AAAA,EAEA,aAAa,SAAiB,SAAuB;AACnD,SAAK,cAAc,aAAa,SAAS,OAAO;AAAA,EAClD;AAAA,EAEQ,UAAgB;AACtB,QAAI,KAAK,kBAAkB;AACzB,oBAAc,KAAK,gBAAgB;AACnC,WAAK,mBAAmB;AAAA,IAC1B;AACA,QAAI,KAAK,aAAa;AACpB,mBAAa,KAAK,WAAW;AAC7B,WAAK,cAAc;AAAA,IACrB;AAEA,SAAK,uBAAuB;AAC5B,SAAK,uBAAuB;AAC5B,SAAK,oBAAoB;AACzB,SAAK,oBAAoB;AAAA,EAC3B;AACF;AAKA,eAAsB,8BACpB,WACA,SAIqB;AACrB,QAAM,QAAQ,MAAM,kBAAkB,cAAc,WAAW;AAAA,IAC7D,OAAO,QAAQ,SAAS,UAAU;AAAA,IAClC,eAAe,QAAQ;AAAA,EACzB,CAAC;AAGD,QAAM,SAA0B,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO;AAAA,IAC5E,MAAM,EAAE;AAAA,IACR,aAAa,EAAE;AAAA,IACf,UAAU,EAAE;AAAA,IACZ,eAAe,EAAE;AAAA,IACjB,gBAAgB,EAAE;AAAA,EACpB,EAAE;AAEF,SAAO,IAAI,WAAW;AAAA,IACpB,GAAG;AAAA,IACH,OAAO,QAAQ,SAAS,UAAU;AAAA,IAClC;AAAA,EACF,CAAC;AACH;;;AC9QA,SAAS,cAAc,gBAAgB;AACvC,YAAYC,WAAU;AACtB,SAAS,qBAAqB;AAO9B,IAAM,YAAY,oBAAI,IAAoB;AAG1C,IAAI;AAEG,SAAS,2BAA2B,cAA8B;AACvE,QAAM,SAAS,UAAU,IAAI,YAAY;AACzC,MAAI,WAAW,OAAW,QAAO;AAEjC,MAAI,WAAW;AACf,aAAW,QAAQ,0BAA0B,GAAG;AAC9C,QAAI;AACF,iBAAW,aAAkB,WAAK,MAAM,YAAY,GAAG,MAAM,EAAE,QAAQ;AACvE;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,YAAU,IAAI,cAAc,QAAQ;AACpC,SAAO;AACT;AAEO,SAAS,0BACd,UACA,QACQ;AACR,SAAO,SAAS;AAAA,IAAQ;AAAA,IAAoC,CAAC,OAAO,QAClE,OAAO,OAAO,QAAQ,GAAG,IAAK,OAAO,GAAG,KAAK,KAAM;AAAA,EACrD;AACF;AAEA,SAAS,4BAAsC;AAC7C,MAAI,mBAAmB,OAAW,QAAO;AACzC,QAAM,OAAY,cAAQ,cAAc,YAAY,GAAG,CAAC;AACxD,QAAM,aAAa;AAAA,IACZ,cAAQ,MAAM,oBAAoB;AAAA,IAClC,cAAQ,MAAM,iBAAiB;AAAA,IAC/B,cAAQ,MAAM,cAAc;AAAA,EACnC;AACA,mBAAiB,WAAW,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC,IAAI,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;AAC5F,SAAO;AACT;AAEA,SAAS,YAAY,WAA4B;AAC/C,MAAI;AACF,WAAO,SAAS,SAAS,EAAE,YAAY;AAAA,EACzC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ACOA,IAAM,mBAA0C,oBAAI,IAAI;AAAA,EACtD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,IAAM,mBAA8C,oBAAI,IAAI;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKM,IAAM,cAAN,MAAkB;AAAA,EACvB,YAA6B,MAA0B;AAA1B;AAAA,EAA2B;AAAA,EAA3B;AAAA;AAAA,EAG7B,MAAM,OAAgC;AACpC,UAAM,SAAS,KAAK,YAAY;AAChC,UAAM,MAAM,MAAM,KAAK,KAAK,QAAQ,MAAM;AAC1C,UAAM,EAAE,QAAQ,SAAS,IAAI,KAAK,MAAM,GAAG;AAE3C,UAAM,aAAa,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,EAAE,eAAe,UAAU,IAAI,CAAC;AAChF,UAAM,sBAAsB,aAAa,IAAI,aAAa,IAAI,MAAO;AAErE,UAAM,WAAW,KAAK,KAAK,iBAAiB;AAC5C,QAAI,iBAAiB;AACrB,QAAI,WAAW,KAAK,aAAa,UAAU;AACzC,eAAS;AAAA,QACP,YAAY,UAAU,wCAAwC,QAAQ;AAAA,MAExE;AACA,uBAAiB;AAAA,IACnB;AACA,WAAO,EAAE,QAAQ,KAAK,aAAa,OAAO,WAAW,GAAG,UAAU,qBAAqB,eAAe;AAAA,EACxG;AAAA;AAAA,EAGA,cAAsB;AACpB,UAAM,OAAO,KAAK,KAAK,aAAa;AACpC,UAAM,OAAO,KAAK,KAAK,aAAa;AACpC,UAAM,QAAQ,KAAK,KAAK,iBAAiB;AACzC,UAAM,MAAM,KAAK,KAAK,gBAAgB,KAAK;AAE3C,WAAO,0BAA0B,2BAA2B,uBAAuB,GAAG;AAAA,MACpF,WAAW,OAAO,IAAI;AAAA,MACtB,WAAW,OAAO,IAAI;AAAA,MACtB,eAAe,OAAO,KAAK;AAAA,MAC3B,MAAM,KAAK,KAAK;AAAA,MAChB,gBAAgB,MAAM;AAAA;AAAA,EAAuB,GAAG;AAAA,IAAO;AAAA,IACzD,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAIA,MAAM,KAA8D;AAClE,UAAM,OAAO,iBAAiB,GAAG;AACjC,QAAI,CAAC,KAAM,QAAO,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,qCAAqC,EAAE;AAClF,QAAI;AACJ,QAAI;AACF,aAAO,KAAK,MAAM,IAAI;AAAA,IACxB,QAAQ;AACN,aAAO,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,wCAAwC,EAAE;AAAA,IAC5E;AACA,QAAI,CAAC,MAAM,QAAQ,IAAI,EAAG,QAAO,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,kCAAkC,EAAE;AAC9F,UAAM,WAAqB,CAAC;AAC5B,UAAM,SAA0B,CAAC;AACjC,eAAW,SAAS,MAAM;AACxB,YAAM,SAAS,KAAK,YAAY,KAAK;AACrC,UAAI,QAAQ;AACV,eAAO,KAAK,OAAO,KAAK;AACxB,iBAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,MAClC;AAAA,IACF;AACA,WAAO,EAAE,QAAQ,SAAS;AAAA,EAC5B;AAAA,EAEQ,YAAY,OAAqE;AACvF,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,UAAM,IAAI;AACV,UAAM,OAAO,OAAO,EAAE,SAAS,WAAW,EAAE,KAAK,KAAK,IAAI;AAC1D,QAAI,CAAC,KAAM,QAAO;AAClB,UAAM,IAAc,CAAC;AACrB,UAAM,WAAW,MAAM,QAAQ,EAAE,KAAK,IAClC,EAAE,QACF,MAAM,QAAQ,EAAE,aAAa,IAC3B,EAAE,gBACF,CAAC;AAEP,UAAM,gBAAqC,CAAC;AAC5C,eAAW,KAAK,UAAU;AACxB,YAAM,SAAS,KAAK,WAAW,CAAC;AAChC,UAAI,QAAQ;AACV,sBAAc,KAAK,OAAO,IAAI;AAC9B,UAAE,KAAK,GAAG,OAAO,QAAQ;AAAA,MAC3B;AAAA,IACF;AAEA,UAAM,kBAAkB,eAAe,EAAE,QAAQ;AACjD,QAAI,OAAO,EAAE,aAAa,YAAY,oBAAoB,EAAE,UAAU;AACpE,QAAE,KAAK,YAAY,OAAO,0BAA0B,OAAO,EAAE,QAAQ,IAAI,uBAAuB,kBAAkB,GAAG;AAAA,IACvH;AACA,WAAO;AAAA,MACL,OAAO;AAAA,QACL;AAAA,QACA,aAAa,OAAO,EAAE,gBAAgB,WAAW,EAAE,cAAc;AAAA,QACjE,UAAU;AAAA,QACZ,eAAe,YAAY,EAAE,eAAe,CAAC;AAAA,QAC7C,gBAAgB,EAAE,mBAAmB;AAAA,QACrC;AAAA,MACA;AAAA,MACA,UAAU;AAAA,IACZ;AAAA,EACF;AAAA,EAEQ,WAAW,GAAoE;AACrF,QAAI,CAAC,KAAK,OAAO,MAAM,SAAU,QAAO;AACxC,UAAM,IAAI;AACV,UAAM,QAAQ,OAAO,EAAE,UAAU,WAAW,EAAE,MAAM,KAAK,IAAI;AAC7D,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,IAAc,CAAC;AACrB,QAAI,OAAiB;AACrB,QAAI,OAAO,EAAE,SAAS,UAAU;AAC9B,UAAI,iBAAiB,IAAI,EAAE,IAAgB,GAAG;AAC5C,eAAO,EAAE;AAAA,MACX,OAAO;AACL,UAAE,KAAK,WAAW,QAAQ,sBAAsB,EAAE,OAAO,4BAA4B;AAAA,MACvF;AAAA,IACF;AACA,UAAM,kBAAkB,eAAe,EAAE,QAAQ;AACjD,QAAI,OAAO,EAAE,aAAa,YAAY,oBAAoB,EAAE,UAAU;AACpE,QAAE,KAAK,WAAW,QAAQ,0BAA0B,OAAO,EAAE,QAAQ,IAAI,uBAAuB,kBAAkB,GAAG;AAAA,IACvH;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,QACJ;AAAA,QACA,aAAa,OAAO,EAAE,gBAAgB,WAAW,EAAE,cAAc;AAAA,QACjE;AAAA,QACA,UAAU;AAAA,QACZ,eAAe,YAAY,EAAE,eAAe,CAAC;AAAA,QAC7C,MAAM,MAAM,QAAQ,EAAE,IAAI,IAAI,EAAE,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,MACpD;AAAA,MACA,UAAU;AAAA,IACZ;AAAA,EACF;AACF;AAIA,SAAS,eAAe,OAA8B;AACpD,SAAO,iBAAiB,IAAI,KAAqB,IAAK,QAAyB;AACjF;AAEA,SAAS,YAAY,OAAgB,UAA0B;AAC7D,QAAM,IAAI,OAAO,KAAK;AACtB,SAAO,OAAO,SAAS,CAAC,KAAK,IAAI,IAAI,IAAI;AAC3C;AAOO,SAAS,iBAAiB,MAA6B;AAE5D,QAAM,QAAQ,KAAK,MAAM,+BAA+B;AACxD,QAAM,aAAuB,CAAC;AAC9B,MAAI,QAAQ,CAAC,EAAG,YAAW,KAAK,MAAM,CAAC,CAAC;AACxC,aAAW,KAAK,IAAI;AAEpB,aAAW,aAAa,YAAY;AAClC,UAAM,WAAW,mBAAmB,SAAS;AAC7C,QAAI,SAAU,QAAO;AAAA,EACvB;AACA,SAAO;AACT;AAGA,SAAS,mBAAmB,MAA6B;AACvD,QAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,MAAI,UAAU,GAAI,QAAO;AAEzB,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,UAAU;AACd,WAAS,IAAI,OAAO,IAAI,KAAK,QAAQ,KAAK;AACxC,UAAM,KAAK,KAAK,CAAC,KAAK;AACtB,QAAI,UAAU;AACZ,UAAI,SAAS;AACX,kBAAU;AAAA,MACZ,WAAW,OAAO,MAAM;AACtB,kBAAU;AAAA,MACZ,WAAW,OAAO,KAAK;AACrB,mBAAW;AAAA,MACb;AACA;AAAA,IACF;AACA,QAAI,OAAO,KAAK;AACd,iBAAW;AAAA,IACb,WAAW,OAAO,KAAK;AACrB;AAAA,IACF,WAAW,OAAO,KAAK;AACrB;AACA,UAAI,UAAU,GAAG;AACf,eAAO,KAAK,MAAM,OAAO,IAAI,CAAC;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;AC3OO,IAAM,eAAN,MAAmB;AAAA,EACxB,YAA6B,MAA2B;AAA3B;AAAA,EAA4B;AAAA,EAA5B;AAAA;AAAA,EAG7B,MAAM,SAAoC;AACxC,UAAM,SAAS,KAAK,YAAY;AAChC,UAAM,MAAM,MAAM,KAAK,KAAK,QAAQ,MAAM;AAC1C,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB;AAAA;AAAA,EAGA,cAAsB;AACpB,WAAO;AAAA,MACL,2BAA2B,uBAAuB;AAAA,MAClD,EAAE,MAAM,KAAK,KAAK,KAAK;AAAA,IACzB;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,KAA+B;AACnC,UAAM,OAAO,kBAAkB,GAAG;AAClC,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,QACL,WAAW;AAAA,QACX,iBAAiB;AAAA,QACjB,aAAa;AAAA,QACb,qBAAqB;AAAA,QACrB,UAAU,CAAC;AAAA,QACX;AAAA,QACA,aAAa;AAAA,QACb,YAAY;AAAA,MACd;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AACF,aAAO,KAAK,MAAM,IAAI;AAAA,IACxB,QAAQ;AACN,aAAO;AAAA,QACL,WAAW;AAAA,QACX,iBAAiB;AAAA,QACjB,aAAa;AAAA,QACb,qBAAqB;AAAA,QACrB,UAAU,CAAC;AAAA,QACX;AAAA,QACA,aAAa;AAAA,QACb,YAAY;AAAA,MACd;AAAA,IACF;AAEA,WAAO;AAAA,MACL,WAAW,KAAK,cAAc;AAAA,MAC9B,iBAAiB,OAAO,KAAK,oBAAoB,WAAW,KAAK,kBAAkB;AAAA,MACnF,aAAa,OAAO,KAAK,gBAAgB,WAAW,KAAK,cAAc;AAAA,MACvE,qBACE,OAAO,KAAK,wBAAwB,WAAW,KAAK,sBAAsB;AAAA,MAC5E,UAAU,MAAM,QAAQ,KAAK,QAAQ,IACjC,KAAK,SAAS,OAAO,CAAC,MAA4B,OAAO,MAAM,QAAQ,IACvE,CAAC;AAAA,MACL;AAAA,MACA,aAAa;AAAA,IACf;AAAA,EACF;AACF;AASA,SAAS,kBAAkB,MAA6B;AAEtD,QAAM,QAAQ,KAAK,MAAM,+BAA+B;AACxD,QAAM,aAAuB,CAAC;AAC9B,MAAI,QAAQ,CAAC,EAAG,YAAW,KAAK,MAAM,CAAC,CAAC;AACxC,aAAW,KAAK,IAAI;AAEpB,aAAW,aAAa,YAAY;AAClC,UAAM,WAAW,oBAAoB,SAAS;AAC9C,QAAI,SAAU,QAAO;AAAA,EACvB;AACA,SAAO;AACT;AAGA,SAAS,oBAAoB,MAA6B;AACxD,QAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,MAAI,UAAU,GAAI,QAAO;AAEzB,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,UAAU;AACd,WAAS,IAAI,OAAO,IAAI,KAAK,QAAQ,KAAK;AACxC,UAAM,KAAK,KAAK,CAAC,KAAK;AACtB,QAAI,UAAU;AACZ,UAAI,SAAS;AACX,kBAAU;AAAA,MACZ,WAAW,OAAO,MAAM;AACtB,kBAAU;AAAA,MACZ,WAAW,OAAO,KAAK;AACrB,mBAAW;AAAA,MACb;AACA;AAAA,IACF;AACA,QAAI,OAAO,KAAK;AACd,iBAAW;AAAA,IACb,WAAW,OAAO,KAAK;AACrB;AAAA,IACF,WAAW,OAAO,KAAK;AACrB;AACA,UAAI,UAAU,GAAG;AACf,eAAO,KAAK,MAAM,OAAO,IAAI,CAAC;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ACMO,IAAM,oBAA+C;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;;;ACjMA,YAAYC,UAAS;AACrB,YAAYC,WAAU;;;ACAtB;AAAA,EAEE;AAAA,OAEK;AAKP,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;;;AD3B7B,IAAM,sBAAsB;AA4ErB,IAAM,aAAN,MAAiB;AAAA,EACb;AAAA,EACQ;AAAA,EAEjB,YAAY,MAAyB;AACnC,SAAK,UAAU,KAAK;AACpB,SAAK,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAA,MAChD,CAAC,QAAa,cAAQ,GAAG,MAAW,cAAQ,KAAK,OAAO;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,MAAM,KAAK,OAAkC;AAC3C,UAAM,WAAW,KAAK,YAAY,MAAM,EAAE;AAC1C,UAAM,aAAa,KAAK,eAAe,KAAK;AAE5C,UAAM,aAAa,UAAU,YAAY;AACvC,YAAM,YAAY,UAAU,KAAK,UAAU,YAAY,MAAM,CAAC,GAAG,EAAE,MAAM,IAAM,CAAC;AAAA,IAClF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,KAAK,SAA6C;AACtD,UAAM,WAAW,KAAK,YAAY,OAAO;AACzC,UAAM,UAAU,MAAM,KAAK,aAAa,QAAQ;AAChD,QAAI,QAAS,QAAO;AACpB,eAAW,aAAa,KAAK,gBAAgB;AAC3C,YAAM,aAAkB,WAAK,WAAW,GAAG,OAAO,OAAO;AACzD,YAAM,SAAS,MAAM,KAAK,aAAa,UAAU;AACjD,UAAI,CAAC,OAAQ;AACb,UAAI;AACF,cAAM,KAAK,KAAK,MAAM;AACtB,cAAM,KAAK,yBAAyB,WAAW,UAAU;AAAA,MAC3D,QAAQ;AACN,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAAO,SAAgC;AAC3C,UAAM,QAAQ;AAAA,MACZ,KAAK,YAAY,OAAO;AAAA,MACxB,GAAG,KAAK,eAAe,IAAI,CAAC,QAAa,WAAK,KAAK,GAAG,OAAO,OAAO,CAAC;AAAA,IACvE;AACA,UAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,aAAiB,YAAO,QAAQ,EAAE,MAAM,MAAM,MAAS,CAAC,CAAC;AAAA,EACxF;AAAA,EAEA,MAAM,OAAyF;AAC7F,QAAI;AACF,YAAM,KAAK,oBAAoB;AAC/B,YAAM,UAAU,MAAU,aAAQ,KAAK,SAAS,EAAE,eAAe,KAAK,CAAC;AACvE,YAAM,SAAkF,CAAC;AAEzF,iBAAW,SAAS,SAAS;AAC3B,YAAI,CAAC,MAAM,OAAO,KAAK,CAAC,MAAM,KAAK,SAAS,OAAO,EAAG;AACtD,YAAI;AACF,gBAAM,MAAM,MAAU,cAAc,WAAK,KAAK,SAAS,MAAM,IAAI,GAAG,MAAM;AAC1E,gBAAM,aAAa,KAAK,MAAM,GAAG;AACjC,gBAAM,OAAO,WAAW,kBAAkB;AAC1C,gBAAM,QAAQ,WAAW,OAAO;AAChC,iBAAO,KAAK;AAAA,YACV,IAAI,WAAW;AAAA,YACf,OAAO,WAAW;AAAA,YAClB,WAAW,WAAW;AAAA,YACtB,QAAQ,SAAS,QAAQ,cAAc,OAAO,IAAI,gBAAgB;AAAA,UACpE,CAAC;AAAA,QACH,QAAQ;AAAA,QAER;AAAA,MACF;AAEA,aAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAAA,IACxD,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA,EAEQ,YAAY,SAAyB;AAC3C,WAAY,WAAK,KAAK,SAAS,GAAG,OAAO,OAAO;AAAA,EAClD;AAAA,EAEA,MAAc,aAAa,UAA8C;AACvE,QAAI;AACF,YAAM,MAAM,MAAU,cAAS,UAAU,MAAM;AAC/C,YAAM,aAAa,KAAK,MAAM,GAAG;AACjC,aAAO,KAAK,iBAAiB,UAAU;AAAA,IACzC,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,sBAAqC;AACjD,eAAW,aAAa,KAAK,gBAAgB;AAC3C,YAAM,UAAU,MAAU,aAAQ,WAAW,EAAE,eAAe,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AACpF,iBAAW,SAAS,SAAS;AAC3B,YAAI,CAAC,MAAM,OAAO,KAAK,CAAC,MAAM,KAAK,SAAS,OAAO,EAAG;AACtD,cAAM,aAAkB,WAAK,WAAW,MAAM,IAAI;AAClD,cAAM,cAAc,KAAK,YAAiB,eAAS,MAAM,MAAM,OAAO,CAAC;AACvE,YAAI,MAAM,KAAK,WAAW,WAAW,GAAG;AACtC,gBAAM,KAAK,yBAAyB,WAAW,UAAU;AACzD;AAAA,QACF;AACA,cAAM,QAAQ,MAAM,KAAK,aAAa,UAAU;AAChD,YAAI,CAAC,MAAO;AACZ,cAAM,KAAK,KAAK,KAAK;AACrB,cAAM,KAAK,yBAAyB,WAAW,UAAU;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,WAAW,UAAoC;AAC3D,QAAI;AACF,YAAU,YAAO,QAAQ;AACzB,aAAO;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,yBAAyB,WAAmB,YAAmC;AAC3F,UAAU,YAAO,UAAU,EAAE,MAAM,MAAM,MAAS;AAClD,UAAU,WAAM,SAAS,EAAE,MAAM,MAAM,MAAS;AAAA,EAClD;AAAA,EAEQ,eAAe,OAAyC;AAC9D,WAAO;AAAA,MACL,SAAS;AAAA,MACT,IAAI,MAAM;AAAA,MACV,OAAO,MAAM;AAAA,MACb,aAAa,MAAM;AAAA,MACnB,QAAQ,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,CAAC;AAAA,MAC3E,cAAc,MAAM;AAAA,MACpB,gBAAgB,MAAM;AAAA,MACtB,mBAAmB,MAAM;AAAA,MACzB,gBAAgB,MAAM;AAAA,MACtB,YAAY,MAAM;AAAA,MAClB,gBAAgB,MAAM;AAAA,MACtB,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,aAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAAA,EAEQ,eAAe,OAAuC;AAC5D,WAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,MAAM,MAAM;AAAA,MACZ,aAAa,MAAM;AAAA,MACnB,QAAQ,MAAM;AAAA,MACd,WAAW,KAAK,mBAAmB,MAAM,SAAS;AAAA,MAClD,WAAW,MAAM;AAAA,MACjB,YAAY,MAAM;AAAA,MAClB,gBAAgB,MAAM;AAAA,MACtB,UAAU,MAAM;AAAA,MAChB,eAAe,MAAM;AAAA,MACrB,kBAAkB,MAAM;AAAA,MACxB,WAAW,MAAM;AAAA,MACjB,aAAa,MAAM;AAAA,MACnB,gBAAgB,MAAM;AAAA,MACtB,UAAU,MAAM;AAAA,MAChB,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,IACnB;AAAA,EACF;AAAA,EAEQ,mBAAmB,OAAuC;AAChE,WAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,QAAQ,MAAM;AAAA,MACd,OAAO,MAAM;AAAA,MACb,OAAO,MAAM,KAAK,MAAM,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,kBAAkB,CAAC,CAAC;AAAA,MAC5E,OAAO,MAAM;AAAA,MACb,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,IACnB;AAAA,EACF;AAAA,EAEQ,kBAAkB,MAAoC;AAC5D,WAAO,EAAE,GAAG,KAAK;AAAA,EACnB;AAAA,EAEQ,iBAAiB,YAA8C;AAErE,UAAM,cAAc,WAAW,WAAW;AAC1C,QAAI,cAAc,qBAAqB;AACrC,YAAM,IAAI;AAAA,QACR,yCAAyC,WAAW,oCAC7B,mBAAmB;AAAA,MAC5C;AAAA,IACF;AAEA,UAAM,SAAS,oBAAI,IAAuB;AAC1C,eAAW,MAAM,WAAW,QAAQ;AAClC,aAAO,IAAI,GAAG,IAAI,KAAK,iBAAiB,EAAE,CAAC;AAAA,IAC7C;AAEA,WAAO;AAAA,MACL,IAAI,WAAW;AAAA,MACf,OAAO,WAAW;AAAA,MAClB,aAAa,WAAW;AAAA,MACxB;AAAA,MACA,cAAc,WAAW;AAAA,MACzB,gBAAgB,WAAW;AAAA,MAC3B,mBAAmB,WAAW;AAAA,MAC9B,gBAAgB,WAAW;AAAA,MAC3B,YAAY,WAAW;AAAA,MACvB,gBAAgB,WAAW;AAAA,MAC3B,WAAW,WAAW;AAAA,MACtB,WAAW,WAAW;AAAA,MACtB,WAAW,WAAW;AAAA,MACtB,aAAa,WAAW;AAAA,IAC1B;AAAA,EACF;AAAA,EAEQ,iBAAiB,YAA4C;AACnE,WAAO;AAAA,MACL,IAAI,WAAW;AAAA,MACf,MAAM,WAAW;AAAA,MACjB,aAAa,WAAW;AAAA,MACxB,QAAQ,WAAW;AAAA,MACnB,WAAW,KAAK,qBAAqB,WAAW,SAAS;AAAA,MACzD,WAAW,WAAW;AAAA,MACtB,YAAY,WAAW;AAAA,MACvB,gBAAgB,WAAW;AAAA,MAC3B,UAAU,WAAW;AAAA,MACrB,eAAe,WAAW;AAAA,MAC1B,kBAAkB,WAAW;AAAA,MAC7B,WAAW,WAAW;AAAA,MACtB,aAAa,WAAW;AAAA,MACxB,gBAAgB,WAAW;AAAA,MAC3B,UAAU,WAAW;AAAA,MACrB,WAAW,WAAW;AAAA,MACtB,WAAW,WAAW;AAAA,IACxB;AAAA,EACF;AAAA,EAEQ,qBAAqB,YAA4C;AACvE,UAAM,QAAQ,oBAAI,IAAsB;AACxC,eAAW,MAAM,WAAW,OAAO;AACjC,YAAM,IAAI,GAAG,IAAI,EAAc;AAAA,IACjC;AAEA,WAAO;AAAA,MACL,IAAI,WAAW;AAAA,MACf,QAAQ,WAAW;AAAA,MACnB,OAAO,WAAW;AAAA,MAClB;AAAA,MACA,OAAO,WAAW,SAAS,CAAC;AAAA,MAC5B,WAAW,WAAW,aAAa,CAAC;AAAA,MACpC,WAAW,WAAW;AAAA,MACtB,WAAW,WAAW;AAAA,IACxB;AAAA,EACF;AACF;;;AExVA,YAAYC,UAAS;;;ACArB,SAAS,kBAAkB;AAC3B,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAYC,WAAU;AAuJf,SAAS,qBAAqB,SAAyB;AAC5D,QAAM,eAAoB,cAAQ,OAAO;AACzC,QAAM,SAAc,WAAK,cAAc,MAAM;AAE7C,MAAI;AACF,QAAI,CAAI,YAAS,MAAM,EAAE,OAAO,EAAG,QAAO;AAE1C,UAAM,aAAgB,gBAAa,QAAQ,MAAM,EAAE,KAAK;AACxD,UAAM,QAAQ,oBAAoB,KAAK,UAAU;AACjD,QAAI,CAAC,QAAQ,CAAC,EAAG,QAAO;AAExB,UAAM,SAAc,cAAQ,cAAc,MAAM,CAAC,EAAE,KAAK,CAAC;AACzD,UAAM,gBAAqB,WAAK,QAAQ,WAAW;AACnD,QAAI,CAAI,YAAS,aAAa,EAAE,OAAO,EAAG,QAAO;AAEjD,UAAM,YAAiB,cAAQ,QAAW,gBAAa,eAAe,MAAM,EAAE,KAAK,CAAC;AAIpF,QAAS,eAAS,SAAS,EAAE,YAAY,MAAM,OAAQ,QAAO;AAC9D,WAAY,cAAQ,SAAS;AAAA,EAC/B,QAAQ;AAGN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,YAAY,SAAyB;AACnD,SAAO,WAAW,QAAQ,EAAE,OAAO,qBAAqB,OAAO,CAAC,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AAC7F;AAMO,SAAS,YAAY,SAAyB;AACnD,QAAM,eAAe,qBAAqB,OAAO;AACjD,QAAM,OAAO,QAAa,eAAS,YAAY,CAAC;AAChD,QAAM,OAAO,WAAW,QAAQ,EAAE,OAAO,YAAY,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,CAAC;AAC/E,SAAO,GAAG,IAAI,IAAI,IAAI;AACxB;AAGA,SAAS,QAAQ,MAAsB;AACrC,SACE,KACG,YAAY,EAEZ,QAAQ,eAAe,GAAG,EAC1B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,EAAE,KAAK;AAEvB;AAYO,SAAS,gBAAgB,MAAkC;AAChE,QAAM,QAAQ,QAAQ,IAAI,QAAQ,WAAW,GAAG,EAAE,QAAQ,SAAS,GAAG,EAAE,KAAK;AAC7E,SAAO,QAAQ;AACjB;AAMO,SAAS,kBAAkB,YAA4B;AAC5D,MAAI;AACF,UAAM,SAAS,KAAK,MAAS,gBAAkB,WAAK,YAAY,aAAa,GAAG,MAAM,CAAC;AAGvF,WAAO,gBAAgB,OAAO,OAAO,kBAAkB,WAAW,OAAO,gBAAgB,MAAS;AAAA,EACpG,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAcO,SAAS,mBAA2B;AACzC,QAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,MAAI,WAAW,QAAQ,KAAK,EAAE,SAAS,EAAG,QAAY,cAAQ,OAAO;AACrE,SAAY,WAAQ,WAAQ,GAAG,aAAa;AAC9C;AAEO,SAAS,mBAAmB,MAAsC;AAGvE,QAAM,aACJ,KAAK,eAAe,KAAK,WAAgB,WAAK,KAAK,UAAU,aAAa,IAAI,iBAAiB;AAKjG,QAAM,UAAU,KAAK,YAAe,WAAQ;AAC5C,QAAM,cAAc,gBAAgB,KAAK,eAAe,kBAAkB,UAAU,CAAC;AACrF,QAAM,aAAkB,WAAK,YAAY,YAAY,WAAW;AAChE,QAAM,OAAO,YAAY,KAAK,WAAW;AACzC,QAAM,OAAO,YAAY,KAAK,WAAW;AACzC,QAAM,aAAkB,WAAK,YAAY,YAAY,IAAI;AACzD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,KAAK;AAAA,IAClB;AAAA,IACA,WAAW;AAAA,IACX,cAAmB,WAAK,YAAY,aAAa;AAAA,IACjD,aAAkB,WAAK,YAAY,UAAU;AAAA,IAC7C,eAAe,CAAC,SAAiB;AAC/B,aAAY,WAAK,YAAY,YAAY,gBAAgB,IAAI,GAAG,aAAa;AAAA,IAC/E;AAAA,IACA,yBAAyB,CAAC,SAAiB;AACzC,aAAY,WAAK,YAAY,YAAY,gBAAgB,IAAI,GAAG,iBAAiB;AAAA,IACnF;AAAA,IACA,mBAAmB,CAAC,SAAiB;AACnC,aAAY,WAAK,YAAY,YAAY,gBAAgB,IAAI,GAAG,WAAW;AAAA,IAC7E;AAAA,IACA,uBAAuB,CAAC,SAAiB;AACvC,aAAY,WAAK,YAAY,YAAY,gBAAgB,IAAI,GAAG,sBAAsB;AAAA,IACxF;AAAA,IACA,oBAAoB,CAAC,SAAiB;AACpC,aAAY,WAAK,YAAY,YAAY,gBAAgB,IAAI,GAAG,mBAAmB;AAAA,IACrF;AAAA,IACA,YAAiB,WAAK,YAAY,MAAM;AAAA,IACxC,cAAmB,WAAK,YAAY,WAAW;AAAA,IAC/C,cAAmB,WAAK,YAAY,QAAQ;AAAA,IAC5C,oBAAyB,WAAK,SAAS,WAAW,QAAQ;AAAA,IAC1D,kBAAuB,WAAK,YAAY,aAAa;AAAA,IACrD,eAAoB,WAAK,YAAY,SAAS;AAAA,IAC9C,oBAAyB,WAAK,YAAY,cAAc;AAAA,IACxD,aAAkB,WAAK,YAAY,mBAAmB;AAAA,IACtD,UAAe,WAAK,YAAY,OAAO;AAAA,IACvC,aAAkB,WAAK,YAAY,SAAS,iBAAiB;AAAA,IAC7D,oBAAyB,WAAK,YAAY,SAAS,qBAAqB;AAAA,IACxE,aAAkB,WAAK,YAAY,SAAS;AAAA,IAC5C,SAAc,WAAK,YAAY,QAAQ,gBAAgB;AAAA,IACvD;AAAA,IACA,sBAA2B,WAAK,YAAY,gBAAgB;AAAA,IAC5D,eAAoB,WAAK,YAAY,WAAW;AAAA,IAChD,iBAAsB,WAAK,YAAY,UAAU;AAAA,IACjD,cAAmB,WAAK,YAAY,YAAY;AAAA,IAChD,aAAkB,WAAK,YAAY,WAAW;AAAA,IAC9C,oBAAyB,WAAK,YAAY,mBAAmB;AAAA,IAC7D,iBAAsB,WAAK,KAAK,aAAa,eAAe,aAAa;AAAA,IACzE,qBAA0B,WAAK,KAAK,aAAa,eAAe,WAAW;AAAA,IAC3E,iBAAsB,WAAK,KAAK,aAAa,eAAe,QAAQ;AAAA,IACpE,uBAA4B,WAAK,KAAK,aAAa,WAAW,QAAQ;AAAA,IACtE,kBAAuB,WAAK,KAAK,aAAa,eAAe,SAAS;AAAA,IACtE,uBAA4B,WAAK,KAAK,aAAa,eAAe,cAAc;AAAA,IAChF,qBAA0B,WAAK,KAAK,aAAa,eAAe,aAAa;AAAA,IAC7E,oBAAyB,WAAK,KAAK,aAAa,eAAe,WAAW;AAAA,IAC1E,aAAa;AAAA,IACb,aAAa;AAAA,IACb,aAAkB,WAAK,YAAY,WAAW;AAAA,IAC9C,qBAA0B,WAAK,YAAY,oBAAoB;AAAA,IAC/D,cAAmB,WAAK,YAAY,OAAO;AAAA,IAC3C,mBAAwB,WAAK,YAAY,aAAa;AAAA,IACtD,mBAAwB,WAAK,YAAY,kBAAkB;AAAA,IAC3D,aAAkB,WAAK,YAAY,WAAW;AAAA,IAC9C,kBAAuB,WAAK,YAAY,WAAW;AAAA,IACnD,kBAAuB,WAAK,YAAY,YAAY;AAAA,IACpD,YAAiB,WAAK,YAAY,WAAW;AAAA,IAC7C,kBAAuB,WAAK,YAAY,gBAAgB;AAAA,IACxD,eAAe,CAACC,iBAA6B,WAAK,YAAY,YAAYA,cAAa,aAAa;AAAA,EACtG;AACF;;;ADtPO,IAAM,sBAAsB;AAgB5B,SAAS,aAAa,aAA6B;AACxD,SAAO,mBAAmB,EAAE,YAAY,CAAC,EAAE;AAC7C;AAEA,eAAsB,SACpB,UACA,QACA,MAC0B;AAC1B,QAAM,KAAK,KAAK,IAAI;AACpB,MAAI;AACJ,MAAI;AACF,UAAM,MAAU,cAAS,UAAU,MAAM;AAAA,EAC3C,SAAS,KAAK;AACZ,UAAM,OAAQ,IAA8B;AAC5C,QAAI,SAAS,UAAU;AACrB,cAAQ,KAAK,gBAAgB;AAAA,QAC3B,WAAW;AAAA,QACX,OAAO;AAAA,QACP;AAAA,QACA,WAAW;AAAA,QACX,SAAS;AAAA,QACT,YAAY,KAAK,IAAI,IAAI;AAAA,MAC3B,CAAC;AACD,aAAO;AAAA,IACT;AACA,YAAQ,KAAK,iBAAiB;AAAA,MAC5B,WAAW;AAAA,MACX,OAAO;AAAA,MACP;AAAA,MACA,WAAW;AAAA,MACX,OAAO,eAAe,GAAG;AAAA,MACzB,aAAa;AAAA,IACf,CAAC;AACD,UAAM;AAAA,EACR;AACA,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,QAAQ,YAAY,KAAK,OAAO,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAC9F,OAAC,SAAS,CAAC,QAAQ,QAAQ,KAAK,KAAK,UAAU,EAAE,OAAO,QAAQ,OAAO,6BAA6B,MAAM,UAAU,SAAS,KAAK,YAAW,oBAAI,KAAK,GAAE,YAAY,EAAE,CAAC,CAAC;AAAA,QACtK;AAAA,MACF;AACA,cAAQ,KAAK,gBAAgB;AAAA,QAC3B,WAAW;AAAA,QACX,OAAO;AAAA,QACP;AAAA,QACA,WAAW;AAAA,QACX,SAAS;AAAA,QACT,YAAY,KAAK,IAAI,IAAI;AAAA,QACzB,OAAO;AAAA,MACT,CAAC;AACD,aAAO;AAAA,IACT;AACA,YAAQ,KAAK,gBAAgB;AAAA,MAC3B,WAAW;AAAA,MACX,OAAO;AAAA,MACP;AAAA,MACA,WAAW;AAAA,MACX,SAAS;AAAA,MACT,YAAY,KAAK,IAAI,IAAI;AAAA,IAC3B,CAAC;AACD,WAAO;AAAA,EACT,QAAQ;AACN,KAAC,SAAS,CAAC,QAAQ,QAAQ,KAAK,KAAK,UAAU,EAAE,OAAO,QAAQ,OAAO,2BAA2B,MAAM,UAAU,SAAS,KAAK,YAAW,oBAAI,KAAK,GAAE,YAAY,EAAE,CAAC,CAAC;AAAA,MACpK;AAAA,IACF;AACA,YAAQ,KAAK,gBAAgB;AAAA,MAC3B,WAAW;AAAA,MACX,OAAO;AAAA,MACP;AAAA,MACA,WAAW;AAAA,MACX,SAAS;AAAA,MACT,YAAY,KAAK,IAAI,IAAI;AAAA,MACzB,OAAO;AAAA,IACT,CAAC;AACD,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,SAAS,UAAkB,MAAgB,QAAkC;AACjG,QAAM,KAAK,KAAK,IAAI;AACpB,MAAI;AACF,UAAM,YAAY,UAAU,KAAK,UAAU,MAAM,MAAM,CAAC,GAAG,EAAE,MAAM,IAAM,CAAC;AAC1E,YAAQ,KAAK,iBAAiB;AAAA,MAC5B,WAAW;AAAA,MACX,OAAO;AAAA,MACP;AAAA,MACA,WAAW;AAAA,MACX,SAAS;AAAA,MACT,YAAY,KAAK,IAAI,IAAI;AAAA,IAC3B,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,YAAQ,KAAK,iBAAiB;AAAA,MAC5B,WAAW;AAAA,MACX,OAAO;AAAA,MACP;AAAA,MACA,WAAW;AAAA,MACX,OAAO,eAAe,GAAG;AAAA,MACzB,aAAa;AAAA,IACf,CAAC;AACD,UAAM,IAAI,QAAQ;AAAA,MAChB,SAAS,eAAe,GAAG;AAAA,MAC3B,MAAM,YAAY;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,IACT,CAAC;AAAA,EACH;AACF;AAuDO,SAAS,UAAU,MAAwB;AAChD,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,SAAO;AAAA,IACL,SAAS;AAAA,IACT;AAAA,IACA,OAAO;AAAA,IACP,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,WAAW;AAAA,IACX,cAAc,CAAC;AAAA,IACf,SAAS,CAAC;AAAA,EACZ;AACF;AAMO,SAAS,YACd,MACA,UACA,MACU;AACV,QAAM,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,QAAQ,CAAC;AACnD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU;AAAA,IACV,cAAc,QAAQ,UAAU;AAAA,EAClC;AACF;AAMO,SAAS,cAAc,MAAgB,OAAyD;AACrG,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAClC,QAAM,OAAqB,EAAE,GAAG,OAAO,WAAW,GAAG;AACrD,QAAM,UAAU,CAAC,GAAG,KAAK,SAAS,IAAI;AACtC,QAAM,UAAU,QAAQ,SAAS,sBAC7B,QAAQ,MAAM,QAAQ,SAAS,mBAAmB,IAClD;AACJ,SAAO;AAAA,IACL,GAAG;AAAA,IACH,YAAY;AAAA,IACZ,gBAAgB;AAAA,IAChB,SAAS;AAAA,EACX;AACF;AAKO,SAAS,eAAe,MAK7B;AACA,MAAI,eAAe;AACnB,MAAI,mBAAmB;AACvB,MAAI,oBAAoB;AACxB,MAAI,sBAAsB;AAC1B,aAAW,KAAK,KAAK,SAAS;AAC5B,QAAI,OAAO,EAAE,YAAY,SAAU,iBAAgB,EAAE;AACrD,QAAI,EAAE,QAAQ;AACZ,0BAAoB,EAAE,OAAO;AAC7B,2BAAqB,EAAE,OAAO;AAAA,IAChC;AACA,QAAI,OAAO,EAAE,YAAY,YAAY,EAAE,OAAQ;AAAA,EACjD;AACA,SAAO,EAAE,cAAc,kBAAkB,mBAAmB,oBAAoB;AAClF;AAEA,IAAM,SAAS;AAGR,SAAS,WAAW,MAAgB,eAAe,IAAY;AACpE,QAAM,QAAkB,CAAC;AAGzB,QAAM,cAAc,KAAK,eAAe,KAAK;AAC7C,QAAM,KAAK,MAAM,KAAK,MAAM,IAAI,OAAO,WAAW;AAClD,MAAI,KAAK,eAAe,KAAK,gBAAgB,KAAK,MAAM;AACtD,UAAM,UAAU,KAAK,KAAK,SAAS,KAAK,KAAK,KAAK,MAAM,GAAG,EAAE,IAAI,WAAM,KAAK;AAC5E,UAAM,KAAK,MAAM,IAAI,mBAAmB,UAAU,IAAI,CAAC;AAAA,EACzD;AAGA,MAAI,OAAO,KAAK,aAAa,UAAU;AACrC,UAAM,MAAM,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,QAAQ,CAAC,CAAC;AAChE,UAAM,SAAS,KAAK,MAAM,MAAM,CAAC;AACjC,UAAM,QAAQ,KAAK;AACnB,UAAM,MAAM,MAAM,MAAM,SAAI,OAAO,MAAM,CAAC,IAAI,MAAM,IAAI,SAAI,OAAO,KAAK,CAAC;AACzE,UAAM,KAAK,eAAe,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG,CAAC;AAC3D,QAAI,KAAK,cAAc;AACrB,YAAM,KAAK,OAAO,MAAM,IAAI,KAAK,YAAY,CAAC;AAAA,IAChD;AAEA,QAAI,KAAK,eAAe;AACtB,YAAM,YAAY,KAAK,kBAAkB,iBAAiB,cACtD,KAAK,kBAAkB,aAAa,iBACpC;AACJ,YAAM,KAAK,cAAc,YAAY,MAAM,KAAK,aAAa;AAAA,IAC/D;AAAA,EACF;AAGA,MAAI,KAAK,gBAAgB,KAAK,aAAa,SAAS,GAAG;AACrD,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,MAAM,KAAK,eAAe,CAAC;AACtC,eAAW,KAAK,KAAK,cAAc;AACjC,YAAM,OAAO,wBAAwB,KAAK,CAAC;AAC3C,YAAM,SAAS,OAAO,MAAM,MAAM,QAAG,IAAI,MAAM,IAAI,QAAG;AACtD,YAAM,KAAK,OAAO,SAAS,MAAM,CAAC;AAAA,IACpC;AAAA,EACF;AAEA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,UAAU,KAAK,KAAK;AAC/B,QAAM,KAAK,oBAAoB,KAAK,cAAc;AAClD,QAAM,KAAK,iBAAiB,KAAK,UAAU;AAC3C,QAAM,aAAa,KAAK,aAAa;AACrC,QAAM,KAAK,YAAY,cAAc,KAAK,aAAa,IAAI,kBAAkB,KAAK,aAAa,MAAM,GAAG;AACxG,QAAM,KAAK,aAAa,KAAK,WAAW;AACxC,QAAM,QAAQ,eAAe,IAAI;AACjC,MAAI,MAAM,sBAAsB,GAAG;AACjC,UAAM,QAAQ,YAAY,SAAS,MAAM,aAAa,QAAQ,CAAC,IAC3D,WAAW,MAAM,mBAAmB,YAAY,MAAM,oBACtD,oBAAoB,MAAM,sBAAsB;AACpD,UAAM,KAAK,KAAK;AAAA,EAClB;AACA,MAAI,KAAK,QAAQ,SAAS,GAAG;AAC3B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,0BAA0B,KAAK,IAAI,cAAc,KAAK,QAAQ,MAAM,IAAI,IAAI;AACvF,UAAM,OAAO,KAAK,QAAQ,MAAM,CAAC,YAAY;AAC7C,eAAW,KAAK,MAAM;AACpB,YAAM,OAAO,EAAE,WAAW,YAAY,WAAM,EAAE,WAAW,YAAY,WAAM,EAAE,WAAW,YAAY,WAAM;AAC1G,YAAM,OAAO,EAAE,OAAO,aAAQ,EAAE,OAAO;AACvC,YAAM,OAAO,OAAO,EAAE,YAAY,WAAW,OAAO,SAAS,EAAE,QAAQ,QAAQ,CAAC,IAAI,MAAM;AAC1F,YAAM,KAAK,QAAQ,EAAE,YAAY,MAAM,OAAO,OAAO,EAAE,SAAS,OAAO,EAAE,OAAO,OAAO,IAAI;AAAA,IAC7F;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAiBO,SAAS,sBAAsB,MAA0D;AAC9F,QAAM,KAAK;AACX,QAAM,IAAI,KAAK,MAAM,EAAE;AACvB,MAAI,CAAC,EAAG,QAAO;AAGf,QAAM,WAAW,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,OAAO,SAAS,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;AAC5E,QAAM,OAAO,EAAE,CAAC,GAAG,KAAK,KAAK;AAC7B,SAAO,SAAS,SAAY,EAAE,SAAS,IAAI,EAAE,UAAU,KAAK;AAC9D;AAQO,SAAS,eACd,MACA,UACA,MACU;AACV,QAAM,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,QAAQ,CAAC;AACnD,QAAM,UAAU,CAAC,GAAI,KAAK,mBAAmB,CAAC,GAAI,EAAE,KAAI,oBAAI,KAAK,GAAE,YAAY,GAAG,UAAU,SAAS,KAAK,CAAC;AAE3G,QAAM,UAAU,QAAQ,SAAS,MAAM,QAAQ,MAAM,IAAI,IAAI;AAE7D,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU;AAAA,IACV,cAAc,QAAQ,GAAG,OAAO;AAAA,IAChC,iBAAiB;AAAA,IACjB,eAAe,aAAa,OAAO;AAAA,EACrC;AACF;AAGO,IAAM,uBAAuB;AAEpC,SAAS,aAAa,SAAiF;AACrG,MAAI,QAAQ,SAAS,EAAG,QAAO;AAC/B,QAAM,SAAS,QAAQ,MAAM,EAAE;AAC/B,QAAM,SAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,WAAO,MAAM,OAAO,CAAC,GAAG,YAAY,MAAM,OAAO,IAAI,CAAC,GAAG,YAAY,EAAE;AAAA,EACzE;AAEA,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,QAAM,WAAW,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;AAC5D,MAAI,WAAW,EAAG,QAAO;AACzB,MAAI,WAAW,GAAI,QAAO;AAC1B,SAAO;AACT;;;AEreA,YAAYC,UAAS;AACrB,YAAYC,WAAU;AA0Cf,IAAM,oBAAN,MAAwB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA,cAAc,oBAAI,IAAwB;AAAA,EAC1C;AAAA,EAER,YAAY,MAAgC;AAC1C,SAAK,QAAQ,KAAK;AAClB,SAAK,iBAAiB,KAAK,kBAAkB;AAC7C,SAAK,qBAAqB,KAAK,sBAAsB,IAAI,KAAK,KAAK,KAAK;AACxE,SAAK,UAAU,KAAK,WAAgB,WAAK,KAAK,MAAM,SAAS,cAAc;AAAA,EAE7E;AAAA,EAEA,MAAM,aAA4B;AAChC,UAAU,WAAM,KAAK,SAAS,EAAE,WAAW,KAAK,CAAC;AACjD,UAAM,KAAK,aAAa;AAAA,EAC1B;AAAA,EAEA,MAAM,eAAe,OAAmB,OAAqC;AAE3E,UAAM,KAAK,MAAM,KAAK,KAAK;AAG3B,UAAM,cAAc,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE;AAAA,MACpD,CAAC,MAAM,EAAE,WAAW,aAAa,EAAE,WAAW;AAAA,IAChD;AAEA,UAAM,aAAyB;AAAA,MAC7B,IAAI,OAAO,WAAW;AAAA,MACtB,SAAS,MAAM;AAAA,MACf,SAAS,aAAa,MAAM,MAAM,aAAa,CAAC,KAAK;AAAA,MACrD,aAAa,aAAa,UAAU;AAAA,MACpC,cAAc,cACV,MAAM,KAAK,YAAY,UAAU,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO;AAAA,QAC3D,QAAQ,EAAE;AAAA,QACV,QAAQ,EAAE;AAAA,QACV,OAAO,EAAE;AAAA,MACX,EAAE,IACF,CAAC;AAAA,MACL,WAAW,KAAK,IAAI;AAAA,MACpB;AAAA,IACF;AAEA,SAAK,YAAY,IAAI,WAAW,IAAI,UAAU;AAG9C,UAAM,KAAK,WAAW,UAAU;AAGhC,UAAM,KAAK,iBAAiB,MAAM,EAAE;AAEpC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,kBAAkB,cAAkD;AACxE,QAAI,aAAa,KAAK,YAAY,IAAI,YAAY;AAGlD,QAAI,CAAC,YAAY;AACf,YAAM,KAAK,aAAa;AACxB,mBAAa,KAAK,YAAY,IAAI,YAAY;AAAA,IAChD;AAEA,QAAI,CAAC,WAAY,QAAO;AAExB,UAAM,QAAQ,MAAM,KAAK,MAAM,KAAK,WAAW,OAAO;AACtD,QAAI,CAAC,MAAO,QAAO;AAGnB,UAAM,QAAQ,MAAM,OAAO,IAAI,WAAW,OAAO;AACjD,QAAI,OAAO;AACT,YAAM,SAAS,WAAW;AAC1B,YAAM,YAAY,KAAK,IAAI;AAG3B,iBAAW,MAAM,WAAW,cAAc;AACxC,cAAM,OAAO,MAAM,UAAU,MAAM,IAAI,GAAG,MAAM;AAChD,YAAI,MAAM;AACR,eAAK,SAAS,GAAG;AACjB,eAAK,YAAY,KAAK,IAAI;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAEA,UAAM,YAAY,KAAK,IAAI;AAC3B,WAAO;AAAA,EACT;AAAA,EAEA,gBAAgB,SAAgC;AAC9C,UAAM,MAAM,MAAM,KAAK,KAAK,YAAY,OAAO,CAAC;AAChD,UAAM,WAAW,UAAU,IAAI,OAAO,CAAC,MAAM,EAAE,YAAY,OAAO,IAAI;AACtE,WAAO,SAAS,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAAA,EAC1D;AAAA,EAEA,MAAM,iBAAiB,cAAwC;AAC7D,UAAM,aAAa,KAAK,YAAY,IAAI,YAAY;AACpD,QAAI,CAAC,WAAY,QAAO;AAExB,SAAK,YAAY,OAAO,YAAY;AAEpC,UAAM,KAAK,eAAe,YAAY;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,WAAW,YAAuC;AAC9D,UAAM,WAAgB,WAAK,KAAK,SAAS,GAAG,WAAW,OAAO,OAAO;AACrE,UAAM,aAAmC;AAAA,MACvC,GAAG;AAAA,IACL;AAEA,UAAM,aAAa,UAAU,YAAY;AAEvC,UAAI,WAAmC,CAAC;AACxC,UAAI;AACF,cAAM,MAAM,MAAU,cAAS,UAAU,MAAM;AAC/C,cAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,YAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,qBAAW;AAAA,QACb;AAAA,MACF,QAAQ;AAAA,MAER;AAGA,eAAS,KAAK,UAAU;AACxB,YAAM,YAAY,UAAU,KAAK,UAAU,UAAU,MAAM,CAAC,GAAG,EAAE,MAAM,IAAM,CAAC;AAAA,IAChF,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,eAAe,cAAqC;AAChE,QAAI;AACJ,QAAI;AACF,gBAAU,MAAU,aAAQ,KAAK,OAAO;AAAA,IAC1C,QAAQ;AACN;AAAA,IACF;AAEA,eAAW,YAAY,SAAS;AAC9B,UAAI,CAAC,SAAS,SAAS,OAAO,EAAG;AAEjC,YAAM,WAAgB,WAAK,KAAK,SAAS,QAAQ;AACjD,UAAI;AACF,cAAM,aAAa,UAAU,YAAY;AACvC,gBAAM,MAAM,MAAU,cAAS,UAAU,MAAM;AAC/C,gBAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,cAAI,CAAC,MAAM,QAAQ,MAAM,EAAG;AAC5B,gBAAM,WAAW;AACjB,gBAAM,WAAW,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,YAAY;AAE7D,cAAI,SAAS,WAAW,SAAS,QAAQ;AACvC,gBAAI,SAAS,WAAW,GAAG;AACzB,oBAAU,YAAO,QAAQ;AAAA,YAC3B,OAAO;AACL,oBAAM,YAAY,UAAU,KAAK,UAAU,UAAU,MAAM,CAAC,GAAG,EAAE,MAAM,IAAM,CAAC;AAAA,YAChF;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,eAA8B;AAC1C,QAAI;AACJ,QAAI;AACF,gBAAU,MAAU,aAAQ,KAAK,OAAO;AAAA,IAC1C,QAAQ;AAEN;AAAA,IACF;AAEA,eAAW,YAAY,SAAS;AAC9B,UAAI,CAAC,SAAS,SAAS,OAAO,EAAG;AAEjC,YAAM,WAAgB,WAAK,KAAK,SAAS,QAAQ;AACjD,UAAI;AACF,cAAM,MAAM,MAAU,cAAS,UAAU,MAAM;AAC/C,cAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,YAAI,CAAC,MAAM,QAAQ,MAAM,EAAG;AAC5B,cAAM,cAAc;AAEpB,mBAAW,MAAM,aAAa;AAC5B,gBAAM,aAAyB;AAAA,YAC7B,IAAI,GAAG;AAAA,YACP,SAAS,GAAG;AAAA,YACZ,SAAS,GAAG;AAAA,YACZ,aAAa,GAAG;AAAA,YAChB,cAAc,GAAG;AAAA,YACjB,WAAW,GAAG;AAAA,YACd,OAAO,GAAG;AAAA,UACZ;AACA,eAAK,YAAY,IAAI,WAAW,IAAI,UAAU;AAAA,QAChD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,iBAAiB,SAAgC;AAC7D,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,mBAAmB,MAAM,KAAK,KAAK,YAAY,OAAO,CAAC,EAC1D,OAAO,CAAC,eAAe,WAAW,YAAY,OAAO,EACrD,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAG3C,eAAW,MAAM,kBAAkB;AACjC,UAAI,MAAM,GAAG,YAAY,KAAK,oBAAoB;AAChD,aAAK,YAAY,OAAO,GAAG,EAAE;AAC7B,cAAM,KAAK,eAAe,GAAG,EAAE;AAAA,MACjC;AAAA,IACF;AAGA,UAAM,YAAY,MAAM,KAAK,KAAK,YAAY,OAAO,CAAC,EACnD,OAAO,CAAC,eAAe,WAAW,YAAY,OAAO,EACrD,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAC3C,WAAO,UAAU,SAAS,KAAK,gBAAgB;AAC7C,YAAM,SAAS,UAAU,MAAM;AAC/B,UAAI,QAAQ;AACV,aAAK,YAAY,OAAO,OAAO,EAAE;AACjC,cAAM,KAAK,eAAe,OAAO,EAAE;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AACF;",
-  "names": ["resolve", "resolve", "path", "fsp", "path", "fsp", "path", "projectHash", "fsp", "path"]
-}