@tangle-network/agent-eval 0.173.3 → 0.174.0

package/dist/{campaign-B3kPMU8S.js.map → campaign-BzMSCejE.js.map}

@@ -1 +1 @@
-{"version":3,"file":"campaign-B3kPMU8S.js","names":["validateAndIndex","rowsFor","componentSetKey","rowFor","meanOrNull","canonicalComponents","mean","sha256","fsConstants"],"sources":["../src/campaign/analyst-surface.ts","../src/campaign/cross-surface-context.ts","../src/campaign/cross-surface-interaction.ts","../src/campaign/fixtures.ts","../src/campaign/gates/neutralization-gate.ts","../src/campaign/grounded-reflection.ts","../src/campaign/labeled-store/fs-adapter.ts","../src/campaign/neutralize.ts","../src/campaign/parent-selection.ts","../src/campaign/presets/playback.ts","../src/campaign/presets/run-profile-matrix.ts","../src/campaign/presets/segmented-profile-matrix.ts","../src/campaign/scenario-selection.ts","../src/campaign/upstream-evaluators.ts","../src/campaign/worktree/index.ts"],"sourcesContent":["import type {\n  AnalystBenchmarkCase,\n  AnalystBenchmarkLabelState,\n  AnalystFindingScore,\n  AnalystIssueExpectation,\n} from '../analyst/benchmark'\nimport { scoreAnalystFindings } from '../analyst/benchmark'\nimport type { AnalystFinding, AnalystRunResult, AnalystUsageReceipt } from '../analyst/types'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { DispatchContext, JudgeConfig, MutableSurface, Scenario } from './types'\n\nexport interface TraceAnalystScenario extends Scenario {\n  kind: 'trace-analyst'\n  traceStore: TraceAnalysisStore\n  labelState: AnalystBenchmarkLabelState\n  expectedIssues: readonly AnalystIssueExpectation[]\n  labeledEvidence?: AnalystBenchmarkCase['labeledEvidence']\n}\n\nexport interface TraceAnalystArtifact {\n  findings: readonly AnalystFinding[]\n  usage?: AnalystUsageReceipt\n  run?: AnalystRunResult\n}\n\nexport interface BuildTraceAnalystSurfaceDispatchOptions {\n  analyze(input: {\n    instructions: string\n    traceStore: TraceAnalysisStore\n    runId: string\n    signal: AbortSignal\n  }): Promise<TraceAnalystArtifact>\n}\n\nexport function buildTraceAnalystSurfaceDispatch(\n  options: BuildTraceAnalystSurfaceDispatchOptions,\n): (\n  surface: MutableSurface,\n  scenario: TraceAnalystScenario,\n  context: DispatchContext,\n) => Promise<TraceAnalystArtifact> {\n  return async (surface, scenario, context) => {\n    if (typeof surface !== 'string') {\n      throw new TypeError(\n        `buildTraceAnalystSurfaceDispatch requires a string prompt, received ${surface.kind}`,\n      )\n    }\n    return options.analyze({\n      instructions: surface,\n      traceStore: scenario.traceStore,\n      runId: `${context.cellId}:${scenario.id}`,\n      signal: context.signal,\n    })\n  }\n}\n\nexport function traceAnalystQualityJudge(): JudgeConfig<\n  TraceAnalystArtifact,\n  TraceAnalystScenario\n> {\n  return {\n    name: 'trace-analyst-quality',\n    judgeVersion: 'agent-eval:trace-analyst-quality:v3',\n    dimensions: [\n      { key: 'issue_recall', description: 'share of labeled issues found' },\n      { key: 'finding_precision', description: 'share of findings tied to a labeled issue' },\n      { key: 'f1', description: 'harmonic mean of issue recall and finding precision' },\n      { key: 'critical_step_accuracy', description: 'share of labeled causal steps cited' },\n      { key: 'citation_coverage', description: 'share of findings with evidence citations' },\n      {\n        key: 'citation_label_agreement',\n        description: 'share of citations matching a labeled case location',\n      },\n      { key: 'clean', description: '1 when a clean case produces no findings' },\n    ],\n    appliesTo: (scenario) =>\n      scenario.kind === 'trace-analyst' && scenario.labelState !== 'unlabeled',\n    score({ artifact, scenario }) {\n      assertScorableScenario(scenario)\n      const score = scoreAnalystFindings(\n        {\n          id: scenario.id,\n          expectedIssues: scenario.expectedIssues,\n          labeledEvidence: scenario.labeledEvidence,\n        },\n        artifact.findings,\n      )\n      return traceAnalystJudgeScore(score)\n    },\n  }\n}\n\nfunction assertScorableScenario(scenario: TraceAnalystScenario): void {\n  if (scenario.labelState === 'unlabeled') {\n    throw new TypeError(`trace analyst scenario '${scenario.id}' has no quality labels`)\n  }\n  if (scenario.labelState === 'positive' && scenario.expectedIssues.length === 0) {\n    throw new TypeError(`positive trace analyst scenario '${scenario.id}' requires expected issues`)\n  }\n  if (scenario.labelState === 'trusted-negative' && scenario.expectedIssues.length > 0) {\n    throw new TypeError(\n      `trusted-negative trace analyst scenario '${scenario.id}' cannot contain expected issues`,\n    )\n  }\n}\n\nfunction traceAnalystJudgeScore(score: AnalystFindingScore) {\n  const dimensions: Record<string, number> = {\n    issue_recall: score.issueRecall,\n    finding_precision: score.findingPrecision,\n    f1: score.f1,\n    clean: score.predictionOnLabelEmptyCase ? 0 : 1,\n  }\n  if (score.criticalStepAccuracy !== null) {\n    dimensions.critical_step_accuracy = score.criticalStepAccuracy\n  }\n  if (score.citationCoverage !== null) dimensions.citation_coverage = score.citationCoverage\n  if (score.citationLabelAgreement !== null) {\n    dimensions.citation_label_agreement = score.citationLabelAgreement\n  }\n  const notes = [\n    `${score.matchedIssueIds.length}/${score.expectedIssueCount} issues found`,\n    `${score.supportedFindingIndexes.length}/${score.supportedFindingIndexes.length + score.unsupportedFindingIndexes.length} findings supported`,\n    `${score.unlabeledEvidence.length} citations outside labeled locations`,\n  ].join('; ')\n  const composite =\n    score.criticalStepAccuracy === null ? score.f1 : (score.f1 + score.criticalStepAccuracy) / 2\n  return { dimensions, composite, notes }\n}\n","import { ValidationError } from '../errors'\nimport type {\n  AnalyzeCrossSurfaceInteractionsInput,\n  CrossSurfaceCandidate,\n  CrossSurfaceComponent,\n  CrossSurfaceTaskRow,\n} from './cross-surface-types'\n\n/** Validated indexes shared by analysis and deterministic selection. */\nexport interface CrossSurfaceAnalysisContext<TRow extends CrossSurfaceTaskRow> {\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>\n  components: CrossSurfaceComponent[]\n  candidates: CrossSurfaceCandidate[]\n  componentById: Map<string, CrossSurfaceComponent>\n  candidateById: Map<string, CrossSurfaceCandidate>\n  candidateByComponents: Map<string, CrossSurfaceCandidate>\n  singleByComponent: Map<string, CrossSurfaceCandidate>\n  rowsByCandidate: Map<string, Map<string, TRow>>\n  componentIndex: Map<string, number>\n  candidateIndex: Map<string, number>\n}\n\nexport function validateCrossSurfaceInput<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): CrossSurfaceAnalysisContext<TRow> {\n  assertNonEmptyUnique(input.taskOrder, 'taskOrder')\n  assertNonEmptyUnique(input.componentOrder, 'componentOrder')\n  if (input.componentOrder.length < 2) {\n    throw new ValidationError(\n      'analyzeCrossSurfaceInteractions: componentOrder must contain at least two surfaces',\n    )\n  }\n  assertNonEmptyUnique(input.candidateOrder, 'candidateOrder')\n  assertNonEmptyUnique(input.costMetricOrder, 'costMetricOrder')\n  if (input.costMetricOrder.includes('score')) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: costMetricOrder cannot contain reserved metric 'score'`,\n    )\n  }\n  validateBootstrap(input)\n  validateSelection(input)\n\n  const componentById = indexUnique(\n    input.components,\n    (component) => component.componentId,\n    'component',\n  )\n  assertExactSet(input.componentOrder, componentById.keys(), 'componentOrder', 'components')\n  const surfaces = new Set<string>()\n  for (const component of componentById.values()) {\n    assertNonEmpty(component.componentId, 'componentId')\n    assertNonEmpty(component.surfaceId, `surfaceId for component '${component.componentId}'`)\n    if (surfaces.has(component.surfaceId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: surfaceId '${component.surfaceId}' has more than one component; ` +\n          'the interaction stage requires one independently selected finalist per surface',\n      )\n    }\n    surfaces.add(component.surfaceId)\n    if (typeof component.bestSingleEligible !== 'boolean') {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: component '${component.componentId}' must declare bestSingleEligible`,\n      )\n    }\n  }\n\n  const componentIndex = new Map(input.componentOrder.map((id, index) => [id, index]))\n  const candidateById = indexUnique(\n    input.candidates,\n    (candidate) => candidate.candidateId,\n    'candidate',\n  )\n  assertExactSet(input.candidateOrder, candidateById.keys(), 'candidateOrder', 'candidates')\n  if (!candidateById.has(input.baselineCandidateId)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: unknown baselineCandidateId '${input.baselineCandidateId}'`,\n    )\n  }\n\n  const candidateByComponents = new Map<string, CrossSurfaceCandidate>()\n  const singleByComponent = new Map<string, CrossSurfaceCandidate>()\n  for (const candidate of candidateById.values()) {\n    validateCandidate(candidate, componentById, componentIndex, input.baselineCandidateId)\n    const key = crossSurfaceComponentSetKey(candidate.componentIds)\n    const duplicate = candidateByComponents.get(key)\n    if (duplicate) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidates '${duplicate.candidateId}' and ` +\n          `'${candidate.candidateId}' materialize the same component set`,\n      )\n    }\n    candidateByComponents.set(key, candidate)\n    if (candidate.componentIds.length === 1) {\n      singleByComponent.set(candidate.componentIds[0]!, candidate)\n    }\n  }\n  const baseline = candidateById.get(input.baselineCandidateId)!\n  if (baseline.componentIds.length !== 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: baseline '${baseline.candidateId}' must have zero components`,\n    )\n  }\n  for (const componentId of input.componentOrder) {\n    if (!singleByComponent.has(componentId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: no single-surface candidate for component '${componentId}'`,\n      )\n    }\n  }\n  for (let left = 0; left < input.componentOrder.length; left++) {\n    for (let right = left + 1; right < input.componentOrder.length; right++) {\n      const ids = [input.componentOrder[left]!, input.componentOrder[right]!]\n      if (!candidateByComponents.has(crossSurfaceComponentSetKey(ids))) {\n        throw new ValidationError(\n          `analyzeCrossSurfaceInteractions: missing pair candidate for components [${ids.join(', ')}]`,\n        )\n      }\n    }\n  }\n\n  const rowsByCandidate = new Map<string, Map<string, TRow>>()\n  const taskIds = new Set(input.taskOrder)\n  for (const row of input.rows) {\n    const candidate = candidateById.get(row.candidateId)\n    if (!candidate) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: row for task '${row.taskId}' names unknown candidate '${row.candidateId}'`,\n      )\n    }\n    if (!taskIds.has(row.taskId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: row for candidate '${row.candidateId}' names task '${row.taskId}' ` +\n          'outside the declared taskOrder',\n      )\n    }\n    validateRow(input, row, candidate)\n    const byTask = rowsByCandidate.get(row.candidateId) ?? new Map<string, TRow>()\n    if (byTask.has(row.taskId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: duplicate row for candidate '${row.candidateId}' and task '${row.taskId}'`,\n      )\n    }\n    byTask.set(row.taskId, row)\n    rowsByCandidate.set(row.candidateId, byTask)\n  }\n  for (const candidateId of input.candidateOrder) {\n    const byTask = rowsByCandidate.get(candidateId)\n    const missing = input.taskOrder.filter((taskId) => !byTask?.has(taskId))\n    if (missing.length > 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidate '${candidateId}' is missing declared task row(s) ` +\n          `[${missing.join(', ')}]; encode failed attempts explicitly instead of changing the task axis`,\n      )\n    }\n  }\n  const expectedRows = input.candidateOrder.length * input.taskOrder.length\n  if (input.rows.length !== expectedRows) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: expected exactly ${expectedRows} candidate × task rows, got ${input.rows.length}`,\n    )\n  }\n\n  return {\n    input,\n    components: input.componentOrder.map((id) => componentById.get(id)!),\n    candidates: input.candidateOrder.map((id) => candidateById.get(id)!),\n    componentById,\n    candidateById,\n    candidateByComponents,\n    singleByComponent,\n    rowsByCandidate,\n    componentIndex,\n    candidateIndex: new Map(input.candidateOrder.map((id, index) => [id, index])),\n  }\n}\n\nexport function crossSurfaceRowsFor<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  candidateId: string,\n): TRow[] {\n  return context.input.taskOrder.map((taskId) => crossSurfaceRowFor(context, candidateId, taskId))\n}\n\nexport function crossSurfaceRowFor<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  candidateId: string,\n  taskId: string,\n): TRow {\n  return context.rowsByCandidate.get(candidateId)!.get(taskId)!\n}\n\nexport function canonicalCrossSurfaceComponents<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  componentIds: string[],\n): string[] {\n  return [...componentIds].sort(\n    (left, right) => context.componentIndex.get(left)! - context.componentIndex.get(right)!,\n  )\n}\n\nexport function crossSurfaceComponentSetKey(componentIds: readonly string[]): string {\n  return JSON.stringify(componentIds)\n}\n\nfunction validateBootstrap<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): void {\n  const { seed, resamples, confidence } = input.bootstrap\n  if (!Number.isInteger(seed)) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: bootstrap.seed must be an integer`)\n  }\n  if (!Number.isInteger(resamples) || resamples <= 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: bootstrap.resamples must be a positive integer`,\n    )\n  }\n  if (!Number.isFinite(confidence) || confidence <= 0 || confidence >= 1) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: bootstrap.confidence must be in (0,1)`,\n    )\n  }\n}\n\nfunction validateSelection<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): void {\n  const policy = input.selection\n  for (const [name, value] of [\n    ['minimumFiringTasks', policy.minimumFiringTasks],\n    ['minimumEffectTasks', policy.minimumEffectTasks],\n  ] as const) {\n    if (!Number.isInteger(value) || value < 0 || value > input.taskOrder.length) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: selection.${name} must be an integer in [0,${input.taskOrder.length}]`,\n      )\n    }\n  }\n  if (\n    !Number.isInteger(policy.minimumBundleComponents) ||\n    policy.minimumBundleComponents < 2 ||\n    policy.minimumBundleComponents > input.componentOrder.length\n  ) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: selection.minimumBundleComponents must be an integer in ` +\n        `[2,${input.componentOrder.length}]`,\n    )\n  }\n  for (const [metric, limit] of Object.entries(policy.maximumMedianCostRatioToBaseline)) {\n    if (!input.costMetricOrder.includes(metric)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: cost limit names undeclared metric '${metric}'`,\n      )\n    }\n    if (!Number.isFinite(limit) || limit <= 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: cost ratio limit for '${metric}' must be positive and finite`,\n      )\n    }\n  }\n}\n\nfunction validateCandidate(\n  candidate: CrossSurfaceCandidate,\n  componentById: Map<string, CrossSurfaceComponent>,\n  componentIndex: Map<string, number>,\n  baselineCandidateId: string,\n): void {\n  assertNonEmpty(candidate.candidateId, 'candidateId')\n  assertNonEmpty(candidate.contentHash, `contentHash for candidate '${candidate.candidateId}'`)\n  if (!Number.isInteger(candidate.artifactBytes) || candidate.artifactBytes < 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: artifactBytes for candidate '${candidate.candidateId}' must be a non-negative integer`,\n    )\n  }\n  assertUnique(candidate.componentIds, `componentIds for candidate '${candidate.candidateId}'`)\n  for (const componentId of candidate.componentIds) {\n    if (!componentById.has(componentId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidate '${candidate.candidateId}' names unknown component '${componentId}'`,\n      )\n    }\n  }\n  const canonical = [...candidate.componentIds].sort(\n    (left, right) => componentIndex.get(left)! - componentIndex.get(right)!,\n  )\n  if (!arraysEqual(candidate.componentIds, canonical)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: candidate '${candidate.candidateId}' components must follow componentOrder`,\n    )\n  }\n  if (candidate.candidateId !== baselineCandidateId && candidate.componentIds.length === 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: only baseline '${baselineCandidateId}' may have zero components`,\n    )\n  }\n}\n\nfunction validateRow<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n  row: TRow,\n  candidate: CrossSurfaceCandidate,\n): void {\n  if (!arraysEqual(row.componentIds, candidate.componentIds)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: row '${row.candidateId}/${row.taskId}' componentIds do not match its candidate`,\n    )\n  }\n  if (!['complete', 'missing', 'invalid'].includes(row.completeness)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: row '${row.candidateId}/${row.taskId}' has unknown completeness '${String(row.completeness)}'`,\n    )\n  }\n  if (row.completeness === 'complete') {\n    if (typeof row.pass !== 'boolean' || !Number.isFinite(row.score)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: complete row '${row.candidateId}/${row.taskId}' requires boolean pass and finite score`,\n      )\n    }\n    if (row.rejectReason !== null) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: complete row '${row.candidateId}/${row.taskId}' cannot carry rejectReason`,\n      )\n    }\n  } else {\n    if (row.pass !== null || row.score !== null) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: ${row.completeness} row '${row.candidateId}/${row.taskId}' must use null pass and score`,\n      )\n    }\n    if (typeof row.rejectReason !== 'string' || row.rejectReason.trim() === '') {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: ${row.completeness} row '${row.candidateId}/${row.taskId}' requires rejectReason`,\n      )\n    }\n  }\n  assertExactSet(\n    input.costMetricOrder,\n    Object.keys(row.cost),\n    `cost keys for row '${row.candidateId}/${row.taskId}'`,\n    'costMetricOrder',\n  )\n  for (const metric of input.costMetricOrder) {\n    const value = row.cost[metric]\n    if (value === null || value === undefined || !Number.isFinite(value) || value < 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: unknown or invalid cost '${metric}' on row ` +\n          `'${row.candidateId}/${row.taskId}'; every attempt must report a non-negative finite value`,\n      )\n    }\n  }\n  const evidenceByComponent = indexUnique(\n    row.componentEvidence,\n    (evidence) => evidence.componentId,\n    `componentEvidence on row '${row.candidateId}/${row.taskId}'`,\n  )\n  assertExactSet(\n    candidate.componentIds,\n    evidenceByComponent.keys(),\n    `componentEvidence on row '${row.candidateId}/${row.taskId}'`,\n    'candidate components',\n  )\n  for (const evidence of evidenceByComponent.values()) {\n    assertTriState(evidence.fired, 'fired', row)\n    assertTriState(evidence.effectObserved, 'effectObserved', row)\n    if (evidence.effectObserved === true && evidence.fired !== true) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: effectObserved=true requires fired=true for component ` +\n          `'${evidence.componentId}' on row '${row.candidateId}/${row.taskId}'`,\n      )\n    }\n  }\n}\n\nfunction assertTriState<TRow extends CrossSurfaceTaskRow>(\n  value: boolean | null,\n  field: string,\n  row: TRow,\n): void {\n  if (value !== true && value !== false && value !== null) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${field} on row '${row.candidateId}/${row.taskId}' must be boolean or null`,\n    )\n  }\n}\n\nfunction indexUnique<T>(\n  items: readonly T[],\n  id: (item: T) => string,\n  label: string,\n): Map<string, T> {\n  const result = new Map<string, T>()\n  for (const item of items) {\n    const key = id(item)\n    assertNonEmpty(key, `${label} id`)\n    if (result.has(key)) {\n      throw new ValidationError(`analyzeCrossSurfaceInteractions: duplicate ${label} id '${key}'`)\n    }\n    result.set(key, item)\n  }\n  return result\n}\n\nfunction assertNonEmptyUnique(values: readonly string[], label: string): void {\n  if (values.length === 0) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: ${label} is empty`)\n  }\n  assertUnique(values, label)\n  for (const value of values) assertNonEmpty(value, label)\n}\n\nfunction assertUnique(values: readonly string[], label: string): void {\n  if (new Set(values).size !== values.length) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: ${label} contains duplicates`)\n  }\n}\n\nfunction assertNonEmpty(value: string, label: string): void {\n  if (typeof value !== 'string' || value.trim() === '') {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${label} must be a non-empty string`,\n    )\n  }\n}\n\nfunction assertExactSet(\n  expected: readonly string[],\n  actualIterable: Iterable<string>,\n  actualLabel: string,\n  expectedLabel: string,\n): void {\n  const actual = [...actualIterable]\n  const expectedSet = new Set(expected)\n  const actualSet = new Set(actual)\n  const missing = expected.filter((value) => !actualSet.has(value))\n  const extra = actual.filter((value) => !expectedSet.has(value))\n  if (missing.length > 0 || extra.length > 0 || actual.length !== expected.length) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${actualLabel} does not match ${expectedLabel}; ` +\n        `missing=[${missing.join(', ')}], extra=[${extra.join(', ')}]`,\n    )\n  }\n}\n\nfunction arraysEqual(left: readonly string[], right: readonly string[]): boolean {\n  return left.length === right.length && left.every((value, index) => value === right[index])\n}\n","/**\n * Task-paired comparison and deterministic selection for independently\n * proposed agent surfaces. Unlike factorial cell-mean attribution, every\n * benefit, regression, and interaction remains attached to its task row.\n */\n\nimport { ValidationError } from '../errors'\nimport { comparePairedArms, type PairedArmRow, type PairedArmsComparison } from '../paired-arms'\nimport { pairedBootstrap } from '../statistics'\nimport {\n  type CrossSurfaceAnalysisContext as AnalysisContext,\n  canonicalCrossSurfaceComponents as canonicalComponents,\n  crossSurfaceComponentSetKey as componentSetKey,\n  crossSurfaceRowFor as rowFor,\n  crossSurfaceRowsFor as rowsFor,\n  validateCrossSurfaceInput as validateAndIndex,\n} from './cross-surface-context'\nimport type {\n  AnalyzeCrossSurfaceInteractionsInput,\n  CrossSurfaceAdditionDecision,\n  CrossSurfaceAdditionRejectionReason,\n  CrossSurfaceCandidate,\n  CrossSurfaceCandidateComparison,\n  CrossSurfaceCandidateEvidence,\n  CrossSurfaceCandidateOutcome,\n  CrossSurfaceCandidateSummary,\n  CrossSurfaceCompositionStep,\n  CrossSurfaceDistribution,\n  CrossSurfaceEligibility,\n  CrossSurfaceEvidenceBreakdown,\n  CrossSurfaceIneligibilityReason,\n  CrossSurfaceInteractionAwareSelection,\n  CrossSurfaceInteractionEffect,\n  CrossSurfaceInteractionPath,\n  CrossSurfaceInteractionReport,\n  CrossSurfaceNaiveStackSelection,\n  CrossSurfacePairCompatibility,\n  CrossSurfacePairEvidence,\n  CrossSurfacePairIncompatibilityReason,\n  CrossSurfacePairwiseEntry,\n  CrossSurfaceRankedSingle,\n  CrossSurfaceRelativeCost,\n  CrossSurfaceSelections,\n  CrossSurfaceTaskRow,\n} from './cross-surface-types'\n\n/**\n * Build the complete cross-surface evidence matrix and derive all three frozen\n * candidates. The task/candidate/component orders are part of the input so\n * neither insertion order nor an after-the-fact tie-break can change a result.\n */\nexport function analyzeCrossSurfaceInteractions<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): CrossSurfaceInteractionReport<TRow> {\n  const context = validateAndIndex(input)\n  const baseline = context.candidateById.get(input.baselineCandidateId)!\n\n  const preliminary = context.candidates.map((candidate) =>\n    summarizeCandidate(context, candidate, baseline),\n  )\n  const baselineSummary = preliminary.find(\n    (summary) => summary.candidate.candidateId === input.baselineCandidateId,\n  )!\n  const summaries = preliminary.map((summary) =>\n    summary.candidate.candidateId === input.baselineCandidateId\n      ? summary\n      : {\n          ...summary,\n          eligibility: candidateEligibility(context, summary, baselineSummary),\n        },\n  )\n  const summaryById = new Map(summaries.map((summary) => [summary.candidate.candidateId, summary]))\n  const eligibleSingles = rankedEligibleSingles(context, summaryById)\n  const interactionReadySingles = rankedInteractionReadySingles(context, summaryById)\n  const pairwise = buildPairwise(context, summaryById, interactionReadySingles, baselineSummary)\n  const selections = selectCandidates(\n    context,\n    summaryById,\n    eligibleSingles,\n    interactionReadySingles,\n    pairwise,\n  )\n  const rows = context.candidates.flatMap((candidate) =>\n    input.taskOrder.map(\n      (taskId) => context.rowsByCandidate.get(candidate.candidateId)!.get(taskId)!,\n    ),\n  )\n\n  return {\n    taskIds: [...input.taskOrder],\n    componentIds: [...input.componentOrder],\n    candidateIds: [...input.candidateOrder],\n    costMetrics: [...input.costMetricOrder],\n    rows,\n    missingAttempts: rows.filter((row) => row.completeness === 'missing'),\n    invalidAttempts: rows.filter((row) => row.completeness === 'invalid'),\n    candidates: summaries,\n    pairwise,\n    selections,\n  }\n}\n\nfunction summarizeCandidate<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  candidate: CrossSurfaceCandidate,\n  baseline: CrossSurfaceCandidate,\n): CrossSurfaceCandidateSummary {\n  const rows = rowsFor(context, candidate.candidateId)\n  const baselineRows = rowsFor(context, baseline.candidateId)\n  const outcome = summarizeOutcome(\n    context,\n    rows,\n    baselineRows,\n    candidate.candidateId === baseline.candidateId,\n  )\n  const completeScores = rows\n    .filter((row) => row.completeness === 'complete')\n    .map((row) => row.score as number)\n  const costs = Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => [\n      metric,\n      distribution(rows.map((row) => row.cost[metric] as number)),\n    ]),\n  )\n  return {\n    candidate,\n    outcome,\n    score: completeScores.length === 0 ? null : distribution(completeScores),\n    costs,\n    firing: summarizeCandidateEvidence(rows, candidate.componentIds, 'fired'),\n    effect: summarizeCandidateEvidence(rows, candidate.componentIds, 'effectObserved'),\n    comparisonToBaseline:\n      candidate.candidateId === baseline.candidateId\n        ? null\n        : pairedComparison(context, baseline.candidateId, candidate.candidateId),\n    eligibility: null,\n  }\n}\n\nfunction summarizeOutcome<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  rows: TRow[],\n  baselineRows: TRow[],\n  isBaseline: boolean,\n): CrossSurfaceCandidateOutcome {\n  const resolvedTaskIds: string[] = []\n  const failedTaskIds: string[] = []\n  const missingTaskIds: string[] = []\n  const invalidTaskIds: string[] = []\n  const benefitTaskIds: string[] = []\n  const regressionTaskIds: string[] = []\n  const comparisonMissingTaskIds: string[] = []\n  for (let index = 0; index < context.input.taskOrder.length; index++) {\n    const row = rows[index]!\n    const baseline = baselineRows[index]!\n    if (row.completeness === 'missing') missingTaskIds.push(row.taskId)\n    else if (row.completeness === 'invalid') invalidTaskIds.push(row.taskId)\n    else if (row.pass) resolvedTaskIds.push(row.taskId)\n    else failedTaskIds.push(row.taskId)\n\n    if (isBaseline) continue\n    if (row.completeness !== 'complete' || baseline.completeness !== 'complete') {\n      comparisonMissingTaskIds.push(row.taskId)\n    } else if (row.pass && !baseline.pass) benefitTaskIds.push(row.taskId)\n    else if (!row.pass && baseline.pass) regressionTaskIds.push(row.taskId)\n  }\n  return {\n    resolvedTaskIds,\n    failedTaskIds,\n    missingTaskIds,\n    invalidTaskIds,\n    benefitTaskIds,\n    regressionTaskIds,\n    comparisonMissingTaskIds,\n    netBenefit: benefitTaskIds.length - regressionTaskIds.length,\n  }\n}\n\nfunction summarizeCandidateEvidence<TRow extends CrossSurfaceTaskRow>(\n  rows: TRow[],\n  componentIds: string[],\n  field: 'fired' | 'effectObserved',\n): CrossSurfaceCandidateEvidence {\n  if (componentIds.length === 0) {\n    return {\n      byComponent: [],\n      allObservedTaskIds: [],\n      someObservedTaskIds: [],\n      noneObservedTaskIds: [],\n      unobservedTaskIds: [],\n    }\n  }\n  const byComponent: CrossSurfaceEvidenceBreakdown[] = componentIds.map((componentId) => {\n    const observedTaskIds: string[] = []\n    const notObservedTaskIds: string[] = []\n    const unobservedTaskIds: string[] = []\n    for (const row of rows) {\n      const value = evidenceValue(row, componentId, field)\n      if (value === true) observedTaskIds.push(row.taskId)\n      else if (value === false) notObservedTaskIds.push(row.taskId)\n      else unobservedTaskIds.push(row.taskId)\n    }\n    return { componentId, observedTaskIds, notObservedTaskIds, unobservedTaskIds }\n  })\n  const allObservedTaskIds: string[] = []\n  const someObservedTaskIds: string[] = []\n  const noneObservedTaskIds: string[] = []\n  const unobservedTaskIds: string[] = []\n  for (const row of rows) {\n    const values = componentIds.map((componentId) => evidenceValue(row, componentId, field))\n    if (values.some((value) => value === null)) unobservedTaskIds.push(row.taskId)\n    else if (values.every(Boolean)) allObservedTaskIds.push(row.taskId)\n    else if (values.some(Boolean)) someObservedTaskIds.push(row.taskId)\n    else noneObservedTaskIds.push(row.taskId)\n  }\n  return {\n    byComponent,\n    allObservedTaskIds,\n    someObservedTaskIds,\n    noneObservedTaskIds,\n    unobservedTaskIds,\n  }\n}\n\nfunction candidateEligibility<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summary: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n): CrossSurfaceEligibility {\n  const reasons: CrossSurfaceIneligibilityReason[] = []\n  if (summary.outcome.missingTaskIds.length > 0) reasons.push('missing_attempt')\n  if (summary.outcome.invalidTaskIds.length > 0) reasons.push('invalid_attempt')\n  if (summary.outcome.comparisonMissingTaskIds.length > 0) reasons.push('baseline_outcome_missing')\n  if (summary.outcome.benefitTaskIds.length <= summary.outcome.regressionTaskIds.length) {\n    reasons.push('benefit_not_greater_than_regression')\n  }\n  appendEvidenceEligibilityReasons(\n    reasons,\n    summary.firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendEvidenceEligibilityReasons(\n    reasons,\n    summary.effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, summary, baseline)) reasons.push('cost_limit_exceeded')\n  return { eligible: reasons.length === 0, reasons: unique(reasons) }\n}\n\nfunction appendEvidenceEligibilityReasons(\n  reasons: CrossSurfaceIneligibilityReason[],\n  evidence: CrossSurfaceCandidateEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfaceIneligibilityReason,\n  unobservedReason: CrossSurfaceIneligibilityReason,\n): void {\n  if (evidence.byComponent.some((component) => component.observedTaskIds.length < minimum)) {\n    reasons.push(belowReason)\n  }\n  if (\n    requireObserved &&\n    evidence.byComponent.some((component) => component.unobservedTaskIds.length > 0)\n  ) {\n    reasons.push(unobservedReason)\n  }\n}\n\nfunction rankedEligibleSingles<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n): CrossSurfaceCandidateSummary[] {\n  return [...context.singleByComponent.values()]\n    .map((candidate) => summaryById.get(candidate.candidateId)!)\n    .filter((summary) => summary.eligibility?.eligible)\n    .sort((left, right) => compareSingleSummaries(context, left, right))\n}\n\n/**\n * A neutral constituent may seed a composition when it has complete, bounded,\n * observed evidence and causes no baseline regression. Individual benefit is\n * deliberately left to the best-single arm rather than used as a pair gate.\n */\nfunction rankedInteractionReadySingles<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n): CrossSurfaceCandidateSummary[] {\n  return [...context.singleByComponent.values()]\n    .map((candidate) => summaryById.get(candidate.candidateId)!)\n    .filter(\n      (summary) =>\n        summary.outcome.regressionTaskIds.length === 0 &&\n        summary.eligibility?.reasons.every(\n          (reason) => reason === 'benefit_not_greater_than_regression',\n        ),\n    )\n    .sort((left, right) => compareSingleSummaries(context, left, right))\n}\n\nfunction compareSingleSummaries<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  left: CrossSurfaceCandidateSummary,\n  right: CrossSurfaceCandidateSummary,\n): number {\n  const byNetBenefit = right.outcome.netBenefit - left.outcome.netBenefit\n  if (byNetBenefit !== 0) return byNetBenefit\n  const byBenefit = right.outcome.benefitTaskIds.length - left.outcome.benefitTaskIds.length\n  if (byBenefit !== 0) return byBenefit\n  const byRegression =\n    left.outcome.regressionTaskIds.length - right.outcome.regressionTaskIds.length\n  if (byRegression !== 0) return byRegression\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = left.costs[metric]!.median - right.costs[metric]!.median\n    if (byCost !== 0) return byCost\n  }\n  const byBytes = left.candidate.artifactBytes - right.candidate.artifactBytes\n  if (byBytes !== 0) return byBytes\n  return (\n    context.candidateIndex.get(left.candidate.candidateId)! -\n    context.candidateIndex.get(right.candidate.candidateId)!\n  )\n}\n\nfunction buildPairwise<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  baseline: CrossSurfaceCandidateSummary,\n): CrossSurfacePairwiseEntry[] {\n  const interactionReadyIds = new Set(\n    interactionReadySingles.map((summary) => summary.candidate.candidateId),\n  )\n  const entries: CrossSurfacePairwiseEntry[] = []\n  for (let leftIndex = 0; leftIndex < context.components.length; leftIndex++) {\n    for (let rightIndex = leftIndex + 1; rightIndex < context.components.length; rightIndex++) {\n      const leftComponent = context.components[leftIndex]!\n      const rightComponent = context.components[rightIndex]!\n      const leftSingle = context.singleByComponent.get(leftComponent.componentId)!\n      const rightSingle = context.singleByComponent.get(rightComponent.componentId)!\n      const pair = context.candidateByComponents.get(\n        componentSetKey([leftComponent.componentId, rightComponent.componentId]),\n      )!\n      const pairSummary = summaryById.get(pair.candidateId)!\n      const leftSummary = summaryById.get(leftSingle.candidateId)!\n      const rightSummary = summaryById.get(rightSingle.candidateId)!\n      const synergyTaskIds: string[] = []\n      const interferenceTaskIds: string[] = []\n      for (const taskId of context.input.taskOrder) {\n        const pairRow = rowFor(context, pair.candidateId, taskId)\n        const leftRow = rowFor(context, leftSingle.candidateId, taskId)\n        const rightRow = rowFor(context, rightSingle.candidateId, taskId)\n        if (![pairRow, leftRow, rightRow].every((row) => row.completeness === 'complete')) continue\n        if (pairRow.pass && !leftRow.pass && !rightRow.pass) synergyTaskIds.push(taskId)\n        if (!pairRow.pass && (leftRow.pass || rightRow.pass)) interferenceTaskIds.push(taskId)\n      }\n      const incrementalVsConstituents: [\n        CrossSurfaceCandidateComparison,\n        CrossSurfaceCandidateComparison,\n      ] = [\n        compareCandidates(context, summaryById, leftSingle.candidateId, pair.candidateId),\n        compareCandidates(context, summaryById, rightSingle.candidateId, pair.candidateId),\n      ]\n      const betterSingle =\n        compareSingleSummaries(context, leftSummary, rightSummary) <= 0 ? leftSummary : rightSummary\n      const firing = summarizePairEvidence(\n        rowsFor(context, pair.candidateId),\n        leftComponent.componentId,\n        rightComponent.componentId,\n        'fired',\n      )\n      const effect = summarizePairEvidence(\n        rowsFor(context, pair.candidateId),\n        leftComponent.componentId,\n        rightComponent.componentId,\n        'effectObserved',\n      )\n      const compatibility = pairCompatibility(\n        context,\n        pairSummary,\n        baseline,\n        betterSingle,\n        incrementalVsConstituents,\n        interactionReadyIds.has(leftSingle.candidateId) &&\n          interactionReadyIds.has(rightSingle.candidateId),\n        interferenceTaskIds,\n        firing,\n        effect,\n      )\n      entries.push({\n        componentIds: [leftComponent.componentId, rightComponent.componentId],\n        singleCandidateIds: [leftSingle.candidateId, rightSingle.candidateId],\n        compositionCandidateId: pair.candidateId,\n        benefitTaskIds: [...pairSummary.outcome.benefitTaskIds],\n        regressionTaskIds: [...pairSummary.outcome.regressionTaskIds],\n        synergyTaskIds,\n        interferenceTaskIds,\n        incrementalVsConstituents,\n        relativeCostToBaseline: relativeCosts(context, pairSummary, baseline),\n        firing,\n        effect,\n        interaction: interactionEffect(\n          context,\n          baseline.candidate,\n          [leftSingle, rightSingle],\n          pair,\n        ),\n        compatibility,\n      })\n    }\n  }\n  return entries\n}\n\nfunction pairCompatibility<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  pair: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n  betterSingle: CrossSurfaceCandidateSummary,\n  comparisons: [CrossSurfaceCandidateComparison, CrossSurfaceCandidateComparison],\n  constituentsReady: boolean,\n  interferenceTaskIds: string[],\n  firing: CrossSurfacePairEvidence,\n  effect: CrossSurfacePairEvidence,\n): CrossSurfacePairCompatibility {\n  const reasons: CrossSurfacePairIncompatibilityReason[] = []\n  if (!constituentsReady) reasons.push('constituent_not_ready')\n  if (\n    pair.outcome.missingTaskIds.length > 0 ||\n    pair.outcome.invalidTaskIds.length > 0 ||\n    pair.outcome.comparisonMissingTaskIds.length > 0\n  ) {\n    reasons.push('pair_incomplete')\n  }\n  if (pair.outcome.regressionTaskIds.length > 0) reasons.push('baseline_regression')\n  if (interferenceTaskIds.length > 0) reasons.push('interference')\n  const betterComparison = comparisons.find(\n    (comparison) => comparison.comparatorCandidateId === betterSingle.candidate.candidateId,\n  )!\n  if (betterComparison.winsTaskIds.length === 0) reasons.push('no_incremental_resolution')\n  appendPairEvidenceReasons(\n    reasons,\n    firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendPairEvidenceReasons(\n    reasons,\n    effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, pair, baseline)) reasons.push('cost_limit_exceeded')\n  return {\n    compatible: reasons.length === 0,\n    reasons: unique(reasons),\n    betterSingleCandidateId: betterSingle.candidate.candidateId,\n  }\n}\n\nfunction appendPairEvidenceReasons(\n  reasons: CrossSurfacePairIncompatibilityReason[],\n  evidence: CrossSurfacePairEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfacePairIncompatibilityReason,\n  unobservedReason: CrossSurfacePairIncompatibilityReason,\n): void {\n  const leftObserved = evidence.bothTaskIds.length + evidence.leftOnlyTaskIds.length\n  const rightObserved = evidence.bothTaskIds.length + evidence.rightOnlyTaskIds.length\n  if (leftObserved < minimum || rightObserved < minimum) reasons.push(belowReason)\n  if (requireObserved && evidence.unobservedTaskIds.length > 0) reasons.push(unobservedReason)\n}\n\nfunction interactionEffect<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  baseline: CrossSurfaceCandidate,\n  singles: CrossSurfaceCandidate[],\n  composition: CrossSurfaceCandidate,\n): CrossSurfaceInteractionEffect {\n  const perTask = context.input.taskOrder.map((taskId) => {\n    const baselineRow = rowFor(context, baseline.candidateId, taskId)\n    const singleRows = singles.map((single) => rowFor(context, single.candidateId, taskId))\n    const compositionRow = rowFor(context, composition.candidateId, taskId)\n    const rows = [baselineRow, ...singleRows, compositionRow]\n    if (!rows.every((row) => row.completeness === 'complete')) {\n      return { taskId, passInteraction: null, scoreInteraction: null }\n    }\n    const additivePass =\n      singleRows.reduce((sum, row) => sum + Number(row.pass), 0) -\n      (singles.length - 1) * Number(baselineRow.pass)\n    const additiveScore =\n      singleRows.reduce((sum, row) => sum + (row.score as number), 0) -\n      (singles.length - 1) * (baselineRow.score as number)\n    return {\n      taskId,\n      passInteraction: Number(compositionRow.pass) - additivePass,\n      scoreInteraction: (compositionRow.score as number) - additiveScore,\n    }\n  })\n  const complete = perTask.filter(\n    (row): row is { taskId: string; passInteraction: number; scoreInteraction: number } =>\n      row.passInteraction !== null && row.scoreInteraction !== null,\n  )\n  const passInteractions = complete.map((row) => row.passInteraction)\n  const scoreInteractions = complete.map((row) => row.scoreInteraction)\n  return {\n    perTask,\n    n: complete.length,\n    nMissing: perTask.length - complete.length,\n    meanPassInteraction: meanOrNull(passInteractions),\n    meanScoreInteraction: meanOrNull(scoreInteractions),\n    passBootstrap: bootstrapInteraction(passInteractions, context),\n    scoreBootstrap: bootstrapInteraction(scoreInteractions, context),\n  }\n}\n\nfunction bootstrapInteraction<TRow extends CrossSurfaceTaskRow>(\n  interactions: number[],\n  context: AnalysisContext<TRow>,\n) {\n  if (interactions.length === 0) return null\n  return pairedBootstrap(new Array(interactions.length).fill(0), interactions, {\n    ...context.input.bootstrap,\n    statistic: 'mean',\n  })\n}\n\nfunction selectCandidates<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  eligibleSingles: CrossSurfaceCandidateSummary[],\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairwise: CrossSurfacePairwiseEntry[],\n): CrossSurfaceSelections {\n  const bestSingleRanking = eligibleSingles.filter((summary) => {\n    const componentId = summary.candidate.componentIds[0]!\n    return context.componentById.get(componentId)!.bestSingleEligible\n  })\n  const ranking: CrossSurfaceRankedSingle[] = bestSingleRanking.map((summary, index) => ({\n    rank: index + 1,\n    candidateId: summary.candidate.candidateId,\n    componentId: summary.candidate.componentIds[0]!,\n  }))\n  const best = bestSingleRanking[0]\n  const bestSingle = best\n    ? {\n        candidateId: best.candidate.candidateId,\n        componentId: best.candidate.componentIds[0]!,\n        ranking,\n      }\n    : null\n  const naiveStack = selectNaiveStack(context, eligibleSingles)\n  const interactionAware = selectInteractionAware(\n    context,\n    summaryById,\n    interactionReadySingles,\n    pairwise,\n  )\n  return { bestSingle, naiveStack, interactionAware }\n}\n\nfunction selectNaiveStack<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  eligibleSingles: CrossSurfaceCandidateSummary[],\n): CrossSurfaceNaiveStackSelection | null {\n  if (eligibleSingles.length === 0) return null\n  const componentIds = eligibleSingles\n    .map((summary) => summary.candidate.componentIds[0]!)\n    .sort((left, right) => context.componentIndex.get(left)! - context.componentIndex.get(right)!)\n  const candidate = context.candidateByComponents.get(componentSetKey(componentIds))\n  if (!candidate) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: naive stack [${componentIds.join(', ')}] was not evaluated`,\n    )\n  }\n  return { candidateId: candidate.candidateId, componentIds }\n}\n\nfunction selectInteractionAware<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairwise: CrossSurfacePairwiseEntry[],\n): CrossSurfaceInteractionAwareSelection | null {\n  const baseline = summaryById.get(context.input.baselineCandidateId)!\n  const pairByComponents = new Map(\n    pairwise.map((entry) => [componentSetKey(entry.componentIds), entry]),\n  )\n  const paths = pairwise\n    .filter((entry) => entry.compatibility.compatible)\n    .map((entry) =>\n      growInteractionPath(\n        context,\n        summaryById,\n        interactionReadySingles,\n        pairByComponents,\n        baseline,\n        summaryById.get(entry.compositionCandidateId)!,\n      ),\n    )\n  if (paths.length === 0) return null\n\n  const qualified = paths\n    .filter((path) => path.qualified)\n    .sort((left, right) => compareInteractionPaths(context, summaryById, left, right))\n  const winning =\n    qualified[0] ??\n    [...paths].sort((left, right) => compareInteractionPaths(context, summaryById, left, right))[0]!\n  return {\n    seedCandidateId: winning.seedCandidateId,\n    terminalCandidateId: winning.terminalCandidateId,\n    terminalComponentIds: [...winning.terminalComponentIds],\n    selectedCandidateId: qualified.length > 0 ? winning.terminalCandidateId : null,\n    qualified: qualified.length > 0,\n    evaluatedPaths: paths,\n    steps: winning.steps,\n  }\n}\n\nfunction growInteractionPath<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairByComponents: Map<string, CrossSurfacePairwiseEntry>,\n  baseline: CrossSurfaceCandidateSummary,\n  seed: CrossSurfaceCandidateSummary,\n): CrossSurfaceInteractionPath {\n  let current = seed\n  let retained = [...seed.candidate.componentIds]\n  let remaining = interactionReadySingles.filter(\n    (summary) => !retained.includes(summary.candidate.componentIds[0]!),\n  )\n  const steps: CrossSurfaceCompositionStep[] = []\n\n  while (remaining.length > 0) {\n    const decisions = remaining.map((addition) =>\n      evaluateAddition(\n        context,\n        summaryById,\n        pairByComponents,\n        baseline,\n        current,\n        retained,\n        addition,\n      ),\n    )\n    const eligible = decisions\n      .filter((decision) => decision.eligible)\n      .sort((left, right) => compareAdditionDecisions(context, summaryById, left, right))\n    const selected = eligible[0]\n    if (selected) selected.selected = true\n    steps.push({\n      fromCandidateId: current.candidate.candidateId,\n      retainedComponentIds: [...retained],\n      considered: decisions.sort(\n        (left, right) =>\n          context.candidateIndex.get(left.additionCandidateId)! -\n          context.candidateIndex.get(right.additionCandidateId)!,\n      ),\n      selectedCandidateId: selected?.bundleCandidateId ?? null,\n    })\n    if (!selected?.bundleCandidateId) break\n    current = summaryById.get(selected.bundleCandidateId)!\n    retained = [...current.candidate.componentIds]\n    remaining = remaining.filter(\n      (summary) => summary.candidate.candidateId !== selected.additionCandidateId,\n    )\n  }\n\n  const qualified = retained.length >= context.input.selection.minimumBundleComponents\n  return {\n    seedCandidateId: seed.candidate.candidateId,\n    terminalCandidateId: current.candidate.candidateId,\n    terminalComponentIds: retained,\n    qualified,\n    steps,\n  }\n}\n\nfunction compareInteractionPaths<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  left: CrossSurfaceInteractionPath,\n  right: CrossSurfaceInteractionPath,\n): number {\n  const leftSummary = summaryById.get(left.terminalCandidateId)!\n  const rightSummary = summaryById.get(right.terminalCandidateId)!\n  const byNetBenefit = rightSummary.outcome.netBenefit - leftSummary.outcome.netBenefit\n  if (byNetBenefit !== 0) return byNetBenefit\n  const byBenefit =\n    rightSummary.outcome.benefitTaskIds.length - leftSummary.outcome.benefitTaskIds.length\n  if (byBenefit !== 0) return byBenefit\n  const byRegression =\n    leftSummary.outcome.regressionTaskIds.length - rightSummary.outcome.regressionTaskIds.length\n  if (byRegression !== 0) return byRegression\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = leftSummary.costs[metric]!.median - rightSummary.costs[metric]!.median\n    if (byCost !== 0) return byCost\n  }\n  const byBytes = leftSummary.candidate.artifactBytes - rightSummary.candidate.artifactBytes\n  if (byBytes !== 0) return byBytes\n  const byCandidateOrder =\n    context.candidateIndex.get(left.terminalCandidateId)! -\n    context.candidateIndex.get(right.terminalCandidateId)!\n  if (byCandidateOrder !== 0) return byCandidateOrder\n  return (\n    context.candidateIndex.get(left.seedCandidateId)! -\n    context.candidateIndex.get(right.seedCandidateId)!\n  )\n}\n\nfunction evaluateAddition<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  pairByComponents: Map<string, CrossSurfacePairwiseEntry>,\n  baseline: CrossSurfaceCandidateSummary,\n  current: CrossSurfaceCandidateSummary,\n  retained: string[],\n  addition: CrossSurfaceCandidateSummary,\n): CrossSurfaceAdditionDecision {\n  const additionComponentId = addition.candidate.componentIds[0]!\n  const reasons: CrossSurfaceAdditionRejectionReason[] = []\n  for (const retainedComponentId of retained) {\n    const pair = pairByComponents.get(\n      componentSetKey(canonicalComponents(context, [retainedComponentId, additionComponentId])),\n    )\n    if (!pair?.compatibility.compatible) reasons.push('pair_incompatible')\n  }\n  const bundleComponents = canonicalComponents(context, [...retained, additionComponentId])\n  const bundle = context.candidateByComponents.get(componentSetKey(bundleComponents))\n  if (!bundle) {\n    reasons.push('full_bundle_not_evaluated')\n    return emptyAdditionDecision(addition, additionComponentId, reasons)\n  }\n  const bundleSummary = summaryById.get(bundle.candidateId)!\n  if (\n    bundleSummary.outcome.missingTaskIds.length > 0 ||\n    bundleSummary.outcome.invalidTaskIds.length > 0 ||\n    bundleSummary.outcome.comparisonMissingTaskIds.length > 0\n  ) {\n    reasons.push('bundle_incomplete')\n  }\n  if (bundleSummary.outcome.regressionTaskIds.length > 0) reasons.push('baseline_regression')\n  const comparison = compareCandidates(\n    context,\n    summaryById,\n    current.candidate.candidateId,\n    bundle.candidateId,\n  )\n  if (comparison.winsTaskIds.length === 0) reasons.push('no_incremental_resolution')\n  if (comparison.regressionTaskIds.length > 0) reasons.push('incremental_regression')\n  appendBundleEvidenceReasons(\n    reasons,\n    bundleSummary.firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendBundleEvidenceReasons(\n    reasons,\n    bundleSummary.effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, bundleSummary, baseline)) reasons.push('cost_limit_exceeded')\n  return {\n    additionCandidateId: addition.candidate.candidateId,\n    additionComponentId,\n    bundleCandidateId: bundle.candidateId,\n    incrementalResolutionTaskIds: comparison.winsTaskIds,\n    incrementalRegressionTaskIds: comparison.regressionTaskIds,\n    incrementalMedianCost: Object.fromEntries(\n      context.input.costMetricOrder.map((metric) => [\n        metric,\n        bundleSummary.costs[metric]!.median - current.costs[metric]!.median,\n      ]),\n    ),\n    eligible: reasons.length === 0,\n    selected: false,\n    reasons: unique(reasons),\n  }\n}\n\nfunction emptyAdditionDecision(\n  addition: CrossSurfaceCandidateSummary,\n  additionComponentId: string,\n  reasons: CrossSurfaceAdditionRejectionReason[],\n): CrossSurfaceAdditionDecision {\n  return {\n    additionCandidateId: addition.candidate.candidateId,\n    additionComponentId,\n    bundleCandidateId: null,\n    incrementalResolutionTaskIds: [],\n    incrementalRegressionTaskIds: [],\n    incrementalMedianCost: null,\n    eligible: false,\n    selected: false,\n    reasons: unique(reasons),\n  }\n}\n\nfunction appendBundleEvidenceReasons(\n  reasons: CrossSurfaceAdditionRejectionReason[],\n  evidence: CrossSurfaceCandidateEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfaceAdditionRejectionReason,\n  unobservedReason: CrossSurfaceAdditionRejectionReason,\n): void {\n  if (evidence.byComponent.some((component) => component.observedTaskIds.length < minimum)) {\n    reasons.push(belowReason)\n  }\n  if (\n    requireObserved &&\n    evidence.byComponent.some((component) => component.unobservedTaskIds.length > 0)\n  ) {\n    reasons.push(unobservedReason)\n  }\n}\n\nfunction compareAdditionDecisions<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  left: CrossSurfaceAdditionDecision,\n  right: CrossSurfaceAdditionDecision,\n): number {\n  const byWins =\n    right.incrementalResolutionTaskIds.length - left.incrementalResolutionTaskIds.length\n  if (byWins !== 0) return byWins\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = left.incrementalMedianCost![metric]! - right.incrementalMedianCost![metric]!\n    if (byCost !== 0) return byCost\n  }\n  const leftBytes = summaryById.get(left.additionCandidateId)!.candidate.artifactBytes\n  const rightBytes = summaryById.get(right.additionCandidateId)!.candidate.artifactBytes\n  const byBytes = leftBytes - rightBytes\n  if (byBytes !== 0) return byBytes\n  return (\n    context.candidateIndex.get(left.additionCandidateId)! -\n    context.candidateIndex.get(right.additionCandidateId)!\n  )\n}\n\nfunction compareCandidates<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  comparatorCandidateId: string,\n  treatmentCandidateId: string,\n): CrossSurfaceCandidateComparison {\n  const winsTaskIds: string[] = []\n  const regressionTaskIds: string[] = []\n  const missingTaskIds: string[] = []\n  for (const taskId of context.input.taskOrder) {\n    const comparator = rowFor(context, comparatorCandidateId, taskId)\n    const treatment = rowFor(context, treatmentCandidateId, taskId)\n    if (comparator.completeness !== 'complete' || treatment.completeness !== 'complete') {\n      missingTaskIds.push(taskId)\n    } else if (treatment.pass && !comparator.pass) winsTaskIds.push(taskId)\n    else if (!treatment.pass && comparator.pass) regressionTaskIds.push(taskId)\n  }\n  return {\n    comparatorCandidateId,\n    treatmentCandidateId,\n    winsTaskIds,\n    regressionTaskIds,\n    missingTaskIds,\n    paired: pairedComparison(context, comparatorCandidateId, treatmentCandidateId),\n    relativeCost: relativeCosts(\n      context,\n      summaryById.get(treatmentCandidateId)!,\n      summaryById.get(comparatorCandidateId)!,\n    ),\n  }\n}\n\nfunction pairedComparison<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  comparatorCandidateId: string,\n  treatmentCandidateId: string,\n): PairedArmsComparison {\n  const rows: PairedArmRow[] = []\n  for (const taskId of context.input.taskOrder) {\n    rows.push(toPairedArmRow(context, rowFor(context, comparatorCandidateId, taskId)))\n    rows.push(toPairedArmRow(context, rowFor(context, treatmentCandidateId, taskId)))\n  }\n  return comparePairedArms(rows, {\n    baselineArm: comparatorCandidateId,\n    treatmentArm: treatmentCandidateId,\n    metricNames: ['score', ...context.input.costMetricOrder],\n    bootstrap: { ...context.input.bootstrap, statistic: 'mean' },\n  })\n}\n\nfunction toPairedArmRow<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  row: TRow,\n): PairedArmRow {\n  const metrics: Record<string, number> = Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => [metric, row.cost[metric] as number]),\n  )\n  if (row.completeness === 'complete') metrics.score = row.score as number\n  return {\n    pairKey: row.taskId,\n    arm: row.candidateId,\n    ...(row.completeness === 'complete' ? { pass: row.pass as boolean } : {}),\n    metrics,\n  }\n}\n\nfunction summarizePairEvidence<TRow extends CrossSurfaceTaskRow>(\n  rows: TRow[],\n  leftComponentId: string,\n  rightComponentId: string,\n  field: 'fired' | 'effectObserved',\n): CrossSurfacePairEvidence {\n  const bothTaskIds: string[] = []\n  const leftOnlyTaskIds: string[] = []\n  const rightOnlyTaskIds: string[] = []\n  const neitherTaskIds: string[] = []\n  const unobservedTaskIds: string[] = []\n  for (const row of rows) {\n    const left = evidenceValue(row, leftComponentId, field)\n    const right = evidenceValue(row, rightComponentId, field)\n    if (left === null || right === null) unobservedTaskIds.push(row.taskId)\n    else if (left && right) bothTaskIds.push(row.taskId)\n    else if (left) leftOnlyTaskIds.push(row.taskId)\n    else if (right) rightOnlyTaskIds.push(row.taskId)\n    else neitherTaskIds.push(row.taskId)\n  }\n  return {\n    bothTaskIds,\n    leftOnlyTaskIds,\n    rightOnlyTaskIds,\n    neitherTaskIds,\n    unobservedTaskIds,\n  }\n}\n\nfunction relativeCosts<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  treatment: CrossSurfaceCandidateSummary,\n  comparator: CrossSurfaceCandidateSummary,\n): Record<string, CrossSurfaceRelativeCost> {\n  return Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => {\n      const treatmentMedian = treatment.costs[metric]!.median\n      const comparatorMedian = comparator.costs[metric]!.median\n      return [\n        metric,\n        {\n          treatmentMedian,\n          comparatorMedian,\n          medianDelta: treatmentMedian - comparatorMedian,\n          medianRatio:\n            comparatorMedian === 0\n              ? treatmentMedian === 0\n                ? 1\n                : null\n              : treatmentMedian / comparatorMedian,\n        },\n      ]\n    }),\n  )\n}\n\nfunction withinCostLimits<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  treatment: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n): boolean {\n  const relative = relativeCosts(context, treatment, baseline)\n  return Object.entries(context.input.selection.maximumMedianCostRatioToBaseline).every(\n    ([metric, limit]) => {\n      const ratio = relative[metric]!.medianRatio\n      return ratio !== null && ratio <= limit\n    },\n  )\n}\n\nfunction distribution(values: number[]): CrossSurfaceDistribution {\n  const sorted = [...values].sort((left, right) => left - right)\n  const total = sorted.reduce((sum, value) => sum + value, 0)\n  const middle = Math.floor(sorted.length / 2)\n  const median =\n    sorted.length % 2 === 1 ? sorted[middle]! : (sorted[middle - 1]! + sorted[middle]!) / 2\n  return {\n    n: sorted.length,\n    min: sorted[0]!,\n    median,\n    mean: total / sorted.length,\n    max: sorted[sorted.length - 1]!,\n    total,\n  }\n}\n\nfunction evidenceValue(\n  row: CrossSurfaceTaskRow,\n  componentId: string,\n  field: 'fired' | 'effectObserved',\n): boolean | null {\n  return row.componentEvidence.find((evidence) => evidence.componentId === componentId)![field]\n}\n\nfunction meanOrNull(values: number[]): number | null {\n  return values.length === 0 ? null : values.reduce((sum, value) => sum + value, 0) / values.length\n}\n\nfunction unique<T>(values: T[]): T[] {\n  return [...new Set(values)]\n}\n","import { createHash } from 'node:crypto'\nimport { existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { isAbsolute, join, relative, resolve } from 'node:path'\nimport { contentHash } from '../verdict-cache'\nimport { type CampaignRunPlan, type PlanCampaignRunOptions, planCampaignRun } from './run-campaign'\nimport type { CampaignStorage } from './storage'\nimport type { JudgeConfig, Scenario } from './types'\n\nexport type EvalFixtureValidationMode = 'vitest' | 'none'\n\nexport interface EvalFixtureFile {\n  path: string\n  sha256: string\n  bytes: number\n}\n\nexport interface EvalFixture {\n  name: string\n  path: string\n  promptPath: string\n  evalPath?: string\n  packageJsonPath?: string\n  prompt: string\n  files: EvalFixtureFile[]\n  fingerprint: string\n}\n\nexport interface EvalFixtureScenario extends Scenario {\n  kind: 'eval-fixture'\n  fixtureName: string\n  fixturePath: string\n  promptPath: string\n  evalPath?: string\n  packageJsonPath?: string\n  prompt: string\n  fingerprint: string\n}\n\nexport interface EvalFixtureLoadOptions {\n  /** `vitest` requires EVAL.ts/EVAL.tsx and package.json type=module. `none` only requires PROMPT.md. */\n  validation?: EvalFixtureValidationMode\n  /** Extra caller-owned knobs that affect fixture behavior, folded into the fingerprint. */\n  fingerprintConfig?: unknown\n}\n\nexport interface LoadEvalFixtureScenariosOptions extends EvalFixtureLoadOptions {\n  names?: string[]\n}\n\nexport interface PlanEvalFixtureRunOptions<TArtifact = unknown>\n  extends Pick<\n    PlanCampaignRunOptions<EvalFixtureScenario, TArtifact>,\n    'dispatchRef' | 'judges' | 'seed' | 'reps' | 'resumable' | 'runDir'\n  > {\n  evalsDir: string\n  validation?: EvalFixtureValidationMode\n  fingerprintConfig?: unknown\n  names?: string[]\n  storage?: CampaignStorage\n}\n\nexport type EvalFixtureRunPlan = CampaignRunPlan & {\n  fixtures: Array<Pick<EvalFixtureScenario, 'fixtureName' | 'fixturePath' | 'fingerprint'>>\n}\n\n/** Walk `evalsDir` and return the relative name of every fixture directory (one containing an exact-case `PROMPT.md`). */\nexport function discoverEvalFixtures(evalsDir: string): string[] {\n  const root = resolve(evalsDir)\n  if (!existsSync(root)) throw new Error(`discoverEvalFixtures: evalsDir not found: ${root}`)\n\n  const fixtures: string[] = []\n  const walk = (dir: string, base = '') => {\n    for (const entry of readdirSync(dir).sort()) {\n      if (entry.startsWith('.') || entry === 'node_modules') continue\n      const fullPath = join(dir, entry)\n      if (!statSync(fullPath).isDirectory()) continue\n\n      const name = base ? `${base}/${entry}` : entry\n      if (existsWithExactCase(fullPath, 'PROMPT.md')) {\n        fixtures.push(name)\n      } else {\n        walk(fullPath, name)\n      }\n    }\n  }\n\n  walk(root)\n  return fixtures\n}\n\n/**\n * Load ONE fixture by name: reads `PROMPT.md` (plus `EVAL.ts`/`EVAL.tsx` and `package.json` under\n * `vitest` validation) and content-fingerprints the full file set for cache identity.\n */\nexport function loadEvalFixture(\n  evalsDir: string,\n  name: string,\n  options: EvalFixtureLoadOptions = {},\n): EvalFixture {\n  const validation = options.validation ?? 'vitest'\n  const root = resolve(evalsDir)\n  const fixturePath = resolve(root, name)\n  assertInside(root, fixturePath, name)\n\n  if (!existsSync(fixturePath) || !statSync(fixturePath).isDirectory()) {\n    throw new Error(`loadEvalFixture: fixture not found: ${name}`)\n  }\n  if (!existsWithExactCase(fixturePath, 'PROMPT.md')) {\n    throw new Error(`loadEvalFixture: ${name} is missing exact-case PROMPT.md`)\n  }\n\n  const promptPath = join(fixturePath, 'PROMPT.md')\n  const evalPath = resolveEvalPath(fixturePath)\n  const packageJsonPath = existsWithExactCase(fixturePath, 'package.json')\n    ? join(fixturePath, 'package.json')\n    : undefined\n\n  if (validation !== 'none') {\n    if (!evalPath)\n      throw new Error(`loadEvalFixture: ${name} is missing exact-case EVAL.ts or EVAL.tsx`)\n    if (!packageJsonPath)\n      throw new Error(`loadEvalFixture: ${name} is missing exact-case package.json`)\n    assertModulePackage(packageJsonPath, name)\n  }\n\n  const files = collectFixtureFiles(fixturePath)\n  return {\n    name,\n    path: fixturePath,\n    promptPath,\n    evalPath,\n    packageJsonPath,\n    prompt: readFileSync(promptPath, 'utf8'),\n    files,\n    fingerprint: contentHash({\n      files,\n      config: options.fingerprintConfig ?? null,\n    }),\n  }\n}\n\n/** Load fixtures (all discovered, or just `names`) as campaign `Scenario`s tagged `eval-fixture`. */\nexport function loadEvalFixtureScenarios(\n  evalsDir: string,\n  options: LoadEvalFixtureScenariosOptions = {},\n): EvalFixtureScenario[] {\n  const names = options.names ?? discoverEvalFixtures(evalsDir)\n  return names.map((name) => {\n    const fixture = loadEvalFixture(evalsDir, name, options)\n    return {\n      id: fixture.name,\n      kind: 'eval-fixture',\n      tags: ['eval-fixture'],\n      fixtureName: fixture.name,\n      fixturePath: fixture.path,\n      promptPath: fixture.promptPath,\n      evalPath: fixture.evalPath,\n      packageJsonPath: fixture.packageJsonPath,\n      prompt: fixture.prompt,\n      fingerprint: fixture.fingerprint,\n    }\n  })\n}\n\n/**\n * Dry-run planner for a fixture campaign: loads the scenarios, delegates to `planCampaignRun`,\n * and returns the plan plus each fixture's name/path/fingerprint.\n */\nexport function planEvalFixtureRun<TArtifact = unknown>(\n  options: PlanEvalFixtureRunOptions<TArtifact>,\n): EvalFixtureRunPlan {\n  const scenarios = loadEvalFixtureScenarios(options.evalsDir, {\n    names: options.names,\n    validation: options.validation,\n    fingerprintConfig: options.fingerprintConfig,\n  })\n  const plan = planCampaignRun<EvalFixtureScenario, TArtifact>({\n    scenarios,\n    dispatchRef: options.dispatchRef ?? 'eval-fixture-dispatch',\n    judges: options.judges as JudgeConfig<TArtifact, EvalFixtureScenario>[] | undefined,\n    seed: options.seed,\n    reps: options.reps,\n    resumable: options.resumable,\n    runDir: options.runDir,\n    storage: options.storage,\n  })\n\n  return {\n    ...plan,\n    fixtures: scenarios.map((scenario) => ({\n      fixtureName: scenario.fixtureName,\n      fixturePath: scenario.fixturePath,\n      fingerprint: scenario.fingerprint,\n    })),\n  }\n}\n\nfunction existsWithExactCase(dirPath: string, fileName: string): boolean {\n  try {\n    return readdirSync(dirPath).includes(fileName)\n  } catch {\n    return false\n  }\n}\n\nfunction resolveEvalPath(fixturePath: string): string | undefined {\n  if (existsWithExactCase(fixturePath, 'EVAL.ts')) return join(fixturePath, 'EVAL.ts')\n  if (existsWithExactCase(fixturePath, 'EVAL.tsx')) return join(fixturePath, 'EVAL.tsx')\n  return undefined\n}\n\nfunction assertModulePackage(packageJsonPath: string, name: string): void {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(readFileSync(packageJsonPath, 'utf8'))\n  } catch (err) {\n    throw new Error(\n      `loadEvalFixture: ${name} package.json is invalid JSON: ${err instanceof Error ? err.message : String(err)}`,\n    )\n  }\n\n  if (\n    typeof parsed !== 'object' ||\n    parsed === null ||\n    (parsed as { type?: unknown }).type !== 'module'\n  ) {\n    throw new Error(`loadEvalFixture: ${name} package.json must set \"type\": \"module\"`)\n  }\n}\n\nfunction collectFixtureFiles(fixturePath: string, base = ''): EvalFixtureFile[] {\n  const files: EvalFixtureFile[] = []\n  for (const entry of readdirSync(join(fixturePath, base)).sort()) {\n    if (entry === 'node_modules' || entry === '.git') continue\n    const relativePath = base ? `${base}/${entry}` : entry\n    const fullPath = join(fixturePath, relativePath)\n    const stat = statSync(fullPath)\n    if (stat.isDirectory()) {\n      files.push(...collectFixtureFiles(fixturePath, relativePath))\n      continue\n    }\n    const bytes = readFileSync(fullPath)\n    files.push({\n      path: relativePath,\n      sha256: createHash('sha256').update(bytes).digest('hex'),\n      bytes: bytes.byteLength,\n    })\n  }\n  return files\n}\n\nfunction assertInside(root: string, target: string, label: string): void {\n  const rel = relative(root, target)\n  if (rel === '' || (!rel.startsWith('..') && !isAbsolute(rel))) return\n  throw new Error(`loadEvalFixture: fixture path escapes evalsDir: ${label}`)\n}\n","/**\n * @module\n * Composable placebo / neutralization promotion gate.\n *\n * A held-out gate proves a candidate beat baseline. It CANNOT prove the lift came\n * from the candidate's CONTENT rather than from the prompt/mount FOOTPRINT the\n * content happened to add (more bytes, a longer prompt). This gate closes that\n * hole: it compares the candidate's held-out lift against the lift of a\n * FOOTPRINT-MATCHED neutralized variant (same layout + length, zero content, via\n * `neutralizeText`). If the neutralized variant reproduces more than\n * `maxDecorativeFraction` of the candidate's lift, the lift is decorative — it\n * survives blanking the content — and the candidate is HELD regardless of how\n * large or significant its raw lift is.\n *\n * Compose it AFTER the significance gate — significance says the lift is real,\n * this says the lift is CAUSED BY THE CONTENT:\n *   composeGate(heldOutGate({ ... }), neutralizationGate({ ... }))\n *\n * Requires `ctx.neutralizedJudgeScores`, populated by `runImprovementLoop` when it\n * is given a `neutralize` function. A gate composed without that wiring fails\n * loud rather than silently passing an unproven candidate.\n */\n\nimport type { Gate, GateContext, GateResult, Scenario } from '../types'\nimport { pairHoldout } from './statistical-heldout'\n\nexport interface NeutralizationGateOptions<TScenario extends Scenario = Scenario> {\n  scenarios: TScenario[]\n  /** Reject when the neutralized (content-blanked, footprint-matched) variant\n   *  reproduces at least this fraction of the candidate's held-out lift. Default\n   *  0.5 — if blanking the content keeps half the lift, the content is decorative.\n   *  Equality rejects: a neutralized lift == threshold·candidateLift is decorative. */\n  maxDecorativeFraction?: number\n}\n\n/** Mean of a numeric array; 0 for an empty array (callers guard n separately). */\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\n/** Paired mean held-out lift of `arm` over baseline, on the in-scope cells. */\nfunction pairedLift(\n  arm: Map<string, Record<string, { composite: number }>>,\n  baseline: Map<string, Record<string, { composite: number }>>,\n  scenarioIds: Set<string>,\n): { lift: number; n: number } {\n  const paired = pairHoldout(arm as never, baseline as never, scenarioIds, (s) => s.composite)\n  const deltas = paired.after.map((a, i) => a - (paired.before[i] ?? 0))\n  return { lift: mean(deltas), n: deltas.length }\n}\n\n/**\n * Composable placebo gate: ships only when the candidate's held-out lift is NOT\n * mostly reproduced by a footprint-matched neutralized variant.\n */\nexport function neutralizationGate<TArtifact, TScenario extends Scenario>(\n  options: NeutralizationGateOptions<TScenario>,\n): Gate<TArtifact, TScenario> {\n  const maxDecorativeFraction = options.maxDecorativeFraction ?? 0.5\n  return {\n    name: 'neutralizationGate',\n    async decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult> {\n      if (!ctx.baselineJudgeScores) {\n        throw new Error(\n          'neutralizationGate: ctx.baselineJudgeScores is required — the placebo control measures lift OVER baseline.',\n        )\n      }\n      if (!ctx.neutralizedJudgeScores) {\n        throw new Error(\n          'neutralizationGate: ctx.neutralizedJudgeScores is required. It is populated by runImprovementLoop only when a `neutralize` function is supplied — composing this gate without that wiring would pass an unproven candidate.',\n        )\n      }\n      const scenarioIds = new Set(options.scenarios.map((s) => s.id))\n      const cand = pairedLift(\n        ctx.judgeScores as never,\n        ctx.baselineJudgeScores as never,\n        scenarioIds,\n      )\n      const neut = pairedLift(\n        ctx.neutralizedJudgeScores as never,\n        ctx.baselineJudgeScores as never,\n        scenarioIds,\n      )\n\n      // No positive candidate lift → nothing to attribute. Fail closed: the\n      // placebo control has no basis to clear the candidate (the significance\n      // gate is what judges lift magnitude; this one only judges its CAUSE).\n      if (cand.lift <= 0) {\n        return {\n          decision: 'hold',\n          reasons: [\n            `neutralization: candidate held-out lift ${cand.lift.toFixed(3)} ≤ 0 — no positive lift to attribute to content`,\n          ],\n          contributingGates: [\n            {\n              name: 'neutralizationGate',\n              status: 'fail',\n              detail: { candidateLift: cand.lift, neutralizedLift: neut.lift, n: cand.n },\n            },\n          ],\n          delta: cand.lift,\n        }\n      }\n\n      const decorativeFraction = neut.lift / cand.lift\n      const passed = decorativeFraction < maxDecorativeFraction\n      const pct = (decorativeFraction * 100).toFixed(0)\n      return {\n        decision: passed ? 'ship' : 'hold',\n        reasons: passed\n          ? [\n              `neutralization: content is causal — blanked variant reproduces ${pct}% of the lift (< ${(maxDecorativeFraction * 100).toFixed(0)}%); candidate Δ ${cand.lift.toFixed(3)}, neutralized Δ ${neut.lift.toFixed(3)}`,\n            ]\n          : [\n              `neutralization: lift is DECORATIVE — blanking the content (footprint-matched) reproduces ${pct}% of the lift (≥ ${(maxDecorativeFraction * 100).toFixed(0)}%); candidate Δ ${cand.lift.toFixed(3)}, neutralized Δ ${neut.lift.toFixed(3)}`,\n            ],\n        contributingGates: [\n          {\n            name: 'neutralizationGate',\n            status: passed ? 'pass' : 'fail',\n            detail: {\n              candidateLift: cand.lift,\n              neutralizedLift: neut.lift,\n              decorativeFraction,\n              maxDecorativeFraction,\n              n: cand.n,\n            },\n          },\n        ],\n        delta: cand.lift,\n      }\n    },\n  }\n}\n","/**\n * Evidence grounding for reflective optimizers (GEPA-style revise loops).\n *\n * Two failure modes recur when an LLM revises an artifact from raw rollout\n * traces (first measured in agent-lab R358, where naive reflection REGRESSED\n * the score 0.375 -> 0.125 before these helpers fixed it):\n *\n * 1. The environment often hides WHY a rollout failed - a tool call can\n *    succeed while an invisible downstream check fails - so the reviser\n *    cannot see the cause in the transcript. The only reliable signal is the\n *    field-level difference between what passing and failing rollouts did.\n *    `rolloutArgumentDiff` computes that difference deterministically so the\n *    reviser is handed the diff instead of being trusted to derive it.\n *\n * 2. Revisers invent plausible-but-wrong literal values (\"use 'new'\",\n *    \"use 'sent'\") that no passing rollout ever used, turning every rollout\n *    into a failure. `classifyUngroundedLiterals` mechanically detects them,\n *    separating HARMFUL literals (ones failing rollouts actually used -\n *    proven damage) from benign illustrations (e.g. a name example like\n *    'Doe'), so callers can hard-reject the former and merely log the latter.\n *    Rejecting every ungrounded quoted word is too blunt: it killed a run\n *    over a surname illustration before the severity split existed.\n *\n * Pure data in, data out: no LLM calls, no filesystem, no domain knowledge.\n */\n\n/** One tool/action call observed in a rollout: a name plus its arguments. */\nexport interface RolloutCall {\n  readonly name: string\n  readonly args: Readonly<Record<string, unknown>>\n}\n\n/** A scored rollout: its calls plus the scalar outcome used to split pass/fail. */\nexport interface ScoredRollout {\n  /** Caller-meaningful identifier (task id, cell id) used only for reporting. */\n  readonly id: string\n  /** Scalar outcome in [0, 1]; `passThreshold` splits passing from failing. */\n  readonly score: number\n  readonly calls: readonly RolloutCall[]\n}\n\nexport interface RolloutArgumentDiffOptions {\n  /** Rollouts with `score >= passThreshold` count as passing. Default 1. */\n  readonly passThreshold?: number\n  /** Max distinct values listed per field per side in the rendered text. Default 4. */\n  readonly maxValuesPerField?: number\n}\n\nexport interface RolloutArgumentDiff {\n  /** Human/LLM-readable per-field diff, one line per field. */\n  readonly text: string\n  /** Lowercased stringified argument values seen in passing rollouts. */\n  readonly passingValues: ReadonlySet<string>\n  /** Lowercased stringified argument values seen in failing rollouts. */\n  readonly failingValues: ReadonlySet<string>\n}\n\n/**\n * Deterministic per-field diff of call arguments between passing and failing\n * rollouts. A field set by failing rollouts but left unset by passing ones is\n * the classic poison-input signature; a field whose values differ across the\n * split points at the correct value. Feed `text` to the reviser verbatim.\n */\nexport function rolloutArgumentDiff(\n  rollouts: readonly ScoredRollout[],\n  opts: RolloutArgumentDiffOptions = {},\n): RolloutArgumentDiff {\n  const passThreshold = opts.passThreshold ?? 1\n  const maxValues = opts.maxValuesPerField ?? 4\n  const collect = (pass: boolean): Map<string, Set<string>> => {\n    const byField = new Map<string, Set<string>>()\n    for (const r of rollouts) {\n      if (pass !== r.score >= passThreshold) continue\n      for (const c of r.calls) {\n        for (const [k, v] of Object.entries(c.args)) {\n          const set = byField.get(k) ?? new Set<string>()\n          set.add(String(v))\n          byField.set(k, set)\n        }\n      }\n    }\n    return byField\n  }\n  const passing = collect(true)\n  const failing = collect(false)\n  const lines: string[] = []\n  for (const field of new Set([...passing.keys(), ...failing.keys()])) {\n    const pv = [...(passing.get(field) ?? [])].slice(0, maxValues)\n    const fv = [...(failing.get(field) ?? [])].slice(0, maxValues)\n    const render = (vals: string[]) => (vals.length ? JSON.stringify(vals) : 'NOT SET (omitted)')\n    lines.push(`  ${field}: passing runs -> ${render(pv)} | failing runs -> ${render(fv)}`)\n  }\n  const lower = (m: Map<string, Set<string>>): Set<string> => {\n    const out = new Set<string>()\n    for (const vals of m.values()) for (const v of vals) out.add(v.toLowerCase())\n    return out\n  }\n  return {\n    text: lines.join('\\n') || '  (no calls observed)',\n    passingValues: lower(passing),\n    failingValues: lower(failing),\n  }\n}\n\nexport interface UngroundedLiteralReport {\n  /** Quoted single-word literals in the text that no passing rollout used. */\n  readonly ungrounded: readonly string[]\n  /** The subset failing rollouts actually used - prescribing these is proven harmful. */\n  readonly harmful: readonly string[]\n}\n\n/**\n * Scan revised artifact text for single-quoted single-word literals (the\n * \"use exactly 'new'\" pattern) that appear in no passing rollout's argument\n * values. Multi-word quotes pass (they are prose, not prescriptions).\n * Callers should reject on `harmful` (with a bounded retry) and at most log\n * `ungrounded` - see the module header for why the severities differ.\n */\nexport function classifyUngroundedLiterals(\n  text: string,\n  diff: Pick<RolloutArgumentDiff, 'passingValues' | 'failingValues'>,\n): UngroundedLiteralReport {\n  const ungrounded = new Set<string>()\n  for (const m of text.matchAll(/'([a-z][a-z_-]{1,19})'/gi)) {\n    const w = (m[1] as string).toLowerCase()\n    if (!diff.passingValues.has(w)) ungrounded.add(w)\n  }\n  const all = [...ungrounded]\n  return {\n    ungrounded: all,\n    harmful: all.filter((w) => diff.failingValues.has(w)),\n  }\n}\n","/**\n * Filesystem `LabeledScenarioStore` adapter. The default capture sink for\n * traces + eval artifacts. Production deployments typically swap for a\n * Turso/SQLite adapter (same interface).\n *\n * Records land as one JSONL file per source under `<root>/<source>.jsonl`.\n * Each line is a `LabeledScenarioRecord`. Append-only — no in-place edits.\n *\n * Safety properties enforced at write-time:\n *\n *   - **Provenance required**: writes without `source`, `sourceVersionHash`,\n *     `capturedAt`, `redactionStatus` are rejected. Closes the alignment\n *     reviewer's data-poisoning gap.\n *   - **Per-source rate limits**: optional `rateLimitBucket` + `maxWritesPerMinute`\n *     stops a single tenant/source from flooding the store.\n *\n * Safety properties enforced at sample-time:\n *\n *   - **Required split + capturedBefore**: substrate refuses to sample without\n *     an explicit `split` ('train' | 'test') AND a temporal cutoff. Eliminates\n *     accidental train/test contamination.\n *   - **Default training-source filter**: when the store is sampled with\n *     `split: 'train'`, production-trace records are EXCLUDED unless the\n *     caller passes `filter.source: 'production-trace'` explicitly. Closes\n *     the contamination-by-default gap flagged by the senior eval engineer.\n */\n\nimport { createHash } from 'node:crypto'\nimport { existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs'\nimport { join } from 'node:path'\nimport { compareCodeUnits } from '../../ledger-core/canonical'\nimport type {\n  LabeledScenarioRecord,\n  LabeledScenarioSampleArgs,\n  LabeledScenarioSource,\n  LabeledScenarioStore,\n  LabeledScenarioWrite,\n  LabelTrust,\n} from '../types'\nimport { labelTrustRank } from '../types'\n\nexport interface FsLabeledScenarioStoreOptions {\n  /** Root directory for JSONL files. Created if missing. */\n  root: string\n  /** Per-source rate limit. When set, writes exceeding the cap are rejected\n   *  with a typed error. Default: no limit. */\n  maxWritesPerMinutePerBucket?: number\n  /** Test seam — override `Date.now()` for deterministic tests. */\n  now?: () => number\n}\n\n/** Typed rejection from a labeled-scenario store (bad provenance, rate limit, invalid sample args) — carries a stable string `code`. */\nexport class LabeledScenarioStoreError extends Error {\n  constructor(\n    public readonly code: string,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'LabeledScenarioStoreError'\n  }\n}\n\ninterface RateLimitState {\n  bucket: string\n  windowStartMs: number\n  count: number\n}\n\n/**\n * Filesystem `LabeledScenarioStore`: appends one JSONL file per source with provenance and\n * rate-limit guards. For tests, local dev, and small workloads — high-throughput lands in Turso.\n */\nexport class FsLabeledScenarioStore implements LabeledScenarioStore {\n  private readonly now: () => number\n  private readonly rateLimits = new Map<string, RateLimitState>()\n\n  constructor(private readonly options: FsLabeledScenarioStoreOptions) {\n    if (!existsSync(options.root)) mkdirSync(options.root, { recursive: true })\n    this.now = options.now ?? Date.now\n  }\n\n  async observe(write: LabeledScenarioWrite): Promise<void> {\n    this.assertProvenance(write)\n    this.assertRateLimit(write)\n    const record = this.toRecord(write)\n    const path = this.pathForSource(write.source)\n    const line = `${JSON.stringify(record)}\\n`\n    // Append atomically. For high-throughput a writev-friendly buffered\n    // implementation lands in the Turso adapter; FS adapter is for tests +\n    // local dev + small workloads.\n    appendLine(path, line)\n  }\n\n  async sample(args: LabeledScenarioSampleArgs): Promise<LabeledScenarioRecord[]> {\n    if (!args.split) {\n      throw new LabeledScenarioStoreError(\n        'split_required',\n        'sample() requires an explicit `split` (train | test) — substrate refuses ambiguous reads',\n      )\n    }\n    if (!args.capturedBefore) {\n      throw new LabeledScenarioStoreError(\n        'capturedBefore_required',\n        'sample() requires an explicit `capturedBefore` timestamp for temporal-split discipline',\n      )\n    }\n\n    const all: LabeledScenarioRecord[] = []\n    for (const source of ALL_SOURCES) {\n      // Default training-source filter: when sampling train, EXCLUDE\n      // production-trace records unless the caller asks for them.\n      if (args.split === 'train' && source === 'production-trace') {\n        const explicit = sourceFilterContains(args.filter?.source, 'production-trace')\n        if (!explicit) continue\n      }\n      const path = this.pathForSource(source)\n      if (!existsSync(path)) continue\n      const lines = readFileSync(path, 'utf8').split('\\n').filter(Boolean)\n      for (const line of lines) {\n        let record: LabeledScenarioRecord\n        try {\n          record = JSON.parse(line) as LabeledScenarioRecord\n        } catch {\n          continue\n        }\n        if (!matchesFilter(record, args, source)) continue\n        all.push(record)\n      }\n    }\n\n    // Deterministic order: by capturedAt ascending, then recordHash.\n    all.sort((a, b) => {\n      if (a.capturedAt !== b.capturedAt) return compareCodeUnits(a.capturedAt, b.capturedAt)\n      return compareCodeUnits(a.recordHash, b.recordHash)\n    })\n\n    return all.slice(0, args.count)\n  }\n\n  async size(): Promise<{\n    train: number\n    test: number\n    bySource: Record<string, number>\n    byTrust: Record<LabelTrust, number>\n  }> {\n    const bySource: Record<string, number> = {}\n    const byTrust: Record<LabelTrust, number> = {\n      unverified: 0,\n      'verified-signal': 0,\n      'human-rated': 0,\n    }\n    let total = 0\n    for (const source of ALL_SOURCES) {\n      const path = this.pathForSource(source)\n      if (!existsSync(path)) {\n        bySource[source] = 0\n        continue\n      }\n      const lines = readFileSync(path, 'utf8').split('\\n').filter(Boolean)\n      bySource[source] = lines.length\n      total += lines.length\n      for (const line of lines) {\n        let trust: LabelTrust = 'unverified'\n        try {\n          trust = (JSON.parse(line) as LabeledScenarioRecord).labelTrust ?? 'unverified'\n        } catch {\n          // A malformed line counts as unverified — never silently gold.\n        }\n        byTrust[trust] += 1\n      }\n    }\n    // FS adapter doesn't track split assignments per-record (split is\n    // computed at sample-time based on `capturedBefore`). For size(), we\n    // report `train`+`test` as the same total — split is a sampling concept.\n    return { train: total, test: total, bySource, byTrust }\n  }\n\n  private assertProvenance(write: LabeledScenarioWrite): void {\n    if (!write.source) {\n      throw new LabeledScenarioStoreError(\n        'missing_source',\n        'LabeledScenarioWrite requires `source`',\n      )\n    }\n    if (!write.sourceVersionHash || write.sourceVersionHash.length === 0) {\n      throw new LabeledScenarioStoreError(\n        'missing_source_version',\n        'LabeledScenarioWrite requires `sourceVersionHash` (git sha or substrate version)',\n      )\n    }\n    if (!write.capturedAt) {\n      throw new LabeledScenarioStoreError(\n        'missing_captured_at',\n        'LabeledScenarioWrite requires `capturedAt` ISO timestamp',\n      )\n    }\n    if (!write.redactionStatus) {\n      throw new LabeledScenarioStoreError(\n        'missing_redaction_status',\n        'LabeledScenarioWrite requires explicit `redactionStatus` — raw / redacted-pii / redacted-secrets / fully-redacted',\n      )\n    }\n    if (!ALL_SOURCES.includes(write.source)) {\n      throw new LabeledScenarioStoreError(\n        'unknown_source',\n        `LabeledScenarioWrite.source must be one of: ${ALL_SOURCES.join(', ')}`,\n      )\n    }\n  }\n\n  private assertRateLimit(write: LabeledScenarioWrite): void {\n    const cap = this.options.maxWritesPerMinutePerBucket\n    if (!cap || !write.rateLimitBucket) return\n    const now = this.now()\n    const windowMs = 60_000\n    let state = this.rateLimits.get(write.rateLimitBucket)\n    if (!state || now - state.windowStartMs >= windowMs) {\n      state = { bucket: write.rateLimitBucket, windowStartMs: now, count: 0 }\n      this.rateLimits.set(write.rateLimitBucket, state)\n    }\n    if (state.count >= cap) {\n      throw new LabeledScenarioStoreError(\n        'rate_limit_exceeded',\n        `LabeledScenarioStore: bucket ${write.rateLimitBucket} exceeded ${cap} writes/min`,\n      )\n    }\n    state.count += 1\n  }\n\n  private toRecord(write: LabeledScenarioWrite): LabeledScenarioRecord {\n    const recordHash = sha256(\n      JSON.stringify({\n        id: write.scenario.id,\n        src: write.source,\n        at: write.capturedAt,\n        ver: write.sourceVersionHash,\n      }),\n    )\n    // FS adapter assigns split at sample-time, but we cache a hint here\n    // based on capturedAt vs the world's \"now\" — sampler overrides this.\n    return {\n      ...write,\n      recordHash,\n      split: 'train',\n    }\n  }\n\n  private pathForSource(source: string): string {\n    return join(this.options.root, `${source}.jsonl`)\n  }\n}\n\nconst ALL_SOURCES: LabeledScenarioWrite['source'][] = [\n  'production-trace',\n  'eval-run',\n  'manual',\n  'red-team',\n  'synthetic',\n]\n\nfunction sourceFilterContains(\n  filter: LabeledScenarioSource | LabeledScenarioSource[] | undefined,\n  needle: LabeledScenarioSource,\n): boolean {\n  if (!filter) return false\n  if (Array.isArray(filter)) return filter.includes(needle)\n  return filter === needle\n}\n\nfunction matchesFilter(\n  record: LabeledScenarioRecord,\n  args: LabeledScenarioSampleArgs,\n  source: string,\n): boolean {\n  // Temporal cutoff — train must be capturedAt < capturedBefore.\n  if (args.split === 'train' && record.capturedAt >= args.capturedBefore) return false\n  if (args.split === 'test' && record.capturedAt < args.capturedBefore) return false\n\n  const f = args.filter\n  if (!f) return true\n  if (f.kind && record.scenario.kind !== f.kind) return false\n  if (f.source) {\n    const sources = Array.isArray(f.source) ? f.source : [f.source]\n    if (!sources.includes(source as never)) return false\n  }\n  if (f.minComposite !== undefined || f.maxComposite !== undefined) {\n    const composites = Object.values(record.judgeScores).map((s) => s.composite)\n    const max = composites.length === 0 ? 0 : Math.max(...composites)\n    if (f.minComposite !== undefined && max < f.minComposite) return false\n    if (f.maxComposite !== undefined && max > f.maxComposite) return false\n  }\n  if (f.minTrust !== undefined && labelTrustRank(record.labelTrust) < labelTrustRank(f.minTrust)) {\n    return false\n  }\n  return true\n}\n\nfunction sha256(input: string): string {\n  return createHash('sha256').update(input).digest('hex').slice(0, 16)\n}\n\nfunction appendLine(path: string, line: string): void {\n  if (existsSync(path)) {\n    const existing = readFileSync(path, 'utf8')\n    writeFileSync(path, existing + line)\n  } else {\n    writeFileSync(path, line)\n  }\n}\n","/**\n * @module\n * Footprint-matched neutralization — the placebo control for content-vs-footprint\n * attribution in a promotion gate.\n *\n * A promoted surface can raise a held-out score two different ways:\n *  1. its CONTENT is informative (the thing we want to promote), or\n *  2. it merely added prompt/mount FOOTPRINT — more bytes, more lines, a longer\n *     more authoritative-looking prompt — that the model spends attention on\n *     regardless of what the bytes say.\n *\n * A held-out gate proves the candidate beat baseline; it cannot separate (1) from\n * (2). `neutralizeText` produces a variant that keeps the input's layout and\n * length while carrying ZERO information, so scoring it isolates the footprint\n * contribution (2). Feed the neutralized variant's scores to `neutralizationGate`:\n * any lift it still holds over baseline is decorative, and a candidate whose lift\n * survives neutralization is rejected however large its raw lift.\n */\n\n/** Filler for blanked content. A single ASCII byte, so a run of it preserves an\n *  ASCII source's exact byte length; for multibyte sources it preserves CHARACTER\n *  count and layout (what the tokenizer footprint tracks), not raw byte count. */\nconst FILLER = '#'\n\n/**\n * Blank every non-whitespace character to a 1-byte filler while preserving all\n * whitespace. Line count, indentation, and word/line lengths are unchanged — so\n * the neutralized variant has the same layout and (for ASCII) the same byte\n * footprint as the input, but no readable content. Whitespace is preserved\n * deliberately: collapsing it would change the token structure and stop the\n * variant from being a true footprint match.\n */\nexport function neutralizeText(content: string): string {\n  return content.replace(/\\S/g, FILLER)\n}\n","/**\n * Parent selection for `runOptimization`.\n *\n * Each generation mutates one parent surface. The default parent is the\n * global incumbent, so the search is a hill-climb and the lineage recorded in\n * `GenerationCandidate.parentSurfaceHash` is a chain. A `ParentSelector` draws\n * the parent from the Pareto frontier instead, so the recorded lineage becomes\n * a tree. Promotion is unchanged: a candidate still has to beat the incumbent.\n */\n\nimport { type Objective, paretoFrontierWithCrowding } from '../pareto'\nimport { mulberry32 } from '../statistics/random'\nimport type { GenerationRecord, ParetoParent, ScoredSurfaceOutcome } from './types'\n\n/** Search state supplied to one parent-selection call. */\nexport interface ParentSelectionContext {\n  /** Non-dominated scored surfaces across the whole run so far, including the\n   *  baseline (`generation: -1`). Never empty. */\n  readonly frontier: ReadonlyArray<ParetoParent>\n  /** Measured result of the global incumbent, the promotion bar. Under the\n   *  default `selectionRankKey` the incumbent is always on `frontier`. */\n  readonly incumbent: ScoredSurfaceOutcome\n  /** Every completed generation so far. */\n  readonly history: ReadonlyArray<GenerationRecord>\n  /** Index of the generation about to propose. */\n  readonly generation: number\n}\n\n/** Chooses the surface the next generation mutates. Returns one frontier\n *  parent; `runOptimization` refuses a parent it has not measured to\n *  completion or whose surface does not match its `surfaceHash`. */\nexport type ParentSelector = (ctx: ParentSelectionContext) => ParetoParent\n\nexport interface CrowdedFrontierParentOptions {\n  /** Integer seed for the per-generation draw. The same seed, frontier, and\n   *  generation index select the same parent. */\n  seed: number\n}\n\n/**\n * NSGA-II crowded tournament selection over the frontier. Each generation\n * draws two distinct frontier members with a PRNG seeded from `seed` and the\n * generation index, and keeps the one with the larger crowding distance (more\n * isolated on the frontier). Boundary parents carry infinite distance, so a\n * boundary parent always beats an interior one. A tie on distance falls back\n * to the higher mean composite, then to the smaller surface hash. A frontier\n * of one member returns that member.\n */\nexport function crowdedFrontierParent(options: CrowdedFrontierParentOptions): ParentSelector {\n  const { seed } = options\n  if (!Number.isInteger(seed)) {\n    throw new TypeError(`crowdedFrontierParent: seed must be an integer, got ${String(seed)}`)\n  }\n  return ({ frontier, generation }) => {\n    if (frontier.length === 0) {\n      throw new Error('crowdedFrontierParent: frontier is empty')\n    }\n    if (frontier.length === 1) return frontier[0]!\n    const distances = new Map<ParetoParent, number>()\n    for (const { candidate, distance } of paretoFrontierWithCrowding(\n      [...frontier],\n      frontierObjectives(frontier),\n    )) {\n      distances.set(candidate, distance)\n    }\n    const rng = mulberry32(tournamentSeed(seed, generation))\n    const first = Math.floor(rng() * frontier.length)\n    const offset = Math.floor(rng() * (frontier.length - 1))\n    const second = offset >= first ? offset + 1 : offset\n    const a = frontier[first]!\n    const b = frontier[second]!\n    return compareCrowded(a, distanceOf(distances, a), b, distanceOf(distances, b)) <= 0 ? a : b\n  }\n}\n\nfunction distanceOf(distances: ReadonlyMap<ParetoParent, number>, parent: ParetoParent): number {\n  const distance = distances.get(parent)\n  if (distance === undefined) {\n    throw new Error(\n      `crowdedFrontierParent: frontier member \"${parent.surfaceHash}\" is dominated or has a non-finite objective`,\n    )\n  }\n  return distance\n}\n\n/** Negative when `a` wins the tournament, positive when `b` wins. */\nfunction compareCrowded(a: ParetoParent, da: number, b: ParetoParent, db: number): number {\n  if (da !== db) return da > db ? -1 : 1\n  if (a.composite !== b.composite) return a.composite > b.composite ? -1 : 1\n  if (a.surfaceHash === b.surfaceHash) return 0\n  return a.surfaceHash < b.surfaceHash ? -1 : 1\n}\n\n/** One `maximize` objective per scenario id present on the frontier. */\nfunction frontierObjectives(frontier: ReadonlyArray<ParetoParent>): Objective<ParetoParent>[] {\n  const ids = new Set<string>()\n  for (const parent of frontier) for (const id of Object.keys(parent.objectives)) ids.add(id)\n  if (ids.size === 0) {\n    throw new Error('crowdedFrontierParent: frontier parents carry no objectives')\n  }\n  return [...ids].sort().map((id) => ({\n    name: id,\n    direction: 'maximize',\n    value: (parent) => {\n      const value = parent.objectives[id]\n      if (typeof value !== 'number' || !Number.isFinite(value)) {\n        throw new Error(\n          `crowdedFrontierParent: frontier member \"${parent.surfaceHash}\" has no finite objective \"${id}\"`,\n        )\n      }\n      return value\n    },\n  }))\n}\n\nfunction tournamentSeed(seed: number, generation: number): number {\n  return (seed ^ Math.imul(generation + 1, 0x9e3779b1)) | 0\n}\n","/**\n * Product-flow playback — drive the REAL product through a user story and\n * score the produced state per requirement (the launch \"Jira tick-off\").\n *\n * This is the substrate adapter + contract only. It plugs a `PlaybackDriver`\n * into the existing `runProfileMatrix` dispatch seam: a driver drives the real\n * product (a Playwright UI session or a sandbox workspace) and returns the\n * runtime event stream; `extractProducedState` + `verifyCompletion` then score\n * each requirement PASS/FAIL. The concrete drivers live in consumers — they\n * depend on browser / runtime infra the substrate must not import — so\n * agent-eval owns the seam, the `UserStory` contract, and the scoreboard.\n */\n\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport {\n  type CompletionRequirement,\n  type CompletionVerdict,\n  type CorrectnessChecker,\n  type ProducedState,\n  verifyCompletion,\n} from '../../completion-verifier'\nimport { extractProducedState, type RuntimeEventLike } from '../../produced-state'\nimport type { DispatchContext, Scenario } from '../types'\nimport type { ProfileDispatchFn } from './run-profile-matrix'\n\n/** One step of a user story — what the user does. The driver interprets\n *  `payload` (a Playwright selector + action, or a sandbox chat turn). */\nexport interface PlaybackStep {\n  /** Human-readable action, captured verbatim in the UX narrative. */\n  action: string\n  /** Driver-specific payload (e.g. `{ selector, fill }` or `{ turn }`). */\n  payload?: Record<string, unknown>\n}\n\n/**\n * A user story = a runnable product journey plus the requirements that define\n * \"this story works\". Each requirement is one Jira ticket line. Extends\n * `Scenario` so a catalog drops straight into `runProfileMatrix({ scenarios })`.\n */\nexport interface UserStory extends Scenario {\n  /** Human-readable story title (the ticket headline). */\n  title: string\n  /** Ordered steps the driver executes. */\n  steps: PlaybackStep[]\n  /** What must hold in the produced state for the story to pass. */\n  requirements: CompletionRequirement[]\n}\n\n/** Dispatch context plus the profile under test (which cheap model, etc.). */\nexport interface PlaybackContext extends DispatchContext {\n  profile: AgentProfile\n}\n\n/**\n * Drives the real product through a story and returns the runtime event stream\n * `extractProducedState` consumes. Implemented by CONSUMERS —\n * `SandboxPlaybackDriver` (real API / sandbox workspace) and\n * `PlaywrightPlaybackDriver` (real UI) — because they depend on runtime /\n * browser infra the substrate must not import. The driver MUST report LLM\n * usage through `ctx.cost.runPaidCall` so the backend-integrity check sees real\n * tokens (a run that never reports tokens reads as a stub).\n */\nexport interface PlaybackDriver<TStory extends UserStory = UserStory> {\n  run(story: TStory, ctx: PlaybackContext): Promise<readonly RuntimeEventLike[]>\n}\n\n/**\n * Adapt a `PlaybackDriver` into a `runProfileMatrix` dispatch. The artifact the\n * matrix scores is the `ProducedState` extracted from the driver's event\n * stream — grade it with `scoreUserStory` (or a judge wrapping it).\n */\nexport function makePlaybackDispatch<TStory extends UserStory>(\n  driver: PlaybackDriver<TStory>,\n): ProfileDispatchFn<TStory, ProducedState> {\n  return async (profile, scenario, ctx) => {\n    const events = await driver.run(scenario, { ...ctx, profile })\n    return extractProducedState(events)\n  }\n}\n\n/** A scored user story — the completion verdict plus its human title. */\nexport interface UserStoryVerdict extends CompletionVerdict {\n  title: string\n}\n\n/**\n * Score one story's produced state against its requirements. Thin wrapper over\n * `verifyCompletion` that builds the gold from the story and returns a\n * per-requirement PASS/FAIL verdict. `checkCorrectness` is injected — a\n * deterministic stub in tests, `createLlmCorrectnessChecker` in production.\n */\nexport async function scoreUserStory(\n  story: UserStory,\n  state: ProducedState,\n  checkCorrectness: CorrectnessChecker,\n): Promise<UserStoryVerdict> {\n  const verdict = await verifyCompletion(\n    { taskId: story.id, requirements: story.requirements },\n    state,\n    checkCorrectness,\n  )\n  return { ...verdict, title: story.title }\n}\n\n/** One row of the launch scoreboard — story × requirement → PASS/FAIL. */\nexport interface ScoreboardRow {\n  storyId: string\n  storyTitle: string\n  reqId: string\n  reqTitle: string\n  status: 'PASS' | 'FAIL'\n  evidence: string[]\n}\n\n/**\n * Flatten story verdicts into the per-requirement scoreboard — the literal\n * Jira tick-off: one row per (story, requirement) with PASS/FAIL and the\n * evidence behind the verdict.\n */\nexport function userStoryScoreboard(verdicts: readonly UserStoryVerdict[]): ScoreboardRow[] {\n  const rows: ScoreboardRow[] = []\n  for (const v of verdicts) {\n    for (const r of v.requirements) {\n      rows.push({\n        storyId: v.taskId,\n        storyTitle: v.title,\n        reqId: r.reqId,\n        reqTitle: r.title,\n        status: r.satisfied ? 'PASS' : 'FAIL',\n        evidence: r.evidence,\n      })\n    }\n  }\n  return rows\n}\n\n/** Launch-readiness headline counts rolled up from the per-requirement rows. */\nexport interface ScoreboardSummary {\n  /** Distinct user stories on the board. */\n  stories: number\n  /** Stories whose every requirement passed. */\n  storiesFullyComplete: number\n  /** Total (story, requirement) rows. */\n  requirements: number\n  /** Rows with status PASS. */\n  passed: number\n  /** Rows with status FAIL. */\n  failed: number\n  /** passed / requirements; 0 when there are no rows. */\n  passRate: number\n}\n\n/** Roll the per-requirement rows up into the launch headline counts. */\nexport function scoreboardSummary(rows: readonly ScoreboardRow[]): ScoreboardSummary {\n  const byStory = new Map<string, { total: number; passed: number }>()\n  let passed = 0\n  for (const r of rows) {\n    const s = byStory.get(r.storyId) ?? { total: 0, passed: 0 }\n    s.total++\n    if (r.status === 'PASS') {\n      s.passed++\n      passed++\n    }\n    byStory.set(r.storyId, s)\n  }\n  let storiesFullyComplete = 0\n  for (const s of byStory.values()) if (s.total > 0 && s.passed === s.total) storiesFullyComplete++\n  return {\n    stories: byStory.size,\n    storiesFullyComplete,\n    requirements: rows.length,\n    passed,\n    failed: rows.length - passed,\n    passRate: rows.length === 0 ? 0 : passed / rows.length,\n  }\n}\n\nexport interface ScoreboardRenderOptions {\n  /** Document H1. Defaults to a generic playback title. */\n  title?: string\n  /** Key/value run metadata rendered under the headline (runId, backend, model, date). */\n  meta?: Record<string, string>\n  /** Max chars of joined evidence shown per row. Default 160. */\n  maxEvidenceChars?: number\n}\n\nfunction escapeCell(s: string): string {\n  return s.replace(/\\|/g, '\\\\|').replace(/\\r?\\n/g, ' ')\n}\n\nfunction truncate(s: string, max: number): string {\n  return s.length <= max ? s : `${s.slice(0, Math.max(0, max - 1))}…`\n}\n\n/**\n * Render the scoreboard as a launch-readiness Markdown document — the literal\n * \"tick off every user story\" artifact: a headline roll-up, the open tickets\n * (FAIL rows) up top as the launch blockers, then a per-story table of\n * requirement → PASS/FAIL with the evidence behind each verdict. Pure: same\n * rows in, same bytes out (no clock/random), so it is safe to snapshot.\n */\nexport function renderScoreboardMarkdown(\n  rows: readonly ScoreboardRow[],\n  opts: ScoreboardRenderOptions = {},\n): string {\n  const maxEv = opts.maxEvidenceChars ?? 160\n  const sum = scoreboardSummary(rows)\n  const pct = (n: number) => `${Math.round(n * 100)}%`\n  const ev = (e: string[]) => escapeCell(truncate(e.join('; '), maxEv)) || '—'\n  const out: string[] = [`# ${opts.title ?? 'Product-flow playback scoreboard'}`, '']\n  if (opts.meta) {\n    for (const [k, v] of Object.entries(opts.meta)) out.push(`- **${k}:** ${v}`)\n    out.push('')\n  }\n  out.push(\n    `**${sum.storiesFullyComplete}/${sum.stories}** user stories fully shipped · ` +\n      `**${sum.passed}/${sum.requirements}** requirements passing (${pct(sum.passRate)}) · ` +\n      `**${sum.failed}** open`,\n    '',\n  )\n  const fails = rows.filter((r) => r.status === 'FAIL')\n  if (fails.length > 0) {\n    out.push('## Open tickets', '', '| Story | Requirement | Evidence |', '| --- | --- | --- |')\n    for (const r of fails) {\n      out.push(`| ${escapeCell(r.storyTitle)} | ${escapeCell(r.reqTitle)} | ${ev(r.evidence)} |`)\n    }\n    out.push('')\n  } else {\n    out.push('_All requirements passing — no open tickets._', '')\n  }\n  out.push('## Per-story tick-off', '')\n  for (const storyId of [...new Set(rows.map((r) => r.storyId))]) {\n    const storyRows = rows.filter((r) => r.storyId === storyId)\n    const passed = storyRows.filter((r) => r.status === 'PASS').length\n    const mark = passed === storyRows.length ? '✅' : '⚠️'\n    out.push(\n      `### ${escapeCell(storyRows[0]!.storyTitle)} — ${passed}/${storyRows.length} ${mark}`,\n      '',\n      '| Requirement | Status | Evidence |',\n      '| --- | --- | --- |',\n    )\n    for (const r of storyRows) {\n      out.push(\n        `| ${escapeCell(r.reqTitle)} | ${r.status === 'PASS' ? '✅ PASS' : '❌ FAIL'} | ${ev(r.evidence)} |`,\n      )\n    }\n    out.push('')\n  }\n  return out.join('\\n')\n}\n","/**\n * `runProfileMatrix` — the missing keystone between `runAgentMatrix` and the\n * backend-integrity guard.\n *\n * The gap it closes: `runAgentMatrix` is a topology-opaque scheduler whose\n * cells return a bare `{ output, verdict, costUsd }` — no `tokenUsage`, not a\n * `RunRecord`. `assertRealBackend` / `summarizeBackendIntegrity` key on\n * `RunRecord.tokenUsage`, so they cannot run on a raw matrix result. Every\n * consumer therefore hand-writes the same bridge: fan a profile × scenario\n * cartesian, call dispatch, fabricate a `RunRecord` with token usage, thread it\n * back, run the integrity guard. That hand-rolled bridge is exactly the pile of\n * bespoke `eval:*` scripts the adoption skills keep trying (and failing) to\n * forbid.\n *\n * `runProfileMatrix` IS that bridge, once:\n *\n *   - axis 3 (PROFILE) = `profiles: AgentProfile[]`\n *   - axis 1 (PERSONA/SCENARIO) = `scenarios: Scenario[]` (each scenario carries\n *     its persona; `personaOf` groups them for the `byPersona` pivot)\n *   - the scoring axis = `judges`\n *\n * It runs `runCampaign` once per profile (reusing its seeds, reps, bootstrap\n * CIs, resumability, and the `LabeledScenarioStore` capture flywheel), maps\n * every cell to a validated `RunRecord` carrying the real `tokenUsage` the\n * dispatch committed via `ctx.cost.runPaidCall`, and runs `assertRealBackend`\n * BY CONSTRUCTION before returning — so a stub-backend run fails loudly instead\n * of reporting a clean 0/N leaderboard.\n *\n * Dispatch contract: a dispatch that calls an LLM MUST report usage via\n * `ctx.cost.runPaidCall({ execute, receipt })`.\n * A dispatch that reports zero tokens is indistinguishable from a stub and the\n * integrity guard treats it as one.\n */\n\nimport { createHash } from 'node:crypto'\nimport { join } from 'node:path'\nimport {\n  type AgentProfile,\n  agentProfileHash,\n  agentProfileId,\n  agentProfileModelId,\n  HARNESS_NATIVE_MODEL,\n  harnessAxisOf,\n} from '../../agent-profile'\nimport { type AgentProfileCell, buildAgentProfileCell } from '../../agent-profile-cell'\nimport { mapConcurrent } from '../../concurrency'\nimport type { CostProvenance } from '../../cost-ledger'\nimport { AgentEvalError } from '../../errors'\nimport {\n  assertRealBackend,\n  type BackendIntegrityReport,\n  summarizeBackendIntegrity,\n} from '../../integrity/backend-integrity'\nimport {\n  modelHasSnapshot,\n  type RunRecord,\n  type RunSplitTag,\n  runTaskScore,\n  UNKNOWN_MODEL,\n  validateRunRecord,\n} from '../../run-record'\nimport { computeManifestHash } from '../campaign-manifest'\nimport { runCampaign } from '../run-campaign'\nimport { campaignCellToRunRecord } from '../run-record'\nimport type { CampaignStorage } from '../storage'\nimport type {\n  CampaignCellResult,\n  CampaignResult,\n  DispatchContext,\n  JudgeConfig,\n  LabeledScenarioSource,\n  LabeledScenarioStore,\n  Scenario,\n} from '../types'\n\n/** Thrown when the matrix is misconfigured (no profiles, missing resolved model evidence,\n *  etc.). Distinct from `BackendIntegrityError`,\n *  which signals a stub backend at run time. */\nexport class ProfileMatrixError extends AgentEvalError {\n  constructor(message: string) {\n    super('profile_matrix', message)\n  }\n}\n\n/** Dispatch for one cell: render `profile` against `scenario`, returning the\n *  artifact the judges score. Run LLM work through `ctx.cost.runPaidCall` —\n *  the integrity check depends on its receipt. */\nexport type ProfileDispatchFn<TScenario extends Scenario, TArtifact> = (\n  profile: AgentProfile,\n  scenario: TScenario,\n  ctx: DispatchContext,\n) => Promise<TArtifact>\n\nexport interface RunProfileMatrixOptions<TScenario extends Scenario, TArtifact> {\n  /** Axis 3 — the agent-under-test configurations. Each is one column. */\n  profiles: AgentProfile[]\n  /** Axis 1 — the persona/scenario corpus, run against every profile. */\n  scenarios: TScenario[]\n  /** Renders one (profile, scenario) cell. */\n  dispatch: ProfileDispatchFn<TScenario, TArtifact>\n  /** The scoring axis. */\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** Where each profile's campaign writes artifacts/traces. One subdir per\n   *  profile. */\n  runDir: string\n  /** Git SHA the harness ran from — stamped onto every RunRecord (mandatory\n   *  for paper-grade records). */\n  commitSha: string\n  /** Additional stable identity for dispatch behavior that can change without\n   *  changing `commitSha`, such as a caller-owned executable or remote config. */\n  dispatchRef?: string\n  /** Logical experiment id shared across the whole matrix so the promotion\n   *  gate can pair profiles on matched scenarios. Default: a hash of the\n   *  profile + scenario ids. */\n  experimentId?: string\n  /** Which split these runs belong to. Default `'search'`. */\n  splitTag?: RunSplitTag\n  /** Replicates per (profile, scenario) cell for CI bands. Default 1. */\n  reps?: number\n  /** Campaign seed (per profile). Default 42. */\n  seed?: number\n  /**\n   * Backend-integrity posture, enforced AFTER the matrix completes:\n   *   - `'assert'` (default) — throw `BackendIntegrityError` if the run was a\n   *     stub (and, with `allowMixed:false`, if it was mixed).\n   *   - `'warn'` — log the verdict but never throw.\n   *   - `'off'` — skip the guard entirely (only for offline/replay analysis).\n   */\n  integrity?: 'assert' | 'warn' | 'off'\n  /** Forwarded to `assertRealBackend`. Default true (tolerate partial 429\n   *  cascades); set false for strict CI gates. */\n  allowMixed?: boolean\n  /** Max concurrent cells WITHIN each profile's campaign. Default 2. */\n  maxConcurrency?: number\n  /** Max profile campaigns in flight. Default 1. Each profile keeps its own\n   *  run directory and cost ceiling; raise this when those resources are independent. */\n  maxProfileConcurrency?: number\n  /** Cumulative USD cap per profile campaign. */\n  costCeiling?: number\n  /** Capture flywheel — forwarded to each campaign. */\n  labeledStore?: LabeledScenarioStore | 'off'\n  captureSource?: LabeledScenarioSource\n  /** Storage backend. Default `fsCampaignStorage`. Pass\n   *  `inMemoryCampaignStorage()` for edge/CF-Worker/test runs. */\n  storage?: CampaignStorage\n  /** Test seam — override the wall clock. */\n  now?: () => Date\n  /** Optional persona key per scenario — drives the `byPersona` pivot. When\n   *  unset, `byPersona` is omitted. */\n  personaOf?: (scenario: TScenario) => string\n  /** Validate every produced RunRecord with `validateRunRecord` (fail-loud).\n   *  Default true — catches bad model snapshots and non-finite judge dims at\n   *  the boundary instead of letting them poison downstream analysis. */\n  validate?: boolean\n  /** Corpus-by-default: derive the trajectory text (`prompt` + `completion`)\n   *  for each cell from its artifact + scenario. When set, every produced\n   *  record carries `prompt`/`completion` (a `CorpusRecord`) so the run's\n   *  graded trajectories can be appended to the durable RL corpus with no\n   *  side-channel — `appendToCorpus(result.records, path)`. Fail-soft: a\n   *  throwing or undefined-returning extractor just omits the text. */\n  corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n  /**\n   * Optional explicit row selection. The matrix identity remains based on the\n   * complete profiles × scenarios × reps design; this invocation executes only\n   * rows accepted by the predicate.\n   */\n  rowFilter?: (input: { profile: AgentProfile; scenario: TScenario; rep: number }) => boolean\n  /** Stable matrix identity supplied by a persisted profile-matrix plan. */\n  matrixId?: string\n  /** Reuse cached failed cells. Normal matrix runs retry them by default. */\n  reuseFailedCells?: boolean\n}\n\nexport interface ProfileSummary {\n  profileId: string\n  profileHash: string\n  model: string\n  /** RunRecords produced for this profile (= scenarios × reps). */\n  records: number\n  /** Mean across scored records, or null when the profile has no task labels. */\n  meanComposite: number | null\n  /** Total cost, or null when any call's cost was not captured. */\n  totalCostUsd: number | null\n  costProvenance: CostProvenance\n  /** Per-profile integrity verdict — surfaces a single profile that ran stub\n   *  even when the matrix as a whole looks real. */\n  integrity: BackendIntegrityReport\n}\n\nexport interface ScenarioRollup {\n  meanComposite: number\n  n: number\n}\n\nexport interface RunProfileMatrixResult<TArtifact, TScenario extends Scenario> {\n  matrixId: string\n  experimentId: string\n  /** One RunRecord per (profile, scenario, rep) cell — the integrity-checked,\n   *  paper-grade output. Feed straight into `analyzeRuns`, `HeldOutGate`,\n   *  scorecards, the hosted wire format. */\n  records: RunRecord[]\n  byProfile: Record<string, ProfileSummary>\n  byScenario: Record<string, ScenarioRollup>\n  /** Present only when `personaOf` was supplied. */\n  byPersona?: Record<string, ScenarioRollup>\n  /** Whole-matrix integrity report (the one `integrity:'assert'` enforces). */\n  integrity: BackendIntegrityReport\n  /** The raw per-profile campaign results, keyed by profile id. */\n  campaigns: Record<string, CampaignResult<TArtifact, TScenario>>\n}\n\n/**\n * Return the exact per-profile campaign identity used by `runProfileMatrix`.\n * Segmented profile matrices use this to validate durable cell caches before\n * finalization without dispatching a probe request.\n */\nexport function profileMatrixCampaignIdentity<TScenario extends Scenario, TArtifact>(opts: {\n  profile: AgentProfile\n  scenarios: TScenario[]\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  commitSha: string\n  dispatchRef?: string\n  splitTag?: RunSplitTag\n  seed?: number\n  reps?: number\n}): {\n  profileHash: string\n  profileId: string\n  configHash: string\n  dispatchRef: string\n  manifestHash: string\n} {\n  const seed = opts.seed ?? 42\n  const splitTag = opts.splitTag ?? 'search'\n  const reps = opts.reps ?? 1\n  const profileHash = agentProfileHash(opts.profile)\n  const profileId = agentProfileId(opts.profile)\n  const configHash = sha({\n    profile: profileHash,\n    judges: (opts.judges ?? []).map((judge) => judge.name),\n    seed,\n    splitTag,\n    dispatchRef: opts.dispatchRef ?? null,\n  })\n  const dispatchRef = `profile-matrix:${sha({\n    commitSha: opts.commitSha,\n    caller: opts.dispatchRef ?? null,\n    profileId,\n    profileHash,\n    configHash,\n  })}`\n  const manifestHash = computeManifestHash({\n    scenarios: opts.scenarios,\n    judges: (opts.judges ?? []) as unknown as JudgeConfig<unknown>[],\n    dispatchRef,\n    seed,\n    reps,\n  })\n  return { profileHash, profileId, configHash, dispatchRef, manifestHash }\n}\n\nfunction sanitize(id: string): string {\n  return id.replace(/[^a-zA-Z0-9_-]/g, '_')\n}\n\nfunction sha(input: unknown): string {\n  return createHash('sha256').update(JSON.stringify(input)).digest('hex')\n}\n\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\ninterface BuildRecordArgs<TScenario extends Scenario, TArtifact> {\n  cell: CampaignCellResult<TArtifact>\n  profile: AgentProfile\n  profileHash: string\n  configHash: string\n  experimentId: string\n  splitTag: RunSplitTag\n  commitSha: string\n  matrixId: string\n  /** The (profile, harness, model, dimensions) identity of this cell — attached to\n   *  every record so results group by the canonical `groupRunsByAgentProfileCell`\n   *  (harness/model aware) instead of profileId alone. */\n  agentProfileCell?: AgentProfileCell\n  scenario?: TScenario\n  corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n}\n\nfunction receiptModels(cell: CampaignCellResult<unknown>): string[] {\n  const reported = cell.resolvedModels ?? (cell.resolvedModel ? [cell.resolvedModel] : [])\n  return [...new Set(reported.map((model) => model.trim()).filter(Boolean))]\n}\n\nfunction isUnknownModelOnly(reported: string[]): boolean {\n  return reported.length > 0 && reported.every((model) => model === UNKNOWN_MODEL)\n}\n\n/** Resolve and validate every paid-call model used by one cell. */\nfunction recordModel(\n  cell: CampaignCellResult<unknown>,\n  profileId: string,\n  declaredModel: string,\n): string {\n  const reported = receiptModels(cell)\n  // A dispatch failure can happen before the provider returns any model\n  // identity. Preserve that failed row with an explicit absence marker; a\n  // failure must not be converted into a made-up snapshot or discarded.\n  // When a settled receipt exists, retain and validate its real identity.\n  if (cell.error !== undefined && (reported.length === 0 || isUnknownModelOnly(reported))) {\n    return UNKNOWN_MODEL\n  }\n  if (modelHasSnapshot(declaredModel)) {\n    for (const model of reported) {\n      if (model !== declaredModel) {\n        throw new ProfileMatrixError(\n          `profile '${profileId}' paid-call model '${model}' for cell '${cell.cellId}' does not match its declared exact model '${declaredModel}'`,\n        )\n      }\n    }\n    return declaredModel\n  }\n\n  if (reported.length === 0) {\n    throw new ProfileMatrixError(\n      `profile '${profileId}' declared a moving model but its dispatch reported no resolved model for cell '${cell.cellId}' — return a snapshot-bearing model in the ctx.cost.runPaidCall receipt`,\n    )\n  }\n  for (const model of reported) {\n    if (!modelHasSnapshot(model)) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' resolved to model '${model}' for cell '${cell.cellId}', which lacks a snapshot version — pin it in the paid-call receipt`,\n      )\n    }\n    if (declaredModel !== HARNESS_NATIVE_MODEL && !sameMovingModel(declaredModel, model)) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' declared model '${declaredModel}' but cell '${cell.cellId}' reported unrelated snapshot '${model}'`,\n      )\n    }\n  }\n  if (reported.length !== 1) {\n    throw new ProfileMatrixError(\n      `profile '${profileId}' cell '${cell.cellId}' reported multiple paid-call model snapshots: ${reported.join(', ')}`,\n    )\n  }\n  return reported[0]!\n}\n\nfunction sameMovingModel(declared: string, resolved: string): boolean {\n  const resolvedBase = resolved\n    .replace(/@[^/]+$/u, '')\n    .replace(/-\\d{8}$/u, '')\n    .replace(/-\\d{4}-\\d{2}-\\d{2}$/u, '')\n    .replace(/-\\d{4}$/u, '')\n    .replace(/:date-[^/]+$/u, '')\n  return (\n    resolvedBase === declared ||\n    resolvedBase.endsWith(`/${declared}`) ||\n    declared.endsWith(`/${resolvedBase}`)\n  )\n}\n\nfunction buildRunRecord<TScenario extends Scenario, TArtifact>(\n  args: BuildRecordArgs<TScenario, TArtifact>,\n): RunRecord {\n  const { cell, profile, profileHash, configHash, experimentId, splitTag, commitSha, matrixId } =\n    args\n  const profileId = agentProfileId(profile)\n  const declaredModel = agentProfileModelId(profile)\n  // Every successful record pins a snapshot. When a profile intentionally\n  // carries the provider-facing moving alias, the paid-call receipt supplies\n  // the immutable identity used here. Failed rows use explicit unknown data.\n  const model = recordModel(cell, profileId, declaredModel)\n  const durableCell = durableCellForRecord(cell)\n  const record = campaignCellToRunRecord(durableCell, {\n    runId: `${matrixId}:${profileId}:${cell.cellId}`,\n    experimentId,\n    candidateId: profileId,\n    model,\n    promptHash: profileHash,\n    configHash,\n    commitSha,\n    splitTag,\n    agentProfile: args.agentProfileCell,\n  }) as RunRecord & { prompt?: string; completion?: string }\n\n  // Corpus-by-default: stamp the trajectory text onto the record (CorpusRecord\n  // shape — the validator ignores the extra keys) so the run is dataset-able\n  // with no side-channel. Fail-soft: a bad extractor never fails the run.\n  if (args.corpusText && args.scenario) {\n    try {\n      const text = args.corpusText(cell.artifact, args.scenario)\n      if (text && typeof text.prompt === 'string' && typeof text.completion === 'string') {\n        record.prompt = text.prompt\n        record.completion = text.completion\n      }\n    } catch {\n      // extractor threw — omit trajectory text, keep the graded record.\n    }\n  }\n  return record\n}\n\n/**\n * Keep failed rows truthful at the RunRecord boundary.\n *\n * A cell with no settled call currently has a zero subtotal and an observed\n * zero from the ledger. That is not measured provider usage or cost, so mark\n * usage incomplete and cost uncaptured while retaining the known subtotal.\n */\nfunction durableCellForRecord<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n): CampaignCellResult<TArtifact> {\n  if (cell.error === undefined) return cell\n\n  const hasSettledAgentCalls = receiptModels(cell).some((model) => model !== UNKNOWN_MODEL)\n  return {\n    ...cell,\n    tokenUsage:\n      cell.tokenUsage.tokensKnown === false || hasSettledAgentCalls\n        ? cell.tokenUsage\n        : { ...cell.tokenUsage, tokensKnown: false },\n    costProvenance:\n      !hasSettledAgentCalls && cell.costProvenance.kind === 'observed' && cell.costUsd === 0\n        ? { kind: 'uncaptured', usd: null }\n        : cell.costProvenance,\n  }\n}\n\n/**\n * Profile × scenario matrix runner: fan N agent profiles across M scenarios, project each cell to a validated `RunRecord` with real token usage, and enforce the backend-integrity guard before returning.\n */\nexport async function runProfileMatrix<TScenario extends Scenario, TArtifact>(\n  opts: RunProfileMatrixOptions<TScenario, TArtifact>,\n): Promise<RunProfileMatrixResult<TArtifact, TScenario>> {\n  if (opts.profiles.length === 0) throw new ProfileMatrixError('profiles must not be empty')\n  if (opts.scenarios.length === 0) throw new ProfileMatrixError('scenarios must not be empty')\n\n  const splitTag = opts.splitTag ?? 'search'\n  const seed = opts.seed ?? 42\n  const validate = opts.validate ?? true\n  const integrityMode = opts.integrity ?? 'assert'\n  const maxProfileConcurrency = opts.maxProfileConcurrency ?? 1\n  const profileIds = opts.profiles.map(agentProfileId)\n  if (opts.dispatchRef !== undefined && opts.dispatchRef.trim().length === 0) {\n    throw new ProfileMatrixError('dispatchRef must be a non-empty string when provided')\n  }\n  const duplicateProfileIds = profileIds.filter((id, index) => profileIds.indexOf(id) !== index)\n  if (duplicateProfileIds.length > 0) {\n    throw new ProfileMatrixError(\n      `duplicate agentProfileId values are not allowed: ${[...new Set(duplicateProfileIds)].join(', ')}`,\n    )\n  }\n  const experimentId =\n    opts.experimentId ??\n    `pm_${sha({ profileIds, scenarios: opts.scenarios.map((s) => s.id) }).slice(0, 16)}`\n  const derivedMatrixId = `mtx_${sha({\n    experimentId,\n    profileIds,\n    seed,\n    splitTag,\n    commitSha: opts.commitSha,\n    dispatchRef: opts.dispatchRef ?? null,\n  }).slice(0, 16)}`\n  const matrixId = opts.matrixId ?? derivedMatrixId\n  if (typeof matrixId !== 'string' || matrixId.trim().length === 0) {\n    throw new ProfileMatrixError('matrixId must be a non-empty string when provided')\n  }\n  // Scenario lookup for the corpus-text extractor (records carry trajectory text).\n  const scenarioById = new Map(opts.scenarios.map((s) => [s.id, s]))\n\n  // Preflight: every profile must hash and every static record field must validate before spend.\n  //\n  // A moving provider alias or `HARNESS_NATIVE_MODEL` cannot be a durable record identity.\n  // Probe it with a placeholder here so the remaining profile checks still run before spend;\n  // every completed cell must later supply its actual snapshot in the paid-call receipt.\n  for (const profile of opts.profiles) {\n    const profileHash = agentProfileHash(profile)\n    const profileId = agentProfileId(profile)\n    const declaredModel = agentProfileModelId(profile)\n    const model = modelHasSnapshot(declaredModel)\n      ? declaredModel\n      : `${declaredModel}@runtime-resolved`\n    try {\n      validateRunRecord({\n        runId: `${matrixId}:${profileId}:probe`,\n        experimentId,\n        candidateId: profileId,\n        seed,\n        model,\n        promptHash: profileHash,\n        configHash: profileHash,\n        commitSha: opts.commitSha,\n        wallMs: 0,\n        costUsd: null,\n        costProvenance: { kind: 'uncaptured', usd: null },\n        tokenUsage: { input: 0, output: 0 },\n        terminalOutcome: 'succeeded',\n        outcome: { raw: { execution_error_count: 0 } },\n        splitTag,\n        scenarioId: 'recordability-probe',\n      })\n    } catch (err) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' is not recordable: ${err instanceof Error ? err.message : String(err)}`,\n      )\n    }\n  }\n\n  const records: RunRecord[] = []\n  const campaigns: Record<string, CampaignResult<TArtifact, TScenario>> = {}\n  const byProfile: Record<string, ProfileSummary> = {}\n\n  const columns = await mapConcurrent(\n    opts.profiles,\n    maxProfileConcurrency,\n    async (profile, _index, signal) => {\n      const identity = profileMatrixCampaignIdentity({\n        profile,\n        scenarios: opts.scenarios,\n        judges: opts.judges,\n        commitSha: opts.commitSha,\n        dispatchRef: opts.dispatchRef,\n        splitTag,\n        seed,\n        reps: opts.reps,\n      })\n      const { profileHash, profileId, configHash, dispatchRef } = identity\n      const declaredModel = agentProfileModelId(profile)\n\n      // Bind the profile into a campaign dispatch. Name it so the campaign's\n      // manifest hash is stable + distinct per profile.\n      const dispatch = (scenario: TScenario, ctx: DispatchContext): Promise<TArtifact> =>\n        opts.dispatch(profile, scenario, ctx)\n      Object.defineProperty(dispatch, 'name', { value: `profile_${sanitize(profileId)}` })\n\n      const campaign = await runCampaign<TScenario, TArtifact>({\n        scenarios: opts.scenarios,\n        dispatch,\n        dispatchRef,\n        signal,\n        judges: opts.judges,\n        seed,\n        reps: opts.reps,\n        maxConcurrency: opts.maxConcurrency,\n        costCeiling: opts.costCeiling,\n        cellFilter: opts.rowFilter\n          ? ({ scenario, rep }) => opts.rowFilter?.({ profile, scenario, rep }) ?? false\n          : undefined,\n        reuseFailedCells: opts.reuseFailedCells,\n        labeledStore: opts.labeledStore,\n        captureSource: opts.captureSource,\n        storage: opts.storage,\n        now: opts.now,\n        runDir: join(opts.runDir, sanitize(profileId)),\n      })\n\n      // The canonical (profile, harness, model) identity for every record in this\n      // column, so results group by `groupRunsByAgentProfileCell` (harness/model\n      // aware). Harness comes from the axis stamp `expandProfileAxes` left on the\n      // profile; a profile that wasn't axis-expanded simply has no harness in its\n      // cell (unchanged grouping). A moving model alias means the cell identity\n      // must carry the resolved snapshot per cell (surfaced via\n      // `cell.resolvedModels`), so the pivot groups by the model that actually ran and\n      // the cell identity matches the RunRecord's pinned model.\n      const axis = harnessAxisOf(profile)\n      const buildCellIdentity = (cellModel?: string): Promise<AgentProfileCell> =>\n        buildAgentProfileCell({\n          profileId,\n          sourceProfile: { kind: 'agent-interface-profile', hash: profileHash },\n          ...(cellModel && cellModel !== UNKNOWN_MODEL ? { model: cellModel } : {}),\n          ...(axis ? { harness: { id: axis.harness } } : {}),\n        })\n      // A profile with a pinned declared model builds its cell identity once and\n      // shares it; a moving alias builds one per cell after resolution.\n      const sharedCellIdentity = modelHasSnapshot(declaredModel)\n        ? await buildCellIdentity(declaredModel)\n        : undefined\n\n      const profileRecords: RunRecord[] = []\n      for (const cell of campaign.cells) {\n        const cellModel = recordModel(cell, profileId, declaredModel)\n        const agentProfileCell =\n          cellModel === UNKNOWN_MODEL\n            ? await buildCellIdentity()\n            : (sharedCellIdentity ?? (await buildCellIdentity(cellModel)))\n        const record = buildRunRecord({\n          cell,\n          profile,\n          profileHash,\n          configHash,\n          experimentId,\n          splitTag,\n          commitSha: opts.commitSha,\n          matrixId,\n          agentProfileCell,\n          scenario: scenarioById.get(cell.scenarioId),\n          corpusText: opts.corpusText,\n        })\n        if (validate) validateRunRecord(record)\n        profileRecords.push(record)\n      }\n\n      const recordedModels = [\n        ...new Set(\n          profileRecords\n            .map((record) => record.model)\n            .filter((model): model is string => model !== UNKNOWN_MODEL),\n        ),\n      ]\n      if (recordedModels.length > 1) {\n        throw new ProfileMatrixError(\n          `profile '${profileId}' resolved to multiple model snapshots: ${recordedModels.join(', ')}`,\n        )\n      }\n\n      const costProvenance = campaign.aggregates.cost.costProvenance\n      const totalCostUsd = costProvenance.kind === 'uncaptured' ? null : costProvenance.usd\n      return {\n        profileId,\n        campaign,\n        records: profileRecords,\n        summary: {\n          profileId,\n          profileHash,\n          model: recordedModels[0] ?? UNKNOWN_MODEL,\n          records: profileRecords.length,\n          meanComposite: meanOrNull(\n            profileRecords.map(scoreOf).filter((score): score is number => score !== undefined),\n          ),\n          totalCostUsd,\n          costProvenance,\n          integrity: summarizeBackendIntegrity(profileRecords),\n        },\n      }\n    },\n  )\n\n  // Merge in caller order so concurrency cannot change output or report ordering.\n  for (const column of columns) {\n    campaigns[column.profileId] = column.campaign\n    byProfile[column.profileId] = column.summary\n    records.push(...column.records)\n  }\n\n  // Integrity by construction — the whole point of the primitive.\n  const integrity = summarizeBackendIntegrity(records)\n  if (integrityMode === 'assert') {\n    assertRealBackend(records, { allowMixed: opts.allowMixed ?? true })\n  } else if (integrityMode === 'warn' && integrity.verdict !== 'real') {\n    // eslint-disable-next-line no-console\n    console.warn(\n      `[runProfileMatrix] backend integrity: ${integrity.verdict} — ${integrity.diagnosis}`,\n    )\n  }\n\n  // Pivots.\n  const byScenario = rollup(records, (r) => r.scenarioId)\n  const byPersona = opts.personaOf\n    ? rollupByPersona(records, opts.scenarios, opts.personaOf)\n    : undefined\n\n  return { matrixId, experimentId, records, byProfile, byScenario, byPersona, integrity, campaigns }\n}\n\n/** Score for a produced RunRecord, absent when the campaign cell was unscored.\n *  Ungated (`runTaskScore` is raw) — a matrix pivot reports measured scores;\n *  it is not a training input. */\nfunction scoreOf(r: RunRecord): number | undefined {\n  return runTaskScore(r)\n}\n\nfunction meanOrNull(values: number[]): number | null {\n  return values.length === 0 ? null : mean(values)\n}\n\nfunction rollup(\n  records: RunRecord[],\n  keyOf: (r: RunRecord) => string | undefined,\n): Record<string, ScenarioRollup> {\n  const groups = new Map<string, number[]>()\n  for (const r of records) {\n    const key = keyOf(r)\n    if (key === undefined) continue\n    const score = scoreOf(r)\n    if (score === undefined) continue\n    const arr = groups.get(key) ?? []\n    arr.push(score)\n    groups.set(key, arr)\n  }\n  const out: Record<string, ScenarioRollup> = {}\n  for (const [key, xs] of groups) out[key] = { meanComposite: mean(xs), n: xs.length }\n  return out\n}\n\nfunction rollupByPersona<TScenario extends Scenario>(\n  records: RunRecord[],\n  scenarios: TScenario[],\n  personaOf: (s: TScenario) => string,\n): Record<string, ScenarioRollup> {\n  const personaByScenarioId = new Map<string, string>()\n  for (const s of scenarios) personaByScenarioId.set(s.id, personaOf(s))\n  return rollup(records, (r) => (r.scenarioId ? personaByScenarioId.get(r.scenarioId) : undefined))\n}\n","/**\n * Eval-owned execution for profile matrices whose external authorization is\n * shorter than the complete matrix.\n *\n * A plan freezes the complete profile × scenario × replicate design. A\n * segment claims an explicit, disjoint set of rows and uses the campaign cell\n * cache as the durable per-cell record. Finalization first checks that every\n * planned row has one claim and one valid record, then replays the ordinary\n * `runProfileMatrix` projection from those records without dispatching work.\n */\n\nimport { dirname, join } from 'node:path'\nimport { type AgentProfile, agentProfileHash, agentProfileId } from '../../agent-profile'\nimport { canonicalJson, contentHash } from '../../verdict-cache'\nimport { cellCachePath } from '../cell-schedule'\nimport { assertCampaignDesign, campaignScenarioIdentity } from '../coverage'\nimport { resolveRunDir } from '../run-dir'\nimport { campaignCellCostProvenance, projectCampaignCellQuality } from '../run-record'\nimport type { CampaignStorage } from '../storage'\nimport { fsCampaignStorage } from '../storage'\nimport type { CampaignCellResult, JudgeConfig, Scenario } from '../types'\nimport {\n  type ProfileDispatchFn,\n  ProfileMatrixError,\n  profileMatrixCampaignIdentity,\n  type RunProfileMatrixOptions,\n  type RunProfileMatrixResult,\n  runProfileMatrix,\n} from './run-profile-matrix'\n\nconst PLAN_FILE = 'profile-matrix-plan.json'\nconst SEGMENTS_FILE = 'profile-matrix-segments.jsonl'\n\nclass SegmentedProfileMatrixError extends ProfileMatrixError {\n  constructor(message: string) {\n    super(`segmented matrix: ${message}`)\n  }\n}\n\nexport interface ProfileMatrixRow {\n  rowId: string\n  ordinal: number\n  profileId: string\n  scenarioId: string\n  rep: number\n}\n\nexport interface ProfileMatrixPlan<TScenario extends Scenario, TArtifact> {\n  readonly schemaVersion: 1\n  readonly matrixId: string\n  readonly experimentId: string\n  readonly planDigest: `sha256:${string}`\n  readonly profiles: readonly AgentProfile[]\n  readonly scenarios: readonly TScenario[]\n  readonly judges: readonly JudgeConfig<TArtifact, TScenario>[]\n  readonly reps: number\n  readonly seed: number\n  readonly splitTag: NonNullable<RunProfileMatrixOptions<TScenario, TArtifact>['splitTag']>\n  readonly commitSha: string\n  /** Stable dispatch implementation/configuration identity used by cell caches. */\n  readonly dispatchRef: string\n  readonly integrity: NonNullable<RunProfileMatrixOptions<TScenario, TArtifact>['integrity']>\n  readonly allowMixed: boolean\n  readonly validate: boolean\n  readonly personaOf?: (scenario: TScenario) => string\n  readonly corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n  readonly rows: readonly ProfileMatrixRow[]\n}\n\nexport interface CreateProfileMatrixPlanOptions<TScenario extends Scenario, TArtifact>\n  extends Pick<\n    RunProfileMatrixOptions<TScenario, TArtifact>,\n    | 'profiles'\n    | 'scenarios'\n    | 'judges'\n    | 'commitSha'\n    | 'experimentId'\n    | 'splitTag'\n    | 'reps'\n    | 'seed'\n    | 'integrity'\n    | 'allowMixed'\n    | 'validate'\n    | 'personaOf'\n    | 'corpusText'\n  > {\n  /** Stable dispatch implementation/configuration identity used by cell caches. */\n  dispatchRef: string\n}\n\nexport interface ProfileMatrixCoverage {\n  expected: number\n  present: number\n  missing: string[]\n  failed: string[]\n  zeroScore: string[]\n}\n\nexport interface RunProfileMatrixSegmentOptions<TScenario extends Scenario, TArtifact> {\n  plan: ProfileMatrixPlan<TScenario, TArtifact>\n  /** Stable external grant or attempt identity. Reuse it to resume. */\n  segmentId: string\n  /** Explicit row ids from `plan.rows`; duplicate or unknown rows fail. */\n  rows: readonly (string | ProfileMatrixRow)[]\n  dispatch: ProfileDispatchFn<TScenario, TArtifact>\n  runDir: string\n  storage?: CampaignStorage\n  maxConcurrency?: number\n  maxProfileConcurrency?: number\n  costCeiling?: number\n  labeledStore?: RunProfileMatrixOptions<TScenario, TArtifact>['labeledStore']\n  captureSource?: RunProfileMatrixOptions<TScenario, TArtifact>['captureSource']\n  now?: () => Date\n}\n\nexport interface ProfileMatrixSegmentResult<TArtifact, TScenario extends Scenario> {\n  segmentId: string\n  rowIds: string[]\n  matrix: RunProfileMatrixResult<TArtifact, TScenario>\n  coverage: ProfileMatrixCoverage\n}\n\nexport interface FinalizeProfileMatrixOptions<TScenario extends Scenario, TArtifact> {\n  plan: ProfileMatrixPlan<TScenario, TArtifact>\n  runDir: string\n  storage?: CampaignStorage\n  maxConcurrency?: number\n  maxProfileConcurrency?: number\n  now?: () => Date\n}\n\nexport interface FinalizedProfileMatrixResult<TArtifact, TScenario extends Scenario>\n  extends RunProfileMatrixResult<TArtifact, TScenario> {\n  coverage: ProfileMatrixCoverage\n}\n\nexport function createProfileMatrixPlan<TScenario extends Scenario, TArtifact>(\n  opts: CreateProfileMatrixPlanOptions<TScenario, TArtifact>,\n): ProfileMatrixPlan<TScenario, TArtifact> {\n  if (!Array.isArray(opts.profiles) || opts.profiles.length === 0) {\n    throw new SegmentedProfileMatrixError('profiles must not be empty')\n  }\n  if (!Array.isArray(opts.scenarios) || opts.scenarios.length === 0) {\n    throw new SegmentedProfileMatrixError('scenarios must not be empty')\n  }\n  const reps = opts.reps ?? 1\n  const seed = opts.seed ?? 42\n  const splitTag = opts.splitTag ?? 'search'\n  const integrity = opts.integrity ?? 'assert'\n  const allowMixed = opts.allowMixed ?? true\n  const validate = opts.validate ?? true\n  if (typeof opts.commitSha !== 'string' || opts.commitSha.trim().length === 0) {\n    throw new SegmentedProfileMatrixError('commitSha must be a non-empty string')\n  }\n  if (typeof opts.dispatchRef !== 'string' || opts.dispatchRef.trim().length === 0) {\n    throw new SegmentedProfileMatrixError(\n      'dispatchRef must be a non-empty stable identity for segmented execution',\n    )\n  }\n  assertCampaignDesign(opts.scenarios, reps)\n\n  const profiles = [...opts.profiles]\n  const scenarios = [...opts.scenarios]\n  const judges = [...(opts.judges ?? [])]\n  const profileIds = profiles.map(agentProfileId)\n  const duplicateProfiles = profileIds.filter((id, index) => profileIds.indexOf(id) !== index)\n  if (duplicateProfiles.length > 0) {\n    throw new SegmentedProfileMatrixError(\n      `duplicate profile ids: ${[...new Set(duplicateProfiles)].join(', ')}`,\n    )\n  }\n\n  const experimentId =\n    opts.experimentId ??\n    `pm_${contentHash({ profileIds, scenarios: scenarios.map((scenario) => scenario.id) }).slice(0, 16)}`\n  if (experimentId.trim().length === 0) {\n    throw new SegmentedProfileMatrixError('experimentId must be non-empty')\n  }\n\n  const identityMaterial = {\n    schema: 'tangle.profile-matrix-plan.v1',\n    profiles: profiles.map((profile, index) => ({\n      ordinal: index,\n      id: profileIds[index],\n      hash: `sha256:${agentProfileHash(profile)}`,\n      profile,\n    })),\n    scenarios: scenarios.map((scenario, index) => ({\n      ordinal: index,\n      identity: campaignScenarioIdentity(scenario),\n      scenario,\n    })),\n    judges: judges.map((judge) => ({\n      name: judge.name,\n      dimensions: judge.dimensions,\n      judgeVersion: judge.judgeVersion ?? null,\n      score: judge.score.toString(),\n      appliesTo: judge.appliesTo?.toString() ?? null,\n    })),\n    reps,\n    seed,\n    splitTag,\n    commitSha: opts.commitSha,\n    dispatchRef: opts.dispatchRef,\n    experimentId,\n    integrity,\n    allowMixed,\n    validate,\n    personaOf: opts.personaOf?.toString() ?? null,\n    corpusText: opts.corpusText?.toString() ?? null,\n  }\n  const planDigest = `sha256:${contentHash(identityMaterial)}` as const\n  const matrixId = `pmx_${planDigest.slice('sha256:'.length, 'sha256:'.length + 24)}`\n  const rows: ProfileMatrixRow[] = []\n  const seenCellIds = new Set<string>()\n  let ordinal = 0\n  for (const profileId of profileIds) {\n    for (const scenario of scenarios) {\n      for (let rep = 0; rep < reps; rep += 1) {\n        const cellId = `${scenario.id}:${rep}`\n        if (seenCellIds.has(`${profileId}:${cellId}`)) {\n          throw new SegmentedProfileMatrixError(\n            `profile/scenario/rep cell id collision for '${profileId}:${cellId}'`,\n          )\n        }\n        seenCellIds.add(`${profileId}:${cellId}`)\n        rows.push({\n          rowId: `row_${contentHash({ matrixId, profileId, scenarioId: scenario.id, rep }).slice(0, 24)}`,\n          ordinal,\n          profileId,\n          scenarioId: scenario.id,\n          rep,\n        })\n        ordinal += 1\n      }\n    }\n  }\n\n  return Object.freeze({\n    schemaVersion: 1,\n    matrixId,\n    experimentId,\n    planDigest,\n    profiles: Object.freeze(profiles),\n    scenarios: Object.freeze(scenarios),\n    judges: Object.freeze(judges),\n    reps,\n    seed,\n    splitTag,\n    commitSha: opts.commitSha,\n    dispatchRef: opts.dispatchRef,\n    integrity,\n    allowMixed,\n    validate,\n    ...(opts.personaOf === undefined ? {} : { personaOf: opts.personaOf }),\n    ...(opts.corpusText === undefined ? {} : { corpusText: opts.corpusText }),\n    rows: Object.freeze(rows),\n  }) as ProfileMatrixPlan<TScenario, TArtifact>\n}\n\nexport async function runProfileMatrixSegment<TScenario extends Scenario, TArtifact>(\n  opts: RunProfileMatrixSegmentOptions<TScenario, TArtifact>,\n): Promise<ProfileMatrixSegmentResult<TArtifact, TScenario>> {\n  const segmentId = requireIdentifier(opts.segmentId, 'segmentId')\n  const storage = opts.storage ?? fsCampaignStorage()\n  const runDir = resolveRunDir(opts.runDir)\n  assertPlan(opts.plan)\n  const selected = normalizeRows(opts.plan, opts.rows)\n  ensureManifest(storage, runDir, manifestFor(opts.plan))\n  claimSegment(storage, runDir, opts.plan, segmentId, selected)\n\n  const selectedIds = new Set(selected.map((row) => row.rowId))\n  const selectedProfileIds = new Set(selected.map((row) => row.profileId))\n  const profiles = opts.plan.profiles.filter((profile) =>\n    selectedProfileIds.has(agentProfileId(profile)),\n  )\n\n  const matrix = await runProfileMatrix<TScenario, TArtifact>({\n    profiles,\n    scenarios: [...opts.plan.scenarios],\n    dispatch: opts.dispatch,\n    judges: [...opts.plan.judges],\n    runDir,\n    commitSha: opts.plan.commitSha,\n    dispatchRef: opts.plan.dispatchRef,\n    experimentId: opts.plan.experimentId,\n    matrixId: opts.plan.matrixId,\n    splitTag: opts.plan.splitTag,\n    reps: opts.plan.reps,\n    seed: opts.plan.seed,\n    integrity: 'off',\n    allowMixed: opts.plan.allowMixed,\n    maxConcurrency: opts.maxConcurrency,\n    maxProfileConcurrency: opts.maxProfileConcurrency,\n    costCeiling: opts.costCeiling,\n    labeledStore: opts.labeledStore,\n    captureSource: opts.captureSource,\n    storage,\n    now: opts.now,\n    personaOf: opts.plan.personaOf,\n    validate: opts.plan.validate,\n    corpusText: opts.plan.corpusText,\n    reuseFailedCells: false,\n    rowFilter: ({ profile, scenario, rep }) =>\n      selectedIds.has(rowIdFor(opts.plan, agentProfileId(profile), scenario.id, rep)),\n  })\n\n  persistSegmentCells(storage, runDir, matrix)\n  const coverage = readCoverage(storage, runDir, opts.plan)\n  return { segmentId, rowIds: selected.map((row) => row.rowId), matrix, coverage }\n}\n\nexport async function finalizeProfileMatrix<TScenario extends Scenario, TArtifact>(\n  opts: FinalizeProfileMatrixOptions<TScenario, TArtifact>,\n): Promise<FinalizedProfileMatrixResult<TArtifact, TScenario>> {\n  const storage = opts.storage ?? fsCampaignStorage()\n  const runDir = resolveRunDir(opts.runDir)\n  assertPlan(opts.plan)\n  ensureManifest(storage, runDir, manifestFor(opts.plan))\n  const claims = readSegmentClaims(storage, runDir)\n  assertCompleteClaims(opts.plan, claims)\n  const coverage = readCoverage(storage, runDir, opts.plan)\n  if (coverage.missing.length > 0) {\n    throw new SegmentedProfileMatrixError(\n      `cannot finalize with missing rows: ${coverage.missing.join(', ')}`,\n    )\n  }\n\n  const matrix = await runProfileMatrix<TScenario, TArtifact>({\n    profiles: [...opts.plan.profiles],\n    scenarios: [...opts.plan.scenarios],\n    dispatch: async () => {\n      throw new SegmentedProfileMatrixError(\n        'finalization attempted to dispatch an uncached row; the persisted coverage changed during finalization',\n      )\n    },\n    judges: [...opts.plan.judges],\n    runDir,\n    commitSha: opts.plan.commitSha,\n    dispatchRef: opts.plan.dispatchRef,\n    experimentId: opts.plan.experimentId,\n    matrixId: opts.plan.matrixId,\n    splitTag: opts.plan.splitTag,\n    reps: opts.plan.reps,\n    seed: opts.plan.seed,\n    integrity: opts.plan.integrity,\n    allowMixed: opts.plan.allowMixed,\n    maxConcurrency: opts.maxConcurrency,\n    maxProfileConcurrency: opts.maxProfileConcurrency,\n    storage,\n    now: opts.now,\n    personaOf: opts.plan.personaOf,\n    validate: opts.plan.validate,\n    corpusText: opts.plan.corpusText,\n    reuseFailedCells: true,\n  })\n  assertFinalRows(opts.plan, matrix)\n  return { ...matrix, coverage }\n}\n\ninterface PersistedMatrixManifest {\n  schemaVersion: 1\n  matrixId: string\n  experimentId: string\n  planDigest: string\n  profiles: Array<{ id: string; hash: string }>\n  scenarios: Array<{ id: string; kind: string; scenarioDigest: string }>\n  reps: number\n  seed: number\n  splitTag: string\n  commitSha: string\n  dispatchRef: string\n  rows: ProfileMatrixRow[]\n}\n\ninterface SegmentClaim {\n  schemaVersion: 1\n  segmentId: string\n  planDigest: string\n  rowIds: string[]\n}\n\nfunction manifestFor<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n): PersistedMatrixManifest {\n  return {\n    schemaVersion: 1,\n    matrixId: plan.matrixId,\n    experimentId: plan.experimentId,\n    planDigest: plan.planDigest,\n    profiles: plan.profiles.map((profile) => ({\n      id: agentProfileId(profile),\n      hash: `sha256:${agentProfileHash(profile)}`,\n    })),\n    scenarios: plan.scenarios.map((scenario) => campaignScenarioIdentity(scenario)),\n    reps: plan.reps,\n    seed: plan.seed,\n    splitTag: plan.splitTag,\n    commitSha: plan.commitSha,\n    dispatchRef: plan.dispatchRef,\n    rows: [...plan.rows],\n  }\n}\n\nfunction assertPlan<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n): void {\n  const rebuilt = createProfileMatrixPlan({\n    profiles: [...plan.profiles],\n    scenarios: [...plan.scenarios],\n    judges: [...plan.judges],\n    commitSha: plan.commitSha,\n    dispatchRef: plan.dispatchRef,\n    experimentId: plan.experimentId,\n    splitTag: plan.splitTag,\n    reps: plan.reps,\n    seed: plan.seed,\n    integrity: plan.integrity,\n    allowMixed: plan.allowMixed,\n    validate: plan.validate,\n    personaOf: plan.personaOf,\n    corpusText: plan.corpusText,\n  })\n  if (\n    rebuilt.planDigest !== plan.planDigest ||\n    rebuilt.matrixId !== plan.matrixId ||\n    canonicalJson(rebuilt.rows) !== canonicalJson(plan.rows)\n  ) {\n    throw new SegmentedProfileMatrixError('plan inputs changed after identity was created')\n  }\n}\n\nfunction ensureManifest(\n  storage: CampaignStorage,\n  runDir: string,\n  expected: PersistedMatrixManifest,\n): void {\n  storage.ensureDir(runDir)\n  const path = join(runDir, PLAN_FILE)\n  const existing = storage.read(path)\n  if (existing === undefined) {\n    const content = `${canonicalJson(expected)}\\n`\n    if (storage.append(path, content, 0) !== undefined) return\n  }\n  const persisted = storage.read(path)\n  if (persisted === undefined) {\n    throw new SegmentedProfileMatrixError('persisted plan is unreadable')\n  }\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(persisted)\n  } catch {\n    throw new SegmentedProfileMatrixError('persisted plan is corrupt JSON')\n  }\n  if (canonicalJson(parsed) !== canonicalJson(expected)) {\n    throw new SegmentedProfileMatrixError(\n      'persisted plan identity does not match the supplied inputs',\n    )\n  }\n}\n\nfunction normalizeRows<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  rows: readonly (string | ProfileMatrixRow)[],\n): ProfileMatrixRow[] {\n  if (!Array.isArray(rows) || rows.length === 0) {\n    throw new SegmentedProfileMatrixError('a segment must select at least one row')\n  }\n  const byId = new Map(plan.rows.map((row) => [row.rowId, row]))\n  const selected: ProfileMatrixRow[] = []\n  const seen = new Set<string>()\n  for (const input of rows) {\n    const rowId = typeof input === 'string' ? input : input?.rowId\n    if (typeof rowId !== 'string' || rowId.length === 0) {\n      throw new SegmentedProfileMatrixError('segment rows must contain row ids')\n    }\n    if (seen.has(rowId))\n      throw new SegmentedProfileMatrixError(`duplicate row '${rowId}' in segment`)\n    const row = byId.get(rowId)\n    if (!row) throw new SegmentedProfileMatrixError(`row '${rowId}' is not declared by the plan`)\n    if (typeof input !== 'string' && canonicalJson(input) !== canonicalJson(row)) {\n      throw new SegmentedProfileMatrixError(`row '${rowId}' does not match the declared plan row`)\n    }\n    seen.add(rowId)\n    selected.push(row)\n  }\n  return selected.sort((left, right) => left.ordinal - right.ordinal)\n}\n\nfunction claimSegment<TScenario extends Scenario, TArtifact>(\n  storage: CampaignStorage,\n  runDir: string,\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  segmentId: string,\n  selected: readonly ProfileMatrixRow[],\n): void {\n  const path = join(runDir, SEGMENTS_FILE)\n  const expected = canonicalJson({\n    schemaVersion: 1,\n    segmentId,\n    planDigest: plan.planDigest,\n    rowIds: selected.map((row) => row.rowId).sort(),\n  } satisfies SegmentClaim)\n  for (let attempt = 0; attempt < 8; attempt += 1) {\n    const raw = storage.read(path) ?? ''\n    const claims = parseSegmentClaims(raw, path)\n    const existing = claims.find((claim) => claim.segmentId === segmentId)\n    if (existing) {\n      if (canonicalJson(existing) !== expected) {\n        throw new SegmentedProfileMatrixError(\n          `segment '${segmentId}' was resumed with different rows or plan identity`,\n        )\n      }\n      return\n    }\n    const selectedIds = new Set(selected.map((row) => row.rowId))\n    const overlap = claims.flatMap((claim) =>\n      claim.rowIds\n        .filter((rowId) => selectedIds.has(rowId))\n        .map((rowId) => `${rowId} (${claim.segmentId})`),\n    )\n    if (overlap.length > 0) {\n      throw new SegmentedProfileMatrixError(\n        `segment rows overlap existing claims: ${overlap.join(', ')}`,\n      )\n    }\n    const event = `${expected}\\n`\n    const next = storage.append(path, event, byteLength(raw))\n    if (next !== undefined) return\n  }\n  throw new SegmentedProfileMatrixError(\n    `could not claim segment '${segmentId}' after concurrent updates`,\n  )\n}\n\nfunction readSegmentClaims(storage: CampaignStorage, runDir: string): SegmentClaim[] {\n  const path = join(runDir, SEGMENTS_FILE)\n  const raw = storage.read(path)\n  if (raw === undefined) return []\n  return parseSegmentClaims(raw, path)\n}\n\nfunction parseSegmentClaims(raw: string, path: string): SegmentClaim[] {\n  const claims: SegmentClaim[] = []\n  const seenSegments = new Set<string>()\n  const seenRows = new Map<string, string>()\n  for (const [index, line] of raw.split('\\n').entries()) {\n    if (line.trim() === '') continue\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(line)\n    } catch {\n      throw new SegmentedProfileMatrixError(`segment registry is corrupt at ${path}:${index + 1}`)\n    }\n    if (canonicalJson(parsed) !== line) {\n      throw new SegmentedProfileMatrixError(\n        `segment registry is not canonical at ${path}:${index + 1}`,\n      )\n    }\n    const claim = parsed as Partial<SegmentClaim>\n    if (\n      claim.schemaVersion !== 1 ||\n      typeof claim.segmentId !== 'string' ||\n      typeof claim.planDigest !== 'string' ||\n      !Array.isArray(claim.rowIds) ||\n      claim.rowIds.some((rowId) => typeof rowId !== 'string') ||\n      new Set(claim.rowIds).size !== claim.rowIds.length\n    ) {\n      throw new SegmentedProfileMatrixError(\n        `segment registry has an invalid claim at ${path}:${index + 1}`,\n      )\n    }\n    if (seenSegments.has(claim.segmentId)) {\n      throw new SegmentedProfileMatrixError(`segment registry repeats segment '${claim.segmentId}'`)\n    }\n    seenSegments.add(claim.segmentId)\n    const normalized = {\n      schemaVersion: 1 as const,\n      segmentId: claim.segmentId,\n      planDigest: claim.planDigest,\n      rowIds: [...claim.rowIds].sort(),\n    }\n    for (const rowId of normalized.rowIds) {\n      const owner = seenRows.get(rowId)\n      if (owner) {\n        throw new SegmentedProfileMatrixError(\n          `segment registry overlaps row '${rowId}' between '${owner}' and '${normalized.segmentId}'`,\n        )\n      }\n      seenRows.set(rowId, normalized.segmentId)\n    }\n    claims.push(normalized)\n  }\n  return claims\n}\n\nfunction assertCompleteClaims<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  claims: readonly SegmentClaim[],\n): void {\n  const expected = new Set(plan.rows.map((row) => row.rowId))\n  const claimed = new Set<string>()\n  for (const claim of claims) {\n    if (claim.planDigest !== plan.planDigest) {\n      throw new SegmentedProfileMatrixError(\n        `segment '${claim.segmentId}' belongs to a different plan identity`,\n      )\n    }\n    for (const rowId of claim.rowIds) {\n      if (!expected.has(rowId)) {\n        throw new SegmentedProfileMatrixError(\n          `segment '${claim.segmentId}' claims an undeclared row '${rowId}'`,\n        )\n      }\n      claimed.add(rowId)\n    }\n  }\n  const missingClaims = plan.rows.filter((row) => !claimed.has(row.rowId)).map((row) => row.rowId)\n  if (missingClaims.length > 0) {\n    throw new SegmentedProfileMatrixError(\n      `cannot finalize until every row is claimed: ${missingClaims.join(', ')}`,\n    )\n  }\n}\n\nfunction persistSegmentCells<TArtifact, TScenario extends Scenario>(\n  storage: CampaignStorage,\n  runDir: string,\n  matrix: RunProfileMatrixResult<TArtifact, TScenario>,\n): void {\n  for (const [profileId, campaign] of Object.entries(matrix.campaigns)) {\n    for (const cell of campaign.cells) {\n      const path = cellCachePath(join(runDir, profileDirectory(profileId)), cell.cellId)\n      storage.ensureDir(dirname(path))\n      // Campaign caches already use JSON.stringify, which omits optional\n      // undefined fields such as a successful cell's `error` property.\n      storage.write(path, `${JSON.stringify(cell)}\\n`)\n    }\n  }\n}\n\nfunction readCoverage<TScenario extends Scenario, TArtifact>(\n  storage: CampaignStorage,\n  runDir: string,\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n): ProfileMatrixCoverage {\n  const expectedManifestHashes = new Map<string, string>(\n    plan.profiles.map((profile) => {\n      const identity = profileMatrixCampaignIdentity({\n        profile,\n        scenarios: [...plan.scenarios],\n        judges: [...plan.judges],\n        commitSha: plan.commitSha,\n        dispatchRef: plan.dispatchRef,\n        splitTag: plan.splitTag,\n        seed: plan.seed,\n        reps: plan.reps,\n      })\n      return [identity.profileId, identity.manifestHash] as const\n    }),\n  )\n  const missing: string[] = []\n  const failed: string[] = []\n  const zeroScore: string[] = []\n  let present = 0\n  for (const row of plan.rows) {\n    const path = cellCachePath(\n      join(runDir, profileDirectory(row.profileId)),\n      `${row.scenarioId}:${row.rep}`,\n    )\n    const raw = storage.read(path)\n    if (raw === undefined) {\n      missing.push(row.rowId)\n      continue\n    }\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(raw)\n    } catch {\n      throw new SegmentedProfileMatrixError(`cell '${row.rowId}' has corrupt JSON`)\n    }\n    if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed)) {\n      throw new SegmentedProfileMatrixError(`cell '${row.rowId}' has an invalid record shape`)\n    }\n    const cell = parsed as CampaignCellResult<TArtifact>\n    if (\n      cell.cellId !== `${row.scenarioId}:${row.rep}` ||\n      cell.scenarioId !== row.scenarioId ||\n      cell.rep !== row.rep ||\n      cell.manifestHash !== expectedManifestHashes.get(row.profileId)\n    ) {\n      throw new SegmentedProfileMatrixError(\n        `cell '${row.rowId}' has stale identity fields (manifest or row identity)`,\n      )\n    }\n    try {\n      campaignCellCostProvenance(cell)\n    } catch (error) {\n      throw new SegmentedProfileMatrixError(\n        `cell '${row.rowId}' failed cost-record validation: ${error instanceof Error ? error.message : String(error)}`,\n      )\n    }\n    present += 1\n    if (cell.error !== undefined) {\n      failed.push(row.rowId)\n      continue\n    }\n    if (projectCampaignCellQuality(cell).score === 0) zeroScore.push(row.rowId)\n  }\n  return {\n    expected: plan.rows.length,\n    present,\n    missing,\n    failed,\n    zeroScore,\n  }\n}\n\nfunction assertFinalRows<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  matrix: RunProfileMatrixResult<TArtifact, TScenario>,\n): void {\n  const expected = new Set(plan.rows.map((row) => `${row.profileId}:${row.scenarioId}:${row.rep}`))\n  const seen = new Set<string>()\n  for (const record of matrix.records) {\n    const key = `${record.candidateId}:${record.scenarioId}:${record.outcome.raw.rep}`\n    if (!expected.has(key) || seen.has(key)) {\n      throw new SegmentedProfileMatrixError(\n        `final matrix has an unexpected or duplicate row '${key}'`,\n      )\n    }\n    seen.add(key)\n  }\n  if (seen.size !== expected.size) {\n    throw new SegmentedProfileMatrixError(\n      `final matrix returned ${seen.size}/${expected.size} declared rows`,\n    )\n  }\n}\n\nfunction rowIdFor<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  profileId: string,\n  scenarioId: string,\n  rep: number,\n): string {\n  const row = plan.rows.find(\n    (candidate) =>\n      candidate.profileId === profileId &&\n      candidate.scenarioId === scenarioId &&\n      candidate.rep === rep,\n  )\n  if (!row)\n    throw new SegmentedProfileMatrixError(`row is not declared: ${profileId}/${scenarioId}/${rep}`)\n  return row.rowId\n}\n\nfunction profileDirectory(profileId: string): string {\n  return profileId.replace(/[^a-zA-Z0-9_-]/g, '_')\n}\n\nfunction requireIdentifier(value: string, name: string): string {\n  if (typeof value !== 'string' || value.trim().length === 0) {\n    throw new SegmentedProfileMatrixError(`${name} must be a non-empty string`)\n  }\n  return value\n}\n\nfunction byteLength(value: string): number {\n  return new TextEncoder().encode(value).byteLength\n}\n","/**\n * Discriminative scenario selection (research claim E2).\n *\n * The OR benchmark is SATURATING: run 7 measured ~75% tied holdout cells — most\n * problems are solved optimally by the baseline AND every candidate, so those\n * paired cells carry zero signal. A random/balanced holdout split spends its\n * budget on scenarios that cannot separate candidates.\n *\n * This picks the holdout by DISCRIMINATION power instead: a scenario every\n * candidate scores identically (variance ~0) carries no signal; one where the\n * scores spread carries the most. We drop fully saturated ties so each paired\n * holdout cell is spent on a scenario that can actually move a verdict.\n */\n\n/** Per-scenario observation: the composite scores each candidate earned on it. */\nexport interface ScenarioSignal {\n  scenarioId: string\n  /** Per-candidate composite scores observed for this scenario (>=1 values). */\n  scores: number[]\n}\n\nexport interface DiscriminationScore {\n  scenarioId: string\n  /** Higher = separates candidates more (spread of their scores). */\n  discrimination: number\n  /** Higher = easier / more-saturated (mean of candidate scores). */\n  meanScore: number\n  variance: number\n  /** variance ~0 AND meanScore at/above the ceiling ⇒ a saturated tie, no signal. */\n  tied: boolean\n}\n\nconst DEFAULT_SATURATION_CEILING = 0.999\n/** Variance below this is treated as \"every candidate scored the same\". */\nconst VARIANCE_EPSILON = 1e-9\n\ninterface Moments {\n  meanScore: number\n  variance: number\n}\n\n/** Population mean + variance of the candidate scores. Empty ⇒ zeros (a signal\n *  with no observations cannot discriminate). */\nfunction moments(scores: number[]): Moments {\n  const n = scores.length\n  if (n === 0) return { meanScore: 0, variance: 0 }\n  let sum = 0\n  for (const s of scores) sum += s\n  const meanScore = sum / n\n  let sqDev = 0\n  for (const s of scores) {\n    const d = s - meanScore\n    sqDev += d * d\n  }\n  return { meanScore, variance: sqDev / n }\n}\n\n/** Deterministic ordering: discrimination desc, then meanScore asc (more\n *  headroom first), then scenarioId asc. */\nfunction compareDiscrimination(a: DiscriminationScore, b: DiscriminationScore): number {\n  if (b.discrimination !== a.discrimination) return b.discrimination - a.discrimination\n  if (a.meanScore !== b.meanScore) return a.meanScore - b.meanScore\n  return a.scenarioId < b.scenarioId ? -1 : a.scenarioId > b.scenarioId ? 1 : 0\n}\n\n/**\n * Rank scenarios by how well they DISCRIMINATE candidates.\n *\n * `discrimination = variance` (spread of the candidate scores) — kept simple on\n * purpose; the headroom term (`saturationCeiling - meanScore`) only breaks ties\n * so that, among equally spread scenarios, the one with more room to improve\n * ranks first. Returned sorted by the deterministic order above.\n */\nexport function scoreDiscrimination(\n  signals: ScenarioSignal[],\n  opts?: { saturationCeiling?: number },\n): DiscriminationScore[] {\n  const saturationCeiling = opts?.saturationCeiling ?? DEFAULT_SATURATION_CEILING\n  const scored = signals.map((signal): DiscriminationScore => {\n    const { meanScore, variance } = moments(signal.scores)\n    const tied = variance < VARIANCE_EPSILON && meanScore >= saturationCeiling\n    return {\n      scenarioId: signal.scenarioId,\n      discrimination: variance,\n      meanScore,\n      variance,\n      tied,\n    }\n  })\n  return scored.sort(compareDiscrimination)\n}\n\n/**\n * Select the top-`k` most discriminative scenario ids for a holdout, EXCLUDING\n * fully saturated ties when enough non-tied scenarios exist (a tie in the\n * holdout wastes a paired cell).\n *\n * Prefers non-tied scenarios; if fewer than `k` non-tied exist, fills with the\n * least-saturated tied ones (tied scenarios are already ordered least-saturated\n * first by `meanScore` asc). Deterministic. Throws if `k < 1`. If\n * `signals.length <= k`, returns all ids in discrimination order.\n */\nexport function selectDiscriminative(\n  signals: ScenarioSignal[],\n  k: number,\n  opts?: { saturationCeiling?: number },\n): string[] {\n  if (k < 1) throw new Error(`selectDiscriminative: k must be >= 1 (got ${k})`)\n  const ranked = scoreDiscrimination(signals, opts)\n  if (ranked.length <= k) return ranked.map((s) => s.scenarioId)\n  const nonTied = ranked.filter((s) => !s.tied)\n  if (nonTied.length >= k) return nonTied.slice(0, k).map((s) => s.scenarioId)\n  const tied = ranked.filter((s) => s.tied)\n  const fill = tied.slice(0, k - nonTied.length)\n  return [...nonTied, ...fill].map((s) => s.scenarioId)\n}\n","import {\n  CostAccountingIncompleteError,\n  type CostLedgerHandle,\n  type RunPaidCallInput,\n} from '../cost-ledger'\nimport type { JudgeConfig, JudgeScore, Scenario } from './types'\n\nexport interface PhoenixEvaluationResultLike {\n  score?: number\n  label?: string\n  explanation?: string\n}\n\nexport interface PhoenixEvaluatorLike<TRecord extends Record<string, unknown>> {\n  name: string\n  kind: 'LLM' | 'CODE'\n  optimizationDirection?: 'MAXIMIZE' | 'MINIMIZE' | 'NEUTRAL'\n  evaluate(\n    record: TRecord,\n    context: UpstreamEvaluationContext,\n  ): Promise<PhoenixEvaluationResultLike>\n}\n\nexport interface AutoevalsScoreLike {\n  name: string\n  score: number | null\n  metadata?: Record<string, unknown>\n}\n\nexport type AutoevalsScorerLike<TInput extends Record<string, unknown>> = (\n  input: TInput,\n  context: UpstreamEvaluationContext,\n) => AutoevalsScoreLike | Promise<AutoevalsScoreLike>\n\nexport interface UpstreamEvaluationContext {\n  readonly signal: AbortSignal\n  readonly callId?: string\n}\n\ntype PaidEvaluationOptions<TResult> = Pick<\n  RunPaidCallInput<TResult>,\n  'maximumCharge' | 'receipt' | 'receiptFromError'\n> & {\n  model: string\n}\n\ninterface UpstreamJudgeOptions<TScenario extends Scenario> {\n  name?: string\n  dimension?: string\n  judgeVersion?: string\n  appliesTo?: (scenario: TScenario) => boolean\n  /** Convert the upstream score when its native scale is not higher-is-better. */\n  toComposite?: (score: number) => number\n}\n\nexport function phoenixEvaluatorJudge<\n  TRecord extends Record<string, unknown>,\n  TArtifact,\n  TScenario extends Scenario = Scenario,\n>(\n  evaluator: PhoenixEvaluatorLike<TRecord>,\n  options: UpstreamJudgeOptions<TScenario> & {\n    mapInput(input: { artifact: TArtifact; scenario: TScenario }): TRecord\n    paidCall?: PaidEvaluationOptions<PhoenixEvaluationResultLike>\n  },\n): JudgeConfig<TArtifact, TScenario> {\n  if (\n    (evaluator.optimizationDirection === 'MINIMIZE' ||\n      evaluator.optimizationDirection === 'NEUTRAL') &&\n    !options.toComposite\n  ) {\n    throw new TypeError(\n      `phoenixEvaluatorJudge requires toComposite for a ${evaluator.optimizationDirection} evaluator`,\n    )\n  }\n  const paidCall = validatePaidEvaluation(evaluator.name, evaluator.kind, options.paidCall)\n  return upstreamJudge(\n    {\n      name: options.name ?? evaluator.name,\n      dimension: options.dimension,\n      judgeVersion: options.judgeVersion,\n      appliesTo: options.appliesTo,\n      toComposite: options.toComposite,\n    },\n    async (input) => {\n      const result = await runUpstreamEvaluation({\n        name: evaluator.name,\n        kind: evaluator.kind,\n        signal: input.signal,\n        costLedger: input.costLedger,\n        costPhase: input.costPhase,\n        costTags: input.costTags,\n        scenarioId: input.scenario.id,\n        paidCall,\n        execute: (context) =>\n          evaluator.evaluate(\n            options.mapInput({ artifact: input.artifact, scenario: input.scenario }),\n            context,\n          ),\n      })\n      if (result.score === undefined || !Number.isFinite(result.score)) {\n        throw new Error(`${evaluator.name}: Phoenix evaluator returned no finite score`)\n      }\n      return {\n        score: result.score,\n        notes: [result.label, result.explanation].filter(Boolean).join(': ') || evaluator.name,\n      }\n    },\n  )\n}\n\nexport function autoevalsScorerJudge<\n  TInput extends Record<string, unknown>,\n  TArtifact,\n  TScenario extends Scenario = Scenario,\n>(\n  scorer: AutoevalsScorerLike<TInput>,\n  options: UpstreamJudgeOptions<TScenario> & {\n    name: string\n    mapInput(input: { artifact: TArtifact; scenario: TScenario }): TInput\n  } & (\n      | { kind: 'CODE'; paidCall?: never }\n      | { kind: 'LLM'; paidCall: PaidEvaluationOptions<AutoevalsScoreLike> }\n    ),\n): JudgeConfig<TArtifact, TScenario> {\n  const paidCall = validatePaidEvaluation(options.name, options.kind, options.paidCall)\n  return upstreamJudge(options, async (input) => {\n    const result = await runUpstreamEvaluation({\n      name: options.name,\n      kind: options.kind,\n      signal: input.signal,\n      costLedger: input.costLedger,\n      costPhase: input.costPhase,\n      costTags: input.costTags,\n      scenarioId: input.scenario.id,\n      paidCall,\n      execute: (context) =>\n        scorer(options.mapInput({ artifact: input.artifact, scenario: input.scenario }), context),\n    })\n    if (result.score === null || !Number.isFinite(result.score)) {\n      throw new Error(`${options.name}: Autoevals scorer returned no finite score`)\n    }\n    return {\n      score: result.score,\n      notes: result.metadata ? JSON.stringify(result.metadata) : result.name,\n    }\n  })\n}\n\nfunction upstreamJudge<TArtifact, TScenario extends Scenario>(\n  options: UpstreamJudgeOptions<TScenario> & { name: string },\n  evaluate: (\n    input: Parameters<JudgeConfig<TArtifact, TScenario>['score']>[0],\n  ) => Promise<{ score: number; notes: string }>,\n): JudgeConfig<TArtifact, TScenario> {\n  const dimension = options.dimension ?? options.name\n  return {\n    name: options.name,\n    judgeVersion: options.judgeVersion,\n    dimensions: [{ key: dimension, description: `Score from ${options.name}` }],\n    appliesTo: options.appliesTo,\n    async score(input): Promise<JudgeScore> {\n      const result = await evaluate(input)\n      const composite = options.toComposite ? options.toComposite(result.score) : result.score\n      if (!Number.isFinite(composite)) {\n        throw new Error(`${options.name}: toComposite returned a non-finite score`)\n      }\n      return {\n        dimensions: { [dimension]: result.score },\n        composite,\n        notes: result.notes,\n      }\n    },\n  }\n}\n\nfunction validatePaidEvaluation<TResult>(\n  name: string,\n  kind: 'LLM' | 'CODE',\n  paidCall: PaidEvaluationOptions<TResult> | undefined,\n): PaidEvaluationOptions<TResult> | undefined {\n  if (kind === 'CODE') {\n    if (paidCall) {\n      throw new TypeError(`${name}: CODE evaluator cannot declare paidCall`)\n    }\n    return undefined\n  }\n  if (!paidCall) {\n    throw new TypeError(`${name}: LLM evaluator requires paidCall cost and token capture`)\n  }\n  if (!paidCall.model.trim()) {\n    throw new TypeError(`${name}: paidCall.model must be non-empty`)\n  }\n  return paidCall\n}\n\nasync function runUpstreamEvaluation<TResult>(input: {\n  name: string\n  kind: 'LLM' | 'CODE'\n  signal: AbortSignal\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  costTags?: Record<string, string>\n  scenarioId: string\n  paidCall?: PaidEvaluationOptions<TResult>\n  execute(context: UpstreamEvaluationContext): Promise<TResult> | TResult\n}): Promise<TResult> {\n  if (input.kind === 'CODE') {\n    return abortableEvaluation(input.signal, () => input.execute({ signal: input.signal }))\n  }\n  if (!input.paidCall) {\n    throw new CostAccountingIncompleteError(`${input.name}: missing paid-call configuration`)\n  }\n  if (!input.costLedger) {\n    throw new CostAccountingIncompleteError(\n      `${input.name}: LLM evaluator requires the campaign cost ledger`,\n    )\n  }\n\n  const paid = await input.costLedger.runPaidCall({\n    channel: 'judge',\n    phase: input.costPhase ?? 'judge',\n    actor: input.name,\n    model: input.paidCall.model,\n    ...(input.paidCall.maximumCharge ? { maximumCharge: input.paidCall.maximumCharge } : {}),\n    tags: { ...input.costTags, scenarioId: input.scenarioId },\n    signal: input.signal,\n    execute: (signal, callId) => Promise.resolve(input.execute({ signal, callId })),\n    receipt: input.paidCall.receipt,\n    ...(input.paidCall.receiptFromError\n      ? { receiptFromError: input.paidCall.receiptFromError }\n      : {}),\n  })\n  if (!paid.succeeded) throw paid.error\n\n  const recorded = input.costLedger.list().find((receipt) => receipt.callId === paid.callId)\n  if (!recorded) {\n    throw new CostAccountingIncompleteError(\n      `${input.name}: paid evaluator returned without a recorded cost receipt`,\n    )\n  }\n  if (recorded.costUnknown || recorded.usageUnknown) {\n    throw new CostAccountingIncompleteError(\n      `${input.name}: paid evaluator returned without complete cost and token usage`,\n    )\n  }\n  return paid.value\n}\n\nasync function abortableEvaluation<TResult>(\n  signal: AbortSignal,\n  execute: () => Promise<TResult> | TResult,\n): Promise<TResult> {\n  if (signal.aborted) throw signal.reason\n\n  let rejectAborted!: (reason: unknown) => void\n  const aborted = new Promise<never>((_resolve, reject) => {\n    rejectAborted = reject\n  })\n  const onAbort = (): void => rejectAborted(signal.reason)\n  signal.addEventListener('abort', onAbort, { once: true })\n  try {\n    return await Promise.race([Promise.resolve().then(execute), aborted])\n  } finally {\n    signal.removeEventListener('abort', onAbort)\n  }\n}\n","/**\n * VCS-pluggable worktree adapter. One improvement = one worktree, PR-like\n * (multiple commits allowed). A code-tier proposer's `propose()` creates a\n * worktree, an agent commits the change into it, and `finalize()` returns a\n * content-addressed `CodeSurface` the measurement verifies before running.\n * On promotion the worktree becomes the PR branch.\n *\n * The interface is VCS-agnostic so a future `jj` ([jj-vcs](https://github.com/jj-vcs/jj))\n * adapter can slot in without touching proposer code. Only the git adapter\n * ships today. See `docs/design/loop-taxonomy.md`.\n */\n\nimport { execFileSync } from 'node:child_process'\nimport { createHash } from 'node:crypto'\nimport {\n  closeSync,\n  existsSync,\n  constants as fsConstants,\n  fstatSync,\n  lstatSync,\n  mkdirSync,\n  mkdtempSync,\n  openSync,\n  readlinkSync,\n  readSync,\n  realpathSync,\n  rmSync,\n} from 'node:fs'\nimport { devNull, tmpdir } from 'node:os'\nimport { basename, dirname, isAbsolute, join, relative, resolve, sep } from 'node:path'\nimport { assertCodeSurfaceIdentity, surfaceContentHash } from '../surface-identity'\nimport type { CodeSurface } from '../types'\n\nconst MAX_GIT_OUTPUT_BYTES = 256 * 1024 * 1024\nconst FILE_HASH_CHUNK_BYTES = 1024 * 1024\n\ntype GitOutput = string | Uint8Array\ntype GitEnvironment = Readonly<Record<string, string>>\ntype GitRunner = (args: string[], cwd: string, env?: GitEnvironment) => GitOutput\n\nconst GIT_REPOSITORY_ENV = new Set([\n  'GIT_ALTERNATE_OBJECT_DIRECTORIES',\n  'GIT_COMMON_DIR',\n  'GIT_DIR',\n  'GIT_INDEX_FILE',\n  'GIT_NAMESPACE',\n  'GIT_OBJECT_DIRECTORY',\n  'GIT_PREFIX',\n  'GIT_QUARANTINE_PATH',\n  'GIT_WORK_TREE',\n])\n\nexport interface Worktree {\n  /** Absolute path to the checked-out worktree directory. */\n  readonly path: string\n  /** The branch the worktree is on (becomes the PR branch on promotion). */\n  readonly branch: string\n  /** The ref the worktree was forked from. */\n  readonly baseRef: string\n  /** Exact commit `baseRef` resolved to before the worktree was created. */\n  readonly baseCommit: string\n  /** Exact tree object for `baseCommit`. */\n  readonly baseTree: string\n}\n\nexport interface WorktreeAdapter {\n  /** Create an isolated worktree on a fresh branch off `baseRef`. */\n  create(opts: { baseRef: string; label: string }): Promise<Worktree>\n  /** Commit pending changes, freeze the exact Git objects + binary patch, and\n   *  verify the worktree still matches that identity. */\n  finalize(worktree: Worktree, summary: string): Promise<CodeSurface>\n  /** Idempotently remove the worktree and branch. Safe to retry after partial cleanup. */\n  discard(worktree: Worktree): Promise<void>\n}\n\n/** Typed failure from a `WorktreeAdapter` operation (create/finalize/discard) — wraps the underlying git error as `cause`. */\nexport class WorktreeAdapterError extends Error {\n  constructor(\n    message: string,\n    readonly cause?: unknown,\n  ) {\n    super(message)\n    this.name = 'WorktreeAdapterError'\n  }\n}\n\nexport interface GitWorktreeAdapterOptions {\n  /** Repo root the worktrees fork from. */\n  repoRoot: string\n  /** Directory worktrees are created under. Default: `<repoRoot>/.worktrees`. */\n  worktreeDir?: string\n  /** Branch-name prefix. Default: `improve`. */\n  branchPrefix?: string\n  /** Test seam — defaults to a real `git` runner. The return value must contain\n   *  stdout verbatim, and runners that execute Git must forward the optional\n   *  environment overrides used to isolate patch generation. */\n  git?: GitRunner\n}\n\nfunction defaultGit(args: string[], cwd: string, overrides?: GitEnvironment): Uint8Array {\n  try {\n    const env = { ...process.env }\n    for (const key of Object.keys(env)) {\n      if (\n        GIT_REPOSITORY_ENV.has(key) ||\n        key === 'GIT_CONFIG' ||\n        key.startsWith('GIT_CONFIG_') ||\n        key.startsWith('GIT_ATTR_') ||\n        key === 'GIT_DIFF_OPTS' ||\n        key === 'GIT_EXTERNAL_DIFF'\n      ) {\n        delete env[key]\n      }\n    }\n    Object.assign(env, overrides)\n    env.GIT_NO_REPLACE_OBJECTS = '1'\n    env.LC_ALL = 'C'\n    env.LANG = 'C'\n    return execFileSync('git', args, { cwd, env, maxBuffer: MAX_GIT_OUTPUT_BYTES })\n  } catch (err) {\n    const stderr =\n      err && typeof err === 'object' && 'stderr' in err\n        ? String((err as { stderr: unknown }).stderr)\n        : ''\n    throw new WorktreeAdapterError(`git ${args.join(' ')} failed: ${stderr || String(err)}`, err)\n  }\n}\n\nfunction gitBytes(git: GitRunner, args: string[], cwd: string, env?: GitEnvironment): Buffer {\n  try {\n    const output = git(args, cwd, env)\n    return typeof output === 'string' ? Buffer.from(output, 'utf8') : Buffer.from(output)\n  } catch (err) {\n    if (err instanceof WorktreeAdapterError) throw err\n    throw new WorktreeAdapterError(`git ${args.join(' ')} failed: ${String(err)}`, err)\n  }\n}\n\nfunction gitText(git: GitRunner, args: string[], cwd: string, env?: GitEnvironment): string {\n  return gitBytes(git, args, cwd, env).toString('utf8').trim()\n}\n\nfunction hasRegisteredWorktree(git: GitRunner, repoRoot: string, path: string): boolean {\n  const expected = Buffer.from(`worktree ${resolve(path)}`, 'utf8')\n  const records = gitBytes(git, ['worktree', 'list', '--porcelain', '-z'], repoRoot)\n  let start = 0\n  while (start < records.length) {\n    const end = records.indexOf(0, start)\n    if (end < 0) {\n      throw new WorktreeAdapterError('Git worktree list output was not NUL-terminated')\n    }\n    if (records.subarray(start, end).equals(expected)) return true\n    start = end + 1\n  }\n  return false\n}\n\nfunction hasLocalBranch(git: GitRunner, repoRoot: string, branch: string): boolean {\n  const ref = `refs/heads/${branch}`\n  return gitText(git, ['for-each-ref', '--format=%(refname)', '--', ref], repoRoot)\n    .split('\\n')\n    .some((candidate) => candidate === ref)\n}\n\nfunction reconcileAbsent(exists: () => boolean, remove: () => void): unknown | undefined {\n  try {\n    if (!exists()) return undefined\n  } catch (err) {\n    return err\n  }\n\n  try {\n    remove()\n    return undefined\n  } catch (removeError) {\n    try {\n      // Git may complete the mutation before the caller observes a failure, or\n      // another cleanup may win the race. The desired end state is what matters.\n      if (!exists()) return undefined\n    } catch (recheckError) {\n      return new AggregateError(\n        [removeError, recheckError],\n        'Removal failed and the resulting resource state could not be checked',\n      )\n    }\n    return removeError\n  }\n}\n\nfunction sha256(bytes: Uint8Array): `sha256:${string}` {\n  return `sha256:${createHash('sha256').update(bytes).digest('hex')}`\n}\n\nconst PATCH_ARGS = [\n  // Git binary patches embed a zlib stream. Pin no-compression at command\n  // scope so repository/global config and compressor heuristics cannot change\n  // the candidate identity for the same base and final tree.\n  '-c',\n  'core.compression=0',\n  '-c',\n  `core.attributesFile=${devNull}`,\n  '-c',\n  'core.quotePath=true',\n  '-c',\n  'diff.suppressBlankEmpty=false',\n  'diff',\n  '--unified=3',\n  '--inter-hunk-context=0',\n  `-O${devNull}`,\n  '--binary',\n  '--full-index',\n  '--no-color',\n  '--no-ext-diff',\n  '--no-textconv',\n  '--no-renames',\n  '--diff-algorithm=myers',\n  '--no-indent-heuristic',\n  '--src-prefix=a/',\n  '--dst-prefix=b/',\n] as const\n\nconst CANONICAL_GIT_ENV: GitEnvironment = {\n  GIT_ATTR_GLOBAL: devNull,\n  GIT_ATTR_NOSYSTEM: '1',\n  GIT_CONFIG_GLOBAL: devNull,\n  GIT_CONFIG_NOSYSTEM: '1',\n  GIT_CONFIG_SYSTEM: devNull,\n}\n\n/** Render the transport patch from immutable objects through fresh Git metadata.\n *  Source-repository config, info attributes, templates, and caller environment\n *  therefore cannot alter bytes for the same two trees. */\nfunction patchBytes(\n  git: GitRunner,\n  cwd: string,\n  baseCommit: string,\n  candidateCommit: string,\n): Buffer {\n  const scratch = mkdtempSync(join(tmpdir(), 'agent-eval-patch-'))\n  const bareRepo = join(scratch, 'repo.git')\n  const emptyTemplate = join(scratch, 'empty-template')\n  mkdirSync(emptyTemplate)\n  try {\n    const objectFormat = gitObjectHashAlgorithm(candidateCommit)\n    const sourceObjects = realpathSync(gitText(git, ['rev-parse', '--git-path', 'objects'], cwd))\n    gitText(\n      git,\n      [\n        'init',\n        '--bare',\n        '--quiet',\n        ...(objectFormat === 'sha256' ? ['--object-format=sha256'] : []),\n        `--template=${emptyTemplate}`,\n        bareRepo,\n      ],\n      scratch,\n      CANONICAL_GIT_ENV,\n    )\n    return gitBytes(\n      git,\n      [`--git-dir=${bareRepo}`, ...PATCH_ARGS, baseCommit, candidateCommit, '--'],\n      scratch,\n      {\n        ...CANONICAL_GIT_ENV,\n        GIT_ALTERNATE_OBJECT_DIRECTORIES: sourceObjects,\n      },\n    )\n  } finally {\n    rmSync(scratch, { recursive: true, force: true })\n  }\n}\n\nfunction resolveCommit(git: GitRunner, cwd: string, ref: string): string {\n  return gitText(git, ['rev-parse', '--verify', `${ref}^{commit}`], cwd)\n}\n\nfunction unresolvedWorktreePath(surface: CodeSurface, worktreeDir?: string): string {\n  if (isAbsolute(surface.worktreeRef)) return surface.worktreeRef\n  if (worktreeDir) return join(worktreeDir, basename(surface.worktreeRef))\n  return surface.worktreeRef\n}\n\ninterface GitTreeEntry {\n  mode: string\n  objectId: string\n  path: string\n}\n\nfunction displayGitPath(path: string): string {\n  return JSON.stringify(path)\n}\n\nfunction parseGitTreeEntries(bytes: Uint8Array): GitTreeEntry[] {\n  const input = Buffer.from(bytes)\n  const entries: GitTreeEntry[] = []\n  let start = 0\n  while (start < input.length) {\n    const end = input.indexOf(0, start)\n    if (end < 0) throw new WorktreeAdapterError('Git tree output was not NUL-terminated')\n    const record = input.subarray(start, end)\n    start = end + 1\n    if (record.length === 0) continue\n\n    const tab = record.indexOf(0x09)\n    if (tab < 0) throw new WorktreeAdapterError('Git tree entry did not contain a path')\n    const metadata = record.subarray(0, tab).toString('ascii').split(' ')\n    if (metadata.length !== 3) throw new WorktreeAdapterError('Git tree entry was malformed')\n    const mode = metadata[0]\n    const type = metadata[1]\n    const objectId = metadata[2]\n    if (!mode || !type || !objectId) {\n      throw new WorktreeAdapterError('Git tree entry was malformed')\n    }\n    const pathBytes = record.subarray(tab + 1)\n    const path = pathBytes.toString('utf8')\n    if (!Buffer.from(path, 'utf8').equals(pathBytes)) {\n      throw new WorktreeAdapterError('CodeSurface paths must be valid UTF-8')\n    }\n    if (type !== 'blob' && type !== 'commit') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains unsupported Git object type ${type} at ${displayGitPath(path)}`,\n      )\n    }\n    entries.push({ mode, objectId, path })\n  }\n  return entries\n}\n\nfunction parseGitPathList(bytes: Uint8Array): string[] {\n  const input = Buffer.from(bytes)\n  const paths: string[] = []\n  let start = 0\n  while (start < input.length) {\n    const end = input.indexOf(0, start)\n    if (end < 0) throw new WorktreeAdapterError('Git path output was not NUL-terminated')\n    const pathBytes = input.subarray(start, end)\n    start = end + 1\n    if (pathBytes.length === 0) continue\n    const path = pathBytes.toString('utf8')\n    if (!Buffer.from(path, 'utf8').equals(pathBytes)) {\n      throw new WorktreeAdapterError('CodeSurface paths must be valid UTF-8')\n    }\n    paths.push(path)\n  }\n  return paths\n}\n\nfunction isWithinRoot(root: string, candidate: string): boolean {\n  const rel = relative(root, candidate)\n  return rel === '' || (!isAbsolute(rel) && rel !== '..' && !rel.startsWith(`..${sep}`))\n}\n\nfunction assertSafeRelativePath(root: string, path: string): string {\n  if (path.length === 0 || isAbsolute(path)) {\n    throw new WorktreeAdapterError(`CodeSurface contains unsafe path ${displayGitPath(path)}`)\n  }\n  const absolutePath = resolve(root, path)\n  if (!isWithinRoot(root, absolutePath) || absolutePath === root) {\n    throw new WorktreeAdapterError(`CodeSurface path escapes its worktree: ${displayGitPath(path)}`)\n  }\n\n  const segments = path.split(/[\\\\/]/u)\n  let parent = root\n  for (const segment of segments.slice(0, -1)) {\n    if (segment.length === 0 || segment === '.' || segment === '..') {\n      throw new WorktreeAdapterError(`CodeSurface contains unsafe path ${displayGitPath(path)}`)\n    }\n    parent = join(parent, segment)\n    const stat = lstatSync(parent)\n    if (!stat.isDirectory() || stat.isSymbolicLink()) {\n      throw new WorktreeAdapterError(\n        `CodeSurface path traverses a non-directory or symbolic link: ${displayGitPath(path)}`,\n      )\n    }\n  }\n  return absolutePath\n}\n\nfunction gitObjectHashAlgorithm(objectId: string): 'sha1' | 'sha256' {\n  if (/^[a-f0-9]{40}$/.test(objectId)) return 'sha1'\n  if (/^[a-f0-9]{64}$/.test(objectId)) return 'sha256'\n  throw new WorktreeAdapterError(`Unsupported Git object id: ${objectId}`)\n}\n\nfunction hashGitBlobBytes(bytes: Uint8Array, objectId: string): string {\n  const hash = createHash(gitObjectHashAlgorithm(objectId))\n  hash.update(`blob ${bytes.byteLength}\\0`)\n  hash.update(bytes)\n  return hash.digest('hex')\n}\n\nfunction hashGitBlobFile(path: string, objectId: string): { hash: string; executable: boolean } {\n  const before = lstatSync(path)\n  if (!before.isFile() || before.isSymbolicLink()) {\n    throw new WorktreeAdapterError(`CodeSurface expected a regular file at ${displayGitPath(path)}`)\n  }\n\n  const noFollow = process.platform === 'win32' ? 0 : fsConstants.O_NOFOLLOW\n  const fd = openSync(path, fsConstants.O_RDONLY | noFollow)\n  try {\n    const opened = fstatSync(fd)\n    if (\n      !opened.isFile() ||\n      opened.dev !== before.dev ||\n      opened.ino !== before.ino ||\n      opened.size !== before.size\n    ) {\n      throw new WorktreeAdapterError(\n        `CodeSurface file changed while it was being verified: ${displayGitPath(path)}`,\n      )\n    }\n\n    const hash = createHash(gitObjectHashAlgorithm(objectId))\n    hash.update(`blob ${opened.size}\\0`)\n    const chunk = Buffer.allocUnsafe(FILE_HASH_CHUNK_BYTES)\n    let total = 0\n    while (true) {\n      const count = readSync(fd, chunk, 0, chunk.length, null)\n      if (count === 0) break\n      total += count\n      hash.update(chunk.subarray(0, count))\n    }\n    if (total !== opened.size) {\n      throw new WorktreeAdapterError(\n        `CodeSurface file changed while it was being verified: ${displayGitPath(path)}`,\n      )\n    }\n    return { hash: hash.digest('hex'), executable: (opened.mode & 0o111) !== 0 }\n  } finally {\n    closeSync(fd)\n  }\n}\n\nfunction assertSymlinkTargetIsBound(\n  root: string,\n  linkPath: string,\n  trackedPaths: ReadonlySet<string>,\n): void {\n  const targetBytes = readlinkSync(linkPath, { encoding: 'buffer' })\n  const target = targetBytes.toString('utf8')\n  if (!Buffer.from(target, 'utf8').equals(targetBytes)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link has an unsafe target at ${displayGitPath(linkPath)}`,\n    )\n  }\n  if (isAbsolute(target)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n  const lexicalTarget = resolve(dirname(linkPath), target)\n  if (!isWithinRoot(root, lexicalTarget)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n  let resolvedTarget: string\n  try {\n    resolvedTarget = realpathSync(linkPath)\n  } catch (err) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link target is missing or cyclic at ${displayGitPath(linkPath)}`,\n      err,\n    )\n  }\n  if (!isWithinRoot(root, resolvedTarget)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n\n  const targetRelative = relative(root, resolvedTarget).split(sep).join('/')\n  const targetIsTracked =\n    trackedPaths.has(targetRelative) ||\n    [...trackedPaths].some((trackedPath) => trackedPath.startsWith(`${targetRelative}/`))\n  if (!targetIsTracked) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link resolves to untracked content at ${displayGitPath(linkPath)}`,\n    )\n  }\n}\n\nfunction assertRawTreeMatchesWorktree(git: GitRunner, root: string, candidateCommit: string): void {\n  const entries = parseGitTreeEntries(\n    gitBytes(git, ['ls-tree', '-r', '-z', '--full-tree', candidateCommit], root),\n  )\n  const trackedPaths = new Set(entries.map((entry) => entry.path))\n\n  for (const entry of entries) {\n    const absolutePath = assertSafeRelativePath(root, entry.path)\n    if (entry.mode === '160000' || entry.mode === '040000') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains a Git submodule whose executable bytes are not bound: ${displayGitPath(entry.path)}`,\n      )\n    }\n    if (entry.mode === '120000') {\n      const stat = lstatSync(absolutePath)\n      if (!stat.isSymbolicLink()) {\n        throw new WorktreeAdapterError(\n          `CodeSurface expected a symbolic link at ${displayGitPath(entry.path)}`,\n        )\n      }\n      const targetBytes = readlinkSync(absolutePath, { encoding: 'buffer' })\n      const actualObjectId = hashGitBlobBytes(targetBytes, entry.objectId)\n      if (actualObjectId !== entry.objectId) {\n        throw new WorktreeAdapterError(\n          `CodeSurface raw symbolic-link bytes differ from the candidate tree at ${displayGitPath(entry.path)}`,\n        )\n      }\n      assertSymlinkTargetIsBound(root, absolutePath, trackedPaths)\n      continue\n    }\n    if (entry.mode !== '100644' && entry.mode !== '100755') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains unsupported Git mode ${entry.mode} at ${displayGitPath(entry.path)}`,\n      )\n    }\n\n    const actual = hashGitBlobFile(absolutePath, entry.objectId)\n    if (actual.hash !== entry.objectId) {\n      throw new WorktreeAdapterError(\n        `CodeSurface raw tracked bytes differ from the candidate tree because the worktree changed after finalization at ${displayGitPath(entry.path)}`,\n      )\n    }\n    if (process.platform !== 'win32' && actual.executable !== (entry.mode === '100755')) {\n      throw new WorktreeAdapterError(\n        `CodeSurface executable mode differs from the candidate tree at ${displayGitPath(entry.path)}`,\n      )\n    }\n  }\n}\n\nexport interface CodeSurfaceVerification {\n  /** Verified worktree path. */\n  path: string\n  /** Git's canonical root for the verified checkout. */\n  repoRoot: string\n  /** Recomputed full content identity. */\n  contentHash: `sha256:${string}`\n  /** Exact verified binary-patch bytes. Candidate-bundle builders encode this\n   *  directly instead of reproducing Git diff options. */\n  patchBytes: Uint8Array\n}\n\nfunction verifyCodeSurfaceWithGit(\n  surface: CodeSurface,\n  path: string,\n  git: GitRunner,\n): CodeSurfaceVerification {\n  assertCodeSurfaceIdentity(surface)\n  if (!existsSync(path)) {\n    throw new WorktreeAdapterError(`CodeSurface worktree does not exist: ${path}`)\n  }\n  const lexicalRoot = resolve(path)\n  const canonicalRoot = realpathSync(path)\n  if (\n    lstatSync(lexicalRoot).isSymbolicLink() ||\n    (process.platform !== 'win32' && lexicalRoot !== canonicalRoot)\n  ) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree locator must not contain a symbolic link: ${path}`,\n    )\n  }\n  const repoRoot = gitText(git, ['rev-parse', '--show-toplevel'], path)\n  const canonicalRepoRoot = realpathSync(repoRoot)\n  if (canonicalRepoRoot !== canonicalRoot) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree locator is not the repository root: expected ${repoRoot}, got ${path}`,\n    )\n  }\n\n  const indexFlags = gitText(git, ['ls-files', '-v'], path)\n    .split('\\n')\n    .filter((line) => line.length > 0 && (line.startsWith('S ') || /^[a-z]/.test(line)))\n  if (indexFlags.length > 0) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree uses hidden index entries that cannot be verified: ${path}\\n${indexFlags.join('\\n')}`,\n    )\n  }\n\n  const extraPaths = [\n    ...parseGitPathList(gitBytes(git, ['ls-files', '--others', '--exclude-standard', '-z'], path)),\n    ...parseGitPathList(\n      gitBytes(git, ['ls-files', '--others', '--ignored', '--exclude-standard', '-z'], path),\n    ),\n  ]\n  if (extraPaths.length > 0) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree changed after finalization: ${path}\\n${extraPaths.join('\\n')}`,\n    )\n  }\n\n  const candidateCommit = resolveCommit(git, path, 'HEAD')\n  if (candidateCommit !== surface.candidateCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface candidate commit mismatch: expected ${surface.candidateCommit}, got ${candidateCommit}`,\n    )\n  }\n\n  const baseCommit = resolveCommit(git, path, surface.baseCommit)\n  if (baseCommit !== surface.baseCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface base commit mismatch: expected ${surface.baseCommit}, got ${baseCommit}`,\n    )\n  }\n\n  const baseTree = gitText(git, ['rev-parse', '--verify', `${surface.baseCommit}^{tree}`], path)\n  if (baseTree !== surface.baseTree) {\n    throw new WorktreeAdapterError(\n      `CodeSurface base tree mismatch: expected ${surface.baseTree}, got ${baseTree}`,\n    )\n  }\n\n  const candidateTree = gitText(\n    git,\n    ['rev-parse', '--verify', `${surface.candidateCommit}^{tree}`],\n    path,\n  )\n  if (candidateTree !== surface.candidateTree) {\n    throw new WorktreeAdapterError(\n      `CodeSurface tree mismatch: expected ${surface.candidateTree}, got ${candidateTree}`,\n    )\n  }\n\n  try {\n    gitText(\n      git,\n      [\n        'diff-index',\n        '--cached',\n        '--quiet',\n        '--no-ext-diff',\n        '--no-textconv',\n        surface.candidateCommit,\n        '--',\n      ],\n      path,\n    )\n  } catch (err) {\n    throw new WorktreeAdapterError(\n      `CodeSurface index differs from finalized candidate: ${path}`,\n      err,\n    )\n  }\n\n  try {\n    assertRawTreeMatchesWorktree(git, canonicalRepoRoot, surface.candidateCommit)\n  } catch (err) {\n    if (err instanceof WorktreeAdapterError) throw err\n    throw new WorktreeAdapterError(`CodeSurface raw tree verification failed: ${path}`, err)\n  }\n\n  const mergeBase = gitText(git, ['merge-base', surface.baseCommit, surface.candidateCommit], path)\n  if (mergeBase !== surface.baseCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface candidate ${surface.candidateCommit} does not descend from base ${surface.baseCommit}`,\n    )\n  }\n\n  const patch = patchBytes(git, path, surface.baseCommit, surface.candidateCommit)\n  const actualPatchHash = sha256(patch)\n  if (actualPatchHash !== surface.patch.sha256 || patch.byteLength !== surface.patch.byteLength) {\n    throw new WorktreeAdapterError(\n      `CodeSurface patch mismatch: expected ${surface.patch.sha256}/${surface.patch.byteLength} bytes, got ${actualPatchHash}/${patch.byteLength} bytes`,\n    )\n  }\n\n  return {\n    path,\n    repoRoot: canonicalRepoRoot,\n    contentHash: surfaceContentHash(surface),\n    patchBytes: new Uint8Array(patch),\n  }\n}\n\n/** Slugify a label into a branch-safe segment. */\nfunction slug(label: string): string {\n  return (\n    label\n      .toLowerCase()\n      .replace(/[^a-z0-9]+/g, '-')\n      .replace(/^-+|-+$/g, '')\n      .slice(0, 48) || 'candidate'\n  )\n}\n\n/**\n * Git-backed `WorktreeAdapter`: creates isolated worktrees on fresh branches, commits agent changes, and discards losers.\n */\nexport function gitWorktreeAdapter(opts: GitWorktreeAdapterOptions): WorktreeAdapter {\n  const git = opts.git ?? defaultGit\n  const worktreeDir = opts.worktreeDir ?? join(opts.repoRoot, '.worktrees')\n  const branchPrefix = opts.branchPrefix ?? 'improve'\n\n  return {\n    async create({ baseRef, label }) {\n      const id = `${slug(label)}-${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 6)}`\n      const branch = `${branchPrefix}/${id}`\n      const path = join(worktreeDir, id)\n      const baseCommit = resolveCommit(git, opts.repoRoot, baseRef)\n      const baseTree = gitText(\n        git,\n        ['rev-parse', '--verify', `${baseCommit}^{tree}`],\n        opts.repoRoot,\n      )\n      gitText(git, ['worktree', 'add', '-b', branch, path, baseCommit], opts.repoRoot)\n      return { path, branch, baseRef, baseCommit, baseTree }\n    },\n\n    async finalize(worktree, summary) {\n      // Stage + commit any pending changes the agent left in the worktree.\n      // A no-op commit is refused by git, so only commit when the tree is dirty.\n      const status = gitText(\n        git,\n        ['status', '--porcelain=v1', '--untracked-files=all'],\n        worktree.path,\n      )\n      if (status.length > 0) {\n        gitText(git, ['add', '-A'], worktree.path)\n        gitText(git, ['commit', '-m', summary], worktree.path)\n      }\n      const candidateCommit = resolveCommit(git, worktree.path, 'HEAD')\n      const candidateTree = gitText(\n        git,\n        ['rev-parse', '--verify', `${candidateCommit}^{tree}`],\n        worktree.path,\n      )\n      const patch = patchBytes(git, worktree.path, worktree.baseCommit, candidateCommit)\n      const surface: CodeSurface = {\n        kind: 'code',\n        worktreeRef: worktree.path,\n        baseRef: worktree.baseRef,\n        baseCommit: worktree.baseCommit,\n        baseTree: worktree.baseTree,\n        candidateCommit,\n        candidateTree,\n        patch: {\n          format: 'git-diff-binary',\n          sha256: sha256(patch),\n          byteLength: patch.byteLength,\n        },\n        summary,\n      }\n      verifyCodeSurfaceWithGit(surface, worktree.path, git)\n      return surface\n    },\n\n    async discard(worktree) {\n      // Reconcile both resources independently so a retry can finish cleanup\n      // after either command succeeded alone. Force-remove because the worktree\n      // may hold uncommitted experiment state we're discarding.\n      const failures = [\n        reconcileAbsent(\n          () => hasRegisteredWorktree(git, opts.repoRoot, worktree.path),\n          () => gitText(git, ['worktree', 'remove', '--force', '--', worktree.path], opts.repoRoot),\n        ),\n        reconcileAbsent(\n          () => hasLocalBranch(git, opts.repoRoot, worktree.branch),\n          () => gitText(git, ['branch', '-D', '--', worktree.branch], opts.repoRoot),\n        ),\n      ].filter((failure) => failure !== undefined)\n\n      if (failures.length > 0) {\n        const cause =\n          failures.length === 1\n            ? failures[0]\n            : new AggregateError(failures, 'Multiple Git resources could not be removed')\n        throw new WorktreeAdapterError(\n          `Failed to discard worktree ${worktree.path} and branch ${worktree.branch}`,\n          cause,\n        )\n      }\n    },\n  }\n}\n\n/** Verify a finalized code surface against its current checkout. This rejects\n *  dirty/ignored files, moved refs, missing Git objects, raw byte/mode\n *  mismatches, external symlinks, and submodules. */\nexport function verifyCodeSurface(\n  surface: CodeSurface,\n  worktreeDir?: string,\n): CodeSurfaceVerification {\n  const path = unresolvedWorktreePath(surface, worktreeDir)\n  return verifyCodeSurfaceWithGit(surface, path, defaultGit)\n}\n\n/** Resolve a code candidate for evaluation only after verifying its immutable\n *  identity against the checkout at `worktreeRef`. */\nexport function resolveWorktreePath(surface: CodeSurface, worktreeDir?: string): string {\n  return verifyCodeSurface(surface, worktreeDir).path\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAkCA,SAAgB,iCACd,SAKiC;CACjC,OAAO,OAAO,SAAS,UAAU,YAAY;EAC3C,IAAI,OAAO,YAAY,UACrB,MAAM,IAAI,UACR,uEAAuE,QAAQ,MACjF;EAEF,OAAO,QAAQ,QAAQ;GACrB,cAAc;GACd,YAAY,SAAS;GACrB,OAAO,GAAG,QAAQ,OAAO,GAAG,SAAS;GACrC,QAAQ,QAAQ;EAClB,CAAC;CACH;AACF;AAEA,SAAgB,2BAGd;CACA,OAAO;EACL,MAAM;EACN,cAAc;EACd,YAAY;GACV;IAAE,KAAK;IAAgB,aAAa;GAAgC;GACpE;IAAE,KAAK;IAAqB,aAAa;GAA4C;GACrF;IAAE,KAAK;IAAM,aAAa;GAAsD;GAChF;IAAE,KAAK;IAA0B,aAAa;GAAsC;GACpF;IAAE,KAAK;IAAqB,aAAa;GAA4C;GACrF;IACE,KAAK;IACL,aAAa;GACf;GACA;IAAE,KAAK;IAAS,aAAa;GAA2C;EAC1E;EACA,YAAY,aACV,SAAS,SAAS,mBAAmB,SAAS,eAAe;EAC/D,MAAM,EAAE,UAAU,YAAY;GAC5B,uBAAuB,QAAQ;GAS/B,OAAO,uBARO,qBACZ;IACE,IAAI,SAAS;IACb,gBAAgB,SAAS;IACzB,iBAAiB,SAAS;GAC5B,GACA,SAAS,QAEuB,CAAC;EACrC;CACF;AACF;AAEA,SAAS,uBAAuB,UAAsC;CACpE,IAAI,SAAS,eAAe,aAC1B,MAAM,IAAI,UAAU,2BAA2B,SAAS,GAAG,wBAAwB;CAErF,IAAI,SAAS,eAAe,cAAc,SAAS,eAAe,WAAW,GAC3E,MAAM,IAAI,UAAU,oCAAoC,SAAS,GAAG,2BAA2B;CAEjG,IAAI,SAAS,eAAe,sBAAsB,SAAS,eAAe,SAAS,GACjF,MAAM,IAAI,UACR,4CAA4C,SAAS,GAAG,iCAC1D;AAEJ;AAEA,SAAS,uBAAuB,OAA4B;CAC1D,MAAM,aAAqC;EACzC,cAAc,MAAM;EACpB,mBAAmB,MAAM;EACzB,IAAI,MAAM;EACV,OAAO,MAAM,6BAA6B,IAAI;CAChD;CACA,IAAI,MAAM,yBAAyB,MACjC,WAAW,yBAAyB,MAAM;CAE5C,IAAI,MAAM,qBAAqB,MAAM,WAAW,oBAAoB,MAAM;CAC1E,IAAI,MAAM,2BAA2B,MACnC,WAAW,2BAA2B,MAAM;CAE9C,MAAM,QAAQ;EACZ,GAAG,MAAM,gBAAgB,OAAO,GAAG,MAAM,mBAAmB;EAC5D,GAAG,MAAM,wBAAwB,OAAO,GAAG,MAAM,wBAAwB,SAAS,MAAM,0BAA0B,OAAO;EACzH,GAAG,MAAM,kBAAkB,OAAO;CACpC,CAAC,CAAC,KAAK,IAAI;CAGX,OAAO;EAAE;EAAY,WADnB,MAAM,yBAAyB,OAAO,MAAM,MAAM,MAAM,KAAK,MAAM,wBAAwB;EAC7D;CAAM;AACxC;;;AC1GA,SAAgB,0BACd,OACmC;CACnC,qBAAqB,MAAM,WAAW,WAAW;CACjD,qBAAqB,MAAM,gBAAgB,gBAAgB;CAC3D,IAAI,MAAM,eAAe,SAAS,GAChC,MAAM,IAAI,gBACR,oFACF;CAEF,qBAAqB,MAAM,gBAAgB,gBAAgB;CAC3D,qBAAqB,MAAM,iBAAiB,iBAAiB;CAC7D,IAAI,MAAM,gBAAgB,SAAS,OAAO,GACxC,MAAM,IAAI,gBACR,yFACF;CAEF,kBAAkB,KAAK;CACvB,kBAAkB,KAAK;CAEvB,MAAM,gBAAgB,YACpB,MAAM,aACL,cAAc,UAAU,aACzB,WACF;CACA,eAAe,MAAM,gBAAgB,cAAc,KAAK,GAAG,kBAAkB,YAAY;CACzF,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,aAAa,cAAc,OAAO,GAAG;EAC9C,eAAe,UAAU,aAAa,aAAa;EACnD,eAAe,UAAU,WAAW,4BAA4B,UAAU,YAAY,EAAE;EACxF,IAAI,SAAS,IAAI,UAAU,SAAS,GAClC,MAAM,IAAI,gBACR,+CAA+C,UAAU,UAAU,8GAErE;EAEF,SAAS,IAAI,UAAU,SAAS;EAChC,IAAI,OAAO,UAAU,uBAAuB,WAC1C,MAAM,IAAI,gBACR,+CAA+C,UAAU,YAAY,kCACvE;CAEJ;CAEA,MAAM,iBAAiB,IAAI,IAAI,MAAM,eAAe,KAAK,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;CACnF,MAAM,gBAAgB,YACpB,MAAM,aACL,cAAc,UAAU,aACzB,WACF;CACA,eAAe,MAAM,gBAAgB,cAAc,KAAK,GAAG,kBAAkB,YAAY;CACzF,IAAI,CAAC,cAAc,IAAI,MAAM,mBAAmB,GAC9C,MAAM,IAAI,gBACR,iEAAiE,MAAM,oBAAoB,EAC7F;CAGF,MAAM,wCAAwB,IAAI,IAAmC;CACrE,MAAM,oCAAoB,IAAI,IAAmC;CACjE,KAAK,MAAM,aAAa,cAAc,OAAO,GAAG;EAC9C,kBAAkB,WAAW,eAAe,gBAAgB,MAAM,mBAAmB;EACrF,MAAM,MAAM,4BAA4B,UAAU,YAAY;EAC9D,MAAM,YAAY,sBAAsB,IAAI,GAAG;EAC/C,IAAI,WACF,MAAM,IAAI,gBACR,gDAAgD,UAAU,YAAY,SAChE,UAAU,YAAY,qCAC9B;EAEF,sBAAsB,IAAI,KAAK,SAAS;EACxC,IAAI,UAAU,aAAa,WAAW,GACpC,kBAAkB,IAAI,UAAU,aAAa,IAAK,SAAS;CAE/D;CACA,MAAM,WAAW,cAAc,IAAI,MAAM,mBAAmB;CAC5D,IAAI,SAAS,aAAa,WAAW,GACnC,MAAM,IAAI,gBACR,8CAA8C,SAAS,YAAY,4BACrE;CAEF,KAAK,MAAM,eAAe,MAAM,gBAC9B,IAAI,CAAC,kBAAkB,IAAI,WAAW,GACpC,MAAM,IAAI,gBACR,+EAA+E,YAAY,EAC7F;CAGJ,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,eAAe,QAAQ,QACrD,KAAK,IAAI,QAAQ,OAAO,GAAG,QAAQ,MAAM,eAAe,QAAQ,SAAS;EACvE,MAAM,MAAM,CAAC,MAAM,eAAe,OAAQ,MAAM,eAAe,MAAO;EACtE,IAAI,CAAC,sBAAsB,IAAI,4BAA4B,GAAG,CAAC,GAC7D,MAAM,IAAI,gBACR,2EAA2E,IAAI,KAAK,IAAI,EAAE,EAC5F;CAEJ;CAGF,MAAM,kCAAkB,IAAI,IAA+B;CAC3D,MAAM,UAAU,IAAI,IAAI,MAAM,SAAS;CACvC,KAAK,MAAM,OAAO,MAAM,MAAM;EAC5B,MAAM,YAAY,cAAc,IAAI,IAAI,WAAW;EACnD,IAAI,CAAC,WACH,MAAM,IAAI,gBACR,kDAAkD,IAAI,OAAO,6BAA6B,IAAI,YAAY,EAC5G;EAEF,IAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,GACzB,MAAM,IAAI,gBACR,uDAAuD,IAAI,YAAY,gBAAgB,IAAI,OAAO,iCAEpG;EAEF,YAAY,OAAO,KAAK,SAAS;EACjC,MAAM,SAAS,gBAAgB,IAAI,IAAI,WAAW,qBAAK,IAAI,IAAkB;EAC7E,IAAI,OAAO,IAAI,IAAI,MAAM,GACvB,MAAM,IAAI,gBACR,iEAAiE,IAAI,YAAY,cAAc,IAAI,OAAO,EAC5G;EAEF,OAAO,IAAI,IAAI,QAAQ,GAAG;EAC1B,gBAAgB,IAAI,IAAI,aAAa,MAAM;CAC7C;CACA,KAAK,MAAM,eAAe,MAAM,gBAAgB;EAC9C,MAAM,SAAS,gBAAgB,IAAI,WAAW;EAC9C,MAAM,UAAU,MAAM,UAAU,QAAQ,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;EACvE,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,gBACR,+CAA+C,YAAY,qCACrD,QAAQ,KAAK,IAAI,EAAE,uEAC3B;CAEJ;CACA,MAAM,eAAe,MAAM,eAAe,SAAS,MAAM,UAAU;CACnE,IAAI,MAAM,KAAK,WAAW,cACxB,MAAM,IAAI,gBACR,qDAAqD,aAAa,8BAA8B,MAAM,KAAK,QAC7G;CAGF,OAAO;EACL;EACA,YAAY,MAAM,eAAe,KAAK,OAAO,cAAc,IAAI,EAAE,CAAE;EACnE,YAAY,MAAM,eAAe,KAAK,OAAO,cAAc,IAAI,EAAE,CAAE;EACnE;EACA;EACA;EACA;EACA;EACA;EACA,gBAAgB,IAAI,IAAI,MAAM,eAAe,KAAK,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;CAC9E;AACF;AAEA,SAAgB,oBACd,SACA,aACQ;CACR,OAAO,QAAQ,MAAM,UAAU,KAAK,WAAW,mBAAmB,SAAS,aAAa,MAAM,CAAC;AACjG;AAEA,SAAgB,mBACd,SACA,aACA,QACM;CACN,OAAO,QAAQ,gBAAgB,IAAI,WAAW,CAAC,CAAE,IAAI,MAAM;AAC7D;AAEA,SAAgB,gCACd,SACA,cACU;CACV,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC,MACtB,MAAM,UAAU,QAAQ,eAAe,IAAI,IAAI,IAAK,QAAQ,eAAe,IAAI,KAAK,CACvF;AACF;AAEA,SAAgB,4BAA4B,cAAyC;CACnF,OAAO,KAAK,UAAU,YAAY;AACpC;AAEA,SAAS,kBACP,OACM;CACN,MAAM,EAAE,MAAM,WAAW,eAAe,MAAM;CAC9C,IAAI,CAAC,OAAO,UAAU,IAAI,GACxB,MAAM,IAAI,gBAAgB,oEAAoE;CAEhG,IAAI,CAAC,OAAO,UAAU,SAAS,KAAK,aAAa,GAC/C,MAAM,IAAI,gBACR,iFACF;CAEF,IAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,KAAK,cAAc,GACnE,MAAM,IAAI,gBACR,wEACF;AAEJ;AAEA,SAAS,kBACP,OACM;CACN,MAAM,SAAS,MAAM;CACrB,KAAK,MAAM,CAAC,MAAM,UAAU,CAC1B,CAAC,sBAAsB,OAAO,kBAAkB,GAChD,CAAC,sBAAsB,OAAO,kBAAkB,CAClD,GACE,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,MAAM,UAAU,QACnE,MAAM,IAAI,gBACR,8CAA8C,KAAK,4BAA4B,MAAM,UAAU,OAAO,EACxG;CAGJ,IACE,CAAC,OAAO,UAAU,OAAO,uBAAuB,KAChD,OAAO,0BAA0B,KACjC,OAAO,0BAA0B,MAAM,eAAe,QAEtD,MAAM,IAAI,gBACR,+FACQ,MAAM,eAAe,OAAO,EACtC;CAEF,KAAK,MAAM,CAAC,QAAQ,UAAU,OAAO,QAAQ,OAAO,gCAAgC,GAAG;EACrF,IAAI,CAAC,MAAM,gBAAgB,SAAS,MAAM,GACxC,MAAM,IAAI,gBACR,wEAAwE,OAAO,EACjF;EAEF,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GACtC,MAAM,IAAI,gBACR,0DAA0D,OAAO,8BACnE;CAEJ;AACF;AAEA,SAAS,kBACP,WACA,eACA,gBACA,qBACM;CACN,eAAe,UAAU,aAAa,aAAa;CACnD,eAAe,UAAU,aAAa,8BAA8B,UAAU,YAAY,EAAE;CAC5F,IAAI,CAAC,OAAO,UAAU,UAAU,aAAa,KAAK,UAAU,gBAAgB,GAC1E,MAAM,IAAI,gBACR,iEAAiE,UAAU,YAAY,iCACzF;CAEF,aAAa,UAAU,cAAc,+BAA+B,UAAU,YAAY,EAAE;CAC5F,KAAK,MAAM,eAAe,UAAU,cAClC,IAAI,CAAC,cAAc,IAAI,WAAW,GAChC,MAAM,IAAI,gBACR,+CAA+C,UAAU,YAAY,6BAA6B,YAAY,EAChH;CAGJ,MAAM,YAAY,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,MAC3C,MAAM,UAAU,eAAe,IAAI,IAAI,IAAK,eAAe,IAAI,KAAK,CACvE;CACA,IAAI,CAAC,YAAY,UAAU,cAAc,SAAS,GAChD,MAAM,IAAI,gBACR,+CAA+C,UAAU,YAAY,wCACvE;CAEF,IAAI,UAAU,gBAAgB,uBAAuB,UAAU,aAAa,WAAW,GACrF,MAAM,IAAI,gBACR,mDAAmD,oBAAoB,2BACzE;AAEJ;AAEA,SAAS,YACP,OACA,KACA,WACM;CACN,IAAI,CAAC,YAAY,IAAI,cAAc,UAAU,YAAY,GACvD,MAAM,IAAI,gBACR,yCAAyC,IAAI,YAAY,GAAG,IAAI,OAAO,0CACzE;CAEF,IAAI,CAAC;EAAC;EAAY;EAAW;CAAS,CAAC,CAAC,SAAS,IAAI,YAAY,GAC/D,MAAM,IAAI,gBACR,yCAAyC,IAAI,YAAY,GAAG,IAAI,OAAO,8BAA8B,OAAO,IAAI,YAAY,EAAE,EAChI;CAEF,IAAI,IAAI,iBAAiB,YAAY;EACnC,IAAI,OAAO,IAAI,SAAS,aAAa,CAAC,OAAO,SAAS,IAAI,KAAK,GAC7D,MAAM,IAAI,gBACR,kDAAkD,IAAI,YAAY,GAAG,IAAI,OAAO,yCAClF;EAEF,IAAI,IAAI,iBAAiB,MACvB,MAAM,IAAI,gBACR,kDAAkD,IAAI,YAAY,GAAG,IAAI,OAAO,4BAClF;CAEJ,OAAO;EACL,IAAI,IAAI,SAAS,QAAQ,IAAI,UAAU,MACrC,MAAM,IAAI,gBACR,oCAAoC,IAAI,aAAa,QAAQ,IAAI,YAAY,GAAG,IAAI,OAAO,+BAC7F;EAEF,IAAI,OAAO,IAAI,iBAAiB,YAAY,IAAI,aAAa,KAAK,MAAM,IACtE,MAAM,IAAI,gBACR,oCAAoC,IAAI,aAAa,QAAQ,IAAI,YAAY,GAAG,IAAI,OAAO,wBAC7F;CAEJ;CACA,eACE,MAAM,iBACN,OAAO,KAAK,IAAI,IAAI,GACpB,sBAAsB,IAAI,YAAY,GAAG,IAAI,OAAO,IACpD,iBACF;CACA,KAAK,MAAM,UAAU,MAAM,iBAAiB;EAC1C,MAAM,QAAQ,IAAI,KAAK;EACvB,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GAC9E,MAAM,IAAI,gBACR,6DAA6D,OAAO,YAC9D,IAAI,YAAY,GAAG,IAAI,OAAO,yDACtC;CAEJ;CACA,MAAM,sBAAsB,YAC1B,IAAI,oBACH,aAAa,SAAS,aACvB,6BAA6B,IAAI,YAAY,GAAG,IAAI,OAAO,EAC7D;CACA,eACE,UAAU,cACV,oBAAoB,KAAK,GACzB,6BAA6B,IAAI,YAAY,GAAG,IAAI,OAAO,IAC3D,sBACF;CACA,KAAK,MAAM,YAAY,oBAAoB,OAAO,GAAG;EACnD,eAAe,SAAS,OAAO,SAAS,GAAG;EAC3C,eAAe,SAAS,gBAAgB,kBAAkB,GAAG;EAC7D,IAAI,SAAS,mBAAmB,QAAQ,SAAS,UAAU,MACzD,MAAM,IAAI,gBACR,2FACM,SAAS,YAAY,YAAY,IAAI,YAAY,GAAG,IAAI,OAAO,EACvE;CAEJ;AACF;AAEA,SAAS,eACP,OACA,OACA,KACM;CACN,IAAI,UAAU,QAAQ,UAAU,SAAS,UAAU,MACjD,MAAM,IAAI,gBACR,oCAAoC,MAAM,WAAW,IAAI,YAAY,GAAG,IAAI,OAAO,0BACrF;AAEJ;AAEA,SAAS,YACP,OACA,IACA,OACgB;CAChB,MAAM,yBAAS,IAAI,IAAe;CAClC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAM,GAAG,IAAI;EACnB,eAAe,KAAK,GAAG,MAAM,IAAI;EACjC,IAAI,OAAO,IAAI,GAAG,GAChB,MAAM,IAAI,gBAAgB,8CAA8C,MAAM,OAAO,IAAI,EAAE;EAE7F,OAAO,IAAI,KAAK,IAAI;CACtB;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,QAA2B,OAAqB;CAC5E,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,gBAAgB,oCAAoC,MAAM,UAAU;CAEhF,aAAa,QAAQ,KAAK;CAC1B,KAAK,MAAM,SAAS,QAAQ,eAAe,OAAO,KAAK;AACzD;AAEA,SAAS,aAAa,QAA2B,OAAqB;CACpE,IAAI,IAAI,IAAI,MAAM,CAAC,CAAC,SAAS,OAAO,QAClC,MAAM,IAAI,gBAAgB,oCAAoC,MAAM,qBAAqB;AAE7F;AAEA,SAAS,eAAe,OAAe,OAAqB;CAC1D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAChD,MAAM,IAAI,gBACR,oCAAoC,MAAM,4BAC5C;AAEJ;AAEA,SAAS,eACP,UACA,gBACA,aACA,eACM;CACN,MAAM,SAAS,CAAC,GAAG,cAAc;CACjC,MAAM,cAAc,IAAI,IAAI,QAAQ;CACpC,MAAM,YAAY,IAAI,IAAI,MAAM;CAChC,MAAM,UAAU,SAAS,QAAQ,UAAU,CAAC,UAAU,IAAI,KAAK,CAAC;CAChE,MAAM,QAAQ,OAAO,QAAQ,UAAU,CAAC,YAAY,IAAI,KAAK,CAAC;CAC9D,IAAI,QAAQ,SAAS,KAAK,MAAM,SAAS,KAAK,OAAO,WAAW,SAAS,QACvE,MAAM,IAAI,gBACR,oCAAoC,YAAY,kBAAkB,cAAc,aAClE,QAAQ,KAAK,IAAI,EAAE,YAAY,MAAM,KAAK,IAAI,EAAE,EAChE;AAEJ;AAEA,SAAS,YAAY,MAAyB,OAAmC;CAC/E,OAAO,KAAK,WAAW,MAAM,UAAU,KAAK,OAAO,OAAO,UAAU,UAAU,MAAM,MAAM;AAC5F;;;;;;;;;;;;;AC1YA,SAAgB,gCACd,OACqC;CACrC,MAAM,UAAUA,0BAAiB,KAAK;CACtC,MAAM,WAAW,QAAQ,cAAc,IAAI,MAAM,mBAAmB;CAEpE,MAAM,cAAc,QAAQ,WAAW,KAAK,cAC1C,mBAAmB,SAAS,WAAW,QAAQ,CACjD;CACA,MAAM,kBAAkB,YAAY,MACjC,YAAY,QAAQ,UAAU,gBAAgB,MAAM,mBACvD;CACA,MAAM,YAAY,YAAY,KAAK,YACjC,QAAQ,UAAU,gBAAgB,MAAM,sBACpC,UACA;EACE,GAAG;EACH,aAAa,qBAAqB,SAAS,SAAS,eAAe;CACrE,CACN;CACA,MAAM,cAAc,IAAI,IAAI,UAAU,KAAK,YAAY,CAAC,QAAQ,UAAU,aAAa,OAAO,CAAC,CAAC;CAChG,MAAM,kBAAkB,sBAAsB,SAAS,WAAW;CAClE,MAAM,0BAA0B,8BAA8B,SAAS,WAAW;CAClF,MAAM,WAAW,cAAc,SAAS,aAAa,yBAAyB,eAAe;CAC7F,MAAM,aAAa,iBACjB,SACA,aACA,iBACA,yBACA,QACF;CACA,MAAM,OAAO,QAAQ,WAAW,SAAS,cACvC,MAAM,UAAU,KACb,WAAW,QAAQ,gBAAgB,IAAI,UAAU,WAAW,CAAC,CAAE,IAAI,MAAM,CAC5E,CACF;CAEA,OAAO;EACL,SAAS,CAAC,GAAG,MAAM,SAAS;EAC5B,cAAc,CAAC,GAAG,MAAM,cAAc;EACtC,cAAc,CAAC,GAAG,MAAM,cAAc;EACtC,aAAa,CAAC,GAAG,MAAM,eAAe;EACtC;EACA,iBAAiB,KAAK,QAAQ,QAAQ,IAAI,iBAAiB,SAAS;EACpE,iBAAiB,KAAK,QAAQ,QAAQ,IAAI,iBAAiB,SAAS;EACpE,YAAY;EACZ;EACA;CACF;AACF;AAEA,SAAS,mBACP,SACA,WACA,UAC8B;CAC9B,MAAM,OAAOC,oBAAQ,SAAS,UAAU,WAAW;CAEnD,MAAM,UAAU,iBACd,SACA,MAHmBA,oBAAQ,SAAS,SAAS,WAIlC,GACX,UAAU,gBAAgB,SAAS,WACrC;CACA,MAAM,iBAAiB,KACpB,QAAQ,QAAQ,IAAI,iBAAiB,UAAU,CAAC,CAChD,KAAK,QAAQ,IAAI,KAAe;CACnC,MAAM,QAAQ,OAAO,YACnB,QAAQ,MAAM,gBAAgB,KAAK,WAAW,CAC5C,QACA,aAAa,KAAK,KAAK,QAAQ,IAAI,KAAK,OAAiB,CAAC,CAC5D,CAAC,CACH;CACA,OAAO;EACL;EACA;EACA,OAAO,eAAe,WAAW,IAAI,OAAO,aAAa,cAAc;EACvE;EACA,QAAQ,2BAA2B,MAAM,UAAU,cAAc,OAAO;EACxE,QAAQ,2BAA2B,MAAM,UAAU,cAAc,gBAAgB;EACjF,sBACE,UAAU,gBAAgB,SAAS,cAC/B,OACA,iBAAiB,SAAS,SAAS,aAAa,UAAU,WAAW;EAC3E,aAAa;CACf;AACF;AAEA,SAAS,iBACP,SACA,MACA,cACA,YAC8B;CAC9B,MAAM,kBAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,MAAM,iBAA2B,CAAC;CAClC,MAAM,iBAA2B,CAAC;CAClC,MAAM,iBAA2B,CAAC;CAClC,MAAM,oBAA8B,CAAC;CACrC,MAAM,2BAAqC,CAAC;CAC5C,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,MAAM,UAAU,QAAQ,SAAS;EACnE,MAAM,MAAM,KAAK;EACjB,MAAM,WAAW,aAAa;EAC9B,IAAI,IAAI,iBAAiB,WAAW,eAAe,KAAK,IAAI,MAAM;OAC7D,IAAI,IAAI,iBAAiB,WAAW,eAAe,KAAK,IAAI,MAAM;OAClE,IAAI,IAAI,MAAM,gBAAgB,KAAK,IAAI,MAAM;OAC7C,cAAc,KAAK,IAAI,MAAM;EAElC,IAAI,YAAY;EAChB,IAAI,IAAI,iBAAiB,cAAc,SAAS,iBAAiB,YAC/D,yBAAyB,KAAK,IAAI,MAAM;OACnC,IAAI,IAAI,QAAQ,CAAC,SAAS,MAAM,eAAe,KAAK,IAAI,MAAM;OAChE,IAAI,CAAC,IAAI,QAAQ,SAAS,MAAM,kBAAkB,KAAK,IAAI,MAAM;CACxE;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA,YAAY,eAAe,SAAS,kBAAkB;CACxD;AACF;AAEA,SAAS,2BACP,MACA,cACA,OAC+B;CAC/B,IAAI,aAAa,WAAW,GAC1B,OAAO;EACL,aAAa,CAAC;EACd,oBAAoB,CAAC;EACrB,qBAAqB,CAAC;EACtB,qBAAqB,CAAC;EACtB,mBAAmB,CAAC;CACtB;CAEF,MAAM,cAA+C,aAAa,KAAK,gBAAgB;EACrF,MAAM,kBAA4B,CAAC;EACnC,MAAM,qBAA+B,CAAC;EACtC,MAAM,oBAA8B,CAAC;EACrC,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,QAAQ,cAAc,KAAK,aAAa,KAAK;GACnD,IAAI,UAAU,MAAM,gBAAgB,KAAK,IAAI,MAAM;QAC9C,IAAI,UAAU,OAAO,mBAAmB,KAAK,IAAI,MAAM;QACvD,kBAAkB,KAAK,IAAI,MAAM;EACxC;EACA,OAAO;GAAE;GAAa;GAAiB;GAAoB;EAAkB;CAC/E,CAAC;CACD,MAAM,qBAA+B,CAAC;CACtC,MAAM,sBAAgC,CAAC;CACvC,MAAM,sBAAgC,CAAC;CACvC,MAAM,oBAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,SAAS,aAAa,KAAK,gBAAgB,cAAc,KAAK,aAAa,KAAK,CAAC;EACvF,IAAI,OAAO,MAAM,UAAU,UAAU,IAAI,GAAG,kBAAkB,KAAK,IAAI,MAAM;OACxE,IAAI,OAAO,MAAM,OAAO,GAAG,mBAAmB,KAAK,IAAI,MAAM;OAC7D,IAAI,OAAO,KAAK,OAAO,GAAG,oBAAoB,KAAK,IAAI,MAAM;OAC7D,oBAAoB,KAAK,IAAI,MAAM;CAC1C;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,qBACP,SACA,SACA,UACyB;CACzB,MAAM,UAA6C,CAAC;CACpD,IAAI,QAAQ,QAAQ,eAAe,SAAS,GAAG,QAAQ,KAAK,iBAAiB;CAC7E,IAAI,QAAQ,QAAQ,eAAe,SAAS,GAAG,QAAQ,KAAK,iBAAiB;CAC7E,IAAI,QAAQ,QAAQ,yBAAyB,SAAS,GAAG,QAAQ,KAAK,0BAA0B;CAChG,IAAI,QAAQ,QAAQ,eAAe,UAAU,QAAQ,QAAQ,kBAAkB,QAC7E,QAAQ,KAAK,qCAAqC;CAEpD,iCACE,SACA,QAAQ,QACR,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,iCACE,SACA,QAAQ,QACR,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,IAAI,CAAC,iBAAiB,SAAS,SAAS,QAAQ,GAAG,QAAQ,KAAK,qBAAqB;CACrF,OAAO;EAAE,UAAU,QAAQ,WAAW;EAAG,SAAS,OAAO,OAAO;CAAE;AACpE;AAEA,SAAS,iCACP,SACA,UACA,SACA,iBACA,aACA,kBACM;CACN,IAAI,SAAS,YAAY,MAAM,cAAc,UAAU,gBAAgB,SAAS,OAAO,GACrF,QAAQ,KAAK,WAAW;CAE1B,IACE,mBACA,SAAS,YAAY,MAAM,cAAc,UAAU,kBAAkB,SAAS,CAAC,GAE/E,QAAQ,KAAK,gBAAgB;AAEjC;AAEA,SAAS,sBACP,SACA,aACgC;CAChC,OAAO,CAAC,GAAG,QAAQ,kBAAkB,OAAO,CAAC,CAAC,CAC3C,KAAK,cAAc,YAAY,IAAI,UAAU,WAAW,CAAE,CAAC,CAC3D,QAAQ,YAAY,QAAQ,aAAa,QAAQ,CAAC,CAClD,MAAM,MAAM,UAAU,uBAAuB,SAAS,MAAM,KAAK,CAAC;AACvE;;;;;;AAOA,SAAS,8BACP,SACA,aACgC;CAChC,OAAO,CAAC,GAAG,QAAQ,kBAAkB,OAAO,CAAC,CAAC,CAC3C,KAAK,cAAc,YAAY,IAAI,UAAU,WAAW,CAAE,CAAC,CAC3D,QACE,YACC,QAAQ,QAAQ,kBAAkB,WAAW,KAC7C,QAAQ,aAAa,QAAQ,OAC1B,WAAW,WAAW,qCACzB,CACJ,CAAC,CACA,MAAM,MAAM,UAAU,uBAAuB,SAAS,MAAM,KAAK,CAAC;AACvE;AAEA,SAAS,uBACP,SACA,MACA,OACQ;CACR,MAAM,eAAe,MAAM,QAAQ,aAAa,KAAK,QAAQ;CAC7D,IAAI,iBAAiB,GAAG,OAAO;CAC/B,MAAM,YAAY,MAAM,QAAQ,eAAe,SAAS,KAAK,QAAQ,eAAe;CACpF,IAAI,cAAc,GAAG,OAAO;CAC5B,MAAM,eACJ,KAAK,QAAQ,kBAAkB,SAAS,MAAM,QAAQ,kBAAkB;CAC1E,IAAI,iBAAiB,GAAG,OAAO;CAC/B,KAAK,MAAM,UAAU,QAAQ,MAAM,iBAAiB;EAClD,MAAM,SAAS,KAAK,MAAM,OAAO,CAAE,SAAS,MAAM,MAAM,OAAO,CAAE;EACjE,IAAI,WAAW,GAAG,OAAO;CAC3B;CACA,MAAM,UAAU,KAAK,UAAU,gBAAgB,MAAM,UAAU;CAC/D,IAAI,YAAY,GAAG,OAAO;CAC1B,OACE,QAAQ,eAAe,IAAI,KAAK,UAAU,WAAW,IACrD,QAAQ,eAAe,IAAI,MAAM,UAAU,WAAW;AAE1D;AAEA,SAAS,cACP,SACA,aACA,yBACA,UAC6B;CAC7B,MAAM,sBAAsB,IAAI,IAC9B,wBAAwB,KAAK,YAAY,QAAQ,UAAU,WAAW,CACxE;CACA,MAAM,UAAuC,CAAC;CAC9C,KAAK,IAAI,YAAY,GAAG,YAAY,QAAQ,WAAW,QAAQ,aAC7D,KAAK,IAAI,aAAa,YAAY,GAAG,aAAa,QAAQ,WAAW,QAAQ,cAAc;EACzF,MAAM,gBAAgB,QAAQ,WAAW;EACzC,MAAM,iBAAiB,QAAQ,WAAW;EAC1C,MAAM,aAAa,QAAQ,kBAAkB,IAAI,cAAc,WAAW;EAC1E,MAAM,cAAc,QAAQ,kBAAkB,IAAI,eAAe,WAAW;EAC5E,MAAM,OAAO,QAAQ,sBAAsB,IACzCC,4BAAgB,CAAC,cAAc,aAAa,eAAe,WAAW,CAAC,CACzE;EACA,MAAM,cAAc,YAAY,IAAI,KAAK,WAAW;EACpD,MAAM,cAAc,YAAY,IAAI,WAAW,WAAW;EAC1D,MAAM,eAAe,YAAY,IAAI,YAAY,WAAW;EAC5D,MAAM,iBAA2B,CAAC;EAClC,MAAM,sBAAgC,CAAC;EACvC,KAAK,MAAM,UAAU,QAAQ,MAAM,WAAW;GAC5C,MAAM,UAAUC,mBAAO,SAAS,KAAK,aAAa,MAAM;GACxD,MAAM,UAAUA,mBAAO,SAAS,WAAW,aAAa,MAAM;GAC9D,MAAM,WAAWA,mBAAO,SAAS,YAAY,aAAa,MAAM;GAChE,IAAI,CAAC;IAAC;IAAS;IAAS;GAAQ,CAAC,CAAC,OAAO,QAAQ,IAAI,iBAAiB,UAAU,GAAG;GACnF,IAAI,QAAQ,QAAQ,CAAC,QAAQ,QAAQ,CAAC,SAAS,MAAM,eAAe,KAAK,MAAM;GAC/E,IAAI,CAAC,QAAQ,SAAS,QAAQ,QAAQ,SAAS,OAAO,oBAAoB,KAAK,MAAM;EACvF;EACA,MAAM,4BAGF,CACF,kBAAkB,SAAS,aAAa,WAAW,aAAa,KAAK,WAAW,GAChF,kBAAkB,SAAS,aAAa,YAAY,aAAa,KAAK,WAAW,CACnF;EACA,MAAM,eACJ,uBAAuB,SAAS,aAAa,YAAY,KAAK,IAAI,cAAc;EAClF,MAAM,SAAS,sBACbF,oBAAQ,SAAS,KAAK,WAAW,GACjC,cAAc,aACd,eAAe,aACf,OACF;EACA,MAAM,SAAS,sBACbA,oBAAQ,SAAS,KAAK,WAAW,GACjC,cAAc,aACd,eAAe,aACf,gBACF;EACA,MAAM,gBAAgB,kBACpB,SACA,aACA,UACA,cACA,2BACA,oBAAoB,IAAI,WAAW,WAAW,KAC5C,oBAAoB,IAAI,YAAY,WAAW,GACjD,qBACA,QACA,MACF;EACA,QAAQ,KAAK;GACX,cAAc,CAAC,cAAc,aAAa,eAAe,WAAW;GACpE,oBAAoB,CAAC,WAAW,aAAa,YAAY,WAAW;GACpE,wBAAwB,KAAK;GAC7B,gBAAgB,CAAC,GAAG,YAAY,QAAQ,cAAc;GACtD,mBAAmB,CAAC,GAAG,YAAY,QAAQ,iBAAiB;GAC5D;GACA;GACA;GACA,wBAAwB,cAAc,SAAS,aAAa,QAAQ;GACpE;GACA;GACA,aAAa,kBACX,SACA,SAAS,WACT,CAAC,YAAY,WAAW,GACxB,IACF;GACA;EACF,CAAC;CACH;CAEF,OAAO;AACT;AAEA,SAAS,kBACP,SACA,MACA,UACA,cACA,aACA,mBACA,qBACA,QACA,QAC+B;CAC/B,MAAM,UAAmD,CAAC;CAC1D,IAAI,CAAC,mBAAmB,QAAQ,KAAK,uBAAuB;CAC5D,IACE,KAAK,QAAQ,eAAe,SAAS,KACrC,KAAK,QAAQ,eAAe,SAAS,KACrC,KAAK,QAAQ,yBAAyB,SAAS,GAE/C,QAAQ,KAAK,iBAAiB;CAEhC,IAAI,KAAK,QAAQ,kBAAkB,SAAS,GAAG,QAAQ,KAAK,qBAAqB;CACjF,IAAI,oBAAoB,SAAS,GAAG,QAAQ,KAAK,cAAc;CAI/D,IAHyB,YAAY,MAClC,eAAe,WAAW,0BAA0B,aAAa,UAAU,WAE3D,CAAC,CAAC,YAAY,WAAW,GAAG,QAAQ,KAAK,2BAA2B;CACvF,0BACE,SACA,QACA,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,0BACE,SACA,QACA,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,IAAI,CAAC,iBAAiB,SAAS,MAAM,QAAQ,GAAG,QAAQ,KAAK,qBAAqB;CAClF,OAAO;EACL,YAAY,QAAQ,WAAW;EAC/B,SAAS,OAAO,OAAO;EACvB,yBAAyB,aAAa,UAAU;CAClD;AACF;AAEA,SAAS,0BACP,SACA,UACA,SACA,iBACA,aACA,kBACM;CACN,MAAM,eAAe,SAAS,YAAY,SAAS,SAAS,gBAAgB;CAC5E,MAAM,gBAAgB,SAAS,YAAY,SAAS,SAAS,iBAAiB;CAC9E,IAAI,eAAe,WAAW,gBAAgB,SAAS,QAAQ,KAAK,WAAW;CAC/E,IAAI,mBAAmB,SAAS,kBAAkB,SAAS,GAAG,QAAQ,KAAK,gBAAgB;AAC7F;AAEA,SAAS,kBACP,SACA,UACA,SACA,aAC+B;CAC/B,MAAM,UAAU,QAAQ,MAAM,UAAU,KAAK,WAAW;EACtD,MAAM,cAAcE,mBAAO,SAAS,SAAS,aAAa,MAAM;EAChE,MAAM,aAAa,QAAQ,KAAK,WAAWA,mBAAO,SAAS,OAAO,aAAa,MAAM,CAAC;EACtF,MAAM,iBAAiBA,mBAAO,SAAS,YAAY,aAAa,MAAM;EAEtE,IAAI,CAAC;GADS;GAAa,GAAG;GAAY;EAClC,CAAC,CAAC,OAAO,QAAQ,IAAI,iBAAiB,UAAU,GACtD,OAAO;GAAE;GAAQ,iBAAiB;GAAM,kBAAkB;EAAK;EAEjE,MAAM,eACJ,WAAW,QAAQ,KAAK,QAAQ,MAAM,OAAO,IAAI,IAAI,GAAG,CAAC,KACxD,QAAQ,SAAS,KAAK,OAAO,YAAY,IAAI;EAChD,MAAM,gBACJ,WAAW,QAAQ,KAAK,QAAQ,MAAO,IAAI,OAAkB,CAAC,KAC7D,QAAQ,SAAS,KAAM,YAAY;EACtC,OAAO;GACL;GACA,iBAAiB,OAAO,eAAe,IAAI,IAAI;GAC/C,kBAAmB,eAAe,QAAmB;EACvD;CACF,CAAC;CACD,MAAM,WAAW,QAAQ,QACtB,QACC,IAAI,oBAAoB,QAAQ,IAAI,qBAAqB,IAC7D;CACA,MAAM,mBAAmB,SAAS,KAAK,QAAQ,IAAI,eAAe;CAClE,MAAM,oBAAoB,SAAS,KAAK,QAAQ,IAAI,gBAAgB;CACpE,OAAO;EACL;EACA,GAAG,SAAS;EACZ,UAAU,QAAQ,SAAS,SAAS;EACpC,qBAAqBC,aAAW,gBAAgB;EAChD,sBAAsBA,aAAW,iBAAiB;EAClD,eAAe,qBAAqB,kBAAkB,OAAO;EAC7D,gBAAgB,qBAAqB,mBAAmB,OAAO;CACjE;AACF;AAEA,SAAS,qBACP,cACA,SACA;CACA,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,OAAO,gBAAgB,IAAI,MAAM,aAAa,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,cAAc;EAC3E,GAAG,QAAQ,MAAM;EACjB,WAAW;CACb,CAAC;AACH;AAEA,SAAS,iBACP,SACA,aACA,iBACA,yBACA,UACwB;CACxB,MAAM,oBAAoB,gBAAgB,QAAQ,YAAY;EAC5D,MAAM,cAAc,QAAQ,UAAU,aAAa;EACnD,OAAO,QAAQ,cAAc,IAAI,WAAW,CAAC,CAAE;CACjD,CAAC;CACD,MAAM,UAAsC,kBAAkB,KAAK,SAAS,WAAW;EACrF,MAAM,QAAQ;EACd,aAAa,QAAQ,UAAU;EAC/B,aAAa,QAAQ,UAAU,aAAa;CAC9C,EAAE;CACF,MAAM,OAAO,kBAAkB;CAe/B,OAAO;EAAE,YAdU,OACf;GACE,aAAa,KAAK,UAAU;GAC5B,aAAa,KAAK,UAAU,aAAa;GACzC;EACF,IACA;EAQiB,YAPF,iBAAiB,SAAS,eAOf;EAAG,kBANR,uBACvB,SACA,aACA,yBACA,QAE8C;CAAE;AACpD;AAEA,SAAS,iBACP,SACA,iBACwC;CACxC,IAAI,gBAAgB,WAAW,GAAG,OAAO;CACzC,MAAM,eAAe,gBAClB,KAAK,YAAY,QAAQ,UAAU,aAAa,EAAG,CAAC,CACpD,MAAM,MAAM,UAAU,QAAQ,eAAe,IAAI,IAAI,IAAK,QAAQ,eAAe,IAAI,KAAK,CAAE;CAC/F,MAAM,YAAY,QAAQ,sBAAsB,IAAIF,4BAAgB,YAAY,CAAC;CACjF,IAAI,CAAC,WACH,MAAM,IAAI,gBACR,iDAAiD,aAAa,KAAK,IAAI,EAAE,oBAC3E;CAEF,OAAO;EAAE,aAAa,UAAU;EAAa;CAAa;AAC5D;AAEA,SAAS,uBACP,SACA,aACA,yBACA,UAC8C;CAC9C,MAAM,WAAW,YAAY,IAAI,QAAQ,MAAM,mBAAmB;CAClE,MAAM,mBAAmB,IAAI,IAC3B,SAAS,KAAK,UAAU,CAACA,4BAAgB,MAAM,YAAY,GAAG,KAAK,CAAC,CACtE;CACA,MAAM,QAAQ,SACX,QAAQ,UAAU,MAAM,cAAc,UAAU,CAAC,CACjD,KAAK,UACJ,oBACE,SACA,aACA,yBACA,kBACA,UACA,YAAY,IAAI,MAAM,sBAAsB,CAC9C,CACF;CACF,IAAI,MAAM,WAAW,GAAG,OAAO;CAE/B,MAAM,YAAY,MACf,QAAQ,SAAS,KAAK,SAAS,CAAC,CAChC,MAAM,MAAM,UAAU,wBAAwB,SAAS,aAAa,MAAM,KAAK,CAAC;CACnF,MAAM,UACJ,UAAU,MACV,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,MAAM,UAAU,wBAAwB,SAAS,aAAa,MAAM,KAAK,CAAC,CAAC,CAAC;CAC/F,OAAO;EACL,iBAAiB,QAAQ;EACzB,qBAAqB,QAAQ;EAC7B,sBAAsB,CAAC,GAAG,QAAQ,oBAAoB;EACtD,qBAAqB,UAAU,SAAS,IAAI,QAAQ,sBAAsB;EAC1E,WAAW,UAAU,SAAS;EAC9B,gBAAgB;EAChB,OAAO,QAAQ;CACjB;AACF;AAEA,SAAS,oBACP,SACA,aACA,yBACA,kBACA,UACA,MAC6B;CAC7B,IAAI,UAAU;CACd,IAAI,WAAW,CAAC,GAAG,KAAK,UAAU,YAAY;CAC9C,IAAI,YAAY,wBAAwB,QACrC,YAAY,CAAC,SAAS,SAAS,QAAQ,UAAU,aAAa,EAAG,CACpE;CACA,MAAM,QAAuC,CAAC;CAE9C,OAAO,UAAU,SAAS,GAAG;EAC3B,MAAM,YAAY,UAAU,KAAK,aAC/B,iBACE,SACA,aACA,kBACA,UACA,SACA,UACA,QACF,CACF;EAIA,MAAM,WAHW,UACd,QAAQ,aAAa,SAAS,QAAQ,CAAC,CACvC,MAAM,MAAM,UAAU,yBAAyB,SAAS,aAAa,MAAM,KAAK,CAC3D,CAAC,CAAC;EAC1B,IAAI,UAAU,SAAS,WAAW;EAClC,MAAM,KAAK;GACT,iBAAiB,QAAQ,UAAU;GACnC,sBAAsB,CAAC,GAAG,QAAQ;GAClC,YAAY,UAAU,MACnB,MAAM,UACL,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB,CACxD;GACA,qBAAqB,UAAU,qBAAqB;EACtD,CAAC;EACD,IAAI,CAAC,UAAU,mBAAmB;EAClC,UAAU,YAAY,IAAI,SAAS,iBAAiB;EACpD,WAAW,CAAC,GAAG,QAAQ,UAAU,YAAY;EAC7C,YAAY,UAAU,QACnB,YAAY,QAAQ,UAAU,gBAAgB,SAAS,mBAC1D;CACF;CAEA,MAAM,YAAY,SAAS,UAAU,QAAQ,MAAM,UAAU;CAC7D,OAAO;EACL,iBAAiB,KAAK,UAAU;EAChC,qBAAqB,QAAQ,UAAU;EACvC,sBAAsB;EACtB;EACA;CACF;AACF;AAEA,SAAS,wBACP,SACA,aACA,MACA,OACQ;CACR,MAAM,cAAc,YAAY,IAAI,KAAK,mBAAmB;CAC5D,MAAM,eAAe,YAAY,IAAI,MAAM,mBAAmB;CAC9D,MAAM,eAAe,aAAa,QAAQ,aAAa,YAAY,QAAQ;CAC3E,IAAI,iBAAiB,GAAG,OAAO;CAC/B,MAAM,YACJ,aAAa,QAAQ,eAAe,SAAS,YAAY,QAAQ,eAAe;CAClF,IAAI,cAAc,GAAG,OAAO;CAC5B,MAAM,eACJ,YAAY,QAAQ,kBAAkB,SAAS,aAAa,QAAQ,kBAAkB;CACxF,IAAI,iBAAiB,GAAG,OAAO;CAC/B,KAAK,MAAM,UAAU,QAAQ,MAAM,iBAAiB;EAClD,MAAM,SAAS,YAAY,MAAM,OAAO,CAAE,SAAS,aAAa,MAAM,OAAO,CAAE;EAC/E,IAAI,WAAW,GAAG,OAAO;CAC3B;CACA,MAAM,UAAU,YAAY,UAAU,gBAAgB,aAAa,UAAU;CAC7E,IAAI,YAAY,GAAG,OAAO;CAC1B,MAAM,mBACJ,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;CACtD,IAAI,qBAAqB,GAAG,OAAO;CACnC,OACE,QAAQ,eAAe,IAAI,KAAK,eAAe,IAC/C,QAAQ,eAAe,IAAI,MAAM,eAAe;AAEpD;AAEA,SAAS,iBACP,SACA,aACA,kBACA,UACA,SACA,UACA,UAC8B;CAC9B,MAAM,sBAAsB,SAAS,UAAU,aAAa;CAC5D,MAAM,UAAiD,CAAC;CACxD,KAAK,MAAM,uBAAuB,UAIhC,IAAI,CAHS,iBAAiB,IAC5BA,4BAAgBG,gCAAoB,SAAS,CAAC,qBAAqB,mBAAmB,CAAC,CAAC,CAElF,CAAC,EAAE,cAAc,YAAY,QAAQ,KAAK,mBAAmB;CAEvE,MAAM,mBAAmBA,gCAAoB,SAAS,CAAC,GAAG,UAAU,mBAAmB,CAAC;CACxF,MAAM,SAAS,QAAQ,sBAAsB,IAAIH,4BAAgB,gBAAgB,CAAC;CAClF,IAAI,CAAC,QAAQ;EACX,QAAQ,KAAK,2BAA2B;EACxC,OAAO,sBAAsB,UAAU,qBAAqB,OAAO;CACrE;CACA,MAAM,gBAAgB,YAAY,IAAI,OAAO,WAAW;CACxD,IACE,cAAc,QAAQ,eAAe,SAAS,KAC9C,cAAc,QAAQ,eAAe,SAAS,KAC9C,cAAc,QAAQ,yBAAyB,SAAS,GAExD,QAAQ,KAAK,mBAAmB;CAElC,IAAI,cAAc,QAAQ,kBAAkB,SAAS,GAAG,QAAQ,KAAK,qBAAqB;CAC1F,MAAM,aAAa,kBACjB,SACA,aACA,QAAQ,UAAU,aAClB,OAAO,WACT;CACA,IAAI,WAAW,YAAY,WAAW,GAAG,QAAQ,KAAK,2BAA2B;CACjF,IAAI,WAAW,kBAAkB,SAAS,GAAG,QAAQ,KAAK,wBAAwB;CAClF,4BACE,SACA,cAAc,QACd,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,4BACE,SACA,cAAc,QACd,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,IAAI,CAAC,iBAAiB,SAAS,eAAe,QAAQ,GAAG,QAAQ,KAAK,qBAAqB;CAC3F,OAAO;EACL,qBAAqB,SAAS,UAAU;EACxC;EACA,mBAAmB,OAAO;EAC1B,8BAA8B,WAAW;EACzC,8BAA8B,WAAW;EACzC,uBAAuB,OAAO,YAC5B,QAAQ,MAAM,gBAAgB,KAAK,WAAW,CAC5C,QACA,cAAc,MAAM,OAAO,CAAE,SAAS,QAAQ,MAAM,OAAO,CAAE,MAC/D,CAAC,CACH;EACA,UAAU,QAAQ,WAAW;EAC7B,UAAU;EACV,SAAS,OAAO,OAAO;CACzB;AACF;AAEA,SAAS,sBACP,UACA,qBACA,SAC8B;CAC9B,OAAO;EACL,qBAAqB,SAAS,UAAU;EACxC;EACA,mBAAmB;EACnB,8BAA8B,CAAC;EAC/B,8BAA8B,CAAC;EAC/B,uBAAuB;EACvB,UAAU;EACV,UAAU;EACV,SAAS,OAAO,OAAO;CACzB;AACF;AAEA,SAAS,4BACP,SACA,UACA,SACA,iBACA,aACA,kBACM;CACN,IAAI,SAAS,YAAY,MAAM,cAAc,UAAU,gBAAgB,SAAS,OAAO,GACrF,QAAQ,KAAK,WAAW;CAE1B,IACE,mBACA,SAAS,YAAY,MAAM,cAAc,UAAU,kBAAkB,SAAS,CAAC,GAE/E,QAAQ,KAAK,gBAAgB;AAEjC;AAEA,SAAS,yBACP,SACA,aACA,MACA,OACQ;CACR,MAAM,SACJ,MAAM,6BAA6B,SAAS,KAAK,6BAA6B;CAChF,IAAI,WAAW,GAAG,OAAO;CACzB,KAAK,MAAM,UAAU,QAAQ,MAAM,iBAAiB;EAClD,MAAM,SAAS,KAAK,sBAAuB,UAAW,MAAM,sBAAuB;EACnF,IAAI,WAAW,GAAG,OAAO;CAC3B;CAGA,MAAM,UAFY,YAAY,IAAI,KAAK,mBAAmB,CAAC,CAAE,UAAU,gBACpD,YAAY,IAAI,MAAM,mBAAmB,CAAC,CAAE,UAAU;CAEzE,IAAI,YAAY,GAAG,OAAO;CAC1B,OACE,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;AAExD;AAEA,SAAS,kBACP,SACA,aACA,uBACA,sBACiC;CACjC,MAAM,cAAwB,CAAC;CAC/B,MAAM,oBAA8B,CAAC;CACrC,MAAM,iBAA2B,CAAC;CAClC,KAAK,MAAM,UAAU,QAAQ,MAAM,WAAW;EAC5C,MAAM,aAAaC,mBAAO,SAAS,uBAAuB,MAAM;EAChE,MAAM,YAAYA,mBAAO,SAAS,sBAAsB,MAAM;EAC9D,IAAI,WAAW,iBAAiB,cAAc,UAAU,iBAAiB,YACvE,eAAe,KAAK,MAAM;OACrB,IAAI,UAAU,QAAQ,CAAC,WAAW,MAAM,YAAY,KAAK,MAAM;OACjE,IAAI,CAAC,UAAU,QAAQ,WAAW,MAAM,kBAAkB,KAAK,MAAM;CAC5E;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,QAAQ,iBAAiB,SAAS,uBAAuB,oBAAoB;EAC7E,cAAc,cACZ,SACA,YAAY,IAAI,oBAAoB,GACpC,YAAY,IAAI,qBAAqB,CACvC;CACF;AACF;AAEA,SAAS,iBACP,SACA,uBACA,sBACsB;CACtB,MAAM,OAAuB,CAAC;CAC9B,KAAK,MAAM,UAAU,QAAQ,MAAM,WAAW;EAC5C,KAAK,KAAK,eAAe,SAASA,mBAAO,SAAS,uBAAuB,MAAM,CAAC,CAAC;EACjF,KAAK,KAAK,eAAe,SAASA,mBAAO,SAAS,sBAAsB,MAAM,CAAC,CAAC;CAClF;CACA,OAAO,kBAAkB,MAAM;EAC7B,aAAa;EACb,cAAc;EACd,aAAa,CAAC,SAAS,GAAG,QAAQ,MAAM,eAAe;EACvD,WAAW;GAAE,GAAG,QAAQ,MAAM;GAAW,WAAW;EAAO;CAC7D,CAAC;AACH;AAEA,SAAS,eACP,SACA,KACc;CACd,MAAM,UAAkC,OAAO,YAC7C,QAAQ,MAAM,gBAAgB,KAAK,WAAW,CAAC,QAAQ,IAAI,KAAK,OAAiB,CAAC,CACpF;CACA,IAAI,IAAI,iBAAiB,YAAY,QAAQ,QAAQ,IAAI;CACzD,OAAO;EACL,SAAS,IAAI;EACb,KAAK,IAAI;EACT,GAAI,IAAI,iBAAiB,aAAa,EAAE,MAAM,IAAI,KAAgB,IAAI,CAAC;EACvE;CACF;AACF;AAEA,SAAS,sBACP,MACA,iBACA,kBACA,OAC0B;CAC1B,MAAM,cAAwB,CAAC;CAC/B,MAAM,kBAA4B,CAAC;CACnC,MAAM,mBAA6B,CAAC;CACpC,MAAM,iBAA2B,CAAC;CAClC,MAAM,oBAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,OAAO,cAAc,KAAK,iBAAiB,KAAK;EACtD,MAAM,QAAQ,cAAc,KAAK,kBAAkB,KAAK;EACxD,IAAI,SAAS,QAAQ,UAAU,MAAM,kBAAkB,KAAK,IAAI,MAAM;OACjE,IAAI,QAAQ,OAAO,YAAY,KAAK,IAAI,MAAM;OAC9C,IAAI,MAAM,gBAAgB,KAAK,IAAI,MAAM;OACzC,IAAI,OAAO,iBAAiB,KAAK,IAAI,MAAM;OAC3C,eAAe,KAAK,IAAI,MAAM;CACrC;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,cACP,SACA,WACA,YAC0C;CAC1C,OAAO,OAAO,YACZ,QAAQ,MAAM,gBAAgB,KAAK,WAAW;EAC5C,MAAM,kBAAkB,UAAU,MAAM,OAAO,CAAE;EACjD,MAAM,mBAAmB,WAAW,MAAM,OAAO,CAAE;EACnD,OAAO,CACL,QACA;GACE;GACA;GACA,aAAa,kBAAkB;GAC/B,aACE,qBAAqB,IACjB,oBAAoB,IAClB,IACA,OACF,kBAAkB;EAC1B,CACF;CACF,CAAC,CACH;AACF;AAEA,SAAS,iBACP,SACA,WACA,UACS;CACT,MAAM,WAAW,cAAc,SAAS,WAAW,QAAQ;CAC3D,OAAO,OAAO,QAAQ,QAAQ,MAAM,UAAU,gCAAgC,CAAC,CAAC,OAC7E,CAAC,QAAQ,WAAW;EACnB,MAAM,QAAQ,SAAS,OAAO,CAAE;EAChC,OAAO,UAAU,QAAQ,SAAS;CACpC,CACF;AACF;AAEA,SAAS,aAAa,QAA4C;CAChE,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,MAAM,UAAU,OAAO,KAAK;CAC7D,MAAM,QAAQ,OAAO,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC;CAC1D,MAAM,SAAS,KAAK,MAAM,OAAO,SAAS,CAAC;CAC3C,MAAM,SACJ,OAAO,SAAS,MAAM,IAAI,OAAO,WAAY,OAAO,SAAS,KAAM,OAAO,WAAY;CACxF,OAAO;EACL,GAAG,OAAO;EACV,KAAK,OAAO;EACZ;EACA,MAAM,QAAQ,OAAO;EACrB,KAAK,OAAO,OAAO,SAAS;EAC5B;CACF;AACF;AAEA,SAAS,cACP,KACA,aACA,OACgB;CAChB,OAAO,IAAI,kBAAkB,MAAM,aAAa,SAAS,gBAAgB,WAAW,CAAC,CAAE;AACzF;AAEA,SAASC,aAAW,QAAiC;CACnD,OAAO,OAAO,WAAW,IAAI,OAAO,OAAO,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAC7F;AAEA,SAAS,OAAU,QAAkB;CACnC,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AAC5B;;;;AC77BA,SAAgB,qBAAqB,UAA4B;CAC/D,MAAM,OAAO,QAAQ,QAAQ;CAC7B,IAAI,CAAC,WAAW,IAAI,GAAG,MAAM,IAAI,MAAM,6CAA6C,MAAM;CAE1F,MAAM,WAAqB,CAAC;CAC5B,MAAM,QAAQ,KAAa,OAAO,OAAO;EACvC,KAAK,MAAM,SAAS,YAAY,GAAG,CAAC,CAAC,KAAK,GAAG;GAC3C,IAAI,MAAM,WAAW,GAAG,KAAK,UAAU,gBAAgB;GACvD,MAAM,WAAW,KAAK,KAAK,KAAK;GAChC,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC,YAAY,GAAG;GAEvC,MAAM,OAAO,OAAO,GAAG,KAAK,GAAG,UAAU;GACzC,IAAI,oBAAoB,UAAU,WAAW,GAC3C,SAAS,KAAK,IAAI;QAElB,KAAK,UAAU,IAAI;EAEvB;CACF;CAEA,KAAK,IAAI;CACT,OAAO;AACT;;;;;AAMA,SAAgB,gBACd,UACA,MACA,UAAkC,CAAC,GACtB;CACb,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,cAAc,QAAQ,MAAM,IAAI;CACtC,aAAa,MAAM,aAAa,IAAI;CAEpC,IAAI,CAAC,WAAW,WAAW,KAAK,CAAC,SAAS,WAAW,CAAC,CAAC,YAAY,GACjE,MAAM,IAAI,MAAM,uCAAuC,MAAM;CAE/D,IAAI,CAAC,oBAAoB,aAAa,WAAW,GAC/C,MAAM,IAAI,MAAM,oBAAoB,KAAK,iCAAiC;CAG5E,MAAM,aAAa,KAAK,aAAa,WAAW;CAChD,MAAM,WAAW,gBAAgB,WAAW;CAC5C,MAAM,kBAAkB,oBAAoB,aAAa,cAAc,IACnE,KAAK,aAAa,cAAc,IAChC,KAAA;CAEJ,IAAI,eAAe,QAAQ;EACzB,IAAI,CAAC,UACH,MAAM,IAAI,MAAM,oBAAoB,KAAK,2CAA2C;EACtF,IAAI,CAAC,iBACH,MAAM,IAAI,MAAM,oBAAoB,KAAK,oCAAoC;EAC/E,oBAAoB,iBAAiB,IAAI;CAC3C;CAEA,MAAM,QAAQ,oBAAoB,WAAW;CAC7C,OAAO;EACL;EACA,MAAM;EACN;EACA;EACA;EACA,QAAQ,aAAa,YAAY,MAAM;EACvC;EACA,aAAa,YAAY;GACvB;GACA,QAAQ,QAAQ,qBAAqB;EACvC,CAAC;CACH;AACF;;AAGA,SAAgB,yBACd,UACA,UAA2C,CAAC,GACrB;CAEvB,QADc,QAAQ,SAAS,qBAAqB,QAAQ,EAAA,CAC/C,KAAK,SAAS;EACzB,MAAM,UAAU,gBAAgB,UAAU,MAAM,OAAO;EACvD,OAAO;GACL,IAAI,QAAQ;GACZ,MAAM;GACN,MAAM,CAAC,cAAc;GACrB,aAAa,QAAQ;GACrB,aAAa,QAAQ;GACrB,YAAY,QAAQ;GACpB,UAAU,QAAQ;GAClB,iBAAiB,QAAQ;GACzB,QAAQ,QAAQ;GAChB,aAAa,QAAQ;EACvB;CACF,CAAC;AACH;;;;;AAMA,SAAgB,mBACd,SACoB;CACpB,MAAM,YAAY,yBAAyB,QAAQ,UAAU;EAC3D,OAAO,QAAQ;EACf,YAAY,QAAQ;EACpB,mBAAmB,QAAQ;CAC7B,CAAC;CAYD,OAAO;EACL,GAZW,gBAAgD;GAC3D;GACA,aAAa,QAAQ,eAAe;GACpC,QAAQ,QAAQ;GAChB,MAAM,QAAQ;GACd,MAAM,QAAQ;GACd,WAAW,QAAQ;GACnB,QAAQ,QAAQ;GAChB,SAAS,QAAQ;EACnB,CAGQ;EACN,UAAU,UAAU,KAAK,cAAc;GACrC,aAAa,SAAS;GACtB,aAAa,SAAS;GACtB,aAAa,SAAS;EACxB,EAAE;CACJ;AACF;AAEA,SAAS,oBAAoB,SAAiB,UAA2B;CACvE,IAAI;EACF,OAAO,YAAY,OAAO,CAAC,CAAC,SAAS,QAAQ;CAC/C,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,gBAAgB,aAAyC;CAChE,IAAI,oBAAoB,aAAa,SAAS,GAAG,OAAO,KAAK,aAAa,SAAS;CACnF,IAAI,oBAAoB,aAAa,UAAU,GAAG,OAAO,KAAK,aAAa,UAAU;AAEvF;AAEA,SAAS,oBAAoB,iBAAyB,MAAoB;CACxE,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,aAAa,iBAAiB,MAAM,CAAC;CAC3D,SAAS,KAAK;EACZ,MAAM,IAAI,MACR,oBAAoB,KAAK,iCAAiC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAC3G;CACF;CAEA,IACE,OAAO,WAAW,YAClB,WAAW,QACV,OAA8B,SAAS,UAExC,MAAM,IAAI,MAAM,oBAAoB,KAAK,wCAAwC;AAErF;AAEA,SAAS,oBAAoB,aAAqB,OAAO,IAAuB;CAC9E,MAAM,QAA2B,CAAC;CAClC,KAAK,MAAM,SAAS,YAAY,KAAK,aAAa,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;EAC/D,IAAI,UAAU,kBAAkB,UAAU,QAAQ;EAClD,MAAM,eAAe,OAAO,GAAG,KAAK,GAAG,UAAU;EACjD,MAAM,WAAW,KAAK,aAAa,YAAY;EAE/C,IADa,SAAS,QACf,CAAC,CAAC,YAAY,GAAG;GACtB,MAAM,KAAK,GAAG,oBAAoB,aAAa,YAAY,CAAC;GAC5D;EACF;EACA,MAAM,QAAQ,aAAa,QAAQ;EACnC,MAAM,KAAK;GACT,MAAM;GACN,QAAQ,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK;GACvD,OAAO,MAAM;EACf,CAAC;CACH;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAc,QAAgB,OAAqB;CACvE,MAAM,MAAM,SAAS,MAAM,MAAM;CACjC,IAAI,QAAQ,MAAO,CAAC,IAAI,WAAW,IAAI,KAAK,CAAC,WAAW,GAAG,GAAI;CAC/D,MAAM,IAAI,MAAM,mDAAmD,OAAO;AAC5E;;;;AC3NA,SAASE,OAAK,IAAsB;CAClC,OAAO,GAAG,WAAW,IAAI,IAAI,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;;AAGA,SAAS,WACP,KACA,UACA,aAC6B;CAC7B,MAAM,SAAS,YAAY,KAAc,UAAmB,cAAc,MAAM,EAAE,SAAS;CAC3F,MAAM,SAAS,OAAO,MAAM,KAAK,GAAG,MAAM,KAAK,OAAO,OAAO,MAAM,EAAE;CACrE,OAAO;EAAE,MAAMA,OAAK,MAAM;EAAG,GAAG,OAAO;CAAO;AAChD;;;;;AAMA,SAAgB,mBACd,SAC4B;CAC5B,MAAM,wBAAwB,QAAQ,yBAAyB;CAC/D,OAAO;EACL,MAAM;EACN,MAAM,OAAO,KAA6D;GACxE,IAAI,CAAC,IAAI,qBACP,MAAM,IAAI,MACR,4GACF;GAEF,IAAI,CAAC,IAAI,wBACP,MAAM,IAAI,MACR,6NACF;GAEF,MAAM,cAAc,IAAI,IAAI,QAAQ,UAAU,KAAK,MAAM,EAAE,EAAE,CAAC;GAC9D,MAAM,OAAO,WACX,IAAI,aACJ,IAAI,qBACJ,WACF;GACA,MAAM,OAAO,WACX,IAAI,wBACJ,IAAI,qBACJ,WACF;GAKA,IAAI,KAAK,QAAQ,GACf,OAAO;IACL,UAAU;IACV,SAAS,CACP,2CAA2C,KAAK,KAAK,QAAQ,CAAC,EAAE,gDAClE;IACA,mBAAmB,CACjB;KACE,MAAM;KACN,QAAQ;KACR,QAAQ;MAAE,eAAe,KAAK;MAAM,iBAAiB,KAAK;MAAM,GAAG,KAAK;KAAE;IAC5E,CACF;IACA,OAAO,KAAK;GACd;GAGF,MAAM,qBAAqB,KAAK,OAAO,KAAK;GAC5C,MAAM,SAAS,qBAAqB;GACpC,MAAM,OAAO,qBAAqB,IAAA,CAAK,QAAQ,CAAC;GAChD,OAAO;IACL,UAAU,SAAS,SAAS;IAC5B,SAAS,SACL,CACE,kEAAkE,IAAI,oBAAoB,wBAAwB,IAAA,CAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,GAChN,IACA,CACE,4FAA4F,IAAI,oBAAoB,wBAAwB,IAAA,CAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,GAC1O;IACJ,mBAAmB,CACjB;KACE,MAAM;KACN,QAAQ,SAAS,SAAS;KAC1B,QAAQ;MACN,eAAe,KAAK;MACpB,iBAAiB,KAAK;MACtB;MACA;MACA,GAAG,KAAK;KACV;IACF,CACF;IACA,OAAO,KAAK;GACd;EACF;CACF;AACF;;;;;;;;;ACtEA,SAAgB,oBACd,UACA,OAAmC,CAAC,GACf;CACrB,MAAM,gBAAgB,KAAK,iBAAiB;CAC5C,MAAM,YAAY,KAAK,qBAAqB;CAC5C,MAAM,WAAW,SAA4C;EAC3D,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,KAAK,UAAU;GACxB,IAAI,SAAS,EAAE,SAAS,eAAe;GACvC,KAAK,MAAM,KAAK,EAAE,OAChB,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,IAAI,GAAG;IAC3C,MAAM,MAAM,QAAQ,IAAI,CAAC,qBAAK,IAAI,IAAY;IAC9C,IAAI,IAAI,OAAO,CAAC,CAAC;IACjB,QAAQ,IAAI,GAAG,GAAG;GACpB;EAEJ;EACA,OAAO;CACT;CACA,MAAM,UAAU,QAAQ,IAAI;CAC5B,MAAM,UAAU,QAAQ,KAAK;CAC7B,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,yBAAS,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,GAAG;EACnE,MAAM,KAAK,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,CAAC,MAAM,GAAG,SAAS;EAC7D,MAAM,KAAK,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,CAAC,MAAM,GAAG,SAAS;EAC7D,MAAM,UAAU,SAAoB,KAAK,SAAS,KAAK,UAAU,IAAI,IAAI;EACzE,MAAM,KAAK,KAAK,MAAM,oBAAoB,OAAO,EAAE,EAAE,qBAAqB,OAAO,EAAE,GAAG;CACxF;CACA,MAAM,SAAS,MAA6C;EAC1D,MAAM,sBAAM,IAAI,IAAY;EAC5B,KAAK,MAAM,QAAQ,EAAE,OAAO,GAAG,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,EAAE,YAAY,CAAC;EAC5E,OAAO;CACT;CACA,OAAO;EACL,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,eAAe,MAAM,OAAO;EAC5B,eAAe,MAAM,OAAO;CAC9B;AACF;;;;;;;;AAgBA,SAAgB,2BACd,MACA,MACyB;CACzB,MAAM,6BAAa,IAAI,IAAY;CACnC,KAAK,MAAM,KAAK,KAAK,SAAS,0BAA0B,GAAG;EACzD,MAAM,IAAK,EAAE,EAAE,CAAY,YAAY;EACvC,IAAI,CAAC,KAAK,cAAc,IAAI,CAAC,GAAG,WAAW,IAAI,CAAC;CAClD;CACA,MAAM,MAAM,CAAC,GAAG,UAAU;CAC1B,OAAO;EACL,YAAY;EACZ,SAAS,IAAI,QAAQ,MAAM,KAAK,cAAc,IAAI,CAAC,CAAC;CACtD;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AChFA,IAAa,4BAAb,cAA+C,MAAM;CAEjC;CADlB,YACE,MACA,SACA;EACA,MAAM,OAAO;EAHG,KAAA,OAAA;EAIhB,KAAK,OAAO;CACd;AACF;;;;;AAYA,IAAa,yBAAb,MAAoE;CAIrC;CAH7B;CACA,6BAA8B,IAAI,IAA4B;CAE9D,YAAY,SAAyD;EAAxC,KAAA,UAAA;EAC3B,IAAI,CAAC,WAAW,QAAQ,IAAI,GAAG,UAAU,QAAQ,MAAM,EAAE,WAAW,KAAK,CAAC;EAC1E,KAAK,MAAM,QAAQ,OAAO,KAAK;CACjC;CAEA,MAAM,QAAQ,OAA4C;EACxD,KAAK,iBAAiB,KAAK;EAC3B,KAAK,gBAAgB,KAAK;EAC1B,MAAM,SAAS,KAAK,SAAS,KAAK;EAMlC,WALa,KAAK,cAAc,MAAM,MAKxB,GAAG,GAJD,KAAK,UAAU,MAAM,EAAE,GAIlB;CACvB;CAEA,MAAM,OAAO,MAAmE;EAC9E,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,0BACR,kBACA,0FACF;EAEF,IAAI,CAAC,KAAK,gBACR,MAAM,IAAI,0BACR,2BACA,wFACF;EAGF,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,UAAU,aAAa;GAGhC,IAAI,KAAK,UAAU,WAAW,WAAW,oBAEnC;QAAA,CADa,qBAAqB,KAAK,QAAQ,QAAQ,kBAC/C,GAAG;GAAA;GAEjB,MAAM,OAAO,KAAK,cAAc,MAAM;GACtC,IAAI,CAAC,WAAW,IAAI,GAAG;GACvB,MAAM,QAAQ,aAAa,MAAM,MAAM,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO;GACnE,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI;IACJ,IAAI;KACF,SAAS,KAAK,MAAM,IAAI;IAC1B,QAAQ;KACN;IACF;IACA,IAAI,CAAC,cAAc,QAAQ,MAAM,MAAM,GAAG;IAC1C,IAAI,KAAK,MAAM;GACjB;EACF;EAGA,IAAI,MAAM,GAAG,MAAM;GACjB,IAAI,EAAE,eAAe,EAAE,YAAY,OAAO,iBAAiB,EAAE,YAAY,EAAE,UAAU;GACrF,OAAO,iBAAiB,EAAE,YAAY,EAAE,UAAU;EACpD,CAAC;EAED,OAAO,IAAI,MAAM,GAAG,KAAK,KAAK;CAChC;CAEA,MAAM,OAKH;EACD,MAAM,WAAmC,CAAC;EAC1C,MAAM,UAAsC;GAC1C,YAAY;GACZ,mBAAmB;GACnB,eAAe;EACjB;EACA,IAAI,QAAQ;EACZ,KAAK,MAAM,UAAU,aAAa;GAChC,MAAM,OAAO,KAAK,cAAc,MAAM;GACtC,IAAI,CAAC,WAAW,IAAI,GAAG;IACrB,SAAS,UAAU;IACnB;GACF;GACA,MAAM,QAAQ,aAAa,MAAM,MAAM,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO;GACnE,SAAS,UAAU,MAAM;GACzB,SAAS,MAAM;GACf,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,QAAoB;IACxB,IAAI;KACF,QAAS,KAAK,MAAM,IAAI,CAAC,CAA2B,cAAc;IACpE,QAAQ,CAER;IACA,QAAQ,UAAU;GACpB;EACF;EAIA,OAAO;GAAE,OAAO;GAAO,MAAM;GAAO;GAAU;EAAQ;CACxD;CAEA,iBAAyB,OAAmC;EAC1D,IAAI,CAAC,MAAM,QACT,MAAM,IAAI,0BACR,kBACA,wCACF;EAEF,IAAI,CAAC,MAAM,qBAAqB,MAAM,kBAAkB,WAAW,GACjE,MAAM,IAAI,0BACR,0BACA,kFACF;EAEF,IAAI,CAAC,MAAM,YACT,MAAM,IAAI,0BACR,uBACA,0DACF;EAEF,IAAI,CAAC,MAAM,iBACT,MAAM,IAAI,0BACR,4BACA,mHACF;EAEF,IAAI,CAAC,YAAY,SAAS,MAAM,MAAM,GACpC,MAAM,IAAI,0BACR,kBACA,+CAA+C,YAAY,KAAK,IAAI,GACtE;CAEJ;CAEA,gBAAwB,OAAmC;EACzD,MAAM,MAAM,KAAK,QAAQ;EACzB,IAAI,CAAC,OAAO,CAAC,MAAM,iBAAiB;EACpC,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,WAAW;EACjB,IAAI,QAAQ,KAAK,WAAW,IAAI,MAAM,eAAe;EACrD,IAAI,CAAC,SAAS,MAAM,MAAM,iBAAiB,UAAU;GACnD,QAAQ;IAAE,QAAQ,MAAM;IAAiB,eAAe;IAAK,OAAO;GAAE;GACtE,KAAK,WAAW,IAAI,MAAM,iBAAiB,KAAK;EAClD;EACA,IAAI,MAAM,SAAS,KACjB,MAAM,IAAI,0BACR,uBACA,gCAAgC,MAAM,gBAAgB,YAAY,IAAI,YACxE;EAEF,MAAM,SAAS;CACjB;CAEA,SAAiB,OAAoD;EACnE,MAAM,aAAaC,SACjB,KAAK,UAAU;GACb,IAAI,MAAM,SAAS;GACnB,KAAK,MAAM;GACX,IAAI,MAAM;GACV,KAAK,MAAM;EACb,CAAC,CACH;EAGA,OAAO;GACL,GAAG;GACH;GACA,OAAO;EACT;CACF;CAEA,cAAsB,QAAwB;EAC5C,OAAO,KAAK,KAAK,QAAQ,MAAM,GAAG,OAAO,OAAO;CAClD;AACF;AAEA,MAAM,cAAgD;CACpD;CACA;CACA;CACA;CACA;AACF;AAEA,SAAS,qBACP,QACA,QACS;CACT,IAAI,CAAC,QAAQ,OAAO;CACpB,IAAI,MAAM,QAAQ,MAAM,GAAG,OAAO,OAAO,SAAS,MAAM;CACxD,OAAO,WAAW;AACpB;AAEA,SAAS,cACP,QACA,MACA,QACS;CAET,IAAI,KAAK,UAAU,WAAW,OAAO,cAAc,KAAK,gBAAgB,OAAO;CAC/E,IAAI,KAAK,UAAU,UAAU,OAAO,aAAa,KAAK,gBAAgB,OAAO;CAE7E,MAAM,IAAI,KAAK;CACf,IAAI,CAAC,GAAG,OAAO;CACf,IAAI,EAAE,QAAQ,OAAO,SAAS,SAAS,EAAE,MAAM,OAAO;CACtD,IAAI,EAAE,QAEA;MAAA,EADY,MAAM,QAAQ,EAAE,MAAM,IAAI,EAAE,SAAS,CAAC,EAAE,MAAM,EAAA,CACjD,SAAS,MAAe,GAAG,OAAO;CAAA;CAEjD,IAAI,EAAE,iBAAiB,KAAA,KAAa,EAAE,iBAAiB,KAAA,GAAW;EAChE,MAAM,aAAa,OAAO,OAAO,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,EAAE,SAAS;EAC3E,MAAM,MAAM,WAAW,WAAW,IAAI,IAAI,KAAK,IAAI,GAAG,UAAU;EAChE,IAAI,EAAE,iBAAiB,KAAA,KAAa,MAAM,EAAE,cAAc,OAAO;EACjE,IAAI,EAAE,iBAAiB,KAAA,KAAa,MAAM,EAAE,cAAc,OAAO;CACnE;CACA,IAAI,EAAE,aAAa,KAAA,KAAa,eAAe,OAAO,UAAU,IAAI,eAAe,EAAE,QAAQ,GAC3F,OAAO;CAET,OAAO;AACT;AAEA,SAASA,SAAO,OAAuB;CACrC,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,EAAE;AACrE;AAEA,SAAS,WAAW,MAAc,MAAoB;CACpD,IAAI,WAAW,IAAI,GAEjB,cAAc,MADG,aAAa,MAAM,MACT,IAAI,IAAI;MAEnC,cAAc,MAAM,IAAI;AAE5B;;;;;;;;;;;;;;;;;;;;;;;;AC9RA,MAAM,SAAS;;;;;;;;;AAUf,SAAgB,eAAe,SAAyB;CACtD,OAAO,QAAQ,QAAQ,OAAO,MAAM;AACtC;;;;;;;;;;;;;;;;;;;;;ACcA,SAAgB,sBAAsB,SAAuD;CAC3F,MAAM,EAAE,SAAS;CACjB,IAAI,CAAC,OAAO,UAAU,IAAI,GACxB,MAAM,IAAI,UAAU,uDAAuD,OAAO,IAAI,GAAG;CAE3F,QAAQ,EAAE,UAAU,iBAAiB;EACnC,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,MAAM,0CAA0C;EAE5D,IAAI,SAAS,WAAW,GAAG,OAAO,SAAS;EAC3C,MAAM,4BAAY,IAAI,IAA0B;EAChD,KAAK,MAAM,EAAE,WAAW,cAAc,2BACpC,CAAC,GAAG,QAAQ,GACZ,mBAAmB,QAAQ,CAC7B,GACE,UAAU,IAAI,WAAW,QAAQ;EAEnC,MAAM,MAAM,WAAW,eAAe,MAAM,UAAU,CAAC;EACvD,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,SAAS,MAAM;EAChD,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,SAAS,SAAS,EAAE;EACvD,MAAM,SAAS,UAAU,QAAQ,SAAS,IAAI;EAC9C,MAAM,IAAI,SAAS;EACnB,MAAM,IAAI,SAAS;EACnB,OAAO,eAAe,GAAG,WAAW,WAAW,CAAC,GAAG,GAAG,WAAW,WAAW,CAAC,CAAC,KAAK,IAAI,IAAI;CAC7F;AACF;AAEA,SAAS,WAAW,WAA8C,QAA8B;CAC9F,MAAM,WAAW,UAAU,IAAI,MAAM;CACrC,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,MACR,2CAA2C,OAAO,YAAY,6CAChE;CAEF,OAAO;AACT;;AAGA,SAAS,eAAe,GAAiB,IAAY,GAAiB,IAAoB;CACxF,IAAI,OAAO,IAAI,OAAO,KAAK,KAAK,KAAK;CACrC,IAAI,EAAE,cAAc,EAAE,WAAW,OAAO,EAAE,YAAY,EAAE,YAAY,KAAK;CACzE,IAAI,EAAE,gBAAgB,EAAE,aAAa,OAAO;CAC5C,OAAO,EAAE,cAAc,EAAE,cAAc,KAAK;AAC9C;;AAGA,SAAS,mBAAmB,UAAkE;CAC5F,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,UAAU,UAAU,KAAK,MAAM,MAAM,OAAO,KAAK,OAAO,UAAU,GAAG,IAAI,IAAI,EAAE;CAC1F,IAAI,IAAI,SAAS,GACf,MAAM,IAAI,MAAM,6DAA6D;CAE/E,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,QAAQ;EAClC,MAAM;EACN,WAAW;EACX,QAAQ,WAAW;GACjB,MAAM,QAAQ,OAAO,WAAW;GAChC,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,MAAM,IAAI,MACR,2CAA2C,OAAO,YAAY,6BAA6B,GAAG,EAChG;GAEF,OAAO;EACT;CACF,EAAE;AACJ;AAEA,SAAS,eAAe,MAAc,YAA4B;CAChE,OAAQ,OAAO,KAAK,KAAK,aAAa,GAAG,UAAU,IAAK;AAC1D;;;;;;;;AC9CA,SAAgB,qBACd,QAC0C;CAC1C,OAAO,OAAO,SAAS,UAAU,QAAQ;EAEvC,OAAO,qBAAqB,MADP,OAAO,IAAI,UAAU;GAAE,GAAG;GAAK;EAAQ,CAAC,CAC3B;CACpC;AACF;;;;;;;AAaA,eAAsB,eACpB,OACA,OACA,kBAC2B;CAM3B,OAAO;EAAE,GAAG,MALU,iBACpB;GAAE,QAAQ,MAAM;GAAI,cAAc,MAAM;EAAa,GACrD,OACA,gBACF;EACqB,OAAO,MAAM;CAAM;AAC1C;;;;;;AAiBA,SAAgB,oBAAoB,UAAwD;CAC1F,MAAM,OAAwB,CAAC;CAC/B,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,EAAE,cAChB,KAAK,KAAK;EACR,SAAS,EAAE;EACX,YAAY,EAAE;EACd,OAAO,EAAE;EACT,UAAU,EAAE;EACZ,QAAQ,EAAE,YAAY,SAAS;EAC/B,UAAU,EAAE;CACd,CAAC;CAGL,OAAO;AACT;;AAmBA,SAAgB,kBAAkB,MAAmD;CACnF,MAAM,0BAAU,IAAI,IAA+C;CACnE,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,IAAI,QAAQ,IAAI,EAAE,OAAO,KAAK;GAAE,OAAO;GAAG,QAAQ;EAAE;EAC1D,EAAE;EACF,IAAI,EAAE,WAAW,QAAQ;GACvB,EAAE;GACF;EACF;EACA,QAAQ,IAAI,EAAE,SAAS,CAAC;CAC1B;CACA,IAAI,uBAAuB;CAC3B,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,IAAI,EAAE,QAAQ,KAAK,EAAE,WAAW,EAAE,OAAO;CAC3E,OAAO;EACL,SAAS,QAAQ;EACjB;EACA,cAAc,KAAK;EACnB;EACA,QAAQ,KAAK,SAAS;EACtB,UAAU,KAAK,WAAW,IAAI,IAAI,SAAS,KAAK;CAClD;AACF;AAWA,SAAS,WAAW,GAAmB;CACrC,OAAO,EAAE,QAAQ,OAAO,KAAK,CAAC,CAAC,QAAQ,UAAU,GAAG;AACtD;AAEA,SAAS,SAAS,GAAW,KAAqB;CAChD,OAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE;AACnE;;;;;;;;AASA,SAAgB,yBACd,MACA,OAAgC,CAAC,GACzB;CACR,MAAM,QAAQ,KAAK,oBAAoB;CACvC,MAAM,MAAM,kBAAkB,IAAI;CAClC,MAAM,OAAO,MAAc,GAAG,KAAK,MAAM,IAAI,GAAG,EAAE;CAClD,MAAM,MAAM,MAAgB,WAAW,SAAS,EAAE,KAAK,IAAI,GAAG,KAAK,CAAC,KAAK;CACzE,MAAM,MAAgB,CAAC,KAAK,KAAK,SAAS,sCAAsC,EAAE;CAClF,IAAI,KAAK,MAAM;EACb,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,MAAM,GAAG;EAC3E,IAAI,KAAK,EAAE;CACb;CACA,IAAI,KACF,KAAK,IAAI,qBAAqB,GAAG,IAAI,QAAQ,oCACtC,IAAI,OAAO,GAAG,IAAI,aAAa,2BAA2B,IAAI,IAAI,QAAQ,EAAE,QAC5E,IAAI,OAAO,UAClB,EACF;CACA,MAAM,QAAQ,KAAK,QAAQ,MAAM,EAAE,WAAW,MAAM;CACpD,IAAI,MAAM,SAAS,GAAG;EACpB,IAAI,KAAK,mBAAmB,IAAI,sCAAsC,qBAAqB;EAC3F,KAAK,MAAM,KAAK,OACd,IAAI,KAAK,KAAK,WAAW,EAAE,UAAU,EAAE,KAAK,WAAW,EAAE,QAAQ,EAAE,KAAK,GAAG,EAAE,QAAQ,EAAE,GAAG;EAE5F,IAAI,KAAK,EAAE;CACb,OACE,IAAI,KAAK,iDAAiD,EAAE;CAE9D,IAAI,KAAK,yBAAyB,EAAE;CACpC,KAAK,MAAM,WAAW,CAAC,GAAG,IAAI,IAAI,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG;EAC9D,MAAM,YAAY,KAAK,QAAQ,MAAM,EAAE,YAAY,OAAO;EAC1D,MAAM,SAAS,UAAU,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAAC;EAC5D,MAAM,OAAO,WAAW,UAAU,SAAS,MAAM;EACjD,IAAI,KACF,OAAO,WAAW,UAAU,EAAE,CAAE,UAAU,EAAE,KAAK,OAAO,GAAG,UAAU,OAAO,GAAG,QAC/E,IACA,uCACA,qBACF;EACA,KAAK,MAAM,KAAK,WACd,IAAI,KACF,KAAK,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,SAAS,WAAW,SAAS,KAAK,GAAG,EAAE,QAAQ,EAAE,GACjG;EAEF,IAAI,KAAK,EAAE;CACb;CACA,OAAO,IAAI,KAAK,IAAI;AACtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3KA,IAAa,qBAAb,cAAwC,eAAe;CACrD,YAAY,SAAiB;EAC3B,MAAM,kBAAkB,OAAO;CACjC;AACF;;;;;;AAyIA,SAAgB,8BAAqE,MAenF;CACA,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,cAAc,iBAAiB,KAAK,OAAO;CACjD,MAAM,YAAY,eAAe,KAAK,OAAO;CAC7C,MAAM,aAAa,IAAI;EACrB,SAAS;EACT,SAAS,KAAK,UAAU,CAAC,EAAA,CAAG,KAAK,UAAU,MAAM,IAAI;EACrD;EACA;EACA,aAAa,KAAK,eAAe;CACnC,CAAC;CACD,MAAM,cAAc,kBAAkB,IAAI;EACxC,WAAW,KAAK;EAChB,QAAQ,KAAK,eAAe;EAC5B;EACA;EACA;CACF,CAAC;CAQD,OAAO;EAAE;EAAa;EAAW;EAAY;EAAa,cAPrC,oBAAoB;GACvC,WAAW,KAAK;GAChB,QAAS,KAAK,UAAU,CAAC;GACzB;GACA;GACA;EACF,CACqE;CAAE;AACzE;AAEA,SAAS,SAAS,IAAoB;CACpC,OAAO,GAAG,QAAQ,mBAAmB,GAAG;AAC1C;AAEA,SAAS,IAAI,OAAwB;CACnC,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK;AACxE;AAEA,SAAS,KAAK,IAAsB;CAClC,OAAO,GAAG,WAAW,IAAI,IAAI,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;AAsBA,SAAS,cAAc,MAA6C;CAClE,MAAM,WAAW,KAAK,mBAAmB,KAAK,gBAAgB,CAAC,KAAK,aAAa,IAAI,CAAC;CACtF,OAAO,CAAC,GAAG,IAAI,IAAI,SAAS,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;AAC3E;AAEA,SAAS,mBAAmB,UAA6B;CACvD,OAAO,SAAS,SAAS,KAAK,SAAS,OAAO,UAAU,UAAA,SAAuB;AACjF;;AAGA,SAAS,YACP,MACA,WACA,eACQ;CACR,MAAM,WAAW,cAAc,IAAI;CAKnC,IAAI,KAAK,UAAU,KAAA,MAAc,SAAS,WAAW,KAAK,mBAAmB,QAAQ,IACnF,OAAO;CAET,IAAI,iBAAiB,aAAa,GAAG;EACnC,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,eACZ,MAAM,IAAI,mBACR,YAAY,UAAU,qBAAqB,MAAM,cAAc,KAAK,OAAO,6CAA6C,cAAc,EACxI;EAGJ,OAAO;CACT;CAEA,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,mBACR,YAAY,UAAU,kFAAkF,KAAK,OAAO,wEACtH;CAEF,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,CAAC,iBAAiB,KAAK,GACzB,MAAM,IAAI,mBACR,YAAY,UAAU,uBAAuB,MAAM,cAAc,KAAK,OAAO,oEAC/E;EAEF,IAAI,kBAAA,aAA0C,CAAC,gBAAgB,eAAe,KAAK,GACjF,MAAM,IAAI,mBACR,YAAY,UAAU,oBAAoB,cAAc,cAAc,KAAK,OAAO,iCAAiC,MAAM,EAC3H;CAEJ;CACA,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,mBACR,YAAY,UAAU,UAAU,KAAK,OAAO,iDAAiD,SAAS,KAAK,IAAI,GACjH;CAEF,OAAO,SAAS;AAClB;AAEA,SAAS,gBAAgB,UAAkB,UAA2B;CACpE,MAAM,eAAe,SAClB,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,wBAAwB,EAAE,CAAC,CACnC,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,iBAAiB,EAAE;CAC9B,OACE,iBAAiB,YACjB,aAAa,SAAS,IAAI,UAAU,KACpC,SAAS,SAAS,IAAI,cAAc;AAExC;AAEA,SAAS,eACP,MACW;CACX,MAAM,EAAE,MAAM,SAAS,aAAa,YAAY,cAAc,UAAU,WAAW,aACjF;CACF,MAAM,YAAY,eAAe,OAAO;CAKxC,MAAM,QAAQ,YAAY,MAAM,WAJV,oBAAoB,OAIa,CAAC;CAExD,MAAM,SAAS,wBADK,qBAAqB,IACQ,GAAG;EAClD,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,KAAK;EACxC;EACA,aAAa;EACb;EACA,YAAY;EACZ;EACA;EACA;EACA,cAAc,KAAK;CACrB,CAAC;CAKD,IAAI,KAAK,cAAc,KAAK,UAC1B,IAAI;EACF,MAAM,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,QAAQ;EACzD,IAAI,QAAQ,OAAO,KAAK,WAAW,YAAY,OAAO,KAAK,eAAe,UAAU;GAClF,OAAO,SAAS,KAAK;GACrB,OAAO,aAAa,KAAK;EAC3B;CACF,QAAQ,CAER;CAEF,OAAO;AACT;;;;;;;;AASA,SAAS,qBACP,MAC+B;CAC/B,IAAI,KAAK,UAAU,KAAA,GAAW,OAAO;CAErC,MAAM,uBAAuB,cAAc,IAAI,CAAC,CAAC,MAAM,UAAU,UAAU,aAAa;CACxF,OAAO;EACL,GAAG;EACH,YACE,KAAK,WAAW,gBAAgB,SAAS,uBACrC,KAAK,aACL;GAAE,GAAG,KAAK;GAAY,aAAa;EAAM;EAC/C,gBACE,CAAC,wBAAwB,KAAK,eAAe,SAAS,cAAc,KAAK,YAAY,IACjF;GAAE,MAAM;GAAc,KAAK;EAAK,IAChC,KAAK;CACb;AACF;;;;AAKA,eAAsB,iBACpB,MACuD;CACvD,IAAI,KAAK,SAAS,WAAW,GAAG,MAAM,IAAI,mBAAmB,4BAA4B;CACzF,IAAI,KAAK,UAAU,WAAW,GAAG,MAAM,IAAI,mBAAmB,6BAA6B;CAE3F,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,gBAAgB,KAAK,aAAa;CACxC,MAAM,wBAAwB,KAAK,yBAAyB;CAC5D,MAAM,aAAa,KAAK,SAAS,IAAI,cAAc;CACnD,IAAI,KAAK,gBAAgB,KAAA,KAAa,KAAK,YAAY,KAAK,CAAC,CAAC,WAAW,GACvE,MAAM,IAAI,mBAAmB,sDAAsD;CAErF,MAAM,sBAAsB,WAAW,QAAQ,IAAI,UAAU,WAAW,QAAQ,EAAE,MAAM,KAAK;CAC7F,IAAI,oBAAoB,SAAS,GAC/B,MAAM,IAAI,mBACR,oDAAoD,CAAC,GAAG,IAAI,IAAI,mBAAmB,CAAC,CAAC,CAAC,KAAK,IAAI,GACjG;CAEF,MAAM,eACJ,KAAK,gBACL,MAAM,IAAI;EAAE;EAAY,WAAW,KAAK,UAAU,KAAK,MAAM,EAAE,EAAE;CAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;CACnF,MAAM,kBAAkB,OAAO,IAAI;EACjC;EACA;EACA;EACA;EACA,WAAW,KAAK;EAChB,aAAa,KAAK,eAAe;CACnC,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;CACd,MAAM,WAAW,KAAK,YAAY;CAClC,IAAI,OAAO,aAAa,YAAY,SAAS,KAAK,CAAC,CAAC,WAAW,GAC7D,MAAM,IAAI,mBAAmB,mDAAmD;CAGlF,MAAM,eAAe,IAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAOjE,KAAK,MAAM,WAAW,KAAK,UAAU;EACnC,MAAM,cAAc,iBAAiB,OAAO;EAC5C,MAAM,YAAY,eAAe,OAAO;EACxC,MAAM,gBAAgB,oBAAoB,OAAO;EACjD,MAAM,QAAQ,iBAAiB,aAAa,IACxC,gBACA,GAAG,cAAc;EACrB,IAAI;GACF,kBAAkB;IAChB,OAAO,GAAG,SAAS,GAAG,UAAU;IAChC;IACA,aAAa;IACb;IACA;IACA,YAAY;IACZ,YAAY;IACZ,WAAW,KAAK;IAChB,QAAQ;IACR,SAAS;IACT,gBAAgB;KAAE,MAAM;KAAc,KAAK;IAAK;IAChD,YAAY;KAAE,OAAO;KAAG,QAAQ;IAAE;IAClC,iBAAiB;IACjB,SAAS,EAAE,KAAK,EAAE,uBAAuB,EAAE,EAAE;IAC7C;IACA,YAAY;GACd,CAAC;EACH,SAAS,KAAK;GACZ,MAAM,IAAI,mBACR,YAAY,UAAU,uBAAuB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAC9F;EACF;CACF;CAEA,MAAM,UAAuB,CAAC;CAC9B,MAAM,YAAkE,CAAC;CACzE,MAAM,YAA4C,CAAC;CAEnD,MAAM,UAAU,MAAM,cACpB,KAAK,UACL,uBACA,OAAO,SAAS,QAAQ,WAAW;EAWjC,MAAM,EAAE,aAAa,WAAW,YAAY,gBAV3B,8BAA8B;GAC7C;GACA,WAAW,KAAK;GAChB,QAAQ,KAAK;GACb,WAAW,KAAK;GAChB,aAAa,KAAK;GAClB;GACA;GACA,MAAM,KAAK;EACb,CACmE;EACnE,MAAM,gBAAgB,oBAAoB,OAAO;EAIjD,MAAM,YAAY,UAAqB,QACrC,KAAK,SAAS,SAAS,UAAU,GAAG;EACtC,OAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,WAAW,SAAS,SAAS,IAAI,CAAC;EAEnF,MAAM,WAAW,MAAM,YAAkC;GACvD,WAAW,KAAK;GAChB;GACA;GACA;GACA,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,gBAAgB,KAAK;GACrB,aAAa,KAAK;GAClB,YAAY,KAAK,aACZ,EAAE,UAAU,UAAU,KAAK,YAAY;IAAE;IAAS;IAAU;GAAI,CAAC,KAAK,QACvE,KAAA;GACJ,kBAAkB,KAAK;GACvB,cAAc,KAAK;GACnB,eAAe,KAAK;GACpB,SAAS,KAAK;GACd,KAAK,KAAK;GACV,QAAQ,KAAK,KAAK,QAAQ,SAAS,SAAS,CAAC;EAC/C,CAAC;EAUD,MAAM,OAAO,cAAc,OAAO;EAClC,MAAM,qBAAqB,cACzB,sBAAsB;GACpB;GACA,eAAe;IAAE,MAAM;IAA2B,MAAM;GAAY;GACpE,GAAI,aAAa,cAAA,YAA8B,EAAE,OAAO,UAAU,IAAI,CAAC;GACvE,GAAI,OAAO,EAAE,SAAS,EAAE,IAAI,KAAK,QAAQ,EAAE,IAAI,CAAC;EAClD,CAAC;EAGH,MAAM,qBAAqB,iBAAiB,aAAa,IACrD,MAAM,kBAAkB,aAAa,IACrC,KAAA;EAEJ,MAAM,iBAA8B,CAAC;EACrC,KAAK,MAAM,QAAQ,SAAS,OAAO;GACjC,MAAM,YAAY,YAAY,MAAM,WAAW,aAAa;GAC5D,MAAM,mBACJ,cAAA,YACI,MAAM,kBAAkB,IACvB,sBAAuB,MAAM,kBAAkB,SAAS;GAC/D,MAAM,SAAS,eAAe;IAC5B;IACA;IACA;IACA;IACA;IACA;IACA,WAAW,KAAK;IAChB;IACA;IACA,UAAU,aAAa,IAAI,KAAK,UAAU;IAC1C,YAAY,KAAK;GACnB,CAAC;GACD,IAAI,UAAU,kBAAkB,MAAM;GACtC,eAAe,KAAK,MAAM;EAC5B;EAEA,MAAM,iBAAiB,CACrB,GAAG,IAAI,IACL,eACG,KAAK,WAAW,OAAO,KAAK,CAAC,CAC7B,QAAQ,UAA2B,UAAU,aAAa,CAC/D,CACF;EACA,IAAI,eAAe,SAAS,GAC1B,MAAM,IAAI,mBACR,YAAY,UAAU,0CAA0C,eAAe,KAAK,IAAI,GAC1F;EAGF,MAAM,iBAAiB,SAAS,WAAW,KAAK;EAChD,MAAM,eAAe,eAAe,SAAS,eAAe,OAAO,eAAe;EAClF,OAAO;GACL;GACA;GACA,SAAS;GACT,SAAS;IACP;IACA;IACA,OAAO,eAAe,MAAA;IACtB,SAAS,eAAe;IACxB,eAAe,WACb,eAAe,IAAI,OAAO,CAAC,CAAC,QAAQ,UAA2B,UAAU,KAAA,CAAS,CACpF;IACA;IACA;IACA,WAAW,0BAA0B,cAAc;GACrD;EACF;CACF,CACF;CAGA,KAAK,MAAM,UAAU,SAAS;EAC5B,UAAU,OAAO,aAAa,OAAO;EACrC,UAAU,OAAO,aAAa,OAAO;EACrC,QAAQ,KAAK,GAAG,OAAO,OAAO;CAChC;CAGA,MAAM,YAAY,0BAA0B,OAAO;CACnD,IAAI,kBAAkB,UACpB,kBAAkB,SAAS,EAAE,YAAY,KAAK,cAAc,KAAK,CAAC;MAC7D,IAAI,kBAAkB,UAAU,UAAU,YAAY,QAE3D,QAAQ,KACN,yCAAyC,UAAU,QAAQ,KAAK,UAAU,WAC5E;CASF,OAAO;EAAE;EAAU;EAAc;EAAS;EAAW,YALlC,OAAO,UAAU,MAAM,EAAE,UAKkB;EAAG,WAJ/C,KAAK,YACnB,gBAAgB,SAAS,KAAK,WAAW,KAAK,SAAS,IACvD,KAAA;EAEwE;EAAW;CAAU;AACnG;;;;AAKA,SAAS,QAAQ,GAAkC;CACjD,OAAO,aAAa,CAAC;AACvB;AAEA,SAAS,WAAW,QAAiC;CACnD,OAAO,OAAO,WAAW,IAAI,OAAO,KAAK,MAAM;AACjD;AAEA,SAAS,OACP,SACA,OACgC;CAChC,MAAM,yBAAS,IAAI,IAAsB;CACzC,KAAK,MAAM,KAAK,SAAS;EACvB,MAAM,MAAM,MAAM,CAAC;EACnB,IAAI,QAAQ,KAAA,GAAW;EACvB,MAAM,QAAQ,QAAQ,CAAC;EACvB,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,MAAM,OAAO,IAAI,GAAG,KAAK,CAAC;EAChC,IAAI,KAAK,KAAK;EACd,OAAO,IAAI,KAAK,GAAG;CACrB;CACA,MAAM,MAAsC,CAAC;CAC7C,KAAK,MAAM,CAAC,KAAK,OAAO,QAAQ,IAAI,OAAO;EAAE,eAAe,KAAK,EAAE;EAAG,GAAG,GAAG;CAAO;CACnF,OAAO;AACT;AAEA,SAAS,gBACP,SACA,WACA,WACgC;CAChC,MAAM,sCAAsB,IAAI,IAAoB;CACpD,KAAK,MAAM,KAAK,WAAW,oBAAoB,IAAI,EAAE,IAAI,UAAU,CAAC,CAAC;CACrE,OAAO,OAAO,UAAU,MAAO,EAAE,aAAa,oBAAoB,IAAI,EAAE,UAAU,IAAI,KAAA,CAAU;AAClG;;;;;;;;;;;;;ACxqBA,MAAM,YAAY;AAClB,MAAM,gBAAgB;AAEtB,IAAM,8BAAN,cAA0C,mBAAmB;CAC3D,YAAY,SAAiB;EAC3B,MAAM,qBAAqB,SAAS;CACtC;AACF;AAsGA,SAAgB,wBACd,MACyC;CACzC,IAAI,CAAC,MAAM,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,WAAW,GAC5D,MAAM,IAAI,4BAA4B,4BAA4B;CAEpE,IAAI,CAAC,MAAM,QAAQ,KAAK,SAAS,KAAK,KAAK,UAAU,WAAW,GAC9D,MAAM,IAAI,4BAA4B,6BAA6B;CAErE,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,WAAW,KAAK,YAAY;CAClC,IAAI,OAAO,KAAK,cAAc,YAAY,KAAK,UAAU,KAAK,CAAC,CAAC,WAAW,GACzE,MAAM,IAAI,4BAA4B,sCAAsC;CAE9E,IAAI,OAAO,KAAK,gBAAgB,YAAY,KAAK,YAAY,KAAK,CAAC,CAAC,WAAW,GAC7E,MAAM,IAAI,4BACR,yEACF;CAEF,qBAAqB,KAAK,WAAW,IAAI;CAEzC,MAAM,WAAW,CAAC,GAAG,KAAK,QAAQ;CAClC,MAAM,YAAY,CAAC,GAAG,KAAK,SAAS;CACpC,MAAM,SAAS,CAAC,GAAI,KAAK,UAAU,CAAC,CAAE;CACtC,MAAM,aAAa,SAAS,IAAI,cAAc;CAC9C,MAAM,oBAAoB,WAAW,QAAQ,IAAI,UAAU,WAAW,QAAQ,EAAE,MAAM,KAAK;CAC3F,IAAI,kBAAkB,SAAS,GAC7B,MAAM,IAAI,4BACR,0BAA0B,CAAC,GAAG,IAAI,IAAI,iBAAiB,CAAC,CAAC,CAAC,KAAK,IAAI,GACrE;CAGF,MAAM,eACJ,KAAK,gBACL,MAAM,YAAY;EAAE;EAAY,WAAW,UAAU,KAAK,aAAa,SAAS,EAAE;CAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;CACpG,IAAI,aAAa,KAAK,CAAC,CAAC,WAAW,GACjC,MAAM,IAAI,4BAA4B,gCAAgC;CAmCxE,MAAM,aAAa,UAAU,YAAY;EA/BvC,QAAQ;EACR,UAAU,SAAS,KAAK,SAAS,WAAW;GAC1C,SAAS;GACT,IAAI,WAAW;GACf,MAAM,UAAU,iBAAiB,OAAO;GACxC;EACF,EAAE;EACF,WAAW,UAAU,KAAK,UAAU,WAAW;GAC7C,SAAS;GACT,UAAU,yBAAyB,QAAQ;GAC3C;EACF,EAAE;EACF,QAAQ,OAAO,KAAK,WAAW;GAC7B,MAAM,MAAM;GACZ,YAAY,MAAM;GAClB,cAAc,MAAM,gBAAgB;GACpC,OAAO,MAAM,MAAM,SAAS;GAC5B,WAAW,MAAM,WAAW,SAAS,KAAK;EAC5C,EAAE;EACF;EACA;EACA;EACA,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB;EACA;EACA;EACA;EACA,WAAW,KAAK,WAAW,SAAS,KAAK;EACzC,YAAY,KAAK,YAAY,SAAS,KAAK;CAEW,CAAC;CACzD,MAAM,WAAW,OAAO,WAAW,MAAM,GAAkB,EAAqB;CAChF,MAAM,OAA2B,CAAC;CAClC,MAAM,8BAAc,IAAI,IAAY;CACpC,IAAI,UAAU;CACd,KAAK,MAAM,aAAa,YACtB,KAAK,MAAM,YAAY,WACrB,KAAK,IAAI,MAAM,GAAG,MAAM,MAAM,OAAO,GAAG;EACtC,MAAM,SAAS,GAAG,SAAS,GAAG,GAAG;EACjC,IAAI,YAAY,IAAI,GAAG,UAAU,GAAG,QAAQ,GAC1C,MAAM,IAAI,4BACR,+CAA+C,UAAU,GAAG,OAAO,EACrE;EAEF,YAAY,IAAI,GAAG,UAAU,GAAG,QAAQ;EACxC,KAAK,KAAK;GACR,OAAO,OAAO,YAAY;IAAE;IAAU;IAAW,YAAY,SAAS;IAAI;GAAI,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;GAC5F;GACA;GACA,YAAY,SAAS;GACrB;EACF,CAAC;EACD,WAAW;CACb;CAIJ,OAAO,OAAO,OAAO;EACnB,eAAe;EACf;EACA;EACA;EACA,UAAU,OAAO,OAAO,QAAQ;EAChC,WAAW,OAAO,OAAO,SAAS;EAClC,QAAQ,OAAO,OAAO,MAAM;EAC5B;EACA;EACA;EACA,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB;EACA;EACA;EACA,GAAI,KAAK,cAAc,KAAA,IAAY,CAAC,IAAI,EAAE,WAAW,KAAK,UAAU;EACpE,GAAI,KAAK,eAAe,KAAA,IAAY,CAAC,IAAI,EAAE,YAAY,KAAK,WAAW;EACvE,MAAM,OAAO,OAAO,IAAI;CAC1B,CAAC;AACH;AAEA,eAAsB,wBACpB,MAC2D;CAC3D,MAAM,YAAY,kBAAkB,KAAK,WAAW,WAAW;CAC/D,MAAM,UAAU,KAAK,WAAW,kBAAkB;CAClD,MAAM,SAAS,cAAc,KAAK,MAAM;CACxC,WAAW,KAAK,IAAI;CACpB,MAAM,WAAW,cAAc,KAAK,MAAM,KAAK,IAAI;CACnD,eAAe,SAAS,QAAQ,YAAY,KAAK,IAAI,CAAC;CACtD,aAAa,SAAS,QAAQ,KAAK,MAAM,WAAW,QAAQ;CAE5D,MAAM,cAAc,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC;CAC5D,MAAM,qBAAqB,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC;CAKvE,MAAM,SAAS,MAAM,iBAAuC;EAC1D,UALe,KAAK,KAAK,SAAS,QAAQ,YAC1C,mBAAmB,IAAI,eAAe,OAAO,CAAC,CAIvC;EACP,WAAW,CAAC,GAAG,KAAK,KAAK,SAAS;EAClC,UAAU,KAAK;EACf,QAAQ,CAAC,GAAG,KAAK,KAAK,MAAM;EAC5B;EACA,WAAW,KAAK,KAAK;EACrB,aAAa,KAAK,KAAK;EACvB,cAAc,KAAK,KAAK;EACxB,UAAU,KAAK,KAAK;EACpB,UAAU,KAAK,KAAK;EACpB,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,KAAK;EAChB,WAAW;EACX,YAAY,KAAK,KAAK;EACtB,gBAAgB,KAAK;EACrB,uBAAuB,KAAK;EAC5B,aAAa,KAAK;EAClB,cAAc,KAAK;EACnB,eAAe,KAAK;EACpB;EACA,KAAK,KAAK;EACV,WAAW,KAAK,KAAK;EACrB,UAAU,KAAK,KAAK;EACpB,YAAY,KAAK,KAAK;EACtB,kBAAkB;EAClB,YAAY,EAAE,SAAS,UAAU,UAC/B,YAAY,IAAI,SAAS,KAAK,MAAM,eAAe,OAAO,GAAG,SAAS,IAAI,GAAG,CAAC;CAClF,CAAC;CAED,oBAAoB,SAAS,QAAQ,MAAM;CAC3C,MAAM,WAAW,aAAa,SAAS,QAAQ,KAAK,IAAI;CACxD,OAAO;EAAE;EAAW,QAAQ,SAAS,KAAK,QAAQ,IAAI,KAAK;EAAG;EAAQ;CAAS;AACjF;AAEA,eAAsB,sBACpB,MAC6D;CAC7D,MAAM,UAAU,KAAK,WAAW,kBAAkB;CAClD,MAAM,SAAS,cAAc,KAAK,MAAM;CACxC,WAAW,KAAK,IAAI;CACpB,eAAe,SAAS,QAAQ,YAAY,KAAK,IAAI,CAAC;CACtD,MAAM,SAAS,kBAAkB,SAAS,MAAM;CAChD,qBAAqB,KAAK,MAAM,MAAM;CACtC,MAAM,WAAW,aAAa,SAAS,QAAQ,KAAK,IAAI;CACxD,IAAI,SAAS,QAAQ,SAAS,GAC5B,MAAM,IAAI,4BACR,sCAAsC,SAAS,QAAQ,KAAK,IAAI,GAClE;CAGF,MAAM,SAAS,MAAM,iBAAuC;EAC1D,UAAU,CAAC,GAAG,KAAK,KAAK,QAAQ;EAChC,WAAW,CAAC,GAAG,KAAK,KAAK,SAAS;EAClC,UAAU,YAAY;GACpB,MAAM,IAAI,4BACR,wGACF;EACF;EACA,QAAQ,CAAC,GAAG,KAAK,KAAK,MAAM;EAC5B;EACA,WAAW,KAAK,KAAK;EACrB,aAAa,KAAK,KAAK;EACvB,cAAc,KAAK,KAAK;EACxB,UAAU,KAAK,KAAK;EACpB,UAAU,KAAK,KAAK;EACpB,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,KAAK;EAChB,WAAW,KAAK,KAAK;EACrB,YAAY,KAAK,KAAK;EACtB,gBAAgB,KAAK;EACrB,uBAAuB,KAAK;EAC5B;EACA,KAAK,KAAK;EACV,WAAW,KAAK,KAAK;EACrB,UAAU,KAAK,KAAK;EACpB,YAAY,KAAK,KAAK;EACtB,kBAAkB;CACpB,CAAC;CACD,gBAAgB,KAAK,MAAM,MAAM;CACjC,OAAO;EAAE,GAAG;EAAQ;CAAS;AAC/B;AAwBA,SAAS,YACP,MACyB;CACzB,OAAO;EACL,eAAe;EACf,UAAU,KAAK;EACf,cAAc,KAAK;EACnB,YAAY,KAAK;EACjB,UAAU,KAAK,SAAS,KAAK,aAAa;GACxC,IAAI,eAAe,OAAO;GAC1B,MAAM,UAAU,iBAAiB,OAAO;EAC1C,EAAE;EACF,WAAW,KAAK,UAAU,KAAK,aAAa,yBAAyB,QAAQ,CAAC;EAC9E,MAAM,KAAK;EACX,MAAM,KAAK;EACX,UAAU,KAAK;EACf,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB,MAAM,CAAC,GAAG,KAAK,IAAI;CACrB;AACF;AAEA,SAAS,WACP,MACM;CACN,MAAM,UAAU,wBAAwB;EACtC,UAAU,CAAC,GAAG,KAAK,QAAQ;EAC3B,WAAW,CAAC,GAAG,KAAK,SAAS;EAC7B,QAAQ,CAAC,GAAG,KAAK,MAAM;EACvB,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB,cAAc,KAAK;EACnB,UAAU,KAAK;EACf,MAAM,KAAK;EACX,MAAM,KAAK;EACX,WAAW,KAAK;EAChB,YAAY,KAAK;EACjB,UAAU,KAAK;EACf,WAAW,KAAK;EAChB,YAAY,KAAK;CACnB,CAAC;CACD,IACE,QAAQ,eAAe,KAAK,cAC5B,QAAQ,aAAa,KAAK,YAC1B,cAAc,QAAQ,IAAI,MAAM,cAAc,KAAK,IAAI,GAEvD,MAAM,IAAI,4BAA4B,gDAAgD;AAE1F;AAEA,SAAS,eACP,SACA,QACA,UACM;CACN,QAAQ,UAAU,MAAM;CACxB,MAAM,OAAO,KAAK,QAAQ,SAAS;CAEnC,IADiB,QAAQ,KAAK,IACnB,MAAM,KAAA,GAAW;EAC1B,MAAM,UAAU,GAAG,cAAc,QAAQ,EAAE;EAC3C,IAAI,QAAQ,OAAO,MAAM,SAAS,CAAC,MAAM,KAAA,GAAW;CACtD;CACA,MAAM,YAAY,QAAQ,KAAK,IAAI;CACnC,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,4BAA4B,8BAA8B;CAEtE,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,SAAS;CAC/B,QAAQ;EACN,MAAM,IAAI,4BAA4B,gCAAgC;CACxE;CACA,IAAI,cAAc,MAAM,MAAM,cAAc,QAAQ,GAClD,MAAM,IAAI,4BACR,4DACF;AAEJ;AAEA,SAAS,cACP,MACA,MACoB;CACpB,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAW,GAC1C,MAAM,IAAI,4BAA4B,wCAAwC;CAEhF,MAAM,OAAO,IAAI,IAAI,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC7D,MAAM,WAA+B,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,SAAS,MAAM;EACxB,MAAM,QAAQ,OAAO,UAAU,WAAW,QAAQ,OAAO;EACzD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,4BAA4B,mCAAmC;EAE3E,IAAI,KAAK,IAAI,KAAK,GAChB,MAAM,IAAI,4BAA4B,kBAAkB,MAAM,aAAa;EAC7E,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,IAAI,CAAC,KAAK,MAAM,IAAI,4BAA4B,QAAQ,MAAM,8BAA8B;EAC5F,IAAI,OAAO,UAAU,YAAY,cAAc,KAAK,MAAM,cAAc,GAAG,GACzE,MAAM,IAAI,4BAA4B,QAAQ,MAAM,uCAAuC;EAE7F,KAAK,IAAI,KAAK;EACd,SAAS,KAAK,GAAG;CACnB;CACA,OAAO,SAAS,MAAM,MAAM,UAAU,KAAK,UAAU,MAAM,OAAO;AACpE;AAEA,SAAS,aACP,SACA,QACA,MACA,WACA,UACM;CACN,MAAM,OAAO,KAAK,QAAQ,aAAa;CACvC,MAAM,WAAW,cAAc;EAC7B,eAAe;EACf;EACA,YAAY,KAAK;EACjB,QAAQ,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC,CAAC,KAAK;CAChD,CAAwB;CACxB,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG;EAC/C,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK;EAClC,MAAM,SAAS,mBAAmB,KAAK,IAAI;EAC3C,MAAM,WAAW,OAAO,MAAM,UAAU,MAAM,cAAc,SAAS;EACrE,IAAI,UAAU;GACZ,IAAI,cAAc,QAAQ,MAAM,UAC9B,MAAM,IAAI,4BACR,YAAY,UAAU,mDACxB;GAEF;EACF;EACA,MAAM,cAAc,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC;EAC5D,MAAM,UAAU,OAAO,SAAS,UAC9B,MAAM,OACH,QAAQ,UAAU,YAAY,IAAI,KAAK,CAAC,CAAC,CACzC,KAAK,UAAU,GAAG,MAAM,IAAI,MAAM,UAAU,EAAE,CACnD;EACA,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,4BACR,yCAAyC,QAAQ,KAAK,IAAI,GAC5D;EAEF,MAAM,QAAQ,GAAG,SAAS;EAE1B,IADa,QAAQ,OAAO,MAAM,OAAO,WAAW,GAAG,CAChD,MAAM,KAAA,GAAW;CAC1B;CACA,MAAM,IAAI,4BACR,4BAA4B,UAAU,2BACxC;AACF;AAEA,SAAS,kBAAkB,SAA0B,QAAgC;CACnF,MAAM,OAAO,KAAK,QAAQ,aAAa;CACvC,MAAM,MAAM,QAAQ,KAAK,IAAI;CAC7B,IAAI,QAAQ,KAAA,GAAW,OAAO,CAAC;CAC/B,OAAO,mBAAmB,KAAK,IAAI;AACrC;AAEA,SAAS,mBAAmB,KAAa,MAA8B;CACrE,MAAM,SAAyB,CAAC;CAChC,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,MAAM,CAAC,OAAO,SAAS,IAAI,MAAM,IAAI,CAAC,CAAC,QAAQ,GAAG;EACrD,IAAI,KAAK,KAAK,MAAM,IAAI;EACxB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,IAAI;EAC1B,QAAQ;GACN,MAAM,IAAI,4BAA4B,kCAAkC,KAAK,GAAG,QAAQ,GAAG;EAC7F;EACA,IAAI,cAAc,MAAM,MAAM,MAC5B,MAAM,IAAI,4BACR,wCAAwC,KAAK,GAAG,QAAQ,GAC1D;EAEF,MAAM,QAAQ;EACd,IACE,MAAM,kBAAkB,KACxB,OAAO,MAAM,cAAc,YAC3B,OAAO,MAAM,eAAe,YAC5B,CAAC,MAAM,QAAQ,MAAM,MAAM,KAC3B,MAAM,OAAO,MAAM,UAAU,OAAO,UAAU,QAAQ,KACtD,IAAI,IAAI,MAAM,MAAM,CAAC,CAAC,SAAS,MAAM,OAAO,QAE5C,MAAM,IAAI,4BACR,4CAA4C,KAAK,GAAG,QAAQ,GAC9D;EAEF,IAAI,aAAa,IAAI,MAAM,SAAS,GAClC,MAAM,IAAI,4BAA4B,qCAAqC,MAAM,UAAU,EAAE;EAE/F,aAAa,IAAI,MAAM,SAAS;EAChC,MAAM,aAAa;GACjB,eAAe;GACf,WAAW,MAAM;GACjB,YAAY,MAAM;GAClB,QAAQ,CAAC,GAAG,MAAM,MAAM,CAAC,CAAC,KAAK;EACjC;EACA,KAAK,MAAM,SAAS,WAAW,QAAQ;GACrC,MAAM,QAAQ,SAAS,IAAI,KAAK;GAChC,IAAI,OACF,MAAM,IAAI,4BACR,kCAAkC,MAAM,aAAa,MAAM,SAAS,WAAW,UAAU,EAC3F;GAEF,SAAS,IAAI,OAAO,WAAW,SAAS;EAC1C;EACA,OAAO,KAAK,UAAU;CACxB;CACA,OAAO;AACT;AAEA,SAAS,qBACP,MACA,QACM;CACN,MAAM,WAAW,IAAI,IAAI,KAAK,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC;CAC1D,MAAM,0BAAU,IAAI,IAAY;CAChC,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,MAAM,eAAe,KAAK,YAC5B,MAAM,IAAI,4BACR,YAAY,MAAM,UAAU,uCAC9B;EAEF,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,IAAI,CAAC,SAAS,IAAI,KAAK,GACrB,MAAM,IAAI,4BACR,YAAY,MAAM,UAAU,8BAA8B,MAAM,EAClE;GAEF,QAAQ,IAAI,KAAK;EACnB;CACF;CACA,MAAM,gBAAgB,KAAK,KAAK,QAAQ,QAAQ,CAAC,QAAQ,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,KAAK;CAC/F,IAAI,cAAc,SAAS,GACzB,MAAM,IAAI,4BACR,+CAA+C,cAAc,KAAK,IAAI,GACxE;AAEJ;AAEA,SAAS,oBACP,SACA,QACA,QACM;CACN,KAAK,MAAM,CAAC,WAAW,aAAa,OAAO,QAAQ,OAAO,SAAS,GACjE,KAAK,MAAM,QAAQ,SAAS,OAAO;EACjC,MAAM,OAAO,cAAc,KAAK,QAAQ,iBAAiB,SAAS,CAAC,GAAG,KAAK,MAAM;EACjF,QAAQ,UAAU,QAAQ,IAAI,CAAC;EAG/B,QAAQ,MAAM,MAAM,GAAG,KAAK,UAAU,IAAI,EAAE,GAAG;CACjD;AAEJ;AAEA,SAAS,aACP,SACA,QACA,MACuB;CACvB,MAAM,yBAAyB,IAAI,IACjC,KAAK,SAAS,KAAK,YAAY;EAC7B,MAAM,WAAW,8BAA8B;GAC7C;GACA,WAAW,CAAC,GAAG,KAAK,SAAS;GAC7B,QAAQ,CAAC,GAAG,KAAK,MAAM;GACvB,WAAW,KAAK;GAChB,aAAa,KAAK;GAClB,UAAU,KAAK;GACf,MAAM,KAAK;GACX,MAAM,KAAK;EACb,CAAC;EACD,OAAO,CAAC,SAAS,WAAW,SAAS,YAAY;CACnD,CAAC,CACH;CACA,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAmB,CAAC;CAC1B,MAAM,YAAsB,CAAC;CAC7B,IAAI,UAAU;CACd,KAAK,MAAM,OAAO,KAAK,MAAM;EAC3B,MAAM,OAAO,cACX,KAAK,QAAQ,iBAAiB,IAAI,SAAS,CAAC,GAC5C,GAAG,IAAI,WAAW,GAAG,IAAI,KAC3B;EACA,MAAM,MAAM,QAAQ,KAAK,IAAI;EAC7B,IAAI,QAAQ,KAAA,GAAW;GACrB,QAAQ,KAAK,IAAI,KAAK;GACtB;EACF;EACA,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,GAAG;EACzB,QAAQ;GACN,MAAM,IAAI,4BAA4B,SAAS,IAAI,MAAM,mBAAmB;EAC9E;EACA,IAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GACvE,MAAM,IAAI,4BAA4B,SAAS,IAAI,MAAM,8BAA8B;EAEzF,MAAM,OAAO;EACb,IACE,KAAK,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI,SACzC,KAAK,eAAe,IAAI,cACxB,KAAK,QAAQ,IAAI,OACjB,KAAK,iBAAiB,uBAAuB,IAAI,IAAI,SAAS,GAE9D,MAAM,IAAI,4BACR,SAAS,IAAI,MAAM,uDACrB;EAEF,IAAI;GACF,2BAA2B,IAAI;EACjC,SAAS,OAAO;GACd,MAAM,IAAI,4BACR,SAAS,IAAI,MAAM,mCAAmC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAC7G;EACF;EACA,WAAW;EACX,IAAI,KAAK,UAAU,KAAA,GAAW;GAC5B,OAAO,KAAK,IAAI,KAAK;GACrB;EACF;EACA,IAAI,2BAA2B,IAAI,CAAC,CAAC,UAAU,GAAG,UAAU,KAAK,IAAI,KAAK;CAC5E;CACA,OAAO;EACL,UAAU,KAAK,KAAK;EACpB;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,gBACP,MACA,QACM;CACN,MAAM,WAAW,IAAI,IAAI,KAAK,KAAK,KAAK,QAAQ,GAAG,IAAI,UAAU,GAAG,IAAI,WAAW,GAAG,IAAI,KAAK,CAAC;CAChG,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,UAAU,OAAO,SAAS;EACnC,MAAM,MAAM,GAAG,OAAO,YAAY,GAAG,OAAO,WAAW,GAAG,OAAO,QAAQ,IAAI;EAC7E,IAAI,CAAC,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GACpC,MAAM,IAAI,4BACR,oDAAoD,IAAI,EAC1D;EAEF,KAAK,IAAI,GAAG;CACd;CACA,IAAI,KAAK,SAAS,SAAS,MACzB,MAAM,IAAI,4BACR,yBAAyB,KAAK,KAAK,GAAG,SAAS,KAAK,eACtD;AAEJ;AAEA,SAAS,SACP,MACA,WACA,YACA,KACQ;CACR,MAAM,MAAM,KAAK,KAAK,MACnB,cACC,UAAU,cAAc,aACxB,UAAU,eAAe,cACzB,UAAU,QAAQ,GACtB;CACA,IAAI,CAAC,KACH,MAAM,IAAI,4BAA4B,wBAAwB,UAAU,GAAG,WAAW,GAAG,KAAK;CAChG,OAAO,IAAI;AACb;AAEA,SAAS,iBAAiB,WAA2B;CACnD,OAAO,UAAU,QAAQ,mBAAmB,GAAG;AACjD;AAEA,SAAS,kBAAkB,OAAe,MAAsB;CAC9D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,4BAA4B,GAAG,KAAK,4BAA4B;CAE5E,OAAO;AACT;AAEA,SAAS,WAAW,OAAuB;CACzC,OAAO,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC;AACzC;;;ACruBA,MAAM,6BAA6B;;AAEnC,MAAM,mBAAmB;;;AASzB,SAAS,QAAQ,QAA2B;CAC1C,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,GAAG,OAAO;EAAE,WAAW;EAAG,UAAU;CAAE;CAChD,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,QAAQ,OAAO;CAC/B,MAAM,YAAY,MAAM;CACxB,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,IAAI,IAAI;EACd,SAAS,IAAI;CACf;CACA,OAAO;EAAE;EAAW,UAAU,QAAQ;CAAE;AAC1C;;;AAIA,SAAS,sBAAsB,GAAwB,GAAgC;CACrF,IAAI,EAAE,mBAAmB,EAAE,gBAAgB,OAAO,EAAE,iBAAiB,EAAE;CACvE,IAAI,EAAE,cAAc,EAAE,WAAW,OAAO,EAAE,YAAY,EAAE;CACxD,OAAO,EAAE,aAAa,EAAE,aAAa,KAAK,EAAE,aAAa,EAAE,aAAa,IAAI;AAC9E;;;;;;;;;AAUA,SAAgB,oBACd,SACA,MACuB;CACvB,MAAM,oBAAoB,MAAM,qBAAqB;CAYrD,OAXe,QAAQ,KAAK,WAAgC;EAC1D,MAAM,EAAE,WAAW,aAAa,QAAQ,OAAO,MAAM;EACrD,MAAM,OAAO,WAAW,oBAAoB,aAAa;EACzD,OAAO;GACL,YAAY,OAAO;GACnB,gBAAgB;GAChB;GACA;GACA;EACF;CACF,CACY,CAAC,CAAC,KAAK,qBAAqB;AAC1C;;;;;;;;;;;AAYA,SAAgB,qBACd,SACA,GACA,MACU;CACV,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,6CAA6C,EAAE,EAAE;CAC5E,MAAM,SAAS,oBAAoB,SAAS,IAAI;CAChD,IAAI,OAAO,UAAU,GAAG,OAAO,OAAO,KAAK,MAAM,EAAE,UAAU;CAC7D,MAAM,UAAU,OAAO,QAAQ,MAAM,CAAC,EAAE,IAAI;CAC5C,IAAI,QAAQ,UAAU,GAAG,OAAO,QAAQ,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,UAAU;CAE3E,MAAM,OADO,OAAO,QAAQ,MAAM,EAAE,IACpB,CAAC,CAAC,MAAM,GAAG,IAAI,QAAQ,MAAM;CAC7C,OAAO,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,UAAU;AACtD;;;AC5DA,SAAgB,sBAKd,WACA,SAImC;CACnC,KACG,UAAU,0BAA0B,cACnC,UAAU,0BAA0B,cACtC,CAAC,QAAQ,aAET,MAAM,IAAI,UACR,oDAAoD,UAAU,sBAAsB,WACtF;CAEF,MAAM,WAAW,uBAAuB,UAAU,MAAM,UAAU,MAAM,QAAQ,QAAQ;CACxF,OAAO,cACL;EACE,MAAM,QAAQ,QAAQ,UAAU;EAChC,WAAW,QAAQ;EACnB,cAAc,QAAQ;EACtB,WAAW,QAAQ;EACnB,aAAa,QAAQ;CACvB,GACA,OAAO,UAAU;EACf,MAAM,SAAS,MAAM,sBAAsB;GACzC,MAAM,UAAU;GAChB,MAAM,UAAU;GAChB,QAAQ,MAAM;GACd,YAAY,MAAM;GAClB,WAAW,MAAM;GACjB,UAAU,MAAM;GAChB,YAAY,MAAM,SAAS;GAC3B;GACA,UAAU,YACR,UAAU,SACR,QAAQ,SAAS;IAAE,UAAU,MAAM;IAAU,UAAU,MAAM;GAAS,CAAC,GACvE,OACF;EACJ,CAAC;EACD,IAAI,OAAO,UAAU,KAAA,KAAa,CAAC,OAAO,SAAS,OAAO,KAAK,GAC7D,MAAM,IAAI,MAAM,GAAG,UAAU,KAAK,6CAA6C;EAEjF,OAAO;GACL,OAAO,OAAO;GACd,OAAO,CAAC,OAAO,OAAO,OAAO,WAAW,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI,KAAK,UAAU;EACpF;CACF,CACF;AACF;AAEA,SAAgB,qBAKd,QACA,SAOmC;CACnC,MAAM,WAAW,uBAAuB,QAAQ,MAAM,QAAQ,MAAM,QAAQ,QAAQ;CACpF,OAAO,cAAc,SAAS,OAAO,UAAU;EAC7C,MAAM,SAAS,MAAM,sBAAsB;GACzC,MAAM,QAAQ;GACd,MAAM,QAAQ;GACd,QAAQ,MAAM;GACd,YAAY,MAAM;GAClB,WAAW,MAAM;GACjB,UAAU,MAAM;GAChB,YAAY,MAAM,SAAS;GAC3B;GACA,UAAU,YACR,OAAO,QAAQ,SAAS;IAAE,UAAU,MAAM;IAAU,UAAU,MAAM;GAAS,CAAC,GAAG,OAAO;EAC5F,CAAC;EACD,IAAI,OAAO,UAAU,QAAQ,CAAC,OAAO,SAAS,OAAO,KAAK,GACxD,MAAM,IAAI,MAAM,GAAG,QAAQ,KAAK,4CAA4C;EAE9E,OAAO;GACL,OAAO,OAAO;GACd,OAAO,OAAO,WAAW,KAAK,UAAU,OAAO,QAAQ,IAAI,OAAO;EACpE;CACF,CAAC;AACH;AAEA,SAAS,cACP,SACA,UAGmC;CACnC,MAAM,YAAY,QAAQ,aAAa,QAAQ;CAC/C,OAAO;EACL,MAAM,QAAQ;EACd,cAAc,QAAQ;EACtB,YAAY,CAAC;GAAE,KAAK;GAAW,aAAa,cAAc,QAAQ;EAAO,CAAC;EAC1E,WAAW,QAAQ;EACnB,MAAM,MAAM,OAA4B;GACtC,MAAM,SAAS,MAAM,SAAS,KAAK;GACnC,MAAM,YAAY,QAAQ,cAAc,QAAQ,YAAY,OAAO,KAAK,IAAI,OAAO;GACnF,IAAI,CAAC,OAAO,SAAS,SAAS,GAC5B,MAAM,IAAI,MAAM,GAAG,QAAQ,KAAK,0CAA0C;GAE5E,OAAO;IACL,YAAY,GAAG,YAAY,OAAO,MAAM;IACxC;IACA,OAAO,OAAO;GAChB;EACF;CACF;AACF;AAEA,SAAS,uBACP,MACA,MACA,UAC4C;CAC5C,IAAI,SAAS,QAAQ;EACnB,IAAI,UACF,MAAM,IAAI,UAAU,GAAG,KAAK,yCAAyC;EAEvE;CACF;CACA,IAAI,CAAC,UACH,MAAM,IAAI,UAAU,GAAG,KAAK,yDAAyD;CAEvF,IAAI,CAAC,SAAS,MAAM,KAAK,GACvB,MAAM,IAAI,UAAU,GAAG,KAAK,mCAAmC;CAEjE,OAAO;AACT;AAEA,eAAe,sBAA+B,OAUzB;CACnB,IAAI,MAAM,SAAS,QACjB,OAAO,oBAAoB,MAAM,cAAc,MAAM,QAAQ,EAAE,QAAQ,MAAM,OAAO,CAAC,CAAC;CAExF,IAAI,CAAC,MAAM,UACT,MAAM,IAAI,8BAA8B,GAAG,MAAM,KAAK,kCAAkC;CAE1F,IAAI,CAAC,MAAM,YACT,MAAM,IAAI,8BACR,GAAG,MAAM,KAAK,kDAChB;CAGF,MAAM,OAAO,MAAM,MAAM,WAAW,YAAY;EAC9C,SAAS;EACT,OAAO,MAAM,aAAa;EAC1B,OAAO,MAAM;EACb,OAAO,MAAM,SAAS;EACtB,GAAI,MAAM,SAAS,gBAAgB,EAAE,eAAe,MAAM,SAAS,cAAc,IAAI,CAAC;EACtF,MAAM;GAAE,GAAG,MAAM;GAAU,YAAY,MAAM;EAAW;EACxD,QAAQ,MAAM;EACd,UAAU,QAAQ,WAAW,QAAQ,QAAQ,MAAM,QAAQ;GAAE;GAAQ;EAAO,CAAC,CAAC;EAC9E,SAAS,MAAM,SAAS;EACxB,GAAI,MAAM,SAAS,mBACf,EAAE,kBAAkB,MAAM,SAAS,iBAAiB,IACpD,CAAC;CACP,CAAC;CACD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK;CAEhC,MAAM,WAAW,MAAM,WAAW,KAAK,CAAC,CAAC,MAAM,YAAY,QAAQ,WAAW,KAAK,MAAM;CACzF,IAAI,CAAC,UACH,MAAM,IAAI,8BACR,GAAG,MAAM,KAAK,0DAChB;CAEF,IAAI,SAAS,eAAe,SAAS,cACnC,MAAM,IAAI,8BACR,GAAG,MAAM,KAAK,gEAChB;CAEF,OAAO,KAAK;AACd;AAEA,eAAe,oBACb,QACA,SACkB;CAClB,IAAI,OAAO,SAAS,MAAM,OAAO;CAEjC,IAAI;CACJ,MAAM,UAAU,IAAI,SAAgB,UAAU,WAAW;EACvD,gBAAgB;CAClB,CAAC;CACD,MAAM,gBAAsB,cAAc,OAAO,MAAM;CACvD,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CACxD,IAAI;EACF,OAAO,MAAM,QAAQ,KAAK,CAAC,QAAQ,QAAQ,CAAC,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC;CACtE,UAAU;EACR,OAAO,oBAAoB,SAAS,OAAO;CAC7C;AACF;;;;;;;;;;;;;;ACzOA,MAAM,uBAAuB,MAAM,OAAO;AAC1C,MAAM,wBAAwB,OAAO;AAMrC,MAAM,qCAAqB,IAAI,IAAI;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AA0BD,IAAa,uBAAb,cAA0C,MAAM;CAGnC;CAFX,YACE,SACA,OACA;EACA,MAAM,OAAO;EAFJ,KAAA,QAAA;EAGT,KAAK,OAAO;CACd;AACF;AAeA,SAAS,WAAW,MAAgB,KAAa,WAAwC;CACvF,IAAI;EACF,MAAM,MAAM,EAAE,GAAG,QAAQ,IAAI;EAC7B,KAAK,MAAM,OAAO,OAAO,KAAK,GAAG,GAC/B,IACE,mBAAmB,IAAI,GAAG,KAC1B,QAAQ,gBACR,IAAI,WAAW,aAAa,KAC5B,IAAI,WAAW,WAAW,KAC1B,QAAQ,mBACR,QAAQ,qBAER,OAAO,IAAI;EAGf,OAAO,OAAO,KAAK,SAAS;EAC5B,IAAI,yBAAyB;EAC7B,IAAI,SAAS;EACb,IAAI,OAAO;EACX,OAAO,aAAa,OAAO,MAAM;GAAE;GAAK;GAAK,WAAW;EAAqB,CAAC;CAChF,SAAS,KAAK;EACZ,MAAM,SACJ,OAAO,OAAO,QAAQ,YAAY,YAAY,MAC1C,OAAQ,IAA4B,MAAM,IAC1C;EACN,MAAM,IAAI,qBAAqB,OAAO,KAAK,KAAK,GAAG,EAAE,WAAW,UAAU,OAAO,GAAG,KAAK,GAAG;CAC9F;AACF;AAEA,SAAS,SAAS,KAAgB,MAAgB,KAAa,KAA8B;CAC3F,IAAI;EACF,MAAM,SAAS,IAAI,MAAM,KAAK,GAAG;EACjC,OAAO,OAAO,WAAW,WAAW,OAAO,KAAK,QAAQ,MAAM,IAAI,OAAO,KAAK,MAAM;CACtF,SAAS,KAAK;EACZ,IAAI,eAAe,sBAAsB,MAAM;EAC/C,MAAM,IAAI,qBAAqB,OAAO,KAAK,KAAK,GAAG,EAAE,WAAW,OAAO,GAAG,KAAK,GAAG;CACpF;AACF;AAEA,SAAS,QAAQ,KAAgB,MAAgB,KAAa,KAA8B;CAC1F,OAAO,SAAS,KAAK,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,MAAM,CAAC,CAAC,KAAK;AAC7D;AAEA,SAAS,sBAAsB,KAAgB,UAAkB,MAAuB;CACtF,MAAM,WAAW,OAAO,KAAK,YAAY,QAAQ,IAAI,KAAK,MAAM;CAChE,MAAM,UAAU,SAAS,KAAK;EAAC;EAAY;EAAQ;EAAe;CAAI,GAAG,QAAQ;CACjF,IAAI,QAAQ;CACZ,OAAO,QAAQ,QAAQ,QAAQ;EAC7B,MAAM,MAAM,QAAQ,QAAQ,GAAG,KAAK;EACpC,IAAI,MAAM,GACR,MAAM,IAAI,qBAAqB,iDAAiD;EAElF,IAAI,QAAQ,SAAS,OAAO,GAAG,CAAC,CAAC,OAAO,QAAQ,GAAG,OAAO;EAC1D,QAAQ,MAAM;CAChB;CACA,OAAO;AACT;AAEA,SAAS,eAAe,KAAgB,UAAkB,QAAyB;CACjF,MAAM,MAAM,cAAc;CAC1B,OAAO,QAAQ,KAAK;EAAC;EAAgB;EAAuB;EAAM;CAAG,GAAG,QAAQ,CAAC,CAC9E,MAAM,IAAI,CAAC,CACX,MAAM,cAAc,cAAc,GAAG;AAC1C;AAEA,SAAS,gBAAgB,QAAuB,QAAyC;CACvF,IAAI;EACF,IAAI,CAAC,OAAO,GAAG,OAAO,KAAA;CACxB,SAAS,KAAK;EACZ,OAAO;CACT;CAEA,IAAI;EACF,OAAO;EACP;CACF,SAAS,aAAa;EACpB,IAAI;GAGF,IAAI,CAAC,OAAO,GAAG,OAAO,KAAA;EACxB,SAAS,cAAc;GACrB,OAAO,IAAI,eACT,CAAC,aAAa,YAAY,GAC1B,sEACF;EACF;EACA,OAAO;CACT;AACF;AAEA,SAAS,OAAO,OAAuC;CACrD,OAAO,UAAU,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK;AAClE;AAEA,MAAM,aAAa;CAIjB;CACA;CACA;CACA,uBAAuB;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,oBAAoC;CACxC,iBAAiB;CACjB,mBAAmB;CACnB,mBAAmB;CACnB,qBAAqB;CACrB,mBAAmB;AACrB;;;;AAKA,SAAS,WACP,KACA,KACA,YACA,iBACQ;CACR,MAAM,UAAU,YAAY,KAAK,OAAO,GAAG,mBAAmB,CAAC;CAC/D,MAAM,WAAW,KAAK,SAAS,UAAU;CACzC,MAAM,gBAAgB,KAAK,SAAS,gBAAgB;CACpD,UAAU,aAAa;CACvB,IAAI;EACF,MAAM,eAAe,uBAAuB,eAAe;EAC3D,MAAM,gBAAgB,aAAa,QAAQ,KAAK;GAAC;GAAa;GAAc;EAAS,GAAG,GAAG,CAAC;EAC5F,QACE,KACA;GACE;GACA;GACA;GACA,GAAI,iBAAiB,WAAW,CAAC,wBAAwB,IAAI,CAAC;GAC9D,cAAc;GACd;EACF,GACA,SACA,iBACF;EACA,OAAO,SACL,KACA;GAAC,aAAa;GAAY,GAAG;GAAY;GAAY;GAAiB;EAAI,GAC1E,SACA;GACE,GAAG;GACH,kCAAkC;EACpC,CACF;CACF,UAAU;EACR,OAAO,SAAS;GAAE,WAAW;GAAM,OAAO;EAAK,CAAC;CAClD;AACF;AAEA,SAAS,cAAc,KAAgB,KAAa,KAAqB;CACvE,OAAO,QAAQ,KAAK;EAAC;EAAa;EAAY,GAAG,IAAI;CAAU,GAAG,GAAG;AACvE;AAEA,SAAS,uBAAuB,SAAsB,aAA8B;CAClF,IAAI,WAAW,QAAQ,WAAW,GAAG,OAAO,QAAQ;CACpD,IAAI,aAAa,OAAO,KAAK,aAAa,SAAS,QAAQ,WAAW,CAAC;CACvE,OAAO,QAAQ;AACjB;AAQA,SAAS,eAAe,MAAsB;CAC5C,OAAO,KAAK,UAAU,IAAI;AAC5B;AAEA,SAAS,oBAAoB,OAAmC;CAC9D,MAAM,QAAQ,OAAO,KAAK,KAAK;CAC/B,MAAM,UAA0B,CAAC;CACjC,IAAI,QAAQ;CACZ,OAAO,QAAQ,MAAM,QAAQ;EAC3B,MAAM,MAAM,MAAM,QAAQ,GAAG,KAAK;EAClC,IAAI,MAAM,GAAG,MAAM,IAAI,qBAAqB,wCAAwC;EACpF,MAAM,SAAS,MAAM,SAAS,OAAO,GAAG;EACxC,QAAQ,MAAM;EACd,IAAI,OAAO,WAAW,GAAG;EAEzB,MAAM,MAAM,OAAO,QAAQ,CAAI;EAC/B,IAAI,MAAM,GAAG,MAAM,IAAI,qBAAqB,uCAAuC;EACnF,MAAM,WAAW,OAAO,SAAS,GAAG,GAAG,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC,MAAM,GAAG;EACpE,IAAI,SAAS,WAAW,GAAG,MAAM,IAAI,qBAAqB,8BAA8B;EACxF,MAAM,OAAO,SAAS;EACtB,MAAM,OAAO,SAAS;EACtB,MAAM,WAAW,SAAS;EAC1B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UACrB,MAAM,IAAI,qBAAqB,8BAA8B;EAE/D,MAAM,YAAY,OAAO,SAAS,MAAM,CAAC;EACzC,MAAM,OAAO,UAAU,SAAS,MAAM;EACtC,IAAI,CAAC,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,OAAO,SAAS,GAC7C,MAAM,IAAI,qBAAqB,uCAAuC;EAExE,IAAI,SAAS,UAAU,SAAS,UAC9B,MAAM,IAAI,qBACR,oDAAoD,KAAK,MAAM,eAAe,IAAI,GACpF;EAEF,QAAQ,KAAK;GAAE;GAAM;GAAU;EAAK,CAAC;CACvC;CACA,OAAO;AACT;AAEA,SAAS,iBAAiB,OAA6B;CACrD,MAAM,QAAQ,OAAO,KAAK,KAAK;CAC/B,MAAM,QAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,OAAO,QAAQ,MAAM,QAAQ;EAC3B,MAAM,MAAM,MAAM,QAAQ,GAAG,KAAK;EAClC,IAAI,MAAM,GAAG,MAAM,IAAI,qBAAqB,wCAAwC;EACpF,MAAM,YAAY,MAAM,SAAS,OAAO,GAAG;EAC3C,QAAQ,MAAM;EACd,IAAI,UAAU,WAAW,GAAG;EAC5B,MAAM,OAAO,UAAU,SAAS,MAAM;EACtC,IAAI,CAAC,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,OAAO,SAAS,GAC7C,MAAM,IAAI,qBAAqB,uCAAuC;EAExE,MAAM,KAAK,IAAI;CACjB;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAc,WAA4B;CAC9D,MAAM,MAAM,SAAS,MAAM,SAAS;CACpC,OAAO,QAAQ,MAAO,CAAC,WAAW,GAAG,KAAK,QAAQ,QAAQ,CAAC,IAAI,WAAW,KAAK,KAAK;AACtF;AAEA,SAAS,uBAAuB,MAAc,MAAsB;CAClE,IAAI,KAAK,WAAW,KAAK,WAAW,IAAI,GACtC,MAAM,IAAI,qBAAqB,oCAAoC,eAAe,IAAI,GAAG;CAE3F,MAAM,eAAe,QAAQ,MAAM,IAAI;CACvC,IAAI,CAAC,aAAa,MAAM,YAAY,KAAK,iBAAiB,MACxD,MAAM,IAAI,qBAAqB,0CAA0C,eAAe,IAAI,GAAG;CAGjG,MAAM,WAAW,KAAK,MAAM,QAAQ;CACpC,IAAI,SAAS;CACb,KAAK,MAAM,WAAW,SAAS,MAAM,GAAG,EAAE,GAAG;EAC3C,IAAI,QAAQ,WAAW,KAAK,YAAY,OAAO,YAAY,MACzD,MAAM,IAAI,qBAAqB,oCAAoC,eAAe,IAAI,GAAG;EAE3F,SAAS,KAAK,QAAQ,OAAO;EAC7B,MAAM,OAAO,UAAU,MAAM;EAC7B,IAAI,CAAC,KAAK,YAAY,KAAK,KAAK,eAAe,GAC7C,MAAM,IAAI,qBACR,gEAAgE,eAAe,IAAI,GACrF;CAEJ;CACA,OAAO;AACT;AAEA,SAAS,uBAAuB,UAAqC;CACnE,IAAI,iBAAiB,KAAK,QAAQ,GAAG,OAAO;CAC5C,IAAI,iBAAiB,KAAK,QAAQ,GAAG,OAAO;CAC5C,MAAM,IAAI,qBAAqB,8BAA8B,UAAU;AACzE;AAEA,SAAS,iBAAiB,OAAmB,UAA0B;CACrE,MAAM,OAAO,WAAW,uBAAuB,QAAQ,CAAC;CACxD,KAAK,OAAO,QAAQ,MAAM,WAAW,GAAG;CACxC,KAAK,OAAO,KAAK;CACjB,OAAO,KAAK,OAAO,KAAK;AAC1B;AAEA,SAAS,gBAAgB,MAAc,UAAyD;CAC9F,MAAM,SAAS,UAAU,IAAI;CAC7B,IAAI,CAAC,OAAO,OAAO,KAAK,OAAO,eAAe,GAC5C,MAAM,IAAI,qBAAqB,0CAA0C,eAAe,IAAI,GAAG;CAGjG,MAAM,WAAW,QAAQ,aAAa,UAAU,IAAIC,UAAY;CAChE,MAAM,KAAK,SAAS,MAAMA,UAAY,WAAW,QAAQ;CACzD,IAAI;EACF,MAAM,SAAS,UAAU,EAAE;EAC3B,IACE,CAAC,OAAO,OAAO,KACf,OAAO,QAAQ,OAAO,OACtB,OAAO,QAAQ,OAAO,OACtB,OAAO,SAAS,OAAO,MAEvB,MAAM,IAAI,qBACR,yDAAyD,eAAe,IAAI,GAC9E;EAGF,MAAM,OAAO,WAAW,uBAAuB,QAAQ,CAAC;EACxD,KAAK,OAAO,QAAQ,OAAO,KAAK,GAAG;EACnC,MAAM,QAAQ,OAAO,YAAY,qBAAqB;EACtD,IAAI,QAAQ;EACZ,OAAO,MAAM;GACX,MAAM,QAAQ,SAAS,IAAI,OAAO,GAAG,MAAM,QAAQ,IAAI;GACvD,IAAI,UAAU,GAAG;GACjB,SAAS;GACT,KAAK,OAAO,MAAM,SAAS,GAAG,KAAK,CAAC;EACtC;EACA,IAAI,UAAU,OAAO,MACnB,MAAM,IAAI,qBACR,yDAAyD,eAAe,IAAI,GAC9E;EAEF,OAAO;GAAE,MAAM,KAAK,OAAO,KAAK;GAAG,aAAa,OAAO,OAAO,QAAW;EAAE;CAC7E,UAAU;EACR,UAAU,EAAE;CACd;AACF;AAEA,SAAS,2BACP,MACA,UACA,cACM;CACN,MAAM,cAAc,aAAa,UAAU,EAAE,UAAU,SAAS,CAAC;CACjE,MAAM,SAAS,YAAY,SAAS,MAAM;CAC1C,IAAI,CAAC,OAAO,KAAK,QAAQ,MAAM,CAAC,CAAC,OAAO,WAAW,GACjD,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAEF,IAAI,WAAW,MAAM,GACnB,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAGF,IAAI,CAAC,aAAa,MADI,QAAQ,QAAQ,QAAQ,GAAG,MACb,CAAC,GACnC,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAEF,IAAI;CACJ,IAAI;EACF,iBAAiB,aAAa,QAAQ;CACxC,SAAS,KAAK;EACZ,MAAM,IAAI,qBACR,4DAA4D,eAAe,QAAQ,KACnF,GACF;CACF;CACA,IAAI,CAAC,aAAa,MAAM,cAAc,GACpC,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAGF,MAAM,iBAAiB,SAAS,MAAM,cAAc,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG;CAIzE,IAAI,EAFF,aAAa,IAAI,cAAc,KAC/B,CAAC,GAAG,YAAY,CAAC,CAAC,MAAM,gBAAgB,YAAY,WAAW,GAAG,eAAe,EAAE,CAAC,IAEpF,MAAM,IAAI,qBACR,8DAA8D,eAAe,QAAQ,GACvF;AAEJ;AAEA,SAAS,6BAA6B,KAAgB,MAAc,iBAA+B;CACjG,MAAM,UAAU,oBACd,SAAS,KAAK;EAAC;EAAW;EAAM;EAAM;EAAe;CAAe,GAAG,IAAI,CAC7E;CACA,MAAM,eAAe,IAAI,IAAI,QAAQ,KAAK,UAAU,MAAM,IAAI,CAAC;CAE/D,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,eAAe,uBAAuB,MAAM,MAAM,IAAI;EAC5D,IAAI,MAAM,SAAS,YAAY,MAAM,SAAS,UAC5C,MAAM,IAAI,qBACR,8EAA8E,eAAe,MAAM,IAAI,GACzG;EAEF,IAAI,MAAM,SAAS,UAAU;GAE3B,IAAI,CADS,UAAU,YACf,CAAC,CAAC,eAAe,GACvB,MAAM,IAAI,qBACR,2CAA2C,eAAe,MAAM,IAAI,GACtE;GAIF,IADuB,iBADH,aAAa,cAAc,EAAE,UAAU,SAAS,CAClB,GAAG,MAAM,QAC1C,MAAM,MAAM,UAC3B,MAAM,IAAI,qBACR,yEAAyE,eAAe,MAAM,IAAI,GACpG;GAEF,2BAA2B,MAAM,cAAc,YAAY;GAC3D;EACF;EACA,IAAI,MAAM,SAAS,YAAY,MAAM,SAAS,UAC5C,MAAM,IAAI,qBACR,6CAA6C,MAAM,KAAK,MAAM,eAAe,MAAM,IAAI,GACzF;EAGF,MAAM,SAAS,gBAAgB,cAAc,MAAM,QAAQ;EAC3D,IAAI,OAAO,SAAS,MAAM,UACxB,MAAM,IAAI,qBACR,mHAAmH,eAAe,MAAM,IAAI,GAC9I;EAEF,IAAI,QAAQ,aAAa,WAAW,OAAO,gBAAgB,MAAM,SAAS,WACxE,MAAM,IAAI,qBACR,kEAAkE,eAAe,MAAM,IAAI,GAC7F;CAEJ;AACF;AAcA,SAAS,yBACP,SACA,MACA,KACyB;CACzB,0BAA0B,OAAO;CACjC,IAAI,CAAC,WAAW,IAAI,GAClB,MAAM,IAAI,qBAAqB,wCAAwC,MAAM;CAE/E,MAAM,cAAc,QAAQ,IAAI;CAChC,MAAM,gBAAgB,aAAa,IAAI;CACvC,IACE,UAAU,WAAW,CAAC,CAAC,eAAe,KACrC,QAAQ,aAAa,WAAW,gBAAgB,eAEjD,MAAM,IAAI,qBACR,kEAAkE,MACpE;CAEF,MAAM,WAAW,QAAQ,KAAK,CAAC,aAAa,iBAAiB,GAAG,IAAI;CACpE,MAAM,oBAAoB,aAAa,QAAQ;CAC/C,IAAI,sBAAsB,eACxB,MAAM,IAAI,qBACR,qEAAqE,SAAS,QAAQ,MACxF;CAGF,MAAM,aAAa,QAAQ,KAAK,CAAC,YAAY,IAAI,GAAG,IAAI,CAAC,CACtD,MAAM,IAAI,CAAC,CACX,QAAQ,SAAS,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,KAAK,SAAS,KAAK,IAAI,EAAE;CACrF,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,qBACR,2EAA2E,KAAK,IAAI,WAAW,KAAK,IAAI,GAC1G;CAGF,MAAM,aAAa,CACjB,GAAG,iBAAiB,SAAS,KAAK;EAAC;EAAY;EAAY;EAAsB;CAAI,GAAG,IAAI,CAAC,GAC7F,GAAG,iBACD,SAAS,KAAK;EAAC;EAAY;EAAY;EAAa;EAAsB;CAAI,GAAG,IAAI,CACvF,CACF;CACA,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,qBACR,oDAAoD,KAAK,IAAI,WAAW,KAAK,IAAI,GACnF;CAGF,MAAM,kBAAkB,cAAc,KAAK,MAAM,MAAM;CACvD,IAAI,oBAAoB,QAAQ,iBAC9B,MAAM,IAAI,qBACR,mDAAmD,QAAQ,gBAAgB,QAAQ,iBACrF;CAGF,MAAM,aAAa,cAAc,KAAK,MAAM,QAAQ,UAAU;CAC9D,IAAI,eAAe,QAAQ,YACzB,MAAM,IAAI,qBACR,8CAA8C,QAAQ,WAAW,QAAQ,YAC3E;CAGF,MAAM,WAAW,QAAQ,KAAK;EAAC;EAAa;EAAY,GAAG,QAAQ,WAAW;CAAQ,GAAG,IAAI;CAC7F,IAAI,aAAa,QAAQ,UACvB,MAAM,IAAI,qBACR,4CAA4C,QAAQ,SAAS,QAAQ,UACvE;CAGF,MAAM,gBAAgB,QACpB,KACA;EAAC;EAAa;EAAY,GAAG,QAAQ,gBAAgB;CAAQ,GAC7D,IACF;CACA,IAAI,kBAAkB,QAAQ,eAC5B,MAAM,IAAI,qBACR,uCAAuC,QAAQ,cAAc,QAAQ,eACvE;CAGF,IAAI;EACF,QACE,KACA;GACE;GACA;GACA;GACA;GACA;GACA,QAAQ;GACR;EACF,GACA,IACF;CACF,SAAS,KAAK;EACZ,MAAM,IAAI,qBACR,uDAAuD,QACvD,GACF;CACF;CAEA,IAAI;EACF,6BAA6B,KAAK,mBAAmB,QAAQ,eAAe;CAC9E,SAAS,KAAK;EACZ,IAAI,eAAe,sBAAsB,MAAM;EAC/C,MAAM,IAAI,qBAAqB,6CAA6C,QAAQ,GAAG;CACzF;CAGA,IADkB,QAAQ,KAAK;EAAC;EAAc,QAAQ;EAAY,QAAQ;CAAe,GAAG,IAChF,MAAM,QAAQ,YACxB,MAAM,IAAI,qBACR,yBAAyB,QAAQ,gBAAgB,8BAA8B,QAAQ,YACzF;CAGF,MAAM,QAAQ,WAAW,KAAK,MAAM,QAAQ,YAAY,QAAQ,eAAe;CAC/E,MAAM,kBAAkB,OAAO,KAAK;CACpC,IAAI,oBAAoB,QAAQ,MAAM,UAAU,MAAM,eAAe,QAAQ,MAAM,YACjF,MAAM,IAAI,qBACR,wCAAwC,QAAQ,MAAM,OAAO,GAAG,QAAQ,MAAM,WAAW,cAAc,gBAAgB,GAAG,MAAM,WAAW,OAC7I;CAGF,OAAO;EACL;EACA,UAAU;EACV,aAAa,mBAAmB,OAAO;EACvC,YAAY,IAAI,WAAW,KAAK;CAClC;AACF;;AAGA,SAAS,KAAK,OAAuB;CACnC,OACE,MACG,YAAY,CAAC,CACb,QAAQ,eAAe,GAAG,CAAC,CAC3B,QAAQ,YAAY,EAAE,CAAC,CACvB,MAAM,GAAG,EAAE,KAAK;AAEvB;;;;AAKA,SAAgB,mBAAmB,MAAkD;CACnF,MAAM,MAAM,KAAK,OAAO;CACxB,MAAM,cAAc,KAAK,eAAe,KAAK,KAAK,UAAU,YAAY;CACxE,MAAM,eAAe,KAAK,gBAAgB;CAE1C,OAAO;EACL,MAAM,OAAO,EAAE,SAAS,SAAS;GAC/B,MAAM,KAAK,GAAG,KAAK,KAAK,EAAE,GAAG,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC;GAC7F,MAAM,SAAS,GAAG,aAAa,GAAG;GAClC,MAAM,OAAO,KAAK,aAAa,EAAE;GACjC,MAAM,aAAa,cAAc,KAAK,KAAK,UAAU,OAAO;GAC5D,MAAM,WAAW,QACf,KACA;IAAC;IAAa;IAAY,GAAG,WAAW;GAAQ,GAChD,KAAK,QACP;GACA,QAAQ,KAAK;IAAC;IAAY;IAAO;IAAM;IAAQ;IAAM;GAAU,GAAG,KAAK,QAAQ;GAC/E,OAAO;IAAE;IAAM;IAAQ;IAAS;IAAY;GAAS;EACvD;EAEA,MAAM,SAAS,UAAU,SAAS;GAQhC,IALe,QACb,KACA;IAAC;IAAU;IAAkB;GAAuB,GACpD,SAAS,IAEF,CAAC,CAAC,SAAS,GAAG;IACrB,QAAQ,KAAK,CAAC,OAAO,IAAI,GAAG,SAAS,IAAI;IACzC,QAAQ,KAAK;KAAC;KAAU;KAAM;IAAO,GAAG,SAAS,IAAI;GACvD;GACA,MAAM,kBAAkB,cAAc,KAAK,SAAS,MAAM,MAAM;GAChE,MAAM,gBAAgB,QACpB,KACA;IAAC;IAAa;IAAY,GAAG,gBAAgB;GAAQ,GACrD,SAAS,IACX;GACA,MAAM,QAAQ,WAAW,KAAK,SAAS,MAAM,SAAS,YAAY,eAAe;GACjF,MAAM,UAAuB;IAC3B,MAAM;IACN,aAAa,SAAS;IACtB,SAAS,SAAS;IAClB,YAAY,SAAS;IACrB,UAAU,SAAS;IACnB;IACA;IACA,OAAO;KACL,QAAQ;KACR,QAAQ,OAAO,KAAK;KACpB,YAAY,MAAM;IACpB;IACA;GACF;GACA,yBAAyB,SAAS,SAAS,MAAM,GAAG;GACpD,OAAO;EACT;EAEA,MAAM,QAAQ,UAAU;GAItB,MAAM,WAAW,CACf,sBACQ,sBAAsB,KAAK,KAAK,UAAU,SAAS,IAAI,SACvD,QAAQ,KAAK;IAAC;IAAY;IAAU;IAAW;IAAM,SAAS;GAAI,GAAG,KAAK,QAAQ,CAC1F,GACA,sBACQ,eAAe,KAAK,KAAK,UAAU,SAAS,MAAM,SAClD,QAAQ,KAAK;IAAC;IAAU;IAAM;IAAM,SAAS;GAAM,GAAG,KAAK,QAAQ,CAC3E,CACF,CAAC,CAAC,QAAQ,YAAY,YAAY,KAAA,CAAS;GAE3C,IAAI,SAAS,SAAS,GAAG;IACvB,MAAM,QACJ,SAAS,WAAW,IAChB,SAAS,KACT,IAAI,eAAe,UAAU,6CAA6C;IAChF,MAAM,IAAI,qBACR,8BAA8B,SAAS,KAAK,cAAc,SAAS,UACnE,KACF;GACF;EACF;CACF;AACF;;;;AAKA,SAAgB,kBACd,SACA,aACyB;CAEzB,OAAO,yBAAyB,SADnB,uBAAuB,SAAS,WACD,GAAG,UAAU;AAC3D;;;AAIA,SAAgB,oBAAoB,SAAsB,aAA8B;CACtF,OAAO,kBAAkB,SAAS,WAAW,CAAC,CAAC;AACjD"}
+{"version":3,"file":"campaign-BzMSCejE.js","names":["validateAndIndex","rowsFor","componentSetKey","rowFor","meanOrNull","canonicalComponents","mean","sha256","fsConstants"],"sources":["../src/campaign/analyst-surface.ts","../src/campaign/cross-surface-context.ts","../src/campaign/cross-surface-interaction.ts","../src/campaign/fixtures.ts","../src/campaign/gates/neutralization-gate.ts","../src/campaign/grounded-reflection.ts","../src/campaign/labeled-store/fs-adapter.ts","../src/campaign/neutralize.ts","../src/campaign/parent-selection.ts","../src/campaign/presets/playback.ts","../src/campaign/presets/run-profile-matrix.ts","../src/campaign/presets/segmented-profile-matrix.ts","../src/campaign/scenario-selection.ts","../src/campaign/upstream-evaluators.ts","../src/campaign/worktree/index.ts"],"sourcesContent":["import type {\n  AnalystBenchmarkCase,\n  AnalystBenchmarkLabelState,\n  AnalystFindingScore,\n  AnalystIssueExpectation,\n} from '../analyst/benchmark'\nimport { scoreAnalystFindings } from '../analyst/benchmark'\nimport type { AnalystFinding, AnalystRunResult, AnalystUsageReceipt } from '../analyst/types'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { DispatchContext, JudgeConfig, MutableSurface, Scenario } from './types'\n\nexport interface TraceAnalystScenario extends Scenario {\n  kind: 'trace-analyst'\n  traceStore: TraceAnalysisStore\n  labelState: AnalystBenchmarkLabelState\n  expectedIssues: readonly AnalystIssueExpectation[]\n  labeledEvidence?: AnalystBenchmarkCase['labeledEvidence']\n}\n\nexport interface TraceAnalystArtifact {\n  findings: readonly AnalystFinding[]\n  usage?: AnalystUsageReceipt\n  run?: AnalystRunResult\n}\n\nexport interface BuildTraceAnalystSurfaceDispatchOptions {\n  analyze(input: {\n    instructions: string\n    traceStore: TraceAnalysisStore\n    runId: string\n    signal: AbortSignal\n  }): Promise<TraceAnalystArtifact>\n}\n\nexport function buildTraceAnalystSurfaceDispatch(\n  options: BuildTraceAnalystSurfaceDispatchOptions,\n): (\n  surface: MutableSurface,\n  scenario: TraceAnalystScenario,\n  context: DispatchContext,\n) => Promise<TraceAnalystArtifact> {\n  return async (surface, scenario, context) => {\n    if (typeof surface !== 'string') {\n      throw new TypeError(\n        `buildTraceAnalystSurfaceDispatch requires a string prompt, received ${surface.kind}`,\n      )\n    }\n    return options.analyze({\n      instructions: surface,\n      traceStore: scenario.traceStore,\n      runId: `${context.cellId}:${scenario.id}`,\n      signal: context.signal,\n    })\n  }\n}\n\nexport function traceAnalystQualityJudge(): JudgeConfig<\n  TraceAnalystArtifact,\n  TraceAnalystScenario\n> {\n  return {\n    name: 'trace-analyst-quality',\n    judgeVersion: 'agent-eval:trace-analyst-quality:v3',\n    dimensions: [\n      { key: 'issue_recall', description: 'share of labeled issues found' },\n      { key: 'finding_precision', description: 'share of findings tied to a labeled issue' },\n      { key: 'f1', description: 'harmonic mean of issue recall and finding precision' },\n      { key: 'critical_step_accuracy', description: 'share of labeled causal steps cited' },\n      { key: 'citation_coverage', description: 'share of findings with evidence citations' },\n      {\n        key: 'citation_label_agreement',\n        description: 'share of citations matching a labeled case location',\n      },\n      { key: 'clean', description: '1 when a clean case produces no findings' },\n    ],\n    appliesTo: (scenario) =>\n      scenario.kind === 'trace-analyst' && scenario.labelState !== 'unlabeled',\n    score({ artifact, scenario }) {\n      assertScorableScenario(scenario)\n      const score = scoreAnalystFindings(\n        {\n          id: scenario.id,\n          expectedIssues: scenario.expectedIssues,\n          labeledEvidence: scenario.labeledEvidence,\n        },\n        artifact.findings,\n      )\n      return traceAnalystJudgeScore(score)\n    },\n  }\n}\n\nfunction assertScorableScenario(scenario: TraceAnalystScenario): void {\n  if (scenario.labelState === 'unlabeled') {\n    throw new TypeError(`trace analyst scenario '${scenario.id}' has no quality labels`)\n  }\n  if (scenario.labelState === 'positive' && scenario.expectedIssues.length === 0) {\n    throw new TypeError(`positive trace analyst scenario '${scenario.id}' requires expected issues`)\n  }\n  if (scenario.labelState === 'trusted-negative' && scenario.expectedIssues.length > 0) {\n    throw new TypeError(\n      `trusted-negative trace analyst scenario '${scenario.id}' cannot contain expected issues`,\n    )\n  }\n}\n\nfunction traceAnalystJudgeScore(score: AnalystFindingScore) {\n  const dimensions: Record<string, number> = {\n    issue_recall: score.issueRecall,\n    finding_precision: score.findingPrecision,\n    f1: score.f1,\n    clean: score.predictionOnLabelEmptyCase ? 0 : 1,\n  }\n  if (score.criticalStepAccuracy !== null) {\n    dimensions.critical_step_accuracy = score.criticalStepAccuracy\n  }\n  if (score.citationCoverage !== null) dimensions.citation_coverage = score.citationCoverage\n  if (score.citationLabelAgreement !== null) {\n    dimensions.citation_label_agreement = score.citationLabelAgreement\n  }\n  const notes = [\n    `${score.matchedIssueIds.length}/${score.expectedIssueCount} issues found`,\n    `${score.supportedFindingIndexes.length}/${score.supportedFindingIndexes.length + score.unsupportedFindingIndexes.length} findings supported`,\n    `${score.unlabeledEvidence.length} citations outside labeled locations`,\n  ].join('; ')\n  const composite =\n    score.criticalStepAccuracy === null ? score.f1 : (score.f1 + score.criticalStepAccuracy) / 2\n  return { dimensions, composite, notes }\n}\n","import { ValidationError } from '../errors'\nimport type {\n  AnalyzeCrossSurfaceInteractionsInput,\n  CrossSurfaceCandidate,\n  CrossSurfaceComponent,\n  CrossSurfaceTaskRow,\n} from './cross-surface-types'\n\n/** Validated indexes shared by analysis and deterministic selection. */\nexport interface CrossSurfaceAnalysisContext<TRow extends CrossSurfaceTaskRow> {\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>\n  components: CrossSurfaceComponent[]\n  candidates: CrossSurfaceCandidate[]\n  componentById: Map<string, CrossSurfaceComponent>\n  candidateById: Map<string, CrossSurfaceCandidate>\n  candidateByComponents: Map<string, CrossSurfaceCandidate>\n  singleByComponent: Map<string, CrossSurfaceCandidate>\n  rowsByCandidate: Map<string, Map<string, TRow>>\n  componentIndex: Map<string, number>\n  candidateIndex: Map<string, number>\n}\n\nexport function validateCrossSurfaceInput<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): CrossSurfaceAnalysisContext<TRow> {\n  assertNonEmptyUnique(input.taskOrder, 'taskOrder')\n  assertNonEmptyUnique(input.componentOrder, 'componentOrder')\n  if (input.componentOrder.length < 2) {\n    throw new ValidationError(\n      'analyzeCrossSurfaceInteractions: componentOrder must contain at least two surfaces',\n    )\n  }\n  assertNonEmptyUnique(input.candidateOrder, 'candidateOrder')\n  assertNonEmptyUnique(input.costMetricOrder, 'costMetricOrder')\n  if (input.costMetricOrder.includes('score')) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: costMetricOrder cannot contain reserved metric 'score'`,\n    )\n  }\n  validateBootstrap(input)\n  validateSelection(input)\n\n  const componentById = indexUnique(\n    input.components,\n    (component) => component.componentId,\n    'component',\n  )\n  assertExactSet(input.componentOrder, componentById.keys(), 'componentOrder', 'components')\n  const surfaces = new Set<string>()\n  for (const component of componentById.values()) {\n    assertNonEmpty(component.componentId, 'componentId')\n    assertNonEmpty(component.surfaceId, `surfaceId for component '${component.componentId}'`)\n    if (surfaces.has(component.surfaceId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: surfaceId '${component.surfaceId}' has more than one component; ` +\n          'the interaction stage requires one independently selected finalist per surface',\n      )\n    }\n    surfaces.add(component.surfaceId)\n    if (typeof component.bestSingleEligible !== 'boolean') {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: component '${component.componentId}' must declare bestSingleEligible`,\n      )\n    }\n  }\n\n  const componentIndex = new Map(input.componentOrder.map((id, index) => [id, index]))\n  const candidateById = indexUnique(\n    input.candidates,\n    (candidate) => candidate.candidateId,\n    'candidate',\n  )\n  assertExactSet(input.candidateOrder, candidateById.keys(), 'candidateOrder', 'candidates')\n  if (!candidateById.has(input.baselineCandidateId)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: unknown baselineCandidateId '${input.baselineCandidateId}'`,\n    )\n  }\n\n  const candidateByComponents = new Map<string, CrossSurfaceCandidate>()\n  const singleByComponent = new Map<string, CrossSurfaceCandidate>()\n  for (const candidate of candidateById.values()) {\n    validateCandidate(candidate, componentById, componentIndex, input.baselineCandidateId)\n    const key = crossSurfaceComponentSetKey(candidate.componentIds)\n    const duplicate = candidateByComponents.get(key)\n    if (duplicate) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidates '${duplicate.candidateId}' and ` +\n          `'${candidate.candidateId}' materialize the same component set`,\n      )\n    }\n    candidateByComponents.set(key, candidate)\n    if (candidate.componentIds.length === 1) {\n      singleByComponent.set(candidate.componentIds[0]!, candidate)\n    }\n  }\n  const baseline = candidateById.get(input.baselineCandidateId)!\n  if (baseline.componentIds.length !== 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: baseline '${baseline.candidateId}' must have zero components`,\n    )\n  }\n  for (const componentId of input.componentOrder) {\n    if (!singleByComponent.has(componentId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: no single-surface candidate for component '${componentId}'`,\n      )\n    }\n  }\n  for (let left = 0; left < input.componentOrder.length; left++) {\n    for (let right = left + 1; right < input.componentOrder.length; right++) {\n      const ids = [input.componentOrder[left]!, input.componentOrder[right]!]\n      if (!candidateByComponents.has(crossSurfaceComponentSetKey(ids))) {\n        throw new ValidationError(\n          `analyzeCrossSurfaceInteractions: missing pair candidate for components [${ids.join(', ')}]`,\n        )\n      }\n    }\n  }\n\n  const rowsByCandidate = new Map<string, Map<string, TRow>>()\n  const taskIds = new Set(input.taskOrder)\n  for (const row of input.rows) {\n    const candidate = candidateById.get(row.candidateId)\n    if (!candidate) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: row for task '${row.taskId}' names unknown candidate '${row.candidateId}'`,\n      )\n    }\n    if (!taskIds.has(row.taskId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: row for candidate '${row.candidateId}' names task '${row.taskId}' ` +\n          'outside the declared taskOrder',\n      )\n    }\n    validateRow(input, row, candidate)\n    const byTask = rowsByCandidate.get(row.candidateId) ?? new Map<string, TRow>()\n    if (byTask.has(row.taskId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: duplicate row for candidate '${row.candidateId}' and task '${row.taskId}'`,\n      )\n    }\n    byTask.set(row.taskId, row)\n    rowsByCandidate.set(row.candidateId, byTask)\n  }\n  for (const candidateId of input.candidateOrder) {\n    const byTask = rowsByCandidate.get(candidateId)\n    const missing = input.taskOrder.filter((taskId) => !byTask?.has(taskId))\n    if (missing.length > 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidate '${candidateId}' is missing declared task row(s) ` +\n          `[${missing.join(', ')}]; encode failed attempts explicitly instead of changing the task axis`,\n      )\n    }\n  }\n  const expectedRows = input.candidateOrder.length * input.taskOrder.length\n  if (input.rows.length !== expectedRows) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: expected exactly ${expectedRows} candidate × task rows, got ${input.rows.length}`,\n    )\n  }\n\n  return {\n    input,\n    components: input.componentOrder.map((id) => componentById.get(id)!),\n    candidates: input.candidateOrder.map((id) => candidateById.get(id)!),\n    componentById,\n    candidateById,\n    candidateByComponents,\n    singleByComponent,\n    rowsByCandidate,\n    componentIndex,\n    candidateIndex: new Map(input.candidateOrder.map((id, index) => [id, index])),\n  }\n}\n\nexport function crossSurfaceRowsFor<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  candidateId: string,\n): TRow[] {\n  return context.input.taskOrder.map((taskId) => crossSurfaceRowFor(context, candidateId, taskId))\n}\n\nexport function crossSurfaceRowFor<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  candidateId: string,\n  taskId: string,\n): TRow {\n  return context.rowsByCandidate.get(candidateId)!.get(taskId)!\n}\n\nexport function canonicalCrossSurfaceComponents<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  componentIds: string[],\n): string[] {\n  return [...componentIds].sort(\n    (left, right) => context.componentIndex.get(left)! - context.componentIndex.get(right)!,\n  )\n}\n\nexport function crossSurfaceComponentSetKey(componentIds: readonly string[]): string {\n  return JSON.stringify(componentIds)\n}\n\nfunction validateBootstrap<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): void {\n  const { seed, resamples, confidence } = input.bootstrap\n  if (!Number.isInteger(seed)) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: bootstrap.seed must be an integer`)\n  }\n  if (!Number.isInteger(resamples) || resamples <= 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: bootstrap.resamples must be a positive integer`,\n    )\n  }\n  if (!Number.isFinite(confidence) || confidence <= 0 || confidence >= 1) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: bootstrap.confidence must be in (0,1)`,\n    )\n  }\n}\n\nfunction validateSelection<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): void {\n  const policy = input.selection\n  for (const [name, value] of [\n    ['minimumFiringTasks', policy.minimumFiringTasks],\n    ['minimumEffectTasks', policy.minimumEffectTasks],\n  ] as const) {\n    if (!Number.isInteger(value) || value < 0 || value > input.taskOrder.length) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: selection.${name} must be an integer in [0,${input.taskOrder.length}]`,\n      )\n    }\n  }\n  if (\n    !Number.isInteger(policy.minimumBundleComponents) ||\n    policy.minimumBundleComponents < 2 ||\n    policy.minimumBundleComponents > input.componentOrder.length\n  ) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: selection.minimumBundleComponents must be an integer in ` +\n        `[2,${input.componentOrder.length}]`,\n    )\n  }\n  for (const [metric, limit] of Object.entries(policy.maximumMedianCostRatioToBaseline)) {\n    if (!input.costMetricOrder.includes(metric)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: cost limit names undeclared metric '${metric}'`,\n      )\n    }\n    if (!Number.isFinite(limit) || limit <= 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: cost ratio limit for '${metric}' must be positive and finite`,\n      )\n    }\n  }\n}\n\nfunction validateCandidate(\n  candidate: CrossSurfaceCandidate,\n  componentById: Map<string, CrossSurfaceComponent>,\n  componentIndex: Map<string, number>,\n  baselineCandidateId: string,\n): void {\n  assertNonEmpty(candidate.candidateId, 'candidateId')\n  assertNonEmpty(candidate.contentHash, `contentHash for candidate '${candidate.candidateId}'`)\n  if (!Number.isInteger(candidate.artifactBytes) || candidate.artifactBytes < 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: artifactBytes for candidate '${candidate.candidateId}' must be a non-negative integer`,\n    )\n  }\n  assertUnique(candidate.componentIds, `componentIds for candidate '${candidate.candidateId}'`)\n  for (const componentId of candidate.componentIds) {\n    if (!componentById.has(componentId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidate '${candidate.candidateId}' names unknown component '${componentId}'`,\n      )\n    }\n  }\n  const canonical = [...candidate.componentIds].sort(\n    (left, right) => componentIndex.get(left)! - componentIndex.get(right)!,\n  )\n  if (!arraysEqual(candidate.componentIds, canonical)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: candidate '${candidate.candidateId}' components must follow componentOrder`,\n    )\n  }\n  if (candidate.candidateId !== baselineCandidateId && candidate.componentIds.length === 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: only baseline '${baselineCandidateId}' may have zero components`,\n    )\n  }\n}\n\nfunction validateRow<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n  row: TRow,\n  candidate: CrossSurfaceCandidate,\n): void {\n  if (!arraysEqual(row.componentIds, candidate.componentIds)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: row '${row.candidateId}/${row.taskId}' componentIds do not match its candidate`,\n    )\n  }\n  if (!['complete', 'missing', 'invalid'].includes(row.completeness)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: row '${row.candidateId}/${row.taskId}' has unknown completeness '${String(row.completeness)}'`,\n    )\n  }\n  if (row.completeness === 'complete') {\n    if (typeof row.pass !== 'boolean' || !Number.isFinite(row.score)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: complete row '${row.candidateId}/${row.taskId}' requires boolean pass and finite score`,\n      )\n    }\n    if (row.rejectReason !== null) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: complete row '${row.candidateId}/${row.taskId}' cannot carry rejectReason`,\n      )\n    }\n  } else {\n    if (row.pass !== null || row.score !== null) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: ${row.completeness} row '${row.candidateId}/${row.taskId}' must use null pass and score`,\n      )\n    }\n    if (typeof row.rejectReason !== 'string' || row.rejectReason.trim() === '') {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: ${row.completeness} row '${row.candidateId}/${row.taskId}' requires rejectReason`,\n      )\n    }\n  }\n  assertExactSet(\n    input.costMetricOrder,\n    Object.keys(row.cost),\n    `cost keys for row '${row.candidateId}/${row.taskId}'`,\n    'costMetricOrder',\n  )\n  for (const metric of input.costMetricOrder) {\n    const value = row.cost[metric]\n    if (value === null || value === undefined || !Number.isFinite(value) || value < 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: unknown or invalid cost '${metric}' on row ` +\n          `'${row.candidateId}/${row.taskId}'; every attempt must report a non-negative finite value`,\n      )\n    }\n  }\n  const evidenceByComponent = indexUnique(\n    row.componentEvidence,\n    (evidence) => evidence.componentId,\n    `componentEvidence on row '${row.candidateId}/${row.taskId}'`,\n  )\n  assertExactSet(\n    candidate.componentIds,\n    evidenceByComponent.keys(),\n    `componentEvidence on row '${row.candidateId}/${row.taskId}'`,\n    'candidate components',\n  )\n  for (const evidence of evidenceByComponent.values()) {\n    assertTriState(evidence.fired, 'fired', row)\n    assertTriState(evidence.effectObserved, 'effectObserved', row)\n    if (evidence.effectObserved === true && evidence.fired !== true) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: effectObserved=true requires fired=true for component ` +\n          `'${evidence.componentId}' on row '${row.candidateId}/${row.taskId}'`,\n      )\n    }\n  }\n}\n\nfunction assertTriState<TRow extends CrossSurfaceTaskRow>(\n  value: boolean | null,\n  field: string,\n  row: TRow,\n): void {\n  if (value !== true && value !== false && value !== null) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${field} on row '${row.candidateId}/${row.taskId}' must be boolean or null`,\n    )\n  }\n}\n\nfunction indexUnique<T>(\n  items: readonly T[],\n  id: (item: T) => string,\n  label: string,\n): Map<string, T> {\n  const result = new Map<string, T>()\n  for (const item of items) {\n    const key = id(item)\n    assertNonEmpty(key, `${label} id`)\n    if (result.has(key)) {\n      throw new ValidationError(`analyzeCrossSurfaceInteractions: duplicate ${label} id '${key}'`)\n    }\n    result.set(key, item)\n  }\n  return result\n}\n\nfunction assertNonEmptyUnique(values: readonly string[], label: string): void {\n  if (values.length === 0) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: ${label} is empty`)\n  }\n  assertUnique(values, label)\n  for (const value of values) assertNonEmpty(value, label)\n}\n\nfunction assertUnique(values: readonly string[], label: string): void {\n  if (new Set(values).size !== values.length) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: ${label} contains duplicates`)\n  }\n}\n\nfunction assertNonEmpty(value: string, label: string): void {\n  if (typeof value !== 'string' || value.trim() === '') {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${label} must be a non-empty string`,\n    )\n  }\n}\n\nfunction assertExactSet(\n  expected: readonly string[],\n  actualIterable: Iterable<string>,\n  actualLabel: string,\n  expectedLabel: string,\n): void {\n  const actual = [...actualIterable]\n  const expectedSet = new Set(expected)\n  const actualSet = new Set(actual)\n  const missing = expected.filter((value) => !actualSet.has(value))\n  const extra = actual.filter((value) => !expectedSet.has(value))\n  if (missing.length > 0 || extra.length > 0 || actual.length !== expected.length) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${actualLabel} does not match ${expectedLabel}; ` +\n        `missing=[${missing.join(', ')}], extra=[${extra.join(', ')}]`,\n    )\n  }\n}\n\nfunction arraysEqual(left: readonly string[], right: readonly string[]): boolean {\n  return left.length === right.length && left.every((value, index) => value === right[index])\n}\n","/**\n * Task-paired comparison and deterministic selection for independently\n * proposed agent surfaces. Unlike factorial cell-mean attribution, every\n * benefit, regression, and interaction remains attached to its task row.\n */\n\nimport { ValidationError } from '../errors'\nimport { comparePairedArms, type PairedArmRow, type PairedArmsComparison } from '../paired-arms'\nimport { pairedBootstrap } from '../statistics'\nimport {\n  type CrossSurfaceAnalysisContext as AnalysisContext,\n  canonicalCrossSurfaceComponents as canonicalComponents,\n  crossSurfaceComponentSetKey as componentSetKey,\n  crossSurfaceRowFor as rowFor,\n  crossSurfaceRowsFor as rowsFor,\n  validateCrossSurfaceInput as validateAndIndex,\n} from './cross-surface-context'\nimport type {\n  AnalyzeCrossSurfaceInteractionsInput,\n  CrossSurfaceAdditionDecision,\n  CrossSurfaceAdditionRejectionReason,\n  CrossSurfaceCandidate,\n  CrossSurfaceCandidateComparison,\n  CrossSurfaceCandidateEvidence,\n  CrossSurfaceCandidateOutcome,\n  CrossSurfaceCandidateSummary,\n  CrossSurfaceCompositionStep,\n  CrossSurfaceDistribution,\n  CrossSurfaceEligibility,\n  CrossSurfaceEvidenceBreakdown,\n  CrossSurfaceIneligibilityReason,\n  CrossSurfaceInteractionAwareSelection,\n  CrossSurfaceInteractionEffect,\n  CrossSurfaceInteractionPath,\n  CrossSurfaceInteractionReport,\n  CrossSurfaceNaiveStackSelection,\n  CrossSurfacePairCompatibility,\n  CrossSurfacePairEvidence,\n  CrossSurfacePairIncompatibilityReason,\n  CrossSurfacePairwiseEntry,\n  CrossSurfaceRankedSingle,\n  CrossSurfaceRelativeCost,\n  CrossSurfaceSelections,\n  CrossSurfaceTaskRow,\n} from './cross-surface-types'\n\n/**\n * Build the complete cross-surface evidence matrix and derive all three frozen\n * candidates. The task/candidate/component orders are part of the input so\n * neither insertion order nor an after-the-fact tie-break can change a result.\n */\nexport function analyzeCrossSurfaceInteractions<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): CrossSurfaceInteractionReport<TRow> {\n  const context = validateAndIndex(input)\n  const baseline = context.candidateById.get(input.baselineCandidateId)!\n\n  const preliminary = context.candidates.map((candidate) =>\n    summarizeCandidate(context, candidate, baseline),\n  )\n  const baselineSummary = preliminary.find(\n    (summary) => summary.candidate.candidateId === input.baselineCandidateId,\n  )!\n  const summaries = preliminary.map((summary) =>\n    summary.candidate.candidateId === input.baselineCandidateId\n      ? summary\n      : {\n          ...summary,\n          eligibility: candidateEligibility(context, summary, baselineSummary),\n        },\n  )\n  const summaryById = new Map(summaries.map((summary) => [summary.candidate.candidateId, summary]))\n  const eligibleSingles = rankedEligibleSingles(context, summaryById)\n  const interactionReadySingles = rankedInteractionReadySingles(context, summaryById)\n  const pairwise = buildPairwise(context, summaryById, interactionReadySingles, baselineSummary)\n  const selections = selectCandidates(\n    context,\n    summaryById,\n    eligibleSingles,\n    interactionReadySingles,\n    pairwise,\n  )\n  const rows = context.candidates.flatMap((candidate) =>\n    input.taskOrder.map(\n      (taskId) => context.rowsByCandidate.get(candidate.candidateId)!.get(taskId)!,\n    ),\n  )\n\n  return {\n    taskIds: [...input.taskOrder],\n    componentIds: [...input.componentOrder],\n    candidateIds: [...input.candidateOrder],\n    costMetrics: [...input.costMetricOrder],\n    rows,\n    missingAttempts: rows.filter((row) => row.completeness === 'missing'),\n    invalidAttempts: rows.filter((row) => row.completeness === 'invalid'),\n    candidates: summaries,\n    pairwise,\n    selections,\n  }\n}\n\nfunction summarizeCandidate<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  candidate: CrossSurfaceCandidate,\n  baseline: CrossSurfaceCandidate,\n): CrossSurfaceCandidateSummary {\n  const rows = rowsFor(context, candidate.candidateId)\n  const baselineRows = rowsFor(context, baseline.candidateId)\n  const outcome = summarizeOutcome(\n    context,\n    rows,\n    baselineRows,\n    candidate.candidateId === baseline.candidateId,\n  )\n  const completeScores = rows\n    .filter((row) => row.completeness === 'complete')\n    .map((row) => row.score as number)\n  const costs = Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => [\n      metric,\n      distribution(rows.map((row) => row.cost[metric] as number)),\n    ]),\n  )\n  return {\n    candidate,\n    outcome,\n    score: completeScores.length === 0 ? null : distribution(completeScores),\n    costs,\n    firing: summarizeCandidateEvidence(rows, candidate.componentIds, 'fired'),\n    effect: summarizeCandidateEvidence(rows, candidate.componentIds, 'effectObserved'),\n    comparisonToBaseline:\n      candidate.candidateId === baseline.candidateId\n        ? null\n        : pairedComparison(context, baseline.candidateId, candidate.candidateId),\n    eligibility: null,\n  }\n}\n\nfunction summarizeOutcome<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  rows: TRow[],\n  baselineRows: TRow[],\n  isBaseline: boolean,\n): CrossSurfaceCandidateOutcome {\n  const resolvedTaskIds: string[] = []\n  const failedTaskIds: string[] = []\n  const missingTaskIds: string[] = []\n  const invalidTaskIds: string[] = []\n  const benefitTaskIds: string[] = []\n  const regressionTaskIds: string[] = []\n  const comparisonMissingTaskIds: string[] = []\n  for (let index = 0; index < context.input.taskOrder.length; index++) {\n    const row = rows[index]!\n    const baseline = baselineRows[index]!\n    if (row.completeness === 'missing') missingTaskIds.push(row.taskId)\n    else if (row.completeness === 'invalid') invalidTaskIds.push(row.taskId)\n    else if (row.pass) resolvedTaskIds.push(row.taskId)\n    else failedTaskIds.push(row.taskId)\n\n    if (isBaseline) continue\n    if (row.completeness !== 'complete' || baseline.completeness !== 'complete') {\n      comparisonMissingTaskIds.push(row.taskId)\n    } else if (row.pass && !baseline.pass) benefitTaskIds.push(row.taskId)\n    else if (!row.pass && baseline.pass) regressionTaskIds.push(row.taskId)\n  }\n  return {\n    resolvedTaskIds,\n    failedTaskIds,\n    missingTaskIds,\n    invalidTaskIds,\n    benefitTaskIds,\n    regressionTaskIds,\n    comparisonMissingTaskIds,\n    netBenefit: benefitTaskIds.length - regressionTaskIds.length,\n  }\n}\n\nfunction summarizeCandidateEvidence<TRow extends CrossSurfaceTaskRow>(\n  rows: TRow[],\n  componentIds: string[],\n  field: 'fired' | 'effectObserved',\n): CrossSurfaceCandidateEvidence {\n  if (componentIds.length === 0) {\n    return {\n      byComponent: [],\n      allObservedTaskIds: [],\n      someObservedTaskIds: [],\n      noneObservedTaskIds: [],\n      unobservedTaskIds: [],\n    }\n  }\n  const byComponent: CrossSurfaceEvidenceBreakdown[] = componentIds.map((componentId) => {\n    const observedTaskIds: string[] = []\n    const notObservedTaskIds: string[] = []\n    const unobservedTaskIds: string[] = []\n    for (const row of rows) {\n      const value = evidenceValue(row, componentId, field)\n      if (value === true) observedTaskIds.push(row.taskId)\n      else if (value === false) notObservedTaskIds.push(row.taskId)\n      else unobservedTaskIds.push(row.taskId)\n    }\n    return { componentId, observedTaskIds, notObservedTaskIds, unobservedTaskIds }\n  })\n  const allObservedTaskIds: string[] = []\n  const someObservedTaskIds: string[] = []\n  const noneObservedTaskIds: string[] = []\n  const unobservedTaskIds: string[] = []\n  for (const row of rows) {\n    const values = componentIds.map((componentId) => evidenceValue(row, componentId, field))\n    if (values.some((value) => value === null)) unobservedTaskIds.push(row.taskId)\n    else if (values.every(Boolean)) allObservedTaskIds.push(row.taskId)\n    else if (values.some(Boolean)) someObservedTaskIds.push(row.taskId)\n    else noneObservedTaskIds.push(row.taskId)\n  }\n  return {\n    byComponent,\n    allObservedTaskIds,\n    someObservedTaskIds,\n    noneObservedTaskIds,\n    unobservedTaskIds,\n  }\n}\n\nfunction candidateEligibility<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summary: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n): CrossSurfaceEligibility {\n  const reasons: CrossSurfaceIneligibilityReason[] = []\n  if (summary.outcome.missingTaskIds.length > 0) reasons.push('missing_attempt')\n  if (summary.outcome.invalidTaskIds.length > 0) reasons.push('invalid_attempt')\n  if (summary.outcome.comparisonMissingTaskIds.length > 0) reasons.push('baseline_outcome_missing')\n  if (summary.outcome.benefitTaskIds.length <= summary.outcome.regressionTaskIds.length) {\n    reasons.push('benefit_not_greater_than_regression')\n  }\n  appendEvidenceEligibilityReasons(\n    reasons,\n    summary.firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendEvidenceEligibilityReasons(\n    reasons,\n    summary.effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, summary, baseline)) reasons.push('cost_limit_exceeded')\n  return { eligible: reasons.length === 0, reasons: unique(reasons) }\n}\n\nfunction appendEvidenceEligibilityReasons(\n  reasons: CrossSurfaceIneligibilityReason[],\n  evidence: CrossSurfaceCandidateEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfaceIneligibilityReason,\n  unobservedReason: CrossSurfaceIneligibilityReason,\n): void {\n  if (evidence.byComponent.some((component) => component.observedTaskIds.length < minimum)) {\n    reasons.push(belowReason)\n  }\n  if (\n    requireObserved &&\n    evidence.byComponent.some((component) => component.unobservedTaskIds.length > 0)\n  ) {\n    reasons.push(unobservedReason)\n  }\n}\n\nfunction rankedEligibleSingles<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n): CrossSurfaceCandidateSummary[] {\n  return [...context.singleByComponent.values()]\n    .map((candidate) => summaryById.get(candidate.candidateId)!)\n    .filter((summary) => summary.eligibility?.eligible)\n    .sort((left, right) => compareSingleSummaries(context, left, right))\n}\n\n/**\n * A neutral constituent may seed a composition when it has complete, bounded,\n * observed evidence and causes no baseline regression. Individual benefit is\n * deliberately left to the best-single arm rather than used as a pair gate.\n */\nfunction rankedInteractionReadySingles<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n): CrossSurfaceCandidateSummary[] {\n  return [...context.singleByComponent.values()]\n    .map((candidate) => summaryById.get(candidate.candidateId)!)\n    .filter(\n      (summary) =>\n        summary.outcome.regressionTaskIds.length === 0 &&\n        summary.eligibility?.reasons.every(\n          (reason) => reason === 'benefit_not_greater_than_regression',\n        ),\n    )\n    .sort((left, right) => compareSingleSummaries(context, left, right))\n}\n\nfunction compareSingleSummaries<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  left: CrossSurfaceCandidateSummary,\n  right: CrossSurfaceCandidateSummary,\n): number {\n  const byNetBenefit = right.outcome.netBenefit - left.outcome.netBenefit\n  if (byNetBenefit !== 0) return byNetBenefit\n  const byBenefit = right.outcome.benefitTaskIds.length - left.outcome.benefitTaskIds.length\n  if (byBenefit !== 0) return byBenefit\n  const byRegression =\n    left.outcome.regressionTaskIds.length - right.outcome.regressionTaskIds.length\n  if (byRegression !== 0) return byRegression\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = left.costs[metric]!.median - right.costs[metric]!.median\n    if (byCost !== 0) return byCost\n  }\n  const byBytes = left.candidate.artifactBytes - right.candidate.artifactBytes\n  if (byBytes !== 0) return byBytes\n  return (\n    context.candidateIndex.get(left.candidate.candidateId)! -\n    context.candidateIndex.get(right.candidate.candidateId)!\n  )\n}\n\nfunction buildPairwise<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  baseline: CrossSurfaceCandidateSummary,\n): CrossSurfacePairwiseEntry[] {\n  const interactionReadyIds = new Set(\n    interactionReadySingles.map((summary) => summary.candidate.candidateId),\n  )\n  const entries: CrossSurfacePairwiseEntry[] = []\n  for (let leftIndex = 0; leftIndex < context.components.length; leftIndex++) {\n    for (let rightIndex = leftIndex + 1; rightIndex < context.components.length; rightIndex++) {\n      const leftComponent = context.components[leftIndex]!\n      const rightComponent = context.components[rightIndex]!\n      const leftSingle = context.singleByComponent.get(leftComponent.componentId)!\n      const rightSingle = context.singleByComponent.get(rightComponent.componentId)!\n      const pair = context.candidateByComponents.get(\n        componentSetKey([leftComponent.componentId, rightComponent.componentId]),\n      )!\n      const pairSummary = summaryById.get(pair.candidateId)!\n      const leftSummary = summaryById.get(leftSingle.candidateId)!\n      const rightSummary = summaryById.get(rightSingle.candidateId)!\n      const synergyTaskIds: string[] = []\n      const interferenceTaskIds: string[] = []\n      for (const taskId of context.input.taskOrder) {\n        const pairRow = rowFor(context, pair.candidateId, taskId)\n        const leftRow = rowFor(context, leftSingle.candidateId, taskId)\n        const rightRow = rowFor(context, rightSingle.candidateId, taskId)\n        if (![pairRow, leftRow, rightRow].every((row) => row.completeness === 'complete')) continue\n        if (pairRow.pass && !leftRow.pass && !rightRow.pass) synergyTaskIds.push(taskId)\n        if (!pairRow.pass && (leftRow.pass || rightRow.pass)) interferenceTaskIds.push(taskId)\n      }\n      const incrementalVsConstituents: [\n        CrossSurfaceCandidateComparison,\n        CrossSurfaceCandidateComparison,\n      ] = [\n        compareCandidates(context, summaryById, leftSingle.candidateId, pair.candidateId),\n        compareCandidates(context, summaryById, rightSingle.candidateId, pair.candidateId),\n      ]\n      const betterSingle =\n        compareSingleSummaries(context, leftSummary, rightSummary) <= 0 ? leftSummary : rightSummary\n      const firing = summarizePairEvidence(\n        rowsFor(context, pair.candidateId),\n        leftComponent.componentId,\n        rightComponent.componentId,\n        'fired',\n      )\n      const effect = summarizePairEvidence(\n        rowsFor(context, pair.candidateId),\n        leftComponent.componentId,\n        rightComponent.componentId,\n        'effectObserved',\n      )\n      const compatibility = pairCompatibility(\n        context,\n        pairSummary,\n        baseline,\n        betterSingle,\n        incrementalVsConstituents,\n        interactionReadyIds.has(leftSingle.candidateId) &&\n          interactionReadyIds.has(rightSingle.candidateId),\n        interferenceTaskIds,\n        firing,\n        effect,\n      )\n      entries.push({\n        componentIds: [leftComponent.componentId, rightComponent.componentId],\n        singleCandidateIds: [leftSingle.candidateId, rightSingle.candidateId],\n        compositionCandidateId: pair.candidateId,\n        benefitTaskIds: [...pairSummary.outcome.benefitTaskIds],\n        regressionTaskIds: [...pairSummary.outcome.regressionTaskIds],\n        synergyTaskIds,\n        interferenceTaskIds,\n        incrementalVsConstituents,\n        relativeCostToBaseline: relativeCosts(context, pairSummary, baseline),\n        firing,\n        effect,\n        interaction: interactionEffect(\n          context,\n          baseline.candidate,\n          [leftSingle, rightSingle],\n          pair,\n        ),\n        compatibility,\n      })\n    }\n  }\n  return entries\n}\n\nfunction pairCompatibility<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  pair: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n  betterSingle: CrossSurfaceCandidateSummary,\n  comparisons: [CrossSurfaceCandidateComparison, CrossSurfaceCandidateComparison],\n  constituentsReady: boolean,\n  interferenceTaskIds: string[],\n  firing: CrossSurfacePairEvidence,\n  effect: CrossSurfacePairEvidence,\n): CrossSurfacePairCompatibility {\n  const reasons: CrossSurfacePairIncompatibilityReason[] = []\n  if (!constituentsReady) reasons.push('constituent_not_ready')\n  if (\n    pair.outcome.missingTaskIds.length > 0 ||\n    pair.outcome.invalidTaskIds.length > 0 ||\n    pair.outcome.comparisonMissingTaskIds.length > 0\n  ) {\n    reasons.push('pair_incomplete')\n  }\n  if (pair.outcome.regressionTaskIds.length > 0) reasons.push('baseline_regression')\n  if (interferenceTaskIds.length > 0) reasons.push('interference')\n  const betterComparison = comparisons.find(\n    (comparison) => comparison.comparatorCandidateId === betterSingle.candidate.candidateId,\n  )!\n  if (betterComparison.winsTaskIds.length === 0) reasons.push('no_incremental_resolution')\n  appendPairEvidenceReasons(\n    reasons,\n    firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendPairEvidenceReasons(\n    reasons,\n    effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, pair, baseline)) reasons.push('cost_limit_exceeded')\n  return {\n    compatible: reasons.length === 0,\n    reasons: unique(reasons),\n    betterSingleCandidateId: betterSingle.candidate.candidateId,\n  }\n}\n\nfunction appendPairEvidenceReasons(\n  reasons: CrossSurfacePairIncompatibilityReason[],\n  evidence: CrossSurfacePairEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfacePairIncompatibilityReason,\n  unobservedReason: CrossSurfacePairIncompatibilityReason,\n): void {\n  const leftObserved = evidence.bothTaskIds.length + evidence.leftOnlyTaskIds.length\n  const rightObserved = evidence.bothTaskIds.length + evidence.rightOnlyTaskIds.length\n  if (leftObserved < minimum || rightObserved < minimum) reasons.push(belowReason)\n  if (requireObserved && evidence.unobservedTaskIds.length > 0) reasons.push(unobservedReason)\n}\n\nfunction interactionEffect<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  baseline: CrossSurfaceCandidate,\n  singles: CrossSurfaceCandidate[],\n  composition: CrossSurfaceCandidate,\n): CrossSurfaceInteractionEffect {\n  const perTask = context.input.taskOrder.map((taskId) => {\n    const baselineRow = rowFor(context, baseline.candidateId, taskId)\n    const singleRows = singles.map((single) => rowFor(context, single.candidateId, taskId))\n    const compositionRow = rowFor(context, composition.candidateId, taskId)\n    const rows = [baselineRow, ...singleRows, compositionRow]\n    if (!rows.every((row) => row.completeness === 'complete')) {\n      return { taskId, passInteraction: null, scoreInteraction: null }\n    }\n    const additivePass =\n      singleRows.reduce((sum, row) => sum + Number(row.pass), 0) -\n      (singles.length - 1) * Number(baselineRow.pass)\n    const additiveScore =\n      singleRows.reduce((sum, row) => sum + (row.score as number), 0) -\n      (singles.length - 1) * (baselineRow.score as number)\n    return {\n      taskId,\n      passInteraction: Number(compositionRow.pass) - additivePass,\n      scoreInteraction: (compositionRow.score as number) - additiveScore,\n    }\n  })\n  const complete = perTask.filter(\n    (row): row is { taskId: string; passInteraction: number; scoreInteraction: number } =>\n      row.passInteraction !== null && row.scoreInteraction !== null,\n  )\n  const passInteractions = complete.map((row) => row.passInteraction)\n  const scoreInteractions = complete.map((row) => row.scoreInteraction)\n  return {\n    perTask,\n    n: complete.length,\n    nMissing: perTask.length - complete.length,\n    meanPassInteraction: meanOrNull(passInteractions),\n    meanScoreInteraction: meanOrNull(scoreInteractions),\n    passBootstrap: bootstrapInteraction(passInteractions, context),\n    scoreBootstrap: bootstrapInteraction(scoreInteractions, context),\n  }\n}\n\nfunction bootstrapInteraction<TRow extends CrossSurfaceTaskRow>(\n  interactions: number[],\n  context: AnalysisContext<TRow>,\n) {\n  if (interactions.length === 0) return null\n  return pairedBootstrap(new Array(interactions.length).fill(0), interactions, {\n    ...context.input.bootstrap,\n    statistic: 'mean',\n  })\n}\n\nfunction selectCandidates<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  eligibleSingles: CrossSurfaceCandidateSummary[],\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairwise: CrossSurfacePairwiseEntry[],\n): CrossSurfaceSelections {\n  const bestSingleRanking = eligibleSingles.filter((summary) => {\n    const componentId = summary.candidate.componentIds[0]!\n    return context.componentById.get(componentId)!.bestSingleEligible\n  })\n  const ranking: CrossSurfaceRankedSingle[] = bestSingleRanking.map((summary, index) => ({\n    rank: index + 1,\n    candidateId: summary.candidate.candidateId,\n    componentId: summary.candidate.componentIds[0]!,\n  }))\n  const best = bestSingleRanking[0]\n  const bestSingle = best\n    ? {\n        candidateId: best.candidate.candidateId,\n        componentId: best.candidate.componentIds[0]!,\n        ranking,\n      }\n    : null\n  const naiveStack = selectNaiveStack(context, eligibleSingles)\n  const interactionAware = selectInteractionAware(\n    context,\n    summaryById,\n    interactionReadySingles,\n    pairwise,\n  )\n  return { bestSingle, naiveStack, interactionAware }\n}\n\nfunction selectNaiveStack<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  eligibleSingles: CrossSurfaceCandidateSummary[],\n): CrossSurfaceNaiveStackSelection | null {\n  if (eligibleSingles.length === 0) return null\n  const componentIds = eligibleSingles\n    .map((summary) => summary.candidate.componentIds[0]!)\n    .sort((left, right) => context.componentIndex.get(left)! - context.componentIndex.get(right)!)\n  const candidate = context.candidateByComponents.get(componentSetKey(componentIds))\n  if (!candidate) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: naive stack [${componentIds.join(', ')}] was not evaluated`,\n    )\n  }\n  return { candidateId: candidate.candidateId, componentIds }\n}\n\nfunction selectInteractionAware<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairwise: CrossSurfacePairwiseEntry[],\n): CrossSurfaceInteractionAwareSelection | null {\n  const baseline = summaryById.get(context.input.baselineCandidateId)!\n  const pairByComponents = new Map(\n    pairwise.map((entry) => [componentSetKey(entry.componentIds), entry]),\n  )\n  const paths = pairwise\n    .filter((entry) => entry.compatibility.compatible)\n    .map((entry) =>\n      growInteractionPath(\n        context,\n        summaryById,\n        interactionReadySingles,\n        pairByComponents,\n        baseline,\n        summaryById.get(entry.compositionCandidateId)!,\n      ),\n    )\n  if (paths.length === 0) return null\n\n  const qualified = paths\n    .filter((path) => path.qualified)\n    .sort((left, right) => compareInteractionPaths(context, summaryById, left, right))\n  const winning =\n    qualified[0] ??\n    [...paths].sort((left, right) => compareInteractionPaths(context, summaryById, left, right))[0]!\n  return {\n    seedCandidateId: winning.seedCandidateId,\n    terminalCandidateId: winning.terminalCandidateId,\n    terminalComponentIds: [...winning.terminalComponentIds],\n    selectedCandidateId: qualified.length > 0 ? winning.terminalCandidateId : null,\n    qualified: qualified.length > 0,\n    evaluatedPaths: paths,\n    steps: winning.steps,\n  }\n}\n\nfunction growInteractionPath<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairByComponents: Map<string, CrossSurfacePairwiseEntry>,\n  baseline: CrossSurfaceCandidateSummary,\n  seed: CrossSurfaceCandidateSummary,\n): CrossSurfaceInteractionPath {\n  let current = seed\n  let retained = [...seed.candidate.componentIds]\n  let remaining = interactionReadySingles.filter(\n    (summary) => !retained.includes(summary.candidate.componentIds[0]!),\n  )\n  const steps: CrossSurfaceCompositionStep[] = []\n\n  while (remaining.length > 0) {\n    const decisions = remaining.map((addition) =>\n      evaluateAddition(\n        context,\n        summaryById,\n        pairByComponents,\n        baseline,\n        current,\n        retained,\n        addition,\n      ),\n    )\n    const eligible = decisions\n      .filter((decision) => decision.eligible)\n      .sort((left, right) => compareAdditionDecisions(context, summaryById, left, right))\n    const selected = eligible[0]\n    if (selected) selected.selected = true\n    steps.push({\n      fromCandidateId: current.candidate.candidateId,\n      retainedComponentIds: [...retained],\n      considered: decisions.sort(\n        (left, right) =>\n          context.candidateIndex.get(left.additionCandidateId)! -\n          context.candidateIndex.get(right.additionCandidateId)!,\n      ),\n      selectedCandidateId: selected?.bundleCandidateId ?? null,\n    })\n    if (!selected?.bundleCandidateId) break\n    current = summaryById.get(selected.bundleCandidateId)!\n    retained = [...current.candidate.componentIds]\n    remaining = remaining.filter(\n      (summary) => summary.candidate.candidateId !== selected.additionCandidateId,\n    )\n  }\n\n  const qualified = retained.length >= context.input.selection.minimumBundleComponents\n  return {\n    seedCandidateId: seed.candidate.candidateId,\n    terminalCandidateId: current.candidate.candidateId,\n    terminalComponentIds: retained,\n    qualified,\n    steps,\n  }\n}\n\nfunction compareInteractionPaths<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  left: CrossSurfaceInteractionPath,\n  right: CrossSurfaceInteractionPath,\n): number {\n  const leftSummary = summaryById.get(left.terminalCandidateId)!\n  const rightSummary = summaryById.get(right.terminalCandidateId)!\n  const byNetBenefit = rightSummary.outcome.netBenefit - leftSummary.outcome.netBenefit\n  if (byNetBenefit !== 0) return byNetBenefit\n  const byBenefit =\n    rightSummary.outcome.benefitTaskIds.length - leftSummary.outcome.benefitTaskIds.length\n  if (byBenefit !== 0) return byBenefit\n  const byRegression =\n    leftSummary.outcome.regressionTaskIds.length - rightSummary.outcome.regressionTaskIds.length\n  if (byRegression !== 0) return byRegression\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = leftSummary.costs[metric]!.median - rightSummary.costs[metric]!.median\n    if (byCost !== 0) return byCost\n  }\n  const byBytes = leftSummary.candidate.artifactBytes - rightSummary.candidate.artifactBytes\n  if (byBytes !== 0) return byBytes\n  const byCandidateOrder =\n    context.candidateIndex.get(left.terminalCandidateId)! -\n    context.candidateIndex.get(right.terminalCandidateId)!\n  if (byCandidateOrder !== 0) return byCandidateOrder\n  return (\n    context.candidateIndex.get(left.seedCandidateId)! -\n    context.candidateIndex.get(right.seedCandidateId)!\n  )\n}\n\nfunction evaluateAddition<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  pairByComponents: Map<string, CrossSurfacePairwiseEntry>,\n  baseline: CrossSurfaceCandidateSummary,\n  current: CrossSurfaceCandidateSummary,\n  retained: string[],\n  addition: CrossSurfaceCandidateSummary,\n): CrossSurfaceAdditionDecision {\n  const additionComponentId = addition.candidate.componentIds[0]!\n  const reasons: CrossSurfaceAdditionRejectionReason[] = []\n  for (const retainedComponentId of retained) {\n    const pair = pairByComponents.get(\n      componentSetKey(canonicalComponents(context, [retainedComponentId, additionComponentId])),\n    )\n    if (!pair?.compatibility.compatible) reasons.push('pair_incompatible')\n  }\n  const bundleComponents = canonicalComponents(context, [...retained, additionComponentId])\n  const bundle = context.candidateByComponents.get(componentSetKey(bundleComponents))\n  if (!bundle) {\n    reasons.push('full_bundle_not_evaluated')\n    return emptyAdditionDecision(addition, additionComponentId, reasons)\n  }\n  const bundleSummary = summaryById.get(bundle.candidateId)!\n  if (\n    bundleSummary.outcome.missingTaskIds.length > 0 ||\n    bundleSummary.outcome.invalidTaskIds.length > 0 ||\n    bundleSummary.outcome.comparisonMissingTaskIds.length > 0\n  ) {\n    reasons.push('bundle_incomplete')\n  }\n  if (bundleSummary.outcome.regressionTaskIds.length > 0) reasons.push('baseline_regression')\n  const comparison = compareCandidates(\n    context,\n    summaryById,\n    current.candidate.candidateId,\n    bundle.candidateId,\n  )\n  if (comparison.winsTaskIds.length === 0) reasons.push('no_incremental_resolution')\n  if (comparison.regressionTaskIds.length > 0) reasons.push('incremental_regression')\n  appendBundleEvidenceReasons(\n    reasons,\n    bundleSummary.firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendBundleEvidenceReasons(\n    reasons,\n    bundleSummary.effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, bundleSummary, baseline)) reasons.push('cost_limit_exceeded')\n  return {\n    additionCandidateId: addition.candidate.candidateId,\n    additionComponentId,\n    bundleCandidateId: bundle.candidateId,\n    incrementalResolutionTaskIds: comparison.winsTaskIds,\n    incrementalRegressionTaskIds: comparison.regressionTaskIds,\n    incrementalMedianCost: Object.fromEntries(\n      context.input.costMetricOrder.map((metric) => [\n        metric,\n        bundleSummary.costs[metric]!.median - current.costs[metric]!.median,\n      ]),\n    ),\n    eligible: reasons.length === 0,\n    selected: false,\n    reasons: unique(reasons),\n  }\n}\n\nfunction emptyAdditionDecision(\n  addition: CrossSurfaceCandidateSummary,\n  additionComponentId: string,\n  reasons: CrossSurfaceAdditionRejectionReason[],\n): CrossSurfaceAdditionDecision {\n  return {\n    additionCandidateId: addition.candidate.candidateId,\n    additionComponentId,\n    bundleCandidateId: null,\n    incrementalResolutionTaskIds: [],\n    incrementalRegressionTaskIds: [],\n    incrementalMedianCost: null,\n    eligible: false,\n    selected: false,\n    reasons: unique(reasons),\n  }\n}\n\nfunction appendBundleEvidenceReasons(\n  reasons: CrossSurfaceAdditionRejectionReason[],\n  evidence: CrossSurfaceCandidateEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfaceAdditionRejectionReason,\n  unobservedReason: CrossSurfaceAdditionRejectionReason,\n): void {\n  if (evidence.byComponent.some((component) => component.observedTaskIds.length < minimum)) {\n    reasons.push(belowReason)\n  }\n  if (\n    requireObserved &&\n    evidence.byComponent.some((component) => component.unobservedTaskIds.length > 0)\n  ) {\n    reasons.push(unobservedReason)\n  }\n}\n\nfunction compareAdditionDecisions<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  left: CrossSurfaceAdditionDecision,\n  right: CrossSurfaceAdditionDecision,\n): number {\n  const byWins =\n    right.incrementalResolutionTaskIds.length - left.incrementalResolutionTaskIds.length\n  if (byWins !== 0) return byWins\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = left.incrementalMedianCost![metric]! - right.incrementalMedianCost![metric]!\n    if (byCost !== 0) return byCost\n  }\n  const leftBytes = summaryById.get(left.additionCandidateId)!.candidate.artifactBytes\n  const rightBytes = summaryById.get(right.additionCandidateId)!.candidate.artifactBytes\n  const byBytes = leftBytes - rightBytes\n  if (byBytes !== 0) return byBytes\n  return (\n    context.candidateIndex.get(left.additionCandidateId)! -\n    context.candidateIndex.get(right.additionCandidateId)!\n  )\n}\n\nfunction compareCandidates<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  comparatorCandidateId: string,\n  treatmentCandidateId: string,\n): CrossSurfaceCandidateComparison {\n  const winsTaskIds: string[] = []\n  const regressionTaskIds: string[] = []\n  const missingTaskIds: string[] = []\n  for (const taskId of context.input.taskOrder) {\n    const comparator = rowFor(context, comparatorCandidateId, taskId)\n    const treatment = rowFor(context, treatmentCandidateId, taskId)\n    if (comparator.completeness !== 'complete' || treatment.completeness !== 'complete') {\n      missingTaskIds.push(taskId)\n    } else if (treatment.pass && !comparator.pass) winsTaskIds.push(taskId)\n    else if (!treatment.pass && comparator.pass) regressionTaskIds.push(taskId)\n  }\n  return {\n    comparatorCandidateId,\n    treatmentCandidateId,\n    winsTaskIds,\n    regressionTaskIds,\n    missingTaskIds,\n    paired: pairedComparison(context, comparatorCandidateId, treatmentCandidateId),\n    relativeCost: relativeCosts(\n      context,\n      summaryById.get(treatmentCandidateId)!,\n      summaryById.get(comparatorCandidateId)!,\n    ),\n  }\n}\n\nfunction pairedComparison<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  comparatorCandidateId: string,\n  treatmentCandidateId: string,\n): PairedArmsComparison {\n  const rows: PairedArmRow[] = []\n  for (const taskId of context.input.taskOrder) {\n    rows.push(toPairedArmRow(context, rowFor(context, comparatorCandidateId, taskId)))\n    rows.push(toPairedArmRow(context, rowFor(context, treatmentCandidateId, taskId)))\n  }\n  return comparePairedArms(rows, {\n    baselineArm: comparatorCandidateId,\n    treatmentArm: treatmentCandidateId,\n    metricNames: ['score', ...context.input.costMetricOrder],\n    bootstrap: { ...context.input.bootstrap, statistic: 'mean' },\n  })\n}\n\nfunction toPairedArmRow<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  row: TRow,\n): PairedArmRow {\n  const metrics: Record<string, number> = Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => [metric, row.cost[metric] as number]),\n  )\n  if (row.completeness === 'complete') metrics.score = row.score as number\n  return {\n    pairKey: row.taskId,\n    arm: row.candidateId,\n    ...(row.completeness === 'complete' ? { pass: row.pass as boolean } : {}),\n    metrics,\n  }\n}\n\nfunction summarizePairEvidence<TRow extends CrossSurfaceTaskRow>(\n  rows: TRow[],\n  leftComponentId: string,\n  rightComponentId: string,\n  field: 'fired' | 'effectObserved',\n): CrossSurfacePairEvidence {\n  const bothTaskIds: string[] = []\n  const leftOnlyTaskIds: string[] = []\n  const rightOnlyTaskIds: string[] = []\n  const neitherTaskIds: string[] = []\n  const unobservedTaskIds: string[] = []\n  for (const row of rows) {\n    const left = evidenceValue(row, leftComponentId, field)\n    const right = evidenceValue(row, rightComponentId, field)\n    if (left === null || right === null) unobservedTaskIds.push(row.taskId)\n    else if (left && right) bothTaskIds.push(row.taskId)\n    else if (left) leftOnlyTaskIds.push(row.taskId)\n    else if (right) rightOnlyTaskIds.push(row.taskId)\n    else neitherTaskIds.push(row.taskId)\n  }\n  return {\n    bothTaskIds,\n    leftOnlyTaskIds,\n    rightOnlyTaskIds,\n    neitherTaskIds,\n    unobservedTaskIds,\n  }\n}\n\nfunction relativeCosts<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  treatment: CrossSurfaceCandidateSummary,\n  comparator: CrossSurfaceCandidateSummary,\n): Record<string, CrossSurfaceRelativeCost> {\n  return Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => {\n      const treatmentMedian = treatment.costs[metric]!.median\n      const comparatorMedian = comparator.costs[metric]!.median\n      return [\n        metric,\n        {\n          treatmentMedian,\n          comparatorMedian,\n          medianDelta: treatmentMedian - comparatorMedian,\n          medianRatio:\n            comparatorMedian === 0\n              ? treatmentMedian === 0\n                ? 1\n                : null\n              : treatmentMedian / comparatorMedian,\n        },\n      ]\n    }),\n  )\n}\n\nfunction withinCostLimits<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  treatment: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n): boolean {\n  const relative = relativeCosts(context, treatment, baseline)\n  return Object.entries(context.input.selection.maximumMedianCostRatioToBaseline).every(\n    ([metric, limit]) => {\n      const ratio = relative[metric]!.medianRatio\n      return ratio !== null && ratio <= limit\n    },\n  )\n}\n\nfunction distribution(values: number[]): CrossSurfaceDistribution {\n  const sorted = [...values].sort((left, right) => left - right)\n  const total = sorted.reduce((sum, value) => sum + value, 0)\n  const middle = Math.floor(sorted.length / 2)\n  const median =\n    sorted.length % 2 === 1 ? sorted[middle]! : (sorted[middle - 1]! + sorted[middle]!) / 2\n  return {\n    n: sorted.length,\n    min: sorted[0]!,\n    median,\n    mean: total / sorted.length,\n    max: sorted[sorted.length - 1]!,\n    total,\n  }\n}\n\nfunction evidenceValue(\n  row: CrossSurfaceTaskRow,\n  componentId: string,\n  field: 'fired' | 'effectObserved',\n): boolean | null {\n  return row.componentEvidence.find((evidence) => evidence.componentId === componentId)![field]\n}\n\nfunction meanOrNull(values: number[]): number | null {\n  return values.length === 0 ? null : values.reduce((sum, value) => sum + value, 0) / values.length\n}\n\nfunction unique<T>(values: T[]): T[] {\n  return [...new Set(values)]\n}\n","import { createHash } from 'node:crypto'\nimport { existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { isAbsolute, join, relative, resolve } from 'node:path'\nimport { contentHash } from '../verdict-cache'\nimport { type CampaignRunPlan, type PlanCampaignRunOptions, planCampaignRun } from './run-campaign'\nimport type { CampaignStorage } from './storage'\nimport type { JudgeConfig, Scenario } from './types'\n\nexport type EvalFixtureValidationMode = 'vitest' | 'none'\n\nexport interface EvalFixtureFile {\n  path: string\n  sha256: string\n  bytes: number\n}\n\nexport interface EvalFixture {\n  name: string\n  path: string\n  promptPath: string\n  evalPath?: string\n  packageJsonPath?: string\n  prompt: string\n  files: EvalFixtureFile[]\n  fingerprint: string\n}\n\nexport interface EvalFixtureScenario extends Scenario {\n  kind: 'eval-fixture'\n  fixtureName: string\n  fixturePath: string\n  promptPath: string\n  evalPath?: string\n  packageJsonPath?: string\n  prompt: string\n  fingerprint: string\n}\n\nexport interface EvalFixtureLoadOptions {\n  /** `vitest` requires EVAL.ts/EVAL.tsx and package.json type=module. `none` only requires PROMPT.md. */\n  validation?: EvalFixtureValidationMode\n  /** Extra caller-owned knobs that affect fixture behavior, folded into the fingerprint. */\n  fingerprintConfig?: unknown\n}\n\nexport interface LoadEvalFixtureScenariosOptions extends EvalFixtureLoadOptions {\n  names?: string[]\n}\n\nexport interface PlanEvalFixtureRunOptions<TArtifact = unknown>\n  extends Pick<\n    PlanCampaignRunOptions<EvalFixtureScenario, TArtifact>,\n    'dispatchRef' | 'judges' | 'seed' | 'reps' | 'resumable' | 'runDir'\n  > {\n  evalsDir: string\n  validation?: EvalFixtureValidationMode\n  fingerprintConfig?: unknown\n  names?: string[]\n  storage?: CampaignStorage\n}\n\nexport type EvalFixtureRunPlan = CampaignRunPlan & {\n  fixtures: Array<Pick<EvalFixtureScenario, 'fixtureName' | 'fixturePath' | 'fingerprint'>>\n}\n\n/** Walk `evalsDir` and return the relative name of every fixture directory (one containing an exact-case `PROMPT.md`). */\nexport function discoverEvalFixtures(evalsDir: string): string[] {\n  const root = resolve(evalsDir)\n  if (!existsSync(root)) throw new Error(`discoverEvalFixtures: evalsDir not found: ${root}`)\n\n  const fixtures: string[] = []\n  const walk = (dir: string, base = '') => {\n    for (const entry of readdirSync(dir).sort()) {\n      if (entry.startsWith('.') || entry === 'node_modules') continue\n      const fullPath = join(dir, entry)\n      if (!statSync(fullPath).isDirectory()) continue\n\n      const name = base ? `${base}/${entry}` : entry\n      if (existsWithExactCase(fullPath, 'PROMPT.md')) {\n        fixtures.push(name)\n      } else {\n        walk(fullPath, name)\n      }\n    }\n  }\n\n  walk(root)\n  return fixtures\n}\n\n/**\n * Load ONE fixture by name: reads `PROMPT.md` (plus `EVAL.ts`/`EVAL.tsx` and `package.json` under\n * `vitest` validation) and content-fingerprints the full file set for cache identity.\n */\nexport function loadEvalFixture(\n  evalsDir: string,\n  name: string,\n  options: EvalFixtureLoadOptions = {},\n): EvalFixture {\n  const validation = options.validation ?? 'vitest'\n  const root = resolve(evalsDir)\n  const fixturePath = resolve(root, name)\n  assertInside(root, fixturePath, name)\n\n  if (!existsSync(fixturePath) || !statSync(fixturePath).isDirectory()) {\n    throw new Error(`loadEvalFixture: fixture not found: ${name}`)\n  }\n  if (!existsWithExactCase(fixturePath, 'PROMPT.md')) {\n    throw new Error(`loadEvalFixture: ${name} is missing exact-case PROMPT.md`)\n  }\n\n  const promptPath = join(fixturePath, 'PROMPT.md')\n  const evalPath = resolveEvalPath(fixturePath)\n  const packageJsonPath = existsWithExactCase(fixturePath, 'package.json')\n    ? join(fixturePath, 'package.json')\n    : undefined\n\n  if (validation !== 'none') {\n    if (!evalPath)\n      throw new Error(`loadEvalFixture: ${name} is missing exact-case EVAL.ts or EVAL.tsx`)\n    if (!packageJsonPath)\n      throw new Error(`loadEvalFixture: ${name} is missing exact-case package.json`)\n    assertModulePackage(packageJsonPath, name)\n  }\n\n  const files = collectFixtureFiles(fixturePath)\n  return {\n    name,\n    path: fixturePath,\n    promptPath,\n    evalPath,\n    packageJsonPath,\n    prompt: readFileSync(promptPath, 'utf8'),\n    files,\n    fingerprint: contentHash({\n      files,\n      config: options.fingerprintConfig ?? null,\n    }),\n  }\n}\n\n/** Load fixtures (all discovered, or just `names`) as campaign `Scenario`s tagged `eval-fixture`. */\nexport function loadEvalFixtureScenarios(\n  evalsDir: string,\n  options: LoadEvalFixtureScenariosOptions = {},\n): EvalFixtureScenario[] {\n  const names = options.names ?? discoverEvalFixtures(evalsDir)\n  return names.map((name) => {\n    const fixture = loadEvalFixture(evalsDir, name, options)\n    return {\n      id: fixture.name,\n      kind: 'eval-fixture',\n      tags: ['eval-fixture'],\n      fixtureName: fixture.name,\n      fixturePath: fixture.path,\n      promptPath: fixture.promptPath,\n      evalPath: fixture.evalPath,\n      packageJsonPath: fixture.packageJsonPath,\n      prompt: fixture.prompt,\n      fingerprint: fixture.fingerprint,\n    }\n  })\n}\n\n/**\n * Dry-run planner for a fixture campaign: loads the scenarios, delegates to `planCampaignRun`,\n * and returns the plan plus each fixture's name/path/fingerprint.\n */\nexport function planEvalFixtureRun<TArtifact = unknown>(\n  options: PlanEvalFixtureRunOptions<TArtifact>,\n): EvalFixtureRunPlan {\n  const scenarios = loadEvalFixtureScenarios(options.evalsDir, {\n    names: options.names,\n    validation: options.validation,\n    fingerprintConfig: options.fingerprintConfig,\n  })\n  const plan = planCampaignRun<EvalFixtureScenario, TArtifact>({\n    scenarios,\n    dispatchRef: options.dispatchRef ?? 'eval-fixture-dispatch',\n    judges: options.judges as JudgeConfig<TArtifact, EvalFixtureScenario>[] | undefined,\n    seed: options.seed,\n    reps: options.reps,\n    resumable: options.resumable,\n    runDir: options.runDir,\n    storage: options.storage,\n  })\n\n  return {\n    ...plan,\n    fixtures: scenarios.map((scenario) => ({\n      fixtureName: scenario.fixtureName,\n      fixturePath: scenario.fixturePath,\n      fingerprint: scenario.fingerprint,\n    })),\n  }\n}\n\nfunction existsWithExactCase(dirPath: string, fileName: string): boolean {\n  try {\n    return readdirSync(dirPath).includes(fileName)\n  } catch {\n    return false\n  }\n}\n\nfunction resolveEvalPath(fixturePath: string): string | undefined {\n  if (existsWithExactCase(fixturePath, 'EVAL.ts')) return join(fixturePath, 'EVAL.ts')\n  if (existsWithExactCase(fixturePath, 'EVAL.tsx')) return join(fixturePath, 'EVAL.tsx')\n  return undefined\n}\n\nfunction assertModulePackage(packageJsonPath: string, name: string): void {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(readFileSync(packageJsonPath, 'utf8'))\n  } catch (err) {\n    throw new Error(\n      `loadEvalFixture: ${name} package.json is invalid JSON: ${err instanceof Error ? err.message : String(err)}`,\n    )\n  }\n\n  if (\n    typeof parsed !== 'object' ||\n    parsed === null ||\n    (parsed as { type?: unknown }).type !== 'module'\n  ) {\n    throw new Error(`loadEvalFixture: ${name} package.json must set \"type\": \"module\"`)\n  }\n}\n\nfunction collectFixtureFiles(fixturePath: string, base = ''): EvalFixtureFile[] {\n  const files: EvalFixtureFile[] = []\n  for (const entry of readdirSync(join(fixturePath, base)).sort()) {\n    if (entry === 'node_modules' || entry === '.git') continue\n    const relativePath = base ? `${base}/${entry}` : entry\n    const fullPath = join(fixturePath, relativePath)\n    const stat = statSync(fullPath)\n    if (stat.isDirectory()) {\n      files.push(...collectFixtureFiles(fixturePath, relativePath))\n      continue\n    }\n    const bytes = readFileSync(fullPath)\n    files.push({\n      path: relativePath,\n      sha256: createHash('sha256').update(bytes).digest('hex'),\n      bytes: bytes.byteLength,\n    })\n  }\n  return files\n}\n\nfunction assertInside(root: string, target: string, label: string): void {\n  const rel = relative(root, target)\n  if (rel === '' || (!rel.startsWith('..') && !isAbsolute(rel))) return\n  throw new Error(`loadEvalFixture: fixture path escapes evalsDir: ${label}`)\n}\n","/**\n * @module\n * Composable placebo / neutralization promotion gate.\n *\n * A held-out gate proves a candidate beat baseline. It CANNOT prove the lift came\n * from the candidate's CONTENT rather than from the prompt/mount FOOTPRINT the\n * content happened to add (more bytes, a longer prompt). This gate closes that\n * hole: it compares the candidate's held-out lift against the lift of a\n * FOOTPRINT-MATCHED neutralized variant (same layout + length, zero content, via\n * `neutralizeText`). If the neutralized variant reproduces more than\n * `maxDecorativeFraction` of the candidate's lift, the lift is decorative — it\n * survives blanking the content — and the candidate is HELD regardless of how\n * large or significant its raw lift is.\n *\n * Compose it AFTER the significance gate — significance says the lift is real,\n * this says the lift is CAUSED BY THE CONTENT:\n *   composeGate(heldOutGate({ ... }), neutralizationGate({ ... }))\n *\n * Requires `ctx.neutralizedJudgeScores`, populated by `runImprovementLoop` when it\n * is given a `neutralize` function. A gate composed without that wiring fails\n * loud rather than silently passing an unproven candidate.\n */\n\nimport type { Gate, GateContext, GateResult, Scenario } from '../types'\nimport { pairHoldout } from './statistical-heldout'\n\nexport interface NeutralizationGateOptions<TScenario extends Scenario = Scenario> {\n  scenarios: TScenario[]\n  /** Reject when the neutralized (content-blanked, footprint-matched) variant\n   *  reproduces at least this fraction of the candidate's held-out lift. Default\n   *  0.5 — if blanking the content keeps half the lift, the content is decorative.\n   *  Equality rejects: a neutralized lift == threshold·candidateLift is decorative. */\n  maxDecorativeFraction?: number\n}\n\n/** Mean of a numeric array; 0 for an empty array (callers guard n separately). */\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\n/** Paired mean held-out lift of `arm` over baseline, on the in-scope cells. */\nfunction pairedLift(\n  arm: Map<string, Record<string, { composite: number }>>,\n  baseline: Map<string, Record<string, { composite: number }>>,\n  scenarioIds: Set<string>,\n): { lift: number; n: number } {\n  const paired = pairHoldout(arm as never, baseline as never, scenarioIds, (s) => s.composite)\n  const deltas = paired.after.map((a, i) => a - (paired.before[i] ?? 0))\n  return { lift: mean(deltas), n: deltas.length }\n}\n\n/**\n * Composable placebo gate: ships only when the candidate's held-out lift is NOT\n * mostly reproduced by a footprint-matched neutralized variant.\n */\nexport function neutralizationGate<TArtifact, TScenario extends Scenario>(\n  options: NeutralizationGateOptions<TScenario>,\n): Gate<TArtifact, TScenario> {\n  const maxDecorativeFraction = options.maxDecorativeFraction ?? 0.5\n  return {\n    name: 'neutralizationGate',\n    async decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult> {\n      if (!ctx.baselineJudgeScores) {\n        throw new Error(\n          'neutralizationGate: ctx.baselineJudgeScores is required — the placebo control measures lift OVER baseline.',\n        )\n      }\n      if (!ctx.neutralizedJudgeScores) {\n        throw new Error(\n          'neutralizationGate: ctx.neutralizedJudgeScores is required. It is populated by runImprovementLoop only when a `neutralize` function is supplied — composing this gate without that wiring would pass an unproven candidate.',\n        )\n      }\n      const scenarioIds = new Set(options.scenarios.map((s) => s.id))\n      const cand = pairedLift(\n        ctx.judgeScores as never,\n        ctx.baselineJudgeScores as never,\n        scenarioIds,\n      )\n      const neut = pairedLift(\n        ctx.neutralizedJudgeScores as never,\n        ctx.baselineJudgeScores as never,\n        scenarioIds,\n      )\n\n      // No positive candidate lift → nothing to attribute. Fail closed: the\n      // placebo control has no basis to clear the candidate (the significance\n      // gate is what judges lift magnitude; this one only judges its CAUSE).\n      if (cand.lift <= 0) {\n        return {\n          decision: 'hold',\n          reasons: [\n            `neutralization: candidate held-out lift ${cand.lift.toFixed(3)} ≤ 0 — no positive lift to attribute to content`,\n          ],\n          contributingGates: [\n            {\n              name: 'neutralizationGate',\n              status: 'fail',\n              detail: { candidateLift: cand.lift, neutralizedLift: neut.lift, n: cand.n },\n            },\n          ],\n          delta: cand.lift,\n        }\n      }\n\n      const decorativeFraction = neut.lift / cand.lift\n      const passed = decorativeFraction < maxDecorativeFraction\n      const pct = (decorativeFraction * 100).toFixed(0)\n      return {\n        decision: passed ? 'ship' : 'hold',\n        reasons: passed\n          ? [\n              `neutralization: content is causal — blanked variant reproduces ${pct}% of the lift (< ${(maxDecorativeFraction * 100).toFixed(0)}%); candidate Δ ${cand.lift.toFixed(3)}, neutralized Δ ${neut.lift.toFixed(3)}`,\n            ]\n          : [\n              `neutralization: lift is DECORATIVE — blanking the content (footprint-matched) reproduces ${pct}% of the lift (≥ ${(maxDecorativeFraction * 100).toFixed(0)}%); candidate Δ ${cand.lift.toFixed(3)}, neutralized Δ ${neut.lift.toFixed(3)}`,\n            ],\n        contributingGates: [\n          {\n            name: 'neutralizationGate',\n            status: passed ? 'pass' : 'fail',\n            detail: {\n              candidateLift: cand.lift,\n              neutralizedLift: neut.lift,\n              decorativeFraction,\n              maxDecorativeFraction,\n              n: cand.n,\n            },\n          },\n        ],\n        delta: cand.lift,\n      }\n    },\n  }\n}\n","/**\n * Evidence grounding for reflective optimizers (GEPA-style revise loops).\n *\n * Two failure modes recur when an LLM revises an artifact from raw rollout\n * traces (first measured in agent-lab R358, where naive reflection REGRESSED\n * the score 0.375 -> 0.125 before these helpers fixed it):\n *\n * 1. The environment often hides WHY a rollout failed - a tool call can\n *    succeed while an invisible downstream check fails - so the reviser\n *    cannot see the cause in the transcript. The only reliable signal is the\n *    field-level difference between what passing and failing rollouts did.\n *    `rolloutArgumentDiff` computes that difference deterministically so the\n *    reviser is handed the diff instead of being trusted to derive it.\n *\n * 2. Revisers invent plausible-but-wrong literal values (\"use 'new'\",\n *    \"use 'sent'\") that no passing rollout ever used, turning every rollout\n *    into a failure. `classifyUngroundedLiterals` mechanically detects them,\n *    separating HARMFUL literals (ones failing rollouts actually used -\n *    proven damage) from benign illustrations (e.g. a name example like\n *    'Doe'), so callers can hard-reject the former and merely log the latter.\n *    Rejecting every ungrounded quoted word is too blunt: it killed a run\n *    over a surname illustration before the severity split existed.\n *\n * Pure data in, data out: no LLM calls, no filesystem, no domain knowledge.\n */\n\n/** One tool/action call observed in a rollout: a name plus its arguments. */\nexport interface RolloutCall {\n  readonly name: string\n  readonly args: Readonly<Record<string, unknown>>\n}\n\n/** A scored rollout: its calls plus the scalar outcome used to split pass/fail. */\nexport interface ScoredRollout {\n  /** Caller-meaningful identifier (task id, cell id) used only for reporting. */\n  readonly id: string\n  /** Scalar outcome in [0, 1]; `passThreshold` splits passing from failing. */\n  readonly score: number\n  readonly calls: readonly RolloutCall[]\n}\n\nexport interface RolloutArgumentDiffOptions {\n  /** Rollouts with `score >= passThreshold` count as passing. Default 1. */\n  readonly passThreshold?: number\n  /** Max distinct values listed per field per side in the rendered text. Default 4. */\n  readonly maxValuesPerField?: number\n}\n\nexport interface RolloutArgumentDiff {\n  /** Human/LLM-readable per-field diff, one line per field. */\n  readonly text: string\n  /** Lowercased stringified argument values seen in passing rollouts. */\n  readonly passingValues: ReadonlySet<string>\n  /** Lowercased stringified argument values seen in failing rollouts. */\n  readonly failingValues: ReadonlySet<string>\n}\n\n/**\n * Deterministic per-field diff of call arguments between passing and failing\n * rollouts. A field set by failing rollouts but left unset by passing ones is\n * the classic poison-input signature; a field whose values differ across the\n * split points at the correct value. Feed `text` to the reviser verbatim.\n */\nexport function rolloutArgumentDiff(\n  rollouts: readonly ScoredRollout[],\n  opts: RolloutArgumentDiffOptions = {},\n): RolloutArgumentDiff {\n  const passThreshold = opts.passThreshold ?? 1\n  const maxValues = opts.maxValuesPerField ?? 4\n  const collect = (pass: boolean): Map<string, Set<string>> => {\n    const byField = new Map<string, Set<string>>()\n    for (const r of rollouts) {\n      if (pass !== r.score >= passThreshold) continue\n      for (const c of r.calls) {\n        for (const [k, v] of Object.entries(c.args)) {\n          const set = byField.get(k) ?? new Set<string>()\n          set.add(String(v))\n          byField.set(k, set)\n        }\n      }\n    }\n    return byField\n  }\n  const passing = collect(true)\n  const failing = collect(false)\n  const lines: string[] = []\n  for (const field of new Set([...passing.keys(), ...failing.keys()])) {\n    const pv = [...(passing.get(field) ?? [])].slice(0, maxValues)\n    const fv = [...(failing.get(field) ?? [])].slice(0, maxValues)\n    const render = (vals: string[]) => (vals.length ? JSON.stringify(vals) : 'NOT SET (omitted)')\n    lines.push(`  ${field}: passing runs -> ${render(pv)} | failing runs -> ${render(fv)}`)\n  }\n  const lower = (m: Map<string, Set<string>>): Set<string> => {\n    const out = new Set<string>()\n    for (const vals of m.values()) for (const v of vals) out.add(v.toLowerCase())\n    return out\n  }\n  return {\n    text: lines.join('\\n') || '  (no calls observed)',\n    passingValues: lower(passing),\n    failingValues: lower(failing),\n  }\n}\n\nexport interface UngroundedLiteralReport {\n  /** Quoted single-word literals in the text that no passing rollout used. */\n  readonly ungrounded: readonly string[]\n  /** The subset failing rollouts actually used - prescribing these is proven harmful. */\n  readonly harmful: readonly string[]\n}\n\n/**\n * Scan revised artifact text for single-quoted single-word literals (the\n * \"use exactly 'new'\" pattern) that appear in no passing rollout's argument\n * values. Multi-word quotes pass (they are prose, not prescriptions).\n * Callers should reject on `harmful` (with a bounded retry) and at most log\n * `ungrounded` - see the module header for why the severities differ.\n */\nexport function classifyUngroundedLiterals(\n  text: string,\n  diff: Pick<RolloutArgumentDiff, 'passingValues' | 'failingValues'>,\n): UngroundedLiteralReport {\n  const ungrounded = new Set<string>()\n  for (const m of text.matchAll(/'([a-z][a-z_-]{1,19})'/gi)) {\n    const w = (m[1] as string).toLowerCase()\n    if (!diff.passingValues.has(w)) ungrounded.add(w)\n  }\n  const all = [...ungrounded]\n  return {\n    ungrounded: all,\n    harmful: all.filter((w) => diff.failingValues.has(w)),\n  }\n}\n","/**\n * Filesystem `LabeledScenarioStore` adapter. The default capture sink for\n * traces + eval artifacts. Production deployments typically swap for a\n * Turso/SQLite adapter (same interface).\n *\n * Records land as one JSONL file per source under `<root>/<source>.jsonl`.\n * Each line is a `LabeledScenarioRecord`. Append-only — no in-place edits.\n *\n * Safety properties enforced at write-time:\n *\n *   - **Provenance required**: writes without `source`, `sourceVersionHash`,\n *     `capturedAt`, `redactionStatus` are rejected. Closes the alignment\n *     reviewer's data-poisoning gap.\n *   - **Per-source rate limits**: optional `rateLimitBucket` + `maxWritesPerMinute`\n *     stops a single tenant/source from flooding the store.\n *\n * Safety properties enforced at sample-time:\n *\n *   - **Required split + capturedBefore**: substrate refuses to sample without\n *     an explicit `split` ('train' | 'test') AND a temporal cutoff. Eliminates\n *     accidental train/test contamination.\n *   - **Default training-source filter**: when the store is sampled with\n *     `split: 'train'`, production-trace records are EXCLUDED unless the\n *     caller passes `filter.source: 'production-trace'` explicitly. Closes\n *     the contamination-by-default gap flagged by the senior eval engineer.\n */\n\nimport { createHash } from 'node:crypto'\nimport { existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs'\nimport { join } from 'node:path'\nimport { compareCodeUnits } from '../../ledger-core/canonical'\nimport type {\n  LabeledScenarioRecord,\n  LabeledScenarioSampleArgs,\n  LabeledScenarioSource,\n  LabeledScenarioStore,\n  LabeledScenarioWrite,\n  LabelTrust,\n} from '../types'\nimport { labelTrustRank } from '../types'\n\nexport interface FsLabeledScenarioStoreOptions {\n  /** Root directory for JSONL files. Created if missing. */\n  root: string\n  /** Per-source rate limit. When set, writes exceeding the cap are rejected\n   *  with a typed error. Default: no limit. */\n  maxWritesPerMinutePerBucket?: number\n  /** Test seam — override `Date.now()` for deterministic tests. */\n  now?: () => number\n}\n\n/** Typed rejection from a labeled-scenario store (bad provenance, rate limit, invalid sample args) — carries a stable string `code`. */\nexport class LabeledScenarioStoreError extends Error {\n  constructor(\n    public readonly code: string,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'LabeledScenarioStoreError'\n  }\n}\n\ninterface RateLimitState {\n  bucket: string\n  windowStartMs: number\n  count: number\n}\n\n/**\n * Filesystem `LabeledScenarioStore`: appends one JSONL file per source with provenance and\n * rate-limit guards. For tests, local dev, and small workloads — high-throughput lands in Turso.\n */\nexport class FsLabeledScenarioStore implements LabeledScenarioStore {\n  private readonly now: () => number\n  private readonly rateLimits = new Map<string, RateLimitState>()\n\n  constructor(private readonly options: FsLabeledScenarioStoreOptions) {\n    if (!existsSync(options.root)) mkdirSync(options.root, { recursive: true })\n    this.now = options.now ?? Date.now\n  }\n\n  async observe(write: LabeledScenarioWrite): Promise<void> {\n    this.assertProvenance(write)\n    this.assertRateLimit(write)\n    const record = this.toRecord(write)\n    const path = this.pathForSource(write.source)\n    const line = `${JSON.stringify(record)}\\n`\n    // Append atomically. For high-throughput a writev-friendly buffered\n    // implementation lands in the Turso adapter; FS adapter is for tests +\n    // local dev + small workloads.\n    appendLine(path, line)\n  }\n\n  async sample(args: LabeledScenarioSampleArgs): Promise<LabeledScenarioRecord[]> {\n    if (!args.split) {\n      throw new LabeledScenarioStoreError(\n        'split_required',\n        'sample() requires an explicit `split` (train | test) — substrate refuses ambiguous reads',\n      )\n    }\n    if (!args.capturedBefore) {\n      throw new LabeledScenarioStoreError(\n        'capturedBefore_required',\n        'sample() requires an explicit `capturedBefore` timestamp for temporal-split discipline',\n      )\n    }\n\n    const all: LabeledScenarioRecord[] = []\n    for (const source of ALL_SOURCES) {\n      // Default training-source filter: when sampling train, EXCLUDE\n      // production-trace records unless the caller asks for them.\n      if (args.split === 'train' && source === 'production-trace') {\n        const explicit = sourceFilterContains(args.filter?.source, 'production-trace')\n        if (!explicit) continue\n      }\n      const path = this.pathForSource(source)\n      if (!existsSync(path)) continue\n      const lines = readFileSync(path, 'utf8').split('\\n').filter(Boolean)\n      for (const line of lines) {\n        let record: LabeledScenarioRecord\n        try {\n          record = JSON.parse(line) as LabeledScenarioRecord\n        } catch {\n          continue\n        }\n        if (!matchesFilter(record, args, source)) continue\n        all.push(record)\n      }\n    }\n\n    // Deterministic order: by capturedAt ascending, then recordHash.\n    all.sort((a, b) => {\n      if (a.capturedAt !== b.capturedAt) return compareCodeUnits(a.capturedAt, b.capturedAt)\n      return compareCodeUnits(a.recordHash, b.recordHash)\n    })\n\n    return all.slice(0, args.count)\n  }\n\n  async size(): Promise<{\n    train: number\n    test: number\n    bySource: Record<string, number>\n    byTrust: Record<LabelTrust, number>\n  }> {\n    const bySource: Record<string, number> = {}\n    const byTrust: Record<LabelTrust, number> = {\n      unverified: 0,\n      'verified-signal': 0,\n      'human-rated': 0,\n    }\n    let total = 0\n    for (const source of ALL_SOURCES) {\n      const path = this.pathForSource(source)\n      if (!existsSync(path)) {\n        bySource[source] = 0\n        continue\n      }\n      const lines = readFileSync(path, 'utf8').split('\\n').filter(Boolean)\n      bySource[source] = lines.length\n      total += lines.length\n      for (const line of lines) {\n        let trust: LabelTrust = 'unverified'\n        try {\n          trust = (JSON.parse(line) as LabeledScenarioRecord).labelTrust ?? 'unverified'\n        } catch {\n          // A malformed line counts as unverified — never silently gold.\n        }\n        byTrust[trust] += 1\n      }\n    }\n    // FS adapter doesn't track split assignments per-record (split is\n    // computed at sample-time based on `capturedBefore`). For size(), we\n    // report `train`+`test` as the same total — split is a sampling concept.\n    return { train: total, test: total, bySource, byTrust }\n  }\n\n  private assertProvenance(write: LabeledScenarioWrite): void {\n    if (!write.source) {\n      throw new LabeledScenarioStoreError(\n        'missing_source',\n        'LabeledScenarioWrite requires `source`',\n      )\n    }\n    if (!write.sourceVersionHash || write.sourceVersionHash.length === 0) {\n      throw new LabeledScenarioStoreError(\n        'missing_source_version',\n        'LabeledScenarioWrite requires `sourceVersionHash` (git sha or substrate version)',\n      )\n    }\n    if (!write.capturedAt) {\n      throw new LabeledScenarioStoreError(\n        'missing_captured_at',\n        'LabeledScenarioWrite requires `capturedAt` ISO timestamp',\n      )\n    }\n    if (!write.redactionStatus) {\n      throw new LabeledScenarioStoreError(\n        'missing_redaction_status',\n        'LabeledScenarioWrite requires explicit `redactionStatus` — raw / redacted-pii / redacted-secrets / fully-redacted',\n      )\n    }\n    if (!ALL_SOURCES.includes(write.source)) {\n      throw new LabeledScenarioStoreError(\n        'unknown_source',\n        `LabeledScenarioWrite.source must be one of: ${ALL_SOURCES.join(', ')}`,\n      )\n    }\n  }\n\n  private assertRateLimit(write: LabeledScenarioWrite): void {\n    const cap = this.options.maxWritesPerMinutePerBucket\n    if (!cap || !write.rateLimitBucket) return\n    const now = this.now()\n    const windowMs = 60_000\n    let state = this.rateLimits.get(write.rateLimitBucket)\n    if (!state || now - state.windowStartMs >= windowMs) {\n      state = { bucket: write.rateLimitBucket, windowStartMs: now, count: 0 }\n      this.rateLimits.set(write.rateLimitBucket, state)\n    }\n    if (state.count >= cap) {\n      throw new LabeledScenarioStoreError(\n        'rate_limit_exceeded',\n        `LabeledScenarioStore: bucket ${write.rateLimitBucket} exceeded ${cap} writes/min`,\n      )\n    }\n    state.count += 1\n  }\n\n  private toRecord(write: LabeledScenarioWrite): LabeledScenarioRecord {\n    const recordHash = sha256(\n      JSON.stringify({\n        id: write.scenario.id,\n        src: write.source,\n        at: write.capturedAt,\n        ver: write.sourceVersionHash,\n      }),\n    )\n    // FS adapter assigns split at sample-time, but we cache a hint here\n    // based on capturedAt vs the world's \"now\" — sampler overrides this.\n    return {\n      ...write,\n      recordHash,\n      split: 'train',\n    }\n  }\n\n  private pathForSource(source: string): string {\n    return join(this.options.root, `${source}.jsonl`)\n  }\n}\n\nconst ALL_SOURCES: LabeledScenarioWrite['source'][] = [\n  'production-trace',\n  'eval-run',\n  'manual',\n  'red-team',\n  'synthetic',\n]\n\nfunction sourceFilterContains(\n  filter: LabeledScenarioSource | LabeledScenarioSource[] | undefined,\n  needle: LabeledScenarioSource,\n): boolean {\n  if (!filter) return false\n  if (Array.isArray(filter)) return filter.includes(needle)\n  return filter === needle\n}\n\nfunction matchesFilter(\n  record: LabeledScenarioRecord,\n  args: LabeledScenarioSampleArgs,\n  source: string,\n): boolean {\n  // Temporal cutoff — train must be capturedAt < capturedBefore.\n  if (args.split === 'train' && record.capturedAt >= args.capturedBefore) return false\n  if (args.split === 'test' && record.capturedAt < args.capturedBefore) return false\n\n  const f = args.filter\n  if (!f) return true\n  if (f.kind && record.scenario.kind !== f.kind) return false\n  if (f.source) {\n    const sources = Array.isArray(f.source) ? f.source : [f.source]\n    if (!sources.includes(source as never)) return false\n  }\n  if (f.minComposite !== undefined || f.maxComposite !== undefined) {\n    const composites = Object.values(record.judgeScores).map((s) => s.composite)\n    const max = composites.length === 0 ? 0 : Math.max(...composites)\n    if (f.minComposite !== undefined && max < f.minComposite) return false\n    if (f.maxComposite !== undefined && max > f.maxComposite) return false\n  }\n  if (f.minTrust !== undefined && labelTrustRank(record.labelTrust) < labelTrustRank(f.minTrust)) {\n    return false\n  }\n  return true\n}\n\nfunction sha256(input: string): string {\n  return createHash('sha256').update(input).digest('hex').slice(0, 16)\n}\n\nfunction appendLine(path: string, line: string): void {\n  if (existsSync(path)) {\n    const existing = readFileSync(path, 'utf8')\n    writeFileSync(path, existing + line)\n  } else {\n    writeFileSync(path, line)\n  }\n}\n","/**\n * @module\n * Footprint-matched neutralization — the placebo control for content-vs-footprint\n * attribution in a promotion gate.\n *\n * A promoted surface can raise a held-out score two different ways:\n *  1. its CONTENT is informative (the thing we want to promote), or\n *  2. it merely added prompt/mount FOOTPRINT — more bytes, more lines, a longer\n *     more authoritative-looking prompt — that the model spends attention on\n *     regardless of what the bytes say.\n *\n * A held-out gate proves the candidate beat baseline; it cannot separate (1) from\n * (2). `neutralizeText` produces a variant that keeps the input's layout and\n * length while carrying ZERO information, so scoring it isolates the footprint\n * contribution (2). Feed the neutralized variant's scores to `neutralizationGate`:\n * any lift it still holds over baseline is decorative, and a candidate whose lift\n * survives neutralization is rejected however large its raw lift.\n */\n\n/** Filler for blanked content. A single ASCII byte, so a run of it preserves an\n *  ASCII source's exact byte length; for multibyte sources it preserves CHARACTER\n *  count and layout (what the tokenizer footprint tracks), not raw byte count. */\nconst FILLER = '#'\n\n/**\n * Blank every non-whitespace character to a 1-byte filler while preserving all\n * whitespace. Line count, indentation, and word/line lengths are unchanged — so\n * the neutralized variant has the same layout and (for ASCII) the same byte\n * footprint as the input, but no readable content. Whitespace is preserved\n * deliberately: collapsing it would change the token structure and stop the\n * variant from being a true footprint match.\n */\nexport function neutralizeText(content: string): string {\n  return content.replace(/\\S/g, FILLER)\n}\n","/**\n * Parent selection for `runOptimization`.\n *\n * Each generation mutates one parent surface. The default parent is the\n * global incumbent, so the search is a hill-climb and the lineage recorded in\n * `GenerationCandidate.parentSurfaceHash` is a chain. A `ParentSelector` draws\n * the parent from the Pareto frontier instead, so the recorded lineage becomes\n * a tree. Promotion is unchanged: a candidate still has to beat the incumbent.\n */\n\nimport { type Objective, paretoFrontierWithCrowding } from '../pareto'\nimport { mulberry32 } from '../statistics/random'\nimport type { GenerationRecord, ParetoParent, ScoredSurfaceOutcome } from './types'\n\n/** Search state supplied to one parent-selection call. */\nexport interface ParentSelectionContext {\n  /** Non-dominated scored surfaces across the whole run so far, including the\n   *  baseline (`generation: -1`). Never empty. */\n  readonly frontier: ReadonlyArray<ParetoParent>\n  /** Measured result of the global incumbent, the promotion bar. Under the\n   *  default `selectionRankKey` the incumbent is always on `frontier`. */\n  readonly incumbent: ScoredSurfaceOutcome\n  /** Every completed generation so far. */\n  readonly history: ReadonlyArray<GenerationRecord>\n  /** Index of the generation about to propose. */\n  readonly generation: number\n}\n\n/** Chooses the surface the next generation mutates. Returns one frontier\n *  parent; `runOptimization` refuses a parent it has not measured to\n *  completion or whose surface does not match its `surfaceHash`. */\nexport type ParentSelector = (ctx: ParentSelectionContext) => ParetoParent\n\nexport interface CrowdedFrontierParentOptions {\n  /** Integer seed for the per-generation draw. The same seed, frontier, and\n   *  generation index select the same parent. */\n  seed: number\n}\n\n/**\n * NSGA-II crowded tournament selection over the frontier. Each generation\n * draws two distinct frontier members with a PRNG seeded from `seed` and the\n * generation index, and keeps the one with the larger crowding distance (more\n * isolated on the frontier). Boundary parents carry infinite distance, so a\n * boundary parent always beats an interior one. A tie on distance falls back\n * to the higher mean composite, then to the smaller surface hash. A frontier\n * of one member returns that member.\n */\nexport function crowdedFrontierParent(options: CrowdedFrontierParentOptions): ParentSelector {\n  const { seed } = options\n  if (!Number.isInteger(seed)) {\n    throw new TypeError(`crowdedFrontierParent: seed must be an integer, got ${String(seed)}`)\n  }\n  return ({ frontier, generation }) => {\n    if (frontier.length === 0) {\n      throw new Error('crowdedFrontierParent: frontier is empty')\n    }\n    if (frontier.length === 1) return frontier[0]!\n    const distances = new Map<ParetoParent, number>()\n    for (const { candidate, distance } of paretoFrontierWithCrowding(\n      [...frontier],\n      frontierObjectives(frontier),\n    )) {\n      distances.set(candidate, distance)\n    }\n    const rng = mulberry32(tournamentSeed(seed, generation))\n    const first = Math.floor(rng() * frontier.length)\n    const offset = Math.floor(rng() * (frontier.length - 1))\n    const second = offset >= first ? offset + 1 : offset\n    const a = frontier[first]!\n    const b = frontier[second]!\n    return compareCrowded(a, distanceOf(distances, a), b, distanceOf(distances, b)) <= 0 ? a : b\n  }\n}\n\nfunction distanceOf(distances: ReadonlyMap<ParetoParent, number>, parent: ParetoParent): number {\n  const distance = distances.get(parent)\n  if (distance === undefined) {\n    throw new Error(\n      `crowdedFrontierParent: frontier member \"${parent.surfaceHash}\" is dominated or has a non-finite objective`,\n    )\n  }\n  return distance\n}\n\n/** Negative when `a` wins the tournament, positive when `b` wins. */\nfunction compareCrowded(a: ParetoParent, da: number, b: ParetoParent, db: number): number {\n  if (da !== db) return da > db ? -1 : 1\n  if (a.composite !== b.composite) return a.composite > b.composite ? -1 : 1\n  if (a.surfaceHash === b.surfaceHash) return 0\n  return a.surfaceHash < b.surfaceHash ? -1 : 1\n}\n\n/** One `maximize` objective per scenario id present on the frontier. */\nfunction frontierObjectives(frontier: ReadonlyArray<ParetoParent>): Objective<ParetoParent>[] {\n  const ids = new Set<string>()\n  for (const parent of frontier) for (const id of Object.keys(parent.objectives)) ids.add(id)\n  if (ids.size === 0) {\n    throw new Error('crowdedFrontierParent: frontier parents carry no objectives')\n  }\n  return [...ids].sort().map((id) => ({\n    name: id,\n    direction: 'maximize',\n    value: (parent) => {\n      const value = parent.objectives[id]\n      if (typeof value !== 'number' || !Number.isFinite(value)) {\n        throw new Error(\n          `crowdedFrontierParent: frontier member \"${parent.surfaceHash}\" has no finite objective \"${id}\"`,\n        )\n      }\n      return value\n    },\n  }))\n}\n\nfunction tournamentSeed(seed: number, generation: number): number {\n  return (seed ^ Math.imul(generation + 1, 0x9e3779b1)) | 0\n}\n","/**\n * Product-flow playback — drive the REAL product through a user story and\n * score the produced state per requirement (the launch \"Jira tick-off\").\n *\n * This is the substrate adapter + contract only. It plugs a `PlaybackDriver`\n * into the existing `runProfileMatrix` dispatch seam: a driver drives the real\n * product (a Playwright UI session or a sandbox workspace) and returns the\n * runtime event stream; `extractProducedState` + `verifyCompletion` then score\n * each requirement PASS/FAIL. The concrete drivers live in consumers — they\n * depend on browser / runtime infra the substrate must not import — so\n * agent-eval owns the seam, the `UserStory` contract, and the scoreboard.\n */\n\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport {\n  type CompletionRequirement,\n  type CompletionVerdict,\n  type CorrectnessChecker,\n  type ProducedState,\n  verifyCompletion,\n} from '../../completion-verifier'\nimport { extractProducedState, type RuntimeEventLike } from '../../produced-state'\nimport type { DispatchContext, Scenario } from '../types'\nimport type { ProfileDispatchFn } from './run-profile-matrix'\n\n/** One step of a user story — what the user does. The driver interprets\n *  `payload` (a Playwright selector + action, or a sandbox chat turn). */\nexport interface PlaybackStep {\n  /** Human-readable action, captured verbatim in the UX narrative. */\n  action: string\n  /** Driver-specific payload (e.g. `{ selector, fill }` or `{ turn }`). */\n  payload?: Record<string, unknown>\n}\n\n/**\n * A user story = a runnable product journey plus the requirements that define\n * \"this story works\". Each requirement is one Jira ticket line. Extends\n * `Scenario` so a catalog drops straight into `runProfileMatrix({ scenarios })`.\n */\nexport interface UserStory extends Scenario {\n  /** Human-readable story title (the ticket headline). */\n  title: string\n  /** Ordered steps the driver executes. */\n  steps: PlaybackStep[]\n  /** What must hold in the produced state for the story to pass. */\n  requirements: CompletionRequirement[]\n}\n\n/** Dispatch context plus the profile under test (which cheap model, etc.). */\nexport interface PlaybackContext extends DispatchContext {\n  profile: AgentProfile\n}\n\n/**\n * Drives the real product through a story and returns the runtime event stream\n * `extractProducedState` consumes. Implemented by CONSUMERS —\n * `SandboxPlaybackDriver` (real API / sandbox workspace) and\n * `PlaywrightPlaybackDriver` (real UI) — because they depend on runtime /\n * browser infra the substrate must not import. The driver MUST report LLM\n * usage through `ctx.cost.runPaidCall` so the backend-integrity check sees real\n * tokens (a run that never reports tokens reads as a stub).\n */\nexport interface PlaybackDriver<TStory extends UserStory = UserStory> {\n  run(story: TStory, ctx: PlaybackContext): Promise<readonly RuntimeEventLike[]>\n}\n\n/**\n * Adapt a `PlaybackDriver` into a `runProfileMatrix` dispatch. The artifact the\n * matrix scores is the `ProducedState` extracted from the driver's event\n * stream — grade it with `scoreUserStory` (or a judge wrapping it).\n */\nexport function makePlaybackDispatch<TStory extends UserStory>(\n  driver: PlaybackDriver<TStory>,\n): ProfileDispatchFn<TStory, ProducedState> {\n  return async (profile, scenario, ctx) => {\n    const events = await driver.run(scenario, { ...ctx, profile })\n    return extractProducedState(events)\n  }\n}\n\n/** A scored user story — the completion verdict plus its human title. */\nexport interface UserStoryVerdict extends CompletionVerdict {\n  title: string\n}\n\n/**\n * Score one story's produced state against its requirements. Thin wrapper over\n * `verifyCompletion` that builds the gold from the story and returns a\n * per-requirement PASS/FAIL verdict. `checkCorrectness` is injected — a\n * deterministic stub in tests, `createLlmCorrectnessChecker` in production.\n */\nexport async function scoreUserStory(\n  story: UserStory,\n  state: ProducedState,\n  checkCorrectness: CorrectnessChecker,\n): Promise<UserStoryVerdict> {\n  const verdict = await verifyCompletion(\n    { taskId: story.id, requirements: story.requirements },\n    state,\n    checkCorrectness,\n  )\n  return { ...verdict, title: story.title }\n}\n\n/** One row of the launch scoreboard — story × requirement → PASS/FAIL. */\nexport interface ScoreboardRow {\n  storyId: string\n  storyTitle: string\n  reqId: string\n  reqTitle: string\n  status: 'PASS' | 'FAIL'\n  evidence: string[]\n}\n\n/**\n * Flatten story verdicts into the per-requirement scoreboard — the literal\n * Jira tick-off: one row per (story, requirement) with PASS/FAIL and the\n * evidence behind the verdict.\n */\nexport function userStoryScoreboard(verdicts: readonly UserStoryVerdict[]): ScoreboardRow[] {\n  const rows: ScoreboardRow[] = []\n  for (const v of verdicts) {\n    for (const r of v.requirements) {\n      rows.push({\n        storyId: v.taskId,\n        storyTitle: v.title,\n        reqId: r.reqId,\n        reqTitle: r.title,\n        status: r.satisfied ? 'PASS' : 'FAIL',\n        evidence: r.evidence,\n      })\n    }\n  }\n  return rows\n}\n\n/** Launch-readiness headline counts rolled up from the per-requirement rows. */\nexport interface ScoreboardSummary {\n  /** Distinct user stories on the board. */\n  stories: number\n  /** Stories whose every requirement passed. */\n  storiesFullyComplete: number\n  /** Total (story, requirement) rows. */\n  requirements: number\n  /** Rows with status PASS. */\n  passed: number\n  /** Rows with status FAIL. */\n  failed: number\n  /** passed / requirements; 0 when there are no rows. */\n  passRate: number\n}\n\n/** Roll the per-requirement rows up into the launch headline counts. */\nexport function scoreboardSummary(rows: readonly ScoreboardRow[]): ScoreboardSummary {\n  const byStory = new Map<string, { total: number; passed: number }>()\n  let passed = 0\n  for (const r of rows) {\n    const s = byStory.get(r.storyId) ?? { total: 0, passed: 0 }\n    s.total++\n    if (r.status === 'PASS') {\n      s.passed++\n      passed++\n    }\n    byStory.set(r.storyId, s)\n  }\n  let storiesFullyComplete = 0\n  for (const s of byStory.values()) if (s.total > 0 && s.passed === s.total) storiesFullyComplete++\n  return {\n    stories: byStory.size,\n    storiesFullyComplete,\n    requirements: rows.length,\n    passed,\n    failed: rows.length - passed,\n    passRate: rows.length === 0 ? 0 : passed / rows.length,\n  }\n}\n\nexport interface ScoreboardRenderOptions {\n  /** Document H1. Defaults to a generic playback title. */\n  title?: string\n  /** Key/value run metadata rendered under the headline (runId, backend, model, date). */\n  meta?: Record<string, string>\n  /** Max chars of joined evidence shown per row. Default 160. */\n  maxEvidenceChars?: number\n}\n\nfunction escapeCell(s: string): string {\n  return s.replace(/\\|/g, '\\\\|').replace(/\\r?\\n/g, ' ')\n}\n\nfunction truncate(s: string, max: number): string {\n  return s.length <= max ? s : `${s.slice(0, Math.max(0, max - 1))}…`\n}\n\n/**\n * Render the scoreboard as a launch-readiness Markdown document — the literal\n * \"tick off every user story\" artifact: a headline roll-up, the open tickets\n * (FAIL rows) up top as the launch blockers, then a per-story table of\n * requirement → PASS/FAIL with the evidence behind each verdict. Pure: same\n * rows in, same bytes out (no clock/random), so it is safe to snapshot.\n */\nexport function renderScoreboardMarkdown(\n  rows: readonly ScoreboardRow[],\n  opts: ScoreboardRenderOptions = {},\n): string {\n  const maxEv = opts.maxEvidenceChars ?? 160\n  const sum = scoreboardSummary(rows)\n  const pct = (n: number) => `${Math.round(n * 100)}%`\n  const ev = (e: string[]) => escapeCell(truncate(e.join('; '), maxEv)) || '—'\n  const out: string[] = [`# ${opts.title ?? 'Product-flow playback scoreboard'}`, '']\n  if (opts.meta) {\n    for (const [k, v] of Object.entries(opts.meta)) out.push(`- **${k}:** ${v}`)\n    out.push('')\n  }\n  out.push(\n    `**${sum.storiesFullyComplete}/${sum.stories}** user stories fully shipped · ` +\n      `**${sum.passed}/${sum.requirements}** requirements passing (${pct(sum.passRate)}) · ` +\n      `**${sum.failed}** open`,\n    '',\n  )\n  const fails = rows.filter((r) => r.status === 'FAIL')\n  if (fails.length > 0) {\n    out.push('## Open tickets', '', '| Story | Requirement | Evidence |', '| --- | --- | --- |')\n    for (const r of fails) {\n      out.push(`| ${escapeCell(r.storyTitle)} | ${escapeCell(r.reqTitle)} | ${ev(r.evidence)} |`)\n    }\n    out.push('')\n  } else {\n    out.push('_All requirements passing — no open tickets._', '')\n  }\n  out.push('## Per-story tick-off', '')\n  for (const storyId of [...new Set(rows.map((r) => r.storyId))]) {\n    const storyRows = rows.filter((r) => r.storyId === storyId)\n    const passed = storyRows.filter((r) => r.status === 'PASS').length\n    const mark = passed === storyRows.length ? '✅' : '⚠️'\n    out.push(\n      `### ${escapeCell(storyRows[0]!.storyTitle)} — ${passed}/${storyRows.length} ${mark}`,\n      '',\n      '| Requirement | Status | Evidence |',\n      '| --- | --- | --- |',\n    )\n    for (const r of storyRows) {\n      out.push(\n        `| ${escapeCell(r.reqTitle)} | ${r.status === 'PASS' ? '✅ PASS' : '❌ FAIL'} | ${ev(r.evidence)} |`,\n      )\n    }\n    out.push('')\n  }\n  return out.join('\\n')\n}\n","/**\n * `runProfileMatrix` — the missing keystone between `runAgentMatrix` and the\n * backend-integrity guard.\n *\n * The gap it closes: `runAgentMatrix` is a topology-opaque scheduler whose\n * cells return a bare `{ output, verdict, costUsd }` — no `tokenUsage`, not a\n * `RunRecord`. `assertRealBackend` / `summarizeBackendIntegrity` key on\n * `RunRecord.tokenUsage`, so they cannot run on a raw matrix result. Every\n * consumer therefore hand-writes the same bridge: fan a profile × scenario\n * cartesian, call dispatch, fabricate a `RunRecord` with token usage, thread it\n * back, run the integrity guard. That hand-rolled bridge is exactly the pile of\n * bespoke `eval:*` scripts the adoption skills keep trying (and failing) to\n * forbid.\n *\n * `runProfileMatrix` IS that bridge, once:\n *\n *   - axis 3 (PROFILE) = `profiles: AgentProfile[]`\n *   - axis 1 (PERSONA/SCENARIO) = `scenarios: Scenario[]` (each scenario carries\n *     its persona; `personaOf` groups them for the `byPersona` pivot)\n *   - the scoring axis = `judges`\n *\n * It runs `runCampaign` once per profile (reusing its seeds, reps, bootstrap\n * CIs, resumability, and the `LabeledScenarioStore` capture flywheel), maps\n * every cell to a validated `RunRecord` carrying the real `tokenUsage` the\n * dispatch committed via `ctx.cost.runPaidCall`, and runs `assertRealBackend`\n * BY CONSTRUCTION before returning — so a stub-backend run fails loudly instead\n * of reporting a clean 0/N leaderboard.\n *\n * Dispatch contract: a dispatch that calls an LLM MUST report usage via\n * `ctx.cost.runPaidCall({ execute, receipt })`.\n * A dispatch that reports zero tokens is indistinguishable from a stub and the\n * integrity guard treats it as one.\n */\n\nimport { createHash } from 'node:crypto'\nimport { join } from 'node:path'\nimport {\n  type AgentProfile,\n  agentProfileHash,\n  agentProfileId,\n  agentProfileModelId,\n  HARNESS_NATIVE_MODEL,\n  harnessAxisOf,\n} from '../../agent-profile'\nimport { type AgentProfileCell, buildAgentProfileCell } from '../../agent-profile-cell'\nimport { mapConcurrent } from '../../concurrency'\nimport type { CostProvenance } from '../../cost-ledger'\nimport { AgentEvalError } from '../../errors'\nimport {\n  assertRealBackend,\n  type BackendIntegrityReport,\n  summarizeBackendIntegrity,\n} from '../../integrity/backend-integrity'\nimport {\n  modelHasSnapshot,\n  type RunRecord,\n  type RunSplitTag,\n  runTaskScore,\n  UNKNOWN_MODEL,\n  validateRunRecord,\n} from '../../run-record'\nimport { computeManifestHash } from '../campaign-manifest'\nimport { runCampaign } from '../run-campaign'\nimport { campaignCellToRunRecord } from '../run-record'\nimport type { CampaignStorage } from '../storage'\nimport type {\n  CampaignCellResult,\n  CampaignResult,\n  DispatchContext,\n  JudgeConfig,\n  LabeledScenarioSource,\n  LabeledScenarioStore,\n  Scenario,\n} from '../types'\n\n/** Thrown when the matrix is misconfigured (no profiles, missing resolved model evidence,\n *  etc.). Distinct from `BackendIntegrityError`,\n *  which signals a stub backend at run time. */\nexport class ProfileMatrixError extends AgentEvalError {\n  constructor(message: string) {\n    super('profile_matrix', message)\n  }\n}\n\n/** Dispatch for one cell: render `profile` against `scenario`, returning the\n *  artifact the judges score. Run LLM work through `ctx.cost.runPaidCall` —\n *  the integrity check depends on its receipt. */\nexport type ProfileDispatchFn<TScenario extends Scenario, TArtifact> = (\n  profile: AgentProfile,\n  scenario: TScenario,\n  ctx: DispatchContext,\n) => Promise<TArtifact>\n\nexport interface RunProfileMatrixOptions<TScenario extends Scenario, TArtifact> {\n  /** Axis 3 — the agent-under-test configurations. Each is one column. */\n  profiles: AgentProfile[]\n  /** Axis 1 — the persona/scenario corpus, run against every profile. */\n  scenarios: TScenario[]\n  /** Renders one (profile, scenario) cell. */\n  dispatch: ProfileDispatchFn<TScenario, TArtifact>\n  /** The scoring axis. */\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** Where each profile's campaign writes artifacts/traces. One subdir per\n   *  profile. */\n  runDir: string\n  /** Git SHA the harness ran from — stamped onto every RunRecord (mandatory\n   *  for paper-grade records). */\n  commitSha: string\n  /** Additional stable identity for dispatch behavior that can change without\n   *  changing `commitSha`, such as a caller-owned executable or remote config. */\n  dispatchRef?: string\n  /** Logical experiment id shared across the whole matrix so the promotion\n   *  gate can pair profiles on matched scenarios. Default: a hash of the\n   *  profile + scenario ids. */\n  experimentId?: string\n  /** Which split these runs belong to. Default `'search'`. */\n  splitTag?: RunSplitTag\n  /** Replicates per (profile, scenario) cell for CI bands. Default 1. */\n  reps?: number\n  /** Campaign seed (per profile). Default 42. */\n  seed?: number\n  /**\n   * Backend-integrity posture, enforced AFTER the matrix completes:\n   *   - `'assert'` (default) — throw `BackendIntegrityError` if the run was a\n   *     stub (and, with `allowMixed:false`, if it was mixed).\n   *   - `'warn'` — log the verdict but never throw.\n   *   - `'off'` — skip the guard entirely (only for offline/replay analysis).\n   */\n  integrity?: 'assert' | 'warn' | 'off'\n  /** Forwarded to `assertRealBackend`. Default true (tolerate partial 429\n   *  cascades); set false for strict CI gates. */\n  allowMixed?: boolean\n  /** Max concurrent cells WITHIN each profile's campaign. Default 2. */\n  maxConcurrency?: number\n  /** Max profile campaigns in flight. Default 1. Each profile keeps its own\n   *  run directory and cost ceiling; raise this when those resources are independent. */\n  maxProfileConcurrency?: number\n  /** Cumulative USD cap per profile campaign. */\n  costCeiling?: number\n  /** Capture flywheel — forwarded to each campaign. */\n  labeledStore?: LabeledScenarioStore | 'off'\n  captureSource?: LabeledScenarioSource\n  /** Storage backend. Default `fsCampaignStorage`. Pass\n   *  `inMemoryCampaignStorage()` for edge/CF-Worker/test runs. */\n  storage?: CampaignStorage\n  /** Test seam — override the wall clock. */\n  now?: () => Date\n  /** Optional persona key per scenario — drives the `byPersona` pivot. When\n   *  unset, `byPersona` is omitted. */\n  personaOf?: (scenario: TScenario) => string\n  /** Validate every produced RunRecord with `validateRunRecord` (fail-loud).\n   *  Default true — catches bad model snapshots and non-finite judge dims at\n   *  the boundary instead of letting them poison downstream analysis. */\n  validate?: boolean\n  /** Corpus-by-default: derive the trajectory text (`prompt` + `completion`)\n   *  for each cell from its artifact + scenario. When set, every produced\n   *  record carries `prompt`/`completion` (a `CorpusRecord`) so the run's\n   *  graded trajectories can be appended to the durable RL corpus with no\n   *  side-channel — `appendToCorpus(result.records, path)`. Fail-soft: a\n   *  throwing or undefined-returning extractor just omits the text. */\n  corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n  /**\n   * Optional explicit row selection. The matrix identity remains based on the\n   * complete profiles × scenarios × reps design; this invocation executes only\n   * rows accepted by the predicate.\n   */\n  rowFilter?: (input: { profile: AgentProfile; scenario: TScenario; rep: number }) => boolean\n  /** Stable matrix identity supplied by a persisted profile-matrix plan. */\n  matrixId?: string\n  /** Reuse cached failed cells. Normal matrix runs retry them by default. */\n  reuseFailedCells?: boolean\n}\n\nexport interface ProfileSummary {\n  profileId: string\n  profileHash: string\n  model: string\n  /** RunRecords produced for this profile (= scenarios × reps). */\n  records: number\n  /** Mean across scored records, or null when the profile has no task labels. */\n  meanComposite: number | null\n  /** Total cost, or null when any call's cost was not captured. */\n  totalCostUsd: number | null\n  costProvenance: CostProvenance\n  /** Per-profile integrity verdict — surfaces a single profile that ran stub\n   *  even when the matrix as a whole looks real. */\n  integrity: BackendIntegrityReport\n}\n\nexport interface ScenarioRollup {\n  meanComposite: number\n  n: number\n}\n\nexport interface RunProfileMatrixResult<TArtifact, TScenario extends Scenario> {\n  matrixId: string\n  experimentId: string\n  /** One RunRecord per (profile, scenario, rep) cell — the integrity-checked,\n   *  paper-grade output. Feed straight into `analyzeRuns`, `HeldOutGate`,\n   *  scorecards, the hosted wire format. */\n  records: RunRecord[]\n  byProfile: Record<string, ProfileSummary>\n  byScenario: Record<string, ScenarioRollup>\n  /** Present only when `personaOf` was supplied. */\n  byPersona?: Record<string, ScenarioRollup>\n  /** Whole-matrix integrity report (the one `integrity:'assert'` enforces). */\n  integrity: BackendIntegrityReport\n  /** The raw per-profile campaign results, keyed by profile id. */\n  campaigns: Record<string, CampaignResult<TArtifact, TScenario>>\n}\n\n/**\n * Return the exact per-profile campaign identity used by `runProfileMatrix`.\n * Segmented profile matrices use this to validate durable cell caches before\n * finalization without dispatching a probe request.\n */\nexport function profileMatrixCampaignIdentity<TScenario extends Scenario, TArtifact>(opts: {\n  profile: AgentProfile\n  scenarios: TScenario[]\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  commitSha: string\n  dispatchRef?: string\n  splitTag?: RunSplitTag\n  seed?: number\n  reps?: number\n}): {\n  profileHash: string\n  profileId: string\n  configHash: string\n  dispatchRef: string\n  manifestHash: string\n} {\n  const seed = opts.seed ?? 42\n  const splitTag = opts.splitTag ?? 'search'\n  const reps = opts.reps ?? 1\n  const profileHash = agentProfileHash(opts.profile)\n  const profileId = agentProfileId(opts.profile)\n  const configHash = sha({\n    profile: profileHash,\n    judges: (opts.judges ?? []).map((judge) => judge.name),\n    seed,\n    splitTag,\n    dispatchRef: opts.dispatchRef ?? null,\n  })\n  const dispatchRef = `profile-matrix:${sha({\n    commitSha: opts.commitSha,\n    caller: opts.dispatchRef ?? null,\n    profileId,\n    profileHash,\n    configHash,\n  })}`\n  const manifestHash = computeManifestHash({\n    scenarios: opts.scenarios,\n    judges: (opts.judges ?? []) as unknown as JudgeConfig<unknown>[],\n    dispatchRef,\n    seed,\n    reps,\n  })\n  return { profileHash, profileId, configHash, dispatchRef, manifestHash }\n}\n\nfunction sanitize(id: string): string {\n  return id.replace(/[^a-zA-Z0-9_-]/g, '_')\n}\n\nfunction sha(input: unknown): string {\n  return createHash('sha256').update(JSON.stringify(input)).digest('hex')\n}\n\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\ninterface BuildRecordArgs<TScenario extends Scenario, TArtifact> {\n  cell: CampaignCellResult<TArtifact>\n  profile: AgentProfile\n  profileHash: string\n  configHash: string\n  experimentId: string\n  splitTag: RunSplitTag\n  commitSha: string\n  matrixId: string\n  /** The (profile, harness, model, dimensions) identity of this cell — attached to\n   *  every record so results group by the canonical `groupRunsByAgentProfileCell`\n   *  (harness/model aware) instead of profileId alone. */\n  agentProfileCell?: AgentProfileCell\n  scenario?: TScenario\n  corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n}\n\nfunction receiptModels(cell: CampaignCellResult<unknown>): string[] {\n  const reported = cell.resolvedModels ?? (cell.resolvedModel ? [cell.resolvedModel] : [])\n  return [...new Set(reported.map((model) => model.trim()).filter(Boolean))]\n}\n\nfunction isUnknownModelOnly(reported: string[]): boolean {\n  return reported.length > 0 && reported.every((model) => model === UNKNOWN_MODEL)\n}\n\n/** Resolve and validate every paid-call model used by one cell. */\nfunction recordModel(\n  cell: CampaignCellResult<unknown>,\n  profileId: string,\n  declaredModel: string,\n): string {\n  const reported = receiptModels(cell)\n  // A dispatch failure can happen before the provider returns any model\n  // identity. Preserve that failed row with an explicit absence marker; a\n  // failure must not be converted into a made-up snapshot or discarded.\n  // When a settled receipt exists, retain and validate its real identity.\n  if (cell.error !== undefined && (reported.length === 0 || isUnknownModelOnly(reported))) {\n    return UNKNOWN_MODEL\n  }\n  if (modelHasSnapshot(declaredModel)) {\n    for (const model of reported) {\n      if (model !== declaredModel) {\n        throw new ProfileMatrixError(\n          `profile '${profileId}' paid-call model '${model}' for cell '${cell.cellId}' does not match its declared exact model '${declaredModel}'`,\n        )\n      }\n    }\n    return declaredModel\n  }\n\n  if (reported.length === 0) {\n    throw new ProfileMatrixError(\n      `profile '${profileId}' declared a moving model but its dispatch reported no resolved model for cell '${cell.cellId}' — return a snapshot-bearing model in the ctx.cost.runPaidCall receipt`,\n    )\n  }\n  for (const model of reported) {\n    if (!modelHasSnapshot(model)) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' resolved to model '${model}' for cell '${cell.cellId}', which lacks a snapshot version — pin it in the paid-call receipt`,\n      )\n    }\n    if (declaredModel !== HARNESS_NATIVE_MODEL && !sameMovingModel(declaredModel, model)) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' declared model '${declaredModel}' but cell '${cell.cellId}' reported unrelated snapshot '${model}'`,\n      )\n    }\n  }\n  if (reported.length !== 1) {\n    throw new ProfileMatrixError(\n      `profile '${profileId}' cell '${cell.cellId}' reported multiple paid-call model snapshots: ${reported.join(', ')}`,\n    )\n  }\n  return reported[0]!\n}\n\nfunction sameMovingModel(declared: string, resolved: string): boolean {\n  const resolvedBase = resolved\n    .replace(/@[^/]+$/u, '')\n    .replace(/-\\d{8}$/u, '')\n    .replace(/-\\d{4}-\\d{2}-\\d{2}$/u, '')\n    .replace(/-\\d{4}$/u, '')\n    .replace(/:date-[^/]+$/u, '')\n  return (\n    resolvedBase === declared ||\n    resolvedBase.endsWith(`/${declared}`) ||\n    declared.endsWith(`/${resolvedBase}`)\n  )\n}\n\nfunction buildRunRecord<TScenario extends Scenario, TArtifact>(\n  args: BuildRecordArgs<TScenario, TArtifact>,\n): RunRecord {\n  const { cell, profile, profileHash, configHash, experimentId, splitTag, commitSha, matrixId } =\n    args\n  const profileId = agentProfileId(profile)\n  const declaredModel = agentProfileModelId(profile)\n  // Every successful record pins a snapshot. When a profile intentionally\n  // carries the provider-facing moving alias, the paid-call receipt supplies\n  // the immutable identity used here. Failed rows use explicit unknown data.\n  const model = recordModel(cell, profileId, declaredModel)\n  const durableCell = durableCellForRecord(cell)\n  const record = campaignCellToRunRecord(durableCell, {\n    runId: `${matrixId}:${profileId}:${cell.cellId}`,\n    experimentId,\n    candidateId: profileId,\n    model,\n    promptHash: profileHash,\n    configHash,\n    commitSha,\n    splitTag,\n    agentProfile: args.agentProfileCell,\n  }) as RunRecord & { prompt?: string; completion?: string }\n\n  // Corpus-by-default: stamp the trajectory text onto the record (CorpusRecord\n  // shape — the validator ignores the extra keys) so the run is dataset-able\n  // with no side-channel. Fail-soft: a bad extractor never fails the run.\n  if (args.corpusText && args.scenario) {\n    try {\n      const text = args.corpusText(cell.artifact, args.scenario)\n      if (text && typeof text.prompt === 'string' && typeof text.completion === 'string') {\n        record.prompt = text.prompt\n        record.completion = text.completion\n      }\n    } catch {\n      // extractor threw — omit trajectory text, keep the graded record.\n    }\n  }\n  return record\n}\n\n/**\n * Keep failed rows truthful at the RunRecord boundary.\n *\n * A cell with no settled call currently has a zero subtotal and an observed\n * zero from the ledger. That is not measured provider usage or cost, so mark\n * usage incomplete and cost uncaptured while retaining the known subtotal.\n */\nfunction durableCellForRecord<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n): CampaignCellResult<TArtifact> {\n  if (cell.error === undefined) return cell\n\n  const hasSettledAgentCalls = receiptModels(cell).some((model) => model !== UNKNOWN_MODEL)\n  return {\n    ...cell,\n    tokenUsage:\n      cell.tokenUsage.tokensKnown === false || hasSettledAgentCalls\n        ? cell.tokenUsage\n        : { ...cell.tokenUsage, tokensKnown: false },\n    costProvenance:\n      !hasSettledAgentCalls && cell.costProvenance.kind === 'observed' && cell.costUsd === 0\n        ? { kind: 'uncaptured', usd: null }\n        : cell.costProvenance,\n  }\n}\n\n/**\n * Profile × scenario matrix runner: fan N agent profiles across M scenarios, project each cell to a validated `RunRecord` with real token usage, and enforce the backend-integrity guard before returning.\n */\nexport async function runProfileMatrix<TScenario extends Scenario, TArtifact>(\n  opts: RunProfileMatrixOptions<TScenario, TArtifact>,\n): Promise<RunProfileMatrixResult<TArtifact, TScenario>> {\n  if (opts.profiles.length === 0) throw new ProfileMatrixError('profiles must not be empty')\n  if (opts.scenarios.length === 0) throw new ProfileMatrixError('scenarios must not be empty')\n\n  const splitTag = opts.splitTag ?? 'search'\n  const seed = opts.seed ?? 42\n  const validate = opts.validate ?? true\n  const integrityMode = opts.integrity ?? 'assert'\n  const maxProfileConcurrency = opts.maxProfileConcurrency ?? 1\n  const profileIds = opts.profiles.map(agentProfileId)\n  if (opts.dispatchRef !== undefined && opts.dispatchRef.trim().length === 0) {\n    throw new ProfileMatrixError('dispatchRef must be a non-empty string when provided')\n  }\n  const duplicateProfileIds = profileIds.filter((id, index) => profileIds.indexOf(id) !== index)\n  if (duplicateProfileIds.length > 0) {\n    throw new ProfileMatrixError(\n      `duplicate agentProfileId values are not allowed: ${[...new Set(duplicateProfileIds)].join(', ')}`,\n    )\n  }\n  const experimentId =\n    opts.experimentId ??\n    `pm_${sha({ profileIds, scenarios: opts.scenarios.map((s) => s.id) }).slice(0, 16)}`\n  const derivedMatrixId = `mtx_${sha({\n    experimentId,\n    profileIds,\n    seed,\n    splitTag,\n    commitSha: opts.commitSha,\n    dispatchRef: opts.dispatchRef ?? null,\n  }).slice(0, 16)}`\n  const matrixId = opts.matrixId ?? derivedMatrixId\n  if (typeof matrixId !== 'string' || matrixId.trim().length === 0) {\n    throw new ProfileMatrixError('matrixId must be a non-empty string when provided')\n  }\n  // Scenario lookup for the corpus-text extractor (records carry trajectory text).\n  const scenarioById = new Map(opts.scenarios.map((s) => [s.id, s]))\n\n  // Preflight: every profile must hash and every static record field must validate before spend.\n  //\n  // A moving provider alias or `HARNESS_NATIVE_MODEL` cannot be a durable record identity.\n  // Probe it with a placeholder here so the remaining profile checks still run before spend;\n  // every completed cell must later supply its actual snapshot in the paid-call receipt.\n  for (const profile of opts.profiles) {\n    const profileHash = agentProfileHash(profile)\n    const profileId = agentProfileId(profile)\n    const declaredModel = agentProfileModelId(profile)\n    const model = modelHasSnapshot(declaredModel)\n      ? declaredModel\n      : `${declaredModel}@runtime-resolved`\n    try {\n      validateRunRecord({\n        runId: `${matrixId}:${profileId}:probe`,\n        experimentId,\n        candidateId: profileId,\n        seed,\n        model,\n        promptHash: profileHash,\n        configHash: profileHash,\n        commitSha: opts.commitSha,\n        wallMs: 0,\n        costUsd: null,\n        costProvenance: { kind: 'uncaptured', usd: null },\n        tokenUsage: { input: 0, output: 0 },\n        terminalOutcome: 'succeeded',\n        outcome: { raw: { execution_error_count: 0 } },\n        splitTag,\n        scenarioId: 'recordability-probe',\n      })\n    } catch (err) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' is not recordable: ${err instanceof Error ? err.message : String(err)}`,\n      )\n    }\n  }\n\n  const records: RunRecord[] = []\n  const campaigns: Record<string, CampaignResult<TArtifact, TScenario>> = {}\n  const byProfile: Record<string, ProfileSummary> = {}\n\n  const columns = await mapConcurrent(\n    opts.profiles,\n    maxProfileConcurrency,\n    async (profile, _index, signal) => {\n      const identity = profileMatrixCampaignIdentity({\n        profile,\n        scenarios: opts.scenarios,\n        judges: opts.judges,\n        commitSha: opts.commitSha,\n        dispatchRef: opts.dispatchRef,\n        splitTag,\n        seed,\n        reps: opts.reps,\n      })\n      const { profileHash, profileId, configHash, dispatchRef } = identity\n      const declaredModel = agentProfileModelId(profile)\n\n      // Bind the profile into a campaign dispatch. Name it so the campaign's\n      // manifest hash is stable + distinct per profile.\n      const dispatch = (scenario: TScenario, ctx: DispatchContext): Promise<TArtifact> =>\n        opts.dispatch(profile, scenario, ctx)\n      Object.defineProperty(dispatch, 'name', { value: `profile_${sanitize(profileId)}` })\n\n      const campaign = await runCampaign<TScenario, TArtifact>({\n        scenarios: opts.scenarios,\n        dispatch,\n        dispatchRef,\n        signal,\n        judges: opts.judges,\n        seed,\n        reps: opts.reps,\n        maxConcurrency: opts.maxConcurrency,\n        costCeiling: opts.costCeiling,\n        cellFilter: opts.rowFilter\n          ? ({ scenario, rep }) => opts.rowFilter?.({ profile, scenario, rep }) ?? false\n          : undefined,\n        reuseFailedCells: opts.reuseFailedCells,\n        labeledStore: opts.labeledStore,\n        captureSource: opts.captureSource,\n        storage: opts.storage,\n        now: opts.now,\n        runDir: join(opts.runDir, sanitize(profileId)),\n      })\n\n      // The canonical (profile, harness, model) identity for every record in this\n      // column, so results group by `groupRunsByAgentProfileCell` (harness/model\n      // aware). Harness comes from the axis stamp `expandProfileAxes` left on the\n      // profile; a profile that wasn't axis-expanded simply has no harness in its\n      // cell (unchanged grouping). A moving model alias means the cell identity\n      // must carry the resolved snapshot per cell (surfaced via\n      // `cell.resolvedModels`), so the pivot groups by the model that actually ran and\n      // the cell identity matches the RunRecord's pinned model.\n      const axis = harnessAxisOf(profile)\n      const buildCellIdentity = (cellModel?: string): Promise<AgentProfileCell> =>\n        buildAgentProfileCell({\n          profileId,\n          sourceProfile: { kind: 'agent-interface-profile', hash: profileHash },\n          ...(cellModel && cellModel !== UNKNOWN_MODEL ? { model: cellModel } : {}),\n          ...(axis ? { harness: { id: axis.harness } } : {}),\n        })\n      // A profile with a pinned declared model builds its cell identity once and\n      // shares it; a moving alias builds one per cell after resolution.\n      const sharedCellIdentity = modelHasSnapshot(declaredModel)\n        ? await buildCellIdentity(declaredModel)\n        : undefined\n\n      const profileRecords: RunRecord[] = []\n      for (const cell of campaign.cells) {\n        const cellModel = recordModel(cell, profileId, declaredModel)\n        const agentProfileCell =\n          cellModel === UNKNOWN_MODEL\n            ? await buildCellIdentity()\n            : (sharedCellIdentity ?? (await buildCellIdentity(cellModel)))\n        const record = buildRunRecord({\n          cell,\n          profile,\n          profileHash,\n          configHash,\n          experimentId,\n          splitTag,\n          commitSha: opts.commitSha,\n          matrixId,\n          agentProfileCell,\n          scenario: scenarioById.get(cell.scenarioId),\n          corpusText: opts.corpusText,\n        })\n        if (validate) validateRunRecord(record)\n        profileRecords.push(record)\n      }\n\n      const recordedModels = [\n        ...new Set(\n          profileRecords\n            .map((record) => record.model)\n            .filter((model): model is string => model !== UNKNOWN_MODEL),\n        ),\n      ]\n      if (recordedModels.length > 1) {\n        throw new ProfileMatrixError(\n          `profile '${profileId}' resolved to multiple model snapshots: ${recordedModels.join(', ')}`,\n        )\n      }\n\n      const costProvenance = campaign.aggregates.cost.costProvenance\n      const totalCostUsd = costProvenance.kind === 'uncaptured' ? null : costProvenance.usd\n      return {\n        profileId,\n        campaign,\n        records: profileRecords,\n        summary: {\n          profileId,\n          profileHash,\n          model: recordedModels[0] ?? UNKNOWN_MODEL,\n          records: profileRecords.length,\n          meanComposite: meanOrNull(\n            profileRecords.map(scoreOf).filter((score): score is number => score !== undefined),\n          ),\n          totalCostUsd,\n          costProvenance,\n          integrity: summarizeBackendIntegrity(profileRecords),\n        },\n      }\n    },\n  )\n\n  // Merge in caller order so concurrency cannot change output or report ordering.\n  for (const column of columns) {\n    campaigns[column.profileId] = column.campaign\n    byProfile[column.profileId] = column.summary\n    records.push(...column.records)\n  }\n\n  // Integrity by construction — the whole point of the primitive.\n  const integrity = summarizeBackendIntegrity(records)\n  if (integrityMode === 'assert') {\n    assertRealBackend(records, { allowMixed: opts.allowMixed ?? true })\n  } else if (integrityMode === 'warn' && integrity.verdict !== 'real') {\n    // eslint-disable-next-line no-console\n    console.warn(\n      `[runProfileMatrix] backend integrity: ${integrity.verdict} — ${integrity.diagnosis}`,\n    )\n  }\n\n  // Pivots.\n  const byScenario = rollup(records, (r) => r.scenarioId)\n  const byPersona = opts.personaOf\n    ? rollupByPersona(records, opts.scenarios, opts.personaOf)\n    : undefined\n\n  return { matrixId, experimentId, records, byProfile, byScenario, byPersona, integrity, campaigns }\n}\n\n/** Score for a produced RunRecord, absent when the campaign cell was unscored.\n *  Ungated (`runTaskScore` is raw) — a matrix pivot reports measured scores;\n *  it is not a training input. */\nfunction scoreOf(r: RunRecord): number | undefined {\n  return runTaskScore(r)\n}\n\nfunction meanOrNull(values: number[]): number | null {\n  return values.length === 0 ? null : mean(values)\n}\n\nfunction rollup(\n  records: RunRecord[],\n  keyOf: (r: RunRecord) => string | undefined,\n): Record<string, ScenarioRollup> {\n  const groups = new Map<string, number[]>()\n  for (const r of records) {\n    const key = keyOf(r)\n    if (key === undefined) continue\n    const score = scoreOf(r)\n    if (score === undefined) continue\n    const arr = groups.get(key) ?? []\n    arr.push(score)\n    groups.set(key, arr)\n  }\n  const out: Record<string, ScenarioRollup> = {}\n  for (const [key, xs] of groups) out[key] = { meanComposite: mean(xs), n: xs.length }\n  return out\n}\n\nfunction rollupByPersona<TScenario extends Scenario>(\n  records: RunRecord[],\n  scenarios: TScenario[],\n  personaOf: (s: TScenario) => string,\n): Record<string, ScenarioRollup> {\n  const personaByScenarioId = new Map<string, string>()\n  for (const s of scenarios) personaByScenarioId.set(s.id, personaOf(s))\n  return rollup(records, (r) => (r.scenarioId ? personaByScenarioId.get(r.scenarioId) : undefined))\n}\n","/**\n * Eval-owned execution for profile matrices whose external authorization is\n * shorter than the complete matrix.\n *\n * A plan freezes the complete profile × scenario × replicate design. A\n * segment claims an explicit, disjoint set of rows and uses the campaign cell\n * cache as the durable per-cell record. Finalization first checks that every\n * planned row has one claim and one valid record, then replays the ordinary\n * `runProfileMatrix` projection from those records without dispatching work.\n */\n\nimport { dirname, join } from 'node:path'\nimport { type AgentProfile, agentProfileHash, agentProfileId } from '../../agent-profile'\nimport { canonicalJson, contentHash } from '../../verdict-cache'\nimport { cellCachePath } from '../cell-schedule'\nimport { assertCampaignDesign, campaignScenarioIdentity } from '../coverage'\nimport { resolveRunDir } from '../run-dir'\nimport { campaignCellCostProvenance, projectCampaignCellQuality } from '../run-record'\nimport type { CampaignStorage } from '../storage'\nimport { fsCampaignStorage } from '../storage'\nimport type { CampaignCellResult, JudgeConfig, Scenario } from '../types'\nimport {\n  type ProfileDispatchFn,\n  ProfileMatrixError,\n  profileMatrixCampaignIdentity,\n  type RunProfileMatrixOptions,\n  type RunProfileMatrixResult,\n  runProfileMatrix,\n} from './run-profile-matrix'\n\nconst PLAN_FILE = 'profile-matrix-plan.json'\nconst SEGMENTS_FILE = 'profile-matrix-segments.jsonl'\n\nclass SegmentedProfileMatrixError extends ProfileMatrixError {\n  constructor(message: string) {\n    super(`segmented matrix: ${message}`)\n  }\n}\n\nexport interface ProfileMatrixRow {\n  rowId: string\n  ordinal: number\n  profileId: string\n  scenarioId: string\n  rep: number\n}\n\nexport interface ProfileMatrixPlan<TScenario extends Scenario, TArtifact> {\n  readonly schemaVersion: 1\n  readonly matrixId: string\n  readonly experimentId: string\n  readonly planDigest: `sha256:${string}`\n  readonly profiles: readonly AgentProfile[]\n  readonly scenarios: readonly TScenario[]\n  readonly judges: readonly JudgeConfig<TArtifact, TScenario>[]\n  readonly reps: number\n  readonly seed: number\n  readonly splitTag: NonNullable<RunProfileMatrixOptions<TScenario, TArtifact>['splitTag']>\n  readonly commitSha: string\n  /** Stable dispatch implementation/configuration identity used by cell caches. */\n  readonly dispatchRef: string\n  readonly integrity: NonNullable<RunProfileMatrixOptions<TScenario, TArtifact>['integrity']>\n  readonly allowMixed: boolean\n  readonly validate: boolean\n  readonly personaOf?: (scenario: TScenario) => string\n  readonly corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n  readonly rows: readonly ProfileMatrixRow[]\n}\n\nexport interface CreateProfileMatrixPlanOptions<TScenario extends Scenario, TArtifact>\n  extends Pick<\n    RunProfileMatrixOptions<TScenario, TArtifact>,\n    | 'profiles'\n    | 'scenarios'\n    | 'judges'\n    | 'commitSha'\n    | 'experimentId'\n    | 'splitTag'\n    | 'reps'\n    | 'seed'\n    | 'integrity'\n    | 'allowMixed'\n    | 'validate'\n    | 'personaOf'\n    | 'corpusText'\n  > {\n  /** Stable dispatch implementation/configuration identity used by cell caches. */\n  dispatchRef: string\n}\n\nexport interface ProfileMatrixCoverage {\n  expected: number\n  present: number\n  missing: string[]\n  failed: string[]\n  zeroScore: string[]\n}\n\nexport interface RunProfileMatrixSegmentOptions<TScenario extends Scenario, TArtifact> {\n  plan: ProfileMatrixPlan<TScenario, TArtifact>\n  /** Stable external grant or attempt identity. Reuse it to resume. */\n  segmentId: string\n  /** Explicit row ids from `plan.rows`; duplicate or unknown rows fail. */\n  rows: readonly (string | ProfileMatrixRow)[]\n  dispatch: ProfileDispatchFn<TScenario, TArtifact>\n  runDir: string\n  storage?: CampaignStorage\n  maxConcurrency?: number\n  maxProfileConcurrency?: number\n  costCeiling?: number\n  labeledStore?: RunProfileMatrixOptions<TScenario, TArtifact>['labeledStore']\n  captureSource?: RunProfileMatrixOptions<TScenario, TArtifact>['captureSource']\n  now?: () => Date\n}\n\nexport interface ProfileMatrixSegmentResult<TArtifact, TScenario extends Scenario> {\n  segmentId: string\n  rowIds: string[]\n  matrix: RunProfileMatrixResult<TArtifact, TScenario>\n  coverage: ProfileMatrixCoverage\n}\n\nexport interface FinalizeProfileMatrixOptions<TScenario extends Scenario, TArtifact> {\n  plan: ProfileMatrixPlan<TScenario, TArtifact>\n  runDir: string\n  storage?: CampaignStorage\n  maxConcurrency?: number\n  maxProfileConcurrency?: number\n  now?: () => Date\n}\n\nexport interface FinalizedProfileMatrixResult<TArtifact, TScenario extends Scenario>\n  extends RunProfileMatrixResult<TArtifact, TScenario> {\n  coverage: ProfileMatrixCoverage\n}\n\nexport function createProfileMatrixPlan<TScenario extends Scenario, TArtifact>(\n  opts: CreateProfileMatrixPlanOptions<TScenario, TArtifact>,\n): ProfileMatrixPlan<TScenario, TArtifact> {\n  if (!Array.isArray(opts.profiles) || opts.profiles.length === 0) {\n    throw new SegmentedProfileMatrixError('profiles must not be empty')\n  }\n  if (!Array.isArray(opts.scenarios) || opts.scenarios.length === 0) {\n    throw new SegmentedProfileMatrixError('scenarios must not be empty')\n  }\n  const reps = opts.reps ?? 1\n  const seed = opts.seed ?? 42\n  const splitTag = opts.splitTag ?? 'search'\n  const integrity = opts.integrity ?? 'assert'\n  const allowMixed = opts.allowMixed ?? true\n  const validate = opts.validate ?? true\n  if (typeof opts.commitSha !== 'string' || opts.commitSha.trim().length === 0) {\n    throw new SegmentedProfileMatrixError('commitSha must be a non-empty string')\n  }\n  if (typeof opts.dispatchRef !== 'string' || opts.dispatchRef.trim().length === 0) {\n    throw new SegmentedProfileMatrixError(\n      'dispatchRef must be a non-empty stable identity for segmented execution',\n    )\n  }\n  assertCampaignDesign(opts.scenarios, reps)\n\n  const profiles = [...opts.profiles]\n  const scenarios = [...opts.scenarios]\n  const judges = [...(opts.judges ?? [])]\n  const profileIds = profiles.map(agentProfileId)\n  const duplicateProfiles = profileIds.filter((id, index) => profileIds.indexOf(id) !== index)\n  if (duplicateProfiles.length > 0) {\n    throw new SegmentedProfileMatrixError(\n      `duplicate profile ids: ${[...new Set(duplicateProfiles)].join(', ')}`,\n    )\n  }\n\n  const experimentId =\n    opts.experimentId ??\n    `pm_${contentHash({ profileIds, scenarios: scenarios.map((scenario) => scenario.id) }).slice(0, 16)}`\n  if (experimentId.trim().length === 0) {\n    throw new SegmentedProfileMatrixError('experimentId must be non-empty')\n  }\n\n  const identityMaterial = {\n    schema: 'tangle.profile-matrix-plan.v1',\n    profiles: profiles.map((profile, index) => ({\n      ordinal: index,\n      id: profileIds[index],\n      hash: `sha256:${agentProfileHash(profile)}`,\n      profile,\n    })),\n    scenarios: scenarios.map((scenario, index) => ({\n      ordinal: index,\n      identity: campaignScenarioIdentity(scenario),\n      scenario,\n    })),\n    judges: judges.map((judge) => ({\n      name: judge.name,\n      dimensions: judge.dimensions,\n      judgeVersion: judge.judgeVersion ?? null,\n      score: judge.score.toString(),\n      appliesTo: judge.appliesTo?.toString() ?? null,\n    })),\n    reps,\n    seed,\n    splitTag,\n    commitSha: opts.commitSha,\n    dispatchRef: opts.dispatchRef,\n    experimentId,\n    integrity,\n    allowMixed,\n    validate,\n    personaOf: opts.personaOf?.toString() ?? null,\n    corpusText: opts.corpusText?.toString() ?? null,\n  }\n  const planDigest = `sha256:${contentHash(identityMaterial)}` as const\n  const matrixId = `pmx_${planDigest.slice('sha256:'.length, 'sha256:'.length + 24)}`\n  const rows: ProfileMatrixRow[] = []\n  const seenCellIds = new Set<string>()\n  let ordinal = 0\n  for (const profileId of profileIds) {\n    for (const scenario of scenarios) {\n      for (let rep = 0; rep < reps; rep += 1) {\n        const cellId = `${scenario.id}:${rep}`\n        if (seenCellIds.has(`${profileId}:${cellId}`)) {\n          throw new SegmentedProfileMatrixError(\n            `profile/scenario/rep cell id collision for '${profileId}:${cellId}'`,\n          )\n        }\n        seenCellIds.add(`${profileId}:${cellId}`)\n        rows.push({\n          rowId: `row_${contentHash({ matrixId, profileId, scenarioId: scenario.id, rep }).slice(0, 24)}`,\n          ordinal,\n          profileId,\n          scenarioId: scenario.id,\n          rep,\n        })\n        ordinal += 1\n      }\n    }\n  }\n\n  return Object.freeze({\n    schemaVersion: 1,\n    matrixId,\n    experimentId,\n    planDigest,\n    profiles: Object.freeze(profiles),\n    scenarios: Object.freeze(scenarios),\n    judges: Object.freeze(judges),\n    reps,\n    seed,\n    splitTag,\n    commitSha: opts.commitSha,\n    dispatchRef: opts.dispatchRef,\n    integrity,\n    allowMixed,\n    validate,\n    ...(opts.personaOf === undefined ? {} : { personaOf: opts.personaOf }),\n    ...(opts.corpusText === undefined ? {} : { corpusText: opts.corpusText }),\n    rows: Object.freeze(rows),\n  }) as ProfileMatrixPlan<TScenario, TArtifact>\n}\n\nexport async function runProfileMatrixSegment<TScenario extends Scenario, TArtifact>(\n  opts: RunProfileMatrixSegmentOptions<TScenario, TArtifact>,\n): Promise<ProfileMatrixSegmentResult<TArtifact, TScenario>> {\n  const segmentId = requireIdentifier(opts.segmentId, 'segmentId')\n  const storage = opts.storage ?? fsCampaignStorage()\n  const runDir = resolveRunDir(opts.runDir)\n  assertPlan(opts.plan)\n  const selected = normalizeRows(opts.plan, opts.rows)\n  ensureManifest(storage, runDir, manifestFor(opts.plan))\n  claimSegment(storage, runDir, opts.plan, segmentId, selected)\n\n  const selectedIds = new Set(selected.map((row) => row.rowId))\n  const selectedProfileIds = new Set(selected.map((row) => row.profileId))\n  const profiles = opts.plan.profiles.filter((profile) =>\n    selectedProfileIds.has(agentProfileId(profile)),\n  )\n\n  const matrix = await runProfileMatrix<TScenario, TArtifact>({\n    profiles,\n    scenarios: [...opts.plan.scenarios],\n    dispatch: opts.dispatch,\n    judges: [...opts.plan.judges],\n    runDir,\n    commitSha: opts.plan.commitSha,\n    dispatchRef: opts.plan.dispatchRef,\n    experimentId: opts.plan.experimentId,\n    matrixId: opts.plan.matrixId,\n    splitTag: opts.plan.splitTag,\n    reps: opts.plan.reps,\n    seed: opts.plan.seed,\n    integrity: 'off',\n    allowMixed: opts.plan.allowMixed,\n    maxConcurrency: opts.maxConcurrency,\n    maxProfileConcurrency: opts.maxProfileConcurrency,\n    costCeiling: opts.costCeiling,\n    labeledStore: opts.labeledStore,\n    captureSource: opts.captureSource,\n    storage,\n    now: opts.now,\n    personaOf: opts.plan.personaOf,\n    validate: opts.plan.validate,\n    corpusText: opts.plan.corpusText,\n    reuseFailedCells: false,\n    rowFilter: ({ profile, scenario, rep }) =>\n      selectedIds.has(rowIdFor(opts.plan, agentProfileId(profile), scenario.id, rep)),\n  })\n\n  persistSegmentCells(storage, runDir, matrix)\n  const coverage = readCoverage(storage, runDir, opts.plan)\n  return { segmentId, rowIds: selected.map((row) => row.rowId), matrix, coverage }\n}\n\nexport async function finalizeProfileMatrix<TScenario extends Scenario, TArtifact>(\n  opts: FinalizeProfileMatrixOptions<TScenario, TArtifact>,\n): Promise<FinalizedProfileMatrixResult<TArtifact, TScenario>> {\n  const storage = opts.storage ?? fsCampaignStorage()\n  const runDir = resolveRunDir(opts.runDir)\n  assertPlan(opts.plan)\n  ensureManifest(storage, runDir, manifestFor(opts.plan))\n  const claims = readSegmentClaims(storage, runDir)\n  assertCompleteClaims(opts.plan, claims)\n  const coverage = readCoverage(storage, runDir, opts.plan)\n  if (coverage.missing.length > 0) {\n    throw new SegmentedProfileMatrixError(\n      `cannot finalize with missing rows: ${coverage.missing.join(', ')}`,\n    )\n  }\n\n  const matrix = await runProfileMatrix<TScenario, TArtifact>({\n    profiles: [...opts.plan.profiles],\n    scenarios: [...opts.plan.scenarios],\n    dispatch: async () => {\n      throw new SegmentedProfileMatrixError(\n        'finalization attempted to dispatch an uncached row; the persisted coverage changed during finalization',\n      )\n    },\n    judges: [...opts.plan.judges],\n    runDir,\n    commitSha: opts.plan.commitSha,\n    dispatchRef: opts.plan.dispatchRef,\n    experimentId: opts.plan.experimentId,\n    matrixId: opts.plan.matrixId,\n    splitTag: opts.plan.splitTag,\n    reps: opts.plan.reps,\n    seed: opts.plan.seed,\n    integrity: opts.plan.integrity,\n    allowMixed: opts.plan.allowMixed,\n    maxConcurrency: opts.maxConcurrency,\n    maxProfileConcurrency: opts.maxProfileConcurrency,\n    storage,\n    now: opts.now,\n    personaOf: opts.plan.personaOf,\n    validate: opts.plan.validate,\n    corpusText: opts.plan.corpusText,\n    reuseFailedCells: true,\n  })\n  assertFinalRows(opts.plan, matrix)\n  return { ...matrix, coverage }\n}\n\ninterface PersistedMatrixManifest {\n  schemaVersion: 1\n  matrixId: string\n  experimentId: string\n  planDigest: string\n  profiles: Array<{ id: string; hash: string }>\n  scenarios: Array<{ id: string; kind: string; scenarioDigest: string }>\n  reps: number\n  seed: number\n  splitTag: string\n  commitSha: string\n  dispatchRef: string\n  rows: ProfileMatrixRow[]\n}\n\ninterface SegmentClaim {\n  schemaVersion: 1\n  segmentId: string\n  planDigest: string\n  rowIds: string[]\n}\n\nfunction manifestFor<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n): PersistedMatrixManifest {\n  return {\n    schemaVersion: 1,\n    matrixId: plan.matrixId,\n    experimentId: plan.experimentId,\n    planDigest: plan.planDigest,\n    profiles: plan.profiles.map((profile) => ({\n      id: agentProfileId(profile),\n      hash: `sha256:${agentProfileHash(profile)}`,\n    })),\n    scenarios: plan.scenarios.map((scenario) => campaignScenarioIdentity(scenario)),\n    reps: plan.reps,\n    seed: plan.seed,\n    splitTag: plan.splitTag,\n    commitSha: plan.commitSha,\n    dispatchRef: plan.dispatchRef,\n    rows: [...plan.rows],\n  }\n}\n\nfunction assertPlan<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n): void {\n  const rebuilt = createProfileMatrixPlan({\n    profiles: [...plan.profiles],\n    scenarios: [...plan.scenarios],\n    judges: [...plan.judges],\n    commitSha: plan.commitSha,\n    dispatchRef: plan.dispatchRef,\n    experimentId: plan.experimentId,\n    splitTag: plan.splitTag,\n    reps: plan.reps,\n    seed: plan.seed,\n    integrity: plan.integrity,\n    allowMixed: plan.allowMixed,\n    validate: plan.validate,\n    personaOf: plan.personaOf,\n    corpusText: plan.corpusText,\n  })\n  if (\n    rebuilt.planDigest !== plan.planDigest ||\n    rebuilt.matrixId !== plan.matrixId ||\n    canonicalJson(rebuilt.rows) !== canonicalJson(plan.rows)\n  ) {\n    throw new SegmentedProfileMatrixError('plan inputs changed after identity was created')\n  }\n}\n\nfunction ensureManifest(\n  storage: CampaignStorage,\n  runDir: string,\n  expected: PersistedMatrixManifest,\n): void {\n  storage.ensureDir(runDir)\n  const path = join(runDir, PLAN_FILE)\n  const existing = storage.read(path)\n  if (existing === undefined) {\n    const content = `${canonicalJson(expected)}\\n`\n    if (storage.append(path, content, 0) !== undefined) return\n  }\n  const persisted = storage.read(path)\n  if (persisted === undefined) {\n    throw new SegmentedProfileMatrixError('persisted plan is unreadable')\n  }\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(persisted)\n  } catch {\n    throw new SegmentedProfileMatrixError('persisted plan is corrupt JSON')\n  }\n  if (canonicalJson(parsed) !== canonicalJson(expected)) {\n    throw new SegmentedProfileMatrixError(\n      'persisted plan identity does not match the supplied inputs',\n    )\n  }\n}\n\nfunction normalizeRows<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  rows: readonly (string | ProfileMatrixRow)[],\n): ProfileMatrixRow[] {\n  if (!Array.isArray(rows) || rows.length === 0) {\n    throw new SegmentedProfileMatrixError('a segment must select at least one row')\n  }\n  const byId = new Map(plan.rows.map((row) => [row.rowId, row]))\n  const selected: ProfileMatrixRow[] = []\n  const seen = new Set<string>()\n  for (const input of rows) {\n    const rowId = typeof input === 'string' ? input : input?.rowId\n    if (typeof rowId !== 'string' || rowId.length === 0) {\n      throw new SegmentedProfileMatrixError('segment rows must contain row ids')\n    }\n    if (seen.has(rowId))\n      throw new SegmentedProfileMatrixError(`duplicate row '${rowId}' in segment`)\n    const row = byId.get(rowId)\n    if (!row) throw new SegmentedProfileMatrixError(`row '${rowId}' is not declared by the plan`)\n    if (typeof input !== 'string' && canonicalJson(input) !== canonicalJson(row)) {\n      throw new SegmentedProfileMatrixError(`row '${rowId}' does not match the declared plan row`)\n    }\n    seen.add(rowId)\n    selected.push(row)\n  }\n  return selected.sort((left, right) => left.ordinal - right.ordinal)\n}\n\nfunction claimSegment<TScenario extends Scenario, TArtifact>(\n  storage: CampaignStorage,\n  runDir: string,\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  segmentId: string,\n  selected: readonly ProfileMatrixRow[],\n): void {\n  const path = join(runDir, SEGMENTS_FILE)\n  const expected = canonicalJson({\n    schemaVersion: 1,\n    segmentId,\n    planDigest: plan.planDigest,\n    rowIds: selected.map((row) => row.rowId).sort(),\n  } satisfies SegmentClaim)\n  for (let attempt = 0; attempt < 8; attempt += 1) {\n    const raw = storage.read(path) ?? ''\n    const claims = parseSegmentClaims(raw, path)\n    const existing = claims.find((claim) => claim.segmentId === segmentId)\n    if (existing) {\n      if (canonicalJson(existing) !== expected) {\n        throw new SegmentedProfileMatrixError(\n          `segment '${segmentId}' was resumed with different rows or plan identity`,\n        )\n      }\n      return\n    }\n    const selectedIds = new Set(selected.map((row) => row.rowId))\n    const overlap = claims.flatMap((claim) =>\n      claim.rowIds\n        .filter((rowId) => selectedIds.has(rowId))\n        .map((rowId) => `${rowId} (${claim.segmentId})`),\n    )\n    if (overlap.length > 0) {\n      throw new SegmentedProfileMatrixError(\n        `segment rows overlap existing claims: ${overlap.join(', ')}`,\n      )\n    }\n    const event = `${expected}\\n`\n    const next = storage.append(path, event, byteLength(raw))\n    if (next !== undefined) return\n  }\n  throw new SegmentedProfileMatrixError(\n    `could not claim segment '${segmentId}' after concurrent updates`,\n  )\n}\n\nfunction readSegmentClaims(storage: CampaignStorage, runDir: string): SegmentClaim[] {\n  const path = join(runDir, SEGMENTS_FILE)\n  const raw = storage.read(path)\n  if (raw === undefined) return []\n  return parseSegmentClaims(raw, path)\n}\n\nfunction parseSegmentClaims(raw: string, path: string): SegmentClaim[] {\n  const claims: SegmentClaim[] = []\n  const seenSegments = new Set<string>()\n  const seenRows = new Map<string, string>()\n  for (const [index, line] of raw.split('\\n').entries()) {\n    if (line.trim() === '') continue\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(line)\n    } catch {\n      throw new SegmentedProfileMatrixError(`segment registry is corrupt at ${path}:${index + 1}`)\n    }\n    if (canonicalJson(parsed) !== line) {\n      throw new SegmentedProfileMatrixError(\n        `segment registry is not canonical at ${path}:${index + 1}`,\n      )\n    }\n    const claim = parsed as Partial<SegmentClaim>\n    if (\n      claim.schemaVersion !== 1 ||\n      typeof claim.segmentId !== 'string' ||\n      typeof claim.planDigest !== 'string' ||\n      !Array.isArray(claim.rowIds) ||\n      claim.rowIds.some((rowId) => typeof rowId !== 'string') ||\n      new Set(claim.rowIds).size !== claim.rowIds.length\n    ) {\n      throw new SegmentedProfileMatrixError(\n        `segment registry has an invalid claim at ${path}:${index + 1}`,\n      )\n    }\n    if (seenSegments.has(claim.segmentId)) {\n      throw new SegmentedProfileMatrixError(`segment registry repeats segment '${claim.segmentId}'`)\n    }\n    seenSegments.add(claim.segmentId)\n    const normalized = {\n      schemaVersion: 1 as const,\n      segmentId: claim.segmentId,\n      planDigest: claim.planDigest,\n      rowIds: [...claim.rowIds].sort(),\n    }\n    for (const rowId of normalized.rowIds) {\n      const owner = seenRows.get(rowId)\n      if (owner) {\n        throw new SegmentedProfileMatrixError(\n          `segment registry overlaps row '${rowId}' between '${owner}' and '${normalized.segmentId}'`,\n        )\n      }\n      seenRows.set(rowId, normalized.segmentId)\n    }\n    claims.push(normalized)\n  }\n  return claims\n}\n\nfunction assertCompleteClaims<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  claims: readonly SegmentClaim[],\n): void {\n  const expected = new Set(plan.rows.map((row) => row.rowId))\n  const claimed = new Set<string>()\n  for (const claim of claims) {\n    if (claim.planDigest !== plan.planDigest) {\n      throw new SegmentedProfileMatrixError(\n        `segment '${claim.segmentId}' belongs to a different plan identity`,\n      )\n    }\n    for (const rowId of claim.rowIds) {\n      if (!expected.has(rowId)) {\n        throw new SegmentedProfileMatrixError(\n          `segment '${claim.segmentId}' claims an undeclared row '${rowId}'`,\n        )\n      }\n      claimed.add(rowId)\n    }\n  }\n  const missingClaims = plan.rows.filter((row) => !claimed.has(row.rowId)).map((row) => row.rowId)\n  if (missingClaims.length > 0) {\n    throw new SegmentedProfileMatrixError(\n      `cannot finalize until every row is claimed: ${missingClaims.join(', ')}`,\n    )\n  }\n}\n\nfunction persistSegmentCells<TArtifact, TScenario extends Scenario>(\n  storage: CampaignStorage,\n  runDir: string,\n  matrix: RunProfileMatrixResult<TArtifact, TScenario>,\n): void {\n  for (const [profileId, campaign] of Object.entries(matrix.campaigns)) {\n    for (const cell of campaign.cells) {\n      const path = cellCachePath(join(runDir, profileDirectory(profileId)), cell.cellId)\n      storage.ensureDir(dirname(path))\n      // Campaign caches already use JSON.stringify, which omits optional\n      // undefined fields such as a successful cell's `error` property.\n      storage.write(path, `${JSON.stringify(cell)}\\n`)\n    }\n  }\n}\n\nfunction readCoverage<TScenario extends Scenario, TArtifact>(\n  storage: CampaignStorage,\n  runDir: string,\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n): ProfileMatrixCoverage {\n  const expectedManifestHashes = new Map<string, string>(\n    plan.profiles.map((profile) => {\n      const identity = profileMatrixCampaignIdentity({\n        profile,\n        scenarios: [...plan.scenarios],\n        judges: [...plan.judges],\n        commitSha: plan.commitSha,\n        dispatchRef: plan.dispatchRef,\n        splitTag: plan.splitTag,\n        seed: plan.seed,\n        reps: plan.reps,\n      })\n      return [identity.profileId, identity.manifestHash] as const\n    }),\n  )\n  const missing: string[] = []\n  const failed: string[] = []\n  const zeroScore: string[] = []\n  let present = 0\n  for (const row of plan.rows) {\n    const path = cellCachePath(\n      join(runDir, profileDirectory(row.profileId)),\n      `${row.scenarioId}:${row.rep}`,\n    )\n    const raw = storage.read(path)\n    if (raw === undefined) {\n      missing.push(row.rowId)\n      continue\n    }\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(raw)\n    } catch {\n      throw new SegmentedProfileMatrixError(`cell '${row.rowId}' has corrupt JSON`)\n    }\n    if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed)) {\n      throw new SegmentedProfileMatrixError(`cell '${row.rowId}' has an invalid record shape`)\n    }\n    const cell = parsed as CampaignCellResult<TArtifact>\n    if (\n      cell.cellId !== `${row.scenarioId}:${row.rep}` ||\n      cell.scenarioId !== row.scenarioId ||\n      cell.rep !== row.rep ||\n      cell.manifestHash !== expectedManifestHashes.get(row.profileId)\n    ) {\n      throw new SegmentedProfileMatrixError(\n        `cell '${row.rowId}' has stale identity fields (manifest or row identity)`,\n      )\n    }\n    try {\n      campaignCellCostProvenance(cell)\n    } catch (error) {\n      throw new SegmentedProfileMatrixError(\n        `cell '${row.rowId}' failed cost-record validation: ${error instanceof Error ? error.message : String(error)}`,\n      )\n    }\n    present += 1\n    if (cell.error !== undefined) {\n      failed.push(row.rowId)\n      continue\n    }\n    if (projectCampaignCellQuality(cell).score === 0) zeroScore.push(row.rowId)\n  }\n  return {\n    expected: plan.rows.length,\n    present,\n    missing,\n    failed,\n    zeroScore,\n  }\n}\n\nfunction assertFinalRows<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  matrix: RunProfileMatrixResult<TArtifact, TScenario>,\n): void {\n  const expected = new Set(plan.rows.map((row) => `${row.profileId}:${row.scenarioId}:${row.rep}`))\n  const seen = new Set<string>()\n  for (const record of matrix.records) {\n    const key = `${record.candidateId}:${record.scenarioId}:${record.outcome.raw.rep}`\n    if (!expected.has(key) || seen.has(key)) {\n      throw new SegmentedProfileMatrixError(\n        `final matrix has an unexpected or duplicate row '${key}'`,\n      )\n    }\n    seen.add(key)\n  }\n  if (seen.size !== expected.size) {\n    throw new SegmentedProfileMatrixError(\n      `final matrix returned ${seen.size}/${expected.size} declared rows`,\n    )\n  }\n}\n\nfunction rowIdFor<TScenario extends Scenario, TArtifact>(\n  plan: ProfileMatrixPlan<TScenario, TArtifact>,\n  profileId: string,\n  scenarioId: string,\n  rep: number,\n): string {\n  const row = plan.rows.find(\n    (candidate) =>\n      candidate.profileId === profileId &&\n      candidate.scenarioId === scenarioId &&\n      candidate.rep === rep,\n  )\n  if (!row)\n    throw new SegmentedProfileMatrixError(`row is not declared: ${profileId}/${scenarioId}/${rep}`)\n  return row.rowId\n}\n\nfunction profileDirectory(profileId: string): string {\n  return profileId.replace(/[^a-zA-Z0-9_-]/g, '_')\n}\n\nfunction requireIdentifier(value: string, name: string): string {\n  if (typeof value !== 'string' || value.trim().length === 0) {\n    throw new SegmentedProfileMatrixError(`${name} must be a non-empty string`)\n  }\n  return value\n}\n\nfunction byteLength(value: string): number {\n  return new TextEncoder().encode(value).byteLength\n}\n","/**\n * Discriminative scenario selection (research claim E2).\n *\n * The OR benchmark is SATURATING: run 7 measured ~75% tied holdout cells — most\n * problems are solved optimally by the baseline AND every candidate, so those\n * paired cells carry zero signal. A random/balanced holdout split spends its\n * budget on scenarios that cannot separate candidates.\n *\n * This picks the holdout by DISCRIMINATION power instead: a scenario every\n * candidate scores identically (variance ~0) carries no signal; one where the\n * scores spread carries the most. We drop fully saturated ties so each paired\n * holdout cell is spent on a scenario that can actually move a verdict.\n */\n\n/** Per-scenario observation: the composite scores each candidate earned on it. */\nexport interface ScenarioSignal {\n  scenarioId: string\n  /** Per-candidate composite scores observed for this scenario (>=1 values). */\n  scores: number[]\n}\n\nexport interface DiscriminationScore {\n  scenarioId: string\n  /** Higher = separates candidates more (spread of their scores). */\n  discrimination: number\n  /** Higher = easier / more-saturated (mean of candidate scores). */\n  meanScore: number\n  variance: number\n  /** variance ~0 AND meanScore at/above the ceiling ⇒ a saturated tie, no signal. */\n  tied: boolean\n}\n\nconst DEFAULT_SATURATION_CEILING = 0.999\n/** Variance below this is treated as \"every candidate scored the same\". */\nconst VARIANCE_EPSILON = 1e-9\n\ninterface Moments {\n  meanScore: number\n  variance: number\n}\n\n/** Population mean + variance of the candidate scores. Empty ⇒ zeros (a signal\n *  with no observations cannot discriminate). */\nfunction moments(scores: number[]): Moments {\n  const n = scores.length\n  if (n === 0) return { meanScore: 0, variance: 0 }\n  let sum = 0\n  for (const s of scores) sum += s\n  const meanScore = sum / n\n  let sqDev = 0\n  for (const s of scores) {\n    const d = s - meanScore\n    sqDev += d * d\n  }\n  return { meanScore, variance: sqDev / n }\n}\n\n/** Deterministic ordering: discrimination desc, then meanScore asc (more\n *  headroom first), then scenarioId asc. */\nfunction compareDiscrimination(a: DiscriminationScore, b: DiscriminationScore): number {\n  if (b.discrimination !== a.discrimination) return b.discrimination - a.discrimination\n  if (a.meanScore !== b.meanScore) return a.meanScore - b.meanScore\n  return a.scenarioId < b.scenarioId ? -1 : a.scenarioId > b.scenarioId ? 1 : 0\n}\n\n/**\n * Rank scenarios by how well they DISCRIMINATE candidates.\n *\n * `discrimination = variance` (spread of the candidate scores) — kept simple on\n * purpose; the headroom term (`saturationCeiling - meanScore`) only breaks ties\n * so that, among equally spread scenarios, the one with more room to improve\n * ranks first. Returned sorted by the deterministic order above.\n */\nexport function scoreDiscrimination(\n  signals: ScenarioSignal[],\n  opts?: { saturationCeiling?: number },\n): DiscriminationScore[] {\n  const saturationCeiling = opts?.saturationCeiling ?? DEFAULT_SATURATION_CEILING\n  const scored = signals.map((signal): DiscriminationScore => {\n    const { meanScore, variance } = moments(signal.scores)\n    const tied = variance < VARIANCE_EPSILON && meanScore >= saturationCeiling\n    return {\n      scenarioId: signal.scenarioId,\n      discrimination: variance,\n      meanScore,\n      variance,\n      tied,\n    }\n  })\n  return scored.sort(compareDiscrimination)\n}\n\n/**\n * Select the top-`k` most discriminative scenario ids for a holdout, EXCLUDING\n * fully saturated ties when enough non-tied scenarios exist (a tie in the\n * holdout wastes a paired cell).\n *\n * Prefers non-tied scenarios; if fewer than `k` non-tied exist, fills with the\n * least-saturated tied ones (tied scenarios are already ordered least-saturated\n * first by `meanScore` asc). Deterministic. Throws if `k < 1`. If\n * `signals.length <= k`, returns all ids in discrimination order.\n */\nexport function selectDiscriminative(\n  signals: ScenarioSignal[],\n  k: number,\n  opts?: { saturationCeiling?: number },\n): string[] {\n  if (k < 1) throw new Error(`selectDiscriminative: k must be >= 1 (got ${k})`)\n  const ranked = scoreDiscrimination(signals, opts)\n  if (ranked.length <= k) return ranked.map((s) => s.scenarioId)\n  const nonTied = ranked.filter((s) => !s.tied)\n  if (nonTied.length >= k) return nonTied.slice(0, k).map((s) => s.scenarioId)\n  const tied = ranked.filter((s) => s.tied)\n  const fill = tied.slice(0, k - nonTied.length)\n  return [...nonTied, ...fill].map((s) => s.scenarioId)\n}\n","import {\n  CostAccountingIncompleteError,\n  type CostLedgerHandle,\n  type RunPaidCallInput,\n} from '../cost-ledger'\nimport type { JudgeConfig, JudgeScore, Scenario } from './types'\n\nexport interface PhoenixEvaluationResultLike {\n  score?: number\n  label?: string\n  explanation?: string\n}\n\nexport interface PhoenixEvaluatorLike<TRecord extends Record<string, unknown>> {\n  name: string\n  kind: 'LLM' | 'CODE'\n  optimizationDirection?: 'MAXIMIZE' | 'MINIMIZE' | 'NEUTRAL'\n  evaluate(\n    record: TRecord,\n    context: UpstreamEvaluationContext,\n  ): Promise<PhoenixEvaluationResultLike>\n}\n\nexport interface AutoevalsScoreLike {\n  name: string\n  score: number | null\n  metadata?: Record<string, unknown>\n}\n\nexport type AutoevalsScorerLike<TInput extends Record<string, unknown>> = (\n  input: TInput,\n  context: UpstreamEvaluationContext,\n) => AutoevalsScoreLike | Promise<AutoevalsScoreLike>\n\nexport interface UpstreamEvaluationContext {\n  readonly signal: AbortSignal\n  readonly callId?: string\n}\n\ntype PaidEvaluationOptions<TResult> = Pick<\n  RunPaidCallInput<TResult>,\n  'maximumCharge' | 'receipt' | 'receiptFromError'\n> & {\n  model: string\n}\n\ninterface UpstreamJudgeOptions<TScenario extends Scenario> {\n  name?: string\n  dimension?: string\n  judgeVersion?: string\n  appliesTo?: (scenario: TScenario) => boolean\n  /** Convert the upstream score when its native scale is not higher-is-better. */\n  toComposite?: (score: number) => number\n}\n\nexport function phoenixEvaluatorJudge<\n  TRecord extends Record<string, unknown>,\n  TArtifact,\n  TScenario extends Scenario = Scenario,\n>(\n  evaluator: PhoenixEvaluatorLike<TRecord>,\n  options: UpstreamJudgeOptions<TScenario> & {\n    mapInput(input: { artifact: TArtifact; scenario: TScenario }): TRecord\n    paidCall?: PaidEvaluationOptions<PhoenixEvaluationResultLike>\n  },\n): JudgeConfig<TArtifact, TScenario> {\n  if (\n    (evaluator.optimizationDirection === 'MINIMIZE' ||\n      evaluator.optimizationDirection === 'NEUTRAL') &&\n    !options.toComposite\n  ) {\n    throw new TypeError(\n      `phoenixEvaluatorJudge requires toComposite for a ${evaluator.optimizationDirection} evaluator`,\n    )\n  }\n  const paidCall = validatePaidEvaluation(evaluator.name, evaluator.kind, options.paidCall)\n  return upstreamJudge(\n    {\n      name: options.name ?? evaluator.name,\n      dimension: options.dimension,\n      judgeVersion: options.judgeVersion,\n      appliesTo: options.appliesTo,\n      toComposite: options.toComposite,\n    },\n    async (input) => {\n      const result = await runUpstreamEvaluation({\n        name: evaluator.name,\n        kind: evaluator.kind,\n        signal: input.signal,\n        costLedger: input.costLedger,\n        costPhase: input.costPhase,\n        costTags: input.costTags,\n        scenarioId: input.scenario.id,\n        paidCall,\n        execute: (context) =>\n          evaluator.evaluate(\n            options.mapInput({ artifact: input.artifact, scenario: input.scenario }),\n            context,\n          ),\n      })\n      if (result.score === undefined || !Number.isFinite(result.score)) {\n        throw new Error(`${evaluator.name}: Phoenix evaluator returned no finite score`)\n      }\n      return {\n        score: result.score,\n        notes: [result.label, result.explanation].filter(Boolean).join(': ') || evaluator.name,\n      }\n    },\n  )\n}\n\nexport function autoevalsScorerJudge<\n  TInput extends Record<string, unknown>,\n  TArtifact,\n  TScenario extends Scenario = Scenario,\n>(\n  scorer: AutoevalsScorerLike<TInput>,\n  options: UpstreamJudgeOptions<TScenario> & {\n    name: string\n    mapInput(input: { artifact: TArtifact; scenario: TScenario }): TInput\n  } & (\n      | { kind: 'CODE'; paidCall?: never }\n      | { kind: 'LLM'; paidCall: PaidEvaluationOptions<AutoevalsScoreLike> }\n    ),\n): JudgeConfig<TArtifact, TScenario> {\n  const paidCall = validatePaidEvaluation(options.name, options.kind, options.paidCall)\n  return upstreamJudge(options, async (input) => {\n    const result = await runUpstreamEvaluation({\n      name: options.name,\n      kind: options.kind,\n      signal: input.signal,\n      costLedger: input.costLedger,\n      costPhase: input.costPhase,\n      costTags: input.costTags,\n      scenarioId: input.scenario.id,\n      paidCall,\n      execute: (context) =>\n        scorer(options.mapInput({ artifact: input.artifact, scenario: input.scenario }), context),\n    })\n    if (result.score === null || !Number.isFinite(result.score)) {\n      throw new Error(`${options.name}: Autoevals scorer returned no finite score`)\n    }\n    return {\n      score: result.score,\n      notes: result.metadata ? JSON.stringify(result.metadata) : result.name,\n    }\n  })\n}\n\nfunction upstreamJudge<TArtifact, TScenario extends Scenario>(\n  options: UpstreamJudgeOptions<TScenario> & { name: string },\n  evaluate: (\n    input: Parameters<JudgeConfig<TArtifact, TScenario>['score']>[0],\n  ) => Promise<{ score: number; notes: string }>,\n): JudgeConfig<TArtifact, TScenario> {\n  const dimension = options.dimension ?? options.name\n  return {\n    name: options.name,\n    judgeVersion: options.judgeVersion,\n    dimensions: [{ key: dimension, description: `Score from ${options.name}` }],\n    appliesTo: options.appliesTo,\n    async score(input): Promise<JudgeScore> {\n      const result = await evaluate(input)\n      const composite = options.toComposite ? options.toComposite(result.score) : result.score\n      if (!Number.isFinite(composite)) {\n        throw new Error(`${options.name}: toComposite returned a non-finite score`)\n      }\n      return {\n        dimensions: { [dimension]: result.score },\n        composite,\n        notes: result.notes,\n      }\n    },\n  }\n}\n\nfunction validatePaidEvaluation<TResult>(\n  name: string,\n  kind: 'LLM' | 'CODE',\n  paidCall: PaidEvaluationOptions<TResult> | undefined,\n): PaidEvaluationOptions<TResult> | undefined {\n  if (kind === 'CODE') {\n    if (paidCall) {\n      throw new TypeError(`${name}: CODE evaluator cannot declare paidCall`)\n    }\n    return undefined\n  }\n  if (!paidCall) {\n    throw new TypeError(`${name}: LLM evaluator requires paidCall cost and token capture`)\n  }\n  if (!paidCall.model.trim()) {\n    throw new TypeError(`${name}: paidCall.model must be non-empty`)\n  }\n  return paidCall\n}\n\nasync function runUpstreamEvaluation<TResult>(input: {\n  name: string\n  kind: 'LLM' | 'CODE'\n  signal: AbortSignal\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  costTags?: Record<string, string>\n  scenarioId: string\n  paidCall?: PaidEvaluationOptions<TResult>\n  execute(context: UpstreamEvaluationContext): Promise<TResult> | TResult\n}): Promise<TResult> {\n  if (input.kind === 'CODE') {\n    return abortableEvaluation(input.signal, () => input.execute({ signal: input.signal }))\n  }\n  if (!input.paidCall) {\n    throw new CostAccountingIncompleteError(`${input.name}: missing paid-call configuration`)\n  }\n  if (!input.costLedger) {\n    throw new CostAccountingIncompleteError(\n      `${input.name}: LLM evaluator requires the campaign cost ledger`,\n    )\n  }\n\n  const paid = await input.costLedger.runPaidCall({\n    channel: 'judge',\n    phase: input.costPhase ?? 'judge',\n    actor: input.name,\n    model: input.paidCall.model,\n    ...(input.paidCall.maximumCharge ? { maximumCharge: input.paidCall.maximumCharge } : {}),\n    tags: { ...input.costTags, scenarioId: input.scenarioId },\n    signal: input.signal,\n    execute: (signal, callId) => Promise.resolve(input.execute({ signal, callId })),\n    receipt: input.paidCall.receipt,\n    ...(input.paidCall.receiptFromError\n      ? { receiptFromError: input.paidCall.receiptFromError }\n      : {}),\n  })\n  if (!paid.succeeded) throw paid.error\n\n  const recorded = input.costLedger.list().find((receipt) => receipt.callId === paid.callId)\n  if (!recorded) {\n    throw new CostAccountingIncompleteError(\n      `${input.name}: paid evaluator returned without a recorded cost receipt`,\n    )\n  }\n  if (recorded.costUnknown || recorded.usageUnknown) {\n    throw new CostAccountingIncompleteError(\n      `${input.name}: paid evaluator returned without complete cost and token usage`,\n    )\n  }\n  return paid.value\n}\n\nasync function abortableEvaluation<TResult>(\n  signal: AbortSignal,\n  execute: () => Promise<TResult> | TResult,\n): Promise<TResult> {\n  if (signal.aborted) throw signal.reason\n\n  let rejectAborted!: (reason: unknown) => void\n  const aborted = new Promise<never>((_resolve, reject) => {\n    rejectAborted = reject\n  })\n  const onAbort = (): void => rejectAborted(signal.reason)\n  signal.addEventListener('abort', onAbort, { once: true })\n  try {\n    return await Promise.race([Promise.resolve().then(execute), aborted])\n  } finally {\n    signal.removeEventListener('abort', onAbort)\n  }\n}\n","/**\n * VCS-pluggable worktree adapter. One improvement = one worktree, PR-like\n * (multiple commits allowed). A code-tier proposer's `propose()` creates a\n * worktree, an agent commits the change into it, and `finalize()` returns a\n * content-addressed `CodeSurface` the measurement verifies before running.\n * On promotion the worktree becomes the PR branch.\n *\n * The interface is VCS-agnostic so a future `jj` ([jj-vcs](https://github.com/jj-vcs/jj))\n * adapter can slot in without touching proposer code. Only the git adapter\n * ships today. See `docs/design/loop-taxonomy.md`.\n */\n\nimport { execFileSync } from 'node:child_process'\nimport { createHash } from 'node:crypto'\nimport {\n  closeSync,\n  existsSync,\n  constants as fsConstants,\n  fstatSync,\n  lstatSync,\n  mkdirSync,\n  mkdtempSync,\n  openSync,\n  readlinkSync,\n  readSync,\n  realpathSync,\n  rmSync,\n} from 'node:fs'\nimport { devNull, tmpdir } from 'node:os'\nimport { basename, dirname, isAbsolute, join, relative, resolve, sep } from 'node:path'\nimport { assertCodeSurfaceIdentity, surfaceContentHash } from '../surface-identity'\nimport type { CodeSurface } from '../types'\n\nconst MAX_GIT_OUTPUT_BYTES = 256 * 1024 * 1024\nconst FILE_HASH_CHUNK_BYTES = 1024 * 1024\n\ntype GitOutput = string | Uint8Array\ntype GitEnvironment = Readonly<Record<string, string>>\ntype GitRunner = (args: string[], cwd: string, env?: GitEnvironment) => GitOutput\n\nconst GIT_REPOSITORY_ENV = new Set([\n  'GIT_ALTERNATE_OBJECT_DIRECTORIES',\n  'GIT_COMMON_DIR',\n  'GIT_DIR',\n  'GIT_INDEX_FILE',\n  'GIT_NAMESPACE',\n  'GIT_OBJECT_DIRECTORY',\n  'GIT_PREFIX',\n  'GIT_QUARANTINE_PATH',\n  'GIT_WORK_TREE',\n])\n\nexport interface Worktree {\n  /** Absolute path to the checked-out worktree directory. */\n  readonly path: string\n  /** The branch the worktree is on (becomes the PR branch on promotion). */\n  readonly branch: string\n  /** The ref the worktree was forked from. */\n  readonly baseRef: string\n  /** Exact commit `baseRef` resolved to before the worktree was created. */\n  readonly baseCommit: string\n  /** Exact tree object for `baseCommit`. */\n  readonly baseTree: string\n}\n\nexport interface WorktreeAdapter {\n  /** Create an isolated worktree on a fresh branch off `baseRef`. */\n  create(opts: { baseRef: string; label: string }): Promise<Worktree>\n  /** Commit pending changes, freeze the exact Git objects + binary patch, and\n   *  verify the worktree still matches that identity. */\n  finalize(worktree: Worktree, summary: string): Promise<CodeSurface>\n  /** Idempotently remove the worktree and branch. Safe to retry after partial cleanup. */\n  discard(worktree: Worktree): Promise<void>\n}\n\n/** Typed failure from a `WorktreeAdapter` operation (create/finalize/discard) — wraps the underlying git error as `cause`. */\nexport class WorktreeAdapterError extends Error {\n  constructor(\n    message: string,\n    readonly cause?: unknown,\n  ) {\n    super(message)\n    this.name = 'WorktreeAdapterError'\n  }\n}\n\nexport interface GitWorktreeAdapterOptions {\n  /** Repo root the worktrees fork from. */\n  repoRoot: string\n  /** Directory worktrees are created under. Default: `<repoRoot>/.worktrees`. */\n  worktreeDir?: string\n  /** Branch-name prefix. Default: `improve`. */\n  branchPrefix?: string\n  /** Test seam — defaults to a real `git` runner. The return value must contain\n   *  stdout verbatim, and runners that execute Git must forward the optional\n   *  environment overrides used to isolate patch generation. */\n  git?: GitRunner\n}\n\nfunction defaultGit(args: string[], cwd: string, overrides?: GitEnvironment): Uint8Array {\n  try {\n    const env = { ...process.env }\n    for (const key of Object.keys(env)) {\n      if (\n        GIT_REPOSITORY_ENV.has(key) ||\n        key === 'GIT_CONFIG' ||\n        key.startsWith('GIT_CONFIG_') ||\n        key.startsWith('GIT_ATTR_') ||\n        key === 'GIT_DIFF_OPTS' ||\n        key === 'GIT_EXTERNAL_DIFF'\n      ) {\n        delete env[key]\n      }\n    }\n    Object.assign(env, overrides)\n    env.GIT_NO_REPLACE_OBJECTS = '1'\n    env.LC_ALL = 'C'\n    env.LANG = 'C'\n    return execFileSync('git', args, { cwd, env, maxBuffer: MAX_GIT_OUTPUT_BYTES })\n  } catch (err) {\n    const stderr =\n      err && typeof err === 'object' && 'stderr' in err\n        ? String((err as { stderr: unknown }).stderr)\n        : ''\n    throw new WorktreeAdapterError(`git ${args.join(' ')} failed: ${stderr || String(err)}`, err)\n  }\n}\n\nfunction gitBytes(git: GitRunner, args: string[], cwd: string, env?: GitEnvironment): Buffer {\n  try {\n    const output = git(args, cwd, env)\n    return typeof output === 'string' ? Buffer.from(output, 'utf8') : Buffer.from(output)\n  } catch (err) {\n    if (err instanceof WorktreeAdapterError) throw err\n    throw new WorktreeAdapterError(`git ${args.join(' ')} failed: ${String(err)}`, err)\n  }\n}\n\nfunction gitText(git: GitRunner, args: string[], cwd: string, env?: GitEnvironment): string {\n  return gitBytes(git, args, cwd, env).toString('utf8').trim()\n}\n\nfunction hasRegisteredWorktree(git: GitRunner, repoRoot: string, path: string): boolean {\n  const expected = Buffer.from(`worktree ${resolve(path)}`, 'utf8')\n  const records = gitBytes(git, ['worktree', 'list', '--porcelain', '-z'], repoRoot)\n  let start = 0\n  while (start < records.length) {\n    const end = records.indexOf(0, start)\n    if (end < 0) {\n      throw new WorktreeAdapterError('Git worktree list output was not NUL-terminated')\n    }\n    if (records.subarray(start, end).equals(expected)) return true\n    start = end + 1\n  }\n  return false\n}\n\nfunction hasLocalBranch(git: GitRunner, repoRoot: string, branch: string): boolean {\n  const ref = `refs/heads/${branch}`\n  return gitText(git, ['for-each-ref', '--format=%(refname)', '--', ref], repoRoot)\n    .split('\\n')\n    .some((candidate) => candidate === ref)\n}\n\nfunction reconcileAbsent(exists: () => boolean, remove: () => void): unknown | undefined {\n  try {\n    if (!exists()) return undefined\n  } catch (err) {\n    return err\n  }\n\n  try {\n    remove()\n    return undefined\n  } catch (removeError) {\n    try {\n      // Git may complete the mutation before the caller observes a failure, or\n      // another cleanup may win the race. The desired end state is what matters.\n      if (!exists()) return undefined\n    } catch (recheckError) {\n      return new AggregateError(\n        [removeError, recheckError],\n        'Removal failed and the resulting resource state could not be checked',\n      )\n    }\n    return removeError\n  }\n}\n\nfunction sha256(bytes: Uint8Array): `sha256:${string}` {\n  return `sha256:${createHash('sha256').update(bytes).digest('hex')}`\n}\n\nconst PATCH_ARGS = [\n  // Git binary patches embed a zlib stream. Pin no-compression at command\n  // scope so repository/global config and compressor heuristics cannot change\n  // the candidate identity for the same base and final tree.\n  '-c',\n  'core.compression=0',\n  '-c',\n  `core.attributesFile=${devNull}`,\n  '-c',\n  'core.quotePath=true',\n  '-c',\n  'diff.suppressBlankEmpty=false',\n  'diff',\n  '--unified=3',\n  '--inter-hunk-context=0',\n  `-O${devNull}`,\n  '--binary',\n  '--full-index',\n  '--no-color',\n  '--no-ext-diff',\n  '--no-textconv',\n  '--no-renames',\n  '--diff-algorithm=myers',\n  '--no-indent-heuristic',\n  '--src-prefix=a/',\n  '--dst-prefix=b/',\n] as const\n\nconst CANONICAL_GIT_ENV: GitEnvironment = {\n  GIT_ATTR_GLOBAL: devNull,\n  GIT_ATTR_NOSYSTEM: '1',\n  GIT_CONFIG_GLOBAL: devNull,\n  GIT_CONFIG_NOSYSTEM: '1',\n  GIT_CONFIG_SYSTEM: devNull,\n}\n\n/** Render the transport patch from immutable objects through fresh Git metadata.\n *  Source-repository config, info attributes, templates, and caller environment\n *  therefore cannot alter bytes for the same two trees. */\nfunction patchBytes(\n  git: GitRunner,\n  cwd: string,\n  baseCommit: string,\n  candidateCommit: string,\n): Buffer {\n  const scratch = mkdtempSync(join(tmpdir(), 'agent-eval-patch-'))\n  const bareRepo = join(scratch, 'repo.git')\n  const emptyTemplate = join(scratch, 'empty-template')\n  mkdirSync(emptyTemplate)\n  try {\n    const objectFormat = gitObjectHashAlgorithm(candidateCommit)\n    const sourceObjects = realpathSync(gitText(git, ['rev-parse', '--git-path', 'objects'], cwd))\n    gitText(\n      git,\n      [\n        'init',\n        '--bare',\n        '--quiet',\n        ...(objectFormat === 'sha256' ? ['--object-format=sha256'] : []),\n        `--template=${emptyTemplate}`,\n        bareRepo,\n      ],\n      scratch,\n      CANONICAL_GIT_ENV,\n    )\n    return gitBytes(\n      git,\n      [`--git-dir=${bareRepo}`, ...PATCH_ARGS, baseCommit, candidateCommit, '--'],\n      scratch,\n      {\n        ...CANONICAL_GIT_ENV,\n        GIT_ALTERNATE_OBJECT_DIRECTORIES: sourceObjects,\n      },\n    )\n  } finally {\n    rmSync(scratch, { recursive: true, force: true })\n  }\n}\n\nfunction resolveCommit(git: GitRunner, cwd: string, ref: string): string {\n  return gitText(git, ['rev-parse', '--verify', `${ref}^{commit}`], cwd)\n}\n\nfunction unresolvedWorktreePath(surface: CodeSurface, worktreeDir?: string): string {\n  if (isAbsolute(surface.worktreeRef)) return surface.worktreeRef\n  if (worktreeDir) return join(worktreeDir, basename(surface.worktreeRef))\n  return surface.worktreeRef\n}\n\ninterface GitTreeEntry {\n  mode: string\n  objectId: string\n  path: string\n}\n\nfunction displayGitPath(path: string): string {\n  return JSON.stringify(path)\n}\n\nfunction parseGitTreeEntries(bytes: Uint8Array): GitTreeEntry[] {\n  const input = Buffer.from(bytes)\n  const entries: GitTreeEntry[] = []\n  let start = 0\n  while (start < input.length) {\n    const end = input.indexOf(0, start)\n    if (end < 0) throw new WorktreeAdapterError('Git tree output was not NUL-terminated')\n    const record = input.subarray(start, end)\n    start = end + 1\n    if (record.length === 0) continue\n\n    const tab = record.indexOf(0x09)\n    if (tab < 0) throw new WorktreeAdapterError('Git tree entry did not contain a path')\n    const metadata = record.subarray(0, tab).toString('ascii').split(' ')\n    if (metadata.length !== 3) throw new WorktreeAdapterError('Git tree entry was malformed')\n    const mode = metadata[0]\n    const type = metadata[1]\n    const objectId = metadata[2]\n    if (!mode || !type || !objectId) {\n      throw new WorktreeAdapterError('Git tree entry was malformed')\n    }\n    const pathBytes = record.subarray(tab + 1)\n    const path = pathBytes.toString('utf8')\n    if (!Buffer.from(path, 'utf8').equals(pathBytes)) {\n      throw new WorktreeAdapterError('CodeSurface paths must be valid UTF-8')\n    }\n    if (type !== 'blob' && type !== 'commit') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains unsupported Git object type ${type} at ${displayGitPath(path)}`,\n      )\n    }\n    entries.push({ mode, objectId, path })\n  }\n  return entries\n}\n\nfunction parseGitPathList(bytes: Uint8Array): string[] {\n  const input = Buffer.from(bytes)\n  const paths: string[] = []\n  let start = 0\n  while (start < input.length) {\n    const end = input.indexOf(0, start)\n    if (end < 0) throw new WorktreeAdapterError('Git path output was not NUL-terminated')\n    const pathBytes = input.subarray(start, end)\n    start = end + 1\n    if (pathBytes.length === 0) continue\n    const path = pathBytes.toString('utf8')\n    if (!Buffer.from(path, 'utf8').equals(pathBytes)) {\n      throw new WorktreeAdapterError('CodeSurface paths must be valid UTF-8')\n    }\n    paths.push(path)\n  }\n  return paths\n}\n\nfunction isWithinRoot(root: string, candidate: string): boolean {\n  const rel = relative(root, candidate)\n  return rel === '' || (!isAbsolute(rel) && rel !== '..' && !rel.startsWith(`..${sep}`))\n}\n\nfunction assertSafeRelativePath(root: string, path: string): string {\n  if (path.length === 0 || isAbsolute(path)) {\n    throw new WorktreeAdapterError(`CodeSurface contains unsafe path ${displayGitPath(path)}`)\n  }\n  const absolutePath = resolve(root, path)\n  if (!isWithinRoot(root, absolutePath) || absolutePath === root) {\n    throw new WorktreeAdapterError(`CodeSurface path escapes its worktree: ${displayGitPath(path)}`)\n  }\n\n  const segments = path.split(/[\\\\/]/u)\n  let parent = root\n  for (const segment of segments.slice(0, -1)) {\n    if (segment.length === 0 || segment === '.' || segment === '..') {\n      throw new WorktreeAdapterError(`CodeSurface contains unsafe path ${displayGitPath(path)}`)\n    }\n    parent = join(parent, segment)\n    const stat = lstatSync(parent)\n    if (!stat.isDirectory() || stat.isSymbolicLink()) {\n      throw new WorktreeAdapterError(\n        `CodeSurface path traverses a non-directory or symbolic link: ${displayGitPath(path)}`,\n      )\n    }\n  }\n  return absolutePath\n}\n\nfunction gitObjectHashAlgorithm(objectId: string): 'sha1' | 'sha256' {\n  if (/^[a-f0-9]{40}$/.test(objectId)) return 'sha1'\n  if (/^[a-f0-9]{64}$/.test(objectId)) return 'sha256'\n  throw new WorktreeAdapterError(`Unsupported Git object id: ${objectId}`)\n}\n\nfunction hashGitBlobBytes(bytes: Uint8Array, objectId: string): string {\n  const hash = createHash(gitObjectHashAlgorithm(objectId))\n  hash.update(`blob ${bytes.byteLength}\\0`)\n  hash.update(bytes)\n  return hash.digest('hex')\n}\n\nfunction hashGitBlobFile(path: string, objectId: string): { hash: string; executable: boolean } {\n  const before = lstatSync(path)\n  if (!before.isFile() || before.isSymbolicLink()) {\n    throw new WorktreeAdapterError(`CodeSurface expected a regular file at ${displayGitPath(path)}`)\n  }\n\n  const noFollow = process.platform === 'win32' ? 0 : fsConstants.O_NOFOLLOW\n  const fd = openSync(path, fsConstants.O_RDONLY | noFollow)\n  try {\n    const opened = fstatSync(fd)\n    if (\n      !opened.isFile() ||\n      opened.dev !== before.dev ||\n      opened.ino !== before.ino ||\n      opened.size !== before.size\n    ) {\n      throw new WorktreeAdapterError(\n        `CodeSurface file changed while it was being verified: ${displayGitPath(path)}`,\n      )\n    }\n\n    const hash = createHash(gitObjectHashAlgorithm(objectId))\n    hash.update(`blob ${opened.size}\\0`)\n    const chunk = Buffer.allocUnsafe(FILE_HASH_CHUNK_BYTES)\n    let total = 0\n    while (true) {\n      const count = readSync(fd, chunk, 0, chunk.length, null)\n      if (count === 0) break\n      total += count\n      hash.update(chunk.subarray(0, count))\n    }\n    if (total !== opened.size) {\n      throw new WorktreeAdapterError(\n        `CodeSurface file changed while it was being verified: ${displayGitPath(path)}`,\n      )\n    }\n    return { hash: hash.digest('hex'), executable: (opened.mode & 0o111) !== 0 }\n  } finally {\n    closeSync(fd)\n  }\n}\n\nfunction assertSymlinkTargetIsBound(\n  root: string,\n  linkPath: string,\n  trackedPaths: ReadonlySet<string>,\n): void {\n  const targetBytes = readlinkSync(linkPath, { encoding: 'buffer' })\n  const target = targetBytes.toString('utf8')\n  if (!Buffer.from(target, 'utf8').equals(targetBytes)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link has an unsafe target at ${displayGitPath(linkPath)}`,\n    )\n  }\n  if (isAbsolute(target)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n  const lexicalTarget = resolve(dirname(linkPath), target)\n  if (!isWithinRoot(root, lexicalTarget)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n  let resolvedTarget: string\n  try {\n    resolvedTarget = realpathSync(linkPath)\n  } catch (err) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link target is missing or cyclic at ${displayGitPath(linkPath)}`,\n      err,\n    )\n  }\n  if (!isWithinRoot(root, resolvedTarget)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n\n  const targetRelative = relative(root, resolvedTarget).split(sep).join('/')\n  const targetIsTracked =\n    trackedPaths.has(targetRelative) ||\n    [...trackedPaths].some((trackedPath) => trackedPath.startsWith(`${targetRelative}/`))\n  if (!targetIsTracked) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link resolves to untracked content at ${displayGitPath(linkPath)}`,\n    )\n  }\n}\n\nfunction assertRawTreeMatchesWorktree(git: GitRunner, root: string, candidateCommit: string): void {\n  const entries = parseGitTreeEntries(\n    gitBytes(git, ['ls-tree', '-r', '-z', '--full-tree', candidateCommit], root),\n  )\n  const trackedPaths = new Set(entries.map((entry) => entry.path))\n\n  for (const entry of entries) {\n    const absolutePath = assertSafeRelativePath(root, entry.path)\n    if (entry.mode === '160000' || entry.mode === '040000') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains a Git submodule whose executable bytes are not bound: ${displayGitPath(entry.path)}`,\n      )\n    }\n    if (entry.mode === '120000') {\n      const stat = lstatSync(absolutePath)\n      if (!stat.isSymbolicLink()) {\n        throw new WorktreeAdapterError(\n          `CodeSurface expected a symbolic link at ${displayGitPath(entry.path)}`,\n        )\n      }\n      const targetBytes = readlinkSync(absolutePath, { encoding: 'buffer' })\n      const actualObjectId = hashGitBlobBytes(targetBytes, entry.objectId)\n      if (actualObjectId !== entry.objectId) {\n        throw new WorktreeAdapterError(\n          `CodeSurface raw symbolic-link bytes differ from the candidate tree at ${displayGitPath(entry.path)}`,\n        )\n      }\n      assertSymlinkTargetIsBound(root, absolutePath, trackedPaths)\n      continue\n    }\n    if (entry.mode !== '100644' && entry.mode !== '100755') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains unsupported Git mode ${entry.mode} at ${displayGitPath(entry.path)}`,\n      )\n    }\n\n    const actual = hashGitBlobFile(absolutePath, entry.objectId)\n    if (actual.hash !== entry.objectId) {\n      throw new WorktreeAdapterError(\n        `CodeSurface raw tracked bytes differ from the candidate tree because the worktree changed after finalization at ${displayGitPath(entry.path)}`,\n      )\n    }\n    if (process.platform !== 'win32' && actual.executable !== (entry.mode === '100755')) {\n      throw new WorktreeAdapterError(\n        `CodeSurface executable mode differs from the candidate tree at ${displayGitPath(entry.path)}`,\n      )\n    }\n  }\n}\n\nexport interface CodeSurfaceVerification {\n  /** Verified worktree path. */\n  path: string\n  /** Git's canonical root for the verified checkout. */\n  repoRoot: string\n  /** Recomputed full content identity. */\n  contentHash: `sha256:${string}`\n  /** Exact verified binary-patch bytes. Candidate-bundle builders encode this\n   *  directly instead of reproducing Git diff options. */\n  patchBytes: Uint8Array\n}\n\nfunction verifyCodeSurfaceWithGit(\n  surface: CodeSurface,\n  path: string,\n  git: GitRunner,\n): CodeSurfaceVerification {\n  assertCodeSurfaceIdentity(surface)\n  if (!existsSync(path)) {\n    throw new WorktreeAdapterError(`CodeSurface worktree does not exist: ${path}`)\n  }\n  const lexicalRoot = resolve(path)\n  const canonicalRoot = realpathSync(path)\n  if (\n    lstatSync(lexicalRoot).isSymbolicLink() ||\n    (process.platform !== 'win32' && lexicalRoot !== canonicalRoot)\n  ) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree locator must not contain a symbolic link: ${path}`,\n    )\n  }\n  const repoRoot = gitText(git, ['rev-parse', '--show-toplevel'], path)\n  const canonicalRepoRoot = realpathSync(repoRoot)\n  if (canonicalRepoRoot !== canonicalRoot) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree locator is not the repository root: expected ${repoRoot}, got ${path}`,\n    )\n  }\n\n  const indexFlags = gitText(git, ['ls-files', '-v'], path)\n    .split('\\n')\n    .filter((line) => line.length > 0 && (line.startsWith('S ') || /^[a-z]/.test(line)))\n  if (indexFlags.length > 0) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree uses hidden index entries that cannot be verified: ${path}\\n${indexFlags.join('\\n')}`,\n    )\n  }\n\n  const extraPaths = [\n    ...parseGitPathList(gitBytes(git, ['ls-files', '--others', '--exclude-standard', '-z'], path)),\n    ...parseGitPathList(\n      gitBytes(git, ['ls-files', '--others', '--ignored', '--exclude-standard', '-z'], path),\n    ),\n  ]\n  if (extraPaths.length > 0) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree changed after finalization: ${path}\\n${extraPaths.join('\\n')}`,\n    )\n  }\n\n  const candidateCommit = resolveCommit(git, path, 'HEAD')\n  if (candidateCommit !== surface.candidateCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface candidate commit mismatch: expected ${surface.candidateCommit}, got ${candidateCommit}`,\n    )\n  }\n\n  const baseCommit = resolveCommit(git, path, surface.baseCommit)\n  if (baseCommit !== surface.baseCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface base commit mismatch: expected ${surface.baseCommit}, got ${baseCommit}`,\n    )\n  }\n\n  const baseTree = gitText(git, ['rev-parse', '--verify', `${surface.baseCommit}^{tree}`], path)\n  if (baseTree !== surface.baseTree) {\n    throw new WorktreeAdapterError(\n      `CodeSurface base tree mismatch: expected ${surface.baseTree}, got ${baseTree}`,\n    )\n  }\n\n  const candidateTree = gitText(\n    git,\n    ['rev-parse', '--verify', `${surface.candidateCommit}^{tree}`],\n    path,\n  )\n  if (candidateTree !== surface.candidateTree) {\n    throw new WorktreeAdapterError(\n      `CodeSurface tree mismatch: expected ${surface.candidateTree}, got ${candidateTree}`,\n    )\n  }\n\n  try {\n    gitText(\n      git,\n      [\n        'diff-index',\n        '--cached',\n        '--quiet',\n        '--no-ext-diff',\n        '--no-textconv',\n        surface.candidateCommit,\n        '--',\n      ],\n      path,\n    )\n  } catch (err) {\n    throw new WorktreeAdapterError(\n      `CodeSurface index differs from finalized candidate: ${path}`,\n      err,\n    )\n  }\n\n  try {\n    assertRawTreeMatchesWorktree(git, canonicalRepoRoot, surface.candidateCommit)\n  } catch (err) {\n    if (err instanceof WorktreeAdapterError) throw err\n    throw new WorktreeAdapterError(`CodeSurface raw tree verification failed: ${path}`, err)\n  }\n\n  const mergeBase = gitText(git, ['merge-base', surface.baseCommit, surface.candidateCommit], path)\n  if (mergeBase !== surface.baseCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface candidate ${surface.candidateCommit} does not descend from base ${surface.baseCommit}`,\n    )\n  }\n\n  const patch = patchBytes(git, path, surface.baseCommit, surface.candidateCommit)\n  const actualPatchHash = sha256(patch)\n  if (actualPatchHash !== surface.patch.sha256 || patch.byteLength !== surface.patch.byteLength) {\n    throw new WorktreeAdapterError(\n      `CodeSurface patch mismatch: expected ${surface.patch.sha256}/${surface.patch.byteLength} bytes, got ${actualPatchHash}/${patch.byteLength} bytes`,\n    )\n  }\n\n  return {\n    path,\n    repoRoot: canonicalRepoRoot,\n    contentHash: surfaceContentHash(surface),\n    patchBytes: new Uint8Array(patch),\n  }\n}\n\n/** Slugify a label into a branch-safe segment. */\nfunction slug(label: string): string {\n  return (\n    label\n      .toLowerCase()\n      .replace(/[^a-z0-9]+/g, '-')\n      .replace(/^-+|-+$/g, '')\n      .slice(0, 48) || 'candidate'\n  )\n}\n\n/**\n * Git-backed `WorktreeAdapter`: creates isolated worktrees on fresh branches, commits agent changes, and discards losers.\n */\nexport function gitWorktreeAdapter(opts: GitWorktreeAdapterOptions): WorktreeAdapter {\n  const git = opts.git ?? defaultGit\n  const worktreeDir = opts.worktreeDir ?? join(opts.repoRoot, '.worktrees')\n  const branchPrefix = opts.branchPrefix ?? 'improve'\n\n  return {\n    async create({ baseRef, label }) {\n      const id = `${slug(label)}-${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 6)}`\n      const branch = `${branchPrefix}/${id}`\n      const path = join(worktreeDir, id)\n      const baseCommit = resolveCommit(git, opts.repoRoot, baseRef)\n      const baseTree = gitText(\n        git,\n        ['rev-parse', '--verify', `${baseCommit}^{tree}`],\n        opts.repoRoot,\n      )\n      gitText(git, ['worktree', 'add', '-b', branch, path, baseCommit], opts.repoRoot)\n      return {\n        path: realpathSync(resolve(opts.repoRoot, path)),\n        branch,\n        baseRef,\n        baseCommit,\n        baseTree,\n      }\n    },\n\n    async finalize(worktree, summary) {\n      // Stage + commit any pending changes the agent left in the worktree.\n      // A no-op commit is refused by git, so only commit when the tree is dirty.\n      const status = gitText(\n        git,\n        ['status', '--porcelain=v1', '--untracked-files=all'],\n        worktree.path,\n      )\n      if (status.length > 0) {\n        gitText(git, ['add', '-A'], worktree.path)\n        gitText(git, ['commit', '-m', summary], worktree.path)\n      }\n      const candidateCommit = resolveCommit(git, worktree.path, 'HEAD')\n      const candidateTree = gitText(\n        git,\n        ['rev-parse', '--verify', `${candidateCommit}^{tree}`],\n        worktree.path,\n      )\n      const patch = patchBytes(git, worktree.path, worktree.baseCommit, candidateCommit)\n      const surface: CodeSurface = {\n        kind: 'code',\n        worktreeRef: worktree.path,\n        baseRef: worktree.baseRef,\n        baseCommit: worktree.baseCommit,\n        baseTree: worktree.baseTree,\n        candidateCommit,\n        candidateTree,\n        patch: {\n          format: 'git-diff-binary',\n          sha256: sha256(patch),\n          byteLength: patch.byteLength,\n        },\n        summary,\n      }\n      verifyCodeSurfaceWithGit(surface, worktree.path, git)\n      return surface\n    },\n\n    async discard(worktree) {\n      // Reconcile both resources independently so a retry can finish cleanup\n      // after either command succeeded alone. Force-remove because the worktree\n      // may hold uncommitted experiment state we're discarding.\n      const failures = [\n        reconcileAbsent(\n          () => hasRegisteredWorktree(git, opts.repoRoot, worktree.path),\n          () => gitText(git, ['worktree', 'remove', '--force', '--', worktree.path], opts.repoRoot),\n        ),\n        reconcileAbsent(\n          () => hasLocalBranch(git, opts.repoRoot, worktree.branch),\n          () => gitText(git, ['branch', '-D', '--', worktree.branch], opts.repoRoot),\n        ),\n      ].filter((failure) => failure !== undefined)\n\n      if (failures.length > 0) {\n        const cause =\n          failures.length === 1\n            ? failures[0]\n            : new AggregateError(failures, 'Multiple Git resources could not be removed')\n        throw new WorktreeAdapterError(\n          `Failed to discard worktree ${worktree.path} and branch ${worktree.branch}`,\n          cause,\n        )\n      }\n    },\n  }\n}\n\n/** Verify a finalized code surface against its current checkout. This rejects\n *  dirty/ignored files, moved refs, missing Git objects, raw byte/mode\n *  mismatches, external symlinks, and submodules. */\nexport function verifyCodeSurface(\n  surface: CodeSurface,\n  worktreeDir?: string,\n): CodeSurfaceVerification {\n  const path = unresolvedWorktreePath(surface, worktreeDir)\n  return verifyCodeSurfaceWithGit(surface, path, defaultGit)\n}\n\n/** Resolve a code candidate for evaluation only after verifying its immutable\n *  identity against the checkout at `worktreeRef`. */\nexport function resolveWorktreePath(surface: CodeSurface, worktreeDir?: string): string {\n  return verifyCodeSurface(surface, worktreeDir).path\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAkCA,SAAgB,iCACd,SAKiC;CACjC,OAAO,OAAO,SAAS,UAAU,YAAY;EAC3C,IAAI,OAAO,YAAY,UACrB,MAAM,IAAI,UACR,uEAAuE,QAAQ,MACjF;EAEF,OAAO,QAAQ,QAAQ;GACrB,cAAc;GACd,YAAY,SAAS;GACrB,OAAO,GAAG,QAAQ,OAAO,GAAG,SAAS;GACrC,QAAQ,QAAQ;EAClB,CAAC;CACH;AACF;AAEA,SAAgB,2BAGd;CACA,OAAO;EACL,MAAM;EACN,cAAc;EACd,YAAY;GACV;IAAE,KAAK;IAAgB,aAAa;GAAgC;GACpE;IAAE,KAAK;IAAqB,aAAa;GAA4C;GACrF;IAAE,KAAK;IAAM,aAAa;GAAsD;GAChF;IAAE,KAAK;IAA0B,aAAa;GAAsC;GACpF;IAAE,KAAK;IAAqB,aAAa;GAA4C;GACrF;IACE,KAAK;IACL,aAAa;GACf;GACA;IAAE,KAAK;IAAS,aAAa;GAA2C;EAC1E;EACA,YAAY,aACV,SAAS,SAAS,mBAAmB,SAAS,eAAe;EAC/D,MAAM,EAAE,UAAU,YAAY;GAC5B,uBAAuB,QAAQ;GAS/B,OAAO,uBARO,qBACZ;IACE,IAAI,SAAS;IACb,gBAAgB,SAAS;IACzB,iBAAiB,SAAS;GAC5B,GACA,SAAS,QAEuB,CAAC;EACrC;CACF;AACF;AAEA,SAAS,uBAAuB,UAAsC;CACpE,IAAI,SAAS,eAAe,aAC1B,MAAM,IAAI,UAAU,2BAA2B,SAAS,GAAG,wBAAwB;CAErF,IAAI,SAAS,eAAe,cAAc,SAAS,eAAe,WAAW,GAC3E,MAAM,IAAI,UAAU,oCAAoC,SAAS,GAAG,2BAA2B;CAEjG,IAAI,SAAS,eAAe,sBAAsB,SAAS,eAAe,SAAS,GACjF,MAAM,IAAI,UACR,4CAA4C,SAAS,GAAG,iCAC1D;AAEJ;AAEA,SAAS,uBAAuB,OAA4B;CAC1D,MAAM,aAAqC;EACzC,cAAc,MAAM;EACpB,mBAAmB,MAAM;EACzB,IAAI,MAAM;EACV,OAAO,MAAM,6BAA6B,IAAI;CAChD;CACA,IAAI,MAAM,yBAAyB,MACjC,WAAW,yBAAyB,MAAM;CAE5C,IAAI,MAAM,qBAAqB,MAAM,WAAW,oBAAoB,MAAM;CAC1E,IAAI,MAAM,2BAA2B,MACnC,WAAW,2BAA2B,MAAM;CAE9C,MAAM,QAAQ;EACZ,GAAG,MAAM,gBAAgB,OAAO,GAAG,MAAM,mBAAmB;EAC5D,GAAG,MAAM,wBAAwB,OAAO,GAAG,MAAM,wBAAwB,SAAS,MAAM,0BAA0B,OAAO;EACzH,GAAG,MAAM,kBAAkB,OAAO;CACpC,CAAC,CAAC,KAAK,IAAI;CAGX,OAAO;EAAE;EAAY,WADnB,MAAM,yBAAyB,OAAO,MAAM,MAAM,MAAM,KAAK,MAAM,wBAAwB;EAC7D;CAAM;AACxC;;;AC1GA,SAAgB,0BACd,OACmC;CACnC,qBAAqB,MAAM,WAAW,WAAW;CACjD,qBAAqB,MAAM,gBAAgB,gBAAgB;CAC3D,IAAI,MAAM,eAAe,SAAS,GAChC,MAAM,IAAI,gBACR,oFACF;CAEF,qBAAqB,MAAM,gBAAgB,gBAAgB;CAC3D,qBAAqB,MAAM,iBAAiB,iBAAiB;CAC7D,IAAI,MAAM,gBAAgB,SAAS,OAAO,GACxC,MAAM,IAAI,gBACR,yFACF;CAEF,kBAAkB,KAAK;CACvB,kBAAkB,KAAK;CAEvB,MAAM,gBAAgB,YACpB,MAAM,aACL,cAAc,UAAU,aACzB,WACF;CACA,eAAe,MAAM,gBAAgB,cAAc,KAAK,GAAG,kBAAkB,YAAY;CACzF,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,aAAa,cAAc,OAAO,GAAG;EAC9C,eAAe,UAAU,aAAa,aAAa;EACnD,eAAe,UAAU,WAAW,4BAA4B,UAAU,YAAY,EAAE;EACxF,IAAI,SAAS,IAAI,UAAU,SAAS,GAClC,MAAM,IAAI,gBACR,+CAA+C,UAAU,UAAU,8GAErE;EAEF,SAAS,IAAI,UAAU,SAAS;EAChC,IAAI,OAAO,UAAU,uBAAuB,WAC1C,MAAM,IAAI,gBACR,+CAA+C,UAAU,YAAY,kCACvE;CAEJ;CAEA,MAAM,iBAAiB,IAAI,IAAI,MAAM,eAAe,KAAK,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;CACnF,MAAM,gBAAgB,YACpB,MAAM,aACL,cAAc,UAAU,aACzB,WACF;CACA,eAAe,MAAM,gBAAgB,cAAc,KAAK,GAAG,kBAAkB,YAAY;CACzF,IAAI,CAAC,cAAc,IAAI,MAAM,mBAAmB,GAC9C,MAAM,IAAI,gBACR,iEAAiE,MAAM,oBAAoB,EAC7F;CAGF,MAAM,wCAAwB,IAAI,IAAmC;CACrE,MAAM,oCAAoB,IAAI,IAAmC;CACjE,KAAK,MAAM,aAAa,cAAc,OAAO,GAAG;EAC9C,kBAAkB,WAAW,eAAe,gBAAgB,MAAM,mBAAmB;EACrF,MAAM,MAAM,4BAA4B,UAAU,YAAY;EAC9D,MAAM,YAAY,sBAAsB,IAAI,GAAG;EAC/C,IAAI,WACF,MAAM,IAAI,gBACR,gDAAgD,UAAU,YAAY,SAChE,UAAU,YAAY,qCAC9B;EAEF,sBAAsB,IAAI,KAAK,SAAS;EACxC,IAAI,UAAU,aAAa,WAAW,GACpC,kBAAkB,IAAI,UAAU,aAAa,IAAK,SAAS;CAE/D;CACA,MAAM,WAAW,cAAc,IAAI,MAAM,mBAAmB;CAC5D,IAAI,SAAS,aAAa,WAAW,GACnC,MAAM,IAAI,gBACR,8CAA8C,SAAS,YAAY,4BACrE;CAEF,KAAK,MAAM,eAAe,MAAM,gBAC9B,IAAI,CAAC,kBAAkB,IAAI,WAAW,GACpC,MAAM,IAAI,gBACR,+EAA+E,YAAY,EAC7F;CAGJ,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,eAAe,QAAQ,QACrD,KAAK,IAAI,QAAQ,OAAO,GAAG,QAAQ,MAAM,eAAe,QAAQ,SAAS;EACvE,MAAM,MAAM,CAAC,MAAM,eAAe,OAAQ,MAAM,eAAe,MAAO;EACtE,IAAI,CAAC,sBAAsB,IAAI,4BAA4B,GAAG,CAAC,GAC7D,MAAM,IAAI,gBACR,2EAA2E,IAAI,KAAK,IAAI,EAAE,EAC5F;CAEJ;CAGF,MAAM,kCAAkB,IAAI,IAA+B;CAC3D,MAAM,UAAU,IAAI,IAAI,MAAM,SAAS;CACvC,KAAK,MAAM,OAAO,MAAM,MAAM;EAC5B,MAAM,YAAY,cAAc,IAAI,IAAI,WAAW;EACnD,IAAI,CAAC,WACH,MAAM,IAAI,gBACR,kDAAkD,IAAI,OAAO,6BAA6B,IAAI,YAAY,EAC5G;EAEF,IAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,GACzB,MAAM,IAAI,gBACR,uDAAuD,IAAI,YAAY,gBAAgB,IAAI,OAAO,iCAEpG;EAEF,YAAY,OAAO,KAAK,SAAS;EACjC,MAAM,SAAS,gBAAgB,IAAI,IAAI,WAAW,qBAAK,IAAI,IAAkB;EAC7E,IAAI,OAAO,IAAI,IAAI,MAAM,GACvB,MAAM,IAAI,gBACR,iEAAiE,IAAI,YAAY,cAAc,IAAI,OAAO,EAC5G;EAEF,OAAO,IAAI,IAAI,QAAQ,GAAG;EAC1B,gBAAgB,IAAI,IAAI,aAAa,MAAM;CAC7C;CACA,KAAK,MAAM,eAAe,MAAM,gBAAgB;EAC9C,MAAM,SAAS,gBAAgB,IAAI,WAAW;EAC9C,MAAM,UAAU,MAAM,UAAU,QAAQ,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;EACvE,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,gBACR,+CAA+C,YAAY,qCACrD,QAAQ,KAAK,IAAI,EAAE,uEAC3B;CAEJ;CACA,MAAM,eAAe,MAAM,eAAe,SAAS,MAAM,UAAU;CACnE,IAAI,MAAM,KAAK,WAAW,cACxB,MAAM,IAAI,gBACR,qDAAqD,aAAa,8BAA8B,MAAM,KAAK,QAC7G;CAGF,OAAO;EACL;EACA,YAAY,MAAM,eAAe,KAAK,OAAO,cAAc,IAAI,EAAE,CAAE;EACnE,YAAY,MAAM,eAAe,KAAK,OAAO,cAAc,IAAI,EAAE,CAAE;EACnE;EACA;EACA;EACA;EACA;EACA;EACA,gBAAgB,IAAI,IAAI,MAAM,eAAe,KAAK,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;CAC9E;AACF;AAEA,SAAgB,oBACd,SACA,aACQ;CACR,OAAO,QAAQ,MAAM,UAAU,KAAK,WAAW,mBAAmB,SAAS,aAAa,MAAM,CAAC;AACjG;AAEA,SAAgB,mBACd,SACA,aACA,QACM;CACN,OAAO,QAAQ,gBAAgB,IAAI,WAAW,CAAC,CAAE,IAAI,MAAM;AAC7D;AAEA,SAAgB,gCACd,SACA,cACU;CACV,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC,MACtB,MAAM,UAAU,QAAQ,eAAe,IAAI,IAAI,IAAK,QAAQ,eAAe,IAAI,KAAK,CACvF;AACF;AAEA,SAAgB,4BAA4B,cAAyC;CACnF,OAAO,KAAK,UAAU,YAAY;AACpC;AAEA,SAAS,kBACP,OACM;CACN,MAAM,EAAE,MAAM,WAAW,eAAe,MAAM;CAC9C,IAAI,CAAC,OAAO,UAAU,IAAI,GACxB,MAAM,IAAI,gBAAgB,oEAAoE;CAEhG,IAAI,CAAC,OAAO,UAAU,SAAS,KAAK,aAAa,GAC/C,MAAM,IAAI,gBACR,iFACF;CAEF,IAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,KAAK,cAAc,GACnE,MAAM,IAAI,gBACR,wEACF;AAEJ;AAEA,SAAS,kBACP,OACM;CACN,MAAM,SAAS,MAAM;CACrB,KAAK,MAAM,CAAC,MAAM,UAAU,CAC1B,CAAC,sBAAsB,OAAO,kBAAkB,GAChD,CAAC,sBAAsB,OAAO,kBAAkB,CAClD,GACE,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,MAAM,UAAU,QACnE,MAAM,IAAI,gBACR,8CAA8C,KAAK,4BAA4B,MAAM,UAAU,OAAO,EACxG;CAGJ,IACE,CAAC,OAAO,UAAU,OAAO,uBAAuB,KAChD,OAAO,0BAA0B,KACjC,OAAO,0BAA0B,MAAM,eAAe,QAEtD,MAAM,IAAI,gBACR,+FACQ,MAAM,eAAe,OAAO,EACtC;CAEF,KAAK,MAAM,CAAC,QAAQ,UAAU,OAAO,QAAQ,OAAO,gCAAgC,GAAG;EACrF,IAAI,CAAC,MAAM,gBAAgB,SAAS,MAAM,GACxC,MAAM,IAAI,gBACR,wEAAwE,OAAO,EACjF;EAEF,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GACtC,MAAM,IAAI,gBACR,0DAA0D,OAAO,8BACnE;CAEJ;AACF;AAEA,SAAS,kBACP,WACA,eACA,gBACA,qBACM;CACN,eAAe,UAAU,aAAa,aAAa;CACnD,eAAe,UAAU,aAAa,8BAA8B,UAAU,YAAY,EAAE;CAC5F,IAAI,CAAC,OAAO,UAAU,UAAU,aAAa,KAAK,UAAU,gBAAgB,GAC1E,MAAM,IAAI,gBACR,iEAAiE,UAAU,YAAY,iCACzF;CAEF,aAAa,UAAU,cAAc,+BAA+B,UAAU,YAAY,EAAE;CAC5F,KAAK,MAAM,eAAe,UAAU,cAClC,IAAI,CAAC,cAAc,IAAI,WAAW,GAChC,MAAM,IAAI,gBACR,+CAA+C,UAAU,YAAY,6BAA6B,YAAY,EAChH;CAGJ,MAAM,YAAY,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,MAC3C,MAAM,UAAU,eAAe,IAAI,IAAI,IAAK,eAAe,IAAI,KAAK,CACvE;CACA,IAAI,CAAC,YAAY,UAAU,cAAc,SAAS,GAChD,MAAM,IAAI,gBACR,+CAA+C,UAAU,YAAY,wCACvE;CAEF,IAAI,UAAU,gBAAgB,uBAAuB,UAAU,aAAa,WAAW,GACrF,MAAM,IAAI,gBACR,mDAAmD,oBAAoB,2BACzE;AAEJ;AAEA,SAAS,YACP,OACA,KACA,WACM;CACN,IAAI,CAAC,YAAY,IAAI,cAAc,UAAU,YAAY,GACvD,MAAM,IAAI,gBACR,yCAAyC,IAAI,YAAY,GAAG,IAAI,OAAO,0CACzE;CAEF,IAAI,CAAC;EAAC;EAAY;EAAW;CAAS,CAAC,CAAC,SAAS,IAAI,YAAY,GAC/D,MAAM,IAAI,gBACR,yCAAyC,IAAI,YAAY,GAAG,IAAI,OAAO,8BAA8B,OAAO,IAAI,YAAY,EAAE,EAChI;CAEF,IAAI,IAAI,iBAAiB,YAAY;EACnC,IAAI,OAAO,IAAI,SAAS,aAAa,CAAC,OAAO,SAAS,IAAI,KAAK,GAC7D,MAAM,IAAI,gBACR,kDAAkD,IAAI,YAAY,GAAG,IAAI,OAAO,yCAClF;EAEF,IAAI,IAAI,iBAAiB,MACvB,MAAM,IAAI,gBACR,kDAAkD,IAAI,YAAY,GAAG,IAAI,OAAO,4BAClF;CAEJ,OAAO;EACL,IAAI,IAAI,SAAS,QAAQ,IAAI,UAAU,MACrC,MAAM,IAAI,gBACR,oCAAoC,IAAI,aAAa,QAAQ,IAAI,YAAY,GAAG,IAAI,OAAO,+BAC7F;EAEF,IAAI,OAAO,IAAI,iBAAiB,YAAY,IAAI,aAAa,KAAK,MAAM,IACtE,MAAM,IAAI,gBACR,oCAAoC,IAAI,aAAa,QAAQ,IAAI,YAAY,GAAG,IAAI,OAAO,wBAC7F;CAEJ;CACA,eACE,MAAM,iBACN,OAAO,KAAK,IAAI,IAAI,GACpB,sBAAsB,IAAI,YAAY,GAAG,IAAI,OAAO,IACpD,iBACF;CACA,KAAK,MAAM,UAAU,MAAM,iBAAiB;EAC1C,MAAM,QAAQ,IAAI,KAAK;EACvB,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GAC9E,MAAM,IAAI,gBACR,6DAA6D,OAAO,YAC9D,IAAI,YAAY,GAAG,IAAI,OAAO,yDACtC;CAEJ;CACA,MAAM,sBAAsB,YAC1B,IAAI,oBACH,aAAa,SAAS,aACvB,6BAA6B,IAAI,YAAY,GAAG,IAAI,OAAO,EAC7D;CACA,eACE,UAAU,cACV,oBAAoB,KAAK,GACzB,6BAA6B,IAAI,YAAY,GAAG,IAAI,OAAO,IAC3D,sBACF;CACA,KAAK,MAAM,YAAY,oBAAoB,OAAO,GAAG;EACnD,eAAe,SAAS,OAAO,SAAS,GAAG;EAC3C,eAAe,SAAS,gBAAgB,kBAAkB,GAAG;EAC7D,IAAI,SAAS,mBAAmB,QAAQ,SAAS,UAAU,MACzD,MAAM,IAAI,gBACR,2FACM,SAAS,YAAY,YAAY,IAAI,YAAY,GAAG,IAAI,OAAO,EACvE;CAEJ;AACF;AAEA,SAAS,eACP,OACA,OACA,KACM;CACN,IAAI,UAAU,QAAQ,UAAU,SAAS,UAAU,MACjD,MAAM,IAAI,gBACR,oCAAoC,MAAM,WAAW,IAAI,YAAY,GAAG,IAAI,OAAO,0BACrF;AAEJ;AAEA,SAAS,YACP,OACA,IACA,OACgB;CAChB,MAAM,yBAAS,IAAI,IAAe;CAClC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAM,GAAG,IAAI;EACnB,eAAe,KAAK,GAAG,MAAM,IAAI;EACjC,IAAI,OAAO,IAAI,GAAG,GAChB,MAAM,IAAI,gBAAgB,8CAA8C,MAAM,OAAO,IAAI,EAAE;EAE7F,OAAO,IAAI,KAAK,IAAI;CACtB;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,QAA2B,OAAqB;CAC5E,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,gBAAgB,oCAAoC,MAAM,UAAU;CAEhF,aAAa,QAAQ,KAAK;CAC1B,KAAK,MAAM,SAAS,QAAQ,eAAe,OAAO,KAAK;AACzD;AAEA,SAAS,aAAa,QAA2B,OAAqB;CACpE,IAAI,IAAI,IAAI,MAAM,CAAC,CAAC,SAAS,OAAO,QAClC,MAAM,IAAI,gBAAgB,oCAAoC,MAAM,qBAAqB;AAE7F;AAEA,SAAS,eAAe,OAAe,OAAqB;CAC1D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAChD,MAAM,IAAI,gBACR,oCAAoC,MAAM,4BAC5C;AAEJ;AAEA,SAAS,eACP,UACA,gBACA,aACA,eACM;CACN,MAAM,SAAS,CAAC,GAAG,cAAc;CACjC,MAAM,cAAc,IAAI,IAAI,QAAQ;CACpC,MAAM,YAAY,IAAI,IAAI,MAAM;CAChC,MAAM,UAAU,SAAS,QAAQ,UAAU,CAAC,UAAU,IAAI,KAAK,CAAC;CAChE,MAAM,QAAQ,OAAO,QAAQ,UAAU,CAAC,YAAY,IAAI,KAAK,CAAC;CAC9D,IAAI,QAAQ,SAAS,KAAK,MAAM,SAAS,KAAK,OAAO,WAAW,SAAS,QACvE,MAAM,IAAI,gBACR,oCAAoC,YAAY,kBAAkB,cAAc,aAClE,QAAQ,KAAK,IAAI,EAAE,YAAY,MAAM,KAAK,IAAI,EAAE,EAChE;AAEJ;AAEA,SAAS,YAAY,MAAyB,OAAmC;CAC/E,OAAO,KAAK,WAAW,MAAM,UAAU,KAAK,OAAO,OAAO,UAAU,UAAU,MAAM,MAAM;AAC5F;;;;;;;;;;;;;AC1YA,SAAgB,gCACd,OACqC;CACrC,MAAM,UAAUA,0BAAiB,KAAK;CACtC,MAAM,WAAW,QAAQ,cAAc,IAAI,MAAM,mBAAmB;CAEpE,MAAM,cAAc,QAAQ,WAAW,KAAK,cAC1C,mBAAmB,SAAS,WAAW,QAAQ,CACjD;CACA,MAAM,kBAAkB,YAAY,MACjC,YAAY,QAAQ,UAAU,gBAAgB,MAAM,mBACvD;CACA,MAAM,YAAY,YAAY,KAAK,YACjC,QAAQ,UAAU,gBAAgB,MAAM,sBACpC,UACA;EACE,GAAG;EACH,aAAa,qBAAqB,SAAS,SAAS,eAAe;CACrE,CACN;CACA,MAAM,cAAc,IAAI,IAAI,UAAU,KAAK,YAAY,CAAC,QAAQ,UAAU,aAAa,OAAO,CAAC,CAAC;CAChG,MAAM,kBAAkB,sBAAsB,SAAS,WAAW;CAClE,MAAM,0BAA0B,8BAA8B,SAAS,WAAW;CAClF,MAAM,WAAW,cAAc,SAAS,aAAa,yBAAyB,eAAe;CAC7F,MAAM,aAAa,iBACjB,SACA,aACA,iBACA,yBACA,QACF;CACA,MAAM,OAAO,QAAQ,WAAW,SAAS,cACvC,MAAM,UAAU,KACb,WAAW,QAAQ,gBAAgB,IAAI,UAAU,WAAW,CAAC,CAAE,IAAI,MAAM,CAC5E,CACF;CAEA,OAAO;EACL,SAAS,CAAC,GAAG,MAAM,SAAS;EAC5B,cAAc,CAAC,GAAG,MAAM,cAAc;EACtC,cAAc,CAAC,GAAG,MAAM,cAAc;EACtC,aAAa,CAAC,GAAG,MAAM,eAAe;EACtC;EACA,iBAAiB,KAAK,QAAQ,QAAQ,IAAI,iBAAiB,SAAS;EACpE,iBAAiB,KAAK,QAAQ,QAAQ,IAAI,iBAAiB,SAAS;EACpE,YAAY;EACZ;EACA;CACF;AACF;AAEA,SAAS,mBACP,SACA,WACA,UAC8B;CAC9B,MAAM,OAAOC,oBAAQ,SAAS,UAAU,WAAW;CAEnD,MAAM,UAAU,iBACd,SACA,MAHmBA,oBAAQ,SAAS,SAAS,WAIlC,GACX,UAAU,gBAAgB,SAAS,WACrC;CACA,MAAM,iBAAiB,KACpB,QAAQ,QAAQ,IAAI,iBAAiB,UAAU,CAAC,CAChD,KAAK,QAAQ,IAAI,KAAe;CACnC,MAAM,QAAQ,OAAO,YACnB,QAAQ,MAAM,gBAAgB,KAAK,WAAW,CAC5C,QACA,aAAa,KAAK,KAAK,QAAQ,IAAI,KAAK,OAAiB,CAAC,CAC5D,CAAC,CACH;CACA,OAAO;EACL;EACA;EACA,OAAO,eAAe,WAAW,IAAI,OAAO,aAAa,cAAc;EACvE;EACA,QAAQ,2BAA2B,MAAM,UAAU,cAAc,OAAO;EACxE,QAAQ,2BAA2B,MAAM,UAAU,cAAc,gBAAgB;EACjF,sBACE,UAAU,gBAAgB,SAAS,cAC/B,OACA,iBAAiB,SAAS,SAAS,aAAa,UAAU,WAAW;EAC3E,aAAa;CACf;AACF;AAEA,SAAS,iBACP,SACA,MACA,cACA,YAC8B;CAC9B,MAAM,kBAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,MAAM,iBAA2B,CAAC;CAClC,MAAM,iBAA2B,CAAC;CAClC,MAAM,iBAA2B,CAAC;CAClC,MAAM,oBAA8B,CAAC;CACrC,MAAM,2BAAqC,CAAC;CAC5C,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,MAAM,UAAU,QAAQ,SAAS;EACnE,MAAM,MAAM,KAAK;EACjB,MAAM,WAAW,aAAa;EAC9B,IAAI,IAAI,iBAAiB,WAAW,eAAe,KAAK,IAAI,MAAM;OAC7D,IAAI,IAAI,iBAAiB,WAAW,eAAe,KAAK,IAAI,MAAM;OAClE,IAAI,IAAI,MAAM,gBAAgB,KAAK,IAAI,MAAM;OAC7C,cAAc,KAAK,IAAI,MAAM;EAElC,IAAI,YAAY;EAChB,IAAI,IAAI,iBAAiB,cAAc,SAAS,iBAAiB,YAC/D,yBAAyB,KAAK,IAAI,MAAM;OACnC,IAAI,IAAI,QAAQ,CAAC,SAAS,MAAM,eAAe,KAAK,IAAI,MAAM;OAChE,IAAI,CAAC,IAAI,QAAQ,SAAS,MAAM,kBAAkB,KAAK,IAAI,MAAM;CACxE;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA,YAAY,eAAe,SAAS,kBAAkB;CACxD;AACF;AAEA,SAAS,2BACP,MACA,cACA,OAC+B;CAC/B,IAAI,aAAa,WAAW,GAC1B,OAAO;EACL,aAAa,CAAC;EACd,oBAAoB,CAAC;EACrB,qBAAqB,CAAC;EACtB,qBAAqB,CAAC;EACtB,mBAAmB,CAAC;CACtB;CAEF,MAAM,cAA+C,aAAa,KAAK,gBAAgB;EACrF,MAAM,kBAA4B,CAAC;EACnC,MAAM,qBAA+B,CAAC;EACtC,MAAM,oBAA8B,CAAC;EACrC,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,QAAQ,cAAc,KAAK,aAAa,KAAK;GACnD,IAAI,UAAU,MAAM,gBAAgB,KAAK,IAAI,MAAM;QAC9C,IAAI,UAAU,OAAO,mBAAmB,KAAK,IAAI,MAAM;QACvD,kBAAkB,KAAK,IAAI,MAAM;EACxC;EACA,OAAO;GAAE;GAAa;GAAiB;GAAoB;EAAkB;CAC/E,CAAC;CACD,MAAM,qBAA+B,CAAC;CACtC,MAAM,sBAAgC,CAAC;CACvC,MAAM,sBAAgC,CAAC;CACvC,MAAM,oBAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,SAAS,aAAa,KAAK,gBAAgB,cAAc,KAAK,aAAa,KAAK,CAAC;EACvF,IAAI,OAAO,MAAM,UAAU,UAAU,IAAI,GAAG,kBAAkB,KAAK,IAAI,MAAM;OACxE,IAAI,OAAO,MAAM,OAAO,GAAG,mBAAmB,KAAK,IAAI,MAAM;OAC7D,IAAI,OAAO,KAAK,OAAO,GAAG,oBAAoB,KAAK,IAAI,MAAM;OAC7D,oBAAoB,KAAK,IAAI,MAAM;CAC1C;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,qBACP,SACA,SACA,UACyB;CACzB,MAAM,UAA6C,CAAC;CACpD,IAAI,QAAQ,QAAQ,eAAe,SAAS,GAAG,QAAQ,KAAK,iBAAiB;CAC7E,IAAI,QAAQ,QAAQ,eAAe,SAAS,GAAG,QAAQ,KAAK,iBAAiB;CAC7E,IAAI,QAAQ,QAAQ,yBAAyB,SAAS,GAAG,QAAQ,KAAK,0BAA0B;CAChG,IAAI,QAAQ,QAAQ,eAAe,UAAU,QAAQ,QAAQ,kBAAkB,QAC7E,QAAQ,KAAK,qCAAqC;CAEpD,iCACE,SACA,QAAQ,QACR,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,iCACE,SACA,QAAQ,QACR,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,IAAI,CAAC,iBAAiB,SAAS,SAAS,QAAQ,GAAG,QAAQ,KAAK,qBAAqB;CACrF,OAAO;EAAE,UAAU,QAAQ,WAAW;EAAG,SAAS,OAAO,OAAO;CAAE;AACpE;AAEA,SAAS,iCACP,SACA,UACA,SACA,iBACA,aACA,kBACM;CACN,IAAI,SAAS,YAAY,MAAM,cAAc,UAAU,gBAAgB,SAAS,OAAO,GACrF,QAAQ,KAAK,WAAW;CAE1B,IACE,mBACA,SAAS,YAAY,MAAM,cAAc,UAAU,kBAAkB,SAAS,CAAC,GAE/E,QAAQ,KAAK,gBAAgB;AAEjC;AAEA,SAAS,sBACP,SACA,aACgC;CAChC,OAAO,CAAC,GAAG,QAAQ,kBAAkB,OAAO,CAAC,CAAC,CAC3C,KAAK,cAAc,YAAY,IAAI,UAAU,WAAW,CAAE,CAAC,CAC3D,QAAQ,YAAY,QAAQ,aAAa,QAAQ,CAAC,CAClD,MAAM,MAAM,UAAU,uBAAuB,SAAS,MAAM,KAAK,CAAC;AACvE;;;;;;AAOA,SAAS,8BACP,SACA,aACgC;CAChC,OAAO,CAAC,GAAG,QAAQ,kBAAkB,OAAO,CAAC,CAAC,CAC3C,KAAK,cAAc,YAAY,IAAI,UAAU,WAAW,CAAE,CAAC,CAC3D,QACE,YACC,QAAQ,QAAQ,kBAAkB,WAAW,KAC7C,QAAQ,aAAa,QAAQ,OAC1B,WAAW,WAAW,qCACzB,CACJ,CAAC,CACA,MAAM,MAAM,UAAU,uBAAuB,SAAS,MAAM,KAAK,CAAC;AACvE;AAEA,SAAS,uBACP,SACA,MACA,OACQ;CACR,MAAM,eAAe,MAAM,QAAQ,aAAa,KAAK,QAAQ;CAC7D,IAAI,iBAAiB,GAAG,OAAO;CAC/B,MAAM,YAAY,MAAM,QAAQ,eAAe,SAAS,KAAK,QAAQ,eAAe;CACpF,IAAI,cAAc,GAAG,OAAO;CAC5B,MAAM,eACJ,KAAK,QAAQ,kBAAkB,SAAS,MAAM,QAAQ,kBAAkB;CAC1E,IAAI,iBAAiB,GAAG,OAAO;CAC/B,KAAK,MAAM,UAAU,QAAQ,MAAM,iBAAiB;EAClD,MAAM,SAAS,KAAK,MAAM,OAAO,CAAE,SAAS,MAAM,MAAM,OAAO,CAAE;EACjE,IAAI,WAAW,GAAG,OAAO;CAC3B;CACA,MAAM,UAAU,KAAK,UAAU,gBAAgB,MAAM,UAAU;CAC/D,IAAI,YAAY,GAAG,OAAO;CAC1B,OACE,QAAQ,eAAe,IAAI,KAAK,UAAU,WAAW,IACrD,QAAQ,eAAe,IAAI,MAAM,UAAU,WAAW;AAE1D;AAEA,SAAS,cACP,SACA,aACA,yBACA,UAC6B;CAC7B,MAAM,sBAAsB,IAAI,IAC9B,wBAAwB,KAAK,YAAY,QAAQ,UAAU,WAAW,CACxE;CACA,MAAM,UAAuC,CAAC;CAC9C,KAAK,IAAI,YAAY,GAAG,YAAY,QAAQ,WAAW,QAAQ,aAC7D,KAAK,IAAI,aAAa,YAAY,GAAG,aAAa,QAAQ,WAAW,QAAQ,cAAc;EACzF,MAAM,gBAAgB,QAAQ,WAAW;EACzC,MAAM,iBAAiB,QAAQ,WAAW;EAC1C,MAAM,aAAa,QAAQ,kBAAkB,IAAI,cAAc,WAAW;EAC1E,MAAM,cAAc,QAAQ,kBAAkB,IAAI,eAAe,WAAW;EAC5E,MAAM,OAAO,QAAQ,sBAAsB,IACzCC,4BAAgB,CAAC,cAAc,aAAa,eAAe,WAAW,CAAC,CACzE;EACA,MAAM,cAAc,YAAY,IAAI,KAAK,WAAW;EACpD,MAAM,cAAc,YAAY,IAAI,WAAW,WAAW;EAC1D,MAAM,eAAe,YAAY,IAAI,YAAY,WAAW;EAC5D,MAAM,iBAA2B,CAAC;EAClC,MAAM,sBAAgC,CAAC;EACvC,KAAK,MAAM,UAAU,QAAQ,MAAM,WAAW;GAC5C,MAAM,UAAUC,mBAAO,SAAS,KAAK,aAAa,MAAM;GACxD,MAAM,UAAUA,mBAAO,SAAS,WAAW,aAAa,MAAM;GAC9D,MAAM,WAAWA,mBAAO,SAAS,YAAY,aAAa,MAAM;GAChE,IAAI,CAAC;IAAC;IAAS;IAAS;GAAQ,CAAC,CAAC,OAAO,QAAQ,IAAI,iBAAiB,UAAU,GAAG;GACnF,IAAI,QAAQ,QAAQ,CAAC,QAAQ,QAAQ,CAAC,SAAS,MAAM,eAAe,KAAK,MAAM;GAC/E,IAAI,CAAC,QAAQ,SAAS,QAAQ,QAAQ,SAAS,OAAO,oBAAoB,KAAK,MAAM;EACvF;EACA,MAAM,4BAGF,CACF,kBAAkB,SAAS,aAAa,WAAW,aAAa,KAAK,WAAW,GAChF,kBAAkB,SAAS,aAAa,YAAY,aAAa,KAAK,WAAW,CACnF;EACA,MAAM,eACJ,uBAAuB,SAAS,aAAa,YAAY,KAAK,IAAI,cAAc;EAClF,MAAM,SAAS,sBACbF,oBAAQ,SAAS,KAAK,WAAW,GACjC,cAAc,aACd,eAAe,aACf,OACF;EACA,MAAM,SAAS,sBACbA,oBAAQ,SAAS,KAAK,WAAW,GACjC,cAAc,aACd,eAAe,aACf,gBACF;EACA,MAAM,gBAAgB,kBACpB,SACA,aACA,UACA,cACA,2BACA,oBAAoB,IAAI,WAAW,WAAW,KAC5C,oBAAoB,IAAI,YAAY,WAAW,GACjD,qBACA,QACA,MACF;EACA,QAAQ,KAAK;GACX,cAAc,CAAC,cAAc,aAAa,eAAe,WAAW;GACpE,oBAAoB,CAAC,WAAW,aAAa,YAAY,WAAW;GACpE,wBAAwB,KAAK;GAC7B,gBAAgB,CAAC,GAAG,YAAY,QAAQ,cAAc;GACtD,mBAAmB,CAAC,GAAG,YAAY,QAAQ,iBAAiB;GAC5D;GACA;GACA;GACA,wBAAwB,cAAc,SAAS,aAAa,QAAQ;GACpE;GACA;GACA,aAAa,kBACX,SACA,SAAS,WACT,CAAC,YAAY,WAAW,GACxB,IACF;GACA;EACF,CAAC;CACH;CAEF,OAAO;AACT;AAEA,SAAS,kBACP,SACA,MACA,UACA,cACA,aACA,mBACA,qBACA,QACA,QAC+B;CAC/B,MAAM,UAAmD,CAAC;CAC1D,IAAI,CAAC,mBAAmB,QAAQ,KAAK,uBAAuB;CAC5D,IACE,KAAK,QAAQ,eAAe,SAAS,KACrC,KAAK,QAAQ,eAAe,SAAS,KACrC,KAAK,QAAQ,yBAAyB,SAAS,GAE/C,QAAQ,KAAK,iBAAiB;CAEhC,IAAI,KAAK,QAAQ,kBAAkB,SAAS,GAAG,QAAQ,KAAK,qBAAqB;CACjF,IAAI,oBAAoB,SAAS,GAAG,QAAQ,KAAK,cAAc;CAI/D,IAHyB,YAAY,MAClC,eAAe,WAAW,0BAA0B,aAAa,UAAU,WAE3D,CAAC,CAAC,YAAY,WAAW,GAAG,QAAQ,KAAK,2BAA2B;CACvF,0BACE,SACA,QACA,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,0BACE,SACA,QACA,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,IAAI,CAAC,iBAAiB,SAAS,MAAM,QAAQ,GAAG,QAAQ,KAAK,qBAAqB;CAClF,OAAO;EACL,YAAY,QAAQ,WAAW;EAC/B,SAAS,OAAO,OAAO;EACvB,yBAAyB,aAAa,UAAU;CAClD;AACF;AAEA,SAAS,0BACP,SACA,UACA,SACA,iBACA,aACA,kBACM;CACN,MAAM,eAAe,SAAS,YAAY,SAAS,SAAS,gBAAgB;CAC5E,MAAM,gBAAgB,SAAS,YAAY,SAAS,SAAS,iBAAiB;CAC9E,IAAI,eAAe,WAAW,gBAAgB,SAAS,QAAQ,KAAK,WAAW;CAC/E,IAAI,mBAAmB,SAAS,kBAAkB,SAAS,GAAG,QAAQ,KAAK,gBAAgB;AAC7F;AAEA,SAAS,kBACP,SACA,UACA,SACA,aAC+B;CAC/B,MAAM,UAAU,QAAQ,MAAM,UAAU,KAAK,WAAW;EACtD,MAAM,cAAcE,mBAAO,SAAS,SAAS,aAAa,MAAM;EAChE,MAAM,aAAa,QAAQ,KAAK,WAAWA,mBAAO,SAAS,OAAO,aAAa,MAAM,CAAC;EACtF,MAAM,iBAAiBA,mBAAO,SAAS,YAAY,aAAa,MAAM;EAEtE,IAAI,CAAC;GADS;GAAa,GAAG;GAAY;EAClC,CAAC,CAAC,OAAO,QAAQ,IAAI,iBAAiB,UAAU,GACtD,OAAO;GAAE;GAAQ,iBAAiB;GAAM,kBAAkB;EAAK;EAEjE,MAAM,eACJ,WAAW,QAAQ,KAAK,QAAQ,MAAM,OAAO,IAAI,IAAI,GAAG,CAAC,KACxD,QAAQ,SAAS,KAAK,OAAO,YAAY,IAAI;EAChD,MAAM,gBACJ,WAAW,QAAQ,KAAK,QAAQ,MAAO,IAAI,OAAkB,CAAC,KAC7D,QAAQ,SAAS,KAAM,YAAY;EACtC,OAAO;GACL;GACA,iBAAiB,OAAO,eAAe,IAAI,IAAI;GAC/C,kBAAmB,eAAe,QAAmB;EACvD;CACF,CAAC;CACD,MAAM,WAAW,QAAQ,QACtB,QACC,IAAI,oBAAoB,QAAQ,IAAI,qBAAqB,IAC7D;CACA,MAAM,mBAAmB,SAAS,KAAK,QAAQ,IAAI,eAAe;CAClE,MAAM,oBAAoB,SAAS,KAAK,QAAQ,IAAI,gBAAgB;CACpE,OAAO;EACL;EACA,GAAG,SAAS;EACZ,UAAU,QAAQ,SAAS,SAAS;EACpC,qBAAqBC,aAAW,gBAAgB;EAChD,sBAAsBA,aAAW,iBAAiB;EAClD,eAAe,qBAAqB,kBAAkB,OAAO;EAC7D,gBAAgB,qBAAqB,mBAAmB,OAAO;CACjE;AACF;AAEA,SAAS,qBACP,cACA,SACA;CACA,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,OAAO,gBAAgB,IAAI,MAAM,aAAa,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,cAAc;EAC3E,GAAG,QAAQ,MAAM;EACjB,WAAW;CACb,CAAC;AACH;AAEA,SAAS,iBACP,SACA,aACA,iBACA,yBACA,UACwB;CACxB,MAAM,oBAAoB,gBAAgB,QAAQ,YAAY;EAC5D,MAAM,cAAc,QAAQ,UAAU,aAAa;EACnD,OAAO,QAAQ,cAAc,IAAI,WAAW,CAAC,CAAE;CACjD,CAAC;CACD,MAAM,UAAsC,kBAAkB,KAAK,SAAS,WAAW;EACrF,MAAM,QAAQ;EACd,aAAa,QAAQ,UAAU;EAC/B,aAAa,QAAQ,UAAU,aAAa;CAC9C,EAAE;CACF,MAAM,OAAO,kBAAkB;CAe/B,OAAO;EAAE,YAdU,OACf;GACE,aAAa,KAAK,UAAU;GAC5B,aAAa,KAAK,UAAU,aAAa;GACzC;EACF,IACA;EAQiB,YAPF,iBAAiB,SAAS,eAOf;EAAG,kBANR,uBACvB,SACA,aACA,yBACA,QAE8C;CAAE;AACpD;AAEA,SAAS,iBACP,SACA,iBACwC;CACxC,IAAI,gBAAgB,WAAW,GAAG,OAAO;CACzC,MAAM,eAAe,gBAClB,KAAK,YAAY,QAAQ,UAAU,aAAa,EAAG,CAAC,CACpD,MAAM,MAAM,UAAU,QAAQ,eAAe,IAAI,IAAI,IAAK,QAAQ,eAAe,IAAI,KAAK,CAAE;CAC/F,MAAM,YAAY,QAAQ,sBAAsB,IAAIF,4BAAgB,YAAY,CAAC;CACjF,IAAI,CAAC,WACH,MAAM,IAAI,gBACR,iDAAiD,aAAa,KAAK,IAAI,EAAE,oBAC3E;CAEF,OAAO;EAAE,aAAa,UAAU;EAAa;CAAa;AAC5D;AAEA,SAAS,uBACP,SACA,aACA,yBACA,UAC8C;CAC9C,MAAM,WAAW,YAAY,IAAI,QAAQ,MAAM,mBAAmB;CAClE,MAAM,mBAAmB,IAAI,IAC3B,SAAS,KAAK,UAAU,CAACA,4BAAgB,MAAM,YAAY,GAAG,KAAK,CAAC,CACtE;CACA,MAAM,QAAQ,SACX,QAAQ,UAAU,MAAM,cAAc,UAAU,CAAC,CACjD,KAAK,UACJ,oBACE,SACA,aACA,yBACA,kBACA,UACA,YAAY,IAAI,MAAM,sBAAsB,CAC9C,CACF;CACF,IAAI,MAAM,WAAW,GAAG,OAAO;CAE/B,MAAM,YAAY,MACf,QAAQ,SAAS,KAAK,SAAS,CAAC,CAChC,MAAM,MAAM,UAAU,wBAAwB,SAAS,aAAa,MAAM,KAAK,CAAC;CACnF,MAAM,UACJ,UAAU,MACV,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,MAAM,UAAU,wBAAwB,SAAS,aAAa,MAAM,KAAK,CAAC,CAAC,CAAC;CAC/F,OAAO;EACL,iBAAiB,QAAQ;EACzB,qBAAqB,QAAQ;EAC7B,sBAAsB,CAAC,GAAG,QAAQ,oBAAoB;EACtD,qBAAqB,UAAU,SAAS,IAAI,QAAQ,sBAAsB;EAC1E,WAAW,UAAU,SAAS;EAC9B,gBAAgB;EAChB,OAAO,QAAQ;CACjB;AACF;AAEA,SAAS,oBACP,SACA,aACA,yBACA,kBACA,UACA,MAC6B;CAC7B,IAAI,UAAU;CACd,IAAI,WAAW,CAAC,GAAG,KAAK,UAAU,YAAY;CAC9C,IAAI,YAAY,wBAAwB,QACrC,YAAY,CAAC,SAAS,SAAS,QAAQ,UAAU,aAAa,EAAG,CACpE;CACA,MAAM,QAAuC,CAAC;CAE9C,OAAO,UAAU,SAAS,GAAG;EAC3B,MAAM,YAAY,UAAU,KAAK,aAC/B,iBACE,SACA,aACA,kBACA,UACA,SACA,UACA,QACF,CACF;EAIA,MAAM,WAHW,UACd,QAAQ,aAAa,SAAS,QAAQ,CAAC,CACvC,MAAM,MAAM,UAAU,yBAAyB,SAAS,aAAa,MAAM,KAAK,CAC3D,CAAC,CAAC;EAC1B,IAAI,UAAU,SAAS,WAAW;EAClC,MAAM,KAAK;GACT,iBAAiB,QAAQ,UAAU;GACnC,sBAAsB,CAAC,GAAG,QAAQ;GAClC,YAAY,UAAU,MACnB,MAAM,UACL,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB,CACxD;GACA,qBAAqB,UAAU,qBAAqB;EACtD,CAAC;EACD,IAAI,CAAC,UAAU,mBAAmB;EAClC,UAAU,YAAY,IAAI,SAAS,iBAAiB;EACpD,WAAW,CAAC,GAAG,QAAQ,UAAU,YAAY;EAC7C,YAAY,UAAU,QACnB,YAAY,QAAQ,UAAU,gBAAgB,SAAS,mBAC1D;CACF;CAEA,MAAM,YAAY,SAAS,UAAU,QAAQ,MAAM,UAAU;CAC7D,OAAO;EACL,iBAAiB,KAAK,UAAU;EAChC,qBAAqB,QAAQ,UAAU;EACvC,sBAAsB;EACtB;EACA;CACF;AACF;AAEA,SAAS,wBACP,SACA,aACA,MACA,OACQ;CACR,MAAM,cAAc,YAAY,IAAI,KAAK,mBAAmB;CAC5D,MAAM,eAAe,YAAY,IAAI,MAAM,mBAAmB;CAC9D,MAAM,eAAe,aAAa,QAAQ,aAAa,YAAY,QAAQ;CAC3E,IAAI,iBAAiB,GAAG,OAAO;CAC/B,MAAM,YACJ,aAAa,QAAQ,eAAe,SAAS,YAAY,QAAQ,eAAe;CAClF,IAAI,cAAc,GAAG,OAAO;CAC5B,MAAM,eACJ,YAAY,QAAQ,kBAAkB,SAAS,aAAa,QAAQ,kBAAkB;CACxF,IAAI,iBAAiB,GAAG,OAAO;CAC/B,KAAK,MAAM,UAAU,QAAQ,MAAM,iBAAiB;EAClD,MAAM,SAAS,YAAY,MAAM,OAAO,CAAE,SAAS,aAAa,MAAM,OAAO,CAAE;EAC/E,IAAI,WAAW,GAAG,OAAO;CAC3B;CACA,MAAM,UAAU,YAAY,UAAU,gBAAgB,aAAa,UAAU;CAC7E,IAAI,YAAY,GAAG,OAAO;CAC1B,MAAM,mBACJ,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;CACtD,IAAI,qBAAqB,GAAG,OAAO;CACnC,OACE,QAAQ,eAAe,IAAI,KAAK,eAAe,IAC/C,QAAQ,eAAe,IAAI,MAAM,eAAe;AAEpD;AAEA,SAAS,iBACP,SACA,aACA,kBACA,UACA,SACA,UACA,UAC8B;CAC9B,MAAM,sBAAsB,SAAS,UAAU,aAAa;CAC5D,MAAM,UAAiD,CAAC;CACxD,KAAK,MAAM,uBAAuB,UAIhC,IAAI,CAHS,iBAAiB,IAC5BA,4BAAgBG,gCAAoB,SAAS,CAAC,qBAAqB,mBAAmB,CAAC,CAAC,CAElF,CAAC,EAAE,cAAc,YAAY,QAAQ,KAAK,mBAAmB;CAEvE,MAAM,mBAAmBA,gCAAoB,SAAS,CAAC,GAAG,UAAU,mBAAmB,CAAC;CACxF,MAAM,SAAS,QAAQ,sBAAsB,IAAIH,4BAAgB,gBAAgB,CAAC;CAClF,IAAI,CAAC,QAAQ;EACX,QAAQ,KAAK,2BAA2B;EACxC,OAAO,sBAAsB,UAAU,qBAAqB,OAAO;CACrE;CACA,MAAM,gBAAgB,YAAY,IAAI,OAAO,WAAW;CACxD,IACE,cAAc,QAAQ,eAAe,SAAS,KAC9C,cAAc,QAAQ,eAAe,SAAS,KAC9C,cAAc,QAAQ,yBAAyB,SAAS,GAExD,QAAQ,KAAK,mBAAmB;CAElC,IAAI,cAAc,QAAQ,kBAAkB,SAAS,GAAG,QAAQ,KAAK,qBAAqB;CAC1F,MAAM,aAAa,kBACjB,SACA,aACA,QAAQ,UAAU,aAClB,OAAO,WACT;CACA,IAAI,WAAW,YAAY,WAAW,GAAG,QAAQ,KAAK,2BAA2B;CACjF,IAAI,WAAW,kBAAkB,SAAS,GAAG,QAAQ,KAAK,wBAAwB;CAClF,4BACE,SACA,cAAc,QACd,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,4BACE,SACA,cAAc,QACd,QAAQ,MAAM,UAAU,oBACxB,QAAQ,MAAM,UAAU,uBACxB,wBACA,mBACF;CACA,IAAI,CAAC,iBAAiB,SAAS,eAAe,QAAQ,GAAG,QAAQ,KAAK,qBAAqB;CAC3F,OAAO;EACL,qBAAqB,SAAS,UAAU;EACxC;EACA,mBAAmB,OAAO;EAC1B,8BAA8B,WAAW;EACzC,8BAA8B,WAAW;EACzC,uBAAuB,OAAO,YAC5B,QAAQ,MAAM,gBAAgB,KAAK,WAAW,CAC5C,QACA,cAAc,MAAM,OAAO,CAAE,SAAS,QAAQ,MAAM,OAAO,CAAE,MAC/D,CAAC,CACH;EACA,UAAU,QAAQ,WAAW;EAC7B,UAAU;EACV,SAAS,OAAO,OAAO;CACzB;AACF;AAEA,SAAS,sBACP,UACA,qBACA,SAC8B;CAC9B,OAAO;EACL,qBAAqB,SAAS,UAAU;EACxC;EACA,mBAAmB;EACnB,8BAA8B,CAAC;EAC/B,8BAA8B,CAAC;EAC/B,uBAAuB;EACvB,UAAU;EACV,UAAU;EACV,SAAS,OAAO,OAAO;CACzB;AACF;AAEA,SAAS,4BACP,SACA,UACA,SACA,iBACA,aACA,kBACM;CACN,IAAI,SAAS,YAAY,MAAM,cAAc,UAAU,gBAAgB,SAAS,OAAO,GACrF,QAAQ,KAAK,WAAW;CAE1B,IACE,mBACA,SAAS,YAAY,MAAM,cAAc,UAAU,kBAAkB,SAAS,CAAC,GAE/E,QAAQ,KAAK,gBAAgB;AAEjC;AAEA,SAAS,yBACP,SACA,aACA,MACA,OACQ;CACR,MAAM,SACJ,MAAM,6BAA6B,SAAS,KAAK,6BAA6B;CAChF,IAAI,WAAW,GAAG,OAAO;CACzB,KAAK,MAAM,UAAU,QAAQ,MAAM,iBAAiB;EAClD,MAAM,SAAS,KAAK,sBAAuB,UAAW,MAAM,sBAAuB;EACnF,IAAI,WAAW,GAAG,OAAO;CAC3B;CAGA,MAAM,UAFY,YAAY,IAAI,KAAK,mBAAmB,CAAC,CAAE,UAAU,gBACpD,YAAY,IAAI,MAAM,mBAAmB,CAAC,CAAE,UAAU;CAEzE,IAAI,YAAY,GAAG,OAAO;CAC1B,OACE,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;AAExD;AAEA,SAAS,kBACP,SACA,aACA,uBACA,sBACiC;CACjC,MAAM,cAAwB,CAAC;CAC/B,MAAM,oBAA8B,CAAC;CACrC,MAAM,iBAA2B,CAAC;CAClC,KAAK,MAAM,UAAU,QAAQ,MAAM,WAAW;EAC5C,MAAM,aAAaC,mBAAO,SAAS,uBAAuB,MAAM;EAChE,MAAM,YAAYA,mBAAO,SAAS,sBAAsB,MAAM;EAC9D,IAAI,WAAW,iBAAiB,cAAc,UAAU,iBAAiB,YACvE,eAAe,KAAK,MAAM;OACrB,IAAI,UAAU,QAAQ,CAAC,WAAW,MAAM,YAAY,KAAK,MAAM;OACjE,IAAI,CAAC,UAAU,QAAQ,WAAW,MAAM,kBAAkB,KAAK,MAAM;CAC5E;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,QAAQ,iBAAiB,SAAS,uBAAuB,oBAAoB;EAC7E,cAAc,cACZ,SACA,YAAY,IAAI,oBAAoB,GACpC,YAAY,IAAI,qBAAqB,CACvC;CACF;AACF;AAEA,SAAS,iBACP,SACA,uBACA,sBACsB;CACtB,MAAM,OAAuB,CAAC;CAC9B,KAAK,MAAM,UAAU,QAAQ,MAAM,WAAW;EAC5C,KAAK,KAAK,eAAe,SAASA,mBAAO,SAAS,uBAAuB,MAAM,CAAC,CAAC;EACjF,KAAK,KAAK,eAAe,SAASA,mBAAO,SAAS,sBAAsB,MAAM,CAAC,CAAC;CAClF;CACA,OAAO,kBAAkB,MAAM;EAC7B,aAAa;EACb,cAAc;EACd,aAAa,CAAC,SAAS,GAAG,QAAQ,MAAM,eAAe;EACvD,WAAW;GAAE,GAAG,QAAQ,MAAM;GAAW,WAAW;EAAO;CAC7D,CAAC;AACH;AAEA,SAAS,eACP,SACA,KACc;CACd,MAAM,UAAkC,OAAO,YAC7C,QAAQ,MAAM,gBAAgB,KAAK,WAAW,CAAC,QAAQ,IAAI,KAAK,OAAiB,CAAC,CACpF;CACA,IAAI,IAAI,iBAAiB,YAAY,QAAQ,QAAQ,IAAI;CACzD,OAAO;EACL,SAAS,IAAI;EACb,KAAK,IAAI;EACT,GAAI,IAAI,iBAAiB,aAAa,EAAE,MAAM,IAAI,KAAgB,IAAI,CAAC;EACvE;CACF;AACF;AAEA,SAAS,sBACP,MACA,iBACA,kBACA,OAC0B;CAC1B,MAAM,cAAwB,CAAC;CAC/B,MAAM,kBAA4B,CAAC;CACnC,MAAM,mBAA6B,CAAC;CACpC,MAAM,iBAA2B,CAAC;CAClC,MAAM,oBAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,OAAO,cAAc,KAAK,iBAAiB,KAAK;EACtD,MAAM,QAAQ,cAAc,KAAK,kBAAkB,KAAK;EACxD,IAAI,SAAS,QAAQ,UAAU,MAAM,kBAAkB,KAAK,IAAI,MAAM;OACjE,IAAI,QAAQ,OAAO,YAAY,KAAK,IAAI,MAAM;OAC9C,IAAI,MAAM,gBAAgB,KAAK,IAAI,MAAM;OACzC,IAAI,OAAO,iBAAiB,KAAK,IAAI,MAAM;OAC3C,eAAe,KAAK,IAAI,MAAM;CACrC;CACA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,cACP,SACA,WACA,YAC0C;CAC1C,OAAO,OAAO,YACZ,QAAQ,MAAM,gBAAgB,KAAK,WAAW;EAC5C,MAAM,kBAAkB,UAAU,MAAM,OAAO,CAAE;EACjD,MAAM,mBAAmB,WAAW,MAAM,OAAO,CAAE;EACnD,OAAO,CACL,QACA;GACE;GACA;GACA,aAAa,kBAAkB;GAC/B,aACE,qBAAqB,IACjB,oBAAoB,IAClB,IACA,OACF,kBAAkB;EAC1B,CACF;CACF,CAAC,CACH;AACF;AAEA,SAAS,iBACP,SACA,WACA,UACS;CACT,MAAM,WAAW,cAAc,SAAS,WAAW,QAAQ;CAC3D,OAAO,OAAO,QAAQ,QAAQ,MAAM,UAAU,gCAAgC,CAAC,CAAC,OAC7E,CAAC,QAAQ,WAAW;EACnB,MAAM,QAAQ,SAAS,OAAO,CAAE;EAChC,OAAO,UAAU,QAAQ,SAAS;CACpC,CACF;AACF;AAEA,SAAS,aAAa,QAA4C;CAChE,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,MAAM,UAAU,OAAO,KAAK;CAC7D,MAAM,QAAQ,OAAO,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC;CAC1D,MAAM,SAAS,KAAK,MAAM,OAAO,SAAS,CAAC;CAC3C,MAAM,SACJ,OAAO,SAAS,MAAM,IAAI,OAAO,WAAY,OAAO,SAAS,KAAM,OAAO,WAAY;CACxF,OAAO;EACL,GAAG,OAAO;EACV,KAAK,OAAO;EACZ;EACA,MAAM,QAAQ,OAAO;EACrB,KAAK,OAAO,OAAO,SAAS;EAC5B;CACF;AACF;AAEA,SAAS,cACP,KACA,aACA,OACgB;CAChB,OAAO,IAAI,kBAAkB,MAAM,aAAa,SAAS,gBAAgB,WAAW,CAAC,CAAE;AACzF;AAEA,SAASC,aAAW,QAAiC;CACnD,OAAO,OAAO,WAAW,IAAI,OAAO,OAAO,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAC7F;AAEA,SAAS,OAAU,QAAkB;CACnC,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AAC5B;;;;AC77BA,SAAgB,qBAAqB,UAA4B;CAC/D,MAAM,OAAO,QAAQ,QAAQ;CAC7B,IAAI,CAAC,WAAW,IAAI,GAAG,MAAM,IAAI,MAAM,6CAA6C,MAAM;CAE1F,MAAM,WAAqB,CAAC;CAC5B,MAAM,QAAQ,KAAa,OAAO,OAAO;EACvC,KAAK,MAAM,SAAS,YAAY,GAAG,CAAC,CAAC,KAAK,GAAG;GAC3C,IAAI,MAAM,WAAW,GAAG,KAAK,UAAU,gBAAgB;GACvD,MAAM,WAAW,KAAK,KAAK,KAAK;GAChC,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC,YAAY,GAAG;GAEvC,MAAM,OAAO,OAAO,GAAG,KAAK,GAAG,UAAU;GACzC,IAAI,oBAAoB,UAAU,WAAW,GAC3C,SAAS,KAAK,IAAI;QAElB,KAAK,UAAU,IAAI;EAEvB;CACF;CAEA,KAAK,IAAI;CACT,OAAO;AACT;;;;;AAMA,SAAgB,gBACd,UACA,MACA,UAAkC,CAAC,GACtB;CACb,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,cAAc,QAAQ,MAAM,IAAI;CACtC,aAAa,MAAM,aAAa,IAAI;CAEpC,IAAI,CAAC,WAAW,WAAW,KAAK,CAAC,SAAS,WAAW,CAAC,CAAC,YAAY,GACjE,MAAM,IAAI,MAAM,uCAAuC,MAAM;CAE/D,IAAI,CAAC,oBAAoB,aAAa,WAAW,GAC/C,MAAM,IAAI,MAAM,oBAAoB,KAAK,iCAAiC;CAG5E,MAAM,aAAa,KAAK,aAAa,WAAW;CAChD,MAAM,WAAW,gBAAgB,WAAW;CAC5C,MAAM,kBAAkB,oBAAoB,aAAa,cAAc,IACnE,KAAK,aAAa,cAAc,IAChC,KAAA;CAEJ,IAAI,eAAe,QAAQ;EACzB,IAAI,CAAC,UACH,MAAM,IAAI,MAAM,oBAAoB,KAAK,2CAA2C;EACtF,IAAI,CAAC,iBACH,MAAM,IAAI,MAAM,oBAAoB,KAAK,oCAAoC;EAC/E,oBAAoB,iBAAiB,IAAI;CAC3C;CAEA,MAAM,QAAQ,oBAAoB,WAAW;CAC7C,OAAO;EACL;EACA,MAAM;EACN;EACA;EACA;EACA,QAAQ,aAAa,YAAY,MAAM;EACvC;EACA,aAAa,YAAY;GACvB;GACA,QAAQ,QAAQ,qBAAqB;EACvC,CAAC;CACH;AACF;;AAGA,SAAgB,yBACd,UACA,UAA2C,CAAC,GACrB;CAEvB,QADc,QAAQ,SAAS,qBAAqB,QAAQ,EAAA,CAC/C,KAAK,SAAS;EACzB,MAAM,UAAU,gBAAgB,UAAU,MAAM,OAAO;EACvD,OAAO;GACL,IAAI,QAAQ;GACZ,MAAM;GACN,MAAM,CAAC,cAAc;GACrB,aAAa,QAAQ;GACrB,aAAa,QAAQ;GACrB,YAAY,QAAQ;GACpB,UAAU,QAAQ;GAClB,iBAAiB,QAAQ;GACzB,QAAQ,QAAQ;GAChB,aAAa,QAAQ;EACvB;CACF,CAAC;AACH;;;;;AAMA,SAAgB,mBACd,SACoB;CACpB,MAAM,YAAY,yBAAyB,QAAQ,UAAU;EAC3D,OAAO,QAAQ;EACf,YAAY,QAAQ;EACpB,mBAAmB,QAAQ;CAC7B,CAAC;CAYD,OAAO;EACL,GAZW,gBAAgD;GAC3D;GACA,aAAa,QAAQ,eAAe;GACpC,QAAQ,QAAQ;GAChB,MAAM,QAAQ;GACd,MAAM,QAAQ;GACd,WAAW,QAAQ;GACnB,QAAQ,QAAQ;GAChB,SAAS,QAAQ;EACnB,CAGQ;EACN,UAAU,UAAU,KAAK,cAAc;GACrC,aAAa,SAAS;GACtB,aAAa,SAAS;GACtB,aAAa,SAAS;EACxB,EAAE;CACJ;AACF;AAEA,SAAS,oBAAoB,SAAiB,UAA2B;CACvE,IAAI;EACF,OAAO,YAAY,OAAO,CAAC,CAAC,SAAS,QAAQ;CAC/C,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,gBAAgB,aAAyC;CAChE,IAAI,oBAAoB,aAAa,SAAS,GAAG,OAAO,KAAK,aAAa,SAAS;CACnF,IAAI,oBAAoB,aAAa,UAAU,GAAG,OAAO,KAAK,aAAa,UAAU;AAEvF;AAEA,SAAS,oBAAoB,iBAAyB,MAAoB;CACxE,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,aAAa,iBAAiB,MAAM,CAAC;CAC3D,SAAS,KAAK;EACZ,MAAM,IAAI,MACR,oBAAoB,KAAK,iCAAiC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAC3G;CACF;CAEA,IACE,OAAO,WAAW,YAClB,WAAW,QACV,OAA8B,SAAS,UAExC,MAAM,IAAI,MAAM,oBAAoB,KAAK,wCAAwC;AAErF;AAEA,SAAS,oBAAoB,aAAqB,OAAO,IAAuB;CAC9E,MAAM,QAA2B,CAAC;CAClC,KAAK,MAAM,SAAS,YAAY,KAAK,aAAa,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;EAC/D,IAAI,UAAU,kBAAkB,UAAU,QAAQ;EAClD,MAAM,eAAe,OAAO,GAAG,KAAK,GAAG,UAAU;EACjD,MAAM,WAAW,KAAK,aAAa,YAAY;EAE/C,IADa,SAAS,QACf,CAAC,CAAC,YAAY,GAAG;GACtB,MAAM,KAAK,GAAG,oBAAoB,aAAa,YAAY,CAAC;GAC5D;EACF;EACA,MAAM,QAAQ,aAAa,QAAQ;EACnC,MAAM,KAAK;GACT,MAAM;GACN,QAAQ,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK;GACvD,OAAO,MAAM;EACf,CAAC;CACH;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAc,QAAgB,OAAqB;CACvE,MAAM,MAAM,SAAS,MAAM,MAAM;CACjC,IAAI,QAAQ,MAAO,CAAC,IAAI,WAAW,IAAI,KAAK,CAAC,WAAW,GAAG,GAAI;CAC/D,MAAM,IAAI,MAAM,mDAAmD,OAAO;AAC5E;;;;AC3NA,SAASE,OAAK,IAAsB;CAClC,OAAO,GAAG,WAAW,IAAI,IAAI,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;;AAGA,SAAS,WACP,KACA,UACA,aAC6B;CAC7B,MAAM,SAAS,YAAY,KAAc,UAAmB,cAAc,MAAM,EAAE,SAAS;CAC3F,MAAM,SAAS,OAAO,MAAM,KAAK,GAAG,MAAM,KAAK,OAAO,OAAO,MAAM,EAAE;CACrE,OAAO;EAAE,MAAMA,OAAK,MAAM;EAAG,GAAG,OAAO;CAAO;AAChD;;;;;AAMA,SAAgB,mBACd,SAC4B;CAC5B,MAAM,wBAAwB,QAAQ,yBAAyB;CAC/D,OAAO;EACL,MAAM;EACN,MAAM,OAAO,KAA6D;GACxE,IAAI,CAAC,IAAI,qBACP,MAAM,IAAI,MACR,4GACF;GAEF,IAAI,CAAC,IAAI,wBACP,MAAM,IAAI,MACR,6NACF;GAEF,MAAM,cAAc,IAAI,IAAI,QAAQ,UAAU,KAAK,MAAM,EAAE,EAAE,CAAC;GAC9D,MAAM,OAAO,WACX,IAAI,aACJ,IAAI,qBACJ,WACF;GACA,MAAM,OAAO,WACX,IAAI,wBACJ,IAAI,qBACJ,WACF;GAKA,IAAI,KAAK,QAAQ,GACf,OAAO;IACL,UAAU;IACV,SAAS,CACP,2CAA2C,KAAK,KAAK,QAAQ,CAAC,EAAE,gDAClE;IACA,mBAAmB,CACjB;KACE,MAAM;KACN,QAAQ;KACR,QAAQ;MAAE,eAAe,KAAK;MAAM,iBAAiB,KAAK;MAAM,GAAG,KAAK;KAAE;IAC5E,CACF;IACA,OAAO,KAAK;GACd;GAGF,MAAM,qBAAqB,KAAK,OAAO,KAAK;GAC5C,MAAM,SAAS,qBAAqB;GACpC,MAAM,OAAO,qBAAqB,IAAA,CAAK,QAAQ,CAAC;GAChD,OAAO;IACL,UAAU,SAAS,SAAS;IAC5B,SAAS,SACL,CACE,kEAAkE,IAAI,oBAAoB,wBAAwB,IAAA,CAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,GAChN,IACA,CACE,4FAA4F,IAAI,oBAAoB,wBAAwB,IAAA,CAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,EAAE,kBAAkB,KAAK,KAAK,QAAQ,CAAC,GAC1O;IACJ,mBAAmB,CACjB;KACE,MAAM;KACN,QAAQ,SAAS,SAAS;KAC1B,QAAQ;MACN,eAAe,KAAK;MACpB,iBAAiB,KAAK;MACtB;MACA;MACA,GAAG,KAAK;KACV;IACF,CACF;IACA,OAAO,KAAK;GACd;EACF;CACF;AACF;;;;;;;;;ACtEA,SAAgB,oBACd,UACA,OAAmC,CAAC,GACf;CACrB,MAAM,gBAAgB,KAAK,iBAAiB;CAC5C,MAAM,YAAY,KAAK,qBAAqB;CAC5C,MAAM,WAAW,SAA4C;EAC3D,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,KAAK,UAAU;GACxB,IAAI,SAAS,EAAE,SAAS,eAAe;GACvC,KAAK,MAAM,KAAK,EAAE,OAChB,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,IAAI,GAAG;IAC3C,MAAM,MAAM,QAAQ,IAAI,CAAC,qBAAK,IAAI,IAAY;IAC9C,IAAI,IAAI,OAAO,CAAC,CAAC;IACjB,QAAQ,IAAI,GAAG,GAAG;GACpB;EAEJ;EACA,OAAO;CACT;CACA,MAAM,UAAU,QAAQ,IAAI;CAC5B,MAAM,UAAU,QAAQ,KAAK;CAC7B,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,yBAAS,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,GAAG;EACnE,MAAM,KAAK,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,CAAC,MAAM,GAAG,SAAS;EAC7D,MAAM,KAAK,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,CAAC,MAAM,GAAG,SAAS;EAC7D,MAAM,UAAU,SAAoB,KAAK,SAAS,KAAK,UAAU,IAAI,IAAI;EACzE,MAAM,KAAK,KAAK,MAAM,oBAAoB,OAAO,EAAE,EAAE,qBAAqB,OAAO,EAAE,GAAG;CACxF;CACA,MAAM,SAAS,MAA6C;EAC1D,MAAM,sBAAM,IAAI,IAAY;EAC5B,KAAK,MAAM,QAAQ,EAAE,OAAO,GAAG,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,EAAE,YAAY,CAAC;EAC5E,OAAO;CACT;CACA,OAAO;EACL,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,eAAe,MAAM,OAAO;EAC5B,eAAe,MAAM,OAAO;CAC9B;AACF;;;;;;;;AAgBA,SAAgB,2BACd,MACA,MACyB;CACzB,MAAM,6BAAa,IAAI,IAAY;CACnC,KAAK,MAAM,KAAK,KAAK,SAAS,0BAA0B,GAAG;EACzD,MAAM,IAAK,EAAE,EAAE,CAAY,YAAY;EACvC,IAAI,CAAC,KAAK,cAAc,IAAI,CAAC,GAAG,WAAW,IAAI,CAAC;CAClD;CACA,MAAM,MAAM,CAAC,GAAG,UAAU;CAC1B,OAAO;EACL,YAAY;EACZ,SAAS,IAAI,QAAQ,MAAM,KAAK,cAAc,IAAI,CAAC,CAAC;CACtD;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AChFA,IAAa,4BAAb,cAA+C,MAAM;CAEjC;CADlB,YACE,MACA,SACA;EACA,MAAM,OAAO;EAHG,KAAA,OAAA;EAIhB,KAAK,OAAO;CACd;AACF;;;;;AAYA,IAAa,yBAAb,MAAoE;CAIrC;CAH7B;CACA,6BAA8B,IAAI,IAA4B;CAE9D,YAAY,SAAyD;EAAxC,KAAA,UAAA;EAC3B,IAAI,CAAC,WAAW,QAAQ,IAAI,GAAG,UAAU,QAAQ,MAAM,EAAE,WAAW,KAAK,CAAC;EAC1E,KAAK,MAAM,QAAQ,OAAO,KAAK;CACjC;CAEA,MAAM,QAAQ,OAA4C;EACxD,KAAK,iBAAiB,KAAK;EAC3B,KAAK,gBAAgB,KAAK;EAC1B,MAAM,SAAS,KAAK,SAAS,KAAK;EAMlC,WALa,KAAK,cAAc,MAAM,MAKxB,GAAG,GAJD,KAAK,UAAU,MAAM,EAAE,GAIlB;CACvB;CAEA,MAAM,OAAO,MAAmE;EAC9E,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,0BACR,kBACA,0FACF;EAEF,IAAI,CAAC,KAAK,gBACR,MAAM,IAAI,0BACR,2BACA,wFACF;EAGF,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,UAAU,aAAa;GAGhC,IAAI,KAAK,UAAU,WAAW,WAAW,oBAEnC;QAAA,CADa,qBAAqB,KAAK,QAAQ,QAAQ,kBAC/C,GAAG;GAAA;GAEjB,MAAM,OAAO,KAAK,cAAc,MAAM;GACtC,IAAI,CAAC,WAAW,IAAI,GAAG;GACvB,MAAM,QAAQ,aAAa,MAAM,MAAM,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO;GACnE,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI;IACJ,IAAI;KACF,SAAS,KAAK,MAAM,IAAI;IAC1B,QAAQ;KACN;IACF;IACA,IAAI,CAAC,cAAc,QAAQ,MAAM,MAAM,GAAG;IAC1C,IAAI,KAAK,MAAM;GACjB;EACF;EAGA,IAAI,MAAM,GAAG,MAAM;GACjB,IAAI,EAAE,eAAe,EAAE,YAAY,OAAO,iBAAiB,EAAE,YAAY,EAAE,UAAU;GACrF,OAAO,iBAAiB,EAAE,YAAY,EAAE,UAAU;EACpD,CAAC;EAED,OAAO,IAAI,MAAM,GAAG,KAAK,KAAK;CAChC;CAEA,MAAM,OAKH;EACD,MAAM,WAAmC,CAAC;EAC1C,MAAM,UAAsC;GAC1C,YAAY;GACZ,mBAAmB;GACnB,eAAe;EACjB;EACA,IAAI,QAAQ;EACZ,KAAK,MAAM,UAAU,aAAa;GAChC,MAAM,OAAO,KAAK,cAAc,MAAM;GACtC,IAAI,CAAC,WAAW,IAAI,GAAG;IACrB,SAAS,UAAU;IACnB;GACF;GACA,MAAM,QAAQ,aAAa,MAAM,MAAM,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO;GACnE,SAAS,UAAU,MAAM;GACzB,SAAS,MAAM;GACf,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,QAAoB;IACxB,IAAI;KACF,QAAS,KAAK,MAAM,IAAI,CAAC,CAA2B,cAAc;IACpE,QAAQ,CAER;IACA,QAAQ,UAAU;GACpB;EACF;EAIA,OAAO;GAAE,OAAO;GAAO,MAAM;GAAO;GAAU;EAAQ;CACxD;CAEA,iBAAyB,OAAmC;EAC1D,IAAI,CAAC,MAAM,QACT,MAAM,IAAI,0BACR,kBACA,wCACF;EAEF,IAAI,CAAC,MAAM,qBAAqB,MAAM,kBAAkB,WAAW,GACjE,MAAM,IAAI,0BACR,0BACA,kFACF;EAEF,IAAI,CAAC,MAAM,YACT,MAAM,IAAI,0BACR,uBACA,0DACF;EAEF,IAAI,CAAC,MAAM,iBACT,MAAM,IAAI,0BACR,4BACA,mHACF;EAEF,IAAI,CAAC,YAAY,SAAS,MAAM,MAAM,GACpC,MAAM,IAAI,0BACR,kBACA,+CAA+C,YAAY,KAAK,IAAI,GACtE;CAEJ;CAEA,gBAAwB,OAAmC;EACzD,MAAM,MAAM,KAAK,QAAQ;EACzB,IAAI,CAAC,OAAO,CAAC,MAAM,iBAAiB;EACpC,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,WAAW;EACjB,IAAI,QAAQ,KAAK,WAAW,IAAI,MAAM,eAAe;EACrD,IAAI,CAAC,SAAS,MAAM,MAAM,iBAAiB,UAAU;GACnD,QAAQ;IAAE,QAAQ,MAAM;IAAiB,eAAe;IAAK,OAAO;GAAE;GACtE,KAAK,WAAW,IAAI,MAAM,iBAAiB,KAAK;EAClD;EACA,IAAI,MAAM,SAAS,KACjB,MAAM,IAAI,0BACR,uBACA,gCAAgC,MAAM,gBAAgB,YAAY,IAAI,YACxE;EAEF,MAAM,SAAS;CACjB;CAEA,SAAiB,OAAoD;EACnE,MAAM,aAAaC,SACjB,KAAK,UAAU;GACb,IAAI,MAAM,SAAS;GACnB,KAAK,MAAM;GACX,IAAI,MAAM;GACV,KAAK,MAAM;EACb,CAAC,CACH;EAGA,OAAO;GACL,GAAG;GACH;GACA,OAAO;EACT;CACF;CAEA,cAAsB,QAAwB;EAC5C,OAAO,KAAK,KAAK,QAAQ,MAAM,GAAG,OAAO,OAAO;CAClD;AACF;AAEA,MAAM,cAAgD;CACpD;CACA;CACA;CACA;CACA;AACF;AAEA,SAAS,qBACP,QACA,QACS;CACT,IAAI,CAAC,QAAQ,OAAO;CACpB,IAAI,MAAM,QAAQ,MAAM,GAAG,OAAO,OAAO,SAAS,MAAM;CACxD,OAAO,WAAW;AACpB;AAEA,SAAS,cACP,QACA,MACA,QACS;CAET,IAAI,KAAK,UAAU,WAAW,OAAO,cAAc,KAAK,gBAAgB,OAAO;CAC/E,IAAI,KAAK,UAAU,UAAU,OAAO,aAAa,KAAK,gBAAgB,OAAO;CAE7E,MAAM,IAAI,KAAK;CACf,IAAI,CAAC,GAAG,OAAO;CACf,IAAI,EAAE,QAAQ,OAAO,SAAS,SAAS,EAAE,MAAM,OAAO;CACtD,IAAI,EAAE,QAEA;MAAA,EADY,MAAM,QAAQ,EAAE,MAAM,IAAI,EAAE,SAAS,CAAC,EAAE,MAAM,EAAA,CACjD,SAAS,MAAe,GAAG,OAAO;CAAA;CAEjD,IAAI,EAAE,iBAAiB,KAAA,KAAa,EAAE,iBAAiB,KAAA,GAAW;EAChE,MAAM,aAAa,OAAO,OAAO,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,EAAE,SAAS;EAC3E,MAAM,MAAM,WAAW,WAAW,IAAI,IAAI,KAAK,IAAI,GAAG,UAAU;EAChE,IAAI,EAAE,iBAAiB,KAAA,KAAa,MAAM,EAAE,cAAc,OAAO;EACjE,IAAI,EAAE,iBAAiB,KAAA,KAAa,MAAM,EAAE,cAAc,OAAO;CACnE;CACA,IAAI,EAAE,aAAa,KAAA,KAAa,eAAe,OAAO,UAAU,IAAI,eAAe,EAAE,QAAQ,GAC3F,OAAO;CAET,OAAO;AACT;AAEA,SAASA,SAAO,OAAuB;CACrC,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,EAAE;AACrE;AAEA,SAAS,WAAW,MAAc,MAAoB;CACpD,IAAI,WAAW,IAAI,GAEjB,cAAc,MADG,aAAa,MAAM,MACT,IAAI,IAAI;MAEnC,cAAc,MAAM,IAAI;AAE5B;;;;;;;;;;;;;;;;;;;;;;;;AC9RA,MAAM,SAAS;;;;;;;;;AAUf,SAAgB,eAAe,SAAyB;CACtD,OAAO,QAAQ,QAAQ,OAAO,MAAM;AACtC;;;;;;;;;;;;;;;;;;;;;ACcA,SAAgB,sBAAsB,SAAuD;CAC3F,MAAM,EAAE,SAAS;CACjB,IAAI,CAAC,OAAO,UAAU,IAAI,GACxB,MAAM,IAAI,UAAU,uDAAuD,OAAO,IAAI,GAAG;CAE3F,QAAQ,EAAE,UAAU,iBAAiB;EACnC,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,MAAM,0CAA0C;EAE5D,IAAI,SAAS,WAAW,GAAG,OAAO,SAAS;EAC3C,MAAM,4BAAY,IAAI,IAA0B;EAChD,KAAK,MAAM,EAAE,WAAW,cAAc,2BACpC,CAAC,GAAG,QAAQ,GACZ,mBAAmB,QAAQ,CAC7B,GACE,UAAU,IAAI,WAAW,QAAQ;EAEnC,MAAM,MAAM,WAAW,eAAe,MAAM,UAAU,CAAC;EACvD,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,SAAS,MAAM;EAChD,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,SAAS,SAAS,EAAE;EACvD,MAAM,SAAS,UAAU,QAAQ,SAAS,IAAI;EAC9C,MAAM,IAAI,SAAS;EACnB,MAAM,IAAI,SAAS;EACnB,OAAO,eAAe,GAAG,WAAW,WAAW,CAAC,GAAG,GAAG,WAAW,WAAW,CAAC,CAAC,KAAK,IAAI,IAAI;CAC7F;AACF;AAEA,SAAS,WAAW,WAA8C,QAA8B;CAC9F,MAAM,WAAW,UAAU,IAAI,MAAM;CACrC,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,MACR,2CAA2C,OAAO,YAAY,6CAChE;CAEF,OAAO;AACT;;AAGA,SAAS,eAAe,GAAiB,IAAY,GAAiB,IAAoB;CACxF,IAAI,OAAO,IAAI,OAAO,KAAK,KAAK,KAAK;CACrC,IAAI,EAAE,cAAc,EAAE,WAAW,OAAO,EAAE,YAAY,EAAE,YAAY,KAAK;CACzE,IAAI,EAAE,gBAAgB,EAAE,aAAa,OAAO;CAC5C,OAAO,EAAE,cAAc,EAAE,cAAc,KAAK;AAC9C;;AAGA,SAAS,mBAAmB,UAAkE;CAC5F,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,UAAU,UAAU,KAAK,MAAM,MAAM,OAAO,KAAK,OAAO,UAAU,GAAG,IAAI,IAAI,EAAE;CAC1F,IAAI,IAAI,SAAS,GACf,MAAM,IAAI,MAAM,6DAA6D;CAE/E,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,QAAQ;EAClC,MAAM;EACN,WAAW;EACX,QAAQ,WAAW;GACjB,MAAM,QAAQ,OAAO,WAAW;GAChC,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,MAAM,IAAI,MACR,2CAA2C,OAAO,YAAY,6BAA6B,GAAG,EAChG;GAEF,OAAO;EACT;CACF,EAAE;AACJ;AAEA,SAAS,eAAe,MAAc,YAA4B;CAChE,OAAQ,OAAO,KAAK,KAAK,aAAa,GAAG,UAAU,IAAK;AAC1D;;;;;;;;AC9CA,SAAgB,qBACd,QAC0C;CAC1C,OAAO,OAAO,SAAS,UAAU,QAAQ;EAEvC,OAAO,qBAAqB,MADP,OAAO,IAAI,UAAU;GAAE,GAAG;GAAK;EAAQ,CAAC,CAC3B;CACpC;AACF;;;;;;;AAaA,eAAsB,eACpB,OACA,OACA,kBAC2B;CAM3B,OAAO;EAAE,GAAG,MALU,iBACpB;GAAE,QAAQ,MAAM;GAAI,cAAc,MAAM;EAAa,GACrD,OACA,gBACF;EACqB,OAAO,MAAM;CAAM;AAC1C;;;;;;AAiBA,SAAgB,oBAAoB,UAAwD;CAC1F,MAAM,OAAwB,CAAC;CAC/B,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,EAAE,cAChB,KAAK,KAAK;EACR,SAAS,EAAE;EACX,YAAY,EAAE;EACd,OAAO,EAAE;EACT,UAAU,EAAE;EACZ,QAAQ,EAAE,YAAY,SAAS;EAC/B,UAAU,EAAE;CACd,CAAC;CAGL,OAAO;AACT;;AAmBA,SAAgB,kBAAkB,MAAmD;CACnF,MAAM,0BAAU,IAAI,IAA+C;CACnE,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,IAAI,QAAQ,IAAI,EAAE,OAAO,KAAK;GAAE,OAAO;GAAG,QAAQ;EAAE;EAC1D,EAAE;EACF,IAAI,EAAE,WAAW,QAAQ;GACvB,EAAE;GACF;EACF;EACA,QAAQ,IAAI,EAAE,SAAS,CAAC;CAC1B;CACA,IAAI,uBAAuB;CAC3B,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,IAAI,EAAE,QAAQ,KAAK,EAAE,WAAW,EAAE,OAAO;CAC3E,OAAO;EACL,SAAS,QAAQ;EACjB;EACA,cAAc,KAAK;EACnB;EACA,QAAQ,KAAK,SAAS;EACtB,UAAU,KAAK,WAAW,IAAI,IAAI,SAAS,KAAK;CAClD;AACF;AAWA,SAAS,WAAW,GAAmB;CACrC,OAAO,EAAE,QAAQ,OAAO,KAAK,CAAC,CAAC,QAAQ,UAAU,GAAG;AACtD;AAEA,SAAS,SAAS,GAAW,KAAqB;CAChD,OAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE;AACnE;;;;;;;;AASA,SAAgB,yBACd,MACA,OAAgC,CAAC,GACzB;CACR,MAAM,QAAQ,KAAK,oBAAoB;CACvC,MAAM,MAAM,kBAAkB,IAAI;CAClC,MAAM,OAAO,MAAc,GAAG,KAAK,MAAM,IAAI,GAAG,EAAE;CAClD,MAAM,MAAM,MAAgB,WAAW,SAAS,EAAE,KAAK,IAAI,GAAG,KAAK,CAAC,KAAK;CACzE,MAAM,MAAgB,CAAC,KAAK,KAAK,SAAS,sCAAsC,EAAE;CAClF,IAAI,KAAK,MAAM;EACb,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,IAAI,GAAG,IAAI,KAAK,OAAO,EAAE,MAAM,GAAG;EAC3E,IAAI,KAAK,EAAE;CACb;CACA,IAAI,KACF,KAAK,IAAI,qBAAqB,GAAG,IAAI,QAAQ,oCACtC,IAAI,OAAO,GAAG,IAAI,aAAa,2BAA2B,IAAI,IAAI,QAAQ,EAAE,QAC5E,IAAI,OAAO,UAClB,EACF;CACA,MAAM,QAAQ,KAAK,QAAQ,MAAM,EAAE,WAAW,MAAM;CACpD,IAAI,MAAM,SAAS,GAAG;EACpB,IAAI,KAAK,mBAAmB,IAAI,sCAAsC,qBAAqB;EAC3F,KAAK,MAAM,KAAK,OACd,IAAI,KAAK,KAAK,WAAW,EAAE,UAAU,EAAE,KAAK,WAAW,EAAE,QAAQ,EAAE,KAAK,GAAG,EAAE,QAAQ,EAAE,GAAG;EAE5F,IAAI,KAAK,EAAE;CACb,OACE,IAAI,KAAK,iDAAiD,EAAE;CAE9D,IAAI,KAAK,yBAAyB,EAAE;CACpC,KAAK,MAAM,WAAW,CAAC,GAAG,IAAI,IAAI,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG;EAC9D,MAAM,YAAY,KAAK,QAAQ,MAAM,EAAE,YAAY,OAAO;EAC1D,MAAM,SAAS,UAAU,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAAC;EAC5D,MAAM,OAAO,WAAW,UAAU,SAAS,MAAM;EACjD,IAAI,KACF,OAAO,WAAW,UAAU,EAAE,CAAE,UAAU,EAAE,KAAK,OAAO,GAAG,UAAU,OAAO,GAAG,QAC/E,IACA,uCACA,qBACF;EACA,KAAK,MAAM,KAAK,WACd,IAAI,KACF,KAAK,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,SAAS,WAAW,SAAS,KAAK,GAAG,EAAE,QAAQ,EAAE,GACjG;EAEF,IAAI,KAAK,EAAE;CACb;CACA,OAAO,IAAI,KAAK,IAAI;AACtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3KA,IAAa,qBAAb,cAAwC,eAAe;CACrD,YAAY,SAAiB;EAC3B,MAAM,kBAAkB,OAAO;CACjC;AACF;;;;;;AAyIA,SAAgB,8BAAqE,MAenF;CACA,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,cAAc,iBAAiB,KAAK,OAAO;CACjD,MAAM,YAAY,eAAe,KAAK,OAAO;CAC7C,MAAM,aAAa,IAAI;EACrB,SAAS;EACT,SAAS,KAAK,UAAU,CAAC,EAAA,CAAG,KAAK,UAAU,MAAM,IAAI;EACrD;EACA;EACA,aAAa,KAAK,eAAe;CACnC,CAAC;CACD,MAAM,cAAc,kBAAkB,IAAI;EACxC,WAAW,KAAK;EAChB,QAAQ,KAAK,eAAe;EAC5B;EACA;EACA;CACF,CAAC;CAQD,OAAO;EAAE;EAAa;EAAW;EAAY;EAAa,cAPrC,oBAAoB;GACvC,WAAW,KAAK;GAChB,QAAS,KAAK,UAAU,CAAC;GACzB;GACA;GACA;EACF,CACqE;CAAE;AACzE;AAEA,SAAS,SAAS,IAAoB;CACpC,OAAO,GAAG,QAAQ,mBAAmB,GAAG;AAC1C;AAEA,SAAS,IAAI,OAAwB;CACnC,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK;AACxE;AAEA,SAAS,KAAK,IAAsB;CAClC,OAAO,GAAG,WAAW,IAAI,IAAI,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;AAsBA,SAAS,cAAc,MAA6C;CAClE,MAAM,WAAW,KAAK,mBAAmB,KAAK,gBAAgB,CAAC,KAAK,aAAa,IAAI,CAAC;CACtF,OAAO,CAAC,GAAG,IAAI,IAAI,SAAS,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;AAC3E;AAEA,SAAS,mBAAmB,UAA6B;CACvD,OAAO,SAAS,SAAS,KAAK,SAAS,OAAO,UAAU,UAAA,SAAuB;AACjF;;AAGA,SAAS,YACP,MACA,WACA,eACQ;CACR,MAAM,WAAW,cAAc,IAAI;CAKnC,IAAI,KAAK,UAAU,KAAA,MAAc,SAAS,WAAW,KAAK,mBAAmB,QAAQ,IACnF,OAAO;CAET,IAAI,iBAAiB,aAAa,GAAG;EACnC,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,eACZ,MAAM,IAAI,mBACR,YAAY,UAAU,qBAAqB,MAAM,cAAc,KAAK,OAAO,6CAA6C,cAAc,EACxI;EAGJ,OAAO;CACT;CAEA,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,mBACR,YAAY,UAAU,kFAAkF,KAAK,OAAO,wEACtH;CAEF,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,CAAC,iBAAiB,KAAK,GACzB,MAAM,IAAI,mBACR,YAAY,UAAU,uBAAuB,MAAM,cAAc,KAAK,OAAO,oEAC/E;EAEF,IAAI,kBAAA,aAA0C,CAAC,gBAAgB,eAAe,KAAK,GACjF,MAAM,IAAI,mBACR,YAAY,UAAU,oBAAoB,cAAc,cAAc,KAAK,OAAO,iCAAiC,MAAM,EAC3H;CAEJ;CACA,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,mBACR,YAAY,UAAU,UAAU,KAAK,OAAO,iDAAiD,SAAS,KAAK,IAAI,GACjH;CAEF,OAAO,SAAS;AAClB;AAEA,SAAS,gBAAgB,UAAkB,UAA2B;CACpE,MAAM,eAAe,SAClB,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,wBAAwB,EAAE,CAAC,CACnC,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,iBAAiB,EAAE;CAC9B,OACE,iBAAiB,YACjB,aAAa,SAAS,IAAI,UAAU,KACpC,SAAS,SAAS,IAAI,cAAc;AAExC;AAEA,SAAS,eACP,MACW;CACX,MAAM,EAAE,MAAM,SAAS,aAAa,YAAY,cAAc,UAAU,WAAW,aACjF;CACF,MAAM,YAAY,eAAe,OAAO;CAKxC,MAAM,QAAQ,YAAY,MAAM,WAJV,oBAAoB,OAIa,CAAC;CAExD,MAAM,SAAS,wBADK,qBAAqB,IACQ,GAAG;EAClD,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,KAAK;EACxC;EACA,aAAa;EACb;EACA,YAAY;EACZ;EACA;EACA;EACA,cAAc,KAAK;CACrB,CAAC;CAKD,IAAI,KAAK,cAAc,KAAK,UAC1B,IAAI;EACF,MAAM,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,QAAQ;EACzD,IAAI,QAAQ,OAAO,KAAK,WAAW,YAAY,OAAO,KAAK,eAAe,UAAU;GAClF,OAAO,SAAS,KAAK;GACrB,OAAO,aAAa,KAAK;EAC3B;CACF,QAAQ,CAER;CAEF,OAAO;AACT;;;;;;;;AASA,SAAS,qBACP,MAC+B;CAC/B,IAAI,KAAK,UAAU,KAAA,GAAW,OAAO;CAErC,MAAM,uBAAuB,cAAc,IAAI,CAAC,CAAC,MAAM,UAAU,UAAU,aAAa;CACxF,OAAO;EACL,GAAG;EACH,YACE,KAAK,WAAW,gBAAgB,SAAS,uBACrC,KAAK,aACL;GAAE,GAAG,KAAK;GAAY,aAAa;EAAM;EAC/C,gBACE,CAAC,wBAAwB,KAAK,eAAe,SAAS,cAAc,KAAK,YAAY,IACjF;GAAE,MAAM;GAAc,KAAK;EAAK,IAChC,KAAK;CACb;AACF;;;;AAKA,eAAsB,iBACpB,MACuD;CACvD,IAAI,KAAK,SAAS,WAAW,GAAG,MAAM,IAAI,mBAAmB,4BAA4B;CACzF,IAAI,KAAK,UAAU,WAAW,GAAG,MAAM,IAAI,mBAAmB,6BAA6B;CAE3F,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,gBAAgB,KAAK,aAAa;CACxC,MAAM,wBAAwB,KAAK,yBAAyB;CAC5D,MAAM,aAAa,KAAK,SAAS,IAAI,cAAc;CACnD,IAAI,KAAK,gBAAgB,KAAA,KAAa,KAAK,YAAY,KAAK,CAAC,CAAC,WAAW,GACvE,MAAM,IAAI,mBAAmB,sDAAsD;CAErF,MAAM,sBAAsB,WAAW,QAAQ,IAAI,UAAU,WAAW,QAAQ,EAAE,MAAM,KAAK;CAC7F,IAAI,oBAAoB,SAAS,GAC/B,MAAM,IAAI,mBACR,oDAAoD,CAAC,GAAG,IAAI,IAAI,mBAAmB,CAAC,CAAC,CAAC,KAAK,IAAI,GACjG;CAEF,MAAM,eACJ,KAAK,gBACL,MAAM,IAAI;EAAE;EAAY,WAAW,KAAK,UAAU,KAAK,MAAM,EAAE,EAAE;CAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;CACnF,MAAM,kBAAkB,OAAO,IAAI;EACjC;EACA;EACA;EACA;EACA,WAAW,KAAK;EAChB,aAAa,KAAK,eAAe;CACnC,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;CACd,MAAM,WAAW,KAAK,YAAY;CAClC,IAAI,OAAO,aAAa,YAAY,SAAS,KAAK,CAAC,CAAC,WAAW,GAC7D,MAAM,IAAI,mBAAmB,mDAAmD;CAGlF,MAAM,eAAe,IAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAOjE,KAAK,MAAM,WAAW,KAAK,UAAU;EACnC,MAAM,cAAc,iBAAiB,OAAO;EAC5C,MAAM,YAAY,eAAe,OAAO;EACxC,MAAM,gBAAgB,oBAAoB,OAAO;EACjD,MAAM,QAAQ,iBAAiB,aAAa,IACxC,gBACA,GAAG,cAAc;EACrB,IAAI;GACF,kBAAkB;IAChB,OAAO,GAAG,SAAS,GAAG,UAAU;IAChC;IACA,aAAa;IACb;IACA;IACA,YAAY;IACZ,YAAY;IACZ,WAAW,KAAK;IAChB,QAAQ;IACR,SAAS;IACT,gBAAgB;KAAE,MAAM;KAAc,KAAK;IAAK;IAChD,YAAY;KAAE,OAAO;KAAG,QAAQ;IAAE;IAClC,iBAAiB;IACjB,SAAS,EAAE,KAAK,EAAE,uBAAuB,EAAE,EAAE;IAC7C;IACA,YAAY;GACd,CAAC;EACH,SAAS,KAAK;GACZ,MAAM,IAAI,mBACR,YAAY,UAAU,uBAAuB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAC9F;EACF;CACF;CAEA,MAAM,UAAuB,CAAC;CAC9B,MAAM,YAAkE,CAAC;CACzE,MAAM,YAA4C,CAAC;CAEnD,MAAM,UAAU,MAAM,cACpB,KAAK,UACL,uBACA,OAAO,SAAS,QAAQ,WAAW;EAWjC,MAAM,EAAE,aAAa,WAAW,YAAY,gBAV3B,8BAA8B;GAC7C;GACA,WAAW,KAAK;GAChB,QAAQ,KAAK;GACb,WAAW,KAAK;GAChB,aAAa,KAAK;GAClB;GACA;GACA,MAAM,KAAK;EACb,CACmE;EACnE,MAAM,gBAAgB,oBAAoB,OAAO;EAIjD,MAAM,YAAY,UAAqB,QACrC,KAAK,SAAS,SAAS,UAAU,GAAG;EACtC,OAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,WAAW,SAAS,SAAS,IAAI,CAAC;EAEnF,MAAM,WAAW,MAAM,YAAkC;GACvD,WAAW,KAAK;GAChB;GACA;GACA;GACA,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,gBAAgB,KAAK;GACrB,aAAa,KAAK;GAClB,YAAY,KAAK,aACZ,EAAE,UAAU,UAAU,KAAK,YAAY;IAAE;IAAS;IAAU;GAAI,CAAC,KAAK,QACvE,KAAA;GACJ,kBAAkB,KAAK;GACvB,cAAc,KAAK;GACnB,eAAe,KAAK;GACpB,SAAS,KAAK;GACd,KAAK,KAAK;GACV,QAAQ,KAAK,KAAK,QAAQ,SAAS,SAAS,CAAC;EAC/C,CAAC;EAUD,MAAM,OAAO,cAAc,OAAO;EAClC,MAAM,qBAAqB,cACzB,sBAAsB;GACpB;GACA,eAAe;IAAE,MAAM;IAA2B,MAAM;GAAY;GACpE,GAAI,aAAa,cAAA,YAA8B,EAAE,OAAO,UAAU,IAAI,CAAC;GACvE,GAAI,OAAO,EAAE,SAAS,EAAE,IAAI,KAAK,QAAQ,EAAE,IAAI,CAAC;EAClD,CAAC;EAGH,MAAM,qBAAqB,iBAAiB,aAAa,IACrD,MAAM,kBAAkB,aAAa,IACrC,KAAA;EAEJ,MAAM,iBAA8B,CAAC;EACrC,KAAK,MAAM,QAAQ,SAAS,OAAO;GACjC,MAAM,YAAY,YAAY,MAAM,WAAW,aAAa;GAC5D,MAAM,mBACJ,cAAA,YACI,MAAM,kBAAkB,IACvB,sBAAuB,MAAM,kBAAkB,SAAS;GAC/D,MAAM,SAAS,eAAe;IAC5B;IACA;IACA;IACA;IACA;IACA;IACA,WAAW,KAAK;IAChB;IACA;IACA,UAAU,aAAa,IAAI,KAAK,UAAU;IAC1C,YAAY,KAAK;GACnB,CAAC;GACD,IAAI,UAAU,kBAAkB,MAAM;GACtC,eAAe,KAAK,MAAM;EAC5B;EAEA,MAAM,iBAAiB,CACrB,GAAG,IAAI,IACL,eACG,KAAK,WAAW,OAAO,KAAK,CAAC,CAC7B,QAAQ,UAA2B,UAAU,aAAa,CAC/D,CACF;EACA,IAAI,eAAe,SAAS,GAC1B,MAAM,IAAI,mBACR,YAAY,UAAU,0CAA0C,eAAe,KAAK,IAAI,GAC1F;EAGF,MAAM,iBAAiB,SAAS,WAAW,KAAK;EAChD,MAAM,eAAe,eAAe,SAAS,eAAe,OAAO,eAAe;EAClF,OAAO;GACL;GACA;GACA,SAAS;GACT,SAAS;IACP;IACA;IACA,OAAO,eAAe,MAAA;IACtB,SAAS,eAAe;IACxB,eAAe,WACb,eAAe,IAAI,OAAO,CAAC,CAAC,QAAQ,UAA2B,UAAU,KAAA,CAAS,CACpF;IACA;IACA;IACA,WAAW,0BAA0B,cAAc;GACrD;EACF;CACF,CACF;CAGA,KAAK,MAAM,UAAU,SAAS;EAC5B,UAAU,OAAO,aAAa,OAAO;EACrC,UAAU,OAAO,aAAa,OAAO;EACrC,QAAQ,KAAK,GAAG,OAAO,OAAO;CAChC;CAGA,MAAM,YAAY,0BAA0B,OAAO;CACnD,IAAI,kBAAkB,UACpB,kBAAkB,SAAS,EAAE,YAAY,KAAK,cAAc,KAAK,CAAC;MAC7D,IAAI,kBAAkB,UAAU,UAAU,YAAY,QAE3D,QAAQ,KACN,yCAAyC,UAAU,QAAQ,KAAK,UAAU,WAC5E;CASF,OAAO;EAAE;EAAU;EAAc;EAAS;EAAW,YALlC,OAAO,UAAU,MAAM,EAAE,UAKkB;EAAG,WAJ/C,KAAK,YACnB,gBAAgB,SAAS,KAAK,WAAW,KAAK,SAAS,IACvD,KAAA;EAEwE;EAAW;CAAU;AACnG;;;;AAKA,SAAS,QAAQ,GAAkC;CACjD,OAAO,aAAa,CAAC;AACvB;AAEA,SAAS,WAAW,QAAiC;CACnD,OAAO,OAAO,WAAW,IAAI,OAAO,KAAK,MAAM;AACjD;AAEA,SAAS,OACP,SACA,OACgC;CAChC,MAAM,yBAAS,IAAI,IAAsB;CACzC,KAAK,MAAM,KAAK,SAAS;EACvB,MAAM,MAAM,MAAM,CAAC;EACnB,IAAI,QAAQ,KAAA,GAAW;EACvB,MAAM,QAAQ,QAAQ,CAAC;EACvB,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,MAAM,OAAO,IAAI,GAAG,KAAK,CAAC;EAChC,IAAI,KAAK,KAAK;EACd,OAAO,IAAI,KAAK,GAAG;CACrB;CACA,MAAM,MAAsC,CAAC;CAC7C,KAAK,MAAM,CAAC,KAAK,OAAO,QAAQ,IAAI,OAAO;EAAE,eAAe,KAAK,EAAE;EAAG,GAAG,GAAG;CAAO;CACnF,OAAO;AACT;AAEA,SAAS,gBACP,SACA,WACA,WACgC;CAChC,MAAM,sCAAsB,IAAI,IAAoB;CACpD,KAAK,MAAM,KAAK,WAAW,oBAAoB,IAAI,EAAE,IAAI,UAAU,CAAC,CAAC;CACrE,OAAO,OAAO,UAAU,MAAO,EAAE,aAAa,oBAAoB,IAAI,EAAE,UAAU,IAAI,KAAA,CAAU;AAClG;;;;;;;;;;;;;ACxqBA,MAAM,YAAY;AAClB,MAAM,gBAAgB;AAEtB,IAAM,8BAAN,cAA0C,mBAAmB;CAC3D,YAAY,SAAiB;EAC3B,MAAM,qBAAqB,SAAS;CACtC;AACF;AAsGA,SAAgB,wBACd,MACyC;CACzC,IAAI,CAAC,MAAM,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,WAAW,GAC5D,MAAM,IAAI,4BAA4B,4BAA4B;CAEpE,IAAI,CAAC,MAAM,QAAQ,KAAK,SAAS,KAAK,KAAK,UAAU,WAAW,GAC9D,MAAM,IAAI,4BAA4B,6BAA6B;CAErE,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,WAAW,KAAK,YAAY;CAClC,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,WAAW,KAAK,YAAY;CAClC,IAAI,OAAO,KAAK,cAAc,YAAY,KAAK,UAAU,KAAK,CAAC,CAAC,WAAW,GACzE,MAAM,IAAI,4BAA4B,sCAAsC;CAE9E,IAAI,OAAO,KAAK,gBAAgB,YAAY,KAAK,YAAY,KAAK,CAAC,CAAC,WAAW,GAC7E,MAAM,IAAI,4BACR,yEACF;CAEF,qBAAqB,KAAK,WAAW,IAAI;CAEzC,MAAM,WAAW,CAAC,GAAG,KAAK,QAAQ;CAClC,MAAM,YAAY,CAAC,GAAG,KAAK,SAAS;CACpC,MAAM,SAAS,CAAC,GAAI,KAAK,UAAU,CAAC,CAAE;CACtC,MAAM,aAAa,SAAS,IAAI,cAAc;CAC9C,MAAM,oBAAoB,WAAW,QAAQ,IAAI,UAAU,WAAW,QAAQ,EAAE,MAAM,KAAK;CAC3F,IAAI,kBAAkB,SAAS,GAC7B,MAAM,IAAI,4BACR,0BAA0B,CAAC,GAAG,IAAI,IAAI,iBAAiB,CAAC,CAAC,CAAC,KAAK,IAAI,GACrE;CAGF,MAAM,eACJ,KAAK,gBACL,MAAM,YAAY;EAAE;EAAY,WAAW,UAAU,KAAK,aAAa,SAAS,EAAE;CAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;CACpG,IAAI,aAAa,KAAK,CAAC,CAAC,WAAW,GACjC,MAAM,IAAI,4BAA4B,gCAAgC;CAmCxE,MAAM,aAAa,UAAU,YAAY;EA/BvC,QAAQ;EACR,UAAU,SAAS,KAAK,SAAS,WAAW;GAC1C,SAAS;GACT,IAAI,WAAW;GACf,MAAM,UAAU,iBAAiB,OAAO;GACxC;EACF,EAAE;EACF,WAAW,UAAU,KAAK,UAAU,WAAW;GAC7C,SAAS;GACT,UAAU,yBAAyB,QAAQ;GAC3C;EACF,EAAE;EACF,QAAQ,OAAO,KAAK,WAAW;GAC7B,MAAM,MAAM;GACZ,YAAY,MAAM;GAClB,cAAc,MAAM,gBAAgB;GACpC,OAAO,MAAM,MAAM,SAAS;GAC5B,WAAW,MAAM,WAAW,SAAS,KAAK;EAC5C,EAAE;EACF;EACA;EACA;EACA,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB;EACA;EACA;EACA;EACA,WAAW,KAAK,WAAW,SAAS,KAAK;EACzC,YAAY,KAAK,YAAY,SAAS,KAAK;CAEW,CAAC;CACzD,MAAM,WAAW,OAAO,WAAW,MAAM,GAAkB,EAAqB;CAChF,MAAM,OAA2B,CAAC;CAClC,MAAM,8BAAc,IAAI,IAAY;CACpC,IAAI,UAAU;CACd,KAAK,MAAM,aAAa,YACtB,KAAK,MAAM,YAAY,WACrB,KAAK,IAAI,MAAM,GAAG,MAAM,MAAM,OAAO,GAAG;EACtC,MAAM,SAAS,GAAG,SAAS,GAAG,GAAG;EACjC,IAAI,YAAY,IAAI,GAAG,UAAU,GAAG,QAAQ,GAC1C,MAAM,IAAI,4BACR,+CAA+C,UAAU,GAAG,OAAO,EACrE;EAEF,YAAY,IAAI,GAAG,UAAU,GAAG,QAAQ;EACxC,KAAK,KAAK;GACR,OAAO,OAAO,YAAY;IAAE;IAAU;IAAW,YAAY,SAAS;IAAI;GAAI,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE;GAC5F;GACA;GACA,YAAY,SAAS;GACrB;EACF,CAAC;EACD,WAAW;CACb;CAIJ,OAAO,OAAO,OAAO;EACnB,eAAe;EACf;EACA;EACA;EACA,UAAU,OAAO,OAAO,QAAQ;EAChC,WAAW,OAAO,OAAO,SAAS;EAClC,QAAQ,OAAO,OAAO,MAAM;EAC5B;EACA;EACA;EACA,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB;EACA;EACA;EACA,GAAI,KAAK,cAAc,KAAA,IAAY,CAAC,IAAI,EAAE,WAAW,KAAK,UAAU;EACpE,GAAI,KAAK,eAAe,KAAA,IAAY,CAAC,IAAI,EAAE,YAAY,KAAK,WAAW;EACvE,MAAM,OAAO,OAAO,IAAI;CAC1B,CAAC;AACH;AAEA,eAAsB,wBACpB,MAC2D;CAC3D,MAAM,YAAY,kBAAkB,KAAK,WAAW,WAAW;CAC/D,MAAM,UAAU,KAAK,WAAW,kBAAkB;CAClD,MAAM,SAAS,cAAc,KAAK,MAAM;CACxC,WAAW,KAAK,IAAI;CACpB,MAAM,WAAW,cAAc,KAAK,MAAM,KAAK,IAAI;CACnD,eAAe,SAAS,QAAQ,YAAY,KAAK,IAAI,CAAC;CACtD,aAAa,SAAS,QAAQ,KAAK,MAAM,WAAW,QAAQ;CAE5D,MAAM,cAAc,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC;CAC5D,MAAM,qBAAqB,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC;CAKvE,MAAM,SAAS,MAAM,iBAAuC;EAC1D,UALe,KAAK,KAAK,SAAS,QAAQ,YAC1C,mBAAmB,IAAI,eAAe,OAAO,CAAC,CAIvC;EACP,WAAW,CAAC,GAAG,KAAK,KAAK,SAAS;EAClC,UAAU,KAAK;EACf,QAAQ,CAAC,GAAG,KAAK,KAAK,MAAM;EAC5B;EACA,WAAW,KAAK,KAAK;EACrB,aAAa,KAAK,KAAK;EACvB,cAAc,KAAK,KAAK;EACxB,UAAU,KAAK,KAAK;EACpB,UAAU,KAAK,KAAK;EACpB,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,KAAK;EAChB,WAAW;EACX,YAAY,KAAK,KAAK;EACtB,gBAAgB,KAAK;EACrB,uBAAuB,KAAK;EAC5B,aAAa,KAAK;EAClB,cAAc,KAAK;EACnB,eAAe,KAAK;EACpB;EACA,KAAK,KAAK;EACV,WAAW,KAAK,KAAK;EACrB,UAAU,KAAK,KAAK;EACpB,YAAY,KAAK,KAAK;EACtB,kBAAkB;EAClB,YAAY,EAAE,SAAS,UAAU,UAC/B,YAAY,IAAI,SAAS,KAAK,MAAM,eAAe,OAAO,GAAG,SAAS,IAAI,GAAG,CAAC;CAClF,CAAC;CAED,oBAAoB,SAAS,QAAQ,MAAM;CAC3C,MAAM,WAAW,aAAa,SAAS,QAAQ,KAAK,IAAI;CACxD,OAAO;EAAE;EAAW,QAAQ,SAAS,KAAK,QAAQ,IAAI,KAAK;EAAG;EAAQ;CAAS;AACjF;AAEA,eAAsB,sBACpB,MAC6D;CAC7D,MAAM,UAAU,KAAK,WAAW,kBAAkB;CAClD,MAAM,SAAS,cAAc,KAAK,MAAM;CACxC,WAAW,KAAK,IAAI;CACpB,eAAe,SAAS,QAAQ,YAAY,KAAK,IAAI,CAAC;CACtD,MAAM,SAAS,kBAAkB,SAAS,MAAM;CAChD,qBAAqB,KAAK,MAAM,MAAM;CACtC,MAAM,WAAW,aAAa,SAAS,QAAQ,KAAK,IAAI;CACxD,IAAI,SAAS,QAAQ,SAAS,GAC5B,MAAM,IAAI,4BACR,sCAAsC,SAAS,QAAQ,KAAK,IAAI,GAClE;CAGF,MAAM,SAAS,MAAM,iBAAuC;EAC1D,UAAU,CAAC,GAAG,KAAK,KAAK,QAAQ;EAChC,WAAW,CAAC,GAAG,KAAK,KAAK,SAAS;EAClC,UAAU,YAAY;GACpB,MAAM,IAAI,4BACR,wGACF;EACF;EACA,QAAQ,CAAC,GAAG,KAAK,KAAK,MAAM;EAC5B;EACA,WAAW,KAAK,KAAK;EACrB,aAAa,KAAK,KAAK;EACvB,cAAc,KAAK,KAAK;EACxB,UAAU,KAAK,KAAK;EACpB,UAAU,KAAK,KAAK;EACpB,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,KAAK;EAChB,WAAW,KAAK,KAAK;EACrB,YAAY,KAAK,KAAK;EACtB,gBAAgB,KAAK;EACrB,uBAAuB,KAAK;EAC5B;EACA,KAAK,KAAK;EACV,WAAW,KAAK,KAAK;EACrB,UAAU,KAAK,KAAK;EACpB,YAAY,KAAK,KAAK;EACtB,kBAAkB;CACpB,CAAC;CACD,gBAAgB,KAAK,MAAM,MAAM;CACjC,OAAO;EAAE,GAAG;EAAQ;CAAS;AAC/B;AAwBA,SAAS,YACP,MACyB;CACzB,OAAO;EACL,eAAe;EACf,UAAU,KAAK;EACf,cAAc,KAAK;EACnB,YAAY,KAAK;EACjB,UAAU,KAAK,SAAS,KAAK,aAAa;GACxC,IAAI,eAAe,OAAO;GAC1B,MAAM,UAAU,iBAAiB,OAAO;EAC1C,EAAE;EACF,WAAW,KAAK,UAAU,KAAK,aAAa,yBAAyB,QAAQ,CAAC;EAC9E,MAAM,KAAK;EACX,MAAM,KAAK;EACX,UAAU,KAAK;EACf,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB,MAAM,CAAC,GAAG,KAAK,IAAI;CACrB;AACF;AAEA,SAAS,WACP,MACM;CACN,MAAM,UAAU,wBAAwB;EACtC,UAAU,CAAC,GAAG,KAAK,QAAQ;EAC3B,WAAW,CAAC,GAAG,KAAK,SAAS;EAC7B,QAAQ,CAAC,GAAG,KAAK,MAAM;EACvB,WAAW,KAAK;EAChB,aAAa,KAAK;EAClB,cAAc,KAAK;EACnB,UAAU,KAAK;EACf,MAAM,KAAK;EACX,MAAM,KAAK;EACX,WAAW,KAAK;EAChB,YAAY,KAAK;EACjB,UAAU,KAAK;EACf,WAAW,KAAK;EAChB,YAAY,KAAK;CACnB,CAAC;CACD,IACE,QAAQ,eAAe,KAAK,cAC5B,QAAQ,aAAa,KAAK,YAC1B,cAAc,QAAQ,IAAI,MAAM,cAAc,KAAK,IAAI,GAEvD,MAAM,IAAI,4BAA4B,gDAAgD;AAE1F;AAEA,SAAS,eACP,SACA,QACA,UACM;CACN,QAAQ,UAAU,MAAM;CACxB,MAAM,OAAO,KAAK,QAAQ,SAAS;CAEnC,IADiB,QAAQ,KAAK,IACnB,MAAM,KAAA,GAAW;EAC1B,MAAM,UAAU,GAAG,cAAc,QAAQ,EAAE;EAC3C,IAAI,QAAQ,OAAO,MAAM,SAAS,CAAC,MAAM,KAAA,GAAW;CACtD;CACA,MAAM,YAAY,QAAQ,KAAK,IAAI;CACnC,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,4BAA4B,8BAA8B;CAEtE,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,SAAS;CAC/B,QAAQ;EACN,MAAM,IAAI,4BAA4B,gCAAgC;CACxE;CACA,IAAI,cAAc,MAAM,MAAM,cAAc,QAAQ,GAClD,MAAM,IAAI,4BACR,4DACF;AAEJ;AAEA,SAAS,cACP,MACA,MACoB;CACpB,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAW,GAC1C,MAAM,IAAI,4BAA4B,wCAAwC;CAEhF,MAAM,OAAO,IAAI,IAAI,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC7D,MAAM,WAA+B,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,SAAS,MAAM;EACxB,MAAM,QAAQ,OAAO,UAAU,WAAW,QAAQ,OAAO;EACzD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,4BAA4B,mCAAmC;EAE3E,IAAI,KAAK,IAAI,KAAK,GAChB,MAAM,IAAI,4BAA4B,kBAAkB,MAAM,aAAa;EAC7E,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,IAAI,CAAC,KAAK,MAAM,IAAI,4BAA4B,QAAQ,MAAM,8BAA8B;EAC5F,IAAI,OAAO,UAAU,YAAY,cAAc,KAAK,MAAM,cAAc,GAAG,GACzE,MAAM,IAAI,4BAA4B,QAAQ,MAAM,uCAAuC;EAE7F,KAAK,IAAI,KAAK;EACd,SAAS,KAAK,GAAG;CACnB;CACA,OAAO,SAAS,MAAM,MAAM,UAAU,KAAK,UAAU,MAAM,OAAO;AACpE;AAEA,SAAS,aACP,SACA,QACA,MACA,WACA,UACM;CACN,MAAM,OAAO,KAAK,QAAQ,aAAa;CACvC,MAAM,WAAW,cAAc;EAC7B,eAAe;EACf;EACA,YAAY,KAAK;EACjB,QAAQ,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC,CAAC,KAAK;CAChD,CAAwB;CACxB,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG;EAC/C,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK;EAClC,MAAM,SAAS,mBAAmB,KAAK,IAAI;EAC3C,MAAM,WAAW,OAAO,MAAM,UAAU,MAAM,cAAc,SAAS;EACrE,IAAI,UAAU;GACZ,IAAI,cAAc,QAAQ,MAAM,UAC9B,MAAM,IAAI,4BACR,YAAY,UAAU,mDACxB;GAEF;EACF;EACA,MAAM,cAAc,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC;EAC5D,MAAM,UAAU,OAAO,SAAS,UAC9B,MAAM,OACH,QAAQ,UAAU,YAAY,IAAI,KAAK,CAAC,CAAC,CACzC,KAAK,UAAU,GAAG,MAAM,IAAI,MAAM,UAAU,EAAE,CACnD;EACA,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,4BACR,yCAAyC,QAAQ,KAAK,IAAI,GAC5D;EAEF,MAAM,QAAQ,GAAG,SAAS;EAE1B,IADa,QAAQ,OAAO,MAAM,OAAO,WAAW,GAAG,CAChD,MAAM,KAAA,GAAW;CAC1B;CACA,MAAM,IAAI,4BACR,4BAA4B,UAAU,2BACxC;AACF;AAEA,SAAS,kBAAkB,SAA0B,QAAgC;CACnF,MAAM,OAAO,KAAK,QAAQ,aAAa;CACvC,MAAM,MAAM,QAAQ,KAAK,IAAI;CAC7B,IAAI,QAAQ,KAAA,GAAW,OAAO,CAAC;CAC/B,OAAO,mBAAmB,KAAK,IAAI;AACrC;AAEA,SAAS,mBAAmB,KAAa,MAA8B;CACrE,MAAM,SAAyB,CAAC;CAChC,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,MAAM,CAAC,OAAO,SAAS,IAAI,MAAM,IAAI,CAAC,CAAC,QAAQ,GAAG;EACrD,IAAI,KAAK,KAAK,MAAM,IAAI;EACxB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,IAAI;EAC1B,QAAQ;GACN,MAAM,IAAI,4BAA4B,kCAAkC,KAAK,GAAG,QAAQ,GAAG;EAC7F;EACA,IAAI,cAAc,MAAM,MAAM,MAC5B,MAAM,IAAI,4BACR,wCAAwC,KAAK,GAAG,QAAQ,GAC1D;EAEF,MAAM,QAAQ;EACd,IACE,MAAM,kBAAkB,KACxB,OAAO,MAAM,cAAc,YAC3B,OAAO,MAAM,eAAe,YAC5B,CAAC,MAAM,QAAQ,MAAM,MAAM,KAC3B,MAAM,OAAO,MAAM,UAAU,OAAO,UAAU,QAAQ,KACtD,IAAI,IAAI,MAAM,MAAM,CAAC,CAAC,SAAS,MAAM,OAAO,QAE5C,MAAM,IAAI,4BACR,4CAA4C,KAAK,GAAG,QAAQ,GAC9D;EAEF,IAAI,aAAa,IAAI,MAAM,SAAS,GAClC,MAAM,IAAI,4BAA4B,qCAAqC,MAAM,UAAU,EAAE;EAE/F,aAAa,IAAI,MAAM,SAAS;EAChC,MAAM,aAAa;GACjB,eAAe;GACf,WAAW,MAAM;GACjB,YAAY,MAAM;GAClB,QAAQ,CAAC,GAAG,MAAM,MAAM,CAAC,CAAC,KAAK;EACjC;EACA,KAAK,MAAM,SAAS,WAAW,QAAQ;GACrC,MAAM,QAAQ,SAAS,IAAI,KAAK;GAChC,IAAI,OACF,MAAM,IAAI,4BACR,kCAAkC,MAAM,aAAa,MAAM,SAAS,WAAW,UAAU,EAC3F;GAEF,SAAS,IAAI,OAAO,WAAW,SAAS;EAC1C;EACA,OAAO,KAAK,UAAU;CACxB;CACA,OAAO;AACT;AAEA,SAAS,qBACP,MACA,QACM;CACN,MAAM,WAAW,IAAI,IAAI,KAAK,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC;CAC1D,MAAM,0BAAU,IAAI,IAAY;CAChC,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,MAAM,eAAe,KAAK,YAC5B,MAAM,IAAI,4BACR,YAAY,MAAM,UAAU,uCAC9B;EAEF,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,IAAI,CAAC,SAAS,IAAI,KAAK,GACrB,MAAM,IAAI,4BACR,YAAY,MAAM,UAAU,8BAA8B,MAAM,EAClE;GAEF,QAAQ,IAAI,KAAK;EACnB;CACF;CACA,MAAM,gBAAgB,KAAK,KAAK,QAAQ,QAAQ,CAAC,QAAQ,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,KAAK;CAC/F,IAAI,cAAc,SAAS,GACzB,MAAM,IAAI,4BACR,+CAA+C,cAAc,KAAK,IAAI,GACxE;AAEJ;AAEA,SAAS,oBACP,SACA,QACA,QACM;CACN,KAAK,MAAM,CAAC,WAAW,aAAa,OAAO,QAAQ,OAAO,SAAS,GACjE,KAAK,MAAM,QAAQ,SAAS,OAAO;EACjC,MAAM,OAAO,cAAc,KAAK,QAAQ,iBAAiB,SAAS,CAAC,GAAG,KAAK,MAAM;EACjF,QAAQ,UAAU,QAAQ,IAAI,CAAC;EAG/B,QAAQ,MAAM,MAAM,GAAG,KAAK,UAAU,IAAI,EAAE,GAAG;CACjD;AAEJ;AAEA,SAAS,aACP,SACA,QACA,MACuB;CACvB,MAAM,yBAAyB,IAAI,IACjC,KAAK,SAAS,KAAK,YAAY;EAC7B,MAAM,WAAW,8BAA8B;GAC7C;GACA,WAAW,CAAC,GAAG,KAAK,SAAS;GAC7B,QAAQ,CAAC,GAAG,KAAK,MAAM;GACvB,WAAW,KAAK;GAChB,aAAa,KAAK;GAClB,UAAU,KAAK;GACf,MAAM,KAAK;GACX,MAAM,KAAK;EACb,CAAC;EACD,OAAO,CAAC,SAAS,WAAW,SAAS,YAAY;CACnD,CAAC,CACH;CACA,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAmB,CAAC;CAC1B,MAAM,YAAsB,CAAC;CAC7B,IAAI,UAAU;CACd,KAAK,MAAM,OAAO,KAAK,MAAM;EAC3B,MAAM,OAAO,cACX,KAAK,QAAQ,iBAAiB,IAAI,SAAS,CAAC,GAC5C,GAAG,IAAI,WAAW,GAAG,IAAI,KAC3B;EACA,MAAM,MAAM,QAAQ,KAAK,IAAI;EAC7B,IAAI,QAAQ,KAAA,GAAW;GACrB,QAAQ,KAAK,IAAI,KAAK;GACtB;EACF;EACA,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,GAAG;EACzB,QAAQ;GACN,MAAM,IAAI,4BAA4B,SAAS,IAAI,MAAM,mBAAmB;EAC9E;EACA,IAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GACvE,MAAM,IAAI,4BAA4B,SAAS,IAAI,MAAM,8BAA8B;EAEzF,MAAM,OAAO;EACb,IACE,KAAK,WAAW,GAAG,IAAI,WAAW,GAAG,IAAI,SACzC,KAAK,eAAe,IAAI,cACxB,KAAK,QAAQ,IAAI,OACjB,KAAK,iBAAiB,uBAAuB,IAAI,IAAI,SAAS,GAE9D,MAAM,IAAI,4BACR,SAAS,IAAI,MAAM,uDACrB;EAEF,IAAI;GACF,2BAA2B,IAAI;EACjC,SAAS,OAAO;GACd,MAAM,IAAI,4BACR,SAAS,IAAI,MAAM,mCAAmC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAC7G;EACF;EACA,WAAW;EACX,IAAI,KAAK,UAAU,KAAA,GAAW;GAC5B,OAAO,KAAK,IAAI,KAAK;GACrB;EACF;EACA,IAAI,2BAA2B,IAAI,CAAC,CAAC,UAAU,GAAG,UAAU,KAAK,IAAI,KAAK;CAC5E;CACA,OAAO;EACL,UAAU,KAAK,KAAK;EACpB;EACA;EACA;EACA;CACF;AACF;AAEA,SAAS,gBACP,MACA,QACM;CACN,MAAM,WAAW,IAAI,IAAI,KAAK,KAAK,KAAK,QAAQ,GAAG,IAAI,UAAU,GAAG,IAAI,WAAW,GAAG,IAAI,KAAK,CAAC;CAChG,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,UAAU,OAAO,SAAS;EACnC,MAAM,MAAM,GAAG,OAAO,YAAY,GAAG,OAAO,WAAW,GAAG,OAAO,QAAQ,IAAI;EAC7E,IAAI,CAAC,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GACpC,MAAM,IAAI,4BACR,oDAAoD,IAAI,EAC1D;EAEF,KAAK,IAAI,GAAG;CACd;CACA,IAAI,KAAK,SAAS,SAAS,MACzB,MAAM,IAAI,4BACR,yBAAyB,KAAK,KAAK,GAAG,SAAS,KAAK,eACtD;AAEJ;AAEA,SAAS,SACP,MACA,WACA,YACA,KACQ;CACR,MAAM,MAAM,KAAK,KAAK,MACnB,cACC,UAAU,cAAc,aACxB,UAAU,eAAe,cACzB,UAAU,QAAQ,GACtB;CACA,IAAI,CAAC,KACH,MAAM,IAAI,4BAA4B,wBAAwB,UAAU,GAAG,WAAW,GAAG,KAAK;CAChG,OAAO,IAAI;AACb;AAEA,SAAS,iBAAiB,WAA2B;CACnD,OAAO,UAAU,QAAQ,mBAAmB,GAAG;AACjD;AAEA,SAAS,kBAAkB,OAAe,MAAsB;CAC9D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,4BAA4B,GAAG,KAAK,4BAA4B;CAE5E,OAAO;AACT;AAEA,SAAS,WAAW,OAAuB;CACzC,OAAO,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC;AACzC;;;ACruBA,MAAM,6BAA6B;;AAEnC,MAAM,mBAAmB;;;AASzB,SAAS,QAAQ,QAA2B;CAC1C,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,GAAG,OAAO;EAAE,WAAW;EAAG,UAAU;CAAE;CAChD,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,QAAQ,OAAO;CAC/B,MAAM,YAAY,MAAM;CACxB,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,IAAI,IAAI;EACd,SAAS,IAAI;CACf;CACA,OAAO;EAAE;EAAW,UAAU,QAAQ;CAAE;AAC1C;;;AAIA,SAAS,sBAAsB,GAAwB,GAAgC;CACrF,IAAI,EAAE,mBAAmB,EAAE,gBAAgB,OAAO,EAAE,iBAAiB,EAAE;CACvE,IAAI,EAAE,cAAc,EAAE,WAAW,OAAO,EAAE,YAAY,EAAE;CACxD,OAAO,EAAE,aAAa,EAAE,aAAa,KAAK,EAAE,aAAa,EAAE,aAAa,IAAI;AAC9E;;;;;;;;;AAUA,SAAgB,oBACd,SACA,MACuB;CACvB,MAAM,oBAAoB,MAAM,qBAAqB;CAYrD,OAXe,QAAQ,KAAK,WAAgC;EAC1D,MAAM,EAAE,WAAW,aAAa,QAAQ,OAAO,MAAM;EACrD,MAAM,OAAO,WAAW,oBAAoB,aAAa;EACzD,OAAO;GACL,YAAY,OAAO;GACnB,gBAAgB;GAChB;GACA;GACA;EACF;CACF,CACY,CAAC,CAAC,KAAK,qBAAqB;AAC1C;;;;;;;;;;;AAYA,SAAgB,qBACd,SACA,GACA,MACU;CACV,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,6CAA6C,EAAE,EAAE;CAC5E,MAAM,SAAS,oBAAoB,SAAS,IAAI;CAChD,IAAI,OAAO,UAAU,GAAG,OAAO,OAAO,KAAK,MAAM,EAAE,UAAU;CAC7D,MAAM,UAAU,OAAO,QAAQ,MAAM,CAAC,EAAE,IAAI;CAC5C,IAAI,QAAQ,UAAU,GAAG,OAAO,QAAQ,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,UAAU;CAE3E,MAAM,OADO,OAAO,QAAQ,MAAM,EAAE,IACpB,CAAC,CAAC,MAAM,GAAG,IAAI,QAAQ,MAAM;CAC7C,OAAO,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,UAAU;AACtD;;;AC5DA,SAAgB,sBAKd,WACA,SAImC;CACnC,KACG,UAAU,0BAA0B,cACnC,UAAU,0BAA0B,cACtC,CAAC,QAAQ,aAET,MAAM,IAAI,UACR,oDAAoD,UAAU,sBAAsB,WACtF;CAEF,MAAM,WAAW,uBAAuB,UAAU,MAAM,UAAU,MAAM,QAAQ,QAAQ;CACxF,OAAO,cACL;EACE,MAAM,QAAQ,QAAQ,UAAU;EAChC,WAAW,QAAQ;EACnB,cAAc,QAAQ;EACtB,WAAW,QAAQ;EACnB,aAAa,QAAQ;CACvB,GACA,OAAO,UAAU;EACf,MAAM,SAAS,MAAM,sBAAsB;GACzC,MAAM,UAAU;GAChB,MAAM,UAAU;GAChB,QAAQ,MAAM;GACd,YAAY,MAAM;GAClB,WAAW,MAAM;GACjB,UAAU,MAAM;GAChB,YAAY,MAAM,SAAS;GAC3B;GACA,UAAU,YACR,UAAU,SACR,QAAQ,SAAS;IAAE,UAAU,MAAM;IAAU,UAAU,MAAM;GAAS,CAAC,GACvE,OACF;EACJ,CAAC;EACD,IAAI,OAAO,UAAU,KAAA,KAAa,CAAC,OAAO,SAAS,OAAO,KAAK,GAC7D,MAAM,IAAI,MAAM,GAAG,UAAU,KAAK,6CAA6C;EAEjF,OAAO;GACL,OAAO,OAAO;GACd,OAAO,CAAC,OAAO,OAAO,OAAO,WAAW,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI,KAAK,UAAU;EACpF;CACF,CACF;AACF;AAEA,SAAgB,qBAKd,QACA,SAOmC;CACnC,MAAM,WAAW,uBAAuB,QAAQ,MAAM,QAAQ,MAAM,QAAQ,QAAQ;CACpF,OAAO,cAAc,SAAS,OAAO,UAAU;EAC7C,MAAM,SAAS,MAAM,sBAAsB;GACzC,MAAM,QAAQ;GACd,MAAM,QAAQ;GACd,QAAQ,MAAM;GACd,YAAY,MAAM;GAClB,WAAW,MAAM;GACjB,UAAU,MAAM;GAChB,YAAY,MAAM,SAAS;GAC3B;GACA,UAAU,YACR,OAAO,QAAQ,SAAS;IAAE,UAAU,MAAM;IAAU,UAAU,MAAM;GAAS,CAAC,GAAG,OAAO;EAC5F,CAAC;EACD,IAAI,OAAO,UAAU,QAAQ,CAAC,OAAO,SAAS,OAAO,KAAK,GACxD,MAAM,IAAI,MAAM,GAAG,QAAQ,KAAK,4CAA4C;EAE9E,OAAO;GACL,OAAO,OAAO;GACd,OAAO,OAAO,WAAW,KAAK,UAAU,OAAO,QAAQ,IAAI,OAAO;EACpE;CACF,CAAC;AACH;AAEA,SAAS,cACP,SACA,UAGmC;CACnC,MAAM,YAAY,QAAQ,aAAa,QAAQ;CAC/C,OAAO;EACL,MAAM,QAAQ;EACd,cAAc,QAAQ;EACtB,YAAY,CAAC;GAAE,KAAK;GAAW,aAAa,cAAc,QAAQ;EAAO,CAAC;EAC1E,WAAW,QAAQ;EACnB,MAAM,MAAM,OAA4B;GACtC,MAAM,SAAS,MAAM,SAAS,KAAK;GACnC,MAAM,YAAY,QAAQ,cAAc,QAAQ,YAAY,OAAO,KAAK,IAAI,OAAO;GACnF,IAAI,CAAC,OAAO,SAAS,SAAS,GAC5B,MAAM,IAAI,MAAM,GAAG,QAAQ,KAAK,0CAA0C;GAE5E,OAAO;IACL,YAAY,GAAG,YAAY,OAAO,MAAM;IACxC;IACA,OAAO,OAAO;GAChB;EACF;CACF;AACF;AAEA,SAAS,uBACP,MACA,MACA,UAC4C;CAC5C,IAAI,SAAS,QAAQ;EACnB,IAAI,UACF,MAAM,IAAI,UAAU,GAAG,KAAK,yCAAyC;EAEvE;CACF;CACA,IAAI,CAAC,UACH,MAAM,IAAI,UAAU,GAAG,KAAK,yDAAyD;CAEvF,IAAI,CAAC,SAAS,MAAM,KAAK,GACvB,MAAM,IAAI,UAAU,GAAG,KAAK,mCAAmC;CAEjE,OAAO;AACT;AAEA,eAAe,sBAA+B,OAUzB;CACnB,IAAI,MAAM,SAAS,QACjB,OAAO,oBAAoB,MAAM,cAAc,MAAM,QAAQ,EAAE,QAAQ,MAAM,OAAO,CAAC,CAAC;CAExF,IAAI,CAAC,MAAM,UACT,MAAM,IAAI,8BAA8B,GAAG,MAAM,KAAK,kCAAkC;CAE1F,IAAI,CAAC,MAAM,YACT,MAAM,IAAI,8BACR,GAAG,MAAM,KAAK,kDAChB;CAGF,MAAM,OAAO,MAAM,MAAM,WAAW,YAAY;EAC9C,SAAS;EACT,OAAO,MAAM,aAAa;EAC1B,OAAO,MAAM;EACb,OAAO,MAAM,SAAS;EACtB,GAAI,MAAM,SAAS,gBAAgB,EAAE,eAAe,MAAM,SAAS,cAAc,IAAI,CAAC;EACtF,MAAM;GAAE,GAAG,MAAM;GAAU,YAAY,MAAM;EAAW;EACxD,QAAQ,MAAM;EACd,UAAU,QAAQ,WAAW,QAAQ,QAAQ,MAAM,QAAQ;GAAE;GAAQ;EAAO,CAAC,CAAC;EAC9E,SAAS,MAAM,SAAS;EACxB,GAAI,MAAM,SAAS,mBACf,EAAE,kBAAkB,MAAM,SAAS,iBAAiB,IACpD,CAAC;CACP,CAAC;CACD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK;CAEhC,MAAM,WAAW,MAAM,WAAW,KAAK,CAAC,CAAC,MAAM,YAAY,QAAQ,WAAW,KAAK,MAAM;CACzF,IAAI,CAAC,UACH,MAAM,IAAI,8BACR,GAAG,MAAM,KAAK,0DAChB;CAEF,IAAI,SAAS,eAAe,SAAS,cACnC,MAAM,IAAI,8BACR,GAAG,MAAM,KAAK,gEAChB;CAEF,OAAO,KAAK;AACd;AAEA,eAAe,oBACb,QACA,SACkB;CAClB,IAAI,OAAO,SAAS,MAAM,OAAO;CAEjC,IAAI;CACJ,MAAM,UAAU,IAAI,SAAgB,UAAU,WAAW;EACvD,gBAAgB;CAClB,CAAC;CACD,MAAM,gBAAsB,cAAc,OAAO,MAAM;CACvD,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CACxD,IAAI;EACF,OAAO,MAAM,QAAQ,KAAK,CAAC,QAAQ,QAAQ,CAAC,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC;CACtE,UAAU;EACR,OAAO,oBAAoB,SAAS,OAAO;CAC7C;AACF;;;;;;;;;;;;;;ACzOA,MAAM,uBAAuB,MAAM,OAAO;AAC1C,MAAM,wBAAwB,OAAO;AAMrC,MAAM,qCAAqB,IAAI,IAAI;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AA0BD,IAAa,uBAAb,cAA0C,MAAM;CAGnC;CAFX,YACE,SACA,OACA;EACA,MAAM,OAAO;EAFJ,KAAA,QAAA;EAGT,KAAK,OAAO;CACd;AACF;AAeA,SAAS,WAAW,MAAgB,KAAa,WAAwC;CACvF,IAAI;EACF,MAAM,MAAM,EAAE,GAAG,QAAQ,IAAI;EAC7B,KAAK,MAAM,OAAO,OAAO,KAAK,GAAG,GAC/B,IACE,mBAAmB,IAAI,GAAG,KAC1B,QAAQ,gBACR,IAAI,WAAW,aAAa,KAC5B,IAAI,WAAW,WAAW,KAC1B,QAAQ,mBACR,QAAQ,qBAER,OAAO,IAAI;EAGf,OAAO,OAAO,KAAK,SAAS;EAC5B,IAAI,yBAAyB;EAC7B,IAAI,SAAS;EACb,IAAI,OAAO;EACX,OAAO,aAAa,OAAO,MAAM;GAAE;GAAK;GAAK,WAAW;EAAqB,CAAC;CAChF,SAAS,KAAK;EACZ,MAAM,SACJ,OAAO,OAAO,QAAQ,YAAY,YAAY,MAC1C,OAAQ,IAA4B,MAAM,IAC1C;EACN,MAAM,IAAI,qBAAqB,OAAO,KAAK,KAAK,GAAG,EAAE,WAAW,UAAU,OAAO,GAAG,KAAK,GAAG;CAC9F;AACF;AAEA,SAAS,SAAS,KAAgB,MAAgB,KAAa,KAA8B;CAC3F,IAAI;EACF,MAAM,SAAS,IAAI,MAAM,KAAK,GAAG;EACjC,OAAO,OAAO,WAAW,WAAW,OAAO,KAAK,QAAQ,MAAM,IAAI,OAAO,KAAK,MAAM;CACtF,SAAS,KAAK;EACZ,IAAI,eAAe,sBAAsB,MAAM;EAC/C,MAAM,IAAI,qBAAqB,OAAO,KAAK,KAAK,GAAG,EAAE,WAAW,OAAO,GAAG,KAAK,GAAG;CACpF;AACF;AAEA,SAAS,QAAQ,KAAgB,MAAgB,KAAa,KAA8B;CAC1F,OAAO,SAAS,KAAK,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,MAAM,CAAC,CAAC,KAAK;AAC7D;AAEA,SAAS,sBAAsB,KAAgB,UAAkB,MAAuB;CACtF,MAAM,WAAW,OAAO,KAAK,YAAY,QAAQ,IAAI,KAAK,MAAM;CAChE,MAAM,UAAU,SAAS,KAAK;EAAC;EAAY;EAAQ;EAAe;CAAI,GAAG,QAAQ;CACjF,IAAI,QAAQ;CACZ,OAAO,QAAQ,QAAQ,QAAQ;EAC7B,MAAM,MAAM,QAAQ,QAAQ,GAAG,KAAK;EACpC,IAAI,MAAM,GACR,MAAM,IAAI,qBAAqB,iDAAiD;EAElF,IAAI,QAAQ,SAAS,OAAO,GAAG,CAAC,CAAC,OAAO,QAAQ,GAAG,OAAO;EAC1D,QAAQ,MAAM;CAChB;CACA,OAAO;AACT;AAEA,SAAS,eAAe,KAAgB,UAAkB,QAAyB;CACjF,MAAM,MAAM,cAAc;CAC1B,OAAO,QAAQ,KAAK;EAAC;EAAgB;EAAuB;EAAM;CAAG,GAAG,QAAQ,CAAC,CAC9E,MAAM,IAAI,CAAC,CACX,MAAM,cAAc,cAAc,GAAG;AAC1C;AAEA,SAAS,gBAAgB,QAAuB,QAAyC;CACvF,IAAI;EACF,IAAI,CAAC,OAAO,GAAG,OAAO,KAAA;CACxB,SAAS,KAAK;EACZ,OAAO;CACT;CAEA,IAAI;EACF,OAAO;EACP;CACF,SAAS,aAAa;EACpB,IAAI;GAGF,IAAI,CAAC,OAAO,GAAG,OAAO,KAAA;EACxB,SAAS,cAAc;GACrB,OAAO,IAAI,eACT,CAAC,aAAa,YAAY,GAC1B,sEACF;EACF;EACA,OAAO;CACT;AACF;AAEA,SAAS,OAAO,OAAuC;CACrD,OAAO,UAAU,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK;AAClE;AAEA,MAAM,aAAa;CAIjB;CACA;CACA;CACA,uBAAuB;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,oBAAoC;CACxC,iBAAiB;CACjB,mBAAmB;CACnB,mBAAmB;CACnB,qBAAqB;CACrB,mBAAmB;AACrB;;;;AAKA,SAAS,WACP,KACA,KACA,YACA,iBACQ;CACR,MAAM,UAAU,YAAY,KAAK,OAAO,GAAG,mBAAmB,CAAC;CAC/D,MAAM,WAAW,KAAK,SAAS,UAAU;CACzC,MAAM,gBAAgB,KAAK,SAAS,gBAAgB;CACpD,UAAU,aAAa;CACvB,IAAI;EACF,MAAM,eAAe,uBAAuB,eAAe;EAC3D,MAAM,gBAAgB,aAAa,QAAQ,KAAK;GAAC;GAAa;GAAc;EAAS,GAAG,GAAG,CAAC;EAC5F,QACE,KACA;GACE;GACA;GACA;GACA,GAAI,iBAAiB,WAAW,CAAC,wBAAwB,IAAI,CAAC;GAC9D,cAAc;GACd;EACF,GACA,SACA,iBACF;EACA,OAAO,SACL,KACA;GAAC,aAAa;GAAY,GAAG;GAAY;GAAY;GAAiB;EAAI,GAC1E,SACA;GACE,GAAG;GACH,kCAAkC;EACpC,CACF;CACF,UAAU;EACR,OAAO,SAAS;GAAE,WAAW;GAAM,OAAO;EAAK,CAAC;CAClD;AACF;AAEA,SAAS,cAAc,KAAgB,KAAa,KAAqB;CACvE,OAAO,QAAQ,KAAK;EAAC;EAAa;EAAY,GAAG,IAAI;CAAU,GAAG,GAAG;AACvE;AAEA,SAAS,uBAAuB,SAAsB,aAA8B;CAClF,IAAI,WAAW,QAAQ,WAAW,GAAG,OAAO,QAAQ;CACpD,IAAI,aAAa,OAAO,KAAK,aAAa,SAAS,QAAQ,WAAW,CAAC;CACvE,OAAO,QAAQ;AACjB;AAQA,SAAS,eAAe,MAAsB;CAC5C,OAAO,KAAK,UAAU,IAAI;AAC5B;AAEA,SAAS,oBAAoB,OAAmC;CAC9D,MAAM,QAAQ,OAAO,KAAK,KAAK;CAC/B,MAAM,UAA0B,CAAC;CACjC,IAAI,QAAQ;CACZ,OAAO,QAAQ,MAAM,QAAQ;EAC3B,MAAM,MAAM,MAAM,QAAQ,GAAG,KAAK;EAClC,IAAI,MAAM,GAAG,MAAM,IAAI,qBAAqB,wCAAwC;EACpF,MAAM,SAAS,MAAM,SAAS,OAAO,GAAG;EACxC,QAAQ,MAAM;EACd,IAAI,OAAO,WAAW,GAAG;EAEzB,MAAM,MAAM,OAAO,QAAQ,CAAI;EAC/B,IAAI,MAAM,GAAG,MAAM,IAAI,qBAAqB,uCAAuC;EACnF,MAAM,WAAW,OAAO,SAAS,GAAG,GAAG,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC,MAAM,GAAG;EACpE,IAAI,SAAS,WAAW,GAAG,MAAM,IAAI,qBAAqB,8BAA8B;EACxF,MAAM,OAAO,SAAS;EACtB,MAAM,OAAO,SAAS;EACtB,MAAM,WAAW,SAAS;EAC1B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UACrB,MAAM,IAAI,qBAAqB,8BAA8B;EAE/D,MAAM,YAAY,OAAO,SAAS,MAAM,CAAC;EACzC,MAAM,OAAO,UAAU,SAAS,MAAM;EACtC,IAAI,CAAC,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,OAAO,SAAS,GAC7C,MAAM,IAAI,qBAAqB,uCAAuC;EAExE,IAAI,SAAS,UAAU,SAAS,UAC9B,MAAM,IAAI,qBACR,oDAAoD,KAAK,MAAM,eAAe,IAAI,GACpF;EAEF,QAAQ,KAAK;GAAE;GAAM;GAAU;EAAK,CAAC;CACvC;CACA,OAAO;AACT;AAEA,SAAS,iBAAiB,OAA6B;CACrD,MAAM,QAAQ,OAAO,KAAK,KAAK;CAC/B,MAAM,QAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,OAAO,QAAQ,MAAM,QAAQ;EAC3B,MAAM,MAAM,MAAM,QAAQ,GAAG,KAAK;EAClC,IAAI,MAAM,GAAG,MAAM,IAAI,qBAAqB,wCAAwC;EACpF,MAAM,YAAY,MAAM,SAAS,OAAO,GAAG;EAC3C,QAAQ,MAAM;EACd,IAAI,UAAU,WAAW,GAAG;EAC5B,MAAM,OAAO,UAAU,SAAS,MAAM;EACtC,IAAI,CAAC,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,OAAO,SAAS,GAC7C,MAAM,IAAI,qBAAqB,uCAAuC;EAExE,MAAM,KAAK,IAAI;CACjB;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAc,WAA4B;CAC9D,MAAM,MAAM,SAAS,MAAM,SAAS;CACpC,OAAO,QAAQ,MAAO,CAAC,WAAW,GAAG,KAAK,QAAQ,QAAQ,CAAC,IAAI,WAAW,KAAK,KAAK;AACtF;AAEA,SAAS,uBAAuB,MAAc,MAAsB;CAClE,IAAI,KAAK,WAAW,KAAK,WAAW,IAAI,GACtC,MAAM,IAAI,qBAAqB,oCAAoC,eAAe,IAAI,GAAG;CAE3F,MAAM,eAAe,QAAQ,MAAM,IAAI;CACvC,IAAI,CAAC,aAAa,MAAM,YAAY,KAAK,iBAAiB,MACxD,MAAM,IAAI,qBAAqB,0CAA0C,eAAe,IAAI,GAAG;CAGjG,MAAM,WAAW,KAAK,MAAM,QAAQ;CACpC,IAAI,SAAS;CACb,KAAK,MAAM,WAAW,SAAS,MAAM,GAAG,EAAE,GAAG;EAC3C,IAAI,QAAQ,WAAW,KAAK,YAAY,OAAO,YAAY,MACzD,MAAM,IAAI,qBAAqB,oCAAoC,eAAe,IAAI,GAAG;EAE3F,SAAS,KAAK,QAAQ,OAAO;EAC7B,MAAM,OAAO,UAAU,MAAM;EAC7B,IAAI,CAAC,KAAK,YAAY,KAAK,KAAK,eAAe,GAC7C,MAAM,IAAI,qBACR,gEAAgE,eAAe,IAAI,GACrF;CAEJ;CACA,OAAO;AACT;AAEA,SAAS,uBAAuB,UAAqC;CACnE,IAAI,iBAAiB,KAAK,QAAQ,GAAG,OAAO;CAC5C,IAAI,iBAAiB,KAAK,QAAQ,GAAG,OAAO;CAC5C,MAAM,IAAI,qBAAqB,8BAA8B,UAAU;AACzE;AAEA,SAAS,iBAAiB,OAAmB,UAA0B;CACrE,MAAM,OAAO,WAAW,uBAAuB,QAAQ,CAAC;CACxD,KAAK,OAAO,QAAQ,MAAM,WAAW,GAAG;CACxC,KAAK,OAAO,KAAK;CACjB,OAAO,KAAK,OAAO,KAAK;AAC1B;AAEA,SAAS,gBAAgB,MAAc,UAAyD;CAC9F,MAAM,SAAS,UAAU,IAAI;CAC7B,IAAI,CAAC,OAAO,OAAO,KAAK,OAAO,eAAe,GAC5C,MAAM,IAAI,qBAAqB,0CAA0C,eAAe,IAAI,GAAG;CAGjG,MAAM,WAAW,QAAQ,aAAa,UAAU,IAAIC,UAAY;CAChE,MAAM,KAAK,SAAS,MAAMA,UAAY,WAAW,QAAQ;CACzD,IAAI;EACF,MAAM,SAAS,UAAU,EAAE;EAC3B,IACE,CAAC,OAAO,OAAO,KACf,OAAO,QAAQ,OAAO,OACtB,OAAO,QAAQ,OAAO,OACtB,OAAO,SAAS,OAAO,MAEvB,MAAM,IAAI,qBACR,yDAAyD,eAAe,IAAI,GAC9E;EAGF,MAAM,OAAO,WAAW,uBAAuB,QAAQ,CAAC;EACxD,KAAK,OAAO,QAAQ,OAAO,KAAK,GAAG;EACnC,MAAM,QAAQ,OAAO,YAAY,qBAAqB;EACtD,IAAI,QAAQ;EACZ,OAAO,MAAM;GACX,MAAM,QAAQ,SAAS,IAAI,OAAO,GAAG,MAAM,QAAQ,IAAI;GACvD,IAAI,UAAU,GAAG;GACjB,SAAS;GACT,KAAK,OAAO,MAAM,SAAS,GAAG,KAAK,CAAC;EACtC;EACA,IAAI,UAAU,OAAO,MACnB,MAAM,IAAI,qBACR,yDAAyD,eAAe,IAAI,GAC9E;EAEF,OAAO;GAAE,MAAM,KAAK,OAAO,KAAK;GAAG,aAAa,OAAO,OAAO,QAAW;EAAE;CAC7E,UAAU;EACR,UAAU,EAAE;CACd;AACF;AAEA,SAAS,2BACP,MACA,UACA,cACM;CACN,MAAM,cAAc,aAAa,UAAU,EAAE,UAAU,SAAS,CAAC;CACjE,MAAM,SAAS,YAAY,SAAS,MAAM;CAC1C,IAAI,CAAC,OAAO,KAAK,QAAQ,MAAM,CAAC,CAAC,OAAO,WAAW,GACjD,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAEF,IAAI,WAAW,MAAM,GACnB,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAGF,IAAI,CAAC,aAAa,MADI,QAAQ,QAAQ,QAAQ,GAAG,MACb,CAAC,GACnC,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAEF,IAAI;CACJ,IAAI;EACF,iBAAiB,aAAa,QAAQ;CACxC,SAAS,KAAK;EACZ,MAAM,IAAI,qBACR,4DAA4D,eAAe,QAAQ,KACnF,GACF;CACF;CACA,IAAI,CAAC,aAAa,MAAM,cAAc,GACpC,MAAM,IAAI,qBACR,qDAAqD,eAAe,QAAQ,GAC9E;CAGF,MAAM,iBAAiB,SAAS,MAAM,cAAc,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG;CAIzE,IAAI,EAFF,aAAa,IAAI,cAAc,KAC/B,CAAC,GAAG,YAAY,CAAC,CAAC,MAAM,gBAAgB,YAAY,WAAW,GAAG,eAAe,EAAE,CAAC,IAEpF,MAAM,IAAI,qBACR,8DAA8D,eAAe,QAAQ,GACvF;AAEJ;AAEA,SAAS,6BAA6B,KAAgB,MAAc,iBAA+B;CACjG,MAAM,UAAU,oBACd,SAAS,KAAK;EAAC;EAAW;EAAM;EAAM;EAAe;CAAe,GAAG,IAAI,CAC7E;CACA,MAAM,eAAe,IAAI,IAAI,QAAQ,KAAK,UAAU,MAAM,IAAI,CAAC;CAE/D,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,eAAe,uBAAuB,MAAM,MAAM,IAAI;EAC5D,IAAI,MAAM,SAAS,YAAY,MAAM,SAAS,UAC5C,MAAM,IAAI,qBACR,8EAA8E,eAAe,MAAM,IAAI,GACzG;EAEF,IAAI,MAAM,SAAS,UAAU;GAE3B,IAAI,CADS,UAAU,YACf,CAAC,CAAC,eAAe,GACvB,MAAM,IAAI,qBACR,2CAA2C,eAAe,MAAM,IAAI,GACtE;GAIF,IADuB,iBADH,aAAa,cAAc,EAAE,UAAU,SAAS,CAClB,GAAG,MAAM,QAC1C,MAAM,MAAM,UAC3B,MAAM,IAAI,qBACR,yEAAyE,eAAe,MAAM,IAAI,GACpG;GAEF,2BAA2B,MAAM,cAAc,YAAY;GAC3D;EACF;EACA,IAAI,MAAM,SAAS,YAAY,MAAM,SAAS,UAC5C,MAAM,IAAI,qBACR,6CAA6C,MAAM,KAAK,MAAM,eAAe,MAAM,IAAI,GACzF;EAGF,MAAM,SAAS,gBAAgB,cAAc,MAAM,QAAQ;EAC3D,IAAI,OAAO,SAAS,MAAM,UACxB,MAAM,IAAI,qBACR,mHAAmH,eAAe,MAAM,IAAI,GAC9I;EAEF,IAAI,QAAQ,aAAa,WAAW,OAAO,gBAAgB,MAAM,SAAS,WACxE,MAAM,IAAI,qBACR,kEAAkE,eAAe,MAAM,IAAI,GAC7F;CAEJ;AACF;AAcA,SAAS,yBACP,SACA,MACA,KACyB;CACzB,0BAA0B,OAAO;CACjC,IAAI,CAAC,WAAW,IAAI,GAClB,MAAM,IAAI,qBAAqB,wCAAwC,MAAM;CAE/E,MAAM,cAAc,QAAQ,IAAI;CAChC,MAAM,gBAAgB,aAAa,IAAI;CACvC,IACE,UAAU,WAAW,CAAC,CAAC,eAAe,KACrC,QAAQ,aAAa,WAAW,gBAAgB,eAEjD,MAAM,IAAI,qBACR,kEAAkE,MACpE;CAEF,MAAM,WAAW,QAAQ,KAAK,CAAC,aAAa,iBAAiB,GAAG,IAAI;CACpE,MAAM,oBAAoB,aAAa,QAAQ;CAC/C,IAAI,sBAAsB,eACxB,MAAM,IAAI,qBACR,qEAAqE,SAAS,QAAQ,MACxF;CAGF,MAAM,aAAa,QAAQ,KAAK,CAAC,YAAY,IAAI,GAAG,IAAI,CAAC,CACtD,MAAM,IAAI,CAAC,CACX,QAAQ,SAAS,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,KAAK,SAAS,KAAK,IAAI,EAAE;CACrF,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,qBACR,2EAA2E,KAAK,IAAI,WAAW,KAAK,IAAI,GAC1G;CAGF,MAAM,aAAa,CACjB,GAAG,iBAAiB,SAAS,KAAK;EAAC;EAAY;EAAY;EAAsB;CAAI,GAAG,IAAI,CAAC,GAC7F,GAAG,iBACD,SAAS,KAAK;EAAC;EAAY;EAAY;EAAa;EAAsB;CAAI,GAAG,IAAI,CACvF,CACF;CACA,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,qBACR,oDAAoD,KAAK,IAAI,WAAW,KAAK,IAAI,GACnF;CAGF,MAAM,kBAAkB,cAAc,KAAK,MAAM,MAAM;CACvD,IAAI,oBAAoB,QAAQ,iBAC9B,MAAM,IAAI,qBACR,mDAAmD,QAAQ,gBAAgB,QAAQ,iBACrF;CAGF,MAAM,aAAa,cAAc,KAAK,MAAM,QAAQ,UAAU;CAC9D,IAAI,eAAe,QAAQ,YACzB,MAAM,IAAI,qBACR,8CAA8C,QAAQ,WAAW,QAAQ,YAC3E;CAGF,MAAM,WAAW,QAAQ,KAAK;EAAC;EAAa;EAAY,GAAG,QAAQ,WAAW;CAAQ,GAAG,IAAI;CAC7F,IAAI,aAAa,QAAQ,UACvB,MAAM,IAAI,qBACR,4CAA4C,QAAQ,SAAS,QAAQ,UACvE;CAGF,MAAM,gBAAgB,QACpB,KACA;EAAC;EAAa;EAAY,GAAG,QAAQ,gBAAgB;CAAQ,GAC7D,IACF;CACA,IAAI,kBAAkB,QAAQ,eAC5B,MAAM,IAAI,qBACR,uCAAuC,QAAQ,cAAc,QAAQ,eACvE;CAGF,IAAI;EACF,QACE,KACA;GACE;GACA;GACA;GACA;GACA;GACA,QAAQ;GACR;EACF,GACA,IACF;CACF,SAAS,KAAK;EACZ,MAAM,IAAI,qBACR,uDAAuD,QACvD,GACF;CACF;CAEA,IAAI;EACF,6BAA6B,KAAK,mBAAmB,QAAQ,eAAe;CAC9E,SAAS,KAAK;EACZ,IAAI,eAAe,sBAAsB,MAAM;EAC/C,MAAM,IAAI,qBAAqB,6CAA6C,QAAQ,GAAG;CACzF;CAGA,IADkB,QAAQ,KAAK;EAAC;EAAc,QAAQ;EAAY,QAAQ;CAAe,GAAG,IAChF,MAAM,QAAQ,YACxB,MAAM,IAAI,qBACR,yBAAyB,QAAQ,gBAAgB,8BAA8B,QAAQ,YACzF;CAGF,MAAM,QAAQ,WAAW,KAAK,MAAM,QAAQ,YAAY,QAAQ,eAAe;CAC/E,MAAM,kBAAkB,OAAO,KAAK;CACpC,IAAI,oBAAoB,QAAQ,MAAM,UAAU,MAAM,eAAe,QAAQ,MAAM,YACjF,MAAM,IAAI,qBACR,wCAAwC,QAAQ,MAAM,OAAO,GAAG,QAAQ,MAAM,WAAW,cAAc,gBAAgB,GAAG,MAAM,WAAW,OAC7I;CAGF,OAAO;EACL;EACA,UAAU;EACV,aAAa,mBAAmB,OAAO;EACvC,YAAY,IAAI,WAAW,KAAK;CAClC;AACF;;AAGA,SAAS,KAAK,OAAuB;CACnC,OACE,MACG,YAAY,CAAC,CACb,QAAQ,eAAe,GAAG,CAAC,CAC3B,QAAQ,YAAY,EAAE,CAAC,CACvB,MAAM,GAAG,EAAE,KAAK;AAEvB;;;;AAKA,SAAgB,mBAAmB,MAAkD;CACnF,MAAM,MAAM,KAAK,OAAO;CACxB,MAAM,cAAc,KAAK,eAAe,KAAK,KAAK,UAAU,YAAY;CACxE,MAAM,eAAe,KAAK,gBAAgB;CAE1C,OAAO;EACL,MAAM,OAAO,EAAE,SAAS,SAAS;GAC/B,MAAM,KAAK,GAAG,KAAK,KAAK,EAAE,GAAG,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC;GAC7F,MAAM,SAAS,GAAG,aAAa,GAAG;GAClC,MAAM,OAAO,KAAK,aAAa,EAAE;GACjC,MAAM,aAAa,cAAc,KAAK,KAAK,UAAU,OAAO;GAC5D,MAAM,WAAW,QACf,KACA;IAAC;IAAa;IAAY,GAAG,WAAW;GAAQ,GAChD,KAAK,QACP;GACA,QAAQ,KAAK;IAAC;IAAY;IAAO;IAAM;IAAQ;IAAM;GAAU,GAAG,KAAK,QAAQ;GAC/E,OAAO;IACL,MAAM,aAAa,QAAQ,KAAK,UAAU,IAAI,CAAC;IAC/C;IACA;IACA;IACA;GACF;EACF;EAEA,MAAM,SAAS,UAAU,SAAS;GAQhC,IALe,QACb,KACA;IAAC;IAAU;IAAkB;GAAuB,GACpD,SAAS,IAEF,CAAC,CAAC,SAAS,GAAG;IACrB,QAAQ,KAAK,CAAC,OAAO,IAAI,GAAG,SAAS,IAAI;IACzC,QAAQ,KAAK;KAAC;KAAU;KAAM;IAAO,GAAG,SAAS,IAAI;GACvD;GACA,MAAM,kBAAkB,cAAc,KAAK,SAAS,MAAM,MAAM;GAChE,MAAM,gBAAgB,QACpB,KACA;IAAC;IAAa;IAAY,GAAG,gBAAgB;GAAQ,GACrD,SAAS,IACX;GACA,MAAM,QAAQ,WAAW,KAAK,SAAS,MAAM,SAAS,YAAY,eAAe;GACjF,MAAM,UAAuB;IAC3B,MAAM;IACN,aAAa,SAAS;IACtB,SAAS,SAAS;IAClB,YAAY,SAAS;IACrB,UAAU,SAAS;IACnB;IACA;IACA,OAAO;KACL,QAAQ;KACR,QAAQ,OAAO,KAAK;KACpB,YAAY,MAAM;IACpB;IACA;GACF;GACA,yBAAyB,SAAS,SAAS,MAAM,GAAG;GACpD,OAAO;EACT;EAEA,MAAM,QAAQ,UAAU;GAItB,MAAM,WAAW,CACf,sBACQ,sBAAsB,KAAK,KAAK,UAAU,SAAS,IAAI,SACvD,QAAQ,KAAK;IAAC;IAAY;IAAU;IAAW;IAAM,SAAS;GAAI,GAAG,KAAK,QAAQ,CAC1F,GACA,sBACQ,eAAe,KAAK,KAAK,UAAU,SAAS,MAAM,SAClD,QAAQ,KAAK;IAAC;IAAU;IAAM;IAAM,SAAS;GAAM,GAAG,KAAK,QAAQ,CAC3E,CACF,CAAC,CAAC,QAAQ,YAAY,YAAY,KAAA,CAAS;GAE3C,IAAI,SAAS,SAAS,GAAG;IACvB,MAAM,QACJ,SAAS,WAAW,IAChB,SAAS,KACT,IAAI,eAAe,UAAU,6CAA6C;IAChF,MAAM,IAAI,qBACR,8BAA8B,SAAS,KAAK,cAAc,SAAS,UACnE,KACF;GACF;EACF;CACF;AACF;;;;AAKA,SAAgB,kBACd,SACA,aACyB;CAEzB,OAAO,yBAAyB,SADnB,uBAAuB,SAAS,WACD,GAAG,UAAU;AAC3D;;;AAIA,SAAgB,oBAAoB,SAAsB,aAA8B;CACtF,OAAO,kBAAkB,SAAS,WAAW,CAAC,CAAC;AACjD"}