@zkmake/three-audit 0.1.0 → 0.2.1

package/dist/cli.js

@@ -0,0 +1,144 @@
+#!/usr/bin/env node
+import { t as auditScene } from "./audit-scene-D5ZaENGZ.js";
+import { t as loadModel } from "./load-nqfCU3-k.js";
+import { basename } from "node:path";
+import { readFileSync } from "node:fs";
+import { parseArgs } from "node:util";
+//#region src/cli/main.ts
+/**
+* `three-audit model.glb [more.gltf …]`: load each model in Node and check it for z-fighting and
+* NaN geometry. Exits 1 when a check fails, so it can gate CI; `--json` for machines.
+*/
+const HELP = `Usage: three-audit <model.glb|model.gltf>… [options]
+
+Checks glTF models for z-fighting (faces in one plane, facing the same way, overlapping) and
+geometry that renders NaN (non-finite positions or normals, zero-length normals). Exits 1 when
+any model fails a check, 2 when a model can't be read.
+
+Options:
+  --gap <m>       How close two planes count as one, in metres (default 0.004)
+  --self          Also check for z-fighting within each mesh (merged geometry)
+  --skip <regex>  Leave out objects whose name matches, and everything under them (decals)
+  --top <n>       List the n costliest meshes (default 5, 0 for none)
+  --json          Print the reports as JSON
+  --no-fail       Exit 0 even when a check fails
+  -h, --help      Show this help
+  -v, --version   Show the version
+
+Draco and Meshopt models need draco3dgltf / meshoptimizer installed alongside.`;
+/** This package's version: its package.json is the nearest one up from here (`src/cli` or `dist`). */
+const version = () => {
+	for (let up = "../"; up.length <= 12; up += "../") try {
+		const pkg = JSON.parse(readFileSync(new URL(`${up}package.json`, import.meta.url), "utf8"));
+		if (pkg.name === "@zkmake/three-audit") return pkg.version;
+	} catch {}
+	return "unknown";
+};
+const count = (value) => value.toLocaleString("en-US");
+const printReport = (file, report, top) => {
+	const lines = [`${basename(file)}  ${count(report.triangles)} triangles`];
+	if (report.zFighting.length === 0) lines.push("  ✓ no z-fighting");
+	else {
+		lines.push(`  ✗ ${report.zFighting.length} z-fighting pair${report.zFighting.length === 1 ? "" : "s"}`);
+		for (const row of report.zFighting) lines.push(`      ${row.a}`, `    ↔ ${row.b}  (${row.triangles} triangles)`);
+	}
+	if (report.badGeometry.length === 0) lines.push("  ✓ no NaN geometry");
+	else {
+		lines.push(`  ✗ ${report.badGeometry.length} mesh${report.badGeometry.length === 1 ? "" : "es"} with NaN geometry`);
+		for (const row of report.badGeometry) lines.push(`      ${row.mesh}${row.under ? ` (${row.under})` : ""}: ${row.nonFinite} non-finite, ${row.zeroNormals} zero normals`);
+	}
+	if (top > 0 && report.meshes.length > 0) {
+		lines.push("  most triangles:");
+		for (const row of report.meshes) lines.push(`      ${count(row.total).padStart(9)}  ${row.name}${row.instances > 1 ? ` ×${row.instances}` : ""}`);
+	}
+	return lines.join("\n");
+};
+const main = async (argv) => {
+	let parsed;
+	try {
+		parsed = parseArgs({
+			args: argv,
+			allowPositionals: true,
+			options: {
+				gap: { type: "string" },
+				self: {
+					type: "boolean",
+					default: false
+				},
+				skip: { type: "string" },
+				top: { type: "string" },
+				json: {
+					type: "boolean",
+					default: false
+				},
+				"no-fail": {
+					type: "boolean",
+					default: false
+				},
+				help: {
+					type: "boolean",
+					short: "h",
+					default: false
+				},
+				version: {
+					type: "boolean",
+					short: "v",
+					default: false
+				}
+			}
+		});
+	} catch (error) {
+		console.error(`three-audit: ${error.message}\n\n${HELP}`);
+		return 2;
+	}
+	const { values, positionals } = parsed;
+	if (values.help) {
+		console.log(HELP);
+		return 0;
+	}
+	if (values.version) {
+		console.log(version());
+		return 0;
+	}
+	if (positionals.length === 0) {
+		console.error(HELP);
+		return 2;
+	}
+	const gap = values.gap === void 0 ? void 0 : Number(values.gap);
+	const top = values.top === void 0 ? 5 : Number(values.top);
+	if (gap !== void 0 && !(gap > 0) || !(top >= 0)) {
+		console.error("three-audit: --gap must be a positive number and --top zero or more");
+		return 2;
+	}
+	const skipPattern = values.skip === void 0 ? void 0 : new RegExp(values.skip);
+	const results = [];
+	for (const file of positionals) try {
+		const scene = await loadModel(file);
+		const report = auditScene(scene, {
+			top,
+			...gap === void 0 ? {} : { gap },
+			...values.self ? { self: true } : {},
+			...skipPattern ? { skip: (object) => skipPattern.test(object.name) } : {}
+		});
+		results.push({
+			file,
+			report
+		});
+	} catch (error) {
+		results.push({
+			file,
+			error: error.message
+		});
+	}
+	if (values.json) console.log(JSON.stringify(results, null, 2));
+	else console.log(results.map(({ file, report, error }) => report ? printReport(file, report, top) : `${basename(file)}\n  ✗ couldn't read: ${error}`).join("\n\n"));
+	if (results.some((result) => result.error !== void 0)) return 2;
+	return results.some(({ report }) => report.zFighting.length > 0 || report.badGeometry.length > 0) && !values["no-fail"] ? 1 : 0;
+};
+//#endregion
+//#region src/cli.ts
+/** The `three-audit` bin. The work is in `cli/main.ts`, which the tests import. */
+process.exitCode = await main(process.argv.slice(2));
+//#endregion
+
+//# sourceMappingURL=cli.js.map

