@tangle-network/agent-bench 0.7.1 → 0.8.1

package/dist/benchmarks/mcad-bench.js

@@ -0,0 +1,569 @@
+import { MCAD_GOLDS } from "./mcad-golds.js";
+import { MCAD_TASKS } from "./mcad-tasks.js";
+import { mkdtemp, readFile, writeFile } from "node:fs/promises";
+import { join } from "node:path";
+import { execFile } from "node:child_process";
+import { tmpdir } from "node:os";
+import { promisify } from "node:util";
+//#region src/benchmarks/mcad-bench.ts
+/**
+* MCAD adapter. Worker artifact = OpenSCAD source for a dimensioned mechanical
+* part; judge = the REAL OpenSCAD kernel (compile + ASCII-STL export) followed by
+* pure-TS mesh measurement against the task's `McadSpec`. No LLM, no self-report:
+* the part either has the stated extents, volume, body count and holes, or it does
+* not.
+*
+* Pipeline, in order, and every stage is a hard fact about the produced mesh:
+*   1. compile     : `xvfb-run -a openscad --export-format=asciistl -o out.stl` exits 0
+*   2. watertight  : every undirected edge shared by exactly two faces (2-manifold)
+*   3. measure     : bbox extents, enclosed volume (divergence theorem), connected
+*                    -component count ("solids"), triangle count
+*   4. probe       : ray-parity point-in-solid at the spec's pinned hole/material
+*                    coordinates — this is what makes a missing or misplaced bore
+*                    fail, which no aggregate measure can catch
+*
+* Scoring: compile failure or a non-watertight mesh is 0 / unresolved — a mesh that
+* is not a closed solid has no well-defined volume or interior, so every downstream
+* number would be fiction. Otherwise the score is the fraction of ASSERTED spec
+* checks passed (each bbox axis, the volume band, the solids band, the triangle
+* floor, and EACH probe count as one check), and `resolved` requires all of them.
+*
+* Requires `openscad` + `xvfb-run` on PATH at JUDGE time only; `loadTasks` and the
+* geometry engine below are dependency-free and run anywhere.
+*
+* Geometry checks 1-3 are ported from supervisor-lab's `bench/cad-stl-gate.ts`
+* (edge-key manifold parity + signed-tetrahedron volume). Ported, not imported:
+* these packages do not share a dependency edge.
+*/
+const execFileAsync = promisify(execFile);
+/** Coincident-vertex quantisation, in model units (mm). */
+const VERTEX_QUANTUM = 1e-6;
+const AREA_EPS = 1e-9;
+/** Parse an ASCII STL into triangles by reading `vertex x y z` lines in groups of three. */
+function parseAsciiStl(stl) {
+	const verts = [];
+	for (const line of stl.split("\n")) {
+		const m = line.trim().match(/^vertex\s+(\S+)\s+(\S+)\s+(\S+)/i);
+		if (!m) continue;
+		const x = Number(m[1]);
+		const y = Number(m[2]);
+		const z = Number(m[3]);
+		if (!Number.isFinite(x) || !Number.isFinite(y) || !Number.isFinite(z)) continue;
+		verts.push({
+			x,
+			y,
+			z
+		});
+	}
+	const tris = [];
+	for (let i = 0; i + 2 < verts.length; i += 3) tris.push([
+		verts[i],
+		verts[i + 1],
+		verts[i + 2]
+	]);
+	return tris;
+}
+/** Quantise a vertex so shared edges match despite float authoring noise. */
+function vertexKey(v) {
+	const r = (n) => (Math.round(n / VERTEX_QUANTUM) * VERTEX_QUANTUM).toFixed(6);
+	return `${r(v.x)},${r(v.y)},${r(v.z)}`;
+}
+function sub(a, b) {
+	return {
+		x: a.x - b.x,
+		y: a.y - b.y,
+		z: a.z - b.z
+	};
+}
+function cross(a, b) {
+	return {
+		x: a.y * b.z - a.z * b.y,
+		y: a.z * b.x - a.x * b.z,
+		z: a.x * b.y - a.y * b.x
+	};
+}
+function dot(a, b) {
+	return a.x * b.x + a.y * b.y + a.z * b.z;
+}
+function norm(a) {
+	return Math.sqrt(dot(a, a));
+}
+function normalize(a) {
+	const n = norm(a);
+	return {
+		x: a.x / n,
+		y: a.y / n,
+		z: a.z / n
+	};
+}
+/** Disjoint-set over triangle indices — the "how many separate bodies" primitive. */
+function findRoot(parent, i) {
+	let r = i;
+	while (parent[r] !== r) r = parent[r];
+	let c = i;
+	while (parent[c] !== c) {
+		const next = parent[c];
+		parent[c] = r;
+		c = next;
+	}
+	return r;
+}
+/**
+* Measure the closed-solid properties of a triangle soup. Pure: no I/O, no deps.
+*
+* `solids` is the number of connected components of the graph whose nodes are
+* triangles and whose edges join two triangles that share a quantised mesh edge.
+* On a watertight mesh that count IS the number of disconnected bodies (an
+* enclosed internal cavity is its own shell and counts, which is the behaviour
+* the specs want — a "hollow" body that is really two nested shells is not one
+* fused solid).
+*/
+function measureMesh(tris) {
+	if (tris.length === 0) {
+		const zero = {
+			x: 0,
+			y: 0,
+			z: 0
+		};
+		return {
+			triangles: 0,
+			openEdges: 0,
+			watertight: false,
+			degenerateFaces: 0,
+			volume: 0,
+			solids: 0,
+			bbox: {
+				min: zero,
+				max: zero,
+				size: zero
+			}
+		};
+	}
+	const min = {
+		x: Number.POSITIVE_INFINITY,
+		y: Number.POSITIVE_INFINITY,
+		z: Number.POSITIVE_INFINITY
+	};
+	const max = {
+		x: Number.NEGATIVE_INFINITY,
+		y: Number.NEGATIVE_INFINITY,
+		z: Number.NEGATIVE_INFINITY
+	};
+	const edgeFaces = /* @__PURE__ */ new Map();
+	const parent = new Int32Array(tris.length);
+	for (let i = 0; i < tris.length; i++) parent[i] = i;
+	let degenerateFaces = 0;
+	let volume6 = 0;
+	for (let i = 0; i < tris.length; i++) {
+		const [a, b, c] = tris[i];
+		for (const v of [
+			a,
+			b,
+			c
+		]) {
+			if (v.x < min.x) min.x = v.x;
+			if (v.y < min.y) min.y = v.y;
+			if (v.z < min.z) min.z = v.z;
+			if (v.x > max.x) max.x = v.x;
+			if (v.y > max.y) max.y = v.y;
+			if (v.z > max.z) max.z = v.z;
+		}
+		if (norm(cross(sub(b, a), sub(c, a))) < AREA_EPS) degenerateFaces += 1;
+		volume6 += dot(a, cross(b, c));
+		const ka = vertexKey(a);
+		const kb = vertexKey(b);
+		const kc = vertexKey(c);
+		for (const [p, q] of [
+			[ka, kb],
+			[kb, kc],
+			[kc, ka]
+		]) {
+			const key = p < q ? `${p}|${q}` : `${q}|${p}`;
+			const seen = edgeFaces.get(key);
+			if (seen) seen.push(i);
+			else edgeFaces.set(key, [i]);
+		}
+	}
+	let openEdges = 0;
+	for (const faces of edgeFaces.values()) {
+		if (faces.length !== 2) openEdges += 1;
+		const first = findRoot(parent, faces[0]);
+		for (let k = 1; k < faces.length; k++) {
+			const other = findRoot(parent, faces[k]);
+			if (other !== first) parent[other] = first;
+		}
+	}
+	const roots = /* @__PURE__ */ new Set();
+	for (let i = 0; i < tris.length; i++) roots.add(findRoot(parent, i));
+	return {
+		triangles: tris.length,
+		openEdges,
+		watertight: openEdges === 0,
+		degenerateFaces,
+		volume: Math.abs(volume6) / 6,
+		solids: roots.size,
+		bbox: {
+			min: { ...min },
+			max: { ...max },
+			size: {
+				x: max.x - min.x,
+				y: max.y - min.y,
+				z: max.z - min.z
+			}
+		}
+	};
+}
+/**
+* Three fixed, mutually linearly-independent directions built from irrational
+* constants (sqrt(3)-1, sqrt(2)-1, 1/sqrt(5), 1/sqrt(3) and the plastic-number
+* pair 0.7548777 / 0.5698403). Their 3x3 determinant is ~1.77, so no two are
+* near-parallel and no plane contains all three.
+*/
+const RAY_DIRECTIONS = [
+	normalize({
+		x: 1,
+		y: .7548777,
+		z: .5698403
+	}),
+	normalize({
+		x: -.7320508,
+		y: 1,
+		z: .236068
+	}),
+	normalize({
+		x: .4472136,
+		y: -.5773503,
+		z: 1
+	})
+];
+/** Barycentric / parametric tolerances for calling a crossing "on the boundary". */
+const BARY_EPS = 1e-9;
+const DET_EPS = 1e-12;
+const T_EPS = 1e-9;
+const MAX_JITTERS = 8;
+/** Deterministic 32-bit PRNG (mulberry32) — seeded, so probes never use Math.random. */
+function mulberry32(seed) {
+	let a = seed >>> 0;
+	return () => {
+		a = a + 1831565813 >>> 0;
+		let t = a;
+		t = Math.imul(t ^ t >>> 15, t | 1);
+		t ^= t + Math.imul(t ^ t >>> 7, t | 61);
+		return ((t ^ t >>> 14) >>> 0) / 4294967296;
+	};
+}
+/** Stable integer hash of a probe point so its jitter sequence is reproducible. */
+function seedForPoint(p, rayIndex) {
+	let h = 2166136261 ^ rayIndex;
+	for (const n of [
+		p.x,
+		p.y,
+		p.z
+	]) {
+		const bits = Math.round(n * 1e6) | 0;
+		h = Math.imul(h ^ bits & 65535, 16777619);
+		h = Math.imul(h ^ bits >>> 16 & 65535, 16777619);
+	}
+	return h >>> 0;
+}
+/**
+* Moller-Trumbore crossing count along one ray. Returns `degenerate` when the ray
+* touches a triangle edge/vertex, lies in a triangle's plane, or starts on a face
+* — the three cases where a parity count is not trustworthy.
+*/
+function castRay(tris, origin, dir) {
+	let crossings = 0;
+	for (const [v0, v1, v2] of tris) {
+		const e1 = sub(v1, v0);
+		const e2 = sub(v2, v0);
+		const h = cross(dir, e2);
+		const det = dot(e1, h);
+		const scale = norm(e1) * norm(e2);
+		if (Math.abs(det) <= DET_EPS * Math.max(scale, 1)) {
+			const n = cross(e1, e2);
+			const nl = norm(n);
+			if (nl > AREA_EPS && Math.abs(dot(sub(origin, v0), n)) / nl <= T_EPS) return { degenerate: true };
+			continue;
+		}
+		const f = 1 / det;
+		const s = sub(origin, v0);
+		const u = f * dot(s, h);
+		const q = cross(s, e1);
+		const v = f * dot(dir, q);
+		const w = 1 - u - v;
+		if (u < -1e-9 || v < -1e-9 || w < -1e-9) continue;
+		const t = f * dot(e2, q);
+		if (t < -1e-9) continue;
+		if (Math.abs(t) <= T_EPS) return { degenerate: true };
+		if (u <= BARY_EPS || v <= BARY_EPS || w <= BARY_EPS) return { degenerate: true };
+		crossings += 1;
+	}
+	return { crossings };
+}
+/**
+* Point-in-solid membership by ray parity, made robust three ways.
+*
+* ROBUSTNESS ARGUMENT. A parity test is exact except on a measure-zero set: rays
+* that graze a triangle edge or vertex (the crossing is counted twice or zero
+* times), rays coplanar with a face, and origins lying on the surface. Those cases
+* are not merely rare here — they are SYSTEMATIC, because OpenSCAD emits
+* axis-aligned meshes whose vertices land on the same round millimetre lattice the
+* spec's probe coordinates come from, so an axis-aligned ray from a probe point
+* hits shared edges constantly. Three defences, in order:
+*   1. DIRECTIONS. The three fixed directions are irrational combinations, so a ray
+*      from a lattice point cannot stay in an axis-aligned face plane and cannot
+*      run along a lattice edge.
+*   2. DETECTION + DETERMINISTIC RE-JITTER. Grazing is DETECTED (a barycentric
+*      coordinate within BARY_EPS of 0, |det| below DET_EPS with the origin in the
+*      plane, or |t| within T_EPS) rather than hoped away. A detected ray is re-cast
+*      with a small direction perturbation drawn from a mulberry32 PRNG seeded by
+*      the probe coordinates and ray index, so the whole judge stays deterministic:
+*      the same mesh and the same point always take the same sequence of re-casts.
+*   3. MAJORITY VOTE. The verdict is the majority of three independent directions,
+*      so even an undetected miscount on one ray cannot flip the answer.
+* A point sitting exactly ON the surface has no correct answer; every direction
+* degenerates there and the vote falls back to whatever the jittered casts say.
+* The specs therefore place probes with >=1 mm clearance from any surface.
+*/
+function pointInSolid(tris, point) {
+	let inside = 0;
+	let votes = 0;
+	for (let i = 0; i < RAY_DIRECTIONS.length; i++) {
+		const base = RAY_DIRECTIONS[i];
+		const rand = mulberry32(seedForPoint(point, i));
+		let dir = base;
+		for (let attempt = 0; attempt <= MAX_JITTERS; attempt++) {
+			const r = castRay(tris, point, dir);
+			if (!("degenerate" in r)) {
+				votes += 1;
+				if (r.crossings % 2 === 1) inside += 1;
+				break;
+			}
+			dir = normalize({
+				x: base.x + (rand() - .5) * .001,
+				y: base.y + (rand() - .5) * .001,
+				z: base.z + (rand() - .5) * .001
+			});
+		}
+	}
+	if (votes === 0) return false;
+	return inside * 2 > votes;
+}
+function inBand(v, [lo, hi]) {
+	return v >= lo && v <= hi;
+}
+function fmt(n) {
+	return String(Math.round(n * 1e3) / 1e3);
+}
+function pt(p) {
+	return `(${p[0]}, ${p[1]}, ${p[2]})`;
+}
+/** Score a measured mesh against the task's spec — one named check per assertion. */
+function scoreAgainstSpec(geo, tris, spec) {
+	const checks = [];
+	const add = (name, ok, measured, expected) => checks.push({
+		name,
+		ok,
+		measured,
+		expected
+	});
+	for (const axis of [
+		"x",
+		"y",
+		"z"
+	]) {
+		const band = spec.bbox?.[axis];
+		if (!band) continue;
+		const got = geo.bbox.size[axis];
+		add(`bbox${axis.toUpperCase()}`, inBand(got, band), fmt(got), `[${band[0]}, ${band[1]}]`);
+	}
+	if (spec.volume) add("volume", inBand(geo.volume, spec.volume), fmt(geo.volume), `[${spec.volume[0]}, ${spec.volume[1]}]`);
+	if (spec.solids) add("solids", inBand(geo.solids, spec.solids), String(geo.solids), `[${spec.solids[0]}, ${spec.solids[1]}]`);
+	if (spec.minTriangles != null) add("minTriangles", geo.triangles >= spec.minTriangles, String(geo.triangles), `>= ${spec.minTriangles}`);
+	for (const [i, p] of (spec.probesInsideSolid ?? []).entries()) {
+		const got = pointInSolid(tris, {
+			x: p[0],
+			y: p[1],
+			z: p[2]
+		});
+		add(`probeInside[${i}] ${pt(p)}`, got, got ? "inside" : "outside", "inside");
+	}
+	for (const [i, p] of (spec.probesOutsideSolid ?? []).entries()) {
+		const got = pointInSolid(tris, {
+			x: p[0],
+			y: p[1],
+			z: p[2]
+		});
+		add(`probeOutside[${i}] ${pt(p)}`, !got, got ? "inside" : "outside", "outside");
+	}
+	const failed = checks.filter((c) => !c.ok);
+	return {
+		checks,
+		failed,
+		score: checks.length ? (checks.length - failed.length) / checks.length : 0,
+		resolved: checks.length > 0 && failed.length === 0
+	};
+}
+/** Run openscad under xvfb (it wants a GL context even headless). */
+async function openscad(args, cwd) {
+	return execFileAsync("xvfb-run", [
+		"-a",
+		"openscad",
+		...args
+	], {
+		cwd,
+		maxBuffer: 1024 * 1024 * 64,
+		timeout: 6e5
+	});
+}
+/**
+* Strip a markdown fence if the model wrapped its answer in one. The prompt asks
+* for bare source; a fenced answer is a formatting slip, not a geometry failure,
+* and the geometric gate downstream is unchanged either way.
+*/
+function stripCodeFence(artifact) {
+	const trimmed = artifact.trim();
+	const fenced = /^```[a-zA-Z]*\n([\s\S]*?)\n?```$/.exec(trimmed);
+	return (fenced ? fenced[1] : trimmed).trim();
+}
+/** Compile OpenSCAD source and measure the resulting mesh. Judge-time only. */
+async function compileAndMeasure(src) {
+	const dir = await mkdtemp(join(tmpdir(), "mcad-"));
+	const scadPath = join(dir, "model.scad");
+	const stlPath = join(dir, "model.stl");
+	await writeFile(scadPath, `${src}\n`);
+	try {
+		await openscad([
+			"--export-format=asciistl",
+			"-o",
+			stlPath,
+			scadPath
+		], dir);
+	} catch (err) {
+		return {
+			ok: false,
+			detail: `compile failed: ${(err instanceof Error ? err.message : String(err)).slice(0, 400)}`
+		};
+	}
+	let stl;
+	try {
+		stl = await readFile(stlPath, "utf8");
+	} catch {
+		return {
+			ok: false,
+			detail: "compiled but produced no STL (empty geometry)"
+		};
+	}
+	const tris = parseAsciiStl(stl);
+	if (tris.length === 0) return {
+		ok: false,
+		detail: "STL parsed to zero triangles (empty geometry)"
+	};
+	return {
+		ok: true,
+		geo: measureMesh(tris),
+		tris,
+		stlPath
+	};
+}
+function createMcadBenchAdapter() {
+	return {
+		name: "mcad",
+		async preflight() {
+			try {
+				await execFileAsync("xvfb-run", [
+					"-a",
+					"openscad",
+					"--version"
+				], { timeout: 3e4 });
+			} catch (err) {
+				const msg = err instanceof Error ? err.message : String(err);
+				throw new Error(`mcad preflight failed: ${msg}\nFix: install OpenSCAD + Xvfb (Debian/Ubuntu: sudo apt-get install -y openscad xvfb). The judge runs \`xvfb-run -a openscad --export-format=asciistl -o out.stl model.scad\` — both must be on PATH.`);
+			}
+		},
+		async loadTasks(opts = {}) {
+			let tasks = MCAD_TASKS;
+			if (opts.ids) tasks = tasks.filter((t) => opts.ids?.includes(t.id));
+			if (opts.limit != null) tasks = tasks.slice(0, opts.limit);
+			return tasks.map((t) => ({
+				id: t.id,
+				prompt: t.prompt,
+				metadata: {
+					spec: t.spec,
+					source: t.source,
+					calibrated: t.calibrated
+				}
+			}));
+		},
+		async goldArtifact(task) {
+			return MCAD_GOLDS[task.id];
+		},
+		async judge(task, artifact) {
+			const spec = task.metadata?.spec;
+			if (!spec) return {
+				resolved: false,
+				score: 0,
+				detail: `task ${task.id} carries no mcad spec`
+			};
+			const src = stripCodeFence(artifact);
+			if (!src) return {
+				resolved: false,
+				score: 0,
+				detail: "empty artifact"
+			};
+			const built = await compileAndMeasure(src);
+			if (!built.ok) return {
+				resolved: false,
+				score: 0,
+				detail: built.detail
+			};
+			const { geo, tris, stlPath } = built;
+			if (!geo.watertight) return {
+				resolved: false,
+				score: 0,
+				detail: JSON.stringify({
+					gate: "watertight",
+					failed: [{
+						name: "watertight",
+						measured: `${geo.openEdges} edge(s) not shared by exactly two faces`,
+						expected: "0 open edges (closed 2-manifold solid)"
+					}],
+					geo: {
+						triangles: geo.triangles,
+						degenerateFaces: geo.degenerateFaces
+					},
+					stlPath
+				})
+			};
+			const scored = scoreAgainstSpec(geo, tris, spec);
+			return {
+				resolved: scored.resolved,
+				score: scored.score,
+				detail: JSON.stringify({
+					failed: scored.failed.map((c) => ({
+						name: c.name,
+						measured: c.measured,
+						expected: c.expected
+					})),
+					checks: Object.fromEntries(scored.checks.map((c) => [c.name, c.ok])),
+					geo: {
+						triangles: geo.triangles,
+						solids: geo.solids,
+						volume: +geo.volume.toFixed(2),
+						degenerateFaces: geo.degenerateFaces,
+						bbox: {
+							x: +geo.bbox.size.x.toFixed(3),
+							y: +geo.bbox.size.y.toFixed(3),
+							z: +geo.bbox.size.z.toFixed(3)
+						}
+					},
+					stlPath
+				})
+			};
+		}
+	};
+}
+//#endregion
+export { compileAndMeasure, createMcadBenchAdapter, measureMesh, parseAsciiStl, pointInSolid, scoreAgainstSpec, stripCodeFence };
+
+//# sourceMappingURL=mcad-bench.js.map

