@tangle-network/agent-eval 0.215.1 → 0.216.0

package/CHANGELOG.md

@@ -4,6 +4,18 @@ All notable changes to `@tangle-network/agent-eval` and its sibling `agent-eval-
 
 ---
 
+## [0.216.0] — 2026-10-20
+
+- factory: The pre-commit hook runs where no global hooks path is set (#1003)
+- factory: Every finding says its layer and the population it holds for (#1000)
+- test(python): retire obsolete facade-global sandbox mocks
+- refactor: preserve complete DSPy runtime source identity
+- refactor: separate analyst registry planning and execution
+- refactor: separate DSPy bridge validation and execution
+- refactor: separate search simulation responsibilities
+- fix: enforce shared file size ratchet through Husky
+- chore: ignore SQLite -shm/-wal beside test fixtures (#997)
+
 ## [0.215.1] — 2026-10-18
 
 - fix(gepa): preserve completed candidates at evaluation budget (#979)

package/dist/adapters/http.d.ts

@@ -1,6 +1,6 @@
 import { m as CostReceipt } from "../cost-ledger-CO7UyEcQ.js";
-import { R as Scenario, d as DispatchContext, f as DispatchFn } from "../types-CGEmVYOk.js";
-import "../index-B7m2uzJL.js";
+import { R as Scenario, d as DispatchContext, f as DispatchFn } from "../types-B4C5nFw6.js";
+import "../index-DlH0Y9gI.js";
 //#region src/adapters/http.d.ts
 export interface HttpDispatchOptions<TScenario extends Scenario, _TArtifact> {
   /** Static endpoint URL. Mutually exclusive with `resolveUrl`. */

package/dist/{agent-profile-DmzL8KaJ.d.ts → agent-profile-CIA2Atnt.d.ts}

@@ -1,7 +1,7 @@
 import { b as CustomTokenPricing, g as CostReceiptInput } from "./cost-ledger-CO7UyEcQ.js";
-import { O as TraceAnalysisStore, c as AnalystRunInputs, f as AnalystUsageReceipt, i as AnalystFinding, p as EvidenceRef } from "./types-DHb5TI36.js";
+import { X as TraceAnalysisStore, a as AnalystFinding, h as EvidenceRef, m as AnalystUsageReceipt, u as AnalystRunInputs } from "./types-oKRhQAde.js";
 import { C as ChatResponse, S as ChatRequest } from "./types-DBZ7keha.js";
-import { c as RegistryRunOpts, n as AnalystRegistry } from "./registry-CMYIaDgS.js";
+import { c as RegistryRunOpts, t as AnalystRegistry } from "./registry-JYfPxcVz.js";
 import { AgentProfile, AgentProfile as AgentProfile$1, HarnessType, HarnessType as HarnessType$1 } from "@tangle-network/agent-interface";
 //#region src/campaign/external-optimizer-contracts.d.ts
 interface ExternalOptimizerProcessLimits {
@@ -485,4 +485,4 @@ declare function agentProfileId(profile: AgentProfile): string;
 declare function agentProfileHash(profile: AgentProfile): string;
 //#endregion
 export { runAnalystBenchmark as A, ExternalOptimizerModelBudget as B, AnalystEvidenceResolutionError as C, AnalystLatencyDistribution as D, AnalystIssueExpectation as E, ExternalOptimizerCallbackLimits as F, ExternalOptimizerProcessLimits as G, ExternalOptimizerModelCallRequest as H, ExternalOptimizerChatRequest as I, ExternalOptimizerWireCounts as J, ExternalOptimizerResumeMode as K, ExternalOptimizerEndpointFormat as L, scoreAnalystFindings as M, DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS as N, RunAnalystBenchmarkOptions as O, DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS as P, resolveExternalOptimizerProcessLimits as Q, ExternalOptimizerEvaluationObservation as R, AnalystEvidenceResolution as S, AnalystFindingScore as T, ExternalOptimizerModelCallResult as U, ExternalOptimizerModelCall as V, ExternalOptimizerModelExecutionObservation as W, ExternalTextEvaluationRequest as X, ExternalTextCandidate as Y, resolveExternalOptimizerCallbackLimits as Z, AnalystBenchmarkProvenance as _, ProfileAxisSpec as a, AnalystBenchmarkSummary as b, expandProfileAxes as c, AnalystBenchmarkDatasetRef as d, AnalystBenchmarkDescriptor as f, AnalystBenchmarkOutput as g, AnalystBenchmarkObservation as h, HarnessType$1 as i, traceStoreEvidenceResolver as j, registryBenchmarkRunner as k, harnessAxisOf as l, AnalystBenchmarkLabelState as m, CODING_HARNESSES as n, agentProfileHash as o, AnalystBenchmarkError as p, ExternalOptimizerRunnerCommand as q, HARNESS_NATIVE_MODEL as r, agentProfileId as s, AgentProfile$1 as t, AnalystBenchmarkCase as u, AnalystBenchmarkResult as v, AnalystEvidenceResolver as w, AnalystEvidenceExpectation as x, AnalystBenchmarkRunner as y, ExternalOptimizerEvaluationRefusalReason as z };
-//# sourceMappingURL=agent-profile-DmzL8KaJ.d.ts.map
+//# sourceMappingURL=agent-profile-CIA2Atnt.d.ts.map

package/dist/{agent-profile-DmzL8KaJ.d.ts.map → agent-profile-CIA2Atnt.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"agent-profile-DmzL8KaJ.d.ts","names":["_$___cost_ledger0.CostReceiptInput"],"sources":["../src/campaign/external-optimizer-contracts.ts","../src/analyst/benchmark-scoring.ts","../src/analyst/benchmark.ts","../src/agent-profile.ts"],"mappings":";;;;;;UAWiB;;EAEf;;EAEA;;EAEA;;cAGW,2CAA2C,SAAS;UAOhD;;EAEf;;EAEA;;cAGW,4CAA4C,SAAS;UAMjD;EACf;EACA;EACA,MAAM,OAAO;;EAEb,SAAS,QAAQ;;KAGP;KAEA,iCAAiC;UAE5B;EACf,WAAW;EACX;;iBAUc,sCACd,OAAO,QAAQ,6CACf,iBACC;iBAmBa,uCACd,OAAO,QAAQ,8CACf,iBACC;KAkBE,aAAa,KAAK,eAAc,6BACjC,IACA,0BAA0B,gBACf,aAAa,OACtB,+BACc,WAAW,IAAI,aAAa,EAAE,SAC1C;;KAGI,+BAA+B,aACzC,KAAK;EAA0B;;KAGrB;;UAMK;;WAEN;;WAEA,SAAS;;WAET,iBAAiB;WACjB,QAAQ;;;KAIP;WAEG;;WAEA,UAAU;;;;;;;WAOV,SAPUA;;WASV;;WAGA;;WAEA;;WAEA,SATkCA;;WAWlC;;;;;;;;;;;;KAaH,8BACV,SAAS,sCACN,QAAQ;;KAGD;WAEG;WACA;WACA;WACA;WACA;WACA;WACA;WACA;;WAGA;WACA;WACA;WACA;WACA;WACA;WACA;WACA;;KAGH;;;;;;KAUA;WAEG;WACA;WACA,WAAW;WACX;;WAGA;WACA;WACA,WAAW;WACX;WACA;;WAEA;WACA;;WAGA;WACA;WACA,QAAQ;WACR,YAAY;WACZ;WACA;;UAGE;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;;;;EAUA;;;;;;EAMA,UAAU;;EAEV;;;UAIe;;EAEf;;EAEA;;;;iBCtQc,qBACd,UAAU,KAAK,oEACf,mBAAmB,mBAClB;;;UCIc;EACf;EACA,OAAO;;UAGQ;EACf;EACA;EACA;EACA;EACA,oBAAoB;EACpB;;EAEA,4BAA4B;;KAGlB;UAEK,qBAAqB;EACpC;;EAEA;;EAEA,YAAY;EACZ,OAAO;EACP,yBAAyB;;EAEzB,2BAA2B;EAC3B;EACA,WAAW;;UAGI;EACf;EACA;EACA;EACA;EACA;EACA,mBAAmB;EACnB;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;EACA;;UAGe;EACf,UAAU;EACV;EACA;;UAGe;EACf;EACA;EACA,oBAAoB;EACpB,QAAQ;;EAER;;KAGU,wBAAwB,qBAAqB;EACvD;EACA,WAAW;EACX,UAAU;EACV,SAAS;gBACK;;;;;iBAMA,2BAA2B,QACzC,WAAW,OAAO,WAAW,qBAC5B,wBAAwB;UAoBV;EACf,mBAAmB;EACnB,QAAQ;EACR,WAAW;;;;;EAKX;;EAEA,QAAQ;;UAGO;EACf;EACA;EACA;EACA;;UAGe,uBAAuB;EACtC;EACA,QACE,OAAO,QACP;IAAW;IAAgB;IAAoB,SAAS;MACvD,yBAAyB,QAAQ;;UAGrB;EACf;EACA;EACA;EACA,YAAY;EACZ;EACA;EACA;EACA;EACA,mBAAmB;EACnB,OAAO;EACP,qBAAqB;EACrB;EACA,eAAe;EACf,QAAQ;EACR,iBAAiB;EACjB,QAAQ;;UAGO;EACf;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;EACA,WAAW;EACX;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;;UAGe;EACf;EACA,UAAU;EACV;EACA,cAAc;EACd,WAAW;;UAGI,mCAAmC;EAClD;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf,YAAY;EACZ,cAAc;EACd,WAAW;;UAGI,2BAA2B;EAC1C,gBAAgB,qBAAqB;EACrC,kBAAkB,uBAAuB;EACzC;EACA;EACA;EACA,kBAAkB,wBAAwB;EAC1C,YAAY;;EAEZ,+BAA+B;EAC/B,iBAAiB,aAAa,uCAAuC;EACrE,SAAS;;iBAGW,oBAAoB,QACxC,SAAS,2BAA2B,UACnC,QAAQ;iBAyDK,wBAAwB;EACtC;EACA,UAAU;EACV,aAAa,KAAK;;EAElB;IACE,uBAAuB;;;;;;;;;;cCpUd,2BAA2B;UAOvB;;;EAGf,MAAM;;EAEN,qBAAqB;;;EAGrB;;;;;;EAMA;;;;;;;cAQW;;;;;;;;;;;;;;;;;;;iBAoBG,kBAAkB,MAAM,kBAAkB;;;;;;;;iBAwD1C,cACd,SAAS,KAAK;EACX,SAAS;EAAa;;;;;;;;;iBAiBX,eAAe,SAAS;;;;;;;;;;;iBAmDxB,iBAAiB,SAAS"}
+{"version":3,"file":"agent-profile-CIA2Atnt.d.ts","names":["_$___cost_ledger0.CostReceiptInput"],"sources":["../src/campaign/external-optimizer-contracts.ts","../src/analyst/benchmark-scoring.ts","../src/analyst/benchmark.ts","../src/agent-profile.ts"],"mappings":";;;;;;UAWiB;;EAEf;;EAEA;;EAEA;;cAGW,2CAA2C,SAAS;UAOhD;;EAEf;;EAEA;;cAGW,4CAA4C,SAAS;UAMjD;EACf;EACA;EACA,MAAM,OAAO;;EAEb,SAAS,QAAQ;;KAGP;KAEA,iCAAiC;UAE5B;EACf,WAAW;EACX;;iBAUc,sCACd,OAAO,QAAQ,6CACf,iBACC;iBAmBa,uCACd,OAAO,QAAQ,8CACf,iBACC;KAkBE,aAAa,KAAK,eAAc,6BACjC,IACA,0BAA0B,gBACf,aAAa,OACtB,+BACc,WAAW,IAAI,aAAa,EAAE,SAC1C;;KAGI,+BAA+B,aACzC,KAAK;EAA0B;;KAGrB;;UAMK;;WAEN;;WAEA,SAAS;;WAET,iBAAiB;WACjB,QAAQ;;;KAIP;WAEG;;WAEA,UAAU;;;;;;;WAOV,SAPUA;;WASV;;WAGA;;WAEA;;WAEA,SATkCA;;WAWlC;;;;;;;;;;;;KAaH,8BACV,SAAS,sCACN,QAAQ;;KAGD;WAEG;WACA;WACA;WACA;WACA;WACA;WACA;WACA;;WAGA;WACA;WACA;WACA;WACA;WACA;WACA;WACA;;KAGH;;;;;;KAUA;WAEG;WACA;WACA,WAAW;WACX;;WAGA;WACA;WACA,WAAW;WACX;WACA;;WAEA;WACA;;WAGA;WACA;WACA,QAAQ;WACR,YAAY;WACZ;WACA;;UAGE;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;;;;EAUA;;;;;;EAMA,UAAU;;EAEV;;;UAIe;;EAEf;;EAEA;;;;iBCtQc,qBACd,UAAU,KAAK,oEACf,mBAAmB,mBAClB;;;UCIc;EACf;EACA,OAAO;;UAGQ;EACf;EACA;EACA;EACA;EACA,oBAAoB;EACpB;;EAEA,4BAA4B;;KAGlB;UAEK,qBAAqB;EACpC;;EAEA;;EAEA,YAAY;EACZ,OAAO;EACP,yBAAyB;;EAEzB,2BAA2B;EAC3B;EACA,WAAW;;UAGI;EACf;EACA;EACA;EACA;EACA;EACA,mBAAmB;EACnB;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;EACA;;UAGe;EACf,UAAU;EACV;EACA;;UAGe;EACf;EACA;EACA,oBAAoB;EACpB,QAAQ;;EAER;;KAGU,wBAAwB,qBAAqB;EACvD;EACA,WAAW;EACX,UAAU;EACV,SAAS;gBACK;;;;;iBAMA,2BAA2B,QACzC,WAAW,OAAO,WAAW,qBAC5B,wBAAwB;UAoBV;EACf,mBAAmB;EACnB,QAAQ;EACR,WAAW;;;;;EAKX;;EAEA,QAAQ;;UAGO;EACf;EACA;EACA;EACA;;UAGe,uBAAuB;EACtC;EACA,QACE,OAAO,QACP;IAAW;IAAgB;IAAoB,SAAS;MACvD,yBAAyB,QAAQ;;UAGrB;EACf;EACA;EACA;EACA,YAAY;EACZ;EACA;EACA;EACA;EACA,mBAAmB;EACnB,OAAO;EACP,qBAAqB;EACrB;EACA,eAAe;EACf,QAAQ;EACR,iBAAiB;EACjB,QAAQ;;UAGO;EACf;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;EACA,WAAW;EACX;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;;UAGe;EACf;EACA,UAAU;EACV;EACA,cAAc;EACd,WAAW;;UAGI,mCAAmC;EAClD;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf,YAAY;EACZ,cAAc;EACd,WAAW;;UAGI,2BAA2B;EAC1C,gBAAgB,qBAAqB;EACrC,kBAAkB,uBAAuB;EACzC;EACA;EACA;EACA,kBAAkB,wBAAwB;EAC1C,YAAY;;EAEZ,+BAA+B;EAC/B,iBAAiB,aAAa,uCAAuC;EACrE,SAAS;;iBAGW,oBAAoB,QACxC,SAAS,2BAA2B,UACnC,QAAQ;iBAyDK,wBAAwB;EACtC;EACA,UAAU;EACV,aAAa,KAAK;;EAElB;IACE,uBAAuB;;;;;;;;;;cCpUd,2BAA2B;UAOvB;;;EAGf,MAAM;;EAEN,qBAAqB;;;EAGrB;;;;;;EAMA;;;;;;;cAQW;;;;;;;;;;;;;;;;;;;iBAoBG,kBAAkB,MAAM,kBAAkB;;;;;;;;iBAwD1C,cACd,SAAS,KAAK;EACX,SAAS;EAAa;;;;;;;;;iBAiBX,eAAe,SAAS;;;;;;;;;;;iBAmDxB,iBAAiB,SAAS"}

package/dist/agreement-irr-DsTURxdr.js

@@ -0,0 +1,186 @@
+import { s as ValidationError } from "./errors-Dngq5h35.js";
+import { r as continuousAgreement } from "./judge-calibration-N44V04Se.js";
+//#region src/statistics/agreement-irr.ts
+/**
+* Inter-rater reliability — Krippendorff's α under the squared-difference
+* metric, pooled across dimensions.
+*
+* Each inner array is one judge's scores. Items are matched by position
+* WITHIN a dimension: the k-th score a judge supplies carrying dimension
+* `d` is item k of `d`, and the ratings compared against each other are
+* the ones different judges gave to the same item. Every judge that scores
+* a dimension at all must supply the same number of scores for it —
+* ragged input cannot be aligned into items and throws rather than
+* comparing mismatched items.
+*
+* α = 1 − D_observed / D_expected: D_observed averages the squared
+* difference over within-item judge pairs, D_expected over every pair of
+* ratings irrespective of item. α = 1 is perfect agreement, 0 is chance,
+* negative is systematic disagreement.
+*/
+function interRaterReliability(judgeScores) {
+	if (judgeScores.length < 2) return 1;
+	const perDimension = /* @__PURE__ */ new Map();
+	for (let judgeIndex = 0; judgeIndex < judgeScores.length; judgeIndex++) for (const s of judgeScores[judgeIndex]) {
+		let byJudge = perDimension.get(s.dimension);
+		if (byJudge === void 0) {
+			byJudge = Array.from({ length: judgeScores.length }, () => []);
+			perDimension.set(s.dimension, byJudge);
+		}
+		byJudge[judgeIndex].push(s.score);
+	}
+	const allValues = [];
+	const pairDiffs = [];
+	for (const [dimension, byJudge] of perDimension) {
+		const scoring = byJudge.filter((scores) => scores.length > 0);
+		if (scoring.length < 2) continue;
+		const itemCount = scoring[0].length;
+		if (scoring.some((scores) => scores.length !== itemCount)) throw new ValidationError(`interRaterReliability: dimension '${dimension}' has judges supplying ${scoring.map((scores) => scores.length).join("/")} scores — items cannot be aligned`);
+		for (let item = 0; item < itemCount; item++) {
+			const ratings = scoring.map((scores) => scores[item]);
+			for (const v of ratings) allValues.push(v);
+			for (let i = 0; i < ratings.length; i++) for (let j = i + 1; j < ratings.length; j++) pairDiffs.push((ratings[i] - ratings[j]) ** 2);
+		}
+	}
+	if (pairDiffs.length === 0 || allValues.length < 2) return 1;
+	const observedDisagreement = pairDiffs.reduce((a, b) => a + b, 0) / pairDiffs.length;
+	let expectedDisagreement = 0;
+	let expectedCount = 0;
+	for (let i = 0; i < allValues.length; i++) for (let j = i + 1; j < allValues.length; j++) {
+		expectedDisagreement += (allValues[i] - allValues[j]) ** 2;
+		expectedCount++;
+	}
+	expectedDisagreement = expectedCount > 0 ? expectedDisagreement / expectedCount : 0;
+	if (expectedDisagreement === 0) return 1;
+	return 1 - observedDisagreement / expectedDisagreement;
+}
+/**
+* Corpus-wide inter-rater agreement across N items × M judges × D dimensions.
+*
+* For each dimension, builds the [n_items][n_judges] matrix of scores
+* (keeping only items every judge rated on that dimension), then runs
+* `continuousAgreement` to get ICC(2,1), κ_w, Pearson, Spearman, and
+* bootstrap CIs. Reports a pooled mean across dimensions as a single
+* "is this judge panel reliable on this corpus?" number.
+*
+* Fail-loud contract:
+*   - Empty input throws.
+*   - Fewer than 2 judges or fewer than 2 items per dimension throws.
+*   - A judge present in some dimensions but with zero scored items on
+*     another dimension throws (would silently shrink the matrix).
+*   - Duplicate (itemId, judgeName, dimension) records throw.
+*/
+function corpusInterRaterAgreement(records, opts = {}) {
+	if (records.length === 0) throw new ValidationError("corpusInterRaterAgreement: no score records supplied");
+	const judgesSeen = /* @__PURE__ */ new Set();
+	const dimsSeen = /* @__PURE__ */ new Set();
+	const grid = /* @__PURE__ */ new Map();
+	for (const r of records) {
+		if (!Number.isFinite(r.score)) throw new ValidationError(`corpusInterRaterAgreement: non-finite score for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`);
+		judgesSeen.add(r.judgeName);
+		dimsSeen.add(r.dimension);
+		const byJudge = grid.get(r.dimension) ?? /* @__PURE__ */ new Map();
+		const byItem = byJudge.get(r.judgeName) ?? /* @__PURE__ */ new Map();
+		if (byItem.has(r.itemId)) throw new ValidationError(`corpusInterRaterAgreement: duplicate record for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`);
+		byItem.set(r.itemId, r.score);
+		byJudge.set(r.judgeName, byItem);
+		grid.set(r.dimension, byJudge);
+	}
+	const targetDims = opts.dimensions ?? [...dimsSeen].sort();
+	for (const d of targetDims) if (!dimsSeen.has(d)) throw new ValidationError(`corpusInterRaterAgreement: dimension '${d}' was requested but no records carry it`);
+	const targetJudges = opts.judges ? [...opts.judges] : [...judgesSeen].sort();
+	for (const j of targetJudges) if (!judgesSeen.has(j)) throw new ValidationError(`corpusInterRaterAgreement: judge '${j}' was requested but produced no records`);
+	if (targetJudges.length < 2) throw new ValidationError(`corpusInterRaterAgreement: need ≥2 judges, got ${targetJudges.length}`);
+	const perDimension = [];
+	const iccs = [];
+	const kappas = [];
+	for (const dim of targetDims) {
+		const byJudge = grid.get(dim);
+		const judgeItemCounts = {};
+		for (const j of targetJudges) judgeItemCounts[j] = byJudge.get(j)?.size ?? 0;
+		const emptyJudges = targetJudges.filter((j) => judgeItemCounts[j] === 0);
+		if (emptyJudges.length > 0) throw new ValidationError(`corpusInterRaterAgreement: dimension '${dim}' has no scores from judge(s) ${emptyJudges.join(", ")} (counts: ${JSON.stringify(judgeItemCounts)})`);
+		let commonItems = null;
+		for (const j of targetJudges) {
+			const ids = new Set(byJudge.get(j).keys());
+			if (commonItems === null) commonItems = ids;
+			else commonItems = new Set([...commonItems].filter((x) => ids.has(x)));
+		}
+		const sortedItems = [...commonItems ?? /* @__PURE__ */ new Set()].sort();
+		if (sortedItems.length < 2) throw new ValidationError(`corpusInterRaterAgreement: dimension '${dim}' has ${sortedItems.length} item(s) rated by all ${targetJudges.length} judges (need ≥2)`);
+		const matrix = sortedItems.map((itemId) => targetJudges.map((j) => byJudge.get(j).get(itemId)));
+		const agreement = continuousAgreement(matrix, opts);
+		perDimension.push({
+			...agreement,
+			dimension: dim,
+			itemIds: sortedItems,
+			judgeIds: [...targetJudges]
+		});
+		if (Number.isFinite(agreement.icc)) iccs.push(agreement.icc);
+		if (Number.isFinite(agreement.weightedKappa)) kappas.push(agreement.weightedKappa);
+	}
+	const mean = (xs) => xs.length === 0 ? NaN : xs.reduce((a, b) => a + b, 0) / xs.length;
+	return {
+		perDimension,
+		overallIcc: mean(iccs),
+		overallWeightedKappa: mean(kappas),
+		dimensions: targetDims,
+		judgeIds: targetJudges
+	};
+}
+/**
+* Convenience adapter for `JudgeScore[]` data keyed externally by item.
+*
+* Use when you have per-item arrays of `JudgeScore[]` (e.g. one
+* `ScenarioResult.judgeScores` per scenario) and want corpus-wide
+* agreement without manually flattening. `itemId` must be unique per
+* row of `itemsScores`.
+*/
+function corpusInterRaterAgreementFromJudgeScores(itemsScores, opts = {}) {
+	const records = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (const { itemId, scores } of itemsScores) {
+		if (seen.has(itemId)) throw new ValidationError(`corpusInterRaterAgreementFromJudgeScores: duplicate itemId '${itemId}'`);
+		seen.add(itemId);
+		for (const s of scores) records.push({
+			itemId,
+			judgeName: s.judgeName,
+			dimension: s.dimension,
+			score: s.score
+		});
+	}
+	return corpusInterRaterAgreement(records, opts);
+}
+/**
+* Unweighted Cohen's κ for paired nominal labels. Labels carry no order, so a
+* near miss counts as a miss; use `calibrateJudge` for ordinal scores.
+*/
+function nominalAgreement(pairs) {
+	const n = pairs.length;
+	if (n === 0) return {
+		n: 0,
+		agreement: NaN,
+		kappa: NaN
+	};
+	const left = /* @__PURE__ */ new Map();
+	const right = /* @__PURE__ */ new Map();
+	let same = 0;
+	for (const [a, b] of pairs) {
+		if (typeof a !== "string" || typeof b !== "string") throw new ValidationError("nominalAgreement: every label must be a string");
+		if (a === b) same += 1;
+		left.set(a, (left.get(a) ?? 0) + 1);
+		right.set(b, (right.get(b) ?? 0) + 1);
+	}
+	const observed = same / n;
+	let expected = 0;
+	for (const [label, count] of left) expected += count / n * ((right.get(label) ?? 0) / n);
+	return {
+		n,
+		agreement: observed,
+		kappa: expected === 1 ? NaN : (observed - expected) / (1 - expected)
+	};
+}
+//#endregion
+export { nominalAgreement as i, corpusInterRaterAgreementFromJudgeScores as n, interRaterReliability as r, corpusInterRaterAgreement as t };
+
+//# sourceMappingURL=agreement-irr-DsTURxdr.js.map

package/dist/agreement-irr-DsTURxdr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agreement-irr-DsTURxdr.js","names":["prev"],"sources":["../src/statistics/agreement-irr.ts"],"sourcesContent":["import { ValidationError } from '../errors'\nimport {\n  type ContinuousAgreement,\n  type ContinuousAgreementOptions,\n  continuousAgreement,\n} from '../judge-calibration'\nimport type { JudgeScore } from '../types'\n\n/**\n * Inter-rater reliability — Krippendorff's α under the squared-difference\n * metric, pooled across dimensions.\n *\n * Each inner array is one judge's scores. Items are matched by position\n * WITHIN a dimension: the k-th score a judge supplies carrying dimension\n * `d` is item k of `d`, and the ratings compared against each other are\n * the ones different judges gave to the same item. Every judge that scores\n * a dimension at all must supply the same number of scores for it —\n * ragged input cannot be aligned into items and throws rather than\n * comparing mismatched items.\n *\n * α = 1 − D_observed / D_expected: D_observed averages the squared\n * difference over within-item judge pairs, D_expected over every pair of\n * ratings irrespective of item. α = 1 is perfect agreement, 0 is chance,\n * negative is systematic disagreement.\n */\nexport function interRaterReliability(judgeScores: JudgeScore[][]): number {\n  if (judgeScores.length < 2) return 1\n\n  // dimension → one score sequence per judge, in that judge's supplied order.\n  const perDimension = new Map<string, number[][]>()\n  for (let judgeIndex = 0; judgeIndex < judgeScores.length; judgeIndex++) {\n    for (const s of judgeScores[judgeIndex]!) {\n      let byJudge = perDimension.get(s.dimension)\n      if (byJudge === undefined) {\n        byJudge = Array.from({ length: judgeScores.length }, () => [] as number[])\n        perDimension.set(s.dimension, byJudge)\n      }\n      byJudge[judgeIndex]!.push(s.score)\n    }\n  }\n\n  const allValues: number[] = []\n  const pairDiffs: number[] = []\n\n  for (const [dimension, byJudge] of perDimension) {\n    const scoring = byJudge.filter((scores) => scores.length > 0)\n    if (scoring.length < 2) continue\n    const itemCount = scoring[0]!.length\n    if (scoring.some((scores) => scores.length !== itemCount)) {\n      throw new ValidationError(\n        `interRaterReliability: dimension '${dimension}' has judges supplying ` +\n          `${scoring.map((scores) => scores.length).join('/')} scores — items cannot be aligned`,\n      )\n    }\n    for (let item = 0; item < itemCount; item++) {\n      const ratings = scoring.map((scores) => scores[item]!)\n      for (const v of ratings) allValues.push(v)\n      for (let i = 0; i < ratings.length; i++) {\n        for (let j = i + 1; j < ratings.length; j++) {\n          pairDiffs.push((ratings[i]! - ratings[j]!) ** 2)\n        }\n      }\n    }\n  }\n\n  if (pairDiffs.length === 0 || allValues.length < 2) return 1\n\n  const observedDisagreement = pairDiffs.reduce((a, b) => a + b, 0) / pairDiffs.length\n\n  // Expected disagreement from all possible pairings of values\n  let expectedDisagreement = 0\n  let expectedCount = 0\n  for (let i = 0; i < allValues.length; i++) {\n    for (let j = i + 1; j < allValues.length; j++) {\n      expectedDisagreement += (allValues[i]! - allValues[j]!) ** 2\n      expectedCount++\n    }\n  }\n  expectedDisagreement = expectedCount > 0 ? expectedDisagreement / expectedCount : 0\n\n  if (expectedDisagreement === 0) return 1\n  return 1 - observedDisagreement / expectedDisagreement\n}\n\n// ── Corpus-wide inter-rater agreement ──────────────────────────────\n//\n// `interRaterReliability(judgeScores)` computes a within-item\n// Krippendorff α — multiple judges score *the same item* and we ask\n// \"how much do their scores agree on that item?\" Useful for a single\n// scenario, but it cannot answer \"how reliable are these judges across\n// the whole evaluation corpus?\"\n//\n// `corpusInterRaterAgreement` does the corpus-wide question properly.\n// Inputs are flat per-(item, judge, dimension) score records. For each\n// dimension we pivot to a complete [n_items × n_judges] matrix and feed\n// it to the ICC(2,1) + κ_w machinery already validated in\n// `judge-calibration.ts`. An overall pooled metric averages the\n// per-dimension ICC/κ across dimensions.\n\nexport interface CorpusScoreRecord {\n  /** Stable identifier for the rated item (scenario, span, turn, …). */\n  itemId: string\n  /** Identifier for the judge that produced this score. */\n  judgeName: string\n  /** Dimension name (matches `JudgeScore.dimension`). */\n  dimension: string\n  /** Numeric score; must be finite. */\n  score: number\n}\n\nexport interface CorpusAgreementPerDimension extends ContinuousAgreement {\n  dimension: string\n  /** Item IDs that contributed to this dimension's matrix (every judge scored them). */\n  itemIds: string[]\n  /** Judge IDs that contributed to this dimension's matrix. */\n  judgeIds: string[]\n}\n\nexport interface CorpusAgreementReport {\n  /** Per-dimension ICC(2,1) + κ_w + Pearson + Spearman + bootstrap CIs. */\n  perDimension: CorpusAgreementPerDimension[]\n  /** Mean ICC across dimensions (NaN if no dimension yielded a finite ICC). */\n  overallIcc: number\n  /** Mean weighted κ across dimensions (NaN if none finite). */\n  overallWeightedKappa: number\n  /** Dimensions evaluated (sorted). */\n  dimensions: string[]\n  /** Judges seen across the corpus (sorted). */\n  judgeIds: string[]\n}\n\nexport interface CorpusAgreementOptions extends ContinuousAgreementOptions {\n  /**\n   * Restrict the audit to these dimensions. Default = every dimension\n   * that appears in the input. A dimension named here but absent from\n   * the input throws — silent omission would corrupt the overall metric.\n   */\n  dimensions?: string[]\n  /**\n   * Restrict the audit to these judges. Default = every judge that\n   * appears in the input. A judge named here but absent from a\n   * dimension throws (see \"fail loud\" below).\n   */\n  judges?: string[]\n}\n\n/**\n * Corpus-wide inter-rater agreement across N items × M judges × D dimensions.\n *\n * For each dimension, builds the [n_items][n_judges] matrix of scores\n * (keeping only items every judge rated on that dimension), then runs\n * `continuousAgreement` to get ICC(2,1), κ_w, Pearson, Spearman, and\n * bootstrap CIs. Reports a pooled mean across dimensions as a single\n * \"is this judge panel reliable on this corpus?\" number.\n *\n * Fail-loud contract:\n *   - Empty input throws.\n *   - Fewer than 2 judges or fewer than 2 items per dimension throws.\n *   - A judge present in some dimensions but with zero scored items on\n *     another dimension throws (would silently shrink the matrix).\n *   - Duplicate (itemId, judgeName, dimension) records throw.\n */\nexport function corpusInterRaterAgreement(\n  records: CorpusScoreRecord[],\n  opts: CorpusAgreementOptions = {},\n): CorpusAgreementReport {\n  if (records.length === 0) {\n    throw new ValidationError('corpusInterRaterAgreement: no score records supplied')\n  }\n\n  const judgesSeen = new Set<string>()\n  const dimsSeen = new Set<string>()\n  // dimension → judge → itemId → score\n  const grid = new Map<string, Map<string, Map<string, number>>>()\n\n  for (const r of records) {\n    if (!Number.isFinite(r.score)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: non-finite score for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`,\n      )\n    }\n    judgesSeen.add(r.judgeName)\n    dimsSeen.add(r.dimension)\n    const byJudge = grid.get(r.dimension) ?? new Map<string, Map<string, number>>()\n    const byItem = byJudge.get(r.judgeName) ?? new Map<string, number>()\n    if (byItem.has(r.itemId)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: duplicate record for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`,\n      )\n    }\n    byItem.set(r.itemId, r.score)\n    byJudge.set(r.judgeName, byItem)\n    grid.set(r.dimension, byJudge)\n  }\n\n  const targetDims = opts.dimensions ?? [...dimsSeen].sort()\n  for (const d of targetDims) {\n    if (!dimsSeen.has(d)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${d}' was requested but no records carry it`,\n      )\n    }\n  }\n  const targetJudges = opts.judges ? [...opts.judges] : [...judgesSeen].sort()\n  for (const j of targetJudges) {\n    if (!judgesSeen.has(j)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: judge '${j}' was requested but produced no records`,\n      )\n    }\n  }\n  if (targetJudges.length < 2) {\n    throw new ValidationError(\n      `corpusInterRaterAgreement: need ≥2 judges, got ${targetJudges.length}`,\n    )\n  }\n\n  const perDimension: CorpusAgreementPerDimension[] = []\n  const iccs: number[] = []\n  const kappas: number[] = []\n\n  for (const dim of targetDims) {\n    const byJudge = grid.get(dim)!\n    // Fail loud: every requested judge must have scored ≥1 item on this dim.\n    const judgeItemCounts: Record<string, number> = {}\n    for (const j of targetJudges) {\n      const m = byJudge.get(j)\n      judgeItemCounts[j] = m?.size ?? 0\n    }\n    const emptyJudges = targetJudges.filter((j) => judgeItemCounts[j] === 0)\n    if (emptyJudges.length > 0) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${dim}' has no scores from judge(s) ${emptyJudges.join(', ')} (counts: ${JSON.stringify(judgeItemCounts)})`,\n      )\n    }\n\n    // Items rated by *every* requested judge on this dim.\n    let commonItems: Set<string> | null = null\n    for (const j of targetJudges) {\n      const ids = new Set(byJudge.get(j)!.keys())\n      if (commonItems === null) {\n        commonItems = ids\n      } else {\n        const prev: Set<string> = commonItems\n        commonItems = new Set([...prev].filter((x) => ids.has(x)))\n      }\n    }\n    const sortedItems = [...(commonItems ?? new Set<string>())].sort()\n    if (sortedItems.length < 2) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${dim}' has ${sortedItems.length} item(s) rated by all ${targetJudges.length} judges (need ≥2)`,\n      )\n    }\n\n    const matrix: number[][] = sortedItems.map((itemId) =>\n      targetJudges.map((j) => byJudge.get(j)!.get(itemId)!),\n    )\n    const agreement = continuousAgreement(matrix, opts)\n    perDimension.push({\n      ...agreement,\n      dimension: dim,\n      itemIds: sortedItems,\n      judgeIds: [...targetJudges],\n    })\n    if (Number.isFinite(agreement.icc)) iccs.push(agreement.icc)\n    if (Number.isFinite(agreement.weightedKappa)) kappas.push(agreement.weightedKappa)\n  }\n\n  const mean = (xs: number[]) =>\n    xs.length === 0 ? Number.NaN : xs.reduce((a, b) => a + b, 0) / xs.length\n  return {\n    perDimension,\n    overallIcc: mean(iccs),\n    overallWeightedKappa: mean(kappas),\n    dimensions: targetDims,\n    judgeIds: targetJudges,\n  }\n}\n\n/**\n * Convenience adapter for `JudgeScore[]` data keyed externally by item.\n *\n * Use when you have per-item arrays of `JudgeScore[]` (e.g. one\n * `ScenarioResult.judgeScores` per scenario) and want corpus-wide\n * agreement without manually flattening. `itemId` must be unique per\n * row of `itemsScores`.\n */\nexport function corpusInterRaterAgreementFromJudgeScores(\n  itemsScores: Array<{ itemId: string; scores: JudgeScore[] }>,\n  opts: CorpusAgreementOptions = {},\n): CorpusAgreementReport {\n  const records: CorpusScoreRecord[] = []\n  const seen = new Set<string>()\n  for (const { itemId, scores } of itemsScores) {\n    if (seen.has(itemId)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreementFromJudgeScores: duplicate itemId '${itemId}'`,\n      )\n    }\n    seen.add(itemId)\n    for (const s of scores) {\n      records.push({\n        itemId,\n        judgeName: s.judgeName,\n        dimension: s.dimension,\n        score: s.score,\n      })\n    }\n  }\n  return corpusInterRaterAgreement(records, opts)\n}\n\n/** Agreement between two raters who each assigned one nominal label per item. */\nexport interface NominalAgreement {\n  /** Items both raters labeled. */\n  n: number\n  /** Share of items with identical labels. */\n  agreement: number\n  /**\n   * Cohen's κ = (pₒ − pₑ) / (1 − pₑ), with pₑ from each rater's own label\n   * marginals. NaN when n = 0, or when both raters used one identical label\n   * for every item (pₑ = 1): chance and observed agreement are then the same\n   * thing, and no number distinguishes skill from luck.\n   */\n  kappa: number\n}\n\n/**\n * Unweighted Cohen's κ for paired nominal labels. Labels carry no order, so a\n * near miss counts as a miss; use `calibrateJudge` for ordinal scores.\n */\nexport function nominalAgreement(\n  pairs: ReadonlyArray<readonly [string, string]>,\n): NominalAgreement {\n  const n = pairs.length\n  if (n === 0) return { n: 0, agreement: Number.NaN, kappa: Number.NaN }\n  const left = new Map<string, number>()\n  const right = new Map<string, number>()\n  let same = 0\n  for (const [a, b] of pairs) {\n    if (typeof a !== 'string' || typeof b !== 'string') {\n      throw new ValidationError('nominalAgreement: every label must be a string')\n    }\n    if (a === b) same += 1\n    left.set(a, (left.get(a) ?? 0) + 1)\n    right.set(b, (right.get(b) ?? 0) + 1)\n  }\n  const observed = same / n\n  let expected = 0\n  for (const [label, count] of left) expected += (count / n) * ((right.get(label) ?? 0) / n)\n  const kappa = expected === 1 ? Number.NaN : (observed - expected) / (1 - expected)\n  return { n, agreement: observed, kappa }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAyBA,SAAgB,sBAAsB,aAAqC;CACzE,IAAI,YAAY,SAAS,GAAG,OAAO;CAGnC,MAAM,+BAAe,IAAI,IAAwB;CACjD,KAAK,IAAI,aAAa,GAAG,aAAa,YAAY,QAAQ,cACxD,KAAK,MAAM,KAAK,YAAY,aAAc;EACxC,IAAI,UAAU,aAAa,IAAI,EAAE,SAAS;EAC1C,IAAI,YAAY,KAAA,GAAW;GACzB,UAAU,MAAM,KAAK,EAAE,QAAQ,YAAY,OAAO,SAAS,CAAC,CAAa;GACzE,aAAa,IAAI,EAAE,WAAW,OAAO;EACvC;EACA,QAAQ,WAAW,CAAE,KAAK,EAAE,KAAK;CACnC;CAGF,MAAM,YAAsB,CAAC;CAC7B,MAAM,YAAsB,CAAC;CAE7B,KAAK,MAAM,CAAC,WAAW,YAAY,cAAc;EAC/C,MAAM,UAAU,QAAQ,QAAQ,WAAW,OAAO,SAAS,CAAC;EAC5D,IAAI,QAAQ,SAAS,GAAG;EACxB,MAAM,YAAY,QAAQ,EAAE,CAAE;EAC9B,IAAI,QAAQ,MAAM,WAAW,OAAO,WAAW,SAAS,GACtD,MAAM,IAAI,gBACR,qCAAqC,UAAU,yBAC1C,QAAQ,KAAK,WAAW,OAAO,MAAM,CAAC,CAAC,KAAK,GAAG,EAAE,kCACxD;EAEF,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;GAC3C,MAAM,UAAU,QAAQ,KAAK,WAAW,OAAO,KAAM;GACrD,KAAK,MAAM,KAAK,SAAS,UAAU,KAAK,CAAC;GACzC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KACtC,UAAU,MAAM,QAAQ,KAAM,QAAQ,OAAQ,CAAC;EAGrD;CACF;CAEA,IAAI,UAAU,WAAW,KAAK,UAAU,SAAS,GAAG,OAAO;CAE3D,MAAM,uBAAuB,UAAU,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;CAG9E,IAAI,uBAAuB;CAC3B,IAAI,gBAAgB;CACpB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KACpC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;EAC7C,yBAAyB,UAAU,KAAM,UAAU,OAAQ;EAC3D;CACF;CAEF,uBAAuB,gBAAgB,IAAI,uBAAuB,gBAAgB;CAElF,IAAI,yBAAyB,GAAG,OAAO;CACvC,OAAO,IAAI,uBAAuB;AACpC;;;;;;;;;;;;;;;;;AAgFA,SAAgB,0BACd,SACA,OAA+B,CAAC,GACT;CACvB,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,gBAAgB,sDAAsD;CAGlF,MAAM,6BAAa,IAAI,IAAY;CACnC,MAAM,2BAAW,IAAI,IAAY;CAEjC,MAAM,uBAAO,IAAI,IAA8C;CAE/D,KAAK,MAAM,KAAK,SAAS;EACvB,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAC1B,MAAM,IAAI,gBACR,yDAAyD,EAAE,OAAO,UAAU,EAAE,UAAU,QAAQ,EAAE,UAAU,EAC9G;EAEF,WAAW,IAAI,EAAE,SAAS;EAC1B,SAAS,IAAI,EAAE,SAAS;EACxB,MAAM,UAAU,KAAK,IAAI,EAAE,SAAS,qBAAK,IAAI,IAAiC;EAC9E,MAAM,SAAS,QAAQ,IAAI,EAAE,SAAS,qBAAK,IAAI,IAAoB;EACnE,IAAI,OAAO,IAAI,EAAE,MAAM,GACrB,MAAM,IAAI,gBACR,yDAAyD,EAAE,OAAO,UAAU,EAAE,UAAU,QAAQ,EAAE,UAAU,EAC9G;EAEF,OAAO,IAAI,EAAE,QAAQ,EAAE,KAAK;EAC5B,QAAQ,IAAI,EAAE,WAAW,MAAM;EAC/B,KAAK,IAAI,EAAE,WAAW,OAAO;CAC/B;CAEA,MAAM,aAAa,KAAK,cAAc,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;CACzD,KAAK,MAAM,KAAK,YACd,IAAI,CAAC,SAAS,IAAI,CAAC,GACjB,MAAM,IAAI,gBACR,yCAAyC,EAAE,wCAC7C;CAGJ,MAAM,eAAe,KAAK,SAAS,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,KAAK;CAC3E,KAAK,MAAM,KAAK,cACd,IAAI,CAAC,WAAW,IAAI,CAAC,GACnB,MAAM,IAAI,gBACR,qCAAqC,EAAE,wCACzC;CAGJ,IAAI,aAAa,SAAS,GACxB,MAAM,IAAI,gBACR,kDAAkD,aAAa,QACjE;CAGF,MAAM,eAA8C,CAAC;CACrD,MAAM,OAAiB,CAAC;CACxB,MAAM,SAAmB,CAAC;CAE1B,KAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,UAAU,KAAK,IAAI,GAAG;EAE5B,MAAM,kBAA0C,CAAC;EACjD,KAAK,MAAM,KAAK,cAEd,gBAAgB,KADN,QAAQ,IAAI,CACD,CAAC,EAAE,QAAQ;EAElC,MAAM,cAAc,aAAa,QAAQ,MAAM,gBAAgB,OAAO,CAAC;EACvE,IAAI,YAAY,SAAS,GACvB,MAAM,IAAI,gBACR,yCAAyC,IAAI,gCAAgC,YAAY,KAAK,IAAI,EAAE,YAAY,KAAK,UAAU,eAAe,EAAE,EAClJ;EAIF,IAAI,cAAkC;EACtC,KAAK,MAAM,KAAK,cAAc;GAC5B,MAAM,MAAM,IAAI,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAE,KAAK,CAAC;GAC1C,IAAI,gBAAgB,MAClB,cAAc;QAGd,cAAc,IAAI,IAAI,CAAC,GAAGA,WAAI,CAAC,CAAC,QAAQ,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;EAE7D;EACA,MAAM,cAAc,CAAC,GAAI,+BAAe,IAAI,IAAY,CAAE,CAAC,CAAC,KAAK;EACjE,IAAI,YAAY,SAAS,GACvB,MAAM,IAAI,gBACR,yCAAyC,IAAI,QAAQ,YAAY,OAAO,wBAAwB,aAAa,OAAO,kBACtH;EAGF,MAAM,SAAqB,YAAY,KAAK,WAC1C,aAAa,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAE,IAAI,MAAM,CAAE,CACtD;EACA,MAAM,YAAY,oBAAoB,QAAQ,IAAI;EAClD,aAAa,KAAK;GAChB,GAAG;GACH,WAAW;GACX,SAAS;GACT,UAAU,CAAC,GAAG,YAAY;EAC5B,CAAC;EACD,IAAI,OAAO,SAAS,UAAU,GAAG,GAAG,KAAK,KAAK,UAAU,GAAG;EAC3D,IAAI,OAAO,SAAS,UAAU,aAAa,GAAG,OAAO,KAAK,UAAU,aAAa;CACnF;CAEA,MAAM,QAAQ,OACZ,GAAG,WAAW,IAAI,MAAa,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;CACpE,OAAO;EACL;EACA,YAAY,KAAK,IAAI;EACrB,sBAAsB,KAAK,MAAM;EACjC,YAAY;EACZ,UAAU;CACZ;AACF;;;;;;;;;AAUA,SAAgB,yCACd,aACA,OAA+B,CAAC,GACT;CACvB,MAAM,UAA+B,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,EAAE,QAAQ,YAAY,aAAa;EAC5C,IAAI,KAAK,IAAI,MAAM,GACjB,MAAM,IAAI,gBACR,+DAA+D,OAAO,EACxE;EAEF,KAAK,IAAI,MAAM;EACf,KAAK,MAAM,KAAK,QACd,QAAQ,KAAK;GACX;GACA,WAAW,EAAE;GACb,WAAW,EAAE;GACb,OAAO,EAAE;EACX,CAAC;CAEL;CACA,OAAO,0BAA0B,SAAS,IAAI;AAChD;;;;;AAqBA,SAAgB,iBACd,OACkB;CAClB,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,GAAG,OAAO;EAAE,GAAG;EAAG,WAAW;EAAY,OAAO;CAAW;CACrE,MAAM,uBAAO,IAAI,IAAoB;CACrC,MAAM,wBAAQ,IAAI,IAAoB;CACtC,IAAI,OAAO;CACX,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO;EAC1B,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,MAAM,IAAI,gBAAgB,gDAAgD;EAE5E,IAAI,MAAM,GAAG,QAAQ;EACrB,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC;EAClC,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;CACtC;CACA,MAAM,WAAW,OAAO;CACxB,IAAI,WAAW;CACf,KAAK,MAAM,CAAC,OAAO,UAAU,MAAM,YAAa,QAAQ,MAAO,MAAM,IAAI,KAAK,KAAK,KAAK;CAExF,OAAO;EAAE;EAAG,WAAW;EAAU,OADnB,aAAa,IAAI,OAAc,WAAW,aAAa,IAAI;CAClC;AACzC"}