@tangle-network/agent-eval 0.126.7 → 0.127.0

package/dist/chunk-PJQFMIOX.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/statistics.ts","../src/judge-calibration.ts"],"sourcesContent":["import { ValidationError } from './errors'\nimport {\n  type ContinuousAgreement,\n  type ContinuousAgreementOptions,\n  continuousAgreement,\n} from './judge-calibration'\nimport type { JudgeScore } from './types'\n\n/** Identity: dimensions already follow \"higher = better\" by prompt convention\n *  (inverted dims like hallucination are scored 10 = best at the source). */\nexport const normalizeScores = (scores: JudgeScore[]): JudgeScore[] => scores\n\n/** Weighted mean — falls back to uniform weights when omitted */\nexport function weightedMean(scores: { score: number; weight?: number }[]): number {\n  if (scores.length === 0) return 0\n  let totalWeight = 0\n  let weightedSum = 0\n  for (const { score, weight } of scores) {\n    const w = weight ?? 1\n    weightedSum += score * w\n    totalWeight += w\n  }\n  return totalWeight > 0 ? weightedSum / totalWeight : 0\n}\n\n/** Bootstrap confidence interval */\nexport function confidenceInterval(\n  scores: number[],\n  confidence = 0.95,\n  opts: { seed?: number; resamples?: number } = {},\n): { mean: number; lower: number; upper: number } {\n  if (scores.length === 0) return { mean: 0, lower: 0, upper: 0 }\n  if (scores.length === 1) return { mean: scores[0]!, lower: scores[0]!, upper: scores[0]! }\n\n  const n = scores.length\n  const mean = scores.reduce((a, b) => a + b, 0) / n\n\n  const B = opts.resamples ?? 1000\n  const rng = makeRng(opts.seed)\n  const bootstrapMeans: number[] = []\n\n  for (let i = 0; i < B; i++) {\n    let sum = 0\n    for (let j = 0; j < n; j++) {\n      sum += scores[Math.floor(rng() * n)]!\n    }\n    bootstrapMeans.push(sum / n)\n  }\n\n  bootstrapMeans.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowerIdx = Math.floor((alpha / 2) * B)\n  const upperIdx = Math.floor((1 - alpha / 2) * B) - 1\n\n  return {\n    mean,\n    lower: bootstrapMeans[lowerIdx]!,\n    upper: bootstrapMeans[Math.min(upperIdx, B - 1)]!,\n  }\n}\n\n/**\n * Inter-rater reliability — simplified Krippendorff's alpha.\n *\n * Each inner array is one judge's scores for all items.\n * All arrays must have the same length (same items scored).\n */\nexport function interRaterReliability(judgeScores: JudgeScore[][]): number {\n  if (judgeScores.length < 2) return 1\n\n  // Group scores by dimension across judges\n  const dimensionMap = new Map<string, number[][]>()\n  for (const judgeSet of judgeScores) {\n    for (const s of judgeSet) {\n      if (!dimensionMap.has(s.dimension)) dimensionMap.set(s.dimension, [])\n      const arr = dimensionMap.get(s.dimension)!\n      if (arr.length === 0 || arr[arr.length - 1]!.length >= judgeScores.length) {\n        arr.push([s.score])\n      } else {\n        arr[arr.length - 1]!.push(s.score)\n      }\n    }\n  }\n\n  // Collect all paired ratings\n  const allValues: number[] = []\n  const pairDiffs: number[] = []\n\n  for (const items of dimensionMap.values()) {\n    for (const ratings of items) {\n      if (ratings.length < 2) continue\n      for (const v of ratings) allValues.push(v)\n      for (let i = 0; i < ratings.length; i++) {\n        for (let j = i + 1; j < ratings.length; j++) {\n          pairDiffs.push((ratings[i]! - ratings[j]!) ** 2)\n        }\n      }\n    }\n  }\n\n  if (pairDiffs.length === 0 || allValues.length < 2) return 1\n\n  const observedDisagreement = pairDiffs.reduce((a, b) => a + b, 0) / pairDiffs.length\n\n  // Expected disagreement from all possible pairings of values\n  let expectedDisagreement = 0\n  let expectedCount = 0\n  for (let i = 0; i < allValues.length; i++) {\n    for (let j = i + 1; j < allValues.length; j++) {\n      expectedDisagreement += (allValues[i]! - allValues[j]!) ** 2\n      expectedCount++\n    }\n  }\n  expectedDisagreement = expectedCount > 0 ? expectedDisagreement / expectedCount : 0\n\n  if (expectedDisagreement === 0) return 1\n  return 1 - observedDisagreement / expectedDisagreement\n}\n\n/**\n * Mann-Whitney U test for comparing two independent groups.\n * Returns U statistic and approximate p-value (normal approximation).\n */\nexport function mannWhitneyU(a: number[], b: number[]): { u: number; p: number } {\n  if (a.length === 0 || b.length === 0) return { u: 0, p: 1 }\n\n  const n1 = a.length\n  const n2 = b.length\n\n  // Rank all values together\n  const combined = [\n    ...a.map((v) => ({ v, group: 'a' as const })),\n    ...b.map((v) => ({ v, group: 'b' as const })),\n  ].sort((x, y) => x.v - y.v)\n\n  // Assign ranks with tie handling\n  const ranks: number[] = new Array(combined.length)\n  let i = 0\n  while (i < combined.length) {\n    let j = i\n    while (j < combined.length && combined[j]!.v === combined[i]!.v) j++\n    const avgRank = (i + 1 + j) / 2\n    for (let k = i; k < j; k++) ranks[k] = avgRank\n    i = j\n  }\n\n  // Sum ranks for group a\n  let r1 = 0\n  for (let k = 0; k < combined.length; k++) {\n    if (combined[k]!.group === 'a') r1 += ranks[k]!\n  }\n\n  const u1 = r1 - (n1 * (n1 + 1)) / 2\n  const u2 = n1 * n2 - u1\n  const u = Math.min(u1, u2)\n\n  // Normal approximation for p-value\n  const mu = (n1 * n2) / 2\n  const sigma = Math.sqrt((n1 * n2 * (n1 + n2 + 1)) / 12)\n\n  if (sigma === 0) return { u, p: 1 }\n\n  const z = Math.abs(u - mu) / sigma\n  // Two-tailed p-value from z-score (approximation)\n  const p = 2 * (1 - normalCdf(z))\n\n  return { u, p }\n}\n\n/** Partial credit: returns 0-1 ratio of current toward target */\nexport function partialCredit(current: number, target: number): number {\n  if (target <= 0) return 1\n  return Math.min(1, Math.max(0, current / target))\n}\n\n/**\n * Paired t-test — before/after measurements on the SAME items.\n * Pairing removes inter-item variance, giving tighter significance than\n * an unpaired test when comparing prompt v1 vs prompt v2 on identical\n * scenarios.\n */\nexport function pairedTTest(\n  before: number[],\n  after: number[],\n): { t: number; df: number; p: number } {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `pairedTTest: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  const n = before.length\n  if (n < 2) return { t: 0, df: 0, p: 1 }\n\n  const diffs = before.map((b, i) => after[i]! - b)\n  const mean = diffs.reduce((a, b) => a + b, 0) / n\n  const variance = diffs.reduce((acc, d) => acc + (d - mean) ** 2, 0) / (n - 1)\n  const se = Math.sqrt(variance / n)\n  if (se === 0) return { t: mean === 0 ? 0 : Infinity, df: n - 1, p: mean === 0 ? 1 : 0 }\n\n  const t = mean / se\n  const df = n - 1\n  const p = 2 * (1 - studentTCdf(Math.abs(t), df))\n  return { t, df, p }\n}\n\n/**\n * Wilcoxon signed-rank test — paired non-parametric alternative.\n * Use when the differences aren't normally distributed.\n */\nexport function wilcoxonSignedRank(before: number[], after: number[]): { w: number; p: number } {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `wilcoxonSignedRank: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  const diffs = before.map((b, i) => after[i]! - b).filter((d) => d !== 0)\n  const n = diffs.length\n  if (n < 6) return { w: 0, p: 1 }\n\n  const absRanks = diffs\n    .map((d, i) => ({ abs: Math.abs(d), sign: Math.sign(d), i }))\n    .sort((a, b) => a.abs - b.abs)\n  const ranks: number[] = new Array(n)\n  let i = 0\n  while (i < n) {\n    let j = i\n    while (j < n && absRanks[j]!.abs === absRanks[i]!.abs) j++\n    const avg = (i + 1 + j) / 2\n    for (let k = i; k < j; k++) ranks[absRanks[k]!.i] = avg\n    i = j\n  }\n  let wPlus = 0\n  for (let k = 0; k < n; k++) if (diffs[k]! > 0) wPlus += ranks[k]!\n\n  const mean = (n * (n + 1)) / 4\n  const variance = (n * (n + 1) * (2 * n + 1)) / 24\n  const z = (wPlus - mean) / Math.sqrt(variance)\n  const p = 2 * (1 - normalCdf(Math.abs(z)))\n  return { w: wPlus, p }\n}\n\n/**\n * Cohen's d — standardized effect size for two independent groups.\n * Positive d means group b has higher mean than group a.\n * Rule of thumb: |d| < 0.2 negligible, 0.2–0.5 small, 0.5–0.8 medium, > 0.8 large.\n */\nexport function cohensD(a: number[], b: number[]): number {\n  if (a.length < 2 || b.length < 2) return 0\n  const meanA = a.reduce((x, y) => x + y, 0) / a.length\n  const meanB = b.reduce((x, y) => x + y, 0) / b.length\n  const varA = a.reduce((acc, x) => acc + (x - meanA) ** 2, 0) / (a.length - 1)\n  const varB = b.reduce((acc, x) => acc + (x - meanB) ** 2, 0) / (b.length - 1)\n  const pooled = Math.sqrt(\n    ((a.length - 1) * varA + (b.length - 1) * varB) / (a.length + b.length - 2),\n  )\n  if (pooled === 0) return 0\n  return (meanB - meanA) / pooled\n}\n\nexport type CliffsMagnitude = 'negligible' | 'small' | 'medium' | 'large'\n\n/**\n * Cliff's delta — a non-parametric effect size for two independent samples.\n * `δ = (#(after > before) − #(after < before)) / (n_before · n_after)`,\n * ranging [-1, 1]. Positive ⇒ `after` tends to exceed `before` (improvement).\n *\n * Distribution-free counterpart to Cohen's d: no normality assumption, robust\n * to the bounded/skewed score distributions judges produce. Pairs with\n * `pairedBootstrap` / `wilcoxonSignedRank` for the non-parametric reporting\n * path. Returns 0 when either sample is empty.\n */\nexport function cliffsDelta(before: number[], after: number[]): number {\n  const n = before.length * after.length\n  if (n === 0) return 0\n  let dominance = 0\n  for (const a of after) {\n    for (const b of before) {\n      if (a > b) dominance += 1\n      else if (a < b) dominance -= 1\n    }\n  }\n  return dominance / n\n}\n\n/**\n * Map a Cliff's delta to a qualitative magnitude using the standard\n * Romano et al. thresholds (|δ|): <0.147 negligible, <0.33 small,\n * <0.474 medium, else large.\n */\nexport function interpretCliffs(delta: number): CliffsMagnitude {\n  const d = Math.abs(delta)\n  if (d < 0.147) return 'negligible'\n  if (d < 0.33) return 'small'\n  if (d < 0.474) return 'medium'\n  return 'large'\n}\n\n// ── Correlation (Pearson / Spearman) ─────────────────────────────────\n//\n// The single source for linear (Pearson) and rank (Spearman) correlation.\n// Edge-case contract is explicit so every caller agrees on what a\n// degenerate input means:\n//   - length mismatch or n < 2  → NaN   (correlation is undefined; not 0)\n//   - both series constant      → 1     (degenerate perfect agreement)\n//   - exactly one series constant → 0   (no covariation to detect)\n// Returning NaN for n < 2 (rather than 0) keeps \"not enough data\" distinct\n// from \"measured zero correlation\", which a 0 would silently conflate.\n\n/**\n * Average-rank-with-ties transform (1-indexed). Tied values receive the mean\n * of the ranks they span, the standard correction for Spearman's ρ.\n */\nexport function ranks(xs: number[]): number[] {\n  const indexed = xs.map((v, i) => ({ v, i })).sort((a, b) => a.v - b.v)\n  const r = new Array<number>(xs.length)\n  let i = 0\n  while (i < indexed.length) {\n    let j = i\n    while (j + 1 < indexed.length && indexed[j + 1]!.v === indexed[i]!.v) j++\n    const avg = (i + j) / 2 + 1\n    for (let k = i; k <= j; k++) r[indexed[k]!.i] = avg\n    i = j + 1\n  }\n  return r\n}\n\n/**\n * Pearson product-moment correlation coefficient r ∈ [-1, 1] between two\n * equal-length series. See the edge-case contract above: NaN for n < 2 or\n * unequal lengths, 1 when both series are constant, 0 when exactly one is.\n */\nexport function pearsonR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return Number.NaN\n  const n = a.length\n  const meanA = a.reduce((s, v) => s + v, 0) / n\n  const meanB = b.reduce((s, v) => s + v, 0) / n\n  let num = 0\n  let varA = 0\n  let varB = 0\n  for (let i = 0; i < n; i++) {\n    const da = a[i]! - meanA\n    const db = b[i]! - meanB\n    num += da * db\n    varA += da * da\n    varB += db * db\n  }\n  if (varA === 0 || varB === 0) return varA === 0 && varB === 0 ? 1 : 0\n  return num / Math.sqrt(varA * varB)\n}\n\n/**\n * Spearman's rank correlation ρ — Pearson over the average-rank-with-ties\n * transform of each series. Same edge-case contract as {@link pearsonR}.\n */\nexport function spearmanR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return Number.NaN\n  return pearsonR(ranks(a), ranks(b))\n}\n\nexport interface WeightedCompositeInput {\n  /** Per-dimension scores (typically 0..1). */\n  dims: Record<string, number>\n  /** Weight per dimension. Every weighted dimension MUST be present in\n   *  `dims` — a weight for an absent dimension is a config error and throws,\n   *  because silently dropping it would renormalise the composite onto a\n   *  different denominator than intended. */\n  weights: Record<string, number>\n  /** Optional pass threshold; when set, the result reports `pass`. */\n  threshold?: number\n}\n\nexport interface WeightedCompositeResult {\n  composite: number\n  pass?: boolean\n}\n\n/**\n * Weighted composite over judge dimensions: `Σ(score_d · w_d) / Σ(w_d)` across\n * the weighted dimensions. The canonical replacement for the per-consumer\n * hand-rolled composite math (tax/legal/creative/gtm each ship a copy).\n *\n * Fail-loud: throws if a weighted dimension is missing from `dims`, if any\n * weight is negative, or if the weights sum to 0 — none of which can produce\n * a meaningful composite.\n */\nexport function weightedComposite(input: WeightedCompositeInput): WeightedCompositeResult {\n  const entries = Object.entries(input.weights)\n  if (entries.length === 0) {\n    throw new Error('weightedComposite: `weights` is empty — nothing to combine')\n  }\n  let weightedSum = 0\n  let weightTotal = 0\n  for (const [dim, weight] of entries) {\n    if (weight < 0) {\n      throw new Error(`weightedComposite: weight for '${dim}' is negative (${weight})`)\n    }\n    if (!(dim in input.dims)) {\n      throw new Error(\n        `weightedComposite: weighted dimension '${dim}' is absent from \\`dims\\` — ` +\n          'refusing to renormalise onto a different denominator',\n      )\n    }\n    weightedSum += input.dims[dim]! * weight\n    weightTotal += weight\n  }\n  if (weightTotal === 0) {\n    throw new Error('weightedComposite: weights sum to 0 — composite is undefined')\n  }\n  const composite = weightedSum / weightTotal\n  return input.threshold === undefined\n    ? { composite }\n    : { composite, pass: composite >= input.threshold }\n}\n\n// ── Corpus-wide inter-rater agreement ──────────────────────────────\n//\n// The legacy `interRaterReliability(judgeScores)` computes a within-item\n// Krippendorff α — multiple judges score *the same item* and we ask\n// \"how much do their scores agree on that item?\" Useful for a single\n// scenario, but it cannot answer \"how reliable are these judges across\n// the whole evaluation corpus?\"\n//\n// `corpusInterRaterAgreement` does the corpus-wide question properly.\n// Inputs are flat per-(item, judge, dimension) score records. For each\n// dimension we pivot to a complete [n_items × n_judges] matrix and feed\n// it to the ICC(2,1) + κ_w machinery already validated in\n// `judge-calibration.ts`. An overall pooled metric averages the\n// per-dimension ICC/κ across dimensions.\n\nexport interface CorpusScoreRecord {\n  /** Stable identifier for the rated item (scenario, span, turn, …). */\n  itemId: string\n  /** Identifier for the judge that produced this score. */\n  judgeName: string\n  /** Dimension name (matches `JudgeScore.dimension`). */\n  dimension: string\n  /** Numeric score; must be finite. */\n  score: number\n}\n\nexport interface CorpusAgreementPerDimension extends ContinuousAgreement {\n  dimension: string\n  /** Item IDs that contributed to this dimension's matrix (every judge scored them). */\n  itemIds: string[]\n  /** Judge IDs that contributed to this dimension's matrix. */\n  judgeIds: string[]\n}\n\nexport interface CorpusAgreementReport {\n  /** Per-dimension ICC(2,1) + κ_w + Pearson + Spearman + bootstrap CIs. */\n  perDimension: CorpusAgreementPerDimension[]\n  /** Mean ICC across dimensions (NaN if no dimension yielded a finite ICC). */\n  overallIcc: number\n  /** Mean weighted κ across dimensions (NaN if none finite). */\n  overallWeightedKappa: number\n  /** Dimensions evaluated (sorted). */\n  dimensions: string[]\n  /** Judges seen across the corpus (sorted). */\n  judgeIds: string[]\n}\n\nexport interface CorpusAgreementOptions extends ContinuousAgreementOptions {\n  /**\n   * Restrict the audit to these dimensions. Default = every dimension\n   * that appears in the input. A dimension named here but absent from\n   * the input throws — silent omission would corrupt the overall metric.\n   */\n  dimensions?: string[]\n  /**\n   * Restrict the audit to these judges. Default = every judge that\n   * appears in the input. A judge named here but absent from a\n   * dimension throws (see \"fail loud\" below).\n   */\n  judges?: string[]\n}\n\n/**\n * Corpus-wide inter-rater agreement across N items × M judges × D dimensions.\n *\n * For each dimension, builds the [n_items][n_judges] matrix of scores\n * (keeping only items every judge rated on that dimension), then runs\n * `continuousAgreement` to get ICC(2,1), κ_w, Pearson, Spearman, and\n * bootstrap CIs. Reports a pooled mean across dimensions as a single\n * \"is this judge panel reliable on this corpus?\" number.\n *\n * Fail-loud contract:\n *   - Empty input throws.\n *   - Fewer than 2 judges or fewer than 2 items per dimension throws.\n *   - A judge present in some dimensions but with zero scored items on\n *     another dimension throws (would silently shrink the matrix).\n *   - Duplicate (itemId, judgeName, dimension) records throw.\n */\nexport function corpusInterRaterAgreement(\n  records: CorpusScoreRecord[],\n  opts: CorpusAgreementOptions = {},\n): CorpusAgreementReport {\n  if (records.length === 0) {\n    throw new ValidationError('corpusInterRaterAgreement: no score records supplied')\n  }\n\n  const judgesSeen = new Set<string>()\n  const dimsSeen = new Set<string>()\n  // dimension → judge → itemId → score\n  const grid = new Map<string, Map<string, Map<string, number>>>()\n\n  for (const r of records) {\n    if (!Number.isFinite(r.score)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: non-finite score for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`,\n      )\n    }\n    judgesSeen.add(r.judgeName)\n    dimsSeen.add(r.dimension)\n    const byJudge = grid.get(r.dimension) ?? new Map<string, Map<string, number>>()\n    const byItem = byJudge.get(r.judgeName) ?? new Map<string, number>()\n    if (byItem.has(r.itemId)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: duplicate record for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`,\n      )\n    }\n    byItem.set(r.itemId, r.score)\n    byJudge.set(r.judgeName, byItem)\n    grid.set(r.dimension, byJudge)\n  }\n\n  const targetDims = opts.dimensions ?? [...dimsSeen].sort()\n  for (const d of targetDims) {\n    if (!dimsSeen.has(d)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${d}' was requested but no records carry it`,\n      )\n    }\n  }\n  const targetJudges = opts.judges ? [...opts.judges] : [...judgesSeen].sort()\n  for (const j of targetJudges) {\n    if (!judgesSeen.has(j)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: judge '${j}' was requested but produced no records`,\n      )\n    }\n  }\n  if (targetJudges.length < 2) {\n    throw new ValidationError(\n      `corpusInterRaterAgreement: need ≥2 judges, got ${targetJudges.length}`,\n    )\n  }\n\n  const perDimension: CorpusAgreementPerDimension[] = []\n  const iccs: number[] = []\n  const kappas: number[] = []\n\n  for (const dim of targetDims) {\n    const byJudge = grid.get(dim)!\n    // Fail loud: every requested judge must have scored ≥1 item on this dim.\n    const judgeItemCounts: Record<string, number> = {}\n    for (const j of targetJudges) {\n      const m = byJudge.get(j)\n      judgeItemCounts[j] = m?.size ?? 0\n    }\n    const emptyJudges = targetJudges.filter((j) => judgeItemCounts[j] === 0)\n    if (emptyJudges.length > 0) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${dim}' has no scores from judge(s) ${emptyJudges.join(', ')} (counts: ${JSON.stringify(judgeItemCounts)})`,\n      )\n    }\n\n    // Items rated by *every* requested judge on this dim.\n    let commonItems: Set<string> | null = null\n    for (const j of targetJudges) {\n      const ids = new Set(byJudge.get(j)!.keys())\n      if (commonItems === null) {\n        commonItems = ids\n      } else {\n        const prev: Set<string> = commonItems\n        commonItems = new Set([...prev].filter((x) => ids.has(x)))\n      }\n    }\n    const sortedItems = [...(commonItems ?? new Set<string>())].sort()\n    if (sortedItems.length < 2) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${dim}' has ${sortedItems.length} item(s) rated by all ${targetJudges.length} judges (need ≥2)`,\n      )\n    }\n\n    const matrix: number[][] = sortedItems.map((itemId) =>\n      targetJudges.map((j) => byJudge.get(j)!.get(itemId)!),\n    )\n    const agreement = continuousAgreement(matrix, opts)\n    perDimension.push({\n      ...agreement,\n      dimension: dim,\n      itemIds: sortedItems,\n      judgeIds: [...targetJudges],\n    })\n    if (Number.isFinite(agreement.icc)) iccs.push(agreement.icc)\n    if (Number.isFinite(agreement.weightedKappa)) kappas.push(agreement.weightedKappa)\n  }\n\n  const mean = (xs: number[]) =>\n    xs.length === 0 ? Number.NaN : xs.reduce((a, b) => a + b, 0) / xs.length\n  return {\n    perDimension,\n    overallIcc: mean(iccs),\n    overallWeightedKappa: mean(kappas),\n    dimensions: targetDims,\n    judgeIds: targetJudges,\n  }\n}\n\n/**\n * Convenience adapter for `JudgeScore[]` data keyed externally by item.\n *\n * Use when you have per-item arrays of `JudgeScore[]` (e.g. one\n * `ScenarioResult.judgeScores` per scenario) and want corpus-wide\n * agreement without manually flattening. `itemId` must be unique per\n * row of `itemsScores`.\n */\nexport function corpusInterRaterAgreementFromJudgeScores(\n  itemsScores: Array<{ itemId: string; scores: JudgeScore[] }>,\n  opts: CorpusAgreementOptions = {},\n): CorpusAgreementReport {\n  const records: CorpusScoreRecord[] = []\n  const seen = new Set<string>()\n  for (const { itemId, scores } of itemsScores) {\n    if (seen.has(itemId)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreementFromJudgeScores: duplicate itemId '${itemId}'`,\n      )\n    }\n    seen.add(itemId)\n    for (const s of scores) {\n      records.push({\n        itemId,\n        judgeName: s.judgeName,\n        dimension: s.dimension,\n        score: s.score,\n      })\n    }\n  }\n  return corpusInterRaterAgreement(records, opts)\n}\n\n/** Student-t CDF approximation via Abramowitz-Stegun series. */\nfunction studentTCdf(t: number, df: number): number {\n  if (df <= 0) return 0.5\n  if (df > 100) return normalCdf(t)\n  const x = df / (df + t * t)\n  const a = df / 2\n  const b = 0.5\n  const ib = incompleteBeta(x, a, b)\n  return t >= 0 ? 1 - 0.5 * ib : 0.5 * ib\n}\n\n/** Regularized incomplete beta function via continued fraction (Lentz). */\nfunction incompleteBeta(x: number, a: number, b: number): number {\n  if (x <= 0) return 0\n  if (x >= 1) return 1\n  const lnBeta = lnGamma(a) + lnGamma(b) - lnGamma(a + b)\n  const front = Math.exp(Math.log(x) * a + Math.log(1 - x) * b - lnBeta) / a\n  const maxIter = 200\n  const eps = 3e-7\n  let c = 1\n  let d = 1 - ((a + b) * x) / (a + 1)\n  if (Math.abs(d) < 1e-30) d = 1e-30\n  d = 1 / d\n  let f = d\n  for (let m = 1; m <= maxIter; m++) {\n    const m2 = 2 * m\n    let num = (m * (b - m) * x) / ((a + m2 - 1) * (a + m2))\n    d = 1 + num * d\n    if (Math.abs(d) < 1e-30) d = 1e-30\n    c = 1 + num / c\n    if (Math.abs(c) < 1e-30) c = 1e-30\n    d = 1 / d\n    f *= d * c\n    num = -((a + m) * (a + b + m) * x) / ((a + m2) * (a + m2 + 1))\n    d = 1 + num * d\n    if (Math.abs(d) < 1e-30) d = 1e-30\n    c = 1 + num / c\n    if (Math.abs(c) < 1e-30) c = 1e-30\n    d = 1 / d\n    const delta = d * c\n    f *= delta\n    if (Math.abs(delta - 1) < eps) break\n  }\n  return front * f\n}\n\n/** Lanczos approximation to ln Γ(z). */\nfunction lnGamma(z: number): number {\n  const g = 7\n  const coefs = [\n    0.99999999999980993, 676.5203681218851, -1259.1392167224028, 771.32342877765313,\n    -176.61502916214059, 12.507343278686905, -0.13857109526572012, 9.9843695780195716e-6,\n    1.5056327351493116e-7,\n  ]\n  if (z < 0.5) {\n    return Math.log(Math.PI / Math.sin(Math.PI * z)) - lnGamma(1 - z)\n  }\n  z -= 1\n  let x = coefs[0]!\n  for (let i = 1; i < g + 2; i++) x += coefs[i]! / (z + i)\n  const t = z + g + 0.5\n  return 0.5 * Math.log(2 * Math.PI) + (z + 0.5) * Math.log(t) - t + Math.log(x)\n}\n\n// Standard normal CDF approximation (Abramowitz and Stegun)\nfunction normalCdf(x: number): number {\n  const a1 = 0.254829592\n  const a2 = -0.284496736\n  const a3 = 1.421413741\n  const a4 = -1.453152027\n  const a5 = 1.061405429\n  const p = 0.3275911\n\n  const sign = x < 0 ? -1 : 1\n  const absX = Math.abs(x)\n  const t = 1 / (1 + p * absX)\n  const y = 1 - ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp((-absX * absX) / 2)\n\n  return 0.5 * (1 + sign * y)\n}\n\n// ── Power analysis + multiple-comparison correction ──────────────────\n\n/**\n * Required N per arm for a two-sample comparison at target effect size,\n * alpha, and power. Normal-approximation formula:\n *   n = 2 * ( (z_{1-α/2} + z_{1-β}) / d )^2\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 (standardised units) for a target paired\n * sample size: d_min = (z_{1-α/2} + z_β) / sqrt(n_paired). Multiply by\n * sd(deltas) for score units; treat as a lower bound — Wilcoxon and bootstrap\n * have asymptotic relative efficiency below 1 vs the t-test on heavy tails.\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/**\n * Number of paired observations needed for a McNemar test to reach a target\n * power — the pre-registration companion to {@link mcnemar}. Parametrised by the\n * expected discordant-cell probabilities `p10` (P[treatment wins on a pair]) and\n * `p01` (P[control wins]); concordant pairs carry no information, so the count\n * is driven entirely by the discordant rate. Lachin's (1992) asymptotic normal\n * approximation: with discordant rate `pDisc = p10 + p01` and marginal effect\n * `δ = p10 − p01`,\n *   n = ( z_{1-α/2}·√pDisc + z_{1-β}·√(pDisc − δ²) )² / δ².\n * Returns Infinity when there is no effect (p10 === p01). Asymptotic — at the\n * tiny discordant counts where the exact {@link mcnemar} differs from the normal\n * approximation, treat the result as a lower bound and prefer the discordant-pair\n * floor.\n */\nexport function mcnemarRequiredN(opts: {\n  p10: number\n  p01: number\n  alpha?: number\n  power?: number\n  twoSided?: boolean\n}): number {\n  const { p10, p01 } = opts\n  if (p10 < 0 || p01 < 0 || p10 + p01 > 1) {\n    throw new Error(`mcnemarRequiredN: require p10,p01 ≥ 0 and p10+p01 ≤ 1 (got ${p10}, ${p01})`)\n  }\n  const delta = p10 - p01\n  if (delta === 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 pDisc = p10 + p01\n  const zAlpha = zQuantile(twoSided ? 1 - alpha / 2 : 1 - alpha)\n  const zBeta = zQuantile(power)\n  const n =\n    (zAlpha * Math.sqrt(pDisc) + zBeta * Math.sqrt(Math.max(0, pDisc - delta * delta))) ** 2 /\n    (delta * delta)\n  return Math.ceil(n)\n}\n\n/**\n * Power of a McNemar test at a given number of paired observations, the inverse\n * of {@link mcnemarRequiredN} (same Lachin asymptotic model, same parameters).\n * Returns a value in [0, 1]; equals `alpha` when there is no effect.\n */\nexport function mcnemarPower(opts: {\n  p10: number\n  p01: number\n  nPairs: number\n  alpha?: number\n  twoSided?: boolean\n}): number {\n  const { p10, p01, nPairs } = opts\n  if (p10 < 0 || p01 < 0 || p10 + p01 > 1) {\n    throw new Error(`mcnemarPower: require p10,p01 ≥ 0 and p10+p01 ≤ 1 (got ${p10}, ${p01})`)\n  }\n  const alpha = opts.alpha ?? 0.05\n  const twoSided = opts.twoSided ?? true\n  const delta = p10 - p01\n  if (delta === 0 || nPairs <= 0) return alpha\n  const pDisc = p10 + p01\n  const zAlpha = zQuantile(twoSided ? 1 - alpha / 2 : 1 - alpha)\n  const denom = Math.sqrt(Math.max(1e-12, pDisc - delta * delta))\n  const zBeta = (Math.sqrt(nPairs) * Math.abs(delta) - zAlpha * Math.sqrt(pDisc)) / denom\n  return Math.min(1, Math.max(0, normalCdf(zBeta)))\n}\n\n/** Bonferroni adjustment: multiply every p-value by the test count, 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 * Holm step-down family-wise error adjustment.\n *\n * P-values are sorted from smallest to largest, multiplied by their remaining\n * hypothesis count, and made monotonically non-decreasing before being mapped\n * back to input order. This uniformly dominates plain Bonferroni while keeping\n * strong family-wise error control under arbitrary dependence.\n */\nexport function holm(\n  pValues: readonly number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  if (!Number.isFinite(alpha) || alpha <= 0 || alpha >= 1) {\n    throw new ValidationError(`holm: alpha must be in (0,1), got ${alpha}`)\n  }\n  for (const [index, pValue] of pValues.entries()) {\n    if (!Number.isFinite(pValue) || pValue < 0 || pValue > 1) {\n      throw new ValidationError(`holm: pValues[${index}] must be in [0,1], got ${pValue}`)\n    }\n  }\n  const count = pValues.length\n  if (count === 0) return { adjusted: [], significant: [] }\n\n  const ordered = pValues\n    .map((pValue, index) => ({ pValue, index }))\n    .sort((a, b) => a.pValue - b.pValue || a.index - b.index)\n  const adjusted = new Array<number>(count)\n  let previous = 0\n  for (let rank = 0; rank < count; rank++) {\n    const entry = ordered[rank]!\n    const stepAdjusted = Math.min(1, entry.pValue * (count - rank))\n    previous = Math.max(previous, stepAdjusted)\n    adjusted[entry.index] = previous\n  }\n  // Holm's rejection rule is inclusive at the adjusted alpha boundary.\n  return { adjusted, significant: adjusted.map((pValue) => pValue <= alpha) }\n}\n\n/**\n * Benjamini–Hochberg false discovery rate. Returns adjusted q-values and\n * significance at the target FDR; handles ties and preserves q monotonicity.\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  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// ── Paired bootstrap (promotion-gate effect size) ────────────────────\n\nexport interface PairedBootstrapResult {\n  /** Number of paired observations. */\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 chosen statistic. */\n  low: number\n  /** Upper bound of the bootstrap CI on the chosen statistic. */\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 chosen\n * statistic (median by default); pairs are resampled with replacement. The\n * lower bound is what the promotion gate checks — `low > threshold` means the\n * gain is real at the confidence level. Throws on unequal sample sizes.\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    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      const 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/** Pre-registered direction for a one-sided paired sign test. */\nexport type SignTestAlternative = 'greater' | 'less'\n\n/** Exact one-sided sign-test result for paired numeric differences. */\nexport interface PairedSignTestResult {\n  /** Total supplied differences, including zero ties. */\n  n: number\n  /** Strictly positive differences. */\n  positive: number\n  /** Strictly negative differences. */\n  negative: number\n  /** Zero differences excluded from the binomial test. */\n  ties: number\n  /** Non-zero differences used by the binomial test. */\n  nNonTies: number\n  /** Direction of the pre-registered alternative hypothesis. */\n  alternative: SignTestAlternative\n  /** Exact one-sided p-value under P(positive) = P(negative) = 0.5. */\n  pValue: number\n}\n\n/**\n * Exact one-sided sign test over paired differences.\n *\n * Pass `after[i] - before[i]` for each matched item. `alternative = 'greater'`\n * tests whether positive signs are more likely than negative signs and returns\n * `P(Binomial(nNonTies, 0.5) >= positive)`. `alternative = 'less'` treats\n * negative signs as successes instead. With a continuous difference\n * distribution this is the usual directional median test. Exact zero\n * differences are ties and do not enter the binomial denominator. All-tie and\n * empty inputs return p = 1. Every input difference must be finite, and the\n * direction must be chosen explicitly so a caller cannot select it after\n * seeing the signs.\n */\nexport function pairedSignTest(\n  differences: readonly number[],\n  alternative: SignTestAlternative,\n): PairedSignTestResult {\n  if (alternative !== 'greater' && alternative !== 'less') {\n    throw new ValidationError(\n      `pairedSignTest: alternative must be 'greater' or 'less', got ${alternative}`,\n    )\n  }\n\n  let positive = 0\n  let negative = 0\n  let ties = 0\n  for (let i = 0; i < differences.length; i++) {\n    const difference = differences[i]!\n    if (!Number.isFinite(difference)) {\n      throw new ValidationError(\n        `pairedSignTest: difference at index ${i} must be finite, got ${difference}`,\n      )\n    }\n    if (difference > 0) positive++\n    else if (difference < 0) negative++\n    else ties++\n  }\n\n  const nNonTies = positive + negative\n  const successes = alternative === 'greater' ? positive : negative\n  return {\n    n: differences.length,\n    positive,\n    negative,\n    ties,\n    nNonTies,\n    alternative,\n    pValue: binomialHalfUpperTail(successes, nNonTies),\n  }\n}\n\n// ── Binomial proportion + paired-binary + coding-eval estimators ─────\n//\n// The paired family above (pairedBootstrap/pairedTTest/wilcoxonSignedRank)\n// operates on continuous scores. Pass/fail A/B comparisons — \"does treatment\n// X raise the success RATE vs control\" — are binary and paired, so they need\n// their own correct estimators: McNemar for significance (only the discordant\n// pairs carry signal), the paired risk difference for effect size, Wilson for\n// a single-arm proportion CI, and pass@k for the standard k-sample coding-eval\n// metric. The normal approximation is wrong for proportions near 0/1 and for\n// the small discordant counts typical of eval runs, so these are exact /\n// Wilson-based, not Wald.\n\n/** A binomial proportion estimate with a confidence interval. */\nexport interface ProportionInterval {\n  /** Point estimate successes / n (0 when n = 0). */\n  estimate: number\n  /** Lower bound, clamped to [0, 1]. */\n  lower: number\n  /** Upper bound, clamped to [0, 1]. */\n  upper: number\n}\n\n/**\n * Wilson score interval for a binomial proportion. Correct at small n and near\n * 0/1, where the normal (Wald) approximation produces bounds outside [0, 1] and\n * understates coverage. Use this for any pass-rate / hit-rate / realness-rate\n * CI — the continuous `confidenceInterval` assumes the wrong distribution for a\n * proportion. `n = 0 ⇒ {0, 0, 0}`.\n */\nexport function wilson(successes: number, n: number, confidence = 0.95): ProportionInterval {\n  if (n <= 0) return { estimate: 0, lower: 0, upper: 0 }\n  if (successes < 0 || successes > n) {\n    throw new Error(`wilson: successes (${successes}) must be in [0, ${n}]`)\n  }\n  const z = zQuantile(1 - (1 - confidence) / 2)\n  const p = successes / n\n  const z2 = z * z\n  const denom = 1 + z2 / n\n  const center = (p + z2 / (2 * n)) / denom\n  const half = (z * Math.sqrt((p * (1 - p) + z2 / (4 * n)) / n)) / denom\n  return {\n    estimate: p,\n    lower: Math.max(0, center - half),\n    upper: Math.min(1, center + half),\n  }\n}\n\n/** Result of a McNemar paired-binary significance test. */\nexport interface McNemarResult {\n  /** Total paired observations. */\n  n: number\n  /** Discordant pairs (b + c) — the only ones that carry signal. */\n  nDiscordant: number\n  /** Pairs where treatment succeeded and control failed (\"newly correct\"). */\n  b: number\n  /** Pairs where control succeeded and treatment failed (\"newly wrong\"). */\n  c: number\n  /** Continuity-corrected chi-square statistic (reference; exact p drives the call). */\n  statistic: number\n  /** Two-sided p-value. Exact (binomial sign test on discordant pairs). */\n  pValue: number\n}\n\n/**\n * McNemar's test for paired binary outcomes — the correct significance test for\n * \"does treatment change the success rate vs control on the SAME items\". Only\n * discordant pairs (one arm right, the other wrong) carry information; concordant\n * pairs are uninformative, so a paired t-test / two-proportion z-test on the raw\n * rates is wrong here. The p-value is exact: under H0 the b \"treatment-wins\" are\n * Binomial(b + c, 0.5), so the two-sided p is the doubled binomial tail — correct\n * at the small discordant counts typical of eval runs (no continuity-corrected\n * chi-square approximation needed, though it is returned as `statistic` for\n * reference). Inputs are paired 0/1 (or boolean) arrays, control first to match\n * the module's (before, after) convention. Throws on unequal lengths.\n */\nexport function mcnemar(\n  control: ArrayLike<number | boolean>,\n  treatment: ArrayLike<number | boolean>,\n): McNemarResult {\n  if (control.length !== treatment.length) {\n    throw new Error(`mcnemar: unequal sample sizes (${control.length} vs ${treatment.length})`)\n  }\n  const n = control.length\n  let b = 0 // treatment 1, control 0\n  let c = 0 // treatment 0, control 1\n  for (let i = 0; i < n; i++) {\n    const ctrl = control[i] ? 1 : 0\n    const treat = treatment[i] ? 1 : 0\n    if (treat === 1 && ctrl === 0) b++\n    else if (treat === 0 && ctrl === 1) c++\n  }\n  const nDiscordant = b + c\n  const statistic = nDiscordant === 0 ? 0 : (Math.abs(b - c) - 1) ** 2 / nDiscordant\n  return { n, nDiscordant, b, c, statistic, pValue: binomialSignTwoSided(b, c) }\n}\n\n/** A paired binary effect size (treatment rate − control rate) with a CI. */\nexport interface RiskDifferenceResult {\n  /** Total paired observations. */\n  n: number\n  /** Discordant pairs: treatment-win count. */\n  b: number\n  /** Discordant pairs: control-win count. */\n  c: number\n  /** Paired risk difference p(treatment) − p(control) = (b − c) / n. */\n  riskDifference: number\n  /** Lower bound of the CI, clamped to [-1, 1]. */\n  lower: number\n  /** Upper bound of the CI, clamped to [-1, 1]. */\n  upper: number\n  /** Confidence level used. */\n  confidence: number\n}\n\n/**\n * Paired risk difference (the effect-size companion to {@link mcnemar}): the\n * change in success rate p(treatment) − p(control) on matched items, which for\n * paired binary data equals (b − c) / n. The CI uses the paired variance from\n * the discordant counts, not the independent-samples formula (which overstates\n * the interval by ignoring the pairing). Inputs are paired 0/1 (or boolean)\n * arrays, control first. Throws on unequal lengths.\n */\nexport function pairedRiskDifference(\n  control: ArrayLike<number | boolean>,\n  treatment: ArrayLike<number | boolean>,\n  confidence = 0.95,\n): RiskDifferenceResult {\n  if (control.length !== treatment.length) {\n    throw new Error(\n      `pairedRiskDifference: unequal sample sizes (${control.length} vs ${treatment.length})`,\n    )\n  }\n  const n = control.length\n  if (n === 0) return { n: 0, b: 0, c: 0, riskDifference: 0, lower: 0, upper: 0, confidence }\n  let b = 0\n  let c = 0\n  for (let i = 0; i < n; i++) {\n    const ctrl = control[i] ? 1 : 0\n    const treat = treatment[i] ? 1 : 0\n    if (treat === 1 && ctrl === 0) b++\n    else if (treat === 0 && ctrl === 1) c++\n  }\n  const rd = (b - c) / n\n  const variance = (b + c - (b - c) ** 2 / n) / (n * n)\n  const z = zQuantile(1 - (1 - confidence) / 2)\n  const half = z * Math.sqrt(Math.max(0, variance))\n  return {\n    n,\n    b,\n    c,\n    riskDifference: rd,\n    lower: Math.max(-1, rd - half),\n    upper: Math.min(1, rd + half),\n    confidence,\n  }\n}\n\n/**\n * Unbiased pass@k for code generation (Chen et al. 2021, \"Evaluating Large\n * Language Models Trained on Code\"). Given `n` independent samples for one\n * problem of which `c` pass, the probability that at least one of a random k of\n * them passes is 1 − C(n−c, k) / C(n, k). Estimating pass@k as \"did any of the\n * first k pass\" is biased high at small n; this is the variance-reduced estimator\n * averaged implicitly over all k-subsets. Average the per-problem values across\n * the suite for the corpus pass@k. Computed in the numerically stable product\n * form. Requires 1 ≤ k ≤ n and 0 ≤ c ≤ n.\n */\nexport function passAtK(n: number, c: number, k: number): number {\n  if (!Number.isInteger(n) || !Number.isInteger(c) || !Number.isInteger(k)) {\n    throw new Error(`passAtK: n, c, k must be integers (got n=${n}, c=${c}, k=${k})`)\n  }\n  if (k < 1 || k > n || c < 0 || c > n) {\n    throw new Error(`passAtK: require 1 ≤ k ≤ n and 0 ≤ c ≤ n (got n=${n}, c=${c}, k=${k})`)\n  }\n  if (n - c < k) return 1\n  let prob = 1\n  for (let i = n - c + 1; i <= n; i++) prob *= 1 - k / i\n  return 1 - prob\n}\n\n/**\n * Two-sided exact p-value for b successes out of (b + c) Bernoulli(0.5) trials —\n * the exact-binomial core of {@link mcnemar}. `min(1, 2·P(X ≤ min(b,c)))`. No\n * discordant pairs ⇒ no evidence ⇒ p = 1. Summed in log space (lnGamma) so it\n * stays exact at large discordant counts without overflow.\n */\nfunction binomialSignTwoSided(b: number, c: number): number {\n  const nd = b + c\n  if (nd === 0) return 1\n  return Math.min(1, 2 * binomialHalfLowerTail(Math.min(b, c), nd))\n}\n\n/** P(X >= successes) for X ~ Binomial(n, 0.5). */\nfunction binomialHalfUpperTail(successes: number, n: number): number {\n  if (successes <= 0) return 1\n  if (successes > n) return 0\n\n  // Use the smaller side of the distribution. For lower thresholds the\n  // complement sums at most half the mass; for upper thresholds symmetry\n  // maps the upper tail to a lower tail without subtraction.\n  if (successes <= n / 2) {\n    return Math.max(0, 1 - binomialHalfLowerTail(successes - 1, n))\n  }\n  return binomialHalfLowerTail(n - successes, n)\n}\n\n/** P(X <= maxSuccesses) for X ~ Binomial(n, 0.5), accumulated in log space. */\nfunction binomialHalfLowerTail(maxSuccesses: number, n: number): number {\n  if (maxSuccesses < 0) return 0\n  if (maxSuccesses >= n) return 1\n  if (maxSuccesses === 0) return 2 ** -n\n\n  const logHalfN = n * Math.log(0.5)\n  let logTail = Number.NEGATIVE_INFINITY\n  for (let i = 0; i <= maxSuccesses; i++) {\n    const logChoose = lnGamma(n + 1) - lnGamma(i + 1) - lnGamma(n - i + 1)\n    logTail = logAddExp(logTail, logChoose + logHalfN)\n  }\n  return Math.min(1, Math.exp(logTail))\n}\n\nfunction logAddExp(a: number, b: number): number {\n  if (a === Number.NEGATIVE_INFINITY) return b\n  if (b === Number.NEGATIVE_INFINITY) return a\n  const max = Math.max(a, b)\n  const min = Math.min(a, b)\n  return max + Math.log1p(Math.exp(min - max))\n}\n\n// ── Anytime-valid e-process (betting test-martingale) ────────────────\n\nexport interface EProcessOptions {\n  /** Type-I error budget. The process decides when wealth ≥ 1/alpha\n   *  (Ville's inequality). Default 0.05. */\n  alpha?: number\n  /** Truncation bound on the predictable bet λ ∈ [0, maxBet]. Must satisfy\n   *  maxBet < 1/nullMean so every wealth factor stays strictly positive.\n   *  Default 0.5. */\n  maxBet?: number\n  /** The null boundary m₀ for H0: E[x] ≤ m₀ on x ∈ [0,1]. Default 0.5\n   *  (the paired-delta encoding x = (d+1)/2 maps \"no effect\" to 1/2).\n   *  A pre-registered minEffect shifts this — see `sequentialPairedGate`. */\n  nullMean?: number\n}\n\nexport interface EProcessStep {\n  /** Current wealth W_n — the e-value against H0 after n observations. */\n  wealth: number\n  /** Observations consumed so far. */\n  n: number\n  /** True from the first n where W_n ≥ 1/alpha onward (sticky). */\n  decided: boolean\n}\n\nexport interface EProcessState extends EProcessStep {\n  alpha: number\n  maxBet: number\n  nullMean: number\n  /** The decision boundary 1/alpha. */\n  threshold: number\n  /** Observation count at the first threshold crossing; undefined until decided. */\n  decidedAtN?: number\n}\n\nexport interface EProcess {\n  /** Consume one observation x ∈ [0,1]. Throws on non-finite / out-of-range\n   *  input — a silent clamp would corrupt the type-I guarantee. */\n  update(x: number): EProcessStep\n  state(): EProcessState\n}\n\n/**\n * Betting test-martingale for bounded observations — the e-process core of\n * anytime-valid sequential testing (Waudby-Smith & Ramdas, \"Estimating means\n * of bounded random variables by betting\", JRSS-B 2024).\n *\n * Observations x_i ∈ [0,1]; H0: E[x] ≤ m₀ (`nullMean`, default 1/2). Wealth\n *\n *   W_t = Π_{i≤t} (1 + λ_i (x_i − m₀)),  W_0 = 1\n *\n * with the truncated GROW-style plug-in bet computed from PRIOR observations:\n *\n *   λ_i = clamp((μ̂_{i−1} − m₀) / (σ̂²_{i−1} + (μ̂_{i−1} − m₀)²), 0, maxBet)\n *\n * where μ̂/σ̂² are the shrunk running estimates μ̂_t = (1/2 + Σx_i)/(t+1),\n * σ̂²_t = (1/4 + Σ(x_i − μ̂_i)²)/(t+1).\n *\n * PREDICTABILITY INVARIANT (load-bearing): λ_i is a function of x_1..x_{i−1}\n * ONLY — it may never see x_i. With λ_i ≥ 0 predictable, each factor has\n * E[1 + λ_i(x_i − m₀) | past] ≤ 1 under H0, so W is a nonnegative\n * supermartingale and Ville's inequality gives P(∃t: W_t ≥ 1/α) ≤ α — the\n * type-I guarantee holds at ANY data-dependent stopping time. λ_1 is always 0\n * (no prior evidence), so the first observation never moves wealth.\n *\n * `decided` latches at the first crossing W_t ≥ 1/α and never un-latches;\n * wealth keeps updating after the crossing (the e-process remains valid), but\n * the decision time is the first crossing.\n */\nexport function eProcess(opts: EProcessOptions = {}): EProcess {\n  const alpha = opts.alpha ?? 0.05\n  const maxBet = opts.maxBet ?? 0.5\n  const nullMean = opts.nullMean ?? 0.5\n  if (!Number.isFinite(alpha) || alpha <= 0 || alpha >= 1) {\n    throw new ValidationError(`eProcess: alpha must be in (0,1), got ${alpha}`)\n  }\n  if (!Number.isFinite(nullMean) || nullMean <= 0 || nullMean >= 1) {\n    throw new ValidationError(`eProcess: nullMean must be in (0,1), got ${nullMean}`)\n  }\n  if (!Number.isFinite(maxBet) || maxBet <= 0 || maxBet >= 1 / nullMean) {\n    throw new ValidationError(\n      `eProcess: maxBet must be in (0, 1/nullMean=${(1 / nullMean).toFixed(4)}) so wealth ` +\n        `factors stay positive, got ${maxBet}`,\n    )\n  }\n  const threshold = 1 / alpha\n  let wealth = 1\n  let n = 0\n  let decided = false\n  let decidedAtN: number | undefined\n  // Running sums over observations consumed so far — read BEFORE folding in\n  // the next x, so every bet is predictable.\n  let sumX = 0\n  let varSum = 0\n  return {\n    update(x: number): EProcessStep {\n      if (typeof x !== 'number' || !Number.isFinite(x) || x < 0 || x > 1) {\n        throw new ValidationError(\n          `eProcess: observation must be a finite number in [0,1], got ${x}`,\n        )\n      }\n      // λ from prior observations ONLY — x has not touched sumX/varSum yet.\n      const muPrev = (0.5 + sumX) / (n + 1)\n      const varPrev = (0.25 + varSum) / (n + 1)\n      const edge = muPrev - nullMean\n      const lambda = Math.min(maxBet, Math.max(0, edge / (varPrev + edge * edge)))\n      wealth *= 1 + lambda * (x - nullMean)\n      n += 1\n      sumX += x\n      const muNow = (0.5 + sumX) / (n + 1)\n      varSum += (x - muNow) ** 2\n      if (!decided && wealth >= threshold) {\n        decided = true\n        decidedAtN = n\n      }\n      return { wealth, n, decided }\n    },\n    state(): EProcessState {\n      return { wealth, n, decided, alpha, maxBet, nullMean, threshold, decidedAtN }\n    },\n  }\n}\n\n// ── private stats helpers ────────────────────────────────────────────\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\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\nfunction makeRng(seed: number | undefined): () => number {\n  if (seed === undefined) return Math.random\n  return mulberry32(seed)\n}\n\n/** Tiny seedable PRNG (mulberry32) — deterministic resampling/shuffling, not\n *  cryptographic. Exported so e-process shuffles and bootstrap resampling\n *  share ONE PRNG implementation; a seed is REQUIRED (unseeded randomness in\n *  gate verdicts is non-reproducible by construction). */\nexport function mulberry32(seed: number): () => number {\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 * Judge calibration — measure judge quality against human gold + bias.\n *\n * Workflow:\n *   1. Build a golden set: {itemId, humanScore}[].\n *   2. Run candidate judges; each produces {itemId, score}.\n *   3. `calibrateJudge(golden, candidate)` reports κ + Pearson + MAE.\n *   4. `calibrateJudgeContinuous(golden, candidate)` adds quadratic-weighted\n *      κ over the un-rounded [0,1] scores plus ICC(2,1), Pearson, Spearman,\n *      and bootstrap CIs — use this for fine-grained judges where rounding\n *      to int discards information (e.g. 0.78 vs 0.81 both round to 1 and\n *      look \"perfectly agreed\" to integer κ).\n *   5. Run bias probes (positional, verbosity, self-preference) to\n *      detect systematic score inflation.\n *   6. For N≥2 judges on the same items, `continuousAgreement(scores)`\n *      reports ICC(2,1) + κ_w + Pearson + Spearman with bootstrap CIs.\n *\n * Returns actionable diagnostics, not a single number. Consumers then\n * decide whether to trust the judge, retrain it, or add a tie-breaker.\n */\n\nimport { pearsonR, spearmanR } from './statistics'\n\nexport interface GoldenItem {\n  itemId: string\n  humanScore: number\n  /** Optional group used for per-group bias audits (e.g. model-of-output family). */\n  group?: string\n}\n\nexport interface CandidateScore {\n  itemId: string\n  score: number\n  /** Optional — enables positional-bias analysis (did order matter?). */\n  positionOfAInput?: 'first' | 'second'\n}\n\nexport interface CalibrationResult {\n  n: number\n  pearson: number\n  /** Cohen's κ with quadratic weights over integer-rounded scores. */\n  kappa: number\n  /** Mean absolute error vs human. */\n  mae: number\n  /** Worst-5 miscalibrations (largest |judge - human|). */\n  worstItems: Array<{ itemId: string; judge: number; human: number; delta: number }>\n}\n\n/**\n * Measure judge quality against human gold labels: computes Cohen's κ, Pearson correlation, and MAE over matched item ids.\n */\nexport function calibrateJudge(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n): CalibrationResult {\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const common = [...map.values()].filter((v) => Number.isFinite(v.j))\n  const n = common.length\n  if (n < 2) {\n    return { n, pearson: NaN, kappa: NaN, mae: NaN, worstItems: [] }\n  }\n  const humans = common.map((c) => c.h)\n  const judges = common.map((c) => c.j)\n  const pearson = pearsonR(humans, judges)\n  const kappa = weightedKappa(humans.map(Math.round), judges.map(Math.round))\n  const absDiffs = common.map((c) => Math.abs(c.j - c.h))\n  const mae = absDiffs.reduce((a, b) => a + b, 0) / n\n  const worst = [...map.entries()]\n    .filter(([, v]) => Number.isFinite(v.j))\n    .map(([itemId, v]) => ({ itemId, judge: v.j, human: v.h, delta: Math.abs(v.j - v.h) }))\n    .sort((a, b) => b.delta - a.delta)\n    .slice(0, 5)\n  return { n, pearson, kappa, mae, worstItems: worst }\n}\n\nexport interface PositionalBiasResult {\n  /**\n   * Score delta (first-position - second-position) averaged across items\n   * presented in both positions. Non-zero = positional bias.\n   */\n  avgDelta: number\n  n: number\n}\n\n/**\n * Feed the same items to the judge twice with A/B swapped and pass all\n * results here. Items that don't appear in both positions are ignored.\n */\nexport function positionalBias(scores: CandidateScore[]): PositionalBiasResult {\n  const pairs = new Map<string, { first?: number; second?: number }>()\n  for (const s of scores) {\n    const slot = pairs.get(s.itemId) ?? {}\n    if (s.positionOfAInput === 'first') slot.first = s.score\n    else if (s.positionOfAInput === 'second') slot.second = s.score\n    pairs.set(s.itemId, slot)\n  }\n  const deltas: number[] = []\n  for (const { first, second } of pairs.values()) {\n    if (first !== undefined && second !== undefined) deltas.push(first - second)\n  }\n  if (deltas.length === 0) return { avgDelta: 0, n: 0 }\n  return { avgDelta: deltas.reduce((a, b) => a + b, 0) / deltas.length, n: deltas.length }\n}\n\nexport interface VerbosityBiasResult {\n  /** Pearson correlation between output length and score. Strong positive = verbosity bias. */\n  pearson: number\n  n: number\n}\n\nexport function verbosityBias(\n  samples: Array<{ outputLen: number; score: number }>,\n): VerbosityBiasResult {\n  const n = samples.length\n  if (n < 3) return { pearson: NaN, n }\n  return {\n    pearson: pearsonR(\n      samples.map((s) => s.outputLen),\n      samples.map((s) => s.score),\n    ),\n    n,\n  }\n}\n\nexport interface SelfPreferenceResult {\n  /** Mean judge score when judge's family matches output's family. */\n  inFamilyMean: number\n  outOfFamilyMean: number\n  deltaMean: number\n  n: number\n}\n\n/**\n * Pass the same scenarios scored with judge-model X grading outputs from\n * model X (in-family) and model Y (out-of-family). Non-zero delta\n * indicates self-preference.\n */\nexport function selfPreference(\n  samples: Array<{ score: number; inFamily: boolean }>,\n): SelfPreferenceResult {\n  const inF = samples.filter((s) => s.inFamily).map((s) => s.score)\n  const outF = samples.filter((s) => !s.inFamily).map((s) => s.score)\n  if (inF.length === 0 || outF.length === 0)\n    return { inFamilyMean: 0, outOfFamilyMean: 0, deltaMean: 0, n: 0 }\n  const inMean = inF.reduce((a, b) => a + b, 0) / inF.length\n  const outMean = outF.reduce((a, b) => a + b, 0) / outF.length\n  return {\n    inFamilyMean: inMean,\n    outOfFamilyMean: outMean,\n    deltaMean: inMean - outMean,\n    n: samples.length,\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\n/** Quadratic weighted Cohen's κ over bounded integer scores. */\nfunction weightedKappa(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length === 0) return NaN\n  const min = Math.min(...a, ...b)\n  const max = Math.max(...a, ...b)\n  const K = max - min + 1\n  if (K < 2) return 1\n  const observed: number[][] = Array.from({ length: K }, () => new Array(K).fill(0))\n  const rowMarg = new Array(K).fill(0)\n  const colMarg = new Array(K).fill(0)\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i]! - min\n    const bi = b[i]! - min\n    const row = observed[ai]!\n    row[bi] = (row[bi] ?? 0) + 1\n    rowMarg[ai]++\n    colMarg[bi]++\n  }\n  let num = 0\n  let den = 0\n  for (let i = 0; i < K; i++) {\n    for (let j = 0; j < K; j++) {\n      const w = (i - j) ** 2 / (K - 1) ** 2\n      const expected = (rowMarg[i] * colMarg[j]) / a.length\n      num += w * observed[i]![j]!\n      den += w * expected\n    }\n  }\n  if (den === 0) return 1\n  return 1 - num / den\n}\n\n// ── Continuous-value inter-rater agreement ──────────────────────────\n//\n// `weightedKappa` above quantises to integers. For [0,1] judges that is\n// lossy: 0.78 and 0.81 both round to 1 and look identical to integer κ.\n// `continuousAgreement` keeps the original magnitudes:\n//\n//   - κ_w   : Cohen's weighted κ generalised to continuous scores. For two\n//             raters, weighted κ = 1 − Σ w_ij·o_ij / Σ w_ij·e_ij collapses\n//             into the closed form below when each \"category\" is the score\n//             itself (Janson & Olsson 2001; Cohen 1968 quadratic weights).\n//   - ICC   : Intraclass Correlation Coefficient, ICC(2,1) per Shrout &\n//             Fleiss (1979) — two-way random effects, absolute agreement,\n//             single rater. The right reliability coefficient when judges\n//             are a random sample of the judge population.\n//   - r, ρ  : Pearson + Spearman for sanity-check. Pearson catches linear\n//             association regardless of scale; Spearman catches monotone\n//             association regardless of distribution.\n//   - CIs   : Bootstrap percentile CIs over items (rows). Bias is preserved\n//             because we resample the full row, i.e. a judge's vector\n//             stays internally consistent within each bootstrap replicate.\n//\n// References:\n//   - Shrout, P. E. & Fleiss, J. L. (1979). Intraclass correlations: uses\n//     in assessing rater reliability. Psychological Bulletin, 86(2), 420.\n//   - McGraw, K. O. & Wong, S. P. (1996). Forming inferences about some\n//     intraclass correlation coefficients. Psychological Methods, 1, 30.\n//   - Janson, H. & Olsson, U. (2001). A measure of agreement for interval\n//     or nominal multivariate observations. Educ. Psychol. Meas., 61, 277.\n\nexport interface ContinuousAgreement {\n  /** Cohen's κ_w with quadratic weights, computed on raw [0,1] scores. */\n  weightedKappa: number\n  /** ICC(2,1): two-way random effects, absolute agreement, single rater. */\n  icc: number\n  /** Pearson product-moment correlation (averaged over rater pairs if N>2). */\n  pearson: number\n  /** Spearman rank correlation (averaged over rater pairs if N>2). */\n  spearman: number\n  /** 95% bootstrap percentile CIs over items. */\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n  /** Number of complete items (no NaN across raters). */\n  n: number\n  /** Number of raters. */\n  raters: number\n}\n\nexport interface ContinuousAgreementOptions {\n  /** Bootstrap iterations. Default 1000. Set to 0 to skip CIs (CI = [NaN, NaN]). */\n  bootstrap?: number\n  /** κ weighting scheme. Default 'quadratic'. */\n  weights?: 'linear' | 'quadratic'\n  /** PRNG seed for reproducible bootstrap. Default 0xC0FFEE. */\n  seed?: number\n  /** Confidence level for percentile CI. Default 0.95. */\n  ciLevel?: number\n}\n\n/**\n * Inter-rater agreement on continuous (typically [0,1]) scores.\n *\n * `scores` has shape [n_items][n_raters]. Rows with any non-finite entry\n * are dropped. Returns NaN metrics if fewer than 2 raters or 2 complete\n * items remain.\n */\nexport function continuousAgreement(\n  scores: number[][],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousAgreement {\n  const bootstrap = opts.bootstrap ?? 1000\n  const weights = opts.weights ?? 'quadratic'\n  const seed = opts.seed ?? 0xc0ffee\n  const ciLevel = opts.ciLevel ?? 0.95\n\n  const matrix = scores.filter((row) => row.length >= 2 && row.every((v) => Number.isFinite(v)))\n  const raters = matrix[0]?.length ?? 0\n  // All rows must have the same rater count, else drop the offenders.\n  const clean = matrix.filter((row) => row.length === raters)\n  const nClean = clean.length\n\n  if (nClean < 2 || raters < 2) {\n    return {\n      weightedKappa: NaN,\n      icc: NaN,\n      pearson: NaN,\n      spearman: NaN,\n      ci: { icc: [NaN, NaN], weightedKappa: [NaN, NaN] },\n      n: nClean,\n      raters,\n    }\n  }\n\n  const kappa = continuousWeightedKappa(clean, weights)\n  const icc = icc21(clean)\n  const pearson = avgPairwise(clean, pearsonR)\n  const spearman = avgPairwise(clean, spearmanR)\n\n  const ciIcc: [number, number] = [NaN, NaN]\n  const ciKappa: [number, number] = [NaN, NaN]\n  if (bootstrap > 0) {\n    const rng = mulberry32(seed)\n    const iccs: number[] = []\n    const kappas: number[] = []\n    for (let b = 0; b < bootstrap; b++) {\n      const sample: number[][] = new Array(nClean)\n      for (let i = 0; i < nClean; i++) {\n        sample[i] = clean[Math.floor(rng() * nClean)]!\n      }\n      const iccB = icc21(sample)\n      const kB = continuousWeightedKappa(sample, weights)\n      if (Number.isFinite(iccB)) iccs.push(iccB)\n      if (Number.isFinite(kB)) kappas.push(kB)\n    }\n    const [lo, hi] = percentileBounds(ciLevel)\n    if (iccs.length > 0) {\n      iccs.sort((a, b) => a - b)\n      ciIcc[0] = quantile(iccs, lo)\n      ciIcc[1] = quantile(iccs, hi)\n    }\n    if (kappas.length > 0) {\n      kappas.sort((a, b) => a - b)\n      ciKappa[0] = quantile(kappas, lo)\n      ciKappa[1] = quantile(kappas, hi)\n    }\n  }\n\n  return {\n    weightedKappa: kappa,\n    icc,\n    pearson,\n    spearman,\n    ci: { icc: ciIcc, weightedKappa: ciKappa },\n    n: nClean,\n    raters,\n  }\n}\n\nexport interface ContinuousCalibrationResult extends CalibrationResult {\n  /** Cohen's κ_w computed on raw (un-rounded) scores. */\n  weightedKappaContinuous: number\n  /** ICC(2,1) treating golden + candidate as two raters. */\n  icc: number\n  spearman: number\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n}\n\n/**\n * Drop-in superset of `calibrateJudge` that adds continuous-value\n * agreement metrics. The old fields (n, pearson, kappa, mae, worstItems)\n * are preserved unchanged so existing callers continue to work.\n */\nexport function calibrateJudgeContinuous(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousCalibrationResult {\n  const base = calibrateJudge(golden, candidate)\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const rows: number[][] = []\n  for (const v of map.values()) {\n    if (Number.isFinite(v.j)) rows.push([v.h, v.j])\n  }\n  const agreement = continuousAgreement(rows, opts)\n  return {\n    ...base,\n    weightedKappaContinuous: agreement.weightedKappa,\n    icc: agreement.icc,\n    spearman: agreement.spearman,\n    ci: agreement.ci,\n  }\n}\n\n// ── Continuous-agreement internals ──────────────────────────────────\n\n/**\n * Quadratic-weighted κ on continuous scores. With weights w(x,y) = (x-y)^2\n * (or |x-y| for linear) the formula collapses to:\n *\n *   κ_w = 1 − E_obs[w] / E_exp[w]\n *\n * where E_obs averages w over paired (a_i, b_i) and E_exp averages w over\n * the independent product distribution (sum_{i,j} w(a_i, b_j) / n^2).\n * The normalisation by (max-min)^2 in the integer version cancels in the\n * ratio, so we don't need it here. Generalises to N raters by averaging κ_w\n * over all rater pairs (mean pairwise weighted agreement).\n */\nfunction continuousWeightedKappa(rows: number[][], scheme: 'linear' | 'quadratic'): number {\n  if (rows.length === 0) return NaN\n  const raters = rows[0]!.length\n  if (raters < 2) return NaN\n  const wFn =\n    scheme === 'linear'\n      ? (x: number, y: number) => Math.abs(x - y)\n      : (x: number, y: number) => (x - y) ** 2\n  let sum = 0\n  let pairs = 0\n  for (let r1 = 0; r1 < raters; r1++) {\n    for (let r2 = r1 + 1; r2 < raters; r2++) {\n      const a = rows.map((row) => row[r1]!)\n      const b = rows.map((row) => row[r2]!)\n      const n = a.length\n      let obs = 0\n      for (let i = 0; i < n; i++) obs += wFn(a[i]!, b[i]!)\n      obs /= n\n      // Expected under independence: average of w over all i,j cross pairs.\n      let exp = 0\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) exp += wFn(a[i]!, b[j]!)\n      }\n      exp /= n * n\n      if (exp === 0) {\n        // Degenerate: at least one rater is constant. Convention: perfect\n        // agreement iff observed disagreement is also zero, else 0.\n        sum += obs === 0 ? 1 : 0\n      } else {\n        sum += 1 - obs / exp\n      }\n      pairs++\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/**\n * ICC(2,1) — two-way random effects, absolute agreement, single rater.\n *\n *   ICC(2,1) = (MSR − MSE) / (MSR + (k−1)·MSE + k·(MSC − MSE)/n)\n *\n * where MSR = between-rows MS, MSC = between-columns MS, MSE = residual MS,\n * n = rows (items), k = columns (raters).\n */\nfunction icc21(rows: number[][]): number {\n  const n = rows.length\n  if (n < 2) return NaN\n  const k = rows[0]!.length\n  if (k < 2) return NaN\n\n  // Row means.\n  const rowMeans = rows.map((row) => row.reduce((s, v) => s + v, 0) / k)\n  // Column means.\n  const colMeans = new Array(k).fill(0)\n  for (let j = 0; j < k; j++) {\n    let s = 0\n    for (let i = 0; i < n; i++) s += rows[i]![j]!\n    colMeans[j] = s / n\n  }\n  // Grand mean.\n  let grand = 0\n  for (let i = 0; i < n; i++) grand += rowMeans[i]!\n  grand /= n\n\n  let ssR = 0\n  for (let i = 0; i < n; i++) ssR += (rowMeans[i]! - grand) ** 2\n  ssR *= k\n  let ssC = 0\n  for (let j = 0; j < k; j++) ssC += (colMeans[j]! - grand) ** 2\n  ssC *= n\n  let ssT = 0\n  for (let i = 0; i < n; i++) {\n    for (let j = 0; j < k; j++) ssT += (rows[i]![j]! - grand) ** 2\n  }\n  const ssE = ssT - ssR - ssC\n\n  const dfR = n - 1\n  const dfC = k - 1\n  const dfE = (n - 1) * (k - 1)\n  const msR = ssR / dfR\n  const msC = ssC / dfC\n  const msE = dfE > 0 ? ssE / dfE : 0\n\n  const denom = msR + (k - 1) * msE + (k * (msC - msE)) / n\n  if (denom === 0) {\n    // Degenerate (all values equal): convention = 1 if rows identical,\n    // else 0. Identical rows ⇒ msR = 0 too, so msR − msE near 0.\n    return msR === 0 && msE === 0 ? 1 : 0\n  }\n  return (msR - msE) / denom\n}\n\n/** Average pairwise statistic over all rater pairs. */\nfunction avgPairwise(rows: number[][], fn: (a: number[], b: number[]) => number): number {\n  const k = rows[0]?.length ?? 0\n  if (k < 2) return NaN\n  let sum = 0\n  let pairs = 0\n  for (let i = 0; i < k; i++) {\n    for (let j = i + 1; j < k; j++) {\n      const a = rows.map((row) => row[i]!)\n      const b = rows.map((row) => row[j]!)\n      const r = fn(a, b)\n      if (Number.isFinite(r)) {\n        sum += r\n        pairs++\n      }\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/** Seeded PRNG — Mulberry32. Deterministic across platforms. */\nfunction mulberry32(seed: number): () => number {\n  let a = seed >>> 0\n  return () => {\n    a = (a + 0x6d2b79f5) >>> 0\n    let t = a\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 percentileBounds(ciLevel: number): [number, number] {\n  const tail = (1 - ciLevel) / 2\n  return [tail, 1 - tail]\n}\n\n/** Linear-interpolated quantile of a pre-sorted ascending array. */\nfunction quantile(sorted: number[], q: number): number {\n  if (sorted.length === 0) return NaN\n  if (sorted.length === 1) return sorted[0]!\n  const pos = q * (sorted.length - 1)\n  const lo = Math.floor(pos)\n  const hi = Math.ceil(pos)\n  if (lo === hi) return sorted[lo]!\n  const frac = pos - lo\n  return sorted[lo]! * (1 - frac) + sorted[hi]! * frac\n}\n"],"mappings":";;;;;AAUO,IAAM,kBAAkB,CAAC,WAAuC;AAGhE,SAAS,aAAa,QAAsD;AACjF,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,aAAW,EAAE,OAAO,OAAO,KAAK,QAAQ;AACtC,UAAM,IAAI,UAAU;AACpB,mBAAe,QAAQ;AACvB,mBAAe;AAAA,EACjB;AACA,SAAO,cAAc,IAAI,cAAc,cAAc;AACvD;AAGO,SAAS,mBACd,QACA,aAAa,MACb,OAA8C,CAAC,GACC;AAChD,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,EAAE;AAC9D,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,MAAM,OAAO,CAAC,GAAI,OAAO,OAAO,CAAC,GAAI,OAAO,OAAO,CAAC,EAAG;AAEzF,QAAM,IAAI,OAAO;AACjB,QAAM,OAAO,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAEjD,QAAM,IAAI,KAAK,aAAa;AAC5B,QAAM,MAAM,QAAQ,KAAK,IAAI;AAC7B,QAAM,iBAA2B,CAAC;AAElC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,IACrC;AACA,mBAAe,KAAK,MAAM,CAAC;AAAA,EAC7B;AAEA,iBAAe,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAEnC,QAAM,QAAQ,IAAI;AAClB,QAAM,WAAW,KAAK,MAAO,QAAQ,IAAK,CAAC;AAC3C,QAAM,WAAW,KAAK,OAAO,IAAI,QAAQ,KAAK,CAAC,IAAI;AAEnD,SAAO;AAAA,IACL;AAAA,IACA,OAAO,eAAe,QAAQ;AAAA,IAC9B,OAAO,eAAe,KAAK,IAAI,UAAU,IAAI,CAAC,CAAC;AAAA,EACjD;AACF;AAQO,SAAS,sBAAsB,aAAqC;AACzE,MAAI,YAAY,SAAS,EAAG,QAAO;AAGnC,QAAM,eAAe,oBAAI,IAAwB;AACjD,aAAW,YAAY,aAAa;AAClC,eAAW,KAAK,UAAU;AACxB,UAAI,CAAC,aAAa,IAAI,EAAE,SAAS,EAAG,cAAa,IAAI,EAAE,WAAW,CAAC,CAAC;AACpE,YAAM,MAAM,aAAa,IAAI,EAAE,SAAS;AACxC,UAAI,IAAI,WAAW,KAAK,IAAI,IAAI,SAAS,CAAC,EAAG,UAAU,YAAY,QAAQ;AACzE,YAAI,KAAK,CAAC,EAAE,KAAK,CAAC;AAAA,MACpB,OAAO;AACL,YAAI,IAAI,SAAS,CAAC,EAAG,KAAK,EAAE,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAsB,CAAC;AAC7B,QAAM,YAAsB,CAAC;AAE7B,aAAW,SAAS,aAAa,OAAO,GAAG;AACzC,eAAW,WAAW,OAAO;AAC3B,UAAI,QAAQ,SAAS,EAAG;AACxB,iBAAW,KAAK,QAAS,WAAU,KAAK,CAAC;AACzC,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,iBAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AAC3C,oBAAU,MAAM,QAAQ,CAAC,IAAK,QAAQ,CAAC,MAAO,CAAC;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,UAAU,WAAW,KAAK,UAAU,SAAS,EAAG,QAAO;AAE3D,QAAM,uBAAuB,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAG9E,MAAI,uBAAuB;AAC3B,MAAI,gBAAgB;AACpB,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,aAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,+BAAyB,UAAU,CAAC,IAAK,UAAU,CAAC,MAAO;AAC3D;AAAA,IACF;AAAA,EACF;AACA,yBAAuB,gBAAgB,IAAI,uBAAuB,gBAAgB;AAElF,MAAI,yBAAyB,EAAG,QAAO;AACvC,SAAO,IAAI,uBAAuB;AACpC;AAMO,SAAS,aAAa,GAAa,GAAuC;AAC/E,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAE1D,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,EAAE;AAGb,QAAM,WAAW;AAAA,IACf,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,IAAa,EAAE;AAAA,IAC5C,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,IAAa,EAAE;AAAA,EAC9C,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AAG1B,QAAMA,SAAkB,IAAI,MAAM,SAAS,MAAM;AACjD,MAAI,IAAI;AACR,SAAO,IAAI,SAAS,QAAQ;AAC1B,QAAI,IAAI;AACR,WAAO,IAAI,SAAS,UAAU,SAAS,CAAC,EAAG,MAAM,SAAS,CAAC,EAAG,EAAG;AACjE,UAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,CAAAA,OAAM,CAAC,IAAI;AACvC,QAAI;AAAA,EACN;AAGA,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAI,SAAS,CAAC,EAAG,UAAU,IAAK,OAAMA,OAAM,CAAC;AAAA,EAC/C;AAEA,QAAM,KAAK,KAAM,MAAM,KAAK,KAAM;AAClC,QAAM,KAAK,KAAK,KAAK;AACrB,QAAM,IAAI,KAAK,IAAI,IAAI,EAAE;AAGzB,QAAM,KAAM,KAAK,KAAM;AACvB,QAAM,QAAQ,KAAK,KAAM,KAAK,MAAM,KAAK,KAAK,KAAM,EAAE;AAEtD,MAAI,UAAU,EAAG,QAAO,EAAE,GAAG,GAAG,EAAE;AAElC,QAAM,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAE7B,QAAM,IAAI,KAAK,IAAI,UAAU,CAAC;AAE9B,SAAO,EAAE,GAAG,EAAE;AAChB;AAGO,SAAS,cAAc,SAAiB,QAAwB;AACrE,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,MAAM,CAAC;AAClD;AAQO,SAAS,YACd,QACA,OACsC;AACtC,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI;AAAA,MACR,sCAAsC,OAAO,MAAM,OAAO,MAAM,MAAM;AAAA,IACxE;AAAA,EACF;AACA,QAAM,IAAI,OAAO;AACjB,MAAI,IAAI,EAAG,QAAO,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,EAAE;AAEtC,QAAM,QAAQ,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AAChD,QAAM,OAAO,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAChD,QAAM,WAAW,MAAM,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,SAAS,GAAG,CAAC,KAAK,IAAI;AAC3E,QAAM,KAAK,KAAK,KAAK,WAAW,CAAC;AACjC,MAAI,OAAO,EAAG,QAAO,EAAE,GAAG,SAAS,IAAI,IAAI,UAAU,IAAI,IAAI,GAAG,GAAG,SAAS,IAAI,IAAI,EAAE;AAEtF,QAAM,IAAI,OAAO;AACjB,QAAM,KAAK,IAAI;AACf,QAAM,IAAI,KAAK,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,EAAE;AAC9C,SAAO,EAAE,GAAG,IAAI,EAAE;AACpB;AAMO,SAAS,mBAAmB,QAAkB,OAA2C;AAC9F,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI;AAAA,MACR,6CAA6C,OAAO,MAAM,OAAO,MAAM,MAAM;AAAA,IAC/E;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,IAAI,CAAC,GAAGC,OAAM,MAAMA,EAAC,IAAK,CAAC,EAAE,OAAO,CAAC,MAAM,MAAM,CAAC;AACvE,QAAM,IAAI,MAAM;AAChB,MAAI,IAAI,EAAG,QAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAE/B,QAAM,WAAW,MACd,IAAI,CAAC,GAAGA,QAAO,EAAE,KAAK,KAAK,IAAI,CAAC,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,GAAAA,GAAE,EAAE,EAC3D,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAC/B,QAAMD,SAAkB,IAAI,MAAM,CAAC;AACnC,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACZ,QAAI,IAAI;AACR,WAAO,IAAI,KAAK,SAAS,CAAC,EAAG,QAAQ,SAAS,CAAC,EAAG,IAAK;AACvD,UAAM,OAAO,IAAI,IAAI,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,CAAAA,OAAM,SAAS,CAAC,EAAG,CAAC,IAAI;AACpD,QAAI;AAAA,EACN;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,MAAM,CAAC,IAAK,EAAG,UAASA,OAAM,CAAC;AAE/D,QAAM,OAAQ,KAAK,IAAI,KAAM;AAC7B,QAAM,WAAY,KAAK,IAAI,MAAM,IAAI,IAAI,KAAM;AAC/C,QAAM,KAAK,QAAQ,QAAQ,KAAK,KAAK,QAAQ;AAC7C,QAAM,IAAI,KAAK,IAAI,UAAU,KAAK,IAAI,CAAC,CAAC;AACxC,SAAO,EAAE,GAAG,OAAO,EAAE;AACvB;AAOO,SAAS,QAAQ,GAAa,GAAqB;AACxD,MAAI,EAAE,SAAS,KAAK,EAAE,SAAS,EAAG,QAAO;AACzC,QAAM,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AAC/C,QAAM,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AAC/C,QAAM,OAAO,EAAE,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,UAAU,GAAG,CAAC,KAAK,EAAE,SAAS;AAC3E,QAAM,OAAO,EAAE,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,UAAU,GAAG,CAAC,KAAK,EAAE,SAAS;AAC3E,QAAM,SAAS,KAAK;AAAA,MAChB,EAAE,SAAS,KAAK,QAAQ,EAAE,SAAS,KAAK,SAAS,EAAE,SAAS,EAAE,SAAS;AAAA,EAC3E;AACA,MAAI,WAAW,EAAG,QAAO;AACzB,UAAQ,QAAQ,SAAS;AAC3B;AAcO,SAAS,YAAY,QAAkB,OAAyB;AACrE,QAAM,IAAI,OAAO,SAAS,MAAM;AAChC,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,YAAY;AAChB,aAAW,KAAK,OAAO;AACrB,eAAW,KAAK,QAAQ;AACtB,UAAI,IAAI,EAAG,cAAa;AAAA,eACf,IAAI,EAAG,cAAa;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,YAAY;AACrB;AAOO,SAAS,gBAAgB,OAAgC;AAC9D,QAAM,IAAI,KAAK,IAAI,KAAK;AACxB,MAAI,IAAI,MAAO,QAAO;AACtB,MAAI,IAAI,KAAM,QAAO;AACrB,MAAI,IAAI,MAAO,QAAO;AACtB,SAAO;AACT;AAiBO,SAAS,MAAM,IAAwB;AAC5C,QAAM,UAAU,GAAG,IAAI,CAAC,GAAGC,QAAO,EAAE,GAAG,GAAAA,GAAE,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AACrE,QAAM,IAAI,IAAI,MAAc,GAAG,MAAM;AACrC,MAAI,IAAI;AACR,SAAO,IAAI,QAAQ,QAAQ;AACzB,QAAI,IAAI;AACR,WAAO,IAAI,IAAI,QAAQ,UAAU,QAAQ,IAAI,CAAC,EAAG,MAAM,QAAQ,CAAC,EAAG,EAAG;AACtE,UAAM,OAAO,IAAI,KAAK,IAAI;AAC1B,aAAS,IAAI,GAAG,KAAK,GAAG,IAAK,GAAE,QAAQ,CAAC,EAAG,CAAC,IAAI;AAChD,QAAI,IAAI;AAAA,EACV;AACA,SAAO;AACT;AAOO,SAAS,SAAS,GAAa,GAAqB;AACzD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAG,QAAO,OAAO;AACzD,QAAM,IAAI,EAAE;AACZ,QAAM,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAC7C,QAAM,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAC7C,MAAI,MAAM;AACV,MAAI,OAAO;AACX,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,WAAO,KAAK;AACZ,YAAQ,KAAK;AACb,YAAQ,KAAK;AAAA,EACf;AACA,MAAI,SAAS,KAAK,SAAS,EAAG,QAAO,SAAS,KAAK,SAAS,IAAI,IAAI;AACpE,SAAO,MAAM,KAAK,KAAK,OAAO,IAAI;AACpC;AAMO,SAAS,UAAU,GAAa,GAAqB;AAC1D,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAG,QAAO,OAAO;AACzD,SAAO,SAAS,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACpC;AA4BO,SAAS,kBAAkB,OAAwD;AACxF,QAAM,UAAU,OAAO,QAAQ,MAAM,OAAO;AAC5C,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,iEAA4D;AAAA,EAC9E;AACA,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,aAAW,CAAC,KAAK,MAAM,KAAK,SAAS;AACnC,QAAI,SAAS,GAAG;AACd,YAAM,IAAI,MAAM,kCAAkC,GAAG,kBAAkB,MAAM,GAAG;AAAA,IAClF;AACA,QAAI,EAAE,OAAO,MAAM,OAAO;AACxB,YAAM,IAAI;AAAA,QACR,0CAA0C,GAAG;AAAA,MAE/C;AAAA,IACF;AACA,mBAAe,MAAM,KAAK,GAAG,IAAK;AAClC,mBAAe;AAAA,EACjB;AACA,MAAI,gBAAgB,GAAG;AACrB,UAAM,IAAI,MAAM,mEAA8D;AAAA,EAChF;AACA,QAAM,YAAY,cAAc;AAChC,SAAO,MAAM,cAAc,SACvB,EAAE,UAAU,IACZ,EAAE,WAAW,MAAM,aAAa,MAAM,UAAU;AACtD;AAgFO,SAAS,0BACd,SACA,OAA+B,CAAC,GACT;AACvB,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,gBAAgB,sDAAsD;AAAA,EAClF;AAEA,QAAM,aAAa,oBAAI,IAAY;AACnC,QAAM,WAAW,oBAAI,IAAY;AAEjC,QAAM,OAAO,oBAAI,IAA8C;AAE/D,aAAW,KAAK,SAAS;AACvB,QAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAAG;AAC7B,YAAM,IAAI;AAAA,QACR,yDAAyD,EAAE,MAAM,WAAW,EAAE,SAAS,SAAS,EAAE,SAAS;AAAA,MAC7G;AAAA,IACF;AACA,eAAW,IAAI,EAAE,SAAS;AAC1B,aAAS,IAAI,EAAE,SAAS;AACxB,UAAM,UAAU,KAAK,IAAI,EAAE,SAAS,KAAK,oBAAI,IAAiC;AAC9E,UAAM,SAAS,QAAQ,IAAI,EAAE,SAAS,KAAK,oBAAI,IAAoB;AACnE,QAAI,OAAO,IAAI,EAAE,MAAM,GAAG;AACxB,YAAM,IAAI;AAAA,QACR,yDAAyD,EAAE,MAAM,WAAW,EAAE,SAAS,SAAS,EAAE,SAAS;AAAA,MAC7G;AAAA,IACF;AACA,WAAO,IAAI,EAAE,QAAQ,EAAE,KAAK;AAC5B,YAAQ,IAAI,EAAE,WAAW,MAAM;AAC/B,SAAK,IAAI,EAAE,WAAW,OAAO;AAAA,EAC/B;AAEA,QAAM,aAAa,KAAK,cAAc,CAAC,GAAG,QAAQ,EAAE,KAAK;AACzD,aAAW,KAAK,YAAY;AAC1B,QAAI,CAAC,SAAS,IAAI,CAAC,GAAG;AACpB,YAAM,IAAI;AAAA,QACR,yCAAyC,CAAC;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe,KAAK,SAAS,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,GAAG,UAAU,EAAE,KAAK;AAC3E,aAAW,KAAK,cAAc;AAC5B,QAAI,CAAC,WAAW,IAAI,CAAC,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,qCAAqC,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AACA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,IAAI;AAAA,MACR,uDAAkD,aAAa,MAAM;AAAA,IACvE;AAAA,EACF;AAEA,QAAM,eAA8C,CAAC;AACrD,QAAM,OAAiB,CAAC;AACxB,QAAM,SAAmB,CAAC;AAE1B,aAAW,OAAO,YAAY;AAC5B,UAAM,UAAU,KAAK,IAAI,GAAG;AAE5B,UAAM,kBAA0C,CAAC;AACjD,eAAW,KAAK,cAAc;AAC5B,YAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,sBAAgB,CAAC,IAAI,GAAG,QAAQ;AAAA,IAClC;AACA,UAAM,cAAc,aAAa,OAAO,CAAC,MAAM,gBAAgB,CAAC,MAAM,CAAC;AACvE,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,yCAAyC,GAAG,iCAAiC,YAAY,KAAK,IAAI,CAAC,aAAa,KAAK,UAAU,eAAe,CAAC;AAAA,MACjJ;AAAA,IACF;AAGA,QAAI,cAAkC;AACtC,eAAW,KAAK,cAAc;AAC5B,YAAM,MAAM,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAG,KAAK,CAAC;AAC1C,UAAI,gBAAgB,MAAM;AACxB,sBAAc;AAAA,MAChB,OAAO;AACL,cAAM,OAAoB;AAC1B,sBAAc,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;AAAA,MAC3D;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAI,eAAe,oBAAI,IAAY,CAAE,EAAE,KAAK;AACjE,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,yCAAyC,GAAG,SAAS,YAAY,MAAM,yBAAyB,aAAa,MAAM;AAAA,MACrH;AAAA,IACF;AAEA,UAAM,SAAqB,YAAY;AAAA,MAAI,CAAC,WAC1C,aAAa,IAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,EAAG,IAAI,MAAM,CAAE;AAAA,IACtD;AACA,UAAM,YAAY,oBAAoB,QAAQ,IAAI;AAClD,iBAAa,KAAK;AAAA,MAChB,GAAG;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,UAAU,CAAC,GAAG,YAAY;AAAA,IAC5B,CAAC;AACD,QAAI,OAAO,SAAS,UAAU,GAAG,EAAG,MAAK,KAAK,UAAU,GAAG;AAC3D,QAAI,OAAO,SAAS,UAAU,aAAa,EAAG,QAAO,KAAK,UAAU,aAAa;AAAA,EACnF;AAEA,QAAM,OAAO,CAAC,OACZ,GAAG,WAAW,IAAI,OAAO,MAAM,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AACpE,SAAO;AAAA,IACL;AAAA,IACA,YAAY,KAAK,IAAI;AAAA,IACrB,sBAAsB,KAAK,MAAM;AAAA,IACjC,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACF;AAUO,SAAS,yCACd,aACA,OAA+B,CAAC,GACT;AACvB,QAAM,UAA+B,CAAC;AACtC,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,EAAE,QAAQ,OAAO,KAAK,aAAa;AAC5C,QAAI,KAAK,IAAI,MAAM,GAAG;AACpB,YAAM,IAAI;AAAA,QACR,+DAA+D,MAAM;AAAA,MACvE;AAAA,IACF;AACA,SAAK,IAAI,MAAM;AACf,eAAW,KAAK,QAAQ;AACtB,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,WAAW,EAAE;AAAA,QACb,WAAW,EAAE;AAAA,QACb,OAAO,EAAE;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,0BAA0B,SAAS,IAAI;AAChD;AAGA,SAAS,YAAY,GAAW,IAAoB;AAClD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,KAAK,IAAK,QAAO,UAAU,CAAC;AAChC,QAAM,IAAI,MAAM,KAAK,IAAI;AACzB,QAAM,IAAI,KAAK;AACf,QAAM,IAAI;AACV,QAAM,KAAK,eAAe,GAAG,GAAG,CAAC;AACjC,SAAO,KAAK,IAAI,IAAI,MAAM,KAAK,MAAM;AACvC;AAGA,SAAS,eAAe,GAAW,GAAW,GAAmB;AAC/D,MAAI,KAAK,EAAG,QAAO;AACnB,MAAI,KAAK,EAAG,QAAO;AACnB,QAAM,SAAS,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;AACtD,QAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI;AACzE,QAAM,UAAU;AAChB,QAAM,MAAM;AACZ,MAAI,IAAI;AACR,MAAI,IAAI,KAAM,IAAI,KAAK,KAAM,IAAI;AACjC,MAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,MAAI,IAAI;AACR,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,UAAM,KAAK,IAAI;AACf,QAAI,MAAO,KAAK,IAAI,KAAK,MAAO,IAAI,KAAK,MAAM,IAAI;AACnD,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI;AACR,SAAK,IAAI;AACT,UAAM,GAAG,IAAI,MAAM,IAAI,IAAI,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK;AAC3D,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI;AACR,UAAM,QAAQ,IAAI;AAClB,SAAK;AACL,QAAI,KAAK,IAAI,QAAQ,CAAC,IAAI,IAAK;AAAA,EACjC;AACA,SAAO,QAAQ;AACjB;AAGA,SAAS,QAAQ,GAAmB;AAClC,QAAM,IAAI;AACV,QAAM,QAAQ;AAAA,IACZ;AAAA,IAAqB;AAAA,IAAmB;AAAA,IAAqB;AAAA,IAC7D;AAAA,IAAqB;AAAA,IAAoB;AAAA,IAAsB;AAAA,IAC/D;AAAA,EACF;AACA,MAAI,IAAI,KAAK;AACX,WAAO,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,QAAQ,IAAI,CAAC;AAAA,EAClE;AACA,OAAK;AACL,MAAI,IAAI,MAAM,CAAC;AACf,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,IAAK,MAAK,MAAM,CAAC,KAAM,IAAI;AACtD,QAAM,IAAI,IAAI,IAAI;AAClB,SAAO,MAAM,KAAK,IAAI,IAAI,KAAK,EAAE,KAAK,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC;AAC/E;AAGA,SAAS,UAAU,GAAmB;AACpC,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,IAAI;AAEV,QAAM,OAAO,IAAI,IAAI,KAAK;AAC1B,QAAM,OAAO,KAAK,IAAI,CAAC;AACvB,QAAM,IAAI,KAAK,IAAI,IAAI;AACvB,QAAM,IAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,KAAK,IAAK,CAAC,OAAO,OAAQ,CAAC;AAE9F,SAAO,OAAO,IAAI,OAAO;AAC3B;AAUO,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;AAQO,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;AAgBO,SAAS,iBAAiB,MAMtB;AACT,QAAM,EAAE,KAAK,IAAI,IAAI;AACrB,MAAI,MAAM,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG;AACvC,UAAM,IAAI,MAAM,wEAA8D,GAAG,KAAK,GAAG,GAAG;AAAA,EAC9F;AACA,QAAM,QAAQ,MAAM;AACpB,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,QAAQ,MAAM;AACpB,QAAM,SAAS,UAAU,WAAW,IAAI,QAAQ,IAAI,IAAI,KAAK;AAC7D,QAAM,QAAQ,UAAU,KAAK;AAC7B,QAAM,KACH,SAAS,KAAK,KAAK,KAAK,IAAI,QAAQ,KAAK,KAAK,KAAK,IAAI,GAAG,QAAQ,QAAQ,KAAK,CAAC,MAAM,KACtF,QAAQ;AACX,SAAO,KAAK,KAAK,CAAC;AACpB;AAOO,SAAS,aAAa,MAMlB;AACT,QAAM,EAAE,KAAK,KAAK,OAAO,IAAI;AAC7B,MAAI,MAAM,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG;AACvC,UAAM,IAAI,MAAM,oEAA0D,GAAG,KAAK,GAAG,GAAG;AAAA,EAC1F;AACA,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,QAAQ,MAAM;AACpB,MAAI,UAAU,KAAK,UAAU,EAAG,QAAO;AACvC,QAAM,QAAQ,MAAM;AACpB,QAAM,SAAS,UAAU,WAAW,IAAI,QAAQ,IAAI,IAAI,KAAK;AAC7D,QAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,OAAO,QAAQ,QAAQ,KAAK,CAAC;AAC9D,QAAM,SAAS,KAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,SAAS,KAAK,KAAK,KAAK,KAAK;AAClF,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,KAAK,CAAC,CAAC;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;AAUO,SAAS,KACd,SACA,QAAQ,MACwC;AAChD,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,SAAS,GAAG;AACvD,UAAM,IAAI,gBAAgB,qCAAqC,KAAK,EAAE;AAAA,EACxE;AACA,aAAW,CAAC,OAAO,MAAM,KAAK,QAAQ,QAAQ,GAAG;AAC/C,QAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,KAAK,SAAS,GAAG;AACxD,YAAM,IAAI,gBAAgB,iBAAiB,KAAK,2BAA2B,MAAM,EAAE;AAAA,IACrF;AAAA,EACF;AACA,QAAM,QAAQ,QAAQ;AACtB,MAAI,UAAU,EAAG,QAAO,EAAE,UAAU,CAAC,GAAG,aAAa,CAAC,EAAE;AAExD,QAAM,UAAU,QACb,IAAI,CAAC,QAAQ,WAAW,EAAE,QAAQ,MAAM,EAAE,EAC1C,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK;AAC1D,QAAM,WAAW,IAAI,MAAc,KAAK;AACxC,MAAI,WAAW;AACf,WAAS,OAAO,GAAG,OAAO,OAAO,QAAQ;AACvC,UAAM,QAAQ,QAAQ,IAAI;AAC1B,UAAM,eAAe,KAAK,IAAI,GAAG,MAAM,UAAU,QAAQ,KAAK;AAC9D,eAAW,KAAK,IAAI,UAAU,YAAY;AAC1C,aAAS,MAAM,KAAK,IAAI;AAAA,EAC1B;AAEA,SAAO,EAAE,UAAU,aAAa,SAAS,IAAI,CAAC,WAAW,UAAU,KAAK,EAAE;AAC5E;AAMO,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;AAC7B,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;AAsCO,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,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,MAAM,IAAI,MAAc,CAAC;AAC/B,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;AAoCO,SAAS,eACd,aACA,aACsB;AACtB,MAAI,gBAAgB,aAAa,gBAAgB,QAAQ;AACvD,UAAM,IAAI;AAAA,MACR,gEAAgE,WAAW;AAAA,IAC7E;AAAA,EACF;AAEA,MAAI,WAAW;AACf,MAAI,WAAW;AACf,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,UAAM,aAAa,YAAY,CAAC;AAChC,QAAI,CAAC,OAAO,SAAS,UAAU,GAAG;AAChC,YAAM,IAAI;AAAA,QACR,uCAAuC,CAAC,wBAAwB,UAAU;AAAA,MAC5E;AAAA,IACF;AACA,QAAI,aAAa,EAAG;AAAA,aACX,aAAa,EAAG;AAAA,QACpB;AAAA,EACP;AAEA,QAAM,WAAW,WAAW;AAC5B,QAAM,YAAY,gBAAgB,YAAY,WAAW;AACzD,SAAO;AAAA,IACL,GAAG,YAAY;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,sBAAsB,WAAW,QAAQ;AAAA,EACnD;AACF;AA+BO,SAAS,OAAO,WAAmB,GAAW,aAAa,MAA0B;AAC1F,MAAI,KAAK,EAAG,QAAO,EAAE,UAAU,GAAG,OAAO,GAAG,OAAO,EAAE;AACrD,MAAI,YAAY,KAAK,YAAY,GAAG;AAClC,UAAM,IAAI,MAAM,sBAAsB,SAAS,oBAAoB,CAAC,GAAG;AAAA,EACzE;AACA,QAAM,IAAI,UAAU,KAAK,IAAI,cAAc,CAAC;AAC5C,QAAM,IAAI,YAAY;AACtB,QAAM,KAAK,IAAI;AACf,QAAM,QAAQ,IAAI,KAAK;AACvB,QAAM,UAAU,IAAI,MAAM,IAAI,MAAM;AACpC,QAAM,OAAQ,IAAI,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAK;AACjE,SAAO;AAAA,IACL,UAAU;AAAA,IACV,OAAO,KAAK,IAAI,GAAG,SAAS,IAAI;AAAA,IAChC,OAAO,KAAK,IAAI,GAAG,SAAS,IAAI;AAAA,EAClC;AACF;AA8BO,SAAS,QACd,SACA,WACe;AACf,MAAI,QAAQ,WAAW,UAAU,QAAQ;AACvC,UAAM,IAAI,MAAM,kCAAkC,QAAQ,MAAM,OAAO,UAAU,MAAM,GAAG;AAAA,EAC5F;AACA,QAAM,IAAI,QAAQ;AAClB,MAAI,IAAI;AACR,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,OAAO,QAAQ,CAAC,IAAI,IAAI;AAC9B,UAAM,QAAQ,UAAU,CAAC,IAAI,IAAI;AACjC,QAAI,UAAU,KAAK,SAAS,EAAG;AAAA,aACtB,UAAU,KAAK,SAAS,EAAG;AAAA,EACtC;AACA,QAAM,cAAc,IAAI;AACxB,QAAM,YAAY,gBAAgB,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,MAAM,IAAI;AACvE,SAAO,EAAE,GAAG,aAAa,GAAG,GAAG,WAAW,QAAQ,qBAAqB,GAAG,CAAC,EAAE;AAC/E;AA4BO,SAAS,qBACd,SACA,WACA,aAAa,MACS;AACtB,MAAI,QAAQ,WAAW,UAAU,QAAQ;AACvC,UAAM,IAAI;AAAA,MACR,+CAA+C,QAAQ,MAAM,OAAO,UAAU,MAAM;AAAA,IACtF;AAAA,EACF;AACA,QAAM,IAAI,QAAQ;AAClB,MAAI,MAAM,EAAG,QAAO,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,gBAAgB,GAAG,OAAO,GAAG,OAAO,GAAG,WAAW;AAC1F,MAAI,IAAI;AACR,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,OAAO,QAAQ,CAAC,IAAI,IAAI;AAC9B,UAAM,QAAQ,UAAU,CAAC,IAAI,IAAI;AACjC,QAAI,UAAU,KAAK,SAAS,EAAG;AAAA,aACtB,UAAU,KAAK,SAAS,EAAG;AAAA,EACtC;AACA,QAAM,MAAM,IAAI,KAAK;AACrB,QAAM,YAAY,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI;AACnD,QAAM,IAAI,UAAU,KAAK,IAAI,cAAc,CAAC;AAC5C,QAAM,OAAO,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,QAAQ,CAAC;AAChD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,gBAAgB;AAAA,IAChB,OAAO,KAAK,IAAI,IAAI,KAAK,IAAI;AAAA,IAC7B,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,IAC5B;AAAA,EACF;AACF;AAYO,SAAS,QAAQ,GAAW,GAAW,GAAmB;AAC/D,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,GAAG;AACxE,UAAM,IAAI,MAAM,4CAA4C,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG;AAAA,EAClF;AACA,MAAI,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG;AACpC,UAAM,IAAI,MAAM,uEAAmD,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG;AAAA,EACzF;AACA,MAAI,IAAI,IAAI,EAAG,QAAO;AACtB,MAAI,OAAO;AACX,WAAS,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,IAAK,SAAQ,IAAI,IAAI;AACrD,SAAO,IAAI;AACb;AAQA,SAAS,qBAAqB,GAAW,GAAmB;AAC1D,QAAM,KAAK,IAAI;AACf,MAAI,OAAO,EAAG,QAAO;AACrB,SAAO,KAAK,IAAI,GAAG,IAAI,sBAAsB,KAAK,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;AAClE;AAGA,SAAS,sBAAsB,WAAmB,GAAmB;AACnE,MAAI,aAAa,EAAG,QAAO;AAC3B,MAAI,YAAY,EAAG,QAAO;AAK1B,MAAI,aAAa,IAAI,GAAG;AACtB,WAAO,KAAK,IAAI,GAAG,IAAI,sBAAsB,YAAY,GAAG,CAAC,CAAC;AAAA,EAChE;AACA,SAAO,sBAAsB,IAAI,WAAW,CAAC;AAC/C;AAGA,SAAS,sBAAsB,cAAsB,GAAmB;AACtE,MAAI,eAAe,EAAG,QAAO;AAC7B,MAAI,gBAAgB,EAAG,QAAO;AAC9B,MAAI,iBAAiB,EAAG,QAAO,KAAK,CAAC;AAErC,QAAM,WAAW,IAAI,KAAK,IAAI,GAAG;AACjC,MAAI,UAAU,OAAO;AACrB,WAAS,IAAI,GAAG,KAAK,cAAc,KAAK;AACtC,UAAM,YAAY,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC;AACrE,cAAU,UAAU,SAAS,YAAY,QAAQ;AAAA,EACnD;AACA,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,CAAC;AACtC;AAEA,SAAS,UAAU,GAAW,GAAmB;AAC/C,MAAI,MAAM,OAAO,kBAAmB,QAAO;AAC3C,MAAI,MAAM,OAAO,kBAAmB,QAAO;AAC3C,QAAM,MAAM,KAAK,IAAI,GAAG,CAAC;AACzB,QAAM,MAAM,KAAK,IAAI,GAAG,CAAC;AACzB,SAAO,MAAM,KAAK,MAAM,KAAK,IAAI,MAAM,GAAG,CAAC;AAC7C;AAuEO,SAAS,SAAS,OAAwB,CAAC,GAAa;AAC7D,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,SAAS,KAAK,UAAU;AAC9B,QAAM,WAAW,KAAK,YAAY;AAClC,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,SAAS,GAAG;AACvD,UAAM,IAAI,gBAAgB,yCAAyC,KAAK,EAAE;AAAA,EAC5E;AACA,MAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,YAAY,KAAK,YAAY,GAAG;AAChE,UAAM,IAAI,gBAAgB,4CAA4C,QAAQ,EAAE;AAAA,EAClF;AACA,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,KAAK,UAAU,IAAI,UAAU;AACrE,UAAM,IAAI;AAAA,MACR,+CAA+C,IAAI,UAAU,QAAQ,CAAC,CAAC,0CACvC,MAAM;AAAA,IACxC;AAAA,EACF;AACA,QAAM,YAAY,IAAI;AACtB,MAAI,SAAS;AACb,MAAI,IAAI;AACR,MAAI,UAAU;AACd,MAAI;AAGJ,MAAI,OAAO;AACX,MAAI,SAAS;AACb,SAAO;AAAA,IACL,OAAO,GAAyB;AAC9B,UAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG;AAClE,cAAM,IAAI;AAAA,UACR,+DAA+D,CAAC;AAAA,QAClE;AAAA,MACF;AAEA,YAAM,UAAU,MAAM,SAAS,IAAI;AACnC,YAAM,WAAW,OAAO,WAAW,IAAI;AACvC,YAAM,OAAO,SAAS;AACtB,YAAM,SAAS,KAAK,IAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,UAAU,OAAO,KAAK,CAAC;AAC3E,gBAAU,IAAI,UAAU,IAAI;AAC5B,WAAK;AACL,cAAQ;AACR,YAAM,SAAS,MAAM,SAAS,IAAI;AAClC,iBAAW,IAAI,UAAU;AACzB,UAAI,CAAC,WAAW,UAAU,WAAW;AACnC,kBAAU;AACV,qBAAa;AAAA,MACf;AACA,aAAO,EAAE,QAAQ,GAAG,QAAQ;AAAA,IAC9B;AAAA,IACA,QAAuB;AACrB,aAAO,EAAE,QAAQ,GAAG,SAAS,OAAO,QAAQ,UAAU,WAAW,WAAW;AAAA,IAC9E;AAAA,EACF;AACF;AAKA,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;AAEA,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;AAEA,SAAS,QAAQ,MAAwC;AACvD,MAAI,SAAS,OAAW,QAAO,KAAK;AACpC,SAAO,WAAW,IAAI;AACxB;AAMO,SAAS,WAAW,MAA4B;AACrD,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;;;AC36CO,SAAS,eACd,QACA,WACmB;AACnB,QAAM,MAAM,oBAAI,IAAsC;AACtD,aAAW,KAAK,OAAQ,KAAI,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAAC;AACrE,aAAW,KAAK,WAAW;AACzB,UAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;AAC9B,QAAI,MAAO,OAAM,IAAI,EAAE;AAAA,EACzB;AACA,QAAM,SAAS,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC;AACnE,QAAM,IAAI,OAAO;AACjB,MAAI,IAAI,GAAG;AACT,WAAO,EAAE,GAAG,SAAS,KAAK,OAAO,KAAK,KAAK,KAAK,YAAY,CAAC,EAAE;AAAA,EACjE;AACA,QAAM,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;AACpC,QAAM,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;AACpC,QAAM,UAAU,SAAS,QAAQ,MAAM;AACvC,QAAM,QAAQ,cAAc,OAAO,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,CAAC;AAC1E,QAAM,WAAW,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AACtD,QAAM,MAAM,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAClD,QAAM,QAAQ,CAAC,GAAG,IAAI,QAAQ,CAAC,EAC5B,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC,EACtC,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EACrF,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,CAAC;AACb,SAAO,EAAE,GAAG,SAAS,OAAO,KAAK,YAAY,MAAM;AACrD;AAeO,SAAS,eAAe,QAAgD;AAC7E,QAAM,QAAQ,oBAAI,IAAiD;AACnE,aAAW,KAAK,QAAQ;AACtB,UAAM,OAAO,MAAM,IAAI,EAAE,MAAM,KAAK,CAAC;AACrC,QAAI,EAAE,qBAAqB,QAAS,MAAK,QAAQ,EAAE;AAAA,aAC1C,EAAE,qBAAqB,SAAU,MAAK,SAAS,EAAE;AAC1D,UAAM,IAAI,EAAE,QAAQ,IAAI;AAAA,EAC1B;AACA,QAAM,SAAmB,CAAC;AAC1B,aAAW,EAAE,OAAO,OAAO,KAAK,MAAM,OAAO,GAAG;AAC9C,QAAI,UAAU,UAAa,WAAW,OAAW,QAAO,KAAK,QAAQ,MAAM;AAAA,EAC7E;AACA,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,UAAU,GAAG,GAAG,EAAE;AACpD,SAAO,EAAE,UAAU,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO,QAAQ,GAAG,OAAO,OAAO;AACzF;AAQO,SAAS,cACd,SACqB;AACrB,QAAM,IAAI,QAAQ;AAClB,MAAI,IAAI,EAAG,QAAO,EAAE,SAAS,KAAK,EAAE;AACpC,SAAO;AAAA,IACL,SAAS;AAAA,MACP,QAAQ,IAAI,CAAC,MAAM,EAAE,SAAS;AAAA,MAC9B,QAAQ,IAAI,CAAC,MAAM,EAAE,KAAK;AAAA,IAC5B;AAAA,IACA;AAAA,EACF;AACF;AAeO,SAAS,eACd,SACsB;AACtB,QAAM,MAAM,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAChE,QAAM,OAAO,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAClE,MAAI,IAAI,WAAW,KAAK,KAAK,WAAW;AACtC,WAAO,EAAE,cAAc,GAAG,iBAAiB,GAAG,WAAW,GAAG,GAAG,EAAE;AACnE,QAAM,SAAS,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI;AACpD,QAAM,UAAU,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK;AACvD,SAAO;AAAA,IACL,cAAc;AAAA,IACd,iBAAiB;AAAA,IACjB,WAAW,SAAS;AAAA,IACpB,GAAG,QAAQ;AAAA,EACb;AACF;AAKA,SAAS,cAAc,GAAa,GAAqB;AACvD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAG,QAAO;AACpD,QAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;AAC/B,QAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;AAC/B,QAAM,IAAI,MAAM,MAAM;AACtB,MAAI,IAAI,EAAG,QAAO;AAClB,QAAM,WAAuB,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;AACjF,QAAM,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACnC,QAAM,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,UAAM,MAAM,SAAS,EAAE;AACvB,QAAI,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK;AAC3B,YAAQ,EAAE;AACV,YAAQ,EAAE;AAAA,EACZ;AACA,MAAI,MAAM;AACV,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;AACpC,YAAM,WAAY,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAK,EAAE;AAC/C,aAAO,IAAI,SAAS,CAAC,EAAG,CAAC;AACzB,aAAO,IAAI;AAAA,IACb;AAAA,EACF;AACA,MAAI,QAAQ,EAAG,QAAO;AACtB,SAAO,IAAI,MAAM;AACnB;AAqEO,SAAS,oBACd,QACA,OAAmC,CAAC,GACf;AACrB,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,UAAU,KAAK,WAAW;AAEhC,QAAM,SAAS,OAAO,OAAO,CAAC,QAAQ,IAAI,UAAU,KAAK,IAAI,MAAM,CAAC,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC;AAC7F,QAAM,SAAS,OAAO,CAAC,GAAG,UAAU;AAEpC,QAAM,QAAQ,OAAO,OAAO,CAAC,QAAQ,IAAI,WAAW,MAAM;AAC1D,QAAM,SAAS,MAAM;AAErB,MAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,WAAO;AAAA,MACL,eAAe;AAAA,MACf,KAAK;AAAA,MACL,SAAS;AAAA,MACT,UAAU;AAAA,MACV,IAAI,EAAE,KAAK,CAAC,KAAK,GAAG,GAAG,eAAe,CAAC,KAAK,GAAG,EAAE;AAAA,MACjD,GAAG;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,wBAAwB,OAAO,OAAO;AACpD,QAAM,MAAM,MAAM,KAAK;AACvB,QAAM,UAAU,YAAY,OAAO,QAAQ;AAC3C,QAAM,WAAW,YAAY,OAAO,SAAS;AAE7C,QAAM,QAA0B,CAAC,KAAK,GAAG;AACzC,QAAM,UAA4B,CAAC,KAAK,GAAG;AAC3C,MAAI,YAAY,GAAG;AACjB,UAAM,MAAMC,YAAW,IAAI;AAC3B,UAAM,OAAiB,CAAC;AACxB,UAAM,SAAmB,CAAC;AAC1B,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,YAAM,SAAqB,IAAI,MAAM,MAAM;AAC3C,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAO,CAAC,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC;AAAA,MAC9C;AACA,YAAM,OAAO,MAAM,MAAM;AACzB,YAAM,KAAK,wBAAwB,QAAQ,OAAO;AAClD,UAAI,OAAO,SAAS,IAAI,EAAG,MAAK,KAAK,IAAI;AACzC,UAAI,OAAO,SAAS,EAAE,EAAG,QAAO,KAAK,EAAE;AAAA,IACzC;AACA,UAAM,CAAC,IAAI,EAAE,IAAI,iBAAiB,OAAO;AACzC,QAAI,KAAK,SAAS,GAAG;AACnB,WAAK,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACzB,YAAM,CAAC,IAAI,SAAS,MAAM,EAAE;AAC5B,YAAM,CAAC,IAAI,SAAS,MAAM,EAAE;AAAA,IAC9B;AACA,QAAI,OAAO,SAAS,GAAG;AACrB,aAAO,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC3B,cAAQ,CAAC,IAAI,SAAS,QAAQ,EAAE;AAChC,cAAQ,CAAC,IAAI,SAAS,QAAQ,EAAE;AAAA,IAClC;AAAA,EACF;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,EAAE,KAAK,OAAO,eAAe,QAAQ;AAAA,IACzC,GAAG;AAAA,IACH;AAAA,EACF;AACF;AAmBO,SAAS,yBACd,QACA,WACA,OAAmC,CAAC,GACP;AAC7B,QAAM,OAAO,eAAe,QAAQ,SAAS;AAC7C,QAAM,MAAM,oBAAI,IAAsC;AACtD,aAAW,KAAK,OAAQ,KAAI,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAAC;AACrE,aAAW,KAAK,WAAW;AACzB,UAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;AAC9B,QAAI,MAAO,OAAM,IAAI,EAAE;AAAA,EACzB;AACA,QAAM,OAAmB,CAAC;AAC1B,aAAW,KAAK,IAAI,OAAO,GAAG;AAC5B,QAAI,OAAO,SAAS,EAAE,CAAC,EAAG,MAAK,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,EAChD;AACA,QAAM,YAAY,oBAAoB,MAAM,IAAI;AAChD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,yBAAyB,UAAU;AAAA,IACnC,KAAK,UAAU;AAAA,IACf,UAAU,UAAU;AAAA,IACpB,IAAI,UAAU;AAAA,EAChB;AACF;AAgBA,SAAS,wBAAwB,MAAkB,QAAwC;AACzF,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,SAAS,KAAK,CAAC,EAAG;AACxB,MAAI,SAAS,EAAG,QAAO;AACvB,QAAM,MACJ,WAAW,WACP,CAAC,GAAW,MAAc,KAAK,IAAI,IAAI,CAAC,IACxC,CAAC,GAAW,OAAe,IAAI,MAAM;AAC3C,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,WAAS,KAAK,GAAG,KAAK,QAAQ,MAAM;AAClC,aAAS,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;AACvC,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAE;AACpC,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAE;AACpC,YAAM,IAAI,EAAE;AACZ,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,IAAI,EAAE,CAAC,GAAI,EAAE,CAAC,CAAE;AACnD,aAAO;AAEP,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,IAAI,EAAE,CAAC,GAAI,EAAE,CAAC,CAAE;AAAA,MACrD;AACA,aAAO,IAAI;AACX,UAAI,QAAQ,GAAG;AAGb,eAAO,QAAQ,IAAI,IAAI;AAAA,MACzB,OAAO;AACL,eAAO,IAAI,MAAM;AAAA,MACnB;AACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,UAAU,IAAI,MAAM,MAAM;AACnC;AAUA,SAAS,MAAM,MAA0B;AACvC,QAAM,IAAI,KAAK;AACf,MAAI,IAAI,EAAG,QAAO;AAClB,QAAM,IAAI,KAAK,CAAC,EAAG;AACnB,MAAI,IAAI,EAAG,QAAO;AAGlB,QAAM,WAAW,KAAK,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC;AAErE,QAAM,WAAW,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACpC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,MAAK,KAAK,CAAC,EAAG,CAAC;AAC3C,aAAS,CAAC,IAAI,IAAI;AAAA,EACpB;AAEA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,UAAS,SAAS,CAAC;AAC/C,WAAS;AAET,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,SAAQ,SAAS,CAAC,IAAK,UAAU;AAC7D,SAAO;AACP,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,SAAQ,SAAS,CAAC,IAAK,UAAU;AAC7D,SAAO;AACP,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,SAAQ,KAAK,CAAC,EAAG,CAAC,IAAK,UAAU;AAAA,EAC/D;AACA,QAAM,MAAM,MAAM,MAAM;AAExB,QAAM,MAAM,IAAI;AAChB,QAAM,MAAM,IAAI;AAChB,QAAM,OAAO,IAAI,MAAM,IAAI;AAC3B,QAAM,MAAM,MAAM;AAClB,QAAM,MAAM,MAAM;AAClB,QAAM,MAAM,MAAM,IAAI,MAAM,MAAM;AAElC,QAAM,QAAQ,OAAO,IAAI,KAAK,MAAO,KAAK,MAAM,OAAQ;AACxD,MAAI,UAAU,GAAG;AAGf,WAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI;AAAA,EACtC;AACA,UAAQ,MAAM,OAAO;AACvB;AAGA,SAAS,YAAY,MAAkB,IAAkD;AACvF,QAAM,IAAI,KAAK,CAAC,GAAG,UAAU;AAC7B,MAAI,IAAI,EAAG,QAAO;AAClB,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAE;AACnC,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAE;AACnC,YAAM,IAAI,GAAG,GAAG,CAAC;AACjB,UAAI,OAAO,SAAS,CAAC,GAAG;AACtB,eAAO;AACP;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,UAAU,IAAI,MAAM,MAAM;AACnC;AAGA,SAASA,YAAW,MAA4B;AAC9C,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,iBAAiB,SAAmC;AAC3D,QAAM,QAAQ,IAAI,WAAW;AAC7B,SAAO,CAAC,MAAM,IAAI,IAAI;AACxB;AAGA,SAAS,SAAS,QAAkB,GAAmB;AACrD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,OAAO,WAAW,EAAG,QAAO,OAAO,CAAC;AACxC,QAAM,MAAM,KAAK,OAAO,SAAS;AACjC,QAAM,KAAK,KAAK,MAAM,GAAG;AACzB,QAAM,KAAK,KAAK,KAAK,GAAG;AACxB,MAAI,OAAO,GAAI,QAAO,OAAO,EAAE;AAC/B,QAAM,OAAO,MAAM;AACnB,SAAO,OAAO,EAAE,KAAM,IAAI,QAAQ,OAAO,EAAE,IAAK;AAClD;","names":["ranks","i","mulberry32"]}

package/dist/chunk-ZVCHKKOP.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/campaign/run-campaign.ts","../src/integrity/backend-integrity.ts","../src/verdict-cache.ts","../src/campaign/coverage.ts","../src/campaign/run-dir.ts","../src/campaign/storage.ts","../src/campaign/search-ledger-file.ts","../src/campaign/atomic-file-lock.ts","../src/campaign/search-ledger-errors.ts"],"sourcesContent":["/**\n * `runCampaign` — Pass A substrate primitive. ONE function that orchestrates\n * scenarios → dispatch → artifacts → judges → aggregates, with full\n * reproducibility (seed + manifest hash), cell-level resumability, bootstrap\n * CIs, and the `LabeledScenarioStore` capture flywheel.\n *\n * Improvement loops (optimizer / gate / autoOnPromote) ride on top of this\n * primitive but live in `presets/run-improvement-loop.ts`. This file keeps\n * the core orchestrator minimal — Phase 1 of the Pass A track.\n */\n\nimport { join } from 'node:path'\nimport {\n  CostAccountingIncompleteError,\n  type CostLedgerHandle,\n  type CostLedgerSummary,\n} from '../cost-ledger'\nimport { BackendIntegrityError, type BackendIntegrityReport } from '../integrity/backend-integrity'\nimport { confidenceInterval } from '../statistics'\nimport { contentHash } from '../verdict-cache'\nimport { assertCampaignDesign, campaignScenarioIdentity, campaignSplitDigest } from './coverage'\nimport { resolveRunDir } from './run-dir'\nimport { type CampaignStorage, createRunCostLedger, fsCampaignStorage } from './storage'\nimport type {\n  CampaignAggregates,\n  CampaignArtifactWriter,\n  CampaignCellResult,\n  CampaignCostMeter,\n  CampaignResult,\n  CampaignTokenUsage,\n  CampaignTraceWriter,\n  DispatchContext,\n  DispatchFn,\n  JudgeAggregate,\n  JudgeConfig,\n  JudgeScore,\n  LabeledScenarioStore,\n  Scenario,\n  ScenarioAggregate,\n  TraceSpan,\n} from './types'\n\nexport interface RunCampaignOptions<TScenario extends Scenario, TArtifact> {\n  scenarios: TScenario[]\n  dispatch: DispatchFn<TScenario, TArtifact>\n  /** Abort active dispatches when the owning operation is cancelled. */\n  signal?: AbortSignal\n  /**\n   * Stable identity for the dispatch behavior, included in the manifest/cache\n   * key. Set this when the same function name can run different models,\n   * prompts, tools, or external config.\n   */\n  dispatchRef?: string\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** Required for reproducibility. Default 42. */\n  seed?: number\n  /** Per-scenario replicates for CI bands. Default 1; raise to 5+ for\n   *  bootstrap-tight intervals on critical eval. */\n  reps?: number\n  /** When true (default), completed cells are cached by\n   *  (manifestHash, scenarioId, rep, generation). Re-runs skip cached cells. */\n  resumable?: boolean\n  /** Optional store — when present, every artifact + judge score is captured\n   *  with the configured `captureSource`. Capture is default ON; pass `'off'`\n   *  to disable. */\n  labeledStore?: LabeledScenarioStore | 'off'\n  captureSource?: 'production-trace' | 'eval-run' | 'manual' | 'red-team' | 'synthetic'\n  captureSourceVersionHash?: string\n  /** Hard spend cap. Each paid call reserves its enforced maximum before dispatch. */\n  costCeiling?: number\n  /** Shared spend account. Improvement loops pass one ledger through every\n   *  campaign so the ceiling and returned total are run-wide. */\n  costLedger?: CostLedgerHandle\n  /** Attribution label for receipts recorded by this campaign. */\n  costPhase?: string\n  /** Additional immutable receipt tags supplied by an owning workflow. */\n  costTags?: Readonly<Record<string, string>>\n  /** Max concurrent cells. Default 2. */\n  maxConcurrency?: number\n  /**\n   * Stop after the first dispatch or judge error. The failed cell is persisted\n   * before active sibling cells are aborted and drained, then the campaign\n   * rejects with the exact error thrown by that dispatch or judge.\n   * Default false preserves the normal behavior of returning failed cells and\n   * continuing the remaining schedule.\n   */\n  abortOnCellError?: boolean\n  /**\n   * Per-cell dispatch deadline in ms. A `dispatch` that neither resolves nor\n   * rejects within this window is a hang (a stalled model request, an\n   * exhausted runtime resource, a backend that never closes its stream). When\n   * set, the cell's `ctx.signal` is aborted. A dispatch that stops is recorded\n   * as an error (`dispatch exceeded <N>ms`). A dispatch that ignores\n   * cancellation rejects the campaign without publishing incomplete cost data.\n   * `undefined`/`0` means unbounded.\n   */\n  dispatchTimeoutMs?: number\n  /**\n   * Time allowed for an aborted dispatch and its paid calls to stop before the\n   * campaign rejects without producing a result. Default 5 seconds.\n   */\n  dispatchShutdownTimeoutMs?: number\n  /** Required: where artifacts + traces land. A bare name (not an absolute path)\n   *  resolves to the shared `~/.tangle/traces/<repo>/runs/<name>` root so run\n   *  bundles never pollute a repo working tree. Pass an absolute path to override. */\n  runDir: string\n  /** Subject repo for the shared run-dir root (defaults to the CWD basename).\n   *  Only consulted when `runDir` is a bare name. */\n  repo?: string\n  /** Tracing posture. Default is the substrate's `FileSystemTraceStore` rooted\n   *  at `<runDir>/traces/`. `'off'` disables capture entirely — substrate\n   *  refuses this when the caller wires `autoOnPromote !== 'none'`. */\n  tracing?: 'on' | 'off'\n  /**\n   * Per-cell usage expectation — the early, fine-grained sibling of the\n   * batch `assertRealBackend` guard. A cell that produced an artifact (no\n   * error) but reported `costUsd === 0` AND zero tokens is a stub: the\n   * dispatch never reported LLM activity via `ctx.cost`. Modes:\n   *   - `'warn'` (default) — log the offending cell loudly, keep going.\n   *   - `'assert'` — throw `BackendIntegrityError` on the first such cell\n   *     (fail-fast; recommended for CI campaigns expecting real LLM calls).\n   *   - `'off'` — no check (replay / deterministic-only / offline analysis).\n   */\n  expectUsage?: 'assert' | 'warn' | 'off'\n  /** Test seam — override the wall clock for deterministic tests. */\n  now?: () => Date\n  /** Test seam — override per-cell trace writer factory. */\n  buildTraceWriter?: (cellId: string, dir: string) => CampaignTraceWriter\n  /** Storage backend for run/cell dirs, the resumability cache, artifacts,\n   *  and trace spans. Default: the Node filesystem (`fsCampaignStorage`).\n   *  Pass `inMemoryCampaignStorage()` to run in a filesystem-less runtime\n   *  (Cloudflare Workers, Deno, edge) — the `CampaignResult` is still\n   *  produced; artifacts/traces just aren't persisted to disk. */\n  storage?: CampaignStorage\n  /**\n   * Optional per-cell placement strategy. Returns an opaque string the\n   * substrate forwards as `ctx.placement` to the Dispatch — placement-aware\n   * Dispatches (e.g. `httpDispatch` from `/adapters/http`) use it to route\n   * each cell to the right worker, region, or sandbox. When unset, every\n   * cell receives `ctx.placement = undefined` and behaves identically to\n   * the in-process case.\n   *\n   * @example\n   *   cellPlacement: ({ scenario }) => scenario.tags?.includes('eu') ? 'eu-west' : 'us-east'\n   */\n  cellPlacement?: (input: {\n    scenario: TScenario\n    rep: number\n    generation?: number\n  }) => string | undefined\n}\n\n/** Durable `<cell>/failure-receipt.json` written before a failed cell can\n * trigger campaign-wide cancellation. The cell keeps its dispatch-only usage\n * fields for compatibility; `cost` covers every settled agent and judge call\n * attributed to this exact run attempt. */\nexport interface CampaignCellFailureReceipt<TArtifact = unknown> {\n  schemaVersion: 1\n  runAttemptId: string\n  recordedAt: string\n  failure: {\n    stage: 'dispatch' | 'judge'\n    judge?: string\n    error: {\n      name: string\n      message: string\n      stack?: string\n    }\n  }\n  cell: CampaignCellResult<TArtifact>\n  cost: CostLedgerSummary\n}\n\n/**\n * Core campaign orchestrator: fan scenarios through dispatch, score with judges, aggregate bootstrap CIs, and persist reproducible `CampaignResult` records.\n */\nexport async function runCampaign<TScenario extends Scenario, TArtifact>(\n  opts: RunCampaignOptions<TScenario, TArtifact>,\n): Promise<CampaignResult<TArtifact, TScenario>> {\n  const seed = opts.seed ?? 42\n  const reps = opts.reps ?? 1\n  const resumable = opts.resumable ?? true\n  const now = opts.now ?? (() => new Date())\n  const judges = opts.judges ?? []\n  const storage = opts.storage ?? fsCampaignStorage()\n  const costPhase = opts.costPhase ?? 'campaign'\n  const dispatchShutdownTimeoutMs = opts.dispatchShutdownTimeoutMs ?? 5_000\n\n  assertCampaignDesign(opts.scenarios, reps)\n  if (!Number.isSafeInteger(dispatchShutdownTimeoutMs) || dispatchShutdownTimeoutMs <= 0) {\n    throw new Error('runCampaign: dispatchShutdownTimeoutMs must be a positive safe integer')\n  }\n\n  if (typeof opts.runDir !== 'string' || opts.runDir.trim().length === 0) {\n    throw new Error('runCampaign: runDir is required and must be a non-empty string')\n  }\n  opts.runDir = resolveRunDir(opts.runDir, opts.repo)\n  storage.ensureDir(opts.runDir)\n  const costLedger =\n    opts.costLedger ??\n    createRunCostLedger({\n      storage,\n      runDir: opts.runDir,\n      costCeilingUsd: opts.costCeiling,\n    })\n  if (opts.costCeiling !== undefined && costLedger.costCeilingUsd !== opts.costCeiling) {\n    throw new Error('runCampaign: costCeiling must match the shared CostLedger ceiling')\n  }\n  const maxConcurrency = opts.maxConcurrency ?? 2\n\n  const manifestHash = computeManifestHash({\n    scenarios: opts.scenarios,\n    judges: judges as unknown as JudgeConfig<unknown>[],\n    dispatchRef: dispatchRefFor(opts.dispatch, opts.dispatchRef),\n    seed,\n    reps,\n  })\n  const splitDigest = campaignSplitDigest(opts.scenarios, reps)\n\n  const startedAt = now()\n  const runAttemptId = globalThis.crypto.randomUUID()\n  const cells: CampaignCellResult<TArtifact>[] = []\n  const artifactsByPath: Record<string, string> = {}\n\n  // Build the cell schedule (scenario × rep).\n  const schedule = buildCellSchedule(opts.scenarios, seed, reps)\n\n  // Concurrency-limited execution.\n  const campaignAbort = new AbortController()\n  const onOwnerAbort = (): void => campaignAbort.abort(opts.signal?.reason)\n  if (opts.signal?.aborted) campaignAbort.abort(opts.signal.reason)\n  else opts.signal?.addEventListener('abort', onOwnerAbort, { once: true })\n  const campaignSignal = campaignAbort.signal\n  // Concurrency lanes that drain the cell schedule. Named \"lanes\" — not\n  // \"workers\" — to avoid clashing with the taxonomy's worker (= the agent\n  // harness in a sandbox, invoked behind `dispatch`). See loop-taxonomy.md.\n  const lanes: Promise<void>[] = []\n  let nextIdx = 0\n  const cellsRef = cells\n  let firstLaneError: unknown\n  let firstCellFailure: CellFailure | undefined\n\n  for (let i = 0; i < maxConcurrency; i++) {\n    lanes.push(\n      (async () => {\n        try {\n          while (true) {\n            if (campaignSignal.aborted) return\n            const myIdx = nextIdx++\n            if (myIdx >= schedule.length) return\n            const slot = schedule[myIdx]!\n            const result = await executeCell({\n              slot,\n              opts,\n              manifestHash,\n              resumable,\n              now,\n              storage,\n              buildTraceWriter: opts.buildTraceWriter ?? defaultBuildTraceWriter(storage),\n              signal: campaignSignal,\n              dispatchTimeoutMs: opts.dispatchTimeoutMs,\n              dispatchShutdownTimeoutMs,\n              costLedger,\n              costPhase,\n              runAttemptId,\n              onFailure: opts.abortOnCellError\n                ? (failure) => {\n                    if (firstCellFailure === undefined) {\n                      firstCellFailure = failure\n                      campaignAbort.abort(failure.cause)\n                    }\n                  }\n                : undefined,\n            })\n            cellsRef.push(result.cell)\n            Object.assign(artifactsByPath, result.artifactsByPath)\n            // Capture into LabeledScenarioStore unless explicitly disabled.\n            if (opts.labeledStore && opts.labeledStore !== 'off' && !result.cell.error) {\n              await captureToStore({\n                store: opts.labeledStore,\n                cell: result.cell,\n                scenario: slot.scenario,\n                opts,\n                now,\n              }).catch((err) => {\n                // Capture failures are non-fatal — log but don't crash the campaign.\n                // (Trace would normally land here.)\n                console.warn(\n                  `[runCampaign] capture failed for ${result.cell.cellId}: ${err instanceof Error ? err.message : String(err)}`,\n                )\n              })\n            }\n            if (opts.abortOnCellError && result.failure) {\n              return\n            }\n          }\n        } catch (error) {\n          if (firstLaneError === undefined) {\n            firstLaneError = error\n            campaignAbort.abort(error)\n          }\n          throw error\n        }\n      })(),\n    )\n  }\n  const laneResults = await Promise.allSettled(lanes)\n  opts.signal?.removeEventListener('abort', onOwnerAbort)\n  const failedLane = laneResults.find(\n    (result): result is PromiseRejectedResult => result.status === 'rejected',\n  )\n  if (firstCellFailure) throw firstCellFailure.cause\n  if (failedLane) throw firstLaneError ?? failedLane.reason\n\n  const endedAt = now()\n  cellsRef.sort((a, b) => a.cellId.localeCompare(b.cellId))\n\n  const campaignCost = costLedger.summary({ tags: { runDir: opts.runDir } })\n  const aggregates = computeAggregates(\n    cellsRef,\n    judges as unknown as JudgeConfig<TArtifact>[],\n    seed,\n    campaignCost,\n  )\n\n  return {\n    manifestHash,\n    splitDigest,\n    seed,\n    reps,\n    startedAt: startedAt.toISOString(),\n    endedAt: endedAt.toISOString(),\n    durationMs: endedAt.getTime() - startedAt.getTime(),\n    cells: cellsRef,\n    aggregates,\n    runDir: opts.runDir,\n    artifactsByPath,\n    scenarios: opts.scenarios.map(campaignScenarioIdentity),\n  }\n}\n\n// ── Internals ─────────────────────────────────────────────────────────\n\ninterface ExecuteCellArgs<TScenario extends Scenario, TArtifact> {\n  slot: { scenario: TScenario; rep: number; cellId: string; cellSeed: number }\n  opts: RunCampaignOptions<TScenario, TArtifact>\n  manifestHash: string\n  resumable: boolean\n  now: () => Date\n  storage: CampaignStorage\n  buildTraceWriter: (cellId: string, dir: string) => CampaignTraceWriter\n  signal: AbortSignal\n  dispatchTimeoutMs?: number\n  dispatchShutdownTimeoutMs: number\n  costLedger: CostLedgerHandle\n  costPhase: string\n  runAttemptId: string\n  onFailure?: (failure: CellFailure) => void\n}\n\ninterface CellFailure {\n  stage: 'dispatch' | 'judge'\n  judge?: string\n  cause: unknown\n}\n\ninterface ExecuteCellResult<TArtifact> {\n  cell: CampaignCellResult<TArtifact>\n  artifactsByPath: Record<string, string>\n  failure?: CellFailure\n}\n\nasync function executeCell<TScenario extends Scenario, TArtifact>(\n  args: ExecuteCellArgs<TScenario, TArtifact>,\n): Promise<ExecuteCellResult<TArtifact>> {\n  const storage = args.storage\n  const cellDir = join(args.opts.runDir, args.slot.cellId.replace(/[^a-zA-Z0-9_-]/g, '_'))\n  storage.ensureDir(cellDir)\n  const stableCostTags = {\n    ...(args.opts.costTags ?? {}),\n    runDir: args.opts.runDir,\n    cellId: args.slot.cellId,\n    scenarioId: args.slot.scenario.id,\n    rep: String(args.slot.rep),\n  }\n  const costTags = { ...stableCostTags, runAttemptId: args.runAttemptId }\n\n  // Resumability: cache key = (manifestHash, scenarioId, rep)\n  const cachePath = join(cellDir, 'cached-result.json')\n  if (args.resumable) {\n    const cached = readCachedCell<TArtifact>({\n      storage,\n      cachePath,\n      cellId: args.slot.cellId,\n      manifestHash: args.manifestHash,\n    })\n    if (cached.status === 'hit') {\n      enforceDispatchUsage(cached.cell, args.opts.expectUsage ?? 'warn')\n      const cachedHasUsage =\n        cached.cell.costUsd > 0 ||\n        cached.cell.tokenUsage.input > 0 ||\n        cached.cell.tokenUsage.output > 0\n      if (cached.cell.costCallIds === undefined) {\n        if (cachedHasUsage || Object.keys(cached.cell.judgeScores).length > 0) {\n          throw new CostAccountingIncompleteError(\n            `runCampaign: cached cell '${args.slot.cellId}' does not identify its ledger receipts`,\n          )\n        }\n      } else if (\n        !Array.isArray(cached.cell.costCallIds) ||\n        cached.cell.costCallIds.some(\n          (callId) => typeof callId !== 'string' || callId.trim().length === 0,\n        ) ||\n        new Set(cached.cell.costCallIds).size !== cached.cell.costCallIds.length\n      ) {\n        throw new CostAccountingIncompleteError(\n          `runCampaign: cached cell '${args.slot.cellId}' has invalid ledger receipt IDs`,\n        )\n      } else {\n        const restoredCallIds = new Set(\n          args.costLedger.list({ tags: stableCostTags }).map((receipt) => receipt.callId),\n        )\n        const missingCallIds = cached.cell.costCallIds.filter(\n          (callId) => !restoredCallIds.has(callId),\n        )\n        if (missingCallIds.length > 0) {\n          throw new CostAccountingIncompleteError(\n            `runCampaign: cached cell '${args.slot.cellId}' is missing ledger receipt(s): ${missingCallIds.join(', ')}`,\n          )\n        }\n      }\n      return { cell: { ...cached.cell, cached: true }, artifactsByPath: {} }\n    }\n  }\n\n  const startMs = Date.now()\n  const trace = args.buildTraceWriter(args.slot.cellId, cellDir)\n  const artifactsByPath: Record<string, string> = {}\n  let paidCallStarted = false\n  const artifacts: CampaignArtifactWriter = {\n    async write(path, content) {\n      const fullPath = join(cellDir, path)\n      storage.ensureDir(join(fullPath, '..'))\n      storage.write(fullPath, content)\n      artifactsByPath[`${args.slot.cellId}/${path}`] = fullPath\n      return fullPath\n    },\n    async writeJson(path, value) {\n      return artifacts.write(path, JSON.stringify(value, null, 2))\n    },\n  }\n  const cost: CampaignCostMeter = {\n    async runPaidCall(input) {\n      paidCallStarted = true\n      const result = await args.costLedger.runPaidCall({\n        ...input,\n        channel: input.channel ?? 'agent',\n        phase: args.costPhase,\n        actor: input.actor,\n        tags: costTags,\n        signal: cellAbort.signal,\n      })\n      if (result.receipt) {\n        trace.span(`cost.${result.receipt.actor}`, { amountUsd: result.receipt.costUsd }).end()\n      }\n      return result\n    },\n  }\n\n  const placement = args.opts.cellPlacement?.({\n    scenario: args.slot.scenario,\n    rep: args.slot.rep,\n  })\n\n  // Per-cell abort signal, chained to the campaign signal. The dispatch sees\n  // THIS signal so a timeout (below) can abort just this cell's in-flight work\n  // without tearing down sibling cells — and a signal-honoring dispatch\n  // releases its open request instead of leaking it past the deadline.\n  const cellAbort = new AbortController()\n  const onCampaignAbort = () => cellAbort.abort((args.signal as { reason?: unknown }).reason)\n  if (args.signal.aborted) cellAbort.abort((args.signal as { reason?: unknown }).reason)\n  else args.signal.addEventListener('abort', onCampaignAbort, { once: true })\n\n  const ctx: DispatchContext = {\n    cellId: args.slot.cellId,\n    rep: args.slot.rep,\n    seed: args.slot.cellSeed,\n    signal: cellAbort.signal,\n    trace,\n    artifacts,\n    cost,\n    placement,\n  }\n\n  let artifact: TArtifact | undefined\n  let errorMessage: string | undefined\n  let failure: CellFailure | undefined\n  let fatalCellError: unknown\n  let dispatched: Promise<TArtifact> | undefined\n  const timeoutMs = args.dispatchTimeoutMs\n  let timeoutTimer: ReturnType<typeof setTimeout> | undefined\n  let removeAbortListener: () => void = () => undefined\n  try {\n    dispatched = Promise.resolve(args.opts.dispatch(args.slot.scenario, ctx))\n    const aborted = new Promise<never>((_resolve, reject) => {\n      const rejectAbort = () => {\n        const reason = cellAbort.signal.reason\n        reject(reason instanceof Error ? reason : new Error(String(reason ?? 'dispatch aborted')))\n      }\n      if (cellAbort.signal.aborted) {\n        rejectAbort()\n        return\n      }\n      cellAbort.signal.addEventListener('abort', rejectAbort, { once: true })\n      removeAbortListener = () => cellAbort.signal.removeEventListener('abort', rejectAbort)\n    })\n    if (timeoutMs !== undefined && timeoutMs > 0) {\n      // A dispatch that never settles (stalled model request, exhausted runtime\n      // resource, a stream that never closes) must NOT hang the cell — and with\n      // it the lane, the campaign, the loop, the CI job — forever. Race it\n      // against the deadline; on timeout, abort the cell and fail it LOUD.\n      artifact = await Promise.race([\n        dispatched,\n        aborted,\n        new Promise<never>((_, reject) => {\n          timeoutTimer = setTimeout(() => {\n            const timeoutError = new Error(\n              `dispatch exceeded ${timeoutMs}ms for cell '${args.slot.cellId}' — aborted and failed loud (no silent hang)`,\n            )\n            reject(timeoutError)\n            cellAbort.abort(timeoutError)\n          }, timeoutMs)\n          if (typeof (timeoutTimer as { unref?: () => void }).unref === 'function')\n            (timeoutTimer as { unref: () => void }).unref()\n        }),\n      ])\n    } else {\n      artifact = await Promise.race([dispatched, aborted])\n    }\n  } catch (err) {\n    errorMessage = err instanceof Error ? err.message : String(err)\n    failure = { stage: 'dispatch', cause: err }\n  } finally {\n    if (timeoutTimer) clearTimeout(timeoutTimer)\n    removeAbortListener()\n    args.signal.removeEventListener('abort', onCampaignAbort)\n  }\n\n  if (dispatched) {\n    const dispatchSettled = await settlesWithin(dispatched, args.dispatchShutdownTimeoutMs)\n    if (!dispatchSettled) {\n      await trace.flush()\n      throw new CostAccountingIncompleteError(\n        `dispatch for cell '${args.slot.cellId}' ignored cancellation and did not stop within ${args.dispatchShutdownTimeoutMs}ms; no campaign result was produced`,\n      )\n    }\n  }\n  if (paidCallStarted) {\n    if (typeof args.costLedger.waitForIdle !== 'function') {\n      await trace.flush()\n      throw new CostAccountingIncompleteError(\n        `cost ledger for cell '${args.slot.cellId}' cannot prove that paid calls stopped`,\n      )\n    }\n    const paidCallsSettled = await args.costLedger.waitForIdle({\n      timeoutMs: args.dispatchShutdownTimeoutMs,\n      filter: { channel: 'agent', phase: args.costPhase, tags: costTags },\n    })\n    if (!paidCallsSettled) {\n      await trace.flush()\n      throw new CostAccountingIncompleteError(\n        `paid calls for cell '${args.slot.cellId}' did not settle within ${args.dispatchShutdownTimeoutMs}ms; no campaign result was produced`,\n      )\n    }\n  }\n\n  const agentReceipts = args.costLedger.list({ channel: 'agent', tags: costTags })\n  const agentCost = args.costLedger.summary({ channel: 'agent', tags: costTags })\n  const tokenUsage: CampaignTokenUsage = {\n    input: agentCost.inputTokens,\n    output: agentCost.outputTokens,\n    ...(agentCost.cachedTokens > 0 ? { cached: agentCost.cachedTokens } : {}),\n  }\n  const resolvedModel = agentReceipts.at(-1)?.model\n  const dispatchResult = {\n    cellId: args.slot.cellId,\n    artifact,\n    error: errorMessage,\n    costUsd: agentCost.totalCostUsd,\n    tokenUsage,\n  }\n  try {\n    enforceDispatchUsage(dispatchResult, args.opts.expectUsage ?? 'warn')\n  } catch (error) {\n    await trace.flush()\n    throw error\n  }\n\n  // Run judges (only if we have an artifact). A judge that throws invalidates\n  // the cell — recorded as `error`, NOT folded into a fake composite:0 (a fake\n  // zero is indistinguishable from a real zero and poisons every aggregate).\n  const judgeScores: Record<string, JudgeScore> = {}\n  if (artifact !== undefined) {\n    for (const judge of args.opts.judges ?? []) {\n      if (judge.appliesTo && !judge.appliesTo(args.slot.scenario)) continue\n      try {\n        const score = await runJudgeCell(judge, {\n          artifact,\n          scenario: args.slot.scenario,\n          signal: args.signal,\n          costLedger: args.costLedger,\n          costPhase: args.costPhase,\n          costTags,\n        })\n        judgeScores[judge.name] = score\n      } catch (err) {\n        errorMessage = `judge '${judge.name}' failed: ${err instanceof Error ? err.message : String(err)}`\n        failure = { stage: 'judge', judge: judge.name, cause: err }\n        if (err instanceof CostAccountingIncompleteError) fatalCellError = err\n        break\n      }\n    }\n  }\n\n  if (failure) {\n    await waitForFailedCellCostSettlement({\n      costLedger: args.costLedger,\n      costPhase: args.costPhase,\n      costTags,\n      cellId: args.slot.cellId,\n      timeoutMs: args.dispatchShutdownTimeoutMs,\n    })\n  }\n  const costCallIds = args.costLedger\n    .list({ tags: costTags })\n    .map((receipt) => receipt.callId)\n    .sort()\n\n  const cell: CampaignCellResult<TArtifact> = {\n    manifestHash: args.manifestHash,\n    cellId: args.slot.cellId,\n    scenarioId: args.slot.scenario.id,\n    rep: args.slot.rep,\n    artifact: (artifact ?? null) as TArtifact,\n    judgeScores,\n    costUsd: agentCost.totalCostUsd,\n    costEstimated: agentReceipts.some(\n      (receipt) => receipt.actualCostUsd === undefined && !receipt.costUnknown,\n    ),\n    costCallIds,\n    tokenUsage,\n    ...(resolvedModel ? { resolvedModel } : {}),\n    durationMs: Date.now() - startMs,\n    seed: args.slot.cellSeed,\n    cached: false,\n    error: errorMessage,\n  }\n\n  if (failure) {\n    const failurePath = join(cellDir, 'failure-receipt.json')\n    const receipt: CampaignCellFailureReceipt<TArtifact> = {\n      schemaVersion: 1,\n      runAttemptId: args.runAttemptId,\n      recordedAt: args.now().toISOString(),\n      failure: {\n        stage: failure.stage,\n        ...(failure.judge ? { judge: failure.judge } : {}),\n        error: serializeCellError(failure.cause),\n      },\n      cell,\n      cost: args.costLedger.summary({ phase: args.costPhase, tags: costTags }),\n    }\n    storage.write(failurePath, JSON.stringify(receipt, null, 2))\n    artifactsByPath[`${args.slot.cellId}/failure-receipt.json`] = failurePath\n    args.onFailure?.(failure)\n  }\n\n  await trace.flush()\n\n  if (!errorMessage && args.resumable) {\n    storage.write(cachePath, JSON.stringify(cell))\n  }\n\n  if (fatalCellError !== undefined) throw fatalCellError\n  return { cell, artifactsByPath, ...(failure ? { failure } : {}) }\n}\n\nasync function waitForFailedCellCostSettlement(input: {\n  costLedger: CostLedgerHandle\n  costPhase: string\n  costTags: Record<string, string>\n  cellId: string\n  timeoutMs: number\n}): Promise<void> {\n  const filter = { phase: input.costPhase, tags: input.costTags }\n  if (input.costLedger.summary(filter).pendingCalls === 0) return\n  if (typeof input.costLedger.waitForIdle !== 'function') {\n    throw new CostAccountingIncompleteError(\n      `cost ledger for failed cell '${input.cellId}' cannot prove that paid calls stopped`,\n    )\n  }\n  const settled = await input.costLedger.waitForIdle({\n    timeoutMs: input.timeoutMs,\n    filter,\n  })\n  if (!settled || input.costLedger.summary(filter).pendingCalls > 0) {\n    throw new CostAccountingIncompleteError(\n      `paid calls for failed cell '${input.cellId}' did not settle within ${input.timeoutMs}ms; no complete failure receipt was produced`,\n    )\n  }\n}\n\nfunction serializeCellError(error: unknown): {\n  name: string\n  message: string\n  stack?: string\n} {\n  if (error instanceof Error) {\n    return {\n      name: error.name,\n      message: error.message,\n      ...(error.stack ? { stack: error.stack } : {}),\n    }\n  }\n  return { name: 'NonErrorThrown', message: String(error) }\n}\n\nfunction settlesWithin(promise: Promise<unknown>, timeoutMs: number): Promise<boolean> {\n  return new Promise<boolean>((resolve) => {\n    let completed = false\n    let timer: ReturnType<typeof setTimeout> | undefined\n    const finish = (value: boolean): void => {\n      if (completed) return\n      completed = true\n      if (timer) clearTimeout(timer)\n      resolve(value)\n    }\n    timer = setTimeout(() => finish(false), timeoutMs)\n    promise.then(\n      () => finish(true),\n      () => finish(true),\n    )\n  })\n}\n\nexport interface CampaignRunPlanCell {\n  cellId: string\n  scenarioId: string\n  rep: number\n  seed: number\n  cachePath: string\n  status: 'cached' | 'run'\n  reason?: 'missing' | 'manifest-mismatch' | 'cell-mismatch' | 'corrupt' | 'resumable-off'\n}\n\nexport interface CampaignRunPlan {\n  manifestHash: string\n  splitDigest: `sha256:${string}`\n  totalCells: number\n  cellsCached: number\n  cellsToRun: number\n  cells: CampaignRunPlanCell[]\n}\n\nexport interface PlanCampaignRunOptions<TScenario extends Scenario, TArtifact> {\n  scenarios: TScenario[]\n  dispatch?: DispatchFn<TScenario, TArtifact>\n  dispatchRef?: string\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  seed?: number\n  reps?: number\n  resumable?: boolean\n  runDir: string\n  /** Subject repo for the shared run-dir root (see RunCampaignOptions.repo). */\n  repo?: string\n  storage?: CampaignStorage\n}\n\n/**\n * Plan a campaign WITHOUT dispatching: computes the manifest hash and the per-cell\n * run-vs-cached schedule so callers can preview cost and resumability before spending.\n */\nexport function planCampaignRun<TScenario extends Scenario, TArtifact>(\n  opts: PlanCampaignRunOptions<TScenario, TArtifact>,\n): CampaignRunPlan {\n  const seed = opts.seed ?? 42\n  const reps = opts.reps ?? 1\n  const resumable = opts.resumable ?? true\n  const storage = opts.storage ?? fsCampaignStorage()\n\n  assertCampaignDesign(opts.scenarios, reps)\n\n  if (typeof opts.runDir !== 'string' || opts.runDir.trim().length === 0) {\n    throw new Error('planCampaignRun: runDir is required and must be a non-empty string')\n  }\n  opts.runDir = resolveRunDir(opts.runDir, opts.repo)\n\n  const manifestHash = computeManifestHash({\n    scenarios: opts.scenarios,\n    judges: (opts.judges ?? []) as unknown as JudgeConfig<unknown>[],\n    dispatchRef: dispatchRefFor(opts.dispatch, opts.dispatchRef),\n    seed,\n    reps,\n  })\n  const splitDigest = campaignSplitDigest(opts.scenarios, reps)\n\n  const cells = buildCellSchedule(opts.scenarios, seed, reps).map((slot): CampaignRunPlanCell => {\n    const cachePath = join(\n      opts.runDir,\n      slot.cellId.replace(/[^a-zA-Z0-9_-]/g, '_'),\n      'cached-result.json',\n    )\n    if (!resumable) {\n      return {\n        cellId: slot.cellId,\n        scenarioId: slot.scenario.id,\n        rep: slot.rep,\n        seed: slot.cellSeed,\n        cachePath,\n        status: 'run',\n        reason: 'resumable-off',\n      }\n    }\n\n    const cached = readCachedCell<unknown>({\n      storage,\n      cachePath,\n      cellId: slot.cellId,\n      manifestHash,\n    })\n    if (cached.status === 'hit') {\n      return {\n        cellId: slot.cellId,\n        scenarioId: slot.scenario.id,\n        rep: slot.rep,\n        seed: slot.cellSeed,\n        cachePath,\n        status: 'cached',\n      }\n    }\n\n    return {\n      cellId: slot.cellId,\n      scenarioId: slot.scenario.id,\n      rep: slot.rep,\n      seed: slot.cellSeed,\n      cachePath,\n      status: 'run',\n      reason: cached.reason,\n    }\n  })\n\n  const cellsCached = cells.filter((cell) => cell.status === 'cached').length\n  return {\n    manifestHash,\n    splitDigest,\n    totalCells: cells.length,\n    cellsCached,\n    cellsToRun: cells.length - cellsCached,\n    cells,\n  }\n}\n\n/**\n * Per-dispatch stub guard. An artifact produced with `costUsd === 0` AND zero\n * tokens means the dispatch never called `ctx.cost` —\n * i.e. it ran against a stub or silently dropped its usage. `'warn'` logs it,\n * `'assert'` throws (fail-fast), and `'off'` skips the check.\n */\nfunction enforceDispatchUsage(\n  cell: Pick<\n    CampaignCellResult<unknown>,\n    'cellId' | 'artifact' | 'error' | 'costUsd' | 'tokenUsage'\n  >,\n  mode: 'assert' | 'warn' | 'off',\n): void {\n  if (mode === 'off') return\n  if (cell.artifact === null || cell.artifact === undefined) return\n  const zeroTokens = cell.tokenUsage.input === 0 && cell.tokenUsage.output === 0\n  if (cell.costUsd !== 0 || !zeroTokens) return\n  const msg = `cell '${cell.cellId}' produced an artifact but reported zero cost and zero tokens — the dispatch made no paid call through ctx.cost.runPaidCall (a stub cell)`\n  if (mode === 'assert') {\n    const report: BackendIntegrityReport = {\n      totalRecords: 1,\n      stubRecords: 1,\n      realRecords: 0,\n      uncostedRecords: 0,\n      totalInputTokens: 0,\n      totalOutputTokens: 0,\n      totalCostUsd: 0,\n      verdict: 'stub',\n      diagnosis: msg,\n    }\n    throw new BackendIntegrityError(`expectUsage: ${msg}`, report)\n  }\n  // eslint-disable-next-line no-console\n  console.warn(`[runCampaign] expectUsage: ${msg}`)\n}\n\nasync function runJudgeCell<TArtifact, TScenario extends Scenario>(\n  judge: JudgeConfig<TArtifact, TScenario>,\n  input: Parameters<JudgeConfig<TArtifact, TScenario>['score']>[0],\n): Promise<JudgeScore> {\n  const previousJudgeCalls = new Set(\n    input.costLedger\n      ?.list({ channel: 'judge', tags: input.costTags })\n      .map((receipt) => receipt.callId) ?? [],\n  )\n  try {\n    const score = await judge.score(input)\n    assertReportedJudgeCallRecorded(judge.name, score, input, previousJudgeCalls)\n    return score\n  } catch (error) {\n    assertReportedJudgeCallRecorded(judge.name, error, input, previousJudgeCalls, error)\n    throw error\n  }\n}\n\nfunction assertReportedJudgeCallRecorded(\n  judgeName: string,\n  value: unknown,\n  input: Parameters<JudgeConfig<unknown>['score']>[0],\n  previousCallIds: ReadonlySet<string>,\n  cause?: unknown,\n): void {\n  if (!hasLlmCall(value)) return\n  const recorded = input.costLedger\n    ?.list({ channel: 'judge', tags: input.costTags })\n    .some((receipt) => !previousCallIds.has(receipt.callId))\n  if (recorded) return\n  throw new CostAccountingIncompleteError(\n    `runCampaign: judge '${judgeName}' reported a paid LLM call without a CostLedger receipt`,\n    cause === undefined ? undefined : { cause },\n  )\n}\n\nfunction hasLlmCall(value: unknown): value is { llmCall: unknown } {\n  return (\n    typeof value === 'object' &&\n    value !== null &&\n    'llmCall' in value &&\n    (value as { llmCall?: unknown }).llmCall !== undefined\n  )\n}\n\nfunction defaultBuildTraceWriter(\n  storage: CampaignStorage,\n): (cellId: string, dir: string) => CampaignTraceWriter {\n  return (cellId, dir) => {\n    const spans: Array<Record<string, unknown>> = []\n    return {\n      span(name, attributes) {\n        const startMs = Date.now()\n        const record: Record<string, unknown> = { name, cellId, startMs, ...(attributes ?? {}) }\n        const finish: TraceSpan = {\n          end(endAttrs) {\n            record.durationMs = Date.now() - startMs\n            if (endAttrs) Object.assign(record, endAttrs)\n            spans.push(record)\n          },\n          setAttribute(key, value) {\n            record[key] = value\n          },\n        }\n        return finish\n      },\n      async flush() {\n        storage.write(join(dir, 'spans.jsonl'), spans.map((s) => JSON.stringify(s)).join('\\n'))\n      },\n    }\n  }\n}\n\nfunction buildCellSchedule<TScenario extends Scenario>(\n  scenarios: TScenario[],\n  seed: number,\n  reps: number,\n): Array<{ scenario: TScenario; rep: number; cellId: string; cellSeed: number }> {\n  const schedule: Array<{ scenario: TScenario; rep: number; cellId: string; cellSeed: number }> = []\n  const groupIndexes = new Map<string, number>()\n  let nextGroupIndex = 0\n  for (const scenario of scenarios) {\n    let groupIndex: number\n    if (scenario.seedGroup === undefined) {\n      groupIndex = nextGroupIndex\n      nextGroupIndex += 1\n    } else {\n      const existing = groupIndexes.get(scenario.seedGroup)\n      if (existing !== undefined) {\n        groupIndex = existing\n      } else {\n        groupIndex = nextGroupIndex\n        nextGroupIndex += 1\n        groupIndexes.set(scenario.seedGroup, groupIndex)\n      }\n    }\n    for (let rep = 0; rep < reps; rep++) {\n      const cellId = `${scenario.id}:${rep}`\n      const cellSeed = seed + groupIndex * reps + rep\n      schedule.push({ scenario, rep, cellId, cellSeed })\n    }\n  }\n  return schedule\n}\n\nfunction dispatchRefFor<TScenario extends Scenario, TArtifact>(\n  dispatch: DispatchFn<TScenario, TArtifact> | undefined,\n  override: string | undefined,\n): string {\n  const ref = override ?? dispatch?.name ?? 'anonymous'\n  if (typeof ref !== 'string' || ref.trim().length === 0) {\n    throw new Error('runCampaign: dispatchRef must be a non-empty string when provided')\n  }\n  return ref\n}\n\ntype CacheRead<TArtifact> =\n  | { status: 'hit'; cell: CampaignCellResult<TArtifact> }\n  | { status: 'miss'; reason: 'missing' | 'manifest-mismatch' | 'cell-mismatch' | 'corrupt' }\n\nfunction readCachedCell<TArtifact>(args: {\n  storage: CampaignStorage\n  cachePath: string\n  cellId: string\n  manifestHash: string\n}): CacheRead<TArtifact> {\n  const raw = args.storage.read(args.cachePath)\n  if (raw === undefined) return { status: 'miss', reason: 'missing' }\n\n  try {\n    const cached = JSON.parse(raw) as CampaignCellResult<TArtifact>\n    if (cached.cellId !== args.cellId) return { status: 'miss', reason: 'cell-mismatch' }\n    if (cached.manifestHash !== args.manifestHash) {\n      return { status: 'miss', reason: 'manifest-mismatch' }\n    }\n    return { status: 'hit', cell: cached }\n  } catch {\n    return { status: 'miss', reason: 'corrupt' }\n  }\n}\n\ninterface CaptureArgs<TScenario extends Scenario, TArtifact> {\n  store: LabeledScenarioStore\n  cell: CampaignCellResult<TArtifact>\n  scenario: TScenario\n  opts: RunCampaignOptions<TScenario, TArtifact>\n  now: () => Date\n}\n\nasync function captureToStore<TScenario extends Scenario, TArtifact>(\n  args: CaptureArgs<TScenario, TArtifact>,\n): Promise<void> {\n  await args.store.observe({\n    scenario: args.scenario,\n    artifact: args.cell.artifact,\n    judgeScores: args.cell.judgeScores,\n    source: args.opts.captureSource ?? 'eval-run',\n    sourceVersionHash: args.opts.captureSourceVersionHash ?? 'unknown',\n    capturedAt: args.now().toISOString(),\n    redactionStatus: 'raw',\n  })\n}\n\n// ── Aggregates + manifest hash ────────────────────────────────────────\n\nfunction computeManifestHash(input: {\n  scenarios: Scenario[]\n  judges: JudgeConfig<unknown>[]\n  dispatchRef: string\n  seed: number\n  reps: number\n}): string {\n  return contentHash({\n    scenarios: input.scenarios,\n    judges: input.judges.map((judge) => ({\n      name: judge.name,\n      dims: judge.dimensions,\n      version: judgeVersionFor(judge),\n    })),\n    dispatch: input.dispatchRef,\n    seed: input.seed,\n    reps: input.reps,\n  })\n}\n\nfunction judgeVersionFor(judge: JudgeConfig<unknown>): string {\n  if (judge.judgeVersion !== undefined) {\n    const version = judge.judgeVersion.trim()\n    if (version.length === 0) {\n      throw new Error(`runCampaign: judge '${judge.name}' has an empty judgeVersion`)\n    }\n    return version\n  }\n  return contentHash({\n    score: judge.score.toString(),\n    appliesTo: judge.appliesTo?.toString() ?? null,\n  })\n}\n\nfunction computeAggregates<TArtifact>(\n  cells: CampaignCellResult<TArtifact>[],\n  judges: JudgeConfig<TArtifact>[],\n  seed: number,\n  cost: CostLedgerSummary,\n): CampaignAggregates {\n  const byJudge: Record<string, JudgeAggregate> = {}\n  for (const judge of judges) {\n    const scores: number[] = []\n    for (const cell of cells) {\n      const s = cell.judgeScores[judge.name]\n      if (s !== undefined) scores.push(s.composite)\n    }\n    byJudge[judge.name] = aggregate(scores, seed)\n  }\n  const byScenario: Record<string, ScenarioAggregate> = {}\n  const scenarioGroups = new Map<string, number[]>()\n  for (const cell of cells) {\n    const composites = Object.values(cell.judgeScores).map((s) => s.composite)\n    if (composites.length === 0) continue\n    const mean = composites.reduce((a, b) => a + b, 0) / composites.length\n    const arr = scenarioGroups.get(cell.scenarioId) ?? []\n    arr.push(mean)\n    scenarioGroups.set(cell.scenarioId, arr)\n  }\n  for (const [scenarioId, samples] of scenarioGroups) {\n    const ag = aggregate(samples, seed)\n    byScenario[scenarioId] = { meanComposite: ag.mean, ci95: ag.ci95, n: ag.n }\n  }\n  return {\n    byJudge,\n    byScenario,\n    cost,\n    totalCostUsd: cost.totalCostUsd,\n    cellsExecuted: cells.filter((c) => !c.error).length,\n    cellsSkipped: cells.filter((c) => c.error?.startsWith('skipped:')).length,\n    cellsCached: cells.filter((c) => c.cached).length,\n    cellsFailed: cells.filter((c) => c.error && !c.error.startsWith('skipped:')).length,\n  }\n}\n\n// Percentile bootstrap CI95 via seeded resampling. Deterministic for a given\n// seed — same campaign re-run produces identical CI bands. Falls back to\n// degenerate intervals at n<=1 (the bootstrap is undefined there).\nfunction aggregate(samples: number[], seed: number): JudgeAggregate {\n  const n = samples.length\n  if (n === 0) return { mean: 0, stdev: 0, ci95: [0, 0], n: 0 }\n  const mean = samples.reduce((a, b) => a + b, 0) / n\n  const variance = samples.reduce((a, b) => a + (b - mean) ** 2, 0) / Math.max(1, n - 1)\n  const stdev = Math.sqrt(variance)\n  const ci = confidenceInterval(samples, 0.95, { seed, resamples: 1000 })\n  return { mean, stdev, ci95: [ci.lower, ci.upper], n }\n}\n","/**\n * Backend-integrity guard: distinguish \"agent failed\" from \"eval ran against\n * a stub / unconfigured backend.\" Without this guard a canonical eval can\n * silently report `0/N passed` and look like an agent-quality problem when\n * the LLM was never actually called — the failure mode we just hit running\n * the 4-vertical parallel eval (legal-sandbox-stub returned hard-coded 33-104\n * char strings; gtm/creative defaulted to a cli-bridge that wasn't running).\n *\n * The shape:\n *\n *   const report = summarizeBackendIntegrity(records)\n *   assertRealBackend(records)   // throws BackendIntegrityError if 100% stub\n *\n * A record is \"stub-mode\" if its `tokenUsage.input === 0 && tokenUsage.output === 0`.\n * (`costUsd` alone is unreliable — some backends successfully call LLMs but\n *  don't propagate pricing, producing real tokens with $0 cost.)\n *\n * Verdicts:\n *   - `real`   — at least one record has nonzero token usage\n *   - `stub`   — every record is stub-mode (eval ran blind)\n *   - `mixed`  — some records real, some stub (partial backend failure;\n *                often the 429-cascade or auth-half-failed case)\n */\n\nimport type { CostReceipt } from '../cost-ledger'\nimport { AgentEvalError } from '../errors'\nimport type { RunRecord } from '../run-record'\n\nexport interface BackendIntegrityReport {\n  /** Total records inspected. */\n  totalRecords: number\n  /** Records with input=0 AND output=0 (a stub fingerprint). */\n  stubRecords: number\n  /** Records with nonzero token usage (real LLM activity). */\n  realRecords: number\n  /** Records where output>0 but costUsd=0 (real LLM, broken cost ledger). */\n  uncostedRecords: number\n  /** Sum of input tokens across all records. */\n  totalInputTokens: number\n  /** Sum of output tokens across all records. */\n  totalOutputTokens: number\n  /** Sum of costUsd across all records. */\n  totalCostUsd: number\n  /** Worst-case integrity verdict. */\n  verdict: 'real' | 'mixed' | 'stub'\n  /** Human-readable diagnosis suitable for terminal output. */\n  diagnosis: string\n}\n\n/**\n * Error thrown when an integrity assertion fails. Caller can pattern-match\n * by `code === 'AGENT_EVAL_BACKEND_STUB'` to differentiate from other\n * errors.\n */\nexport class BackendIntegrityError extends AgentEvalError {\n  constructor(\n    message: string,\n    public readonly report: BackendIntegrityReport,\n  ) {\n    super('backend_integrity', message)\n  }\n}\n\n/**\n * Inspect a batch of RunRecords and return an integrity report. Pure\n * function — no I/O, no logging. The caller decides what to do with the\n * verdict (print warning, throw, gate CI, etc.).\n */\nexport function summarizeBackendIntegrity(\n  records: ReadonlyArray<RunRecord>,\n): BackendIntegrityReport {\n  return summarizeBackendUsage(\n    records.map((record) => ({\n      inputTokens: record.tokenUsage.input,\n      outputTokens: record.tokenUsage.output,\n      costUsd: record.costUsd,\n    })),\n  )\n}\n\n/** Inspect settled agent calls from the canonical cost ledger. */\nexport function summarizeAgentReceiptIntegrity(\n  receipts: ReadonlyArray<CostReceipt>,\n): BackendIntegrityReport {\n  return summarizeBackendUsage(\n    receipts\n      .filter((receipt) => receipt.channel === 'agent')\n      .map((receipt) => ({\n        inputTokens: receipt.inputTokens,\n        outputTokens: receipt.outputTokens,\n        costUsd: receipt.costUsd,\n      })),\n  )\n}\n\ninterface BackendUsage {\n  inputTokens: number\n  outputTokens: number\n  costUsd: number\n}\n\nfunction summarizeBackendUsage(records: readonly BackendUsage[]): BackendIntegrityReport {\n  const totalRecords = records.length\n  let stubRecords = 0\n  let realRecords = 0\n  let uncostedRecords = 0\n  let totalInputTokens = 0\n  let totalOutputTokens = 0\n  let totalCostUsd = 0\n  for (const rec of records) {\n    totalInputTokens += rec.inputTokens\n    totalOutputTokens += rec.outputTokens\n    totalCostUsd += rec.costUsd\n    if (rec.inputTokens === 0 && rec.outputTokens === 0) stubRecords++\n    else realRecords++\n    if (rec.outputTokens > 0 && rec.costUsd === 0) uncostedRecords++\n  }\n  const verdict: BackendIntegrityReport['verdict'] =\n    totalRecords === 0\n      ? 'stub'\n      : stubRecords === totalRecords\n        ? 'stub'\n        : stubRecords === 0\n          ? 'real'\n          : 'mixed'\n  const diagnosis = buildDiagnosis({\n    totalRecords,\n    stubRecords,\n    realRecords,\n    uncostedRecords,\n    totalInputTokens,\n    totalOutputTokens,\n    totalCostUsd,\n    verdict,\n  })\n  return {\n    totalRecords,\n    stubRecords,\n    realRecords,\n    uncostedRecords,\n    totalInputTokens,\n    totalOutputTokens,\n    totalCostUsd,\n    verdict,\n    diagnosis,\n  }\n}\n\nfunction buildDiagnosis(r: Omit<BackendIntegrityReport, 'diagnosis'>): string {\n  if (r.totalRecords === 0) {\n    return 'no records — eval produced zero runs; backend likely failed before first turn'\n  }\n  if (r.verdict === 'stub') {\n    return [\n      `all ${r.totalRecords} records have zero token usage — the LLM backend was never called.`,\n      'common causes: --backend sandbox without a sandbox bridge running; stub model returning hard-coded strings;',\n      'auth misconfigured so requests were silently dropped before the LLM. Re-run with --backend tcloud and TANGLE_API_KEY set,',\n      'or boot the cli-bridge / sandbox before invoking the eval.',\n    ].join(' ')\n  }\n  if (r.verdict === 'mixed') {\n    const pct = ((r.stubRecords / r.totalRecords) * 100).toFixed(0)\n    return [\n      `${r.stubRecords}/${r.totalRecords} records (${pct}%) have zero token usage — the backend partially failed.`,\n      'common causes: rate-limit cascade (429s after the first N personas);',\n      'transient auth expiry mid-run; provider outage. Treat the affected records as missing data, not agent failures.',\n    ].join(' ')\n  }\n  // verdict === 'real'\n  if (r.uncostedRecords > 0) {\n    const pct = ((r.uncostedRecords / r.totalRecords) * 100).toFixed(0)\n    return [\n      `${r.totalRecords} records with real LLM activity (in=${r.totalInputTokens}, out=${r.totalOutputTokens} tokens).`,\n      `${r.uncostedRecords} (${pct}%) have output tokens but costUsd=0. Two distinct roots:`,\n      '(a) cost ledger mis-wired — no usage propagation from the runtime stream into RunRecord; or',\n      '(b) the model is unpriced at the source (sandbox/router returned $0 despite real tokens).',\n      'For (b), price the measured tokens against the substrate table (estimateCost) instead of leaving $0.',\n    ].join(' ')\n  }\n  return `${r.totalRecords} records with real LLM activity (in=${r.totalInputTokens}, out=${r.totalOutputTokens} tokens, $${r.totalCostUsd.toFixed(4)}).`\n}\n\n/**\n * Throw BackendIntegrityError if the verdict is 'stub' — i.e. every record\n * shows zero LLM activity. Non-strict callers can pass `{ allowMixed: false }`\n * to also reject mixed verdicts (recommended for CI gates).\n *\n * Real backends pass through silently.\n */\nexport function assertRealBackend(\n  records: ReadonlyArray<RunRecord>,\n  opts: { allowMixed?: boolean } = {},\n): BackendIntegrityReport {\n  const report = summarizeBackendIntegrity(records)\n  return assertBackendReport(report, opts)\n}\n\n/** Reject a cost ledger with no real agent call or a partial stub run. */\nexport function assertRealAgentReceipts(\n  receipts: ReadonlyArray<CostReceipt>,\n  opts: { allowMixed?: boolean } = {},\n): BackendIntegrityReport {\n  const report = summarizeAgentReceiptIntegrity(receipts)\n  return assertBackendReport(report, opts)\n}\n\nfunction assertBackendReport(\n  report: BackendIntegrityReport,\n  opts: { allowMixed?: boolean },\n): BackendIntegrityReport {\n  const allowMixed = opts.allowMixed ?? true\n  if (report.verdict === 'stub') {\n    throw new BackendIntegrityError(\n      `backend-integrity: ran against a stub or unconfigured backend — ${report.diagnosis}`,\n      report,\n    )\n  }\n  if (!allowMixed && report.verdict === 'mixed') {\n    throw new BackendIntegrityError(\n      `backend-integrity: partial backend failure rejected — ${report.diagnosis}`,\n      report,\n    )\n  }\n  return report\n}\n","/**\n * Content-addressed judge-verdict caching.\n *\n * LAW: cache JUDGE VERDICTS only — judging the same artifact with the same\n * judge+rubric is pure. NEVER cache agent rollouts. (A router that cached\n * identical fanout prompts silently destroyed best-of-N diversity; rollout\n * caching reintroduces that failure class. Judging has no diversity to\n * destroy — same artifact + same rubric ⇒ same verdict is the desired\n * property, not a bug.)\n *\n * The cache key is a sha-256 over the canonical JSON of everything that can\n * change a verdict: the artifact content, the scenario id, the judge name,\n * the full dimension list (key + description — the description IS the rubric\n * text shown to the judge), and a caller-supplied `judgeVersion`.\n * `judgeVersion` is REQUIRED: a judge whose prompt/model/ensemble changes\n * without a version bump would otherwise silently serve stale verdicts.\n *\n * Strict canonicalization (`canonicalJson`) throws on undefined / function /\n * symbol / non-finite numbers — an artifact that cannot be unambiguously\n * serialized cannot be content-addressed, and coercing it would let two\n * different artifacts collide on one key.\n */\n\nimport { createHash } from 'node:crypto'\nimport { appendFileSync, existsSync, readFileSync } from 'node:fs'\nimport type { JudgeConfig, JudgeScore, Scenario } from './campaign/types'\n\n// ── canonical JSON + content hash ─────────────────────────────────────────\n\nfunction canonicalizeAt(value: unknown, path: string): string {\n  if (value === null) return 'null'\n  switch (typeof value) {\n    case 'boolean':\n      return value ? 'true' : 'false'\n    case 'number':\n      if (!Number.isFinite(value)) {\n        throw new Error(\n          `canonicalJson: non-finite number (${value}) at ${path} — ambiguity is an error, not a coercion`,\n        )\n      }\n      return JSON.stringify(value)\n    case 'string':\n      return JSON.stringify(value)\n    case 'undefined':\n    case 'function':\n    case 'symbol':\n      throw new Error(\n        `canonicalJson: ${typeof value} at ${path} — ambiguity is an error, not a coercion`,\n      )\n    case 'bigint':\n      throw new Error(`canonicalJson: bigint at ${path} — not representable in JSON`)\n    case 'object':\n      break\n  }\n  const obj = value as Record<string, unknown>\n  // Honor toJSON (Date → ISO string) before structural checks — without it a\n  // Date would canonicalize to '{}' and every timestamp would collide.\n  if (typeof obj.toJSON === 'function') {\n    return canonicalizeAt((obj as { toJSON(): unknown }).toJSON(), path)\n  }\n  if (Array.isArray(obj)) {\n    return `[${obj.map((item, i) => canonicalizeAt(item, `${path}[${i}]`)).join(',')}]`\n  }\n  if (obj instanceof Map || obj instanceof Set) {\n    throw new Error(\n      `canonicalJson: ${obj instanceof Map ? 'Map' : 'Set'} at ${path} — would serialize as '{}'; convert to a plain object/array first`,\n    )\n  }\n  const keys = Object.keys(obj).sort()\n  const parts = keys.map((k) => `${JSON.stringify(k)}:${canonicalizeAt(obj[k], `${path}.${k}`)}`)\n  return `{${parts.join(',')}}`\n}\n\n/**\n * Stable JSON stringify: object keys sorted recursively, so two semantically\n * equal values produce byte-identical output regardless of key insertion\n * order. Throws on undefined / function / symbol / NaN / ±Infinity / bigint /\n * Map / Set — anything JSON.stringify would coerce or drop silently.\n *\n * Distinct from `pre-registration.ts`'s `canonicalize`/`hashJson`, which are\n * permissive (coercion allowed) and async (web-crypto). Use THIS pair when a\n * hash collision or silent coercion would corrupt a cache key or attestation.\n */\nexport function canonicalJson(value: unknown): string {\n  return canonicalizeAt(value, '$')\n}\n\n/** Hex sha-256 over `canonicalJson(value)`. The content address used by the\n *  verdict cache and report attestation. */\nexport function contentHash(value: unknown): string {\n  return createHash('sha256').update(canonicalJson(value)).digest('hex')\n}\n\n// ── store contract ─────────────────────────────────────────────────────────\n\n/** Pluggable verdict store. Sync or async on both legs — `cachedJudge`\n *  awaits the results either way. */\nexport interface VerdictCacheStore {\n  get(key: string): Promise<JudgeScore | undefined> | JudgeScore | undefined\n  set(key: string, score: JudgeScore): Promise<void> | void\n}\n\n/** Process-local Map-backed store. */\nexport function inMemoryVerdictCache(): VerdictCacheStore {\n  const entries = new Map<string, JudgeScore>()\n  return {\n    get: (key) => entries.get(key),\n    set: (key, score) => {\n      entries.set(key, score)\n    },\n  }\n}\n\ninterface VerdictCacheLine {\n  key: string\n  score: JudgeScore\n}\n\nfunction parseCacheLine(line: string, path: string, lineNo: number): VerdictCacheLine {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(line)\n  } catch (err) {\n    throw new Error(\n      `fileVerdictCache: corrupt JSONL at ${path}:${lineNo} — ${err instanceof Error ? err.message : String(err)}`,\n    )\n  }\n  const rec = parsed as Partial<VerdictCacheLine>\n  if (\n    typeof rec !== 'object' ||\n    rec === null ||\n    typeof rec.key !== 'string' ||\n    typeof rec.score !== 'object' ||\n    rec.score === null ||\n    typeof rec.score.composite !== 'number' ||\n    typeof rec.score.dimensions !== 'object'\n  ) {\n    throw new Error(\n      `fileVerdictCache: invalid record shape at ${path}:${lineNo} — expected {key, score:{dimensions, composite, notes}}`,\n    )\n  }\n  return rec as VerdictCacheLine\n}\n\n/**\n * JSONL-file-backed store: the full file is loaded into an in-memory index at\n * construction; every `set` appends one line synchronously (durable before\n * the verdict is returned). A corrupt or malformed line throws at load with\n * file:line — a skipped line would silently re-judge (cost) or, worse, mask\n * a half-written file that needs operator attention.\n */\nexport function fileVerdictCache(path: string): VerdictCacheStore {\n  const entries = new Map<string, JudgeScore>()\n  if (existsSync(path)) {\n    const lines = readFileSync(path, 'utf8').split('\\n')\n    for (let i = 0; i < lines.length; i++) {\n      const line = lines[i]\n      if (line === undefined || line.trim() === '') continue\n      const rec = parseCacheLine(line, path, i + 1)\n      entries.set(rec.key, rec.score)\n    }\n  }\n  return {\n    get: (key) => entries.get(key),\n    set: (key, score) => {\n      appendFileSync(path, `${JSON.stringify({ key, score })}\\n`, 'utf8')\n      entries.set(key, score)\n    },\n  }\n}\n\n// ── cached judge wrapper ───────────────────────────────────────────────────\n\nexport interface VerdictCacheStats {\n  hits: number\n  misses: number\n}\n\nexport interface CachedJudgeOptions {\n  /** REQUIRED — part of the cache key. Bump on any change to the judge's\n   *  prompt, model, ensemble, or scoring logic; silent judge upgrades must\n   *  never serve stale verdicts. */\n  judgeVersion: string\n}\n\n/** The wrapped judge: same `JudgeConfig` seam, plus hit/miss observability. */\nexport type CachedJudge<TArtifact, TScenario extends Scenario = Scenario> = JudgeConfig<\n  TArtifact,\n  TScenario\n> & {\n  stats(): VerdictCacheStats\n}\n\n/**\n * Wrap a `JudgeConfig` so repeat judgments of the same artifact are served\n * from the store instead of re-invoking `score()`. The wrapper is generic\n * over the judge's own type parameters and preserves `appliesTo` — it is a\n * drop-in replacement anywhere a `JudgeConfig` is accepted.\n *\n * A judge that throws is NOT cached: the error propagates and the next\n * attempt re-judges (caching a failure would pin a transient outage forever).\n */\nexport function cachedJudge<TArtifact, TScenario extends Scenario = Scenario>(\n  judge: JudgeConfig<TArtifact, TScenario>,\n  store: VerdictCacheStore,\n  options: CachedJudgeOptions,\n): CachedJudge<TArtifact, TScenario> {\n  if (typeof options.judgeVersion !== 'string' || options.judgeVersion.trim() === '') {\n    throw new Error('cachedJudge: judgeVersion is required and must be a non-empty string')\n  }\n  const stats: VerdictCacheStats = { hits: 0, misses: 0 }\n  const wrapped: CachedJudge<TArtifact, TScenario> = {\n    name: judge.name,\n    dimensions: judge.dimensions,\n    judgeVersion: options.judgeVersion,\n    async score(input) {\n      const key = contentHash({\n        artifact: canonicalJson(input.artifact),\n        scenarioId: input.scenario.id,\n        judgeName: judge.name,\n        dimensions: judge.dimensions,\n        judgeVersion: options.judgeVersion,\n      })\n      const cached = await store.get(key)\n      if (cached !== undefined) {\n        stats.hits += 1\n        return cached\n      }\n      const score = await judge.score(input)\n      await store.set(key, score)\n      stats.misses += 1\n      return score\n    },\n    stats: () => ({ ...stats }),\n  }\n  if (judge.appliesTo) wrapped.appliesTo = judge.appliesTo\n  return wrapped\n}\n","import { contentHash } from '../verdict-cache'\nimport type { CampaignCellResult, CampaignScenarioIdentity, Scenario } from './types'\n\nexport interface CampaignCoverage {\n  complete: boolean\n  expectedCellIds: string[]\n  scorableCellIds: string[]\n  unscorableCells: Array<{ cellId: string; reason: string }>\n}\n\n/** Reject campaign designs whose denominator cannot be identified exactly. */\nexport function assertCampaignDesign<TScenario extends Scenario>(\n  scenarios: readonly TScenario[],\n  reps: number,\n): void {\n  if (!Number.isSafeInteger(reps) || reps < 1) {\n    throw new Error('campaign design requires reps to be a positive safe integer')\n  }\n  const scenarioIds = new Set<string>()\n  for (const scenario of scenarios) {\n    if (typeof scenario.id !== 'string' || scenario.id.trim().length === 0) {\n      throw new Error('campaign design requires every scenario to have a non-empty id')\n    }\n    if (scenarioIds.has(scenario.id)) {\n      throw new Error(`campaign design contains duplicate scenario id '${scenario.id}'`)\n    }\n    if (typeof scenario.kind !== 'string' || scenario.kind.trim().length === 0) {\n      throw new Error('campaign design requires every scenario to have a non-empty kind')\n    }\n    if (\n      scenario.seedGroup !== undefined &&\n      (typeof scenario.seedGroup !== 'string' || scenario.seedGroup.trim().length === 0)\n    ) {\n      throw new Error('campaign design requires seedGroup to be a non-empty string when set')\n    }\n    scenarioIds.add(scenario.id)\n  }\n}\n\n/** Redacted but independently verifiable identity of one complete scenario. */\nexport function campaignScenarioIdentity<TScenario extends Scenario>(\n  scenario: TScenario,\n): CampaignScenarioIdentity & Pick<TScenario, 'id' | 'kind'> {\n  assertCampaignDesign([scenario], 1)\n  return {\n    id: scenario.id,\n    kind: scenario.kind,\n    scenarioDigest: `sha256:${contentHash(scenario)}`,\n  }\n}\n\n/** Canonical split identity reconstructed from redacted scenario identities. */\nexport function campaignSplitDigestFromIdentities(\n  scenarios: readonly CampaignScenarioIdentity[],\n  reps: number,\n): `sha256:${string}` {\n  assertCampaignDesign(scenarios, reps)\n  for (const scenario of scenarios) {\n    if (!/^sha256:[a-f0-9]{64}$/.test(scenario.scenarioDigest)) {\n      throw new Error(`campaign scenario '${scenario.id}' has an invalid digest`)\n    }\n  }\n  return `sha256:${contentHash({\n    schema: 'tangle.campaign-split',\n    scenarios: scenarios.map(({ id, kind, scenarioDigest }) => ({ id, kind, scenarioDigest })),\n    reps,\n  })}`\n}\n\n/** Canonical identity of the exact scenario payloads and replicate count. */\nexport function campaignSplitDigest<TScenario extends Scenario>(\n  scenarios: readonly TScenario[],\n  reps: number,\n): `sha256:${string}` {\n  assertCampaignDesign(scenarios, reps)\n  return campaignSplitDigestFromIdentities(scenarios.map(campaignScenarioIdentity), reps)\n}\n\n/** Refuse a campaign whose retained task identities contradict its split digest. */\nexport function assertCampaignSplitIdentity(\n  scenarios: readonly CampaignScenarioIdentity[],\n  reps: number,\n  splitDigest: string,\n): void {\n  if (campaignSplitDigestFromIdentities(scenarios, reps) !== splitDigest) {\n    throw new Error('campaign split digest does not match its retained scenario identities')\n  }\n}\n\n/** Exact designed-denominator receipt for one campaign. */\nexport function campaignCoverage<TArtifact, TScenario extends Scenario>(\n  cells: readonly CampaignCellResult<TArtifact>[],\n  scenarios: readonly TScenario[],\n  reps: number,\n  requireJudgeScore: boolean,\n): CampaignCoverage {\n  assertCampaignDesign(scenarios, reps)\n  const expectedCellIds = designedCellIds(scenarios, reps)\n  const cellsById = new Map<string, CampaignCellResult<TArtifact>[]>()\n  for (const cell of cells) {\n    const matches = cellsById.get(cell.cellId) ?? []\n    matches.push(cell)\n    cellsById.set(cell.cellId, matches)\n  }\n\n  const scorableCellIds: string[] = []\n  const unscorableCells: Array<{ cellId: string; reason: string }> = []\n  for (const cellId of expectedCellIds) {\n    const matches = cellsById.get(cellId) ?? []\n    if (matches.length === 0) {\n      unscorableCells.push({ cellId, reason: 'missing campaign cell' })\n      continue\n    }\n    if (matches.length > 1) {\n      unscorableCells.push({ cellId, reason: `duplicate campaign cell (${matches.length})` })\n      continue\n    }\n\n    const cell = matches[0]!\n    const scoreEntries = Object.entries(cell.judgeScores)\n    const successfulScores = scoreEntries\n      .map(([, score]) => score)\n      .filter((score) => score.failed !== true && Number.isFinite(score.composite))\n    const nonFiniteScores = scoreEntries.filter(\n      ([, score]) =>\n        score.failed !== true &&\n        (!Number.isFinite(score.composite) ||\n          Object.values(score.dimensions).some((value) => !Number.isFinite(value))),\n    )\n    const reasons: string[] = []\n    if (cell.error) reasons.push(cell.error)\n    if (cell.artifact === null || cell.artifact === undefined) reasons.push('missing artifact')\n    if (!cell.error && requireJudgeScore && successfulScores.length === 0) {\n      reasons.push('no successful finite judge score')\n    }\n    if (scoreEntries.some(([, score]) => score.failed === true)) {\n      reasons.push('judge score marked failed')\n    }\n    if (nonFiniteScores.length > 0) {\n      reasons.push(\n        `non-finite judge score: ${nonFiniteScores\n          .map(([name]) => name)\n          .sort()\n          .join(', ')}`,\n      )\n    }\n\n    if (reasons.length > 0) {\n      unscorableCells.push({ cellId, reason: reasons.join('; ') })\n    } else {\n      scorableCellIds.push(cellId)\n    }\n  }\n\n  const expected = new Set(expectedCellIds)\n  for (const cell of cells) {\n    if (cell.cellId !== `${cell.scenarioId}:${cell.rep}`) {\n      unscorableCells.push({\n        cellId: cell.cellId,\n        reason: 'campaign cell id does not match scenario id and rep',\n      })\n      continue\n    }\n    if (!expected.has(cell.cellId)) {\n      unscorableCells.push({ cellId: cell.cellId, reason: 'unexpected campaign cell' })\n    }\n  }\n\n  return {\n    complete: unscorableCells.length === 0 && scorableCellIds.length === expectedCellIds.length,\n    expectedCellIds,\n    scorableCellIds,\n    unscorableCells,\n  }\n}\n\nexport function formatCoverageFailures(coverage: CampaignCoverage): string {\n  const shown = coverage.unscorableCells\n    .slice(0, 3)\n    .map((cell) => `${cell.cellId}: ${cell.reason}`)\n    .join('; ')\n  const remainder = coverage.unscorableCells.length - Math.min(3, coverage.unscorableCells.length)\n  return remainder > 0 ? `${shown}; +${remainder} more` : shown || 'unknown coverage failure'\n}\n\nfunction designedCellIds<TScenario extends Scenario>(\n  scenarios: readonly TScenario[],\n  reps: number,\n): string[] {\n  const ids: string[] = []\n  for (const scenario of scenarios) {\n    for (let rep = 0; rep < reps; rep++) ids.push(`${scenario.id}:${rep}`)\n  }\n  return ids\n}\n","import { homedir } from 'node:os'\nimport { basename, isAbsolute, join } from 'node:path'\n\n/** The shared, out-of-repo root for campaign/benchmark run bundles. Keeping run\n *  outputs here means they never land in a repo working tree (no per-repo\n *  gitignore, no clutter, no accidental commits). Layout:\n *    ~/.tangle/traces/<repo>/runs/<runName>/\n *  where <repo> disambiguates runs across repos in one place. */\nexport function tangleTracesRoot(): string {\n  return join(homedir(), '.tangle', 'traces')\n}\n\n/** Resolve a campaign `runDir`. An absolute path is honored as-is (the caller\n *  chose an explicit location). A bare name is placed under the shared home root\n *  so bundles never pollute a repo working tree — the default the harness should\n *  compute so callers pass a *name*, not a path. */\nexport function resolveRunDir(runDir: string, repo?: string): string {\n  if (isAbsolute(runDir) || runDir.startsWith('mem://')) return runDir\n  const r = repo && repo.trim().length > 0 ? repo : basename(process.cwd())\n  return join(tangleTracesRoot(), r, 'runs', runDir)\n}\n","import { createRequire } from 'node:module'\nimport { join } from 'node:path'\nimport { CostLedger } from '../cost-ledger'\nimport { appendSearchLedgerLine, tryWithSearchLedgerFileLock } from './search-ledger-file'\n\n/**\n * `CampaignStorage` — the filesystem seam `runCampaign` writes through\n * (run/cell dirs, the resumability cache, per-cell artifacts, trace spans).\n *\n * The default (`fsCampaignStorage`) is the Node filesystem — identical\n * behavior to the inline `node:fs` calls it replaces, so existing CLI\n * consumers are unaffected. `inMemoryCampaignStorage` keeps everything in a\n * `Map`, so the substrate runs in environments WITHOUT a filesystem\n * (Cloudflare Workers, Deno Deploy, other edge runtimes) — the campaign\n * still produces its `CampaignResult` (cells + aggregates) in memory;\n * artifacts/traces simply aren't persisted to disk.\n *\n * Paths are opaque keys to the in-memory adapter — it does not parse them,\n * so the same `join(...)`-built paths work unchanged across both adapters.\n */\nexport interface CampaignStorage {\n  /** Ensure a directory exists (recursive). No-op for in-memory. */\n  ensureDir(dir: string): void\n  /** Does this path exist (as a written file or an ensured dir)? */\n  exists(path: string): boolean\n  /** Read a UTF-8 file; `undefined` when missing or unreadable. */\n  read(path: string): string | undefined\n  /** Write a file (string or bytes). Parent dir is assumed ensured. */\n  write(path: string, content: string | Uint8Array): void\n  /** Append only when the current UTF-8 byte length matches `expectedBytes`.\n   * Returns the new length, or undefined when another writer won. */\n  append?(path: string, content: string, expectedBytes: number): number | undefined\n}\n\n/** Node-filesystem storage — the default. Lazily requires `node:fs` so the\n *  module imports cleanly in non-Node runtimes (where the caller passes\n *  `inMemoryCampaignStorage` instead and never constructs this).\n *\n *  `createRequire(import.meta.url)` is the ESM-native lazy require — a bare\n *  `require` is a ReferenceError under `\"type\": \"module\"`, which is exactly\n *  the shape this package publishes. */\nexport function fsCampaignStorage(): CampaignStorage {\n  const nodeRequire = createRequire(import.meta.url)\n  const { existsSync, mkdirSync, readFileSync, statSync, writeFileSync } = nodeRequire(\n    'node:fs',\n  ) as typeof import('node:fs')\n  return {\n    ensureDir(dir) {\n      if (!existsSync(dir)) mkdirSync(dir, { recursive: true })\n    },\n    exists(path) {\n      return existsSync(path)\n    },\n    read(path) {\n      try {\n        return readFileSync(path, 'utf8')\n      } catch {\n        return undefined\n      }\n    },\n    write(path, content) {\n      writeFileSync(path, content as Uint8Array)\n    },\n    append(path, content, expectedBytes) {\n      const result = tryWithSearchLedgerFileLock(path, () => {\n        let actualBytes = 0\n        try {\n          actualBytes = statSync(path).size\n        } catch (error) {\n          if ((error as NodeJS.ErrnoException).code !== 'ENOENT') throw error\n        }\n        if (actualBytes !== expectedBytes) return undefined\n        appendSearchLedgerLine(path, content)\n        return expectedBytes + Buffer.byteLength(content)\n      })\n      return result.acquired ? result.value : undefined\n    },\n  }\n}\n\n/** In-memory storage for filesystem-less runtimes. Artifacts + trace spans\n *  live in a `Map` for the duration of the run; the `CampaignResult` is\n *  fully populated, but nothing is persisted to disk. */\nexport function inMemoryCampaignStorage(): CampaignStorage {\n  const files = new Map<string, string | Uint8Array>()\n  const dirs = new Set<string>()\n  return {\n    ensureDir(dir) {\n      dirs.add(dir)\n    },\n    exists(path) {\n      return files.has(path) || dirs.has(path)\n    },\n    read(path) {\n      const value = files.get(path)\n      if (value === undefined) return undefined\n      return typeof value === 'string' ? value : new TextDecoder().decode(value)\n    },\n    write(path, content) {\n      files.set(path, content)\n    },\n    append(path, content, expectedBytes) {\n      const current = files.get(path)\n      const currentText =\n        current === undefined\n          ? ''\n          : typeof current === 'string'\n            ? current\n            : new TextDecoder().decode(current)\n      const currentBytes = new TextEncoder().encode(currentText).byteLength\n      if (currentBytes !== expectedBytes) return undefined\n      files.set(path, `${currentText}${content}`)\n      return currentBytes + new TextEncoder().encode(content).byteLength\n    },\n  }\n}\n\n/** Open the durable spend account stored beside a logical run. */\nexport function createRunCostLedger(input: {\n  storage: CampaignStorage\n  runDir: string\n  costCeilingUsd?: number\n}): CostLedger {\n  const path = join(input.runDir, 'cost-ledger.jsonl')\n  input.storage.ensureDir(input.runDir)\n  return new CostLedger({\n    costCeilingUsd: input.costCeilingUsd,\n    persistence: {\n      read: () => {\n        const stored = input.storage.read(path)\n        if (stored === undefined && input.storage.exists(path)) {\n          throw new Error(`CostLedger: cannot read existing event log '${path}'`)\n        }\n        const events = stored ?? ''\n        return {\n          revision: String(new TextEncoder().encode(events).byteLength),\n          events,\n        }\n      },\n      append: (expectedRevision, event) => {\n        const expectedBytes = Number(expectedRevision)\n        if (!Number.isSafeInteger(expectedBytes) || expectedBytes < 0) {\n          throw new Error(`CostLedger: invalid storage revision '${expectedRevision}'`)\n        }\n        if (!input.storage.append) {\n          throw new Error('CostLedger: CampaignStorage.append is required for paid calls')\n        }\n        const next = input.storage.append(path, event, expectedBytes)\n        return next === undefined ? undefined : String(next)\n      },\n    },\n  })\n}\n","/** Filesystem durability and cross-process exclusion for the search ledger. */\n\nimport { closeSync, constants, fsyncSync, mkdirSync, openSync, writeSync } from 'node:fs'\nimport { dirname } from 'node:path'\nimport { AtomicFileLockError, tryAcquireAtomicFileLock } from './atomic-file-lock'\nimport { SearchLedgerIntegrityError } from './search-ledger-errors'\n\nexport function appendSearchLedgerLine(path: string, line: string): void {\n  mkdirSync(dirname(path), { recursive: true })\n  const fd = openSync(path, constants.O_CREAT | constants.O_WRONLY | constants.O_APPEND, 0o600)\n  try {\n    writeAll(fd, Buffer.from(line, 'utf8'))\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n  fsyncDirectory(dirname(path))\n}\n\nexport function withSearchLedgerFileLock<T>(ledgerPath: string, run: () => T): T {\n  const result = tryWithSearchLedgerFileLock(ledgerPath, run)\n  if (!result.acquired) {\n    throw new SearchLedgerIntegrityError(`search ledger lock is held (${ledgerPath})`)\n  }\n  return result.value\n}\n\nexport type FileLockResult<T> = { acquired: true; value: T } | { acquired: false }\n\nexport function tryWithSearchLedgerFileLock<T>(\n  ledgerPath: string,\n  run: () => T,\n): FileLockResult<T> {\n  mkdirSync(dirname(ledgerPath), { recursive: true })\n  const lockPath = `${ledgerPath}.lock`\n  try {\n    const acquisition = tryAcquireAtomicFileLock({ lockPath })\n    if (!acquisition.acquired) return { acquired: false }\n    try {\n      return { acquired: true, value: run() }\n    } finally {\n      acquisition.lock.release()\n    }\n  } catch (error) {\n    if (error instanceof AtomicFileLockError) {\n      throw new SearchLedgerIntegrityError(error.message, { cause: error })\n    }\n    throw error\n  }\n}\n\nfunction writeAll(fd: number, bytes: Buffer): void {\n  let offset = 0\n  while (offset < bytes.byteLength) {\n    const written = writeSync(fd, bytes, offset, bytes.byteLength - offset)\n    if (written <= 0) throw new SearchLedgerIntegrityError('filesystem wrote zero bytes')\n    offset += written\n  }\n}\n\nfunction fsyncDirectory(path: string): void {\n  const fd = openSync(path, constants.O_RDONLY)\n  try {\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n}\n","/** Crash-safe filesystem lock shared by campaign persistence and run exclusion. */\n\nimport { randomUUID } from 'node:crypto'\nimport {\n  closeSync,\n  constants,\n  existsSync,\n  fsyncSync,\n  linkSync,\n  openSync,\n  readFileSync,\n  renameSync,\n  unlinkSync,\n  writeFileSync,\n} from 'node:fs'\nimport { hostname } from 'node:os'\n\nexport interface AtomicFileLockOwner {\n  readonly pid: number\n  readonly host: string\n  readonly nonce: string\n}\n\nexport interface AtomicFileLock {\n  readonly owner: AtomicFileLockOwner\n  release(): void\n}\n\nexport type AtomicFileLockUnavailable =\n  | { readonly acquired: false; readonly reason: 'held'; readonly holder: AtomicFileLockOwner }\n  | { readonly acquired: false; readonly reason: 'recovery' }\n\nexport type AtomicFileLockAcquisition =\n  | { readonly acquired: true; readonly lock: AtomicFileLock }\n  | AtomicFileLockUnavailable\n\nexport interface AtomicFileLockOptions {\n  readonly lockPath: string\n  readonly pid?: number\n  readonly acceptLegacyPid?: boolean\n}\n\nexport class AtomicFileLockError extends Error {\n  override readonly name = 'AtomicFileLockError'\n}\n\ntype OwnerState =\n  | { readonly state: 'missing' }\n  | { readonly state: 'stale'; readonly owner: AtomicFileLockOwner }\n  | { readonly state: 'held'; readonly owner: AtomicFileLockOwner }\n\n/** Report whether another lock path prevents acquisition without modifying it. */\nexport function probeAtomicFileLock(\n  options: AtomicFileLockOptions,\n): AtomicFileLockUnavailable | null {\n  if (existsSync(recoveryPath(options.lockPath))) return { acquired: false, reason: 'recovery' }\n  const state = ownerState(options.lockPath, options.acceptLegacyPid ?? false)\n  if (state.state === 'held') {\n    return { acquired: false, reason: 'held', holder: state.owner }\n  }\n  return null\n}\n\n/**\n * Try to acquire a complete, uniquely-owned lock inode.\n *\n * A hard link publishes fully-written owner metadata atomically. Stale-owner\n * removal is serialized so one reclaimer cannot delete a new owner's lock.\n */\nexport function tryAcquireAtomicFileLock(\n  options: AtomicFileLockOptions,\n): AtomicFileLockAcquisition {\n  const pid = options.pid ?? process.pid\n  if (!Number.isSafeInteger(pid) || pid <= 0) {\n    throw new AtomicFileLockError('atomic file lock pid must be a positive integer')\n  }\n  const owner: AtomicFileLockOwner = { pid, host: hostname(), nonce: randomUUID() }\n  const acceptLegacyPid = options.acceptLegacyPid ?? false\n\n  for (let attempt = 0; attempt < 8; attempt += 1) {\n    if (existsSync(recoveryPath(options.lockPath))) {\n      return { acquired: false, reason: 'recovery' }\n    }\n    if (tryLinkOwner(options.lockPath, owner, `acquire.${attempt}`)) {\n      return acquired(options.lockPath, owner)\n    }\n\n    const holder = ownerState(options.lockPath, acceptLegacyPid)\n    if (holder.state === 'missing') continue\n    if (holder.state === 'held') {\n      return { acquired: false, reason: 'held', holder: holder.owner }\n    }\n\n    const reclaimPath = recoveryPath(options.lockPath)\n    if (!tryLinkOwner(reclaimPath, owner, `reclaim.${attempt}`)) {\n      return { acquired: false, reason: 'recovery' }\n    }\n    try {\n      const current = ownerState(options.lockPath, acceptLegacyPid)\n      if (current.state === 'held') {\n        return { acquired: false, reason: 'held', holder: current.owner }\n      }\n      if (current.state === 'stale') {\n        const tombstone = `${options.lockPath}.stale.${owner.nonce}.${attempt}`\n        try {\n          renameSync(options.lockPath, tombstone)\n          unlinkSync(tombstone)\n        } catch (error) {\n          if (!isMissing(error)) throw error\n        }\n      }\n      if (tryLinkOwner(options.lockPath, owner, `recovered.${attempt}`)) {\n        return acquired(options.lockPath, owner)\n      }\n    } finally {\n      releaseOwnedPath(reclaimPath, owner)\n    }\n  }\n\n  throw new AtomicFileLockError(`could not acquire atomic file lock ${options.lockPath}`)\n}\n\nfunction acquired(lockPath: string, owner: AtomicFileLockOwner): AtomicFileLockAcquisition {\n  return {\n    acquired: true,\n    lock: {\n      owner,\n      release: () => releaseOwnedPath(lockPath, owner),\n    },\n  }\n}\n\nfunction tryLinkOwner(lockPath: string, owner: AtomicFileLockOwner, suffix: string): boolean {\n  const ownerPath = `${lockPath}.${owner.pid}.${owner.nonce}.${suffix}.owner`\n  const descriptor = openSync(\n    ownerPath,\n    constants.O_CREAT | constants.O_EXCL | constants.O_WRONLY,\n    0o600,\n  )\n  try {\n    writeFileSync(descriptor, `${canonicalOwner(owner)}\\n`, 'utf8')\n    fsyncSync(descriptor)\n  } catch (error) {\n    closeSync(descriptor)\n    unlinkIfExists(ownerPath)\n    throw error\n  }\n  closeSync(descriptor)\n\n  try {\n    linkSync(ownerPath, lockPath)\n    return true\n  } catch (error) {\n    if (!isAlreadyExists(error)) throw error\n    return false\n  } finally {\n    unlinkIfExists(ownerPath)\n  }\n}\n\nfunction ownerState(lockPath: string, acceptLegacyPid: boolean): OwnerState {\n  const owner = readOwner(lockPath, acceptLegacyPid)\n  if (!owner) return { state: 'missing' }\n  if (owner.host !== hostname()) return { state: 'held', owner }\n  try {\n    process.kill(owner.pid, 0)\n    return { state: 'held', owner }\n  } catch (error) {\n    if (isNoSuchProcess(error)) return { state: 'stale', owner }\n    return { state: 'held', owner }\n  }\n}\n\nfunction readOwner(lockPath: string, acceptLegacyPid: boolean): AtomicFileLockOwner | undefined {\n  let contents: string\n  try {\n    contents = readFileSync(lockPath, 'utf8').trim()\n  } catch (error) {\n    if (isMissing(error)) return undefined\n    throw error\n  }\n\n  if (acceptLegacyPid && /^[1-9]\\d*$/.test(contents)) {\n    const pid = Number(contents)\n    if (Number.isSafeInteger(pid)) return { pid, host: hostname(), nonce: 'legacy-pid' }\n  }\n\n  let value: unknown\n  try {\n    value = JSON.parse(contents)\n  } catch (error) {\n    throw invalidOwner(lockPath, error)\n  }\n  if (!isOwner(value)) throw invalidOwner(lockPath)\n  return value\n}\n\nfunction isOwner(value: unknown): value is AtomicFileLockOwner {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return false\n  const record = value as Record<string, unknown>\n  return (\n    Object.keys(record).length === 3 &&\n    Number.isSafeInteger(record.pid) &&\n    Number(record.pid) > 0 &&\n    typeof record.host === 'string' &&\n    record.host.trim().length > 0 &&\n    typeof record.nonce === 'string' &&\n    record.nonce.trim().length > 0\n  )\n}\n\nfunction invalidOwner(lockPath: string, cause?: unknown): AtomicFileLockError {\n  const error = new AtomicFileLockError(\n    `atomic file lock has an invalid owner (${lockPath}); refusing unsafe recovery`,\n  )\n  if (cause !== undefined) Object.defineProperty(error, 'cause', { value: cause })\n  return error\n}\n\nfunction releaseOwnedPath(lockPath: string, owner: AtomicFileLockOwner): void {\n  const current = readOwner(lockPath, true)\n  if (!current) return\n  if (canonicalOwner(current) !== canonicalOwner(owner)) {\n    throw new AtomicFileLockError(`atomic file lock owner changed before release (${lockPath})`)\n  }\n  try {\n    unlinkSync(lockPath)\n  } catch (error) {\n    if (!isMissing(error)) throw error\n  }\n}\n\nfunction canonicalOwner(owner: AtomicFileLockOwner): string {\n  return JSON.stringify({ host: owner.host, nonce: owner.nonce, pid: owner.pid })\n}\n\nfunction recoveryPath(lockPath: string): string {\n  return `${lockPath}.reclaim`\n}\n\nfunction isAlreadyExists(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'EEXIST'\n}\n\nfunction isMissing(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ENOENT'\n}\n\nfunction isNoSuchProcess(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ESRCH'\n}\n\nfunction unlinkIfExists(path: string): void {\n  try {\n    unlinkSync(path)\n  } catch (error) {\n    if (!isMissing(error)) throw error\n  }\n}\n","import { ValidationError } from '../errors'\n\nexport class SearchLedgerError extends ValidationError {}\n\nexport class SearchLedgerIntegrityError extends SearchLedgerError {}\n\nexport class SearchLedgerConflictError extends SearchLedgerError {}\n"],"mappings":";;;;;;;;;;;;;AAWA,SAAS,QAAAA,aAAY;;;AC2Cd,IAAM,wBAAN,cAAoC,eAAe;AAAA,EACxD,YACE,SACgB,QAChB;AACA,UAAM,qBAAqB,OAAO;AAFlB;AAAA,EAGlB;AAAA,EAHkB;AAIpB;AAOO,SAAS,0BACd,SACwB;AACxB,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC,YAAY;AAAA,MACvB,aAAa,OAAO,WAAW;AAAA,MAC/B,cAAc,OAAO,WAAW;AAAA,MAChC,SAAS,OAAO;AAAA,IAClB,EAAE;AAAA,EACJ;AACF;AAGO,SAAS,+BACd,UACwB;AACxB,SAAO;AAAA,IACL,SACG,OAAO,CAAC,YAAY,QAAQ,YAAY,OAAO,EAC/C,IAAI,CAAC,aAAa;AAAA,MACjB,aAAa,QAAQ;AAAA,MACrB,cAAc,QAAQ;AAAA,MACtB,SAAS,QAAQ;AAAA,IACnB,EAAE;AAAA,EACN;AACF;AAQA,SAAS,sBAAsB,SAA0D;AACvF,QAAM,eAAe,QAAQ;AAC7B,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,MAAI,kBAAkB;AACtB,MAAI,mBAAmB;AACvB,MAAI,oBAAoB;AACxB,MAAI,eAAe;AACnB,aAAW,OAAO,SAAS;AACzB,wBAAoB,IAAI;AACxB,yBAAqB,IAAI;AACzB,oBAAgB,IAAI;AACpB,QAAI,IAAI,gBAAgB,KAAK,IAAI,iBAAiB,EAAG;AAAA,QAChD;AACL,QAAI,IAAI,eAAe,KAAK,IAAI,YAAY,EAAG;AAAA,EACjD;AACA,QAAM,UACJ,iBAAiB,IACb,SACA,gBAAgB,eACd,SACA,gBAAgB,IACd,SACA;AACV,QAAM,YAAY,eAAe;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,eAAe,GAAsD;AAC5E,MAAI,EAAE,iBAAiB,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAI,EAAE,YAAY,QAAQ;AACxB,WAAO;AAAA,MACL,OAAO,EAAE,YAAY;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,GAAG;AAAA,EACZ;AACA,MAAI,EAAE,YAAY,SAAS;AACzB,UAAM,OAAQ,EAAE,cAAc,EAAE,eAAgB,KAAK,QAAQ,CAAC;AAC9D,WAAO;AAAA,MACL,GAAG,EAAE,WAAW,IAAI,EAAE,YAAY,aAAa,GAAG;AAAA,MAClD;AAAA,MACA;AAAA,IACF,EAAE,KAAK,GAAG;AAAA,EACZ;AAEA,MAAI,EAAE,kBAAkB,GAAG;AACzB,UAAM,OAAQ,EAAE,kBAAkB,EAAE,eAAgB,KAAK,QAAQ,CAAC;AAClE,WAAO;AAAA,MACL,GAAG,EAAE,YAAY,uCAAuC,EAAE,gBAAgB,SAAS,EAAE,iBAAiB;AAAA,MACtG,GAAG,EAAE,eAAe,KAAK,GAAG;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,GAAG;AAAA,EACZ;AACA,SAAO,GAAG,EAAE,YAAY,uCAAuC,EAAE,gBAAgB,SAAS,EAAE,iBAAiB,aAAa,EAAE,aAAa,QAAQ,CAAC,CAAC;AACrJ;AASO,SAAS,kBACd,SACA,OAAiC,CAAC,GACV;AACxB,QAAM,SAAS,0BAA0B,OAAO;AAChD,SAAO,oBAAoB,QAAQ,IAAI;AACzC;AAGO,SAAS,wBACd,UACA,OAAiC,CAAC,GACV;AACxB,QAAM,SAAS,+BAA+B,QAAQ;AACtD,SAAO,oBAAoB,QAAQ,IAAI;AACzC;AAEA,SAAS,oBACP,QACA,MACwB;AACxB,QAAM,aAAa,KAAK,cAAc;AACtC,MAAI,OAAO,YAAY,QAAQ;AAC7B,UAAM,IAAI;AAAA,MACR,wEAAmE,OAAO,SAAS;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,cAAc,OAAO,YAAY,SAAS;AAC7C,UAAM,IAAI;AAAA,MACR,8DAAyD,OAAO,SAAS;AAAA,MACzE;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ACzMA,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB,YAAY,oBAAoB;AAKzD,SAAS,eAAe,OAAgB,MAAsB;AAC5D,MAAI,UAAU,KAAM,QAAO;AAC3B,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AACH,aAAO,QAAQ,SAAS;AAAA,IAC1B,KAAK;AACH,UAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3B,cAAM,IAAI;AAAA,UACR,qCAAqC,KAAK,QAAQ,IAAI;AAAA,QACxD;AAAA,MACF;AACA,aAAO,KAAK,UAAU,KAAK;AAAA,IAC7B,KAAK;AACH,aAAO,KAAK,UAAU,KAAK;AAAA,IAC7B,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,YAAM,IAAI;AAAA,QACR,kBAAkB,OAAO,KAAK,OAAO,IAAI;AAAA,MAC3C;AAAA,IACF,KAAK;AACH,YAAM,IAAI,MAAM,4BAA4B,IAAI,mCAA8B;AAAA,IAChF,KAAK;AACH;AAAA,EACJ;AACA,QAAM,MAAM;AAGZ,MAAI,OAAO,IAAI,WAAW,YAAY;AACpC,WAAO,eAAgB,IAA8B,OAAO,GAAG,IAAI;AAAA,EACrE;AACA,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,WAAO,IAAI,IAAI,IAAI,CAAC,MAAM,MAAM,eAAe,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,EAClF;AACA,MAAI,eAAe,OAAO,eAAe,KAAK;AAC5C,UAAM,IAAI;AAAA,MACR,kBAAkB,eAAe,MAAM,QAAQ,KAAK,OAAO,IAAI;AAAA,IACjE;AAAA,EACF;AACA,QAAM,OAAO,OAAO,KAAK,GAAG,EAAE,KAAK;AACnC,QAAM,QAAQ,KAAK,IAAI,CAAC,MAAM,GAAG,KAAK,UAAU,CAAC,CAAC,IAAI,eAAe,IAAI,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,EAAE;AAC9F,SAAO,IAAI,MAAM,KAAK,GAAG,CAAC;AAC5B;AAYO,SAAS,cAAc,OAAwB;AACpD,SAAO,eAAe,OAAO,GAAG;AAClC;AAIO,SAAS,YAAY,OAAwB;AAClD,SAAO,WAAW,QAAQ,EAAE,OAAO,cAAc,KAAK,CAAC,EAAE,OAAO,KAAK;AACvE;AAYO,SAAS,uBAA0C;AACxD,QAAM,UAAU,oBAAI,IAAwB;AAC5C,SAAO;AAAA,IACL,KAAK,CAAC,QAAQ,QAAQ,IAAI,GAAG;AAAA,IAC7B,KAAK,CAAC,KAAK,UAAU;AACnB,cAAQ,IAAI,KAAK,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAOA,SAAS,eAAe,MAAc,MAAc,QAAkC;AACpF,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,IAAI;AAAA,EAC1B,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,sCAAsC,IAAI,IAAI,MAAM,WAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IAC5G;AAAA,EACF;AACA,QAAM,MAAM;AACZ,MACE,OAAO,QAAQ,YACf,QAAQ,QACR,OAAO,IAAI,QAAQ,YACnB,OAAO,IAAI,UAAU,YACrB,IAAI,UAAU,QACd,OAAO,IAAI,MAAM,cAAc,YAC/B,OAAO,IAAI,MAAM,eAAe,UAChC;AACA,UAAM,IAAI;AAAA,MACR,6CAA6C,IAAI,IAAI,MAAM;AAAA,IAC7D;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,iBAAiB,MAAiC;AAChE,QAAM,UAAU,oBAAI,IAAwB;AAC5C,MAAI,WAAW,IAAI,GAAG;AACpB,UAAM,QAAQ,aAAa,MAAM,MAAM,EAAE,MAAM,IAAI;AACnD,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,SAAS,UAAa,KAAK,KAAK,MAAM,GAAI;AAC9C,YAAM,MAAM,eAAe,MAAM,MAAM,IAAI,CAAC;AAC5C,cAAQ,IAAI,IAAI,KAAK,IAAI,KAAK;AAAA,IAChC;AAAA,EACF;AACA,SAAO;AAAA,IACL,KAAK,CAAC,QAAQ,QAAQ,IAAI,GAAG;AAAA,IAC7B,KAAK,CAAC,KAAK,UAAU;AACnB,qBAAe,MAAM,GAAG,KAAK,UAAU,EAAE,KAAK,MAAM,CAAC,CAAC;AAAA,GAAM,MAAM;AAClE,cAAQ,IAAI,KAAK,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAiCO,SAAS,YACd,OACA,OACA,SACmC;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,QAAQ,aAAa,KAAK,MAAM,IAAI;AAClF,UAAM,IAAI,MAAM,sEAAsE;AAAA,EACxF;AACA,QAAM,QAA2B,EAAE,MAAM,GAAG,QAAQ,EAAE;AACtD,QAAM,UAA6C;AAAA,IACjD,MAAM,MAAM;AAAA,IACZ,YAAY,MAAM;AAAA,IAClB,cAAc,QAAQ;AAAA,IACtB,MAAM,MAAM,OAAO;AACjB,YAAM,MAAM,YAAY;AAAA,QACtB,UAAU,cAAc,MAAM,QAAQ;AAAA,QACtC,YAAY,MAAM,SAAS;AAAA,QAC3B,WAAW,MAAM;AAAA,QACjB,YAAY,MAAM;AAAA,QAClB,cAAc,QAAQ;AAAA,MACxB,CAAC;AACD,YAAM,SAAS,MAAM,MAAM,IAAI,GAAG;AAClC,UAAI,WAAW,QAAW;AACxB,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,YAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;AACrC,YAAM,MAAM,IAAI,KAAK,KAAK;AAC1B,YAAM,UAAU;AAChB,aAAO;AAAA,IACT;AAAA,IACA,OAAO,OAAO,EAAE,GAAG,MAAM;AAAA,EAC3B;AACA,MAAI,MAAM,UAAW,SAAQ,YAAY,MAAM;AAC/C,SAAO;AACT;;;AClOO,SAAS,qBACd,WACA,MACM;AACN,MAAI,CAAC,OAAO,cAAc,IAAI,KAAK,OAAO,GAAG;AAC3C,UAAM,IAAI,MAAM,6DAA6D;AAAA,EAC/E;AACA,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,YAAY,WAAW;AAChC,QAAI,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,KAAK,EAAE,WAAW,GAAG;AACtE,YAAM,IAAI,MAAM,gEAAgE;AAAA,IAClF;AACA,QAAI,YAAY,IAAI,SAAS,EAAE,GAAG;AAChC,YAAM,IAAI,MAAM,mDAAmD,SAAS,EAAE,GAAG;AAAA,IACnF;AACA,QAAI,OAAO,SAAS,SAAS,YAAY,SAAS,KAAK,KAAK,EAAE,WAAW,GAAG;AAC1E,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,QACE,SAAS,cAAc,WACtB,OAAO,SAAS,cAAc,YAAY,SAAS,UAAU,KAAK,EAAE,WAAW,IAChF;AACA,YAAM,IAAI,MAAM,sEAAsE;AAAA,IACxF;AACA,gBAAY,IAAI,SAAS,EAAE;AAAA,EAC7B;AACF;AAGO,SAAS,yBACd,UAC2D;AAC3D,uBAAqB,CAAC,QAAQ,GAAG,CAAC;AAClC,SAAO;AAAA,IACL,IAAI,SAAS;AAAA,IACb,MAAM,SAAS;AAAA,IACf,gBAAgB,UAAU,YAAY,QAAQ,CAAC;AAAA,EACjD;AACF;AAGO,SAAS,kCACd,WACA,MACoB;AACpB,uBAAqB,WAAW,IAAI;AACpC,aAAW,YAAY,WAAW;AAChC,QAAI,CAAC,wBAAwB,KAAK,SAAS,cAAc,GAAG;AAC1D,YAAM,IAAI,MAAM,sBAAsB,SAAS,EAAE,yBAAyB;AAAA,IAC5E;AAAA,EACF;AACA,SAAO,UAAU,YAAY;AAAA,IAC3B,QAAQ;AAAA,IACR,WAAW,UAAU,IAAI,CAAC,EAAE,IAAI,MAAM,eAAe,OAAO,EAAE,IAAI,MAAM,eAAe,EAAE;AAAA,IACzF;AAAA,EACF,CAAC,CAAC;AACJ;AAGO,SAAS,oBACd,WACA,MACoB;AACpB,uBAAqB,WAAW,IAAI;AACpC,SAAO,kCAAkC,UAAU,IAAI,wBAAwB,GAAG,IAAI;AACxF;AAGO,SAAS,4BACd,WACA,MACA,aACM;AACN,MAAI,kCAAkC,WAAW,IAAI,MAAM,aAAa;AACtE,UAAM,IAAI,MAAM,uEAAuE;AAAA,EACzF;AACF;AAGO,SAAS,iBACd,OACA,WACA,MACA,mBACkB;AAClB,uBAAqB,WAAW,IAAI;AACpC,QAAM,kBAAkB,gBAAgB,WAAW,IAAI;AACvD,QAAM,YAAY,oBAAI,IAA6C;AACnE,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,UAAU,IAAI,KAAK,MAAM,KAAK,CAAC;AAC/C,YAAQ,KAAK,IAAI;AACjB,cAAU,IAAI,KAAK,QAAQ,OAAO;AAAA,EACpC;AAEA,QAAM,kBAA4B,CAAC;AACnC,QAAM,kBAA6D,CAAC;AACpE,aAAW,UAAU,iBAAiB;AACpC,UAAM,UAAU,UAAU,IAAI,MAAM,KAAK,CAAC;AAC1C,QAAI,QAAQ,WAAW,GAAG;AACxB,sBAAgB,KAAK,EAAE,QAAQ,QAAQ,wBAAwB,CAAC;AAChE;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,GAAG;AACtB,sBAAgB,KAAK,EAAE,QAAQ,QAAQ,4BAA4B,QAAQ,MAAM,IAAI,CAAC;AACtF;AAAA,IACF;AAEA,UAAM,OAAO,QAAQ,CAAC;AACtB,UAAM,eAAe,OAAO,QAAQ,KAAK,WAAW;AACpD,UAAM,mBAAmB,aACtB,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,KAAK,EACxB,OAAO,CAAC,UAAU,MAAM,WAAW,QAAQ,OAAO,SAAS,MAAM,SAAS,CAAC;AAC9E,UAAM,kBAAkB,aAAa;AAAA,MACnC,CAAC,CAAC,EAAE,KAAK,MACP,MAAM,WAAW,SAChB,CAAC,OAAO,SAAS,MAAM,SAAS,KAC/B,OAAO,OAAO,MAAM,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,SAAS,KAAK,CAAC;AAAA,IAC7E;AACA,UAAM,UAAoB,CAAC;AAC3B,QAAI,KAAK,MAAO,SAAQ,KAAK,KAAK,KAAK;AACvC,QAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAW,SAAQ,KAAK,kBAAkB;AAC1F,QAAI,CAAC,KAAK,SAAS,qBAAqB,iBAAiB,WAAW,GAAG;AACrE,cAAQ,KAAK,kCAAkC;AAAA,IACjD;AACA,QAAI,aAAa,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,WAAW,IAAI,GAAG;AAC3D,cAAQ,KAAK,2BAA2B;AAAA,IAC1C;AACA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,cAAQ;AAAA,QACN,2BAA2B,gBACxB,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI,EACpB,KAAK,EACL,KAAK,IAAI,CAAC;AAAA,MACf;AAAA,IACF;AAEA,QAAI,QAAQ,SAAS,GAAG;AACtB,sBAAgB,KAAK,EAAE,QAAQ,QAAQ,QAAQ,KAAK,IAAI,EAAE,CAAC;AAAA,IAC7D,OAAO;AACL,sBAAgB,KAAK,MAAM;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,WAAW,IAAI,IAAI,eAAe;AACxC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,GAAG,KAAK,UAAU,IAAI,KAAK,GAAG,IAAI;AACpD,sBAAgB,KAAK;AAAA,QACnB,QAAQ,KAAK;AAAA,QACb,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AACA,QAAI,CAAC,SAAS,IAAI,KAAK,MAAM,GAAG;AAC9B,sBAAgB,KAAK,EAAE,QAAQ,KAAK,QAAQ,QAAQ,2BAA2B,CAAC;AAAA,IAClF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,UAAU,gBAAgB,WAAW,KAAK,gBAAgB,WAAW,gBAAgB;AAAA,IACrF;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,uBAAuB,UAAoC;AACzE,QAAM,QAAQ,SAAS,gBACpB,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,SAAS,GAAG,KAAK,MAAM,KAAK,KAAK,MAAM,EAAE,EAC9C,KAAK,IAAI;AACZ,QAAM,YAAY,SAAS,gBAAgB,SAAS,KAAK,IAAI,GAAG,SAAS,gBAAgB,MAAM;AAC/F,SAAO,YAAY,IAAI,GAAG,KAAK,MAAM,SAAS,UAAU,SAAS;AACnE;AAEA,SAAS,gBACP,WACA,MACU;AACV,QAAM,MAAgB,CAAC;AACvB,aAAW,YAAY,WAAW;AAChC,aAAS,MAAM,GAAG,MAAM,MAAM,MAAO,KAAI,KAAK,GAAG,SAAS,EAAE,IAAI,GAAG,EAAE;AAAA,EACvE;AACA,SAAO;AACT;;;AClMA,SAAS,eAAe;AACxB,SAAS,UAAU,YAAY,YAAY;AAOpC,SAAS,mBAA2B;AACzC,SAAO,KAAK,QAAQ,GAAG,WAAW,QAAQ;AAC5C;AAMO,SAAS,cAAc,QAAgB,MAAuB;AACnE,MAAI,WAAW,MAAM,KAAK,OAAO,WAAW,QAAQ,EAAG,QAAO;AAC9D,QAAM,IAAI,QAAQ,KAAK,KAAK,EAAE,SAAS,IAAI,OAAO,SAAS,QAAQ,IAAI,CAAC;AACxE,SAAO,KAAK,iBAAiB,GAAG,GAAG,QAAQ,MAAM;AACnD;;;ACpBA,SAAS,qBAAqB;AAC9B,SAAS,QAAAC,aAAY;;;ACCrB,SAAS,aAAAC,YAAW,aAAAC,YAAW,aAAAC,YAAW,WAAW,YAAAC,WAAU,iBAAiB;AAChF,SAAS,eAAe;;;ACDxB,SAAS,kBAAkB;AAC3B;AAAA,EACE;AAAA,EACA;AAAA,EACA,cAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,gBAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,gBAAgB;AA2BlB,IAAM,sBAAN,cAAkC,MAAM;AAAA,EAC3B,OAAO;AAC3B;AAQO,SAAS,oBACd,SACkC;AAClC,MAAID,YAAW,aAAa,QAAQ,QAAQ,CAAC,EAAG,QAAO,EAAE,UAAU,OAAO,QAAQ,WAAW;AAC7F,QAAM,QAAQ,WAAW,QAAQ,UAAU,QAAQ,mBAAmB,KAAK;AAC3E,MAAI,MAAM,UAAU,QAAQ;AAC1B,WAAO,EAAE,UAAU,OAAO,QAAQ,QAAQ,QAAQ,MAAM,MAAM;AAAA,EAChE;AACA,SAAO;AACT;AAQO,SAAS,yBACd,SAC2B;AAC3B,QAAM,MAAM,QAAQ,OAAO,QAAQ;AACnC,MAAI,CAAC,OAAO,cAAc,GAAG,KAAK,OAAO,GAAG;AAC1C,UAAM,IAAI,oBAAoB,iDAAiD;AAAA,EACjF;AACA,QAAM,QAA6B,EAAE,KAAK,MAAM,SAAS,GAAG,OAAO,WAAW,EAAE;AAChF,QAAM,kBAAkB,QAAQ,mBAAmB;AAEnD,WAAS,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG;AAC/C,QAAIA,YAAW,aAAa,QAAQ,QAAQ,CAAC,GAAG;AAC9C,aAAO,EAAE,UAAU,OAAO,QAAQ,WAAW;AAAA,IAC/C;AACA,QAAI,aAAa,QAAQ,UAAU,OAAO,WAAW,OAAO,EAAE,GAAG;AAC/D,aAAO,SAAS,QAAQ,UAAU,KAAK;AAAA,IACzC;AAEA,UAAM,SAAS,WAAW,QAAQ,UAAU,eAAe;AAC3D,QAAI,OAAO,UAAU,UAAW;AAChC,QAAI,OAAO,UAAU,QAAQ;AAC3B,aAAO,EAAE,UAAU,OAAO,QAAQ,QAAQ,QAAQ,OAAO,MAAM;AAAA,IACjE;AAEA,UAAM,cAAc,aAAa,QAAQ,QAAQ;AACjD,QAAI,CAAC,aAAa,aAAa,OAAO,WAAW,OAAO,EAAE,GAAG;AAC3D,aAAO,EAAE,UAAU,OAAO,QAAQ,WAAW;AAAA,IAC/C;AACA,QAAI;AACF,YAAM,UAAU,WAAW,QAAQ,UAAU,eAAe;AAC5D,UAAI,QAAQ,UAAU,QAAQ;AAC5B,eAAO,EAAE,UAAU,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,MAAM;AAAA,MAClE;AACA,UAAI,QAAQ,UAAU,SAAS;AAC7B,cAAM,YAAY,GAAG,QAAQ,QAAQ,UAAU,MAAM,KAAK,IAAI,OAAO;AACrE,YAAI;AACF,qBAAW,QAAQ,UAAU,SAAS;AACtC,qBAAW,SAAS;AAAA,QACtB,SAAS,OAAO;AACd,cAAI,CAAC,UAAU,KAAK,EAAG,OAAM;AAAA,QAC/B;AAAA,MACF;AACA,UAAI,aAAa,QAAQ,UAAU,OAAO,aAAa,OAAO,EAAE,GAAG;AACjE,eAAO,SAAS,QAAQ,UAAU,KAAK;AAAA,MACzC;AAAA,IACF,UAAE;AACA,uBAAiB,aAAa,KAAK;AAAA,IACrC;AAAA,EACF;AAEA,QAAM,IAAI,oBAAoB,sCAAsC,QAAQ,QAAQ,EAAE;AACxF;AAEA,SAAS,SAAS,UAAkB,OAAuD;AACzF,SAAO;AAAA,IACL,UAAU;AAAA,IACV,MAAM;AAAA,MACJ;AAAA,MACA,SAAS,MAAM,iBAAiB,UAAU,KAAK;AAAA,IACjD;AAAA,EACF;AACF;AAEA,SAAS,aAAa,UAAkB,OAA4B,QAAyB;AAC3F,QAAM,YAAY,GAAG,QAAQ,IAAI,MAAM,GAAG,IAAI,MAAM,KAAK,IAAI,MAAM;AACnE,QAAM,aAAa;AAAA,IACjB;AAAA,IACA,UAAU,UAAU,UAAU,SAAS,UAAU;AAAA,IACjD;AAAA,EACF;AACA,MAAI;AACF,kBAAc,YAAY,GAAG,eAAe,KAAK,CAAC;AAAA,GAAM,MAAM;AAC9D,cAAU,UAAU;AAAA,EACtB,SAAS,OAAO;AACd,cAAU,UAAU;AACpB,mBAAe,SAAS;AACxB,UAAM;AAAA,EACR;AACA,YAAU,UAAU;AAEpB,MAAI;AACF,aAAS,WAAW,QAAQ;AAC5B,WAAO;AAAA,EACT,SAAS,OAAO;AACd,QAAI,CAAC,gBAAgB,KAAK,EAAG,OAAM;AACnC,WAAO;AAAA,EACT,UAAE;AACA,mBAAe,SAAS;AAAA,EAC1B;AACF;AAEA,SAAS,WAAW,UAAkB,iBAAsC;AAC1E,QAAM,QAAQ,UAAU,UAAU,eAAe;AACjD,MAAI,CAAC,MAAO,QAAO,EAAE,OAAO,UAAU;AACtC,MAAI,MAAM,SAAS,SAAS,EAAG,QAAO,EAAE,OAAO,QAAQ,MAAM;AAC7D,MAAI;AACF,YAAQ,KAAK,MAAM,KAAK,CAAC;AACzB,WAAO,EAAE,OAAO,QAAQ,MAAM;AAAA,EAChC,SAAS,OAAO;AACd,QAAI,gBAAgB,KAAK,EAAG,QAAO,EAAE,OAAO,SAAS,MAAM;AAC3D,WAAO,EAAE,OAAO,QAAQ,MAAM;AAAA,EAChC;AACF;AAEA,SAAS,UAAU,UAAkB,iBAA2D;AAC9F,MAAI;AACJ,MAAI;AACF,eAAWC,cAAa,UAAU,MAAM,EAAE,KAAK;AAAA,EACjD,SAAS,OAAO;AACd,QAAI,UAAU,KAAK,EAAG,QAAO;AAC7B,UAAM;AAAA,EACR;AAEA,MAAI,mBAAmB,aAAa,KAAK,QAAQ,GAAG;AAClD,UAAM,MAAM,OAAO,QAAQ;AAC3B,QAAI,OAAO,cAAc,GAAG,EAAG,QAAO,EAAE,KAAK,MAAM,SAAS,GAAG,OAAO,aAAa;AAAA,EACrF;AAEA,MAAI;AACJ,MAAI;AACF,YAAQ,KAAK,MAAM,QAAQ;AAAA,EAC7B,SAAS,OAAO;AACd,UAAM,aAAa,UAAU,KAAK;AAAA,EACpC;AACA,MAAI,CAAC,QAAQ,KAAK,EAAG,OAAM,aAAa,QAAQ;AAChD,SAAO;AACT;AAEA,SAAS,QAAQ,OAA8C;AAC7D,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,EAAG,QAAO;AAChF,QAAM,SAAS;AACf,SACE,OAAO,KAAK,MAAM,EAAE,WAAW,KAC/B,OAAO,cAAc,OAAO,GAAG,KAC/B,OAAO,OAAO,GAAG,IAAI,KACrB,OAAO,OAAO,SAAS,YACvB,OAAO,KAAK,KAAK,EAAE,SAAS,KAC5B,OAAO,OAAO,UAAU,YACxB,OAAO,MAAM,KAAK,EAAE,SAAS;AAEjC;AAEA,SAAS,aAAa,UAAkB,OAAsC;AAC5E,QAAM,QAAQ,IAAI;AAAA,IAChB,0CAA0C,QAAQ;AAAA,EACpD;AACA,MAAI,UAAU,OAAW,QAAO,eAAe,OAAO,SAAS,EAAE,OAAO,MAAM,CAAC;AAC/E,SAAO;AACT;AAEA,SAAS,iBAAiB,UAAkB,OAAkC;AAC5E,QAAM,UAAU,UAAU,UAAU,IAAI;AACxC,MAAI,CAAC,QAAS;AACd,MAAI,eAAe,OAAO,MAAM,eAAe,KAAK,GAAG;AACrD,UAAM,IAAI,oBAAoB,kDAAkD,QAAQ,GAAG;AAAA,EAC7F;AACA,MAAI;AACF,eAAW,QAAQ;AAAA,EACrB,SAAS,OAAO;AACd,QAAI,CAAC,UAAU,KAAK,EAAG,OAAM;AAAA,EAC/B;AACF;AAEA,SAAS,eAAe,OAAoC;AAC1D,SAAO,KAAK,UAAU,EAAE,MAAM,MAAM,MAAM,OAAO,MAAM,OAAO,KAAK,MAAM,IAAI,CAAC;AAChF;AAEA,SAAS,aAAa,UAA0B;AAC9C,SAAO,GAAG,QAAQ;AACpB;AAEA,SAAS,gBAAgB,OAAyB;AAChD,SAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,UAAU,OAAyB;AAC1C,SAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,gBAAgB,OAAyB;AAChD,SAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,eAAe,MAAoB;AAC1C,MAAI;AACF,eAAW,IAAI;AAAA,EACjB,SAAS,OAAO;AACd,QAAI,CAAC,UAAU,KAAK,EAAG,OAAM;AAAA,EAC/B;AACF;;;AChQO,IAAM,oBAAN,cAAgC,gBAAgB;AAAC;AAEjD,IAAM,6BAAN,cAAyC,kBAAkB;AAAC;AAE5D,IAAM,4BAAN,cAAwC,kBAAkB;AAAC;;;AFC3D,SAAS,uBAAuB,MAAc,MAAoB;AACvE,YAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5C,QAAM,KAAKC,UAAS,MAAMC,WAAU,UAAUA,WAAU,WAAWA,WAAU,UAAU,GAAK;AAC5F,MAAI;AACF,aAAS,IAAI,OAAO,KAAK,MAAM,MAAM,CAAC;AACtC,IAAAC,WAAU,EAAE;AAAA,EACd,UAAE;AACA,IAAAC,WAAU,EAAE;AAAA,EACd;AACA,iBAAe,QAAQ,IAAI,CAAC;AAC9B;AAEO,SAAS,yBAA4B,YAAoB,KAAiB;AAC/E,QAAM,SAAS,4BAA4B,YAAY,GAAG;AAC1D,MAAI,CAAC,OAAO,UAAU;AACpB,UAAM,IAAI,2BAA2B,+BAA+B,UAAU,GAAG;AAAA,EACnF;AACA,SAAO,OAAO;AAChB;AAIO,SAAS,4BACd,YACA,KACmB;AACnB,YAAU,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAClD,QAAM,WAAW,GAAG,UAAU;AAC9B,MAAI;AACF,UAAM,cAAc,yBAAyB,EAAE,SAAS,CAAC;AACzD,QAAI,CAAC,YAAY,SAAU,QAAO,EAAE,UAAU,MAAM;AACpD,QAAI;AACF,aAAO,EAAE,UAAU,MAAM,OAAO,IAAI,EAAE;AAAA,IACxC,UAAE;AACA,kBAAY,KAAK,QAAQ;AAAA,IAC3B;AAAA,EACF,SAAS,OAAO;AACd,QAAI,iBAAiB,qBAAqB;AACxC,YAAM,IAAI,2BAA2B,MAAM,SAAS,EAAE,OAAO,MAAM,CAAC;AAAA,IACtE;AACA,UAAM;AAAA,EACR;AACF;AAEA,SAAS,SAAS,IAAY,OAAqB;AACjD,MAAI,SAAS;AACb,SAAO,SAAS,MAAM,YAAY;AAChC,UAAM,UAAU,UAAU,IAAI,OAAO,QAAQ,MAAM,aAAa,MAAM;AACtE,QAAI,WAAW,EAAG,OAAM,IAAI,2BAA2B,6BAA6B;AACpF,cAAU;AAAA,EACZ;AACF;AAEA,SAAS,eAAe,MAAoB;AAC1C,QAAM,KAAKH,UAAS,MAAMC,WAAU,QAAQ;AAC5C,MAAI;AACF,IAAAC,WAAU,EAAE;AAAA,EACd,UAAE;AACA,IAAAC,WAAU,EAAE;AAAA,EACd;AACF;;;AD1BO,SAAS,oBAAqC;AACnD,QAAM,cAAc,cAAc,YAAY,GAAG;AACjD,QAAM,EAAE,YAAAC,aAAY,WAAAC,YAAW,cAAAC,eAAc,UAAU,eAAAC,eAAc,IAAI;AAAA,IACvE;AAAA,EACF;AACA,SAAO;AAAA,IACL,UAAU,KAAK;AACb,UAAI,CAACH,YAAW,GAAG,EAAG,CAAAC,WAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAAA,IAC1D;AAAA,IACA,OAAO,MAAM;AACX,aAAOD,YAAW,IAAI;AAAA,IACxB;AAAA,IACA,KAAK,MAAM;AACT,UAAI;AACF,eAAOE,cAAa,MAAM,MAAM;AAAA,MAClC,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IACA,MAAM,MAAM,SAAS;AACnB,MAAAC,eAAc,MAAM,OAAqB;AAAA,IAC3C;AAAA,IACA,OAAO,MAAM,SAAS,eAAe;AACnC,YAAM,SAAS,4BAA4B,MAAM,MAAM;AACrD,YAAI,cAAc;AAClB,YAAI;AACF,wBAAc,SAAS,IAAI,EAAE;AAAA,QAC/B,SAAS,OAAO;AACd,cAAK,MAAgC,SAAS,SAAU,OAAM;AAAA,QAChE;AACA,YAAI,gBAAgB,cAAe,QAAO;AAC1C,+BAAuB,MAAM,OAAO;AACpC,eAAO,gBAAgB,OAAO,WAAW,OAAO;AAAA,MAClD,CAAC;AACD,aAAO,OAAO,WAAW,OAAO,QAAQ;AAAA,IAC1C;AAAA,EACF;AACF;AAKO,SAAS,0BAA2C;AACzD,QAAM,QAAQ,oBAAI,IAAiC;AACnD,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO;AAAA,IACL,UAAU,KAAK;AACb,WAAK,IAAI,GAAG;AAAA,IACd;AAAA,IACA,OAAO,MAAM;AACX,aAAO,MAAM,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,IACzC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,UAAI,UAAU,OAAW,QAAO;AAChC,aAAO,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,EAAE,OAAO,KAAK;AAAA,IAC3E;AAAA,IACA,MAAM,MAAM,SAAS;AACnB,YAAM,IAAI,MAAM,OAAO;AAAA,IACzB;AAAA,IACA,OAAO,MAAM,SAAS,eAAe;AACnC,YAAM,UAAU,MAAM,IAAI,IAAI;AAC9B,YAAM,cACJ,YAAY,SACR,KACA,OAAO,YAAY,WACjB,UACA,IAAI,YAAY,EAAE,OAAO,OAAO;AACxC,YAAM,eAAe,IAAI,YAAY,EAAE,OAAO,WAAW,EAAE;AAC3D,UAAI,iBAAiB,cAAe,QAAO;AAC3C,YAAM,IAAI,MAAM,GAAG,WAAW,GAAG,OAAO,EAAE;AAC1C,aAAO,eAAe,IAAI,YAAY,EAAE,OAAO,OAAO,EAAE;AAAA,IAC1D;AAAA,EACF;AACF;AAGO,SAAS,oBAAoB,OAIrB;AACb,QAAM,OAAOC,MAAK,MAAM,QAAQ,mBAAmB;AACnD,QAAM,QAAQ,UAAU,MAAM,MAAM;AACpC,SAAO,IAAI,WAAW;AAAA,IACpB,gBAAgB,MAAM;AAAA,IACtB,aAAa;AAAA,MACX,MAAM,MAAM;AACV,cAAM,SAAS,MAAM,QAAQ,KAAK,IAAI;AACtC,YAAI,WAAW,UAAa,MAAM,QAAQ,OAAO,IAAI,GAAG;AACtD,gBAAM,IAAI,MAAM,+CAA+C,IAAI,GAAG;AAAA,QACxE;AACA,cAAM,SAAS,UAAU;AACzB,eAAO;AAAA,UACL,UAAU,OAAO,IAAI,YAAY,EAAE,OAAO,MAAM,EAAE,UAAU;AAAA,UAC5D;AAAA,QACF;AAAA,MACF;AAAA,MACA,QAAQ,CAAC,kBAAkB,UAAU;AACnC,cAAM,gBAAgB,OAAO,gBAAgB;AAC7C,YAAI,CAAC,OAAO,cAAc,aAAa,KAAK,gBAAgB,GAAG;AAC7D,gBAAM,IAAI,MAAM,yCAAyC,gBAAgB,GAAG;AAAA,QAC9E;AACA,YAAI,CAAC,MAAM,QAAQ,QAAQ;AACzB,gBAAM,IAAI,MAAM,+DAA+D;AAAA,QACjF;AACA,cAAM,OAAO,MAAM,QAAQ,OAAO,MAAM,OAAO,aAAa;AAC5D,eAAO,SAAS,SAAY,SAAY,OAAO,IAAI;AAAA,MACrD;AAAA,IACF;AAAA,EACF,CAAC;AACH;;;ALwBA,eAAsB,YACpB,MAC+C;AAC/C,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,MAAM,KAAK,QAAQ,MAAM,oBAAI,KAAK;AACxC,QAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,QAAM,UAAU,KAAK,WAAW,kBAAkB;AAClD,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,4BAA4B,KAAK,6BAA6B;AAEpE,uBAAqB,KAAK,WAAW,IAAI;AACzC,MAAI,CAAC,OAAO,cAAc,yBAAyB,KAAK,6BAA6B,GAAG;AACtF,UAAM,IAAI,MAAM,wEAAwE;AAAA,EAC1F;AAEA,MAAI,OAAO,KAAK,WAAW,YAAY,KAAK,OAAO,KAAK,EAAE,WAAW,GAAG;AACtE,UAAM,IAAI,MAAM,gEAAgE;AAAA,EAClF;AACA,OAAK,SAAS,cAAc,KAAK,QAAQ,KAAK,IAAI;AAClD,UAAQ,UAAU,KAAK,MAAM;AAC7B,QAAM,aACJ,KAAK,cACL,oBAAoB;AAAA,IAClB;AAAA,IACA,QAAQ,KAAK;AAAA,IACb,gBAAgB,KAAK;AAAA,EACvB,CAAC;AACH,MAAI,KAAK,gBAAgB,UAAa,WAAW,mBAAmB,KAAK,aAAa;AACpF,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,QAAM,iBAAiB,KAAK,kBAAkB;AAE9C,QAAM,eAAe,oBAAoB;AAAA,IACvC,WAAW,KAAK;AAAA,IAChB;AAAA,IACA,aAAa,eAAe,KAAK,UAAU,KAAK,WAAW;AAAA,IAC3D;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,cAAc,oBAAoB,KAAK,WAAW,IAAI;AAE5D,QAAM,YAAY,IAAI;AACtB,QAAM,eAAe,WAAW,OAAO,WAAW;AAClD,QAAM,QAAyC,CAAC;AAChD,QAAM,kBAA0C,CAAC;AAGjD,QAAM,WAAW,kBAAkB,KAAK,WAAW,MAAM,IAAI;AAG7D,QAAM,gBAAgB,IAAI,gBAAgB;AAC1C,QAAM,eAAe,MAAY,cAAc,MAAM,KAAK,QAAQ,MAAM;AACxE,MAAI,KAAK,QAAQ,QAAS,eAAc,MAAM,KAAK,OAAO,MAAM;AAAA,MAC3D,MAAK,QAAQ,iBAAiB,SAAS,cAAc,EAAE,MAAM,KAAK,CAAC;AACxE,QAAM,iBAAiB,cAAc;AAIrC,QAAM,QAAyB,CAAC;AAChC,MAAI,UAAU;AACd,QAAM,WAAW;AACjB,MAAI;AACJ,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAM;AAAA,OACH,YAAY;AACX,YAAI;AACF,iBAAO,MAAM;AACX,gBAAI,eAAe,QAAS;AAC5B,kBAAM,QAAQ;AACd,gBAAI,SAAS,SAAS,OAAQ;AAC9B,kBAAM,OAAO,SAAS,KAAK;AAC3B,kBAAM,SAAS,MAAM,YAAY;AAAA,cAC/B;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA,kBAAkB,KAAK,oBAAoB,wBAAwB,OAAO;AAAA,cAC1E,QAAQ;AAAA,cACR,mBAAmB,KAAK;AAAA,cACxB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA,WAAW,KAAK,mBACZ,CAAC,YAAY;AACX,oBAAI,qBAAqB,QAAW;AAClC,qCAAmB;AACnB,gCAAc,MAAM,QAAQ,KAAK;AAAA,gBACnC;AAAA,cACF,IACA;AAAA,YACN,CAAC;AACD,qBAAS,KAAK,OAAO,IAAI;AACzB,mBAAO,OAAO,iBAAiB,OAAO,eAAe;AAErD,gBAAI,KAAK,gBAAgB,KAAK,iBAAiB,SAAS,CAAC,OAAO,KAAK,OAAO;AAC1E,oBAAM,eAAe;AAAA,gBACnB,OAAO,KAAK;AAAA,gBACZ,MAAM,OAAO;AAAA,gBACb,UAAU,KAAK;AAAA,gBACf;AAAA,gBACA;AAAA,cACF,CAAC,EAAE,MAAM,CAAC,QAAQ;AAGhB,wBAAQ;AAAA,kBACN,oCAAoC,OAAO,KAAK,MAAM,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,gBAC7G;AAAA,cACF,CAAC;AAAA,YACH;AACA,gBAAI,KAAK,oBAAoB,OAAO,SAAS;AAC3C;AAAA,YACF;AAAA,UACF;AAAA,QACF,SAAS,OAAO;AACd,cAAI,mBAAmB,QAAW;AAChC,6BAAiB;AACjB,0BAAc,MAAM,KAAK;AAAA,UAC3B;AACA,gBAAM;AAAA,QACR;AAAA,MACF,GAAG;AAAA,IACL;AAAA,EACF;AACA,QAAM,cAAc,MAAM,QAAQ,WAAW,KAAK;AAClD,OAAK,QAAQ,oBAAoB,SAAS,YAAY;AACtD,QAAM,aAAa,YAAY;AAAA,IAC7B,CAAC,WAA4C,OAAO,WAAW;AAAA,EACjE;AACA,MAAI,iBAAkB,OAAM,iBAAiB;AAC7C,MAAI,WAAY,OAAM,kBAAkB,WAAW;AAEnD,QAAM,UAAU,IAAI;AACpB,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,cAAc,EAAE,MAAM,CAAC;AAExD,QAAM,eAAe,WAAW,QAAQ,EAAE,MAAM,EAAE,QAAQ,KAAK,OAAO,EAAE,CAAC;AACzE,QAAM,aAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,UAAU,YAAY;AAAA,IACjC,SAAS,QAAQ,YAAY;AAAA,IAC7B,YAAY,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AAAA,IAClD,OAAO;AAAA,IACP;AAAA,IACA,QAAQ,KAAK;AAAA,IACb;AAAA,IACA,WAAW,KAAK,UAAU,IAAI,wBAAwB;AAAA,EACxD;AACF;AAiCA,eAAe,YACb,MACuC;AACvC,QAAM,UAAU,KAAK;AACrB,QAAM,UAAUC,MAAK,KAAK,KAAK,QAAQ,KAAK,KAAK,OAAO,QAAQ,mBAAmB,GAAG,CAAC;AACvF,UAAQ,UAAU,OAAO;AACzB,QAAM,iBAAiB;AAAA,IACrB,GAAI,KAAK,KAAK,YAAY,CAAC;AAAA,IAC3B,QAAQ,KAAK,KAAK;AAAA,IAClB,QAAQ,KAAK,KAAK;AAAA,IAClB,YAAY,KAAK,KAAK,SAAS;AAAA,IAC/B,KAAK,OAAO,KAAK,KAAK,GAAG;AAAA,EAC3B;AACA,QAAM,WAAW,EAAE,GAAG,gBAAgB,cAAc,KAAK,aAAa;AAGtE,QAAM,YAAYA,MAAK,SAAS,oBAAoB;AACpD,MAAI,KAAK,WAAW;AAClB,UAAM,SAAS,eAA0B;AAAA,MACvC;AAAA,MACA;AAAA,MACA,QAAQ,KAAK,KAAK;AAAA,MAClB,cAAc,KAAK;AAAA,IACrB,CAAC;AACD,QAAI,OAAO,WAAW,OAAO;AAC3B,2BAAqB,OAAO,MAAM,KAAK,KAAK,eAAe,MAAM;AACjE,YAAM,iBACJ,OAAO,KAAK,UAAU,KACtB,OAAO,KAAK,WAAW,QAAQ,KAC/B,OAAO,KAAK,WAAW,SAAS;AAClC,UAAI,OAAO,KAAK,gBAAgB,QAAW;AACzC,YAAI,kBAAkB,OAAO,KAAK,OAAO,KAAK,WAAW,EAAE,SAAS,GAAG;AACrE,gBAAM,IAAI;AAAA,YACR,6BAA6B,KAAK,KAAK,MAAM;AAAA,UAC/C;AAAA,QACF;AAAA,MACF,WACE,CAAC,MAAM,QAAQ,OAAO,KAAK,WAAW,KACtC,OAAO,KAAK,YAAY;AAAA,QACtB,CAAC,WAAW,OAAO,WAAW,YAAY,OAAO,KAAK,EAAE,WAAW;AAAA,MACrE,KACA,IAAI,IAAI,OAAO,KAAK,WAAW,EAAE,SAAS,OAAO,KAAK,YAAY,QAClE;AACA,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAK,MAAM;AAAA,QAC/C;AAAA,MACF,OAAO;AACL,cAAM,kBAAkB,IAAI;AAAA,UAC1B,KAAK,WAAW,KAAK,EAAE,MAAM,eAAe,CAAC,EAAE,IAAI,CAAC,YAAY,QAAQ,MAAM;AAAA,QAChF;AACA,cAAM,iBAAiB,OAAO,KAAK,YAAY;AAAA,UAC7C,CAAC,WAAW,CAAC,gBAAgB,IAAI,MAAM;AAAA,QACzC;AACA,YAAI,eAAe,SAAS,GAAG;AAC7B,gBAAM,IAAI;AAAA,YACR,6BAA6B,KAAK,KAAK,MAAM,mCAAmC,eAAe,KAAK,IAAI,CAAC;AAAA,UAC3G;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,MAAM,EAAE,GAAG,OAAO,MAAM,QAAQ,KAAK,GAAG,iBAAiB,CAAC,EAAE;AAAA,IACvE;AAAA,EACF;AAEA,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,QAAQ,KAAK,iBAAiB,KAAK,KAAK,QAAQ,OAAO;AAC7D,QAAM,kBAA0C,CAAC;AACjD,MAAI,kBAAkB;AACtB,QAAM,YAAoC;AAAA,IACxC,MAAM,MAAM,MAAM,SAAS;AACzB,YAAM,WAAWA,MAAK,SAAS,IAAI;AACnC,cAAQ,UAAUA,MAAK,UAAU,IAAI,CAAC;AACtC,cAAQ,MAAM,UAAU,OAAO;AAC/B,sBAAgB,GAAG,KAAK,KAAK,MAAM,IAAI,IAAI,EAAE,IAAI;AACjD,aAAO;AAAA,IACT;AAAA,IACA,MAAM,UAAU,MAAM,OAAO;AAC3B,aAAO,UAAU,MAAM,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,QAAM,OAA0B;AAAA,IAC9B,MAAM,YAAY,OAAO;AACvB,wBAAkB;AAClB,YAAM,SAAS,MAAM,KAAK,WAAW,YAAY;AAAA,QAC/C,GAAG;AAAA,QACH,SAAS,MAAM,WAAW;AAAA,QAC1B,OAAO,KAAK;AAAA,QACZ,OAAO,MAAM;AAAA,QACb,MAAM;AAAA,QACN,QAAQ,UAAU;AAAA,MACpB,CAAC;AACD,UAAI,OAAO,SAAS;AAClB,cAAM,KAAK,QAAQ,OAAO,QAAQ,KAAK,IAAI,EAAE,WAAW,OAAO,QAAQ,QAAQ,CAAC,EAAE,IAAI;AAAA,MACxF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,YAAY,KAAK,KAAK,gBAAgB;AAAA,IAC1C,UAAU,KAAK,KAAK;AAAA,IACpB,KAAK,KAAK,KAAK;AAAA,EACjB,CAAC;AAMD,QAAM,YAAY,IAAI,gBAAgB;AACtC,QAAM,kBAAkB,MAAM,UAAU,MAAO,KAAK,OAAgC,MAAM;AAC1F,MAAI,KAAK,OAAO,QAAS,WAAU,MAAO,KAAK,OAAgC,MAAM;AAAA,MAChF,MAAK,OAAO,iBAAiB,SAAS,iBAAiB,EAAE,MAAM,KAAK,CAAC;AAE1E,QAAM,MAAuB;AAAA,IAC3B,QAAQ,KAAK,KAAK;AAAA,IAClB,KAAK,KAAK,KAAK;AAAA,IACf,MAAM,KAAK,KAAK;AAAA,IAChB,QAAQ,UAAU;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,QAAM,YAAY,KAAK;AACvB,MAAI;AACJ,MAAI,sBAAkC,MAAM;AAC5C,MAAI;AACF,iBAAa,QAAQ,QAAQ,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,GAAG,CAAC;AACxE,UAAM,UAAU,IAAI,QAAe,CAAC,UAAU,WAAW;AACvD,YAAM,cAAc,MAAM;AACxB,cAAM,SAAS,UAAU,OAAO;AAChC,eAAO,kBAAkB,QAAQ,SAAS,IAAI,MAAM,OAAO,UAAU,kBAAkB,CAAC,CAAC;AAAA,MAC3F;AACA,UAAI,UAAU,OAAO,SAAS;AAC5B,oBAAY;AACZ;AAAA,MACF;AACA,gBAAU,OAAO,iBAAiB,SAAS,aAAa,EAAE,MAAM,KAAK,CAAC;AACtE,4BAAsB,MAAM,UAAU,OAAO,oBAAoB,SAAS,WAAW;AAAA,IACvF,CAAC;AACD,QAAI,cAAc,UAAa,YAAY,GAAG;AAK5C,iBAAW,MAAM,QAAQ,KAAK;AAAA,QAC5B;AAAA,QACA;AAAA,QACA,IAAI,QAAe,CAAC,GAAG,WAAW;AAChC,yBAAe,WAAW,MAAM;AAC9B,kBAAM,eAAe,IAAI;AAAA,cACvB,qBAAqB,SAAS,gBAAgB,KAAK,KAAK,MAAM;AAAA,YAChE;AACA,mBAAO,YAAY;AACnB,sBAAU,MAAM,YAAY;AAAA,UAC9B,GAAG,SAAS;AACZ,cAAI,OAAQ,aAAwC,UAAU;AAC5D,YAAC,aAAuC,MAAM;AAAA,QAClD,CAAC;AAAA,MACH,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,MAAM,QAAQ,KAAK,CAAC,YAAY,OAAO,CAAC;AAAA,IACrD;AAAA,EACF,SAAS,KAAK;AACZ,mBAAe,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC9D,cAAU,EAAE,OAAO,YAAY,OAAO,IAAI;AAAA,EAC5C,UAAE;AACA,QAAI,aAAc,cAAa,YAAY;AAC3C,wBAAoB;AACpB,SAAK,OAAO,oBAAoB,SAAS,eAAe;AAAA,EAC1D;AAEA,MAAI,YAAY;AACd,UAAM,kBAAkB,MAAM,cAAc,YAAY,KAAK,yBAAyB;AACtF,QAAI,CAAC,iBAAiB;AACpB,YAAM,MAAM,MAAM;AAClB,YAAM,IAAI;AAAA,QACR,sBAAsB,KAAK,KAAK,MAAM,kDAAkD,KAAK,yBAAyB;AAAA,MACxH;AAAA,IACF;AAAA,EACF;AACA,MAAI,iBAAiB;AACnB,QAAI,OAAO,KAAK,WAAW,gBAAgB,YAAY;AACrD,YAAM,MAAM,MAAM;AAClB,YAAM,IAAI;AAAA,QACR,yBAAyB,KAAK,KAAK,MAAM;AAAA,MAC3C;AAAA,IACF;AACA,UAAM,mBAAmB,MAAM,KAAK,WAAW,YAAY;AAAA,MACzD,WAAW,KAAK;AAAA,MAChB,QAAQ,EAAE,SAAS,SAAS,OAAO,KAAK,WAAW,MAAM,SAAS;AAAA,IACpE,CAAC;AACD,QAAI,CAAC,kBAAkB;AACrB,YAAM,MAAM,MAAM;AAClB,YAAM,IAAI;AAAA,QACR,wBAAwB,KAAK,KAAK,MAAM,2BAA2B,KAAK,yBAAyB;AAAA,MACnG;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAgB,KAAK,WAAW,KAAK,EAAE,SAAS,SAAS,MAAM,SAAS,CAAC;AAC/E,QAAM,YAAY,KAAK,WAAW,QAAQ,EAAE,SAAS,SAAS,MAAM,SAAS,CAAC;AAC9E,QAAM,aAAiC;AAAA,IACrC,OAAO,UAAU;AAAA,IACjB,QAAQ,UAAU;AAAA,IAClB,GAAI,UAAU,eAAe,IAAI,EAAE,QAAQ,UAAU,aAAa,IAAI,CAAC;AAAA,EACzE;AACA,QAAM,gBAAgB,cAAc,GAAG,EAAE,GAAG;AAC5C,QAAM,iBAAiB;AAAA,IACrB,QAAQ,KAAK,KAAK;AAAA,IAClB;AAAA,IACA,OAAO;AAAA,IACP,SAAS,UAAU;AAAA,IACnB;AAAA,EACF;AACA,MAAI;AACF,yBAAqB,gBAAgB,KAAK,KAAK,eAAe,MAAM;AAAA,EACtE,SAAS,OAAO;AACd,UAAM,MAAM,MAAM;AAClB,UAAM;AAAA,EACR;AAKA,QAAM,cAA0C,CAAC;AACjD,MAAI,aAAa,QAAW;AAC1B,eAAW,SAAS,KAAK,KAAK,UAAU,CAAC,GAAG;AAC1C,UAAI,MAAM,aAAa,CAAC,MAAM,UAAU,KAAK,KAAK,QAAQ,EAAG;AAC7D,UAAI;AACF,cAAM,QAAQ,MAAM,aAAa,OAAO;AAAA,UACtC;AAAA,UACA,UAAU,KAAK,KAAK;AAAA,UACpB,QAAQ,KAAK;AAAA,UACb,YAAY,KAAK;AAAA,UACjB,WAAW,KAAK;AAAA,UAChB;AAAA,QACF,CAAC;AACD,oBAAY,MAAM,IAAI,IAAI;AAAA,MAC5B,SAAS,KAAK;AACZ,uBAAe,UAAU,MAAM,IAAI,aAAa,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAChG,kBAAU,EAAE,OAAO,SAAS,OAAO,MAAM,MAAM,OAAO,IAAI;AAC1D,YAAI,eAAe,8BAA+B,kBAAiB;AACnE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,SAAS;AACX,UAAM,gCAAgC;AAAA,MACpC,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK;AAAA,MAChB;AAAA,MACA,QAAQ,KAAK,KAAK;AAAA,MAClB,WAAW,KAAK;AAAA,IAClB,CAAC;AAAA,EACH;AACA,QAAM,cAAc,KAAK,WACtB,KAAK,EAAE,MAAM,SAAS,CAAC,EACvB,IAAI,CAAC,YAAY,QAAQ,MAAM,EAC/B,KAAK;AAER,QAAM,OAAsC;AAAA,IAC1C,cAAc,KAAK;AAAA,IACnB,QAAQ,KAAK,KAAK;AAAA,IAClB,YAAY,KAAK,KAAK,SAAS;AAAA,IAC/B,KAAK,KAAK,KAAK;AAAA,IACf,UAAW,YAAY;AAAA,IACvB;AAAA,IACA,SAAS,UAAU;AAAA,IACnB,eAAe,cAAc;AAAA,MAC3B,CAAC,YAAY,QAAQ,kBAAkB,UAAa,CAAC,QAAQ;AAAA,IAC/D;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,gBAAgB,EAAE,cAAc,IAAI,CAAC;AAAA,IACzC,YAAY,KAAK,IAAI,IAAI;AAAA,IACzB,MAAM,KAAK,KAAK;AAAA,IAChB,QAAQ;AAAA,IACR,OAAO;AAAA,EACT;AAEA,MAAI,SAAS;AACX,UAAM,cAAcA,MAAK,SAAS,sBAAsB;AACxD,UAAM,UAAiD;AAAA,MACrD,eAAe;AAAA,MACf,cAAc,KAAK;AAAA,MACnB,YAAY,KAAK,IAAI,EAAE,YAAY;AAAA,MACnC,SAAS;AAAA,QACP,OAAO,QAAQ;AAAA,QACf,GAAI,QAAQ,QAAQ,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;AAAA,QAChD,OAAO,mBAAmB,QAAQ,KAAK;AAAA,MACzC;AAAA,MACA;AAAA,MACA,MAAM,KAAK,WAAW,QAAQ,EAAE,OAAO,KAAK,WAAW,MAAM,SAAS,CAAC;AAAA,IACzE;AACA,YAAQ,MAAM,aAAa,KAAK,UAAU,SAAS,MAAM,CAAC,CAAC;AAC3D,oBAAgB,GAAG,KAAK,KAAK,MAAM,uBAAuB,IAAI;AAC9D,SAAK,YAAY,OAAO;AAAA,EAC1B;AAEA,QAAM,MAAM,MAAM;AAElB,MAAI,CAAC,gBAAgB,KAAK,WAAW;AACnC,YAAQ,MAAM,WAAW,KAAK,UAAU,IAAI,CAAC;AAAA,EAC/C;AAEA,MAAI,mBAAmB,OAAW,OAAM;AACxC,SAAO,EAAE,MAAM,iBAAiB,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC,EAAG;AAClE;AAEA,eAAe,gCAAgC,OAM7B;AAChB,QAAM,SAAS,EAAE,OAAO,MAAM,WAAW,MAAM,MAAM,SAAS;AAC9D,MAAI,MAAM,WAAW,QAAQ,MAAM,EAAE,iBAAiB,EAAG;AACzD,MAAI,OAAO,MAAM,WAAW,gBAAgB,YAAY;AACtD,UAAM,IAAI;AAAA,MACR,gCAAgC,MAAM,MAAM;AAAA,IAC9C;AAAA,EACF;AACA,QAAM,UAAU,MAAM,MAAM,WAAW,YAAY;AAAA,IACjD,WAAW,MAAM;AAAA,IACjB;AAAA,EACF,CAAC;AACD,MAAI,CAAC,WAAW,MAAM,WAAW,QAAQ,MAAM,EAAE,eAAe,GAAG;AACjE,UAAM,IAAI;AAAA,MACR,+BAA+B,MAAM,MAAM,2BAA2B,MAAM,SAAS;AAAA,IACvF;AAAA,EACF;AACF;AAEA,SAAS,mBAAmB,OAI1B;AACA,MAAI,iBAAiB,OAAO;AAC1B,WAAO;AAAA,MACL,MAAM,MAAM;AAAA,MACZ,SAAS,MAAM;AAAA,MACf,GAAI,MAAM,QAAQ,EAAE,OAAO,MAAM,MAAM,IAAI,CAAC;AAAA,IAC9C;AAAA,EACF;AACA,SAAO,EAAE,MAAM,kBAAkB,SAAS,OAAO,KAAK,EAAE;AAC1D;AAEA,SAAS,cAAc,SAA2B,WAAqC;AACrF,SAAO,IAAI,QAAiB,CAAC,YAAY;AACvC,QAAI,YAAY;AAChB,QAAI;AACJ,UAAM,SAAS,CAAC,UAAyB;AACvC,UAAI,UAAW;AACf,kBAAY;AACZ,UAAI,MAAO,cAAa,KAAK;AAC7B,cAAQ,KAAK;AAAA,IACf;AACA,YAAQ,WAAW,MAAM,OAAO,KAAK,GAAG,SAAS;AACjD,YAAQ;AAAA,MACN,MAAM,OAAO,IAAI;AAAA,MACjB,MAAM,OAAO,IAAI;AAAA,IACnB;AAAA,EACF,CAAC;AACH;AAuCO,SAAS,gBACd,MACiB;AACjB,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,UAAU,KAAK,WAAW,kBAAkB;AAElD,uBAAqB,KAAK,WAAW,IAAI;AAEzC,MAAI,OAAO,KAAK,WAAW,YAAY,KAAK,OAAO,KAAK,EAAE,WAAW,GAAG;AACtE,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,OAAK,SAAS,cAAc,KAAK,QAAQ,KAAK,IAAI;AAElD,QAAM,eAAe,oBAAoB;AAAA,IACvC,WAAW,KAAK;AAAA,IAChB,QAAS,KAAK,UAAU,CAAC;AAAA,IACzB,aAAa,eAAe,KAAK,UAAU,KAAK,WAAW;AAAA,IAC3D;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,cAAc,oBAAoB,KAAK,WAAW,IAAI;AAE5D,QAAM,QAAQ,kBAAkB,KAAK,WAAW,MAAM,IAAI,EAAE,IAAI,CAAC,SAA8B;AAC7F,UAAM,YAAYA;AAAA,MAChB,KAAK;AAAA,MACL,KAAK,OAAO,QAAQ,mBAAmB,GAAG;AAAA,MAC1C;AAAA,IACF;AACA,QAAI,CAAC,WAAW;AACd,aAAO;AAAA,QACL,QAAQ,KAAK;AAAA,QACb,YAAY,KAAK,SAAS;AAAA,QAC1B,KAAK,KAAK;AAAA,QACV,MAAM,KAAK;AAAA,QACX;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,UAAM,SAAS,eAAwB;AAAA,MACrC;AAAA,MACA;AAAA,MACA,QAAQ,KAAK;AAAA,MACb;AAAA,IACF,CAAC;AACD,QAAI,OAAO,WAAW,OAAO;AAC3B,aAAO;AAAA,QACL,QAAQ,KAAK;AAAA,QACb,YAAY,KAAK,SAAS;AAAA,QAC1B,KAAK,KAAK;AAAA,QACV,MAAM,KAAK;AAAA,QACX;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,WAAO;AAAA,MACL,QAAQ,KAAK;AAAA,MACb,YAAY,KAAK,SAAS;AAAA,MAC1B,KAAK,KAAK;AAAA,MACV,MAAM,KAAK;AAAA,MACX;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,OAAO;AAAA,IACjB;AAAA,EACF,CAAC;AAED,QAAM,cAAc,MAAM,OAAO,CAAC,SAAS,KAAK,WAAW,QAAQ,EAAE;AACrE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,MAAM;AAAA,IAClB;AAAA,IACA,YAAY,MAAM,SAAS;AAAA,IAC3B;AAAA,EACF;AACF;AAQA,SAAS,qBACP,MAIA,MACM;AACN,MAAI,SAAS,MAAO;AACpB,MAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAW;AAC3D,QAAM,aAAa,KAAK,WAAW,UAAU,KAAK,KAAK,WAAW,WAAW;AAC7E,MAAI,KAAK,YAAY,KAAK,CAAC,WAAY;AACvC,QAAM,MAAM,SAAS,KAAK,MAAM;AAChC,MAAI,SAAS,UAAU;AACrB,UAAM,SAAiC;AAAA,MACrC,cAAc;AAAA,MACd,aAAa;AAAA,MACb,aAAa;AAAA,MACb,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,mBAAmB;AAAA,MACnB,cAAc;AAAA,MACd,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AACA,UAAM,IAAI,sBAAsB,gBAAgB,GAAG,IAAI,MAAM;AAAA,EAC/D;AAEA,UAAQ,KAAK,8BAA8B,GAAG,EAAE;AAClD;AAEA,eAAe,aACb,OACA,OACqB;AACrB,QAAM,qBAAqB,IAAI;AAAA,IAC7B,MAAM,YACF,KAAK,EAAE,SAAS,SAAS,MAAM,MAAM,SAAS,CAAC,EAChD,IAAI,CAAC,YAAY,QAAQ,MAAM,KAAK,CAAC;AAAA,EAC1C;AACA,MAAI;AACF,UAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;AACrC,oCAAgC,MAAM,MAAM,OAAO,OAAO,kBAAkB;AAC5E,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oCAAgC,MAAM,MAAM,OAAO,OAAO,oBAAoB,KAAK;AACnF,UAAM;AAAA,EACR;AACF;AAEA,SAAS,gCACP,WACA,OACA,OACA,iBACA,OACM;AACN,MAAI,CAAC,WAAW,KAAK,EAAG;AACxB,QAAM,WAAW,MAAM,YACnB,KAAK,EAAE,SAAS,SAAS,MAAM,MAAM,SAAS,CAAC,EAChD,KAAK,CAAC,YAAY,CAAC,gBAAgB,IAAI,QAAQ,MAAM,CAAC;AACzD,MAAI,SAAU;AACd,QAAM,IAAI;AAAA,IACR,uBAAuB,SAAS;AAAA,IAChC,UAAU,SAAY,SAAY,EAAE,MAAM;AAAA,EAC5C;AACF;AAEA,SAAS,WAAW,OAA+C;AACjE,SACE,OAAO,UAAU,YACjB,UAAU,QACV,aAAa,SACZ,MAAgC,YAAY;AAEjD;AAEA,SAAS,wBACP,SACsD;AACtD,SAAO,CAAC,QAAQ,QAAQ;AACtB,UAAM,QAAwC,CAAC;AAC/C,WAAO;AAAA,MACL,KAAK,MAAM,YAAY;AACrB,cAAM,UAAU,KAAK,IAAI;AACzB,cAAM,SAAkC,EAAE,MAAM,QAAQ,SAAS,GAAI,cAAc,CAAC,EAAG;AACvF,cAAM,SAAoB;AAAA,UACxB,IAAI,UAAU;AACZ,mBAAO,aAAa,KAAK,IAAI,IAAI;AACjC,gBAAI,SAAU,QAAO,OAAO,QAAQ,QAAQ;AAC5C,kBAAM,KAAK,MAAM;AAAA,UACnB;AAAA,UACA,aAAa,KAAK,OAAO;AACvB,mBAAO,GAAG,IAAI;AAAA,UAChB;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,MAAM,QAAQ;AACZ,gBAAQ,MAAMA,MAAK,KAAK,aAAa,GAAG,MAAM,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,kBACP,WACA,MACA,MAC+E;AAC/E,QAAM,WAA0F,CAAC;AACjG,QAAM,eAAe,oBAAI,IAAoB;AAC7C,MAAI,iBAAiB;AACrB,aAAW,YAAY,WAAW;AAChC,QAAI;AACJ,QAAI,SAAS,cAAc,QAAW;AACpC,mBAAa;AACb,wBAAkB;AAAA,IACpB,OAAO;AACL,YAAM,WAAW,aAAa,IAAI,SAAS,SAAS;AACpD,UAAI,aAAa,QAAW;AAC1B,qBAAa;AAAA,MACf,OAAO;AACL,qBAAa;AACb,0BAAkB;AAClB,qBAAa,IAAI,SAAS,WAAW,UAAU;AAAA,MACjD;AAAA,IACF;AACA,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAM,SAAS,GAAG,SAAS,EAAE,IAAI,GAAG;AACpC,YAAM,WAAW,OAAO,aAAa,OAAO;AAC5C,eAAS,KAAK,EAAE,UAAU,KAAK,QAAQ,SAAS,CAAC;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eACP,UACA,UACQ;AACR,QAAM,MAAM,YAAY,UAAU,QAAQ;AAC1C,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAK,EAAE,WAAW,GAAG;AACtD,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,SAAO;AACT;AAMA,SAAS,eAA0B,MAKV;AACvB,QAAM,MAAM,KAAK,QAAQ,KAAK,KAAK,SAAS;AAC5C,MAAI,QAAQ,OAAW,QAAO,EAAE,QAAQ,QAAQ,QAAQ,UAAU;AAElE,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,WAAW,KAAK,OAAQ,QAAO,EAAE,QAAQ,QAAQ,QAAQ,gBAAgB;AACpF,QAAI,OAAO,iBAAiB,KAAK,cAAc;AAC7C,aAAO,EAAE,QAAQ,QAAQ,QAAQ,oBAAoB;AAAA,IACvD;AACA,WAAO,EAAE,QAAQ,OAAO,MAAM,OAAO;AAAA,EACvC,QAAQ;AACN,WAAO,EAAE,QAAQ,QAAQ,QAAQ,UAAU;AAAA,EAC7C;AACF;AAUA,eAAe,eACb,MACe;AACf,QAAM,KAAK,MAAM,QAAQ;AAAA,IACvB,UAAU,KAAK;AAAA,IACf,UAAU,KAAK,KAAK;AAAA,IACpB,aAAa,KAAK,KAAK;AAAA,IACvB,QAAQ,KAAK,KAAK,iBAAiB;AAAA,IACnC,mBAAmB,KAAK,KAAK,4BAA4B;AAAA,IACzD,YAAY,KAAK,IAAI,EAAE,YAAY;AAAA,IACnC,iBAAiB;AAAA,EACnB,CAAC;AACH;AAIA,SAAS,oBAAoB,OAMlB;AACT,SAAO,YAAY;AAAA,IACjB,WAAW,MAAM;AAAA,IACjB,QAAQ,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACnC,MAAM,MAAM;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,SAAS,gBAAgB,KAAK;AAAA,IAChC,EAAE;AAAA,IACF,UAAU,MAAM;AAAA,IAChB,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,EACd,CAAC;AACH;AAEA,SAAS,gBAAgB,OAAqC;AAC5D,MAAI,MAAM,iBAAiB,QAAW;AACpC,UAAM,UAAU,MAAM,aAAa,KAAK;AACxC,QAAI,QAAQ,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,uBAAuB,MAAM,IAAI,6BAA6B;AAAA,IAChF;AACA,WAAO;AAAA,EACT;AACA,SAAO,YAAY;AAAA,IACjB,OAAO,MAAM,MAAM,SAAS;AAAA,IAC5B,WAAW,MAAM,WAAW,SAAS,KAAK;AAAA,EAC5C,CAAC;AACH;AAEA,SAAS,kBACP,OACA,QACA,MACA,MACoB;AACpB,QAAM,UAA0C,CAAC;AACjD,aAAW,SAAS,QAAQ;AAC1B,UAAM,SAAmB,CAAC;AAC1B,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,KAAK,YAAY,MAAM,IAAI;AACrC,UAAI,MAAM,OAAW,QAAO,KAAK,EAAE,SAAS;AAAA,IAC9C;AACA,YAAQ,MAAM,IAAI,IAAI,UAAU,QAAQ,IAAI;AAAA,EAC9C;AACA,QAAM,aAAgD,CAAC;AACvD,QAAM,iBAAiB,oBAAI,IAAsB;AACjD,aAAW,QAAQ,OAAO;AACxB,UAAM,aAAa,OAAO,OAAO,KAAK,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS;AACzE,QAAI,WAAW,WAAW,EAAG;AAC7B,UAAM,OAAO,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,WAAW;AAChE,UAAM,MAAM,eAAe,IAAI,KAAK,UAAU,KAAK,CAAC;AACpD,QAAI,KAAK,IAAI;AACb,mBAAe,IAAI,KAAK,YAAY,GAAG;AAAA,EACzC;AACA,aAAW,CAAC,YAAY,OAAO,KAAK,gBAAgB;AAClD,UAAM,KAAK,UAAU,SAAS,IAAI;AAClC,eAAW,UAAU,IAAI,EAAE,eAAe,GAAG,MAAM,MAAM,GAAG,MAAM,GAAG,GAAG,EAAE;AAAA,EAC5E;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,KAAK;AAAA,IACnB,eAAe,MAAM,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE;AAAA,IAC7C,cAAc,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,WAAW,UAAU,CAAC,EAAE;AAAA,IACnE,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE;AAAA,IAC3C,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,WAAW,UAAU,CAAC,EAAE;AAAA,EAC/E;AACF;AAKA,SAAS,UAAU,SAAmB,MAA8B;AAClE,QAAM,IAAI,QAAQ;AAClB,MAAI,MAAM,EAAG,QAAO,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE;AAC5D,QAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAClD,QAAM,WAAW,QAAQ,OAAO,CAAC,GAAG,MAAM,KAAK,IAAI,SAAS,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;AACrF,QAAM,QAAQ,KAAK,KAAK,QAAQ;AAChC,QAAM,KAAK,mBAAmB,SAAS,MAAM,EAAE,MAAM,WAAW,IAAK,CAAC;AACtE,SAAO,EAAE,MAAM,OAAO,MAAM,CAAC,GAAG,OAAO,GAAG,KAAK,GAAG,EAAE;AACtD;","names":["join","join","closeSync","constants","fsyncSync","openSync","existsSync","readFileSync","openSync","constants","fsyncSync","closeSync","existsSync","mkdirSync","readFileSync","writeFileSync","join","join"]}