package/dist/benchmarks/mcad-bench.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mcad-bench.js","names":[],"sources":["../../src/benchmarks/mcad-bench.ts"],"sourcesContent":["/**\n * MCAD adapter. Worker artifact = OpenSCAD source for a dimensioned mechanical\n * part; judge = the REAL OpenSCAD kernel (compile + ASCII-STL export) followed by\n * pure-TS mesh measurement against the task's `McadSpec`. No LLM, no self-report:\n * the part either has the stated extents, volume, body count and holes, or it does\n * not.\n *\n * Pipeline, in order, and every stage is a hard fact about the produced mesh:\n *   1. compile     : `xvfb-run -a openscad --export-format=asciistl -o out.stl` exits 0\n *   2. watertight  : every undirected edge shared by exactly two faces (2-manifold)\n *   3. measure     : bbox extents, enclosed volume (divergence theorem), connected\n *                    -component count (\"solids\"), triangle count\n *   4. probe       : ray-parity point-in-solid at the spec's pinned hole/material\n *                    coordinates — this is what makes a missing or misplaced bore\n *                    fail, which no aggregate measure can catch\n *\n * Scoring: compile failure or a non-watertight mesh is 0 / unresolved — a mesh that\n * is not a closed solid has no well-defined volume or interior, so every downstream\n * number would be fiction. Otherwise the score is the fraction of ASSERTED spec\n * checks passed (each bbox axis, the volume band, the solids band, the triangle\n * floor, and EACH probe count as one check), and `resolved` requires all of them.\n *\n * Requires `openscad` + `xvfb-run` on PATH at JUDGE time only; `loadTasks` and the\n * geometry engine below are dependency-free and run anywhere.\n *\n * Geometry checks 1-3 are ported from supervisor-lab's `bench/cad-stl-gate.ts`\n * (edge-key manifold parity + signed-tetrahedron volume). Ported, not imported:\n * these packages do not share a dependency edge.\n */\n\nimport { execFile } from 'node:child_process'\nimport { mkdtemp, readFile, writeFile } from 'node:fs/promises'\nimport { tmpdir } from 'node:os'\nimport { join } from 'node:path'\nimport { promisify } from 'node:util'\nimport { MCAD_GOLDS } from './mcad-golds'\nimport { MCAD_TASKS, type McadSpec, type McadTask } from './mcad-tasks'\nimport type { BenchmarkAdapter, BenchScore, BenchTask, LoadOptions } from './types'\n\nconst execFileAsync = promisify(execFile)\n\nexport interface Vec3 {\n  x: number\n  y: number\n  z: number\n}\n\n/** One triangle as three vertices, in the STL's stated winding order. */\nexport type Tri = readonly [Vec3, Vec3, Vec3]\n\nexport interface McadGeometry {\n  triangles: number\n  /** Edges NOT shared by exactly two faces. 0 iff the surface is closed + 2-manifold. */\n  openEdges: number\n  watertight: boolean\n  /** Zero-area faces — bad geometry even when the topology closes. */\n  degenerateFaces: number\n  /** Enclosed volume (absolute) via the signed-tetrahedron sum. */\n  volume: number\n  /** Connected components of the triangle-adjacency graph = disconnected bodies. */\n  solids: number\n  bbox: { min: Vec3; max: Vec3; size: Vec3 }\n}\n\n/** Coincident-vertex quantisation, in model units (mm). */\nconst VERTEX_QUANTUM = 1e-6\nconst AREA_EPS = 1e-9\nconst VOLUME_EPS = 1e-9\n\n// ---------------------------------------------------------------------------\n// Mesh parsing + measurement (ported from supervisor-lab bench/cad-stl-gate.ts)\n// ---------------------------------------------------------------------------\n\n/** Parse an ASCII STL into triangles by reading `vertex x y z` lines in groups of three. */\nexport function parseAsciiStl(stl: string): Tri[] {\n  const verts: Vec3[] = []\n  for (const line of stl.split('\\n')) {\n    const m = line.trim().match(/^vertex\\s+(\\S+)\\s+(\\S+)\\s+(\\S+)/i)\n    if (!m) continue\n    const x = Number(m[1])\n    const y = Number(m[2])\n    const z = Number(m[3])\n    if (!Number.isFinite(x) || !Number.isFinite(y) || !Number.isFinite(z)) continue\n    verts.push({ x, y, z })\n  }\n  const tris: Tri[] = []\n  for (let i = 0; i + 2 < verts.length; i += 3) tris.push([verts[i]!, verts[i + 1]!, verts[i + 2]!])\n  return tris\n}\n\n/** Quantise a vertex so shared edges match despite float authoring noise. */\nfunction vertexKey(v: Vec3): string {\n  const r = (n: number) => (Math.round(n / VERTEX_QUANTUM) * VERTEX_QUANTUM).toFixed(6)\n  return `${r(v.x)},${r(v.y)},${r(v.z)}`\n}\n\nfunction sub(a: Vec3, b: Vec3): Vec3 {\n  return { x: a.x - b.x, y: a.y - b.y, z: a.z - b.z }\n}\nfunction cross(a: Vec3, b: Vec3): Vec3 {\n  return { x: a.y * b.z - a.z * b.y, y: a.z * b.x - a.x * b.z, z: a.x * b.y - a.y * b.x }\n}\nfunction dot(a: Vec3, b: Vec3): number {\n  return a.x * b.x + a.y * b.y + a.z * b.z\n}\nfunction norm(a: Vec3): number {\n  return Math.sqrt(dot(a, a))\n}\nfunction normalize(a: Vec3): Vec3 {\n  const n = norm(a)\n  return { x: a.x / n, y: a.y / n, z: a.z / n }\n}\n\n/** Disjoint-set over triangle indices — the \"how many separate bodies\" primitive. */\nfunction findRoot(parent: Int32Array, i: number): number {\n  let r = i\n  while (parent[r] !== r) r = parent[r]!\n  let c = i\n  while (parent[c] !== c) {\n    const next = parent[c]!\n    parent[c] = r\n    c = next\n  }\n  return r\n}\n\n/**\n * Measure the closed-solid properties of a triangle soup. Pure: no I/O, no deps.\n *\n * `solids` is the number of connected components of the graph whose nodes are\n * triangles and whose edges join two triangles that share a quantised mesh edge.\n * On a watertight mesh that count IS the number of disconnected bodies (an\n * enclosed internal cavity is its own shell and counts, which is the behaviour\n * the specs want — a \"hollow\" body that is really two nested shells is not one\n * fused solid).\n */\nexport function measureMesh(tris: Tri[]): McadGeometry {\n  if (tris.length === 0) {\n    const zero = { x: 0, y: 0, z: 0 }\n    return {\n      triangles: 0,\n      openEdges: 0,\n      watertight: false,\n      degenerateFaces: 0,\n      volume: 0,\n      solids: 0,\n      bbox: { min: zero, max: zero, size: zero },\n    }\n  }\n\n  const min: Vec3 = { x: Number.POSITIVE_INFINITY, y: Number.POSITIVE_INFINITY, z: Number.POSITIVE_INFINITY }\n  const max: Vec3 = { x: Number.NEGATIVE_INFINITY, y: Number.NEGATIVE_INFINITY, z: Number.NEGATIVE_INFINITY }\n  const edgeFaces = new Map<string, number[]>()\n  const parent = new Int32Array(tris.length)\n  for (let i = 0; i < tris.length; i++) parent[i] = i\n  let degenerateFaces = 0\n  let volume6 = 0\n\n  for (let i = 0; i < tris.length; i++) {\n    const [a, b, c] = tris[i]!\n    for (const v of [a, b, c]) {\n      if (v.x < min.x) min.x = v.x\n      if (v.y < min.y) min.y = v.y\n      if (v.z < min.z) min.z = v.z\n      if (v.x > max.x) max.x = v.x\n      if (v.y > max.y) max.y = v.y\n      if (v.z > max.z) max.z = v.z\n    }\n    if (norm(cross(sub(b, a), sub(c, a))) < AREA_EPS) degenerateFaces += 1\n    volume6 += dot(a, cross(b, c))\n\n    const ka = vertexKey(a)\n    const kb = vertexKey(b)\n    const kc = vertexKey(c)\n    for (const [p, q] of [\n      [ka, kb],\n      [kb, kc],\n      [kc, ka],\n    ] as const) {\n      const key = p < q ? `${p}|${q}` : `${q}|${p}`\n      const seen = edgeFaces.get(key)\n      if (seen) seen.push(i)\n      else edgeFaces.set(key, [i])\n    }\n  }\n\n  let openEdges = 0\n  for (const faces of edgeFaces.values()) {\n    if (faces.length !== 2) openEdges += 1\n    // Union every face pair on this edge (a >2-face edge still connects bodies).\n    const first = findRoot(parent, faces[0]!)\n    for (let k = 1; k < faces.length; k++) {\n      const other = findRoot(parent, faces[k]!)\n      if (other !== first) parent[other] = first\n    }\n  }\n\n  const roots = new Set<number>()\n  for (let i = 0; i < tris.length; i++) roots.add(findRoot(parent, i))\n\n  return {\n    triangles: tris.length,\n    openEdges,\n    watertight: openEdges === 0,\n    degenerateFaces,\n    volume: Math.abs(volume6) / 6,\n    solids: roots.size,\n    bbox: {\n      min: { ...min },\n      max: { ...max },\n      size: { x: max.x - min.x, y: max.y - min.y, z: max.z - min.z },\n    },\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Point-in-solid by ray parity\n// ---------------------------------------------------------------------------\n\n/**\n * Three fixed, mutually linearly-independent directions built from irrational\n * constants (sqrt(3)-1, sqrt(2)-1, 1/sqrt(5), 1/sqrt(3) and the plastic-number\n * pair 0.7548777 / 0.5698403). Their 3x3 determinant is ~1.77, so no two are\n * near-parallel and no plane contains all three.\n */\nconst RAY_DIRECTIONS: readonly Vec3[] = [\n  normalize({ x: 1, y: 0.7548777, z: 0.5698403 }),\n  normalize({ x: -0.7320508, y: 1, z: 0.236068 }),\n  normalize({ x: 0.4472136, y: -0.5773503, z: 1 }),\n]\n\n/** Barycentric / parametric tolerances for calling a crossing \"on the boundary\". */\nconst BARY_EPS = 1e-9\nconst DET_EPS = 1e-12\nconst T_EPS = 1e-9\nconst MAX_JITTERS = 8\n\n/** Deterministic 32-bit PRNG (mulberry32) — seeded, so probes never use Math.random. */\nfunction mulberry32(seed: number): () => number {\n  let a = seed >>> 0\n  return () => {\n    a = (a + 0x6d2b79f5) >>> 0\n    let t = a\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\n/** Stable integer hash of a probe point so its jitter sequence is reproducible. */\nfunction seedForPoint(p: Vec3, rayIndex: number): number {\n  let h = 2166136261 ^ rayIndex\n  for (const n of [p.x, p.y, p.z]) {\n    const bits = Math.round(n * 1e6) | 0\n    h = Math.imul(h ^ (bits & 0xffff), 16777619)\n    h = Math.imul(h ^ ((bits >>> 16) & 0xffff), 16777619)\n  }\n  return h >>> 0\n}\n\ntype CastResult = { crossings: number } | { degenerate: true }\n\n/**\n * Moller-Trumbore crossing count along one ray. Returns `degenerate` when the ray\n * touches a triangle edge/vertex, lies in a triangle's plane, or starts on a face\n * — the three cases where a parity count is not trustworthy.\n */\nfunction castRay(tris: Tri[], origin: Vec3, dir: Vec3): CastResult {\n  let crossings = 0\n  for (const [v0, v1, v2] of tris) {\n    const e1 = sub(v1, v0)\n    const e2 = sub(v2, v0)\n    const h = cross(dir, e2)\n    const det = dot(e1, h)\n    const scale = norm(e1) * norm(e2)\n    if (Math.abs(det) <= DET_EPS * Math.max(scale, 1)) {\n      // Ray parallel to (or inside) this triangle's plane. Only a problem when the\n      // ray could actually meet the triangle; distinguishing that costs more than a\n      // re-cast, so treat it as degenerate whenever the origin is near the plane.\n      const n = cross(e1, e2)\n      const nl = norm(n)\n      if (nl > AREA_EPS && Math.abs(dot(sub(origin, v0), n)) / nl <= T_EPS) return { degenerate: true }\n      continue\n    }\n    const f = 1 / det\n    const s = sub(origin, v0)\n    const u = f * dot(s, h)\n    const q = cross(s, e1)\n    const v = f * dot(dir, q)\n    const w = 1 - u - v\n    if (u < -BARY_EPS || v < -BARY_EPS || w < -BARY_EPS) continue\n    const t = f * dot(e2, q)\n    if (t < -T_EPS) continue\n    // Inside the triangle (or within EPS of its border). Anything within EPS of a\n    // border, or of the origin plane, makes the parity ambiguous.\n    if (Math.abs(t) <= T_EPS) return { degenerate: true }\n    if (u <= BARY_EPS || v <= BARY_EPS || w <= BARY_EPS) return { degenerate: true }\n    crossings += 1\n  }\n  return { crossings }\n}\n\n/**\n * Point-in-solid membership by ray parity, made robust three ways.\n *\n * ROBUSTNESS ARGUMENT. A parity test is exact except on a measure-zero set: rays\n * that graze a triangle edge or vertex (the crossing is counted twice or zero\n * times), rays coplanar with a face, and origins lying on the surface. Those cases\n * are not merely rare here — they are SYSTEMATIC, because OpenSCAD emits\n * axis-aligned meshes whose vertices land on the same round millimetre lattice the\n * spec's probe coordinates come from, so an axis-aligned ray from a probe point\n * hits shared edges constantly. Three defences, in order:\n *   1. DIRECTIONS. The three fixed directions are irrational combinations, so a ray\n *      from a lattice point cannot stay in an axis-aligned face plane and cannot\n *      run along a lattice edge.\n *   2. DETECTION + DETERMINISTIC RE-JITTER. Grazing is DETECTED (a barycentric\n *      coordinate within BARY_EPS of 0, |det| below DET_EPS with the origin in the\n *      plane, or |t| within T_EPS) rather than hoped away. A detected ray is re-cast\n *      with a small direction perturbation drawn from a mulberry32 PRNG seeded by\n *      the probe coordinates and ray index, so the whole judge stays deterministic:\n *      the same mesh and the same point always take the same sequence of re-casts.\n *   3. MAJORITY VOTE. The verdict is the majority of three independent directions,\n *      so even an undetected miscount on one ray cannot flip the answer.\n * A point sitting exactly ON the surface has no correct answer; every direction\n * degenerates there and the vote falls back to whatever the jittered casts say.\n * The specs therefore place probes with >=1 mm clearance from any surface.\n */\nexport function pointInSolid(tris: Tri[], point: Vec3): boolean {\n  let inside = 0\n  let votes = 0\n  for (let i = 0; i < RAY_DIRECTIONS.length; i++) {\n    const base = RAY_DIRECTIONS[i]!\n    const rand = mulberry32(seedForPoint(point, i))\n    let dir = base\n    for (let attempt = 0; attempt <= MAX_JITTERS; attempt++) {\n      const r = castRay(tris, point, dir)\n      if (!('degenerate' in r)) {\n        votes += 1\n        if (r.crossings % 2 === 1) inside += 1\n        break\n      }\n      dir = normalize({\n        x: base.x + (rand() - 0.5) * 1e-3,\n        y: base.y + (rand() - 0.5) * 1e-3,\n        z: base.z + (rand() - 0.5) * 1e-3,\n      })\n    }\n  }\n  // Every direction degenerating means the point is on the surface; call it outside\n  // (fail-closed: a probe that must be inside the material will report a failure).\n  if (votes === 0) return false\n  return inside * 2 > votes\n}\n\n// ---------------------------------------------------------------------------\n// Spec scoring\n// ---------------------------------------------------------------------------\n\nexport interface McadCheck {\n  name: string\n  ok: boolean\n  measured: string\n  expected: string\n}\n\nexport interface McadScoring {\n  checks: McadCheck[]\n  failed: McadCheck[]\n  score: number\n  resolved: boolean\n}\n\nfunction inBand(v: number, [lo, hi]: [number, number]): boolean {\n  return v >= lo && v <= hi\n}\n\nfunction fmt(n: number): string {\n  return String(Math.round(n * 1000) / 1000)\n}\n\nfunction pt(p: readonly [number, number, number]): string {\n  return `(${p[0]}, ${p[1]}, ${p[2]})`\n}\n\n/** Score a measured mesh against the task's spec — one named check per assertion. */\nexport function scoreAgainstSpec(geo: McadGeometry, tris: Tri[], spec: McadSpec): McadScoring {\n  const checks: McadCheck[] = []\n  const add = (name: string, ok: boolean, measured: string, expected: string) =>\n    checks.push({ name, ok, measured, expected })\n\n  for (const axis of ['x', 'y', 'z'] as const) {\n    const band = spec.bbox?.[axis]\n    if (!band) continue\n    const got = geo.bbox.size[axis]\n    add(`bbox${axis.toUpperCase()}`, inBand(got, band), fmt(got), `[${band[0]}, ${band[1]}]`)\n  }\n  if (spec.volume) add('volume', inBand(geo.volume, spec.volume), fmt(geo.volume), `[${spec.volume[0]}, ${spec.volume[1]}]`)\n  if (spec.solids) add('solids', inBand(geo.solids, spec.solids), String(geo.solids), `[${spec.solids[0]}, ${spec.solids[1]}]`)\n  if (spec.minTriangles != null)\n    add('minTriangles', geo.triangles >= spec.minTriangles, String(geo.triangles), `>= ${spec.minTriangles}`)\n\n  for (const [i, p] of (spec.probesInsideSolid ?? []).entries()) {\n    const got = pointInSolid(tris, { x: p[0], y: p[1], z: p[2] })\n    add(`probeInside[${i}] ${pt(p)}`, got, got ? 'inside' : 'outside', 'inside')\n  }\n  for (const [i, p] of (spec.probesOutsideSolid ?? []).entries()) {\n    const got = pointInSolid(tris, { x: p[0], y: p[1], z: p[2] })\n    add(`probeOutside[${i}] ${pt(p)}`, !got, got ? 'inside' : 'outside', 'outside')\n  }\n\n  const failed = checks.filter((c) => !c.ok)\n  const score = checks.length ? (checks.length - failed.length) / checks.length : 0\n  return { checks, failed, score, resolved: checks.length > 0 && failed.length === 0 }\n}\n\n// ---------------------------------------------------------------------------\n// Adapter\n// ---------------------------------------------------------------------------\n\n/** Task metadata carried onto every `BenchTask`, so the judge needs no lookup table. */\nexport interface McadTaskMeta extends Record<string, unknown> {\n  spec: McadSpec\n  source: string\n  calibrated: boolean\n}\n\n/** Run openscad under xvfb (it wants a GL context even headless). */\nasync function openscad(args: string[], cwd: string): Promise<{ stdout: string; stderr: string }> {\n  return execFileAsync('xvfb-run', ['-a', 'openscad', ...args], {\n    cwd,\n    maxBuffer: 1024 * 1024 * 64,\n    timeout: 600_000,\n  })\n}\n\n/**\n * Strip a markdown fence if the model wrapped its answer in one. The prompt asks\n * for bare source; a fenced answer is a formatting slip, not a geometry failure,\n * and the geometric gate downstream is unchanged either way.\n */\nexport function stripCodeFence(artifact: string): string {\n  const trimmed = artifact.trim()\n  const fenced = /^```[a-zA-Z]*\\n([\\s\\S]*?)\\n?```$/.exec(trimmed)\n  return (fenced ? fenced[1]! : trimmed).trim()\n}\n\n/** Compile OpenSCAD source and measure the resulting mesh. Judge-time only. */\nexport async function compileAndMeasure(\n  src: string,\n): Promise<{ ok: true; geo: McadGeometry; tris: Tri[]; stlPath: string } | { ok: false; detail: string }> {\n  const dir = await mkdtemp(join(tmpdir(), 'mcad-'))\n  const scadPath = join(dir, 'model.scad')\n  const stlPath = join(dir, 'model.stl')\n  await writeFile(scadPath, `${src}\\n`)\n\n  try {\n    await openscad(['--export-format=asciistl', '-o', stlPath, scadPath], dir)\n  } catch (err) {\n    const msg = err instanceof Error ? err.message : String(err)\n    return { ok: false, detail: `compile failed: ${msg.slice(0, 400)}` }\n  }\n\n  let stl: string\n  try {\n    stl = await readFile(stlPath, 'utf8')\n  } catch {\n    return { ok: false, detail: 'compiled but produced no STL (empty geometry)' }\n  }\n  const tris = parseAsciiStl(stl)\n  if (tris.length === 0) return { ok: false, detail: 'STL parsed to zero triangles (empty geometry)' }\n  return { ok: true, geo: measureMesh(tris), tris, stlPath }\n}\n\nexport function createMcadBenchAdapter(): BenchmarkAdapter {\n  return {\n    name: 'mcad',\n\n    async preflight() {\n      try {\n        await execFileAsync('xvfb-run', ['-a', 'openscad', '--version'], { timeout: 30_000 })\n      } catch (err) {\n        const msg = err instanceof Error ? err.message : String(err)\n        throw new Error(\n          `mcad preflight failed: ${msg}\\n` +\n            'Fix: install OpenSCAD + Xvfb (Debian/Ubuntu: sudo apt-get install -y openscad xvfb). ' +\n            'The judge runs `xvfb-run -a openscad --export-format=asciistl -o out.stl model.scad` — both must be on PATH.',\n        )\n      }\n    },\n\n    async loadTasks(opts: LoadOptions = {}) {\n      let tasks: McadTask[] = MCAD_TASKS\n      if (opts.ids) tasks = tasks.filter((t) => opts.ids?.includes(t.id))\n      if (opts.limit != null) tasks = tasks.slice(0, opts.limit)\n      return tasks.map(\n        (t): BenchTask => ({\n          id: t.id,\n          prompt: t.prompt,\n          metadata: { spec: t.spec, source: t.source, calibrated: t.calibrated } satisfies McadTaskMeta,\n        }),\n      )\n    },\n\n    async goldArtifact(task: BenchTask) {\n      return MCAD_GOLDS[task.id]\n    },\n\n    async judge(task: BenchTask, artifact: string): Promise<BenchScore> {\n      const spec = (task.metadata as McadTaskMeta | undefined)?.spec\n      if (!spec) return { resolved: false, score: 0, detail: `task ${task.id} carries no mcad spec` }\n\n      const src = stripCodeFence(artifact)\n      if (!src) return { resolved: false, score: 0, detail: 'empty artifact' }\n\n      const built = await compileAndMeasure(src)\n      if (!built.ok) return { resolved: false, score: 0, detail: built.detail }\n\n      const { geo, tris, stlPath } = built\n      if (!geo.watertight) {\n        return {\n          resolved: false,\n          score: 0,\n          detail: JSON.stringify({\n            gate: 'watertight',\n            failed: [\n              {\n                name: 'watertight',\n                measured: `${geo.openEdges} edge(s) not shared by exactly two faces`,\n                expected: '0 open edges (closed 2-manifold solid)',\n              },\n            ],\n            geo: { triangles: geo.triangles, degenerateFaces: geo.degenerateFaces },\n            stlPath,\n          }),\n        }\n      }\n\n      const scored = scoreAgainstSpec(geo, tris, spec)\n      return {\n        resolved: scored.resolved,\n        score: scored.score,\n        detail: JSON.stringify({\n          failed: scored.failed.map((c) => ({ name: c.name, measured: c.measured, expected: c.expected })),\n          checks: Object.fromEntries(scored.checks.map((c) => [c.name, c.ok])),\n          geo: {\n            triangles: geo.triangles,\n            solids: geo.solids,\n            volume: +geo.volume.toFixed(2),\n            degenerateFaces: geo.degenerateFaces,\n            bbox: {\n              x: +geo.bbox.size.x.toFixed(3),\n              y: +geo.bbox.size.y.toFixed(3),\n              z: +geo.bbox.size.z.toFixed(3),\n            },\n          },\n          stlPath,\n        }),\n      }\n    },\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,MAAM,gBAAgB,UAAU,QAAQ;;AA0BxC,MAAM,iBAAiB;AACvB,MAAM,WAAW;;AAQjB,SAAgB,cAAc,KAAoB;CAChD,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,IAAI,MAAM,IAAI,GAAG;EAClC,MAAM,IAAI,KAAK,KAAK,CAAC,CAAC,MAAM,kCAAkC;EAC9D,IAAI,CAAC,GAAG;EACR,MAAM,IAAI,OAAO,EAAE,EAAE;EACrB,MAAM,IAAI,OAAO,EAAE,EAAE;EACrB,MAAM,IAAI,OAAO,EAAE,EAAE;EACrB,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,GAAG;EACvE,MAAM,KAAK;GAAE;GAAG;GAAG;EAAE,CAAC;CACxB;CACA,MAAM,OAAc,CAAC;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,GAAG,KAAK,KAAK;EAAC,MAAM;EAAK,MAAM,IAAI;EAAK,MAAM,IAAI;CAAG,CAAC;CACjG,OAAO;AACT;;AAGA,SAAS,UAAU,GAAiB;CAClC,MAAM,KAAK,OAAe,KAAK,MAAM,IAAI,cAAc,IAAI,eAAA,CAAgB,QAAQ,CAAC;CACpF,OAAO,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;AACrC;AAEA,SAAS,IAAI,GAAS,GAAe;CACnC,OAAO;EAAE,GAAG,EAAE,IAAI,EAAE;EAAG,GAAG,EAAE,IAAI,EAAE;EAAG,GAAG,EAAE,IAAI,EAAE;CAAE;AACpD;AACA,SAAS,MAAM,GAAS,GAAe;CACrC,OAAO;EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;EAAG,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;EAAG,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;CAAE;AACxF;AACA,SAAS,IAAI,GAAS,GAAiB;CACrC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AACzC;AACA,SAAS,KAAK,GAAiB;CAC7B,OAAO,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;AAC5B;AACA,SAAS,UAAU,GAAe;CAChC,MAAM,IAAI,KAAK,CAAC;CAChB,OAAO;EAAE,GAAG,EAAE,IAAI;EAAG,GAAG,EAAE,IAAI;EAAG,GAAG,EAAE,IAAI;CAAE;AAC9C;;AAGA,SAAS,SAAS,QAAoB,GAAmB;CACvD,IAAI,IAAI;CACR,OAAO,OAAO,OAAO,GAAG,IAAI,OAAO;CACnC,IAAI,IAAI;CACR,OAAO,OAAO,OAAO,GAAG;EACtB,MAAM,OAAO,OAAO;EACpB,OAAO,KAAK;EACZ,IAAI;CACN;CACA,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,YAAY,MAA2B;CACrD,IAAI,KAAK,WAAW,GAAG;EACrB,MAAM,OAAO;GAAE,GAAG;GAAG,GAAG;GAAG,GAAG;EAAE;EAChC,OAAO;GACL,WAAW;GACX,WAAW;GACX,YAAY;GACZ,iBAAiB;GACjB,QAAQ;GACR,QAAQ;GACR,MAAM;IAAE,KAAK;IAAM,KAAK;IAAM,MAAM;GAAK;EAC3C;CACF;CAEA,MAAM,MAAY;EAAE,GAAG,OAAO;EAAmB,GAAG,OAAO;EAAmB,GAAG,OAAO;CAAkB;CAC1G,MAAM,MAAY;EAAE,GAAG,OAAO;EAAmB,GAAG,OAAO;EAAmB,GAAG,OAAO;CAAkB;CAC1G,MAAM,4BAAY,IAAI,IAAsB;CAC5C,MAAM,SAAS,IAAI,WAAW,KAAK,MAAM;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,OAAO,KAAK;CAClD,IAAI,kBAAkB;CACtB,IAAI,UAAU;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,CAAC,GAAG,GAAG,KAAK,KAAK;EACvB,KAAK,MAAM,KAAK;GAAC;GAAG;GAAG;EAAC,GAAG;GACzB,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;GAC3B,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;GAC3B,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;GAC3B,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;GAC3B,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;GAC3B,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;EAC7B;EACA,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,UAAU,mBAAmB;EACrE,WAAW,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;EAE7B,MAAM,KAAK,UAAU,CAAC;EACtB,MAAM,KAAK,UAAU,CAAC;EACtB,MAAM,KAAK,UAAU,CAAC;EACtB,KAAK,MAAM,CAAC,GAAG,MAAM;GACnB,CAAC,IAAI,EAAE;GACP,CAAC,IAAI,EAAE;GACP,CAAC,IAAI,EAAE;EACT,GAAY;GACV,MAAM,MAAM,IAAI,IAAI,GAAG,EAAE,GAAG,MAAM,GAAG,EAAE,GAAG;GAC1C,MAAM,OAAO,UAAU,IAAI,GAAG;GAC9B,IAAI,MAAM,KAAK,KAAK,CAAC;QAChB,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC;EAC7B;CACF;CAEA,IAAI,YAAY;CAChB,KAAK,MAAM,SAAS,UAAU,OAAO,GAAG;EACtC,IAAI,MAAM,WAAW,GAAG,aAAa;EAErC,MAAM,QAAQ,SAAS,QAAQ,MAAM,EAAG;EACxC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,QAAQ,SAAS,QAAQ,MAAM,EAAG;GACxC,IAAI,UAAU,OAAO,OAAO,SAAS;EACvC;CACF;CAEA,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,MAAM,IAAI,SAAS,QAAQ,CAAC,CAAC;CAEnE,OAAO;EACL,WAAW,KAAK;EAChB;EACA,YAAY,cAAc;EAC1B;EACA,QAAQ,KAAK,IAAI,OAAO,IAAI;EAC5B,QAAQ,MAAM;EACd,MAAM;GACJ,KAAK,EAAE,GAAG,IAAI;GACd,KAAK,EAAE,GAAG,IAAI;GACd,MAAM;IAAE,GAAG,IAAI,IAAI,IAAI;IAAG,GAAG,IAAI,IAAI,IAAI;IAAG,GAAG,IAAI,IAAI,IAAI;GAAE;EAC/D;CACF;AACF;;;;;;;AAYA,MAAM,iBAAkC;CACtC,UAAU;EAAE,GAAG;EAAG,GAAG;EAAW,GAAG;CAAU,CAAC;CAC9C,UAAU;EAAE,GAAG;EAAY,GAAG;EAAG,GAAG;CAAS,CAAC;CAC9C,UAAU;EAAE,GAAG;EAAW,GAAG;EAAY,GAAG;CAAE,CAAC;AACjD;;AAGA,MAAM,WAAW;AACjB,MAAM,UAAU;AAChB,MAAM,QAAQ;AACd,MAAM,cAAc;;AAGpB,SAAS,WAAW,MAA4B;CAC9C,IAAI,IAAI,SAAS;CACjB,aAAa;EACX,IAAK,IAAI,eAAgB;EACzB,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;;AAGA,SAAS,aAAa,GAAS,UAA0B;CACvD,IAAI,IAAI,aAAa;CACrB,KAAK,MAAM,KAAK;EAAC,EAAE;EAAG,EAAE;EAAG,EAAE;CAAC,GAAG;EAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,GAAG,IAAI;EACnC,IAAI,KAAK,KAAK,IAAK,OAAO,OAAS,QAAQ;EAC3C,IAAI,KAAK,KAAK,IAAM,SAAS,KAAM,OAAS,QAAQ;CACtD;CACA,OAAO,MAAM;AACf;;;;;;AASA,SAAS,QAAQ,MAAa,QAAc,KAAuB;CACjE,IAAI,YAAY;CAChB,KAAK,MAAM,CAAC,IAAI,IAAI,OAAO,MAAM;EAC/B,MAAM,KAAK,IAAI,IAAI,EAAE;EACrB,MAAM,KAAK,IAAI,IAAI,EAAE;EACrB,MAAM,IAAI,MAAM,KAAK,EAAE;EACvB,MAAM,MAAM,IAAI,IAAI,CAAC;EACrB,MAAM,QAAQ,KAAK,EAAE,IAAI,KAAK,EAAE;EAChC,IAAI,KAAK,IAAI,GAAG,KAAK,UAAU,KAAK,IAAI,OAAO,CAAC,GAAG;GAIjD,MAAM,IAAI,MAAM,IAAI,EAAE;GACtB,MAAM,KAAK,KAAK,CAAC;GACjB,IAAI,KAAK,YAAY,KAAK,IAAI,IAAI,IAAI,QAAQ,EAAE,GAAG,CAAC,CAAC,IAAI,MAAM,OAAO,OAAO,EAAE,YAAY,KAAK;GAChG;EACF;EACA,MAAM,IAAI,IAAI;EACd,MAAM,IAAI,IAAI,QAAQ,EAAE;EACxB,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC;EACtB,MAAM,IAAI,MAAM,GAAG,EAAE;EACrB,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC;EACxB,MAAM,IAAI,IAAI,IAAI;EAClB,IAAI,IAAI,SAAa,IAAI,SAAa,IAAI,OAAW;EACrD,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC;EACvB,IAAI,IAAI,OAAQ;EAGhB,IAAI,KAAK,IAAI,CAAC,KAAK,OAAO,OAAO,EAAE,YAAY,KAAK;EACpD,IAAI,KAAK,YAAY,KAAK,YAAY,KAAK,UAAU,OAAO,EAAE,YAAY,KAAK;EAC/E,aAAa;CACf;CACA,OAAO,EAAE,UAAU;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,SAAgB,aAAa,MAAa,OAAsB;CAC9D,IAAI,SAAS;CACb,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;EAC9C,MAAM,OAAO,eAAe;EAC5B,MAAM,OAAO,WAAW,aAAa,OAAO,CAAC,CAAC;EAC9C,IAAI,MAAM;EACV,KAAK,IAAI,UAAU,GAAG,WAAW,aAAa,WAAW;GACvD,MAAM,IAAI,QAAQ,MAAM,OAAO,GAAG;GAClC,IAAI,EAAE,gBAAgB,IAAI;IACxB,SAAS;IACT,IAAI,EAAE,YAAY,MAAM,GAAG,UAAU;IACrC;GACF;GACA,MAAM,UAAU;IACd,GAAG,KAAK,KAAK,KAAK,IAAI,MAAO;IAC7B,GAAG,KAAK,KAAK,KAAK,IAAI,MAAO;IAC7B,GAAG,KAAK,KAAK,KAAK,IAAI,MAAO;GAC/B,CAAC;EACH;CACF;CAGA,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO,SAAS,IAAI;AACtB;AAoBA,SAAS,OAAO,GAAW,CAAC,IAAI,KAAgC;CAC9D,OAAO,KAAK,MAAM,KAAK;AACzB;AAEA,SAAS,IAAI,GAAmB;CAC9B,OAAO,OAAO,KAAK,MAAM,IAAI,GAAI,IAAI,GAAI;AAC3C;AAEA,SAAS,GAAG,GAA8C;CACxD,OAAO,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG;AACpC;;AAGA,SAAgB,iBAAiB,KAAmB,MAAa,MAA6B;CAC5F,MAAM,SAAsB,CAAC;CAC7B,MAAM,OAAO,MAAc,IAAa,UAAkB,aACxD,OAAO,KAAK;EAAE;EAAM;EAAI;EAAU;CAAS,CAAC;CAE9C,KAAK,MAAM,QAAQ;EAAC;EAAK;EAAK;CAAG,GAAY;EAC3C,MAAM,OAAO,KAAK,OAAO;EACzB,IAAI,CAAC,MAAM;EACX,MAAM,MAAM,IAAI,KAAK,KAAK;EAC1B,IAAI,OAAO,KAAK,YAAY,KAAK,OAAO,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,EAAE;CAC1F;CACA,IAAI,KAAK,QAAQ,IAAI,UAAU,OAAO,IAAI,QAAQ,KAAK,MAAM,GAAG,IAAI,IAAI,MAAM,GAAG,IAAI,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,GAAG,EAAE;CACzH,IAAI,KAAK,QAAQ,IAAI,UAAU,OAAO,IAAI,QAAQ,KAAK,MAAM,GAAG,OAAO,IAAI,MAAM,GAAG,IAAI,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,GAAG,EAAE;CAC5H,IAAI,KAAK,gBAAgB,MACvB,IAAI,gBAAgB,IAAI,aAAa,KAAK,cAAc,OAAO,IAAI,SAAS,GAAG,MAAM,KAAK,cAAc;CAE1G,KAAK,MAAM,CAAC,GAAG,OAAO,KAAK,qBAAqB,CAAC,EAAA,CAAG,QAAQ,GAAG;EAC7D,MAAM,MAAM,aAAa,MAAM;GAAE,GAAG,EAAE;GAAI,GAAG,EAAE;GAAI,GAAG,EAAE;EAAG,CAAC;EAC5D,IAAI,eAAe,EAAE,IAAI,GAAG,CAAC,KAAK,KAAK,MAAM,WAAW,WAAW,QAAQ;CAC7E;CACA,KAAK,MAAM,CAAC,GAAG,OAAO,KAAK,sBAAsB,CAAC,EAAA,CAAG,QAAQ,GAAG;EAC9D,MAAM,MAAM,aAAa,MAAM;GAAE,GAAG,EAAE;GAAI,GAAG,EAAE;GAAI,GAAG,EAAE;EAAG,CAAC;EAC5D,IAAI,gBAAgB,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,MAAM,WAAW,WAAW,SAAS;CAChF;CAEA,MAAM,SAAS,OAAO,QAAQ,MAAM,CAAC,EAAE,EAAE;CAEzC,OAAO;EAAE;EAAQ;EAAQ,OADX,OAAO,UAAU,OAAO,SAAS,OAAO,UAAU,OAAO,SAAS;EAChD,UAAU,OAAO,SAAS,KAAK,OAAO,WAAW;CAAE;AACrF;;AAcA,eAAe,SAAS,MAAgB,KAA0D;CAChG,OAAO,cAAc,YAAY;EAAC;EAAM;EAAY,GAAG;CAAI,GAAG;EAC5D;EACA,WAAW,OAAO,OAAO;EACzB,SAAS;CACX,CAAC;AACH;;;;;;AAOA,SAAgB,eAAe,UAA0B;CACvD,MAAM,UAAU,SAAS,KAAK;CAC9B,MAAM,SAAS,mCAAmC,KAAK,OAAO;CAC9D,QAAQ,SAAS,OAAO,KAAM,QAAA,CAAS,KAAK;AAC9C;;AAGA,eAAsB,kBACpB,KACwG;CACxG,MAAM,MAAM,MAAM,QAAQ,KAAK,OAAO,GAAG,OAAO,CAAC;CACjD,MAAM,WAAW,KAAK,KAAK,YAAY;CACvC,MAAM,UAAU,KAAK,KAAK,WAAW;CACrC,MAAM,UAAU,UAAU,GAAG,IAAI,GAAG;CAEpC,IAAI;EACF,MAAM,SAAS;GAAC;GAA4B;GAAM;GAAS;EAAQ,GAAG,GAAG;CAC3E,SAAS,KAAK;EAEZ,OAAO;GAAE,IAAI;GAAO,QAAQ,oBADhB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,EAAA,CACR,MAAM,GAAG,GAAG;EAAI;CACrE;CAEA,IAAI;CACJ,IAAI;EACF,MAAM,MAAM,SAAS,SAAS,MAAM;CACtC,QAAQ;EACN,OAAO;GAAE,IAAI;GAAO,QAAQ;EAAgD;CAC9E;CACA,MAAM,OAAO,cAAc,GAAG;CAC9B,IAAI,KAAK,WAAW,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAgD;CACnG,OAAO;EAAE,IAAI;EAAM,KAAK,YAAY,IAAI;EAAG;EAAM;CAAQ;AAC3D;AAEA,SAAgB,yBAA2C;CACzD,OAAO;EACL,MAAM;EAEN,MAAM,YAAY;GAChB,IAAI;IACF,MAAM,cAAc,YAAY;KAAC;KAAM;KAAY;IAAW,GAAG,EAAE,SAAS,IAAO,CAAC;GACtF,SAAS,KAAK;IACZ,MAAM,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;IAC3D,MAAM,IAAI,MACR,0BAA0B,IAAI,sMAGhC;GACF;EACF;EAEA,MAAM,UAAU,OAAoB,CAAC,GAAG;GACtC,IAAI,QAAoB;GACxB,IAAI,KAAK,KAAK,QAAQ,MAAM,QAAQ,MAAM,KAAK,KAAK,SAAS,EAAE,EAAE,CAAC;GAClE,IAAI,KAAK,SAAS,MAAM,QAAQ,MAAM,MAAM,GAAG,KAAK,KAAK;GACzD,OAAO,MAAM,KACV,OAAkB;IACjB,IAAI,EAAE;IACN,QAAQ,EAAE;IACV,UAAU;KAAE,MAAM,EAAE;KAAM,QAAQ,EAAE;KAAQ,YAAY,EAAE;IAAW;GACvE,EACF;EACF;EAEA,MAAM,aAAa,MAAiB;GAClC,OAAO,WAAW,KAAK;EACzB;EAEA,MAAM,MAAM,MAAiB,UAAuC;GAClE,MAAM,OAAQ,KAAK,UAAuC;GAC1D,IAAI,CAAC,MAAM,OAAO;IAAE,UAAU;IAAO,OAAO;IAAG,QAAQ,QAAQ,KAAK,GAAG;GAAuB;GAE9F,MAAM,MAAM,eAAe,QAAQ;GACnC,IAAI,CAAC,KAAK,OAAO;IAAE,UAAU;IAAO,OAAO;IAAG,QAAQ;GAAiB;GAEvE,MAAM,QAAQ,MAAM,kBAAkB,GAAG;GACzC,IAAI,CAAC,MAAM,IAAI,OAAO;IAAE,UAAU;IAAO,OAAO;IAAG,QAAQ,MAAM;GAAO;GAExE,MAAM,EAAE,KAAK,MAAM,YAAY;GAC/B,IAAI,CAAC,IAAI,YACP,OAAO;IACL,UAAU;IACV,OAAO;IACP,QAAQ,KAAK,UAAU;KACrB,MAAM;KACN,QAAQ,CACN;MACE,MAAM;MACN,UAAU,GAAG,IAAI,UAAU;MAC3B,UAAU;KACZ,CACF;KACA,KAAK;MAAE,WAAW,IAAI;MAAW,iBAAiB,IAAI;KAAgB;KACtE;IACF,CAAC;GACH;GAGF,MAAM,SAAS,iBAAiB,KAAK,MAAM,IAAI;GAC/C,OAAO;IACL,UAAU,OAAO;IACjB,OAAO,OAAO;IACd,QAAQ,KAAK,UAAU;KACrB,QAAQ,OAAO,OAAO,KAAK,OAAO;MAAE,MAAM,EAAE;MAAM,UAAU,EAAE;MAAU,UAAU,EAAE;KAAS,EAAE;KAC/F,QAAQ,OAAO,YAAY,OAAO,OAAO,KAAK,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;KACnE,KAAK;MACH,WAAW,IAAI;MACf,QAAQ,IAAI;MACZ,QAAQ,CAAC,IAAI,OAAO,QAAQ,CAAC;MAC7B,iBAAiB,IAAI;MACrB,MAAM;OACJ,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,QAAQ,CAAC;OAC7B,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,QAAQ,CAAC;OAC7B,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,QAAQ,CAAC;MAC/B;KACF;KACA;IACF,CAAC;GACH;EACF;CACF;AACF"}