issue-flow 0.17.0 → 0.18.0

package/dist/{agent-TB6W7PT7.js → agent-HMZTXCRT.js}

@@ -5,15 +5,15 @@ import {
   runAgent,
   runAgentUse,
   writeAgentPreference
-} from "./chunk-UWDCIFTP.js";
-import "./chunk-HY5HLFDU.js";
-import "./chunk-DV7HUC4Z.js";
+} from "./chunk-45WZ6GMI.js";
+import "./chunk-QF7VEL3M.js";
+import "./chunk-LI35PIIS.js";
 import "./chunk-XZUEFTUP.js";
 import "./chunk-QPGEFLMY.js";
 import "./chunk-HAKDLR6N.js";
 import "./chunk-YVPZUN6X.js";
 import "./chunk-DUS5ZNKL.js";
-import "./chunk-YII4U7ZD.js";
+import "./chunk-6K2LCFG6.js";
 import "./chunk-PPZ3K4YM.js";
 import "./chunk-SOM4QA6C.js";
 import "./chunk-ICM463EO.js";
@@ -27,4 +27,4 @@ export {
   runAgentUse,
   writeAgentPreference
 };
-//# sourceMappingURL=agent-TB6W7PT7.js.map
+//# sourceMappingURL=agent-HMZTXCRT.js.map

package/dist/{analyze-6M3KEOX7.js → analyze-Q4ONIWRZ.js}

@@ -2,13 +2,13 @@
 import {
   issuePlaceholders,
   resolveCommandIssue
-} from "./chunk-VE3IYNDN.js";
-import "./chunk-QMIQR7EE.js";
+} from "./chunk-SA6HXL4Y.js";
+import "./chunk-62GVVZQO.js";
 import "./chunk-KMMASOA6.js";
 import {
   publishPhaseMetrics,
   resolvePolicyPlaceholders
-} from "./chunk-HLAPOUEM.js";
+} from "./chunk-KMCS76ZW.js";
 import {
   applyPlaceholders,
   loadPrompt
@@ -16,15 +16,15 @@ import {
 import {
   DEFAULT_HEADLESS_TIMEOUT_MS,
   runHeadless
-} from "./chunk-UK4E2FUA.js";
+} from "./chunk-TZYINKCC.js";
 import "./chunk-WCCZJL7W.js";
 import "./chunk-DGRTJD5R.js";
-import "./chunk-D6ZBGJ3L.js";
-import "./chunk-E6KXCV3T.js";
-import "./chunk-HY5HLFDU.js";
+import "./chunk-ZVZMWNCG.js";
+import "./chunk-LGHND47K.js";
+import "./chunk-QF7VEL3M.js";
 import {
   resolveIssuePaths
-} from "./chunk-DV7HUC4Z.js";
+} from "./chunk-LI35PIIS.js";
 import {
   getGlobalTimeout,
   printError,
@@ -35,7 +35,7 @@ import "./chunk-QPGEFLMY.js";
 import "./chunk-HAKDLR6N.js";
 import "./chunk-YVPZUN6X.js";
 import "./chunk-DUS5ZNKL.js";
-import "./chunk-YII4U7ZD.js";
+import "./chunk-6K2LCFG6.js";
 import "./chunk-PPZ3K4YM.js";
 import {
   loadTaskPlan,
@@ -110,4 +110,4 @@ async function runAnalyze(issue, resolvedIssue) {
 export {
   runAnalyze
 };
-//# sourceMappingURL=analyze-6M3KEOX7.js.map
+//# sourceMappingURL=analyze-Q4ONIWRZ.js.map

package/dist/{apply-ADB3ZK7W.js → apply-EEFPY2W4.js}

@@ -3,9 +3,9 @@ import "./chunk-3D4A4B46.js";
 import {
   DEFAULT_BRANCH_CONVENTION,
   loadRepositoryPolicy
-} from "./chunk-E6KXCV3T.js";
-import "./chunk-HY5HLFDU.js";
-import "./chunk-DV7HUC4Z.js";
+} from "./chunk-LGHND47K.js";
+import "./chunk-QF7VEL3M.js";
+import "./chunk-LI35PIIS.js";
 import "./chunk-XZUEFTUP.js";
 import "./chunk-QPGEFLMY.js";
 import "./chunk-HAKDLR6N.js";
@@ -13,7 +13,7 @@ import {
   getProjectRoot
 } from "./chunk-YVPZUN6X.js";
 import "./chunk-DUS5ZNKL.js";
-import "./chunk-YII4U7ZD.js";
+import "./chunk-6K2LCFG6.js";
 import "./chunk-PPZ3K4YM.js";
 import "./chunk-SOM4QA6C.js";
 import "./chunk-ICM463EO.js";
@@ -798,4 +798,4 @@ export {
   planRepositoryScaffold,
   resolveRepositoryState
 };
-//# sourceMappingURL=apply-ADB3ZK7W.js.map
+//# sourceMappingURL=apply-EEFPY2W4.js.map

package/dist/{bench-FM7I7EIV.js → bench-WWWXLTFH.js}

@@ -1,26 +1,26 @@
 #!/usr/bin/env node
 import {
   summarizePhaseTiming
-} from "./chunk-B3TSS7BT.js";
+} from "./chunk-QJ44VG5G.js";
 import {
   runAcceptance
-} from "./chunk-SGTTR4XW.js";
+} from "./chunk-E4I6MMHD.js";
 import "./chunk-L6HSKTQE.js";
 import {
   evaluateCeilings,
   spendFromCost
-} from "./chunk-UK4E2FUA.js";
+} from "./chunk-TZYINKCC.js";
 import "./chunk-WCCZJL7W.js";
 import "./chunk-DGRTJD5R.js";
