@tangle-network/agent-eval 0.221.8 → 0.222.0

package/dist/{outcome-observations-FLmRpgYa.js.map → outcome-observations-D4snOtUb.js.map}

@@ -1 +1 @@
-{"version":3,"file":"outcome-observations-FLmRpgYa.js","names":[],"sources":["../src/meta-eval/outcome-observations.ts"],"sourcesContent":["import { pearsonR, spearmanR } from '../statistics'\nimport { makeRng } from '../statistics/internal'\nimport type { DeploymentOutcome } from './outcome-store'\n\nexport type OutcomeReduction = 'latest' | 'mean' | 'max'\n\nexport interface CorrelationInterval {\n  lower: number\n  upper: number\n}\n\n/** Reduce observations of one named metric; unrelated keys cannot supply a value. */\nexport function reduceOutcomeMetric(\n  outcomes: readonly DeploymentOutcome[],\n  metric: string,\n  reduction: OutcomeReduction,\n): number | null {\n  const observations = outcomes.flatMap((outcome) => {\n    const value = outcome.metrics[metric]\n    return Number.isFinite(outcome.capturedAt) &&\n      typeof value === 'number' &&\n      Number.isFinite(value)\n      ? [{ capturedAt: outcome.capturedAt, value }]\n      : []\n  })\n  if (observations.length === 0) return null\n  if (reduction === 'mean') {\n    return observations.reduce(\n      (sum, observation) => sum + observation.value / observations.length,\n      0,\n    )\n  }\n  if (reduction === 'max') return Math.max(...observations.map((observation) => observation.value))\n  return observations.reduce((a, b) => (b.capturedAt > a.capturedAt ? b : a)).value\n}\n\nexport function hasVariation(values: readonly number[]): boolean {\n  return values.some((value) => value !== values[0])\n}\n\nexport function correlationSummary(\n  xs: number[],\n  ys: number[],\n  iterations: number,\n  seed: number | undefined,\n): {\n  pearson: number\n  spearman: number\n  pearsonCi95: CorrelationInterval | null\n  spearmanCi95: CorrelationInterval | null\n} {\n  const rng = makeRng(seed, xs, ys)\n  const pearsons: number[] = []\n  const spearmans: number[] = []\n  for (let b = 0; b < iterations; b++) {\n    const rx: number[] = []\n    const ry: number[] = []\n    for (let i = 0; i < xs.length; i++) {\n      const index = Math.floor(rng() * xs.length)\n      rx.push(xs[index]!)\n      ry.push(ys[index]!)\n    }\n    // A constant resample has no estimable correlation, even when both sides agree.\n    if (!hasVariation(rx) || !hasVariation(ry)) continue\n    const pearson = pearsonR(rx, ry)\n    const spearman = spearmanR(rx, ry)\n    if (Number.isFinite(pearson)) pearsons.push(pearson)\n    if (Number.isFinite(spearman)) spearmans.push(spearman)\n  }\n  return {\n    pearson: pearsonR(xs, ys),\n    spearman: spearmanR(xs, ys),\n    pearsonCi95: interval(pearsons),\n    spearmanCi95: interval(spearmans),\n  }\n}\n\nexport function validateObservationOptions(\n  reduction: OutcomeReduction,\n  iterations: number,\n  seed: number | undefined,\n): void {\n  if (!['latest', 'mean', 'max'].includes(reduction)) {\n    throw new Error('outcome reduction must be latest, mean, or max')\n  }\n  if (!Number.isSafeInteger(iterations) || iterations < 1) {\n    throw new Error('bootstrap iterations must be a positive safe integer')\n  }\n  if (seed !== undefined && !Number.isFinite(seed)) {\n    throw new Error('bootstrap seed must be finite')\n  }\n}\n\nexport function assertUniqueObservationIds(ids: readonly string[], name: string): void {\n  if (ids.some((id) => typeof id !== 'string' || id.trim().length === 0)) {\n    throw new Error(`${name} must be a nonempty string`)\n  }\n  if (new Set(ids).size !== ids.length) throw new Error(`duplicate ${name} in outcome study`)\n}\n\nexport function validateOutcomeMetricSpecifications(\n  metrics: readonly { id: string; direction: string }[],\n): void {\n  if (!Array.isArray(metrics) || metrics.length === 0) {\n    throw new Error('outcomeMetrics must declare at least one outcome metric and direction')\n  }\n  for (const metric of metrics) {\n    if (!metric || typeof metric.id !== 'string' || metric.id.trim().length === 0) {\n      throw new Error('each outcome metric must have a nonempty id and explicit direction')\n    }\n    if (metric.direction !== 'higher-is-better' && metric.direction !== 'lower-is-better') {\n      throw new Error(\n        `outcome metric ${metric.id} must declare higher-is-better or lower-is-better`,\n      )\n    }\n  }\n  assertUniqueObservationIds(\n    metrics.map((metric) => metric.id),\n    'outcome metric',\n  )\n}\n\nfunction interval(values: number[]): CorrelationInterval | null {\n  if (values.length === 0) return null\n  values.sort((a, b) => a - b)\n  return {\n    lower: Math.max(-1, values[Math.floor(0.025 * values.length)]!),\n    upper: Math.min(1, values[Math.min(values.length - 1, Math.floor(0.975 * values.length))]!),\n  }\n}\n"],"mappings":";;;;AAYA,SAAgB,oBACd,UACA,QACA,WACe;CACf,MAAM,eAAe,SAAS,SAAS,YAAY;EACjD,MAAM,QAAQ,QAAQ,QAAQ;EAC9B,OAAO,OAAO,SAAS,QAAQ,UAAU,KACvC,OAAO,UAAU,YACjB,OAAO,SAAS,KAAK,IACnB,CAAC;GAAE,YAAY,QAAQ;GAAY;EAAM,CAAC,IAC1C,CAAC;CACP,CAAC;CACD,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,IAAI,cAAc,QAChB,OAAO,aAAa,QACjB,KAAK,gBAAgB,MAAM,YAAY,QAAQ,aAAa,QAC7D,CACF;CAEF,IAAI,cAAc,OAAO,OAAO,KAAK,IAAI,GAAG,aAAa,KAAK,gBAAgB,YAAY,KAAK,CAAC;CAChG,OAAO,aAAa,QAAQ,GAAG,MAAO,EAAE,aAAa,EAAE,aAAa,IAAI,CAAE,CAAC,CAAC;AAC9E;AAEA,SAAgB,aAAa,QAAoC;CAC/D,OAAO,OAAO,MAAM,UAAU,UAAU,OAAO,EAAE;AACnD;AAEA,SAAgB,mBACd,IACA,IACA,YACA,MAMA;CACA,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE;CAChC,MAAM,WAAqB,CAAC;CAC5B,MAAM,YAAsB,CAAC;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACnC,MAAM,KAAe,CAAC;EACtB,MAAM,KAAe,CAAC;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;GAClC,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM;GAC1C,GAAG,KAAK,GAAG,MAAO;GAClB,GAAG,KAAK,GAAG,MAAO;EACpB;EAEA,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,aAAa,EAAE,GAAG;EAC5C,MAAM,UAAU,SAAS,IAAI,EAAE;EAC/B,MAAM,WAAW,UAAU,IAAI,EAAE;EACjC,IAAI,OAAO,SAAS,OAAO,GAAG,SAAS,KAAK,OAAO;EACnD,IAAI,OAAO,SAAS,QAAQ,GAAG,UAAU,KAAK,QAAQ;CACxD;CACA,OAAO;EACL,SAAS,SAAS,IAAI,EAAE;EACxB,UAAU,UAAU,IAAI,EAAE;EAC1B,aAAa,SAAS,QAAQ;EAC9B,cAAc,SAAS,SAAS;CAClC;AACF;AAEA,SAAgB,2BACd,WACA,YACA,MACM;CACN,IAAI,CAAC;EAAC;EAAU;EAAQ;CAAK,CAAC,CAAC,SAAS,SAAS,GAC/C,MAAM,IAAI,MAAM,gDAAgD;CAElE,IAAI,CAAC,OAAO,cAAc,UAAU,KAAK,aAAa,GACpD,MAAM,IAAI,MAAM,sDAAsD;CAExE,IAAI,SAAS,KAAA,KAAa,CAAC,OAAO,SAAS,IAAI,GAC7C,MAAM,IAAI,MAAM,+BAA+B;AAEnD;AAEA,SAAgB,2BAA2B,KAAwB,MAAoB;CACrF,IAAI,IAAI,MAAM,OAAO,OAAO,OAAO,YAAY,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,GACnE,MAAM,IAAI,MAAM,GAAG,KAAK,2BAA2B;CAErD,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,QAAQ,MAAM,IAAI,MAAM,aAAa,KAAK,kBAAkB;AAC5F;AAEA,SAAgB,oCACd,SACM;CACN,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,GAChD,MAAM,IAAI,MAAM,uEAAuE;CAEzF,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,UAAU,OAAO,OAAO,OAAO,YAAY,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,GAC1E,MAAM,IAAI,MAAM,oEAAoE;EAEtF,IAAI,OAAO,cAAc,sBAAsB,OAAO,cAAc,mBAClE,MAAM,IAAI,MACR,kBAAkB,OAAO,GAAG,kDAC9B;CAEJ;CACA,2BACE,QAAQ,KAAK,WAAW,OAAO,EAAE,GACjC,gBACF;AACF;AAEA,SAAS,SAAS,QAA8C;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3B,OAAO;EACL,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,OAAQ,OAAO,MAAM,EAAG;EAC9D,OAAO,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,OAAQ,OAAO,MAAM,CAAC,EAAG;CAC5F;AACF"}
+{"version":3,"file":"outcome-observations-D4snOtUb.js","names":[],"sources":["../src/meta-eval/outcome-observations.ts"],"sourcesContent":["import { pearsonR, spearmanR } from '../statistics'\nimport { makeRng } from '../statistics/internal'\nimport type { DeploymentOutcome } from './outcome-store'\n\nexport type OutcomeReduction = 'latest' | 'mean' | 'max'\n\nexport interface CorrelationInterval {\n  lower: number\n  upper: number\n}\n\n/** Reduce observations of one named metric; unrelated keys cannot supply a value. */\nexport function reduceOutcomeMetric(\n  outcomes: readonly DeploymentOutcome[],\n  metric: string,\n  reduction: OutcomeReduction,\n): number | null {\n  const observations = outcomes.flatMap((outcome) => {\n    const value = outcome.metrics[metric]\n    return Number.isFinite(outcome.capturedAt) &&\n      typeof value === 'number' &&\n      Number.isFinite(value)\n      ? [{ capturedAt: outcome.capturedAt, value }]\n      : []\n  })\n  if (observations.length === 0) return null\n  if (reduction === 'mean') {\n    return observations.reduce(\n      (sum, observation) => sum + observation.value / observations.length,\n      0,\n    )\n  }\n  if (reduction === 'max') return Math.max(...observations.map((observation) => observation.value))\n  return observations.reduce((a, b) => (b.capturedAt > a.capturedAt ? b : a)).value\n}\n\nexport function hasVariation(values: readonly number[]): boolean {\n  return values.some((value) => value !== values[0])\n}\n\nexport function correlationSummary(\n  xs: number[],\n  ys: number[],\n  iterations: number,\n  seed: number | undefined,\n): {\n  pearson: number\n  spearman: number\n  pearsonCi95: CorrelationInterval | null\n  spearmanCi95: CorrelationInterval | null\n} {\n  const rng = makeRng(seed, xs, ys)\n  const pearsons: number[] = []\n  const spearmans: number[] = []\n  for (let b = 0; b < iterations; b++) {\n    const rx: number[] = []\n    const ry: number[] = []\n    for (let i = 0; i < xs.length; i++) {\n      const index = Math.floor(rng() * xs.length)\n      rx.push(xs[index]!)\n      ry.push(ys[index]!)\n    }\n    // A constant resample has no estimable correlation, even when both sides agree.\n    if (!hasVariation(rx) || !hasVariation(ry)) continue\n    const pearson = pearsonR(rx, ry)\n    const spearman = spearmanR(rx, ry)\n    if (Number.isFinite(pearson)) pearsons.push(pearson)\n    if (Number.isFinite(spearman)) spearmans.push(spearman)\n  }\n  return {\n    pearson: pearsonR(xs, ys),\n    spearman: spearmanR(xs, ys),\n    pearsonCi95: interval(pearsons),\n    spearmanCi95: interval(spearmans),\n  }\n}\n\nexport function validateObservationOptions(\n  reduction: OutcomeReduction,\n  iterations: number,\n  seed: number | undefined,\n): void {\n  if (!['latest', 'mean', 'max'].includes(reduction)) {\n    throw new Error('outcome reduction must be latest, mean, or max')\n  }\n  if (!Number.isSafeInteger(iterations) || iterations < 1) {\n    throw new Error('bootstrap iterations must be a positive safe integer')\n  }\n  if (seed !== undefined && !Number.isFinite(seed)) {\n    throw new Error('bootstrap seed must be finite')\n  }\n}\n\nexport function assertUniqueObservationIds(ids: readonly string[], name: string): void {\n  if (ids.some((id) => typeof id !== 'string' || id.trim().length === 0)) {\n    throw new Error(`${name} must be a nonempty string`)\n  }\n  if (new Set(ids).size !== ids.length) throw new Error(`duplicate ${name} in outcome study`)\n}\n\nexport function validateOutcomeMetricSpecifications(\n  metrics: readonly { id: string; direction: string }[],\n): void {\n  if (!Array.isArray(metrics) || metrics.length === 0) {\n    throw new Error('outcomeMetrics must declare at least one outcome metric and direction')\n  }\n  for (const metric of metrics) {\n    if (!metric || typeof metric.id !== 'string' || metric.id.trim().length === 0) {\n      throw new Error('each outcome metric must have a nonempty id and explicit direction')\n    }\n    if (metric.direction !== 'higher-is-better' && metric.direction !== 'lower-is-better') {\n      throw new Error(\n        `outcome metric ${metric.id} must declare higher-is-better or lower-is-better`,\n      )\n    }\n  }\n  assertUniqueObservationIds(\n    metrics.map((metric) => metric.id),\n    'outcome metric',\n  )\n}\n\nfunction interval(values: number[]): CorrelationInterval | null {\n  if (values.length === 0) return null\n  values.sort((a, b) => a - b)\n  return {\n    lower: Math.max(-1, values[Math.floor(0.025 * values.length)]!),\n    upper: Math.min(1, values[Math.min(values.length - 1, Math.floor(0.975 * values.length))]!),\n  }\n}\n"],"mappings":";;;;AAYA,SAAgB,oBACd,UACA,QACA,WACe;CACf,MAAM,eAAe,SAAS,SAAS,YAAY;EACjD,MAAM,QAAQ,QAAQ,QAAQ;EAC9B,OAAO,OAAO,SAAS,QAAQ,UAAU,KACvC,OAAO,UAAU,YACjB,OAAO,SAAS,KAAK,IACnB,CAAC;GAAE,YAAY,QAAQ;GAAY;EAAM,CAAC,IAC1C,CAAC;CACP,CAAC;CACD,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,IAAI,cAAc,QAChB,OAAO,aAAa,QACjB,KAAK,gBAAgB,MAAM,YAAY,QAAQ,aAAa,QAC7D,CACF;CAEF,IAAI,cAAc,OAAO,OAAO,KAAK,IAAI,GAAG,aAAa,KAAK,gBAAgB,YAAY,KAAK,CAAC;CAChG,OAAO,aAAa,QAAQ,GAAG,MAAO,EAAE,aAAa,EAAE,aAAa,IAAI,CAAE,CAAC,CAAC;AAC9E;AAEA,SAAgB,aAAa,QAAoC;CAC/D,OAAO,OAAO,MAAM,UAAU,UAAU,OAAO,EAAE;AACnD;AAEA,SAAgB,mBACd,IACA,IACA,YACA,MAMA;CACA,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE;CAChC,MAAM,WAAqB,CAAC;CAC5B,MAAM,YAAsB,CAAC;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACnC,MAAM,KAAe,CAAC;EACtB,MAAM,KAAe,CAAC;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;GAClC,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM;GAC1C,GAAG,KAAK,GAAG,MAAO;GAClB,GAAG,KAAK,GAAG,MAAO;EACpB;EAEA,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,aAAa,EAAE,GAAG;EAC5C,MAAM,UAAU,SAAS,IAAI,EAAE;EAC/B,MAAM,WAAW,UAAU,IAAI,EAAE;EACjC,IAAI,OAAO,SAAS,OAAO,GAAG,SAAS,KAAK,OAAO;EACnD,IAAI,OAAO,SAAS,QAAQ,GAAG,UAAU,KAAK,QAAQ;CACxD;CACA,OAAO;EACL,SAAS,SAAS,IAAI,EAAE;EACxB,UAAU,UAAU,IAAI,EAAE;EAC1B,aAAa,SAAS,QAAQ;EAC9B,cAAc,SAAS,SAAS;CAClC;AACF;AAEA,SAAgB,2BACd,WACA,YACA,MACM;CACN,IAAI,CAAC;EAAC;EAAU;EAAQ;CAAK,CAAC,CAAC,SAAS,SAAS,GAC/C,MAAM,IAAI,MAAM,gDAAgD;CAElE,IAAI,CAAC,OAAO,cAAc,UAAU,KAAK,aAAa,GACpD,MAAM,IAAI,MAAM,sDAAsD;CAExE,IAAI,SAAS,KAAA,KAAa,CAAC,OAAO,SAAS,IAAI,GAC7C,MAAM,IAAI,MAAM,+BAA+B;AAEnD;AAEA,SAAgB,2BAA2B,KAAwB,MAAoB;CACrF,IAAI,IAAI,MAAM,OAAO,OAAO,OAAO,YAAY,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,GACnE,MAAM,IAAI,MAAM,GAAG,KAAK,2BAA2B;CAErD,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,QAAQ,MAAM,IAAI,MAAM,aAAa,KAAK,kBAAkB;AAC5F;AAEA,SAAgB,oCACd,SACM;CACN,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,GAChD,MAAM,IAAI,MAAM,uEAAuE;CAEzF,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,UAAU,OAAO,OAAO,OAAO,YAAY,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,GAC1E,MAAM,IAAI,MAAM,oEAAoE;EAEtF,IAAI,OAAO,cAAc,sBAAsB,OAAO,cAAc,mBAClE,MAAM,IAAI,MACR,kBAAkB,OAAO,GAAG,kDAC9B;CAEJ;CACA,2BACE,QAAQ,KAAK,WAAW,OAAO,EAAE,GACjC,gBACF;AACF;AAEA,SAAS,SAAS,QAA8C;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3B,OAAO;EACL,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,OAAQ,OAAO,MAAM,EAAG;EAC9D,OAAO,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,OAAQ,OAAO,MAAM,CAAC,EAAG;CAC5F;AACF"}

package/dist/{outcome-store-DUcMj-3D.js → outcome-store-TarrcfHG.js}

@@ -1,5 +1,5 @@
 import { z } from "zod";