package/dist/cli.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli.js","names":[],"sources":["../src/cli/main.ts","../src/cli.ts"],"sourcesContent":["/**\n * `three-audit model.glb [more.gltf …]`: load each model in Node and check it for z-fighting and\n * NaN geometry. Exits 1 when a check fails, so it can gate CI; `--json` for machines.\n */\n/* oxlint-disable no-console -- a CLI's output is the console */\nimport { readFileSync } from \"node:fs\";\nimport { basename } from \"node:path\";\nimport { parseArgs } from \"node:util\";\n\nimport { type AuditReport, auditScene } from \"../audit-scene.ts\";\nimport { loadModel } from \"../node/load.ts\";\n\nconst HELP = `Usage: three-audit <model.glb|model.gltf>… [options]\n\nChecks glTF models for z-fighting (faces in one plane, facing the same way, overlapping) and\ngeometry that renders NaN (non-finite positions or normals, zero-length normals). Exits 1 when\nany model fails a check, 2 when a model can't be read.\n\nOptions:\n  --gap <m>       How close two planes count as one, in metres (default 0.004)\n  --self          Also check for z-fighting within each mesh (merged geometry)\n  --skip <regex>  Leave out objects whose name matches, and everything under them (decals)\n  --top <n>       List the n costliest meshes (default 5, 0 for none)\n  --json          Print the reports as JSON\n  --no-fail       Exit 0 even when a check fails\n  -h, --help      Show this help\n  -v, --version   Show the version\n\nDraco and Meshopt models need draco3dgltf / meshoptimizer installed alongside.`;\n\n/** This package's version: its package.json is the nearest one up from here (`src/cli` or `dist`). */\nconst version = () => {\n  for (let up = \"../\"; up.length <= 12; up += \"../\") {\n    try {\n      const pkg = JSON.parse(\n        readFileSync(new URL(`${up}package.json`, import.meta.url), \"utf8\"),\n      ) as {\n        name?: string;\n        version: string;\n      };\n\n      if (pkg.name === \"@zkmake/three-audit\") {\n        return pkg.version;\n      }\n    } catch {\n      // Not here; one more up.\n    }\n  }\n\n  return \"unknown\";\n};\n\nconst count = (value: number) => value.toLocaleString(\"en-US\");\n\nconst printReport = (file: string, report: AuditReport, top: number) => {\n  const lines = [`${basename(file)}  ${count(report.triangles)} triangles`];\n\n  if (report.zFighting.length === 0) {\n    lines.push(\"  ✓ no z-fighting\");\n  } else {\n    lines.push(\n      `  ✗ ${report.zFighting.length} z-fighting pair${report.zFighting.length === 1 ? \"\" : \"s\"}`,\n    );\n\n    for (const row of report.zFighting) {\n      lines.push(`      ${row.a}`, `    ↔ ${row.b}  (${row.triangles} triangles)`);\n    }\n  }\n\n  if (report.badGeometry.length === 0) {\n    lines.push(\"  ✓ no NaN geometry\");\n  } else {\n    lines.push(\n      `  ✗ ${report.badGeometry.length} mesh${report.badGeometry.length === 1 ? \"\" : \"es\"} with NaN geometry`,\n    );\n\n    for (const row of report.badGeometry) {\n      lines.push(\n        `      ${row.mesh}${row.under ? ` (${row.under})` : \"\"}: ${row.nonFinite} non-finite, ${row.zeroNormals} zero normals`,\n      );\n    }\n  }\n\n  if (top > 0 && report.meshes.length > 0) {\n    lines.push(\"  most triangles:\");\n\n    for (const row of report.meshes) {\n      lines.push(\n        `      ${count(row.total).padStart(9)}  ${row.name}${row.instances > 1 ? ` ×${row.instances}` : \"\"}`,\n      );\n    }\n  }\n\n  return lines.join(\"\\n\");\n};\n\nexport const main = async (argv: string[]): Promise<number> => {\n  let parsed;\n\n  try {\n    parsed = parseArgs({\n      args: argv,\n      allowPositionals: true,\n      options: {\n        gap: { type: \"string\" },\n        self: { type: \"boolean\", default: false },\n        skip: { type: \"string\" },\n        top: { type: \"string\" },\n        json: { type: \"boolean\", default: false },\n        \"no-fail\": { type: \"boolean\", default: false },\n        help: { type: \"boolean\", short: \"h\", default: false },\n        version: { type: \"boolean\", short: \"v\", default: false },\n      },\n    });\n  } catch (error) {\n    console.error(`three-audit: ${(error as Error).message}\\n\\n${HELP}`);\n\n    return 2;\n  }\n\n  const { values, positionals } = parsed;\n\n  if (values.help) {\n    console.log(HELP);\n\n    return 0;\n  }\n\n  if (values.version) {\n    console.log(version());\n\n    return 0;\n  }\n\n  if (positionals.length === 0) {\n    console.error(HELP);\n\n    return 2;\n  }\n\n  const gap = values.gap === undefined ? undefined : Number(values.gap);\n  const top = values.top === undefined ? 5 : Number(values.top);\n\n  if ((gap !== undefined && !(gap > 0)) || !(top >= 0)) {\n    console.error(\"three-audit: --gap must be a positive number and --top zero or more\");\n\n    return 2;\n  }\n\n  const skipPattern = values.skip === undefined ? undefined : new RegExp(values.skip);\n  const results: { file: string; report?: AuditReport; error?: string }[] = [];\n\n  for (const file of positionals) {\n    try {\n      const scene = await loadModel(file);\n      const report = auditScene(scene, {\n        top,\n        ...(gap === undefined ? {} : { gap }),\n        ...(values.self ? { self: true } : {}),\n        ...(skipPattern ? { skip: (object) => skipPattern.test(object.name) } : {}),\n      });\n\n      results.push({ file, report });\n    } catch (error) {\n      results.push({ file, error: (error as Error).message });\n    }\n  }\n\n  if (values.json) {\n    console.log(JSON.stringify(results, null, 2));\n  } else {\n    console.log(\n      results\n        .map(({ file, report, error }) =>\n          report\n            ? printReport(file, report, top)\n            : `${basename(file)}\\n  ✗ couldn't read: ${error}`,\n        )\n        .join(\"\\n\\n\"),\n    );\n  }\n\n  if (results.some((result) => result.error !== undefined)) {\n    return 2;\n  }\n\n  const failed = results.some(\n    ({ report }) => report!.zFighting.length > 0 || report!.badGeometry.length > 0,\n  );\n\n  return failed && !values[\"no-fail\"] ? 1 : 0;\n};\n","#!/usr/bin/env node\n/** The `three-audit` bin. The work is in `cli/main.ts`, which the tests import. */\nimport { main } from \"./cli/main.ts\";\n\nprocess.exitCode = await main(process.argv.slice(2));\n"],"mappings":";;;;;;;;;;;AAYA,MAAM,OAAO;;;;;;;;;;;;;;;;;;AAmBb,MAAM,gBAAgB;CACpB,KAAK,IAAI,KAAK,OAAO,GAAG,UAAU,IAAI,MAAM,OAC1C,IAAI;EACF,MAAM,MAAM,KAAK,MACf,aAAa,IAAI,IAAI,GAAG,GAAG,eAAe,YAAY,GAAG,GAAG,MAAM,CACpE;EAKA,IAAI,IAAI,SAAS,uBACf,OAAO,IAAI;CAEf,QAAQ,CAER;CAGF,OAAO;AACT;AAEA,MAAM,SAAS,UAAkB,MAAM,eAAe,OAAO;AAE7D,MAAM,eAAe,MAAc,QAAqB,QAAgB;CACtE,MAAM,QAAQ,CAAC,GAAG,SAAS,IAAI,EAAE,IAAI,MAAM,OAAO,SAAS,EAAE,WAAW;CAExE,IAAI,OAAO,UAAU,WAAW,GAC9B,MAAM,KAAK,mBAAmB;MACzB;EACL,MAAM,KACJ,OAAO,OAAO,UAAU,OAAO,kBAAkB,OAAO,UAAU,WAAW,IAAI,KAAK,KACxF;EAEA,KAAK,MAAM,OAAO,OAAO,WACvB,MAAM,KAAK,SAAS,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,IAAI,UAAU,YAAY;CAE/E;CAEA,IAAI,OAAO,YAAY,WAAW,GAChC,MAAM,KAAK,qBAAqB;MAC3B;EACL,MAAM,KACJ,OAAO,OAAO,YAAY,OAAO,OAAO,OAAO,YAAY,WAAW,IAAI,KAAK,KAAK,mBACtF;EAEA,KAAK,MAAM,OAAO,OAAO,aACvB,MAAM,KACJ,SAAS,IAAI,OAAO,IAAI,QAAQ,KAAK,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,UAAU,eAAe,IAAI,YAAY,cAC1G;CAEJ;CAEA,IAAI,MAAM,KAAK,OAAO,OAAO,SAAS,GAAG;EACvC,MAAM,KAAK,mBAAmB;EAE9B,KAAK,MAAM,OAAO,OAAO,QACvB,MAAM,KACJ,SAAS,MAAM,IAAI,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,OAAO,IAAI,YAAY,IAAI,KAAK,IAAI,cAAc,IAClG;CAEJ;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB;AAEA,MAAa,OAAO,OAAO,SAAoC;CAC7D,IAAI;CAEJ,IAAI;EACF,SAAS,UAAU;GACjB,MAAM;GACN,kBAAkB;GAClB,SAAS;IACP,KAAK,EAAE,MAAM,SAAS;IACtB,MAAM;KAAE,MAAM;KAAW,SAAS;IAAM;IACxC,MAAM,EAAE,MAAM,SAAS;IACvB,KAAK,EAAE,MAAM,SAAS;IACtB,MAAM;KAAE,MAAM;KAAW,SAAS;IAAM;IACxC,WAAW;KAAE,MAAM;KAAW,SAAS;IAAM;IAC7C,MAAM;KAAE,MAAM;KAAW,OAAO;KAAK,SAAS;IAAM;IACpD,SAAS;KAAE,MAAM;KAAW,OAAO;KAAK,SAAS;IAAM;GACzD;EACF,CAAC;CACH,SAAS,OAAO;EACd,QAAQ,MAAM,gBAAiB,MAAgB,QAAQ,MAAM,MAAM;EAEnE,OAAO;CACT;CAEA,MAAM,EAAE,QAAQ,gBAAgB;CAEhC,IAAI,OAAO,MAAM;EACf,QAAQ,IAAI,IAAI;EAEhB,OAAO;CACT;CAEA,IAAI,OAAO,SAAS;EAClB,QAAQ,IAAI,QAAQ,CAAC;EAErB,OAAO;CACT;CAEA,IAAI,YAAY,WAAW,GAAG;EAC5B,QAAQ,MAAM,IAAI;EAElB,OAAO;CACT;CAEA,MAAM,MAAM,OAAO,QAAQ,KAAA,IAAY,KAAA,IAAY,OAAO,OAAO,GAAG;CACpE,MAAM,MAAM,OAAO,QAAQ,KAAA,IAAY,IAAI,OAAO,OAAO,GAAG;CAE5D,IAAK,QAAQ,KAAA,KAAa,EAAE,MAAM,MAAO,EAAE,OAAO,IAAI;EACpD,QAAQ,MAAM,qEAAqE;EAEnF,OAAO;CACT;CAEA,MAAM,cAAc,OAAO,SAAS,KAAA,IAAY,KAAA,IAAY,IAAI,OAAO,OAAO,IAAI;CAClF,MAAM,UAAoE,CAAC;CAE3E,KAAK,MAAM,QAAQ,aACjB,IAAI;EACF,MAAM,QAAQ,MAAM,UAAU,IAAI;EAClC,MAAM,SAAS,WAAW,OAAO;GAC/B;GACA,GAAI,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,IAAI;GACnC,GAAI,OAAO,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;GACpC,GAAI,cAAc,EAAE,OAAO,WAAW,YAAY,KAAK,OAAO,IAAI,EAAE,IAAI,CAAC;EAC3E,CAAC;EAED,QAAQ,KAAK;GAAE;GAAM;EAAO,CAAC;CAC/B,SAAS,OAAO;EACd,QAAQ,KAAK;GAAE;GAAM,OAAQ,MAAgB;EAAQ,CAAC;CACxD;CAGF,IAAI,OAAO,MACT,QAAQ,IAAI,KAAK,UAAU,SAAS,MAAM,CAAC,CAAC;MAE5C,QAAQ,IACN,QACG,KAAK,EAAE,MAAM,QAAQ,YACpB,SACI,YAAY,MAAM,QAAQ,GAAG,IAC7B,GAAG,SAAS,IAAI,EAAE,uBAAuB,OAC/C,CAAC,CACA,KAAK,MAAM,CAChB;CAGF,IAAI,QAAQ,MAAM,WAAW,OAAO,UAAU,KAAA,CAAS,GACrD,OAAO;CAOT,OAJe,QAAQ,MACpB,EAAE,aAAa,OAAQ,UAAU,SAAS,KAAK,OAAQ,YAAY,SAAS,CAGnE,KAAK,CAAC,OAAO,aAAa,IAAI;AAC5C;;;;AC3LA,QAAQ,WAAW,MAAM,KAAK,QAAQ,KAAK,MAAM,CAAC,CAAC"}