-import "./chunk-D6ZBGJ3L.js";
+import "./chunk-ZVZMWNCG.js";
 import {
   ensureHarnessVersion,
   setIssuesCliOverrides
-} from "./chunk-HY5HLFDU.js";
+} from "./chunk-QF7VEL3M.js";
 import {
   resetStorageResolutionCache,
   resolveIssuePaths
-} from "./chunk-DV7HUC4Z.js";
+} from "./chunk-LI35PIIS.js";
 import {
   printError,
   printInfo,
@@ -39,7 +39,7 @@ import {
   createInitialSnapshot,
   reduceSessionEvent
 } from "./chunk-DUS5ZNKL.js";
-import "./chunk-YII4U7ZD.js";
+import "./chunk-6K2LCFG6.js";
 import {
   redactSecrets
 } from "./chunk-PPZ3K4YM.js";
@@ -858,7 +858,7 @@ async function runBench(options = {}) {
   const harnessVersion = options.harnessVersion ?? await collectHarnessVersion("claude");
   const runner = options.runner ?? createLiveRepeatRunner({
     runPipeline: options.runPipeline ?? (async (issue) => {
-      const { runPipeline } = await import("./run-3MPORLF5.js");
+      const { runPipeline } = await import("./run-2RXJCJKT.js");
       return runPipeline(issue, "auto", void 0, true, false, { yes: true, only: true });
     })
   });
@@ -907,4 +907,4 @@ export {
   estimateCampaignUsd,
   runBench
 };
-//# sourceMappingURL=bench-FM7I7EIV.js.map
+//# sourceMappingURL=bench-WWWXLTFH.js.map

package/dist/{chunk-KZ5EY5XX.js → chunk-34OCSKOB.js}

@@ -3,15 +3,15 @@ import {
   isTransientFailure,
   readFileWithGrace,
   runPhaseWithRetry
-} from "./chunk-32JSYXEK.js";
+} from "./chunk-V7QOIQYC.js";
 import {
   issuePlaceholders,
   resolveCommandIssue
-} from "./chunk-VE3IYNDN.js";
+} from "./chunk-SA6HXL4Y.js";
 import {
   publishPhaseMetrics,
   resolvePolicyPlaceholders
-} from "./chunk-HLAPOUEM.js";
+} from "./chunk-KMCS76ZW.js";
 import {
   applyPlaceholders,
   loadPrompt
@@ -19,18 +19,18 @@ import {
 import {
   DEFAULT_HEADLESS_TIMEOUT_MS,
   runHeadless
-} from "./chunk-UK4E2FUA.js";
+} from "./chunk-TZYINKCC.js";
 import {
   DEFAULT_BRANCH_CONVENTION,
   branchName,
   loadRepositoryPolicy,
   resolveChangeType
-} from "./chunk-E6KXCV3T.js";
+} from "./chunk-LGHND47K.js";
 import {
   recordUserStoryNumbering,
   resolveIssuePaths,
   resolveProjectPaths
-} from "./chunk-DV7HUC4Z.js";
+} from "./chunk-LI35PIIS.js";
 import {
   getGlobalTimeout,
   printError,
@@ -311,4 +311,4 @@ ${issues}`
 export {
   runPlan
 };
-//# sourceMappingURL=chunk-KZ5EY5XX.js.map
+//# sourceMappingURL=chunk-34OCSKOB.js.map

package/dist/{chunk-UWDCIFTP.js → chunk-45WZ6GMI.js}

@@ -4,8 +4,8 @@ import {
   PROJECT_CONFIG_FILENAME,
   describeRunAgents,
   loadAgentConfig,
-  probeAgent
-} from "./chunk-HY5HLFDU.js";
+  probeReadinessInventory
+} from "./chunk-QF7VEL3M.js";
 import {
   printError,
   printSuccess
@@ -54,12 +54,8 @@ function formatPhaseLine(phase, provider, model, origin, inherited) {
 async function runAgent(options = {}) {
   const config = await loadAgentConfig();
   const summary = await describeRunAgents();
-  const [claude, codex, cursor, antigravity] = await Promise.all([
-    probeAgent("claude"),
-    probeAgent("codex"),
-    probeAgent("cursor"),
-    probeAgent("antigravity")
-  ]);
+  const inventory = await probeReadinessInventory();
+  const providers = Object.values(inventory.providers);
   if (options.json === true) {
     const phases = {};
     for (const phase of AGENT_PHASES) {
@@ -82,33 +78,21 @@ async function runAgent(options = {}) {
             origin: summary.defaultOrigin
           },
           phases,
-          availability: [
-            {
-              id: "claude",
-              installed: claude.installed,
-              version: claude.version,
-              authenticated: claude.authenticated
-            },
-            {
-              id: "codex",
-              installed: codex.installed,
-              version: codex.version,
-              authenticated: codex.authenticated
-            },
-            {
-              id: "cursor",
-              installed: cursor.installed,
-              version: cursor.version,
-              authenticated: cursor.authenticated
-            },
-            {
-              id: "antigravity",
-              installed: antigravity.installed,
-              version: antigravity.version,
-              authenticated: antigravity.authenticated,
-              authProbe: "none"
-            }
-          ]
+          inventory,
+          availability: providers.map((entry) => ({
+            id: entry.provider,
+            harness: entry.harness,
+            installed: entry.installed,
+            version: entry.version,
+            authenticated: entry.authentication !== "failed" && entry.installed,
+            authentication: entry.authentication,
+            state: entry.state,
+            source: entry.source,
+            observedAt: entry.observedAt,
+            expiresAt: entry.expiresAt,
+            detail: entry.detail,
+            ...entry.provider === "antigravity" || entry.provider === "claude" ? { authProbe: "none" } : {}
+          }))
         },
         null,
         2
@@ -138,13 +122,13 @@ async function runAgent(options = {}) {
   }
   console.log("");
   console.log("Disponibilidade");
-  console.log(`  claude        ${(claude.version ?? "\u2014").padEnd(16)} ${claude.detail}`);
-  console.log(`  codex         ${(codex.version ?? "\u2014").padEnd(16)} ${codex.detail}`);
-  console.log(`  cursor        ${(cursor.version ?? "\u2014").padEnd(16)} ${cursor.detail}`);
-  console.log(
-    `  antigravity   ${(antigravity.version ?? "\u2014").padEnd(16)} ${antigravity.detail} (no auth probe)`
-  );
-  if (antigravity.installed) {
+  for (const entry of providers) {
+    const authNote = entry.authentication === "unverified" ? " (auth unverified)" : "";
+    console.log(
+      `  ${entry.provider.padEnd(12)} ${(entry.version ?? "\u2014").padEnd(16)} ${entry.state.padEnd(12)} ${entry.detail}${authNote}`
+    );
+  }
+  if (inventory.providers.antigravity?.installed) {
     console.log(
       "  Warning: every Antigravity invocation passes --dangerously-skip-permissions. --mode plan is the write containment."
     );
@@ -235,4 +219,4 @@ export {
   writeAgentPreference,
   persistFirstAgentChoice
 };
-//# sourceMappingURL=chunk-UWDCIFTP.js.map
+//# sourceMappingURL=chunk-45WZ6GMI.js.map

package/dist/chunk-45WZ6GMI.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/commands/agent.ts"],"sourcesContent":["import { mkdir, readFile } from 'node:fs/promises';\nimport { dirname, join } from 'node:path';\nimport { probeReadinessInventory } from '../agents/availability.js';\nimport { describeRunAgents } from '../agents/resolve.js';\nimport {\n  AGENT_PHASES,\n  AGENT_SCHEMA_VERSION,\n  type AgentPhase,\n  type AgentProviderId,\n  isAgentPhase,\n  isAgentProviderId,\n} from '../agents/types.js';\nimport { GLOBAL_CONFIG_FILENAME, loadAgentConfig, PROJECT_CONFIG_FILENAME } from '../config.js';\nimport { getGlobalRoot } from '../storage/paths.js';\nimport { printError, printSuccess } from '../ui/logger.js';\nimport { writeFileAtomic } from '../utils/fs.js';\nimport { getProjectRoot } from '../utils/git.js';\n\nexport const AGENT_COMMAND_SCHEMA_VERSION = AGENT_SCHEMA_VERSION;\n\nexport interface AgentCommandOptions {\n  json?: boolean;\n}\n\nexport interface AgentUseOptions {\n  model?: string;\n  global?: boolean;\n  project?: boolean;\n  phase?: string;\n}\n\nfunction originLabel(origin: string): string {\n  switch (origin) {\n    case 'default':\n      return 'default';\n    case 'global':\n      return '~/.issue-flow/config.json';\n    case 'project':\n      return '.issue-flow.json';\n    case 'env':\n      return 'ISSUE_FLOW_*';\n    case 'cli':\n      return 'CLI';\n    default:\n      return origin;\n  }\n}\n\nfunction formatPhaseLine(\n  phase: AgentPhase,\n  provider: string,\n  model: string | null,\n  origin: string,\n  inherited: boolean,\n): string {\n  const modelBit = model ? ` · ${model}` : '';\n  const source = inherited ? 'herdado do padrão' : originLabel(origin);\n  return `${`  ${phase.padEnd(12)} ${provider}${modelBit}`.padEnd(40)}(${source})`;\n}\n\nexport async function runAgent(options: AgentCommandOptions = {}): Promise<number> {\n  const config = await loadAgentConfig();\n  const summary = await describeRunAgents();\n  const inventory = await probeReadinessInventory();\n  const providers = Object.values(inventory.providers);\n\n  if (options.json === true) {\n    const phases: Record<string, unknown> = {};\n    for (const phase of AGENT_PHASES) {\n      const resolved = summary.byPhase[phase];\n      const inherited = config.phases[phase] === undefined;\n      phases[phase] = {\n        provider: resolved.provider,\n        model: resolved.model,\n        origin: resolved.origin,\n        inherited,\n      };\n    }\n    console.log(\n      JSON.stringify(\n        {\n          schemaVersion: AGENT_COMMAND_SCHEMA_VERSION,\n          default: {\n            provider: summary.defaultProvider,\n            model: summary.defaultModel,\n            origin: summary.defaultOrigin,\n          },\n          phases,\n          inventory,\n          availability: providers.map((entry) => ({\n            id: entry.provider,\n            harness: entry.harness,\n            installed: entry.installed,\n            version: entry.version,\n            authenticated: entry.authentication !== 'failed' && entry.installed,\n            authentication: entry.authentication,\n            state: entry.state,\n            source: entry.source,\n            observedAt: entry.observedAt,\n            expiresAt: entry.expiresAt,\n            detail: entry.detail,\n            ...(entry.provider === 'antigravity' || entry.provider === 'claude'\n              ? { authProbe: 'none' as const }\n              : {}),\n          })),\n        },\n        null,\n        2,\n      ),\n    );\n    return 0;\n  }\n\n  const modelLabel = summary.defaultModel ?? '(default do provider)';\n  console.log(\n    `Agente padrão   ${summary.defaultProvider.padEnd(22)} (${originLabel(summary.defaultOrigin.provider)})`,\n  );\n  console.log(`Modelo          ${modelLabel} (${originLabel(summary.defaultOrigin.model)})`);\n  console.log('');\n  console.log('Por fase');\n  for (const phase of AGENT_PHASES) {\n    const resolved = summary.byPhase[phase];\n    const inherited = config.phases[phase] === undefined;\n    console.log(\n      formatPhaseLine(\n        phase,\n        resolved.provider,\n        resolved.model,\n        resolved.origin.provider,\n        inherited,\n      ),\n    );\n  }\n  console.log('');\n  console.log('Disponibilidade');\n  for (const entry of providers) {\n    const authNote = entry.authentication === 'unverified' ? ' (auth unverified)' : '';\n    console.log(\n      `  ${entry.provider.padEnd(12)} ${(entry.version ?? '—').padEnd(16)} ${entry.state.padEnd(12)} ${entry.detail}${authNote}`,\n    );\n  }\n  if (inventory.providers.antigravity?.installed) {\n    console.log(\n      '  Warning: every Antigravity invocation passes --dangerously-skip-permissions. --mode plan is the write containment.',\n    );\n  }\n  return 0;\n}\n\nexport async function runAgentUse(\n  providerRaw: string,\n  options: AgentUseOptions = {},\n): Promise<number> {\n  if (!isAgentProviderId(providerRaw)) {\n    printError(\n      `Unknown agent provider '${providerRaw}'. Valid providers: claude, codex, cursor, antigravity.`,\n    );\n    return 1;\n  }\n  const provider = providerRaw as AgentProviderId;\n\n  let phase: AgentPhase | undefined;\n  if (options.phase !== undefined) {\n    if (!isAgentPhase(options.phase)) {\n      printError(\n        `Unknown agent phase '${options.phase}'. Valid phases: ${AGENT_PHASES.join(', ')}.`,\n      );\n      return 1;\n    }\n    phase = options.phase;\n  }\n\n  const target: 'global' | 'project' = options.project === true ? 'project' : 'global';\n  try {\n    const path = await writeAgentPreference({\n      target,\n      provider,\n      model: options.model,\n      phase,\n    });\n    printSuccess(`Wrote agent preference to ${path}`);\n    return 0;\n  } catch (err) {\n    printError(err instanceof Error ? err.message : String(err));\n    return 1;\n  }\n}\n\nexport async function writeAgentPreference(input: {\n  target: 'global' | 'project';\n  provider: AgentProviderId;\n  model?: string;\n  phase?: AgentPhase;\n  projectRoot?: string;\n}): Promise<string> {\n  const path =\n    input.target === 'global'\n      ? join(getGlobalRoot(), GLOBAL_CONFIG_FILENAME)\n      : join(input.projectRoot ?? (await getProjectRoot()), PROJECT_CONFIG_FILENAME);\n\n  let existing: Record<string, unknown> = {};\n  try {\n    const raw = await readFile(path, 'utf-8');\n    const parsed: unknown = JSON.parse(raw);\n    if (parsed !== null && typeof parsed === 'object' && !Array.isArray(parsed)) {\n      existing = parsed as Record<string, unknown>;\n    }\n  } catch (err: unknown) {\n    if ((err as NodeJS.ErrnoException).code !== 'ENOENT') {\n      throw new Error(`Could not read ${path}: ${(err as Error).message}`);\n    }\n  }\n\n  const currentAgent =\n    existing.agent !== null && typeof existing.agent === 'object' && !Array.isArray(existing.agent)\n      ? { ...(existing.agent as Record<string, unknown>) }\n      : {};\n\n  if (input.phase) {\n    const phases =\n      currentAgent.phases !== null &&\n      typeof currentAgent.phases === 'object' &&\n      !Array.isArray(currentAgent.phases)\n        ? { ...(currentAgent.phases as Record<string, unknown>) }\n        : {};\n    phases[input.phase] = {\n      provider: input.provider,\n      ...(input.model ? { model: input.model } : {}),\n    };\n    currentAgent.phases = phases;\n  } else {\n    currentAgent.provider = input.provider;\n    if (input.model) currentAgent.model = input.model;\n    else delete currentAgent.model;\n  }\n\n  existing.agent = currentAgent;\n  await mkdir(dirname(path), { recursive: true });\n  await writeFileAtomic(path, `${JSON.stringify(existing, null, 2)}\\n`);\n  if (input.provider === 'cursor') {\n    const { ensureCursorStorageGrant } = await import('../agents/permissions.js');\n    await ensureCursorStorageGrant({\n      mode: input.target === 'project' ? 'project' : 'global',\n      ...(input.projectRoot === undefined ? {} : { projectRoot: input.projectRoot }),\n    });\n  }\n  return path;\n}\n\n/** Used by init to persist a first-run choice without touching other keys. */\nexport async function persistFirstAgentChoice(provider: AgentProviderId): Promise<string> {\n  return writeAgentPreference({ target: 'global', provider });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,OAAO,gBAAgB;AAChC,SAAS,SAAS,YAAY;AAiBvB,IAAM,+BAA+B;AAa5C,SAAS,YAAY,QAAwB;AAC3C,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAEA,SAAS,gBACP,OACA,UACA,OACA,QACA,WACQ;AACR,QAAM,WAAW,QAAQ,SAAM,KAAK,KAAK;AACzC,QAAM,SAAS,YAAY,yBAAsB,YAAY,MAAM;AACnE,SAAO,GAAG,KAAK,MAAM,OAAO,EAAE,CAAC,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO,EAAE,CAAC,IAAI,MAAM;AAC/E;AAEA,eAAsB,SAAS,UAA+B,CAAC,GAAoB;AACjF,QAAM,SAAS,MAAM,gBAAgB;AACrC,QAAM,UAAU,MAAM,kBAAkB;AACxC,QAAM,YAAY,MAAM,wBAAwB;AAChD,QAAM,YAAY,OAAO,OAAO,UAAU,SAAS;AAEnD,MAAI,QAAQ,SAAS,MAAM;AACzB,UAAM,SAAkC,CAAC;AACzC,eAAW,SAAS,cAAc;AAChC,YAAM,WAAW,QAAQ,QAAQ,KAAK;AACtC,YAAM,YAAY,OAAO,OAAO,KAAK,MAAM;AAC3C,aAAO,KAAK,IAAI;AAAA,QACd,UAAU,SAAS;AAAA,QACnB,OAAO,SAAS;AAAA,QAChB,QAAQ,SAAS;AAAA,QACjB;AAAA,MACF;AAAA,IACF;AACA,YAAQ;AAAA,MACN,KAAK;AAAA,QACH;AAAA,UACE,eAAe;AAAA,UACf,SAAS;AAAA,YACP,UAAU,QAAQ;AAAA,YAClB,OAAO,QAAQ;AAAA,YACf,QAAQ,QAAQ;AAAA,UAClB;AAAA,UACA;AAAA,UACA;AAAA,UACA,cAAc,UAAU,IAAI,CAAC,WAAW;AAAA,YACtC,IAAI,MAAM;AAAA,YACV,SAAS,MAAM;AAAA,YACf,WAAW,MAAM;AAAA,YACjB,SAAS,MAAM;AAAA,YACf,eAAe,MAAM,mBAAmB,YAAY,MAAM;AAAA,YAC1D,gBAAgB,MAAM;AAAA,YACtB,OAAO,MAAM;AAAA,YACb,QAAQ,MAAM;AAAA,YACd,YAAY,MAAM;AAAA,YAClB,WAAW,MAAM;AAAA,YACjB,QAAQ,MAAM;AAAA,YACd,GAAI,MAAM,aAAa,iBAAiB,MAAM,aAAa,WACvD,EAAE,WAAW,OAAgB,IAC7B,CAAC;AAAA,UACP,EAAE;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,QAAQ,gBAAgB;AAC3C,UAAQ;AAAA,IACN,sBAAmB,QAAQ,gBAAgB,OAAO,EAAE,CAAC,KAAK,YAAY,QAAQ,cAAc,QAAQ,CAAC;AAAA,EACvG;AACA,UAAQ,IAAI,mBAAmB,UAAU,KAAK,YAAY,QAAQ,cAAc,KAAK,CAAC,GAAG;AACzF,UAAQ,IAAI,EAAE;AACd,UAAQ,IAAI,UAAU;AACtB,aAAW,SAAS,cAAc;AAChC,UAAM,WAAW,QAAQ,QAAQ,KAAK;AACtC,UAAM,YAAY,OAAO,OAAO,KAAK,MAAM;AAC3C,YAAQ;AAAA,MACN;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS,OAAO;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,EAAE;AACd,UAAQ,IAAI,iBAAiB;AAC7B,aAAW,SAAS,WAAW;AAC7B,UAAM,WAAW,MAAM,mBAAmB,eAAe,uBAAuB;AAChF,YAAQ;AAAA,MACN,KAAK,MAAM,SAAS,OAAO,EAAE,CAAC,KAAK,MAAM,WAAW,UAAK,OAAO,EAAE,CAAC,IAAI,MAAM,MAAM,OAAO,EAAE,CAAC,IAAI,MAAM,MAAM,GAAG,QAAQ;AAAA,IAC1H;AAAA,EACF;AACA,MAAI,UAAU,UAAU,aAAa,WAAW;AAC9C,YAAQ;AAAA,MACN;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,YACpB,aACA,UAA2B,CAAC,GACX;AACjB,MAAI,CAAC,kBAAkB,WAAW,GAAG;AACnC;AAAA,MACE,2BAA2B,WAAW;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AACA,QAAM,WAAW;AAEjB,MAAI;AACJ,MAAI,QAAQ,UAAU,QAAW;AAC/B,QAAI,CAAC,aAAa,QAAQ,KAAK,GAAG;AAChC;AAAA,QACE,wBAAwB,QAAQ,KAAK,oBAAoB,aAAa,KAAK,IAAI,CAAC;AAAA,MAClF;AACA,aAAO;AAAA,IACT;AACA,YAAQ,QAAQ;AAAA,EAClB;AAEA,QAAM,SAA+B,QAAQ,YAAY,OAAO,YAAY;AAC5E,MAAI;AACF,UAAM,OAAO,MAAM,qBAAqB;AAAA,MACtC;AAAA,MACA;AAAA,MACA,OAAO,QAAQ;AAAA,MACf;AAAA,IACF,CAAC;AACD,iBAAa,6BAA6B,IAAI,EAAE;AAChD,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,eAAW,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAC3D,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,qBAAqB,OAMvB;AAClB,QAAM,OACJ,MAAM,WAAW,WACb,KAAK,cAAc,GAAG,sBAAsB,IAC5C,KAAK,MAAM,eAAgB,MAAM,eAAe,GAAI,uBAAuB;AAEjF,MAAI,WAAoC,CAAC;AACzC,MAAI;AACF,UAAM,MAAM,MAAM,SAAS,MAAM,OAAO;AACxC,UAAM,SAAkB,KAAK,MAAM,GAAG;AACtC,QAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC3E,iBAAW;AAAA,IACb;AAAA,EACF,SAAS,KAAc;AACrB,QAAK,IAA8B,SAAS,UAAU;AACpD,YAAM,IAAI,MAAM,kBAAkB,IAAI,KAAM,IAAc,OAAO,EAAE;AAAA,IACrE;AAAA,EACF;AAEA,QAAM,eACJ,SAAS,UAAU,QAAQ,OAAO,SAAS,UAAU,YAAY,CAAC,MAAM,QAAQ,SAAS,KAAK,IAC1F,EAAE,GAAI,SAAS,MAAkC,IACjD,CAAC;AAEP,MAAI,MAAM,OAAO;AACf,UAAM,SACJ,aAAa,WAAW,QACxB,OAAO,aAAa,WAAW,YAC/B,CAAC,MAAM,QAAQ,aAAa,MAAM,IAC9B,EAAE,GAAI,aAAa,OAAmC,IACtD,CAAC;AACP,WAAO,MAAM,KAAK,IAAI;AAAA,MACpB,UAAU,MAAM;AAAA,MAChB,GAAI,MAAM,QAAQ,EAAE,OAAO,MAAM,MAAM,IAAI,CAAC;AAAA,IAC9C;AACA,iBAAa,SAAS;AAAA,EACxB,OAAO;AACL,iBAAa,WAAW,MAAM;AAC9B,QAAI,MAAM,MAAO,cAAa,QAAQ,MAAM;AAAA,QACvC,QAAO,aAAa;AAAA,EAC3B;AAEA,WAAS,QAAQ;AACjB,QAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,gBAAgB,MAAM,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAAA,CAAI;AACpE,MAAI,MAAM,aAAa,UAAU;AAC/B,UAAM,EAAE,yBAAyB,IAAI,MAAM,OAAO,2BAA0B;AAC5E,UAAM,yBAAyB;AAAA,MAC7B,MAAM,MAAM,WAAW,YAAY,YAAY;AAAA,MAC/C,GAAI,MAAM,gBAAgB,SAAY,CAAC,IAAI,EAAE,aAAa,MAAM,YAAY;AAAA,IAC9E,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,eAAsB,wBAAwB,UAA4C;AACxF,SAAO,qBAAqB,EAAE,QAAQ,UAAU,SAAS,CAAC;AAC5D;","names":[]}

package/dist/{chunk-QMIQR7EE.js → chunk-62GVVZQO.js}

@@ -8,11 +8,11 @@ import {
 import {
   getActiveResilienceConfig,
   loadIssuesConfig
-} from "./chunk-HY5HLFDU.js";
+} from "./chunk-QF7VEL3M.js";
 import {
   resolveIssuePaths,
   resolveProjectPaths
-} from "./chunk-DV7HUC4Z.js";
+} from "./chunk-LI35PIIS.js";
 import {
   printInfo,
   printWarning
@@ -943,4 +943,4 @@ export {
   IssueResolutionError,
   resolveIssue
 };
-//# sourceMappingURL=chunk-QMIQR7EE.js.map
+//# sourceMappingURL=chunk-62GVVZQO.js.map

package/dist/{chunk-YII4U7ZD.js → chunk-6K2LCFG6.js}

@@ -137,7 +137,7 @@ function resetTelemetryState() {
 async function resolveConfig(ctx) {
   if (ctx.config !== void 0) return ctx.config;
   try {
-    const { loadTelemetryConfig } = await import("./config-KGZUPAUP.js");
+    const { loadTelemetryConfig } = await import("./config-LEBZZCJP.js");
     ctx.config = await loadTelemetryConfig();
     return ctx.config;
   } catch {
@@ -359,4 +359,4 @@ export {
   endExecution,
   recordInvocation
 };
-//# sourceMappingURL=chunk-YII4U7ZD.js.map
+//# sourceMappingURL=chunk-6K2LCFG6.js.map

package/dist/{chunk-A4H7P7T7.js → chunk-7UMMFOL2.js}

@@ -369,7 +369,7 @@ function buildExecutionPlan(input) {
       origin: requested.has(id) ? "requested" : "discovered",
       role,
       externalDependencies: (relations?.blockedBy ?? []).filter(
-        (blocker) => !scheduled.has(blocker)
+        (blocker) => !scheduled.has(blocker) && input.graph.nodes.get(blocker)?.issue?.state !== "closed"
       ),
       // Only the constraints that survive inside the queue: a blocker left out
       // of it is reported in `excluded`, not enforced as a dependency.
@@ -394,7 +394,7 @@ function buildExecutionPlan(input) {
       number: described.number,
       title: described.title,
       url: described.url,
-      reason: "Discovered in the hierarchy but not selected for this run"
+      reason: node.issue?.state === "closed" ? "Already closed before this run" : "Discovered in the hierarchy but not selected for this run"
     });
   }
   return {
@@ -655,4 +655,4 @@ export {
   PIPELINE_PHASES_NO_BRANCH,
   PipelineManager
 };
-//# sourceMappingURL=chunk-A4H7P7T7.js.map
+//# sourceMappingURL=chunk-7UMMFOL2.js.map

package/dist/chunk-7UMMFOL2.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/execution/plan.ts","../src/execution/containers.ts","../src/issues/graph.ts","../src/execution/order.ts","../src/core/pipeline.ts"],"sourcesContent":["import { mkdir, readFile } from 'node:fs/promises';\nimport { dirname } from 'node:path';\nimport { ZodError } from 'zod';\nimport { isoNow } from '../core/state-manager.js';\nimport type { DependencyGraph } from '../issues/graph.js';\nimport type { Issue } from '../issues/types.js';\nimport { executionPlanSchema } from '../storage/schemas.js';\nimport type { LastError, PullRequestRef } from '../types.js';\nimport { writeFileAtomic } from '../utils/fs.js';\nimport { isContainer } from './containers.js';\nimport { priorityOf } from './order.js';\nimport type {\n  ExecutionPlan,\n  ExecutionPlanExcluded,\n  ExecutionPlanIssue,\n  QueueIssueRole,\n  QueueIssueStatus,\n  QueueStatus,\n} from './types.js';\n\n/**\n * Building, reading, writing and advancing the execution plan of a queue.\n *\n * The plan is the only state a multi-issue run adds to the storage tree, and it\n * is written **only** for a queue with more than one Issue — a single-issue run\n * leaves the layout exactly as it was.\n */\n\nexport interface BuildExecutionPlanInput {\n  /** Project id of the global storage tree. */\n  projectId: string;\n  /** Identifiers the user asked for, in order; the first one names the queue. */\n  requested: readonly string[];\n  graph: DependencyGraph;\n  /** Ids to run, already ordered by `computeExecutionOrder`. */\n  order: readonly string[];\n  noBranch?: boolean;\n  prReview?: boolean;\n  /** Injectable clock, so tests can assert `createdAt` vs `updatedAt`. */\n  now?: () => string;\n}\n\nfunction parentOf(graph: DependencyGraph, id: string): string | null {\n  for (const node of graph.nodes.values()) {\n    if (node.relations.children.includes(id)) return node.id;\n  }\n  return null;\n}\n\n/** Title/url/number of a node, falling back to what the id alone tells us. */\nfunction describeIssue(\n  issue: Issue | null,\n  id: string,\n): {\n  number: number | null;\n  title: string;\n  url: string | null;\n  source: string;\n} {\n  const parsed = Number.parseInt(id, 10);\n  return {\n    number: issue?.number ?? (Number.isNaN(parsed) ? null : parsed),\n    title: issue?.title ?? '',\n    url: issue?.remoteRef ?? null,\n    source: issue?.source ?? 'github',\n  };\n}\n\n/**\n * Turn a graph plus an order into the persisted plan.\n *\n * Every Issue of the graph that is *not* in the order becomes an `excluded`\n * entry: the consolidated Pull Request reports them as known pending work, so a\n * hierarchy the user chose to trim never disappears silently.\n */\nexport function buildExecutionPlan(input: BuildExecutionPlanInput): ExecutionPlan {\n  const now = input.now ?? isoNow;\n  const at = now();\n  const scheduled = new Set(input.order);\n  const requested = new Set(input.requested);\n\n  const issues: ExecutionPlanIssue[] = input.order.map((id, index) => {\n    const node = input.graph.nodes.get(id);\n    const relations = node?.relations;\n    const described = describeIssue(node?.issue ?? null, id);\n    const children = relations?.children ?? [];\n    const role: QueueIssueRole = isContainer({\n      issue: node?.issue ?? null,\n      children,\n    })\n      ? 'container'\n      : 'executable';\n\n    return {\n      id,\n      number: described.number,\n      title: described.title,\n      url: described.url,\n      source: described.source,\n      position: index + 1,\n      status: 'pending',\n      origin: requested.has(id) ? 'requested' : 'discovered',\n      role,\n      externalDependencies: (relations?.blockedBy ?? []).filter(\n        (blocker) =>\n          !scheduled.has(blocker) && input.graph.nodes.get(blocker)?.issue?.state !== 'closed',\n      ),\n      // Only the constraints that survive inside the queue: a blocker left out\n      // of it is reported in `excluded`, not enforced as a dependency.\n      dependsOn: (relations?.blockedBy ?? []).filter((blocker) => scheduled.has(blocker)),\n      parent: relations?.parent ?? parentOf(input.graph, id),\n      priority: priorityOf(node?.issue?.labels ?? []),\n      heuristic: (relations?.heuristic.length ?? 0) > 0,\n      failedPhase: null,\n      lastError: null,\n      attempts: 0,\n      blockedReason: null,\n      startedAt: null,\n      completedAt: null,\n    };\n  });\n\n  const excluded: ExecutionPlanExcluded[] = [];\n  for (const node of input.graph.nodes.values()) {\n    if (scheduled.has(node.id)) continue;\n    const described = describeIssue(node.issue, node.id);\n    excluded.push({\n      id: node.id,\n      number: described.number,\n      title: described.title,\n      url: described.url,\n      reason:\n        node.issue?.state === 'closed'\n          ? 'Already closed before this run'\n          : 'Discovered in the hierarchy but not selected for this run',\n    });\n  }\n\n  return {\n    schemaVersion: 1,\n    id: input.requested[0] ?? (input.order[0] as string),\n    project: input.projectId,\n    requested: [...input.requested],\n    branchName: null,\n    noBranch: input.noBranch ?? false,\n    prReview: input.prReview ?? false,\n    status: 'pending',\n    createdAt: at,\n    updatedAt: at,\n    truncated: input.graph.truncated,\n    issues,\n    excluded,\n  };\n}\n\n/** Read a persisted plan. Throws with the offending fields on invalid content. */\nexport async function loadExecutionPlan(path: string): Promise<ExecutionPlan> {\n  const raw: unknown = JSON.parse(await readFile(path, 'utf-8'));\n\n  try {\n    return executionPlanSchema.parse(raw) as ExecutionPlan;\n  } catch (err) {\n    if (err instanceof ZodError) {\n      const issues = err.issues.map((i) => `  - ${i.path.join('.')}: ${i.message}`).join('\\n');\n      throw new Error(`Invalid execution-plan.json at ${path}:\\n${issues}`);\n    }\n    throw err;\n  }\n}\n\n/**\n * Persist a plan atomically, creating the queue directory on first write.\n *\n * `updatedAt` is stamped here so no call site can forget it — the file is the\n * only record of how far a queue got, and a stale timestamp on it is worse than\n * none.\n */\nexport async function saveExecutionPlan(\n  path: string,\n  plan: ExecutionPlan,\n  now: () => string = isoNow,\n): Promise<void> {\n  await mkdir(dirname(path), { recursive: true });\n  const stamped: ExecutionPlan = { ...plan, updatedAt: now() };\n  await writeFileAtomic(path, `${JSON.stringify(stamped, null, 2)}\\n`);\n}\n\n/**\n * The Issue the queue should work on next, or `null` when every one of them is\n * completed.\n *\n * The order of the lookups *is* the resume policy: an interrupted issue\n * (`in_progress`) and a failed one are retried before the queue moves on, and\n * each of them picks up from its own `tasks.json` (phase-level resume) rather\n * than from the start. A `completed` issue is never revisited — that is the\n * whole point of persisting the queue.\n */\nexport interface NextQueueIssueOptions {\n  /**\n   * Ids this invocation is done with, however they ended. A queue that skips a\n   * failing Issue and comes back to it needs a way to say \"not this one again\",\n   * or \"come back later\" becomes \"come back forever\".\n   */\n  exclude?: ReadonlySet<string>;\n}\n\n/**\n * Whether every dependency this Issue declares *inside the queue* is finished.\n *\n * The execution order already places dependencies first, so this only bites\n * once an entry stops being `completed` — skipped, blocked or failed. Handing\n * out an Issue whose blocker was skipped is how a queue produces work that\n * cannot compile.\n */\nfunction dependenciesSatisfied(plan: ExecutionPlan, entry: ExecutionPlanIssue): boolean {\n  return entry.dependsOn.every((id) => {\n    const dependency = plan.issues.find((candidate) => candidate.id === id);\n    if (dependency === undefined) return true;\n    // A container is not work: waiting on it would deadlock the children\n    // that complete it.\n    if (dependency.role === 'container') return true;\n    return dependency.status === 'completed';\n  });\n}\n\n/**\n * The Issue to work on next.\n *\n * The order of the four lookups is the resumption policy:\n * an interrupted Issue first (it was mid-flight), then one that failed on a\n * previous invocation, then the untouched ones, and only at the end the ones\n * this queue deliberately set aside — which is what \"go on with the\n * independent work and come back to it\" means in one line.\n *\n * `blocked` is absent on purpose: it needs a human, and no ordering of the\n * queue changes that.\n */\nexport function nextQueueIssue(\n  plan: ExecutionPlan,\n  options: NextQueueIssueOptions = {},\n): ExecutionPlanIssue | null {\n  const exclude = options.exclude ?? new Set<string>();\n  const eligible = (status: QueueIssueStatus) => (entry: ExecutionPlanIssue) =>\n    entry.role !== 'container' &&\n    entry.status === status &&\n    !exclude.has(entry.id) &&\n    dependenciesSatisfied(plan, entry);\n\n  return (\n    plan.issues.find(eligible('in_progress')) ??\n    plan.issues.find(eligible('failed')) ??\n    plan.issues.find(eligible('pending')) ??\n    plan.issues.find(eligible('skipped')) ??\n    null\n  );\n}\n\n/**\n * Status of the queue derived from its entries.\n *\n * `skipped` is *not* terminal — the queue means to come back to it — so a queue\n * holding one is still `in_progress`. `blocked` is: nothing the queue can do\n * moves it, so a queue that ends with one ends `failed`, which is what a person\n * needs to see.\n */\nexport function queueStatus(plan: ExecutionPlan): QueueStatus {\n  if (plan.issues.some((entry) => entry.status === 'failed' || entry.status === 'blocked')) {\n    return 'failed';\n  }\n  if (plan.issues.every((entry) => entry.status === 'completed')) return 'completed';\n  if (plan.issues.some((entry) => entry.status !== 'pending')) return 'in_progress';\n  return 'pending';\n}\n\n/** Whether every Issue of the queue has been resolved. */\nexport function isQueueComplete(plan: ExecutionPlan): boolean {\n  return plan.issues.every((entry) => entry.status === 'completed');\n}\n\n/** Apply `patch` to one entry and recompute the queue status. Pure. */\nfunction updateIssue(\n  plan: ExecutionPlan,\n  id: string,\n  patch: Partial<ExecutionPlanIssue>,\n): ExecutionPlan {\n  const issues = plan.issues.map((entry) => (entry.id === id ? { ...entry, ...patch } : entry));\n  const next: ExecutionPlan = { ...plan, issues };\n  return { ...next, status: queueStatus(next) };\n}\n\nexport function markQueueIssueInProgress(\n  plan: ExecutionPlan,\n  id: string,\n  now: () => string = isoNow,\n): ExecutionPlan {\n  const current = plan.issues.find((entry) => entry.id === id);\n  return updateIssue(plan, id, {\n    status: 'in_progress',\n    // Preserved across a resume: the queue reports when the work on this Issue\n    // really began, not when it was last picked up.\n    startedAt: current?.startedAt ?? now(),\n    failedPhase: null,\n    lastError: null,\n  });\n}\n\nfunction completeResolvedContainers(plan: ExecutionPlan, now: () => string): ExecutionPlan {\n  let next = plan;\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const entry of next.issues) {\n      if (entry.role !== 'container' || entry.status === 'completed') continue;\n      const children = next.issues.filter((candidate) => candidate.parent === entry.id);\n      if (children.length === 0) continue;\n      if (children.every((child) => child.status === 'completed')) {\n        next = updateIssue(next, entry.id, {\n          status: 'completed',\n          completedAt: now(),\n          failedPhase: null,\n          lastError: null,\n        });\n        changed = true;\n      }\n    }\n  }\n  return next;\n}\n\nexport function markQueueIssueCompleted(\n  plan: ExecutionPlan,\n  id: string,\n  now: () => string = isoNow,\n): ExecutionPlan {\n  return completeResolvedContainers(\n    updateIssue(plan, id, {\n      status: 'completed',\n      completedAt: now(),\n      failedPhase: null,\n      lastError: null,\n    }),\n    now,\n  );\n}\n\nexport function markQueueIssueFailed(\n  plan: ExecutionPlan,\n  id: string,\n  failure: { phase: string | null; error: LastError | null },\n): ExecutionPlan {\n  const current = plan.issues.find((entry) => entry.id === id);\n  return updateIssue(plan, id, {\n    status: 'failed',\n    failedPhase: failure.phase,\n    lastError: failure.error,\n    attempts: (current?.attempts ?? 0) + 1,\n  });\n}\n\n/**\n * Set an Issue aside and come back to it later.\n *\n * The difference from `failed` is the whole point of `--on-issue-failure skip`:\n * a failure that stopped this attempt is not a verdict on the eleven other\n * Issues in the queue, and `skipped` is the status that says \"not now\" rather\n * than \"not at all\". `attempts` is incremented here because the counter is what\n * keeps \"come back later\" from becoming \"come back forever\".\n */\nexport function markQueueIssueSkipped(\n  plan: ExecutionPlan,\n  id: string,\n  failure: { phase: string | null; error: LastError | null },\n): ExecutionPlan {\n  const current = plan.issues.find((entry) => entry.id === id);\n  return updateIssue(plan, id, {\n    status: 'skipped',\n    failedPhase: failure.phase,\n    lastError: failure.error,\n    attempts: (current?.attempts ?? 0) + 1,\n  });\n}\n\n/**\n * Stop working on an Issue until a person looks at it.\n *\n * `blocked` is never handed back out by `nextQueueIssue`: waiting cannot fix\n * a missing credential or a repository mid-rebase, and a queue that could\n * unblock itself would spin on the same cause forever.\n */\nexport function markQueueIssueBlocked(\n  plan: ExecutionPlan,\n  id: string,\n  reason: string,\n  failure: { phase: string | null; error: LastError | null },\n): ExecutionPlan {\n  const current = plan.issues.find((entry) => entry.id === id);\n  return updateIssue(plan, id, {\n    status: 'blocked',\n    blockedReason: reason,\n    failedPhase: failure.phase,\n    lastError: failure.error,\n    attempts: (current?.attempts ?? 0) + 1,\n  });\n}\n\n/** Record the branch every Issue of the queue shares. */\nexport function setQueueBranch(plan: ExecutionPlan, branchName: string): ExecutionPlan {\n  return { ...plan, branchName };\n}\n\n/** Record the single Pull Request that consolidated the queue. */\nexport function setQueuePullRequest(\n  plan: ExecutionPlan,\n  pullRequest: PullRequestRef,\n): ExecutionPlan {\n  return { ...plan, pullRequest };\n}\n","import type { DependencyGraph } from '../issues/graph.js';\nimport type { Issue } from '../issues/types.js';\n\nexport const CONTAINER_SIGNALS = ['children', 'issue-type', 'label', 'title-prefix'] as const;\n\nexport type ContainerSignal = (typeof CONTAINER_SIGNALS)[number];\n\nexport interface ContainerConfig {\n  detect: readonly ContainerSignal[];\n  issueTypes: readonly string[];\n  labels: readonly string[];\n  titlePrefixes: readonly string[];\n}\n\n/** Unconfigured repos: only the universal signal. */\nexport const DEFAULT_CONTAINER_CONFIG: ContainerConfig = {\n  detect: ['children'],\n  issueTypes: ['Epic'],\n  labels: ['epic'],\n  titlePrefixes: ['[Epic]'],\n};\n\nexport interface ContainerProbe {\n  issue: Pick<Issue, 'title' | 'labels' | 'type'> | null;\n  children: readonly string[];\n}\n\nfunction enabled(config: ContainerConfig, signal: ContainerSignal): boolean {\n  return config.detect.includes(signal);\n}\n\nfunction hasTitlePrefix(title: string, prefixes: readonly string[]): boolean {\n  const trimmed = title.trim();\n  return prefixes.some((prefix) => trimmed.toLowerCase().startsWith(prefix.toLowerCase()));\n}\n\n/**\n * Precedence: children > issue type > label > title prefix.\n * Having children always wins when that signal is enabled.\n */\nexport function isContainer(\n  probe: ContainerProbe,\n  config: ContainerConfig = DEFAULT_CONTAINER_CONFIG,\n): boolean {\n  if (enabled(config, 'children') && probe.children.length > 0) return true;\n\n  const issue = probe.issue;\n  if (issue === null) return false;\n\n  if (enabled(config, 'issue-type')) {\n    const type = issue.type?.trim();\n    if (\n      type !== undefined &&\n      type !== '' &&\n      config.issueTypes.some((name) => name.toLowerCase() === type.toLowerCase())\n    ) {\n      return true;\n    }\n  }\n\n  if (enabled(config, 'label')) {\n    const labels = new Set(issue.labels.map((label) => label.toLowerCase()));\n    if (config.labels.some((label) => labels.has(label.toLowerCase()))) return true;\n  }\n\n  if (enabled(config, 'title-prefix') && hasTitlePrefix(issue.title, config.titlePrefixes)) {\n    return true;\n  }\n\n  return false;\n}\n\n/** Root plus every descendant reached through `children`. */\nexport function collectCascadeIds(graph: DependencyGraph, roots: readonly string[]): string[] {\n  const ids = new Set<string>();\n  const walk = (id: string): void => {\n    if (ids.has(id)) return;\n    ids.add(id);\n    for (const child of graph.nodes.get(id)?.relations.children ?? []) {\n      walk(child);\n    }\n  };\n  for (const root of roots) walk(root);\n  return [...ids];\n}\n","import { emptyRelations, uniqueIds } from './relations.js';\nimport type { Issue, IssueRelations } from './types.js';\n\n/**\n * Dependency graph of a set of Issues, built by walking the relations every\n * provider exposes through `fetchRelations`.\n *\n * The traversal is deliberately *structural*: it follows hierarchy\n * (parent/children) and dependencies (blockedBy/blocking) and stops there. Plain\n * mentions are recorded on each node but never expanded — a body citing \"see\n * also #12\" would otherwise drag an unrelated Issue into an execution plan the\n * user is about to confirm.\n */\n\nexport interface DependencyGraphNode {\n  id: string;\n  relations: IssueRelations;\n  /** Distance from the closest root, in traversal hops. */\n  depth: number;\n  /** The Issue itself, when the caller supplied a way to read it. */\n  issue: Issue | null;\n  /** True when the node was requested by the user rather than discovered. */\n  root: boolean;\n}\n\nexport interface DependencyGraph {\n  /** Ids the traversal started from, in the order they were requested. */\n  roots: string[];\n  /** Every discovered node, keyed by id, in discovery order. */\n  nodes: Map<string, DependencyGraphNode>;\n  /**\n   * Dependency cycles found among the discovered nodes, each listed once,\n   * starting at its smallest member. Reported rather than thrown: discovery\n   * must still answer, and it is the ordering layer that refuses to run.\n   */\n  cycles: string[][];\n  /** True when a limit stopped the traversal before it was exhausted. */\n  truncated: boolean;\n  limits: { maxNodes: number; maxDepth: number };\n}\n\n/**\n * Conservative defaults: a real hierarchy is a handful of Issues, and each node\n * costs several API calls. A malformed (or simply huge) graph must not turn a\n * `run` into a rate-limit incident.\n */\nexport const DEFAULT_MAX_NODES = 25;\nexport const DEFAULT_MAX_DEPTH = 3;\n\nexport interface BuildDependencyGraphOptions {\n  maxNodes?: number;\n  maxDepth?: number;\n  /** Issues the caller already resolved, so the traversal does not re-read them. */\n  known?: Iterable<Issue>;\n  /** Reader for the Issues the traversal discovers. Optional. */\n  fetchIssue?: (id: string) => Promise<Issue | null>;\n  /** Warning sink for a source that failed. Silent by default. */\n  warn?: (message: string) => void;\n}\n\n/** Edge `from` → `to`, meaning \"`from` must be resolved before `to`\". */\nexport interface DependencyEdge {\n  from: string;\n  to: string;\n}\n\n/**\n * Ordering constraints of a graph: only hierarchy-free, explicit dependencies.\n *\n * `blockedBy`/`blocking` are the two spellings of the same fact, so both are\n * normalized into a single direction here. Parent/child is **not** a constraint\n * — it is a presentation and tie-breaking concern (see `computeExecutionOrder`),\n * because a parent is usually an umbrella that neither blocks nor is blocked by\n * its children.\n *\n * Edges pointing outside the graph are dropped: an Issue the traversal never\n * reached cannot be scheduled, so a constraint against it is unenforceable.\n */\nexport function dependencyEdges(graph: DependencyGraph): DependencyEdge[] {\n  const edges: DependencyEdge[] = [];\n  const seen = new Set<string>();\n\n  const add = (from: string, to: string): void => {\n    if (from === to || !graph.nodes.has(from) || !graph.nodes.has(to)) return;\n    const key = `${from}->${to}`;\n    if (seen.has(key)) return;\n    seen.add(key);\n    edges.push({ from, to });\n  };\n\n  for (const node of graph.nodes.values()) {\n    for (const blocker of node.relations.blockedBy) {\n      add(blocker, node.id);\n    }\n    for (const blocked of node.relations.blocking) {\n      add(node.id, blocked);\n    }\n  }\n\n  return edges;\n}\n\n/** Every cycle of the dependency edges, each reported once. */\nexport function findCycles(graph: DependencyGraph): string[][] {\n  const adjacency = new Map<string, string[]>();\n  for (const { from, to } of dependencyEdges(graph)) {\n    const list = adjacency.get(from);\n    if (list === undefined) {\n      adjacency.set(from, [to]);\n    } else {\n      list.push(to);\n    }\n  }\n\n  const cycles: string[][] = [];\n  const reported = new Set<string>();\n  const state = new Map<string, 'visiting' | 'done'>();\n  const stack: string[] = [];\n\n  const record = (cycle: string[]): void => {\n    // Rotate to the smallest member so the same cycle found from two entry\n    // points is reported once.\n    let pivot = 0;\n    for (let i = 1; i < cycle.length; i++) {\n      if (compareIds(cycle[i] as string, cycle[pivot] as string) < 0) pivot = i;\n    }\n    const normalized = [...cycle.slice(pivot), ...cycle.slice(0, pivot)];\n    const key = normalized.join('->');\n    if (reported.has(key)) return;\n    reported.add(key);\n    cycles.push(normalized);\n  };\n\n  const visit = (id: string): void => {\n    state.set(id, 'visiting');\n    stack.push(id);\n\n    for (const next of adjacency.get(id) ?? []) {\n      const status = state.get(next);\n      if (status === 'visiting') {\n        record(stack.slice(stack.indexOf(next)));\n        continue;\n      }\n      if (status === undefined) {\n        visit(next);\n      }\n    }\n\n    stack.pop();\n    state.set(id, 'done');\n  };\n\n  for (const id of graph.nodes.keys()) {\n    if (!state.has(id)) visit(id);\n  }\n\n  return cycles;\n}\n\n/** Numeric when both ids are numbers, lexicographic otherwise. */\nexport function compareIds(a: string, b: string): number {\n  const na = Number(a);\n  const nb = Number(b);\n  if (Number.isInteger(na) && Number.isInteger(nb)) {\n    return na - nb;\n  }\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\n/** Ids a node links to structurally, in traversal order. */\nfunction neighbours(relations: IssueRelations): string[] {\n  return uniqueIds(\n    [\n      ...(relations.parent === null ? [] : [relations.parent]),\n      ...relations.children,\n      ...relations.blockedBy,\n      ...relations.blocking,\n    ],\n    relations.id,\n  );\n}\n\n/**\n * Walk the relations of `roots` breadth-first and return the whole structure.\n *\n * Failures never abort the walk: a node whose relations cannot be read enters\n * the graph with empty relations (and a warning), exactly like an Issue that\n * genuinely relates to nothing. That keeps a partially unavailable API from\n * costing the user the Issues that *were* discovered.\n *\n * Breadth-first is what makes `depth` meaningful under a limit: when the walk is\n * truncated, what is missing is the far edge of the graph, not a random subset.\n */\nexport async function buildDependencyGraph(\n  roots: readonly string[],\n  fetchRelations: (id: string) => Promise<IssueRelations | null>,\n  options: BuildDependencyGraphOptions = {},\n): Promise<DependencyGraph> {\n  const maxNodes = options.maxNodes ?? DEFAULT_MAX_NODES;\n  const maxDepth = options.maxDepth ?? DEFAULT_MAX_DEPTH;\n  const warn = options.warn ?? ((): void => {});\n\n  const known = new Map<string, Issue>();\n  for (const issue of options.known ?? []) {\n    known.set(issue.id, issue);\n  }\n\n  const rootIds = uniqueIds(roots);\n  const nodes = new Map<string, DependencyGraphNode>();\n  const queued = new Set<string>(rootIds);\n  let truncated = false;\n\n  let frontier: { id: string; depth: number }[] = rootIds.map((id) => ({ id, depth: 0 }));\n\n  while (frontier.length > 0) {\n    const next: { id: string; depth: number }[] = [];\n\n    for (const { id, depth } of frontier) {\n      if (nodes.size >= maxNodes) {\n        truncated = true;\n        break;\n      }\n\n      let relations: IssueRelations | null = null;\n      try {\n        relations = await fetchRelations(id);\n      } catch (err) {\n        warn(\n          `Could not read the relations of issue '${id}': ${err instanceof Error ? err.message : String(err)}`,\n        );\n      }\n\n      let issue = known.get(id) ?? null;\n      if (issue === null && options.fetchIssue !== undefined) {\n        try {\n          issue = await options.fetchIssue(id);\n        } catch (err) {\n          warn(`Could not read issue '${id}': ${err instanceof Error ? err.message : String(err)}`);\n        }\n      }\n\n      const resolved = relations ?? emptyRelations(id);\n      nodes.set(id, { id, relations: resolved, depth, issue, root: rootIds.includes(id) });\n\n      if (depth >= maxDepth) {\n        // Only a node that actually has unexplored neighbours truncates the\n        // graph; a leaf at max depth explored everything there was.\n        if (neighbours(resolved).some((neighbour) => !queued.has(neighbour))) {\n          truncated = true;\n        }\n        continue;\n      }\n\n      for (const neighbour of neighbours(resolved)) {\n        if (queued.has(neighbour)) continue;\n        queued.add(neighbour);\n        next.push({ id: neighbour, depth: depth + 1 });\n      }\n    }\n\n    if (nodes.size >= maxNodes && next.length > 0) {\n      truncated = true;\n      break;\n    }\n    frontier = next;\n  }\n\n  const graph: DependencyGraph = {\n    roots: rootIds,\n    nodes,\n    cycles: [],\n    truncated,\n    limits: { maxNodes, maxDepth },\n  };\n\n  linkReferencedBy(graph);\n  graph.cycles = findCycles(graph);\n\n  return graph;\n}\n\n/**\n * Complete `referencedBy` with the inverse of `references` among the discovered\n * nodes.\n *\n * The origin only reports the citations it can see (GitHub's timeline covers\n * cross-references but not, for instance, a mention added by the textual\n * heuristic); inverting what the graph already holds costs no API call and\n * keeps the two directions consistent inside it.\n */\nfunction linkReferencedBy(graph: DependencyGraph): void {\n  for (const node of graph.nodes.values()) {\n    for (const cited of node.relations.references) {\n      const target = graph.nodes.get(cited);\n      if (target === undefined || target.id === node.id) continue;\n      target.relations.referencedBy = uniqueIds(\n        [...target.relations.referencedBy, node.id],\n        target.id,\n      );\n    }\n  }\n}\n","import { compareIds, type DependencyGraph, dependencyEdges, findCycles } from '../issues/graph.js';\nimport type { IssuePriority } from './types.js';\n\n/**\n * Turning a dependency graph into the order the queue runs in.\n *\n * The criteria are applied in the exact precedence the initiative specifies:\n *\n * 1. **dependencies and blocks** — hard constraints; an Issue never starts\n *    before something it depends on has finished. This is the topological part\n *    and the only one that can make the computation fail (a cycle);\n * 2. **hierarchy** — with two Issues both ready to run, the ancestor goes\n *    first, so an umbrella Issue frames the work of its sub-issues;\n * 3. **priority** — the GitHub labels `high`, `medium` and `low`;\n * 4. **logical order** — the identifier, numerically when it is a number.\n *\n * Everything below the first item is a *tie-break among Issues that are already\n * free to run*, never a constraint: a `high` Issue that depends on a `low` one\n * still runs second, which is the whole point of the feature.\n */\n\nconst PRIORITY_LABELS: Record<string, IssuePriority> = {\n  high: 'high',\n  medium: 'medium',\n  low: 'low',\n};\n\n/** Ranking of a priority; an Issue with no label sorts after every labelled one. */\nconst PRIORITY_RANK: Record<IssuePriority, number> = { high: 0, medium: 1, low: 2 };\nconst NO_PRIORITY_RANK = 3;\n\n/**\n * Priority carried by a label set, or `null` when there is none.\n *\n * Both the bare labels used by this repository (`high`) and the qualified\n * spellings other projects use (`priority: high`, `priority/high`, `P-high`)\n * are accepted; anything else is simply not a priority. The absence of a label\n * is never an error — most Issues have none.\n */\nexport function priorityOf(labels: readonly string[]): IssuePriority | null {\n  for (const label of labels) {\n    const normalized = label.trim().toLowerCase();\n    const direct = PRIORITY_LABELS[normalized];\n    if (direct !== undefined) return direct;\n\n    const qualified = /^(?:priority|prio|p)\\s*[:/-]\\s*(high|medium|low)$/.exec(normalized);\n    const matched = qualified?.[1];\n    if (matched !== undefined) return PRIORITY_LABELS[matched] as IssuePriority;\n  }\n  return null;\n}\n\nexport interface ExecutionOrderOptions {\n  /**\n   * Subset of the graph to schedule. Defaults to every node — the \"run the\n   * whole hierarchy\" answer; the \"only the ones I asked for\" answer passes the\n   * requested ids.\n   */\n  include?: readonly string[];\n}\n\nexport type ExecutionOrderResult =\n  | { ok: true; order: string[] }\n  | { ok: false; cycles: string[][] };\n\n/** Number of ancestors of `id` inside the selection: 0 for a top-level Issue. */\nfunction hierarchyDepth(\n  id: string,\n  parentOf: Map<string, string | null>,\n  selected: Set<string>,\n): number {\n  let depth = 0;\n  let current = parentOf.get(id) ?? null;\n  const seen = new Set<string>([id]);\n\n  while (current !== null && selected.has(current) && !seen.has(current)) {\n    depth++;\n    seen.add(current);\n    current = parentOf.get(current) ?? null;\n  }\n\n  return depth;\n}\n\n/**\n * Order the selected Issues of a graph.\n *\n * Kahn's algorithm with a deterministic tie-break, so the same graph always\n * produces the same order — a plan the user confirmed must not reshuffle itself\n * on the next run.\n *\n * A cycle is reported, never worked around: an arbitrary order would silently\n * implement an Issue before its dependency, which is exactly the failure this\n * whole feature exists to prevent. Constraints pointing outside the selection\n * are dropped — an Issue that is not going to run cannot block anything.\n */\nexport function computeExecutionOrder(\n  graph: DependencyGraph,\n  options: ExecutionOrderOptions = {},\n): ExecutionOrderResult {\n  const selected = new Set(\n    (options.include ?? [...graph.nodes.keys()]).filter((id) => graph.nodes.has(id)),\n  );\n\n  const parentOf = new Map<string, string | null>();\n  const priority = new Map<string, IssuePriority | null>();\n  for (const id of selected) {\n    const node = graph.nodes.get(id);\n    parentOf.set(id, node?.relations.parent ?? null);\n    priority.set(id, priorityOf(node?.issue?.labels ?? []));\n  }\n\n  const incoming = new Map<string, Set<string>>();\n  const outgoing = new Map<string, string[]>();\n  for (const id of selected) {\n    incoming.set(id, new Set());\n    outgoing.set(id, []);\n  }\n  for (const { from, to } of dependencyEdges(graph)) {\n    if (!selected.has(from) || !selected.has(to) || from === to) continue;\n    incoming.get(to)?.add(from);\n    outgoing.get(from)?.push(to);\n  }\n\n  const depth = new Map<string, number>();\n  for (const id of selected) {\n    depth.set(id, hierarchyDepth(id, parentOf, selected));\n  }\n\n  const rank = (id: string): number => {\n    const value = priority.get(id) ?? null;\n    return value === null ? NO_PRIORITY_RANK : PRIORITY_RANK[value];\n  };\n\n  const better = (a: string, b: string): number => {\n    const byHierarchy = (depth.get(a) ?? 0) - (depth.get(b) ?? 0);\n    if (byHierarchy !== 0) return byHierarchy;\n    const byPriority = rank(a) - rank(b);\n    if (byPriority !== 0) return byPriority;\n    return compareIds(a, b);\n  };\n\n  const ready = [...selected].filter((id) => (incoming.get(id)?.size ?? 0) === 0);\n  const order: string[] = [];\n\n  while (ready.length > 0) {\n    ready.sort(better);\n    const next = ready.shift() as string;\n    order.push(next);\n\n    for (const dependent of outgoing.get(next) ?? []) {\n      const pending = incoming.get(dependent);\n      if (pending === undefined) continue;\n      pending.delete(next);\n      if (pending.size === 0) {\n        ready.push(dependent);\n      }\n    }\n  }\n\n  if (order.length !== selected.size) {\n    // Prefer the cycles the graph already recorded; recompute only if the\n    // selection is what closed the loop.\n    const cycles = graph.cycles.length > 0 ? graph.cycles : findCycles(graph);\n    const relevant = cycles.filter((cycle) => cycle.every((id) => selected.has(id)));\n    return { ok: false, cycles: relevant.length > 0 ? relevant : cycles };\n  }\n\n  return { ok: true, order };\n}\n\n/** One-line description of the cycles, for an error message. */\nexport function describeCycles(cycles: readonly string[][]): string {\n  return cycles.map((cycle) => [...cycle, cycle[0]].map((id) => `#${id}`).join(' → ')).join('; ');\n}\n","import type { PipelineState, TaskPlan } from '../types.js';\nimport { loadTaskPlan, saveTaskPlan } from './state-manager.js';\n\n/**\n * Ordered pipeline phases. Each phase must complete before the next can start.\n *\n * `pr-review` is deliberately NOT here: it is opt-in via `--pr-review`. Adding\n * it to the default set would make every existing `tasks.json` (which has no\n * `prReviewCompleted`) look unfinished, so `getNextPhase()` would resume into a\n * phase the user never asked for.\n */\nexport const PIPELINE_PHASES = ['init', 'prd', 'plan', 'execute', 'review', 'pr'] as const;\n\n/**\n * The default set plus the opt-in `pr-review` phase, used when the user passes\n * `--pr-review` (or the flag was persisted in `plan.prReview.enabled`).\n */\nexport const PIPELINE_PHASES_WITH_PR_REVIEW = [...PIPELINE_PHASES, 'pr-review'] as const;\n\nexport type PipelinePhase = (typeof PIPELINE_PHASES_WITH_PR_REVIEW)[number];\n\n/**\n * Pipeline phases excluding the 'pr' phase, for --no-branch mode.\n * `pr-review` is excluded too: without a branch there is no PR to review.\n */\nexport const PIPELINE_PHASES_NO_BRANCH = PIPELINE_PHASES.filter(\n  (p): p is Exclude<PipelinePhase, 'pr' | 'pr-review'> => p !== 'pr',\n);\n\n/**\n * Map pipeline phases to their corresponding PipelineState field.\n * 'init' has no persisted state — it's a runtime-only check.\n */\nconst PHASE_TO_FIELD: Record<PipelinePhase, keyof PipelineState | null> = {\n  init: null,\n  prd: 'prdCompleted',\n  plan: 'jsonCompleted',\n  execute: 'executionCompleted',\n  review: 'reviewCompleted',\n  pr: 'prCreated',\n  'pr-review': 'prReviewCompleted',\n};\n\nexport class PipelineManager {\n  private tasksJsonPath: string;\n  private plan: TaskPlan;\n  private activePhases: readonly PipelinePhase[];\n\n  constructor(plan: TaskPlan, tasksJsonPath: string, activePhases?: readonly PipelinePhase[]) {\n    this.plan = plan;\n    this.tasksJsonPath = tasksJsonPath;\n    this.activePhases = activePhases ?? PIPELINE_PHASES;\n  }\n\n  /**\n   * Reload state from disk.\n   */\n  async reload(): Promise<void> {\n    this.plan = await loadTaskPlan(this.tasksJsonPath);\n  }\n\n  /**\n   * Check if a phase is complete.\n   */\n  isPhaseComplete(phase: PipelinePhase): boolean {\n    const field = PHASE_TO_FIELD[phase];\n    if (field === null) return true; // init is always \"complete\" after running\n    return this.plan.pipeline?.[field] ?? false;\n  }\n\n  /**\n   * Get the first incomplete phase in the pipeline.\n   * Returns null if all phases are complete.\n   */\n  getNextPhase(): PipelinePhase | null {\n    for (const phase of this.activePhases) {\n      if (!this.isPhaseComplete(phase)) {\n        return phase;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Get the current phase (alias for getNextPhase).\n   */\n  getCurrentPhase(): PipelinePhase | null {\n    return this.getNextPhase();\n  }\n\n  /**\n   * Check whether we can resume from a specific phase.\n   * All prerequisite phases must be complete.\n   */\n  canResume(fromPhase: PipelinePhase): boolean {\n    const idx = this.activePhases.indexOf(fromPhase);\n    if (idx < 0) return false;\n\n    // All active phases before fromPhase must be complete\n    for (let i = 0; i < idx; i++) {\n      if (!this.isPhaseComplete(this.activePhases[i])) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Mark a phase as complete and persist to disk.\n   */\n  async markPhaseComplete(phase: PipelinePhase): Promise<void> {\n    const field = PHASE_TO_FIELD[phase];\n    if (field === null) return; // init has no persisted state\n\n    this.plan = {\n      ...this.plan,\n      pipeline: {\n        ...(this.plan.pipeline ?? {\n          prdCompleted: false,\n          jsonCompleted: false,\n          executionCompleted: false,\n          reviewCompleted: false,\n          prCreated: false,\n        }),\n        [field]: true,\n      },\n    };\n\n    await saveTaskPlan(this.tasksJsonPath, this.plan);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,SAAS,OAAO,gBAAgB;AAChC,SAAS,eAAe;AACxB,SAAS,gBAAgB;;;ACalB,IAAM,2BAA4C;AAAA,EACvD,QAAQ,CAAC,UAAU;AAAA,EACnB,YAAY,CAAC,MAAM;AAAA,EACnB,QAAQ,CAAC,MAAM;AAAA,EACf,eAAe,CAAC,QAAQ;AAC1B;AAOA,SAAS,QAAQ,QAAyB,QAAkC;AAC1E,SAAO,OAAO,OAAO,SAAS,MAAM;AACtC;AAEA,SAAS,eAAe,OAAe,UAAsC;AAC3E,QAAM,UAAU,MAAM,KAAK;AAC3B,SAAO,SAAS,KAAK,CAAC,WAAW,QAAQ,YAAY,EAAE,WAAW,OAAO,YAAY,CAAC,CAAC;AACzF;AAMO,SAAS,YACd,OACA,SAA0B,0BACjB;AACT,MAAI,QAAQ,QAAQ,UAAU,KAAK,MAAM,SAAS,SAAS,EAAG,QAAO;AAErE,QAAM,QAAQ,MAAM;AACpB,MAAI,UAAU,KAAM,QAAO;AAE3B,MAAI,QAAQ,QAAQ,YAAY,GAAG;AACjC,UAAM,OAAO,MAAM,MAAM,KAAK;AAC9B,QACE,SAAS,UACT,SAAS,MACT,OAAO,WAAW,KAAK,CAAC,SAAS,KAAK,YAAY,MAAM,KAAK,YAAY,CAAC,GAC1E;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,QAAQ,QAAQ,OAAO,GAAG;AAC5B,UAAM,SAAS,IAAI,IAAI,MAAM,OAAO,IAAI,CAAC,UAAU,MAAM,YAAY,CAAC,CAAC;AACvE,QAAI,OAAO,OAAO,KAAK,CAAC,UAAU,OAAO,IAAI,MAAM,YAAY,CAAC,CAAC,EAAG,QAAO;AAAA,EAC7E;AAEA,MAAI,QAAQ,QAAQ,cAAc,KAAK,eAAe,MAAM,OAAO,OAAO,aAAa,GAAG;AACxF,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGO,SAAS,kBAAkB,OAAwB,OAAoC;AAC5F,QAAM,MAAM,oBAAI,IAAY;AAC5B,QAAM,OAAO,CAAC,OAAqB;AACjC,QAAI,IAAI,IAAI,EAAE,EAAG;AACjB,QAAI,IAAI,EAAE;AACV,eAAW,SAAS,MAAM,MAAM,IAAI,EAAE,GAAG,UAAU,YAAY,CAAC,GAAG;AACjE,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AACA,aAAW,QAAQ,MAAO,MAAK,IAAI;AACnC,SAAO,CAAC,GAAG,GAAG;AAChB;;;ACtCO,IAAM,oBAAoB;AAC1B,IAAM,oBAAoB;AA+B1B,SAAS,gBAAgB,OAA0C;AACxE,QAAM,QAA0B,CAAC;AACjC,QAAM,OAAO,oBAAI,IAAY;AAE7B,QAAM,MAAM,CAAC,MAAc,OAAqB;AAC9C,QAAI,SAAS,MAAM,CAAC,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,MAAM,IAAI,EAAE,EAAG;AACnE,UAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,UAAM,KAAK,EAAE,MAAM,GAAG,CAAC;AAAA,EACzB;AAEA,aAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,eAAW,WAAW,KAAK,UAAU,WAAW;AAC9C,UAAI,SAAS,KAAK,EAAE;AAAA,IACtB;AACA,eAAW,WAAW,KAAK,UAAU,UAAU;AAC7C,UAAI,KAAK,IAAI,OAAO;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AACT;AAGO,SAAS,WAAW,OAAoC;AAC7D,QAAM,YAAY,oBAAI,IAAsB;AAC5C,aAAW,EAAE,MAAM,GAAG,KAAK,gBAAgB,KAAK,GAAG;AACjD,UAAM,OAAO,UAAU,IAAI,IAAI;AAC/B,QAAI,SAAS,QAAW;AACtB,gBAAU,IAAI,MAAM,CAAC,EAAE,CAAC;AAAA,IAC1B,OAAO;AACL,WAAK,KAAK,EAAE;AAAA,IACd;AAAA,EACF;AAEA,QAAM,SAAqB,CAAC;AAC5B,QAAM,WAAW,oBAAI,IAAY;AACjC,QAAM,QAAQ,oBAAI,IAAiC;AACnD,QAAM,QAAkB,CAAC;AAEzB,QAAM,SAAS,CAAC,UAA0B;AAGxC,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,WAAW,MAAM,CAAC,GAAa,MAAM,KAAK,CAAW,IAAI,EAAG,SAAQ;AAAA,IAC1E;AACA,UAAM,aAAa,CAAC,GAAG,MAAM,MAAM,KAAK,GAAG,GAAG,MAAM,MAAM,GAAG,KAAK,CAAC;AACnE,UAAM,MAAM,WAAW,KAAK,IAAI;AAChC,QAAI,SAAS,IAAI,GAAG,EAAG;AACvB,aAAS,IAAI,GAAG;AAChB,WAAO,KAAK,UAAU;AAAA,EACxB;AAEA,QAAM,QAAQ,CAAC,OAAqB;AAClC,UAAM,IAAI,IAAI,UAAU;AACxB,UAAM,KAAK,EAAE;AAEb,eAAW,QAAQ,UAAU,IAAI,EAAE,KAAK,CAAC,GAAG;AAC1C,YAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,UAAI,WAAW,YAAY;AACzB,eAAO,MAAM,MAAM,MAAM,QAAQ,IAAI,CAAC,CAAC;AACvC;AAAA,MACF;AACA,UAAI,WAAW,QAAW;AACxB,cAAM,IAAI;AAAA,MACZ;AAAA,IACF;AAEA,UAAM,IAAI;AACV,UAAM,IAAI,IAAI,MAAM;AAAA,EACtB;AAEA,aAAW,MAAM,MAAM,MAAM,KAAK,GAAG;AACnC,QAAI,CAAC,MAAM,IAAI,EAAE,EAAG,OAAM,EAAE;AAAA,EAC9B;AAEA,SAAO;AACT;AAGO,SAAS,WAAW,GAAW,GAAmB;AACvD,QAAM,KAAK,OAAO,CAAC;AACnB,QAAM,KAAK,OAAO,CAAC;AACnB,MAAI,OAAO,UAAU,EAAE,KAAK,OAAO,UAAU,EAAE,GAAG;AAChD,WAAO,KAAK;AAAA,EACd;AACA,SAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;AAGA,SAAS,WAAW,WAAqC;AACvD,SAAO;AAAA,IACL;AAAA,MACE,GAAI,UAAU,WAAW,OAAO,CAAC,IAAI,CAAC,UAAU,MAAM;AAAA,MACtD,GAAG,UAAU;AAAA,MACb,GAAG,UAAU;AAAA,MACb,GAAG,UAAU;AAAA,IACf;AAAA,IACA,UAAU;AAAA,EACZ;AACF;AAaA,eAAsB,qBACpB,OACA,gBACA,UAAuC,CAAC,GACd;AAC1B,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,OAAO,QAAQ,SAAS,MAAY;AAAA,EAAC;AAE3C,QAAM,QAAQ,oBAAI,IAAmB;AACrC,aAAW,SAAS,QAAQ,SAAS,CAAC,GAAG;AACvC,UAAM,IAAI,MAAM,IAAI,KAAK;AAAA,EAC3B;AAEA,QAAM,UAAU,UAAU,KAAK;AAC/B,QAAM,QAAQ,oBAAI,IAAiC;AACnD,QAAM,SAAS,IAAI,IAAY,OAAO;AACtC,MAAI,YAAY;AAEhB,MAAI,WAA4C,QAAQ,IAAI,CAAC,QAAQ,EAAE,IAAI,OAAO,EAAE,EAAE;AAEtF,SAAO,SAAS,SAAS,GAAG;AAC1B,UAAM,OAAwC,CAAC;AAE/C,eAAW,EAAE,IAAI,MAAM,KAAK,UAAU;AACpC,UAAI,MAAM,QAAQ,UAAU;AAC1B,oBAAY;AACZ;AAAA,MACF;AAEA,UAAI,YAAmC;AACvC,UAAI;AACF,oBAAY,MAAM,eAAe,EAAE;AAAA,MACrC,SAAS,KAAK;AACZ;AAAA,UACE,0CAA0C,EAAE,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,QACpG;AAAA,MACF;AAEA,UAAI,QAAQ,MAAM,IAAI,EAAE,KAAK;AAC7B,UAAI,UAAU,QAAQ,QAAQ,eAAe,QAAW;AACtD,YAAI;AACF,kBAAQ,MAAM,QAAQ,WAAW,EAAE;AAAA,QACrC,SAAS,KAAK;AACZ,eAAK,yBAAyB,EAAE,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,EAAE;AAAA,QAC1F;AAAA,MACF;AAEA,YAAM,WAAW,aAAa,eAAe,EAAE;AAC/C,YAAM,IAAI,IAAI,EAAE,IAAI,WAAW,UAAU,OAAO,OAAO,MAAM,QAAQ,SAAS,EAAE,EAAE,CAAC;AAEnF,UAAI,SAAS,UAAU;AAGrB,YAAI,WAAW,QAAQ,EAAE,KAAK,CAAC,cAAc,CAAC,OAAO,IAAI,SAAS,CAAC,GAAG;AACpE,sBAAY;AAAA,QACd;AACA;AAAA,MACF;AAEA,iBAAW,aAAa,WAAW,QAAQ,GAAG;AAC5C,YAAI,OAAO,IAAI,SAAS,EAAG;AAC3B,eAAO,IAAI,SAAS;AACpB,aAAK,KAAK,EAAE,IAAI,WAAW,OAAO,QAAQ,EAAE,CAAC;AAAA,MAC/C;AAAA,IACF;AAEA,QAAI,MAAM,QAAQ,YAAY,KAAK,SAAS,GAAG;AAC7C,kBAAY;AACZ;AAAA,IACF;AACA,eAAW;AAAA,EACb;AAEA,QAAM,QAAyB;AAAA,IAC7B,OAAO;AAAA,IACP;AAAA,IACA,QAAQ,CAAC;AAAA,IACT;AAAA,IACA,QAAQ,EAAE,UAAU,SAAS;AAAA,EAC/B;AAEA,mBAAiB,KAAK;AACtB,QAAM,SAAS,WAAW,KAAK;AAE/B,SAAO;AACT;AAWA,SAAS,iBAAiB,OAA8B;AACtD,aAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,eAAW,SAAS,KAAK,UAAU,YAAY;AAC7C,YAAM,SAAS,MAAM,MAAM,IAAI,KAAK;AACpC,UAAI,WAAW,UAAa,OAAO,OAAO,KAAK,GAAI;AACnD,aAAO,UAAU,eAAe;AAAA,QAC9B,CAAC,GAAG,OAAO,UAAU,cAAc,KAAK,EAAE;AAAA,QAC1C,OAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACF;;;ACxRA,IAAM,kBAAiD;AAAA,EACrD,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AACP;AAGA,IAAM,gBAA+C,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,EAAE;AAClF,IAAM,mBAAmB;AAUlB,SAAS,WAAW,QAAiD;AAC1E,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,MAAM,KAAK,EAAE,YAAY;AAC5C,UAAM,SAAS,gBAAgB,UAAU;AACzC,QAAI,WAAW,OAAW,QAAO;AAEjC,UAAM,YAAY,oDAAoD,KAAK,UAAU;AACrF,UAAM,UAAU,YAAY,CAAC;AAC7B,QAAI,YAAY,OAAW,QAAO,gBAAgB,OAAO;AAAA,EAC3D;AACA,SAAO;AACT;AAgBA,SAAS,eACP,IACAA,WACA,UACQ;AACR,MAAI,QAAQ;AACZ,MAAI,UAAUA,UAAS,IAAI,EAAE,KAAK;AAClC,QAAM,OAAO,oBAAI,IAAY,CAAC,EAAE,CAAC;AAEjC,SAAO,YAAY,QAAQ,SAAS,IAAI,OAAO,KAAK,CAAC,KAAK,IAAI,OAAO,GAAG;AACtE;AACA,SAAK,IAAI,OAAO;AAChB,cAAUA,UAAS,IAAI,OAAO,KAAK;AAAA,EACrC;AAEA,SAAO;AACT;AAcO,SAAS,sBACd,OACA,UAAiC,CAAC,GACZ;AACtB,QAAM,WAAW,IAAI;AAAA,KAClB,QAAQ,WAAW,CAAC,GAAG,MAAM,MAAM,KAAK,CAAC,GAAG,OAAO,CAAC,OAAO,MAAM,MAAM,IAAI,EAAE,CAAC;AAAA,EACjF;AAEA,QAAMA,YAAW,oBAAI,IAA2B;AAChD,QAAM,WAAW,oBAAI,IAAkC;AACvD,aAAW,MAAM,UAAU;AACzB,UAAM,OAAO,MAAM,MAAM,IAAI,EAAE;AAC/B,IAAAA,UAAS,IAAI,IAAI,MAAM,UAAU,UAAU,IAAI;AAC/C,aAAS,IAAI,IAAI,WAAW,MAAM,OAAO,UAAU,CAAC,CAAC,CAAC;AAAA,EACxD;AAEA,QAAM,WAAW,oBAAI,IAAyB;AAC9C,QAAM,WAAW,oBAAI,IAAsB;AAC3C,aAAW,MAAM,UAAU;AACzB,aAAS,IAAI,IAAI,oBAAI,IAAI,CAAC;AAC1B,aAAS,IAAI,IAAI,CAAC,CAAC;AAAA,EACrB;AACA,aAAW,EAAE,MAAM,GAAG,KAAK,gBAAgB,KAAK,GAAG;AACjD,QAAI,CAAC,SAAS,IAAI,IAAI,KAAK,CAAC,SAAS,IAAI,EAAE,KAAK,SAAS,GAAI;AAC7D,aAAS,IAAI,EAAE,GAAG,IAAI,IAAI;AAC1B,aAAS,IAAI,IAAI,GAAG,KAAK,EAAE;AAAA,EAC7B;AAEA,QAAM,QAAQ,oBAAI,IAAoB;AACtC,aAAW,MAAM,UAAU;AACzB,UAAM,IAAI,IAAI,eAAe,IAAIA,WAAU,QAAQ,CAAC;AAAA,EACtD;AAEA,QAAM,OAAO,CAAC,OAAuB;AACnC,UAAM,QAAQ,SAAS,IAAI,EAAE,KAAK;AAClC,WAAO,UAAU,OAAO,mBAAmB,cAAc,KAAK;AAAA,EAChE;AAEA,QAAM,SAAS,CAAC,GAAW,MAAsB;AAC/C,UAAM,eAAe,MAAM,IAAI,CAAC,KAAK,MAAM,MAAM,IAAI,CAAC,KAAK;AAC3D,QAAI,gBAAgB,EAAG,QAAO;AAC9B,UAAM,aAAa,KAAK,CAAC,IAAI,KAAK,CAAC;AACnC,QAAI,eAAe,EAAG,QAAO;AAC7B,WAAO,WAAW,GAAG,CAAC;AAAA,EACxB;AAEA,QAAM,QAAQ,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,QAAQ,SAAS,IAAI,EAAE,GAAG,QAAQ,OAAO,CAAC;AAC9E,QAAM,QAAkB,CAAC;AAEzB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,KAAK,MAAM;AACjB,UAAM,OAAO,MAAM,MAAM;AACzB,UAAM,KAAK,IAAI;AAEf,eAAW,aAAa,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG;AAChD,YAAM,UAAU,SAAS,IAAI,SAAS;AACtC,UAAI,YAAY,OAAW;AAC3B,cAAQ,OAAO,IAAI;AACnB,UAAI,QAAQ,SAAS,GAAG;AACtB,cAAM,KAAK,SAAS;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,WAAW,SAAS,MAAM;AAGlC,UAAM,SAAS,MAAM,OAAO,SAAS,IAAI,MAAM,SAAS,WAAW,KAAK;AACxE,UAAM,WAAW,OAAO,OAAO,CAAC,UAAU,MAAM,MAAM,CAAC,OAAO,SAAS,IAAI,EAAE,CAAC,CAAC;AAC/E,WAAO,EAAE,IAAI,OAAO,QAAQ,SAAS,SAAS,IAAI,WAAW,OAAO;AAAA,EACtE;AAEA,SAAO,EAAE,IAAI,MAAM,MAAM;AAC3B;AAGO,SAAS,eAAe,QAAqC;AAClE,SAAO,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,OAAO,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,EAAE,KAAK,UAAK,CAAC,EAAE,KAAK,IAAI;AAChG;;;AHpIA,SAAS,SAAS,OAAwB,IAA2B;AACnE,aAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,QAAI,KAAK,UAAU,SAAS,SAAS,EAAE,EAAG,QAAO,KAAK;AAAA,EACxD;AACA,SAAO;AACT;AAGA,SAAS,cACP,OACA,IAMA;AACA,QAAM,SAAS,OAAO,SAAS,IAAI,EAAE;AACrC,SAAO;AAAA,IACL,QAAQ,OAAO,WAAW,OAAO,MAAM,MAAM,IAAI,OAAO;AAAA,IACxD,OAAO,OAAO,SAAS;AAAA,IACvB,KAAK,OAAO,aAAa;AAAA,IACzB,QAAQ,OAAO,UAAU;AAAA,EAC3B;AACF;AASO,SAAS,mBAAmB,OAA+C;AAChF,QAAM,MAAM,MAAM,OAAO;AACzB,QAAM,KAAK,IAAI;AACf,QAAM,YAAY,IAAI,IAAI,MAAM,KAAK;AACrC,QAAM,YAAY,IAAI,IAAI,MAAM,SAAS;AAEzC,QAAM,SAA+B,MAAM,MAAM,IAAI,CAAC,IAAI,UAAU;AAClE,UAAM,OAAO,MAAM,MAAM,MAAM,IAAI,EAAE;AACrC,UAAM,YAAY,MAAM;AACxB,UAAM,YAAY,cAAc,MAAM,SAAS,MAAM,EAAE;AACvD,UAAM,WAAW,WAAW,YAAY,CAAC;AACzC,UAAM,OAAuB,YAAY;AAAA,MACvC,OAAO,MAAM,SAAS;AAAA,MACtB;AAAA,IACF,CAAC,IACG,cACA;AAEJ,WAAO;AAAA,MACL;AAAA,MACA,QAAQ,UAAU;AAAA,MAClB,OAAO,UAAU;AAAA,MACjB,KAAK,UAAU;AAAA,MACf,QAAQ,UAAU;AAAA,MAClB,UAAU,QAAQ;AAAA,MAClB,QAAQ;AAAA,MACR,QAAQ,UAAU,IAAI,EAAE,IAAI,cAAc;AAAA,MAC1C;AAAA,MACA,uBAAuB,WAAW,aAAa,CAAC,GAAG;AAAA,QACjD,CAAC,YACC,CAAC,UAAU,IAAI,OAAO,KAAK,MAAM,MAAM,MAAM,IAAI,OAAO,GAAG,OAAO,UAAU;AAAA,MAChF;AAAA;AAAA;AAAA,MAGA,YAAY,WAAW,aAAa,CAAC,GAAG,OAAO,CAAC,YAAY,UAAU,IAAI,OAAO,CAAC;AAAA,MAClF,QAAQ,WAAW,UAAU,SAAS,MAAM,OAAO,EAAE;AAAA,MACrD,UAAU,WAAW,MAAM,OAAO,UAAU,CAAC,CAAC;AAAA,MAC9C,YAAY,WAAW,UAAU,UAAU,KAAK;AAAA,MAChD,aAAa;AAAA,MACb,WAAW;AAAA,MACX,UAAU;AAAA,MACV,eAAe;AAAA,MACf,WAAW;AAAA,MACX,aAAa;AAAA,IACf;AAAA,EACF,CAAC;AAED,QAAM,WAAoC,CAAC;AAC3C,aAAW,QAAQ,MAAM,MAAM,MAAM,OAAO,GAAG;AAC7C,QAAI,UAAU,IAAI,KAAK,EAAE,EAAG;AAC5B,UAAM,YAAY,cAAc,KAAK,OAAO,KAAK,EAAE;AACnD,aAAS,KAAK;AAAA,MACZ,IAAI,KAAK;AAAA,MACT,QAAQ,UAAU;AAAA,MAClB,OAAO,UAAU;AAAA,MACjB,KAAK,UAAU;AAAA,MACf,QACE,KAAK,OAAO,UAAU,WAClB,mCACA;AAAA,IACR,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf,IAAI,MAAM,UAAU,CAAC,KAAM,MAAM,MAAM,CAAC;AAAA,IACxC,SAAS,MAAM;AAAA,IACf,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,IAC9B,YAAY;AAAA,IACZ,UAAU,MAAM,YAAY;AAAA,IAC5B,UAAU,MAAM,YAAY;AAAA,IAC5B,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,WAAW;AAAA,IACX,WAAW,MAAM,MAAM;AAAA,IACvB;AAAA,IACA;AAAA,EACF;AACF;AAGA,eAAsB,kBAAkB,MAAsC;AAC5E,QAAM,MAAe,KAAK,MAAM,MAAM,SAAS,MAAM,OAAO,CAAC;AAE7D,MAAI;AACF,WAAO,oBAAoB,MAAM,GAAG;AAAA,EACtC,SAAS,KAAK;AACZ,QAAI,eAAe,UAAU;AAC3B,YAAM,SAAS,IAAI,OAAO,IAAI,CAAC,MAAM,OAAO,EAAE,KAAK,KAAK,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,IAAI;AACvF,YAAM,IAAI,MAAM,kCAAkC,IAAI;AAAA,EAAM,MAAM,EAAE;AAAA,IACtE;AACA,UAAM;AAAA,EACR;AACF;AASA,eAAsB,kBACpB,MACA,MACA,MAAoB,QACL;AACf,QAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9C,QAAM,UAAyB,EAAE,GAAG,MAAM,WAAW,IAAI,EAAE;AAC3D,QAAM,gBAAgB,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,CAAC;AAAA,CAAI;AACrE;AA6BA,SAAS,sBAAsB,MAAqB,OAAoC;AACtF,SAAO,MAAM,UAAU,MAAM,CAAC,OAAO;AACnC,UAAM,aAAa,KAAK,OAAO,KAAK,CAAC,cAAc,UAAU,OAAO,EAAE;AACtE,QAAI,eAAe,OAAW,QAAO;AAGrC,QAAI,WAAW,SAAS,YAAa,QAAO;AAC5C,WAAO,WAAW,WAAW;AAAA,EAC/B,CAAC;AACH;AAcO,SAAS,eACd,MACA,UAAiC,CAAC,GACP;AAC3B,QAAM,UAAU,QAAQ,WAAW,oBAAI,IAAY;AACnD,QAAM,WAAW,CAAC,WAA6B,CAAC,UAC9C,MAAM,SAAS,eACf,MAAM,WAAW,UACjB,CAAC,QAAQ,IAAI,MAAM,EAAE,KACrB,sBAAsB,MAAM,KAAK;AAEnC,SACE,KAAK,OAAO,KAAK,SAAS,aAAa,CAAC,KACxC,KAAK,OAAO,KAAK,SAAS,QAAQ,CAAC,KACnC,KAAK,OAAO,KAAK,SAAS,SAAS,CAAC,KACpC,KAAK,OAAO,KAAK,SAAS,SAAS,CAAC,KACpC;AAEJ;AAUO,SAAS,YAAY,MAAkC;AAC5D,MAAI,KAAK,OAAO,KAAK,CAAC,UAAU,MAAM,WAAW,YAAY,MAAM,WAAW,SAAS,GAAG;AACxF,WAAO;AAAA,EACT;AACA,MAAI,KAAK,OAAO,MAAM,CAAC,UAAU,MAAM,WAAW,WAAW,EAAG,QAAO;AACvE,MAAI,KAAK,OAAO,KAAK,CAAC,UAAU,MAAM,WAAW,SAAS,EAAG,QAAO;AACpE,SAAO;AACT;AAGO,SAAS,gBAAgB,MAA8B;AAC5D,SAAO,KAAK,OAAO,MAAM,CAAC,UAAU,MAAM,WAAW,WAAW;AAClE;AAGA,SAAS,YACP,MACA,IACA,OACe;AACf,QAAM,SAAS,KAAK,OAAO,IAAI,CAAC,UAAW,MAAM,OAAO,KAAK,EAAE,GAAG,OAAO,GAAG,MAAM,IAAI,KAAM;AAC5F,QAAM,OAAsB,EAAE,GAAG,MAAM,OAAO;AAC9C,SAAO,EAAE,GAAG,MAAM,QAAQ,YAAY,IAAI,EAAE;AAC9C;AAEO,SAAS,yBACd,MACA,IACA,MAAoB,QACL;AACf,QAAM,UAAU,KAAK,OAAO,KAAK,CAAC,UAAU,MAAM,OAAO,EAAE;AAC3D,SAAO,YAAY,MAAM,IAAI;AAAA,IAC3B,QAAQ;AAAA;AAAA;AAAA,IAGR,WAAW,SAAS,aAAa,IAAI;AAAA,IACrC,aAAa;AAAA,IACb,WAAW;AAAA,EACb,CAAC;AACH;AAEA,SAAS,2BAA2B,MAAqB,KAAkC;AACzF,MAAI,OAAO;AACX,MAAI,UAAU;AACd,SAAO,SAAS;AACd,cAAU;AACV,eAAW,SAAS,KAAK,QAAQ;AAC/B,UAAI,MAAM,SAAS,eAAe,MAAM,WAAW,YAAa;AAChE,YAAM,WAAW,KAAK,OAAO,OAAO,CAAC,cAAc,UAAU,WAAW,MAAM,EAAE;AAChF,UAAI,SAAS,WAAW,EAAG;AAC3B,UAAI,SAAS,MAAM,CAAC,UAAU,MAAM,WAAW,WAAW,GAAG;AAC3D,eAAO,YAAY,MAAM,MAAM,IAAI;AAAA,UACjC,QAAQ;AAAA,UACR,aAAa,IAAI;AAAA,UACjB,aAAa;AAAA,UACb,WAAW;AAAA,QACb,CAAC;AACD,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,wBACd,MACA,IACA,MAAoB,QACL;AACf,SAAO;AAAA,IACL,YAAY,MAAM,IAAI;AAAA,MACpB,QAAQ;AAAA,MACR,aAAa,IAAI;AAAA,MACjB,aAAa;AAAA,MACb,WAAW;AAAA,IACb,CAAC;AAAA,IACD;AAAA,EACF;AACF;AAEO,SAAS,qBACd,MACA,IACA,SACe;AACf,QAAM,UAAU,KAAK,OAAO,KAAK,CAAC,UAAU,MAAM,OAAO,EAAE;AAC3D,SAAO,YAAY,MAAM,IAAI;AAAA,IAC3B,QAAQ;AAAA,IACR,aAAa,QAAQ;AAAA,IACrB,WAAW,QAAQ;AAAA,IACnB,WAAW,SAAS,YAAY,KAAK;AAAA,EACvC,CAAC;AACH;AAWO,SAAS,sBACd,MACA,IACA,SACe;AACf,QAAM,UAAU,KAAK,OAAO,KAAK,CAAC,UAAU,MAAM,OAAO,EAAE;AAC3D,SAAO,YAAY,MAAM,IAAI;AAAA,IAC3B,QAAQ;AAAA,IACR,aAAa,QAAQ;AAAA,IACrB,WAAW,QAAQ;AAAA,IACnB,WAAW,SAAS,YAAY,KAAK;AAAA,EACvC,CAAC;AACH;AASO,SAAS,sBACd,MACA,IACA,QACA,SACe;AACf,QAAM,UAAU,KAAK,OAAO,KAAK,CAAC,UAAU,MAAM,OAAO,EAAE;AAC3D,SAAO,YAAY,MAAM,IAAI;AAAA,IAC3B,QAAQ;AAAA,IACR,eAAe;AAAA,IACf,aAAa,QAAQ;AAAA,IACrB,WAAW,QAAQ;AAAA,IACnB,WAAW,SAAS,YAAY,KAAK;AAAA,EACvC,CAAC;AACH;AAGO,SAAS,eAAe,MAAqB,YAAmC;AACrF,SAAO,EAAE,GAAG,MAAM,WAAW;AAC/B;AAGO,SAAS,oBACd,MACA,aACe;AACf,SAAO,EAAE,GAAG,MAAM,YAAY;AAChC;;;AIrZO,IAAM,kBAAkB,CAAC,QAAQ,OAAO,QAAQ,WAAW,UAAU,IAAI;AAMzE,IAAM,iCAAiC,CAAC,GAAG,iBAAiB,WAAW;AAQvE,IAAM,4BAA4B,gBAAgB;AAAA,EACvD,CAAC,MAAuD,MAAM;AAChE;AAMA,IAAM,iBAAoE;AAAA,EACxE,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,IAAI;AAAA,EACJ,aAAa;AACf;AAEO,IAAM,kBAAN,MAAsB;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAY,MAAgB,eAAuB,cAAyC;AAC1F,SAAK,OAAO;AACZ,SAAK,gBAAgB;AACrB,SAAK,eAAe,gBAAgB;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAwB;AAC5B,SAAK,OAAO,MAAM,aAAa,KAAK,aAAa;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB,OAA+B;AAC7C,UAAM,QAAQ,eAAe,KAAK;AAClC,QAAI,UAAU,KAAM,QAAO;AAC3B,WAAO,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAqC;AACnC,eAAW,SAAS,KAAK,cAAc;AACrC,UAAI,CAAC,KAAK,gBAAgB,KAAK,GAAG;AAChC,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAwC;AACtC,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,WAAmC;AAC3C,UAAM,MAAM,KAAK,aAAa,QAAQ,SAAS;AAC/C,QAAI,MAAM,EAAG,QAAO;AAGpB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAI,CAAC,KAAK,gBAAgB,KAAK,aAAa,CAAC,CAAC,GAAG;AAC/C,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,kBAAkB,OAAqC;AAC3D,UAAM,QAAQ,eAAe,KAAK;AAClC,QAAI,UAAU,KAAM;AAEpB,SAAK,OAAO;AAAA,MACV,GAAG,KAAK;AAAA,MACR,UAAU;AAAA,QACR,GAAI,KAAK,KAAK,YAAY;AAAA,UACxB,cAAc;AAAA,UACd,eAAe;AAAA,UACf,oBAAoB;AAAA,UACpB,iBAAiB;AAAA,UACjB,WAAW;AAAA,QACb;AAAA,QACA,CAAC,KAAK,GAAG;AAAA,MACX;AAAA,IACF;AAEA,UAAM,aAAa,KAAK,eAAe,KAAK,IAAI;AAAA,EAClD;AACF;","names":["parentOf"]}