-//#region src/meta-eval/outcome-store.ts
+// src/meta-eval/outcome-store.ts
 /** Deployment observations join to evaluation records through their runId. */
 const outcomeSchema = z.object({
 	runId: z.string().min(1),
@@ -125,7 +125,6 @@ function matches(outcome, filter) {
 	if (filter.label && outcome.labels?.[filter.label.key] !== filter.label.value) return false;
 	return true;
 }
-//#endregion
 export { InMemoryOutcomeStore as n, OutcomeStoreError as r, FileSystemOutcomeStore as t };
 
-//# sourceMappingURL=outcome-store-DUcMj-3D.js.map
+//# sourceMappingURL=outcome-store-TarrcfHG.js.map

package/dist/{outcome-store-DUcMj-3D.js.map → outcome-store-TarrcfHG.js.map}

@@ -1 +1 @@
-{"version":3,"file":"outcome-store-DUcMj-3D.js","names":[],"sources":["../src/meta-eval/outcome-store.ts"],"sourcesContent":["/** Deployment observations join to evaluation records through their runId. */\n\nimport { z } from 'zod'\n\nexport interface DeploymentOutcome {\n  runId: string\n  capturedAt: number\n  /** Finite numeric outcomes; absence of a key means unmeasured. */\n  metrics: Record<string, number>\n  labels?: Record<string, string>\n  /** Source system or pipeline version. */\n  source?: string\n}\n\nexport interface OutcomeFilter {\n  runIds?: string[]\n  since?: number\n  until?: number\n  label?: { key: string; value: string }\n  source?: string\n}\n\nexport interface OutcomeStore {\n  append(outcome: DeploymentOutcome): Promise<void>\n  forRun(runId: string): Promise<DeploymentOutcome[]>\n  list(filter?: OutcomeFilter): Promise<DeploymentOutcome[]>\n}\n\nconst outcomeSchema = z\n  .object({\n    runId: z.string().min(1),\n    capturedAt: z.number().finite(),\n    metrics: z.record(z.string(), z.number().finite()),\n    labels: z.record(z.string(), z.string()).optional(),\n    source: z.string().optional(),\n  })\n  .passthrough()\n\nexport class InMemoryOutcomeStore implements OutcomeStore {\n  private items: DeploymentOutcome[] = []\n\n  async append(outcome: DeploymentOutcome): Promise<void> {\n    this.items.push(structuredClone(outcomeSchema.parse(outcome)))\n  }\n\n  async forRun(runId: string): Promise<DeploymentOutcome[]> {\n    return this.list({ runIds: [runId] })\n  }\n\n  async list(filter: OutcomeFilter = {}): Promise<DeploymentOutcome[]> {\n    return this.items\n      .filter((outcome) => matches(outcome, filter))\n      .map((outcome) => structuredClone(outcome))\n  }\n}\n\nexport interface FileSystemOutcomeStoreOptions {\n  dir: string\n  /** Rotate before a write once the active file reaches this size. Default 32 MiB. */\n  maxBytes?: number\n}\n\n/** Storage failures retain operation, path, source line, and the original cause. */\nexport class OutcomeStoreError extends Error {\n  constructor(\n    public readonly operation: 'read' | 'decode' | 'write',\n    public readonly path: string,\n    cause: unknown,\n    public readonly line?: number,\n  ) {\n    super(`outcome store ${operation} failed at ${path}${line === undefined ? '' : `:${line}`}`, {\n      cause,\n    })\n    this.name = 'OutcomeStoreError'\n  }\n}\n\n/** Local storage with serialized operations per instance; use one writer per directory. */\nexport class FileSystemOutcomeStore implements OutcomeStore {\n  private readonly dir: string\n  private readonly maxBytes: number\n  private pending: Promise<void> = Promise.resolve()\n\n  constructor(options: FileSystemOutcomeStoreOptions) {\n    if (!options.dir.trim()) throw new Error('outcome store dir must be nonempty')\n    this.dir = options.dir\n    this.maxBytes = options.maxBytes ?? 32 * 1024 * 1024\n    if (!Number.isSafeInteger(this.maxBytes) || this.maxBytes < 1) {\n      throw new Error('outcome store maxBytes must be a positive safe integer')\n    }\n  }\n\n  async append(outcome: DeploymentOutcome): Promise<void> {\n    const snapshot = structuredClone(outcomeSchema.parse(outcome))\n    return this.serialize(async () => {\n      const fs = await import('node:fs/promises')\n      const path = await import('node:path')\n      const active = path.join(this.dir, 'outcomes.ndjson')\n      try {\n        await fs.mkdir(this.dir, { recursive: true })\n        let size = 0\n        try {\n          const stat = await fs.stat(active)\n          if (!stat.isFile()) throw new Error('active outcome path is not a regular file')\n          size = stat.size\n        } catch (error) {\n          if (!isMissing(error)) throw error\n        }\n        if (size >= this.maxBytes) {\n          const { randomUUID } = await import('node:crypto')\n          await fs.rename(\n            active,\n            path.join(this.dir, `outcomes.${Date.now()}.${randomUUID()}.ndjson`),\n          )\n        }\n        await fs.appendFile(active, `${JSON.stringify(snapshot)}\\n`, 'utf8')\n      } catch (error) {\n        throw new OutcomeStoreError('write', active, error)\n      }\n    })\n  }\n\n  async forRun(runId: string): Promise<DeploymentOutcome[]> {\n    return this.list({ runIds: [runId] })\n  }\n\n  async list(filter: OutcomeFilter = {}): Promise<DeploymentOutcome[]> {\n    return this.serialize(async () => {\n      const fs = await import('node:fs/promises')\n      const path = await import('node:path')\n      let entries: string[]\n      try {\n        entries = await fs.readdir(this.dir)\n      } catch (error) {\n        if (isMissing(error)) return []\n        throw new OutcomeStoreError('read', this.dir, error)\n      }\n      const outcomes: DeploymentOutcome[] = []\n      // Read each snapshot from disk so later observations from another instance remain visible.\n      for (const file of entries.sort()) {\n        if (file !== 'outcomes.ndjson' && !/^outcomes\\..+\\.ndjson$/.test(file)) continue\n        const filePath = path.join(this.dir, file)\n        let content: string\n        try {\n          content = await fs.readFile(filePath, 'utf8')\n        } catch (error) {\n          throw new OutcomeStoreError('read', filePath, error)\n        }\n        for (const [index, line] of content.split('\\n').entries()) {\n          if (!line.trim()) continue\n          let outcome: DeploymentOutcome\n          try {\n            outcome = outcomeSchema.parse(JSON.parse(line))\n          } catch (error) {\n            throw new OutcomeStoreError('decode', filePath, error, index + 1)\n          }\n          if (matches(outcome, filter)) outcomes.push(outcome)\n        }\n      }\n      return outcomes\n    })\n  }\n\n  private serialize<T>(operation: () => Promise<T>): Promise<T> {\n    const result = this.pending.then(operation)\n    // A failed operation remains rejected to its caller, but does not disable later repaired reads or writes.\n    this.pending = result.then(\n      () => undefined,\n      () => undefined,\n    )\n    return result\n  }\n}\n\nfunction isMissing(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ENOENT'\n}\n\nfunction matches(outcome: DeploymentOutcome, filter: OutcomeFilter): boolean {\n  if (filter.runIds && !filter.runIds.includes(outcome.runId)) return false\n  if (filter.since !== undefined && outcome.capturedAt < filter.since) return false\n  if (filter.until !== undefined && outcome.capturedAt > filter.until) return false\n  if (filter.source && outcome.source !== filter.source) return false\n  if (filter.label && outcome.labels?.[filter.label.key] !== filter.label.value) return false\n  return true\n}\n"],"mappings":";;;AA4BA,MAAM,gBAAgB,EACnB,OAAO;CACN,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACvB,YAAY,EAAE,OAAO,CAAC,CAAC,OAAO;CAC9B,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC;CACjD,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAClD,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;AAC9B,CAAC,CAAC,CACD,YAAY;AAEf,IAAa,uBAAb,MAA0D;CACxD,QAAqC,CAAC;CAEtC,MAAM,OAAO,SAA2C;EACtD,KAAK,MAAM,KAAK,gBAAgB,cAAc,MAAM,OAAO,CAAC,CAAC;CAC/D;CAEA,MAAM,OAAO,OAA6C;EACxD,OAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;CACtC;CAEA,MAAM,KAAK,SAAwB,CAAC,GAAiC;EACnE,OAAO,KAAK,MACT,QAAQ,YAAY,QAAQ,SAAS,MAAM,CAAC,CAAC,CAC7C,KAAK,YAAY,gBAAgB,OAAO,CAAC;CAC9C;AACF;;AASA,IAAa,oBAAb,cAAuC,MAAM;CAEzB;CACA;CAEA;CAJlB,YACE,WACA,MACA,OACA,MACA;EACA,MAAM,iBAAiB,UAAU,aAAa,OAAO,SAAS,KAAA,IAAY,KAAK,IAAI,UAAU,EAC3F,MACF,CAAC;EAPe,KAAA,YAAA;EACA,KAAA,OAAA;EAEA,KAAA,OAAA;EAKhB,KAAK,OAAO;CACd;AACF;;AAGA,IAAa,yBAAb,MAA4D;CAC1D;CACA;CACA,UAAiC,QAAQ,QAAQ;CAEjD,YAAY,SAAwC;EAClD,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,oCAAoC;EAC7E,KAAK,MAAM,QAAQ;EACnB,KAAK,WAAW,QAAQ,YAAY;EACpC,IAAI,CAAC,OAAO,cAAc,KAAK,QAAQ,KAAK,KAAK,WAAW,GAC1D,MAAM,IAAI,MAAM,wDAAwD;CAE5E;CAEA,MAAM,OAAO,SAA2C;EACtD,MAAM,WAAW,gBAAgB,cAAc,MAAM,OAAO,CAAC;EAC7D,OAAO,KAAK,UAAU,YAAY;GAChC,MAAM,KAAK,MAAM,OAAO;GACxB,MAAM,OAAO,MAAM,OAAO;GAC1B,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,iBAAiB;GACpD,IAAI;IACF,MAAM,GAAG,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;IAC5C,IAAI,OAAO;IACX,IAAI;KACF,MAAM,OAAO,MAAM,GAAG,KAAK,MAAM;KACjC,IAAI,CAAC,KAAK,OAAO,GAAG,MAAM,IAAI,MAAM,2CAA2C;KAC/E,OAAO,KAAK;IACd,SAAS,OAAO;KACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;IAC/B;IACA,IAAI,QAAQ,KAAK,UAAU;KACzB,MAAM,EAAE,eAAe,MAAM,OAAO;KACpC,MAAM,GAAG,OACP,QACA,KAAK,KAAK,KAAK,KAAK,YAAY,KAAK,IAAI,EAAE,GAAG,WAAW,EAAE,QAAQ,CACrE;IACF;IACA,MAAM,GAAG,WAAW,QAAQ,GAAG,KAAK,UAAU,QAAQ,EAAE,KAAK,MAAM;GACrE,SAAS,OAAO;IACd,MAAM,IAAI,kBAAkB,SAAS,QAAQ,KAAK;GACpD;EACF,CAAC;CACH;CAEA,MAAM,OAAO,OAA6C;EACxD,OAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;CACtC;CAEA,MAAM,KAAK,SAAwB,CAAC,GAAiC;EACnE,OAAO,KAAK,UAAU,YAAY;GAChC,MAAM,KAAK,MAAM,OAAO;GACxB,MAAM,OAAO,MAAM,OAAO;GAC1B,IAAI;GACJ,IAAI;IACF,UAAU,MAAM,GAAG,QAAQ,KAAK,GAAG;GACrC,SAAS,OAAO;IACd,IAAI,UAAU,KAAK,GAAG,OAAO,CAAC;IAC9B,MAAM,IAAI,kBAAkB,QAAQ,KAAK,KAAK,KAAK;GACrD;GACA,MAAM,WAAgC,CAAC;GAEvC,KAAK,MAAM,QAAQ,QAAQ,KAAK,GAAG;IACjC,IAAI,SAAS,qBAAqB,CAAC,yBAAyB,KAAK,IAAI,GAAG;IACxE,MAAM,WAAW,KAAK,KAAK,KAAK,KAAK,IAAI;IACzC,IAAI;IACJ,IAAI;KACF,UAAU,MAAM,GAAG,SAAS,UAAU,MAAM;IAC9C,SAAS,OAAO;KACd,MAAM,IAAI,kBAAkB,QAAQ,UAAU,KAAK;IACrD;IACA,KAAK,MAAM,CAAC,OAAO,SAAS,QAAQ,MAAM,IAAI,CAAC,CAAC,QAAQ,GAAG;KACzD,IAAI,CAAC,KAAK,KAAK,GAAG;KAClB,IAAI;KACJ,IAAI;MACF,UAAU,cAAc,MAAM,KAAK,MAAM,IAAI,CAAC;KAChD,SAAS,OAAO;MACd,MAAM,IAAI,kBAAkB,UAAU,UAAU,OAAO,QAAQ,CAAC;KAClE;KACA,IAAI,QAAQ,SAAS,MAAM,GAAG,SAAS,KAAK,OAAO;IACrD;GACF;GACA,OAAO;EACT,CAAC;CACH;CAEA,UAAqB,WAAyC;EAC5D,MAAM,SAAS,KAAK,QAAQ,KAAK,SAAS;EAE1C,KAAK,UAAU,OAAO,WACd,KAAA,SACA,KAAA,CACR;EACA,OAAO;CACT;AACF;AAEA,SAAS,UAAU,OAAyB;CAC1C,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,QAAQ,SAA4B,QAAgC;CAC3E,IAAI,OAAO,UAAU,CAAC,OAAO,OAAO,SAAS,QAAQ,KAAK,GAAG,OAAO;CACpE,IAAI,OAAO,UAAU,KAAA,KAAa,QAAQ,aAAa,OAAO,OAAO,OAAO;CAC5E,IAAI,OAAO,UAAU,KAAA,KAAa,QAAQ,aAAa,OAAO,OAAO,OAAO;CAC5E,IAAI,OAAO,UAAU,QAAQ,WAAW,OAAO,QAAQ,OAAO;CAC9D,IAAI,OAAO,SAAS,QAAQ,SAAS,OAAO,MAAM,SAAS,OAAO,MAAM,OAAO,OAAO;CACtF,OAAO;AACT"}
+{"version":3,"file":"outcome-store-TarrcfHG.js","names":[],"sources":["../src/meta-eval/outcome-store.ts"],"sourcesContent":["/** Deployment observations join to evaluation records through their runId. */\n\nimport { z } from 'zod'\n\nexport interface DeploymentOutcome {\n  runId: string\n  capturedAt: number\n  /** Finite numeric outcomes; absence of a key means unmeasured. */\n  metrics: Record<string, number>\n  labels?: Record<string, string>\n  /** Source system or pipeline version. */\n  source?: string\n}\n\nexport interface OutcomeFilter {\n  runIds?: string[]\n  since?: number\n  until?: number\n  label?: { key: string; value: string }\n  source?: string\n}\n\nexport interface OutcomeStore {\n  append(outcome: DeploymentOutcome): Promise<void>\n  forRun(runId: string): Promise<DeploymentOutcome[]>\n  list(filter?: OutcomeFilter): Promise<DeploymentOutcome[]>\n}\n\nconst outcomeSchema = z\n  .object({\n    runId: z.string().min(1),\n    capturedAt: z.number().finite(),\n    metrics: z.record(z.string(), z.number().finite()),\n    labels: z.record(z.string(), z.string()).optional(),\n    source: z.string().optional(),\n  })\n  .passthrough()\n\nexport class InMemoryOutcomeStore implements OutcomeStore {\n  private items: DeploymentOutcome[] = []\n\n  async append(outcome: DeploymentOutcome): Promise<void> {\n    this.items.push(structuredClone(outcomeSchema.parse(outcome)))\n  }\n\n  async forRun(runId: string): Promise<DeploymentOutcome[]> {\n    return this.list({ runIds: [runId] })\n  }\n\n  async list(filter: OutcomeFilter = {}): Promise<DeploymentOutcome[]> {\n    return this.items\n      .filter((outcome) => matches(outcome, filter))\n      .map((outcome) => structuredClone(outcome))\n  }\n}\n\nexport interface FileSystemOutcomeStoreOptions {\n  dir: string\n  /** Rotate before a write once the active file reaches this size. Default 32 MiB. */\n  maxBytes?: number\n}\n\n/** Storage failures retain operation, path, source line, and the original cause. */\nexport class OutcomeStoreError extends Error {\n  constructor(\n    public readonly operation: 'read' | 'decode' | 'write',\n    public readonly path: string,\n    cause: unknown,\n    public readonly line?: number,\n  ) {\n    super(`outcome store ${operation} failed at ${path}${line === undefined ? '' : `:${line}`}`, {\n      cause,\n    })\n    this.name = 'OutcomeStoreError'\n  }\n}\n\n/** Local storage with serialized operations per instance; use one writer per directory. */\nexport class FileSystemOutcomeStore implements OutcomeStore {\n  private readonly dir: string\n  private readonly maxBytes: number\n  private pending: Promise<void> = Promise.resolve()\n\n  constructor(options: FileSystemOutcomeStoreOptions) {\n    if (!options.dir.trim()) throw new Error('outcome store dir must be nonempty')\n    this.dir = options.dir\n    this.maxBytes = options.maxBytes ?? 32 * 1024 * 1024\n    if (!Number.isSafeInteger(this.maxBytes) || this.maxBytes < 1) {\n      throw new Error('outcome store maxBytes must be a positive safe integer')\n    }\n  }\n\n  async append(outcome: DeploymentOutcome): Promise<void> {\n    const snapshot = structuredClone(outcomeSchema.parse(outcome))\n    return this.serialize(async () => {\n      const fs = await import('node:fs/promises')\n      const path = await import('node:path')\n      const active = path.join(this.dir, 'outcomes.ndjson')\n      try {\n        await fs.mkdir(this.dir, { recursive: true })\n        let size = 0\n        try {\n          const stat = await fs.stat(active)\n          if (!stat.isFile()) throw new Error('active outcome path is not a regular file')\n          size = stat.size\n        } catch (error) {\n          if (!isMissing(error)) throw error\n        }\n        if (size >= this.maxBytes) {\n          const { randomUUID } = await import('node:crypto')\n          await fs.rename(\n            active,\n            path.join(this.dir, `outcomes.${Date.now()}.${randomUUID()}.ndjson`),\n          )\n        }\n        await fs.appendFile(active, `${JSON.stringify(snapshot)}\\n`, 'utf8')\n      } catch (error) {\n        throw new OutcomeStoreError('write', active, error)\n      }\n    })\n  }\n\n  async forRun(runId: string): Promise<DeploymentOutcome[]> {\n    return this.list({ runIds: [runId] })\n  }\n\n  async list(filter: OutcomeFilter = {}): Promise<DeploymentOutcome[]> {\n    return this.serialize(async () => {\n      const fs = await import('node:fs/promises')\n      const path = await import('node:path')\n      let entries: string[]\n      try {\n        entries = await fs.readdir(this.dir)\n      } catch (error) {\n        if (isMissing(error)) return []\n        throw new OutcomeStoreError('read', this.dir, error)\n      }\n      const outcomes: DeploymentOutcome[] = []\n      // Read each snapshot from disk so later observations from another instance remain visible.\n      for (const file of entries.sort()) {\n        if (file !== 'outcomes.ndjson' && !/^outcomes\\..+\\.ndjson$/.test(file)) continue\n        const filePath = path.join(this.dir, file)\n        let content: string\n        try {\n          content = await fs.readFile(filePath, 'utf8')\n        } catch (error) {\n          throw new OutcomeStoreError('read', filePath, error)\n        }\n        for (const [index, line] of content.split('\\n').entries()) {\n          if (!line.trim()) continue\n          let outcome: DeploymentOutcome\n          try {\n            outcome = outcomeSchema.parse(JSON.parse(line))\n          } catch (error) {\n            throw new OutcomeStoreError('decode', filePath, error, index + 1)\n          }\n          if (matches(outcome, filter)) outcomes.push(outcome)\n        }\n      }\n      return outcomes\n    })\n  }\n\n  private serialize<T>(operation: () => Promise<T>): Promise<T> {\n    const result = this.pending.then(operation)\n    // A failed operation remains rejected to its caller, but does not disable later repaired reads or writes.\n    this.pending = result.then(\n      () => undefined,\n      () => undefined,\n    )\n    return result\n  }\n}\n\nfunction isMissing(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ENOENT'\n}\n\nfunction matches(outcome: DeploymentOutcome, filter: OutcomeFilter): boolean {\n  if (filter.runIds && !filter.runIds.includes(outcome.runId)) return false\n  if (filter.since !== undefined && outcome.capturedAt < filter.since) return false\n  if (filter.until !== undefined && outcome.capturedAt > filter.until) return false\n  if (filter.source && outcome.source !== filter.source) return false\n  if (filter.label && outcome.labels?.[filter.label.key] !== filter.label.value) return false\n  return true\n}\n"],"mappings":";;;AA4BA,MAAM,gBAAgB,EACnB,OAAO;CACN,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACvB,YAAY,EAAE,OAAO,CAAC,CAAC,OAAO;CAC9B,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC;CACjD,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAClD,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;AAC9B,CAAC,CAAC,CACD,YAAY;AAEf,IAAa,uBAAb,MAA0D;CACxD,QAAqC,CAAC;CAEtC,MAAM,OAAO,SAA2C;EACtD,KAAK,MAAM,KAAK,gBAAgB,cAAc,MAAM,OAAO,CAAC,CAAC;CAC/D;CAEA,MAAM,OAAO,OAA6C;EACxD,OAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;CACtC;CAEA,MAAM,KAAK,SAAwB,CAAC,GAAiC;EACnE,OAAO,KAAK,MACT,QAAQ,YAAY,QAAQ,SAAS,MAAM,CAAC,CAAC,CAC7C,KAAK,YAAY,gBAAgB,OAAO,CAAC;CAC9C;AACF;;AASA,IAAa,oBAAb,cAAuC,MAAM;CAEzB;CACA;CAEA;CAJlB,YACE,WACA,MACA,OACA,MACA;EACA,MAAM,iBAAiB,UAAU,aAAa,OAAO,SAAS,KAAA,IAAY,KAAK,IAAI,UAAU,EAC3F,MACF,CAAC;EAPe,KAAA,YAAA;EACA,KAAA,OAAA;EAEA,KAAA,OAAA;EAKhB,KAAK,OAAO;CACd;AACF;;AAGA,IAAa,yBAAb,MAA4D;CAC1D;CACA;CACA,UAAiC,QAAQ,QAAQ;CAEjD,YAAY,SAAwC;EAClD,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,oCAAoC;EAC7E,KAAK,MAAM,QAAQ;EACnB,KAAK,WAAW,QAAQ,YAAY;EACpC,IAAI,CAAC,OAAO,cAAc,KAAK,QAAQ,KAAK,KAAK,WAAW,GAC1D,MAAM,IAAI,MAAM,wDAAwD;CAE5E;CAEA,MAAM,OAAO,SAA2C;EACtD,MAAM,WAAW,gBAAgB,cAAc,MAAM,OAAO,CAAC;EAC7D,OAAO,KAAK,UAAU,YAAY;GAChC,MAAM,KAAK,MAAM,OAAO;GACxB,MAAM,OAAO,MAAM,OAAO;GAC1B,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,iBAAiB;GACpD,IAAI;IACF,MAAM,GAAG,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;IAC5C,IAAI,OAAO;IACX,IAAI;KACF,MAAM,OAAO,MAAM,GAAG,KAAK,MAAM;KACjC,IAAI,CAAC,KAAK,OAAO,GAAG,MAAM,IAAI,MAAM,2CAA2C;KAC/E,OAAO,KAAK;IACd,SAAS,OAAO;KACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;IAC/B;IACA,IAAI,QAAQ,KAAK,UAAU;KACzB,MAAM,EAAE,eAAe,MAAM,OAAO;KACpC,MAAM,GAAG,OACP,QACA,KAAK,KAAK,KAAK,KAAK,YAAY,KAAK,IAAI,EAAE,GAAG,WAAW,EAAE,QAAQ,CACrE;IACF;IACA,MAAM,GAAG,WAAW,QAAQ,GAAG,KAAK,UAAU,QAAQ,EAAE,KAAK,MAAM;GACrE,SAAS,OAAO;IACd,MAAM,IAAI,kBAAkB,SAAS,QAAQ,KAAK;GACpD;EACF,CAAC;CACH;CAEA,MAAM,OAAO,OAA6C;EACxD,OAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;CACtC;CAEA,MAAM,KAAK,SAAwB,CAAC,GAAiC;EACnE,OAAO,KAAK,UAAU,YAAY;GAChC,MAAM,KAAK,MAAM,OAAO;GACxB,MAAM,OAAO,MAAM,OAAO;GAC1B,IAAI;GACJ,IAAI;IACF,UAAU,MAAM,GAAG,QAAQ,KAAK,GAAG;GACrC,SAAS,OAAO;IACd,IAAI,UAAU,KAAK,GAAG,OAAO,CAAC;IAC9B,MAAM,IAAI,kBAAkB,QAAQ,KAAK,KAAK,KAAK;GACrD;GACA,MAAM,WAAgC,CAAC;GAEvC,KAAK,MAAM,QAAQ,QAAQ,KAAK,GAAG;IACjC,IAAI,SAAS,qBAAqB,CAAC,yBAAyB,KAAK,IAAI,GAAG;IACxE,MAAM,WAAW,KAAK,KAAK,KAAK,KAAK,IAAI;IACzC,IAAI;IACJ,IAAI;KACF,UAAU,MAAM,GAAG,SAAS,UAAU,MAAM;IAC9C,SAAS,OAAO;KACd,MAAM,IAAI,kBAAkB,QAAQ,UAAU,KAAK;IACrD;IACA,KAAK,MAAM,CAAC,OAAO,SAAS,QAAQ,MAAM,IAAI,CAAC,CAAC,QAAQ,GAAG;KACzD,IAAI,CAAC,KAAK,KAAK,GAAG;KAClB,IAAI;KACJ,IAAI;MACF,UAAU,cAAc,MAAM,KAAK,MAAM,IAAI,CAAC;KAChD,SAAS,OAAO;MACd,MAAM,IAAI,kBAAkB,UAAU,UAAU,OAAO,QAAQ,CAAC;KAClE;KACA,IAAI,QAAQ,SAAS,MAAM,GAAG,SAAS,KAAK,OAAO;IACrD;GACF;GACA,OAAO;EACT,CAAC;CACH;CAEA,UAAqB,WAAyC;EAC5D,MAAM,SAAS,KAAK,QAAQ,KAAK,SAAS;EAE1C,KAAK,UAAU,OAAO,WACd,KAAA,SACA,KAAA,CACR;EACA,OAAO;CACT;AACF;AAEA,SAAS,UAAU,OAAyB;CAC1C,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,QAAQ,SAA4B,QAAgC;CAC3E,IAAI,OAAO,UAAU,CAAC,OAAO,OAAO,SAAS,QAAQ,KAAK,GAAG,OAAO;CACpE,IAAI,OAAO,UAAU,KAAA,KAAa,QAAQ,aAAa,OAAO,OAAO,OAAO;CAC5E,IAAI,OAAO,UAAU,KAAA,KAAa,QAAQ,aAAa,OAAO,OAAO,OAAO;CAC5E,IAAI,OAAO,UAAU,QAAQ,WAAW,OAAO,QAAQ,OAAO;CAC9D,IAAI,OAAO,SAAS,QAAQ,SAAS,OAAO,MAAM,SAAS,OAAO,MAAM,OAAO,OAAO;CACtF,OAAO;AACT"}

package/dist/{package-version-D7lQHt_-.js → package-version-CJl_pY9W.js}

@@ -1,7 +1,7 @@
 import { readFileSync } from "node:fs";
 import { dirname, resolve } from "node:path";
 import { fileURLToPath } from "node:url";
-//#region src/package-version.ts
+// src/package-version.ts
 /**
 * Version of this package as built — the `version` field of the nearest
 * package.json above this file. Certifications cite it as the checker
@@ -28,7 +28,6 @@ function packageVersion() {
 	} catch {}
 	return "0.0.0-unknown";
 }
-//#endregion
 export { packageVersion as t };
 
-//# sourceMappingURL=package-version-D7lQHt_-.js.map
+//# sourceMappingURL=package-version-CJl_pY9W.js.map

package/dist/{package-version-D7lQHt_-.js.map → package-version-CJl_pY9W.js.map}

@@ -1 +1 @@
-{"version":3,"file":"package-version-D7lQHt_-.js","names":[],"sources":["../src/package-version.ts"],"sourcesContent":["/**\n * Version of this package as built — the `version` field of the nearest\n * package.json above this file. Certifications cite it as the checker\n * version for in-package checkers, so a verdict names the exact code that\n * certified it; the wire server reports it as the service version.\n */\n\nimport { readFileSync } from 'node:fs'\nimport { dirname, resolve } from 'node:path'\nimport { fileURLToPath } from 'node:url'\n\nlet cached: string | undefined\n\n/**\n * Read the package version once and cache it. Both `src/` and the flat\n * `dist/` output sit one level below the package root, so a single `..`\n * hop finds package.json in either layout. Returns `0.0.0-unknown` when no\n * package.json is readable — an honest, greppable sentinel, never a throw:\n * version is provenance metadata, not a measurement.\n */\nexport function packageVersion(): string {\n  if (cached) return cached\n  const here = dirname(fileURLToPath(import.meta.url))\n  try {\n    const pkg = JSON.parse(readFileSync(resolve(here, '..', 'package.json'), 'utf-8')) as {\n      version?: string\n    }\n    if (pkg.version) {\n      cached = pkg.version\n      return pkg.version\n    }\n  } catch {\n    // fall through to the sentinel\n  }\n  return '0.0.0-unknown'\n}\n"],"mappings":";;;;;;;;;;AAWA,IAAI;;;;;;;;AASJ,SAAgB,iBAAyB;CACvC,IAAI,QAAQ,OAAO;CACnB,MAAM,OAAO,QAAQ,cAAc,YAAY,GAAG,CAAC;CACnD,IAAI;EACF,MAAM,MAAM,KAAK,MAAM,aAAa,QAAQ,MAAM,MAAM,cAAc,GAAG,OAAO,CAAC;EAGjF,IAAI,IAAI,SAAS;GACf,SAAS,IAAI;GACb,OAAO,IAAI;EACb;CACF,QAAQ,CAER;CACA,OAAO;AACT"}
+{"version":3,"file":"package-version-CJl_pY9W.js","names":[],"sources":["../src/package-version.ts"],"sourcesContent":["/**\n * Version of this package as built — the `version` field of the nearest\n * package.json above this file. Certifications cite it as the checker\n * version for in-package checkers, so a verdict names the exact code that\n * certified it; the wire server reports it as the service version.\n */\n\nimport { readFileSync } from 'node:fs'\nimport { dirname, resolve } from 'node:path'\nimport { fileURLToPath } from 'node:url'\n\nlet cached: string | undefined\n\n/**\n * Read the package version once and cache it. Both `src/` and the flat\n * `dist/` output sit one level below the package root, so a single `..`\n * hop finds package.json in either layout. Returns `0.0.0-unknown` when no\n * package.json is readable — an honest, greppable sentinel, never a throw:\n * version is provenance metadata, not a measurement.\n */\nexport function packageVersion(): string {\n  if (cached) return cached\n  const here = dirname(fileURLToPath(import.meta.url))\n  try {\n    const pkg = JSON.parse(readFileSync(resolve(here, '..', 'package.json'), 'utf-8')) as {\n      version?: string\n    }\n    if (pkg.version) {\n      cached = pkg.version\n      return pkg.version\n    }\n  } catch {\n    // fall through to the sentinel\n  }\n  return '0.0.0-unknown'\n}\n"],"mappings":";;;;;;;;;;AAWA,IAAI;;;;;;;;AASJ,SAAgB,iBAAyB;CACvC,IAAI,QAAQ,OAAO;CACnB,MAAM,OAAO,QAAQ,cAAc,YAAY,GAAG,CAAC;CACnD,IAAI;EACF,MAAM,MAAM,KAAK,MAAM,aAAa,QAAQ,MAAM,MAAM,cAAc,GAAG,OAAO,CAAC;EAGjF,IAAI,IAAI,SAAS;GACf,SAAS,IAAI;GACb,OAAO,IAAI;EACb;CACF,QAAQ,CAER;CACA,OAAO;AACT"}

package/dist/{paired-arms-B2ttLc0_.js → paired-arms-D-54hO-k.js}

@@ -1,9 +1,9 @@
-import { s as ValidationError } from "./errors-BcOs5MKW.js";
-import { a as findingTreatmentSchema } from "./finding-composition-8n0fFgVI.js";
-import { c as lnGamma, i as makeRng, o as symmetricTwoSampleSeed, r as binomialSignTwoSided, t as assertFiniteSample } from "./internal-BTK91Bqt.js";
-import { r as pairedRiskDifference, t as mcnemar } from "./paired-binary-B_nejA44.js";
-import { i as pairedBootstrap } from "./mean-BbA_JCzW.js";
-//#region src/arm-populations.ts
+import { s as ValidationError } from "./errors-DeEEV9Vx.js";
+import { a as findingTreatmentSchema } from "./finding-composition-DlvE1Qul.js";
+import { c as lnGamma, i as makeRng, o as symmetricTwoSampleSeed, r as binomialSignTwoSided, t as assertFiniteSample } from "./internal-v6XfOeJW.js";
+import { r as pairedRiskDifference, t as mcnemar } from "./paired-binary-BR0nwHOA.js";
+import { i as pairedBootstrap } from "./mean-CdDYG-us.js";
+// src/arm-populations.ts
 const keyOf = (row) => JSON.stringify([
 	row.arm,
 	row.pairKey,
@@ -99,8 +99,7 @@ function summarize(rows, names) {
 		metrics
 	};
 }
-//#endregion
-//#region src/math/normal.ts
+// src/math/normal.ts
 /**
 * Standard normal cumulative distribution using Abramowitz and Stegun 7.1.26.
 *
@@ -121,8 +120,7 @@ function normalCdf(x) {
 	const complement = ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp(-scaled * scaled);
 	return x < 0 ? complement / 2 : 1 - complement / 2;
 }
-//#endregion
-//#region src/statistics/rank-tests.ts
+// src/statistics/rank-tests.ts
 /** Maximum dynamic-programming cells used by an exact two-sample rank test. */
 const MANN_WHITNEY_EXACT_MAX_STATES = 8192;
 /** Maximum inner-loop transitions used by an exact two-sample rank test. */
@@ -501,8 +499,7 @@ function exactSignedRankP(doubledRanks, doubledDeviation) {
 		pFloor: Math.min(1, extreme)
 	};
 }
-//#endregion
-//#region src/paired-arms.ts
+// src/paired-arms.ts
 /**
 * Match rows across two arms into (baseline, treatment) pairs by `pairKey`.
 *
@@ -738,7 +735,6 @@ function metricValue(row, name) {
 	if (!Number.isFinite(v)) throw new ValidationError(`comparePairedArms: non-finite value for metric '${name}' on pairKey '${row.pairKey}' (arm '${row.arm}'): ${v}`);
 	return v;
 }
-//#endregion
 export { wilcoxonSignedRank as a, mannWhitneyU as i, pairArms as n, normalCdf as o, pairRunRecords as r, comparePairedArms as t };
 
-//# sourceMappingURL=paired-arms-B2ttLc0_.js.map
+//# sourceMappingURL=paired-arms-D-54hO-k.js.map

package/dist/{paired-arms-B2ttLc0_.js.map → paired-arms-D-54hO-k.js.map}

@@ -1 +1 @@
-{"version":3,"file":"paired-arms-B2ttLc0_.js","names":[],"sources":["../src/arm-populations.ts","../src/math/normal.ts","../src/statistics/rank-tests.ts","../src/paired-arms.ts"],"sourcesContent":["import type { FindingTreatment } from './analyst/finding-composition'\nimport { findingTreatmentSchema } from './analyst/finding-composition'\nimport type { PairedArmRow } from './paired-arms'\n\n/** Expected seed identities must be supplied independently of completed observations. */\nexport interface ArmAssignment {\n  pairKey: string\n  repKey?: string\n  arm: string\n  treatment?: FindingTreatment[]\n}\nexport interface ArmPopulationSummary {\n  n: number\n  passed: number\n  failed: number\n  missingOutcomes: number\n  /** Unknown unless every unit's outcome was observed; missing is never a failed check. */\n  passRate: number | null\n  metrics: Record<string, { n: number; missing: number; sum: number | null; mean: number | null }>\n}\nexport interface ArmPopulationReading {\n  arm: string\n  assignments: ArmAssignment[]\n  missingObservations: number\n  formation: { formed: number; notFormed: number; unknown: number }\n  asAssigned: ArmPopulationSummary\n  asFormed: ArmPopulationSummary\n}\n\nconst keyOf = (row: ArmAssignment): string =>\n  JSON.stringify([row.arm, row.pairKey, row.repKey ?? null])\nfunction checkIdentity(row: ArmAssignment): void {\n  for (const value of [row.arm, row.pairKey, ...(row.repKey === undefined ? [] : [row.repKey])]) {\n    if (typeof value !== 'string' || !value.trim())\n      throw new TypeError('Arm assignments require nonempty identities')\n  }\n  if (row.treatment !== undefined) {\n    if (!Array.isArray(row.treatment)) throw new TypeError('Arm treatment must be an array')\n    for (const value of row.treatment) findingTreatmentSchema.parse(value)\n    if (new Set(row.treatment.map((t) => t.id)).size !== row.treatment.length)\n      throw new TypeError('Duplicate arm treatment id')\n  }\n}\nfunction checkObservation(row: PairedArmRow): void {\n  checkIdentity(row)\n  if (row.pass != null && typeof row.pass !== 'boolean')\n    throw new TypeError('Invalid arm pass value')\n  if (row.formation !== undefined) {\n    if (row.formation === null || typeof row.formation !== 'object')\n      throw new TypeError('Invalid formation verdict')\n    if (row.formation.formed !== null && typeof row.formation.formed !== 'boolean')\n      throw new TypeError('Invalid formation state')\n    if (row.formation.reason !== undefined && typeof row.formation.reason !== 'string')\n      throw new TypeError('Invalid formation reason')\n  }\n  for (const value of Object.values(row.metrics ?? {})) {\n    if (value !== null && !Number.isFinite(value)) throw new TypeError('Non-finite arm metric')\n  }\n}\n\n/** One roster join serves comparison and both denominators; no outcomes are inferred from formation. */\nexport function prepareArmPopulations(\n  observations: readonly PairedArmRow[],\n  assignments: readonly ArmAssignment[],\n  options: { baselineArm: string; treatmentArm: string; metricNames?: string[] },\n): { rows: PairedArmRow[]; readings: ArmPopulationReading[] } {\n  const arms = [options.baselineArm, options.treatmentArm]\n  const roster = new Map<string, ArmAssignment>()\n  for (const entry of assignments) {\n    if (!arms.includes(entry.arm)) continue\n    checkIdentity(entry)\n    const key = keyOf(entry)\n    if (roster.has(key)) throw new TypeError('Duplicate arm assignment')\n    roster.set(key, structuredClone(entry))\n  }\n  for (const arm of arms)\n    if (![...roster.values()].some((r) => r.arm === arm))\n      throw new TypeError(`No assignment roster for arm '${arm}'`)\n  const actual = new Map<string, PairedArmRow>()\n  for (const row of observations) {\n    if (!arms.includes(row.arm)) continue\n    checkObservation(row)\n    const key = keyOf(row)\n    if (!roster.has(key)) throw new TypeError('Observed seed is outside the assignment roster')\n    if (actual.has(key)) throw new TypeError('Duplicate arm observation')\n    actual.set(key, row)\n  }\n  const ordered = [...roster.entries()].sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n  // Placeholder rows carry identities only. They never manufacture pass, metrics or formation.\n  const rows = ordered.map(([key, entry]) => actual.get(key) ?? entry)\n  const metricNames =\n    options.metricNames ??\n    [...new Set([...actual.values()].flatMap((r) => Object.keys(r.metrics ?? {})))].sort()\n  const readings = arms.map((arm) => {\n    const declared = ordered.filter(([, r]) => r.arm === arm)\n    const asAssigned = declared.map(([key]) => actual.get(key))\n    const asFormed = asAssigned.filter(\n      (row): row is PairedArmRow => row?.formation?.formed === true,\n    )\n    return {\n      arm,\n      assignments: declared.map(([, r]) => r),\n      missingObservations: asAssigned.filter((r) => r === undefined).length,\n      formation: {\n        formed: asFormed.length,\n        notFormed: asAssigned.filter((r) => r?.formation?.formed === false).length,\n        unknown: asAssigned.filter((r) => r?.formation?.formed == null).length,\n      },\n      asAssigned: summarize(asAssigned, metricNames),\n      asFormed: summarize(asFormed, metricNames),\n    }\n  })\n  return { rows, readings }\n}\n\nfunction summarize(\n  rows: readonly (PairedArmRow | undefined)[],\n  names: readonly string[],\n): ArmPopulationSummary {\n  const passed = rows.filter((r) => r?.pass === true).length\n  const failed = rows.filter((r) => r?.pass === false).length\n  const missingOutcomes = rows.length - passed - failed\n  const metrics = Object.fromEntries(\n    names.map((name) => {\n      const values = rows.map((r) => r?.metrics?.[name]).filter((x): x is number => x != null)\n      const sum = values.length ? values.reduce((s, v) => s + v, 0) : null\n      return [\n        name,\n        {\n          n: values.length,\n          missing: rows.length - values.length,\n          sum,\n          mean: sum === null ? null : sum / values.length,\n        },\n      ]\n    }),\n  )\n  return {\n    n: rows.length,\n    passed,\n    failed,\n    missingOutcomes,\n    passRate: rows.length && !missingOutcomes ? passed / rows.length : null,\n    metrics,\n  }\n}\n","/**\n * Standard normal cumulative distribution using Abramowitz and Stegun 7.1.26.\n *\n * The approximation is evaluated as erf(x / sqrt(2)). Computing the negative\n * tail from the complementary term avoids cancellation when x is far below 0.\n * The maximum absolute CDF error is approximately 7.5e-8.\n */\nexport function normalCdf(x: number): number {\n  if (x === 0) return 0.5\n\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 scaled = Math.abs(x) / Math.SQRT2\n  const t = 1 / (1 + p * scaled)\n  const complement = ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp(-scaled * scaled)\n\n  return x < 0 ? complement / 2 : 1 - complement / 2\n}\n","import { ValidationError } from '../errors'\nimport { normalCdf } from '../math/normal'\nimport { lnGamma } from '../math/special-functions'\nimport {\n  assertFiniteSample,\n  binomialSignTwoSided,\n  makeRng,\n  symmetricTwoSampleSeed,\n} from './internal'\n\n// ── Rank tests: exact by default ─────────────────────────────────────\n//\n// At 3–10 repetitions per arm the binding constraint on a rank test is\n// combinatorial, not numerical. Three versus three admits only 20 splits, so\n// the attainable two-sided p-grid starts at 0.1000 and α = 0.05 is out of\n// reach at that design; a normal approximation reports 0.0495, a p-value that\n// describes no attainable outcome. No better approximation fixes this — adding\n// the tie correction moves `[0,0,0]` versus `[1,1,1]` from 0.0495 to 0.0469,\n// further from its exact 0.1000, not closer.\n//\n// So both null distributions are enumerated exactly inside bounded state and\n// work budgets, by convolution over the observed midranks (identical to\n// enumerating every split / sign pattern, and cheaper), which conditions on the\n// realised tie pattern for free. Above those budgets the default is a seeded\n// Monte Carlo permutation. The asymptotic path is never chosen automatically,\n// and asking for it inside the exact-feasible range throws.\n//\n// Every result carries `method` and `pFloor` so a downstream gate can SEE the\n// discreteness rather than infer it: a gate handed data whose `pFloor` exceeds\n// its alpha is underpowered by construction, which is a true statement about\n// the experiment, not a false one about the effect.\n\n/** How a rank test's p-value was actually computed. */\nexport type RankTestMethod = 'exact' | 'permutation' | 'asymptotic'\n\n/**\n * What the caller asks for. `'auto'` selects `'exact'` inside the enumeration\n * threshold and `'permutation'` above it, and never selects `'asymptotic'`.\n */\nexport type RankTestMethodRequest = 'auto' | 'exact' | 'asymptotic'\n\nexport interface RankTestOptions {\n  /** Default `'auto'`. `'asymptotic'` inside the exact-feasible range throws. */\n  method?: RankTestMethodRequest\n  /** Resamples on the Monte Carlo permutation path. Default 100000. */\n  permutations?: number\n  /** Seed for the permutation path. Omitted ⇒ derived from the data itself, so\n   *  the result is reproducible either way. */\n  seed?: number\n}\n\n/** Maximum dynamic-programming cells used by an exact two-sample rank test. */\nconst MANN_WHITNEY_EXACT_MAX_STATES = 8_192\n/** Maximum inner-loop transitions used by an exact two-sample rank test. */\nconst MANN_WHITNEY_EXACT_MAX_WORK = 250_000\n/** Non-zero differences up to which the signed-rank null is enumerated exactly. */\nconst WILCOXON_EXACT_MAX_N = 20\n/** Resamples used when a rank test falls back to Monte Carlo permutation. */\nconst DEFAULT_PERMUTATIONS = 100_000\n\nexport interface MannWhitneyResult {\n  /** `min(U_a, U_b)` — the conventional reported statistic. */\n  u: number\n  /** U for sample `a`. Carries the direction of the effect, which `u` discards. */\n  uA: number\n  /** Two-sided p-value. */\n  p: number\n  /** How `p` was computed. */\n  method: RankTestMethod\n  /** Smallest two-sided p this design can produce. `p` can never be below it. */\n  pFloor: number\n}\n\n/**\n * Mann-Whitney U — two independent samples, no distributional assumption.\n *\n * Exact conditional (permutation) p by default when the dynamic program fits\n * {@link MANN_WHITNEY_EXACT_MAX_STATES} cells and\n * {@link MANN_WHITNEY_EXACT_MAX_WORK} transitions, seeded Monte Carlo\n * permutation above those limits. This keeps imbalanced designs such as 1+24\n * exact without admitting expensive balanced designs merely because they have\n * the same total size. Throws on non-finite input and on `method:\n * 'asymptotic'` where an exact answer is available. Empty input yields `p = 1,\n * pFloor = 1` — no design, no attainable evidence.\n */\nexport function mannWhitneyU(\n  a: number[],\n  b: number[],\n  opts: RankTestOptions = {},\n): MannWhitneyResult {\n  assertFiniteSample('mannWhitneyU', 'a', a)\n  assertFiniteSample('mannWhitneyU', 'b', b)\n\n  const n1 = a.length\n  const n2 = b.length\n  if (n1 === 0 || n2 === 0) return { u: 0, uA: 0, p: 1, method: 'exact', pFloor: 1 }\n\n  const total = n1 + n2\n  const combined = [\n    ...a.map((v) => ({ v, fromA: true })),\n    ...b.map((v) => ({ v, fromA: false })),\n  ].sort((x, y) => x.v - y.v)\n\n  const { midranks, tieTerm } = midranksWithTieTerm(combined.map((entry) => entry.v))\n  let rankSumA = 0\n  for (let k = 0; k < total; k++) {\n    if (combined[k]!.fromA) rankSumA += midranks[k]!\n  }\n\n  const uA = rankSumA - (n1 * (n1 + 1)) / 2\n  const u = Math.min(uA, n1 * n2 - uA)\n  // Midranks are integers or halves, so doubling makes the null convolution\n  // integral. U is centred on n₁n₂/2, hence a doubled centre of n₁n₂.\n  const doubled = midranks.map((rank) => Math.round(rank * 2))\n  const doubledDeviation = Math.abs(2 * uA - n1 * n2)\n  const selectedN = Math.min(n1, n2)\n  const otherN = total - selectedN\n  const exactCost = exactTwoSampleCost(doubled, selectedN)\n\n  const designFloor = exactTwoSampleFloor(doubled, selectedN)\n  const method = selectRankTestMethod(\n    'mannWhitneyU',\n    opts.method ?? 'auto',\n    `n1=${n1}, n2=${n2}`,\n    exactCost.states <= MANN_WHITNEY_EXACT_MAX_STATES &&\n      exactCost.work <= MANN_WHITNEY_EXACT_MAX_WORK,\n    designFloor,\n    `${MANN_WHITNEY_EXACT_MAX_STATES.toLocaleString('en-US')} states and ` +\n      `${MANN_WHITNEY_EXACT_MAX_WORK.toLocaleString('en-US')} transitions`,\n  )\n\n  if (method === 'exact') {\n    const { p, pFloor } = exactTwoSampleP(doubled, selectedN, otherN, doubledDeviation)\n    return { u, uA, p, method, pFloor }\n  }\n\n  if (method === 'asymptotic') {\n    return {\n      u,\n      uA,\n      p: asymptoticTwoSidedP(doubledDeviation / 2, twoSampleSigma(n1, n2, total, tieTerm)),\n      method,\n      pFloor: designFloor,\n    }\n  }\n\n  const permutations = resolvePermutations('mannWhitneyU', opts.permutations)\n  const rng = opts.seed === undefined ? makeRng(symmetricTwoSampleSeed(a, b)) : makeRng(opts.seed)\n  let atLeastAsExtreme = 0\n  const pool = [...doubled]\n  for (let iteration = 0; iteration < permutations; iteration++) {\n    let doubledRankSum = 0\n    for (let k = 0; k < selectedN; k++) {\n      const pick = k + Math.floor(rng() * (total - k))\n      const swapped = pool[pick]!\n      pool[pick] = pool[k]!\n      pool[k] = swapped\n      doubledRankSum += swapped\n    }\n    if (\n      Math.abs(doubledRankSum - selectedN * (selectedN + 1) - selectedN * otherN) >=\n      doubledDeviation\n    ) {\n      atLeastAsExtreme++\n    }\n  }\n  const pFloor = Math.max(1 / (permutations + 1), designFloor)\n  return {\n    u,\n    uA,\n    p: Math.max((1 + atLeastAsExtreme) / (permutations + 1), pFloor),\n    method,\n    pFloor,\n  }\n}\n\nexport interface WilcoxonSignedRankResult {\n  /** W⁺, the rank sum of the positive differences. (scipy reports\n   *  `min(W⁺, W⁻)`; compare statistics only after converting.) */\n  w: number\n  /** Two-sided p-value. */\n  p: number\n  /** How `p` was computed. */\n  method: RankTestMethod\n  /** Smallest two-sided p this design can produce. */\n  pFloor: number\n  /** Non-zero differences — zero differences are dropped and carry no rank. */\n  nNonZero: number\n}\n\n/**\n * Wilcoxon signed-rank — paired, no distributional assumption on the deltas.\n *\n * Exact conditional (sign-flip) p by default at `n ≤\n * {@link WILCOXON_EXACT_MAX_N}` non-zero differences, seeded Monte Carlo\n * permutation above it. Throws on non-finite input and on `method:\n * 'asymptotic'` where an exact answer is available.\n *\n * `n` is the count of NON-ZERO differences: exact ties are dropped before\n * ranking, so a run of tied pairs shrinks the design and raises `pFloor`.\n * All-tied input yields `p = 1, pFloor = 1` — no attainable evidence, which\n * `pFloor` states rather than leaving `p = 1` to be read as a measured null.\n */\nexport function wilcoxonSignedRank(\n  before: number[],\n  after: number[],\n  opts: RankTestOptions = {},\n): WilcoxonSignedRankResult {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `wilcoxonSignedRank: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  assertFiniteSample('wilcoxonSignedRank', 'before', before)\n  assertFiniteSample('wilcoxonSignedRank', 'after', after)\n\n  const diffs = before.map((b, i) => after[i]! - b).filter((d) => d !== 0)\n  const n = diffs.length\n  if (n === 0) return { w: 0, p: 1, method: 'exact', pFloor: 1, nNonZero: 0 }\n\n  // When every non-zero difference has the same magnitude, the signed-rank\n  // null reduces exactly to a binomial sign distribution. This is the common\n  // pass/fail shape ({-1, 0, +1}); recognizing it avoids a 100k-draw\n  // permutation for every repeated gate evaluation while preserving the exact\n  // p-value and attainable floor. Explicit method requests still retain their\n  // documented behavior.\n  const abs = Math.abs(diffs[0]!)\n  const allEqualAbs = diffs.every((d) => Math.abs(d) === abs)\n  if ((opts.method === undefined || opts.method === 'auto') && allEqualAbs) {\n    const positive = diffs.filter((d) => d > 0).length\n    const negative = n - positive\n    return {\n      w: (positive * (n + 1)) / 2,\n      p: binomialSignTwoSided(positive, negative),\n      method: 'exact',\n      pFloor: Math.min(1, 2 ** (1 - n)),\n      nNonZero: n,\n    }\n  }\n\n  const order = diffs.map((d, i) => ({ abs: Math.abs(d), i })).sort((x, y) => x.abs - y.abs)\n  const { midranks, tieTerm } = midranksWithTieTerm(order.map((entry) => entry.abs))\n  const ranks: number[] = new Array(n)\n  for (let k = 0; k < n; k++) ranks[order[k]!.i] = midranks[k]!\n\n  let wPlus = 0\n  for (let k = 0; k < n; k++) if (diffs[k]! > 0) wPlus += ranks[k]!\n\n  // Midranks are integers or halves; doubling makes the convolution integral.\n  // Σ midranks = n(n+1)/2 whatever the tie pattern, so E[W⁺] = n(n+1)/4 and\n  // the doubled centre is n(n+1)/2.\n  const doubled = midranks.map((rank) => Math.round(rank * 2))\n  const doubledDeviation = Math.abs(2 * wPlus - (n * (n + 1)) / 2)\n\n  const designFloor = Math.min(1, 2 ** (1 - n))\n  const method = selectRankTestMethod(\n    'wilcoxonSignedRank',\n    opts.method ?? 'auto',\n    `n=${n} non-zero differences`,\n    n <= WILCOXON_EXACT_MAX_N,\n    designFloor,\n    `${WILCOXON_EXACT_MAX_N} non-zero differences`,\n  )\n\n  if (method === 'exact') {\n    const { p, pFloor } = exactSignedRankP(doubled, doubledDeviation)\n    return { w: wPlus, p, method, pFloor, nNonZero: n }\n  }\n\n  if (method === 'asymptotic') {\n    const variance = (n * (n + 1) * (2 * n + 1)) / 24 - tieTerm / 48\n    return {\n      w: wPlus,\n      p: asymptoticTwoSidedP(doubledDeviation / 2, Math.sqrt(variance)),\n      method,\n      pFloor: designFloor,\n      nNonZero: n,\n    }\n  }\n\n  const permutations = resolvePermutations('wilcoxonSignedRank', opts.permutations)\n  const rng = makeRng(opts.seed, before, after)\n  const doubledCentre = (n * (n + 1)) / 2\n  let atLeastAsExtreme = 0\n  for (let iteration = 0; iteration < permutations; iteration++) {\n    let doubledWPlus = 0\n    for (let k = 0; k < n; k++) if (rng() < 0.5) doubledWPlus += doubled[k]!\n    if (Math.abs(doubledWPlus - doubledCentre) >= doubledDeviation) atLeastAsExtreme++\n  }\n  return {\n    w: wPlus,\n    p: (1 + atLeastAsExtreme) / (permutations + 1),\n    method,\n    pFloor: Math.max(1 / (permutations + 1), designFloor),\n    nNonZero: n,\n  }\n}\n\n/**\n * Average ranks over an ASCENDING-sorted array, plus `Σ(t³ − t)` over tie\n * groups of size `t` — the correction term both asymptotic rank-test variances\n * need.\n */\nfunction midranksWithTieTerm(sorted: readonly number[]): { midranks: number[]; tieTerm: number } {\n  const midranks = new Array<number>(sorted.length)\n  let tieTerm = 0\n  let i = 0\n  while (i < sorted.length) {\n    let j = i\n    while (j < sorted.length && sorted[j] === sorted[i]) j++\n    const average = (i + 1 + j) / 2\n    for (let k = i; k < j; k++) midranks[k] = average\n    const groupSize = j - i\n    if (groupSize > 1) tieTerm += groupSize ** 3 - groupSize\n    i = j\n  }\n  return { midranks, tieTerm }\n}\n\nfunction selectRankTestMethod(\n  fn: string,\n  request: RankTestMethodRequest,\n  design: string,\n  exactFeasible: boolean,\n  designFloor: number,\n  threshold: string,\n): RankTestMethod {\n  if (request === 'auto') return exactFeasible ? 'exact' : 'permutation'\n  if (request === 'exact') {\n    if (exactFeasible) return 'exact'\n    throw new ValidationError(\n      `${fn}: method 'exact' is out of range at ${design} — enumeration is bounded by ` +\n        `${threshold}. Use 'auto' for the seeded Monte Carlo permutation, which converges ` +\n        'to the same answer.',\n    )\n  }\n  if (exactFeasible) {\n    throw new ValidationError(\n      `${fn}: method 'asymptotic' is refused at ${design} — the exact p-grid at this design ` +\n        `starts at ${formatProbability(designFloor)}, so an asymptotic p below it describes no ` +\n        `attainable outcome. Use method 'exact' (the default) or add repetitions past ` +\n        `${threshold}.`,\n    )\n  }\n  return 'asymptotic'\n}\n\nfunction resolvePermutations(fn: string, permutations: number | undefined): number {\n  if (permutations === undefined) return DEFAULT_PERMUTATIONS\n  if (!Number.isInteger(permutations) || permutations < 1) {\n    throw new ValidationError(`${fn}: permutations must be a positive integer, got ${permutations}`)\n  }\n  return permutations\n}\n\n/** Two-sided normal-approximation tail with the continuity correction. */\nfunction asymptoticTwoSidedP(deviation: number, sigma: number): number {\n  if (!(sigma > 0)) return 1\n  return Math.min(1, 2 * (1 - normalCdf(Math.max(0, deviation - 0.5) / sigma)))\n}\n\n/** SD of U under the permutation null, corrected for the realised ties. The\n *  tie term reduces (N+1) and reaches it exactly when every value is tied, so\n *  the variance floors at 0 rather than going negative. */\nfunction twoSampleSigma(n1: number, n2: number, total: number, tieTerm: number): number {\n  if (total < 2) return 0\n  const variance = ((n1 * n2) / 12) * (total + 1 - tieTerm / (total * (total - 1)))\n  return Math.sqrt(Math.max(0, variance))\n}\n\nfunction logChoose(n: number, k: number): number {\n  return lnGamma(n + 1) - lnGamma(k + 1) - lnGamma(n - k + 1)\n}\n\nfunction formatProbability(value: number): string {\n  return value >= 1e-4 || value === 0 ? value.toFixed(4) : value.toExponential(3)\n}\n\n/**\n * Exact DP allocation and loop count for this observed rank vector.\n *\n * The smaller arm is sufficient because selecting its complement produces the\n * same two-sided U deviation while using fewer rows in the state table.\n */\nfunction exactTwoSampleCost(\n  doubledRanks: readonly number[],\n  selectedN: number,\n): { states: number; work: number } {\n  const maxSum = doubledRanks.reduce((sum, rank) => sum + rank, 0)\n  let work = 0\n  for (let placed = 0; placed < doubledRanks.length; placed++) {\n    work += Math.min(selectedN, placed + 1) * (maxSum - doubledRanks[placed]! + 1)\n  }\n  return {\n    states: (selectedN + 1) * (maxSum + 1),\n    work,\n  }\n}\n\n/**\n * Smallest attainable two-sided p under the observed ties.\n *\n * Only subsets with the minimum or maximum rank sum can attain the largest\n * deviation. Their multiplicity is the number of ways to choose within the\n * tie group at each boundary, so this calculation is exact without allocating\n * the full null distribution.\n */\nfunction exactTwoSampleFloor(doubledRanks: readonly number[], selectedN: number): number {\n  const total = doubledRanks.length\n  const otherN = total - selectedN\n  const minimumSum = doubledRanks.slice(0, selectedN).reduce((sum, rank) => sum + rank, 0)\n  const maximumSum = doubledRanks.slice(total - selectedN).reduce((sum, rank) => sum + rank, 0)\n  if (minimumSum === maximumSum) return 1\n\n  const centre = selectedN * (selectedN + 1) + selectedN * otherN\n  const minimumDeviation = Math.abs(minimumSum - centre)\n  const maximumDeviation = Math.abs(maximumSum - centre)\n  const totalLogWays = logChoose(total, selectedN)\n  const minimumMass = Math.exp(\n    logExtremeSubsetWays(doubledRanks, selectedN, 'minimum') - totalLogWays,\n  )\n  const maximumMass = Math.exp(\n    logExtremeSubsetWays(doubledRanks, selectedN, 'maximum') - totalLogWays,\n  )\n\n  if (minimumDeviation > maximumDeviation) return minimumMass\n  if (maximumDeviation > minimumDeviation) return maximumMass\n  return Math.min(1, minimumMass + maximumMass)\n}\n\nfunction logExtremeSubsetWays(\n  sortedRanks: readonly number[],\n  selectedN: number,\n  side: 'minimum' | 'maximum',\n): number {\n  const boundaryIndex = side === 'minimum' ? selectedN - 1 : sortedRanks.length - selectedN\n  const boundary = sortedRanks[boundaryIndex]!\n  let first = boundaryIndex\n  let afterLast = boundaryIndex + 1\n  while (first > 0 && sortedRanks[first - 1] === boundary) first--\n  while (afterLast < sortedRanks.length && sortedRanks[afterLast] === boundary) afterLast++\n\n  const tieSize = afterLast - first\n  const fixed = side === 'minimum' ? first : sortedRanks.length - afterLast\n  return logChoose(tieSize, selectedN - fixed)\n}\n\n/**\n * Exact conditional two-sided p for the two-sample rank test.\n *\n * Convolves the observed doubled midranks into the null distribution of group\n * a's rank sum over every `C(n₁+n₂, n₁)` split — identical to enumerating the\n * splits, but `O(N·n₁·ΣR)` instead of `O(C(N,n₁)·n₁n₂)`. Conditioning on the\n * realised multiset makes the tie handling exact rather than a correction.\n *\n * The null is symmetric about `n₁n₂/2` (negating every value maps `U → n₁n₂ −\n * U` and permutes the split set onto itself), so the two-sided p is the mass\n * at least as far from the centre as the observation.\n */\nfunction exactTwoSampleP(\n  doubledRanks: readonly number[],\n  n1: number,\n  n2: number,\n  doubledDeviation: number,\n): { p: number; pFloor: number } {\n  const maxSum = doubledRanks.reduce((sum, rank) => sum + rank, 0)\n  const width = maxSum + 1\n  // ways[k][s] = number of size-k subsets whose doubled rank sum is s.\n  const ways: Float64Array[] = Array.from({ length: n1 + 1 }, () => new Float64Array(width))\n  ways[0]![0] = 1\n  let placed = 0\n  for (const rank of doubledRanks) {\n    for (let k = Math.min(n1, placed + 1); k >= 1; k--) {\n      const from = ways[k - 1]!\n      const into = ways[k]!\n      for (let sum = maxSum - rank; sum >= 0; sum--) {\n        const count = from[sum]!\n        if (count !== 0) into[sum + rank]! += count\n      }\n    }\n    placed++\n  }\n\n  // U = rankSum − n₁(n₁+1)/2, so doubled U = s − n₁(n₁+1), and the doubled\n  // centre 2·(n₁n₂/2) is n₁n₂.\n  const shift = n1 * (n1 + 1) + n1 * n2\n  const chosen = ways[n1]!\n  let totalWays = 0\n  let extremeWays = 0\n  let tailWays = 0\n  let maxDeviation = -1\n  for (let sum = 0; sum < width; sum++) {\n    const count = chosen[sum]!\n    if (count === 0) continue\n    totalWays += count\n    const deviation = Math.abs(sum - shift)\n    if (deviation >= doubledDeviation) tailWays += count\n    if (deviation > maxDeviation) {\n      maxDeviation = deviation\n      extremeWays = count\n    } else if (deviation === maxDeviation) {\n      extremeWays += count\n    }\n  }\n  return { p: tailWays / totalWays, pFloor: extremeWays / totalWays }\n}\n\n/**\n * Exact conditional two-sided p for the paired signed-rank test.\n *\n * Convolves the observed doubled absolute midranks over all `2ⁿ` sign\n * assignments in `O(n·ΣR)`. Probabilities rather than counts keep `2ⁿ` off the\n * arithmetic. The null is symmetric about `n(n+1)/4`.\n */\nfunction exactSignedRankP(\n  doubledRanks: readonly number[],\n  doubledDeviation: number,\n): { p: number; pFloor: number } {\n  const maxSum = doubledRanks.reduce((sum, rank) => sum + rank, 0)\n  const width = maxSum + 1\n  let mass = new Float64Array(width)\n  mass[0] = 1\n  for (const rank of doubledRanks) {\n    const next = new Float64Array(width)\n    for (let sum = 0; sum < width; sum++) {\n      const probability = mass[sum]!\n      if (probability === 0) continue\n      next[sum]! += probability * 0.5\n      next[sum + rank]! += probability * 0.5\n    }\n    mass = next\n  }\n\n  const centre = maxSum / 2\n  let tail = 0\n  let extreme = 0\n  let maxDeviation = -1\n  for (let sum = 0; sum < width; sum++) {\n    const probability = mass[sum]!\n    if (probability === 0) continue\n    const deviation = Math.abs(sum - centre)\n    if (deviation >= doubledDeviation) tail += probability\n    if (deviation > maxDeviation) {\n      maxDeviation = deviation\n      extreme = probability\n    } else if (deviation === maxDeviation) {\n      extreme += probability\n    }\n  }\n  return { p: Math.min(1, tail), pFloor: Math.min(1, extreme) }\n}\n","/**\n * Matched-pair arm comparison — \"did the treatment arm beat the baseline arm\n * on the SAME work items?\"\n *\n * An arm A/B over run records is only trustworthy when it is PAIRED: the same\n * task/scenario/seed evaluated under both arms, compared item-by-item, so\n * inter-item difficulty variance cancels instead of masquerading as an arm\n * effect. This module owns the two error-prone steps every consumer otherwise\n * hand-rolls:\n *\n *   1. Pairing — matching rows across arms by `pairKey` (and by `repKey`\n *      within multi-rep items), with leftovers REPORTED rather than silently\n *      dropped (a silently unbalanced pairing biases every paired statistic\n *      downstream). Pairing never keys on outcome content: matching reps by\n *      their outcomes deflates discordant-pair counts and makes McNemar\n *      anti-conservative, so reps pair only by (`pairKey`, `repKey`) identity.\n *   2. Composition — feeding the matched pairs to the correct paired\n *      estimators that already live in `statistics`: `mcnemar` +\n *      `pairedRiskDifference` for pass/fail, `pairedBootstrap` +\n *      `wilcoxonSignedRank` for continuous metrics. No statistic is\n *      re-implemented here.\n *\n * The row shape is deliberately structural — callers project a `RunRecord`\n * (or any record) into `{ pairKey, arm, pass?, metrics? }`. Arm names are\n * caller-supplied parameters; the module ships no domain literal.\n */\n\nimport type { FindingTreatment } from './analyst/finding-composition'\nimport {\n  type ArmAssignment,\n  type ArmPopulationReading,\n  prepareArmPopulations,\n} from './arm-populations'\nimport { ValidationError } from './errors'\nimport type { RunRecord } from './run-record'\nimport type { McNemarResult, PairedBootstrapOptions, PairedBootstrapResult } from './statistics'\nimport {\n  mcnemar,\n  pairedBootstrap,\n  pairedRiskDifference,\n  type RiskDifferenceResult,\n  wilcoxonSignedRank,\n} from './statistics'\n\n/** One arm observation of one work item. Structural on purpose: callers\n *  project their own record type (e.g. a `RunRecord`) into this shape. */\nexport interface PairedArmRow {\n  /** Matching key — rows sharing a `pairKey` across both arms form pairs\n   *  (typically the task/scenario/seed identity). */\n  pairKey: string\n  /** Rep identity within a `pairKey` (e.g. a seed or rep number). Required on\n   *  every row of a `pairKey` that has more than one rep in either arm; reps\n   *  then pair only on exact (`pairKey`, `repKey`) match, never on outcome\n   *  content. Optional when each arm has at most one rep of the item. */\n  repKey?: string\n  /** Arm label this row was produced under. */\n  arm: string\n  /** Binary outcome; omit or null when no pass/fail outcome was observed. */\n  pass?: boolean | null\n  /** Actual formation verdict from the execution owner; absence/null stays unknown. */\n  formation?: { formed: boolean | null; reason?: string }\n  /** Recorded treatment provenance; assigned bundles live on the independent roster. */\n  treatment?: FindingTreatment[]\n  /** Named finite measurements; null/absent readings are unknown, not zero. */\n  metrics?: Record<string, number | null>\n}\n\nexport interface PairArmsOptions {\n  /** Arm treated as the control side of every pair. */\n  baselineArm: string\n  /** Arm treated as the treatment side of every pair. */\n  treatmentArm: string\n}\n\n/** One matched (baseline, treatment) observation of the same work item. */\nexport interface MatchedPair {\n  pairKey: string\n  /** 0-based position of this pair within its `pairKey`, ordered by sorted\n   *  `repKey` (always 0 for a single-rep item). The rep identity itself is on\n   *  the rows (`baseline.repKey` / `treatment.repKey`). */\n  repIndex: number\n  baseline: PairedArmRow\n  treatment: PairedArmRow\n}\n\nexport interface PairArmsResult {\n  /** Matched pairs, ordered by (`pairKey`, `repIndex`). */\n  pairs: MatchedPair[]\n  /** Baseline rows left without a treatment counterpart — reported, never\n   *  silently dropped. */\n  unpairedBaseline: PairedArmRow[]\n  /** Treatment rows left without a baseline counterpart. */\n  unpairedTreatment: PairedArmRow[]\n}\n\n/**\n * Match rows across two arms into (baseline, treatment) pairs by `pairKey`.\n *\n * A `pairKey` with at most one row per arm pairs directly, no `repKey`\n * needed. A `pairKey` with multiple reps in either arm requires `repKey` on\n * every one of its rows, and reps pair only on exact (`pairKey`, `repKey`)\n * match — pairing is keyed purely on row identity, never on outcome content\n * (outcome-keyed matching deflates discordant counts and biases McNemar), and\n * is therefore independent of input order. Reps whose `repKey` has no\n * counterpart in the other arm, and items present in only one arm, land in\n * the unpaired lists — reported, never truncated.\n *\n * Fail-loud: throws when either named arm has zero rows (an unknown arm\n * name would otherwise read as \"everything unpaired\"), when the two arm\n * names are equal, when a multi-rep `pairKey` has a row without `repKey`, or\n * when a (`pairKey`, arm) group repeats a `repKey` (the match would be\n * ambiguous).\n */\nexport function pairArms(rows: readonly PairedArmRow[], opts: PairArmsOptions): PairArmsResult {\n  const { baselineArm, treatmentArm } = opts\n  if (baselineArm === treatmentArm) {\n    throw new ValidationError(\n      `pairArms: baselineArm and treatmentArm are both '${baselineArm}' — an arm cannot be compared to itself`,\n    )\n  }\n\n  // arm → pairKey → rows\n  const byArm = new Map<string, Map<string, PairedArmRow[]>>()\n  const armsSeen = new Set<string>()\n  for (const row of rows) {\n    armsSeen.add(row.arm)\n    if (row.arm !== baselineArm && row.arm !== treatmentArm) continue\n    const byKey = byArm.get(row.arm) ?? new Map<string, PairedArmRow[]>()\n    const group = byKey.get(row.pairKey) ?? []\n    group.push(row)\n    byKey.set(row.pairKey, group)\n    byArm.set(row.arm, byKey)\n  }\n\n  for (const arm of [baselineArm, treatmentArm]) {\n    if (!byArm.has(arm)) {\n      const seen = [...armsSeen].sort().join(', ') || '<none>'\n      throw new ValidationError(`pairArms: no rows for arm '${arm}' (arms present: ${seen})`)\n    }\n  }\n\n  const baselineByKey = byArm.get(baselineArm)!\n  const treatmentByKey = byArm.get(treatmentArm)!\n\n  const allKeys = [...new Set([...baselineByKey.keys(), ...treatmentByKey.keys()])].sort()\n  const pairs: MatchedPair[] = []\n  const unpairedBaseline: PairedArmRow[] = []\n  const unpairedTreatment: PairedArmRow[] = []\n  for (const pairKey of allKeys) {\n    const b = baselineByKey.get(pairKey) ?? []\n    const t = treatmentByKey.get(pairKey) ?? []\n\n    if (b.length <= 1 && t.length <= 1) {\n      if (b.length === 1 && t.length === 1) {\n        const baseline = b[0]!\n        const treatment = t[0]!\n        if (baseline.repKey !== undefined || treatment.repKey !== undefined) {\n          if (\n            baseline.repKey === undefined ||\n            treatment.repKey === undefined ||\n            baseline.repKey !== treatment.repKey\n          ) {\n            unpairedBaseline.push(baseline)\n            unpairedTreatment.push(treatment)\n            continue\n          }\n        }\n        pairs.push({ pairKey, repIndex: 0, baseline, treatment })\n      } else {\n        unpairedBaseline.push(...b)\n        unpairedTreatment.push(...t)\n      }\n      continue\n    }\n\n    const bByRep = indexByRepKey(b, pairKey, baselineArm)\n    const tByRep = indexByRepKey(t, pairKey, treatmentArm)\n    const repKeys = [...new Set([...bByRep.keys(), ...tByRep.keys()])].sort()\n    let repIndex = 0\n    for (const repKey of repKeys) {\n      const baseline = bByRep.get(repKey)\n      const treatment = tByRep.get(repKey)\n      if (baseline !== undefined && treatment !== undefined) {\n        pairs.push({ pairKey, repIndex: repIndex++, baseline, treatment })\n      } else if (baseline !== undefined) {\n        unpairedBaseline.push(baseline)\n      } else if (treatment !== undefined) {\n        unpairedTreatment.push(treatment)\n      }\n    }\n  }\n\n  return { pairs, unpairedBaseline, unpairedTreatment }\n}\n\n/** Index a multi-rep (pairKey, arm) group by `repKey`, enforcing that every\n *  row carries one and that no repKey repeats within the group. */\nfunction indexByRepKey(\n  group: readonly PairedArmRow[],\n  pairKey: string,\n  arm: string,\n): Map<string, PairedArmRow> {\n  const byRep = new Map<string, PairedArmRow>()\n  for (const row of group) {\n    if (row.repKey === undefined) {\n      throw new ValidationError(\n        `pairArms: pairKey '${pairKey}' has multiple reps in an arm, but a row in arm '${arm}' ` +\n          `is missing repKey — multi-rep items require an explicit repKey on every row so reps ` +\n          `pair by identity (pairing reps by outcome or by index would bias the paired statistics)`,\n      )\n    }\n    if (byRep.has(row.repKey)) {\n      throw new ValidationError(\n        `pairArms: duplicate repKey '${row.repKey}' for pairKey '${pairKey}' in arm '${arm}' — ` +\n          `(pairKey, repKey) must uniquely identify a rep within an arm`,\n      )\n    }\n    byRep.set(row.repKey, row)\n  }\n  return byRep\n}\n\n/** Paired pass/fail comparison over the pairs where BOTH sides carry `pass`. */\nexport interface PairedCorrectness {\n  /** Discordant pairs where the treatment passed and the baseline failed. */\n  b10: number\n  /** Discordant pairs where the baseline passed and the treatment failed. */\n  b01: number\n  /** Exact McNemar significance over the paired outcomes (`b === b10`, `c === b01`). */\n  mcnemar: McNemarResult\n  /** Paired effect size: p(treatment) − p(baseline) with a paired-variance CI. */\n  riskDifference: RiskDifferenceResult\n}\n\n/** Paired delta summary for one named metric (delta = treatment − baseline). */\nexport interface PairedMetricDelta {\n  name: string\n  /** Pairs where BOTH sides carry a finite value for this metric. */\n  n: number\n  /** Pairs where at least one side does not carry the metric. */\n  nMissing: number\n  /** Median paired delta, or null when `n === 0`. */\n  medianDelta: number | null\n  /** Mean paired delta, or null when `n === 0`. */\n  meanDelta: number | null\n  /** Bootstrap CI on the paired delta (`pairedBootstrap`); null when\n   *  `n === 0` — a zero-width [0, 0] interval on no data would read as a\n   *  measured tight null. */\n  bootstrapCi: PairedBootstrapResult | null\n  /** Wilcoxon signed-rank test on the paired deltas; null when `n === 0`. */\n  wilcoxon: { w: number; p: number } | null\n}\n\nexport interface ComparePairedArmsOptions extends PairArmsOptions {\n  /** Supply all expected seeds to report as-assigned and as-formed populations. */\n  assignments?: readonly ArmAssignment[]\n  /** Metrics to compare. Default: every metric name observed on any matched\n   *  pair, sorted. A name that appears on no pair is still reported (with\n   *  `n = 0`) so a misspelled metric is visible instead of vanishing. */\n  metricNames?: string[]\n  /** Passed through to `pairedBootstrap` — set `seed` for reproducible CIs. */\n  bootstrap?: PairedBootstrapOptions\n}\n\nexport interface PairedArmsComparison {\n  /** Absent when the assignment population is unknown (no roster supplied). */\n  armPopulations?: ArmPopulationReading[]\n  nPairs: number\n  nUnpairedBaseline: number\n  nUnpairedTreatment: number\n  /** null when no matched pair carries `pass` on both sides — a pass/fail\n   *  verdict over rows that never measured pass/fail would be fabricated. */\n  correctness: PairedCorrectness | null\n  metricDeltas: PairedMetricDelta[]\n}\n\n/**\n * Full matched-pair arm comparison: pair via {@link pairArms}, then compose\n * the paired estimators from `statistics` over the matched pairs.\n *\n * Correctness uses only the pairs where both sides carry `pass` (`mcnemar.n`\n * is that subset's size); each metric uses only the pairs where both sides\n * carry a finite value for it, with the remainder counted in `nMissing`.\n * Deltas are treatment − baseline throughout. With an assignment roster, pairing\n * covers declared seed identities; missing observations remain identity-only rows\n * and never contribute fabricated outcomes or metrics. Per-arm summaries report\n * every assignment and the explicitly formed subset separately.\n *\n * Fail-loud: inherits {@link pairArms}'s unknown-arm throw, and throws on a\n * non-finite metric value — silently treating corrupt telemetry as \"metric\n * absent\" would misreport it as missing coverage.\n */\nexport function comparePairedArms(\n  rows: readonly PairedArmRow[],\n  opts: ComparePairedArmsOptions,\n): PairedArmsComparison {\n  const populations =\n    opts.assignments === undefined ? undefined : prepareArmPopulations(rows, opts.assignments, opts)\n  const { pairs, unpairedBaseline, unpairedTreatment } = pairArms(populations?.rows ?? rows, opts)\n\n  let correctness: PairedCorrectness | null = null\n  const baselinePass: number[] = []\n  const treatmentPass: number[] = []\n  for (const pair of pairs) {\n    if (pair.baseline.pass == null || pair.treatment.pass == null) continue\n    baselinePass.push(pair.baseline.pass ? 1 : 0)\n    treatmentPass.push(pair.treatment.pass ? 1 : 0)\n  }\n  if (baselinePass.length > 0) {\n    const mc = mcnemar(baselinePass, treatmentPass)\n    correctness = {\n      b10: mc.b,\n      b01: mc.c,\n      mcnemar: mc,\n      riskDifference: pairedRiskDifference(baselinePass, treatmentPass),\n    }\n  }\n\n  const metricNames =\n    opts.metricNames ??\n    [\n      ...new Set(\n        pairs.flatMap((p) => [\n          ...Object.keys(p.baseline.metrics ?? {}),\n          ...Object.keys(p.treatment.metrics ?? {}),\n        ]),\n      ),\n    ].sort()\n\n  const metricDeltas: PairedMetricDelta[] = metricNames.map((name) => {\n    const before: number[] = []\n    const after: number[] = []\n    let nMissing = 0\n    for (const pair of pairs) {\n      const b = metricValue(pair.baseline, name)\n      const t = metricValue(pair.treatment, name)\n      if (b === undefined || t === undefined) {\n        nMissing++\n        continue\n      }\n      before.push(b)\n      after.push(t)\n    }\n    const bootstrapCi = before.length === 0 ? null : pairedBootstrap(before, after, opts.bootstrap)\n    return {\n      name,\n      n: before.length,\n      nMissing,\n      medianDelta: bootstrapCi?.median ?? null,\n      meanDelta: bootstrapCi?.mean ?? null,\n      bootstrapCi,\n      wilcoxon: before.length === 0 ? null : wilcoxonSignedRank(before, after),\n    }\n  })\n\n  return {\n    ...(populations ? { armPopulations: populations.readings } : {}),\n    nPairs: pairs.length,\n    nUnpairedBaseline: unpairedBaseline.length,\n    nUnpairedTreatment: unpairedTreatment.length,\n    correctness,\n    metricDeltas,\n  }\n}\n\nexport interface MatchedRunRecordPair {\n  pairKey: string\n  repKey: string\n  baseline: RunRecord\n  treatment: RunRecord\n}\n\nexport interface PairRunRecordsResult {\n  pairs: MatchedRunRecordPair[]\n  unpairedBaseline: RunRecord[]\n  unpairedTreatment: RunRecord[]\n}\n\ninterface RunRecordArmRow extends PairedArmRow {\n  run: RunRecord\n  repKey: string\n}\n\n/**\n * Pair two RunRecord arms by the identity of the evaluated work:\n * `(experimentId, scenarioId, seed)`.\n *\n * Falling back to array order, candidate id, or experiment id can compare\n * different tasks and fabricate lift. Duplicate identities throw.\n */\nexport function pairRunRecords(\n  baselineRuns: readonly RunRecord[],\n  treatmentRuns: readonly RunRecord[],\n): PairRunRecordsResult {\n  const baselineRows = runRecordArmRows(baselineRuns, 'baseline')\n  const treatmentRows = runRecordArmRows(treatmentRuns, 'treatment')\n  validateRunRecordArmRows(baselineRows, 'baseline')\n  validateRunRecordArmRows(treatmentRows, 'treatment')\n  if (baselineRows.length === 0 || treatmentRows.length === 0) {\n    return {\n      pairs: [],\n      unpairedBaseline: baselineRows.map((row) => row.run),\n      unpairedTreatment: treatmentRows.map((row) => row.run),\n    }\n  }\n\n  const result = pairArms([...baselineRows, ...treatmentRows], {\n    baselineArm: 'baseline',\n    treatmentArm: 'treatment',\n  })\n  return {\n    pairs: result.pairs.map((pair) => {\n      const baseline = pair.baseline as RunRecordArmRow\n      const treatment = pair.treatment as RunRecordArmRow\n      return {\n        pairKey: pair.pairKey,\n        repKey: baseline.repKey,\n        baseline: baseline.run,\n        treatment: treatment.run,\n      }\n    }),\n    unpairedBaseline: result.unpairedBaseline.map((row) => (row as RunRecordArmRow).run),\n    unpairedTreatment: result.unpairedTreatment.map((row) => (row as RunRecordArmRow).run),\n  }\n}\n\nfunction runRecordArmRows(runs: readonly RunRecord[], arm: string): RunRecordArmRow[] {\n  return runs.map((run) => {\n    const scenarioId = run.scenarioId.trim()\n    if (!scenarioId) {\n      throw new ValidationError(\n        `pairRunRecords: run '${run.runId}' is missing scenarioId; paired comparisons require explicit scenario identity`,\n      )\n    }\n    return {\n      pairKey: JSON.stringify([run.experimentId, scenarioId]),\n      repKey: String(run.seed),\n      arm,\n      run,\n    }\n  })\n}\n\nfunction validateRunRecordArmRows(rows: readonly RunRecordArmRow[], arm: string): void {\n  const byPairKey = new Map<string, RunRecordArmRow[]>()\n  for (const row of rows) {\n    const group = byPairKey.get(row.pairKey) ?? []\n    group.push(row)\n    byPairKey.set(row.pairKey, group)\n  }\n  for (const [pairKey, group] of byPairKey) {\n    if (group.length > 1) indexByRepKey(group, pairKey, arm)\n  }\n}\n\nfunction metricValue(row: PairedArmRow, name: string): number | undefined {\n  const v = row.metrics?.[name]\n  if (v == null) return undefined\n  if (!Number.isFinite(v)) {\n    throw new ValidationError(\n      `comparePairedArms: non-finite value for metric '${name}' on pairKey '${row.pairKey}' (arm '${row.arm}'): ${v}`,\n    )\n  }\n  return v\n}\n"],"mappings":";;;;;;AA6BA,MAAM,SAAS,QACb,KAAK,UAAU;CAAC,IAAI;CAAK,IAAI;CAAS,IAAI,UAAU;AAAI,CAAC;AAC3D,SAAS,cAAc,KAA0B;CAC/C,KAAK,MAAM,SAAS;EAAC,IAAI;EAAK,IAAI;EAAS,GAAI,IAAI,WAAW,KAAA,IAAY,CAAC,IAAI,CAAC,IAAI,MAAM;CAAE,GAC1F,IAAI,OAAO,UAAU,YAAY,CAAC,MAAM,KAAK,GAC3C,MAAM,IAAI,UAAU,6CAA6C;CAErE,IAAI,IAAI,cAAc,KAAA,GAAW;EAC/B,IAAI,CAAC,MAAM,QAAQ,IAAI,SAAS,GAAG,MAAM,IAAI,UAAU,gCAAgC;EACvF,KAAK,MAAM,SAAS,IAAI,WAAW,uBAAuB,MAAM,KAAK;EACrE,IAAI,IAAI,IAAI,IAAI,UAAU,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,UAAU,QACjE,MAAM,IAAI,UAAU,4BAA4B;CACpD;AACF;AACA,SAAS,iBAAiB,KAAyB;CACjD,cAAc,GAAG;CACjB,IAAI,IAAI,QAAQ,QAAQ,OAAO,IAAI,SAAS,WAC1C,MAAM,IAAI,UAAU,wBAAwB;CAC9C,IAAI,IAAI,cAAc,KAAA,GAAW;EAC/B,IAAI,IAAI,cAAc,QAAQ,OAAO,IAAI,cAAc,UACrD,MAAM,IAAI,UAAU,2BAA2B;EACjD,IAAI,IAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,UAAU,WAAW,WACnE,MAAM,IAAI,UAAU,yBAAyB;EAC/C,IAAI,IAAI,UAAU,WAAW,KAAA,KAAa,OAAO,IAAI,UAAU,WAAW,UACxE,MAAM,IAAI,UAAU,0BAA0B;CAClD;CACA,KAAK,MAAM,SAAS,OAAO,OAAO,IAAI,WAAW,CAAC,CAAC,GACjD,IAAI,UAAU,QAAQ,CAAC,OAAO,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,uBAAuB;AAE9F;;AAGA,SAAgB,sBACd,cACA,aACA,SAC4D;CAC5D,MAAM,OAAO,CAAC,QAAQ,aAAa,QAAQ,YAAY;CACvD,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,aAAa;EAC/B,IAAI,CAAC,KAAK,SAAS,MAAM,GAAG,GAAG;EAC/B,cAAc,KAAK;EACnB,MAAM,MAAM,MAAM,KAAK;EACvB,IAAI,OAAO,IAAI,GAAG,GAAG,MAAM,IAAI,UAAU,0BAA0B;EACnE,OAAO,IAAI,KAAK,gBAAgB,KAAK,CAAC;CACxC;CACA,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,QAAQ,GAAG,GACjD,MAAM,IAAI,UAAU,iCAAiC,IAAI,EAAE;CAC/D,MAAM,yBAAS,IAAI,IAA0B;CAC7C,KAAK,MAAM,OAAO,cAAc;EAC9B,IAAI,CAAC,KAAK,SAAS,IAAI,GAAG,GAAG;EAC7B,iBAAiB,GAAG;EACpB,MAAM,MAAM,MAAM,GAAG;EACrB,IAAI,CAAC,OAAO,IAAI,GAAG,GAAG,MAAM,IAAI,UAAU,gDAAgD;EAC1F,IAAI,OAAO,IAAI,GAAG,GAAG,MAAM,IAAI,UAAU,2BAA2B;EACpE,OAAO,IAAI,KAAK,GAAG;CACrB;CACA,MAAM,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAE;CAErF,MAAM,OAAO,QAAQ,KAAK,CAAC,KAAK,WAAW,OAAO,IAAI,GAAG,KAAK,KAAK;CACnE,MAAM,cACJ,QAAQ,eACR,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,OAAO,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;CAoBvF,OAAO;EAAE;EAAM,UAnBE,KAAK,KAAK,QAAQ;GACjC,MAAM,WAAW,QAAQ,QAAQ,GAAG,OAAO,EAAE,QAAQ,GAAG;GACxD,MAAM,aAAa,SAAS,KAAK,CAAC,SAAS,OAAO,IAAI,GAAG,CAAC;GAC1D,MAAM,WAAW,WAAW,QACzB,QAA6B,KAAK,WAAW,WAAW,IAC3D;GACA,OAAO;IACL;IACA,aAAa,SAAS,KAAK,GAAG,OAAO,CAAC;IACtC,qBAAqB,WAAW,QAAQ,MAAM,MAAM,KAAA,CAAS,CAAC,CAAC;IAC/D,WAAW;KACT,QAAQ,SAAS;KACjB,WAAW,WAAW,QAAQ,MAAM,GAAG,WAAW,WAAW,KAAK,CAAC,CAAC;KACpE,SAAS,WAAW,QAAQ,MAAM,GAAG,WAAW,UAAU,IAAI,CAAC,CAAC;IAClE;IACA,YAAY,UAAU,YAAY,WAAW;IAC7C,UAAU,UAAU,UAAU,WAAW;GAC3C;EACF,CACsB;CAAE;AAC1B;AAEA,SAAS,UACP,MACA,OACsB;CACtB,MAAM,SAAS,KAAK,QAAQ,MAAM,GAAG,SAAS,IAAI,CAAC,CAAC;CACpD,MAAM,SAAS,KAAK,QAAQ,MAAM,GAAG,SAAS,KAAK,CAAC,CAAC;CACrD,MAAM,kBAAkB,KAAK,SAAS,SAAS;CAC/C,MAAM,UAAU,OAAO,YACrB,MAAM,KAAK,SAAS;EAClB,MAAM,SAAS,KAAK,KAAK,MAAM,GAAG,UAAU,KAAK,CAAC,CAAC,QAAQ,MAAmB,KAAK,IAAI;EACvF,MAAM,MAAM,OAAO,SAAS,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAChE,OAAO,CACL,MACA;GACE,GAAG,OAAO;GACV,SAAS,KAAK,SAAS,OAAO;GAC9B;GACA,MAAM,QAAQ,OAAO,OAAO,MAAM,OAAO;EAC3C,CACF;CACF,CAAC,CACH;CACA,OAAO;EACL,GAAG,KAAK;EACR;EACA;EACA;EACA,UAAU,KAAK,UAAU,CAAC,kBAAkB,SAAS,KAAK,SAAS;EACnE;CACF;AACF;;;;;;;;;;AC1IA,SAAgB,UAAU,GAAmB;CAC3C,IAAI,MAAM,GAAG,OAAO;CAEpB,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,IAAI;CAEV,MAAM,SAAS,KAAK,IAAI,CAAC,IAAI,KAAK;CAClC,MAAM,IAAI,KAAK,IAAI,IAAI;CACvB,MAAM,iBAAiB,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC,SAAS,MAAM;CAEjG,OAAO,IAAI,IAAI,aAAa,IAAI,IAAI,aAAa;AACnD;;;;AC8BA,MAAM,gCAAgC;;AAEtC,MAAM,8BAA8B;;AAEpC,MAAM,uBAAuB;;AAE7B,MAAM,uBAAuB;;;;;;;;;;;;;AA2B7B,SAAgB,aACd,GACA,GACA,OAAwB,CAAC,GACN;CACnB,mBAAmB,gBAAgB,KAAK,CAAC;CACzC,mBAAmB,gBAAgB,KAAK,CAAC;CAEzC,MAAM,KAAK,EAAE;CACb,MAAM,KAAK,EAAE;CACb,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO;EAAE,GAAG;EAAG,IAAI;EAAG,GAAG;EAAG,QAAQ;EAAS,QAAQ;CAAE;CAEjF,MAAM,QAAQ,KAAK;CACnB,MAAM,WAAW,CACf,GAAG,EAAE,KAAK,OAAO;EAAE;EAAG,OAAO;CAAK,EAAE,GACpC,GAAG,EAAE,KAAK,OAAO;EAAE;EAAG,OAAO;CAAM,EAAE,CACvC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;CAE1B,MAAM,EAAE,UAAU,YAAY,oBAAoB,SAAS,KAAK,UAAU,MAAM,CAAC,CAAC;CAClF,IAAI,WAAW;CACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,IAAI,SAAS,EAAE,CAAE,OAAO,YAAY,SAAS;CAG/C,MAAM,KAAK,WAAY,MAAM,KAAK,KAAM;CACxC,MAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE;CAGnC,MAAM,UAAU,SAAS,KAAK,SAAS,KAAK,MAAM,OAAO,CAAC,CAAC;CAC3D,MAAM,mBAAmB,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE;CAClD,MAAM,YAAY,KAAK,IAAI,IAAI,EAAE;CACjC,MAAM,SAAS,QAAQ;CACvB,MAAM,YAAY,mBAAmB,SAAS,SAAS;CAEvD,MAAM,cAAc,oBAAoB,SAAS,SAAS;CAC1D,MAAM,SAAS,qBACb,gBACA,KAAK,UAAU,QACf,MAAM,GAAG,OAAO,MAChB,UAAU,UAAU,iCAClB,UAAU,QAAQ,6BACpB,aACA,GAAG,8BAA8B,eAAe,OAAO,EAAE,cACpD,4BAA4B,eAAe,OAAO,EAAE,aAC3D;CAEA,IAAI,WAAW,SAAS;EACtB,MAAM,EAAE,GAAG,WAAW,gBAAgB,SAAS,WAAW,QAAQ,gBAAgB;EAClF,OAAO;GAAE;GAAG;GAAI;GAAG;GAAQ;EAAO;CACpC;CAEA,IAAI,WAAW,cACb,OAAO;EACL;EACA;EACA,GAAG,oBAAoB,mBAAmB,GAAG,eAAe,IAAI,IAAI,OAAO,OAAO,CAAC;EACnF;EACA,QAAQ;CACV;CAGF,MAAM,eAAe,oBAAoB,gBAAgB,KAAK,YAAY;CAC1E,MAAM,MAAM,KAAK,SAAS,KAAA,IAAY,QAAQ,uBAAuB,GAAG,CAAC,CAAC,IAAI,QAAQ,KAAK,IAAI;CAC/F,IAAI,mBAAmB;CACvB,MAAM,OAAO,CAAC,GAAG,OAAO;CACxB,KAAK,IAAI,YAAY,GAAG,YAAY,cAAc,aAAa;EAC7D,IAAI,iBAAiB;EACrB,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,OAAO,IAAI,KAAK,MAAM,IAAI,KAAK,QAAQ,EAAE;GAC/C,MAAM,UAAU,KAAK;GACrB,KAAK,QAAQ,KAAK;GAClB,KAAK,KAAK;GACV,kBAAkB;EACpB;EACA,IACE,KAAK,IAAI,iBAAiB,aAAa,YAAY,KAAK,YAAY,MAAM,KAC1E,kBAEA;CAEJ;CACA,MAAM,SAAS,KAAK,IAAI,KAAK,eAAe,IAAI,WAAW;CAC3D,OAAO;EACL;EACA;EACA,GAAG,KAAK,KAAK,IAAI,qBAAqB,eAAe,IAAI,MAAM;EAC/D;EACA;CACF;AACF;;;;;;;;;;;;;;AA6BA,SAAgB,mBACd,QACA,OACA,OAAwB,CAAC,GACC;CAC1B,IAAI,OAAO,WAAW,MAAM,QAC1B,MAAM,IAAI,gBACR,6CAA6C,OAAO,OAAO,MAAM,MAAM,OAAO,EAChF;CAEF,mBAAmB,sBAAsB,UAAU,MAAM;CACzD,mBAAmB,sBAAsB,SAAS,KAAK;CAEvD,MAAM,QAAQ,OAAO,KAAK,GAAG,MAAM,MAAM,KAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,MAAM,CAAC;CACvE,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,GAAG,OAAO;EAAE,GAAG;EAAG,GAAG;EAAG,QAAQ;EAAS,QAAQ;EAAG,UAAU;CAAE;CAQ1E,MAAM,MAAM,KAAK,IAAI,MAAM,EAAG;CAC9B,MAAM,cAAc,MAAM,OAAO,MAAM,KAAK,IAAI,CAAC,MAAM,GAAG;CAC1D,KAAK,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,WAAW,aAAa;EACxE,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAI,CAAC,CAAC,CAAC;EAC5C,MAAM,WAAW,IAAI;EACrB,OAAO;GACL,GAAI,YAAY,IAAI,KAAM;GAC1B,GAAG,qBAAqB,UAAU,QAAQ;GAC1C,QAAQ;GACR,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,EAAE;GAChC,UAAU;EACZ;CACF;CAEA,MAAM,QAAQ,MAAM,KAAK,GAAG,OAAO;EAAE,KAAK,KAAK,IAAI,CAAC;EAAG;CAAE,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;CACzF,MAAM,EAAE,UAAU,YAAY,oBAAoB,MAAM,KAAK,UAAU,MAAM,GAAG,CAAC;CACjF,MAAM,QAAkB,IAAI,MAAM,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM,MAAM,EAAE,CAAE,KAAK,SAAS;CAE1D,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,MAAM,KAAM,GAAG,SAAS,MAAM;CAK9D,MAAM,UAAU,SAAS,KAAK,SAAS,KAAK,MAAM,OAAO,CAAC,CAAC;CAC3D,MAAM,mBAAmB,KAAK,IAAI,IAAI,QAAS,KAAK,IAAI,KAAM,CAAC;CAE/D,MAAM,cAAc,KAAK,IAAI,GAAG,MAAM,IAAI,EAAE;CAC5C,MAAM,SAAS,qBACb,sBACA,KAAK,UAAU,QACf,KAAK,EAAE,wBACP,KAAK,sBACL,aACA,GAAG,qBAAqB,sBAC1B;CAEA,IAAI,WAAW,SAAS;EACtB,MAAM,EAAE,GAAG,WAAW,iBAAiB,SAAS,gBAAgB;EAChE,OAAO;GAAE,GAAG;GAAO;GAAG;GAAQ;GAAQ,UAAU;EAAE;CACpD;CAEA,IAAI,WAAW,cAAc;EAC3B,MAAM,WAAY,KAAK,IAAI,MAAM,IAAI,IAAI,KAAM,KAAK,UAAU;EAC9D,OAAO;GACL,GAAG;GACH,GAAG,oBAAoB,mBAAmB,GAAG,KAAK,KAAK,QAAQ,CAAC;GAChE;GACA,QAAQ;GACR,UAAU;EACZ;CACF;CAEA,MAAM,eAAe,oBAAoB,sBAAsB,KAAK,YAAY;CAChF,MAAM,MAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK;CAC5C,MAAM,gBAAiB,KAAK,IAAI,KAAM;CACtC,IAAI,mBAAmB;CACvB,KAAK,IAAI,YAAY,GAAG,YAAY,cAAc,aAAa;EAC7D,IAAI,eAAe;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,IAAK,gBAAgB,QAAQ;EACrE,IAAI,KAAK,IAAI,eAAe,aAAa,KAAK,kBAAkB;CAClE;CACA,OAAO;EACL,GAAG;EACH,IAAI,IAAI,qBAAqB,eAAe;EAC5C;EACA,QAAQ,KAAK,IAAI,KAAK,eAAe,IAAI,WAAW;EACpD,UAAU;CACZ;AACF;;;;;;AAOA,SAAS,oBAAoB,QAAoE;CAC/F,MAAM,WAAW,IAAI,MAAc,OAAO,MAAM;CAChD,IAAI,UAAU;CACd,IAAI,IAAI;CACR,OAAO,IAAI,OAAO,QAAQ;EACxB,IAAI,IAAI;EACR,OAAO,IAAI,OAAO,UAAU,OAAO,OAAO,OAAO,IAAI;EACrD,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,SAAS,KAAK;EAC1C,MAAM,YAAY,IAAI;EACtB,IAAI,YAAY,GAAG,WAAW,aAAa,IAAI;EAC/C,IAAI;CACN;CACA,OAAO;EAAE;EAAU;CAAQ;AAC7B;AAEA,SAAS,qBACP,IACA,SACA,QACA,eACA,aACA,WACgB;CAChB,IAAI,YAAY,QAAQ,OAAO,gBAAgB,UAAU;CACzD,IAAI,YAAY,SAAS;EACvB,IAAI,eAAe,OAAO;EAC1B,MAAM,IAAI,gBACR,GAAG,GAAG,sCAAsC,OAAO,+BAC9C,UAAU,yFAEjB;CACF;CACA,IAAI,eACF,MAAM,IAAI,gBACR,GAAG,GAAG,sCAAsC,OAAO,+CACpC,kBAAkB,WAAW,EAAE,0HAEzC,UAAU,EACjB;CAEF,OAAO;AACT;AAEA,SAAS,oBAAoB,IAAY,cAA0C;CACjF,IAAI,iBAAiB,KAAA,GAAW,OAAO;CACvC,IAAI,CAAC,OAAO,UAAU,YAAY,KAAK,eAAe,GACpD,MAAM,IAAI,gBAAgB,GAAG,GAAG,iDAAiD,cAAc;CAEjG,OAAO;AACT;;AAGA,SAAS,oBAAoB,WAAmB,OAAuB;CACrE,IAAI,EAAE,QAAQ,IAAI,OAAO;CACzB,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,UAAU,KAAK,IAAI,GAAG,YAAY,EAAG,IAAI,KAAK,EAAE;AAC9E;;;;AAKA,SAAS,eAAe,IAAY,IAAY,OAAe,SAAyB;CACtF,IAAI,QAAQ,GAAG,OAAO;CACtB,MAAM,WAAa,KAAK,KAAM,MAAO,QAAQ,IAAI,WAAW,SAAS,QAAQ;CAC7E,OAAO,KAAK,KAAK,KAAK,IAAI,GAAG,QAAQ,CAAC;AACxC;AAEA,SAAS,UAAU,GAAW,GAAmB;CAC/C,OAAO,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC;AAC5D;AAEA,SAAS,kBAAkB,OAAuB;CAChD,OAAO,SAAS,QAAQ,UAAU,IAAI,MAAM,QAAQ,CAAC,IAAI,MAAM,cAAc,CAAC;AAChF;;;;;;;AAQA,SAAS,mBACP,cACA,WACkC;CAClC,MAAM,SAAS,aAAa,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC/D,IAAI,OAAO;CACX,KAAK,IAAI,SAAS,GAAG,SAAS,aAAa,QAAQ,UACjD,QAAQ,KAAK,IAAI,WAAW,SAAS,CAAC,KAAK,SAAS,aAAa,UAAW;CAE9E,OAAO;EACL,SAAS,YAAY,MAAM,SAAS;EACpC;CACF;AACF;;;;;;;;;AAUA,SAAS,oBAAoB,cAAiC,WAA2B;CACvF,MAAM,QAAQ,aAAa;CAC3B,MAAM,SAAS,QAAQ;CACvB,MAAM,aAAa,aAAa,MAAM,GAAG,SAAS,CAAC,CAAC,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CACvF,MAAM,aAAa,aAAa,MAAM,QAAQ,SAAS,CAAC,CAAC,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC5F,IAAI,eAAe,YAAY,OAAO;CAEtC,MAAM,SAAS,aAAa,YAAY,KAAK,YAAY;CACzD,MAAM,mBAAmB,KAAK,IAAI,aAAa,MAAM;CACrD,MAAM,mBAAmB,KAAK,IAAI,aAAa,MAAM;CACrD,MAAM,eAAe,UAAU,OAAO,SAAS;CAC/C,MAAM,cAAc,KAAK,IACvB,qBAAqB,cAAc,WAAW,SAAS,IAAI,YAC7D;CACA,MAAM,cAAc,KAAK,IACvB,qBAAqB,cAAc,WAAW,SAAS,IAAI,YAC7D;CAEA,IAAI,mBAAmB,kBAAkB,OAAO;CAChD,IAAI,mBAAmB,kBAAkB,OAAO;CAChD,OAAO,KAAK,IAAI,GAAG,cAAc,WAAW;AAC9C;AAEA,SAAS,qBACP,aACA,WACA,MACQ;CACR,MAAM,gBAAgB,SAAS,YAAY,YAAY,IAAI,YAAY,SAAS;CAChF,MAAM,WAAW,YAAY;CAC7B,IAAI,QAAQ;CACZ,IAAI,YAAY,gBAAgB;CAChC,OAAO,QAAQ,KAAK,YAAY,QAAQ,OAAO,UAAU;CACzD,OAAO,YAAY,YAAY,UAAU,YAAY,eAAe,UAAU;CAI9E,OAAO,UAFS,YAAY,OAEF,aADZ,SAAS,YAAY,QAAQ,YAAY,SAAS,UACrB;AAC7C;;;;;;;;;;;;;AAcA,SAAS,gBACP,cACA,IACA,IACA,kBAC+B;CAC/B,MAAM,SAAS,aAAa,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC/D,MAAM,QAAQ,SAAS;CAEvB,MAAM,OAAuB,MAAM,KAAK,EAAE,QAAQ,KAAK,EAAE,SAAS,IAAI,aAAa,KAAK,CAAC;CACzF,KAAK,EAAE,CAAE,KAAK;CACd,IAAI,SAAS;CACb,KAAK,MAAM,QAAQ,cAAc;EAC/B,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,GAAG,KAAK;GAClD,MAAM,OAAO,KAAK,IAAI;GACtB,MAAM,OAAO,KAAK;GAClB,KAAK,IAAI,MAAM,SAAS,MAAM,OAAO,GAAG,OAAO;IAC7C,MAAM,QAAQ,KAAK;IACnB,IAAI,UAAU,GAAG,KAAK,MAAM,SAAU;GACxC;EACF;EACA;CACF;CAIA,MAAM,QAAQ,MAAM,KAAK,KAAK,KAAK;CACnC,MAAM,SAAS,KAAK;CACpB,IAAI,YAAY;CAChB,IAAI,cAAc;CAClB,IAAI,WAAW;CACf,IAAI,eAAe;CACnB,KAAK,IAAI,MAAM,GAAG,MAAM,OAAO,OAAO;EACpC,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,GAAG;EACjB,aAAa;EACb,MAAM,YAAY,KAAK,IAAI,MAAM,KAAK;EACtC,IAAI,aAAa,kBAAkB,YAAY;EAC/C,IAAI,YAAY,cAAc;GAC5B,eAAe;GACf,cAAc;EAChB,OAAO,IAAI,cAAc,cACvB,eAAe;CAEnB;CACA,OAAO;EAAE,GAAG,WAAW;EAAW,QAAQ,cAAc;CAAU;AACpE;;;;;;;;AASA,SAAS,iBACP,cACA,kBAC+B;CAC/B,MAAM,SAAS,aAAa,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC/D,MAAM,QAAQ,SAAS;CACvB,IAAI,OAAO,IAAI,aAAa,KAAK;CACjC,KAAK,KAAK;CACV,KAAK,MAAM,QAAQ,cAAc;EAC/B,MAAM,OAAO,IAAI,aAAa,KAAK;EACnC,KAAK,IAAI,MAAM,GAAG,MAAM,OAAO,OAAO;GACpC,MAAM,cAAc,KAAK;GACzB,IAAI,gBAAgB,GAAG;GACvB,KAAK,QAAS,cAAc;GAC5B,KAAK,MAAM,SAAU,cAAc;EACrC;EACA,OAAO;CACT;CAEA,MAAM,SAAS,SAAS;CACxB,IAAI,OAAO;CACX,IAAI,UAAU;CACd,IAAI,eAAe;CACnB,KAAK,IAAI,MAAM,GAAG,MAAM,OAAO,OAAO;EACpC,MAAM,cAAc,KAAK;EACzB,IAAI,gBAAgB,GAAG;EACvB,MAAM,YAAY,KAAK,IAAI,MAAM,MAAM;EACvC,IAAI,aAAa,kBAAkB,QAAQ;EAC3C,IAAI,YAAY,cAAc;GAC5B,eAAe;GACf,UAAU;EACZ,OAAO,IAAI,cAAc,cACvB,WAAW;CAEf;CACA,OAAO;EAAE,GAAG,KAAK,IAAI,GAAG,IAAI;EAAG,QAAQ,KAAK,IAAI,GAAG,OAAO;CAAE;AAC9D;;;;;;;;;;;;;;;;;;;;;ACrbA,SAAgB,SAAS,MAA+B,MAAuC;CAC7F,MAAM,EAAE,aAAa,iBAAiB;CACtC,IAAI,gBAAgB,cAClB,MAAM,IAAI,gBACR,oDAAoD,YAAY,wCAClE;CAIF,MAAM,wBAAQ,IAAI,IAAyC;CAC3D,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,OAAO,MAAM;EACtB,SAAS,IAAI,IAAI,GAAG;EACpB,IAAI,IAAI,QAAQ,eAAe,IAAI,QAAQ,cAAc;EACzD,MAAM,QAAQ,MAAM,IAAI,IAAI,GAAG,qBAAK,IAAI,IAA4B;EACpE,MAAM,QAAQ,MAAM,IAAI,IAAI,OAAO,KAAK,CAAC;EACzC,MAAM,KAAK,GAAG;EACd,MAAM,IAAI,IAAI,SAAS,KAAK;EAC5B,MAAM,IAAI,IAAI,KAAK,KAAK;CAC1B;CAEA,KAAK,MAAM,OAAO,CAAC,aAAa,YAAY,GAC1C,IAAI,CAAC,MAAM,IAAI,GAAG,GAAG;EACnB,MAAM,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,KAAK;EAChD,MAAM,IAAI,gBAAgB,8BAA8B,IAAI,mBAAmB,KAAK,EAAE;CACxF;CAGF,MAAM,gBAAgB,MAAM,IAAI,WAAW;CAC3C,MAAM,iBAAiB,MAAM,IAAI,YAAY;CAE7C,MAAM,UAAU,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,cAAc,KAAK,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;CACvF,MAAM,QAAuB,CAAC;CAC9B,MAAM,mBAAmC,CAAC;CAC1C,MAAM,oBAAoC,CAAC;CAC3C,KAAK,MAAM,WAAW,SAAS;EAC7B,MAAM,IAAI,cAAc,IAAI,OAAO,KAAK,CAAC;EACzC,MAAM,IAAI,eAAe,IAAI,OAAO,KAAK,CAAC;EAE1C,IAAI,EAAE,UAAU,KAAK,EAAE,UAAU,GAAG;GAClC,IAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;IACpC,MAAM,WAAW,EAAE;IACnB,MAAM,YAAY,EAAE;IACpB,IAAI,SAAS,WAAW,KAAA,KAAa,UAAU,WAAW,KAAA,GAEtD;SAAA,SAAS,WAAW,KAAA,KACpB,UAAU,WAAW,KAAA,KACrB,SAAS,WAAW,UAAU,QAC9B;MACA,iBAAiB,KAAK,QAAQ;MAC9B,kBAAkB,KAAK,SAAS;MAChC;KACF;;IAEF,MAAM,KAAK;KAAE;KAAS,UAAU;KAAG;KAAU;IAAU,CAAC;GAC1D,OAAO;IACL,iBAAiB,KAAK,GAAG,CAAC;IAC1B,kBAAkB,KAAK,GAAG,CAAC;GAC7B;GACA;EACF;EAEA,MAAM,SAAS,cAAc,GAAG,SAAS,WAAW;EACpD,MAAM,SAAS,cAAc,GAAG,SAAS,YAAY;EACrD,MAAM,UAAU,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;EACxE,IAAI,WAAW;EACf,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,WAAW,OAAO,IAAI,MAAM;GAClC,MAAM,YAAY,OAAO,IAAI,MAAM;GACnC,IAAI,aAAa,KAAA,KAAa,cAAc,KAAA,GAC1C,MAAM,KAAK;IAAE;IAAS,UAAU;IAAY;IAAU;GAAU,CAAC;QAC5D,IAAI,aAAa,KAAA,GACtB,iBAAiB,KAAK,QAAQ;QACzB,IAAI,cAAc,KAAA,GACvB,kBAAkB,KAAK,SAAS;EAEpC;CACF;CAEA,OAAO;EAAE;EAAO;EAAkB;CAAkB;AACtD;;;AAIA,SAAS,cACP,OACA,SACA,KAC2B;CAC3B,MAAM,wBAAQ,IAAI,IAA0B;CAC5C,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,IAAI,WAAW,KAAA,GACjB,MAAM,IAAI,gBACR,sBAAsB,QAAQ,mDAAmD,IAAI,8KAGvF;EAEF,IAAI,MAAM,IAAI,IAAI,MAAM,GACtB,MAAM,IAAI,gBACR,+BAA+B,IAAI,OAAO,iBAAiB,QAAQ,YAAY,IAAI,iEAErF;EAEF,MAAM,IAAI,IAAI,QAAQ,GAAG;CAC3B;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;AAwEA,SAAgB,kBACd,MACA,MACsB;CACtB,MAAM,cACJ,KAAK,gBAAgB,KAAA,IAAY,KAAA,IAAY,sBAAsB,MAAM,KAAK,aAAa,IAAI;CACjG,MAAM,EAAE,OAAO,kBAAkB,sBAAsB,SAAS,aAAa,QAAQ,MAAM,IAAI;CAE/F,IAAI,cAAwC;CAC5C,MAAM,eAAyB,CAAC;CAChC,MAAM,gBAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,UAAU,QAAQ,MAAM;EAC/D,aAAa,KAAK,KAAK,SAAS,OAAO,IAAI,CAAC;EAC5C,cAAc,KAAK,KAAK,UAAU,OAAO,IAAI,CAAC;CAChD;CACA,IAAI,aAAa,SAAS,GAAG;EAC3B,MAAM,KAAK,QAAQ,cAAc,aAAa;EAC9C,cAAc;GACZ,KAAK,GAAG;GACR,KAAK,GAAG;GACR,SAAS;GACT,gBAAgB,qBAAqB,cAAc,aAAa;EAClE;CACF;CAaA,MAAM,gBAVJ,KAAK,eACL,CACE,GAAG,IAAI,IACL,MAAM,SAAS,MAAM,CACnB,GAAG,OAAO,KAAK,EAAE,SAAS,WAAW,CAAC,CAAC,GACvC,GAAG,OAAO,KAAK,EAAE,UAAU,WAAW,CAAC,CAAC,CAC1C,CAAC,CACH,CACF,CAAC,CAAC,KAAK,EAAA,CAE6C,KAAK,SAAS;EAClE,MAAM,SAAmB,CAAC;EAC1B,MAAM,QAAkB,CAAC;EACzB,IAAI,WAAW;EACf,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,IAAI,YAAY,KAAK,UAAU,IAAI;GACzC,MAAM,IAAI,YAAY,KAAK,WAAW,IAAI;GAC1C,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAAW;IACtC;IACA;GACF;GACA,OAAO,KAAK,CAAC;GACb,MAAM,KAAK,CAAC;EACd;EACA,MAAM,cAAc,OAAO,WAAW,IAAI,OAAO,gBAAgB,QAAQ,OAAO,KAAK,SAAS;EAC9F,OAAO;GACL;GACA,GAAG,OAAO;GACV;GACA,aAAa,aAAa,UAAU;GACpC,WAAW,aAAa,QAAQ;GAChC;GACA,UAAU,OAAO,WAAW,IAAI,OAAO,mBAAmB,QAAQ,KAAK;EACzE;CACF,CAAC;CAED,OAAO;EACL,GAAI,cAAc,EAAE,gBAAgB,YAAY,SAAS,IAAI,CAAC;EAC9D,QAAQ,MAAM;EACd,mBAAmB,iBAAiB;EACpC,oBAAoB,kBAAkB;EACtC;EACA;CACF;AACF;;;;;;;;AA2BA,SAAgB,eACd,cACA,eACsB;CACtB,MAAM,eAAe,iBAAiB,cAAc,UAAU;CAC9D,MAAM,gBAAgB,iBAAiB,eAAe,WAAW;CACjE,yBAAyB,cAAc,UAAU;CACjD,yBAAyB,eAAe,WAAW;CACnD,IAAI,aAAa,WAAW,KAAK,cAAc,WAAW,GACxD,OAAO;EACL,OAAO,CAAC;EACR,kBAAkB,aAAa,KAAK,QAAQ,IAAI,GAAG;EACnD,mBAAmB,cAAc,KAAK,QAAQ,IAAI,GAAG;CACvD;CAGF,MAAM,SAAS,SAAS,CAAC,GAAG,cAAc,GAAG,aAAa,GAAG;EAC3D,aAAa;EACb,cAAc;CAChB,CAAC;CACD,OAAO;EACL,OAAO,OAAO,MAAM,KAAK,SAAS;GAChC,MAAM,WAAW,KAAK;GACtB,MAAM,YAAY,KAAK;GACvB,OAAO;IACL,SAAS,KAAK;IACd,QAAQ,SAAS;IACjB,UAAU,SAAS;IACnB,WAAW,UAAU;GACvB;EACF,CAAC;EACD,kBAAkB,OAAO,iBAAiB,KAAK,QAAS,IAAwB,GAAG;EACnF,mBAAmB,OAAO,kBAAkB,KAAK,QAAS,IAAwB,GAAG;CACvF;AACF;AAEA,SAAS,iBAAiB,MAA4B,KAAgC;CACpF,OAAO,KAAK,KAAK,QAAQ;EACvB,MAAM,aAAa,IAAI,WAAW,KAAK;EACvC,IAAI,CAAC,YACH,MAAM,IAAI,gBACR,wBAAwB,IAAI,MAAM,+EACpC;EAEF,OAAO;GACL,SAAS,KAAK,UAAU,CAAC,IAAI,cAAc,UAAU,CAAC;GACtD,QAAQ,OAAO,IAAI,IAAI;GACvB;GACA;EACF;CACF,CAAC;AACH;AAEA,SAAS,yBAAyB,MAAkC,KAAmB;CACrF,MAAM,4BAAY,IAAI,IAA+B;CACrD,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,UAAU,IAAI,IAAI,OAAO,KAAK,CAAC;EAC7C,MAAM,KAAK,GAAG;EACd,UAAU,IAAI,IAAI,SAAS,KAAK;CAClC;CACA,KAAK,MAAM,CAAC,SAAS,UAAU,WAC7B,IAAI,MAAM,SAAS,GAAG,cAAc,OAAO,SAAS,GAAG;AAE3D;AAEA,SAAS,YAAY,KAAmB,MAAkC;CACxE,MAAM,IAAI,IAAI,UAAU;CACxB,IAAI,KAAK,MAAM,OAAO,KAAA;CACtB,IAAI,CAAC,OAAO,SAAS,CAAC,GACpB,MAAM,IAAI,gBACR,mDAAmD,KAAK,gBAAgB,IAAI,QAAQ,UAAU,IAAI,IAAI,MAAM,GAC9G;CAEF,OAAO;AACT"}
+{"version":3,"file":"paired-arms-D-54hO-k.js","names":[],"sources":["../src/arm-populations.ts","../src/math/normal.ts","../src/statistics/rank-tests.ts","../src/paired-arms.ts"],"sourcesContent":["import type { FindingTreatment } from './analyst/finding-composition'\nimport { findingTreatmentSchema } from './analyst/finding-composition'\nimport type { PairedArmRow } from './paired-arms'\n\n/** Expected seed identities must be supplied independently of completed observations. */\nexport interface ArmAssignment {\n  pairKey: string\n  repKey?: string\n  arm: string\n  treatment?: FindingTreatment[]\n}\nexport interface ArmPopulationSummary {\n  n: number\n  passed: number\n  failed: number\n  missingOutcomes: number\n  /** Unknown unless every unit's outcome was observed; missing is never a failed check. */\n  passRate: number | null\n  metrics: Record<string, { n: number; missing: number; sum: number | null; mean: number | null }>\n}\nexport interface ArmPopulationReading {\n  arm: string\n  assignments: ArmAssignment[]\n  missingObservations: number\n  formation: { formed: number; notFormed: number; unknown: number }\n  asAssigned: ArmPopulationSummary\n  asFormed: ArmPopulationSummary\n}\n\nconst keyOf = (row: ArmAssignment): string =>\n  JSON.stringify([row.arm, row.pairKey, row.repKey ?? null])\nfunction checkIdentity(row: ArmAssignment): void {\n  for (const value of [row.arm, row.pairKey, ...(row.repKey === undefined ? [] : [row.repKey])]) {\n    if (typeof value !== 'string' || !value.trim())\n      throw new TypeError('Arm assignments require nonempty identities')\n  }\n  if (row.treatment !== undefined) {\n    if (!Array.isArray(row.treatment)) throw new TypeError('Arm treatment must be an array')\n    for (const value of row.treatment) findingTreatmentSchema.parse(value)\n    if (new Set(row.treatment.map((t) => t.id)).size !== row.treatment.length)\n      throw new TypeError('Duplicate arm treatment id')\n  }\n}\nfunction checkObservation(row: PairedArmRow): void {\n  checkIdentity(row)\n  if (row.pass != null && typeof row.pass !== 'boolean')\n    throw new TypeError('Invalid arm pass value')\n  if (row.formation !== undefined) {\n    if (row.formation === null || typeof row.formation !== 'object')\n      throw new TypeError('Invalid formation verdict')\n    if (row.formation.formed !== null && typeof row.formation.formed !== 'boolean')\n      throw new TypeError('Invalid formation state')\n    if (row.formation.reason !== undefined && typeof row.formation.reason !== 'string')\n      throw new TypeError('Invalid formation reason')\n  }\n  for (const value of Object.values(row.metrics ?? {})) {\n    if (value !== null && !Number.isFinite(value)) throw new TypeError('Non-finite arm metric')\n  }\n}\n\n/** One roster join serves comparison and both denominators; no outcomes are inferred from formation. */\nexport function prepareArmPopulations(\n  observations: readonly PairedArmRow[],\n  assignments: readonly ArmAssignment[],\n  options: { baselineArm: string; treatmentArm: string; metricNames?: string[] },\n): { rows: PairedArmRow[]; readings: ArmPopulationReading[] } {\n  const arms = [options.baselineArm, options.treatmentArm]\n  const roster = new Map<string, ArmAssignment>()\n  for (const entry of assignments) {\n    if (!arms.includes(entry.arm)) continue\n    checkIdentity(entry)\n    const key = keyOf(entry)\n    if (roster.has(key)) throw new TypeError('Duplicate arm assignment')\n    roster.set(key, structuredClone(entry))\n  }\n  for (const arm of arms)\n    if (![...roster.values()].some((r) => r.arm === arm))\n      throw new TypeError(`No assignment roster for arm '${arm}'`)\n  const actual = new Map<string, PairedArmRow>()\n  for (const row of observations) {\n    if (!arms.includes(row.arm)) continue\n    checkObservation(row)\n    const key = keyOf(row)\n    if (!roster.has(key)) throw new TypeError('Observed seed is outside the assignment roster')\n    if (actual.has(key)) throw new TypeError('Duplicate arm observation')\n    actual.set(key, row)\n  }\n  const ordered = [...roster.entries()].sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n  // Placeholder rows carry identities only. They never manufacture pass, metrics or formation.\n  const rows = ordered.map(([key, entry]) => actual.get(key) ?? entry)\n  const metricNames =\n    options.metricNames ??\n    [...new Set([...actual.values()].flatMap((r) => Object.keys(r.metrics ?? {})))].sort()\n  const readings = arms.map((arm) => {\n    const declared = ordered.filter(([, r]) => r.arm === arm)\n    const asAssigned = declared.map(([key]) => actual.get(key))\n    const asFormed = asAssigned.filter(\n      (row): row is PairedArmRow => row?.formation?.formed === true,\n    )\n    return {\n      arm,\n      assignments: declared.map(([, r]) => r),\n      missingObservations: asAssigned.filter((r) => r === undefined).length,\n      formation: {\n        formed: asFormed.length,\n        notFormed: asAssigned.filter((r) => r?.formation?.formed === false).length,\n        unknown: asAssigned.filter((r) => r?.formation?.formed == null).length,\n      },\n      asAssigned: summarize(asAssigned, metricNames),\n      asFormed: summarize(asFormed, metricNames),\n    }\n  })\n  return { rows, readings }\n}\n\nfunction summarize(\n  rows: readonly (PairedArmRow | undefined)[],\n  names: readonly string[],\n): ArmPopulationSummary {\n  const passed = rows.filter((r) => r?.pass === true).length\n  const failed = rows.filter((r) => r?.pass === false).length\n  const missingOutcomes = rows.length - passed - failed\n  const metrics = Object.fromEntries(\n    names.map((name) => {\n      const values = rows.map((r) => r?.metrics?.[name]).filter((x): x is number => x != null)\n      const sum = values.length ? values.reduce((s, v) => s + v, 0) : null\n      return [\n        name,\n        {\n          n: values.length,\n          missing: rows.length - values.length,\n          sum,\n          mean: sum === null ? null : sum / values.length,\n        },\n      ]\n    }),\n  )\n  return {\n    n: rows.length,\n    passed,\n    failed,\n    missingOutcomes,\n    passRate: rows.length && !missingOutcomes ? passed / rows.length : null,\n    metrics,\n  }\n}\n","/**\n * Standard normal cumulative distribution using Abramowitz and Stegun 7.1.26.\n *\n * The approximation is evaluated as erf(x / sqrt(2)). Computing the negative\n * tail from the complementary term avoids cancellation when x is far below 0.\n * The maximum absolute CDF error is approximately 7.5e-8.\n */\nexport function normalCdf(x: number): number {\n  if (x === 0) return 0.5\n\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 scaled = Math.abs(x) / Math.SQRT2\n  const t = 1 / (1 + p * scaled)\n  const complement = ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp(-scaled * scaled)\n\n  return x < 0 ? complement / 2 : 1 - complement / 2\n}\n","import { ValidationError } from '../errors'\nimport { normalCdf } from '../math/normal'\nimport { lnGamma } from '../math/special-functions'\nimport {\n  assertFiniteSample,\n  binomialSignTwoSided,\n  makeRng,\n  symmetricTwoSampleSeed,\n} from './internal'\n\n// ── Rank tests: exact by default ─────────────────────────────────────\n//\n// At 3–10 repetitions per arm the binding constraint on a rank test is\n// combinatorial, not numerical. Three versus three admits only 20 splits, so\n// the attainable two-sided p-grid starts at 0.1000 and α = 0.05 is out of\n// reach at that design; a normal approximation reports 0.0495, a p-value that\n// describes no attainable outcome. No better approximation fixes this — adding\n// the tie correction moves `[0,0,0]` versus `[1,1,1]` from 0.0495 to 0.0469,\n// further from its exact 0.1000, not closer.\n//\n// So both null distributions are enumerated exactly inside bounded state and\n// work budgets, by convolution over the observed midranks (identical to\n// enumerating every split / sign pattern, and cheaper), which conditions on the\n// realised tie pattern for free. Above those budgets the default is a seeded\n// Monte Carlo permutation. The asymptotic path is never chosen automatically,\n// and asking for it inside the exact-feasible range throws.\n//\n// Every result carries `method` and `pFloor` so a downstream gate can SEE the\n// discreteness rather than infer it: a gate handed data whose `pFloor` exceeds\n// its alpha is underpowered by construction, which is a true statement about\n// the experiment, not a false one about the effect.\n\n/** How a rank test's p-value was actually computed. */\nexport type RankTestMethod = 'exact' | 'permutation' | 'asymptotic'\n\n/**\n * What the caller asks for. `'auto'` selects `'exact'` inside the enumeration\n * threshold and `'permutation'` above it, and never selects `'asymptotic'`.\n */\nexport type RankTestMethodRequest = 'auto' | 'exact' | 'asymptotic'\n\nexport interface RankTestOptions {\n  /** Default `'auto'`. `'asymptotic'` inside the exact-feasible range throws. */\n  method?: RankTestMethodRequest\n  /** Resamples on the Monte Carlo permutation path. Default 100000. */\n  permutations?: number\n  /** Seed for the permutation path. Omitted ⇒ derived from the data itself, so\n   *  the result is reproducible either way. */\n  seed?: number\n}\n\n/** Maximum dynamic-programming cells used by an exact two-sample rank test. */\nconst MANN_WHITNEY_EXACT_MAX_STATES = 8_192\n/** Maximum inner-loop transitions used by an exact two-sample rank test. */\nconst MANN_WHITNEY_EXACT_MAX_WORK = 250_000\n/** Non-zero differences up to which the signed-rank null is enumerated exactly. */\nconst WILCOXON_EXACT_MAX_N = 20\n/** Resamples used when a rank test falls back to Monte Carlo permutation. */\nconst DEFAULT_PERMUTATIONS = 100_000\n\nexport interface MannWhitneyResult {\n  /** `min(U_a, U_b)` — the conventional reported statistic. */\n  u: number\n  /** U for sample `a`. Carries the direction of the effect, which `u` discards. */\n  uA: number\n  /** Two-sided p-value. */\n  p: number\n  /** How `p` was computed. */\n  method: RankTestMethod\n  /** Smallest two-sided p this design can produce. `p` can never be below it. */\n  pFloor: number\n}\n\n/**\n * Mann-Whitney U — two independent samples, no distributional assumption.\n *\n * Exact conditional (permutation) p by default when the dynamic program fits\n * {@link MANN_WHITNEY_EXACT_MAX_STATES} cells and\n * {@link MANN_WHITNEY_EXACT_MAX_WORK} transitions, seeded Monte Carlo\n * permutation above those limits. This keeps imbalanced designs such as 1+24\n * exact without admitting expensive balanced designs merely because they have\n * the same total size. Throws on non-finite input and on `method:\n * 'asymptotic'` where an exact answer is available. Empty input yields `p = 1,\n * pFloor = 1` — no design, no attainable evidence.\n */\nexport function mannWhitneyU(\n  a: number[],\n  b: number[],\n  opts: RankTestOptions = {},\n): MannWhitneyResult {\n  assertFiniteSample('mannWhitneyU', 'a', a)\n  assertFiniteSample('mannWhitneyU', 'b', b)\n\n  const n1 = a.length\n  const n2 = b.length\n  if (n1 === 0 || n2 === 0) return { u: 0, uA: 0, p: 1, method: 'exact', pFloor: 1 }\n\n  const total = n1 + n2\n  const combined = [\n    ...a.map((v) => ({ v, fromA: true })),\n    ...b.map((v) => ({ v, fromA: false })),\n  ].sort((x, y) => x.v - y.v)\n\n  const { midranks, tieTerm } = midranksWithTieTerm(combined.map((entry) => entry.v))\n  let rankSumA = 0\n  for (let k = 0; k < total; k++) {\n    if (combined[k]!.fromA) rankSumA += midranks[k]!\n  }\n\n  const uA = rankSumA - (n1 * (n1 + 1)) / 2\n  const u = Math.min(uA, n1 * n2 - uA)\n  // Midranks are integers or halves, so doubling makes the null convolution\n  // integral. U is centred on n₁n₂/2, hence a doubled centre of n₁n₂.\n  const doubled = midranks.map((rank) => Math.round(rank * 2))\n  const doubledDeviation = Math.abs(2 * uA - n1 * n2)\n  const selectedN = Math.min(n1, n2)\n  const otherN = total - selectedN\n  const exactCost = exactTwoSampleCost(doubled, selectedN)\n\n  const designFloor = exactTwoSampleFloor(doubled, selectedN)\n  const method = selectRankTestMethod(\n    'mannWhitneyU',\n    opts.method ?? 'auto',\n    `n1=${n1}, n2=${n2}`,\n    exactCost.states <= MANN_WHITNEY_EXACT_MAX_STATES &&\n      exactCost.work <= MANN_WHITNEY_EXACT_MAX_WORK,\n    designFloor,\n    `${MANN_WHITNEY_EXACT_MAX_STATES.toLocaleString('en-US')} states and ` +\n      `${MANN_WHITNEY_EXACT_MAX_WORK.toLocaleString('en-US')} transitions`,\n  )\n\n  if (method === 'exact') {\n    const { p, pFloor } = exactTwoSampleP(doubled, selectedN, otherN, doubledDeviation)\n    return { u, uA, p, method, pFloor }\n  }\n\n  if (method === 'asymptotic') {\n    return {\n      u,\n      uA,\n      p: asymptoticTwoSidedP(doubledDeviation / 2, twoSampleSigma(n1, n2, total, tieTerm)),\n      method,\n      pFloor: designFloor,\n    }\n  }\n\n  const permutations = resolvePermutations('mannWhitneyU', opts.permutations)\n  const rng = opts.seed === undefined ? makeRng(symmetricTwoSampleSeed(a, b)) : makeRng(opts.seed)\n  let atLeastAsExtreme = 0\n  const pool = [...doubled]\n  for (let iteration = 0; iteration < permutations; iteration++) {\n    let doubledRankSum = 0\n    for (let k = 0; k < selectedN; k++) {\n      const pick = k + Math.floor(rng() * (total - k))\n      const swapped = pool[pick]!\n      pool[pick] = pool[k]!\n      pool[k] = swapped\n      doubledRankSum += swapped\n    }\n    if (\n      Math.abs(doubledRankSum - selectedN * (selectedN + 1) - selectedN * otherN) >=\n      doubledDeviation\n    ) {\n      atLeastAsExtreme++\n    }\n  }\n  const pFloor = Math.max(1 / (permutations + 1), designFloor)\n  return {\n    u,\n    uA,\n    p: Math.max((1 + atLeastAsExtreme) / (permutations + 1), pFloor),\n    method,\n    pFloor,\n  }\n}\n\nexport interface WilcoxonSignedRankResult {\n  /** W⁺, the rank sum of the positive differences. (scipy reports\n   *  `min(W⁺, W⁻)`; compare statistics only after converting.) */\n  w: number\n  /** Two-sided p-value. */\n  p: number\n  /** How `p` was computed. */\n  method: RankTestMethod\n  /** Smallest two-sided p this design can produce. */\n  pFloor: number\n  /** Non-zero differences — zero differences are dropped and carry no rank. */\n  nNonZero: number\n}\n\n/**\n * Wilcoxon signed-rank — paired, no distributional assumption on the deltas.\n *\n * Exact conditional (sign-flip) p by default at `n ≤\n * {@link WILCOXON_EXACT_MAX_N}` non-zero differences, seeded Monte Carlo\n * permutation above it. Throws on non-finite input and on `method:\n * 'asymptotic'` where an exact answer is available.\n *\n * `n` is the count of NON-ZERO differences: exact ties are dropped before\n * ranking, so a run of tied pairs shrinks the design and raises `pFloor`.\n * All-tied input yields `p = 1, pFloor = 1` — no attainable evidence, which\n * `pFloor` states rather than leaving `p = 1` to be read as a measured null.\n */\nexport function wilcoxonSignedRank(\n  before: number[],\n  after: number[],\n  opts: RankTestOptions = {},\n): WilcoxonSignedRankResult {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `wilcoxonSignedRank: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  assertFiniteSample('wilcoxonSignedRank', 'before', before)\n  assertFiniteSample('wilcoxonSignedRank', 'after', after)\n\n  const diffs = before.map((b, i) => after[i]! - b).filter((d) => d !== 0)\n  const n = diffs.length\n  if (n === 0) return { w: 0, p: 1, method: 'exact', pFloor: 1, nNonZero: 0 }\n\n  // When every non-zero difference has the same magnitude, the signed-rank\n  // null reduces exactly to a binomial sign distribution. This is the common\n  // pass/fail shape ({-1, 0, +1}); recognizing it avoids a 100k-draw\n  // permutation for every repeated gate evaluation while preserving the exact\n  // p-value and attainable floor. Explicit method requests still retain their\n  // documented behavior.\n  const abs = Math.abs(diffs[0]!)\n  const allEqualAbs = diffs.every((d) => Math.abs(d) === abs)\n  if ((opts.method === undefined || opts.method === 'auto') && allEqualAbs) {\n    const positive = diffs.filter((d) => d > 0).length\n    const negative = n - positive\n    return {\n      w: (positive * (n + 1)) / 2,\n      p: binomialSignTwoSided(positive, negative),\n      method: 'exact',\n      pFloor: Math.min(1, 2 ** (1 - n)),\n      nNonZero: n,\n    }\n  }\n\n  const order = diffs.map((d, i) => ({ abs: Math.abs(d), i })).sort((x, y) => x.abs - y.abs)\n  const { midranks, tieTerm } = midranksWithTieTerm(order.map((entry) => entry.abs))\n  const ranks: number[] = new Array(n)\n  for (let k = 0; k < n; k++) ranks[order[k]!.i] = midranks[k]!\n\n  let wPlus = 0\n  for (let k = 0; k < n; k++) if (diffs[k]! > 0) wPlus += ranks[k]!\n\n  // Midranks are integers or halves; doubling makes the convolution integral.\n  // Σ midranks = n(n+1)/2 whatever the tie pattern, so E[W⁺] = n(n+1)/4 and\n  // the doubled centre is n(n+1)/2.\n  const doubled = midranks.map((rank) => Math.round(rank * 2))\n  const doubledDeviation = Math.abs(2 * wPlus - (n * (n + 1)) / 2)\n\n  const designFloor = Math.min(1, 2 ** (1 - n))\n  const method = selectRankTestMethod(\n    'wilcoxonSignedRank',\n    opts.method ?? 'auto',\n    `n=${n} non-zero differences`,\n    n <= WILCOXON_EXACT_MAX_N,\n    designFloor,\n    `${WILCOXON_EXACT_MAX_N} non-zero differences`,\n  )\n\n  if (method === 'exact') {\n    const { p, pFloor } = exactSignedRankP(doubled, doubledDeviation)\n    return { w: wPlus, p, method, pFloor, nNonZero: n }\n  }\n\n  if (method === 'asymptotic') {\n    const variance = (n * (n + 1) * (2 * n + 1)) / 24 - tieTerm / 48\n    return {\n      w: wPlus,\n      p: asymptoticTwoSidedP(doubledDeviation / 2, Math.sqrt(variance)),\n      method,\n      pFloor: designFloor,\n      nNonZero: n,\n    }\n  }\n\n  const permutations = resolvePermutations('wilcoxonSignedRank', opts.permutations)\n  const rng = makeRng(opts.seed, before, after)\n  const doubledCentre = (n * (n + 1)) / 2\n  let atLeastAsExtreme = 0\n  for (let iteration = 0; iteration < permutations; iteration++) {\n    let doubledWPlus = 0\n    for (let k = 0; k < n; k++) if (rng() < 0.5) doubledWPlus += doubled[k]!\n    if (Math.abs(doubledWPlus - doubledCentre) >= doubledDeviation) atLeastAsExtreme++\n  }\n  return {\n    w: wPlus,\n    p: (1 + atLeastAsExtreme) / (permutations + 1),\n    method,\n    pFloor: Math.max(1 / (permutations + 1), designFloor),\n    nNonZero: n,\n  }\n}\n\n/**\n * Average ranks over an ASCENDING-sorted array, plus `Σ(t³ − t)` over tie\n * groups of size `t` — the correction term both asymptotic rank-test variances\n * need.\n */\nfunction midranksWithTieTerm(sorted: readonly number[]): { midranks: number[]; tieTerm: number } {\n  const midranks = new Array<number>(sorted.length)\n  let tieTerm = 0\n  let i = 0\n  while (i < sorted.length) {\n    let j = i\n    while (j < sorted.length && sorted[j] === sorted[i]) j++\n    const average = (i + 1 + j) / 2\n    for (let k = i; k < j; k++) midranks[k] = average\n    const groupSize = j - i\n    if (groupSize > 1) tieTerm += groupSize ** 3 - groupSize\n    i = j\n  }\n  return { midranks, tieTerm }\n}\n\nfunction selectRankTestMethod(\n  fn: string,\n  request: RankTestMethodRequest,\n  design: string,\n  exactFeasible: boolean,\n  designFloor: number,\n  threshold: string,\n): RankTestMethod {\n  if (request === 'auto') return exactFeasible ? 'exact' : 'permutation'\n  if (request === 'exact') {\n    if (exactFeasible) return 'exact'\n    throw new ValidationError(\n      `${fn}: method 'exact' is out of range at ${design} — enumeration is bounded by ` +\n        `${threshold}. Use 'auto' for the seeded Monte Carlo permutation, which converges ` +\n        'to the same answer.',\n    )\n  }\n  if (exactFeasible) {\n    throw new ValidationError(\n      `${fn}: method 'asymptotic' is refused at ${design} — the exact p-grid at this design ` +\n        `starts at ${formatProbability(designFloor)}, so an asymptotic p below it describes no ` +\n        `attainable outcome. Use method 'exact' (the default) or add repetitions past ` +\n        `${threshold}.`,\n    )\n  }\n  return 'asymptotic'\n}\n\nfunction resolvePermutations(fn: string, permutations: number | undefined): number {\n  if (permutations === undefined) return DEFAULT_PERMUTATIONS\n  if (!Number.isInteger(permutations) || permutations < 1) {\n    throw new ValidationError(`${fn}: permutations must be a positive integer, got ${permutations}`)\n  }\n  return permutations\n}\n\n/** Two-sided normal-approximation tail with the continuity correction. */\nfunction asymptoticTwoSidedP(deviation: number, sigma: number): number {\n  if (!(sigma > 0)) return 1\n  return Math.min(1, 2 * (1 - normalCdf(Math.max(0, deviation - 0.5) / sigma)))\n}\n\n/** SD of U under the permutation null, corrected for the realised ties. The\n *  tie term reduces (N+1) and reaches it exactly when every value is tied, so\n *  the variance floors at 0 rather than going negative. */\nfunction twoSampleSigma(n1: number, n2: number, total: number, tieTerm: number): number {\n  if (total < 2) return 0\n  const variance = ((n1 * n2) / 12) * (total + 1 - tieTerm / (total * (total - 1)))\n  return Math.sqrt(Math.max(0, variance))\n}\n\nfunction logChoose(n: number, k: number): number {\n  return lnGamma(n + 1) - lnGamma(k + 1) - lnGamma(n - k + 1)\n}\n\nfunction formatProbability(value: number): string {\n  return value >= 1e-4 || value === 0 ? value.toFixed(4) : value.toExponential(3)\n}\n\n/**\n * Exact DP allocation and loop count for this observed rank vector.\n *\n * The smaller arm is sufficient because selecting its complement produces the\n * same two-sided U deviation while using fewer rows in the state table.\n */\nfunction exactTwoSampleCost(\n  doubledRanks: readonly number[],\n  selectedN: number,\n): { states: number; work: number } {\n  const maxSum = doubledRanks.reduce((sum, rank) => sum + rank, 0)\n  let work = 0\n  for (let placed = 0; placed < doubledRanks.length; placed++) {\n    work += Math.min(selectedN, placed + 1) * (maxSum - doubledRanks[placed]! + 1)\n  }\n  return {\n    states: (selectedN + 1) * (maxSum + 1),\n    work,\n  }\n}\n\n/**\n * Smallest attainable two-sided p under the observed ties.\n *\n * Only subsets with the minimum or maximum rank sum can attain the largest\n * deviation. Their multiplicity is the number of ways to choose within the\n * tie group at each boundary, so this calculation is exact without allocating\n * the full null distribution.\n */\nfunction exactTwoSampleFloor(doubledRanks: readonly number[], selectedN: number): number {\n  const total = doubledRanks.length\n  const otherN = total - selectedN\n  const minimumSum = doubledRanks.slice(0, selectedN).reduce((sum, rank) => sum + rank, 0)\n  const maximumSum = doubledRanks.slice(total - selectedN).reduce((sum, rank) => sum + rank, 0)\n  if (minimumSum === maximumSum) return 1\n\n  const centre = selectedN * (selectedN + 1) + selectedN * otherN\n  const minimumDeviation = Math.abs(minimumSum - centre)\n  const maximumDeviation = Math.abs(maximumSum - centre)\n  const totalLogWays = logChoose(total, selectedN)\n  const minimumMass = Math.exp(\n    logExtremeSubsetWays(doubledRanks, selectedN, 'minimum') - totalLogWays,\n  )\n  const maximumMass = Math.exp(\n    logExtremeSubsetWays(doubledRanks, selectedN, 'maximum') - totalLogWays,\n  )\n\n  if (minimumDeviation > maximumDeviation) return minimumMass\n  if (maximumDeviation > minimumDeviation) return maximumMass\n  return Math.min(1, minimumMass + maximumMass)\n}\n\nfunction logExtremeSubsetWays(\n  sortedRanks: readonly number[],\n  selectedN: number,\n  side: 'minimum' | 'maximum',\n): number {\n  const boundaryIndex = side === 'minimum' ? selectedN - 1 : sortedRanks.length - selectedN\n  const boundary = sortedRanks[boundaryIndex]!\n  let first = boundaryIndex\n  let afterLast = boundaryIndex + 1\n  while (first > 0 && sortedRanks[first - 1] === boundary) first--\n  while (afterLast < sortedRanks.length && sortedRanks[afterLast] === boundary) afterLast++\n\n  const tieSize = afterLast - first\n  const fixed = side === 'minimum' ? first : sortedRanks.length - afterLast\n  return logChoose(tieSize, selectedN - fixed)\n}\n\n/**\n * Exact conditional two-sided p for the two-sample rank test.\n *\n * Convolves the observed doubled midranks into the null distribution of group\n * a's rank sum over every `C(n₁+n₂, n₁)` split — identical to enumerating the\n * splits, but `O(N·n₁·ΣR)` instead of `O(C(N,n₁)·n₁n₂)`. Conditioning on the\n * realised multiset makes the tie handling exact rather than a correction.\n *\n * The null is symmetric about `n₁n₂/2` (negating every value maps `U → n₁n₂ −\n * U` and permutes the split set onto itself), so the two-sided p is the mass\n * at least as far from the centre as the observation.\n */\nfunction exactTwoSampleP(\n  doubledRanks: readonly number[],\n  n1: number,\n  n2: number,\n  doubledDeviation: number,\n): { p: number; pFloor: number } {\n  const maxSum = doubledRanks.reduce((sum, rank) => sum + rank, 0)\n  const width = maxSum + 1\n  // ways[k][s] = number of size-k subsets whose doubled rank sum is s.\n  const ways: Float64Array[] = Array.from({ length: n1 + 1 }, () => new Float64Array(width))\n  ways[0]![0] = 1\n  let placed = 0\n  for (const rank of doubledRanks) {\n    for (let k = Math.min(n1, placed + 1); k >= 1; k--) {\n      const from = ways[k - 1]!\n      const into = ways[k]!\n      for (let sum = maxSum - rank; sum >= 0; sum--) {\n        const count = from[sum]!\n        if (count !== 0) into[sum + rank]! += count\n      }\n    }\n    placed++\n  }\n\n  // U = rankSum − n₁(n₁+1)/2, so doubled U = s − n₁(n₁+1), and the doubled\n  // centre 2·(n₁n₂/2) is n₁n₂.\n  const shift = n1 * (n1 + 1) + n1 * n2\n  const chosen = ways[n1]!\n  let totalWays = 0\n  let extremeWays = 0\n  let tailWays = 0\n  let maxDeviation = -1\n  for (let sum = 0; sum < width; sum++) {\n    const count = chosen[sum]!\n    if (count === 0) continue\n    totalWays += count\n    const deviation = Math.abs(sum - shift)\n    if (deviation >= doubledDeviation) tailWays += count\n    if (deviation > maxDeviation) {\n      maxDeviation = deviation\n      extremeWays = count\n    } else if (deviation === maxDeviation) {\n      extremeWays += count\n    }\n  }\n  return { p: tailWays / totalWays, pFloor: extremeWays / totalWays }\n}\n\n/**\n * Exact conditional two-sided p for the paired signed-rank test.\n *\n * Convolves the observed doubled absolute midranks over all `2ⁿ` sign\n * assignments in `O(n·ΣR)`. Probabilities rather than counts keep `2ⁿ` off the\n * arithmetic. The null is symmetric about `n(n+1)/4`.\n */\nfunction exactSignedRankP(\n  doubledRanks: readonly number[],\n  doubledDeviation: number,\n): { p: number; pFloor: number } {\n  const maxSum = doubledRanks.reduce((sum, rank) => sum + rank, 0)\n  const width = maxSum + 1\n  let mass = new Float64Array(width)\n  mass[0] = 1\n  for (const rank of doubledRanks) {\n    const next = new Float64Array(width)\n    for (let sum = 0; sum < width; sum++) {\n      const probability = mass[sum]!\n      if (probability === 0) continue\n      next[sum]! += probability * 0.5\n      next[sum + rank]! += probability * 0.5\n    }\n    mass = next\n  }\n\n  const centre = maxSum / 2\n  let tail = 0\n  let extreme = 0\n  let maxDeviation = -1\n  for (let sum = 0; sum < width; sum++) {\n    const probability = mass[sum]!\n    if (probability === 0) continue\n    const deviation = Math.abs(sum - centre)\n    if (deviation >= doubledDeviation) tail += probability\n    if (deviation > maxDeviation) {\n      maxDeviation = deviation\n      extreme = probability\n    } else if (deviation === maxDeviation) {\n      extreme += probability\n    }\n  }\n  return { p: Math.min(1, tail), pFloor: Math.min(1, extreme) }\n}\n","/**\n * Matched-pair arm comparison — \"did the treatment arm beat the baseline arm\n * on the SAME work items?\"\n *\n * An arm A/B over run records is only trustworthy when it is PAIRED: the same\n * task/scenario/seed evaluated under both arms, compared item-by-item, so\n * inter-item difficulty variance cancels instead of masquerading as an arm\n * effect. This module owns the two error-prone steps every consumer otherwise\n * hand-rolls:\n *\n *   1. Pairing — matching rows across arms by `pairKey` (and by `repKey`\n *      within multi-rep items), with leftovers REPORTED rather than silently\n *      dropped (a silently unbalanced pairing biases every paired statistic\n *      downstream). Pairing never keys on outcome content: matching reps by\n *      their outcomes deflates discordant-pair counts and makes McNemar\n *      anti-conservative, so reps pair only by (`pairKey`, `repKey`) identity.\n *   2. Composition — feeding the matched pairs to the correct paired\n *      estimators that already live in `statistics`: `mcnemar` +\n *      `pairedRiskDifference` for pass/fail, `pairedBootstrap` +\n *      `wilcoxonSignedRank` for continuous metrics. No statistic is\n *      re-implemented here.\n *\n * The row shape is deliberately structural — callers project a `RunRecord`\n * (or any record) into `{ pairKey, arm, pass?, metrics? }`. Arm names are\n * caller-supplied parameters; the module ships no domain literal.\n */\n\nimport type { FindingTreatment } from './analyst/finding-composition'\nimport {\n  type ArmAssignment,\n  type ArmPopulationReading,\n  prepareArmPopulations,\n} from './arm-populations'\nimport { ValidationError } from './errors'\nimport type { RunRecord } from './run-record'\nimport type { McNemarResult, PairedBootstrapOptions, PairedBootstrapResult } from './statistics'\nimport {\n  mcnemar,\n  pairedBootstrap,\n  pairedRiskDifference,\n  type RiskDifferenceResult,\n  wilcoxonSignedRank,\n} from './statistics'\n\n/** One arm observation of one work item. Structural on purpose: callers\n *  project their own record type (e.g. a `RunRecord`) into this shape. */\nexport interface PairedArmRow {\n  /** Matching key — rows sharing a `pairKey` across both arms form pairs\n   *  (typically the task/scenario/seed identity). */\n  pairKey: string\n  /** Rep identity within a `pairKey` (e.g. a seed or rep number). Required on\n   *  every row of a `pairKey` that has more than one rep in either arm; reps\n   *  then pair only on exact (`pairKey`, `repKey`) match, never on outcome\n   *  content. Optional when each arm has at most one rep of the item. */\n  repKey?: string\n  /** Arm label this row was produced under. */\n  arm: string\n  /** Binary outcome; omit or null when no pass/fail outcome was observed. */\n  pass?: boolean | null\n  /** Actual formation verdict from the execution owner; absence/null stays unknown. */\n  formation?: { formed: boolean | null; reason?: string }\n  /** Recorded treatment provenance; assigned bundles live on the independent roster. */\n  treatment?: FindingTreatment[]\n  /** Named finite measurements; null/absent readings are unknown, not zero. */\n  metrics?: Record<string, number | null>\n}\n\nexport interface PairArmsOptions {\n  /** Arm treated as the control side of every pair. */\n  baselineArm: string\n  /** Arm treated as the treatment side of every pair. */\n  treatmentArm: string\n}\n\n/** One matched (baseline, treatment) observation of the same work item. */\nexport interface MatchedPair {\n  pairKey: string\n  /** 0-based position of this pair within its `pairKey`, ordered by sorted\n   *  `repKey` (always 0 for a single-rep item). The rep identity itself is on\n   *  the rows (`baseline.repKey` / `treatment.repKey`). */\n  repIndex: number\n  baseline: PairedArmRow\n  treatment: PairedArmRow\n}\n\nexport interface PairArmsResult {\n  /** Matched pairs, ordered by (`pairKey`, `repIndex`). */\n  pairs: MatchedPair[]\n  /** Baseline rows left without a treatment counterpart — reported, never\n   *  silently dropped. */\n  unpairedBaseline: PairedArmRow[]\n  /** Treatment rows left without a baseline counterpart. */\n  unpairedTreatment: PairedArmRow[]\n}\n\n/**\n * Match rows across two arms into (baseline, treatment) pairs by `pairKey`.\n *\n * A `pairKey` with at most one row per arm pairs directly, no `repKey`\n * needed. A `pairKey` with multiple reps in either arm requires `repKey` on\n * every one of its rows, and reps pair only on exact (`pairKey`, `repKey`)\n * match — pairing is keyed purely on row identity, never on outcome content\n * (outcome-keyed matching deflates discordant counts and biases McNemar), and\n * is therefore independent of input order. Reps whose `repKey` has no\n * counterpart in the other arm, and items present in only one arm, land in\n * the unpaired lists — reported, never truncated.\n *\n * Fail-loud: throws when either named arm has zero rows (an unknown arm\n * name would otherwise read as \"everything unpaired\"), when the two arm\n * names are equal, when a multi-rep `pairKey` has a row without `repKey`, or\n * when a (`pairKey`, arm) group repeats a `repKey` (the match would be\n * ambiguous).\n */\nexport function pairArms(rows: readonly PairedArmRow[], opts: PairArmsOptions): PairArmsResult {\n  const { baselineArm, treatmentArm } = opts\n  if (baselineArm === treatmentArm) {\n    throw new ValidationError(\n      `pairArms: baselineArm and treatmentArm are both '${baselineArm}' — an arm cannot be compared to itself`,\n    )\n  }\n\n  // arm → pairKey → rows\n  const byArm = new Map<string, Map<string, PairedArmRow[]>>()\n  const armsSeen = new Set<string>()\n  for (const row of rows) {\n    armsSeen.add(row.arm)\n    if (row.arm !== baselineArm && row.arm !== treatmentArm) continue\n    const byKey = byArm.get(row.arm) ?? new Map<string, PairedArmRow[]>()\n    const group = byKey.get(row.pairKey) ?? []\n    group.push(row)\n    byKey.set(row.pairKey, group)\n    byArm.set(row.arm, byKey)\n  }\n\n  for (const arm of [baselineArm, treatmentArm]) {\n    if (!byArm.has(arm)) {\n      const seen = [...armsSeen].sort().join(', ') || '<none>'\n      throw new ValidationError(`pairArms: no rows for arm '${arm}' (arms present: ${seen})`)\n    }\n  }\n\n  const baselineByKey = byArm.get(baselineArm)!\n  const treatmentByKey = byArm.get(treatmentArm)!\n\n  const allKeys = [...new Set([...baselineByKey.keys(), ...treatmentByKey.keys()])].sort()\n  const pairs: MatchedPair[] = []\n  const unpairedBaseline: PairedArmRow[] = []\n  const unpairedTreatment: PairedArmRow[] = []\n  for (const pairKey of allKeys) {\n    const b = baselineByKey.get(pairKey) ?? []\n    const t = treatmentByKey.get(pairKey) ?? []\n\n    if (b.length <= 1 && t.length <= 1) {\n      if (b.length === 1 && t.length === 1) {\n        const baseline = b[0]!\n        const treatment = t[0]!\n        if (baseline.repKey !== undefined || treatment.repKey !== undefined) {\n          if (\n            baseline.repKey === undefined ||\n            treatment.repKey === undefined ||\n            baseline.repKey !== treatment.repKey\n          ) {\n            unpairedBaseline.push(baseline)\n            unpairedTreatment.push(treatment)\n            continue\n          }\n        }\n        pairs.push({ pairKey, repIndex: 0, baseline, treatment })\n      } else {\n        unpairedBaseline.push(...b)\n        unpairedTreatment.push(...t)\n      }\n      continue\n    }\n\n    const bByRep = indexByRepKey(b, pairKey, baselineArm)\n    const tByRep = indexByRepKey(t, pairKey, treatmentArm)\n    const repKeys = [...new Set([...bByRep.keys(), ...tByRep.keys()])].sort()\n    let repIndex = 0\n    for (const repKey of repKeys) {\n      const baseline = bByRep.get(repKey)\n      const treatment = tByRep.get(repKey)\n      if (baseline !== undefined && treatment !== undefined) {\n        pairs.push({ pairKey, repIndex: repIndex++, baseline, treatment })\n      } else if (baseline !== undefined) {\n        unpairedBaseline.push(baseline)\n      } else if (treatment !== undefined) {\n        unpairedTreatment.push(treatment)\n      }\n    }\n  }\n\n  return { pairs, unpairedBaseline, unpairedTreatment }\n}\n\n/** Index a multi-rep (pairKey, arm) group by `repKey`, enforcing that every\n *  row carries one and that no repKey repeats within the group. */\nfunction indexByRepKey(\n  group: readonly PairedArmRow[],\n  pairKey: string,\n  arm: string,\n): Map<string, PairedArmRow> {\n  const byRep = new Map<string, PairedArmRow>()\n  for (const row of group) {\n    if (row.repKey === undefined) {\n      throw new ValidationError(\n        `pairArms: pairKey '${pairKey}' has multiple reps in an arm, but a row in arm '${arm}' ` +\n          `is missing repKey — multi-rep items require an explicit repKey on every row so reps ` +\n          `pair by identity (pairing reps by outcome or by index would bias the paired statistics)`,\n      )\n    }\n    if (byRep.has(row.repKey)) {\n      throw new ValidationError(\n        `pairArms: duplicate repKey '${row.repKey}' for pairKey '${pairKey}' in arm '${arm}' — ` +\n          `(pairKey, repKey) must uniquely identify a rep within an arm`,\n      )\n    }\n    byRep.set(row.repKey, row)\n  }\n  return byRep\n}\n\n/** Paired pass/fail comparison over the pairs where BOTH sides carry `pass`. */\nexport interface PairedCorrectness {\n  /** Discordant pairs where the treatment passed and the baseline failed. */\n  b10: number\n  /** Discordant pairs where the baseline passed and the treatment failed. */\n  b01: number\n  /** Exact McNemar significance over the paired outcomes (`b === b10`, `c === b01`). */\n  mcnemar: McNemarResult\n  /** Paired effect size: p(treatment) − p(baseline) with a paired-variance CI. */\n  riskDifference: RiskDifferenceResult\n}\n\n/** Paired delta summary for one named metric (delta = treatment − baseline). */\nexport interface PairedMetricDelta {\n  name: string\n  /** Pairs where BOTH sides carry a finite value for this metric. */\n  n: number\n  /** Pairs where at least one side does not carry the metric. */\n  nMissing: number\n  /** Median paired delta, or null when `n === 0`. */\n  medianDelta: number | null\n  /** Mean paired delta, or null when `n === 0`. */\n  meanDelta: number | null\n  /** Bootstrap CI on the paired delta (`pairedBootstrap`); null when\n   *  `n === 0` — a zero-width [0, 0] interval on no data would read as a\n   *  measured tight null. */\n  bootstrapCi: PairedBootstrapResult | null\n  /** Wilcoxon signed-rank test on the paired deltas; null when `n === 0`. */\n  wilcoxon: { w: number; p: number } | null\n}\n\nexport interface ComparePairedArmsOptions extends PairArmsOptions {\n  /** Supply all expected seeds to report as-assigned and as-formed populations. */\n  assignments?: readonly ArmAssignment[]\n  /** Metrics to compare. Default: every metric name observed on any matched\n   *  pair, sorted. A name that appears on no pair is still reported (with\n   *  `n = 0`) so a misspelled metric is visible instead of vanishing. */\n  metricNames?: string[]\n  /** Passed through to `pairedBootstrap` — set `seed` for reproducible CIs. */\n  bootstrap?: PairedBootstrapOptions\n}\n\nexport interface PairedArmsComparison {\n  /** Absent when the assignment population is unknown (no roster supplied). */\n  armPopulations?: ArmPopulationReading[]\n  nPairs: number\n  nUnpairedBaseline: number\n  nUnpairedTreatment: number\n  /** null when no matched pair carries `pass` on both sides — a pass/fail\n   *  verdict over rows that never measured pass/fail would be fabricated. */\n  correctness: PairedCorrectness | null\n  metricDeltas: PairedMetricDelta[]\n}\n\n/**\n * Full matched-pair arm comparison: pair via {@link pairArms}, then compose\n * the paired estimators from `statistics` over the matched pairs.\n *\n * Correctness uses only the pairs where both sides carry `pass` (`mcnemar.n`\n * is that subset's size); each metric uses only the pairs where both sides\n * carry a finite value for it, with the remainder counted in `nMissing`.\n * Deltas are treatment − baseline throughout. With an assignment roster, pairing\n * covers declared seed identities; missing observations remain identity-only rows\n * and never contribute fabricated outcomes or metrics. Per-arm summaries report\n * every assignment and the explicitly formed subset separately.\n *\n * Fail-loud: inherits {@link pairArms}'s unknown-arm throw, and throws on a\n * non-finite metric value — silently treating corrupt telemetry as \"metric\n * absent\" would misreport it as missing coverage.\n */\nexport function comparePairedArms(\n  rows: readonly PairedArmRow[],\n  opts: ComparePairedArmsOptions,\n): PairedArmsComparison {\n  const populations =\n    opts.assignments === undefined ? undefined : prepareArmPopulations(rows, opts.assignments, opts)\n  const { pairs, unpairedBaseline, unpairedTreatment } = pairArms(populations?.rows ?? rows, opts)\n\n  let correctness: PairedCorrectness | null = null\n  const baselinePass: number[] = []\n  const treatmentPass: number[] = []\n  for (const pair of pairs) {\n    if (pair.baseline.pass == null || pair.treatment.pass == null) continue\n    baselinePass.push(pair.baseline.pass ? 1 : 0)\n    treatmentPass.push(pair.treatment.pass ? 1 : 0)\n  }\n  if (baselinePass.length > 0) {\n    const mc = mcnemar(baselinePass, treatmentPass)\n    correctness = {\n      b10: mc.b,\n      b01: mc.c,\n      mcnemar: mc,\n      riskDifference: pairedRiskDifference(baselinePass, treatmentPass),\n    }\n  }\n\n  const metricNames =\n    opts.metricNames ??\n    [\n      ...new Set(\n        pairs.flatMap((p) => [\n          ...Object.keys(p.baseline.metrics ?? {}),\n          ...Object.keys(p.treatment.metrics ?? {}),\n        ]),\n      ),\n    ].sort()\n\n  const metricDeltas: PairedMetricDelta[] = metricNames.map((name) => {\n    const before: number[] = []\n    const after: number[] = []\n    let nMissing = 0\n    for (const pair of pairs) {\n      const b = metricValue(pair.baseline, name)\n      const t = metricValue(pair.treatment, name)\n      if (b === undefined || t === undefined) {\n        nMissing++\n        continue\n      }\n      before.push(b)\n      after.push(t)\n    }\n    const bootstrapCi = before.length === 0 ? null : pairedBootstrap(before, after, opts.bootstrap)\n    return {\n      name,\n      n: before.length,\n      nMissing,\n      medianDelta: bootstrapCi?.median ?? null,\n      meanDelta: bootstrapCi?.mean ?? null,\n      bootstrapCi,\n      wilcoxon: before.length === 0 ? null : wilcoxonSignedRank(before, after),\n    }\n  })\n\n  return {\n    ...(populations ? { armPopulations: populations.readings } : {}),\n    nPairs: pairs.length,\n    nUnpairedBaseline: unpairedBaseline.length,\n    nUnpairedTreatment: unpairedTreatment.length,\n    correctness,\n    metricDeltas,\n  }\n}\n\nexport interface MatchedRunRecordPair {\n  pairKey: string\n  repKey: string\n  baseline: RunRecord\n  treatment: RunRecord\n}\n\nexport interface PairRunRecordsResult {\n  pairs: MatchedRunRecordPair[]\n  unpairedBaseline: RunRecord[]\n  unpairedTreatment: RunRecord[]\n}\n\ninterface RunRecordArmRow extends PairedArmRow {\n  run: RunRecord\n  repKey: string\n}\n\n/**\n * Pair two RunRecord arms by the identity of the evaluated work:\n * `(experimentId, scenarioId, seed)`.\n *\n * Falling back to array order, candidate id, or experiment id can compare\n * different tasks and fabricate lift. Duplicate identities throw.\n */\nexport function pairRunRecords(\n  baselineRuns: readonly RunRecord[],\n  treatmentRuns: readonly RunRecord[],\n): PairRunRecordsResult {\n  const baselineRows = runRecordArmRows(baselineRuns, 'baseline')\n  const treatmentRows = runRecordArmRows(treatmentRuns, 'treatment')\n  validateRunRecordArmRows(baselineRows, 'baseline')\n  validateRunRecordArmRows(treatmentRows, 'treatment')\n  if (baselineRows.length === 0 || treatmentRows.length === 0) {\n    return {\n      pairs: [],\n      unpairedBaseline: baselineRows.map((row) => row.run),\n      unpairedTreatment: treatmentRows.map((row) => row.run),\n    }\n  }\n\n  const result = pairArms([...baselineRows, ...treatmentRows], {\n    baselineArm: 'baseline',\n    treatmentArm: 'treatment',\n  })\n  return {\n    pairs: result.pairs.map((pair) => {\n      const baseline = pair.baseline as RunRecordArmRow\n      const treatment = pair.treatment as RunRecordArmRow\n      return {\n        pairKey: pair.pairKey,\n        repKey: baseline.repKey,\n        baseline: baseline.run,\n        treatment: treatment.run,\n      }\n    }),\n    unpairedBaseline: result.unpairedBaseline.map((row) => (row as RunRecordArmRow).run),\n    unpairedTreatment: result.unpairedTreatment.map((row) => (row as RunRecordArmRow).run),\n  }\n}\n\nfunction runRecordArmRows(runs: readonly RunRecord[], arm: string): RunRecordArmRow[] {\n  return runs.map((run) => {\n    const scenarioId = run.scenarioId.trim()\n    if (!scenarioId) {\n      throw new ValidationError(\n        `pairRunRecords: run '${run.runId}' is missing scenarioId; paired comparisons require explicit scenario identity`,\n      )\n    }\n    return {\n      pairKey: JSON.stringify([run.experimentId, scenarioId]),\n      repKey: String(run.seed),\n      arm,\n      run,\n    }\n  })\n}\n\nfunction validateRunRecordArmRows(rows: readonly RunRecordArmRow[], arm: string): void {\n  const byPairKey = new Map<string, RunRecordArmRow[]>()\n  for (const row of rows) {\n    const group = byPairKey.get(row.pairKey) ?? []\n    group.push(row)\n    byPairKey.set(row.pairKey, group)\n  }\n  for (const [pairKey, group] of byPairKey) {\n    if (group.length > 1) indexByRepKey(group, pairKey, arm)\n  }\n}\n\nfunction metricValue(row: PairedArmRow, name: string): number | undefined {\n  const v = row.metrics?.[name]\n  if (v == null) return undefined\n  if (!Number.isFinite(v)) {\n    throw new ValidationError(\n      `comparePairedArms: non-finite value for metric '${name}' on pairKey '${row.pairKey}' (arm '${row.arm}'): ${v}`,\n    )\n  }\n  return v\n}\n"],"mappings":";;;;;;AA6BA,MAAM,SAAS,QACb,KAAK,UAAU;CAAC,IAAI;CAAK,IAAI;CAAS,IAAI,UAAU;AAAI,CAAC;AAC3D,SAAS,cAAc,KAA0B;CAC/C,KAAK,MAAM,SAAS;EAAC,IAAI;EAAK,IAAI;EAAS,GAAI,IAAI,WAAW,KAAA,IAAY,CAAC,IAAI,CAAC,IAAI,MAAM;CAAE,GAC1F,IAAI,OAAO,UAAU,YAAY,CAAC,MAAM,KAAK,GAC3C,MAAM,IAAI,UAAU,6CAA6C;CAErE,IAAI,IAAI,cAAc,KAAA,GAAW;EAC/B,IAAI,CAAC,MAAM,QAAQ,IAAI,SAAS,GAAG,MAAM,IAAI,UAAU,gCAAgC;EACvF,KAAK,MAAM,SAAS,IAAI,WAAW,uBAAuB,MAAM,KAAK;EACrE,IAAI,IAAI,IAAI,IAAI,UAAU,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,UAAU,QACjE,MAAM,IAAI,UAAU,4BAA4B;CACpD;AACF;AACA,SAAS,iBAAiB,KAAyB;CACjD,cAAc,GAAG;CACjB,IAAI,IAAI,QAAQ,QAAQ,OAAO,IAAI,SAAS,WAC1C,MAAM,IAAI,UAAU,wBAAwB;CAC9C,IAAI,IAAI,cAAc,KAAA,GAAW;EAC/B,IAAI,IAAI,cAAc,QAAQ,OAAO,IAAI,cAAc,UACrD,MAAM,IAAI,UAAU,2BAA2B;EACjD,IAAI,IAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,UAAU,WAAW,WACnE,MAAM,IAAI,UAAU,yBAAyB;EAC/C,IAAI,IAAI,UAAU,WAAW,KAAA,KAAa,OAAO,IAAI,UAAU,WAAW,UACxE,MAAM,IAAI,UAAU,0BAA0B;CAClD;CACA,KAAK,MAAM,SAAS,OAAO,OAAO,IAAI,WAAW,CAAC,CAAC,GACjD,IAAI,UAAU,QAAQ,CAAC,OAAO,SAAS,KAAK,GAAG,MAAM,IAAI,UAAU,uBAAuB;AAE9F;;AAGA,SAAgB,sBACd,cACA,aACA,SAC4D;CAC5D,MAAM,OAAO,CAAC,QAAQ,aAAa,QAAQ,YAAY;CACvD,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,aAAa;EAC/B,IAAI,CAAC,KAAK,SAAS,MAAM,GAAG,GAAG;EAC/B,cAAc,KAAK;EACnB,MAAM,MAAM,MAAM,KAAK;EACvB,IAAI,OAAO,IAAI,GAAG,GAAG,MAAM,IAAI,UAAU,0BAA0B;EACnE,OAAO,IAAI,KAAK,gBAAgB,KAAK,CAAC;CACxC;CACA,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,QAAQ,GAAG,GACjD,MAAM,IAAI,UAAU,iCAAiC,IAAI,EAAE;CAC/D,MAAM,yBAAS,IAAI,IAA0B;CAC7C,KAAK,MAAM,OAAO,cAAc;EAC9B,IAAI,CAAC,KAAK,SAAS,IAAI,GAAG,GAAG;EAC7B,iBAAiB,GAAG;EACpB,MAAM,MAAM,MAAM,GAAG;EACrB,IAAI,CAAC,OAAO,IAAI,GAAG,GAAG,MAAM,IAAI,UAAU,gDAAgD;EAC1F,IAAI,OAAO,IAAI,GAAG,GAAG,MAAM,IAAI,UAAU,2BAA2B;EACpE,OAAO,IAAI,KAAK,GAAG;CACrB;CACA,MAAM,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAE;CAErF,MAAM,OAAO,QAAQ,KAAK,CAAC,KAAK,WAAW,OAAO,IAAI,GAAG,KAAK,KAAK;CACnE,MAAM,cACJ,QAAQ,eACR,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,OAAO,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;CAoBvF,OAAO;EAAE;EAAM,UAnBE,KAAK,KAAK,QAAQ;GACjC,MAAM,WAAW,QAAQ,QAAQ,GAAG,OAAO,EAAE,QAAQ,GAAG;GACxD,MAAM,aAAa,SAAS,KAAK,CAAC,SAAS,OAAO,IAAI,GAAG,CAAC;GAC1D,MAAM,WAAW,WAAW,QACzB,QAA6B,KAAK,WAAW,WAAW,IAC3D;GACA,OAAO;IACL;IACA,aAAa,SAAS,KAAK,GAAG,OAAO,CAAC;IACtC,qBAAqB,WAAW,QAAQ,MAAM,MAAM,KAAA,CAAS,CAAC,CAAC;IAC/D,WAAW;KACT,QAAQ,SAAS;KACjB,WAAW,WAAW,QAAQ,MAAM,GAAG,WAAW,WAAW,KAAK,CAAC,CAAC;KACpE,SAAS,WAAW,QAAQ,MAAM,GAAG,WAAW,UAAU,IAAI,CAAC,CAAC;IAClE;IACA,YAAY,UAAU,YAAY,WAAW;IAC7C,UAAU,UAAU,UAAU,WAAW;GAC3C;EACF,CACsB;CAAE;AAC1B;AAEA,SAAS,UACP,MACA,OACsB;CACtB,MAAM,SAAS,KAAK,QAAQ,MAAM,GAAG,SAAS,IAAI,CAAC,CAAC;CACpD,MAAM,SAAS,KAAK,QAAQ,MAAM,GAAG,SAAS,KAAK,CAAC,CAAC;CACrD,MAAM,kBAAkB,KAAK,SAAS,SAAS;CAC/C,MAAM,UAAU,OAAO,YACrB,MAAM,KAAK,SAAS;EAClB,MAAM,SAAS,KAAK,KAAK,MAAM,GAAG,UAAU,KAAK,CAAC,CAAC,QAAQ,MAAmB,KAAK,IAAI;EACvF,MAAM,MAAM,OAAO,SAAS,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAChE,OAAO,CACL,MACA;GACE,GAAG,OAAO;GACV,SAAS,KAAK,SAAS,OAAO;GAC9B;GACA,MAAM,QAAQ,OAAO,OAAO,MAAM,OAAO;EAC3C,CACF;CACF,CAAC,CACH;CACA,OAAO;EACL,GAAG,KAAK;EACR;EACA;EACA;EACA,UAAU,KAAK,UAAU,CAAC,kBAAkB,SAAS,KAAK,SAAS;EACnE;CACF;AACF;;;;;;;;;AC1IA,SAAgB,UAAU,GAAmB;CAC3C,IAAI,MAAM,GAAG,OAAO;CAEpB,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,KAAK;CACX,MAAM,IAAI;CAEV,MAAM,SAAS,KAAK,IAAI,CAAC,IAAI,KAAK;CAClC,MAAM,IAAI,KAAK,IAAI,IAAI;CACvB,MAAM,iBAAiB,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC,SAAS,MAAM;CAEjG,OAAO,IAAI,IAAI,aAAa,IAAI,IAAI,aAAa;AACnD;;;AC8BA,MAAM,gCAAgC;;AAEtC,MAAM,8BAA8B;;AAEpC,MAAM,uBAAuB;;AAE7B,MAAM,uBAAuB;;;;;;;;;;;;;AA2B7B,SAAgB,aACd,GACA,GACA,OAAwB,CAAC,GACN;CACnB,mBAAmB,gBAAgB,KAAK,CAAC;CACzC,mBAAmB,gBAAgB,KAAK,CAAC;CAEzC,MAAM,KAAK,EAAE;CACb,MAAM,KAAK,EAAE;CACb,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO;EAAE,GAAG;EAAG,IAAI;EAAG,GAAG;EAAG,QAAQ;EAAS,QAAQ;CAAE;CAEjF,MAAM,QAAQ,KAAK;CACnB,MAAM,WAAW,CACf,GAAG,EAAE,KAAK,OAAO;EAAE;EAAG,OAAO;CAAK,EAAE,GACpC,GAAG,EAAE,KAAK,OAAO;EAAE;EAAG,OAAO;CAAM,EAAE,CACvC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;CAE1B,MAAM,EAAE,UAAU,YAAY,oBAAoB,SAAS,KAAK,UAAU,MAAM,CAAC,CAAC;CAClF,IAAI,WAAW;CACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,IAAI,SAAS,EAAE,CAAE,OAAO,YAAY,SAAS;CAG/C,MAAM,KAAK,WAAY,MAAM,KAAK,KAAM;CACxC,MAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE;CAGnC,MAAM,UAAU,SAAS,KAAK,SAAS,KAAK,MAAM,OAAO,CAAC,CAAC;CAC3D,MAAM,mBAAmB,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE;CAClD,MAAM,YAAY,KAAK,IAAI,IAAI,EAAE;CACjC,MAAM,SAAS,QAAQ;CACvB,MAAM,YAAY,mBAAmB,SAAS,SAAS;CAEvD,MAAM,cAAc,oBAAoB,SAAS,SAAS;CAC1D,MAAM,SAAS,qBACb,gBACA,KAAK,UAAU,QACf,MAAM,GAAG,OAAO,MAChB,UAAU,UAAU,iCAClB,UAAU,QAAQ,6BACpB,aACA,GAAG,8BAA8B,eAAe,OAAO,EAAE,cACpD,4BAA4B,eAAe,OAAO,EAAE,aAC3D;CAEA,IAAI,WAAW,SAAS;EACtB,MAAM,EAAE,GAAG,WAAW,gBAAgB,SAAS,WAAW,QAAQ,gBAAgB;EAClF,OAAO;GAAE;GAAG;GAAI;GAAG;GAAQ;EAAO;CACpC;CAEA,IAAI,WAAW,cACb,OAAO;EACL;EACA;EACA,GAAG,oBAAoB,mBAAmB,GAAG,eAAe,IAAI,IAAI,OAAO,OAAO,CAAC;EACnF;EACA,QAAQ;CACV;CAGF,MAAM,eAAe,oBAAoB,gBAAgB,KAAK,YAAY;CAC1E,MAAM,MAAM,KAAK,SAAS,KAAA,IAAY,QAAQ,uBAAuB,GAAG,CAAC,CAAC,IAAI,QAAQ,KAAK,IAAI;CAC/F,IAAI,mBAAmB;CACvB,MAAM,OAAO,CAAC,GAAG,OAAO;CACxB,KAAK,IAAI,YAAY,GAAG,YAAY,cAAc,aAAa;EAC7D,IAAI,iBAAiB;EACrB,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,OAAO,IAAI,KAAK,MAAM,IAAI,KAAK,QAAQ,EAAE;GAC/C,MAAM,UAAU,KAAK;GACrB,KAAK,QAAQ,KAAK;GAClB,KAAK,KAAK;GACV,kBAAkB;EACpB;EACA,IACE,KAAK,IAAI,iBAAiB,aAAa,YAAY,KAAK,YAAY,MAAM,KAC1E,kBAEA;CAEJ;CACA,MAAM,SAAS,KAAK,IAAI,KAAK,eAAe,IAAI,WAAW;CAC3D,OAAO;EACL;EACA;EACA,GAAG,KAAK,KAAK,IAAI,qBAAqB,eAAe,IAAI,MAAM;EAC/D;EACA;CACF;AACF;;;;;;;;;;;;;;AA6BA,SAAgB,mBACd,QACA,OACA,OAAwB,CAAC,GACC;CAC1B,IAAI,OAAO,WAAW,MAAM,QAC1B,MAAM,IAAI,gBACR,6CAA6C,OAAO,OAAO,MAAM,MAAM,OAAO,EAChF;CAEF,mBAAmB,sBAAsB,UAAU,MAAM;CACzD,mBAAmB,sBAAsB,SAAS,KAAK;CAEvD,MAAM,QAAQ,OAAO,KAAK,GAAG,MAAM,MAAM,KAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,MAAM,CAAC;CACvE,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,GAAG,OAAO;EAAE,GAAG;EAAG,GAAG;EAAG,QAAQ;EAAS,QAAQ;EAAG,UAAU;CAAE;CAQ1E,MAAM,MAAM,KAAK,IAAI,MAAM,EAAG;CAC9B,MAAM,cAAc,MAAM,OAAO,MAAM,KAAK,IAAI,CAAC,MAAM,GAAG;CAC1D,KAAK,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,WAAW,aAAa;EACxE,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAI,CAAC,CAAC,CAAC;EAC5C,MAAM,WAAW,IAAI;EACrB,OAAO;GACL,GAAI,YAAY,IAAI,KAAM;GAC1B,GAAG,qBAAqB,UAAU,QAAQ;GAC1C,QAAQ;GACR,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,EAAE;GAChC,UAAU;EACZ;CACF;CAEA,MAAM,QAAQ,MAAM,KAAK,GAAG,OAAO;EAAE,KAAK,KAAK,IAAI,CAAC;EAAG;CAAE,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;CACzF,MAAM,EAAE,UAAU,YAAY,oBAAoB,MAAM,KAAK,UAAU,MAAM,GAAG,CAAC;CACjF,MAAM,QAAkB,IAAI,MAAM,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM,MAAM,EAAE,CAAE,KAAK,SAAS;CAE1D,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,MAAM,KAAM,GAAG,SAAS,MAAM;CAK9D,MAAM,UAAU,SAAS,KAAK,SAAS,KAAK,MAAM,OAAO,CAAC,CAAC;CAC3D,MAAM,mBAAmB,KAAK,IAAI,IAAI,QAAS,KAAK,IAAI,KAAM,CAAC;CAE/D,MAAM,cAAc,KAAK,IAAI,GAAG,MAAM,IAAI,EAAE;CAC5C,MAAM,SAAS,qBACb,sBACA,KAAK,UAAU,QACf,KAAK,EAAE,wBACP,KAAK,sBACL,aACA,GAAG,qBAAqB,sBAC1B;CAEA,IAAI,WAAW,SAAS;EACtB,MAAM,EAAE,GAAG,WAAW,iBAAiB,SAAS,gBAAgB;EAChE,OAAO;GAAE,GAAG;GAAO;GAAG;GAAQ;GAAQ,UAAU;EAAE;CACpD;CAEA,IAAI,WAAW,cAAc;EAC3B,MAAM,WAAY,KAAK,IAAI,MAAM,IAAI,IAAI,KAAM,KAAK,UAAU;EAC9D,OAAO;GACL,GAAG;GACH,GAAG,oBAAoB,mBAAmB,GAAG,KAAK,KAAK,QAAQ,CAAC;GAChE;GACA,QAAQ;GACR,UAAU;EACZ;CACF;CAEA,MAAM,eAAe,oBAAoB,sBAAsB,KAAK,YAAY;CAChF,MAAM,MAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK;CAC5C,MAAM,gBAAiB,KAAK,IAAI,KAAM;CACtC,IAAI,mBAAmB;CACvB,KAAK,IAAI,YAAY,GAAG,YAAY,cAAc,aAAa;EAC7D,IAAI,eAAe;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,IAAK,gBAAgB,QAAQ;EACrE,IAAI,KAAK,IAAI,eAAe,aAAa,KAAK,kBAAkB;CAClE;CACA,OAAO;EACL,GAAG;EACH,IAAI,IAAI,qBAAqB,eAAe;EAC5C;EACA,QAAQ,KAAK,IAAI,KAAK,eAAe,IAAI,WAAW;EACpD,UAAU;CACZ;AACF;;;;;;AAOA,SAAS,oBAAoB,QAAoE;CAC/F,MAAM,WAAW,IAAI,MAAc,OAAO,MAAM;CAChD,IAAI,UAAU;CACd,IAAI,IAAI;CACR,OAAO,IAAI,OAAO,QAAQ;EACxB,IAAI,IAAI;EACR,OAAO,IAAI,OAAO,UAAU,OAAO,OAAO,OAAO,IAAI;EACrD,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,SAAS,KAAK;EAC1C,MAAM,YAAY,IAAI;EACtB,IAAI,YAAY,GAAG,WAAW,aAAa,IAAI;EAC/C,IAAI;CACN;CACA,OAAO;EAAE;EAAU;CAAQ;AAC7B;AAEA,SAAS,qBACP,IACA,SACA,QACA,eACA,aACA,WACgB;CAChB,IAAI,YAAY,QAAQ,OAAO,gBAAgB,UAAU;CACzD,IAAI,YAAY,SAAS;EACvB,IAAI,eAAe,OAAO;EAC1B,MAAM,IAAI,gBACR,GAAG,GAAG,sCAAsC,OAAO,+BAC9C,UAAU,yFAEjB;CACF;CACA,IAAI,eACF,MAAM,IAAI,gBACR,GAAG,GAAG,sCAAsC,OAAO,+CACpC,kBAAkB,WAAW,EAAE,0HAEzC,UAAU,EACjB;CAEF,OAAO;AACT;AAEA,SAAS,oBAAoB,IAAY,cAA0C;CACjF,IAAI,iBAAiB,KAAA,GAAW,OAAO;CACvC,IAAI,CAAC,OAAO,UAAU,YAAY,KAAK,eAAe,GACpD,MAAM,IAAI,gBAAgB,GAAG,GAAG,iDAAiD,cAAc;CAEjG,OAAO;AACT;;AAGA,SAAS,oBAAoB,WAAmB,OAAuB;CACrE,IAAI,EAAE,QAAQ,IAAI,OAAO;CACzB,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,UAAU,KAAK,IAAI,GAAG,YAAY,EAAG,IAAI,KAAK,EAAE;AAC9E;;;;AAKA,SAAS,eAAe,IAAY,IAAY,OAAe,SAAyB;CACtF,IAAI,QAAQ,GAAG,OAAO;CACtB,MAAM,WAAa,KAAK,KAAM,MAAO,QAAQ,IAAI,WAAW,SAAS,QAAQ;CAC7E,OAAO,KAAK,KAAK,KAAK,IAAI,GAAG,QAAQ,CAAC;AACxC;AAEA,SAAS,UAAU,GAAW,GAAmB;CAC/C,OAAO,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC;AAC5D;AAEA,SAAS,kBAAkB,OAAuB;CAChD,OAAO,SAAS,QAAQ,UAAU,IAAI,MAAM,QAAQ,CAAC,IAAI,MAAM,cAAc,CAAC;AAChF;;;;;;;AAQA,SAAS,mBACP,cACA,WACkC;CAClC,MAAM,SAAS,aAAa,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC/D,IAAI,OAAO;CACX,KAAK,IAAI,SAAS,GAAG,SAAS,aAAa,QAAQ,UACjD,QAAQ,KAAK,IAAI,WAAW,SAAS,CAAC,KAAK,SAAS,aAAa,UAAW;CAE9E,OAAO;EACL,SAAS,YAAY,MAAM,SAAS;EACpC;CACF;AACF;;;;;;;;;AAUA,SAAS,oBAAoB,cAAiC,WAA2B;CACvF,MAAM,QAAQ,aAAa;CAC3B,MAAM,SAAS,QAAQ;CACvB,MAAM,aAAa,aAAa,MAAM,GAAG,SAAS,CAAC,CAAC,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CACvF,MAAM,aAAa,aAAa,MAAM,QAAQ,SAAS,CAAC,CAAC,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC5F,IAAI,eAAe,YAAY,OAAO;CAEtC,MAAM,SAAS,aAAa,YAAY,KAAK,YAAY;CACzD,MAAM,mBAAmB,KAAK,IAAI,aAAa,MAAM;CACrD,MAAM,mBAAmB,KAAK,IAAI,aAAa,MAAM;CACrD,MAAM,eAAe,UAAU,OAAO,SAAS;CAC/C,MAAM,cAAc,KAAK,IACvB,qBAAqB,cAAc,WAAW,SAAS,IAAI,YAC7D;CACA,MAAM,cAAc,KAAK,IACvB,qBAAqB,cAAc,WAAW,SAAS,IAAI,YAC7D;CAEA,IAAI,mBAAmB,kBAAkB,OAAO;CAChD,IAAI,mBAAmB,kBAAkB,OAAO;CAChD,OAAO,KAAK,IAAI,GAAG,cAAc,WAAW;AAC9C;AAEA,SAAS,qBACP,aACA,WACA,MACQ;CACR,MAAM,gBAAgB,SAAS,YAAY,YAAY,IAAI,YAAY,SAAS;CAChF,MAAM,WAAW,YAAY;CAC7B,IAAI,QAAQ;CACZ,IAAI,YAAY,gBAAgB;CAChC,OAAO,QAAQ,KAAK,YAAY,QAAQ,OAAO,UAAU;CACzD,OAAO,YAAY,YAAY,UAAU,YAAY,eAAe,UAAU;CAI9E,OAAO,UAFS,YAAY,OAEF,aADZ,SAAS,YAAY,QAAQ,YAAY,SAAS,UACrB;AAC7C;;;;;;;;;;;;;AAcA,SAAS,gBACP,cACA,IACA,IACA,kBAC+B;CAC/B,MAAM,SAAS,aAAa,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC/D,MAAM,QAAQ,SAAS;CAEvB,MAAM,OAAuB,MAAM,KAAK,EAAE,QAAQ,KAAK,EAAE,SAAS,IAAI,aAAa,KAAK,CAAC;CACzF,KAAK,EAAE,CAAE,KAAK;CACd,IAAI,SAAS;CACb,KAAK,MAAM,QAAQ,cAAc;EAC/B,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,GAAG,KAAK;GAClD,MAAM,OAAO,KAAK,IAAI;GACtB,MAAM,OAAO,KAAK;GAClB,KAAK,IAAI,MAAM,SAAS,MAAM,OAAO,GAAG,OAAO;IAC7C,MAAM,QAAQ,KAAK;IACnB,IAAI,UAAU,GAAG,KAAK,MAAM,SAAU;GACxC;EACF;EACA;CACF;CAIA,MAAM,QAAQ,MAAM,KAAK,KAAK,KAAK;CACnC,MAAM,SAAS,KAAK;CACpB,IAAI,YAAY;CAChB,IAAI,cAAc;CAClB,IAAI,WAAW;CACf,IAAI,eAAe;CACnB,KAAK,IAAI,MAAM,GAAG,MAAM,OAAO,OAAO;EACpC,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,GAAG;EACjB,aAAa;EACb,MAAM,YAAY,KAAK,IAAI,MAAM,KAAK;EACtC,IAAI,aAAa,kBAAkB,YAAY;EAC/C,IAAI,YAAY,cAAc;GAC5B,eAAe;GACf,cAAc;EAChB,OAAO,IAAI,cAAc,cACvB,eAAe;CAEnB;CACA,OAAO;EAAE,GAAG,WAAW;EAAW,QAAQ,cAAc;CAAU;AACpE;;;;;;;;AASA,SAAS,iBACP,cACA,kBAC+B;CAC/B,MAAM,SAAS,aAAa,QAAQ,KAAK,SAAS,MAAM,MAAM,CAAC;CAC/D,MAAM,QAAQ,SAAS;CACvB,IAAI,OAAO,IAAI,aAAa,KAAK;CACjC,KAAK,KAAK;CACV,KAAK,MAAM,QAAQ,cAAc;EAC/B,MAAM,OAAO,IAAI,aAAa,KAAK;EACnC,KAAK,IAAI,MAAM,GAAG,MAAM,OAAO,OAAO;GACpC,MAAM,cAAc,KAAK;GACzB,IAAI,gBAAgB,GAAG;GACvB,KAAK,QAAS,cAAc;GAC5B,KAAK,MAAM,SAAU,cAAc;EACrC;EACA,OAAO;CACT;CAEA,MAAM,SAAS,SAAS;CACxB,IAAI,OAAO;CACX,IAAI,UAAU;CACd,IAAI,eAAe;CACnB,KAAK,IAAI,MAAM,GAAG,MAAM,OAAO,OAAO;EACpC,MAAM,cAAc,KAAK;EACzB,IAAI,gBAAgB,GAAG;EACvB,MAAM,YAAY,KAAK,IAAI,MAAM,MAAM;EACvC,IAAI,aAAa,kBAAkB,QAAQ;EAC3C,IAAI,YAAY,cAAc;GAC5B,eAAe;GACf,UAAU;EACZ,OAAO,IAAI,cAAc,cACvB,WAAW;CAEf;CACA,OAAO;EAAE,GAAG,KAAK,IAAI,GAAG,IAAI;EAAG,QAAQ,KAAK,IAAI,GAAG,OAAO;CAAE;AAC9D;;;;;;;;;;;;;;;;;;;;ACrbA,SAAgB,SAAS,MAA+B,MAAuC;CAC7F,MAAM,EAAE,aAAa,iBAAiB;CACtC,IAAI,gBAAgB,cAClB,MAAM,IAAI,gBACR,oDAAoD,YAAY,wCAClE;CAIF,MAAM,wBAAQ,IAAI,IAAyC;CAC3D,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,OAAO,MAAM;EACtB,SAAS,IAAI,IAAI,GAAG;EACpB,IAAI,IAAI,QAAQ,eAAe,IAAI,QAAQ,cAAc;EACzD,MAAM,QAAQ,MAAM,IAAI,IAAI,GAAG,qBAAK,IAAI,IAA4B;EACpE,MAAM,QAAQ,MAAM,IAAI,IAAI,OAAO,KAAK,CAAC;EACzC,MAAM,KAAK,GAAG;EACd,MAAM,IAAI,IAAI,SAAS,KAAK;EAC5B,MAAM,IAAI,IAAI,KAAK,KAAK;CAC1B;CAEA,KAAK,MAAM,OAAO,CAAC,aAAa,YAAY,GAC1C,IAAI,CAAC,MAAM,IAAI,GAAG,GAAG;EACnB,MAAM,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,KAAK;EAChD,MAAM,IAAI,gBAAgB,8BAA8B,IAAI,mBAAmB,KAAK,EAAE;CACxF;CAGF,MAAM,gBAAgB,MAAM,IAAI,WAAW;CAC3C,MAAM,iBAAiB,MAAM,IAAI,YAAY;CAE7C,MAAM,UAAU,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,cAAc,KAAK,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;CACvF,MAAM,QAAuB,CAAC;CAC9B,MAAM,mBAAmC,CAAC;CAC1C,MAAM,oBAAoC,CAAC;CAC3C,KAAK,MAAM,WAAW,SAAS;EAC7B,MAAM,IAAI,cAAc,IAAI,OAAO,KAAK,CAAC;EACzC,MAAM,IAAI,eAAe,IAAI,OAAO,KAAK,CAAC;EAE1C,IAAI,EAAE,UAAU,KAAK,EAAE,UAAU,GAAG;GAClC,IAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;IACpC,MAAM,WAAW,EAAE;IACnB,MAAM,YAAY,EAAE;IACpB,IAAI,SAAS,WAAW,KAAA,KAAa,UAAU,WAAW,KAAA,GAEtD;SAAA,SAAS,WAAW,KAAA,KACpB,UAAU,WAAW,KAAA,KACrB,SAAS,WAAW,UAAU,QAC9B;MACA,iBAAiB,KAAK,QAAQ;MAC9B,kBAAkB,KAAK,SAAS;MAChC;KACF;;IAEF,MAAM,KAAK;KAAE;KAAS,UAAU;KAAG;KAAU;IAAU,CAAC;GAC1D,OAAO;IACL,iBAAiB,KAAK,GAAG,CAAC;IAC1B,kBAAkB,KAAK,GAAG,CAAC;GAC7B;GACA;EACF;EAEA,MAAM,SAAS,cAAc,GAAG,SAAS,WAAW;EACpD,MAAM,SAAS,cAAc,GAAG,SAAS,YAAY;EACrD,MAAM,UAAU,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;EACxE,IAAI,WAAW;EACf,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,WAAW,OAAO,IAAI,MAAM;GAClC,MAAM,YAAY,OAAO,IAAI,MAAM;GACnC,IAAI,aAAa,KAAA,KAAa,cAAc,KAAA,GAC1C,MAAM,KAAK;IAAE;IAAS,UAAU;IAAY;IAAU;GAAU,CAAC;QAC5D,IAAI,aAAa,KAAA,GACtB,iBAAiB,KAAK,QAAQ;QACzB,IAAI,cAAc,KAAA,GACvB,kBAAkB,KAAK,SAAS;EAEpC;CACF;CAEA,OAAO;EAAE;EAAO;EAAkB;CAAkB;AACtD;;;AAIA,SAAS,cACP,OACA,SACA,KAC2B;CAC3B,MAAM,wBAAQ,IAAI,IAA0B;CAC5C,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,IAAI,WAAW,KAAA,GACjB,MAAM,IAAI,gBACR,sBAAsB,QAAQ,mDAAmD,IAAI,8KAGvF;EAEF,IAAI,MAAM,IAAI,IAAI,MAAM,GACtB,MAAM,IAAI,gBACR,+BAA+B,IAAI,OAAO,iBAAiB,QAAQ,YAAY,IAAI,iEAErF;EAEF,MAAM,IAAI,IAAI,QAAQ,GAAG;CAC3B;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;AAwEA,SAAgB,kBACd,MACA,MACsB;CACtB,MAAM,cACJ,KAAK,gBAAgB,KAAA,IAAY,KAAA,IAAY,sBAAsB,MAAM,KAAK,aAAa,IAAI;CACjG,MAAM,EAAE,OAAO,kBAAkB,sBAAsB,SAAS,aAAa,QAAQ,MAAM,IAAI;CAE/F,IAAI,cAAwC;CAC5C,MAAM,eAAyB,CAAC;CAChC,MAAM,gBAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,UAAU,QAAQ,MAAM;EAC/D,aAAa,KAAK,KAAK,SAAS,OAAO,IAAI,CAAC;EAC5C,cAAc,KAAK,KAAK,UAAU,OAAO,IAAI,CAAC;CAChD;CACA,IAAI,aAAa,SAAS,GAAG;EAC3B,MAAM,KAAK,QAAQ,cAAc,aAAa;EAC9C,cAAc;GACZ,KAAK,GAAG;GACR,KAAK,GAAG;GACR,SAAS;GACT,gBAAgB,qBAAqB,cAAc,aAAa;EAClE;CACF;CAaA,MAAM,gBAVJ,KAAK,eACL,CACE,GAAG,IAAI,IACL,MAAM,SAAS,MAAM,CACnB,GAAG,OAAO,KAAK,EAAE,SAAS,WAAW,CAAC,CAAC,GACvC,GAAG,OAAO,KAAK,EAAE,UAAU,WAAW,CAAC,CAAC,CAC1C,CAAC,CACH,CACF,CAAC,CAAC,KAAK,EAAA,CAE6C,KAAK,SAAS;EAClE,MAAM,SAAmB,CAAC;EAC1B,MAAM,QAAkB,CAAC;EACzB,IAAI,WAAW;EACf,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,IAAI,YAAY,KAAK,UAAU,IAAI;GACzC,MAAM,IAAI,YAAY,KAAK,WAAW,IAAI;GAC1C,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAAW;IACtC;IACA;GACF;GACA,OAAO,KAAK,CAAC;GACb,MAAM,KAAK,CAAC;EACd;EACA,MAAM,cAAc,OAAO,WAAW,IAAI,OAAO,gBAAgB,QAAQ,OAAO,KAAK,SAAS;EAC9F,OAAO;GACL;GACA,GAAG,OAAO;GACV;GACA,aAAa,aAAa,UAAU;GACpC,WAAW,aAAa,QAAQ;GAChC;GACA,UAAU,OAAO,WAAW,IAAI,OAAO,mBAAmB,QAAQ,KAAK;EACzE;CACF,CAAC;CAED,OAAO;EACL,GAAI,cAAc,EAAE,gBAAgB,YAAY,SAAS,IAAI,CAAC;EAC9D,QAAQ,MAAM;EACd,mBAAmB,iBAAiB;EACpC,oBAAoB,kBAAkB;EACtC;EACA;CACF;AACF;;;;;;;;AA2BA,SAAgB,eACd,cACA,eACsB;CACtB,MAAM,eAAe,iBAAiB,cAAc,UAAU;CAC9D,MAAM,gBAAgB,iBAAiB,eAAe,WAAW;CACjE,yBAAyB,cAAc,UAAU;CACjD,yBAAyB,eAAe,WAAW;CACnD,IAAI,aAAa,WAAW,KAAK,cAAc,WAAW,GACxD,OAAO;EACL,OAAO,CAAC;EACR,kBAAkB,aAAa,KAAK,QAAQ,IAAI,GAAG;EACnD,mBAAmB,cAAc,KAAK,QAAQ,IAAI,GAAG;CACvD;CAGF,MAAM,SAAS,SAAS,CAAC,GAAG,cAAc,GAAG,aAAa,GAAG;EAC3D,aAAa;EACb,cAAc;CAChB,CAAC;CACD,OAAO;EACL,OAAO,OAAO,MAAM,KAAK,SAAS;GAChC,MAAM,WAAW,KAAK;GACtB,MAAM,YAAY,KAAK;GACvB,OAAO;IACL,SAAS,KAAK;IACd,QAAQ,SAAS;IACjB,UAAU,SAAS;IACnB,WAAW,UAAU;GACvB;EACF,CAAC;EACD,kBAAkB,OAAO,iBAAiB,KAAK,QAAS,IAAwB,GAAG;EACnF,mBAAmB,OAAO,kBAAkB,KAAK,QAAS,IAAwB,GAAG;CACvF;AACF;AAEA,SAAS,iBAAiB,MAA4B,KAAgC;CACpF,OAAO,KAAK,KAAK,QAAQ;EACvB,MAAM,aAAa,IAAI,WAAW,KAAK;EACvC,IAAI,CAAC,YACH,MAAM,IAAI,gBACR,wBAAwB,IAAI,MAAM,+EACpC;EAEF,OAAO;GACL,SAAS,KAAK,UAAU,CAAC,IAAI,cAAc,UAAU,CAAC;GACtD,QAAQ,OAAO,IAAI,IAAI;GACvB;GACA;EACF;CACF,CAAC;AACH;AAEA,SAAS,yBAAyB,MAAkC,KAAmB;CACrF,MAAM,4BAAY,IAAI,IAA+B;CACrD,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,UAAU,IAAI,IAAI,OAAO,KAAK,CAAC;EAC7C,MAAM,KAAK,GAAG;EACd,UAAU,IAAI,IAAI,SAAS,KAAK;CAClC;CACA,KAAK,MAAM,CAAC,SAAS,UAAU,WAC7B,IAAI,MAAM,SAAS,GAAG,cAAc,OAAO,SAAS,GAAG;AAE3D;AAEA,SAAS,YAAY,KAAmB,MAAkC;CACxE,MAAM,IAAI,IAAI,UAAU;CACxB,IAAI,KAAK,MAAM,OAAO,KAAA;CACtB,IAAI,CAAC,OAAO,SAAS,CAAC,GACpB,MAAM,IAAI,gBACR,mDAAmD,KAAK,gBAAgB,IAAI,QAAQ,UAAU,IAAI,IAAI,MAAM,GAC9G;CAEF,OAAO;AACT"}

package/dist/{paired-binary-B_nejA44.js → paired-binary-BR0nwHOA.js}

@@ -1,5 +1,5 @@
-import { l as regularizedIncompleteBeta, r as binomialSignTwoSided, s as zQuantile } from "./internal-BTK91Bqt.js";
-//#region src/statistics/paired-binary.ts
+import { l as regularizedIncompleteBeta, r as binomialSignTwoSided, s as zQuantile } from "./internal-v6XfOeJW.js";
+// src/statistics/paired-binary.ts
 /**
 * Wilson score interval for a binomial proportion. Correct at small n and near
 * 0/1, where the normal (Wald) approximation produces bounds outside [0, 1] and
@@ -367,7 +367,6 @@ function passAtK(n, c, k) {
 	for (let i = n - c + 1; i <= n; i++) prob *= 1 - k / i;
 	return 1 - prob;
 }
-//#endregion
 export { pairedRiskDifferenceScore as a, pairedRiskDifferenceExact as i, pairedBinaryScale as n, passAtK as o, pairedRiskDifference as r, wilson as s, mcnemar as t };
 
-//# sourceMappingURL=paired-binary-B_nejA44.js.map
+//# sourceMappingURL=paired-binary-BR0nwHOA.js.map