package/dist/index.js

@@ -1,414 +1,4 @@
-//#region src/scene.ts
-/** Depth-first, in child order. A skipped (or, with `visibleOnly`, hidden) object prunes its subtree. */
-const walk = (root, options, visit) => {
-	const stack = [root];
-	while (stack.length > 0) {
-		const object = stack.pop();
-		if (options.visibleOnly === true && !object.visible || options.skip?.(object) === true) continue;
-		visit(object);
-		for (let i = object.children.length - 1; i >= 0; i -= 1) stack.push(object.children[i]);
-	}
-};
-const isMesh = (object) => object.isMesh === true;
-const isInstanced = (mesh) => mesh.isInstancedMesh === true;
-const isBatched = (mesh) => mesh.isBatchedMesh === true;
-/** Triangles one draw of this geometry makes: indexed or not, within its draw range. */
-const triangleCount = (geometry) => {
-	const elements = geometry.index?.count ?? geometry.attributes.position?.count ?? 0;
-	const { start, count } = geometry.drawRange;
-	const drawn = Math.min(elements, start + count) - start;
-	return Math.max(0, Math.floor(drawn / 3));
-};
-/** Triangles a batch draws across its visible instances, and how many instances that is. */
-const batchedTriangles = (batch) => {
-	let triangles = 0;
-	let instances = 0;
-	for (let id = 0; id < batch.maxInstanceCount; id += 1) {
-		let geometryId;
-		try {
-			if (!batch.getVisibleAt(id)) continue;
-			geometryId = batch.getGeometryIdAt(id);
-		} catch {
-			continue;
-		}
-		const range = batch.getGeometryRangeAt(geometryId);
-		const elements = range.count ?? (batch.geometry.index ? range.indexCount : range.vertexCount);
-		triangles += Math.floor(elements / 3);
-		instances += 1;
-	}
-	return {
-		instances,
-		triangles
-	};
-};
-/** The tag of the nearest tagged ancestor (the object itself included), or `null`. */
-const tagOf = (object, tagKey) => {
-	for (let at = object; at; at = at.parent) {
-		const tag = at.userData[tagKey];
-		if (tag !== void 0 && tag !== null) return String(tag);
-	}
-	return null;
-};
-const hasTag = (root, tagKey, skip) => {
-	let found = false;
-	walk(root, { skip }, (object) => {
-		found ||= object.userData[tagKey] !== void 0 && object.userData[tagKey] !== null;
-	});
-	return found;
-};
-const meshName = (mesh) => mesh.name || mesh.geometry.name || mesh.geometry.type;
-const materialName = (mesh) => {
-	const material = Array.isArray(mesh.material) ? mesh.material[0] : mesh.material;
-	return material ? material.name || material.type : "none";
-};
-/** Adds a property JSON and `console.table` leave out: a live object that would serialise the scene. */
-const withHidden = (row, key, value) => Object.defineProperty(row, key, {
-	value,
-	enumerable: false
-});
-//#endregion
-//#region src/bad-geometry.ts
-const corner = (geometry, k) => geometry.index?.getX(k) ?? k;
-const check = (geometry) => {
-	const position = geometry.attributes.position;
-	const normal = geometry.attributes.normal;
-	const flagged = new Uint8Array(position.count);
-	let nonFinite = 0;
-	let zeroNormals = 0;
-	for (let v = 0; v < position.count; v += 1) if (!(Number.isFinite(position.getX(v)) && Number.isFinite(position.getY(v)) && Number.isFinite(position.getZ(v)) && (!normal || Number.isFinite(normal.getX(v)) && Number.isFinite(normal.getY(v)) && Number.isFinite(normal.getZ(v))))) {
-		flagged[v] = 1;
-		nonFinite += 1;
-	}
-	if (!normal) return {
-		nonFinite,
-		zeroNormals
-	};
-	const corners = geometry.index?.count ?? position.count;
-	for (let k = 0; k + 2 < corners; k += 3) {
-		const a = corner(geometry, k);
-		const b = corner(geometry, k + 1);
-		const c = corner(geometry, k + 2);
-		const ux = position.getX(b) - position.getX(a);
-		const uy = position.getY(b) - position.getY(a);
-		const uz = position.getZ(b) - position.getZ(a);
-		const vx = position.getX(c) - position.getX(a);
-		const vy = position.getY(c) - position.getY(a);
-		const vz = position.getZ(c) - position.getZ(a);
-		if (!(Math.hypot(uy * vz - uz * vy, uz * vx - ux * vz, ux * vy - uy * vx) > 1e-8)) continue;
-		for (const v of [
-			a,
-			b,
-			c
-		]) if (flagged[v] === 0 && Math.hypot(normal.getX(v), normal.getY(v), normal.getZ(v)) < 1e-4) {
-			flagged[v] = 1;
-			zeroNormals += 1;
-		}
-	}
-	return {
-		nonFinite,
-		zeroNormals
-	};
-};
-/** Meshes with geometry that renders NaN, hidden ones included. `[]` is a pass. */
-const findBadGeometry = (root, options = {}) => {
-	const tagKey = options.tagKey ?? "studioObject";
-	const rows = [];
-	walk(root, { skip: options.skip }, (object) => {
-		if (!isMesh(object) || !object.geometry.attributes.position) return;
-		const { nonFinite, zeroNormals } = check(object.geometry);
-		if (nonFinite > 0 || zeroNormals > 0) {
-			const under = tagOf(object, tagKey) ?? object.parent?.name ?? "";
-			rows.push(withHidden({
-				mesh: meshName(object),
-				under,
-				nonFinite,
-				zeroNormals
-			}, "object", object));
-		}
-	});
-	return rows;
-};
-//#endregion
-//#region src/triangles.ts
-const cost = (mesh) => {
-	if (isBatched(mesh)) return batchedTriangles(mesh);
-	const instances = isInstanced(mesh) ? mesh.count : 1;
-	return {
-		instances,
-		triangles: triangleCount(mesh.geometry) * instances
-	};
-};
-/**
-* Triangles one pass draws: visible meshes, instances counted, no frustum culling. A shadow pass
-* adds roughly as much again for each shadow-casting light.
-*/
-const countTriangles = (root, options = {}) => {
-	let total = 0;
-	walk(root, {
-		skip: options.skip,
-		visibleOnly: true
-	}, (object) => {
-		if (isMesh(object)) total += cost(object).triangles;
-	});
-	return total;
-};
-/** Every visible mesh, most triangles drawn first. */
-const listMeshes = (root, options = {}) => {
-	const rows = [];
-	walk(root, {
-		skip: options.skip,
-		visibleOnly: true
-	}, (object) => {
-		if (!isMesh(object)) return;
-		const { instances, triangles } = cost(object);
-		const row = {
-			name: meshName(object),
-			triangles: instances > 0 ? Math.round(triangles / instances) : 0,
-			instances,
-			total: triangles
-		};
-		rows.push(withHidden(row, "mesh", object));
-	});
-	return rows.sort((a, b) => b.total - a.total);
-};
-/**
-* Geometries by triangles drawn, hidden meshes included, most first. Name geometries
-* (`geometry.name`) to make this readable. Batches are left out: their shared buffer is not one
-* geometry; `listMeshes` counts them.
-*/
-const geometryCensus = (root, options = {}) => {
-	const rows = /* @__PURE__ */ new Map();
-	walk(root, { skip: options.skip }, (object) => {
-		if (!isMesh(object) || isBatched(object) || !object.geometry.attributes.position) return;
-		const geometry = object.geometry;
-		const key = geometry.name || `${geometry.type}:${geometry.uuid.slice(0, 6)}`;
-		const triangles = triangleCount(geometry);
-		const uses = isInstanced(object) ? object.count : 1;
-		const row = rows.get(key) ?? {
-			geometry: key,
-			uses: 0,
-			triangles,
-			total: 0
-		};
-		row.uses += uses;
-		row.total += triangles * uses;
-		rows.set(key, row);
-	});
-	return [...rows.values()].sort((a, b) => b.total - a.total);
-};
-//#endregion
-//#region src/z-fighting.ts
-/** Normals quantised to 1/40: neighbouring buckets are searched, so this only sets bucket size. */
-const QUANT = 40;
-/** Normals this aligned count as parallel (about 2.6°). */
-const PARALLEL = .999;
-const round = (value) => Math.round(value * 100) / 100;
-const labelOf = (part) => {
-	const centre = part.min.map((low, axis) => round((low + part.max[axis]) / 2));
-	return `${part.tag === null ? "" : `${part.tag}/`}${meshName(part.mesh)} [${materialName(part.mesh)}] @ (${centre.join(", ")})`;
-};
-/** Pairs of meshes that z-fight, most overlapping triangles first. `[]` is a pass. */
-const findZFighting = (root, options = {}) => {
-	const gap = options.gap ?? .004;
-	const self = options.self ?? false;
-	const tagKey = options.tagKey ?? "studioObject";
-	const tagged = options.tagged ?? hasTag(root, tagKey, options.skip);
-	root.updateWorldMatrix(true, true);
-	const parts = [];
-	const owner = [];
-	const planes = [];
-	const corners = [];
-	const keys = [];
-	const buckets = /* @__PURE__ */ new Map();
-	const keyOf = (x, y, z, d) => `${x},${y},${z},${d}`;
-	walk(root, { skip: options.skip }, (object) => {
-		if (!isMesh(object) || isInstanced(object) || isBatched(object) || !object.geometry.attributes.position) return;
-		const tag = tagOf(object, tagKey);
-		if (tagged && tag === null) return;
-		const part = parts.length;
-		const { index, attributes } = object.geometry;
-		const position = attributes.position;
-		const e = object.matrixWorld.elements;
-		const min = [
-			Infinity,
-			Infinity,
-			Infinity
-		];
-		const max = [
-			-Infinity,
-			-Infinity,
-			-Infinity
-		];
-		const count = index?.count ?? position.count;
-		const world = [
-			0,
-			0,
-			0,
-			0,
-			0,
-			0,
-			0,
-			0,
-			0
-		];
-		parts.push({
-			mesh: object,
-			tag,
-			min,
-			max
-		});
-		for (let k = 0; k + 2 < count; k += 3) {
-			for (let c = 0; c < 3; c += 1) {
-				const v = index?.getX(k + c) ?? k + c;
-				const x = position.getX(v);
-				const y = position.getY(v);
-				const z = position.getZ(v);
-				for (let axis = 0; axis < 3; axis += 1) {
-					const value = e[axis] * x + e[axis + 4] * y + e[axis + 8] * z + e[axis + 12];
-					world[c * 3 + axis] = value;
-					min[axis] = Math.min(min[axis], value);
-					max[axis] = Math.max(max[axis], value);
-				}
-			}
-			const [ax, ay, az, bx, by, bz, cx, cy, cz] = world;
-			const ux = bx - ax;
-			const uy = by - ay;
-			const uz = bz - az;
-			const vx = cx - ax;
-			const vy = cy - ay;
-			const vz = cz - az;
-			let nx = uy * vz - uz * vy;
-			let ny = uz * vx - ux * vz;
-			let nz = ux * vy - uy * vx;
-			const length = Math.hypot(nx, ny, nz);
-			if (!(length / 2 >= 1e-5)) continue;
-			nx /= length;
-			ny /= length;
-			nz /= length;
-			const d = nx * ax + ny * ay + nz * az;
-			const id = owner.length;
-			const key = [
-				Math.round(nx * QUANT),
-				Math.round(ny * QUANT),
-				Math.round(nz * QUANT),
-				Math.round(d / gap)
-			];
-			const bucket = buckets.get(keyOf(...key));
-			owner.push(part);
-			planes.push(nx, ny, nz, d);
-			corners.push(...world);
-			keys.push(key);
-			if (bucket) bucket.push(id);
-			else buckets.set(keyOf(...key), [id]);
-		}
-	});
-	const margin = gap / 2;
-	const flat = [
-		0,
-		0,
-		0,
-		0,
-		0,
-		0,
-		0,
-		0,
-		0,
-		0,
-		0,
-		0
-	];
-	const overlaps = (s, t) => {
-		const S = s * 9;
-		const T = t * 9;
-		let ux = corners[S + 3] - corners[S];
-		let uy = corners[S + 4] - corners[S + 1];
-		let uz = corners[S + 5] - corners[S + 2];
-		const length = Math.hypot(ux, uy, uz) || 1;
-		ux /= length;
-		uy /= length;
-		uz /= length;
-		const nx = planes[s * 4];
-		const ny = planes[s * 4 + 1];
-		const nz = planes[s * 4 + 2];
-		const vx = ny * uz - nz * uy;
-		const vy = nz * ux - nx * uz;
-		const vz = nx * uy - ny * ux;
-		for (let i = 0; i < 6; i += 1) {
-			const at = i < 3 ? S + i * 3 : T + (i - 3) * 3;
-			const px = corners[at];
-			const py = corners[at + 1];
-			const pz = corners[at + 2];
-			flat[i * 2] = px * ux + py * uy + pz * uz;
-			flat[i * 2 + 1] = px * vx + py * vy + pz * vz;
-		}
-		for (let edge = 0; edge < 6; edge += 1) {
-			const from = edge;
-			const to = edge < 3 ? (edge + 1) % 3 : 3 + (edge + 1) % 3;
-			const ex = flat[to * 2] - flat[from * 2];
-			const ey = flat[to * 2 + 1] - flat[from * 2 + 1];
-			const edgeLength = Math.hypot(ex, ey) || 1;
-			const axisX = -ey / edgeLength;
-			const axisY = ex / edgeLength;
-			let p0 = Infinity;
-			let p1 = -Infinity;
-			let q0 = Infinity;
-			let q1 = -Infinity;
-			for (let i = 0; i < 6; i += 1) {
-				const value = flat[i * 2] * axisX + flat[i * 2 + 1] * axisY;
-				if (i < 3) {
-					p0 = Math.min(p0, value);
-					p1 = Math.max(p1, value);
-				} else {
-					q0 = Math.min(q0, value);
-					q1 = Math.max(q1, value);
-				}
-			}
-			if (Math.min(p1, q1) - Math.max(p0, q0) < margin) return false;
-		}
-		return true;
-	};
-	const pairs = /* @__PURE__ */ new Map();
-	for (let s = 0; s < owner.length; s += 1) {
-		const [kx, ky, kz, kd] = keys[s];
-		for (let i = -1; i <= 1; i += 1) for (let j = -1; j <= 1; j += 1) for (let k = -1; k <= 1; k += 1) for (let l = -1; l <= 1; l += 1) for (const t of buckets.get(keyOf(kx + i, ky + j, kz + k, kd + l)) ?? []) {
-			const a = owner[s];
-			const b = owner[t];
-			if (t <= s || a === b && !self || planes[s * 4] * planes[t * 4] + planes[s * 4 + 1] * planes[t * 4 + 1] + planes[s * 4 + 2] * planes[t * 4 + 2] < PARALLEL || Math.abs(planes[s * 4 + 3] - planes[t * 4 + 3]) > gap || !overlaps(s, t)) continue;
-			const key = a < b ? `${a}:${b}` : `${b}:${a}`;
-			const pair = pairs.get(key) ?? {
-				a: Math.min(a, b),
-				b: Math.max(a, b),
-				triangles: 0
-			};
-			pair.triangles += 1;
-			pairs.set(key, pair);
-		}
-	}
-	return [...pairs.values()].sort((x, y) => y.triangles - x.triangles).map(({ a, b, triangles }) => withHidden({
-		a: labelOf(parts[a]),
-		b: labelOf(parts[b]),
-		triangles
-	}, "meshes", [parts[a].mesh, parts[b].mesh]));
-};
-//#endregion
-//#region src/audit-scene.ts
-/**
-* Every check at once, JSON-safe: what a test asserts on or a headless browser prints. A clean
-* scene has `zFighting` and `badGeometry` both `[]`.
-*/
-const auditScene = (root, options = {}) => {
-	const { skip, tagKey } = options;
-	return {
-		triangles: countTriangles(root, { skip }),
-		zFighting: findZFighting(root, options),
-		badGeometry: findBadGeometry(root, tagKey === void 0 ? { skip } : {
-			skip,
-			tagKey
-		}),
-		meshes: listMeshes(root, { skip }).slice(0, options.top ?? 10)
-	};
-};
-//#endregion
+import { a as listMeshes, i as geometryCensus, n as findZFighting, o as findBadGeometry, r as countTriangles, s as triangleCount, t as auditScene } from "./audit-scene-D5ZaENGZ.js";
 //#region src/patch.ts
 /** Swap `key` on `target` for `value`; the returned function puts back exactly what was there. */
 const patch = (target, key, value) => {