@tangle-network/agent-eval 0.27.0 → 0.28.0

package/dist/chunk-2A5XJB43.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/power-analysis.ts","../src/paired-stats.ts","../src/summary-report.ts"],"sourcesContent":["/**\n * Power analysis + multiple-comparison correction.\n *\n * Two jobs:\n *   1. Before running: `requiredSampleSize({ effect, alpha, power })`\n *      returns the N per arm needed to detect a given effect size.\n *   2. After running: `benjaminiHochberg(pValues, fdr)` and\n *      `bonferroni(pValues, alpha)` correct for multiple pairwise tests\n *      so pairwise variant comparisons stay statistically honest.\n *\n * Fixes the correctness bug in 0.2's pairwise optimizer which applied\n * alpha directly across n*(n-1)/2 pairwise tests without correction —\n * dramatically inflating false-positive rate when variants ≥ 3.\n */\n\n/**\n * Required N per arm for a two-sample comparison at target effect size,\n * alpha, and power. Uses the normal-approximation formula:\n *\n *   n = 2 * ( (z_{1-α/2} + z_{1-β}) / d )^2\n *\n * where d is Cohen's d. Returns Infinity for effect ≤ 0.\n */\nexport function requiredSampleSize(opts: {\n  effect: number\n  alpha?: number\n  power?: number\n  twoSided?: boolean\n}): number {\n  const effect = opts.effect\n  if (!Number.isFinite(effect) || effect <= 0) return Infinity\n  const alpha = opts.alpha ?? 0.05\n  const power = opts.power ?? 0.8\n  const twoSided = opts.twoSided ?? true\n  const zAlpha = zQuantile(twoSided ? 1 - alpha / 2 : 1 - alpha)\n  const zBeta = zQuantile(power)\n  const n = 2 * ((zAlpha + zBeta) / effect) ** 2\n  return Math.ceil(n)\n}\n\n/**\n * Minimum detectable paired effect (in standardised units) given a target\n * paired sample size. Closed-form inverse of the paired-t / sign-rank power\n * formula under the normal approximation:\n *\n *   d_min = (z_{1-α/2} + z_β) / sqrt(n_paired)\n *\n * Multiply by `sd(deltas)` to convert to score units. Treat as a lower bound:\n * the Wilcoxon signed-rank test and bootstrap CIs have asymptotic relative\n * efficiency below 1 against the t-test on heavy-tailed distributions, so the\n * true achievable MDE in those regimes is somewhat larger.\n */\nexport function pairedMde(opts: {\n  nPaired: number\n  alpha?: number\n  power?: number\n  twoSided?: boolean\n}): number {\n  if (!Number.isFinite(opts.nPaired) || opts.nPaired <= 0) return Infinity\n  const alpha = opts.alpha ?? 0.05\n  const power = opts.power ?? 0.8\n  const twoSided = opts.twoSided ?? true\n  const zAlpha = zQuantile(twoSided ? 1 - alpha / 2 : 1 - alpha)\n  const zBeta = zQuantile(power)\n  return (zAlpha + zBeta) / Math.sqrt(opts.nPaired)\n}\n\n/** Bonferroni adjustment: multiply every p-value by the number of tests, clamp at 1. */\nexport function bonferroni(\n  pValues: number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  const k = pValues.length\n  const adjusted = pValues.map((p) => Math.min(1, p * k))\n  const significant = adjusted.map((p) => p < alpha)\n  return { adjusted, significant }\n}\n\n/**\n * Benjamini–Hochberg false discovery rate. Returns adjusted q-values and\n * significance at the target FDR. Properly handles ties and preserves\n * monotonicity of q-values.\n */\nexport function benjaminiHochberg(\n  pValues: number[],\n  fdr = 0.05,\n): { qValues: number[]; significant: boolean[] } {\n  const n = pValues.length\n  if (n === 0) return { qValues: [], significant: [] }\n  const indexed = pValues.map((p, i) => ({ p, i })).sort((a, b) => a.p - b.p)\n  const q = new Array<number>(n)\n  // Ranks are 1-based; q_i = p_i * n / rank_i\n  let minRight = 1\n  for (let k = n - 1; k >= 0; k--) {\n    const rank = k + 1\n    const entry = indexed[k]!\n    const raw = (entry.p * n) / rank\n    const bounded = Math.min(minRight, raw)\n    minRight = bounded\n    q[entry.i] = Math.min(1, bounded)\n  }\n  const significant = q.map((v) => v < fdr)\n  return { qValues: q, significant }\n}\n\n/** Standard-normal inverse CDF (Acklam approximation). */\nfunction zQuantile(p: number): number {\n  if (p <= 0 || p >= 1) {\n    if (p === 0) return -Infinity\n    if (p === 1) return Infinity\n    return NaN\n  }\n  const a = [\n    -3.969683028665376e1, 2.209460984245205e2, -2.759285104469687e2, 1.38357751867269e2,\n    -3.066479806614716e1, 2.506628277459239,\n  ]\n  const b = [\n    -5.447609879822406e1, 1.615858368580409e2, -1.556989798598866e2, 6.680131188771972e1,\n    -1.328068155288572e1,\n  ]\n  const c = [\n    -7.784894002430293e-3, -3.223964580411365e-1, -2.400758277161838, -2.549732539343734,\n    4.374664141464968, 2.938163982698783,\n  ]\n  const d = [7.784695709041462e-3, 3.224671290700398e-1, 2.445134137142996, 3.754408661907416]\n  const pLow = 0.02425\n  const pHigh = 1 - pLow\n  let q: number\n  let r: number\n  if (p < pLow) {\n    q = Math.sqrt(-2 * Math.log(p))\n    return (\n      (((((c[0]! * q + c[1]!) * q + c[2]!) * q + c[3]!) * q + c[4]!) * q + c[5]!) /\n      ((((d[0]! * q + d[1]!) * q + d[2]!) * q + d[3]!) * q + 1)\n    )\n  }\n  if (p <= pHigh) {\n    q = p - 0.5\n    r = q * q\n    return (\n      ((((((a[0]! * r + a[1]!) * r + a[2]!) * r + a[3]!) * r + a[4]!) * r + a[5]!) * q) /\n      (((((b[0]! * r + b[1]!) * r + b[2]!) * r + b[3]!) * r + b[4]!) * r + 1)\n    )\n  }\n  q = Math.sqrt(-2 * Math.log(1 - p))\n  return (\n    -(((((c[0]! * q + c[1]!) * q + c[2]!) * q + c[3]!) * q + c[4]!) * q + c[5]!) /\n    ((((d[0]! * q + d[1]!) * q + d[2]!) * q + d[3]!) * q + 1)\n  )\n}\n","/**\n * Paper-grade paired statistics for held-out promotion gates.\n *\n * The promotion gate (`HeldOutGate`) needs three things:\n *\n *   1. A bootstrap confidence interval on the per-item paired delta\n *      (`pairedBootstrap`). Median delta is the headline number; the\n *      CI lower bound is what the gate checks against `pairedDeltaThreshold`.\n *   2. A non-parametric significance test on the paired deltas\n *      (`pairedWilcoxon` — re-export of `wilcoxonSignedRank` under the\n *      paper-style name).\n *   3. False-discovery-rate correction across simultaneously-tested\n *      candidate variants (`bhAdjust` — re-export of `benjaminiHochberg`).\n *\n * Why a separate file: every existing primitive lives in `statistics.ts`\n * (general) or `power-analysis.ts` (correction). Paired-bootstrap is\n * paired-only, paper-grade, and load-bearing for the promotion gate.\n * Putting it next to `statistics.ts` would require editing that file;\n * the brief forbids that. New file, new exports, no surface change.\n */\n\nimport { benjaminiHochberg } from './power-analysis'\nimport { wilcoxonSignedRank } from './statistics'\n\nexport interface PairedBootstrapResult {\n  /** Number of paired observations (after dropping unequal lengths is rejected). */\n  n: number\n  /** Median of paired deltas (after − before). */\n  median: number\n  /** Mean of paired deltas. */\n  mean: number\n  /** Lower bound of the bootstrap CI on the median delta. */\n  low: number\n  /** Upper bound of the bootstrap CI on the median delta. */\n  high: number\n  /** Confidence level used (e.g. 0.95). */\n  confidence: number\n  /** Number of bootstrap resamples used. */\n  resamples: number\n}\n\nexport interface PairedBootstrapOptions {\n  /** Confidence level. Default 0.95. */\n  confidence?: number\n  /** Bootstrap resample count. Default 2000. */\n  resamples?: number\n  /** Statistic to bootstrap. Default 'median'. */\n  statistic?: 'median' | 'mean'\n  /** Deterministic seed. If omitted, uses Math.random(). */\n  seed?: number\n}\n\n/**\n * Paired bootstrap on (after - before) deltas. Returns a CI on the\n * chosen statistic (median by default). Pairs are resampled with\n * replacement. The lower bound is what the promotion gate checks: if\n * `low > pairedDeltaThreshold`, the gain is real at the chosen\n * confidence level.\n *\n * Throws on unequal sample sizes — caller must align pairs upstream.\n */\nexport function pairedBootstrap(\n  before: number[],\n  after: number[],\n  opts: PairedBootstrapOptions = {},\n): PairedBootstrapResult {\n  if (before.length !== after.length) {\n    throw new Error(`pairedBootstrap: unequal sample sizes (${before.length} vs ${after.length})`)\n  }\n  const confidence = opts.confidence ?? 0.95\n  const resamples = opts.resamples ?? 2000\n  const statistic = opts.statistic ?? 'median'\n  if (confidence <= 0 || confidence >= 1) {\n    throw new Error(`pairedBootstrap: confidence must be in (0,1), got ${confidence}`)\n  }\n\n  const n = before.length\n  const deltas = before.map((b, i) => after[i]! - b)\n  if (n === 0) {\n    return { n: 0, median: 0, mean: 0, low: 0, high: 0, confidence, resamples }\n  }\n  if (n === 1) {\n    const d = deltas[0]!\n    return { n: 1, median: d, mean: d, low: d, high: d, confidence, resamples }\n  }\n\n  const rng = makeRng(opts.seed)\n  const samples = new Array<number>(resamples)\n  for (let b = 0; b < resamples; b++) {\n    let acc: number[] | null = null\n    if (statistic === 'mean') {\n      let sum = 0\n      for (let k = 0; k < n; k++) {\n        sum += deltas[Math.floor(rng() * n)]!\n      }\n      samples[b] = sum / n\n    } else {\n      acc = new Array<number>(n)\n      for (let k = 0; k < n; k++) {\n        acc[k] = deltas[Math.floor(rng() * n)]!\n      }\n      samples[b] = medianInPlace(acc)\n    }\n  }\n  samples.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowIdx = Math.floor((alpha / 2) * resamples)\n  const highIdx = Math.min(resamples - 1, Math.ceil((1 - alpha / 2) * resamples) - 1)\n\n  return {\n    n,\n    median: medianInPlace([...deltas]),\n    mean: deltas.reduce((s, x) => s + x, 0) / n,\n    low: samples[lowIdx]!,\n    high: samples[Math.max(highIdx, lowIdx)]!,\n    confidence,\n    resamples,\n  }\n}\n\n/**\n * Paper-style alias for `wilcoxonSignedRank`. The signed-rank test on\n * paired deltas is the standard non-parametric significance test for\n * \"candidate beats baseline on matched items.\" Use alongside the\n * bootstrap CI: bootstrap gives effect size, Wilcoxon gives p.\n */\nexport function pairedWilcoxon(before: number[], after: number[]): { w: number; p: number } {\n  return wilcoxonSignedRank(before, after)\n}\n\n/**\n * Paper-style alias for `benjaminiHochberg`. Use to correct p-values\n * across multiple candidate-vs-baseline comparisons run in the same\n * promotion sweep. Returns BH-adjusted q-values and significance at\n * the requested FDR (default 0.05).\n */\nexport function bhAdjust(\n  pValues: number[],\n  fdr = 0.05,\n): { qValues: number[]; significant: boolean[] } {\n  return benjaminiHochberg(pValues, fdr)\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\nfunction medianInPlace(xs: number[]): number {\n  if (xs.length === 0) return 0\n  xs.sort((a, b) => a - b)\n  const mid = Math.floor(xs.length / 2)\n  return xs.length % 2 === 0 ? (xs[mid - 1]! + xs[mid]!) / 2 : xs[mid]!\n}\n\n/**\n * Tiny seedable PRNG (mulberry32). Deterministic given a seed; falls\n * back to Math.random when seed is omitted. Adequate for bootstrap\n * resampling — not cryptographic.\n */\nfunction makeRng(seed: number | undefined): () => number {\n  if (seed === undefined) return Math.random\n  let s = seed | 0 || 0x9e3779b9\n  return () => {\n    s = (s + 0x6d2b79f5) | 0\n    let t = s\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n","/**\n * Reporting helpers — production summaries and paper-quality figures — sit alongside `reporter.ts` rather\n * than replacing it.\n *\n * Three artefacts:\n *\n *   - `summaryTable`           Markdown table of per-candidate means,\n *                            95% bootstrap CIs, BH-adjusted Wilcoxon\n *                            p-values, and Cohen's d versus a\n *                            comparator candidate.\n *   - `paretoChart`         Abstract spec for a cost vs quality\n *                            scatter, with gate decisions overlaid.\n *                            Returns numbers + labels — caller\n *                            chooses the plotting library.\n *   - `gainHistogram`\n *                            Per-item paired holdout deltas as a\n *                            histogram spec (bins + counts + median +\n *                            CI). Same \"data, not images\" contract.\n *\n * The figure types are PlotSpecs — JSON-friendly, library-agnostic.\n * They aren't React components and they aren't PNGs; they are\n * what you'd hand to vega-lite, plotly, matplotlib, or your own\n * Canvas renderer to draw the actual figure.\n */\n\nimport type { GateDecision } from './held-out-gate'\nimport { pairedBootstrap } from './paired-stats'\nimport type { FailureClusterReport } from './pipelines/failure-cluster'\nimport { benjaminiHochberg, pairedMde } from './power-analysis'\nimport { canonicalize, hashJson } from './pre-registration'\nimport type { RunRecord } from './run-record'\nimport { cohensD, confidenceInterval, wilcoxonSignedRank } from './statistics'\n\n// ── summaryTable ───────────────────────────────────────────────────────\n\nexport interface SummaryTableOptions {\n  /** Comparator candidate id. Wilcoxon + Cohen's d are computed\n   *  versus this candidate. Required for paired stats columns. */\n  comparator?: string\n  /** Which split to read scores from. Default 'holdout'. */\n  split?: 'search' | 'holdout'\n  /** Confidence level for the bootstrap CI on the mean. Default 0.95. */\n  confidence?: number\n  /** FDR for BH adjustment of the comparison p-values. Default 0.05. */\n  fdr?: number\n}\n\nexport interface SummaryTableRow {\n  candidateId: string\n  n: number\n  mean: number\n  ciLow: number\n  ciHigh: number\n  /** BH-adjusted q-value vs comparator. NaN if no comparator. */\n  qValue: number\n  /** Cohen's d vs comparator. NaN if no comparator. */\n  cohensD: number\n}\n\nexport interface SummaryTable {\n  rows: SummaryTableRow[]\n  comparator: string | null\n  split: 'search' | 'holdout'\n  /** Pre-rendered markdown — drop into a paper or PR. */\n  markdown: string\n}\n\n/**\n * Table 1 helper. Buckets runs by `candidateId`, computes mean +\n * bootstrap CI on the chosen split, and (when a comparator is given)\n * BH-adjusted Wilcoxon p + Cohen's d versus that comparator.\n */\nexport function summaryTable(runs: RunRecord[], opts: SummaryTableOptions = {}): SummaryTable {\n  const split = opts.split ?? 'holdout'\n  const confidence = opts.confidence ?? 0.95\n  const fdr = opts.fdr ?? 0.05\n  const comparator = opts.comparator ?? null\n  const scoreField = split === 'holdout' ? 'holdoutScore' : 'searchScore'\n\n  const byCandidate = new Map<string, { runs: RunRecord[]; scores: number[] }>()\n  for (const r of runs) {\n    if (r.splitTag !== split) continue\n    const v = r.outcome[scoreField]\n    if (typeof v !== 'number' || !Number.isFinite(v)) continue\n    const bucket = byCandidate.get(r.candidateId) ?? { runs: [], scores: [] }\n    bucket.runs.push(r)\n    bucket.scores.push(v)\n    byCandidate.set(r.candidateId, bucket)\n  }\n\n  const candidateIds = [...byCandidate.keys()].sort()\n  const compRuns = comparator ? byCandidate.get(comparator) : undefined\n\n  // First pass: per-candidate means + CIs + raw p-values.\n  const tentative: Array<SummaryTableRow & { rawP: number }> = []\n  for (const id of candidateIds) {\n    const bucket = byCandidate.get(id)!\n    const ci = confidenceInterval(bucket.scores, confidence)\n    let rawP = Number.NaN\n    let d = Number.NaN\n    if (comparator && compRuns && id !== comparator) {\n      const paired = pairScoresByKey(bucket.runs, compRuns.runs, scoreField)\n      if (paired.before.length >= 6) {\n        rawP = wilcoxonSignedRank(paired.before, paired.after).p\n      }\n      d = cohensD(compRuns.scores, bucket.scores)\n    }\n    tentative.push({\n      candidateId: id,\n      n: bucket.scores.length,\n      mean: ci.mean,\n      ciLow: ci.lower,\n      ciHigh: ci.upper,\n      qValue: rawP,\n      cohensD: d,\n      rawP,\n    })\n  }\n\n  // BH-adjust across the comparison set (skip NaN rows / the\n  // comparator itself). Adjustment is a no-op when there are 0 or 1\n  // comparators.\n  if (comparator) {\n    const idxs: number[] = []\n    const ps: number[] = []\n    for (let i = 0; i < tentative.length; i++) {\n      const r = tentative[i]!\n      if (r.candidateId === comparator) continue\n      if (!Number.isFinite(r.rawP)) continue\n      idxs.push(i)\n      ps.push(r.rawP)\n    }\n    if (ps.length > 0) {\n      const { qValues } = benjaminiHochberg(ps, fdr)\n      for (let k = 0; k < idxs.length; k++) {\n        tentative[idxs[k]!]!.qValue = qValues[k]!\n      }\n    }\n  }\n\n  const rows = tentative.map(({ rawP: _rawP, ...rest }) => rest)\n  const markdown = renderSummaryTableMarkdown(rows, comparator, split)\n  return { rows, comparator, split, markdown }\n}\n\nfunction pairScoresByKey(\n  candidate: RunRecord[],\n  baseline: RunRecord[],\n  scoreField: 'searchScore' | 'holdoutScore',\n): { before: number[]; after: number[] } {\n  const baseIdx = new Map<string, number>()\n  for (const r of baseline) {\n    const v = r.outcome[scoreField]\n    if (typeof v === 'number' && Number.isFinite(v)) {\n      baseIdx.set(`${r.experimentId}::${r.seed}`, v)\n    }\n  }\n  const before: number[] = []\n  const after: number[] = []\n  for (const r of candidate) {\n    const v = r.outcome[scoreField]\n    if (typeof v !== 'number' || !Number.isFinite(v)) continue\n    const key = `${r.experimentId}::${r.seed}`\n    const b = baseIdx.get(key)\n    if (b === undefined) continue\n    before.push(b)\n    after.push(v)\n  }\n  return { before, after }\n}\n\nfunction renderSummaryTableMarkdown(\n  rows: SummaryTableRow[],\n  comparator: string | null,\n  split: 'search' | 'holdout',\n): string {\n  const lines: string[] = []\n  const cmpLabel = comparator ? ` (vs ${comparator})` : ''\n  lines.push(`Summary Table — ${split} split${cmpLabel}`)\n  lines.push('')\n  lines.push(\"| Candidate | N | Mean | 95% CI | q (BH) | Cohen's d |\")\n  lines.push('|---|---:|---:|---|---:|---:|')\n  for (const r of rows) {\n    const ci = `[${fmt(r.ciLow)}, ${fmt(r.ciHigh)}]`\n    const q = Number.isFinite(r.qValue) ? r.qValue.toFixed(4) : '—'\n    const d = Number.isFinite(r.cohensD) ? r.cohensD.toFixed(3) : '—'\n    lines.push(`| ${r.candidateId} | ${r.n} | ${fmt(r.mean)} | ${ci} | ${q} | ${d} |`)\n  }\n  return lines.join('\\n')\n}\n\n// ── paretoChart ─────────────────────────────────────────────────────\n\nexport interface ParetoPoint {\n  candidateId: string\n  /** Mean USD cost per run on the chosen split. */\n  cost: number\n  /** Mean score on the chosen split. */\n  quality: number\n  /** Number of runs that informed this point. */\n  n: number\n  /** Whether this candidate is on the Pareto frontier — high\n   *  quality, low cost, no dominator. */\n  onFrontier: boolean\n  /** Optional gate verdict for this candidate, if a `GateDecision`\n   *  for it was passed in. */\n  gate?: 'promote' | 'reject_few_runs' | 'reject_negative_delta' | 'reject_overfit_gap' | null\n}\n\nexport interface ParetoFigureSpec {\n  kind: 'pareto-cost-quality'\n  split: 'search' | 'holdout'\n  points: ParetoPoint[]\n  axes: { x: 'costUsd'; y: 'score' }\n}\n\n/**\n * Cost vs quality scatter spec. `gateDecisions` is keyed by\n * candidate id; if present, every point picks up the gate verdict\n * for overlay.\n */\nexport function paretoChart(\n  runs: RunRecord[],\n  opts: {\n    split?: 'search' | 'holdout'\n    gateDecisions?: Record<string, GateDecision>\n  } = {},\n): ParetoFigureSpec {\n  const split = opts.split ?? 'holdout'\n  const scoreField = split === 'holdout' ? 'holdoutScore' : 'searchScore'\n\n  const buckets = new Map<string, { cost: number[]; quality: number[] }>()\n  for (const r of runs) {\n    if (r.splitTag !== split) continue\n    const v = r.outcome[scoreField]\n    if (typeof v !== 'number' || !Number.isFinite(v)) continue\n    const bucket = buckets.get(r.candidateId) ?? { cost: [], quality: [] }\n    bucket.cost.push(r.costUsd)\n    bucket.quality.push(v)\n    buckets.set(r.candidateId, bucket)\n  }\n\n  const points: ParetoPoint[] = []\n  for (const [candidateId, bucket] of buckets.entries()) {\n    points.push({\n      candidateId,\n      cost: avg(bucket.cost),\n      quality: avg(bucket.quality),\n      n: bucket.cost.length,\n      onFrontier: false,\n      gate: opts.gateDecisions?.[candidateId]\n        ? gateLabel(opts.gateDecisions[candidateId]!)\n        : undefined,\n    })\n  }\n\n  // Pareto: minimize cost, maximize quality. A point is dominated if\n  // some other point has lower-or-equal cost AND higher-or-equal\n  // quality with strict inequality somewhere.\n  for (const p of points) {\n    p.onFrontier = !points.some((q) => q !== p && dominates(q, p))\n  }\n\n  return {\n    kind: 'pareto-cost-quality',\n    split,\n    axes: { x: 'costUsd', y: 'score' },\n    points,\n  }\n}\n\nfunction dominates(a: ParetoPoint, b: ParetoPoint): boolean {\n  return a.cost <= b.cost && a.quality >= b.quality && (a.cost < b.cost || a.quality > b.quality)\n}\n\nfunction gateLabel(d: GateDecision): ParetoPoint['gate'] {\n  if (d.promote) return 'promote'\n  if (d.rejectionCode === 'few_runs') return 'reject_few_runs'\n  if (d.rejectionCode === 'negative_delta') return 'reject_negative_delta'\n  if (d.rejectionCode === 'overfit_gap') return 'reject_overfit_gap'\n  return null\n}\n\n// ── gainHistogram ───────────────────────────────────────────\n\nexport interface GainDistributionBin {\n  /** Inclusive lower edge. */\n  lo: number\n  /** Exclusive upper edge (or inclusive if it's the last bin). */\n  hi: number\n  /** Number of pairs whose delta lands in this bin. */\n  count: number\n}\n\nexport interface GainDistributionFigureSpec {\n  kind: 'gain-distribution'\n  candidateId: string\n  comparator: string\n  split: 'search' | 'holdout'\n  /** Number of pairs used. */\n  n: number\n  bins: GainDistributionBin[]\n  median: number\n  ci: { low: number; high: number }\n}\n\nexport interface GainDistributionOptions {\n  /** Number of histogram bins. Default 11 (so the centre is exact at 0). */\n  bins?: number\n  /** Which split to use. Default 'holdout'. */\n  split?: 'search' | 'holdout'\n  /** Confidence level for the CI. Default 0.95. */\n  confidence?: number\n  /** Bootstrap resamples. Default 2000. */\n  resamples?: number\n  /** Deterministic seed. */\n  seed?: number\n}\n\n/**\n * Held-out improvement distribution: per-pair delta (candidate −\n * comparator), histogrammed. Includes the bootstrap CI on the median\n * delta — same primitive the promotion gate uses.\n */\nexport function gainHistogram(\n  runs: RunRecord[],\n  candidateId: string,\n  comparator: string,\n  opts: GainDistributionOptions = {},\n): GainDistributionFigureSpec {\n  const split = opts.split ?? 'holdout'\n  const scoreField = split === 'holdout' ? 'holdoutScore' : 'searchScore'\n  const binCount = opts.bins ?? 11\n  if (binCount < 1) throw new Error('gainHistogram: bins must be ≥ 1')\n\n  const candidate = runs.filter((r) => r.candidateId === candidateId && r.splitTag === split)\n  const baseline = runs.filter((r) => r.candidateId === comparator && r.splitTag === split)\n  // pairScoresByKey returns before=baseline-score, after=candidate-score\n  // for each (experimentId, seed) pair where both sides recorded a\n  // valid score on this split. delta = after - before = candidate - baseline.\n  const { before, after } = pairScoresByKey(candidate, baseline, scoreField)\n  const n = before.length\n\n  if (n === 0) {\n    return {\n      kind: 'gain-distribution',\n      candidateId,\n      comparator,\n      split,\n      n: 0,\n      bins: [],\n      median: 0,\n      ci: { low: 0, high: 0 },\n    }\n  }\n\n  const deltas = before.map((b, i) => after[i]! - b)\n  const sortedDeltas = [...deltas].sort((a, b) => a - b)\n  const median = medianOfSorted(sortedDeltas)\n  const min = sortedDeltas[0]!\n  const max = sortedDeltas[sortedDeltas.length - 1]!\n\n  // Symmetric bins around the wider of (|min|, |max|) so the chart\n  // visually centres on zero without dropping outliers.\n  const bound = Math.max(Math.abs(min), Math.abs(max), 1e-6)\n  const lo = -bound\n  const hi = bound\n  const width = (hi - lo) / binCount\n  const bins: GainDistributionBin[] = []\n  for (let i = 0; i < binCount; i++) {\n    bins.push({ lo: lo + i * width, hi: lo + (i + 1) * width, count: 0 })\n  }\n  for (const d of deltas) {\n    let idx = Math.floor((d - lo) / width)\n    if (idx < 0) idx = 0\n    if (idx >= binCount) idx = binCount - 1\n    bins[idx]!.count += 1\n  }\n\n  const ci = pairedBootstrap(before, after, {\n    confidence: opts.confidence ?? 0.95,\n    resamples: opts.resamples ?? 2000,\n    statistic: 'median',\n    seed: opts.seed,\n  })\n\n  return {\n    kind: 'gain-distribution',\n    candidateId,\n    comparator,\n    split,\n    n,\n    bins,\n    median,\n    ci: { low: ci.low, high: ci.high },\n  }\n}\n\n// ── researchReport ───────────────────────────────────────────────────\n\nexport type ResearchReportDecision =\n  | 'promote'\n  | 'hold'\n  | 'reject'\n  | 'equivalent'\n  | 'needs_more_data'\n\n/**\n * Hard floor below which a paired comparison is treated as uninformative\n * regardless of `minPairs`. Mirrors the lower limit on Wilcoxon signed-rank\n * exact tables; below this the test has no power to separate effect sizes.\n */\nexport const RESEARCH_REPORT_HARD_PAIR_FLOOR = 6\n\nexport interface ResearchReportOptions {\n  /** Human-readable report title. */\n  title?: string\n  /** Comparator candidate id. Required for statistical decision guidance. */\n  comparator?: string\n  /** Which split to use for the primary decision. Default 'holdout'. */\n  split?: 'search' | 'holdout'\n  /** Confidence level used by lower-level report helpers. Default 0.95. */\n  confidence?: number\n  /** FDR threshold for q-values. Default 0.05. */\n  fdr?: number\n  /**\n   * Soft floor on paired observations before issuing a directional\n   * promote / reject. Below this we report `needs_more_data` and surface the\n   * minimum detectable effect at the current N. Default 20 — chosen so the\n   * Wilcoxon signed-rank approximation is reasonable and so the paired\n   * bootstrap CI has non-degenerate coverage. Hard floor is enforced at\n   * `RESEARCH_REPORT_HARD_PAIR_FLOOR` (6) regardless of this value.\n   */\n  minPairs?: number\n  /**\n   * Region of Practical Equivalence on the paired delta. When a candidate's\n   * paired-delta CI is fully contained in `[low, high]`, the decision is\n   * `equivalent` rather than `hold`. Sourced from the domain owner — there is\n   * no statistically-defensible default.\n   */\n  rope?: { low: number; high: number }\n  /**\n   * Power for the minimum detectable effect (MDE) reported on each candidate.\n   * Default 0.8.\n   */\n  mdePower?: number\n  /**\n   * Two-sided alpha for the MDE. Default matches `fdr` so the reported MDE\n   * lines up with the test the report actually runs.\n   */\n  mdeAlpha?: number\n  /** Optional held-out gate decisions keyed by candidate id. */\n  gateDecisions?: Record<string, GateDecision>\n  /** Optional failure clusters from failureClusterView. */\n  failureClusters?: FailureClusterReport\n  /** Build gain histograms for these candidates. Defaults to all non-comparator candidates. */\n  candidateIds?: string[]\n  /** Deterministic bootstrap seed passed to gainHistogram and the posterior helper. */\n  seed?: number\n  /** Report timestamp. Defaults to current time. */\n  generatedAt?: string\n  /**\n   * Hash of a preregistered protocol (e.g. `signManifest({...}).contentHash`).\n   * Embedded verbatim in the report so the analysis can be cited as the\n   * preregistered one rather than a post-hoc fishing expedition.\n   */\n  preregistrationHash?: string\n}\n\nexport interface ResearchReportRecommendation {\n  decision: ResearchReportDecision\n  candidateId: string | null\n  rationale: string[]\n  risks: string[]\n  nextActions: string[]\n}\n\nexport interface ResearchReportCandidate {\n  candidateId: string\n  n: number\n  mean: number\n  ciLow: number\n  ciHigh: number\n  qValue: number\n  cohensD: number\n  meanDeltaVsComparator: number | null\n  pairedN: number\n  medianGain: number | null\n  meanGain: number | null\n  gainCi: { low: number; high: number } | null\n  /**\n   * Bayesian-bootstrap-style posterior summaries on the paired delta. Computed\n   * from the same resamples that produce the gain CI; interpretable as\n   * \"fraction of resamples in which the candidate beats the comparator on\n   * matched pairs.\"\n   */\n  prGreaterThanZero: number | null\n  prInRope: number | null\n  /**\n   * Minimum detectable effect (in score units) at the candidate's paired N,\n   * the configured power, and the configured alpha. Standardised by the\n   * observed paired-delta SD and inverted via `requiredSampleSize`. Reported\n   * for every candidate so a `needs_more_data` verdict is actionable.\n   */\n  mde: number | null\n  onParetoFrontier: boolean\n  gate?: ParetoPoint['gate']\n  decision: ResearchReportDecision\n  decisionReason: string\n}\n\nexport interface ResearchReportMethodology {\n  /**\n   * Plain-language assumptions the report depends on. Read these first when\n   * deciding whether the verdict is load-bearing for a launch decision.\n   */\n  assumptions: string[]\n  /** Tests and estimators the verdict was computed from. */\n  methods: string[]\n  /** Alternatives the author considered and why this report didn't take them. */\n  alternatives: string[]\n  /** Failure modes — when this report should NOT drive a decision. */\n  whenNotToApply: string[]\n  /** Citations for the methodological choices above. */\n  citations: string[]\n}\n\nexport interface ResearchReport {\n  kind: 'agent-eval-research-report'\n  title: string\n  generatedAt: string\n  split: 'search' | 'holdout'\n  comparator: string | null\n  /**\n   * SHA-256 over the canonicalised set of `(runId, candidateId, split)` triples\n   * the report was computed from, plus the comparator and split. Stable across\n   * key insertion order; recomputable by the reader to verify provenance.\n   */\n  runFingerprint: string\n  preregistrationHash: string | null\n  rope: { low: number; high: number } | null\n  executiveSummary: string[]\n  recommendation: ResearchReportRecommendation\n  candidates: ResearchReportCandidate[]\n  summary: SummaryTable\n  charts: {\n    pareto: ParetoFigureSpec\n    gains: GainDistributionFigureSpec[]\n  }\n  methodology: ResearchReportMethodology\n  failureClusters?: FailureClusterReport\n  markdown: string\n  html: string\n}\n\n/**\n * Internal: paired posterior summary on (candidate − comparator) deltas.\n *\n * Returns the bootstrap CI on the median (matching `gainHistogram`) plus\n * Bayesian-flavoured posterior summaries Pr(Δ>0) and Pr(Δ∈ROPE) computed\n * from a Bayesian-bootstrap-flavoured resample distribution on the mean\n * (Rubin 1981 — non-informative bootstrap-prior duality), and the\n * minimum detectable paired effect at the configured power and α.\n *\n * `null` is returned when no paired observations exist; callers must\n * gate on `n` before consuming the bootstrap statistics.\n */\nfunction pairedPosterior(\n  runs: RunRecord[],\n  candidateId: string,\n  comparator: string,\n  opts: {\n    split: 'search' | 'holdout'\n    confidence: number\n    seed?: number\n    rope: { low: number; high: number } | null\n    mdePower: number\n    mdeAlpha: number\n  },\n): {\n  n: number\n  meanDelta: number\n  medianDelta: number\n  sdDelta: number\n  ci: { low: number; high: number }\n  prGreaterThanZero: number\n  prInRope: number | null\n  mde: number\n} | null {\n  const scoreField = opts.split === 'holdout' ? 'holdoutScore' : 'searchScore'\n  const candidate = runs.filter((r) => r.candidateId === candidateId && r.splitTag === opts.split)\n  const baseline = runs.filter((r) => r.candidateId === comparator && r.splitTag === opts.split)\n  const { before, after } = pairScoresByKey(candidate, baseline, scoreField)\n  const n = before.length\n  if (n === 0) return null\n\n  const deltas = before.map((b, i) => after[i]! - b)\n  const meanDelta = deltas.reduce((s, x) => s + x, 0) / n\n  const sortedDeltas = [...deltas].sort((a, b) => a - b)\n  const medianDelta = medianOfSorted(sortedDeltas)\n  const sdDelta = stdev(deltas, meanDelta)\n\n  const ci = pairedBootstrap(before, after, {\n    confidence: opts.confidence,\n    resamples: 2000,\n    statistic: 'median',\n    seed: opts.seed,\n  })\n\n  // Enumerate bootstrap-mean samples to derive posterior summaries on the\n  // mean delta. Same RNG family as `pairedBootstrap` but kept local so we can\n  // examine the full sample distribution rather than just quantiles.\n  const meanSamples = bootstrapMeanSamples(deltas, 2000, opts.seed)\n  const prGreaterThanZero =\n    meanSamples.length === 0 ? 0 : meanSamples.filter((s) => s > 0).length / meanSamples.length\n  const prInRope =\n    opts.rope === null || meanSamples.length === 0\n      ? null\n      : meanSamples.filter((s) => s >= opts.rope!.low && s <= opts.rope!.high).length /\n        meanSamples.length\n\n  const dStandardised = pairedMde({ nPaired: n, alpha: opts.mdeAlpha, power: opts.mdePower })\n  const mde = sdDelta === 0 ? 0 : dStandardised * sdDelta\n\n  return {\n    n,\n    meanDelta,\n    medianDelta,\n    sdDelta,\n    ci: { low: ci.low, high: ci.high },\n    prGreaterThanZero,\n    prInRope,\n    mde,\n  }\n}\n\nfunction bootstrapMeanSamples(deltas: number[], resamples: number, seed?: number): number[] {\n  const n = deltas.length\n  if (n === 0) return []\n  if (n === 1) return new Array<number>(resamples).fill(deltas[0]!)\n  const rng = seedRng(seed)\n  const samples = new Array<number>(resamples)\n  for (let b = 0; b < resamples; b++) {\n    let sum = 0\n    for (let k = 0; k < n; k++) sum += deltas[Math.floor(rng() * n)]!\n    samples[b] = sum / n\n  }\n  return samples\n}\n\nfunction seedRng(seed?: number): () => number {\n  if (seed === undefined) return Math.random\n  let s = seed >>> 0\n  return () => {\n    s = (s + 0x6d2b79f5) >>> 0\n    let t = s\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\nfunction stdev(xs: number[], mean: number): number {\n  if (xs.length < 2) return 0\n  let sse = 0\n  for (const x of xs) sse += (x - mean) ** 2\n  return Math.sqrt(sse / (xs.length - 1))\n}\n\n/**\n * Executive research report for CPO / AI-lead / launch-review consumption.\n *\n * Composes:\n *   - `summaryTable`         marginal stats with BH-FDR-adjusted q-values\n *   - `paretoChart`           cost-vs-quality frontier with gate overlay\n *   - `gainHistogram`         per-candidate paired-delta distribution\n *   - paired posterior (this file): bootstrap CI on median, Pr(Δ>0),\n *                              Pr(Δ∈ROPE), MDE at the configured power\n *\n * Decisions are made on paired evidence — never on marginal means alone —\n * and respect any held-out gate decision the caller passes through. The\n * report embeds a SHA-256 fingerprint of the input run set and, optionally,\n * the hash of a preregistered protocol so a downstream reader can verify\n * provenance and that the analysis was the preregistered one.\n *\n * Async because the fingerprint uses Web Crypto via `hashJson`; deterministic\n * for any fixed `runs`, `seed`, and ROPE.\n */\nexport async function researchReport(\n  runs: RunRecord[],\n  opts: ResearchReportOptions = {},\n): Promise<ResearchReport> {\n  const split = opts.split ?? 'holdout'\n  const comparator = opts.comparator ?? null\n  const confidence = opts.confidence ?? 0.95\n  const fdr = opts.fdr ?? 0.05\n  const minPairs = Math.max(opts.minPairs ?? 20, RESEARCH_REPORT_HARD_PAIR_FLOOR)\n  const rope = opts.rope ?? null\n  const mdePower = opts.mdePower ?? 0.8\n  const mdeAlpha = opts.mdeAlpha ?? fdr\n  const title = opts.title ?? 'Agent Evaluation Research Report'\n  const generatedAt = opts.generatedAt ?? new Date().toISOString()\n  const preregistrationHash = opts.preregistrationHash ?? null\n\n  if (rope && !(Number.isFinite(rope.low) && Number.isFinite(rope.high) && rope.low <= rope.high)) {\n    throw new Error(\n      `researchReport: rope must satisfy low ≤ high with finite bounds, got ${JSON.stringify(rope)}`,\n    )\n  }\n\n  const summary = summaryTable(runs, {\n    comparator: comparator ?? undefined,\n    split,\n    confidence,\n    fdr,\n  })\n  const pareto = paretoChart(runs, { split, gateDecisions: opts.gateDecisions })\n  const candidateIds =\n    opts.candidateIds ?? summary.rows.map((r) => r.candidateId).filter((id) => id !== comparator)\n  const gains = comparator\n    ? candidateIds.map((id) =>\n        gainHistogram(runs, id, comparator, {\n          split,\n          confidence,\n          seed: opts.seed,\n        }),\n      )\n    : []\n\n  const gainByCandidate = new Map(gains.map((g) => [g.candidateId, g]))\n  const paretoByCandidate = new Map(pareto.points.map((p) => [p.candidateId, p]))\n  const posteriorByCandidate = new Map<string, ReturnType<typeof pairedPosterior>>()\n  if (comparator) {\n    for (const id of candidateIds) {\n      posteriorByCandidate.set(\n        id,\n        pairedPosterior(runs, id, comparator, {\n          split,\n          confidence,\n          seed: opts.seed,\n          rope,\n          mdePower,\n          mdeAlpha,\n        }),\n      )\n    }\n  }\n\n  const candidates = summary.rows\n    .map((row) => {\n      const gain = gainByCandidate.get(row.candidateId)\n      const point = paretoByCandidate.get(row.candidateId)\n      const posterior = posteriorByCandidate.get(row.candidateId) ?? null\n      const classified = classifyCandidate(row, {\n        comparator,\n        posterior,\n        point,\n        fdr,\n        minPairs,\n        rope,\n      })\n      return {\n        candidateId: row.candidateId,\n        n: row.n,\n        mean: row.mean,\n        ciLow: row.ciLow,\n        ciHigh: row.ciHigh,\n        qValue: row.qValue,\n        cohensD: row.cohensD,\n        meanDeltaVsComparator: posterior ? posterior.meanDelta : null,\n        pairedN: posterior?.n ?? gain?.n ?? 0,\n        medianGain: posterior ? posterior.medianDelta : gain ? gain.median : null,\n        meanGain: posterior ? posterior.meanDelta : null,\n        gainCi: posterior ? posterior.ci : gain ? gain.ci : null,\n        prGreaterThanZero: posterior ? posterior.prGreaterThanZero : null,\n        prInRope: posterior ? posterior.prInRope : null,\n        mde: posterior ? posterior.mde : null,\n        onParetoFrontier: point?.onFrontier ?? false,\n        gate: point?.gate,\n        decision: classified.decision,\n        decisionReason: classified.reason,\n      } satisfies ResearchReportCandidate\n    })\n    .sort((a, b) => {\n      const decisionRank = decisionWeight(b.decision) - decisionWeight(a.decision)\n      if (decisionRank !== 0) return decisionRank\n      return b.mean - a.mean\n    })\n\n  const recommendation = buildRecommendation(candidates, {\n    comparator,\n    failureClusters: opts.failureClusters,\n    rope,\n    minPairs,\n    preregistrationHash,\n  })\n  const executiveSummary = buildExecutiveSummary(candidates, recommendation, {\n    comparator,\n    split,\n    failureClusters: opts.failureClusters,\n    preregistrationHash,\n  })\n  const methodology = buildMethodology({\n    split,\n    comparator,\n    fdr,\n    minPairs,\n    rope,\n    confidence,\n    mdePower,\n    mdeAlpha,\n  })\n\n  const runFingerprint = await hashJson(\n    canonicalize({\n      triples: runs\n        .filter((r) => r.splitTag === split)\n        .map((r) => ({ runId: r.runId, candidateId: r.candidateId, splitTag: r.splitTag }))\n        .sort((a, b) => a.runId.localeCompare(b.runId)),\n      comparator,\n      split,\n    }),\n  )\n\n  const markdown = renderResearchMarkdown({\n    title,\n    generatedAt,\n    split,\n    comparator,\n    rope,\n    runFingerprint,\n    preregistrationHash,\n    executiveSummary,\n    recommendation,\n    candidates,\n    summary,\n    pareto,\n    gains,\n    methodology,\n    failureClusters: opts.failureClusters,\n  })\n  const html = renderResearchHtml(markdown, title)\n\n  return {\n    kind: 'agent-eval-research-report',\n    title,\n    generatedAt,\n    split,\n    comparator,\n    runFingerprint,\n    preregistrationHash,\n    rope,\n    executiveSummary,\n    recommendation,\n    candidates,\n    summary,\n    charts: { pareto, gains },\n    methodology,\n    failureClusters: opts.failureClusters,\n    markdown,\n    html,\n  }\n}\n\nfunction buildMethodology(ctx: {\n  split: 'search' | 'holdout'\n  comparator: string | null\n  fdr: number\n  minPairs: number\n  rope: { low: number; high: number } | null\n  confidence: number\n  mdePower: number\n  mdeAlpha: number\n}): ResearchReportMethodology {\n  const assumptions: string[] = [\n    'Pairs are matched by (experimentId, seed); the candidate and comparator see the same scenarios in the same order.',\n    'Paired deltas are exchangeable conditional on the matched scenario — no mid-run distribution shift.',\n    `Decisions are pre-specified at fdr=${ctx.fdr}, minPairs=${ctx.minPairs}, confidence=${ctx.confidence}; deviating from these post-hoc invalidates the false-discovery control.`,\n  ]\n  if (ctx.rope) {\n    assumptions.push(\n      `The Region of Practical Equivalence ${formatRope(ctx.rope)} is supplied by the domain owner; equivalent verdicts are only meaningful if that range is treated as the standing definition of \"no material difference.\"`,\n    )\n  }\n  if (ctx.comparator === null) {\n    assumptions.push('No comparator was configured; this run is descriptive, not causal.')\n  }\n  const methods: string[] = [\n    \"Marginal scores summarised with BH-FDR-adjusted Wilcoxon signed-rank q-values and Cohen's d via summaryTable.\",\n    'Paired evidence summarised with bootstrap CI on the median delta and Bayesian-bootstrap-style Pr(Δ>0) and Pr(Δ∈ROPE) on the mean delta.',\n    `Minimum detectable effect reported per candidate at α=${ctx.mdeAlpha} (two-sided), power=${ctx.mdePower}, standardised by the observed paired-delta SD.`,\n    'Pareto frontier flagged as a separate axis (cost vs quality); a candidate can be on-frontier without winning the paired test.',\n    'Held-out gate decisions, when supplied, override the statistical verdict in the reject direction.',\n  ]\n  const alternatives: string[] = [\n    'Paired t-test rejected: not robust to the heavy-tailed score distributions common in agent benchmarks.',\n    'Unpaired Mann–Whitney rejected: matched scenarios make pairing free; unpaired throws away that variance reduction.',\n    'Sequential / always-valid inference (e-values, mSPRT) is the right tool for iterative sweeps and is out of scope for this single-look report — preregister and run once, or wrap this report in an alpha-spending schedule.',\n    'Hierarchical Bayesian shrinkage across many candidates is future work; the current ranking uses raw paired statistics.',\n  ]\n  const whenNotToApply: string[] = [\n    `Paired N below ${RESEARCH_REPORT_HARD_PAIR_FLOOR} on any candidate — the bootstrap CI is degenerate.`,\n    'Comparator chosen post-hoc by inspecting the same data; q-values are no longer false-discovery-controlled.',\n    'Scenarios not drawn under a stable preregistered protocol; the report can describe the data but cannot anchor a launch decision.',\n    'Score distributions with mid-run shift (judge model swap, rubric change, infra outage) — pair exchangeability is violated.',\n  ]\n  const citations: string[] = [\n    'Benjamini, Y. & Hochberg, Y. (1995). Controlling the false discovery rate: a practical and powerful approach to multiple testing. JRSS B, 57(1), 289–300.',\n    'Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80–83.',\n    'Efron, B. (1979). Bootstrap methods: another look at the jackknife. Annals of Statistics, 7(1), 1–26.',\n    'Rubin, D. B. (1981). The Bayesian bootstrap. Annals of Statistics, 9(1), 130–134.',\n    'Kruschke, J. K. (2018). Rejecting or accepting parameter values in Bayesian estimation. Advances in Methods and Practices in Psychological Science, 1(2), 270–280. (ROPE.)',\n  ]\n  return { assumptions, methods, alternatives, whenNotToApply, citations }\n}\n\nfunction formatRope(rope: { low: number; high: number }): string {\n  return `[${fmt(rope.low)}, ${fmt(rope.high)}]`\n}\n\nfunction classifyCandidate(\n  row: SummaryTableRow,\n  ctx: {\n    comparator: string | null\n    posterior: ReturnType<typeof pairedPosterior> | null\n    point?: ParetoPoint\n    fdr: number\n    minPairs: number\n    rope: { low: number; high: number } | null\n  },\n): { decision: ResearchReportDecision; reason: string } {\n  if (ctx.comparator && row.candidateId === ctx.comparator) {\n    return { decision: 'hold', reason: 'Comparator baseline.' }\n  }\n  if (!ctx.comparator) {\n    return {\n      decision: ctx.point?.onFrontier ? 'hold' : 'needs_more_data',\n      reason:\n        'No comparator configured; report ranks candidates but cannot anchor a promotion call.',\n    }\n  }\n  // Held-out gate is authoritative against — promote requires statistical\n  // evidence even if the gate said `promote` (gate is necessary, not sufficient).\n  if (ctx.point?.gate && ctx.point.gate !== 'promote') {\n    return { decision: 'reject', reason: `Held-out gate returned ${ctx.point.gate}.` }\n  }\n  if (!ctx.posterior || ctx.posterior.n < RESEARCH_REPORT_HARD_PAIR_FLOOR) {\n    return {\n      decision: 'needs_more_data',\n      reason: `Only ${ctx.posterior?.n ?? 0} paired observations; below hard floor of ${RESEARCH_REPORT_HARD_PAIR_FLOOR} for any paired inference.`,\n    }\n  }\n  const ci = ctx.posterior.ci\n  if (ctx.rope && ci.low >= ctx.rope.low && ci.high <= ctx.rope.high) {\n    return {\n      decision: 'equivalent',\n      reason: `Paired-delta CI [${fmt(ci.low)}, ${fmt(ci.high)}] is fully inside ROPE ${formatRope(ctx.rope)}; candidate is practically equivalent to comparator.`,\n    }\n  }\n  const significant = Number.isFinite(row.qValue) && row.qValue <= ctx.fdr\n  const gainPositive = ci.low > 0\n  const gainNegative = ci.high < 0\n  if (gainNegative) {\n    return {\n      decision: 'reject',\n      reason: `Paired-delta CI [${fmt(ci.low)}, ${fmt(ci.high)}] lies entirely below zero.`,\n    }\n  }\n  if (ctx.posterior.n < ctx.minPairs) {\n    return {\n      decision: 'needs_more_data',\n      reason: `Only ${ctx.posterior.n} paired observations; minimum detectable effect at this N is ${fmt(ctx.posterior.mde)} score units (need ≥ ${ctx.minPairs} pairs to issue a directional verdict).`,\n    }\n  }\n  if (significant && gainPositive) {\n    return {\n      decision: 'promote',\n      reason: `BH-adjusted q=${fmt(row.qValue)} ≤ ${ctx.fdr} and paired-delta CI [${fmt(ci.low)}, ${fmt(ci.high)}] excludes zero; Pr(Δ>0)=${fmt(ctx.posterior.prGreaterThanZero)}.`,\n    }\n  }\n  return {\n    decision: 'hold',\n    reason: `Pr(Δ>0)=${fmt(ctx.posterior.prGreaterThanZero)} but CI [${fmt(ci.low)}, ${fmt(ci.high)}] crosses zero; effect not decisive at fdr=${ctx.fdr}.`,\n  }\n}\n\nfunction buildRecommendation(\n  candidates: ResearchReportCandidate[],\n  ctx: {\n    comparator: string | null\n    failureClusters?: FailureClusterReport\n    rope: { low: number; high: number } | null\n    minPairs: number\n    preregistrationHash: string | null\n  },\n): ResearchReportRecommendation {\n  const nonComparator = candidates.filter((c) => c.candidateId !== ctx.comparator)\n  const bestPromote = nonComparator.find((c) => c.decision === 'promote')\n  const bestEquivalent = nonComparator.find((c) => c.decision === 'equivalent')\n  const chosen = bestPromote ?? bestEquivalent ?? nonComparator[0] ?? null\n  const decision: ResearchReportDecision = bestPromote\n    ? 'promote'\n    : nonComparator.some((c) => c.decision === 'needs_more_data')\n      ? 'needs_more_data'\n      : bestEquivalent\n        ? 'equivalent'\n        : nonComparator.some((c) => c.decision === 'hold')\n          ? 'hold'\n          : 'reject'\n\n  const rationale: string[] = []\n  const risks: string[] = []\n  const nextActions: string[] = []\n\n  if (chosen) {\n    rationale.push(`${chosen.candidateId}: ${chosen.decisionReason}`)\n    if (chosen.gainCi) {\n      const probSummary =\n        chosen.prGreaterThanZero !== null ? `, Pr(Δ>0)=${fmt(chosen.prGreaterThanZero)}` : ''\n      rationale.push(\n        `Median paired gain CI: [${fmt(chosen.gainCi.low)}, ${fmt(chosen.gainCi.high)}]${probSummary}.`,\n      )\n    }\n    if (chosen.mde !== null && Number.isFinite(chosen.mde)) {\n      rationale.push(`MDE at current paired N=${chosen.pairedN}: ${fmt(chosen.mde)} score units.`)\n    }\n  }\n  if (!ctx.comparator) {\n    risks.push('No comparator was configured; verdict is descriptive, not causal.')\n    nextActions.push('Re-run with a stable comparator candidate for paired inference.')\n  }\n  if (!ctx.preregistrationHash) {\n    risks.push(\n      'No preregistration hash supplied; readers cannot verify the analysis was specified before data inspection.',\n    )\n    nextActions.push(\n      'Sign a HypothesisManifest before the next sweep and pass `preregistrationHash` so the report cites it.',\n    )\n  }\n  if (ctx.rope === null && nonComparator.length > 0) {\n    risks.push(\n      'No ROPE configured; the report cannot distinguish \"equivalent\" from \"inconclusive\".',\n    )\n    nextActions.push(\n      'Define a domain-specific Region of Practical Equivalence and pass it to lock in the equivalence threshold.',\n    )\n  }\n  const inconclusive = nonComparator.filter((c) => c.decision === 'needs_more_data')\n  if (inconclusive.length > 0) {\n    const worst = inconclusive.reduce((a, b) => (b.pairedN < a.pairedN ? b : a))\n    risks.push(\n      `${inconclusive.length} candidate(s) below soft floor (${ctx.minPairs} pairs); thinnest is ${worst.candidateId} with ${worst.pairedN}.`,\n    )\n    nextActions.push(\n      `Collect at least ${ctx.minPairs - worst.pairedN} more matched holdout runs for ${worst.candidateId}.`,\n    )\n  }\n  const rejected = nonComparator.filter((c) => c.decision === 'reject')\n  if (rejected.length > 0) {\n    risks.push(\n      `${rejected.length} candidate(s) failed the paired test or held-out gate; do not ship those variants.`,\n    )\n  }\n  if (ctx.failureClusters && ctx.failureClusters.clusters.length > 0) {\n    const top = ctx.failureClusters.clusters[0]!\n    risks.push(`Top failure cluster: ${top.failureClass} across ${top.runCount} run(s).`)\n    nextActions.push('Prioritize the largest failure cluster before broad rollout.')\n  }\n  if (decision === 'promote') {\n    nextActions.push('Ship behind the existing promotion gate and monitor canaries.')\n  } else if (decision === 'hold') {\n    nextActions.push('Keep current production candidate while expanding holdout evidence.')\n  } else if (decision === 'equivalent') {\n    nextActions.push(\n      'Either keep the comparator (no quality regression) or promote on cost/latency grounds — equivalence does not justify either; the choice is a product decision, not a stats one.',\n    )\n  } else if (decision === 'reject') {\n    nextActions.push(\n      'Do not promote this sweep; inspect failures and generate a revised candidate.',\n    )\n  }\n\n  return {\n    decision,\n    candidateId: chosen?.candidateId ?? null,\n    rationale,\n    risks,\n    nextActions,\n  }\n}\n\nfunction buildExecutiveSummary(\n  candidates: ResearchReportCandidate[],\n  recommendation: ResearchReportRecommendation,\n  ctx: {\n    comparator: string | null\n    split: 'search' | 'holdout'\n    failureClusters?: FailureClusterReport\n    preregistrationHash: string | null\n  },\n): string[] {\n  const lines: string[] = []\n  const nonComparator = candidates.filter((c) => c.candidateId !== ctx.comparator)\n  lines.push(\n    `Evaluated ${nonComparator.length} candidate(s) on the ${ctx.split} split${ctx.comparator ? ` against ${ctx.comparator}` : ''}.`,\n  )\n  lines.push(\n    `Recommendation: ${recommendation.decision}${recommendation.candidateId ? ` ${recommendation.candidateId}` : ''}.`,\n  )\n  const promoted = nonComparator.filter((c) => c.decision === 'promote').length\n  const held = nonComparator.filter((c) => c.decision === 'hold').length\n  const equivalent = nonComparator.filter((c) => c.decision === 'equivalent').length\n  const rejected = nonComparator.filter((c) => c.decision === 'reject').length\n  const more = nonComparator.filter((c) => c.decision === 'needs_more_data').length\n  lines.push(\n    `Decision mix: ${promoted} promote, ${equivalent} equivalent, ${held} hold, ${rejected} reject, ${more} need more data.`,\n  )\n  const frontier = nonComparator.filter((c) => c.onParetoFrontier).map((c) => c.candidateId)\n  if (frontier.length > 0) lines.push(`Pareto-frontier candidates: ${frontier.join(', ')}.`)\n  if (ctx.failureClusters) {\n    lines.push(\n      `Failure clustering found ${ctx.failureClusters.totalFailures}/${ctx.failureClusters.totalRuns} failed runs across ${ctx.failureClusters.clusters.length} reportable cluster(s).`,\n    )\n  }\n  lines.push(\n    ctx.preregistrationHash\n      ? `Preregistered analysis: ${ctx.preregistrationHash.slice(0, 12)}…`\n      : 'Analysis is post-hoc — no preregistration hash supplied.',\n  )\n  return lines\n}\n\nfunction renderResearchMarkdown(report: {\n  title: string\n  generatedAt: string\n  split: 'search' | 'holdout'\n  comparator: string | null\n  executiveSummary: string[]\n  recommendation: ResearchReportRecommendation\n  candidates: ResearchReportCandidate[]\n  summary: SummaryTable\n  pareto: ParetoFigureSpec\n  gains: GainDistributionFigureSpec[]\n  rope: { low: number; high: number } | null\n  runFingerprint: string\n  preregistrationHash: string | null\n  methodology: ResearchReportMethodology\n  failureClusters?: FailureClusterReport\n}): string {\n  const lines: string[] = []\n  lines.push(`# ${report.title}`)\n  lines.push('')\n  lines.push(`**Generated:** ${report.generatedAt}`)\n  lines.push(`**Primary split:** ${report.split}`)\n  lines.push(`**Comparator:** ${report.comparator ?? 'not configured'}`)\n  lines.push(`**ROPE:** ${report.rope ? formatRope(report.rope) : 'not configured'}`)\n  lines.push(`**Run fingerprint:** \\`${report.runFingerprint}\\``)\n  lines.push(\n    `**Preregistration:** ${report.preregistrationHash ? `\\`${report.preregistrationHash}\\`` : 'none'}`,\n  )\n  lines.push('')\n  lines.push('## Executive Summary')\n  lines.push('')\n  for (const item of report.executiveSummary) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('## Recommendation')\n  lines.push('')\n  lines.push(`**Decision:** ${report.recommendation.decision}`)\n  lines.push(`**Candidate:** ${report.recommendation.candidateId ?? 'N/A'}`)\n  lines.push('')\n  lines.push('### Rationale')\n  lines.push('')\n  for (const item of report.recommendation.rationale) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Risks')\n  lines.push('')\n  for (const item of report.recommendation.risks.length\n    ? report.recommendation.risks\n    : ['No material report-level risks detected.']) {\n    lines.push(`- ${item}`)\n  }\n  lines.push('')\n  lines.push('### Next Actions')\n  lines.push('')\n  for (const item of report.recommendation.nextActions) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('## Candidate Decision Table')\n  lines.push('')\n  lines.push(\n    '| Candidate | Decision | Mean | Δ̄ | Pr(Δ>0) | q | d | Paired N | Median Gain CI | MDE | Pareto | Gate |',\n  )\n  lines.push('|---|---|---:|---:|---:|---:|---:|---:|---|---:|---|---|')\n  for (const c of report.candidates) {\n    const delta = c.meanDeltaVsComparator === null ? '-' : signed(c.meanDeltaVsComparator)\n    const prGt = c.prGreaterThanZero === null ? '-' : c.prGreaterThanZero.toFixed(3)\n    const q = Number.isFinite(c.qValue) ? c.qValue.toFixed(4) : '-'\n    const d = Number.isFinite(c.cohensD) ? c.cohensD.toFixed(3) : '-'\n    const gain = c.gainCi ? `[${fmt(c.gainCi.low)}, ${fmt(c.gainCi.high)}]` : '-'\n    const mde = c.mde === null || !Number.isFinite(c.mde) ? '-' : fmt(c.mde)\n    lines.push(\n      `| ${c.candidateId} | ${c.decision} | ${fmt(c.mean)} | ${delta} | ${prGt} | ${q} | ${d} | ${c.pairedN} | ${gain} | ${mde} | ${c.onParetoFrontier ? 'yes' : 'no'} | ${c.gate ?? '-'} |`,\n    )\n  }\n  lines.push('')\n  lines.push('## Statistical Summary')\n  lines.push('')\n  lines.push(report.summary.markdown)\n  lines.push('')\n  lines.push('## Methodology')\n  lines.push('')\n  lines.push('### Assumptions')\n  lines.push('')\n  for (const item of report.methodology.assumptions) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Methods')\n  lines.push('')\n  for (const item of report.methodology.methods) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Alternatives Considered')\n  lines.push('')\n  for (const item of report.methodology.alternatives) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### When NOT To Apply')\n  lines.push('')\n  for (const item of report.methodology.whenNotToApply) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Citations')\n  lines.push('')\n  for (const item of report.methodology.citations) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('## Chart Specs')\n  lines.push('')\n  lines.push(\n    'The report carries JSON chart specs for Pareto cost/quality and paired gain histograms.',\n  )\n  lines.push('')\n  lines.push('```json')\n  lines.push(JSON.stringify({ pareto: report.pareto, gains: report.gains }, null, 2))\n  lines.push('```')\n  if (report.failureClusters) {\n    lines.push('')\n    lines.push('## Failure Clusters')\n    lines.push('')\n    lines.push('| Failure Class | Runs | Scenarios | Tool | Example |')\n    lines.push('|---|---:|---:|---|---|')\n    for (const c of report.failureClusters.clusters.slice(0, 10)) {\n      lines.push(\n        `| ${c.failureClass} | ${c.runCount} | ${c.scenarioIds.length} | ${c.toolName ?? '-'} | ${escapePipes(c.exampleError ?? c.exampleRunId)} |`,\n      )\n    }\n  }\n  return lines.join('\\n')\n}\n\nfunction renderResearchHtml(markdown: string, title: string): string {\n  const body = markdownToHtml(markdown)\n  return [\n    '<!doctype html>',\n    '<html lang=\"en\">',\n    '<head>',\n    '<meta charset=\"utf-8\">',\n    '<meta name=\"viewport\" content=\"width=device-width, initial-scale=1\">',\n    `<title>${escapeHtml(title)}</title>`,\n    '<style>',\n    'body{font-family:Inter,ui-sans-serif,system-ui,-apple-system,BlinkMacSystemFont,\"Segoe UI\",sans-serif;margin:0;color:#172026;background:#f7f8f8;}',\n    'main{max-width:1080px;margin:0 auto;padding:40px 24px 64px;background:#fff;min-height:100vh;}',\n    'h1{font-size:34px;line-height:1.15;margin:0 0 20px;}h2{margin-top:34px;border-top:1px solid #d9dfdf;padding-top:22px;}h3{margin-top:22px;}',\n    'p,li{line-height:1.55;}table{border-collapse:collapse;width:100%;margin:16px 0;font-size:14px;}th,td{border:1px solid #d9dfdf;padding:8px;text-align:left;}th{background:#eef2f2;}',\n    'code,pre{font-family:ui-monospace,SFMono-Regular,Menlo,monospace;}pre{overflow:auto;background:#111827;color:#f9fafb;padding:16px;border-radius:6px;}',\n    '</style>',\n    '</head>',\n    '<body><main>',\n    body,\n    '</main></body></html>',\n  ].join('\\n')\n}\n\nfunction markdownToHtml(markdown: string): string {\n  const lines = markdown.split('\\n')\n  const html: string[] = []\n  let inList = false\n  let inCode = false\n  let code: string[] = []\n  let table: string[] = []\n\n  const flushList = () => {\n    if (inList) {\n      html.push('</ul>')\n      inList = false\n    }\n  }\n  const flushTable = () => {\n    if (table.length === 0) return\n    html.push(renderMarkdownTable(table))\n    table = []\n  }\n\n  for (const line of lines) {\n    if (line.startsWith('```')) {\n      if (inCode) {\n        html.push(`<pre><code>${escapeHtml(code.join('\\n'))}</code></pre>`)\n        code = []\n        inCode = false\n      } else {\n        flushList()\n        flushTable()\n        inCode = true\n      }\n      continue\n    }\n    if (inCode) {\n      code.push(line)\n      continue\n    }\n    if (line.startsWith('|')) {\n      flushList()\n      table.push(line)\n      continue\n    }\n    flushTable()\n    if (line.startsWith('- ')) {\n      if (!inList) {\n        html.push('<ul>')\n        inList = true\n      }\n      html.push(`<li>${inlineMarkdown(line.slice(2))}</li>`)\n      continue\n    }\n    flushList()\n    if (line.startsWith('# ')) html.push(`<h1>${inlineMarkdown(line.slice(2))}</h1>`)\n    else if (line.startsWith('## ')) html.push(`<h2>${inlineMarkdown(line.slice(3))}</h2>`)\n    else if (line.startsWith('### ')) html.push(`<h3>${inlineMarkdown(line.slice(4))}</h3>`)\n    else if (line.trim() === '') html.push('')\n    else html.push(`<p>${inlineMarkdown(line)}</p>`)\n  }\n  flushList()\n  flushTable()\n  return html.join('\\n')\n}\n\nfunction renderMarkdownTable(lines: string[]): string {\n  const rows = lines\n    .filter((line) => !/^\\|[-:\\s|]+\\|$/.test(line))\n    .map((line) =>\n      line\n        .slice(1, -1)\n        .split('|')\n        .map((cell) => inlineMarkdown(cell.trim())),\n    )\n  if (rows.length === 0) return ''\n  const [head, ...body] = rows\n  const th = head!.map((cell) => `<th>${cell}</th>`).join('')\n  const trs = body\n    .map((row) => `<tr>${row.map((cell) => `<td>${cell}</td>`).join('')}</tr>`)\n    .join('\\n')\n  return `<table><thead><tr>${th}</tr></thead><tbody>${trs}</tbody></table>`\n}\n\nfunction inlineMarkdown(s: string): string {\n  return escapeHtml(s).replace(/\\*\\*([^*]+)\\*\\*/g, '<strong>$1</strong>')\n}\n\nfunction escapeHtml(s: string): string {\n  return s\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n}\n\nfunction escapePipes(s: string): string {\n  return s.replace(/\\|/g, '\\\\|')\n}\n\nfunction decisionWeight(decision: ResearchReportDecision): number {\n  if (decision === 'promote') return 5\n  if (decision === 'equivalent') return 4\n  if (decision === 'hold') return 3\n  if (decision === 'needs_more_data') return 2\n  return 1\n}\n\nfunction signed(x: number): string {\n  return `${x >= 0 ? '+' : ''}${fmt(x)}`\n}\n\n// ── tiny helpers ─────────────────────────────────────────────────────\n\nfunction avg(xs: number[]): number {\n  if (xs.length === 0) return Number.NaN\n  return xs.reduce((s, x) => s + x, 0) / xs.length\n}\n\nfunction medianOfSorted(sorted: number[]): number {\n  if (sorted.length === 0) return 0\n  const mid = Math.floor(sorted.length / 2)\n  return sorted.length % 2 === 0 ? (sorted[mid - 1]! + sorted[mid]!) / 2 : sorted[mid]!\n}\n\nfunction fmt(x: number): string {\n  if (!Number.isFinite(x)) return String(x)\n  return x.toFixed(4)\n}\n"],"mappings":";;;;;;;;;;;AAuBO,SAAS,mBAAmB,MAKxB;AACT,QAAM,SAAS,KAAK;AACpB,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG,QAAO;AACpD,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,SAAS,UAAU,WAAW,IAAI,QAAQ,IAAI,IAAI,KAAK;AAC7D,QAAM,QAAQ,UAAU,KAAK;AAC7B,QAAM,IAAI,MAAM,SAAS,SAAS,WAAW;AAC7C,SAAO,KAAK,KAAK,CAAC;AACpB;AAcO,SAAS,UAAU,MAKf;AACT,MAAI,CAAC,OAAO,SAAS,KAAK,OAAO,KAAK,KAAK,WAAW,EAAG,QAAO;AAChE,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,SAAS,UAAU,WAAW,IAAI,QAAQ,IAAI,IAAI,KAAK;AAC7D,QAAM,QAAQ,UAAU,KAAK;AAC7B,UAAQ,SAAS,SAAS,KAAK,KAAK,KAAK,OAAO;AAClD;AAGO,SAAS,WACd,SACA,QAAQ,MACwC;AAChD,QAAM,IAAI,QAAQ;AAClB,QAAM,WAAW,QAAQ,IAAI,CAAC,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC;AACtD,QAAM,cAAc,SAAS,IAAI,CAAC,MAAM,IAAI,KAAK;AACjD,SAAO,EAAE,UAAU,YAAY;AACjC;AAOO,SAAS,kBACd,SACA,MAAM,MACyC;AAC/C,QAAM,IAAI,QAAQ;AAClB,MAAI,MAAM,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,aAAa,CAAC,EAAE;AACnD,QAAM,UAAU,QAAQ,IAAI,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AAC1E,QAAM,IAAI,IAAI,MAAc,CAAC;AAE7B,MAAI,WAAW;AACf,WAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,UAAM,OAAO,IAAI;AACjB,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,MAAO,MAAM,IAAI,IAAK;AAC5B,UAAM,UAAU,KAAK,IAAI,UAAU,GAAG;AACtC,eAAW;AACX,MAAE,MAAM,CAAC,IAAI,KAAK,IAAI,GAAG,OAAO;AAAA,EAClC;AACA,QAAM,cAAc,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG;AACxC,SAAO,EAAE,SAAS,GAAG,YAAY;AACnC;AAGA,SAAS,UAAU,GAAmB;AACpC,MAAI,KAAK,KAAK,KAAK,GAAG;AACpB,QAAI,MAAM,EAAG,QAAO;AACpB,QAAI,MAAM,EAAG,QAAO;AACpB,WAAO;AAAA,EACT;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAqB;AAAA,IAAsB;AAAA,IACjE;AAAA,IAAsB;AAAA,EACxB;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAqB;AAAA,IAAsB;AAAA,IACjE;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IAAuB;AAAA,IAAuB;AAAA,IAAoB;AAAA,IAClE;AAAA,IAAmB;AAAA,EACrB;AACA,QAAM,IAAI,CAAC,sBAAsB,oBAAsB,mBAAmB,iBAAiB;AAC3F,QAAM,OAAO;AACb,QAAM,QAAQ,IAAI;AAClB,MAAI;AACJ,MAAI;AACJ,MAAI,IAAI,MAAM;AACZ,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAC9B,gBACO,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,SACpE,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAAA,EAE3D;AACA,MAAI,KAAK,OAAO;AACd,QAAI,IAAI;AACR,QAAI,IAAI;AACR,gBACQ,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,SAC1E,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAAA,EAEzE;AACA,MAAI,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AAClC,SACE,MAAM,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,SACrE,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAE3D;;;ACxFO,SAAS,gBACd,QACA,OACA,OAA+B,CAAC,GACT;AACvB,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI,MAAM,0CAA0C,OAAO,MAAM,OAAO,MAAM,MAAM,GAAG;AAAA,EAC/F;AACA,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,YAAY,KAAK,aAAa;AACpC,MAAI,cAAc,KAAK,cAAc,GAAG;AACtC,UAAM,IAAI,MAAM,qDAAqD,UAAU,EAAE;AAAA,EACnF;AAEA,QAAM,IAAI,OAAO;AACjB,QAAM,SAAS,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AACjD,MAAI,MAAM,GAAG;AACX,WAAO,EAAE,GAAG,GAAG,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,YAAY,UAAU;AAAA,EAC5E;AACA,MAAI,MAAM,GAAG;AACX,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,EAAE,GAAG,GAAG,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,YAAY,UAAU;AAAA,EAC5E;AAEA,QAAM,MAAM,QAAQ,KAAK,IAAI;AAC7B,QAAM,UAAU,IAAI,MAAc,SAAS;AAC3C,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,MAAuB;AAC3B,QAAI,cAAc,QAAQ;AACxB,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,MACrC;AACA,cAAQ,CAAC,IAAI,MAAM;AAAA,IACrB,OAAO;AACL,YAAM,IAAI,MAAc,CAAC;AACzB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAI,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,MACvC;AACA,cAAQ,CAAC,IAAI,cAAc,GAAG;AAAA,IAChC;AAAA,EACF;AACA,UAAQ,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAE5B,QAAM,QAAQ,IAAI;AAClB,QAAM,SAAS,KAAK,MAAO,QAAQ,IAAK,SAAS;AACjD,QAAM,UAAU,KAAK,IAAI,YAAY,GAAG,KAAK,MAAM,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC;AAElF,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,cAAc,CAAC,GAAG,MAAM,CAAC;AAAA,IACjC,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAAA,IAC1C,KAAK,QAAQ,MAAM;AAAA,IACnB,MAAM,QAAQ,KAAK,IAAI,SAAS,MAAM,CAAC;AAAA,IACvC;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,eAAe,QAAkB,OAA2C;AAC1F,SAAO,mBAAmB,QAAQ,KAAK;AACzC;AAQO,SAAS,SACd,SACA,MAAM,MACyC;AAC/C,SAAO,kBAAkB,SAAS,GAAG;AACvC;AAIA,SAAS,cAAc,IAAsB;AAC3C,MAAI,GAAG,WAAW,EAAG,QAAO;AAC5B,KAAG,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvB,QAAM,MAAM,KAAK,MAAM,GAAG,SAAS,CAAC;AACpC,SAAO,GAAG,SAAS,MAAM,KAAK,GAAG,MAAM,CAAC,IAAK,GAAG,GAAG,KAAM,IAAI,GAAG,GAAG;AACrE;AAOA,SAAS,QAAQ,MAAwC;AACvD,MAAI,SAAS,OAAW,QAAO,KAAK;AACpC,MAAI,IAAI,OAAO,KAAK;AACpB,SAAO,MAAM;AACX,QAAK,IAAI,aAAc;AACvB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;;;AChGO,SAAS,aAAa,MAAmB,OAA4B,CAAC,GAAiB;AAC5F,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,aAAa,UAAU,YAAY,iBAAiB;AAE1D,QAAM,cAAc,oBAAI,IAAqD;AAC7E,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,aAAa,MAAO;AAC1B,UAAM,IAAI,EAAE,QAAQ,UAAU;AAC9B,QAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,EAAG;AAClD,UAAM,SAAS,YAAY,IAAI,EAAE,WAAW,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE;AACxE,WAAO,KAAK,KAAK,CAAC;AAClB,WAAO,OAAO,KAAK,CAAC;AACpB,gBAAY,IAAI,EAAE,aAAa,MAAM;AAAA,EACvC;AAEA,QAAM,eAAe,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE,KAAK;AAClD,QAAM,WAAW,aAAa,YAAY,IAAI,UAAU,IAAI;AAG5D,QAAM,YAAuD,CAAC;AAC9D,aAAW,MAAM,cAAc;AAC7B,UAAM,SAAS,YAAY,IAAI,EAAE;AACjC,UAAM,KAAK,mBAAmB,OAAO,QAAQ,UAAU;AACvD,QAAI,OAAO,OAAO;AAClB,QAAI,IAAI,OAAO;AACf,QAAI,cAAc,YAAY,OAAO,YAAY;AAC/C,YAAM,SAAS,gBAAgB,OAAO,MAAM,SAAS,MAAM,UAAU;AACrE,UAAI,OAAO,OAAO,UAAU,GAAG;AAC7B,eAAO,mBAAmB,OAAO,QAAQ,OAAO,KAAK,EAAE;AAAA,MACzD;AACA,UAAI,QAAQ,SAAS,QAAQ,OAAO,MAAM;AAAA,IAC5C;AACA,cAAU,KAAK;AAAA,MACb,aAAa;AAAA,MACb,GAAG,OAAO,OAAO;AAAA,MACjB,MAAM,GAAG;AAAA,MACT,OAAO,GAAG;AAAA,MACV,QAAQ,GAAG;AAAA,MACX,QAAQ;AAAA,MACR,SAAS;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH;AAKA,MAAI,YAAY;AACd,UAAM,OAAiB,CAAC;AACxB,UAAM,KAAe,CAAC;AACtB,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,IAAI,UAAU,CAAC;AACrB,UAAI,EAAE,gBAAgB,WAAY;AAClC,UAAI,CAAC,OAAO,SAAS,EAAE,IAAI,EAAG;AAC9B,WAAK,KAAK,CAAC;AACX,SAAG,KAAK,EAAE,IAAI;AAAA,IAChB;AACA,QAAI,GAAG,SAAS,GAAG;AACjB,YAAM,EAAE,QAAQ,IAAI,kBAAkB,IAAI,GAAG;AAC7C,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAU,KAAK,CAAC,CAAE,EAAG,SAAS,QAAQ,CAAC;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,QAAM,OAAO,UAAU,IAAI,CAAC,EAAE,MAAM,OAAO,GAAG,KAAK,MAAM,IAAI;AAC7D,QAAM,WAAW,2BAA2B,MAAM,YAAY,KAAK;AACnE,SAAO,EAAE,MAAM,YAAY,OAAO,SAAS;AAC7C;AAEA,SAAS,gBACP,WACA,UACA,YACuC;AACvC,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,UAAU;AACxB,UAAM,IAAI,EAAE,QAAQ,UAAU;AAC9B,QAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,GAAG;AAC/C,cAAQ,IAAI,GAAG,EAAE,YAAY,KAAK,EAAE,IAAI,IAAI,CAAC;AAAA,IAC/C;AAAA,EACF;AACA,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAkB,CAAC;AACzB,aAAW,KAAK,WAAW;AACzB,UAAM,IAAI,EAAE,QAAQ,UAAU;AAC9B,QAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,EAAG;AAClD,UAAM,MAAM,GAAG,EAAE,YAAY,KAAK,EAAE,IAAI;AACxC,UAAM,IAAI,QAAQ,IAAI,GAAG;AACzB,QAAI,MAAM,OAAW;AACrB,WAAO,KAAK,CAAC;AACb,UAAM,KAAK,CAAC;AAAA,EACd;AACA,SAAO,EAAE,QAAQ,MAAM;AACzB;AAEA,SAAS,2BACP,MACA,YACA,OACQ;AACR,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAW,aAAa,QAAQ,UAAU,MAAM;AACtD,QAAM,KAAK,wBAAmB,KAAK,SAAS,QAAQ,EAAE;AACtD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,wDAAwD;AACnE,QAAM,KAAK,+BAA+B;AAC1C,aAAW,KAAK,MAAM;AACpB,UAAM,KAAK,IAAI,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,EAAE,MAAM,CAAC;AAC7C,UAAM,IAAI,OAAO,SAAS,EAAE,MAAM,IAAI,EAAE,OAAO,QAAQ,CAAC,IAAI;AAC5D,UAAM,IAAI,OAAO,SAAS,EAAE,OAAO,IAAI,EAAE,QAAQ,QAAQ,CAAC,IAAI;AAC9D,UAAM,KAAK,KAAK,EAAE,WAAW,MAAM,EAAE,CAAC,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;AAAA,EACnF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAgCO,SAAS,YACd,MACA,OAGI,CAAC,GACa;AAClB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,UAAU,YAAY,iBAAiB;AAE1D,QAAM,UAAU,oBAAI,IAAmD;AACvE,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,aAAa,MAAO;AAC1B,UAAM,IAAI,EAAE,QAAQ,UAAU;AAC9B,QAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,EAAG;AAClD,UAAM,SAAS,QAAQ,IAAI,EAAE,WAAW,KAAK,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE;AACrE,WAAO,KAAK,KAAK,EAAE,OAAO;AAC1B,WAAO,QAAQ,KAAK,CAAC;AACrB,YAAQ,IAAI,EAAE,aAAa,MAAM;AAAA,EACnC;AAEA,QAAM,SAAwB,CAAC;AAC/B,aAAW,CAAC,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG;AACrD,WAAO,KAAK;AAAA,MACV;AAAA,MACA,MAAM,IAAI,OAAO,IAAI;AAAA,MACrB,SAAS,IAAI,OAAO,OAAO;AAAA,MAC3B,GAAG,OAAO,KAAK;AAAA,MACf,YAAY;AAAA,MACZ,MAAM,KAAK,gBAAgB,WAAW,IAClC,UAAU,KAAK,cAAc,WAAW,CAAE,IAC1C;AAAA,IACN,CAAC;AAAA,EACH;AAKA,aAAW,KAAK,QAAQ;AACtB,MAAE,aAAa,CAAC,OAAO,KAAK,CAAC,MAAM,MAAM,KAAK,UAAU,GAAG,CAAC,CAAC;AAAA,EAC/D;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,MAAM,EAAE,GAAG,WAAW,GAAG,QAAQ;AAAA,IACjC;AAAA,EACF;AACF;AAEA,SAAS,UAAU,GAAgB,GAAyB;AAC1D,SAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE;AACzF;AAEA,SAAS,UAAU,GAAsC;AACvD,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,kBAAkB,WAAY,QAAO;AAC3C,MAAI,EAAE,kBAAkB,iBAAkB,QAAO;AACjD,MAAI,EAAE,kBAAkB,cAAe,QAAO;AAC9C,SAAO;AACT;AA2CO,SAAS,cACd,MACA,aACA,YACA,OAAgC,CAAC,GACL;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,UAAU,YAAY,iBAAiB;AAC1D,QAAM,WAAW,KAAK,QAAQ;AAC9B,MAAI,WAAW,EAAG,OAAM,IAAI,MAAM,sCAAiC;AAEnE,QAAM,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,eAAe,EAAE,aAAa,KAAK;AAC1F,QAAM,WAAW,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,cAAc,EAAE,aAAa,KAAK;AAIxF,QAAM,EAAE,QAAQ,MAAM,IAAI,gBAAgB,WAAW,UAAU,UAAU;AACzE,QAAM,IAAI,OAAO;AAEjB,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,MACL,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH,MAAM,CAAC;AAAA,MACP,QAAQ;AAAA,MACR,IAAI,EAAE,KAAK,GAAG,MAAM,EAAE;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,SAAS,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AACjD,QAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACrD,QAAM,SAAS,eAAe,YAAY;AAC1C,QAAM,MAAM,aAAa,CAAC;AAC1B,QAAM,MAAM,aAAa,aAAa,SAAS,CAAC;AAIhD,QAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI;AACzD,QAAM,KAAK,CAAC;AACZ,QAAM,KAAK;AACX,QAAM,SAAS,KAAK,MAAM;AAC1B,QAAM,OAA8B,CAAC;AACrC,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,SAAK,KAAK,EAAE,IAAI,KAAK,IAAI,OAAO,IAAI,MAAM,IAAI,KAAK,OAAO,OAAO,EAAE,CAAC;AAAA,EACtE;AACA,aAAW,KAAK,QAAQ;AACtB,QAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK;AACrC,QAAI,MAAM,EAAG,OAAM;AACnB,QAAI,OAAO,SAAU,OAAM,WAAW;AACtC,SAAK,GAAG,EAAG,SAAS;AAAA,EACtB;AAEA,QAAM,KAAK,gBAAgB,QAAQ,OAAO;AAAA,IACxC,YAAY,KAAK,cAAc;AAAA,IAC/B,WAAW,KAAK,aAAa;AAAA,IAC7B,WAAW;AAAA,IACX,MAAM,KAAK;AAAA,EACb,CAAC;AAED,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,KAAK;AAAA,EACnC;AACF;AAgBO,IAAM,kCAAkC;AA2J/C,SAAS,gBACP,MACA,aACA,YACA,MAiBO;AACP,QAAM,aAAa,KAAK,UAAU,YAAY,iBAAiB;AAC/D,QAAM,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,eAAe,EAAE,aAAa,KAAK,KAAK;AAC/F,QAAM,WAAW,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,cAAc,EAAE,aAAa,KAAK,KAAK;AAC7F,QAAM,EAAE,QAAQ,MAAM,IAAI,gBAAgB,WAAW,UAAU,UAAU;AACzE,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,EAAG,QAAO;AAEpB,QAAM,SAAS,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AACjD,QAAM,YAAY,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AACtD,QAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACrD,QAAM,cAAc,eAAe,YAAY;AAC/C,QAAM,UAAU,MAAM,QAAQ,SAAS;AAEvC,QAAM,KAAK,gBAAgB,QAAQ,OAAO;AAAA,IACxC,YAAY,KAAK;AAAA,IACjB,WAAW;AAAA,IACX,WAAW;AAAA,IACX,MAAM,KAAK;AAAA,EACb,CAAC;AAKD,QAAM,cAAc,qBAAqB,QAAQ,KAAM,KAAK,IAAI;AAChE,QAAM,oBACJ,YAAY,WAAW,IAAI,IAAI,YAAY,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,SAAS,YAAY;AACvF,QAAM,WACJ,KAAK,SAAS,QAAQ,YAAY,WAAW,IACzC,OACA,YAAY,OAAO,CAAC,MAAM,KAAK,KAAK,KAAM,OAAO,KAAK,KAAK,KAAM,IAAI,EAAE,SACvE,YAAY;AAElB,QAAM,gBAAgB,UAAU,EAAE,SAAS,GAAG,OAAO,KAAK,UAAU,OAAO,KAAK,SAAS,CAAC;AAC1F,QAAM,MAAM,YAAY,IAAI,IAAI,gBAAgB;AAEhD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,KAAK;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,qBAAqB,QAAkB,WAAmB,MAAyB;AAC1F,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,MAAM,EAAG,QAAO,IAAI,MAAc,SAAS,EAAE,KAAK,OAAO,CAAC,CAAE;AAChE,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,UAAU,IAAI,MAAc,SAAS;AAC3C,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAC/D,YAAQ,CAAC,IAAI,MAAM;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,MAA6B;AAC5C,MAAI,SAAS,OAAW,QAAO,KAAK;AACpC,MAAI,IAAI,SAAS;AACjB,SAAO,MAAM;AACX,QAAK,IAAI,eAAgB;AACzB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;AAEA,SAAS,MAAM,IAAc,MAAsB;AACjD,MAAI,GAAG,SAAS,EAAG,QAAO;AAC1B,MAAI,MAAM;AACV,aAAW,KAAK,GAAI,SAAQ,IAAI,SAAS;AACzC,SAAO,KAAK,KAAK,OAAO,GAAG,SAAS,EAAE;AACxC;AAqBA,eAAsB,eACpB,MACA,OAA8B,CAAC,GACN;AACzB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,WAAW,KAAK,IAAI,KAAK,YAAY,IAAI,+BAA+B;AAC9E,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,cAAc,KAAK,gBAAe,oBAAI,KAAK,GAAE,YAAY;AAC/D,QAAM,sBAAsB,KAAK,uBAAuB;AAExD,MAAI,QAAQ,EAAE,OAAO,SAAS,KAAK,GAAG,KAAK,OAAO,SAAS,KAAK,IAAI,KAAK,KAAK,OAAO,KAAK,OAAO;AAC/F,UAAM,IAAI;AAAA,MACR,6EAAwE,KAAK,UAAU,IAAI,CAAC;AAAA,IAC9F;AAAA,EACF;AAEA,QAAM,UAAU,aAAa,MAAM;AAAA,IACjC,YAAY,cAAc;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,SAAS,YAAY,MAAM,EAAE,OAAO,eAAe,KAAK,cAAc,CAAC;AAC7E,QAAM,eACJ,KAAK,gBAAgB,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,CAAC,OAAO,OAAO,UAAU;AAC9F,QAAM,QAAQ,aACV,aAAa;AAAA,IAAI,CAAC,OAChB,cAAc,MAAM,IAAI,YAAY;AAAA,MAClC;AAAA,MACA;AAAA,MACA,MAAM,KAAK;AAAA,IACb,CAAC;AAAA,EACH,IACA,CAAC;AAEL,QAAM,kBAAkB,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AACpE,QAAM,oBAAoB,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AAC9E,QAAM,uBAAuB,oBAAI,IAAgD;AACjF,MAAI,YAAY;AACd,eAAW,MAAM,cAAc;AAC7B,2BAAqB;AAAA,QACnB;AAAA,QACA,gBAAgB,MAAM,IAAI,YAAY;AAAA,UACpC;AAAA,UACA;AAAA,UACA,MAAM,KAAK;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAa,QAAQ,KACxB,IAAI,CAAC,QAAQ;AACZ,UAAM,OAAO,gBAAgB,IAAI,IAAI,WAAW;AAChD,UAAM,QAAQ,kBAAkB,IAAI,IAAI,WAAW;AACnD,UAAM,YAAY,qBAAqB,IAAI,IAAI,WAAW,KAAK;AAC/D,UAAM,aAAa,kBAAkB,KAAK;AAAA,MACxC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AACD,WAAO;AAAA,MACL,aAAa,IAAI;AAAA,MACjB,GAAG,IAAI;AAAA,MACP,MAAM,IAAI;AAAA,MACV,OAAO,IAAI;AAAA,MACX,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,SAAS,IAAI;AAAA,MACb,uBAAuB,YAAY,UAAU,YAAY;AAAA,MACzD,SAAS,WAAW,KAAK,MAAM,KAAK;AAAA,MACpC,YAAY,YAAY,UAAU,cAAc,OAAO,KAAK,SAAS;AAAA,MACrE,UAAU,YAAY,UAAU,YAAY;AAAA,MAC5C,QAAQ,YAAY,UAAU,KAAK,OAAO,KAAK,KAAK;AAAA,MACpD,mBAAmB,YAAY,UAAU,oBAAoB;AAAA,MAC7D,UAAU,YAAY,UAAU,WAAW;AAAA,MAC3C,KAAK,YAAY,UAAU,MAAM;AAAA,MACjC,kBAAkB,OAAO,cAAc;AAAA,MACvC,MAAM,OAAO;AAAA,MACb,UAAU,WAAW;AAAA,MACrB,gBAAgB,WAAW;AAAA,IAC7B;AAAA,EACF,CAAC,EACA,KAAK,CAAC,GAAG,MAAM;AACd,UAAM,eAAe,eAAe,EAAE,QAAQ,IAAI,eAAe,EAAE,QAAQ;AAC3E,QAAI,iBAAiB,EAAG,QAAO;AAC/B,WAAO,EAAE,OAAO,EAAE;AAAA,EACpB,CAAC;AAEH,QAAM,iBAAiB,oBAAoB,YAAY;AAAA,IACrD;AAAA,IACA,iBAAiB,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,mBAAmB,sBAAsB,YAAY,gBAAgB;AAAA,IACzE;AAAA,IACA;AAAA,IACA,iBAAiB,KAAK;AAAA,IACtB;AAAA,EACF,CAAC;AACD,QAAM,cAAc,iBAAiB;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,QAAM,iBAAiB,MAAM;AAAA,IAC3B,aAAa;AAAA,MACX,SAAS,KACN,OAAO,CAAC,MAAM,EAAE,aAAa,KAAK,EAClC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,aAAa,EAAE,aAAa,UAAU,EAAE,SAAS,EAAE,EACjF,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AAAA,MAChD;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,WAAW,uBAAuB;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,KAAK;AAAA,EACxB,CAAC;AACD,QAAM,OAAO,mBAAmB,UAAU,KAAK;AAE/C,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,EAAE,QAAQ,MAAM;AAAA,IACxB;AAAA,IACA,iBAAiB,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,KASI;AAC5B,QAAM,cAAwB;AAAA,IAC5B;AAAA,IACA;AAAA,IACA,sCAAsC,IAAI,GAAG,cAAc,IAAI,QAAQ,gBAAgB,IAAI,UAAU;AAAA,EACvG;AACA,MAAI,IAAI,MAAM;AACZ,gBAAY;AAAA,MACV,uCAAuC,WAAW,IAAI,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,MAAI,IAAI,eAAe,MAAM;AAC3B,gBAAY,KAAK,oEAAoE;AAAA,EACvF;AACA,QAAM,UAAoB;AAAA,IACxB;AAAA,IACA;AAAA,IACA,8DAAyD,IAAI,QAAQ,uBAAuB,IAAI,QAAQ;AAAA,IACxG;AAAA,IACA;AAAA,EACF;AACA,QAAM,eAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,iBAA2B;AAAA,IAC/B,kBAAkB,+BAA+B;AAAA,IACjD;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,YAAsB;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,EAAE,aAAa,SAAS,cAAc,gBAAgB,UAAU;AACzE;AAEA,SAAS,WAAW,MAA6C;AAC/D,SAAO,IAAI,IAAI,KAAK,GAAG,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC;AAC7C;AAEA,SAAS,kBACP,KACA,KAQsD;AACtD,MAAI,IAAI,cAAc,IAAI,gBAAgB,IAAI,YAAY;AACxD,WAAO,EAAE,UAAU,QAAQ,QAAQ,uBAAuB;AAAA,EAC5D;AACA,MAAI,CAAC,IAAI,YAAY;AACnB,WAAO;AAAA,MACL,UAAU,IAAI,OAAO,aAAa,SAAS;AAAA,MAC3C,QACE;AAAA,IACJ;AAAA,EACF;AAGA,MAAI,IAAI,OAAO,QAAQ,IAAI,MAAM,SAAS,WAAW;AACnD,WAAO,EAAE,UAAU,UAAU,QAAQ,0BAA0B,IAAI,MAAM,IAAI,IAAI;AAAA,EACnF;AACA,MAAI,CAAC,IAAI,aAAa,IAAI,UAAU,IAAI,iCAAiC;AACvE,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,QAAQ,IAAI,WAAW,KAAK,CAAC,6CAA6C,+BAA+B;AAAA,IACnH;AAAA,EACF;AACA,QAAM,KAAK,IAAI,UAAU;AACzB,MAAI,IAAI,QAAQ,GAAG,OAAO,IAAI,KAAK,OAAO,GAAG,QAAQ,IAAI,KAAK,MAAM;AAClE,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,oBAAoB,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,0BAA0B,WAAW,IAAI,IAAI,CAAC;AAAA,IACxG;AAAA,EACF;AACA,QAAM,cAAc,OAAO,SAAS,IAAI,MAAM,KAAK,IAAI,UAAU,IAAI;AACrE,QAAM,eAAe,GAAG,MAAM;AAC9B,QAAM,eAAe,GAAG,OAAO;AAC/B,MAAI,cAAc;AAChB,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,oBAAoB,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC;AAAA,IAC1D;AAAA,EACF;AACA,MAAI,IAAI,UAAU,IAAI,IAAI,UAAU;AAClC,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,QAAQ,IAAI,UAAU,CAAC,gEAAgE,IAAI,IAAI,UAAU,GAAG,CAAC,6BAAwB,IAAI,QAAQ;AAAA,IAC3J;AAAA,EACF;AACA,MAAI,eAAe,cAAc;AAC/B,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,iBAAiB,IAAI,IAAI,MAAM,CAAC,WAAM,IAAI,GAAG,yBAAyB,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,iCAA4B,IAAI,IAAI,UAAU,iBAAiB,CAAC;AAAA,IAC5K;AAAA,EACF;AACA,SAAO;AAAA,IACL,UAAU;AAAA,IACV,QAAQ,gBAAW,IAAI,IAAI,UAAU,iBAAiB,CAAC,YAAY,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,8CAA8C,IAAI,GAAG;AAAA,EACtJ;AACF;AAEA,SAAS,oBACP,YACA,KAO8B;AAC9B,QAAM,gBAAgB,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,IAAI,UAAU;AAC/E,QAAM,cAAc,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,SAAS;AACtE,QAAM,iBAAiB,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,YAAY;AAC5E,QAAM,SAAS,eAAe,kBAAkB,cAAc,CAAC,KAAK;AACpE,QAAM,WAAmC,cACrC,YACA,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,iBAAiB,IACxD,oBACA,iBACE,eACA,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,IAC7C,SACA;AAEV,QAAM,YAAsB,CAAC;AAC7B,QAAM,QAAkB,CAAC;AACzB,QAAM,cAAwB,CAAC;AAE/B,MAAI,QAAQ;AACV,cAAU,KAAK,GAAG,OAAO,WAAW,KAAK,OAAO,cAAc,EAAE;AAChE,QAAI,OAAO,QAAQ;AACjB,YAAM,cACJ,OAAO,sBAAsB,OAAO,kBAAa,IAAI,OAAO,iBAAiB,CAAC,KAAK;AACrF,gBAAU;AAAA,QACR,2BAA2B,IAAI,OAAO,OAAO,GAAG,CAAC,KAAK,IAAI,OAAO,OAAO,IAAI,CAAC,IAAI,WAAW;AAAA,MAC9F;AAAA,IACF;AACA,QAAI,OAAO,QAAQ,QAAQ,OAAO,SAAS,OAAO,GAAG,GAAG;AACtD,gBAAU,KAAK,2BAA2B,OAAO,OAAO,KAAK,IAAI,OAAO,GAAG,CAAC,eAAe;AAAA,IAC7F;AAAA,EACF;AACA,MAAI,CAAC,IAAI,YAAY;AACnB,UAAM,KAAK,mEAAmE;AAC9E,gBAAY,KAAK,iEAAiE;AAAA,EACpF;AACA,MAAI,CAAC,IAAI,qBAAqB;AAC5B,UAAM;AAAA,MACJ;AAAA,IACF;AACA,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,MAAI,IAAI,SAAS,QAAQ,cAAc,SAAS,GAAG;AACjD,UAAM;AAAA,MACJ;AAAA,IACF;AACA,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,iBAAiB;AACjF,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,QAAQ,aAAa,OAAO,CAAC,GAAG,MAAO,EAAE,UAAU,EAAE,UAAU,IAAI,CAAE;AAC3E,UAAM;AAAA,MACJ,GAAG,aAAa,MAAM,mCAAmC,IAAI,QAAQ,wBAAwB,MAAM,WAAW,SAAS,MAAM,OAAO;AAAA,IACtI;AACA,gBAAY;AAAA,MACV,oBAAoB,IAAI,WAAW,MAAM,OAAO,kCAAkC,MAAM,WAAW;AAAA,IACrG;AAAA,EACF;AACA,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ;AACpE,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM;AAAA,MACJ,GAAG,SAAS,MAAM;AAAA,IACpB;AAAA,EACF;AACA,MAAI,IAAI,mBAAmB,IAAI,gBAAgB,SAAS,SAAS,GAAG;AAClE,UAAM,MAAM,IAAI,gBAAgB,SAAS,CAAC;AAC1C,UAAM,KAAK,wBAAwB,IAAI,YAAY,WAAW,IAAI,QAAQ,UAAU;AACpF,gBAAY,KAAK,8DAA8D;AAAA,EACjF;AACA,MAAI,aAAa,WAAW;AAC1B,gBAAY,KAAK,+DAA+D;AAAA,EAClF,WAAW,aAAa,QAAQ;AAC9B,gBAAY,KAAK,qEAAqE;AAAA,EACxF,WAAW,aAAa,cAAc;AACpC,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF,WAAW,aAAa,UAAU;AAChC,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,aAAa,QAAQ,eAAe;AAAA,IACpC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,sBACP,YACA,gBACA,KAMU;AACV,QAAM,QAAkB,CAAC;AACzB,QAAM,gBAAgB,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,IAAI,UAAU;AAC/E,QAAM;AAAA,IACJ,aAAa,cAAc,MAAM,wBAAwB,IAAI,KAAK,SAAS,IAAI,aAAa,YAAY,IAAI,UAAU,KAAK,EAAE;AAAA,EAC/H;AACA,QAAM;AAAA,IACJ,mBAAmB,eAAe,QAAQ,GAAG,eAAe,cAAc,IAAI,eAAe,WAAW,KAAK,EAAE;AAAA,EACjH;AACA,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,SAAS,EAAE;AACvE,QAAM,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,MAAM,EAAE;AAChE,QAAM,aAAa,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,YAAY,EAAE;AAC5E,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE;AACtE,QAAM,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,iBAAiB,EAAE;AAC3E,QAAM;AAAA,IACJ,iBAAiB,QAAQ,aAAa,UAAU,gBAAgB,IAAI,UAAU,QAAQ,YAAY,IAAI;AAAA,EACxG;AACA,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,gBAAgB,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW;AACzF,MAAI,SAAS,SAAS,EAAG,OAAM,KAAK,+BAA+B,SAAS,KAAK,IAAI,CAAC,GAAG;AACzF,MAAI,IAAI,iBAAiB;AACvB,UAAM;AAAA,MACJ,4BAA4B,IAAI,gBAAgB,aAAa,IAAI,IAAI,gBAAgB,SAAS,uBAAuB,IAAI,gBAAgB,SAAS,MAAM;AAAA,IAC1J;AAAA,EACF;AACA,QAAM;AAAA,IACJ,IAAI,sBACA,2BAA2B,IAAI,oBAAoB,MAAM,GAAG,EAAE,CAAC,WAC/D;AAAA,EACN;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,QAgBrB;AACT,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,KAAK,OAAO,KAAK,EAAE;AAC9B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,kBAAkB,OAAO,WAAW,EAAE;AACjD,QAAM,KAAK,sBAAsB,OAAO,KAAK,EAAE;AAC/C,QAAM,KAAK,mBAAmB,OAAO,cAAc,gBAAgB,EAAE;AACrE,QAAM,KAAK,aAAa,OAAO,OAAO,WAAW,OAAO,IAAI,IAAI,gBAAgB,EAAE;AAClF,QAAM,KAAK,0BAA0B,OAAO,cAAc,IAAI;AAC9D,QAAM;AAAA,IACJ,wBAAwB,OAAO,sBAAsB,KAAK,OAAO,mBAAmB,OAAO,MAAM;AAAA,EACnG;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,sBAAsB;AACjC,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,iBAAkB,OAAM,KAAK,KAAK,IAAI,EAAE;AAClE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,mBAAmB;AAC9B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iBAAiB,OAAO,eAAe,QAAQ,EAAE;AAC5D,QAAM,KAAK,kBAAkB,OAAO,eAAe,eAAe,KAAK,EAAE;AACzE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,eAAe;AAC1B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,eAAe,UAAW,OAAM,KAAK,KAAK,IAAI,EAAE;AAC1E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,WAAW;AACtB,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,eAAe,MAAM,SAC3C,OAAO,eAAe,QACtB,CAAC,0CAA0C,GAAG;AAChD,UAAM,KAAK,KAAK,IAAI,EAAE;AAAA,EACxB;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,kBAAkB;AAC7B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,eAAe,YAAa,OAAM,KAAK,KAAK,IAAI,EAAE;AAC5E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,6BAA6B;AACxC,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,QAAM,KAAK,0DAA0D;AACrE,aAAW,KAAK,OAAO,YAAY;AACjC,UAAM,QAAQ,EAAE,0BAA0B,OAAO,MAAM,OAAO,EAAE,qBAAqB;AACrF,UAAM,OAAO,EAAE,sBAAsB,OAAO,MAAM,EAAE,kBAAkB,QAAQ,CAAC;AAC/E,UAAM,IAAI,OAAO,SAAS,EAAE,MAAM,IAAI,EAAE,OAAO,QAAQ,CAAC,IAAI;AAC5D,UAAM,IAAI,OAAO,SAAS,EAAE,OAAO,IAAI,EAAE,QAAQ,QAAQ,CAAC,IAAI;AAC9D,UAAM,OAAO,EAAE,SAAS,IAAI,IAAI,EAAE,OAAO,GAAG,CAAC,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC,MAAM;AAC1E,UAAM,MAAM,EAAE,QAAQ,QAAQ,CAAC,OAAO,SAAS,EAAE,GAAG,IAAI,MAAM,IAAI,EAAE,GAAG;AACvE,UAAM;AAAA,MACJ,KAAK,EAAE,WAAW,MAAM,EAAE,QAAQ,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,MAAM,IAAI,MAAM,GAAG,MAAM,EAAE,mBAAmB,QAAQ,IAAI,MAAM,EAAE,QAAQ,GAAG;AAAA,IACpL;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,wBAAwB;AACnC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,gBAAgB;AAC3B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iBAAiB;AAC5B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,YAAa,OAAM,KAAK,KAAK,IAAI,EAAE;AACzE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,aAAa;AACxB,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,QAAS,OAAM,KAAK,KAAK,IAAI,EAAE;AACrE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,6BAA6B;AACxC,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,aAAc,OAAM,KAAK,KAAK,IAAI,EAAE;AAC1E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,uBAAuB;AAClC,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,eAAgB,OAAM,KAAK,KAAK,IAAI,EAAE;AAC5E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,eAAe;AAC1B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,UAAW,OAAM,KAAK,KAAK,IAAI,EAAE;AACvE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,gBAAgB;AAC3B,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,SAAS;AACpB,QAAM,KAAK,KAAK,UAAU,EAAE,QAAQ,OAAO,QAAQ,OAAO,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC;AAClF,QAAM,KAAK,KAAK;AAChB,MAAI,OAAO,iBAAiB;AAC1B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,qBAAqB;AAChC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,uDAAuD;AAClE,UAAM,KAAK,yBAAyB;AACpC,eAAW,KAAK,OAAO,gBAAgB,SAAS,MAAM,GAAG,EAAE,GAAG;AAC5D,YAAM;AAAA,QACJ,KAAK,EAAE,YAAY,MAAM,EAAE,QAAQ,MAAM,EAAE,YAAY,MAAM,MAAM,EAAE,YAAY,GAAG,MAAM,YAAY,EAAE,gBAAgB,EAAE,YAAY,CAAC;AAAA,MACzI;AAAA,IACF;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,mBAAmB,UAAkB,OAAuB;AACnE,QAAM,OAAO,eAAe,QAAQ;AACpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,WAAW,KAAK,CAAC;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,eAAe,UAA0B;AAChD,QAAM,QAAQ,SAAS,MAAM,IAAI;AACjC,QAAM,OAAiB,CAAC;AACxB,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,OAAiB,CAAC;AACtB,MAAI,QAAkB,CAAC;AAEvB,QAAM,YAAY,MAAM;AACtB,QAAI,QAAQ;AACV,WAAK,KAAK,OAAO;AACjB,eAAS;AAAA,IACX;AAAA,EACF;AACA,QAAM,aAAa,MAAM;AACvB,QAAI,MAAM,WAAW,EAAG;AACxB,SAAK,KAAK,oBAAoB,KAAK,CAAC;AACpC,YAAQ,CAAC;AAAA,EACX;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,KAAK,GAAG;AAC1B,UAAI,QAAQ;AACV,aAAK,KAAK,cAAc,WAAW,KAAK,KAAK,IAAI,CAAC,CAAC,eAAe;AAClE,eAAO,CAAC;AACR,iBAAS;AAAA,MACX,OAAO;AACL,kBAAU;AACV,mBAAW;AACX,iBAAS;AAAA,MACX;AACA;AAAA,IACF;AACA,QAAI,QAAQ;AACV,WAAK,KAAK,IAAI;AACd;AAAA,IACF;AACA,QAAI,KAAK,WAAW,GAAG,GAAG;AACxB,gBAAU;AACV,YAAM,KAAK,IAAI;AACf;AAAA,IACF;AACA,eAAW;AACX,QAAI,KAAK,WAAW,IAAI,GAAG;AACzB,UAAI,CAAC,QAAQ;AACX,aAAK,KAAK,MAAM;AAChB,iBAAS;AAAA,MACX;AACA,WAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AACrD;AAAA,IACF;AACA,cAAU;AACV,QAAI,KAAK,WAAW,IAAI,EAAG,MAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AAAA,aACvE,KAAK,WAAW,KAAK,EAAG,MAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AAAA,aAC7E,KAAK,WAAW,MAAM,EAAG,MAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AAAA,aAC9E,KAAK,KAAK,MAAM,GAAI,MAAK,KAAK,EAAE;AAAA,QACpC,MAAK,KAAK,MAAM,eAAe,IAAI,CAAC,MAAM;AAAA,EACjD;AACA,YAAU;AACV,aAAW;AACX,SAAO,KAAK,KAAK,IAAI;AACvB;AAEA,SAAS,oBAAoB,OAAyB;AACpD,QAAM,OAAO,MACV,OAAO,CAAC,SAAS,CAAC,iBAAiB,KAAK,IAAI,CAAC,EAC7C;AAAA,IAAI,CAAC,SACJ,KACG,MAAM,GAAG,EAAE,EACX,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,eAAe,KAAK,KAAK,CAAC,CAAC;AAAA,EAC9C;AACF,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI;AACxB,QAAM,KAAK,KAAM,IAAI,CAAC,SAAS,OAAO,IAAI,OAAO,EAAE,KAAK,EAAE;AAC1D,QAAM,MAAM,KACT,IAAI,CAAC,QAAQ,OAAO,IAAI,IAAI,CAAC,SAAS,OAAO,IAAI,OAAO,EAAE,KAAK,EAAE,CAAC,OAAO,EACzE,KAAK,IAAI;AACZ,SAAO,qBAAqB,EAAE,uBAAuB,GAAG;AAC1D;AAEA,SAAS,eAAe,GAAmB;AACzC,SAAO,WAAW,CAAC,EAAE,QAAQ,oBAAoB,qBAAqB;AACxE;AAEA,SAAS,WAAW,GAAmB;AACrC,SAAO,EACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ;AAC3B;AAEA,SAAS,YAAY,GAAmB;AACtC,SAAO,EAAE,QAAQ,OAAO,KAAK;AAC/B;AAEA,SAAS,eAAe,UAA0C;AAChE,MAAI,aAAa,UAAW,QAAO;AACnC,MAAI,aAAa,aAAc,QAAO;AACtC,MAAI,aAAa,OAAQ,QAAO;AAChC,MAAI,aAAa,kBAAmB,QAAO;AAC3C,SAAO;AACT;AAEA,SAAS,OAAO,GAAmB;AACjC,SAAO,GAAG,KAAK,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC;AACtC;AAIA,SAAS,IAAI,IAAsB;AACjC,MAAI,GAAG,WAAW,EAAG,QAAO,OAAO;AACnC,SAAO,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAC5C;AAEA,SAAS,eAAe,QAA0B;AAChD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,MAAM,KAAK,MAAM,OAAO,SAAS,CAAC;AACxC,SAAO,OAAO,SAAS,MAAM,KAAK,OAAO,MAAM,CAAC,IAAK,OAAO,GAAG,KAAM,IAAI,OAAO,GAAG;AACrF;AAEA,SAAS,IAAI,GAAmB;AAC9B,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO,OAAO,CAAC;AACxC,SAAO,EAAE,QAAQ,CAAC;AACpB;","names":[]}

package/dist/chunk-4F5DQN55.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/pre-registration.ts"],"sourcesContent":["/**\n * Pre-registered hypotheses — declare what you're testing BEFORE the\n * run, check it AFTER. Prevents p-hacking, optional stopping, and the\n * \"we ran until it looked good\" failure mode.\n *\n * Manifest is a plain JSON-friendly object. Sign it with a content hash\n * + timestamp; the registered record becomes immutable. Post-run,\n * evaluate the manifest against observed results — the library refuses\n * to let you re-interpret a different metric as the declared one.\n */\n\nexport interface HypothesisManifest {\n  id: string\n  /** Human prose — goes into the audit trail. */\n  hypothesis: string\n  /** Metric the hypothesis claims to move. */\n  metric: string\n  /** 'increase' = candidate should score higher than baseline; 'decrease' = lower. */\n  direction: 'increase' | 'decrease'\n  /** Minimum effect size to count (same units as the metric). */\n  minEffect: number\n  /** Alpha threshold. */\n  alpha: number\n  /** Target statistical power at which sample size was pre-computed. */\n  power: number\n  /** Declared N per arm before running. */\n  preRegisteredN: number\n  /** ISO8601 timestamp the manifest was registered. */\n  registeredAt: string\n  /** Optional identifiers to tie into the trace corpus. */\n  baselineLabel?: string\n  candidateLabel?: string\n}\n\n/**\n * Identifier for the hashing scheme used to produce `contentHash`.\n *\n * `'sha256-content'` — sha256 hex over the canonicalized manifest with\n * the `contentHash` and `algo` fields stripped. This is what\n * `signManifest` produces today.\n *\n * Held as a string union so future schemes can be added without\n * breaking parsers; legacy SignedManifest values written before this\n * field existed will deserialize cleanly because the field is optional.\n */\nexport type SignedManifestAlgo = 'sha256-content'\n\nexport interface SignedManifest extends HypothesisManifest {\n  /** sha256 hex of canonicalized manifest (everything except contentHash and algo). */\n  contentHash: string\n  /**\n   * Algorithm string describing how `contentHash` was produced.\n   *\n   * Optional on the type so legacy serialized manifests (pre-`algo`)\n   * still parse, but ALWAYS populated by {@link signManifest}.\n   * Consumers that want to enforce a known algorithm should reject\n   * manifests where this field is missing or unrecognized.\n   */\n  algo?: SignedManifestAlgo\n}\n\nexport interface HypothesisResult {\n  manifest: SignedManifest\n  observedN: number\n  observedEffect: number\n  observedPValue: number\n  /** True iff the observed effect hits the pre-declared direction with\n   *  magnitude ≥ minEffect AND p < alpha. */\n  confirmed: boolean\n  /** Enumerated reasons the hypothesis was rejected (each a machine-tag). */\n  rejectionReasons: Array<\n    'wrong_direction' | 'effect_too_small' | 'not_significant' | 'undersampled'\n  >\n  notes?: string\n}\n\n/**\n * Deterministic JSON canonicalization — sort object keys recursively.\n *\n * Two semantically-equal objects produce byte-identical canonicalized output;\n * this is what makes a content-hash stable across encoders, key insertion\n * orders, and runtime versions. Exported for any consumer that needs the same\n * canonicalization guarantee outside the manifest-signing path (e.g., signing\n * an artifact bundle, hashing a dataset version, etc.).\n */\nexport function canonicalize(v: unknown): unknown {\n  if (v === null || typeof v !== 'object') return v\n  if (Array.isArray(v)) return v.map(canonicalize)\n  const keys = Object.keys(v as Record<string, unknown>).sort()\n  const out: Record<string, unknown> = {}\n  for (const k of keys) out[k] = canonicalize((v as Record<string, unknown>)[k])\n  return out\n}\n\n/**\n * SHA-256 hex (full 64 chars) over the canonicalized JSON encoding of `obj`.\n *\n * The same primitive `signManifest` and `verifyManifest` are built on, exposed\n * directly so consumers signing arbitrary structured content (artifact bundles,\n * production packets, dataset manifests, etc.) don't have to re-derive\n * canonicalize+sha256 from scratch.\n *\n * Stable across:\n *   - object key insertion order (canonicalization sorts keys recursively)\n *   - encoder choice (UTF-8 via TextEncoder, fixed)\n *   - runtime (uses the Web Crypto subtle digest, present in Node ≥18 and browsers)\n *\n * Naming note: `hashJson` rather than `hashContent` because `hashContent` is\n * already taken in `prompt-registry.ts` for the truncated 12-char prompt-id\n * helper, which has different semantics (string input, short return). Both\n * coexist; `hashJson` is the right name when you mean \"canonicalize then hash.\"\n *\n * @example\n *   const hash = await hashJson({ id: '1', kind: 'spec' })\n *   // 'a3f1...' (64 hex chars)\n */\nexport async function hashJson<T>(obj: T): Promise<string> {\n  const canonical = canonicalize(obj)\n  const bytes = new TextEncoder().encode(JSON.stringify(canonical))\n  const digest = await globalThis.crypto.subtle.digest('SHA-256', bytes)\n  return Array.from(new Uint8Array(digest))\n    .map((b) => b.toString(16).padStart(2, '0'))\n    .join('')\n}\n\n/**\n * Sign a manifest with a SHA-256 content hash.\n *\n * The hash covers the canonicalized manifest with the `contentHash`\n * and `algo` fields stripped; this lets verifiers re-sign the rest and\n * compare. Returned manifest always carries `algo: 'sha256-content'`\n * so downstream consumers can identify the scheme; legacy serialized\n * manifests without `algo` still verify because it is stripped before\n * hashing on both sides.\n */\nexport async function signManifest(m: HypothesisManifest): Promise<SignedManifest> {\n  const hash = await hashJson(m)\n  return { ...m, contentHash: hash, algo: 'sha256-content' }\n}\n\n/**\n * Verify that a signed manifest has not been tampered with.\n *\n * Strips `contentHash` and `algo` before re-signing so legacy manifests\n * (written before `algo` was emitted) verify identically to current\n * ones.\n */\nexport async function verifyManifest(m: SignedManifest): Promise<boolean> {\n  const { contentHash, algo: _algo, ...rest } = m\n  void _algo\n  const resigned = await signManifest(rest)\n  return resigned.contentHash === contentHash\n}\n\n/**\n * Evaluate a pre-registered hypothesis against observed results.\n * Mechanical — no re-interpretation permitted.\n */\nexport async function evaluateHypothesis(\n  manifest: SignedManifest,\n  observed: { n: number; effect: number; pValue: number },\n): Promise<HypothesisResult> {\n  if (!(await verifyManifest(manifest))) {\n    throw new Error('evaluateHypothesis: manifest content hash mismatch (tampered)')\n  }\n  const reasons: HypothesisResult['rejectionReasons'] = []\n  const directionOk = manifest.direction === 'increase' ? observed.effect > 0 : observed.effect < 0\n  if (!directionOk) reasons.push('wrong_direction')\n  if (Math.abs(observed.effect) < manifest.minEffect) reasons.push('effect_too_small')\n  if (observed.pValue >= manifest.alpha) reasons.push('not_significant')\n  if (observed.n < manifest.preRegisteredN) reasons.push('undersampled')\n  return {\n    manifest,\n    observedN: observed.n,\n    observedEffect: observed.effect,\n    observedPValue: observed.pValue,\n    confirmed: reasons.length === 0,\n    rejectionReasons: reasons,\n  }\n}\n"],"mappings":";AAqFO,SAAS,aAAa,GAAqB;AAChD,MAAI,MAAM,QAAQ,OAAO,MAAM,SAAU,QAAO;AAChD,MAAI,MAAM,QAAQ,CAAC,EAAG,QAAO,EAAE,IAAI,YAAY;AAC/C,QAAM,OAAO,OAAO,KAAK,CAA4B,EAAE,KAAK;AAC5D,QAAM,MAA+B,CAAC;AACtC,aAAW,KAAK,KAAM,KAAI,CAAC,IAAI,aAAc,EAA8B,CAAC,CAAC;AAC7E,SAAO;AACT;AAwBA,eAAsB,SAAY,KAAyB;AACzD,QAAM,YAAY,aAAa,GAAG;AAClC,QAAM,QAAQ,IAAI,YAAY,EAAE,OAAO,KAAK,UAAU,SAAS,CAAC;AAChE,QAAM,SAAS,MAAM,WAAW,OAAO,OAAO,OAAO,WAAW,KAAK;AACrE,SAAO,MAAM,KAAK,IAAI,WAAW,MAAM,CAAC,EACrC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AACZ;AAYA,eAAsB,aAAa,GAAgD;AACjF,QAAM,OAAO,MAAM,SAAS,CAAC;AAC7B,SAAO,EAAE,GAAG,GAAG,aAAa,MAAM,MAAM,iBAAiB;AAC3D;AASA,eAAsB,eAAe,GAAqC;AACxE,QAAM,EAAE,aAAa,MAAM,OAAO,GAAG,KAAK,IAAI;AAC9C,OAAK;AACL,QAAM,WAAW,MAAM,aAAa,IAAI;AACxC,SAAO,SAAS,gBAAgB;AAClC;AAMA,eAAsB,mBACpB,UACA,UAC2B;AAC3B,MAAI,CAAE,MAAM,eAAe,QAAQ,GAAI;AACrC,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,QAAM,UAAgD,CAAC;AACvD,QAAM,cAAc,SAAS,cAAc,aAAa,SAAS,SAAS,IAAI,SAAS,SAAS;AAChG,MAAI,CAAC,YAAa,SAAQ,KAAK,iBAAiB;AAChD,MAAI,KAAK,IAAI,SAAS,MAAM,IAAI,SAAS,UAAW,SAAQ,KAAK,kBAAkB;AACnF,MAAI,SAAS,UAAU,SAAS,MAAO,SAAQ,KAAK,iBAAiB;AACrE,MAAI,SAAS,IAAI,SAAS,eAAgB,SAAQ,KAAK,cAAc;AACrE,SAAO;AAAA,IACL;AAAA,IACA,WAAW,SAAS;AAAA,IACpB,gBAAgB,SAAS;AAAA,IACzB,gBAAgB,SAAS;AAAA,IACzB,WAAW,QAAQ,WAAW;AAAA,IAC9B,kBAAkB;AAAA,EACpB;AACF;","names":[]}

package/dist/chunk-5LBB5B3Z.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/wire/schemas.ts","../src/wire/rubrics.ts","../src/wire/handlers.ts","../src/wire/openapi.ts","../src/wire/rpc.ts","../src/wire/server.ts"],"sourcesContent":["/**\n * Wire-protocol schemas.\n *\n * These Zod schemas are the contract between the agent-eval runtime and\n * any non-TypeScript client (Python, Rust, Go, …). They get rendered to\n * OpenAPI by `wire/openapi.ts` and code-generators consume that spec to\n * produce typed clients in other languages.\n *\n * Rule: if it's not in this file, it isn't on the wire. Keep names and\n * shapes self-explanatory — every field has a `.describe()` so the\n * generated docs are useful without reading the source.\n */\nimport { extendZodWithOpenApi } from '@asteasolutions/zod-to-openapi'\nimport { z } from 'zod'\n\nextendZodWithOpenApi(z)\n\n// ── Building blocks ─────────────────────────────────────────────────\n\nexport const RubricDimensionSchema = z\n  .object({\n    id: z\n      .string()\n      .min(1)\n      .describe('Short stable id like \"buyer_quality\" — used as the key in scoring output.'),\n    description: z\n      .string()\n      .min(1)\n      .describe('One-line plain-English meaning. Read by humans reviewing low scores.'),\n    weight: z\n      .number()\n      .min(0)\n      .default(1)\n      .describe('Relative weight in the composite score. Default 1; 0 disables.'),\n    min: z.number().default(0).describe('Lower bound of valid score for this dimension.'),\n    max: z.number().default(1).describe('Upper bound of valid score for this dimension.'),\n  })\n  .openapi('RubricDimension')\n\nexport const FailureModeSchema = z\n  .object({\n    id: z.string().min(1).describe('Short stable id like \"ai-cadence\" — used in detection lists.'),\n    description: z.string().min(1).describe('Plain-English description of the failure pattern.'),\n  })\n  .openapi('FailureMode')\n\n// ── Rubric ──────────────────────────────────────────────────────────\n\nexport const RubricSchema = z\n  .object({\n    name: z\n      .string()\n      .min(1)\n      .describe('Stable name like \"anti-slop\" — used by clients to invoke this rubric.'),\n    description: z\n      .string()\n      .min(1)\n      .describe('What this rubric measures. Shown in /v1/rubrics listing.'),\n    systemPrompt: z\n      .string()\n      .min(1)\n      .describe(\n        'Instructs the judging LLM. Should explain the persona (e.g. \"senior engineer reviewing voice\"), what to score on, and what to return.',\n      ),\n    dimensions: z\n      .array(RubricDimensionSchema)\n      .min(1)\n      .describe('Scoring axes. The composite score is a weighted sum of these.'),\n    failureModes: z\n      .array(FailureModeSchema)\n      .default([])\n      .describe('Patterns to detect; each detected mode appears in the result.failureModes list.'),\n    wins: z\n      .array(FailureModeSchema)\n      .default([])\n      .describe('Positive patterns; each detected one appears in the result.wins list.'),\n  })\n  .openapi('Rubric')\n\n// ── Judge call ──────────────────────────────────────────────────────\n\nexport const JudgeRequestSchema = z\n  .object({\n    rubricName: z\n      .string()\n      .optional()\n      .describe('Use a built-in rubric by name. Mutually exclusive with `rubric`.'),\n    rubric: RubricSchema.optional().describe(\n      'Inline rubric definition. Mutually exclusive with `rubricName`.',\n    ),\n    content: z\n      .string()\n      .min(1)\n      .describe('The text being judged — a tweet, a blog post, a code snippet, anything stringly.'),\n    context: z\n      .record(z.string(), z.unknown())\n      .optional()\n      .describe(\n        'Free-form metadata for the rubric to use — analytics, source URL, author, etc. Surfaced to the LLM.',\n      ),\n    model: z\n      .string()\n      .optional()\n      .describe('Override the judge model (default routes via tcloud). e.g. \"claude-opus-4-7\".'),\n  })\n  .refine((v) => Boolean(v.rubricName) !== Boolean(v.rubric), {\n    message: 'Provide exactly one of `rubricName` or `rubric`.',\n  })\n  .openapi('JudgeRequest')\n\nexport const JudgeResultSchema = z\n  .object({\n    composite: z\n      .number()\n      .min(0)\n      .max(1)\n      .describe('Weighted combination of dimension scores in 0..1. The single number to gate on.'),\n    dimensions: z\n      .record(z.string(), z.number())\n      .describe('Per-dimension score, keyed by RubricDimension.id.'),\n    failureModes: z\n      .array(z.string())\n      .default([])\n      .describe('Failure-mode ids detected in the content (subset of rubric.failureModes ids).'),\n    wins: z\n      .array(z.string())\n      .default([])\n      .describe('Win ids detected in the content (subset of rubric.wins ids).'),\n    rationale: z\n      .string()\n      .describe('Plain-English explanation of the score. Surfaced to the human reviewer.'),\n    rubricVersion: z\n      .string()\n      .describe(\n        'Stable hash of the rubric used. Scores are only comparable across runs when this matches.',\n      ),\n    model: z.string().describe('Model that produced the judgement, for reproducibility.'),\n    durationMs: z.number().int().nonnegative().describe('End-to-end wall time for this call.'),\n  })\n  .openapi('JudgeResult')\n\n// ── Rubric listing ──────────────────────────────────────────────────\n\nexport const RubricInfoSchema = z\n  .object({\n    name: z.string().describe('Pass this to /v1/judge as `rubricName`.'),\n    description: z.string().describe('What this rubric measures.'),\n    dimensions: z\n      .array(z.object({ id: z.string(), description: z.string(), weight: z.number() }))\n      .describe('The scoring axes this rubric uses, with weights.'),\n    failureModes: z.array(z.string()).default([]).describe('Failure-mode ids this rubric detects.'),\n    rubricVersion: z.string().describe('Stable hash — match this to compare scores across runs.'),\n  })\n  .openapi('RubricInfo')\n\nexport const ListRubricsResponseSchema = z\n  .object({\n    rubrics: z.array(RubricInfoSchema),\n  })\n  .openapi('ListRubricsResponse')\n\n// ── Version / health ────────────────────────────────────────────────\n\nexport const VersionResponseSchema = z\n  .object({\n    package: z.string().describe('Package name (always \"@tangle-network/agent-eval\").'),\n    version: z.string().describe('Semver of the running server. Match your client to this.'),\n    wireVersion: z\n      .string()\n      .describe(\n        'Wire-protocol semver. Bumps separately from package version when the schema changes.',\n      ),\n    apiSurface: z.array(z.string()).describe('List of supported method names.'),\n  })\n  .openapi('VersionResponse')\n\nexport const HealthResponseSchema = z\n  .object({\n    status: z.literal('ok'),\n    uptimeSec: z.number(),\n  })\n  .openapi('HealthResponse')\n\n// ── Ingestion: production traces + user feedback (0.25.0) ───────────\n\n/**\n * Minimal `TraceEvent` shape that the production runtime emits.\n * Matches `trace/schema.ts` `TraceEvent` but is duplicated here as a\n * wire schema so non-TypeScript clients can validate without depending\n * on internal types.\n */\nexport const TraceEventSchema = z\n  .object({\n    eventId: z.string().min(1).describe('Stable id for the event. Use ULID or UUID.'),\n    runId: z.string().min(1).describe('Run this event belongs to.'),\n    spanId: z.string().optional().describe('Span that emitted the event, if any.'),\n    kind: z\n      .enum([\n        'log',\n        'error',\n        'budget_decrement',\n        'budget_breach',\n        'state_mutation',\n        'policy_violation',\n        'redaction_applied',\n        'custom',\n      ])\n      .describe('Coarse event category — matches the TraceSchema v1 EventKind enum.'),\n    timestamp: z\n      .number()\n      .int()\n      .nonnegative()\n      .describe('Unix millis. Must be monotonically non-decreasing within a span.'),\n    payload: z\n      .record(z.string(), z.unknown())\n      .describe('Free-form payload — the runtime owns the shape.'),\n  })\n  .openapi('TraceEvent')\n\nexport const TracesIngestRequestSchema = z\n  .object({\n    events: z\n      .array(TraceEventSchema)\n      .min(1)\n      .max(10_000)\n      .describe('Batch of events. Max 10k per call — bigger streams should be chunked.'),\n  })\n  .openapi('TracesIngestRequest')\n\nexport const TracesIngestResponseSchema = z\n  .object({\n    accepted: z.number().int().nonnegative().describe('Number of events persisted.'),\n    rejected: z\n      .number()\n      .int()\n      .nonnegative()\n      .describe('Number of events the store refused — see `errors[]` for reasons.'),\n    errors: z\n      .array(\n        z.object({\n          eventId: z.string().describe('Event id this error applies to.'),\n          message: z.string().describe('Why the event was rejected.'),\n        }),\n      )\n      .default([]),\n  })\n  .openapi('TracesIngestResponse')\n\nexport const FeedbackLabelSchema = z\n  .object({\n    id: z.string().optional(),\n    source: z.enum(['user', 'judge', 'environment', 'metric', 'policy', 'system']),\n    kind: z.enum([\n      'approve',\n      'reject',\n      'select',\n      'edit',\n      'rank',\n      'rate',\n      'comment',\n      'metric_outcome',\n      'policy_block',\n      'revision_request',\n    ]),\n    value: z.unknown(),\n    reason: z.string().optional(),\n    severity: z.enum(['info', 'warning', 'error', 'critical']).optional(),\n    createdAt: z.string().describe('ISO-8601 UTC.'),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n  })\n  .openapi('FeedbackLabel')\n\nexport const FeedbackAttemptSchema = z\n  .object({\n    id: z.string().min(1),\n    stepIndex: z.number().int().nonnegative(),\n    artifactType: z.enum([\n      'text',\n      'code',\n      'plan',\n      'research',\n      'action',\n      'ui',\n      'decision',\n      'data',\n      'other',\n    ]),\n    artifact: z.unknown(),\n    options: z.array(z.unknown()).optional(),\n    proposedAction: z\n      .object({\n        type: z.string(),\n        risk: z.enum(['low', 'medium', 'high']).optional(),\n        costUsd: z.number().optional(),\n        externalSideEffect: z.boolean().optional(),\n        requiresApproval: z.boolean().optional(),\n        metadata: z.record(z.string(), z.unknown()).optional(),\n      })\n      .optional(),\n    feedback: z.array(FeedbackLabelSchema).optional(),\n    createdAt: z.string(),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n  })\n  .openapi('FeedbackAttempt')\n\nexport const FeedbackTrajectorySchema = z\n  .object({\n    id: z.string().min(1).describe('Stable id; idempotency key for the trajectory.'),\n    projectId: z.string().optional(),\n    scenarioId: z.string().optional(),\n    task: z.object({\n      intent: z.string().min(1),\n      context: z.unknown().optional(),\n    }),\n    attempts: z.array(FeedbackAttemptSchema).default([]),\n    labels: z.array(FeedbackLabelSchema).default([]),\n    outcome: z\n      .object({\n        success: z.boolean().optional(),\n        score: z.number().optional(),\n        metrics: z.record(z.string(), z.number()).optional(),\n        costUsd: z.number().optional(),\n        detail: z.string().optional(),\n        observedAt: z.string().optional(),\n        metadata: z.record(z.string(), z.unknown()).optional(),\n      })\n      .optional(),\n    split: z.enum(['train', 'dev', 'test', 'holdout']).optional(),\n    tags: z.record(z.string(), z.string()).optional(),\n    createdAt: z.string().describe('ISO-8601 UTC.'),\n    updatedAt: z.string().optional(),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n  })\n  .openapi('FeedbackTrajectory')\n\nexport const FeedbackIngestResponseSchema = z\n  .object({\n    id: z.string().describe('Trajectory id that was persisted.'),\n    persisted: z.boolean().describe('True when the trajectory was saved (idempotent on id).'),\n  })\n  .openapi('FeedbackIngestResponse')\n\nexport type TraceEvent = z.infer<typeof TraceEventSchema>\nexport type TracesIngestRequest = z.infer<typeof TracesIngestRequestSchema>\nexport type TracesIngestResponse = z.infer<typeof TracesIngestResponseSchema>\nexport type FeedbackTrajectory = z.infer<typeof FeedbackTrajectorySchema>\nexport type FeedbackIngestResponse = z.infer<typeof FeedbackIngestResponseSchema>\n\n// ── Errors ──────────────────────────────────────────────────────────\n\nexport const ErrorResponseSchema = z\n  .object({\n    error: z\n      .object({\n        code: z\n          .string()\n          .describe(\n            'Machine-readable code: \"validation_error\", \"rubric_not_found\", \"judge_error\".',\n          ),\n        message: z.string().describe('Human-readable message.'),\n        details: z.unknown().optional().describe('Optional structured detail.'),\n      })\n      .describe('Errors are always wrapped in this shape across all endpoints.'),\n  })\n  .openapi('ErrorResponse')\n\n// ── Type exports for callers in the same package ────────────────────\n\nexport type RubricDimension = z.infer<typeof RubricDimensionSchema>\nexport type FailureMode = z.infer<typeof FailureModeSchema>\nexport type Rubric = z.infer<typeof RubricSchema>\nexport type JudgeRequest = z.infer<typeof JudgeRequestSchema>\nexport type JudgeResult = z.infer<typeof JudgeResultSchema>\nexport type RubricInfo = z.infer<typeof RubricInfoSchema>\nexport type ListRubricsResponse = z.infer<typeof ListRubricsResponseSchema>\nexport type VersionResponse = z.infer<typeof VersionResponseSchema>\nexport type ErrorResponse = z.infer<typeof ErrorResponseSchema>\n\n// ── Wire-protocol version ───────────────────────────────────────────\n\n/**\n * Bump on any breaking change to a request/response schema.\n * Non-breaking (additive) changes don't require a bump.\n */\nexport const WIRE_VERSION = '1.0.0'\n\n/**\n * Stable hash of a rubric. Used to make scores comparable across runs:\n * if the rubricVersion matches, the rubric was identical.\n */\nexport function hashRubric(rubric: Rubric): string {\n  const stable = stableStringify(rubric)\n  let h = 5381\n  for (let i = 0; i < stable.length; i++) {\n    h = (h * 33) ^ stable.charCodeAt(i)\n  }\n  // Unsigned 32-bit hex, prefixed with rubric name + version slot\n  return `${rubric.name}@${(h >>> 0).toString(16).padStart(8, '0')}`\n}\n\nfunction stableStringify(value: unknown): string {\n  if (Array.isArray(value)) return `[${value.map((item) => stableStringify(item)).join(',')}]`\n  if (value && typeof value === 'object') {\n    const entries = Object.entries(value as Record<string, unknown>)\n      .sort(([a], [b]) => a.localeCompare(b))\n      .map(([key, item]) => `${JSON.stringify(key)}:${stableStringify(item)}`)\n    return `{${entries.join(',')}}`\n  }\n  return JSON.stringify(value)\n}\n","/**\n * Built-in rubrics shipped with agent-eval.\n *\n * A rubric is a set of scoring axes plus a system prompt that tells the\n * judging LLM how to grade against those axes. Built-in rubrics are\n * curated for use cases that recur across Tangle projects — call them\n * by name from any client.\n *\n * Adding a rubric:\n *   1. Define the Rubric object below with a clear `description` and\n *      named `dimensions`.\n *   2. Register it in `BUILTIN_RUBRICS` at the bottom.\n *   3. Add a test in `tests/wire/rubrics.test.ts`.\n *\n * Custom rubrics: callers pass `rubric` inline to /v1/judge instead of\n * `rubricName` — see schemas.ts.\n */\nimport type { Rubric } from './schemas'\nimport { hashRubric } from './schemas'\n\n// ── anti-slop ───────────────────────────────────────────────────────\n// Voice/style judge tuned for technical-buyer audiences. Used by the\n// Postiz autoresearch loop and any content-quality gate.\n\nconst ANTI_SLOP: Rubric = {\n  name: 'anti-slop',\n  description:\n    'Voice and signal quality for content aimed at senior engineers. Catches AI cadence, marketing tone, and engagement-bait shapes.',\n  systemPrompt: `You are evaluating a piece of content written for senior engineers and technical founders.\n\nYou score three things:\n- buyer_quality (0..1): would a senior engineer in the target ICP find this worth their attention? High = specific, earned, technically interesting. Low = generic, hyped, off-target.\n- voice (0..1): does it read like a person who built the thing, or like AI/marketing copy?\n- signal (0..1): does it contain a non-obvious detail, constraint, or claim a reader couldn't get from the public docs?\n\nDetect failure modes (return ids matching):\n- ai-cadence: rule-of-three openings, em-dash flourish, \"Let me explain\", \"Here's the thing\", AI rhythm\n- marketing-tone: \"We're excited to announce\", \"thrilled\", \"delighted\", \"game-changer\", buzzword stack\n- vague-claim: technical claim without a specific component, file, or measurement\n- no-hook: opening doesn't earn attention from the target reader\n- engagement-bait: \"agree?\", \"thoughts?\", listicles, controversy-fishing, hook-detail-pitch\n- off-icp: content shape would attract motivational/grift/hype audiences instead of buyers\n- stale-claim: repeats a positioning line we've used many times this month\n\nDetect wins (return ids matching):\n- specific-component: names a real file, component, or measurement\n- earned-detail: shares a non-obvious detail not derivable from public docs\n- constraint-articulated: names a real tradeoff and the side chosen\n- honest-failure: describes a real failure mode and what was done about it\n\nReturn ONLY JSON matching the response schema. Be conservative — most content has 0-1 wins and 1-2 failure modes, not many of each.`,\n  dimensions: [\n    {\n      id: 'buyer_quality',\n      description: 'Would the target buyer find this worth attention?',\n      weight: 0.5,\n      min: 0,\n      max: 1,\n    },\n    {\n      id: 'voice',\n      description: 'Does it sound like a builder, not AI or marketing?',\n      weight: 0.3,\n      min: 0,\n      max: 1,\n    },\n    {\n      id: 'signal',\n      description: 'Non-obvious detail, constraint, or claim?',\n      weight: 0.2,\n      min: 0,\n      max: 1,\n    },\n  ],\n  failureModes: [\n    { id: 'ai-cadence', description: 'AI-rhythm openings and transitions' },\n    { id: 'marketing-tone', description: 'Buzzwords, hype, corporate-PR voice' },\n    { id: 'vague-claim', description: 'Technical claim without specifics' },\n    { id: 'no-hook', description: 'Opening fails to earn attention' },\n    { id: 'engagement-bait', description: 'Listicle/controversy/agree-pattern' },\n    { id: 'off-icp', description: 'Voice attracts the wrong audience' },\n    { id: 'stale-claim', description: 'Reuses an over-used positioning line' },\n  ],\n  wins: [\n    { id: 'specific-component', description: 'Names a real file/component/number' },\n    { id: 'earned-detail', description: 'Detail not in public docs' },\n    { id: 'constraint-articulated', description: 'Names a real tradeoff' },\n    { id: 'honest-failure', description: 'Describes a real failure honestly' },\n  ],\n}\n\n// ── Registry ────────────────────────────────────────────────────────\n\nexport const BUILTIN_RUBRICS: Record<string, Rubric> = {\n  'anti-slop': ANTI_SLOP,\n}\n\n/** Get a built-in rubric by name, or undefined. */\nexport function getBuiltinRubric(name: string): Rubric | undefined {\n  return BUILTIN_RUBRICS[name]\n}\n\n/** List built-in rubrics with their stable versions. */\nexport function listBuiltinRubrics() {\n  return Object.values(BUILTIN_RUBRICS).map((r) => ({\n    name: r.name,\n    description: r.description,\n    dimensions: r.dimensions.map((d) => ({\n      id: d.id,\n      description: d.description,\n      weight: d.weight,\n    })),\n    failureModes: r.failureModes.map((f) => f.id),\n    rubricVersion: hashRubric(r),\n  }))\n}\n","/**\n * Pure handler functions — the \"business logic\" behind every wire-protocol\n * method. The HTTP server (`server.ts`) and the stdio RPC (`rpc.ts`) both\n * call these. Tests call these directly without spinning a server.\n *\n * Each handler:\n *   - Takes a parsed request (already Zod-validated by the transport).\n *   - Returns a result that matches the response schema.\n *   - Throws `WireError` for caller-fixable errors (404, 400, 422).\n *   - Lets unexpected errors bubble — the transport maps them to 500.\n */\nimport type { FeedbackTrajectoryStore } from '../feedback-trajectory'\nimport { callLlmJson } from '../llm-client'\nimport type { TraceEvent as InternalTraceEvent } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\nimport { getBuiltinRubric, listBuiltinRubrics } from './rubrics'\nimport {\n  type FeedbackIngestResponse,\n  hashRubric,\n  type JudgeRequest,\n  type JudgeResult,\n  type ListRubricsResponse,\n  type Rubric,\n  type TracesIngestRequest,\n  type TracesIngestResponse,\n  type VersionResponse,\n  WIRE_VERSION,\n  type FeedbackTrajectory as WireFeedbackTrajectory,\n} from './schemas'\n\n/** Caller-fixable error. The transport renders this to 4xx + ErrorResponse. */\nexport class WireError extends Error {\n  constructor(\n    public readonly code: string,\n    message: string,\n    public readonly status: number = 400,\n    public readonly details?: unknown,\n  ) {\n    super(message)\n    this.name = 'WireError'\n  }\n}\n\n// ── judge ───────────────────────────────────────────────────────────\n\n/** The JSON schema we ask the judging LLM to fill in. */\nfunction judgeOutputSchema(rubric: Rubric) {\n  return {\n    name: 'JudgeOutput',\n    schema: {\n      type: 'object',\n      additionalProperties: false,\n      properties: {\n        dimensions: {\n          type: 'object',\n          additionalProperties: false,\n          properties: Object.fromEntries(\n            rubric.dimensions.map((d) => [\n              d.id,\n              { type: 'number', minimum: d.min, maximum: d.max },\n            ]),\n          ),\n          required: rubric.dimensions.map((d) => d.id),\n        },\n        failureModes: {\n          type: 'array',\n          items: { type: 'string', enum: rubric.failureModes.map((f) => f.id) },\n        },\n        wins: {\n          type: 'array',\n          items: { type: 'string', enum: rubric.wins.map((w) => w.id) },\n        },\n        rationale: { type: 'string' },\n      },\n      required: ['dimensions', 'rationale'],\n    } as Record<string, unknown>,\n  }\n}\n\ninterface JudgeOutput {\n  dimensions: Record<string, number>\n  failureModes?: string[]\n  wins?: string[]\n  rationale: string\n}\n\nfunction validateJudgeOutput(value: unknown, rubric: Rubric): JudgeOutput {\n  if (!value || typeof value !== 'object') {\n    throw new WireError('judge_error', 'Judge returned malformed output.', 500, value)\n  }\n  const raw = value as Record<string, unknown>\n  const rawDimensions = raw.dimensions\n  if (!rawDimensions || typeof rawDimensions !== 'object' || Array.isArray(rawDimensions)) {\n    throw new WireError('judge_error', 'Judge returned malformed dimensions.', 500, value)\n  }\n\n  const dimensions: Record<string, number> = {}\n  const dimensionRecord = rawDimensions as Record<string, unknown>\n  for (const dim of rubric.dimensions) {\n    const score = dimensionRecord[dim.id]\n    if (\n      typeof score !== 'number' ||\n      !Number.isFinite(score) ||\n      score < dim.min ||\n      score > dim.max\n    ) {\n      throw new WireError(\n        'judge_error',\n        `Judge returned invalid score for dimension \"${dim.id}\".`,\n        500,\n        value,\n      )\n    }\n    dimensions[dim.id] = score\n  }\n\n  const allowedFailures = new Set(rubric.failureModes.map((mode) => mode.id))\n  const allowedWins = new Set(rubric.wins.map((win) => win.id))\n  const failureModes = validateIdArray(raw.failureModes, allowedFailures, 'failureModes', value)\n  const wins = validateIdArray(raw.wins, allowedWins, 'wins', value)\n  if (typeof raw.rationale !== 'string' || raw.rationale.trim().length === 0) {\n    throw new WireError('judge_error', 'Judge returned missing rationale.', 500, value)\n  }\n\n  return { dimensions, failureModes, wins, rationale: raw.rationale }\n}\n\nfunction validateIdArray(\n  raw: unknown,\n  allowed: Set<string>,\n  field: 'failureModes' | 'wins',\n  original: unknown,\n): string[] {\n  if (raw === undefined) return []\n  if (!Array.isArray(raw)) {\n    throw new WireError('judge_error', `Judge returned non-array ${field}.`, 500, original)\n  }\n  const out: string[] = []\n  for (const item of raw) {\n    if (typeof item !== 'string' || !allowed.has(item)) {\n      throw new WireError(\n        'judge_error',\n        `Judge returned unknown ${field} id \"${String(item)}\".`,\n        500,\n        original,\n      )\n    }\n    out.push(item)\n  }\n  return out\n}\n\nfunction compositeScore(dimensions: Record<string, number>, rubric: Rubric): number {\n  let weighted = 0\n  let totalWeight = 0\n  for (const dim of rubric.dimensions) {\n    const raw = dimensions[dim.id] ?? 0\n    const range = dim.max - dim.min || 1\n    const normalized = Math.max(0, Math.min(1, (raw - dim.min) / range))\n    weighted += normalized * dim.weight\n    totalWeight += dim.weight\n  }\n  return totalWeight > 0 ? weighted / totalWeight : 0\n}\n\nfunction buildJudgePrompt(content: string, context: unknown): string {\n  const ctx = context && Object.keys(context as object).length ? JSON.stringify(context) : ''\n  return [\n    `CONTENT TO JUDGE:`,\n    content,\n    '',\n    ctx ? `CONTEXT (metadata, analytics, etc.):` : '',\n    ctx ? ctx : '',\n  ]\n    .filter(Boolean)\n    .join('\\n')\n}\n\nconst DEFAULT_JUDGE_MODEL = 'claude-sonnet-4-6'\n\nexport async function handleJudge(req: JudgeRequest): Promise<JudgeResult> {\n  // Resolve rubric\n  let rubric: Rubric\n  if (req.rubricName) {\n    const found = getBuiltinRubric(req.rubricName)\n    if (!found) {\n      throw new WireError('rubric_not_found', `No built-in rubric named \"${req.rubricName}\".`, 404)\n    }\n    rubric = found\n  } else if (req.rubric) {\n    rubric = req.rubric\n  } else {\n    // refine() in the schema should already have caught this — defense in depth\n    throw new WireError('validation_error', 'Provide either `rubricName` or `rubric`.', 422)\n  }\n\n  const startedAt = Date.now()\n  const model = req.model ?? DEFAULT_JUDGE_MODEL\n\n  const { value, result } = await callLlmJson<JudgeOutput>({\n    model,\n    messages: [\n      { role: 'system', content: rubric.systemPrompt },\n      { role: 'user', content: buildJudgePrompt(req.content, req.context) },\n    ],\n    jsonSchema: judgeOutputSchema(rubric),\n    temperature: 0.0,\n    timeoutMs: 60_000,\n  })\n\n  const output = validateJudgeOutput(value, rubric)\n\n  const composite = compositeScore(output.dimensions, rubric)\n  const durationMs = Date.now() - startedAt\n\n  return {\n    composite,\n    dimensions: output.dimensions,\n    failureModes: output.failureModes ?? [],\n    wins: output.wins ?? [],\n    rationale: output.rationale,\n    rubricVersion: hashRubric(rubric),\n    model: result.model,\n    durationMs,\n  }\n}\n\n// ── listRubrics ─────────────────────────────────────────────────────\n\nexport function handleListRubrics(): ListRubricsResponse {\n  return { rubrics: listBuiltinRubrics() }\n}\n\n// ── version ─────────────────────────────────────────────────────────\n\nimport { readFileSync } from 'node:fs'\nimport { dirname, resolve } from 'node:path'\nimport { fileURLToPath } from 'node:url'\n\nlet CACHED_VERSION: string | undefined\n\nfunction readPackageVersion(): string {\n  if (CACHED_VERSION) return CACHED_VERSION\n  // Walk up from this file looking for the nearest package.json.\n  // In dist/ this is dist/.., in src/wire/ this is ../../package.json.\n  const here = dirname(fileURLToPath(import.meta.url))\n  const candidates = [\n    resolve(here, '..', '..', 'package.json'), // src/wire → repo root\n    resolve(here, '..', 'package.json'), // dist → repo root\n  ]\n  for (const path of candidates) {\n    try {\n      const pkg = JSON.parse(readFileSync(path, 'utf-8')) as { version?: string }\n      if (pkg.version) {\n        CACHED_VERSION = pkg.version\n        return pkg.version\n      }\n    } catch {\n      // try next\n    }\n  }\n  return '0.0.0-unknown'\n}\n\nexport function handleVersion(): VersionResponse {\n  return {\n    package: '@tangle-network/agent-eval',\n    version: readPackageVersion(),\n    wireVersion: WIRE_VERSION,\n    apiSurface: ['judge', 'listRubrics', 'version', 'feedback.ingest', 'traces.ingest'],\n  }\n}\n\n// ── Ingestion handlers (0.25.0) ─────────────────────────────────────\n\n/**\n * Pluggable stores the wire layer routes ingestion writes into. Both\n * are optional — when omitted, the corresponding endpoint returns 503.\n *\n * Production deployments wire a `FileSystemTraceStore` and\n * `FileSystemFeedbackTrajectoryStore` here. Tests substitute in-memory\n * stores.\n */\nexport interface IngestionStores {\n  traceStore?: TraceStore\n  feedbackStore?: FeedbackTrajectoryStore\n}\n\n/**\n * `POST /v1/traces/ingest` — accept a batch of `TraceEvent`s from the\n * production runtime. Best-effort: each event is appended independently;\n * one bad event does not poison the batch.\n *\n * Idempotency: the underlying store is append-only; consumers retrying\n * the same payload will get duplicate events. Consumers should\n * de-duplicate by `eventId` downstream — production traces frequently\n * land via at-least-once buses (Kafka, SQS) where dedup is unavoidable.\n */\nexport async function handleTracesIngest(\n  req: TracesIngestRequest,\n  stores: IngestionStores,\n): Promise<TracesIngestResponse> {\n  if (!stores.traceStore) {\n    throw new WireError(\n      'service_unavailable',\n      'No trace store configured on this server. Pass `traceStore` to `createApp`.',\n      503,\n    )\n  }\n  const errors: Array<{ eventId: string; message: string }> = []\n  let accepted = 0\n  for (const event of req.events) {\n    try {\n      // The wire `TraceEvent` is structurally identical to the internal one.\n      await stores.traceStore.appendEvent(event as InternalTraceEvent)\n      accepted++\n    } catch (err) {\n      errors.push({\n        eventId: event.eventId,\n        message: err instanceof Error ? err.message : String(err),\n      })\n    }\n  }\n  return { accepted, rejected: errors.length, errors }\n}\n\n/**\n * `POST /v1/feedback` — accept a single `FeedbackTrajectory` from the\n * production runtime. Idempotent on `id`: re-posting the same trajectory\n * replaces the prior record.\n */\nexport async function handleFeedbackIngest(\n  req: WireFeedbackTrajectory,\n  stores: IngestionStores,\n): Promise<FeedbackIngestResponse> {\n  if (!stores.feedbackStore) {\n    throw new WireError(\n      'service_unavailable',\n      'No feedback store configured on this server. Pass `feedbackStore` to `createApp`.',\n      503,\n    )\n  }\n  // The wire `FeedbackTrajectory` aligns 1:1 with the internal type;\n  // cast through `unknown` since the wire schema is a Zod-inferred\n  // structural type with optional fields the internal store consumes.\n  await stores.feedbackStore.save(req as unknown as Parameters<FeedbackTrajectoryStore['save']>[0])\n  return { id: req.id, persisted: true }\n}\n","/**\n * Build an OpenAPI spec from the wire schemas.\n *\n * The spec is the contract that other-language clients (Python, Rust,\n * Go, …) generate from. There is no hand-written client — clients are\n * derived artifacts of this file plus `schemas.ts`.\n *\n * Run `pnpm openapi` (defined in package.json) to write the spec to\n * `dist/openapi.json`. CI uses that file to regenerate the Python\n * client and gate the dual-publish workflow.\n */\nimport { OpenAPIRegistry, OpenApiGeneratorV31 } from '@asteasolutions/zod-to-openapi'\nimport type { OpenAPIObject } from 'openapi3-ts/oas31'\n\nimport {\n  ErrorResponseSchema,\n  FeedbackIngestResponseSchema,\n  FeedbackTrajectorySchema,\n  HealthResponseSchema,\n  JudgeRequestSchema,\n  JudgeResultSchema,\n  ListRubricsResponseSchema,\n  TracesIngestRequestSchema,\n  TracesIngestResponseSchema,\n  VersionResponseSchema,\n  WIRE_VERSION,\n} from './schemas'\n\nexport function buildOpenApi(packageVersion: string): OpenAPIObject {\n  const registry = new OpenAPIRegistry()\n\n  // Components — each schema becomes a $ref-able component\n  registry.register('JudgeRequest', JudgeRequestSchema)\n  registry.register('JudgeResult', JudgeResultSchema)\n  registry.register('ListRubricsResponse', ListRubricsResponseSchema)\n  registry.register('VersionResponse', VersionResponseSchema)\n  registry.register('HealthResponse', HealthResponseSchema)\n  registry.register('ErrorResponse', ErrorResponseSchema)\n  registry.register('TracesIngestRequest', TracesIngestRequestSchema)\n  registry.register('TracesIngestResponse', TracesIngestResponseSchema)\n  registry.register('FeedbackTrajectory', FeedbackTrajectorySchema)\n  registry.register('FeedbackIngestResponse', FeedbackIngestResponseSchema)\n\n  // Routes\n  registry.registerPath({\n    method: 'post',\n    path: '/v1/judge',\n    summary: 'Score a piece of content against a rubric',\n    description:\n      'Runs the judging LLM with the named (or inline) rubric and returns dimension scores, detected failure modes, wins, and a composite score in 0..1.',\n    request: {\n      body: {\n        content: {\n          'application/json': { schema: JudgeRequestSchema },\n        },\n      },\n    },\n    responses: {\n      200: {\n        description: 'Successful judgement',\n        content: { 'application/json': { schema: JudgeResultSchema } },\n      },\n      400: {\n        description: 'Validation error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      404: {\n        description: 'Rubric not found',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      500: {\n        description: 'Judge error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'get',\n    path: '/v1/rubrics',\n    summary: 'List built-in rubrics',\n    description:\n      'Returns every rubric registered server-side, with their dimensions and stable rubricVersion hash.',\n    responses: {\n      200: {\n        description: 'Listing',\n        content: { 'application/json': { schema: ListRubricsResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'get',\n    path: '/v1/version',\n    summary: 'Server and wire-protocol version',\n    description: 'Match your client version to `version`; check `wireVersion` for compatibility.',\n    responses: {\n      200: {\n        description: 'Version info',\n        content: { 'application/json': { schema: VersionResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'get',\n    path: '/healthz',\n    summary: 'Liveness check',\n    responses: {\n      200: {\n        description: 'OK',\n        content: { 'application/json': { schema: HealthResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'post',\n    path: '/v1/traces/ingest',\n    summary: 'Ingest a batch of production TraceEvents',\n    description:\n      'Append a batch of TraceEvents to the configured TraceStore. Accepts application/json ({events:[...]}) or application/x-ndjson (one event per line). Returns counts of accepted + rejected events.',\n    request: {\n      body: {\n        content: {\n          'application/json': { schema: TracesIngestRequestSchema },\n          'application/x-ndjson': { schema: TracesIngestRequestSchema },\n        },\n      },\n    },\n    responses: {\n      200: {\n        description: 'Ingestion summary',\n        content: { 'application/json': { schema: TracesIngestResponseSchema } },\n      },\n      400: {\n        description: 'Validation error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      401: {\n        description: 'Unauthorized (when bearer auth is configured)',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      503: {\n        description: 'No trace store configured',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'post',\n    path: '/v1/feedback',\n    summary: 'Ingest a FeedbackTrajectory from production',\n    description:\n      'Persist a single FeedbackTrajectory. Idempotent on trajectory.id — re-posting replaces the prior record. Used by production runtimes to forward user 👍/👎/edits into the eval substrate.',\n    request: {\n      body: {\n        content: {\n          'application/json': { schema: FeedbackTrajectorySchema },\n        },\n      },\n    },\n    responses: {\n      200: {\n        description: 'Persisted',\n        content: { 'application/json': { schema: FeedbackIngestResponseSchema } },\n      },\n      400: {\n        description: 'Validation error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      401: {\n        description: 'Unauthorized (when bearer auth is configured)',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      503: {\n        description: 'No feedback store configured',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n    },\n  })\n\n  const generator = new OpenApiGeneratorV31(registry.definitions)\n  const doc = generator.generateDocument({\n    openapi: '3.1.0',\n    info: {\n      title: '@tangle-network/agent-eval — wire protocol',\n      version: packageVersion,\n      description: `HTTP and stdio RPC interface to agent-eval. The TypeScript runtime is the source of truth; this spec is the contract that cross-language clients (Python, Rust, Go) generate from.\n\nWire-protocol version: ${WIRE_VERSION}. Bumps on breaking changes to request/response schemas.`,\n      contact: { name: 'Tangle Network', url: 'https://github.com/tangle-network/agent-eval' },\n      license: { name: 'MIT' },\n    },\n    servers: [{ url: 'http://localhost:5005', description: 'Local agent-eval serve' }],\n  })\n  const rubricRef = { $ref: '#/components/schemas/Rubric' } as const\n  const commonJudgeFields = {\n    content: { type: 'string', minLength: 1 },\n    context: { type: 'object', additionalProperties: true },\n    model: { type: 'string' },\n  } as const\n  doc.components ??= {}\n  doc.components.schemas ??= {}\n  doc.components.schemas.JudgeRequest = {\n    oneOf: [\n      {\n        type: 'object',\n        additionalProperties: false,\n        required: ['rubricName', 'content'],\n        properties: {\n          rubricName: { type: 'string', minLength: 1 },\n          ...commonJudgeFields,\n        },\n      },\n      {\n        type: 'object',\n        additionalProperties: false,\n        required: ['rubric', 'content'],\n        properties: {\n          rubric: rubricRef,\n          ...commonJudgeFields,\n        },\n      },\n    ],\n    description: 'Judge request. Provide exactly one of rubricName or rubric.',\n  }\n  return doc\n}\n","/**\n * stdio RPC transport.\n *\n * For batch / cron use without a running server. The Python client falls\n * back to this when no server is reachable.\n *\n * Protocol (line-delimited JSON over stdin/stdout):\n *   IN:  one JSON object on stdin: {\"method\":\"judge\",\"params\":{...}}\n *   OUT: one JSON object on stdout: {\"result\":{...}} or {\"error\":{...}}\n *\n * One request per process invocation. To pipeline many calls, the client\n * writes JSONL to stdin and reads JSONL from stdout — see batch mode below.\n */\nimport { handleJudge, handleListRubrics, handleVersion, WireError } from './handlers'\nimport { JudgeRequestSchema } from './schemas'\n\ninterface RpcRequest {\n  method: 'judge' | 'listRubrics' | 'version'\n  params?: unknown\n}\n\ninterface RpcSuccess {\n  result: unknown\n}\n\ninterface RpcError {\n  error: { code: string; message: string; details?: unknown }\n}\n\nexport async function dispatchRpc(req: RpcRequest): Promise<RpcSuccess | RpcError> {\n  try {\n    switch (req.method) {\n      case 'judge': {\n        const parsed = JudgeRequestSchema.safeParse(req.params)\n        if (!parsed.success) {\n          return {\n            error: {\n              code: 'validation_error',\n              message: 'params did not match JudgeRequest schema.',\n              details: parsed.error.issues,\n            },\n          }\n        }\n        return { result: await handleJudge(parsed.data) }\n      }\n      case 'listRubrics':\n        return { result: handleListRubrics() }\n      case 'version':\n        return { result: handleVersion() }\n      default:\n        return {\n          error: {\n            code: 'unknown_method',\n            message: `No such method: ${(req as { method: string }).method}`,\n          },\n        }\n    }\n  } catch (err) {\n    if (err instanceof WireError) {\n      return { error: { code: err.code, message: err.message, details: err.details } }\n    }\n    const message = err instanceof Error ? err.message : String(err)\n    return { error: { code: 'internal_error', message } }\n  }\n}\n\n// ── stdin/stdout driver ─────────────────────────────────────────────\n\nasync function readAll(stream: NodeJS.ReadableStream): Promise<string> {\n  const chunks: Buffer[] = []\n  for await (const chunk of stream) {\n    chunks.push(Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk as string))\n  }\n  return Buffer.concat(chunks).toString('utf-8')\n}\n\n/** Read one JSON request from stdin, write one JSON response to stdout. */\nexport async function runRpcOnce(method?: string): Promise<number> {\n  const raw = await readAll(process.stdin)\n  let req: RpcRequest\n  try {\n    const body = JSON.parse(raw)\n    req = method ? { method: method as RpcRequest['method'], params: body } : (body as RpcRequest)\n  } catch (err) {\n    process.stdout.write(\n      `${JSON.stringify({\n        error: {\n          code: 'parse_error',\n          message: `stdin was not valid JSON: ${err instanceof Error ? err.message : String(err)}`,\n        },\n      })}\\n`,\n    )\n    return 1\n  }\n  const out = await dispatchRpc(req)\n  process.stdout.write(`${JSON.stringify(out)}\\n`)\n  return 'error' in out ? 1 : 0\n}\n\n/** Read JSONL requests from stdin, write JSONL responses to stdout. */\nexport async function runRpcBatch(method?: string): Promise<number> {\n  const raw = await readAll(process.stdin)\n  const lines = raw.split('\\n').filter((l) => l.trim().length > 0)\n  let exitCode = 0\n  for (const line of lines) {\n    let req: RpcRequest\n    try {\n      const body = JSON.parse(line)\n      req = method ? { method: method as RpcRequest['method'], params: body } : (body as RpcRequest)\n    } catch (err) {\n      process.stdout.write(\n        `${JSON.stringify({\n          error: {\n            code: 'parse_error',\n            message: `line was not valid JSON: ${err instanceof Error ? err.message : String(err)}`,\n          },\n        })}\\n`,\n      )\n      exitCode = 1\n      continue\n    }\n    const out = await dispatchRpc(req)\n    process.stdout.write(`${JSON.stringify(out)}\\n`)\n    if ('error' in out) exitCode = 1\n  }\n  return exitCode\n}\n","/**\n * HTTP transport for the wire protocol.\n *\n * Hono + @hono/node-server. Every endpoint:\n *   1. Validates the request against its Zod schema.\n *   2. Calls the matching handler in `handlers.ts`.\n *   3. Renders 4xx for `WireError` with structured body, 500 for unexpected.\n *\n * The server holds optional `IngestionStores` (passed to `createApp`)\n * to receive production traces and user feedback. With no stores wired,\n * the ingestion endpoints return 503 — read endpoints (`/v1/judge`,\n * `/v1/rubrics`, `/v1/version`) remain fully functional.\n *\n * Run via `agent-eval serve --port 5005`.\n */\nimport { type ServerType, serve } from '@hono/node-server'\nimport { Hono } from 'hono'\nimport { cors } from 'hono/cors'\n\nimport {\n  handleFeedbackIngest,\n  handleJudge,\n  handleListRubrics,\n  handleTracesIngest,\n  handleVersion,\n  type IngestionStores,\n  WireError,\n} from './handlers'\nimport { buildOpenApi } from './openapi'\nimport { FeedbackTrajectorySchema, JudgeRequestSchema, TracesIngestRequestSchema } from './schemas'\n\nconst STARTED_AT = Date.now()\n\nexport interface CreateAppOptions {\n  /** Stores wired to the ingestion endpoints. */\n  stores?: IngestionStores\n  /**\n   * Bearer-token auth. When provided, every endpoint EXCEPT `/healthz`\n   * and `/v1/version` requires `Authorization: Bearer <token>`. The\n   * token may be a static string OR a function for time-bounded /\n   * rotating tokens.\n   *\n   * Recommended for any server that accepts ingestion writes from the\n   * public internet. Read-only deployments may omit it.\n   */\n  auth?: {\n    bearer: string | ((token: string) => boolean | Promise<boolean>)\n  }\n}\n\nconst AUTH_EXEMPT_PATHS = new Set(['/healthz', '/v1/version', '/openapi.json'])\n\nexport function createApp(opts: CreateAppOptions = {}) {\n  const app = new Hono()\n\n  app.use('*', cors())\n\n  // Bearer-token middleware (only attached when configured).\n  if (opts.auth) {\n    const verify = opts.auth.bearer\n    app.use('*', async (c, next) => {\n      const path = new URL(c.req.url).pathname\n      if (AUTH_EXEMPT_PATHS.has(path)) return next()\n      const raw = c.req.header('authorization') ?? ''\n      const match = raw.match(/^Bearer\\s+(.+)$/i)\n      if (!match) {\n        throw new WireError('unauthorized', 'Missing or malformed Authorization header.', 401)\n      }\n      const token = match[1] as string\n      const ok = typeof verify === 'string' ? token === verify : await verify(token)\n      if (!ok) {\n        throw new WireError('unauthorized', 'Invalid bearer token.', 401)\n      }\n      return next()\n    })\n  }\n\n  app.onError((err, c) => {\n    if (err instanceof WireError) {\n      const status = err.status as 400 | 401 | 404 | 422 | 500 | 503\n      return c.json(\n        { error: { code: err.code, message: err.message, details: err.details } },\n        status,\n      )\n    }\n    // Unexpected — log and return generic 500 without leaking internals.\n    console.error('[agent-eval] unhandled error:', err)\n    return c.json({ error: { code: 'internal_error', message: 'Internal server error.' } }, 500)\n  })\n\n  // ── Health ──\n  app.get('/healthz', (c) =>\n    c.json({ status: 'ok' as const, uptimeSec: (Date.now() - STARTED_AT) / 1000 }),\n  )\n\n  // ── Version ──\n  app.get('/v1/version', (c) => c.json(handleVersion()))\n\n  // ── Rubrics ──\n  app.get('/v1/rubrics', (c) => c.json(handleListRubrics()))\n\n  // ── Judge ──\n  app.post('/v1/judge', async (c) => {\n    const raw = await c.req.json().catch(() => null)\n    if (raw == null) {\n      throw new WireError('validation_error', 'Request body must be JSON.', 400)\n    }\n    const parsed = JudgeRequestSchema.safeParse(raw)\n    if (!parsed.success) {\n      throw new WireError(\n        'validation_error',\n        'Request did not match JudgeRequest schema.',\n        400,\n        parsed.error.issues,\n      )\n    }\n    const result = await handleJudge(parsed.data)\n    return c.json(result)\n  })\n\n  // ── Traces ingest (NDJSON-friendly: accepts either {events:[...]} or NDJSON) ──\n  app.post('/v1/traces/ingest', async (c) => {\n    const contentType = c.req.header('content-type') ?? ''\n    let payload: unknown\n    if (contentType.includes('application/x-ndjson')) {\n      const text = await c.req.text()\n      const events = text\n        .split('\\n')\n        .map((line) => line.trim())\n        .filter((line) => line.length > 0)\n        .map((line) => {\n          try {\n            return JSON.parse(line)\n          } catch {\n            throw new WireError(\n              'validation_error',\n              'NDJSON line did not parse as JSON.',\n              400,\n              line.slice(0, 200),\n            )\n          }\n        })\n      payload = { events }\n    } else {\n      payload = await c.req.json().catch(() => null)\n    }\n    if (payload == null) {\n      throw new WireError('validation_error', 'Request body must be JSON or NDJSON.', 400)\n    }\n    const parsed = TracesIngestRequestSchema.safeParse(payload)\n    if (!parsed.success) {\n      throw new WireError(\n        'validation_error',\n        'Request did not match TracesIngestRequest schema.',\n        400,\n        parsed.error.issues,\n      )\n    }\n    const result = await handleTracesIngest(parsed.data, opts.stores ?? {})\n    return c.json(result)\n  })\n\n  // ── Feedback ingest ──\n  app.post('/v1/feedback', async (c) => {\n    const raw = await c.req.json().catch(() => null)\n    if (raw == null) {\n      throw new WireError('validation_error', 'Request body must be JSON.', 400)\n    }\n    const parsed = FeedbackTrajectorySchema.safeParse(raw)\n    if (!parsed.success) {\n      throw new WireError(\n        'validation_error',\n        'Request did not match FeedbackTrajectory schema.',\n        400,\n        parsed.error.issues,\n      )\n    }\n    const result = await handleFeedbackIngest(parsed.data, opts.stores ?? {})\n    return c.json(result)\n  })\n\n  // ── OpenAPI spec ──\n  app.get('/openapi.json', (c) => c.json(buildOpenApi(handleVersion().version)))\n\n  return app\n}\n\nexport interface ServeOptions extends CreateAppOptions {\n  /** Default 5005. */\n  port?: number\n  /** Default '127.0.0.1'. Set to '0.0.0.0' to listen on all interfaces. */\n  host?: string\n}\n\nexport function startServer(opts: ServeOptions = {}): ServerType {\n  const app = createApp(opts)\n  const port = opts.port ?? 5005\n  const host = opts.host ?? '127.0.0.1'\n  return serve({ fetch: app.fetch, port, hostname: host }, ({ address, port: actualPort }) => {\n    // eslint-disable-next-line no-console\n    console.log(`[agent-eval] serving on http://${address}:${actualPort}`)\n  })\n}\n"],"mappings":";;;;;AAYA,SAAS,4BAA4B;AACrC,SAAS,SAAS;AAElB,qBAAqB,CAAC;AAIf,IAAM,wBAAwB,EAClC,OAAO;AAAA,EACN,IAAI,EACD,OAAO,EACP,IAAI,CAAC,EACL,SAAS,gFAA2E;AAAA,EACvF,aAAa,EACV,OAAO,EACP,IAAI,CAAC,EACL,SAAS,sEAAsE;AAAA,EAClF,QAAQ,EACL,OAAO,EACP,IAAI,CAAC,EACL,QAAQ,CAAC,EACT,SAAS,gEAAgE;AAAA,EAC5E,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,SAAS,gDAAgD;AAAA,EACpF,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,SAAS,gDAAgD;AACtF,CAAC,EACA,QAAQ,iBAAiB;AAErB,IAAM,oBAAoB,EAC9B,OAAO;AAAA,EACN,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS,mEAA8D;AAAA,EAC7F,aAAa,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS,mDAAmD;AAC7F,CAAC,EACA,QAAQ,aAAa;AAIjB,IAAM,eAAe,EACzB,OAAO;AAAA,EACN,MAAM,EACH,OAAO,EACP,IAAI,CAAC,EACL,SAAS,4EAAuE;AAAA,EACnF,aAAa,EACV,OAAO,EACP,IAAI,CAAC,EACL,SAAS,0DAA0D;AAAA,EACtE,cAAc,EACX,OAAO,EACP,IAAI,CAAC,EACL;AAAA,IACC;AAAA,EACF;AAAA,EACF,YAAY,EACT,MAAM,qBAAqB,EAC3B,IAAI,CAAC,EACL,SAAS,+DAA+D;AAAA,EAC3E,cAAc,EACX,MAAM,iBAAiB,EACvB,QAAQ,CAAC,CAAC,EACV,SAAS,iFAAiF;AAAA,EAC7F,MAAM,EACH,MAAM,iBAAiB,EACvB,QAAQ,CAAC,CAAC,EACV,SAAS,uEAAuE;AACrF,CAAC,EACA,QAAQ,QAAQ;AAIZ,IAAM,qBAAqB,EAC/B,OAAO;AAAA,EACN,YAAY,EACT,OAAO,EACP,SAAS,EACT,SAAS,kEAAkE;AAAA,EAC9E,QAAQ,aAAa,SAAS,EAAE;AAAA,IAC9B;AAAA,EACF;AAAA,EACA,SAAS,EACN,OAAO,EACP,IAAI,CAAC,EACL,SAAS,uFAAkF;AAAA,EAC9F,SAAS,EACN,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAC9B,SAAS,EACT;AAAA,IACC;AAAA,EACF;AAAA,EACF,OAAO,EACJ,OAAO,EACP,SAAS,EACT,SAAS,+EAA+E;AAC7F,CAAC,EACA,OAAO,CAAC,MAAM,QAAQ,EAAE,UAAU,MAAM,QAAQ,EAAE,MAAM,GAAG;AAAA,EAC1D,SAAS;AACX,CAAC,EACA,QAAQ,cAAc;AAElB,IAAM,oBAAoB,EAC9B,OAAO;AAAA,EACN,WAAW,EACR,OAAO,EACP,IAAI,CAAC,EACL,IAAI,CAAC,EACL,SAAS,iFAAiF;AAAA,EAC7F,YAAY,EACT,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,EAC7B,SAAS,mDAAmD;AAAA,EAC/D,cAAc,EACX,MAAM,EAAE,OAAO,CAAC,EAChB,QAAQ,CAAC,CAAC,EACV,SAAS,+EAA+E;AAAA,EAC3F,MAAM,EACH,MAAM,EAAE,OAAO,CAAC,EAChB,QAAQ,CAAC,CAAC,EACV,SAAS,8DAA8D;AAAA,EAC1E,WAAW,EACR,OAAO,EACP,SAAS,yEAAyE;AAAA,EACrF,eAAe,EACZ,OAAO,EACP;AAAA,IACC;AAAA,EACF;AAAA,EACF,OAAO,EAAE,OAAO,EAAE,SAAS,yDAAyD;AAAA,EACpF,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,qCAAqC;AAC3F,CAAC,EACA,QAAQ,aAAa;AAIjB,IAAM,mBAAmB,EAC7B,OAAO;AAAA,EACN,MAAM,EAAE,OAAO,EAAE,SAAS,yCAAyC;AAAA,EACnE,aAAa,EAAE,OAAO,EAAE,SAAS,4BAA4B;AAAA,EAC7D,YAAY,EACT,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,aAAa,EAAE,OAAO,GAAG,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,EAC/E,SAAS,kDAAkD;AAAA,EAC9D,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,SAAS,uCAAuC;AAAA,EAC9F,eAAe,EAAE,OAAO,EAAE,SAAS,8DAAyD;AAC9F,CAAC,EACA,QAAQ,YAAY;AAEhB,IAAM,4BAA4B,EACtC,OAAO;AAAA,EACN,SAAS,EAAE,MAAM,gBAAgB;AACnC,CAAC,EACA,QAAQ,qBAAqB;AAIzB,IAAM,wBAAwB,EAClC,OAAO;AAAA,EACN,SAAS,EAAE,OAAO,EAAE,SAAS,qDAAqD;AAAA,EAClF,SAAS,EAAE,OAAO,EAAE,SAAS,0DAA0D;AAAA,EACvF,aAAa,EACV,OAAO,EACP;AAAA,IACC;AAAA,EACF;AAAA,EACF,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,iCAAiC;AAC5E,CAAC,EACA,QAAQ,iBAAiB;AAErB,IAAM,uBAAuB,EACjC,OAAO;AAAA,EACN,QAAQ,EAAE,QAAQ,IAAI;AAAA,EACtB,WAAW,EAAE,OAAO;AACtB,CAAC,EACA,QAAQ,gBAAgB;AAUpB,IAAM,mBAAmB,EAC7B,OAAO;AAAA,EACN,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS,4CAA4C;AAAA,EAChF,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS,4BAA4B;AAAA,EAC9D,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,sCAAsC;AAAA,EAC7E,MAAM,EACH,KAAK;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC,EACA,SAAS,yEAAoE;AAAA,EAChF,WAAW,EACR,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,SAAS,kEAAkE;AAAA,EAC9E,SAAS,EACN,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAC9B,SAAS,sDAAiD;AAC/D,CAAC,EACA,QAAQ,YAAY;AAEhB,IAAM,4BAA4B,EACtC,OAAO;AAAA,EACN,QAAQ,EACL,MAAM,gBAAgB,EACtB,IAAI,CAAC,EACL,IAAI,GAAM,EACV,SAAS,4EAAuE;AACrF,CAAC,EACA,QAAQ,qBAAqB;AAEzB,IAAM,6BAA6B,EACvC,OAAO;AAAA,EACN,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,6BAA6B;AAAA,EAC/E,UAAU,EACP,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,SAAS,uEAAkE;AAAA,EAC9E,QAAQ,EACL;AAAA,IACC,EAAE,OAAO;AAAA,MACP,SAAS,EAAE,OAAO,EAAE,SAAS,iCAAiC;AAAA,MAC9D,SAAS,EAAE,OAAO,EAAE,SAAS,6BAA6B;AAAA,IAC5D,CAAC;AAAA,EACH,EACC,QAAQ,CAAC,CAAC;AACf,CAAC,EACA,QAAQ,sBAAsB;AAE1B,IAAM,sBAAsB,EAChC,OAAO;AAAA,EACN,IAAI,EAAE,OAAO,EAAE,SAAS;AAAA,EACxB,QAAQ,EAAE,KAAK,CAAC,QAAQ,SAAS,eAAe,UAAU,UAAU,QAAQ,CAAC;AAAA,EAC7E,MAAM,EAAE,KAAK;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAAA,EACD,OAAO,EAAE,QAAQ;AAAA,EACjB,QAAQ,EAAE,OAAO,EAAE,SAAS;AAAA,EAC5B,UAAU,EAAE,KAAK,CAAC,QAAQ,WAAW,SAAS,UAAU,CAAC,EAAE,SAAS;AAAA,EACpE,WAAW,EAAE,OAAO,EAAE,SAAS,eAAe;AAAA,EAC9C,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAAE,SAAS;AACvD,CAAC,EACA,QAAQ,eAAe;AAEnB,IAAM,wBAAwB,EAClC,OAAO;AAAA,EACN,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACxC,cAAc,EAAE,KAAK;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAAA,EACD,UAAU,EAAE,QAAQ;AAAA,EACpB,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EACvC,gBAAgB,EACb,OAAO;AAAA,IACN,MAAM,EAAE,OAAO;AAAA,IACf,MAAM,EAAE,KAAK,CAAC,OAAO,UAAU,MAAM,CAAC,EAAE,SAAS;AAAA,IACjD,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,IAC7B,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,IACzC,kBAAkB,EAAE,QAAQ,EAAE,SAAS;AAAA,IACvC,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EACvD,CAAC,EACA,SAAS;AAAA,EACZ,UAAU,EAAE,MAAM,mBAAmB,EAAE,SAAS;AAAA,EAChD,WAAW,EAAE,OAAO;AAAA,EACpB,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAAE,SAAS;AACvD,CAAC,EACA,QAAQ,iBAAiB;AAErB,IAAM,2BAA2B,EACrC,OAAO;AAAA,EACN,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS,gDAAgD;AAAA,EAC/E,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,YAAY,EAAE,OAAO,EAAE,SAAS;AAAA,EAChC,MAAM,EAAE,OAAO;AAAA,IACb,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,IACxB,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,EAChC,CAAC;AAAA,EACD,UAAU,EAAE,MAAM,qBAAqB,EAAE,QAAQ,CAAC,CAAC;AAAA,EACnD,QAAQ,EAAE,MAAM,mBAAmB,EAAE,QAAQ,CAAC,CAAC;AAAA,EAC/C,SAAS,EACN,OAAO;AAAA,IACN,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,IAC9B,OAAO,EAAE,OAAO,EAAE,SAAS;AAAA,IAC3B,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,IACnD,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,IAC7B,QAAQ,EAAE,OAAO,EAAE,SAAS;AAAA,IAC5B,YAAY,EAAE,OAAO,EAAE,SAAS;AAAA,IAChC,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EACvD,CAAC,EACA,SAAS;AAAA,EACZ,OAAO,EAAE,KAAK,CAAC,SAAS,OAAO,QAAQ,SAAS,CAAC,EAAE,SAAS;AAAA,EAC5D,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EAChD,WAAW,EAAE,OAAO,EAAE,SAAS,eAAe;AAAA,EAC9C,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAAE,SAAS;AACvD,CAAC,EACA,QAAQ,oBAAoB;AAExB,IAAM,+BAA+B,EACzC,OAAO;AAAA,EACN,IAAI,EAAE,OAAO,EAAE,SAAS,mCAAmC;AAAA,EAC3D,WAAW,EAAE,QAAQ,EAAE,SAAS,wDAAwD;AAC1F,CAAC,EACA,QAAQ,wBAAwB;AAU5B,IAAM,sBAAsB,EAChC,OAAO;AAAA,EACN,OAAO,EACJ,OAAO;AAAA,IACN,MAAM,EACH,OAAO,EACP;AAAA,MACC;AAAA,IACF;AAAA,IACF,SAAS,EAAE,OAAO,EAAE,SAAS,yBAAyB;AAAA,IACtD,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,6BAA6B;AAAA,EACxE,CAAC,EACA,SAAS,+DAA+D;AAC7E,CAAC,EACA,QAAQ,eAAe;AAoBnB,IAAM,eAAe;AAMrB,SAAS,WAAW,QAAwB;AACjD,QAAM,SAAS,gBAAgB,MAAM;AACrC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAK,IAAI,KAAM,OAAO,WAAW,CAAC;AAAA,EACpC;AAEA,SAAO,GAAG,OAAO,IAAI,KAAK,MAAM,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAClE;AAEA,SAAS,gBAAgB,OAAwB;AAC/C,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,IAAI,MAAM,IAAI,CAAC,SAAS,gBAAgB,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;AACzF,MAAI,SAAS,OAAO,UAAU,UAAU;AACtC,UAAM,UAAU,OAAO,QAAQ,KAAgC,EAC5D,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EACrC,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,UAAU,GAAG,CAAC,IAAI,gBAAgB,IAAI,CAAC,EAAE;AACzE,WAAO,IAAI,QAAQ,KAAK,GAAG,CAAC;AAAA,EAC9B;AACA,SAAO,KAAK,UAAU,KAAK;AAC7B;;;ACjYA,IAAM,YAAoB;AAAA,EACxB,MAAM;AAAA,EACN,aACE;AAAA,EACF,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBd,YAAY;AAAA,IACV;AAAA,MACE,IAAI;AAAA,MACJ,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,EACF;AAAA,EACA,cAAc;AAAA,IACZ,EAAE,IAAI,cAAc,aAAa,qCAAqC;AAAA,IACtE,EAAE,IAAI,kBAAkB,aAAa,sCAAsC;AAAA,IAC3E,EAAE,IAAI,eAAe,aAAa,oCAAoC;AAAA,IACtE,EAAE,IAAI,WAAW,aAAa,kCAAkC;AAAA,IAChE,EAAE,IAAI,mBAAmB,aAAa,qCAAqC;AAAA,IAC3E,EAAE,IAAI,WAAW,aAAa,oCAAoC;AAAA,IAClE,EAAE,IAAI,eAAe,aAAa,uCAAuC;AAAA,EAC3E;AAAA,EACA,MAAM;AAAA,IACJ,EAAE,IAAI,sBAAsB,aAAa,qCAAqC;AAAA,IAC9E,EAAE,IAAI,iBAAiB,aAAa,4BAA4B;AAAA,IAChE,EAAE,IAAI,0BAA0B,aAAa,wBAAwB;AAAA,IACrE,EAAE,IAAI,kBAAkB,aAAa,oCAAoC;AAAA,EAC3E;AACF;AAIO,IAAM,kBAA0C;AAAA,EACrD,aAAa;AACf;AAGO,SAAS,iBAAiB,MAAkC;AACjE,SAAO,gBAAgB,IAAI;AAC7B;AAGO,SAAS,qBAAqB;AACnC,SAAO,OAAO,OAAO,eAAe,EAAE,IAAI,CAAC,OAAO;AAAA,IAChD,MAAM,EAAE;AAAA,IACR,aAAa,EAAE;AAAA,IACf,YAAY,EAAE,WAAW,IAAI,CAAC,OAAO;AAAA,MACnC,IAAI,EAAE;AAAA,MACN,aAAa,EAAE;AAAA,MACf,QAAQ,EAAE;AAAA,IACZ,EAAE;AAAA,IACF,cAAc,EAAE,aAAa,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,IAC5C,eAAe,WAAW,CAAC;AAAA,EAC7B,EAAE;AACJ;;;ACwHA,SAAS,oBAAoB;AAC7B,SAAS,SAAS,eAAe;AACjC,SAAS,qBAAqB;AA9MvB,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACkB,MAChB,SACgB,SAAiB,KACjB,SAChB;AACA,UAAM,OAAO;AALG;AAEA;AACA;AAGhB,SAAK,OAAO;AAAA,EACd;AAAA,EAPkB;AAAA,EAEA;AAAA,EACA;AAKpB;AAKA,SAAS,kBAAkB,QAAgB;AACzC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,QAAQ;AAAA,MACN,MAAM;AAAA,MACN,sBAAsB;AAAA,MACtB,YAAY;AAAA,QACV,YAAY;AAAA,UACV,MAAM;AAAA,UACN,sBAAsB;AAAA,UACtB,YAAY,OAAO;AAAA,YACjB,OAAO,WAAW,IAAI,CAAC,MAAM;AAAA,cAC3B,EAAE;AAAA,cACF,EAAE,MAAM,UAAU,SAAS,EAAE,KAAK,SAAS,EAAE,IAAI;AAAA,YACnD,CAAC;AAAA,UACH;AAAA,UACA,UAAU,OAAO,WAAW,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,QAC7C;AAAA,QACA,cAAc;AAAA,UACZ,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,UAAU,MAAM,OAAO,aAAa,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE;AAAA,QACtE;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,UAAU,MAAM,OAAO,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE;AAAA,QAC9D;AAAA,QACA,WAAW,EAAE,MAAM,SAAS;AAAA,MAC9B;AAAA,MACA,UAAU,CAAC,cAAc,WAAW;AAAA,IACtC;AAAA,EACF;AACF;AASA,SAAS,oBAAoB,OAAgB,QAA6B;AACxE,MAAI,CAAC,SAAS,OAAO,UAAU,UAAU;AACvC,UAAM,IAAI,UAAU,eAAe,oCAAoC,KAAK,KAAK;AAAA,EACnF;AACA,QAAM,MAAM;AACZ,QAAM,gBAAgB,IAAI;AAC1B,MAAI,CAAC,iBAAiB,OAAO,kBAAkB,YAAY,MAAM,QAAQ,aAAa,GAAG;AACvF,UAAM,IAAI,UAAU,eAAe,wCAAwC,KAAK,KAAK;AAAA,EACvF;AAEA,QAAM,aAAqC,CAAC;AAC5C,QAAM,kBAAkB;AACxB,aAAW,OAAO,OAAO,YAAY;AACnC,UAAM,QAAQ,gBAAgB,IAAI,EAAE;AACpC,QACE,OAAO,UAAU,YACjB,CAAC,OAAO,SAAS,KAAK,KACtB,QAAQ,IAAI,OACZ,QAAQ,IAAI,KACZ;AACA,YAAM,IAAI;AAAA,QACR;AAAA,QACA,+CAA+C,IAAI,EAAE;AAAA,QACrD;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,eAAW,IAAI,EAAE,IAAI;AAAA,EACvB;AAEA,QAAM,kBAAkB,IAAI,IAAI,OAAO,aAAa,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AAC1E,QAAM,cAAc,IAAI,IAAI,OAAO,KAAK,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;AAC5D,QAAM,eAAe,gBAAgB,IAAI,cAAc,iBAAiB,gBAAgB,KAAK;AAC7F,QAAM,OAAO,gBAAgB,IAAI,MAAM,aAAa,QAAQ,KAAK;AACjE,MAAI,OAAO,IAAI,cAAc,YAAY,IAAI,UAAU,KAAK,EAAE,WAAW,GAAG;AAC1E,UAAM,IAAI,UAAU,eAAe,qCAAqC,KAAK,KAAK;AAAA,EACpF;AAEA,SAAO,EAAE,YAAY,cAAc,MAAM,WAAW,IAAI,UAAU;AACpE;AAEA,SAAS,gBACP,KACA,SACA,OACA,UACU;AACV,MAAI,QAAQ,OAAW,QAAO,CAAC;AAC/B,MAAI,CAAC,MAAM,QAAQ,GAAG,GAAG;AACvB,UAAM,IAAI,UAAU,eAAe,4BAA4B,KAAK,KAAK,KAAK,QAAQ;AAAA,EACxF;AACA,QAAM,MAAgB,CAAC;AACvB,aAAW,QAAQ,KAAK;AACtB,QAAI,OAAO,SAAS,YAAY,CAAC,QAAQ,IAAI,IAAI,GAAG;AAClD,YAAM,IAAI;AAAA,QACR;AAAA,QACA,0BAA0B,KAAK,QAAQ,OAAO,IAAI,CAAC;AAAA,QACnD;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,IAAI;AAAA,EACf;AACA,SAAO;AACT;AAEA,SAAS,eAAe,YAAoC,QAAwB;AAClF,MAAI,WAAW;AACf,MAAI,cAAc;AAClB,aAAW,OAAO,OAAO,YAAY;AACnC,UAAM,MAAM,WAAW,IAAI,EAAE,KAAK;AAClC,UAAM,QAAQ,IAAI,MAAM,IAAI,OAAO;AACnC,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK,CAAC;AACnE,gBAAY,aAAa,IAAI;AAC7B,mBAAe,IAAI;AAAA,EACrB;AACA,SAAO,cAAc,IAAI,WAAW,cAAc;AACpD;AAEA,SAAS,iBAAiB,SAAiB,SAA0B;AACnE,QAAM,MAAM,WAAW,OAAO,KAAK,OAAiB,EAAE,SAAS,KAAK,UAAU,OAAO,IAAI;AACzF,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,yCAAyC;AAAA,IAC/C,MAAM,MAAM;AAAA,EACd,EACG,OAAO,OAAO,EACd,KAAK,IAAI;AACd;AAEA,IAAM,sBAAsB;AAE5B,eAAsB,YAAY,KAAyC;AAEzE,MAAI;AACJ,MAAI,IAAI,YAAY;AAClB,UAAM,QAAQ,iBAAiB,IAAI,UAAU;AAC7C,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,UAAU,oBAAoB,6BAA6B,IAAI,UAAU,MAAM,GAAG;AAAA,IAC9F;AACA,aAAS;AAAA,EACX,WAAW,IAAI,QAAQ;AACrB,aAAS,IAAI;AAAA,EACf,OAAO;AAEL,UAAM,IAAI,UAAU,oBAAoB,4CAA4C,GAAG;AAAA,EACzF;AAEA,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,QAAQ,IAAI,SAAS;AAE3B,QAAM,EAAE,OAAO,OAAO,IAAI,MAAM,YAAyB;AAAA,IACvD;AAAA,IACA,UAAU;AAAA,MACR,EAAE,MAAM,UAAU,SAAS,OAAO,aAAa;AAAA,MAC/C,EAAE,MAAM,QAAQ,SAAS,iBAAiB,IAAI,SAAS,IAAI,OAAO,EAAE;AAAA,IACtE;AAAA,IACA,YAAY,kBAAkB,MAAM;AAAA,IACpC,aAAa;AAAA,IACb,WAAW;AAAA,EACb,CAAC;AAED,QAAM,SAAS,oBAAoB,OAAO,MAAM;AAEhD,QAAM,YAAY,eAAe,OAAO,YAAY,MAAM;AAC1D,QAAM,aAAa,KAAK,IAAI,IAAI;AAEhC,SAAO;AAAA,IACL;AAAA,IACA,YAAY,OAAO;AAAA,IACnB,cAAc,OAAO,gBAAgB,CAAC;AAAA,IACtC,MAAM,OAAO,QAAQ,CAAC;AAAA,IACtB,WAAW,OAAO;AAAA,IAClB,eAAe,WAAW,MAAM;AAAA,IAChC,OAAO,OAAO;AAAA,IACd;AAAA,EACF;AACF;AAIO,SAAS,oBAAyC;AACvD,SAAO,EAAE,SAAS,mBAAmB,EAAE;AACzC;AAQA,IAAI;AAEJ,SAAS,qBAA6B;AACpC,MAAI,eAAgB,QAAO;AAG3B,QAAM,OAAO,QAAQ,cAAc,YAAY,GAAG,CAAC;AACnD,QAAM,aAAa;AAAA,IACjB,QAAQ,MAAM,MAAM,MAAM,cAAc;AAAA;AAAA,IACxC,QAAQ,MAAM,MAAM,cAAc;AAAA;AAAA,EACpC;AACA,aAAW,QAAQ,YAAY;AAC7B,QAAI;AACF,YAAM,MAAM,KAAK,MAAM,aAAa,MAAM,OAAO,CAAC;AAClD,UAAI,IAAI,SAAS;AACf,yBAAiB,IAAI;AACrB,eAAO,IAAI;AAAA,MACb;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,gBAAiC;AAC/C,SAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS,mBAAmB;AAAA,IAC5B,aAAa;AAAA,IACb,YAAY,CAAC,SAAS,eAAe,WAAW,mBAAmB,eAAe;AAAA,EACpF;AACF;AA2BA,eAAsB,mBACpB,KACA,QAC+B;AAC/B,MAAI,CAAC,OAAO,YAAY;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAsD,CAAC;AAC7D,MAAI,WAAW;AACf,aAAW,SAAS,IAAI,QAAQ;AAC9B,QAAI;AAEF,YAAM,OAAO,WAAW,YAAY,KAA2B;AAC/D;AAAA,IACF,SAAS,KAAK;AACZ,aAAO,KAAK;AAAA,QACV,SAAS,MAAM;AAAA,QACf,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,MAC1D,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,EAAE,UAAU,UAAU,OAAO,QAAQ,OAAO;AACrD;AAOA,eAAsB,qBACpB,KACA,QACiC;AACjC,MAAI,CAAC,OAAO,eAAe;AACzB,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAIA,QAAM,OAAO,cAAc,KAAK,GAAgE;AAChG,SAAO,EAAE,IAAI,IAAI,IAAI,WAAW,KAAK;AACvC;;;AChVA,SAAS,iBAAiB,2BAA2B;AAiB9C,SAAS,aAAa,gBAAuC;AAClE,QAAM,WAAW,IAAI,gBAAgB;AAGrC,WAAS,SAAS,gBAAgB,kBAAkB;AACpD,WAAS,SAAS,eAAe,iBAAiB;AAClD,WAAS,SAAS,uBAAuB,yBAAyB;AAClE,WAAS,SAAS,mBAAmB,qBAAqB;AAC1D,WAAS,SAAS,kBAAkB,oBAAoB;AACxD,WAAS,SAAS,iBAAiB,mBAAmB;AACtD,WAAS,SAAS,uBAAuB,yBAAyB;AAClE,WAAS,SAAS,wBAAwB,0BAA0B;AACpE,WAAS,SAAS,sBAAsB,wBAAwB;AAChE,WAAS,SAAS,0BAA0B,4BAA4B;AAGxE,WAAS,aAAa;AAAA,IACpB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,SAAS;AAAA,IACT,aACE;AAAA,IACF,SAAS;AAAA,MACP,MAAM;AAAA,QACJ,SAAS;AAAA,UACP,oBAAoB,EAAE,QAAQ,mBAAmB;AAAA,QACnD;AAAA,MACF;AAAA,IACF;AAAA,IACA,WAAW;AAAA,MACT,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,kBAAkB,EAAE;AAAA,MAC/D;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,IACF;AAAA,EACF,CAAC;AAED,WAAS,aAAa;AAAA,IACpB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,SAAS;AAAA,IACT,aACE;AAAA,IACF,WAAW;AAAA,MACT,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,0BAA0B,EAAE;AAAA,MACvE;AAAA,IACF;AAAA,EACF,CAAC;AAED,WAAS,aAAa;AAAA,IACpB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,SAAS;AAAA,IACT,aAAa;AAAA,IACb,WAAW;AAAA,MACT,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,sBAAsB,EAAE;AAAA,MACnE;AAAA,IACF;AAAA,EACF,CAAC;AAED,WAAS,aAAa;AAAA,IACpB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,SAAS;AAAA,IACT,WAAW;AAAA,MACT,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,qBAAqB,EAAE;AAAA,MAClE;AAAA,IACF;AAAA,EACF,CAAC;AAED,WAAS,aAAa;AAAA,IACpB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,SAAS;AAAA,IACT,aACE;AAAA,IACF,SAAS;AAAA,MACP,MAAM;AAAA,QACJ,SAAS;AAAA,UACP,oBAAoB,EAAE,QAAQ,0BAA0B;AAAA,UACxD,wBAAwB,EAAE,QAAQ,0BAA0B;AAAA,QAC9D;AAAA,MACF;AAAA,IACF;AAAA,IACA,WAAW;AAAA,MACT,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,2BAA2B,EAAE;AAAA,MACxE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,IACF;AAAA,EACF,CAAC;AAED,WAAS,aAAa;AAAA,IACpB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,SAAS;AAAA,IACT,aACE;AAAA,IACF,SAAS;AAAA,MACP,MAAM;AAAA,QACJ,SAAS;AAAA,UACP,oBAAoB,EAAE,QAAQ,yBAAyB;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAAA,IACA,WAAW;AAAA,MACT,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,6BAA6B,EAAE;AAAA,MAC1E;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,MACA,KAAK;AAAA,QACH,aAAa;AAAA,QACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;AAAA,MACjE;AAAA,IACF;AAAA,EACF,CAAC;AAED,QAAM,YAAY,IAAI,oBAAoB,SAAS,WAAW;AAC9D,QAAM,MAAM,UAAU,iBAAiB;AAAA,IACrC,SAAS;AAAA,IACT,MAAM;AAAA,MACJ,OAAO;AAAA,MACP,SAAS;AAAA,MACT,aAAa;AAAA;AAAA,yBAEM,YAAY;AAAA,MAC/B,SAAS,EAAE,MAAM,kBAAkB,KAAK,+CAA+C;AAAA,MACvF,SAAS,EAAE,MAAM,MAAM;AAAA,IACzB;AAAA,IACA,SAAS,CAAC,EAAE,KAAK,yBAAyB,aAAa,yBAAyB,CAAC;AAAA,EACnF,CAAC;AACD,QAAM,YAAY,EAAE,MAAM,8BAA8B;AACxD,QAAM,oBAAoB;AAAA,IACxB,SAAS,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,IACxC,SAAS,EAAE,MAAM,UAAU,sBAAsB,KAAK;AAAA,IACtD,OAAO,EAAE,MAAM,SAAS;AAAA,EAC1B;AACA,MAAI,eAAe,CAAC;AACpB,MAAI,WAAW,YAAY,CAAC;AAC5B,MAAI,WAAW,QAAQ,eAAe;AAAA,IACpC,OAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,sBAAsB;AAAA,QACtB,UAAU,CAAC,cAAc,SAAS;AAAA,QAClC,YAAY;AAAA,UACV,YAAY,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,UAC3C,GAAG;AAAA,QACL;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,sBAAsB;AAAA,QACtB,UAAU,CAAC,UAAU,SAAS;AAAA,QAC9B,YAAY;AAAA,UACV,QAAQ;AAAA,UACR,GAAG;AAAA,QACL;AAAA,MACF;AAAA,IACF;AAAA,IACA,aAAa;AAAA,EACf;AACA,SAAO;AACT;;;ACxMA,eAAsB,YAAY,KAAiD;AACjF,MAAI;AACF,YAAQ,IAAI,QAAQ;AAAA,MAClB,KAAK,SAAS;AACZ,cAAM,SAAS,mBAAmB,UAAU,IAAI,MAAM;AACtD,YAAI,CAAC,OAAO,SAAS;AACnB,iBAAO;AAAA,YACL,OAAO;AAAA,cACL,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS,OAAO,MAAM;AAAA,YACxB;AAAA,UACF;AAAA,QACF;AACA,eAAO,EAAE,QAAQ,MAAM,YAAY,OAAO,IAAI,EAAE;AAAA,MAClD;AAAA,MACA,KAAK;AACH,eAAO,EAAE,QAAQ,kBAAkB,EAAE;AAAA,MACvC,KAAK;AACH,eAAO,EAAE,QAAQ,cAAc,EAAE;AAAA,MACnC;AACE,eAAO;AAAA,UACL,OAAO;AAAA,YACL,MAAM;AAAA,YACN,SAAS,mBAAoB,IAA2B,MAAM;AAAA,UAChE;AAAA,QACF;AAAA,IACJ;AAAA,EACF,SAAS,KAAK;AACZ,QAAI,eAAe,WAAW;AAC5B,aAAO,EAAE,OAAO,EAAE,MAAM,IAAI,MAAM,SAAS,IAAI,SAAS,SAAS,IAAI,QAAQ,EAAE;AAAA,IACjF;AACA,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,QAAQ,EAAE;AAAA,EACtD;AACF;AAIA,eAAe,QAAQ,QAAgD;AACrE,QAAM,SAAmB,CAAC;AAC1B,mBAAiB,SAAS,QAAQ;AAChC,WAAO,KAAK,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK,KAAe,CAAC;AAAA,EAC3E;AACA,SAAO,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAC/C;AAGA,eAAsB,WAAW,QAAkC;AACjE,QAAM,MAAM,MAAM,QAAQ,QAAQ,KAAK;AACvC,MAAI;AACJ,MAAI;AACF,UAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,UAAM,SAAS,EAAE,QAAwC,QAAQ,KAAK,IAAK;AAAA,EAC7E,SAAS,KAAK;AACZ,YAAQ,OAAO;AAAA,MACb,GAAG,KAAK,UAAU;AAAA,QAChB,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,6BAA6B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,QACxF;AAAA,MACF,CAAC,CAAC;AAAA;AAAA,IACJ;AACA,WAAO;AAAA,EACT;AACA,QAAM,MAAM,MAAM,YAAY,GAAG;AACjC,UAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,GAAG,CAAC;AAAA,CAAI;AAC/C,SAAO,WAAW,MAAM,IAAI;AAC9B;AAGA,eAAsB,YAAY,QAAkC;AAClE,QAAM,MAAM,MAAM,QAAQ,QAAQ,KAAK;AACvC,QAAM,QAAQ,IAAI,MAAM,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC;AAC/D,MAAI,WAAW;AACf,aAAW,QAAQ,OAAO;AACxB,QAAI;AACJ,QAAI;AACF,YAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,YAAM,SAAS,EAAE,QAAwC,QAAQ,KAAK,IAAK;AAAA,IAC7E,SAAS,KAAK;AACZ,cAAQ,OAAO;AAAA,QACb,GAAG,KAAK,UAAU;AAAA,UAChB,OAAO;AAAA,YACL,MAAM;AAAA,YACN,SAAS,4BAA4B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,UACvF;AAAA,QACF,CAAC,CAAC;AAAA;AAAA,MACJ;AACA,iBAAW;AACX;AAAA,IACF;AACA,UAAM,MAAM,MAAM,YAAY,GAAG;AACjC,YAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,GAAG,CAAC;AAAA,CAAI;AAC/C,QAAI,WAAW,IAAK,YAAW;AAAA,EACjC;AACA,SAAO;AACT;;;AC/GA,SAA0B,aAAa;AACvC,SAAS,YAAY;AACrB,SAAS,YAAY;AAcrB,IAAM,aAAa,KAAK,IAAI;AAmB5B,IAAM,oBAAoB,oBAAI,IAAI,CAAC,YAAY,eAAe,eAAe,CAAC;AAEvE,SAAS,UAAU,OAAyB,CAAC,GAAG;AACrD,QAAM,MAAM,IAAI,KAAK;AAErB,MAAI,IAAI,KAAK,KAAK,CAAC;AAGnB,MAAI,KAAK,MAAM;AACb,UAAM,SAAS,KAAK,KAAK;AACzB,QAAI,IAAI,KAAK,OAAO,GAAG,SAAS;AAC9B,YAAM,OAAO,IAAI,IAAI,EAAE,IAAI,GAAG,EAAE;AAChC,UAAI,kBAAkB,IAAI,IAAI,EAAG,QAAO,KAAK;AAC7C,YAAM,MAAM,EAAE,IAAI,OAAO,eAAe,KAAK;AAC7C,YAAM,QAAQ,IAAI,MAAM,kBAAkB;AAC1C,UAAI,CAAC,OAAO;AACV,cAAM,IAAI,UAAU,gBAAgB,8CAA8C,GAAG;AAAA,MACvF;AACA,YAAM,QAAQ,MAAM,CAAC;AACrB,YAAM,KAAK,OAAO,WAAW,WAAW,UAAU,SAAS,MAAM,OAAO,KAAK;AAC7E,UAAI,CAAC,IAAI;AACP,cAAM,IAAI,UAAU,gBAAgB,yBAAyB,GAAG;AAAA,MAClE;AACA,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AAEA,MAAI,QAAQ,CAAC,KAAK,MAAM;AACtB,QAAI,eAAe,WAAW;AAC5B,YAAM,SAAS,IAAI;AACnB,aAAO,EAAE;AAAA,QACP,EAAE,OAAO,EAAE,MAAM,IAAI,MAAM,SAAS,IAAI,SAAS,SAAS,IAAI,QAAQ,EAAE;AAAA,QACxE;AAAA,MACF;AAAA,IACF;AAEA,YAAQ,MAAM,iCAAiC,GAAG;AAClD,WAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,SAAS,yBAAyB,EAAE,GAAG,GAAG;AAAA,EAC7F,CAAC;AAGD,MAAI;AAAA,IAAI;AAAA,IAAY,CAAC,MACnB,EAAE,KAAK,EAAE,QAAQ,MAAe,YAAY,KAAK,IAAI,IAAI,cAAc,IAAK,CAAC;AAAA,EAC/E;AAGA,MAAI,IAAI,eAAe,CAAC,MAAM,EAAE,KAAK,cAAc,CAAC,CAAC;AAGrD,MAAI,IAAI,eAAe,CAAC,MAAM,EAAE,KAAK,kBAAkB,CAAC,CAAC;AAGzD,MAAI,KAAK,aAAa,OAAO,MAAM;AACjC,UAAM,MAAM,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI;AAC/C,QAAI,OAAO,MAAM;AACf,YAAM,IAAI,UAAU,oBAAoB,8BAA8B,GAAG;AAAA,IAC3E;AACA,UAAM,SAAS,mBAAmB,UAAU,GAAG;AAC/C,QAAI,CAAC,OAAO,SAAS;AACnB,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,MAAM;AAAA,MACf;AAAA,IACF;AACA,UAAM,SAAS,MAAM,YAAY,OAAO,IAAI;AAC5C,WAAO,EAAE,KAAK,MAAM;AAAA,EACtB,CAAC;AAGD,MAAI,KAAK,qBAAqB,OAAO,MAAM;AACzC,UAAM,cAAc,EAAE,IAAI,OAAO,cAAc,KAAK;AACpD,QAAI;AACJ,QAAI,YAAY,SAAS,sBAAsB,GAAG;AAChD,YAAM,OAAO,MAAM,EAAE,IAAI,KAAK;AAC9B,YAAM,SAAS,KACZ,MAAM,IAAI,EACV,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAChC,IAAI,CAAC,SAAS;AACb,YAAI;AACF,iBAAO,KAAK,MAAM,IAAI;AAAA,QACxB,QAAQ;AACN,gBAAM,IAAI;AAAA,YACR;AAAA,YACA;AAAA,YACA;AAAA,YACA,KAAK,MAAM,GAAG,GAAG;AAAA,UACnB;AAAA,QACF;AAAA,MACF,CAAC;AACH,gBAAU,EAAE,OAAO;AAAA,IACrB,OAAO;AACL,gBAAU,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI;AAAA,IAC/C;AACA,QAAI,WAAW,MAAM;AACnB,YAAM,IAAI,UAAU,oBAAoB,wCAAwC,GAAG;AAAA,IACrF;AACA,UAAM,SAAS,0BAA0B,UAAU,OAAO;AAC1D,QAAI,CAAC,OAAO,SAAS;AACnB,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,MAAM;AAAA,MACf;AAAA,IACF;AACA,UAAM,SAAS,MAAM,mBAAmB,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC;AACtE,WAAO,EAAE,KAAK,MAAM;AAAA,EACtB,CAAC;AAGD,MAAI,KAAK,gBAAgB,OAAO,MAAM;AACpC,UAAM,MAAM,MAAM,EAAE,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI;AAC/C,QAAI,OAAO,MAAM;AACf,YAAM,IAAI,UAAU,oBAAoB,8BAA8B,GAAG;AAAA,IAC3E;AACA,UAAM,SAAS,yBAAyB,UAAU,GAAG;AACrD,QAAI,CAAC,OAAO,SAAS;AACnB,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,MAAM;AAAA,MACf;AAAA,IACF;AACA,UAAM,SAAS,MAAM,qBAAqB,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC;AACxE,WAAO,EAAE,KAAK,MAAM;AAAA,EACtB,CAAC;AAGD,MAAI,IAAI,iBAAiB,CAAC,MAAM,EAAE,KAAK,aAAa,cAAc,EAAE,OAAO,CAAC,CAAC;AAE7E,SAAO;AACT;AASO,SAAS,YAAY,OAAqB,CAAC,GAAe;AAC/D,QAAM,MAAM,UAAU,IAAI;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,SAAO,MAAM,EAAE,OAAO,IAAI,OAAO,MAAM,UAAU,KAAK,GAAG,CAAC,EAAE,SAAS,MAAM,WAAW,MAAM;AAE1F,YAAQ,IAAI,kCAAkC,OAAO,IAAI,UAAU,EAAE;AAAA,EACvE,CAAC;AACH;","names":[]}